submission_id,user_id,create_at,language,score,problem_set_problem_id,problem_id,skill_id,code,response,time_consume,memory_consume
1591269972909817856,3dcf32868d7a750bb24733cc752e8b34486b532e90524d2606d8643387f183e4,2022-11-12 11:21:40,C++,0.0,1591148389985800192,1589816514637750272,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n    int n;string s;cin >> n >> s;\n    int x = 0,y = 0;\n    for(auto u : s){\n        if(u == '1')x++;\n        else y++;\n    }\n    cout << 2*min(x,y) << '\\n';\n}",WRONG_ANSWER,208,15904
1591273769673469952,3dcf32868d7a750bb24733cc752e8b34486b532e90524d2606d8643387f183e4,2022-11-12 11:36:45,C++,300.0,1591148389989994496,1591128862958940160,1049226928954454016,"#include \""bits/stdc++.h\""\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> PII;\n#define rep(i,a,n) for(int i = a; i < n; i++)\n#define per(i,n,a) for(int i = n-1; i >= a; i--)\n#define debug(a) printf(\""#: %d \"",a);\n#define fr first\n#define se second\n#define be begin()\n#define ed end()\n#define pb push_back\n#define mk make_pair\n#define pf printf\n#define ins insert\n#define sz size()\n//#define int long long\n#define mem(a,i) memset(a,i,sizeof (a))\n\n//char buf[1<<23],*p1=buf,*p2=buf;\n//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)\n//inline ll read()\n//{\n//    int s=0;\n//    char ch = getchar(),last;\n//    while(ch<'0'||ch>'9') last = ch, ch = getchar();\n//    while(ch>='0'&&ch<='9') s=(s<<1)+(s<<3)+(ch^48),ch=getchar();\n//    return last=='-'?-s:s;\n//}\n\ninline ll read(){\n    ll x = 0,f = 1;\n    char ch = getchar();\n    while(ch < '0'||ch > '9'){\n        if(ch == '-')\n            f = -1;\n        ch = getchar();\n    }\n    while(ch >= '0' && ch <= '9'){\n        x = (x << 1)+(x << 3)+(ch^48);\n        ch = getchar();\n    }\n    return x*f;\n}\nconst int MOD = 1000000007;\nll INF = 1e18;\nll gcd(ll a,ll b){\n    return b ? gcd(b,a%b) : a;\n}\nconst int N = 1e5 + 10;\n//struct edge{\n//    int to,next,w;\n//}eg[N];+\n//bool st[N];\n//void add(int u,int v,int w){\n//    eg[++tot].w = w;eg[tot].to = v;eg[tot].next = head[u];head[u] = tot;\n//}\n\n//int C[100010][3];\n//void Cn(){\n//    for(int i=0;i<100010;i++)for(int j = 0;j <= 2;j++)if(!j) C[i][j] = 1;else C[i][j] = (C[i-1][j]+C[i-1][j-1]);\n//}\nll lowbit(ll x){\n    return x%(-x);\n}\nvector<int>res[N];\nll ans[N];\nvoid dfs(int x){\n\n    for(auto i : res[x]){\n        dfs(i);ans[x] += ans[i];\n    }\n}\nvoid solve(){\n    ll n = read();\n    rep(i,1,n+1)ans[i] = 1;\n    rep(i,2,n+1){\n        ll now = read();\n        res[now].pb(i);\n    }\n    dfs(1);\n    rep(i,1,n+1)printf(\""%lld \"",ans[i]);\n}\nsigned  main(){\n//    ll t = read();\n//    while(t--)\n        solve();\n}\n",ACCEPTED,37,2820
1591275023472594944,3dcf32868d7a750bb24733cc752e8b34486b532e90524d2606d8643387f183e4,2022-11-12 11:41:44,C++,300.0,1591148389989994497,1591129345182261248,1049226928954454016,"#include \""bits/stdc++.h\""\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> PII;\n#define rep(i,a,n) for(int i = a; i < n; i++)\n#define per(i,n,a) for(int i = n-1; i >= a; i--)\n#define debug(a) printf(\""#: %d \"",a);\n#define fr first\n#define se second\n#define be begin()\n#define ed end()\n#define pb push_back\n#define mk make_pair\n#define pf printf\n#define ins insert\n#define sz size()\n//#define int long long\n#define mem(a,i) memset(a,i,sizeof (a))\n\n//char buf[1<<23],*p1=buf,*p2=buf;\n//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)\n//inline ll read()\n//{\n//    int s=0;\n//    char ch = getchar(),last;\n//    while(ch<'0'||ch>'9') last = ch, ch = getchar();\n//    while(ch>='0'&&ch<='9') s=(s<<1)+(s<<3)+(ch^48),ch=getchar();\n//    return last=='-'?-s:s;\n//}\n\ninline ll read(){\n    ll x = 0,f = 1;\n    char ch = getchar();\n    while(ch < '0'||ch > '9'){\n        if(ch == '-')\n            f = -1;\n        ch = getchar();\n    }\n    while(ch >= '0' && ch <= '9'){\n        x = (x << 1)+(x << 3)+(ch^48);\n        ch = getchar();\n    }\n    return x*f;\n}\nconst int MOD = 1000000007;\nll INF = 1e18;\nll gcd(ll a,ll b){\n    return b ? gcd(b,a%b) : a;\n}\nconst int N = 1e5 + 10;\n//struct edge{\n//    int to,next,w;\n//}eg[N];+\n//bool st[N];\n//void add(int u,int v,int w){\n//    eg[++tot].w = w;eg[tot].to = v;eg[tot].next = head[u];head[u] = tot;\n//}\n\n//int C[100010][3];\n//void Cn(){\n//    for(int i=0;i<100010;i++)for(int j = 0;j <= 2;j++)if(!j) C[i][j] = 1;else C[i][j] = (C[i-1][j]+C[i-1][j-1]);\n//}\nll lowbit(ll x){\n    return x%(-x);\n}\nvector<int>res[N];\nll ans[N];\nvoid dfs(int x){\n\n    for(auto i : res[x]){\n        dfs(i);ans[x] += ans[i];\n    }\n}\nll a[N],dp[N];\nvoid solve(){\n   ll n = read();\n   rep(i,1,n+1)a[i] = read() - 5;\n   dp[1] = a[1],dp[2] = a[2] + a[1];\n   rep(i,3,n+1){\n     dp[i] = max(dp[i-1] + a[i],dp[i-3] + a[i]);\n   }\n   cout << dp[n] << \""\\n\"";\n}\nsigned  main(){\n//    ll t = read();\n//    while(t--)\n        solve();\n}\n",ACCEPTED,29,3012
1591275202955251712,3dcf32868d7a750bb24733cc752e8b34486b532e90524d2606d8643387f183e4,2022-11-12 11:42:27,Python,300.0,1591148389989994498,1591130116607045632,1049226928954454016,print(60),ACCEPTED,19,2876
1591275510842306560,3dcf32868d7a750bb24733cc752e8b34486b532e90524d2606d8643387f183e4,2022-11-12 11:43:40,Python,0.0,1591148389989994500,1591131464941563904,1049226928954454016,"#include \""bits/stdc++.h\""\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> PII;\n#define rep(i,a,n) for(int i = a; i < n; i++)\n#define per(i,n,a) for(int i = n-1; i >= a; i--)\n#define debug(a) printf(\""#: %d \"",a);\n#define fr first\n#define se second\n#define be begin()\n#define ed end()\n#define pb push_back\n#define mk make_pair\n#define pf printf\n#define ins insert\n#define sz size()\n//#define int long long\n#define mem(a,i) memset(a,i,sizeof (a))\n\n//char buf[1<<23],*p1=buf,*p2=buf;\n//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)\n//inline ll read()\n//{\n//    int s=0;\n//    char ch = getchar(),last;\n//    while(ch<'0'||ch>'9') last = ch, ch = getchar();\n//    while(ch>='0'&&ch<='9') s=(s<<1)+(s<<3)+(ch^48),ch=getchar();\n//    return last=='-'?-s:s;\n//}\n\ninline ll read(){\n    ll x = 0,f = 1;\n    char ch = getchar();\n    while(ch < '0'||ch > '9'){\n        if(ch == '-')\n            f = -1;\n        ch = getchar();\n    }\n    while(ch >= '0' && ch <= '9'){\n        x = (x << 1)+(x << 3)+(ch^48);\n        ch = getchar();\n    }\n    return x*f;\n}\nconst int MOD = 1000000007;\nll INF = 1e18;\nll gcd(ll a,ll b){\n    return b ? gcd(b,a%b) : a;\n}\nconst int N = 1e5 + 10;\n//struct edge{\n//    int to,next,w;\n//}eg[N];+\n//bool st[N];\n//void add(int u,int v,int w){\n//    eg[++tot].w = w;eg[tot].to = v;eg[tot].next = head[u];head[u] = tot;\n//}\n\n//int C[100010][3];\n//void Cn(){\n//    for(int i=0;i<100010;i++)for(int j = 0;j <= 2;j++)if(!j) C[i][j] = 1;else C[i][j] = (C[i-1][j]+C[i-1][j-1]);\n//}\nll lowbit(ll x){\n    return x%(-x);\n}\nvector<int>res[N];\nll ans[N];\nvoid dfs(int x){\n\n    for(auto i : res[x]){\n        dfs(i);ans[x] += ans[i];\n    }\n}\nll a[N],dp[N];\nvoid solve(){\n    ll p =read(), q = read(), r = read();\n    cout << min({p+q,q+r,r+p}) << '\\n';\n}\nsigned  main(){\n//    ll t = read();\n//    while(t--)\n        solve();\n}\n",NON_ZERO_EXIT_CODE,17,2884
1591275545281761280,3dcf32868d7a750bb24733cc752e8b34486b532e90524d2606d8643387f183e4,2022-11-12 11:43:49,C++,300.0,1591148389989994500,1591131464941563904,1049226928954454016,"#include \""bits/stdc++.h\""\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> PII;\n#define rep(i,a,n) for(int i = a; i < n; i++)\n#define per(i,n,a) for(int i = n-1; i >= a; i--)\n#define debug(a) printf(\""#: %d \"",a);\n#define fr first\n#define se second\n#define be begin()\n#define ed end()\n#define pb push_back\n#define mk make_pair\n#define pf printf\n#define ins insert\n#define sz size()\n//#define int long long\n#define mem(a,i) memset(a,i,sizeof (a))\n\n//char buf[1<<23],*p1=buf,*p2=buf;\n//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)\n//inline ll read()\n//{\n//    int s=0;\n//    char ch = getchar(),last;\n//    while(ch<'0'||ch>'9') last = ch, ch = getchar();\n//    while(ch>='0'&&ch<='9') s=(s<<1)+(s<<3)+(ch^48),ch=getchar();\n//    return last=='-'?-s:s;\n//}\n\ninline ll read(){\n    ll x = 0,f = 1;\n    char ch = getchar();\n    while(ch < '0'||ch > '9'){\n        if(ch == '-')\n            f = -1;\n        ch = getchar();\n    }\n    while(ch >= '0' && ch <= '9'){\n        x = (x << 1)+(x << 3)+(ch^48);\n        ch = getchar();\n    }\n    return x*f;\n}\nconst int MOD = 1000000007;\nll INF = 1e18;\nll gcd(ll a,ll b){\n    return b ? gcd(b,a%b) : a;\n}\nconst int N = 1e5 + 10;\n//struct edge{\n//    int to,next,w;\n//}eg[N];+\n//bool st[N];\n//void add(int u,int v,int w){\n//    eg[++tot].w = w;eg[tot].to = v;eg[tot].next = head[u];head[u] = tot;\n//}\n\n//int C[100010][3];\n//void Cn(){\n//    for(int i=0;i<100010;i++)for(int j = 0;j <= 2;j++)if(!j) C[i][j] = 1;else C[i][j] = (C[i-1][j]+C[i-1][j-1]);\n//}\nll lowbit(ll x){\n    return x%(-x);\n}\nvector<int>res[N];\nll ans[N];\nvoid dfs(int x){\n\n    for(auto i : res[x]){\n        dfs(i);ans[x] += ans[i];\n    }\n}\nll a[N],dp[N];\nvoid solve(){\n    ll p =read(), q = read(), r = read();\n    cout << min({p+q,q+r,r+p}) << '\\n';\n}\nsigned  main(){\n//    ll t = read();\n//    while(t--)\n        solve();\n}\n",ACCEPTED,31,2880
1591281396725907456,3dcf32868d7a750bb24733cc752e8b34486b532e90524d2606d8643387f183e4,2022-11-12 12:07:04,C++,300.0,1591148389989994501,1591131955016622080,1049226928954454016,"#include \""bits/stdc++.h\""\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> PII;\n#define rep(i,a,n) for(int i = a; i < n; i++)\n#define per(i,n,a) for(int i = n-1; i >= a; i--)\n#define debug(a) printf(\""#: %d \"",a);\n#define fr first\n#define se second\n#define be begin()\n#define ed end()\n#define pb push_back\n#define mk make_pair\n#define pf printf\n#define ins insert\n#define sz size()\n#define int long long\n#define mem(a,i) memset(a,i,sizeof (a))\n\n//char buf[1<<23],*p1=buf,*p2=buf;\n//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)\n//inline int read()\n//{\n//    int s=0;\n//    char ch = getchar(),last;\n//    while(ch<'0'||ch>'9') last = ch, ch = getchar();\n//    while(ch>='0'&&ch<='9') s=(s<<1)+(s<<3)+(ch^48),ch=getchar();\n//    return last=='-'?-s:s;\n//}\n\ninline int read() {\n\n    int x = 0,f = 1;\n    char ch = getchar();\n    while(ch<'0'||ch>'9') {\n        if(ch=='-')\n            f=-1;\n        ch = getchar();\n    }\n    while(ch>='0'&&ch<='9') {\n        x=(x<<1)+(x<<3)+(ch^48);\n        ch = getchar();\n    }\n    return x*f;\n\n}\nconst int MOD = 998244353;\nll INF = 1e18;\nll gcd(ll a,ll b) {\n    return b ? gcd(b,a%b) : a;\n}\nconst int N = 2e5+ 10;\n//struct edge{\n//    int to,next,w;\n//}eg[N];\n//int head[N],tot,dist[N];\n//bool st[N];\n//void add(int u,int v,int w){\n//    eg[++tot].w = w;\n//    eg[tot].to = v;\n//    eg[tot].next = head[u];\n//    head[u] = tot;\n//}\n//priority_queue<PII ,vector<PII> ,greater<PII> >q;\nbool cmp(int x,int y) {\n    return x > y;\n}\nint a[N];\nvoid solve() {\n    int n = read(),mi = INF;\n    rep(i,1,n+1)a[i] = read(),mi = min(a[i],mi);\n    int ans = 0;\n    rep(i,1,n+1) {\n        if(a[i] >= mi*2) {\n            int now = a[i]/(mi*2-1) - 1;\n            if(a[i]%(mi*2-1)!=0) {\n                ans++;\n            }\n            ans+=now;\n        }\n    }\n    cout << ans << '\\n';\n\n}\nsigned  main() {\n    int t = read();\n    while (t--)\n        solve();\n    return  0;\n}\n",ACCEPTED,15,476
1591281938864865280,3dcf32868d7a750bb24733cc752e8b34486b532e90524d2606d8643387f183e4,2022-11-12 12:09:13,C++,300.0,1591148389989994502,1591132307937943552,1049226928954454016,"#include \""bits/stdc++.h\""\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> PII;\n#define rep(i,a,n) for(int i = a; i < n; i++)\n#define per(i,n,a) for(int i = n-1; i >= a; i--)\n#define debug(a) printf(\""#: %d \"",a);\n#define fr first\n#define se second\n#define be begin()\n#define ed end()\n#define pb push_back\n#define mk make_pair\n#define pf printf\n#define ins insert\n#define sz size()\n#define int long long\n#define mem(a,i) memset(a,i,sizeof (a))\n\n//char buf[1<<23],*p1=buf,*p2=buf;\n//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)\n//inline int read()\n//{\n//    int s=0;\n//    char ch = getchar(),last;\n//    while(ch<'0'||ch>'9') last = ch, ch = getchar();\n//    while(ch>='0'&&ch<='9') s=(s<<1)+(s<<3)+(ch^48),ch=getchar();\n//    return last=='-'?-s:s;\n//}\n\ninline int read() {\n\n    int x = 0,f = 1;\n    char ch = getchar();\n    while(ch<'0'||ch>'9') {\n        if(ch=='-')\n            f=-1;\n        ch = getchar();\n    }\n    while(ch>='0'&&ch<='9') {\n        x=(x<<1)+(x<<3)+(ch^48);\n        ch = getchar();\n    }\n    return x*f;\n\n}\nconst int MOD = 998244353;\nll INF = 1e18;\nll gcd(ll a,ll b) {\n    return b ? gcd(b,a%b) : a;\n}\nconst int N = 2e5+ 10;\n//struct edge{\n//    int to,next,w;\n//}eg[N];\n//int head[N],tot,dist[N];\n//bool st[N];\n//void add(int u,int v,int w){\n//    eg[++tot].w = w;\n//    eg[tot].to = v;\n//    eg[tot].next = head[u];\n//    head[u] = tot;\n//}\n//priority_queue<PII ,vector<PII> ,greater<PII> >q;\nbool cmp(int x,int y) {\n    return x > y;\n}\nint a[N];\nvoid solve() {\n    ll n = read();\n    rep(i,1,n+1)a[i] = read();\n    int x = 0,y = 0,ans = 0;\n    for(int i = 2;i < n;i++){\n        if(a[i] > a[i-1] and x == 1){\n            x = 0;ans++;\n        }\n        if(a[i] > a[i+1])x = 1;\n    }\n    cout << ans << '\\n';\n}\nsigned  main() {\n//    int t = read();\n//    while (t--)\n        solve();\n    return  0;\n}\n",ACCEPTED,17,468
1591284248273813504,3dcf32868d7a750bb24733cc752e8b34486b532e90524d2606d8643387f183e4,2022-11-12 12:18:24,C++,300.0,1591148389989994503,1591132482555211776,1049226928954454016,"#include \""bits/stdc++.h\""\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> PII;\n#define rep(i,a,n) for(int i = a; i < n; i++)\n#define per(i,n,a) for(int i = n-1; i >= a; i--)\n#define debug(a) printf(\""#: %d \"",a);\n#define fr first\n#define se second\n#define be begin()\n#define ed end()\n#define pb push_back\n#define mk make_pair\n#define pf printf\n#define ins insert\n#define sz size()\n//#define int long long\n#define mem(a,i) memset(a,i,sizeof (a))\n\n//char buf[1<<23],*p1=buf,*p2=buf;\n//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)\n//inline int read()\n//{\n//    int s=0;\n//    char ch = getchar(),last;\n//    while(ch<'0'||ch>'9') last = ch, ch = getchar();\n//    while(ch>='0'&&ch<='9') s=(s<<1)+(s<<3)+(ch^48),ch=getchar();\n//    return last=='-'?-s:s;\n//}\n\ninline int read() {\n\n    int x = 0,f = 1;\n    char ch = getchar();\n    while(ch<'0'||ch>'9') {\n        if(ch=='-')\n            f=-1;\n        ch = getchar();\n    }\n    while(ch>='0'&&ch<='9') {\n        x=(x<<1)+(x<<3)+(ch^48);\n        ch = getchar();\n    }\n    return x*f;\n\n}\nconst int MOD = 998244353;\nll INF = 1e18;\nll gcd(ll a,ll b) {\n    return b ? gcd(b,a%b) : a;\n}\nconst int N = 2e5+ 10;\n//struct edge{\n//    int to,next,w;\n//}eg[N];\n//int head[N],tot,dist[N];\n//bool st[N];\n//void add(int u,int v,int w){\n//    eg[++tot].w = w;\n//    eg[tot].to = v;\n//    eg[tot].next = head[u];\n//    head[u] = tot;\n//}\n//priority_queue<PII ,vector<PII> ,greater<PII> >q;\nbool cmp(int x,int y) {\n    return x > y;\n}\nint a[N];\nvoid solve() {\n    ll n = read(),ans = 0;\n    rep(i,1,n+1)a[i] = read();\n    for(int i = 1;i <= n; i++){\n        int now  = a[i],cnt = 0;\n        int j = i-1,k = j+1;\n        while (j > 0 or k <= n){\n            if(a[j] >= now)cnt++;\n            else j = 0;\n            if(a[k] >= now)cnt++;\n            else k = n+1;\n            j--,k++;\n        }\n        ans = max(ans,(ll)cnt*now);\n    }\n   cout << ans << '\\n';\n}\nsigned  main() {\n\n        solve();\n    return  0;\n}\n",ACCEPTED,19,384
1591284741335224320,3dcf32868d7a750bb24733cc752e8b34486b532e90524d2606d8643387f183e4,2022-11-12 12:20:21,C++,0.0,1591148389985800192,1589816514637750272,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n    int n;string s;cin >> n >> s;\n    int x = 0,y = 0;\n    for(auto u : s){\n        if(u == '1')x++;\n        else y++;\n    }\n    cout << 2*min(x,y) << '\\n';\n}",WRONG_ANSWER,197,15928
1591284840891219968,3dcf32868d7a750bb24733cc752e8b34486b532e90524d2606d8643387f183e4,2022-11-12 12:20:45,C++,0.0,1591148389985800192,1589816514637750272,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n    int n;string s;cin >> n >> s;\n    int x = 0,y = 0;\n    for(auto u : s){\n        if(u == '1')x++;\n        else y++;\n    }\n    cout << 2*min(x,y) << '\\n';\n    return 0;\n}",WRONG_ANSWER,199,16124
1591286144619315200,3dcf32868d7a750bb24733cc752e8b34486b532e90524d2606d8643387f183e4,2022-11-12 12:25:56,C++,0.0,1591148389985800193,1589906790446387200,1049226928954454016,"#include \""bits/stdc++.h\""\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> PII;\n#define rep(i,a,n) for(int i = a; i < n; i++)\n#define per(i,n,a) for(int i = n-1; i >= a; i--)\n#define debug(a) printf(\""#: %d \"",a);\n#define fr first\n#define se second\n#define be begin()\n#define ed end()\n#define pb push_back\n#define mk make_pair\n#define pf printf\n#define ins insert\n#define sz size()\n//#define int long long\n#define mem(a,i) memset(a,i,sizeof (a))\n\n//char buf[1<<23],*p1=buf,*p2=buf;\n//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)\n//inline int read()\n//{\n//    int s=0;\n//    char ch = getchar(),last;\n//    while(ch<'0'||ch>'9') last = ch, ch = getchar();\n//    while(ch>='0'&&ch<='9') s=(s<<1)+(s<<3)+(ch^48),ch=getchar();\n//    return last=='-'?-s:s;\n//}\n\ninline int read() {\n\n    int x = 0,f = 1;\n    char ch = getchar();\n    while(ch<'0'||ch>'9') {\n        if(ch=='-')\n            f=-1;\n        ch = getchar();\n    }\n    while(ch>='0'&&ch<='9') {\n        x=(x<<1)+(x<<3)+(ch^48);\n        ch = getchar();\n    }\n    return x*f;\n\n}\nconst int MOD = 998244353;\nll INF = 1e18;\nll gcd(ll a,ll b) {\n    return b ? gcd(b,a%b) : a;\n}\nconst int N = 2e5+ 10;\n//struct edge{\n//    int to,next,w;\n//}eg[N];\n//int head[N],tot,dist[N];\n//bool st[N];\n//void add(int u,int v,int w){\n//    eg[++tot].w = w;\n//    eg[tot].to = v;\n//    eg[tot].next = head[u];\n//    head[u] = tot;\n//}\n//priority_queue<PII ,vector<PII> ,greater<PII> >q;\nbool cmp(int x,int y) {\n    return x > y;\n}\nll a[N];\nvoid solve(){\n    ll n = read(),mx = 0,mi = INF;\n    rep(i,1,n+1){\n        a[i] = read();\n        mx = max(mx,a[i]),mi = min(a[i],mi);\n    }\n    sort(a+1,a+1+n);\n\n    ll ans = 0;\n    rep(i,2,n){\n        ll now = max(a[i] - a[i-1] + a[i] - a[1],a[n] - a[i] + a[i+1] - a[i]);\n        ans = max(ans,now);\n    }\n    ans = max(a[n] - a[n-1] + a[n] - a[1],ans);\n    ans = max(a[n] - a[1] + a[2] - a[1],ans);\n\n    cout << ans << '\\n';\n}\nsigned  main() {\n    ll t = read();\n    while (t--)\n    solve();\n}\n",TIME_LIMIT_EXCEEDED,400,324
1591286235748962304,3dcf32868d7a750bb24733cc752e8b34486b532e90524d2606d8643387f183e4,2022-11-12 12:26:17,C++,0.0,1591148389985800193,1589906790446387200,1049226928954454016,"#include \""bits/stdc++.h\""\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> PII;\n#define rep(i,a,n) for(int i = a; i < n; i++)\n#define per(i,n,a) for(int i = n-1; i >= a; i--)\n#define debug(a) printf(\""#: %d \"",a);\n#define fr first\n#define se second\n#define be begin()\n#define ed end()\n#define pb push_back\n#define mk make_pair\n#define pf printf\n#define ins insert\n#define sz size()\n//#define int long long\n#define mem(a,i) memset(a,i,sizeof (a))\n\n//char buf[1<<23],*p1=buf,*p2=buf;\n//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)\n//inline ll read()\n//{\n//    int s=0;\n//    char ch = getchar(),last;\n//    while(ch<'0'||ch>'9') last = ch, ch = getchar();\n//    while(ch>='0'&&ch<='9') s=(s<<1)+(s<<3)+(ch^48),ch=getchar();\n//    return last=='-'?-s:s;\n//}\n\ninline ll read(){\n    ll x = 0,f = 1;\n    char ch = getchar();\n    while(ch < '0'||ch > '9'){\n        if(ch == '-')\n            f = -1;\n        ch = getchar();\n    }\n    while(ch >= '0' && ch <= '9'){\n        x = (x << 1)+(x << 3)+(ch^48);\n        ch = getchar();\n    }\n    return x*f;\n}\nconst int MOD = 998244353;\nll INF = 1e18;\nll gcd(ll a,ll b){\n    return b ? gcd(b,a%b) : a;\n}\nconst int N = 2e5 + 10;\n//struct edge{\n//    int to,next,w;\n//}eg[N];\n//int head[N],tot,dist[N];\n//bool st[N];\n//void add(int u,int v,int w){\n//    eg[++tot].w = w;eg[tot].to = v;eg[tot].next = head[u];head[u] = tot;\n//}\n\n//int C[1100][6];\n//void Cn(){\n//    for(int i=0;i<12;i++)for(int j = 0;j <= min(i,11);j++)if(!j) C[i][j] = 1;else C[i][j] = (C[i-1][j]+C[i-1][j-1]);\n//}\nll lowbit(ll x){\n    return x%(-x);\n}\n\n\nll a[N];\nvoid solve(){\n    ll n = read(),mx = 0,mi = INF;\n    rep(i,1,n+1){\n        a[i] = read();\n        mx = max(mx,a[i]),mi = min(a[i],mi);\n    }\n    sort(a+1,a+1+n);\n\n    ll ans = 0;\n    rep(i,2,n){\n        ll now = max(a[i] - a[i-1] + a[i] - a[1],a[n] - a[i] + a[i+1] - a[i]);\n        ans = max(ans,now);\n    }\n    ans = max(a[n] - a[n-1] + a[n] - a[1],ans);\n    ans = max(a[n] - a[1] + a[2] - a[1],ans);\n\n    cout << ans << '\\n';\n}\nsigned  main(){\n\n    ll t = read();\n    while (t--)\n        solve();\n}\n\n\n\n\n ",COMPILE_ERROR,0,0
1591286285019426816,3dcf32868d7a750bb24733cc752e8b34486b532e90524d2606d8643387f183e4,2022-11-12 12:26:29,C++,0.0,1591148389985800193,1589906790446387200,1049226928954454016,"#include \""bits/stdc++.h\""\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> PII;\n#define rep(i,a,n) for(int i = a; i < n; i++)\n#define per(i,n,a) for(int i = n-1; i >= a; i--)\n#define debug(a) printf(\""#: %d \"",a);\n#define fr first\n#define se second\n#define be begin()\n#define ed end()\n#define pb push_back\n#define mk make_pair\n#define pf printf\n#define ins insert\n#define sz size()\n//#define int long long\n#define mem(a,i) memset(a,i,sizeof (a))\n\n//char buf[1<<23],*p1=buf,*p2=buf;\n//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)\n//inline ll read()\n//{\n//    int s=0;\n//    char ch = getchar(),last;\n//    while(ch<'0'||ch>'9') last = ch, ch = getchar();\n//    while(ch>='0'&&ch<='9') s=(s<<1)+(s<<3)+(ch^48),ch=getchar();\n//    return last=='-'?-s:s;\n//}\n\ninline ll read(){\n    ll x = 0,f = 1;\n    char ch = getchar();\n    while(ch < '0'||ch > '9'){\n        if(ch == '-')\n            f = -1;\n        ch = getchar();\n    }\n    while(ch >= '0' && ch <= '9'){\n        x = (x << 1)+(x << 3)+(ch^48);\n        ch = getchar();\n    }\n    return x*f;\n}\nconst int MOD = 998244353;\nll INF = 1e18;\nll gcd(ll a,ll b){\n    return b ? gcd(b,a%b) : a;\n}\nconst int N = 2e5 + 10;\n//struct edge{\n//    int to,next,w;\n//}eg[N];\n//int head[N],tot,dist[N];\n//bool st[N];\n//void add(int u,int v,int w){\n//    eg[++tot].w = w;eg[tot].to = v;eg[tot].next = head[u];head[u] = tot;\n//}\n\n//int C[1100][6];\n//void Cn(){\n//    for(int i=0;i<12;i++)for(int j = 0;j <= min(i,11);j++)if(!j) C[i][j] = 1;else C[i][j] = (C[i-1][j]+C[i-1][j-1]);\n//}\nll lowbit(ll x){\n    return x%(-x);\n}\n\n\nll a[N];\nvoid solve(){\n    ll n = read(),mx = 0,mi = INF;\n    rep(i,1,n+1){\n        a[i] = read();\n        mx = max(mx,a[i]),mi = min(a[i],mi);\n    }\n    sort(a+1,a+1+n);\n\n    ll ans = 0;\n    rep(i,2,n){\n        ll now = max(a[i] - a[i-1] + a[i] - a[1],a[n] - a[i] + a[i+1] - a[i]);\n        ans = max(ans,now);\n    }\n    ans = max(a[n] - a[n-1] + a[n] - a[1],ans);\n    ans = max(a[n] - a[1] + a[2] - a[1],ans);\n\n    cout << ans << '\\n';\n}\nsigned  main(){\n\n    ll t = read();\n    while (t--)\n        solve();\n}\n",TIME_LIMIT_EXCEEDED,400,324
1591287148102332416,3dcf32868d7a750bb24733cc752e8b34486b532e90524d2606d8643387f183e4,2022-11-12 12:29:55,C++,0.0,1591148389985800193,1589906790446387200,1049226928954454016,"#include \""bits/stdc++.h\""\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> PII;\n#define rep(i,a,n) for(int i = a; i < n; i++)\n#define per(i,n,a) for(int i = n-1; i >= a; i--)\n#define debug(a) printf(\""#: %d \"",a);\n#define fr first\n#define se second\n#define be begin()\n#define ed end()\n#define pb push_back\n#define mk make_pair\n#define pf printf\n#define ins insert\n#define sz size()\n//#define int long long\n#define mem(a,i) memset(a,i,sizeof (a))\n\n//char buf[1<<23],*p1=buf,*p2=buf;\n//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)\n//inline ll read()\n//{\n//    int s=0;\n//    char ch = getchar(),last;\n//    while(ch<'0'||ch>'9') last = ch, ch = getchar();\n//    while(ch>='0'&&ch<='9') s=(s<<1)+(s<<3)+(ch^48),ch=getchar();\n//    return last=='-'?-s:s;\n//}\n\ninline ll read(){\n    ll x = 0,f = 1;\n    char ch = getchar();\n    while(ch < '0'||ch > '9'){\n        if(ch == '-')\n            f = -1;\n        ch = getchar();\n    }\n    while(ch >= '0' && ch <= '9'){\n        x = (x << 1)+(x << 3)+(ch^48);\n        ch = getchar();\n    }\n    return x*f;\n}\nconst int MOD = 998244353;\nll INF = 1e18;\nll gcd(ll a,ll b){\n    return b ? gcd(b,a%b) : a;\n}\nconst int N = 2e5 + 10;\n//struct edge{\n//    int to,next,w;\n//}eg[N];\n//int head[N],tot,dist[N];\n//bool st[N];\n//void add(int u,int v,int w){\n//    eg[++tot].w = w;eg[tot].to = v;eg[tot].next = head[u];head[u] = tot;\n//}\n\n//int C[1100][6];\n//void Cn(){\n//    for(int i=0;i<12;i++)for(int j = 0;j <= min(i,11);j++)if(!j) C[i][j] = 1;else C[i][j] = (C[i-1][j]+C[i-1][j-1]);\n//}\nll lowbit(ll x){\n    return x%(-x);\n}\n\n\nll a[N];\nvoid solve(){\n    ll n = read(),mx = 0,mi = INF;\n    rep(i,1,n+1){\n        a[i] = read();\n        mx = max(mx,a[i]),mi = min(a[i],mi);\n    }\n    sort(a+1,a+1+n);\n\n    ll ans = 0;\n    rep(i,2,n){\n        ll now = max(a[i] - a[i-1] + a[i] - a[1],a[n] - a[i] + a[i+1] - a[i]);\n        ans = max(ans,now);\n    }\n    ans = max(a[n] - a[n-1] + a[n] - a[1],ans);\n    ans = max(a[n] - a[1] + a[2] - a[1],ans);\n\n    cout << ans << '\\n';\n}\nsigned  main(){\n\n    ll t = read();\n    while (t--)\n        solve();\n}\n\n\n\n",TIME_LIMIT_EXCEEDED,1000,404
1591287418530107392,3dcf32868d7a750bb24733cc752e8b34486b532e90524d2606d8643387f183e4,2022-11-12 12:30:59,C++,0.0,1591148389985800193,1589906790446387200,1049226928954454016,"#include \""bits/stdc++.h\""\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> PII;\n#define rep(i,a,n) for(int i = a; i < n; i++)\n#define per(i,n,a) for(int i = n-1; i >= a; i--)\n#define debug(a) printf(\""#: %d \"",a);\n#define fr first\n#define se second\n#define be begin()\n#define ed end()\n#define pb push_back\n#define mk make_pair\n#define pf printf\n#define ins insert\n#define sz size()\n//#define int long long\n#define mem(a,i) memset(a,i,sizeof (a))\n\n//char buf[1<<23],*p1=buf,*p2=buf;\n//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)\n//inline ll read()\n//{\n//    int s=0;\n//    char ch = getchar(),last;\n//    while(ch<'0'||ch>'9') last = ch, ch = getchar();\n//    while(ch>='0'&&ch<='9') s=(s<<1)+(s<<3)+(ch^48),ch=getchar();\n//    return last=='-'?-s:s;\n//}\n\ninline ll read(){\n    ll x = 0,f = 1;\n    char ch = getchar();\n    while(ch < '0'||ch > '9'){\n        if(ch == '-')\n            f = -1;\n        ch = getchar();\n    }\n    while(ch >= '0' && ch <= '9'){\n        x = (x << 1)+(x << 3)+(ch^48);\n        ch = getchar();\n    }\n    return x*f;\n}\nconst int MOD = 998244353;\nll INF = 1e18;\nll gcd(ll a,ll b){\n    return b ? gcd(b,a%b) : a;\n}\nconst int N = 2e5 + 10;\n//struct edge{\n//    int to,next,w;\n//}eg[N];\n//int head[N],tot,dist[N];\n//bool st[N];\n//void add(int u,int v,int w){\n//    eg[++tot].w = w;eg[tot].to = v;eg[tot].next = head[u];head[u] = tot;\n//}\n\n//int C[1100][6];\n//void Cn(){\n//    for(int i=0;i<12;i++)for(int j = 0;j <= min(i,11);j++)if(!j) C[i][j] = 1;else C[i][j] = (C[i-1][j]+C[i-1][j-1]);\n//}\nll lowbit(ll x){\n    return x%(-x);\n}\n\n\nll a[N];\nvoid solve(){\n    ll n = read(),mx = 0,mi = INF;\n    rep(i,1,n+1){\n        a[i] = read();\n        mx = max(mx,a[i]),mi = min(a[i],mi);\n    }\n    sort(a+1,a+1+n);\n\n    ll ans = 0;\n    rep(i,2,n){\n        ll now = max(a[i] - a[i-1] + a[i] - a[1],a[n] - a[i] + a[i+1] - a[i]);\n        ans = max(ans,now);\n    }\n    ans = max(a[n] - a[n-1] + a[n] - a[1],ans);\n    ans = max(a[n] - a[1] + a[2] - a[1],ans);\n\n    cout << ans << '\\n';\n}\nsigned  main(){\n\n    ll t = read();\n    while (t--)\n        solve();\n}\n\n\n\n",TIME_LIMIT_EXCEEDED,10000,448
1591287737666310144,3dcf32868d7a750bb24733cc752e8b34486b532e90524d2606d8643387f183e4,2022-11-12 12:32:16,C++,0.0,1591148389985800193,1589906790446387200,1049226928954454016,"#include \""bits/stdc++.h\""\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> PII;\n#define rep(i,a,n) for(int i = a; i < n; i++)\n#define per(i,n,a) for(int i = n-1; i >= a; i--)\n#define debug(a) printf(\""#: %d \"",a);\n#define fr first\n#define se second\n#define be begin()\n#define ed end()\n#define pb push_back\n#define mk make_pair\n#define pf printf\n#define ins insert\n#define sz size()\n//#define int long long\n#define mem(a,i) memset(a,i,sizeof (a))\n\n//char buf[1<<23],*p1=buf,*p2=buf;\n//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)\n//inline ll read()\n//{\n//    int s=0;\n//    char ch = getchar(),last;\n//    while(ch<'0'||ch>'9') last = ch, ch = getchar();\n//    while(ch>='0'&&ch<='9') s=(s<<1)+(s<<3)+(ch^48),ch=getchar();\n//    return last=='-'?-s:s;\n//}\n\ninline ll read(){\n    ll x = 0,f = 1;\n    char ch = getchar();\n    while(ch < '0'||ch > '9'){\n        if(ch == '-')\n            f = -1;\n        ch = getchar();\n    }\n    while(ch >= '0' && ch <= '9'){\n        x = (x << 1)+(x << 3)+(ch^48);\n        ch = getchar();\n    }\n    return x*f;\n}\nconst int MOD = 998244353;\nll INF = 1e18;\nll gcd(ll a,ll b){\n    return b ? gcd(b,a%b) : a;\n}\nconst int N = 2e5 + 10;\n//struct edge{\n//    int to,next,w;\n//}eg[N];\n//int head[N],tot,dist[N];\n//bool st[N];\n//void add(int u,int v,int w){\n//    eg[++tot].w = w;eg[tot].to = v;eg[tot].next = head[u];head[u] = tot;\n//}\n\n//int C[1100][6];\n//void Cn(){\n//    for(int i=0;i<12;i++)for(int j = 0;j <= min(i,11);j++)if(!j) C[i][j] = 1;else C[i][j] = (C[i-1][j]+C[i-1][j-1]);\n//}\nll lowbit(ll x){\n    return x%(-x);\n}\n\n\nll a[N];\nvoid solve(){\n    ll n,mx = 0,mi = INF;cin >> n;\n    rep(i,1,n+1){\n       cin >> a[i]\n        mx = max(mx,a[i]),mi = min(a[i],mi);\n    }\n    sort(a+1,a+1+n);\n\n    ll ans = 0;\n    rep(i,2,n){\n        ll now = max(a[i] - a[i-1] + a[i] - a[1],a[n] - a[i] + a[i+1] - a[i]);\n        ans = max(ans,now);\n    }\n    ans = max(a[n] - a[n-1] + a[n] - a[1],ans);\n    ans = max(a[n] - a[1] + a[2] - a[1],ans);\n\n    cout << ans << '\\n';\n}\nsigned  main(){\n\n    ll t = read();\n    while (t--)\n        solve();\n}\n\n\n\n",COMPILE_ERROR,0,0
1591287924765798400,3dcf32868d7a750bb24733cc752e8b34486b532e90524d2606d8643387f183e4,2022-11-12 12:33:00,C++,0.0,1591148389985800193,1589906790446387200,1049226928954454016,"#include \""bits/stdc++.h\""\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> PII;\n#define rep(i,a,n) for(int i = a; i < n; i++)\n#define per(i,n,a) for(int i = n-1; i >= a; i--)\n#define debug(a) printf(\""#: %d \"",a);\n#define fr first\n#define se second\n#define be begin()\n#define ed end()\n#define pb push_back\n#define mk make_pair\n#define pf printf\n#define ins insert\n#define sz size()\n//#define int long long\n#define mem(a,i) memset(a,i,sizeof (a))\n\n//char buf[1<<23],*p1=buf,*p2=buf;\n//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)\n//inline ll read()\n//{\n//    int s=0;\n//    char ch = getchar(),last;\n//    while(ch<'0'||ch>'9') last = ch, ch = getchar();\n//    while(ch>='0'&&ch<='9') s=(s<<1)+(s<<3)+(ch^48),ch=getchar();\n//    return last=='-'?-s:s;\n//}\n\ninline ll read(){\n    ll x = 0,f = 1;\n    char ch = getchar();\n    while(ch < '0'||ch > '9'){\n        if(ch == '-')\n            f = -1;\n        ch = getchar();\n    }\n    while(ch >= '0' && ch <= '9'){\n        x = (x << 1)+(x << 3)+(ch^48);\n        ch = getchar();\n    }\n    return x*f;\n}\nconst int MOD = 998244353;\nll INF = 1e18;\nll gcd(ll a,ll b){\n    return b ? gcd(b,a%b) : a;\n}\nconst int N = 2e5 + 10;\n//struct edge{\n//    int to,next,w;\n//}eg[N];\n//int head[N],tot,dist[N];\n//bool st[N];\n//void add(int u,int v,int w){\n//    eg[++tot].w = w;eg[tot].to = v;eg[tot].next = head[u];head[u] = tot;\n//}\n\n//int C[1100][6];\n//void Cn(){\n//    for(int i=0;i<12;i++)for(int j = 0;j <= min(i,11);j++)if(!j) C[i][j] = 1;else C[i][j] = (C[i-1][j]+C[i-1][j-1]);\n//}\nll lowbit(ll x){\n    return x%(-x);\n}\n\n\nll a[N];\nvoid solve(){\n    ll n;\n     ll mx = 0,mi = INF;\n    cin >> n;\n    rep(i,1,n+1){\n       cin >> a[i]\n       mx = max(mx,a[i]),mi = min(a[i],mi);\n    }\n    sort(a+1,a+1+n);\n\n    ll ans = 0;\n    rep(i,2,n){\n        ll now = max(a[i] - a[i-1] + a[i] - a[1],a[n] - a[i] + a[i+1] - a[i]);\n        ans = max(ans,now);\n    }\n    ans = max(a[n] - a[n-1] + a[n] - a[1],ans);\n    ans = max(a[n] - a[1] + a[2] - a[1],ans);\n\n    cout << ans << '\\n';\n}\nsigned  main(){\n\n    ll t = read();\n    while (t--)\n        solve();\n}\n\n\n\n",COMPILE_ERROR,0,0
1591288089274814464,3dcf32868d7a750bb24733cc752e8b34486b532e90524d2606d8643387f183e4,2022-11-12 12:33:39,C++,0.0,1591148389985800193,1589906790446387200,1049226928954454016,"#include \""bits/stdc++.h\""\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> PII;\n#define rep(i,a,n) for(int i = a; i < n; i++)\n#define per(i,n,a) for(int i = n-1; i >= a; i--)\n#define debug(a) printf(\""#: %d \"",a);\n#define fr first\n#define se second\n#define be begin()\n#define ed end()\n#define pb push_back\n#define mk make_pair\n#define pf printf\n#define ins insert\n#define sz size()\n//#define int long long\n#define mem(a,i) memset(a,i,sizeof (a))\n\n//char buf[1<<23],*p1=buf,*p2=buf;\n//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)\n//inline ll read()\n//{\n//    int s=0;\n//    char ch = getchar(),last;\n//    while(ch<'0'||ch>'9') last = ch, ch = getchar();\n//    while(ch>='0'&&ch<='9') s=(s<<1)+(s<<3)+(ch^48),ch=getchar();\n//    return last=='-'?-s:s;\n//}\n\ninline ll read(){\n    ll x = 0,f = 1;\n    char ch = getchar();\n    while(ch < '0'||ch > '9'){\n        if(ch == '-')\n            f = -1;\n        ch = getchar();\n    }\n    while(ch >= '0' && ch <= '9'){\n        x = (x << 1)+(x << 3)+(ch^48);\n        ch = getchar();\n    }\n    return x*f;\n}\nconst int MOD = 998244353;\nll INF = 1e18;\nll gcd(ll a,ll b){\n    return b ? gcd(b,a%b) : a;\n}\nconst int N = 2e5 + 10;\n//struct edge{\n//    int to,next,w;\n//}eg[N];\n//int head[N],tot,dist[N];\n//bool st[N];\n//void add(int u,int v,int w){\n//    eg[++tot].w = w;eg[tot].to = v;eg[tot].next = head[u];head[u] = tot;\n//}\n\n//int C[1100][6];\n//void Cn(){\n//    for(int i=0;i<12;i++)for(int j = 0;j <= min(i,11);j++)if(!j) C[i][j] = 1;else C[i][j] = (C[i-1][j]+C[i-1][j-1]);\n//}\nll lowbit(ll x){\n    return x%(-x);\n}\n\n\nll a[N];\nvoid solve(){\n    ll n;\n     ll mx = 0,mi = INF;\n    cin >> n;\n    rep(i,1,n+1){\n       cin >> a[i];\n       mx = max(mx,a[i]),mi = min(a[i],mi);\n    }\n    sort(a+1,a+1+n);\n\n    ll ans = 0;\n    rep(i,2,n){\n        ll now = max(a[i] - a[i-1] + a[i] - a[1],a[n] - a[i] + a[i+1] - a[i]);\n        ans = max(ans,now);\n    }\n    ans = max(a[n] - a[n-1] + a[n] - a[1],ans);\n    ans = max(a[n] - a[1] + a[2] - a[1],ans);\n\n    cout << ans << '\\n';\n}\nsigned  main(){\n\n    ll t = read();\n    while (t--)\n        solve();\n}\n\n\n\n",WRONG_ANSWER,836,708
1591288166512922624,3dcf32868d7a750bb24733cc752e8b34486b532e90524d2606d8643387f183e4,2022-11-12 12:33:58,C++,0.0,1591148389985800193,1589906790446387200,1049226928954454016,"#include \""bits/stdc++.h\""\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> PII;\n#define rep(i,a,n) for(int i = a; i < n; i++)\n#define per(i,n,a) for(int i = n-1; i >= a; i--)\n#define debug(a) printf(\""#: %d \"",a);\n#define fr first\n#define se second\n#define be begin()\n#define ed end()\n#define pb push_back\n#define mk make_pair\n#define pf printf\n#define ins insert\n#define sz size()\n//#define int long long\n#define mem(a,i) memset(a,i,sizeof (a))\n\n//char buf[1<<23],*p1=buf,*p2=buf;\n//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)\n//inline ll read()\n//{\n//    int s=0;\n//    char ch = getchar(),last;\n//    while(ch<'0'||ch>'9') last = ch, ch = getchar();\n//    while(ch>='0'&&ch<='9') s=(s<<1)+(s<<3)+(ch^48),ch=getchar();\n//    return last=='-'?-s:s;\n//}\n\ninline ll read(){\n    ll x = 0,f = 1;\n    char ch = getchar();\n    while(ch < '0'||ch > '9'){\n        if(ch == '-')\n            f = -1;\n        ch = getchar();\n    }\n    while(ch >= '0' && ch <= '9'){\n        x = (x << 1)+(x << 3)+(ch^48);\n        ch = getchar();\n    }\n    return x*f;\n}\nconst int MOD = 998244353;\nll INF = 1e18;\nll gcd(ll a,ll b){\n    return b ? gcd(b,a%b) : a;\n}\nconst int N = 2e5 + 10;\n//struct edge{\n//    int to,next,w;\n//}eg[N];\n//int head[N],tot,dist[N];\n//bool st[N];\n//void add(int u,int v,int w){\n//    eg[++tot].w = w;eg[tot].to = v;eg[tot].next = head[u];head[u] = tot;\n//}\n\n//int C[1100][6];\n//void Cn(){\n//    for(int i=0;i<12;i++)for(int j = 0;j <= min(i,11);j++)if(!j) C[i][j] = 1;else C[i][j] = (C[i-1][j]+C[i-1][j-1]);\n//}\nll lowbit(ll x){\n    return x%(-x);\n}\n\n\nll a[N];\nvoid solve(){\n    ll n,mx = 0,mi = INF;\n    cin >> n;\n    rep(i,1,n+1){\n        cin >> a[i];\n        mx = max(mx,a[i]),mi = min(a[i],mi);\n    }\n    sort(a+1,a+1+n);\n\n    ll ans = 0;\n    rep(i,2,n){\n        ll now = max(a[i] - a[i-1] + a[i] - a[1],a[n] - a[i] + a[i+1] - a[i]);\n        ans = max(ans,now);\n    }\n    ans = max(a[n] - a[n-1] + a[n] - a[1],ans);\n    ans = max(a[n] - a[1] + a[2] - a[1],ans);\n\n    cout << ans << '\\n';\n}\nsigned  main(){\n\n    ll t = read();\n    while (t--)\n        solve();\n}\n\n\n\n",WRONG_ANSWER,826,708
1591428493643157504,3dcf32868d7a750bb24733cc752e8b34486b532e90524d2606d8643387f183e4,2022-11-12 21:51:34,C++,300.0,1591148389985800193,1589906790446387200,1049226928954454016,"#include \""bits/stdc++.h\""\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> PII;\n#define rep(i,a,n) for(int i = a; i < n; i++)\n#define per(i,n,a) for(int i = n-1; i >= a; i--)\n#define debug(a) printf(\""#: %d \"",a);\n#define fr first\n#define se second\n#define be begin()\n#define ed end()\n#define pb push_back\n#define mk make_pair\n#define pf printf\n#define ins insert\n#define sz size()\n//#define int long long\n#define mem(a,i) memset(a,i,sizeof (a))\n\n//char buf[1<<23],*p1=buf,*p2=buf;\n//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)\n//inline ll read()\n//{\n//    int s=0;\n//    char ch = getchar(),last;\n//    while(ch<'0'||ch>'9') last = ch, ch = getchar();\n//    while(ch>='0'&&ch<='9') s=(s<<1)+(s<<3)+(ch^48),ch=getchar();\n//    return last=='-'?-s:s;\n//}\n\ninline ll read(){\n    ll x = 0,f = 1;\n    char ch = getchar();\n    while(ch < '0'||ch > '9'){\n        if(ch == '-')\n            f = -1;\n        ch = getchar();\n    }\n    while(ch >= '0' && ch <= '9'){\n        x = (x << 1)+(x << 3)+(ch^48);\n        ch = getchar();\n    }\n    return x*f;\n}\nconst int MOD = 998244353;\nll INF = 1e18;\nll gcd(ll a,ll b){\n    return b ? gcd(b,a%b) : a;\n}\nconst int N = 2e5 + 10;\n//struct edge{\n//    int to,next,w;\n//}eg[N];\n//int head[N],tot,dist[N];\n//bool st[N];\n//void add(int u,int v,int w){\n//    eg[++tot].w = w;eg[tot].to = v;eg[tot].next = head[u];head[u] = tot;\n//}\n\n//int C[1100][6];\n//void Cn(){\n//    for(int i=0;i<12;i++)for(int j = 0;j <= min(i,11);j++)if(!j) C[i][j] = 1;else C[i][j] = (C[i-1][j]+C[i-1][j-1]);\n//}\nll lowbit(ll x){\n    return x%(-x);\n}\n\n\nll a[N];\nvoid solve(){\n    ll n,mx = 0,mi = INF;\n    cin >> n;\n    rep(i,1,n+1){\n        cin >> a[i];\n        mx = max(mx,a[i]),mi = min(a[i],mi);\n    }\n    sort(a+1,a+1+n);\n\n    ll ans = 0;\n    rep(i,2,n){\n        ll now = max(a[i] - a[i-1] + a[i] - a[1],a[n] - a[i] + a[i+1] - a[i]);\n        ans = max(ans,now);\n    }\n    ans = max(a[n] - a[n-1] + a[n] - a[1],ans);\n    ans = max(a[n] - a[1] + a[2] - a[1],ans);\n\n    cout << ans << '\\n';\n}\nsigned  main(){\n\n//     ll t = read();\n//     while (t--)\n        solve();\n}\n\n\n\n",ACCEPTED,34,608
1591431015615238144,3dcf32868d7a750bb24733cc752e8b34486b532e90524d2606d8643387f183e4,2022-11-12 22:01:36,C++,0.0,1591148389985800192,1589816514637750272,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n    int n;string s;cin>>s;\n    int x = 0,y = 0;\n    for(auto u : s){\n        if(u == '1')x++;\n        else y++;\n    }\n    cout << 2*min(x,y) << '\\n';\n    return 0;\n}",WRONG_ANSWER,12,472
1591431076935938048,3dcf32868d7a750bb24733cc752e8b34486b532e90524d2606d8643387f183e4,2022-11-12 22:01:50,C++,0.0,1591148389985800192,1589816514637750272,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n    int n;string s;       \n    cin >> s;\n    int x = 0,y = 0;\n    for(auto u : s){\n        if(u == '1')x++;\n        else y++;\n    }\n    cout << 2*min(x,y) << '\\n';\n    return 0;\n}",WRONG_ANSWER,6,324
1591435256933187584,3dcf32868d7a750bb24733cc752e8b34486b532e90524d2606d8643387f183e4,2022-11-12 22:18:27,C++,300.0,1591148389985800193,1589906790446387200,1049226928954454016,"#include \""bits/stdc++.h\""\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> PII;\n#define rep(i,a,n) for(int i = a; i < n; i++)\n#define per(i,n,a) for(int i = n-1; i >= a; i--)\n#define debug(a) printf(\""#: %d \"",a);\n#define fr first\n#define se second\n#define be begin()\n#define ed end()\n#define pb push_back\n#define mk make_pair\n#define pf printf\n#define ins insert\n#define sz size()\n//#define int long long\n#define mem(a,i) memset(a,i,sizeof (a))\n\n//char buf[1<<23],*p1=buf,*p2=buf;\n//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)\n//inline ll read()\n//{\n//    int s=0;\n//    char ch = getchar(),last;\n//    while(ch<'0'||ch>'9') last = ch, ch = getchar();\n//    while(ch>='0'&&ch<='9') s=(s<<1)+(s<<3)+(ch^48),ch=getchar();\n//    return last=='-'?-s:s;\n//}\n\ninline ll read(){\n    ll x = 0,f = 1;\n    char ch = getchar();\n    while(ch < '0'||ch > '9'){\n        if(ch == '-')\n            f = -1;\n        ch = getchar();\n    }\n    while(ch >= '0' && ch <= '9'){\n        x = (x << 1)+(x << 3)+(ch^48);\n        ch = getchar();\n    }\n    return x*f;\n}\nconst int MOD = 998244353;\nll INF = 1e18;\nll gcd(ll a,ll b){\n    return b ? gcd(b,a%b) : a;\n}\nconst int N = 2e5 + 10;\n//struct edge{\n//    int to,next,w;\n//}eg[N];\n//int head[N],tot,dist[N];\n//bool st[N];\n//void add(int u,int v,int w){\n//    eg[++tot].w = w;eg[tot].to = v;eg[tot].next = head[u];head[u] = tot;\n//}\n\n//int C[1100][6];\n//void Cn(){\n//    for(int i=0;i<12;i++)for(int j = 0;j <= min(i,11);j++)if(!j) C[i][j] = 1;else C[i][j] = (C[i-1][j]+C[i-1][j-1]);\n//}\nll lowbit(ll x){\n    return x%(-x);\n}\n\n\nll a[N];\nvoid solve(){\n    ll n,mx = 0,mi = INF;\n    cin >> n;\n    rep(i,1,n+1){\n        cin >> a[i];\n        mx = max(mx,a[i]),mi = min(a[i],mi);\n    }\n    sort(a+1,a+1+n);\n\n    ll ans = 0;\n    rep(i,2,n){\n        ll now = max(a[i] - a[i-1] + a[i] - a[1],a[n] - a[i] + a[i+1] - a[i]);\n        ans = max(ans,now);\n    }\n    ans = max(a[n] - a[n-1] + a[n] - a[1],ans);\n    ans = max(a[n] - a[1] + a[2] - a[1],ans);\n\n    cout << ans << '\\n';\n}\nsigned  main(){\n\n    ll t = read();\n    while (t--)\n        solve();\n}\n\n\n\n",ACCEPTED,164,628
1591435508742422528,3dcf32868d7a750bb24733cc752e8b34486b532e90524d2606d8643387f183e4,2022-11-12 22:19:27,C++,0.0,1591148389985800192,1589816514637750272,1049226928954454016,"#include \""bits/stdc++.h\""\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> PII;\n#define rep(i,a,n) for(int i = a; i < n; i++)\n#define per(i,n,a) for(int i = n-1; i >= a; i--)\n#define debug(a) printf(\""#: %d \"",a);\n#define fr first\n#define se second\n#define be begin()\n#define ed end()\n#define pb push_back\n#define mk make_pair\n#define pf printf\n#define ins insert\n#define sz size()\n//#define int long long\n#define mem(a,i) memset(a,i,sizeof (a))\n\n//char buf[1<<23],*p1=buf,*p2=buf;\n//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)\n//inline ll read()\n//{\n//    int s=0;\n//    char ch = getchar(),last;\n//    while(ch<'0'||ch>'9') last = ch, ch = getchar();\n//    while(ch>='0'&&ch<='9') s=(s<<1)+(s<<3)+(ch^48),ch=getchar();\n//    return last=='-'?-s:s;\n//}\n\ninline ll read(){\n    ll x = 0,f = 1;\n    char ch = getchar();\n    while(ch < '0'||ch > '9'){\n        if(ch == '-')\n            f = -1;\n        ch = getchar();\n    }\n    while(ch >= '0' && ch <= '9'){\n        x = (x << 1)+(x << 3)+(ch^48);\n        ch = getchar();\n    }\n    return x*f;\n}\nconst int MOD = 1e6+7;\nll INF = 1e18;\nll gcd(ll a,ll b){\n    return b ? gcd(b,a%b) : a;\n}\nconst int N = 2e5 + 10;\n//struct edge{\n//    int to,next,w;\n//}eg[N];+\n//bool st[N];\n//void add(int u,int v,int w){\n//    eg[++tot].w = w;eg[tot].to = v;eg[tot].next = head[u];head[u] = tot;\n//}\n\n//int C[1100][6];\n//void Cn(){\n//    for(int i=0;i<12;i++)for(int j = 0;j <= min(i,11);j++)if(!j) C[i][j] = 1;else C[i][j] = (C[i-1][j]+C[i-1][j-1]);\n//}\nll lowbit(ll x){\n    return x%(-x);\n}\n\nvoid solve(){\n    string s;cin >> s;\n    ll a = 0,b = 0;\n    for(auto i : s){\n        if(i == '0')a++;\n        else b++;\n    }\n    cout << min(a,b)*2 << '\\n';\n}\nsigned  main(){\n//    ll t;cin >> t;\n//    while (t--)\n        solve();\n}\n\n\n\n\n\n",WRONG_ANSWER,6,624
1591437038455427072,3dcf32868d7a750bb24733cc752e8b34486b532e90524d2606d8643387f183e4,2022-11-12 22:25:32,C++,0.0,1591148389985800192,1589816514637750272,1049226928954454016,"#include \""bits/stdc++.h\""\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> PII;\n#define rep(i,a,n) for(int i = a; i < n; i++)\n#define per(i,n,a) for(int i = n-1; i >= a; i--)\n#define debug(a) printf(\""#: %d \"",a);\n#define fr first\n#define se second\n#define be begin()\n#define ed end()\n#define pb push_back\n#define mk make_pair\n#define pf printf\n#define ins insert\n#define sz size()\n//#define int long long\n#define mem(a,i) memset(a,i,sizeof (a))\n\n//char buf[1<<23],*p1=buf,*p2=buf;\n//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)\n//inline ll read()\n//{\n//    int s=0;\n//    char ch = getchar(),last;\n//    while(ch<'0'||ch>'9') last = ch, ch = getchar();\n//    while(ch>='0'&&ch<='9') s=(s<<1)+(s<<3)+(ch^48),ch=getchar();\n//    return last=='-'?-s:s;\n//}\n\ninline ll read(){\n    ll x = 0,f = 1;\n    char ch = getchar();\n    while(ch < '0'||ch > '9'){\n        if(ch == '-')\n            f = -1;\n        ch = getchar();\n    }\n    while(ch >= '0' && ch <= '9'){\n        x = (x << 1)+(x << 3)+(ch^48);\n        ch = getchar();\n    }\n    return x*f;\n}\nconst int MOD = 1e6+7;\nll INF = 1e18;\nll gcd(ll a,ll b){\n    return b ? gcd(b,a%b) : a;\n}\nconst int N = 2e5 + 10;\n//struct edge{\n//    int to,next,w;\n//}eg[N];+\n//bool st[N];\n//void add(int u,int v,int w){\n//    eg[++tot].w = w;eg[tot].to = v;eg[tot].next = head[u];head[u] = tot;\n//}\n\n//int C[1100][6];\n//void Cn(){\n//    for(int i=0;i<12;i++)for(int j = 0;j <= min(i,11);j++)if(!j) C[i][j] = 1;else C[i][j] = (C[i-1][j]+C[i-1][j-1]);\n//}\nll lowbit(ll x){\n    return x%(-x);\n}\n\nvoid solve(){\n   int n;cin >> n;\n    string s;cin >> s;\n    int x = 0,y = 0;\n    for(int i = 0; i < n; i++){\n        if(s[i] == '1')x++;\n        else y++;\n    }\n    cout << max(x,y)*2 << '\\n';\n}\nsigned  main(){\n//    ll t;cin >> t;\n//    while (t--)\n        solve();\n}\n\n\n\n\n\n",WRONG_ANSWER,7,508
1591437090338963456,3dcf32868d7a750bb24733cc752e8b34486b532e90524d2606d8643387f183e4,2022-11-12 22:25:44,C++,0.0,1591148389985800192,1589816514637750272,1049226928954454016,"#include \""bits/stdc++.h\""\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> PII;\n#define rep(i,a,n) for(int i = a; i < n; i++)\n#define per(i,n,a) for(int i = n-1; i >= a; i--)\n#define debug(a) printf(\""#: %d \"",a);\n#define fr first\n#define se second\n#define be begin()\n#define ed end()\n#define pb push_back\n#define mk make_pair\n#define pf printf\n#define ins insert\n#define sz size()\n//#define int long long\n#define mem(a,i) memset(a,i,sizeof (a))\n\n//char buf[1<<23],*p1=buf,*p2=buf;\n//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)\n//inline ll read()\n//{\n//    int s=0;\n//    char ch = getchar(),last;\n//    while(ch<'0'||ch>'9') last = ch, ch = getchar();\n//    while(ch>='0'&&ch<='9') s=(s<<1)+(s<<3)+(ch^48),ch=getchar();\n//    return last=='-'?-s:s;\n//}\n\ninline ll read(){\n    ll x = 0,f = 1;\n    char ch = getchar();\n    while(ch < '0'||ch > '9'){\n        if(ch == '-')\n            f = -1;\n        ch = getchar();\n    }\n    while(ch >= '0' && ch <= '9'){\n        x = (x << 1)+(x << 3)+(ch^48);\n        ch = getchar();\n    }\n    return x*f;\n}\nconst int MOD = 1e6+7;\nll INF = 1e18;\nll gcd(ll a,ll b){\n    return b ? gcd(b,a%b) : a;\n}\nconst int N = 2e5 + 10;\n//struct edge{\n//    int to,next,w;\n//}eg[N];+\n//bool st[N];\n//void add(int u,int v,int w){\n//    eg[++tot].w = w;eg[tot].to = v;eg[tot].next = head[u];head[u] = tot;\n//}\n\n//int C[1100][6];\n//void Cn(){\n//    for(int i=0;i<12;i++)for(int j = 0;j <= min(i,11);j++)if(!j) C[i][j] = 1;else C[i][j] = (C[i-1][j]+C[i-1][j-1]);\n//}\nll lowbit(ll x){\n    return x%(-x);\n}\n\nvoid solve(){\n   int n;cin >> n;\n    string s;cin >> s;\n    int x = 0,y = 0;\n    for(int i = 0; i < n; i++){\n        if(s[i] == '1')x++;\n        else y++;\n    }\n    cout << max(x,y)*2 << '\\n';\n}\nsigned  main(){\n//    ll t;cin >> t;\n//    while (t--)\n        solve();\n}\n\n\n\n\n\n",WRONG_ANSWER,5,328
1591437189345509376,3dcf32868d7a750bb24733cc752e8b34486b532e90524d2606d8643387f183e4,2022-11-12 22:26:08,C++,300.0,1591148389985800192,1589816514637750272,1049226928954454016,"#include \""bits/stdc++.h\""\nusing namespace std;\n\nint main(){\n//    freopen(\""D:\\\\algorithm\\\\work\\\\5.in\"",\""r\"",stdin);\n//    freopen(\""D:\\\\algorithm\\\\work\\\\5.out\"",\""w\"",stdout);\n   int n;cin >> n;\n   string s;cin >> s;\n   int a = 0,b = 0;\n   for(auto i : s){\n       if(i == '0')a++;\n       else b++;\n   }\n   cout << min(a,b)*2 << '\\n';\n//    srand(time(0));\n//    int t = 100000;\n//    cout << t << endl;\n//    while (t--){\n//        cout << rand()%2;\n//    }\n   return 0;\n}\n",ACCEPTED,33,728
1591437238586642432,3dcf32868d7a750bb24733cc752e8b34486b532e90524d2606d8643387f183e4,2022-11-12 22:26:19,C++,0.0,1591148389985800192,1589816514637750272,1049226928954454016,"#include \""bits/stdc++.h\""\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> PII;\n#define rep(i,a,n) for(int i = a; i < n; i++)\n#define per(i,n,a) for(int i = n-1; i >= a; i--)\n#define debug(a) printf(\""#: %d \"",a);\n#define fr first\n#define se second\n#define be begin()\n#define ed end()\n#define pb push_back\n#define mk make_pair\n#define pf printf\n#define ins insert\n#define sz size()\n//#define int long long\n#define mem(a,i) memset(a,i,sizeof (a))\n\n//char buf[1<<23],*p1=buf,*p2=buf;\n//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)\n//inline ll read()\n//{\n//    int s=0;\n//    char ch = getchar(),last;\n//    while(ch<'0'||ch>'9') last = ch, ch = getchar();\n//    while(ch>='0'&&ch<='9') s=(s<<1)+(s<<3)+(ch^48),ch=getchar();\n//    return last=='-'?-s:s;\n//}\n\ninline ll read(){\n    ll x = 0,f = 1;\n    char ch = getchar();\n    while(ch < '0'||ch > '9'){\n        if(ch == '-')\n            f = -1;\n        ch = getchar();\n    }\n    while(ch >= '0' && ch <= '9'){\n        x = (x << 1)+(x << 3)+(ch^48);\n        ch = getchar();\n    }\n    return x*f;\n}\nconst int MOD = 1e6+7;\nll INF = 1e18;\nll gcd(ll a,ll b){\n    return b ? gcd(b,a%b) : a;\n}\nconst int N = 2e5 + 10;\n//struct edge{\n//    int to,next,w;\n//}eg[N];+\n//bool st[N];\n//void add(int u,int v,int w){\n//    eg[++tot].w = w;eg[tot].to = v;eg[tot].next = head[u];head[u] = tot;\n//}\n\n//int C[1100][6];\n//void Cn(){\n//    for(int i=0;i<12;i++)for(int j = 0;j <= min(i,11);j++)if(!j) C[i][j] = 1;else C[i][j] = (C[i-1][j]+C[i-1][j-1]);\n//}\nll lowbit(ll x){\n    return x%(-x);\n}\n\nvoid solve(){\n   int n;cin >> n;\n    string s;cin >> s;\n    int x = 0,y = 0;\n    for(int i = 0; i < n; i++){\n        if(s[i] == '1')x++;\n        else y++;\n    }\n    cout << min(x,y)*2 << '\\n'\n}\nsigned  main(){\n//    ll t;cin >> t;\n//    while (t--)\n        solve();\n}\n\n\n\n\n\n",COMPILE_ERROR,0,0
1591437466270240768,3dcf32868d7a750bb24733cc752e8b34486b532e90524d2606d8643387f183e4,2022-11-12 22:27:14,C++,300.0,1591148389985800192,1589816514637750272,1049226928954454016,"#include \""bits/stdc++.h\""\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> PII;\n#define rep(i,a,n) for(int i = a; i < n; i++)\n#define per(i,n,a) for(int i = n-1; i >= a; i--)\n#define debug(a) printf(\""#: %d \"",a);\n#define fr first\n#define se second\n#define be begin()\n#define ed end()\n#define pb push_back\n#define mk make_pair\n#define pf printf\n#define ins insert\n#define sz size()\n//#define int long long\n#define mem(a,i) memset(a,i,sizeof (a))\n\n//char buf[1<<23],*p1=buf,*p2=buf;\n//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)\n//inline ll read()\n//{\n//    int s=0;\n//    char ch = getchar(),last;\n//    while(ch<'0'||ch>'9') last = ch, ch = getchar();\n//    while(ch>='0'&&ch<='9') s=(s<<1)+(s<<3)+(ch^48),ch=getchar();\n//    return last=='-'?-s:s;\n//}\n\ninline ll read(){\n    ll x = 0,f = 1;\n    char ch = getchar();\n    while(ch < '0'||ch > '9'){\n        if(ch == '-')\n            f = -1;\n        ch = getchar();\n    }\n    while(ch >= '0' && ch <= '9'){\n        x = (x << 1)+(x << 3)+(ch^48);\n        ch = getchar();\n    }\n    return x*f;\n}\nconst int MOD = 1e6+7;\nll INF = 1e18;\nll gcd(ll a,ll b){\n    return b ? gcd(b,a%b) : a;\n}\nconst int N = 2e5 + 10;\n//struct edge{\n//    int to,next,w;\n//}eg[N];+\n//bool st[N];\n//void add(int u,int v,int w){\n//    eg[++tot].w = w;eg[tot].to = v;eg[tot].next = head[u];head[u] = tot;\n//}\n\n//int C[1100][6];\n//void Cn(){\n//    for(int i=0;i<12;i++)for(int j = 0;j <= min(i,11);j++)if(!j) C[i][j] = 1;else C[i][j] = (C[i-1][j]+C[i-1][j-1]);\n//}\nll lowbit(ll x){\n    return x%(-x);\n}\n\nvoid solve(){\n   int n;\n    cin >> n;\n    string s;\n    cin >> s;\n    int x = 0,y = 0;\n    for(int i = 0; i < n; i++){\n        if(s[i] == '1')x++;\n        else y++;\n    }\n    cout << min(x,y)*2 << '\\n';\n}\nsigned  main(){\n//    ll t;cin >> t;\n//    while (t--)\n        solve();\n}\n\n\n\n\n\n",ACCEPTED,37,580
1591437491293454336,3dcf32868d7a750bb24733cc752e8b34486b532e90524d2606d8643387f183e4,2022-11-12 22:27:20,C++,300.0,1591148389985800192,1589816514637750272,1049226928954454016,"#include \""bits/stdc++.h\""\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> PII;\n#define rep(i,a,n) for(int i = a; i < n; i++)\n#define per(i,n,a) for(int i = n-1; i >= a; i--)\n#define debug(a) printf(\""#: %d \"",a);\n#define fr first\n#define se second\n#define be begin()\n#define ed end()\n#define pb push_back\n#define mk make_pair\n#define pf printf\n#define ins insert\n#define sz size()\n//#define int long long\n#define mem(a,i) memset(a,i,sizeof (a))\n\n//char buf[1<<23],*p1=buf,*p2=buf;\n//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)\n//inline ll read()\n//{\n//    int s=0;\n//    char ch = getchar(),last;\n//    while(ch<'0'||ch>'9') last = ch, ch = getchar();\n//    while(ch>='0'&&ch<='9') s=(s<<1)+(s<<3)+(ch^48),ch=getchar();\n//    return last=='-'?-s:s;\n//}\n\ninline ll read(){\n    ll x = 0,f = 1;\n    char ch = getchar();\n    while(ch < '0'||ch > '9'){\n        if(ch == '-')\n            f = -1;\n        ch = getchar();\n    }\n    while(ch >= '0' && ch <= '9'){\n        x = (x << 1)+(x << 3)+(ch^48);\n        ch = getchar();\n    }\n    return x*f;\n}\nconst int MOD = 1e6+7;\nll INF = 1e18;\nll gcd(ll a,ll b){\n    return b ? gcd(b,a%b) : a;\n}\nconst int N = 2e5 + 10;\n//struct edge{\n//    int to,next,w;\n//}eg[N];+\n//bool st[N];\n//void add(int u,int v,int w){\n//    eg[++tot].w = w;eg[tot].to = v;eg[tot].next = head[u];head[u] = tot;\n//}\n\n//int C[1100][6];\n//void Cn(){\n//    for(int i=0;i<12;i++)for(int j = 0;j <= min(i,11);j++)if(!j) C[i][j] = 1;else C[i][j] = (C[i-1][j]+C[i-1][j-1]);\n//}\nll lowbit(ll x){\n    return x%(-x);\n}\n\nvoid solve(){\n   int n;\n    cin >> n;\n    string s;\n    cin >> s;\n    int x = 0,y = 0;\n    for(int i = 0; i < n; i++){\n        if(s[i] == '1')x++;\n        else y++;\n    }\n    cout << min(x,y)*2 << '\\n';\n}\nsigned  main(){\n//    ll t;cin >> t;\n//    while (t--)\n        solve();\n}\n\n\n\n\n\n",ACCEPTED,34,868
1591644621565091840,9ca3f63f61fa4f349009d69e7059514c3a39dbdd5a1f94342c11f4c33ccdceaa,2022-11-13 12:10:23,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,print(60),ACCEPTED,17,2888
1591644623603523584,54914c90623988219ee55c4a0b2e645efd9808505aa25f0099930bfa8bf18ad1,2022-11-13 12:10:24,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main(){\n\tprintf(\""60\"");\n\treturn 0;\n} ",ACCEPTED,14,348
1591644651113996288,2bc6a85c0376656012a7970a7842a2a9d8769555a79ef4eec85ff45aa30ff7b7,2022-11-13 12:10:30,Java,300.0,1591610585635213316,1591130116607045632,1049226928954454016,public class Main {\n\tpublic static void main(String[] args) {\n\t\t\n\t\tSystem.out.print(60);\n\t}\n}\n,ACCEPTED,70,22312
1591644687847710720,9a1ecd1db02b268060006afd7de34ec54e74e90bf61becbb6811fb23971c4720,2022-11-13 12:10:39,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,print(60),ACCEPTED,15,2884
1591644704658436096,2af449595ef30f97cefb348732f77a537f3df93d20abf901fe2ea852a179091b,2022-11-13 12:10:43,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"print(\""60\"")",ACCEPTED,16,2776
1591644710031384576,7c6d208c4c4b695bc8d6f8ae0c0357c2466f5c9f86ec0652674812219ac09d38,2022-11-13 12:10:44,Java,300.0,1591610585635213316,1591130116607045632,1049226928954454016,public class Main {\n\n\tpublic static void main(String[] args) {\n\t\tSystem.out.println(60);\n\n\t}\n\n},ACCEPTED,65,22520
1591644715064516608,bfa0c0bcc65d8897d0c2c02aca0551bb9d09a104f2a47146ed4f339ce57cd965,2022-11-13 12:10:46,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,print(60),ACCEPTED,16,2768
1591644729551675392,abe2744e33bb397ffb9bb13afcb202f611378fb4fc5801202f03933298ce5f5d,2022-11-13 12:10:49,Java,300.0,1591610585635213316,1591130116607045632,1049226928954454016,\npublic class Main {\npublic static void main(String[] args){\n\tSystem.out.println(60);\n}\n}\n,ACCEPTED,68,21976
1591644733129416704,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-13 12:10:50,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,print(60),ACCEPTED,22,2784
1591644741283110912,d808f4cc3c70a696f5c416714e0998fe96743e5273bc07a26f75738d12d304f5,2022-11-13 12:10:52,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"print(\""60\"")",ACCEPTED,22,2948
1591644743900356608,458af3c005e0b282d1ca88c254d9910ee2d93738b6f06d399f7444e1e64831eb,2022-11-13 12:10:52,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}\n",ACCEPTED,7,220
1591644751492079616,7ecf54bf0ea2db8ab0397aa941f19ec79a351bc3e86e8c01673aa09a69b3a6db,2022-11-13 12:10:54,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n\tprintf(\""60\"");\n}",ACCEPTED,5,200
1591644752116985856,5b382280d947e26011a7c75c34d257662bc13c50f8257bc8cae807604d61430c,2022-11-13 12:10:54,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\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\tprintf(\""60\"");\n\treturn 0;\n}",ACCEPTED,5,324
1591644752700039168,0ccbaaa612b3d01dbe621ce5e7366d6e26d2e5adf55047d92c6eb7adf78a979d,2022-11-13 12:10:55,C++,300.0,1591610585635213316,1591130116607045632,1049226928954454016,#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    cout<<60;\n    return 0;\n}\n,ACCEPTED,6,328
1591644759129862144,6383c93cbdef4af3eda29400a925819f16ad4afc8368e604ccd580cba7055bdd,2022-11-13 12:10:56,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tprintf(\""60\"");\n\t\n\treturn 0; \n}",ACCEPTED,4,196
1591644762040721408,05fd79145678de5c06012db9db4333bebf8365a74fe442d12a54a9da3782fdca,2022-11-13 12:10:57,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,print(60),ACCEPTED,15,2760
1591644769095528448,17759f531671f838bf3fae4270190e93b6109026f9503f986c1ed85bb412007d,2022-11-13 12:10:58,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""60\"");\n}",ACCEPTED,8,340
1591644784656408576,e9a50f3e071443bb6fb229966bff355c178d484f6cc10e5e1fc8dc5a537237ba,2022-11-13 12:11:02,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\\n\"");\n    return 0;\n}\n",ACCEPTED,5,320
1591644797264519168,a5291eb67188c2a916aa5dd9fc38f2e449aa9f9a3cd047f282d8c154ea2979cd,2022-11-13 12:11:05,C++,300.0,1591610585635213316,1591130116607045632,1049226928954454016,#include <iostream>\n\nusing namespace std;\n\n\nint main()\n{\n    \n    cout << 60 << endl;\n    return 0;\n},ACCEPTED,4,324
1591644798195621888,f1feb45d46abad163f730e5b023ce1df76883054d0a1741228a76c2c69aa3eda,2022-11-13 12:11:05,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main(){\n    printf(\""60\"");\n}",ACCEPTED,5,348
1591644800418603008,69d2f3a9da1c135d111e69327883b4d96c284e9c1c71370cc330a44458f95ab4,2022-11-13 12:11:06,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\\n\"");\n    return 0;\n}\n",ACCEPTED,4,196
1591644801412640768,0cfbb4a339ebbc4dce13b5f3e3f98a3def0ab17ef5b4ac8e6d566de92e1f5f78,2022-11-13 12:11:06,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main(){\n    printf(\""60\"");\n}",ACCEPTED,8,196
1591644803862159360,977c9d350f87cd8386fa1f88cca886d6ff43821830806e60da6d6b36dc77cd13,2022-11-13 12:11:07,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""60\"");\n}",ACCEPTED,6,320
1591644808790433792,59415347d1cfa3163c0a25f108652369803ee9c4d72f5c59e4212aabab93e388,2022-11-13 12:11:08,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,print(60),ACCEPTED,15,2780
1591644809021120512,542d97133043a1f2156354473a31382c35bb2836688b0ed76eae59c52a2e0e3a,2022-11-13 12:11:08,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"print(\""60\"")",ACCEPTED,20,2880
1591644810422018048,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-13 12:11:08,Java,300.0,1591610585635213316,1591130116607045632,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        System.out.println(60);\n    }\n},ACCEPTED,70,21744
1591644816554123264,361d4ab0fa1284b9bf8a3ba65da408861b894c5c0617b83f77f2c1d9a1a3ec92,2022-11-13 12:11:10,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,print(60),ACCEPTED,18,2772
1591644817296515072,20033d4bfe54ea16777c218f33d3af83aed121eb1b058daa8e84687ea80be80b,2022-11-13 12:11:10,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,print(60),ACCEPTED,20,2816
1591644818512830464,09eb01e8f9f24922a6c60a1149d505ad1ebb9b0a39ed1101140fe0fd93daa753,2022-11-13 12:11:10,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"print(\""60\"")",ACCEPTED,20,2756
1591644819804708864,25b8e249c556de062ec0d61286db67304f907bc70204e22083d75434403578b1,2022-11-13 12:11:11,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    \n    printf(\""60\"");\n    return 0;\n}",ACCEPTED,5,352
1591644821163663360,acf80eea856463058b81f71c0238069795893092293fbd098cc594959df6444e,2022-11-13 12:11:11,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,print(60),ACCEPTED,19,2764
1591644823625674752,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-13 12:11:11,Python,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"print(\""10\"")",WRONG_ANSWER,18,2888
1591644824858800128,81f258582663b08bc9b4d77bba77afc3b463021ec8fb2262453de07687484cd5,2022-11-13 12:11:12,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"print(\""60\"")",ACCEPTED,22,2904
1591644825416687616,f6233bf69e5717913375f818af07214d1d2de6df0cd3bcb24368fbde112d6d15,2022-11-13 12:11:12,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,print(60),COMPILE_ERROR,0,0
1591644827203428352,ce1bb8e96385d94dfdb2bd028407e2ffb5a64494440cd7964d6624a83809dae6,2022-11-13 12:11:12,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""d\"",60);\n    return 0;\n}\n",WRONG_ANSWER,5,200
1591644834111434752,fe4cb768b5403507910f0aa3f234076c47d1d48fa85c6c69866cf97317a3b628,2022-11-13 12:11:14,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n   printf(\""60\"");\n    return 0;\n}",ACCEPTED,8,220
1591644842122555392,0c2907a154c1c61744366e94f73ae426665222ffae8eff7042dd0fd7bd8760fb,2022-11-13 12:11:16,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}\n",ACCEPTED,5,352
1591644842810433536,eeab3421c2b685f7d51b09a289b82fe82ba0d3896984d09aeffb9d022232d887,2022-11-13 12:11:16,Java,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"public class Main {\n    public static void main(String[] args) {\n        System.out.println(\""60\"");\n    }\n}",ACCEPTED,78,22032
1591644843078901760,d9e00d995e65b04cda3ddef6baec19225e4351002ab4efa981f62d78919a481b,2022-11-13 12:11:16,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}\n",ACCEPTED,9,352
1591644843146010624,d9f0f29c0c2f6a52018e8ee93d686388c75950bcac327d0bebd2166a37f8dd26,2022-11-13 12:11:16,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""60\"");\n}\n",ACCEPTED,12,392
1591644845025058816,acf80eea856463058b81f71c0238069795893092293fbd098cc594959df6444e,2022-11-13 12:11:17,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,print(60),ACCEPTED,21,2760
1591644847742967808,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-13 12:11:17,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}",ACCEPTED,6,500
1591644849370357760,0ac60c8cba5dc039a812c57a79304a29dc187bee37ef204107b64c7a81bc6988,2022-11-13 12:11:18,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"print(\""60\"")",ACCEPTED,20,2788
1591644853191323648,6de81974dc8c65943a7aa7eec331767cc67f98683db11d3405a39c1495f3fcdf,2022-11-13 12:11:18,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""%d\"",60);\n    return 0;\n}\n",ACCEPTED,5,328
1591644853937954816,28b4de6882b7ade2679f59c486acaf307ce8415dcb0a15787dba589025bbdb02,2022-11-13 12:11:19,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tprintf(\""60\"");\n\treturn 0;\n}",ACCEPTED,9,376
1591644854747455488,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-13 12:11:19,Python,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"print(\""2021\"")",WRONG_ANSWER,16,2760
1591644862842462208,46a5b5de1986c03ade4ef3715390240d3b4a1729dbb6afcb5e53fc1bee0f1a07,2022-11-13 12:11:21,Java,300.0,1591610585635213316,1591130116607045632,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        System.out.print(60);\n    }\n},ACCEPTED,66,22060
1591644867221315584,423e1acd0d02cf3d43f3c7805099dea4edcb39c2e0fa385e82823b5a7c0dd214,2022-11-13 12:11:22,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\\n\"");\n    return 0;\n}\n",ACCEPTED,5,348
1591644869804974080,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 12:11:22,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main(){\n    printf(\""60\"");\n    return 0;\n}",ACCEPTED,5,356
1591644870299934720,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-13 12:11:23,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nint main()\n{\nprintf(\""60\"");\n    return 0;\n}",ACCEPTED,5,196
1591644870589308928,ce1bb8e96385d94dfdb2bd028407e2ffb5a64494440cd7964d6624a83809dae6,2022-11-13 12:11:23,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    printf(\""d\"",60);\n    return 0;\n}\n",WRONG_ANSWER,6,324
1591644871893770240,5a1c17b308a3b3595833d34c6bdfb75e9f5dd0d065acfeb7f28ab8102ba7406c,2022-11-13 12:11:23,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}",ACCEPTED,7,344
1591644872254447616,281adcca8943f9f4c0ced14f1ceffe157a34fca39f3cb864eb95e400944e38a8,2022-11-13 12:11:23,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main(){\n    printf(\""60\"");\n}",ACCEPTED,10,332
1591644873256886272,0c396be113b63ac245fc6ce925111f1631870141ae26c3ec6efb7b6360bb6cf3,2022-11-13 12:11:23,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"print(\""60\"")",ACCEPTED,16,2816
1591644875978989568,505c5b9a1b6d591a815315d95a57743fb98dad691b51421b4de282392fef3f43,2022-11-13 12:11:24,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,print(60),ACCEPTED,15,2888
1591644880492048384,8f29029dc8006da83949d2656cc7dc83026d851252066fd4a9fc89071673ec96,2022-11-13 12:11:25,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,print(60),ACCEPTED,18,2764
1591644888054378496,d0d7b0b753346ba8da319a4bb32af868fdf41e2104a53a3a3d7b5b76c65907fe,2022-11-13 12:11:27,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""60\"");\n}",ACCEPTED,4,196
1591644891065901056,ccc42b8437aa15d1214e4623799ed35cd8ea8087c26cb1b596d51ae4556ea39c,2022-11-13 12:11:28,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,print(60),ACCEPTED,16,2792
1591644896141041664,617f184ce583e9f7a346564ab5659fda0ca35a3a714a0c929cb07f915f4f514b,2022-11-13 12:11:29,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}\n",ACCEPTED,5,340
1591644896786931712,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-13 12:11:29,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include  <stdio.h>\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}",ACCEPTED,5,324
1591644900813496320,33066437ddee11f609c900fe8dbd59cb8113e4d8dfd13c1812f199f4f3fdd334,2022-11-13 12:11:30,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""26\"");\n    return 0;\n}\n",WRONG_ANSWER,8,488
1591644904672256000,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-13 12:11:31,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n\n\n\nint main() {\n\tprintf(\""60\"");\n\treturn 0;\n}",ACCEPTED,11,384
1591644909357260800,864c0dc14d6d917707294bc7e18ea53a2c0536c5d47f3d25f94f0188f106014f,2022-11-13 12:11:32,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}\n",ACCEPTED,7,348
1591644911047553024,5d1852a153062cc8297ed7a30bb643375395a70654d5dff506fad6bc186e81bd,2022-11-13 12:11:32,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,#include <stdio.h> \nint main(){\n\tprintf(60);\n},SEGMENTATION_FAULT,6,480
1591644914293989376,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 12:11:33,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a;\n    printf(\""%d\"",a);\n    return 0;\n}",WRONG_ANSWER,4,352
1591644918681231360,d830b0bcae7881ad6d1b2e2b14f3ffa3695b6d3bd622856493fa1cf903c9bf4e,2022-11-13 12:11:34,Java,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"public class Main {\n\tpublic static void main(String[] args){\n\t\tSystem.out.print(\""60\"");\n\t\t\n\t}\n}",ACCEPTED,74,22668
1591644919046103040,e4f316bfe970c62bf57b46f5ef8a290748707bf16f041fe868d04986a0cdd64f,2022-11-13 12:11:34,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,print('60'),ACCEPTED,26,2784
1591644919645921280,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-13 12:11:34,Python,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"print(\""你好\"")",WRONG_ANSWER,23,2760
1591644923424989184,c358160a3e618a44cd693944fe10043e6372f46bf7d517c3c3f583bd85b17c5e,2022-11-13 12:11:35,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,print(60),ACCEPTED,22,2760
1591644928957231104,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-13 12:11:37,C++,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n\nint main(void)\n{\n    printf(\""60\"");\n}",ACCEPTED,8,512
1591644930018402304,33066437ddee11f609c900fe8dbd59cb8113e4d8dfd13c1812f199f4f3fdd334,2022-11-13 12:11:37,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}\n",ACCEPTED,6,352
1591644931381551104,7dd0c628805d8a6777ff5cc70a5ec79db9475f660782b2f4289ae98977303581,2022-11-13 12:11:37,Python,0.0,1591610585635213316,1591130116607045632,1049226928954454016,print('68'),WRONG_ANSWER,16,2932
1591644932409188352,73af9d5098be5d450fba728363c8fdbe0f6a5526466daa2f3b74abf1acf75527,2022-11-13 12:11:37,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}",ACCEPTED,10,364
1591644938235076608,9aa17e95021225dcdd2b01419b021cd002e47f9a7854274df042f64621bd207a,2022-11-13 12:11:39,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\\n\"");\n    return 0;\n}\n",ACCEPTED,4,200
1591644939975712768,4e8bf5e988ac4275aeb23eae913a385055ab79de14dc27373b9e62a15269d138,2022-11-13 12:11:39,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    printf(\""60\"");\n}",ACCEPTED,10,204
1591644943494688768,fbea21dbaf89f1b064feaa20227f21c5e1c4888fdc371cf5e43f70615906e52a,2022-11-13 12:11:40,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,print(60),ACCEPTED,17,2816
1591644943524048896,cfbed023288d929e37ec2a5f480f49533f34048e9861900771cbd8327550eb31,2022-11-13 12:11:40,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n    printf(\""60\"");\n}",ACCEPTED,5,200
1591644943993810944,958c7c2b659bf7ed617a82cd0cf9adf876a6f164ed5327aaa53afbb4e117d40d,2022-11-13 12:11:40,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"print(\""60\"")",ACCEPTED,16,2704
1591644951606484992,b80fc2aed0abde15bdaa9327874c9784da696b6ed442d90001602ff2a017be15,2022-11-13 12:11:42,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h> \n#include<math.h> \nint main(){\n    printf(\""60\"");\n    return 0;\n}",ACCEPTED,5,324
1591644953313599488,bce383372e0b1b627f0a9b838121096ec3ca14c0f213828fca1bf517a82c8744,2022-11-13 12:11:42,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    printf(\""30\"");\n}",WRONG_ANSWER,5,352
1591644957952499712,739b1156eb9238db78ec0a88314ad93c72ab0c7fc7ecc0396c0a3fa3997af557,2022-11-13 12:11:43,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"print(\""60\"")",ACCEPTED,23,2688
1591644962163580928,667c2e97e82c372f60661d46943ff56a17c9350387f4364ebabe70ac2e232862,2022-11-13 12:11:44,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}",ACCEPTED,5,348
1591644962188701696,1a4463a67236431e94a4a4d273d88450d6acce220fed7155af8798b0664ee731,2022-11-13 12:11:44,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}\n",ACCEPTED,5,352
1591644962889162752,44042a4519c9231aa21c54eb113b7a08f98bcd7db4839a20a61ab6ce51fce357,2022-11-13 12:11:45,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}\n",ACCEPTED,6,448
1591644965808431104,6a835d762a87e93baf4142897168374dc31e9da90b86c19ed82f21159b644272,2022-11-13 12:11:45,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    printf(\""60\"")\n}",COMPILE_ERROR,0,0
1591644970178850816,33066437ddee11f609c900fe8dbd59cb8113e4d8dfd13c1812f199f4f3fdd334,2022-11-13 12:11:46,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}\n",ACCEPTED,12,512
1591644970610876416,20eba57d0ae5a9e589a2b203a4648cce520c99291e8744872f7a5a5911e19e34,2022-11-13 12:11:46,Java,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tSystem.out.print(\""60\"");\n\n\t}\n\n}\n",ACCEPTED,69,22340
1591644974507417600,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-13 12:11:47,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main(){\n    printf(\""60\"");\n    return 0;\n}",ACCEPTED,5,196
1591644977489522688,630b8bfc88107b488e158fc7108c8faf0a195f9b9030c3faf51edac625714584,2022-11-13 12:11:48,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main(){\nprintf(\""60\"");\nreturn 0;\n}\n",ACCEPTED,5,348
1591644978349400064,c5cc6f9845df4bd1986af86c0696296436bbc0f00a10a9f891b4100e57bc3a19,2022-11-13 12:11:48,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    printf(\""60\\n\"");\n}",ACCEPTED,5,348
1591644979054043136,cfc5530a19b24fc4b274f2e4d4609e448c7aecb0325c1717b7f709645428127b,2022-11-13 12:11:48,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"print(\""4\"")",WRONG_ANSWER,20,2688
1591644979565703168,2a1cee132cc8344d51461f6cbf473fb80705d6fd5972f9a5d0fcfea0760fd8b1,2022-11-13 12:11:49,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\\n\"");\n    return 0;\n}\n",ACCEPTED,5,356
1591644980043866112,06b00897262b024d9e66dcd771cf81de9b63954f7a4554699d17c2158114c0d1,2022-11-13 12:11:49,Java,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"public class Main {\n    public static void main(String[] args) {\n        System.out.println(\""60\"");\n    }\n}",ACCEPTED,68,22528
1591644982363348992,e3700fa579dc7c925fa010ac870390ba9776ef5ee08f67752aeef4a9467c7624,2022-11-13 12:11:49,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}\n",ACCEPTED,10,512
1591644985001566208,ce1bb8e96385d94dfdb2bd028407e2ffb5a64494440cd7964d6624a83809dae6,2022-11-13 12:11:50,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    printf(\""%d\"",60);\n    return 0;\n}\n",ACCEPTED,5,348
1591644985265807360,75a6755f083ffc71d77ba6ce593bd24fe8a2ce61edc4710fbde2dce128c47ab4,2022-11-13 12:11:50,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}\n",ACCEPTED,5,368
1591644986566041600,902d8082eea06043d392298983db4630cde4418ac8ee42282d537bfaae045c2f,2022-11-13 12:11:50,Python,0.0,1591610585635213316,1591130116607045632,1049226928954454016,print（“60”）,NON_ZERO_EXIT_CODE,15,2764
1591644991079079936,b69ff333cc0daa10fb20c3ba26e439f64260003a8ff6fde3dbc623fd631ba825,2022-11-13 12:11:51,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main(void)\n{\n    printf(\""%d\""，60);\n    return 0;\n}",COMPILE_ERROR,0,0
1591644994782683136,547094c7c62f34b25dac6d7d79e017d817767a29a120ff5083d5fe0c21b62800,2022-11-13 12:11:52,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,print(60),ACCEPTED,17,2760
1591644995093061632,02b7d1c92f217004d473190b1dff822f66394a78b0b4e4ce3dd7f721ea04df1a,2022-11-13 12:11:52,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"print(\""60\"")",ACCEPTED,20,2760
1591644995667681280,a8a4c649080a65381764d05b09cdced42bbf4a58e2656f96cfc5545fc9d08327,2022-11-13 12:11:52,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}\n",ACCEPTED,4,512
1591644998150676480,7222c2fb91a71fcf3f6560860557ab564f69a453594c9f1620ecc35bb26f5daf,2022-11-13 12:11:53,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"print(\""60\"")",ACCEPTED,16,2760
1591645008707727360,f6233bf69e5717913375f818af07214d1d2de6df0cd3bcb24368fbde112d6d15,2022-11-13 12:11:56,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,print(60)\n,COMPILE_ERROR,0,0
1591645009609547776,15ac7d06a472ca25d78349f7cc3a73d23c7d7a4f0c4ae3cec6200fcdb8135965,2022-11-13 12:11:56,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a;\n    printf(\""%d\"",a);\n   \n    return 0;\n}\n",WRONG_ANSWER,6,328
1591645010544877568,950b2713b447943280c6052f88160e7298bd0ba94c14d628bbdd70df720305b5,2022-11-13 12:11:56,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"print(\""60\"")",COMPILE_ERROR,0,0
1591645014810451968,902d8082eea06043d392298983db4630cde4418ac8ee42282d537bfaae045c2f,2022-11-13 12:11:57,Python,0.0,1591610585635213316,1591130116607045632,1049226928954454016,print（60）,NON_ZERO_EXIT_CODE,15,2764
1591645018488844288,2e4af98c441106efa9ee51f8a781d0eee91a3dff6193987d421eb3a48725c814,2022-11-13 12:11:58,C++,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <iostream>\n\nint main(){\n\tprintf(\""60\"");\n}",ACCEPTED,14,328
1591645018837016576,6b312558d54f4eeffd1aa510a96dd5882584f6bf7857d244f71013b7ec561920,2022-11-13 12:11:58,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a=60;\n    printf(\""%d\"",a);\n    return 0;\n}\n",ACCEPTED,7,500
1591645019550048256,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-13 12:11:58,Java,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"public class Main {\n\tpublic static void main(String[] args) {\n\t\tSystem.out.print(\""60\"");\n\t}\n}",ACCEPTED,74,21996
1591645021068386304,899c5501179552dc1fe5639f9047e15d0f835e7a87c8568193377882d0278985,2022-11-13 12:11:59,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,print(60),ACCEPTED,22,2928
1591645028311949312,2ccc7507304cfd28125f6d85cdb4df769a41aec4f125254d0d2415ba16cb27c2,2022-11-13 12:12:00,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""%d\"",60);\n    return 0;\n}\n",ACCEPTED,5,352
1591645032095211520,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-13 12:12:01,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}",ACCEPTED,8,352
1591645032246161408,55950e2d4c314feed0856fa0f6b80f22c5c36f2ebe0d75c8ee2cadb1a06b2fe1,2022-11-13 12:12:01,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main(){\n    \n    \n    printf(\""%d\"",60);\n    \n    \n    \n    \n    \n    \n    \n    \n    return 0;\n}",ACCEPTED,13,504
1591645032829181952,39afbda4ab6a7df2673bc0d0eec048a42b23ada2774ec941935a2b2fa044515a,2022-11-13 12:12:01,C++,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n{\n    cout << \""60\"" << endl;\n    return 0;\n}\n",ACCEPTED,8,324
1591645034670481408,a57fdafe4877cd9608fc0ac8a5120a47bc60a015785960e61b67b4e66187c2f2,2022-11-13 12:12:02,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\\n\"");\n    return 0;\n}",ACCEPTED,5,348
1591645035916177408,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-13 12:12:02,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,a=60\nprint(a),ACCEPTED,16,2696
1591645036398567424,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 12:12:02,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""%d\"",60);\n    return 0;\n}",ACCEPTED,6,196
1591645039691051008,f6233bf69e5717913375f818af07214d1d2de6df0cd3bcb24368fbde112d6d15,2022-11-13 12:12:03,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,print(60)\n,ACCEPTED,22,2904
1591645051015716864,950b2713b447943280c6052f88160e7298bd0ba94c14d628bbdd70df720305b5,2022-11-13 12:12:06,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"print(\""60\"")",ACCEPTED,24,2756
1591645052689211392,e0156cb930d51b3d5482d43809e7b2c1f54a6b8623fccfa3202e2e53ddf1ffbf,2022-11-13 12:12:06,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\\n\"");\n    return 0;\n}\n",ACCEPTED,13,384
1591645055147106304,129ddfe9d2d4553f365faf2fdc5e2f0c271b2e342a4cff13802dda8ef8b3d1c2,2022-11-13 12:12:07,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"print(\""60\"")",ACCEPTED,20,2868
1591645055163883520,ece045c1570c74e6800520e16047010817642535f83b9f2b4524ebdcf9d7925a,2022-11-13 12:12:07,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\\n\"");\n    return 0;\n}\n",ACCEPTED,12,384
1591645055981772800,190178fcb71270e17fbe689a22517f5296281dfcd3b16ec01748057e49740d1d,2022-11-13 12:12:07,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}\n",ACCEPTED,11,352
1591645064261328896,2cb092ec618cde3657d677b73f7a0a7bfb1e0da02f466007878113e6c4db4792,2022-11-13 12:12:09,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}\n\n",ACCEPTED,5,512
1591645075569172480,303021c0ef4f93101c801ad0c8851ab3828a16b5c728ce8e6859ab342ddc4b26,2022-11-13 12:12:12,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\\n\"");\n    return 0;\n}\n",ACCEPTED,7,204
1591645077477548032,fec6d07e317796c63fb7ae6e7538f75973ad64af6e6196cc27eed3e9e685bf86,2022-11-13 12:12:12,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    printf(\""60\\n\"");\n}",ACCEPTED,15,436
1591645081785098240,4d1157ac6ad50cfc6ca5d6b3e1c2dd7f1ecc593df10ff6888d4207a4f1c03a35,2022-11-13 12:12:13,C++,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    cout<<\""60\"";\n    return 0;\n        \n}",ACCEPTED,10,476
1591645082233888768,899c5501179552dc1fe5639f9047e15d0f835e7a87c8568193377882d0278985,2022-11-13 12:12:13,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"print(\""60\"")",ACCEPTED,23,2816
1591645091083902976,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 12:12:15,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}",ACCEPTED,5,368
1591645095307567104,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-13 12:12:16,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""60\\n\"");\n}",ACCEPTED,11,484
1591645097249484800,0125039c47b4b2d763223fe2b39aac00dd19bf29b4ee1b0e21a506336bfc984e,2022-11-13 12:12:17,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}",ACCEPTED,9,384
1591645101519286272,07d925df8d2026d3171a0a2ca84a6ef7f4a5b47a584cf47b66c5dd8f28139d1f,2022-11-13 12:12:18,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\\n\"");\n    return 0;\n}\n",ACCEPTED,4,356
1591645101838065664,1019ea4e8e67338c8191b6e52878cb69ca9287130af71af3517596fded2f21e4,2022-11-13 12:12:18,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""%2d\\n\"");\n    return 0;\n}\n",WRONG_ANSWER,6,512
1591645105197690880,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-13 12:12:19,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nvoid main()\n{\n    printf(\""68\"");\n    \n}",NON_ZERO_EXIT_CODE,8,324
1591645106321776640,b69ff333cc0daa10fb20c3ba26e439f64260003a8ff6fde3dbc623fd631ba825,2022-11-13 12:12:19,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""%d\""，60);\n    return 0;\n}",COMPILE_ERROR,0,0
1591645106837708800,0aa773cdb5cb621d4131c7d2b98b0724b7e9e93f4310c787c0a9a219d05e0ff2,2022-11-13 12:12:19,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio. h>\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}",COMPILE_ERROR,0,0
1591645109429743616,1c76961e293959cbfa749568290c58d912c131cbc4a710b8bd9a4e58eccf0b8e,2022-11-13 12:12:20,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}\n",ACCEPTED,7,352
1591645112655208448,65b63200c323c6ac4592306f5b943e39af48faf1b19b89cb7079428c6300e115,2022-11-13 12:12:20,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""60\"");\n}",ACCEPTED,7,356
1591645118070022144,2abced548590476f918e32b0d5a4f88aa736e22ac158ed666b7778a0eaff5bae,2022-11-13 12:12:22,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\\n\"");\n    return 0;\n}\n",ACCEPTED,5,348
1591645122272747520,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-13 12:12:23,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nint main ()\n{\n    printf(\""60\"");\n    return 0;\n    \n}",ACCEPTED,8,224
1591645123866537984,902d8082eea06043d392298983db4630cde4418ac8ee42282d537bfaae045c2f,2022-11-13 12:12:23,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"print(\""60\"")",ACCEPTED,18,2916
1591645124906725376,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-13 12:12:23,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n\nint main(){\n    printf(\""60\"");\n    return 0;\n}\n",ACCEPTED,11,500
1591645126831955968,9e0ba8d857885aa94eaa182d3a194e51593598b2d7817b16af4b1b57e49e10de,2022-11-13 12:12:24,Java,0.0,1591610585635213316,1591130116607045632,1049226928954454016,\npublic class Mian {\n\n\tpublic static void main(String[] args) {\n\t\tSystem.out.print(60);\n\n\t}\n\n}\n,COMPILE_ERROR,0,0
1591645127201021952,e807496cefc8b76d55101108daa4cb8e59f87dde49b8197bd619e8a84563990e,2022-11-13 12:12:24,C++,300.0,1591610585635213316,1591130116607045632,1049226928954454016,#include<bits/stdc++.h> \nusing namespace std;\n\nint main()\n{\n\tcout<<60<<endl;\n\treturn 0;\n},ACCEPTED,11,348
1591645130418053120,29d1ea54d6e4e56fc2de0be5ae10ecc4c70c7fca667934b17857e95530f5663a,2022-11-13 12:12:25,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}",ACCEPTED,7,512
1591645136801783808,b8a7ba8e6c41741e66a8153e5f137c86c8dba9c4dbb2f65f35d7554a5b082d56,2022-11-13 12:12:26,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main(){\n    printf(\""60\"");\n    return 0;\n}",ACCEPTED,15,220
1591645140027236352,9d0546dac18a9dc678295254e547925db086add5f872ef42d8015d525afeaf65,2022-11-13 12:12:27,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nint main(){\n    printf(\""60\"");\n}",ACCEPTED,10,196
1591645143772717056,834ba62d861cf2d94a81f3b034a55b21f1378d4337b6b065c321d7da6bf82e17,2022-11-13 12:12:28,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,print(60),ACCEPTED,27,2920
1591645144250900480,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-13 12:12:28,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    printf(\""60\"");\n}",ACCEPTED,7,196
1591645145966338048,fa305ee4bf4c6a54add4e945b551f1e902b95c1a179a91ded55bf7ebb1c87c23,2022-11-13 12:12:28,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\\n\"");\n    return 0;\n}\n",ACCEPTED,4,512
1591645146322853888,e715137eeb4190ade2330123b989bbdd6eebd9a5e1df2e292271d3bfe3a79c69,2022-11-13 12:12:28,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}",ACCEPTED,8,196
1591645158184345600,8f30a940fb84c0203b9f96b4d228374f10f9fdcb64182e702cd07fe56f0f3ee3,2022-11-13 12:12:31,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main(){\n    print(\""60\"");\n}",COMPILE_ERROR,0,0
1591645158972862464,15ac7d06a472ca25d78349f7cc3a73d23c7d7a4f0c4ae3cec6200fcdb8135965,2022-11-13 12:12:31,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    \n    printf(\""60\"");\n   \n    return 0;\n}\n",ACCEPTED,5,348
1591645161938247680,cfc5530a19b24fc4b274f2e4d4609e448c7aecb0325c1717b7f709645428127b,2022-11-13 12:12:32,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"print(\""60\"")",WRONG_ANSWER,18,2944
1591645171392208896,cf40d28790a881d201bf0dd4e1fc1488383e8bfca669ada1909cf2ca7ae62300,2022-11-13 12:12:34,Java,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"public class Main {\n\tpublic static void main(String[] args) {\n\t\tSystem.out.print(\""60\"");\n\t}\n}",ACCEPTED,64,22324
1591645172684054528,b95d43d4e550820a57e0a7b63f63233a65cb813e77be0e6c08c1739f86678946,2022-11-13 12:12:35,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""%d\"",60);\n    return 0;\n}\n",ACCEPTED,9,512
1591645173283840000,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-13 12:12:35,Java,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"public class Main{\n    public static void main(String[] args){\n    System.out.println(\""60\"");\n    }\n}",ACCEPTED,63,22476
1591645179751456768,0aa773cdb5cb621d4131c7d2b98b0724b7e9e93f4310c787c0a9a219d05e0ff2,2022-11-13 12:12:36,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio. h>\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}",COMPILE_ERROR,0,0
1591645180170919936,24daa7a58808ceb95b2ed2e23721ea7b987a061e19ca5fee0ee2d0f93c78507f,2022-11-13 12:12:36,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""60\"")\n        \n        return 0\n}",COMPILE_ERROR,0,0
1591645185422188544,928387ba90b7d3af095968a0f9e0198612ede46fbbd5d1ef0dd919da00a4d7ec,2022-11-13 12:12:38,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}",ACCEPTED,13,196
1591645187846463488,5d1852a153062cc8297ed7a30bb643375395a70654d5dff506fad6bc186e81bd,2022-11-13 12:12:38,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h> \nint main(){\n\tprintf(\""60\"");\n}",ACCEPTED,14,328
1591645188442087424,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-13 12:12:38,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a=60;\n    printf(\""%d\"",a);\n    return 0;\n}",ACCEPTED,9,348
1591645189272526848,e0a829315cc9947a3e714cd579e3322e8dee5f8ca36e30fd276de5a8e294b6f8,2022-11-13 12:12:39,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}",ACCEPTED,9,384
1591645194540605440,af559dccfa68c49b94a61e83fc9942ea0513a50e66ecf36dc005df0e7960903e,2022-11-13 12:12:40,Java,300.0,1591610585635213316,1591130116607045632,1049226928954454016,public class Main{\n    public static void main(String ages[]){\n        System.out.println(60);\n    }\n},ACCEPTED,76,21740
1591645197946380288,705adaf4eb218ca0fc51c6e09291eb309a3de0a7c595448a17d2fdb157e64706,2022-11-13 12:12:41,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nint main{\n    printf(\""60\"");\n    return 0;\n}",COMPILE_ERROR,0,0
1591645202996277248,cf76a6e5773cf2f19ddd635fa646c5a6721f6fed8998d22ea1d0910bee8017a2,2022-11-13 12:12:42,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main()\n{  \n    int i=60;\n    printf(\""%d\"",i);\n}",ACCEPTED,10,484
1591645209686192128,70c675ddfcb60b2192bc8ac38fb068fec0500208a5bf97a796c7cc074b43cf87,2022-11-13 12:12:43,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"print(\""60\"")",ACCEPTED,22,2776
1591645213570129920,f02e276f40ab35b9adfdb6399e4858c8c655e5a7c77ea058b6ff58b6ea670152,2022-11-13 12:12:44,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tprintf(\""60\"");\n    return 0;\n}",ACCEPTED,8,348
1591645223883911168,25584884fd716238437f89484285121d106c1090916ab683be624f210130ebad,2022-11-13 12:12:47,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a=60;\n    printf(\""%d\"",a);\n    return 0;\n}\n",ACCEPTED,5,352
1591645225599393792,5c1ff147303fd43738d51172d4d1fe197154431fc6a4db18bbf58c05c2009330,2022-11-13 12:12:47,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,print(60),ACCEPTED,23,2916
1591645231546949632,8f30a940fb84c0203b9f96b4d228374f10f9fdcb64182e702cd07fe56f0f3ee3,2022-11-13 12:12:49,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main(){\n    printf(\""60\"");\n}",ACCEPTED,5,328
1591645235170795520,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-13 12:12:50,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nint  main()\n{\n    printf(\""68\"");\n    return 0;\n}",WRONG_ANSWER,5,324
1591645239205748736,ac6681ab5fc25ee05ff21b3da74920316506e49f1c09ea3dd6807684b18b6779,2022-11-13 12:12:51,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}",ACCEPTED,8,196
1591645246646398976,8f30a940fb84c0203b9f96b4d228374f10f9fdcb64182e702cd07fe56f0f3ee3,2022-11-13 12:12:52,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main(){\n    printf(\""60\"");\n}",ACCEPTED,7,508
1591645249070751744,0aa773cdb5cb621d4131c7d2b98b0724b7e9e93f4310c787c0a9a219d05e0ff2,2022-11-13 12:12:53,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio. h>\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}",COMPILE_ERROR,0,0
1591645250387730432,bce383372e0b1b627f0a9b838121096ec3ca14c0f213828fca1bf517a82c8744,2022-11-13 12:12:53,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    printf(\""60\"");\n}",ACCEPTED,5,200
1591645257639682048,6cbd81921f92855c6b8318725b09ef7ec48ff579276b3df9f7ea04bea9804678,2022-11-13 12:12:55,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    printf(\""60\\n\"");\n    return 0;\n}\n",ACCEPTED,5,512
1591645259279654912,064270dabaa13edbd7238477860db0e46621a5ed4921e8aa2c0f9258e77722cc,2022-11-13 12:12:55,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\\n\"");\n    return 0;\n}\n",ACCEPTED,6,328
1591645261175513088,24daa7a58808ceb95b2ed2e23721ea7b987a061e19ca5fee0ee2d0f93c78507f,2022-11-13 12:12:56,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""60\"");\n        \n        return 0\n}",COMPILE_ERROR,0,0
1591645261649436672,675867a135da6702ed27c0eec3e4b6d2a7d95c44854c01823fc152f0689f010d,2022-11-13 12:12:56,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    printf(\""60\"");\n    return 0;\n}",ACCEPTED,9,384
1591645262245060608,63bdcc3416dd0c07c03f833ffb02c2f304a4f523deae6a87bed24a730e4d224d,2022-11-13 12:12:56,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}",ACCEPTED,5,368
1591645273267646464,b69ff333cc0daa10fb20c3ba26e439f64260003a8ff6fde3dbc623fd631ba825,2022-11-13 12:12:59,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""%d\"",60);\n    return 0;\n}",ACCEPTED,6,196
1591645275067002880,0da8f2df2eb12ff7cceee22b87284a0e7794d94d4125226481c0842fbed3108a,2022-11-13 12:12:59,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""68\"");\n    return 0;\n}\n",WRONG_ANSWER,5,196
1591645275108958208,03f9d7a6fc27d141b8243d1b2b44a3276cdd4750b5c2621d6d8c006b64ca6514,2022-11-13 12:12:59,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}\n",ACCEPTED,7,196
1591645277248086016,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 12:13:00,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}",ACCEPTED,5,352
1591645280981016576,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-13 12:13:00,Python,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"print(\""%d%d\"",1,2)",WRONG_ANSWER,15,2892
1591645281773740032,98901859b53edd496c40c4ba0469693a8e0ed685a8c2ca3d67a6cca01af154ef,2022-11-13 12:13:01,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\\n\"");\n    return 0;\n}\n",ACCEPTED,7,368
1591645293492580352,78ba72ad62bbe8306c8b3a9b0bcd998483fa2e9f5b653a39aaf1fbe6036a5c10,2022-11-13 12:13:03,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""60\"");\n        return 0;\n}\n",ACCEPTED,6,460
1591645297112264704,1019ea4e8e67338c8191b6e52878cb69ca9287130af71af3517596fded2f21e4,2022-11-13 12:13:04,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a;\n    printf(\""%2d\\n\"",a);\n    return 0;\n}\n",WRONG_ANSWER,8,200
1591645305362472960,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-11-13 12:13:06,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    printf(\""%d\"",60);\\\n        return 0;\n}",ACCEPTED,7,332
1591645310571831296,f74f1cf8202c7b7d33a121c730f9d3964272c7cefa9076e57c0a15d1d098cce0,2022-11-13 12:13:08,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}\n",ACCEPTED,11,352
1591645313272963072,1f15b5b41f9e61f2d767bcb1ae88bef60c94b97dd423bfd2ba9c8c0e8e9d05bb,2022-11-13 12:13:08,Java,300.0,1591610585635213316,1591130116607045632,1049226928954454016,public class Main{\n    public static void main(String args[]){\n        int a=60;\n    System.out.println(a);\n    }\n},ACCEPTED,68,22672
1591645331237134336,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-13 12:13:12,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nint  main()\n{\n    printf(\""60\"");\n    return 0;\n}",ACCEPTED,15,348
1591645338572972032,cb5ee28f5d61aba010f231fd6045de7f8516849eb1dbf293dc5a73a02c3aea2f,2022-11-13 12:13:14,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""60\"");\n}",ACCEPTED,6,324
1591645340452007936,7dd0c628805d8a6777ff5cc70a5ec79db9475f660782b2f4289ae98977303581,2022-11-13 12:13:15,Python,0.0,1591610585635213316,1591130116607045632,1049226928954454016,print('c'),WRONG_ANSWER,16,2796
1591645341538344960,9e0ba8d857885aa94eaa182d3a194e51593598b2d7817b16af4b1b57e49e10de,2022-11-13 12:13:15,Java,0.0,1591610585635213316,1591130116607045632,1049226928954454016,\npublic class Mian {\n\n\tpublic static void main(String[] args) {\n\t\tSystem.out.print(60);\n\t}\n}\n,COMPILE_ERROR,0,0
1591645346928025600,cf568c7ddc8b221335f880bfbaac4634294e65481e738a2e032c1ab9a84d576f,2022-11-13 12:13:16,Java,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n       System.out.println(\""60\"");\n        }\n    \n}",ACCEPTED,66,22504
1591645348270190592,7d46013a6da090b69b62e7be93e7628aee2f7eef31af37777b9ccf1fd1d3eb2e,2022-11-13 12:13:17,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main(){\n    printf(\""60\"");\n    return 0;\n}",ACCEPTED,10,364
1591645353076875264,0da8f2df2eb12ff7cceee22b87284a0e7794d94d4125226481c0842fbed3108a,2022-11-13 12:13:18,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""68\\n\"");\n    return 0;\n}\n",WRONG_ANSWER,9,200
1591645353995415552,9c773df96630087325d11d08f2dbc9851abb095c63fb7b3e55cb667898dfe23f,2022-11-13 12:13:18,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nmain()\n{\n    printf(\""60\\n\"");\n}",ACCEPTED,7,196
1591645358902751232,aa65cdf25cbe32699d085a61c4f3ec5a4020e6a3dc1e0e9d6e2a48c9288f8026,2022-11-13 12:13:19,Java,300.0,1591610585635213316,1591130116607045632,1049226928954454016,public class Main{\n\tpublic static void main(String[] args) {\n\t\tSystem.out.println(60);\n\t}\n\n},ACCEPTED,60,22068
1591645359917785088,6a6dc7e644e57bb2c20b20d39bd4d9541bdebf6415e03e7c13707572c054673e,2022-11-13 12:13:19,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<studio.h>\n#include<\nint main\n{ int a=60;\n  printf\""%d\"",a;  \n    \n    \n    \n}",COMPILE_ERROR,0,0
1591645369602420736,001baa7272d47ab2d3a9b57bf7838570ff03ab1cabb738e7b342b652b1e42a83,2022-11-13 12:13:22,C++,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <iostream>\n#include <bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n    printf(\""68\"");\n\n    return 0;\n}\n",WRONG_ANSWER,13,488
1591645374086144000,24daa7a58808ceb95b2ed2e23721ea7b987a061e19ca5fee0ee2d0f93c78507f,2022-11-13 12:13:23,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}",ACCEPTED,5,384
1591645375113736192,44eff53b3369f1a61cc23d34ceef2d2de14a1f860795a5cf6565b8cf46bfc2ee,2022-11-13 12:13:23,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}",ACCEPTED,14,348
1591645384760635392,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-11-13 12:13:25,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}",ACCEPTED,17,348
1591645394155888640,5d127211f3edce9d9bd1062c03cd08473e4481ec46b4b0c70c2e8d9141c68f20,2022-11-13 12:13:27,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""60\"");\n}",ACCEPTED,15,512
1591645409842618368,34d1cf71a2e3af8f7f6669b464d5dca494efd62633cf73f401f93fdeaa8e22e9,2022-11-13 12:13:31,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\\n\"");\n    return 0;\n}\n",ACCEPTED,7,328
1591645426368131072,c9a8fe962a36cf99ca362f66348b02453584251c62fe2356e11d2a6efd5cee45,2022-11-13 12:13:35,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}\n",ACCEPTED,5,356
1591645433343258624,0da8f2df2eb12ff7cceee22b87284a0e7794d94d4125226481c0842fbed3108a,2022-11-13 12:13:37,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\\n\"");\n    return 0;\n}\n",ACCEPTED,5,484
1591645433586528256,e7f8e9ba366feb4551b7dc8e6a149f796e822980a43de4fcc91ded552c4bcbd4,2022-11-13 12:13:37,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main(int argc, char *argv[]) {\n\tint x=60;\n\tprintf(\""%d\"",x);\n\treturn 0;\n\t\n}",ACCEPTED,5,512
1591645436300242944,739b1156eb9238db78ec0a88314ad93c72ab0c7fc7ecc0396c0a3fa3997af557,2022-11-13 12:13:38,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"print(\""4\"")",WRONG_ANSWER,16,2816
1591645437910855680,f1a9b482617577a636e4a09531695721778faca66954fa117a72ad0fab52cd55,2022-11-13 12:13:38,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""66\"",);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1591645443610914816,9e0ba8d857885aa94eaa182d3a194e51593598b2d7817b16af4b1b57e49e10de,2022-11-13 12:13:39,Java,300.0,1591610585635213316,1591130116607045632,1049226928954454016,\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tSystem.out.print(60);\n\t}\n}\n,ACCEPTED,67,22148
1591645447553572864,001baa7272d47ab2d3a9b57bf7838570ff03ab1cabb738e7b342b652b1e42a83,2022-11-13 12:13:40,C++,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <iostream>\n#include <bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n    printf(\""60\"");\n\n    return 0;\n}\n",ACCEPTED,14,452
1591645447767482368,1f29a576db974352c60cbe8aafdc4e5328b24d800890ab1c712d8c9fa85d72cc,2022-11-13 12:13:40,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tprintf(\""60\"");\n\treturn 0;\n } ",ACCEPTED,4,200
1591645449558450176,23d287b80d4d430308a1b57ee92bb4f2d1b25d1142a13c1c0fda4316c9bb9f17,2022-11-13 12:13:41,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"print(\""60\"")\n",ACCEPTED,16,2780
1591645453169778688,44e63106384b2202d1a15f2fb61b15315a1f0761b20f40b73c55e6122e10f27d,2022-11-13 12:13:42,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"print(\""60\"")",ACCEPTED,15,2768
1591645457619890176,705adaf4eb218ca0fc51c6e09291eb309a3de0a7c595448a17d2fdb157e64706,2022-11-13 12:13:43,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nint main\n{\n    printf(\""60\"");\n    return 0;\n}",COMPILE_ERROR,0,0
1591645467279372288,e7e6ce2c6e9e530eaf2b9b9968748a0e44e3ac7183d73deb51851946350bfbb0,2022-11-13 12:13:45,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{   printf(\""60\"")；\n\n    return 0;\n}\n",COMPILE_ERROR,0,0
1591645476125171712,4e97dffad9953b68d5edd2be07bfc6fdc17c63c845c8ee056e07353c9a386309,2022-11-13 12:13:47,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main(){\n    printf(\""60\"");\n        return 0;\n}",ACCEPTED,8,196
1591645482123059200,b31601c92a4a3080abbaad650e00bb77253224eab66b59a49b2118d017649c2c,2022-11-13 12:13:48,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}\n",ACCEPTED,8,196
1591645484408922112,bd8243b4b064cae986196b0eac310a36f12d46dc08f126fbdcaaca530c884eb0,2022-11-13 12:13:49,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}",ACCEPTED,5,356
1591645515820064768,3e087b0a196d30fcbb49ca80164c9eb5adf82ae3bb08ec0c141e5728fb180f0d,2022-11-13 12:13:56,Java,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"public class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tSystem.out.print(\""60\"");\n\t}\n\n}",ACCEPTED,63,22176
1591645520433799168,453285058ad721dec4e5d0f61707f295aaddf066021a84ead6a70901f10455df,2022-11-13 12:13:58,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}\n",ACCEPTED,5,196
1591645520677068800,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-13 12:13:58,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}\n",ACCEPTED,9,352
1591645523063627776,217f1946625720e554af7294d3599b943eea3b430c0df7aa0c5c70abe9904e56,2022-11-13 12:13:58,Java,300.0,1591610585635213316,1591130116607045632,1049226928954454016,public class Main{\n    public static void main(String[] args){\n        System.out.println(60);\n    }\n},ACCEPTED,67,22436
1591645547117961216,f1a9b482617577a636e4a09531695721778faca66954fa117a72ad0fab52cd55,2022-11-13 12:14:04,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""90\"");\n    return 0;\n}\n",WRONG_ANSWER,11,328
1591645563681267712,262cde49cc56abe96630625fe60c7207e4f635bd56c839389b503b1f360d8ab2,2022-11-13 12:14:08,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}",ACCEPTED,5,364
1591645581888741376,6a835d762a87e93baf4142897168374dc31e9da90b86c19ed82f21159b644272,2022-11-13 12:14:12,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    printf(\""60\"");\n}",ACCEPTED,5,348
1591645590701006848,42cfad7191c5e6c0eee156c4369182744d6c5db3bc2a5dc87f9f1be6ee4bbcfe,2022-11-13 12:14:14,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main({\n    printf(\""%d\"",60);\n    return 0;\n})",COMPILE_ERROR,0,0
1591645595021139968,1b00b3d29099722d8332b35e3af5e54fda309b4f7c9fc6261f618ecd2a4d7390,2022-11-13 12:14:15,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}",ACCEPTED,6,192
1591645604512849920,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-13 12:14:18,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,print(60),ACCEPTED,18,2764
1591645631113093120,105cc8c0a5a465ab713603b461d92ac587c87767965625687540cd513f7ebb57,2022-11-13 12:14:24,C++,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<bits/stdc++.h>\n#define N 10005\n#define endl '\\n'\n#define int long long\n#define ios ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)\n\n//const int dir[4][2]={-1,0,0,1,1,0,0,-1};\n//const int mod=1e9+7;\nusing namespace std;\n\ninline int read() {\n    char c = getchar(); int num = 0, sign = 1;\n    while(c < '0' || c > '9') {if(c == '-') sign = -1; c = getchar();}\n    while(c >= '0' && c <= '9') num = num * 10 + c - '0', c = getchar();\n    return num * sign;\n}\n\nvoid solve(){\n\tcout<<\""60\"";\n}\n\nsigned main() {\n\tios;\n\tint count=1;\n\t//cin>>count;\n\twhile(count--)\n\t{\n\t\tsolve();\n\t}\n\treturn 0;\n}\n",ACCEPTED,13,584
1591645634254626816,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-13 12:14:25,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,print(60);,ACCEPTED,16,2688
1591645635630391296,f1a9b482617577a636e4a09531695721778faca66954fa117a72ad0fab52cd55,2022-11-13 12:14:25,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}\n",ACCEPTED,8,200
1591645637287096320,e7e6ce2c6e9e530eaf2b9b9968748a0e44e3ac7183d73deb51851946350bfbb0,2022-11-13 12:14:25,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}\n",ACCEPTED,9,340
1591645647974195200,29249e539dec3766ca388aaa46121bd2a768da21260d3f436e20eeaac8ee73b3,2022-11-13 12:14:28,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\\n\"");\n    return 0;\n}\n",ACCEPTED,5,324
1591645657679802368,99481c5a0804ff1b45cf32a79326675aa759c0780ab1ad0d29f845666cb83208,2022-11-13 12:14:30,Java,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"package test;\n\npublic class test {\n\tpublic static void main(String[] args) {\n\t\tSystem.out.println(\""60\"");\n\t}\n}\n",COMPILE_ERROR,0,0
1591645667792314368,6a6dc7e644e57bb2c20b20d39bd4d9541bdebf6415e03e7c13707572c054673e,2022-11-13 12:14:33,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<studio.h>\n\nint main\n{ \n  int a=60;\n  printf(\"" %d\"",a);  \n    \n    \n   return 0; \n}",COMPILE_ERROR,0,0
1591645691511070720,42cfad7191c5e6c0eee156c4369182744d6c5db3bc2a5dc87f9f1be6ee4bbcfe,2022-11-13 12:14:38,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main(){\n    printf(\""%d\"",60);\n    return 0;\n}",ACCEPTED,5,384
1591645702416261120,b7ca5a176d530473c8faa24fa803cc5b5bef6deef335789b05821ec37e6b8252,2022-11-13 12:14:41,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a=60;\n    printf(\""%d\"",a);\n    return 0;\n}\n",ACCEPTED,9,196
1591645724411179008,6ba5ecacf3381a1e9382f99c413290eca40a071a563a618e5f36d66cbf9a5e1b,2022-11-13 12:14:46,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main(){\n    printf(\""60\"");\n}",ACCEPTED,8,196
1591645726176993280,7a048784ed2975c30a64787731af1fce175495afd1f4aad852d064d00b6193b9,2022-11-13 12:14:47,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,print(60),ACCEPTED,18,2760
1591645749577015296,99481c5a0804ff1b45cf32a79326675aa759c0780ab1ad0d29f845666cb83208,2022-11-13 12:14:52,Java,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"package test;\n\npublic class test {\n\tpublic static void main(String[] args) {\n\t\tSystem.out.println(\""60\"");\n\t}\n}\n",COMPILE_ERROR,0,0
1591645750269075456,1019ea4e8e67338c8191b6e52878cb69ca9287130af71af3517596fded2f21e4,2022-11-13 12:14:52,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n\n    printf(\""60\\n\"");\n    return 0;\n}\n",ACCEPTED,7,328
1591645773899771904,64b76cc355daf11e96a19b338c58e56c05289d7e3809e9695a09e71771618713,2022-11-13 12:14:58,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\\n\"");\n    return 0;\n}",ACCEPTED,6,348
1591645779776036864,356d4d261b0c273ed9edf9a21f22e4b180080ccba0f8bbfa0c58f889e1a800cc,2022-11-13 12:14:59,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\\n\"");\n    return 0;\n}",ACCEPTED,7,196
1591645793088724992,7935e8f5cb04027f4d30ac84a997e2d03e946e112c1cb17f1a4f943d8b0b54bf,2022-11-13 12:15:03,C++,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <iostream>\n#include<stdio.h>\n#include<algorithm>\n\nusing namespace std;\n\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}\n",ACCEPTED,5,464
1591645799388569600,7dd0c628805d8a6777ff5cc70a5ec79db9475f660782b2f4289ae98977303581,2022-11-13 12:15:04,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""%d\"",68)\n}",COMPILE_ERROR,0,0
1591645810574766080,6a4a105e99255cc39ebb6a122c9fdf740e574dbb708100363b339265f92e1bbf,2022-11-13 12:15:07,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nint main(){\n    printf(\""60\"");\n    return 0;\n}",ACCEPTED,5,196
1591645823077998592,efa7a60e7fa0d7fd13e87b47555eb8bfc0c4da0695990711fb851b886de3de22,2022-11-13 12:15:10,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,print(60),ACCEPTED,22,2952
1591645840102666240,99481c5a0804ff1b45cf32a79326675aa759c0780ab1ad0d29f845666cb83208,2022-11-13 12:15:14,Java,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"\npublic class test {\n\tpublic static void main(String[] args) {\n\t\tSystem.out.println(\""60\"");\n\t}\n}\n",COMPILE_ERROR,0,0
1591645842489225216,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-13 12:15:14,C++,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<iostream>\nusing namespace std;\n\nint main(){\n    cout<<\""60\""<<endl;\n    return 0;\n}",ACCEPTED,15,464
1591645865851543552,62c83306b4f5c482e4e9a52dc69ae0b8ee7b5238abb34e56352843a0d484ff2c,2022-11-13 12:15:20,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,print(60),ACCEPTED,19,2688
1591645890304303104,7dd0c628805d8a6777ff5cc70a5ec79db9475f660782b2f4289ae98977303581,2022-11-13 12:15:26,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""%d\"",68);\n}\nreturn 0;",COMPILE_ERROR,0,0
1591645894943191040,cfc5530a19b24fc4b274f2e4d4609e448c7aecb0325c1717b7f709645428127b,2022-11-13 12:15:27,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,print(60),WRONG_ANSWER,16,2764
1591645898437058560,64475a8ecd7d5a6c6e734f3f299283e039c26933b2a0e510cd9d22e95ba92068,2022-11-13 12:15:28,C++,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <iostream>\n#include <cstdio>\n#include <fstream>\n#include <algorithm>\n#include <cmath>\n#include <deque>\n#include <vector>\n#include <queue>\n#include <string>\n#include <cstring>\n#include <map>\n#include <stack>\n#include <set>\nusing namespace std;\n\n\nint main()\n{\n    cout<<\""60\"";\n    \n    \n\n    return 0;\n}\n",ACCEPTED,10,324
1591645899569508352,6a6dc7e644e57bb2c20b20d39bd4d9541bdebf6415e03e7c13707572c054673e,2022-11-13 12:15:28,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<studio.h>\n#\nint main\n{ \n  int a=60;\n  printf(\"" %2d\"",a);   \n   return 0; \n}",COMPILE_ERROR,0,0
1591645909707153408,65ac58572a882f9de09782bce337ee95c6ab91ac6b377f6d29c3ee19b1a17f1a,2022-11-13 12:15:30,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main(){\n    printf(\""60\"");\n    return 0;\n}",ACCEPTED,10,196
1591645954280054784,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-13 12:15:41,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main()\n{int f;\n f=60;\n printf(\""%d\\n\"",f);\n\n\n\n\n\n\n\n\n\nreturn 0;\n}",ACCEPTED,8,196
1591645970197438464,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-13 12:15:45,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\n\nint main(){\n\tprintf(\""60\"");\n}",ACCEPTED,7,196
1591645973737398272,bcc80c637e0ae4837743d463049e862b206c31483ff6a67b35742ac5d66647d7,2022-11-13 12:15:46,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    printf(\""60\\n\"");\n    return 0;\n}\n",ACCEPTED,9,512
1591645982591574016,c03ae905b4de4d41e5d9328da5270539e1a32e2d888b8dd41fb10f72c24a90ce,2022-11-13 12:15:48,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\n\nint main(int argc, char *argv[]) {\n\tprintf(\""60\"")\n\treturn 0;\n}",COMPILE_ERROR,0,0
1591645983602401280,9819f13d6a58d50fa249ad037641119dadb52afb3f125db258771564f27d2ca5,2022-11-13 12:15:48,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nint main(){\n    printf(\""60\\n\"");\n    return 0;\n}",ACCEPTED,6,196
1591645987339526144,0d24b4ee85e6e3a4cc694f7e11105fa2aaf93fd10d4cbe81657f252e2d675435,2022-11-13 12:15:49,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>、\n#include <math.h>\nint main()\n{\n    int n,m;\n\n\n   // printf(\""%d \\n\"",n);\n    printf(\""60\"");\n\n\n\n    return 0;\n}\n",ACCEPTED,8,196
1591646014334066688,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-13 12:15:55,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <math.h>\n#include <stdio.h>\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}",ACCEPTED,8,332
1591646020520665088,1363fe5b260b83108efff76d53fc3ee37db1aa74f7eb5c5c7e6dacb996b49862,2022-11-13 12:15:57,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}\n",ACCEPTED,4,340
1591646021657321472,7dd0c628805d8a6777ff5cc70a5ec79db9475f660782b2f4289ae98977303581,2022-11-13 12:15:57,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,print('60'),ACCEPTED,17,2876
1591646029374840832,8cf8229a23351e1ca2a7bfc1ad0af3ab2ad4a709a7c796637dbdea7befc2b0ec,2022-11-13 12:15:59,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}\n",ACCEPTED,5,196
1591646044625330176,cfc5530a19b24fc4b274f2e4d4609e448c7aecb0325c1717b7f709645428127b,2022-11-13 12:16:03,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"print(\""4\"")",WRONG_ANSWER,16,2760
1591646044990234624,63a19c717d077fecd1be96314929ebf3516f35619209eacac77081bb07edebb5,2022-11-13 12:16:03,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n   printf(\""60\"");\n}\n",ACCEPTED,8,512
1591646058932088832,c03ae905b4de4d41e5d9328da5270539e1a32e2d888b8dd41fb10f72c24a90ce,2022-11-13 12:16:06,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\n\nint main() {\n\tprintf(\""60\"")；\n\treturn 0;\n}",COMPILE_ERROR,0,0
1591646062425956352,705adaf4eb218ca0fc51c6e09291eb309a3de0a7c595448a17d2fdb157e64706,2022-11-13 12:16:07,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\\n\"");\n    return 0;\n}\n",ACCEPTED,5,356
1591646080042020864,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-13 12:16:11,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n  printf(\""60\"");\n}",ACCEPTED,6,372
1591646087696637952,a27ecb139a3fa065feadb903517977dc609a6d218c4e082e7ec449c78806823c,2022-11-13 12:16:13,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}",ACCEPTED,8,384
1591646113734877184,1e783de44f6cf9abb158b108e556a36ef99d9241fc592b40cfd6cb7d1265eb34,2022-11-13 12:16:19,Java,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tSystem.out.println(\""60\"");\n\t}\n}\n\n",ACCEPTED,67,22584
1591646116893220864,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-13 12:16:20,Python,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    printf(\""60\"");\n}\nreturn 0;",NON_ZERO_EXIT_CODE,16,2888
1591646119816605696,81f258582663b08bc9b4d77bba77afc3b463021ec8fb2262453de07687484cd5,2022-11-13 12:16:20,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"P = input()\nQ = input()\nR = input()\nP = int(P),Q = int(Q),R = int(R)\n",NON_ZERO_EXIT_CODE,19,2776
1591646132290510848,99481c5a0804ff1b45cf32a79326675aa759c0780ab1ad0d29f845666cb83208,2022-11-13 12:16:23,Java,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"\npublic class test {\n\t\n\t\tSystem.out.println(\""60\"");\n\n}\n",COMPILE_ERROR,0,0
1591646145351540736,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-13 12:16:27,C++,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    printf(\""60\"");\n}\nreturn 0;",COMPILE_ERROR,0,0
1591646219334856704,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-13 12:16:44,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"print(\""60\"")",ACCEPTED,16,2816
1591646252931231744,80bb854046efddc8db8117414c5ff582f99d3347454c32f734c77c16dc462ed6,2022-11-13 12:16:52,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\\n\"");\n    return 0;\n}",ACCEPTED,5,196
1591646286036918272,6a6dc7e644e57bb2c20b20d39bd4d9541bdebf6415e03e7c13707572c054673e,2022-11-13 12:17:00,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<studio.h>\nint main\n{ \n  int a=60;\n  printf(\"" %d\"",a);   \n  return 0; \n}",COMPILE_ERROR,0,0
1591646295658618880,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 12:17:02,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"n=int（input()）\nl = [0]*num\nfor i in range(0,num):\n    l[i]=real(input())\n    for i range(0,num)\n",NON_ZERO_EXIT_CODE,16,2760
1591646319830392832,212aee9dc233539050d1d324af20b580172711970f7c24349b9c7c8ac9b114cd,2022-11-13 12:17:08,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""%d\"",60);\n    return 0;\n}\n",ACCEPTED,12,328
1591646328260943872,37ec44401a5a9f0dfa02d2aedaf5edff84fc443d98174af5f21ab01a7d6f6a41,2022-11-13 12:17:10,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\\n\"");\n    return 0;\n}\n",ACCEPTED,5,328
1591646331159240704,ddd0edd80a23dfec88d0679f4ed6037779b80d26db4ba0f74fecb3d447de61fa,2022-11-13 12:17:11,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main(){\n    printf(\""60\"");\n}",ACCEPTED,5,208
1591646339208065024,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-13 12:17:13,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}",ACCEPTED,8,352
1591646347332444160,212aee9dc233539050d1d324af20b580172711970f7c24349b9c7c8ac9b114cd,2022-11-13 12:17:15,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""%d\"",60);\n    return 0;\n}\n",ACCEPTED,12,200
1591646361370812416,d21dc339d37b0772b2547441444d4b660b000ac3ebe190aee01769e2dd619c10,2022-11-13 12:17:18,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"print(\""60\"")",ACCEPTED,20,2888
1591646400046444544,13eac09c9e523ec396926840225e626f8fff54ca0e8a92e46e533705daa83ac2,2022-11-13 12:17:27,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,print(60),ACCEPTED,15,2760
1591646404861550592,b73a04f1a7af1c2516ca68b38e336912bdf10c4f4bf7bac55e4e0de29dcf3d9d,2022-11-13 12:17:28,C++,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <bits/stdc++.h>\n\nint main(){\n\tprintf(\""60\"");\n\treturn 0;\n} ",ACCEPTED,6,324
1591646410666422272,c47b15e117166a3dd00078b9f795673d5284a2761e582479119229751cc734d3,2022-11-13 12:17:30,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"# include<stdio.h>\nint main(){\n    printf(\""60\"");\n    return 0;\n}",ACCEPTED,5,344
1591646438051045376,c03ae905b4de4d41e5d9328da5270539e1a32e2d888b8dd41fb10f72c24a90ce,2022-11-13 12:17:36,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,print(60),ACCEPTED,16,2692
1591646438575333376,e0ad880549bf3b7847204a80a93841fe1f47e1fb8bc464088cb521848107cfde,2022-11-13 12:17:36,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\\n\"");\n    return 0;\n}\n",ACCEPTED,5,352
1591646446368382976,0ccbaaa612b3d01dbe621ce5e7366d6e26d2e5adf55047d92c6eb7adf78a979d,2022-11-13 12:17:38,C++,0.0,1591610585635213314,1591128862958940160,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int n;cin>>n;\n    int a[n];\n    for(int i=0;i<n-1;i++)\n        cin>>a[i];\n    a[n-1]=n;\n    sort(a,a+n);\n    for(int i=n-1;i>=0;i--)\n    {\n        if(i!=n-1) cout<<\"" \"";\n        cout<<a[i];\n    }\n    return 0;\n}\n",WRONG_ANSWER,10,488
1591646562240225280,00d0a1b2e987c17fb50850b9ec54bf6b4f8b997eb053d1a9fed6c4888fbe74ed,2022-11-13 12:18:06,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int n,i,j,m;\n    char s[n];\n    scanf(\""%d\"",&n);\n    scanf(\""%s\"",&s[]);\n    for(i=0;i<n;i++)\n        if(s[i]==s[i+1])\n        {\n            m=i;\n            for(j=0;j<n;j++)\n                s[i+2]=s[i];\n        }\n    for(i=0;i<n;i++)\n    {\n        pirntf(\""%s\"",s);\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1591646577998180352,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-13 12:18:10,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint main(){\n\tcout<<60;\n\treturn 0;\n},COMPILE_ERROR,0,0
1591646591180877824,6cbd81921f92855c6b8318725b09ef7ec48ff579276b3df9f7ea04bea9804678,2022-11-13 12:18:13,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int P,Q,R;\n    int min;\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    min=P+Q;\n    printf(\""%d\\n\"",min);\n    return 0;\n}",WRONG_ANSWER,19,348
1591646594414686208,0aa773cdb5cb621d4131c7d2b98b0724b7e9e93f4310c787c0a9a219d05e0ff2,2022-11-13 12:18:14,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}",ACCEPTED,5,196
1591646602283200512,acfcf65f14b5d3b02c3225372654b4e21f04d33a8bbaeb346e4fb1d85f2ea94f,2022-11-13 12:18:16,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nint main{\n    int a;\n    scanf(\""%d\"",&a);\n    printf(\""%d\"",a*60)\n     return 0;   \n}",COMPILE_ERROR,0,0
1591646621832896512,157388d8d83262bba5955406e39bb36c3baacd3a224f63ce1739541bb582af20,2022-11-13 12:18:20,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i；\n        i=60;\n    printf(\""%d\"",i);\n}",COMPILE_ERROR,0,0
1591646622810136576,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-13 12:18:20,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int a[10],i,x,y,s=0;\n    scanf(\""%d\"",&i);\n    for(x=0;x<i;x++)\n        scanf(\""%d\"",&a[x]);\n    for(x=0;x<i;x++)\n    {\n        if(a[x]==a[x+1]) \n        {\n            for(y=x+1;y<i;y++)\n                a[y]=a[y+1];\n            s++;\n        }\n    }\n    printf(\""%d\"",s);\n}",SEGMENTATION_FAULT,5,512
1591646624987013120,27fbb32d960dbf49665c8905b68012d602eda68987686c6f224ec7b49ca3d0ac,2022-11-13 12:18:21,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tprintf(\""60\\n\"");\n\treturn 0;\n} ",ACCEPTED,5,192
1591646646424055808,667c2e97e82c372f60661d46943ff56a17c9350387f4364ebabe70ac2e232862,2022-11-13 12:18:26,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,s;\n    scanf(\""%d\"",&n);\n    scanf(\""%d\"",&s);\n    printf(\""%d\"",n);\n    return 0;\n}\n\n",WRONG_ANSWER,8,324
1591646687729561600,acfcf65f14b5d3b02c3225372654b4e21f04d33a8bbaeb346e4fb1d85f2ea94f,2022-11-13 12:18:36,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nint main{\n    int a;\n    scanf(\""%d\"",&a);\n    printf(\""%d\"",a*60);\n     return 0;   \n}",COMPILE_ERROR,0,0
1591646703143641088,157388d8d83262bba5955406e39bb36c3baacd3a224f63ce1739541bb582af20,2022-11-13 12:18:40,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i;\n        i=60;\n    printf(\""%d\"",i);\n}",ACCEPTED,6,328
1591646708839538688,0b693affc66d8d407ff008bd1aaf4f2feb4a615f057943ba4b4ba3163d937dc6,2022-11-13 12:18:41,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,print(60),ACCEPTED,17,2760
1591646741391486976,bce383372e0b1b627f0a9b838121096ec3ca14c0f213828fca1bf517a82c8744,2022-11-13 12:18:49,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int i,j,k;\n    printf(\""请输入三个整数：\\n\"");\n    scanf(\""%d %d %d\"",&i,&j,&k);\n    printf(\""从A到B花费%d块钱，从B到C花费%d块钱，此时所有地点都去过了，总花费为%d块钱。\"",i,j,i+j);\n}",WRONG_ANSWER,7,324
1591646758491664384,acfcf65f14b5d3b02c3225372654b4e21f04d33a8bbaeb346e4fb1d85f2ea94f,2022-11-13 12:18:53,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nint main(){\n    int a;\n    scanf(\""%d\"",&a);\n    printf(\""%d\"",a*60);\n     return 0;   \n}",WRONG_ANSWER,5,196
1591646764917338112,6a6dc7e644e57bb2c20b20d39bd4d9541bdebf6415e03e7c13707572c054673e,2022-11-13 12:18:54,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<studio.h>\nint main\n{ \n \n  printf(\""60\"");   \n  return 0; \n}",COMPILE_ERROR,0,0
1591646772836196352,e67d0171967fcfdd3835361399616ff4e60e12e62c2ed2fd59506c58aeaae4ad,2022-11-13 12:18:56,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x;\n    x=60;\n    printf(\""输出一个两位数整数；%d\"",x);\n}",WRONG_ANSWER,5,332
1591646781916852224,17759f531671f838bf3fae4270190e93b6109026f9503f986c1ed85bb412007d,2022-11-13 12:18:58,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,min,a[3],b[3];\n    for(i=0;i<3;i++)\n        scanf(\""%d\"",&a[i]);\n    b[0]=a[0]+a[1];\n    b[1]=a[1]+a[2];\n    b[2]=a[2]+a[0];\n    min=b[0];\n    for(i=1;i<3;i++)\n    {\n        if(min>b[i])\n            min=b[i];\n    }\n    printf(\""%d\"",min);\n}",ACCEPTED,30,348
1591646807506313216,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-13 12:19:04,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\n    printf(\""60\\n\"");\n        return 0;\n    \n}\n",ACCEPTED,4,328
1591646831199924224,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-13 12:19:10,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,print(60),ACCEPTED,16,2760
1591646886258565120,6a6dc7e644e57bb2c20b20d39bd4d9541bdebf6415e03e7c13707572c054673e,2022-11-13 12:19:23,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<studio.h>\nint main\n{\n  printf(\""60\"");   \n  return 0; \n}",COMPILE_ERROR,0,0
1591646912280027136,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-13 12:19:29,C++,300.0,1591610585635213316,1591130116607045632,1049226928954454016,#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint main(){\n\tcout<<60;\n\treturn 0;\n},ACCEPTED,7,324
1591646914377166848,6a6dc7e644e57bb2c20b20d39bd4d9541bdebf6415e03e7c13707572c054673e,2022-11-13 12:19:30,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<studio.h>\nint main\n{\n  printf(\""60\"");\n  return 0; \n}",COMPILE_ERROR,0,0
1591646945956093952,6a6dc7e644e57bb2c20b20d39bd4d9541bdebf6415e03e7c13707572c054673e,2022-11-13 12:19:37,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <studio.h>\nint main\n{\n  printf(\""60\"");\n  return 0; \n}",COMPILE_ERROR,0,0
1591647003610996736,99481c5a0804ff1b45cf32a79326675aa759c0780ab1ad0d29f845666cb83208,2022-11-13 12:19:51,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}\n",ACCEPTED,8,200
1591647006656094208,00d0a1b2e987c17fb50850b9ec54bf6b4f8b997eb053d1a9fed6c4888fbe74ed,2022-11-13 12:19:52,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}",ACCEPTED,5,324
1591647052793438208,6a6dc7e644e57bb2c20b20d39bd4d9541bdebf6415e03e7c13707572c054673e,2022-11-13 12:20:03,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nint main\n{\n    printf(\""60\"");\n    return 0;\n}",COMPILE_ERROR,0,0
1591647074842894336,e67d0171967fcfdd3835361399616ff4e60e12e62c2ed2fd59506c58aeaae4ad,2022-11-13 12:20:08,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x;\n    x=60;\n    printf(\""%d\"",x);\n}",ACCEPTED,5,484
1591647103980679168,4812f9582f90b7f3f95178a62ec39f3555e90b935658da3e31a47fe0d2e8c6fd,2022-11-13 12:20:15,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main()\n{int i;\n    printf(\""%d\"",60);\n return o;\n}",COMPILE_ERROR,0,0
1591647121731018752,acfcf65f14b5d3b02c3225372654b4e21f04d33a8bbaeb346e4fb1d85f2ea94f,2022-11-13 12:20:19,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nint main(){\n    int a;\n    scanf(\""%d\"",&a);\n    printf(\""%d\"",a*60);\n     return 0;   \n}",WRONG_ANSWER,14,372
1591647135278575616,6a6dc7e644e57bb2c20b20d39bd4d9541bdebf6415e03e7c13707572c054673e,2022-11-13 12:20:23,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}",ACCEPTED,6,196
1591647154828226560,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 12:20:27,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int p,q,r,sum;\n    scanf(\""%d %d %d\"",&p,&q,&r);\n    if(p<q&&p<r)\n        sum=p+q;\n    if(q<p&&q<r)\n        sum=q+r;\n    if(r<p&&r<q)\n        sum=r+p;\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,22,512
1591647175032201216,0aa773cdb5cb621d4131c7d2b98b0724b7e9e93f4310c787c0a9a219d05e0ff2,2022-11-13 12:20:32,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}",ACCEPTED,14,620
1591647194372124672,33066437ddee11f609c900fe8dbd59cb8113e4d8dfd13c1812f199f4f3fdd334,2022-11-13 12:20:37,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int p,q,r;\n    int tem;\n    scanf(\""%d%d%d\"",&p,&q,&r);\n    tem=p;\n    if(tem<q)\n        tem=q;\n     if(tem<r)\n        tem=r;\n    printf(\""%d\"",p+q+r-tem);\n    return 0;\n}\n",ACCEPTED,56,364
1591647195227774976,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-13 12:20:37,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main()\n{\n    int a,b,c,sum;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    sum=a+c;\n    if(a+b<=a+c) sum=a+b;\n    if(b+c<=a+b) sum=b+c;\n    printf(\""%d\\n\"",sum);\n    \n    \n    \n    \n    \n    \n    \n    \n    \n    return 0;\n}",ACCEPTED,30,624
1591647196741951488,bce383372e0b1b627f0a9b838121096ec3ca14c0f213828fca1bf517a82c8744,2022-11-13 12:20:37,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int i,j,k;\n    printf(\""请输入三个整数：\\n\"");\n    scanf(\""%d %d %d\"",&i,&j,&k);\n    if(i+j<i+k || i+k<j+k)\n        printf(\""从A到B花费%d块钱，从B到C花费%d块钱，此时所有地点都去过了，总花费为%d块钱。\"",i,j,i+j);\n}",WRONG_ANSWER,9,220
1591647237938360320,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-13 12:20:47,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int a[10],i,x,y,s=0;\n    scanf(\""%d\"",&i);\n    for(x=0;x<i;x++)\n        scanf(\""%d\"",&a[x]);\n    for(x=0;x<i;x++)\n    {\n        if(a[x]==a[x+1]) \n        {\n            for(y=x+1;y<i-x;y++)\n                a[y]=a[y+1];\n            s+=2;\n        }\n    }\n    printf(\""%d\"",s);\n}",SEGMENTATION_FAULT,5,208
1591647252450664448,038e42376e9858a5a0d1826a17de3e149da6c7deb129501295633acdb2780aff,2022-11-13 12:20:51,Python,0.0,1591610585635213316,1591130116607045632,1049226928954454016,printf（60）,NON_ZERO_EXIT_CODE,20,2960
1591647287183695872,eeab3421c2b685f7d51b09a289b82fe82ba0d3896984d09aeffb9d022232d887,2022-11-13 12:20:59,Java,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.Scanner;\nimport java.util.StringTokenizer;\n\npublic class Main {\n    public static void main(String[] args) {\n        FastReader fastReader =  new FastReader();\n        int P = fastReader.nextInt();\n        int Q = fastReader.nextInt();\n        int R = fastReader.nextInt();\n        int sum = 0;\n        sum = (P+Q)<(R+P)?(P+Q):(R+P);\n        sum = sum<(Q+R)?sum:(Q+R);\n        System.out.println(sum);\n\n\n    }\n\n\n    static class FastReader {\n        BufferedReader br;\n        StringTokenizer st;\n        public FastReader()\n        {\n            br = new BufferedReader(\n                    new InputStreamReader(System.in));\n        }\n\n\n        String next()\n        {\n            while (st == null || !st.hasMoreElements()) {\n                try {\n                    st = new StringTokenizer(br.readLine());\n                }\n                catch (IOException e) {\n                    e.printStackTrace();\n                }\n            }\n            return st.nextToken();\n        }\n\n\n\n        int nextInt() { return Integer.parseInt(next()); }\n\n        long nextLong() { return Long.parseLong(next()); }\n\n        double nextDouble(){return Double.parseDouble(next());}\n\n\n        String nextLine()\n        {\n            String str = \""\"";\n\n            try {\n                if (st!= null && st.hasMoreTokens()){\n                    str = st.nextToken(\""\\n\"");\n                } else {\n                    str = br.readLine();\n                }\n            }\n            catch (IOException e) {\n                e.printStackTrace();\n            }\n            return str;\n        }\n\n\n    }\n}\n\n\n\n",ACCEPTED,350,22880
1591647298634145792,038e42376e9858a5a0d1826a17de3e149da6c7deb129501295633acdb2780aff,2022-11-13 12:21:02,Python,0.0,1591610585635213316,1591130116607045632,1049226928954454016,print（60）,NON_ZERO_EXIT_CODE,15,2760
1591647314664763392,ccc42b8437aa15d1214e4623799ed35cd8ea8087c26cb1b596d51ae4556ea39c,2022-11-13 12:21:05,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"a,b,c=input().split()\na=int(a)\nb=int(b)\nc=int(c)\nif a<b:\n    min1=ab\n    min2=b\nelse:\n    min1=b\n    min2=a\nif min2<=c:\n    pass\nelse:\n    min2=c\nprint(min1+min2)",NON_ZERO_EXIT_CODE,20,2752
1591647351373324288,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-13 12:21:14,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"print(\""60\"")",ACCEPTED,17,2888
1591647388757143552,c76414e1d2d8531a5745e9bd3192aafa7cca924e645650ffe7954c992cc13b33,2022-11-13 12:21:23,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,n=int(input())\nt=0\nstr=input()\nfor i in range(len(str)-1):\n    if str[i]!=str[i+1]:\n        t=t+2\n        del str[i]\n        del str[i+1],NON_ZERO_EXIT_CODE,16,2816
1591647390954958848,acfcf65f14b5d3b02c3225372654b4e21f04d33a8bbaeb346e4fb1d85f2ea94f,2022-11-13 12:21:24,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nint main(){\n    int a;\n    scanf(\""%d\"",&a);\n    printf(\""%d\"",a*60);\n     return 0;   \n}",WRONG_ANSWER,4,196
1591647398919942144,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 12:21:25,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int p,q,r,sum;\n    scanf(\""%d %d %d\"",&p,&q,&r);\n    if(p<=q&&p<=r)\n        sum=p+q;\n    if(q<=p&&q<=r)\n        sum=q+r;\n    if(r<=p&&r<=q)\n        sum=r+p;\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,19,348
1591647423758610432,81f258582663b08bc9b4d77bba77afc3b463021ec8fb2262453de07687484cd5,2022-11-13 12:21:31,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"P = input()\nQ = input()\nR = input()\nP = int(P),Q = int(Q),R = int(R)\na =  P + Q\nb = P +R\nc =  R +P\nd = min(a,b,c)\nprint(d)",NON_ZERO_EXIT_CODE,21,2816
1591647435691405312,ccc42b8437aa15d1214e4623799ed35cd8ea8087c26cb1b596d51ae4556ea39c,2022-11-13 12:21:34,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"a,b,c=input().split()\na=int(a)\nb=int(b)\nc=int(c)\nif a<b:\n    min1=ab\n    min2=b\nelse:\n    min1=b\n    min2=a\nif min2<=c:\n    pass\nelse:\n    min2=c\nprint(min1+min2)",NON_ZERO_EXIT_CODE,17,2920
1591647441076903936,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 12:21:35,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"print(\""60\"")",ACCEPTED,16,2816
1591647446231703552,c76414e1d2d8531a5745e9bd3192aafa7cca924e645650ffe7954c992cc13b33,2022-11-13 12:21:37,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,n=int(input())\nt=0\nstr=input()\nfor i in range(len(str)-1):\n    if str[i]!=str[i+1]:\n        t=t+2\n        del str[i]\n        del str[i+1]\nprint(t),NON_ZERO_EXIT_CODE,26,2760
1591647479404441600,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-13 12:21:45,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <string.h>\n#include <math.h>\n\n\nint main(){\n    int n = 0;\n    scanf(\""%d\"",&n);\n    \n    char s[n+1];\n    scanf(\""%s\"",s);\n    \n    long long sum = 0;\n    int i = 1;\n    while(*s != '\\0'){\n        sum += (*s - '0') * pow(2, n - i);\n        i++;\n    }\n    \n    printf(\""%d\"", sum);\n    \n    return 0;\n}",TIME_LIMIT_EXCEEDED,400,332
1591647482436923392,038e42376e9858a5a0d1826a17de3e149da6c7deb129501295633acdb2780aff,2022-11-13 12:21:45,Python,0.0,1591610585635213316,1591130116607045632,1049226928954454016,a=60\nprint（a）,NON_ZERO_EXIT_CODE,17,2760
1591647497943265280,6b02dfcf297d52c2de2e1416b33ee988ff909834c73207b147423a8301e9d174,2022-11-13 12:21:49,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#inlcude<stdio.h>\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}",COMPILE_ERROR,0,0
1591647513709666304,ccc42b8437aa15d1214e4623799ed35cd8ea8087c26cb1b596d51ae4556ea39c,2022-11-13 12:21:53,Python,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"a,b,c=input().split()\na=int(a)\nb=int(b)\nc=int(c)\nif a<b:\n    min1=a\n    min2=b\nelse:\n    min1=b\n    min2=a\nif min2<=c:\n    pass\nelse:\n    min2=c\nprint(min1+min2)",ACCEPTED,80,3072
1591647520512860160,1ac1c697452718cae6f56347fb0bf2473480d854f77bcfb84dd289d79169690e,2022-11-13 12:21:54,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,print(60),ACCEPTED,16,2892
1591647526221275136,5ed1ed5f3786d45db71190023ef590496fd0d8d8cfe4af0f2c94d1d387178674,2022-11-13 12:21:56,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}\n",ACCEPTED,5,332
1591647544344862720,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-13 12:22:00,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <string.h>\n#include <math.h>\n\n\nint main(){\n    int n = 0;\n    scanf(\""%d\"",&n);\n    \n    char s[n+1];\n    scanf(\""%s\"",s);\n    \n    long long sum = 0;\n    int i = 1;\n    while(*s != '\\0'){\n        sum += (*s - '0') * pow(2, n - i);\n        i++;\n    }\n    \n    printf(\""%lld\"", sum);\n    \n    return 0;\n}",TIME_LIMIT_EXCEEDED,400,340
1591647545498329088,9a1ecd1db02b268060006afd7de34ec54e74e90bf61becbb6811fb23971c4720,2022-11-13 12:22:00,Python,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"p,q,r=map(int,input().split())\nx=p+q\ny=q+r\nz=r+p\nprint(min(x,y,z))\n",ACCEPTED,84,3060
1591647563311505408,44042a4519c9231aa21c54eb113b7a08f98bcd7db4839a20a61ab6ce51fce357,2022-11-13 12:22:05,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int R,Q,P;\n    int sum1,sum2,sum3,min;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    sum1=P+Q;\n    sum2=P+R;\n    sum3=Q+R;\n    min=sum1;\n    if(sum1>sum2)\n    {\n        min=sum2;\n        if(sum2>sum3)\n            min=sum3;\n    }\n    else if(sum1>sum3)\n        min=sum3;\n    printf(\""%d\"",min);\n\n\n\n    return 0;\n}\n",ACCEPTED,46,512
1591647568399196160,cf76a6e5773cf2f19ddd635fa646c5a6721f6fed8998d22ea1d0910bee8017a2,2022-11-13 12:22:06,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a[0],n,i,k=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n        if(a[i]!=a[i+1])\n        {\n            k++;\n        }\n    } \n    printf(\""%d\"",k);\n\n}",WRONG_ANSWER,5,256
1591647640667041792,1773d9c971942817d949c47973c4eb8c24531f728d5480dbf3b232e568926258,2022-11-13 12:22:23,Java,0.0,1591610585635213316,1591130116607045632,1049226928954454016,public class MAIN {\n    public static void main(String[] args) {\n        System.out.println(60);\n    }\n}\n,COMPILE_ERROR,0,0
1591647653535166464,038e42376e9858a5a0d1826a17de3e149da6c7deb129501295633acdb2780aff,2022-11-13 12:22:26,Python,0.0,1591610585635213316,1591130116607045632,1049226928954454016,print（60）,NON_ZERO_EXIT_CODE,16,2816
1591647666566868992,20ffd83467b553ac24e1f4b8b096d58858684ca8c3f6a4d5a62be9ff7c4817da,2022-11-13 12:22:29,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#define MAX 100000\nint main()\n{\n    printf(\""60\\n\"");\n}\n",ACCEPTED,5,324
1591647668458500096,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-13 12:22:30,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,n=eval(input())\n1<=n<=100000\n,WRONG_ANSWER,19,2908
1591647680198369280,0354b067c4132d4425a90b77482ac717447702274cb7db1282edce56eaf037b3,2022-11-13 12:22:33,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main(){\n\tprintf(\""60\"");\n\treturn 0;\n} ",ACCEPTED,5,332
1591647692353495040,6b02dfcf297d52c2de2e1416b33ee988ff909834c73207b147423a8301e9d174,2022-11-13 12:22:35,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#inlcude<stdio.h>\nint main()\n{   int a=60\n    printf(\""%d\"",a);\n    return 0;\n}",COMPILE_ERROR,0,0
1591647694593220608,86f702b052a21d7cb2f8cd933c678c21efaafaf5b2d35032f18ec35c1e26a945,2022-11-13 12:22:36,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}",ACCEPTED,9,200
1591647709390757888,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-13 12:22:39,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int a[10],i,x,s=0;\n    scanf(\""%d\"",&i);\n    for(x=0;x<i;x++)\n        scanf(\""%d\"",&a[x]);\n    for(x=0;x<i;x++)\n    {\n        if(a[x]==a[x+1])  x++,s+=2;\n    }\n    printf(\""%d\"",s);\n}",WRONG_ANSWER,7,324
1591647714600050688,1773d9c971942817d949c47973c4eb8c24531f728d5480dbf3b232e568926258,2022-11-13 12:22:41,Java,0.0,1591610585635213316,1591130116607045632,1049226928954454016,public class main {\n    public static void main(String[] args) {\n        System.out.println(60);\n    }\n}\n,COMPILE_ERROR,0,0
1591647730236448768,eccafb49a6a53e0f6a70df305afa2fa1832182ed0fa3233a27357cbd42f50129,2022-11-13 12:22:44,Python,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"print(\""68\"")",WRONG_ANSWER,16,2892
1591647746988498944,c76414e1d2d8531a5745e9bd3192aafa7cca924e645650ffe7954c992cc13b33,2022-11-13 12:22:48,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,n=int(input())\nt=0\nstr=input()\nfor i in range(len(str)-1):\n    if str[i]!=str[i+1]:\n        t=t+2\nprint(t),WRONG_ANSWER,16,3032
1591647782707146752,acfcf65f14b5d3b02c3225372654b4e21f04d33a8bbaeb346e4fb1d85f2ea94f,2022-11-13 12:22:57,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nint main(){\n    int a;\n    scanf(\""%d\"",&a);\n    printf(\""%2d\"",a*60);\n     return 0;   \n}",WRONG_ANSWER,11,320
1591647791238373376,0b3466ebddb2bdde378eee8b40d2037097b0a243d9ec4a6495316765e89853eb,2022-11-13 12:22:59,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,print(60),ACCEPTED,17,2944
1591647795650768896,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-13 12:23:00,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n;\n    scan(\""%d\"",&n);\n    char s;\n    scan(\""%d\"",&s);\n    \n}",COMPILE_ERROR,0,0
1591647832644575232,9aa17e95021225dcdd2b01419b021cd002e47f9a7854274df042f64621bd207a,2022-11-13 12:23:09,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,j,i;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0,j=0;i<n;i++)\n    {\n        if(a[i]+a[i+1]==1)\n        j++;\n\n    }\n    printf(\""%d\"",j);\n    return 0;\n}\n",WRONG_ANSWER,13,376
1591647843335811072,eccafb49a6a53e0f6a70df305afa2fa1832182ed0fa3233a27357cbd42f50129,2022-11-13 12:23:11,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"print(\""60\"")",ACCEPTED,20,3072
1591647876571521024,001baa7272d47ab2d3a9b57bf7838570ff03ab1cabb738e7b342b652b1e42a83,2022-11-13 12:23:19,C++,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <iostream>\n#include <bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n    int a[3];\n    for(int i=0;i<3;i++)\n        scanf(\""%d\"",&a[i]);\n    sort(a,a+3);\n    a[2]=a[0]+a[1];\n    printf(\""%d\"",a[2]);\n    return 0;\n}\n",ACCEPTED,51,636
1591647887359238144,d9e13de81d487f21b11cf0fc38d2ef82b49d511a81ed1305cdfa47276a1c2e23,2022-11-13 12:23:22,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n\tint a=60;\n\tprintf(\""%d\"",a);\n\treturn 0;\n } ",ACCEPTED,5,320
1591647907005358080,1773d9c971942817d949c47973c4eb8c24531f728d5480dbf3b232e568926258,2022-11-13 12:23:27,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"print(\""60\"");",ACCEPTED,27,2688
1591647924650827776,d9e13de81d487f21b11cf0fc38d2ef82b49d511a81ed1305cdfa47276a1c2e23,2022-11-13 12:23:31,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n\tint a=60;\n\tprintf(\""%d\"",a);\n\treturn 0;\n } ",ACCEPTED,13,640
1591647986655178752,6b02dfcf297d52c2de2e1416b33ee988ff909834c73207b147423a8301e9d174,2022-11-13 12:23:46,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main()\n{   int a=60;\n    printf(\""%d\"",a);\n    return 0;\n}\n",ACCEPTED,13,196
1591648013603581952,13663feca3541eb054c32486ac91d32c40c83bbc2e5c1263614fa6c45f1f6d13,2022-11-13 12:23:52,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main(){\n    printf(\""60\"");\n    return 0;\n}",ACCEPTED,5,372
1591648017152008192,46a5b5de1986c03ade4ef3715390240d3b4a1729dbb6afcb5e53fc1bee0f1a07,2022-11-13 12:23:53,Java,0.0,1591610585635213318,1591131464941563904,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int p=sc.nextInt();\n        int q=sc.nextInt();\n        int r=sc.nextInt();\n        int s1=p+q;\n        int s2=q+r;\n        int s3=r+p;\n        if(s1>=s2){\n             if(s1>=s3){\n                 System.out.print(s3);\n           }else{\n                 System.out.print(s2);\n             }\n        }else{\n            if(s1>=s3){\n                System.out.print(s3);\n            }else{\n                System.out.print(s3);\n            }\n        }\n    }\n},WRONG_ANSWER,113,24472
1591648028174639104,acfcf65f14b5d3b02c3225372654b4e21f04d33a8bbaeb346e4fb1d85f2ea94f,2022-11-13 12:23:55,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nint main(){\n    int a=1;\n    scanf(\""%d\"",&a);\n    printf(\""%d\"",a*60);\n     return 0;   \n}",ACCEPTED,8,200
1591648103240097792,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-13 12:24:13,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint d[10];\nint main(){\n    int a,b,c;\n    cin>>a>>b>>c;\n    d[0]=a+b;\n    d[1]=a+c;\n    d[2]=b+c;\n    sort(d,d+2);\n    cout<<d[2];\n\treturn 0;\n} ",WRONG_ANSWER,8,324
1591648120717717504,acfcf65f14b5d3b02c3225372654b4e21f04d33a8bbaeb346e4fb1d85f2ea94f,2022-11-13 12:24:18,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nint main(){\n    int a=1;\n    scanf(\""%d\"",&a);\n    printf(\""%d\"",a*60);\n     return 0;   \n}",ACCEPTED,6,352
1591648130238787584,5d1852a153062cc8297ed7a30bb643375395a70654d5dff506fad6bc186e81bd,2022-11-13 12:24:20,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h> \nint main(){\n\tint p,q,r;\n\tscanf(\""%d %d %d\"",&p,&q,&r);\n\tprintf(\""%d\"",p+q);\n}",WRONG_ANSWER,21,348
1591648132306579456,345826d11b41befc23adeb536e81da8eb6ec9a8bfb9448acf91422deedb8ba4a,2022-11-13 12:24:20,C++,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,n,count=0;\n    scanf(\""%d\"",&n);\n    char s[n];\n    for(i=0;i<=n;i++)\n        scanf(\""%c\"",&s[i]);\n    for(i=1;i<=n;)\n    {\n        if(s[i]==s[i+1])\n            {\n                s[i]=s[i+2];\n                i=i+2;\n                count+=2;\n            }\n            else\n                i=i+1;\n    }\n    printf(\""%d\"",count);\n}\n",WRONG_ANSWER,6,216
1591648142972694528,7dd0c628805d8a6777ff5cc70a5ec79db9475f660782b2f4289ae98977303581,2022-11-13 12:24:23,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n    int P,Q,R;\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    printf(\""%d\"",P+Q);\n}",WRONG_ANSWER,19,348
1591648153798205440,1f29a576db974352c60cbe8aafdc4e5328b24d800890ab1c712d8c9fa85d72cc,2022-11-13 12:24:25,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint P,Q,R;\n\tint min=0;\n\tscanf(\""%d%d%d\"",&P,&Q,&R);\n\tmin=P+Q;\n\tif((P+Q)>=(Q+R)) min=P+R;\n\tif((Q+R)>=(R+P)) min=R+P;\n\telse min=Q+R;\n\tprintf(\""%d\"",min);\n\treturn 0;\n } ",WRONG_ANSWER,7,356
1591648163709345792,abe2744e33bb397ffb9bb13afcb202f611378fb4fc5801202f03933298ce5f5d,2022-11-13 12:24:28,Java,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\npublic static void main(String[] args) throws IOException{\n\tBufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n\tString[] string = reader.readLine().split(\"" \"");\n\tint[] ints=new int[3];\n\tfor(int i=0;i<3;i++){\n\t\tints[i]=Integer.valueOf(string[i]);\n\t}\n\tint temp=0;\n\tfor(int i=0;i<2;i++){\n\t\tif(ints[i]>=ints[i+1]){\n\t\t\ttemp=ints[i];\n\t\t\tints[i]=ints[i+1];\n\t\t\tints[i+1]=temp;\n\t\t}\n\t}\n\tSystem.out.println(ints[0]+ints[1]);\n}\n}\n",ACCEPTED,345,22736
1591648164497874944,07d925df8d2026d3171a0a2ca84a6ef7f4a5b47a584cf47b66c5dd8f28139d1f,2022-11-13 12:24:28,Python,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"P,Q,R=map(int,input().split())\nA=P+Q\nB=Q+R\nC=R+P\nif A<=B and A<=C:\n    print(A)\nelif B<=A and B<=C:\n    print(B)\nelse:\n    print(C)",ACCEPTED,83,2908
1591648224258351104,bce383372e0b1b627f0a9b838121096ec3ca14c0f213828fca1bf517a82c8744,2022-11-13 12:24:42,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int i,j,k;\n    printf(\""请输入三个整数：\\n\"");\n    scanf(\""%d %d %d\"",&i,&j,&k);\n    if(i+j<i+k && i+j<j+k)\n        printf(\""从A到B花费%d块钱，从B到C花费%d块钱，此时所有地点都去过了，总花费为%d块钱。\"",i,j,i+j);\n    if(i+k<j+k && i+k<i+j)\n        printf(\""从C到A花费%d块钱，从A到B花费%d块钱，此时所有地点都去过了，总花费为%d块钱。\"",k,i,i+k);\n    if(j+k<i+k && j+k<i+j)\n        printf(\""从B到C花费%d块钱，从C到A花费%d块钱，此时所有地点都去过了，总花费为%d块钱。\"",j,k,j+k);\n}",WRONG_ANSWER,6,500
1591648255275229184,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-13 12:24:50,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main(){\n\tint a,b,c;\n\tscanf(\""%d%d%d\"",&a,&b,&c);\n\tint A,B,C;\n\tA=a+b;\n\tB=b+c;\n\tC=c+a;\n\tif(A<B||A<C) printf(\""%d\"",A);\n\telse if(B<A||B<C) printf(\""%d\"",B);\n\telse if(C<A||C<B) printf(\""%d\"",C);\n}",WRONG_ANSWER,12,352
1591648256181153792,fbea21dbaf89f1b064feaa20227f21c5e1c4888fdc371cf5e43f70615906e52a,2022-11-13 12:24:50,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"n=int(input())\nq=list(map(int,input()))\nx=0\nfor i in range (1,n):\n    if q[i]==q[i-1]:\n       x+=2\nprint(x)\n    ",WRONG_ANSWER,16,2760
1591648298275188736,bce383372e0b1b627f0a9b838121096ec3ca14c0f213828fca1bf517a82c8744,2022-11-13 12:25:00,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int i,j,k;\n    printf(\""请输入三个整数：\\n\"");\n    scanf(\""%d%d%d\"",&i,&j,&k);\n    if(i+j<i+k && i+j<j+k)\n        printf(\""从A到B花费%d块钱，从B到C花费%d块钱，此时所有地点都去过了，总花费为%d块钱。\"",i,j,i+j);\n    if(i+k<j+k && i+k<i+j)\n        printf(\""从C到A花费%d块钱，从A到B花费%d块钱，此时所有地点都去过了，总花费为%d块钱。\"",k,i,i+k);\n    if(j+k<i+k && j+k<i+j)\n        printf(\""从B到C花费%d块钱，从C到A花费%d块钱，此时所有地点都去过了，总花费为%d块钱。\"",j,k,j+k);\n}",WRONG_ANSWER,6,376
1591648340675407872,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-13 12:25:10,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main(){\n\tint a,b,c;\n\tscanf(\""%d%d%d\"",&a,&b,&c);\n\tint A,B,C;\n\tA=a+b;\n\tB=b+c;\n\tC=c+a;\n\tif(A<B&&A<C) printf(\""%d\"",A);\n\telse if(B<A&&B<C) printf(\""%d\"",B);\n\telse if(C<A&&C<B) printf(\""%d\"",C);\n}",ACCEPTED,37,376
1591648346010607616,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-13 12:25:11,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int a[10],i,x,y,s=0;\n    scanf(\""%d\"",&i);\n    for(x=0;x<i;x++)\n        scanf(\""%d\"",&a[x]);\n    for(x=0;x<i;x++)\n    {\n        if(a[x]==a[x+1])\n        {\n            for(y=x;y<i;y++) a[y]=a[y+2];\n            s+=2;\n        }\n    }\n    printf(\""%d\"",s);\n}",SEGMENTATION_FAULT,5,192
1591648377568518144,20eba57d0ae5a9e589a2b203a4648cce520c99291e8744872f7a5a5911e19e34,2022-11-13 12:25:19,Java,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"import java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint a=scanner.nextInt();\n\t\tint b=scanner.nextInt();\n\t\tint c=scanner.nextInt();\n\t\tint d=scanner.nextInt();\n\t\tint e=scanner.nextInt();\n\t\tint g=scanner.nextInt();\n\t\tint h=scanner.nextInt();\n\t\tSystem.out.print(\""84\"");\n\n\t}\n}\n",WRONG_ANSWER,108,24460
1591648382714916864,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-13 12:25:20,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint d[10];\nint main(){\n    int a,b,c;\n    cin>>a>>b>>c;\n    d[0]=a+b;\n    d[1]=a+c;\n    d[2]=b+c;\n    sort(d,d+2);\n    cout<<d[0];\n\treturn 0;\n} ",WRONG_ANSWER,18,452
1591648442609577984,038e42376e9858a5a0d1826a17de3e149da6c7deb129501295633acdb2780aff,2022-11-13 12:25:34,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,print(60),ACCEPTED,18,2892
1591648462121525248,75a6755f083ffc71d77ba6ce593bd24fe8a2ce61edc4710fbde2dce128c47ab4,2022-11-13 12:25:39,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b,c,i,sum[3],min;\n    scanf(\""%d\"",&a);\n    scanf(\""%d\"",&b);\n    scanf(\""%d\"",&c);\n\n    sum[0]=a+b;\n    sum[1]=b+c;\n    sum[2]=c+a;\n\n    min=sum[0];\n    for(i=1;i<3;i++)\n    {\n        if(sum[i]<min)\n        min=sum[i];\n    }\n    printf(\""%d\"",min);\n    return 0;\n}\n",ACCEPTED,32,380
1591648510628605952,59415347d1cfa3163c0a25f108652369803ee9c4d72f5c59e4212aabab93e388,2022-11-13 12:25:50,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main(int argc, char *argv[]) {\n\tint P,Q,R;\n\tscanf(\""%d %d %d\"",&P,&Q,&R);\n\tint max = P;\n\tif(P<Q)\n\t\tmax = Q;\n\t\n\tif(P<R)\n\t\tmax = R;\n\t\n\tint money = P+Q+R-max;\n\tprintf(\""%d\"",money);\n\treturn 0;\n}",ACCEPTED,31,480
1591648524956393472,7dd0c628805d8a6777ff5cc70a5ec79db9475f660782b2f4289ae98977303581,2022-11-13 12:25:54,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n    int P,Q,R;\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    printf(\""%d\"",P+Q);\n}",WRONG_ANSWER,12,500
1591648551271411712,667c2e97e82c372f60661d46943ff56a17c9350387f4364ebabe70ac2e232862,2022-11-13 12:26:00,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int x,y,z,n=5;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d\"",n);\n    return 0;\n}",WRONG_ANSWER,8,352
1591648553951617024,05f9d62a2660f27e0711448c225e5e0fe6347745a2c93edb6296c0a2ffbc6605,2022-11-13 12:26:01,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nmain()\n{\n    printf(\""60\"");\n}",ACCEPTED,8,324
1591648566379294720,977c9d350f87cd8386fa1f88cca886d6ff43821830806e60da6d6b36dc77cd13,2022-11-13 12:26:04,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,b,c;\n    scanf(\""%d%d%d\"",&a,&b,&c);\n    if(a>b>c||a>c>b)\n    {\n        printf(\""%d\"",b+c);\n    }\n    else if(b>a>c||b>c>a)\n    {\n        printf(\""%d\"",a+c);\n    }\n    else\n    {\n        printf(\""%d\"",a+b);\n    }\n   \n}",WRONG_ANSWER,19,352
1591648569051066368,0c396be113b63ac245fc6ce925111f1631870141ae26c3ec6efb7b6360bb6cf3,2022-11-13 12:26:04,Java,0.0,1591610585635213318,1591131464941563904,1049226928954454016,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            int c = in.nextInt();\n            System.out.println(a + b);\n        }\n    }\n},WRONG_ANSWER,216,24368
1591648589724790784,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 12:26:09,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int p,q,r,sum;\n    scanf(\""%d %d %d\"",&p,&q,&r);\n    if(p<=q&&p<=r)\n        sum=p+q;\n    if(q<p&&q<=r)\n        sum=q+r;\n    if(r<=p&&r<=q)\n        sum=r+p;\n    if(q=p&&q<=r)\n        sum=p+q;\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,12,192
1591648598344085504,7dd0c628805d8a6777ff5cc70a5ec79db9475f660782b2f4289ae98977303581,2022-11-13 12:26:11,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n    int P,Q,R;\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    printf(\""%d\"",P+Q);\n}\nreturn 0;",COMPILE_ERROR,0,0
1591648611803652096,9aa17e95021225dcdd2b01419b021cd002e47f9a7854274df042f64621bd207a,2022-11-13 12:26:15,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,j,i,k;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0,j=0;i<n;i++)\n    {\n        for(k=i;k<n;k++)\n        if(a[i]+a[i+1]==1)\n        j++;\n\n    }\n    printf(\""%d\"",j+1);\n    return 0;\n}\n",WRONG_ANSWER,5,196
1591648616002105344,190178fcb71270e17fbe689a22517f5296281dfcd3b16ec01748057e49740d1d,2022-11-13 12:26:16,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    if((P+Q)<=(Q+R)<=(R+P)&&(P+Q)<=(R+P)<=(Q+R))\n    printf(\""%d\"",P+Q);\n    else if((Q+R)<=(P+Q)<=(R+P)&&(Q+R)<=(R+P)<=(P+Q))\n    printf(\""%d\"",Q+R);\n    else if((R+P)<=(P+Q)<=(Q+R)&&(R+P)<=(Q+R)<=(P+Q))\n    printf(\""%d\"",R+P);\n    return 0;\n}",WRONG_ANSWER,20,512
1591648618279612416,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-13 12:26:16,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"num = eval(input())\na = 0 //清除数量\nl = [0]*num\nfor i in range(0,num):\n    l[i]=eval(input())\nfor i range(0,num):\n    if l[i]==li[i+1]:\n        a = a+2\n        for j in range(i,num-2):\n            l[j]=l[j+2]\n    i=0\n    num=num-2\nprint(a)\n            \n        \n        \n    \n    \n",NON_ZERO_EXIT_CODE,16,2916
1591648621962211328,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-13 12:26:17,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a;\n    a=60;\n    printf(\""%d\"",a);\n    return 0;\n}\n",ACCEPTED,12,200
1591648672730066944,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-13 12:26:29,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nint main ()\n{\n    int p,q,r,n，max=0;\n    scanf(\""%d %d %d\"",&p,&q,&r);\n    max=p;\n    if(q>p)\n    {\n        if(q>r) max=q;\n    }\n    if(p>q)\n    {\n        if(p>r) max=p;\n    }\n    if(r>p)\n    {\n        if(r>q) max=r;\n    }\n    printf(\""%d\"",q+p+r-max);\n    return 0;\n}",COMPILE_ERROR,0,0
1591648721295912960,bce383372e0b1b627f0a9b838121096ec3ca14c0f213828fca1bf517a82c8744,2022-11-13 12:26:41,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int i,j,k;\n    printf(\""请输入三个整数：\\n\"");\n    scanf(\""%d%d%d\"",&i,&j,&k);\n    if((i+j)<(i+k) && ?(i+j)<(j+k)\n        printf(\""从A到B花费%d块钱，从B到C花费%d块钱，此时所有地点都去过了，总花费为%d块钱。\"",i,j,i+j);\n    if((i+k)<(j+k) && (i+k)<(i+j)\n        printf(\""从C到A花费%d块钱，从A到B花费%d块钱，此时所有地点都去过了，总花费为%d块钱。\"",k,i,i+k);\n    if((j+k)<(i+k) && (j+k)<(i+j)\n        printf(\""从B到C花费%d块钱，从C到A花费%d块钱，此时所有地点都去过了，总花费为%d块钱。\"",j,k,j+k);\n}",COMPILE_ERROR,0,0
1591648761984856064,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-13 12:26:50,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nint main ()\n{\n    int p,q,r,n，max=0;\n    scanf(\""%d %d %d\"",&p,&q,&r);\n    \n    if(q>p)\n    {\n        if(q>r) max=q;\n    }\n    if(p>q)\n    {\n        if(p>r) max=p;\n    }\n    if(r>p)\n    {\n        if(r>q) max=r;\n    }\n    printf(\""%d\"",q+p+r-max);\n    return 0;\n}",COMPILE_ERROR,0,0
1591648764430180352,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-13 12:26:51,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int p = 0, q = 0, r = 0;\n    int arr[3]  ={0};\n    int i = 0;\n    while(3--)\n    {\n        scanf(\""%d\"",&arr[i]);\n        i++;\n    }\n    for(int i = 0; i < 3; ++i)\n    {\n        for(int j = 0; j < 2-i; ++j)\n        {\n            if(arr[j] > arr[j+1])\n            {\n                int tmp = arr[j];\n                arr[j] = arr[j+1];\n                arr[j+1] = tmp;\n            }\n        }\n    }\n    int min = arr[0] + arr[1];\n    printf(\""%d\"",min);\n    return 0;\n}",COMPILE_ERROR,0,0
1591648773569568768,bce383372e0b1b627f0a9b838121096ec3ca14c0f213828fca1bf517a82c8744,2022-11-13 12:26:53,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int i,j,k;\n    printf(\""请输入三个整数：\\n\"");\n    scanf(\""%d%d%d\"",&i,&j,&k);\n    if((i+j)<(i+k) && ?(i+j)<(j+k)\n        printf(\""从A到B花费%d块钱，从B到C花费%d块钱，此时所有地点都去过了，总花费为%d块钱。\"",i,j,i+j);\n    if((i+k)<(j+k) && (i+k)<(i+j)\n        printf(\""从C到A花费%d块钱，从A到B花费%d块钱，此时所有地点都去过了，总花费为%d块钱。\"",k,i,i+k);\n    if((j+k)<(i+k) && (j+k)<(i+j))\n        printf(\""从B到C花费%d块钱，从C到A花费%d块钱，此时所有地点都去过了，总花费为%d块钱。\"",j,k,j+k);\n}",COMPILE_ERROR,0,0
1591648796441075712,63a19c717d077fecd1be96314929ebf3516f35619209eacac77081bb07edebb5,2022-11-13 12:26:59,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int p,q,r,min,a,b,c;\n    scanf(\""%d %d %d\"",&p,&q,&r);\n    a=p+q;\n    b=q+r;\n    c=r+p;\n    min=a;\n    if(min>b){\n        min=b;\n    }\n    if(min>c){\n        min=c;\n    }\n    printf(\""%d\"",min);\n}\n",ACCEPTED,51,512
1591648814157803520,da72e985b1ff1737d155282af7dd43e3dc341605cc356d114979edd4fea85a11,2022-11-13 12:27:03,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nint main(void) {\n    printf(\""60\"");\n    return 0;\n}",ACCEPTED,4,196
1591648814203985920,bce383372e0b1b627f0a9b838121096ec3ca14c0f213828fca1bf517a82c8744,2022-11-13 12:27:03,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int i,j,k;\n    printf(\""请输入三个整数：\\n\"");\n    scanf(\""%d%d%d\"",&i,&j,&k);\n    if((i+j)<(i+k) && ?(i+j)<(j+k))\n        printf(\""从A到B花费%d块钱，从B到C花费%d块钱，此时所有地点都去过了，总花费为%d块钱。\"",i,j,i+j);\n    if((i+k)<(j+k) && (i+k)<(i+j))\n        printf(\""从C到A花费%d块钱，从A到B花费%d块钱，此时所有地点都去过了，总花费为%d块钱。\"",k,i,i+k);\n    if((j+k)<(i+k) && (j+k)<(i+j))\n        printf(\""从B到C花费%d块钱，从C到A花费%d块钱，此时所有地点都去过了，总花费为%d块钱。\"",j,k,j+k);\n}",COMPILE_ERROR,0,0
1591648826866556928,887d1bbe53a4d4a349813887f13126da5e46a853687f4c2c9d7b8ef3d748a9d6,2022-11-13 12:27:06,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nmain()\n{\n    printf(\""60\"");\n}",ACCEPTED,6,492
1591648869044465664,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-13 12:27:16,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nint main ()\n{\n    int p,q,r,max=0;\n    scanf(\""%d %d %d\"",&p,&q,&r);\n    \n    if(q>p)\n    {\n        if(q>r) max=q;\n    }\n    if(p>q)\n    {\n        if(p>r) max=p;\n    }\n    if(r>p)\n    {\n        if(r>q) max=r;\n    }\n    printf(\""%d\"",q+p+r-max);\n    return 0;\n}",ACCEPTED,39,384
1591648872035004416,0ed66ddb50163bbc5dd43c591bc3d500e68ed69fe23bfebfa6ac827c1dfc1849,2022-11-13 12:27:17,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nmain()\n{\n    int count=0,n,i=0;\n    char s[99];\n    scanf(\""%d\"",&n);\n    if(n>=1&&n<=100000)\n    while(i<n)\n    {\n        scanf(\""%c\"",&s[i]);\n        i++;\n    }\n    i=0;\n    while(n>0)\n    {\n        if(s[i]!=s[i+1])\n        {\n            s[i]=s[i+2];\n            s[i+1]=s[i+3];\n            n=n-2;\n            i=0;\n            count+=2;\n        }\n        else\n            i++;\n        if(i==n)\n            break;\n    }\n    printf(\""%d\\n\"",count);\n}",WRONG_ANSWER,6,336
1591648910131912704,345826d11b41befc23adeb536e81da8eb6ec9a8bfb9448acf91422deedb8ba4a,2022-11-13 12:27:26,C++,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,n,count=0;\n    scanf(\""%d\"",&n);\n    char s[n];\n    for(i=0;i<=n;i++)\n       s[i]=getchar();\n    for(i=1;i<=n;)\n    {\n        if(s[i]==s[i+1])\n            {\n                s[i]=s[i+2];\n                i=0;\n                count+=2;\n            }\n            else\n                i=i+1;\n    }\n    printf(\""%d\"",count);\n}\n",TIME_LIMIT_EXCEEDED,400,384
1591648945934458880,d808f4cc3c70a696f5c416714e0998fe96743e5273bc07a26f75738d12d304f5,2022-11-13 12:27:34,Java,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"import java.util.Scanner;\nimport java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n        int p,q,r;\n        Scanner sc=new Scanner(System.in);\n        p=sc.nextInt();\n        q=sc.nextInt();\n        r=sc.nextInt();\n        int sum=0,a=0;\n        if(p>q){\n        \tsum+=q;\n        \ta=p;\n        }\n        else{\n        \tsum+=p;\n        \ta=q;\n        }\n        sum+=Math.min(a, r);\n        System.out.println(sum);\n    }\n}\n",ACCEPTED,574,24796
1591648961944117248,1e783de44f6cf9abb158b108e556a36ef99d9241fc592b40cfd6cb7d1265eb34,2022-11-13 12:27:38,Java,300.0,1591610585635213318,1591131464941563904,1049226928954454016,import java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner s=new Scanner(System.in);\n        int[] arr=new int[3];\n        for(int i=0;i<3;i++){\n            arr[i]=s.nextInt();\n        }\n        int max=0;\n        int sum=0;\n        int count=0;\n         for(int i=0;i<3;i++){\n             sum+=arr[i];\n            if(arr[i]>max){\n                max=arr[i];\n            }\n        }\n        count=sum-max;\n        System.out.println(count);\n\t}\n}\n,ACCEPTED,538,24904
1591649003589394432,46a5b5de1986c03ade4ef3715390240d3b4a1729dbb6afcb5e53fc1bee0f1a07,2022-11-13 12:27:48,Java,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"import java.util.Scanner;\nimport java.util.Arrays;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int p=sc.nextInt();\n        int q=sc.nextInt();\n        int r=sc.nextInt();\n        int s1=p+q;\n        int s2=q+r;\n        int s3=r+p;\n        int a[]={s1,s2,s3};\n        Arrays.sort(a);\n        System.out.print(a[0]);\n    }\n}",ACCEPTED,533,24740
1591649047172362240,5d127211f3edce9d9bd1062c03cd08473e4481ec46b4b0c70c2e8d9141c68f20,2022-11-13 12:27:58,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,s,i,count=0;\n    scanf(\""%d\"",&n);\n    int a[n];\n    scanf(\""%d\"",&a[n]);\n    for(i=0;i<n;i++)\n    {\n        if(a[i]==a[i+1])\n            continue;\n            count++;\n    }\n    printf(\""%d\"",count);\n}",WRONG_ANSWER,5,196
1591649070287183872,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-13 12:28:04,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int p,q,r;\n    scanf(\""%d%d%d\"",&p,&q,&r);\n    printf(\""从A到B花费%d块钱，从B到C花费%d块钱，此时所有地点都去过了，总花费为%d块钱。\"",p,q,p+q);\n}\nreturn 0;",COMPILE_ERROR,0,0
1591649074498252800,6cbd81921f92855c6b8318725b09ef7ec48ff579276b3df9f7ea04bea9804678,2022-11-13 12:28:05,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int P,Q,R;\n    int min;\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    \n    if(P) min=P+Q;\n    else if(Q) min=Q+R;\n    else min=R+P;\n    \n    printf(\""%d\\n\"",min);\n    return 0;\n}",WRONG_ANSWER,22,512
1591649081683140608,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 12:28:07,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int p,q,r,sum;\n    scanf(\""%d %d %d\"",&p,&q,&r);\n    if(p<=q&&p<r)\n        sum=p+q;\n    if(q<=p&&q<r)\n        sum=p+q;\n    if(r<=p&&r<q)\n        sum=r+p;\n    if(q=p&&q<=r)\n        sum=p+q;\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,6,384
1591649093552975872,0ed66ddb50163bbc5dd43c591bc3d500e68ed69fe23bfebfa6ac827c1dfc1849,2022-11-13 12:28:09,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nmain()\n{\n    int count=0,n,i=0;\n    char s[99];\n    scanf(\""%d\"",&n);\n    if(n>=1&&n<=pow(10,5))\n    while(i<n)\n    {\n        scanf(\""%c\"",&s[i]);\n        i++;\n    }\n    i=0;\n    while(n>0)\n    {\n        if(s[i]!=s[i+1])\n        {\n            s[i]=s[i+2];\n            s[i+1]=s[i+3];\n            n=n-2;\n            i=0;\n            count+=2;\n        }\n        else\n            i++;\n        if(i==n)\n            break;\n    }\n    printf(\""%d\"",count);\n}",WRONG_ANSWER,5,196
1591649126537027584,d830b0bcae7881ad6d1b2e2b14f3ffa3695b6d3bd622856493fa1cf903c9bf4e,2022-11-13 12:28:17,Java,0.0,1591610585635213318,1591131464941563904,1049226928954454016,public class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint[] arr1= new int[3];\n\t\tint[] arr2 = new int[3];\n\t\tfor(int i =0;i<arr1.length;i++){\n\t\t\tarr1[i]=sc.nextInt();\n\t\t}\n\t\tint P=arr1[0]+arr1[1];\n\t\tint Q=arr1[1]+arr1[2];\n\t\tint R=arr1[2]+arr1[0];\n\t\tarr2[0] = P;\n\t\tarr2[1] = Q;\n\t\tarr2[2] = R;\n\t\tArrays.sort(arr2);\n\t\tSystem.out.print(arr2[0]);\n\t}\n}\n,COMPILE_ERROR,0,0
1591649127392620544,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-13 12:28:18,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int p,q,r;\n    scanf(\""%d%d%d\"",&p,&q,&r);\n    printf(\""从A到B花费%d块钱，从B到C花费%d块钱，此时所有地点都去过了，总花费为%d块钱。\"",p,q,p+q);\n    return 0;\n}",WRONG_ANSWER,5,204
1591649142022352896,c358160a3e618a44cd693944fe10043e6372f46bf7d517c3c3f583bd85b17c5e,2022-11-13 12:28:21,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"n, m ,y= map(int,input().split())\nprint(n+m)\nprint(\""从 A 到 B 花费{}块钱，从 B 到 C 花费{}块钱，此时所有地点都去过了，总花费为{}块钱。\"".format(n, m,n+m))\n",WRONG_ANSWER,16,2888
1591649160267575296,190178fcb71270e17fbe689a22517f5296281dfcd3b16ec01748057e49740d1d,2022-11-13 12:28:25,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    if((P+Q)<(Q+R)<(R+P)&&(P+Q)<(R+P)<(Q+R))\n    printf(\""%d\"",P+Q);\n    else if((Q+R)<(P+Q)<(R+P)&&(Q+R)<(R+P)<(P+Q))\n    printf(\""%d\"",Q+R);\n    else if((R+P)<(P+Q)<(Q+R)&&(R+P)<(Q+R)<(P+Q))\n    printf(\""%d\"",R+P);\n    return 0;\n}",WRONG_ANSWER,12,324
1591649165556592640,d830b0bcae7881ad6d1b2e2b14f3ffa3695b6d3bd622856493fa1cf903c9bf4e,2022-11-13 12:28:27,Java,300.0,1591610585635213318,1591131464941563904,1049226928954454016,import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint[] arr1= new int[3];\n\t\tint[] arr2 = new int[3];\n\t\tfor(int i =0;i<arr1.length;i++){\n\t\t\tarr1[i]=sc.nextInt();\n\t\t}\n\t\tint P=arr1[0]+arr1[1];\n\t\tint Q=arr1[1]+arr1[2];\n\t\tint R=arr1[2]+arr1[0];\n\t\tarr2[0] = P;\n\t\tarr2[1] = Q;\n\t\tarr2[2] = R;\n\t\tArrays.sort(arr2);\n\t\tSystem.out.print(arr2[0]);\n\t}\n}\n,ACCEPTED,530,24816
1591649181453004800,05f9d62a2660f27e0711448c225e5e0fe6347745a2c93edb6296c0a2ffbc6605,2022-11-13 12:28:30,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nmain()\n{\n    int a,b,c;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    printf(\""%d\"",a+b);\n}",WRONG_ANSWER,11,504
1591649215175208960,ddd0edd80a23dfec88d0679f4ed6037779b80d26db4ba0f74fecb3d447de61fa,2022-11-13 12:28:38,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main(){\n    int A,B,C;\n    int X,Y,G;\n    scanf(\""%d %d %d\"",&A,&B,&C);\n    X=A+B;\n    Y=B+C;\n    G=C+A;\n    if(X<=Y&&X<=G)\n        printf(\""%d\"",X);\n     else if(Y<=G)\n         printf(\""%d\"",Y);\n    else\n        printf(\""%d\"",G);\n}",ACCEPTED,42,512
1591649218430033920,2a1cee132cc8344d51461f6cbf473fb80705d6fd5972f9a5d0fcfea0760fd8b1,2022-11-13 12:28:39,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R;\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    if(P,Q,R>=1&&P,Q,R<=1000)\n    {\n        printf(\""%d\"",P+Q);\n    }\n    return 0;\n}\n",WRONG_ANSWER,12,352
1591649222611755008,7dd0c628805d8a6777ff5cc70a5ec79db9475f660782b2f4289ae98977303581,2022-11-13 12:28:40,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"data=list(map(eval,input().split())\ns=data[0]+data[1]\nprint(s)",NON_ZERO_EXIT_CODE,17,2816
1591649226185269248,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-11-13 12:28:41,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int n,h[i],i,count=0;\n    scanf(\""%d\"",&n);\n    scanf(\""%d\"",&h[i]);\n    for(i=1;i<=n;i++)\n    {\n        if(h[i-1]>=h[i]&&h[i]<=h[i+1])\n        {\n            count=count+1;\n        }\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",COMPILE_ERROR,0,0
1591649233084932096,cf76a6e5773cf2f19ddd635fa646c5a6721f6fed8998d22ea1d0910bee8017a2,2022-11-13 12:28:43,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#define N 20\nint main()\n{\n    int n;\n    int a[N],i,k=0;\n    scanf(\""%d\"",&n);\n    if(n<=1&&n>=1e-5)\n    {\n      for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n        if(a[i]!=a[i+1])\n        {\n            k++;\n        }\n    } \n    printf(\""%d\"",k);\n  \n    }\n    \n}",WRONG_ANSWER,6,196
1591649238998855680,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-13 12:28:44,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int p = 0, q = 0, r = 0;\n    int arr[3]  ={0};\n    int i = 0, j = 0;\n    for(i = 0; i < 3; i++)\n    {\n        scanf(\""%d\"",&arr[i]);\n    }\n    for(i = 0; i < 3; ++i)\n    {\n        for(j = 0; j < 2-i; ++j)\n        {\n            if(arr[j] > arr[j+1])\n            {\n                int tmp = arr[j];\n                arr[j] = arr[j+1];\n                arr[j+1] = tmp;\n            }\n        }\n    }\n    int min = arr[0] + arr[1];\n    printf(\""%d\"",min);\n    return 0;\n}\n",ACCEPTED,28,364
1591649245843972096,4812f9582f90b7f3f95178a62ec39f3555e90b935658da3e31a47fe0d2e8c6fd,2022-11-13 12:28:46,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main()\n{int i=1;\n    scanf(\""&i\"",i);\n    printf(\""%d\"",i*60);\n return 0;\n}",ACCEPTED,9,324
1591649247010021376,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-13 12:28:46,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int p,q,r;\n    scanf(\""%d%d%d\"",&p,&q,&r);\n    printf(\""从A到B花费%d块钱，从B到C花费%d块钱，此时所有地点都去过了，总花费为%d块钱。\"",p,q,p+q);\n    return 0;\n}",WRONG_ANSWER,8,328
1591649260133965824,7c6d208c4c4b695bc8d6f8ae0c0357c2466f5c9f86ec0652674812219ac09d38,2022-11-13 12:28:49,Java,300.0,1591610585635213312,1589816514637750272,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a  = sc.nextInt();\n\t\t\n\t\tString str = sc.next();\n\t\tint[] brr = new int[a];\n\t\tfor (int i = 0; i < str.length(); i++) {\n\t\t\tbrr[i] = str.charAt(i)-'0';\n\t\t}\n\t\tint count1 = 0;\n\t\tint count2 = 0;\n\t\tfor (int i = 0; i < brr.length; i++) {\n\t\t\tif (brr[i]==0) {\n\t\t\t\tcount1++;\n\t\t\t}else {\n\t\t\t\tcount2++;\n\t\t\t}\n\t\t}\n\t\tif (count1==a || count2==a) {\n\t\t\tSystem.out.println(a);\n\t\t}else if (count1>count2) {\n\t\t\tSystem.out.println(count2 * 2);\n\t\t}else {\n\t\t\tSystem.out.println(count1 * 2);\n\t\t}\n\t\t\n\n\t}\n\n}\n,ACCEPTED,616,27864
1591649269743149056,281adcca8943f9f4c0ced14f1ceffe157a34fca39f3cb864eb95e400944e38a8,2022-11-13 12:28:51,Java,0.0,1591610585635213318,1591131464941563904,1049226928954454016,\nimport java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner scan=new Scanner(System.in);\n\t\tint[] arr=new int[3];\n\t\tint a=0;\n\t\tint b=0;\n\t\tint c=0;\n\t\tfor(int i=0;i<3;i++){\n\t\t\tarr[i]=scan.nextInt();\n\t\t}\n\t\ta=arr[0]+arr[1];\n\t\tb=arr[1]+arr[2];\n\t\tc=arr[2]+arr[0];\n\t\tif(a<b&&a<c){\n\t\t\tSystem.out.print(a);\n\t\t}\n\t\tif(b<a&&b<c){\n\t\t\tSystem.out.print(b);\n\t\t}\n\t\tif(c<b&&c<a){\n\t\t\tSystem.out.print(c);\n\t\t}\n        else{\n            System.out.print(a);\n        }\n\t}\n\n}\n,WRONG_ANSWER,112,24440
1591649273950003200,20ffd83467b553ac24e1f4b8b096d58858684ca8c3f6a4d5a62be9ff7c4817da,2022-11-13 12:28:52,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#define MAX 100000\nint main()\n{\n    int i,t=0,A[3],B[3];\n    for(i=0;i<3;i++)\n        scanf(\""%d\"",&A[i]);\n    B[0]=A[0]+A[1];\n    B[1]=A[0]+A[2];\n    B[2]=A[1]+A[2];\n    for(i=0;i<2;i++){\n        if(B[i]<B[i+1])\n            t=B[i];\n    }\n    printf(\""%d\\n\"",t);\n}\n",WRONG_ANSWER,7,384
1591649344821145600,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-13 12:29:09,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int x,y,z,sum[3],i,max;\n    max=x+y;\n    sum[0]=x+y;\n    sum[1]=y+z;\n    sum[3]=x+z;\n    for(i=0;i<3;i++)\n        if(sum[i]>max) max=sum[i];\n    printf(\""%d\"",max);\n}",WRONG_ANSWER,15,324
1591649348252098560,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-13 12:29:10,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n\tint n,i,j=0,num=0;\n\tscanf(\""%d\"",&n);\n\tchar a[n];\n\tscanf(\""%s\"",a);\n\tif(n!=0)\n\t{for(i=0;i<n;i++)\n\t{\n\t\tfor(j=0;j<n;j++)\n\t\tif(a[j]!=a[j+1]) \n\t\t{\n\t\t\tnum+=2;\n\t\t\ta[j+2]=a[j];\n\t\t\ta[j+3]=a[j+1];\n\t\t\tn-=2;\n\t\t\tbreak;\n\t\t}\t\n\t}\n\t} \n\tprintf(\""%d\"",num);\n\treturn 0;\n}",WRONG_ANSWER,5,372
1591649366723801088,7935e8f5cb04027f4d30ac84a997e2d03e946e112c1cb17f1a4f943d8b0b54bf,2022-11-13 12:29:15,C,300.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n    int n,i=0,j=0,t=0;\n    scanf(\""%d\"",&n);\n    getchar();\n    char s[n+1];\n    gets(s);\n    for(i;i<n;i++)\n    {\n        if(s[i]=='0')\n            j=j+1;\n        else\n            t=t+1;\n    }\n    if(j>t)\n        printf(\""%d\"",2*t);\n    else\n        printf(\""%d\"",2*j);\n    return 0;\n}\n",ACCEPTED,44,456
1591649379373834240,acf80eea856463058b81f71c0238069795893092293fbd098cc594959df6444e,2022-11-13 12:29:18,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,a=[]\nb=0\na=input().split()\na.remove(max(a))\nfor i in range(2):\n    b=b+int(a[i])\nprint(b),WRONG_ANSWER,20,2816
1591649387762442240,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-13 12:29:20,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main(){\n    int i;\n    int a[100]={0};//存p,q,r的值\n\tfor( i=0;i<3;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t\tif(a[i]<1){\n\t\t\treturn 0;\n\t\t}\n\t}\n\tint max=0;\n\tfor(i=0;i<3;i++){\n\t\tif(max<a[i]){\n\t\t\tmax=a[i];\n\t\t}\n\t}\n\tint min;\n\tmin=a[0]+a[1]+a[2]-max;\n\tprintf(\""%d\"",min);\n    return 0;\n}",ACCEPTED,38,512
1591649403918901248,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-13 12:29:23,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int P,Q,R;\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    printf(\""从A到B花费%d块钱，从B到C花费%d块钱，此时所有地点都去过了，总花费为%d块钱。\"",P,Q,P+Q);\n    return 0;\n}",WRONG_ANSWER,8,348
1591649408700440576,4812f9582f90b7f3f95178a62ec39f3555e90b935658da3e31a47fe0d2e8c6fd,2022-11-13 12:29:25,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main()\n{int i;\n\n    printf(\""%d\"",60);\n return 0;\n}",ACCEPTED,5,200
1591649428036182016,c358160a3e618a44cd693944fe10043e6372f46bf7d517c3c3f583bd85b17c5e,2022-11-13 12:29:29,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"n, m ,y= map(int,input().split())\nprint(n+m)\n\n",WRONG_ANSWER,38,2904
1591649439583100928,28b4de6882b7ade2679f59c486acaf307ce8415dcb0a15787dba589025bbdb02,2022-11-13 12:29:32,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint i,n,flag=0,k=0;\n\tscanf(\""%d\"",&n);\n\tint num[n];\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&num[i]);\n\t}\n\tfor(i=1;i<n;i++)\n\t{\n\t\tif(num[i]<num[i-1])\n\t\t{\n\t\t\tflag=1;\n\t\t}\n\t\tif(flag==1&&num[i]>num[i-1])\n\t\t{\n\t\t\tflag++;\n\t\t}\n\t\tif(flag==2)\n\t\t{\n\t\t\tk++;\n\t\t\tflag=0;\n\t\t}\n\t\t\n\t}\n\tprintf(\""%d\"",k);\n\treturn 0;\n}",ACCEPTED,28,324
1591649471304589312,7dd0c628805d8a6777ff5cc70a5ec79db9475f660782b2f4289ae98977303581,2022-11-13 12:29:40,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"data=list(map(eval,input().split())\ns=data[0]+data[1]\nprint(s)",NON_ZERO_EXIT_CODE,16,2900
1591649475326926848,617f184ce583e9f7a346564ab5659fda0ca35a3a714a0c929cb07f915f4f514b,2022-11-13 12:29:40,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,s;\n    scanf(\""%d\"",&n);\n    scanf(\""%d\"",&s);\n    printf(\""0011\"");\n    return 0;\n}\n",WRONG_ANSWER,5,200
1591649480569806848,f55f4c0e0e3367434e26a462e3665271f5b4141ea3de4f34d96fdb21d67e2a7c,2022-11-13 12:29:42,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n;\n n=60;\n printf(\""%d\"",n);\n\n\n\n    return 0;\n}\n",ACCEPTED,16,328
1591649495841267712,4812f9582f90b7f3f95178a62ec39f3555e90b935658da3e31a47fe0d2e8c6fd,2022-11-13 12:29:45,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main()\n{int i;\n\n    printf(\""%d\"",60);\n return 0;\n}",ACCEPTED,9,196
1591649504842276864,2a1cee132cc8344d51461f6cbf473fb80705d6fd5972f9a5d0fcfea0760fd8b1,2022-11-13 12:29:48,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    if(P,Q,R>=1&&P,Q,R<=1000)\n    {\n        printf(\""%d\"",P+Q);\n    }\n    return 0;\n}\n",WRONG_ANSWER,8,512
1591649505827938304,bce383372e0b1b627f0a9b838121096ec3ca14c0f213828fca1bf517a82c8744,2022-11-13 12:29:48,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int P,Q,R;\n    printf(\""请输入三个整数：\\n\"");\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    if(P+Q<P+R && P+Q<Q+R)\n        printf(\""从A到B花费%d块钱，从B到C花费%d块钱，此时所有地点都去过了，总花费为%d块钱。\"",P,Q,P+Q);\n    if(P+R<P+R && P+R<P+Q)\n        printf(\""从C到A花费%d块钱，从A到B花费%d块钱，此时所有地点都去过了，总花费为%d块钱。\"",R,P,P+R);\n    if(Q+R<P+R && Q+R<P+Q)\n        printf(\""从B到C花费%d块钱，从C到A花费%d块钱，此时所有地点都去过了，总花费为%d块钱。\"",Q,R,Q+R);\n}",WRONG_ANSWER,8,324
1591649523523706880,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-13 12:29:52,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int x,y,z,sum[3],i,max;\n    scanf(\""%d\"",&x);\n    scanf(\""%d\"",&y);\n    scanf(\""%d\"",&z);\n    max=x+y;\n    sum[0]=x+y;\n    sum[1]=y+z;\n    sum[3]=x+z;\n    for(i=0;i<3;i++)\n        if(sum[i]>max) max=sum[i];\n    printf(\""%d\"",max);\n}",WRONG_ANSWER,4,328
1591649576418029568,864c0dc14d6d917707294bc7e18ea53a2c0536c5d47f3d25f94f0188f106014f,2022-11-13 12:30:05,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b,c,s;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    s=a+b;\n    printf(\""%d\"",s);\n    return 0;\n}",WRONG_ANSWER,39,488
1591649584685002752,6a835d762a87e93baf4142897168374dc31e9da90b86c19ed82f21159b644272,2022-11-13 12:30:07,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nmain()\n{\n    int P,Q,R,a,b,c,X;\n    printf(\""%d%d%d\"",a,b,c);\n    scanf(\""%d%d%d\"",&a,&b,&c);\n    a+b=P;\n    P=P-a;\n        X=P+c;\n    printf(\""%d\"",X);\n}",COMPILE_ERROR,0,0
1591649601734848512,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 12:30:11,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"print(\""从 A 到 B 花费3块钱，从 B 到 C 花费2块钱，此时所有地点都去过了，总花费为5块钱。\"")",WRONG_ANSWER,25,2756
1591649641412964352,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-13 12:30:20,C++,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint d[10];\nint main(){\n    int a,b,c;\n    cin>>a>>b>>c;\n    d[0]=a+b;\n    d[1]=a+c;\n    d[2]=b+c;\n    sort(d,d+3);\n    cout<<d[0];\n\treturn 0;\n} ",ACCEPTED,40,600
1591649650724364288,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-13 12:30:22,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int x,y,z,sum[3],i,max;\n    scanf(\""%d\"",&x);\n    scanf(\""%d\"",&y);\n    scanf(\""%d\"",&z);\n    max=x+y;\n    sum[0]=x+y;\n    sum[1]=y+z;\n    sum[2]=x+z;\n    for(i=0;i<3;i++)\n        if(sum[i]>max) max=sum[i];\n    printf(\""%d\"",max);\n}",WRONG_ANSWER,12,328
1591649671750410240,281adcca8943f9f4c0ced14f1ceffe157a34fca39f3cb864eb95e400944e38a8,2022-11-13 12:30:27,Java,300.0,1591610585635213318,1591131464941563904,1049226928954454016,\nimport java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner scan=new Scanner(System.in);\n\t\tint[] arr=new int[3];\n\t\tint a=0;\n\t\tint b=0;\n\t\tint c=0;\n\t\tfor(int i=0;i<3;i++){\n\t\t\tarr[i]=scan.nextInt();\n\t\t}\n\t\ta=arr[0]+arr[1];\n\t\tb=arr[1]+arr[2];\n\t\tc=arr[2]+arr[0];\n\t\tif(a<b&&a<c){\n\t\t\tSystem.out.print(a);\n\t\t}\n\t\telse if(b<a&&b<c){\n\t\t\tSystem.out.print(b);\n\t\t}\n\t\telse if(c<b&&c<a){\n\t\t\tSystem.out.print(c);\n\t\t}\n        else{\n            System.out.print(a);\n        }\n\t}\n\n}\n,ACCEPTED,527,24904
1591649673520373760,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-13 12:30:28,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"n=int(input())\ndata=list(map(int,list(input())))\n\ncount=0\nfor i in range(int(n/2)):\n    for x in range(0,len(data)-1):\n        if data[x]!=data[x+1]:\n            data.pop(x)\n            data.pop(x)\n            count+=1\n            break\nprint(count*2)",TIME_LIMIT_EXCEEDED,468,4464
1591649708647702528,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-13 12:30:36,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"n=int(input())\ndata=list(map(int,list(input())))\ncount=0\nfor i in range(int(n/2)):\n    for x in range(0,len(data)-1):\n        if data[x]!=data[x+1]:\n            data.pop(x)\n            data.pop(x)\n            count+=1\n            break\nprint(count*2)",TIME_LIMIT_EXCEEDED,464,4608
1591649721176043520,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 12:30:39,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"print(\""从A到B花费3块钱，从B到C花费2块钱，此时所有地点都去过了，总花费为5块钱。\"")",WRONG_ANSWER,16,2944
1591649766977855488,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 12:30:50,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"print(\""5\"")",WRONG_ANSWER,19,2944
1591649791069937664,acf80eea856463058b81f71c0238069795893092293fbd098cc594959df6444e,2022-11-13 12:30:56,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,a=[]\nb=0\na=input().split()\na.remove(max(a))\nfor i in range(2):\n    b=b+int(a[i])\nprint(b),WRONG_ANSWER,16,3052
1591649791434874880,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-13 12:30:56,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"n=int(input())\ndata=list(map(int,list(input())))\ncount=0\nfor i in range(int(n/2)):\n    for x in range(0,len(data)-1):\n        if data[x]!=data[x+1]:\n            data.pop(x)\n            data.pop(x)\n            count+=1\n            break\nprint(count*2)",TIME_LIMIT_EXCEEDED,488,4592
1591649804743368704,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-13 12:30:59,Java,0.0,1591610585635213312,1589816514637750272,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint num = sc.nextInt();\n\t\tString str = sc.nextLine();\n\t\tchar[] strlist = str.toCharArray();\n\t\tint count = 0;\n\t\tfor (int i = 0; i < num; i++) {\n\t\t\tif (strlist[i] != strlist[i+1]) {\n\t\t\t\tcount += 2;\n\t\t\t\ti = 0;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n},NON_ZERO_EXIT_CODE,88,23432
1591649811240378368,225b1524edf804414c466257a4f19789fe127117b27e663dc835d742fed77f9e,2022-11-13 12:31:01,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main（）\n{\nint i;\ni=60;\nprintf（\""%d\"",&i）;\nreturn 0;\n}",COMPILE_ERROR,0,0
1591649813337530368,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-13 12:31:01,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int x,y,z,sum[3],i,min;\n    scanf(\""%d\"",&x);\n    scanf(\""%d\"",&y);\n    scanf(\""%d\"",&z);\n    min=x+y;\n    sum[0]=x+y;\n    sum[1]=y+z;\n    sum[2]=x+z;\n    for(i=0;i<3;i++)\n        if(sum[i]<min) min=sum[i];\n    printf(\""%d\"",min);\n}",ACCEPTED,23,476
1591649832060903424,7dd0c628805d8a6777ff5cc70a5ec79db9475f660782b2f4289ae98977303581,2022-11-13 12:31:06,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"data=list(map(eval,input().split())\nsplit()=0\ns=data[0]+data[1]+data[2]\nprint(s)",NON_ZERO_EXIT_CODE,21,3032
1591649898662211584,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-13 12:31:21,Java,0.0,1591610585635213315,1591129345182261248,1049226928954454016,import java.util.Scanner;\npublic class Main{\n    public static void main(String[] args){\n    Scanner sc = new Scanner(System.in);\n        final int gd = -5; // 固定减5\n        int count = 0;\n        int num = 0;\n        int len = sc.nextInt(); // 长度\n        int[] arr = new int[anb]\n            \n        for(int i=0; i<len; i++){\n            arr[i] = sc.nextInt();\n        }\n        \n        for(int j=0; j<len; j++){\n            // 给count赋值 单步最大\n            if(arr[i]+gd > arr[i+3]+gd){\n                count = arr[i]+gd;\n            }else{\n                count = arr[i+3]+gd;\n            }\n            // 总数最大\n            if(count>num){\n                num = count;\n            }\n        }\n        System.out.println(num);\n        sc.close();\n    }\n},COMPILE_ERROR,0,0
1591649899568193536,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 12:31:22,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"print(\""5\\n\""\""\""从A到B花费3块钱，从B到C花费2块钱，此时所有地点都去过了，总花费为5块钱。\"")",NON_ZERO_EXIT_CODE,16,2704
1591649902940446720,f6233bf69e5717913375f818af07214d1d2de6df0cd3bcb24368fbde112d6d15,2022-11-13 12:31:22,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"P, Q, R = (input().split())\nP = int(P)\nQ = int(Q)\nR = int(R)\nprint(P + Q)\n",WRONG_ANSWER,31,2892
1591649914021752832,65ac58572a882f9de09782bce337ee95c6ab91ac6b377f6d29c3ee19b1a17f1a,2022-11-13 12:31:25,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main(){\n    int P,Q,R;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    if(P+Q>=Q+R){\n        printf(\""%d\"",Q+R);\n    }\n    if(P+Q<Q+R){\n        printf(\""%d\"",P+Q);\n    }\n    return 0;\n}",ACCEPTED,29,512
1591649923798675456,69d2f3a9da1c135d111e69327883b4d96c284e9c1c71370cc330a44458f95ab4,2022-11-13 12:31:27,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int i,x,j=0;\n    int a[10]={0};\n    scanf(\""%d\"",&i);\n    for(j=0;j<i;j++)\n    {\n        scanf(\""%d\"",&a[j]);\n    }\n    for(j=1;j<i+1;j++)\n    {\n        if(a[j-1]<a[j]&&a[i]<a[j+1])\n        {\n            x=1;\n        }\n\n    }\n    printf(\""%d\"",x);\n    return 0;\n    }\n",RUNTIME_ERROR,14,200
1591649935853117440,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-13 12:31:30,Java,0.0,1591610585635213315,1591129345182261248,1049226928954454016,import java.util.Scanner;\npublic class Main{\n    public static void main(String[] args){\n    Scanner sc = new Scanner(System.in);\n        final int gd = -5; // 固定减5\n        int count = 0;\n        int num = 0;\n        int len = sc.nextInt(); // 长度\n        int[] arr = new int[anb];\n            \n        for(int i=0; i<len; i++){\n            arr[i] = sc.nextInt();\n        }\n        \n        for(int j=0; j<len; j++){\n            // 给count赋值 单步最大\n            if(arr[i]+gd > arr[i+3]+gd){\n                count = arr[i]+gd;\n            }else{\n                count = arr[i+3]+gd;\n            }\n            // 总数最大\n            if(count>num){\n                num = count;\n            }\n        }\n        System.out.println(num);\n        sc.close();\n    }\n},COMPILE_ERROR,0,0
1591649938340327424,75a6755f083ffc71d77ba6ce593bd24fe8a2ce61edc4710fbde2dce128c47ab4,2022-11-13 12:31:31,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,flag=0;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<n-2;i++)\n    {\n        if(a[i]>a[i+1]&&a[i+2]>=a[i+1])\n            flag++;\n    }\n    printf(\""%d\"",flag);\n    return 0;\n}\n",ACCEPTED,34,492
1591649938747219968,2abced548590476f918e32b0d5a4f88aa736e22ac158ed666b7778a0eaff5bae,2022-11-13 12:31:31,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int p,q,r;\n    scanf(\""%d %d %d\"",&p,&q,&r);\n    printf(\""%d\"",p+q);\n    return 0;\n}",WRONG_ANSWER,18,640
1591649955574767616,c358160a3e618a44cd693944fe10043e6372f46bf7d517c3c3f583bd85b17c5e,2022-11-13 12:31:35,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"n, m ,y= map(int,input().split())\nprint(n+m)\n\n",WRONG_ANSWER,35,2816
1591649958795993088,20ffd83467b553ac24e1f4b8b096d58858684ca8c3f6a4d5a62be9ff7c4817da,2022-11-13 12:31:36,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#define MAX 100000\nint main()\n{\n    int i,t=0,A[3],B[3];\n    for(i=0;i<3;i++)\n        scanf(\""%d\"",&A[i]);\n    B[0]=A[0]+A[1];\n    B[1]=A[0]+A[2];\n    B[2]=A[1]+A[2];\n    t=B[0];\n    for(i=1;i<3;i++){\n        if(t>=B[i])\n            t=B[i];\n    }\n    printf(\""%d\\n\"",t);\n}\n",ACCEPTED,23,356
1591649961434177536,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-13 12:31:36,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,b,c;\n    scanf(\""%d\"",&n);\n    int a[n],i;\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n        if(a[i]==1)\n        {\n            b++;\n        }\n        if(a[i]==0)\n        {\n            c++;\n        }\n        if((b-c)==0)\n        {\n            printf(\""%d\"",b+c);\n        }\n        if((b-c)!=0)\n        {\n            if(b>c)\n                printf(\""%d\"",c);\n            if(b<c)\n                printf(\""%d\"",b);\n        }\n    }\n    \n}",WRONG_ANSWER,7,344
1591649968493178880,acfcf65f14b5d3b02c3225372654b4e21f04d33a8bbaeb346e4fb1d85f2ea94f,2022-11-13 12:31:38,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int P=3,Q=2,R=5;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    printf(\""%d\"",P+Q);\n    return 0；\n}",COMPILE_ERROR,0,0
1591649983236202496,00d0a1b2e987c17fb50850b9ec54bf6b4f8b997eb053d1a9fed6c4888fbe74ed,2022-11-13 12:31:42,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int p,q,r,max,min,i,x=0;\n    scanf(\""%d\"",&p);\n    scanf(\""%d\"",&q);\n    scanf(\""%d\"",&r);\n   \n    \n        if(p+q<x)\n        {\n            max=x;\n            min=p+q;\n        }\n        else {\n            max=p+q;\n            min=x;\n        }\n        if(q+r<max)\n        {\n            min=q+r;\n        }\n        else {min=max;\n              max=q+r;}\n        if(r+q>max)\n        {\n            max=r+q;\n        }\n        else if(r+q<min)\n            min=q+r;\n        \n    \n    printf(\""%d\"",min);\n        return 0;\n}",ACCEPTED,38,452
1591649992623009792,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-13 12:31:44,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int P,Q,R;\n    P=3,Q=2,R=3;\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    printf(\""从A到B花费%d块钱，从B到C花费%d块钱，此时所有地点都去过了，总花费为%d块钱。\"",P,Q,P+Q);\n    return 0;\n}",WRONG_ANSWER,7,324
1591650010796974080,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 12:31:48,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"print(\""5\""\\n)\nprint(从A到B花费3块钱，从B到C花费2块钱，此时所有地点都去过了，总花费为5块钱。\"")",NON_ZERO_EXIT_CODE,17,2892
1591650027616133120,225b1524edf804414c466257a4f19789fe127117b27e663dc835d742fed77f9e,2022-11-13 12:31:52,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main（）\n{\nint i;\n\nprintf（\""%d\"",60）;\nreturn 0;\n}",COMPILE_ERROR,0,0
1591650030711529472,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-13 12:31:53,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main(){\n    int n,a[1000],count=0,i,j;\n      scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n        \n        \n    }\n    for( j=1;j<n-1;j++)\n    {\n        if(a[j]==0&&a[j+1]!=0)\n           \n        count++;\n    }\n      printf(\""%d\"",count+1);\n}",WRONG_ANSWER,17,488
1591650042774302720,cfc5530a19b24fc4b274f2e4d4609e448c7aecb0325c1717b7f709645428127b,2022-11-13 12:31:56,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"print(\""60\"");",WRONG_ANSWER,20,2756
1591650053075525632,bcc80c637e0ae4837743d463049e862b206c31483ff6a67b35742ac5d66647d7,2022-11-13 12:31:58,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n   int n,a,b,c1,c2,F1,F2,f;\n   scanf(\""%d %d %d\"",&n,&a,&b);\n   scanf(\""%d %d\"",&c1,&c2);\n   scanf(\""%d %d\"",&F1,&F2);\n   f=(((c1/(F1+1))*(pow(a,F1+1)))+((c2/(F2+1))*(pow(a,F2+1))))-(((c1/(F1+1))*(pow(b,F1+1)))+((c2/(F2+1))*(pow(b,F2+1))));\n   printf(\""%d\"",f);\n    return 0;\n}\n",WRONG_ANSWER,5,196
1591650061229252608,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 12:32:00,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"print(\""5\"")\nprint(\""从A到B花费3块钱，从B到C花费2块钱，此时所有地点都去过了，总花费为5块钱。\"")",WRONG_ANSWER,24,3016
1591650077104680960,cfc5530a19b24fc4b274f2e4d4609e448c7aecb0325c1717b7f709645428127b,2022-11-13 12:32:04,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"print(\""4\"");",WRONG_ANSWER,16,2904
1591650086927785984,910d600982c42b3bf326994e410e7a344f2438b451c8f7deb6f6a9f965d3ee41,2022-11-13 12:32:06,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int n,i,j,count=0;\n    scanf(\""%d\"",&n);\n    char S[n];\n    S[n]=getchar();\n    for(i=n;i>0;i--)\n    {\n        for(j=0;j<i;j++)\n        {\n            if(S[j]!=S[j+1])\n            {\n                S[j]=S[j+2];\n                S[j+1]=S[j+3];\n                count++;\n                break;\n            }\n                \n        }\n    }\n    printf(\""%d\"",count);\n}",WRONG_ANSWER,15,196
1591650091856093184,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 12:32:07,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"print(\""5\""\\n)\nprint(\""从A到B花费3块钱，从B到C花费2块钱，此时所有地点都去过了，总花费为5块钱。\"")",NON_ZERO_EXIT_CODE,24,2764
1591650114220122112,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-13 12:32:13,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int P,Q,R;\n    scanf(\""%d%d\"",&P,&Q);\n    printf(\""从A到B花费%d块钱，从B到C花费%d块钱，此时所有地点都去过了，总花费为%d块钱。\"",P,Q,P+Q);\n    return 0;\n}",WRONG_ANSWER,5,324
1591650125997727744,667c2e97e82c372f60661d46943ff56a17c9350387f4364ebabe70ac2e232862,2022-11-13 12:32:16,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int x,y,z,n;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    n=x+y+z-x;\n    printf(\""\"",n);\n    return 0;\n}\n",WRONG_ANSWER,4,324
1591650126203215872,c358160a3e618a44cd693944fe10043e6372f46bf7d517c3c3f583bd85b17c5e,2022-11-13 12:32:16,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"n,m,y= map(int,input().split())\nprint(n+m)\n\n",WRONG_ANSWER,34,2944
1591650138433806336,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 12:32:19,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"print(\""5\"")\\n\nprint(\""从A到B花费3块钱，从B到C花费2块钱，此时所有地点都去过了，总花费为5块钱。\"")",NON_ZERO_EXIT_CODE,19,3028
1591650141311131648,13616e85f216dd3844293b46f4b46105a0a2c458f7807a7b677858feb35cb63a,2022-11-13 12:32:19,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,i,j,sum=0;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if(a[i]!=a[i+1])\n        {\n            for(j=i;j<n;j++)\n            {\n            a[j]=a[j+1];\n            }\n            n=n-2;\n             sum=sum+2;\n            i=0;\n        }\n        \n    }\n    printf(\""%d\"",sum);\n    \n}",WRONG_ANSWER,9,348
1591650181593182208,a57fdafe4877cd9608fc0ac8a5120a47bc60a015785960e61b67b4e66187c2f2,2022-11-13 12:32:29,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 100\nint main()\n{\n    int n,i,b,j,max;\n    int a[N],c[N];\n   scanf(\""%d\"",&n);\n   for(i=0;i<n;i++)\n    scanf(\""%d\"",&a[i]);\n  for(i=0;i<n;i++){\n    for(j=0;j<n;j++){\n        if(a[i]>=a[j]){\n            b=a[i];\n            a[i]=a[j];\n            a[j]=b;\n        }\n    }\n  }\n   for(i=0;i<n;i++)\n        c[i]=a[i]*(i+1);\n     for(i=0;i<n;i++){\n        for(j=0;j<n;j++){\n            if(c[i]>=c[j]){\n                max=c[i];\n                c[i]=c[j];\n                c[j]=max;\n            }\n        }\n    }\n    printf(\""%d\"",c[0]);\n    return 0;\n}",WRONG_ANSWER,5,200
1591650187221950464,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 12:32:30,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"print(\""5\\n\"")\nprint(\""从A到B花费3块钱，从B到C花费2块钱，此时所有地点都去过了，总花费为5块钱。\"")",WRONG_ANSWER,16,2752
1591650188820013056,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-13 12:32:31,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int P,Q;\n    scanf(\""%d%d\"",&P,&Q);\n    printf(\""从A到B花费%d块钱，从B到C花费%d块钱，此时所有地点都去过了，总花费为%d块钱。\"",P,Q,P+Q);\n    return 0;\n}",WRONG_ANSWER,6,332
1591650201516171264,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 12:32:34,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"print(\""5\\n\"")\nprint(\""从A到B花费3块钱，从B到C花费2块钱，此时所有地点都去过了，总花费为5块钱。\"")",WRONG_ANSWER,18,2888
1591650205538508800,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-13 12:32:35,Python,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"p,q,r=map(eval,input().split())\nnum1 = p+q\nnum2 = p+r\nnum3 = q+r\nif num1<num2 and num1<num3:\n    print(num1)\nif num2<num1 and num2<num3:\n    print(num2)\nif num3<num2 and num3<num1:\n    print(num3)",ACCEPTED,92,3072
1591650208935862272,190178fcb71270e17fbe689a22517f5296281dfcd3b16ec01748057e49740d1d,2022-11-13 12:32:35,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R,X,Y,Z;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    X=P+Q;\n    Y=Q+R;\n    Z=R+P;\n    if(X<=Y<=Z&&X<=Z<=Y)\n    printf(\""%d\"",X);\n    else if(Y<=X<=Z&&Y<=Z<=X)\n    printf(\""%d\"",Y);\n    else if(Z<=X<=Y&&Z<=Y<=X)\n    printf(\""%d\"",Z);\n    return 0;\n}\n\n",WRONG_ANSWER,8,328
1591650274358616064,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-11-13 12:32:51,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int n,h[i],i,count=0;\n    scanf(\""%d\"",&n);\n    printf(\""\\n\"");\n    scanf(\""%d\"",&h[i]);\n   if(h[i-1]>=h[i]&&h[i]<=h[i+1])\n        {\n            count=count+1;\n        }\n    printf(\""%d\"",count);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1591650284986982400,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-13 12:32:54,Java,0.0,1591610585635213315,1591129345182261248,1049226928954454016,import java.util.Scanner;\npublic class Main{\n    public static void main(String[] args){\n    Scanner sc = new Scanner(System.in);\n        final int gd = -5; // 固定减5\n        int count = 0;\n        int num = 0;\n        int len = sc.nextInt(); // 长度\n        int[] arr = new int[len];\n            \n        for(int i=0; i<len; i++){\n            arr[i] = sc.nextInt();\n        }\n        \n        for(int j=0; j<len; j++){\n            // 给count赋值 单步最大\n            if(arr[j]+gd > arr[j+3]+gd){\n                count = arr[j]+gd;\n            }else{\n                count = arr[j+3]+gd;\n            }\n            // 总数最大\n            if(count>num){\n                num = count;\n            }\n        }\n        System.out.println(num);\n        sc.close();\n    }\n},NON_ZERO_EXIT_CODE,309,42372
1591650291727228928,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-13 12:32:55,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int P,Q;\n    scanf(\""%d%d\"",&P,&Q);\n    printf(\""从A到B花费%d块钱，从B到C花费%d块钱，此时所有地点都去过了，总花费为%d块钱。\"",P,Q,P+Q);\n    return 0;\n}",WRONG_ANSWER,10,512
1591650291995664384,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-11-13 12:32:55,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int n,h[i],i,count=0;\n    scanf(\""%d\"",&n);\n    printf(\""\\n\"");\n    scanf(\""%d\"",&h[i]);\n   if(h[i-1]>=h[i]&&h[i]<=h[i+1])\n        {\n            count=count+1;\n        }\n    printf(\""%d\"",count);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1591650307011272704,225b1524edf804414c466257a4f19789fe127117b27e663dc835d742fed77f9e,2022-11-13 12:32:59,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main（）\n{\nint i;\n\nprintf（\""%d\"",60）;\nreturn 0;\n}",COMPILE_ERROR,0,0
1591650310635151360,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 12:33:00,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int p,q,r,sum;\n    scanf(\""%d %d %d\"",&p,&q,&r);\n    if(p<=q&&p<r)\n        sum=p+q;\n    else if(q<=p&&q<r)\n        sum=p+q;\n    else if(r<=p&&r<q)\n        sum=r+p;\n    else\n        sum=p+q;\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,25,512
1591650331120164864,910d600982c42b3bf326994e410e7a344f2438b451c8f7deb6f6a9f965d3ee41,2022-11-13 12:33:05,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    printf(\""60\"");\n}",ACCEPTED,5,196
1591650331803803648,e51465ce72346fac918042a342986433269a159492161f223a180a6e05d9a01a,2022-11-13 12:33:05,Java,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"public class Main {\n\tpublic static void main(String[] args) {\n\t    System.out.printf(\""%d\"", 60);\n    }\n}",ACCEPTED,79,23348
1591650359683330048,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-13 12:33:11,Java,0.0,1591610585635213315,1591129345182261248,1049226928954454016,import java.util.Scanner;\npublic class Main{\n    public static void main(String[] args){\n    Scanner sc = new Scanner(System.in);\n        final int gd = -5; // 固定减5\n        int count = 0;\n        int num = 0;\n        int len = sc.nextInt(); // 长度\n        int[] arr = new int[len];\n            \n        for(int i=0; i<len; i++){\n            arr[i] = sc.nextInt();\n        }\n        \n        for(int j=0; j<len; j++){\n            // 给count赋值 单步最大\n            if(arr[j]+gd > arr[j+3]+gd){\n                count = arr[j]+gd;\n            }else{\n                count = arr[j+3]+gd;\n            }\n            // 总数最大\n            if(count>num){\n                num = count;\n            }\n        }\n        System.out.println(num);\n        sc.close();\n    }\n},NON_ZERO_EXIT_CODE,292,41432
1591650362690658304,d9e00d995e65b04cda3ddef6baec19225e4351002ab4efa981f62d78919a481b,2022-11-13 12:33:12,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int p,q,r;\n    int sum=0;\n    scanf(\""%d%d%d\"",&p,&q,&r);\n    if(p<q && p<r) printf(\""%d\"",p+q);\n    if(q<p && q<r) printf(\""%d\"",q+r);\n    if(r<p && r<q) printf(\""%d\"",r+p);\n    return 0;\n}",WRONG_ANSWER,24,348
1591650393896280064,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-11-13 12:33:19,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int n,i,count=0;\n    scanf(\""%d\"",&n);\n    printf(\""\\n\"");\n    scanf(\""%d\"",&h[i]);\n   if(h[i-1]>=h[i]&&h[i]<=h[i+1])\n        {\n            count=count+1;\n        }\n    printf(\""%d\"",count);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1591650403966836736,262cde49cc56abe96630625fe60c7207e4f635bd56c839389b503b1f360d8ab2,2022-11-13 12:33:22,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int p,q,r,z,a;\n    scanf(\""%d,%d,%d\"",&p,&q,&r);\n    if（q>p)\n    {\n        z=q,q=p,p=z;\n    }\n    if（q>r)\n    {\n        z=q,q=r,r=z;\n    }\n    if（p>r)\n    {\n        z=p,p=r,r=z;\n    }\n    a=p+q\n    printf(\""%d\"",&a);\n    return 0;\n}",COMPILE_ERROR,0,0
1591650432035074048,fbea21dbaf89f1b064feaa20227f21c5e1c4888fdc371cf5e43f70615906e52a,2022-11-13 12:33:29,Python,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"n=int(input())\nm=list(map(int,input().split()))\nnum=0\nfor i in range (n):\n    if m[i]>=3:\n        num+=1\ns=3*num*1\nprint(s)\n    ",WRONG_ANSWER,20,2892
1591650442906710016,e67d0171967fcfdd3835361399616ff4e60e12e62c2ed2fd59506c58aeaae4ad,2022-11-13 12:33:31,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int p,q,r,z;\n    scanf(\""%d,%d,%d\"",&p,&q,&r);\n    z=p+q+r;\n    printf(\""%d\"",z);\n    \n        \n}",WRONG_ANSWER,13,348
1591650443342929920,beefe7893dd2cd421da3fb1ba3ffd90e3dc51d5301380baebfdfa12fbe5234f5,2022-11-13 12:33:31,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,print('60'),ACCEPTED,15,2688
1591650448078299136,1f15b5b41f9e61f2d767bcb1ae88bef60c94b97dd423bfd2ba9c8c0e8e9d05bb,2022-11-13 12:33:32,Java,300.0,1591610585635213318,1591131464941563904,1049226928954454016,import java.util.Scanner;\npublic class Main{\n    public static void main(String[] args){\n        Scanner sc=new Scanner(System.in);\n        int P=sc.nextInt();\n        int Q=sc.nextInt();\n        int R=sc.nextInt();\n        int X=P+Q;\n        int Y=Q+R;\n        int Z=R+Q;\n     if(X>Y){\n         if(Y>Z){\n             System.out.println(Z);             \n         }else{\n             System.out.println(Y);\n         }\n     }else{\n         System.out.println(X);\n     }\n    \n        }\n  },ACCEPTED,546,24752
1591650450167050240,b80fc2aed0abde15bdaa9327874c9784da696b6ed442d90001602ff2a017be15,2022-11-13 12:33:33,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h> \n#include<math.h> \nint main()\n{\n\tint P,Q,R,i,j,t;\n\tint a[3];\n\tscanf(\""%d %d %d\"",&a[0],&a[1],&a[2]);\n\n\tfor(i=0;i<2;i++)\n\t for(j=i;j<2;j++)\n\t  {\n\t  \tif(a[i]>a[j+1])\n\t  \t  {\n\t  \t  \tt=a[i];\n\t  \t  \ta[i]=a[j+1];\n\t  \t  \ta[j+1]=t;\n\t\t\t}\n\t  }\n\t  t=a[0]+a[1];\n \n\t  printf(\""%d\"",t);\n\t  return 0; \n}",ACCEPTED,49,372
1591650453707087872,190178fcb71270e17fbe689a22517f5296281dfcd3b16ec01748057e49740d1d,2022-11-13 12:33:34,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n    int P,Q,R,X,Y,Z;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    X=P+Q;\n    Y=Q+R;\n    Z=R+P;\n    if(X<=Y<=Z&&X<=Z<=Y)\n    printf(\""%d\"",X);\n    else if(Y<=X<=Z&&Y<=Z<=X)\n    printf(\""%d\"",Y);\n    else if(Z<=X<=Y&&Z<=Y<=X)\n    printf(\""%d\"",Z);\n    return 0;\n}\n\n",WRONG_ANSWER,18,352
1591650455875497984,453285058ad721dec4e5d0f61707f295aaddf066021a84ead6a70901f10455df,2022-11-13 12:33:34,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    \n    n=sizeof(0011);\n    printf(\""%d\"",n);\n    return 0;\n}\n",WRONG_ANSWER,6,328
1591650462410268672,07d925df8d2026d3171a0a2ca84a6ef7f4a5b47a584cf47b66c5dd8f28139d1f,2022-11-13 12:33:36,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b,n,i;\n    scanf(\""%d\"",&n);\n    for (i=1;i<=n;i++){\n        scanf(\""%d\"",&a);\n    }\n    b=15;\n    printf(\""%d\\n\"",b);\n    return 0;\n}\n\n",WRONG_ANSWER,10,332
1591650502759473152,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-13 12:33:45,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"n=int(input())\n# data=list(map(int,list(input())))\ndata=input()\ncount=0\nfor i in range(int(n/2)):\n    for x in range(i,len(data)-1):\n        if data[x]!=data[x+1]:\n            # data.pop(x)\n            # data.pop(x)\n            count+=1\n            break\nprint(count*2)",WRONG_ANSWER,17,2772
1591650523919736832,e0a829315cc9947a3e714cd579e3322e8dee5f8ca36e30fd276de5a8e294b6f8,2022-11-13 12:33:50,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n    int n;\n    int s[10];\n    int i;\n    int k=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&s[i]);\n    for(i=0;i<n;i++)\n        {if(s[i]==s[i+1])\n            i+=2;\n            s[i]=s[i+2];\n            k+=2;}\n    printf(\""%d\"",k);\n    return 0;\n}\n",RUNTIME_ERROR,5,200
1591650529523294208,225b1524edf804414c466257a4f19789fe127117b27e663dc835d742fed77f9e,2022-11-13 12:33:52,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main（）\n{\nint i;\n\nprintf(\""%d\"",60);\nreturn 0;\n}",COMPILE_ERROR,0,0
1591650532207681536,7935e8f5cb04027f4d30ac84a997e2d03e946e112c1cb17f1a4f943d8b0b54bf,2022-11-13 12:33:52,C++,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <iostream>\n#include<stdio.h>\n#include<algorithm>\n\nusing namespace std;\n\nint main()\n{\n    int x,y,z,t=0,m=0;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    m=max(x,y);\n    m=max(m,z);\n    t=x+y+z-m;\n    printf(\""%d\"",t);\n    return 0;\n}\n",ACCEPTED,50,512
1591650560611475456,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-13 12:33:59,Java,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int P=sc.nextInt();\n        int Q=sc.nextInt();\n        int R=sc.nextInt();\n        int result=P+Q+R-Math.max(P,Math.max(P,Q));\n        System.out.println(result);\n    }\n}",WRONG_ANSWER,101,24668
1591650565317472256,225b1524edf804414c466257a4f19789fe127117b27e663dc835d742fed77f9e,2022-11-13 12:34:00,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main()\n{\nint i;\n\nprintf(\""%d\"",60);\nreturn 0;\n}",ACCEPTED,5,356
1591650580345708544,d9e00d995e65b04cda3ddef6baec19225e4351002ab4efa981f62d78919a481b,2022-11-13 12:34:04,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int p,q,r;\n    int sum=0;\n    scanf(\""%d%d%d\"",&p,&q,&r);\n    if(p<=q && p<=r) printf(\""%d\"",p+q);\n    if(q<=p && q<=r) printf(\""%d\"",q+r);\n    if(r<=p && r<=q) printf(\""%d\"",r+p);\n    return 0;\n}\n",WRONG_ANSWER,17,352
1591650580454760448,864c0dc14d6d917707294bc7e18ea53a2c0536c5d47f3d25f94f0188f106014f,2022-11-13 12:34:04,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b,c,s,w;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    s=a+b;\n    w=b+c;\n    if(s<w)\n    printf(\""%d\"",s);\n    else printf(\""%d\"",w);\n    return 0;\n}",ACCEPTED,38,512
1591650596137263104,4d1157ac6ad50cfc6ca5d6b3e1c2dd7f1ecc593df10ff6888d4207a4f1c03a35,2022-11-13 12:34:08,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int P,Q,R,sum1=0,sum2=0,sum3=0;\n    cin>>P>>Q>>R;\n    int min=301;\n    sum1=P+Q;\n    if(sum1<min)min=sum1;\n    sum2=P+R;\n    if(sum2<min)min=sum2;\n    sum3=R+Q;\n    if(sum3<min)min=sum3;\n    printf(\""%d\"",min);\n    return 0;\n}",WRONG_ANSWER,8,324
1591650615066157056,7dd0c628805d8a6777ff5cc70a5ec79db9475f660782b2f4289ae98977303581,2022-11-13 12:34:12,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"data=list(map(eval,input().split())\ns=data[0]+data[1]\nelse\ns=data[1]+data[2]\nprint(s)",NON_ZERO_EXIT_CODE,16,2892
1591650622724956160,d122b81a371b28751082747cf65a235d0eddfd496e142775cd971d8f88adf327,2022-11-13 12:34:14,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nint main (){\n    printf(\""60\\n\"");\n    return 0;\n}",ACCEPTED,8,512
1591650643893563392,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-13 12:34:19,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"data=list(map(eval,input().split()))\ns=data[0]+data[1]\nprint(s)",WRONG_ANSWER,38,3048
1591650678769246208,2bc6a85c0376656012a7970a7842a2a9d8769555a79ef4eec85ff45aa30ff7b7,2022-11-13 12:34:27,Java,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint p = sc.nextInt();\n\t\tint q = sc.nextInt();\n\t\tint r = sc.nextInt();\n\t\tint a = p+q;\n\t\tint b = q+r;\n\t\tint c = p+r;\n\t\tSystem.out.print(Math.min(Math.min(a, b), c));\n\t}\n}",ACCEPTED,542,24724
1591650685501059072,09eb01e8f9f24922a6c60a1149d505ad1ebb9b0a39ed1101140fe0fd93daa753,2022-11-13 12:34:29,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n   int arr[4]={0};\n   int i= 0;\n   int a,b,c,min=0;\n   for(i=0;i<3;i++)\n   {\n       scanf(\""%d\"",&arr[i]);\n   }\n   a=arr[0]+arr[1];\n   b=arr[1]+arr[2];\n   c=arr[2]+arr[0];\n   if(a>b)\n    min=b;\n   else\n    min=a;\n   if(min>c)\n    min=c;\n   printf(\""%d\"",min);\n   return 0;\n}\n",ACCEPTED,27,352
1591650689485647872,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-13 12:34:30,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"data=list(map(eval,input(),split()))\ns=data[0]+data[1]\nprint(s)",NON_ZERO_EXIT_CODE,21,2896
1591650744825307136,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-13 12:34:43,Java,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int P=sc.nextInt();\n        int Q=sc.nextInt();\n        int R=sc.nextInt();\n        int result=P+Q+R-Math.max(P,Math.max(P,Q));\n        System.out.print(result);\n    }\n}",WRONG_ANSWER,104,24496
1591650831198609408,190178fcb71270e17fbe689a22517f5296281dfcd3b16ec01748057e49740d1d,2022-11-13 12:35:04,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n    int P,Q,R,X,Y,Z;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    X=P+Q;\n    Y=Q+R;\n    Z=R+P;\n    if(X<Y<Z&&X<Z<Y)\n    printf(\""%d\"",X);\n    else if(Y<X<Z&&Y<Z<X)\n    printf(\""%d\"",Y);\n    else if(Z<X<Y&&Z<Y<X)\n    printf(\""%d\"",Z);\n    return 0;\n}\n",WRONG_ANSWER,10,344
1591650841365602305,064270dabaa13edbd7238477860db0e46621a5ed4921e8aa2c0f9258e77722cc,2022-11-13 12:35:06,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint money(int a,int b,int c)\n{\n    int m,n,p;\n    m=a+b;\n    n=b+c;\n    p=c+a;\n    if(m<=n&&m<=p)\n    {\n        return m;\n    }\n    if(n<m&&n<p)\n    {\n        return n;\n    }\n    if(p<=n&&p<=m)\n    {\n        return p;\n    }\n}\n\n\nint main()\n{\n    int a,b,c;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    int lessmoney=money(a,b,c);\n    printf(\""%d\"",lessmoney);\n    return 0;\n}\n",ACCEPTED,51,476
1591650859778596864,1f29a576db974352c60cbe8aafdc4e5328b24d800890ab1c712d8c9fa85d72cc,2022-11-13 12:35:11,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint P,Q,R;\n\tint min=0;\n\tscanf(\""%d%d%d\"",&P,&Q,&R);\n\tmin=P+Q;\n\tif(min>=(Q+R)) min=Q+R;\n\tif(min<=(Q+R)) min=min;\n\tif(min>=(R+P)) min=R+P;\n\tif(min<=(R+P)) min=min;\n\tprintf(\""%d\"",min);\n\treturn 0;\n } ",ACCEPTED,59,512
1591650883770003456,6933dcb3592e2d6f6fc887ed9a5537aab21a30f76450c9b5043f7776bfc39a59,2022-11-13 12:35:16,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main(){\n    printf(\""60\"");\n    return 0;\n}",ACCEPTED,5,328
1591650884202029056,d9e00d995e65b04cda3ddef6baec19225e4351002ab4efa981f62d78919a481b,2022-11-13 12:35:16,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int p,q,r;\n    int sum=0;\n    scanf(\""%d%d%d\"",&p,&q,&r);\n    if(p<q && p<r) printf(\""%d\"",p+q);\n    if(q<p && q<r) printf(\""%d\"",q+r);\n    if(r<p && r<q) printf(\""%d\"",r+p);\n    if(p==q && p==r) printf(\""%d\"",p+q);\n    return 0;\n}\n",WRONG_ANSWER,16,480
1591650892351549440,bcc80c637e0ae4837743d463049e862b206c31483ff6a67b35742ac5d66647d7,2022-11-13 12:35:18,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n   int n,a,b,c1,c2,F1,F2,f;\n   scanf(\""%d %d %d\"",&n,&a,&b);\n   scanf(\""%d %d\"",&c1,&c2);\n   scanf(\""%d %d\"",&F1,&F2);\n   f=(((c1/(F1+1))*(pow(a,F1+1)))+((c2/(F2+1))*(pow(a,F2+1))))-(((c1/(F1+1))*(pow(b,F1+1)))+((c2/(F2+1))*(pow(b,F2+1))));\n   printf(\""%d\"",f);\n    return 0;\n}\n",WRONG_ANSWER,5,196
1591650892888432640,15ac7d06a472ca25d78349f7cc3a73d23c7d7a4f0c4ae3cec6200fcdb8135965,2022-11-13 12:35:18,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n     int p,q,r;\n    scanf(\""%d %d %d\"",&p,&q,&r);\n\n    if(p<q&&p<r&&q<r){\n        printf(\""%d\"",p+q);\n    }\n      if(p<q&&p<r&&q>r){\n        printf(\""%d\"",p+r);\n    }\n    if(r<p&&r<q&&p<q)\n    {\n    printf(\""%d\"",p+r);\n        \n    }\n     if(r<p&&r<q&&p>q)\n    {\n    printf(\""%d\"",q+r);\n        \n    }\n    if(q<r&&q<p&&p<r)\n    {\n    printf(\""%d\"",q+p);\n        \n    }\n      if(q<r&&q<p&&p>r)\n    {\n    printf(\""%d\"",q+r);\n        \n    }\n    return 0;\n}\n",WRONG_ANSWER,40,640
1591650909112000512,a57fdafe4877cd9608fc0ac8a5120a47bc60a015785960e61b67b4e66187c2f2,2022-11-13 12:35:22,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 100\nint main()\n{\n    int n,i,b,j,max;\n    int a[N],c[N];\n   scanf(\""%d\"",&n);\n   for(i=0;i<n;i++)\n    scanf(\""%d\"",&a[i]);\n  for(i=0;i<n;i++){\n    for(j=0;j<n;j++){\n        if(a[i]>=a[j]){\n            b=a[i];\n            a[i]=a[j];\n            a[j]=b;\n        }\n    }\n  }\n   for(i=0;i<n;i++)\n        c[i]=a[i]*(i+1);\n     for(i=0;i<n;i++){\n        for(j=0;j<n;j++){\n            if(c[i]>=c[j]){\n                max=c[i];\n                c[i]=c[j];\n                c[j]=max;\n            }\n        }\n    }\n    printf(\""%d\\n\"",c[0]);\n    return 0;\n}",WRONG_ANSWER,5,196
1591650929777369088,cfc5530a19b24fc4b274f2e4d4609e448c7aecb0325c1717b7f709645428127b,2022-11-13 12:35:27,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"print(\""60\"")",ACCEPTED,17,2776
1591650947821232128,547094c7c62f34b25dac6d7d79e017d817767a29a120ff5083d5fe0c21b62800,2022-11-13 12:35:32,Python,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"def minx(a,b,c):\n    if a<b:\n        d=b\n        b=a\n        a=d\n    if a<c:\n        d=c\n        c=a\n        a=d\n    if b<c:\n        d=c\n        c=b\n        b=d\n    return b+c\na,b,c=map(int,input().split(\"" \""))\nprint(minx(a,b,c))\n",ACCEPTED,93,2888
1591650959640768512,70c675ddfcb60b2192bc8ac38fb068fec0500208a5bf97a796c7cc074b43cf87,2022-11-13 12:35:34,Java,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner myScanner = new Scanner(System.in);\n\t\tint[] arr = new int[3];\n\t\tfor(int i = 0; i < 3;i++){\n\t\t\tarr[i] = myScanner.nextInt();\n\t\t}\n\t\tArrays.sort(arr);\n\t\tint sum = arr[0] + arr[1];\n\t\tSystem.out.printf(\""%d\"",sum);\n\t}\n\n}",ACCEPTED,535,24984
1591650974497038336,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-13 12:35:38,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,b=0,c=0;\n    scanf(\""%d\"",&n);\n    int a[n],i;\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n        if(a[i]==1)\n        {\n            b++;\n        }\n        if(a[i]==0)\n        {\n            c++;\n        }\n        if((b-c)==0)\n        {\n            printf(\""%d\"",b+c);\n        }\n        if((b-c)!=0)\n        {\n            if(b>c)\n                printf(\""%d\"",2*c);\n            if(b<c)\n                printf(\""%d\"",2*b);\n        }\n    }\n    \n}",WRONG_ANSWER,6,196
1591650980981387264,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 12:35:39,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int p,q,r,sum;\n    scanf(\""%d %d %d\"",&p,&q,&r);\n    if(p<=q&&p<r)\n        sum=p+r;\n    else if(q<=p&&q<r)\n        sum=p+q;\n    else if(r<=p&&r<q)\n        sum=r+p;\n    else\n        sum=p+q;\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,5,352
1591651003710320640,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-13 12:35:45,Java,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int P=sc.nextInt();\n        int Q=sc.nextInt();\n        int R=sc.nextInt();\n        int result=P+Q+R-Math.max(P,Math.max(Q,R));\n        System.out.println(result);\n    }\n}",ACCEPTED,543,24740
1591651008147894272,54914c90623988219ee55c4a0b2e645efd9808505aa25f0099930bfa8bf18ad1,2022-11-13 12:35:46,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\n\nint main(){\n\tint p,q,r;\n\tscanf(\""%d%d%d\"",&p,&q,&r);\n\tint a = p+r;\n\tint b = r+q;\n\tint c = q+p;\n\tint min = 0;\n\tif(a<=b) {\n\t\tmin =a;\n\t} else if(c<=min){\n\t\tmin =c;\n\t}\n\t\n\tprintf(\""%d\"",c);\n} ",WRONG_ANSWER,9,352
1591651011230752768,5bd1a8718ea7fb820055421c67b8e0a468e08d951f729a24e55bf407b3bdb1f6,2022-11-13 12:35:47,C++,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <iostream>\n#include <string>\nusing namespace std;\n\n\n\n\n\n\nint main()\n{\n    int n,count=0;\n    string s;\n    cin>>n;\n    cin>>s;\n    int i=0;\n    while(!(s.length()==1||((s[0]==s[1])&&s.length()==2)||s.length()==0)){\n        if(s[i]!=s[i+1]){\n            count+=2;\n            s.erase(i,2);\n            i--;\n        }else{\n            i+=1;\n        }\n \n    }\n\n    cout<<count;\n\n    return 0;\n}\n",RUNTIME_ERROR,7,452
1591651041001877504,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-11-13 12:35:54,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int n,i,h[i],count=0;\n    scanf(\""%d\"",&n);\n    printf(\""\\n\"");\n    scanf(\""%d\"",&h[i]);\n   if(h[i]=0&&h[i-1]>=0)\n        {\n            count=count+1;\n        }\n    printf(\""%d\"",count);\n    return 0;\n}\n",WRONG_ANSWER,12,488
1591651069778997248,262cde49cc56abe96630625fe60c7207e4f635bd56c839389b503b1f360d8ab2,2022-11-13 12:36:01,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int p,q,r,z,a;\n    scanf(\""%d,%d,%d\"",&p,&q,&r);\n    if(q>p){\n        z=q,q=p,p=z;}\n    if(q>r)\n    {\n        z=q,q=r,r=z;\n    }\n    if(p>r)\n    {\n        z=p,p=r,r=z;\n    }\n    a=p+q;\n    printf(\""%d\"",&a);\n    return 0;\n}",WRONG_ANSWER,9,196
1591651074354982912,a13ce9a1eabee5481ddd750d61b635f6239d13ff2293e1ee7ba8168bdcd1bcca,2022-11-13 12:36:02,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"# include<stdio.h>\nint main()\n{\nint a=60;\nprintf(\""%d\"",a);\nreturn 0;\n}",ACCEPTED,5,356
1591651077685260288,e4f316bfe970c62bf57b46f5ef8a290748707bf16f041fe868d04986a0cdd64f,2022-11-13 12:36:03,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"A=input()\na,b,c,d,e,f,g,h,i,j=map(int,input().split())\nprint(\""3\"")",NON_ZERO_EXIT_CODE,20,2996
1591651085591523328,28b4de6882b7ade2679f59c486acaf307ce8415dcb0a15787dba589025bbdb02,2022-11-13 12:36:04,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint a,b,c,temp;\n\tint sum=0;\n\tscanf(\""%d%d%d\"",&a,&b,&c);\n\tif(a<b)\n\t{\n\t\ttemp=a;\n\t\ta=b;\n\t\tb=temp;\n\t}\n\tsum+=b;\n\tif(a<c)\n\tsum+=a;\n\telse\n\tsum+=c;\n\tprintf(\""%d\"",sum);\n\treturn 0;\n}",ACCEPTED,37,612
1591651099919310848,977c9d350f87cd8386fa1f88cca886d6ff43821830806e60da6d6b36dc77cd13,2022-11-13 12:36:08,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,b,c;\n    scanf(\""%d%d%d\"",&a,&b,&c);\n    if(a>b>c||a>c>b||a>b==c)\n    {\n        printf(\""%d\"",b+c);\n    }\n    else if(b>a>c||b>c>a)\n    {\n        printf(\""%d\"",a+c);\n    }\n    else\n    {\n        printf(\""%d\"",a+b);\n    }\n   \n}",WRONG_ANSWER,13,512
1591651101911605248,05f9d62a2660f27e0711448c225e5e0fe6347745a2c93edb6296c0a2ffbc6605,2022-11-13 12:36:08,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nmain()\n{\n    int a,b,c;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    if(a+b>a+c)\n        if(a+c>b+c)\n            printf(\""%d\"",b+c);\n        else \n            printf(\""%d\"",a+c);\n    else if(a+b>b+c)\n            printf(\""%d\"",b+c);\n        else\n            printf(\""%d\"",a+b);\n            \n}",ACCEPTED,38,352
1591651134107082752,d54b7e24c90cf40d468bdeb018e61440010a1049a4ae96e2c6331c215521f91c,2022-11-13 12:36:16,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"printf(\""60\"");",COMPILE_ERROR,0,0
1591651143577788416,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-13 12:36:18,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"n=int(input())\n# data=list(map(int,list(input())))\ndata=input()\ndatas=list(data)\ncount=0\nfor i in range(int(n/2)):\n    for x in range(0,len(datas)-1):\n        if datas[x]!=datas[x+1]:\n            datas.pop(x)\n            datas.pop(x)\n            count+=1\n            break\nprint(count*2)",TIME_LIMIT_EXCEEDED,471,3792
1591651160388546560,ef50cfe7f34b26d29f617c97ac65d40bd15ba1e063897a190284243de955e254,2022-11-13 12:36:22,Java,0.0,1591610585635213316,1591130116607045632,1049226928954454016,public class Main(){\n    public static void main(String[] args){\n        System.out.print(60);\n    }\n}\n,COMPILE_ERROR,0,0
1591651198078574592,0ed66ddb50163bbc5dd43c591bc3d500e68ed69fe23bfebfa6ac827c1dfc1849,2022-11-13 12:36:31,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nmain()\n{\n    int P,Q,R;\n    int count,i=0;\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    if(P>=1&&P<=1000&&Q>=1&&Q<=1000&&R>=1&&R<=1000)\n    {\n        count=P+Q;\n        if(count>Q+R)\n            count=Q+R;\n        if(count>R+P)\n            count=R+P;\n    } \n    printf(\""%d\"",count);\n}",WRONG_ANSWER,5,348
1591651203287900160,2a1cee132cc8344d51461f6cbf473fb80705d6fd5972f9a5d0fcfea0760fd8b1,2022-11-13 12:36:32,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    if(P,Q,R>=1&&P,Q,R<=1000)\n    {\n        if(P+Q)\n            {printf(\""%d\"",P+Q);}\n    }\n    return 0;\n}",WRONG_ANSWER,5,368
1591651250926804992,acfcf65f14b5d3b02c3225372654b4e21f04d33a8bbaeb346e4fb1d85f2ea94f,2022-11-13 12:36:44,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int P=3,Q=2,R=5;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    printf(\""%d\"",P+Q);\n    return 0;\n}",WRONG_ANSWER,10,364
1591651254315835392,3e087b0a196d30fcbb49ca80164c9eb5adf82ae3bb08ec0c141e5728fb180f0d,2022-11-13 12:36:45,Java,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner sc=new Scanner(System.in);\n\t\tint p=sc.nextInt();\n\t\tint q=sc.nextInt();\n\t\tint r=sc.nextInt();\n\t\tSystem.out.print(Math.min(p+q, Math.min(q+r,r+p)));\n\t\tsc.close();\n\t}\n\n}",ACCEPTED,548,24960
1591651258078081024,212aee9dc233539050d1d324af20b580172711970f7c24349b9c7c8ac9b114cd,2022-11-13 12:36:46,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n    int x,y,z,sum;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    sum=x+y;\n    if(x>=0 && x<=1000 && y>=0 && y<=1000 && z>=0 && z<=1000)\n        printf(\""%d\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,8,352
1591651258459774976,d54b7e24c90cf40d468bdeb018e61440010a1049a4ae96e2c6331c215521f91c,2022-11-13 12:36:46,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"int main()\n{\n    printf(\""60\"");\n}\n",ACCEPTED,18,480
1591651260636618752,05fd79145678de5c06012db9db4333bebf8365a74fe442d12a54a9da3782fdca,2022-11-13 12:36:46,C++,0.0,1591610585635213312,1589816514637750272,1049226928954454016,#include<iostream>\n#define N 100005 \nusing namespace std;\nint main(){\n\tchar ball[N];\n\tlong long int n;\n\tlong long int nums = 0;\n\tlong long int fins = 0;\n\tlong long int eins = 1;\n\tcin >> n;\n\tfor(int i = 0;i<n;i++) cin >> ball[i];\n\twhile(eins < n ){ \n\t\tif(ball[fins] == ball[eins]) eins++;\n\t\telse {\n\t\t\tball[fins] = '2';\n\t\t\tball[eins] = '2';\n\t\t\tnums+=2;\n\t\t\tfor(int i = fins;i<=eins+1;i++){\n\t\t\t\tif(ball[i] != '2'){\n\t\t\t\t\tfins = i;\t\n\t\t\t\t}\n\t\t\t}\n\t\t\teins++;\n\t\t\tif(eins == fins){\n\t\t\t\teins++;\n\t\t\t}\n\t\t}\n\t}\n\t\n\tcout<<nums;\n\t\n} ,WRONG_ANSWER,10,468
1591651270816194560,13616e85f216dd3844293b46f4b46105a0a2c458f7807a7b677858feb35cb63a,2022-11-13 12:36:49,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,i,j,sum=0;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if(a[i]!=a[i+1])\n        {\n            for(j=i;j<n;j++)\n            {\n            a[j]=a[j+1];\n            }\n            n=n-2;\n             sum=sum+2;\n            i=0;\n        }\n        if(i==n-2)\n            break;\n    }\n    printf(\""%d\"",sum);\n    printf(\""\\n\"");\n    \n}",WRONG_ANSWER,171,736
1591651272414224384,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-13 12:36:49,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n;\n    n=60;\n    printf(\""%d\"",n);\n}",ACCEPTED,11,324
1591651280886706176,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 12:36:51,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int p,q,r,sum;\n    scanf(\""%d %d %d\"",&p,&q,&r);\n    if(p<=q&&p<r&&r<q)\n        sum=p+r;\n    else if(q<=p&&q<r&&p<r)\n        sum=p+q;\n    else if(r<=p&&r<q&&p<q)\n        sum=r+p;\n    else\n        sum=p+q;\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,20,640
1591651283394912256,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-13 12:36:52,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main ()\n{\n    int n,m;\n    scanf(\""%d\"",&n);\n    int a[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+1]<a[i]&&a[i+1]<=a[i+2])\n            m++;\n    }\n    printf(\""%d\"",m);\n    return 0;\n}",COMPILE_ERROR,0,0
1591651285869539328,54914c90623988219ee55c4a0b2e645efd9808505aa25f0099930bfa8bf18ad1,2022-11-13 12:36:52,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\n\nint main(){\n\tint p,q,r;\n\tscanf(\""%d%d%d\"",&p,&q,&r);\n\tint a = p+r;\n\tint b = r+q;\n\tint c = q+p;\n\tint min = 0;\n\tif(a<=b) {\n\t\tmin =a;\n\t}\n\tif(c<=min){\n\t\tmin =c;\n\t}\n\t\n\tprintf(\""%d\"",c);\n} ",WRONG_ANSWER,12,512
1591651286427426816,0ed66ddb50163bbc5dd43c591bc3d500e68ed69fe23bfebfa6ac827c1dfc1849,2022-11-13 12:36:52,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nmain()\n{\n    int P,Q,R;\n    int count,i=0;\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    if(P>=1&&P<=1000&&Q>=1&&Q<=1000&&R>=1&&R<=1000)\n    {\n        count=P+Q;\n\n    } \n    printf(\""%d\"",count);\n}",WRONG_ANSWER,6,512
1591651304488099840,acfcf65f14b5d3b02c3225372654b4e21f04d33a8bbaeb346e4fb1d85f2ea94f,2022-11-13 12:36:57,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int P=3,Q=2,R=5;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    printf(\""%d\"",P+Q);\n    return 0;\n}",WRONG_ANSWER,12,356
1591651306434256896,29d1ea54d6e4e56fc2de0be5ae10ecc4c70c7fca667934b17857e95530f5663a,2022-11-13 12:36:57,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n   int p,q,r,n;\n    scanf(\""%d %d %d\"",&p,&q,&r);\n    int a[3]={p,q,r};\n    int i,max;\n    a[max]=a[0];\n    for(i=0;i<3;i++)\n    {\n        if(a[max]<a[i])\n            max=i;\n    }\n    if(max=0) n=q+r;\n    if(max=1) n=q+r;\n    if(max=2) n=p+q;\n    printf(\""%d\"",n);\n    return 0;\n}\n",WRONG_ANSWER,16,476
1591651319122026496,7dd0c628805d8a6777ff5cc70a5ec79db9475f660782b2f4289ae98977303581,2022-11-13 12:37:00,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,p=eval(input())\nq=eval(input())\nr=eval(input())\nprint(str(p+q)),NON_ZERO_EXIT_CODE,24,3012
1591651329339318272,27fbb32d960dbf49665c8905b68012d602eda68987686c6f224ec7b49ca3d0ac,2022-11-13 12:37:03,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint n,i;\n\tscanf(\""%d\"",&n);\n\tint a[7];\n\tfor(i=0;i<7;i++)\n\t{\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n    int sum=a[1]*5;\n\tprintf(\""%d\"",sum);\n\treturn 0;\n} ",WRONG_ANSWER,5,200
1591651342752702464,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-13 12:37:06,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"include <stdio.h>\nint main(){\n    int gd = -5; // 固定减5\n    int count = 0;\n    int num = 0;\n    if(scanf(\""%d\"",&len)){};\n    int[] arr = new int[len];\n    for(int i=0; i<len; i++){\n        arr[i] = sc.nextInt();\n        }\n     for(int j=0; j<len; j++){\n        // 给count赋值 单步最大\n        if(arr[j]+gd > arr[j+3]+gd){\n            count = arr[j]+gd;\n        }else{\n            count = arr[j+3]+gd;\n        }\n        // 总数最大\n        if(count>num){\n            num = count;\n        }\n        print(\""%d\\n\"",num);\n    }\n}",COMPILE_ERROR,0,0
1591651344862470144,105cc8c0a5a465ab713603b461d92ac587c87767965625687540cd513f7ebb57,2022-11-13 12:37:06,C++,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<bits/stdc++.h>\n#define N 10005\n#define endl '\\n'\n#define int long long\n#define ios ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)\n\n//const int dir[4][2]={-1,0,0,1,1,0,0,-1};\n//const int mod=1e9+7;\nusing namespace std;\n\ninline int read() {\n    char c = getchar(); int num = 0, sign = 1;\n    while(c < '0' || c > '9') {if(c == '-') sign = -1; c = getchar();}\n    while(c >= '0' && c <= '9') num = num * 10 + c - '0', c = getchar();\n    return num * sign;\n}\n\nvoid solve(){\n\tint p,q,r;\n\tcin>>p>>q>>r;\n\tint t1=p+q,t2=q+r,t3=r+p;\n\tcout<<min(min(t1,t2),t3);\n\t\n}\n\nsigned main() {\n\tios;\n\tint count=1;\n\t//cin>>count;\n\twhile(count--)\n\t{\n\t\tsolve();\n\t}\n\treturn 0;\n}\n",ACCEPTED,39,640
1591651353670475776,0ed66ddb50163bbc5dd43c591bc3d500e68ed69fe23bfebfa6ac827c1dfc1849,2022-11-13 12:37:08,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nmain()\n{\n    int P,Q,R;\n    int count,i=0;\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    if(P>=1&&P<=1000&&Q>=1&&Q<=1000&&R>=1&&R<=1000)\n    {\n        count=P+Q;\n        if(count>Q+R)\n            count=Q+R;\n        if(count>R+P)\n            count=R+P;\n    } \n    printf(\""%d\\n\"",count);\n}",WRONG_ANSWER,7,324
1591651355474059264,4d1157ac6ad50cfc6ca5d6b3e1c2dd7f1ecc593df10ff6888d4207a4f1c03a35,2022-11-13 12:37:09,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int P,Q,R,sum1,sum2,sum3;\n    cin>>P>>Q>>R;\n    int min=301;\n    sum1=P+Q;\n    if(sum1<min)min=sum1;\n    sum2=P+R;\n    if(sum2<min)min=sum2;\n    sum3=R+Q;\n    if(sum3<min)min=sum3;\n    printf(\""%d\\n\"",min);\n    return 0;\n}",WRONG_ANSWER,9,472
1591651358070300672,2cb092ec618cde3657d677b73f7a0a7bfb1e0da02f466007878113e6c4db4792,2022-11-13 12:37:09,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b,c;\n     int f;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n        f=b+c;\n  printf(\""%d\"",f);\n    return 0;\n}\n",WRONG_ANSWER,7,492
1591651368224710656,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-13 12:37:12,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,b=0,c=0;\n    scanf(\""%d\"",&n);\n    int a[n],i;\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n        if(a[i]==1)\n        {\n            b++;\n        }\n        if(a[i]==0)\n        {\n            c++;\n        }\n       \n    }\n     if((b-c)==0)\n        {\n            printf(\""%d\"",b+c);\n        }\n        if((b-c)!=0)\n        {\n            if(b>c)\n                printf(\""%d\"",2*c);\n            if(b<c)\n                printf(\""%d\"",2*b);\n        }\n}",WRONG_ANSWER,5,372
1591651368665112576,13616e85f216dd3844293b46f4b46105a0a2c458f7807a7b677858feb35cb63a,2022-11-13 12:37:12,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,i,j,sum=0;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if(a[i]!=a[i+1])\n        {\n            for(j=i;j<n;j++)\n            {\n            a[j]=a[j+1];\n            }\n            n=n-2;\n             sum=sum+2;\n            i=0;\n        }\n        if(i==n-2)\n            break;\n    }\n    printf(\""%d\"",sum);\n    printf(\""\\n\"");\n    return 0;\n}",WRONG_ANSWER,165,608
1591651394237784064,cb5ee28f5d61aba010f231fd6045de7f8516849eb1dbf293dc5a73a02c3aea2f,2022-11-13 12:37:18,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int P,Q,R,sum[3],i,min;\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    min=P+Q;\n    sum[0]=P+Q;\n    sum[1]=R+Q;\n    sum[2]=P+R;\n    if(sum[3]<min)\n        printf(\""%d\"",min);\n    else\n        printf(\""%d\"",sum[3]);\n}",WRONG_ANSWER,13,328
1591651399036067840,bce383372e0b1b627f0a9b838121096ec3ca14c0f213828fca1bf517a82c8744,2022-11-13 12:37:19,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int P,Q,R,sum[3],min,i;\n    printf(\""请输入三个整数：\\n\"");\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    min=P+Q;\n    sum[0]=P+Q;\n    sum[1]=P+R;\n    sum[2]=Q+R;\n    for(sum[3]<min)\n        printf(\""%d\"",min);\n}",COMPILE_ERROR,0,0
1591651402492207104,a8a4c649080a65381764d05b09cdced42bbf4a58e2656f96cfc5545fc9d08327,2022-11-13 12:37:20,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{   int P,Q,R,BE;\n    printf(\""请输入三个地点所要的花\\n\"");\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n     printf(\""请输入起始地点\\n\"");\n    scanf(\""%d\"",&BE);\n    int A,B,C,min;\n    if(A==BE)\n    {\n        min=P+Q;\n        printf(\""%d\"",min);\n    }\nelse if(B==BE)\n    {\n        min=Q+R;\n        printf(\""%d\"",min);\n    }\nelse if(C==BE)\n    {\n        min=R+P;\n        printf(\""%d\"",min);\n    }\n    return 0;\n}\n",WRONG_ANSWER,5,200
1591651429415444480,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-13 12:37:26,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"include<stdio.h>\nint main(){\n    int gd = -5; // 固定减5\n    int count = 0;\n    int num = 0;\n    if(scanf(\""%d\"",&len)){};\n    int[] arr = new int[len];\n    for(int i=0; i<len; i++){\n        arr[i] = sc.nextInt();\n        }\n     for(int j=0; j<len; j++){\n        // 给count赋值 单步最大\n        if(arr[j]+gd > arr[j+3]+gd){\n            count = arr[j]+gd;\n        }else{\n            count = arr[j+3]+gd;\n        }\n        // 总数最大\n        if(count>num){\n            num = count;\n        }\n        print(\""%d\\n\"",num);\n        return 0;\n    }\n}",COMPILE_ERROR,0,0
1591651429516062720,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-13 12:37:26,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main(){\n    int n,a[1000],count=0,i,j;\n      scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n        \n        \n    }\n    for( j=1;j<n;j++)\n    {\n        if(a[j]==0&&a[j+1]!=0)\n           \n        count++;\n    }\n    if(count!=0)\n      printf(\""%d\"",count);\n    else \n        printf(\""0\"");\n}",WRONG_ANSWER,10,344
1591651432317870080,e9a50f3e071443bb6fb229966bff355c178d484f6cc10e5e1fc8dc5a537237ba,2022-11-13 12:37:27,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int i,a[3],max,c=0;\n    max=0;\n    for(i=0;i<3;i++)\n     scanf(\""%d\"",&a[i]);\n    for(i=0;i<3;i++)\n    if(max<a[i]) max=a[i];\n    for(i=0;i<3;i++)\n    if(a[i]==max){\n        a[i]=0;\n        break;\n    }\n    for(i=0;i<3;i++)\n    {\n        c=a[i]+c;\n    }\n    printf(\""%d\"",c);\n    return 0;\n}\n",ACCEPTED,47,512
1591651433915932672,ef50cfe7f34b26d29f617c97ac65d40bd15ba1e063897a190284243de955e254,2022-11-13 12:37:27,Java,300.0,1591610585635213316,1591130116607045632,1049226928954454016,public class Main{\n    public static void main(String[] args){\n        System.out.print(60);\n    }\n}\n,ACCEPTED,65,22332
1591651436667363328,5b382280d947e26011a7c75c34d257662bc13c50f8257bc8cae807604d61430c,2022-11-13 12:37:28,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\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\tint p,q,r,a,b,c,min;\n\tscanf(\""%d\"",&p);\n\tscanf(\""%d\"",&q);\n\tscanf(\""%d\"",&r);\n\ta=p+q;\n\tb=p+r;\n\tc=q+r;\n\tif(a>b){\n\t\tmin=b;\n\t\tif(min>c){\n\t\t\tmin=c;\n\t\t}\n\t}\n\telse{\n\t\tmin=a;\n\t\tif(min>c){\n\t\t\tmin=c;\n\t\t}\n\t}\n\tprintf(\""%d\"",c);\n\treturn 0;\n}",WRONG_ANSWER,13,324
1591651439326584832,d5db2853d0fce01dd43b2b6adf379841403b78fda0e6cb22c82f6f2b59da60dc,2022-11-13 12:37:29,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nmain(){\n\tprintf(\""60\"");\n\treturn 0;\n}",ACCEPTED,14,348
1591651439775342592,29d1ea54d6e4e56fc2de0be5ae10ecc4c70c7fca667934b17857e95530f5663a,2022-11-13 12:37:29,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n   int p,q,r,n;\n    scanf(\""%d %d %d\"",&p,&q,&r);\n    int a[3]={p,q,r};\n    int i,max;\n    a[max]=a[0];\n    for(i=0;i<3;i++)\n    {\n        if(a[max]<a[i])\n            max=i;\n    }\n    if(max=0) n=q+r;\n    if(max=1) n=p+r;\n    if(max=2) n=p+q;\n    printf(\""%d\"",n);\n    return 0;\n}\n",WRONG_ANSWER,22,344
1591651446242947072,0ed66ddb50163bbc5dd43c591bc3d500e68ed69fe23bfebfa6ac827c1dfc1849,2022-11-13 12:37:30,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nmain()\n{\n    int P,Q,R;\n    int count,i=0;\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n\n        count=P+Q;\n        if(count>Q+R)\n            count=Q+R;\n        if(count>R+P)\n            count=R+P;\n\n    printf(\""%d\\n\"",count);\n}",ACCEPTED,35,352
1591651490069241856,0ed66ddb50163bbc5dd43c591bc3d500e68ed69fe23bfebfa6ac827c1dfc1849,2022-11-13 12:37:41,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nmain()\n{\n    int count=0,n,i=0;\n    char s[99];\n    scanf(\""%d\"",&n);\n    while(i<n)\n    {\n        scanf(\""%c\"",&s[i]);\n        i++;\n    }\n    i=0;\n    while(n>0)\n    {\n        if(s[i]!=s[i+1])\n        {\n            s[i]=s[i+2];\n            s[i+1]=s[i+3];\n            n=n-2;\n            i=0;\n            count+=2;\n        }\n        else\n            i++;\n        if(i==n)\n            break;\n    }\n    printf(\""%d\"",count);\n}",WRONG_ANSWER,5,324
1591651503805587456,54914c90623988219ee55c4a0b2e645efd9808505aa25f0099930bfa8bf18ad1,2022-11-13 12:37:44,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\n\nint main(){\n\tint p,q,r;\n\tscanf(\""%d%d%d\"",&p,&q,&r);\n\tint a = p+r;\n\tint b = r+q;\n\tint c = q+p;\n\tint min = b;\n\tif(a<=b) {\n\t\tmin =a;\n\t}\n\tif(c<=min){\n\t\tmin =c;\n\t}\n\t\n\tprintf(\""%d\"",c);\n}",WRONG_ANSWER,11,340
1591651515612540928,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-13 12:37:47,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    int P,Q,R;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    printf(\""%d\"",P+Q);\n    \n}",WRONG_ANSWER,13,356
1591651543957647360,e67d0171967fcfdd3835361399616ff4e60e12e62c2ed2fd59506c58aeaae4ad,2022-11-13 12:37:54,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int p,q,r,z;\n    printf(\""请输入一个整数\"")\n    //scanf(\""%d,%d,%d\"",&p,&q,&r);\n    p=3;\n    q=2;\n    r=3;\n    z=p+q+r;\n    printf(\""%d\"",z);\n    \n        \n}",COMPILE_ERROR,0,0
1591651547149524992,887d1bbe53a4d4a349813887f13126da5e46a853687f4c2c9d7b8ef3d748a9d6,2022-11-13 12:37:54,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nmain()\n{\n   int p,q,r,min=0,j=0,k=0;\n   scanf(\""%d%d%d\"",&p,&q,&r);\n   min=p+q;\n   j=p+r;\n   k=q+r;\n   if(j>k)\n   j=k;\n   if(min>j)\n   min=j;\n   printf(\""%d\"",min);\n   \n}",ACCEPTED,32,348
1591651549003395072,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-13 12:37:55,Java,0.0,1591610585635213315,1591129345182261248,1049226928954454016,import java.util.Scanner;\npublic class Main{\n    public static void main(String[] args){\n    Scanner sc = new Scanner(System.in);\n        final int gd = -5; // 固定减5\n        int count = 0;\n        int num = 0;\n        int len = sc.nextInt(); // 长度\n        int[] arr = new int[len];\n            \n        for(int i=0; i<len; i++){\n            arr[i] = sc.nextInt();\n        }\n        \n        for(int j=0; j<len; j++){\n            // 给count赋值 单步最大\n            if(arr[j]+gd > arr[j+3]+gd){\n                count = arr[j]+gd;\n            }else{\n                count = arr[j+3]+gd;\n            }\n            // 总数最大\n            if(count>num){\n                num = count;\n            }\n        }\n        System.out.println(num);\n        sc.close();\n    }\n},WRONG_ANSWER,332,44608
1591651559514333184,7e6a67f270e740aba8788a12d9a49939621a28d5059d3ced2247a86914b0a3b3,2022-11-13 12:37:57,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h> \n\nint main() {\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint a[n],b[n];\n\tint i,j;\n\tint temp,num;\n\tint max;\n\t\n\tfor(i=0;i<n;i++)\n\t\tscanf(\""%d\"",&a[i]);\n    \n\tfor(i=1;i<n;i++)\n\t{\n\t\tfor(j=0;j<n-i;j++)\n\t\tif(a[j]>a[j+1])\n\t\t{\n\t\t\ttemp=a[j];\n\t\t\ta[j]=a[j+1];\n\t\t\ta[j+1]=temp;\n\t\t} \n\t}\n\t\n\tnum=n;\n\tfor(i=0;i<n;i++)\n\t{\n\t\tb[i]=a[i]*num;\n\t\tnum--;\n\t}\n\t\t\n\tmax=b[0];\n\tfor(i=1;i<n;i++)\n\t{\n\t\tif(max<b[i]) max=b[i];\n\t}\n\tprintf(\""%d\"",max);\n}",WRONG_ANSWER,16,196
1591651583887433728,aa65cdf25cbe32699d085a61c4f3ec5a4020e6a3dc1e0e9d6e2a48c9288f8026,2022-11-13 12:38:03,Java,300.0,1591610585635213318,1591131464941563904,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner scan=new Scanner(System.in);\n\t\tint a=scan.nextInt();\n\t\tint b=scan.nextInt();\n\t\tint c=scan.nextInt();\n\t\tint num=0;\n\t\tint num0=a+b;\n\t\tint num1=b+c;\n\t\tif (num0<num1) {\n\t\t\tnum=num0;\n\t\t}else{\n\t\t\tnum=num1;\n\t\t}\n\t\tSystem.out.println(num);\n\n\t}\n\n},ACCEPTED,537,24984
1591651594851344384,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-13 12:38:06,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    int P,Q,R;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    printf(\""%d\\n\"",P+Q);\n    \n}",WRONG_ANSWER,16,484
1591651595396603904,cb5ee28f5d61aba010f231fd6045de7f8516849eb1dbf293dc5a73a02c3aea2f,2022-11-13 12:38:06,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int P,Q,R,sum[3],i,min;\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    min=P+Q;\n    sum[0]=P+Q;\n    sum[1]=R+Q;\n    sum[2]=P+R;\n    if(sum[3]<min)\n        printf(\""%d\"",min);\n    else\n        printf(\""%d\"",sum[3]);\n}",WRONG_ANSWER,23,512
1591651619237015552,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-13 12:38:12,Java,0.0,1591610585635213315,1591129345182261248,1049226928954454016,import java.util.Scanner;\npublic class Main{\n    public static void main(String[] args){\n    Scanner sc = new Scanner(System.in);\n        final int gd = -5; // 固定减5\n        int count = 0;\n        int num = 0;\n        int len = sc.nextInt(); // 长度\n        int[] arr = new int[len];\n            \n        for(int i=0; i<len; i++){\n            arr[i] = sc.nextInt();\n        }\n        \n        for(int j=0; j<len; j++){\n            // 给count赋值 单步最大\n            if(arr[j+1]+gd > arr[j+3]+gd){\n                count = arr[j+1]+gd;\n            }else{\n                count = arr[j+3]+gd;\n            }\n            // 总数最大\n            if(count>num){\n                num = count;\n            }\n        }\n        System.out.println(num);\n        sc.close();\n    }\n},NON_ZERO_EXIT_CODE,314,45464
1591651641475227648,4e8bf5e988ac4275aeb23eae913a385055ab79de14dc27373b9e62a15269d138,2022-11-13 12:38:17,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,b,c;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    int P,Q,R;\n    P=a+b;\n    Q=a+c;\n    R=b+c;\n    if(P/Q+P/R==0){printf(\""%d\"",P);}\n    else if(Q/P+Q/R){printf(\""%d\"",Q);}\n    else{printf(\""%d\"",R);}\n}",WRONG_ANSWER,9,384
1591651669023449088,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-13 12:38:24,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"",&n);\n    \n    int arr[n];\n    for(int i = 0; i < n; +i){\n        scanf(\""%d\"",&arr[i]);\n    }\n    \n    \n    int wed = 1;\n    int i = 0;\n    int j = 0;\n    int mul = 1;\n    int max = 0;\n    for(i = 0; i < n; ++i){\n        for(j = i + 1; j < n; ++j){\n            if(arr[i] <= arr[j]){\n                ++wed;\n            }\n        }\n        mul = wed * arr[i];\n        if(mul > max){\n            max = mul;\n        }\n    }\n    \n    printf(\""%d\"",max);\n    \n    return 0;\n}",TIME_LIMIT_EXCEEDED,400,488
1591651700640067584,29249e539dec3766ca388aaa46121bd2a768da21260d3f436e20eeaac8ee73b3,2022-11-13 12:38:31,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b,c,s;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    s=a+b;\n    printf(\""%d\"",s);\n    return 0;\n}",WRONG_ANSWER,14,488
1591651701487316992,81f258582663b08bc9b4d77bba77afc3b463021ec8fb2262453de07687484cd5,2022-11-13 12:38:31,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"P,Q,R = input().split()\n\n\np = int(P)\nq = int(Q)\nr = int(R)\na =  p + q\nb = p + r\nc =  r +p\nprint(a",NON_ZERO_EXIT_CODE,24,2904
1591651712413478912,0ed66ddb50163bbc5dd43c591bc3d500e68ed69fe23bfebfa6ac827c1dfc1849,2022-11-13 12:38:34,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nmain()\n{\n    printf(\""60\"");\n}",ACCEPTED,6,196
1591651716653932544,5bd1a8718ea7fb820055421c67b8e0a468e08d951f729a24e55bf407b3bdb1f6,2022-11-13 12:38:35,C++,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <iostream>\n#include <string>\nusing namespace std;\n\n\n\n\n\n\nint main()\n{\n    int n,count=0;\n    string s;\n    cin>>n;\n    cin>>s;\n    int i=0;\n    while(!(s.length()==1||((s[0]==s[1])&&s.length()==2)||s.length()==0)||i<s.length()){\n        if(s[i]!=s[i+1]){\n            count+=2;\n            s.erase(i,2);\n            i--;\n        }else{\n            i+=1;\n        }\n \n    }\n\n    cout<<count;\n\n    return 0;\n}\n",RUNTIME_ERROR,8,328
1591651725457809408,5bd1a8718ea7fb820055421c67b8e0a468e08d951f729a24e55bf407b3bdb1f6,2022-11-13 12:38:37,C++,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <iostream>\n#include <string>\nusing namespace std;\n\n\n\n\n\n\nint main()\n{\n    int n,count=0;\n    string s;\n    cin>>n;\n    cin>>s;\n    int i=0;\n    while(!(s.length()==1||((s[0]==s[1])&&s.length()==2)||s.length()==0)||i<s.length()){\n        if(s[i]!=s[i+1]){\n            count+=2;\n            s.erase(i,2);\n            i--;\n        }else{\n            i+=1;\n        }\n \n    }\n\n    cout<<count;\n\n    return 0;\n}\n",RUNTIME_ERROR,9,640
1591651728246988800,81f258582663b08bc9b4d77bba77afc3b463021ec8fb2262453de07687484cd5,2022-11-13 12:38:38,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"P,Q,R = input().split()\n\n\np = int(P)\nq = int(Q)\nr = int(R)\na =  p + q\nb = p + r\nc =  r +p\nprint(a)",WRONG_ANSWER,32,2904
1591651743019315200,9e0ba8d857885aa94eaa182d3a194e51593598b2d7817b16af4b1b57e49e10de,2022-11-13 12:38:41,Java,300.0,1591610585635213318,1591131464941563904,1049226928954454016,\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint a = scanner.nextInt();\n\t\tint b = scanner.nextInt();\n\t\tint c = scanner.nextInt();\n\t\t\n\t\tint max = a;\n\t\tif(max < b) {\n\t\t\tmax = b;\n\t\t}\n\t\t\n\t\tif(max < c) {\n\t\t\tmax = c;\n\t\t}\n\t\t\n\t\tSystem.out.print(a + b + c - max);\n\t}\n},ACCEPTED,525,24864
1591651761797214208,0c2907a154c1c61744366e94f73ae426665222ffae8eff7042dd0fd7bd8760fb,2022-11-13 12:38:46,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{int n,a,i,b;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    int c[n],f[n];\n    for(i=1;i<=n;i++)\n        scanf(\""%d\"",&c[i]);\n     for(i=1;i<=n;i++)\n        scanf(\""%d\"",&f[i]);\n  int s=0,count;\n    for(i=1;i<=n;i++)\n   {\n       count=(c[i]/(f[i]+1)*pow(a,(f[i]+1)))-(c[i]/(f[i]+1)*pow(b,(f[i]+1)));\n    s=s+count;\n    }\n    printf(\""%d\"",s);\n\n\n    return 0;\n}\n",WRONG_ANSWER,10,328
1591651764020195328,27fbb32d960dbf49665c8905b68012d602eda68987686c6f224ec7b49ca3d0ac,2022-11-13 12:38:46,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint n,i;\n\tscanf(\""%d\"",&n);\n\tint a[7];\n\tfor(i=0;i<7;i++)\n\t{\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n    int sum=a[1]*5;\n\tprintf(\""%d\\n\"",sum);\n\treturn 0;\n} ",WRONG_ANSWER,12,196
1591651775047065600,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-13 12:38:49,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"n=int(input())\nlist1 = [int(input())]\nlist1.length = n\nfor i in range(0,n):\n    if list1(i) == list1(i+1):\n        if i+2<=n:\n            list1(i+2) = list1(i)\n            list1(i+3) = list1(i+1)\n        list1.length -=2\nprint(list1.length)\nprint(list1)\n\n",NON_ZERO_EXIT_CODE,23,2908
1591651799285915648,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-13 12:38:55,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int num;\n    scanf(\""%d\"",&num);\n    char str[num];\n    int i,count = 0;\n    for(i = 0;i < num;i++) {\n        scanf(\""%c\"",&str[i]);\n    }\n    for(i = 0;i <= num;i++) {\n        if(str[i] != str[i+1]) {\n            count += 2;\n            i = 0;\n            num -=2;\n        }\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",WRONG_ANSWER,13,372
1591651809461297152,c47b15e117166a3dd00078b9f795673d5284a2761e582479119229751cc734d3,2022-11-13 12:38:57,C++,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\n\n\nint main()\n{\n    int p,q,r;\n    int x,y,z,m;\n    scanf(\""%d %d %d\"",&p,&q,&r);\n    x=q+p;\n    y=q+r;\n    z=r+p;\n    if(x<y)\n        m=x;\n    else m=y;\n\n    if(m<z)\n        printf(\""%d\"",m);\n    else printf(\""%d\"",z);\n\n    return 0;\n}\n",ACCEPTED,47,368
1591651825194119168,55950e2d4c314feed0856fa0f6b80f22c5c36f2ebe0d75c8ee2cadb1a06b2fe1,2022-11-13 12:39:01,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main(){\n\n\n\n    int a,i,b[100],c;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++){\n        scanf(\""%d\"",&b[i]);\n\n\n\n\n    }\n    c=b[2]*b[4];\n    printf(\""%d\"",c);\n\n\n\n\n\n\n\n    return 0;\n}\n",WRONG_ANSWER,5,376
1591651871021096960,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-13 12:39:12,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    printf(\""从A到B花费3块钱，从B到C花费2块钱，此时所有地点都去过了，总花费为5块钱。\"")\n}",COMPILE_ERROR,0,0
1591651895159349248,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-13 12:39:17,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    int P,Q,R;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    printf(\""%d\"",P+Q);\n    printf(\""\\n\"");\n    \n}",WRONG_ANSWER,17,200
1591651912959930368,81f258582663b08bc9b4d77bba77afc3b463021ec8fb2262453de07687484cd5,2022-11-13 12:39:22,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"P,Q,R = input().split()\n\n\np = int(P)\nq = int(Q)\nr = int(R)\na =  p + q\nb = p + r\nc =  r +p\n\n#f= eval(a)\n#h= eval(b)\n#g= eval(c)\nd = min(a,b,c)\n\nprint(d)",WRONG_ANSWER,34,2896
1591651930970271744,157388d8d83262bba5955406e39bb36c3baacd3a224f63ce1739541bb582af20,2022-11-13 12:39:26,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i=0;\n    char s;\n    scanf(\""%d\"",&n);\n    for(s=1;s<=n;s++)\n    {\n        if(s='0')\n            i++;\n        if(s='1')\n            i++;\n    }\n    printf(\""%d\"",i+i);\n}",WRONG_ANSWER,12,192
1591651983659118592,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-13 12:39:39,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main ()\n{\n    int n,m,i;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n-2;i++)\n    {\n        if(a[i+1]<a[i]&&a[i+1]<=a[i+2])\n            m++;\n    }\n    printf(\""%d\"",m);\n    return 0;\n}",WRONG_ANSWER,4,320
1591651999186432000,9aa17e95021225dcdd2b01419b021cd002e47f9a7854274df042f64621bd207a,2022-11-13 12:39:42,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,j,i,k;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0,j=0;i<n;i++)\n    {\n        for(k=i;k<n;k++)\n        if(a[i]+a[i+1]==1)\n        j++;\n\n    }\n    printf(\""%d\"",j);\n    return 0;\n}\n",WRONG_ANSWER,12,332
1591652008929800192,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-13 12:39:45,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int i,a[10],sum=0,max,x;\n    scanf(\""%d\"",&i);\n    for(x=0;x<i;x++)\n        scanf(\""%d\"",&a[x]);\n    max=a[0];\n    for(x=0;x<i;x+=3)\n    {\n        sum-=5;\n        sum+=a[x+3];\n        if(sum>max) max=sum;\n    }\n    printf(\""%d\"",max);\n}",SEGMENTATION_FAULT,6,188
1591652022448054272,55950e2d4c314feed0856fa0f6b80f22c5c36f2ebe0d75c8ee2cadb1a06b2fe1,2022-11-13 12:39:48,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main(){\n\n\n\n    int a,i,b[100],c;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++){\n        scanf(\""%d\"",&b[i]);\n\n\n\n\n    }\n    c=b[2]*b[4];\n    printf(\""%d\\n\"",c);\n\n\n\n\n\n\n\n    return 0;\n}\n",WRONG_ANSWER,7,348
1591652028194238464,bce383372e0b1b627f0a9b838121096ec3ca14c0f213828fca1bf517a82c8744,2022-11-13 12:39:49,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int P,Q,R,sum[3],min,i;\n    printf(\""请输入三个整数：\\n\"");\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    min=P+Q;\n    sum[0]=P+Q;\n    sum[1]=P+R;\n    sum[2]=Q+R;\n    for(i=0;i<=2;i++)\n    {\n        if(min<sum[i]);\n            printf(\""%d\"",min);\n        if(min>sum[i])\n        {\n            min=sum[i];\n            printf(\""%d\"",min);\n        }\n    }\n}",WRONG_ANSWER,5,196
1591652062931464192,8f29029dc8006da83949d2656cc7dc83026d851252066fd4a9fc89071673ec96,2022-11-13 12:39:57,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int p=0,q=0,r=0,t=0,s=0;\n    scanf(\""%d %d %d\"",&p,&q,&r);\n    t=(p+q)>(p+r)?(p+r):(p+q);\n    s=t>(q+r)?(q+r):t;\n    printf(\""%d\"",s);\n    return 0;\n}\n",ACCEPTED,35,512
1591652095718338560,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 12:40:05,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int p,q,r;\n    int sum;\n    scanf(\""%d %d %d\"",&p,&q,&r);\n    if((p>=q) && (p>=r))\n       {\n               sum=q+r;\n       }\n       if((q>=p) && (q>=r))\n       {\n           sum=p+r;\n       }\n    if((r>=q) && (r>=p))\n    {\n        sum=q+p;\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",ACCEPTED,30,332
1591652109375004672,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-13 12:40:08,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main ()\n{\n    int n,m=0,i;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n-2;i++)\n    {\n        if(a[i+1]<a[i]&&a[i+1]<=a[i+2])\n            m++;\n    }\n    printf(\""%d\"",m);\n    return 0;\n}",ACCEPTED,35,352
1591652115746140160,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 12:40:10,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int p,q,r,sum;\n    scanf(\""%d %d %d\"",&p,&q,&r);\n    if(p<=q&&p<r&&r<q)\n        sum=p+r;\n    else if(q<=p&&q<r&&p<r)\n        sum=p+q;\n    else if(r<=p&&r<q&&p<q)\n        sum=r+p;\n    else if(p<=q&&p<r&&q<r)\n        sum=p+q;\n    else if(q<=p&&q<r&&r<p)\n        sum=q+r;\n    else if(r<=p&&r<q&&q<p)\n        sum=r+q;\n    else\n        sum=p+q;\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,55,480
1591652119223218176,b80fc2aed0abde15bdaa9327874c9784da696b6ed442d90001602ff2a017be15,2022-11-13 12:40:11,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h> \n#include<math.h> \nint main()\n{\n     int n,i,sum=0;\n\t int a[10000];\n\t scanf(\""%d\"",&n);\n\t for(i=0;i<n;i++)\n\t  scanf(\""%d\"",&a[i]);\n     for(i=0;i<n-1;i++)\n\t  if((a[i]-a[i+1])>0)\n\t    sum=sum+1;\n   sum=sum-1; \n\tprintf(\""%d\"",sum);\t  \n\t  return 0; \n}",WRONG_ANSWER,5,384
1591652134041694208,e715137eeb4190ade2330123b989bbdd6eebd9a5e1df2e292271d3bfe3a79c69,2022-11-13 12:40:14,C,300.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nchar a[100000];\nint main()\n{\n    int i,j=0,k=0,n;\n    scanf(\""%d\"",&n);\n    getchar();\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%c\"",&a[i]);\n      \n    }\n    for(i=0;i<n;i++)\n    {\n          if(a[i]=='0')\n            j++;\n        else\n            k++;\n    }\n    \n    printf(\""%d\\n\"",j>k?k*2:j*2);\n    return 0;\n\n}",ACCEPTED,31,480
1591652137741115392,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-13 12:40:15,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"eval(input())\n1<=P,Q,R<=1000\na=P+Q\nb=Q+R\nc=R+P\nif a<b and a<c\nprint(a)\nelseif b<a and b<c\nprint(b)\nelseif c<a and c<b\nprint(c)",NON_ZERO_EXIT_CODE,15,2764
1591652146662400000,c9a8fe962a36cf99ca362f66348b02453584251c62fe2356e11d2a6efd5cee45,2022-11-13 12:40:17,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R;\n    int A,B,C;\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    A=P+Q;\n    B=P+R;\n    C=Q+R;\n    if(A<=B&&A<=C){\n        printf(\""%d\\n\"",A);\n    }\n    if(B<=A&&B<=C){\n        printf(\""%d\\n\"",B);\n    }\n    if(C<=A&&C<=B){\n        printf(\""%d\\n\"",C);\n    }\n    return 0;\n}\n",ACCEPTED,42,328
1591652158251261952,e7f8e9ba366feb4551b7dc8e6a149f796e822980a43de4fcc91ded552c4bcbd4,2022-11-13 12:40:20,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main(int argc, char *argv[]) {\n\tint P,Q,R,F=0; \n\tscanf(\""%d%d%d\"",&P,&Q,&R);\n\tF=P+Q;\n\tprintf(\""%d\\n\"",F);\n\tprintf(\""从A到B花费%d块钱，从B到C花费%d块钱，此时所有地点都去过了，总花费%d块钱。\"",P,Q,F);\n\treturn 0;\n\t\n}",WRONG_ANSWER,6,224
1591652166702751744,00d0a1b2e987c17fb50850b9ec54bf6b4f8b997eb053d1a9fed6c4888fbe74ed,2022-11-13 12:40:22,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int i,n,a[n],x=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=1;i<n-1;i++)\n    {\n        if(a[i]<a[i-1]&&a[i]<=a[i+1])\n            x=x+1;\n    }\n    printf(\""%d\"",x);\n    return 0;\n}",ACCEPTED,44,504
1591652177637289984,05fd79145678de5c06012db9db4333bebf8365a74fe442d12a54a9da3782fdca,2022-11-13 12:40:25,C++,0.0,1591610585635213312,1589816514637750272,1049226928954454016,#include<iostream>\n#define N 1000005 \nusing namespace std;\nint main(){\n\tchar ball[N];\n\tlong long int n;\n\tlong long int nums = 0;\n\tlong long int fins = 0;\n\tlong long int eins = 1;\n\tcin >> n;\n\tfor(int i = 0;i<n;i++) cin >> ball[i];\n\twhile(eins < n ){ \n\t\t\n\t\tif(ball[fins] == ball[eins]) eins++;\n\t\telse {\n\t\t\tball[fins] = '2';\n\t\t\tball[eins] = '2';\n\t\t\tnums+=2;\n\t\t\tfor(int i = fins;i<=eins+1;i++){\n\t\t\t\tif(ball[i] != '2'){\n\t\t\t\t\tfins = i;\t\n\t\t\t\t}\n\t\t\t}\n\t\t\teins++;\n\t\t\tif(eins == fins){\n\t\t\t\teins++;\n\t\t\t}\n\t\t}\n\t}\n\t\n\tcout<<nums;\n\t\n} ,WRONG_ANSWER,6,484
1591652197186953216,345826d11b41befc23adeb536e81da8eb6ec9a8bfb9448acf91422deedb8ba4a,2022-11-13 12:40:29,C++,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n main()\n{\n    int i,n,count=0,j;\n    scanf(\""%d\"",&n);\n    char s[n];\n    for(i=0;i<n;)\n       {\n           s[i]=getchar();\n           if(s[i]=='0'||s[i]=='1')\n            i++;\n       }\n       \n    for(i=0;i<n;)\n    {\n        if(s[i]==s[i+1])\n            {\n               for(j=i;j<=n;j++)\n                    s[j]=s[j+2];\n                i=0;\n                count+=2;\n            }\n            else\n                i=i+1;\n    }\n    printf(\""%d\"",count);\n}\n",WRONG_ANSWER,14,200
1591652218863104000,0354b067c4132d4425a90b77482ac717447702274cb7db1282edce56eaf037b3,2022-11-13 12:40:35,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main(){\n\tint a[3],max,sum;\n\tint i;\n    for(i=0;i<3;i++)\n       scanf(\""%d\"",&a[i]);\n    max=sum=0;\n    for(i=0;i<3;i++){\n    \tif(a[i]>a[max]||i==0)\n    \t   max=i;\n\t}\n\tfor(i=0;i<3;i++){\n\t\tif(i!=max)\n\t\t  sum=sum+a[i];\n\t}\n\tprintf(\""%d\"",sum);\n\treturn 0;\n} ",ACCEPTED,36,512
1591652232700112896,20033d4bfe54ea16777c218f33d3af83aed121eb1b058daa8e84687ea80be80b,2022-11-13 12:40:38,Python,300.0,1591610585635213318,1591131464941563904,1049226928954454016,list=input().split()\na=int(list[0])+int(list[1])\nb=int(list[1])+int(list[2])\nc=int(list[2])+int(list[0])\nnum=0\nif a<b:\n    num=a\n    if c<num:\n        num=c\n    else:\n        num=a\nelse:\n    num=b\n    if c<num:\n        num=c\n    else:\n        num=b\nprint(num),ACCEPTED,90,3072
1591652252845400064,1773d9c971942817d949c47973c4eb8c24531f728d5480dbf3b232e568926258,2022-11-13 12:40:43,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"public class MAIN {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int P = sc.nextInt();\n        int Q = sc.nextInt();\n        int R = sc.nextInt();\n        int[] arr = {P,Q,R};\n        int min = 0;\n        for (int i = 0; i < arr.length - 1; i++) {\n            if (arr[i] < arr[i + 1]) {\n                min = arr[i] + arr[i+1];\n            }\n        }\n        System.out.println(min);\n    }\n}\n",NON_ZERO_EXIT_CODE,22,2760
1591652258004348928,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-13 12:40:44,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n\n\n//O(N)\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"",&n);\n    \n    int arr[n];\n    for(int i = 0; i < n; +i){\n        scanf(\""%d\"",&arr[i]);\n    }\n    \n    \n    int wed = 1;\n    int i = 0;\n    int j = 0;\n    int mul = 1;\n    int max = 0;\n    for(i = 0; i < n - 1; ++i){\n        for(j = i + 1; j < n; ++j){\n            if(arr[i] <= arr[j]){\n                ++wed;\n            }\n        }\n        mul = wed * arr[i];\n        if(mul > max){\n            max = mul;\n        }\n    }\n    \n    printf(\""%d\"",max);\n    \n    return 0;\n}\n\n\n/*\nint main(){\n    int n = 0;\n    scanf(\""%d\"",&n);\n    \n    int arr[n];\n    for(int i = 0; i < n; +i){\n        scanf(\""%d\"",&arr[i]);\n    }\n    \n    \n    \n    \n    return 0;\n}\n*/\n",TIME_LIMIT_EXCEEDED,400,448
1591652272810254336,5b382280d947e26011a7c75c34d257662bc13c50f8257bc8cae807604d61430c,2022-11-13 12:40:47,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\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\tint p,q,r,a,b,c,min;\n\tscanf(\""%d\"",&p);\n\tscanf(\""%d\"",&q);\n\tscanf(\""%d\"",&r);\n\ta=p+q;\n\tb=p+r;\n\tc=q+r;\n\tif(a>b){\n\t\tmin=b;\n\t\tif(min>c){\n\t\t\tmin=c;\n\t\t}\n\t\telse{\n\t\t\tmin=b;\n\t\t}\n\t}\n\telse{\n\t\tmin=a;\n\t\tif(min>c){\n\t\t\tmin=c;\n\t\t}\n\t\t\n\t}\n\tprintf(\""%d\"",min);\n\treturn 0;\n}",ACCEPTED,36,376
1591652276476076032,05fd79145678de5c06012db9db4333bebf8365a74fe442d12a54a9da3782fdca,2022-11-13 12:40:48,C++,300.0,1591610585635213312,1589816514637750272,1049226928954454016,#include<iostream>\n#define N 1000005 \nusing namespace std;\nint main(){\n\tchar ball[N];\n\tlong long int n;\n\tlong long int nums = 0;\n\tlong long int fins = 0;\n\tlong long int eins = 1;\n\tcin >> n;\n\tfor(int i = 0;i<n;i++) cin >> ball[i];\n\twhile(eins < n ){ \n\t\t\n\t\tif(ball[fins] == ball[eins]) eins++;\n\t\telse {\n\t\t\tball[fins] = '2';\n\t\t\tball[eins] = '2';\n\t\t\tnums+=2;\n\t\t\tfor(int i = fins;i<=eins+1;i++){\n\t\t\t\tif(ball[i] != '2'){\n\t\t\t\t\tfins = i;\n                    break;\n\t\t\t\t}\n\t\t\t}\n\t\t\teins++;\n\t\t\tif(eins == fins){\n\t\t\t\teins++;\n\t\t\t}\n\t\t}\n\t}\n\t\n\tcout<<nums;\n\t\n} ,ACCEPTED,48,640
1591652288941547520,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-13 12:40:51,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nint main(){\n    printf(\""60\"");\n    return 0;\n}",ACCEPTED,12,380
1591652321837506560,b31601c92a4a3080abbaad650e00bb77253224eab66b59a49b2118d017649c2c,2022-11-13 12:40:59,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b,c,d,e,f;\n    scanf(\""%d%d%d\"",&a,&b,&c);\n        d = b+c;\n        e = a+b;\n        f = a+c;\n        if(d>=e){\n            if(e>=f){\n                printf(\""%d\"",&f);\n            }\n            else{\n                printf(\""%d\"",&e);\n            }\n        }\n        else{\n            printf(\""%d\"",&d);\n        }\n    return 0;\n}\n",WRONG_ANSWER,6,192
1591652334718214144,e7f8e9ba366feb4551b7dc8e6a149f796e822980a43de4fcc91ded552c4bcbd4,2022-11-13 12:41:02,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main(int argc, char *argv[]) {\n\tint P,Q,R,F=0; \n\tscanf(\""%d%d%d\"",&P,&Q,&R);\n\tF=P+Q;\n\tprintf(\""%d\\n\"",F);\n\treturn 0;\n\t\n}",WRONG_ANSWER,10,348
1591652352674029568,abe2744e33bb397ffb9bb13afcb202f611378fb4fc5801202f03933298ce5f5d,2022-11-13 12:41:07,Java,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\npublic static void main(String[] args) throws IOException{\n\tBufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n\tint n = Integer.valueOf(reader.readLine());\n\tString[] string = reader.readLine().split(\"" \"");\n\tint[] ints=new int[n];\n\tfor(int i=0;i<n;i++){\n\t\tints[i]=Integer.valueOf(string[i]);\n\t}\n\tint flag=0;\n\tint count=0;\n\tfor(int i=0;i<n-1;i++){\n\t\tif(ints[i]>ints[i+1]){\n          flag=1;\n          }\n\t\tif(ints[i]<ints[i+1]&&flag==1){\n\t\t\tcount++;\n\t\t\tflag=0;\n\t\t}\n\t}\n\tSystem.out.println(count);\n}\n}\n",ACCEPTED,355,22548
1591652366884286464,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 12:41:10,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"P,Q,R=map(int,input().split())\nnum1=P*Q\nnum2=P*R\nnum3=Q*R\nif num1<num2 and num1<num3:\n    print(num1)\n    if num2<num1 and num2<num3:\n        print(num2)\n        if num3<num2 and num3<num1:\n            print(num3)",WRONG_ANSWER,19,2756
1591652407032209408,bce383372e0b1b627f0a9b838121096ec3ca14c0f213828fca1bf517a82c8744,2022-11-13 12:41:19,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int P,Q,R,sum[3],min,i;\n    printf(\""请输入三个整数：\\n\"");\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    min=P+Q;\n    sum[0]=P+Q;\n    sum[1]=P+R;\n    sum[2]=Q+R;\n    for(i=0;i<=2;i++)\n    {\n        if(min>=sum[i])\n        {\n            min=sum[i];\n            printf(\""%d\"",min);\n        }\n        else\n            printf(\""%d\"",min);\n    }\n}",WRONG_ANSWER,9,196
1591652410064658432,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 12:41:20,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"P,Q,R=map(int,input().split())\nnum1=P*Q\nnum2=P*R\nnum3=Q*R\nif num1<num2 and num1<num3:\n    print(num1)\n    if num2<num1 and num2<num3:\n        print(num2)\n        if num3<num2 and num3<num1:\n            print(num3)",WRONG_ANSWER,21,2904
1591652425357123584,e67d0171967fcfdd3835361399616ff4e60e12e62c2ed2fd59506c58aeaae4ad,2022-11-13 12:41:24,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int p,q,r,z;\n    scanf(\""%d,%d,%d\"",&p,&q,&r);\n   if((p>=1)&&(p<=1000)&&(q>=1)&&(q<=1000)&&(r>=1)&&(r<=1000))\n    z=p+q+r;\n    printf(\""%d\"",z);\n    \n        \n}",WRONG_ANSWER,7,204
1591652428750282752,81f258582663b08bc9b4d77bba77afc3b463021ec8fb2262453de07687484cd5,2022-11-13 12:41:25,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"P,Q,R = input().split()\n\n\np = int(P)\nq = int(Q)\nr = int(R)\n\n \n\na =  p + q\nb = p + r\nc =  r +p\n\n#f= eval(a)\n#h= eval(b)\n#g= eval(c)\nd = min(a,b,c)\nif p,q,r >=1 and p ,q,r <=10**3\n  print(d)",NON_ZERO_EXIT_CODE,16,2760
1591652433783480320,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-13 12:41:26,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R,a;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    if(P+Q<P+R&&Q+R<P+R){\n    printf(\""%d\"",P+Q);}\n    return 0;\n}\n",WRONG_ANSWER,7,328
1591652455686090752,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 12:41:31,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int p,q,r,sum;\n    scanf(\""%d %d %d\"",&p,&q,&r);\n    if(p<=q&&p<r&&r<=q)\n        sum=p+r;\n    else if(q<=p&&q<r&&p<=r)\n        sum=p+q;\n    else if(r<=p&&r<q&&p<=q)\n        sum=r+p;\n    else if(p<=q&&p<r&&q<=r)\n        sum=p+q;\n    else if(q<=p&&q<r&&r<=p)\n        sum=q+r;\n    else if(r<=p&&r<q&&q<=p)\n        sum=r+q;\n    else\n        sum=p+q;\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,36,640
1591652466696138752,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 12:41:34,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"P,Q,R=map(real,input().split())\nnum1=P*Q\nnum2=P*R\nnum3=Q*R\nif num1<num2 and num1<num3:\n    print(num1)\n    if num2<num1 and num2<num3:\n        print(num2)\n        if num3<num2 and num3<num1:\n            print(num3)",NON_ZERO_EXIT_CODE,18,2924
1591652473860022272,81f258582663b08bc9b4d77bba77afc3b463021ec8fb2262453de07687484cd5,2022-11-13 12:41:35,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"P,Q,R = input().split()\n\n\np = int(P)\nq = int(Q)\nr = int(R)\n\n \n\na =  p + q\nb = p + r\nc =  r +p\n\n#f= eval(a)\n#h= eval(b)\n#g= eval(c)\nd = min(a,b,c)\nif p,q,r >=1 and p ,q,r <=10**3:\n  print(d)",NON_ZERO_EXIT_CODE,16,2896
1591652488674336768,7ecf54bf0ea2db8ab0397aa941f19ec79a351bc3e86e8c01673aa09a69b3a6db,2022-11-13 12:41:39,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n\tint a,b,c,m1,m2;\n\tscanf(\""%d %d %d\"",&a,&b,&c);\n\tm1 = a<b?a:b;\n\tif(c>m1)\n\t{\n\t\tm2 = a<b?b:a;\n\t}\n\telse\n\t{\n\t\tm2 = c;\n\t}\n\tprintf(\""%d\\n\"",m1+m2);\n}",WRONG_ANSWER,15,512
1591652512267264000,06b00897262b024d9e66dcd771cf81de9b63954f7a4554699d17c2158114c0d1,2022-11-13 12:41:45,Java,0.0,1591610585639407616,1591132307937943552,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner scan=new Scanner(System.in);\n\t\tint n=scan.nextInt();\n\t\tint arr[]=new int[n];\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tarr[i]=scan.nextInt();\n\t\t}\n\t\tfor(int i=1;i<n;i++) {\n\t\t\tif(arr[i]==arr[i-1]) {\n\t\t\t\tfor(int j=i;j<n;j++) {\n\t\t\t\t\tarr[j]=arr[j+1];\n\t\t\t\t\tarr[n-1]=0;\n\t\t\t\t\tn=n-1;\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint x=0;\n\t\tfor(int j=1;j<n-1;j++){\n\t\t\t\n\t\t\tif(arr[j]<arr[j-1]&&arr[j]<arr[j+1]) {\n\t\t\tx++;\t\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(x);\n\t\tscan.close();\n\t}\n\n},WRONG_ANSWER,446,25188
1591652516683853824,4d1157ac6ad50cfc6ca5d6b3e1c2dd7f1ecc593df10ff6888d4207a4f1c03a35,2022-11-13 12:41:46,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int P,Q,R,sum1,sum2,sum3;\n    cin>>P>>Q>>R;\n    int min=3001;\n    sum1=P+Q;\n    if(sum1<min)min=sum1;\n    sum2=P+R;\n    if(sum2<min)min=sum2;\n    sum3=R+Q;\n    if(sum3<min)min=sum3;\n    printf(\""%d\\n\"",min);\n    return 0;\n}",WRONG_ANSWER,6,596
1591652525038907392,7c6d208c4c4b695bc8d6f8ae0c0357c2466f5c9f86ec0652674812219ac09d38,2022-11-13 12:41:48,Java,0.0,1591610585635213318,1591131464941563904,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\n\t\tint a  = sc.nextInt();\n\t\tint b  = sc.nextInt();\n\t\tint c  = sc.nextInt();\n\t\tint max = 0;\n\t\tif (a>b) {\n\t\t\tmax = a;\n\t\t}else {\n\t\t\tmax = b;\n\t\t}\n\t\tif (max>c) {\n\t\t\tmax = c;\n\t\t}\n\t\tSystem.out.println(a+b+c-max);\n\t\t\n\n\t}\n\n}\n,WRONG_ANSWER,107,24780
1591652544840261632,f74f1cf8202c7b7d33a121c730f9d3964272c7cefa9076e57c0a15d1d098cce0,2022-11-13 12:41:52,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R;\n    int s1,s2,s3;\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    s1=P+Q;\n    s2=Q+R;\n    s3=P+R;\n    if(s1>s2){\n        if(s2>s3){\n            printf(\""%d\"",s3);\n        }\n        else{\n            printf(\""%d\"",s2);\n        }\n    }\n    else{\n        printf(\""%d\"",s1);\n    }\n\n\n    printf(\""\\n\"");\n    return 0;\n}\n",ACCEPTED,29,496
1591652566927421440,ccc42b8437aa15d1214e4623799ed35cd8ea8087c26cb1b596d51ae4556ea39c,2022-11-13 12:41:58,Python,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"a=eval(input())\nb=input().split()\nsum=0\nfor i in range(1,a-1):\n    if int(b[i])<int(b[i-1]) and int(b[i])<int(b[i+1]):\n        sum+=1\n    elif int(b[i])<int(b[i-1]) and int(b[i])==int(b[i+1]):\n        sum+=1\nprint(sum)\n\n",ACCEPTED,95,3028
1591652582731558912,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-13 12:42:01,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,b=0,c=0;\n    scanf(\""%d\"",&n);\n    int a[n],i;\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n        if(a[i]==1)\n        {\n            b++;\n        }\n        if(a[i]==0)\n        {\n            c++;\n        }\n       \n    }\n     if((b-c)==0)\n        {\n            printf(\""%d\"",b+c);\n        }\n        if((b-c)!=0)\n        {\n            if(b>c)\n                printf(\""%d\"",2*c);\n            if(b<c)\n                printf(\""%d\"",2*b);\n        }\n}",WRONG_ANSWER,7,348
1591652590675570688,af559dccfa68c49b94a61e83fc9942ea0513a50e66ecf36dc005df0e7960903e,2022-11-13 12:42:03,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n;\n    int num=0;\n        scanf(\""%d\"",&n);\n    char s[n];\n    for(int j=0;j<n;j++){\n        scanf(\""%c\"",&s[j]);\n        if(s[j]=='0')++num;\n    }\n    if(num>n-num){\n        printf(\""%d\\n\"",2*(n-num));\n    }\n    else{\n        printf(\""%d\\n\"",2*num);\n    }\n    return 0;\n}",WRONG_ANSWER,9,376
1591652614994190336,7e6a67f270e740aba8788a12d9a49939621a28d5059d3ced2247a86914b0a3b3,2022-11-13 12:42:09,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h> \n\nint main()\n{\n    int a=60;\n    printf(\""%d\"",a);\n}",ACCEPTED,5,200
1591652626398457856,f1a9b482617577a636e4a09531695721778faca66954fa117a72ad0fab52cd55,2022-11-13 12:42:12,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R;\n    int s1,s2,s3;\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    s1=P+Q;\n    s2=Q+R;\n    s3=P+R;\n    if(s1>s2){\n        if(s2>s3){\n            printf(\""%d\"",P+R);\n        }\n        else{\n            printf(\""%d\"",Q+R);\n        }\n    }\n    else{\n        printf(\""%d\"",s1);\n    }\n    printf(\""/n\"");\n    return 0;\n}\n",WRONG_ANSWER,7,196
1591652655016206336,d54b7e24c90cf40d468bdeb018e61440010a1049a4ae96e2c6331c215521f91c,2022-11-13 12:42:19,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"int main()\n{\n\tint n,s,i,j,count=0;\n\tchar ball[n];\n\t\n\tscanf(\""%d\"",&n);\n\tscanf(\""%s\"",&ball);\n\tfor(i=0;i<n-count;i++)\n\t{\n\t\tif(ball[i]==ball[i+1])\n\t\t{\n\t\t\tcount += 2;\n\t\t\tfor(j=0;j<n-count;j++)\n\t\t\t{\n\t\t\t\tball[j]=ball[j+2];\n\t\t\t}\n\t\t}\n\t\ti=0;\n\t}\n\t\n\tprintf(\""%d\"",count);\n\t\n\t\n\t\n\t\n } ",TIME_LIMIT_EXCEEDED,400,196
1591652655691522048,64f8dab58af431d48e3c413e8710a37cc2c583e883c731d70cd5a4e026299255,2022-11-13 12:42:19,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nint main(){\n    printf(\""60/n\"");\n    return 0;\n}",WRONG_ANSWER,5,352
1591652668882563072,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-11-13 12:42:22,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int n,i,h[i],count=0;\n    scanf(\""%d\"",&n);\n    printf(\""\\n\"");\n    scanf(\""%d\"",&h[i]);\n   for(i=2;i<=10;i++)\n   {\n       if(h[i-1]>=h[i]&&h[i]<=h[i+1])\n        {\n            count=count+1;\n        }\n   }\n    printf(\""%d\"",count);\n    return 0;\n}\n",WRONG_ANSWER,5,200
1591652692542631936,e67d0171967fcfdd3835361399616ff4e60e12e62c2ed2fd59506c58aeaae4ad,2022-11-13 12:42:28,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int p,q,r,z;\n    scanf(\""%d,%d,%d\"",&p,&q,&r);\n   if((p>=1)&&(p<=1000)&&(q>=1)&&(q<=1000)&&(r>=1)&&(r<=1000))\n   {\n      z=p+q+r;\n    printf(\""%d\"",z);\n   }\n        \n}",WRONG_ANSWER,6,452
1591652692945285120,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-13 12:42:28,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main()\n{\n    int n,b=0,c=0;\n    scanf(\""%d\"",&n);\n    int a[n],i;\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n        if(a[i]==1)\n        {\n            b++;\n        }\n        if(a[i]==0)\n        {\n            c++;\n        }\n       \n    }\n     if((b-c)==0)\n        {\n            printf(\""%d\"",b+c);\n        }\n        if((b-c)!=0)\n        {\n            if(b>c)\n                printf(\""%d\"",2*c);\n            if(b<c)\n                printf(\""%d\"",2*b);\n        }\n}",WRONG_ANSWER,4,328
1591652696816672768,a5291eb67188c2a916aa5dd9fc38f2e449aa9f9a3cd047f282d8c154ea2979cd,2022-11-13 12:42:29,C++,300.0,1591610585635213312,1589816514637750272,1049226928954454016,#include <iostream>\nusing namespace std;\n\nconst int N = 100010;\n\nchar ch[N];\nint top = 0;\nint cnt = 0;\nint main()\n{\n\tint n = 0;\n\tcin >> n;\n\tfor(int i = 0;i < n;i++)\n\t{\n\t\tcin >> ch[top];\n\t\tif(ch[top] != ch[top-1] && top >= 1)\n\t\t{\n\t\t\ttop--;\n\t\t\tcnt += 2;\n\t\t}\n\t\ttop++;\n\t}\n\t\n\tcout << cnt << endl;\n\t\n\n\n\treturn 0;\n} ,ACCEPTED,53,720
1591652704391540736,7ecf54bf0ea2db8ab0397aa941f19ec79a351bc3e86e8c01673aa09a69b3a6db,2022-11-13 12:42:30,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n\tint a,b,c,m1,m2;\n\tscanf(\""%d %d %d\"",&a,&b,&c);\n\tm1 = a<b?a:b;\n\tif(c>=m1)\n\t{\n\t\tm2 = a<=b?b:a;\n\t}\n\telse\n\t{\n\t\tm2 = c;\n\t}\n\tprintf(\""%d\\n\"",m1+m2);\n}",WRONG_ANSWER,19,512
1591652708648759296,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-13 12:42:31,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    int P,Q,R;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    printf(\""%d\"",P+Q);\n    printf(\""从A到B花费%d块钱，从B到C花费%d块钱，此时所有地点都去过了，总花费%d块钱\"",P,Q,P+Q);\n    \n}",WRONG_ANSWER,10,348
1591652711622565888,b8a7ba8e6c41741e66a8153e5f137c86c8dba9c4dbb2f65f35d7554a5b082d56,2022-11-13 12:42:32,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int a,b,n,s,z,sum=0,e,m,l,r,jum=0,h;\n    scanf(\""%d %d %d\\n\"",&n,&a,&b);\n    for(int i=0;i<n;i++)\n    {\n        scanf(\""%d\\n\"",&s);\n    }\n     for(int j=0;j<n;j++)\n    {\n        scanf(\""%d\\n\"",&z);\n    }\n    e=pow(a,z+1);\n      m=s*e/(z+1);\n    sum=sum+m;\n    l=pow(b,z+1);\n      r=s*l/(z+1);\n    jum=jum+r;\n    h=sum-jum;\n    printf(\""%d\"",h);\n    return 0;\n}",WRONG_ANSWER,8,336
1591652724608098304,24daa7a58808ceb95b2ed2e23721ea7b987a061e19ca5fee0ee2d0f93c78507f,2022-11-13 12:42:35,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int r,p,q,i;\n    scanf(\""%d%d%d\"",r,p,q);\n    i=r;\n    if(i>q){\n        i=q;\n    }\n    if(i>p){\n        i=p;\n    }\n    if(p>q){\n        printf(\""%d\"",r+p+q-i);\n    }\n    return 0;\n}\n",SEGMENTATION_FAULT,7,196
1591652736507326464,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 12:42:38,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"P,Q,R=map(int,input().split())\nnum1=p+q\nnum2=p+r\nnum3=q+r\nif num1<num2 and num1<num3:\n    print(num1)\n    if num2<num1 and num2<num3:\n        print(num2)\n        if num3<num2 and num3<num1:\n            print(num3)",NON_ZERO_EXIT_CODE,19,2788
1591652790680956928,64f8dab58af431d48e3c413e8710a37cc2c583e883c731d70cd5a4e026299255,2022-11-13 12:42:51,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nint main(){\n    printf(\""60\\n\"");\n    return 0;\n}",ACCEPTED,8,352
1591652792354484224,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 12:42:51,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int p,q,r,sum;\n    scanf(\""%d %d %d\"",&p,&q,&r);\n    if(p<=q&&p<r&&r<=q)\n        sum=p+r;\n    else if(q<=p&&q<=r&&p<=r)\n        sum=p+q;\n    else if(r<=p&&r<=q&&p<=q)\n        sum=r+p;\n    else if(p<=q&&p<=r&&q<=r)\n        sum=p+q;\n    else if(q<=p&&q<=r&&r<=p)\n        sum=q+r;\n    else if(r<=p&&r<=q&&q<=p)\n        sum=r+q;\n    else\n        sum=p+q;\n    printf(\""%d\"",sum);\n    return 0;\n}",ACCEPTED,33,368
1591652810926874624,f1a9b482617577a636e4a09531695721778faca66954fa117a72ad0fab52cd55,2022-11-13 12:42:56,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R;\n    int s1,s2,s3;\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    s1=P+Q;\n    s2=Q+R;\n    s3=P+R;\n    if(s1>s2){\n        if(s2>s3){\n            printf(\""%d\"",s3);\n        }\n        else{\n            printf(\""%d\"",s2);\n        }\n    }\n    else{\n        printf(\""%d\"",s1);\n    }\n    printf(\""/n\"");\n    return 0;\n}\n",WRONG_ANSWER,8,196
1591652814093606912,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-13 12:42:57,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int i,a[10],sum=0,max,x;\n    scanf(\""%d\"",&i);\n    for(x=0;x<i;x++)\n        scanf(\""%d\"",&a[x]);\n    max=a[0];\n    for(x=0;x<i;x++)\n    {\n        sum-=5;\n        sum+=a[x];\n        if(sum>max) max=sum;\n    }\n    sum=0\n    for(x=0;x<i;x+3)\n    {\n        sum-=5;\n        sum+=a[x];\n        if(sum>max) max=sum;\n    }\n    printf(\""%d\"",max);\n}",COMPILE_ERROR,0,0
1591652820208857088,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-13 12:42:58,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    int P,Q,R;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    printf(\""%d\\n\"",P+Q);\n    printf(\""从A到B花费%d块钱，从B到C花费%d块钱，此时所有地点都去过了，总花费%d块钱\"",P,Q,P+Q);\n    \n}",WRONG_ANSWER,6,324
1591652846540709888,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 12:43:04,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"P,Q,R=map(real,input().split())\nnum1=p+q\nnum2=p+r\nnum3=q+r\nif num1<num2 and num1<num3:\n    print(num1)\n    if num2<num1 and num2<num3:\n        print(num2)\n        if num3<num2 and num3<num1:\n            print(num3)",NON_ZERO_EXIT_CODE,21,2836
1591652867159908352,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-13 12:43:09,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R,a;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    if(P+Q<P+R&&Q+R<P+R){\n    printf(\""%d\"",P+Q);}\n    else{\n        printf(\""%d\"",P+R);\n    }\n    return 0;\n}\n",WRONG_ANSWER,5,384
1591652874999095296,5a1c17b308a3b3595833d34c6bdfb75e9f5dd0d065acfeb7f28ab8102ba7406c,2022-11-13 12:43:11,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a, b ,c;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    int sum1 = a+b;\n    int sum2 = b+c;\n    if(sum1 < sum2){\n        printf(\""%d\"",sum2);\n    }else{\n        printf(\""%d\"",sum1);\n    }\n    return 0;\n}",WRONG_ANSWER,16,352
1591652914043826176,15ac7d06a472ca25d78349f7cc3a73d23c7d7a4f0c4ae3cec6200fcdb8135965,2022-11-13 12:43:20,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n     int p,q,r;\n    scanf(\""%d %d %d\"",&p,&q,&r);\n    if(p>q&&p>r)\n        printf(\""%d\"",q+r);\n    if(q>r&&q>p)\n        printf(\""%d\"",p+r);\n    if(r>p>q&&r>q)\n        printf(\""%d\"",q+p);\n    return 0;\n}\n",WRONG_ANSWER,5,368
1591652929176920064,7d46013a6da090b69b62e7be93e7628aee2f7eef31af37777b9ccf1fd1d3eb2e,2022-11-13 12:43:24,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int r,p,q,i;\n    scanf(\""%d%d%d\"",&r,&p,&q);\n    i=r;\n    if(i<q)\n        i=q;\n    if(i<p)\n        i=p;\n        printf(\""%d\"",r+p+q-i);\n    return 0;\n}\n",ACCEPTED,73,608
1591652933803204608,17759f531671f838bf3fae4270190e93b6109026f9503f986c1ed85bb412007d,2022-11-13 12:43:25,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,n,a[1000],sum=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=1;i<n-1;i++)\n    {\n        if(a[i]<a[i-1])\n        {\n            if(a[i]<a[i+1])\n            {\n                sum++;\n            }\n            else if(a[i]==a[i+1])\n            {\n                if(a[i]<a[i+2])\n                    sum++;\n            }\n         }\n    }\n    printf(\""%d\"",sum);\n}",WRONG_ANSWER,60,512
1591652934822453248,cf568c7ddc8b221335f880bfbaac4634294e65481e738a2e032c1ab9a84d576f,2022-11-13 12:43:25,Java,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner in = new Scanner(System.in);\n        int P=in.nextInt();\n        int Q=in.nextInt();\n        int R=in.nextInt();\n        \n        int A=1,B=2,C=3;\n        for(int i=1;i<=3;i++){\n            if(i==1){\n                if((P+Q)>(P+R)){\n                    int a=P+Q;\n                }else{\n                   int b= P+R;\n                }\n            }\n            if(i==2){\n               int c= P+Q;\n            }\n            if(i==3){\n                if((P+Q)>(Q+R)){\n                   int d= P+Q;\n                }else{\n                   int e= Q+R;\n                }\n            }\n        }\n        if(P+Q<=Q+R){\n            if(P+Q<=P+R){\n                System.out.println(P+Q);\n            }else{\n                if(P+R<=Q+R){\n                    System.out.println(P+R);\n                }else{\n                    System.out.println(Q+R);\n                }\n            }\n        }else{\n            if(Q+R>=P+R){\n                System.out.println(P+R);\n            }else{\n                System.out.println(Q+R);\n            }\n        }\n        \n    }\n}",ACCEPTED,597,26064
1591652940182728704,99481c5a0804ff1b45cf32a79326675aa759c0780ab1ad0d29f845666cb83208,2022-11-13 12:43:27,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int spend=0;\n    int a,b,c;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    int sum1=a+b;\n    int sum2=b+c;\n    int sum3=a+c;\n    printf(\""5\"");\n}\n",WRONG_ANSWER,31,384
1591652942711939072,54914c90623988219ee55c4a0b2e645efd9808505aa25f0099930bfa8bf18ad1,2022-11-13 12:43:27,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main(){\n\tint p,q,r;\n\tscanf(\""%d%d%d\"",&p,&q,&r);\n\tint a = p+r;\n\tint b = r+q;\n\tint c = q+p;\n\tint min = a;\n\tif(b < a){\n\t\tmin =b;\n\t}\n\tif(c<a){\n\t\tmin = c; \n\t}\n\tprintf(\""%d\"",min);\n} ",WRONG_ANSWER,27,372
1591652960487399424,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-13 12:43:31,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n   int a,b,c sum;\n   scanf(\""%d %d %d\"",&a,&b,&c);\n   if(1<=a,b,c&&a,b,c>=1000)\n   {\n       sum=a+b;\n   }\n   printf(\""%d\"",&sum);\n    return 0;\n}",COMPILE_ERROR,0,0
1591652966883713024,81f258582663b08bc9b4d77bba77afc3b463021ec8fb2262453de07687484cd5,2022-11-13 12:43:33,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"P,Q,R = input().split()\n\n\np = int(P)\nq = int(Q)\nr = int(R)\n\n \n\na =  p + q\nb = p + r\nc =  r +p\n\n#f= eval(a)\n#h= eval(b)\n#g= eval(c)\nd = min(a,b,c)\nif p >=1 and p <=10**3 and q >=1 and q <=10**3 and r >=1 and r <=10**3 :\n  print(d)\n",WRONG_ANSWER,19,2916
1591652967105978368,cf568c7ddc8b221335f880bfbaac4634294e65481e738a2e032c1ab9a84d576f,2022-11-13 12:43:33,Java,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner in = new Scanner(System.in);\n        int P=in.nextInt();\n        int Q=in.nextInt();\n        int R=in.nextInt();\n        \n        int A=1,B=2,C=3;\n        for(int i=1;i<=3;i++){\n            if(i==1){\n                if((P+Q)>(P+R)){\n                    int a=P+Q;\n                }else{\n                   int b= P+R;\n                }\n            }\n            if(i==2){\n               int c= P+Q;\n            }\n            if(i==3){\n                if((P+Q)>(Q+R)){\n                   int d= P+Q;\n                }else{\n                   int e= Q+R;\n                }\n            }\n        }\n        if(P+Q<=Q+R){\n            if(P+Q<=P+R){\n                System.out.println(P+Q);\n            }else{\n                if(P+R<=Q+R){\n                    System.out.println(P+R);\n                }else{\n                    System.out.println(Q+R);\n                }\n            }\n        }else{\n            if(Q+R>=P+R){\n                System.out.println(P+R);\n            }else{\n                System.out.println(Q+R);\n            }\n        }\n        \n    }\n}",ACCEPTED,543,25392
1591652969605816320,acfcf65f14b5d3b02c3225372654b4e21f04d33a8bbaeb346e4fb1d85f2ea94f,2022-11-13 12:43:34,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int P=3,Q=2,R=5,i;\n    for(i=0;i<2)\n    {\n        scanf(\""%d %d %d\"",&P,&Q,&R);\n        if(P+Q=R)\n    printf(\""%d\"",P+Q);\n        \n    }\n    \n    return 0;\n}",COMPILE_ERROR,0,0
1591652983371522048,b80fc2aed0abde15bdaa9327874c9784da696b6ed442d90001602ff2a017be15,2022-11-13 12:43:37,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h> \n#include<math.h> \nint main()\n{\n     int n,i,sum=0;\n\t int a[10000];\n\t scanf(\""%d\"",&n);\n\t for(i=0;i<n;i++)\n\t  scanf(\""%d\"",&a[i]);\n     for(i=0;i<n-1;i++)\n\t  if((a[i]-a[i+1])>0)\n\t    sum=sum+1;\n      sum=sum-1; \n\tprintf(\""%d\"",sum);\n\tprintf(\""\\n\"");\t  \n\t  return 0; \n}",WRONG_ANSWER,5,332
1591652996742918144,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-13 12:43:40,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n\n   printf(\""60\"");\n   return 0;\n}",ACCEPTED,5,460
1591653004770816000,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 12:43:42,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"P,Q,R=map(int,input().split())\nnum1=P+Q\nnum2=P+R\nnum3=Q+R\nif num1<num2 and num1<num3:\n    print(num1)\n    if num2<num1 and num2<num3:\n        print(num2)\n        if num3<num2 and num3<num1:\n            print(num3)",WRONG_ANSWER,35,2928
1591653007518130176,15ac7d06a472ca25d78349f7cc3a73d23c7d7a4f0c4ae3cec6200fcdb8135965,2022-11-13 12:43:43,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n     int p,q,r;\n    scanf(\""%d %d %d\"",&p,&q,&r);\n    if(p>q&&p>r)\n        printf(\""%d\"",q+r);\n    if(q>r&&q>p)\n        printf(\""%d\"",p+r);\n    if(r>p&&r>q)\n        printf(\""%d\"",q+p);\n    return 0;\n}\n",ACCEPTED,43,496
1591653013478191104,4d1157ac6ad50cfc6ca5d6b3e1c2dd7f1ecc593df10ff6888d4207a4f1c03a35,2022-11-13 12:43:44,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int P,Q,R,sum1,sum2,sum3;\n    cin>>P>>Q>>R;\n    int min=3001;\n    sum1=P+Q;\n    if(sum1<min)min=sum1;\n    sum2=P+R;\n    if(sum2<min)min=sum2;\n    sum3=R+Q;\n    if(sum3<min)min=sum3;\n    printf(\""%d\\n\"",min);\n    return 0;\n}",WRONG_ANSWER,10,472
1591653025268379648,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-13 12:43:47,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n   int a,b,c sum;\n   scanf(\""%d %d %d\"",&a,&b,&c);\n   if(1<=a,b,c&&a,b,c>=1000)\n   {\n       sum=c+b;\n   }\n   printf(\""%d\"",&sum);\n    return 0;\n}",COMPILE_ERROR,0,0
1591653042469265408,f1a9b482617577a636e4a09531695721778faca66954fa117a72ad0fab52cd55,2022-11-13 12:43:51,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R;\n    int s1,s2,s3;\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    s1=P+Q;\n    s2=Q+R;\n    s3=P+R;\n    if(s1>s2){\n        if(s2>s3){\n            printf(\""%d\"",s3);\n        }\n        else{\n            printf(\""%d\"",s2);\n        }\n    }\n    else{\n        printf(\""%d\"",s1);\n    }\n    printf(\""\\n\"");\n    return 0;\n}\n",ACCEPTED,44,408
1591653043786244096,a57fdafe4877cd9608fc0ac8a5120a47bc60a015785960e61b67b4e66187c2f2,2022-11-13 12:43:51,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n  int a,b,c,i,j,k,m;\n  scanf(\""%d %d %d\"",&a,&b,&c);\n  i=a+b;\n  j=a+c;\n  k=b+c;\n  if(i<j)\n    m=i;\n  else\n    m=j;\n  if(m>k)\n    m=k;\n  printf(\""%d\"",m);\n    return 0;\n}",ACCEPTED,61,496
1591653051101143040,24daa7a58808ceb95b2ed2e23721ea7b987a061e19ca5fee0ee2d0f93c78507f,2022-11-13 12:43:53,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int r,p,q,i;\n    scanf(\""%d%d%d\"",&r,&p,&q);\n    i=r;\n    if(i>q){\n        i=q;\n    }\n    if(i>p){\n        i=p;\n    }\n    if(p>q){\n        printf(\""%d\"",r+p+q-i);\n    }\n    return 0;\n}\n",WRONG_ANSWER,4,200
1591653062031454208,d9e00d995e65b04cda3ddef6baec19225e4351002ab4efa981f62d78919a481b,2022-11-13 12:43:56,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int p,q,r;\n    scanf(\""%d%d%d\"",&p,&q,&r);\n    if(p<=q && p<=r){\n        if(q<=r) printf(\""%d\"",p+q);\n        else printf(\""%d\"",p+r);\n    }else printf(\""%d\"",q+r);\n\n}\n",WRONG_ANSWER,24,364
1591653069883236352,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-13 12:43:58,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main(){\n    int n,a[1000],count=0,i,j;\n      scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n        \n        \n    }\n    for( j=2;j<n;j+=2)\n    {\n        if(a[j]<a[j-1]&&a[j]<a[j+1])\n        { \n          count++;\n             \n            }\n    }\n   if(count!=0)\n      printf(\""%d\"",count+1);\n   else \n     printf(\""0\"");\n}",WRONG_ANSWER,10,468
1591653071519014912,81f258582663b08bc9b4d77bba77afc3b463021ec8fb2262453de07687484cd5,2022-11-13 12:43:58,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"P,Q,R = input().split()\n\n\np = int(P)\nq = int(Q)\nr = int(R)\n\n \n\na =  p + q\nb = p + r\nc =  r +p\n\n#f= eval(a)\n#h= eval(b)\n#g= eval(c)\nd = min(a,b,c)\nif p >=1 and p <=10**3 and q >=1 and q <=10**3 and r >=1 and r <=10**3 :\n  print(d)\n",WRONG_ANSWER,17,2760
1591653074782150656,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 12:43:59,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"P,Q,R=map(real,input().split())\nnum1=P+Q\nnum2=P+R\nnum3=Q+R\nif num1<num2 and num1<num3:\n    print(num1)\n    if num2<num1 and num2<num3:\n        print(num2)\n        if num3<num2 and num3<num1:\n            print(num3)",NON_ZERO_EXIT_CODE,18,2908
1591653141232496640,0ccbaaa612b3d01dbe621ce5e7366d6e26d2e5adf55047d92c6eb7adf78a979d,2022-11-13 12:44:15,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int n;cin>>n;\n    int a[n];\n    int maxArea=0;\n    for(int i=0;i<n;i++) cin>>a[i];\n    for(int i=0;i<n-1;i++)\n    {\n        int t,count=1;\n        for(int j=i+1;j<n;j++)\n        {\n            if(a[j]>=a[i]) {count++;continue;}\n        }\n        t=count*a[i];\n        if(t>maxArea) maxArea=t;\n    }\n    cout<<maxArea;\n    return 0;\n}\n",WRONG_ANSWER,5,476
1591653166306058240,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-13 12:44:20,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int P,Q;\n    scanf(\""%d%d\"",&P,&Q);\n    printf(\""从A到B花费%d块钱，从B到C花费%d块钱，此时所有地点都去过了，总花费为%d块钱。\"",P,Q,P+Q)\n    return 0;\n}",COMPILE_ERROR,0,0
1591653234312536064,5d1852a153062cc8297ed7a30bb643375395a70654d5dff506fad6bc186e81bd,2022-11-13 12:44:37,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h> \nint main(){\n\tint p,q,r;\n\tscanf(\""%d %d %d\"",&p,&q,&r);\n\tif(p>=q){\n\t\tif(p>=r)\n\t\t\tprintf(\""%d\"",r+q);\n\t\telse\n\t\t\tprintf(\""%d\"",p+q);\n\t\t}\n\telse if(p<q){\n\t\tif(q>r)\n\t\t\tprintf(\""%d\"",p+r);\n\t\telse\n\t\t\tprintf(\""%d\"",p+q);\n\t}\n\telse\n\t\tif(p>=q)\n\t\t\tprintf(\""%d\"",r+q);\n\t\telse\n\t\t\tprintf(\""%d\"",r+p);\n\t\t\n\treturn 0;\t\n\t \n}",ACCEPTED,34,472
1591653238800441344,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-13 12:44:38,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int P,Q;\n    scanf(\""%d%d\"",&P,&Q);\n    printf(\""从A到B花费%d块钱，从B到C花费%d块钱，此时所有地点都去过了，总花费为%d块钱。\"",P,Q,P+Q);\n    return 0;\n}",WRONG_ANSWER,8,364
1591653252104728576,acfcf65f14b5d3b02c3225372654b4e21f04d33a8bbaeb346e4fb1d85f2ea94f,2022-11-13 12:44:41,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int P=3,Q=2,R=5,i;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    printf(\""%d\"",P+Q);\n    return 0;\n}",WRONG_ANSWER,8,512
1591653275924180992,b69ff333cc0daa10fb20c3ba26e439f64260003a8ff6fde3dbc623fd631ba825,2022-11-13 12:44:47,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main(void)\n{\n    int P,Q,R;\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n\n    printf(\""%d\"",P+Q);\n    return 0;\n}",WRONG_ANSWER,15,604
1591653305007484928,5a1c17b308a3b3595833d34c6bdfb75e9f5dd0d065acfeb7f28ab8102ba7406c,2022-11-13 12:44:54,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a, b ,c;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    int sum1 = a+b;\n    int sum2 = b+c;\n    if(sum1 < sum2){\n        printf(\""%d\"",sum1);\n    }else{\n        printf(\""%d\"",sum2);\n    }\n    return 0;\n}",ACCEPTED,31,472
1591653308664918016,e7f8e9ba366feb4551b7dc8e6a149f796e822980a43de4fcc91ded552c4bcbd4,2022-11-13 12:44:54,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main(int argc, char *argv[]) {\n\tint P,Q,R,F=0; \n\tscanf(\""%d%d%d\"",&P,&Q,&R);\n\tF=P+Q;\n\tprintf(\""%d\\n\"",F);\n\treturn 0;\n\t\n}",WRONG_ANSWER,12,200
1591653308983685120,9c773df96630087325d11d08f2dbc9851abb095c63fb7b3e55cb667898dfe23f,2022-11-13 12:44:55,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nmian()\n{\n    int i,j,k;\n    int s=0;\n    scanf(\""%d,%d,%d\"",&i,&j,&k);\n    if(i>j)\n    {        s=s+j;\n             if(j>k)\n             {s=s+k;\n             printf(\""花费为%d\\n\"",s);\n             }\n             \n    }\n    \n    \n}",COMPILE_ERROR,0,0
1591653313668767744,b31601c92a4a3080abbaad650e00bb77253224eab66b59a49b2118d017649c2c,2022-11-13 12:44:56,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b,c,d,e,f;\n    scanf(\""%d,%d,%d\"",&a,&b,&c);\n        d = b+c;\n        e = a+b;\n        f = a+c;\n        if(d>=e){\n            if(e>=f){\n                printf(\""%d\"",&f);\n            }\n            else{\n                printf(\""%d\"",&e);\n            }\n        }\n        else{\n            printf(\""%d\"",&d);\n        }\n    return 0;\n}\n",WRONG_ANSWER,6,324
1591653317586202624,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-13 12:44:57,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main(){\n    int n,a[1000],count=0,i,j;\n      scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n        \n        \n    }\n    for( j=2;j<n;j++)\n    {\n        if(a[j]<a[j-1]&&a[j]<a[j+1])\n        { \n          count++;\n             \n            }\n    }\n   if(count!=0)\n      printf(\""%d\"",count);\n   else \n     printf(\""0\"");\n}",WRONG_ANSWER,27,348
1591653321847615488,07d925df8d2026d3171a0a2ca84a6ef7f4a5b47a584cf47b66c5dd8f28139d1f,2022-11-13 12:44:58,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a[10000],b,n,i;\n    scanf(\""%d\"",&n);\n    for (i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    b=15;\n    printf(\""%d\\n\"",b);\n    return 0;\n}\n\n",WRONG_ANSWER,9,512
1591653323235942400,e807496cefc8b76d55101108daa4cb8e59f87dde49b8197bd619e8a84563990e,2022-11-13 12:44:58,C++,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<bits/stdc++.h> \nusing namespace std;\n\nint main()\n{\n\tint p,q,r;\n\tcin>>p>>q>>r;\n\tcout<<(((p+q)<(q+r)?(p+q):(q+r))<(r+p)?((p+q)<(q+r)?(p+q):(q+r)):(r+p))<<endl;\n\treturn 0;\n}",ACCEPTED,57,756
1591653327740624896,24daa7a58808ceb95b2ed2e23721ea7b987a061e19ca5fee0ee2d0f93c78507f,2022-11-13 12:44:59,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int r,p,q,i;\n    scanf(\""%d%d%d\"",&r,&p,&q);\n    i=r;\n    if(i<q)\n        i=q;\n    if(i<p)\n        i=p;\n        printf(\""%d\"",r+p+q-i);\n    return 0;\n}\n",ACCEPTED,37,356
1591653329485443072,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-13 12:44:59,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main()\n{\n    int n,h[1000],i,j;\n    j=0;\n    scanf(\""%d\"",&n);\n    \n    for(i=0;i<n;i++)\n    {\n        \n        scanf(\""%d\"",&h[i]);\n    }\n    for(i=1;i<n-1;i++)\n    {\n        if(h[i]<h[i+1]&&h[i]<h[i-1]) j++;\n        if(h[i]==h[i+1]&&h[i+1]<h[i+2]&&h[i]<h[i-1]) j++;\n        \n    }\n    printf(\""%d\\n\"",j);\n    \n    \n    \n    \n    \n    return 0;\n}",WRONG_ANSWER,40,572
1591653353451696128,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-13 12:45:05,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"n=int(input())\n# data=list(map(int,list(input())))\ndata=input()\ndatas=list(data)\ncount=0\nfor i in range(int(n/2)):\n    for x in range(0,len(datas)-1):\n        if datas[x]!=datas[x+1]:\n            datas.pop(x)\n            datas.pop(x)\n            count+=1\n            break\nprint(count*2)",TIME_LIMIT_EXCEEDED,503,3840
1591653373831819264,0ccbaaa612b3d01dbe621ce5e7366d6e26d2e5adf55047d92c6eb7adf78a979d,2022-11-13 12:45:10,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int n;cin>>n;\n    int a[n];\n    int maxArea=0;\n    for(int i=0;i<n;i++) cin>>a[i];\n    for(int i=0;i<n-1;i++)\n    {\n        int t,count=1;\n        for(int j=i+1;j<n;j++)\n        {\n            if(a[j]>=a[i]) {count++;continue;}\n            else break;\n        }\n        t=count*a[i];\n        if(t>maxArea) maxArea=t;\n    }\n    cout<<maxArea;\n    return 0;\n}\n",WRONG_ANSWER,22,464
1591653453234188288,345826d11b41befc23adeb536e81da8eb6ec9a8bfb9448acf91422deedb8ba4a,2022-11-13 12:45:29,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\n main()\n{\n    printf(\""60\"");\n\n}\n",ACCEPTED,7,324
1591653471412301824,e67d0171967fcfdd3835361399616ff4e60e12e62c2ed2fd59506c58aeaae4ad,2022-11-13 12:45:33,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int p,q,r,z;\n    scanf(\""%d,%d,%d\"",&p,&q,&r);\n    printf(\""%d\"",p+q+r);\n   /*if((p>=1)&&(p<=1000)&&(q>=1)&&(q<=1000)&&(r>=1)&&(r<=1000))\n   {\n      z=p+q+r;\n    printf(\""%d\"",z);\n   }*/\n        \n}",WRONG_ANSWER,6,324
1591653483298959360,4e97dffad9953b68d5edd2be07bfc6fdc17c63c845c8ee056e07353c9a386309,2022-11-13 12:45:36,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main(){\n    int P,Q,R;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    if(P<Q)\n    {\n        int tmp=P;\n        P=Q;\n            Q=tmp;\n    }\n    if(P<R)\n    {\n        int tmp=P;\n        P=R;\n        R=tmp;\n    }\n    if(Q<P)\n    {\n        int tmp=Q;\n        Q=P;\n        P=tmp;\n    }\n    printf(\""%d\"",P+Q);\n        return 0;\n}",WRONG_ANSWER,5,332
1591653484532129792,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-13 12:45:36,C++,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    int P,Q,R;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    if((P+Q)<(Q+R))\n    {\n        printf(\""%d\\n\"",P+Q);\n    }\n    else{\n        printf(\""%d\\n\"",Q+R);\n    }\n}",ACCEPTED,37,512
1591653491205222400,bce383372e0b1b627f0a9b838121096ec3ca14c0f213828fca1bf517a82c8744,2022-11-13 12:45:38,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int P,Q,R,sum[3],min,i;\n    printf(\""请输入三个整数：\\n\"");\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    min=P+Q;\n    sum[0]=P+Q;\n    sum[1]=P+R;\n    sum[2]=Q+R;\n    for(i=0;i<=2;i++)\n    {\n        if(min>sum[i])\n        {\n            min=sum[i];\n            printf(\""%d\"",min);\n        }\n        else\n            printf(\""%d\"",min);\n    }\n}",WRONG_ANSWER,5,204
1591653518069784576,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-13 12:45:44,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int i,a[10],sum=0,max,x;\n    scanf(\""%d\"",&i);\n    for(x=0;x<i;x++)\n        scanf(\""%d\"",&a[x]);\n    max=a[0];\n    for(x=0;x<i;)\n    {\n        sum-=5;\n        if(a[x+1]>a[x+3]) x+=1;\n        else x+=3;\n        sum+=a[x];\n        if(sum>max) max=sum;\n    }\n    printf(\""%d\"",max);\n}",SEGMENTATION_FAULT,10,196
1591653534712737792,d9f0f29c0c2f6a52018e8ee93d686388c75950bcac327d0bebd2166a37f8dd26,2022-11-13 12:45:48,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,b,c,d,e,f;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    if((a+b)>(b+c))\n        printf(\""%d\"",b+c);\n    else if((b+c)>(c+a))\n        printf(\""%d\"",c+a);\n    else printf(\""%d\"",a+b);\n    \n    return 0;\n}\n",WRONG_ANSWER,5,484
1591653564005756928,2e4af98c441106efa9ee51f8a781d0eee91a3dff6193987d421eb3a48725c814,2022-11-13 12:45:55,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <iostream>\n\nint fun(int,int,int,int);\nint pow(int,int);\nint main(){\n\tint n,a,b;\n\tscanf(\""%d %d %d\"",&n,&a,&b);\n\tint *cArr = new int[n];\n\tint *fArr = new int[n];\n\tfor(int i=0;i<n;++i){\n\t\tscanf(\""%d\"",&cArr[i]);\n\t}\n\tfor(int i=0;i<n;++i){\n\t\tscanf(\""%d\"",&fArr[i]);\n\t}\n\tint t=0;\n\tfor(int i=0;i<n;++i){\n\t\tt += fun(cArr[i],a,b,fArr[i]);\n\t}\n\tprintf(\""%d\"",t);\n\t\n}\nint pow(int x,int y){\n\tint t=1,e=x;\n\tfor(int i=1;i<=y;i++){\n\t\tt = t*e;\n\t}\n\treturn t;\n}\nint fun(int c,int a,int b,int f){\n\tint t1= c/(f+1);\n\tint t2 = pow(a,f+1)-pow(b,f+1);\n\treturn t1*t2;\t\n}",WRONG_ANSWER,5,332
1591653573510062080,39afbda4ab6a7df2673bc0d0eec048a42b23ada2774ec941935a2b2fa044515a,2022-11-13 12:45:58,C++,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <bits/stdc++.h>\nusing namespace std;\n#define MAX 100001\nint main()\n{\nchar a[MAX];\nint n,j=0,p=0,q=0;\ncin>>n;\nfor(int i=0;i<n;i++){\n    cin>>a[i];\n}\nfor(j=0;j<n;j++){\n    if(a[q]!=a[q+1]&&a[q+1]<=1&&a[q+1]>=0&&a[q]<=1&&a[q]>=0){\n                p+=2;\n                   for(int i=q;i<n;i++){\n                    a[i]=a[i+2];\n                    a[i+1]=a[i+3];\n                   }\n                   q=0;\n        }\n    else q++;\n}\n\n\ncout<<p;\n}\n",WRONG_ANSWER,8,620
1591653575745658880,6933dcb3592e2d6f6fc887ed9a5537aab21a30f76450c9b5043f7776bfc39a59,2022-11-13 12:45:58,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<string.h>\nvoid main(){\n    int i,n,start=1,end=1,temp=0;\n    scanf(\""%d\"",&n);\n    char str[n];\n    for(i=0;i<=n;i++){\n        scanf(\""%c\"",&str[i]);\n    }\n    while(end!=n+1){\n        if(str[start]==str[end]){\n            start=end;\n            end++;\n        }else{\n            temp=temp+2;\n            start--;\n            end++;\n        }\n    }\n    printf(\""%d\"",temp);\n}",WRONG_ANSWER,6,196
1591653587670032384,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-13 12:46:01,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"eval(input())\n1<=P,Q,R<=1000\na=P+Q\nb=Q+R\nc=R+P\nif a<b:\nif a<c:\n   print(a)\nelif b<a:\nelif b<c:\n    print(b)\nelif c<a:\nelif c<b:\n    print(c)\n",NON_ZERO_EXIT_CODE,15,2892
1591653599846096896,29d1ea54d6e4e56fc2de0be5ae10ecc4c70c7fca667934b17857e95530f5663a,2022-11-13 12:46:04,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n   int a[3],i,max,n;\n    for(i=0;i<3;i++)\n        scanf(\""%d\"",&a[i]);\n    a[max]=a[0];\n    for(i=0;i<3;i++)\n    {\n        if(a[max]<a[i])\n            max=i;\n    }\n    if(max=0) n=a[1]+a[2];\n    if(max=1) n=a[2]+a[0];\n    if(max=2) n=a[0]+a[1];\n    printf(\""%d\"",n);\n    return 0;\n}\n",WRONG_ANSWER,18,368
1591653630128971776,a8a4c649080a65381764d05b09cdced42bbf4a58e2656f96cfc5545fc9d08327,2022-11-13 12:46:11,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{   int P,Q,R,BE;\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    scanf(\""%d\"",&BE);\n    int A,B,C,min;\n    if(A==BE)\n    {\n        min=P+Q;\n        printf(\""%d\"",min);\n    }\nelse if(B==BE)\n    {\n        min=Q+R;\n        printf(\""%d\"",min);\n    }\nelse \n    {\n        min=R+P;\n        printf(\""%d\"",min);\n    }\n    return 0;\n}\n",WRONG_ANSWER,7,200
1591653658096578560,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-13 12:46:18,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"n=int(input())\n# data=list(map(int,list(input())))\ndata=input()\ndatas=list(data)\ncount=0\nfor i in range(int(n/2)):\n    for x in range(0,len(datas)-1):\n        if datas[x]!=datas[x+1]:\n            datas.pop(x)\n            datas.pop(x)\n            count+=1\n            break\nprint(count*2)",TIME_LIMIT_EXCEEDED,473,3908
1591653665923194880,05f9d62a2660f27e0711448c225e5e0fe6347745a2c93edb6296c0a2ffbc6605,2022-11-13 12:46:20,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nmain()\n{\n    int n,a[10000];\n    int i,num=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=1;i<n;i++)\n        if(a[i-1]-a[i]>=0&&a[i+1]-a[i]>0)\n            num++;\n    printf(\""%d\"",num);\n}",ACCEPTED,29,604
1591653671539322880,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-13 12:46:21,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"n=int(input())\n# data=list(map(int,list(input())))\ndata=input()\ndatas=list(data)\ncount=0\nfor i in range(int(n/2)):\n    for x in range(0,len(datas)-1):\n        if datas[x]!=datas[x+1]:\n            datas.pop(x)\n            datas.pop(x)\n            count+=1\n            break\nprint(count*2)",TIME_LIMIT_EXCEEDED,472,3844
1591653683958669312,4812f9582f90b7f3f95178a62ec39f3555e90b935658da3e31a47fe0d2e8c6fd,2022-11-13 12:46:24,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int P,Q,R;\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    printf(\""%d\"",5);\n \n}\n\n\n",WRONG_ANSWER,10,476
1591653689709047808,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-13 12:46:25,C,0.0,1591610585635213314,1591128862958940160,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main(){\n\tint n,i;\n\tscanf(\""%d\"",&n);\n\tint a[n-1];\n\tfor(i=0;i<n-1;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tprintf(\""%d \"",n);\n\tfor(i=1;i<n-2;i++){\n\t\tprintf(\""%d \"",n-a[i]);\n\t}\n\tprintf(\""1 1\\n\"");\n}",WRONG_ANSWER,5,384
1591653705664180224,02f3cf9a5ba39e00e2644b9392922d3ea3ea233f83c612c7dbd879f319ea2bdc,2022-11-13 12:46:29,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}\n",ACCEPTED,14,476
1591653720990212096,e67d0171967fcfdd3835361399616ff4e60e12e62c2ed2fd59506c58aeaae4ad,2022-11-13 12:46:33,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int p,q,r,z;\n    //scanf(\""%d,%d,%d\"",&p,&q,&r);\n    p=3;\n    q=2;\n    r=3;\n    printf(\""%d\"",p+q+r);\n   /*if((p>=1)&&(p<=1000)&&(q>=1)&&(q<=1000)&&(r>=1)&&(r<=1000))\n   {\n      z=p+q+r;\n    printf(\""%d\"",z);\n   }*/\n        \n}",WRONG_ANSWER,5,468
1591653727382286336,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-13 12:46:34,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"\n1<=P,Q,R<=1000\na=P+Q\nb=Q+R\nc=R+P\nif a<b:\nif a<c:\n   print(a)\nelif b<a:\nelif b<c:\n    print(b)\nelif c<a:\nelif c<b:\n    print(c)\n",NON_ZERO_EXIT_CODE,18,2768
1591653752011284480,c39a4349139942a7aa7456b2c4609f8d0f9d0d3465be213d33870ec87eab1e58,2022-11-13 12:46:40,C++,0.0,1591610585635213314,1591128862958940160,1049226928954454016,"#include <stdio.h>\n\nint main(void) \n{\n\tint n,a[100],i,c;\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n-1;i++)\n\t{\n\t\tscanf(\""%d\"",&a[i]); \n\t}\n for(i=0;i<n-1;i++)\n {\n     if(a[i]<=a[i+1])\n     {\n       c=a[i+1];\n         a[i+1]=a[i];\n         a[i]=c;\n     }\n }\n    \n    printf(\""%d \"",n);\n    for(i=0;i<n-1;i++)\n        printf(\""%d \"",a[i]);\n}",RUNTIME_ERROR,6,324
1591653767098163200,e67d0171967fcfdd3835361399616ff4e60e12e62c2ed2fd59506c58aeaae4ad,2022-11-13 12:46:44,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int p,q,r;\n    //scanf(\""%d,%d,%d\"",&p,&q,&r);\n    p=3;\n    q=2;\n    r=3;\n    printf(\""%d\"",p+q+r);\n   /*if((p>=1)&&(p<=1000)&&(q>=1)&&(q<=1000)&&(r>=1)&&(r<=1000))\n   {\n      z=p+q+r;\n    printf(\""%d\"",z);\n   }*/\n        \n}",WRONG_ANSWER,8,212
1591653790607269888,4e97dffad9953b68d5edd2be07bfc6fdc17c63c845c8ee056e07353c9a386309,2022-11-13 12:46:49,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main(){\n    int P,Q,R;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    if(P<=Q)\n    {\n        int tmp=P;\n        P=Q;\n            Q=tmp;\n    }\n    if(P<=R)\n    {\n        int tmp=P;\n        P=R;\n        R=tmp;\n    }\n    if(Q<=P)\n    {\n        int tmp=Q;\n        Q=P;\n        P=tmp;\n    }\n    printf(\""%d\"",P+Q);\n        return 0;\n}",WRONG_ANSWER,13,512
1591653802661654528,beefe7893dd2cd421da3fb1ba3ffd90e3dc51d5301380baebfdfa12fbe5234f5,2022-11-13 12:46:52,Python,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"import math\np,q,r=map(int,input().split())\na=p+q\nb=q+r\nc=r+p\nnum=min(a,b,c)\nprint(num)\n",ACCEPTED,95,2904
1591653809737457664,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 12:46:54,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <string.h>\nint main()\n{\n    int k,len,i,g,l;\n    char str[1000] = {0};\n    scanf(\""%d\"",&k);\n    scanf(\""%s\"",str);\n    len  = strlen(str);\n    for(i=0;i<len;i++)\n    {\n        if(str[i]=='0')\n        g++;\n        else\n        l++;\n    }\n    g-=8;//0的个数;\n    l-=52;//1的个数;\n    if(g>l)\n    printf(\""%d\"",2*l);\n    else\n    printf(\""%d\"",2*g);\n    return 0;\n}\n",WRONG_ANSWER,5,192
1591653843702964224,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-13 12:47:02,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nint main() {\n\t     int a,b,c,d[3],min;\n\t\t scanf(\""%d %d %d\"",&a,&b,&c);\n\t\t min=a+b;\n\t\t d[0]=min;\n\t\t d[1]=b+c;\n\t\t d[2]=a+c;\n\t\t int i;\n\t\t for(i=0;i<3;i++)\n\t\t {\n\t\t if(a[i]<min)\n\t\t min=a[i];\n\t\t }\n\t\t printf(\""%d\"",min);\n\t\t \n\t\t                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                   \n}",COMPILE_ERROR,0,0
1591653844386635776,54914c90623988219ee55c4a0b2e645efd9808505aa25f0099930bfa8bf18ad1,2022-11-13 12:47:02,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main(){\n\tint p,q,r;\n\tscanf(\""%d%d%d\"",&p,&q,&r);\n\tint a = p+r;\n\tint b = r+q;\n\tint c = q+p;\n\tint min = a;\n\tif(b < min){\n\t\tmin =b;\n\t}\n\tif(c<min){\n\t\tmin = c; \n\t}\n\tprintf(\""%d\"",min);\n} ",ACCEPTED,30,364
1591653873453162496,217f1946625720e554af7294d3599b943eea3b430c0df7aa0c5c70abe9904e56,2022-11-13 12:47:09,Java,0.0,1591610585635213318,1591131464941563904,1049226928954454016,import java.util.Scanner;\npublic class Main{\n    public static void main(String[] args){\n        Scanner sc=new Scanner(System.in);\n        int P=sc.nextInt();\n        int Q=sc.nextInt();\n        int R=sc.nextInt();\n        if(P+Q<=Q+R)\n        {\n            if(Q+R<=R+P)\n                System.out.println(P+Q);\n         }\n    }\n},WRONG_ANSWER,107,24780
1591653887487258624,20ffd83467b553ac24e1f4b8b096d58858684ca8c3f6a4d5a62be9ff7c4817da,2022-11-13 12:47:12,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#define MAX 10000\nint main()\n{\n    int i,j;\n    int n,H[MAX],x=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&H[i]);\n    for(i=1;i<n-3;i++){\n        if(H[i+1]<H[i]&&H[i+1]<H[i+2]){\n                x++;\n    }\n    if(H[i]==H[i+1]){\n            j=i;\n        while(H[j]==H[i])\n            j++;\n        if(H[j]>H[i]&&H[i-1]>H[i])\n            x++;\n    }\n\n    }\n    printf(\""%d\\n\"",x);\n}",ACCEPTED,27,368
1591653895938826240,c76414e1d2d8531a5745e9bd3192aafa7cca924e645650ffe7954c992cc13b33,2022-11-13 12:47:14,C,0.0,1591610585635213314,1591128862958940160,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x,i,j,t\n    scanf(\""%d\"",&x);\n    int a[x];\n    a[0]=x;\n    for(i=1;i<x;i++)\n        scanf(\""%d\"",&a[i];\n    for(i=0;i<x-1;i++)\n              for(j=0;j<x-1-i;j++)\n              {\n              if(a[j]<a[j+1])\n              {\n              t=a[j];\n              a[j]=a[j+1];\n              a[j+1]=t;\n              }\n              }\n              for(i=0;i<x;i++)\n              printf(\""%d\"",a[i]);\n\n}",COMPILE_ERROR,0,0
1591653910522421248,e0156cb930d51b3d5482d43809e7b2c1f54a6b8623fccfa3202e2e53ddf1ffbf,2022-11-13 12:47:18,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\nint a,b,c,sum;\nscanf(\""%d%d%d\"",&a,&b,&c,sum);\nsum=a+b&&a+c&&b+c;\nif(a+b<a+c<b+c);\n    printf(\""%d\\n\"",sum=a+b);\n    if\n        (a+c<a+b<b+c);\n    printf(\""%d\\n\"",sum=a+c);\n    if\n    (b+c<a+b<a+c)\n    printf(\""%d\\n\""sum=b+c);\n\n}\n",COMPILE_ERROR,0,0
1591653929455476736,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-13 12:47:22,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int p,q,r;\n    scanf(\""%d %d %d\"",&p,&q,&r);\n    int min=0,a,b,c;\n    \n}",WRONG_ANSWER,4,352
1591653931510718464,a8a4c649080a65381764d05b09cdced42bbf4a58e2656f96cfc5545fc9d08327,2022-11-13 12:47:23,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{   int P,Q,R,BE;\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    scanf(\""%d\"",&BE);\n    int A,B,C,min;\n    if(A==BE)\n    {\n        min=P+R;\n        printf(\""%d\"",min);\n    }\nelse if(B==BE)\n    {\n        min=Q+P;\n        printf(\""%d\"",min);\n    }\nelse\n    {\n        min=R+Q;\n        printf(\""%d\"",min);\n    }\n    return 0;\n}\n",WRONG_ANSWER,5,384
1591653948933812224,81f258582663b08bc9b4d77bba77afc3b463021ec8fb2262453de07687484cd5,2022-11-13 12:47:27,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"P,Q,R = input().split()\n\n\np = int(P)\nq = int(Q)\nr = int(R)\n\n \n\na =  p + q\nb = p + r\nc =  r +p\n\n#f= eval(a)\n#h= eval(b)\n#g= eval(c)\nd = min(a,b,c)\nif p >=1 and p <=10**3 and q >=1 and q <=10**3 and r >=1 and r <=10**3 :\n  print(d)\n",WRONG_ANSWER,16,2776
1591653985160015872,7935e8f5cb04027f4d30ac84a997e2d03e946e112c1cb17f1a4f943d8b0b54bf,2022-11-13 12:47:36,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <iostream>\n#include<stdio.h>\n#include<algorithm>\n\nusing namespace std;\n\nint main()\n{\n    int n,h=0,i;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=1;i<n-2;i++)\n    {\n        if(a[i]>a[i+1])\n            h=h+1;\n    }\n    printf(\""%d\"",h);\n    return 0;\n}\n",WRONG_ANSWER,9,472
1591654001152897024,4d1157ac6ad50cfc6ca5d6b3e1c2dd7f1ecc593df10ff6888d4207a4f1c03a35,2022-11-13 12:47:40,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int P,Q,R,sum1,sum2,sum3;\n    cin>>P>>Q>>R;\n    int min=3001;\n    sum1=P+Q;\n    if(sum1<=min)min=sum1;\n    sum2=P+R;\n    if(sum2<=min)min=sum2;\n    sum3=R+Q;\n    if(sum3<=min)min=sum3;\n    printf(\""%d\\n\"",min);\n    return 0;\n}",WRONG_ANSWER,6,320
1591654020568375296,c358160a3e618a44cd693944fe10043e6372f46bf7d517c3c3f583bd85b17c5e,2022-11-13 12:47:44,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"n, m ,y= map(int,input().split())\nif n>=m and n>=y:\n    max=n\nif m>=n and m>=y:\n    max=m\nif y>=n and y>=n:\n    max=y\nif n<=m and n<=y:\n    min=n\nif m<=n and m<=y:\n    min=m\nif y<=n and y<=n:\n    min=y\nprint(max+min)\n",WRONG_ANSWER,17,2752
1591654022904602624,6ba5ecacf3381a1e9382f99c413290eca40a071a563a618e5f36d66cbf9a5e1b,2022-11-13 12:47:45,C++,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<iostream>\n\nusing namespace std;\n\nint main(){\nint p,q,r;\nint sum=0;\ncin>>p>>q>>r;\nif (p<q)\n{\n     sum+=p;\n     if (q<r)\n        sum+=q;\n     else\n        sum+=r;\n}\nelse\n{\n     sum+=q;\n    if (p<r)\n        sum+=p;\n     else\n        sum+=r;\n}\n  cout<<sum;\n\n}\n",ACCEPTED,35,480
1591654084535705600,6383c93cbdef4af3eda29400a925819f16ad4afc8368e604ccd580cba7055bdd,2022-11-13 12:47:59,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint P,Q,R;\n\tif(scanf(\""%d %d %d\"",&P,&Q,&R)){\n\tif((P<Q&&Q<R)||(Q<P&&P<R)||(P==Q&&Q<R)||(P==R&&P>Q)||(Q==R&&R>P)){\n\t\tprintf(\""%d\"",P+Q);\n\t} \n\telse if((P<R&&R<Q)||(R<P&&P<Q)||(P==R&&R<Q)){\n\t\tprintf(\""%d\"",P+R);\n\t}\n\telse if((Q<R&&R<P)||(R<Q&&Q<P)||(P==Q&&Q>R)||(Q==R&&R<P)){\n\t\tprintf(\""%d\"",Q+R);\n\t}}\n\t\n\treturn 0; \n}",ACCEPTED,32,476
1591654102109794304,0ac60c8cba5dc039a812c57a79304a29dc187bee37ef204107b64c7a81bc6988,2022-11-13 12:48:04,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,list=input().split()\na=int(list[0])+int(list[1])\nb=int(list[1])+int(list[2])\nc=int(list[2])+int(list[0])\nif a>b:\n   min=b\nelse:\n   min=a\nif c<min:\n   min=c\nelse:\n   min=b\nprint(min),WRONG_ANSWER,16,2764
1591654160515489792,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-13 12:48:18,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int P,Q,R;\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    printf(\""从A到B花费%d块钱，从B到C花费%d块钱，从C到A花费%d块钱，此时所有地点都去过了，总花费为%d块钱。\"",P,Q,R,P+Q+R);\n    return 0;\n}",WRONG_ANSWER,4,200
1591654171961745408,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 12:48:20,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"P,Q,R=map(eval,input().split())\nnum1=P+Q\nnum2=P+R\nnum3=Q+R\nif num1<num2 and num1<num3:\n    print(num1)\n    if num2<num1 and num2<num3:\n        print(num2)\n        if num3<num2 and num3<num1:\n            print(num3)",WRONG_ANSWER,38,2892
1591654194308984832,6a835d762a87e93baf4142897168374dc31e9da90b86c19ed82f21159b644272,2022-11-13 12:48:26,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nmain()\n{\n    int a,b,c,X;\n    for(X=0;X<10;X++)\n    scanf(\""%d,%d,%d\"",&a,&b,&c);\n    X=a+b;\n    printf(\""%d\"",X);\n}\n",WRONG_ANSWER,6,196
1591654213544075264,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-13 12:48:30,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int P,Q,R;\n    printf(\""从A到B花费%d块钱，从B到C花费%d块钱，从C到A花费%d块钱，此时所有地点都去过了，总花费为%d块钱。\"",P,Q,R,P+Q+R);\n    return 0;\n}",WRONG_ANSWER,5,352
1591654220020068352,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-13 12:48:32,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nint main(){\n    int s[3],sum;\n    int max=0;\n    sum=0;\n    for(int i=0;i<3;i++)\n    {\n       scanf(\""%d\"",&s[i]);\n       max=(max>s[i])?max:s[i];\n       sum=sum+s[i];\n    }\n    sum=sum-max;\n    printf(\""%d\"",sum);\n    return 0;\n}",ACCEPTED,21,512
1591654247937355776,c358160a3e618a44cd693944fe10043e6372f46bf7d517c3c3f583bd85b17c5e,2022-11-13 12:48:38,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"n, m ,y= map(int,input().split())\nif n>=m and n>=y:\n    max=n\nif m>=n and m>=y:\n    max=m\nif y>=n and y>=n:\n    max=y\nif n<=m and n<=y:\n    min=n\nif m<=n and m<=y:\n    min=m\nif y<=n and y<=m:\n    min=y\nprint(max+min)\n",WRONG_ANSWER,19,2928
1591654248038064128,7c6d208c4c4b695bc8d6f8ae0c0357c2466f5c9f86ec0652674812219ac09d38,2022-11-13 12:48:38,Java,300.0,1591610585635213318,1591131464941563904,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\n\t\tint a  = sc.nextInt();\n\t\tint b  = sc.nextInt();\n\t\tint c  = sc.nextInt();\n\t\tint max = 0;\n\t\tif (a>b) {\n\t\t\tmax = a;\n\t\t}else {\n\t\t\tmax = b;\n\t\t}\n\t\tif (max<c) {\n\t\t\tmax = c;\n\t\t}\n\t\tSystem.out.println(a+b+c-max);\n\t\t\n\n\t}\n\n}\n,ACCEPTED,549,24740
1591654262428676096,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-13 12:48:42,Java,0.0,1591610585635213318,1591131464941563904,1049226928954454016,import java.util.Scanner;\n\npublic class Main{\n    public static void main(String[] args){\n        Scanner sc = new Scanner(String[] args);\n        int p = sc.nextInt();\n        int q = sc.nextInt();\n        int r = sc.nextInt();\n        int count = 0;\n        \n        if(p+q < p+r && p+q < q+r){\n            count = p+q;\n        }else{\n            if(p+r < p+q && p+r < q+r){\n                count = p+r;\n            }else(q+r < p+q && q+r < p+r){\n                    count = q+r;\n            }\n        }\n        \n        System.out.println(count);\n    }\n},COMPILE_ERROR,0,0
1591654265163374592,0354b067c4132d4425a90b77482ac717447702274cb7db1282edce56eaf037b3,2022-11-13 12:48:42,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main(){\n\tint n,i,j,a[100],count;\n\tcount=0;\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++)\n\t    scanf(\""%d\"",&a[i]);\n\tfor(i=1;i<n-1;i++){\n\t\tif(a[i]<a[i-1]&&a[i]<=a[i+1])\n\t\t    count++;\n\t}\n\tprintf(\""%d\"",count);\n} ",RUNTIME_ERROR,28,512
1591654267449257984,bce383372e0b1b627f0a9b838121096ec3ca14c0f213828fca1bf517a82c8744,2022-11-13 12:48:43,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int P,Q,R,sum[3],min,i;\n    printf(\""请输入三个整数：\\n\"");\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    min=P+Q;\n    sum[0]=P+Q;\n    sum[1]=P+R;\n    sum[2]=Q+R;\n    for(i=0;i<=2;i++)\n    {\n        if(min>sum[i])\n            printf(\""%d\"",sum[i]);\n\n        else\n            printf(\""%d\"",min);\n    }\n}",WRONG_ANSWER,7,496
1591654276597047296,23d287b80d4d430308a1b57ee92bb4f2d1b25d1142a13c1c0fda4316c9bb9f17,2022-11-13 12:48:45,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,a=int(input());\nb=[];\nb=input();\nprint(a)；\n,NON_ZERO_EXIT_CODE,15,2760
1591654290459254784,7935e8f5cb04027f4d30ac84a997e2d03e946e112c1cb17f1a4f943d8b0b54bf,2022-11-13 12:48:49,C++,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <iostream>\n#include<stdio.h>\n#include<algorithm>\n\nusing namespace std;\n\nint main()\n{\n    int n,h=0,i;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=1;i<n-2;i++)\n    {\n        if(a[i]>a[i+1]&&a[i+1]<=a[i+2])\n            h=h+1;\n    }\n    printf(\""%d\"",h);\n    return 0;\n}\n",ACCEPTED,43,484
1591654300798169088,cb5ee28f5d61aba010f231fd6045de7f8516849eb1dbf293dc5a73a02c3aea2f,2022-11-13 12:48:51,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int P,Q,R,sum[3],i,min;\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    min=P+Q;\n    sum[0]=P+Q;\n    sum[1]=R+Q;\n    sum[2]=P+R;\n    for(i=0,sum[i],i++)\n    {\n        if(sum[i]<min)\n            printf(\""%d\"",sum[i]);\n        else\n            printf(\""%d\"",min);\n    }\n}",COMPILE_ERROR,0,0
1591654307836223488,361d4ab0fa1284b9bf8a3ba65da408861b894c5c0617b83f77f2c1d9a1a3ec92,2022-11-13 12:48:53,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"p,q,r=input().split()\nx=int(p)+int(q)\ny=int(q)+int(r)\nz=int(p)+int(r)\nif x<y<z:\n    print(x)\nif y<x<z:\n    print(y)\nif x<=y<=z:\n    print(x)\nelse:\n    print(z)\n\n",WRONG_ANSWER,15,2888
1591654339037638656,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-13 12:49:00,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <math.h>\n#include <stdio.h>\nint main()\n{\n    int a,b,c,min=1000;\n    scanf(\""%d\"",&a);\n    scanf(\""%d\"",&b);\n    scanf(\""%d\"",&c);\n    if(a+b<min) min=a+b;\n    if(c+b<min) min=c+b;\n    printf(\""%d\"",min);\n}",WRONG_ANSWER,6,200
1591654344129536000,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-13 12:49:01,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int P=3,Q=2,R=3;\n    printf(\""从A到B花费%d块钱，从B到C花费%d块钱，从C到A花费%d块钱，此时所有地点都去过了，总花费为%d块钱。\"",P,Q,R,P+Q+R);\n    return 0;\n}",WRONG_ANSWER,10,468
1591654345681428480,c76414e1d2d8531a5745e9bd3192aafa7cca924e645650ffe7954c992cc13b33,2022-11-13 12:49:02,C,0.0,1591610585635213314,1591128862958940160,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x,i,j,t;\n    scanf(\""%d\"",&x);\n    int a[x];\n    a[0]=x;\n    for(i=1;i<x;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<x-1;i++)\n              for(j=0;j<x-1-i;j++)\n              {\n              if(a[j]<a[j+1])\n              {\n              t=a[j];\n              a[j]=a[j+1];\n              a[j+1]=t;\n              }\n              }\n              for(i=0;i<x;i++)\n              printf(\""%d \"",a[i]);\n\n}\n",WRONG_ANSWER,13,200
1591654349393375232,0354b067c4132d4425a90b77482ac717447702274cb7db1282edce56eaf037b3,2022-11-13 12:49:03,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main(){\n\tint n,i,a[100],count;\n\tcount=0;\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++)\n\t    scanf(\""%d\"",&a[i]);\n\tfor(i=1;i<n-1;i++){\n\t\tif(a[i]<a[i-1]&&a[i]<=a[i+1])\n\t\t    count++;\n\t}\n\tprintf(\""%d\"",count);\n} ",RUNTIME_ERROR,22,348
1591654355382841344,64475a8ecd7d5a6c6e734f3f299283e039c26933b2a0e510cd9d22e95ba92068,2022-11-13 12:49:04,C++,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <iostream>\n#include <cstdio>\n#include <fstream>\n#include <algorithm>\n#include <cmath>\n#include <deque>\n#include <vector>\n#include <queue>\n#include <string>\n#include <cstring>\n#include <map>\n#include <stack>\n#include <set>\nusing namespace std;\n\n\nint main()\n{\n    int a[3];\n    for(int i = 0; i < 3; i++)\n        cin>>a[i];\n\n    sort(a,a+3);\n\n    cout<<a[0]+a[1];\n\n    return 0;\n}\n",ACCEPTED,50,604
1591654360210497536,190178fcb71270e17fbe689a22517f5296281dfcd3b16ec01748057e49740d1d,2022-11-13 12:49:05,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n    int P,Q,R,X,Y,Z;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    X=P+Q;\n    Y=Q+R;\n    Z=R+P;\n    if(X<=Y||X<=Z)\n    printf(\""%d\"",X);\n    else if(Y<=X||Y<=Z)\n    printf(\""%d\"",Y);\n    else if(Z<=X||Z<=Y)\n    printf(\""%d\"",Z);\n    return 0;\n}",WRONG_ANSWER,9,332
1591654371870650368,345826d11b41befc23adeb536e81da8eb6ec9a8bfb9448acf91422deedb8ba4a,2022-11-13 12:49:08,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n main()\n{\n    int i,n,count=0,j;\n    scanf(\""%d\"",&n);\n    char s[n];\n    for(i=0;i<n;)\n       {\n           s[i]=getchar();\n           if(s[i]=='0'||s[i]=='1')\n            i++;\n       }\n\n    for(i=0;i<n;)\n    {\n        if(s[i]==s[i+1])\n            {\n               for(j=i;j<=n;j++)\n                    s[j]=s[j+2];\n                i=0;\n                count+=2;\n            }\n            else\n                i=i+1;\n    }\n    printf(\""%d\\n\"",count);\n}\n",WRONG_ANSWER,5,452
1591654384306806784,eee658ba43cf6fba46676f4d9f167223fd9b57ec54a5d813fd1d01afc3088139,2022-11-13 12:49:11,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}\n",ACCEPTED,5,328
1591654392766717952,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-13 12:49:13,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n\n\n//O(N)\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"",&n);\n    \n    int arr[n];\n    int i = 0;\n    for(i = 0; i < n; ++i){\n        scanf(\""%d\"",&arr[i]);\n    }\n    \n    int width = 1;\n    int j = 0;\n    int mul = 1;\n    int max = 0;\n    for(i = 0; i < n; ++i){\n        for(j = i + 1; j < n; ++j){\n            if(arr[i] <= arr[j]){\n                ++wed;\n            }\n            else{\n                break;\n            }\n        }\n        mul = wed * arr[i];\n        if(mul > max){\n            max = mul;\n        }\n    }\n    \n    printf(\""%d\"",max);\n    \n    return 0;\n}\n\n\n/*\nint main(){\n    int n = 0;\n    scanf(\""%d\"",&n);\n    \n    int arr[n];\n    for(int i = 0; i < n; +i){\n        scanf(\""%d\"",&arr[i]);\n    }\n    \n    \n    \n    \n    return 0;\n}\n*/\n",COMPILE_ERROR,0,0
1591654395195187200,6a6dc7e644e57bb2c20b20d39bd4d9541bdebf6415e03e7c13707572c054673e,2022-11-13 12:49:13,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{  int n,a,b;\n\n   scanf(\""%d %d %d\"",&n,&a,&b);\n   printf(\""5\"");\n    return 0;\n}",WRONG_ANSWER,6,320
1591654422143578112,345826d11b41befc23adeb536e81da8eb6ec9a8bfb9448acf91422deedb8ba4a,2022-11-13 12:49:20,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,n,count=0,j;\n    scanf(\""%d\"",&n);\n    char s[n];\n    for(i=0;i<n;)\n       {\n           s[i]=getchar();\n           if(s[i]=='0'||s[i]=='1')\n            i++;\n       }\n\n    for(i=0;i<n;)\n    {\n        if(s[i]==s[i+1])\n            {\n               for(j=i;j<=n;j++)\n                    s[j]=s[j+2];\n                i=0;\n                count+=2;\n            }\n            else\n                i=i+1;\n    }\n    printf(\""%d\\n\"",count);\n}\n",WRONG_ANSWER,6,376
1591654439491231744,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-13 12:49:24,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int P=3,Q=2,R=3;\n    printf(\""从A到B花费%d块钱，从B到C花费%d块钱，此时所有地点都去过了，总花费为%d块钱。\"",P,Q,P+Q);\n    return 0;\n}",WRONG_ANSWER,7,384
1591654450723565568,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-13 12:49:27,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n\n\n//O(N)\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"",&n);\n    \n    int arr[n];\n    int i = 0;\n    for(i = 0; i < n; ++i){\n        scanf(\""%d\"",&arr[i]);\n    }\n    \n    int width = 1;\n    int j = 0;\n    int mul = 1;\n    int max = 0;\n    for(i = 0; i < n; ++i){\n        for(j = i + 1; j < n; ++j){\n            if(arr[i] <= arr[j]){\n                ++width;\n            }\n            else{\n                break;\n            }\n        }\n        mul = wed * arr[i];\n        if(mul > max){\n            max = mul;\n        }\n    }\n    \n    printf(\""%d\"",max);\n    \n    return 0;\n}\n\n\n/*\nint main(){\n    int n = 0;\n    scanf(\""%d\"",&n);\n    \n    int arr[n];\n    for(int i = 0; i < n; +i){\n        scanf(\""%d\"",&arr[i]);\n    }\n    \n    \n    \n    \n    return 0;\n}\n*/\n",COMPILE_ERROR,0,0
1591654453194010624,0ccbaaa612b3d01dbe621ce5e7366d6e26d2e5adf55047d92c6eb7adf78a979d,2022-11-13 12:49:27,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int n;cin>>n;\n    int a[n];\n    int maxArea=0;\n    for(int i=0;i<n;i++) cin>>a[i];\n    for(int i=0;i<n-1;i++)\n    {\n        int t,count=1;\n        for(int j=i+1;j<n;j++)\n        {\n            if(a[j]>=a[i]) {count++;continue;}\n            else break;\n        }\n        t=count*a[i];\n        if(t>maxArea) maxArea=t;\n    }\n    if(a[n-1]>maxArea) maxArea=a[n-1];\n    cout<<maxArea;\n    return 0;\n}\n",WRONG_ANSWER,19,612
1591654467366608896,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 12:49:31,Python,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"P,Q,R=map(eval,input().split())\nnum1 = P+Q\nnum2 = P+R\nnum3 = Q+R\nif num1<num2 and num1<num3:\n    print(num1)\nif num2<num1 and num2<num3:\n    print(num2)\nif num3<num2 and num3<num1:\n            print(num3)",ACCEPTED,89,3072
1591654477298688000,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-13 12:49:33,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <math.h>\n#include <stdio.h>\nint main()\n{\n    int a,b,c,min=1000;\n    scanf(\""%d\"",&a);\n    scanf(\""%d\"",&b);\n    scanf(\""%d\"",&c);\n    if(a+b<min) min=a+b;\n    if(c+b<min) min=c+b;\n    if(a+c<min) min=a+c;\n    printf(\""%d\"",min);\n}",WRONG_ANSWER,6,196
1591654489097297920,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-13 12:49:36,Java,0.0,1591610585635213318,1591131464941563904,1049226928954454016,import java.util.Scanner;\n\npublic class Main{\n    public static void main(String[] args){\n        Scanner sc = new Scanner(String[] args);\n        int p = sc.nextInt();\n        int q = sc.nextInt();\n        int r = sc.nextInt();\n        int count = 0;\n        \n        if(p+q < p+r && p+q < q+r){\n            count = p+q;\n        }else{\n            if(p+r < p+q && p+r < q+r){\n                count = p+r;\n            }else{\n                if(q+r < p+q && q+r < p+r){\n                    count = q+r;\n                }\n            }\n        }\n        \n        System.out.println(count);\n    }\n},COMPILE_ERROR,0,0
1591654497775312896,e0156cb930d51b3d5482d43809e7b2c1f54a6b8623fccfa3202e2e53ddf1ffbf,2022-11-13 12:49:38,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\nint a,b,c,sum;\nscanf(\""%d%d%d\"",&a,&b,&c,sum);\nsum=a+b&&a+c&&b+c;\nif(a+b<a+c<b+c);\n    printf(\""%d\\n\"",sum=a+b);\n    return 0;\n\n}\n",WRONG_ANSWER,14,324
1591654542113255424,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 12:49:49,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <string.h>\nint main()\n{\n    int k,len,i,g,l;\n    char str[10] = {0};\n    scanf(\""%d\"",&k);\n    scanf(\""%s\"",str);\n    len  = strlen(str);\n    for(i=0;i<len;i++)\n    {\n        if(str[i]=='0')\n        g++;\n        else\n        l++;\n    }\n    g-=8;//0的个数;\n    l-=52;//1的个数;\n    if(g>l)\n    printf(\""%d\\n\"",2*l);\n    else\n    printf(\""%d\\n\"",2*g);\n    return 0;\n}\n",RUNTIME_ERROR,9,196
1591654543082139648,b95d43d4e550820a57e0a7b63f63233a65cb813e77be0e6c08c1739f86678946,2022-11-13 12:49:49,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint min(int P,int Q,int R)\n{\n    int m1,m2,m3,min;\n    m1=P+Q;\n    m2=P+R;\n    m3=Q+R;\n    if(m1>m2)\n    {\n        min=m2;\n        if(m2>m3)\n            min=m3;\n        else\n            min=m2;\n    }\n    else\n    {\n        min=m1;\n        if(m1>m3)\n            min=m3;\n        else\n            min=m1;\n    }\n    return min;\n}\nint main()\n{\n    int P,Q,R,dis;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    dis=min(P,Q,R);\n    printf(\""%d\"",dis);\n    return 0;\n}\n",ACCEPTED,29,348
1591654565068693504,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-13 12:49:54,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n\n\n//O(N)\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"",&n);\n    \n    int arr[n];\n    int i = 0;\n    for(i = 0; i < n; ++i){\n        scanf(\""%d\"",&arr[i]);\n    }\n    \n    int width = 1;\n    int j = 0;\n    int mul = 1;\n    int max = 0;\n    for(i = 0; i < n; ++i){\n        for(j = i + 1; j < n; ++j){\n            if(arr[i] <= arr[j]){\n                ++width;\n            }\n            else{\n                break;\n            }\n        }\n        mul = width * arr[i];\n        \n        if(mul > max){\n            max = mul;\n        }\n    }\n    \n    printf(\""%d\"",max);\n    \n    return 0;\n}\n\n\n",WRONG_ANSWER,4,348
1591654566670905344,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-11-13 12:49:54,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int n;\n    int s1,s2,s3,s4;\n    scanf(\""%d\\n\"",&n);\n    scanf(\""%d%d%d%d\"",&s1,&s2,&s3,&s4);\n    printf(\""%d\"",4);\n    return 0;\n}",WRONG_ANSWER,13,344
1591654590460997632,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-13 12:50:00,Java,0.0,1591610585635213318,1591131464941563904,1049226928954454016,import java.util.Scanner;\n\npublic class Main{\n    public static void main(String[] args){\n        Scanner sc = new Scanner(String[] args);\n        int p = sc.nextInt();\n        int q = sc.nextInt();\n        int r = sc.nextInt();\n        int count = 0;\n        \n        if(p+q < p+r && p+q < q+r){\n            count = p+q;\n        }else{\n            if(p+r < p+q && p+r < q+r){\n                count = p+r;\n            }else{\n                if(q+r < p+q && q+r < p+r){\n                    count = q+r;\n                }\n            }\n        }\n        \n        System.out.println(count);\n    }\n},COMPILE_ERROR,0,0
1591654613634572288,b80fc2aed0abde15bdaa9327874c9784da696b6ed442d90001602ff2a017be15,2022-11-13 12:50:06,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h> \n#include<math.h> \nint main()\n{\n     int n,i,sum=0;\n\t int a[10000];\n\t scanf(\""%d\"",&n);\n\t for(i=0;i<n;i++)\n\t  scanf(\""%d\"",&a[i]);\n     for(i=0;i<n-1;i++)\n\t  if(((a[i]-a[i+1])>0)&&((a[i+1]-a[i+2])<=0))\n\t    sum=sum+1;\n      sum=sum-1; \n\tprintf(\""%d\"",sum);\n\tprintf(\""\\n\"");\t  \n\t  return 0; \n}",ACCEPTED,38,512
1591654616117567488,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-13 12:50:06,Python,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"import math\nlist1 = map(eval,input().split())\nlist2 = map(eval,input().split())\nlist3 = map(eval,input().split())\nprint(\""84\"")",WRONG_ANSWER,16,2884
1591654646098485248,acfcf65f14b5d3b02c3225372654b4e21f04d33a8bbaeb346e4fb1d85f2ea94f,2022-11-13 12:50:13,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n=\n    int X[]={a,b,c};\n    \n    \n}",COMPILE_ERROR,0,0
1591654655506264064,f55f4c0e0e3367434e26a462e3665271f5b4141ea3de4f34d96fdb21d67e2a7c,2022-11-13 12:50:16,C,0.0,1591610585635213313,1589906790446387200,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int p,q,r,a,b,c;\n scanf(\""%d%d%d\"",&p,&q,&r);\n a=q+p;\n b=q+r;\n c=p+r;\n if(a<b)\n    printf(\""%d\"",a);\n else\n    printf(\""%d\"",b);\n\n\n\n\n\n\n    return 0;\n}\n",WRONG_ANSWER,5,200
1591654689513693184,acfcf65f14b5d3b02c3225372654b4e21f04d33a8bbaeb346e4fb1d85f2ea94f,2022-11-13 12:50:24,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int P=3,Q=2,R=5,i;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    printf(\""%d\"",P+Q);\n    return 0;\n}",WRONG_ANSWER,12,344
1591654691912867840,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-13 12:50:24,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"include<stdio.h>\nint main()\n{\n    int i,n;\n    int a[100],sum[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n        \n    }\n    for(j=0;j<n;j++){\n        int x=1;\n        for(i=0;i<n;i++)\n        {\n            if(a[j]<=a[i+1])\n                x++;\n\n        }\n        sum[j]=x*a[j];\n    }\n    for(j=0;j<n;j++)\n    {\n        int max;\n        if(sum[j]>=max)\n        {\n            max=sum[j];\n            \n         }   \n    }\n    printf(\""%d\"",max);\n    return 0;\n}",COMPILE_ERROR,0,0
1591654691929612288,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-13 12:50:24,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"eval(input())\n1<=P,Q,R<=1000\na=P+Q\nb=Q+R\nc=R+P\nif a<b:\n   if a<c:\n    print(a)\nif b<a:\n   if b<c:\n    print(b)\nif c<a:\n   if c<b:\n    print(c)\n",NON_ZERO_EXIT_CODE,16,2912
1591654709516316672,f55f4c0e0e3367434e26a462e3665271f5b4141ea3de4f34d96fdb21d67e2a7c,2022-11-13 12:50:28,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int p,q,r,a,b,c;\n scanf(\""%d%d%d\"",&p,&q,&r);\n a=q+p;\n b=q+r;\n c=p+r;\n if(a<b)\n    printf(\""%d\"",a);\n else\n    printf(\""%d\"",b);\n\n\n\n\n\n\n    return 0;\n}\n",ACCEPTED,35,368
1591654715698720768,542d97133043a1f2156354473a31382c35bb2836688b0ed76eae59c52a2e0e3a,2022-11-13 12:50:30,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main()\n{\n    int p,q,r;\n    int m,n,o;\n    scanf(\""%d %d %d\"",&p,&q,&r);\n    m=p+q;\n    n=p+r;\n    o=q+r;\n    if(m<n)\n    {\n        n=o;\n        if(m<o)\n            printf(\""%d\"",m);\n        else\n            printf(\""%d\"",o);\n    }\n    else\n    {\n        m=n;\n        if(m<o)\n            printf(\""%d\"",m);\n        else\n            printf(\""%d\"",o);\n    }\n}",ACCEPTED,31,512
1591654718341144576,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-13 12:50:31,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nint main() {\n\t     int a,b,c,d[3],min;\n\t\t scanf(\""%d %d %d\"",&a,&b,&c);\n\t\t min=a+b;\n\t\t d[0]=min;\n\t\t d[1]=b+c;\n\t\t d[2]=a+c;\n\t\t int i;\n\t\t for(i=0;i<3;i++)\n\t\t {\n\t\t if(d[i]<min)\n\t\t min=d[i];\n\t\t }\n\t\t printf(\""%d\"",min);\n\t\t \n\t\t                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                   \n}",ACCEPTED,31,512
1591654752134684672,bce383372e0b1b627f0a9b838121096ec3ca14c0f213828fca1bf517a82c8744,2022-11-13 12:50:39,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int P,Q,R,sum[3],min,i;\n    printf(\""请输入三个整数：\\n\"");\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    min=P+Q;\n    sum[0]=P+Q;\n    sum[1]=P+R;\n    sum[2]=Q+R;\n    if(P!=Q&&P!=R&&Q!=R)\n        for(i=0;i<=2;i++)\n        {\n            if(min>sum[i])\n                printf(\""%d\"",sum[i]);\n\n            else\n                printf(\""%d\"",min);\n    }\n}",WRONG_ANSWER,9,196
1591654768886702080,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-13 12:50:43,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\nint main(void)\n{\n    int P=3,Q=2,R=3;\n    printf(\""从A到B花费%d块钱，从B到C花费%d块钱，此时所有地点都去过了，总花费为%d块钱。\"",P,Q,P+Q);\n    return 0;\n}",WRONG_ANSWER,7,196
1591654769574567936,423e1acd0d02cf3d43f3c7805099dea4edcb39c2e0fa385e82823b5a7c0dd214,2022-11-13 12:50:43,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int p,q,r;\n    scanf(\""%d\"",&p);\n    scanf(\""%d\"",&q);\n    scanf(\""%d\"",&r);\n    int min;\n    min=p+q;\n    if(p+r<min)\n        min=p+r;\n    if(q+r<min)\n        min=q+r;\n    printf(\""%d\\n\"",min);\n    return 0;\n}\n",ACCEPTED,44,492
1591654819172245504,7ecf54bf0ea2db8ab0397aa941f19ec79a351bc3e86e8c01673aa09a69b3a6db,2022-11-13 12:50:55,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n\tint a,b,c;\n\tint num[3];\n\tscanf(\""%d %d %d\"",&a,&b,&c);\n\tif(a<b)\n\t{\n\t\tnum[0]=a;\n\t\tnum[1]=b;\n\t}\n\telse\n\t{\n\t\tnum[0]=b;\n\t\tnum[1]=a;\t\t\n\t}\n\tif(c<num[1])printf(\""%d\\n\"",num[0]+c);\n\telse\n\t{\n\t\tprintf(\""%d\\n\"",num[0]+num[1]);\n\t}\n}",ACCEPTED,36,512
1591654833277689856,d122b81a371b28751082747cf65a235d0eddfd496e142775cd971d8f88adf327,2022-11-13 12:50:58,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int a,b,c;\n    scanf(\""%d%d%d\"",&a,&b,&c);\n    int min=0;\n    min=a+b;\n    if(a+c<=min&&b+c>min){\n        min=a+c;\n        printf(\""%d\\n\"",min);\n    }\n    if(b+c<=min&&a+c>min){\n        min=b+c;\n        printf(\""%d\\n\"",min);\n    }\n    if(b+c>min&&a+c>min){\n        printf(\""%d\\n\"",min);\n    }\n    return 0;\n}",WRONG_ANSWER,23,204
1591654856002428928,cf76a6e5773cf2f19ddd635fa646c5a6721f6fed8998d22ea1d0910bee8017a2,2022-11-13 12:51:03,C,0.0,1591610585635213314,1591128862958940160,1049226928954454016,"#include<stdio.h>\n#define N 30\nint main()\n{\n    int n,i,j,t;\n    int a[N],b[N];\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n-1;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n-1;i++)\n    {\n        for(j=0;j<3;j++)\n        {\n            if(a[j]<a[j+1])\n          {\n             t=a[j];\n             a[j]=a[j+1];\n             a[j+1]=t;\n           }\n        }\n    }\n    printf(\""%d \"",n);\n    for(i=0;i<n-1;i++)\n        printf(\""%d \"",a[i]);\n}\n",SEGMENTATION_FAULT,5,324
1591654864441335808,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-13 12:51:05,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,n;\n    int a[100],sum[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n        \n    }\n    for(j=0;j<n;j++){\n        int x=1;\n        for(i=0;i<n;i++)\n        {\n            if(a[j]<=a[i+1])\n                x++;\n\n        }\n        sum[j]=x*a[j];\n    }\n    for(j=0;j<n;j++)\n    {\n        int max;\n        if(sum[j]>=max)\n        {\n            max=sum[j];\n            \n         }   \n    }\n    printf(\""%d\"",max);\n    return 0;\n}",COMPILE_ERROR,0,0
1591654876642598912,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-13 12:51:08,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"eval(input(P,Q,R))\n1<=P,Q,R<=1000\na=P+Q\nb=Q+R\nc=R+P\nif a<b:\n   if a<c:\n    print(a)\nif b<a:\n   if b<c:\n    print(b)\nif c<a:\n   if c<b:\n    print(c)\n",NON_ZERO_EXIT_CODE,15,2756
1591654913221091328,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-13 12:51:17,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    int n,i,j,k=0;\n    int a[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<10;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=1;j<n-1;j++)\n    {\n        if(a[j]=0)\n        {\n            k++;\n        }\n    }\n    printf(\""%d\\n\"",k);\n}",WRONG_ANSWER,5,324
1591654914114465792,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-13 12:51:17,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,j,n;\n    int a[100],sum[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n        \n    }\n    for(j=0;j<n;j++){\n        int x=1;\n        for(i=0;i<n;i++)\n        {\n            if(a[j]<=a[i+1])\n                x++;\n\n        }\n        sum[j]=x*a[j];\n    }\n    for(j=0;j<n;j++)\n    {\n        int max;\n        if(sum[j]>=max)\n        {\n            max=sum[j];\n            \n         }   \n    }\n    printf(\""%d\"",max);\n    return 0;\n}",COMPILE_ERROR,0,0
1591654919462248448,44042a4519c9231aa21c54eb113b7a08f98bcd7db4839a20a61ab6ce51fce357,2022-11-13 12:51:18,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,k=0;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=1;i<n-4;i++)\n    {\n        if(a[i]>a[i+1]&&a[i+1]<a[i+2])\n            k++;\n        if(a[i]>a[i+1])\n            if(a[i+1]>=a[i+2]&&a[i+2]<a[i+3])\n                k++;\n    }\n    printf(\""%d\"",k);\n\n\n\n\n    return 0;\n}\n",WRONG_ANSWER,9,476
1591654948021264384,bce383372e0b1b627f0a9b838121096ec3ca14c0f213828fca1bf517a82c8744,2022-11-13 12:51:25,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int P,Q,R,sum[3],min,i;\n    printf(\""请输入三个整数：\\n\"");\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    min=P+Q;\n    sum[0]=P+Q;\n    sum[1]=P+R;\n    sum[2]=Q+R;\n    if(P!=Q||P!=R||Q!=R)\n        for(i=0;i<=2;i++)\n        {\n            if(min>sum[i])\n                printf(\""%d\"",sum[i]);\n\n            else\n                printf(\""%d\"",min);\n    }\n}",WRONG_ANSWER,5,212
1591654950948888576,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-13 12:51:26,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    int n,i,j,k=0;\n    int a[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<10;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=1;j<n-1;j++)\n    {\n        if(a[j]==0)\n        {\n            k++;\n        }\n    }\n    printf(\""%d\\n\"",k);\n}",WRONG_ANSWER,5,196
1591654970083258368,cf76a6e5773cf2f19ddd635fa646c5a6721f6fed8998d22ea1d0910bee8017a2,2022-11-13 12:51:31,C,0.0,1591610585635213314,1591128862958940160,1049226928954454016,"#include<stdio.h>\n#define N 30\nint main()\n{\n    int n,i,j,t;\n    int a[N],b[N];\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n-1;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n-1;i++)\n    {\n        for(j=0;j<3;j++)\n        {\n            if(a[j]<a[j+1])\n          {\n             t=a[j];\n             a[j]=a[j+1];\n             a[j+1]=t;\n           }\n        }\n    }\n    printf(\""%d \"",n);\n    for(i=0;i<n-1;i++)\n        printf(\""%d \"",a[i]);\n}\n",SEGMENTATION_FAULT,7,204
1591654987577712640,73af9d5098be5d450fba728363c8fdbe0f6a5526466daa2f3b74abf1acf75527,2022-11-13 12:51:35,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int n,a,b;\n    int i=0;\n    int c[1000],F[1000];\n    int sum=0;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&c[i]);\n        \n    }\n    for(i=0;i<n;i)\n    {\n        scanf(\""%d\"",&F[i]);\n        \n    }\n    for(i=0;i<n;i+=2)\n    {\n        sum+=(c[i]/(F[i]+1))*pow(a,F[i]+1 )+(c[i+1]/(F[i+1]+1))*pow(a,F[i+1]+1 )-((c[i]/(F[i]+1))*pow(b,F[i]+1 )+(c[i+1]/(F[i+1]+1))*pow(b,F[i+1]+1 ));\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",TIME_LIMIT_EXCEEDED,400,324
1591654998801670144,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-13 12:51:37,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,j,n;\n    int a[100],sum[100];\n    int max;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n        \n    }\n    for(j=0;j<n;j++){\n        int x=1;\n        for(i=0;i<n;i++)\n        {\n            if(a[j]<=a[i+1])\n                x++;\n\n        }\n        sum[j]=x*a[j];\n    }\n    for(j=0;j<n;j++)\n    {\n       \n        if(sum[j]>=max)\n        {\n            max=sum[j];\n            \n         }   \n    }\n    printf(\""%d\"",max);\n    return 0;\n}",WRONG_ANSWER,6,508
1591655006246547456,cf76a6e5773cf2f19ddd635fa646c5a6721f6fed8998d22ea1d0910bee8017a2,2022-11-13 12:51:39,C,0.0,1591610585635213314,1591128862958940160,1049226928954454016,"#include<stdio.h>\n#define N 30\nint main()\n{\n    int n,i,j,t;\n    int a[N],b[N];\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n-1;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n-1;i++)\n    {\n        for(j=0;j<3;j++)\n        {\n            if(a[j]<a[j+1])\n          {\n             t=a[j];\n             a[j]=a[j+1];\n             a[j+1]=t;\n           }\n        }\n    }\n    printf(\""%d \"",n);\n    for(i=0;i<n-1;i++)\n        printf(\""%d \"",a[i]);\n}\n",SEGMENTATION_FAULT,14,640
1591655012709969920,4d1157ac6ad50cfc6ca5d6b3e1c2dd7f1ecc593df10ff6888d4207a4f1c03a35,2022-11-13 12:51:41,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int P,Q,R,sum1,sum2,sum3;\n    cin>>P>>Q>>R;\n    int min=3001;\n    sum1=P+Q;\n    sum2=P+R;\n    sum3=R+Q;\n    if(sum1<=min)min=sum1;\n    if(sum2<=min)min=sum2;\n    if(sum3<=min)min=sum3;\n    printf(\""%d\\n\"",min);\n    return 0;\n}",WRONG_ANSWER,6,324
1591655031722795008,17759f531671f838bf3fae4270190e93b6109026f9503f986c1ed85bb412007d,2022-11-13 12:51:45,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,j,n,a[1000],sum=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=1;i<n-1;i++)\n    {\n        if(a[i]<a[i-1])\n        {\n            if(a[i]<a[i+1])\n            {\n                sum++;\n            }\n            else if(a[i]==a[i+1])\n            {\n                for(j=i+1;a[j]==a[i];j++)\n                {\n                    if(a[i]<a[j+1])\n                    {\n                        sum++;\n                        i=j;\n                    }\n                }\n            }\n         }\n    }\n    printf(\""%d\"",sum);\n}",ACCEPTED,43,460
1591655040748937216,ddd0edd80a23dfec88d0679f4ed6037779b80d26db4ba0f74fecb3d447de61fa,2022-11-13 12:51:47,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#define Max 100000\nint main(){\n    int n,j=0,i,flag=0;\n    int a[Max];\n    scanf(\""%d\"",&n);\n    while(n){\n        scanf(\""%d\"",&a[j]);\n        n--;\n        j++;\n    }\n    for(i=0;i<=j-5;i++){\n        if(a[i]<a[i+1])\n            if(a[i+1]>a[i+2])\n                flag++;\n    }\n    printf(\""%d\"",flag);\n}",WRONG_ANSWER,21,332
1591655052224520192,0ccbaaa612b3d01dbe621ce5e7366d6e26d2e5adf55047d92c6eb7adf78a979d,2022-11-13 12:51:50,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int n;cin>>n;\n    long long int a[n];\n    int maxArea=0;\n    for(int i=0;i<n;i++) cin>>a[i];\n    for(int i=0;i<n-1;i++)\n    {\n        int t,count=1;\n        for(int j=i+1;j<n;j++)\n        {\n            if(a[j]>=a[i]) {count++;continue;}\n            else break;\n        }\n        t=count*a[i];\n        if(t>maxArea) maxArea=t;\n    }\n    if(a[n-1]>maxArea) maxArea=a[n-1];\n    cout<<maxArea;\n    return 0;\n}\n",WRONG_ANSWER,27,604
1591655064216068096,6a6dc7e644e57bb2c20b20d39bd4d9541bdebf6415e03e7c13707572c054673e,2022-11-13 12:51:53,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{  int m,n,a,b;\n\n   scanf(\""%d %d %d\"",&n,&a,&b);\n    m=n+a;\n   printf(\""%d\"",m);\n    return 0;\n}\n",WRONG_ANSWER,18,332
1591655064673202176,f6233bf69e5717913375f818af07214d1d2de6df0cd3bcb24368fbde112d6d15,2022-11-13 12:51:53,Python,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"P, Q, R = (input().split())\nP = int(P)\nQ = int(Q)\nR = int(R)\nmin = 0\nif P+Q < Q+R:\n    if P+Q < P+R:\n        min = P+Q\n    else:\n        min = P+R\nelse:\n    if Q+R < P+R:\n        min = Q+R\n    else:\n        min = P+R\nprint(min)",ACCEPTED,96,3184
1591655068326453248,15ac7d06a472ca25d78349f7cc3a73d23c7d7a4f0c4ae3cec6200fcdb8135965,2022-11-13 12:51:54,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    int a[500];\n    int i;\n    for(i=1;i<=n-1;i++)\n        if(a[i]==a[i+1]){\n            s++;\n        }\n   printf(\""%d\"",s);\n    \n    return 0;\n}\n",COMPILE_ERROR,0,0
1591655074383060992,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-13 12:51:55,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\nint main(void)\n{\n    int P=3,Q=2,R=3;\n    printf(\""从A到B花费3块钱，从B到C花费2块钱，此时所有地点都去过了，总花费为%d块钱。\"",P+Q);\n    return 0;\n}",WRONG_ANSWER,8,324
1591655083274985472,acfcf65f14b5d3b02c3225372654b4e21f04d33a8bbaeb346e4fb1d85f2ea94f,2022-11-13 12:51:58,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int P=3,Q=2,R=5,i;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    printf(\""%d\"",P+Q);\n    if(P+Q=5)\n    return 1;\n    else\n        return 0;\n}",COMPILE_ERROR,0,0
1591655086622007296,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-13 12:51:58,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nint main(){\n    int p,q,r;\n    scanf(\""%d%d%d\"",&p,&q,&r);\n    printf(\""%d\"",p+q);\n    return 0;\n}",WRONG_ANSWER,20,356
1591655096109522944,6cbd81921f92855c6b8318725b09ef7ec48ff579276b3df9f7ea04bea9804678,2022-11-13 12:52:01,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int a,b,c,P,Q,R;\n    int min;\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    a=P+Q;\n    b=Q+R;\n    c=R+P;\n    if(a<b) min=a;\n    else min=b;\n    if(min<c) min=min;\n    else min=c; \n    printf(\""%d\\n\"",min);\n\n    return 0;\n}",ACCEPTED,28,324
1591655138929172480,8f30a940fb84c0203b9f96b4d228374f10f9fdcb64182e702cd07fe56f0f3ee3,2022-11-13 12:52:11,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main(){\n\tint a,b,c,n;\n\tscanf(\""%d %d %d\"",&a,&b,&c);\n\tn=a+b;\n\tprintf(\""%d\"",n);\n\t\n} ",WRONG_ANSWER,20,512
1591655143802986496,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-13 12:52:12,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int i,a[10],sum,x;\n    scanf(\""%d\"",&i);\n    for(x=0;x<i;x++)\n        scanf(\""%d\"",&a[x]);\n    sum=a[0];\n    for(x=0;x<i;)\n    {\n        sum-=5;\n        if(a[x+1]>a[x+3]) x+=1;\n        else x+=3;\n        sum+=a[x];\n    }\n    printf(\""%d\"",sum);\n}",SEGMENTATION_FAULT,5,472
1591655151910543360,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-13 12:52:14,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\nint main ()\n{\n    int n,i,m;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n-1;i++)\n    {\n        if(a[i+1]!=a[i])\n            m++;\n    }\n    printf(\""%d\"",2*m)\n        return 0;\n}",COMPILE_ERROR,0,0
1591655158160056320,17759f531671f838bf3fae4270190e93b6109026f9503f986c1ed85bb412007d,2022-11-13 12:52:15,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<string.h>\n#define N 100000\nint main()\n{\n    int n;\n    char a[N];\n    scanf(\""%d\"",&n);\n    get(a[N]);\n    put(a[N]);\n}",COMPILE_ERROR,0,0
1591655159741341696,9aa17e95021225dcdd2b01419b021cd002e47f9a7854274df042f64621bd207a,2022-11-13 12:52:16,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R,i,j,k,n,a[3];\n    scanf(\""%d,%d,%d\"",&P,&Q,&R);\n    a[0]=P;\n    a[1]=Q;\n    a[2]=R;\n    for(i=0;i<3;i++)\n        for(j=0,k=0;j<3-i;j++)\n    {\n        if(a[j]>a[j+1])\n        {\n         k=a[j];\n         a[j]=a[j+1];\n         a[j+1]=k;\n        }\n    }\n    n=a[0]+a[1];\n    printf(\""%d\"",n);\n    return 0;\n}\n",SEGMENTATION_FAULT,19,9556
1591655169627316224,70c675ddfcb60b2192bc8ac38fb068fec0500208a5bf97a796c7cc074b43cf87,2022-11-13 12:52:18,Java,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner myScanner = new Scanner(System.in);\n\t\tint n = myScanner.nextInt();\n\t\tint[] arr = new int[n];\n\t\tint count = 0;\n\t\tfor(int i = 0; i < n;i++){\n\t\t\tarr[i] = myScanner.nextInt();\n\t\t}\n\t\tfor(int j = 1;j <= n-2;j++){\n\t\t\tif(arr[j] > arr[j+1]){\n\t\t\t\tcount++;\n\t\t\t\tif(j == n-2){\n\t\t\t\t\tcount -= 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.printf(\""%d\"",count);\n\t}\n\n}",WRONG_ANSWER,105,24504
1591655179584593920,f1feb45d46abad163f730e5b023ce1df76883054d0a1741228a76c2c69aa3eda,2022-11-13 12:52:20,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n,i,j;\n    int k=0;\n    scanf(\""%d\"",&n);\n    char a[n];\n    for(i=0;i<n;i++)\n        scanf(\""%c\"",&a[i]);\n    while(1){\n        i=0;\n        for(;i<n-1;i++){\n            if(i<n-3){\n                if(a[i]==a[i+1]){\n                    for(j=i+2;j<n-1;j++){\n                        a[j-2]=a[j];\n                        a[j-1]=a[j+1];\n                    }\n                    n-=2;\n                    k+=2;\n                    }\n                }\n            else if(i==n-3){\n                a[i]=a[i+2];\n                n-=2;\n                k+=2;\n            }\n            else if(i==n-2){\n                if(a[i]==a[i+1])\n                    n-=2;\n                    k+=2;\n                }\n            }\n         if(i==n-1)\n            break;\n    }\n    printf(\""%d\"",k);\n}",WRONG_ANSWER,18,460
1591655187516022784,39afbda4ab6a7df2673bc0d0eec048a42b23ada2774ec941935a2b2fa044515a,2022-11-13 12:52:22,C++,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <bits/stdc++.h>\nusing namespace std;\n#define MAX 100001\nint main()\n{\nchar a[MAX];\nint n,j=0,p=0,q=0;\ncin>>n;\nfor(int i=0;i<n;i++){\n    cin>>a[i];\n}\nfor(j=0;j<n-1;j++){\n    if(a[q]!=a[q+1]){\n                p+=2;\n                   for(int i=q;i<n;i++){\n                    a[i]=a[i+2];\n                    a[i+1]=a[i+3];\n                   }\n                   q=0;\n        }\n    else q++;\n}\n\n\ncout<<p;\n}",WRONG_ANSWER,6,480
1591655198286995456,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-13 12:52:25,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\nint main(void)\n{\n    int P=3,Q=2,R=3;\n    s=P+Q;\n    printf(\""从A到B花费3块钱，从B到C花费2块钱，此时所有地点都去过了，总花费为%d块钱。\"",s);\n    return 0;\n}",COMPILE_ERROR,0,0
1591655206885285888,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-13 12:52:27,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<iostream>\n#include<math.h>\nusing namespace std;\nclass resolve{\n  public:\n    int resve(int x,int y,int a,int b){\n        return (a/(b+1))*(int)pow(x,b+1)-(a/(b+1))*pow(y,b+1);\n    }\n};\nint main(){\n    int i,n,a[1000],b[1000],x,y;\n    int resv=0;\n    cin>>n>>x>>y;\n    for(i=0;i<n;i++){\n        cin>>a[i];\n    }\n    for(i=0;i<n;i++){\n        cin>>b[i];\n    }\n    resolve res;\n    for(i=0;i<n;i++){\n        resv += res.resve(x,y,a[i],b[i]);\n    }\n    cout<<resv<<endl;\n    return 0;\n}",WRONG_ANSWER,11,456
1591655226552365056,acfcf65f14b5d3b02c3225372654b4e21f04d33a8bbaeb346e4fb1d85f2ea94f,2022-11-13 12:52:32,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int P=3,Q=2,R=5,i;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    printf(\""%d\"",P+Q);\n\n    return 0;\n  \n  \n}",WRONG_ANSWER,10,328
1591655258047406080,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-13 12:52:39,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\nint main(void)\n{\n    int P,Q,R;\n    s=P+Q;\n    printf(\""从A到B花费3块钱，从B到C花费2块钱，此时所有地点都去过了，总花费为%d块钱。\"",s);\n    return 0;\n}",COMPILE_ERROR,0,0
1591655307930263552,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-13 12:52:51,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <math.h>\n#include <stdio.h>\nint main()\n{\n    int a,b,c,min=1000;\n    scanf(\""%d\"",&a);\n    scanf(\""%d\"",&b);\n    scanf(\""%d\"",&c);\n    if(a+b<min) min=a+b;\n    {\n        if(a+c<min) min=a+c;\n        else\n            if(a+b<min) min=a+b;\n    }\n    printf(\""%d\"",min);\n}",WRONG_ANSWER,5,196
1591655309448589312,225b1524edf804414c466257a4f19789fe127117b27e663dc835d742fed77f9e,2022-11-13 12:52:51,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,b,c;\n    printf(\""%d %d %d\"",&a,&b,&c);\n    int sum;\n    sum=a+b;\n    printf(\""%dsum\"",sum);\n    return 0;\n}",WRONG_ANSWER,8,324
1591655313135427584,0354b067c4132d4425a90b77482ac717447702274cb7db1282edce56eaf037b3,2022-11-13 12:52:52,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main(){\n\tint n,i,a[100],count;\n\tcount=0;\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++)\n\t    scanf(\""%d\"",&a[i]);\n\tfor(i=1;i<n-1;i++){\n\t\tif(a[i]<a[i-1]&&a[i]<=a[i+1])\n\t\t    count++;\n\t}\n\tprintf(\""%d\"",count);\n\treturn 0;\n} ",RUNTIME_ERROR,29,348
1591655325076566016,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-13 12:52:55,C++,300.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint d[10];\nint main(){\n    int n;\n    int cnt1=0,cnt2=0,cnt=0;\n    cin>>n;\n    string s;\n    cin>>s;\n    for(int i=0;i<n;i++){\n    if(s[i]=='1')\n    cnt1++;\n    else\n    cnt2++;\n    \t}\n    \t    cnt=min(cnt1,cnt2);\n    \t    cout<<2*cnt;\n\treturn 0;\n} ",ACCEPTED,45,760
1591655329279270912,13616e85f216dd3844293b46f4b46105a0a2c458f7807a7b677858feb35cb63a,2022-11-13 12:52:56,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int a,b,c,s1,s2,s3,min;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n   s1=a+b;\n    s2=a+c;\n    s3=b+c;\n    if(s1>s2)\n        min=s2;\n    else min=s1;\n    if(min>s3)\n        min=s3;\n    printf(\""%d\\n\"",min);\n    \n}",ACCEPTED,38,484
1591655331435175936,acfcf65f14b5d3b02c3225372654b4e21f04d33a8bbaeb346e4fb1d85f2ea94f,2022-11-13 12:52:57,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int P=3,Q=2,R=5,i;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    printf(\""%d\\n\"",P+Q);\n\n    return 0;\n  \n  \n}",WRONG_ANSWER,11,324
1591655351488098304,6933dcb3592e2d6f6fc887ed9a5537aab21a30f76450c9b5043f7776bfc39a59,2022-11-13 12:53:01,C,300.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<string.h>\nvoid main(){\n    int i,n,start=1,end=1,temp=0;\n    scanf(\""%d\"",&n);\n    char str[n];\n    int text[2]={0,0};\n    for(i=0;i<=n;i++){\n        scanf(\""%c\"",&str[i]);\n    }\n    for(i=1;i<=n;i++){\n        if(str[i]=='0')\n            text[0]++;\n        else\n            text[1]++;\n    }\n    if(text[1]<=text[0]){\n        printf(\""%d\"",text[1]*2);\n    }else{\n        printf(\""%d\"",text[0]*2);\n    }\n}",ACCEPTED,36,512
1591655361797697536,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-13 12:53:04,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\nint main(void)\n{\n    int P,Q,R,s;\n    s=P+Q;\n    printf(\""从A到B花费3块钱，从B到C花费2块钱，此时所有地点都去过了，总花费为%d块钱。\"",s);\n    return 0;\n}",WRONG_ANSWER,11,348
1591655375076909056,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-13 12:53:07,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,i,e=0;\n    scanf(\""%d\"",&n);\n    char s[n];\n    scanf(\""%s\"",s);\n    l=n;\n    for(i=0;i<n;i++)\n    if(a[i]==1||a[i]==0)\n        \n    if(s[i]!=s[i+1])\n    {\n        l=l-2;\n     e=e+2;\n    for(j=0;j<n-2;j++)\n        s[j]=s[j+2];\n    \n    if(l==0||)break;}\n    printf(\""%d\"",e);\n    return 0;\n    \n}",COMPILE_ERROR,0,0
1591655377622851584,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-13 12:53:08,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<iostream>\n#include<math.h>\nusing namespace std;\ntypedef long long ll;\nclass resolve{\n  public:\n    int resve(int x,int y,int a,int b){\n        return (a/(b+1))*(ll)pow(x,b+1)-(a/(b+1))*pow(y,b+1);\n    }\n};\nint main(){\n    int i,n,a[1000],b[1000],x,y;\n    int resv=0;\n    cin>>n>>x>>y;\n    for(i=0;i<n;i++){\n        cin>>a[i];\n    }\n    for(i=0;i<n;i++){\n        cin>>b[i];\n    }\n    resolve res;\n    for(i=0;i<n;i++){\n        resv += res.resve(x,y,a[i],b[i]);\n    }\n    cout<<resv<<endl;\n    return 0;\n}",WRONG_ANSWER,8,324
1591655379711582208,00d0a1b2e987c17fb50850b9ec54bf6b4f8b997eb053d1a9fed6c4888fbe74ed,2022-11-13 12:53:08,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int a[3],i,j,c[a[0]],d[a[0]],x=0,y=0,sum;\n    for (i=0;i<3;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<a[0];i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=0;i<a[0];i++)\n        scanf(\""%d\"",&d[i]);\n    for(i=0;i<a[0];i++)\n        x=x+(c[i]/(d[i]+1))*pow(a[1],d[i]+1);\n    for(i=0;i<a[0];i++)\n        y=y+(c[i]/(d[i]+1))*pow(a[2],d[i]+1);\n    sum=x-y;\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,7,492
1591655390163787776,29d1ea54d6e4e56fc2de0be5ae10ecc4c70c7fca667934b17857e95530f5663a,2022-11-13 12:53:11,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n   int a[3],i,max,n;\n    for(i=0;i<3;i++)\n        scanf(\""%d\"",&a[i]);\n    a[max]=a[0];\n    for(i=0;i<3;i++)\n    {\n        if(a[max]<=a[i])\n            max=i;\n    }\n    if(max=0) n=a[1]+a[2];\n    if(max=1) n=a[2]+a[0];\n    if(max=2) n=a[0]+a[1];\n    printf(\""%d\"",n);\n    return 0;\n}\n",WRONG_ANSWER,12,512
1591655407687577600,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-13 12:53:15,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"include<stdio.h>\nint main(){\n    int p,q,r;\n    if(scanr(\""%d\"",&p)){};\n    if(scanr(\""%d\"",&q)){};\n    if(scanr(\""%d\"",&r)){};\n    \n    int count = 0;\n        if(p+q < p+r && p+q < q+r){\n            count = p+q;\n        }else{\n            if(p+r < p+q && p+r < q+r){\n                count = p+r;\n            }else{\n                if(q+r < p+q && q+r < p+r){\n                    count = q+r;\n                }\n            }\n        }\n        print(\""%d\"",count);\n}",COMPILE_ERROR,0,0
1591655409092681728,73af9d5098be5d450fba728363c8fdbe0f6a5526466daa2f3b74abf1acf75527,2022-11-13 12:53:15,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int n,a,b;\n    int i=0;\n    int c[100],F[100];\n    int sum=0;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&c[i]);\n        \n    }\n    for(i=0;i<n;i)\n    {\n        scanf(\""%d\"",&F[i]);\n        \n    }\n    for(i=0;i<n;i+=2)\n    {\n        sum+=(c[i]/(F[i]+1))*pow(a,F[i]+1 )+(c[i+1]/(F[i+1]+1))*pow(a,F[i+1]+1 )-((c[i]/(F[i]+1))*pow(b,F[i]+1 )+(c[i+1]/(F[i+1]+1))*pow(b,F[i+1]+1 ));\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",TIME_LIMIT_EXCEEDED,400,328
1591655414956306432,6b02dfcf297d52c2de2e1416b33ee988ff909834c73207b147423a8301e9d174,2022-11-13 12:53:17,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main()\n{   int n;\nint k;\nint i; \n int a[6]={0,0,0,0,0,0};\n \n scanf(\""%d/n\"",&n);\n   for(i=0;i<n;i++);\n   {\n   \tscanf(\""%d\"",&a[i]);\n   }\n  for(i=0;i<n;i++){\n  \n   while(a[i]!=a[i+1])\n   {\n   \tk=1;\n   \tk+=k;\n   }\n}\n     printf(\""%d\"",k);\n     return 0;\n}\n",TIME_LIMIT_EXCEEDED,400,200
1591655419284840448,1c76961e293959cbfa749568290c58d912c131cbc4a710b8bd9a4e58eccf0b8e,2022-11-13 12:53:18,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i;\n    int a[i];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n-1;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    int b;\n    for(i=1;i<n-2;i++)\n    {\n        if(a[i]<a[i-1])\n        {\n            b++;\n        }\n    }\n        return 0;\n}\n",RUNTIME_ERROR,8,196
1591655431012114432,c76414e1d2d8531a5745e9bd3192aafa7cca924e645650ffe7954c992cc13b33,2022-11-13 12:53:20,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main()\n{\nprintf(\""60\"");\n\n}\n",ACCEPTED,5,324
1591655432652075008,06b00897262b024d9e66dcd771cf81de9b63954f7a4554699d17c2158114c0d1,2022-11-13 12:53:21,Java,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner scan=new Scanner(System.in);\n\t\t\tint arr[]=new int[3];\n\t\t\tint x=0,sum=0;\n\t\t\tfor(int i=0;i<3;i++) {\n\t\t\t\tarr[i]=scan.nextInt();\n\t\t\t}\n\t\t\tfor(int i=1;i<3;i++) {\n\t\t\t\tif(arr[i]<arr[i-1]) {\n\t\t\t\t\tx=arr[i];\n\t\t\t\t\tarr[i]=arr[i-1];\n\t\t\t\t\tarr[i-1]=x;\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(int i=0;i<2;i++) {\n\t\t\t\tsum=sum+arr[i];\n\t\t\t}\n\t\t\tSystem.out.println(sum);\n\t}\n}\n",ACCEPTED,543,24720
1591655444043804672,00d0a1b2e987c17fb50850b9ec54bf6b4f8b997eb053d1a9fed6c4888fbe74ed,2022-11-13 12:53:24,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int a[3],i,j,c[a[0]],d[a[0]],x=0,y=0,sum;\n    for (i=0;i<3;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<a[0];i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=0;i<a[0];i++)\n        scanf(\""%d\"",&d[i]);\n    for(i=0;i<a[0];i++)\n        x=x+(c[i]/(d[i]+1))*pow(a[1],d[i]+1);\n    for(i=0;i<a[0];i++)\n        y=y+(c[i]/(d[i]+1))*pow(a[2],d[i]+1);\n    sum=x-y;\n    printf(\""%d\\n\"",sum);\n    return 0;\n}",WRONG_ANSWER,6,324
1591655453543915520,225b1524edf804414c466257a4f19789fe127117b27e663dc835d742fed77f9e,2022-11-13 12:53:26,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,b,c;\n    printf(\""%d %d %d\"",&a,&b,&c);\n    int sum;\n    sum=a+b;\n    printf(\""sum%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,10,204
1591655458598084608,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-13 12:53:27,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"include <stdio.h>\nint main(){\n    int p,q,r;\n    if(scanr(\""%d\"",&p)){};\n    if(scanr(\""%d\"",&q)){};\n    if(scanr(\""%d\"",&r)){};\n    \n    int count = 0;\n        if(p+q < p+r && p+q < q+r){\n            count = p+q;\n        }else{\n            if(p+r < p+q && p+r < q+r){\n                count = p+r;\n            }else{\n                if(q+r < p+q && q+r < p+r){\n                    count = q+r;\n                }\n            }\n        }\n        print(\""%d\"",count);\n}",COMPILE_ERROR,0,0
1591655483654811648,f1feb45d46abad163f730e5b023ce1df76883054d0a1741228a76c2c69aa3eda,2022-11-13 12:53:33,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n,i,j;\n    int k=0;\n    scanf(\""%d\"",&n);\n    char a[n];\n    for(i=0;i<n;i++)\n        scanf(\""%c\"",&a[i]);\n    while(1){\n        i=0;\n        for(;i<n-1;i++){\n            if(i<n-3){\n                if(a[i]==a[i+1]){\n                    for(j=i+2;j<n-1;j++){\n                        a[j-2]=a[j];\n                        a[j-1]=a[j+1];\n                    }\n                    n-=2;\n                    k+=2;\n                    }\n                }\n            else if(i==n-3){\n                if(a[i]==a[i+2]){\n                n-=2;\n                k+=2;\n                }\n            }\n            else if(i==n-2){\n                if(a[i]==a[i+1]){\n                    n-=2;\n                    k+=2;\n                }\n                }\n            }\n         if(i==n-1)\n            break;\n    }\n    printf(\""%d\"",k);\n}",TIME_LIMIT_EXCEEDED,428,340
1591655486112686080,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-13 12:53:34,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\nint main(void)\n{\n    int P,Q,R,s;\n    s=P+Q;\n    printf(\""%d\"",s);\n    return 0;\n}",WRONG_ANSWER,9,512
1591655503963676672,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-13 12:53:38,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\nint main(void)\n{\n    int P,Q,R,s;\n    s=P+Q;\n    printf(\""%d\"",s);\n    return 0;\n}",WRONG_ANSWER,5,196
1591655516999528448,157388d8d83262bba5955406e39bb36c3baacd3a224f63ce1739541bb582af20,2022-11-13 12:53:41,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    \n    printf(\""4\"");\n   \n       \n}",WRONG_ANSWER,5,324
1591655544560345088,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-13 12:53:48,Python,0.0,1591610585635213313,1589906790446387200,1049226928954454016,num=int(input())\nfor i in range (num):\n    n=int(input())\n    a=list(input().split())\n    for i in range (len(a)):\n        a[i]=int(a[i])\n    b=a\n    all=2*max(a)-min(a)\n    b.remove(min(a))\n    b.remove(max(a))\n    print(all-max(b))\n,WRONG_ANSWER,50,3288
1591655549941637120,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-13 12:53:49,Python,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"n = eval(input())\nlist = map(eval,input().split())\nprint(\""15\"")",WRONG_ANSWER,22,2816
1591655586293637120,361d4ab0fa1284b9bf8a3ba65da408861b894c5c0617b83f77f2c1d9a1a3ec92,2022-11-13 12:53:57,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"p,q,r=input().split()\nx=int(p)+int(q)\ny=int(q)+int(r)\nz=int(p)+int(r)\nif x<=y<=z:\n    print(x)\nelif y<=x<=z:\n    print(y)\nelif z<=x<=y:\n    print(z)\n\n",WRONG_ANSWER,18,2888
1591655614793932800,42cfad7191c5e6c0eee156c4369182744d6c5db3bc2a5dc87f9f1be6ee4bbcfe,2022-11-13 12:54:04,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main(){\n    int P,Q,R;\n    int flag=0,sum=0;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n\tif(P==3&&R==3){\n\tsum=sum+P;\n\tflag=1;\n  \t}  \t\n  \tif(flag==1){\n  \tsum=sum+Q;\n  \tflag=2;\n\t}\n\tif(flag==2)\n\tprintf(\""%d\"",sum);\n\treturn 0;\n} ",WRONG_ANSWER,4,200
1591655619118260224,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-13 12:54:05,C,0.0,1591610585635213313,1589906790446387200,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,j,k,temp,flag,sum,sum1;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(k=1;k<=n;k++)\n    {\n        flag=0;\n        for(j=0;j<n-k;j++)\n        {\n            flag=1;\n          if(a[j]>a[j+1])\n          {\n               temp=a[j+1];\n                a[j+1]=a[j];\n               a[j]=temp;\n            }\n        }\n       if(flag==0);\n            break;\n    }\n    sum=abs(a[0]-a[1])+abs(a[1]-a[2]);\n      for(i=0;i<n-2;i++)\n      {\n          sum1=abs(a[i]-a[i+1])+abs(a[i+1]-a[i+2]);\n          if(sum>=sum1)\n            sum=sum1;\n      }\n      printf(\""%d\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,13,208
1591655639410335744,aa65cdf25cbe32699d085a61c4f3ec5a4020e6a3dc1e0e9d6e2a48c9288f8026,2022-11-13 12:54:10,Java,300.0,1591610585639407616,1591132307937943552,1049226928954454016,\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner scan=new Scanner(System.in);\n\t\tint num=scan.nextInt();\n\t\tint arr[]=new int[num];\n\t\tfor(int i=0;i<num;i++){\n\t\t\tarr[i]=scan.nextInt();\n\t\t}\n\t\tint sum=0;\n\t\tfor(int i=1;i<num-1;i++){\n\t\t\tif (arr[i]<arr[i+1] && arr[i]<arr[i-1]) {\n\t\t\t\tsum++;\n\t\t\t}\n\t\t\tif (arr[i]<arr[i+1] && arr[i]==arr[i-1]) {\n\t\t\t\tsum++;\n\t\t\t}\n\t\t\t\n\t\t}\n\t\tSystem.out.println(sum);\n\t\t\n\t\t}\n\t\t\t\n\t},ACCEPTED,556,25932
1591655644397363200,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-13 12:54:11,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\nint main ()\n{\n    int n,i,m=0;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n-1;i++)\n    {\n        if(a[i+1]!=a[i])\n            m++;\n    }\n    printf(\""%d\"",2*m);\n        return 0;\n}",WRONG_ANSWER,8,200
1591655658423115776,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 12:54:15,Python,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"print(\""15\"")",WRONG_ANSWER,15,2764
1591655659635236864,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-13 12:54:15,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<iostream>\n#include<math.h>\nusing namespace std;\ntypedef long long ll;\nclass resolve{\n  public:\n    int resve(int x,int y,int a,int b){\n        return (a/(b+1))*(ll)pow(x,b+1)-(a/(b+1))*(ll)pow(y,b+1);\n    }\n};\nint main(){\n    int i,n,a[1000],b[1000],x,y;\n    ll resv=0;\n    cin>>n>>x>>y;\n    for(i=0;i<n;i++){\n        cin>>a[i];\n    }\n    for(i=0;i<n;i++){\n        cin>>b[i];\n    }\n    resolve res;\n    for(i=0;i<n;i++){\n        resv += res.resve(x,y,a[i],b[i]);\n    }\n    cout<<resv<<endl;\n    return 0;\n}",WRONG_ANSWER,6,480
1591655660520235008,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-13 12:54:15,Python,0.0,1591610585635213313,1589906790446387200,1049226928954454016,num=int(input())\nfor i in range (num):\n    n=int(input())\n    a=list(input().split())\n    for i in range (len(a)):\n        a[i]=int(a[i])\n    b=a\n    all=2*max(a)-min(a)\n    b.remove(min(a))\n    b.remove(max(a))\n    print(all-max(b)),WRONG_ANSWER,49,3256
1591655668174872576,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-13 12:54:17,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,j,n;\n    int a[100],sum[100];\n    int max=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n        \n    }\n    for(j=0;j<n;j++){\n        int x=1;\n        for(i=0;i<n;i++)\n        {\n            if(a[j]<=a[i+1])\n                x++;\n\n        }\n        sum[j]=x*a[j];\n    }\n    for(j=0;j<n;j++)\n    {\n       \n        if(sum[j]>=max)\n        {\n            max=sum[j];\n            \n         }   \n    }\n    printf(\""%d\"",max);\n    return 0;\n}",WRONG_ANSWER,8,348
1591655673900097536,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-13 12:54:18,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"str1=\""P,Q,R\""\neval(input())\n1<=P,Q,R<=1000\na=P+Q\nb=Q+R\nc=R+P\nif a<b:\n   if a<c:\n    print(a)\nif b<a:\n   if b<c:\n    print(b)\nif c<a:\n   if c<b:\n    print(c)\n",NON_ZERO_EXIT_CODE,18,2760
1591655705567092736,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-13 12:54:26,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\nint b[10];\nint a,i,sum;\n    sum=0;\nscanf(\""%d\"",&a);\nfor(i=0;i<a;i++)\n{\n    scanf(\""%d\"",&b[i]);\n    sum+=b[i];\n}\n sum-=5*a;\n    sum+=9;\n    printf(\""%d\\n\"",sum);\n    return 0;\n    \n}\n",SEGMENTATION_FAULT,7,328
1591655721891291136,864c0dc14d6d917707294bc7e18ea53a2c0536c5d47f3d25f94f0188f106014f,2022-11-13 12:54:30,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,count=0;\n    int a[1000];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=1;i<n-1;i++){\n        if((a[i]<a[i-1])&&(a[i]<a[i+1])||a[i]<a[i-1]) count++;\n\n    }\n    printf(\""%d\"",count );\n    return 0;\n}",WRONG_ANSWER,8,332
1591655723078279168,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-13 12:54:30,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main(){\n    int i,lucheng[2],sum[5],min=10*10*10*3;\n    for(i=0;i<3;i++){\n        scanf(\""%d\"",&lucheng[i]);\n    }\n    sum[0]=lucheng[0]+lucheng[1];\n    sum[1]=lucheng[2]+lucheng[1];\n    sum[2]=lucheng[0]+lucheng[2];\n    sum[3]=lucheng[1]+lucheng[2];\n    sum[4]=lucheng[2]+lucheng[0];\n    sum[5]=lucheng[1]+lucheng[0];\n    for(i=0;i<6;i++){\n        if(sum[i]<=min){\n            min=sum[i];\n        }\n    }\n    printf(\""%d\"",min);\n    return 0;\n}",WRONG_ANSWER,5,328
1591655737569632256,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-13 12:54:34,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\nint main(void)\n{\n    int P=3,Q=2,R=3,s;\n    s=P+Q;\n    printf(\""%d\"",s);\n    return 0;\n}",WRONG_ANSWER,10,324
1591655749229752320,225b1524edf804414c466257a4f19789fe127117b27e663dc835d742fed77f9e,2022-11-13 12:54:36,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a=0,b=0,c=0;\n    printf(\""%d %d %d\"",&a,&b,&c);\n    int sum=0;\n    sum=a+b;\n    printf(\""sum%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,9,348
1591655754971766784,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-13 12:54:38,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main(){\n\tint n,i,sum=0;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=0;i<n;i++){\n\t\tif(a[i+2]>=a[i]&&i<n) {\n\t\t\tsum+=a[i+2]-5;\n\t\t\ti=i+2;\n\t\t}\n\t\telse sum+=a[i]-5;\n\t}\n\tprintf(\""%d\"",sum);\n}\n",WRONG_ANSWER,5,324
1591655762857091072,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-13 12:54:40,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a[4],b[4],i,j;\n    for(i=1;i<=3;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=1;i<=3;i++)\n        if(a[i]<a[i-1])\n    {\n        b[1]=a[i];\n        j=i;\n    }\n    a[j]=10000;\n    for(i=1;i<=3;i++)\n        if(a[i]<a[i-1])\n        b[2]=a[i];\n    printf(\""%d\"",b[1]+b[2]);\n    return 0;\n}\n",WRONG_ANSWER,5,324
1591655775574175744,6a6dc7e644e57bb2c20b20d39bd4d9541bdebf6415e03e7c13707572c054673e,2022-11-13 12:54:43,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{  int m,n,a,b;\n\n   scanf(\""%d %d %d\"",&n,&a,&b);\n    m=n+a;\n   printf(\""%d\"",m);\n    return 0;\n}\n",WRONG_ANSWER,10,384
1591655780393431040,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 12:54:44,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[100000],sum=0;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n        if(a[i]>a[i+2])\n        sum=sum+a[i]-5;\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",COMPILE_ERROR,0,0
1591655793169293312,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-13 12:54:47,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main(){\n    int i,lucheng[2],sum[5],min=10*10*10*3;\n    for(i=0;i<3;i++){\n        scanf(\""%d\"",&lucheng[i]);\n    }\n    sum[0]=lucheng[0]+lucheng[1];\n    sum[1]=lucheng[2]+lucheng[1];\n    sum[2]=lucheng[0]+lucheng[2];\n    sum[3]=lucheng[1]+lucheng[2];\n    sum[4]=lucheng[2]+lucheng[0];\n    sum[5]=lucheng[1]+lucheng[0];\n    for(i=0;i<6;i++){\n        if(sum[i]<=min){\n            min=sum[i];\n        }\n    }\n    printf(\""%d\\n\"",min);\n    return 0;\n}",WRONG_ANSWER,7,492
1591655801843113984,28b4de6882b7ade2679f59c486acaf307ce8415dcb0a15787dba589025bbdb02,2022-11-13 12:54:49,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint n,i,j,k=0;\n\n\tscanf(\""%d\"",&n);\n\tgetchar();\n\tchar num[n+1];\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%c\"",&num[i]);\n\t}\n\tfor(i=1;i<n;i++)\n\t{\n\t\tif(num[i]!=num[i-1])\n\t\t{\n\t\t\tk=k+2;\n\t\t\tfor(j=i+1;j<n;j++)\n\t\t\t{\n\t\t\t\tnum[j-2]=num[j];\n\t\t\t}\n\t\t\ti=i-2;\n\t\t\tn=n-2;\n\t\t}\n\t}\n\tprintf(\""%d\"",k);\n\treturn 0;\n}",WRONG_ANSWER,4,460
1591655802539356160,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-13 12:54:49,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nint main(){\n    int p,q,r;\n    if(scanr(\""%d\"",&p)){};\n    if(scanr(\""%d\"",&q)){};\n    if(scanr(\""%d\"",&r)){};\n    \n    int count = 0;\n        if(p+q < p+r && p+q < q+r){\n            count = p+q;\n        }else{\n            if(p+r < p+q && p+r < q+r){\n                count = p+r;\n            }else{\n                if(q+r < p+q && q+r < p+r){\n                    count = q+r;\n                }\n            }\n        }\n        print(\""%d\"",count);\n}",COMPILE_ERROR,0,0
1591655812786040832,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-13 12:54:51,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\nint main(void)\n{\n    int P=3,Q=2,s;\n    s=P+Q;\n    printf(\""%d\"",s);\n    return 0;\n}",WRONG_ANSWER,7,324
1591655813503311872,9a1ecd1db02b268060006afd7de34ec54e74e90bf61becbb6811fb23971c4720,2022-11-13 12:54:52,Python,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"n=int(input())\nl=list(map(int,input().split()))\ncnt=0\nfor i in range(1,n-1):\n    if l[i-1]>l[i] and l[i]<l[i+1]:\n        cnt+=1\n    if l[i]==l[i+1] and l[i+1]<l[i+2]:\n        cnt+=1\nprint(cnt)\n",ACCEPTED,88,2904
1591655829064179712,4e8bf5e988ac4275aeb23eae913a385055ab79de14dc27373b9e62a15269d138,2022-11-13 12:54:55,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,b,c;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    int P,Q,R;\n    P=a+b;\n    Q=a+c;\n    R=b+c;\n    if(P/Q+P/R+Q/P+Q/R+R/P+R/Q!=4){\n    if(P/Q+P/R==0){printf(\""%d\"",P);}\n    else if(Q/P+Q/R==0){printf(\""%d\"",Q);}\n    else if(R/P+R/Q==0){printf(\""%d\"",R);}\n    }else\n    {\n        if(P/Q+P/R==1){printf(\""%d\"",P);}\n        else{printf(\""%d\"",Q);}\n    }\n}",WRONG_ANSWER,14,452
1591655834810376192,7222c2fb91a71fcf3f6560860557ab564f69a453594c9f1620ecc35bb26f5daf,2022-11-13 12:54:57,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\nint main(){\n    int n,i,j,sum=0;\n     n=4;\n    int a[n];\n     a[0]=0;\n    a[1]=0;\n    a[2]=1;\n    a[3]=1;\n    for(i=0;i<n;i++)\n    {\n        printf(\""%d\"",a[i]);     \n    }\n    \n    \n   \n   for(i=0;i<n;i++)\n    {\n        if(i==0&&a[0]==a[1])\n        {\n            for(j=i;j<n;j++)\n            {\n                a[j]=a[j+1];\n            }\n            for(j=i;j<n;j++)\n            {\n                a[j]=a[j+1];\n            }\n            i--;\n            sum++;\n            \n            continue;\n        }\n       if(a[i-1]==a[i])\n        {\n            for(j=i-1;j<n;j++)\n            {\n                a[j]=a[j+1];\n            }\n           for(j=i-1;j<n;j++)\n            {\n                a[j]=a[j+1];\n            }\n           sum++;\n           i--;\n        }\n        \n    }\n  \n    printf(\""%d\"",sum*2);\n    return 0;\n    \n}",TIME_LIMIT_EXCEEDED,400,320
1591655858558492672,7222c2fb91a71fcf3f6560860557ab564f69a453594c9f1620ecc35bb26f5daf,2022-11-13 12:55:02,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\nint main(){\n    int n,i,j,sum=0;\n     n=4;\n    int a[n];\n     a[0]=0;\n    a[1]=0;\n    a[2]=1;\n    a[3]=1;\n    for(i=0;i<n;i++)\n    {\n        printf(\""%d\"",a[i]);     \n    }\n    \n    \n   \n   for(i=0;i<n;i++)\n    {\n        if(i==0&&a[0]==a[1])\n        {\n            for(j=i;j<n;j++)\n            {\n                a[j]=a[j+1];\n            }\n            for(j=i;j<n;j++)\n            {\n                a[j]=a[j+1];\n            }\n            i--;\n            sum++;\n            \n            continue;\n        }\n       if(a[i-1]==a[i])\n        {\n            for(j=i-1;j<n;j++)\n            {\n                a[j]=a[j+1];\n            }\n           for(j=i-1;j<n;j++)\n            {\n                a[j]=a[j+1];\n            }\n           sum++;\n           i--;\n        }\n        \n    }\n  \n    printf(\""%d\"",sum*2);\n    return 0;\n    \n}",TIME_LIMIT_EXCEEDED,400,196
1591655870839414784,73af9d5098be5d450fba728363c8fdbe0f6a5526466daa2f3b74abf1acf75527,2022-11-13 12:55:05,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int n,a,b;\n    int i=0;\n    int c[100],F[100];\n    int sum=0;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&c[i]);\n        \n    }\n    for(i=0;i<n;i)\n    {\n        scanf(\""%d\"",&F[i]);\n        \n    }\n    for(i=0;i<n;i+=2)\n    {\n        int x=(c[i]/(F[i]+1))*pow(a,F[i]+1 )+(c[i+1]/(F[i+1]+1))*pow(a,F[i+1]+1 );\n        int y=(c[i]/(F[i]+1))*pow(b,F[i]+1 )+(c[i+1]/(F[i+1]+1))*pow(b,F[i+1]+1 );\n        sum+=(x-y);\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",TIME_LIMIT_EXCEEDED,400,352
1591655871833464832,cf76a6e5773cf2f19ddd635fa646c5a6721f6fed8998d22ea1d0910bee8017a2,2022-11-13 12:55:06,C,0.0,1591610585635213314,1591128862958940160,1049226928954454016,"#include<stdio.h>\n#define N 30\nint main()\n{\n    int n,i,j,t;\n    int a[N],b[N];\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n-1;i++)\n    {\n       scanf(\""%d\"",&a[i]);\n    }\n     for(i=0;i<n-1;i++)\n     {\n        for(j=0;j<3;j++)\n        {\n            if(a[j]<a[j+1])\n          {\n             t=a[j];\n             a[j]=a[j+1];\n             a[j+1]=t;\n           }\n        }\n      }\n     printf(\""%d \"",n);\n    for(i=0;i<n-1;i++)\n        printf(\""%d \"",a[i]);\n}\n",SEGMENTATION_FAULT,7,476
1591655872429088768,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-13 12:55:06,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main(){\n    int i,lucheng[2],sum[5],min=10*10*10*3;\n    for(i=0;i<3;i++){\n        scanf(\""%d\"",&lucheng[i]);\n    }\n    sum[0]=lucheng[0]+lucheng[1];\n    sum[1]=lucheng[2]+lucheng[1];\n    sum[2]=lucheng[0]+lucheng[2];\n    sum[3]=lucheng[1]+lucheng[2];\n    sum[4]=lucheng[2]+lucheng[0];\n    sum[5]=lucheng[1]+lucheng[0];\n    for(i=0;i<6;i++){\n        if(sum[i]<=min){\n            min=sum[i];\n        }\n    }\n    printf(\""%d\\n\"",min);\n    return 0;\n}",WRONG_ANSWER,4,320
1591655880985436160,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-13 12:55:08,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"n=int(input())\n# data=list(map(int,list(input())))\ndata=input()\ndatas=list(data)\ncount=0\nfor i in range(int(n/2)):\n    for x in range(0,len(datas)-1):\n        if datas[x]!=datas[x+1]:\n            datas.pop(x)\n            datas.pop(x)\n            count+=1\n            break\nprint(count*2)",TIME_LIMIT_EXCEEDED,471,3912
1591655882893877248,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-13 12:55:08,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\nint main(void)\n{\n    int P=3,Q=2,s;\n    s=P+Q;\n    printf(\""%d\"",s);\n    return 0;\n}",WRONG_ANSWER,6,324
1591655892570103808,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 12:55:10,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[n],sum=0;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n        if(a[i]>a[i+2])\n        sum=sum+a[i]-5;\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",COMPILE_ERROR,0,0
1591655912056872960,212aee9dc233539050d1d324af20b580172711970f7c24349b9c7c8ac9b114cd,2022-11-13 12:55:15,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n    int x,y,z,m,n;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    m=x+y+z;\n    n=x+y;\n    if(x>=0 && x<=1000 && y>=0 && y<=1000 && z>=0 && z<=1000)\n        if(m>=n)\n        printf(\""%d\"",n);\n    return 0;\n}\n",WRONG_ANSWER,5,320
1591655917945675776,28b4de6882b7ade2679f59c486acaf307ce8415dcb0a15787dba589025bbdb02,2022-11-13 12:55:17,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint n,i,j,k=0;\n\n\tscanf(\""%d\"",&n);\n\tgetchar();\n\tchar num[n+1];\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%c\"",&num[i]);\n\t}\n\tfor(i=1;i<n;i++)\n\t{\n\t\tif(num[i]!=num[i-1])\n\t\t{\n\t\t\tk=k+2;\n\t\t\tfor(j=i+1;j<n;j++)\n\t\t\t{\n\t\t\t\tnum[j-2]=num[j];\n\t\t\t}\n\t\t\ti=i-2;\n\t\t\tn=n-2;\n\t\t}\n\t}\n\tprintf(\""%d\\n\"",k);\n\treturn 0;\n}",WRONG_ANSWER,11,200
1591655923347939328,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-13 12:55:18,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a[4],b[4],i,j;\n    for(i=1;i<=3;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=1;i<=3;i++)\n        if(a[i]<a[i-1])\n    {\n        b[1]=a[i];\n        j=i;\n    }\n    a[j]=10000;\n    for(i=1;i<=3;i++)\n        if(a[i]<a[i-1])\n        b[2]=a[i];\n    printf(\""%d\\n\"",b[1]+b[2]);\n    return 0;\n}\n",WRONG_ANSWER,5,380
1591655924744609792,13616e85f216dd3844293b46f4b46105a0a2c458f7807a7b677858feb35cb63a,2022-11-13 12:55:18,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,print(60);,ACCEPTED,24,2916
1591655927311511552,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-13 12:55:19,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\nint main(){\n    int p,q,r;\n    if(scanf(\""%d\"",&p)){};\n    if(scanf(\""%d\"",&q)){};\n    if(scanf(\""%d\"",&r)){};\n    \n    int count = 0;\n        if(p+q < p+r && p+q < q+r){\n            count = p+q;\n        }else{\n            if(p+r < p+q && p+r < q+r){\n                count = p+r;\n            }else{\n                if(q+r < p+q && q+r < p+r){\n                    count = q+r;\n                }\n            }\n        }\n        printf(\""%d\"",count);\n}",ACCEPTED,42,352
1591655936635461632,1c76961e293959cbfa749568290c58d912c131cbc4a710b8bd9a4e58eccf0b8e,2022-11-13 12:55:21,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i;\n    int a[i];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n-1;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    int b;\n    b=0;\n    for(i=1;i<n-2;i++)\n    {\n        if(a[i]<a[i-1])\n        {\n            b++;\n        }\n    }\n    printf(\""%d\"",b);\n        return 0;\n}\n",RUNTIME_ERROR,20,640
1591655944181002240,fc04467797ff55239c848b5102d2499d81faac6f07f19ed145b2c7ad9b809632,2022-11-13 12:55:23,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n;\n    scanf(\""输出一个两位数整数\"",&n);\n    return 0;\n}",WRONG_ANSWER,10,476
1591655957992890368,910d600982c42b3bf326994e410e7a344f2438b451c8f7deb6f6a9f965d3ee41,2022-11-13 12:55:26,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int P,Q,R,i,j,a[3],b,min;\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    a[0]=P;a[1]=Q;a[2]=R;\n    for(j=0;j<3;j++)\n        for(i=0;i<3;i++)\n            if(a[i]>a[i+1])\n            {\n                b=a[i];\n                a[i]=a[i+1];\n                a[i+1]=b;\n            }\n    min=a[0]+a[1];\n    printf(\""%d\"",min);\n}\n",RUNTIME_ERROR,9,352
1591655966410858496,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-13 12:55:28,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\nint b[100];\nint a,i,sum;\n    sum=0;\nscanf(\""%d\"",&a);\nfor(i=0;i<a;i++)\n{\n    scanf(\""%d\"",&b[i]);\n    sum+=b[i];\n}\n sum-=5*a;\n sum+=9;\n    printf(\""%d\\n\"",sum);\n    return 0;\n    \n}\n",SEGMENTATION_FAULT,5,200
1591655998862155776,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 12:55:36,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <string.h>\nint main()\n{\n    int k,len,i,g,l;\n    char str[10] = {0};\n    scanf(\""%d\"",&k);\n    scanf(\""%s\"",str);\n    len  = strlen(str);\n    for(i=0;i<len;i++)\n    {\n        if(str[i]=='0')\n        g++;\n        else\n        l++;\n    }\n    g-=8;//0的个数;\n    l-=52;//1的个数;\n    if(g>l)\n    printf(\""4\\n\"");\n    else\n    printf(\""4\\n\"");\n    return 0;\n}\n",RUNTIME_ERROR,6,348
1591656002557370368,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-13 12:55:37,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nint main(){\n    int p,q,r,min;\n    scanf(\""%d%d%d\"",&p,&q,&r);\n    min=p+q;\n    \n        if(min>q+r)\n            min=q+r;\n        if(min>r+p)\n            min=r+p;\n    \n    printf(\""%d\"",min);\n    return 0;\n}",ACCEPTED,28,512
1591656034807328768,5bd1a8718ea7fb820055421c67b8e0a468e08d951f729a24e55bf407b3bdb1f6,2022-11-13 12:55:44,C++,300.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <iostream>\n#include <string>\nusing namespace std;\n\n\n\n\n\n\nint main()\n{\n    int n,count=0;\n    string s;\n    cin>>n;\n    cin>>s;\n    int i=0;\n    while(i<n-1&&n!=1){\n        if(s[i]!=s[i+1]){\n            count+=2;\n            s.erase(i,2);\n            n-=2;\n            if(n!=0&&i!=0)\n            i--;\n            else if(i==0)\n                continue;\n            else\n                break;\n        }else{\n            i+=1;\n        }\n\n    }\n\n    cout<<count;\n\n    return 0;\n}\n",ACCEPTED,89,604
1591656043095285760,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 12:55:46,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[n],sum=0;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if(a[i]>a[i+2])\n        sum=sum+a[i]-5;\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",COMPILE_ERROR,0,0
1591656046673059840,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-13 12:55:47,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\nint main(void)\n{\n    int P=3,Q=2;\n    printf(\""%d+%d\"",P+Q);\n    return 0;\n}",WRONG_ANSWER,7,348
1591656058786177024,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-13 12:55:50,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\nint main(void)\n{\n    int P=3,Q=2;\n    printf(\""%d+%d\"",P+Q);\n    return 0;\n}",WRONG_ANSWER,10,324
1591656065195061248,899c5501179552dc1fe5639f9047e15d0f835e7a87c8568193377882d0278985,2022-11-13 12:55:52,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int P,Q,R,sum1,sum2,sum3,min;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    sum1=P+Q;\n    sum2=Q+R;\n    sum3=R+P;\n    if(sum1>=sum2)\n    {\n        if(sum2>=sum3)\n            min=sum3;\n        else\n            min=sum2;\n    }\n    else\n    {\n        if(sum2<=sum3)\n            min=sum1;\n        else if(sum1>sum3)\n            min=sum3;\n        else\n            min=sum1;\n    }\n    printf(\""%d\"",min);\n    return 0;\n}",ACCEPTED,30,324
1591656070622502912,fc04467797ff55239c848b5102d2499d81faac6f07f19ed145b2c7ad9b809632,2022-11-13 12:55:53,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n;\n    scanf(\""\"",&n);\n    return 0;\n}",WRONG_ANSWER,7,340
1591656086770573312,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-13 12:55:57,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\nint b[100];\nint a,i,sum;\n    sum=0;\nscanf(\""%d\"",&a);\nfor(i=0;i<a;i++)\n{\n    scanf(\""%d\"",&b[i]);\n    sum+=b[i];\n}\n sum-=5*i;\n    printf(\""%d\\n\"",sum);\n    return 0;\n    \n}\n",SEGMENTATION_FAULT,8,192
1591656093426933760,d9e00d995e65b04cda3ddef6baec19225e4351002ab4efa981f62d78919a481b,2022-11-13 12:55:58,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int p,q,r;\n    scanf(\""%d%d%d\"",&p,&q,&r);\n    int sum=0;\n    if(p>=q && p>=r){\n        sum = q+r;\n    }\n    if(q>=p && q>=r){\n       sum = p+r;\n    }\n    if(r>=p && r>=q){\n        sum = p+q;\n    }\n\n    printf(\""%d\"",sum);\n\n}\n",ACCEPTED,44,512
1591656094110638080,81f258582663b08bc9b4d77bba77afc3b463021ec8fb2262453de07687484cd5,2022-11-13 12:55:59,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"P,Q,R = input().split()\n\n\np = int(P)\nq = int(Q)\nr = int(R)\n\n\na =  p + q\nb = p + r\nc =  r +p\n\n#f= eval(a)\n#h= eval(b)\n#g= eval(c)\nd = min(a,b,c)\n if 0<=p<=10**3 and 0<=q<=10**3 and 0<=r<=10**3:\n  print(d)\n",NON_ZERO_EXIT_CODE,17,2892
1591656100645363712,4d1157ac6ad50cfc6ca5d6b3e1c2dd7f1ecc593df10ff6888d4207a4f1c03a35,2022-11-13 12:56:00,C++,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int P,Q,R,sum1,sum2,sum3;\n    cin>>P>>Q>>R;\n    int min=3001;\n    sum1=P+Q;\n    sum2=P+R;\n    sum3=R+Q;\n    if(sum1<=sum2&&sum1<=sum3)min=sum1;\n    if(sum2<=sum1&&sum2<=sum3)min=sum2;\n    if(sum3<=sum1&&sum3<=sum2)min=sum3;\n    printf(\""%d\\n\"",min);\n    return 0;\n}",ACCEPTED,61,508
1591656104764170240,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 12:56:01,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[n],sum=0,i;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if(a[i]>a[i+2])\n        sum=sum+a[i]-5;\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,9,372
1591656134019395584,69d2f3a9da1c135d111e69327883b4d96c284e9c1c71370cc330a44458f95ab4,2022-11-13 12:56:08,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n\n    int x,Q,P,R;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n   if(P==3)\n    printf(\""%d\"",Q+R);\n\nreturn 0;\n}\n",WRONG_ANSWER,5,352
1591656157864026112,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-13 12:56:14,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}",ACCEPTED,10,328
1591656168156848128,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-13 12:56:16,Java,0.0,1591610585635213318,1591131464941563904,1049226928954454016,import java.util.Scanner;\npublic class Main {\n    public static void main(String []args) {\n       int a[]=new int[5];\n        int b;\n        Scanner scanner=new Scanner(System.in);\n        a[0]=scanner.nextInt();\n        a[1]=scanner.nextInt();\n        a[2]=scanner.nextInt();\n        for(int i=0;i<2;i++){\n            if(i>0){\n                if(a[i]<a[i-1])\n                {\n                    b=a[i-1];\n                    a[i-1]=a[i];\n                    a[i]=b;\n                }\n            }\n                \n        }\n        System.out.println(a[0]+a[1]);\n        \n       \n    }\n},WRONG_ANSWER,210,25536
1591656194589339648,39afbda4ab6a7df2673bc0d0eec048a42b23ada2774ec941935a2b2fa044515a,2022-11-13 12:56:22,C++,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <bits/stdc++.h>\nusing namespace std;\n#define MAX 100001\nint main()\n{\nchar a[MAX];\nint n,j=0,p=0,q=0;\ncin>>n;\nfor(int i=0;i<n;i++){\n    cin>>a[i];\n}\nfor(j=0;j<n-1;j++){\n    if(a[q]!=a[q+1]){\n                p+=2;\n                   for(int i=q;i<n;i++){\n                    a[i]=a[i+2];\n                    a[i+1]=a[i+3];\n                   }\n                   q--;\n        }\n    else q++;\n}\n\n\ncout<<p;\n}\n",WRONG_ANSWER,6,324
1591656202650836992,a5291eb67188c2a916aa5dd9fc38f2e449aa9f9a3cd047f282d8c154ea2979cd,2022-11-13 12:56:24,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,#include <iostream>\n#include <vector> \nusing namespace std;\n\nconst int N = 1e6 + 10;\nint h[N];\n\n\nint main()\n{\n\tint n = 0;\n\tcin >> n;\n\tfor(int i = 1;i <= n;i++)\n\t{\n\t\tcin >> h[i];\n\t}\n\tint S_max = 0;\n\tfor(int i = 1;i <= n;i++)\n\t{\n\t\tint k = n;\n\t\tfor(int j = n;j >= i;j--)\n\t\t{\n\t\t\tif(h[j] < h[i]) \n\t\t\t{\n\t\t\t\tk = j - 1;\n\t\t\t}\n\t\t}\n\t\t\n\t\tint S = h[i] * (k - i + 1);\n\t\tif(S > S_max)\n\t\t{\n\t\t\tS_max = S;\t\n\t\t}\t\n\t}\n\t\n\tcout << S_max << endl;\n\t\n\n\n\treturn 0;\n} ,WRONG_ANSWER,18,452
1591656232786911232,29d1ea54d6e4e56fc2de0be5ae10ecc4c70c7fca667934b17857e95530f5663a,2022-11-13 12:56:32,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n   int a[3],i,max,n;\n    for(i=0;i<3;i++)\n        scanf(\""%d\"",&a[i]);\n    a[max]=a[0];\n    for(i=0;i<3;i++)\n    {\n        if(a[max]<=a[i])\n            a[max]=a[i];\n\n    }\n    n=a[0]+a[1]+a[2]-a[max];\n    printf(\""%d\"",n);\n    return 0;\n}\n",WRONG_ANSWER,4,320
1591656244711272448,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-13 12:56:34,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#define MAXSIZE 100\nint main(){\n    int n,s[MAXSIZE];\n    int sum=0;\n        scanf(\""%d\"",&n);\n       for(int i=0;i<n;i++)\n        scanf(\""%d\"",&s[i]); \n       for(int i=0;i<n;i++)\n       {\n           if(s[i]>s[i+1])\n               sum++;\n       }\n    sum=sum-1;\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,6,352
1591656255406759936,4e8bf5e988ac4275aeb23eae913a385055ab79de14dc27373b9e62a15269d138,2022-11-13 12:56:37,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,b,c;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    int P,Q,R;\n    P=a+b;\n    Q=a+c;\n    R=b+c;\n    if(P/Q+P/R+Q/P+Q/R+R/P+R/Q!=4){\n    if(P/Q+P/R==0){printf(\""%d\\n\"",P);}\n    else if(Q/P+Q/R==0){printf(\""%d\\n\"",Q);}\n    else if(R/P+R/Q==0){printf(\""%d\\n\"",R);}\n    }else\n    {\n        if(P/Q+P/R==1){printf(\""%d\\n\"",P);}\n        else{printf(\""%d\\n\"",Q);}\n    }\n}",WRONG_ANSWER,19,392
1591656259013861376,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-13 12:56:38,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n\n\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"",&n);\n    \n    int arr[n];\n    int i = 0;\n    for(i = 0; i < n; ++i){\n        scanf(\""%d\"",&arr[i]);\n    }\n    \n    int width = 1;\n    int j = 0;\n    int mul = 1;\n    int max = 0;\n    for(i = 0; i < n; ++i){\n        for(j = i + 1; j < n; ++j){\n            if(arr[i] <= arr[j]){\n                ++width;\n            }\n            else{\n                break;\n            }\n        }\n        mul = width * arr[i];\n        \n        if(mul > max){\n            max = mul;\n        }\n        \n        width = 1;\n    }\n    \n    printf(\""%d\"",max);\n    \n    return 0;\n}\n\n\n",WRONG_ANSWER,18,360
1591656260255408128,fec6d07e317796c63fb7ae6e7538f75973ad64af6e6196cc27eed3e9e685bf86,2022-11-13 12:56:38,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int n,i,x=0,y=0;\n    int a,b;\n    scanf(\""%d\"",&n);\n        scanf(\""%d\"",&a);\n    for(i=0;i<n;i++)\n    {\n        b=a%10;\n        a=a/10;\n        if(b==0)\n            x++;\n        else if(b==1)\n            y++;\n    }\n    if(x>=y)\n        printf(\""%d\\n\"",y*2);\n    else\n        printf(\""%d\\n\"",x*2);\n\n}\n",WRONG_ANSWER,13,360
1591656266735562752,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-13 12:56:40,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a[4],b[4],i,j;\n    for(i=1;i<=3;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=1;i<=3;i++)\n        if(a[i]<a[i-1])\n    {\n        b[1]=a[i];\n        j=i;\n    }\n    a[j]=100000;\n    for(i=1;i<=3;i++)\n        if(a[i]<a[i-1])\n        b[2]=a[i];\n    printf(\""%d\\n\"",b[1]+b[2]);\n    return 0;\n}\n",WRONG_ANSWER,5,512
1591656268698497024,42cfad7191c5e6c0eee156c4369182744d6c5db3bc2a5dc87f9f1be6ee4bbcfe,2022-11-13 12:56:40,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main(){\n    int P,Q,R;\n    int flag=0,sum=0;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n\tif(flag==0){\n\tsum=sum+P;\n\tflag=1;\n  \t}  \t\n  \tif(flag==1){\n  \tsum=sum+Q;\n  \tflag=2;\n\t}\n\tif(flag==2)\n\tprintf(\""%d\"",sum);\n\treturn 0;\n} ",WRONG_ANSWER,9,488
1591656302219374592,64b76cc355daf11e96a19b338c58e56c05289d7e3809e9695a09e71771618713,2022-11-13 12:56:48,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R,temp=0;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n\n    if(P>=1)\n    {\n        if(P>=Q)\n            printf(\""%d\\n\"",temp=P+Q);\n        else\n            printf(\""%d\\n\"",temp=P+Q);\n    }\n    else\n    if(Q==0)\n        printf(\""%d\\n\"",temp=P+R);\n\n    return 0;\n}\n",WRONG_ANSWER,10,220
1591656303951667200,5b382280d947e26011a7c75c34d257662bc13c50f8257bc8cae807604d61430c,2022-11-13 12:56:49,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\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\tint n,i;\n\tint count=0;\n\tint a[100];\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=1;i<n;i++){\n\t\tif((a[i]<a[i-1]&&a[i]<a[i+1])||(a[i]==a[i-1]&&a[i+1]>a[i])){\n\t\t\tcount++;\n\t\t}\n\t}\n\tprintf(\""%d\"",count++);\n\treturn 0;\n}",WRONG_ANSWER,15,476
1591656350722351104,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-13 12:57:00,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    int n,i,j,k=0;\n    int a[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<10;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=0;j<n;j++)\n    {\n        if(a[j]<a[j-1]&&a[j]<a[j+1]||a[j]==a[j+1]&&a[j]<a[j-1]&&a[j+1]<a[j+2])\n        {\n            k++;\n        }\n    }\n    printf(\""%d\\n\"",k);\n}",WRONG_ANSWER,15,208
1591656374147493888,fc04467797ff55239c848b5102d2499d81faac6f07f19ed145b2c7ad9b809632,2022-11-13 12:57:05,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n=60;\n    scanf(\""\"",&n);\n    return 0;\n}",WRONG_ANSWER,6,196
1591656375711981568,212aee9dc233539050d1d324af20b580172711970f7c24349b9c7c8ac9b114cd,2022-11-13 12:57:06,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n    int x,y,z,m,n;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    m=x+y+z;\n    n=x+y;\n    if(x>=0 && x<=1000 && y>=0 && y<=1000 && z>=0 && z<=1000)\n        if(m>=n)\n        printf(\""%d\"",n);\n    if(n>=m)\n        printf(\""%d\"",m);\n    return 0;\n}\n",WRONG_ANSWER,16,384
1591656377632960512,225b1524edf804414c466257a4f19789fe127117b27e663dc835d742fed77f9e,2022-11-13 12:57:06,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,b,c;\n    printf(\""%d %d %d\"",&a,&b,&c);\n    int sum;\n    \n    sum=a+b;\n    printf(\""sum%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,4,332
1591656386730405888,09eb01e8f9f24922a6c60a1149d505ad1ebb9b0a39ed1101140fe0fd93daa753,2022-11-13 12:57:08,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\n    int n,i,counts=0;\n    int arr[100]={0};\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&arr[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n\n        if(arr[i]==arr[i+1])\n        {\n            arr[i]=arr[i+1];\n            n--;\n            counts++;\n        }\n        else if(arr[i]>arr[i+1]&&arr[i+1]<arr[i+2])\n        {\n\n            counts++;\n        }\n\n\n    }\n    printf(\""%d\"",counts);\n    return 0;\n}",WRONG_ANSWER,9,348
1591656405529321472,505c5b9a1b6d591a815315d95a57743fb98dad691b51421b4de282392fef3f43,2022-11-13 12:57:13,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    if(P+Q>Q+R)\n    {\n        printf(\""%d\"",Q+R);\n    }\n    else if(P+R>Q+R)\n    {\n        printf(\""%d\"",Q+R);\n    }\n    else if(Q+R>P+Q)\n    {\n        printf(\""%d\"",P+Q);\n    }\n    else if(Q+R>P+R)\n    {\n        printf(\""%d\"",P+R);\n    }\n}\n",WRONG_ANSWER,29,504
1591656408335310848,28b4de6882b7ade2679f59c486acaf307ce8415dcb0a15787dba589025bbdb02,2022-11-13 12:57:13,C++,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint n,i,j,k=0;\n\n\tscanf(\""%d\"",&n);\n\tgetchar();\n\tchar num[n+1];\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%c\"",&num[i]);\n\t}\n\tfor(i=1;i<n;i++)\n\t{\n\t\tif(num[i]!=num[i-1])\n\t\t{\n\t\t\tk=k+2;\n\t\t\tfor(j=i+1;j<n;j++)\n\t\t\t{\n\t\t\t\tnum[j-2]=num[j];\n\t\t\t}\n\t\t\ti=i-2;\n\t\t\tn=n-2;\n\t\t}\n\t}\n\tprintf(\""%d\\n\"",k);\n\treturn 0;\n}",WRONG_ANSWER,5,348
1591656443022204928,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 12:57:22,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <string.h>\nint main()\n{\n    int k,len,i,g,l;\n    char str[10] = {0};\n    scanf(\""%d\"",&k);\n    scanf(\""%s\"",str);\n    len  = strlen(str);\n    for(i=0;i<len;i++)\n    {\n        if(str[i]=='0')\n        g++;\n        else\n        l++;\n    }\n    g-=8;//0的个数;\n    l-=52;//1的个数;\n    if(g>l)\n    printf(\""4\\n\"");\n    else\n    printf(\""4\\n\"");\n    return 0;\n}\n",RUNTIME_ERROR,10,200
1591656443559043072,5bd1a8718ea7fb820055421c67b8e0a468e08d951f729a24e55bf407b3bdb1f6,2022-11-13 12:57:22,C++,300.0,1591610585635213316,1591130116607045632,1049226928954454016,#include <iostream>\n#include <string>\nusing namespace std;\n\n\n\n\n\n\nint main()\n{\n\n    cout<<60;\n\n    return 0;\n}\n,ACCEPTED,5,328
1591656461103849472,55950e2d4c314feed0856fa0f6b80f22c5c36f2ebe0d75c8ee2cadb1a06b2fe1,2022-11-13 12:57:26,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int n,a,b,c[100],i,d[100],an;\n    scanf(\""%d%d%d\"",%n,&a,&b);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&c[i]);\n        scanf(\""%d\"",&d[i]);\n        \n        \n    }\n    for(i=0;i<n;i++){\n        an=c[i]/(d[i]+1)*pow(a,d[i]+1)-(c[i])/((d[i]+1)*pow(b,d[i]+1));\n        \n        \n    }\n    \n    \n    \n    \n    \n    \n    \n    \n    \n    return 0;\n}",COMPILE_ERROR,0,0
1591656483031670784,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-13 12:57:31,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#define MAXSIZE 100\nint main(){\n    int n,s[MAXSIZE];\n    int sum=0;\n        scanf(\""%d\"",&n);\n       for(int i=0;i<n;i++)\n        scanf(\""%d\"",&s[i]); \n       for(int i=0;i<n;i++)\n       {\n           if(s[i]>s[i+1])\n               sum++;\n       }\n    sum=sum-1;\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,5,196
1591656484071813120,4812f9582f90b7f3f95178a62ec39f3555e90b935658da3e31a47fe0d2e8c6fd,2022-11-13 12:57:32,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main()\n{int i;\n\n    printf(\""%d\"",60);\n return 0;\n}",ACCEPTED,15,204
1591656488496848896,212aee9dc233539050d1d324af20b580172711970f7c24349b9c7c8ac9b114cd,2022-11-13 12:57:33,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n    int x,y,z,m,n;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    m=x+y+z;\n    n=x+y;\n    if(x>=1 && x<=1000 && y>=1 && y<=1000 && z>=1 && z<=1000)\n        if(m>=n)\n        printf(\""%d\"",n);\n    if(n>=m)\n        printf(\""%d\"",m);\n    return 0;\n}\n",WRONG_ANSWER,7,196
1591656495140626432,887d1bbe53a4d4a349813887f13126da5e46a853687f4c2c9d7b8ef3d748a9d6,2022-11-13 12:57:34,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nmain()\n{\n    int n,i,a[1000],num=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=2;i<n-1;i++)\n    {\n    \tif(a[i-1]>=a[i]&&a[i+1]>a[i])\n    \tnum++;\n\t}\n\tprintf(\""%d\"",num);\n}",ACCEPTED,42,384
1591656497313230848,55950e2d4c314feed0856fa0f6b80f22c5c36f2ebe0d75c8ee2cadb1a06b2fe1,2022-11-13 12:57:35,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int n,a,b,c[100],i,d[100],an;\n    scanf(\""%d%d%d\"",%n,&a,&b);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&c[i]);\n        scanf(\""%d\"",&d[i]);\n        \n        \n    }\n    for(i=0;i<n;i++){\n        an=c[i]/(d[i]+1)*pow(a,d[i]+1)-(c[i])/((d[i]+1)*pow(b,d[i]+1));\n        \n        \n    }\n    \n    \n    \n    \n    \n    \n    \n    \n    \n    return 0;\n}",COMPILE_ERROR,0,0
1591656527759728640,09eb01e8f9f24922a6c60a1149d505ad1ebb9b0a39ed1101140fe0fd93daa753,2022-11-13 12:57:42,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\n    int n,i,counts=0;\n    int arr[100]={0};\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&arr[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n\n        if(arr[i]==arr[i+1])\n        {\n            arr[i]=arr[i+1];\n            n--;\n            counts++;\n        }\n        else if(arr[i]>arr[i+1]&&arr[i+1]<arr[i+2])\n        {\n\n            counts++;\n        }\n\n\n    }\n    printf(\""%d\\n\"",counts);\n    return 0;\n}",WRONG_ANSWER,9,324
1591656528678281216,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 12:57:42,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[n],sum=0,i;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if(a[i]>a[i+2])\n        sum=sum+a[i]-5;\n        else sum=sum+a[i+2]-5;\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,6,328
1591656532180525056,55950e2d4c314feed0856fa0f6b80f22c5c36f2ebe0d75c8ee2cadb1a06b2fe1,2022-11-13 12:57:43,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int n,a,b,c[100],i,d[100],an;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&c[i]);\n        scanf(\""%d\"",&d[i]);\n        \n        \n    }\n    for(i=0;i<n;i++){\n        an=c[i]/(d[i]+1)*pow(a,d[i]+1)-(c[i])/((d[i]+1)*pow(b,d[i]+1));\n        \n        \n    }\n    \n    \n    \n    \n    \n    \n    \n    \n    \n    return 0;\n}",WRONG_ANSWER,8,328
1591656533296164864,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-13 12:57:43,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n\n\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"",&n);\n    \n    int arr[n];\n    int i = 0;\n    for(i = 0; i < n; ++i){\n        scanf(\""%d\"",&arr[i]);\n    }\n    \n    int width = 1;\n    int j = 0;\n    int mul = 1;\n    int max = 0;\n    for(i = 0; i < n; ++i){\n        for(j = i + 1; j < n; ++j){\n            if(arr[i] <= arr[j]){\n                ++width;\n            }\n            else{\n                break;\n            }\n        }\n        mul = width * arr[i];\n        \n        if(mul > max){\n            max = mul;\n        }\n        \n        width = 1;\n    }\n    \n    printf(\""%d\"",max);\n    \n    return 0;\n}\n\n\n",WRONG_ANSWER,26,492
1591656537737932800,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-13 12:57:44,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#define MAXSIZE 100\nint main(){\n    int n,s[MAXSIZE];\n    int sum=0;\n        scanf(\""%d\"",&n);\n       for(int i=0;i<n;i++)\n        scanf(\""%d\"",&s[i]); \n       for(int i=0;i<n;i++)\n       {\n           if(s[i]>s[i+1])\n               sum++;\n       }\n    sum=sum-1;\n    printf(\""%d\\n\"",sum);\n    return 0;\n}",WRONG_ANSWER,6,324
1591656552908730368,fa305ee4bf4c6a54add4e945b551f1e902b95c1a179a91ded55bf7ebb1c87c23,2022-11-13 12:57:48,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{   int n,i,x=0;\n   scanf(\""%d\"",&n);\n   char s[n];\n   scanf(\""%s\"",s);\n   for(i=0;i<n;i++){\n    if(s[i]!=s[i+1]){\n        s[i]=s[i+2];\n    }\n    n=n-2;\n    x=x+2;\n   }\n\nprintf(\""%d\\n\"",x);\n    return 0;\n}\n",WRONG_ANSWER,5,200
1591656569744678912,262cde49cc56abe96630625fe60c7207e4f635bd56c839389b503b1f360d8ab2,2022-11-13 12:57:52,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\nint a,b,c,t;\n    scanf(\""%d%d%d\"",&a,&b,&c);\n    if(a>b){\n        t=b;b=a;a=t;\n    }\n    if(b>c){\n        t=b;b=c;c=t;\n    }\n    if(a>b){\n        t=a;a=b;b=t;\n    }\n    printf(\""c+b=%d\"",c+b);\n    return 0;\n}",WRONG_ANSWER,4,332
1591656585318129664,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-13 12:57:56,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#define MAXSIZE 100\nint main(){\n    int n,s[MAXSIZE];\n    int sum=0;\n        scanf(\""%d\"",&n);\n       for(int i=0;i<n;i++)\n        scanf(\""%d\"",&s[i]); \n       for(int i=0;i<n;i++)\n       {\n           if(s[i]>s[i+1])\n               sum++;\n       }\n    sum=sum-1;\n    printf(\""%d\\n\"",sum);\n    return 0;\n}",WRONG_ANSWER,9,196
1591656592783990784,4812f9582f90b7f3f95178a62ec39f3555e90b935658da3e31a47fe0d2e8c6fd,2022-11-13 12:57:57,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main()\n{int i;\n    printf(\""%d\"",60);\n return 0;\n}",ACCEPTED,6,508
1591656621351428096,e0156cb930d51b3d5482d43809e7b2c1f54a6b8623fccfa3202e2e53ddf1ffbf,2022-11-13 12:58:04,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\nint a,b,c,sum;\nscanf(\""%d%d%d\"",&a,&b,&c,sum);\nsum=a+b&&a+c&&b+c;\nif(a+b<a+c<b+c);\n    printf(\""%d\\n\"",sum=a+b);\n    while(a+c<a+b<b+c);\n        printf(\""%d\\n\"",sum=a+c);\n        while(b+c<a+b<a+c);\n        printf(\""%d\\n\"",sum=b+c);\n    return 0;\n\n}\n",TIME_LIMIT_EXCEEDED,400,460
1591656646596911104,fbea21dbaf89f1b064feaa20227f21c5e1c4888fdc371cf5e43f70615906e52a,2022-11-13 12:58:10,Python,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"n=list(map(int,input().split()))\nc=3\nx=0\ncost=[]\nfor i in range(c):\n    for j in range(i+1,c):\n        x=n[i]+n[j]\n        cost.append(x)\nprint(min(cost))\n        ",ACCEPTED,81,2936
1591656654385766400,55950e2d4c314feed0856fa0f6b80f22c5c36f2ebe0d75c8ee2cadb1a06b2fe1,2022-11-13 12:58:12,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int n,a,b,c[100],i,d[100],an;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&c[i]);\n        scanf(\""%d\"",&d[i]);\n        \n        \n    }\n    for(i=0;i<n;i++){\n        an=(c[i])/(d[i]+1)*pow(a,d[i]+1)-(c[i])/((d[i]+1)*pow(b,d[i]+1));\n        \n        \n    }\n    \n    \n    \n    \n    \n    \n    \n    \n    \n    return 0;\n}",WRONG_ANSWER,6,324
1591656667711070208,abe2744e33bb397ffb9bb13afcb202f611378fb4fc5801202f03933298ce5f5d,2022-11-13 12:58:15,Java,300.0,1591610585635213312,1589816514637750272,1049226928954454016,import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\npublic static void main(String[] args) throws IOException{\n\tBufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n\tint n = Integer.valueOf(reader.readLine());\n\tString string = reader.readLine();\n\t\n\t\n\tint count0=0;\n\tint count1=0;\n\tfor(int i=0;i<n;i++){\n\t\tif(string.charAt(i)=='0'){\n         count0++;\n          }\n\t\tif(string.charAt(i)=='1'){\n\t\t\tcount1++;\n\t\t\t\n\t\t}\n\t}\n\t\n\tif(count1>=count0){\n\t\tSystem.out.println(n-(count1-count0));\n\t}\n\telse{\n\t\tSystem.out.println(n-(count0-count1));\n\t}\n\t\n}\n}\n,ACCEPTED,355,24464
1591656691777986560,0c2907a154c1c61744366e94f73ae426665222ffae8eff7042dd0fd7bd8760fb,2022-11-13 12:58:21,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{int p,q,r;\n    scanf(\""%d %d %d\"",&p,&q,&r);\nint min;\nif(p>=q&&p>=r)\n    min=q+r;\nif(q>=p&&q>=r)\n    min=q+r;\nif(r>=q&&r>=p)\n    min=q+r;\nprintf(\""%d\"",min);\n\n\n    return 0;\n}\n",WRONG_ANSWER,11,328
1591656705392697344,c39a4349139942a7aa7456b2c4609f8d0f9d0d3465be213d33870ec87eab1e58,2022-11-13 12:58:24,C++,0.0,1591610585635213314,1591128862958940160,1049226928954454016,"#include <stdio.h>\n\nint main(void) \n{\n\tint n,a[100],i,c;\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n-1;i++)\n\t{\n\t\tscanf(\""%d\"",&a[i]); \n\t}\n for(i=0;i<n-1;i++)\n {\n     if(a[i]<a[i+1])\n     {\n       c=a[i];\n         a[i]=a[i+1];\n         a[i+1]=c;\n         \n     }\n     else continue;\n }\n    \n    printf(\""%d \"",n);\n    for(i=0;i<n-1;i++)\n        printf(\""%2d\"",a[i]);\n    return 0;\n}",SEGMENTATION_FAULT,8,356
1591656709654077440,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-13 12:58:25,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\nint main(){\n    int gd = -5; // 固定减5\n    int count = 0;\n    int num = 0;\n    int len;\n    if(scanf(\""%d\"",&len)){};\n    int arr[] = new int[len];   \n    \n        for(int i=0; i<len; i++){\n            arr[i] = sc.nextInt();\n        }\n        \n        for(int j=0; j<len; j++){\n            // 给count赋值 单步最大\n            if(arr[j+1]+gd > arr[j+3]+gd){\n                count = arr[j+1]+gd;\n            }else{\n                count = arr[j+3]+gd;\n            }\n            // 总数最大\n            if(count>num){\n                num = count;\n            }\n        }\n    printf(\""%d\"",count);\n}",COMPILE_ERROR,0,0
1591656709779906560,af559dccfa68c49b94a61e83fc9942ea0513a50e66ecf36dc005df0e7960903e,2022-11-13 12:58:25,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n;\n    int num=0;\n        scanf(\""%d\"",&n);\n    char s[n];\n    for(int j=0;j<n;j++){\n        scanf(\""%c\"",&s[j]);\n        if(s[j]=='1')num++;\n    }\n    for(int i=0;i<n;i++){\n         if(s[i]=='0')num--;\n        if(s[i]=='1')num++;\n    }\n  if(num>=0){\n        printf(\""%d\\n\"",(n-num));\n    }\n    else{\n        printf(\""%d\\n\"",(n+num));\n    }\n    return 0;\n}",WRONG_ANSWER,5,352
1591656737214849024,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-13 12:58:32,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\nint main(void)\n{\n    int P=3,Q=2,s;\n    s=P+Q;\n    printf(\""%d\\n\"",s);\n    return 0;\n}",WRONG_ANSWER,5,324
1591656739349749760,15ac7d06a472ca25d78349f7cc3a73d23c7d7a4f0c4ae3cec6200fcdb8135965,2022-11-13 12:58:32,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i;\n    int a[500];\n    scanf(\""%d\"",&n);\n    for(j=0;j<=n-1;j++)\n    scanf(\""%d\"",&a[j]);\n    for(i=1;i<=n-1;i++)\n        if(a[i]==a[i+1]){\n            s++;\n        }\n   printf(\""%d\"",s-1);\n    \n    return 0;\n}\n",COMPILE_ERROR,0,0
1591656753841070080,5b382280d947e26011a7c75c34d257662bc13c50f8257bc8cae807604d61430c,2022-11-13 12:58:36,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\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\tint n,i;\n\tint count=0;\n\tint a[100];\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=1;i<n-1;i++){\n\t\tif((a[i]<a[i-1]&&a[i]<a[i+1])||(a[i]==a[i-1]&&a[i+1]>a[i])){\n\t\t\tcount++;\n\t\t}\n\t}\n\tprintf(\""%d\"",count++);\n\treturn 0;\n}",RUNTIME_ERROR,53,356
1591656774502244352,6b02dfcf297d52c2de2e1416b33ee988ff909834c73207b147423a8301e9d174,2022-11-13 12:58:41,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    for(i=0;i<3;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    int a=5;\n    printf(\""%d\"",a);\n    return 0;\n}",COMPILE_ERROR,0,0
1591656775332716544,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-13 12:58:41,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\nint main(void)\n{\n    int P=3,Q=2,s;\n    s=P+Q;\n    printf(\""%d\\n\"",s);\n    return 0;\n}",WRONG_ANSWER,6,476
1591656777148817408,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-13 12:58:41,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#define MAXSIZE 100\nint main(){\n    int n,s[MAXSIZE];\n    int sum=0;\n        scanf(\""%d\"",&n);\n       for(int i=0;i<n;i++)\n        scanf(\""%d\"",&s[i]); \n       for(int i=0;i<n;i++)\n           if(s[i]>s[i+1])\n               sum++;\n    sum=sum-1;\n    printf(\""%d\\n\"",sum);\n    return 0;\n}",WRONG_ANSWER,9,200
1591656791673724928,212aee9dc233539050d1d324af20b580172711970f7c24349b9c7c8ac9b114cd,2022-11-13 12:58:45,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n    int p,q,r,m,n;\n    scanf(\""%d %d %d\"",&p,&q,&r);\n    m=p+q+r;\n    n=p+q;\n    if(p>=1 && p<=1000 && q>=1 && q<=1000 && r>=1 && r<=1000)\n        if(m>=n)\n        printf(\""%d\"",n);\n    if(n>=m)\n        printf(\""%d\"",m);\n    return 0;\n}\n",WRONG_ANSWER,6,320
1591656805586198528,d808f4cc3c70a696f5c416714e0998fe96743e5273bc07a26f75738d12d304f5,2022-11-13 12:58:48,Java,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n        int n,a,b;\n        double x=0,y=0;\n        Scanner sc=new Scanner(System.in);\n        n=sc.nextInt();\n        a=sc.nextInt();\n        b=sc.nextInt();\n        int[] c=new int[n];\n        for(int i=0;i<n;i++){\n        \tc[i]=sc.nextInt();\n        } \n        int[] f=new int[n];\n        for(int i=0;i<n;i++){\n        \tf[i]=sc.nextInt();\n        }\n        for(int i=0;i<n;i++){\n        \tx+=c[i]/(f[i]+1)*Math.pow(a, (f[i]+1));\n        \ty+=c[i]/(f[i]+1)*Math.pow(b, (f[i]+1));\t\n        }\n        System.out.format(\""%.0f\"",x-y);\n\t}\n}\n",WRONG_ANSWER,114,24548
1591656809310740480,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-13 12:58:49,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    int n,i,j,k=0;\n    int a[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<10;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=1;j<n-1;j++)\n    {\n        if(a[j]<a[j-1]&&a[j]<a[j+1]||a[j]==a[j+1]&&a[j]<a[j-1]&&a[j+1]<a[j+2])\n        {\n            k++;\n        }\n    }\n    printf(\""%d\\n\"",k);\n}",WRONG_ANSWER,22,200
1591656842827456512,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 12:58:57,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[n],sum=0,i;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i=i+3)\n    {\n        if(a[i]>a[i+2])\n        sum=sum+a[i]-5;\n        else sum=sum+a[i+2]-5;\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,5,476
1591656859264901120,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-13 12:59:01,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include(stdio.h)\nint main()\n{\n    int n,h[n-1],a=0;\n    h[0]=h[n-1]=0;\n    scanf(\""%d\\n\"",&n);\n    scanf(\""%d\"",n-1);\n    if(n>=3&&n<=10000&&h[n-1]>=0&&h[n-1]<=1000)\n    {\n        if(h[n-1]>=h[n]&&h[n]<=h[n+1])\n            a=a+1;\n        if(h[n]==h[n-1])\n           a=a+1;\n    }\n    printf(\""%d\"",&a);\n        return 0;\n}",COMPILE_ERROR,0,0
1591656867481530368,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-13 12:59:03,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#define MAXSIZE 1000000\nint main(){\n    int n,s[MAXSIZE];\n    int sum=0;\n        scanf(\""%d\"",&n);\n       for(int i=0;i<n;i++)\n        scanf(\""%d\"",&s[i]); \n       for(int i=0;i<n;i++)\n           if(s[i]>s[i+1])\n               sum++;\n    sum=sum-1;\n    printf(\""%d\\n\"",sum);\n    return 0;\n}",WRONG_ANSWER,10,640
1591656884250402816,190178fcb71270e17fbe689a22517f5296281dfcd3b16ec01748057e49740d1d,2022-11-13 12:59:07,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n    int P=0,Q=0,R=0,X,Y,Z;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    X=P+Q;\n    Y=Q+R;\n    Z=R+P;\n    if(X<=Y||X<=Z)\n    printf(\""%d\"",X);\n    else if(Y<=X||Y<=Z)\n    printf(\""%d\"",Y);\n    else if(Z<=X||Z<=Y)\n    printf(\""%d\"",Z);\n    return 0;\n}",WRONG_ANSWER,13,348
1591656892307615744,d808f4cc3c70a696f5c416714e0998fe96743e5273bc07a26f75738d12d304f5,2022-11-13 12:59:09,Java,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n        int n,a,b;\n        double x=0,y=0;\n        Scanner sc=new Scanner(System.in);\n        n=sc.nextInt();\n        a=sc.nextInt();\n        b=sc.nextInt();\n        int[] c=new int[n];\n        for(int i=0;i<n;i++){\n        \tc[i]=sc.nextInt();\n        } \n        int[] f=new int[n];\n        for(int i=0;i<n;i++){\n        \tf[i]=sc.nextInt();\n        }\n        for(int i=0;i<n;i++){\n        \tx+=c[i]/(f[i]+1)*Math.pow(a, (f[i]+1));\n        \ty+=c[i]/(f[i]+1)*Math.pow(b, (f[i]+1));\t\n        }\n        System.out.format(\""%.0f\\n\"",x-y);\n\t}\n}\n",WRONG_ANSWER,111,25460
1591656897273683968,28b4de6882b7ade2679f59c486acaf307ce8415dcb0a15787dba589025bbdb02,2022-11-13 12:59:10,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint n,i,j,k=0;\n\n\tscanf(\""%d\"",&n);\n\tgetchar();\n\tchar num[n+1];\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%c\"",&num[i]);\n\t}\n\tfor(i=1;i<n;i++)\n\t{\n\t\tif(num[i]!=num[i-1])\n\t\t{\n\t\t\tk=k+2;\n\t\t\tfor(j=i+1;j<n;j++)\n\t\t\t{\n\t\t\t\tnum[j-2]=num[j];\n\t\t\t}\n\t\t\ti=i-2;\n\t\t\tn=n-2;\n\t\t}\n\t}\n\tprintf(\""%d\\n\"",k);\n\treturn 0;\n}",WRONG_ANSWER,5,476
1591656925492961280,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-13 12:59:17,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\nint main(){\n    int gd = -5; // 固定减5\n    int count = 0;\n    int num = 0;\n    int len;\n    if(scanf(\""%d\"",&len)){};\n    int arr[] = int[len];   \n    \n        for(int i=0; i<len; i++){\n            if(scanf(\""%d\"",&arr[i])){};\n        }\n        \n        for(int j=0; j<len; j++){\n            // 给count赋值 单步最大\n            if(arr[j+1]+gd > arr[j+3]+gd){\n                count = arr[j+1]+gd;\n            }else{\n                count = arr[j+3]+gd;\n            }\n            // 总数最大\n            if(count>num){\n                num = count;\n            }\n        }\n    printf(\""%d\"",count);\n}",COMPILE_ERROR,0,0
1591656936897306624,d9e13de81d487f21b11cf0fc38d2ef82b49d511a81ed1305cdfa47276a1c2e23,2022-11-13 12:59:19,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n\tint P,Q,R,a,b,c,t;\n\tscanf(\""%d %d %d\"",&P,&Q,&R);\n\tif(P,Q,R>=1&&P,Q,R<=1000)\n\t{\n\t\ta=P+Q;\n\t\tb=P+R;\n\t\tc=Q+R;\n\t\tif(a<=b&&a<=c)\n\t {\n\t\tt=a;\n\t }\n\tif(b<=a&&b<=c)\n \t {\n\t\tt=b;\n\t }\n\telse\n \t {\n\t\tt=c;\n \t }\n\t}\n\n\tprintf(\""%d\\n\"",t);\n\treturn 0;\n } ",WRONG_ANSWER,11,196
1591656962268618752,0ac60c8cba5dc039a812c57a79304a29dc187bee37ef204107b64c7a81bc6988,2022-11-13 12:59:26,Python,300.0,1591610585635213318,1591131464941563904,1049226928954454016,list=input().split()\na=int(list[0])+int(list[1])\nb=int(list[1])+int(list[2])\nc=int(list[2])+int(list[0])\nif a>b:\n   min=b\n   if c<min:\n      min=c\n   else:\n      min=b\nelse:\n   min=a\n   if c<min:\n      min=c\n   else:\n      min=a\nprint(min),ACCEPTED,93,2936
1591656970070056960,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-13 12:59:27,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j,k=0;\n    int a[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<10;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=1;j<n-1;j++)\n    {\n        if(a[j]<a[j-1]&&a[j]<a[j+1]||a[j]==a[j+1]&&a[j]<a[j-1]&&a[j+1]<a[j+2])\n        {\n            k++;\n        }\n    }\n    printf(\""%d\\n\"",k);\n}",WRONG_ANSWER,19,384
1591656986973102080,fc04467797ff55239c848b5102d2499d81faac6f07f19ed145b2c7ad9b809632,2022-11-13 12:59:31,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n=60;\n    scanf(\""\"",&n);\n    return 0;\n}",WRONG_ANSWER,6,196
1591656993335828480,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-13 12:59:33,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int p,q,r;\n    scanf(\""%d %d %d\"",&p,&q,&r);\n    int min=0,a=0,b=0,c=0;\n    a=p+q;\n    b=q+r;\n    c=r+p;\n    if(a>b)\n    {\n        if(b>c)\n            min=c;\n        if(b<c||c<a)\n                min=b;\n    }\n    if(b>a)\n    {\n        if(a>c)\n        min=c;\n        if(a<c||c<b)\n            min=a;\n    }\n      if(c>a)\n    {\n        if(a<b||b<c)\n            min=a;\n        if(a>b)\n            min=b;\n    }\n    printf(\""%d\"",min);\n}",ACCEPTED,33,496
1591657008775049216,1a4463a67236431e94a4a4d273d88450d6acce220fed7155af8798b0664ee731,2022-11-13 12:59:37,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R;\n    scanf(\""%d,%d,%d\"",&P,&Q,&R);\n    if(P>=1&&R<=1000)\n    {\n    if(P+Q>=R)\n    {\n    printf(\""%d\"",P+Q);\n    }\n    else if(R>=P+Q)\n    {\n    printf(\""%d\"",R);\n    }\n    }\n    return 0;\n}\n",WRONG_ANSWER,12,512
1591657009970438144,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-13 12:59:37,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a[4],b[4],i,j;\n    for(i=1;i<=3;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=1;i<=3;i++)\n        if(a[i]<a[i-1])\n    {\n        b[1]=a[i];\n        j=i;\n    }\n    a[j]=100000;\n    for(i=1;i<=3;i++)\n        if(a[i]<a[i-1])\n        b[2]=a[i];\n    printf(\""%d\\n\"",b[1]+b[2]);\n    return 0;\n}\n",WRONG_ANSWER,25,460
1591657026055581696,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-13 12:59:41,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\nint main(){\n    int gd = -5; // 固定减5\n    int count = 0;\n    int num = 0;\n    int len;\n    if(scanf(\""%d\"",&len)){};\n    int arr[len];   \n    \n        for(int i=0; i<len; i++){\n            if(scanf(\""%d\"",&arr[i])){};\n        }\n        \n        for(int j=0; j<len; j++){\n            // 给count赋值 单步最大\n            if(arr[j+1]+gd > arr[j+3]+gd){\n                count = arr[j+1]+gd;\n            }else{\n                count = arr[j+3]+gd;\n            }\n            // 总数最大\n            if(count>num){\n                num = count;\n            }\n        }\n    printf(\""%d\"",count);\n}",WRONG_ANSWER,7,320
1591657078136266752,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-13 12:59:53,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include(stdio.h)\nint main()\n{\n    int n,h[n-1],a=0;\n    h[0]=h[n-1]=0;\n    scanf(\""%d\\n\"",&n);\n    scanf(\""%d\"",n-1);\n    if(n>=3&&n<=10000&&h[n-1]>=0&&h[n-1]<=1000)\n    {\n        h[n-1]>=h[n]&&h[n]<=h[n+1]\n            a=a+1;\n        h[n]==h[n-1]\n           a=a+1;\n    }\n    printf(\""%d\"",&a);\n        return 0;\n}",COMPILE_ERROR,0,0
1591657085413416960,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-13 12:59:55,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#define MAXSIZE 10000\nint main(){\n    int n,s[MAXSIZE];\n    int sum=0;\n        scanf(\""%d\"",&n);\n       for(int i=0;i<n;i++)\n        scanf(\""%d\"",&s[i]); \n       for(int i=0;i<n;i++)\n           if(s[i]>s[i+1])\n               sum++;\n    sum=sum-1;\n    printf(\""%d\\n\"",sum);\n    return 0;\n}",WRONG_ANSWER,9,348
1591657088823353344,262cde49cc56abe96630625fe60c7207e4f635bd56c839389b503b1f360d8ab2,2022-11-13 12:59:56,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\nint a,b,c,t;\n    scanf(\""%d%d%d\"",&a,&b,&c);\n    if(a>b){\n        t=b;b=a;a=t;\n    }\n    if(b>c){\n        t=b;b=c;c=t;\n    }\n    if(a>b){\n        t=a;a=b;b=t;\n    }\n    printf(\""%d\"",a+b);\n    return 0;\n}",ACCEPTED,33,348
1591657103486627840,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-13 12:59:59,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"\nP=eval(input())\nQ=eval(input())\nR=eval(input())\n1<=P,Q,R<=1000\na=P+Q\nb=Q+R\nc=R+P\nif a<b:\n   if a<c:\n    print(a)\nif b<a:\n   if b<c:\n    print(b)\nif c<a:\n   if c<b:\n    print(c)\n",NON_ZERO_EXIT_CODE,15,2760
1591657165541400576,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 13:00:14,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <string.h>\nint main()\n{\n    int k,len,i,g,l;\n    char str[10] = {0};\n    if(scanf(\""%d\"",&k)==1)\n    if(scanf(\""%s\"",str))\n    len  = strlen(str);\n    for(i=0;i<len;i++)\n    {\n        if(str[i]=='0')\n        g++;\n        else\n        l++;\n    }\n    g-=8;//0的个数;\n    l-=52;//1的个数;\n    if(g>l)\n    printf(\""4\\n\"");\n    else\n    printf(\""4\\n\"");\n    return 0;\n}\n",RUNTIME_ERROR,6,324
1591657176467517440,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-13 13:00:17,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\nint b[100];\nint a,i,sum;\n    sum=0;\nscanf(\""%d\"",&a);\nfor(i=0;i<a;i++)\n{\n    scanf(\""%d\"",&b[i]);\n    sum+=b[i];\n}\n    i-=1;\n sum-=5*i;\n    sum+=b[0];\n    printf(\""%d\\n\"",sum);\n    return 0;\n    \n}\n",SEGMENTATION_FAULT,9,348
1591657181429424128,1f29a576db974352c60cbe8aafdc4e5328b24d800890ab1c712d8c9fa85d72cc,2022-11-13 13:00:18,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint a[n],i;\n\tfor(i=0;i<n;i++)\n\tscanf(\""%d\"",&a[i]);\n\t\n\tint wow=0;\n\tfor(i=1;i<n-1;i++)\n\t{\n\t    if(a[i-1]>a[i]&&a[i]<a[i+1]) wow=wow+1;\n\t    if(a[i-2]>a[i-1]&&a[i]<a[i+1]) wow=wow+1;\n\t}\n\tprintf(\""%d\"",wow);\n\treturn 0;\n } ",WRONG_ANSWER,8,324
1591657186156404736,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-13 13:00:19,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b,c,temp;\n    scanf(\""%d%d%d\"",&a,&b,&c);\n    temp=a+b;\n    if(b+c<temp)\n        temp=b+c;\n    else if(c+a<temp)\n        temp=c+a;\n    printf(\""%d\"",temp);\n    return 0;\n}\n",ACCEPTED,26,356
1591657186726785024,0d24b4ee85e6e3a4cc694f7e11105fa2aaf93fd10d4cbe81657f252e2d675435,2022-11-13 13:00:19,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#define N 100\nint sum=0;\nvoid func(int x,int y,int z);\nint main()\n{\n    int n,n1,n2;\n    int a,b;\n    scanf(\""%d %d %d\"",&n,&n1,&n2);\n    while(n>0){\n        scanf(\""%d %d\"",&a,&b);\n         if(a==(b-1)){\n            func(b,n1,n2);\n         }\n        n--;\n\n    }\n\n  printf(\""%d\"",sum);\n    return 0;\n}\nvoid func(int x,int y,int z){\nint m,n;\nm=pow(y,x);\nn=pow(z,x);\nsum+=(m-n);\n //printf(\""%d\\n\"",sum);\n}\n",WRONG_ANSWER,5,196
1591657203462070272,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-13 13:00:23,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\nint main(){\n    int gd = -5; // 固定减5\n    int count = 0;\n    int num = 0;\n    int len;\n    if(scanf(\""%d\"",&len)){};\n    int arr[len];\n    \n        for(int i=0; i<len; i++){\n            if(scanf(\""%d\"",&arr[i])){};\n        }\n        \n        for(int j=0; j<len; j++){\n            // 给count赋值 单步最大\n            if(arr[j]+gd > arr[j+3]+gd){\n                count = arr[j]+gd;\n            }else{\n                count = arr[j+3]+gd;\n            }\n            // 总数最大\n            if(count>num){\n                num = count;\n            }\n        }\n    printf(\""%d\"",count);\n}",WRONG_ANSWER,7,192
1591657217668165632,8cf8229a23351e1ca2a7bfc1ad0af3ab2ad4a709a7c796637dbdea7befc2b0ec,2022-11-13 13:00:26,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R;\n    int a,b,c,min;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    a=P+Q;\n    b=P+R;\n    c=Q+R;\n    min=a;\n    if (a<b)\n    {\n        min=a;\n     if (b<c)\n        min=b;\n    }\n        else if(a>c)\n         min=c;\n        printf(\""%d\"",min);\n    return 0;\n}\n",WRONG_ANSWER,5,200
1591657218511233024,e0ad880549bf3b7847204a80a93841fe1f47e1fb8bc464088cb521848107cfde,2022-11-13 13:00:27,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#define N 3\n\nint main()\n{\n    int A[N],max,min,sum=0;\n    int i;\n    for(i=0;i<N;i++)\n        scanf(\""%d\"",&A[i]);\n    max=min=A[0];\n    for(i=0;i<N;i++)\n    {\n     if(A[i]>max)\n        max=A[i];\n     if(A[i]<min)\n        min=A[i];\n     sum+=A[i];\n    }\n    printf(\""%d\\n\"",sum-max);\n    return 0;\n}",ACCEPTED,35,328
1591657238169968640,281adcca8943f9f4c0ced14f1ceffe157a34fca39f3cb864eb95e400944e38a8,2022-11-13 13:00:31,Java,300.0,1591610585639407616,1591132307937943552,1049226928954454016,\nimport java.util.Arrays;\nimport java.util.Scanner;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner scan=new Scanner(System.in);\n\t\tint n=scan.nextInt();\n\t\tint[] arr=new int[n];\n\t\tfor(int m=0;m<n;m++){\n\t\t\tarr[m]=scan.nextInt();\n\t\t}\n\t\tint i=0;\n\t\tint j=1;\n\t\tint k=2;\n\t\tboolean flag=true;\n\t\tint sum=0;\n\t\twhile(k<n){\n\t\t\tif(arr[i]>arr[j]&&arr[k]>arr[j]){\n\t\t\t\tsum++;\n\t\t\t}if(arr[i]>arr[j]&&arr[j]==arr[k]){\n\t\t\t\tsum++;\n\t\t\t}\n\t\t\ti++;\n\t\t\tj++;\n\t\t\tk++;\n\t\t}\n\t\tSystem.out.print(sum);\n\t\t\n\t}\n\n}\n,ACCEPTED,591,25940
1591657238622953472,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 13:00:31,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <string.h>\nint main()\n{\n    int k,len,i,g,l;\n    char str[10] = {0};\n    if(scanf(\""%d\"",&k)==1)\n    if(scanf(\""%s\"",str))\n    len  = strlen(str);\n    for(i=0;i<len;i++)\n    {\n        if(str[i]=='0')\n        g++;\n        else\n        l++;\n    }\n    g-=8;//0的个数;\n    l-=52;//1的个数;\n    if(g>l)\n    printf(\""4\\n\"");\n    else\n    printf(\""4\\n\"");\n    return 0;\n}\n",RUNTIME_ERROR,5,200
1591657262102634496,33066437ddee11f609c900fe8dbd59cb8113e4d8dfd13c1812f199f4f3fdd334,2022-11-13 13:00:37,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 10000\n\nint main()\n{\n    int n,i,a[N],flag=0,t;\n    scanf(\""%d\"",&n);\n    a[0]=a[n]=0;\n    for(i=1;i<n-1;i++)\n    {\n        scanf(\""%d\"",a[i]);\n    }\n    for(i=1;i<n;i++)\n    {\n        while(a[i]>=a[i+1])\n        {\n            t=i+1;\n            if(a[t+1]=a[t]) t++;\n            if(a[t+1]>a[t]) flag++;\n            i++;\n        }\n     }\n    printf(\""%d\"",flag);\n}",SEGMENTATION_FAULT,6,512
1591657282692460544,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-13 13:00:42,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main(){\n    int i,lucheng[2],sum[5],min=10*10*10*3;\n    for(i=0;i<3;i++){\n        scanf(\""%d\"",&lucheng[i]);\n    }\n    sum[0]=lucheng[0]+lucheng[1];\n    sum[1]=lucheng[2]+lucheng[1];\n    sum[2]=lucheng[0]+lucheng[2];\n    sum[3]=lucheng[0]+lucheng[1];\n    sum[4]=lucheng[2]+lucheng[1];\n    sum[5]=lucheng[0]+lucheng[2];\n    for(i=0;i<5;i++){\n        if(sum[i]<=min){\n            min=sum[i];\n        }\n    }\n    printf(\""%d\\n\"",min);\n    return 0;\n}",WRONG_ANSWER,5,200
1591657322840338432,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-13 13:00:51,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#define MAXSIZE 10000\nint main(){\n    int n,s[MAXSIZE];\n    int sum=0;\n        scanf(\""%d\"",&n);\n       for(int i=0;i<n;i++)\n        scanf(\""%d\"",&s[i]); \n       for(int i=0;i<n;i++)\n           if(s[i]>s[i+1])\n               sum++;\n    sum=sum-1;\n    printf(\""%d\"",sum);\n    printf(\""\\n\"");\n    return 0;\n}",WRONG_ANSWER,6,328
1591657323217838080,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-13 13:00:52,Python,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"money = list(map(int,input().split()))\nmoney.sort()\ndata = money[0]+money[1]\nprint(data)",ACCEPTED,91,2912
1591657344076111872,0ed66ddb50163bbc5dd43c591bc3d500e68ed69fe23bfebfa6ac827c1dfc1849,2022-11-13 13:00:57,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nmain()\n{\n    int n,i,j,sum,count1=0,count2;\n    int h[99];\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++)\n        scanf(\""%d\"",&h[i]);\n    for(i=1;i<n;i++)\n    {\n        sum=1;\n        for(j=i+1;j<=n;j++)\n            {if(h[i]<=h[j])\n                sum++;\n            else\n                break;\n            }\n            count2=h[i]*sum;\n        if(count1<count2)\n            count1=count2;\n    }\n    printf(\""%d\"",count1);\n}\n",WRONG_ANSWER,27,512
1591657344520708096,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-13 13:00:57,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#define MAXSIZE 10000\nint main(){\n    int n,s[MAXSIZE];\n    int sum=0;\n        scanf(\""%d\"",&n);\n       for(int i=0;i<n;i++)\n        scanf(\""%d\"",&s[i]); \n       for(int i=0;i<n;i++)\n           if(s[i]>s[i+1])\n               sum++;\n    sum=sum-1;\n    printf(\""%d\"",sum);\n    printf(\""\\n\"");\n    return 0;\n}",WRONG_ANSWER,4,368
1591657345678368768,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-13 13:00:57,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main(){\n\tint n;\n\tint i;\n\tint count1=0,count2=0;\n\tint a[10000]={0};\n\tscanf(\""%d\"",&n);\n\tif(n<3||n>10000){\n\t\treturn 0;\n\t}\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=1;i<n;i++){\n\t\tif(a[i]<a[i-1]&&a[i]<a[i+1]){\n\t\t\tcount1++;\n\t\t}\n\t}\n\tint j;\n\tfor(i=1;i<n;i++){\n\t\t\t if(a[i]==a[i+1]&&a[i+1]<a[i+2]){\n\t\t\t\t for(j=i;j>0;j--){\n\t\t\t\t\t if(a[i]<a[j]){\n\t\t\t\t\t\t count2++;\n\t\t\t\t\t\t break;\n\t\t\t\t }}\n\t\t}\n\t}\n\tint sum;\n\tsum=count1+count2;\n\tprintf(\""%d\\n\"",sum);\n    return 0;\n}",ACCEPTED,34,476
1591657366897319936,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-13 13:01:02,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int n,i,j,k=0;\n    int a[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<10;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=1;j<n-1;j++)\n    {\n        if(a[j]<a[j-1]&&a[j]<a[j+1]||a[j]==a[j+1]&&a[j]<a[j-1]&&a[j+1]<a[j+2])\n        {\n            k++;\n        }\n    }\n    printf(\""%d\\n\"",k);\n    return 0;\n}",WRONG_ANSWER,36,640
1591657372345708544,0d24b4ee85e6e3a4cc694f7e11105fa2aaf93fd10d4cbe81657f252e2d675435,2022-11-13 13:01:03,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#define N 1000000\nint sum=0;\nvoid func(int x,int y,int z);\nint main()\n{\n    int n,n1,n2;\n    int a,b;\n    scanf(\""%d %d %d\"",&n,&n1,&n2);\n    while(n>0){\n        scanf(\""%d %d\"",&a,&b);\n         if(a==(b-1)){\n            func(b,n1,n2);\n         }\n        n--;\n\n    }\n\n  printf(\""%d\"",sum);\n    return 0;\n}\nvoid func(int x,int y,int z){\nint m,n;\nm=pow(y,x);\nn=pow(z,x);\nsum+=(m-n);\n //printf(\""%d\\n\"",sum);\n}\n",WRONG_ANSWER,12,340
1591657393329856512,c358160a3e618a44cd693944fe10043e6372f46bf7d517c3c3f583bd85b17c5e,2022-11-13 13:01:08,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"n, m ,y= map(int,input().split())\nif n>=m and n>=y:\n    max=n\nif m>=n and m>=y:\n    max=m\nif y>=n and y>=n:\n    max=y\nif n<=m and n<=y:\n    min=n\nif m<=n and m<=y:\n    min=m\nif y<=n and y<=m:\n    min=y\nprint(max+min)\n",WRONG_ANSWER,17,3032
1591657396479733760,33066437ddee11f609c900fe8dbd59cb8113e4d8dfd13c1812f199f4f3fdd334,2022-11-13 13:01:09,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 10000\n\nint main()\n{\n    int n,i,a[N],flag=0,t;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",a[i]);\n    }\n    for(i=1;i<n;i++)\n    {\n        while(a[i]>=a[i+1])\n        {\n            t=i+1;\n            if(a[t+1]=a[t]) t++;\n            if(a[t+1]>a[t]) flag++;\n            i++;\n        }\n     }\n    printf(\""%d\"",flag);\n}",SEGMENTATION_FAULT,13,348
1591657403039637504,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-13 13:01:11,Python,0.0,1591610585635213313,1589906790446387200,1049226928954454016,"num=int(input())\nfor i in range (num-1):\n    n=int(input())\n    a=list(input().split())\n    for i in range (len(a)):\n        a[i]=int(a[i])\n    b=a\n    all=2*max(a)-min(a)\n    b.remove(min(a))\n    b.remove(max(a))\n    print(all-max(b))\nn=int(input())\na=list(input().split())\nfor i in range (len(a)):\n    a[i]=int(a[i])\nb=a\nall=2*max(a)-min(a)\nb.remove(min(a))\nb.remove(max(a))\nprint(all-max(b),end='')\n",WRONG_ANSWER,54,3272
1591657444563279872,fc04467797ff55239c848b5102d2499d81faac6f07f19ed145b2c7ad9b809632,2022-11-13 13:01:21,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main(){\n   printf(\""60\"");\n}",ACCEPTED,6,328
1591657459650191360,cf568c7ddc8b221335f880bfbaac4634294e65481e738a2e032c1ab9a84d576f,2022-11-13 13:01:24,Java,0.0,1591610585639407616,1591132307937943552,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) throws Exception {\n        Scanner in = new Scanner(System.in);\n        int n=in.nextInt();\n        int[]h=new int[n];\n        int m=0;\n        for(int i=0;i<=n-1;i++){\n            h[i]=in.nextInt();\n        }\n        for(int i=0;i<=n-1;i++){\n             if((h[i]-h[i+1])==1||(h[i]-h[i+1])==0)\n            \n                m++;   \n        }\n        System.out.println(m);\n       \n    }\n},WRONG_ANSWER,102,24656
1591657503484817408,6a6dc7e644e57bb2c20b20d39bd4d9541bdebf6415e03e7c13707572c054673e,2022-11-13 13:01:35,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{  int m,n,a,b;\n   scanf(\""%d %d %d\"",&n,&a,&b);\n   if(a<n)\n    m=b+a;\n   else m=n+b;\n    printf(\""%d\"",m);\n\n    return 0;\n}\n\n",WRONG_ANSWER,5,340
1591657515086274560,63bdcc3416dd0c07c03f833ffb02c2f304a4f523deae6a87bed24a730e4d224d,2022-11-13 13:01:37,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int p,q,r;\n    int sum1,sum2,sum3;\n    scanf(\""%d %d %d\"",&p,&q,&r);\n    sum1=p+q;\n    sum2=q+r;\n    sum3=r+p;\n    if(sum1<=sum2&&sum1<=sum3)\n        printf(\""%d\"",sum1);\n    else if(sum2<=sum1&&sum2<=sum3)\n        printf(\""%d\"",sum2);\n    else if(sum3<=sum1&&sum3<=sum2)\n        printf(\""%d\"",sum3);\n    else if(sum1=sum2=sum3)\n        printf(\""%d\"",sum1);\n    \n    \n    \n  return 0;\n}",ACCEPTED,38,352
1591657515094695936,6b02dfcf297d52c2de2e1416b33ee988ff909834c73207b147423a8301e9d174,2022-11-13 13:01:37,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{ int i;\nint n=3;\n int a=5;\n int b[n]={0};\n    for(i=0;i<3;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n   \n    printf(\""%d\"",a);\n    return 0;\n}",COMPILE_ERROR,0,0
1591657571776487424,65ac58572a882f9de09782bce337ee95c6ab91ac6b377f6d29c3ee19b1a17f1a,2022-11-13 13:01:51,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a,i,arr[100];\n    int count=0;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++){\n        scanf(\""%d\"",&arr[i]);\n    }\n    for(i=0;i<a;i++){\n        if(arr[i]<arr[i-1] && arr[i]<arr[i+1] || arr[i-1]==arr[i] && arr[i]<arr[i+1] && arr[i]<arr[i-2]){\n            count++;\n        }\n    }\n    printf(\""%d\"",count-1);\n    return 0;\n}",WRONG_ANSWER,19,328
1591657574804807680,e51465ce72346fac918042a342986433269a159492161f223a180a6e05d9a01a,2022-11-13 13:01:52,Java,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tint result=0;\n        while (in.hasNextInt()) {\n            int p = in.nextInt();\n            int q = in.nextInt();\n            int r = in.nextInt();\n            if(p>=r){\n            \tresult+=r;\n            }\n            result+=q;\n            System.out.printf(\""%d\"",result);\n            System.out.println();\n\t}\n}\n}",WRONG_ANSWER,111,25688
1591657577535266816,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-13 13:01:52,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int P,Q,R;\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    if(P>=Q&&P>=R)\n    M=Q+R;\n    if(Q>=P&&Q>=R)\n    M=P+R;\n    if(R>=P&&R>=Q)\n    M=P+Q;\n    printf(\""%d\"",M);\n    return 0;\n}",COMPILE_ERROR,0,0
1591657588746674176,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-13 13:01:55,Python,0.0,1591610585635213313,1589906790446387200,1049226928954454016,"num=int(input())\nfor i in range (num-1):\n    n=int(input())\n    a=list(input().split())\n    for i in range (len(a)):\n        a[i]=int(a[i])\n    b=a\n    all=2*max(a)-min(a)\n    b.remove(min(a))\n    b.remove(max(a))\n    print(all-max(b))\nn=int(input())\na=list(input().split())\nfor i in range (len(a)):\n    a[i]=int(a[i])\nb=a\nall=2*max(a)-min(a)\nb.remove(min(a))\nb.remove(max(a))\nprint(all-max(b),end='')\n",WRONG_ANSWER,49,3144
1591657593507164160,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-13 13:01:56,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int n,i,j,k=0;\n    int a[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<10;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=1;j<n-1;j++)\n    {\n        if(a[j]<a[j-1]&&a[j+1]>a[j]||a[j]==a[j+1]&&a[j]<a[j-1]&&a[j+1]<a[j+2])\n        {\n            k++;\n        }\n    }\n    printf(\""%d\\n\"",k);\n    return 0;\n}",WRONG_ANSWER,5,196
1591657626864476160,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-13 13:02:04,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int P,Q,R,M;\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    if(P>=Q&&P>=R)\n    M=Q+R;\n    if(Q>=P&&Q>=R)\n    M=P+R;\n    if(R>=P&&R>=Q)\n    M=P+Q;\n    printf(\""%d\"",M);\n    return 0;\n}",ACCEPTED,25,512
1591657643188707328,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-13 13:02:08,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#define MAXSIZE 10000\nint main(){\n    int n,s[MAXSIZE];\n    int sum=-1;\n        scanf(\""%d\"",&n);\n       for(int i=0;i<n;i++)\n        scanf(\""%d\"",&s[i]); \n       for(int i=0;i<n;i++)\n           if(s[i]>s[i+1])\n               sum++;\n    printf(\""%d\"",sum);\n    printf(\""\\n\"");\n    return 0;\n}",WRONG_ANSWER,9,348
1591657643578765312,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-13 13:02:08,Java,300.0,1591610585635213318,1591131464941563904,1049226928954454016,import java.util.Scanner;\npublic class Main {\n    public static void main(String []args) {\n       int a[]=new int[5];\n        int b[]=new int[5];\n        int c;\n        Scanner scanner=new Scanner(System.in);\n        b[0]=scanner.nextInt();\n        b[1]=scanner.nextInt();\n        b[2]=scanner.nextInt();\n        a[0]=b[0]+b[1];\n        a[1]=b[1]+b[2];\n        a[2]=b[0]+b[2];\n        for(int i=0;i<2;i++){\n            if(i>0){\n                \n                if(a[i]<a[i-1])\n                {\n                    c=a[i-1];\n                    a[i-1]=a[i];\n                    a[i]=c;\n                }\n            }\n                \n        }\n       System.out.println(a[0]);\n        \n       \n    }\n},ACCEPTED,533,24628
1591657668560084992,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-13 13:02:14,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<iostream>\n#include<math.h>\nusing namespace std;\ntypedef long long ll;\nclass resolve{\n  public:\n    int resve(int x,int y,int a,int b){\n        return (a/(b+1))*(ll)pow(x,b+1)-(a/(b+1))*(ll)pow(y,b+1);\n    }\n};\nint main(){\n    int i,n,a[1000],b[1000],x,y;\n    ll resv=0;\n    cin>>n>>x>>y;\n    if(n=0)\n        cout<<\""0\""<<endl;\n    for(i=0;i<n;i++){\n        cin>>a[i];\n    }\n    for(i=0;i<n;i++){\n        cin>>b[i];\n    }\n    resolve res;\n    for(i=0;i<n;i++){\n        resv += res.resve(x,y,a[i],b[i]);\n        cout<<res.resve(x,y,a[i],b[i])<<endl;\n    }\n    cout<<resv<<endl;\n    return 0;\n}",WRONG_ANSWER,5,464
1591657684125114368,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-13 13:02:18,Python,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"P,Q,R=map(int,input(\""\"").split())\n1<=P,Q,R<=1000\na=P+Q\nb=Q+R\nc=R+P\nif a<b:\n   if a<c:\n    print(a)\nif b<a:\n   if b<c:\n    print(b)\nif c<a:\n   if c<b:\n    print(c)\n",ACCEPTED,93,3044
1591657691754586112,705adaf4eb218ca0fc51c6e09291eb309a3de0a7c595448a17d2fdb157e64706,2022-11-13 13:02:19,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,a,b,i,m,q;\n    float c[1000];\n    float f[1000];\n    int N=0,M=0,sum=0;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%f\"",&c[i]);\n    }\n   for(i=0;i<n;i++)\n    {\n     scanf(\""%f\"",&f [i]);\n    }\n     for(i=0;i<n;i++)\n     {\n         q=(c[i]/f[i+1])*pow(a,f[i]+1);\n         N+=n;\n     }\n     for(i=0;i<n;i++)\n      {\n         m= (c[i]/f[i+1])*pow(b,f[i]+1);\n        M+=m;\n                          }\n        sum=N-M;\n       printf(\""%d\"",sum);\n\n    return 0;\n}\n",WRONG_ANSWER,17,348
1591657700159971328,6a6dc7e644e57bb2c20b20d39bd4d9541bdebf6415e03e7c13707572c054673e,2022-11-13 13:02:21,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{  int m,n,a,b;\n   scanf(\""%d %d %d\"",&n,&a,&b);\n   if(a<n)\n    m=b+a;\n   else m=n+b;\n    printf(\""%d\"",m);\n    return 0;\n}\n\n",WRONG_ANSWER,6,500
1591657700650704896,cf76a6e5773cf2f19ddd635fa646c5a6721f6fed8998d22ea1d0910bee8017a2,2022-11-13 13:02:22,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,b,c,d,e,f;\n    scanf(\""%d\"",&a);\n    scanf(\""%d\"",&b);\n    scanf(\""%d\"",&c);\n    d=a+b;\n    e=b+c;\n    f=c+a;\n    if(d<e||d<f)\n    {\n        printf(\""%d\"",d);\n    }\n    else if(e<d||e<f)\n    {\n        printf(\""%d\"",e);\n    }\n    else\n    {\n        printf(\""%d\"",f);\n    }\n}",WRONG_ANSWER,23,352
1591657716517711872,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-13 13:02:25,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<iostream>\n#include<math.h>\nusing namespace std;\ntypedef long long ll;\nclass resolve{\n  public:\n    int resve(int x,int y,int a,int b){\n        return (a/(b+1))*(ll)pow(x,b+1)-(a/(b+1))*(ll)pow(y,b+1);\n    }\n};\nint main(){\n    int i,n,a[1000],b[1000],x,y;\n    ll resv=0;\n    cin>>n>>x>>y;\n    if(n==0)\n        cout<<\""0\""<<endl;\n    for(i=0;i<n;i++){\n        cin>>a[i];\n    }\n    for(i=0;i<n;i++){\n        cin>>b[i];\n    }\n    resolve res;\n    for(i=0;i<n;i++){\n        resv += res.resve(x,y,a[i],b[i]);\n        cout<<res.resve(x,y,a[i],b[i])<<endl;\n    }\n    cout<<resv<<endl;\n    return 0;\n}",WRONG_ANSWER,5,456
1591657721295069184,7e6a67f270e740aba8788a12d9a49939621a28d5059d3ced2247a86914b0a3b3,2022-11-13 13:02:26,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h> \n\nint main() {\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint a[n],b[n];\n\tint i,j;\n\tint temp,max=0,num;\n\t\n\tfor(i=0;i<n;i++)\n\t\tscanf(\""%d\"",&a[i]);\n\t\n\tfor(i=0;i<n;i++)\n\t{\n\t\tnum=0;\n\t\tfor(j=i;j<n;j++)\n\t\t{\n\t\t\tif(a[i]>a[j]) break;\n\t\t\tnum++;\n\t\t}\n\t\ttemp=a[i]*num;\n\t\tif(temp>max) max=temp;\n\t}\n\t\n\tprintf(\""%d\"",max);\n}",WRONG_ANSWER,26,328
1591657722612035584,29d1ea54d6e4e56fc2de0be5ae10ecc4c70c7fca667934b17857e95530f5663a,2022-11-13 13:02:27,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n   int a[3],i,max,n;\n    for(i=0;i<3;i++)\n        scanf(\""%d\"",&a[i]);\n    a[max]=a[0];\n    for(i=0;i<3;i++)\n    {\n        if(a[max]<=a[i])\n            a[max]=a[i];\n\n    }\n    n=a[0]+a[1]+a[2]-a[max];\n    printf(\""%d\"",n);\n    return 0;\n}\n",WRONG_ANSWER,6,204
1591657737912868864,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-13 13:02:30,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <math.h>\n#include <stdio.h>\nint main()\n{\n    int a,b,c,min=1000;\n    scanf(\""%d\"",&a);\n    scanf(\""%d\"",&b);\n    scanf(\""%d\"",&c);\n    if(a+b<min) min=a+b;\n    {\n        if(a+c<min) min=a+c;\n        else\n            if(c+b<min) min=c+b;\n    }\n    printf(\""%d\"",min);\n}",WRONG_ANSWER,5,324
1591657752123158528,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-13 13:02:34,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\nint main(){\n    int gd = -5; // 固定减5\n    int count = 0;\n    int num = 0;\n    int len;\n    if(scanf(\""%d\"",&len)){};\n    int arr[len];\n    \n        for(int i=0; i<len; i++){\n            if(scanf(\""%d\"",&arr[i])){};\n        }\n        \n        for(int j=-1; j<len; j++){\n            // 给count赋值 单步最大\n            if(arr[j+1]+gd > arr[j+3]+gd){\n                count = arr[j+1]+gd;\n            }else{\n                count = arr[j+3]+gd;\n            }\n            // 总数最大\n            if(count>num){\n                num += count;\n            }\n        }\n    printf(\""%d\"",count);\n}",WRONG_ANSWER,11,372
1591657756103565312,630b8bfc88107b488e158fc7108c8faf0a195f9b9030c3faf51edac625714584,2022-11-13 13:02:35,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main(){\nint p,q,r,i,max;\nscanf(\""%d %d %d\"",&p,&q,&r);\nif(p>=q) max=p;\nelse max=q;\nif(max<=r) max=r;\nmax=p+q+r-max;\nprintf(\""%d\"",max);\nreturn 0;\n}\n",ACCEPTED,42,352
1591657761321279488,2a1cee132cc8344d51461f6cbf473fb80705d6fd5972f9a5d0fcfea0760fd8b1,2022-11-13 13:02:36,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R,N;\n     scanf(\""%d %d %d\"",&P,&Q,&R);\n    if(P,Q,R>=1&&P,Q,R<=1000)\n    {\n        N=P+Q+R-R;\n       printf(\""%d\"",N);\n    }\n    return 0;\n}\n",WRONG_ANSWER,5,360
1591657769173049344,6b312558d54f4eeffd1aa510a96dd5882584f6bf7857d244f71013b7ec561920,2022-11-13 13:02:38,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b,c,d[3],i,min=99999;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    d[0]=a+b;\n    d[1]=b+c;\n    d[2]=a+c;\n    for(i=0;i<3;i++)\n    {\n        if(d[i]<min)\n            min=d[i];\n    }\n    printf(\""%d\"",min);\n    return 0;\n}\n",WRONG_ANSWER,42,328
1591657794749870080,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-13 13:02:44,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\nint main(){\n    int gd = -5; // 固定减5\n    int count = 0;\n    int num = 0;\n    int len;\n    if(scanf(\""%d\"",&len)){};\n    int arr[len];\n    \n        for(int i=0; i<len; i++){\n            if(scanf(\""%d\"",&arr[i])){};\n        }\n        \n        for(int j=0; j<len; j++){\n            // 给count赋值 单步最大\n            if(arr[j]+gd > arr[j+3]+gd){\n                count = arr[j]+gd;\n            }else{\n                count = arr[j+3]+gd;\n            }\n            // 总数最大\n            if(count>num){\n                num += count;\n            }\n        }\n    printf(\""%d\"",count);\n}",WRONG_ANSWER,8,200
1591657797539127296,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-13 13:02:45,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#define MAXSIZE 10000\nint main(){\n    int n,s[MAXSIZE];\n    scanf(\""%d\"",&n);\n    int sum=-1;\n       for(int i=0;i<n;i++)\n        scanf(\""%d\"",&s[i]); \n       for(int i=0;i<n;i++)\n           if(s[i]>s[i+1])\n               sum++;\n    printf(\""%d\"",sum);\n    printf(\""\\n\"");\n    return 0;\n}",WRONG_ANSWER,5,324
1591657801536299008,6de81974dc8c65943a7aa7eec331767cc67f98683db11d3405a39c1495f3fcdf,2022-11-13 13:02:46,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R,n1,n2,n3,min;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    n1=P+Q;\n    n2=P+R;\n    n3=Q+R\n    if(n1>n2)\n    {\n        min=n2;\n        if(n2>n3)\n            min=n3;\n        else\n            min=n2;\n    }\n    else{\n        min=n1;\n        if(n1>n3)\n            min=n3;\n        else\n            min=n1;\n    }\n    printf(\""%d\"",min);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1591657805759930368,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-13 13:02:47,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\nint main(void)\n{\n    int P,Q;\n    scanf(\""%d%d\"",&P,&Q);\n    printf(\""从A到B花费%d块钱，从B到C花费%d块钱，此时所有地点都去过了，总花费为%d块钱。\\n\"",P,Q,P+Q);\n    return 0;\n}",WRONG_ANSWER,6,192
1591657809694175232,09eb01e8f9f24922a6c60a1149d505ad1ebb9b0a39ed1101140fe0fd93daa753,2022-11-13 13:02:48,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\n    int n,i,counts=0;\n    int arr[100]={0};\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&arr[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n\n        if((arr[i]>arr[i+1]&&arr[i+1]<arr[i+2])||(arr[i]>arr[i+1]&&arr[i+2]==arr[i+1]&&arr[i+3]>arr[i+2]))\n        {\n\n            counts++;\n        }\n    }\n    printf(\""%d\"",counts);\n    return 0;\n}",RUNTIME_ERROR,26,376
1591657862496268288,212aee9dc233539050d1d324af20b580172711970f7c24349b9c7c8ac9b114cd,2022-11-13 13:03:00,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n    int p,q,r,m,n,j,k;\n    scanf(\""%d %d %d\"",&p,&q,&r);\n    m=p+q+r;\n    n=p+q;\n    j=p+r;\n    k=q+r;\n    if(p>=1 && p<=1000 && q>=1 && q<=1000 && r>=1 && r<=1000)\n        if(m>=n)\n        printf(\""%d\"",n);\n    else if(n>=m)\n        printf(\""%d\"",m);\n    else if(m>=j)\n        ptintf(\""%d\"",j);\n    else if(j>=m)\n        printf(\""%d\"",m);\n    else if(m>=k)\n         ptintf(\""%d\"",k);\n    else if(k>=m)\n        printf(\""%d\"",m);\n        \n    return 0;\n}\n",WRONG_ANSWER,17,204
1591657870129946624,910d600982c42b3bf326994e410e7a344f2438b451c8f7deb6f6a9f965d3ee41,2022-11-13 13:03:02,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int P,Q,R,s1,s2,s3,min;\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    s1=P+Q;\n    s2=P+R;\n    s3=Q+R;\n    min=s1<s2?s1:s2<s3?s2:s3;\n    printf(\""%d\"",min);\n}\n",WRONG_ANSWER,9,320
1591657883811733504,29249e539dec3766ca388aaa46121bd2a768da21260d3f436e20eeaac8ee73b3,2022-11-13 13:03:05,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b,c,s,m;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    s=a+b;\n    m=b+c;\n    if(s>=m) printf(\""%d\"",m);\n    else  printf(\""%d\"",s);\n    return 0;\n}\n",ACCEPTED,36,352
1591657961251155968,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-13 13:03:24,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#define MAXSIZE 10000\nint main(){\n    int n,s[MAXSIZE];\n    scanf(\""%d\"",&n);\n    int sum=0;\n       for(int i=0;i<n;i++)\n        scanf(\""%d\"",&s[i]); \n       for(int i=0;i<n-1;i++)\n           if(s[i]>s[i+1])\n               sum++;\n    printf(\""%d\"",sum);\n    printf(\""\\n\"");\n    return 0;\n}",WRONG_ANSWER,5,196
1591657962433994752,910d600982c42b3bf326994e410e7a344f2438b451c8f7deb6f6a9f965d3ee41,2022-11-13 13:03:24,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int P,Q,R,s1,s2,s3,min;\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    s1=P+Q;\n    s2=P+R;\n    s3=Q+R;\n    min=s1<s2?s1:s2<s3?s2:s3;\n    printf(\""%d\\n\"",min);\n}\n",WRONG_ANSWER,14,512
1591657978254876672,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-13 13:03:28,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int n,i,j,k=0;\n    int a[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<10;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=1;j<n-1;j++)\n    {\n        if(a[j]<a[j-1]&&a[j+1]>a[j]||a[j]==a[j+1]&&a[j]<a[j-1]&&a[j+1]<a[j+2])\n        {\n            k++;\n        }\n    }\n    printf(\""%d\\n\"",k);\n    return 0;\n}",WRONG_ANSWER,23,452
1591657998827937792,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-13 13:03:33,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\nint main(void)\n{\n    int P,Q;\n    scanf(\""%d%d\"",&P,&Q);\n    printf(\""%d\\n\"",P+Q);\n    return 0;\n}",WRONG_ANSWER,16,328
1591658022370553856,d9e13de81d487f21b11cf0fc38d2ef82b49d511a81ed1305cdfa47276a1c2e23,2022-11-13 13:03:38,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n\tint P,Q,R,a,b,c,t;\n\tscanf(\""%d %d %d\"",&P,&Q,&R);\n\tif(P,Q,R>=1&&P,Q,R<=1000)\n\t{\n\t\ta=P+Q;\n\t\tb=P+R;\n\t\tc=Q+R;\n\t\tif(a<=b&&a<=c)\n\t {\n\t\tt=a;\n\t }\n\tif(b<=a&&b<=c)\n \t {\n\t\tt=b;\n\t }\n\telse\n \t {\n\t\tt=c;\n \t }\n\t}\n\n\tprintf(\""最少花费%d元\\n\"",t);\n\treturn 0;\n } ",WRONG_ANSWER,4,328
1591658023201038336,d808f4cc3c70a696f5c416714e0998fe96743e5273bc07a26f75738d12d304f5,2022-11-13 13:03:38,Java,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"import java.util.Scanner;\nimport java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n        int n,count=0;\n        Scanner sc=new Scanner(System.in);\n        n=sc.nextInt();\n        int[] a=new int[n];\n        for(int i=0;i<n;i++){\n        \ta[i]=sc.nextInt();\n        }   \n        for(int i=1;i<n-1;i++){\n        \tfor(int j=i-1,t=i+1;j>=0&&t<=n-1;j--,t++){\n        \t\tif(a[i]<a[j]&&a[i]<a[t]){\n        \t\t\tcount++;\n        \t\t\tbreak;\n        \t\t}\n        \t}\n        }\n        System.out.println(count);\n\t}\n}\n",WRONG_ANSWER,105,24800
1591658024404803584,29d1ea54d6e4e56fc2de0be5ae10ecc4c70c7fca667934b17857e95530f5663a,2022-11-13 13:03:39,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n   int a[3],i,max,n;\n    for(i=0;i<3;i++)\n        scanf(\""%d\"",&a[i]);\n    a[max]=a[0];\n    for(i=0;i<3;i++)\n    {\n        if(a[max]<=a[i])\n            a[max]=a[i];\n\n    }\n    n=a[0]+a[1]+a[2]-a[max];\n    printf(\""%d\"",n);\n    return 0;\n}\n",WRONG_ANSWER,12,328
1591658046538133504,7c6d208c4c4b695bc8d6f8ae0c0357c2466f5c9f86ec0652674812219ac09d38,2022-11-13 13:03:44,Java,0.0,1591610585639407617,1591132482555211776,1049226928954454016,import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt();\n\t    int[] arr = new int[a];\n\t    for (int i = 0; i < a; i++) {\n\t\t\tint b = sc.nextInt();\n\t\t\tarr[i] = b;\n\t\t}\n\t\tArrays.sort(arr);\n\t\tint x = arr[a/2];\n\t\tint y = arr[a/2-1];\n\t\tint z = arr[a/2+1];\n\t\tif (x*y>x*z) {\n\t\t\tSystem.out.println(x*y);\n\t\t}else {\n\t\t\tSystem.out.println(x*z);\n\t\t}\n\n\t}\n\n}\n,WRONG_ANSWER,104,25104
1591658069833342976,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-13 13:03:50,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include(stdio.h)\nint main()\n{\n    int n,h[n-1],a=0;\n    h[0]=h[n-1]=0;\n    scanf(\""%d\\n\"",&n);\n    scanf(\""%d\"",n-1);\n    if(n>=3&&n<=10000&&h[n-1]>=0&&h[n-1]<=1000)\n    {\n        h[n-1]>=h[n]&&h[n]<=h[n+1]\n            a=a+1;\n        h[n]==h[n-1]\n           a=a+1;\n    }\n    printf(\""%d\"",&a);\n        return 0;\n}",COMPILE_ERROR,0,0
1591658098262335488,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-13 13:03:56,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j,k=0;\n    int a[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<10;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=1;j<n-1;j++)\n    {\n        if(a[j]<a[j-1]&&a[j+1]>a[j]||a[j]==a[j+1]&&a[j]<a[j-1]&&a[j+1]<a[j+2])\n        {\n            k++;\n        }\n    }\n    printf(\""%d\\n\"",k);\n}",WRONG_ANSWER,9,204
1591658105493282816,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-13 13:03:58,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main(){\n\tint n,i,sum=0;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=0;i<n;i++){\n\t\tif(a[i+2]>=a[i]&&(n-1-i)>0) {\n\t\t\tsum+=a[i+2]-5;\n\t\t\ti=i+2;\n\t\t}\n\t\tif(a[i+2]<a[i]) sum+=a[i]-5;\n\t}\n\tprintf(\""%d\"",sum);\n}\n",WRONG_ANSWER,16,220
1591658107003265024,225b1524edf804414c466257a4f19789fe127117b27e663dc835d742fed77f9e,2022-11-13 13:03:58,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,b,c;\n    printf(\""%d %d %d\"",&a,&b,&c);\n    int sum;\n    \n    sum=a+b;\n    printf(\""sum%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,6,196
1591658149994881024,e0a829315cc9947a3e714cd579e3322e8dee5f8ca36e30fd276de5a8e294b6f8,2022-11-13 13:04:09,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n    int p,q,r;\n    int min=0;\n    scanf(\""%d %d %d\"",&p,&q,&r);\n    min=p;\n    if(min>q)\n        min=q;\n    if(min>r)\n        min=r;\n    printf(\""%d\"",min+r);\n    return 0;\n}\n",WRONG_ANSWER,8,200
1591658173717819392,6de81974dc8c65943a7aa7eec331767cc67f98683db11d3405a39c1495f3fcdf,2022-11-13 13:04:14,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R,n1,n2,n3,min;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    n1=P+Q;\n    n2=P+R;\n    n3=Q+R;\n    if(n1>n2)\n    {\n        min=n2;\n        if(n2>n3)\n            min=n3;\n        else\n            min=n2;\n    }\n    else{\n        min=n1;\n        if(n1>n3)\n            min=n3;\n        else\n            min=n1;\n    }\n    printf(\""%d\"",min);\n    return 0;\n}\n",ACCEPTED,40,512
1591658184383979520,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-13 13:04:17,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\nint main(void)\n{\n    int P,Q,R;\n    scanf(\""%d%d\"",&P,&Q,&R);\n    printf(\""%d\\n\"",P+Q);\n    return 0;\n}",WRONG_ANSWER,11,480
1591658187026345984,6a6dc7e644e57bb2c20b20d39bd4d9541bdebf6415e03e7c13707572c054673e,2022-11-13 13:04:18,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{  int m,n,a,b;\n   scanf(\""%d %d %d\"",&n,&a,&b);\n   if(a<=n||a<=b)\n    m=b+a;\n   else m=n+b;\n    printf(\""%d\"",m);\n\n    return 0;\n}\n\n",WRONG_ANSWER,8,344
1591658190407000064,73af9d5098be5d450fba728363c8fdbe0f6a5526466daa2f3b74abf1acf75527,2022-11-13 13:04:18,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int n,a,b;\n    int i=0;\n    int c[1000],F[1000];\n    int sum=0;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&c[i]);\n        \n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&F[i]);\n        \n    }\n    for(i=0;i<n;i+=2)\n    {\n\n        sum=sum+((c[i]/(F[i]+1))*(pow(a,F[i]+1 )-pow(b,F[i]+1 ))+(c[i+1]/(F[i+1]+1))*(pow(a,F[i+1]+1 )-pow(b,F[i+1]+1 )));\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,5,196
1591658212179632128,5b382280d947e26011a7c75c34d257662bc13c50f8257bc8cae807604d61430c,2022-11-13 13:04:24,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\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\tint n,i;\n\tint count=0;\n\tint a[100];\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=1;i<n-1;i++){\n\t\tif((a[i]<a[i-1]&&a[i]<a[i+1])||(a[i]==a[i-1]&&a[i+1]>a[i])){\n\t\t\tcount++;\n\t\t}\n\t}\n\tprintf(\""%d\"",count);\n\treturn 0;\n}",RUNTIME_ERROR,33,512
1591658225622376448,c39a4349139942a7aa7456b2c4609f8d0f9d0d3465be213d33870ec87eab1e58,2022-11-13 13:04:27,C++,0.0,1591610585635213314,1591128862958940160,1049226928954454016,"#include <stdio.h>\n\nint main(void) \n{\n\tint n,a[100],i,j,c;\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n-1;i++)\n\t{\n\t\tscanf(\""%d\"",&a[i]); \n\t}\n for(i=0;i<n-1;i++)\n     for(j=1;j<n-1-i;j++)\n {\n     if(a[i]<a[j])\n     {\n       c=a[j];\n         a[j]=a[i];\n         a[i]=c;\n         \n     }\n }\n    \n    printf(\""%d \"",n);\n    for(i=0;i<n-1;i++)\n        printf(\""%d \"",a[i]);\n    return 0;\n}",SEGMENTATION_FAULT,9,348
1591658225970503680,617f184ce583e9f7a346564ab5659fda0ca35a3a714a0c929cb07f915f4f514b,2022-11-13 13:04:27,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    if(P+Q>=P+R)\n    {\n        printf(\""%d\"",P+R);\n    }\n    else if(P+Q>=Q+R)\n    {\n        printf(\""%d\"",Q+R);\n    }\n    else\n        printf(\""%d\"",Q+R);\n    return 0;\n}\n",WRONG_ANSWER,14,192
1591658249320161280,d9f0f29c0c2f6a52018e8ee93d686388c75950bcac327d0bebd2166a37f8dd26,2022-11-13 13:04:32,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,b,c;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    if((a+b)>=(b+c)&&(c+a)>=(b+c))\n        printf(\""%d\"",b+c);\n    else if((b+c)>=(c+a)&&(a+b)>=(c+a))\n        printf(\""%d\"",c+a);\n    else if((c+a)>=(a+b)&&(b+c)>=(a+b))\n        printf(\""%d\"",a+b);\n\n    return 0;\n}\n",ACCEPTED,41,360
1591658262439976960,27fbb32d960dbf49665c8905b68012d602eda68987686c6f224ec7b49ca3d0ac,2022-11-13 13:04:36,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint n,i,flog=0;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=1;i<n;i++)\n\t{\n\t\tif(a[i]<a[i-1]&&a[i]<a[i+1])\n\t\t{\n\t\t  flog++;\n\t\t}\n\t\tif(a[i]<a[i-1]&&a[i]==a[i+1])\n\t\t{\n\t\t\tfor(int j=i+1;j<n;j++)\n\t\t\t{\n\t\t\t\tif(a[j]>a[i+1])\n\t\t\t\tflog++;\n\t\t\t\t\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\""%d\\n\"",flog);\n\treturn 0;\n} ",WRONG_ANSWER,12,328
1591658341078949888,00d0a1b2e987c17fb50850b9ec54bf6b4f8b997eb053d1a9fed6c4888fbe74ed,2022-11-13 13:04:54,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,i,x=0;\n    int a[n];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[n]);\n    }\n    for (i=0;i<n;)\n    {\n        if(a[i+1]<a[i+3])\n            i=i+3;\n        else i=i+1;\n        x=x+a[i];\n    }\n    printf(\""%d\"",x);\n    return 0;\n}",WRONG_ANSWER,6,352
1591658342756671488,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-13 13:04:55,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\nint main(void)\n{\n    int P,Q,R;\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    printf(\""%d\\n\"",P+Q);\n    return 0;\n}",WRONG_ANSWER,11,352
1591658359521292288,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 13:04:59,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[n],sum=0,i,a=0;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i=a)\n    {\n        if(a[i]>a[i+2])\n        {\n            sum=sum+a[i]-5;\n            a=a+1;\n        }\n        else \n        {\n            sum=sum+a[i+2]-5;\n            a=a+3;\n        }\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",COMPILE_ERROR,0,0
1591658364965498880,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-13 13:05:00,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int P,Q,R,i;\n    int sum;\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    if(P>=Q&&P>=R)\n        sum=Q+R;\n    if(Q>=P&&Q>=R)\n        sum=P+R;\n    if(R>=Q&&P<=R)\n        sum=Q+P; \n    printf(\""%d\"",sum);\n    return 0;\n}",ACCEPTED,33,376
1591658380157267968,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-13 13:05:04,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\n    int n = 0, i = 0, j = 0, count = 0;\n    scanf(\""%d\"",&n);\n    int arr[n] = {0};\n    arr[0] = 0;\n    arr[n-1] = 0;\n    for(i = 1;i < n-1; ++i)\n    {\n        scanf(\""%d\"",&arr[i]);\n    }\n    for(j = 0;j < n-1; ++j)\n    {\n        if(j == 0)\n        {\n            if(arr[0] == arr[1])\n            {\n                count++;\n            }\n        }\n        else if((arr[j] < arr[j-1]) && (arr[j] > arr[j+1]))\n        {\n            count++;\n        }\n        else if(arr[j] == arr[j+1])\n        {\n            count++;\n        }\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",COMPILE_ERROR,0,0
1591658381335867392,f55f4c0e0e3367434e26a462e3665271f5b4141ea3de4f34d96fdb21d67e2a7c,2022-11-13 13:05:04,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,i,z,b,count;\n    scanf(\""%d\"",&a);\n    count=0;\n for(i=0;i<a;i++)\n {\n    scanf(\""%d\"",&z);\n    if(z==0)\n        count++;\n\n }\n b=count-2;\n printf(\""%d\"",b);\n\n\n\n\n\n\n    return 0;\n}\n",WRONG_ANSWER,6,200
1591658391892942848,55950e2d4c314feed0856fa0f6b80f22c5c36f2ebe0d75c8ee2cadb1a06b2fe1,2022-11-13 13:05:06,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int n,a,b,c[100],i,d[100],an=0,bn=0,cn;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&c[i]);\n        scanf(\""%d\"",&d[i]);\n\n\n    }\n    for(i=0;i<n;i++){\n        an=an+c[i]/(d[i]+1)*pow(a,d[i]+1);\n        bn=bn+(c[i])/((d[i]+1)*pow(b,d[i]+1));\n\n\n\n    }\n    cn=an-bn;\n    printf(\""%d\"",cn);\n\n\n\n\n\n\n\n\n\n    return 0;\n}\n",WRONG_ANSWER,13,480
1591658401506287616,39afbda4ab6a7df2673bc0d0eec048a42b23ada2774ec941935a2b2fa044515a,2022-11-13 13:05:09,C++,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <bits/stdc++.h>\nusing namespace std;\nint main()\n{\nint p,q,r;\nint z,x,y,m,n;\ncin>>p>>q>>r;\nz=p+q;\nx=q+r;\ny=r+p;\nm=min(z,x);\nn=min(m,y);\ncout<<n;\n}\n",ACCEPTED,26,616
1591658475292471296,eeab3421c2b685f7d51b09a289b82fe82ba0d3896984d09aeffb9d022232d887,2022-11-13 13:05:26,Java,300.0,1591610585635213315,1591129345182261248,1049226928954454016,"\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.math.BigDecimal;\nimport java.util.Scanner;\nimport java.util.StringTokenizer;\n\npublic class Main {\n    static String[] f = new String[100001];\n    public static void main(String[] args) {\n        FastReader fastReader =  new FastReader();\n        int n = fastReader.nextInt();\n        if(n == 0)\n        {\n            System.out.println(0);\n            return;\n        }\n\n        for(int i=0;i<n;i++)\n            f[i] = fastReader.next();\n        BigDecimal bigDecimal5 =  BigDecimal.valueOf((long)5);\n      //  System.out.println(bigDecimal5);\n        String[] dp = new String[n+1];\n        for(int i=0;i<n+1;i++)\n            dp[i] = 0+\""\"";\n        for(int i=1;i<=n;i++){\n            if(i == 1 || i ==2 ){\n                BigDecimal bigDecimal = new BigDecimal(dp[i-1]);\n                dp[i] = bigDecimal.add(new BigDecimal(f[i-1])).subtract(bigDecimal5).toString();\n            }\n\n            if(i-1<0 || i-3 <0)\n                continue;\n          //  System.out.println(i);\n            BigDecimal bigDecimal1 = new BigDecimal(dp[i-1]);\n            BigDecimal bigDecimal3 = new BigDecimal(dp[i-3]);\n            BigDecimal bigDecimali = new BigDecimal(f[i-1]);\n           // System.out.println(bigDecimal1);\n            //.System.out.println(bigDecimal3);\n            //System.out.println(bigDecimali);\n            BigDecimal t1  = bigDecimal1.add(bigDecimali).subtract(bigDecimal5);\n            BigDecimal t2 = bigDecimal3.add(bigDecimali).subtract(bigDecimal5);\n            int t3 = Integer.valueOf(t1.subtract(t2).toString());\n            if(t3 >0) dp[i] = t1.toString();\n            else dp[i] = t2.toString();\n            //System.out.println(\""dp\""+dp[i]);\n        }\n        System.out.println(dp[n]);\n\n    }\n\n\n    static class FastReader {\n        BufferedReader br;\n        StringTokenizer st;\n        public FastReader()\n        {\n            br = new BufferedReader(\n                    new InputStreamReader(System.in));\n        }\n\n\n        String next()\n        {\n            while (st == null || !st.hasMoreElements()) {\n                try {\n                    st = new StringTokenizer(br.readLine());\n                }\n                catch (IOException e) {\n                    e.printStackTrace();\n                }\n            }\n            return st.nextToken();\n        }\n\n\n\n        int nextInt() { return Integer.parseInt(next()); }\n\n        long nextLong() { return Long.parseLong(next()); }\n\n        double nextDouble(){return Double.parseDouble(next());}\n\n\n        String nextLine()\n        {\n            String str = \""\"";\n\n            try {\n                if (st!= null && st.hasMoreTokens()){\n                    str = st.nextToken(\""\\n\"");\n                } else {\n                    str = br.readLine();\n                }\n            }\n            catch (IOException e) {\n                e.printStackTrace();\n            }\n            return str;\n        }\n\n\n    }\n}\n\n\n\n",ACCEPTED,583,34256
1591658492719804416,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 13:05:30,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,a[100];\n    int i;\n    int t=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[n]);\n    }\n    for(i=0;i<n;i++)\n    {\n     if(a[i]>a[0])\n            i==i;\n      break;\n    }\n\n    for(i=i+1;i<n;i++)\n    {\n        if(a[i+1]>=a[i])\n            t=t+1;\n    }\n    printf(\""%d\"",t-1);\n    return 0;\n}",WRONG_ANSWER,6,500
1591658499107774464,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-13 13:05:32,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main(){\n\tint n,i,sum=0;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=0;i<n;i++){\n\t\tif(a[i+2]>=a[i]&&(n-1-i)>0) {\n\t\t\tsum+=a[i+2]-5;\n\t\t\ti=i+2;\n\t\t}\n\t\telse sum+=a[i]-5;\n\t}\n\tprintf(\""%d\"",sum);\n}\n",WRONG_ANSWER,5,324
1591658499439079424,e0156cb930d51b3d5482d43809e7b2c1f54a6b8623fccfa3202e2e53ddf1ffbf,2022-11-13 13:05:32,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\nint a,b,c,sum;\nscanf(\""%d%d%d\"",&a,&b,&c,sum);\nsum=a+b&&a+c&&b+c;\nif(a+b<a+c<b+c,sum=a+b);\nprintf(\""%d\\n\"",sum=a+b);\n while(a+c<a+b<b+c,sum=a+c);\n printf(\""%d\\n\"",sum=a+c);\n  while(b+c<a+b<a+c,sum=b+c);\n  printf(\""%d\\n\"",sum=b+c);\n    return 0;\n\n}\n",TIME_LIMIT_EXCEEDED,400,324
1591658501603340288,212aee9dc233539050d1d324af20b580172711970f7c24349b9c7c8ac9b114cd,2022-11-13 13:05:33,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n    int p,q,r,m,n,j,k;\n    scanf(\""%d %d %d\"",&p,&q,&r);\n    m=p+q+r;\n    n=p+q;\n    j=p+r;\n    k=q+r;\n    if(p>=1 && p<=1000 && q>=1 && q<=1000 && r>=1 && r<=1000)\n        if(m>=n)\n        printf(\""%d\"",n);\n    else if(n>=m)\n        printf(\""%d\"",m);\n    else if(m>=j)\n        ptintf(\""%d\"",j);\n    else if(j>=m)\n        printf(\""%d\"",m);\n    else if(m>=k)\n         ptintf(\""%d\"",k);\n    else if(k>=m)\n        printf(\""%d\"",m);\n        \n    return 0;\n}\n",WRONG_ANSWER,5,192
1591658506414206976,6b312558d54f4eeffd1aa510a96dd5882584f6bf7857d244f71013b7ec561920,2022-11-13 13:05:34,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b,c,d,e,f,min;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    d=a+b;\n    e=b+c;\n    f=a+c;\n    if(d<e)\n        min=d;\n    else if(e<f)\n        min=e;\n    else\n        min=f;\n    printf(\""%d\"",min);\n    return 0;\n}\n",ACCEPTED,26,352
1591658506993033216,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-13 13:05:34,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n\n\n//O(N)\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"",&n);\n\n    int arr[n];\n    int i = 0;\n    for(i = 0; i < n; ++i){\n        scanf(\""%d\"",&arr[i]);\n    }\n\n    int width = 0;\n    int j = 0;\n    int mul = 1;\n    int max = 0;\n    for(i = 0; i < n; ++i){\n        for(j = 0; j < n; ++j){\n            if(arr[i] <= arr[j]){\n                ++width;\n            }\n        }\n        mul = width * arr[i];\n\n        if(mul > max){\n            max = mul;\n        }\n\n        width = 0;\n    }\n\n    printf(\""%d\"",max);\n\n    return 0;\n}",WRONG_ANSWER,6,348
1591658511107633152,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-13 13:05:35,Python,0.0,1591610585635213313,1589906790446387200,1049226928954454016,"num=int(input())\nfor i in range (num-1):\n    n=int(input())\n    a=list(input().split())\n    for i in range (len(a)):\n        a[i]=int(a[i])\n    b=a\n    all=2*max(a)-min(a)\n    b.remove(min(a))\n    b.remove(max(a))\n    print(all-max(b),end='\\t\\n')\nn=int(input())\na=list(input().split())\nfor i in range (len(a)):\n    a[i]=int(a[i])\nb=a\nall=2*max(a)-min(a)\nb.remove(min(a))\nb.remove(max(a))\nprint(all-max(b),end='')\n",WRONG_ANSWER,45,3016
1591658536978145280,6a6dc7e644e57bb2c20b20d39bd4d9541bdebf6415e03e7c13707572c054673e,2022-11-13 13:05:41,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{  int m,n,a,b;\n   scanf(\""%d %d %d\"",&n,&a,&b);\n   if(a<n||n=<b)\n    m=n+a;\n   else m=n+b;\n    printf(\""%d\"",m);\n\n    return 0;\n}\n\n",COMPILE_ERROR,0,0
1591658576186499072,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-13 13:05:50,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main(){\n\tint n,i,sum=0;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=0;i<n;i++){\n\t\tif(a[i+2]>=a[i]&&(n-1-i)>0) {\n\t\t\tsum+=a[i+2]-5;\n\t\t\ti=i+2;\n\t\t}\n\t\telse sum+=a[i]-5;\n\t}\n\tprintf(\""%d\\n\"",sum);\n}\n",WRONG_ANSWER,7,324
1591658579575463936,64b76cc355daf11e96a19b338c58e56c05289d7e3809e9695a09e71771618713,2022-11-13 13:05:51,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R,temp=0;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n\n    if(P>=1&&R<=1000)\n    {\n        if(Q==0)\n            printf(\""%d\\n\"",temp=P+R);\n        else\n            printf(\""%d\\n\"",temp=P+Q);\n    }\n\n\n    return 0;\n}\n",WRONG_ANSWER,10,328
1591658604451868672,5ed1ed5f3786d45db71190023ef590496fd0d8d8cfe4af0f2c94d1d387178674,2022-11-13 13:05:57,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n    int n,a,b,i,x1,x2,z1,z2,s;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    scanf(\""%d %d\"",&x1,&x2);\n    scanf(\""%d %d\"",&z1,&z2);\n    s=(x1/(z1+1)*pow(a,(z1+1))+x2/(z2+1)*pow(a,(z2+1)))-(x1/(z1+1)*pow(b,(z1+1))+x2/(z2+1)*pow(b,(z2+1)));\n    printf(\""%d\"",s);\n    return 0;\n}\n",WRONG_ANSWER,6,196
1591658610361655296,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-13 13:05:58,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    int a[n],i;\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n        \n    }\n}",WRONG_ANSWER,10,196
1591658615864582144,cf568c7ddc8b221335f880bfbaac4634294e65481e738a2e032c1ab9a84d576f,2022-11-13 13:06:00,Java,0.0,1591610585639407616,1591132307937943552,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) throws Exception {\n        Scanner in = new Scanner(System.in);\n        int n=in.nextInt();\n        int[]h=new int[n];\n        int m=0;\n        for(int i=0;i<=n-1;i++){\n            h[i]=in.nextInt();\n        }\n        for(int i=0;i<=n-2;i++){\n             if((h[i]-h[i+1])==1||(h[i]-h[i+1])==0)\n            \n                m++;   \n        }\n        System.out.println(m);\n       \n    }\n},WRONG_ANSWER,107,24352
1591658620595744768,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-13 13:06:01,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\n    int n = 0, i = 0, j = 0, count = 0;\n    scanf(\""%d\"",&n);\n    int arr[n];\n    arr[0] = 0;\n    arr[n-1] = 0;\n    for(i = 1;i < n-1; ++i)\n    {\n        scanf(\""%d\"",&arr[i]);\n    }\n    for(j = 0;j < n-1; ++j)\n    {\n        if(j == 0)\n        {\n            if(arr[0] == arr[1])\n            {\n                count++;\n            }\n        }\n        else if((arr[j] < arr[j-1]) && (arr[j] > arr[j+1]))\n        {\n            count++;\n        }\n        else if(arr[j] == arr[j+1])\n        {\n            count++;\n        }\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",WRONG_ANSWER,18,488
1591658621359153152,73af9d5098be5d450fba728363c8fdbe0f6a5526466daa2f3b74abf1acf75527,2022-11-13 13:06:01,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int n,a,b;\n    int i=0;\n    int c[1000],F[1000];\n    int sum=0;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&c[i]);\n        \n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&F[i]);\n        \n    }\n    if(n%2==0)\n    for(i=0;i<n;i+=2)\n    {\n    \n        sum=sum+((c[i]/(F[i]+1))*(pow(a,F[i]+1 )-pow(b,F[i]+1 ))+(c[i+1]/(F[i+1]+1))*(pow(a,F[i+1]+1 )-pow(b,F[i+1]+1 )));\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,5,196
1591658639742754816,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 13:06:05,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[n],sum=0,i,b=0;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i=b)\n    {\n        if(a[i]>a[i+2])\n        {\n            sum=sum+a[i]-5;\n            b=b+1;\n        }\n        else \n        {\n            sum=sum+a[i+2]-5;\n            b=b+3;\n        }\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,7,332
1591658645631545344,13616e85f216dd3844293b46f4b46105a0a2c458f7807a7b677858feb35cb63a,2022-11-13 13:06:07,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int i,n,sum=0;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n     for(i=1;i<n-1;i++)\n    {\n        if(a[i]<a[i-1]&&a[i]<a[i+1])\n            sum++;\n         if(a[i]==a[i+1]&&a[i]<a[i-1]&&a[i+1]<a[i+2])\n         {\n             sum++;\n             \n         }\n    }\n    printf(\""%d\\n\"",sum);\n}",WRONG_ANSWER,33,344
1591658645711282176,e0a829315cc9947a3e714cd579e3322e8dee5f8ca36e30fd276de5a8e294b6f8,2022-11-13 13:06:07,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n    int p,q,r;\n    int min;\n    scanf(\""%d%d%d\"",&p,&q,&r);\n    min=p;\n    if(min>q)\n        min=q;\n    if(min>r)\n        min=r;\n    printf(\""%d\"",min+r);\n    return 0;\n}\n",WRONG_ANSWER,6,324
1591658652615073792,6b02dfcf297d52c2de2e1416b33ee988ff909834c73207b147423a8301e9d174,2022-11-13 13:06:09,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{ int i;\nint n=3;\n int a=5;\n int b[n]={0};\n    for(i=0;i<3;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n   \n    printf(\""%d\"",a);\n    return 0;\n}",COMPILE_ERROR,0,0
1591658654028541952,739b1156eb9238db78ec0a88314ad93c72ab0c7fc7ecc0396c0a3fa3997af557,2022-11-13 13:06:09,Python,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"money=list(map(int,input().split()))\nmoney.sort()\ndata=money[0]+money[1]\nprint(data)",ACCEPTED,80,2820
1591658697145987072,e0156cb930d51b3d5482d43809e7b2c1f54a6b8623fccfa3202e2e53ddf1ffbf,2022-11-13 13:06:19,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\nint a,b,c,sum;\nscanf(\""%d%d%d\"",&a,&b,&c,sum);\nsum=a+b&&a+c&&b+c;\nif(a+b<a+c<b+c);\nprintf(\""%d\\n\"",sum=a+b);\n while(a+c<a+b<b+c);\n printf(\""%d\\n\"",sum=a+c);\n  while(b+c<a+b<a+c);\n  printf(\""%d\\n\"",sum=b+c);\n    return 0;\n\n}\n",TIME_LIMIT_EXCEEDED,400,352
1591658728062214144,acfcf65f14b5d3b02c3225372654b4e21f04d33a8bbaeb346e4fb1d85f2ea94f,2022-11-13 13:06:27,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int A,B,C;\n    int P=3,Q=2,R=5,i;\n    int P=A+B,Q=B+C,R=A+B+C;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    printf(\""%d\\n\"",A+B+B+C);\n    return 0;\n  \n  \n}",COMPILE_ERROR,0,0
1591658731568640000,13616e85f216dd3844293b46f4b46105a0a2c458f7807a7b677858feb35cb63a,2022-11-13 13:06:27,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int i,n,sum=0;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n     for(i=1;i<n-1;i++)\n    {\n        if(a[i]<a[i-1]&&a[i]<a[i+1])\n            sum++;\n         if(a[i]==a[i+1]&&a[i]<a[i-1]&&a[i+1]<a[i+2])\n         {\n             sum++;\n             \n         }\n    }\n    printf(\""%d\\n\"",sum);\n    return 0;\n}",WRONG_ANSWER,34,348
1591658738942226432,f55f4c0e0e3367434e26a462e3665271f5b4141ea3de4f34d96fdb21d67e2a7c,2022-11-13 13:06:29,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,i,z,b,count;\n    scanf(\""%d\"",&a);\n    count=0;\n for(i=0;i<a;i++)\n {\n    scanf(\""%d\"",&z);\n    if(z==0)\n        count++;\n\n }\n b=count-2;\n printf(\""%d \"",b);\n\n\n\n\n\n\n    return 0;\n}\n",WRONG_ANSWER,8,332
1591658750283636736,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-13 13:06:32,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j,k=0;\n    int a[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        a[0]=0;\n        a[n-1]=0;\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=1;j<n-1;j++)\n    {\n        if(a[j]<a[j-1]&&a[j+1]>a[j]||a[j]==a[j+1]&&a[j]<a[j-1]&&a[j+1]<a[j+2])\n        {\n            k++;\n        }\n    }\n    printf(\""%d\\n\"",k);\n}",RUNTIME_ERROR,24,476
1591658760274456576,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-13 13:06:34,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int N=10005;\nint a[N];\nint main(){\n\tint n;\n\tint cnt=0;\n    cin>>n;\n    for(int i=1;i<=n;i++)\n    cin>>a[i];\n    for(int i=3;i<n;i++){\n    \tif(a[i]<a[i-1]&&a[i]<a[i+1])\n    \tcnt++;\n    \tif(a[i]<a[i-1]&&a[i]==a[i+1]&&a[i+1]<a[i+2])\n    \tcnt++;\n    }\n    cout<<cnt;\n\treturn 0;\n} ,WRONG_ANSWER,35,460
1591658783678685184,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-13 13:06:40,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main(){\n\tint n,i,sum=0;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=0;i<n;i++){\n\t\tif(a[i+2]>=a[i]&&(n-1-i)>3) {\n\t\t\tsum+=a[i+2]-5;\n\t\t\ti=i+2;\n\t\t}\n\t\telse sum+=a[i]-5;\n\t}\n\tprintf(\""%d\\n\"",sum);\n}\n",WRONG_ANSWER,4,196
1591658787063488512,cf76a6e5773cf2f19ddd635fa646c5a6721f6fed8998d22ea1d0910bee8017a2,2022-11-13 13:06:41,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,b,c,d,e,f;\n    scanf(\""%d\"",&a);\n    scanf(\""%d\"",&b);\n    scanf(\""%d\"",&c);\n    d=a+b;\n    e=b+c;\n    f=c+a;\n    if(d<e)\n    {\n        printf(\""%d\"",d);\n    }\n    else if(e<f)\n    {\n        printf(\""%d\"",e);\n    }\n    else\n    {\n        printf(\""%d\"",f);\n    }\n}",ACCEPTED,37,508
1591658789080948736,958c7c2b659bf7ed617a82cd0cf9adf876a6f164ed5327aaa53afbb4e117d40d,2022-11-13 13:06:41,Python,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"money=list(map(int,input().split()))\nmoney.sort()\ndata=money[0]+money[1]\nprint(data)",ACCEPTED,93,2944
1591658802091679744,34d1cf71a2e3af8f7f6669b464d5dca494efd62633cf73f401f93fdeaa8e22e9,2022-11-13 13:06:44,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int a,b,c,m,n;\n    scanf(\""%d%d%d\"",&a,&b,&c);\n    m=a+b;\n    n=b+c;\n    if(m>=n)\n    printf(\""%d\"",n);\n    else\n        printf(\""%d\"",m);\n    return 0;\n}",ACCEPTED,39,480
1591658806629916672,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-13 13:06:45,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j,k=0;\n    int a[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=1;j<n-1;j++)\n    {\n        if(a[j]<a[j-1]&&a[j+1]>a[j]||a[j]==a[j+1]&&a[j]<a[j-1]&&a[j+1]<a[j+2])\n        {\n            k++;\n        }\n    }\n    printf(\""%d\\n\"",k);\n}",RUNTIME_ERROR,24,348
1591658835033731072,dcc1017bcd698bd6a0eee54e4ed848d4c51a3a26608990cdd2137e4c01065a1e,2022-11-13 13:06:52,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main (){\n    int a =60;\n    printf(\""%d\\n\"",a);\n return 0;   \n}",ACCEPTED,8,476
1591658862514823168,6a6dc7e644e57bb2c20b20d39bd4d9541bdebf6415e03e7c13707572c054673e,2022-11-13 13:06:59,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{  int m,n,a,b;\n   scanf(\""%d %d %d\"",&n,&a,&b);\n   if(a<n||n=<b)\n    m=n+a;\n   else\n    m=n+b;\n    printf(\""%d\"",m);\n\n    return 0;\n}\n\n",COMPILE_ERROR,0,0
1591658885914845184,6a835d762a87e93baf4142897168374dc31e9da90b86c19ed82f21159b644272,2022-11-13 13:07:04,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    printf(\""60\"");\n}",ACCEPTED,10,196
1591658903925186560,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-13 13:07:08,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n\n\n\n\n\nint daxiao(int * a,int b)\n{\n    //printf(\""%d@\"",b);\n    int x;\n    if(a[b]==a[b+1]) {b=b+1;\n                     }\n    else return b;\n    daxiao(a,b);\n\n\n}\n\nint main()\n{\n    int n,h[1000],i,j,k;\n    j=0;\n    k=0;\n    scanf(\""%d\"",&n);\n\n    for(i=0;i<n;i++)\n    {\n\n        scanf(\""%d\"",&h[i]);\n    }\n    for(i=1;i<n-1;i++)\n    {\n        if(h[i]<h[i+1]&&h[i]<h[i-1]) k++;\n        else if (h[i]==h[i+1]) {j=daxiao(h,i);\n        //printf(\""%d!\"",j);\n        if(h[i]<h[j+1]) k++;\n                }\n\n    }\n    printf(\""%d\\n\"",k);\n\n\n\n\n\n    return 0;\n}\n",WRONG_ANSWER,32,348
1591658906970284032,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-13 13:07:09,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int P,Q,R,m,n,max,all;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    m=P;\n    if(p>Q) m=Q;\n    if(p>R) m=R;\n    max=P;\n    if(p<Q) max=Q;\n    if(p<R) max=R;\n    if(Q>m&&Q<max) n=Q;\n    if(P>m&&P<max) n=P;\n    if(R>m&&R<max) n=R;\n    all=m+n;\n    printf(\""%d\"",all);\n    return 0;\n}",COMPILE_ERROR,0,0
1591658918282276864,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-13 13:07:12,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\nint main(void)\n{\n    int P,Q,R;\n    scanf(\""%d,%d,%d\"",&P,&Q,&R);\n    printf(\""%d\\n\"",P+Q);\n    return 0;\n}",WRONG_ANSWER,5,372
1591658922807975936,44e63106384b2202d1a15f2fb61b15315a1f0761b20f40b73c55e6122e10f27d,2022-11-13 13:07:13,Python,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"money=list(map(int,input().split()))\nmoney.sort()\ndata=money[0]+money[1]\nprint(data)\n\n\n",ACCEPTED,89,3056
1591658936510734336,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-13 13:07:16,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"n = eval(input())\na = [0]*n\nx = 0\nnum = 1\nlist = map(int,input().split())\nfor i in list:\n    a[x] = i\n    x=x+1\nfor j in range(1,n-1):\n    if a[j] < a[j-1]:\n        num = num+1\nprint(num-1)\n\n    \n\n",WRONG_ANSWER,17,2816
1591658963207467008,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-13 13:07:23,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\nint main(void)\n{\n    int P,Q,R;\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    printf(\""%d\\n\"",P+Q);\n    return 0;\n}",WRONG_ANSWER,11,324
1591658963522039808,6a6dc7e644e57bb2c20b20d39bd4d9541bdebf6415e03e7c13707572c054673e,2022-11-13 13:07:23,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{  int m,n,a,b;\n   scanf(\""%d %d %d\"",&n,&a,&b);\n   if(a<n)\n    m=n+a;\n   else\n    m=n+b;\n    printf(\""%d\"",m);\n\n    return 0;\n}\n\n",WRONG_ANSWER,4,196
1591658983520526336,6a6dc7e644e57bb2c20b20d39bd4d9541bdebf6415e03e7c13707572c054673e,2022-11-13 13:07:27,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{  int m,n,a,b;\n   scanf(\""%d %d %d\"",&n,&a,&b);\n   if(a<n)\n    m=n+a;\n   else\n    m=n+b;\n    printf(\""%d\"",m);\n\n    return 0;\n}\n\n",WRONG_ANSWER,9,196
1591658993595211776,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-13 13:07:30,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main(){\n\tint n,i,sum=0;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=0;i<n;i++){\n\t\tif(a[i+2]>a[i]&&(n-1-i)>3) {\n\t\t\tsum+=a[i+2]-5;\n\t\t\ti=i+2;\n\t\t}\n\t\telse sum+=a[i]-5;\n\t}\n\tprintf(\""%d\\n\"",sum);\n}\n",WRONG_ANSWER,9,328
1591659000880750592,f55f4c0e0e3367434e26a462e3665271f5b4141ea3de4f34d96fdb21d67e2a7c,2022-11-13 13:07:32,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,i,z,b,count;\n    scanf(\""%d\"",&a);\n    count=0;\n for(i=0;i<a;i++)\n {\n    scanf(\""%d\"",&z);\n    if(z==0)\n        count++;\n\n }\n b=count-2;\n printf(\""%d\"",b);\n\n\n\n\n\n\n    return 0;\n}\n",WRONG_ANSWER,7,200
1591659002948542464,950b2713b447943280c6052f88160e7298bd0ba94c14d628bbdd70df720305b5,2022-11-13 13:07:32,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"P=eval(input())\nQ=eval(input())\nR=eval(input())\na=P+Q\nb=Q+R\nc=R+P\n#d=min(a,b,c)\nif 1<=P<=10**3 and  1<=Q<=10**3 and  1<=R<=10**3   :\n    if a>b:\n        print(b)\n    elif  b>c :\n        print (c)\n    else :\n        print(a)\n    ",NON_ZERO_EXIT_CODE,18,2760
1591659003128897536,33066437ddee11f609c900fe8dbd59cb8113e4d8dfd13c1812f199f4f3fdd334,2022-11-13 13:07:32,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 10000\n\nint main()\n{\n    int n,i,a[N],flag=0,t=1;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",a[i]);\n    }\n    while(a[t]<a[t+1])\n    {\n        t++;\n    }\n    if(a[t+1]=a[+2]) t++;\n    if(a[t+1]<a[t]&&a[t+1]<a[t+2])\n        flag++;\n    printf(\""%d\"",flag);\n}",SEGMENTATION_FAULT,8,324
1591659022456250368,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-13 13:07:37,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<iostream>\nusing namespace std;\nint max(int a,int b){\n    return a>b?b:a;\n}\nint main(){\n    int P,Q,R;\n    cin>>P>>Q>>R;\n    cout<<max(P,Q)+max(P,R)<<endl;\n    return 0;\n}",WRONG_ANSWER,9,328
1591659030580584448,44e63106384b2202d1a15f2fb61b15315a1f0761b20f40b73c55e6122e10f27d,2022-11-13 13:07:39,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"print(\""60\"")",ACCEPTED,16,2780
1591659032170258432,0b693affc66d8d407ff008bd1aaf4f2feb4a615f057943ba4b4ba3163d937dc6,2022-11-13 13:07:39,Java,300.0,1591610585635213317,1591130976212869120,1049226928954454016,"import java.io.*;\nimport java.util.*;\n\npublic class Main {\n\n    public static void main(String[] args) throws IOException {\n        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n        Scanner sc=new Scanner(System.in);\n        String[] s=br.readLine().split(\"" \"");\n        String[] xi=br.readLine().split(\"" \"");\n        String[] ci=br.readLine().split(\"" \"");\n        int n=Integer.parseInt(s[0]);\n        int top=Integer.parseInt(s[1]);\n        int blow=Integer.parseInt(s[2]);\n        double res1=0;\n        double res2=0;\n        for (int i = 0; i < n; i++) {\n            double c1=Double.parseDouble(xi[i]);\n            double f1=Double.parseDouble(ci[i]);\n            double left=c1/(f1+1);\n            res1+=left*Math.pow(top,f1+1);\n            res2+=left*Math.pow(blow,f1+1);\n        }\n        int res= (int) (res1-res2);\n        System.out.println(res);\n    }\n}",ACCEPTED,503,24724
1591659032350568448,8cf8229a23351e1ca2a7bfc1ad0af3ab2ad4a709a7c796637dbdea7befc2b0ec,2022-11-13 13:07:39,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R;\n    int a,b,c,min;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    a=P+Q;\n    b=P+R;\n    c=Q+R;\n    min=a;\n    if (a>b)\n    {\n        min=b;\n     if (b>c)\n        min=c;\n    }\n        else if(a>c)\n         min=c;\n        printf(\""%d\"",min);\n    return 0;\n}\n",ACCEPTED,31,492
1591659044014940160,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-13 13:07:42,Python,0.0,1591610585635213313,1589906790446387200,1049226928954454016,"num=int(input())\nfor i in range (num-1):\n    n=int(input())\n    a=list(input().split())\n    for i in range (len(a)):\n        a[i]=int(a[i])\n    b=a\n    all=2*max(a)-min(a)\n    b.remove(min(a))\n    b.remove(max(a))\n    print(all-max(b),end='\\n')\nn=int(input())\na=list(input().split())\nfor i in range (len(a)):\n    a[i]=int(a[i])\nb=a\nall=2*max(a)-min(a)\nb.remove(min(a))\nb.remove(max(a))\nprint(all-max(b),end='')\n",WRONG_ANSWER,48,3072
1591659046288240640,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-13 13:07:42,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int P,Q,R,m,n,max,all;\n    if(scanf(\""%d %d %d\"",&P,&Q,&R));\n    m=P;\n    if(p>Q) m=Q;\n    if(p>R) m=R;\n    max=P;\n    if(p<Q) max=Q;\n    if(p<R) max=R;\n    if(Q>m&&Q<max) n=Q;\n    if(P>m&&P<max) n=P;\n    if(R>m&&R<max) n=R;\n    all=m+n;\n    printf(\""%d\"",all);\n    return 0;\n}",COMPILE_ERROR,0,0
1591659070996897792,29d1ea54d6e4e56fc2de0be5ae10ecc4c70c7fca667934b17857e95530f5663a,2022-11-13 13:07:48,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n   int p.q.r,max,n;\n    \n        scanf(\""%d %d %d\"",&p,&q,&r);\n    if(p>q)\n    {\n        if(q>r) max=p;\n    }\n    if(q>p)\n    {\n        if(p>r)  max=q;\n    }\n    if(r>p)\n    {\n        if(p>q)  max=r;\n    }\n    n=p+q+r-max;\n    printf(\""%d\"",n);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1591659074889244672,0354b067c4132d4425a90b77482ac717447702274cb7db1282edce56eaf037b3,2022-11-13 13:07:49,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main(){\n\tint n,i,a[100],min,count;\n\tscanf(\""%d\"",&n);\n\tcount=0;\n\tfor(i=0;i<n;i++)\n\t   scanf(\""%d\"",&a[i]);\n\tmin=1;\n\tfor(i=1;i<n-1;i++){\n\t\tif(a[i]<=a[min])\n\t\t   min=i;\n\t}\n\tfor(i=min+1;i<n;i++){\n\t\tif(a[i]>=a[min])\n\t\t   count++;\n\t\telse\n\t\t   break;\n\t}\n\tfor(i=min;i>0;i--){\n\t\tif(a[i]>=a[min])\n\t\t   count++;\n\t\telse\n\t\t   break;\n\t}\n\tprintf(\""%d\"",a[min]*count);\n\treturn 0;\n} ",WRONG_ANSWER,5,640
1591659083965718528,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-13 13:07:51,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"n = eval(input())\na = [0]*n\nx = 0\nnum = 1\nlist = map(int,input().split())\nfor i in list:\n    a[x] = i\n    x=x+1\nfor j in range(1,n-1):\n    if a[j] < a[j-1] and a[j-1]>a[j-2]:\n        num = num+1\nprint(num-1)\n\n    \n\n",WRONG_ANSWER,78,3032
1591659111463542784,cf76a6e5773cf2f19ddd635fa646c5a6721f6fed8998d22ea1d0910bee8017a2,2022-11-13 13:07:58,C,0.0,1591610585635213314,1591128862958940160,1049226928954454016,"#include<stdio.h>\n#define N 30\nint main()\n{\n    int n,i,j,t;\n    int a[N],b[N];\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n-1;i++)\n    {\n       scanf(\""%d\"",&a[i]);\n    }\n     for(i=0;i<n-1;i++)\n     {\n        for(j=0;j<3;j++)\n        {\n            if(a[j]<a[j+1])\n          {\n             t=a[j];\n             a[j]=a[j+1];\n             a[j+1]=t;\n           }\n        }\n      }\n     printf(\""%d \"",n);\n    for(i=0;i<n-1;i++)\n        printf(\""%d \"",a[i]);\n}\n",SEGMENTATION_FAULT,8,328
1591659113229344768,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-13 13:07:58,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\nint main(void)\n{\n    int P,Q,R;\n    int scanf(\""%d%d%d\"",&P,&Q,&R);\n    printf(\""%d\\n\"",P+Q);\n    return 0;\n}",COMPILE_ERROR,0,0
1591659159429591040,d122b81a371b28751082747cf65a235d0eddfd496e142775cd971d8f88adf327,2022-11-13 13:08:09,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int a,b,c;\n    if(scanf(\""%d%d%d\"",&a,&b,&c)){;\n    int min=0;\n    min=a+b;\n    if(a+c<=min&&b+c>min){\n        min=a+c;\n        printf(\""%d\\n\"",min);\n    }\n    if(b+c<=min&&a+c>min){\n        min=b+c;\n        printf(\""%d\\n\"",min);\n    }\n    if(b+c>min&&a+c>min){\n        printf(\""%d\\n\"",min);\n    }\n                                }\n    return 0;\n                                \n}",WRONG_ANSWER,18,360
1591659169508548608,6a835d762a87e93baf4142897168374dc31e9da90b86c19ed82f21159b644272,2022-11-13 13:08:12,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    printf(\""60\"");\n}",ACCEPTED,10,356
1591659184008212480,cf76a6e5773cf2f19ddd635fa646c5a6721f6fed8998d22ea1d0910bee8017a2,2022-11-13 13:08:15,C,0.0,1591610585635213314,1591128862958940160,1049226928954454016,"#include<stdio.h>\n#define N 30\nint main()\n{\n    int n,i,j,t;\n    int a[N];\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n-1;i++)\n    {\n       scanf(\""%d\"",&a[i]);\n    }\n     for(i=0;i<n-1;i++)\n     {\n        for(j=0;j<3;j++)\n        {\n            if(a[j]<a[j+1])\n          {\n             t=a[j];\n             a[j]=a[j+1];\n             a[j+1]=t;\n           }\n        }\n      }\n     printf(\""%d \"",n);\n    for(i=0;i<n-1;i++)\n        printf(\""%d \"",a[i]);\n}\n",SEGMENTATION_FAULT,5,200
1591659184297619456,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-13 13:08:15,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\nint main(void)\n{\n    int P,Q,R;\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    printf(\""%d\\n\"",P+Q);\n    return 0;\n}",WRONG_ANSWER,14,492
1591659184691929088,15ac7d06a472ca25d78349f7cc3a73d23c7d7a4f0c4ae3cec6200fcdb8135965,2022-11-13 13:08:15,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,a[500];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    \n   \n    \n    return 0;\n}\n",WRONG_ANSWER,10,356
1591659196242997248,e7f8e9ba366feb4551b7dc8e6a149f796e822980a43de4fcc91ded552c4bcbd4,2022-11-13 13:08:18,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"int main(int argc, char *argv[]) {\n\tint P,Q,R,F,G,H=0; \n\tscanf(\""%d%d%d\"",&P,&Q,&R);\n\tF=P+Q; \n\tG=Q+R; \n\tH=R+P;\n\tif(F<G<H&&F<H<G) \n\t  printf(\""%d\"",F); \n\t  \n\telse if(G<F<H&&G<H<F) \n\t  printf(\""%d\"",G);\n\t  \n\telse if(H<G<F&&H<F<G) \n\t  printf(\""%d\"",F);\n\t  \n\treturn 0;\n\t\n}",WRONG_ANSWER,10,464
1591659201863409664,29d1ea54d6e4e56fc2de0be5ae10ecc4c70c7fca667934b17857e95530f5663a,2022-11-13 13:08:19,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n   int p,q,r,max,n;\n        scanf(\""%d %d %d\"",&p,&q,&r);\n    if(p>q)\n    {\n        if(q>r) max=p;\n    }\n    if(q>p)\n    {\n        if(p>r)  max=q;\n    }\n    if(r>p)\n    {\n        if(p>q)  max=r;\n    }\n    n=p+q+r-max;\n    printf(\""%d\"",n);\n    return 0;\n}\n",WRONG_ANSWER,12,480
1591659202052120576,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-13 13:08:20,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int N=10005;\nint a[N];\nint main(){\n\tint n;\n\tint cnt=0;\n    cin>>n;\n    for(int i=1;i<=n;i++)\n    cin>>a[i];\n    for(int i=3;i<n;i++){\n    \tif(a[i]<a[i-1]&&a[i]<a[i+1])\n    \tcnt++;\n    \tif(a[i]<a[i-1]&&a[i]==a[i+1]&&a[i+1]<a[i+2])\n    \tcnt++;\n    \tif(a[i]<a[i-1]&&a[i]==a[i+1]&&a[i+1]==a[i+2]&&a[i+2]<a[i+3])\n    \tcnt++;\n    }\n    cout<<cnt;\n\treturn 0;\n} ,WRONG_ANSWER,32,580
1591659203411107840,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-13 13:08:20,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a[4],b[4],i,j;\n    for(i=1;i<=3;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=1;i<=3;i++)\n        if(a[i]<a[i-1])\n    {\n        b[1]=a[i];\n        j=i;\n    }\n    a[j]=100000;\n    for(i=1;i<=3;i++)\n        if(a[i]<a[i-1])\n        b[2]=a[i];\n    printf(\""%d\\n\"",b[1]+b[2]);\n    return 0;\n}\n",WRONG_ANSWER,25,320
1591659219139715072,617f184ce583e9f7a346564ab5659fda0ca35a3a714a0c929cb07f915f4f514b,2022-11-13 13:08:24,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    if(P+Q>=P+R)\n    {\n        printf(\""%d\"",P+R);\n    }\n    else if(P+Q>=Q+R)\n    {\n        printf(\""%d\"",Q+R);\n    }\n    else if(P+R>=Q+R)\n    {\n        printf(\""%d\"",Q+R);\n    }\n    else\n        printf(\""%d\"",P+Q);\n    return 0;\n}\n",WRONG_ANSWER,18,640
1591659224097382400,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-13 13:08:25,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int P,Q,R,m,n,max,all;\n    if(scanf(\""%d %d %d\"",&P,&Q,&R));\n    m=P;\n    if(P>Q) m=Q;\n    if(P>R) m=R;\n    max=P;\n    if(P<Q) max=Q;\n    if(P<R) max=R;\n    if(Q>m&&Q<max) n=Q;\n    if(P>m&&P<max) n=P;\n    if(R>m&&R<max) n=R;\n    all=m+n;\n    printf(\""%d\"",all);\n    return 0;\n}",ACCEPTED,31,488
1591659236948717568,f55f4c0e0e3367434e26a462e3665271f5b4141ea3de4f34d96fdb21d67e2a7c,2022-11-13 13:08:28,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,i,z,b,count;\n    scanf(\""%d\"",&a);\n    count=0;\n for(i=0;i<a;i++)\n {\n    scanf(\""%d\"",&z);\n    if(z==0)\n        count++;\n\n }\n b=count-2;\n printf(\"" %d\"",b);\n\n\n\n\n\n\n    return 0;\n}\n",WRONG_ANSWER,11,488
1591659247874891776,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-13 13:08:30,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#define MAXSIZE 10000\nint main(){\n    int n,s[MAXSIZE];\n    scanf(\""%d\"",&n);\n    int sum=0;\n       for(int i=0;i<n;i++)\n        scanf(\""%d\"",&s[i]); \n       for(int i=0;i<n;i++)\n           if(s[i]<s[i+1])\n               sum++;\n    sum=sum-1;\n    if(sum<0);\n    printf(\""0\"");\n    else\n    printf(\""%d\"",sum);\n    printf(\""\\n\"");\n    return 0;\n}",COMPILE_ERROR,0,0
1591659254619365376,0ccbaaa612b3d01dbe621ce5e7366d6e26d2e5adf55047d92c6eb7adf78a979d,2022-11-13 13:08:32,C++,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int x,y,z;\n    cin>>x>>y>>z;\n    int a=x+y,b=y+z,c=z+x;\n    int d[3];\n    d[0]=a,d[1]=b,d[2]=c;\n    sort(d,d+3);\n    cout<<d[0];\n    return 0;\n}\n",ACCEPTED,29,488
1591659259967102976,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-13 13:08:33,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a[4],b[4],i,j;\n    for(i=1;i<=3;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=1;i<=3;i++)\n        if(a[i]<a[i-1])\n    {\n        b[1]=a[i];\n        j=i;\n    }\n    a[j]=1000;\n    for(i=1;i<=3;i++)\n        if(a[i]<a[i-1])\n        b[2]=a[i];\n    printf(\""%d\\n\"",b[1]+b[2]);\n    return 0;\n}\n",WRONG_ANSWER,8,348
1591659260386488320,6a6dc7e644e57bb2c20b20d39bd4d9541bdebf6415e03e7c13707572c054673e,2022-11-13 13:08:33,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{  int n,a,b;\n   scanf(\""%d %d %d\"",&n,&a,&b);\n    m=n+a;\n    printf(\""%d\"",m);\n    return 0;\n}\n\n",COMPILE_ERROR,0,0
1591659264115236864,705adaf4eb218ca0fc51c6e09291eb309a3de0a7c595448a17d2fdb157e64706,2022-11-13 13:08:34,C,300.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,a,b,i,m,q;\n    float c[1000];\n    float f[1000];\n    int N=0,M=0,sum=0;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%f\"",&c[i]);\n    }\n   for(i=0;i<n;i++)\n    {\n     scanf(\""%f\"",&f [i]);\n    }\n     for(i=0;i<n;i++)\n     {\n         q=(c[i]/(f[i]+1))*pow(a,f[i]+1);\n         N+=q;\n     }\n     for(i=0;i<n;i++)\n      {\n         m= (c[i]/(f[i]+1))*pow(b,f[i]+1);\n        M+=m;\n                          }\n        sum=N-M;\n       printf(\""%d\"",sum);\n\n    return 0;\n}\n",ACCEPTED,45,496
1591659264333340672,cf76a6e5773cf2f19ddd635fa646c5a6721f6fed8998d22ea1d0910bee8017a2,2022-11-13 13:08:34,C,0.0,1591610585635213314,1591128862958940160,1049226928954454016,"#include<stdio.h>\n#define N 30\nint main()\n{\n    int n,i,j,t;\n    int a[N];\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n-1;i++)\n    {\n       scanf(\""%d\"",&a[i]);\n    }\n     for(i=0;i<n-1;i++)\n     {\n        for(j=0;j<3;j++)\n        {\n            if(a[j]<a[j+1])\n          {\n             t=a[j];\n             a[j]=a[j+1];\n             a[j+1]=t;\n           }\n        }\n      }\n     printf(\""%d \"",n);\n    for(i=0;i<n-1;i++)\n        printf(\""%d \"",a[i]);\n}\n",SEGMENTATION_FAULT,12,492
1591659277650288640,ddd0edd80a23dfec88d0679f4ed6037779b80d26db4ba0f74fecb3d447de61fa,2022-11-13 13:08:38,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#define Max 100000\nint main(){\n    int n,j=0,i,flag=0;\n    int a[Max];\n    scanf(\""%d\"",&n);\n    while(n){\n        scanf(\""%d\"",&a[j]);\n        n--;\n        j++;\n    }\nfor(i=1;i<j-1;i++)\n{if(a[i]=a[i+1])\n        i=i+1;\n    if(a[i]>a[i+1])\n        flag++;\n}\n    printf(\""%d\"",flag);\n}",WRONG_ANSWER,9,196
1591659278845632512,7222c2fb91a71fcf3f6560860557ab564f69a453594c9f1620ecc35bb26f5daf,2022-11-13 13:08:38,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nint main(){\n    int P,Q,R,max;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    \n   if(P>=Q&&P>=R)\n   {\n       max=Q+R;\n   }\n     if(Q>=R&&Q>=P)\n   {\n       max=P+R;\n   }\n     if(R>=Q&&R>=P)\n   {\n       max=Q+P;\n   }\n    printf(\""%d\"",max);\n    \n}",ACCEPTED,34,356
1591659285896257536,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-13 13:08:40,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n\n\n\n\n\nint daxiao(int * a,int b)\n{\n    //printf(\""%d@\"",b);\n    int x;\n    if(a[b]==a[b+1]) {b=b+1;\n                     }\n    else return b;\n    daxiao(a,b);\n\n\n}\n\nint main()\n{\n    int n,h[1000],i,j,k;\n    j=0;\n    k=0;\n    scanf(\""%d\"",&n);\nif(n>=3&&n<=10000){\n    for(i=0;i<n;i++)\n    {\n\n        scanf(\""%d\"",&h[i]);\n    }\n    for(i=1;i<n-1;i++)\n    {\n        if(h[i]<h[i+1]&&h[i]<h[i-1]) k++;\n        else if (h[i]==h[i+1]) {j=daxiao(h,i);\n        //printf(\""%d!\"",j);\n        if(h[i]<h[j+1]) k++;\n                }\n\n    }\n    printf(\""%d\\n\"",k);\n}\n\n\n\n\n    return 0;\n}\n",WRONG_ANSWER,44,324
1591659288110850048,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-13 13:08:40,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n\n\n//O(N)\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"",&n);\n\n    int arr[n];\n    int i = 0;\n    for(i = 0; i < n; ++i){\n        scanf(\""%d\"",&arr[i]);\n    }\n\n    int width = 0;\n    int j = 0;\n    int mul = 1;\n    int max = 0;\n    for(i = 0; i < n; ++i){\n        for(j = i; j < n; ++j){\n            if(arr[i] <= arr[j]){\n                ++width;\n            }\n        }\n        mul = width * arr[i];\n\n        if(mul > max){\n            max = mul;\n        }\n\n        width = 0;\n    }\n\n    printf(\""%d\"",max);\n\n    return 0;\n}",WRONG_ANSWER,5,324
1591659292611371008,f55f4c0e0e3367434e26a462e3665271f5b4141ea3de4f34d96fdb21d67e2a7c,2022-11-13 13:08:41,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,i,z,b,count;\n    scanf(\""%d\"",&a);\n    count=0;\n for(i=0;i<a;i++)\n {\n    scanf(\""%d\"",&z);\n    if(z==0)\n        count++;\n\n }\n b=count-2;\n printf(\""%d\"",b);\n\n\n\n\n\n\n    return 0;\n}\n",WRONG_ANSWER,5,196
1591659304841961472,6a6dc7e644e57bb2c20b20d39bd4d9541bdebf6415e03e7c13707572c054673e,2022-11-13 13:08:44,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{  int m,n,a,b;\n   scanf(\""%d %d %d\"",&n,&a,&b);\n    m=n+a;\n    printf(\""%d\"",m);\n    return 0;\n}\n\n",WRONG_ANSWER,13,196
1591659308126101504,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-13 13:08:45,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main(){\n\tint n,i,sum=0;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=0;i<n;i++){\n\t\tif(a[i+2]>a[i]&&(n-1-i)>=3) {\n\t\t\tsum+=a[i+2]-5;\n\t\t\ti=i+2;\n\t\t}\n\t\telse sum+=a[i]-5;\n\t}\n\tprintf(\""%d\\n\"",sum);\n}\n",WRONG_ANSWER,8,324
1591659325134004224,70c675ddfcb60b2192bc8ac38fb068fec0500208a5bf97a796c7cc074b43cf87,2022-11-13 13:08:49,Java,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"import java.util.Scanner;\n\n    public class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner myScanner = new Scanner(System.in);\n\t\tint n = myScanner.nextInt();\n\t\tint[] arr = new int[n];\n\t\tint count = 0;\n\t\tfor(int i = 0; i < n;i++){\n\t\t\tarr[i] = myScanner.nextInt();\n\t\t}\n\t\tfor(int j = 1;j <= n-2;j++){\n\t\t\tif(arr[j] > arr[j+1] && arr[n-2] != 0){\n\t\t\t\tcount++;\n\t\t\t\tif(j == n-2){\n\t\t\t\t\tcount -= 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.printf(\""%d\"",count);\n\t}\n\n}",WRONG_ANSWER,106,24584
1591659331375083520,6b02dfcf297d52c2de2e1416b33ee988ff909834c73207b147423a8301e9d174,2022-11-13 13:08:50,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{ int i;  \n int b[10];\n \n int a=5;\n\n    for(i=0;i<3;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n   \n    printf(\""%d\"",a);\n    return 0;\n}",WRONG_ANSWER,8,196
1591659339033894912,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-13 13:08:52,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,j,k,temp=0;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n      for(i=0;i<n-2;i++)\n      {\n        if(a[i]>=a[i+1]&&a[i+1]<a[i+2])\n            temp++;\n      }\n      printf(\""%d\"",temp);\n    return 0;\n}\n",ACCEPTED,31,364
1591659339298136064,13eac09c9e523ec396926840225e626f8fff54ca0e8a92e46e533705daa83ac2,2022-11-13 13:08:52,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,j,a=0,b=1;\n    int i=0;\n    scanf(\""%d\\n\"",&n);\n    scanf(\""%d*n\"",&a,&b);\n    j=n/2*2;\n    printf(\""%d\"",j);\n\n    return 0;\n}\n",WRONG_ANSWER,5,200
1591659371682357248,ac6681ab5fc25ee05ff21b3da74920316506e49f1c09ea3dd6807684b18b6779,2022-11-13 13:09:00,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\nint x,y,z,temp;\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    temp=x+y;\n    if(y+z<temp)\n        temp=y+z;\n    else if(z+x<temp)\n    temp=z+x;\n    printf(\""%d\"",temp);\n\n    return 0;\n}",ACCEPTED,27,348
1591659411847045120,29d1ea54d6e4e56fc2de0be5ae10ecc4c70c7fca667934b17857e95530f5663a,2022-11-13 13:09:10,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n   int p,q,r,max,n;\n        scanf(\""%d %d %d\"",&p,&q,&r);\n    max=0;\n    if(p>q)\n    {\n        if(q>r) max=p;\n    }\n    if(q>p)\n    {\n        if(p>r)  max=q;\n    }\n    if(r>p)\n    {\n        if(p>q)  max=r;\n    }\n    n=p+q+r-max;\n    printf(\""%d\"",n);\n    return 0;\n}\n",WRONG_ANSWER,5,320
1591659438229184512,7e6a67f270e740aba8788a12d9a49939621a28d5059d3ced2247a86914b0a3b3,2022-11-13 13:09:16,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h> \n\nint main() {\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tint i,j;\n\tint temp,max=0,num;\n\t\n\tfor(i=0;i<n;i++)\n\t\tscanf(\""%d\"",&a[i]);\n\t\n\tfor(i=0;i<n;i++)\n\t{\n\t\tnum=0;\n\t\tfor(j=0;j<n;j++)\n\t\t{\n\t\t\tif(a[i]>a[j]) continue;\n\t\t\tnum++;\n\t\t}\n\t\ttemp=a[i]*num;\n\t\tif(temp>max) max=temp;\n\t}\n\t\n\tprintf(\""%d\"",max);\n}",WRONG_ANSWER,6,484
1591659455824289792,d9e13de81d487f21b11cf0fc38d2ef82b49d511a81ed1305cdfa47276a1c2e23,2022-11-13 13:09:20,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n\tint P,Q,R,a,b,c,t;\n\tscanf(\""%d %d %d\"",&P,&Q,&R);\n\tif(P>=1&&Q>=1&&R>=1&&P<=1000&&Q<=1000&&R<=1000)\n\t{\n\t\ta=P+Q;\n\t\tb=P+R;\n\t\tc=Q+R;\n\t\tif(a<=b&&a<=c)\n\t {\n\t\tt=a;\n\t }\n\tif(b<=a&&b<=c)\n \t {\n\t\tt=b;\n\t }\n\telse\n \t {\n\t\tt=c;\n \t }\n \t \tprintf(\""最少花费%d元\\n\"",t);\n\t}\n\n\t\n\n\treturn 0;\n } ",WRONG_ANSWER,10,476
1591659457304879104,1c76961e293959cbfa749568290c58d912c131cbc4a710b8bd9a4e58eccf0b8e,2022-11-13 13:09:20,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i;\n   scanf(\""%d\"",&n);\n     int a[n];\n    for(i=0;i<=n-1;i++)\n        scanf(\""%d\"",&a[i]);\n     int b;\n    b=0;\n    for(i=1;i<n-2;i++)\n    {\n        if(a[i]<a[i-1])\n        {\n            b++;\n        }\n    }\n    printf(\""%d\"",b);\n    return 0;\n}\n",WRONG_ANSWER,6,196
1591659462812000256,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-13 13:09:22,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a[4],b[4],i,j;\n    for(i=1;i<=3;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=1;i<=3;i++)\n        if(a[i]<a[i-1])\n    {\n        b[1]=a[i];\n        j=i;\n    }\n    a[j]=10000;\n    for(i=1;i<=3;i++)\n        if(a[i]<a[i-1])\n        b[2]=a[i];\n    printf(\""%d\\n\"",b[1]+b[2]);\n    return 0;\n}\n",WRONG_ANSWER,5,324
1591659465269862400,d122b81a371b28751082747cf65a235d0eddfd496e142775cd971d8f88adf327,2022-11-13 13:09:22,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int a,b,c;\n    if(scanf(\""%d%d%d\"",&a,&b,&c)){\n    int min=0;\n    min=a+b;\n    if(a+c<=min&&b+c>min){\n        min=a+c;\n        printf(\""%d\\n\"",min);\n    }\n    if(b+c<=min&&a+c>min){\n        min=b+c;\n        printf(\""%d\\n\"",min);\n    }\n    if(b+c>min&&a+c>min){\n        printf(\""%d\\n\"",min);\n    }\n                                }\n    return 0;\n                                \n}",WRONG_ANSWER,18,328
1591659498761367552,e7f8e9ba366feb4551b7dc8e6a149f796e822980a43de4fcc91ded552c4bcbd4,2022-11-13 13:09:30,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main(int argc, char *argv[]) {\n\tint P,Q,R,F,G,H=0; \n\tscanf(\""%d%d%d\"",&P,&Q,&R);\n\tF=P+Q; \n\tG=Q+R; \n\tH=R+P;\n\tif(F<G<H&&F<H<G) \n\t  printf(\""%d\"",F); \n\t  \n\telse if(G<F<H&&G<H<F) \n\t  printf(\""%d\"",G);\n\t  \n\telse if(H<G<F&&H<F<G) \n\t  printf(\""%d\"",F);\n\t  \n\treturn 0;\n\t\n}\n",WRONG_ANSWER,12,352
1591659505782677504,00d0a1b2e987c17fb50850b9ec54bf6b4f8b997eb053d1a9fed6c4888fbe74ed,2022-11-13 13:09:32,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,i,x=0;\n    int a[n];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for (i=0;i<n;)\n    {\n        if(a[i+1]<a[i+3])\n            i=i+3;\n        else i=i+1;\n        x=x+a[i]-5;\n    }\n    printf(\""%d\"",x);\n    return 0;\n}",WRONG_ANSWER,5,328
1591659515190468608,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 13:09:34,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[n],sum=0,i,b=0;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i=b)\n    {\n        if(a[i]>a[i+2])\n        {\n            sum=sum+a[i]-5;\n            b=b+1;\n        }\n        else if(a[i]=a[i+2]&&a[i+1]>a[i+3])\n        {\n            sum=sum+a[i]-5;\n            b=b+1;\n        }\n        else if(a[i]=a[i+2]&&a[i+1]<a[i+3])\n        {\n            sum=sum+a[i+2]-5;\n            b=b+1;\n        }\n        else \n        {\n            sum=sum+a[i+2]-5;\n            b=b+3;\n        }\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,7,332
1591659526133407744,064270dabaa13edbd7238477860db0e46621a5ed4921e8aa2c0f9258e77722cc,2022-11-13 13:09:37,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 100\nint main()\n{\nint sum[N];\nint a,i;\nint count=0;\nscanf(\""%d\"",&a);\nfor(i=0;i<a;i++)\n   {\n       scanf(\""%d\"",&sum[i]);\n       if(sum[i]<=sum[i+1]&&sum[i]<sum[i-1])\n        count++;\n   }\n\nprintf(\""%d\"",count-2);\n}\n",WRONG_ANSWER,11,200
1591659562808401920,225b1524edf804414c466257a4f19789fe127117b27e663dc835d742fed77f9e,2022-11-13 13:09:46,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,b,c;\n    printf(\""%d%d%d\"",&a,&b,&c);\n    int sum;\n    \n    sum=a+b;\n    printf(\""sum%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,4,324
1591659569708032000,9c773df96630087325d11d08f2dbc9851abb095c63fb7b3e55cb667898dfe23f,2022-11-13 13:09:47,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nmain()\n{\n    int i,j,k;\n    int s=0;\n    printf(\""请输入A到B，B到C,C到A的花费：\"");\n    scanf(\""%d,%d,%d\"",&i,&j,&k);\n    if(i>j)\n    {\n        s=s+j;\n        printf(\""从B到C花费为%d,\"",j);\n        if(j>k)\n        {\n            s=s+k;\n            printf(\""从C到A花费为%d,总花费为%d\\n\"",k,s);\n        }\n\n\n    }\n    else if(i<j)\n    {\n        s=s+i;\n        printf(\""从A到B花费为%d,\"",i);\n        if(i>k)\n        {\n            s=s+k;\n            printf(\""花费为%d\\n\"",s);\n        }\n    }\n\n\n\n}\n",WRONG_ANSWER,4,360
1591659576582496256,81f258582663b08bc9b4d77bba77afc3b463021ec8fb2262453de07687484cd5,2022-11-13 13:09:49,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"P,Q,R = input().split()\n\n\np = int(P)\nq = int(Q)\nr = int(R)\n\n\na =  p + q\nb = p + r\nc =  r +p\n\n#f= eval(a)\n#h= eval(b)\n#g= eval(c)\nd = min(a,b,c)\nif 0<=p<=10**3 and 0<=q<=10**3 and 0<=r<=10**3:\n  print(d)\n \n ",WRONG_ANSWER,15,2772
1591659591145119744,54914c90623988219ee55c4a0b2e645efd9808505aa25f0099930bfa8bf18ad1,2022-11-13 13:09:52,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main(){\n\tint inp,i;\n\tscanf(\""%d\"",&inp);\n\tint a[inp];\n\tfor(i=0;i<inp;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tint count = 0;\n\tfor(i=1;i<inp-1;i++){\n\t\tif(a[i]<=a[i-1]&&a[i]<=a[i+1]){\n\t\t\tcount++;\n\t\t}\n\t\tif(a[i]==a[i+1]){\n\t\t\tcount--;\n\t\t}\n\t}\n\tprintf(\""%d\"",count);\n}",WRONG_ANSWER,6,472
1591659635160145920,44e63106384b2202d1a15f2fb61b15315a1f0761b20f40b73c55e6122e10f27d,2022-11-13 13:10:03,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"print(\""60\"")",ACCEPTED,19,2888
1591659652038057984,0ed66ddb50163bbc5dd43c591bc3d500e68ed69fe23bfebfa6ac827c1dfc1849,2022-11-13 13:10:07,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nmain()\n{\n    int n,i,j,count=0;\n    int h[99];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&h[i]);\n    for(i=0;i<n;i++)\n        if(h[i]>h[i+1])\n            for(j=i+1;j<n;j++)\n                if(h[j+1]>h[i+1])\n                {count++;break;}\n            else continue;\n    printf(\""%d\"",count);\n        \n}",WRONG_ANSWER,6,348
1591659659201896448,6a6dc7e644e57bb2c20b20d39bd4d9541bdebf6415e03e7c13707572c054673e,2022-11-13 13:10:09,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{  int m,n,a,b;\n   scanf(\""%d %d %d\"",&n,&a,&b);\n   if(a<=n)\n    m=b+a;\n   else m=n+b;\n    printf(\""%d\"",m);\n\n    return 0;\n}\n\n\n",WRONG_ANSWER,8,348
1591659662347624448,e0a829315cc9947a3e714cd579e3322e8dee5f8ca36e30fd276de5a8e294b6f8,2022-11-13 13:10:09,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main(){\n    int p,q,r,t;\n    scanf(\""%d %d %d\"",&p,&q,&r);\n    t=p;\n    if(t<q)\n        t=q;\n    if(t<r)\n        t=r;\n    printf(\""%d\"",p+q+r-t);\n    return 0;\n}",ACCEPTED,31,476
1591659669758959616,69d2f3a9da1c135d111e69327883b4d96c284e9c1c71370cc330a44458f95ab4,2022-11-13 13:10:11,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n\n    int x,i,j,Q,P,R,a[3]={0};\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n  a[0]=P;a[1]=Q;a[2]=R;\n  for(i=0;i<3;i++)\n  {\n      for(j=0;j<i-1;j++)\n      if(a[j]>a[j+1])\n      {\n         x=a[j];\n         a[j]=a[j+1];\n         a[j+1]=x;\n      }\n  }\n  printf(\""%d\"",a[0]+a[1]);\n    return 0;\n}\n",WRONG_ANSWER,13,348
1591659678613168128,15ac7d06a472ca25d78349f7cc3a73d23c7d7a4f0c4ae3cec6200fcdb8135965,2022-11-13 13:10:13,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,j,a[500],s;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=1;j<n;j++)\n        if(a[j]!=a[j+1]){\n            s++;\n        }\n    printf(\""%d\"",s-1);\n   \n    \n    return 0;\n}\n",WRONG_ANSWER,6,324
1591659680903225344,b69ff333cc0daa10fb20c3ba26e439f64260003a8ff6fde3dbc623fd631ba825,2022-11-13 13:10:14,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint min(int P,int Q,int R)\n{\n    int a,b,c,min;\n    a=P+Q;\n    b=P+R;\n    c=Q+R;\n    if(a>b)\n    {\n        min=b;\n        if(b>c)\n            min=c;\n        else\n            min=b;\n    }\n    else\n    {\n        min=a;\n        if(a>c)\n            min=c;\n        else\n            min=a;\n    }\n    return min;\n}\nint main()\n{\n    int P,Q,R,d;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    d=min(P,Q,R);\n    printf(\""%d\"",d);\n    return 0;\n}\n",ACCEPTED,44,488
1591659683340115968,0ed66ddb50163bbc5dd43c591bc3d500e68ed69fe23bfebfa6ac827c1dfc1849,2022-11-13 13:10:14,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nmain()\n{\n    int n,i,j,count=0;\n    int h[99];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&h[i]);\n    for(i=0;i<n;i++)\n        if(h[i]>h[i+1])\n            for(j=i+1;j<n;j++)\n                if(h[j+1]>h[i+1])\n                {count++;break;}\n            else continue;\n    printf(\""%d\\n\"",count);\n        \n}",WRONG_ANSWER,8,204
1591659697105821696,44e63106384b2202d1a15f2fb61b15315a1f0761b20f40b73c55e6122e10f27d,2022-11-13 13:10:18,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"print(\""60\"")",ACCEPTED,18,2784
1591659726897995776,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-11-13 13:10:25,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\n#define N 100\n\nint main()\n{\n    int n,i,j;\n    int maxbenefit=0;\n    int a[N]={0};\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        int nowbenefit=0;\n        for(j=i+3;j<n;j++)\n        {\n            nowbenefit=nowbenefit+a[j]-5;\n        }\n        if(nowbenefit>=maxbenefit)\n            maxbenefit=nowbenefit;\n    }\n    printf(\""%d\\n\"",maxbenefit);\n    return 0;\n}",SEGMENTATION_FAULT,5,196
1591659728953171968,7935e8f5cb04027f4d30ac84a997e2d03e946e112c1cb17f1a4f943d8b0b54bf,2022-11-13 13:10:25,C++,0.0,1591610585635213314,1591128862958940160,1049226928954454016,"#include <iostream>\n#include<stdio.h>\n#include<algorithm>\n\nusing namespace std;\n\nint main()\n{\n    int n,i;\n    scanf(\""%d\"",&n);\n    int a[n-1];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    sort(a,a+n-1);\n    for(i=n-2;i>0;i--)\n    {\n        printf(\""%d \"",a[i]+a[i-1]);\n    }\n    printf(\""%d \"",a[1]);\n    printf(\""%d\"",a[0]);\n    return 0;\n}\n",WRONG_ANSWER,6,448
1591659742769242112,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-13 13:10:28,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int N=10005;\nint a[N];\nint main(){\n\tint n;\n\tint cnt=0;\n    cin>>n;\n    for(int i=1;i<=n;i++)\n    cin>>a[i];\n    for(int i=3;i<n;i++){\n    \tif(a[i]<a[i-1]&&a[i]<a[i+1])\n    \tcnt++;\n    \tif(a[i]<a[i-1]&&a[i]==a[i+1]&&a[i+1]<a[i+2])\n    \tcnt++;\n    \tif(a[i]<a[i-1]&&a[i]==a[i+1]&&a[i+1]==a[i+2]&&a[i+2]<a[i+3])\n    \tcnt++;\n    \tif(a[i]<a[i-1]&&a[i]==a[i+1]&&a[i+1]==a[i+2]&&a[i+2]==a[i+3]&&a[i+3]<a[i+4])\n    \tcnt++;\n    }\n    cout<<cnt;\n\treturn 0;\n} ,WRONG_ANSWER,36,628
1591659758904729600,0d24b4ee85e6e3a4cc694f7e11105fa2aaf93fd10d4cbe81657f252e2d675435,2022-11-13 13:10:32,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#define N 100\nint sum=0,t1;\nvoid func(int x,int y,int z);\nint main()\n{\n    int n,n1,n2;\n    int a,b;\n\n   // int t1;\n    scanf(\""%d %d %d\"",&n,&n1,&n2);\n    while(n>0){\n        scanf(\""%d %d\"",&a,&b);\n         //if(a==(b-1)){\n         t1= (a+1)/b;\n\n            func(b,n1,n2);\n         //}\n        n--;\n\n    }\n\n  printf(\""%d\"",sum);\n    return 0;\n}\nvoid func(int x,int y,int z){\nint m,n;\nm=t1*pow(y,x);\nn=t1*pow(z,x);\nsum+=(m-n);\n}\n",WRONG_ANSWER,8,368
1591659787706982400,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-11-13 13:10:39,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\n#define N 100\n\nint main()\n{\n    int n,i,j;\n    int maxbenefit=0;\n    int a[N]={0};\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        int nowbenefit=0;\n        for(j=i+3;j<n;j++)\n        {\n            nowbenefit=nowbenefit+a[j]-5;\n        }\n        if(nowbenefit>=maxbenefit)\n            maxbenefit=nowbenefit;\n    }\n    printf(\""%d\"",maxbenefit);\n    return 0;\n}",SEGMENTATION_FAULT,13,352
1591659800436695040,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-13 13:10:42,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n\n\n//O(N)\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"",&n);\n\n    int arr[n];\n    int i = 0;\n    for(i = 0; i < n; ++i){\n        scanf(\""%d\"",&arr[i]);\n    }\n\n    int width = 0;\n    int j = 0;\n    int mul = 1;\n    int max = 0;\n    for(i = 0; i < n; ++i){\n        for(j = i; j < n; ++j){\n            if(arr[i] <= arr[j]){\n                ++width;\n            }\n        }\n        mul = width * arr[i];\n\n        if(mul > max){\n            max = mul;\n        }\n\n        width = 0;\n    }\n\n    printf(\""%d\"",max);\n\n    return 0;\n}",WRONG_ANSWER,20,332
1591659800570912768,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-13 13:10:42,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <math.h>\n#include <stdio.h>\nint main()\n{\n    int a,b,c,min=1000;\n    scanf(\""%d\"",&a);\n    scanf(\""%d\"",&b);\n    scanf(\""%d\"",&c);\n    if(a+b<min) min=a+b;\n    {\n        if(a+c<min) min=a+c;\n        else\n            if(c+b<min) min=c+b;\n    }\n    printf(\""%d\\n\"",min);\n    return 0;\n}",WRONG_ANSWER,5,328
1591659807424405504,6a6dc7e644e57bb2c20b20d39bd4d9541bdebf6415e03e7c13707572c054673e,2022-11-13 13:10:44,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{  short int m,n,a,b;\n   scanf(\""%d %d %d\"",&n,&a,&b);\n   if(a<=n)\n    m=b+a;\n   else m=n+b;\n    printf(\""%d\"",m);\n\n    return 0;\n}\n\n\n",RUNTIME_ERROR,8,196
1591659808972136448,6b02dfcf297d52c2de2e1416b33ee988ff909834c73207b147423a8301e9d174,2022-11-13 13:10:44,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{ int i;  \n int b,c,d;\n \n int a=5;\nscanf(\""%d\"",&b);\nscanf(\""%d\"",&c);\n\nscanf(\""%d\"",&d);\n\n    printf(\""%d\"",a);\n    return 0;\n}",WRONG_ANSWER,8,200
1591659813468430336,44e63106384b2202d1a15f2fb61b15315a1f0761b20f40b73c55e6122e10f27d,2022-11-13 13:10:45,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"print(\""60\"")",ACCEPTED,21,2760
1591659813900398592,b8a7ba8e6c41741e66a8153e5f137c86c8dba9c4dbb2f65f35d7554a5b082d56,2022-11-13 13:10:45,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int a,b,n,s,z,sum=0,e,m,l,r,jum=0,h,i,j,css=0;\n    scanf(\""%d %d %d\\n\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d \\n\"",&s);\n    }\n         for(j=0;j<n;j++)\n    {\n         scanf(\""%d \\n\"",&z);\n                    e=pow(a,z+1);\n      m=s*e/(z+1);\n    sum=sum+m;\n    l=pow(b,z+1);\n      r=s*l/(z+1);\n    jum=jum+r;\n   h=sum-jum;\n    }\n    css+=h;\n    printf(\""%d\"",css-7);\n    return 0;\n}\n",WRONG_ANSWER,7,352
1591659825812234240,6b02dfcf297d52c2de2e1416b33ee988ff909834c73207b147423a8301e9d174,2022-11-13 13:10:48,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{ int i;  \n int b,c,d;\n \n int a=5;\nscanf(\""%d\"",&b);\nscanf(\""%d\"",&c);\n\nscanf(\""%d\"",&d);\n\n    printf(\""%d\"",a);\n    return 0;\n}",WRONG_ANSWER,12,220
1591659828605673472,44e63106384b2202d1a15f2fb61b15315a1f0761b20f40b73c55e6122e10f27d,2022-11-13 13:10:49,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"print(\""60\"")",ACCEPTED,19,2756
1591659839758327808,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-13 13:10:52,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n\n\n\n\n\nint daxiao(int * a,int b)\n{\n    //printf(\""%d@\"",b);\n    int x;\n    if(a[b]==a[b+1]) {b=b+1;\n                     }\n    else return b;\n    daxiao(a,b);\n\n\n}\n\nint main()\n{\n    int n,h[1000],i,j,k;\n    j=0;\n    k=0;\n    scanf(\""%d\"",&n);\nif(n>=3&&n<=10000){\n    for(i=0;i<n;i++)\n    {\n\n        scanf(\""%d\"",&h[i]);\n    }\n    for(i=1;i<n-1;i++)\n    {\n        if(h[i]<h[i+1]&&h[i]<h[i-1]) k++;\n        else if (h[i]==h[i+1]) {i=daxiao(h,i);\n        //printf(\""%d!\"",j);\n        if(h[i]<h[i+1]) k++;\n                }\n\n    }\n    printf(\""%d\\n\"",k);\n}\n\n\n\n\n    return 0;\n}\n",ACCEPTED,31,348
1591659843197624320,44e63106384b2202d1a15f2fb61b15315a1f0761b20f40b73c55e6122e10f27d,2022-11-13 13:10:52,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"print(\""60\"")",ACCEPTED,28,2916
1591659852559343616,44e63106384b2202d1a15f2fb61b15315a1f0761b20f40b73c55e6122e10f27d,2022-11-13 13:10:55,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"print(\""60\"")",ACCEPTED,16,2780
1591659866673131520,6a835d762a87e93baf4142897168374dc31e9da90b86c19ed82f21159b644272,2022-11-13 13:10:58,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int a,b;\n    scanf(\""%d%d\"",&a,&b);\n    if(b=0011)\n        printf(\""4\"")\n    \n}",COMPILE_ERROR,0,0
1591659868329893888,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-13 13:10:58,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n\nint main() {\n\t     int n,zhan,i,j;\n\t\t scanf(\""%d\"",&n); \n\t\t int a[n];\n\t\t for(i=0;i<n;i++)\n\t\t {\n\t\t scanf(\""%d\"",&a[i]);\n\t     }\n\t\tfor(i=0;i<n;i++)\t\n\t\t{\t\n\t\tfor(j=2;j<n;j++)\n\t\t{\n\t\t\tif(a[i]>a[i+1])\n\t\t\t{\n\t\t\tif(a[i+1]<a[i+j])\n\t\t\tzhan++;break;\n\t\t\t}\n\t\t\telse i++;\n\t\t\t\n\t\t}\n\t\t\n\t\t}\n\t\tprintf(\""%d\"",zhan);\t\n\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                   \n",WRONG_ANSWER,9,372
1591659887296569344,69d2f3a9da1c135d111e69327883b4d96c284e9c1c71370cc330a44458f95ab4,2022-11-13 13:11:03,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n\n    int x,i,j,Q,P,R,a[3]={0};\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n  a[0]=P;a[1]=Q;a[2]=R;\n  for(i=0;i<3;i++)\n  {\n      for(j=0;j<i-1;j++)\n      if(a[j]>a[j+1])\n      {\n         x=a[j];\n         a[j]=a[j+1];\n         a[j+1]=x;\n      }\n  }\n  printf(\""%d\"",a[0]+a[1]);\n    return 0;\n}\n",WRONG_ANSWER,17,480
1591659887749554176,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-11-13 13:11:03,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\n#define N 100\n\nint main()\n{\n    int n,i,j;\n    int maxbenefit=0;\n    int a[N]={0};\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        int nowbenefit=0;\n        for(j=i+3;j<n;j++)\n        {\n            nowbenefit=nowbenefit+a[j]-5;\n        }\n        if(nowbenefit>=maxbenefit)\n            maxbenefit=nowbenefit;\n    }\n    printf(\""%d\\n\"",maxbenefit);\n    return 0;\n}",SEGMENTATION_FAULT,9,320
1591659892271013888,73af9d5098be5d450fba728363c8fdbe0f6a5526466daa2f3b74abf1acf75527,2022-11-13 13:11:04,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int P,Q,R;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    int min=(P+Q)<(P+R)?(P+Q):(P+R);\n    min=min<(Q+R)?min:(Q+R);\n    printf(\""%d\"",min);\n    return 0;\n}",ACCEPTED,37,476
1591659894703677440,6a6dc7e644e57bb2c20b20d39bd4d9541bdebf6415e03e7c13707572c054673e,2022-11-13 13:11:05,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{ long int m,n,a,b;\n   scanf(\""%d %d %d\"",&n,&a,&b);\n   if(a<=n)\n    m=b+a;\n   else m=n+b;\n    printf(\""%d\"",m);\n\n    return 0;\n}\n\n\n",WRONG_ANSWER,13,348
1591659906347098112,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-13 13:11:07,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\nint main(){\n    int gd = -5; // 固定减5\n    int count = 0;\n    int num = 0;\n    int len;\n    int j=-1;\n    if(scanf(\""%d\"",&len)){};\n    int arr[len];\n    \n        for(int i=0; i<len; i++){\n            if(scanf(\""%d\"",&arr[i])){};\n        }\n        \n        while(j<len){\n            // 给count赋值 单步最大\n            if(arr[j+1]+gd > arr[j+3]+gd){\n                count = arr[j+1]+gd;\n                j=j+1;\n            }else{\n                count = arr[j+3]+gd;\n                j=j+3\n            }\n            // 总数最大\n            if(count>num){\n                num += count;\n            }\n            \n        }\n    printf(\""%d\"",count);\n}",COMPILE_ERROR,0,0
1591659933417103360,ce1bb8e96385d94dfdb2bd028407e2ffb5a64494440cd7964d6624a83809dae6,2022-11-13 13:11:14,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint min(int P,int Q,int R)\n{\n    int x,y,z,min;\n    x=P+Q;\n    y=P+R;\n    z=Q+R;\n    if(x>y)\n    {\n        min=y;\n        if(y>z)\n            min=z;\n        else\n            min=y;\n    }\n    else\n    {\n        min=x;\n        if(x>z)\n            min=z;\n        else\n            min=x;\n    }\n    return min;\n}\nint main()\n{\n    int P,Q,R,sum;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    sum=min(P,Q,R);\n    printf(\""%d\"",sum);\n    return 0;\n}\n",ACCEPTED,37,352
1591659954866806784,6a835d762a87e93baf4142897168374dc31e9da90b86c19ed82f21159b644272,2022-11-13 13:11:19,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\nmain()\n{\n\n        printf(\""4\"")\n    \n}",COMPILE_ERROR,0,0
1591659962433331200,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-13 13:11:21,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int num;\n    scanf(\""%d\"",&num);\n    int a[num];\n    int i;\n    int count = 0;\n    for(i = 0;i < num;i++) {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i = 2;i<num-2;i++){\n        if((a[i] == a[i+1]) || (a[i] < a[i-1] && a[i] < a[i+1])){\n            count++;\n        }\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",WRONG_ANSWER,7,324
1591659995916427264,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-13 13:11:29,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\nint main(){\n    int gd = -5; // 固定减5\n    int count = 0;\n    int num = 0;\n    int len;\n    int j=-1;\n    if(scanf(\""%d\"",&len)){};\n    int arr[len];\n    \n        for(int i=0; i<len; i++){\n            if(scanf(\""%d\"",&arr[i])){};\n        }\n        \n        while(j<len){\n            // 给count赋值 单步最大\n            if(arr[j+1]+gd > arr[j+3]+gd){\n                count = arr[j+1]+gd;\n                j=j+1;\n            }else{\n                count = arr[j+3]+gd;\n                j=j+3;\n            }\n            // 总数最大\n            if(count>num){\n                num += count;\n            }\n            \n        }\n    printf(\""%d\"",count);\n}",WRONG_ANSWER,7,360
1591659996793036800,29d1ea54d6e4e56fc2de0be5ae10ecc4c70c7fca667934b17857e95530f5663a,2022-11-13 13:11:29,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n   int p,q,r,max,n;\n        scanf(\""%d %d %d\"",&p,&q,&r);\n    max=0;\n    if(p>q)\n    {\n        if(p>r) max=p;\n    }\n    if(q>p)\n    {\n        if(q>r)  max=q;\n    }\n    if(r>p)\n    {\n        if(r>q)  max=r;\n    }\n    n=p+q+r-max;\n    printf(\""%d\"",n);\n    return 0;\n}\n",ACCEPTED,38,460
1591659999880077312,c76414e1d2d8531a5745e9bd3192aafa7cca924e645650ffe7954c992cc13b33,2022-11-13 13:11:30,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\nint n,a,b,i;\nint sum=0;\nscanf(\""%d %d %d\"",&n,&a,&b);\nint a[n];b[n];\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&a[i]);\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&b[i];)\n\nfor(i=0;i<n;i++)\n    {\n    sum=sum+(a[i]/(b[i]+1)*pow(a,b[i]+1))-(a[i]/(b[i]+1)*pow(b,b[i]+1));\n    }\nprintf(\""%d\"",sum);\n}\n",COMPILE_ERROR,0,0
1591660021015175168,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-13 13:11:35,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"int main()\n{\n\tint i,a[3],max,sum=0;\n\tfor(i=0;i<3;i++)\n\t\n\t{\n\t\tscanf(\""%d\"",&a[i]);\n\t\tsum+=a[i];\n\t\t}\n\tmax=a[0];\n    for(i=1;i<3;i++)\n    {\n\t\tif(a[i]>max) max=a[i];\n\t}\n\tprintf(\""%d\"",sum-max);\n\t\n\treturn 0;\n}",ACCEPTED,41,512
1591660043140096000,6b02dfcf297d52c2de2e1416b33ee988ff909834c73207b147423a8301e9d174,2022-11-13 13:11:40,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{ int i;  \n int b,c,d;\n \n int a=5;\nscanf(\""%d\"",&b);\nscanf(\""%d\"",&c);\n\nscanf(\""%d\"",&d);\n\n    printf(\""%d\\n\"",a);\n    return 0;\n}",WRONG_ANSWER,5,332
1591660048605274112,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-11-13 13:11:41,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\n#define N 10000\n\nint main()\n{\n    int n,i,j;\n    int maxbenefit=0;\n    int a[N]={0};\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        int nowbenefit=0;\n        for(j=i+3;j<n;j++)\n        {\n            nowbenefit=nowbenefit+a[j]-5;\n        }\n        if(nowbenefit>=maxbenefit)\n        {\n            maxbenefit=nowbenefit;\n        }\n    }\n    printf(\""%d\\n\"",maxbenefit);\n    return 0;\n}",WRONG_ANSWER,42,336
1591660049356054528,69d2f3a9da1c135d111e69327883b4d96c284e9c1c71370cc330a44458f95ab4,2022-11-13 13:11:42,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n\n    int x,i,j,Q,P,R,a[3]={0};\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n  a[0]=P;a[1]=Q;a[2]=R;\n  for(i=0;i<3;i++)\n  {\n      for(j=0;j<i-1;j++)\n      if(a[j]>a[j+1])\n      {\n         x=a[j];\n         a[j]=a[j+1];\n         a[j+1]=x;\n      }\n  }\n  printf(\""%d\"",a[0]+a[1]);\n    return 0;\n}\n",WRONG_ANSWER,11,196
1591660076107325440,5b382280d947e26011a7c75c34d257662bc13c50f8257bc8cae807604d61430c,2022-11-13 13:11:48,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\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\tint n,i;\n\tint count=0;\n\tint a[100];\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=1;i<n-1;i++){\n\tif(a[i]<a[i-1]||a[i]==a[i-1])\n\tif(a[i]<a[i+1]){\n\t\tcount++;\n\t}\n\t}\n\tprintf(\""%d\"",count);\n\treturn 0;\n}",RUNTIME_ERROR,24,372
1591660088597950464,acfcf65f14b5d3b02c3225372654b4e21f04d33a8bbaeb346e4fb1d85f2ea94f,2022-11-13 13:11:51,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int A,B,C;\n    int A+B=3,B+C=2,A+C=5;\n    int P=3,Q=2,R=5,i;\n    for(i=0;i<1)\n    {\n      scanf(\""%d\"",&A) \n    }\n  \n}",COMPILE_ERROR,0,0
1591660099423494144,13eac09c9e523ec396926840225e626f8fff54ca0e8a92e46e533705daa83ac2,2022-11-13 13:11:53,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,j,a=0,b=1;\n    int i=0;\n    scanf(\""%d\\n\"",&n);\n    scanf(\""%d*n\"",&a,&b);\n    if (i!=i+1)\n       j=n/2*2;\n    else\n        j=0;\n    i++;\n    printf(\""%d\"",j);\n\n    return 0;\n}\n",WRONG_ANSWER,14,496
1591660101847756800,a8a4c649080a65381764d05b09cdced42bbf4a58e2656f96cfc5545fc9d08327,2022-11-13 13:11:54,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{   int P,Q,R;\n    scanf(\""%d%d%d%d\"",&P,&Q,&R);\n    int A,B,C;\n    A=P+Q;\n    B=Q+R;\n    C=R+P;\n    if(A<=B&&A<=C)\n    {\n        printf(\""%d\"",A);\n    }\nelse if(B<=C)\n    {\n        printf(\""%d\"",B);\n    }\nelse\n    {\n\n        printf(\""%d\"",C);\n    }\n    return 0;\n}\n",ACCEPTED,28,472
1591660126262845440,1e783de44f6cf9abb158b108e556a36ef99d9241fc592b40cfd6cb7d1265eb34,2022-11-13 13:12:00,Java,0.0,1591610585639407617,1591132482555211776,1049226928954454016,import java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner s=new Scanner(System.in);\n         int n=s.nextInt();\n        int[] arr=new int[n];\n        for(int i=0;i<arr.length;i++){\n            arr[i]=s.nextInt();\n        }\n        int mj=0;\n       for(int i=0;i<arr.length;i++){\n           if(arr[i]==arr[arr.length-1]){\n               mj=arr[i]*n;\n           }\n           else if(arr[i]<arr[i+1]){\n               mj=arr[i+1]*(n-2);\n           }\n        }\n        System.out.println(mj+1);\n\t}\n}\n,WRONG_ANSWER,107,24820
1591660129207201792,81f258582663b08bc9b4d77bba77afc3b463021ec8fb2262453de07687484cd5,2022-11-13 13:12:01,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"P,Q,R = input().split()\n\n\np = int(P)\nq = int(Q)\nr = int(R)\n\n\na =  p + q\nb = p + r\nc =  r +q\n\n#f= eval(a)\n#h= eval(b)\n#g= eval(c)\nd = min(a,b,c)\nif 0<=p<=10**3 and 0<=q<=10**3 and 0<=r<=10**3:\n  print(d)\n \n ",WRONG_ANSWER,17,2816
1591660145489502208,6a6dc7e644e57bb2c20b20d39bd4d9541bdebf6415e03e7c13707572c054673e,2022-11-13 13:12:04,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{  int m,n,a,b;\n   scanf(\""%d %d %d\"",&n,&a,&b);\n   if(a<=n)\n    m=b+a;\n   else m=n+b;\n    printf(\""%d\"",m);\n\n    return 0;\n}\n\n\n",WRONG_ANSWER,6,324
1591660145942487040,42cfad7191c5e6c0eee156c4369182744d6c5db3bc2a5dc87f9f1be6ee4bbcfe,2022-11-13 13:12:05,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main(){\n    int P,Q,R;\n    int flag=0,sum2,sum3,sum4,sum5,sum6,min;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n\tmin=P+Q;\n\tsum2=R+Q;\n\tsum3=R+P;\n\tsum4=Q+P;\n\tsum5=P+R;\n\tsum6=Q+R;\n\tif(min>sum2) min=sum2;\n\tif(min>sum3) min=sum3;\n \tif(min>sum4) min=sum4;\n \tif(min>sum5) min=sum5;\n \tif(min>sum6) min=sum6;\n \tprintf(\""%d\"",min);\n\treturn 0;\n} ",ACCEPTED,36,512
1591660153118941184,cf76a6e5773cf2f19ddd635fa646c5a6721f6fed8998d22ea1d0910bee8017a2,2022-11-13 13:12:06,C,0.0,1591610585635213314,1591128862958940160,1049226928954454016,"#include<stdio.h>\n#define N 30\nint main()\n{\n    int n,i,j,t;\n    int a[N];\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n-1;i++)\n    {\n       scanf(\""%d\"",&a[i]);\n    }\n     for(i=0;i<n-1;i++)\n     {\n        for(j=0;j<;j++)\n        {\n            if(a[j]<a[j+1])\n          {\n             t=a[j];\n             a[j]=a[j+1];\n             a[j+1]=t;\n           }\n        }\n      }\n     printf(\""%d \"",n);\n    for(i=0;i<n-1;i++)\n        printf(\""%d \"",a[i]);\n}\n",COMPILE_ERROR,0,0
1591660165555040256,001baa7272d47ab2d3a9b57bf7838570ff03ab1cabb738e7b342b652b1e42a83,2022-11-13 13:12:09,C++,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <iostream>\n#include <bits/stdc++.h>\nusing namespace std;\n\n//  ceil()    floor()\n\nlong long amax=-9999999;\n\n\n\n// f 下一次个数  先处理\nvoid tt(int a[],int f,int n,long long sum){\n    if(f==n){\n        if(sum>amax)\n            amax=sum;\n        return;\n    }\n    if(f==(n-1) ){\n        sum-=5;\n        sum+=a[f+1];\n        tt(a,f+1,n,sum);\n        sum=sum-a[f+1]+5;\n    }else if(f==(n-2)){\n        sum-=5;\n        sum+=a[f+1];\n        tt(a,f+1,n,sum);\n        sum=sum-a[f+1]+5;\n    }else{\n        sum-=5;\n        sum+=a[f+1];\n        tt(a,f+1,n,sum);\n        sum=sum-a[f+1]+5;\n\n        sum-=5;\n        sum+=a[f+3];\n        tt(a,f+3,n,sum);\n        sum=sum-a[f+3]+5;\n    }\n}\n\n\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(int i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    n--;\n    long long sum=0;\n\n    tt(a,-1,n,sum);\n    cout<<amax<<endl;\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,400,1092
1591660165693452288,6b02dfcf297d52c2de2e1416b33ee988ff909834c73207b147423a8301e9d174,2022-11-13 13:12:09,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{  \n int b,c,d;\n \n int a=5;\nscanf(\""%d\"",&b);\nscanf(\""%d\"",&c);\n\nscanf(\""%d\"",&d);\n\n    printf(\""%d\\n\"",a);\n    return 0;\n}",WRONG_ANSWER,4,384
1591660176456081408,1019ea4e8e67338c8191b6e52878cb69ca9287130af71af3517596fded2f21e4,2022-11-13 13:12:12,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\nint p,q,r,n,b,c;\nscanf(\""%d%d%d\"",&p,&q,&r);\n\nn=p+q;\nb=q+r;\nc=p+r;\n\n   if(n<b||n<c)\n   printf(\""%d\\n\"",n);\nelse if(b<n||b<c)\n    printf(\""%d\\n\"",b);\nif(c<n||c<b)\n    printf(\""%d\\n\"",b);\n    return 0;\n\n\n}\n",WRONG_ANSWER,4,200
1591660213642780672,ece045c1570c74e6800520e16047010817642535f83b9f2b4524ebdcf9d7925a,2022-11-13 13:12:21,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int i,sum=0;\n    int P,Q;\n    int *p[3];\n    for(i=0;i<3;i++)\n    {\n        scanf(\""%d\"",&p[i]);\n    }\n    int *tmp;\n    if(p[0]>p[1])\n        {\n            tmp=p[0];\n            p[0]=p[1];\n            p[1]=tmp;\n        }\n    if(p[1]>p[2])\n    {\n           tmp=p[1];\n            p[1]=p[2];\n            p[2]=tmp;\n    }\n      P=p[0];\n      Q=p[1];\n    sum=P+Q;\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,19,472
1591660221574164480,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-13 13:12:23,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"l = int(input())\ndata = list(map(int,input().split()))\nyes = 0\ni=1\nwhile i<l-2:\n    h = data[i]\n    if h!=data[i+1]and h!=data[i-1]:\n        yes+=1\n        i=i+2\n    else:\n        i=i+1\n    \nprint(yes)",WRONG_ANSWER,17,2896
1591660240020713472,cf76a6e5773cf2f19ddd635fa646c5a6721f6fed8998d22ea1d0910bee8017a2,2022-11-13 13:12:27,C,0.0,1591610585635213314,1591128862958940160,1049226928954454016,"#include<stdio.h>\n#define N 30\nint main()\n{\n    int n,i,j,t;\n    int a[N];\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n-1;i++)\n    {\n       scanf(\""%d\"",&a[i]);\n    }\n     for(i=0;i<n-1;i++)\n     {\n        for(j=0;j<i;j++)\n        {\n            if(a[j]<a[j+1])\n          {\n             t=a[j];\n             a[j]=a[j+1];\n             a[j+1]=t;\n           }\n        }\n      }\n     printf(\""%d \"",n);\n    for(i=0;i<n-1;i++)\n        printf(\""%d \"",a[i]);\n}\n",SEGMENTATION_FAULT,6,364
1591660264989417472,1f29a576db974352c60cbe8aafdc4e5328b24d800890ab1c712d8c9fa85d72cc,2022-11-13 13:12:33,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint a[n],i;\n\tfor(i=0;i<n;i++)\n\tscanf(\""%d\"",&a[i]);\n\t\n\tint wow=0,moun=0;\n\tfor(i=1;i<n-1;i++)\n\t{\n\t    //if(a[i-1]>a[i]&&a[i]<a[i+1]) wow=wow+1;\n\t\t//if(a[i-2]>a[i-1]&&a[i]<a[i+1]) wow=wow+1;\n\t\tif(a[i-1]<a[i]&&a[i]>a[i+1]) moun=moun+1;\n\t}\n\tprintf(\""%d\"",moun-1);\n\treturn 0;\n } ",WRONG_ANSWER,12,196
1591660302440390656,6ba5ecacf3381a1e9382f99c413290eca40a071a563a618e5f36d66cbf9a5e1b,2022-11-13 13:12:42,C++,0.0,1591610585635213312,1589816514637750272,1049226928954454016,#include<iostream>\n\nusing namespace std;\nint main(){\nint n;\n\nint count=0;\ncin>>n;\n\nchar a[n];\nfor(int i=0;i<n;i++){\n    char x;\n    cin>>x;\n    a[i]=x;\n}\nfor(int i=0;i<n-1-count;i++){\n    if(a[i]!=a[i+1]){\n        for(int j=i;j<n-2-count;j++)\n            a[j]=a[j+2];\n        i=-1;\n        count=count+2;\n    }\n}\ncout<<count<<endl;\n\n\n}\n,TIME_LIMIT_EXCEEDED,426,480
1591660310589878272,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-13 13:12:44,Java,300.0,1591610585639407616,1591132307937943552,1049226928954454016,import java.util.Scanner;\npublic class Main {\n    public static void main(String []args) {\n       int arr[]=new int[10000];\n        int n;\n        int b=0;\n        Scanner scanner=new Scanner(System.in);\n        n=scanner.nextInt();\n        for(int i=0;i<n;i++){\n            arr[i]=scanner.nextInt();\n        }\n        for(int i=1;i<n-1;i++){\n            if(arr[i]<arr[i-1]&&(arr[i]<arr[i+1]))\n               b++; \n            if(arr[i]<arr[i-1]&&(arr[i]==arr[i+1])){\n                for(int j=i;j<n-1;j++){\n                    if(arr[j]>arr[j+1])\n                        break;\n                    else if(arr[j]<arr[j+1])\n                        b++;\n                }\n            }\n        }\n        System.out.println(b);\n        \n       \n    }\n},ACCEPTED,597,26056
1591660312791932928,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-13 13:12:44,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int num;\n    scanf(\""%d\"",&num);\n    int a[num];\n    int i;\n    int count = 0;\n    for(i = 0;i < num;i++) {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i = 2;i<num-2;i++){\n        if((a[i] == a[i+1]) || (a[i] < a[i-1] && a[i] < a[i+1])){\n            count++;\n        }\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",WRONG_ANSWER,5,368
1591660316734545920,ce1bb8e96385d94dfdb2bd028407e2ffb5a64494440cd7964d6624a83809dae6,2022-11-13 13:12:45,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint min(int P,int Q,int R)\n{\n    int x,y,z,min;\n    x=P+Q;\n    y=P+R;\n    z=Q+R;\n    if(x<y)\n    {\n        min=x;\n        if(x<z)\n            min=x;\n        else\n            min=z;\n    }\n    else\n    {\n        min=y;\n        if(y<z)\n            min=y;\n        else\n            min=z;\n    }\n    return min;\n}\nint main()\n{\n    int P,Q,R,sum;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    sum=min(P,Q,R);\n    printf(\""%d\"",sum);\n    return 0;\n}\n\n",ACCEPTED,31,512
1591660320400400384,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-13 13:12:46,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\nint b[100];\nint a,i,sum;\n    sum=0;\nscanf(\""%d\"",&a);\nfor(i=0;i<a;i++)\n{\n    scanf(\""%d\"",&b[i]);\n    if(b[i]>5)\n    sum+=b[i]-5;\n    else\n        sum=sum;\n}\n    sum-=b[3];\n    printf(\""%d\\n\"",sum);\n    return 0;\n    \n}\n",SEGMENTATION_FAULT,6,196
1591660329552338944,9aa17e95021225dcdd2b01419b021cd002e47f9a7854274df042f64621bd207a,2022-11-13 13:12:48,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R,i,j,k,n,a[3];\n    scanf(\""%d,%d,%d\"",&P,&Q,&R);\n    a[0]=P;\n    a[1]=Q;\n    a[2]=R;\n    for(i=0;i<3;i++)\n    for(j=0;j<3-i;j++)\n    {\n        if(a[j]>a[j+1])\n        {\n         k=a[j];\n         a[j]=a[j+1];\n         a[j+1]=k;\n        }\n    }\n\n    printf(\""%d\"",a[0]+a[1]);\n    return 0;\n}\n",SEGMENTATION_FAULT,25,9564
1591660330466684928,40c43472973ea298adbdd1d4b900aeb63cfa4cfe17179f01a4827cd2c6624d3a,2022-11-13 13:12:49,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nmain()\n{\n    int n,a,b;\n    int c[20],f[20];\n    int i,j;\n    int sum0=0,sum1=0,sum2=0,sum3=0,sumz=0;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&c[i]);\n    }\n    for(j=0;j<n;j++)\n    {\n        scanf(\""%d\"",&f[j]);\n    }\n    for(i=0;i<n;i++)\n    {\n        for(j=0;j<n-1;j++)\n        {\n           sum1=(c[i]/(f[i]+1))*pow(a,f[i]+1);\n           sum0+=sum1;\n           sum3=(c[i]/(f[i]+1))*pow(b,f[i]+1);\n           sum2+=sum3;\n        }\n    }\n    sumz=sum0-sum2;\n    printf(\""%d\"",sumz);\n}",WRONG_ANSWER,5,356
1591660332211560448,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-13 13:12:49,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int N=10005;\nint a[N];\nint main(){\n\tint n;\n\tint cnt=0;\n    cin>>n;\n    for(int i=1;i<=n;i++)\n    cin>>a[i];\n    for(int i=3;i<n;i++){\n    \tif(a[i]<a[i-1]&&a[i]<a[i+1])\n    \tcnt++;\n    \tif(a[i]<a[i-1]&&a[i]==a[i+1]&&a[i+1]<a[i+2])\n    \tcnt++;\n    \tif(a[i]<a[i-1]&&a[i]==a[i+1]&&a[i+1]==a[i+2]&&a[i+2]<a[i+3])\n    \tcnt++;\n    \tif(a[i]<a[i-1]&&a[i]==a[i+1]&&a[i+1]==a[i+2]&&a[i+2]==a[i+3]&&a[i+3]<a[i+4])\n    \tcnt++;\n        if(a[i]<a[i-1]&&a[i]==a[i+1]&&a[i+1]==a[i+2]&&a[i+2]==a[i+3]&&a[i+3]==a[i+4]&&a[i+4]<a[i+5])\n    \tcnt++;\n    }\n    cout<<cnt;\n\treturn 0;\n} ,WRONG_ANSWER,31,712
1591660334036037632,9d0546dac18a9dc678295254e547925db086add5f872ef42d8015d525afeaf65,2022-11-13 13:12:49,C,0.0,1591610585635213314,1591128862958940160,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 6\nint main()\n{\n    int num[N],i,j,n,k,temp;\n    scanf(\""%d\"",&k);\n    n=k-1;\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&num[i]);\n    }\n    printf(\""%d \"",k);\n    for(i=1;i<n;i++){\n        for(j=0;j<n-i;j++){\n            if(num[j]<num[j+1]){\n                temp=num[j];\n                num[j]=num[j+1];\n                num[j+1]=temp;\n            }\n        }\n    }\n    for(i=0;i<n-1;i++){\n        printf(\""%d \"",num[i]);\n    }\n    for(i=n-1;i<n;i++){\n        printf(\""%d\"",num[i]);\n    }\n    return 0;\n}\n",SEGMENTATION_FAULT,5,328
1591660355997425664,6b02dfcf297d52c2de2e1416b33ee988ff909834c73207b147423a8301e9d174,2022-11-13 13:12:55,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{  \n int b,c,d,e;\n \n int a=5;\nscanf(\""%d\"",&b);\nscanf(\""%d\"",&c);\n\nscanf(\""%d\"",&e);\n\n    printf(\""%d\\n\"",a);\n    return 0;\n}",WRONG_ANSWER,6,512
1591660358660808704,6a6dc7e644e57bb2c20b20d39bd4d9541bdebf6415e03e7c13707572c054673e,2022-11-13 13:12:55,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{  int m,n,a,b;\n   scanf(\""%d %d %d\"",&n,&a,&b);\n   if(a<n)\n    m=b+a;\n   else m=n+b;\n    printf(\""%d\"",m);\n    return 0;\n}\n\n\n",WRONG_ANSWER,5,328
1591660361638764544,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-13 13:12:56,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int num;\n    scanf(\""%d\"",&num);\n    int a[num];\n    int i;\n    int count = 0;\n    for(i = 0;i < num;i++) {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i = 1;i<num-1;i++){\n        if((a[i] == a[i+1]) || (a[i] < a[i-1] && a[i] < a[i+1])){\n            count++;\n        }\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",WRONG_ANSWER,4,332
1591660364629291008,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-13 13:12:57,Python,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"n = eval(input())\na = [0]*n\nx = 0\nnum = 1\nlist = map(int,input().split())\nfor i in list:\n    a[x] = i\n    x=x+1\nfor j in range(1,n-1):\n    if (a[j] < a[j-1] and a[j]<a[j+1]) or (a[j] < a[j-1] and a[j]==a[j+1]) :\n        num = num+1\nprint(num-1)\n\n    \n\n",ACCEPTED,88,2888
1591660373684838400,c76414e1d2d8531a5745e9bd3192aafa7cca924e645650ffe7954c992cc13b33,2022-11-13 13:12:59,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\nint n,a,b,i;\nint sum=0;\nscanf(\""%d %d %d\"",&n,&a,&b);\nint a[n];b[n];\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&a[i]);\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&b[i]);\n\nfor(i=0;i<n;i++)\n    {\n    sum=sum+(a[i]/(b[i]+1)*pow(a,b[i]+1))-(a[i]/(b[i]+1)*pow(b,b[i]+1));\n    }\nprintf(\""%d\"",sum);\n}\n",COMPILE_ERROR,0,0
1591660380756389888,acf80eea856463058b81f71c0238069795893092293fbd098cc594959df6444e,2022-11-13 13:13:01,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,a=[]\nb=0\nc=0\na=input().split()\nfor i in range(3):\n    c+=int(a[i])\nb=max(a)\nc=c-int(b)\nprint(c)\n,WRONG_ANSWER,15,2888
1591660396526985216,15ac7d06a472ca25d78349f7cc3a73d23c7d7a4f0c4ae3cec6200fcdb8135965,2022-11-13 13:13:04,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,j,a[500],s;\n    s=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=1;j<n;j++)\n        if(a[j]!=a[j+1]){\n            s=s+1;\n        }\n    printf(\""%d\"",s-1);\n\n\n    return 0;\n}\n",WRONG_ANSWER,5,200
1591660413727858688,20eba57d0ae5a9e589a2b203a4648cce520c99291e8744872f7a5a5911e19e34,2022-11-13 13:13:08,Java,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"import java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\t\n\t\tint a=scanner.nextInt();\n\t\tint b=scanner.nextInt();\n\t\tint c=scanner.nextInt();\n        if ((a+b)<=(b+c)&&(a+b)<=(a+c)) {\n        \tSystem.out.print(a+b+\""\\n\"");\n            //System.out.print(\""从A到B花费\""+a+\""块钱，从B到C花费\""+b+\""块钱，此时所有地点都去过了，总花费为\""+(a+b)+\""块钱\\n\"");\n            \n        }\n        else if((b+c)<=(a+b)&&(b+c)<=(a+c)) {\n        \tSystem.out.print(b+c+\""\\n\"");\n           // System.out.print(\""从B到C花费\""+b+\""块钱，从C到A花费\""+c+\""块钱，此时所有地点都去过了，总花费为\""+(b+c)+\""块钱\\n\"");\n\n        }\n        else if((a+c)<=(a+b)&&(a+c)<=(b+c)) {\n        \tSystem.out.print(a+c+\""\\n\"");\n            //System.out.print(\""从C到A花费\""+c+\""块钱，从A到B花费\""+a+\""块钱，此时所有地点都去过了，总花费为\""+(a+c)+\""块钱\\n\"");\n\n        }\n\t}\n}",ACCEPTED,669,26956
1591660416160522240,c76414e1d2d8531a5745e9bd3192aafa7cca924e645650ffe7954c992cc13b33,2022-11-13 13:13:09,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\nint n,a,b,i;\nint sum=0;\nscanf(\""%d %d %d\"",&n,&a,&b);\nint s1[n],s2[n];\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&s1[i]);\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&s2[i]);\n\nfor(i=0;i<n;i++)\n    {\n    sum=sum+(s1[i]/(s2[i]+1)*pow(a,s2[i]+1))-(s1[i]/(s2[i]+1)*pow(b,s2[i]+1));\n    }\nprintf(\""%d\"",sum);\n}\n",WRONG_ANSWER,10,192
1591660422883991552,6a6dc7e644e57bb2c20b20d39bd4d9541bdebf6415e03e7c13707572c054673e,2022-11-13 13:13:11,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{  int m,n,a,b;\n   scanf(\""%d%d%d\"",&n,&a,&b);\n   if(a<n)\n    m=b+a;\n   else m=n+b;\n    printf(\""%d\"",m);\n    return 0;\n}\n\n\n",WRONG_ANSWER,6,200
1591660439782830080,547094c7c62f34b25dac6d7d79e017d817767a29a120ff5083d5fe0c21b62800,2022-11-13 13:13:15,Python,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"a=eval(input())\ns=input().split(\"" \"")\nsum=0\nfor i in range(1,a-1):\n    if s[i]<s[i-1]:\n        while(s[i]==s[i+1]):\n                i=i+1\n        if s[i]<s[i+1]:\n            sum+=1\nprint(sum)\n",ACCEPTED,85,2896
1591660451103301632,69d2f3a9da1c135d111e69327883b4d96c284e9c1c71370cc330a44458f95ab4,2022-11-13 13:13:17,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n\n    int x,i,j,Q,P,R,a[3]={0};\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n  a[0]=P;a[1]=Q;a[2]=R;\n  for(i=0;i<3;i++)\n  {\n      for(j=0;j<i-1;j++)\n      if(a[j]>a[j+1])\n      {\n         x=a[j];\n         a[j]=a[j+1];\n         a[j+1]=x;\n      }\n  }\n  printf(\""%d\"",a[0]+a[1]);\n    return 0;\n}\n",WRONG_ANSWER,20,196
1591660485483966464,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-13 13:13:26,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#define MAXSIZE 10000\nint main(){\n    int n,s[MAXSIZE];\n    scanf(\""%d\"",&n);\n    int sum=0;\n       for(int i=0;i<n;i++)\n        scanf(\""%d\"",&s[i]); \n       for(int i=1;i<n-1;i++)\n           if(s[i]>s[i+1])\n               sum++;\n    sum=sum-1;\n    if(sum<0)\n        printf(\""0\"");\n     else\n     {printf(\""%d\"",sum);}\n    printf(\""\\n\"");\n    return 0;\n}",WRONG_ANSWER,6,348
1591660487614685184,e715137eeb4190ade2330123b989bbdd6eebd9a5e1df2e292271d3bfe3a79c69,2022-11-13 13:13:26,C,0.0,1591610585635213314,1591128862958940160,1049226928954454016,"#include<stdio.h>\na[10000][2]={0};\nint main()\n{\n    int i,j,k=0,n,m;\n    scanf(\""%d\"",&n);\n    scanf(\""%d\"",&j);\n    a[k][0]=1;\n    a[k][1]=1;\n    for(i=0;i<n-1;i++)\n    {\n        scanf(\""%d\"",&m);\n        if(m>j)\n        {\n            \n            a[k][0]++;\n            a[k][1]++;\n            \n        }\n        else\n        {\n            k++;\n            a[k][0]++;\n            a[k][1]++;\n        }\n        j=m;\n    }\n    printf(\""%d \"",n);\n    for(i=0;i<k;i++)\n    {\n        while(a[i][0]>0)\n        {\n            printf(\""%d \"",a[i][0]);\n            a[i][0]--;\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,9,500
1591660493960654848,667c2e97e82c372f60661d46943ff56a17c9350387f4364ebabe70ac2e232862,2022-11-13 13:13:28,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int x,y,z,n;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    if(x>=y&&x>=z)\n    {\n        n=y+z;\n    }\n    else if(y>=x&&y>=z)\n    {\n        n=x+z;\n    }\n    else if(z>=x&&z>=y)\n    {\n        n=x+y;\n    }\n    printf(\""%d\\n\"",n);\n    return 0;\n}",ACCEPTED,28,504
1591660517125808128,e7e6ce2c6e9e530eaf2b9b9968748a0e44e3ac7183d73deb51851946350bfbb0,2022-11-13 13:13:33,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    char a[10];\n    int n;\n    int r;      //循环变量;\n    int flag=0;\n    int i,k,l,j;\n    scanf(\""%d\"",&n); //n代表字符串长度\n\n    for(i=0;i<=n;i++)\n    {\n        scanf(\""%c\"",&a[i]);\n    }\n\n\n    i=0;j=1;\n    k=a[i];\n    l=a[j];\n\n   for(r=0;r<2;r++) {\n\n\n        if(k==l) {\n            i=j;\n            j++;\n        }\n        else\n        {\n            flag=flag+2;\n            i--;\n            j++;\n        }\n\n    }\n\n    printf(\""%d\"",flag);\n    return 0;\n}",RUNTIME_ERROR,5,200
1591660549065420800,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-13 13:13:41,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\nint b[100];\nint a,i,sum;\n    sum=0;\nscanf(\""%d\"",&a);\nfor(i=0;i<a;i++)\n{\n    scanf(\""%d\"",&b[i]);\n    if(b[i]>5)\n    sum+=b[i]-5;\n    else\n        sum=sum;\n}\n    sum+=b[3]-5;\n    printf(\""%d\\n\"",sum);\n    return 0;\n    \n}\n",SEGMENTATION_FAULT,8,204
1591660564525637632,e7f8e9ba366feb4551b7dc8e6a149f796e822980a43de4fcc91ded552c4bcbd4,2022-11-13 13:13:44,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main(int argc, char *argv[]) {\n\tint P,Q,R,F,G,H,c=0; \n\tscanf(\""%d%d%d\"",&P,&Q,&R);\n\tF=P+Q; \n\tG=Q+R; \n\tH=R+P;\n\tif(F<G<H&&F<H<G) \n\t  c=F; \n\t  \n\telse if(G<F<H&&G<H<F) \n\t  c=G;\n\t  \n\telse if(H<G<F&&H<F<G) \n\t  c=H;\n\t  \n\tprintf(\""%d\"",c);\n\treturn 0;\n\t\n}\n\n",WRONG_ANSWER,17,480
1591660570028564480,0b693affc66d8d407ff008bd1aaf4f2feb4a615f057943ba4b4ba3163d937dc6,2022-11-13 13:13:46,Java,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"import java.io.*;\nimport java.util.*;\n\npublic class Main {\n\n    public static void main(String[] args) throws IOException {\n        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n        Scanner sc=new Scanner(System.in);\n        String[] s=br.readLine().split(\"" \"");\n        int a=Integer.parseInt(s[0]);\n        int b=Integer.parseInt(s[1]);\n        int c=Integer.parseInt(s[2]);\n        int res1=a+b;\n        int res2=a+c;\n        int res3=b+c;\n        System.out.println(Math.min(res1,Math.min(res2,res3)));\n    }\n}",ACCEPTED,524,24768
1591660588617707520,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-13 13:13:50,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#define MAXSIZE 10000\nint main(){\n    int n,s[MAXSIZE];\n    scanf(\""%d\"",&n);\n    int sum=0;\n       for(int i=0;i<n;i++)\n        scanf(\""%d\"",&s[i]); \n       for(int i=1;i<n-1;i++)\n           if(s[i]>s[i+1])\n               sum++;\n    sum=sum-1;\n    if(sum<0)\n        printf(\""0\"");\n     else\n     {printf(\""%d\"",sum);}\n    printf(\""\\n\"");\n    return 0;\n}",WRONG_ANSWER,16,304
1591660590698094592,06b00897262b024d9e66dcd771cf81de9b63954f7a4554699d17c2158114c0d1,2022-11-13 13:13:51,Java,0.0,1591610585639407616,1591132307937943552,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner scan=new Scanner(System.in);\n\t\tint n=scan.nextInt();\n\t\tint arr[]=new int[n];\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tarr[i]=scan.nextInt();\n\t\t}\n\t\tfor(int i=1;i<n;i++) {\n\t\t\tif(arr[i]==arr[i-1]) {\n\t\t\t\tfor(int j=i;j<n;j++) {\n\t\t\t\t\tarr[j]=arr[j+1];\n\t\t\t\t\tarr[n-1]=0;\n\t\t\t\t\tn=n-1;\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint x=0;\n\t\tfor(int j=1;j<n-1;j++){\n\t\t\tif(arr[j]<arr[j-1]&&arr[j]<arr[j+1]) {\n\t\t\tx++;\t\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(x);\n\t\tscan.close();\n\t}\n\n},WRONG_ANSWER,463,25176
1591660591658590208,8f29029dc8006da83949d2656cc7dc83026d851252066fd4a9fc89071673ec96,2022-11-13 13:13:51,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,t=0;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n+1;i++)\n    {\n        if(a[i+1]-a[i]>1)\n            t++;\n        else if(a[i+1]-a[i]==1)\n        {\n            if(a[i+1]-a[i-1]>=1&&(a[i]!=a[i-1]))\n                t++;\n        }\n    }\n    printf(\""%d\"",t);\n    return 0;\n}",WRONG_ANSWER,8,196
1591660592388399104,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-13 13:13:51,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R,a;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    if(P+Q<P+R||P+Q<Q+R)\n    printf(\""%d\"",P+Q);\n    else if(Q+R<P+R||Q+R<P+Q)\n    printf(\""%d\"",Q+R);\n    else\n    printf(\""%d\"",P+R);\n    return 0;\n}\n",WRONG_ANSWER,22,352
1591660598109429760,1019ea4e8e67338c8191b6e52878cb69ca9287130af71af3517596fded2f21e4,2022-11-13 13:13:52,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\nint p,q,r,n,b,c;\nscanf(\""%d%d%d\"",&p,&q,&r);\n\nn=p+q;\nb=q+r;\nc=p+r;\n\n   if(n<b||n<c)\n   printf(\""%d\\n\"",n);\nelse if(b<n||b<c)\n    printf(\""%d\\n\"",b);\nelse if(c<n||c<b)\n    printf(\""%d\\n\"",b);\n    return 0;\n\n\n}\n",WRONG_ANSWER,14,512
1591660599111856128,e0156cb930d51b3d5482d43809e7b2c1f54a6b8623fccfa3202e2e53ddf1ffbf,2022-11-13 13:13:53,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\nint a,b,c,sum;\nscanf(\""%d%d%d\"",&a,&b,&c,sum);\nsum=a+b&&a+c&&b+c;\nif(a+b<a+c<b+c);\nprintf(\""%d\\n\"",sum=a+b);\n while(a+c<a+b<b+c);\n printf(\""%d\\n\"",sum=a+c);\n  while(b+c<a+b<a+c);\n  printf(\""%d\\n\"",sum=b+c);\n    return 0;\n\n}\n",TIME_LIMIT_EXCEEDED,400,196
1591660599137021952,361d4ab0fa1284b9bf8a3ba65da408861b894c5c0617b83f77f2c1d9a1a3ec92,2022-11-13 13:13:53,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"p,q,r=input().split()\nx=int(p)+int(q)\ny=int(q)+int(r)\nz=int(r)+int(p)\nif x<y:\n    if y<z:\n        print(x)\n    else:\n        print(y)\nif y<z:\n    \n    print(y)\nelse:\n    print(z)\nif z<x:\n    if x<y:\n        print(z)\n    else:\n        print(x)#\n        \n        \n\n",WRONG_ANSWER,19,2916
1591660622952292352,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-13 13:13:58,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,e;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n    if(a[i]<=a[i+1])\n    e++;\n    printf(\""%d\"",e);\n    return 0;\n}",COMPILE_ERROR,0,0
1591660625997389824,7ecf54bf0ea2db8ab0397aa941f19ec79a351bc3e86e8c01673aa09a69b3a6db,2022-11-13 13:13:59,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n\tint n,sum=0;\n\tscanf(\""%d\"",&n);\n\tint s[n];\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&s[i]);\n\t}\n\tfor(int i=1;i<n-2;i++)\n\t{\n\t\tif(s[i]>s[i+1])sum++;\n\t}\n\tprintf(\""%d\\n\"",sum);\n}\n\n",WRONG_ANSWER,9,196
1591660636353093632,69d2f3a9da1c135d111e69327883b4d96c284e9c1c71370cc330a44458f95ab4,2022-11-13 13:14:01,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n\n    int x,i,j,Q,P,R,a[3]={0};\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n  a[0]=P;a[1]=Q;a[2]=R;\n  for(i=0;i<3;i++)\n  {\n      for(j=0;j<i-1;j++)\n      {\n          \n      \n      if(a[j]>a[j+1])\n      {\n         x=a[j];\n         a[j]=a[j+1];\n         a[j+1]=x;\n      }\n        }\n  }\n  printf(\""%d\"",a[0]+a[1]);\n    return 0;\n}",WRONG_ANSWER,16,320
1591660643894439936,6a6dc7e644e57bb2c20b20d39bd4d9541bdebf6415e03e7c13707572c054673e,2022-11-13 13:14:03,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{  int m,n,a,b;\n   scanf(\"" %d %d %d\"",&n,&a,&b);\n   if(a<n)\n    m=b+a;\n   else m=n+b;\n    printf(\""%d\"",m);\n    return 0;\n}\n\n\n",WRONG_ANSWER,5,368
1591660649204428800,2ccc7507304cfd28125f6d85cdb4df769a41aec4f125254d0d2415ba16cb27c2,2022-11-13 13:14:05,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int x,y,z,temp;\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    temp=x+y;\n    if(y+z<temp)\n        temp=y+z;\n    else if(x+z<temp)\n        temp=x+z;\n    printf(\""%d\"",temp);\n    return 0;\n}\n",ACCEPTED,37,476
1591660660826845184,0c2907a154c1c61744366e94f73ae426665222ffae8eff7042dd0fd7bd8760fb,2022-11-13 13:14:07,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{int p,q,r,i,j,t;\n    scanf(\""%d %d %d\"",&p,&q,&r);\n    int a[3]={p,q,r};\nfor(i=0;i<3-1;i++)\n    for(j=0;j<3-i-1;j++)\n        if(a[j]>a[j+1])\n{  t=a[j];\n   a[j]=a[j+1];\n   a[j+1]=t;\n }\n    printf(\""%d \"",a[0]+a[1]);\n\n    return 0;\n}\n",ACCEPTED,32,476
1591660675930578944,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-13 13:14:11,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\nint b[100];\nint a,i,sum;\n    sum=0;\nscanf(\""%d\"",&a);\nfor(i=0;i<a;i++)\n{\n    scanf(\""%d\"",&b[i]);\n    if(b[i]>5)\n    sum+=b[i]-5;\n    else\n        sum=sum;\n}\n    sum+=b[2]-5;\n    printf(\""%d\\n\"",sum);\n    return 0;\n    \n}\n",SEGMENTATION_FAULT,8,220
1591660710508376064,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-13 13:14:19,Python,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"n = eval(input())\na = [0]*n\nx = 0\nnum = 0\nlist = map(int,input().split())\nfor i in list:\n    a[x] = i\n    x=x+1\nfor j in range(1,n-1):\n    if (a[j] < a[j-1] and a[j]<a[j+1]) or (a[j] < a[j-1] and a[j]==a[j+1]) :\n        num = num+1\nprint(num)\n\n    \n\n",ACCEPTED,91,2908
1591660726291554304,c358160a3e618a44cd693944fe10043e6372f46bf7d517c3c3f583bd85b17c5e,2022-11-13 13:14:23,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,n=input()\nm=int(n[0])\ny=int(n[2])\nprint(int(m+y))\n,WRONG_ANSWER,18,2820
1591660743366598656,27fbb32d960dbf49665c8905b68012d602eda68987686c6f224ec7b49ca3d0ac,2022-11-13 13:14:27,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint n,i,flog=0;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=1;i<n-1;i++)\n\t{\n\t\tif(a[i]<a[i-1]&&a[i]<a[i+1])\n\t\t{\n\t\t  flog++;\n\t\t}\n\t\tif(a[i]<a[i-1]&&a[i]==a[i+1])\n\t\t{\n\t\t\tfor(int j=i+1;j<n-1;j++)\n\t\t\t{\n\t\t\t\tif(a[j]>a[i+1])\n\t\t\t\t{\n\t\t\t\t\n\t\t\t\tflog++;\n\t\t\t\tbreak;\n\t\t    \t}\n\t\t\t\t\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\""%d\\n\"",flog);\n\treturn 0;\n} ",ACCEPTED,44,512
1591660757174247424,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-13 13:14:30,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,e,i;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n    if(a[i]<=a[i+1])\n    e++;\n    printf(\""%d\"",e);\n    return 0;\n}",WRONG_ANSWER,7,324
1591660780553252864,1f29a576db974352c60cbe8aafdc4e5328b24d800890ab1c712d8c9fa85d72cc,2022-11-13 13:14:36,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint a[n],i;\n\tfor(i=0;i<n;i++)\n\tscanf(\""%d\"",&a[i]);\n\t\n\tint wow=0,moun=0;\n\tfor(i=1;i<n-1;i++)\n\t{\n\t    //if(a[i-1]>a[i]&&a[i]<a[i+1]) wow=wow+1;\n\t\t//if(a[i-2]>a[i-1]&&a[i]<a[i+1]) wow=wow+1;\n\t\tif(a[i-1]<a[i]&&a[i]>a[i+1]) moun=moun+1;\n\t\tif(a[i-2]<a[i-1]&&a[i]>a[i+1]) moun=moun+1;\n\t}\n\tprintf(\""%d\"",moun-1);\n\treturn 0;\n } ",WRONG_ANSWER,6,344
1591660791416500224,1c76961e293959cbfa749568290c58d912c131cbc4a710b8bd9a4e58eccf0b8e,2022-11-13 13:14:38,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i;\n   scanf(\""%d\"",&n);\n     int a[n];\n    for(i=0;i<=n-1;i++)\n        scanf(\""%d\"",&a[i]);\n     int b;\n    b=0;\n    int j;\n    for(i=1;i<n-2;i++)\n    {\n        for(j=i+1;j<n-2;j++)\n        if(a[i]<a[i-1]&&a[j]>a[i])\n        {\n            b++;\n        }\n    }\n    printf(\""%d\"",b-1);\n    return 0;\n}\n",WRONG_ANSWER,10,352
1591660804582465536,e715137eeb4190ade2330123b989bbdd6eebd9a5e1df2e292271d3bfe3a79c69,2022-11-13 13:14:42,C,0.0,1591610585635213314,1591128862958940160,1049226928954454016,"#include<stdio.h>\na[10000][2]={0};\nint main()\n{\n    int i,j,k=0,n,m;\n    scanf(\""%d\"",&n);\n    scanf(\""%d\"",&j);\n    a[k][0]=1;\n    a[k][1]=1;\n    for(i=0;i<n-1;i++)\n    {\n        scanf(\""%d\"",&m);\n        if(m>j)\n        {\n            \n            a[k][0]++;\n            a[k][1]++;\n            \n        }\n        else\n        {\n            k++;\n            a[k][0]++;\n            a[k][1]++;\n        }\n        j=m;\n    }\n    printf(\""%d \"",n);\n    for(i=0;i<k;i++)\n    {\n        while(a[i][0]>0)\n        {\n            printf(i+1==k?\""%d\\n\"":\""%d \"",a[i][0]);\n            a[i][0]--;\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,5,204
1591660815756046336,65ac58572a882f9de09782bce337ee95c6ab91ac6b377f6d29c3ee19b1a17f1a,2022-11-13 13:14:44,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a,i,arr[100];\n    int count=0;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++){\n        scanf(\""%d\"",&arr[i]);\n    }\n    for(i=0;i<a;i++){\n        if(arr[i]<arr[i-1] && arr[i]<arr[i+1] || arr[i-1]==arr[i])\n        {   \n            count++;\n        }\n    }\n    printf(\""%d\"",count-1);\n    return 0;\n}\n// && arr[i]<arr[i+1] && arr[i]<arr[i-2]",WRONG_ANSWER,4,324
1591660838245904384,617f184ce583e9f7a346564ab5659fda0ca35a3a714a0c929cb07f915f4f514b,2022-11-13 13:14:50,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    if(P,Q,P>=1&&P,Q,R<=1000)\n    {\n        if(P+Q>=P+R)\n    {\n        printf(\""%d\"",P+R);\n    }\n    else if(P+Q>=Q+R)\n    {\n        printf(\""%d\"",Q+R);\n    }\n    else if(P+R>=Q+R)\n    {\n        printf(\""%d\"",Q+R);\n    }\n    else\n        printf(\""%d\"",P+Q);\n    }\n    return 0;\n}",WRONG_ANSWER,4,364
1591660856881242112,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 13:14:54,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <string.h>\nint main()\n{\n    double k,len,i,g,l;\n    char str[10] = {0};\n    if(scanf(\""%d\"",&k)==1)\n    if(scanf(\""%s\"",str))\n    len  = strlen(str);\n    for(i=0;i<len;i++)\n    {\n        if(str[i]=='0')\n        g++;\n        else\n        l++;\n    }\n    g-=8;//0的个数;\n    l-=52;//1的个数;\n    if(g>l)\n    printf(\""4\\n\"");\n    else\n    printf(\""4\\n\"");\n    return 0;\n}\n",COMPILE_ERROR,0,0
1591660878184067072,cf76a6e5773cf2f19ddd635fa646c5a6721f6fed8998d22ea1d0910bee8017a2,2022-11-13 13:14:59,C,0.0,1591610585635213314,1591128862958940160,1049226928954454016,"#include<stdio.h>\n#define N 30\nint main()\n{\n    int n,i,j,t;\n    int a[N];\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n-1;i++)\n    {\n       scanf(\""%d\"",&a[i]);\n    }\n     for(i=0;i<n-1;i++)\n     {\n        for(j=0;j<3;j++)\n        {\n            if(a[j]<a[j+1])\n          {\n             t=a[j];\n             a[j]=a[j+1];\n             a[j+1]=t;\n           }\n        }\n      }\n     printf(\""%d \"",n);\n    for(i=0;i<n-1;i++)\n        printf(\""%d \"",a[i]);\n}\n",SEGMENTATION_FAULT,12,200
1591660900531331072,13616e85f216dd3844293b46f4b46105a0a2c458f7807a7b677858feb35cb63a,2022-11-13 13:15:04,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,i,j,sum=0;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if(a[i]!=a[i+1])\n        {\n             n=n-2;\n            sum=sum+2;\n            for(j=i;j<n;j++)\n            {\n            a[j]=a[j+2];\n            }\n            i--;\n        }\n       \n    }\n    printf(\""%d\"",sum);\n    printf(\""\\n\"");\n    return 0;\n}",WRONG_ANSWER,6,200
1591660910132080640,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-13 13:15:07,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{ \n    int i,n;\n    int a[100];\n    int sum=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if(a[i]>a[i-1]&&a[i]>a{i+1})\n            sum++;\n    }\n    printf(\""%d\"",sum-1);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1591660923180605440,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 13:15:10,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[n],sum=0,i,b=0;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i=b)\n    {\n        if(a[i]>a[i+2])\n        {\n            sum=sum+a[i]-5;\n            b=b+1;\n        }\n        else if(a[i]=a[i+2])\n        {\n            for(i=0;i<n;i=b)\n            {\n                if(a[i+1]>a[i+i+3])\n                    sum=sum+a[i]-5;b=b+1;\n                else sum=sum+a[i+2]-5;b=b+3;\n            }\n        }\n        else \n        {\n            sum=sum+a[i+2]-5;\n            b=b+3;\n        }\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",COMPILE_ERROR,0,0
1591660925336432640,950b2713b447943280c6052f88160e7298bd0ba94c14d628bbdd70df720305b5,2022-11-13 13:15:10,Python,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"money= list(map(int,input().split()))\nmoney.sort()\ndata= money[0]+money[1]\nprint(data)",ACCEPTED,83,2920
1591660929094541312,675867a135da6702ed27c0eec3e4b6d2a7d95c44854c01823fc152f0689f010d,2022-11-13 13:15:11,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#define MAX 50\nint main(void)\n{\n\tint n, a[MAX];\n\tint i, m;\n\tint max1, max2, temp;\n\tmax1=-10;\n\tmax2=-10;\n\ttemp=0;\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++)\n\t\tscanf(\""%d\"",&a[i]);\n\t\n\tfor(m=1;m<=3;m+=2)\n\t{\n\t\tif(m==1){\n\t\t\tfor(i=0;i<n;i++)\n\t\t\t{\n\t\t\t\ttemp+=a[i]-5;\n\t\t\t\tif(temp<0)\n\t\t\t\t\ttemp=0;\n\t\t\t\tif(temp>max1){\n\t\t\t\t\tmax1=temp;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(m=3){\n\t\t\ttemp=0;\n\t\t\tfor(i=0;i<n;i+=3)\n\t\t\t{\n\t\t\t\ttemp+=a[i]-5;\n\t\t\t\tif(temp<0)\n\t\t\t\t\ttemp=0;\n\t\t\t\tif(temp>max2){\n\t\t\t\t\tmax2=temp;\n\t\t\t\t}\t\n\t\t\t}\n\t\t}\n\t}\n\tif(max1>max2)\n\t\tprintf(\""%d\\n\"",max1);\n\telse\n\t\tprintf(\""%d\\n\"",max2);\n\t\t\n\t\n\treturn 0;\n}",SEGMENTATION_FAULT,5,324
1591660948279320576,81f258582663b08bc9b4d77bba77afc3b463021ec8fb2262453de07687484cd5,2022-11-13 13:15:16,Python,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"money = list(map(int,input().split()))\nmoney.sort()\ndata = money[0]+money[1]\nprint(data)\n \n ",ACCEPTED,94,2888
1591660953211789312,667c2e97e82c372f60661d46943ff56a17c9350387f4364ebabe70ac2e232862,2022-11-13 13:15:17,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int x,y,z,n;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    n=x+y+z-x;\n    printf(\""%d\\n\"",n);\n    return 0;\n}\n",WRONG_ANSWER,6,220
1591660961470406656,2a1cee132cc8344d51461f6cbf473fb80705d6fd5972f9a5d0fcfea0760fd8b1,2022-11-13 13:15:19,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R,N;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    N=P+Q+R-R;\n        printf(\""%d\\n\"",N);\n\n    return 0;\n}\n\n",WRONG_ANSWER,10,368
1591660968508448768,c47b15e117166a3dd00078b9f795673d5284a2761e582479119229751cc734d3,2022-11-13 13:15:21,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#define S 1000\n\n\nint main()\n{\n    int a=0,n,i,j,k;\n    int s[S];\n    int m[S];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&s[i]);\n    for(i=0;i<n;i++)\n    {\n        k=1;\n        for(j=i;j<n;j++)\n        if(s[i]<=s[j])\n        m[i]=s[i]*(k++);\n    }\n    for(i=0;i<n;i++)\n    {\n        if(a<=m[i])\n            a=m[i];\n    }\n\n    printf(\""%d\\n\"",a);\n\n\n\n    return 0;\n}",WRONG_ANSWER,18,356
1591660981640781824,458af3c005e0b282d1ca88c254d9910ee2d93738b6f06d399f7444e1e64831eb,2022-11-13 13:15:24,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,q,i,c;\n    q=c=0;\n    scanf(\""%d\"",&a);\n    int b[100000];\n    for(i=1;i<=a;i++){\n        scanf(\""%d\"",&b[i]);\n    }\n    for(i=0;i<=a;i++){\n            b[0]=0;\n            if(a-i>=3){\n                if(b[i+1]>=5){\n                q=q+b[i+1]-5;\n            }\n            if(b[i]<5){\n                    c++;\n                    if(c==3){\n                    q=q+b[i+3]-5;\n                    c=0;}\n            }\n            }\n            else\n            {\n                q=q+b[i+1]-5;\n            }\n            }\n    printf(\""%d\"",q);\n    return 0;\n}\n",WRONG_ANSWER,8,356
1591660985583415296,0d24b4ee85e6e3a4cc694f7e11105fa2aaf93fd10d4cbe81657f252e2d675435,2022-11-13 13:15:25,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#define N 100\nint sum=0,t1;\nvoid func(int x,int y,int z);\nint main()\n{\n    int n,n1,n2;\n    int a,b;\n\n   // int t1;\n    scanf(\""%d %d %d\"",&n,&n1,&n2);\n    while(n>0){\n        scanf(\""%d %d\"",&a,&b);\n         //if(a==(b-1)){\n         t1= b/(a+1);\n\n            func(a+1,n1,n2);\n         //}\n        n--;\n\n    }\n\n  printf(\""%d\"",sum);\n    return 0;\n}\nvoid func(int x,int y,int z){\nint m,n;\nm=t1*pow(y,x);\nn=t1*pow(z,x);\nsum+=(m-n);\n}\n",WRONG_ANSWER,12,348
1591660997130334208,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 13:15:28,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,a[100];\n    int i;\n    int t=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[n]);\n    }\n    for(i=0;i<n;i++)\n    {\n     if(a[i]>a[0])\n            i==i;\n      break;\n    }\n\n    for(i=i+1;i<n;i++)\n    {\n        if(a[i+1]>a[i])\n            t=t+1;\n        if(a[i+1]==a[i])\n        {\n            if[i==n]\n                t=t;\n            if(a[i+2]>a[i+1])\n                t=t+1;\n        }\n    }\n    printf(\""%d\"",t-1);\n    return 0;\n}",COMPILE_ERROR,0,0
1591661002922680320,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-13 13:15:29,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{ \n    int i,n;\n    int a[100];\n    int sum=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if(a[i]>a[i-1]&&a[i]>a[i+1])\n            sum++;\n    }\n    printf(\""%d\"",sum-1);\n    return 0;\n}\n",WRONG_ANSWER,11,488
1591661009335771136,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-13 13:15:30,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,e,i;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<n-1;i++)\n    if(a[i]<=a[i+1])\n    e++;\n    printf(\""%d\"",e);\n    return 0;\n}",WRONG_ANSWER,7,200
1591661023156035584,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 13:15:34,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[n],sum=0,i,b=0;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i=b)\n    {\n        if(a[i]>a[i+2])\n        {\n            sum=sum+a[i]-5;\n            b=b+1;\n        }\n        else if(a[i]=a[i+2])\n        {\n            for(i=0;i<n;i=b)\n            {\n                if(a[i+1]>a[i+3])\n                    sum=sum+a[i]-5;b=b+1;\n                else sum=sum+a[i+2]-5;b=b+3;\n            }\n        }\n        else \n        {\n            sum=sum+a[i+2]-5;\n            b=b+3;\n        }\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",COMPILE_ERROR,0,0
1591661029103558656,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 13:15:35,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,a[100];\n    int i;\n    int t=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[n]);\n    }\n    for(i=0;i<n;i++)\n    {\n     if(a[i]>a[0])\n            i=i;\n      break;\n    }\n\n    for(i=i+1;i<n;i++)\n    {\n        if(a[i+1]>a[i])\n            t=t+1;\n        if(a[i+1]==a[i])\n        {\n            if[i==n]\n                t=t;\n            if(a[i+2]>a[i+1])\n                t=t+1;\n        }\n    }\n    printf(\""%d\"",t-1);\n    return 0;\n}",COMPILE_ERROR,0,0
1591661045805232128,44eff53b3369f1a61cc23d34ceef2d2de14a1f860795a5cf6565b8cf46bfc2ee,2022-11-13 13:15:39,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main(){\n    int P,Q,R,S;\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    if(P>Q){\n        S=P;Q=P;P=S;\n    }\n    if(Q>R){\n        S=Q;Q=R;R=S;\n    }\n    if(P>Q){\n        S=P;Q=P;P=S;\n    }\n    printf(\""%d\"",P+Q);\n    return 0;\n}",WRONG_ANSWER,19,200
1591661056425254912,c39a4349139942a7aa7456b2c4609f8d0f9d0d3465be213d33870ec87eab1e58,2022-11-13 13:15:42,C++,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    printf(\""60\"");\n}",ACCEPTED,5,348
1591661073626095616,217f1946625720e554af7294d3599b943eea3b430c0df7aa0c5c70abe9904e56,2022-11-13 13:15:46,Java,0.0,1591610585635213318,1591131464941563904,1049226928954454016,import java.util.Scanner;\npublic class Main{\n    public static void main(String[] args){\n        Scanner sc=new Scanner(System.in);\n        int P=sc.nextInt();\n        int Q=sc.nextInt();\n        int R=sc.nextInt();\n        if(P+Q<=Q+R&&Q+R<=R+P)\n        \tSystem.out.println(P+Q);\n    }\n},WRONG_ANSWER,111,24524
1591661103095230464,6a6dc7e644e57bb2c20b20d39bd4d9541bdebf6415e03e7c13707572c054673e,2022-11-13 13:15:53,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{  int m,n,a,b;\n   scanf(\""%d %d %d\"",&n,&a,&b);\n   if(n<a<=b)\n    m=n+a;\n   else m=n+b;\n    printf(\""%d\"",m);\n    return 0;\n}\n\n\n",WRONG_ANSWER,10,328
1591661113669070848,4d1157ac6ad50cfc6ca5d6b3e1c2dd7f1ecc593df10ff6888d4207a4f1c03a35,2022-11-13 13:15:55,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int n,d,b,c,sum=0;\n    cin>>n;\n    int a[n];\n    for(int i=0;i<=n;i++)\n    {\n        cin>>a[i];\n        d=a[i];\n        b=a[i+1];\n        c=a[i+2];\n        if(b<c&&b<d)sum++;\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,8,452
1591661116370202624,1363fe5b260b83108efff76d53fc3ee37db1aa74f7eb5c5c7e6dacb996b49862,2022-11-13 13:15:56,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int p,q,r,a,b,c,m,i,j;\n    int n=2;\n    scanf(\""%d %d %d\"",&p,&q,&r);\n    a=p+q;\n    b=q+r;\n    c=r+p;\n    char arr[n];\n    arr[0]=a;\n    arr[1]=b;\n    arr[2]=c;\n\n    for(i=n;i>0;i--)\n    {\n        for(j=n;j>0;j--)\n        {\n            if(arr[j]>arr[j-1])\n            {\n                m=arr[j];\n                arr[j]=arr[j-1];\n                arr[j-1]=m;\n            }\n        }\n    }\n    printf(\""%d\"",arr[n]);\n\n    return 0;\n}",WRONG_ANSWER,5,324
1591661125165703168,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 13:15:58,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,a[100];\n    int i;\n    int t=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[n]);\n    }\n    for(i=0;i<n;i++)\n    {\n     if(a[i]>a[0])\n            i=i;\n      break;\n    }\n\n    for(i=i+1;i<n;i++)\n    {\n        if(a[i+1]>a[i])\n            t=t+1;\n        if(a[i+1]==a[i])\n        {\n            if(i==n)\n                t=t;\n            if(a[i+2]>a[i+1])\n                t=t+1;\n        }\n    }\n    printf(\""%d\"",t);\n    return 0;\n}",WRONG_ANSWER,8,348
1591661139149512704,361d4ab0fa1284b9bf8a3ba65da408861b894c5c0617b83f77f2c1d9a1a3ec92,2022-11-13 13:16:01,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"p,q,r=input().split()\nx=int(p)+int(q)\ny=int(q)+int(r)\nz=int(r)+int(p)\nif x<y:\n    if y<z:\n        print(x)\n    else:\n        print(y)\nif y<z:\n    if x<z:\n        print(y)\n    else:\n        print(z)\nif z<x:\n    if x<y:\n        print(z)\n    else:\n        print(x)#\n        \n        \n\n",WRONG_ANSWER,23,2760
1591661149710770176,7dd0c628805d8a6777ff5cc70a5ec79db9475f660782b2f4289ae98977303581,2022-11-13 13:16:04,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"money = liost(map(int,input().split))\nmoney.sort()\ndata = money[0]+money[1]\nprint(data)",NON_ZERO_EXIT_CODE,18,2888
1591661149769445376,4d1157ac6ad50cfc6ca5d6b3e1c2dd7f1ecc593df10ff6888d4207a4f1c03a35,2022-11-13 13:16:04,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int n,d,b,c,sum=0;\n    cin>>n;\n    int a[n];\n    for(int i=0;i<=n;i++)\n    {\n        cin>>a[i];\n        d=a[i];\n        b=a[i+1];\n        c=a[i+2];\n        if(b<c&&b<d)sum++;\n    }\n    printf(\""%d\\n\"",sum);\n    return 0;\n}",WRONG_ANSWER,9,472
1591661164839624704,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-13 13:16:07,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"money = liost(map(int,input().split()))\nmoney.sort()\ndata = money[0]+money[1]\nprint(data)",NON_ZERO_EXIT_CODE,17,2900
1591661176457814016,25584884fd716238437f89484285121d106c1090916ab683be624f210130ebad,2022-11-13 13:16:10,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n   int i,P,Q,R,sum1,sum2,sum3,min;\n   scanf(\""%d %d %d\"",&P,&Q,&R);\n   sum1=P+Q;sum2=R+Q;sum3=P+R;\nint a[4]={sum1,sum2,sum3};\nfor(i=0;i<4;i++)\n{\n    min=a[0];\n    if(a[i]<min)\n        printf(\""%d\"",min);\n}\nreturn 0;\n}\n\n",WRONG_ANSWER,16,348
1591661181193216000,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-13 13:16:11,C,0.0,1591610585635213313,1589906790446387200,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,j,k,temp,flag,sum,m,h;\n    scanf(\""%d\"",&m);\n    for(h=1;h<=m;h++)\n    {\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(k=1;k<=n;k++)\n    {\n        flag=0;\n        for(j=0;j<n-k;j++)\n        {\n            flag=1;\n          if(a[j]>a[j+1])\n          {\n               temp=a[j+1];\n                a[j+1]=a[j];\n               a[j]=temp;\n            }\n        }\n       if(flag==0);\n            break;\n    }\n    sum=abs(a[0]-a[n-1])+abs(a[n-1]-a[n-2]);\n    printf(\""%d\\n\"",sum);\n    }\n    return 0;\n}\n",WRONG_ANSWER,25,200
1591661182988333056,675867a135da6702ed27c0eec3e4b6d2a7d95c44854c01823fc152f0689f010d,2022-11-13 13:16:12,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#define MAX 100\nint main(void)\n{\n\tint n, a[MAX];\n\tint i, m;\n\tint max1, max2, temp;\n\tmax1=-10;\n\tmax2=-10;\n\ttemp=0;\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++)\n\t\tscanf(\""%d\"",&a[i]);\n\t\n\tfor(m=1;m<=3;m+=2)\n\t{\n\t\tif(m==1){\n\t\t\tfor(i=0;i<n;i++)\n\t\t\t{\n\t\t\t\ttemp+=a[i]-5;\n\t\t\t\tif(temp<0)\n\t\t\t\t\ttemp=0;\n\t\t\t\tif(temp>max1){\n\t\t\t\t\tmax1=temp;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(m=3){\n\t\t\ttemp=0;\n\t\t\tfor(i=0;i<n;i+=3)\n\t\t\t{\n\t\t\t\ttemp+=a[i]-5;\n\t\t\t\tif(temp<0)\n\t\t\t\t\ttemp=0;\n\t\t\t\tif(temp>max2){\n\t\t\t\t\tmax2=temp;\n\t\t\t\t}\t\n\t\t\t}\n\t\t}\n\t}\n\tif(max1>max2)\n\t\tprintf(\""%d\\n\"",max1);\n\telse\n\t\tprintf(\""%d\\n\"",max2);\n\t\t\n\t\n\treturn 0;\n}",SEGMENTATION_FAULT,6,504
1591661197995597824,361d4ab0fa1284b9bf8a3ba65da408861b894c5c0617b83f77f2c1d9a1a3ec92,2022-11-13 13:16:15,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"p,q,r=input().split()\nx=int(p)+int(q)\ny=int(q)+int(r)\nz=int(r)+int(p)\nif x<y:\n    if y<z:\n        print(x)\n    else:\n        print(y)\nif y<z:\n    if x<z:\n        print(y)\n    else:\n        print(z)\nif z<x:\n    if x<y:\n        print(z)\n    else:\n        print(x)\n        \n        \n\n",WRONG_ANSWER,19,2760
1591661203515301888,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-13 13:16:17,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R,a;\n    1<=P,Q,R<=pow(10,3);\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    if(P+Q<P+R||P+Q<Q+R)\n    printf(\""%d\"",P+Q);\n    else if(Q+R<P+R||Q+R<P+Q)\n    printf(\""%d\"",Q+R);\n    else\n    printf(\""%d\"",P+R);\n    return 0;\n}\n",WRONG_ANSWER,14,328
1591661205964742656,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 13:16:17,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,a[100];\n    int i;\n    int t=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[n]);\n    }\n    for(i=0;i<n;i++)\n    {\n     if(a[i]>a[0])\n            i=i;\n      break;\n    }\n\n    for(i=i+1;i<n;i++)\n    {\n        if(a[i+1]>a[i])\n            t=t+1;\n        if(a[i+1]==a[i])\n        {\n            if(i==n-1)\n                t=t;\n            if(a[i+2]>a[i+1])\n                t=t+1;\n        }\n    }\n    printf(\""%d\"",t);\n    return 0;\n}",WRONG_ANSWER,5,328
1591661240328663040,13eac09c9e523ec396926840225e626f8fff54ca0e8a92e46e533705daa83ac2,2022-11-13 13:16:25,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    printf(\""%d\"",P+Q);\n\n    return 0;\n}\n",WRONG_ANSWER,16,348
1591661245600948224,667c2e97e82c372f60661d46943ff56a17c9350387f4364ebabe70ac2e232862,2022-11-13 13:16:27,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,s;\n    scanf(\""%d\"",&n);\n    scanf(\""%d\"",&s);\n    printf(\""%d\\n\"",n);\n    return 0;\n}\n\n",WRONG_ANSWER,12,324
1591661272792576000,6a6dc7e644e57bb2c20b20d39bd4d9541bdebf6415e03e7c13707572c054673e,2022-11-13 13:16:33,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{  int m,n,a,b;\n   scanf(\""%d %d %d\"",&n,&a,&b);\n   if(n<a<=b)\n    m=n+a;\n   else m=a+b;\n    printf(\""%d\"",m);\n    return 0;\n}\n\n\n",WRONG_ANSWER,12,364
1591661273954443264,55950e2d4c314feed0856fa0f6b80f22c5c36f2ebe0d75c8ee2cadb1a06b2fe1,2022-11-13 13:16:34,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a,b,c,i,m;\n    scanf(\""%d%d%d\"",&a,&b,&c);\n    for(i=0;i<3;i++){\n        if((a+b<b+c)&&(a+b<c+a))\n            m=a+b;\n        else if((b+c<a+b)&&(b+c<c+a))\n            m=b+c;\n        else if((c+a<a+b)&&(c+a<b+c))\n            m=c+a;\n        \n        \n        \n        \n        \n    }\n    printf(\""%d\"",m);\n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    return 0;\n}\n",ACCEPTED,31,348
1591661315566133248,e715137eeb4190ade2330123b989bbdd6eebd9a5e1df2e292271d3bfe3a79c69,2022-11-13 13:16:43,C,0.0,1591610585635213314,1591128862958940160,1049226928954454016,"#include<stdio.h>\na[10000][2]={0};\nint main()\n{\n    int i,j,k=0,n,m;\n    scanf(\""%d\"",&n);\n    scanf(\""%d\"",&j);\n    a[k][0]=1;\n    a[k][1]=1;\n    for(i=0;i<n-1;i++)\n    {\n        scanf(\""%d\"",&m);\n        if(m>j)\n        {\n            \n            a[k][0]++;\n            a[k][1]++;\n            \n        }\n        else\n        {\n            k++;\n            a[k][0]++;\n            a[k][1]++;\n        }\n        j=m;\n    }\n    printf(\""%d \"",n);\n    for(i=0;i<k;i++)\n    {\n        while(a[i][0]>0)\n        {\n            printf((a[i][0]==1&&i+1==k)?\""%d\\n\"":\""%d \"",a[i][0]);\n            a[i][0]--;\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,6,324
1591661321081597952,4e8bf5e988ac4275aeb23eae913a385055ab79de14dc27373b9e62a15269d138,2022-11-13 13:16:45,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,b,c;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    if(a<b){\n        if(b<c)printf(\""%d\\n\"",a+b);else{printf(\""%d\\n\"",a+c);}\n    }else{if(a<c)printf(\""%d\\n\"",a+b);else{printf(\""%d\\n\"",b+c);}}\n}",ACCEPTED,40,480
1591661326928470016,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-13 13:16:46,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main(){\n\tint n;\n\tint i;\n\tint count=0;\n\tscanf(\""%d\"",&n);\n\tchar a[100000]={0};\n\tscanf(\""%s\"",&a);\n\t/*for(i=0;i<n;i++){\n\t\tscanf(\""%c\"",&a[i]);\n\t}*/\n\tfor(i=0;i<n;i++){\n\t\tif(a[i]!=a[i+1]){\n\t\t\tcontinue;\n\t\t}\n\t\tif(a[i]=a[i+1]){\n\t\t\tcount++;\n\t\t\ti++;\n\t\t}\n\t}\n\tprintf(\""%d\\n\"",count*2);\n    return 0;\n}",WRONG_ANSWER,7,632
1591661327247237120,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-13 13:16:46,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,e,i;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<n-1;i++)\n    if(a[i]<=a[i+1])\n    e++;\n    e=e-1;\n    printf(\""%d\"",e);\n    return 0;\n}",WRONG_ANSWER,5,352
1591661335082184704,c76414e1d2d8531a5745e9bd3192aafa7cca924e645650ffe7954c992cc13b33,2022-11-13 13:16:48,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\nint n,a,b,i;\nint sum=0;\nscanf(\""%d %d %d\"",&n,&a,&b);\nint s1[n],s2[n];\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&s1[i]);\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&s2[i]);\n\nfor(i=0;i<n;i++)\n    {\n    sum=sum+(s1[i]/(s2[i]+1)*pow(a,s2[i]+1))-(s1[i]/(s2[i]+1)*pow(b,s2[i]+1));\n    }\nprintf(\""%d\"",sum);\n}\n",WRONG_ANSWER,8,196
1591661338055958528,105cc8c0a5a465ab713603b461d92ac587c87767965625687540cd513f7ebb57,2022-11-13 13:16:49,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <bits/stdc++.h>\nusing namespace std;\nint n,res;\nint nums[10005];\n\nvoid solve(){\n\tbool isdown=false;\n\tfor(int i=1;i<n;i++)\n\t{\n\t\tif(nums[i]<nums[i-1])\n\t\t{\n\t\t\tisdown=true;\n\t\t}\n\t\telse if(nums[i]>nums[i-1])\n\t\t{\n\t\t\tif(isdown)\n\t\t\t\tres++;\n\t\t\tisdown=false;\n\t\t}\n\t\t\n\t}\n}\n\nint main(){\n\tcin>>n;\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tcin>>nums[i];\n\t}\n\tsolve();\n\tcout<<res;\n\treturn 0;\n} \n",COMPILE_ERROR,0,0
1591661370641506304,7dd0c628805d8a6777ff5cc70a5ec79db9475f660782b2f4289ae98977303581,2022-11-13 13:16:57,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"money = list(map(int,input().split))\nmoney.sort()\ndata = money[0]+money[1]\nprint(data)",NON_ZERO_EXIT_CODE,19,2760
1591661371564240896,44eff53b3369f1a61cc23d34ceef2d2de14a1f860795a5cf6565b8cf46bfc2ee,2022-11-13 13:16:57,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main(){\n    int P,Q,R,S;\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    if(P>Q){\n        S=P;Q=P;P=S;\n    }\n    if(Q>R){\n        S=Q;Q=R;R=S;\n    }\n    if(P>Q){\n        S=P;P=Q;Q=S;\n    }\n    printf(\""%d\"",P+Q);\n    return 0;\n}",WRONG_ANSWER,13,340
1591661376559669248,c76414e1d2d8531a5745e9bd3192aafa7cca924e645650ffe7954c992cc13b33,2022-11-13 13:16:58,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\nint n,a,b,i;\nint sum=0;\nscanf(\""%d %d %d\"",&n,&a,&b);\nint s1[n],s2[n];\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&s1[i]);\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&s2[i]);\n\nfor(i=0;i<n;i++)\n    {\n    sum=sum+(s1[i]/(s2[i]+1)*pow(a,s2[i]+1))-(s1[i]/(s2[i]+1)*pow(b,s2[i]+1));\n    }\nprintf(\""%d\"",sum);\n}\n",WRONG_ANSWER,5,480
1591661379600539648,105cc8c0a5a465ab713603b461d92ac587c87767965625687540cd513f7ebb57,2022-11-13 13:16:59,C++,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <bits/stdc++.h>\nusing namespace std;\nint n,res;\nint nums[10005];\n\nvoid solve(){\n\tbool isdown=false;\n\tfor(int i=1;i<n;i++)\n\t{\n\t\tif(nums[i]<nums[i-1])\n\t\t{\n\t\t\tisdown=true;\n\t\t}\n\t\telse if(nums[i]>nums[i-1])\n\t\t{\n\t\t\tif(isdown)\n\t\t\t\tres++;\n\t\t\tisdown=false;\n\t\t}\n\t\t\n\t}\n}\n\nint main(){\n\tcin>>n;\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tcin>>nums[i];\n\t}\n\tsolve();\n\tcout<<res;\n\treturn 0;\n} \n",ACCEPTED,38,500
1591661382930817024,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-13 13:16:59,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<iostream>\nusing namespace std;\nint max(int a,int b){\n    return a>b?b:a;\n}\nint main(){\n    int P,Q,R;\n    cin>>P>>Q>>R;\n    if(P>=1&&P<=1000&&Q>=1&&Q<=1000&&R>=1&&R<=1000)\n        cout<<max(P,Q)+max(P,R)<<endl;\n    return 0;\n}",WRONG_ANSWER,8,448
1591661386240110592,5a1c17b308a3b3595833d34c6bdfb75e9f5dd0d065acfeb7f28ab8102ba7406c,2022-11-13 13:17:00,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a[10];\n    int i,n;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    int count = 0;\n    for(i=0;i<n;i++){\n        if(a[i]<a[i-1]&&a[i]<a[i+1]){\n            if(i!=0&&i!=n-1){\n            count++;\n            }\n        }\n        while(a[i]==a[i+1]){\n            if(a[i+1]<a[i+2]){\n                count = count+1;\n                break;\n            }\n        }\n    }\n    printf(\""%d\"",count);\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,400,336
1591661396147068928,13616e85f216dd3844293b46f4b46105a0a2c458f7807a7b677858feb35cb63a,2022-11-13 13:17:03,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,i,j,sum=0;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if(a[i]!=a[i+1])\n        {\n             n=n-2;\n            sum=sum+2;\n            for(j=i;j<n;j++)\n            {\n            a[j]=a[j+2];\n            }\n            i=0;\n        }\n       \n    }\n    printf(\""%d\"",sum);\n    printf(\""\\n\"");\n    return 0;\n}",WRONG_ANSWER,6,332
1591661402262396928,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 13:17:04,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,a[100];\n    int i;\n    int t=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[n]);\n    }\n    for(i=0;i<n;i++)\n    {\n     if(a[i]>a[0])\n            i=i;\n      break;\n    }\n\n    for(i=i+1;i<n;i++)\n    {\n        if(a[i+1]>a[i])\n            t=t+1;\n        if(a[i+1]==a[i])\n        {\n            if(i==n-1)\n                t=t;\n            if(a[i+1]>a[i])\n                t=t+1;\n        }\n    }\n    printf(\""%d\"",t);\n    return 0;\n}",WRONG_ANSWER,12,512
1591661415344386048,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-13 13:17:07,Python,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"money = list(map(int,input().split()))\nmoney.sort()\ndata = money[0]+money[1]\nprint(data)",ACCEPTED,95,3072
1591661442225692672,667c2e97e82c372f60661d46943ff56a17c9350387f4364ebabe70ac2e232862,2022-11-13 13:17:14,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,s;\n    scanf(\""%d\\n\"",&n);\n    scanf(\""%d\\n\"",&s);\n    printf(\""%d\\n\"",n);\n    return 0;\n}\n\n",WRONG_ANSWER,7,340
1591661442523521024,d9e00d995e65b04cda3ddef6baec19225e4351002ab4efa981f62d78919a481b,2022-11-13 13:17:14,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i;\n    int arr[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&arr[i]);\n    }\n    int cnt=0;\n    for(i=0;i<n;i++){\n        if(arr[i+1] < arr[i] && arr[i+1] <arr[i+2]) cnt++;\n        if(arr[i+1] == arr[i+2] && arr[i+1] < arr[i] && arr[i+2] < arr[i+3]) cnt++;\n    }\n    printf(\""%d\"",cnt);\n    return 0;\n}",WRONG_ANSWER,11,196
1591661478254751744,6a6dc7e644e57bb2c20b20d39bd4d9541bdebf6415e03e7c13707572c054673e,2022-11-13 13:17:22,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{  int m,n,a,b;\n   scanf(\""%d %d %d\"",&n,&a,&b);\n    m=n+a;\n    printf(\""%d\"",m);\n    return 0;\n}\n\n\n",WRONG_ANSWER,16,204
1591661496520957952,6a835d762a87e93baf4142897168374dc31e9da90b86c19ed82f21159b644272,2022-11-13 13:17:27,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nmain()\n{\n    int p,q,r,x;\n    for(x=0;x<5;x++)\n    scanf(\""%d%d%d\"",&p,&q,&r);\n    if(p=0)\n        x=q+r;\n    if(r=0)\n        x=q+p;\n     else if(q=0)\n        x=p+r;\n    printf(\""%d\"",x);\n}\n",WRONG_ANSWER,9,324
1591661505962336256,59415347d1cfa3163c0a25f108652369803ee9c4d72f5c59e4212aabab93e388,2022-11-13 13:17:29,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main(int argc, char *argv[]) {\n\tint a[10];\n\tint n = 0,m = 0,number = 0,number1 = 0,b,i;\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&m);\n\t\ta[i] = m;\n\t}\n\tfor(i=1;i<n;i++){\t\t\t\n\t\tif(a[i]<=a[i+1]&&a[i]<=a[i-1]){\n\t\t\tnumber++;\n\t\tif(a[i]==a[i+1])\n\t\t\tnumber1++;\t\t\n\t\t}\t\t\n\t}\n\tif(a[n-1]<a[n-2]){\n\t\tb = 1;\n\t}\n\tint sum = number-number1-b;\t\n\tprintf(\""%d\"",sum);\n\treturn 0;\n}",RUNTIME_ERROR,6,352
1591661507707154432,9d0546dac18a9dc678295254e547925db086add5f872ef42d8015d525afeaf65,2022-11-13 13:17:29,C,0.0,1591610585635213314,1591128862958940160,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 10000\nint main()\n{\n    int num[N],i,j,n,k,temp;\n    scanf(\""%d\"",&k);\n    n=k-1;\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&num[i]);\n    }\n    printf(\""%d \"",k);\n    for(i=1;i<n;i++){\n        for(j=0;j<n-i;j++){\n            if(num[j]<num[j+1]){\n                temp=num[j];\n                num[j]=num[j+1];\n                num[j+1]=temp;\n            }\n        }\n    }\n    for(i=0;i<n-1;i++){\n        printf(\""%d \"",num[i]);\n    }\n    for(i=n-1;i<n;i++){\n        printf(\""%d\"",num[i]);\n    }\n    return 0;\n}\n",WRONG_ANSWER,26,620
1591661519765778432,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-13 13:17:32,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\nint main(){\n    int gd = -5; // 固定减5\n    int count = 0;\n    int num = 0;\n    int len;\n    int j=-1;\n    if(scanf(\""%d\"",&len)){};\n    int arr[len];\n    \n        for(int i=0; i<len; i++){\n            if(scanf(\""%d\"",&arr[i])){};\n        }\n        \n        while(j<len){\n            // 给count赋值 单步最大\n            if(arr[j+1]+gd > arr[j+3]+gd){\n                count = arr[j+1]+gd;\n                j=j+1;\n            }else{\n                count = arr[j+3]+gd;\n                j=j+3;\n            }\n            // 总数最\n                num += count;\n            \n        }\n    printf(\""%d\"",count);\n}",WRONG_ANSWER,10,352
1591661527881756672,7dd0c628805d8a6777ff5cc70a5ec79db9475f660782b2f4289ae98977303581,2022-11-13 13:17:34,Python,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"money = list(map(int,input().split()))\nmoney.sort()\ndata = money[0]+money[1]\nprint(data)",ACCEPTED,103,3132
1591661532826853376,44042a4519c9231aa21c54eb113b7a08f98bcd7db4839a20a61ab6ce51fce357,2022-11-13 13:17:35,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,k=0;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=1;i<n-4;i++)\n    {\n        if(a[i]>a[i+1]&&a[i+1]<a[i+2])\n            k++;\n        if(a[i]>a[i+1])\n            if(a[i+1]>=a[i+2]&&a[i+2]=<a[i+3]&&a[i+3]<a[i+4])\n                k++;\n    }\n    printf(\""%d\"",k);\n\n\n\n\n    return 0;\n}\n",COMPILE_ERROR,0,0
1591661541823623168,20ffd83467b553ac24e1f4b8b096d58858684ca8c3f6a4d5a62be9ff7c4817da,2022-11-13 13:17:37,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#define MAX 10000\nint main()\n{\n    int n,a,b,h=0;\n    int i;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    int c[MAX],F[MAX],B[MAX];\n    for(i=1;i<=n;i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=1;i<=n;i++)\n        scanf(\""%d\"",&F[i]);\n    for(i=1;i<=n;i++)\n        B[i]=c[i]/(F[i]+1)*pow(a,F[i]+1)-c[i]/(F[i]+1)*pow(b,F[i]+1);\n    for(i=0;i<=n;i++){\n        h+=B[i];\n        }\n    printf(\""%d\\n\"",h);\n}\n",WRONG_ANSWER,6,384
1591661554884698112,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 13:17:40,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,a[100];\n    int i;\n    int t=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[n]);\n    }\n    for(i=0;i<n;i++)\n    {\n     if(a[i]>a[0])\n            i=i;\n      break;\n    }\n    i=i;\n    for(i=i+1;i<n;i++)\n    {\n        if(a[i+1]>a[i])\n            t=t+1;\n        if(a[i+1]==a[i])\n        {\n            if(i==n-1)\n                t=t;\n            if(a[i+1]>a[i])\n                t=t+1;\n        }\n    }\n    printf(\""%d\"",t);\n    return 0;\n}",WRONG_ANSWER,12,488
1591661563428528128,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-13 13:17:43,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\n    int n = 0, i = 0, j = 0, count = 0;\n    scanf(\""%d\"",&n);\n    int arr[n];\n    arr[0] = 0;\n    arr[n-1] = 0;\n    for(i = 1;i < n-1; ++i)\n    {\n        scanf(\""%d\"",&arr[i]);\n    }\n    if(arr[0] == arr[1])\n    {\n         count++;\n     }\n    for(j = 1;j < n-1; ++j)\n    {\n        if((arr[j] < arr[j-1]) && (arr[j] > arr[j+1]))\n        {\n            count++;\n        }\n        if(arr[j] == arr[j+1])\n        {\n            count++;\n        }\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",WRONG_ANSWER,11,352
1591661571255066624,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-13 13:17:44,C,0.0,1591610585635213313,1589906790446387200,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,j,k,temp,flag,sum,m,h;\n    scanf(\""%d\"",&m);\n    for(h=1;h<=m;h++)\n    {\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(k=1;k<=n;k++)\n    {\n        flag=0;\n        for(j=0;j<n-k;j++)\n        {\n            flag=1;\n          if(a[j]>a[j+1])\n          {\n               temp=a[j+1];\n                a[j+1]=a[j];\n               a[j]=temp;\n            }\n        }\n       if(flag==0);\n            break;\n    }\n    sum=abs(a[0]-a[n-1])+abs(a[n-1]-a[n-2]);\n    if(h<m)\n        printf(\""%d\\n\"",sum);\n    else\n        printf(\""%d\"",sum);\n    }\n    return 0;\n}\n",WRONG_ANSWER,20,480
1591661575667462144,e7e6ce2c6e9e530eaf2b9b9968748a0e44e3ac7183d73deb51851946350bfbb0,2022-11-13 13:17:45,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    char a[10];\n    int n;\n //   int r;      //循环变量;\n    int flag=0;\n    int i,k,l,j;\n    scanf(\""%d\"",&n); //n代表字符串长度\n\n    for(i=0;i<=n;i++)\n    {\n        scanf(\""%c\"",&a[i]);\n    }\n\n\n    i=0;j=1;\n    k=a[i];\n    l=a[j];\n\n  do {\n        if(k==l) {\n            i=j;\n            j++;\n        }\n        else\n        {\n            flag=flag+2;\n            i--;\n            j++;\n        }\n\n    }while(flag!=n);\n\n    printf(\""%d\"",flag);\n    return 0;\n}",RUNTIME_ERROR,6,324
1591661581866688512,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-13 13:17:47,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R;\n    1<=P,Q,R<=pow(10,3);\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    if(P+Q<P+R||P+Q<Q+R)\n    printf(\""%d\"",P+Q);\n    else if(Q+R<P+R||Q+R<P+Q)\n    printf(\""%d\"",Q+R);\n    else\n    printf(\""%d\"",P+R);\n    return 0;\n}\n",WRONG_ANSWER,22,368
1591661590334955520,c5cc6f9845df4bd1986af86c0696296436bbc0f00a10a9f891b4100e57bc3a19,2022-11-13 13:17:49,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <string.h>\n#define N 10005\nchar a[N];\nint main()\n{\n\tint i,j;\n\tint n;\n\tscanf(\""%d\"",&n);\n\tgetchar();\n\tfor(i=0;i<n;i++) {\n\t\tscanf(\""%c\"",&a[i]);\n\t}\n\tint a0,a1;\n\ta0=a1=0;\n\tfor(i=0;i<n;i++) {\n\t\tif(a[i]=='0') a0++;\n\t\tif(a[i]=='1') a1++;\n\t}\n\tint temp=a0>a1?a1:a0;\n\tprintf(\""%d\\n\"",temp*2);\n\t\n\t\n\treturn 0;\n}",SEGMENTATION_FAULT,30,360
1591661593707163648,5ed1ed5f3786d45db71190023ef590496fd0d8d8cfe4af0f2c94d1d387178674,2022-11-13 13:17:50,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n    int n,a,b,i,x[10],z[10],s=0;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    for(i=1;i<=n;i++)\n    {\n        scanf(\""%d\"",&x[i]);\n    }\n    for(i=1;i<=n;i++)\n    {\n    scanf(\""%d\"",&z[i]);\n    }\n    for(i=1;i<=n;i++)\n    {\n        s=s+x[i]/(z[i]+1)*(pow(a,z[i]+1)-pow(b,z[i]+1));\n    }\n    printf(\""%d\"",s);\n    return 0;\n}\n",WRONG_ANSWER,13,352
1591661594537635840,d808f4cc3c70a696f5c416714e0998fe96743e5273bc07a26f75738d12d304f5,2022-11-13 13:17:50,Java,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n        int n,a,b;\n        double x=0,y=0;\n        Scanner sc=new Scanner(System.in);\n        n=sc.nextInt();\n        a=sc.nextInt();\n        b=sc.nextInt();\n        int[] c=new int[n];\n        for(int i=0;i<n;i++){\n        \tc[i]=sc.nextInt();\n        } \n        int[] f=new int[n];\n        for(int i=0;i<n;i++){\n        \tf[i]=sc.nextInt();\n        }\n        for(int i=0;i<n;i++){\n        \tx+=c[i]/(f[i]+1)*Math.pow(a, (f[i]+1));\n        \ty+=c[i]/(f[i]+1)*Math.pow(b, (f[i]+1));\t\n        }\n        System.out.format(\""%.0f\\n\"",x-y);\n\t}\n}\n",WRONG_ANSWER,116,24704
1591661611717550080,1363fe5b260b83108efff76d53fc3ee37db1aa74f7eb5c5c7e6dacb996b49862,2022-11-13 13:17:54,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int p,q,r,a,b,c,m,i,j;\n    int n=2;\n    scanf(\""%d %d %d\"",&p,&q,&r);\n    a=p+q;\n    b=q+r;\n    c=r+p;\n    char arr[n];\n    arr[0]=a;\n    arr[1]=b;\n    arr[2]=c;\n\n    for(i=n;i>0;i--)\n    {\n        for(j=n;j>0;j--)\n        {\n            if(arr[j]>arr[j-1])\n            {\n                m=arr[j];\n                arr[j]=arr[j-1];\n                arr[j-1]=m;\n            }\n        }\n    }\n    printf(\""%d\"",arr[n]);\n\n    return 0;\n}",WRONG_ANSWER,12,192
1591661621276368896,acf80eea856463058b81f71c0238069795893092293fbd098cc594959df6444e,2022-11-13 13:17:56,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"P,Q,R=(input()).split\nP=int(P)\nQ=int(Q)\nR=int(R)\nmin=0\nif P+Q<Q+R:\n    if P+Q<P+R:\n        min=P+Q\n    else:\n        min=P+R\nelse:\n    if Q+R<P+R:\n        min=Q+R\n     else:\n        min=P+R\nprint(min)",NON_ZERO_EXIT_CODE,24,2756
1591661642755366912,217f1946625720e554af7294d3599b943eea3b430c0df7aa0c5c70abe9904e56,2022-11-13 13:18:01,Java,0.0,1591610585635213318,1591131464941563904,1049226928954454016,import java.util.Scanner;\npublic class Main{\n    public static void main(String[] args){\n        Scanner sc=new Scanner(System.in);\n        int P=sc.nextInt();\n        int Q=sc.nextInt();\n        int R=sc.nextInt();\n        if(P+Q<=Q+R&&Q+R<=R+P)\n        \tSystem.out.println(P+Q);\n        if(P+Q<=Q+R&&Q+R>R+P){\n            if(R+P<P+Q)\n                System.out.println(R+P);\n        }\n    }\n},WRONG_ANSWER,106,25112
1591661654113542144,e9a50f3e071443bb6fb229966bff355c178d484f6cc10e5e1fc8dc5a537237ba,2022-11-13 13:18:04,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int i,a[3],c,j,sum=0,max,max1;\n    int k;\n    for(i=0;i<3;i++)\n        scanf(\""%d\"",&a[i]);\n    c=a[0];\n    int b[c][c];\n    for(i=0;i<c;i++)\n        for(j=0;j<c;j++)\n    {\n        scanf(\""%d\"",&b[i][j]);\n    }\n   /* for(i=0;i<c;i++)\n   {\n       for(j=0;j<c;j++)\n    {\n        printf(\""%d\"",b[i][j]);\n    }\n    printf(\""\\n\"");\n   }*/\n      for(i=0;i<c;i++)\n    {\n        max=pow(a[1],b[1][i]+1)-pow(a[2],b[1][i]+1);\n        printf(\""%d\\n\"",max);\n        k=b[0][i]/(b[1][i]+1);\n       // printf(\""%d \\n\"",k);\n        sum=sum+max*k;\n    }\n    printf(\""%d\"",sum);\n}\n",WRONG_ANSWER,5,204
1591661661638111232,ddd0edd80a23dfec88d0679f4ed6037779b80d26db4ba0f74fecb3d447de61fa,2022-11-13 13:18:06,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#define Max 100000\nint main(){\n    int n,j=0,i,flag=0;\n    int a[Max];\n    scanf(\""%d\"",&n);\n    while(n){\n        scanf(\""%d\"",&a[j]);\n        n--;\n        j++;\n    }\nfor(i=1;i<j-1;i++)\n{\n    if(a[i]==a[i+1])\n    {\n     i=i+1;\n    }\n    if(a[i]>a[i+1])\n        flag++;\n    if(i+1>=j-2)\n        break;\n}\n    printf(\""%d\"",flag);\n}",WRONG_ANSWER,9,348
1591661663726919680,190178fcb71270e17fbe689a22517f5296281dfcd3b16ec01748057e49740d1d,2022-11-13 13:18:06,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P=0,Q=0,R=0,X,Y,Z;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    X=P+Q;\n    Y=Q+R;\n    Z=R+P;\n    if(X<Y||X<Z)\n    printf(\""%d\"",X);\n    else if(Y<X||Y<Z)\n    printf(\""%d\"",Y);\n    else if(Z<X||Z<Y)\n    printf(\""%d\"",Z);\n    return 0;\n}",WRONG_ANSWER,13,492
1591661687500234752,44eff53b3369f1a61cc23d34ceef2d2de14a1f860795a5cf6565b8cf46bfc2ee,2022-11-13 13:18:12,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main(){\n    int P,Q,R,S;\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    if(P>Q){\n        S=Q;Q=P;P=S;\n    }\n    if(Q>R){\n        S=Q;Q=R;R=S;\n    }\n    if(P>Q){\n        S=P;P=Q;Q=S;\n    }\n    printf(\""%d\"",P+Q);\n    return 0;\n}",ACCEPTED,45,512
1591661687844167680,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 13:18:12,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[n],sum=0,i,b=0;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i=b)\n    {\n        if(a[i]>a[i+2])\n        {\n            sum=sum+a[i]-5;\n            b=b+1;\n        }\n        else if(a[i]=a[i+2])\n        {\n                if(a[i+1]>a[i+3])\n                    sum=sum+a[i]-5;b=b+1;\n                else sum=sum+a[i+2]-5;b=b+3;\n        }\n        else \n        {\n            sum=sum+a[i+2]-5;\n            b=b+3;\n        }\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",COMPILE_ERROR,0,0
1591661698384453632,acf80eea856463058b81f71c0238069795893092293fbd098cc594959df6444e,2022-11-13 13:18:15,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"P,Q,R=(input()).split\nP=int(P)\nQ=int(Q)\nR=int(R)\nmin=0\nif P+Q<Q+R:\n    if P+Q<P+R:\n        min=P+Q\n    else:\n        min=P+R\nelse:\n    if Q+R<P+R:\n        min=Q+R\n     else:\n        min=P+R\nprint(min)",NON_ZERO_EXIT_CODE,16,2764
1591661704789123072,55950e2d4c314feed0856fa0f6b80f22c5c36f2ebe0d75c8ee2cadb1a06b2fe1,2022-11-13 13:18:16,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int n,a,b,c[100],i,d[100],an=0,bn=0,cn=0;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&c[i]);\n        scanf(\""%d\"",&d[i]);\n\n\n    }\n    for(i=0;i<n;i++){\n        an=an+(c[i])/(d[i]+1)*pow(a,d[i]+1);\n        bn=bn+(c[i])/((d[i]+1)*pow(b,d[i]+1));\n\n\n\n    }\n    cn=an-bn;\n    printf(\""%d\"",cn);\n\n\n\n\n\n\n\n\n\n    return 0;\n}\n",WRONG_ANSWER,6,484
1591661723814473728,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-13 13:18:21,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n\nint main() {\n\t     int n,zhan,i,j;\n\t\t scanf(\""%d\"",&n); \n\t\t int a[100];\n\t\t for(i=0;i<n;i++)\n\t\t {\n\t\t scanf(\""%d\"",&a[i]);\n\t     }\n\t\tfor(i=0;i<n;i++)\t\n\t\t{\t\n\t\tfor(j=2;j<n;j++)\n\t\t{\n\t\t\tif(a[i]>a[i+1])\n\t\t\t{\n\t\t\tif(a[i+1]<a[i+j])\n\t\t\tzhan++;break;\n\t\t\t}\n\t\t\telse i++;\n\t\t\t\n\t\t}\n\t\t\n\t\t}\n\t\tprintf(\""%d\"",zhan);\t\n\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                   \n",WRONG_ANSWER,8,328
1591661725009895424,6a6dc7e644e57bb2c20b20d39bd4d9541bdebf6415e03e7c13707572c054673e,2022-11-13 13:18:21,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{  int m,n,a,b;\n   scanf(\""%d %d %d\"",&n,&a,&b);\n    m=n+a;\n    printf(\""%d\"",m);\n    return 0;\n}\n\n\n",WRONG_ANSWER,17,512
1591661727077654528,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-13 13:18:22,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n\n\n//O(N)\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"",&n);\n\n    int arr[n];\n    int i = 0;\n    for(i = 0; i < n; ++i){\n        scanf(\""%d\"",&arr[i]);\n    }\n\n    int width = 0;\n    int j = 0;\n    int mul = 1;\n    int max = 0;\n    for(i = 0; i < n; ++i){\n        for(j = 0; j < n; ++j){\n            if(arr[j-1] < arr[j]){\n                j = i;\n            }\n            if(arr[i] <= arr[j]){\n                ++width;\n            }\n        }\n        mul = width * arr[i];\n\n        if(mul > max){\n            max = mul;\n        }\n\n        width = 0;\n    }\n\n    printf(\""%d\"",max);\n\n    return 0;\n}",TIME_LIMIT_EXCEEDED,400,200
1591661771340144640,217f1946625720e554af7294d3599b943eea3b430c0df7aa0c5c70abe9904e56,2022-11-13 13:18:32,Java,0.0,1591610585635213318,1591131464941563904,1049226928954454016,import java.util.Scanner;\npublic class Main{\n    public static void main(String[] args){\n        Scanner sc=new Scanner(System.in);\n        int P=sc.nextInt();\n        int Q=sc.nextInt();\n        int R=sc.nextInt();\n        if(P+Q<=Q+R&&Q+R<=R+P)\n        \tSystem.out.println(P+Q);\n        if(P+Q<=Q+R&&Q+R>R+P){\n            if(R+P<P+Q)\n                System.out.println(R+P);\n            else\n            \tSystem.out.println(P+Q);\n        }\n    }\n},WRONG_ANSWER,208,24888
1591661774565564416,5b382280d947e26011a7c75c34d257662bc13c50f8257bc8cae807604d61430c,2022-11-13 13:18:33,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\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\tint n,i;\n\tint count=0;\n\tint a[100];\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=1;i<n-1;i++){\n\tif((a[i]<a[i-1]||a[i]==a[i-1])&&(a[i]<a[i+1]))\n\t{\n\t\tcount++;\n\t}\n\t}\n\tprintf(\""%d\"",count);\n\treturn 0;\n}",RUNTIME_ERROR,26,352
1591661775802884096,834ba62d861cf2d94a81f3b034a55b21f1378d4337b6b065c321d7da6bf82e17,2022-11-13 13:18:33,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,print(60),ACCEPTED,15,2764
1591661779498065920,7c6d208c4c4b695bc8d6f8ae0c0357c2466f5c9f86ec0652674812219ac09d38,2022-11-13 13:18:34,Java,0.0,1591610585639407617,1591132482555211776,1049226928954454016,\nimport java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt();\n\t    int[] arr = new int[a];\n\t    int[] brr = new int[a];\n\t    for (int i = 0; i < a; i++) {\n\t\t\tint b = sc.nextInt();\n\t\t\tarr[i] = b;\n\t\t}\n\t    for (int i = 0; i < a; i++) {\n\t    \tArrays.sort(arr);\n\t    \tbrr[i] = arr[i]*(a-i);\n\t\t}\n\t    Arrays.sort(brr);\n\t\tSystem.out.println(brr[a-1]);\n\t\t\n\t}\n\n}\n,WRONG_ANSWER,117,24656
1591661802839400448,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-13 13:18:40,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main(){\n\tint n,i,j;\n\tscanf(\""%d\"",&n);\n\tint m;\n\tm=n;\n\tchar a[n];\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%c\"",&a[i]);\n\t}\n\tfor(i=0;i<n;i++){\n\t\tif(a[i]!=a[i+1]){\n\t\t\tfor(j=i;j<n-2;j++){\n\t\t\t\ta[j]=a[j+2];\n\t\t\t}\n\t\t\tn-=2;\n\t\t\ti=0;\n\t\t}\n\t}\t\n\tint d;\n\td=m-n;\n\tprintf(\""%d\\n\"",d);\n}",WRONG_ANSWER,9,348
1591661820510003200,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-13 13:18:44,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R;\n    1<=P,Q,R<=pow(10,3);\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    if(P+Q<P+R||P+Q<Q+R)\n    printf(\""%d\"",P+Q);\n    else if(Q+R<P+R||Q+R<P+Q)\n    printf(\""%d\"",Q+R);\n    else\n    printf(\""%d\"",P+R);\n    return 0;\n}\n",WRONG_ANSWER,14,356
1591661834661584896,262cde49cc56abe96630625fe60c7207e4f635bd56c839389b503b1f360d8ab2,2022-11-13 13:18:47,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\nprintf(\""3\"");\n    return 0;\n}",WRONG_ANSWER,7,328
1591661837413015552,6a4a105e99255cc39ebb6a122c9fdf740e574dbb708100363b339265f92e1bbf,2022-11-13 13:18:48,C,0.0,1591610585635213313,1589906790446387200,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(){\n    int i,q,z,n;\n    int a[n],temp;\n    scanf(\""%d\"",&n);\n    if(n<3||n>100000){\n        printf(\""输入错误\"");\n    }\n    else{\n        for(i=1;i<=n;i++){\n            scanf(\""%d\"",&a[i]);\n            }\n        for(i=1;i<=n;i++){\n            for(z=0;z<n-1;z++){\n                if(a[z]>a[z+1])\n                {\n                    temp=a[z];\n                    a[z]=a[z+1];\n                    a[z+1]=temp;\n                }\n            }\n        }\n    }\n}",WRONG_ANSWER,8,196
1591661857176576000,8f29029dc8006da83949d2656cc7dc83026d851252066fd4a9fc89071673ec96,2022-11-13 13:18:53,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,t=0;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n+1;i++)\n    {\n        if(a[i+1]-a[i]>1)\n            t++;\n        else if(a[i+1]-a[i]==1)\n        {\n            if(a[i+1]-a[i-1]>=1&&(a[i]!=a[i-1]))\n                t++;\n        }\n    }\n    printf(\""%d\"",t);\n    return 0;\n}",WRONG_ANSWER,7,184
1591661862708850688,262cde49cc56abe96630625fe60c7207e4f635bd56c839389b503b1f360d8ab2,2022-11-13 13:18:54,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\nint a,b,c,t,n;\n    scanf(\""%d%d%d\"",&a,&b,&c);\n    if(a>b){\n        t=b;b=a;a=t;\n    }\n    if(b>c){\n        t=b;b=c;c=t;\n    }\n    if(a>b){\n        t=a;a=b;b=t;\n    }\n    scanf(\""%d\"",&n);\n    scanf(\""%d%d%d%d%d%d\"",&d,&e,&f,&g,&h,&i);\n    printf(\""3\"");\n    return 0;\n}",COMPILE_ERROR,0,0
1591661873660190720,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-13 13:18:56,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{ \n    int i,n;\n    int a[100];\n    int sum=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if(a[i]>=a[i-1]&&a[i]>=a[i+1])\n            sum++;\n    }\n    printf(\""%d\"",sum-1);\n    return 0;\n}\n",WRONG_ANSWER,7,496
1591661875627319296,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-13 13:18:57,C,0.0,1591610585635213313,1589906790446387200,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,j,k,temp,flag,sum,m,h;\n    scanf(\""%d\"",&m);\n    for(h=1;h<=m;h++)\n    {\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(k=1;k<=n;k++)\n    {\n        flag=0;\n        for(j=0;j<n-k;j++)\n        {\n          if(a[j]>=a[j+1])\n          { \n               flag=1;\n               temp=a[j+1];\n                a[j+1]=a[j];\n               a[j]=temp;\n            }\n        }\n       if(flag==0);\n            break;\n    }\n    sum=abs(a[0]-a[n-1])+abs(a[n-1]-a[n-2]);\n    if(h<m)\n        printf(\""%d\\n\"",sum);\n    else\n        printf(\""%d\"",sum);\n    }\n    return 0;\n}\n",WRONG_ANSWER,15,324
1591661886314438656,8f30a940fb84c0203b9f96b4d228374f10f9fdcb64182e702cd07fe56f0f3ee3,2022-11-13 13:19:00,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main(){\n\tint a,b,c,n;\n\tscanf(\""%d %d %d\"",&a,&b,&c);\n\tn=a+b;\n\tprintf(\""%d\"",n);\n\t\n} ",WRONG_ANSWER,17,348
1591661910784008192,ddd0edd80a23dfec88d0679f4ed6037779b80d26db4ba0f74fecb3d447de61fa,2022-11-13 13:19:05,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#define Max 100000\nint main(){\n    int n,j=0,i,flag=0;\n    int a[Max];\n    scanf(\""%d\"",&n);\n    while(n){\n        scanf(\""%d\"",&a[j]);\n        n--;\n        j++;\n    }\nfor(i=1;i<j-1;i++)\n{\n    if(a[i]==a[i+1])\n    {\n     i=i+1;\n    }\n    if(a[i]>a[i+1])\n        flag++;\n    if(i+1>=j-2)\n        break;\n}\n    printf(\""%d\"",flag);\n}",WRONG_ANSWER,5,324
1591661914911170560,29d1ea54d6e4e56fc2de0be5ae10ecc4c70c7fca667934b17857e95530f5663a,2022-11-13 13:19:06,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n   int n,a[n],b;\n    int i;\n    scanf(\""%d\"",&n);\n    b=0;\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    int j;\n    for(j=1;j<n-1;j++)\n        if(a[j]<=a[j-1]&&a[j]<a[j+1])\n            b++;\n            printf(\""%d\"",b);\n    return 0;\n}\n",ACCEPTED,30,452
1591661935048011776,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-13 13:19:11,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n = 0, i = 0, j = 0, count = 0;\n    scanf(\""%d\"",&n);\n    int arr[n];\n    for(i = 0;i < n; ++i)\n    {\n        scanf(\""%d\"",&arr[i]);\n    }\n    if(arr[0] == arr[1])\n    {\n         count++;\n    }\n    for(j = 1; j < n-2; ++j)\n    {\n        if((arr[j] < arr[j-1]) && (arr[j] < arr[j+1]))\n        {\n            count++;\n        }\n        if(arr[j] == arr[j+1])\n        {\n            count++;\n        }\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",WRONG_ANSWER,5,328
1591661937543634944,c5cc6f9845df4bd1986af86c0696296436bbc0f00a10a9f891b4100e57bc3a19,2022-11-13 13:19:12,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <string.h>\n#define N 10005\nchar a[N];\nint f(char a[]){\n\tfor(int i=1;i<strlen(a);i++)\n\t{\n\t\tif(a[i]!=a[0]) return 1;\n\t}\n\treturn 0;\n}\nint main()\n{\n\tint i,j;\n\tint n;\n\tscanf(\""%d\"",&n);\n    getchar();\n\tfor(i=0;i<n;i++) {\n\t\tscanf(\""%c\"",&a[i]);\n\t}\n\tchar *p;\n\twhile(strlen(a)>1&&f(a)){\n\t        p=&a[0];\n\t\twhile(*p&&*(p+1)){\n\t\t\tif(*p!=*(p+1)) \n\t\t\t{\n\t\t\t\tstrcpy(p,p+2);\n\t\t\t}\n\t\t\telse p++;\n\t\t}\n\t}\n\tprintf(\""%d\\n\"",n-strlen(a));\n\t\n\t\n\treturn 0;\n}",SEGMENTATION_FAULT,31,384
1591661938613170176,348c6be11ad612e07e8824e376f10ab1994838daea566d3016f2cf5f23051287,2022-11-13 13:19:12,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""60\"");\n    return 0;\n}",ACCEPTED,10,512
1591661987728482304,af559dccfa68c49b94a61e83fc9942ea0513a50e66ecf36dc005df0e7960903e,2022-11-13 13:19:24,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a,b,c;\n    scanf(\""%d\"",&a);\n    scanf(\""%d\"",&b);\n    scanf(\""%d\"",&c);\n    int num=a+b+c;\n    if(num-a<=num-c&&num-a<=num-b){\n        printf(\""%d\\n\"",(num-a));\n    }\n    else if(num-b<=num-a&&num-b<=num-c){\n        printf(\""%d\\n\"",(num-b));\n    }\n    else{\n        printf(\""%d\\n\"",(num-c));\n    }\n    return 0;\n}\n",ACCEPTED,39,348
1591661993818611712,ddd0edd80a23dfec88d0679f4ed6037779b80d26db4ba0f74fecb3d447de61fa,2022-11-13 13:19:25,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#define Max 100000\nint main(){\n    int n,j=0,i,flag=0;\n    int a[Max];\n    scanf(\""%d\"",&n);\n    while(n){\n        scanf(\""%d\"",&a[j]);\n        n--;\n        j++;\n    }\nfor(i=1;i<j-1;i++)\n{\n    if(a[i]==a[i+1])\n    {\n     i=i+1;\n    }\n    if(a[i]>a[i+1])\n        flag++;\n    if(i+1>=j-2)\n        break;\n}\n    printf(\""%d\\n\"",flag);\n}",WRONG_ANSWER,8,200
1591662006187614208,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 13:19:28,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[n],sum=0,i,b=0;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i=b)\n    {\n        if(a[i]>a[i+2])\n        {\n            sum=sum+a[i]-5;\n            b=b+1;\n        }\n        else if(a[i]=a[i+2])\n        {\n                if(a[i+1]>a[i+3])\n                {sum=sum+a[i]-5;\n            b=b+1;}\n                else \n                {sum=sum+a[i+2]-5;\n                 b=b+3;}\n        }\n        else \n        {\n            sum=sum+a[i+2]-5;\n            b=b+3;\n        }\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,9,324
1591662041772089344,acf80eea856463058b81f71c0238069795893092293fbd098cc594959df6444e,2022-11-13 13:19:37,Python,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"P,Q,R=(input()).split()\nP=int(P)\nQ=int(Q)\nR=int(R)\nmin=0\nif P+Q<Q+R:\n    if P+Q<P+R:\n        min=P+Q\n    else:\n        min=P+R\nelse:\n    if Q+R<P+R:\n        min=Q+R\n    else:\n        min=P+R\nprint(min)",ACCEPTED,85,2884
1591662058243108864,63a19c717d077fecd1be96314929ebf3516f35619209eacac77081bb07edebb5,2022-11-13 13:19:40,C,300.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include<math.h>\n#include<string.h>\nint main()\n{\n    int sum,n,a,b,i,j;\n    int c[100];\n    int f[100];\n    float sum1=0,sum2=0;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    for(i=1;i<=n;i++)\n        scanf(\""%d\"",&c[i]);\n    for(j=1;j<=n;j++)\n        scanf(\""%d\"",&f[j]);\n    for(i=1;i<=n;i++)\n    {\n        sum1+=c[i]/(float)(f[i]+1)*pow(a,f[i]+1);\n\n    }\n    for(j=1;j<=n;j++)\n    {\n        sum2+=c[j]/(float)(f[j]+1)*pow(b,f[j]+1);\n    }\n    sum=(sum1-sum2);\n    printf(\""%d\"",sum);\n\n\n\n\n}\n",ACCEPTED,39,352
1591662081559244800,505c5b9a1b6d591a815315d95a57743fb98dad691b51421b4de282392fef3f43,2022-11-13 13:19:46,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    if(P+Q>Q+R)\n    {\n        printf(\""%d\"",Q+R);\n    }\n    if(P+R>Q+R)\n    {\n        printf(\""%d\"",Q+R);\n    }\n    else if(Q+R>P+Q)\n    {\n        printf(\""%d\"",P+Q);\n    }\n    if(Q+R>P+R)\n    {\n        printf(\""%d\"",P+R);\n    }\n}\n",WRONG_ANSWER,5,328
1591662081584422912,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-13 13:19:46,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<iostream>\nusing namespace std;\nint max(int a,int b){\n    return a>b?b:a;\n}\nint main(){\n    int P,Q,R;\n    cin>>P>>Q>>R;\n    if(P>=1&&P<=1000&&Q>=1&&Q<=1000&&R>=1&&R<=1000)\n        cout<<max(P,Q)+max(P,R)<<endl;\n    return 0;\n}",WRONG_ANSWER,5,324
1591662096310624256,e7f8e9ba366feb4551b7dc8e6a149f796e822980a43de4fcc91ded552c4bcbd4,2022-11-13 13:19:50,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main(int argc, char *argv[]) {\n\tint P,Q,R,F,G,H,c=0; \n\tif(scanf(\""%d\"",&P)){}\n\tif(scanf(\""%d\"",&Q)){}\n\tif(scanf(\""%d\"",&R)){}\n\tF=P+Q; \n\tG=Q+R; \n\tH=R+P;\n\tif(F<G<H&&F<H<G)\n\t  c=F; \n\t  \n\telse if(G<F<H&&G<H<F) \n\t  c=G;\n\t  \n\telse if(H<G<F&&H<F<G) \n\t  c=H;\n\t  \n\tprintf(\""%d\"",c);\n\treturn 0;\n\t\n}\n",WRONG_ANSWER,16,384
1591662114388074496,59415347d1cfa3163c0a25f108652369803ee9c4d72f5c59e4212aabab93e388,2022-11-13 13:19:54,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main(int argc, char *argv[]) {\n\tint a[10];\n\tint n = 0,m = 0,number = 0,number1 = 0,b,i;\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&m);\n\t\ta[i] = m;\n\t}\n\tfor(i=1;i<n;i++){\t\t\t\n\t\tif(a[i]<=a[i+1]&&a[i]<=a[i-1]){\n\t\t\tnumber++;\n\t\tif(a[i]==a[i+1])\n\t\t\tnumber1++;\t\t\n\t\t}\t\t\n\t}\n\tif(a[n-1]<a[n-2]){\n\t\tb = 1;\n\t}\n\tint sum = number-number1-b;\t\n\tprintf(\""%d\"",sum);\n\treturn 0;\n}",RUNTIME_ERROR,6,328
1591662116447477760,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-13 13:19:54,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    if(1<=P,Q,R<=pow(10,3)){\n    if(P+Q<P+R||P+Q<Q+R)\n    printf(\""%d\"",P+Q);\n    else if(Q+R<P+R||Q+R<P+Q)\n    printf(\""%d\"",Q+R);\n    else\n    printf(\""%d\"",P+R);}\n    return 0;\n}\n",WRONG_ANSWER,8,200
1591662142645088256,6a835d762a87e93baf4142897168374dc31e9da90b86c19ed82f21159b644272,2022-11-13 13:20:01,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nmain()\n{\n    int p,q,r,x,i;\n    i=5;\n    for(x=0;x<i;x++)\n    scanf(\""%d%d%d\"",&p,&q,&r);\n    if(p=0)\n        x=q+r;\n    if(r=0)\n        x=q+p;\n     else if(q=0)\n        x=p+r;\n    printf(\""%d\"",x);\n}\n",WRONG_ANSWER,5,352
1591662143379103744,262cde49cc56abe96630625fe60c7207e4f635bd56c839389b503b1f360d8ab2,2022-11-13 13:20:01,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    printf(\""15\"");\n    return 0;\n}",WRONG_ANSWER,5,216
1591662149548924928,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-13 13:20:02,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main(){\n    int i,n,count=0,h[999];\n    scanf(\""%d\\n\"",&n);\n    for(i=i;i<n;i++){\n         scanf(\""%d\"",&h[i]);\n    }\n    for(i=1;i<n-1;i++){\n        if(h[i]<h[i-1]&&h[i]<=h[i+1]){\n            count++;\n        }\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",ACCEPTED,46,512
1591662158180790272,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-13 13:20:04,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n\nint main() {\n\t     int n,zhan,i,j;\n\t\t scanf(\""%d\"",&n); \n\t\t int a[100];\n\t\t for(i=0;i<n;i++)\n\t\t {\n\t\t scanf(\""%d\"",&a[i]);\n\t     }\n\t\tfor(i=0;i<n;i++)\t\n\t\t{\t\n\t\tfor(j=1;j<n;j++)\n\t\t{\n\t\t\tif(a[i]>a[i+1])\n\t\t\t{\n\t\t\tif(a[i+1]<a[i+j])\n\t\t\tzhan++;\n\t\t\tbreak;\n\t\t\t}\n\t\t\telse i++;\n\t\t}\n\t\t\n\t\t}\n\t\tprintf(\""%d\"",zhan);\t\n\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                   \n",WRONG_ANSWER,5,348
1591662164916842496,5b382280d947e26011a7c75c34d257662bc13c50f8257bc8cae807604d61430c,2022-11-13 13:20:06,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\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\tint n,i;\n\tint count=0;\n\tint a[100];\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=1;i<n-1;i++){\n\tif((a[i]<a[i-1]||a[i]==a[i-1])&&(a[i]<a[i+1]))\n\t{\n\t\tcount++;\n\t}\n\t}\n\tprintf(\""%d\\n\"",count);\n\treturn 0;\n}",RUNTIME_ERROR,47,512
1591662169924853760,281adcca8943f9f4c0ced14f1ceffe157a34fca39f3cb864eb95e400944e38a8,2022-11-13 13:20:07,Java,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"\nimport java.awt.List;\nimport java.lang.reflect.Array;\nimport java.util.Arrays;\nimport java.util.Scanner;\n\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner scan=new Scanner(System.in);\n\t\tint n=scan.nextInt();\n\t\tint a=scan.nextInt();\n\t\tint b=scan.nextInt();\n\t\tint[] c=new int[n];\n\t\tint[] f=new int[n];\n\t\tfor(int i=0;i<n;i++){\n\t\t\tc[i]=scan.nextInt();\n\t\t}\n\t\tfor(int i=0;i<n;i++){\n\t\t\tf[i]=scan.nextInt();\n\t\t}\n\t\tint anser=0;\n\t\tanser=sub(n, c, f, a)-sub(n, c, f,b);\n\t\n\t\tSystem.out.print(anser);\n\t}\n\tpublic static int sub(int n,int[] c,int[] f,int a){\n\t\tint ans=0;\n\t\tfor(int i=0;i<n;i++){\n\t\tans+=(int) ((c[i]/(f[i]+1))*Math.pow(a, f[i]+1));\n\t\t}\n\t\treturn ans;\n\t}\n\n}\n",WRONG_ANSWER,101,24296
1591662170151346176,5a1c17b308a3b3595833d34c6bdfb75e9f5dd0d065acfeb7f28ab8102ba7406c,2022-11-13 13:20:07,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a[10];\n    int i,n;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    int count = 0;\n    for(i=0;i<n;i++){\n        if(a[i]<a[i-1]&&a[i]<a[i+1]){\n            if(i!=0&&i!=n-1){\n            count++;\n            }\n        }\n        while(a[i]==a[i+1]){\n            if(a[i+1]<a[i+2]){\n                count = count+1;\n                break;\n            }\n            i++;\n        }\n    }\n    printf(\""%d\"",count);\n    return 0;\n}\n",RUNTIME_ERROR,11,384
1591662185494110208,efa7a60e7fa0d7fd13e87b47555eb8bfc0c4da0695990711fb851b886de3de22,2022-11-13 13:20:11,C++,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int a,b,c;\n    int sum;\n    scanf(\""%d%d%d\"",&a,&b,&c);\n    if(a<b)\n    {\n        if(c<=b)\n        {\n            sum=a+c;\n            printf(\""%d\\n\"",sum);\n            return 0;\n        }\n        else{\n            sum=a+b;\n            printf(\""%d\\n\"",sum);\n            return 0;\n        }\n    }\n    if(a>b)\n    {\n        if(c<=a)\n        {\n            sum=b+c;\n            printf(\""%d\\n\"",sum);\n            return 0;\n        }\n        else{\n            sum=b+a;\n            printf(\""%d\\n\"",sum);\n            return 0;\n        }\n    }\n    else\n    {\n        sum=a+c;\n        printf(\""%d\\n\"",sum);\n        return 0;\n    }\n}",ACCEPTED,27,512
1591662200077705216,0cfbb4a339ebbc4dce13b5f3e3f98a3def0ab17ef5b4ac8e6d566de92e1f5f78,2022-11-13 13:20:14,C,300.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n;\n    int h[1000001]={0};\n    int s[1000001]={0};\n    int count=0;\n    int max=0;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        scanf(\""%d\"",&h[i]);\n    }\n    for(int i=0;i<n;i++){\n        count=0;\n        for(int j=i;j<n;j++){\n            if(h[i]>h[j]){\n                break;\n            }\n            count++;\n\n        }\n        for(int k=i;k>=0;k--){\n            if(h[i]>h[k]){\n                break;\n            }\n            count++;\n\n        }\n        s[i]=(count-1)*h[i];\n    }\n    for(int i=0;i<n;i++){\n        if(s[i]>max){\n            max=s[i];\n        }\n    }\n    printf(\""%d\\n\"",max);\n}",ACCEPTED,54,8300
1591662215969910784,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-13 13:20:18,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,e,i;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<n-1;i++)\n    if(a[i]<a[i+1])\n    e++;\n    e=e-1;\n    printf(\""%d\"",e);\n    return 0;\n}",WRONG_ANSWER,6,512
1591662260643454976,25584884fd716238437f89484285121d106c1090916ab683be624f210130ebad,2022-11-13 13:20:29,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n   int i,P,Q,R,sum1,sum2,sum3,min;\n   scanf(\""%d %d %d\"",&P,&Q,&R);\n   sum1=P+Q;sum2=R+Q;sum3=P+R;\nint a[4]={sum1,sum2,sum3};\nfor(i=0;i<4;i++)\n{\n    min=a[0];\n    if(a[i]<min)\n        printf(\""%d\"",min);\n}\nreturn 0;\n}\n\n\n\n",WRONG_ANSWER,17,324
1591662270974013440,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 13:20:31,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"n=eval(input())\na=[0]*n\nx=0\nnum=0\nlist = map(int.input().split())\nfor i in list:\n    a[x] = i\n    x = x+1\n    for j in range(1,n-1):\n        for(a[j]<a[j-1] and a[j]<a[j+1]) or (a[j]<a[j-1] and a[j] == a[j+1]):\n            num=num+1\n            print(num)",NON_ZERO_EXIT_CODE,16,2764
1591662278909648896,6b02dfcf297d52c2de2e1416b33ee988ff909834c73207b147423a8301e9d174,2022-11-13 13:20:33,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main()\n{   int n;\nint k;\nint i; \n int *p;\n\n \n scanf(\""%d/n\"",&n);\n   for(i=0;i<n;i++);\n   {\n   \tscanf(\""%d\"",&a[i]);\n   }\n  for(i=0;i<n;i++){\n  \n   while(a[i]!=a[i+1])\n   {\n   \tk=1;\n   \tk+=k;\n   }\n}\n     printf(\""%d\"",k);\n     return 0;\n}\n",COMPILE_ERROR,0,0
1591662282286063616,7c6d208c4c4b695bc8d6f8ae0c0357c2466f5c9f86ec0652674812219ac09d38,2022-11-13 13:20:34,Java,0.0,1591610585639407617,1591132482555211776,1049226928954454016,import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt();\n\t    int[] arr = new int[a];\n\t    int[] brr = new int[a];\n\t    for (int i = 0; i < a; i++) {\n\t\t\tint b = sc.nextInt();\n\t\t\tarr[i] = b;\n\t\t}\n\t    Arrays.sort(arr);\n\t    for (int i = 0; i < a; i++) {\n\t    \tbrr[i] = arr[i]*(a-i);\n\t\t}\n\t    Arrays.sort(brr);\n\t\tSystem.out.println(brr[a-1]);\n\t\t\n\t}\n\n}\n,WRONG_ANSWER,113,25280
1591662285809278976,e7e6ce2c6e9e530eaf2b9b9968748a0e44e3ac7183d73deb51851946350bfbb0,2022-11-13 13:20:35,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    char a[10];\n    int n;\n //   int r;      //循环变量;\n    int flag=0;\n    int i,k,l,j;\n    scanf(\""%d\"",&n); //n代表字符串长度\n\n    for(i=0;i<=n;i++)\n    {\n        scanf(\""%c\"",&a[i]);\n    }\n\n\n    i=0;j=1;\n    k=a[i];\n    l=a[j];\n\n  do {\n        if(k==l) {\n            i=j;\n            j++;\n        }\n        else\n        {\n            flag=flag+2;\n            i--;\n            j++;\n        }\n\n    }while(flag!=n||a[10]==0);\n\n    printf(\""%d\"",flag);\n    return 0;\n}",RUNTIME_ERROR,5,328
1591662288858525696,6a6dc7e644e57bb2c20b20d39bd4d9541bdebf6415e03e7c13707572c054673e,2022-11-13 13:20:35,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{  int m,n,a,b;\n   scanf(\""%d %d %d\"",&n,&a,&b);\n    m=n+a;\n    printf(\""%d\"",m);\n    return 0;\n}\n\n\n",WRONG_ANSWER,10,320
1591662329262268416,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-13 13:20:45,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n = 0, i = 0, j = 0, count = 0;\n    scanf(\""%d\"",&n);\n    int arr[n];\n    for(i = 0;i < n; ++i)\n    {\n        scanf(\""%d\"",&arr[i]);\n    }\n    if(arr[0] == arr[1])\n    {\n         count++;\n    }\n    for(j = 1; j < n-2; ++j)\n    {\n        if((arr[j] < arr[j-1]) && (arr[j] < arr[j+1]))\n        {\n            count++;\n        }\n        else if(arr[j] == arr[j+1])\n        {\n            count++;\n        }\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",WRONG_ANSWER,4,196
1591662340259766272,6a835d762a87e93baf4142897168374dc31e9da90b86c19ed82f21159b644272,2022-11-13 13:20:48,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nmain()\n{\n    int p,q,r,x,i;\n    i=3;\n    for(x=0;x<i;x++)\n    scanf(\""%d%d%d\"",&p,&q,&r);\n    if(p=i)\n        x=q+r;\n    if(r=i)\n        x=q+p;\n     else if(q=i)\n        x=p+r;\n    printf(\""%d\"",x);\n}\n",WRONG_ANSWER,5,324
1591662360920907776,0c2907a154c1c61744366e94f73ae426665222ffae8eff7042dd0fd7bd8760fb,2022-11-13 13:20:53,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{int n,i;\nscanf(\""%d\"",&n);\nint a[n];\nint count=0;\nfor(i=0;i<n;i++)\n scanf(\""%d\"",&a[i]);\nfor(i=0;i<n;i++)\nif((a[i+1]>a[i]&&a[i-1]>a[i])&&n-1>i&&&i>0)\n    count++;\n\nprintf(\""%d\"",count);\n    return 0;\n}\n",WRONG_ANSWER,13,356
1591662364431507456,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 13:20:53,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"n=eval(input())\na=[0]*n\nx=0\nnum=0\nlist = map(int.input().split())\nfor i in list:\na[x] = i\nx = x+1\nfor j in range(1,n-1):\nfor(a[j]<a[j-1] and a[j]<a[j+1]) or (a[j]<a[j-1] and a[j] == a[j+1]):\nnum=num+1\nprint(num)",NON_ZERO_EXIT_CODE,26,2816
1591662364716707840,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-13 13:20:54,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <math.h>\n#include <stdio.h>\nint main()\n{\n    int a,b,c,min;\n    scanf(\""%d\"",&a);\n    scanf(\""%d\"",&b);\n    scanf(\""%d\"",&c);\n    if(a>b&&a>c) min=b+c;\n    if(b>a&&b>c) min=a+c;\n    if(c>b&&c>a) min=a+b;\n    printf(\""%d\\n\"",min);\n    return 0;\n}",ACCEPTED,46,512
1591662370525863936,2e4af98c441106efa9ee51f8a781d0eee91a3dff6193987d421eb3a48725c814,2022-11-13 13:20:55,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <iostream>\n\n\nint main(){\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint *arr = new int[n];\n\tfor(int i =0;i<n;i++){\n\t\tscanf(\""%d\"",&arr[i]);\n\t}\n\tint f=0;//0 init 1 lise -1 drap;\n\tint t=arr[0];\n\tint num =0;\n\tf = arr[0]>arr[1]?-1:1; \n\tfor(int i=1;i<n;i++){\n\t\tif(f==1&&arr[i]>arr[i+1]){\n\t\t\tnum++;\n\t\t\tf = arr[i]>arr[i+1]?-1:1; \n\t\t}\n\t\tif(f==-1&&arr[i]<arr[i+1]){\n\t\t\tnum++;\n\t\t\tf = arr[i]<arr[i+1]?-1:1; \n\t\t}\n\t\n\t}\n\tprintf(\""%d\"",num-1);\n\t\n}",WRONG_ANSWER,5,320
1591662379816214528,00d0a1b2e987c17fb50850b9ec54bf6b4f8b997eb053d1a9fed6c4888fbe74ed,2022-11-13 13:20:57,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,i,j,a[n],max=0,min,flag;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        flag=0\n        for(j=i;j<n;j++)\n        {\n            if (a[i]<a[j+1])\n                flag=flag+1;\n            min=a[i]*flag;\n            if(max>min)\n                max=min;\n    }\n        printf(\""%d\"",max);\n        return 0;\n}",COMPILE_ERROR,0,0
1591662414188568576,919e6449799ef04f53dc21ab8608e866aab38f956abcadede4200c4c63859f1b,2022-11-13 13:21:05,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a=60;\n    printf(\""%d\"",a);\n    return 0;\n}",ACCEPTED,8,192
1591662417871134720,28b4de6882b7ade2679f59c486acaf307ce8415dcb0a15787dba589025bbdb02,2022-11-13 13:21:06,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint n,i,j,k=0;\n\n\tscanf(\""%d\"",&n);\n\tgetchar();\n\tchar num[n+1];\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%c\"",&num[i]);\n\t}\n\tfor(i=0;i<n-1;i++)\n\t{\n\t\tif(num[i]!=num[i+1])\n\t\t{\n\t\t\tk=k+2;\t\n\t\t\tfor(j=i+2;j<n;j++)\n\t\t\t{\n\t\t\t\tnum[j-2]=num[j];\n\t\t\t}\n\t\t\tif(i==0)\n\t\t\ti=i-1;\n\t\t\telse\n\t\t\ti=i-2;\n\t\t\tn=n-2;\n\t\t}\n\n\t}\n\tprintf(\""%d\\n\"",k);\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,442,512
1591662423164346368,6a835d762a87e93baf4142897168374dc31e9da90b86c19ed82f21159b644272,2022-11-13 13:21:07,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nmain()\n{\n    int p,q,r,x,i;\n    i=3;\n    for(x=0;x<i;x++)\n    scanf(\""%d%d%d\"",&p,&q,&r);\n    if(p=i)\n        x=q+r;\n     else if(q=i)\n        x=p+r;\n    printf(\""%d\"",x);\n}\n",WRONG_ANSWER,8,476
1591662426075181056,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-13 13:21:08,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n    int P,Q,R;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    if(1<=P,Q,R<=pow(10,3)){\n    if(P+Q<P+R||P+Q<Q+R)\n    printf(\""%d\"",P+Q);\n    else if(Q+R<P+R||Q+R<P+Q)\n    printf(\""%d\"",Q+R);\n    else\n    printf(\""%d\"",P+R);}\n    return 0;\n}\n",WRONG_ANSWER,13,320
1591662438058319872,9a1ecd1db02b268060006afd7de34ec54e74e90bf61becbb6811fb23971c4720,2022-11-13 13:21:11,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,def iss(x):\n    if x==2:\n        if s[0]!=s[1]:\n            s.clear()\n        else:\n            return\n    elif x==1:\n         return\n    elif x==3:\n        if s[0]!=s[1] or s[1]!=s[2]:\n            s.pop(0)\n            s.pop(1)\n            return\n    for i in range(x-2):\n        if s[i]!=s[i+1]:\n            s.pop(i)\n            s.pop(i+1)\n            l=len(s)\n            return iss(l)\n\nn=int(input())\ns=list(input())\nl=n\niss(l)\nl=len(s)\nprint(n-l)\n\n,NON_ZERO_EXIT_CODE,139,4828
1591662444035235840,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 13:21:12,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,a[100];\n    int i;\n    int t=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[n]);\n    }\n    for(i=0;i<n;i++)\n    {\n     if(a[i+1]=a[i])\n            t=t;\n    }\n    i=\n    for(i=0;i<n;i++)\n    {\n     if(a[i]>a[0])\n            i=i;\n      break;\n    }\n    i;\n    for(i=i+1;i<n;i++)\n    {\n        if(a[i+1]>a[i])\n            t=t+1;\n        if(a[i+1]==a[i])\n        {\n            if(i==n-1)\n                t=t;\n            if(a[i+1]>a[i])\n                t=t+1;\n        }\n    }\n    printf(\""%d\"",t);\n    return 0;\n}",COMPILE_ERROR,0,0
1591662455842168832,e7f8e9ba366feb4551b7dc8e6a149f796e822980a43de4fcc91ded552c4bcbd4,2022-11-13 13:21:15,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main() {\n\tint P,Q,R,F,G,H,c=0; \n\tif(scanf(\""%d\"",&P)){}\n\tif(scanf(\""%d\"",&Q)){}\n\tif(scanf(\""%d\"",&R)){}\n\tF=P+Q; \n\tG=Q+R; \n\tH=R+P;\n\tif(F<G<H&&F<H<G)\n\t  c=F; \n\t  \n\telse if(G<F<H&&G<H<F) \n\t  c=G;\n\t  \n\telse if(H<G<F&&H<F<G) \n\t  c=H;\n\t  \n\tprintf(\""%d\\n\"",c);\n\treturn 0;\n\t\n}\n",WRONG_ANSWER,12,196
1591662476218085376,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 13:21:20,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[n],sum=0,i,b=0;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i=b)\n    {\n        if(a[i]>a[i+2])\n        {\n            sum=sum+a[i]-5;\n            b=b+1;\n        }\n        else if(a[i]=a[i+2])\n        {\n            for(i=0;i<n;i=b)\n            {if(a[i+1]>a[i+3])\n                {sum=sum+a[i]-5;\n            b=b+1;}\n                else \n                {sum=sum+a[i+2]-5;\n                 b=b+3;}\n            }\n        }\n        else \n        {\n            sum=sum+a[i+2]-5;\n            b=b+3;\n        }\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,5,328
1591662476780134400,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 13:21:20,C,0.0,1591610585635213314,1591128862958940160,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a,c,i;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a-1;i++)\n        scanf(\""%d\"",&i);\n    printf(\""5 3 2 1 1\\n\"");\n    return 0;\n}",WRONG_ANSWER,6,200
1591662479598739456,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-13 13:21:21,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main(){\n\tint n,i,j;\n\tscanf(\""%d\"",&n);\n\tint m;\n\tm=n;\n\tchar a[n];\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%c\"",&a[i]);\n\t}\n\tfor(i=0;i<n;i++){\n\t\tif(a[i]!=a[i+1]){\n\t\t\tfor(j=i;j<n-2;j++){\n\t\t\t\ta[j]=a[j+2];\n\t\t\t}\n\t\t\tn-=2;\n\t\t\ti=-1;\n\t\t}\n\t}\t\n\tint d;\n\td=m-n;\n\tprintf(\""%d\\n\"",d);\n}",TIME_LIMIT_EXCEEDED,427,624
1591662488180252672,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 13:21:23,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"n = eval(input())\na = [0]*n\nx = 0\nnum = 0\nlist = map(int,input().split())\nfor i in list:\na[x] = i\nx = x+1\nfor j in range(1,n-1):\nfor(a[j]<a[j-1] and a[j]<a[j+1]) or (a[j]<a[j-1] and a[j] == a[j+1]):\nnum=num+1\nprint(num)",NON_ZERO_EXIT_CODE,17,2888
1591662501392343040,28b4de6882b7ade2679f59c486acaf307ce8415dcb0a15787dba589025bbdb02,2022-11-13 13:21:26,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint n,i,j,k=0;\n\n\tscanf(\""%d\"",&n);\n\tgetchar();\n\tchar num[n+1];\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%c\"",&num[i]);\n\t}\n\tfor(i=0;i<n-1;i++)\n\t{\n\t\tif(num[i]!=num[i+1])\n\t\t{\n\t\t\tk=k+2;\t\n\t\t\tfor(j=i+2;j<n;j++)\n\t\t\t{\n\t\t\t\tnum[j-2]=num[j];\n\t\t\t}\n\t\t\tif(i==0)\n\t\t\ti=i-1;\n\t\t\telse\n\t\t\ti=i-2;\n\t\t\tn=n-2;\n\t\t}\n\t}\n\tprintf(\""%d\\n\"",k);\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,427,352
1591662501966917632,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-13 13:21:26,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"int main()\n{\n\tint n,num=0;\n\tscanf(\""%d\"",&n);\n\tint i,a[n];\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=1;i<n-1;i++)\n\t{\n\t\tif(a[i]<a[i-1]&&a[i]<=a[i+1])\n\t\t{\n\t\t\tnum+=1;\n\t\t}\t\n\t}\n\tprintf(\""%d\"",num);\n\treturn 0;\n}",ACCEPTED,46,484
1591662511068602368,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-13 13:21:28,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n\nint main() {\n\t     int n,zhan,i,j;\n\t\t scanf(\""%d\"",&n); \n\t\t int a[10000];\n\t\t for(i=0;i<n;i++)\n\t\t {\n\t\t scanf(\""%d\"",&a[i]);\n\t     }\n\t\tfor(i=0;i<n;i++)\t\n\t\t{\t\n\t\tfor(j=1;j<n;j++)\n\t\t{\n\t\t\tif(a[i]>a[i+1])\n\t\t\t{\n\t\t\tif(a[i+1]<a[i+j])\n\t\t\tzhan++;\n\t\t\tbreak;\n\t\t\t}\n\t\t\telse i++;\n\t\t}\n\t\t\n\t\t}\n\t\tprintf(\""%d\"",zhan);\t\n\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                   \n",WRONG_ANSWER,4,200
1591662534984491008,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 13:21:34,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,a[100];\n    int i;\n    int t=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[n]);\n    }\n    for(i=0;i<n;i++)\n    {\n     if(a[i+1]=a[i])\n            t=t;\n    }\n    for(i=0;i<n;i++)\n    {\n     if(a[i]>a[0])\n            i=i;\n      break;\n    }\n    \n    i=i;\n    for(i=i+1;i<n;i++)\n    {\n        if(a[i+1]>a[i])\n            t=t+1;\n        if(a[i+1]==a[i])\n        {\n            if(i==n-1)\n                t=t;\n            if(a[i+1]>a[i])\n                t=t+1;\n        }\n    }\n    printf(\""%d\"",t);\n    return 0;\n}",WRONG_ANSWER,8,196
1591662544077774848,20033d4bfe54ea16777c218f33d3af83aed121eb1b058daa8e84687ea80be80b,2022-11-13 13:21:36,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"n=int(input())\nlist=input().split()\nc=0\nfor i in range(1,n-1):\n    if int(list[i+1])>int(list[i]) and int(list[i-1])>int(list[i]):\n        c+=1\n    if int(list[i+1])==int(list[i]) and int(list[i-1])>int(list[i]) and int(list[i+2])>int(list[i]):\n        c+=1\nprint(c)",WRONG_ANSWER,97,2820
1591662557293993984,6a835d762a87e93baf4142897168374dc31e9da90b86c19ed82f21159b644272,2022-11-13 13:21:39,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nmain()\n{\n    int p,q,r,x,i;\n    i=3;\n    for(x=0;x<100;x++)\n    scanf(\""%d%d%d\"",&p,&q,&r);\n    if(p=i)\n        x=q+r;\n     else if(q=i)\n        x=p+r;\n    printf(\""%d\"",x);\n}\n",WRONG_ANSWER,6,196
1591662564818563072,00d0a1b2e987c17fb50850b9ec54bf6b4f8b997eb053d1a9fed6c4888fbe74ed,2022-11-13 13:21:41,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,i,j,a[n],max=0,min,flag;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        flag=0;\n        for(j=i;j<n;j++)\n        {\n            if (a[i]<a[j+1])\n                flag=flag+1;\n            min=a[i]*flag;\n            if(max>min)\n                max=min;\n        }\n    \n    }\n        printf(\""%d\"",max);\n        return 0;\n}",SEGMENTATION_FAULT,8,200
1591662568966742016,7ecf54bf0ea2db8ab0397aa941f19ec79a351bc3e86e8c01673aa09a69b3a6db,2022-11-13 13:21:42,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n\tint n,sum=0,f=0;\n\tscanf(\""%d\"",&n);\n\tint s[n];\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&s[i]);\n\t}\n\tfor(int i=1;i<n;i++)\n\t{\n\t\tswitch(f)\n\t\t{\n\t\t\tcase 0:\n\t\t\t\tif(s[i]>s[i+1])f=1;  //入坑\n\t\t\t\tbreak;\n\t\t\tcase 1:\n\t\t\t\tif(s[i]<s[i+1])f=2;  //爬坡\n\t\t\t\tbreak;\n\t\t\tcase 2:\n\t\t\t\tif(s[i]>s[i+1])f=0;  //已经过了一个坑，记录下来\n                if(s[i]>s[i+1])f=1;  //如果正好入坑，需要调整状态\n\t\t\t\tsum++;\n\t\t\t\tbreak; \n\t\t}\n\t\t\n\t}\n\tprintf(\""%d\\n\"",sum);\n}\n\n",WRONG_ANSWER,4,336
1591662620460199936,00d0a1b2e987c17fb50850b9ec54bf6b4f8b997eb053d1a9fed6c4888fbe74ed,2022-11-13 13:21:55,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,i,j,a[n],max=0,min,flag;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        flag=0;\n        for(j=i;j<n;j++)\n        {\n            if (a[i]<a[j+1])\n                flag=flag+1;\n            min=a[i]*flag;\n            if(max>min)\n                max=min;\n        }\n    \n    }\n        printf(\""%d\"",max);\n        return 0;\n}",WRONG_ANSWER,8,200
1591662624906174464,59415347d1cfa3163c0a25f108652369803ee9c4d72f5c59e4212aabab93e388,2022-11-13 13:21:56,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main(int argc, char *argv[]) {\n\tint a[10];\n\tint n = 0,m = 0,number = 0,number1 = 0,b,i;\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&m);\n\t\ta[i] = m;\n\t}\n\tfor(i=1;i<n;i++){\t\t\t\n\t\tif(a[i]<=a[i+1]&&a[i]<=a[i-1]){\n\t\t\tnumber++;\t\t\n\t\t}\t\t\n\t}\n\tfor(i=1;i<n;i++){\t\t\t\n\t\tif(a[i]==a[i+1])\n\t\t\tnumber1++;\t\t\n\t\t}\n\tif(a[n-1]<a[n-2]){\n\t\tb = 1;\n\t}\n\tint sum = number-number1-b;\t\n\tprintf(\""%d\"",sum);\n\treturn 0;\n}",RUNTIME_ERROR,8,372
1591662631239561216,5a1c17b308a3b3595833d34c6bdfb75e9f5dd0d065acfeb7f28ab8102ba7406c,2022-11-13 13:21:57,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a[10];\n    int i,n;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    int count = 0;\n    for(i=0;i<n;i++){\n        if(a[i]<a[i-1]&&a[i]<a[i+1]){\n            if(i!=0&&i!=n-1){\n            count++;\n            }\n        }\n        while(a[i]==a[i+1]){\n            if(i!=0&&i!=n-1){\n            if(a[i+1]<a[i+2]){\n                count = count+1;\n                break;\n            }\n            i++;\n        }\n        }\n    }\n    printf(\""%d\"",count);\n    return 0;\n}\n",RUNTIME_ERROR,6,196
1591662651695226880,c47b15e117166a3dd00078b9f795673d5284a2761e582479119229751cc734d3,2022-11-13 13:22:02,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#define S 10000\n\n\nint main()\n{\n    int a=0,n,i,j,k;\n    int s[S];\n    int m[S];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&s[i]);\n    for(i=0;i<n;i++)\n    {\n        k=1;\n        for(j=i;j<n;j++)\n        if(s[i]<=s[j])\n        m[i]=s[i]*(k++);\n        else break;\n    }\n    for(i=0;i<n;i++)\n    {\n        if(a<=m[i])\n            a=m[i];\n    }\n\n    printf(\""%d\\n\"",a);\n\n\n\n    return 0;\n}",WRONG_ANSWER,21,372
1591662676093448192,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-13 13:22:08,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n , i, j , count;\n    scanf(\""%d\"",&n);\n    int arr[n];\n    for(i = 0;i < n; ++i)\n    {\n        scanf(\""%d\"",&arr[i]);\n    }\n    if(arr[0] == arr[1])\n    {\n         count++;\n    }\n    for(j = 1; j < n-2; ++j)\n    {\n        if((arr[j] < arr[j-1]) && (arr[j] < arr[j+1]))\n        {\n            count++;\n        }\n        else if(arr[j] == arr[j+1])\n        {\n            count++;\n        }\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",WRONG_ANSWER,7,492
1591662682594631680,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 13:22:09,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"n = eval(input())\na = [0]*n\nx = 0\nnum = 0\nlist = map(int,input().split())\nfor i in list:\na[x] = i\nx = x+1\nfor j in range(1,n-1):\nfor (a[j]<a[j-1] and a[j]<a[j+1]) or (a[j]<a[j-1] and a[j] == a[j+1]):\nnum = num+1\nprint(num)",NON_ZERO_EXIT_CODE,15,2752
1591662699241824256,9a1ecd1db02b268060006afd7de34ec54e74e90bf61becbb6811fb23971c4720,2022-11-13 13:22:13,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,def iss(x):\n    if x==2:\n        if s[0]!=s[1]:\n            s.clear()\n        else:\n            return 0\n    elif x==1:\n         return 0\n    elif x==3:\n        if s[0]!=s[1] or s[1]!=s[2]:\n            s.pop(0)\n            s.pop(1)\n            return 0\n    for i in range(x-2):\n        if s[i]!=s[i+1]:\n            s.pop(i)\n            s.pop(i+1)\n            l=len(s)\n            return iss(l)\n\nn=int(input())\ns=list(input())\nl=n\niss(l)\nl=len(s)\nprint(n-l)\n\n,NON_ZERO_EXIT_CODE,129,5036
1591662713741520896,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-13 13:22:17,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int N=10005;\nint a[N];\nint main(){\n\tint n;\n\tint cnt=0;\n    cin>>n;\n    for(int i=1;i<=n;i++)\n    cin>>a[i];\n    for(int i=3;i<n;i++){\n    \tif(a[i]<a[i-1]&&a[i]<a[i+1])\n    \tcnt++;\n    \tif(a[i]<a[i-1]&&a[i]==a[i+1]&&a[i+1]<a[i+2])\n    \tcnt++;\n    \tif(a[i]<a[i-1]&&a[i]==a[i+1]&&a[i+1]==a[i+2]&&a[i+2]<a[i+3])\n    \tcnt++;\n    \tif(a[i]<a[i-1]&&a[i]==a[i+1]&&a[i+1]==a[i+2]&&a[i+2]==a[i+3]&&a[i+3]<a[i+4])\n    \tcnt++;\nif(a[i]<a[i-1]&&a[i]==a[i+1]&&a[i+1]==a[i+2]&&a[i+2]==a[i+3]&&a[i+3]==a[i+4]&&a[i+4]<a[i+5])\n    \tcnt++;\n    }\n    sort(a+1,a+n+1);\n    if(a[3]==a[n-2])\n    cnt++;\n    cout<<cnt;\n\treturn 0;\n} ",WRONG_ANSWER,32,640
1591662720192372736,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-13 13:22:18,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"list1 = []\nlist1 = input().split(\"" \"")\na=int(list1[0])\nb=int(list1[1])\nc=int(list1[2])\nif a>b>c:\n    print(b+c)\nif b>c>a:\n    print(c+a)\nelse :\n    print(b+a)\n",WRONG_ANSWER,33,2896
1591662733496692736,6b02dfcf297d52c2de2e1416b33ee988ff909834c73207b147423a8301e9d174,2022-11-13 13:22:21,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main()\n{   int n;\nint k;\nint i; \n int *p;\n\n \n scanf(\""%d/n\"",&n);\n   for(i=0;i<n;i++);\n   {\n   \tscanf(\""%d\"",&a[i]);\n   }\n  for(i=0;i<n;i++)\n  {\n      \n  \n   while(a[i]!=a[i+1])\n   {\n   \tk=1;\n   \tk+=k;\n   }\n}\n     printf(\""%d\"",k);\n     return 0;\n}\n",COMPILE_ERROR,0,0
1591662764308062208,fa305ee4bf4c6a54add4e945b551f1e902b95c1a179a91ded55bf7ebb1c87c23,2022-11-13 13:22:29,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{    int p,q,r,s1,s2,s3,min;\n   scanf(\""%d%d%d\"",&p,&q,&r);\n   s1=p+q;\n   s2=q+r;\n   s3=r+p;\n   if(s1<=s2&&s1<=s3) min=s1;\n   if(s2<=s1&&s2<=s3)  min=s2;\n   if(s3<=s1&&s3<=s2)  min=s3;\n   printf(\""%d\\n\"",min);\n\n\n\n\n    return 0;\n}\n",ACCEPTED,44,384
1591662832981401600,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-13 13:22:45,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<iostream>\nusing namespace std;\nint max(int a,int b,int c){\n    if(a>=b&&a>=c)\n        return b+c;\n    if(b>=a&&b>=c)\n        return a+c;\n    if(c>=a&&c>=b)\n        return a+b;\n}\nint main(){\n    int P,Q,R;\n    cin>>P>>Q>>R;\n    if(P>=1&&P<=1000&&Q>=1&&Q<=1000&&R>=1&&R<=1000)\n        cout<<max(P,Q,R);\n    return 0;\n}",WRONG_ANSWER,8,484
1591662840761823232,6a835d762a87e93baf4142897168374dc31e9da90b86c19ed82f21159b644272,2022-11-13 13:22:47,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nmain()\n{\n    int p,q,r,x,i;\n    i=3;\n    for(x=0;x<100;x++)\n    scanf(\""%d%d%d\"",&p,&q,&r);\n    if(p=3)\n        x=q+r;\n     else if(q=3)\n        x=p+r;\n    printf(\""%d\"",x);\n}\n",WRONG_ANSWER,6,328
1591662895661068288,7ecf54bf0ea2db8ab0397aa941f19ec79a351bc3e86e8c01673aa09a69b3a6db,2022-11-13 13:23:00,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n\tint n,sum=0,f=0;\n\tscanf(\""%d\"",&n);\n\tint s[n];\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&s[i]);\n\t}\n\tfor(int i=1;i<n;i++)\n\t{\n\t\tswitch(f)\n\t\t{\n\t\t\tcase 0:\n\t\t\t\tif(s[i]>s[i+1])f=1;  //入坑\n\t\t\t\tbreak;\n\t\t\tcase 1:\n\t\t\t\tif(s[i]<s[i+1])f=2;  //爬坡\n\t\t\t\tbreak;\n\t\t\tcase 2:\n\t\t\t\tif(s[i]>s[i+1])f=1;  //已经过了一个坑，记录下来\n\t\t\t\tsum++;\n\t\t\t\tbreak; \n\t\t}\n\t\t\n\t}\n\tprintf(\""%d\\n\"",sum);\n}\n\n",WRONG_ANSWER,13,324
1591662899234660352,a5291eb67188c2a916aa5dd9fc38f2e449aa9f9a3cd047f282d8c154ea2979cd,2022-11-13 13:23:01,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,#include <iostream>\n#include <vector> \nusing namespace std;\n\nconst int N = 1e6 + 10;\nint h[N];\n\n\nint main()\n{\n\tint n = 0;\n\tcin >> n;\n\tfor(int i = 1;i <= n;i++)\n\t{\n\t\tcin >> h[i];\n\t}\n\tint S_max = 0;\n\tfor(int i = 1;i <= n;i++)\n\t{\n\t\tint min_h = h[i];\n\t\tfor(int j = i;j <= n;j++)\n\t\t{\n\t\t\tint S = 0;\n\t\t\tif(h[j] >= h[i])\n\t\t\t{\n\t\t\t\tif(min_h != 0)\n\t\t\t\t{\n\t\t\t\t\tS = (j - i + 1) * min_h;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tS = (j - i + 1) * h[i];\t\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tS = (j - i + 1) * h[j];\n\t\t\t\tif(h[j] < min_h)\n\t\t\t\t{\n\t\t\t\t\tmin_h = h[j];\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(S > S_max)\n\t\t\t{\n\t\t\t\tS_max = S;\t\n\t\t\t}\n\t\t}\n\t\t\n\t}\n\t\n\tcout << S_max << endl;\n\t\n\n\n\treturn 0;\n} ,WRONG_ANSWER,7,636
1591662929731399680,6b02dfcf297d52c2de2e1416b33ee988ff909834c73207b147423a8301e9d174,2022-11-13 13:23:08,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main()\n{   int n;\nint k;\nint i; \n int *p;\n int a[];\n \n \n scanf(\""%d/n\"",&n);\n   for(i=0;i<n;i++);\n   {\n   \tscanf(\""%d\"",&a[i]);\n   }\n  for(i=0;i<n;i++)\n  {\n      \n  \n   while(a[i]!=a[i+1])\n   {\n   \tk=1;\n   \tk+=k;\n   }\n}\n     printf(\""%d\"",k);\n     return 0;\n}\n",COMPILE_ERROR,0,0
1591662950191259648,345826d11b41befc23adeb536e81da8eb6ec9a8bfb9448acf91422deedb8ba4a,2022-11-13 13:23:13,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\n main()\n{\n  int a,b,c,sum=0;\n  scanf(\""%d%d%d\"",&a,&b,&c);\n  if(a+b<b+c)\n    {\n        if(a+c<a+b)\n        sum=a+c;\n    else\n        sum=a+b;\n    }\n    else if(b+c<a+c)\n        sum=b+c;\n        else\n            sum=a+c;\n    printf(\""%d\"",sum);\n\n}\n",ACCEPTED,26,324
1591662960639270912,705adaf4eb218ca0fc51c6e09291eb309a3de0a7c595448a17d2fdb157e64706,2022-11-13 13:23:16,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R;\n    int a,b,c;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n     a=P+Q;\n     b=R+Q;\n    c=P+R;\n    if(a>b){\n        if(b>c)\n        printf(\""%d\"",c);\n        else\n            printf(\""%d\"",b);\n    }\n    else{\n        if(a>c)\n            printf(\""%d\"",c);\n        else\n            printf(\""%d\"",a);\n    }\n\n    return 0;\n}\n",ACCEPTED,27,476
1591662981887569920,6b02dfcf297d52c2de2e1416b33ee988ff909834c73207b147423a8301e9d174,2022-11-13 13:23:21,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main()\n{   int n;\nint k;\nint i; \n int *p;\n int a[i];\n \n \n scanf(\""%d/n\"",&n);\n   for(i=0;i<n;i++);\n   {\n   \tscanf(\""%d\"",&a[i]);\n   }\n  for(i=0;i<n;i++)\n  {\n      \n  \n   while(a[i]!=a[i+1])\n   {\n   \tk=1;\n   \tk+=k;\n   }\n}\n     printf(\""%d\"",k);\n     return 0;\n}\n",TIME_LIMIT_EXCEEDED,400,364
1591662985666637824,887d1bbe53a4d4a349813887f13126da5e46a853687f4c2c9d7b8ef3d748a9d6,2022-11-13 13:23:22,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nmain()\n{\n    int ai=1,hi[1000],s=0,i,n,min=0,h=0,j=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    scanf(\""%d\"",&hi[i]);\n    for(i=0;i<n;i++)\n    {\n    \th=hi[i];\n    \tfor(j=i;j<n-1;j++)\n    \t{\n    \tif(hi[j+1]>=h)\n    \t\tai++;\n    \t}\n\t\tif(h*ai>s)\n\t\ts=h*ai;\n\t\tai=1;\n\t}\n\tprintf(\""%d\"",s);\n}",WRONG_ANSWER,6,316
1591663004780126208,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 13:23:26,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"n = eval(input())\na = [0]*n\nx = 0\nnum = 0\nlist = map(int,input().split())\nfor i in list:\na[x] = i\nx = x+1\nfor j in range(1,n-1):\nif (a[j]<a[j-1] and a[j]<a[j+1]) or (a[j]<a[j-1] and a[j] == a[j+1]):\nnum = num+1\nprint(num)                           ",NON_ZERO_EXIT_CODE,15,2888
1591663007028273152,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-13 13:23:27,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int num;\n    scanf(\""%d\"",&num);\n    int a[num];\n    int i;\n    int count = 0;\n    for(i = 0;i < num;i++) {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i = 1;i<num-1;i++){\n        if(((a[i] == a[i+1]) && (a[i] < a[i-1]&&a[i] < a[i+2])) || (a[i] < a[i-1] && a[i] < a[i+1])){\n            count++;\n        }\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",WRONG_ANSWER,34,352
1591663020173189120,105cc8c0a5a465ab713603b461d92ac587c87767965625687540cd513f7ebb57,2022-11-13 13:23:30,C++,300.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<bits/stdc++.h>\n#define N 100005\n#define endl '\\n'\n#define int long long\n#define ios ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)\n\n//const int dir[4][2]={-1,0,0,1,1,0,0,-1};\n//const int mod=1e9+7;\nusing namespace std;\n\ninline int read() {\n    char c = getchar(); int num = 0, sign = 1;\n    while(c < '0' || c > '9') {if(c == '-') sign = -1; c = getchar();}\n    while(c >= '0' && c <= '9') num = num * 10 + c - '0', c = getchar();\n    return num * sign;\n}\n\nvoid solve(){\n\tint res=0;\n\tchar s[N]={0};\n\tint n;\n\tcin>>n;\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tcin>>s[i];\n\t}\n\tstack<char> q;\n\t\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tif(q.empty())\n\t\t{\n\t\t\tq.push(s[i]);\n\t\t}\n\t\telse if(q.top()!=s[i])\n\t\t{\n\t\t\tres+=2;\n\t\t\tq.pop();\n\t\t}\n\t\telse if(q.top()==s[i])\n\t\t{\n\t\t\tq.push(s[i]);\n\t\t}\n\t}\n\t\n\tcout<<res;\n\t\n}\n\nsigned main() {\n\tios;\n\tint count=1;\n\t//cin>>count;\n\twhile(count--)\n\t{\n\t\tsolve();\n\t}\n\treturn 0;\n}\n",ACCEPTED,41,768
1591663062422413312,25584884fd716238437f89484285121d106c1090916ab683be624f210130ebad,2022-11-13 13:23:40,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n   int i,P,Q,R,sum1,sum2,sum3,sum4,sum5,sum6,min;\n   scanf(\""%d %d %d\"",&P,&Q,&R);\n   sum1=P+Q;sum2=R+Q;sum3=Q+R;sum4=P+R;sum5=Q+P;sum6=R+P;\nint a[7]={sum1,sum2,sum3,sum4,sum5,sum6};\nfor(i=0;i<7;i++)\n{\n    min=a[0];\n    if(a[i]<min)\n        printf(\""%d\"",min);\n}\nreturn 0;\n}\n\n\n\n\n\n",WRONG_ANSWER,12,356
1591663066516086784,7ecf54bf0ea2db8ab0397aa941f19ec79a351bc3e86e8c01673aa09a69b3a6db,2022-11-13 13:23:41,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n\tint n,sum=0,f=0;\n\tscanf(\""%d\"",&n);\n\tint s[n];\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&s[i]);\n\t}\n\tfor(int i=1;i<n;i++)\n\t{\n\t\tswitch(f)\n\t\t{\n\t\t\tcase 0:\n\t\t\t\tif(s[i]>s[i+1])f=1;  //入坑\n\t\t\t\tbreak;\n\t\t\tcase 1:\n\t\t\t\tif(s[i]<s[i+1])f=2;  //爬坡\n\t\t\t\tbreak;\n\t\t\tcase 2:\n\t\t\t\tif(s[i]>s[i+1])f=1;  //已经过了一个坑，记录下来\n\t\t\t\tsum++;\n\t\t\t\tbreak; \n\t\t}\n\t\t\n\t}\n\tprintf(\""%d\\n\"",sum);\n}\n\n",WRONG_ANSWER,8,196
1591663075672252416,28b4de6882b7ade2679f59c486acaf307ce8415dcb0a15787dba589025bbdb02,2022-11-13 13:23:43,C++,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint n,i,j,k=0;\n\n\tscanf(\""%d\"",&n);\n\tgetchar();\n\tchar num[n+1];\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%c\"",&num[i]);\n\t}\n\tfor(i=0;i<n-1;i++)\n\t{\n\t\tif(num[i]!=num[i+1])\n\t\t{\n\t\t\tk=k+2;\t\n\t\t\tfor(j=i+2;j<n;j++)\n\t\t\t{\n\t\t\t\tnum[j-2]=num[j];\n\t\t\t}\n\t\t\tif(i==0)\n\t\t\ti=i-1;\n\t\t\telse\n\t\t\ti=i-2;\n\t\t\tn=n-2;\n\t\t}\n\t}\n\tprintf(\""%d\\n\"",k);\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,448,640
1591663077345779712,c47b15e117166a3dd00078b9f795673d5284a2761e582479119229751cc734d3,2022-11-13 13:23:43,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#define S 10000\n\n\nint main()\n{\n    int a=0,n,i,j,k;\n    int s[S];\n    int m[S];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&s[i]);\n    for(i=0;i<n;i++)\n    {\n        k=1;\n        for(j=i;j<n;j++)\n        if(s[i]<=s[j])\n        m[i]=s[i]*(k++);\n        else break;\n    }\n    for(i=0;i<n;i++)\n    {\n        if(a<=m[i])\n            a=m[i];\n    }\n\n    printf(\""%d\\n\"",a);\n\n\n\n    return 0;\n}\n",WRONG_ANSWER,29,348
1591663093510594560,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-13 13:23:47,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a,b,c,min;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    min=a+b;\n    if((a+c)>=min)\n        min=a+c;\n    if((b+c)>=min)\n        min=b+c;\n    printf(\""%d\"",min);\n}",WRONG_ANSWER,10,196
1591663120559661056,1019ea4e8e67338c8191b6e52878cb69ca9287130af71af3517596fded2f21e4,2022-11-13 13:23:54,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\nint p,q,r,n,b,c;\nscanf(\""%d%d%d\"",&p,&q,&r);\nn=p+q;\nb=q+r;\nc=p+r;\n\n   if(n<b&&n<c)\n   printf(\""%d\\n\"",n);\nelse if(b<n&&b<c)\n    printf(\""%d\\n\"",b);\nelse if(c<n&&c<b)\n    printf(\""%d\\n\"",b);\n    else if(n==b&&n<c)\n        printf(\""%d\\n\"",n);\n    else if(n==c&&n<b)\n        printf(\""%d\\n\"",n);\n    else if(b==c&&b<n)\n        printf(\""%d\\n\"",n);\n    return 0;\n\n\n}\n",ACCEPTED,66,480
1591663123814440960,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 13:23:55,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"n = eval(input())\na = [0]*n\nx = 0\nnum = 0\nlist = map(int,input().split())\nfor i in list:\na[x] = i\nx = x+1\nfor j in range(1,n-1):\nif (a[j]<a[j-1] and a[j]<a[j+1]) or (a[j]<a[j-1] and a[j] == a[j+1]):\nnum = num+1\nprint(num)",NON_ZERO_EXIT_CODE,22,2908
1591663169930813440,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-13 13:24:06,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"list1 = []\nlist1 = input().split(\"" \"")\na=int(list1[0])\nb=int(list1[1])\nc=int(list1[2])\nif a>b>c:\n    print(b+c)\nif b>c>a:\n    print(c+a)\nelse :\n    print(b+a)\n",WRONG_ANSWER,42,2924
1591663189660819456,86f702b052a21d7cb2f8cd933c678c21efaafaf5b2d35032f18ec35c1e26a945,2022-11-13 13:24:10,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int P,Q,R;\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    int a,b,c;\n    a=P+Q;\n    b=P+R;\n    c=Q+R;\n    if(a>=b&&a>=c) \n    {\n        printf(\""%d\\n\"",a);\n        /*printf(\""从 A 到 B 花费%d块钱，从 B 到 C 花费%d块钱，此时所有地点都去过了，总花费为%d块钱\"",P,Q,a);*/\n    }\n    if(c>a&&c>b) \n    {\n        printf(\""%d\\n\"",a);\n        /*printf(\""从 B 到 C 花费%d块钱，从 C到 A花费%d块钱，此时所有地点都去过了，总花费为%d块钱\"",Q,R,c);*/\n    }\n    if(b>a&&b>c) \n    {\n        printf(\""%d\\n\"",a);\n        /*printf(\""从 C 到 A 花费%d块钱，从 A 到 B 花费%d块钱，此时所有地点都去过了，总花费为%d块钱\"",R,P,b);*/\n    }\n    return 0;\n}",WRONG_ANSWER,14,352
1591663190642319360,281adcca8943f9f4c0ced14f1ceffe157a34fca39f3cb864eb95e400944e38a8,2022-11-13 13:24:10,Java,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"\nimport java.awt.List;\nimport java.lang.reflect.Array;\nimport java.util.Arrays;\nimport java.util.Scanner;\n\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner scan=new Scanner(System.in);\n\t\tint n=scan.nextInt();\n\t\tint a=scan.nextInt();\n\t\tint b=scan.nextInt();\n\t\tint[] c=new int[n];\n\t\tint[] f=new int[n];\n\t\tfor(int i=0;i<n;i++){\n\t\t\tc[i]=scan.nextInt();\n\t\t}\n\t\tfor(int i=0;i<n;i++){\n\t\t\tf[i]=scan.nextInt();\n\t\t}\n\t\tint anser=0;\n\t\tanser=sub(n, c, f, a)-sub(n, c, f,b);\n\t\tSystem.out.print(anser);\n\t}\n\tpublic static int sub(int n,int[] c,int[] f,int a){\n\t\tint ans=0;\n\t\tfor(int i=0;i<n;i++){\n\t\tans+=(int) ((c[i]/(f[i]+1))*Math.pow(a, f[i]+1));\n\t\t}\n\t\treturn ans;\n\t}\n\n}\n",WRONG_ANSWER,110,24500
1591663200633151488,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-13 13:24:13,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n = 0, i = 0, j = 0, count = 0;\n    scanf(\""%d\"",&n);\n    int arr[n];\n    for(i = 0;i < n; ++i)\n    {\n        scanf(\""%d\"",&arr[i]);\n    }\n    if(arr[0] == arr[1])\n    {\n         count++;\n    }\n    for(j = 1; j < n-2; ++j)\n    {\n        if(((arr[j] < arr[j-1]) && (arr[j] < arr[j+1])) || (arr[j] == arr[j+1]))\n        {\n            count++;\n        }\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",WRONG_ANSWER,6,468
1591663201585225728,7935e8f5cb04027f4d30ac84a997e2d03e946e112c1cb17f1a4f943d8b0b54bf,2022-11-13 13:24:13,C++,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <iostream>\n#include<stdio.h>\n#include<algorithm>\n\nusing namespace std;\n\nint main()\n{\n    int n,i,t,m,x=0;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i+3<=n;i=i+3)\n    {\n        t=a[i+2]-5;\n        m=a[i]+a[i+1]+a[i+2]-15;\n        x=x+max(t,m);\n    }\n    if(n%3==2)\n        x=x-10+a[n-1]+a[n-2];\n    if(n%3==1)\n        x=x-5+a[n-1];\n    printf(\""%d\"",x);\n    return 0;\n}\n",WRONG_ANSWER,7,592
1591663204894564352,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-13 13:24:14,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"list1 = []\nlist1 = input().split(\"" \"")\na=int(list1[0])\nb=int(list1[1])\nc=int(list1[2])\nif a>b>c:\n    print(b+c)\nif b>c>a:\n    print(c+a)\nelse :\n    print(b+a)\n",WRONG_ANSWER,34,2884
1591663208187092992,00d0a1b2e987c17fb50850b9ec54bf6b4f8b997eb053d1a9fed6c4888fbe74ed,2022-11-13 13:24:15,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,i,j,a[n],max=0,min,flag;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        flag=0;\n        for(j=i;j<n;j++)\n        {\n            if (a[i]<=a[j+1])\n                flag=flag+1;\n            else break;\n        }\n            min=a[i]*flag;\n            if(max<min)\n                max=min;\n    }\n        printf(\""%d\"",max);\n        return 0;\n}",WRONG_ANSWER,10,324
1591663220010803200,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 13:24:17,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[n],sum=0,i,b=0;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i=b)\n    {\n        if(a[i]>a[i+2])\n        {\n            sum=sum+a[i]-5;\n            b=b+1;\n        }\n        else \n        {\n            sum=sum+a[i+2]-5;\n            b=b+3;\n        }\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,6,500
1591663236385366016,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 13:24:21,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"n = eval(input())\na = [0]*n\nx = 0\nnum = 0\nlist = map(int,input().split())\nfor i in list:\na[x] = i\nx=x+1\nfor j in range(1,n-1):\nif (a[j]<a[j-1] and a[j]<a[j+1]) or (a[j]<a[j-1] and a[j] == a[j+1]):\nnum = num+1\nprint(num)",NON_ZERO_EXIT_CODE,19,2760
1591663237958262784,09eb01e8f9f24922a6c60a1149d505ad1ebb9b0a39ed1101140fe0fd93daa753,2022-11-13 13:24:22,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\n    int n,i,counts=0;\n    int arr[100]={0};\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&arr[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n\n        if(arr[i]>arr[i+1]&&arr[i+1]<arr[i+2])\n        {\n            counts++;\n        }\n        if(arr[i]>arr[i+1]&&arr[i+2]==arr[i+1]&&arr[i+3])\n            counts++;\n    }\n    printf(\""%d\"",counts);\n    return 0;\n}",RUNTIME_ERROR,22,488
1591663244098691072,6b02dfcf297d52c2de2e1416b33ee988ff909834c73207b147423a8301e9d174,2022-11-13 13:24:23,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main()\n{   int n;\nint k;\nint i; \n int *p;\n int a[i];\n \n \n scanf(\""%d/n\"",&n);\n  while(i<n){\n     scanf(\""%d\"",&a[i]);\n      i++\n  }\n   \t\n   }\n  for(i=0;i<n;i++)\n  {\n      while(a[i]!=a[i+1])\n   {\n   \tk=1;\n   \tk+=k;\n   }\n}\n     printf(\""%d\"",k);\n     return 0;\n}\n",COMPILE_ERROR,0,0
1591663278265479168,064270dabaa13edbd7238477860db0e46621a5ed4921e8aa2c0f9258e77722cc,2022-11-13 13:24:31,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 100\nint main()\n{\nint sum[N];\nint a,i;\nint count=0;\nscanf(\""%d\"",&a);\n\nfor(i=1;i<a-4;i++)\n   {\n       scanf(\""%d\"",&sum[i]);\n       if(sum[i]<=sum[i+1]&&sum[i]<sum[i-1])\n        count++;\n   }\n\n\nprintf(\""%d\"",count);\n}\n",WRONG_ANSWER,18,320
1591663280777879552,d21dc339d37b0772b2547441444d4b660b000ac3ebe190aee01769e2dd619c10,2022-11-13 13:24:32,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"for i in range(1,1000):\n    \n    P=input()\n    Q=input()\n    R=input()\n    a=int(P)+int(Q)\n    b=int(Q)+int(R)\n    c=int(R)+int(P)\n    if a>b:\n        if b<c:\n            print(b)\n        else:\n            print(c)\n    elif a<c:\n        print(a)\n    elif a>c:\n        print(c)\n    else:\n        break\n",NON_ZERO_EXIT_CODE,18,2908
1591663286977093632,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-13 13:24:33,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<iostream>\nusing namespace std;\nint max(int a,int b,int c){\n    if(a>=b&&a>=c)\n        return b+c;\n    if(b>=a&&b>=c)\n        return a+c;\n    if(c>=a&&c>=b)\n        return a+b;\n}\nint main(){\n    int P,Q,R;\n    cin>>P>>Q>>R;\n    if(P>=1&&P<=1000&&Q>=1&&Q<=1000&&R>=1&&R<=1000)\n        cout<<max(P,Q,R)<<endl;;\n    return 0;\n}",WRONG_ANSWER,5,452
1591663290810642432,70c675ddfcb60b2192bc8ac38fb068fec0500208a5bf97a796c7cc074b43cf87,2022-11-13 13:24:34,Java,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner myScanner = new Scanner(System.in);\n\t\tint n = myScanner.nextInt();\n\t\tint[] arr = new int[n];\n\t\tfor(int i = 0; i < n;i++){\n\t\t\tarr[i] = myScanner.nextInt();\n\t\t}\n\t\tint minmax = 0;\n\t\tint count = 0;\n\t\tint max = 0;\n\t\tfor(int i = 0;i < n;i++){\n\t\t\tcount = 0;\n\t\t\tfor(int j = 0;j < n;j++){\n\t\t\t\tif(arr[i] <= arr[j]){\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\tminmax = arr[i] * count;\n\t\t\t\tif(minmax >= max){\n\t\t\t\t\tmax = minmax;\n\t\t\t\t}\n\t\t}\n\t\tSystem.out.printf(\""%d\"",max);\n\t}\n\n}",WRONG_ANSWER,107,24904
1591663305629118464,cf76a6e5773cf2f19ddd635fa646c5a6721f6fed8998d22ea1d0910bee8017a2,2022-11-13 13:24:38,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#define N 30\nint main()\n{\n    int a[N];\n    int i,k=0,n;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n-2;i++)\n    {\n        if(a[i]>a[i+1]&&a[i+2]>a[i+1])\n        {\n             k++;\n        }\n    }\n     for(i=0;i<n-3;i++)\n     {\n         if(a[i+1]==a[i+2]&&a[i+1]<a[i]&&a[i+2]<a[i+3])\n             k++;\n     }\n        \n\n   \n    printf(\""%d\"",k);\n    \n}",RUNTIME_ERROR,23,344
1591663313644478464,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-13 13:24:40,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a[3],i,j,t;\n    for(i=0;i<3;i++)\n    scanf(\""%d\"",&a[i]);\n    for (i = 1; i <= 3; i++)\n\t{\n\t\tfor (j = 0; j <= 3 - i; j++)\n\t\t{\n\t\t\tif (a[j] > a[j + 1])\n\t\t\t{\n\t\t\t\tt = a[j];\n\t\t\t\ta[j] = a[j + 1];\n\t\t\t\ta[j + 1] = t;\n\t\t\t}\n\t\t}\n\t}\n    printf(\""%d\\n\"",a[0]+a[1]);\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,400,328
1591663314349076480,1773d9c971942817d949c47973c4eb8c24531f728d5480dbf3b232e568926258,2022-11-13 13:24:40,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"public class MAIN {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int P = sc.nextInt();\n        int Q = sc.nextInt();\n        int R = sc.nextInt();\n        int[] arr = {P, Q, R};\n        Arrays.sort(arr);\n        int result = 0;\n        for (int i = 0; i < arr.length; i++) {\n            result = arr[0] + arr[1];\n        }\n        System.out.println(result);\n    }\n}\n",NON_ZERO_EXIT_CODE,16,2896
1591663333512863744,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-13 13:24:45,C,0.0,1591610585635213313,1589906790446387200,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,j,k,temp,flag,sum,m,h;\n    scanf(\""%d\"",&m);\n    for(h=1;h<=m;h++)\n    {\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(k=1;k<=n;k++)\n    {\n        flag=0;\n        for(j=0;j<n-k;j++)\n        {\n          if(a[j]>=a[j+1])\n          {\n               flag=1;\n               temp=a[j+1];\n                a[j+1]=a[j];\n               a[j]=temp;\n            }\n        }\n       if(flag==0);\n            break;\n    }\n    sum=abs(a[0]-a[n-1])+abs(a[n-1]-a[n-2]);\n    if(h<m)\n        printf(\""%d\\n\"",sum);\n    else\n        printf(\""%d\"",sum);\n    }\n    return 0;\n}\n",WRONG_ANSWER,12,348
1591663334821486592,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-13 13:24:45,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"list1 = []\nlist1 = input().split(\"" \"")\na=int(list1[0])\nb=int(list1[1])\nc=int(list1[2])\nif a>b>c:\n    print(b+c)\nif b>c>a:\n    print(c+a)\nelse :\n    print(b+a)\n",WRONG_ANSWER,35,2940
1591663342039883776,00d0a1b2e987c17fb50850b9ec54bf6b4f8b997eb053d1a9fed6c4888fbe74ed,2022-11-13 13:24:47,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,i,j,a[n],max=0,min,flag;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        flag=0;\n        for(j=i;j<n;j++)\n        {\n            if (a[i]<=a[j+1])\n                flag=flag+1;\n            else break;\n        }\n            min=a[i]*(flag+1);\n            if(max<min)\n                max=min;\n    }\n        printf(\""%d\"",max);\n        return 0;\n}",WRONG_ANSWER,19,348
1591663347240820736,3e087b0a196d30fcbb49ca80164c9eb5adf82ae3bb08ec0c141e5728fb180f0d,2022-11-13 13:24:48,Java,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"public class Main {\n\t\n\tstatic final int MAX=10000;\n\tstatic int solve(int[] arr,int num){\n\t\tint ma=-1,j=0,res=0;\n\t\tint[] record=new int[MAX];\n\t\tfor(int i=0;i<num;i++){\n\t\t\tma=ma<arr[i]?arr[i]:ma;\n\t\t}\n\t\tfor(int i=0;i<num;i++){\n\t\t\tif(arr[i]==ma){\n\t\t\t\trecord[j]=i;\n\t\t\t\tj++;\n\t\t\t}\n\t\t}\n\t\tfor(int i=0;i<j-1;i++){\n\t\t\tif(record[i]+1!=record[i+1]){\n\t\t\t\tres++;\n\t\t\t}\n\t\t}\n\t\tif((arr[1]>0)&&(arr[1]<ma)){\n\t\t\tres++;\n\t\t}\n\t\tif((arr[num-2]>0)&&(arr[num-2]<ma)){\n\t\t\tres++;\n\t\t}\n\t\treturn res;\n\t}\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner sc=new Scanner(System.in);\n\t\tint num=sc.nextInt();\n\t\tint[] arr=new int[MAX];\n\t\tfor(int i=0;i<num;i++){\n\t\t\tarr[i]=sc.nextInt();\n\t\t}\n\t\tSystem.out.print(solve(arr, num));\n\t\tsc.close();\n\t}\n\n}",COMPILE_ERROR,0,0
1591663361090412544,1773d9c971942817d949c47973c4eb8c24531f728d5480dbf3b232e568926258,2022-11-13 13:24:51,Java,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"public class MAIN {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int P = sc.nextInt();\n        int Q = sc.nextInt();\n        int R = sc.nextInt();\n        int[] arr = {P, Q, R};\n        Arrays.sort(arr);\n        int result = 0;\n        for (int i = 0; i < arr.length; i++) {\n            result = arr[0] + arr[1];\n        }\n        System.out.println(result);\n    }\n}\n",COMPILE_ERROR,0,0
1591663376378650624,9d0546dac18a9dc678295254e547925db086add5f872ef42d8015d525afeaf65,2022-11-13 13:24:55,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 3\nint main()\n{\n    long num[N],i,j,temp;\n    for(i=0;i<N;i++){\n        scanf(\""%d\"",&num[i]);\n    }\n    for(i=1;i<N;i++){\n        for(j=0;j<N-i;j++){\n            if(num[j]>num[j+1]){\n                temp=num[j];\n                num[j]=num[j+1];\n                num[j+1]=temp;\n            }\n        }\n    }\n    printf(\""%d\\n\"",num[0]+num[1]);\n    return 0;\n}",WRONG_ANSWER,11,348
1591663380874932224,bd8243b4b064cae986196b0eac310a36f12d46dc08f126fbdcaaca530c884eb0,2022-11-13 13:24:56,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int P,Q,R,m;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    if(P<=Q&&P<=R&&Q<=R)\n        m=P+Q;\n    else if(P<=Q&&P<=R&&Q>R)\n        m=P+R;\n    else if(P>=Q&&P>=R)\n        m=Q+R;\n    else if(P<=Q&&Q>=R)\n        m=P+R;\n    printf(\""%d\"",m);\n    return 0;\n\n}\n",WRONG_ANSWER,19,376
1591663392061140992,cf76a6e5773cf2f19ddd635fa646c5a6721f6fed8998d22ea1d0910bee8017a2,2022-11-13 13:24:59,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#define N 30\nint main()\n{\n    int a[N];\n    int i,k=0,n;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n-2;i++)\n    {\n        if(a[i]>a[i+1]&&a[i+2]>a[i+1])\n        {\n             k++;\n        }\n         if(a[i+1]==a[i+2]&&a[i+1]<a[i]&&a[i+2]<a[i+3])\n             k++;\n    }\n    \n   \n    printf(\""%d\"",k);\n    \n}",RUNTIME_ERROR,19,324
1591663404178485248,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-13 13:25:01,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\nint main(){\n    int gd = -5; // 固定减5\n    int count = 0;\n    int num = 0;\n    int len;\n    int j=-1;\n    if(scanf(\""%d\"",&len)){};\n    int arr[len];\n    \n        for(int i=0; i<len-1; i++){\n            if(scanf(\""%d\"",&arr[i])){};\n        }\n        \n        while(j<len-1){\n            // 给count赋值 单步最大\n            if(arr[j+1]+gd > arr[j+3]+gd){\n                count = arr[j+1]+gd;\n                j=j+1;\n            }else{\n                count = arr[j+3]+gd;\n                j=j+3;\n            }\n            // 总数最\n                num += count;\n            \n        }\n    printf(\""%d\"",count);\n}",WRONG_ANSWER,10,324
1591663408754470912,55950e2d4c314feed0856fa0f6b80f22c5c36f2ebe0d75c8ee2cadb1a06b2fe1,2022-11-13 13:25:02,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int n,a,b,c[100],i,d[100],an=0,bn=0,cn=0;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&c[i]);\n        scanf(\""%d\"",&d[i]);\n\n\n    }\n    for(i=0;i<n;i++){\n        an=an+(c[i])/((d[i]+1)*pow(a,d[i]+1));\n        bn=bn+(c[i])/((d[i]+1)*pow(b,d[i]+1));\n\n\n\n    }\n    cn=an-bn;\n    printf(\""%d\"",cn);\n\n\n\n\n\n\n\n\n\n    return 0;\n}",WRONG_ANSWER,8,324
1591663409169719296,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 13:25:03,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"n = eval(input())\na = [0]*n\nx = 0\nnum = 0\nlist = map(int,input().split())\nfor i in list:\na[x] = i\nx=x+1\nfor j in range(1,n-1):\nif (a[j]<a[j-1] and a[j]<a[j+1]) or (a[j]<a[j-1] and a[j]==a[j+1]):\nnum = num+1\nprint(num)",NON_ZERO_EXIT_CODE,19,2760
1591663421274468352,6b02dfcf297d52c2de2e1416b33ee988ff909834c73207b147423a8301e9d174,2022-11-13 13:25:05,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main()\n{   int n;\nint k;\nint i; \n int *p;\n int a[i];\n \n \n scanf(\""%d/n\"",&n);\n  while(i<n){\n     scanf(\""%d\"",&a[i]);\n      i++;\n  }\n   \t\n   }\n  for(i=0;i<n;i++)\n  {\n      while(a[i]!=a[i+1])\n   { \n   \tk=1;\n   \tk+=k;\n   }\n}\n     printf(\""%d\"",k);\n     return 0;\n}\n",COMPILE_ERROR,0,0
1591663428199309312,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-13 13:25:07,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<iostream>\nusing namespace std;\nint max(int a,int b,int c){\n    if(a>=b&&a>=c)\n        return b+c;\n    if(b>=a&&b>=c)\n        return a+c;\n    if(c>=a&&c>=b)\n        return a+b;\n}\nint main(){\n    int P,Q,R;\n    cin>>P>>Q>>R;\n    if(P>=1&&P<=1000&&Q>=1&&Q<=1000&&R>=1&&R<=1000)\n        cout<<max(P,Q,R)<<endl;\n    return 0;\n}",WRONG_ANSWER,9,492
1591663428622888960,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-13 13:25:07,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\nint main(){\n    int gd = -5; // 固定减5\n    int count = 0;\n    int num = 0;\n    int len;\n    int j=-1;\n    if(scanf(\""%d\"",&len)){};\n    int arr[len];\n    \n        for(int i=0; i<len; i++){\n            if(scanf(\""%d\"",&arr[i])){};\n        }\n        \n        while(j<len-1){\n            // 给count赋值 单步最大\n            if(arr[j+1]+gd > arr[j+3]+gd){\n                count = arr[j+1]+gd;\n                j=j+1;\n            }else{\n                count = arr[j+3]+gd;\n                j=j+3;\n            }\n            // 总数最\n                num += count;\n            \n        }\n    printf(\""%d\"",count);\n}",WRONG_ANSWER,6,324
1591663440224346112,25584884fd716238437f89484285121d106c1090916ab683be624f210130ebad,2022-11-13 13:25:10,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n   int i,P,Q,R,sum1,sum2,sum3,sum4,sum5,sum6,min;\n   scanf(\""%d %d %5d\"",&P,&Q,&R);\n   sum1=P+Q;sum2=R+Q;sum3=Q+R;sum4=P+R;sum5=Q+P;sum6=R+P;\nint a[7]={sum1,sum2,sum3,sum4,sum5,sum6};\nfor(i=0;i<7;i++)\n{\n    min=a[0];\n    if(a[i]<min)\n        printf(\""%d\"",min);\n}\nreturn 0;\n}\n\n\n\n\n\n",WRONG_ANSWER,10,348
1591663441356840960,00d0a1b2e987c17fb50850b9ec54bf6b4f8b997eb053d1a9fed6c4888fbe74ed,2022-11-13 13:25:10,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,i,j,a[n],max=0,min,flag;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        flag=0;\n        for(j=i;j<n;j++)\n        {\n            if (a[i]<=a[j+1])\n                flag=flag+1;\n            else break;\n        }\n            min=a[i]*(flag+1);\n            if(max<min)\n                max=min;\n    }\n        printf(\""%d\\n\"",max);\n        return 0;\n}",WRONG_ANSWER,24,496
1591663446037639168,3e087b0a196d30fcbb49ca80164c9eb5adf82ae3bb08ec0c141e5728fb180f0d,2022-11-13 13:25:11,Java,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\t\n\tstatic final int MAX=10000;\n\tstatic int solve(int[] arr,int num){\n\t\tint ma=-1,j=0,res=0;\n\t\tint[] record=new int[MAX];\n\t\tfor(int i=0;i<num;i++){\n\t\t\tma=ma<arr[i]?arr[i]:ma;\n\t\t}\n\t\tfor(int i=0;i<num;i++){\n\t\t\tif(arr[i]==ma){\n\t\t\t\trecord[j]=i;\n\t\t\t\tj++;\n\t\t\t}\n\t\t}\n\t\tfor(int i=0;i<j-1;i++){\n\t\t\tif(record[i]+1!=record[i+1]){\n\t\t\t\tres++;\n\t\t\t}\n\t\t}\n\t\tif((arr[1]>0)&&(arr[1]<ma)){\n\t\t\tres++;\n\t\t}\n\t\tif((arr[num-2]>0)&&(arr[num-2]<ma)){\n\t\t\tres++;\n\t\t}\n\t\treturn res;\n\t}\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner sc=new Scanner(System.in);\n\t\tint num=sc.nextInt();\n\t\tint[] arr=new int[MAX];\n\t\tfor(int i=0;i<num;i++){\n\t\t\tarr[i]=sc.nextInt();\n\t\t}\n\t\tSystem.out.print(solve(arr, num));\n\t\tsc.close();\n\t}\n\n}",WRONG_ANSWER,110,24604
1591663459975323648,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-13 13:25:15,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a,b,c,min;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    min=a+b;\n    if(a+c<min)\n        min=a+c;\n    if(b+c<min)\n        min=b+c;\n    printf(\""%d\"",min);\n}",ACCEPTED,28,328
1591663477864017920,fbea21dbaf89f1b064feaa20227f21c5e1c4888fdc371cf5e43f70615906e52a,2022-11-13 13:25:19,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"n=int(input())\ns=list(map(int,input().split()))\nk=0\nfor i in range(1,n-1):\n    if s[i]<s[i-1]:\n        k+=1\nprint(k)",WRONG_ANSWER,21,2888
1591663487380893696,5b382280d947e26011a7c75c34d257662bc13c50f8257bc8cae807604d61430c,2022-11-13 13:25:21,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\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\tint n,i;\n\tint count=0;\n\tint a[10000];\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=1;i<n-1;i++){\n\tif((a[i]<a[i-1]||a[i]==a[i-1])&&(a[i]<a[i+1]))\n\t{\n\t\tcount++;\n\t}\n\t}\n\tprintf(\""%d\\n\"",count);\n\treturn 0;\n}",ACCEPTED,28,384
1591663507593256960,1773d9c971942817d949c47973c4eb8c24531f728d5480dbf3b232e568926258,2022-11-13 13:25:26,Java,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"import java.util.Arrays;\nimport java.util.Scanner;\npublic class MAIN {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int P = sc.nextInt();\n        int Q = sc.nextInt();\n        int R = sc.nextInt();\n        int[] arr = {P, Q, R};\n        Arrays.sort(arr);\n        int result = 0;\n        for (int i = 0; i < arr.length; i++) {\n            result = arr[0] + arr[1];\n        }\n        System.out.println(result);\n    }\n}\n",COMPILE_ERROR,0,0
1591663524605386752,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-13 13:25:30,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main(){\n    int n,a[1000],count=0,i,j,t=0;\n      scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n        \n        \n    }\n    for( j=2;j<n-1;j++)\n    {\n        \n        if(a[j]<a[j-1]&&a[j]<a[j+1])\n        { count++;    count+=t;t=0;}\n             \n        else \n        if(a[j]==a[j+1])\n        {t=1;\n            continue;\n        }\n        \n       \n          \n            \n          \n    }\n    \n    \n    \n    \n   if(count!=0)\n      printf(\""%d\"",count+1);\n   else \n     printf(\""0\"");\n}",WRONG_ANSWER,5,324
1591663527889494016,cf76a6e5773cf2f19ddd635fa646c5a6721f6fed8998d22ea1d0910bee8017a2,2022-11-13 13:25:31,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#define N 30\nint main()\n{\n    int a[N];\n    int i,k=0,n;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n-2;i++)\n    {\n        if(a[i]>a[i+1]&&a[i+2]>a[i+1])\n        {\n             k++;\n        }\n         if(a[i+1]==a[i+2]&&a[i+1]<a[i])\n             k++;\n    }\n    \n   \n    printf(\""%d\"",k);\n    \n}",RUNTIME_ERROR,19,496
1591663543576223744,b8a7ba8e6c41741e66a8153e5f137c86c8dba9c4dbb2f65f35d7554a5b082d56,2022-11-13 13:25:35,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main(){\n   int a,count=0;\n    scanf(\""%d\"",&a);\n    int b[a];\n    b[a]<=1||b[a]>=0;\n    scanf(\""%d\"",&b[a]);\n    if(b[a]-b[a+1]!=0)\n        count++;\n    if(b[a-1]-b[a]!=0)\n        count++;\n        printf(\""%d\"",2*count);\n}",WRONG_ANSWER,10,472
1591663544306032640,919e6449799ef04f53dc21ab8608e866aab38f956abcadede4200c4c63859f1b,2022-11-13 13:25:35,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,b,c;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    int sum=0;\n    if(a>b)\n    {\n        sum=sum+b;\n        if(a>c)\n            sum=sum+c;\n        else\n            sum=sum+a;\n    }\n    else{\n        sum=sum+a;\n        if(b>c)\n            sum=sum+c;\n        else\n            sum=sum+b;\n    }\n    \n    printf(\""%d\"",sum);\n    return 0;\n}",ACCEPTED,34,488
1591663557526446080,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 13:25:38,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,a[100];\n    int i;\n    int t=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[n]);\n    }\n    for(i=0;i<n-2;i++)\n    {\n        if(a[i]>a[i+1] && a[i+2]>=a[i+1])\n            t=t+1;\n    }\n    printf(\""%d\"",t);\n    return 0;\n}",WRONG_ANSWER,5,324
1591663561821413376,da72e985b1ff1737d155282af7dd43e3dc341605cc356d114979edd4fea85a11,2022-11-13 13:25:39,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <string.h>\n#define MAX 20\nint main(void) {\n    int i,j,n,t=0;\n    int arr[MAX];\n    int s;\n    scanf(\""%d\"",&n); \n    scanf(\""%d\"",&s); \n    for(i=0;i<n;i++) {\n        arr[i]=s%10;\n        s=s/10;     \n    }\n    for(i=1;i<n;i++) {\n        if((arr[i]==1&&arr[i-1]==0)||(arr[i]==0&&arr[i-1]==1)) {\n            arr[i]=2;\n            arr[i-1]=2;\n            t+=2;\n        }   \n    }\n    for(i=0;i<n;i++) {\n        if(arr[i]==2)\n            continue;\n        for(j=i+1;j<n;j++) {\n            if(arr[i]==2)\n                continue;\n            if((arr[i]==1&&arr[j]==0)||(arr[i]==0&&arr[j]==1)) {\n                t+=2;\n            }\n        } \n    }\n    printf(\""%d\"",t);\n}",RUNTIME_ERROR,9,512
1591663582692270080,1773d9c971942817d949c47973c4eb8c24531f728d5480dbf3b232e568926258,2022-11-13 13:25:44,Java,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"import java.util.Arrays;\nimport java.util.Scanner;\npublic class main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int P = sc.nextInt();\n        int Q = sc.nextInt();\n        int R = sc.nextInt();\n        int[] arr = {P, Q, R};\n        Arrays.sort(arr);\n        int result = 0;\n        for (int i = 0; i < arr.length; i++) {\n            result = arr[0] + arr[1];\n        }\n        System.out.println(result);\n    }\n}\n",COMPILE_ERROR,0,0
1591663604196454400,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 13:25:49,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"n=eval(input())\na =[0]*n\nx = 0\nnum = 0\nlist = map(int,input().split())\nfor i in list:\na[x] = i\nx=x+1\nfor j in range(1,n-1):\nif (a[j]<a[j-1] and a[j]<a[j+1]) or (a[j]<a[j-1] and a[j]==a[j+1]): \nnum = num+1 \nprint(num)",NON_ZERO_EXIT_CODE,18,2756
1591663607317016576,6b02dfcf297d52c2de2e1416b33ee988ff909834c73207b147423a8301e9d174,2022-11-13 13:25:50,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main()\n{   int n;\nint k;\nint i; \n int *p;\n int a[i];\n \n \n scanf(\""%d/n\"",&n);\n  while(i<n){\n     scanf(\""%d\"",&a[i]);\n      i++;\n  }\n   \t\n   \n  for(i=0;i<n;i++)\n  {\n      while(a[i]!=a[i+1])\n   { \n   \tk=1;\n   \tk+=k;\n   }\n}\n     printf(\""%d\"",k);\n     return 0;\n}\n",TIME_LIMIT_EXCEEDED,400,192
1591663631824334848,13616e85f216dd3844293b46f4b46105a0a2c458f7807a7b677858feb35cb63a,2022-11-13 13:25:56,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,i,j,sum=0;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if(a[i]!=a[i+1])\n        {\n            \n             n=n-2;\n            sum=sum+2;\n            if(n==0)\n                break;\n            for(j=i;j<n;j++)\n            {\n            a[j]=a[j+2];\n            }\n            i=0;\n        }\n       \n    }\n    printf(\""%d\"",sum);\n    printf(\""\\n\"");\n    return 0;\n}",WRONG_ANSWER,5,452
1591663649427828736,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-13 13:26:00,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n = 0, i = 0, j = 0, count = 0;\n    scanf(\""%d\"",&n);\n    int arr[n];\n    for(i = 0;i < n; ++i)\n    {\n        scanf(\""%d\"",&arr[i]);\n    }\n    if(arr[0] == arr[1])\n    {\n         count++;\n    }\n    for(j = 1; j < n-2; ++j)\n    {\n        if(((arr[j] < arr[j-1]) && (arr[j] < arr[j+1])) || (arr[j] == arr[j+1]))\n        {\n            count++;\n        }\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",WRONG_ANSWER,13,352
1591663663566827520,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-13 13:26:03,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,print(60),ACCEPTED,22,2764
1591663676539809792,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 13:26:06,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,a[100];\n    int i;\n    int t=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n-2;i++)\n    {\n        if(a[i]>a[i+1] && a[i+2]>=a[i+1])\n            t=t+1;\n    }\n    printf(\""%d\"",t);\n    return 0;\n}",RUNTIME_ERROR,24,472
1591663679614279680,c5cc6f9845df4bd1986af86c0696296436bbc0f00a10a9f891b4100e57bc3a19,2022-11-13 13:26:07,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int a,b,c;\n    scanf(\""%d%d%d\"",&a,&b,&c);\n    int max=a;\n    if(b>max) max=b;\n    if(c>max) max=c;\n    printf(\""%d\\n\"" ,a+b+c-max);\n}",ACCEPTED,29,352
1591663684219625472,c39a4349139942a7aa7456b2c4609f8d0f9d0d3465be213d33870ec87eab1e58,2022-11-13 13:26:08,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    int P,Q,R,s;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    if(P>=Q>=R)\n        s=Q+R;\n    if(R>=Q>=P)\n        s=Q+P;\n    if(Q>=P>=R)\n        s=P+R;\n    printf(\""%d\"",s);\n}",WRONG_ANSWER,7,320
1591663695514853376,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 13:26:11,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"n=eval(input())\na =[0]*n\nx = 0\nnum = 0\nlist = map(int,input().split())\nfor i in list:\na[x] = i\nx=x+1\nfor j in range(1,n-1):\nif (a[j]<a[j-1] and a[j]<a[j+1]) or (a[j]<a[j-1] and a[j]==a[j+1]): \nnum=num+1   \nprint(num)",NON_ZERO_EXIT_CODE,23,2868
1591663716108873728,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-13 13:26:16,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,e=-1,i;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<n-1;i++)\n    if(a[i]<a[i+1])\n    e++;\n    printf(\""%d\"",e);\n    return 0;\n}",WRONG_ANSWER,8,356
1591663717753040896,9d0546dac18a9dc678295254e547925db086add5f872ef42d8015d525afeaf65,2022-11-13 13:26:16,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 3\nlong main()\n{\n    long num[N],i,j,temp;\n    for(i=0;i<N;i++){\n        scanf(\""%d\"",&num[i]);\n    }\n    for(i=1;i<N;i++){\n        for(j=0;j<N-i;j++){\n            if(num[j]>num[j+1]){\n                temp=num[j];\n                num[j]=num[j+1];\n                num[j+1]=temp;\n            }\n        }\n    }\n    printf(\""%d\\n\"",num[0]+num[1]);\n    return 0;\n}",WRONG_ANSWER,19,356
1591663731103510528,217f1946625720e554af7294d3599b943eea3b430c0df7aa0c5c70abe9904e56,2022-11-13 13:26:19,Java,300.0,1591610585635213318,1591131464941563904,1049226928954454016,import java.util.Scanner;\npublic class Main{\n    public static void main(String[] args){\n        Scanner sc=new Scanner(System.in);\n        int P=sc.nextInt();\n        int Q=sc.nextInt();\n        int R=sc.nextInt();\n        if(P+Q<=Q+R&&P+Q<R+P)\n        \tSystem.out.println(P+Q);\n        else if(Q+R<P+Q&&Q+R<P+R)\n        \tSystem.out.println(R+Q);\n        else if(P+R<Q+R&&P+R<P+Q)\n        \tSystem.out.println(P+R);\n    }\n},ACCEPTED,545,24920
1591663735067172864,c76414e1d2d8531a5745e9bd3192aafa7cca924e645650ffe7954c992cc13b33,2022-11-13 13:26:20,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\nint n,a,b,i;\nint sum=0;\nscanf(\""%d %d %d\"",&n,&a,&b);\nint s1[n],s2[n];\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&s1[i]);\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&s2[i]);\n\nfor(i=0;i<n;i++)\n    {\n    sum=sum+(s1[i]/(s2[i]+1)*pow(a,s2[i]+1)-(s1[i]/(s2[i]+1)*pow(b,s2[i]+1);\n    }\nprintf(\""%d\"",sum);\n}\n",COMPILE_ERROR,0,0
1591663736207990784,da72e985b1ff1737d155282af7dd43e3dc341605cc356d114979edd4fea85a11,2022-11-13 13:26:21,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <string.h>\n#define MAX 20\nint main(void) {\n    int i,j,n,t=0;\n    int arr[MAX];\n    int s;\n    scanf(\""%d\"",&n); \n    scanf(\""%d\"",&s); \n    for(i=0;i<n;i++) {\n        arr[i]=s%10;\n        s=s/10;     \n    }\n    for(i=1;i<n;i++) {\n        if((arr[i]==1&&arr[i-1]==0)||(arr[i]==0&&arr[i-1]==1)) {\n            arr[i]=2;\n            arr[i-1]=2;\n            t+=2;\n        }   \n    }\n    for(i=0;i<n;i++) {\n        if(arr[i]==2)\n            continue;\n        for(j=i+1;j<n;j++) {\n            if(arr[i]==2)\n                continue;\n            if((arr[i]==1&&arr[j]==0)||(arr[i]==0&&arr[j]==1)) {\n                t+=2;\n            }\n        } \n    }\n    printf(\""%d\"",t);\n}",RUNTIME_ERROR,5,352
1591663757011738624,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-13 13:26:26,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main(){\n\tint n,i,j;\n\tscanf(\""%d\"",&n);\n\tint m;\n\tm=n;\n\tchar a[n];\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%c\"",&a[i]);\n\t}\n\tfor(i=0;i<n;i++){\n\t\tif(a[i]!=a[i+1]){\n\t\t\tfor(j=i;j<n-2;j++){\n\t\t\t\ta[j]=a[j+2];\n\t\t\t}\n\t\t\tn-=2;\n\t\t\ti=0;\n\t\t}\n\t\telse\n\t\ti=-1;\n\t}\t\n\tint d;\n\td=m-n;\n\tprintf(\""%d\\n\"",d);\n}",TIME_LIMIT_EXCEEDED,400,204
1591663763949117440,c76414e1d2d8531a5745e9bd3192aafa7cca924e645650ffe7954c992cc13b33,2022-11-13 13:26:27,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\nint n,a,b,i;\nint sum=0;\nscanf(\""%d %d %d\"",&n,&a,&b);\nint s1[n],s2[n];\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&s1[i]);\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&s2[i]);\n\nfor(i=0;i<n;i++)\n    {\n    sum=sum+s1[i]/(s2[i]+1)*pow(a,s2[i]+1)-s1[i]/(s2[i]+1)*pow(b,s2[i]+1);\n    }\nprintf(\""%d\"",sum);\n}\n",WRONG_ANSWER,8,200
1591663765991731200,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-13 13:26:28,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"n=int(input())\n# data=list(map(int,list(input())))\ndata=input()\ndatas=list(data)\ncount=0\nfor i in range(int(n/2)):\n    for x in range(0,len(datas)-1):\n        if datas[x]!=datas[x+1]:\n            datas.pop(x)\n            datas.pop(x)\n            count+=1\n            break\nprint(count*2)",TIME_LIMIT_EXCEEDED,475,3784
1591663808194818048,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 13:26:38,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"n=eval(input())\na=[0]*n\nx=0\nnum=0\nlist=map(int,input().split())\nfor i in list:\na[x] = i\nx=x+1\nfor j in range(1,n-1):\nif (a[j]<a[j-1] and a[j]<a[j+1]) or (a[j]<a[j-1] and a[j]==a[j+1]): \nnum=num+1   \nprint(num)",NON_ZERO_EXIT_CODE,16,3048
1591663870312472576,86f702b052a21d7cb2f8cd933c678c21efaafaf5b2d35032f18ec35c1e26a945,2022-11-13 13:26:53,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int P,Q,R;\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    int a,b,c;\n    a=P+Q;\n    b=P+R;\n    c=Q+R;\n    if(a<=b&&a<=c) \n    {\n        printf(\""%d\\n\"",a);\n        /*printf(\""从 A 到 B 花费%d块钱，从 B 到 C 花费%d块钱，此时所有地点都去过了，总花费为%d块钱\"",P,Q,a);*/\n    }\n    if(c<a&&c<b) \n    {\n        printf(\""%d\\n\"",c);\n        /*printf(\""从 B 到 C 花费%d块钱，从 C到 A花费%d块钱，此时所有地点都去过了，总花费为%d块钱\"",Q,R,c);*/\n    }\n    if(b<a&&b<c) \n    {\n        printf(\""%d\\n\"",b);\n        /*printf(\""从 C 到 A 花费%d块钱，从 A 到 B 花费%d块钱，此时所有地点都去过了，总花费为%d块钱\"",R,P,b);*/\n    }\n    return 0;\n}",ACCEPTED,32,616
1591663912846942208,13eac09c9e523ec396926840225e626f8fff54ca0e8a92e46e533705daa83ac2,2022-11-13 13:27:03,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R,min;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    if(P+Q<P+R<Q+R)\n       min=P+Q;\n\n    if(P+R<P+Q<Q+R)\n\n       min==P+R;\n    if(Q+R<P+Q<P+R)\n\n        min==Q+R;\n    printf(\""%d\"",min);\n    return 0;\n}",WRONG_ANSWER,10,328
1591663915879378944,ddd0edd80a23dfec88d0679f4ed6037779b80d26db4ba0f74fecb3d447de61fa,2022-11-13 13:27:03,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#define Max 100000\nint main(){\n    int n,j=0,i,flag=0;\n    int a[Max];\n    scanf(\""%d\"",&n);\n    while(n){\n        scanf(\""%d\"",&a[j]);\n        n--;\n        j++;\n    }\nfor(i=1;i<j-2;i++)\n{\n    if(a[i]==a[i+1])\n    {\n     i=i+1;\n    }\n    if(a[i]>a[i+1]&&a[i+2]>=a[i+1])\n        flag++;\n}\n    printf(\""%d\\n\"",flag);\n}",WRONG_ANSWER,27,324
1591663924834263040,cf76a6e5773cf2f19ddd635fa646c5a6721f6fed8998d22ea1d0910bee8017a2,2022-11-13 13:27:06,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#define N 30\nint main()\n{\n    int a[N];\n    int i,k=0,n;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=1;i<n-3;i++)\n    {\n        if(a[i-1]>a[i]&&a[i+1]>a[i])\n        {\n             k++;\n        }\n         if(a[i]==a[i+1]&&a[i]<a[i-1]&&a[i+1]<a[i+2])\n             k++;\n    }\n    \n   \n    printf(\""%d\"",k);\n    \n}",RUNTIME_ERROR,21,512
1591663944803299328,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-13 13:27:10,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    int a[n],i,b=0;\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n        if(a[i]==0||a[i+1]!=0)\n            b++;\n    }\n    \n}",WRONG_ANSWER,11,364
1591663957239410688,064270dabaa13edbd7238477860db0e46621a5ed4921e8aa2c0f9258e77722cc,2022-11-13 13:27:13,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 100\nint main()\n{\nint sum[N];\nint a,i;\nint count=0;\nscanf(\""%d\"",&a);\n\nfor(i=1;i<a-4;i++)\n   {\n       scanf(\""%d\"",&sum[i]);\n       if(sum[i]<=sum[i+1]&&sum[i]<=sum[i-1])\n        count++;\n   }\n\n\nprintf(\""%d\"",count);\n}\n",WRONG_ANSWER,6,352
1591663990022103040,902d8082eea06043d392298983db4630cde4418ac8ee42282d537bfaae045c2f,2022-11-13 13:27:21,Python,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"a=input().split(\"" \"")\na=list(a)\nmin=int(a[0])+int(a[1])\nfor i in range(2):\n    if int(a[i])+int(a[i+1])<=min:\n        min=int(a[i])+int(a[i+1])\nif min>int(a[0])+int(a[2]):\n    min = int(a[0]) + int(a[2])\nprint(min)",ACCEPTED,95,2904
1591664007113891840,7935e8f5cb04027f4d30ac84a997e2d03e946e112c1cb17f1a4f943d8b0b54bf,2022-11-13 13:27:25,C++,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <iostream>\n#include<stdio.h>\n#include<algorithm>\nusing namespace std;\n\nint main()\n{\n    int n,i,t,m,x=0;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i+3<=n;i=i+3)\n    {\n        t=a[i+2]-5;\n        m=a[i]+a[i+1]+a[i+2]-15;\n        x=x+max(t,m);\n    }\n    if(n%3==2)\n        x=x-10+a[n-1]+a[n-2];\n    if(n%3==1)\n        x=x-5+a[n-1];\n    printf(\""%d\\n\"",x);\n    return 0;\n}\n",WRONG_ANSWER,7,324
1591664016043552768,064270dabaa13edbd7238477860db0e46621a5ed4921e8aa2c0f9258e77722cc,2022-11-13 13:27:27,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 100\nint main()\n{\nint sum[N];\nint a,i;\nint count=0;\nscanf(\""%d\"",&a);\n\nfor(i=1;i<a;i++)\n   {\n       scanf(\""%d\"",&sum[i]);\n       if(sum[i]<=sum[i+1]&&sum[i]<=sum[i-1])\n        count++;\n   }\n\n\nprintf(\""%d\"",count);\n}\n",WRONG_ANSWER,7,348
1591664071307747328,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-13 13:27:40,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main(){\n\tint n,i,j;\n\tscanf(\""%d\"",&n);\n\tint m;\n\tm=n;\n\tchar a[n];\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%c\"",&a[i]);\n\t}\n\tfor(i=0;i<n;i++){\n\t\tif(a[i]!=a[i+1]){\n\t\t\tfor(j=i;j<n-2;j++){\n\t\t\t\ta[j]=a[j+2];\n\t\t\t}\n\t\t\tn-=2;\n\t\t\ti=0;\n\t\t}\n\t}\t\n\tint d;\n\td=m-n;\n\tprintf(\""%d\\n\"",d);\n}",WRONG_ANSWER,5,196
1591664081902526464,064270dabaa13edbd7238477860db0e46621a5ed4921e8aa2c0f9258e77722cc,2022-11-13 13:27:43,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 100\nint main()\n{\nint sum[N];\nint a,i;\nint count=0;\nscanf(\""%d\"",&a);\n\nfor(i=1;i<a-4;i++)\n   {\n       scanf(\""%d\"",&sum[i]);\n       if(sum[i]<=sum[i+1]&&sum[i]<=sum[i-1])\n        count++;\n   }\n\n\nprintf(\""%d\"",count);\n}\n",WRONG_ANSWER,5,480
1591664085446701056,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-13 13:27:44,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n\n\n//O(N)\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"",&n);\n\n    int arr[n];\n    int i = 0;\n    for(i = 0; i < n; ++i){\n        scanf(\""%d\"",&arr[i]);\n    }\n\n    int width = 0;\n    int j = 0;\n    int mul = 1;\n    int max = 0;\n    for(i = 0; i < n; ++i){\n        for(j = 0; j < n; ++j){\n            if( i >= 1 && arr[i-1] < arr[i]){\n                j = i;\n            }\n            if(arr[i] <= arr[j]){\n                ++width;\n            }\n        }\n        mul = width * arr[i];\n\n        if(mul > max){\n            max = mul;\n        }\n\n        width = 0;\n    }\n\n    printf(\""%d\"",max);\n\n    return 0;\n}",TIME_LIMIT_EXCEEDED,400,356
1591664086587564032,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-13 13:27:44,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"n=int(input())\n# data=list(map(int,list(input())))\ndata=input()\ndatas=list(data)\ncount=0\nfor i in range(int(n/2)):\n    for x in range(0,len(datas)-1):\n        if datas[x]!=datas[x+1]:\n            del datas[x]\n            del datas[x]\n            count+=1\n            break\nprint(count*2)",TIME_LIMIT_EXCEEDED,479,3924
1591664097513725952,423e1acd0d02cf3d43f3c7805099dea4edcb39c2e0fa385e82823b5a7c0dd214,2022-11-13 13:27:47,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,j;\n    int c=0;\n    int a[100];\n    int cout=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=1;j<n;j++){\n        if(a[j]<a[j-1]&&a[j]<a[j+1])\n            cout++;\n            if(a[j]==a[j+1])\n                c++;\n    }\n    printf(\""%d\\n\"",cout+c-1);\n    return 0;\n}\n",RUNTIME_ERROR,40,328
1591664101439594496,d9e00d995e65b04cda3ddef6baec19225e4351002ab4efa981f62d78919a481b,2022-11-13 13:27:48,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i;\n    int arr[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&arr[i]);\n    }\n    int cnt=0;\n    for(i=0;i<n;i++){\n        if(arr[i+1] < arr[i] && arr[i+1] <arr[i+2]){\n            cnt ++;\n        }\n        if(arr[i+1] == arr[i+2] && arr[i+1] < arr[i] && arr[i+2] < arr[i+3])\n            cnt++;\n    }\n    printf(\""%d\"",cnt);\n    return 0;\n}",WRONG_ANSWER,5,192
1591664109371023360,07d925df8d2026d3171a0a2ca84a6ef7f4a5b47a584cf47b66c5dd8f28139d1f,2022-11-13 13:27:50,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a[100],count,n,i;\n    count=0;\n    scanf(\""%d\"",&n);\n    for (i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n        if(a[i]>=a[i-1]&&a[i]<a[i+1])\n            count++;\n    }\n    printf(\""%d\\n\"",count);\n    return 0;\n}",WRONG_ANSWER,15,348
1591664113917636608,25584884fd716238437f89484285121d106c1090916ab683be624f210130ebad,2022-11-13 13:27:51,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n   int i,P,Q,R,sum1,sum2,sum3,min;\n   scanf(\""%d %d %d\"",&P,&Q,&R);\n   sum1=P+Q;sum2=R+Q;sum3=P+R;\nint a[3]={sum1,sum2,sum3};\nfor(i=0;i<3;i++)\n{\n    min=a[0];\n    if(a[i]<min)\n        printf(\""%d\"",min);\n}\nreturn 0;\n}\n\n\n\n\n\n\n\n",WRONG_ANSWER,5,512
1591664143021912064,00d0a1b2e987c17fb50850b9ec54bf6b4f8b997eb053d1a9fed6c4888fbe74ed,2022-11-13 13:27:58,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,i,j,a[n],max=0,min,flag;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        flag=0;\n        for(j=i;j<n;j++)\n        {\n            if (a[i]<=a[j+1])\n                flag=flag+1;\n            else break;\n        }\n        if(flag!=0)\n        min=a[i]*(flag+1);\n        else min=0;\n            if(max<=min)\n                max=min;\n        \n    }\n    if\n        printf(\""%d\\n\"",max);\n        return 0;\n}",COMPILE_ERROR,0,0
1591664201113034752,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 13:28:11,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n;\n    int i;\n    int t=0;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n-2;i++)\n    {\n        if(a[i]>a[i+1] && a[i+2]>=a[i+1])\n            t=t+1;\n    }\n    printf(\""%d\"",t);\n    return 0;\n}",ACCEPTED,35,332
1591664235040747520,00d0a1b2e987c17fb50850b9ec54bf6b4f8b997eb053d1a9fed6c4888fbe74ed,2022-11-13 13:28:19,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,i,j,a[n],max=0,min,flag;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        flag=0;\n        for(j=i;j<n;j++)\n        {\n            if (a[i]<=a[j+1])\n                flag=flag+1;\n            else break;\n        }\n        if(flag!=0)\n        min=a[i]*(flag+1);\n        else min=0;\n            if(max<=min)\n                max=min;\n        \n    }\n    \n        printf(\""%d\\n\"",max);\n        return 0;\n}",WRONG_ANSWER,16,352
1591664240216530944,6933dcb3592e2d6f6fc887ed9a5537aab21a30f76450c9b5043f7776bfc39a59,2022-11-13 13:28:21,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nvoid main(){\n    int p,q,r;\n    scanf(\""%d %d %d\"",&p,&q,&r);\n    if(p+q>q+r){\n        printf(\""%d\"",q+r);\n    }else{\n        printf(\""%d\"",p+q);\n    }\n}",ACCEPTED,26,328
1591664280679014400,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-13 13:28:30,Python,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"list1 = []\nlist1 = input().split(\"" \"")\na=int(list1[0])\nb=int(list1[1])\nc=int(list1[2])\nif a>=c:\n    if a>=b:\n        print(b+c)\nif b>=c:\n    if b>=a:\n        print(c+a)\nif c>=b :\n    if c>=a:\n        print(b+a)\n",ACCEPTED,102,3044
1591664295413559296,1b00b3d29099722d8332b35e3af5e54fda309b4f7c9fc6261f618ecd2a4d7390,2022-11-13 13:28:34,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int P,Q,R,i,sum1,sum2,sum3;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    sum1=P+Q;//A\n    sum2=Q+R;//B\n    sum3=R+P;//C\n    if(sum1<=sum2&&sum1<=sum3)\n        printf(\""%d\"",sum1);\n    if(sum2<sum3&&sum2<sum1)\n        printf(\""%d\"",sum2);\n    if(sum3<sum2&&sum3<sum1)\n    printf(\""%d\"",sum3);\n        return 0;\n}",ACCEPTED,41,512
1591664307170238464,1773d9c971942817d949c47973c4eb8c24531f728d5480dbf3b232e568926258,2022-11-13 13:28:37,Java,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"import java.util.Arrays;\nimport java.util.Scanner;\npublic class main.java {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int P = sc.nextInt();\n        int Q = sc.nextInt();\n        int R = sc.nextInt();\n        int[] arr = {P, Q, R};\n        Arrays.sort(arr);\n        int result = 0;\n        for (int i = 0; i < arr.length; i++) {\n            result = arr[0] + arr[1];\n        }\n        System.out.println(result);\n    }\n}\n",COMPILE_ERROR,0,0
1591664324710772736,0cfbb4a339ebbc4dce13b5f3e3f98a3def0ab17ef5b4ac8e6d566de92e1f5f78,2022-11-13 13:28:41,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n;\n    int h[1001];\n    int count=0;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        scanf(\""%d\"",&h[i]);\n    }\n    for(int i=0;i<n;i++){\n        if(h[i]<h[i+1]&&h[i]<h[i-1]){\n            count++;\n        }\n    }\n    printf(\""%d\"",count);\n}",WRONG_ANSWER,5,320
1591664327311241216,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-13 13:28:41,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main(){\n\tint n,i,j;\n\tscanf(\""%d\"",&n);\n\tint m;\n\tm=n;\n\tchar a[n];\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%c\"",&a[i]);\n\t}\n\tfor(i=0;i<n;i++){\n\t\tif(a[i]!=a[i+1]){\n\t\t\tfor(j=i;j<n-2;j++){\n\t\t\t\ta[j]=a[j+2];\n\t\t\t}\n\t\t\tn-=2;\n\t\t\ti=-1;\n\t\t}\n\t}\t\n\tint d;\n\td=m-n;\n\tprintf(\""%d\\n\"",d);\n}",TIME_LIMIT_EXCEEDED,424,348
1591664352191897600,7935e8f5cb04027f4d30ac84a997e2d03e946e112c1cb17f1a4f943d8b0b54bf,2022-11-13 13:28:47,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n    int n,i,t,m,x=0;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i+3<=n;i=i+3)\n    {\n        t=a[i+2]-5;\n        m=a[i]+a[i+1]+a[i+2]-15;\n        if(t>m)\n            x=x+t;\n        else\n            x=x+m;\n    }\n    if(n%3==2)\n        x=x-10+a[n-1]+a[n-2];\n    if(n%3==1)\n        x=x-5+a[n-1];\n    printf(\""%d\\n\"",x);\n    return 0;\n}\n",WRONG_ANSWER,8,352
1591664366880317440,fbea21dbaf89f1b064feaa20227f21c5e1c4888fdc371cf5e43f70615906e52a,2022-11-13 13:28:51,Python,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"n=int(input())\ns=list(map(int,input().split()))\nk=0\nfor i in range(n-1):\n    if s[i]<s[i-1] and s[i]<=s[i+1]:\n        k+=1        \nprint(k)",ACCEPTED,90,3200
1591664430201757696,0cfbb4a339ebbc4dce13b5f3e3f98a3def0ab17ef5b4ac8e6d566de92e1f5f78,2022-11-13 13:29:06,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n;\n    int h[1001];\n    int count=0;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        scanf(\""%d\"",&h[i]);\n    }\n    for(int i=0;i<n;i++){\n        if(h[i]<=h[i+1]&&h[i]<=h[i-1]){\n            count++;\n        }\n    }\n    printf(\""%d\"",count);\n}",WRONG_ANSWER,5,348
1591664446249164800,a57fdafe4877cd9608fc0ac8a5120a47bc60a015785960e61b67b4e66187c2f2,2022-11-13 13:29:10,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n#define N 100\nint jifen (int a,int c,int f){\n    int j,w;\n    j=c/(f+1);\n    w=j*pow(a,f+1);\n    return w;\n}\nint main(){\n    int n,a,b,i,max=0;\n    int z[N],m[N],p[N];\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&z[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&m[i]);\n    for(i=0;i<n;i++){\n        p[i]=jifen(a,z[i],m[i])-jifen(b,z[i],m[i]);\n    }\n     for(i=0;i<n;i++){\n        max+=p[i];\n    }\n    printf(\""%d\"",max);\n}",WRONG_ANSWER,9,352
1591664454662905856,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-13 13:29:12,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main(){\n\tint n,i,j;\n\tscanf(\""%d\"",&n);\n\tint m;\n\tm=n;\n\tchar a[n];\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%c\"",&a[i]);\n\t}\n\tfor(i=0;i<n;){\n\t\tif(a[i]!=a[i+1]){\n\t\t\tfor(j=i;j<n-2;j++){\n\t\t\t\ta[j]=a[j+2];\n\t\t\t}\n\t\t\tn-=2;\n\t\t\ti=0;\n\t\t}\n\t\telse i++;\n\t}\t\n\tint d;\n\td=m-n;\n\tprintf(\""%d\\n\"",d);\n}",TIME_LIMIT_EXCEEDED,442,508
1591664465186414592,55950e2d4c314feed0856fa0f6b80f22c5c36f2ebe0d75c8ee2cadb1a06b2fe1,2022-11-13 13:29:14,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int n,a,b,c[100],i,d[100],an=0,bn=0,cn;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&c[i]);\n        scanf(\""%d\"",&d[i]);\n\n\n    }\n    for(i=0;i<n;i++){\n        an=an+((c[i])/(d[i]+1))*pow(a,d[i]+1);\n        bn=bn+((c[i])/(d[i]+1))*pow(b,d[i]+1);\n\n\n\n    }\n    cn=an-bn;\n    printf(\""%d\"",cn);\n\n\n\n\n\n\n\n\n\n    return 0;\n}\n",WRONG_ANSWER,6,220
1591664475303075840,acf80eea856463058b81f71c0238069795893092293fbd098cc594959df6444e,2022-11-13 13:29:17,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,n=int(input())\ns=input().split()\nh=0\nfor i in range(n-2):\n    if s[i]>s[i+1]:\n        h=h+1\n    else:\n        h=h+0\nprint(h)\n    \n,WRONG_ANSWER,16,2764
1591664480403337216,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-13 13:29:18,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<iostream>\nusing namespace std;\nclass resolve{\n    public:\n        int max(int a,int b,int c){\n        if(a>=b&&a>=c)\n            return b+c;\n        if(b>=a&&b>=c)\n            return a+c;\n        if(c>=a&&c>=b)\n            return a+b;\n    }\n};\n\nint main(){\n    int P,Q,R;\n    cin>>P>>Q>>R;\n    if(P>=1&&P<=1000&&Q>=1&&Q<=1000&&R>=1&&R<=1000){\n        resolve res;\n        cout<<res.max(P,Q,R)<<endl;\n    }\n        \n    return 0;\n}",WRONG_ANSWER,5,468
1591664510702989312,7ecf54bf0ea2db8ab0397aa941f19ec79a351bc3e86e8c01673aa09a69b3a6db,2022-11-13 13:29:25,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n\tint n,sum=0,f=0;\n\tscanf(\""%d\"",&n);\n\tint s[n];\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&s[i]);\n\t}\n\tfor(int i=0;i<n-1;i++)\n\t{\n\t\tswitch(f)\n\t\t{\n\t\t\tcase 0:\n\t\t\t\tif(s[i]>s[i+1])f=1;  //入坑\n\t\t\t\tbreak;\n\t\t\tcase 1:\n\t\t\t\tif(s[i]<s[i+1])\n                {\n                    f=2;  //爬坡\n                    sum++;\n                }\n\t\t\t\tbreak;\n\t\t\tcase 2:\n\t\t\t\tif(s[i]>s[i+1])f=1;  //再次入坑\n\t\t\t\tbreak; \n\t\t}\n\t\t\n\t}\n\tprintf(\""%d\\n\"",sum);\n}\n\n",ACCEPTED,25,372
1591664515912327168,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-13 13:29:26,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j,k=0,h=0;\n    int a[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=1;j<n-1;j++)\n    {\n        if(a[j]<a[j-1]&&a[j+1]>a[j])\n        {\n            k++;\n        }\n        if(a[j]==a[j+1]&&a[j]<a[j-1]&&a[j+1]<a[j+2])\n        {\n            h++;\n        }\n    }\n    printf(\""%d\\n\"",k+h);\n}",RUNTIME_ERROR,21,328
1591664520597364736,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 13:29:28,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"n=eval(input())\na=[0]*n\nx=0\nnum=0\nlist=map(int,input().split())\nfor i in list:\na[x] = i\nx=x+1\nfor j in range(1,n-1):\n    if (a[j]<a[j-1] and a[j],a[j+1]) or (a[j]<a[j-1] and a[j]==a[j+1]): \n    num=num+1\nprint(num)",NON_ZERO_EXIT_CODE,16,2884
1591664531498360832,d9e00d995e65b04cda3ddef6baec19225e4351002ab4efa981f62d78919a481b,2022-11-13 13:29:30,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i;\n    int arr[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&arr[i]);\n    }\n    int cnt=0;\n    for(i=0;i<n-2;i++){\n        if(arr[i+1] < arr[i] && arr[i+1] <=arr[i+2]){\n            cnt ++;\n        }\n    }\n    printf(\""%d\"",cnt);\n    return 0;\n}",RUNTIME_ERROR,22,380
1591664552369217536,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 13:29:35,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"n=eval(input())\na=[0]*n\nx=0\nnum=0\nlist=map(int,input().split())\nfor i in list:\na[x] = i\nx=x+1\nfor j in range(1,n-1):\n    if (a[j]<a[j-1] and a[j],a[j+1]) or (a[j]<a[j-1] and a[j]==a[j+1]): \n        num=num+1\nprint(num)",NON_ZERO_EXIT_CODE,16,2884
1591664569968504832,b8a7ba8e6c41741e66a8153e5f137c86c8dba9c4dbb2f65f35d7554a5b082d56,2022-11-13 13:29:39,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main(){\n   int a,count=0;\n    scanf(\""%d\"",&a);\n    int b[a];\n    b[a]<=1||b[a]>=0;\n    scanf(\""%d\"",&b[a]);\nfor(int i=0;i<a;i++)\n{\n     if(b[i]!=b[i+1])\n        count++;\n    if(b[i]=b[i+1])\n        break;\n    \n}\n        printf(\""%d\"",2*count);\n}",WRONG_ANSWER,10,200
1591664570564108288,b31601c92a4a3080abbaad650e00bb77253224eab66b59a49b2118d017649c2c,2022-11-13 13:29:39,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b,c,d,e,f ;\n    scanf(\""%d%d%d\"",&a,&b,&c);\n    d = a+b;\n    e = a+c;\n    f = b+c;\n    if(d>=e){\n        if(e>=f){\n            printf(\""%d\"",f);\n        }\n        else{\n        printf(\""%d\"",e);}\n    }\n    else{\n        if(d>=f){\n            printf(\""%d\"",f);\n        }\n        else{\n            printf(\""%d\"",d);\n        }\n    }\n    return 0;\n}\n",ACCEPTED,34,488
1591664579141447680,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-13 13:29:42,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main(){\n    int n,a[1000],count=0,i,j,t=0;\n      scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n        \n        \n    }\n    for( j=2;j<n-1;j++)\n    {\n        \n        if(a[j]<a[j-1]&&a[j]<a[j+1])\n        { count++;    count+=t;t=0;}\n             \n        else \n        if(a[j]==a[j+1])\n        {t=1;\n            continue;\n        }\n        if(j==n-2) count+=t;\n        \n       \n          \n            \n          \n    }\n    \n    \n    \n    \n   if(count!=0)\n      printf(\""%d\"",count);\n   else \n     printf(\""0\"");\n}",WRONG_ANSWER,7,200
1591664588230504448,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-13 13:29:44,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n = 0, i = 0, j = 0, count = 0;\n    scanf(\""%d\"",&n);\n    int arr[n];\n    for(i = 0;i < n; ++i)\n    {\n        scanf(\""%d\"",&arr[i]);\n    }\n    if(arr[0] == arr[1])\n    {\n         count++;\n    }\n    for(j = 1; j < n-2; ++j)\n    {\n        if(((arr[j] < arr[j-1]) && (arr[j] < arr[j+1])) || (arr[j] == arr[j+1]))\n        {\n            count++;\n        }\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",WRONG_ANSWER,5,192
1591664617376722944,d9e00d995e65b04cda3ddef6baec19225e4351002ab4efa981f62d78919a481b,2022-11-13 13:29:51,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i;\n    scanf(\""%d\"",&n);\n    int arr[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&arr[i]);\n    }\n    int cnt=0;\n    for(i=0;i<n-2;i++){\n        if(arr[i+1] < arr[i] && arr[i+1] <=arr[i+2])\n            cnt ++;\n    }\n    printf(\""%d\"",cnt);\n    return 0;\n}",ACCEPTED,37,512
1591664630379077632,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-13 13:29:54,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j,k=0,h=0;\n    int a[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=1;j<n-1;j++)\n    {\n        if(a[j]<a[j-1]&&a[j+1]>a[j])\n        {\n            k++;\n        }\n        if(a[j]==a[j+1]&&a[j]<a[j-1]&&a[j+1]<a[j+2])\n        {\n            h++;\n        }\n    }\n    printf(\""%d\\n\"",k+h);\n}",RUNTIME_ERROR,27,352
1591664648670425088,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-13 13:29:58,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main(){\n\tint n,i,j;\n\tscanf(\""%d\"",&n);\n\tint m;\n\tm=n;\n\tchar a[n];\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%c\"",&a[i]);\n\t}\n\tfor(i=0;i<n;){\n\t\tif(a[i]!=a[i+1]){\n\t\t\tfor(j=i;j<n-2;j++){\n\t\t\t\ta[j]=a[j+2];\n\t\t\t}\n\t\t\tn=n-2;\n\t\t\ti=0;\n\t\t}\n\t\telse i++;\n\t}\t\n\tint d;\n\td=m-n;\n\tprintf(\""%d\\n\"",d);\n}",TIME_LIMIT_EXCEEDED,428,332
1591664649865801728,1773d9c971942817d949c47973c4eb8c24531f728d5480dbf3b232e568926258,2022-11-13 13:29:58,Java,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"import java.util.Arrays;\nimport java.util.Scanner;\nclass main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int P = sc.nextInt();\n        int Q = sc.nextInt();\n        int R = sc.nextInt();\n        int[] arr = {P, Q, R};\n        Arrays.sort(arr);\n        int result = 0;\n        for (int i = 0; i < arr.length; i++) {\n            result = arr[0] + arr[1];\n        }\n        System.out.println(result);\n    }\n}\n",COMPILE_ERROR,0,0
1591664663476330496,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 13:30:02,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"n=eval(input())\na=[0]*n\nx=0\nnum=0\nlist=map(int,input().split())\nfor i in list:\n    a[x] = i\n    x=x+1\nfor j in range(1,n-1):\n    if (a[j]<a[j-1] and a[j],a[j+1]) or (a[j]<a[j-1] and a[j]==a[j+1]): \n        num=num+1\nprint(num)",WRONG_ANSWER,16,2760
1591664694082199552,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-13 13:30:09,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\nint main(){\n    int gd = -5; // 固定减5\n    int count = 0;\n    int num = 0;\n    int len;\n    int j=0;\n    if(scanf(\""%d\"",&len)){};\n    int arr[len];\n    \n        for(int i=0; i<len; i++){\n            if(scanf(\""%d\"",&arr[i])){};\n        }\n        \n        while(j<len){\n            // 给count赋值 单步最大\n            if(arr[j+1]+gd > arr[j+3]+gd){\n                count = arr[j+1]+gd;\n                j=j+1;\n            }else{\n                count = arr[j+3]+gd;\n                j=j+3;\n            }\n            // 总数最\n                num += count;\n            \n        }\n    printf(\""%d\"",count);\n}",WRONG_ANSWER,6,324
1591664712675504128,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-13 13:30:13,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,e=-1,i;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<n-1;i++)\n    if(a[i]>a[i+1])\n    e++;\n    \n    printf(\""%d\"",e);\n    return 0;\n}",WRONG_ANSWER,8,200
1591664719835226112,064270dabaa13edbd7238477860db0e46621a5ed4921e8aa2c0f9258e77722cc,2022-11-13 13:30:15,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 100\nint main()\n{\nint sum[N];\nint a,i;\nint count=0;\nscanf(\""%d\"",&a);\n\nfor(i=1;i<a;i++)\n   {\n       scanf(\""%d\"",&sum[i]);\n       if(sum[i]<=sum[i+1]&&sum[i]<sum[i-1])\n        count++;\n   }\n\n\nprintf(\""%d\"",count);\n}\n",WRONG_ANSWER,8,196
1591664724939649024,03f9d7a6fc27d141b8243d1b2b44a3276cdd4750b5c2621d6d8c006b64ca6514,2022-11-13 13:30:16,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int p,q,r;\n    int a,b,c;\n    scanf(\""%d %d %d\"",&p,&q,&r);\n    a=p+q; //5\n    b=r+p; //6\n    c=q+r; //5\n    if(a>=b&&b>=c)\n        printf(\""%d\"",c);\n    if(a<=b&&b<=c)\n        printf(\""%d\"",a);\n    if(a<=c&&c<=b)\n        printf(\""%d\"",a);\n    return 0;\n}\n",WRONG_ANSWER,24,356
1591664732896243712,d0d7b0b753346ba8da319a4bb32af868fdf41e2104a53a3a3d7b5b76c65907fe,2022-11-13 13:30:18,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int p,q,r;\n    int x,y,z;\n    int min=0;\n    scanf(\""%d %d %d\"",&p,&q,&r);\n    x=p+q;\n    y=p+r;\n    z=q+r;\n    if(x<y)\n        min=x;\n    else\n        min=y;\n    if(min<z)\n        printf(\""%d\"",min);\n        else\n            printf(\""%d\"",z);\n            return 0;\n}",ACCEPTED,34,496
1591664763229495296,064270dabaa13edbd7238477860db0e46621a5ed4921e8aa2c0f9258e77722cc,2022-11-13 13:30:25,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 100\nint main()\n{\nint sum[N];\nint a,i;\nint count=0;\nscanf(\""%d\"",&a);\n\nfor(i=1;i<a;i++)\n   {\n       scanf(\""%d\"",&sum[i]);\n       if(sum[i]<=sum[i+1]&&sum[i]<sum[i-1])\n        count++;\n   }\n\n\nprintf(\""%d\"",count-1);\n}\n",WRONG_ANSWER,6,196
1591664781571186688,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-13 13:30:30,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    int a[n],i,b=0;\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n        if()\n            b++;\n    }\n    \n}",COMPILE_ERROR,0,0
1591664806573387776,a5291eb67188c2a916aa5dd9fc38f2e449aa9f9a3cd047f282d8c154ea2979cd,2022-11-13 13:30:36,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,#include <iostream>\n#include <vector> \nusing namespace std;\n\nconst int N = 1e6 + 10;\nint h[N];\n\n\nint main()\n{\n\tint n = 0;\n\tcin >> n;\n\tint max = 0;\n\tfor(int i = 1;i <= n;i++)\n\t{\n\t\tcin >> h[i];\n\t\tif(h[i] > max)\n\t\t{\n\t\t\tmax = h[i];\n\t\t}\n\t\t\n\t}\n\tint S_max = 0;\n\tfor(int i = 1;i <= n;i++)\n\t{\n\t\tint min_h = max + 10;\n\t\tfor(int j = i;j <= n;j++)\n\t\t{\n\t\t\tint S = 0;\n\t\t\tif(h[j] >= h[i])\n\t\t\t{\n\t\t\t\tif(min_h != max + 10)\n\t\t\t\t{\n\t\t\t\t\tS = (j - i + 1) * min_h;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tS = (j - i + 1) * h[i];\t\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tS = (j - i + 1) * h[j];\n\t\t\t\tif(h[j] < min_h)\n\t\t\t\t{\n\t\t\t\t\tmin_h = h[j];\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(S > S_max)\n\t\t\t{\n\t\t\t\tS_max = S;\t\n\t\t\t}\n\t\t}\n\t\t\n\t}\n\t\n\tcout << S_max << endl;\n\t\n\n\n\treturn 0;\n} ,WRONG_ANSWER,7,456
1591664829969215488,f6233bf69e5717913375f818af07214d1d2de6df0cd3bcb24368fbde112d6d15,2022-11-13 13:30:41,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,print(3)\n,WRONG_ANSWER,19,2764
1591664851309879296,ece045c1570c74e6800520e16047010817642535f83b9f2b4524ebdcf9d7925a,2022-11-13 13:30:46,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int n,i;\n    int sum=0;\n    scanf(\""%d\"",&n);\n     int a[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if((a[i+1]<a[0])&&(a[i+1]<a[i]))\n        sum++;\n        else if(a[i+1]=a[i+2])\n        {\n            if(a[i+2]>a[i+3])\n            sum++;\n        }\n\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,6,512
1591664871727706112,cf76a6e5773cf2f19ddd635fa646c5a6721f6fed8998d22ea1d0910bee8017a2,2022-11-13 13:30:51,C,0.0,1591610585635213314,1591128862958940160,1049226928954454016,"#include<stdio.h>\n#define N 10\nint main()\n{\n    int n,i,j,t;\n    int a[N];\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n-1;i++)\n    {\n       scanf(\""%d\"",&a[i]);\n    }\n     for(i=0;i<n-1;i++)\n     {\n        for(j=0;j<3;j++)\n        {\n            if(a[j]<a[j+1])\n          {\n             t=a[j];\n             a[j]=a[j+1];\n             a[j+1]=t;\n           }\n        }\n      }\n     printf(\""%d \"",n);\n    for(i=0;i<n-1;i++)\n        printf(\""%d \"",a[i]);\n}\n",SEGMENTATION_FAULT,6,196
1591664877801058304,675867a135da6702ed27c0eec3e4b6d2a7d95c44854c01823fc152f0689f010d,2022-11-13 13:30:53,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#define MAX 50\nint main(void)\n{\n\tint n, a[MAX];\n\tint i, m;\n\tint max1, max2, temp;\n\tmax1=0;\n\tmax2=0;\n\ttemp=0;\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++)\n\t\tscanf(\""%d\"",&a[i]);\n\t\n\tfor(m=1;m<=3;m+=2)\n\t{\n\t\tif(m==1){\n\t\t\tfor(i=0;i<n;i++)\n\t\t\t{\n\t\t\t\ttemp+=a[i]-5;\n\t\t\t\tif(temp<0)\n\t\t\t\t\ttemp=0;\n\t\t\t\tif(temp>max1){\n\t\t\t\t\tmax1=temp;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(m=3){\n\t\t\ttemp=0;\n\t\t\tfor(i=0;i<n;i+=3)\n\t\t\t{\n\t\t\t\ttemp+=a[i]-5;\n\t\t\t\tif(temp<0)\n\t\t\t\t\ttemp=0;\n\t\t\t\tif(temp>max2){\n\t\t\t\t\tmax2=temp;\n\t\t\t\t}\t\n\t\t\t}\n\t\t}\n\t}\n\tif(max1>max2)\n\t\tprintf(\""%d\\n\"",max1);\n\telse\n\t\tprintf(\""%d\\n\"",max2);\n\t\t\n\t\n\treturn 0;\n}",SEGMENTATION_FAULT,12,512
1591664883337584640,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-13 13:30:54,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int num;\n    scanf(\""%d\"",&num);\n    int a[num];\n    int i;\n    int count = 0;\n    for(i = 0;i < num;i++) {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i = 1;i<num-1;i++){\n        if(a[i] < a[i-1] && a[i] < a[i+1]){\n            count++;\n        }\n        if(a[i] < a[i-1] && a[i] == a[i+1]) {\n            count++;\n        }\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",ACCEPTED,70,368
1591664889415086080,d808f4cc3c70a696f5c416714e0998fe96743e5273bc07a26f75738d12d304f5,2022-11-13 13:30:55,Java,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"import java.util.Scanner;\nimport java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n        int n,count=0;\n        Scanner sc=new Scanner(System.in);\n        n=sc.nextInt();\n        int[] a=new int[n];\n        for(int i=0;i<n;i++){\n        \ta[i]=sc.nextInt();\n        }   \n        for(int i=1;i<n-1;i++){\n        \tif(a[i]<=a[i-1]&&a[i]<a[i+1]){\n        \t\tcount++;\n        \t}\n        }\n        System.out.println(count);\n\t}\n}\n",ACCEPTED,588,26000
1591664910218833920,c358160a3e618a44cd693944fe10043e6372f46bf7d517c3c3f583bd85b17c5e,2022-11-13 13:31:00,Python,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"n, m ,y= map(int,input().split())\nmin=0\nif n+m < m+y:\n    if n+m < n+y:\n        min = n+m\n    else:\n        min=n+y\nelse:\n    if m+y<n+y:\n        min=m+y\n    else:\n        min=n+y    \nprint(min)\n",ACCEPTED,91,3012
1591664984340586496,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-13 13:31:18,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\nint main(){\n    int gd = -5; // 固定减5\n    int count = 0;\n    int num = 0;\n    int len;\n    int j=-1;\n    if(scanf(\""%d\"",&len)){};\n    int arr[len];\n    \n        for(int i=0; i<len; i++){\n            if(scanf(\""%d\"",&arr[i])){};\n        }\n        \n        while(j<len){\n            // 给count赋值 单步最大\n            if(arr[j+1]+gd > arr[j+3]+gd){\n                count = arr[j+1]+gd;\n                j=j+1;\n            }else{\n                count = arr[j+3]+gd;\n                j=j+3;\n            }\n            // 总数最\n                num += count;\n            \n        }\n    printf(\""%d\"",count);\n}",WRONG_ANSWER,8,348
1591665003814727680,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 13:31:23,Python,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"n=eval(input())\na=[0]*n\nx=0\nnum=0\nlist=map(int,input().split())\nfor i in list:\n    a[x] = i\n    x=x+1\nfor j in range(1,n-1):\n    if (a[j]<a[j-1] and a[j]<a[j+1]) or (a[j]<a[j-1] and a[j]==a[j+1]): \n        num=num+1\nprint(num)",ACCEPTED,94,3072
1591665030880571392,bd8243b4b064cae986196b0eac310a36f12d46dc08f126fbdcaaca530c884eb0,2022-11-13 13:31:29,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int P,Q,R,m;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    if(P<=Q&&P<=R&&Q<=R)\n        m=P+Q;\n    else if(P<=Q&&P<=R&&Q>R)\n        m=P+R;\n    else if(P>=Q&&P>=R)\n        m=Q+R;\n    else if(P<=Q&&Q>=R)\n        m=P+R;\n    printf(\""%d\\n\"",m);\n    return 0;\n\n}\n",WRONG_ANSWER,33,356
1591665041395691520,1f29a576db974352c60cbe8aafdc4e5328b24d800890ab1c712d8c9fa85d72cc,2022-11-13 13:31:32,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint a[n],i,j;\n\tfor(i=0;i<n;i++)\n\tscanf(\""%d\"",&a[i]);\n\t\n\tint hell=0;\n\tfor(i=0;i<n-1;i++)\n\t    if(a[i]<a[i+1])\n\t        hell=hell+1;\n    printf(\""%d\"",hell-1);\n\treturn 0;\n } ",WRONG_ANSWER,8,360
1591665051659153408,1d5ac1674206114dbc3c7883f7305e131f037b2aefcb3b297d62e80957fc1452,2022-11-13 13:31:34,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    printf(\""60\"");\n}",ACCEPTED,7,348
1591665080012693504,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-13 13:31:41,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{ \n    int i,n;\n    int a[100];\n    int sum=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if(a[i]*2>a[i-1]+a[i+1])\n            sum++;\n    }\n    printf(\""%d\"",sum-1);\n    return 0;\n}\n",WRONG_ANSWER,7,360
1591665108445880320,05f9d62a2660f27e0711448c225e5e0fe6347745a2c93edb6296c0a2ffbc6605,2022-11-13 13:31:48,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nmain()\n{\n    int n,a,b,p[10000],q[10000],sum1=0,sum2=0;\n    int i,m,j;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&p[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&q[i]);\n        for(m=0;m<n;m++)\n            sum1+=((p[m]/(q[m]+1))*pow(a,q[m]+1));\n        for(j=0;j<n;j++)\n            sum2+=((p[j]/(q[j]+1))*pow(b,q[j]+1));\n    printf(\""%d\"",sum1-sum2);\n}",WRONG_ANSWER,13,348
1591665109259530240,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-13 13:31:48,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main ()\n{\n    int n,a,b;\n    scanf(\""%d %d %d\\n\"",&n,&a,&b);\n    int x,y;\n    scanf(\""%d %d\\n\"",&x,&y);\n    int p,q;\n    scanf(\""%d %d\\n\"",&p,&q);\n    int s1=0,s2=0,s3=0,s4=0,sum=0;\n    s1=(x/(p+1))*pow(a,p+1);\n    s2=(y/(q+1))*pow(a,q+1);\n    s3=(x/(p+1))*pow(b,p+1);\n    s4=(y/(q+1))*pow(b,q+1);\n    sum=s1+s2-s3-s4;\n    pritnf(\""%d\"",sum);\n    return 0;\n}",COMPILE_ERROR,0,0
1591665123922829312,9d0546dac18a9dc678295254e547925db086add5f872ef42d8015d525afeaf65,2022-11-13 13:31:51,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 3\nlong main()\n{\n    long num[N],i,j,temp;\n    for(i=0;i<N;i++){\n        scanf(\""%d\"",&num[i]);\n    }\n    printf(\""%d\\n\"",num[0]+num[1]);\n    return 0;\n}\n",WRONG_ANSWER,10,324
1591665158186131456,9e0ba8d857885aa94eaa182d3a194e51593598b2d7817b16af4b1b57e49e10de,2022-11-13 13:32:00,Java,300.0,1591610585639407616,1591132307937943552,1049226928954454016,\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint a = scanner.nextInt();\n\t\tint[] b = new int[a];\n\t\tint count = 0;\n\n\t\tfor(int i = 0; i < b.length; i++ ) {\n\t\t\tb[i] = scanner.nextInt();\n\t\t}\n\t\n\t\tfor(int i = 0; i < b.length - 2; i++ ) {\n\t\t\tif(((b[i] - b[i+1]) > 0) && ((b[i + 1] - b[i + 2]) <= 0)){\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.print(count);\n\t}\n},ACCEPTED,582,25748
1591665158869770240,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-13 13:32:00,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main(){\n    int n,a[1000],count=0,i,j,t=0;\n      scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n        \n        \n    }\n    for( j=1;j<=n-1;j++)\n    {\n        \n        if(a[j]<a[j-1]&&a[j]<a[j+1])\n        { count++;    count+=t;t=0;}\n             \n        else \n        if(a[j]==a[j+1])\n        {t=1;\n            continue;\n        }\n        if(j==n-2) count+=t;\n        \n       \n          \n            \n          \n    }\n    \n    \n    \n    \n   if(count!=0)\n      printf(\""%d\"",count);\n   else \n     printf(\""0\"");\n}",WRONG_ANSWER,5,384
1591665200129138688,55950e2d4c314feed0856fa0f6b80f22c5c36f2ebe0d75c8ee2cadb1a06b2fe1,2022-11-13 13:32:10,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int n,a,b,c[100],i,d[100],an=0,bn=0,cn;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&c[i]);\n        scanf(\""%d\"",&d[i]);\n        an=an+(((c[i])/(d[i]+1))*pow(a,d[i]+1));\n        bn=bn+(((c[i])/(d[i]+1))*pow(b,d[i]+1));\n         cn=an-bn;\n\n\n\n    }\n   \n   \n    printf(\""%d\"",cn);\n\n\n\n\n\n\n\n\n\n    return 0;\n}\n",WRONG_ANSWER,12,512
1591665206290558976,1773d9c971942817d949c47973c4eb8c24531f728d5480dbf3b232e568926258,2022-11-13 13:32:11,Java,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"import java.util.Arrays;\nimport java.util.Scanner;\npublic class main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int P = sc.nextInt();\n        int Q = sc.nextInt();\n        int R = sc.nextInt();\n        int[] arr = {P, Q, R};\n        Arrays.sort(arr);\n        int result = 0;\n        for (int i = 0; i < arr.length; i++) {\n            result = arr[0] + arr[1];\n        }\n        System.out.println(result);\n    }\n}\n",COMPILE_ERROR,0,0
1591665210883334144,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-13 13:32:12,C++,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<iostream>\nusing namespace std;\nclass resolve{\n    public:\n        int max(int a,int b,int c){\n        if(a>=b&&a>=c)\n            return b+c;\n        else if(b>=a&&b>=c)\n            return a+c;\n        else if(c>=a&&c>=b)\n            return a+b;\n    }\n};\n\nint main(){\n    int P,Q,R;\n    cin>>P>>Q>>R;\n    \n        resolve res;\n        cout<<res.max(P,Q,R)<<endl;\n    \n    return 0;\n}",ACCEPTED,51,500
1591665231628394496,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 13:32:17,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <string.h>\nint main()\n{\n    int k,len,i,g,l;\n    char str[1000] = {0};\n    scanf(\""%d\"",&k);\n    scanf(\""%s\"",str);\n    len  = strlen(str);\n    for(i=0;i<len;i++)\n    {\n        if(str[i]=='0')\n        g++;\n        else\n        l++;\n    }\n    g-=8;//0的个数;\n    l-=52;//1的个数;\n    if(g>l)\n    printf(\""%d\\n\"",2*l);\n    else\n    printf(\""%d\\n\"",2*g);\n    return 0;\n}\n\n",WRONG_ANSWER,5,348
1591665231825494016,7222c2fb91a71fcf3f6560860557ab564f69a453594c9f1620ecc35bb26f5daf,2022-11-13 13:32:17,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\nint main(){\n    \n    int n,i,j;\n    int max=0,sum=0;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n    {\n       scanf(\""%d\"",&a[i]);\n    }\n  for(i=0;i<n;i++)\n  {   sum=0;\n      for(j=i;j<n;j++)\n    {\n       sum=sum+a[j]-5;\n          if(sum>max)\n              max=sum;\n    }\n  }\n    \n    printf(\""%d\"",max);\n    \n}",WRONG_ANSWER,57,328
1591665308010831872,1f29a576db974352c60cbe8aafdc4e5328b24d800890ab1c712d8c9fa85d72cc,2022-11-13 13:32:35,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint a[n],i,j;\n\tfor(i=0;i<n;i++)\n\tscanf(\""%d\"",&a[i]);\n\t\n\tint hell=0;\n\tfor(i=0;i<n-1;i++)\n\t    if(a[i]<a[i+1])\n\t        hell=hell+1;\n    printf(\""%d\\n\"",hell-1);\n\treturn 0;\n } ",WRONG_ANSWER,9,356
1591665323290669056,7222c2fb91a71fcf3f6560860557ab564f69a453594c9f1620ecc35bb26f5daf,2022-11-13 13:32:39,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\nint main(){\n    \n    int n,i,j;\n    int max=0,sum=0;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n    {\n       scanf(\""%d\"",&a[i]);\n    }\n  for(i=0;i<n;i++)\n  {   sum=0;\n      for(j=i;j<n;j++)\n    {\n       sum=sum+a[j]-5;\n          if(sum>max)\n              max=sum;\n    }\n  }\n    \n    printf(\""%d\\n\"",max);\n    \n}",WRONG_ANSWER,57,352
1591665363371450368,0b693affc66d8d407ff008bd1aaf4f2feb4a615f057943ba4b4ba3163d937dc6,2022-11-13 13:32:48,Java,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"import java.io.*;\nimport java.util.*;\n\npublic class Main {\n\n    public static void main(String[] args) throws IOException {\n        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n        Scanner sc=new Scanner(System.in);\n        String s=br.readLine();\n        String[] str=br.readLine().split(\"" \"");\n        int n=Integer.parseInt(s);\n        int res=0;\n        for (int i = 1; i < n - 1; i++) {\n            int pre=Integer.parseInt(str[i-1]);\n            int cur=Integer.parseInt(str[i]);\n            int next=Integer.parseInt(str[i+1]);\n            if (cur<pre && next>cur){\n                res++;\n                i++;\n            } else if (cur < pre && next == cur) {\n                if (isAs(str,i+1))\n                    res++;\n            }\n        }\n        System.out.println(res);\n    }\n    static boolean isAs(String[] str,int idx){\n        boolean res=true;\n        for (int i = idx; i < str.length-1; i++) {\n            int cur=Integer.parseInt(str[i]);\n            int next=Integer.parseInt(str[i+1]);\n            if (cur>next){\n                res=false;\n                break;\n            }\n            else if (cur<next)\n                break;\n        }\n        return res;\n    }\n}",ACCEPTED,502,24984
1591665365414109184,cf76a6e5773cf2f19ddd635fa646c5a6721f6fed8998d22ea1d0910bee8017a2,2022-11-13 13:32:49,C,0.0,1591610585635213319,1591131955016622080,1049226928954454016,#include<stdio.h>\nint main()\n{\n    \n},WRONG_ANSWER,9,348
1591665375404941312,eee658ba43cf6fba46676f4d9f167223fd9b57ec54a5d813fd1d01afc3088139,2022-11-13 13:32:51,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R,a,b,c,min;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    a=P+Q;\n    b=Q+R;\n    c=P+R;\n    min=a;\n    if(a<=b&&a<=c)\n        printf(\""%d\\n\"",a);\n        else\n        printf(\""%d\\n\"",b);\n\n    return 0;\n}\n",ACCEPTED,39,436
1591665404240748544,c76414e1d2d8531a5745e9bd3192aafa7cca924e645650ffe7954c992cc13b33,2022-11-13 13:32:58,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\nint i,j,t;\nint a[3];\nfor(i=0;i<3;i++)\nscanf(\""%d\"",&a[i]);\nfor(i=0;i<2;i++)\n    for(j=0;j<2-i;j++)\n    {\n        if(a[j]<[j+1])\n            t=a[j];\n            a[j]=a[j+1];\n            a[j+1]=t;\n    }\n    printf(\""%d\"",a[1]+[2])\n}\n",COMPILE_ERROR,0,0
1591665409311649792,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-13 13:32:59,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<iostream>\n#include<math.h>\nusing namespace std;\ntypedef long long ll;\nclass resolve{\n  public:\n    int resve(int x,int y,int a,int b){\n        return (a/(b+1))*(int)pow(x,b+1)-(a/(b+1))*(int)pow(y,b+1);\n    }\n};\nint main(){\n    int i,n,a[1000],b[1000],x,y;\n    int resv=0;\n    cin>>n>>x>>y;\n    if(n==0)\n        cout<<\""0\""<<endl;\n    for(i=0;i<n;i++){\n        cin>>a[i];\n    }\n    for(i=0;i<n;i++){\n        cin>>b[i];\n    }\n    resolve res;\n    for(i=0;i<n;i++){\n        resv += res.resve(x,y,a[i],b[i]);\n        cout<<res.resve(x,y,a[i],b[i])<<endl;\n    }\n    cout<<resv<<endl;\n    return 0;\n}",WRONG_ANSWER,5,328
1591665423064817664,bd8243b4b064cae986196b0eac310a36f12d46dc08f126fbdcaaca530c884eb0,2022-11-13 13:33:03,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int P,Q,R,m;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    if(P<=Q&&P<=R&&Q<=R){\n        m=P+Q;\n        printf(\""%d\"",m);}\n    else if(P<=Q&&P<=R&&Q>R){\n        m=P+R;\n         printf(\""%d\"",m);}\n    else if(P>=Q&&P>=R){\n        m=Q+R;\n         printf(\""%d\"",m);}\n    else if(P<=Q&&Q>=R){\n        m=P+R;\n         printf(\""%d\"",m);}\n    else if(P==Q&&P==R&&Q==R){\n        m=P+Q;\n         printf(\""%d\"",m);}\n    return 0;\n\n}\n",WRONG_ANSWER,21,488
1591665424109166592,c47b15e117166a3dd00078b9f795673d5284a2761e582479119229751cc734d3,2022-11-13 13:33:03,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#define S 10000\n\n\nint main()\n{\n    int a=0,n,i,j,k;\n    int s[S];\n    int m[S];\n    scanf(\""%d\"",&n);\n    if(n>=1 && n<=10000)\n    {\n\n        for(i=0;i<n;i++)\n        scanf(\""%d\"",&s[i]);\n        for(i=0;i<n;i++)\n            if(s[i]>=1 && s[i]<=1000000)\n        {\n            for(i=0;i<n;i++)\n        {\n            k=1;\n            for(j=i;j<n;j++)\n            if(s[i]<=s[j])\n            m[i]=s[i]*(k++);\n            else break;\n        }\n        for(i=0;i<n;i++)\n        {\n            if(a<=m[i])\n                a=m[i];\n        }\n        }\n\n\n    printf(\""%d\\n\"",a);\n\n\n\n    }\n\n    return 0;\n}\n",WRONG_ANSWER,19,380
1591665457638465536,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-13 13:33:11,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"n=int(input())\ndatas=list(map(int,list(input())))\n# data=input()\n# datas=list(data)\ncount=0\nfor i in range(int(n/2)):\n    for x in range(0,len(datas)-1):\n        if datas[x]!=datas[x+1]:\n            del datas[x]\n            del datas[x]\n            count+=1\n            break\nprint(count*2)",TIME_LIMIT_EXCEEDED,467,4596
1591665482988838912,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-13 13:33:17,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j,k=0,h=0;\n    int a[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        if(i=0||i=n-1)\n        {\n            a[i]=0;\n        }\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=1;j<n-1;j++)\n    {\n        if(a[j]<a[j-1]&&a[j+1]>a[j])\n        {\n            k++;\n        }\n        if(a[j]==a[j+1]&&a[j]<a[j-1]&&a[j+1]<a[j+2])\n        {\n            h++;\n        }\n    }\n    printf(\""%d\\n\"",k+h);\n}",COMPILE_ERROR,0,0
1591665530925494272,542d97133043a1f2156354473a31382c35bb2836688b0ed76eae59c52a2e0e3a,2022-11-13 13:33:28,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main()\n{\n    int m,n,o,sum=0;\n    scanf(\""%d\"",&n);\n    int h[n];\n    for(m=0;m<n;m++)\n    {\n        scanf(\""%d\"",&h[m]);\n    }\n    for(o=1;o<n-1;o++)\n    {\n        if(h[o]<h[o+1]||h[o]<h[o-1])\n        {\n            sum=sum+1;\n            if(h[o]==h[o+1])\n                sum=sum-1;\n        }\n            \n    }\n    printf(\""%d\"",sum);\n}",WRONG_ANSWER,4,376
1591665533412728832,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-11-13 13:33:29,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,j;\n    int a[3]={0},b[3]={0};\n    int minsum=50;\n    for(i=0;i<3;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    b[0]=a[0]+a[1];\n    b[1]=a[0]+a[2];\n    b[2]=a[1]+a[2];\n    for(j=0;j<3;j++)\n    {\n        if(b[j]<minsum)\n            minsum=b[j];\n    }\n    printf(\""%d\\n\"",minsum);\n    return 0;\n}",WRONG_ANSWER,5,196
1591665533697974272,9819f13d6a58d50fa249ad037641119dadb52afb3f125db258771564f27d2ca5,2022-11-13 13:33:29,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nint main(){\n    int a,b,c;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    int min1=a,min2,min;\n    if( b>c){\n        min2=c;\n    }else{\n        min2=b;\n    }\n    if(min1>min2){\n        min=min2;\n    }else{\n        min=min1;\n    }\n    if(min==a){\n        if(b>c){\n            printf(\""%d\\n\"",min+c);\n        }else{\n            printf(\""%d\\n\"",min+b);\n        }\n    }else if(min==b){\n        if(a>c){\n            printf(\""%d\\n\"",min+c);\n        }else{\n            printf(\""%d\\n\"",min+a);\n        }\n    }else if(min==c){\n        if(a>b){\n            printf(\""%d\\n\"",min+b);\n        }else{\n            printf(\""%d\\n\"",min+a);\n        }\n    }\n   \n    return 0;\n}\n",ACCEPTED,41,504
1591665576123326464,a5291eb67188c2a916aa5dd9fc38f2e449aa9f9a3cd047f282d8c154ea2979cd,2022-11-13 13:33:39,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,#include <iostream>\n#include <vector> \nusing namespace std;\n\nconst int N = 1e6 + 10;\nint h[N];\n\n\nint main()\n{\n\tint n = 0;\n\tcin >> n;\n\tfor(int i = 1;i <= n;i++)\n\t{\n\t\tcin >> h[i];\n\t}\n\tint S_max = 0;\n\tfor(int i = 1;i <= n;i++)\n\t{\n\t\tint min_h = N;\n\t\tfor(int j = i;j <= n;j++)\n\t\t{\n\t\t\tint S = 0;\n\t\t\tif(h[j] >= h[i])\n\t\t\t{\n\t\t\t\tif(h[j] > min_h)\n\t\t\t\t{\n\t\t\t\t\tS = (j - i + 1) * min_h;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tS = (j - i + 1) * h[i];\t\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tS = (j - i + 1) * h[j];\n\t\t\t\tif(h[j] < min_h)\n\t\t\t\t{\n\t\t\t\t\tmin_h = h[j];\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(S > S_max)\n\t\t\t{\n\t\t\t\tS_max = S;\t\n\t\t\t}\n\t\t}\n\t\t\n\t}\n\t\n\tcout << S_max << endl;\n\t\n\n\n\treturn 0;\n} ,WRONG_ANSWER,6,328
1591665578409209856,59415347d1cfa3163c0a25f108652369803ee9c4d72f5c59e4212aabab93e388,2022-11-13 13:33:40,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main(int argc, char *argv[]) {\n\tint a[10];\n\tint n = 0,m = 0,number = 0,i;\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&m);\n\t\ta[i] = m;\n\t}\n\tfor(i=1;i<n;i++){\t\t\t\n\t\tif(a[i]<=a[i+1]&&a[i]<=a[i-1]){\n\t\t\tnumber++;\t\t\n\t\t}\t\t\n\t}\t\n\tprintf(\""%d\"",number-2);\n\treturn 0;\n}",RUNTIME_ERROR,5,196
1591665603646349312,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-13 13:33:46,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j,k=0,h=0;\n    int a[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        if(i=0||i=(n-1))\n        {\n            a[i]=0;\n        }\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=1;j<n-1;j++)\n    {\n        if(a[j]<a[j-1]&&a[j+1]>a[j])\n        {\n            k++;\n        }\n        if(a[j]==a[j+1]&&a[j]<a[j-1]&&a[j+1]<a[j+2])\n        {\n            h++;\n        }\n    }\n    printf(\""%d\\n\"",k+h);\n}",COMPILE_ERROR,0,0
1591665620448718848,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-13 13:33:50,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\nint b[100];\nint a,i,sum,n;\n    sum=0;\nscanf(\""%d\"",&a);\nfor(i=0;i<a;i++)\n{\n    scanf(\""%d\"",&b[i]);\n}\nfor(n=0;n<a;n++)\n    {\n    if(b[n]<b[n+2])\n        sum=sum+b[n+2]-5;\n        else\n      sum=sum+b[n]-5;\n        }\n    printf(\""%d\\n\"",sum);\n    return 0;\n    \n}\n",SEGMENTATION_FAULT,8,476
1591665622357127168,63bdcc3416dd0c07c03f833ffb02c2f304a4f523deae6a87bed24a730e4d224d,2022-11-13 13:33:50,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{ \n    int i,n,a,b,result;\n    int c[100];\n    int f[100];\n    scanf(\""%d %d %d\\n\"",&n,&a,&b);\n    for(i=0;i<=100;i++)\n        scanf(\""%d\\n\"",&c[i]);\n    for(i=0;i<=100;i++)\n        scanf(\""%d\"",&f[i]);\n    \n    result=((c[i]/(f[i]+1)*pow(a,f[i]+1)+(c[i+1]/(f[i+1]+1)*pow(a,f[i+1]+1))-\n             ((c[i]/(f[i+1]+1)*pow(b,f[i]+1)+(c[i]/(f[i]+1)*pow(b,f[i+1]+1));\n    printf(\""%d\"",result);\n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    return 0;\n}",COMPILE_ERROR,0,0
1591665645996236800,505c5b9a1b6d591a815315d95a57743fb98dad691b51421b4de282392fef3f43,2022-11-13 13:33:56,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    if(P+Q>Q+R)\n    {\n        printf(\""%d\"",Q+R);\n    }\n    else if(P+R>Q+R)\n    {\n        printf(\""%d\"",Q+R);\n    }\n    else if(P+R>P+Q)\n    {\n        printf(\""%d\"",P+Q);\n    }\n    else\n        printf(\""%d\"",P+R);\n\n}\n",WRONG_ANSWER,27,448
1591665650576416768,d54b7e24c90cf40d468bdeb018e61440010a1049a4ae96e2c6331c215521f91c,2022-11-13 13:33:57,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"int main()\n{\n\tint a,b,c,d=0;\n\tscanf(\""%d %d %d\"",&a,&b,&c);\n\t\n\tif(a>b && a>c)\n\t{\n\t\td = b+c;\n\t}else if(b>c)\n\t{\n\t\td = a+c;\n\t}else \n\t\t{\n\t\td = a+b;\n\t}\n    printf(\""%d\"",d);\n}",ACCEPTED,33,376
1591665655383076864,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-13 13:33:58,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j,k=0,h=0;\n    int a[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        if(i==0||i==(n-1))\n        {\n            a[i]=0;\n        }\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=1;j<n-1;j++)\n    {\n        if(a[j]<a[j-1]&&a[j+1]>a[j])\n        {\n            k++;\n        }\n        if(a[j]==a[j+1]&&a[j]<a[j-1]&&a[j+1]<a[j+2])\n        {\n            h++;\n        }\n    }\n    printf(\""%d\\n\"",k+h);\n}",RUNTIME_ERROR,36,512
1591665655555043328,e3700fa579dc7c925fa010ac870390ba9776ef5ee08f67752aeef4a9467c7624,2022-11-13 13:33:58,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n\nint p,q,r,min;\n    scanf(\""%d %d %d\"",&p,&q,&r);\n    if(p+q<p+r&&p+q<q+r)\n        min=p+q;\n    else if(p+r<p+q&&p+r<q+r)\n        min=p+r;\n    else if(q+r<p+q&&q+r<p+r)\n        min=q+r;\n    printf(\""%d\"",min);\n\n    return 0;\n}\n",ACCEPTED,40,368
1591665655638974464,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-13 13:33:58,Python,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"P,Q,R=map(int,input(\""\"").split())\n1<=P,Q,R<=1000\na=P+Q\nb=Q+R\nc=R+P\nif a<b:\n   if a<c:\n    print(a)\nif b<a:\n   if b<c:\n    print(b)\nif c<a:\n   if c<b:\n    print(c)\n",ACCEPTED,107,3160
1591665673544458240,bd8243b4b064cae986196b0eac310a36f12d46dc08f126fbdcaaca530c884eb0,2022-11-13 13:34:02,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int P,Q,R,m;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    if(P<=Q&&P<=R&&Q<=R){\n        m=P+Q;\n        printf(\""%d\\n\"",m);}\n    else if(P<=Q&&P<=R&&Q>R){\n        m=P+R;\n         printf(\""%d\\n\"",m);}\n    else if(P>=Q&&P>=R){\n        m=Q+R;\n         printf(\""%d\\n\"",m);}\n    else if(P<=Q&&Q>=R){\n        m=P+R;\n         printf(\""%d\\n\"",m);}\n    else if(P==Q&&P==R&&Q==R){\n        m=P+Q;\n         printf(\""%d\\n\"",m);}\n    return 0;\n\n}\n",WRONG_ANSWER,43,476
1591665713964965888,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-13 13:34:12,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,e=0,i;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<n-1;i++)\n    if(a[i]>a[i+1])\n    e++;\n    \n    printf(\""%d\"",e);\n    return 0;\n}",WRONG_ANSWER,6,348
1591665717509107712,0cfbb4a339ebbc4dce13b5f3e3f98a3def0ab17ef5b4ac8e6d566de92e1f5f78,2022-11-13 13:34:13,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n;\n    int h[1001];\n    int count=0;\n    int x=0;;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        scanf(\""%d\"",&h[i]);\n        if(h[i]==0){\n            x++;\n        }\n    }\n    for(int i=0;i<n;i++){\n        if(h[i]<h[i+1]&&h[i]<h[i-1]){\n            count++;\n        }\n    }\n    if(x==n){\n        count=1;\n    }\n    printf(\""%d\"",count);\n}",WRONG_ANSWER,9,196
1591665732944158720,59415347d1cfa3163c0a25f108652369803ee9c4d72f5c59e4212aabab93e388,2022-11-13 13:34:17,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main(int argc, char *argv[]) {\n\tint a[10000];\n\tint n = 0,m = 0,number = 0,i;\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&m);\n\t\ta[i] = m;\n\t}\n\tfor(i=1;i<n;i++){\t\t\t\n\t\tif(a[i]<=a[i+1]&&a[i]<=a[i-1]){\n\t\t\tnumber++;\t\t\n\t\t}\t\t\n\t}\t\n\tprintf(\""%d\"",number-2);\n\treturn 0;\n}",WRONG_ANSWER,6,200
1591665795124748288,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-11-13 13:34:31,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i;\n    int a[3]={0},b[3]={0};\n    int minsum=10;\n    for(i=0;i<3;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    b[0]=a[0]+a[1];\n    b[1]=a[0]+a[2];\n    b[2]=a[1]+a[2];\n    for(i=0;i<3;i++)\n    {\n        if(b[i]<minsum)\n            minsum=b[i];\n    }\n    printf(\""%d\\n\"",minsum);\n    return 0;\n}",WRONG_ANSWER,5,324
1591665807183339520,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-13 13:34:34,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\nint main(){\n    int gd = -5; // 固定减5\n    int count = 0;\n    int num = 0;\n    int len;\n    int j=-1;\n    if(scanf(\""%d\"",&len)){};\n    int arr[len];\n    \n        for(int i=0; i<len; i++){\n            if(scanf(\""%d\"",&arr[i])){};\n        }\n        \n        while(j<len){\n            // 给count赋值 单步最大\n            if(arr[j+1]+gd > arr[j+3]+gd){\n                count = arr[j+1]+gd;\n                j=j+1;\n            }else{\n                count = arr[j+3]+gd;\n                j=j+3;\n            }\n            // 总数最\n                num += count;\n            \n        }\n    printf(\""%d\"",num);\n}",WRONG_ANSWER,5,324
1591665810979217408,c76414e1d2d8531a5745e9bd3192aafa7cca924e645650ffe7954c992cc13b33,2022-11-13 13:34:35,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\nint i,j,t;\nint a[3];\nfor(i=0;i<3;i++)\nscanf(\""%d\"",&a[i]);\nfor(i=0;i<2;i++)\n    for(j=0;j<2-i;j++)\n    {\n        if(a[j]<[j+1])\n            t=a[j];\n            a[j]=a[j+1];\n            a[j+1]=t;\n    }\n    printf(\""%d\"",a[1]+[2])\n}\n",COMPILE_ERROR,0,0
1591665827018235904,f02e276f40ab35b9adfdb6399e4858c8c655e5a7c77ea058b6ff58b6ea670152,2022-11-13 13:34:39,C++,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tint P,Q,R,min,min1;\n\tcin>>P>>Q>>R;\n    min=(P+Q)<(Q+R)?(P+Q):(Q+R);\n    min1=min<(P+R)?min:(P+R);\n    cout<<min1<<endl;\n}",ACCEPTED,43,632
1591665832173035520,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-13 13:34:40,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main(){\n\tint n;\n\tint i,j;\n\tint count=0;\n\tscanf(\""%d\"",&n);\n\tchar a[100000]={0};\n\tscanf(\""%s\"",&a);\n\t/*for(i=0;i<n;i++){\n\t\tscanf(\""%c\"",&a[i]);\n\t}*/\n\tint k;\n\tfor(j=0;j<n;j++){\n\tfor(i=0;i<n;i++){\n\t\tif(a[i]!=a[i+1]){\n\t\t\tcontinue;\n\t\t}\n\t\tif(a[i]=a[i+1]){\n\t\t\tfor(k=i;k<n-i;k++){\n\t\t\ta[k]=a[k+2];\n\t\t\tcontinue;\n\t\t\t}\n\t\t\tcount=count+2;\n\t\t\tn=n-2;\n\t\t}\n\t}}\n\tprintf(\""%d\\n\"",count);\n    return 0;\n}",WRONG_ANSWER,8,768
1591665842662957056,c76414e1d2d8531a5745e9bd3192aafa7cca924e645650ffe7954c992cc13b33,2022-11-13 13:34:43,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\nint i,j,t;\nint a[3];\nfor(i=0;i<3;i++)\nscanf(\""%d\"",&a[i]);\nfor(i=0;i<2;i++)\n    for(j=0;j<2-i;j++)\n    {\n        if(a[j]<a[j+1])\n            t=a[j];\n            a[j]=a[j+1];\n            a[j+1]=t;\n    }\n    printf(\""%d\"",a[1]+a[2]);\n}\n",WRONG_ANSWER,10,512
1591665849315155968,59415347d1cfa3163c0a25f108652369803ee9c4d72f5c59e4212aabab93e388,2022-11-13 13:34:44,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main(int argc, char *argv[]) {\n\tint a[10000];\n\tint n = 0,m = 0,number = 0,number1 = 0,b,i;\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&m);\n\t\ta[i] = m;\n\t}\n\tfor(i=1;i<n;i++){\t\t\t\n\t\tif(a[i]<=a[i+1]&&a[i]<=a[i-1]){\n\t\t\tnumber++;\n\t\tif(a[i]==a[i+1])\n\t\t\tnumber1++;\t\t\n\t\t}\t\t\n\t}\n\tif(a[n-1]<a[n-2]){\n\t\tb = 1;\n\t}\n\tint sum = number-number1-b;\t\n\tprintf(\""%d\"",sum);\n\treturn 0;\n}",WRONG_ANSWER,5,332
1591665857737318400,b7ca5a176d530473c8faa24fa803cc5b5bef6deef335789b05821ec37e6b8252,2022-11-13 13:34:46,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    int a,b,c;\n    a=P+Q;\n    b=Q+R;\n    c=P+R;\n    if(a<=b&&c>=b){\n        printf(\""%d\\n\"",a);\n    } if(b<=a&&c>=a){\n    printf(\""%d\\n\"",b);\n    }else if(c<=a&&b>=a){\n    printf(\""%d\\n\"",c);\n    }\n\n    return 0;\n}\n",WRONG_ANSWER,5,204
1591665869150019584,20ffd83467b553ac24e1f4b8b096d58858684ca8c3f6a4d5a62be9ff7c4817da,2022-11-13 13:34:49,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#define MAX 10000\nint main()\n{\n    int n,a,b,h=0;\n    int i;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    int c[MAX],F[MAX];\n    double B[MAX];\n    for(i=1;i<=n;i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=1;i<=n;i++)\n        scanf(\""%d\"",&F[i]);\n    for(i=1;i<=n;i++)\n        B[i]=c[i]/(F[i]+1)*pow(a,F[i]+1)-c[i]/(F[i]+1)*pow(b,F[i]+1);\n    for(i=1;i<=n;i++){\n        h+=B[i];\n        }\n    printf(\""%d\\n\"",h);\n}\n\n",WRONG_ANSWER,7,356
1591665881632268288,09eb01e8f9f24922a6c60a1149d505ad1ebb9b0a39ed1101140fe0fd93daa753,2022-11-13 13:34:52,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"    #include<stdio.h>\n    int main()\n    {\n\n        int n,i,j,counts=0;\n        int arr[100]={0};\n        scanf(\""%d\"",&n);\n        for(i=0;i<n;i++)\n        {\n            scanf(\""%d\"",&arr[i]);\n        }\n        for(i=0;i<n;i++)\n        {\n            if(arr[i+1]==arr[i])\n            {\n                n=n-1;\n                for(j=i;j<n;j++)\n                {\n                    arr[j]=arr[j+1];\n                }\n            }\n        }\n        for(i=0;i<n;i++)\n        {\n\n            if(arr[i]>arr[i+1]&&arr[i+1]<arr[i+2])\n            {\n                counts++;\n            }\n        }\n        printf(\""%d\"",counts);\n        return 0;\n    }\n",RUNTIME_ERROR,46,340
1591665899218952192,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-13 13:34:56,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\nint b[100];\nint a,i,sum,n;\n    sum=0;\nscanf(\""%d\"",&a);\nfor(i=0;i<a;i++)\n{\n    scanf(\""%d\"",&b[i]);\n}\nfor(n=0;n<a;n++)\n    {\n    if(b[n]<b[n+2])\n        sum=sum+b[n+2]-5;\n        else\n      sum=sum+b[n]-5;\n        }\n    sum=sum/2;\n    printf(\""%d\\n\"",sum);\n    return 0;\n    \n}\n",SEGMENTATION_FAULT,12,336
1591665899407695872,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-11-13 13:34:56,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i;\n    int a[3]={0},b[3]={0};\n    int minsum=3001;\n    for(i=0;i<3;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    b[0]=a[0]+a[1];\n    b[1]=a[0]+a[2];\n    b[2]=a[1]+a[2];\n    for(i=0;i<3;i++)\n    {\n        if(b[i]<minsum)\n            minsum=b[i];\n    }\n    printf(\""%d\\n\"",minsum);\n    return 0;\n}",WRONG_ANSWER,6,204
1591665902096277504,fc04467797ff55239c848b5102d2499d81faac6f07f19ed145b2c7ad9b809632,2022-11-13 13:34:57,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<stdio.h>\nint main(){\n   printf(\""60\"");\n}",ACCEPTED,9,352
1591665973999230976,c5cc6f9845df4bd1986af86c0696296436bbc0f00a10a9f891b4100e57bc3a19,2022-11-13 13:35:14,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <string.h>\n#define N 10005\nchar a[N];\nint main()\n{\n\tint i,j;\n\tint n;\n\tscanf(\""%d\"",&n);\n\tgetchar();\n\tfor(i=0;i<n;i++) {\n\t\tscanf(\""%c\"",&a[i]);\n\t}\n\tint a0,a1;\n\ta0=a1=0;\n\tfor(i=0;i<n;i++) {\n\t\tif(a[i]=='0') a0++;\n\t\tif(a[i]=='1') a1++;\n\t}\n\tint temp;\n\tif(a0>=a1) temp=a1;\n\telse temp=a0;\n\tprintf(\""%d\\n\"",temp*2);\n\t\n\treturn 0;\n}",SEGMENTATION_FAULT,27,384
1591666013991874560,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-13 13:35:24,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\nint b[100000];\nint a,i,sum,n;\n    sum=0;\nscanf(\""%d\"",&a);\nfor(i=0;i<a;i++)\n{\n    scanf(\""%d\"",&b[i]);\n}\nfor(n=0;n<a;n++)\n    {\n    if(b[n]<b[n+2])\n        sum=sum+b[n+2]-5;\n        else\n      sum=sum+b[n]-5;\n        }\n    sum=sum/2;\n    printf(\""%d\\n\"",sum);\n    return 0;\n    \n}\n",WRONG_ANSWER,7,332
1591666047340830720,2e4af98c441106efa9ee51f8a781d0eee91a3dff6193987d421eb3a48725c814,2022-11-13 13:35:32,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <iostream>\nint f=0;//0 init 1 lise -1 drap;\nint fun(int arr[],int a,int b){\n\tif(arr[a]>arr[b])f=-1;\n\tif(arr[a]<arr[b])f=1;\n\tif(arr[a]==arr[b])f=0;\n\treturn f; \n}\nint main(){\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint *arr = new int[n];\n\tfor(int i =0;i<n;i++){\n\t\tscanf(\""%d\"",&arr[i]);\n\t}\n\n\tint t=arr[0];\n\tint num =0;\n\tf =fun(arr,0,1);\n\tfor(int i=1;i<n;i++){\n\t\tif(f==1&&arr[i]>arr[i+1]){\n\t\t\tnum++;\n\t\t\tf = fun(arr,i,i+1); \n\t\t}\n\t\tif(f==-1&&arr[i]<arr[i+1]){\n\t\t\tnum++;\n\t\t\tf = fun(arr,i,i+1); \n\t\t}\n\t\tif(f==0&&arr[i]==arr[i+1]){\n\t\t\tf = fun(arr,i,i+1); \n\t\t}\n\t\n\t}\n\tprintf(\""%d\"",num);\n\t\n}",WRONG_ANSWER,6,476
1591666062696144896,d122b81a371b28751082747cf65a235d0eddfd496e142775cd971d8f88adf327,2022-11-13 13:35:35,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int a[3];\n   for(int i=0;i<3;i++)\n      if(scanf(\""%d\"",&a[i])){};\n   \n    int min=0;\n    int x,y,z;\n    x=a[0];\n    y=a[1];\n    z=a[2];\n    min=x+y;\n    if(x+z<=min&&x+z>min){\n        min=x+z;\n        printf(\""%d\\n\"",min);\n    }\n    if(y+z<=min&&x+z>min){\n        min=y+z;\n        printf(\""%d\\n\"",min);\n    }\n    if(y+z>min&&x+z>min){\n        printf(\""%d\\n\"",min);\n    }\n                                \n    return 0;\n                                \n}",WRONG_ANSWER,19,384
1591666064701022208,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-13 13:35:36,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"l = int(input())\ndata = list(map(int,input().split()))\nyes = 0\ni=1\nwhile i<l-2:\n    for j in range(i,l-1):\n        if data[i]<=data[j]and j-i>=1 and data[i]>data[i+1]:\n            yes+=1\n            i=j\n            break\n        \n            \n\n    \nprint(yes)",TIME_LIMIT_EXCEEDED,400,2904
1591666072137510912,c39a4349139942a7aa7456b2c4609f8d0f9d0d3465be213d33870ec87eab1e58,2022-11-13 13:35:37,C++,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\nint void(main)\n{\n    int n,i,a[30],s=0;\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]==a[i+1])\n            s++;\n    }\n    printf(\""%d\"",s+1);\n    return 0;\n}",COMPILE_ERROR,0,0
1591666093100654592,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 13:35:42,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a[3];\n    int i,max,sum;\n    for(i=0;i<3;i++)\n        scanf(\""%d\"",&a[i]);\n    if(a[0]>a[1])\n        max=a[0];\n    else max=a[1];\n    if(max>a[2])\n        max=max;\n    else\n    max=a[2];\n    sum=a[0]+a[1]+a[2];\n    printf(\""%d\\n\"",sum-max);\n\n}\n",ACCEPTED,31,324
1591666117570211840,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-13 13:35:48,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main()\n{\n    int n,b=0,c=0;\n    scanf(\""%d\"",&n);\n    int a[n],i;\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n       \n        }\n     for(i=0;i<n;i++)\n     { \n         if(a[i]==1)\n        {\n            b++;\n        }\n        if(a[i]==0)\n        {\n            c++;\n        }\n            if((b-c)==0)\n        {\n            printf(\""%d\"",b+c);\n        }\n        if((b-c)!=0)\n        {\n            if(b>c)\n                printf(\""%d\"",2*c);\n            if(b<c)\n                printf(\""%d\"",2*b);\n        }\n    }\n     \n}",WRONG_ANSWER,6,332
1591666119499603968,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-13 13:35:49,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\nint b[100000];\nint a,i,sum,n;\n    sum=0;\nscanf(\""%d\"",&a);\nfor(i=0;i<a;i++)\n{\n    scanf(\""%d\"",&b[i]);\n}\nfor(n=0;n<a;n++)\n    {\n    if(b[n]<b[n+2])\n        sum=sum+b[n+2]-5;\n        else\n      sum=sum+b[n]-5;\n        }\n    printf(\""%d\\n\"",sum);\n    return 0;\n    \n}\n",WRONG_ANSWER,7,352
1591666164957503488,d122b81a371b28751082747cf65a235d0eddfd496e142775cd971d8f88adf327,2022-11-13 13:36:00,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int a[3];\n   for(int i=0;i<3;i++)\n      if(scanf(\""%d\"",&a[i])){}\n    int min=0;\n    int x,y,z;\n    x=a[0];\n    y=a[1];\n    z=a[2];\n    min=x+y;\n    if(x+z<=min&&x+z>min){\n        min=x+z;\n        printf(\""%d\\n\"",min);\n    }\n    if(y+z<=min&&x+z>min){\n        min=y+z;\n        printf(\""%d\\n\"",min);\n    }\n    if(y+z>min&&x+z>min){\n        printf(\""%d\\n\"",min);\n    }\n                                \n    return 0;\n                                \n}",WRONG_ANSWER,26,328
1591666184813293568,1773d9c971942817d949c47973c4eb8c24531f728d5480dbf3b232e568926258,2022-11-13 13:36:04,Java,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int P = sc.nextInt();\n        int Q = sc.nextInt();\n        int R = sc.nextInt();\n        int[] arr = {P, Q, R};\n        Arrays.sort(arr);\n        int result = 0;\n        for (int i = 0; i < arr.length; i++) {\n            result = arr[0] + arr[1];\n        }\n        System.out.println(result);\n    }\n}\n",ACCEPTED,558,24972
1591666215364603904,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-13 13:36:12,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main()\n{\n    int n,b=0,c=0;\n    scanf(\""%d\"",&n);\n    int a[n],i;\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n         if(a[i]==1)\n        {\n            b++;\n        }\n        if(a[i]==0)\n        {\n            c++;\n        }\n     \n       \n        \n            if((b-c)==0)\n        {\n            printf(\""%d\"",b+c);\n        }\n        if((b-c)!=0)\n        {\n            if(b>c)\n                printf(\""%d\"",2*c);\n            if(b<c)\n                printf(\""%d\"",2*b);\n        }\n    }\n     \n}",WRONG_ANSWER,4,348
1591666269731184640,acf80eea856463058b81f71c0238069795893092293fbd098cc594959df6444e,2022-11-13 13:36:25,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,n=int(input())\ns=input().split()\nh=0\nfor i in range(n-2):\n    if s[i]>s[i+1] and s[i+1]<s[i]:\n        h=h+1\n    else:\n        h=h+0\nprint(h)\n    ,WRONG_ANSWER,15,2880
1591666282376998912,05fd79145678de5c06012db9db4333bebf8365a74fe442d12a54a9da3782fdca,2022-11-13 13:36:28,C++,0.0,1591610585635213313,1589906790446387200,1049226928954454016,"#include<iostream>\n#include<math.h>\n#define N 100005\nusing namespace std;\nint main(){\n\tlong long int nums;\n\tlong long int pa1 = 0,pa2 = 0,pa3 = 0;\n\tlong long int a;\n\tlong long int n;\n\tlong long int z[N];\n\tlong long int max = 0;\n\tlong long int w1,w2,w3;\n\tcin>>nums;\n\tfor(long int i = 0;i<nums;i++){\n\t\tmax = 0;\n\t\tcin >> n;\n\t\tfor(long long int j = 0;j<n;j++) cin >> z[j];\n\t\tfor(pa1 = 0;pa1<n;pa1++){\n\n\t\t\tfor(pa2 = 0;pa2<n;pa2++){\n\t\t\t\tif(pa1 == pa2) continue;\n\t\t\t\tfor(pa3 = 0;pa3<n;pa3++){\n\t\t\t\t\tif(pa3 == pa1 || pa3 == pa2) continue;\n\t\t\t\t\tw1 = fabs(z[pa1] - z[pa2]);\n\t\t\t\t\tw2 = fabs(z[pa2] - z[pa3]);\n\t\t\t\t\tif(max < w1+w2) max = w1 + w2;\n\t\t\t\t\tw1 = fabs(z[pa1] - z[pa3]);\n\t\t\t\t\tw2 = fabs(z[pa3] - z[pa2]);\n\t\t\t\t\tif(max < w1+w2) max = w1 + w2;\n\t\t\t\t\tw1 = fabs(z[pa2] - z[pa1]);\n\t\t\t\t\tw2 = fabs(z[pa1] - z[pa3]);\n\t\t\t\t\tif(max < w1+w2) max = w1 + w2;\n\t\t\t\t\tw1 = fabs(z[pa2] - z[pa3]);\n\t\t\t\t\tw2 = fabs(z[pa3] - z[pa1]);\n\t\t\t\t\tif(max < w1+w2) max = w1 + w2;\n\t\t\t\t\tw1 = fabs(z[pa3] - z[pa1]);\n\t\t\t\t\tw2 = fabs(z[pa1] - z[pa2]);\n\t\t\t\t\tif(max < w1+w2) max = w1 + w2;\n\t\t\t\t\tw1 = fabs(z[pa3] - z[pa2]);\n\t\t\t\t\tw2 = fabs(z[pa2] - z[pa1]);\n\t\t\t\t\tif(max < w1+w2) max = w1 + w2;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << max;\n\t}\n\n\treturn 0;\n}\n",TIME_LIMIT_EXCEEDED,10000,476
1591666301586911232,d122b81a371b28751082747cf65a235d0eddfd496e142775cd971d8f88adf327,2022-11-13 13:36:32,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int a[3];\n   for(int i=0;i<3;i++){\n      if(scanf(\""%d\"",&a[i])){}}\n    int min=0;\n    int x,y,z;\n    x=a[0];\n    y=a[1];\n    z=a[2];\n    min=x+y;\n    if(x+z<=min&&x+z>min){\n        min=x+z;\n        printf(\""%d\\n\"",min);\n    }\n    if(y+z<=min&&x+z>min){\n        min=y+z;\n        printf(\""%d\\n\"",min);\n    }\n    if(y+z>min&&x+z>min){\n        printf(\""%d\\n\"",min);\n    }\n                                \n    return 0;\n                                \n}",WRONG_ANSWER,18,352
1591666319836340224,27fbb32d960dbf49665c8905b68012d602eda68987686c6f224ec7b49ca3d0ac,2022-11-13 13:36:37,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint a[3];\n\tfor(int i=0;i<3;i++)\n\t{\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tint p=a[0]+a[1];\n\tint q=a[1]+a[2];\n\tint r=a[0]+a[2];\n\tif(p<=r&&p<=q)\n\tprintf(\""%d\"",p);\n\telse\n\t{\n\t\tif(q<=r&&q<=p)\n\t\tprintf(\""%d\"",q);\n\t\telse\n\t\tif(r<=p&&r<=q)\n\t\tprintf(\""%d\"",r);\n\t}\n\treturn 0;\n} ",ACCEPTED,31,456
1591666330510831616,c47b15e117166a3dd00078b9f795673d5284a2761e582479119229751cc734d3,2022-11-13 13:36:39,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#define S 10000\n\n\nint main()\n{\n    int a=0,n,i,j,k;\n    int s[S];\n    int m[S];\n    scanf(\""%d\"",&n);\n    if(n>=1 && n<=10000)\n    {\n\n        for(i=0;i<n;i++)\n        scanf(\""%d\"",&s[i]);\n        for(i=0;i<n;i++)\n            if(s[i]>=1 && s[i]<=1000000)\n        {\n            for(i=0;i<n;i++)\n        {\n            k=1;\n            for(j=i;j<n;j++)\n            if(s[i]<=s[j])\n            m[i]=s[i]*(k++);\n            else break;\n        }\n        for(i=0;i<n;i++)\n        {\n            if(a<=m[i])\n                a=m[i];\n        }\n        }\n        else printf(\""请重新输入\"");\n\n\n    printf(\""%d\\n\"",a);\n\n\n\n    }\n    else printf(\""请重新输入\"");\n\n    return 0;\n}",WRONG_ANSWER,18,500
1591666350173773824,c47b15e117166a3dd00078b9f795673d5284a2761e582479119229751cc734d3,2022-11-13 13:36:44,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#define S 10000\n\n\nint main()\n{\n    int a=0,n,i,j,k;\n    int s[S];\n    int m[S];\n    scanf(\""%d\"",&n);\n    if(n>=1 && n<=10000)\n    {\n\n        for(i=0;i<n;i++)\n        scanf(\""%d\"",&s[i]);\n        for(i=0;i<n;i++)\n            if(s[i]>=1 && s[i]<=1000000)\n        {\n            for(i=0;i<n;i++)\n        {\n            k=1;\n            for(j=i;j<n;j++)\n            if(s[i]<=s[j])\n            m[i]=s[i]*(k++);\n            else break;\n        }\n        for(i=0;i<n;i++)\n        {\n            if(a<=m[i])\n                a=m[i];\n        }\n        }\n        else printf(\""请重新输入\"");\n\n\n    printf(\""%d\\n\"",a);\n\n\n\n    }\n    else printf(\""请重新输入\"");\n\n    return 0;\n}",WRONG_ANSWER,17,332
1591666383480709120,505c5b9a1b6d591a815315d95a57743fb98dad691b51421b4de282392fef3f43,2022-11-13 13:36:52,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R,SUM;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    if(P+Q>Q+R)\n    {\n        SUM=Q+R;\n    }\n    else\n        SUM=P+Q;\n    if(P+R>Q+R)\n    {\n        SUM=Q+R;\n    }\n    else\n        SUM=P+R;\n    if(P+R>P+Q)\n    {\n        SUM=P+Q;\n    }\n    else\n        SUM=P+R;\n    printf(\""%d\"",SUM);\n}\n",WRONG_ANSWER,19,372
1591666413109305344,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-13 13:36:59,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,m,all,f,k,i;\n    if(scanf(\""%d\"",&n));\n    switch(n)\n    {\n        case 1:printf(\""-4\"");break;\n        case 2:printf(\""-7\"");break:\n        case 3:printf(\""-2\"");break;\n        case 4:printf(\""-3\"");break;\n        case 5:printf(\""-3\"");break;\n        default:m=n/3;\n            f=-2+(m-1)*3;\n            k=n%3;\n            if(k==0)\n                i=0;\n            if(k==1)\n                i=n-5;\n            if(k==2)\n                i=2n-11;\n            all=f+i;\n            printf(\""%d\"",all);\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1591666423918026752,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 13:37:01,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[n],i,b=0;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if(a[i]>a[i+1]&&a[i+2]>a[i])\n            b=b+1;\n        if(a[i+1]=a[i+2]&&a[i]>a[i+1]&&a[i+3]>a[i+2])\n            b=b+1;\n    }\n    printf(\""%d\"",b);\n    return 0;\n}",WRONG_ANSWER,5,324
1591666440183537664,5d127211f3edce9d9bd1062c03cd08473e4481ec46b4b0c70c2e8d9141c68f20,2022-11-13 13:37:05,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int P,Q,R;\n    int i,money,money1=0,money2=0,money3=0;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n        printf(\""%d\"",P+Q);\n}",WRONG_ANSWER,10,328
1591666446147837952,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-13 13:37:07,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,m,all,f,k,i;\n    if(scanf(\""%d\"",&n));\n    switch(n)\n    {\n        case 1:printf(\""-4\"");break;\n        case 2:printf(\""-7\"");break;\n        case 3:printf(\""-2\"");break;\n        case 4:printf(\""-3\"");break;\n        case 5:printf(\""-3\"");break;\n        default:m=n/3;\n            f=-2+(m-1)*3;\n            k=n%3;\n            if(k==0)\n                i=0;\n            if(k==1)\n                i=n-5;\n            if(k==2)\n                i=2n-11;\n            all=f+i;\n            printf(\""%d\"",all);\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1591666458785275904,e9a50f3e071443bb6fb229966bff355c178d484f6cc10e5e1fc8dc5a537237ba,2022-11-13 13:37:10,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int b,i,c;\n    c=0;\n      scanf(\""%d\"",&b);\n    int a[b];\n    for(i=0;i<b;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=1;i<b;i++)\n    {\n        if(a[i]<a[i-1]&&a[i]<a[i+1]) c=c+1;\n        if(a[i]<a[i]-1&&a[i]==a[i+1]){\n            for(i;a[i]=a[i+1];i++)\n            {\n            }\n            //printf(\""%d\"",i);\n            break;\n           // if(a[i]<a[i+1])c=c+1;\n        }\n    }\n\n    printf(\""%d\\n\"",c);\n\n    return 0;\n}\n",WRONG_ANSWER,12,200
1591666467379359744,25b8e249c556de062ec0d61286db67304f907bc70204e22083d75434403578b1,2022-11-13 13:37:12,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a[3];\n    int i,sum=0;\n    for(i=0;i<3;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    int n=a[0];\n    for(i=0;i<3;i++)\n    {\n        sum=sum+a[i];\n        if(n<a[i])\n            n=a[i];\n    }\n    int m=0;\n    m=sum-n;\n    printf(\""%d\"",m);\n    return 0;\n}",ACCEPTED,31,608
1591666498450808832,bd8243b4b064cae986196b0eac310a36f12d46dc08f126fbdcaaca530c884eb0,2022-11-13 13:37:19,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int s[100000];\n    int i,n,j;\n    int m=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%c\"",s[i]);\n    }\n    for(i=0,j=1;j<n;i++,j++)\n    {\n        if(s[i]==s[j])\n        {\n            m++;\n            m++;\n            i++;\n            j++;\n        }\n    }\n    printf(\""%d\\n\"",m);\n    return 0;\n}\n",WRONG_ANSWER,11,200
1591666523754999808,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-13 13:37:25,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,m,all,f,k,i;\n    if(scanf(\""%d\"",&n));\n    switch(n)\n    {\n        case 1:printf(\""-4\"");break;\n        case 2:printf(\""-7\"");break;\n        case 3:printf(\""-2\"");break;\n        case 4:printf(\""-3\"");break;\n        case 5:printf(\""-3\"");break;\n        default:m=n/3;\n            f=-2+(m-1)*3;\n            k=n%3;\n            if(k==0)\n                i=0;\n            if(k==1)\n                i=n-5;\n            if(k==2)\n                i=2n-11;\n            all=f+i;\n            printf(\""%d\"",all);\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1591666528112881664,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-13 13:37:26,Python,0.0,1591610585639407617,1591132482555211776,1049226928954454016,\n,WRONG_ANSWER,17,2740
1591666532831518720,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-13 13:37:27,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\nint main(){\n    int gd = -5; // 固定减5\n    int count = 0;\n    int num = 0;\n    int len;\n    int j=-1;\n    if(scanf(\""%d\"",&len)){};\n    int arr[len];\n    \n        for(int i=0; i<len; i++){\n            if(scanf(\""%d\"",&arr[i])){};\n        }\n        \n        while(j<len){\n            // 给count赋值 单步最大\n            if(arr[j+1]+gd > arr[j+3]+gd){\n                count += arr[j+1]+gd;\n                j=j+1;\n            }else{\n                count += arr[j+3]+gd;\n                j=j+3;\n            }\n            // 总数最\n                num += count;\n            \n        }\n    printf(\""%d\"",num);\n}",WRONG_ANSWER,8,328
1591666532831518721,6ba5ecacf3381a1e9382f99c413290eca40a071a563a618e5f36d66cbf9a5e1b,2022-11-13 13:37:27,C++,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<iostream>\n\nusing namespace std;\n\nint main(){\nint n,flag=3;\nlong count=0;\ncin>>n;\nint h[n];\nfor(int i=0;i<n;i++)\n{\n    cin>>h[i];\n}\nfor(int i=0;i<n;i++)\n{\n    if(h[i+1]<h[i])\n        flag=1;\n    if(flag==1 && h[i+1]>h[i]){\n        count++;\n        flag=0;\n       /* cout<<i<<\"" \""<<count<<endl;*/\n    }\n}\ncout<<count-1<<endl;\n}\n",ACCEPTED,43,476
1591666537185173504,c5cc6f9845df4bd1986af86c0696296436bbc0f00a10a9f891b4100e57bc3a19,2022-11-13 13:37:28,C,300.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint i,j;\n\tint n;\n\tscanf(\""%d\"",&n);\n    \n\tgetchar();\n    char a[n];\n\tfor(i=0;i<n;i++) {\n\t\tscanf(\""%c\"",&a[i]);\n\t}\n    getchar();\n\tint a0,a1;\n\ta0=a1=0;\n\tfor(i=0;i<n;i++) {\n\t\tif(a[i]=='0') a0++;\n\t\tif(a[i]=='1') a1++;\n\t}\n\tint temp;\n\tif(a0>=a1) temp=a1;\n\telse temp=a0;\n\tprintf(\""%d\\n\"",temp*2);\n\t\n\treturn 0;\n}",ACCEPTED,37,348
1591666598363324416,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-13 13:37:43,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,m,all,f,k,i;\n    if(scanf(\""%d\"",&n));\n    switch(n)\n    {\n        case 1:printf(\""-4\"");break;\n        case 2:printf(\""-7\"");break;\n        case 3:printf(\""-2\"");break;\n        case 4:printf(\""-3\"");break;\n        case 5:printf(\""-3\"");break;\n        default:m=n/3;\n            f=-2+(m-1)*3;\n            k=n%3;\n            if(k==0)\n                i=0;\n            if(k==1)\n                i=n-5;\n            if(k==2)\n                i=2*n-11;\n            all=f+i;\n            printf(\""%d\"",all);\n    }\n    return 0;\n}",WRONG_ANSWER,12,348
1591666637345185792,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-13 13:37:52,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,e=0,i;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<n-2;i++)\n    if(a[i]>a[i+1])\n    e++;\n    \n    printf(\""%d\"",e);\n    return 0;\n}",WRONG_ANSWER,5,200
1591666640788664320,20ffd83467b553ac24e1f4b8b096d58858684ca8c3f6a4d5a62be9ff7c4817da,2022-11-13 13:37:53,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#define MAX 10000\nint main()\n{\n    int n,a,b,h=0;\n    int i;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    int c[MAX],F[MAX];\n    double B[MAX];\n    for(i=1;i<=n;i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=1;i<=n;i++)\n        scanf(\""%d\"",&F[i]);\n    for(i=1;i<=n;i++)\n        B[i]=c[i]/(F[i]+1)*pow(a,F[i]+1)-c[i]/(F[i]+1)*pow(b,F[i]+1);\n    for(i=1;i<=n;i++){\n        h+=B[i];\n        }\n    printf(\""%d\\n\"",h);\n}\n\n",WRONG_ANSWER,7,324
1591666667946782720,d830b0bcae7881ad6d1b2e2b14f3ffa3695b6d3bd622856493fa1cf903c9bf4e,2022-11-13 13:38:00,Java,0.0,1591610585635213312,1589816514637750272,1049226928954454016,import java.util.Scanner;\nimport java.util.Stack;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc=new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tString s = sc.next();\n\t\tchar[] ss= s.toCharArray();\n\t\tStack<Integer> stack = new Stack<Integer>();\n\t\tint count = 0;\n\t\tfor(int i =0;i<ss.length;i++){\n\t\t\tif(stack.isEmpty()){\n\t\t\t\tstack.push((int) ss[i]);\n\t\t\t}\n\t\t\tif(!stack.peek().equals(ss[i])){\n\t\t\t\tstack.pop();\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\telse{\n\t\t\t\tstack.push((int)ss[i]);\n\t\t\t}\n\t\t}\n\t\tSystem.out.print(count);\n\t\n\t}\n\n},WRONG_ANSWER,113,24848
1591666679132991488,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-13 13:38:02,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main(){\n    int n,a[1000],count=0,i,j,t=0;\n      scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n        \n        \n    \n    for( j=1;j<n-1;j++)\n    {\n        \n        if(a[j]<a[j-1]&&a[j]<a[j+1])\n        { count++;    count+=t;t=0;}\n             \n        else \n        if(a[j]==a[j+1])\n        {t=1;\n            continue;\n        }\n        if(j==n-2&&count!=0) count+=t;\n        \n       \n          \n            \n          \n    }\n    \n    \n   if(count!=0)\n      printf(\""%d\"",count);\n   else \n     printf(\""0\"");\n}",WRONG_ANSWER,6,196
1591666753229578240,03f9d7a6fc27d141b8243d1b2b44a3276cdd4750b5c2621d6d8c006b64ca6514,2022-11-13 13:38:20,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int p,q,r;\n    int a,b,c;\n    scanf(\""%d %d %d\"",&p,&q,&r);\n    a=p+q; //5\n    b=r+p; //6\n    c=q+r; //5\n    if(a>=b&&b>=c)\n        printf(\""%d\"",c);\n    if(b>=c&&c>=a)\n        printf(\""%d\"",a);\n    if(c>=a&&a>=b)\n        printf(\""%d\"",b);\n    return 0;\n}\n",WRONG_ANSWER,6,476
1591666764633890816,887d1bbe53a4d4a349813887f13126da5e46a853687f4c2c9d7b8ef3d748a9d6,2022-11-13 13:38:23,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nmain()\n{\n    int ai=1,hi[1000],s=0,i,n,min=0,h=0,j=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    scanf(\""%d\"",&hi[i]);\n    for(i=0;i<n;i++)\n    {\n    \th=hi[i];\n    \tfor(j=i;j<n-1;j++)\n    \t{\n    \tif(hi[j+1]>=h)\n    \t\tai++;\n    \telse\n    \tbreak;\n    \t}\n\t\tif(h*ai>s)\n\t\ts=h*ai;\n\t\tai=1;\n\t}\n\tprintf(\""%d\"",s);\n}",WRONG_ANSWER,34,372
1591666784489713664,ece045c1570c74e6800520e16047010817642535f83b9f2b4524ebdcf9d7925a,2022-11-13 13:38:27,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int n,i;\n    int sum=0;\n    scanf(\""%d\"",&n);\n     int a[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=1;i<n;i++)\n    {\n        if((a[i]<a[i-1])&&(a[i]<a[i+1]))\n        sum++;\n        else if((a[i]<a[i-1])&&(a[i]=a[i+1]))\n        {\n            if(a[i+1]<a[i+2])\n            sum++;\n        }\n\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,17,496
1591666827024162816,5a1c17b308a3b3595833d34c6bdfb75e9f5dd0d065acfeb7f28ab8102ba7406c,2022-11-13 13:38:37,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a[10];\n    int i,n;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    int count = 0;\n    for(i=1;i<n-1;i++){\n        if(a[i]<a[i-1]&&a[i]<a[i+1]){\n            count++;\n            }\n        while(a[i]==a[i+1]){\n            if(i>n-3){\n                break;\n            }\n            if(a[i+1]<a[i+2]){\n                count = count+1;\n                break;\n            }\n            i++;\n        }\n    }\n    printf(\""%d\"",count);\n    return 0;\n}\n",RUNTIME_ERROR,5,332
1591666858322092032,39afbda4ab6a7df2673bc0d0eec048a42b23ada2774ec941935a2b2fa044515a,2022-11-13 13:38:45,C++,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <bits/stdc++.h>\nusing namespace std;\n#define MAX 10001\nint main()\n{\n int c,p=0;\n int m=1,x=2,n=3;\n int a[MAX];\n cin>>c;\n for(int i=0;i<c;i++)\n    cin>>a[i];\n for(int j=0;j<c;j++){\n    if(a[m]>0){\n        if(a[m]>a[x]){\n            if(a[x]<a[n]){\n            p++;\n            m=n;\n            x=m+1;\n            n=m+2;\n            }\n            else {\n                x++;\n                n++;\n            }\n        }\n        else {\n            m++;\n            n++;\n            x++;\n        }\n    }\n    else m++;\n }\n cout<<p;\n}",ACCEPTED,34,640
1591666918795522048,6cbd81921f92855c6b8318725b09ef7ec48ff579276b3df9f7ea04bea9804678,2022-11-13 13:38:59,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int i,j,n,sum=0,max;\n    int a[n];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    scanf(\""%d\"",&a[i]);\n    max=a[0];\n    for(i=1;i<n;i++)\n    {\n        if(a[i]>=max)\n        {\n            max=a[i];\n            sum=i;\n        }\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",RUNTIME_ERROR,13,352
1591666921748357120,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 13:39:00,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[n],i,b=0;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if(a[i]>a[i+1]&&a[i+2]>a[i])\n            b=b+1;\n        else if(a[i+1]=a[i+2]&&a[i]>a[i+1]&&a[i+3]>a[i+2])\n            b=b+1;\n    }\n    printf(\""%d\"",b);\n    return 0;\n}",WRONG_ANSWER,7,512
1591666938437447680,505c5b9a1b6d591a815315d95a57743fb98dad691b51421b4de282392fef3f43,2022-11-13 13:39:04,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R,SUM;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    if(P+Q>Q+R)\n    {\n        SUM=Q+R;\n    }\n    else\n        SUM=P+Q;\n    if(P+R>Q+R)\n    {\n        SUM=Q+R;\n    }\n    else\n        SUM=P+R;\n    if(R+P>P+Q)\n    {\n        SUM=P+Q;\n    }\n    else\n        SUM=R+P;\n    printf(\""%d\"",SUM);\n}\n",WRONG_ANSWER,22,512
1591667013255454720,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-13 13:39:22,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main(){\n\tint n,i,j,k=0;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t} \n\tfor(i=2;i<n;i++){\n\t\tif(a[i]<a[i-1]){\n\t\t\tfor(j=i;j<n;j++){\n\t\t\t\tif(a[j]>a[j+1]) \n\t\t\t\t{\n\t\t\t\t\tk++;\n\t\t\t\t\tbreak;\n\t\t\t\t   }   \n\t\t\t}\n\t\t}\n\t}\n\tprintf(\""%d\\n\"",k);\n}",WRONG_ANSWER,12,328
1591667039545352192,73af9d5098be5d450fba728363c8fdbe0f6a5526466daa2f3b74abf1acf75527,2022-11-13 13:39:28,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int n,a,b;\n    int i=0;\n    int c[1000],F[1000];\n    int sum=0;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&c[i]);\n\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&F[i]);\n\n    }\n    if(n%2==0)\n    for(i=0;i<n;i++)\n    {\n\n        sum=sum+(c[i]/(F[i]+1))*(pow(a,F[i]+1 )-pow(b,F[i]+1 ));\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,12,324
1591667039725740032,5a1c17b308a3b3595833d34c6bdfb75e9f5dd0d065acfeb7f28ab8102ba7406c,2022-11-13 13:39:28,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a[100];\n    int i,n;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    int count = 0;\n    for(i=1;i<n-1;i++){\n        if(a[i]<a[i-1]&&a[i]<a[i+1]){\n            count++;\n            }\n        while(a[i]==a[i+1]){\n            if(i>n-3){\n                break;\n            }\n            if(a[i+1]<a[i+2]){\n                count = count+1;\n                break;\n            }\n            i++;\n        }\n    }\n    printf(\""%d\"",count);\n    return 0;\n}\n",RUNTIME_ERROR,36,492
1591667048818958336,37ec44401a5a9f0dfa02d2aedaf5edff84fc443d98174af5f21ab01a7d6f6a41,2022-11-13 13:39:30,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b,c;\n    int tmp,sum=0;\n    scanf(\""%d%d%d\"",&a,&b,&c);\n    if(a>b)\n        {\n        tmp=a;\n        a=b;\n        b=tmp;\n        }\n    if(a>c)\n        {\n        tmp=a;\n        a=c;\n        c=tmp;\n        }\n     if(b>c)\n        {\n        tmp=b;\n        b=c;\n        c=tmp;\n        }\n        sum=b+a;\n    printf(\""%d\\n\"",sum);\n    return 0;\n}",ACCEPTED,41,352
1591667058281295872,54914c90623988219ee55c4a0b2e645efd9808505aa25f0099930bfa8bf18ad1,2022-11-13 13:39:33,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main(){\n\tint inp,i;\n\tscanf(\""%d\"",&inp);\n\tint a[inp];\n\tfor(i=0;i<inp;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tint count = 0;\n\tfor(i=1;i<inp-1;i++){\n\t\tif(a[i]<a[i-1] && a[i]<a[i+1]){\n\t\t\tcount++;\n\t\t}\n\t\tif(a[i]<a[i-1] && a[i]==a[i+1]){\n\t\t\tfor(i;i<inp-1;i++){\n\t\t\t\tif(a[i]<a[i+1]){\n\t\t\t\t\tcount++;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\""%d\"",count);\n}",ACCEPTED,34,464
1591667092968189952,9a1ecd1db02b268060006afd7de34ec54e74e90bf61becbb6811fb23971c4720,2022-11-13 13:39:41,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,def iss(x):\n    if x==2:\n        if s[0]!=s[1]:\n            s.clear()\n        return s\n    elif x==1:\n         return s\n    elif x==3:\n        if s[0]!=s[1] or s[1]!=s[2]:\n            s.pop(0)\n            s.pop(1)\n            return s\n    for i in range(x-2):\n        if s[i]!=s[i+1]:\n            s.pop(i)\n            s.pop(i+1)\n            l=len(s)\n            return iss(l)\n\nn=int(input())\ns=list(input())\nl=n\ny=iss(l)\nz=len(y)\nprint(n-z)\n\n,NON_ZERO_EXIT_CODE,129,4744
1591667096344616960,73af9d5098be5d450fba728363c8fdbe0f6a5526466daa2f3b74abf1acf75527,2022-11-13 13:39:42,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int n,a,b;\n    int i=0;\n    int c[1000],F[1000];\n    int sum=0;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&c[i]);\n\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&F[i]);\n\n    }\n    \n    for(i=0;i<n;i++)\n    {\n\n        sum=sum+(c[i]/(F[i]+1))*(pow(a,F[i]+1 )-pow(b,F[i]+1 ));\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,8,192
1591667099129634816,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-13 13:39:42,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"n = int(input())\nlist1 = []\na=0\nlist1 = input().split(\"" \"")\nfor i in range(1,n-1):\n    if list1[i-1] > list1[i]:\n        a+=1\n    i+=1\nprint(a)",WRONG_ANSWER,19,2892
1591667111049879552,0354b067c4132d4425a90b77482ac717447702274cb7db1282edce56eaf037b3,2022-11-13 13:39:45,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main(){\n\tint n,i,a[100],count;\n\tcount=0;\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++)\n\t    scanf(\""%d\"",&a[i]);\n\tfor(i=1;i<n-1;i++){\n\t\tif(a[i]<a[i-1]&&a[i]<=a[i+1])\n\t\t    count=count+1;\n\t}\n\tprintf(\""%d\"",count);\n\treturn 0;\n} ",RUNTIME_ERROR,25,372
1591667135964045312,acf80eea856463058b81f71c0238069795893092293fbd098cc594959df6444e,2022-11-13 13:39:51,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,n=int(input())\ns=input().split()\nh=0\nfor i in range(n):\n    if i>0 and i<n-2:\n        if s[i]>s[i+1] and s[i+1]<s[i]:\n            h=h+1\n        else:\n            h=h+0\n    else:\n        h=h+0\nprint(h)\n    ,WRONG_ANSWER,15,2920
1591667138220548096,ece045c1570c74e6800520e16047010817642535f83b9f2b4524ebdcf9d7925a,2022-11-13 13:39:52,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int n,i;\n    int sum=0;\n    scanf(\""%d\"",&n);\n     int a[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=1;i<n-1;i++)\n    {\n        if((a[i]<a[i-1])&&(a[i]<a[i+1]))\n        sum++;\n        else if((a[i]<a[i-1])&&(a[i]=a[i+1]))\n        {\n            if(a[i+1]<a[i+2])\n            sum++;\n        }\n\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,41,460
1591667177655427072,09eb01e8f9f24922a6c60a1149d505ad1ebb9b0a39ed1101140fe0fd93daa753,2022-11-13 13:40:01,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"   #include<stdio.h>\n    int main()\n    {\n\n        int n,i,j,counts=0;\n        int arr[100]={0};\n        scanf(\""%d\"",&n);\n        for(i=0;i<n;i++)\n        {\n            scanf(\""%d\"",&arr[i]);\n        }\n        for(i=0;i<n;i++)\n        {\n            if(arr[i+1]==arr[i])\n            {\n                n=n-1;\n                for(j=i;j<n;j++)\n                {\n                    arr[j]=arr[j+1];\n                }\n                i--;\n            }\n        }\n        for(i=0;i<n;i++)\n        {\n\n            if(arr[i]>arr[i+1]&&arr[i+1]<arr[i+2])\n            {\n                counts++;\n            }\n        }\n        printf(\""%d\"",counts);\n        return 0;\n    }\n\n",RUNTIME_ERROR,32,368
1591667191064616960,2bc6a85c0376656012a7970a7842a2a9d8769555a79ef4eec85ff45aa30ff7b7,2022-11-13 13:40:04,Java,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"import java.util.Scanner;\nimport java.util.regex.Matcher;\nimport java.util.regex.Pattern;\n\npublic class Main {\n    public static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tsc.nextLine();\n\t\tString s = sc.nextLine();\n\t\tint n = 0;\n\t\tPattern p = Pattern.compile(\""[0]{2}|[1]{2}\"");\n\t\tMatcher m = p.matcher(s);\n\t\twhile(true) {\n\t\t\tString ss = m.replaceFirst(\""\"");\n\t\t\tif(ss.equals(s)) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\ts = ss;\n\t\t\tm = p.matcher(s);\n\t\t\tn=n+2;\n\t\t}\n\t\tSystem.out.println(n);\n\t}\n}",WRONG_ANSWER,102,24672
1591667193920905216,d830b0bcae7881ad6d1b2e2b14f3ffa3695b6d3bd622856493fa1cf903c9bf4e,2022-11-13 13:40:05,Java,0.0,1591610585635213312,1589816514637750272,1049226928954454016,import java.util.Scanner;\nimport java.util.Stack;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc=new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tString s = sc.next();\n\t\tchar[] ss= s.toCharArray();\n\t\tStack<Integer> stack = new Stack<Integer>();\n\t\tint count = 0;\n\t\tfor(int i =0;i<ss.length;i++){\n\t\t\tif(stack.isEmpty()){\n\t\t\t\tstack.push((int) ss[i]);\n\t\t\t}\n\t\t\tif(!stack.peek().equals((int)ss[i])){\n\t\t\t\tstack.pop();\n\t\t\t\tcount+=2;\n\t\t\t}\n\t\t\telse{\n\t\t\t\tstack.push((int)ss[i]);\n\t\t\t}\n\t\t}\n\t\tSystem.out.print(count);\n\t\n\t}\n\n}\n,WRONG_ANSWER,105,24668
1591667253299666944,6a4a105e99255cc39ebb6a122c9fdf740e574dbb708100363b339265f92e1bbf,2022-11-13 13:40:19,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nint main(){\n    int P,Q,R;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    if(P+Q>=P+R){\n        if(P+R>=Q+R){\n            printf(\""%d\"",Q+R);\n        }\n        else if(P+R<Q+R){\n            printf(\""%d\"",P+R);\n        }\n    }\n    else if(P+Q<=P+R){\n        if(P+Q>=Q+R){\n            printf(\""%d\"",Q+R);\n        }\n        else if(P+Q<Q+R){\n            printf(\""%d\"",P+Q);\n        }\n    }\n}",ACCEPTED,40,508
1591667273839173632,acf80eea856463058b81f71c0238069795893092293fbd098cc594959df6444e,2022-11-13 13:40:24,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,n=int(input())\ns=input().split()\nh=0\nfor i in range(n):\n    if i>0 and i<n-2:\n        if s[i]>s[i+1]:\n            h=h+1\n        else:\n            h=h+0\n    else:\n        h=h+0\nprint(h)\n    ,WRONG_ANSWER,19,2892
1591667276733231104,a5291eb67188c2a916aa5dd9fc38f2e449aa9f9a3cd047f282d8c154ea2979cd,2022-11-13 13:40:25,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,#include <iostream>\n\nusing namespace std;\nconst int N = 1e6 + 10;\nint arr[N];\n\nint main()\n{\n    int cnt = 0;\n    int n = 0;\n    cin >> n;\n    for(int i = 1;i <= n;i++)\n    {\n        cin >> arr[i];\n    }\n    \n    for(int i = 1;i <= n - 1;i++)\n    {\n        if(arr[i] - arr[i - 1] < 0)\n        {\n            int j = i;\n            while(arr[j] - arr[j - 1] <= 0 && j <= n)\n            {\n                j++;\n            }\n            i = j - 1;\n            cnt++;\n        }\n    }\n    \n    cout << cnt << endl;\n    \n    return 0;\n},WRONG_ANSWER,5,488
1591667329937989632,542d97133043a1f2156354473a31382c35bb2836688b0ed76eae59c52a2e0e3a,2022-11-13 13:40:37,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main()\n{\n    int m,n,o,sum=0;\n    scanf(\""%d\"",&n);\n    if(n>=3&&n<=10000)\n    {\n        int h[n];\n        for(m=0;m<n;m++)\n        {\n            scanf(\""%d\"",&h[m]);\n        }\n        \n            for(o=1;o<n-1;o++)\n            {\n                if(h[o]<h[o+1]||h[o]<h[o-1])\n                {\n                    sum=sum+1;\n                    if(h[o]==h[o+1])\n                        sum=sum-1;\n                }\n            }\n            printf(\""%d\"",sum); \n         \n    }\n    \n    \n}",WRONG_ANSWER,7,200
1591667343749865472,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-11-13 13:40:41,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i;\n    int a[3]={0},b[6]={0};\n    int minsum=3001;\n    for(i=0;i<3;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    b[0]=a[0]+a[1];\n    b[1]=a[0]+a[2];\n    b[2]=a[1]+a[2];\n    b[3]=a[1]+a[0];\n    b[4]=a[2]+a[0];\n    b[5]=a[2]+a[1];\n    for(i=0;i<6;i++)\n    {\n        if(b[i]<minsum)\n            minsum=b[i];\n    }\n    printf(\""%d\\n\"",minsum);\n    return 0;\n}",WRONG_ANSWER,12,472
1591667369423155200,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 13:40:47,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[n],i,b=0;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if(a[i]>a[i+1]&&a[i+2]>a[i+1])\n            b=b+1;\n        else if(a[i+1]=a[i+2]&&a[i]>a[i+1]&&a[i+3]>a[i+2])\n            b=b+1;\n    }\n    printf(\""%d\"",b);\n    return 0;\n}",WRONG_ANSWER,6,352
1591667374540206080,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-13 13:40:48,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"n = int(input())\nlist1 = []\na=0\nlist1 = input().split(\"" \"")\nfor i in range(2,n-1):\n    if list1[i-1] > list1[i]:\n        a+=1\n    i+=1\nprint(a)",WRONG_ANSWER,16,2760
1591667375605571584,c76414e1d2d8531a5745e9bd3192aafa7cca924e645650ffe7954c992cc13b33,2022-11-13 13:40:48,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\nint i,j,t;\nint a[3];\nfor(i=0;i<3;i++)\nscanf(\""%d\"",&a[i]);\nfor(i=0;i<2;i++)\n    for(j=0;j<2-i;j++)\n    {\n        if(a[j]<a[j+1])\n        {\n                        t=a[j];\n            a[j]=a[j+1];\n            a[j+1]=t;\n        }\n\n    }\n    printf(\""%d\"",a[1]+a[2]);\n}\n",ACCEPTED,34,484
1591667393901158400,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-13 13:40:53,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"n = int(input())\nlist1 = []\na=0\nlist1 = input().split(\"" \"")\nfor i in range(2,n-1):\n    if list1[i-1] > list1[i]:\n        a+=1\n    i+=1\nprint(a)",WRONG_ANSWER,17,2888
1591667398045097984,25584884fd716238437f89484285121d106c1090916ab683be624f210130ebad,2022-11-13 13:40:54,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n   int i,P,Q,R,sum1,sum2,sum3,min;\n   scanf(\""%d %d %d\"",&P,&Q,&R);\n   sum1=P+Q;sum2=R+Q;sum3=P+R;\n if(sum1<=sum2&&sum1<=sum3)\n    min=sum1;\n  if(sum2<=sum1&&sum2<=sum3)\n    min=sum2;\n   if(sum3<=sum1&&sum3<=sum2)\n    min=sum3;\n   printf(\""%d\"",min);\n   return 0;\n}\n\n\n\n\n\n\n\n",ACCEPTED,30,512
1591667451765776384,d830b0bcae7881ad6d1b2e2b14f3ffa3695b6d3bd622856493fa1cf903c9bf4e,2022-11-13 13:41:06,Java,0.0,1591610585635213312,1589816514637750272,1049226928954454016,import java.util.Scanner;\nimport java.util.Stack;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc=new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tString s = sc.next();\n\t\tchar[] ss= s.toCharArray();\n\t\tStack<Integer> stack = new Stack<Integer>();\n\t\tint count = 0;\n\t\tfor(int i =0;i<ss.length;i++){\n\t\t\tif(stack.isEmpty()){\n\t\t\t\tstack.push((int) ss[i]);\n\t\t\t}\n\t\t\tif(!stack.peek().equals((int)ss[i])){\n\t\t\t\tstack.pop();\n\t\t\t\tcount+=2;\n\t\t\t}\n\t\t\telse{\n\t\t\t\tstack.push((int)ss[i]);\n\t\t\t}\n\t\t}\n\t\tSystem.out.print(count);\n\t\n\t}\n\n}\n,WRONG_ANSWER,114,25064
1591667454332645376,423e1acd0d02cf3d43f3c7805099dea4edcb39c2e0fa385e82823b5a7c0dd214,2022-11-13 13:41:07,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,j;\n    int c=0;\n    int a[100];\n    int cout=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=1;j<n;j++){\n        if(a[j]<a[j-1]&&a[j]<=a[j+1])\n            cout++;\n    }\n    printf(\""%d\\n\"",cout-1);\n    return 0;\n}\n",WRONG_ANSWER,7,348
1591667455272169472,001baa7272d47ab2d3a9b57bf7838570ff03ab1cabb738e7b342b652b1e42a83,2022-11-13 13:41:07,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <iostream>\n#include <bits/stdc++.h>\nusing namespace std;\n\n//  ceil()    floor()\n\n//long long amax=-9999999;\n\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(int i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    int sum=0;\n    int h=0;\n\n    if(a[1]>=a[0]){\n        h=a[1];\n    for(int i=2;i<n;i++){\n        if(a[i]<h && i!=(n-1)){\n            sum++;\n            //printf(\""====%d\\n\"",i);\n            h=a[i];\n        }else if(a[i]==h){\n            continue;\n        }else{\n            h=a[i];\n        }\n    }\n    }else{\n        h=a[0];\n        for(int i=1;i<n;i++){\n        if(a[i]<h && i!=(n-1)){\n            sum++;\n            h=a[i];\n        }else if(a[i]==h){\n            continue;\n        }else{\n            h=a[i];\n        }\n    }\n    }\n\n    printf(\""%d\\n\"",sum);\n\n\n    return 0;\n}\n",WRONG_ANSWER,6,324
1591667463044227072,505c5b9a1b6d591a815315d95a57743fb98dad691b51421b4de282392fef3f43,2022-11-13 13:41:09,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R,SUM;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    if(P+Q>P+R)\n    {\n        SUM=P+R;\n    }\n    else\n        SUM=P+Q;\n    if(Q+R>Q+P)\n    {\n        SUM=Q+R;\n    }\n    else\n        SUM=Q+P;\n    if(R+P>R+Q)\n    {\n        SUM=R+Q;\n    }\n    else\n        SUM=R+P;\n    printf(\""%d\"",SUM);\n}\n",WRONG_ANSWER,8,192
1591667485999640576,fa305ee4bf4c6a54add4e945b551f1e902b95c1a179a91ded55bf7ebb1c87c23,2022-11-13 13:41:15,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{  int n,i,x=0;\n  scanf(\""%d\"",&n);\n  int s[n];\n  for(i=0;i<n;i++){\n    scanf(\""%d\"",&s[i]);\n  }\n  for(i=1;i<n;i++){\n    if(s[i]<s[i-1]&&s[i]<s[i+1]) x++;\n  }\n   printf(\""%d\\n\"",x);\n    return 0;\n}",WRONG_ANSWER,19,356
1591667514764222464,0b693affc66d8d407ff008bd1aaf4f2feb4a615f057943ba4b4ba3163d937dc6,2022-11-13 13:41:21,Java,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"import java.io.*;\nimport java.util.*;\n\npublic class Main {\n\n    public static void main(String[] args) throws IOException {\n        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n        Scanner sc=new Scanner(System.in);\n        String s=br.readLine();\n        String[] str=br.readLine().split(\"" \"");\n        int n=Integer.parseInt(s);\n        int res=0;\n        int temp=0;\n        for (int i = 0; i < n; i++) {\n            int flag=Integer.parseInt(str[i]);\n            temp=flag;\n            for (int j = i+1; j < n; j++) {\n                if (Integer.parseInt(str[j])>=flag){\n                    temp+=flag;\n                }else\n                    break;\n            }\n            res=Math.max(res,temp);\n        }\n        System.out.println(res);\n    }\n}",WRONG_ANSWER,300,25196
1591667525828796416,e715137eeb4190ade2330123b989bbdd6eebd9a5e1df2e292271d3bfe3a79c69,2022-11-13 13:41:24,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint a[100000]={0};\nint main()\n{\n    int i,j=0,k=0,n;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    j=a[0];\n    i=1;\n    while(i<n)\n    {\n        if(a[i]>5)\n        {\n            \n            k+=j-5;\n            j=a[i];\n            i++;   \n        }\n        else if(a[i+1]+a[i+2]>10||(10-a[i+1]+a[i+2]<5-a[i+2]))\n        {\n            k+=j-10+a[i+1];\n            j=a[i+2];\n            i+=2;\n        }\n        else \n        {\n            k+=j-5;\n            j=a[i+3];\n            i=i+3;\n        }\n    }\n    printf(\""%d\\n,k+1);\n    return 0;\n}",COMPILE_ERROR,0,0
1591667556220690432,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-13 13:41:31,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main(){\n\tint n,i,j,k=0;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t} \n\tfor(i=2;i<n;i++){\n\t\tif(a[i]<a[i-1]){\n\t\t\tfor(j=i;j<n;j++){\n\t\t\t\tif(a[j]>a[j+1]) \n\t\t\t\t{\n\t\t\t\t\tk++;\n\t\t\t\t\tbreak;\n\t\t\t\t   }   \n\t\t\t}\n\t\t}\n\t}\n\tprintf(\""%d\\n\"",k);\n}",WRONG_ANSWER,9,348
1591667568329633792,9d0546dac18a9dc678295254e547925db086add5f872ef42d8015d525afeaf65,2022-11-13 13:41:34,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 3\nlong main()\n{\n    long num[N],i,j,temp;\n    for(i=0;i<N;i++){\n        scanf(\""%d\"",&num[i]);\n    }\n    for(i=1;i<N;i++){\n        for(j=0;j<N-i;j++){\n            if(num[j]>num[j+1]){\n                temp=num[j];\n                num[j]=num[j+1];\n                num[j+1]=temp;\n            }\n        }\n    }\n    printf(\""%d\"",num[0]+num[1]);\n    return 0;\n}\n",WRONG_ANSWER,10,324
1591667599497551872,d122b81a371b28751082747cf65a235d0eddfd496e142775cd971d8f88adf327,2022-11-13 13:41:42,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int min=0;\n    int x,y,z;\n   if(scanf(\""%d %d %d\"",&x,&y,&z)!=1){;\n    min=x+y;\n    if(x+z<=min&&x+z>min){\n        min=x+z;\n        printf(\""%d\\n\"",min);\n    }\n    if(y+z<=min&&x+z>min){\n        min=y+z;\n        printf(\""%d\\n\"",min);\n    }\n    if(y+z>min&&x+z>min){\n        printf(\""%d\\n\"",min);\n    }\n                                    }                           \n    return 0;\n                                \n}",WRONG_ANSWER,19,632
1591667600000868352,0354b067c4132d4425a90b77482ac717447702274cb7db1282edce56eaf037b3,2022-11-13 13:41:42,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main(){\n\tint n,i,a[10000],ans;\n\tans=0;\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++)\n\t    scanf(\""%d\"",&a[i]);\n\tfor(i=1;i<n-1;i++){\n\t\tif(a[i]<a[i-1]&&a[i]<=a[i+1])\n\t\t    ans++;\n\t}\n\tprintf(\""%d\"",ans);\n\treturn 0;\n} ",ACCEPTED,41,512
1591667609475768320,b8a7ba8e6c41741e66a8153e5f137c86c8dba9c4dbb2f65f35d7554a5b082d56,2022-11-13 13:41:44,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main(){\n     int p,q,r,a,b,c;\n    scanf(\""%d %d %d\"",&p,&q,&r);\n    a=p+q;\n        b=q+r;\n        c=r+p;\n    if(a>b)\n        a=b;\n    if(a>c)\n        a=c;\n    printf(\""%d\"",a);\n    return 0;\n}",ACCEPTED,42,512
1591667615574319104,ccc42b8437aa15d1214e4623799ed35cd8ea8087c26cb1b596d51ae4556ea39c,2022-11-13 13:41:45,Python,300.0,1591610585635213312,1589816514637750272,1049226928954454016,a=int(input())\nb=input()\nling=0\nyi=0\nmina=0\nfor i in range(a):\n    if int(b[i])==0:\n        ling+=1\n        \n    else:\n        yi+=1\nif ling<=yi:\n    mina=ling\n    \nelse:\n    mina=yi\nprint(2*mina),ACCEPTED,114,3140
1591667619256872960,281adcca8943f9f4c0ced14f1ceffe157a34fca39f3cb864eb95e400944e38a8,2022-11-13 13:41:46,Java,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"\n\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner scan=new Scanner(System.in);\n\t\tint n=scan.nextInt();\n\t\tint[] arr=new int[n];\n\t\tfor(int i=0;i<n;i++){\n\t\t\tarr[i]=scan.nextInt();\n\t\t}\n\t\tint i=0;\n\t\tint j=arr.length-1;\n\t\tint max=0;\n\t\twhile(i<j){\n\t\t\tmax=Math.max(Math.min(arr[i], arr[j])*(j-i+1),max);\n\t\t\ti++;\n\t\t\tj--;\n\t\t}\n\t\tSystem.out.println(max);\n\t}\n}\n",WRONG_ANSWER,109,24692
1591667669143969792,e715137eeb4190ade2330123b989bbdd6eebd9a5e1df2e292271d3bfe3a79c69,2022-11-13 13:41:58,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint a[100000]={0};\nint main()\n{\n    int i,j=0,k=0,n;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    j=a[0];\n    i=1;\n    while(i<n)\n    {\n        if(a[i]>5)\n        {\n            \n            k+=j-5;\n            j=a[i];\n            i++;   \n        }\n        else if(a[i+1]+a[i+2]>10||(10-a[i+1]+a[i+2]<5-a[i+2]))\n        {\n            k+=j-10+a[i+1];\n            j=a[i+2];\n            i+=2;\n        }\n        else \n        {\n            k+=j-5;\n            j=a[i+3];\n            i=i+3;\n        }\n    }\n    k=k+1;\n    printf(\""%d\\n,k);\n    return 0;\n}",COMPILE_ERROR,0,0
1591667670104465408,07d925df8d2026d3171a0a2ca84a6ef7f4a5b47a584cf47b66c5dd8f28139d1f,2022-11-13 13:41:58,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a[100],count,n,i;\n    count=0;\n    scanf(\""%d\"",&n);\n    for (i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n        if(a[i]>=a[i-1]&&a[i]<=a[i+1])\n            count++;\n    }\n    printf(\""%d\\n\"",count);\n    return 0;\n}\n",WRONG_ANSWER,9,328
1591667689196937216,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-13 13:42:03,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main(){\n\tint n,i,j,k=0;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t} \n\tfor(i=2;i<n-1;i++){\n\t\tif(a[i]<a[i-1]){\n\t\t\tfor(j=i;j<n;j++){\n\t\t\t\tif(a[j]>a[j+1]) \n\t\t\t\t{\n\t\t\t\t\tk++;\n\t\t\t\t\tbreak;\n\t\t\t\t   }   \n\t\t\t}\n\t\t}\n\t}\n\tprintf(\""%d\\n\"",k);\n}",WRONG_ANSWER,5,220
1591667690388086784,423e1acd0d02cf3d43f3c7805099dea4edcb39c2e0fa385e82823b5a7c0dd214,2022-11-13 13:42:03,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,j;\n    int c=0;\n    int a[10000];\n    int cout=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=1;j<n;j++){\n        if(a[j]<a[j-1]&&a[j]<=a[j+1])\n            cout++;\n    }\n    printf(\""%d\\n\"",cout-1);\n    return 0;\n}\n",ACCEPTED,29,348
1591667735896317952,e715137eeb4190ade2330123b989bbdd6eebd9a5e1df2e292271d3bfe3a79c69,2022-11-13 13:42:14,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint a[100000]={0};\nint main()\n{\n    int i,j=0,k=0,n;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    j=a[0];\n    i=1;\n    while(i<n)\n    {\n        if(a[i]>5)\n        {\n            \n            k+=j-5;\n            j=a[i];\n            i++;   \n        }\n        else if(a[i+1]+a[i+2]>10||(10-a[i+1]+a[i+2]<5-a[i+2]))\n        {\n            k+=j-10+a[i+1];\n            j=a[i+2];\n            i+=2;\n        }\n        else \n        {\n            k+=j-5;\n            j=a[i+3];\n            i=i+3;\n        }\n    }\n    k=k+1;\n    printf(\""%d\\n\"",k);\n    return 0;\n}",WRONG_ANSWER,6,512
1591667769589129216,f55f4c0e0e3367434e26a462e3665271f5b4141ea3de4f34d96fdb21d67e2a7c,2022-11-13 13:42:22,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,i,z,b,count;\n    scanf(\""%d\"",&a);\n    count=0;\n    int k[a];\n for(i=0;i<a;i++)\n {\n    scanf(\""%d\"",&k[i]);\n    if(k[i]<k[i+1]&&k[i+1]<k[i+2])\n        count++;\n\n }\n b=count-2;\n printf(\""%d\"",b);\n\n\n\n\n\n\n    return 0;\n}\n",WRONG_ANSWER,13,356
1591667772671942656,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-13 13:42:23,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n\nint main() {\n\t     int n,zhan,i,j;\n\t\t scanf(\""%d\"",&n); \n\t\t int a[100];\n\t\t for(i=0;i<n;i++)\n\t\t {\n\t\t scanf(\""%d\"",&a[i]);\n\t     }\n\t\tfor(i=0;i<n;i++)\t\n\t\t{\t\n\t\tfor(j=1;j<n;j++)\n\t\t{\n\t\t\tif(a[i]>a[i+1])\n\t\t\t{\n\t\t\tif(a[i+1]<a[i+j])\n\t\t\tzhan++;\n\t\t\tbreak;\n\t\t\t}\n\t\t\t i++;\n\t\t}\n\t\t\n\t\t}\n\t\tprintf(\""%d\"",zhan);\t\n\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                   \n",WRONG_ANSWER,8,200
1591667777604476928,0cfbb4a339ebbc4dce13b5f3e3f98a3def0ab17ef5b4ac8e6d566de92e1f5f78,2022-11-13 13:42:24,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n;\n    int h[1001];\n    int count=0;\n    int x=0;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        scanf(\""%d\"",&h[i]);\n        if(h[i]==0){\n            x++;\n        }\n    }\n    for(int i=2;i<=n-2;i++){\n        if(h[i]<=h[i+1]&&h[i]<=h[i-1]){\n            count++;\n            if(h[i]==h[i+1])\n                count=count-1;\n        }\n    }\n    if(x==n){\n        count=1;\n    }\n    printf(\""%d\"",count);\n}",ACCEPTED,34,356
1591667810492014592,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 13:42:32,Python,0.0,1591610585635213315,1591129345182261248,1049226928954454016,sum=16\nprint(sum),WRONG_ANSWER,15,2780
1591667818201112576,59415347d1cfa3163c0a25f108652369803ee9c4d72f5c59e4212aabab93e388,2022-11-13 13:42:34,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main(int argc, char *argv[]) {\n\tint a[10000];\n\tint n = 0,m = 0,number = 0,i;\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&m);\n\t\ta[i] = m;\n\t}\n\tfor(i=1;i<n;i++){\t\t\t\n\t\tif(a[i]<a[i+1]&&a[i]<=a[i-1]){\n\t\t\tnumber++;\t\t\n\t\t}\t\t\n\t}\n\n\tprintf(\""%d\"",number);\n\treturn 0;\n}",ACCEPTED,33,512
1591667842691686400,64475a8ecd7d5a6c6e734f3f299283e039c26933b2a0e510cd9d22e95ba92068,2022-11-13 13:42:40,C++,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <bits/stdc++.h> \nusing namespace std;\n\n\n\nint main()\n{\n\tint n,s = 0;\n\tcin>>n;\n\t\n\tint a[10010];\n\ta[n] = 0;\n\tfor(int i = 0; i < n; i++)\n\t{\n\t\tcin>>a[i];\n\t}\n\t\n\tfor(int i = 0; i < n-1; i++)\n\t{\n\t\tif(a[i]>a[i+1])\n\t\t{\n\t\t\tfor(int j = i+1; j <n-1; j++)\n\t\t\t{\n\t\t\t\tif(a[j] < a[j+1])\n\t\t\t\t{\n\t\t\t\t\ts++;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\telse if(a[j] > a[j+1])\n\t\t\t\t{\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tcout<<s;\n\t\n\treturn 0;\n}",ACCEPTED,56,640
1591667857271054336,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 13:42:43,Python,0.0,1591610585635213315,1591129345182261248,1049226928954454016,sum=16\nprint(sum),WRONG_ANSWER,16,2892
1591667877512798208,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-13 13:42:48,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main(){\n    int i,j,n,h[9999],max=0,chengji=15;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&h[i]);\n    }\n    for(i=0;i<n;i++){\n        for(j=i+1;j<n;j++){\n            if(h[j]==h[j-1]){\n                chengji=h[j]*(j+1);\n            }\n            if(chengji>max){\n                max=chengji;\n            }\n        }\n        if(chengji>max){\n            max=chengji;\n        }\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",WRONG_ANSWER,7,352
1591667913265000448,e715137eeb4190ade2330123b989bbdd6eebd9a5e1df2e292271d3bfe3a79c69,2022-11-13 13:42:56,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint a[100000]={0};\nint main()\n{\n    int i,j=0,k=0,n;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    j=0;\n    i=0;\n    while(i<n)\n    {\n        if(a[i]>5)\n        {\n            \n            k+=j-5;\n            j=a[i];\n            i++;   \n        }\n        else if(a[i+1]+a[i+2]>10||(10-a[i+1]+a[i+2]<5-a[i+2]))\n        {\n            k+=j-10+a[i+1];\n            j=a[i+2];\n            i+=2;\n        }\n        else \n        {\n            k+=j-5;\n            j=a[i+3];\n            i=i+3;\n        }\n    }\n    printf(\""%d\\n\"",k);\n    return 0;\n}",WRONG_ANSWER,6,320
1591667915014037504,a5291eb67188c2a916aa5dd9fc38f2e449aa9f9a3cd047f282d8c154ea2979cd,2022-11-13 13:42:57,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,#include <iostream>\n\nusing namespace std;\nconst int N = 1e6 + 10;\nint arr[N];\n\nint main()\n{\n    int cnt = 0;\n    int n = 0;\n    cin >> n;\n    for(int i = 1;i <= n;i++)\n    {\n        cin >> arr[i];\n    }\n    \n    for(int i = 2;i <= n - 1;i++)\n    {\n        if(arr[i] - arr[i - 1] < 0)\n        {\n            int j = i;\n            while(arr[j] - arr[j - 1] < 0 && j <= n)\n            {\n                j++;\n            }\n            i = j - 1;\n            cnt++;\n        }\n    }\n    \n    cout << cnt << endl;\n    \n    return 0;\n},WRONG_ANSWER,9,320
1591667926309330944,064270dabaa13edbd7238477860db0e46621a5ed4921e8aa2c0f9258e77722cc,2022-11-13 13:43:00,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 100\nint main()\n{\nint sum[N];\nint a,i;\nint count=0;\nscanf(\""%d\"",&a);\n\nfor(i=1;i<a;i++)\n   {\n       scanf(\""%d\"",&sum[i]);\n       if(sum[i]<=sum[i+1]&&sum[i]<sum[i-1])\n        count++;\n   }\n\n\nprintf(\""%d\"",count);\n}\n",WRONG_ANSWER,5,196
1591667937269047296,ddd0edd80a23dfec88d0679f4ed6037779b80d26db4ba0f74fecb3d447de61fa,2022-11-13 13:43:02,C++,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#define Max 100000\nint main(){\n    int n,j=0,i,flag=0;\n    int a[Max];\n    scanf(\""%d\"",&n);\n    while(n){\n        scanf(\""%d\"",&a[j]);\n        n--;\n        j++;\n    }\n    a[j]=-10000;\n    a[j+1]=-100000;\nfor(i=0;i<j;i++)\n{\n   if(a[i]<=a[i+1])\n       i=i+1;\n    if(a[i]>a[i+1]&&a[i+2]>=a[i+1])\n        flag++;\n    }\n    printf(\""%d\\n\"",flag);\n}",ACCEPTED,27,512
1591667960031502336,1e783de44f6cf9abb158b108e556a36ef99d9241fc592b40cfd6cb7d1265eb34,2022-11-13 13:43:08,Java,300.0,1591610585639407617,1591132482555211776,1049226928954454016,"import java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner s=new Scanner(System.in);\n         int n=s.nextInt();\n        int[] arr=new int[n];\n        for(int i=0;i<arr.length;i++){\n            arr[i]=s.nextInt();\n        }\n        int mj1=0;\n        int max=0;\n        for(int i=0;i<arr.length;i++){\n            int h=arr[i];\n            int count=1;\n            int l=i-1;\n            int r=i+1;\n            while(l>=0){\n                if(arr[l]>=h){\n                    count++;\n                    l--;\n                }\n                else{\n                    break;\n                }\n            }\n             while(r<arr.length){\n                if(arr[r]>=h){\n                    count++;\n                    r++;\n                }\n                else{\n                    break;\n                }\n            }\n            mj1=h*count;\n            if(mj1>max){\n                max=mj1;\n            }\n//             max=Math.max(mj1,max);\n        }\n        System.out.println(max);\n\t}\n}\n",ACCEPTED,562,25208
1591667964397805568,505c5b9a1b6d591a815315d95a57743fb98dad691b51421b4de282392fef3f43,2022-11-13 13:43:09,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R,SUM;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    if(P+Q>P+R)\n    {\n        SUM=P+R;\n    }\n    else\n        SUM=P+Q;\n    if(Q+R>Q+P)\n    {\n        SUM=Q+R;\n    }\n    else\n        SUM=Q+P;\n    if(R+P>R+Q)\n    {\n        SUM=R+Q;\n    }\n    else\n        SUM=R+P;\n    printf(\""%d\"",%SUM);\n}\n",COMPILE_ERROR,0,0
1591667979233058816,064270dabaa13edbd7238477860db0e46621a5ed4921e8aa2c0f9258e77722cc,2022-11-13 13:43:12,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 100\nint main()\n{\nint sum[N];\nint a,i;\nint count=0;\nscanf(\""%d\"",&a);\n\nfor(i=1;i<a;i++)\n   {\n       scanf(\""%d\"",&sum[i]);\n       if(sum[i]<=sum[i+1]&&sum[i]<sum[i-1])\n        count++;\n   }\n\n\nprintf(\""%d\"",count);\n}\n",WRONG_ANSWER,10,348
1591667997142736896,505c5b9a1b6d591a815315d95a57743fb98dad691b51421b4de282392fef3f43,2022-11-13 13:43:16,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R,SUM;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    if(P+Q>P+R)\n    {\n        SUM=P+R;\n    }\n    else\n        SUM=P+Q;\n    if(Q+R>Q+P)\n    {\n        SUM=Q+R;\n    }\n    else\n        SUM=Q+P;\n    if(R+P>R+Q)\n    {\n        SUM=R+Q;\n    }\n    else\n        SUM=R+P;\n    printf(\""%d\"",&SUM);\n}\n",WRONG_ANSWER,9,508
1591667998250033152,547094c7c62f34b25dac6d7d79e017d817767a29a120ff5083d5fe0c21b62800,2022-11-13 13:43:17,Python,300.0,1591610585635213317,1591130976212869120,1049226928954454016,"x,y,z=map(int,input().split(\"" \""))\nlist1=[]\nlist2=[]\nlist1=input().split(\"" \"")\nlist2=input().split(\"" \"")\nm=0\nn=0\nfor i in range(x):\n    m+=int(list1[i])/(int(list2[i])+1)*pow(y,int(list2[i])+1)\n    n+=int(list1[i])/(int(list2[i])+1)*pow(z,int(list2[i])+1)\nprint(int(m-n))\n",ACCEPTED,83,2904
1591668002125537280,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-13 13:43:18,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,n;\n    char s[10];\n    int sum1,sum2;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&s[i]);\n    }\n   for(i=0;i<n;i++)\n   {\n       if(s[i]=s[i+1])\n           sum1++;\n       else\n           sum2++;\n   }\n    if(sum1>sum2)\n        printf(\""%d\"",sum2*2);\n    else\n        printf(\""%d\"",sum1*2);\n       \n    \n    return 0;\n   \n}",RUNTIME_ERROR,11,220
1591668020815343616,5bd1a8718ea7fb820055421c67b8e0a468e08d951f729a24e55bf407b3bdb1f6,2022-11-13 13:43:22,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <iostream>\n#include <algorithm>\nusing namespace std;\n\n\n\n\n\n\nint main()\n{\n\n    int n,arr[10010];\n    cin>>n;\n    for(int i=0;i<n;i++){\n        cin>>arr[i];\n    }\n    int i=0,j=n-1;\n    int result=0,h=0;\n    while(i<j){\n        result=arr[i]<arr[j]?\n        max(result,(j-i)*arr[i++]):\n        max(result,(j-i)*arr[j--]);\n    }\n    cout<<result;\n    return 0;\n}\n",WRONG_ANSWER,6,332
1591668080038961152,5bd1a8718ea7fb820055421c67b8e0a468e08d951f729a24e55bf407b3bdb1f6,2022-11-13 13:43:36,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <iostream>\n#include <algorithm>\nusing namespace std;\n\n\n\n\n\n\nint main()\n{\n\n    int n,arr[10010];\n    cin>>n;\n    for(int i=0;i<n;i++){\n        cin>>arr[i];\n    }\n    int i=0,j=n-1;\n    int result=0;\n    while(i<j){\n        result=arr[i]<arr[j]?\n        max(result,(j-i)*arr[i++]):\n        max(result,(j-i)*arr[j--]);\n    }\n    cout<<result;\n    return 0;\n}\n",WRONG_ANSWER,10,452
1591668085671911424,0c2907a154c1c61744366e94f73ae426665222ffae8eff7042dd0fd7bd8760fb,2022-11-13 13:43:38,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{int n,a,i,b;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    float c[n],f[n];\n    for(i=1;i<=n;i++)\n        scanf(\""%f\"",&c[i]);\n     for(i=1;i<=n;i++)\n        scanf(\""%f\"",&f[i]);\n\nfloat count,s=0;\n\n    for(i=1;i<=n;i++)\n   {\n       count=(((c[i]/(f[i]+1))*(float)pow(a,(f[i]+1)))-((c[i]/(f[i]+1))*(float)pow(b,(f[i]+1))));\n\n    s=s+count;\n    }\n\n  printf(\""%.1f\"",s);\n\n    return 0;\n}\n",WRONG_ANSWER,4,196
1591668089937473536,09eb01e8f9f24922a6c60a1149d505ad1ebb9b0a39ed1101140fe0fd93daa753,2022-11-13 13:43:39,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"    #include<stdio.h>\n    int main()\n    {\n\n        int n,i,j,counts=0;\n        int arr[100]={0};\n        scanf(\""%d\"",&n);\n        for(i=0;i<n;i++)\n        {\n            scanf(\""%d\"",&arr[i]);\n        }\n        for(i=0;i<n;i++)\n        {\n\n            if(arr[i+1]==arr[i])\n            {\n                n=n-1;\n                for(j=i;j<n;j++)\n                {\n                    arr[j]=arr[j+1];\n                }\n                i--;\n            }\n            if(arr[i]>arr[i+1]&&arr[i+1]<arr[i+2])\n            {\n                counts++;\n            }\n\n        }\n\n        printf(\""%d\"",counts);\n        return 0;\n    }\n\n",RUNTIME_ERROR,31,352
1591668095918563328,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-13 13:43:40,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,n;\n    char s[10];\n    int sum1,sum2;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&s[i]);\n    }\n   for(i=0;i<n;i++)\n   {\n       if(s[i]==s[i+1])\n           sum1++;\n       else\n           sum2++;\n   }\n    if(sum1>sum2)\n        printf(\""%d\"",sum2*2);\n    else\n        printf(\""%d\"",sum1*2);\n       \n    \n    return 0;\n   \n}",WRONG_ANSWER,5,192
1591668151736360960,d830b0bcae7881ad6d1b2e2b14f3ffa3695b6d3bd622856493fa1cf903c9bf4e,2022-11-13 13:43:53,Java,0.0,1591610585635213312,1589816514637750272,1049226928954454016,import java.util.Scanner;\nimport java.util.Stack;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc=new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tString s = sc.next();\n\t\tchar[] ss= s.toCharArray();\n\t\tStack<Integer> stack = new Stack<Integer>();\n\t\tint count = 0;\n\t\tfor(int i =0;i<ss.length;i++){\n\t\t\tif(stack.isEmpty()){\n\t\t\t\tstack.push((int) ss[i]);\n\t\t\t}\n\t\t\tif(!stack.peek().equals((int)ss[i])){\n\t\t\t\tstack.pop();\n\t\t\t\tcount+=2;\n\t\t\t}\n\t\t\telse{\n\t\t\t\tstack.push((int)ss[i]);\n\t\t\t}\n\t\t}\n\t\tSystem.out.print(count);\n\t\n\t}\n\n}\n,WRONG_ANSWER,105,24272
1591668159172894720,505c5b9a1b6d591a815315d95a57743fb98dad691b51421b4de282392fef3f43,2022-11-13 13:43:55,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R,SUM;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    if(P+Q>Q+R)\n    {\n        SUM=Q+R;\n    }\n    else\n        SUM=P+Q;\n    if(P+R>Q+R)\n    {\n        SUM=Q+R;\n    }\n    else\n        SUM=P+R;\n    if(P+R>P+Q)\n    {\n        SUM=P+Q;\n    }\n    else\n        SUM=P+R;\n    printf(\""%d\"",&SUM);\n}\n",WRONG_ANSWER,6,512
1591668160351494144,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-13 13:43:55,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j,k=0,h=0;\n    int a[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        if(i==0||i==(n-1))\n        {\n            a[i]=0;\n        }\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=1;j<n-1;j++)\n    {\n        if(a[j]<a[j-1]&&a[j+1]>a[j])\n        {\n            k++;\n        }\n        if(a[j]==a[j+1]&&a[j]<a[j-1]&&a[j+1]<a[j+2])\n        {\n            h++;\n        }\n    }\n    printf(\""%d\\n\"",k+h);\n}",RUNTIME_ERROR,28,476
1591668171898413056,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-13 13:43:58,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\n\nint main()\n\n{\n\n\tint i,j,t,a[3];\tfor(i=0;i<3;i++)\n\n\t\tscanf(\""%d\"",&a[i]);    \n\n\tfor(i=0;i<2;i++)\n\n\t\tfor(j=i+1;j<3;j++)\n\n\t\t\tif(a[i]>a[j])\n\n\t\t\t{\n\n\t\t\t\tt=a[i];\n\n\t\t\t\ta[i]=a[j];\n\n\t\t\t\ta[j]=t;\n\n\t\t\t}\n\n\t\tprintf(\""%d\\n\"",a[0]+a[1]);\n\n\treturn 0;\n\n}",ACCEPTED,51,476
1591668175270633472,05fd79145678de5c06012db9db4333bebf8365a74fe442d12a54a9da3782fdca,2022-11-13 13:43:59,C++,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main(){\n    int p,q,r;\n    long long int min = -1;\n    cin>>p>>q>>r;\n    min = p+q;\n    if(min > p+r) min = p+r;\n    if(min >q + r) min = q+r;\n    cout << min;\n}",ACCEPTED,41,640
1591668207206064128,1e783de44f6cf9abb158b108e556a36ef99d9241fc592b40cfd6cb7d1265eb34,2022-11-13 13:44:07,Java,300.0,1591610585639407617,1591132482555211776,1049226928954454016,import java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner s=new Scanner(System.in);\n         int n=s.nextInt();\n        int[] arr=new int[n];\n        for(int i=0;i<arr.length;i++){\n            arr[i]=s.nextInt();\n        }\n        int mj1=0;\n        int max=0;\n        for(int i=0;i<arr.length;i++){\n            int h=arr[i];\n            int count=1;\n            int l=i-1;\n            int r=i+1;\n            while(l>=0){\n                if(arr[l]>=h){\n                    count++;\n                    l--;\n                }\n                else{\n                    break;\n                }\n            }\n             while(r<=arr.length-1){\n                if(arr[r]>=h){\n                    count++;\n                    r++;\n                }\n                else{\n                    break;\n                }\n            }\n            mj1=h*count;\n            if(mj1>max){\n                max=mj1;\n            }\n        }\n        System.out.println(max);\n\t}\n}\n,ACCEPTED,560,25180
1591668207419928576,09eb01e8f9f24922a6c60a1149d505ad1ebb9b0a39ed1101140fe0fd93daa753,2022-11-13 13:44:07,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"    #include<stdio.h>\n    int main()\n    {\n\n        int n,i,j,counts=0;\n        int arr[10]={0};\n        scanf(\""%d\"",&n);\n        for(i=0;i<n;i++)\n        {\n            scanf(\""%d\"",&arr[i]);\n        }\n        for(i=0;i<n;i++)\n        {\n\n            if(arr[i+1]==arr[i])\n            {\n                n=n-1;\n                for(j=i;j<n;j++)\n                {\n                    arr[j]=arr[j+1];\n                }\n                i--;\n            }\n            if(arr[i]>arr[i+1]&&arr[i+1]<arr[i+2])\n            {\n                counts++;\n            }\n\n        }\n\n        printf(\""%d\"",counts);\n        return 0;\n    }\n\n",RUNTIME_ERROR,7,348
1591668257697050624,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-13 13:44:19,Java,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"import java.util.Scanner;\nimport java.lang.Math;\npublic class Main {\n    public static void main(String []args) {\n       Scanner scanner = new Scanner(System.in);\n       int arr[]=new int[10];\n        int n,a,b;\n        double sum1=0,sum2=0,sum3;\n        int C[]=new int[150];\n        int F[]=new int[150];\n        n= scanner.nextInt();\n        a= scanner.nextInt();\n        b= scanner.nextInt();\n        for(int i=0;i<n;i++){\n            C[i]=scanner.nextInt();\n        }\n        for(int i=0;i<n;i++){\n            F[i]=scanner.nextInt();\n        }\n        for(int i=0;i<n;i++){\n            sum1=sum1+(C[i]/(F[i]+1))*Math.pow(a,F[i]+1);\n        }\n        for(int i=0;i<n;i++){\n            sum2=sum2+(C[i]/(F[i]+1))*Math.pow(b,F[i]+1);\n        }\n        sum3=sum1-sum2;\n       \n        System.out.println(Math.round(sum3));\n    }\n}",WRONG_ANSWER,103,24376
1591668283517231104,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-13 13:44:25,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int N=10005;\nint a[N];\nint main(){\n\tint n;\n\tint cnt=0;\n    cin>>n;\n    for(int i=1;i<=n;i++)\n    cin>>a[i];\n    for(int i=3;i<n-2;i++){\n    \tif(a[i]<a[i-1]&&a[i]<a[i+1])\n    \tcnt++;\n    \tif(a[i]<a[i-1]&&a[i]==a[i+1]&&a[i+1]<a[i+2])\n    \tcnt++;\n    \tif(a[i]<a[i-1]&&a[i]==a[i+1]&&a[i+1]==a[i+2]&&a[i+2]<a[i+3])\n    \tcnt++;\n    \tif(a[i]<a[i-1]&&a[i]==a[i+1]&&a[i+1]==a[i+2]&&a[i+2]==a[i+3]&&a[i+3]<a[i+4])\n    \tcnt++;\nif(a[i]<a[i-1]&&a[i]==a[i+1]&&a[i+1]==a[i+2]&&a[i+2]==a[i+3]&&a[i+3]==a[i+4]&&a[i+4]<a[i+5])\n    \tcnt++;\nif(a[i]<a[i-1]&&a[i]==a[i+1]&&a[i+1]==a[i+2]&&a[i+2]==a[i+3]&&a[i+3]==a[i+4]&&a[i+4]==a[i+5]&&a[i+5]<a[i+6])\n    \tcnt++;\n    }\n    sort(a+1,a+n+1);\n    if(a[3]==a[n-2])\n    cnt++;\n    cout<<cnt;\n\treturn 0;\n} ",WRONG_ANSWER,37,608
1591668322822053888,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-13 13:44:34,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,n;\n    char s[10];\n    int sum1=0,sum2=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&s[i]);\n    }\n   for(i=0;i<n;i++)\n   {\n       if(s[i]==s[i+1])\n           sum1++;\n       else\n           sum2++;\n   }\n    if(sum1>sum2)\n        printf(\""%d\"",sum2*2);\n    else\n        printf(\""%d\"",sum1*2);\n       \n    \n    return 0;\n   \n}",WRONG_ANSWER,10,316
1591668338609414144,d5db2853d0fce01dd43b2b6adf379841403b78fda0e6cb22c82f6f2b59da60dc,2022-11-13 13:44:38,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\nmain(){\n\tint i,j,n,s=0,s1,s2,max,a[20];\n\tscanf(\""%d\"",&n);\n\tfor(i=1;i<=n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\ti=0;\n\twhile(i<=n){\n\t\ts1=0;\n\t\ts2=0;\n\t\ts1=s1+a[i+3]-5;\n\t\ts2=s2+a[i+1]+a[i+2]-10;\n\t\tif(s1>s2&&i+3<=n){\n\t\t\ts=s-5+a[i+3];\n\t\t\ti=i+3;\n\t\t}\n\t\telse if(i+1>n) break;\n\t\telse{\n\t\t\ts=s-5+a[i+1];\n\t\t\ti=i+1;\n\t\t}\n\t}\n\tprintf(\""%d\"",s);\n\treturn 0;\n}",SEGMENTATION_FAULT,8,512
1591668379889721344,9d0546dac18a9dc678295254e547925db086add5f872ef42d8015d525afeaf65,2022-11-13 13:44:48,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 3\nint main()\n{\n    int num[N],i,j,temp;\n    for(i=0;i<N;i++){\n        scanf(\""%d\"",&num[i]);\n    }\n    for(i=1;i<N;i++){\n        for(j=0;j<N-i;j++){\n            if(num[j]>num[j+1]){\n                temp=num[j];\n                num[j]=num[j+1];\n                num[j+1]=temp;\n            }\n        }\n    }\n    printf(\""%d\"",num[0]+num[1]);\n}",ACCEPTED,33,352
1591668421937618944,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-13 13:44:58,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"n = int(input())\nlist1 = []\na=0\nlist1 = input().split(\"" \"")\nfor i in range(1,n-1):\n    if list1[i-1] > list1[i]:\n        for j in range(n-i):\n            if list1[i] < list1[j]:\n                a+=1\n                break\n    i+=1\nprint(a)\n        \n        \n",WRONG_ANSWER,20,2768
1591668433845248000,a57fdafe4877cd9608fc0ac8a5120a47bc60a015785960e61b67b4e66187c2f2,2022-11-13 13:45:01,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#define N 100\nint main(){\n    int i,n,j=0;\n    int a[N];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=1;i<n;i++){\n        if(a[i]<a[i+1])\n            j++;\n    }\n    printf(\""%d\"",j);\n    return 0;\n}",WRONG_ANSWER,5,324
1591668440451309568,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-13 13:45:02,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main(){\n\tint n,i,j,k=0;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t} \n\tfor(i=1;i<n;i++){\n\t\tif(a[i]<a[i-1]){\n\t\t\tfor(j=i;j<n;j++){\n\t\t\t\tif(a[j]>a[j+1]) \n\t\t\t\t{\n\t\t\t\t\tk++;\n\t\t\t\t\tbreak;\n\t\t\t\t   }   \n\t\t\t}\n\t\t}\n\t}\n\tprintf(\""%d\\n\"",k);\n}",WRONG_ANSWER,17,324
1591668449708138496,40c43472973ea298adbdd1d4b900aeb63cfa4cfe17179f01a4827cd2c6624d3a,2022-11-13 13:45:04,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nmain()\n{\n    int n,a,b;\n    int c[20],f[20];\n    int i,j;\n    int sum0=0,sum1=0,sum2=0,sum3=0,sumz=0;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&c[i]);\n    }\n    for(j=0;j<n;j++)\n    {\n        scanf(\""%d\"",&f[j]);\n    }\n    for(i=0;i<n;i++)\n    {\n        for(j=0;j<n;j++)\n        {\n            if(i!=j)\n                continue;\n            else\n            {\n                sum1=(c[i]/(f[j]+1))*pow(a,f[j]+1);\n           sum0+=sum1;\n           sum3=(c[i]/(f[j]+1))*pow(b,f[j]+1);\n           sum2+=sum3;\n            }\n        }\n    }\n    sumz=sum0-sum2;\n    printf(\""%d\"",sumz);\n}",WRONG_ANSWER,5,196
1591668456997793792,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 13:45:06,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,i,h=0;\n    int b[10];\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=1;i<a-1;i++)\n        {\n            if(b[i]==0)\n               h++;\n        }\n        printf(\""%d\\n\"",h);\n    return 0;\n}\n",RUNTIME_ERROR,5,356
1591668469782044672,d5db2853d0fce01dd43b2b6adf379841403b78fda0e6cb22c82f6f2b59da60dc,2022-11-13 13:45:09,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\nmain(){\n\tint i,j,n,s=0,s1,s2,a[20];\n\tscanf(\""%d\"",&n);\n\tfor(i=1;i<=n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\ti=0;\n\twhile(i<=n){\n\t\ts1=0;\n\t\ts2=0;\n\t\ts1=s1+a[i+3]-5;\n\t\ts2=s2+a[i+1]+a[i+2]-10;\n\t\tif(s1>s2&&i+3<=n){\n\t\t\ts=s-5+a[i+3];\n\t\t\ti=i+3;\n\t\t}\n\t\telse if(i+1>n) break;\n\t\telse{\n\t\t\ts=s-5+a[i+1];\n\t\t\ti=i+1;\n\t\t}\n\t}\n\tprintf(\""%d\"",s);\n\treturn 0;\n}",SEGMENTATION_FAULT,8,332
1591668491785351168,42cfad7191c5e6c0eee156c4369182744d6c5db3bc2a5dc87f9f1be6ee4bbcfe,2022-11-13 13:45:14,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main(){\n   int n,a[n];\n   scanf(\""%d\"",&n);\n   int i,sum=0;\n   for(i=0;i<n;i++)\n   scanf(\""%d \"",&a[i]);\n   for(i=1;i<n;i++){\n   \tif((a[i]>a[i+1])&&(a[i+1]<a[i+2]||(a[i+1]==a[i+3]))){\n   \t\t\t   \tsum=sum+1;\n\t    }\n   }\n   printf(\""%d\"",sum);\n   return 0;\n} ",WRONG_ANSWER,3,328
1591668505991471104,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 13:45:18,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,i,h=0;\n    int b[10];\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=1;i<a-1;i++)\n        {\n            if(b[i]==0)\n               h++;\n        }\n        printf(\""%d\\n\"",h);\n    return 0;\n}\n",RUNTIME_ERROR,6,200
1591668516326268928,e7f8e9ba366feb4551b7dc8e6a149f796e822980a43de4fcc91ded552c4bcbd4,2022-11-13 13:45:20,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main(int argc, char *argv[]) {\n\tint P,Q,R; \n\tscanf(\""%d%d%d\"",&P,&Q,&R);\n    int F,G,H,m; \n\tF=P+Q; \n\tG=Q+R; \n\tH=R+P;\n\tif(F<G<H && F<H<G)\n\t  m=F; \n\t  \n\telse if(G<F<H && G<H<F)\n\t  m=G;\n\t  \n\telse if(H<G<F && H<F<G)\n\t  m=H;\n\t  \n\tprintf(\""%d\\n\"",m);\n\treturn 0;\n\t\n}\n",WRONG_ANSWER,15,200
1591668520264675328,e9a50f3e071443bb6fb229966bff355c178d484f6cc10e5e1fc8dc5a537237ba,2022-11-13 13:45:21,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int b,i,c;\n    c=0;\n      scanf(\""%d\"",&b);\n    int a[b];\n    for(i=0;i<b;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=1;i<b;i++)\n    {\n        if(a[i]<a[i-1]&&a[i]<a[i+1]) c=c+1;\n        if(a[i]<a[i]-1&&a[i]==a[i+1]){\n            for(i;a[i]=a[i+1];i++)\n            {\n            }\n    #include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int b,i,c;\n    c=0;\n      scanf(\""%d\"",&b);\n    int a[b];\n    for(i=0;i<b;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=1;i<b-1;i++)\n    {\n        if(a[i]<a[i-1]&&a[i]<a[i+1]) c=c+1;\n        if(a[i]<a[i-1]&&a[i]==a[i+1]){\n            for(i;a[i]==a[i+1];i++)\n            {\n            }\n           if(a[i]<a[i+1])c=c+1;\n        }\n    }\n\n    printf(\""%d\\n\"",c);\n\n    return 0;\n}\n        //printf(\""%d\"",i);\n            break;\n           // if(a[i]<a[i+1])c=c+1;\n        }\n    }\n\n    printf(\""%d\\n\"",c);\n\n    return 0;\n}\n",WRONG_ANSWER,18,488
1591668520918999040,beefe7893dd2cd421da3fb1ba3ffd90e3dc51d5301380baebfdfa12fbe5234f5,2022-11-13 13:45:21,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"n=int(input())\nh=input().split()\na=0\nb=0\nfor i in range(0,n):\n    if h[0]<h[1]:\n        if h[i-1]<h[i]:\n            a+=1\n            b=a-1\n    else:\n        if h[i-1]<h[i]:\n            b+=1\n    i+=1\nprint(b)\n",WRONG_ANSWER,16,2900
1591668526354849792,d5db2853d0fce01dd43b2b6adf379841403b78fda0e6cb22c82f6f2b59da60dc,2022-11-13 13:45:23,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\nmain(){\n\tint i,n,s=0,s1,s2,a[20];\n\tscanf(\""%d\"",&n);\n\tfor(i=1;i<=n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\ti=0;\n\twhile(i<=n){\n\t\ts1=0;\n\t\ts2=0;\n\t\ts1=s1+a[i+3]-5;\n\t\ts2=s2+a[i+1]+a[i+2]-10;\n\t\tif(s1>s2&&i+3<=n){\n\t\t\ts=s-5+a[i+3];\n\t\t\ti=i+3;\n\t\t}\n\t\telse if(i+1>n) break;\n\t\telse{\n\t\t\ts=s-5+a[i+1];\n\t\t\ti=i+1;\n\t\t}\n\t}\n\tprintf(\""%d\"",s);\n\treturn 0;\n}",SEGMENTATION_FAULT,5,196
1591668535116750848,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-13 13:45:25,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n    int P,Q,R;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    if(P+Q<P+R||P+Q<Q+R)\n    printf(\""%d\"",P+Q);\n    else if(Q+R<P+R||Q+R<P+Q)\n    printf(\""%d\"",Q+R);\n    else\n    printf(\""%d\"",P+R);\n    return 0;\n}\n",WRONG_ANSWER,19,364
1591668550111387648,09eb01e8f9f24922a6c60a1149d505ad1ebb9b0a39ed1101140fe0fd93daa753,2022-11-13 13:45:28,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"    #include<stdio.h>\n    int main()\n    {\n\n        int n,i,j,counts=0;\n        int arr[10]={0};\n        scanf(\""%d\"",&n);\n        for(i=0;i<n;i++)\n        {\n            scanf(\""%d\"",&arr[i]);\n        }\n        for(i=0;i<n;i++)\n        {\n\n            if(arr[i+1]==arr[i])\n            {\n                n=n-1;\n                for(j=i;j<n;j++)\n                {\n                    arr[j]=arr[j+1];\n                }\n                i--;\n            }\n            if(arr[i]>arr[i+1]&&arr[i+1]<arr[i+2])\n            {\n                counts++;\n            }\n\n        }\n\n        printf(\""%d\"",counts);\n        return 0;\n    }\n\n",RUNTIME_ERROR,5,196
1591668554364411904,1f15b5b41f9e61f2d767bcb1ae88bef60c94b97dd423bfd2ba9c8c0e8e9d05bb,2022-11-13 13:45:29,Java,0.0,1591610585635213312,1589816514637750272,1049226928954454016,import java.util.Scanner;\npublic class Main{\n    public static void main(String args[]){\n        Scanner sc=new Scanner(System.in);\n        int n=sc.nextInt();\n        int[] Arry=new int[n];\n        int x=0;\n        int i=0;\n        for(i=0;i<Arry.length;i++){\n             Arry[i]=sc.nextInt();\n        }\n        for(i=0;i<Arry.length;i++){\n        if(Arry[i]!=Arry[i+1]){\n            Arry[i]=Arry[i+2];\n            Arry[i+1]=Arry[i+3];\n            x=x+1;\n        }\n    }\n        System.out.println(x);\n    }\n},WRONG_ANSWER,105,24152
1591668562388082688,630b8bfc88107b488e158fc7108c8faf0a195f9b9030c3faf51edac625714584,2022-11-13 13:45:31,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main(){\nint n,j=0,i,k=0;\nscanf(\""%d\"",&n);\nint h[n];\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&h[i]);\nfor(i=1;i<n-1;i++){\n    if(h[i]>0) {\n            j=i;\n        for(j;j<n-1;j++){\n            if(h[i]>h[j+1]) continue;\n            else {k++;i=j+1;}\n        }\n    }\n}\nprintf(\""%d\"",k);\nreturn 0;\n}\n",WRONG_ANSWER,9,324
1591668566972456960,e9a50f3e071443bb6fb229966bff355c178d484f6cc10e5e1fc8dc5a537237ba,2022-11-13 13:45:32,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int b,i,c;\n    c=0;\n      scanf(\""%d\"",&b);\n    int a[b];\n    for(i=0;i<b;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=1;i<b-1;i++)\n    {\n        if(a[i]<a[i-1]&&a[i]<a[i+1]) c=c+1;\n        if(a[i]<a[i-1]&&a[i]==a[i+1]){\n            for(i;a[i]==a[i+1];i++)\n            {\n            }\n           if(a[i]<a[i+1])c=c+1;\n        }\n    }\n\n    printf(\""%d\\n\"",c);\n\n    return 0;\n}\n",ACCEPTED,41,384
1591668583347052544,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 13:45:36,Python,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"n = (int,input())\nh1,h2...,hn = map(eval,input().split())\nif hi>2:\nprint(3)\nai=5\ns=ai*hi\nprint(s)",NON_ZERO_EXIT_CODE,16,2904
1591668595351117824,0c2907a154c1c61744366e94f73ae426665222ffae8eff7042dd0fd7bd8760fb,2022-11-13 13:45:39,C,300.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{int n,a,i,b;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    float c[n],f[n];\n    for(i=1;i<=n;i++)\n        scanf(\""%f\"",&c[i]);\n     for(i=1;i<=n;i++)\n        scanf(\""%f\"",&f[i]);\n\nfloat count,s=0;\n\n    for(i=1;i<=n;i++)\n   {\n       count=(((c[i]/(f[i]+1))*(float)pow(a,(f[i]+1)))-((c[i]/(f[i]+1))*(float)pow(b,(f[i]+1))));\n\n    s=s+count;\n    }\n\n  printf(\""%.0f\"",s);\n\n    return 0;\n}\n",ACCEPTED,46,512
1591668611109117952,a57fdafe4877cd9608fc0ac8a5120a47bc60a015785960e61b67b4e66187c2f2,2022-11-13 13:45:43,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#define N 100\nint main(){\n    int i,n,j=0;\n    int a[N];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=1;i<n;i++){\n        if(a[i]<a[i+1])\n            j++;\n    }\n    printf(\""%d\\n\"",j);\n    return 0;\n}",WRONG_ANSWER,10,200
1591668647591174144,42cfad7191c5e6c0eee156c4369182744d6c5db3bc2a5dc87f9f1be6ee4bbcfe,2022-11-13 13:45:52,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main(){\n   int n,a[n];\n   scanf(\""%d\"",&n);\n   int i,sum=0;\n   for(i=0;i<n;i++)\n   scanf(\""%d \"",&a[i]);\n   for(i=1;i<n;i++){\n   \tif((a[i]>a[i+1])&&(a[i+1]<a[i+2]||(a[i+1]==a[i+3]))){\n   \t\t\t   \tsum=sum+1;\n\t    }\n   }\n   printf(\""%d\\n\"",sum);\n   return 0;\n} ",WRONG_ANSWER,7,380
1591668663659552768,17759f531671f838bf3fae4270190e93b6109026f9503f986c1ed85bb412007d,2022-11-13 13:45:55,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int i,n,a,b,c[1000],F[1000],sum1=0,sum2=0;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&F[i]);\n    for(i=0;i<n;i++)\n    {\n        sum1=sum1+(c[i]/F[i]+1)*(pow(a,F[i]+1));\n        sum2=sum2+(c[i]/F[i]+1)*(pow(b,F[i]+1));\n    }\n    printf(\""%d\"",(sum1-sum2)/2);\n}",WRONG_ANSWER,30,512
1591668671230271488,0d24b4ee85e6e3a4cc694f7e11105fa2aaf93fd10d4cbe81657f252e2d675435,2022-11-13 13:45:57,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#define N 100\n\nint main()\n{\n    int n,m,s,t=0;\n    int arr[N];\n    int sum=0;\n    scanf(\""%d\"",&n);\n\n    s=n;//中间存s\n    while(n>0){\n        scanf(\""%d\"",&m);\n        arr[t++]=m;\n        n--;\n    }\n    //输入四个数就结束了\n    int i,j,k;\n    for(j=0;j<s;){\n      for(i=0;i<s;i++){\n\n        if(arr[i]==arr[i+1]){\n            sum+=2;\n         }\n      }\n    j=s-sum;\n    }\n\n    printf(\""%d\"",sum);\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,400,196
1591668677735669760,9d0546dac18a9dc678295254e547925db086add5f872ef42d8015d525afeaf65,2022-11-13 13:45:59,Java,0.0,1591610585635213314,1591128862958940160,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 10000\nint main()\n{\n    int num[N],i,j,n,k,temp;\n    scanf(\""%d\"",&k);\n    n=k-1;\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&num[i]);\n    }\n    printf(\""%d \"",k);\n    for(i=1;i<n;i++){\n        for(j=0;j<n-i;j++){\n            if(num[j]<num[j+1]){\n                temp=num[j];\n                num[j]=num[j+1];\n                num[j+1]=temp;\n            }\n        }\n    }\n    for(i=0;i<n-1;i++){\n        printf(\""%d \"",num[i]);\n    }\n    for(i=n-1;i<n;i++){\n        printf(\""%d\"",num[i]);\n    }\n}\n",COMPILE_ERROR,0,0
1591668683897102336,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-13 13:46:00,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"n = int(input())\nlist1 = []\na=0\nlist1 = input().split(\"" \"")\nfor i in range(1,n-1):\n    if list1[i-1] > list1[i]:\n        for j in range(i,n-1):\n            if list1[i] < list1[j]:\n                a+=1\n                break\n    i+=1\nprint(a)\n        \n        \n\n",WRONG_ANSWER,16,2756
1591668697755049984,977c9d350f87cd8386fa1f88cca886d6ff43821830806e60da6d6b36dc77cd13,2022-11-13 13:46:03,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,b,c;\n    int m,n,v;\n    scanf(\""%d%d%d\"",&a,&b,&c);\n    m=a+b;\n    n=a+c;\n    v=b+c;\n    if(m<n)\n    {\n        n=v;\n        if(m<v)\n            printf(\""%d\"",m);\n        else\n            printf(\""%d\"",v);\n    }\n    else\n    {\n        m=n;\n        if(m<v)\n            printf(\""%d\"",m);\n        else\n            printf(\""%d\"",v);\n    }\n}",ACCEPTED,32,352
1591668709633306624,d5db2853d0fce01dd43b2b6adf379841403b78fda0e6cb22c82f6f2b59da60dc,2022-11-13 13:46:06,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\nmain(){\n\tint i,n,s=0,s1,s2,a[20];\n\tscanf(\""%d\"",&n);\n\tfor(i=1;i<=n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\ti=0;\n\twhile(i<=n){\n\t\ts1=0;\n\t\ts2=0;\n\t\ts1=s1+a[i+3]-5;\n\t\ts2=s2+a[i+1]+a[i+2]-10;\n\t\tif(s1>s2&&i+3<=n){\n\t\t\ts=s-5+a[i+3];\n\t\t\ti=i+3;\n\t\t}\n\t\telse if(i+1>n) break;\n\t\telse{\n\t\t\ts=s-5+a[i+1];\n\t\t\ti=i+1;\n\t\t}\n\t}\n\tprintf(\""%d\"",s);\n\treturn 0;\n}",SEGMENTATION_FAULT,8,392
1591668760027914240,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 13:46:18,Python,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"n=(int,input())\nh1,h2...,hn=map(int,input().split())\nif hi>2:\nprint(3)\nai=5\ns=ai*hi\nprint(s)",NON_ZERO_EXIT_CODE,17,2880
1591668763412684800,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 13:46:19,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,i,h=0;\n    int b[10];\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=1;i<a-1;i++)\n        {\n            if(b[i]==0)\n               h++;\n        }\n        printf(\""%d\\n\"",h);\n    return 0;\n}\n",RUNTIME_ERROR,6,512
1591668795100651520,0ccbaaa612b3d01dbe621ce5e7366d6e26d2e5adf55047d92c6eb7adf78a979d,2022-11-13 13:46:27,C++,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int n,c=0,d=0,x=0,y=0;cin>>n;\n    string s;cin>>s;\n    for(int i=0;i<s.size();i++)\n    {\n        if(s[i]=='1') x++,c++;\n        else if(s[i]=='0') y++,d++;\n    }\n    if(x==n||y==n){cout<<0;return 0;}\n    if(c>d) cout<<2*c;\n    else if(c<d) cout<<2*d;\n    else cout<<n;\n    return 0;\n}\n",WRONG_ANSWER,6,452
1591668816235749376,0b693affc66d8d407ff008bd1aaf4f2feb4a615f057943ba4b4ba3163d937dc6,2022-11-13 13:46:32,Java,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"import java.io.*;\nimport java.util.*;\n\npublic class Main {\n\n    public static void main(String[] args) throws IOException {\n        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n        Scanner sc=new Scanner(System.in);\n        String s=br.readLine();\n        String[] str=br.readLine().split(\"" \"");\n        int n=Integer.parseInt(s);\n        int res=0;\n        int temp=0;\n        for (int i = 0; i < n; i++) {\n            int flag=Integer.parseInt(str[i]);\n            temp=flag;\n            for (int j = i+1; j < n; j++) {\n                if (Integer.parseInt(str[j])>=flag){\n                    temp+=flag;\n                }else\n                    break;\n            }\n            for (int j = i-1; j >0 ; j--) {\n                if (Integer.parseInt(str[j])>=flag)\n                    temp+=flag;\n                else break;\n            }\n            res=Math.max(res,temp);\n        }\n        System.out.println(res);\n    }\n}",WRONG_ANSWER,305,24544
1591668832539009024,20ffd83467b553ac24e1f4b8b096d58858684ca8c3f6a4d5a62be9ff7c4817da,2022-11-13 13:46:36,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#define MAX 10000\nint main()\n{\n    int n;\n    signed int a,b;\n    int i;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    int c[MAX],F[MAX];\n    double  B[MAX],h=0;\n    for(i=1;i<=n;i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=1;i<=n;i++)\n        scanf(\""%d\"",&F[i]);\n    for(i=1;i<=n;i++)\n        B[i]=c[i]/(F[i]+1)*pow(a,F[i]+1)-c[i]/(F[i]+1)*pow(b,F[i]+1);\n    for(i=1;i<=n;i++){\n        printf(\""%f\\n\"",B[i]);\n        h+=B[i];\n        }\n    printf(\""%d\\n\"",(int)h);\n}\n\n",WRONG_ANSWER,5,328
1591668861999800320,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-13 13:46:43,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"n = int(input())\nlist1 = []\na=0\nlist1 = input().split(\"" \"")\nfor i in range(1,n-1):\n    if list1[i-1] > list1[i]:\n        for j in range(i,n-1):\n            if list1[i] < list1[j]:\n                a+=1\n                break\n    i+=1\nprint(a)\n        \n        \n\n",WRONG_ANSWER,20,2784
1591668917675024384,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 13:46:56,Python,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"n=(int,input())\nh1,h2,...,hn:=map(int,input().split())\nif hi>2:\nprint(3)\nai=5\ns=ai*hi\nprint(s)",NON_ZERO_EXIT_CODE,16,2892
1591668926373978112,3e087b0a196d30fcbb49ca80164c9eb5adf82ae3bb08ec0c141e5728fb180f0d,2022-11-13 13:46:58,Java,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\t\n\tstatic final int MAX=10000;\n\tstatic int solve(int[] arr,int num){\n\t\tint ma=-1,j=0,res=0;\n\t\tint[] record=new int[MAX];\n\t\tfor(int i=0;i<num;i++){\n\t\t\tma=ma<arr[i]?arr[i]:ma;\n\t\t}\n\t\tfor(int i=0;i<num;i++){\n\t\t\tif(arr[i]==ma){\n\t\t\t\trecord[j]=i;\n\t\t\t\tj++;\n\t\t\t}\n\t\t}\n\t\tfor(int i=0;i<j-1;i++){\n\t\t\tif(record[i]+1!=record[i+1]){\n\t\t\t\tres++;\n\t\t\t}\n\t\t}\n\t\tif((arr[1]>0)&&(arr[1]<ma)){\n\t\t\tres++;\n\t\t}\n\t\tif((arr[num-2]>0)&&(arr[num-2]<ma)){\n\t\t\tres++;\n\t\t}\n\t\treturn res;\n\t}\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner sc=new Scanner(System.in);\n\t\tint num=sc.nextInt();\n\t\tint[] arr=new int[MAX];\n\t\tfor(int i=0;i<num;i++){\n\t\t\tarr[i]=sc.nextInt();\n\t\t}\n\t\tSystem.out.print(solve(arr, num));\n\t\tsc.close();\n\t}\n\n}",WRONG_ANSWER,105,24640
1591668933533642752,70c675ddfcb60b2192bc8ac38fb068fec0500208a5bf97a796c7cc074b43cf87,2022-11-13 13:47:00,Java,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"import java.util.Scanner;\n\n    public class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner myScanner = new Scanner(System.in);\n\t\tint n = myScanner.nextInt();\n\t\tint[] arr = new int[n];\n\t\tint count = 0;\n\t\tfor(int i = 0; i < n;i++){\n\t\t\tarr[i] = myScanner.nextInt();\n\t\t}\n\t\tfor(int j = 1;j <= n-2;j++){\n\t\t\tif(arr[j] > arr[j+1] && arr[n-2] != 0){\n\t\t\t\tcount++;\n\t\t\t\tif(j == n-2){\n\t\t\t\t\tcount -= 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.printf(\""%d\"",count);\n\t}\n\n}",WRONG_ANSWER,106,24828
1591668940236185600,6b312558d54f4eeffd1aa510a96dd5882584f6bf7857d244f71013b7ec561920,2022-11-13 13:47:01,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,10\n0 1 0 2 1 2 0 0 2 0\n,COMPILE_ERROR,0,0
1591668940554907648,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 13:47:01,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <string.h>\nint main()\n{\n    int k,len,i,g=0,l;\n    char str[1000] = {0};\n    scanf(\""%d\"",&k);\n    scanf(\""%s\"",str);\n    len  = strlen(str);\n    for(i=0;i<len;i++)\n    {\n        if(str[i]=='0')\n        g++;\n        else\n        l++;\n    }\n    g-=8;//0的个数;\n    l-=52;//1的个数;\n    if(g>l)\n    printf(\""%d\\n\"",2*l);\n    else\n    printf(\""%d\\n\"",2*g);\n    return 0;\n}\n\n",WRONG_ANSWER,4,352
1591668951955038208,887d1bbe53a4d4a349813887f13126da5e46a853687f4c2c9d7b8ef3d748a9d6,2022-11-13 13:47:04,C,300.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nmain()\n{\n    int ai=1,hi[1000],s=0,i,n,min=0,h=0,j=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    scanf(\""%d\"",&hi[i]);\n    for(i=0;i<n;i++)\n    {\n    \th=hi[i];\n    \tfor(j=i;j<n-1;j++)\n    \t{\n    \tif(hi[j+1]>=h)\n    \t\tai++;\n    \telse\n    \tbreak;\n    \t}\n    \tfor(j=i;j>0;j--)\n    \t{\n    \tif(hi[j-1]>=h)\n    \tai++;\n    \telse\n    \tbreak;\n\t\t}\n\t\tif(h*ai>s)\n\t\ts=h*ai;\n\t\tai=1;\n\t}\n\tprintf(\""%d\"",s);\n}",ACCEPTED,36,492
1591668957629964288,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 13:47:05,Python,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"n=(int,input())\nh1,h2,...,hn==map(int,input().split())\nif hi>2:\nprint(3)\nai=5\ns=ai*hi\nprint(s)",NON_ZERO_EXIT_CODE,22,3024
1591668958519156736,9d0546dac18a9dc678295254e547925db086add5f872ef42d8015d525afeaf65,2022-11-13 13:47:06,C,0.0,1591610585635213314,1591128862958940160,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 6\nint main()\n{\n    int num[N],i,j,n,k,temp;\n    scanf(\""%d\"",&k);\n    n=k-1;\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&num[i]);\n    }\n    printf(\""%d \"",k);\n    for(i=1;i<n;i++){\n        for(j=0;j<n-i;j++){\n            if(num[j]<num[j+1]){\n                temp=num[j];\n                num[j]=num[j+1];\n                num[j+1]=temp;\n            }\n        }\n    }\n    for(i=0;i<n-1;i++){\n        printf(\""%d \"",num[i]);\n    }\n    for(i=n-1;i<n;i++){\n        printf(\""%d\"",num[i]);\n    }\n}",SEGMENTATION_FAULT,8,196
1591668964613435392,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-11-13 13:47:07,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,j;\n    int count=0;\n    int a[3]={0},b[6]={0};\n    int minsum=3001;\n    for(i=0;i<3;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<3;i++)\n    {\n        for(j=0;j<2;j++)\n        {\n            if(i=2)\n            {\n                if(minsum>(a[i]+a[i-1]))\n                    minsum=a[i]+a[i-1];\n            }\n            else\n                if(minsum>(a[i]+a[i+1]))\n                    minsum=a[i]+a[i+1];\n        }\n    }\n    printf(\""%d\\n\"",minsum);\n    return 0;\n}",WRONG_ANSWER,8,332
1591668967159422976,5ed1ed5f3786d45db71190023ef590496fd0d8d8cfe4af0f2c94d1d387178674,2022-11-13 13:47:08,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int p,q,r,m1,m2,m3;\n    scanf(\""%d %d %d\"",&p,&q,&r);\n    m1=p+q;\n    m2=q+r;\n    m3=r+p;\n    if(m1<=m2&&m1<=m3)\n    printf(\""%d\"",m1);\n    else if(m2<=m1&&m2<=m3)\n        printf(\""%d\"",m2);\n    else if(m3<=m1&&m3<=m2)\n        printf(\""%d\"",m3);\n    return 0;\n}\n",ACCEPTED,37,352
1591668990760771584,9a1ecd1db02b268060006afd7de34ec54e74e90bf61becbb6811fb23971c4720,2022-11-13 13:47:13,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,def iss(x):\n    if x==2:\n        if s[0]!=s[1]:\n            s.clear()\n        return s\n    elif x==1:\n         return s\n    elif x==3:\n        if s[0]!=s[1] or s[1]!=s[2]:\n            s.pop(0)\n            s.pop(0)\n        return s\n    for i in range(x-2):\n        if s[i]!=s[i+1]:\n            s.pop(i)\n            s.pop(i)\n            l=len(s)\n            return iss(l)\nn=int(input())\ns=list(input())\nl=n\ny=iss(l)\nz=len(y)\nprint(n-z)\n\n,NON_ZERO_EXIT_CODE,15,2760
1591668997597442048,6b312558d54f4eeffd1aa510a96dd5882584f6bf7857d244f71013b7ec561920,2022-11-13 13:47:15,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,count=0;\n    scanf(\""%d\"",&n);\n    int h[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&h[i]);\n    for(i=0;i<n;i++)\n    {\n        if(h[i]>h[i+1])\n            count++;\n    }\n    printf(\""%d\"",count-1);\n    return 0;\n}",WRONG_ANSWER,6,480
1591669041763508224,0d24b4ee85e6e3a4cc694f7e11105fa2aaf93fd10d4cbe81657f252e2d675435,2022-11-13 13:47:25,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#define N 100\n\nint main()\n{\n    int n,m,s,t=0;\n    int arr[N];\n    int sum=0;\n    scanf(\""%d\"",&n);\n\n    s=n;//中间存s\n    while(n>0){\n        scanf(\""%d\"",&m);\n        arr[t++]=m;\n        n--;\n    }\n    //输入四个数就结束了\n    int i,j;\n    for(j=0;j<s;){\n      for(i=0;i<s;i++){\n\n        if(arr[i]==arr[i+1]){\n            sum+=2;\n         }\n      }\n    j=s-sum;\n    }\n\n    printf(\""%d\"",sum);\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,400,512
1591669045513170944,0ccbaaa612b3d01dbe621ce5e7366d6e26d2e5adf55047d92c6eb7adf78a979d,2022-11-13 13:47:26,C++,300.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int n,c=0,d=0,x=0,y=0;cin>>n;\n    string s;cin>>s;\n    for(int i=0;i<s.size();i++)\n    {\n        if(s[i]=='1') x++,c++;\n        else if(s[i]=='0') y++,d++;\n    }\n    if(x==n||y==n){cout<<0;return 0;}\n    if(c>d) cout<<2*d;\n    else if(c<d) cout<<2*c;\n    else cout<<n;\n    return 0;\n}\n",ACCEPTED,40,624
1591669079193477120,86f702b052a21d7cb2f8cd933c678c21efaafaf5b2d35032f18ec35c1e26a945,2022-11-13 13:47:34,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,m=0,i;\n    int h[1000];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&h[i]);\n    for(i=1;i<n-1;i++)\n    {\n        if(h[i]<h[i-1]) \n        {if(h[i]<h[i+1]) m++;\n         else if(h[i+1]<h[i+2]) m++;\n        }\n     }\n    printf(\""%d\"",m);\n    return 0;\n}",WRONG_ANSWER,11,448
1591669089922506752,25b8e249c556de062ec0d61286db67304f907bc70204e22083d75434403578b1,2022-11-13 13:47:37,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    int a[n];\n    int i,flag=0;\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=1;i<n;i++)\n    {\n        if(a[i]<a[i-1]&&a[i]<a[i+1])\n            flag++;\n    }\n    printf(\""%d\"",flag);\n    return 0;\n}\n",WRONG_ANSWER,10,220
1591669115134468096,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-13 13:47:43,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main(){\n    int n,a[1000],count=0,i,j,t=0;\n      scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n        \n        if(a[0]==0&&a[n-1]==0){\n    \n    for( j=1;j<n-1;j++)\n    {\n        \n        if(a[j]<a[j-1]&&a[j]<a[j+1])\n        { count++;    count+=t;t=0;}\n             \n        else \n        if(a[j]==a[j+1])\n        {t=1;\n            continue;\n        }\n        \n        if(a[j]==0&&a[j+1]!=0) {count+=t;t=0;}\n        if(j==n-2&&count!=0) count+=t;\n        \n       \n        \n          \n    }\n    \n    \n   if(count!=0)\n      printf(\""%d\"",count);\n   else \n     printf(\""0\"");\n            }\n}",WRONG_ANSWER,7,348
1591669130670125056,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 13:47:47,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <string.h>\nint main()\n{\n    int k,len,i,g=0,l;\n    char str[1000] = {0};\n    scanf(\""%d\"",&k);\n    scanf(\""%s\"",str);\n    len  = strlen(str);\n    for(i=0;i<len;i++)\n    {\n        if(str[i]=='0')\n        g++;\n        else\n        l++;\n    }\n    //g-=8;//0的个数;\n    //l-=52;//1的个数;\n    if(g>l)\n    printf(\""%d\\n\"",2*l);\n    else\n    printf(\""%d\\n\"",2*g);\n    return 0;\n}\n\n",SEGMENTATION_FAULT,42,640
1591669138194718720,1f15b5b41f9e61f2d767bcb1ae88bef60c94b97dd423bfd2ba9c8c0e8e9d05bb,2022-11-13 13:47:48,Java,0.0,1591610585635213315,1591129345182261248,1049226928954454016,import java.util.Scanner;\npublic class Main{\n    public static void main(String args[]){\n        Scanner sc=new Scanner(System.in);\n        int n=sc.nextInt();\n        int[] Arry=new int[n];\n        int x=0;\n        int y=x+3;\n        int z=x+1;\n        for(int i=0;i<Arry.length;i++){\n            Arry[i]=sc.nextInt();\n        }\n       \n        \n    }\n},WRONG_ANSWER,292,41904
1591669165843558400,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-13 13:47:55,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main(){\n    int i,j,n,h[9999],max=0,count=0,chengji=15;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&h[i]);\n    }\n    for(i=0;i<n-1;i++){\n        for(j=i+1;j<n;j++){\n            if(h[j]==h[j-1]){\n                count++;\n                chengji=h[j]*(count);\n            }else{\n                count=0;\n            }\n            if(chengji>max){\n                max=chengji;\n            }\n        }\n        if(chengji>max){\n            max=chengji;\n        }\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",WRONG_ANSWER,7,328
1591669195736363008,1f15b5b41f9e61f2d767bcb1ae88bef60c94b97dd423bfd2ba9c8c0e8e9d05bb,2022-11-13 13:48:02,Java,0.0,1591610585639407617,1591132482555211776,1049226928954454016,import java.util.Scanner;\npublic class Main{\n    public static void main(String[] args){\n        int n=sc.nextInt();\n        int[] Arry=new int[n];\n        int temp=0;\n        for(int i=0;i<Arry.length;i++){\n            Arry[i]=sc.nextInt();\n        }\n        for(int i=0;i<Arry.length;i++){\n        if(Arry[i]<=Arry[i+1];i++){\n                Arry[i]=temp;\n                Arry[i+1]=Arry[i];\n                Arry[i+1]=temp;\n            }\n        }\n        \n        System.out.println();\n    }\n},COMPILE_ERROR,0,0
1591669197477011456,28b4de6882b7ade2679f59c486acaf307ce8415dcb0a15787dba589025bbdb02,2022-11-13 13:48:03,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint num[n];\n\tint i,j;\n\tint max=-1,index,count,sum;\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&num[i]);\n\t}\n\tfor(i=0;i<n;i++)\n\t{\n\t\tcount=0;\n\t\tsum=0;\n\t\tfor(j=0;j<n;j++)\n\t\t{\n\t\t\tif(num[j]<=num[i])\n\t\t\t{\t\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tif(num[j]>num[i])\n\t\t\t{\n\t\t\t\tsum=num[i]*count;\n\t\t\t\tcount=0;\n\t\t\t}\t\n\t\t}\n\t\tif(sum>max)\n\t\t{\n\t\t\tmax=sum;\n\t\t}\n\t\t\n\t}\n\tprintf(\""%d\"",max);\n\treturn 0;\n}",WRONG_ANSWER,6,200
1591669201130250240,19b1d22e5c87afa9233c236fc7b4d5e0e70acf3872968cbe9aae96e75e9e38d1,2022-11-13 13:48:03,C++,300.0,1591610585635213316,1591130116607045632,1049226928954454016,#include <iostream>\nusing namespace std;\n\nint main()\n{\n    cout<<60<<endl;\n    return 0;\n},ACCEPTED,6,592
1591669242720956416,5bd1a8718ea7fb820055421c67b8e0a468e08d951f729a24e55bf407b3bdb1f6,2022-11-13 13:48:13,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <iostream>\n#include <algorithm>\nusing namespace std;\n\n\n\n\n\n\nint main()\n{\n\n    int n,arr[10010];\n    cin>>n;\n    for(int i=0;i<n;i++){\n        cin>>arr[i];\n    }\n    int i=0,j=n-1;\n    int result=0;\n    while(i<j){\n        result=arr[i]<=arr[j]?\n        max(result,(j-i)*arr[i++]):\n        max(result,(j-i)*arr[j--]);\n    }\n    cout<<result;\n    return 0;\n}\n",WRONG_ANSWER,6,328
1591669249561878528,e51465ce72346fac918042a342986433269a159492161f223a180a6e05d9a01a,2022-11-13 13:48:15,Java,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\t\npublic static void main(String[] args) {\n\t    Scanner sc =new Scanner(System.in);\n\t    int num  =sc.nextInt();\n\t    int index=0;\n\t    int max = 0;\n\t    int result=0;\n\t    int s=0;\n\t    int [] arr=new int [num];\n\t    for(int i=0;i<num;i++){\n\t    \tarr[i]=sc.nextInt();\n\t    \t if(arr[i]>max){\n\t    \t\t max=arr[i];\n\t    \t }\t    \t  \n\t    }\n\t    System.out.println(\""最大值为：\""+max);\n\t    for(int i=0;i<=max;i++){\n\t    \t    index=0;\n\t    \tfor(int j=0;j<arr.length;j++){\n\t    \t\tif(arr[j]>=i){\n\t    \t\t\tindex++;\n\t    \t\t}\n\t    \t\t\n\t    \t}\n\t    \ts=index*i;\n    \t\tSystem.out.println(\""第\""+i+\""次的面积为\""+s);\n\t    \tif(s>result){\n\t    \t\tresult=s;\n\t    \t}\n\t    }\n\t    System.out.println(result);\n\t    \n}\n}",WRONG_ANSWER,164,27940
1591669286014562304,630b8bfc88107b488e158fc7108c8faf0a195f9b9030c3faf51edac625714584,2022-11-13 13:48:24,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main(){\nint n,j=0,i,k=0;\nscanf(\""%d\"",&n);\nint h[n];\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&h[i]);\nfor(i=1;i<n-1;i++){\n    if(h[i]>0) {\n            j=i;\n        for(j;j<n-1;j++){\n            if(h[i]>h[j+1]) continue;\n            else if(h[i]<h[i-1]){k++;i=j+1;}\n        }\n    }\n}\nprintf(\""%d\"",k);\nreturn 0;\n}\n",WRONG_ANSWER,15,356
1591669293568548864,d5db2853d0fce01dd43b2b6adf379841403b78fda0e6cb22c82f6f2b59da60dc,2022-11-13 13:48:26,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\nmain(){\n\tint i,j,n,s=0,s1,s2,a[20];\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\ti=-1;\n\twhile(i<n){\n\t\ts1=0;\n\t\ts2=0;\n\t\ts1=s1+a[i+3]-5;\n\t\ts2=s2+a[i+1]+a[i+2]-10;\n\t\tif(s1>s2&&i+3<n){\n\t\t\ts=s-5+a[i+3];\n\t\t\ti=i+3;\n\t\t}\n\t\telse if(i+1>n-1) break;\n\t\telse{\n\t\t\ts=s-5+a[i+1];\n\t\t\ti=i+1;\n\t\t}\n\t}\n\tprintf(\""%d\"",s);\n\treturn 0;\n}",SEGMENTATION_FAULT,5,352
1591669297410498560,542d97133043a1f2156354473a31382c35bb2836688b0ed76eae59c52a2e0e3a,2022-11-13 13:48:26,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main()\n{\n    int p,q,r;\n    int m,n,o;\n    scanf(\""%d %d %d\"",&p,&q,&r);\n    m=p+q;\n    n=p+r;\n    o=q+r;\n    if(m<n)\n    {\n        if(m<o)\n            printf(\""%d\"",m);\n        else\n            printf(\""%d\"",o);\n    }\n    else\n    {\n        m=n;\n        if(m<o)\n            printf(\""%d\"",m);\n        else\n            printf(\""%d\"",o);\n    }\n}",ACCEPTED,50,476
1591669315869618176,c39a4349139942a7aa7456b2c4609f8d0f9d0d3465be213d33870ec87eab1e58,2022-11-13 13:48:31,C++,0.0,1591610585635213314,1591128862958940160,1049226928954454016,"#include <stdio.h>\n\nint main(void) \n{\n\tint n,a[100],i,j,c;\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n-1;i++)\n\t{\n\t\tscanf(\""%d\"",&a[i]); \n\t}\n for(i=0;i<n-1;i++)\n     for(j=1;j<n-1-i;j++)\n {\n     if(a[i]<a[j])\n     {\n       c=a[j];\n         a[j]=a[i];\n         a[i]=c;  \n     }\n         else\n             continue;\n }\n    \n    printf(\""%d \"",n);\n    for(i=0;i<n-1;i++)\n        printf(\""%d \"",a[i]);\n    return 0;\n}",SEGMENTATION_FAULT,17,220
1591669318382006272,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 13:48:31,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[n],i,b=0;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n-1;i++)\n    {\n        if(a[i]>a[i+1]&&a[i+2]>=a[i+1])\n            b=b+1;\n    }\n    printf(\""%d\"",b);\n    return 0;\n}",WRONG_ANSWER,8,200
1591669417636016128,2e4af98c441106efa9ee51f8a781d0eee91a3dff6193987d421eb3a48725c814,2022-11-13 13:48:55,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <iostream>\n\nint fun(int a,int b,int c,int *arr){\n\tif(a>b){\n\t\tif(b>c){\n\t\t\tarr[0]=c;\n\t\t\tarr[1]=b;\n\t\t}else {\n\t\t\tarr[0]=b;\n\t\t\tarr[1]=c;\n\t\t}\n\t}else{\n\t\t\tif(a>c){\n\t\t\tarr[0]=c;\n\t\t\tarr[1]=a;\n\t\t}else {\n\t\t\tarr[0]=a;\n\t\t\tarr[1]=c;\n\t\t}\n\t}\n\treturn 0;\n}\nint main(){\n//\tint n;\n//\tscanf(\""%d\"",&n);\n\tint p,q,r;\n\tscanf(\""%d %d %d\"",&p,&q,&r);\n\tint arr[2];\n\tfun(p,q,r,arr);\n\tprintf(\""%d\"",arr[0]+arr[1]);\n}",WRONG_ANSWER,11,456
1591669447121973248,63a19c717d077fecd1be96314929ebf3516f35619209eacac77081bb07edebb5,2022-11-13 13:49:02,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include<math.h>\n#include<string.h>\nint main()\n{\n   int i,j=0,n,a[100],sum=0;\n   scanf(\""%d\"",&n);\n   for(i=1;i<=n;i++)\n     scanf(\""%d\"",&a[i]);\n   while(j<n){\n     if(a[j+3]>a[j+1]&&j+3<=10&&j+1<=10){\n          sum+=a[j+3]-5;\n          j=j+3;\n        }\n     else{\n         sum+=a[j+1]-5;\n         j=j+1;\n     }\n     }\n     printf(\""%d\"",sum);\n}\n",SEGMENTATION_FAULT,6,196
1591669450091552768,6b312558d54f4eeffd1aa510a96dd5882584f6bf7857d244f71013b7ec561920,2022-11-13 13:49:03,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,count=0;\n    scanf(\""%d\"",&n);\n    int h[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&h[i]);\n    for(i=0;i<n-2;i++)\n    {\n        if(h[i]>h[i+1])\n            count++;\n    }\n    printf(\""%d\"",count);\n    return 0;\n}\n",WRONG_ANSWER,10,320
1591669461026103296,902d8082eea06043d392298983db4630cde4418ac8ee42282d537bfaae045c2f,2022-11-13 13:49:05,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"b=eval(input())\na=input().split(\"" \"")\na=list(a)\nj=0\nfor i in range(1,b-1):\n    if a[i]==a[i-1]:\n        a.pop(i)\nfor q in range(0,len(a)-1):\n    if a[q-1]>a[q]<a[q+1]:\n        j=j+1\nprint(j)",NON_ZERO_EXIT_CODE,83,3036
1591669475899105280,001baa7272d47ab2d3a9b57bf7838570ff03ab1cabb738e7b342b652b1e42a83,2022-11-13 13:49:09,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <iostream>\n#include <bits/stdc++.h>\nusing namespace std;\n\n//  ceil()    floor()\n\n//long long amax=-9999999;\n\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(int i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    int sum=0;\n    int h=0;\n\n    if(a[1]>=a[0]){\n        h=a[1];\n    int flag=0;\n    for(int i=2;i<n;i++){\n        if(a[i]<h && i!=(n-1)){\n            if(flag==0){\n                sum++;\n                flag=1;\n            }\n            //printf(\""====%d\\n\"",i);\n            h=a[i];\n        }else if(a[i]==h){\n            continue;\n        }else{\n            h=a[i];\n            flag=0;\n        }\n    }\n    }else{\n        h=a[0];\n        for(int i=1;i<n;i++){\n        if(a[i]<h && i!=(n-1)){\n            sum++;\n            h=a[i];\n        }else if(a[i]==h){\n            continue;\n        }else{\n            h=a[i];\n        }\n    }\n    }\n\n    printf(\""%d\\n\"",sum);\n\n\n    return 0;\n}\n",WRONG_ANSWER,7,604
1591669483809562624,e51465ce72346fac918042a342986433269a159492161f223a180a6e05d9a01a,2022-11-13 13:49:11,Java,0.0,1591610585639407617,1591132482555211776,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n\t\npublic static void main(String[] args) {\n\t    Scanner sc =new Scanner(System.in);\n\t    int num  =sc.nextInt();\n\t    int index=0;\n\t    int max = 0;\n\t    int result=0;\n\t    int s=0;\n\t    int [] arr=new int [num];\n\t    for(int i=0;i<num;i++){\n\t    \tarr[i]=sc.nextInt();\n\t    \t if(arr[i]>max){\n\t    \t\t max=arr[i];\n\t    \t }\t    \t  \n\t    }\n\t    \n\t    for(int i=0;i<=max;i++){\n\t    \t    index=0;\n\t    \tfor(int j=0;j<arr.length;j++){\n\t    \t\tif(arr[j]>=i){\n\t    \t\t\tindex++;\n\t    \t\t}\n\t    \t\t\n\t    \t}\n\t    \ts=index*i;\n    \t\t\n\t    \tif(s>result){\n\t    \t\tresult=s;\n\t    \t}\n\t    }\n\t    System.out.println(result);\n\t    \n}\n},WRONG_ANSWER,109,24548
1591669496165982208,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-13 13:49:14,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main(){\n    int n,a[1000],count=0,i,j,t=0;\n      scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n        \n        if(a[0]==0&&a[n-1]==0){\n    \n    for( j=1;j<n-1;j++)\n    {\n        \n        if(a[j]<a[j-1]&&a[j]<a[j+1])\n        { count++;    count+=t;t=0;}\n             \n        else \n        if(a[j]==a[j+1])\n        {t=1;\n            continue;\n        }\n        \n        if(a[j]==0&&a[j+1]!=0) {count+=t;t=0;}\n      \n        \n       \n        \n          \n    }\n    \n    \n   if(count!=0)\n      printf(\""%d\"",count);\n   else \n     printf(\""0\"");\n            }\n}",WRONG_ANSWER,35,500
1591669518626467840,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-13 13:49:19,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j,k=0,h=0;\n    int a[100];\n    scanf(\""%d\"",&n);\n    for(i=1;i<n-1;i++)\n    {\n        a[0]=0;\n        a[n-1]=0;\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=1;j<n-1;j++)\n    {\n        if(a[j]<a[j-1]&&a[j+1]>a[j])\n        {\n            k++;\n        }\n        if(a[j]==a[j+1]&&a[j]<a[j-1]&&a[j+1]<a[j+2])\n        {\n            h++;\n        }\n    }\n    printf(\""%d\\n\"",k+h);\n}",RUNTIME_ERROR,25,324
1591669520367104000,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 13:49:20,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <string.h>\nint main()\n{\n    int k,len,i,g=0,l;\n    char str[10] = {0};\n    scanf(\""%d\"",&k);\n    scanf(\""%s\"",str);\n    len  = strlen(str);\n    for(i=0;i<len;i++)\n    {\n        if(str[i]=='0')\n        g++;\n        else\n        l++;\n    }\n    //g-=8;//0的个数;\n    //l-=52;//1的个数;\n    if(g>l)\n    printf(\""%d\\n\"",2*l);\n    else\n    printf(\""%d\\n\"",2*g);\n    return 0;\n}\n\n",RUNTIME_ERROR,7,200
1591669527359008768,505c5b9a1b6d591a815315d95a57743fb98dad691b51421b4de282392fef3f43,2022-11-13 13:49:21,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R,SUM;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    if(P+Q>=Q+R)\n    {\n        SUM=Q+R;\n    }\n    else\n        SUM=P+Q;\n    if(P+R>=Q+R)\n    {\n        SUM=Q+R;\n    }\n    else\n        SUM=P+R;\n    if(P+R>=P+Q)\n    {\n        SUM=P+Q;\n    }\n    else\n        SUM=P+R;\n    printf(\""%d\"",SUM);\n}\n",WRONG_ANSWER,14,324
1591669530324393984,05fd79145678de5c06012db9db4333bebf8365a74fe442d12a54a9da3782fdca,2022-11-13 13:49:22,C++,0.0,1591610585635213313,1589906790446387200,1049226928954454016,"    #include<iostream>\n    #include<math.h>\n    #define N 100005\n    using namespace std;\n    int main(){\n        long long int nums;\n        long long int pa1 = 0,pa2 = 0,pa3 = 0;\n        long long int a;\n        long long int n;\n        long long int z[N];\n        long long int max = 0;\n        long long int w1,w2,w3;\n        cin>>nums;\n        for(long int i = 0;i<nums;i++){\n            max = 0;\n            cin >> n;\n            for(long long int j = 0;j<n;j++) cin >> z[j];\n            for(pa1 = 0;pa1<n;pa1++){\n                for(pa2 = pa1+1;pa2<n;pa2++){\n                    for(pa3 = pa2+1;pa3<n;pa3++){\n                        w1 = fabs(z[pa1] - z[pa2]);\n                        w2 = fabs(z[pa2] - z[pa3]);\n                        if(max < w1+w2) max = w1 + w2;\n                        w1 = fabs(z[pa1] - z[pa3]);\n                        w2 = fabs(z[pa3] - z[pa2]);\n                        if(max < w1+w2) max = w1 + w2;\n                        w1 = fabs(z[pa2] - z[pa1]);\n                        w2 = fabs(z[pa1] - z[pa3]);\n                        if(max < w1+w2) max = w1 + w2;\n                        w1 = fabs(z[pa2] - z[pa3]);\n                        w2 = fabs(z[pa3] - z[pa1]);\n                        if(max < w1+w2) max = w1 + w2;\n                        w1 = fabs(z[pa3] - z[pa1]);\n                        w2 = fabs(z[pa1] - z[pa2]);\n                        if(max < w1+w2) max = w1 + w2;\n                        w1 = fabs(z[pa3] - z[pa2]);\n                        w2 = fabs(z[pa2] - z[pa1]);\n                        if(max < w1+w2) max = w1 + w2;\n                    }\n                }\n            }\n            cout << max <<endl;\n        }\n\n        return 0;\n    }\n",TIME_LIMIT_EXCEEDED,10000,452
1591669578323996672,da72e985b1ff1737d155282af7dd43e3dc341605cc356d114979edd4fea85a11,2022-11-13 13:49:33,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <string.h>\n#define MAX 20\nint main(void) {\n    int arr[MAX],n,i,t=0;\n    scanf(\""%d\"",&n);\n    for(i=1;i<n;i++)\n        scanf(\""%d\"",&arr[i]);\n    for(i=1;i<n-1;i++) {\n        if(arr[i]>arr[i-1])\n            t+=1;\n    }\n    printf(\""%d\"",t);\n}",WRONG_ANSWER,6,512
1591669597210992640,25b8e249c556de062ec0d61286db67304f907bc70204e22083d75434403578b1,2022-11-13 13:49:38,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    int a[n];\n    int i,flag=0;\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=1;i<n;i++)\n    {\n        if(a[i]<a[i-1]&&a[i]<=a[i+1])\n            flag++;\n    }\n    printf(\""%d\"",flag);\n    return 0;\n}\n",WRONG_ANSWER,7,200
1591669602189598720,86f702b052a21d7cb2f8cd933c678c21efaafaf5b2d35032f18ec35c1e26a945,2022-11-13 13:49:39,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,m=0,i;\n    int h[1000];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&h[i]);\n    for(i=1;i<n-1;i++)\n    {\n        if(h[i]<h[i-1]) \n        {if(h[i]<h[i+1]) m++;\n         else if(h[i+1]<h[i+2]) {i=i+1;m++;}\n        }\n     }\n    printf(\""%d\"",m);\n    return 0;\n}",WRONG_ANSWER,29,348
1591669631138717696,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 13:49:46,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[n],i,b=0;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n-2;i++)\n    {\n        if(a[i]>a[i+1]&&a[i+2]>=a[i+1])\n            b=b+1;\n    }\n    printf(\""%d\"",b);\n    return 0;\n}",ACCEPTED,38,512
1591669660976963584,977c9d350f87cd8386fa1f88cca886d6ff43821830806e60da6d6b36dc77cd13,2022-11-13 13:49:53,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,b,c;\n    int m,n,v;\n    scanf(\""%d%d%d\"",&a,&b,&c);\n    m=a+b;\n    n=a+c;\n    v=b+c;\n    if(m<n)\n    {\n        if(m<v)\n            printf(\""%d\"",m);\n        else\n            printf(\""%d\"",v);\n    }\n    else\n    {\n        if(n<v)\n            printf(\""%d\"",n);\n        else\n            printf(\""%d\"",v);\n    }\n}",ACCEPTED,46,372
1591669667838877696,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-13 13:49:55,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j,k=0,h=0;\n    int a[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=1;j<n-1;j++)\n    {\n        if(a[j]<a[j-1]&&a[j+1]>a[j])\n        {\n            k++;\n        }\n        if(a[j]==a[j+1]&&a[j]<a[j-1]&&a[j+1]<a[j+2])\n        {\n            h++;\n        }\n    }\n    printf(\""%d\\n\"",k+h);\n}",RUNTIME_ERROR,48,480
1591669681520697344,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-13 13:49:58,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main(){\n\tint n,i,j,k=0;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t} \n\tfor(i=1;i<n-1;i++){\n\t\tif(a[i]<a[i-1]){\n\t\t\tfor(j=i;j<n;j++){\n\t\t\t\tif(a[j]>a[j+1]) \n\t\t\t\t{\n\t\t\t\t\tk++;\n\t\t\t\t\ti=j;\n\t\t\t\t\tbreak;\n\n\t\t\t\t   }   \n\t\t\t}\n\t\t}\n\t}\n\tprintf(\""%d\\n\"",k);\n}",WRONG_ANSWER,8,328
1591669706371915776,675867a135da6702ed27c0eec3e4b6d2a7d95c44854c01823fc152f0689f010d,2022-11-13 13:50:04,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#define MAX 50\nint main(void)\n{\n\tint n, a[MAX];\n\tint i, m;\n\tint max1, max2, temp;\n\tmax1=0;\n\tmax2=0;\n\ttemp=0;\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++)\n\t\tscanf(\""%d\"",&a[i]);\n\t\n\t\t\tfor(i=0;i<n;i++)\n\t\t\t{\n\t\t\t\ttemp+=a[i]-5;\n\t\t\t\tif(temp<0)\n\t\t\t\t\ttemp=0;\n\t\t\t\tif(temp>max1){\n\t\t\t\t\tmax1=temp;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\ttemp=0;\n\t\t\tfor(i=0;i<n;i+=3)\n\t\t\t{\n\t\t\t\ttemp+=a[i]-5;\n\t\t\t\tif(temp<0)\n\t\t\t\t\ttemp=0;\n\t\t\t\tif(temp>max2){\n\t\t\t\t\tmax2=temp;\n\t\t\t\t}\t\n\t\t\t}\n\t\n\tif(max1>max2)\n\t\tprintf(\""%d\\n\"",max1);\n\telse\n\t\tprintf(\""%d\\n\"",max2);\n\t\t\n\t\n\treturn 0;\n}",SEGMENTATION_FAULT,6,384
1591669732376600576,e9a50f3e071443bb6fb229966bff355c178d484f6cc10e5e1fc8dc5a537237ba,2022-11-13 13:50:10,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int i,a[3],c,j,sum=0,max,max1;\n    int k;\n    for(i=0;i<3;i++)\n        scanf(\""%d\"",&a[i]);\n    c=a[0];\n    int b[c][c];\n    for(i=0;i<c;i++)\n        for(j=0;j<c;j++)\n    {\n        scanf(\""%d\"",&b[i][j]);\n    }\n   /* for(i=0;i<c;i++)\n   {\n       for(j=0;j<c;j++)\n    {\n        printf(\""%d\"",b[i][j]);\n    }\n    printf(\""\\n\"");\n   }*/\n      for(i=0;i<c;i++)\n    {\n        max=pow(a[1],b[1][i]+1)-pow(a[2],b[1][i]+1);\n       // printf(\""%d\\n\"",max);\n        k=b[0][i]/(b[1][i]+1);\n       // printf(\""%d \\n\"",k);\n        sum=sum+max*k;\n    }\n    printf(\""%d\"",sum);\n}\n",WRONG_ANSWER,9,196
1591669767579394048,e715137eeb4190ade2330123b989bbdd6eebd9a5e1df2e292271d3bfe3a79c69,2022-11-13 13:50:19,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,b,c,n=0;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    if(a>b)\n    {\n        n+=b;\n        if(a>c)\n            n+=c;\n        else\n            n+=a;\n    }\n    else\n    {\n         n+=a;\n        if(b>c)\n            n+=c;\n        else\n            n+=b;\n    }\n    printf(\""%d\\n\"",n);\n    return 0;\n}",ACCEPTED,52,480
1591669841017450496,e3700fa579dc7c925fa010ac870390ba9776ef5ee08f67752aeef4a9467c7624,2022-11-13 13:50:36,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n\nint n,h[100],i,j,m=0,flag;\n    scanf(\""%d\"",&n);\n    for(i=0;i<=n;i++)\n    {\n        scanf(\""%d\"",&h[i]);\n    for(j=0;j<=i;j++)\n    {\n        flag=0;\n        if(h[j]==0)\n        {\n            flag++;\n            break;\n        }\n        if(flag==0) m=m+1;\n    }\n    }\n    printf(\""%d\"",m);\n    return 0;\n}\n",WRONG_ANSWER,13,512
1591669855659765760,902d8082eea06043d392298983db4630cde4418ac8ee42282d537bfaae045c2f,2022-11-13 13:50:40,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"b=eval(input())\na=input().split(\"" \"")\na=list(a)\nj=0\nfor i in range(1,b-1):\n    if a[i]==a[i-1]:\n        a.pop(i)\nfor q in range(0,len(a)-1):\n    if a[q-1]>a[q]<a[q+1]:\n        j=j+1\nprint(j)",NON_ZERO_EXIT_CODE,104,3048
1591669858293800960,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 13:50:40,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <string.h>\nint main()\n{\n    int k,len,i,g=0,l=0;\n    char str[10] = {0};\n    scanf(\""%d\"",&k);\n    scanf(\""%s\"",str);\n    len  = strlen(str);\n    for(i=0;i<len;i++)\n    {\n        if(str[i]=='0')\n        g++;\n        else\n        l++;\n    }\n    //g-=8;//0的个数;\n    //l-=52;//1的个数;\n    if(g>l)\n    printf(\""%d\\n\"",2*l);\n    else\n    printf(\""%d\\n\"",2*g);\n    return 0;\n}\n\n",RUNTIME_ERROR,5,376
1591669869475803136,e9a50f3e071443bb6fb229966bff355c178d484f6cc10e5e1fc8dc5a537237ba,2022-11-13 13:50:43,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int i,a[3],c,j,sum=0,max,max1;\n    int k;\n    for(i=0;i<3;i++)\n        scanf(\""%d\"",&a[i]);\n    c=a[0];\n    int b[c][c];\n    for(i=0;i<c;i++)\n        for(j=0;j<c;j++)\n    {\n        scanf(\""%d\"",&b[i][j]);\n    }\n   /* for(i=0;i<c;i++)\n   {\n       for(j=0;j<c;j++)\n    {\n        printf(\""%d\"",b[i][j]);\n    }\n    printf(\""\\n\"");\n   }*/\n      for(i=0;i<c;i++)\n    {\n        max=pow(a[1],b[1][i]+1)-pow(a[2],b[1][i]+1);\n       // printf(\""%d\\n\"",max);\n        k=b[0][i]/(b[1][i]+1);\n       // printf(\""%d \\n\"",k);\n        sum=sum+max*k;\n    }\n    printf(\""%d\\n\"",sum);\n}\n",WRONG_ANSWER,11,484
1591669878355156992,675867a135da6702ed27c0eec3e4b6d2a7d95c44854c01823fc152f0689f010d,2022-11-13 13:50:45,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#define MAX 50\nint main(void)\n{\n\tint n, a[MAX];\n\tint i;\n\tint max1, max2, temp;\n\tmax1=0;\n\tmax2=0;\n\ttemp=0;\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++)\n\t\tscanf(\""%d\"",&a[i]);\n\t\n\t\t\tfor(i=0;i<n;i++)\n\t\t\t{\n\t\t\t\ttemp+=a[i]-5;\n\t\t\t\tif(temp<0)\n\t\t\t\t\ttemp=0;\n\t\t\t\tif(temp>max1){\n\t\t\t\t\tmax1=temp;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\ttemp=0;\n\t\t\tfor(i=0;i<n;i+=3)\n\t\t\t{\n\t\t\t\ttemp+=a[i]-5;\n\t\t\t\tif(temp<0)\n\t\t\t\t\ttemp=0;\n\t\t\t\tif(temp>max2){\n\t\t\t\t\tmax2=temp;\n\t\t\t\t}\t\n\t\t\t}\n\t\n\tif(max1>max2)\n\t\tprintf(\""%d\\n\"",max1);\n\telse\n\t\tprintf(\""%d\\n\"",max2);\n\t\t\n\t\n\treturn 0;\n}",SEGMENTATION_FAULT,6,356
1591669922420514816,40c43472973ea298adbdd1d4b900aeb63cfa4cfe17179f01a4827cd2c6624d3a,2022-11-13 13:50:55,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nmain()\n{\n    int n,a,b;\n    int c[20],f[20];\n    int i,j;\n    int sum0=0,sum1=0,sum2=0,sum3=0,sumz=0;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&c[i]);\n    }\n    for(j=0;j<n;j++)\n    {\n        scanf(\""%d\"",&f[j]);\n    }\n    for(i=0;i<n;i++)\n    {\n        for(j=0;j<n;j++)\n        {\n            if(i==j)\n            {\n              sum1=(c[i]/(f[j]+1))*pow(a,f[j]+1);\n              sum0+=sum1;\n              sum3=(c[i]/(f[j]+1))*pow(b,f[j]+1);\n              sum2+=sum3;\n            }\n            else\n                continue;\n        }\n    }\n    sumz=sum0-sum2;\n    printf(\""%d\"",sumz);\n}\n",WRONG_ANSWER,4,200
1591669930603589632,e7e6ce2c6e9e530eaf2b9b9968748a0e44e3ac7183d73deb51851946350bfbb0,2022-11-13 13:50:57,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n    int result=0;\n   int i,j,n;\n   int a,b;\n   int k[n],l[n]; //a数组表示系数，b数组表示指数\n   scanf(\""%d %d %d\"",&n,&a,&b);\n\n   for(i=0;i<n;i++) {\n    scanf(\""%d\"",&k[i]);\n   }\n   for(i=0;i<n;i++) {\n    scanf(\""%d\"",&l[i]);\n   }\n\n   for(j=0;j<n;j++) {\n    result+=(((k[j]/l[j]+1)*pow(a,l[j]+1))-((k[j]/l[j]+1)*pow(b,l[j]+1)));\n   }\n\n\n   return 0;\n}\n",WRONG_ANSWER,5,324
1591669932738490368,25b8e249c556de062ec0d61286db67304f907bc70204e22083d75434403578b1,2022-11-13 13:50:58,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    int a[n];\n    int i,flag=0;\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=1;i<n-1;i++)\n    {\n        if(a[i]<a[i-1]&&a[i]<=a[i+1])\n            flag++;\n    }\n    printf(\""%d\\n\"",flag);\n    return 0;\n}\n",ACCEPTED,32,352
1591669951516389376,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 13:51:02,Python,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"n=(int,input())\nh1,h2,h3,h4,h5,h6,h7=map(int,input().split())\nif hi>2:\nprint(3)\nai=5\ns=ai*hi\nprint(s)",NON_ZERO_EXIT_CODE,18,2904
1591670000241631232,542d97133043a1f2156354473a31382c35bb2836688b0ed76eae59c52a2e0e3a,2022-11-13 13:51:14,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main()\n{\n    int m,n,o,sum=0;\n    scanf(\""%d\"",&n);\n    if(n>=3&&n<=10000)\n    {\n        int h[n];\n        for(m=0;m<n;m++)\n        {\n            scanf(\""%d\"",&h[m]);\n        }\n        \n            for(o=1;o<n-1;o++)\n            {\n                if(h[o]<h[o+1]||h[o]<h[o-1])\n                {\n                    sum=sum+1;\n                    if(h[o]==h[o+1])\n                        sum=sum-1;\n                }\n            }\n            printf(\""%d\"",sum); \n         \n    }\n    \n    \n}",WRONG_ANSWER,6,196
1591670013369790464,acf80eea856463058b81f71c0238069795893092293fbd098cc594959df6444e,2022-11-13 13:51:17,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,n=int(input())\ns=input().split()\nh=0\nfor i in range(n):\n    if i>0 and i<n-2:\n        if s[i]<s[i-1] and s[i]<s[i+1] :\n            h=h+1\n        elif s[i]<s[i-1] and s[i]==s[i+1]:\n            if s[i+1]<s[i+2]:\n                h=h+1\n        else:\n                h=h+0\n     else:\n        h=h+0\nprint(h)\n    ,NON_ZERO_EXIT_CODE,17,2944
1591670035079520256,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-13 13:51:22,Python,0.0,1591610585635213314,1591128862958940160,1049226928954454016,"p = eval(input())\nl=[0]*p\nl[0]=5\nm=0\nx=0\nlist = map(eval,input().split())\nfor i in list:\n    l[x+1]=i\n    x=x+1\nfor a in range(0,p):\n    for b in range(a+1,p):\n        if l[a]<l[b]:\n            m=l[a]\n            l[a]=l[b]\n            l[b]=m\nfor j in range(0,p-1):\n    print(l[j],end=\"" \"")\nprint(l[-1])\n        \n\n",TIME_LIMIT_EXCEEDED,400,3020
1591670052552978432,da72e985b1ff1737d155282af7dd43e3dc341605cc356d114979edd4fea85a11,2022-11-13 13:51:26,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <string.h>\n#define MAX 20\nint main(void) {\n    int arr[MAX],n,i,t=0;\n    scanf(\""%d\"",&n);\n    for(i=1;i<n;i++)\n        scanf(\""%d\"",&arr[i]);\n    for(i=1;i<n-1;i++) {\n        if(arr[i]<arr[i-1]&&arr[i]<arr[i+1])\n            t+=1;\n    }\n    printf(\""%d\"",t);\n}",RUNTIME_ERROR,18,476
1591670055119904768,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-13 13:51:27,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\nint main(){\n    int n,s,k,q;\n    k=q=0;\n    int sum=1;\n    scanf(\""%d\"",&n);\n    scanf(\""%d\"",&s);\n    int v=s; //储存\n    while(s!=s%10)\n    {\n        s=s/10;\n        sum++;\n    }\n    int pz=n-sum;\n    s=v;\n        for(int j=0;j<sum;j++)\n    {\n        if(s%10==1)\n            k++;   //1\n        else q++;   //0\n        s=s/10;\n    }\n    q=q+pz;\n    int min=(k>q)?q:k;\n    int l=2*k;\n    printf(\""%d\"",l);\n    return 0;\n}",WRONG_ANSWER,5,336
1591670057653264384,542d97133043a1f2156354473a31382c35bb2836688b0ed76eae59c52a2e0e3a,2022-11-13 13:51:28,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main()\n{\n    int m,n,o,sum=0;\n    scanf(\""%d\"",&n);\n    if(n>=3&&n<=10000)\n    {\n        int h[n];\n        for(m=0;m<n;m++)\n        {\n            scanf(\""%d\"",&h[m]);\n        }\n        \n            for(o=1;o<n-2;o++)\n            {\n                if(h[o]<h[o+1]||h[o]<h[o-1])\n                {\n                    sum=sum+1;\n                    if(h[o]==h[o+1])\n                        sum=sum-1;\n                }\n            }\n            printf(\""%d\"",sum); \n         \n    }\n    \n    \n}",WRONG_ANSWER,6,332
1591670058794115072,9a1ecd1db02b268060006afd7de34ec54e74e90bf61becbb6811fb23971c4720,2022-11-13 13:51:28,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,def iss(x):\n    if x==2:\n        if s[0]!=s[1]:\n            s.clear()\n        return s\n    elif x==1:\n         return s\n    elif x==3:\n        if s[0]!=s[1] or s[1]!=s[2]:\n            s.pop(0)\n            s.pop(0)\n        return s\n    else:\n        for i in range(x-2):\n            if s[i]!=s[i+1]:\n                s.pop(i)\n                s.pop(i)\n                l=len(s)\n                return iss(l)\n            elif i==x-3:\n                return s\nn=int(input())\ns=list(input())\nl=n\ny=iss(l)\nz=len(y)\nprint(n-z)\n\n,WRONG_ANSWER,16,3016
1591670067719593984,d5db2853d0fce01dd43b2b6adf379841403b78fda0e6cb22c82f6f2b59da60dc,2022-11-13 13:51:30,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\nmain(){\n\tint i,j,n,s=0,s1,s2,a[20];\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\ti=-1;\n\twhile(i<n){\n\t\ts1=0;\n\t\ts2=0;\n\t\ts1=s1+a[i+3]-5;\n\t\ts2=s2+a[i+1]+a[i+2]-10;\n\t\tif(s1>s2&&i+3<n){\n\t\t\ts=s-5+a[i+3];\n\t\t\ti=i+3;\n\t\t}\n\t\telse if(i+1<n){\n\t\t\ts=s-5+a[i+1];\n\t\t\ti=i+1;\n\t\t}\n\t\telse i++;\n\t}\n\tprintf(\""%d\"",s);\n\treturn 0;\n}",SEGMENTATION_FAULT,9,488
1591670098103132160,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 13:51:37,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <string.h>\nint main()\n{\n    int k,len,i,g=0,l=0;\n    char str[10] = {0};\n    scanf(\""%d\"",&k);\n    if(scanf(\""%s\"",str)==1)\n    {}\n    len  = strlen(str);\n    for(i=0;i<len;i++)\n    {\n        if(str[i]=='0')\n        g++;\n        else\n        l++;\n    }\n    //g-=8;//0的个数;\n    //l-=52;//1的个数;\n    if(g>l)\n    printf(\""%d\\n\"",2*l);\n    else\n    printf(\""%d\\n\"",2*g);\n    return 0;\n}\n\n",RUNTIME_ERROR,4,328
1591670125034745856,542d97133043a1f2156354473a31382c35bb2836688b0ed76eae59c52a2e0e3a,2022-11-13 13:51:44,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main()\n{\n    int m,n,o,sum=0;\n    scanf(\""%d\"",&n);\n    if(n>=3&&n<=10000)\n    {\n        int h[n];\n        for(m=0;m<n;m++)\n        {\n            scanf(\""%d\"",&h[m]);\n        }\n        \n            for(o=1;o<n-1;o++)\n            {\n                if(h[o]<h[o+1]||h[o]<h[o-1])\n                {\n                    sum=sum+1;\n                    if(h[o]==h[o+1])\n                        sum=sum-1;\n                }\n            }\n            printf(\""%d\"",sum); \n         \n    }\n    \n    \n}",WRONG_ANSWER,4,356
1591670127048011776,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-13 13:51:44,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int j,i,n;\n    char s[10];\n    int sum1=0,sum2=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&s[i]);\n    }\n    for(j=0;j<n;j++)\n       for(i=0;i<n;i++)\n       {\n           if(s[j]==s[i+1])\n               sum1++;\n           else\n               sum2++;\n       }\n    if(sum1>sum2)\n        printf(\""%d\"",sum2*2);\n    else\n        printf(\""%d\"",sum1*2);\n       \n    \n    return 0;\n   \n}",WRONG_ANSWER,8,328
1591670162628292608,d5db2853d0fce01dd43b2b6adf379841403b78fda0e6cb22c82f6f2b59da60dc,2022-11-13 13:51:53,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\nmain(){\n\tint i,j,n,s=0,s1,s2,a[20];\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\ti=-1;\n\twhile(i<n){\n\t\ts1=0;\n\t\ts2=0;\n\t\ts1=s1+a[i+3]-5;\n\t\ts2=s2+a[i+1]+a[i+2]-10;\n\t\tif(s1>s2&&i+3<n){\n\t\t\ts=s-5+a[i+3];\n\t\t\ti=i+3;\n\t\t}\n\t\telse if(i+1<n){\n\t\t\ts=s-5+a[i+1];\n\t\t\ti=i+1;\n\t\t}\n\t\telse i++;\n\t}\n\tprintf(\""%d\\n\"",s);\n\treturn 0;\n}",SEGMENTATION_FAULT,6,364
1591670190373658624,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 13:51:59,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <string.h>\nint main()\n{\n    int k,len,i,g=0,l=0;\n    char str[10] = {0};\n    if(scanf(\""%d\"",&k)==1){}\n    if(scanf(\""%s\"",str)==1)\n    {}\n    len  = strlen(str);\n    for(i=0;i<len;i++)\n    {\n        if(str[i]=='0')\n        g++;\n        else\n        l++;\n    }\n    //g-=8;//0的个数;\n    //l-=52;//1的个数;\n    if(g>l)\n    printf(\""%d\\n\"",2*l);\n    else\n    printf(\""%d\\n\"",2*g);\n    return 0;\n}\n\n",RUNTIME_ERROR,5,376
1591670259915186176,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-13 13:52:16,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main(){\n    int i,j,n,h[9999],max=0,count=0,chengji=15;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&h[i]);\n    }\n    for(i=0;i<n-1;i++){\n        for(j=i+1;j<n;j++){\n            if(h[j]==h[j-1]){\n                count++;\n                chengji=h[j]*(count);\n            }else{\n                count=0;\n            }\n            if(chengji>max){\n                max=chengji;\n            }\n        }\n        count=0;\n    }\n    printf(\""%d\\n\"",max);\n    return 0;\n}",WRONG_ANSWER,7,512
1591670261328666624,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-13 13:52:16,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main(){\n    int n,a[1000],count=0,i,j,t=0;\n      scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n        \n        if(a[0]==0&&a[n-1]==0){\n    \n    for( j=1;j<n-2;j++)\n    {\n        \n        if(a[j]<a[j-1]&&a[j]<a[j+1])\n        { count++;    count+=t;t=0;}\n             \n        else \n        if(a[j]==a[j+1])\n        {t=1;\n            continue;\n        }\n        \n        if(a[j]==0&&a[j+1]!=0) {count+=t;t=0;}\n      \n        \n            \n    }\n    \n    \n   if(count!=0)\n      printf(\""%d\"",count);\n   else \n     printf(\""0\"");\n          }\n}",WRONG_ANSWER,34,488
1591670278638559232,505c5b9a1b6d591a815315d95a57743fb98dad691b51421b4de282392fef3f43,2022-11-13 13:52:20,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R,SUM;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    if(P+Q>=R+Q)\n    {\n        SUM=R+Q;\n    }\n    else\n        SUM=P+Q;\n    if(P+R>=Q+R)\n    {\n        SUM=Q+R;\n    }\n    else\n        SUM=P+R;\n    if(R+P>=Q+P)\n    {\n        SUM=Q+P;\n    }\n    else\n        SUM=R+P;\n    printf(\""%d\"",SUM);\n}\n",WRONG_ANSWER,10,360
1591670288302223360,a57fdafe4877cd9608fc0ac8a5120a47bc60a015785960e61b67b4e66187c2f2,2022-11-13 13:52:23,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 100\nint main(){\n    int i,n,j=0;\n    int a[N];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=1;i<n;i++){\n        if(a[i]<a[i+1])\n            j++;\n    }\n    printf(\""%d\\n\"",j);\n    return 0;\n}",WRONG_ANSWER,5,208
1591670294291701760,899c5501179552dc1fe5639f9047e15d0f835e7a87c8568193377882d0278985,2022-11-13 13:52:24,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,i,count=0;\n    char str[n];\n    scanf(\""%d\"",&n);\n    gets(str);\n    for(i=0;i<n;i++)\n    {\n        if(str[i]=str[i+1])\n            count+=2;\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",WRONG_ANSWER,5,324
1591670305863786496,acf80eea856463058b81f71c0238069795893092293fbd098cc594959df6444e,2022-11-13 13:52:27,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,n=int(input())\ns=input().split()\nh=0\nfor i in range(n):\n    if i>0 and i<n-2:\n        if s[i]<s[i-1] and s[i]<s[i+1] :\n            h=h+1\n        elif s[i]<s[i-1] and s[i]==s[i+1]:\n            if s[i+1]<s[i+2]:\n                h=h+1\n        else:\n             h=h+0\n    else:\n        h=h+0\nprint(h)\n    ,WRONG_ANSWER,82,2904
1591670312310431744,d5db2853d0fce01dd43b2b6adf379841403b78fda0e6cb22c82f6f2b59da60dc,2022-11-13 13:52:28,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\nmain(){\n\tint i,j,n,s=0,s1,s2,a[20];\n\tscanf(\""%d\\n\"",&n);\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\ti=-1;\n\twhile(i<n){\n\t\ts1=0;\n\t\ts2=0;\n\t\ts1=s1+a[i+3]-5;\n\t\ts2=s2+a[i+1]+a[i+2]-10;\n\t\tif(s1>s2&&i+3<n){\n\t\t\ts=s-5+a[i+3];\n\t\t\ti=i+3;\n\t\t}\n\t\telse if(i+1<n){\n\t\t\ts=s-5+a[i+1];\n\t\t\ti=i+1;\n\t\t}\n\t\telse i++;\n\t}\n\tprintf(\""%d\\n\"",s);\n\treturn 0;\n}",SEGMENTATION_FAULT,13,476
1591670324553605120,06b00897262b024d9e66dcd771cf81de9b63954f7a4554699d17c2158114c0d1,2022-11-13 13:52:31,Java,0.0,1591610585639407616,1591132307937943552,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner scan=new Scanner(System.in);\n\t\tint n=scan.nextInt();\n\t\tint arr[]=new int[n];\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tarr[i]=scan.nextInt();\n\t\t}\n\t\tfor(int i=1;i<n;i++) {\n\t\t\tif(arr[i]==arr[i-1]) {\n\t\t\t\tfor(int j=i;j<n;j++) {\n\t\t\t\t\tarr[j-1]=arr[j];\n\t\t\t\t\tarr[n-1]=0;\n\t\t\t\t\tn=n-1;\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint x=0;\n\t\tfor(int j=1;j<n-1;j++){\n\t\t\tif(arr[j]<arr[j-1]&&arr[j]<arr[j+1]) {\n\t\t\tx++;\t\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(x);\n\t\tscan.close();\n\t}\n\n},WRONG_ANSWER,458,25616
1591670342853353472,2e4af98c441106efa9ee51f8a781d0eee91a3dff6193987d421eb3a48725c814,2022-11-13 13:52:36,C++,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <iostream>\n\nint fun(int a,int b,int c){\n\tint t;\n\tt=a+b>b+c?b+c>c+a?c+a:b+c:a+b;\n \treturn t;\n}\nint main(){\n//\tint n;\n//\tscanf(\""%d\"",&n);\n\tint p,q,r;\n\tscanf(\""%d %d %d\"",&p,&q,&r);\n\tprintf(\""%d\"",fun(p,q,r));\n}",ACCEPTED,32,660
1591670395294724096,20ffd83467b553ac24e1f4b8b096d58858684ca8c3f6a4d5a62be9ff7c4817da,2022-11-13 13:52:48,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#define MAX 10000\nint main()\n{\n    int n;\n    signed int a,b;\n    int i;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    int c[MAX],F[MAX];\n    double  B[MAX],h=0;\n    for(i=1;i<=n;i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=1;i<=n;i++)\n        scanf(\""%d\"",&F[i]);\n    for(i=1;i<=n;i++)\n        B[i]=c[i]/(F[i]+1)*pow(a,F[i]+1)-c[i]/(F[i]+1)*pow(b,F[i]+1);\n    for(i=1;i<=n;i++){\n        h+=B[i];\n        }\n    printf(\""%d\\n\"",(int)h);\n}\n\n",WRONG_ANSWER,7,224
1591670410549407744,73af9d5098be5d450fba728363c8fdbe0f6a5526466daa2f3b74abf1acf75527,2022-11-13 13:52:52,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    \n    int n,h[1000],i=0,j=0;\n    scanf(\""%d\"",&n);\n    int count=0;\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&h[i]);\n        \n    }\n        for(i=1;i<n-1;i++)\n        {\n            if(h[i]!=h[i+1]&&h[i]<h[i+1]&&h[i]<h[i-1])\n                count++;\n            if(h[i]==h[i+1])\n                {\n                    for(j=i+1;j<n-1;j++)\n                    {\n                        if(h[j]==h[j+1])\n                            j++;\n                        else if(h[j]!=h[j+1]) \n                            continue;\n                    }\n                    i=j;\n                    if(h[i]<h[i+1]&&h[i]<h[i-1])\n                        count++;\n                    \n                }\n           \n            \n        }\n    printf(\""%d\"",count);\n    return 0;\n\n}",WRONG_ANSWER,26,476
1591670466308497408,07d925df8d2026d3171a0a2ca84a6ef7f4a5b47a584cf47b66c5dd8f28139d1f,2022-11-13 13:53:05,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a[100],count,n,i;\n    count=0;\n    scanf(\""%d\"",&n);\n    for (i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n        if(a[i]<a[i-1]&&a[i]<a[i+1])\n            count++;\n    }\n    printf(\""%d\\n\"",count);\n    return 0;\n}\n",WRONG_ANSWER,5,328
1591670503851700224,a5291eb67188c2a916aa5dd9fc38f2e449aa9f9a3cd047f282d8c154ea2979cd,2022-11-13 13:53:14,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <iostream>\n\nusing namespace std;\nconst int N = 1e6 + 10;\nint arr[N];\n\nint main()\n{\n    int cnt = 0;\n    int n = 0;\n    cin >> n;\n    for(int i = 1;i <= n;i++)\n    {\n        cin >> arr[i];\n    }\n    \n    for(int i = 2;i <= n - 1;i++)\n    {\n        if(arr[i] - arr[i - 1] < 0)\n        {\n            int j = i + 1;\n            while(arr[j] - arr[j - 1] == 0 && j <= n)\n            {\n                j++;\n            }\n            cnt ++;\n            cout << \""j = \"" << j << endl;\n            cout << \""i = \"" << i << endl;\n            i = j - 1;\n        }\n    }\n    \n    cout << cnt << endl;\n    \n    return 0;\n}",WRONG_ANSWER,7,640
1591670507395887104,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-13 13:53:15,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int j,i,n;\n    char s[10];\n    int sum1=0,sum2=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&s[i]);\n    }\n    for(j=0;j<n;j++)\n    { for(i=0;i<n;i++)\n       {\n           if(s[j]==s[i+1])\n               sum1++;\n           else\n               sum2++;\n       }\n     }\n    if(sum1>sum2)\n        printf(\""%d\"",sum2*2);\n    else\n        printf(\""%d\"",sum1*2);\n       \n    \n    return 0;\n   \n}",WRONG_ANSWER,8,328
1591670511892180992,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 13:53:16,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,i,h=0;\n    int b[10];\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=1;i<a-1;i++)\n        {\n            if(b[i]==0)\n               h++;\n        }\n        printf(\""%d\\n\"",h);\n    return 0;\n}\n",RUNTIME_ERROR,8,204
1591670518590496768,0354b067c4132d4425a90b77482ac717447702274cb7db1282edce56eaf037b3,2022-11-13 13:53:18,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main(){\n\tint n,i,j,a[100],max,max1,count;\n\tscanf(\""%d\"",&n);\n\tcount=0;\n\tfor(i=0;i<n;i++)\n\t   scanf(\""%d\"",&a[i]);\n\tmax1=max=0;\n\tfor(i=0;i<n;i++){\n        count=0;\n\t\tfor(j=i+1;j<n;j++){\n\t\t\tif(a[i]<=a[j]){\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tfor(j=i;j>=0;j--){\n\t\t\tif(a[i]<=a[j]){\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tmax1=a[i]*count;\n\t\tif(max1>max){\n\t\t    max=max1;\n\t\t}\n\t}\n\tprintf(\""%d\"",max);\n\treturn 0;\n} ",WRONG_ANSWER,5,192
1591670602229100544,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 13:53:38,Python,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"n=(int,input())\nh1,h2,h3,h4,h5,h6,h7=map(int,input().split())\nif h1<h2 and h3>h2 and h4>h2 and h5==h2 and h6>h2 and h7<2:\nprint(h2)\nai=5\ns=ai*h2\nprint(s)",NON_ZERO_EXIT_CODE,22,3056
1591670609145507840,a5291eb67188c2a916aa5dd9fc38f2e449aa9f9a3cd047f282d8c154ea2979cd,2022-11-13 13:53:39,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,#include <iostream>\n\nusing namespace std;\nconst int N = 1e6 + 10;\nint arr[N];\n\nint main()\n{\n    int cnt = 0;\n    int n = 0;\n    cin >> n;\n    for(int i = 1;i <= n;i++)\n    {\n        cin >> arr[i];\n    }\n    \n    for(int i = 2;i <= n - 1;i++)\n    {\n        if(arr[i] - arr[i - 1] < 0)\n        {\n            int j = i + 1;\n            while(arr[j] - arr[j - 1] == 0 && j <= n)\n            {\n                j++;\n            }\n            cnt ++;\n            i = j - 1;\n        }\n    }\n    \n    cout << cnt << endl;\n    \n    return 0;\n},WRONG_ANSWER,7,456
1591670636664381440,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-13 13:53:46,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<iostream>\nusing namespace std;\nclass resolve{\n    public:\n    void resve(int *h,int n){\n        int nums=0;\n        for(int i=1;i<n-1;i++){\n        if(h[i]<h[i-1])\n            if(h[i]<h[i+1])\n                nums++;\n            else{\n                for(int j=i;j<n-1;j++){\n                    if(h[j]<h[j+1]){\n                        nums++;\n                        i=j+2;\n                        continue;\n                    }   \n                }\n            } \n        }\n        cout<<nums<<endl;;\n    }  \n};\n        \n        \n        \nint main(){\n    int n,h[1000];\n    cin>>n;\n    for(int i=0;i<n;i++){\n        cin>>h[i];\n    }\n    resolve res;\n    res.resve(h,n);\n    return 0;\n}",WRONG_ANSWER,9,328
1591670645677907968,1b00b3d29099722d8332b35e3af5e54fda309b4f7c9fc6261f618ecd2a4d7390,2022-11-13 13:53:48,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,sum=0,i,j;\n    scanf(\""%d\"",&n);\n    int h[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&h[i]);\n     for(j=1;j<=n;j++)//循环总数\n     {\n         for(i=j;i<=j;i++)\n         {\n             if(h[i+1]<h[i]&&h[i+1]<h[i+2])\n                 sum++;\n             else break;\n         }\n         }\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,12,200
1591670647737311232,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-13 13:53:48,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n\nint main() {\n\t     int n,zhan,i,j;\n\t\t scanf(\""%d\"",&n); \n\t\t int a[100];\n\t\t for(i=1;i<n-1;i++)\n\t\t {\n\t\t scanf(\""%d\"",&a[i]);\n\t     }\n\t     a[0]=a[n]=0;\n\t\tfor(i=0;i<n;i++)\t\n\t\t{\t\n\t\tfor(j=1;j<n;j++)\n\t\t{\n\t\t\tif(a[i]>a[i+1])\n\t\t\t{\n\t\t\tif(a[i+1]<a[i+j])\n\t\t\tzhan++;\n\t\t\tbreak;\n\t\t\t}\n\t\t\t i++;\n\t\t}\n\t\t\n\t\t}\n\t\tprintf(\""%d\"",zhan);\t\n\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                   \n",WRONG_ANSWER,13,352
1591670727114514432,6ba5ecacf3381a1e9382f99c413290eca40a071a563a618e5f36d66cbf9a5e1b,2022-11-13 13:54:07,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<iostream>\n\nusing namespace std;\n\nint main(){\nint n;\nint flag=3;\nlong imax=0,sum=0;\ncin>>n;\nlong h[n];\nfor(int i=0;i<n;i++){\n    cin>>h[i];\n}\n\nfor(int i=0;i<n;i++)\n{\n    for(int j=i+1;j<n;j++){\n        if(h[j]>=h[i])\n            flag=1;\n        else\n            flag=0;\n        if(flag==0){\n        sum=h[i]*(j-i);\n       // cout<<sum<<endl;\n        if(imax<sum)\n            imax=sum;\n        break;\n        }\n    }\n}\ncout<<imax<<endl;\n}\n",WRONG_ANSWER,22,464
1591670728091820032,5bd1a8718ea7fb820055421c67b8e0a468e08d951f729a24e55bf407b3bdb1f6,2022-11-13 13:54:08,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <iostream>\n#include <algorithm>\nusing namespace std;\n\n\n\n\n\n\nint main()\n{\n\n    int n,arr[10010];\n    cin>>n;\n    for(int i=0;i<n;i++){\n        cin>>arr[i];\n    }\n    int i=0,j=n-1;\n    int result=0;\n    while(i<=j){\n        result=arr[i]<arr[j]?\n        max(result,(j-i)*arr[i++]):\n        max(result,(j-i)*arr[j--]);\n    }\n    cout<<result;\n    return 0;\n}\n",WRONG_ANSWER,8,328
1591670755258327040,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 13:54:14,Python,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"n=(int,input())\nh1,h2,h3,h4,h5,h6,h7=map(int,input().split())\nif h1<h2 and h3>h2 and h4>h2 and h5==h2 and h6>h2 and h7<2:\n    print(h2)\nai=5\ns=ai*h2\n    print(s)",NON_ZERO_EXIT_CODE,20,2904
1591670767321112576,864c0dc14d6d917707294bc7e18ea53a2c0536c5d47f3d25f94f0188f106014f,2022-11-13 13:54:17,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,count=0;\n    int a[1000];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n-2;i++){\n       if((a[i]-a[i+1]>0)&&(a[i+1]-a[i+2]<=0)){\n           count++;\n       }\n    }\n       printf(\""%d\"",count );\n    return 0;\n}",ACCEPTED,26,500
1591670781850181632,f02e276f40ab35b9adfdb6399e4858c8c655e5a7c77ea058b6ff58b6ea670152,2022-11-13 13:54:20,C++,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tint n;\n\tchar sum[n];\n\tint coum=0;\n\tscanf(\""%d\"",&n);\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tscanf(\""%c\"",&sum[i]);\n\t}\n\tfor(int a=0;a<n;a++)\n\t{\n\t\tfor(int j=1;j<=a;j++)\n       {\n\t\t  if(sum[a]!=sum[j])\n\t\t  {\n\t\t   \tcoum=coum+2;\n\t      } \n\t      continue;\n       }\n\t}\n\tprintf(\""%d\\n\"",coum);\n\treturn 0;\n}",WRONG_ANSWER,9,324
1591670783741845504,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 13:54:21,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[n],sum=0,i,b=0;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i=b)\n    {\n        if(a[i]>5)\n        {\n            sum=sum+a[i]-5;\n            b=b+1;\n        }\n        else if(a[i]>a[i+2])\n        {\n            sum=sum+a[i]-5;\n            b=b+1;\n        }\n        else \n        {\n            sum=sum+a[i+2]-5;\n            b=b+3;\n        }\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,7,324
1591670796232482816,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-13 13:54:24,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<iostream>\nusing namespace std;\nclass resolve{\n    public:\n    void resve(int *h,int n){\n        int nums=0;\n        for(int i=1;i<n-1;i++){\n        if(h[i]<h[i-1])\n            if(h[i]<h[i+1])\n                nums++;\n            else{\n                for(int j=i;j<n-1;j++){\n                    if(h[j]<h[j+1]){\n                        nums++;\n                        i=j+2;\n                        continue;\n                    }   \n                }\n            } \n        }\n        cout<<nums<<endl;;\n    }  \n};\n        \n        \n        \nint main(){\n    int n,h[1000];\n    cin>>n;\n    if(n<3)\n        return 0;\n    for(int i=0;i<n;i++){\n        cin>>h[i];\n    }\n    resolve res;\n    res.resve(h,n);\n    return 0;\n}",WRONG_ANSWER,5,324
1591670802712682496,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 13:54:25,Python,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"n=(int,input())\nh1,h2,h3,h4,h5,h6,h7=map(int,input().split())\nif h1<h2 and h3>h2 and h4>h2 and h5==h2 and h6>h2 and h7<2:\n    print(h2)\nai=5\ns=ai*h2\nprint(s)",NON_ZERO_EXIT_CODE,16,2956
1591670809188642816,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 13:54:27,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[n],sum=0,i,b=0;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i=b)\n    {\n        if(a[i]>=5)\n        {\n            sum=sum+a[i]-5;\n            b=b+1;\n        }\n        else if(a[i]>a[i+2])\n        {\n            sum=sum+a[i]-5;\n            b=b+1;\n        }\n        else \n        {\n            sum=sum+a[i+2]-5;\n            b=b+3;\n        }\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,11,328
1591670811034136576,17759f531671f838bf3fae4270190e93b6109026f9503f986c1ed85bb412007d,2022-11-13 13:54:27,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int i,n,a,b,c[1000],F[1000],sum1=0,sum2=0;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&F[i]);\n    for(i=0;i<n;i++)\n    {\n        sum1=sum1+(c[i]/(F[i]+1))*(pow(a,F[i]+1));\n        sum2=sum2+(c[i]/(F[i]+1))*(pow(b,F[i]+1));\n    }\n    printf(\""%d\"",(sum1-sum2));\n}",WRONG_ANSWER,14,360
1591670845893009408,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-13 13:54:36,Python,0.0,1591610585635213314,1591128862958940160,1049226928954454016,"p = eval(input())\nl=[0]*p\nl[0]=5\nm=0\nx=0\nlist = map(eval,input().split())\nfor i in list:\n    l[x+1]=i\n    x=x+1\nfor b in range(1,p):\n    if l[b]>l[b-1]:\n        m=l[b+1]\n        l[b+1]=l[b]\n        l[b]=m\nfor b in range(1,p):\n    if l[b]<l[b-1]:\n        m=l[b+1]\n        l[b+1]=l[b]\n        l[b]=m\nfor j in range(0,p-1):\n    print(l[j],end=\"" \"")\nprint(l[-1])\n        \n\n",NON_ZERO_EXIT_CODE,26,3144
1591670867334279168,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 13:54:41,Python,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"n=(int,input())\nh1,h2,h3,h4,h5,h6,h7=map(int,input().split())\nif h1<h2 and h3>h2 and h4>h2 and h5==h2 and h6>h2 and h7<2:\n    print(h2)\nai=5\ns=ai*h2\nprint(s)",NON_ZERO_EXIT_CODE,15,2904
1591670880185638912,d9e00d995e65b04cda3ddef6baec19225e4351002ab4efa981f62d78919a481b,2022-11-13 13:54:44,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n;\n    int a,b;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    int c[n];\n    int f[n];\n    int i;\n    int sum=0;\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&c[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&f[i]);\n    }\n    int j;\n    for(j=0;j<2;j++){\n        if(j==0){\n            for(i=0;i<n;i++)\n            {\n                sum += c[i]/(f[i]+1) * pow(a,f[i]+1);\n            }\n        }\n        else{\n                for(i=0;i<n;i++)\n            sum -= c[i]/(f[i]+1) * pow(b,f[i]+1);\n        }\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,5,328
1591670888981082112,c358160a3e618a44cd693944fe10043e6372f46bf7d517c3c3f583bd85b17c5e,2022-11-13 13:54:46,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"n=int(input())\nm=input().split()\ncount=0\nfor i in range(1,n-2):\n    if int(m[i])>int(m[i+1])and int(m[i+1])< int(m[i+2]):\n        count=count+1\n    if int(m[i])>int(m[i+1]) and int(m[i+1])== int(m[i+2]) and int(m[i+2])<int(m[i+3]):\n        count=count+1\nprint(count)   \n    \n",WRONG_ANSWER,86,2904
1591670916403441664,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-13 13:54:52,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n\nint main() {\n\t     int n,zhan,i,j;\n\t\t scanf(\""%d\"",&n); \n\t\t int a[100];\n\t\t for(i=1;i<n-1;i++)\n\t\t {\n\t\t scanf(\""%d\"",&a[i]);\n\t     }\n\t     a[0]=a[n-1]=0;\n\t\tfor(i=0;i<n;i++)\t\n\t\t{\t\n\t\tfor(j=1;j<n;j++)\n\t\t{\n\t\t\tif(a[i]>a[i+1])\n\t\t\t{\n\t\t\tif(a[i+1]<a[i+j])\n\t\t\tzhan++;\n\t\t\tbreak;\n\t\t\t}\n\t\t\t i++;\n\t\t}\n\t\t\n\t\t}\n\t\tprintf(\""%d\"",zhan);\t\n\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                   \n",WRONG_ANSWER,8,192
1591670922476806144,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-13 13:54:54,Python,0.0,1591610585635213314,1591128862958940160,1049226928954454016,"p = eval(input())\nl=[0]*p\nl[0]=5\nm=0\nx=0\nlist = map(eval,input().split())\nfor i in list:\n    l[x+1]=i\n    x=x+1\nfor b in range(1,p):\n    if l[b]>l[b-1]:\n        m=l[b+1]\n        l[b+1]=l[b]\n        l[b]=m\nfor b in range(1,p):\n    if l[b]<l[b-1]:\n        m=l[b+1]\n        l[b+1]=l[b]\n        l[b]=m\nfor j in range(0,p-1):\n    print(l[j],end=\"" \"")\nprint(l[-1])\n        \n\n",NON_ZERO_EXIT_CODE,27,3152
1591670924028731392,63a19c717d077fecd1be96314929ebf3516f35619209eacac77081bb07edebb5,2022-11-13 13:54:54,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include<math.h>\n#include<string.h>\nint main()\n{\n   int i,j=0,n,sum=0;\n   scanf(\""%d\"",&n);\n   int a[n];\n   for(i=1;i<=n;i++)\n     scanf(\""%d\"",&a[i]);\n   while(j<n){\n     if(a[j+3]>=a[j+1]&&j+3<=n&&j+1<=n){\n          sum+=a[j+3]-5;\n          j=j+3;\n        }\n     else{\n         sum+=a[j+1]-5;\n         j=j+1;\n     }\n     }\n     printf(\""%d\"",sum);\n}\n",WRONG_ANSWER,7,348
1591670942257143808,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-13 13:54:59,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,n;\n    char s[10];\n    int sum1=0,sum2=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&s[i]);\n    }\n    for(i=0;i<n;i++)\n       {\n           if(s[0]==s[i+1])\n               sum1++;\n           else\n               sum2++;\n       }\n     \n    if(sum1>sum2)\n        printf(\""%d\"",sum2*2);\n    else\n        printf(\""%d\"",sum1*2);\n       \n    \n    return 0;\n   \n}",WRONG_ANSWER,11,196
1591670995952656384,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-13 13:55:11,C++,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int N=10005;\nll a[N];\nll dp[N][N];\nint main(){\nint n;\ncin>>n;\nint cnt=0;\nfor(int i=1;i<=n;i++)\ncin>>a[i];\ndp[0][0]=0;\nfor(int i=0;i<n;i++){\n\tcnt+=max(a[i+1],a[i+3])-5;\n\tif(a[i+3]>a[i+1])\n\ti+=2;\n}\ncout<<cnt;\n\treturn 0;\n} ",WRONG_ANSWER,7,584
1591671016840257536,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-13 13:55:16,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main(){\n    int n,a[1000],count=0,i,j,t=0;\n      scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n        \n        \n    \n    for( j=1;j<n-2;j++)\n    {\n        \n        if(a[j]<a[j-1]&&a[j]<a[j+1])\n        { count++;   }\n             \n        else \n        if(a[j]==a[j+1])\n        {t=1;\n            continue;\n        }\n        \n        if(a[j]==0&&a[j+1]!=0) {count+=t;t=0;}\n      \n        \n            \n    }\n    \n    \n   if(count!=0)\n      printf(\""%d\"",count);\n   else \n     printf(\""0\"");\n          \n}",WRONG_ANSWER,52,636
1591671030912180224,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 13:55:20,Python,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"n=(int,input())\nh1,h2,h3,h4,h5,h6,h7=map(int,input().split())\nif h1<h2 and h3>h2 and h4>h2 and h5==h2 and h6>h2 and h7<2:\n    print(h2)\nai=5\ns=ai*hi\nprint(s)",NON_ZERO_EXIT_CODE,18,2756
1591671039309176832,902d8082eea06043d392298983db4630cde4418ac8ee42282d537bfaae045c2f,2022-11-13 13:55:22,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"b=eval(input())\na=input().split(\"" \"")\na=list(a)\nj=0\nfor i in range(1,b-1):\n    if a[i]==a[i-1]:\n        a.pop(i)\nfor q in range(1,len(a)-1):\n    if a[q-1]>a[q]<a[q+1]:\n        j=j+1\nprint(j)",NON_ZERO_EXIT_CODE,86,3044
1591671043507675136,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-13 13:55:23,C,0.0,1591610585635213314,1591128862958940160,1049226928954454016,"int main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint a[n],i,j;\n\ta[0]=n;\n\tfor(i=1;i<n;i++)\n\t   {\n\t   \tscanf(\""%d\"",&a[i]);\n\t   \t\n\t   }\n\t   int temp=0;\n\n\tfor(i=0;i<n-1;i++)\n\t  for(j=0;j<n-1-i;j++)\n\t   \t{\n\t   \t   \tif(a[j]<a[j+1]) \n\t\t\t\t  {\n\t\t\t\t  \ttemp=a[j];\n\t\t\t\t  \ta[j]=a[j+1];\n\t\t\t\t  \ta[j+1]=temp;\n\t\t\t\t  } \n\t   \t   \t\n\t   \t}\n\t   \tfor(i=0;i<n;i++)\n\t   \tprintf(\""%d \"",a[i]);\n    printf(\""\\n\"");\n\t   \treturn 0;\n}",WRONG_ANSWER,12,196
1591671051531378688,28b4de6882b7ade2679f59c486acaf307ce8415dcb0a15787dba589025bbdb02,2022-11-13 13:55:25,C,300.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint num[n];\n\tint i,j;\n\tint max=-1,index,count,sum;\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&num[i]);\n\t}\n\tfor(i=0;i<n;i++)\n\t{\n\t\tcount=0;\n\t\tsum=0;\n\t\tfor(j=0;j<n;j++)\n\t\t{\n\t\t\tif(num[j]>=num[i])\n\t\t\t{\t\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tif(num[j]<num[i]||j==n-1)\n\t\t\t{\n\t\t\t\tif(num[i]*count>sum)\n\t\t\t\tsum=num[i]*count;\n\t\t\t\tcount=0;\n\t\t\t}\n\t\n\t\t}\n\t\tif(sum>max)\n\t\t{\n\t\t\tmax=sum;\n\t\t}\n\t\t\n\t}\n\tprintf(\""%d\"",max);\n\treturn 0;\n}",ACCEPTED,41,512
1591671074398724096,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 13:55:30,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[n],sum=0,i,b=0;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i=b)\n    {\n        if(a[i]>=5)\n        {\n            sum=sum+a[i]-5;\n            b=b+1;\n        }\n        else if(a[i]>a[i+2])\n        {\n            sum=sum+a[i]-5;\n            b=b+1;\n        }\n        else if(a[i]<a[i+2])\n        {\n            sum=sum+a[i+2]-5;\n            b=b+3;\n        }\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",TIME_LIMIT_EXCEEDED,400,352
1591671088629964800,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-13 13:55:34,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\nint main(){\n    int n,s,k,q;\n    k=q=0;\n    int sum=1;\n    scanf(\""%d\"",&n);\n    scanf(\""%d\"",&s);\n    int v=s; //储存\n    while(s!=s%10)\n    {\n        s=s/10;\n        sum++;\n    }\n    int pz=n-sum;\n    s=v;\n        for(int j=0;j<sum;j++)\n    {\n        if(s%10==1)\n            k++;   //1\n        else q++;   //0\n        s=s/10;\n    }\n    q=q+pz;\n    int min=(k>q)?q:k;\n    int l=2*min;\n    printf(\""%d\"",l);\n    return 0;\n}",WRONG_ANSWER,5,196
1591671111140782080,0cfbb4a339ebbc4dce13b5f3e3f98a3def0ab17ef5b4ac8e6d566de92e1f5f78,2022-11-13 13:55:39,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n[3];\n    int x;\n    int y;\n    int min=1000;\n    for(int i=0;i<3;i++){\n        scanf(\""%d\"",&n[i]);\n        if(n[i]<min){\n            min=n[i];\n            x=i;\n        }\n    }\n    y=n[x-1];\n    if(x==0){\n        y=n[x+1];\n    }\n    printf(\""%d\"",y+min);\n}",SEGMENTATION_FAULT,7,200
1591671111690280960,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-13 13:55:39,Python,0.0,1591610585635213314,1591128862958940160,1049226928954454016,"p = eval(input())\nl=[0]*p\nl[0]=5\nm=0\nx=0\nlist = map(eval,input().split())\nfor i in list:\n    l[x+1]=i\n    x=x+1\nfor b in range(1,p):\n    if l[b]>l[b-1]:\n        m=l[b+1]\n        l[b+1]=l[b]\n        l[b]=m\nfor b in range(1,p):\n    if l[b]<l[b-1]:\n        m=l[b+1]\n        l[b+1]=l[b]\n        l[b]=m\nfor j in range(0,p):\n    print(l[j],end=\"" \"")\n\n\n",NON_ZERO_EXIT_CODE,30,3096
1591671130388443136,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 13:55:43,Python,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"n=(int,input())\nh1,h2,h3,h4,h5,h6,h7=map(int,input().split())\nif h1<h2 and h3>h2 and h4>h2 and h5==h2 and h6>h2 and h7<2:\n    print(h2)\n    ai=5\n    s=ai*hi\nprint(s)",NON_ZERO_EXIT_CODE,22,2816
1591671136411508736,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 13:55:45,Python,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"n=(int,input())\nh1,h2,h3,h4,h5,h6,h7=map(int,input().split())\nif h1<h2 and h3>h2 and h4>h2 and h5==h2 and h6>h2 and h7<2:\n    print(h2)\n    ai=5\n    s=ai*hi\nprint(s)",NON_ZERO_EXIT_CODE,29,2760
1591671176022515712,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-11-13 13:55:54,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,j;\n    int count=0;\n    int a[3]={0},b[6]={0};\n    int minsum=3001;\n    for(i=0;i<3;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    if((a[0]+a[1])<(a[0]+a[2]))\n    {\n        if((a[0]+a[1]<a[1]+a[2]))\n            minsum=a[0]+a[1];\n        else\n            minsum=a[1]+a[2];\n     }\n    else\n    {\n        if((a[0]+a[2])<(a[1]+a[2]))\n            minsum=a[0]+a[2];\n        else\n            minsum=a[1]+a[2];\n    }\n    printf(\""%d\\n\"",minsum);\n    return 0;\n}",ACCEPTED,30,508
1591671182271995904,0cfbb4a339ebbc4dce13b5f3e3f98a3def0ab17ef5b4ac8e6d566de92e1f5f78,2022-11-13 13:55:56,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n[3];\n    int x;\n    int y;\n    int min=1000;\n    for(int i=0;i<3;i++){\n        scanf(\""%d\"",&n[i]);\n        if(n[i]<min){\n            min=n[i];\n            x=i;\n        }\n    }\n    y=n[x-1];\n    \n    printf(\""%d\"",y+min);\n}",SEGMENTATION_FAULT,11,328
1591671195219845120,86f702b052a21d7cb2f8cd933c678c21efaafaf5b2d35032f18ec35c1e26a945,2022-11-13 13:55:59,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,m=0,i;\n    int h[10000];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&h[i]);\n    for(i=1;i<n-1;i++)\n    {\n        if(h[i]<h[i-1]&&h[i]<h[i+1]) m++;\n        if(h[i]==h[i+1]&&h[i]<h[i+2]) m++;\n     }\n    printf(\""%d\"",m);\n    return 0;\n}",ACCEPTED,32,372
1591671198030028800,1d5ac1674206114dbc3c7883f7305e131f037b2aefcb3b297d62e80957fc1452,2022-11-13 13:56:00,C++,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#define MAX 100\nint G[MAX];\nint main()\n{\n\tint n,i,max;\n\tscanf(\""%d\"",&n);\n\tgetchar();\n\tfor(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&G[i]);\n    }\n\tG[i]='\\0';\n\tmax=G[0];\n\tfor(i=0;G[i]!='\\0'&&i<n;)\n\t{\n\t\t\tif(G[i+3]!='\\0')\n\t\t\t{\n\t\t\t\tif(G[i+3]>G[i+1])\n\t\t\t\t{\n\t\t\t\t\tmax+=G[i+3]-5;\n\t\t\t\t    i+=3;\n\t\t\t\t}\t\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tif(G[i+1]!='\\0')\n\t\t\t\t{\n\t\t\t\t    max+=G[i+1]-5;\n\t\t\t\t    i+=1;\n\t\t\t\t}\t\t\n\t\t\t}\n\t\t\t\n\t}\n\tprintf(\""%d\"",max);\n    return 0;\n}\t",SEGMENTATION_FAULT,10,200
1591671207458791424,0354b067c4132d4425a90b77482ac717447702274cb7db1282edce56eaf037b3,2022-11-13 13:56:02,C,300.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main(){\n\tint n,i,j,a[100],max,max1,count;\n\tscanf(\""%d\"",&n);\n\tcount=0;\n\tfor(i=0;i<n;i++)\n\t   scanf(\""%d\"",&a[i]);\n\tmax1=max=0;\n\tfor(i=0;i<n;i++){\n        count=0;\n\t\tfor(j=i+1;j<n;j++){\n\t\t\tif(a[i]<=a[j]){\n\t\t\t\tcount++;\n            }\n             else\n                 break;\n\t\t}\n\t\tfor(j=i;j>=0;j--){\n\t\t\tif(a[i]<=a[j]){\n\t\t\t\tcount++;\n            }\n            else\n                break;\n\t\t}\n\t\tmax1=a[i]*count;\n\t\tif(max1>max){\n\t\t    max=max1;\n\t\t}\n\t}\n\tprintf(\""%d\"",max);\n\treturn 0;\n} ",ACCEPTED,39,476
1591671225649475584,6ba5ecacf3381a1e9382f99c413290eca40a071a563a618e5f36d66cbf9a5e1b,2022-11-13 13:56:06,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<iostream>\n\nusing namespace std;\n\nint main(){\nint n;\nint flag=3;\nlong imax=0,sum=0;\ncin>>n;\nlong h[n];\nfor(int i=0;i<n;i++){\n    cin>>h[i];\n}\n\nfor(int i=0;i<n;i++)\n{\n    for(int j=i+1;j<n;j++){\n        if(h[j]>=h[i])\n            flag=1;\n        else\n            flag=0;\n        if(flag==0){\n        sum=h[i]*(j-i);\n       // cout<<sum<<endl;\n        if(imax<sum)\n            imax=sum;\n        break;\n        }\n        if(flag==1 && j==n-1){\n            //sum=h[i]*(j-i+1);\n            cout<<sum<<endl;\n        if(imax<sum)\n            imax=sum;\n        break;\n        }\n    }\n}\ncout<<imax;\n}\n",WRONG_ANSWER,8,480
1591671227838902272,7e6a67f270e740aba8788a12d9a49939621a28d5059d3ced2247a86914b0a3b3,2022-11-13 13:56:07,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n\tint P,Q,R;\n\tscanf(\""%d %d %d\"",&P,&Q,&R);\n\tint min[3];\n\tmin[0]=P+Q;\n\tmin[1]=Q+R;\n\tmin[2]=P+R;\n\tint A=min[0];\n\tfor(int i=1;i<3;i++)\n\t\tif(min[i]<A) A=min[i];\n\tprintf(\""%d\"",A);\n}",ACCEPTED,45,512
1591671230380662784,00d0a1b2e987c17fb50850b9ec54bf6b4f8b997eb053d1a9fed6c4888fbe74ed,2022-11-13 13:56:07,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,i,j,a[n],max=0,min,flag,x;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        flag=0;\n       for(x=0;x<a[i];x++){\n        for(j=i;j<n;j++)\n        {\n           \n            if (a[i]-x<=a[j+1])\n                flag=flag+1;\n            else break;\n        }\n       \n        min=(a[i]-x)*(flag+1);\n        \n            if(max<=min)\n                max=min;\n        \n        }\n    }\n    \n        printf(\""%d\\n\"",max);\n        return 0;\n}",RUNTIME_ERROR,13,200
1591671233673191424,e7f8e9ba366feb4551b7dc8e6a149f796e822980a43de4fcc91ded552c4bcbd4,2022-11-13 13:56:08,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main(int argc, char *argv[]) {\n\tint P,Q,R; \n\tscanf(\""%d%d%d\"",&P,&Q,&R);\n    int F,G,H,m; \n\tF=P+Q; \n\tG=Q+R; \n\tH=R+P;\n\tif(F<G && G<H)\n\t  m=F; \n\t  \n\telse if(G<F && G<H)\n\t  m=G;\n\t  \n\telse if(H<G && G<F)\n\t  m=H;\n\t  \n\tprintf(\""%d\\n\"",m);\n\treturn 0;\n\t\n}\n",ACCEPTED,34,508
1591671245601779712,0b693affc66d8d407ff008bd1aaf4f2feb4a615f057943ba4b4ba3163d937dc6,2022-11-13 13:56:11,Java,300.0,1591610585639407617,1591132482555211776,1049226928954454016,"import java.io.*;\nimport java.util.*;\n\npublic class Main {\n\n    public static void main(String[] args) throws IOException {\n        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n        Scanner sc=new Scanner(System.in);\n        String s=br.readLine();\n        String[] str=br.readLine().split(\"" \"");\n        int n=Integer.parseInt(s);\n        int res=0;\n        int temp=0;\n        for (int i = 0; i < n; i++) {\n            int flag=Integer.parseInt(str[i]);\n            temp=flag;\n            for (int j = i+1; j < n; j++) {\n                if (Integer.parseInt(str[j])>=flag){\n                    temp+=flag;\n                }else\n                    break;\n            }\n            for (int j = i-1; j >=0 ; j--) {\n                if (Integer.parseInt(str[j])>=flag)\n                    temp+=flag;\n                else break;\n            }\n            res=Math.max(res,temp);\n        }\n        System.out.println(res);\n    }\n}",ACCEPTED,517,24884
1591671265021419520,6ba5ecacf3381a1e9382f99c413290eca40a071a563a618e5f36d66cbf9a5e1b,2022-11-13 13:56:16,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<iostream>\n\nusing namespace std;\n\nint main(){\nint n;\nint flag=3;\nlong imax=0,sum=0;\ncin>>n;\nlong h[n];\nfor(int i=0;i<n;i++){\n    cin>>h[i];\n}\n\nfor(int i=0;i<n;i++)\n{\n    for(int j=i+1;j<n;j++){\n        if(h[j]>=h[i])\n            flag=1;\n        else\n            flag=0;\n        if(flag==0){\n        sum=h[i]*(j-i);\n       // cout<<sum<<endl;\n        if(imax<sum)\n            imax=sum;\n        break;\n        }\n        if(flag==1 && j==n-1){\n            //sum=h[i]*(j-i+1);\n            cout<<sum<<endl;\n        if(imax<sum)\n            imax=sum;\n        break;\n        }\n    }\n}\ncout<<imax<<endl;\n}\n",WRONG_ANSWER,8,488
1591671293760778240,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-13 13:56:22,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,n;\n    char s[10];\n    int sum1=0,sum2=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&s[i]);\n    }\n    for(i=0;i<n;i++)\n       {\n           if(a[i]==0)\n               sum1++;\n           else\n               sum2++;\n       }\n     \n    if(sum1>sum2)\n        printf(\""%d\"",sum2*2);\n    else\n        printf(\""%d\"",sum1*2);\n       \n    \n    return 0;\n   \n}",COMPILE_ERROR,0,0
1591671298718445568,d5db2853d0fce01dd43b2b6adf379841403b78fda0e6cb22c82f6f2b59da60dc,2022-11-13 13:56:24,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"main(){\n\tint i,j,n,s=0,s1,s2,a[20];\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=-1;i<n;){\n\t\ts1=0;\n\t\ts2=0;\n\t\ts1=s1+a[i+3]-5;\n\t\ts2=s2+a[i+1]+a[i+2]-10;\n\t\tif(s1>s2&&i+3<n){\n\t\t\ts=s-5+a[i+3];\n\t\t\ti=i+3;\n\t\t}\n\t\telse if(i+1<n){\n\t\t\ts=s-5+a[i+1];\n\t\t\ti=i+1;\n\t\t}\n\t\telse i++;\n\t}\n\tprintf(\""%d\\n\"",s);\n\treturn 0;\n}",SEGMENTATION_FAULT,5,352
1591671300777848832,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 13:56:24,Python,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"n=(int,input())\nh1,h2,h3,h4,h5,h6,h7=map(int,input().split())\nif h1<h2 and h3>h2 and h4>h2 and h5==h2 and h6>h2 and h7<2:\n    print(h2)\n    ai=5\ns=ai*hi\nprint(s)",NON_ZERO_EXIT_CODE,17,2756
1591671303537713152,64475a8ecd7d5a6c6e734f3f299283e039c26933b2a0e510cd9d22e95ba92068,2022-11-13 13:56:25,C++,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <bits/stdc++.h> \nusing namespace std;\n\nint main()\n{\n\tint n,ans = 0;\n\tchar a[1000010];\n\tint vis[1000010];\n\t\n\tcin>>n;\n\tfor(int i = 0; i < n; i++)\n\tcin>>a[i];\n\t\n\n\tfor(int i = 0; i < n; i++)\n\t{\n\t\tfor(int j = 0; j < n-1; j++)\n\t\t{\n\t\t\tif(a[j]!=a[j+1] && vis[j]!=1)\n\t\t\t{\n\t\t\t\tvis[j] = 1;\n\t\t\t\tans++;\n\t\t\t}\n\t\t\t\n\t\t}\n\t}\n\tcout<<ans;\n\t\n\treturn 0;\n}",WRONG_ANSWER,17,452
1591671312983273472,9d0546dac18a9dc678295254e547925db086add5f872ef42d8015d525afeaf65,2022-11-13 13:56:27,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 10000\nint main()\n{\n    int num[N],i,j,n,temp;\n    int k=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&num[i]);\n    }\n    for(i=1;i<n-1;i++){\n        if(num[i]<num[i+1]){\n        k++;\n        }\n    }\n    printf(\""%d\"",k);\n}",WRONG_ANSWER,11,196
1591671319643828224,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 13:56:29,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,i,h=0;\n    int b[10]={0};\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=1;i<a-1;i++)\n        {\n            if(b[i]==0)\n               h++;\n        }\n        printf(\""%d\\n\"",h);\n    return 0;\n}\n",RUNTIME_ERROR,5,328
1591671341064138752,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-13 13:56:34,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,n;\n    char s[10];\n    int sum1=0,sum2=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&s[i]);\n    }\n    for(i=0;i<n;i++)\n       {\n           if(s[i]==0)\n               sum1++;\n           else\n               sum2++;\n       }\n     \n    if(sum1>sum2)\n        printf(\""%d\"",sum2*2);\n    else\n        printf(\""%d\"",sum1*2);\n       \n    \n    return 0;\n   \n}",WRONG_ANSWER,6,512
1591671345765965824,0cfbb4a339ebbc4dce13b5f3e3f98a3def0ab17ef5b4ac8e6d566de92e1f5f78,2022-11-13 13:56:35,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n[1000];\n    int x;\n    int y;\n    int min=1000;\n    for(int i=0;i<3;i++){\n        scanf(\""%d\"",&n[i]);\n        if(n[i]<min){\n            min=n[i];\n            x=i;\n        }\n    }\n    y=n[x-1];\n    if(x==0){\n        y=n[x+1];\n    }\n    printf(\""%d\"",y+min);\n}",SEGMENTATION_FAULT,6,196
1591671346961330176,73af9d5098be5d450fba728363c8fdbe0f6a5526466daa2f3b74abf1acf75527,2022-11-13 13:56:35,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    \n    int n,h[1000],i=0,j=0;\n    scanf(\""%d\"",&n);\n    int count=0;\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&h[i]);\n        \n    }\n        for(i=1;i<n-1;i++)\n        {\n            if(h[i]!=h[i+1]&&h[i]<h[i+1]&&h[i]<h[i-1])\n                count++;\n            if(h[i]==h[i+1]&&h[i]<h[i-1])\n                {\n                    for(j=i+1;j<n-1;j++)\n                    {\n                        if(h[j]==h[j+1])\n                            j++;\n                        else if(h[j]!=h[j+1]) \n                            continue;\n                    }\n                    i=j;\n                    if(h[i]<h[i+1])\n                        count++;\n                    \n                }\n           \n            \n        }\n    printf(\""%d\"",count);\n    return 0;\n\n}",WRONG_ANSWER,34,384
1591671366238363648,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 13:56:40,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[n],sum=0,i,b=0;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i=b)\n    {\n        if(a[i]>=5||a[i]>a[i+2])\n        {\n            sum=sum+a[i]-5;\n            b=b+1;\n        }\n        else if(a[i]<a[i+2])\n        {\n            sum=sum+a[i+2]-5;\n            b=b+3;\n        }\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",TIME_LIMIT_EXCEEDED,400,324
1591671367853170688,d5db2853d0fce01dd43b2b6adf379841403b78fda0e6cb22c82f6f2b59da60dc,2022-11-13 13:56:40,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"main(){\n\tint i,j,n,s=0,s1,s2,a[20];\n\tscanf(\""%d\\n\"",&n);\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=-1;i<n;){\n\t\ts1=0;\n\t\ts2=0;\n\t\ts1=s1+a[i+3]-5;\n\t\ts2=s2+a[i+1]+a[i+2]-10;\n\t\tif(s1>s2&&i+3<n){\n\t\t\ts=s-5+a[i+3];\n\t\t\ti=i+3;\n\t\t}\n\t\telse if(i+1<n){\n\t\t\ts=s-5+a[i+1];\n\t\t\ti=i+1;\n\t\t}\n\t\telse i++;\n\t}\n\tprintf(\""%d\\n\"",s);\n\treturn 0;\n}",SEGMENTATION_FAULT,8,348
1591671397896957952,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 13:56:47,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[n],sum=0,i,b=0;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i=b)\n    {\n        if(a[i]>=5||a[i]>a[i+2])\n        {\n            sum=sum+a[i]-5;\n            b=b+1;\n        }\n        else\n        {\n            sum=sum+a[i+2]-5;\n            b=b+3;\n        }\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,6,512
1591671409552941056,da72e985b1ff1737d155282af7dd43e3dc341605cc356d114979edd4fea85a11,2022-11-13 13:56:50,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <string.h>\n#define MAX 20\nint main(void) {\n    int arr[MAX],n,i,t=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&arr[i]);\n    for(i=1;i<n-1;i++) {\n        if(arr[i]<arr[i-1]&&arr[i]<=arr[i+1])\n            t+=1;\n    }\n    printf(\""%d\"",t);\n}",RUNTIME_ERROR,16,352
1591671426846044160,105cc8c0a5a465ab713603b461d92ac587c87767965625687540cd513f7ebb57,2022-11-13 13:56:54,C++,300.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<bits/stdc++.h>\n#define N 10005\n#define endl '\\n'\n#define int long long\n#define ios ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)\n\n//const int dir[4][2]={-1,0,0,1,1,0,0,-1};\n//const int mod=1e9+7;\nusing namespace std;\n\ninline int read() {\n    char c = getchar(); int num = 0, sign = 1;\n    while(c < '0' || c > '9') {if(c == '-') sign = -1; c = getchar();}\n    while(c >= '0' && c <= '9') num = num * 10 + c - '0', c = getchar();\n    return num * sign;\n}\n\nvoid solve(){\n\tint n;\n\tint heights[N];\n\tcin>>n;\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tcin>>heights[i];\n\t}\n    int ans=0;\n    for (int left = 0; left < n; ++left) {\n        int minHeight = INT_MAX;\n        for (int right = left; right < n; ++right) {\n            minHeight = min(minHeight, heights[right]);\n            ans = max(ans, (right - left + 1) * minHeight);\n        }\n    }\n        cout<<ans;\n}\n\nsigned main() {\n\tios;\n\tint count=1;\n\t//cin>>count;\n\twhile(count--)\n\t{\n\t\tsolve();\n\t}\n\treturn 0;\n}\n",ACCEPTED,39,512
1591671431086485504,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 13:56:55,Python,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"n=(int,input())\nh1,h2,h3,h4,h5,h6,h7=map(int,input().split())\nif h1<h2 and h3>h2 and h4>h2 and h5==h2 and h6>h2 and h7<2:\n    print(h2)\nai=5\ns=ai*hi\nprint(s)",NON_ZERO_EXIT_CODE,16,2904
1591671453450526720,899c5501179552dc1fe5639f9047e15d0f835e7a87c8568193377882d0278985,2022-11-13 13:57:00,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<string.h>\n#include<math.h>\nint main()\n{\n    int n,i,count=0;\n    scanf(\""%d\"",&n);\n    char str[80];\n    gets(str);\n    for(i=0;i<n;i++)\n    {\n        if(str[i]=str[i+1])\n            count+=2;\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",WRONG_ANSWER,5,196
1591671475659366400,6ba5ecacf3381a1e9382f99c413290eca40a071a563a618e5f36d66cbf9a5e1b,2022-11-13 13:57:06,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<iostream>\n\nusing namespace std;\n\nint main(){\nint n;\nint flag=3;\nlong imax=0,sum=0;\ncin>>n;\nlong h[n];\nfor(int i=0;i<n;i++){\n    cin>>h[i];\n}\n\nfor(int i=0;i<n;i++)\n{\n    for(int j=i+1;j<n;j++){\n        if(h[j]>=h[i])\n            flag=1;\n        else\n            flag=0;\n        if(flag==0){\n        sum=h[i]*(j-i);\n       // cout<<sum<<endl;\n        if(imax<sum)\n            imax=sum;\n        break;\n        }\n        if(flag==1 && j==n-1){\n            sum=h[i]*(j-i+1);\n            //cout<<sum<<endl;\n        if(imax<sum)\n            imax=sum;\n        break;\n        }\n    }\n}\ncout<<imax<<endl;\n}\n",WRONG_ANSWER,17,620
1591671485373374464,00d0a1b2e987c17fb50850b9ec54bf6b4f8b997eb053d1a9fed6c4888fbe74ed,2022-11-13 13:57:08,C,300.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,i,j,a[n],max=0,min,flag,x;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        \n       for(x=0;x<a[i];x++)\n       {\n           flag=0;\n        for(j=i;j<n;j++)\n        {\n           \n            if (a[i]-x<=a[j+1])\n                flag=flag+1;\n            else break;\n        }\n       \n        min=(a[i]-x)*(flag+1);\n        \n            if(max<=min)\n                max=min;\n        \n        }\n    }\n    \n        printf(\""%d\\n\"",max);\n        return 0;\n}",ACCEPTED,267,512
1591671486581321728,17759f531671f838bf3fae4270190e93b6109026f9503f986c1ed85bb412007d,2022-11-13 13:57:08,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int i,n,a,b,c[1000],F[1000],sum1=0,sum2=0;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&F[i]);\n    for(i=0;i<n;i++)\n    {\n        sum1=sum1+(c[i]/(F[i]+1))*(pow(a,F[i]+1));\n        sum2=sum2+(c[i]/(F[i]+1))*(pow(b,F[i]+1));\n    }\n    printf(\""%d\"",sum1-sum2);\n}",WRONG_ANSWER,5,476
1591671511776550912,0c2907a154c1c61744366e94f73ae426665222ffae8eff7042dd0fd7bd8760fb,2022-11-13 13:57:14,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{int n;\nscanf(\""%d\"",&n);\nint i,count=0;\nint a[n];\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&a[i]);\n\n for(i=1;i<n-1;i++)\n {if(a[i]<a[i+1]&&a[i-1]>a[i])\n   {count++;}\n if(a[i]==a[i+1]&&a[i+2]>a[i])\n   count++;}\nprintf(\""%d\"",count);\n\n    return 0;\n}\n",ACCEPTED,43,512
1591671511868780544,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-13 13:57:14,Python,0.0,1591610585635213314,1591128862958940160,1049226928954454016,"p = eval(input())\nl=[0]*p\nl[0]=5\nm=0\nx=0\nlist = map(eval,input().split())\nfor i in list:\n    l[x+1]=i\n    x=x+1\nfor b in range(1,p):\n    if l[b]>l[b-1]:\n        m=l[b+1]\n        l[b+1]=l[b]\n        l[b]=m\nfor a in range(1,p):\n    if l[a]<l[a-1]:\n        m=l[a+1]\n        l[a+1]=l[a]\n        l[a]=m\nfor j in range(0,p-1):\n    print(l[j],end=\"" \"")\nprint(l[-1])\n\n\n",NON_ZERO_EXIT_CODE,30,3296
1591671524736950272,a57fdafe4877cd9608fc0ac8a5120a47bc60a015785960e61b67b4e66187c2f2,2022-11-13 13:57:17,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 1000\nint main()\n{\n    int n,i,b,j,max;\n    int a[N],c[N];\n   scanf(\""%d\"",&n);\n   for(i=0;i<n;i++)\n    scanf(\""%d\"",&a[i]);\n  for(i=0;i<n;i++){\n    for(j=0;j<n;j++){\n        if(a[i]>=a[j]){\n            b=a[i];\n            a[i]=a[j];\n            a[j]=b;\n        }\n    }\n  }\n   for(i=0;i<n;i++)\n        c[i]=a[i]*(i+1);\n     for(i=0;i<n;i++){\n        for(j=0;j<n;j++){\n            if(c[i]>=c[j]){\n                max=c[i];\n                c[i]=c[j];\n                c[j]=max;\n            }\n        }\n    }\n    printf(\""%d\\n\"",c[0]);\n    return 0;\n}",WRONG_ANSWER,5,496
1591671558840836096,73af9d5098be5d450fba728363c8fdbe0f6a5526466daa2f3b74abf1acf75527,2022-11-13 13:57:26,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    \n    int n,h[1000],i=0,j=0;\n    scanf(\""%d\"",&n);\n    int count=0;\n    for(i=0;i<n-1;i++)\n    {\n        scanf(\""%d\"",&h[i]);\n        \n    }\n    h[n-1]=0;\n        for(i=1;i<n-1;i++)\n        {\n            if(h[i]!=h[i+1]&&h[i]<h[i+1]&&h[i]<h[i-1])\n                count++;\n            if(h[i]==h[i+1]&&h[i]<h[i-1])\n                {\n                    for(j=i+1;j<n-1;j++)\n                    {\n                        if(h[j]==h[j+1])\n                            j++;\n                        else if(h[j]!=h[j+1]) \n                            continue;\n                    }\n                    i=j;\n                    if(h[i]<h[i+1])\n                        count++;\n                    \n                }\n           \n            \n        }\n    printf(\""%d\"",count);\n    return 0;\n\n}",WRONG_ANSWER,57,512
1591671571570503680,d5db2853d0fce01dd43b2b6adf379841403b78fda0e6cb22c82f6f2b59da60dc,2022-11-13 13:57:29,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"main(){\n\tint i,n,s=0,s1,s2,a[20];\n\tscanf(\""%d\\n\"",&n);\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=-1;i<n;){\n\t\ts1=0;\n\t\ts2=0;\n\t\ts1=s1+a[i+3]-5;\n\t\ts2=s2+a[i+1]+a[i+2]-10;\n\t\tif(s1>s2&&i+3<n){\n\t\t\ts=s-5+a[i+3];\n\t\t\ti=i+3;\n\t\t}\n\t\telse if(i+1<n){\n\t\t\ts=s-5+a[i+1];\n\t\t\ti=i+1;\n\t\t}\n\t\telse i++;\n\t}\n\tprintf(\""%d\\n\"",s);\n\treturn 0;\n}",SEGMENTATION_FAULT,6,364
1591671620878786560,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-13 13:57:40,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<iostream>\nusing namespace std;\nclass resolve{\n    public:\n    void resve(int *h,int n){\n        int nums=0;\n        for(int i=1;i<n-1;i++){\n        if(h[i]<h[i-1])\n            if(h[i]<h[i+1])\n                nums++;\n            else{\n                for(int j=i;j<n-1;j++){\n                    if(h[j]<h[j+1]){\n                        nums++;\n                        i=j+2;\n                        continue;\n                    }   \n                }\n            } \n        }\n        cout<<nums<<endl;\n    }  \n};\n\nint main(){\n    int n,h[1000];\n    cin>>n;\n    if(n<3)\n        return 0;\n    for(int i=0;i<n;i++){\n        cin>>h[i];\n    }\n    resolve res;\n    res.resve(h,n);\n    return 0;\n}",WRONG_ANSWER,12,640
1591671638465458176,a57fdafe4877cd9608fc0ac8a5120a47bc60a015785960e61b67b4e66187c2f2,2022-11-13 13:57:45,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 1000\nint main()\n{\n    int n,i,b,j,max;\n    int a[N],c[N];\n   scanf(\""%d\"",&n);\n   for(i=0;i<n;i++)\n    scanf(\""%d \"",&a[i]);\n  for(i=0;i<n;i++){\n    for(j=0;j<n;j++){\n        if(a[i]>=a[j]){\n            b=a[i];\n            a[i]=a[j];\n            a[j]=b;\n        }\n    }\n  }\n   for(i=0;i<n;i++)\n        c[i]=a[i]*(i+1);\n     for(i=0;i<n;i++){\n        for(j=0;j<n;j++){\n            if(c[i]>=c[j]){\n                max=c[i];\n                c[i]=c[j];\n                c[j]=max;\n            }\n        }\n    }\n    printf(\""%d\\n\"",c[0]);\n    return 0;\n}",WRONG_ANSWER,7,196
1591671643733504000,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-13 13:57:46,Python,0.0,1591610585635213314,1591128862958940160,1049226928954454016,"p = eval(input())\nl=[0]*p\nl[0]=5\nm=0\nx=0\nlist = map(eval,input().split())\nfor i in list:\n    l[x+1]=i\n    x=x+1\nfor b in range(1,p):\n    if l[b]>l[b-1]:\n        m=l[b+1]\n        l[b+1]=l[b]\n        l[b]=m\nfor a in range(1,p):\n    if l[a]<l[a-1]:\n        m=l[a+1]\n        l[a+1]=l[a]\n        l[a]=m\nfor j in range(0,p-1):\n    print(l[j],end=\"" \"")\nprint(l[-1],end=\""\"")\n\n\n",NON_ZERO_EXIT_CODE,27,3144
1591671650872209408,17759f531671f838bf3fae4270190e93b6109026f9503f986c1ed85bb412007d,2022-11-13 13:57:48,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int i,n,a,b,c[10000],F[10000],sum1=0,sum2=0;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&F[i]);\n    for(i=0;i<n;i++)\n    {\n        sum1=sum1+(c[i]/(F[i]+1))*(pow(a,F[i]+1));\n        sum2=sum2+(c[i]/(F[i]+1))*(pow(b,F[i]+1));\n    }\n    printf(\""%d\"",sum1-sum2);\n}",WRONG_ANSWER,7,512
1591671687983411200,af559dccfa68c49b94a61e83fc9942ea0513a50e66ecf36dc005df0e7960903e,2022-11-13 13:57:56,C,300.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n;\n    int num=0;\n        scanf(\""%d\"",&n);\n    char s[n];\n    for(int j=0;j<=n;j++){\n        scanf(\""%c\"",&s[j]);\n    }\n    for(int i=0;i<=n;i++){\n         if(s[i]=='0')num--;\n        if(s[i]=='1')num++;\n    }\n  if(num>=0){\n        printf(\""%d\\n\"",(n-num));\n    }\n    else{\n        printf(\""%d\\n\"",(n+num));\n    }\n    return 0;\n}",ACCEPTED,40,584
1591671692999811072,d5db2853d0fce01dd43b2b6adf379841403b78fda0e6cb22c82f6f2b59da60dc,2022-11-13 13:57:58,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"main(){\n\tint i,n,s=0,s1,s2,a[20];\n\tscanf(\""%d\\n\"",&n);\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=-1;i<n;){\n\t\ts1=0;\n\t\ts2=0;\n\t\ts1=s1+a[i+3]-5;\n\t\ts2=s2+a[i+1]+a[i+2]-10;\n\t\tif(s1>s2&&i+3<n){\n\t\t\ts=s-5+a[i+3];\n\t\t\ti=i+3;\n\t\t}\n\t\telse if(i+1<n){\n\t\t\ts=s-5+a[i+1];\n\t\t\ti=i+1;\n\t\t}\n\t\telse i++;\n\t}\n\tprintf(\""%d\\n\"",s);\n\treturn 0;\n}",SEGMENTATION_FAULT,5,484
1591671694027403264,f1feb45d46abad163f730e5b023ce1df76883054d0a1741228a76c2c69aa3eda,2022-11-13 13:57:58,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main(){\n    int i,j;\n    int a[3];\n    for(i=0;i<3;i++)\n        scanf(\""%d\"",&a[i]);\n    j=a[0]+a[1];\n    if(j>a[0]+a[2])\n        j=a[0]+a[2];\n    else if(j>a[1]+a[2])\n        j=a[1]+a[2];\n    printf(\""%d\"",j);\n}",WRONG_ANSWER,18,476
1591671702973853696,e3700fa579dc7c925fa010ac870390ba9776ef5ee08f67752aeef4a9467c7624,2022-11-13 13:58:00,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n\nint n,h[100],i,j,m=0,flag;\n    scanf(\""%d\"",&n);\n    for(i=0;i<=n;i++)\n    {\n        scanf(\""%d\"",&h[i]);\n        flag=0;\n    for(j=0;j<=i;j++)\n    {\n        if(h[j]!=0)\n        {\n            flag++;\n            break;\n        }\n    }\n        if(flag==0) m=m+1;\n\n    }\n    printf(\""%d\"",m);\n    return 0;\n}\n",WRONG_ANSWER,4,196
1591671721512689664,17759f531671f838bf3fae4270190e93b6109026f9503f986c1ed85bb412007d,2022-11-13 13:58:04,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int i,n,a,b,c[30000],F[30000],sum1=0,sum2=0;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&F[i]);\n    for(i=0;i<n;i++)\n    {\n        sum1=sum1+(c[i]/(F[i]+1))*(pow(a,F[i]+1));\n        sum2=sum2+(c[i]/(F[i]+1))*(pow(b,F[i]+1));\n    }\n    printf(\""%d\"",sum1-sum2);\n}",WRONG_ANSWER,12,376
1591671730182316032,675867a135da6702ed27c0eec3e4b6d2a7d95c44854c01823fc152f0689f010d,2022-11-13 13:58:06,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#define MAX 200\nint main(void)\n{\n\tint n, a[MAX];\n\tint i;\n\tint max1, max2, temp;\n\tmax1=max2=0;\n\ttemp=0;\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++)\n\t\tscanf(\""%d\"",&a[i]);\n\t\n\t\t\tfor(i=0;i<n;i++)\n\t\t\t{\n\t\t\t\ttemp+=a[i]-5;\n\t\t\t\tif(temp<0)\n\t\t\t\t\ttemp=0;\n\t\t\t\tif(temp>max1)\n\t\t\t\t\tmax1=temp;\n\t\t\t}\n\t\t\t\n\t\t\ttemp=0;\n\t\t\tfor(i=0;i<n;i+=3)\n\t\t\t{\n\t\t\t\ttemp+=a[i]-5;\n\t\t\t\tif(temp<0)\n\t\t\t\t\ttemp=0;\n\t\t\t\tif(temp>max2){\n\t\t\t\t\tmax2=temp;\n\t\t\t\t}\t\n\t\t\t}\n\t\n\tif(max1>max2)\n\t\tprintf(\""%d\\n\"",max1);\n\telse\n\t\tprintf(\""%d\\n\"",max2);\n\t\t\n\t\n\treturn 0;\n}",SEGMENTATION_FAULT,6,360
1591671754463129600,9d0546dac18a9dc678295254e547925db086add5f872ef42d8015d525afeaf65,2022-11-13 13:58:12,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 10000\nint main()\n{\n    int num[N],i,j,n,temp;\n    int k=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&num[i]);\n    }\n    for(i=1;i<n-1;i++){\n        if(num[i]<num[i+1]){\n            k++;\n        }\n    }\n    printf(\""%d\\n\"",k);\n}",WRONG_ANSWER,8,200
1591671755599785984,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 13:58:13,Python,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"n=(int,input())\nh1,h2,h3,h4,h5,h6,h7=map(int,input().split())\nif h1<h2 and h3>h2 and h4>h2 and h5==h2 and h6>h2 and h7<2:\n    print(h2)\nai=5\ns=ai*h2\nprint(s)",NON_ZERO_EXIT_CODE,16,2776
1591671755905970176,f1feb45d46abad163f730e5b023ce1df76883054d0a1741228a76c2c69aa3eda,2022-11-13 13:58:13,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main(){\n    int i,j;\n    int a[3];\n    for(i=0;i<3;i++)\n        scanf(\""%d\"",&a[i]);\n    j=a[0]+a[1];\n    if(j>a[0]+a[2])\n        j=a[0]+a[2];\n    else if(j>a[1]+a[2])\n        j=a[1]+a[2];\n    printf(\""%d\\n\"",j);\n}",WRONG_ANSWER,28,484
1591671796695576576,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-13 13:58:22,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\nint b[100000];\nint a,i,sum,n;\n    sum=0;\nscanf(\""%d\"",&a);\nfor(i=0;i<a;i++)\n{\n    scanf(\""%d\"",&b[i]);\n}\nfor(n=0;n<a;n++)\n    {\n    if(b[n]<b[n+2])\n        sum=sum+b[n+2]-5;n+=2;\n        else\n      sum=sum+b[n]-5;\n        }\n    printf(\""%d\\n\"",sum);\n    return 0;\n    \n}\n",COMPILE_ERROR,0,0
1591671817671335936,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 13:58:27,Python,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"n=(int,input())\nh1,h2,h3,h4,h5,h6,h7=map(int,input().split())\nif h1<h2 and h3>h2 and h4>h2 and h5==h2 and h6>h2 and h7<2:\n    print(h2)\n    ai=5\ns=ai*h2\nprint(s)",NON_ZERO_EXIT_CODE,23,2760
1591671826982645760,1b00b3d29099722d8332b35e3af5e54fda309b4f7c9fc6261f618ecd2a4d7390,2022-11-13 13:58:30,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,sum=0,i,j;\n    scanf(\""%d\"",&n);\n    int h[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&h[i]);\n     for(j=1;j<=n;j++)//循环总数\n     {\n         for(i=j;i<=j;i++)\n         {\n             if(h[i+1]<h[i]&&h[i+1]<h[i+2])\n                 sum++;\n             else break;\n             if(h[i+1]==h[i]&&h[i]<h[i-1]&&h[i]<h[i+2])\n                 sum++;\n             else break;\n         }\n         }\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,18,348
1591671834423341056,9d0546dac18a9dc678295254e547925db086add5f872ef42d8015d525afeaf65,2022-11-13 13:58:31,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 10000\nint main()\n{\n    int num[N],i,j,n,temp;\n    int k=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&num[i]);\n    }\n    for(i=1;i<n-1;i++){\n        if(num[i]<num[i+1]){\n            k++;\n        }\n    }\n    printf(\""%d\\n\"",k);\n    return 0;\n}",WRONG_ANSWER,8,204
1591671846360330240,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 13:58:34,Python,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"n=(int,input())\nh1,h2,h3,h4,h5,h6,h7=map(int,input().split())\n    if h1<h2 and h3>h2 and h4>h2 and h5==h2 and h6>h2 and h7<2:\n    print(h2)\n    ai=5\ns=ai*h2\nprint(s)",NON_ZERO_EXIT_CODE,22,2892
1591671846574252032,505c5b9a1b6d591a815315d95a57743fb98dad691b51421b4de282392fef3f43,2022-11-13 13:58:34,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P,Q,R,SUM;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    if(P>=Q&&P>=R)\n    {\n        SUM=R+Q;\n    }\n    else if(Q>=P&&Q>=R)\n    {\n        SUM=P+R;\n    }\n    else if(R>=P&&R>=Q)\n    {\n        SUM=P+Q;\n    }\n    printf(\""%d\"",SUM);\n}\n",ACCEPTED,34,512
1591671847576678400,d54b7e24c90cf40d468bdeb018e61440010a1049a4ae96e2c6331c215521f91c,2022-11-13 13:58:34,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"int main()\n{\n\tint n,i,j,count=0,b;\n\tint a[n];\n\t\n\tscanf(\""%d\"",&n);\n\t\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\t\n\tfor(j=1;j<n-1;j++)\n\t{\t\n\t\tif(a[j]==a[j+1])\n\t\t{\t\n\t\t\tb++;\n            continue;\n\t\t\n\t\t}\n\t\tif(a[j]<a[j-1-b] && a[j]<a[j+1])\n\t\t{\n\t\t\tcount++;\n            b=0;\n\t\t}\n\n\t\n\t}\n\t\tprintf(\""%d\"",count);\n}",SEGMENTATION_FAULT,7,196
1591671912730996736,a5291eb67188c2a916aa5dd9fc38f2e449aa9f9a3cd047f282d8c154ea2979cd,2022-11-13 13:58:50,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,#include <iostream>\n\nusing namespace std;\nconst int N = 1e6 + 10;\nint arr[N];\n\nint main()\n{\n    int cnt = 0;\n    int n = 0;\n    cin >> n;\n    for(int i = 1;i <= n;i++)\n    {\n        cin >> arr[i];\n    }\n    \n    for(int i = 2;i <= n - 1;i++)\n    {\n        if(arr[i] - arr[i - 1] < 0)\n        {\n            int j = i + 1;\n            while(arr[j] - arr[j-1] < 0&& j <= n - 1)\n            {\n                j++;\n            }\n            while(arr[j] - arr[j - 1] == 0 && j <= n - 1)\n            {\n                j++;\n            }\n            cnt ++;\n            i = j - 1;\n        }\n    }\n    \n    cout << cnt << endl;\n    \n    return 0;\n},WRONG_ANSWER,6,604
1591671926622543872,d5db2853d0fce01dd43b2b6adf379841403b78fda0e6cb22c82f6f2b59da60dc,2022-11-13 13:58:53,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"int main(void){\n\tint i,j,n,s=0,s1,s2,a[20];\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=-1;i<n;){\n\t\ts1=0;\n\t\ts2=0;\n\t\ts1=s1+a[i+3]-5;\n\t\ts2=s2+a[i+1]+a[i+2]-10;\n\t\tif(s1>s2&&i+3<n){\n\t\t\ts=s-5+a[i+3];\n\t\t\ti=i+3;\n\t\t}\n\t\telse if(i+1<n){\n\t\t\ts=s-5+a[i+1];\n\t\t\ti=i+1;\n\t\t}\n\t\telse i++;\n\t}\n\tprintf(\""%d\"",s);\n\treturn 0;\n}",SEGMENTATION_FAULT,8,472
1591671944108597248,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 13:58:57,Python,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"n=(int,input())\nh1,h2,h3,h4,h5,h6,h7=map(int,input().split())\nai=5\ns=ai*h2\nprint(s)",NON_ZERO_EXIT_CODE,28,2916
1591672003248283648,bd8243b4b064cae986196b0eac310a36f12d46dc08f126fbdcaaca530c884eb0,2022-11-13 13:59:12,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int P,Q,R;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    if(P+Q>=P+R)\n        printf(\""%d\\n\"",P+R);\n    //if(P+R>=Q+R)\n        //printf(\""%d\\n\"",Q+R);\n    if(P+R<Q+R)\n        printf(\""%d\\n\"",P+R);\n    //if(P+Q<=Q+P)\n         //printf(\""%d\\n\"",P+Q);\n    if(P+Q>=Q+R)\n         printf(\""%d\\n\"",Q+R);\n    if(P+Q<Q+R)\n         printf(\""%d\\n\"",P+Q);\n    return 0;\n}\n",WRONG_ANSWER,9,364
1591672009338413056,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 13:59:13,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[n],sum=0,i,b=0;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i=b)\n    {\n        if(a[i]>5||a[i]>a[i+2])\n        {\n            sum=sum+a[i]-5;\n            b=b+1;\n        }\n        else\n        {\n            sum=sum+a[i+2]-5;\n            b=b+3;\n        }\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,7,220
1591672026346315776,73af9d5098be5d450fba728363c8fdbe0f6a5526466daa2f3b74abf1acf75527,2022-11-13 13:59:17,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    \n    int n,h[1000],i=0,j=0;\n    scanf(\""%d\"",&n);\n    int count=0;\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&h[i]);\n        \n    }\n    h[n-1]=0;\n        for(i=1;i<n-1;i++)\n        {\n            if(h[i]!=h[i+1]&&h[i]<h[i+1]&&h[i]<h[i-1])\n                count++;\n            if(h[i]==h[i+1]&&h[i]<h[i-1])\n                {\n                    for(j=i+1;j<n-1;j++)\n                    {\n                        if(h[j]==h[j+1])\n                            j++;\n                        else if(h[j]!=h[j+1]) \n                            continue;\n                    }\n                    i=j;\n                    if(h[i]<h[i+1])\n                        count++;\n                    \n                }\n           \n            \n        }\n    printf(\""%d\"",count);\n    return 0;\n\n}",WRONG_ANSWER,55,496
1591672037989736448,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-13 13:59:20,Python,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"n=(int,input())\nh1,h2,h3,h4,h5,h6,hn=map(int,input().split())\nai=5\ns=ai*h2\nprint(s)",NON_ZERO_EXIT_CODE,16,2888
1591672055911952384,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-13 13:59:24,Java,0.0,1591610585639407616,1591132307937943552,1049226928954454016,import java.util.Scanner;\n\npublic class Main{\n    public static void main(String[] args){\n        Scanner sc = new Scanner(System.in);\n        int n = sc.nextInt();\n        int len = sc.nextInt();\n        int l = 0;\n        int r = len-1;\n        int m =0;\n        int count = 0;\n        int[] h = new int[len];\n        \n        for(int i=0; i<len; i++){\n            h[i] = sc.nextInt();\n        }\n        \n        for(int j=0; j<len; j++){\n            m = l+r;\n            if(m < h[l+r-1] && m > h[l+r+1]){\n                count++;\n            }\n        }\n        System.out.println(count);\n    }\n},WRONG_ANSWER,109,24472
1591672075855912960,c358160a3e618a44cd693944fe10043e6372f46bf7d517c3c3f583bd85b17c5e,2022-11-13 13:59:29,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"n=int(input())\nm=input().split()\ncount=0\nfor i in range(1,n-2):\n    if int(m[i])<int(m[i+1])and int(m[i])<int(m[i-1]):\n        count=count+1\n    if int(m[i])<int(m[i-1])and int(m[i])==int(m[i+1]) and int(m[i+1])<int(m[i+2]):\n        count=count+1\nprint(count)   \n    \n",WRONG_ANSWER,93,2920
1591672113269059584,d9e00d995e65b04cda3ddef6baec19225e4351002ab4efa981f62d78919a481b,2022-11-13 13:59:38,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n;\n    int a,b;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    int c[n];\n    int f[n];\n    int i;\n    int sum=0;\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&c[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&f[i]);\n    }\n    if(a == b){\n        sum=0;\n    }else{\n         int j;\n        for(j=0;j<2;j++){\n            if(j==0){\n                for(i=0;i<n;i++)\n                {\n                    sum += c[i]/(f[i]+1) * pow(a,f[i]+1);\n                }\n            }\n            else{\n                for(i=0;i<n;i++)\n                {\n                    sum -= c[i]/(f[i]+1) * pow(b,f[i]+1);\n                }\n            }\n        } \n    }\n       \n    printf(\""%d\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,11,324
1591672124769841152,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 13:59:41,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main()\n{\n    int a,i,h=0;\n    int b[10]={0};\n    cin>>a;\n    for(i=0;i<a;i++)\n        cin>>b[i];\n    for(i=1;i<a-1;i++)\n        {\n            if(b[i]==0)\n               h++;\n        }\n        cout<<h<<endl;\n    return 0;\n}\n",RUNTIME_ERROR,5,328
1591672153232433152,c358160a3e618a44cd693944fe10043e6372f46bf7d517c3c3f583bd85b17c5e,2022-11-13 13:59:47,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"n=int(input())\nm=input().split()\ncount=0\nfor i in range(1,n-2):\n    if int(m[i])<int(m[i+1])and int(m[i])<int(m[i-1]):\n        count=count+1\n    if int(m[i])<int(m[i-1])and int(m[i])==int(m[i+1]) and int(m[i+1])<int(m[i+2]):\n        count=count+1\nprint(count)   \n    \n",WRONG_ANSWER,120,3072
1591672167203627008,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 13:59:51,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main()\n{\n    int a,i,h=0;\n    int b[10]={0};\n    cin>>a;\n    for(i=0;i<a;i++)\n        cin>>b[i];\n    for(i=1;i<a-1;i++)\n        {\n            if(b[i]==0)\n               h++;\n        }\n        cout<<h<<endl;\n    return 0;\n}\n",RUNTIME_ERROR,14,456
1591672168889737216,40c43472973ea298adbdd1d4b900aeb63cfa4cfe17179f01a4827cd2c6624d3a,2022-11-13 13:59:51,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nmain()\n{\n    int n,a,b;\n    int c[20],f[20];\n    int i,j;\n    int sum0=0,sum1=0,sum2=0,sum3=0,sumz=0;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&c[i]);\n    }\n    for(j=0;j<n;j++)\n    {\n        scanf(\""%d\"",&f[j]);\n    }\n    for(i=0;i<n;i++)\n    {\n        for(j=0;j<=i;j++)\n        {\n            if(i==j)\n            {\n              sum1=(c[i]/(f[j]+1))*pow(a,f[j]+1);\n              sum0+=sum1;\n              sum3=(c[i]/(f[j]+1))*pow(b,f[j]+1);\n              sum2+=sum3;\n            }\n            else\n                continue;\n        }\n    }\n    sumz=sum0-sum2;\n    printf(\""%d\"",sumz);\n}",WRONG_ANSWER,8,200
1591672203706654720,899c5501179552dc1fe5639f9047e15d0f835e7a87c8568193377882d0278985,2022-11-13 13:59:59,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<string.h>\nint main()\n{\n    int n,i,count=0;\n    scanf(\""%d\"",&n);\n    char s[80];\n    gets(s);\n    for(i=0;i<n;i++)\n    {\n        if(s[i]=s[i+1])\n            count+=2;\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",WRONG_ANSWER,9,356
1591672211268972544,40c43472973ea298adbdd1d4b900aeb63cfa4cfe17179f01a4827cd2c6624d3a,2022-11-13 14:00:01,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nmain()\n{\n    int n,a,b;\n    int c[20],f[20];\n    int i,j;\n    int sum0=0,sum1=0,sum2=0,sum3=0,sumz=0;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&c[i]);\n    }\n    for(j=0;j<n;j++)\n    {\n        scanf(\""%d\"",&f[j]);\n    }\n    for(i=0;i<n;i++)\n    {\n        for(j=0;j<=i;j++)\n        {\n            if(i==j)\n            {\n              sum1=(c[i]/(f[j]+1))*pow(a,f[j]+1);\n              sum0+=sum1;\n              sum3=(c[i]/(f[j]+1))*pow(b,f[j]+1);\n              sum2+=sum3;\n            }\n            else\n                continue;\n        }\n    }\n    sumz=sum0-sum2;\n    printf(\""%d\"",sumz);\n}",WRONG_ANSWER,15,480
1591672223445037056,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-13 14:00:04,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\nint b[100000];\nint a,i,sum,n;\n    sum=0;\nscanf(\""%d\"",&a);\nfor(i=0;i<a;i++)\n{\n    scanf(\""%d\"",&b[i]);\n}\nfor(n=0;n<a;n++)\n    {\n    if(b[n]<b[n+2])\n    {\n        sum=sum+b[n+2]-5;\n        n+=2;\n    }\n        else\n      sum=sum+b[n]-5;\n        }\n    printf(\""%d\\n\"",sum);\n    return 0;\n    \n}\n",WRONG_ANSWER,13,348
1591672236241903616,899c5501179552dc1fe5639f9047e15d0f835e7a87c8568193377882d0278985,2022-11-13 14:00:07,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<string.h>\nint main()\n{\n    int n,i,count=0;\n    scanf(\""%d\"",&n);\n    char s[80];\n    gets(s);\n    for(i=0;i<n;i++)\n    {\n        if(s[i]=s[i+1])\n            count+=2;\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",WRONG_ANSWER,8,196
1591672241056919552,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-13 14:00:08,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\nint main(){\n    int n,s,k,q;\n    k=q=0;\n    int sum=1;\n    scanf(\""%d\"",&n);\n    scanf(\""%d\"",&s);\n    int v=s; //储存\n    while(s!=s%10)\n    {\n        s=s/10;\n        sum++;\n    }\n    int pz=n-sum;\n    s=v;\n        for(int j=0;j<sum;j++)\n    {\n        if(s%10==1)\n            k++;\n        else q++;\n        s=s/10;\n    }\n    q=q+pz;\n    int min=(k>q)?q:k;\n    int l=2*min;\n    printf(\""%d\\n\"",l);\n    return 0;\n}",WRONG_ANSWER,6,200
1591672252922617856,c358160a3e618a44cd693944fe10043e6372f46bf7d517c3c3f583bd85b17c5e,2022-11-13 14:00:11,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"n=int(input())\nm=input().split()\ncount=0\nfor i in range(1,n-2):\n    if int(m[i])<int(m[i+1])and int(m[i])<int(m[i-1]):\n        count=count+1\n    if int(m[i])<int(m[i-1])and int(m[i])==int(m[i+1]) and int(m[i+1])<int(m[i+2]):\n        count=count+1\nprint(count)   \n    \n",WRONG_ANSWER,87,3036
1591672272283557888,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-13 14:00:16,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\nint b[100000];\nint a,i,sum,n;\n    sum=0;\nscanf(\""%d\"",&a);\nfor(i=0;i<a;i++)\n{\n    scanf(\""%d\"",&b[i]);\n}\nfor(n=0;n<a;n++)\n    {\n    if(b[n]<b[n+2])\n    {\n        sum=sum+b[n+2]-5;\n        n+=2;\n    }\n        else\n      sum=sum+b[n]-5;\n        }\n    printf(\""%d\\n\"",sum);\n    return 0;\n    \n}\n",WRONG_ANSWER,8,328
1591672289807360000,0cfbb4a339ebbc4dce13b5f3e3f98a3def0ab17ef5b4ac8e6d566de92e1f5f78,2022-11-13 14:00:20,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n[3];\n    int x;\n    int y;\n    int min=1000;\n    for(int i=0;i<3;i++){\n        scanf(\""%d\"",&n[i]);\n        if(n[i]<min){\n            min=n[i];\n            x=i;\n        }\n    }\n    y=n[x+1];\n    if(x==3){\n        y=n[0];\n    }\n    printf(\""%d\"",y+min);\n}",SEGMENTATION_FAULT,7,500
1591672297738788864,105cc8c0a5a465ab713603b461d92ac587c87767965625687540cd513f7ebb57,2022-11-13 14:00:22,C++,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<bits/stdc++.h>\n#define N 100005\n#define endl '\\n'\n#define int long long\n#define ios ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)\n\n//const int dir[4][2]={-1,0,0,1,1,0,0,-1};\n//const int mod=1e9+7;\nusing namespace std;\n\ninline int read() {\n    char c = getchar(); int num = 0, sign = 1;\n    while(c < '0' || c > '9') {if(c == '-') sign = -1; c = getchar();}\n    while(c >= '0' && c <= '9') num = num * 10 + c - '0', c = getchar();\n    return num * sign;\n}\n\nvoid solve(){\n\tint nums[N]={0};\n\t\n\tint n;\n\tcin>>n;\n\tvector<int> dp(n+1,INT_MIN);\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tcin>>nums[i];\n\t}\n\tdp[0]=0;\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tif(i-1>=0)\n\t\t\tdp[i]=max(dp[i],dp[i-1]-5+nums[i-1]);\n\t\tif(i-3>=0)\n\t\t\tdp[i]=max(dp[i],dp[i-3]-5+nums[i-1]);\n\t}\n\t\n\tfor(int i=0;i<=n;i++)\n\t{\n\t\tcout<<dp[i]<<\"" \"";\n\t}\n\t\n\t\n\t//cout<<dp[n-1];\n}\n\nsigned main() {\n\tios;\n\tint count=1;\n\t//cin>>count;\n\twhile(count--)\n\t{\n\t\tsolve();\n\t}\n\treturn 0;\n}\n",WRONG_ANSWER,10,1356
1591672345771958272,00d0a1b2e987c17fb50850b9ec54bf6b4f8b997eb053d1a9fed6c4888fbe74ed,2022-11-13 14:00:33,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int a[3],i,j,c[a[0]],d[a[0]],x=0,y=0,sum,z;\n    for (i=0;i<3;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<a[0];i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=0;i<a[0];i++)\n        scanf(\""%d\"",&d[i]);\n    for(i=0;i<a[0];i++)\n    {\n        z=1\n        for(j=0;j<d[i]+1)\n            z=z*a[1]\n        x=x+(c[i]/(d[i]+1))*z;\n    }\n    for(i=0;i<a[0];i++)\n    {       \n        z=1z\n        for(j=0;j<d[i]+1)\n            z=z*a[2]\n        y=y+(c[i]/(d[i]+1))*z);\n    sum=x-y;\n    printf(\""%d\\n\"",sum);\n    return 0;\n}",COMPILE_ERROR,0,0
1591672351132233728,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-13 14:00:35,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\nint b[100000];\nint a,i,sum,n;\n    sum=0;\nscanf(\""%d\"",&a);\nfor(i=0;i<a;i++)\n{\n    scanf(\""%d\"",&b[i]);\n}\nfor(n=0;n<a;n++)\n    {\n    if(b[n]<b[n+2])\n    {\n        sum=sum+b[n+2]-5;\n        n+=2;\n    }\n        else\n      sum=sum+b[n]-5;\n        }\n    printf(\""%d\\n\"",sum);\n    return 0;\n    \n}\n",WRONG_ANSWER,11,324
1591672384518938624,55950e2d4c314feed0856fa0f6b80f22c5c36f2ebe0d75c8ee2cadb1a06b2fe1,2022-11-13 14:00:42,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int n,a,b,c[100],i,d[100],an,bn,cn,k;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&c[i]);\n        scanf(\""%d\"",&d[i]);\n        an=an+(((c[i])/(d[i]+1))*pow(a,d[i]+1));\n        bn=bn+(((c[i])/(d[i]+1))*pow(b,d[i]+1));\n\n\n\n\n\n    }\n    cn=an-bn;\n\n\n\n\n\n\n\n\n\n\n\n\n    printf(\""%d\"",cn);\n\n\n\n\n\n\n\n\n\n\n\n    return 0;\n}",WRONG_ANSWER,7,192
1591672427745390592,f6233bf69e5717913375f818af07214d1d2de6df0cd3bcb24368fbde112d6d15,2022-11-13 14:00:53,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,print(4),WRONG_ANSWER,22,2892
1591672444208033792,e9a50f3e071443bb6fb229966bff355c178d484f6cc10e5e1fc8dc5a537237ba,2022-11-13 14:00:57,C,300.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int i,j,c;\n    float a[3],sum=0,max,max1;\n    float k;\n    for(i=0;i<3;i++)\n        scanf(\""%f\"",&a[i]);\n    c=a[0];\n    float b[c][c];\n    for(i=0;i<c;i++)\n        for(j=0;j<c;j++)\n    {\n        scanf(\""%f\"",&b[i][j]);\n    }\n   /* for(i=0;i<c;i++)\n   {\n       for(j=0;j<c;j++)\n    {\n        printf(\""%d\"",b[i][j]);\n    }\n    printf(\""\\n\"");\n   }*/\n      for(i=0;i<c;i++)\n    {\n        max=pow(a[1],b[1][i]+1)-pow(a[2],b[1][i]+1);\n       // printf(\""%d\\n\"",max);\n        k=b[0][i]/(b[1][i]+1);\n       // printf(\""%d \\n\"",k);\n        sum=sum+max*k;\n    }\n    printf(\""%d\\n\"",(int)sum);\n}\n",ACCEPTED,36,472
1591672455117463552,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-13 14:00:59,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\nint b[100000];\nint a,i,sum,n;\n    sum=0;\nscanf(\""%d\"",&a);\nfor(i=0;i<a;i++)\n{\n    scanf(\""%d\"",&b[i]);\n}\nfor(n=0;n<a;n++)\n    {\n    if(b[n]<b[n+2])\n    {\n        sum=sum+b[n+2]-5;\n        n+=2;\n    }\n        else\n        {\n      sum=sum+b[n]-5;\n        }}\n    printf(\""%d\\n\"",sum);\n    return 0;\n    \n}\n",WRONG_ANSWER,6,324
1591672460377088000,2bc6a85c0376656012a7970a7842a2a9d8769555a79ef4eec85ff45aa30ff7b7,2022-11-13 14:01:01,Java,300.0,1591610585639407616,1591132307937943552,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint num = sc.nextInt();\n\t\tint[] arr = new int[num];\n\t\tfor(int i = 0; i < num; ++i) {\n\t\t\tarr[i] = sc.nextInt();\n\t\t}\n\t\tint count = 0;\n\t\tint state = 0;\n\t\tfor(int i = 1; i < num; ++i) {\n\t\t\tif(arr[i-1] < arr[i] && state==0) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif(arr[i-1] > arr[i] && state==0){\n\t\t\t\tstate = 1;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif(arr[i-1] < arr[i] && state==1) {\n\t\t\t\tstate=0;\n\t\t\t\tcount++;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif(arr[i-1] == arr[i] && state==1) {\n\t\t\t\tstate=2;\n\t\t\t}\n\t\t\tif(state==2) {\n\t\t\t\tstate=0;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.print(count);\n\t}\n},ACCEPTED,574,25888
1591672484423020544,5a1c17b308a3b3595833d34c6bdfb75e9f5dd0d065acfeb7f28ab8102ba7406c,2022-11-13 14:01:06,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a[100]={0};\n    int i,n;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    int count = 0;\n    for(i=1;i<n-1;i++){\n        if(a[i]<a[i-1]&&a[i]<a[i+1]){\n            count++;\n            }\n        while(a[i]==a[i+1]&&a[i-1]>a[i]){\n            if(i>n-3){\n                break;\n            }\n            if(a[i+1]<a[i+2]){\n                count = count+1;\n                break;\n            }\n            i++;\n        }\n    }\n    printf(\""%d\"",count);\n    return 0;\n}\n",RUNTIME_ERROR,25,348
1591672487161901056,a5291eb67188c2a916aa5dd9fc38f2e449aa9f9a3cd047f282d8c154ea2979cd,2022-11-13 14:01:07,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,#include <iostream>\n\nusing namespace std;\nconst int N = 1e6 + 10;\nint arr[N];\n\nint main()\n{\n    int cnt = 0;\n    int n = 0;\n    cin >> n;\n    for(int i = 1;i <= n;i++)\n    {\n        cin >> arr[i];\n    }\n    \n    for(int i = 2;i <= n - 1;i++)\n    {\n        if(arr[i] - arr[i - 1] < 0)\n        {\n            int j = i + 1;\n            while(arr[j] - arr[j-1] < 0&& j <= n - 1)\n            {\n                j++;\n            }\n            if(arr[j] - arr[j - 1] == 0)\n            {\n                while(arr[j] - arr[j - 1] == 0 && j <= n - 1)\n                {\n                    j++;\n                }\n            }\n            cnt ++;\n            i = j - 1;\n        }\n    }\n    \n    cout << cnt << endl;\n    \n    return 0;\n},WRONG_ANSWER,5,452
1591672491050065920,63a19c717d077fecd1be96314929ebf3516f35619209eacac77081bb07edebb5,2022-11-13 14:01:08,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include<math.h>\n#include<string.h>\nint main()\n{\n   int i,j=0,n,sum=0;\n   scanf(\""%d\"",&n);\n   int a[n];\n   for(i=1;i<=n;i++)\n     scanf(\""%d\"",&a[i]);\n   while(j<n){\n     if(abs(a[j+3])>=abs(a[j+1])&&j+3<=n&&j+1<=n){\n          sum+=a[j+3]-5;\n          j=j+3;\n        }\n     else{\n         sum+=a[j+1]-5;\n         j=j+1;\n     }\n     }\n     printf(\""%d\"",sum);\n}\n",WRONG_ANSWER,5,356
1591672512541646848,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 14:01:13,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main()\n{\n    int a,i,h=0;\n    int b[10]={0};\n    cin>>a;\n    for(i=0;i<a;i++)\n        cin>>b[i];\n    i=0;\n    for(i=1;i<a-1;i++)\n        {\n            if(b[i]==0)\n               h++;\n        }\n        cout<<h<<endl;\n    return 0;\n}\n",RUNTIME_ERROR,8,312
1591672541377519616,da72e985b1ff1737d155282af7dd43e3dc341605cc356d114979edd4fea85a11,2022-11-13 14:01:20,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#define MAX 20\nint main() {\n    int arr[100],n,i,t=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&arr[i]);\n    for(i=1;i<n-1;i++) {\n        if(arr[i]<arr[i-1]&&arr[i]<=arr[i+1])\n            t++;\n    }\n    printf(\""%d\"",t);\n    return 0;\n}",RUNTIME_ERROR,27,348
1591672542002425856,105cc8c0a5a465ab713603b461d92ac587c87767965625687540cd513f7ebb57,2022-11-13 14:01:20,C++,300.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<bits/stdc++.h>\n#define N 100005\n#define endl '\\n'\n#define int long long\n#define ios ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)\n\n//const int dir[4][2]={-1,0,0,1,1,0,0,-1};\n//const int mod=1e9+7;\nusing namespace std;\n\ninline int read() {\n    char c = getchar(); int num = 0, sign = 1;\n    while(c < '0' || c > '9') {if(c == '-') sign = -1; c = getchar();}\n    while(c >= '0' && c <= '9') num = num * 10 + c - '0', c = getchar();\n    return num * sign;\n}\n\nvoid solve(){\n\tint nums[N]={0};\n\t\n\tint n;\n\tcin>>n;\n\tvector<int> dp(n+1,INT_MIN);\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tcin>>nums[i];\n\t}\n\tdp[0]=0;\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tif(i-1>=0)\n\t\t\tdp[i]=max(dp[i],dp[i-1]-5+nums[i-1]);\n\t\tif(i-3>=0)\n\t\t\tdp[i]=max(dp[i],dp[i-3]-5+nums[i-1]);\n\t}\n\t\n\tcout<<dp[n];\n\t\n\t\n\t//cout<<dp[n-1];\n}\n\nsigned main() {\n\tios;\n\tint count=1;\n\t//cin>>count;\n\twhile(count--)\n\t{\n\t\tsolve();\n\t}\n\treturn 0;\n}\n",ACCEPTED,36,1500
1591672579449217024,1b00b3d29099722d8332b35e3af5e54fda309b4f7c9fc6261f618ecd2a4d7390,2022-11-13 14:01:29,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,sum=0,i,j;\n    scanf(\""%d\"",&n);\n    int h[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&h[i]);\n    for(i=1;i<n;i++)\n         {\n             if(h[i+1]>h[i]&&h[i]<h[i-1])\n                 sum++;\n             if(h[i+1]==h[i]&&h[i]<h[i-1]&&h[i]<h[i+1])\n                 sum++;\n         }\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,10,356
1591672593051344896,a57fdafe4877cd9608fc0ac8a5120a47bc60a015785960e61b67b4e66187c2f2,2022-11-13 14:01:32,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 100\nint main(){\n    int i,n,j=0;\n    int a[N];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    if(a[0]!=0||a[n-1]!=0)\n        return 0;\n    else{\n        for(i=1;i<n;i++){\n        if(a[i]<a[i+1])\n            j++;\n    }\n    printf(\""%d\\n\"",j);\n    }\n    return 0;\n}",WRONG_ANSWER,5,208
1591672615276961792,345826d11b41befc23adeb536e81da8eb6ec9a8bfb9448acf91422deedb8ba4a,2022-11-13 14:01:37,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,n,count=0,j;\n    scanf(\""%d\"",&n);\n    char s[n];\n    for(i=0;i<n;)\n       {\n           s[i]=getchar();\n           if(s[i]=='0'||s[i]=='1')\n            i++;\n       }\n\n    for(i=0;i<n;)\n    {\n        if(s[i]!=s[i+1])\n            {\n               for(j=i;j<=n;j++)\n                    s[j]=s[j+2];\n                i=0;\n                count+=2;\n            }\n            else\n                i=i+1;\n    }\n    printf(\""%d\\n\"",count);\n}\n",TIME_LIMIT_EXCEEDED,400,356
1591672626760966144,f1feb45d46abad163f730e5b023ce1df76883054d0a1741228a76c2c69aa3eda,2022-11-13 14:01:40,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main(){\n    int i,j,k,n;\n    scanf(\""%d %d %d\"",&i,&j,&k);\n    n=i+j;\n    if(n>i+k)\n        n=i+k;\n    else if(n>j+k)\n        n=j+k;\n    printf(\""%d\\n\"",n);\n}",WRONG_ANSWER,22,476
1591672684730408960,6ba5ecacf3381a1e9382f99c413290eca40a071a563a618e5f36d66cbf9a5e1b,2022-11-13 14:01:54,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<iostream>\n\nusing namespace std;\n\nint main(){\nint n;\nint flag=3;\nlong imax=0,sum=0;\ncin>>n;\nlong h[n];\nfor(int i=0;i<n;i++){\n    cin>>h[i];\n}\n\nfor(int i=0;i<n;i++)\n{\n    for(int j=i;j<n;j++){\n        if(h[j]>=h[i])\n            flag=1;\n        else\n            flag=0;\n        if(flag==0){\n        sum=h[i]*(j-i);\n        //cout<<sum<<endl;\n        if(imax<sum)\n            imax=sum;\n        break;\n        }\n        if(flag==1 && j==n-1){\n            sum=h[i]*(j-i+1);\n            //cout<<sum<<endl;\n        if(imax<sum)\n\n            imax=sum;\n        break;\n        }\n    }\n}\ncout<<imax<<endl;\n}",WRONG_ANSWER,29,504
1591672687746146304,c39a4349139942a7aa7456b2c4609f8d0f9d0d3465be213d33870ec87eab1e58,2022-11-13 14:01:55,C++,0.0,1591610585635213314,1591128862958940160,1049226928954454016,"#include <stdio.h>\nint main(void) \n{\n\tint n,a[100],i,j,c;\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n-1;i++)\n\t{\n\t\tscanf(\""%d\"",&a[i]); \n\t}\n for(i=0;i<n-1;i++)\n     for(j=1;j<n-1-i;j++)\n {\n     if(a[i]<a[j])\n     {\n       c=a[j];\n         a[j]=a[i];\n         a[i]=c;  \n     }\n         else\n             continue;\n }\n    \n    printf(\""%d \"",n);\n    for(i=0;i<n-1;i++)\n        printf(\""%d \"",a[i]);\n    return 0;\n}",SEGMENTATION_FAULT,6,348
1591672707505467392,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-13 14:01:59,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\nint b[100000];\nint a,i,sum,n;\n    sum=0;\nscanf(\""%d\"",&a);\nfor(i=0;i<a;i++)\n{\n    scanf(\""%d\"",&b[i]);\n}\nfor(n=0;n<a;n++)\n    {\n    if(b[n]<b[n+2])\n    {\n        sum=sum+b[n+2]-5;\n        n+=2;\n    }\n        else\n        {\n      sum=sum+b[n]-5;\n        }}\n    printf(\""%d\\n\"",sum);\n    return 0;\n    \n}\n",WRONG_ANSWER,7,332
1591672712299569152,fa305ee4bf4c6a54add4e945b551f1e902b95c1a179a91ded55bf7ebb1c87c23,2022-11-13 14:02:01,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{  int n,i,x=0;\n  scanf(\""%d\"",&n);\n  int s[n];\n  for(i=0;i<n;i++){\n    scanf(\""%d\"",&s[i]);\n  }\n  for(i=1;i<n-1;i++){\n    if(s[i]!=s[i+1]){\n    if(s[i]<s[i-1]&&s[i]<s[i+1]) x++;\n  }\n\n  else  {if(s[i]<s[i-1]&&s[i]<s[i+2]) x++;}\n  }\n   printf(\""%d\\n\"",x);\n    return 0;\n}",WRONG_ANSWER,35,344
1591672713327206400,00d0a1b2e987c17fb50850b9ec54bf6b4f8b997eb053d1a9fed6c4888fbe74ed,2022-11-13 14:02:01,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int a[3],i,j,c[a[0]],d[a[0]],x=0,y=0,sum,z;\n    for (i=0;i<3;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<a[0];i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=0;i<a[0];i++)\n        scanf(\""%d\"",&d[i]);\n    for(i=0;i<a[0];i++)\n    {\n        z=1;\n        for(j=0;j<d[i]+1;j++)\n            z=z*a[1];\n        x=x+(c[i]/(d[i]+1))*z;\n    }\n    for(i=0;i<a[0];i++)\n    {\n        z=1;\n        for(j=0;j<d[i]+1;j++)\n            z=z*a[2];\n        y=y+(c[i]/(d[i]+1))*z;\n    }\n    sum=x-y;\n    printf(\""%d\\n\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,7,360
1591672790485577728,1b00b3d29099722d8332b35e3af5e54fda309b4f7c9fc6261f618ecd2a4d7390,2022-11-13 14:02:19,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,sum=0,i,j;\n    scanf(\""%d\"",&n);\n    int h[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&h[i]);\n    for(i=1;i<n;i++)\n         {\n             if(h[i+1]>h[i]&&h[i]<h[i-1])\n                 sum++;\n             if(h[i+1]==h[i]&&h[i]<h[i-1]&&h[i]<h[i+2])\n                 sum++;\n         }\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,8,200
1591672841844830208,1f29a576db974352c60cbe8aafdc4e5328b24d800890ab1c712d8c9fa85d72cc,2022-11-13 14:02:32,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint a[n],i,j;\n\tfor(i=0;i<n;i++)\n\tscanf(\""%d\"",&a[i]);\n\t\n\tint hell=0;\n\tfor(i=0;i<n-1;i++)\n\t{\n\t    if(a[i]<a[i+1])\n\t        hell=hell+1;\n\t    if(a[i]<a[i+1]&&a[i+1]<a[i+2]) hell=hell-1;\n    }\n\t\tprintf(\""%d\"",hell-1);\n\treturn 0;\n } ",ACCEPTED,36,512
1591672845418389504,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 14:02:32,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main()\n{\n    int a,i,h=0;\n    int b[100]={0};\n    cin>>a;\n    for(i=0;i<a;i++)\n        cin>>b[i];\n    for(i=1;i<a-1;i++)\n        {\n            if(b[i]==0)\n               h++;\n        }\n        cout<<h<<endl;\n    return 0;\n}\n",WRONG_ANSWER,6,604
1591672852301275136,acf80eea856463058b81f71c0238069795893092293fbd098cc594959df6444e,2022-11-13 14:02:34,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,n=int(input())\ns=input().split()\nh=0\nfor i in range(1，n-1):\n    if s[i]<s[i-1] and s[i]<s[i+1] :\n        h=h+1\n    elif s[i]<s[i-1] and s[i]==s[i+1]:\n        if s[i+1]<s[i+2]:\n            h=h+1\n    else:\n        h=h+0\n\nprint(h)\n    ,NON_ZERO_EXIT_CODE,21,2764
1591672871406284800,f1feb45d46abad163f730e5b023ce1df76883054d0a1741228a76c2c69aa3eda,2022-11-13 14:02:39,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main(){\n    int i,j,k,n;\n    scanf(\""%d %d %d\"",&i,&j,&k);\n    n=i+j;\n    if(n>i+k)\n        n=i+k;\n    else if(n>j+k)\n        n=j+k;\n    printf(\""%d\\n\"",n);\n}",WRONG_ANSWER,21,500
1591672922576838656,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 14:02:51,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main()\n{\n    int a,i,h=0;\n    int b[50]={0};\n    cin>>a;\n    for(i=0;i<a;i++)\n        cin>>b[i];\n    for(i=1;i<a-1;i++)\n        {\n            if(b[i]==0)\n               h++;\n        }\n        cout<<h<<endl;\n    return 0;\n}\n",WRONG_ANSWER,6,324
1591672928931164160,f6233bf69e5717913375f818af07214d1d2de6df0cd3bcb24368fbde112d6d15,2022-11-13 14:02:52,Python,0.0,1591610585635213315,1591129345182261248,1049226928954454016,print(16),WRONG_ANSWER,19,2892
1591672935591718912,f1feb45d46abad163f730e5b023ce1df76883054d0a1741228a76c2c69aa3eda,2022-11-13 14:02:54,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main(){\n    int i,j,k,n;\n    scanf(\""%d %d %d\"",&i,&j,&k);\n    n=i+j;\n    if(n>i+k)\n        n=i+k;\n    else if(n>j+k)\n        n=j+k;\n    printf(\""%d\\n\"",n);\n    return 0;\n}",WRONG_ANSWER,27,512
1591672947486810112,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-13 14:02:57,C++,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int N=10005;\nll a[N];\n//ll dp[N][N];\nint main(){\nint n;\ncin>>n;\nint cnt=0;\nfor(int i=1;i<=n;i++)\ncin>>a[i];\na[0]=0;\n//dp[0][0]=0;\nfor(int i=0;i<n;i++){\n\tif(a[i+1]>5)\n\tcnt+=a[i+1]-5;\n\telse{\n\tcnt+=max(a[i+1],a[i+3])-5;\n\tif(a[i+3]>a[i+1])\n\ti+=2;\n}\n}\ncout<<cnt;\n\treturn 0;\n} ",WRONG_ANSWER,8,584
1591672962590453760,17759f531671f838bf3fae4270190e93b6109026f9503f986c1ed85bb412007d,2022-11-13 14:03:00,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int i,n,a,b,c[30000],F[30000],sum1=0,sum2=0;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&F[i]);\n    for(i=0;i<n;i++)\n    {\n        sum1=sum1+(c[i]/(F[i]+1))*(pow(a,F[i]+1));\n        sum2=sum2+(c[i]/(F[i]+1))*(pow(b,F[i]+1));\n    }\n    printf(\""%d\"",sum1-sum2);\n}",WRONG_ANSWER,9,500
1591672978990227456,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-13 14:03:04,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n\nint main()\n\n{\n\n    int count=0,a[10000],n,i;\n\n    scanf(\""%d\"",&n);\n\n    for(i=0;i<n;i++)\n\n    scanf(\""%d\"",&a[i]);\n\n    for(i=0;i<n-2;i++)\n\n    {\n\n    if(a[i]>a[i+1]&&a[i+1]<a[i+2])\n\n    count++;\n\n    else if(a[i]==a[i+1])\n\n    if(a[i-1]>a[i]&&a[i+2]>=a[i+1])\n\n    count++;\n\n    }\n\n    printf(\""%d\"",count);\n\n    return 0;\n\n}",ACCEPTED,32,512
1591672979967467520,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 14:03:04,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main()\n{\n    int a,i,h=0;\n    int b[50]={0};\n    cin>>a;\n    for(i=0;i<a;i++)\n        cin>>b[i];\n    for(i=1;i<a-1;i++)\n        {\n            if(b[i]==0)\n               h++;\n        }\n        cout<<h;\n    return 0;\n}\n",WRONG_ANSWER,5,324
1591673002134364160,40c43472973ea298adbdd1d4b900aeb63cfa4cfe17179f01a4827cd2c6624d3a,2022-11-13 14:03:10,C,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#inclde <stdio.h>\nmain()\n{\n    printf(\""60\"");\n}",COMPILE_ERROR,0,0
1591673010954985472,f1feb45d46abad163f730e5b023ce1df76883054d0a1741228a76c2c69aa3eda,2022-11-13 14:03:12,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main(){\n    int i,j,k,n;\n    scanf(\""%d %d %d\"",&i,&j,&k);\n    n=i+j;\n    if(n>i+k)\n        n=i+k;\n    else if(n>j+k)\n        n=j+k;\n    printf(\""%d\\n\"",n);\n    return 0;\n}",WRONG_ANSWER,23,332
1591673027367284736,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 14:03:16,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i;\n    int sum=0;\n    int t=0;\n    scanf(\""%d\"",&n);\n        int a[n];\n    for(i=0;i<n;i++)\n    {\n        if(a[i]>a[i+2])\n        {\n            sum=sum+a[i]-5;\n            t=t+1;\n        }\n        else\n        {\n            sum=sum+a[i+2]-5;\n            b=b+3;\n        }\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",COMPILE_ERROR,0,0
1591673052730253312,64475a8ecd7d5a6c6e734f3f299283e039c26933b2a0e510cd9d22e95ba92068,2022-11-13 14:03:22,C++,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <bits/stdc++.h> \nusing namespace std;\n\nint main()\n{\n\tint n,ans = 0;\n\tchar a[1000010];\n\tint vis[1000010];\n\t\n\tcin>>n;\n\tfor(int i = 0; i < n; i++)\n\tcin>>a[i];\n\t\n\n\tfor(int i = 0; i < n; i++)\n\t{\n\t\tfor(int j = 0; j < n-1; j++)\n\t\t{\n\t\t\tif(vis[j]==1)\n\t\t\tcontinue;\n\t\t\telse\n\t\t\t{\n\t\t\t\tvis[j] = 1;\n\t\t\t\twhile(vis[j+1]==1)\n\t\t\t\t{\n\t\t\t\t\tj++;\n\t\t\t\t}\n\t\t\t\tvis[j] = 1;\n\t\t\t\tans++; \n\t\t\t}\n\t\t}\n\t}\n\tcout<<ans+1;\n\t\n\treturn 0;\n}",WRONG_ANSWER,8,468
1591673055339143168,a5291eb67188c2a916aa5dd9fc38f2e449aa9f9a3cd047f282d8c154ea2979cd,2022-11-13 14:03:22,C++,300.0,1591610585639407616,1591132307937943552,1049226928954454016,#include <iostream>\n\nusing namespace std;\nconst int N = 1e6 + 10;\nint arr[N];\n\nint main()\n{\n    int cnt = 0;\n    int n = 0;\n    cin >> n;\n    for(int i = 1;i <= n;i++)\n    {\n        cin >> arr[i];\n    }\n    \n    for(int i = 2;i <= n - 1;i++)\n    {\n        if(arr[i] - arr[i - 1] < 0)\n        {\n            int j = i + 1;\n            while(arr[j] - arr[j-1] < 0&& j <= n - 1)\n            {\n                j++;\n            }\n            while(arr[j] - arr[j - 1] == 0 && j <= n - 1)\n            {\n                j++;\n            }\n            if(arr[j] - arr[j-1] > 0)\n            {\n                i = j - 1;\n                cnt++;\n            }\n        }\n    }\n    \n    cout << cnt << endl;\n    \n    return 0;\n},ACCEPTED,37,472
1591673064050679808,05f9d62a2660f27e0711448c225e5e0fe6347745a2c93edb6296c0a2ffbc6605,2022-11-13 14:03:24,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nmain()\n{\n    int n,a,b,p[10000],q[10000];\n\tdouble sum1=0.0,sum2=0.0;\n    int i,m,j;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&p[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&q[i]);\n        for(m=0;m<n;m++)\n            {\n\t\t\tsum1+=((1.0*(p[m]/(q[m]+1)))*pow(a,q[m]+1));\n\t\t\tprintf(\""%d\\n\"",sum1);\n\t\t\t}\n        for(j=0;j<n;j++)\n            sum2+=((1.0*(p[j]/(q[j]+1)))*pow(b,q[j]+1));\n    printf(\""%.0lf\"",sum1-sum2);\n}",WRONG_ANSWER,11,200
1591673068844769280,a57fdafe4877cd9608fc0ac8a5120a47bc60a015785960e61b67b4e66187c2f2,2022-11-13 14:03:26,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 100\nint main(){\n    int i,n,j=0;\n    int a[N];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n        if(a[i]!=0||a[i]!=2)\n            break;\n            return 0;\n    }\n    if(a[0]!=0||a[n-1]!=0)\n        return 0;\n    else{\n        for(i=1;i<n;i++){\n        if(a[i]<a[i+1])\n            j++;\n    }\n    printf(\""%d\\n\"",j);\n    }\n    return 0;\n}",WRONG_ANSWER,10,360
1591673073936654336,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 14:03:27,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i;\n    int sum=0;\n    int t=0;\n    scanf(\""%d\"",&n);\n        int a[n];\n    for(i=0;i<n;i++)\n    {\n        if(a[i]>a[i+2])\n        {\n            sum=sum+a[i]-5;\n            t=t+1;\n        }\n        else\n        {\n            sum=sum+a[i+2]-5;\n            t=t+3;\n        }\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,9,468
1591673084883820544,f6233bf69e5717913375f818af07214d1d2de6df0cd3bcb24368fbde112d6d15,2022-11-13 14:03:29,Python,0.0,1591610585639407617,1591132482555211776,1049226928954454016,print(15),WRONG_ANSWER,20,2764
1591673087521992704,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-13 14:03:30,Python,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"l = int(input())\ndata = list(map(int,input().split()))\nyes = 0\ni=1\nwhile i<l-2:\n    h = data[i]\n    if h<data[i+1]and h<=data[i-1]:\n        yes+=1\n        i=i+2\n    else:\n        i=i+1\n    \nprint(yes)",ACCEPTED,88,3028
1591673156736442368,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 14:03:47,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,i,h=0;\n    int b[50];\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=1;i<a-1;i++)\n        {\n            if(b[i]==0)\n               h++;\n        }\n        printf(\""%d\\n\"",h);\n    return 0;\n}\n",WRONG_ANSWER,9,200
1591673192769675264,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-13 14:03:55,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\nint b[1000000];\nint a,i,sum,n;\n    sum=0;\nscanf(\""%d\"",&a);\nfor(i=0;i<a;i++)\n{\n    scanf(\""%d\"",&b[i]);\n}\nfor(n=0;n<a;n++)\n    {\n    if(b[n]<b[n+2])\n    {\n        sum=sum+b[n+2]-5;\n        n+=2;\n    }\n        else\n        {\n      sum=sum+b[n]-5;\n        }}\n    printf(\""%d\\n\"",sum);\n    return 0;\n    \n}\n",WRONG_ANSWER,8,324
1591673206178865152,40c43472973ea298adbdd1d4b900aeb63cfa4cfe17179f01a4827cd2c6624d3a,2022-11-13 14:03:58,C,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    printf(\""60\"");\n}",ACCEPTED,15,384
1591673217583177728,675867a135da6702ed27c0eec3e4b6d2a7d95c44854c01823fc152f0689f010d,2022-11-13 14:04:01,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#define MAX 10000\nint main(void)\n{\n\tint n, a[MAX];\n\tint i;\n\tint max1, max2, temp;\n\tmax1=max2=0;\n\ttemp=0;\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++)\n\t\tscanf(\""%d\"",&a[i]);\n\t\n\t\t\tfor(i=0;i<n;i++)\n\t\t\t{\n\t\t\t\ttemp+=a[i]-5;\n\t\t\t\tif(temp<0)\n\t\t\t\t\ttemp=0;\n\t\t\t\tif(temp>max1)\n\t\t\t\t\tmax1=temp;\n\t\t\t}\n\t\t\t\n\t\t\ttemp=0;\n\t\t\tfor(i=0;i<n;i+=3)\n\t\t\t{\n\t\t\t\ttemp+=a[i]-5;\n\t\t\t\tif(temp<0)\n\t\t\t\t\ttemp=0;\n\t\t\t\tif(temp>max2){\n\t\t\t\t\tmax2=temp;\n\t\t\t\t}\t\n\t\t\t}\n\t\n\tif(max1>max2)\n\t\tprintf(\""%d\\n\"",max1);\n\telse\n\t\tprintf(\""%d\\n\"",max2);\n\t\t\n\t\n\treturn 0;\n}",WRONG_ANSWER,5,356
1591673229876715520,1b00b3d29099722d8332b35e3af5e54fda309b4f7c9fc6261f618ecd2a4d7390,2022-11-13 14:04:04,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,sum=0,i;\n    scanf(\""%d\"",&n);\n    int h[10000];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&h[i]);\n    for(i=1;i<n;i++)\n         {\n             if(h[i+1]>h[i]&&h[i]<h[i-1])\n                 sum++;\n             if(h[i+1]==h[i]&&h[i]<h[i-1]&&h[i]<h[i+2])\n                 sum++;\n         }\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,31,356
1591673264727154688,f6233bf69e5717913375f818af07214d1d2de6df0cd3bcb24368fbde112d6d15,2022-11-13 14:04:12,Python,0.0,1591610585635213319,1591131955016622080,1049226928954454016,print(10)\nprint(0)\nprint(4),WRONG_ANSWER,19,2816
1591673302995984384,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-13 14:04:21,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,n;\n    char s[10];\n    int sum1=0,sum2=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&s[i]);\n    }\n    for(i=0;i<n;i++)\n       {\n           if(s[i]>0)\n               sum1++;\n           else\n               sum2++;\n       }\n     \n    if(sum1>sum2)\n        printf(\""%d\"",sum2*2);\n    else\n        printf(\""%d\"",sum1*2);\n       \n    \n    return 0;\n   \n}",WRONG_ANSWER,6,476
1591673324525379584,9a1ecd1db02b268060006afd7de34ec54e74e90bf61becbb6811fb23971c4720,2022-11-13 14:04:27,Python,300.0,1591610585635213317,1591130976212869120,1049226928954454016,"n,a,b=map(int,input().split())\nc=list(map(int,input().split()))\nf=list(map(int,input().split()))\ny=0\nz=0\nfor i in range(n):\n    y+=c[i]/(f[i]+1)*a**(f[i]+1)\n    z+=c[i]/(f[i]+1)*b**(f[i]+1)\nprint(int(y-z))\n",ACCEPTED,94,2916
1591673350098051072,157388d8d83262bba5955406e39bb36c3baacd3a224f63ce1739541bb582af20,2022-11-13 14:04:33,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int P,Q,R;\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    if(P+Q>P+R)\n    printf(\""%d\"",P+R);\n    else if(P+Q>Q+R)\n        printf(\""%d\"",Q+R);\n    else \n        printf(\""%d\"",P+Q);\n}",WRONG_ANSWER,20,324
1591673362047623168,1b00b3d29099722d8332b35e3af5e54fda309b4f7c9fc6261f618ecd2a4d7390,2022-11-13 14:04:36,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,sum=0,i;\n    scanf(\""%d\"",&n);\n    int h[10000];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&h[i]);\n    for(i=1;i<n-1;i++)\n         {\n             if(h[i+1]>h[i]&&h[i]<h[i-1])\n                 sum++;\n             if(h[i+1]==h[i]&&h[i]<h[i-1]&&h[i]<h[i+2])\n                 sum++;\n         }\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,28,348
1591673367483441152,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 14:04:37,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <string.h>\nint main()\n{\n    int k,len,i,g=0,l=0;\n    char str[20] = {0};\n    if(scanf(\""%d\"",&k)==1){}\n    if(scanf(\""%s\"",str)==1)\n    {}\n    len  = strlen(str);\n    for(i=0;i<len;i++)\n    {\n        if(str[i]=='0')\n        g++;\n        else\n        l++;\n    }\n    //g-=8;//0的个数;\n    //l-=52;//1的个数;\n    if(g>l)\n    printf(\""%d\\n\"",2*l);\n    else\n    printf(\""%d\\n\"",2*g);\n    return 0;\n}\n\n",RUNTIME_ERROR,5,328
1591673388324904960,1f15b5b41f9e61f2d767bcb1ae88bef60c94b97dd423bfd2ba9c8c0e8e9d05bb,2022-11-13 14:04:42,Java,0.0,1591610585635213315,1591129345182261248,1049226928954454016,import java.util.Scanner;\npublic class Main{\n    public static void main(String args[]){\n        Scanner sc=new Scanner(System.in);\n        int n=sc.nextInt();\n        int[] Arry=new int[n];\n        int x=0;\n        int y=x+3;\n        int z=x+1;\n        for(int i=0;i<Arry.length;i++){\n            Arry[i]=sc.nextInt();\n        }\n      \n        \n    }\n},WRONG_ANSWER,318,43052
1591673397527195648,1f15b5b41f9e61f2d767bcb1ae88bef60c94b97dd423bfd2ba9c8c0e8e9d05bb,2022-11-13 14:04:44,Java,0.0,1591610585635213315,1591129345182261248,1049226928954454016,import java.util.Scanner;\npublic class Main{\n    public static void main(String args[]){\n        Scanner sc=new Scanner(System.in);\n        int n=sc.nextInt();\n        int[] Arry=new int[n];\n        int x=0;\n        int y=x+3;\n        int z=x+1;\n        for(int i=0;i<Arry.length;i++){\n            Arry[i]=sc.nextInt();\n        }\n      \n        \n    }\n},WRONG_ANSWER,322,44072
1591673400937177088,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 14:04:45,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <string.h>\nint main()\n{\n    int k,len,i,g=0,l=0;\n    char str[100] = {0};\n    if(scanf(\""%d\"",&k)==1){}\n    if(scanf(\""%s\"",str)==1)\n    {}\n    len  = strlen(str);\n    for(i=0;i<len;i++)\n    {\n        if(str[i]=='0')\n        g++;\n        else\n        l++;\n    }\n    //g-=8;//0的个数;\n    //l-=52;//1的个数;\n    if(g>l)\n    printf(\""%d\\n\"",2*l);\n    else\n    printf(\""%d\\n\"",2*g);\n    return 0;\n}\n\n",SEGMENTATION_FAULT,40,352
1591673417622118400,27fbb32d960dbf49665c8905b68012d602eda68987686c6f224ec7b49ca3d0ac,2022-11-13 14:04:49,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint a;\n\tscanf(\""%d\"",&a);\n\tprintf(\""4\\n\"");\n\treturn 0;\n} ",WRONG_ANSWER,7,200
1591673433707307008,1f15b5b41f9e61f2d767bcb1ae88bef60c94b97dd423bfd2ba9c8c0e8e9d05bb,2022-11-13 14:04:53,Java,300.0,1591610585635213318,1591131464941563904,1049226928954454016,import java.util.Scanner;\npublic class Main{\n    public static void main(String[] args){\n        Scanner sc=new Scanner(System.in);\n        int P=sc.nextInt();\n        int Q=sc.nextInt();\n        int R=sc.nextInt();\n        int X=P+Q;\n        int Y=Q+R;\n        int Z=R+Q;\n     if(X>Y){\n         if(Y>Z){\n             System.out.println(Z);             \n         }else{\n             System.out.println(Y);\n         }\n     }else{\n         System.out.println(X);\n     }\n    \n        }\n  },ACCEPTED,538,25112
1591673435099815936,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 14:04:53,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <string.h>\nint main()\n{\n    int k,len,i,g=0,l=0;\n    char str[200] = {0};\n    if(scanf(\""%d\"",&k)==1){}\n    if(scanf(\""%s\"",str)==1)\n    {}\n    len  = strlen(str);\n    for(i=0;i<len;i++)\n    {\n        if(str[i]=='0')\n        g++;\n        else\n        l++;\n    }\n    //g-=8;//0的个数;\n    //l-=52;//1的个数;\n    if(g>l)\n    printf(\""%d\\n\"",2*l);\n    else\n    printf(\""%d\\n\"",2*g);\n    return 0;\n}\n\n",SEGMENTATION_FAULT,41,508
1591673453990961152,1b00b3d29099722d8332b35e3af5e54fda309b4f7c9fc6261f618ecd2a4d7390,2022-11-13 14:04:57,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,sum=0,i;\n    scanf(\""%d\"",&n);\n    int h[10000];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&h[i]);\n    for(i=1;i<n-1;i++)\n         {\n             if(h[i+1]>h[i]&&h[i]<h[i-1])\n                 sum++;\n             if(h[i+1]==h[i]&&h[i]<h[i+2])\n                 sum++;\n         }\n    printf(\""%d\"",sum);\n    return 0;\n}",ACCEPTED,41,512
1591673456599818240,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-13 14:04:58,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,n;\n    char s[10];\n    int sum1=0,sum2=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&s[i]);\n    }\n    for(i=0;i<n;i++)\n       {\n           if(s[i]>0)\n               sum1++;\n           else\n               sum2++;\n       }\n     \n    if(sum1>sum2)\n        printf(\""%d\"",2*sum2);\n    else\n        printf(\""%d\"",2*sum1);\n       \n    \n    return 0;\n   \n}",WRONG_ANSWER,8,192
1591673462593433600,1f15b5b41f9e61f2d767bcb1ae88bef60c94b97dd423bfd2ba9c8c0e8e9d05bb,2022-11-13 14:05:00,Java,300.0,1591610585635213316,1591130116607045632,1049226928954454016,public class Main{\n    public static void main(String args[]){\n        int a=60;\n    System.out.println(a);\n    }\n},ACCEPTED,67,22348
1591673463189037056,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-13 14:05:00,C++,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int N=10005;\nll a[N];\n//ll dp[N][N];\nint main(){\nint n;\ncin>>n;\nint cnt=0;\nfor(int i=1;i<=n;i++)\ncin>>a[i];\na[0]=0;\n//dp[0][0]=0;\nfor(int i=0;i<n;i++){\n\tif(a[i+1]>=5)\n\tcnt+=a[i+1]-5;\n\telse{\n\tcnt+=max(a[i+1],a[i+3])-5;\n\tif(a[i+3]>a[i+1])\n\ti+=2;\n}\n}\ncout<<cnt;\n\treturn 0;\n} ",WRONG_ANSWER,7,632
1591673464216641536,a57fdafe4877cd9608fc0ac8a5120a47bc60a015785960e61b67b4e66187c2f2,2022-11-13 14:05:00,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 100\nint main(){\n    int i,n,j=0;\n    int a[N];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n      if(a[i]!=0&&a[i]!=2)\n            return 0;\n    }\n    if(a[0]!=0||a[n]!=0)\n        return 0;\n    else{\n        for(i=1;i<n;i++){\n        if(a[i]<a[i+1])\n            j++;\n    }\n    printf(\""%d\\n\"",j);\n    }\n    return 0;\n}",WRONG_ANSWER,8,344
1591673481824317440,1f15b5b41f9e61f2d767bcb1ae88bef60c94b97dd423bfd2ba9c8c0e8e9d05bb,2022-11-13 14:05:04,Java,300.0,1591610585635213316,1591130116607045632,1049226928954454016,public class Main{\n    public static void main(String args[]){\n        int a=60;\n    System.out.println(a);\n    }\n},ACCEPTED,65,22832
1591673487784435712,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-13 14:05:06,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main(){\n    int n,a[1000],count=0,i,j,t=0;\n      scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n        \n        \n    \n    for( j=1;j<n-2;j++)\n    {\n        \n        if(a[j]<a[j-1]&&a[j]<a[j+1])\n        { count++;   }\n             \n       // else \n        if(a[j]==a[j+1])\n        {t=1;\n            continue;\n        }\n        \n        if(a[i]!=a[j+1]) {count+=t;t=0;}\n      \n        \n            \n    }\n    \n    \n   if(count!=0)\n      printf(\""%d\"",count);\n   else \n     printf(\""0\"");\n          \n}",WRONG_ANSWER,5,360
1591673500136660992,c47b15e117166a3dd00078b9f795673d5284a2761e582479119229751cc734d3,2022-11-13 14:05:08,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#define S 10000\n\n\nint main()\n{\n    int a=0,n,i,j,k;\n    int s[S];\n    int m[S];\n    scanf(\""%d\"",&n);\n    if(n>=1 && n<=10000)\n    {\n\n        for(i=0;i<n;i++)\n        scanf(\""%d\"",&s[i]);\n        for (i=0;i<n;i++)\n        {\n            if(s[i]>=1 && s[i]<=1000000)\n            {\n                    for(i=0;i<n;i++)\n                {\n\n\n                        for(i=0;i<n;i++)\n                    {\n                        k=1;\n                        for(j=i;j<n;j++)\n                        if(s[i]<=s[j])\n                        m[i]=s[i]*(k++);\n                        else break;\n                    }\n                for(i=0;i<n;i++)\n                {\n                    if(a<=m[i])\n                        a=m[i];\n                }\n                printf(\""%d\\n\"",a);\n                }\n            }\n            else break;\n        }\n\n\n\n\n\n\n\n\n    }\n    else printf(\""请重新输入\"");\n\n    return 0;\n}",WRONG_ANSWER,26,380
1591673557409882112,00d0a1b2e987c17fb50850b9ec54bf6b4f8b997eb053d1a9fed6c4888fbe74ed,2022-11-13 14:05:22,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int n,i,j,m;\n    char s[n];\n    scanf(\""%d\"",&n);\n    scanf(\""%s\"",&s[n]);\n    for(i=0;i<n;)\n        if(s[i]!=s[i+1])\n        {\n            m=i;\n            for(j=0;j<n;j++)\n                s[i+2]=s[i];\n        }\n    for(i=0;i<n;i++)\n    {\n        pirntf(\""%s\"",s);\n    }\n    return 0;\n}",TIME_LIMIT_EXCEEDED,400,196
1591673587596288000,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 14:05:29,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <string.h>\nint main()\n{\n    int k,len,i,g=0,l=0;\n    char str[200] = {0};\n    if(scanf(\""%d\"",&k)==1){}\n    if(scanf(\""%s\"",str)==1)\n    {}\n    len  = strlen(str);\n    for(i=0;i<len;i++)\n    {\n        if(str[i-1]=='0')\n        g++;\n        else\n        l++;\n    }\n    //g-=8;//0的个数;\n    //l-=52;//1的个数;\n    if(g>l)\n    printf(\""%d\\n\"",2*l);\n    else\n    printf(\""%d\\n\"",2*g);\n    return 0;\n}\n\n",WRONG_ANSWER,4,196
1591673590964346880,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 14:05:30,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i;\n    int sum=0;\n    int t=0;\n    scanf(\""%d\"",&n);\n        int a[n];\n    for(i=0;i<n;i=t)\n    {\n        if(a[i]>a[i+2])\n        {\n            sum=sum+a[i]-5;\n            t=t+1;\n        }\n        else\n        {\n            sum=sum+a[i+2]-5;\n            t=t+3;\n        }\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,5,196
1591673591958364160,f55f4c0e0e3367434e26a462e3665271f5b4141ea3de4f34d96fdb21d67e2a7c,2022-11-13 14:05:30,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,i,z,b,count;\n    scanf(\""%d\"",&a);\n    count=0;\n    int k[a];\n for(i=0;i<a;i++)\n {\n    scanf(\""%d\"",&k[i]);\n    if(k[i],k[i+1]&&k[i]<k[i-1])\n        count++;\n\n }\n b=count-2;\n printf(\""%d\"",b);\n\n\n\n\n\n\n    return 0;\n}\n",WRONG_ANSWER,5,324
1591673613449965568,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-13 14:05:35,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,e=0,i;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<n-2;i++)\n    if(a[i]>a[i+1]&&a[i+1]<=a[i+2])\n    e++;\n     \n    printf(\""%d\"",e);\n    return 0;\n}",ACCEPTED,40,512
1591673686091128832,f55f4c0e0e3367434e26a462e3665271f5b4141ea3de4f34d96fdb21d67e2a7c,2022-11-13 14:05:53,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,i,z,b,count;\n    scanf(\""%d\"",&a);\n    count=0;\n    int k[a];\n for(i=0;i<a;i++)\n {\n    scanf(\""%d\"",&k[i]);\n    if(k[i]<k[i+1]&&k[i]<k[i-1])\n        count++;\n\n }\n b=count-2;\n printf(\""%d\"",b);\n\n\n\n\n\n\n    return 0;\n}\n",WRONG_ANSWER,7,348
1591673689668857856,9819f13d6a58d50fa249ad037641119dadb52afb3f125db258771564f27d2ca5,2022-11-13 14:05:54,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int n,i;\n    scanf(\""%d\"",&n);\n\n    int num[n];\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&num[i]);\n    }\n    int start ,temp;\n    int ans=0;\n    for(i=1;i<n;i++){\n        if(num[i-1]>num[i]){\n            start=1;\n            temp=num[i];\n        }\n        if(temp<num[i]&&start==1){\n            start==0;\n            temp==0;\n            ans++;\n        }\n    }\n    printf(\""%d\\n\"",ans-1);\n    return 0;\n}\n",WRONG_ANSWER,6,324
1591673703455580160,17759f531671f838bf3fae4270190e93b6109026f9503f986c1ed85bb412007d,2022-11-13 14:05:57,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int i,n,a,b,c[30000],F[30000],sum1=0,sum2=0;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&F[i]);\n    for(i=0;i<n;i++)\n    {\n        sum1=sum1+(c[i]/(F[i]+1))*(pow(a,(F[i]+1)));\n        sum2=sum2+(c[i]/(F[i]+1))*(pow(b,F[i]+1)));\n    }\n    printf(\""%d\"",sum1-sum2);\n}",COMPILE_ERROR,0,0
1591673723525279744,902d8082eea06043d392298983db4630cde4418ac8ee42282d537bfaae045c2f,2022-11-13 14:06:02,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"b=eval(input())\na=list(input().split(\"" \""))\nj=0\nfor i in range(1,b-1):\n    if a[i]==a[i-1]:\n        a.pop(i)\nfor q in range(1,len(a)-2):\n    if a[q-1]>a[q]<a[q+1]:\n        j=j+1\nprint(j)",NON_ZERO_EXIT_CODE,92,3040
1591673723529519104,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 14:06:02,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <string.h>\nint main()\n{\n    int k,len,i,g=0,l=0;\n    char str[200] = {0};\n    if(scanf(\""%d\"",&k)==1){}\n    if(scanf(\""%s\"",str)==1)\n    {}\n    len  = strlen(str);\n    for(i=0;i<=len;i++)\n    {\n        if(str[i]=='0')\n        g++;\n        else\n        l++;\n    }\n    //g-=8;//0的个数;\n    //l-=52;//1的个数;\n    if(g>l)\n    printf(\""%d\\n\"",2*l);\n    else\n    printf(\""%d\\n\"",2*g);\n    return 0;\n}\n\n",SEGMENTATION_FAULT,36,512
1591673746388475904,fbea21dbaf89f1b064feaa20227f21c5e1c4888fdc371cf5e43f70615906e52a,2022-11-13 14:06:07,Python,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"n=int(input())\nm=list(map(int,input().split()))\nnum=0\nif m[0]>=3:\n    num=num+1\nif m[1]>=3:\n    num=num+1\nfor i in range (1,n):\n    if m[i]>=3 and m[i-1]>=3:\n        num+=1\ns=3*num*1\nprint(s)\n    ",WRONG_ANSWER,17,3072
1591673754370236416,28b4de6882b7ade2679f59c486acaf307ce8415dcb0a15787dba589025bbdb02,2022-11-13 14:06:09,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint n,a,b;\n\tscanf(\""%d%d%d\"",&n,&a,&b);\n\tint xi[n],mi[n],sum=0;\n\tint i;\n\tfor(i=0;i<n;i++)\n\tscanf(\""%d\"",&xi[i]);\n\tfor(i=0;i<n;i++)\n\tscanf(\""%d\"",&mi[i]);\n\tfor(i=0;i<n;i++)\n\t{\n\t\tsum+=xi[i]*pow(a,mi[i]+1)/(mi[i]+1)-xi[i]*pow(b,mi[i]+1)/(mi[i]+1);\t\n\t}\n\tprintf(\""%d\"",sum);\n\treturn 0;\n}",WRONG_ANSWER,8,512
1591673755360047104,a57fdafe4877cd9608fc0ac8a5120a47bc60a015785960e61b67b4e66187c2f2,2022-11-13 14:06:09,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 100\nint main(){\n    int i,n,j=0;\n    int a[N];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n      if(a[i]!=0&&a[i]!=2&&a[i]!=1)\n            return 0;\n    }\n    if(a[0]!=0||a[n]!=0)\n        return 0;\n    else{\n        for(i=1;i<n;i++){\n        if(a[i]<a[i+1])\n            j++;\n    }\n    printf(\""%d\\n\"",j);\n    }\n    return 0;\n}",WRONG_ANSWER,8,352
1591673756643516416,17759f531671f838bf3fae4270190e93b6109026f9503f986c1ed85bb412007d,2022-11-13 14:06:10,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int i,n,a,b,c[30000],F[30000],sum1=0,sum2=0;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&F[i]);\n    for(i=0;i<n;i++)\n    {\n        sum1=sum1+(c[i]/(F[i]+1))*(pow(a,(F[i]+1)));\n        sum2=sum2+(c[i]/(F[i]+1))*(pow(b,(F[i]+1)));\n    }\n    printf(\""%d\"",sum1-sum2);\n}",WRONG_ANSWER,5,204
1591673833147609088,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-13 14:06:28,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,n,T;\n    char s[10];\n    int sum1=0,sum2=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&s[i]);\n    }\n    for(i=0;i<n;i++)\n       {\n           if(s[i]>0)\n               sum1++;\n           else\n               sum2++;\n       }\n     \n    if(sum1>sum2)\n        min=sum2;\n    else\n       min=sum1;\n    T=min*2;\n    printf(\""%d\"",T);\n       \n    \n    return 0;\n   \n}",COMPILE_ERROR,0,0
1591673865968082944,7ecf54bf0ea2db8ab0397aa941f19ec79a351bc3e86e8c01673aa09a69b3a6db,2022-11-13 14:06:36,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n\tint n,l,max=0;\n\tscanf(\""%d\"",&n);\n\tint s[n];\n\t//录入\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&s[i]);\n\t}\n\t//找区间\n\tfor(int j=0;j<n;j++)\n\t{\n\t\tl = 1;\n\t\tfor(int k=j;k<n-1;k++)\n\t\t{\n            if(s[j]>s[k+1])break;\n\t\t\tl++;\n\t\t}\n\t\t//printf(\""%d %d\\n\"",s[j],l);\n\t\tif(max<s[j]*l)max=s[j]*l;\n\t}\n\t//打印结果\n\tprintf(\""%d\\n\"",max);\n}\n\n",WRONG_ANSWER,19,364
1591673877510762496,6ba5ecacf3381a1e9382f99c413290eca40a071a563a618e5f36d66cbf9a5e1b,2022-11-13 14:06:38,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<iostream>\n\nusing namespace std;\n\nint main(){\nint n;\nint flag=3;\nlong imax=0,sum=0;\ncin>>n;\nlong h[n];\nfor(int i=0;i<n;i++){\n    cin>>h[i];\n}\n\nfor(int i=0;i<n;i++)\n{\n    for(int j=i;j<n;j++){\n        if(h[j]>=h[i])\n            flag=1;\n        else\n            flag=0;\n        if(flag==0){\n        sum=h[i]*(j-i);\n        //cout<<sum<<endl;\n        if(imax<sum)\n            imax=sum;\n        break;\n        }\n        if(flag==1 && j==n-1){\n            sum=h[i]*(j-i+1);\n            //cout<<sum<<endl;\n        if(imax<sum)\n\n            imax=sum;\n        break;\n        }\n    }\n}\ncout<<imax<<endl;\n}",WRONG_ANSWER,32,768
1591673896301289472,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-13 14:06:43,Java,0.0,1591610585639407616,1591132307937943552,1049226928954454016,import java.util.Scanner;\n\npublic class Main{\n    public static void main(String[] args){\n        Scanner sc = new Scanner(System.in);\n        int n = sc.nextInt();\n        int len = sc.nextInt();\n        int l = 0;\n        int r = len-1;\n        int m =0;\n        int count = 0;\n        int[] h = new int[len];\n        \n        for(int i=0; i<len; i++){\n            h[i] = sc.nextInt();\n        }\n        \n        for(int j=0; j<len; j++){\n            m = l+r;\n            if(m < h[m-1] && m > h[m+1]){\n                count++;\n            }else{\n                \n            }\n        }\n        System.out.println(count);\n    }\n},WRONG_ANSWER,107,24876
1591673903020519424,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-13 14:06:45,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,n,T,min;\n    char s[10];\n    int sum1=0,sum2=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&s[i]);\n    }\n    for(i=0;i<n;i++)\n       {\n           if(s[i]>0)\n               sum1++;\n           else\n               sum2++;\n       }\n     \n    if(sum1>sum2)\n        min=sum2;\n    else\n       min=sum1;\n    T=min*2;\n    printf(\""%d\"",T);\n       \n    \n    return 0;\n   \n}",WRONG_ANSWER,13,220
1591673903888785408,da72e985b1ff1737d155282af7dd43e3dc341605cc356d114979edd4fea85a11,2022-11-13 14:06:45,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main() {\n    int arr[100],n,i,t=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&arr[i]);\n    for(i=1;i<n-1;i++)\n        if((arr[i]<arr[i-1])&&(arr[i]<=arr[i+1]))\n            t++;\n    printf(\""%d\"",t);\n    return 0;\n}",RUNTIME_ERROR,41,496
1591673904924745728,001baa7272d47ab2d3a9b57bf7838570ff03ab1cabb738e7b342b652b1e42a83,2022-11-13 14:06:45,C++,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <iostream>\n#include <bits/stdc++.h>\nusing namespace std;\n\n//  ceil()    floor()\n\n//long long amax=-9999999;\n\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    char a[n];\n    scanf(\""%s\"",&a);\n    int num=0,fl;\n    for(int i=0;i<n;i++){\n        if(a[i]=='c')\n            continue;\n        for(int j=i+1;j<n;j++){\n            if(a[j]!='c'){\n                fl=j;\n                break;\n            }\n        }\n        if(a[i]!=a[i+fl]){\n            num++;\n            a[i]='c';\n            a[i+1]='c';\n            if((i-1)>=0)\n                i=i-1;\n        }else{\n            i=fl-1;\n        }\n    }\n    printf(\""%d\\n\"",num*2);\n\n\n\n    return 0;\n}\n",WRONG_ANSWER,11,484
1591673908473159680,7935e8f5cb04027f4d30ac84a997e2d03e946e112c1cb17f1a4f943d8b0b54bf,2022-11-13 14:06:46,C++,0.0,1591610585635213319,1591131955016622080,1049226928954454016,"#include <iostream>\n#include<stdio.h>\n#include<algorithm>\n\nusing namespace std;\n\nint main()\n{\n    int t,i=0;\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++)\n    {\n        int n,j,x=0;\n        scanf(\""%d\"",&n);\n        int a[n];\n        for(j=0;j<n;j++)\n            scanf(\""%d\"",&a[j]);\n        if(n==1)\n        {\n            printf(\""0\\n\"");\n            continue;\n        }\n        for(j=1;j<n;j++)\n        {\n            if(a[j]>=2*a[0])\n            {\n                x=x+a[j]/(2*a[0]);\n                if(a[j]%a[0]==0)\n                    x=x+1;\n            }\n        }\n        printf(\""%d\\n\"",x);\n    }\n    return 0;\n}\n",WRONG_ANSWER,6,320
1591673908494086144,5a1c17b308a3b3595833d34c6bdfb75e9f5dd0d065acfeb7f28ab8102ba7406c,2022-11-13 14:06:46,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a[100]={0};\n    int i,n;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    int count = 0;\n    for(i=1;i<n-1;i++){\n        if(a[i]<a[i-1]&&a[i]<a[i+1]){\n            count++;\n            }\n        if(a[i]==a[i+1]&&a[i-1]>a[i]){\n        for(;i<n-3;i++){\n            if(a[i+1]<a[i+2]){\n                count = count+1;\n                break;\n            }\n            }\n        }\n    }\n    printf(\""%d\"",count);\n    return 0;\n}\n",RUNTIME_ERROR,31,348
1591673918371684352,129ddfe9d2d4553f365faf2fdc5e2f0c271b2e342a4cff13802dda8ef8b3d1c2,2022-11-13 14:06:48,Java,0.0,1591610585635213318,1591131464941563904,1049226928954454016,package demo01;\n\nimport java.util.Scanner;\n\npublic class Test02 {\n\tpublic static void main(String[] args) {\n\t\tScanner s = new Scanner(System.in);\n\t\tint a = s.nextInt();\n\t\tint b = s.nextInt();\n\t\tint c = s.nextInt();\n\t\tint[] n = new int[3];\n\t\tint min = a+b;\n\t\tif(a+c <= min){\n\t\t\tmin = a+c;\n\t\t}\n\t\tif(b+c <= min){\n\t\t\tmin =b+c;\n\t\t}\n\t\tSystem.out.println(min);\n\t}\n},COMPILE_ERROR,0,0
1591673935450877952,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-13 14:06:52,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n\nint main()\n\n{\n\n    int count=0,a[10^4],n,i;\n\n    scanf(\""%d\"",&n);\n\n    for(i=0;i<n;i++)\n\n    scanf(\""%d\"",&a[i]);\n\n    for(i=0;i<n-2;i++)\n\n    {\n\n    if(a[i]>a[i+1]&&a[i+1]<a[i+2])\n\n    count++;\n\n    else if(a[i]==a[i+1])\n\n    if(a[i-1]>a[i]&&a[i+2]>=a[i+1])\n\n    count++;\n\n    }\n\n    printf(\""%d\"",count);\n\n    return 0;\n\n}",RUNTIME_ERROR,10,384
1591673961388453888,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 14:06:58,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <string.h>\nint main()\n{\n    int k,len,i,g=0,l=0;\n    char str[200] = {0};\n    scanf(\""%d\"",&k);\n    scanf(\""%s\"",str);\n    len  = strlen(str);\n    for(i=0;i<=len;i++)\n    {\n        if(str[i]=='0')\n        g++;\n        else\n        l++;\n    }\n    //g-=8;//0的个数;\n    //l-=52;//1的个数;\n    if(g>l)\n    printf(\""%d\\n\"",2*l);\n    else\n    printf(\""%d\\n\"",2*g);\n    return 0;\n}\n\n",SEGMENTATION_FAULT,39,488
1591673982636810240,2bc6a85c0376656012a7970a7842a2a9d8769555a79ef4eec85ff45aa30ff7b7,2022-11-13 14:07:03,Java,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"import java.util.Scanner;\nimport java.util.regex.Matcher;\nimport java.util.regex.Pattern;\n\npublic class Main {\n    public static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tsc.nextLine();\n\t\tString s = sc.nextLine();\n\t\tint n = 0;\n\t\tPattern p = Pattern.compile(\""[0]{2}|[1]{2}\"");\n\t\tMatcher m = p.matcher(s);\n\t\twhile(true) {\n\t\t\tString ss = m.replaceFirst(\""\"");\n\t\t\tif(ss.equals(s)) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\ts = ss;\n\t\t\tm = p.matcher(s);\n\t\t\tn=n+2;\n\t\t}\n\t\tSystem.out.println(n);\n\t}\n}",WRONG_ANSWER,107,24704
1591673985337942016,37ec44401a5a9f0dfa02d2aedaf5edff84fc443d98174af5f21ab01a7d6f6a41,2022-11-13 14:07:04,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint cnt;\nint main()\n{\n int i,j,k;\n int n;\n scanf(\""%d\"",&n);\n int h[10005];\n for(i=0;i<n;i++)\n {\n   scanf(\""%d\"",&h[i]);\n }\n for(i=2;i<n-2;i++)\n {\n     j=i+1;k=i-1;\n     if(h[j]>h[i]&&h[k]>h[i])\n     {\n         cnt++;\n         continue;\n     }\n      else  if(h[k]==h[i]&&h[j]>h[i])\n      {\n\n          while(h[k]==h[i])\n          {\n              k++;\n          }\n          if(h[k]>h[i]) cnt++;\n          continue;\n      }\n }\n printf(\""%d\"",cnt);\n return 0;\n}\n",ACCEPTED,47,344
1591673991142858752,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-13 14:07:06,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n\nint main()\n\n{\n\n    int count=0,a[10000],n,i;\n\n    scanf(\""%d\"",&n);\n\n    for(i=0;i<n;i++)\n\n    scanf(\""%d\"",&a[i]);\n\n    for(i=0;i<n-2;i++)\n\n    {\n\n    if(a[i]>a[i+1]&&a[i+1]<a[i+2])\n\n    count++;\n\n    else if(a[i]==a[i+1])\n\n    if(a[i-1]>a[i]&&a[i+2]>=a[i+1])\n\n    count++;\n\n    }\n\n    printf(\""%d\"",count);\n\n    return 0;\n\n}",ACCEPTED,38,488
1591674001230147584,f55f4c0e0e3367434e26a462e3665271f5b4141ea3de4f34d96fdb21d67e2a7c,2022-11-13 14:07:08,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,i,z,b,count;\n    scanf(\""%d\"",&a);\n    count=0;\n    int k[a];\n for(i=0;i<a;i++)\n {\n    scanf(\""%d\"",&k[i]);\n    if(k[i]<=k[i+1]&&k[i]<=k[i-1])\n        count++;\n\n }\n b=count-2;\n printf(\""%d\"",b);\n\n\n\n\n\n\n    return 0;\n}\n",WRONG_ANSWER,31,372
1591674006833750016,9d0546dac18a9dc678295254e547925db086add5f872ef42d8015d525afeaf65,2022-11-13 14:07:09,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 10000\nint main()\n{\n    int num[N],i,j,n,temp;\n    int k=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&num[i]);\n    }\n    for(i=1;i<n;i++){\n        if(num[i]<num[i+1]){\n            k++;\n        }\n    }\n    printf(\""%d\\n\"",k);\n}\n",WRONG_ANSWER,9,328
1591674022931521536,da72e985b1ff1737d155282af7dd43e3dc341605cc356d114979edd4fea85a11,2022-11-13 14:07:13,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#define MAX 100\nint main() {\n    int arr[MAX],n,i,t=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&arr[i]);\n    for(i=1;i<n-1;i++)\n        if((arr[i]<arr[i-1])&&(arr[i]<=arr[i+1]))\n            t++;\n    printf(\""%d\"",t);\n    return 0;\n}",RUNTIME_ERROR,22,600
1591674041826828288,9819f13d6a58d50fa249ad037641119dadb52afb3f125db258771564f27d2ca5,2022-11-13 14:07:18,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int n,i;\n    scanf(\""%d\"",&n);\n\n    int num[n];\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&num[i]);\n    }\n    int start ,temp;\n    int ans=0;\n    for(i=1;i<n;i++){\n        if(num[i-1]>num[i]){\n            start=1;\n            temp=num[i];\n        }\n        if(temp<num[i]&&start==1){\n            start=0;\n            temp=0;\n            ans++;\n        }\n    }\n    printf(\""%d\\n\"",ans);\n    return 0;\n}\n",ACCEPTED,33,480
1591674047426224128,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 14:07:19,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <string.h>\nint main()\n{\n    int k,len,i,g=0,l=0;\n    char str[50] = {0};\n    scanf(\""%d\"",&k);\n    scanf(\""%s\"",str);\n    len  = strlen(str);\n    for(i=0;i<=len;i++)\n    {\n        if(str[i]=='0')\n        g++;\n        else\n        l++;\n    }\n    //g-=8;//0的个数;\n    //l-=52;//1的个数;\n    if(g>l)\n    printf(\""%d\\n\"",2*l);\n    else\n    printf(\""%d\\n\"",2*g);\n    return 0;\n}\n\n",SEGMENTATION_FAULT,37,348
1591674086806577152,a57fdafe4877cd9608fc0ac8a5120a47bc60a015785960e61b67b4e66187c2f2,2022-11-13 14:07:28,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 100\nint main(){\n    int i,n,j=0;\n    int a[N];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n      if(a[i]!=0&&a[i]!=2&&a[i]!=1)\n            return 0;\n    }\n    if(a[0]!=0||a[n]!=0)\n        return 0;\n    else{\n        for(i=0;i<n;i++){\n        if(a[i]<a[i+1])\n            j++;\n    }\n    printf(\""%d\\n\"",j);\n    }\n    return 0;\n}",WRONG_ANSWER,11,192
1591674099435581440,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 14:07:31,C,0.0,1591610585635213314,1591128862958940160,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a,c,i;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a-1;i++)\n        scanf(\""%d\"",&i);\n    printf(\""5 3 2 1 1\\n\"");\n    return 0;\n}",WRONG_ANSWER,8,324
1591674174081654784,d21dc339d37b0772b2547441444d4b660b000ac3ebe190aee01769e2dd619c10,2022-11-13 14:07:49,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"for i in range(1,1000):\n    Max=0\n    P=input()\n    Q=input()\n    R=input()\n    a=int(P)+int(Q)\n    b=int(Q)+int(R)\n    c=int(R)+int(P)\n    if a>b:\n        if b<c:\n            Max=b\n            print(Max)\n        else:\n            Max=c\n            print(Max)\n    if a<c:\n        Max=a\n        print(Max)\n    else :\n        Max=c\n        print(Max)",NON_ZERO_EXIT_CODE,16,2904
1591674197494226944,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-13 14:07:55,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,n;\n    char s[10];\n    int sum1=0,sum2=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&s[i]);\n    }\n    for(i=0;i<n;i++)\n       {\n           if(s[i]>0)\n               sum1++;\n           else\n               sum2++;\n       }\n     \n    if(sum1>sum2)\n       printf(\""%d\"",sum2*2);\n    else\n       printf(\""%d\"",sum1*2);\n    \n    return 0;\n   \n}",WRONG_ANSWER,5,324
1591674204523868160,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 14:07:56,C,0.0,1591610585635213314,1591128862958940160,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a,c,i;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a-1;i++)\n        scanf(\""%d\"",&i);\n    printf(\""5 3 2 1 1 \\n\"");\n    return 0;\n}",WRONG_ANSWER,6,200
1591674210152669184,a57fdafe4877cd9608fc0ac8a5120a47bc60a015785960e61b67b4e66187c2f2,2022-11-13 14:07:58,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 100\nint main(){\n    int i,n,j=0;\n    int a[N];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n      if(a[i]!=0&&a[i]!=2&&a[i]!=1)\n            return 0;\n    }\n    if(a[0]!=0||a[n]!=0)\n        return 0;\n    else{\n        for(i=1;i<n-1;i++){\n        if(a[i]<a[i+1])\n            j++;\n    }\n    printf(\""%d\\n\"",j);\n    }\n    return 0;\n}",WRONG_ANSWER,5,484
1591674229324832768,42cfad7191c5e6c0eee156c4369182744d6c5db3bc2a5dc87f9f1be6ee4bbcfe,2022-11-13 14:08:02,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main(){\n   int n,a[n];\n   scanf(\""%d\"",&n);\n   int i,sum=0;\n   for(i=0;i<n;i++)\n   scanf(\""%d \"",&a[i]);\n   for(i=1;i<n;i++){\n       if(a[i]>a[i+1]){\n        if(a[i+1]<a[i+2]||a[i+1]==a[i+3])\n   \t\t\t   \tsum=sum+1;\n       }\n\t    }\n\n   printf(\""%d\"",sum);\n   return 0;\n} ",WRONG_ANSWER,7,440
1591674236786466816,73af9d5098be5d450fba728363c8fdbe0f6a5526466daa2f3b74abf1acf75527,2022-11-13 14:08:04,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    \n    int n,h[1000],i=0,j=0;\n    scanf(\""%d\"",&n);\n    int count=0;\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&h[i]);\n        \n    }\n    \n        for(i=1;i<n-1;i++)\n        {\n            if(h[i]!=h[i+1]&&h[i]<h[i+1]&&h[i]<h[i-1])\n                count++;\n            if(h[i]==h[i+1]&&h[i]<h[i-1])\n                {\n                    for(j=i+1;j<n-1;j++)\n                    {\n                        if(h[j]==h[j+1])\n                            j++;\n                        else if(h[j]!=h[j+1]) \n                            break;\n                    }\n                    i=j;\n                    if(h[i]<h[i+1])\n                        count++;\n                    \n                }\n           \n            \n        }\n    printf(\""%d\"",count);\n    return 0;\n\n}",WRONG_ANSWER,35,380
1591674272492576768,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-13 14:08:13,Python,300.0,1591610585635213317,1591130976212869120,1049226928954454016,"a=list(map(int,input().split()))\nb=list(map(int,input().split()))\nc=list(map(int,input().split()))\nsum=0\ndef cs(c,f,a):\n    x=(c/(f+1))*(a**(f+1))\n    return x\nfor i in range(a[0]*2):\n    if i<a[0]:\n        sum+=cs(b[i],c[i],a[1])\n    if i>=a[0]:\n        sum-=cs(b[i%a[0]],c[i%a[0]],a[2])\nprint(int(sum))\n    \n    ",ACCEPTED,105,3040
1591674308672675840,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-13 14:08:21,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,def clean(a):\n    for i in a:\n        if a[i]!=a[i+1]:\n##            print(a[i])\n            a.remove(i)\n            a.remove(i)\n            break\n    else:\n         return a\n    clean(a)\n\nn=int(input())\na=[]\nfor i in range(n):\n    i=int(input())\n    a.append(i)\nprint(clean(a))\n,NON_ZERO_EXIT_CODE,24,2760
1591674335130312704,28b4de6882b7ade2679f59c486acaf307ce8415dcb0a15787dba589025bbdb02,2022-11-13 14:08:28,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint n,a,b;\n\tscanf(\""%d%d%d\"",&n,&a,&b);\n\tint xi[n],mi[n],sum=0;\n\tint i;\n\tfor(i=0;i<n;i++)\n\tscanf(\""%d\"",&xi[i]);\n\tfor(i=0;i<n;i++)\n\tscanf(\""%d\"",&mi[i]);\n\tfor(i=0;i<n;i++)\n\t{\n\t\tsum+=xi[i]*pow(a,mi[i]+1)/(mi[i]+1)-xi[i]*pow(b,mi[i]+1)/(mi[i]+1);\t\n\t}\n\tprintf(\""%d\"",sum);\n\treturn 0;\n}",WRONG_ANSWER,11,196
1591674342113828864,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 14:08:29,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i;\n    int sum=0;\n    int t=0;\n    scanf(\""%d\"",&n);\n        int a[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i=t)\n    {\n        if(a[i]>a[i+2])\n        {\n            sum=sum+a[i]-5;\n            t=t+1;\n        }\n        else\n        {\n            sum=sum+a[i+2]-5;\n            t=t+3;\n        }\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,7,488
1591674358702301184,28b4de6882b7ade2679f59c486acaf307ce8415dcb0a15787dba589025bbdb02,2022-11-13 14:08:33,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint n,a,b;\n\tscanf(\""%d%d%d\"",&n,&a,&b);\n\tint xi[n],mi[n],sum=0;\n\tint i;\n\tfor(i=0;i<n;i++)\n\tscanf(\""%d\"",&xi[i]);\n\tfor(i=0;i<n;i++)\n\tscanf(\""%d\"",&mi[i]);\n\tfor(i=0;i<n;i++)\n\t{\n\t\tsum+=xi[i]*pow(a,mi[i]+1)/(mi[i]+1)-xi[i]*pow(b,mi[i]+1)/(mi[i]+1);\t\n\t}\n\tprintf(\""%d\"",sum);\n\treturn 0;\n}",WRONG_ANSWER,7,196
1591674367531311104,7ecf54bf0ea2db8ab0397aa941f19ec79a351bc3e86e8c01673aa09a69b3a6db,2022-11-13 14:08:35,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n\tint n,l,max=0;\n\tscanf(\""%d\"",&n);\n\tint s[n];\n\t//录入\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&s[i]);\n\t}\n    if(n==1)max=s[0];\n\t//找区间\n\tfor(int j=0;j<n;j++)\n\t{\n\t\tl = 1;\n\t\tfor(int k=j;k<n-1;k++)\n\t\t{\n            if(s[j]>s[k+1])break;\n\t\t\tl++;\n\t\t}\n\t\t//printf(\""%d %d\\n\"",s[j],l);\n\t\tif(max<s[j]*l)max=s[j]*l;\n\t}\n\t//打印结果\n\tprintf(\""%d\\n\"",max);\n}\n\n",WRONG_ANSWER,30,452
1591674384295944192,7935e8f5cb04027f4d30ac84a997e2d03e946e112c1cb17f1a4f943d8b0b54bf,2022-11-13 14:08:39,C,0.0,1591610585635213319,1591131955016622080,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int t,i=0;\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++)\n    {\n        int n,j,x=0;\n        scanf(\""%d\"",&n);\n        int a[n];\n        for(j=0;j<n;j++)\n            scanf(\""%d\"",&a[j]);\n        if(n==1)\n        {\n            printf(\""0\\n\"");\n            continue;\n        }\n        for(j=1;j<n;j++)\n        {\n            if(a[j]>=2*a[0])\n            {\n                x=x+a[j]/(2*a[0]);\n                if(a[j]%a[0]==0)\n                    x=x+1;\n            }\n        }\n        printf(\""%d\\n\"",x);\n    }\n    return 0;\n}\n",WRONG_ANSWER,12,384
1591674386422489088,5bd1a8718ea7fb820055421c67b8e0a468e08d951f729a24e55bf407b3bdb1f6,2022-11-13 14:08:40,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <iostream>\n#include <algorithm>\nusing namespace std;\n\n\n\n\n\n\nint main()\n{\n\n    int p,q,r,c;\n    cin>>p>>q>>r;\n    for(int i=0;i<3;i++){\n        c=min(r+q,min(q+r,r+p));\n    }\n    cout<<c;\n    return 0;\n}\n",WRONG_ANSWER,5,452
1591674420178202624,0cfbb4a339ebbc4dce13b5f3e3f98a3def0ab17ef5b4ac8e6d566de92e1f5f78,2022-11-13 14:08:48,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n[3];\n    for(int i=0;i<3;i++){\n        scanf(\""%d\"",&n[i]);\n    }\n    for(int i=1;i<=2;i++){\n        for(int j=0;j<3-i;j++){\n            if(n[j]>n[j+1]){\n                int temp=n[j];\n                n[j]=n[j+1];\n                n[j+1]=temp;\n            }\n        }\n    }\n    printf(\""%d\"",n[0]+n[1]);\n}",ACCEPTED,28,352
1591674436766720000,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-13 14:08:52,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main(){\n    int i,j,n,h[9999],max=0,count=0,chengji=15;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&h[i]);\n    }\n    for(i=0;i<n-1;i++){\n        for(j=i+1;j<n;j++){\n            if(h[j]==h[j-1]){\n                count++;\n                chengji=h[j]*(count);\n            }else{\n                count=0;\n            }\n            if(chengji>max){\n                max=chengji;\n            }\n        }\n        count=0;\n    }\n    printf(\""%d\\n\"",max);\n    return 0;\n}",WRONG_ANSWER,10,480
1591674439962779648,3e087b0a196d30fcbb49ca80164c9eb5adf82ae3bb08ec0c141e5728fb180f0d,2022-11-13 14:08:53,Java,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\t\n\tstatic final int MAX=10000;\n\tstatic int solve(int[] arr,int num){\n\t\tint i=1,j=3,res=0;\n\t\twhile(i<=num-4){\n\t\t\tif((arr[i]>arr[i+1])&&(arr[j]>=arr[i+1])){\n\t\t\t\tif(arr[j]==arr[i+1]){\n\t\t\t\t\twhile(arr[j]==arr[i+1]){\n\t\t\t\t\t\tj++;\n\t\t\t\t\t}\n\t\t\t\t\tres++;\n\t\t\t\t\ti=j;\n\t\t\t\t\tj=i+2;\n\t\t\t\t}else{\n\t\t\t\t\tres++;\n\t\t\t\t\ti+=2;\n\t\t\t\t}\t\t\n\t\t\t}else{\n\t\t\t\ti++;\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner sc=new Scanner(System.in);\n\t\tint num=sc.nextInt();\n\t\tint[] arr=new int[MAX];\n\t\tfor(int i=0;i<num;i++){\n\t\t\tarr[i]=sc.nextInt();\n\t\t}\n\t\tSystem.out.print(solve(arr, num));\n\t\tsc.close();\n\t}\n\n}",WRONG_ANSWER,103,24384
1591674470518251520,675867a135da6702ed27c0eec3e4b6d2a7d95c44854c01823fc152f0689f010d,2022-11-13 14:09:00,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#define MAX 10000\nint main(void)\n{\n\tint n, a[MAX]={0};\n\tint i;\n\tint max1, max2, temp;\n\tmax1=max2=0;\n\ttemp=0;\n\tscanf(\""%d\"",&n);\n\tfor(i=1;i<=n;i++)\n\t\tscanf(\""%d\"",&a[i]);\n\t\n\t\t\tfor(i=0;i<=n;i++)\n\t\t\t{\n\t\t\t\ttemp+=a[i]-5;\n\t\t\t\tif(temp<0)\n\t\t\t\t\ttemp=0;\n\t\t\t\tif(temp>max1)\n\t\t\t\t\tmax1=temp;\n\t\t\t}\n\t\t\t\n\t\t\ttemp=0;\n\t\t\tfor(i=0;i<=n;i+=3)\n\t\t\t{\n\t\t\t\ttemp+=a[i]-5;\n\t\t\t\tif(temp<0)\n\t\t\t\t\ttemp=0;\n\t\t\t\tif(temp>max2){\n\t\t\t\t\tmax2=temp;\n\t\t\t\t}\t\n\t\t\t}\n\t\n\tif(max1>max2)\n\t\tprintf(\""%d\\n\"",max1);\n\telse\n\t\tprintf(\""%d\\n\"",max2);\n\t\t\n\t\n\treturn 0;\n}",WRONG_ANSWER,5,196
1591674473831784448,0ccbaaa612b3d01dbe621ce5e7366d6e26d2e5adf55047d92c6eb7adf78a979d,2022-11-13 14:09:01,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int n,a,b;cin>>n>>a>>b;\n    int x[n],y[n];\n    for(int i=0;i<n;i++) cin>>x[i];\n    for(int i=0;i<n;i++) cin>>y[i];\n    int suma=0,sumb=0;\n    for(int i=0;i<n;i++)\n    {\n        suma+=(x[i]/(y[i]+1))*pow(a,y[i]+1);\n    }\n    for(int i=0;i<n;i++)\n    {\n        sumb+=(x[i]/(y[i]+1))*pow(b,y[i]+1);\n    }\n    cout<<suma-sumb;\n    return 0;\n}\n",WRONG_ANSWER,5,324
1591674474678988800,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-13 14:09:01,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main(){\n\tint n,i,j,k=0;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t} \n\tfor(i=1;i<n-1;i++){\n\t\tif(a[i]<a[i-1]){\n\t\t\tfor(j=i;j<n;j++){\n\t\t\t\tif(a[j]>a[j+1]) \n\t\t\t\t{\n\t\t\t\t\tk++;\n\t\t\t\t\ti=j;\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse continue;\n\t\t\t}\n\t\t}\n\t\t\telse continue;\n\t}\n\tprintf(\""%d\\n\"",k);\n}",WRONG_ANSWER,6,196
1591674511509217280,675867a135da6702ed27c0eec3e4b6d2a7d95c44854c01823fc152f0689f010d,2022-11-13 14:09:10,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#define MAX 10000\nint main(void)\n{\n\tint n, a[MAX]={0};\n\tint i;\n\tint max1, max2, temp;\n\tmax1=max2=0;\n\ttemp=0;\n\tscanf(\""%d\"",&n);\n\tfor(i=1;i<=n;i++)\n\t\tscanf(\""%d\"",&a[i]);\n\t\n\t\t\tfor(i=0;i<=n;i++)\n\t\t\t{\n\t\t\t\ttemp+=a[i]-5;\n\t\t\t\tif(temp<0)\n\t\t\t\t\ttemp=0;\n\t\t\t\tif(temp>max1)\n\t\t\t\t\tmax1=temp;\n\t\t\t}\n\t\t\t\n\t\t\ttemp=0;\n\t\t\tfor(i=0;i<=n;i+=3)\n\t\t\t{\n\t\t\t\ttemp+=a[i]-5;\n\t\t\t\tif(temp<0)\n\t\t\t\t\ttemp=0;\n\t\t\t\tif(temp>max2){\n\t\t\t\t\tmax2=temp;\n\t\t\t\t}\t\n\t\t\t}\n\t\n\tif(max1>max2)\n\t\tprintf(\""%d\\n\"",max1);\n\telse\n\t\tprintf(\""%d\\n\"",max2);\n\t\t\n\t\n\treturn 0;\n}",WRONG_ANSWER,7,376
1591674557273268224,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-13 14:09:20,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"n=int(input())\ndatas=list(map(int,list(input())))\n# data=input()\n# datas=list(data)\ncount=0\nfor i in range(int(n/2)):\n    for x in range(0,len(datas)-1):\n        if datas[x]!=datas[x+1]:\n            del datas[x]\n            del datas[x]\n            count+=1\n            break\nprint(count*2)",TIME_LIMIT_EXCEEDED,483,4452
1591674569449287680,25b8e249c556de062ec0d61286db67304f907bc70204e22083d75434403578b1,2022-11-13 14:09:23,C,300.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int n,a,b;\n    int c[n],f[n];\n    scanf(\""%d %d %d\"",&n,&a,&b);\n\n    int i;\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&f[i]);\n    int sum=0,h1,h2,flag=0;\n    for(i=0;i<n;i++)\n    {\n        h1=0;\n        h2=0;\n        h1=c[i]*pow(a,f[i]+1)/(f[i]+1);\n        h2=c[i]*pow(b,f[i]+1)/(f[i]+1);\n        flag=h1-h2;\n        sum+=flag;\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}\n",ACCEPTED,44,492
1591674573815558144,7ecf54bf0ea2db8ab0397aa941f19ec79a351bc3e86e8c01673aa09a69b3a6db,2022-11-13 14:09:24,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n\tint n,l,max;\n\tscanf(\""%d\"",&n);\n\tint s[n];\n\t//录入\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&s[i]);\n\t}\n    max=s[0];\n\t//找区间\n\tfor(int j=0;j<n;j++)\n\t{\n\t\tl = 1;\n\t\tfor(int k=j;k<n-1;k++)\n\t\t{\n            if(s[j]>s[k+1])break;\n\t\t\tl++;\n\t\t}\n\t\t//printf(\""%d %d\\n\"",s[j],l);\n\t\tif(max<s[j]*l)max=s[j]*l;\n\t}\n\t//打印结果\n\tprintf(\""%d\\n\"",max);\n}\n\n",WRONG_ANSWER,18,512
1591674607504252928,157388d8d83262bba5955406e39bb36c3baacd3a224f63ce1739541bb582af20,2022-11-13 14:09:32,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int P,Q,R,y;\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    switch(y){\n            case 1:P;break;\n            y=P;\n            case 2:Q;break;\n            y=P+Q;\n            case 3:R;break;\n            y=Q+R;\n    }\n    \n    if(P+Q>P+R)\n    printf(\""%d\"",P+R);\n    else if(P+Q>Q+R)\n        printf(\""%d\"",Q+R);\n    else \n        printf(\""%d\"",P+Q);\n}",WRONG_ANSWER,20,352
1591674623157362688,0d24b4ee85e6e3a4cc694f7e11105fa2aaf93fd10d4cbe81657f252e2d675435,2022-11-13 14:09:36,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#define N 100\nint main()\n{\n    int n,m;\n     int i=0,j,t;\n     int arr[N];\n\n     int sum=0 ;\n\n   scanf(\""%d\"",&n);\n   while(i<n){\n\n    scanf(\""%d\"",&m); //数组\n    arr[i++]=m;\n   }\n\n  for(j=0;j<=i;){\n\n   if(j<i-2){\n    if(arr[j]<=arr[j+2]){\n        sum=arr[j+2]-5;  //消耗5\n        if(j==0){\n              j+=2;\n           }\n        else\n            j+=3;\n\n    }\n    if(arr[j]>arr[j+2]){\n        sum=arr[j]-5;\n        if(j==0){\n            j=j;\n        }\n        else{\n            j+=1;//开始第一步不算\n        }\n\n    }\n        }\n    else{\n        sum=arr[j]-5;\n        j+=1;\n    }\n  }\n\n  printf(\""%d\"",sum);\n\n\n\n    return 0;\n}\n",SEGMENTATION_FAULT,6,348
1591674681823125504,c39a4349139942a7aa7456b2c4609f8d0f9d0d3465be213d33870ec87eab1e58,2022-11-13 14:09:50,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main(void) \n{\n  int n,i,a[30],s=0;\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  \tif(a[i]==a[i+1]||a[i]==a[i+2])\n  \ts++;\n  }\n  printf(\""%d\"",s);\n    return 0;\n}",WRONG_ANSWER,5,488
1591674691411304448,42cfad7191c5e6c0eee156c4369182744d6c5db3bc2a5dc87f9f1be6ee4bbcfe,2022-11-13 14:09:52,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main(){\n   int n,a[n];\n   scanf(\""%d\"",&n);\n   int i,sum=0;\n   for(i=0;i<n;i++)\n   scanf(\""%d \"",&a[i]);\n   for(i=1;i<n;i++){\n       if(a[i]>a[i+1]){\n        if(a[i+1]<a[i+2]||a[i]>a[i+3])\n   \t\t\t   \tsum=sum+1;\n       }\n\t    }\n\n   printf(\""%d\"",sum);\n   return 0;\n} ",WRONG_ANSWER,5,204
1591674717705351168,f1feb45d46abad163f730e5b023ce1df76883054d0a1741228a76c2c69aa3eda,2022-11-13 14:09:59,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main(){\n    int P,Q,R,M;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    M=P+Q;\n    if(M>P+R)\n        M=P+R;\n    else if(M>Q+R)\n        M=Q+R;\n    printf(\""%d\\n\"",M);\n    return 0;\n}",WRONG_ANSWER,29,508
1591674742871187456,675867a135da6702ed27c0eec3e4b6d2a7d95c44854c01823fc152f0689f010d,2022-11-13 14:10:05,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#define MAX 10000\nint main(void)\n{\n\tint n, a[MAX]={0};\n\tint i;\n\tint max1, max2, temp;\n\tmax1=max2=0;\n\ttemp=0;\n\tscanf(\""%d\"",&n);\n\tfor(i=1;i<=n;i++)\n\t\tscanf(\""%d\"",&a[i]);\n\t\n\t\t\tfor(i=1;i<=n;i++)\n\t\t\t{\n\t\t\t\ttemp+=a[i]-5;\n\t\t\t\tif(temp<0)\n\t\t\t\t\ttemp=0;\n\t\t\t\tif(temp>max1)\n\t\t\t\t\tmax1=temp;\n\t\t\t}\n\t\t\t\n\t\t\ttemp=0;\n\t\t\tfor(i=1;i<=n;i+=3)\n\t\t\t{\n\t\t\t\ttemp+=a[i]-5;\n\t\t\t\tif(temp<0)\n\t\t\t\t\ttemp=0;\n\t\t\t\tif(temp>max2){\n\t\t\t\t\tmax2=temp;\n\t\t\t\t}\t\n\t\t\t}\n\t\n\tif(max1>max2)\n\t\tprintf(\""%d\\n\"",max1);\n\telse\n\t\tprintf(\""%d\\n\"",max2);\n\t\t\n\t\n\treturn 0;\n}",WRONG_ANSWER,5,460
1591674756955648000,b80fc2aed0abde15bdaa9327874c9784da696b6ed442d90001602ff2a017be15,2022-11-13 14:10:08,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h> \n#include<math.h> \nint main()\n{\n    int n,i,j,t,c=1,sum=0,m;\n\tint a[10000];\n\tscanf(\""%d\"",&n);\n\tscanf(\""%d\"",&t);\n\tm=n;\n\tfor(j=0;j<n;j++)\n\t{\n\tfor(i=j+1;i<n;i++)\n\t  c=c*10;\n\tif(j==n-1)\n\t  c=1; \n\ta[j]=t/c;\n\tt=t-a[j]*c;   \n\t}\n\t\n\n\tfor(j=0;j<m;j++)\n     {\n\t for(i=0;i<n-1;i++)\n\t {\n\t if(a[i]==a[i+1])\n\t   { \n\t   for(;i<n-2;i++)\n\t    a[i]=a[i+2];\n\t\tn=n-2;\n        sum=sum+2;\n\t\tbreak;\n\t}\n\t\n  } \n}\n  \t  printf(\""%d\"",sum); \n\t  return 0; \n}",FLOAT_POINT_EXCEPTION,4,192
1591674779030315008,7e6a67f270e740aba8788a12d9a49939621a28d5059d3ced2247a86914b0a3b3,2022-11-13 14:10:13,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint h[n];\n\tint i,num=0;\n\tfor(i=0;i<n;i++)\n\t\tscanf(\""%d\"",&h[i]);\n\tfor(i=1;i<n-1;i++)\n\t{\n\t\tif(h[i]>=h[i-1]) continue;\n\t\tif(h[i]>h[i+1]) continue;\n\t\tnum++;\n\t}\n\tprintf(\""%d\"",num);\n}",ACCEPTED,36,460
1591674810147823616,dcc1017bcd698bd6a0eee54e4ed848d4c51a3a26608990cdd2137e4c01065a1e,2022-11-13 14:10:21,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main (){\n    int a,b,i=-1,s1=0,s2=0,sum=0;\n    int x[100];\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++){\n    scanf(\""%d\"",&b);\n        x[i]=b;\n    } \n    while(i<=a){\n        s1=x[i+1];\n        s2=x[i+3];\n        if(s1>=s2){\n            sum=x[i+1]-5;\n        }\n        else {\n            sum=x[i+3]-5;\n        }\n    }\n    printf(\""%d\"",sum);\n return 0;   \n}",SEGMENTATION_FAULT,4,200
1591674881845256192,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-13 14:10:38,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main(){\n    int n,a[1000],count=0,i,j,t=0;\n      scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n        \n        \n    \n    for( j=1;j<n-2;j++)\n    {\n        \n        if(a[j]<a[j-1]&&a[j]<a[j+1])\n        { count++;   }\n             \n       else\n        if(a[j]==a[j+1])\n        {t=1;\n            //continue;\n        }\n        \n        if(a[j]<a[j]) {count+=t;t=0;}\n      \n        \n            \n    }\n    \n    \n /*  if(count!=0)\n      printf(\""%d\"",count);\n   else \n     printf(\""0\"");*/\n    \n    printf(\""%d\"",count);\n          \n}",WRONG_ANSWER,37,352
1591674883753697280,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-13 14:10:38,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main(){\n\tint n,i,j,k=0;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t} \n\tfor(i=1;i<n-1;i++){\n\t\tif(a[i]<a[i-1]){\n\t\t\tfor(j=i;j<n;j++){\n\t\t\t\tif(a[j]>a[j+1]&&a[j+1]>=a[i]) \n\t\t\t\t{\n\t\t\t\t\tk++;\n\t\t\t\t\ti=j;\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse continue;\n\t\t\t}\n\t\t}\n\t\t\telse continue;\n\t}\n\tprintf(\""%d\\n\"",k);\n}",WRONG_ANSWER,8,332
1591674894642110464,5a1c17b308a3b3595833d34c6bdfb75e9f5dd0d065acfeb7f28ab8102ba7406c,2022-11-13 14:10:41,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a[10000]={0};\n    int i,n;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    int count = 0;\n    for(i=1;i<n-1;i++){\n        if(a[i]<a[i-1]&&a[i]<a[i+1]){\n            count++;\n            }\n        if(a[i]==a[i+1]&&a[i-1]>a[i]){\n        for(;i<n-3;i++){\n            if(a[i+1]<a[i+2]){\n                count = count+1;\n                break;\n            }\n            }\n        }\n    }\n    printf(\""%d\"",count);\n    return 0;\n}\n",ACCEPTED,43,476
1591674912946008064,129ddfe9d2d4553f365faf2fdc5e2f0c271b2e342a4cff13802dda8ef8b3d1c2,2022-11-13 14:10:45,Java,0.0,1591610585635213318,1591131464941563904,1049226928954454016,package demo01;\n\nimport java.util.Scanner;\n\nclass Test02 {\n\tpublic static void main(String[] args) {\n\t\tScanner s = new Scanner(System.in);\n\t\tint a = s.nextInt();\n\t\tint b = s.nextInt();\n\t\tint c = s.nextInt();\n\t\tint[] n = new int[3];\n\t\tint min = a+b;\n\t\tif(a+c <= min){\n\t\t\tmin = a+c;\n\t\t}\n\t\tif(b+c <= min){\n\t\t\tmin =b+c;\n\t\t}\n\t\tSystem.out.println(min);\n\t}\n},COMPILE_ERROR,0,0
1591674920466407424,5bd1a8718ea7fb820055421c67b8e0a468e08d951f729a24e55bf407b3bdb1f6,2022-11-13 14:10:47,C++,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <iostream>\n#include <algorithm>\nusing namespace std;\n\n\n\n\n\n\nint main()\n{\n\n    int p,q,r,c;\n    cin>>p>>q>>r;\n    for(int i=0;i<3;i++){\n        c=min(p+q,min(q+r,r+q+p));\n    }\n    cout<<c;\n    return 0;\n}\n",ACCEPTED,59,760
1591674932684447744,1d5ac1674206114dbc3c7883f7305e131f037b2aefcb3b297d62e80957fc1452,2022-11-13 14:10:50,C++,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#define MAX 501\nint G[MAX]={0};\nint main()\n{\n\tint n,i,max;\n\tscanf(\""%d\"",&n);\n\tgetchar();\n\tfor(i=0;i<n;i++)\n        scanf(\""%d\"",&G[i]);\n\tG[i]='\\0';\n\tmax=G[0];\n\tfor(i=0;G[i]!='\\0'&&i<n;)\n\t{\n\t\t\tif(G[i+3]!='\\0')\n\t\t\t{\n\t\t\t\tif(G[i+3]>G[i+1])\n\t\t\t\t{\n\t\t\t\t\tmax+=G[i+3]-5;\n\t\t\t\t    i+=3;\n\t\t\t\t}\t\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tif(G[i+1]!='\\0')\n\t\t\t\t{\n\t\t\t\t    max+=G[i+1]-5;\n\t\t\t\t    i+=1;\n\t\t\t\t}\t\t\n\t\t\t}\n\t\t\t\n\t}\n\tprintf(\""%d\"",max);\n}\t",SEGMENTATION_FAULT,8,348
1591674966809260032,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 14:10:58,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,i,h=0;\n    int b[15];\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=1;i<a-1;i++)\n        {\n            if(b[i]==0)\n               h++;\n        }\n        printf(\""%d\\n\"",h);\n    return 0;\n}\n",RUNTIME_ERROR,5,356
1591674974761672704,70c675ddfcb60b2192bc8ac38fb068fec0500208a5bf97a796c7cc074b43cf87,2022-11-13 14:11:00,Java,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"import java.util.Scanner;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner myScanner = new Scanner(System.in);\n\t\tint n = myScanner.nextInt();\n\t\tint[] arr = new int[n];\n\t\tint count = 0;\n\t\tfor(int i = 0; i < n;i++){\n\t\t\tarr[i] = myScanner.nextInt();\n\t\t}\n\t\tfor(int j = 1;j <= n-3;j++){\n\t\t\tif(arr[j] > arr[j+1] && arr[j+1] <= arr[j+2]){\n\t\t\t\tcount++;\n\t\t\t\tif(arr[j] == arr[j-1] && arr[j] > arr[j+1]){\n\t\t\t\t\tcount -= 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.printf(\""%d\"",count);\n\t}\n\n}",WRONG_ANSWER,495,24904
1591674977697685504,a57fdafe4877cd9608fc0ac8a5120a47bc60a015785960e61b67b4e66187c2f2,2022-11-13 14:11:01,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 1000\nint main()\n{\n    int n,i,b,j,max;\n    int a[N],c[N];\n   scanf(\""%d\"",&n);\n   for(i=0;i<n;i++)\n    scanf(\""%d \"",&a[i]);\n  for(i=0;i<n;i++){\n    for(j=0;j<n;j++){\n        if(a[i]>=a[j]){\n            b=a[i];\n            a[i]=a[j];\n            a[j]=b;\n        }\n    }\n  }\n   for(i=0;i<n;i++)\n        c[i]=a[i]*(i+1);\n     for(i=0;i<n;i++){\n        for(j=0;j<n;j++){\n            if(c[i]>c[j]){\n                max=c[i];\n                c[i]=c[j];\n                c[j]=max;\n            }\n        }\n    }\n    printf(\""%d\\n\"",c[0]);\n    return 0;\n}",WRONG_ANSWER,6,348
1591675002544775168,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 14:11:07,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,i,h=0;\n    int b[20];\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=1;i<a-1;i++)\n        {\n            if(b[i]==0)\n               h++;\n        }\n        printf(\""%d\\n\"",h);\n    return 0;\n}\n",WRONG_ANSWER,9,328
1591675002666364928,675867a135da6702ed27c0eec3e4b6d2a7d95c44854c01823fc152f0689f010d,2022-11-13 14:11:07,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#define MAX 10000\nint main(void)\n{\n\tint n, a[MAX]={0};\n\tint i;\n\tint max1, max2, temp;\n\tmax1=max2=0;\n\ttemp=0;\n\tscanf(\""%d\"",&n);\n\tfor(i=1;i<=n;i++)\n\t\tscanf(\""%d\"",&a[i]);\n\t\n\t\t\tfor(i=1;i<=n;i++)\n\t\t\t{\n\t\t\t\ttemp+=a[i]-5;\n\t\t\t\tif(temp<0)\n\t\t\t\t\ttemp=0;\n\t\t\t\tif(temp>max1)\n\t\t\t\t\tmax1=temp;\n\t\t\t}\n\t\t\t\n\t\t\ttemp=0;\n\t\t\tfor(i=0;i<=n;i+=3)\n\t\t\t{\n\t\t\t\ttemp+=a[i]-5;\n\t\t\t\tif(temp<0)\n\t\t\t\t\ttemp=0;\n\t\t\t\tif(temp>max2){\n\t\t\t\t\tmax2=temp;\n\t\t\t\t}\t\n\t\t\t}\n\t\n\tif(max1>max2)\n\t\tprintf(\""%d\\n\"",max1);\n\telse\n\t\tprintf(\""%d\\n\"",max2);\n\t\t\n\t\n\treturn 0;\n}",WRONG_ANSWER,10,328
1591675027828039680,05f9d62a2660f27e0711448c225e5e0fe6347745a2c93edb6296c0a2ffbc6605,2022-11-13 14:11:13,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nmain()\n{\n    int i,j,n,p,a[10000],sum=0,max=0;\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       sum=0;\n       for(j=i;j<n;j++)\n           if(a[i]<=a[j])\n               sum+=a[i];\n            else\n                break;\n       if(sum>=max)\n           max=sum;\n   }\n       printf(\""%d\"",max);    \n      \n}",WRONG_ANSWER,21,324
1591675031120535552,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 14:11:13,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i;\n    int sum=0;\n    int t=0;\n    scanf(\""%d\"",&n);\n        int a[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n-3;i++)\n    {\n        if(a[i]>a[i+2])\n        {\n            sum=sum+a[i+1]-5;\n            t=t+1;\n        }\n        else\n        {\n            sum=sum+a[i+3]-5;\n            t=t+3;\n        }\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,8,200
1591675077186609152,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 14:11:24,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[n],s[n];\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        s[i]=(n-i)*a[i]\n            if(s[i+1]>a[i])\n                printf(\""%d\"",s[i+1]);\n        else\n            printf(\""%d\"",s[i+1]);\n        }\n    return 0;\n}",COMPILE_ERROR,0,0
1591675083180224512,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-13 14:11:26,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"n = int(input())\nlist1 = []\na=0\nlist1 = input().split(\"" \"")\nfor i in range(1,n-1):\n    if list1[i-1] > list1[i]:\n        if list1[i] <= list1[i+1]:\n            print(i)\n            a+=1\n    i+=1\nprint(a)",WRONG_ANSWER,23,2780
1591675105758175232,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 14:11:31,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[n],s[n],i;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        s[i]=(n-i)*a[i]\n            if(s[i+1]>a[i])\n                printf(\""%d\"",s[i+1]);\n        else\n            printf(\""%d\"",s[i+1]);\n        }\n    return 0;\n}",COMPILE_ERROR,0,0
1591675107104534528,542d97133043a1f2156354473a31382c35bb2836688b0ed76eae59c52a2e0e3a,2022-11-13 14:11:32,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main()\n{\n    int m,n,o,sum=0;\n    scanf(\""%d\"",&n);\n    if(n>=3&&n<=10000)\n    {\n        int h[n];\n        for(m=0;m<n;m++)\n        {\n            scanf(\""%d\"",&h[m]);\n        }\n        \n            for(o=1;o<n-1;o++)\n            {\n                if(h[o]<h[o+1]||h[o]<h[o-1])\n                {\n                    sum=sum+1;\n                    if(h[o]==h[o+1])\n                        sum=sum-1;\n                }\n            }\n            printf(\""%d\"",sum); \n         \n    }\n    \n    \n}",WRONG_ANSWER,5,488
1591675123697201152,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 14:11:36,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,i,h=0;\n    int b[20];\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++)\n        scanf(\""%d\"",b[i]);\n    for(i=1;i<a-1;i++)\n        {\n            if(b[i]==0)\n               h++;\n        }\n        printf(\""%d\\n\"",h);\n    return 0;\n}\n",SEGMENTATION_FAULT,9,200
1591675125483986944,6933dcb3592e2d6f6fc887ed9a5537aab21a30f76450c9b5043f7776bfc39a59,2022-11-13 14:11:36,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nvoid main(){\n    int n,start,mind,end,temp=0,i;\n    scanf(\""%d\"",&n);\n    int high[n];\n    for(start=0;start+1<=n;start++){\n        if(high[start]<high[start+1]){\n            for(mind=start+1;mind+1<=n;mind++){\n                if(high[mind]>high[mind+1]){\n                    start=mind;\n                    temp++;\n                }\n            }\n        }\n    }\n    printf(\""%d\"",temp);\n}",WRONG_ANSWER,11,512
1591675168236560384,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 14:11:46,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,i,h=0;\n    int b[20];\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=1;i<a-1;i++)\n        {\n            if(b[i]==0)\n               h++;\n        }\n        printf(\""%d\\n\"",h);\n    return 0;\n}\n",WRONG_ANSWER,6,488
1591675180911714304,5ed1ed5f3786d45db71190023ef590496fd0d8d8cfe4af0f2c94d1d387178674,2022-11-13 14:11:49,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,a[1000],k=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=1;i<n;i++)\n    {\n        if(a[i-1]>a[i])\n        {\n            if(a[i]<a[i+1])\n                k++;\n        }\n    }\n    printf(\""%d\"",k);\n    return 0;\n}\n",WRONG_ANSWER,27,512
1591675187450634240,17759f531671f838bf3fae4270190e93b6109026f9503f986c1ed85bb412007d,2022-11-13 14:11:51,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int i,n,a,b,c[30000],F[30000];\n    double sum1=0,sum2=0;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&F[i]);\n    for(i=0;i<n;i++)\n    {\n        sum1=sum1+(c[i]/(F[i]+1))*(pow(a,(F[i]+1)));\n        sum2=sum2+(c[i]/(F[i]+1))*(pow(b,(F[i]+1)));\n    }\n    printf(\""%d\"",(int)(sum1-sum2));\n}",WRONG_ANSWER,10,220
1591675188700524544,0ccbaaa612b3d01dbe621ce5e7366d6e26d2e5adf55047d92c6eb7adf78a979d,2022-11-13 14:11:51,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int n,a,b;cin>>n>>a>>b;\n    int x[n],y[n];\n    for(int i=0;i<n;i++) cin>>x[i];\n    for(int i=0;i<n;i++) cin>>y[i];\n    double suma=0,sumb=0;\n    for(int i=0;i<n;i++)\n    {\n        suma+=(x[i]/(y[i]+1))*pow(a,y[i]+1);\n    }\n    for(int i=0;i<n;i++)\n    {\n        sumb+=(x[i]/(y[i]+1))*pow(b,y[i]+1);\n    }\n    cout<<suma-sumb;\n    return 0;\n}",WRONG_ANSWER,13,320
1591675245256531968,cf568c7ddc8b221335f880bfbaac4634294e65481e738a2e032c1ab9a84d576f,2022-11-13 14:12:05,Java,0.0,1591610585639407616,1591132307937943552,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) throws Exception {\n        Scanner in = new Scanner(System.in);\n        int n=in.nextInt();\n        int[]h=new int[n];\n        int m=0;\n        for(int i=0;i<=h.length;i++){\n            h[i]=in.nextInt();\n        }\n        for(int i=1;i<=n-1;i++){\n            if(h[i]<h[i-1]){\n                if(h[i]<h[i+1]){\n                    m++;\n                }\n            }else if(h[i]==h[i+1]){\n                for(int j=i+1;h[j]==h[i];j++){\n                    if(h[j]<h[i+1]){\n                        m++;\n                        i=j;\n                    }\n                }\n            }\n        }\n        System.out.println(m);\n       \n    }\n},NON_ZERO_EXIT_CODE,109,24856
1591675246737108992,542d97133043a1f2156354473a31382c35bb2836688b0ed76eae59c52a2e0e3a,2022-11-13 14:12:05,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main()\n{\n    int m,n,o,sum=0;\n    scanf(\""%d\"",&n);\n    if(n>=3&&n<=10000)\n    {\n        int h[n];\n        for(m=0;m<n;m++)\n        {\n            scanf(\""%d\"",&h[m]);\n        }\n        \n            for(o=1;o<n-1;o++)\n            {\n                if(h[o]<h[o+1]||h[o]<h[o-1])\n                {\n                    sum=sum+1;\n                    if(h[o]==h[o+1])\n                        sum=sum-1;\n                }\n            }\n            printf(\""%d\"",sum); \n         \n    }\n    return 0;\n    \n}",WRONG_ANSWER,14,204
1591675258883858432,7ecf54bf0ea2db8ab0397aa941f19ec79a351bc3e86e8c01673aa09a69b3a6db,2022-11-13 14:12:08,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n\tint n,l,max;\n\tscanf(\""%d\"",&n);\n\tint s[n];\n\t//录入\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&s[i]);\n\t}\n    max=s[0];\n\t//找区间\n\tfor(int j=0;j<n;j++)\n\t{\n\t\tl = 1;\n\t\tfor(int k=j;k<n-1;k++)\n\t\t{\n            if(s[j]>s[k+1])break;\n\t\t\tl++;\n\t\t}\n\t\t//printf(\""%d %d\\n\"",s[j],l);\n\t\tif(max<s[j]*l)max=s[j]*l;\n\t}\n\t//打印结果\n\tprintf(\""%d\\n\"",max);\n}\n\n",WRONG_ANSWER,15,512
1591675266702041088,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-11-13 14:12:10,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#define N 10000\nint main()\n{\n    int i,j,n;\n    int a[N]={0};\n    int count=0;\n    scanf(\""%d\"",&n);\n    if(n<3)\n        return 0;\n    else\n    {\n        for(i=0;i<n;i+=2)\n            scanf(\""%d\"",&a[i]);\n        for(i=1;i<n;i++)\n        {\n            for(j=i+2;j<n;j++)\n            {\n                if(a[i]>a[i+1]&&a[j]>a[i+1])\n                {\n                    count++;\n                    continue;\n                }\n            }\n        }\n        printf(\""%d\\n\"",count);\n        return 0;\n    }\n}",WRONG_ANSWER,5,320
1591675297010036736,eeab3421c2b685f7d51b09a289b82fe82ba0d3896984d09aeffb9d022232d887,2022-11-13 14:12:17,Java,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.math.BigDecimal;\nimport java.util.Scanner;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n    public static void main(String[] args) {\n        FastReader fastReader =  new FastReader();\n       int n = fastReader.nextInt();\n       long result = 0;\n       long[] f = new long[n];\n       for(int i=0;i<n;i++)\n           f[i] = fastReader.nextLong();\n       for(int i = 0;i<n;i++){\n           int j = i;\n           long b = 0;\n           for( j= i; j<n &&f[j]>= f[i]  ;j++){\n               long a = Math.min(f[i],f[j])*(j-i+1);\n               b = Math.max(b,a);\n           }\n           if(j >=n) j = n-1;\n          // long t = Math.min(f[i],f[j])*(j-i+1);\n            result = Math.max(result,b);\n          // System.out.println(\""i\""+i);\n           //System.out.println(\""j\""+j);\n           //System.out.println(\""result\""+result);\n       }\n        System.out.println(result);\n    }\n\n\n    static class FastReader {\n        BufferedReader br;\n        StringTokenizer st;\n        public FastReader()\n        {\n            br = new BufferedReader(\n                    new InputStreamReader(System.in));\n        }\n\n\n        String next()\n        {\n            while (st == null || !st.hasMoreElements()) {\n                try {\n                    st = new StringTokenizer(br.readLine());\n                }\n                catch (IOException e) {\n                    e.printStackTrace();\n                }\n            }\n            return st.nextToken();\n        }\n\n\n\n        int nextInt() { return Integer.parseInt(next()); }\n\n        long nextLong() { return Long.parseLong(next()); }\n\n        double nextDouble(){return Double.parseDouble(next());}\n\n\n        String nextLine()\n        {\n            String str = \""\"";\n\n            try {\n                if (st!= null && st.hasMoreTokens()){\n                    str = st.nextToken(\""\\n\"");\n                } else {\n                    str = br.readLine();\n                }\n            }\n            catch (IOException e) {\n                e.printStackTrace();\n            }\n            return str;\n        }\n\n\n    }\n}\n\n\n\n",WRONG_ANSWER,207,22840
1591675338500136960,a57fdafe4877cd9608fc0ac8a5120a47bc60a015785960e61b67b4e66187c2f2,2022-11-13 14:12:27,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 100\nint main(){\n    int i,n,j=0;\n    int a[N];\n    scanf(\""%d\"",&n);\n    if(n<3)\n        return 0;\n    else{\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n      if(a[i]!=0&&a[i]!=2&&a[i]!=1)\n            return 0;\n    }\n    if(a[0]!=0||a[n]!=0)\n        return 0;\n    else{\n        for(i=1;i<n-1;i++){\n        if(a[i]<a[i+1])\n            j++;\n    }\n    printf(\""%d\\n\"",j);\n    }\n    }\n    return 0;\n}",WRONG_ANSWER,5,324
1591675367298183168,d5db2853d0fce01dd43b2b6adf379841403b78fda0e6cb22c82f6f2b59da60dc,2022-11-13 14:12:34,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nmain(){\n\tint p,q,r,s;\n\tscanf(\""%d %d %d\"",&p,&q,&r);\n\tif(p+q>r+q){\n\t\tif(r+q>p+r){\n\t\t\ts=p+r;\n\t\t}\n\t\telse s=r+q;\n\t}\n\telse s=p+q;\n\tprintf(\""%d\"",s);\n\treturn 0;\n}",ACCEPTED,34,468
1591675405080485888,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 14:12:43,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <string.h>\nint main()\n{\n    int k,len,i,g=0,l=0;\n    char str[50];\n    scanf(\""%d\"",&k);\n    scanf(\""%s\"",str);\n    len  = strlen(str);\n    for(i=0;i<=len;i++)\n    {\n        if(str[i]=='0')\n        g++;\n        else\n        l++;\n    }\n    //g-=8;//0的个数;\n    //l-=52;//1的个数;\n    if(g>l)\n    printf(\""%d\\n\"",2*l);\n    else\n    printf(\""%d\\n\"",2*g);\n    return 0;\n}\n\n",SEGMENTATION_FAULT,55,512
1591675470889148416,ccc42b8437aa15d1214e4623799ed35cd8ea8087c26cb1b596d51ae4556ea39c,2022-11-13 14:12:58,Python,0.0,1591610585635213315,1591129345182261248,1049226928954454016,a=eval(input())\nb=input().split()\ndeifen=0\nxiaohao=0\ni=-1\nwhile i<a:\n    if i+3<a:\n        if int(b[i+1])<=int(b[i+3]):\n            deifen+=int(b[i+3])\n            xiaohao+=5\n            i+=3\n        else:\n            deifen+=int(b[i+1])\n            xiaohao+=5\n            i+=1\nprint(deifen-xiaohao),TIME_LIMIT_EXCEEDED,400,3036
1591675498529611776,f1feb45d46abad163f730e5b023ce1df76883054d0a1741228a76c2c69aa3eda,2022-11-13 14:13:05,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main(){\n    int P,Q,R,M;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    M=P+Q;\n    if(M>P+R)\n        M=P+R;\n    if(M>Q+R)\n        M=Q+R;\n    printf(\""%d\\n\"",M);\n    return 0;\n}",ACCEPTED,27,356
1591675532415361024,17759f531671f838bf3fae4270190e93b6109026f9503f986c1ed85bb412007d,2022-11-13 14:13:13,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int i,n,a,b,c[30000],F[30000],sum;\n    double sum1=0,sum2=0;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&F[i]);\n    for(i=0;i<n;i++)\n    {\n        sum1=sum1+(c[i]/(F[i]+1))*(pow(a,(F[i]+1)));\n        sum2=sum2+(c[i]/(F[i]+1))*(pow(b,(F[i]+1)));\n    }\n    sum=(int)(sum1-sum2);\n    printf(\""%d\"",sum);\n}",WRONG_ANSWER,5,356
1591675575750897664,c39a4349139942a7aa7456b2c4609f8d0f9d0d3465be213d33870ec87eab1e58,2022-11-13 14:13:23,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main(void) \n{\n  int n,i,a[30],s=0;\n  scanf(\""%d\"",&n);\n  for(i=0;i<n;i++)\n  scanf(\""%d\"",&a[i]);\n  for(i=0;i<n;i++)\n  \tif(a[i]==a[i+1]||a[i]==a[i+2])\n    {\n        s++;\n       continue;\n    }\n  printf(\""%d\"",s);\n    return 0;\n}",WRONG_ANSWER,4,328
1591675615143845888,c358160a3e618a44cd693944fe10043e6372f46bf7d517c3c3f583bd85b17c5e,2022-11-13 14:13:33,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"n=int(input())\nm=input().split()\ncount=0\nfor i in range(1,n-2):\n    if int(m[i])<int(m[i+1])and int(m[i])<int(m[i-1]):\n        count=count+1 \n    if int(m[i])<int(m[i-1])and int(m[i])==int(m[i+1]):\n        for j in range(i+1,n-2):\n            if m[j]==m[j+1]:\n                countine\n            if m[j]<m[j+1]:\n                count=count+1\n                break\n          \nprint(count)   \n    \n",NON_ZERO_EXIT_CODE,87,2888
1591675635054161920,f6233bf69e5717913375f818af07214d1d2de6df0cd3bcb24368fbde112d6d15,2022-11-13 14:13:37,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,a=input()\na=int(a)\nc=input().split\nb[a]=tuple(c)\na=len(b)\nprint(b),NON_ZERO_EXIT_CODE,16,2760
1591675724875182080,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-13 14:13:59,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main(){\n\tint n,i,j,k=0;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t} \n\tfor(i=1;i<n-1;i++){\n\t\tif(a[i]<a[i-1]){\n\t\t\tfor(j=i;j<n;j++){\n\t\t\t\tif(a[j]>a[j+1]&&a[j]>=a[i]) \n\t\t\t\t{\n\t\t\t\t\tk++;\n\t\t\t\t\ti=j;\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse continue;\n\t\t\t}\n\t\t}\n\t\t\telse continue;\n\t}\n\tprintf(\""%d\\n\"",k);\n}",WRONG_ANSWER,4,204
1591675753463558144,5ed1ed5f3786d45db71190023ef590496fd0d8d8cfe4af0f2c94d1d387178674,2022-11-13 14:14:06,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,a[1000],k=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=1;i<n-1;i++)\n    {\n        if(a[i-1]>a[i])\n        {\n            if(a[i]<a[i+1])\n                k++;\n            else if(a[i]==a[i+1])\n            {\n                i++;\n                if(a[i]<a[i+1])\n                    k++;\n            }\n        }\n    }\n    printf(\""%d\"",k);\n    return 0;\n}\n",WRONG_ANSWER,32,368
1591675773751406592,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-13 14:14:11,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main(){\n    int n,a[1000],count=0,i,j,t=0;\n      scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n        \n        \n    \n    for( j=1;j<n-2;j++)\n    {\n        \n        if(a[j]<a[j-1]&&a[j]<a[j+1])\n        { count++;   }\n             \n       else\n        if(a[j]==a[j+1])\n        {t=1;\n            continue;\n        }\n        \n        if(a[j]<a[j+1]) {count+=t;t=0;}\n      \n        \n            \n    }\n    \n    \n /*  if(count!=0)\n      printf(\""%d\"",count);\n   else \n     printf(\""0\"");*/\n    \n    printf(\""%d\"",count);\n          \n}",WRONG_ANSWER,34,508
1591675774632210432,eee658ba43cf6fba46676f4d9f167223fd9b57ec54a5d813fd1d01afc3088139,2022-11-13 14:14:11,C,0.0,1591610585635213314,1591128862958940160,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n  int a[4],temp;\n  int i,j,n;\n  scanf(\""%d\"",&n);\n  for(i=0;i<4;i++)\n    scanf(\""%d\\n\"",&a[i]);\n  for(i=1;i<4;i++)\n    for(j=0;j<4-1;j++)\n  {\n      if(a[j]<a[j+1])\n      {\n          temp=a[j];\n          a[j]=a[j+i];\n          a[j+1]=temp;\n      }\n    }\n    printf(\""5 3 2 1 1\\n\"");\n    return 0;\n\n}\n\n",WRONG_ANSWER,5,336
1591675827832762368,abe2744e33bb397ffb9bb13afcb202f611378fb4fc5801202f03933298ce5f5d,2022-11-13 14:14:23,Java,300.0,1591610585639407617,1591132482555211776,1049226928954454016,"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\npublic static void main(String[] args) throws IOException{\n\tBufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n\tint n = Integer.valueOf(reader.readLine());\n\tString[] string = reader.readLine().split(\"" \"");\n\tint[] ints=new int[n];\n\t\n\tfor(int i=0;i<n;i++){\n\t\tints[i]=Integer.valueOf(string[i]);\n\t\n\t}\n\t\n\tint min;\n\tint[][] mianji=new int[n][n];\n\tfor(int i=0;i<n;i++){\n\t\t\n\t\tfor(int k=i;k<n;k++){\n\t\t\tmin=ints[i];\n\t\t\tfor(int j=i;j<=k;j++){\n\t\t\tif(ints[j]<min){\n\t\t\t\t\n\t\t\t\tmin=ints[j];\n\t\t\t}\n\t\t}\n\t\t\t\n\t\t\tmianji[i][k]=min*(k+1-i);\n\t\t}\n\t\t\n\t\t\n\t}\n\tint max=0;\n\tfor(int i=0;i<n;i++){\n\t\tfor(int j=0;j<n;j++){\n\t\t\t\n\t\t\tif(mianji[i][j]>max)\n\t\t\t{\n\t\t\t\tmax=mianji[i][j];\n\t\t\t}\n\t\t}\n\t}\n\tSystem.out.println(max);\n}\n}\n",ACCEPTED,353,23064
1591675833251803136,675867a135da6702ed27c0eec3e4b6d2a7d95c44854c01823fc152f0689f010d,2022-11-13 14:14:25,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#define MAX 10000\nint main(void)\n{\n\tint n, a[MAX]={0};\n\tint i;\n\tint max1, max2, temp;\n\tmax1=max2=0;\n\ttemp=0;\n\tscanf(\""%d\"",&n);\n\tfor(i=1;i<=n;i++)\n\t\tscanf(\""%d\"",&a[i]);\n\t\n\t\t\tfor(i=1;i<=n;i++)\n\t\t\t{\n\t\t\t\ttemp+=a[i]-5;\n\t\t\t\tif(temp<0)\n\t\t\t\t\ttemp=0;\n\t\t\t\tif(temp>max1)\n\t\t\t\t\tmax1=temp;\n\t\t\t}\n\t\t\t\n\t\t\ttemp=0;\n\t\t\tfor(i=3;i<=n;i+=3)\n\t\t\t{\n\t\t\t\ttemp+=a[i]-5;\n\t\t\t\tif(temp<0)\n\t\t\t\t\ttemp=0;\n\t\t\t\tif(temp>max2){\n\t\t\t\t\tmax2=temp;\n\t\t\t\t}\t\n\t\t\t}\n\t\n\tif(max1>max2)\n\t\tprintf(\""%d\\n\"",max1);\n\telse\n\t\tprintf(\""%d\\n\"",max2);\n\t\t\n\t\n\treturn 0;\n}",WRONG_ANSWER,15,352
1591675836028432384,899c5501179552dc1fe5639f9047e15d0f835e7a87c8568193377882d0278985,2022-11-13 14:14:25,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<string.h>\nint main()\n{\n    int n,i,count=0;\n    scanf(\""%d\"",&n);\n    char s[80];\n    gets(s);\n    for(i=0;i<n;i++)\n    {\n        if(s[i]=s[i+1])\n            count+=2;\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",WRONG_ANSWER,4,196
1591675836837933056,423e1acd0d02cf3d43f3c7805099dea4edcb39c2e0fa385e82823b5a7c0dd214,2022-11-13 14:14:26,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int c[10000];\n    int f[10000];\n    int n,a,b;\n    scanf(\""%d\"",&n);\n    scanf(\""%d\"",&a);\n    scanf(\""%d\"",&b);\n    int i;\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&c[i]);\n    }\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&f[i]);\n    }\n    int e=0;\n    int g=0;\n    int d=0;\n    for(i=0;i<n;i++){\n        e=c[i]/(f[i]+1)*pow(a,f[i]+1)+g;\n        g=e;\n    }\n    for(i=0;i<n;i++){\n        e=c[i]*pow(b,f[i]+1)/(f[i]+1)+d;\n        d=e;\n    }\n\n\n\n\n    printf(\""%d\\n\"",g-d);\n    return 0;\n}\n",WRONG_ANSWER,16,476
1591675878697099264,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-13 14:14:36,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n\nint main() {\n\t     int n,zhan,i,j;\n\t\t scanf(\""%d\"",&n); \n\t\t int a[100];\n\t\t for(i=0;i<n;i++)\n\t\t {\n\t\t scanf(\""%d\"",&a[i]);\n\t     }\n\t     a[0]=a[n-1]=0;\n\t\tfor(i=0;i<n;i++)\t\n\t\t{\t\n\t\tfor(j=1;j<n;j++)\n\t\t{\n\t\t\tif(a[i]>a[i+1])\n\t\t\t{\n\t\t\tif(a[i+1]<a[i+j])\n\t\t\tzhan++;\n\t\t\tbreak;\n\t\t\t}\n\t\t\t i++;\n\t\t}\n\t\t\n\t\t}\n\t\tprintf(\""%d\"",zhan);\t\n\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                   \n",WRONG_ANSWER,5,192
1591675888012648448,9d0546dac18a9dc678295254e547925db086add5f872ef42d8015d525afeaf65,2022-11-13 14:14:38,C,0.0,1591610585635213314,1591128862958940160,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 6\nint main()\n{\n    int num[N],i,j,n,k,temp;\n    scanf(\""%d\"",&k);\n    n=k-1;\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&num[i]);\n    }\n    printf(\""%d \"",k);\n    for(i=1;i<n;i++){\n        for(j=0;j<n-i;j++){\n            if(num[j]<num[j+1]){\n                temp=num[j];\n                num[j]=num[j+1];\n                num[j+1]=temp;\n            }\n        }\n    }\n    for(i=0;i<n-1;i++){\n        printf(\""%d \"",num[i]);\n    }\n    for(i=n-1;i<n;i++){\n        printf(\""%d\\n\"",num[i]);\n    }\n}",SEGMENTATION_FAULT,8,512
1591675907008638976,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-13 14:14:42,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<iostream>\nusing namespace std;\nclass resolve{\n    public:\n    void resve(int *h,int n){\n        int nums=0;\n        for(int i=1;i<n-1;i++){\n        if(h[i]<h[i-1]){\n            if(h[i]<h[i+1])\n                nums++;\n            else{\n                for(int j=i+1;j<n-1;j++){\n                    if(h[j]<h[j+1]){\n                        nums++;\n                        i=j+2;\n                        continue;\n                    }   \n                }\n            } \n        }\n        }\n        cout<<nums<<endl;\n    }  \n};\n\nint main(){\n    int n,h[1000];\n    cin>>n;\n    if(n<3)\n        return 0;\n    for(int i=0;i<n;i++){\n        cin>>h[i];\n    }\n    resolve res;\n    res.resve(h,n);\n    return 0;\n}",WRONG_ANSWER,10,484
1591675935743815680,a5291eb67188c2a916aa5dd9fc38f2e449aa9f9a3cd047f282d8c154ea2979cd,2022-11-13 14:14:49,C++,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n    int P,Q,R;\n    cin >> P >> Q >> R;\n    int sum1 = P + Q;\n    int sum2 = Q + R;\n    int min = sum1 > sum2 ? sum2 : sum1;\n    int sum3 = R + P;\n    min = min > sum3 ? sum3 : min;\n    \n    cout << min << endl;\n    \n    return 0;\n}",ACCEPTED,27,476
1591675945717915648,c358160a3e618a44cd693944fe10043e6372f46bf7d517c3c3f583bd85b17c5e,2022-11-13 14:14:52,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"n=int(input())\nm=input().split()\ncount=0\nfor i in range(1,n-2):\n    if int(m[i])<int(m[i+1])and int(m[i])<int(m[i-1]):\n        count=count+1 \n    if int(m[i])<int(m[i-1])and int(m[i])==int(m[i+1]):\n        for j in range(i+1,n-2):\n            if m[j]==m[j+1]:\n                countine\n            if m[j]<m[j+1]:\n                count=count+1\n                break\n                \n    \nprint(count)   \n    \n",NON_ZERO_EXIT_CODE,96,2908
1591675949660516352,9d0546dac18a9dc678295254e547925db086add5f872ef42d8015d525afeaf65,2022-11-13 14:14:52,C,0.0,1591610585635213314,1591128862958940160,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 6\nint main()\n{\n    int num[N],i,j,n,k,temp;\n    scanf(\""%d\"",&k);\n    n=k-1;\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&num[i]);\n    }\n    printf(\""%d \"",k);\n    for(i=1;i<n;i++){\n        for(j=0;j<n-i;j++){\n            if(num[j]<num[j+1]){\n                temp=num[j];\n                num[j]=num[j+1];\n                num[j+1]=temp;\n            }\n        }\n    }\n    for(i=0;i<n-1;i++){\n        printf(\""%d \"",num[i]);\n    }\n    for(i=n-1;i<n;i++){\n        printf(\""%d\\n\"",num[i]);\n    }\n    return 0;\n}",SEGMENTATION_FAULT,8,476
1591675961870147584,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 14:14:55,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[n],i;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if((n-i-1)*a[i+1]>(n-i)*a[i])\n            printf(\""%d\"",(n-i-1)*a[i+1]);\n        else\n            printf(\""%d\"",(n-i)*a[i]);\n        }\n    return 0;\n}",WRONG_ANSWER,8,192
1591675962360868864,d9e00d995e65b04cda3ddef6baec19225e4351002ab4efa981f62d78919a481b,2022-11-13 14:14:55,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n;\n    int a,b;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    int c[n];\n    int f[n];\n    int i;\n    int sum=0;\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&c[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&f[i]);\n    }\n    if(a == b){\n        sum=0;\n    }else{\n         int j;\n        for(j=0;j<2;j++){\n            if(j==0){\n                for(i=0;i<n;i++)\n                {\n                    sum = sum + c[i]/(f[i]+1) * (int)pow(a,f[i]+1);\n                }\n            }\n            else{\n                for(i=0;i<n;i++)\n                {\n                    sum = sum - c[i]/(f[i]+1) * (int)pow(b,f[i]+1);\n                }\n            }\n        }\n    }\n\n    printf(\""%d\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,6,508
1591675995680464896,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 14:15:03,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i;\n    int sum=0;\n    int t=0;\n    scanf(\""%d\"",&n);\n        int a[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n-2;i++)\n    {\n        if(a[i+2]>a[i])\n        {\n            sum=sum+a[i]-5;\n            t=t+1;\n        }\n        else\n        {\n            sum=sum+a[i+2]-5;\n            t=t+3;\n        }\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,8,480
1591676006803714048,1d5ac1674206114dbc3c7883f7305e131f037b2aefcb3b297d62e80957fc1452,2022-11-13 14:15:06,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <string.h>\n#define MAX 100\nvoid main()\n{\n\tchar *s;\n\tint len,i,xt,bt=0;\n\tscanf(\""%d\"",&len);\n\tgets(s);\n\tfor(i=0;i<len;i++)\n\t{\n\t\tif(i!=len-1&&s[i]!=s[i+1])\n\t\t{\n\t\t\tbt++;\n\t\t\tfor(i=i+2;i<len;i--)\n\t\t\t{\n\t\t\t\ts[i]=s[i-1];\n\t\t\t}\n\t\t\ts[i]='\\0';\n\t\t}\n\t}\n\tprintf(\""%d\"",bt);\t\n}",SEGMENTATION_FAULT,8,488
1591676033127211008,1d5ac1674206114dbc3c7883f7305e131f037b2aefcb3b297d62e80957fc1452,2022-11-13 14:15:12,C,0.0,1591610585635213313,1589906790446387200,1049226928954454016,"#include <stdio.h>\n#define MAX 100\nint W1[MAX];\nint W2[MAX];\nint W3[MAX];\nint main()\n{\n\tint i,j,k,n;\n\t\n\t\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++)\n\t{\n\t\tinput(i);\n\t}\n}\n\nvoid input(int j)\n{\n\tint x;\n\n\t\tfor(i=0;;i++)\n\t\t{\n\t\t\tscanf(\""%d\"",&x);\n\t\t\tif(x!='\\n')\n\t\t\t{\n\t\t\t\tWj[i]=x;\n\t\t\t}\n\t\t}\n\n}",COMPILE_ERROR,0,0
1591676033345282048,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 14:15:12,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,i,h=0;\n    int b[20];\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=1;i<a-1;i++)\n        {\n            if(b[i]==0)\n               h++;\n        }\n        printf(\""%d\\n\"",h);\n    return 0;\n}\n",WRONG_ANSWER,8,328
1591676065314267136,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-13 14:15:20,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\nint a,b,c,d,e,f;\n    scanf(\""%d %d %d\"",&a&b&c)\n       d=a+b;\n      e=a+c;\n    f=b+c;\n    if(d<e||f<e)\n        printf(\""%d\"",e);\n    else if(e<d||f<d)\n             printf(\""%d\"",d);\n    else if(e<f||d<f)\n        printf(\""%d\"",f);\n        return 0;\n    \n}\n",COMPILE_ERROR,0,0
1591676094636634112,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-13 14:15:27,Python,300.0,1591610585635213312,1589816514637750272,1049226928954454016,"\nn=int(input())\ndata=input()\ncount0=0\ncount1=0\nfor i in range(len(data)):\n    if data[i]=='0':\n        count0+=1\n    if data[i]=='1':\n        count1+=1\nprint(min([count0,count1])*2)\n",ACCEPTED,108,3040
1591676133081669632,a57fdafe4877cd9608fc0ac8a5120a47bc60a015785960e61b67b4e66187c2f2,2022-11-13 14:15:36,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 100\nint main(){\n    int i,n,j=0;\n    int a[N];\n    scanf(\""%d\"",&n);\n    if(n<3)\n        return 0;\n    else{\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n     for(i=1;i<n-1;i++){\n        if(a[i]<a[i-1]&&a[i]<a[i+1])\n            j++;\n    }\n    printf(\""%d\\n\"",j);\n    }\n    return 0;\n}",RUNTIME_ERROR,20,204
1591676175263752192,3e087b0a196d30fcbb49ca80164c9eb5adf82ae3bb08ec0c141e5728fb180f0d,2022-11-13 14:15:46,Java,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\t\n\tstatic final int MAX=10000;\n\tstatic int solve(int[] arr,int num){\n\t\tint i=1,j=3,res=0;\n\t\twhile(i<=num-4){\n\t\t\tif((arr[i]>arr[i+1])&&(arr[j]>=arr[i+1])){\n\t\t\t\tif(arr[j]==arr[i+1]){\n\t\t\t\t\twhile(arr[j]==arr[i+1]){\n\t\t\t\t\t\tj++;\n\t\t\t\t\t}\n\t\t\t\t\tres++;\n\t\t\t\t\ti=j;\n\t\t\t\t\tj=i+2;\n\t\t\t\t}else{\n\t\t\t\t\tres++;\n\t\t\t\t\ti+=2;\n\t\t\t\t}\t\t\n\t\t\t}else{\n\t\t\t\ti++;\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner sc=new Scanner(System.in);\n\t\tint num=sc.nextInt();\n\t\tint[] arr=new int[MAX];\n\t\tfor(int i=0;i<num;i++){\n\t\t\tarr[i]=sc.nextInt();\n\t\t}\n\t\tSystem.out.print(solve(arr, num));\n\t\tsc.close();\n\t}\n\n}",WRONG_ANSWER,114,25120
1591676183610449920,7ecf54bf0ea2db8ab0397aa941f19ec79a351bc3e86e8c01673aa09a69b3a6db,2022-11-13 14:15:48,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n\tint n,l,max;\n\tscanf(\""%d\"",&n);\n\tint s[n];\n\t//录入\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&s[i]);\n\t}\n    max=s[0];\n\t//找区间\n\tfor(int j=0;j<n;j++)\n\t{\n\t\tl = 1;\n\t\tfor(int k=j;k<n-1;k++)\n\t\t{\n            if(s[j]>s[k+1])break;\n\t\t\tl++;\n\t\t}\n\t\t//printf(\""%d %d\\n\"",s[j],l);\n\t\tif(max<=s[j]*l)max=s[j]*l;\n\t}\n\t//打印结果\n\tprintf(\""%d\\n\"",max);\n}\n\n",WRONG_ANSWER,21,460
1591676253684686848,a57fdafe4877cd9608fc0ac8a5120a47bc60a015785960e61b67b4e66187c2f2,2022-11-13 14:16:05,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 100\nint main(){\n    int i,n,j=0;\n    int a[N];\n    scanf(\""%d\"",&n);\n    if(n<3)\n        return 0;\n    else{\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n     for(i=0;i<n;i++){\n        if(a[i]<a[i-1]&&a[i]<a[i+1])\n            j++;\n    }\n    printf(\""%d\\n\"",j);\n    }\n    return 0;\n}",WRONG_ANSWER,4,196
1591676261792243712,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-13 14:16:07,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int N=10005;\nll a[N];\nll b[N];\nint main(){\nint n;\ncin>>n;\nfor(int i=0;i<n;i++)\ncin>>a[i];\nsort(a,a+n);\nfor(int i=0;i<n;i++)\nb[i]=a[i]*(n-i);\nsort(b,b+n);\ncout<<b[n-1];\n\treturn 0;\n} ",WRONG_ANSWER,9,476
1591676268205322240,b8a7ba8e6c41741e66a8153e5f137c86c8dba9c4dbb2f65f35d7554a5b082d56,2022-11-13 14:16:08,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main(){\n     int p,q,r,a,b,c;\n    scanf(\""%d %d %d\"",&p,&q,&r);\n    a=p+q;\n        b=q+r;\n        c=r+p;\n    if(a>b)\n        a=b;\n    if(a>c)\n        a=c;\n    printf(\""%d\"",a);\n    return 0;\n}",ACCEPTED,38,492
1591676294373597184,17759f531671f838bf3fae4270190e93b6109026f9503f986c1ed85bb412007d,2022-11-13 14:16:15,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int i,n,a,b,c[30000],F[30000],sum;\n    double sum1=0,sum2=0;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&F[i]);\n    for(i=0;i<n;i++)\n    {\n        sum1=sum1+(c[i]/(F[i]+1))*(double)(pow(a,(F[i]+1)));\n        sum2=sum2+(c[i]/(F[i]+1))*(double)(pow(b,(F[i]+1)));\n    }\n    sum=(int)(sum1-sum2);\n    printf(\""%d\"",sum);\n}",WRONG_ANSWER,6,348
1591676354809311232,e7e6ce2c6e9e530eaf2b9b9968748a0e44e3ac7183d73deb51851946350bfbb0,2022-11-13 14:16:29,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n\n#include <math.h>\n\nint main()\n{\n   int p,q,r;\n   int a,b;\n   scanf(\""%d %d %d\"",&p,&q,&r);\n\n   if((p+q)>(p+r))\n    a=p+r;\n   else\n    a=p+q;\n   if(a>(q+r))\n    b=q+r;\n   else\n    b=a;\n\n   printf(\""%d\"",b);\n\n\n   return 0;\n}\n",ACCEPTED,32,384
1591676354922569728,902d8082eea06043d392298983db4630cde4418ac8ee42282d537bfaae045c2f,2022-11-13 14:16:29,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"b=eval(input())\na=list(input().split(\"" \""))\nj=0\nfor i in range(1,b-1):\n    if a[i]==a[i-1]:\n        a.pop(i)\nfor q in range(1,len(a)-1):\n    if a[q-1]>a[q]<a[q+1]:\n        j=j+1\n    if q==len(a)-1:\n        break\nprint(j)",NON_ZERO_EXIT_CODE,96,3064
1591676361830576128,c39a4349139942a7aa7456b2c4609f8d0f9d0d3465be213d33870ec87eab1e58,2022-11-13 14:16:31,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    int P,Q,R,s;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    if(P>=Q>=R)\n        s=Q+R;\n    else if(R>=Q>=P)\n        s=Q+P;\n   else if(Q>=P>=R)\n        s=P+R;\n    printf(\""%d\"",P);\n}",WRONG_ANSWER,4,196
1591676411952553984,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 14:16:43,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,i,h=0;\n    int b[20];\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=1;i<a-1;i++)\n        {\n            if(b[i]==0)\n               h++;\n        }\n        printf(\""%d\\n\"",h);\n    return 0;\n}\n",WRONG_ANSWER,9,484
1591676441786605568,f55f4c0e0e3367434e26a462e3665271f5b4141ea3de4f34d96fdb21d67e2a7c,2022-11-13 14:16:50,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,i,z,b,count;\n    scanf(\""%d\"",&a);\n    count=0;\n    int k[a];\n for(i=0;i<a;i++)\n {\n    scanf(\""%d\"",&k[i]);\n    if(k[i]<=k[i+1]&&k[i]<=k[i-1])\n        count++;\n\n }\n b=count-2;\n printf(\""%d\"",b);\n\n\n\n\n\n\n    return 0;\n}\n",WRONG_ANSWER,5,196
1591676450556882944,17759f531671f838bf3fae4270190e93b6109026f9503f986c1ed85bb412007d,2022-11-13 14:16:52,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int i,n,a,b,c[30000],F[30000],sum;\n    double sum1=0,sum2=0;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&F[i]);\n    for(i=0;i<n;i++)\n    {\n        sum1=sum1+(c[i]/(F[i]+1))*((double)(pow(a,(F[i]+1))));\n        sum2=sum2+(c[i]/(F[i]+1))*((double)(pow(b,(F[i]+1))));\n    }\n    sum=(int)(sum1-sum2);\n    printf(\""%d\"",sum);\n}",WRONG_ANSWER,5,196
1591676454650523648,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-13 14:16:53,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,j,n;\n    int a[100],sum[100];\n    int max=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n        \n    }\n    for(j=0;j<n;j++){\n        int x=0;\n        for(i=0;i<n;i++)\n        {\n            if(a[j]<=a[i])\n                x++;\n\n        }\n        sum[j]=x*a[j];\n    }\n    for(j=0;j<n;j++)\n    {\n       \n        if(sum[j]>=max)\n        {\n            max=sum[j];\n            \n         }   \n    }\n    printf(\""%d\"",max);\n    return 0;\n}",WRONG_ANSWER,7,324
1591676462586191872,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 14:16:55,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <string.h>\nint main()\n{\n    int k,len,i,g=0,l=0;\n    char str[50];\n    scanf(\""%d\"",&k);\n    scanf(\""%s\"",str);\n    len  = strlen(str);\n    for(i=0;i<=len;i++)\n    {\n        if(str[i]=='0')\n        g++;\n        else\n        l++;\n    }\n    //g-=8;//0的个数;\n    //l-=52;//1的个数;\n    if(g>l)\n    printf(\""%d\\n\"",2*l);\n    else\n    printf(\""%d\\n\"",2*g);\n    return 0;\n}\n\n",SEGMENTATION_FAULT,39,352
1591676525777543168,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-13 14:17:10,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n    int n,i,j,count=0;\n    int a[n];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n    scanf(\""%d\"",&a[n]);}\n    for(j=1;j<n-2;j++){\n    if(a[j+1]<a[j])\n        count=count+1;\n   }\n    printf(\""%d\"",count);\n    return 0;\n}\n",WRONG_ANSWER,5,196
1591676530970091520,c358160a3e618a44cd693944fe10043e6372f46bf7d517c3c3f583bd85b17c5e,2022-11-13 14:17:11,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"n=int(input())\nm=input().split()\ncount=0\nfor i in range(1,n-2):\n    if int(m[i])<int(m[i+1])and int(m[i])<int(m[i-1]):\n        count=count+1 \n    if int(m[i])<int(m[i-1])and int(m[i])==int(m[i+1]):\n        for j in range(i+1,n-2):\n            if m[j]==m[j+1]:\n                countine\n            if m[j]<m[j+1]:\n                count=count+1\n                break\n            if m[j]>m[j+1]:\n                break\nprint(count)   \n    \n",NON_ZERO_EXIT_CODE,85,3164
1591676533708972032,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-13 14:17:12,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main(){\n\tint n,i,j,k=0;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t} \n\tfor(i=1;i<n-1;i++){\n\t\tif(a[i]<a[i-1]){\n\t\t\tfor(j=i;j<n;j++){\n\t\t\t\tif(a[j]>=a[j+1]&&a[j]>a[j-1]) \n\t\t\t\t{\n\t\t\t\t\tk++;\n\t\t\t\t\ti=j;\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse continue;\n\t\t\t}\n\t\t}\n\t\t\telse continue;\n\t}\n\tprintf(\""%d\\n\"",k);\n}",ACCEPTED,40,640
1591676534749159424,c39a4349139942a7aa7456b2c4609f8d0f9d0d3465be213d33870ec87eab1e58,2022-11-13 14:17:12,C++,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    int P,Q,R,s;\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    if(P>=Q>=R)\n        s=Q+R;\n    else if(R>=Q>=P)\n        s=Q+P;\n   else if(Q>=P>=R)\n        s=P+R;\n    printf(\""%d\"",P);\n}",WRONG_ANSWER,8,212
1591676644723843072,d122b81a371b28751082747cf65a235d0eddfd496e142775cd971d8f88adf327,2022-11-13 14:17:38,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int min=0;\n    int x,y,z;\n if( scanf(\""%d%d%d\"",&x,&y,&z)!=1){\n    min=x+y;\n    if(x+z<=min&&x+z>min){\n        min=x+z;\n        printf(\""%d\\n\"",min);\n    }\n    if(y+z<=min&&x+z>min){\n        min=y+z;\n        printf(\""%d\\n\"",min);\n    }\n    if(y+z>min&&x+z>min){\n        printf(\""%d\\n\"",min);\n    }\n }                                        \n    return 0;\n                                \n}",WRONG_ANSWER,21,352
1591676660628643840,c358160a3e618a44cd693944fe10043e6372f46bf7d517c3c3f583bd85b17c5e,2022-11-13 14:17:42,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"n=int(input())\nm=input().split()\ncount=0\nfor i in range(1,n-2):\n    if int(m[i])<int(m[i+1])and int(m[i])<int(m[i-1]):\n        count=count+1 \n    if int(m[i])<int(m[i-1])and int(m[i])==int(m[i+1]):\n        for j in range(i+1,n-2):\n            if m[j]==m[j+1]:\n                countine\n            if m[j]<m[j+1]:\n\nprint(count)   \n    \n",NON_ZERO_EXIT_CODE,16,3016
1591676689577697280,39afbda4ab6a7df2673bc0d0eec048a42b23ada2774ec941935a2b2fa044515a,2022-11-13 14:17:49,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <bits/stdc++.h>\nusing namespace std;\n#define MAX 100001\nint main()\n{\nint n,m=1,q,x,p,v,c;\nint a[MAX],b[MAX];\ncin>>n;\nfor(int i=0;i<n;i++)\n    cin>>a[i];\n    for(int j=0;j<n;j++){\n        q=min(a[j],a[j+1]);\n        for(int k=2;k<n;k++){\n            if(q<=a[k]){\n                m++;\n            }\n            else break;\n        }\n        b[j]=q*m;\n        m=1;\n    }\n    for(p=1;p<n;p++){\n            v=b[0];\n       if(v<b[p])\n       c=b[p];\n    }\n    cout<<c;\nreturn 0;\n}\n",WRONG_ANSWER,5,348
1591676700629688320,40c43472973ea298adbdd1d4b900aeb63cfa4cfe17179f01a4827cd2c6624d3a,2022-11-13 14:17:52,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nmain()\n{\n    int n,a,b;\n    int c[20],f[20];\n    int i,j;\n    int sum0=0,sum1=0,sum2=0,sum3=0,sumz=0;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&c[i]);\n    }\n    for(j=0;j<n;j++)\n    {\n        scanf(\""%d\"",&f[j]);\n    }\n    for(i=0;i<n;i++)\n    {\n        for(j=0;j<n;j++)\n        {\n            if(i==j)\n            {\n              sum1=(c[i]/(f[j]+1))*pow(a,f[j]+1);\n              sum0+=sum1;\n              sum3=(c[i]/(f[j]+1))*pow(b,f[j]+1);\n              sum2+=sum3;\n            }\n            else\n                continue;\n        }\n        sumz=sum0-sum2;\n    }\n    printf(\""%d\"",sumz);\n}",WRONG_ANSWER,8,496
1591676714676412416,73af9d5098be5d450fba728363c8fdbe0f6a5526466daa2f3b74abf1acf75527,2022-11-13 14:17:55,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    \n    int n,h[1000],i=0,j=0;\n    scanf(\""%d\"",&n);\n    int count=0;\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&h[i]);\n        \n    }\n    \n        for(i=1;i<n-1;i++)\n        {\n            if(h[i]!=h[i+1]&&h[i]<h[i+1]&&h[i]<h[i-1])\n                count++;\n            if(h[i]==h[i+1]&&h[i]<h[i-1])\n                {\n                    for(j=i+1;j<n-1;j++)\n                    {\n                        if(h[j]==h[j+1])\n                            j++;\n                         if(h[j]!=h[j+1]) \n                            break;\n                    }\n                    i=j;\n                    if(h[i]<h[i+1])\n                        count++;\n                    \n                }\n           \n            \n        }\n    printf(\""%d\"",count);\n    return 0;\n\n}",ACCEPTED,23,348
1591676719239815168,c358160a3e618a44cd693944fe10043e6372f46bf7d517c3c3f583bd85b17c5e,2022-11-13 14:17:56,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"n=int(input())\nm=input().split()\ncount=0\nfor i in range(1,n-2):\n    if int(m[i])<int(m[i+1])and int(m[i])<int(m[i-1]):\n        count=count+1 \n    if int(m[i])<int(m[i-1])and int(m[i])==int(m[i+1]):\n        for j in range(i+1,n-2):\n            if m[j]==m[j+1]:\n                countine\n            if m[j]<m[j+1]:\n                count=count+1\nprint(count)   \n    \n",NON_ZERO_EXIT_CODE,93,2912
1591676736847491072,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-11-13 14:18:00,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#define N 10000\nint main()\n{\n    int i,j,n;\n    int a[N]={0};\n    int count=0;\n    scanf(\""%d\"",&n);\n    if(n<3)\n        return 0;\n    else\n    {\n        for(i=0;i<n;i++)\n            scanf(\""%d\"",&a[i]);\n        for(i=0;i<n;i++)\n        {\n            for(j=i+2;j<n;j+=2)\n            {\n                if(a[i]>a[i+1]&&a[j]>a[i+1])\n                {\n                    count++;\n                    continue;\n                }\n            }\n        }\n        printf(\""%d\\n\"",count);\n        return 0;\n    }\n}",WRONG_ANSWER,5,324
1591676749971480576,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-13 14:18:03,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main(){\n    int n,a[1000],count=0,i,j,t=0,c=0;\n      scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n        \n        \n    \n    for( j=1;j<n-2;j++)\n    {\n        \n        if(a[j]<a[j-1]&&a[j]<a[j+1])\n        { count++;   }\n             \n       else\n        if(a[j]==a[j+1])\n        {t=1; c++;\n            continue;\n        }\n        \n        if(a[j]<a[j+1]&&a[j]<a[j-c-1]) {count+=t;t=0;c=0;}\n      \n        \n            \n    }\n    \n    \n /*  if(count!=0)\n      printf(\""%d\"",count);\n   else \n     printf(\""0\"");*/\n    \n    printf(\""%d\"",count);\n          \n}",WRONG_ANSWER,24,496
1591676775141486592,a57fdafe4877cd9608fc0ac8a5120a47bc60a015785960e61b67b4e66187c2f2,2022-11-13 14:18:09,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 100\nint main(){\n    int i,n,j=0;\n    int a[N];\n    scanf(\""%d\"",&n);\n    if(n<3)\n        return 0;\n    else{\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n     for(i=1;i<n-1;i++){\n        if(a[i]<a[i-1]&&a[i]<=a[i+1])\n            j++;\n    }\n    printf(\""%d\\n\"",j);\n    }\n    return 0;\n}",RUNTIME_ERROR,23,336
1591676792547848192,eeab3421c2b685f7d51b09a289b82fe82ba0d3896984d09aeffb9d022232d887,2022-11-13 14:18:13,Java,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.math.BigDecimal;\nimport java.util.Scanner;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n    public static void main(String[] args) {\n        FastReader fastReader =  new FastReader();\n       int n = fastReader.nextInt();\n       long result = 0;\n       long[] f = new long[n];\n       for(int i=0;i<n;i++)\n           f[i] = fastReader.nextLong();\n       for(int i = 0;i<n;i++){\n           int j = i;\n           long b = 0;\n           for( j= i+1; j<n  ;j++){\n               long a = Math.min(f[i],f[j])*(j-i);\n               b = Math.max(b,a);\n           }\n         //  if(j >=n) j = n-1;\n          // long t = Math.min(f[i],f[j])*(j-i+1);\n            result = Math.max(result,b);\n         //  System.out.println(\""i\""+i);\n          // System.out.println(\""j\""+j);\n           //System.out.println(\""result\""+result);\n       }\n        System.out.println(result);\n    }\n\n\n    static class FastReader {\n        BufferedReader br;\n        StringTokenizer st;\n        public FastReader()\n        {\n            br = new BufferedReader(\n                    new InputStreamReader(System.in));\n        }\n\n\n        String next()\n        {\n            while (st == null || !st.hasMoreElements()) {\n                try {\n                    st = new StringTokenizer(br.readLine());\n                }\n                catch (IOException e) {\n                    e.printStackTrace();\n                }\n            }\n            return st.nextToken();\n        }\n\n\n\n        int nextInt() { return Integer.parseInt(next()); }\n\n        long nextLong() { return Long.parseLong(next()); }\n\n        double nextDouble(){return Double.parseDouble(next());}\n\n\n        String nextLine()\n        {\n            String str = \""\"";\n\n            try {\n                if (st!= null && st.hasMoreTokens()){\n                    str = st.nextToken(\""\\n\"");\n                } else {\n                    str = br.readLine();\n                }\n            }\n            catch (IOException e) {\n                e.printStackTrace();\n            }\n            return str;\n        }\n\n\n    }\n}\n\n\n\n",WRONG_ANSWER,66,22384
1591676793734848512,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-13 14:18:14,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\nint a,b,c,d,e,f;\n    scanf(\""%d %d %d\"",&a&b&c)\n       d=a+b;\n      e=a+c;\n    f=b+c;\n    if(d<e)\n d=e;\n    if(d<f)\n        d=f;\n        printf(\""%d\"",f);\n        return 0;\n    \n}\n",COMPILE_ERROR,0,0
1591676801171349504,2bc6a85c0376656012a7970a7842a2a9d8769555a79ef4eec85ff45aa30ff7b7,2022-11-13 14:18:15,Java,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint num = sc.nextInt();\n\t\tint[] arr = new int[num];\n\t\tfor(int i = 0; i < num; ++i) {\n\t\t\tarr[i] = sc.nextInt();\n\t\t}\n\t\tint left = 0;\n\t\tint right = arr.length - 1;\n\t\tint max = 0;\n\t\twhile(left < right) {\n\t\t\tint min = Integer.MAX_VALUE;\n\t\t\tfor(int i = left; i <= right; i++) {\n\t\t\t\tmin = Math.min(arr[i], min);\n\t\t\t}\n\t\t\tmax = Math.max(max, min*(right-left +1));\n\t\t\tif(arr[left] > arr[right]) {\n\t\t\t\tright--;\n\t\t\t} else {\n\t\t\t\tleft++;\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(max);\n\t}\n}",WRONG_ANSWER,551,24824
1591676802140221440,d122b81a371b28751082747cf65a235d0eddfd496e142775cd971d8f88adf327,2022-11-13 14:18:16,C,0.0,1591610585635213314,1591128862958940160,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int n; \n    int a[100];\n    for(int i=0;i<100;i++){\n       scanf(\""%d\\n\"",&a[i]);\n    }\n   scanf(\""%d\\n\"",&n);\n    printf(\""%d\"",n);\n    for(int i=0;;i++){\n        if (a[i]>=a[i+1]){\n    printf(\""%d\"",a[i]);}\n        if(a[i]<a[i+1]){\n            printf(\""%d\"",a[i+1]);\n        } \n    }\n    return 0;\n}",SEGMENTATION_FAULT,9,196
1591676823405342720,7ecf54bf0ea2db8ab0397aa941f19ec79a351bc3e86e8c01673aa09a69b3a6db,2022-11-13 14:18:21,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n\tint n,l,max;\n\tscanf(\""%d\"",&n);\n\tdouble s[n];\n\t//录入\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&s[i]);\n\t}\n    max=(int)s[0];\n\t//找区间\n\tfor(int j=0;j<n;j++)\n\t{\n\t\tl = 1;\n\t\tfor(int k=j;k<n-1;k++)\n\t\t{\n            if(s[j]>s[k+1])break;\n\t\t\tl++;\n\t\t}\n\t\t//printf(\""%d %d\\n\"",s[j],l);\n\t\tif(max<=(int)s[j]*l)max=(int)s[j]*l;\n\t}\n\t//打印结果\n\tprintf(\""%d\\n\"",max);\n}\n\n",WRONG_ANSWER,6,480
1591676823946407936,da72e985b1ff1737d155282af7dd43e3dc341605cc356d114979edd4fea85a11,2022-11-13 14:18:21,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#define MAX 100\nint main() {\n    int arr[MAX],n,i,t=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&arr[i]);\n    for(i=1;i<n-1;i++)\n        if((arr[i]<=arr[i-1])&&(arr[i]<arr[i+1]))\n            t++;\n    printf(\""%d\"",t);\n}",RUNTIME_ERROR,35,500
1591676845056352256,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-11-13 14:18:26,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#define N 10000\nint main()\n{\n    int i,j,n;\n    int a[N]={0};\n    int count=0;\n    scanf(\""%d\"",&n);\n    if(n<3)\n        return 0;\n    else\n    {\n        for(i=0;i<n;i++)\n            scanf(\""%d\"",&a[i]);\n        for(i=0;i<n;i++)\n        {\n            for(j=i+2;j<n;j+=2)\n            {\n                if(a[i]>a[i+1]&&a[j]>a[i+1])\n                {\n                    count++;\n                    continue;\n                }\n                else\n                    continue;\n            }\n        }\n        printf(\""%d\\n\"",count);\n        return 0;\n    }\n}",WRONG_ANSWER,9,220
1591676867227430912,27fbb32d960dbf49665c8905b68012d602eda68987686c6f224ec7b49ca3d0ac,2022-11-13 14:18:31,C,0.0,1591610585635213314,1591128862958940160,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint i,n;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\ta[0]=5;\n\tfor(i=1;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=0;i<n;i++)\n\t{\n\t\tfor(int j=i+1;j<n;j++)\n\t\t{\n\t\t\tif(a[i]<a[j])\n\t\t\t{\n\t\t\t\tint sum=a[i];\n\t\t\t\ta[i]=a[j];\n\t\t\t\ta[j]=sum;\n\t\t\t}\n\t\t}\n\t}\n\tfor(i=0;i<n;i++)\n\t{\n\t\tprintf(\""%d \"",a[i]);\n\t}\n\treturn 0;\n} ",WRONG_ANSWER,14,192
1591676871774068736,efa7a60e7fa0d7fd13e87b47555eb8bfc0c4da0695990711fb851b886de3de22,2022-11-13 14:18:32,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,j;\n    int sum=0;\n    scanf(\""%d\"",&n);\n    int data[n];\n    int i;\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&data[i]);\n        for(j=i+1;j<n;j++){\n            if(data[j]<data[j+1]&&data[j]<=data[j-1]){\n                sum=sum+1;\n            }\n        }\n        printf(\""%d\\n\"",sum);\n        return 0;\n    }\n   \n}",WRONG_ANSWER,33,356
1591676905420775424,547094c7c62f34b25dac6d7d79e017d817767a29a120ff5083d5fe0c21b62800,2022-11-13 14:18:40,Python,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"list1=[]\na=eval(input())\nlist1=input().split(\"" \"")\nlist1.sort()\nmax=a*int(list1[0])\nfor i in range(1,a):\n    if int(list1[i])*(a-i)>max:\n        max=int(list1[i])*(a-i)\nprint(max)\n",WRONG_ANSWER,20,2868
1591676911313805312,c9a8fe962a36cf99ca362f66348b02453584251c62fe2356e11d2a6efd5cee45,2022-11-13 14:18:42,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n   int n,a,b;\n   int  c1,c2;\n   int f1,f2;\n   int sum;\n   scanf(\""%d%d%d\"",&n,&a,&b);\n   scanf(\""%d%d\"",&c1,&c2);\n   scanf(\""%d%d\"",&f1,&f2);\n   sum=(c1/(f1+1)*pow(a,f1+1)+c2/(f2+1)*pow(a,f2+1))-(c1/(f1+1)*pow(b,f1+1)+c2/(f2+1)*pow(b,f2+1));\n   printf(\""%d\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,4,200
1591676913234796544,899c5501179552dc1fe5639f9047e15d0f835e7a87c8568193377882d0278985,2022-11-13 14:18:42,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<string.h>\nint main()\n{\n    int n,i,count=0;\n    scanf(\""%d\"",&n);\n    char s[80];\n    for(i=0;i<n;i++)\n        scanf(\""%c\"",&s[i]);\n    for(i=0;i<n;i++)\n    {\n        if(s[i]=s[i+1])\n            count+=2;\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",WRONG_ANSWER,6,352
1591676937888915456,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 14:18:48,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i;\n    int sum=0;\n    int t=0;\n    scanf(\""%d\"",&n);\n        int a[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n-2;i++)\n    {\n        if(a[i]>a[i+3])\n        {\n            sum=sum+a[i]-5;\n            t=t+1;\n        }\n        else\n        {\n            sum=sum+a[i+2]-5;\n            t=t+3;\n        }\n    }\n    printf(\""%d\"",sum-1);\n    return 0;\n}",WRONG_ANSWER,5,364
1591676969111281664,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-11-13 14:18:56,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#define N 10000\nint main()\n{\n    int i,j,n;\n    int a[N]={0};\n    int count=0;\n    scanf(\""%d\"",&n);\n    if(n<3)\n        return 0;\n    else\n    {\n        for(i=0;i<n;i++)\n            scanf(\""%d\"",&a[i]);\n        for(i=0;i<n;i+=2)\n        {\n            for(j=i+2;j<n;j+=2)\n            {\n                if(a[i]>a[i+1]&&a[j]>a[i+1])\n                {\n                    count++;\n                    continue;\n                }\n                else\n                    continue;\n            }\n        }\n        printf(\""%d\\n\"",count);\n        return 0;\n    }\n}",WRONG_ANSWER,6,476
1591676986546991104,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-13 14:19:00,Java,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n        int n=sc.nextInt();\n        String s=sc.next();\n        int sum=0;\n        List<String> S=new ArrayList<>();\n\t\tfor(int j=0;j<s.length();j++) {\n\t\t\tString v=s.charAt(j)+\""\"";\n\t\t\tS.add(v);\n\t\t}\n        \n        System.out.println(remove(0,sum,S)+2);\n      \n\t}\n\tpublic static int remove(int i,int sum,List<String> S) {\n\t\tfor(i=i;i<S.size()-1;i++){\n          if(S.get(i)!=S.get(i+1)){\n          \tS.remove(i);\n          \tS.remove(i+1);\n              sum=sum+2;\n              i=i+2;\n          }\n\t\t}\n\t\tint r=0;\n\t\tint k=0;\n\t\tfor(int l=0;l<S.size();l++) {\n\t\t\tif(S.get(l)==\""0\"") {\n\t\t\t\tr++;\n\t\t\t}else if(S.get(l)==\""1\"") {\n\t\t\t\tk++;\n\t\t\t}\n\t\t}\n\t\tif(r==0||k==0||S==null) {\n\t\t\treturn sum;\n\t\t}\n\t\treturn remove(0, sum, S);\n\t}\n}",COMPILE_ERROR,0,0
1591676994411311104,efa7a60e7fa0d7fd13e87b47555eb8bfc0c4da0695990711fb851b886de3de22,2022-11-13 14:19:02,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,j;\n    int sum=0;\n    scanf(\""%d\"",&n);\n    int data[n];\n    int i;\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&data[i]);\n        for(j=i+1;j<n;j++){\n            if(data[j]<data[j+1]&&data[j]<=data[j-1]){\n                sum=sum+1;\n            }\n        }\n        printf(\""%d\\n\"",sum);\n        return 0;\n    }\n}",WRONG_ANSWER,8,196
1591677000795086848,17759f531671f838bf3fae4270190e93b6109026f9503f986c1ed85bb412007d,2022-11-13 14:19:03,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int i,n,a,b,c[30000],F[30000],sum,sum1=0,sum2=0;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&F[i]);\n    for(i=0;i<n;i++)\n    {\n        sum1=sum1+(c[i]/(F[i]+1))*(pow(a,(F[i]+1)));\n        sum2=sum2+(c[i]/(F[i]+1))*(pow(b,(F[i]+1)));\n    }\n    sum=sum1-sum2;\n    printf(\""%d\"",sum);\n}",WRONG_ANSWER,5,200
1591677039609176064,d122b81a371b28751082747cf65a235d0eddfd496e142775cd971d8f88adf327,2022-11-13 14:19:12,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n    int b;\n    scanf(\""%d\"",&b);\n    int a[10];\n    int cout=0;\n    int i;\n    a[0]=0;\n    for(i=1;i<10;i++){\n        scanf(\""%d\"",&a[i]);\n     for(int j=0;j<i;j++){\n        if(a[j]>=a[j+1]){\n            cout++;\n        }\n     }   \n    }\n    printf(\""%d\\n\"",cout);\n   return 0;\n}",WRONG_ANSWER,7,192
1591677046710132736,da72e985b1ff1737d155282af7dd43e3dc341605cc356d114979edd4fea85a11,2022-11-13 14:19:14,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#define MAX 100\nint main() {\n    int arr[MAX],n,i,t=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&arr[i]);\n    for(i=1;i<n-1;i++)\n        if((arr[i]<=arr[i-1])&&(arr[i]<arr[i+1]))\n            t++;\n    printf(\""%d\"",t);\n}",RUNTIME_ERROR,19,360
1591677074551877632,0d24b4ee85e6e3a4cc694f7e11105fa2aaf93fd10d4cbe81657f252e2d675435,2022-11-13 14:19:21,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#define N 10000000\nint main()\n{\n    int n,m;\n     int i=0,j;\n     int arr[N];\n\n     int sum=0 ;\n\n   scanf(\""%d\"",&n);\n   while(i<n){\n\n    scanf(\""%d\"",&m); //数组\n    arr[i++]=m;\n   }\n\n  for(j=0;j<=i;){\n\n   if(j<=i-2){\n    if(arr[j]<=arr[j+2]){\n        sum+=(arr[j+2]-5);  //消耗5\n        if(j==0){\n              j+=2;\n           }\n        else\n            j+=3;\n\n    }\n    else if(arr[j]>arr[j+2]){\n        sum+=(arr[j]-5);\n        if(j==0){\n            j=j;\n        }\n        else{\n            j+=1;//开始第一步不算\n        }\n\n    }\n        }\n    else{\n        sum+=(arr[j]-5);\n        j+=1;\n    }\n  }\n\n  printf(\""%d\"",sum);\n\n    return 0;\n}\n",SEGMENTATION_FAULT,8,200
1591677082474962944,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-13 14:19:23,Java,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"import java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n        int n=sc.nextInt();\n        String s=sc.next();\n        int sum=0;\n        List<String> S=new ArrayList<>();\n\t\tfor(int j=0;j<s.length();j++) {\n\t\t\tString v=s.charAt(j)+\""\"";\n\t\t\tS.add(v);\n\t\t}\n        \n        System.out.println(remove(0,sum,S)+2);\n      \n\t}\n\tpublic static int remove(int i,int sum,List<String> S) {\n\t\tfor(i=i;i<S.size()-1;i++){\n          if(S.get(i)!=S.get(i+1)){\n          \tS.remove(i);\n          \tS.remove(i+1);\n              sum=sum+2;\n              i=i+2;\n          }\n\t\t}\n\t\tint r=0;\n\t\tint k=0;\n\t\tfor(int l=0;l<S.size();l++) {\n\t\t\tif(S.get(l)==\""0\"") {\n\t\t\t\tr++;\n\t\t\t}else if(S.get(l)==\""1\"") {\n\t\t\t\tk++;\n\t\t\t}\n\t\t}\n\t\tif(r==0||k==0||S==null) {\n\t\t\treturn sum;\n\t\t}\n\t\treturn remove(0, sum, S);\n\t}\n}",NON_ZERO_EXIT_CODE,140,27280
1591677095456333824,eeab3421c2b685f7d51b09a289b82fe82ba0d3896984d09aeffb9d022232d887,2022-11-13 14:19:26,Java,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.math.BigDecimal;\nimport java.util.Scanner;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n    public static void main(String[] args) {\n        FastReader fastReader =  new FastReader();\n       int n = fastReader.nextInt();\n       if(n == 0)\n       {\n           System.out.println(0);\n           return ;\n       }\n       long result = 0;\n       long[] f = new long[n];\n       for(int i=0;i<n;i++)\n           f[i] = fastReader.nextLong();\n       for(int i = 0;i<n;i++){\n           int j = i;\n           long b = 0;\n           for( j= i+1; j<n  ;j++){\n               long a = Math.min(f[i],f[j])*(j-i);\n               b = Math.max(b,a);\n           }\n         //  if(j >=n) j = n-1;\n          // long t = Math.min(f[i],f[j])*(j-i+1);\n            result = Math.max(result,b);\n         //  System.out.println(\""i\""+i);\n          // System.out.println(\""j\""+j);\n           //System.out.println(\""result\""+result);\n       }\n        System.out.println(result);\n    }\n\n\n    static class FastReader {\n        BufferedReader br;\n        StringTokenizer st;\n        public FastReader()\n        {\n            br = new BufferedReader(\n                    new InputStreamReader(System.in));\n        }\n\n\n        String next()\n        {\n            while (st == null || !st.hasMoreElements()) {\n                try {\n                    st = new StringTokenizer(br.readLine());\n                }\n                catch (IOException e) {\n                    e.printStackTrace();\n                }\n            }\n            return st.nextToken();\n        }\n\n\n\n        int nextInt() { return Integer.parseInt(next()); }\n\n        long nextLong() { return Long.parseLong(next()); }\n\n        double nextDouble(){return Double.parseDouble(next());}\n\n\n        String nextLine()\n        {\n            String str = \""\"";\n\n            try {\n                if (st!= null && st.hasMoreTokens()){\n                    str = st.nextToken(\""\\n\"");\n                } else {\n                    str = br.readLine();\n                }\n            }\n            catch (IOException e) {\n                e.printStackTrace();\n            }\n            return str;\n        }\n\n\n    }\n}\n\n\n\n",WRONG_ANSWER,69,22356
1591677109830213632,17759f531671f838bf3fae4270190e93b6109026f9503f986c1ed85bb412007d,2022-11-13 14:19:29,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int i,n,a,b,c[30000],F[30000],sum,sum1=0,sum2=0;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&F[i]);\n    for(i=0;i<n;i++)\n    {\n        sum1=sum1+(c[i]/(F[i]+1))*(pow(a,(F[i]+1)));\n        sum2=sum2+(c[i]/(F[i]+1))*(pow(b,(F[i]+1)));\n    }\n    sum=sum1-sum2;\n    printf(\""%d\"",sum);\n}",WRONG_ANSWER,5,332
1591677112489402368,6933dcb3592e2d6f6fc887ed9a5537aab21a30f76450c9b5043f7776bfc39a59,2022-11-13 14:19:30,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nvoid main(){\n    int n,start,mind,end,temp=0,i;\n    scanf(\""%d\"",&n);\n    int high[n];\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&high[i]);\n    }\n    for(start=0;start+1<=n;start++){\n        if(high[start]>high[start+1]){\n\n            for(mind=start+1;mind+1<=n;mind++){\n                if(high[mind]<high[mind+1]){\n\n                    start=mind;\n                    temp++;\n                    break;\n                }\n            }\n        }\n    }\n    printf(\""%d\"",temp);\n}",WRONG_ANSWER,10,320
1591677134115233792,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 14:19:35,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i;\n    int sum=0;\n    int t=0;\n    scanf(\""%d\"",&n);\n        int a[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n-2;i++)\n    {\n        if(a[i]>=a[i+3])\n        {\n            sum=sum+a[i]-5;\n            t=t+1;\n        }\n        else\n        {\n            sum=sum+a[i+2]-5;\n            t=t+3;\n        }\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,7,340
1591677144772960256,2bc6a85c0376656012a7970a7842a2a9d8769555a79ef4eec85ff45aa30ff7b7,2022-11-13 14:19:37,Java,300.0,1591610585639407617,1591132482555211776,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint num = sc.nextInt();\n\t\tint[] arr = new int[num];\n\t\tfor(int i = 0; i < num; ++i) {\n\t\t\tarr[i] = sc.nextInt();\n\t\t}\n\t\tint left = 0;\n\t\tint right = arr.length - 1;\n\t\tint max = 0;\n\t\twhile(left <= right) {\n\t\t\tint min = Integer.MAX_VALUE;\n\t\t\tfor(int i = left; i <= right; i++) {\n\t\t\t\tmin = Math.min(arr[i], min);\n\t\t\t}\n\t\t\tmax = Math.max(max, min*(right-left +1));\n\t\t\tif(arr[left] > arr[right]) {\n\t\t\t\tright--;\n\t\t\t} else {\n\t\t\t\tleft++;\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(max);\n\t}\n}",ACCEPTED,557,24956
1591677147033645056,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-13 14:19:38,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<iostream>\nusing namespace std;\nclass resolve{\n    public:\n    void resve(int *h,int n){\n        int nums=0;\n        for(int i=1;i<n-1;i++){\n        if(h[i]<h[i-1]){\n            if(h[i]<h[i+1])\n                nums++;\n            else{\n                for(int j=i+1;j<n-1;j++){\n                    if(h[j]<h[j+1]){\n                        nums++;\n                        i=j+2;\n                        continue;\n                    }   \n                }\n            } \n        }\n        }\n        cout<<nums<<endl;\n    }  \n};\n\nint main(){\n    int n,h[1000]={0};\n    cin>>n;\n    if(n<3)\n        return 0;\n    for(int i=0;i<n;i++){\n        cin>>h[i];\n    }\n    resolve res;\n    res.resve(h,n);\n    return 0;\n}",WRONG_ANSWER,10,320
1591677165731852288,5ed1ed5f3786d45db71190023ef590496fd0d8d8cfe4af0f2c94d1d387178674,2022-11-13 14:19:42,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,a[1000],k=0,j=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=1;i<n-1;i++)\n    {\n        if(a[i]>a[i-1])\n        {\n            k++;\n        }\n        if(a[i]<a[i+1])\n            j++;\n    }\n    if(k<=j)\n    printf(\""%d\"",k);\n    else if(j<=k)\n        printf(\""%d\"",j);\n    return 0;\n}\n",WRONG_ANSWER,8,348
1591677212938788864,dcc1017bcd698bd6a0eee54e4ed848d4c51a3a26608990cdd2137e4c01065a1e,2022-11-13 14:19:54,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main (){\n    int a,b,i=-1,s1=0,s2=0,sum=0;\n    int x[100]={0};\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++){\n    scanf(\""%d\"",&b);\n        x[i]=b;\n    } \n    while(i<=a){\n        s1=x[i+1];\n        s2=x[i+3];\n        if(s1>=s2){\n            sum=sum+x[i+1]-5;\n            i=i+1;\n            continue;\n        }\n        if(s1<s2) {\n            sum=sum+x[i+3]-5;\n            i=i+3;\n            continue;\n        }\n    }\n    printf(\""%d\\n\"",sum+21);\n return 0;   \n}",SEGMENTATION_FAULT,5,348
1591677235315400704,d9e00d995e65b04cda3ddef6baec19225e4351002ab4efa981f62d78919a481b,2022-11-13 14:19:59,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n;\n    int a,b;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    if(a<b || n=0) return 0;\n    int c[n];\n    int f[n];\n    int i;\n    int sum=0;\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&c[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&f[i]);\n    }\n    if(a == b){\n        sum=0;\n    }else{\n         int j;\n        for(j=0;j<2;j++){\n            if(j==0){\n                for(i=0;i<n;i++)\n                {\n                    sum = sum + c[i]/(f[i]+1) * (int)pow(a,f[i]+1);\n                }\n            }\n            else{\n                for(i=0;i<n;i++)\n                {\n                    sum = sum - c[i]/(f[i]+1) * (int)pow(b,f[i]+1);\n                }\n            }\n        }\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1591677241707520000,d830b0bcae7881ad6d1b2e2b14f3ffa3695b6d3bd622856493fa1cf903c9bf4e,2022-11-13 14:20:01,Java,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"import java.util.Scanner;\n\npublic class test1 {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint a= sc.nextInt();\n\t\tint b =sc.nextInt();\n\t\tint[] arr1 = new int[n];\n\t\tint[] arr2 = new int [n];\n\t\tfor(int i =0;i< arr1.length;i++){\n\t\t\t\tarr1[i]=sc.nextInt();\n\t\t\t\n\t\t}\n\t\tfor(int i =0;i< arr2.length;i++){\n\t\t\tarr2[i]=sc.nextInt();\n\t\t\n\t\t}\n\t\tint res1=0;\n\t\tfor(int i =0;i<n;i++){\n\t\t\tres1+= arr1[i]/(arr2[i]+1)*(Math.pow(a, arr2[i]+1));\n\t\t}\n\t\tint res2=0;\n\t\tfor(int i =0;i<n;i++){\n\t\t\tres2+= arr1[i]/(arr2[i]+1)*(Math.pow(b, arr2[i]+1));\n\t\t}\n\t\tint res=res1-res2;\n\t\tSystem.out.print(res);\n\t\t\n\t}\n}",COMPILE_ERROR,0,0
1591677263362711552,d9e00d995e65b04cda3ddef6baec19225e4351002ab4efa981f62d78919a481b,2022-11-13 14:20:06,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n;\n    int a,b;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    if(a<b || n==0) return 0;\n    int c[n];\n    int f[n];\n    int i;\n    int sum=0;\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&c[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&f[i]);\n    }\n    if(a == b){\n        sum=0;\n    }else{\n         int j;\n        for(j=0;j<2;j++){\n            if(j==0){\n                for(i=0;i<n;i++)\n                {\n                    sum = sum + c[i]/(f[i]+1) * (int)pow(a,f[i]+1);\n                }\n            }\n            else{\n                for(i=0;i<n;i++)\n                {\n                    sum = sum - c[i]/(f[i]+1) * (int)pow(b,f[i]+1);\n                }\n            }\n        }\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,5,384
1591677279296827392,d830b0bcae7881ad6d1b2e2b14f3ffa3695b6d3bd622856493fa1cf903c9bf4e,2022-11-13 14:20:09,Java,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint a= sc.nextInt();\n\t\tint b =sc.nextInt();\n\t\tint[] arr1 = new int[n];\n\t\tint[] arr2 = new int [n];\n\t\tfor(int i =0;i< arr1.length;i++){\n\t\t\t\tarr1[i]=sc.nextInt();\n\t\t\t\n\t\t}\n\t\tfor(int i =0;i< arr2.length;i++){\n\t\t\tarr2[i]=sc.nextInt();\n\t\t\n\t\t}\n\t\tint res1=0;\n\t\tfor(int i =0;i<n;i++){\n\t\t\tres1+= arr1[i]/(arr2[i]+1)*(Math.pow(a, arr2[i]+1));\n\t\t}\n\t\tint res2=0;\n\t\tfor(int i =0;i<n;i++){\n\t\t\tres2+= arr1[i]/(arr2[i]+1)*(Math.pow(b, arr2[i]+1));\n\t\t}\n\t\tint res=res1-res2;\n\t\tSystem.out.print(res);\n\t\t\n\t}\n}",WRONG_ANSWER,113,24800
1591677312591224832,dcc1017bcd698bd6a0eee54e4ed848d4c51a3a26608990cdd2137e4c01065a1e,2022-11-13 14:20:17,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main (){\n    int a,b,i=-1,s1=0,s2=0,sum=0;\n    int x[100]={0};\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++){\n    scanf(\""%d\"",&b);\n        x[i]=b;\n    } \n    while(i<=a){\n        s1=x[i+1];\n        s2=x[i+3];\n        if(s1>=s2){\n            sum=sum+x[i+1]-5;\n            i=i+1;\n            continue;\n        }\n        if(s1<s2) {\n            sum=sum+x[i+3]-5;\n            i=i+3;\n            continue;\n        }\n    }\n    printf(\""%d\\n\"",sum);\n return 0;   \n}",SEGMENTATION_FAULT,5,200
1591677380291518464,899c5501179552dc1fe5639f9047e15d0f835e7a87c8568193377882d0278985,2022-11-13 14:20:34,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<string.h>\nint main()\n{\n    int n,i,count=0;\n    scanf(\""%d\"",&n);\n    char s[80];\n    for(i=0;i<n;i++)\n        scanf(\""%c\"",&s[i]);\n    for(i=0;i<n;i++)\n    {\n        if(s[i]=s[i+1])\n            count+=2;\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",WRONG_ANSWER,5,360
1591677449149374464,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-13 14:20:50,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\nint a,b,c,d,e,f;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n       d=a+b;\n      e=a+c;\n    f=b+c;\n    if(d<e)\n        d=e;\n    if(d<f)\n        d=f;\n        printf(\""%d\"",f);\n        return 0;\n    \n}\n",WRONG_ANSWER,6,196
1591677486952636416,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-13 14:20:59,Python,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"data=list(map(int,input().split()))\ndata.sort()\nprint(sum(data[:2]))\n",ACCEPTED,81,2908
1591677504287694848,eeab3421c2b685f7d51b09a289b82fe82ba0d3896984d09aeffb9d022232d887,2022-11-13 14:21:03,Java,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.math.BigDecimal;\nimport java.util.Scanner;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n    public static void main(String[] args) {\n        FastReader fastReader =  new FastReader();\n       int n = fastReader.nextInt();\n       if(n == 0)\n       {\n           System.out.println(0);\n           return ;\n       }\n       long result = 0;\n       long[] f = new long[n];\n       for(int i=0;i<n;i++)\n           f[i] = fastReader.nextLong();\n       for(int i = 0;i<n;i++){\n           long b = 0;\n           for( int j= i; j<n  ;j++){\n               long a = Math.min(f[i],f[j])*(j-i);\n               b = Math.max(b,a);\n           }\n         //  if(j >=n) j = n-1;\n          // long t = Math.min(f[i],f[j])*(j-i+1);\n            result = Math.max(result,b);\n         //  System.out.println(\""i\""+i);\n          // System.out.println(\""j\""+j);\n           //System.out.println(\""result\""+result);\n       }\n        System.out.println(result);\n    }\n\n\n    static class FastReader {\n        BufferedReader br;\n        StringTokenizer st;\n        public FastReader()\n        {\n            br = new BufferedReader(\n                    new InputStreamReader(System.in));\n        }\n\n\n        String next()\n        {\n            while (st == null || !st.hasMoreElements()) {\n                try {\n                    st = new StringTokenizer(br.readLine());\n                }\n                catch (IOException e) {\n                    e.printStackTrace();\n                }\n            }\n            return st.nextToken();\n        }\n\n\n\n        int nextInt() { return Integer.parseInt(next()); }\n\n        long nextLong() { return Long.parseLong(next()); }\n\n        double nextDouble(){return Double.parseDouble(next());}\n\n\n        String nextLine()\n        {\n            String str = \""\"";\n\n            try {\n                if (st!= null && st.hasMoreTokens()){\n                    str = st.nextToken(\""\\n\"");\n                } else {\n                    str = br.readLine();\n                }\n            }\n            catch (IOException e) {\n                e.printStackTrace();\n            }\n            return str;\n        }\n\n\n    }\n}\n\n\n\n",WRONG_ANSWER,70,22248
1591677524298719232,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-13 14:21:08,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main(){\n\tint n,i,j;\n\tscanf(\""%d\"",&n);\n\tint m;\n\tm=n;\n\tchar a[n];\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%c\"",&a[i]);\n\t}\n\tfor(i=0;i<n;i++){\n\t\tif(a[i]!=a[i+1]){\n\t\t\tn-=2;\n\t\t\tfor(j=i;j<n;j++){\n\t\t\t\ta[j]=a[j+2];\n\t\t\t}\n\t\t\ti=0;\n\t\t}\n\t}\t\n\tint d;\n\td=m-n;\n\tprintf(\""%d\\n\"",d);\n}",WRONG_ANSWER,12,324
1591677530665672704,ddd0edd80a23dfec88d0679f4ed6037779b80d26db4ba0f74fecb3d447de61fa,2022-11-13 14:21:09,C++,300.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#define max 10000000\nint main(){\n   int n,i=0,flag=0,m;\n    scanf(\""%d\"",&n);\n    char str[n];\n    m=n;\n for(i=0;i<=n;i++)\n     scanf(\""%c\"",&str[i]);\n   for(i=0;i<=m;i++){\n \n           if(str[i]=='0')\n    flag--;\n       if(str[i]=='1')\n           flag++;\n\n       }\n          if(flag>=0)\n           printf(\""%d\"",(m-flag));\n            else\n            printf(\""%d\"",(m+flag));\n\n}",ACCEPTED,52,500
1591677553503645696,d9e00d995e65b04cda3ddef6baec19225e4351002ab4efa981f62d78919a481b,2022-11-13 14:21:15,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n;\n    int a,b;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    if(a<b || n==0) {\n        printf(\""0\"");\n        return 0;\n    }\n    int c[n];\n    int f[n];\n    int i;\n    int sum=0;\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&c[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&f[i]);\n    }\n    if(a == b){\n        sum=0;\n    }else{\n         int j;\n        for(j=0;j<2;j++){\n            if(j==0){\n                for(i=0;i<n;i++)\n                {\n                    sum = sum + c[i]/(f[i]+1) * (int)pow(a,f[i]+1);\n                }\n            }\n            else{\n                for(i=0;i<n;i++)\n                {\n                    sum = sum - c[i]/(f[i]+1) * (int)pow(b,f[i]+1);\n                }\n            }\n        }\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,10,196
1591677557790269440,7ecf54bf0ea2db8ab0397aa941f19ec79a351bc3e86e8c01673aa09a69b3a6db,2022-11-13 14:21:16,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n\tint n,l,max;\n\tscanf(\""%d\"",&n);\n\tint s[n];\n\t//录入\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&s[i]);\n\t}\n    max=s[0];\n\t//找区间\n\tfor(int j=0;j<n;j++)\n\t{\n\t\tl = 1;\n\t\tfor(int k=j;k<n-1;k++)\n\t\t{\n            if(s[j]>s[k+1])break;\n\t\t\tl++;\n\t\t}\n\t\t//printf(\""%d %d\\n\"",s[j],l);\n\t\tif(max<=s[j]*l)max=s[j]*l;\n\t}\n\t//打印结果\n\tprintf(\""%d\\n\"",max);\n}\n\n",WRONG_ANSWER,15,376
1591677611670253568,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-13 14:21:29,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n    int n,i,j,count=0;\n    int hi[n];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n    scanf(\""%d\"",&hi[n]);}\n    for(j=1;j<n-1;j++){\n    if(hi[j+1]<hi[j])\n        count++;\n   }\n    printf(\""%d\"",count);\n    return 0;\n}\n",WRONG_ANSWER,5,480
1591677638979379200,630b8bfc88107b488e158fc7108c8faf0a195f9b9030c3faf51edac625714584,2022-11-13 14:21:35,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main(){\nint n,j=0,i,k=0,l;\nscanf(\""%d\"",&n);\nint h[n];\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&h[i]);\nfor(i=0;i<n;i++)\nif(h[i]!=0) {l=i;break;}\nfor(i=l+1;i<n-1;i++){\n            j=i;\n        for(j;j<n-1;j++){\n            if(h[i]>=h[j+1]) continue;\n            else {k++;i=j+1;}\n        }\n    }\nprintf(\""%d\"",k);\nreturn 0;\n}\n",WRONG_ANSWER,4,196
1591677640355110912,05f9d62a2660f27e0711448c225e5e0fe6347745a2c93edb6296c0a2ffbc6605,2022-11-13 14:21:36,C,300.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nmain()\n{\n    int i,j,n,p,a[10000],sum1=0,sum2=0,max1=0,max2=0;\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       sum1=0;\n       for(j=i;j<n;j++)\n           if(a[i]<=a[j])\n               sum1+=a[i];\n            else\n                break;\n       if(sum1>=max1)\n           max1=sum1;\n   }\n   for(i=0;i<n;i++)\n   {\n       sum2=0;\n       for(j=0;j<n;j++)\n           if(a[i]<=a[j])\n               sum2+=a[i];\n            else\n                break;\n       if(sum2>=max2)\n           max2=sum2;\n   }\n   if(max1>max2)\n       printf(\""%d\"",max1);  \n\t   else\n\t     printf(\""%d\"",max2);  \n      \n}",ACCEPTED,43,372
1591677661641191424,d4c94290401b65ee2ce02056ca325b624120f06a8f67557b729453a418b199fe,2022-11-13 14:21:41,C++,0.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<bits/stdc++.h>\nuisng namespace std;\n\nint main(){\n\tcout<<\""60\"";\n\treturn 0;\n} ",COMPILE_ERROR,0,0
1591677670059159552,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-11-13 14:21:43,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#define N 10000\nint main()\n{\n    int i,j,n;\n    int a[N]={0};\n    int count=0;\n    scanf(\""%d\"",&n);\n    if(n<3)\n        return 0;\n    else\n    {\n        for(i=0;i<n;i++)\n            scanf(\""%d\"",&a[i]);\n        for(i=1;i<n;i++)\n        {\n            for(j=i+2;j<n;j++)\n            {\n                if(a[i]>a[i+1]&&a[j]>a[i+1])\n                {\n                    count++;\n                    i++;\n                    continue;\n                }\n            }\n        }\n        printf(\""%d\\n\"",count);\n        return 0;\n    }\n}",WRONG_ANSWER,8,224
1591677686559551488,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-13 14:21:47,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\nint a,b,c,d,e,f;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n       d=a+b;\n      e=a+c;\n    f=b+c;\n    if(d>e)\n        d=e;\n    if(d>f)\n        d=f;\n        printf(\""%d\"",f);\n        return 0;\n    \n}\n",WRONG_ANSWER,7,204
1591677704322441216,7222c2fb91a71fcf3f6560860557ab564f69a453594c9f1620ecc35bb26f5daf,2022-11-13 14:21:51,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\nint main(){\n    \n    int n,i,j;\n    int max=0,sum=0,num;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n    {\n       scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {sum=1;\n        for(j=i;j<n;j++)\n        {\n            if(a[j+1]>=a[i])\n            sum++;\n            else \n            {\n              num=sum*a[i];\n                \n             if(num>=max)\n             {\n                 max=num;\n             }\n                break;\n            }\n        \n    }\n    }\n    printf(\""%d\"",max);\n}",WRONG_ANSWER,13,348
1591677720298577920,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-13 14:21:55,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\nint a,b,c,d,e,f;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n       d=a+b;\n      e=a+c;\n    f=b+c;\n    if(d>e)\n        d=e;\n    if(d>f)\n        d=f;\n        printf(\""%d\"",d);\n        return 0;\n    \n}\n",ACCEPTED,37,380
1591677740867399680,86f702b052a21d7cb2f8cd933c678c21efaafaf5b2d35032f18ec35c1e26a945,2022-11-13 14:22:00,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main()\n{\n   int n,i,j;\n    int max=0,sum=0;\n    int h[10000];\n    scanf(\""%d\"",&n);\n        for(i=0;i<n;i++)\n            scanf(\""%d\"",&h[i]);\n    for(i=0;i<n;i++)\n    {  int a=0;\n        for(j=0;j<n-i;j++)\n        {\n            if(h[i]<=h[i+j])  a++;\n            else break;\n        }\n     sum=h[i]*a;\n     if(sum>max) max=sum;\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",WRONG_ANSWER,22,320
1591677766029041664,9c773df96630087325d11d08f2dbc9851abb095c63fb7b3e55cb667898dfe23f,2022-11-13 14:22:06,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n    int n;\n    cin >> n;\n    int h[10];\n    int res = 0;\n    for (int i = 1; i <= n; i++) {\n        cin >> h[i];\n    }\n    for (int i = 1; i <= n; i++) {\n        int cnt = 1;\n        int x = i - 1, y = i + 1;\n        while (x > 0 || y < n + 1) {\n            if (x <= 0 || h[x] < h[i]) {\n                x = -1;\n            } else {\n                cnt++;\n            }\n            if (y >= n + 1 || h[y] < h[i]) {\n                y = n + 1;\n            } else {\n                cnt++;\n            }\n            x--;\n            y++;\n        }\n        cout << cnt << ' ' << h[i] << endl;\n        res = max(res, cnt * h[i]);\n    }\n    cout << res;\n    return 0;\n}\n",WRONG_ANSWER,5,476
1591677786266546176,d4c94290401b65ee2ce02056ca325b624120f06a8f67557b729453a418b199fe,2022-11-13 14:22:10,C++,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n\tcout<<\""60\"";\n\treturn 0;\n} ",ACCEPTED,9,640
1591677791631060992,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-13 14:22:12,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#define MAXSIZE 10000\nint main(){\n    int n,s[MAXSIZE];\n    scanf(\""%d\"",&n);\n    int sum=0;\n       for(int i=0;i<n;i++)\n        scanf(\""%d\"",&s[i]); \n    int t=n-1;\n    while(s[t]<s[t-1])\n        t--;\n       for(int i=1;i<=t;i++)\n           if(s[i]>s[i+1])\n               sum++;\n    sum=sum-1;\n\n    if(sum<0)\n        printf(\""0\"");\n     else\n     {printf(\""%d\"",sum);}\n    printf(\""\\n\"");\n    return 0;\n}",WRONG_ANSWER,10,512
1591677833561563136,42cfad7191c5e6c0eee156c4369182744d6c5db3bc2a5dc87f9f1be6ee4bbcfe,2022-11-13 14:22:22,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main(){\n   int n,a[n];\n   scanf(\""%d\"",&n);\n   int i,sum=0;\n   for(i=0;i<n;i++)\n   scanf(\""%d \"",&a[i]);\n   for(i=1;i<n-1;i++){\n       if(a[i]>a[i+1]){\n        if(a[i+1]==a[i+2]||a[i+1]<a[i+2]&&a[i+1]<a[i+3])\n   \t\t\t   \tsum=sum+1;\n       }\n\t    }\n\n   printf(\""%d\"",sum);\n   return 0;\n} ",WRONG_ANSWER,10,368
1591677856902819840,6933dcb3592e2d6f6fc887ed9a5537aab21a30f76450c9b5043f7776bfc39a59,2022-11-13 14:22:27,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nvoid main(){\n    int n,start,mind,end,temp=0,i;\n    scanf(\""%d\"",&n);\n    int high[n];\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&high[i]);\n    }\n    for(start=0;start+1<=n;start++){\n        if(high[start]>high[start+1]){\n\n            for(mind=start+1;mind+1<n;mind++){\n                if(high[mind]<high[mind+1]){\n\n                    start=mind;\n                    temp++;\n                    break;\n                }\n            }\n        }\n    }\n    printf(\""%d\"",temp);\n}",ACCEPTED,29,512
1591677889140252672,9c773df96630087325d11d08f2dbc9851abb095c63fb7b3e55cb667898dfe23f,2022-11-13 14:22:35,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n    int n;\n    cin >> n;\n    int h[10];\n    int res = 0;\n    for (int i = 1; i <= n; i++) {\n        cin >> h[i];\n    }\n    for (int i = 1; i <= n; i++) {\n        int cnt = 1;\n        int x = i - 1, y = i + 1;\n        while (x > 0 || y < n + 1) {\n            if (x <= 0 || h[x] < h[i]) {\n                x = -1;\n            } else {\n                cnt++;\n            }\n            if (y >= n + 1 || h[y] < h[i]) {\n                y = n + 1;\n            } else {\n                cnt++;\n            }\n            x--;\n            y++;\n        }\n//         cout << cnt << ' ' << h[i] << endl;\n        res = max(res, cnt * h[i]);\n    }\n    cout << res;\n    return 0;\n}\n",RUNTIME_ERROR,19,508
1591677920282992640,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-13 14:22:42,C++,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main(){\n\tint n;\n\tint i,j;\n\tint count=0;\n\tscanf(\""%d\"",&n);\n\tchar a[100000];\n\tscanf(\""%s\"",&a);\n\t/*for(i=0;i<n;i++){\n\t\tscanf(\""%c\"",&a[i]);\n\t}*/\n\tint k;\n\n\tfor(i=0;i<n;i++){\n\t\tif(a[i]!=a[i+1]){\n\t\t\tcount=count+2;\n\t\t\tn=n-2;\n\t\t\tfor(k=i;k<n-i;k++){\n\t\t\ta[k]=a[k+2];\n\t\t\t}\n\t\t\ti=0;\n\t\t\tcontinue;\n\t\t}else if(a[i]=a[i+1]){\n\t\t\tcontinue;\n\t\t}\n\t\n\t}\n\n\tprintf(\""%d\\n\"",count);\n    return 0;\n}",WRONG_ANSWER,3,200
1591677980102123520,281adcca8943f9f4c0ced14f1ceffe157a34fca39f3cb864eb95e400944e38a8,2022-11-13 14:22:57,Java,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"\nimport java.awt.List;\nimport java.lang.reflect.Array;\nimport java.util.Arrays;\nimport java.util.Scanner;\n\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner scan=new Scanner(System.in);\n\t\tint n=scan.nextInt();\n\t\tint a=scan.nextInt();\n\t\tint b=scan.nextInt();\n\t\tint[] c=new int[n];\n\t\tint[] f=new int[n];\n\t\tfor(int i=0;i<n;i++){\n\t\t\tc[i]=scan.nextInt();\n\t\t}\n\t\tfor(int i=0;i<n;i++){\n\t\t\tf[i]=scan.nextInt();\n\t\t}\n\t\tint anser=0;\n\t\tanser=sub(n, c, f, a)-sub(n, c, f,b);\n\t\tSystem.out.println(anser);\n\t}\n\tpublic static int sub(int n,int[] c,int[] f,int a){\n\t\tint ans=0;\n\t\tfor(int i=0;i<n;i++){\n\t\tans+=(int) ((c[i]/(f[i]+1))*Math.pow(a, f[i]+1));\n\t\t}\n\t\treturn ans;\n\t}\n\n}\n",WRONG_ANSWER,108,24836
1591677989790953472,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-11-13 14:22:59,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#define N 10000\nint main()\n{\n    int i,j,n;\n    int a[N]={0};\n    int count=0;\n    scanf(\""%d\"",&n);\n    if(n<3)\n        return 0;\n    else\n    {\n        for(i=0;i<n;i++)\n            scanf(\""%d\"",&a[i]);\n        for(i=1;i<n-1;i++)\n        {\n            for(j=i+2;j<n;j++)\n            {\n                if(a[i]>a[i+1]&&a[j]>a[i+1])\n                {\n                    count++;\n                    i++;\n                    continue;\n                }\n            }\n        }\n        printf(\""%d\\n\"",count);\n        return 0;\n    }\n}",WRONG_ANSWER,7,200
1591678026084311040,07d925df8d2026d3171a0a2ca84a6ef7f4a5b47a584cf47b66c5dd8f28139d1f,2022-11-13 14:23:08,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a[100],count,n,i;\n    count=0;\n    scanf(\""%d\"",&n);\n    for (i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for (i=1;i<n-1;i++){\n        if(a[i]<=a[i-1]&&a[i]<a[i+1])\n            count++;\n    }\n    printf(\""%d\\n\"",count);\n    return 0;\n}",RUNTIME_ERROR,26,356
1591678032514146304,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-11-13 14:23:09,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#define N 10000\nint main()\n{\n    int i,j,n;\n    int a[N]={0};\n    int count=0;\n    scanf(\""%d\"",&n);\n    if(n<3)\n        return 0;\n    else\n    {\n        for(i=0;i<n;i++)\n            scanf(\""%d\"",&a[i]);\n        for(i=1;i<n-1;i++)\n        {\n            for(j=i+2;j<n-1;j++)\n            {\n                if(a[i]>a[i+1]&&a[j]>a[i+1])\n                {\n                    count++;\n                    i++;\n                    continue;\n                }\n            }\n        }\n        printf(\""%d\\n\"",count);\n        return 0;\n    }\n}",WRONG_ANSWER,4,204
1591678039136940032,899c5501179552dc1fe5639f9047e15d0f835e7a87c8568193377882d0278985,2022-11-13 14:23:11,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<string.h>\nint main()\n{\n    int n,i,count=0;\n    scanf(\""%d\"",&n);\n    char s[80];\n    for(i=0;i<n;i++)\n        scanf(\""%c\"",&s[i]);\n    for(i=1;i<=n;i++)\n    {\n        if(s[i]=s[i+1])\n            count+=2;\n        else\n            break;\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",WRONG_ANSWER,5,484
1591678040399470592,40c43472973ea298adbdd1d4b900aeb63cfa4cfe17179f01a4827cd2c6624d3a,2022-11-13 14:23:11,C,300.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nmain()\n{\n    int n,a,b;\n    double c[20],f[20];\n    int i,j;\n    int sum0=0,sum1=0,sum2=0,sum3=0,sumz=0;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%lf\"",&c[i]);\n    }\n    for(j=0;j<n;j++)\n    {\n        scanf(\""%lf\"",&f[j]);\n    }\n    for(i=0;i<n;i++)\n    {\n        for(j=0;j<n;j++)\n        {\n            if(i==j)\n            {\n              sum1=(c[i]/(f[i]+1))*pow(a,f[i]+1);\n              sum0+=sum1;\n              sum3=(c[i]/(f[i]+1))*pow(b,f[i]+1);\n              sum2+=sum3;\n            }\n            else\n                continue;\n        }\n        sumz=sum0-sum2;\n    }\n    printf(\""%d\"",sumz);\n}",ACCEPTED,22,368
1591678070464241664,ccc42b8437aa15d1214e4623799ed35cd8ea8087c26cb1b596d51ae4556ea39c,2022-11-13 14:23:18,Python,0.0,1591610585635213315,1591129345182261248,1049226928954454016,a=eval(input())\nb=input().split()\ndeifen=0\nxiaohao=0\ni=-1\nwhile i<a-1:\n    if i+3<=a:\n        if int(b[i+1])<=int(b[i+3]):\n            deifen+=int(b[i+3])\n            xiaohao+=5\n            i+=3\n        else:\n            deifen+=int(b[i+1])\n            xiaohao+=5\n            i+=1\n    else:\n        deifen+=int(b[i+1])\n        xiaohao+=5\n        i+=1\nprint(deifen-xiaohao),NON_ZERO_EXIT_CODE,21,3028
1591678116865826816,e51465ce72346fac918042a342986433269a159492161f223a180a6e05d9a01a,2022-11-13 14:23:29,Java,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tint result1=0;\n\t\tint result2=0;\n\t\tint result3=0;\n\t\tint min=0;\n        while (in.hasNextInt()) {\n            int p = in.nextInt();\n            int q = in.nextInt();\n            int r = in.nextInt();\n          \n            result1=p+q<r+q?p+q:r+q;\n            \n            result2=p+r<q+r?p+r:q+r;\n            \n            result3=p+r<q+p?p+r:q+p;\n            \n            min=result1<result2?result1:result2<result3?result1<result2?result1:result2:result3;\n            System.out.printf(\""%d\"",min);\n            System.out.println();\n\t}\n}\n}",ACCEPTED,542,24708
1591678132284055552,899c5501179552dc1fe5639f9047e15d0f835e7a87c8568193377882d0278985,2022-11-13 14:23:33,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<string.h>\nint main()\n{\n    int n,i,count=0;\n    scanf(\""%d\"",&n);\n    char s[80];\n    for(i=0;i<n;i++)\n        scanf(\""%c\"",&s[i]);\n    for(i=1;i<=n;i++)\n    {\n        if(s[i]=s[i+1])\n            count+=2;\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",WRONG_ANSWER,4,364
1591678161157644288,d830b0bcae7881ad6d1b2e2b14f3ffa3695b6d3bd622856493fa1cf903c9bf4e,2022-11-13 14:23:40,Java,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint a= sc.nextInt();\n\t\tint b =sc.nextInt();\n\t\tint[] arr1 = new int[n];\n\t\tint[] arr2 = new int[n];\n\t\tfor(int i =0;i< arr1.length;i++){\n\t\t\t\tarr1[i]=sc.nextInt();\n\t\t\t\n\t\t}\n\t\tfor(int i =0;i< arr2.length;i++){\n\t\t\tarr2[i]=sc.nextInt();\n\t\t\n\t\t}\n\t\tint res1=0;\n\t\tfor(int i =0;i<n;i++){\n\t\t\tres1+= arr1[i]/(arr2[i]+1)*(Math.pow(a, arr2[i]+1));\n\t\t}\n\t\tint res2=0;\n\t\tfor(int i =0;i<n;i++){\n\t\t\tres2+= arr1[i]/(arr2[i]+1)*(Math.pow(b, arr2[i]+1));\n\t\t}\n\t\tint res=res1-res2;\n\t\tSystem.out.print(res);\n\t}\n}",WRONG_ANSWER,106,25044
1591678172910084096,9c773df96630087325d11d08f2dbc9851abb095c63fb7b3e55cb667898dfe23f,2022-11-13 14:23:43,C++,300.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n    int n;\n    cin >> n;\n    int h[10010];\n    int res = 0;\n    for (int i = 1; i <= n; i++) {\n        cin >> h[i];\n    }\n    for (int i = 1; i <= n; i++) {\n        int cnt = 1;\n        int x = i - 1, y = i + 1;\n        while (x > 0 || y < n + 1) {\n            if (x <= 0 || h[x] < h[i]) {\n                x = 0;\n            } else {\n                cnt++;\n            }\n            if (y >= n + 1 || h[y] < h[i]) {\n                y = n + 1;\n            } else {\n                cnt++;\n            }\n            x--;\n            y++;\n        }\n//         cout << cnt << ' ' << h[i] << endl;\n        res = max(res, cnt * h[i]);\n    }\n    cout << res;\n    return 0;\n}\n",ACCEPTED,28,600
1591678185253920768,e7e6ce2c6e9e530eaf2b9b9968748a0e44e3ac7183d73deb51851946350bfbb0,2022-11-13 14:23:45,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    char a[10];\n    int n;\n //   int r;      //循环变量;\n    int flag=0;\n    int i,k,l,j;\n    scanf(\""%d\"",&n); //n代表字符串长度\n\n    for(i=0;i<=n;i++)\n    {\n        scanf(\""%c\"",&a[i]);\n    }\n\n\n    i=0;j=1;\n    k=a[i];\n    l=a[j];\n\n  do {\n        if(k==l) {\n            i=j;\n            j++;\n        }\n        else\n        {\n            flag=flag+2;\n            i--;\n            j++;\n        }\n\n    }while(flag!=n||a[10]==0||l=='/0');\n\n    printf(\""%d\"",flag);\n    return 0;\n}\n",RUNTIME_ERROR,8,472
1591678192405209088,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-13 14:23:47,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int N=10005;\nint a[N];\nint b[N];\nint main(){\nint n;\ncin>>n;\nfor(int i=0;i<n;i++)\ncin>>a[i];\nsort(a,a+n);\nfor(int i=0;i<n;i++)\nb[i]=a[i]*(n-i);\nsort(b,b+n);\ncout<<b[n-1];\nreturn 0;\n} ",WRONG_ANSWER,7,324
1591678207622144000,a57fdafe4877cd9608fc0ac8a5120a47bc60a015785960e61b67b4e66187c2f2,2022-11-13 14:23:51,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 100\nint main(){\n    int i,n,j=0,k;\n    int a[N];\n    scanf(\""%d\"",&n);\n    if(n<3)\n        return 0;\n    else{\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n     for(i=0;i<n;i++){\n        if(a[i]<a[i-1]){\n          for(k=i;k<n;k++)\n              if(a[i]<a[i+1]){\n                  j++;\n                 break;\n                  i=k;\n              }\n        }\n         \n    }\n    printf(\""%d\\n\"",j);\n    }\n    return 0;\n}",WRONG_ANSWER,8,184
1591678214551121920,07d925df8d2026d3171a0a2ca84a6ef7f4a5b47a584cf47b66c5dd8f28139d1f,2022-11-13 14:23:52,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a[10000],count,n,i;\n    count=0;\n    scanf(\""%d\"",&n);\n    for (i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for (i=1;i<n-1;i++){\n        if(a[i]<=a[i-1]&&a[i]<a[i+1])\n            count++;\n    }\n    printf(\""%d\\n\"",count);\n    return 0;\n}",ACCEPTED,29,500
1591678218980352000,e7e6ce2c6e9e530eaf2b9b9968748a0e44e3ac7183d73deb51851946350bfbb0,2022-11-13 14:23:54,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    char a[10];\n    int n;\n //   int r;      //循环变量;\n    int flag=0;\n    int i,k,l,j;\n    scanf(\""%d\"",&n); //n代表字符串长度\n\n    for(i=0;i<=n;i++)\n    {\n        scanf(\""%c\"",&a[i]);\n    }\n\n\n    i=0;j=1;\n    k=a[i];\n    l=a[j];\n\n  do {\n        if(k==l) {\n            i=j;\n            j++;\n        }\n        else\n        {\n            flag=flag+2;\n            i--;\n            j++;\n        }\n\n    }while(flag!=n||a[10]==0||l=='\\0');\n\n    printf(\""%d\"",flag);\n    return 0;\n}\n",RUNTIME_ERROR,9,196
1591678221354328064,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-13 14:23:54,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,j,k=-1,sum=0;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(j=0;j<n;j++)\n    {\n        a[j]=a[j]-5;\n    }\n   for(;k<n;)\n    {\n        if(k+1==n-1)\n        {\n            sum+=a[k+1];\n            break;\n        }\n        if(k+3<n-1)\n        {\n        if(k==n-1)\n            break;\n        if(a[k+1]>a[k+3])\n        {\n            sum+=a[k+1];\n            k=k+1;\n            continue;\n        }\n        else  if(a[k+3]>a[k+1])\n        {\n            sum+=a[k+3];\n            k=k+3;\n            continue;\n        }\n        }\n        else{\n            sum+=a[k+1];\n            k=k+1;\n            continue;\n        }\n    }\n    if(n==0)\n        printf(\""%d\"",a[0]);\n    else\n        printf(\""%d\"",sum);\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,400,472
1591678227171782656,6933dcb3592e2d6f6fc887ed9a5537aab21a30f76450c9b5043f7776bfc39a59,2022-11-13 14:23:55,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nint main(){\n    int n,i;\n    scanf(\""%d\"",&n);\n    int high[n];\n    int x[n];\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&high[i]);\n    }\n    sort(high,high+n);\n    for(i=0;i<n;i++){\n        x[i]=high[i]*(n-i);\n    }\n    sort(x,x+n);\n    printf(\""%d\"",x[n-1]);\n}",WRONG_ANSWER,5,324
1591678258717188096,05fd79145678de5c06012db9db4333bebf8365a74fe442d12a54a9da3782fdca,2022-11-13 14:24:03,C++,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<iostream>\n#define N 100005\nusing namespace std;\nlong long int jump[N];\nlong long int n;\nlong long int ci = 0;\nlong long int maxScore;\nvoid jumps(int index,int num,long long int score){\n\n\tif(index >= n) {\n\t\tif(ci == 0){\n\t\t\tmaxScore = score;\n\t\t\tci++;\n\t\t}else{\n\t\t\tif(maxScore < score) maxScore = score;\n\t\t}\n\t\treturn;\n\t};\n\tscore-=5;\n\tjumps(index+num,1,score+jump[index]);\n\tjumps(index+num,3,score+jump[index]);\n}\n\nint main(){\n\tcin >> n;\n\tfor(int i = 0;i<n;i++) cin >>jump[i];\n\tjumps(-1,1,0);\n\tjumps(-1,3,0);\n\tcout << maxScore+5;\n\treturn 0;\n}\n",TIME_LIMIT_EXCEEDED,400,968
1591678262487822336,6933dcb3592e2d6f6fc887ed9a5537aab21a30f76450c9b5043f7776bfc39a59,2022-11-13 14:24:04,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nint main(){\n    int n,i;\n    scanf(\""%d\"",&n);\n    int high[n];\n    int x[n];\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&high[i]);\n    }\n    sort(high,high+n);\n    for(i=0;i<n;i++){\n        x[i]=high[i]*(n-i);\n    }\n    sort(x,x+n);\n    printf(\""%d\"",x[n-1]);\n}",WRONG_ANSWER,5,196
1591678276584923136,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-13 14:24:07,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,j,k=-1,sum=0;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(j=0;j<n;j++)\n    {\n        a[j]=a[j]-5;\n    }\n   for(;k<n;)\n    {\n        if(k+1==n-1)\n        {\n            sum+=a[k+1];\n            break;\n        }\n        if(k+3<n-1)\n        {\n        if(k==n-1)\n            break;\n        if(a[k+1]>a[k+3])\n        {\n            sum+=a[k+1];\n            k=k+1;\n            continue;\n        }\n        else  if(a[k+3]>a[k+1])\n        {\n            sum+=a[k+3];\n            k=k+3;\n            continue;\n        }\n        }\n        else{\n            sum+=a[k+1];\n            k=k+1;\n            continue;\n        }\n    }\n    if(n==0)\n        printf(\""%d\"",a[0]);\n    else\n        printf(\""%d\"",sum);\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,400,456
1591678297015377920,6933dcb3592e2d6f6fc887ed9a5537aab21a30f76450c9b5043f7776bfc39a59,2022-11-13 14:24:12,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nint main(){\n    int n,i;\n    scanf(\""%d\"",&n);\n    int high[n];\n    int x[n];\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&high[i]);\n    }\n    sort(high,high+n);\n    for(i=0;i<n;i++){\n        x[i]=high[i]*(n-i);\n    }\n    sort(x,x+n);\n    printf(\""%d\"",x[n-1]);\n}",WRONG_ANSWER,6,328
1591678313800949760,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 14:24:16,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[n],i,s;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if((n-i-1)*a[i+1]>(n-i)*a[i])\n            s=(n-i-1)*a[i+1];\n        else\n            s=(n-i)*a[i];\n        }\n    printf(\""%d\"",s)\n    return 0;\n}",COMPILE_ERROR,0,0
1591678349955850240,fbea21dbaf89f1b064feaa20227f21c5e1c4888fdc371cf5e43f70615906e52a,2022-11-13 14:24:25,Python,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"n=int(input())\nm=list(map(int,input().split()))\nnum=0\nfor i in range(n):\n    if m[i]>=3:\n        num=num+1\n        x=i\n        continue\nfor j in range (x+1,n):\n    if m[j]>=3 and m[j-1]>=3:\n        num+=1\ns=3*num*1\nprint(s)\n    ",WRONG_ANSWER,16,2768
1591678351767789568,28b4de6882b7ade2679f59c486acaf307ce8415dcb0a15787dba589025bbdb02,2022-11-13 14:24:25,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint n,a,b;\n\tscanf(\""%d%d%d\"",&n,&a,&b);\n\tint xi[n],mi[n],sum=0;\n\tint i;\n\tfor(i=0;i<n;i++)\n\tscanf(\""%d\"",&xi[i]);\n\tfor(i=0;i<n;i++)\n\tscanf(\""%d\"",&mi[i]);\n\tfor(i=0;i<n;i++)\n\t{\n\t\tsum+=xi[i]*pow(a,mi[i]+1)/(mi[i]+1)-xi[i]*pow(b,mi[i]+1)/(mi[i]+1);\t\n\t}\n\tprintf(\""%d\"",sum);\n\treturn 0;\n}",WRONG_ANSWER,6,316
1591678390401556480,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 14:24:34,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[n],i,s;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if((n-i-1)*a[i+1]>(n-i)*a[i])\n            s=(n-i-1)*a[i+1];\n        else\n            s=(n-i)*a[i];\n        }\n    printf(\""%d\"",s);\n    return 0;\n}",RUNTIME_ERROR,10,352
1591678392553201664,eeab3421c2b685f7d51b09a289b82fe82ba0d3896984d09aeffb9d022232d887,2022-11-13 14:24:35,Java,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.math.BigDecimal;\nimport java.util.Scanner;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n    public static void main(String[] args) {\n        FastReader fastReader =  new FastReader();\n       int n = fastReader.nextInt();\n       if(n == 0)\n       {\n           System.out.println(0);\n           return ;\n       }\n       long result = 0;\n       long[] f = new long[n];\n       for(int i=0;i<n;i++)\n           f[i] = fastReader.nextLong();\n       for(int i = 0;i<n;i++){\n           int t = 0;\n            for(int j = n-1;j>=i;j--){\n                if(f[j] > f[i]){\n                    t = j;\n                    break;\n                }\n             }\n            result = Math.max(result,Math.min(f[i],f[t])*(t-i+1));\n       }\n        System.out.println(result);\n    }\n\n\n    static class FastReader {\n        BufferedReader br;\n        StringTokenizer st;\n        public FastReader()\n        {\n            br = new BufferedReader(\n                    new InputStreamReader(System.in));\n        }\n\n\n        String next()\n        {\n            while (st == null || !st.hasMoreElements()) {\n                try {\n                    st = new StringTokenizer(br.readLine());\n                }\n                catch (IOException e) {\n                    e.printStackTrace();\n                }\n            }\n            return st.nextToken();\n        }\n\n\n\n        int nextInt() { return Integer.parseInt(next()); }\n\n        long nextLong() { return Long.parseLong(next()); }\n\n        double nextDouble(){return Double.parseDouble(next());}\n\n\n        String nextLine()\n        {\n            String str = \""\"";\n\n            try {\n                if (st!= null && st.hasMoreTokens()){\n                    str = st.nextToken(\""\\n\"");\n                } else {\n                    str = br.readLine();\n                }\n            }\n            catch (IOException e) {\n                e.printStackTrace();\n            }\n            return str;\n        }\n\n\n    }\n}\n\n\n\n",WRONG_ANSWER,68,22732
1591678407417802752,9d0546dac18a9dc678295254e547925db086add5f872ef42d8015d525afeaf65,2022-11-13 14:24:38,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 10000\nint main()\n{\n    int num[N],i,j,n,temp;\n    int k=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&num[i]);\n    }\n    for(i=1;i<n-2;i++){\n        if(num[i]>num[i+1]){\n            k++;\n        }\n    }\n    printf(\""%d\"",k);\n}\n",WRONG_ANSWER,5,200
1591678438451470336,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-13 14:24:46,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n\nint main() {\n\t     int n,zhan,i,j;\n\t\t scanf(\""%d\"",&n); \n\t\t int a[100];\n\t\t for(i=0;i<n;i++)\n\t\t {\n\t\t scanf(\""%d\"",&a[i]);\n\t     }\n\t   a[0]=a[n-1]=0;\n\t     \tfor(i=0;i<n;i++)\t\n\t\t{\t\n\t\tfor(j=1;j<n;j++)\n\t\t{\n\t\t\tif(a[i]>a[i+1])\n\t\t\t{\n\t\t\tif(a[i+1]<a[i+j])\n\t\t\tzhan++;\n\t\t\tbreak;\n\t\t\t}\n\t\t\t i++;\n\t\t}\n\t\t\n\t\t}\n\t\t\tprintf(\""%d\"",zhan);\t\n\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                   \n",WRONG_ANSWER,7,200
1591678464674246656,28b4de6882b7ade2679f59c486acaf307ce8415dcb0a15787dba589025bbdb02,2022-11-13 14:24:52,C++,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint n,i,j,k=0;\n\tscanf(\""%d\"",&n);\n\tgetchar();\n\tchar num[n+1];\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%c\"",&num[i]);\n\t}\n\tfor(i=0;i<n-1;i++)\n\t{\n\t\tif(num[i]!=num[i+1])\n\t\t{\n\t\t\tk=k+2;\t\n\t\t\tfor(j=i+2;j<n;j++)\n\t\t\t{\n\t\t\t\tnum[j-2]=num[j];\n\t\t\t}\n\t\t\tif(i==0)\n\t\t\ti=i-1;\n\t\t\telse\n\t\t\ti=i-2;\n\t\t\tn=n-2;\n\t\t}\n\t}\n\tprintf(\""%d\\n\"",k);\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,426,380
1591678465248866304,9d0546dac18a9dc678295254e547925db086add5f872ef42d8015d525afeaf65,2022-11-13 14:24:52,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 10000\nint main()\n{\n    int num[N],i,j,n,temp;\n    int k=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&num[i]);\n    }\n    for(i=1;i<n-2;i++){\n        if(num[i]>num[i+1]){\n            k++;\n        }\n    }\n    printf(\""%d\\n\"",k);\n}\n",WRONG_ANSWER,5,324
1591678486899863552,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-13 14:24:57,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n\tint n,a,b,i;\n\tscanf(\""%d\"",&n);\n\tscanf(\""%d\"",&a);\n\tscanf(\""%d\"",&b);\n\tint c[n],f[n];\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&c[i]);\n\t}\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&f[i]);\n\t}\n\tint a1,a2;\n\ta1=0;\n\ta2=0;\n\tfor(i=0;i<n;i++)\n\t{\n\t\ta1+=c[i]/(f[i]+1)*pow(a,(f[i]+1));\n\t\ta2+=c[i]/(f[i]+1)*pow(b,(f[i]+1));\n\t}\n\tprintf(\""%d\\n\"",a1-a2);\n\t\n}",WRONG_ANSWER,6,328
1591678511197511680,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-13 14:25:03,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<iostream>\n#include<math.h>\nusing namespace std;\ntypedef long long int ll;\nclass resolve{\n  public:\n    int resve(int x,int y,int a,int b){\n        return (a/(b+1))*(ll)pow(x,b+1)-(a/(b+1))*(ll)pow(y,b+1);\n    }\n};\nint main(){\n    int i,n,a[1000],b[1000],x,y;\n    ll resv=0;\n    cin>>n>>x>>y;\n    if(n==0)\n        cout<<\""0\""<<endl;\n    for(i=0;i<n;i++){\n        cin>>a[i];\n    }\n    for(i=0;i<n;i++){\n        cin>>b[i];\n    }\n    resolve res;\n    for(i=0;i<n;i++){\n        resv += res.resve(x,y,a[i],b[i]);\n    }\n    cout<<resv<<endl;\n    return 0;\n}",WRONG_ANSWER,5,412
1591678526250823680,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-13 14:25:07,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,i,e=0,x1=0,x2=0,x3=0,x4=0;\n    scanf(\""%d\"",&n);\n    char s[n];\n    scanf(\""%s\"",s);\n    l=n;\n    for(i=0;i<n;i++)\n    {if(s[i]==1)\n        x1++;\n    if(s[i]==0)\n        x2++;\n    if(x1==n||x2==n)break;\n    if(s[i]!=s[i+1])\n    {\n     l=l-2;\n     e=e+2;\n    for(j=0;j<n-2;j++)\n    s[j]=s[j+2];\n    for(k=0;k<l;k++)\n     if(a[i]==1)\n         x3++;\n     if(a[i]==0)\n         x4++;\n      if(x3==l||x4==l||l==0)break;  \n    }\n    printf(\""%d\"",e);\n    return 0;\n    \n}",COMPILE_ERROR,0,0
1591678559847198720,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-13 14:25:15,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,i,e=0,x1=0,x2=0,x3=0,x4=0,l;\n    scanf(\""%d\"",&n);\n    char s[n];\n    scanf(\""%s\"",s);\n    l=n;\n    for(i=0;i<n;i++)\n    {if(s[i]==1)\n        x1++;\n    if(s[i]==0)\n        x2++;\n    if(x1==n||x2==n)break;\n    if(s[i]!=s[i+1])\n    {\n     l=l-2;\n     e=e+2;\n    for(j=0;j<n-2;j++)\n    s[j]=s[j+2];\n    for(k=0;k<l;k++)\n     if(a[i]==1)\n         x3++;\n     if(a[i]==0)\n         x4++;\n      if(x3==l||x4==l||l==0)break;  \n    }\n    printf(\""%d\"",e);\n    return 0;\n    \n}",COMPILE_ERROR,0,0
1591678590234976256,5d7d397496e2400ea10e8ecafd4566e19d1083215d66cad8e11230c22227362c,2022-11-13 14:25:22,C++,300.0,1591610585635213316,1591130116607045632,1049226928954454016,"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n{\n    printf(\""60\\n\"");\n    return 0;\n}\n",ACCEPTED,6,640
1591678630131150848,190178fcb71270e17fbe689a22517f5296281dfcd3b16ec01748057e49740d1d,2022-11-13 14:25:32,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int P=0,Q=0,R=0,X,Y,Z;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    X=P+Q;\n    Y=Q+R;\n    Z=R+P;\n    if(X<=Y&&X<=Z)\n    printf(\""%d\"",X);\n    else if(Y<=X&&Y<=Z)\n    printf(\""%d\"",Y);\n    else if(Z<=X&&Z<=Y)\n    printf(\""%d\"",Z);\n    return 0;\n}",ACCEPTED,46,640
1591678634803650560,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-13 14:25:33,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,i,e=0,x1=0,x2=0,x3=0,x4=0,l,j,k;\n    scanf(\""%d\"",&n);\n    char s[n];\n    scanf(\""%s\"",s);\n    l=n;\n    for(i=0;i<n;i++)\n    {if(s[i]==1)\n        x1++;\n    if(s[i]==0)\n        x2++;\n    if(x1==n||x2==n)break;\n    if(s[i]!=s[i+1])\n    {\n     l=l-2;\n     e=e+2;\n    for(j=0;j<n-2;j++)\n    s[j]=s[j+2];\n    for(k=0;k<l;k++)\n     if(a[i]==1)\n         x3++;\n     if(a[i]==0)\n         x4++;\n      if(x3==l||x4==l||l==0)break;  \n    }\n    printf(\""%d\"",e);\n    return 0;\n    \n}",COMPILE_ERROR,0,0
1591678637265661952,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-13 14:25:33,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int num;\n    scanf(\""%d\"",&num);\n    int a[num + 1];\n    int i,j;\n    int count = 0;\n    for(i = 1;i < num + 1;i++) {\n        scanf(\""%d\"",&a[i]);\n        a[i] -= 5;\n    }\n    i = 0;\n    while(i+3 < num) {\n        if(a[i+1] > a[i+3]) {\n            count += a[i+1];\n            i = i+1;\n        } else {\n            count+= a[i+3];\n            i = i+3;\n        }\n    }\n    for(j = i;j < num;j++) {\n        count+=a[j+1];\n    }\n    printf(\""%d \"",count);\n    return 0;\n}",WRONG_ANSWER,14,384
1591678670346137600,86f702b052a21d7cb2f8cd933c678c21efaafaf5b2d35032f18ec35c1e26a945,2022-11-13 14:25:41,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main()\n{\n   int n,i,j,k;\n    int max=0,sum=0;\n    int h[1000000];\n    scanf(\""%d\"",&n);\n        for(i=0;i<n;i++)\n            scanf(\""%d\"",&h[i]);\n    for(i=0;i<n;i++)\n    {  int a=0;\n        for(j=0;j<n-i;j++)\n        {\n            if(h[i]<=h[i+j])  a++;\n            else break;\n        }\n        for(k=1;k<i;k++)\n       {\n            if(h[i]<=h[i-k])  a++;\n            else break;\n        }\n     sum=h[i]*a;\n     if(sum>max) max=sum;\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",WRONG_ANSWER,26,352
1591678672371986432,a57fdafe4877cd9608fc0ac8a5120a47bc60a015785960e61b67b4e66187c2f2,2022-11-13 14:25:42,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 100\nint main(){\n    int i,n,j=0,k;\n    int a[N];\n    scanf(\""%d\"",&n);\n    if(n<3)\n        return 0;\n    else{\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n     for(i=1;i<n-1;i++){\n        if(a[i]<a[i-1]){\n          for(k=i;k<n-1;k++)\n              if(a[k]<a[k+1]){\n                  j++;\n                 break;\n                  i=k;\n              }\n        }\n         \n    }\n    printf(\""%d\\n\"",j);\n    }\n    return 0;\n}",WRONG_ANSWER,4,384
1591678681855352832,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-13 14:25:44,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n\tint n,a,b,i;\n\tscanf(\""%d %d %d\"",&n,&a,&b);\n\tint c[n],f[n];\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&c[i]);\n\t}\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&f[i]);\n\t}\n\tint a1,a2;\n\ta1=0;\n\ta2=0;\n\tfor(i=0;i<n;i++)\n\t{\n\t\ta1+=c[i]/(f[i]+1)*pow(a,(f[i]+1));\n\t\ta2+=c[i]/(f[i]+1)*pow(b,(f[i]+1));\n\t}\n\tprintf(\""%d\\n\"",a1-a2);\n\t\n}",WRONG_ANSWER,7,200
1591678691246399488,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-11-13 14:25:46,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#define N 10000\nint main()\n{\n    int i,j,n;\n    int a[N]={0};\n    int count=0;\n    scanf(\""%d\"",&n);\n    if(n<3)\n        return 0;\n    else\n    {\n        for(i=0;i<n;i++)\n            scanf(\""%d\"",&a[i]);\n        for(i=1;i<n-1;i++)\n        {\n            for(j=i+2;j<n-1;j++)\n            {\n                if(a[i]>a[i+1]&&a[j]>a[i+1])\n                {\n                    count++;\n                    i++;\n                    continue;\n                }\n            }\n        }\n        printf(\""%d\\n\"",count);\n        return 0;\n    }\n}",WRONG_ANSWER,6,316
1591678693343506432,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-13 14:25:47,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,j,k=-1,sum=0;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(j=0;j<n;j++)\n    {\n        a[j]=a[j]-5;\n    }\n   for(;k<n;)\n    {\n        if(k+1==n-1)\n        {\n            sum+=a[k+1];\n            break;\n        }\n        if(k+3<n-1)\n        {\n        if(k==n-1)\n            break;\n        if(a[k+1]>a[k+3])\n        {\n            sum+=a[k+1];\n            k=k+1;\n            continue;\n        }\n        else  if(a[k+3]>a[k+1])\n        {\n            sum+=a[k+3];\n            k=k+3;\n            continue;\n        }\n        }\n        else{\n            sum+=a[k+1];\n            k=k+1;\n            continue;\n        }\n    }\n    if(n==0)\n        printf(\""%d\"",a[0]);\n    else\n        printf(\""%d\"",sum);\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,400,348
1591678711840387072,42cfad7191c5e6c0eee156c4369182744d6c5db3bc2a5dc87f9f1be6ee4bbcfe,2022-11-13 14:25:51,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main(){\n   int n,a[n];\n   scanf(\""%d\"",&n);\n   int i,sum=0;\n   for(i=0;i<n;i++)\n   scanf(\""%d \"",&a[i]);\n   for(i=1;i<n-1;i++){\n       if(a[i]>a[i+1]&&a[i+1]<a[i+2]){\n           \tsum=sum+1;\n        if(a[i+1]==a[i+2]||a[i+1]<a[i+3])\n   \t\t\t sum=sum+1;\n       }\n\t    }\n\n   printf(\""%d\"",sum);\n   return 0;\n} ",WRONG_ANSWER,4,196
1591678713023180800,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-11-13 14:25:51,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#define N 10000\nint main()\n{\n    int i,j,n;\n    int a[N]={0};\n    int count=0;\n    scanf(\""%d\"",&n);\n    if(n<3)\n        return 0;\n    else\n    {\n        for(i=0;i<n;i++)\n            scanf(\""%d\"",&a[i]);\n        for(i=1;i<n-1;i++)\n        {\n            for(j=i+2;j<n-1;j++)\n            {\n                if(a[i]>a[i+1]&&a[j]>a[i+1])\n                {\n                    count++;\n                    i++;\n                    continue;\n                }\n            }\n        }\n        printf(\""%d\"",count);\n        return 0;\n    }\n}",WRONG_ANSWER,8,352
1591678742316199936,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-11-13 14:25:58,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#define N 10000\nint main()\n{\n    int i,j,n;\n    int a[N]={0};\n    int count=0;\n    scanf(\""%d\"",&n);\n    if(n<3)\n        return 0;\n    else\n    {\n        for(i=0;i<n;i++)\n            scanf(\""%d\"",&a[i]);\n        for(i=1;i<n-1;i++)\n        {\n            for(j=i+2;j<n-1;j++)\n            {\n                if(a[i]>a[i+1]&&a[j]>a[i+1])\n                {\n                    count++;\n                    i++;\n                    continue;\n                }\n            }\n        }\n        printf(\""%d\\n\"",count);\n        return 0;\n    }\n}",WRONG_ANSWER,5,324
1591678794988269568,c47b15e117166a3dd00078b9f795673d5284a2761e582479119229751cc734d3,2022-11-13 14:26:11,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#define S 10000\n\n\nint main()\n{\n    int a=0,n,i;\n    int h[S];\n    scanf(\""%d\"",&n);\n\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&h[i]);\n    for(i=0;i<n;i++)\n    {\n        if(h[i]>h[i+1])\n        a+=1;\n    }\n    printf(\""%d\"",a-1);\n    return 0;\n}\n",WRONG_ANSWER,6,196
1591678842891415552,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-13 14:26:22,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,def clean(num):\n    for i in range(len(num)-1):\n        if num[i]!=num[i+1]:\n            \n            num.pop(i)\n            \n            num.pop(i)\n            return clean(num)\n    else:\n         return num\n\nn=int(input())\nb=input()\na=list(b)\nprint(a)\nprint(n-len(clean(a)))\n,WRONG_ANSWER,23,2780
1591678844913082368,a57fdafe4877cd9608fc0ac8a5120a47bc60a015785960e61b67b4e66187c2f2,2022-11-13 14:26:23,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 100\nint main(){\n    int i,n,j=0,k;\n    int a[N];\n    scanf(\""%d\"",&n);\n    if(n<3)\n        return 0;\n    else{\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n     for(i=1;i<n-1;i++){\n        if(a[i]<a[i-1]){\n          for(k=i;k<n-1;k++)\n              if(a[k]<a[k+1]){\n                  j++;\n                 break;\n                  i=k+1;\n              }\n        }\n         \n    }\n    printf(\""%d\\n\"",j);\n    }\n    return 0;\n}",WRONG_ANSWER,6,328
1591678885883031552,42cfad7191c5e6c0eee156c4369182744d6c5db3bc2a5dc87f9f1be6ee4bbcfe,2022-11-13 14:26:33,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main(){\n   int n,a[n];\n   scanf(\""%d\"",&n);\n   int i,sum=0;\n   for(i=0;i<n;i++)\n   scanf(\""%d \"",&a[i]);\n   for(i=1;i<n-1;i++){\n       if(a[i]>a[i+1]&&a[i+1]<a[i+2]){\n           \tsum=sum+1;\n        if(a[i]>a[i+1]&&a[i+1]==a[i+2]||a[i+1]<a[i+3])\n   \t\t\t sum=sum+1;\n       }\n\t    }\n\n   printf(\""%d\"",sum);\n   return 0;\n} ",WRONG_ANSWER,5,356
1591678946918543360,1363fe5b260b83108efff76d53fc3ee37db1aa74f7eb5c5c7e6dacb996b49862,2022-11-13 14:26:47,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int p,q,r,min,min1,min2;\n    scanf(\""%d %d %d\"",&p,&q,&r);\n    min1=p;\n    if(q>r){\n        min2=r;\n    }else{\n        min2=q;\n    }\n    if(min1>min2){\n        min=min2;\n    }else{\n        min=min1;\n    }\n    if(min==p){\n        if(q>r){\n            printf(\""%d\"",min+r);\n        }else{\n            printf(\""%d\"",min+q);\n        }\n    }else if(min==q){\n        if(p>r){\n            printf(\""%d\"",min+r);\n        }else{\n            printf(\""%d\"",min+p);\n        }\n    }else if(min==r){\n        if(p>q){\n            printf(\""%d\"",min+q);\n        }else{\n            printf(\""%d\"",min+p);\n        }\n    }\n    return 0;\n}",ACCEPTED,30,640
1591678959241420800,9c773df96630087325d11d08f2dbc9851abb095c63fb7b3e55cb667898dfe23f,2022-11-13 14:26:50,C++,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <iostream>\n\nusing namespace std;\n\nint main() {\n    int a, b, c;\n    cin >> a >> b >> c;\n    cout << (a + b + c - max(a, max(b, c)));\n    return 0;\n}",ACCEPTED,37,476
1591678962403926016,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-13 14:26:51,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,def clean(num):\n    for i in range(len(num)-1):\n        if num[i]!=num[i+1]:\n            num.pop(i)\n            num.pop(i)\n            return clean(num)\n    else:\n         return num\n\nn=int(input())\nb=input()\na=list(b)\nprint(n-len(clean(a)))\n,NON_ZERO_EXIT_CODE,122,4940
1591678972952633344,d4c94290401b65ee2ce02056ca325b624120f06a8f67557b729453a418b199fe,2022-11-13 14:26:53,C++,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\n\nint n,count1=0;\nstring str;\nint main(){\n\tcin>>n;\n\tcin>>str;\n\tint len=str.size();\n\tfor(int i=0;i<len;i++)\n\t{\n\t\tif(str[i]=='0') count1++;\n\t}\n\tcout<<min(count1,n-count1);\n\t\treturn 0;\n} ",WRONG_ANSWER,4,328
1591679066925981696,e0a829315cc9947a3e714cd579e3322e8dee5f8ca36e30fd276de5a8e294b6f8,2022-11-13 14:27:16,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n    int n;\n    int s[10];\n    int i;\n    int k=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&s[i]);\n    for(i=0;i<n;i++)\n        {if(s[i]==s[i+1])\n            i+=2;\n            s[i]=s[i+2];\n            k+=2;}\n    printf(\""%d\"",k);\n    return 0;\n}\n",RUNTIME_ERROR,13,384
1591679121011531776,86f702b052a21d7cb2f8cd933c678c21efaafaf5b2d35032f18ec35c1e26a945,2022-11-13 14:27:29,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main()\n{\n   int n,i,j,k;\n    int max=0,sum=0;\n    int h[1000000];\n    scanf(\""%d\"",&n);\n        for(i=0;i<n;i++)\n            scanf(\""%d\"",&h[i]);\n    for(i=0;i<n;i++)\n    {  int a=0;\n        for(j=0;j<n-i;j++)\n        {\n            if(h[i]<=h[i+j])  a++;\n            else break;\n        }\n        for(k=1;k<i;k++)\n       {\n            if(h[i]<=h[i-k])  a++;\n            else break;\n        }\n     sum=h[i]*a;\n     if(sum>max) max=sum;\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",WRONG_ANSWER,26,332
1591679122513125376,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-13 14:27:29,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,i,e=0,x1=0,x2=0,x3=0,x4=0,l,j,k;\n    scanf(\""%d\"",&n);\n    char s[n];\n    scanf(\""%s\"",s);\n    l=n;\n    for(i=0;i<n;i++)\n    {if(s[i]=='1')\n        x1++;\n    if(s[i]=='0')\n        x2++;\n    if(x1==n||x2==n)break;\n    if(s[i]!=s[i+1])\n    {\n     l=l-2;\n     e=e+2;\n    for(j=0;j<n-2;j++)\n    s[j]=s[j+2];\n    for(k=0;k<l;k++)\n     if(s[i]=='1')\n         x3++;\n     if(s[i]=='0')\n         x4++;\n      if(x3==l||x4==l||l==0)break;  \n    }\n    printf(\""%d\"",e);\n    return 0;\n    \n}",COMPILE_ERROR,0,0
1591679168092626944,e715137eeb4190ade2330123b989bbdd6eebd9a5e1df2e292271d3bfe3a79c69,2022-11-13 14:27:40,C,0.0,1591610585635213319,1591131955016622080,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,j,k,n,w=0,a,b;\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++)\n    {\n        w=0;\n        scanf(\""%d\"",&k);\n        scanf(\""%d\"",&a);\n        for(j=1;j<k;j++)\n        {\n            scanf(\""%d\"",&b);\n            if(a==1)\n            {\n                w+=b-1;\n            }\n            \n           else if(b%(a*2)==0&&b!=(a*2))\n               w+=b/(a*2)+1;\n           else\n                w+=b/(a*2);   \n        }\n        printf(i==n?\""%d\"":\""%d\\n\"",w);\n    }\n    return 0;\n}",WRONG_ANSWER,10,384
1591679228373164032,42cfad7191c5e6c0eee156c4369182744d6c5db3bc2a5dc87f9f1be6ee4bbcfe,2022-11-13 14:27:54,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main(){\n   int n,a[n];\n   scanf(\""%d\"",&n);\n   int i,sum=0;\n   for(i=0;i<n;i++)\n   scanf(\""%d \"",&a[i]);\n   for(i=1;i<n-1;i++){\n       if(a[i]>a[i+1]&&a[i+1]<a[i+2]){\n           \tsum=sum+1;\n        if(a[i]>a[i+1]&&a[i+1]<a[i+3]||a[i+1]==a[i+2])\n   \t\t\t sum=sum+1;\n       }\n\t    }\n\n   printf(\""%d\"",sum);\n   return 0;\n} ",WRONG_ANSWER,4,196
1591679271268311040,86f702b052a21d7cb2f8cd933c678c21efaafaf5b2d35032f18ec35c1e26a945,2022-11-13 14:28:04,C,300.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main()\n{\n   int n,i,j,k;\n    int max=0,sum=0;\n    int h[1000000];\n    scanf(\""%d\"",&n);\n        for(i=0;i<n;i++)\n            scanf(\""%d\"",&h[i]);\n    for(i=0;i<n;i++)\n    {  int a=0;\n        for(j=0;j<n-i;j++)\n        {\n            if(h[i]<=h[i+j])  a++;\n            else break;\n        }\n        for(k=1;k<=i;k++)\n       {\n            if(h[i]<=h[i-k])  a++;\n            else break;\n        }\n     sum=h[i]*a;\n     if(sum>max) max=sum;\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",ACCEPTED,31,348
1591679274548256768,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-13 14:28:05,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"a=int(input())\ndata=list(map(int,input().split()))\ncount=0\nfor i in range(1,a-1):\n    if data[i-1]>data[i] and data[i+1]>=data[i]:\n        print(i)\n        count+=1\nprint(count)\n",WRONG_ANSWER,20,3184
1591679277337423872,2e4af98c441106efa9ee51f8a781d0eee91a3dff6193987d421eb3a48725c814,2022-11-13 14:28:06,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <iostream>\n\nint fun(int arr[],int reArr[],int n);\nint main(){\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint *arr= new int[n];\n\tfor(int i =0;i<n;i++){\n\t\tscanf(\""%d\"",&arr[i]);\n\t}\n\tint temp[4]; // 0 min 1 min2 2 index 3 index_2\n\tfun(arr,temp,n);\n\tprintf(\""%d %d\"",temp[0],temp[1]);\n}\n\nint fun(int arr[],int reArr[],int n){\n\tint min=99999,min_2=99999;\n\tint index =-1,index_2=-1;\n\tfor(int i=0;i<n;++i){\n//\t\tt1=arr[i]<t2?arr[i]<t1?reArr[0]=i,t1:reArr[1]=i,t2=arr[i]:t1;\n\t\tif(arr[i]<min){\n\t\t\tmin_2=min;\n\t\t\tindex_2=index;\n\t\t\tmin =arr[i];\n\t\t\tindex=i;\n\t\t}else if(arr[i]<min_2){\n\t\t\tmin_2=arr[i];\n\t\t\tindex_2=i;\n\t\t}\n\t}\n\treArr[0]=min;\n\treArr[1]=min_2;\n\treArr[2]=index;\n\treArr[3]=index_2;\n}",WRONG_ANSWER,5,484
1591679322447175680,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-13 14:28:17,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,def clean(num):\n    for i in range(len(num)-1):\n        if num[i]!=num[i+1]:\n            num.pop(i)\n            num.pop(i)\n            return clean(num)\n    else:\n         return num\nn=int(input())\nb=input()\na=list(b)\nprint(n-len(clean(a)))\n,NON_ZERO_EXIT_CODE,124,4884
1591679323613224960,73af9d5098be5d450fba728363c8fdbe0f6a5526466daa2f3b74abf1acf75527,2022-11-13 14:28:17,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int n,a,b;\n    int i=0;\n    int c[10000],F[10000];\n    int sum=0;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&c[i]);\n\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&F[i]);\n\n    }\n    \n    for(i=0;i<n;i++)\n    {\n\n        sum=sum+(c[i]/(F[i]+1))*(pow(a,F[i]+1 )-pow(b,F[i]+1 ));\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,11,356
1591679417137770496,17759f531671f838bf3fae4270190e93b6109026f9503f986c1ed85bb412007d,2022-11-13 14:28:39,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int i,n,a,b,c[30000]={0},F[30000]={0},sum,sum1=0,sum2=0;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&F[i]);\n    for(i=0;i<n;i++)\n    {\n        sum1=sum1+(c[i]/(F[i]+1))*(pow(a,(F[i]+1)));\n        sum2=sum2+(c[i]/(F[i]+1))*(pow(b,(F[i]+1)));\n    }\n    sum=sum1-sum2;\n    printf(\""%d\"",sum);\n}",WRONG_ANSWER,5,620
1591679417548857344,25b8e249c556de062ec0d61286db67304f907bc70204e22083d75434403578b1,2022-11-13 14:28:39,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    int h[n];\n    int i,j;\n    int flag=1;\n    int k[2*n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&h[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        flag=0;\n        for(j=0;j<n;j++)\n        {\n            if(h[i]<=h[j])\n                flag++;\n            else continue;\n        }\n        k[i]=flag*h[i];\n    }\n    int max=k[0];\n    for(i=1;i<n;i++)\n        if(max<k[i])\n        max=k[i];\n    printf(\""%d\"",max);\n    return 0;\n}\n",WRONG_ANSWER,6,200
1591679430601498624,d4c94290401b65ee2ce02056ca325b624120f06a8f67557b729453a418b199fe,2022-11-13 14:28:42,C++,300.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\n\nint n,count1=0;\nstring str;\nint main(){\n\tcin>>n;\n\tcin>>str;\n\tint len=str.size();\n\tfor(int i=0;i<len;i++)\n\t{\n\t\tif(str[i]=='0') count1++;\n\t}\n\tcout<<min(2*count1,(n-count1)*2);\n\t\treturn 0;\n} ",ACCEPTED,31,640
1591679436196700160,2bc6a85c0376656012a7970a7842a2a9d8769555a79ef4eec85ff45aa30ff7b7,2022-11-13 14:28:44,Java,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"import java.util.Scanner;\nimport java.util.regex.Matcher;\nimport java.util.regex.Pattern;\n\npublic class Main {\n    public static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tsc.nextLine();\n\t\tString s = sc.nextLine();\n\t\tint n = 0;\n\t\tPattern p = Pattern.compile(\""01|10\"");\n\t\tMatcher m = p.matcher(s);\n\t\twhile(true) {\n\t\t\tString ss = m.replaceFirst(\""\"");\n\t\t\tif(ss.equals(s)) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\ts = ss;\n\t\t\tm = p.matcher(s);\n\t\t\tn=n+2;\n\t\t}\n\t\tSystem.out.println(n);\n\t}\n}",MEMORY_LIMIT_EXCEEDED,741,65536
1591679464868950016,62c83306b4f5c482e4e9a52dc69ae0b8ee7b5238abb34e56352843a0d484ff2c,2022-11-13 14:28:51,Python,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"a,b,c =int(input(''.format(a,b,c)))\nif a <= b <= c:\n    print(b+c)\nelif b <= a <= c:\n    print(a+c)\nelse:\n    print(a+b)",NON_ZERO_EXIT_CODE,17,2908
1591679465582026752,ccc42b8437aa15d1214e4623799ed35cd8ea8087c26cb1b596d51ae4556ea39c,2022-11-13 14:28:51,Python,0.0,1591610585635213315,1591129345182261248,1049226928954454016,a=eval(input())\nb=input().split()\ndeifen=0\nxiaohao=0\ni=-1\nwhile i<a-1:\n    if i+3<=a:\n        if int(b[i+1])<=int(b[i+3]):\n            deifen+=int(b[i+3])\n            xiaohao+=5\n            i+=3\n        else:\n            deifen+=int(b[i+1])\n            xiaohao+=5\n            i+=1\n    else:\n        deifen+=int(b[i+1])\n        xiaohao+=5\n        i+=1\nprint(deifen-xiaohao),NON_ZERO_EXIT_CODE,23,2892
1591679497051844608,d830b0bcae7881ad6d1b2e2b14f3ffa3695b6d3bd622856493fa1cf903c9bf4e,2022-11-13 14:28:58,Java,0.0,1591610585635213312,1589816514637750272,1049226928954454016,import java.util.Scanner;\nimport java.util.Stack;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc=new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tString s = sc.next();\n\t\tchar[] ss= s.toCharArray();\n\t\tStack<Integer> stack = new Stack<Integer>();\n\t\tint count = 0;\n\t\tfor(int i =0;i<ss.length;i++){\n\t\t\tif(stack.isEmpty()){\n\t\t\t\tstack.push((int)ss[i]);\n\t\t\t}\n\t\t\tif(!stack.peek().equals((int)ss[i])){\n\t\t\t\tstack.pop();\n\t\t\t\tcount+=2;\n\t\t\t}\n\t\t\telse{\n\t\t\t\tstack.push((int)ss[i]);\n\t\t\t}\n\t\t}\n\t\tSystem.out.print(count);\n\t\n\t}\n\n}\n,WRONG_ANSWER,102,24648
1591679510318473216,5d7d397496e2400ea10e8ecafd4566e19d1083215d66cad8e11230c22227362c,2022-11-13 14:29:01,C++,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <bits/stdc++.h>\n\nusing namespace std;\nint l[5],ma,sum;\nint main()\n{\n    sum=0;\n    ma=-1;\n    for(int i=0;i<3;i++){\n        scanf(\""%d\"",&l[i]);\n        sum+=l[i];\n        ma=max(l[i],ma);\n    }\n    printf(\""%d\"",sum-ma);\n    return 0;\n}\n",ACCEPTED,34,480
1591679542585208832,129ddfe9d2d4553f365faf2fdc5e2f0c271b2e342a4cff13802dda8ef8b3d1c2,2022-11-13 14:29:09,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b,c;\n    int min = 0;\n    scanf(\""%d\"",&a);\n    scanf(\""%d\"",&b);\n    scanf(\""%d\"",&c);\n    min = a+b;\n    if(a+c <= min){\n        min = a+c;\n    }\n    if(b+c <= min){\n        min = b+c;\n    }\n    printf(\""%d\\n\"",min);\n    return 0;\n}\n",ACCEPTED,30,360
1591679544791412736,9d0546dac18a9dc678295254e547925db086add5f872ef42d8015d525afeaf65,2022-11-13 14:29:10,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 10000\nint main()\n{\n    int num[N],i,j,n,temp;\n    int k=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&num[i]);\n    }\n    for(i=1;i<n-1;i++){\n        if(num[i]<num[i-1]&&num[i]<=num[i+1]){\n            k=k+1;\n        }\n    }\n    printf(\""%d\\n\"",k);\n}\n",ACCEPTED,39,324
1591679582041071616,d830b0bcae7881ad6d1b2e2b14f3ffa3695b6d3bd622856493fa1cf903c9bf4e,2022-11-13 14:29:18,Java,300.0,1591610585635213312,1589816514637750272,1049226928954454016,import java.util.Scanner;\nimport java.util.Stack;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc=new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tString s = sc.next();\n\t\tchar[] ss= s.toCharArray();\n\t\tStack<Integer> stack = new Stack<Integer>();\n\t\tint count = 0;\n\t\tfor(int i =0;i<ss.length;i++){\n\t\t\tif(stack.isEmpty()){\n\t\t\t\tstack.push((int)ss[i]);\n\t\t\t}\n\t\t\telse if(!stack.peek().equals((int)ss[i])){\n\t\t\t\tstack.pop();\n\t\t\t\tcount+=2;\n\t\t\t}\n\t\t\telse{\n\t\t\t\tstack.push((int)ss[i]);\n\t\t\t}\n\t\t}\n\t\tSystem.out.print(count);\n\t\n\t}\n\n}\n,ACCEPTED,623,27980
1591679634566295552,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-13 14:29:31,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<iostream>\n#include<math.h>\nusing namespace std;\ntypedef long long int ll;\nclass resolve{\n  public:\n    int resve(int x,int y,int a,int b){\n        return (double)(a/(b+1))*pow(x,b+1)-(double)(a/(b+1))*pow(y,b+1);\n    }\n};\n\n\nint main(){\n    int i,n,a[1000],b[1000],x,y;\n    double resv;\n    cin>>n>>x>>y;\n    if(n==0)\n        cout<<\""0\""<<endl;\n    for(i=0;i<n;i++){\n        cin>>a[i];\n    }\n    for(i=0;i<n;i++){\n        cin>>b[i];\n    }\n    resolve res;\n    for(i=0;i<n;i++){\n        resv += res.resve(x,y,a[i],b[i]);\n    }\n    cout<<resv<<endl;\n    return 0;\n}",WRONG_ANSWER,5,452
1591679655533666304,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-13 14:29:36,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,j,n;\n    int a[100],sum[100];\n    int max=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n        \n    }\n    for(j=0;j<n;j++){\n        int x=0;\n        for(i=0;i<n;i++)\n        {\n            if(a[j]<=a[i])\n                x++;\n            if((a[j]<a[i]))\n                break;\n\n        }\n        sum[j]=x*a[j];\n    }\n    for(j=0;j<n;j++)\n    {\n       \n        if(sum[j]>=max)\n        {\n            max=sum[j];\n            \n         }   \n    }\n    printf(\""%d\"",max);\n    return 0;\n}",WRONG_ANSWER,5,488
1591679728741048320,d830b0bcae7881ad6d1b2e2b14f3ffa3695b6d3bd622856493fa1cf903c9bf4e,2022-11-13 14:29:53,Java,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint a= sc.nextInt();\n\t\tint b =sc.nextInt();\n\t\tint[] arr1 = new int[n];\n\t\tint[] arr2 = new int[n];\n\t\tfor(int i=0;i<arr1.length;i++){\n\t\t\t\tarr1[i]=sc.nextInt();\n\t\t\t\n\t\t}\n\t\tfor(int i=0;i<arr2.length;i++){\n\t\t\tarr2[i]=sc.nextInt();\n\t\t\n\t\t}\n\t\tint res1=0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tres1+= arr1[i]/(arr2[i]+1)*(Math.pow(a, arr2[i]+1));\n\t\t}\n\t\tint res2=0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tres2+= arr1[i]/(arr2[i]+1)*(Math.pow(b, arr2[i]+1));\n\t\t}\n\t\tint res=res1-res2;\n\t\tSystem.out.print(res);\n\t}\n}",WRONG_ANSWER,108,25116
1591679741034553344,6a4a105e99255cc39ebb6a122c9fdf740e574dbb708100363b339265f92e1bbf,2022-11-13 14:29:56,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include <stdlib.h>\nint main(){\n    int n,i,x;\n    scanf(\""%d\\n\"",&n);\n    int s[n];\n    for(i=1;i<=n;i++){\n        scanf(\""%d\"",&s[i]);\n        }\n    }\n    for(i=0;i<=n;i++){\n        for(x=0;x<=i;){\n            if(s[i]!=s[i+1]){\n                s[i]=s[i+2];\n                x++;\n            }\n            else\n                return 0;\n    }\n    printf(\""%d\"",x);\n}\n",COMPILE_ERROR,0,0
1591679773758468096,acf80eea856463058b81f71c0238069795893092293fbd098cc594959df6444e,2022-11-13 14:30:04,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,n=int(input())\ns=str(input())\na=[]\nsam=0\ndel_str =0\nfor i in s:\n    if len(a)==0:\n        a.append(i)\n    else:\n        if i == del_str:\n            continue\n        elif i==a[-1]:\n            del_str = a.pop(-1)\n            sam=sam+2\n        else:\n            a.append(i)\nprint(sam)\n\n\n,WRONG_ANSWER,18,3032
1591679786316226560,acf80eea856463058b81f71c0238069795893092293fbd098cc594959df6444e,2022-11-13 14:30:07,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,n=int(input())\ns=str(input())\na=[]\nsam=0\ndel_str =0\nfor i in s:\n    if len(a)==0:\n        a.append(i)\n    else:\n        if i == del_str:\n            continue\n        elif i==a[-1]:\n            del_str = a.pop(-1)\n            sam=sam+2\n        else:\n            a.append(i)\nprint(sam)\n\n\n,WRONG_ANSWER,16,2772
1591679838224932864,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-13 14:30:20,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,def clean(num):\n    for i in range(len(num)-1):\n        if num[i]!=num[i+1]:\n            num.pop(i)\n            num.pop(i)\n            return clean(num)\n    else:\n         return num\nn=int(input())\nb=input()\na=list(b)\nprint(n-len(clean(a))),NON_ZERO_EXIT_CODE,133,4820
1591679857896251392,d830b0bcae7881ad6d1b2e2b14f3ffa3695b6d3bd622856493fa1cf903c9bf4e,2022-11-13 14:30:24,Java,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint a= sc.nextInt();\n\t\tint b =sc.nextInt();\n\t\tint[] arr1 = new int[n];\n\t\tint[] arr2 = new int[n];\n\t\tfor(int i=0;i<arr1.length;i++){\n\t\t\t\tarr1[i]=sc.nextInt();\n\t\t\t\n\t\t}\n\t\tfor(int i=0;i<arr2.length;i++){\n\t\t\tarr2[i]=sc.nextInt();\n\t\t\n\t\t}\n\t\tint res1=0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tres1+=arr1[i]/(arr2[i]+1)*(Math.pow(a,arr2[i]+1));\n\t\t}\n\t\tint res2=0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tres2+=arr1[i]/(arr2[i]+1)*(Math.pow(b,arr2[i]+1));\n\t\t}\n\t\tint res=res1-res2;\n\t\tSystem.out.print(res);\n\t}\n}",WRONG_ANSWER,111,24772
1591679864892317696,c5cc6f9845df4bd1986af86c0696296436bbc0f00a10a9f891b4100e57bc3a19,2022-11-13 14:30:26,C++,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <bits/stdc++.h>\n#define N 10005\nusing namespace std;\nint a[N];\nint f(int x)\n{\n\tif(x==0) return 0;\n\tif(x<3) return f(x-1)+a[x]-5;\n\telse return max(f(x-1)+a[x]-5 , f(x-3)+a[x]-5);\n}\nint main()\n{\n\tint n;\n\tcin>>n;\n\tfor(int i=1;i<=n;i++) cin>>a[i];\n\tprintf(\""%d\"",f(n));\n}",TIME_LIMIT_EXCEEDED,400,584
1591679869170495488,675867a135da6702ed27c0eec3e4b6d2a7d95c44854c01823fc152f0689f010d,2022-11-13 14:30:27,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#define MAX 10000\nint main(void)\n{\n\tint n, a[MAX]={0};\n\tint i;\n\tint max1, max2, temp;\n\tmax1=max2=0;\n\ttemp=0;\n\tscanf(\""%d\"",&n);\n\tfor(i=1;i<=n;i++)\n\t\tscanf(\""%d\"",&a[i]);\n\t\n\t\t\tfor(i=0;i<=n;i++)\n\t\t\t{\n\t\t\t\ttemp+=a[i]-5;\n\t\t\t\tif(temp<0)\n\t\t\t\t\ttemp=0;\n\t\t\t\t\tmax1=temp;\n\t\t\t}\n\t\t\t\n\t\t\ttemp=0;\n\t\t\tfor(i=0;i<=n;i+=3)\n\t\t\t{\n\t\t\t\ttemp+=a[i]-5;\n\t\t\t\tif(temp<0)\n\t\t\t\t\ttemp=0;\n\t\t\t\t\tmax2=temp;\n\t\t\t}\n\t\n\tif(max1>max2)\n\t\tprintf(\""%d\\n\"",max1);\n\telse\n\t\tprintf(\""%d\\n\"",max2);\n\t\t\n\treturn 0;\n}",WRONG_ANSWER,10,488
1591679929006448640,a5291eb67188c2a916aa5dd9fc38f2e449aa9f9a3cd047f282d8c154ea2979cd,2022-11-13 14:30:41,C++,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <iostream>\n\nusing namespace std;\n\nconst int N = 1e6 + 10;\nint dp[N];\nint arr[N];\n\nint Max(int a,int b)\n{\n    return a > b ? a : b;\n}\n\nint main()\n{\n    int n = 0;\n    cin >> n;\n    for(int i = 1;i <= n;i++)\n    {\n        cin >> arr[i];\n        arr[i] = arr[i] - 5;\n    }\n    dp[1] = arr[1] - 5;\n    dp[3] = arr[3] - 5;\n    for(int i = 2;i <= n;i++)\n    {\n        if(i - 3 < 0 && i != 3)\n        {\n            dp[i] = dp[i - 1] + arr[i];\n        }\n        else\n        {\n            dp[i] = Max(dp[i - 1], dp[i - 3]) + arr[i];\n        }\n    }\n    \n    int max = 0;\n    for(int i = 1;i <= n;i++)\n    {\n        if(dp[i] > max)\n        {\n            max = dp[i];\n        }\n    }\n    \n    cout << max << endl;\n    \n}",WRONG_ANSWER,9,584
1591679981607215104,423e1acd0d02cf3d43f3c7805099dea4edcb39c2e0fa385e82823b5a7c0dd214,2022-11-13 14:30:54,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int c[10000];\n    int f[10000];\n    int n,a,b;\n    scanf(\""%d\"",&n);\n    scanf(\""%d\"",&a);\n    scanf(\""%d\"",&b);\n    int i;\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&c[i]);\n    }\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&f[i]);\n    }\n    int e=0;\n    int g=0;\n    int d=0;\n    int h;\n    for(i=0;i<n;i++){\n            h=pow(a,f[i]+1);\n        e=c[i]/(f[i]+1)*h+g;\n        g=e;\n    }\n    for(i=0;i<n;i++){\n        h=pow(b,f[i]+1);\n        e=c[i]*h/(f[i]+1)+d;\n        d=e;\n    }\n    printf(\""%d\\n\"",g-d);\n    return 0;\n}\n",WRONG_ANSWER,5,324
1591679989760974848,7222c2fb91a71fcf3f6560860557ab564f69a453594c9f1620ecc35bb26f5daf,2022-11-13 14:30:56,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\nint main(){\n    \n    int n,i,j,k;\n    int max=0,sum=0,num;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n    {\n       scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {sum=0;\n        for(j=i;j<n;j++)\n        {\n            if(a[j+1]>=a[i])\n            {}\n            else \n            {\n                for(k=i;k<=j;k++)\n                {\n                    if(a[k]>=a[i])\n                        sum++;\n                }\n              num=sum*a[i];\n                \n             if(num>=max)\n             {\n                 max=num;\n             }\n                break;\n            }\n        \n    }\n    }\n    printf(\""%d\"",max);\n}",WRONG_ANSWER,8,324
1591680011177058304,7ecf54bf0ea2db8ab0397aa941f19ec79a351bc3e86e8c01673aa09a69b3a6db,2022-11-13 14:31:01,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n\tint n,l,max;\n\tscanf(\""%d\"",&n);\n\tint s[n];\n\t//录入\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&s[i]);\n\t}\n    max=s[0];\n\t//找最大矩形\n\tfor(int j=0;j<n;j++)\n\t{\n\t\tl = 1;\n\t\tfor(int k=j;k<n-1;k++)\n\t\t{\n            if(s[j]>s[k+1])break;\n\t\t\tl++;\n\t\t}\n\t\t//printf(\""%d %d\\n\"",s[j],l);\n\t\tif(max<=s[j]*l)max=s[j]*l;\n\t}\n\t//打印结果\n    if(s[0]==10^6 && n==10^4)\n    {\n        printf(\""10000000000\"");\n    }\n    else\n    {\n\t    printf(\""%d\\n\"",max);        \n    }\n\n}\n\n",WRONG_ANSWER,4,200
1591680023403454464,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-13 14:31:04,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,j,k=-1,sum=0;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(j=0;j<n;j++)\n    {\n        a[j]=a[j]-5;\n    }\n   while(k<n)\n    {\n        if(k==n-1)\n        {\n            break;\n        }\n        if(k+3<=n-1)\n        {\n        if(a[k+1]>a[k+3])\n        {\n            sum+=a[k+1];\n            k=k+1;\n            continue;\n        }\n        else  if(a[k+3]>a[k+1])\n        {\n            sum+=a[k+3];\n            k=k+3;\n            continue;\n        }\n        }\n        else{\n            sum+=a[k+1];\n            k=k+1;\n            if(k)\n            continue;\n        }\n    }\n    if(n==1)\n        printf(\""%d\"",a[0]);\n    else\n        printf(\""%d\"",sum);\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,400,208
1591680034442850304,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-13 14:31:06,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n    int P,Q,R,a,b,c;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    a=P+Q;\n    b=Q+R;\n    c=P+R;\n    if(a<b)\n        printf(\""%d\"",a);\n    else if(b<c)\n        printf(\""%d\"",b);\n    else\n        printf(\""%d\"",c);\n    return 0;\n}\n",ACCEPTED,27,476
1591680062909591552,7e6a67f270e740aba8788a12d9a49939621a28d5059d3ced2247a86914b0a3b3,2022-11-13 14:31:13,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\tint n,a,b;\n\tint i;\n\tscanf(\""%d %d %d\"",&n,&a,&b);\n\t\n\tint C[n];\n\t\n\tfor(i=0;i<n;i++)\n\t\tscanf(\""%d\"",&C[i]);\n\t\t\n\tint F[n];\n\t\n\tfor(i=0;i<n;i++)\n\t\tscanf(\""%d\"",&F[i]);\n\t\n\tint sum1=0;\n\tfor(i=0;i<n;i++)\n\t{\n\t\tsum1+=(C[i]/(F[i]+1)*pow(a,F[i]+1));\n\t}\n\t\n\tint sum2=0;\n\tfor(i=0;i<n;i++)\n\t{\n\t\tsum2+=(C[i]/(F[i]+1)*pow(b,F[i]+1));\n\t}\n\t\n\tint sum;\n\tsum=sum1-sum2;\n\tprintf(\""%d\"",sum);\n}",WRONG_ANSWER,8,196
1591680155289182208,458af3c005e0b282d1ca88c254d9910ee2d93738b6f06d399f7444e1e64831eb,2022-11-13 14:31:35,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,q,i,c;\n    q=c=0;\n    scanf(\""%d\"",&a);\n    int b[100000];\n    for(i=1;i<=a;i++){\n        scanf(\""%d\"",&b[i]);\n    }\n    if(a==3){\n                if(b[1]>=5) q=q+b[1]+b[2]+b[3]-15;\n                else q=q+b[3]-5;\n            }\n            if(a==2) q=q+b[1]+b[2]-10;\n            if(a==1) q=q+b[1]-5;\n    for(i=0;i<=a;i++){\n            b[0]=0;\n            if(a>3) {\n            if(a-i>=3){\n                if(b[i+1]>=5){\n                q=q+b[i+1]-5;\n            }\n            if(b[i]<5){\n                    c++;\n                    if(c==3){\n                    q=q+b[i+3]-5;\n                    c=0;}\n            }\n            }\n            else\n            {\n                q=q+b[i+1]-5;\n            }\n            }\n\n    }\n\n    printf(\""%d\"",q);\n    return 0;\n}\n\n",WRONG_ANSWER,13,460
1591680161089859584,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-13 14:31:37,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n\tint n,a,b,i;\n\tscanf(\""%d\"",&n);\n\tscanf(\""%d\"",&a);\n\tscanf(\""%d\"",&b);\n\tint c[n],f[n];\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&c[i]);\n\t}\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&f[i]);\n\t}\n\tint a1,a2;\n\tint sum=0;\n\ta1=0;\n\ta2=0;\n\tfor(i=0;i<n;i++)\n\t{\n\t\ta1=c[i]/(f[i]+1)*pow(a,(f[i]+1));\n\t\ta2=c[i]/(f[i]+1)*pow(b,(f[i]+1));\n\t\tsum+=a1-a2;\n\t}\n\tprintf(\""%d\\n\"",sum);\n\t\n}",WRONG_ANSWER,7,348
1591680254153121792,27fbb32d960dbf49665c8905b68012d602eda68987686c6f224ec7b49ca3d0ac,2022-11-13 14:31:59,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint n,i,flog=0;\n\tscanf(\""%d\"",&n);\n\tint a[n],b[n];\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=0;i<n;i++)\n\t{\n\t\tfor(int j=i;j<n;j++)\n\t\t{\n\t\t\tif(a[i]<=a[j])\n\t\t\t{\n\t\t\t\tflog++;\n\t\t\t}\n\t\t\telse\n\t\t\tbreak;\n\t\t}\n\t\tb[i]=a[i]*flog;\n\t\tflog=0;\n\t}\n\tint max=b[0];\n\tfor(i=1;i<n;i++)\n\t{\n\t\tif(max<b[i])\n\t\tmax=b[i];\n\t}\n\tprintf(\""%d\"",max);\n\treturn 0;\n} ",WRONG_ANSWER,38,480
1591680292329676800,7222c2fb91a71fcf3f6560860557ab564f69a453594c9f1620ecc35bb26f5daf,2022-11-13 14:32:08,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\nint main(){\n    \n    int n,i,j,k;\n    int max=0,sum=0,num;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n    {\n       scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {sum=0;\n        for(j=i;j<n;j++)\n        {\n            if(a[j+1]>=a[i])\n            {}\n            else \n            {\n                for(k=i;k<=j;k++)\n                {\n                    if(a[k]>=a[i])\n                        sum++;\n                }\n              num=sum*a[i];\n                \n             if(num>=max)\n             {\n                 max=num;\n             }\n                break;\n            }\n        \n    }\n    }\n    printf(\""%d\\n\"",max);\n}",WRONG_ANSWER,18,388
1591680314081292288,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-13 14:32:13,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,def clean(num):\n    for i in range(len(num)-1):\n        if num[i]!=num[i+1]:\n            num.pop(i)\n            num.pop(i)\n            return clean(num)\n    else:\n         return len(num)\n\nn=int(input())\nb=input()\na=list(b)\nprint(n-clean(a))\n,NON_ZERO_EXIT_CODE,132,4948
1591680348285853696,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-13 14:32:21,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,j,k=-1,sum=0;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(j=0;j<n;j++)\n    {\n        a[j]=a[j]-5;\n    }\n   while(k!=n-1)\n    {\n        if(k+3<=n-1)\n        {\n        if(a[k+1]>a[k+3])\n        {\n            sum+=a[k+1];\n            k=k+1;\n            continue;\n        }\n        else  if(a[k+3]>a[k+1])\n        {\n            sum+=a[k+3];\n            k=k+3;\n            continue;\n        }\n        }\n        else{\n            sum+=a[k+1];\n            k=k+1;\n            if(k)\n            continue;\n        }\n    }\n    if(n==1)\n        printf(\""%d\"",a[0]);\n    else\n        printf(\""%d\"",sum);\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,400,196
1591680355428753408,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-13 14:32:23,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,def clean(num):\n    for i in range(len(num)-1):\n        if num[i]!=num[i+1]:\n            num.pop(i)\n            num.pop(i)\n            return clean(num)\n    else:\n         return len(num)\nn=int(input())\nb=input()\na=list(b)\nprint(n-clean(a)),NON_ZERO_EXIT_CODE,118,4872
1591680363586707456,27fbb32d960dbf49665c8905b68012d602eda68987686c6f224ec7b49ca3d0ac,2022-11-13 14:32:25,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint n,i,flog=0;\n\tscanf(\""%d\"",&n);\n\tint a[n],b[n];\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=0;i<n;i++)\n\t{\n\t\tfor(int j=i;j<n;j++)\n\t\t{\n\t\t\tif(a[i]<=a[j])\n\t\t\t{\n\t\t\t\tflog++;\n\t\t\t}\n\t\t\telse\n\t\t\tbreak;\n\t\t}\n\t\tb[i]=a[i]*flog;\n\t\tflog=0;\n\t}\n\tint max=b[0];\n\tfor(i=1;i<n;i++)\n\t{\n\t\tif(max<b[i])\n\t\tmax=b[i];\n\t}\n\tprintf(\""%d\\n\"",max);\n\treturn 0;\n} ",WRONG_ANSWER,24,512
1591680380225478656,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-13 14:32:29,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n\tint n,a,b,i;\n\tscanf(\""%d %d %d\"",&n,&a,&b);\n\tint c[n],f[n];\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&c[i]);\n\t}\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&f[i]);\n\t}\n\tint a1,a2;\n\tint sum=0;\n\ta1=0;\n\ta2=0;\n\tfor(i=0;i<n;i++)\n\t{\n\t\ta1=c[i]/(f[i]+1)*pow(a,(f[i]+1));\n\t\ta2=c[i]/(f[i]+1)*pow(b,(f[i]+1));\n\t\tsum+=a1-a2;\n\t}\n\tprintf(\""%d\\n\"",sum);\n\t\n}",WRONG_ANSWER,7,348
1591680441483288576,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-13 14:32:43,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main(){\n    int n,a[1000],count=0,i,j,t=0,c=0;\n      scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n        \n        \n    \n    for( j=1;j<n-1;j++)\n    {\n        \n        if(a[j]<a[j-1]&&a[j]<a[j+1])\n        { count++;   }\n             \n       else{\n        if(a[j]==a[j+1])\n        { c++;\n            continue;\n        }\n        \n        if(a[j]<a[j+1]&&a[j]<a[j-c-1]) {count+=1;t=0;c=0;}\n      }\n        \n            \n    }\n    \n    \n /*  if(count!=0)\n      printf(\""%d\"",count);\n   else \n     printf(\""0\"");*/\n    \n    printf(\""%d\\n\"",count);\n          \n}",WRONG_ANSWER,23,384
1591680474488266752,25b8e249c556de062ec0d61286db67304f907bc70204e22083d75434403578b1,2022-11-13 14:32:51,C,300.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    int h[n];\n    int i,j;\n    int flag=1;\n    int k[2*n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&h[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        flag=0;\n        for(j=0;j<n;j++)\n        {\n            if(h[i]<=h[j])\n                flag++;\n            else break;\n        }\n        k[i]=flag*h[i];\n    }\n    int max=k[0];\n    for(i=1;i<n;i++)\n        if(max<k[i])\n        max=k[i];\n    printf(\""%d\"",max);\n    return 0;\n}\n",ACCEPTED,51,476
1591680486270099456,7222c2fb91a71fcf3f6560860557ab564f69a453594c9f1620ecc35bb26f5daf,2022-11-13 14:32:54,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\nint main(){\n    \n    int n,i,j,k;\n    int max=0,sum=0,num;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n    {\n       scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {sum=0;\n        for(j=i;j<n;j++)\n        {\n            if(a[j+1]>=a[i])\n            {}\n            else \n            {\n                for(k=i;k<=j;k++)\n                {\n                    if(a[k]>=a[i])\n                        sum++;\n                }\n              num=sum*a[i];\n                \n             if(num>=max)\n             {\n                 max=num;\n             }\n                break;\n            }\n        \n    }\n    }\n    printf(\""%d\\n\"",max);\n}",WRONG_ANSWER,14,328
1591680490770542592,9e0ba8d857885aa94eaa182d3a194e51593598b2d7817b16af4b1b57e49e10de,2022-11-13 14:32:55,Java,0.0,1591610585639407617,1591132482555211776,1049226928954454016,package hxk;\n\nimport java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint a = scanner.nextInt();\n\t\tint[] b = new int[a];\n\n\t\tfor(int i = 0;i<b.length; i++) {\n\t\t\tb[i] = scanner.nextInt();\n\t\t}\n\t\tArrays.sort(b);\n\t\t\n\t\tint c = -1;\n\t\tint max = 0;\n\t\tint newmax = 0;\n\t\tfor(int i = 0;i < b.length; i++) {\n\t\t\tif(b[i] != c) {\n\t\t\t\tc = b[i];\n\t\t\t}\n\t\t\t\n\t\t\tfor(int j = i; j < b.length; j++ ) {\n\t\t\t\tnewmax = c * (b.length - i);\n\t\t\t\tif (newmax > max) {\n\t\t\t\t\tmax = newmax;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.print(max);\n\t}\n},NON_ZERO_EXIT_CODE,95,23076
1591680527311364096,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-13 14:33:04,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,j,count=0;\n    int hi[n];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n    scanf(\""%d\"",&hi[n]);}\n    for(j=1;j<n-1;j++){\n    if(hi[j+1]<hi[j])\n        count++;\n   }\n    printf(\""%d\"",count);\n    return 0;\n}\n",WRONG_ANSWER,10,360
1591680541383254016,9e0ba8d857885aa94eaa182d3a194e51593598b2d7817b16af4b1b57e49e10de,2022-11-13 14:33:07,Java,0.0,1591610585639407617,1591132482555211776,1049226928954454016,\n\nimport java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint a = scanner.nextInt();\n\t\tint[] b = new int[a];\n\n\t\tfor(int i = 0;i<b.length; i++) {\n\t\t\tb[i] = scanner.nextInt();\n\t\t}\n\t\tArrays.sort(b);\n\t\t\n\t\tint c = -1;\n\t\tint max = 0;\n\t\tint newmax = 0;\n\t\tfor(int i = 0;i < b.length; i++) {\n\t\t\tif(b[i] != c) {\n\t\t\t\tc = b[i];\n\t\t\t}\n\t\t\t\n\t\t\tfor(int j = i; j < b.length; j++ ) {\n\t\t\t\tnewmax = c * (b.length - i);\n\t\t\t\tif (newmax > max) {\n\t\t\t\t\tmax = newmax;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.print(max);\n\t}\n},WRONG_ANSWER,104,24784
1591680558055567360,eeab3421c2b685f7d51b09a289b82fe82ba0d3896984d09aeffb9d022232d887,2022-11-13 14:33:11,Java,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.math.BigDecimal;\nimport java.util.Scanner;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n    public static void main(String[] args) {\n        FastReader fastReader =  new FastReader();\n       int n = fastReader.nextInt();\n       if(n == 0)\n       {\n           System.out.println(0);\n           return ;\n       }\n       long result = 0;\n       long[] f = new long[n];\n       for(int i=0;i<n;i++)\n           f[i] = fastReader.nextLong();\n       for(int i = 0;i<n;i++){\n           int t = 0;\n            for(int j = n-1;j>=i;j--){\n                if(f[j] >= f[i]){\n                    t = j;\n                    break;\n                }\n             }\n       //    System.out.println(\""i\""+i);\n         //  System.out.println(\""t\""+t);\n           //\n           long m = f[i];\n           for(int j = i;j<=t;j++){\n               m =Math.min(f[j],m);\n           }\n            result = Math.max(result,m*(t-i+1));\n      //     System.out.println(\""result\""+result);\n       }\n        System.out.println(result);\n    }\n\n\n    static class FastReader {\n        BufferedReader br;\n        StringTokenizer st;\n        public FastReader()\n        {\n            br = new BufferedReader(\n                    new InputStreamReader(System.in));\n        }\n\n\n        String next()\n        {\n            while (st == null || !st.hasMoreElements()) {\n                try {\n                    st = new StringTokenizer(br.readLine());\n                }\n                catch (IOException e) {\n                    e.printStackTrace();\n                }\n            }\n            return st.nextToken();\n        }\n\n\n\n        int nextInt() { return Integer.parseInt(next()); }\n\n        long nextLong() { return Long.parseLong(next()); }\n\n        double nextDouble(){return Double.parseDouble(next());}\n\n\n        String nextLine()\n        {\n            String str = \""\"";\n\n            try {\n                if (st!= null && st.hasMoreTokens()){\n                    str = st.nextToken(\""\\n\"");\n                } else {\n                    str = br.readLine();\n                }\n            }\n            catch (IOException e) {\n                e.printStackTrace();\n            }\n            return str;\n        }\n\n\n    }\n}\n\n\n\n",WRONG_ANSWER,207,22724
1591680559221583872,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-13 14:33:11,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\nint main(){\n    int gd = -5; // 固定减5\n    int count = 0;\n    int num = 0;\n    int len;\n    int j=0;\n    if(scanf(\""%d\"",&len)){};\n    int arr[len+1];\n    \n        for(int i=0; i<len+1; i++){\n            arr[0]=0;\n            if(scanf(\""%d\"",&arr[i+1])){};\n        }\n        \n        while(j<len){\n            if(len<3){\n                num = arr[j+1]+arr[j+2]+gd+gd;\n                break;\n            }\n            \n            // 给count赋值 单步最大\n            if(arr[j+1]+gd > arr[j+3]+gd){\n                count += arr[j+1]+gd;\n                j=j+1;\n            }else{\n                count += arr[j+3]+gd;\n                j=j+3;\n            }\n            // 总数最\n                num += count;\n            \n        }\n    printf(\""%d\"",num);\n}",WRONG_ANSWER,12,512
1591680587340197888,7ecf54bf0ea2db8ab0397aa941f19ec79a351bc3e86e8c01673aa09a69b3a6db,2022-11-13 14:33:18,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n\tint n,l,max;\n\tscanf(\""%d\"",&n);\n\tint s[n];\n\t//录入\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&s[i]);\n\t}\n    max=s[0];\n\t//找最大矩形\n\tfor(int j=0;j<n;j++)\n\t{\n\t\tl = 1;\n\t\tfor(int k=j;k<n-1;k++)\n\t\t{\n            if(s[j]>s[k+1])break;\n\t\t\tl++;\n\t\t}\n\t\t//printf(\""%d %d\\n\"",s[j],l);\n\t\tif(max<=s[j]*l)max=s[j]*l;\n\t}\n\t//打印结果\n    if(s[0]==1000000 && n==10000)  //防止爆长\n    {\n        printf(\""10000000000\\n\"");\n    }\n    else\n    {\n\t    printf(\""%d\\n\"",max);        \n    }\n\n}\n\n",WRONG_ANSWER,25,512
1591680590523719680,a5291eb67188c2a916aa5dd9fc38f2e449aa9f9a3cd047f282d8c154ea2979cd,2022-11-13 14:33:19,C++,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <iostream>\n\nusing namespace std;\n\nconst int N = 1e6 + 10;\nint dp[N];\nint arr[N];\n\nint Max(int a,int b)\n{\n    return a > b ? a : b;\n}\n\nint main()\n{\n    int n = 0;\n    cin >> n;\n    for(int i = 1;i <= n;i++)\n    {\n        cin >> arr[i];\n        arr[i] = arr[i] - 5;\n    }\n    dp[0] = 0;\n    for(int i = 2;i <= n;i++)\n    {\n        if(i - 3 < 0)\n        {\n            dp[i] = dp[i - 1] + arr[i];\n        }\n        else if(i == 3)\n        {\n            dp[i] = max(dp[i-1] , arr[i]);\n        }\n        else if(i > 3)\n        {\n            dp[i] = Max(dp[i - 1], dp[i - 3]) + arr[i];\n        }\n    }\n    \n    int max = 0;\n    for(int i = 1;i <= n;i++)\n    {\n        if(dp[i] > max)\n        {\n            max = dp[i];\n        }\n    }\n    \n    cout << max << endl;\n    \n}",WRONG_ANSWER,6,452
1591680723009155072,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 14:33:51,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i;\n    int sum=0;\n    int t=0;\n    scanf(\""%d\"",&n);\n        int a[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n-3;i++)\n    {\n        if(a[i+1]>a[i+3])\n        {\n            sum=sum+a[i+1]-5;\n            t=t+1;\n        }\n        else \n        {\n            sum=sum+a[i+3]-5;\n            t=t+3;\n        }\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,5,324
1591680769368842240,bd8243b4b064cae986196b0eac310a36f12d46dc08f126fbdcaaca530c884eb0,2022-11-13 14:34:02,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int P,Q,R;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    if(P+Q>=P+R){\n     if(P+R>=Q+R)\n        printf(\""%d\\n\"",Q+R);\n     else if(P+R<Q+R)\n        printf(\""%d\\n\"",P+R);\n    }\n    else if(P+Q<=P+R){\n     if(P+Q>=Q+R)\n         printf(\""%d\\n\"",Q+R);\n     else if(P+Q<Q+R)\n         printf(\""%d\\n\"",P+Q);\n    }\n    return 0;\n}\n",ACCEPTED,27,352
1591680841678598144,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-13 14:34:19,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int N=10005;\nint a[N];\nint main(){\n\tint n;\n\tint cnt=0;\n    cin>>n;\n    for(int i=1;i<=n;i++)\n    cin>>a[i];\n    for(int i=3;i<n-2;i++){\n    \tif(a[i]<a[i-1]&&a[i]<a[i+1])\n    \tcnt++;\n    \tif(a[i]<a[i-1]&&a[i]==a[i+1]&&a[i+1]<a[i+2])\n    \tcnt++;\n    \tif(a[i]<a[i-1]&&a[i]==a[i+1]&&a[i+1]==a[i+2]&&a[i+2]<a[i+3])\n    \tcnt++;\n    \tif(a[i]<a[i-1]&&a[i]==a[i+1]&&a[i+1]==a[i+2]&&a[i+2]==a[i+3]&&a[i+3]<a[i+4])\n    \tcnt++;\nif(a[i]<a[i-1]&&a[i]==a[i+1]&&a[i+1]==a[i+2]&&a[i+2]==a[i+3]&&a[i+3]==a[i+4]&&a[i+4]<a[i+5])\n    \tcnt++;\nif(a[i]<a[i-1]&&a[i]==a[i+1]&&a[i+1]==a[i+2]&&a[i+2]==a[i+3]&&a[i+3]==a[i+4]&&a[i+4]==a[i+5]&&a[i+5]<a[i+6])\n    \tcnt++;\nif(a[i]<a[i-1]&&a[i]==a[i+1]&&a[i+1]==a[i+2]&&a[i+2]==a[i+3]&&a[i+3]==a[i+4]&&a[i+4]==a[i+5]&&a[i+5]==a[i+6]&&a[i+6]<a[i+7])\n    \tcnt++;\n    }\n    sort(a+1,a+n+1);\n    if(a[3]==a[n-2])\n    cnt++;\n    cout<<cnt;\n\treturn 0;\n} ",WRONG_ANSWER,37,768
1591680864634036224,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 14:34:24,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[n],i,s;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n        for(j=1;j<n;j++)\n    {\n        if(a[i]=a[i+j])\n            s=(n-i)*a[i];\n        }\n    printf(\""%d\"",s);\n    return 0;\n}",COMPILE_ERROR,0,0
1591680896175235072,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-13 14:34:32,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n\tint n,a,b,i;\n\tscanf(\""%d %d %d\"",&n,&a,&b);\n\tint c[n],f[n];\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&c[i]);\n\t}\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&f[i]);\n\t}\n\tint a1,a2;\n\tint sum=0;\n\ta1=0;\n\ta2=0;\n\tfor(i=0;i<n;i++)\n\t{\n\t\ta1=c[i]/(f[i]+1)*pow(a,(f[i]+1));\n\t\ta2=c[i]/(f[i]+1)*pow(b,(f[i]+1));\n\t\tsum+=a1-a2;\n\t}\n\tprintf(\""%d\\n\"",sum);\n\treturn 0;\n}",WRONG_ANSWER,7,356
1591680905390075904,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 14:34:34,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[n],i,s,j;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n        for(j=1;j<n;j++)\n    {\n        if(a[i]=a[i+j])\n            s=(n-i)*a[i];\n        }\n    printf(\""%d\"",s);\n    return 0;\n}",RUNTIME_ERROR,4,200
1591681029814149120,0d24b4ee85e6e3a4cc694f7e11105fa2aaf93fd10d4cbe81657f252e2d675435,2022-11-13 14:35:04,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    int n1,n2,n3;\n    int sum =0;\n    scanf(\""%d %d %d\"",&n1,&n2,&n3);\n    int i,j;\n    int t,t2,t3;\n    t= n1+ n2;\n    t2=n2+n3;\n    t3 =n1+n3;\n    if(t<t2){\n        sum = t;\n    }\n    else if(t< t3)\n        sum = t;\n    else if(t2<t3)\n        sum = t3;\n\n    printf(\""%d\"",sum);\n\n    return 0;\n}\n",WRONG_ANSWER,10,200
1591681043009384448,9e0ba8d857885aa94eaa182d3a194e51593598b2d7817b16af4b1b57e49e10de,2022-11-13 14:35:07,Java,0.0,1591610585639407617,1591132482555211776,1049226928954454016,\nimport java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint a = scanner.nextInt();\n\t\tint[] b = new int[a];\n\n\t\tfor(int i = 0;i<b.length; i++) {\n\t\t\tb[i] = scanner.nextInt();\n\t\t}\n\t\tArrays.sort(b);\n\t\t\n\t\tint c = -1;\n\t\tint max = 0;\n\t\tint newmax = 0;\n\t\tfor(int i = 0;i < b.length; i++) {\n\t\t\tif(b[i] != c) {\n\t\t\t\tc = b[i];\n\t\t\t}\n\t\t\tnewmax = c * (b.length - i);\n\t\t\tif (newmax > max) {\n\t\t\t\tmax = newmax;\n\t\t\t}\n\t\t}\n\t\tSystem.out.print(max);\n\t}\n},WRONG_ANSWER,110,24276
1591681070960226304,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-13 14:35:13,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int N=10005;\nint a[N];\nint main(){\n\tint n;\n\tint cnt=0;\n    cin>>n;\n    for(int i=1;i<=n;i++)\n    cin>>a[i];\n    for(int i=3;i<n-2;i++){\n    \tif(a[i]<a[i-1]&&a[i]<a[i+1])\n    \tcnt++;\n    \tif(a[i]<a[i-1]&&a[i]==a[i+1]&&a[i+1]<a[i+2])\n    \tcnt++;\n    \tif(a[i]<a[i-1]&&a[i]==a[i+1]&&a[i+1]==a[i+2]&&a[i+2]<a[i+3])\n    \tcnt++;\n    \tif(a[i]<a[i-1]&&a[i]==a[i+1]&&a[i+1]==a[i+2]&&a[i+2]==a[i+3]&&a[i+3]<a[i+4])\n    \tcnt++;\nif(a[i]<a[i-1]&&a[i]==a[i+1]&&a[i+1]==a[i+2]&&a[i+2]==a[i+3]&&a[i+3]==a[i+4]&&a[i+4]<a[i+5])\n    \tcnt++;\nif(a[i]<a[i-1]&&a[i]==a[i+1]&&a[i+1]==a[i+2]&&a[i+2]==a[i+3]&&a[i+3]==a[i+4]&&a[i+4]==a[i+5]&&a[i+5]<a[i+6])\n    \tcnt++;\nif(a[i]<a[i-1]&&a[i]==a[i+1]&&a[i+1]==a[i+2]&&a[i+2]==a[i+3]&&a[i+3]==a[i+4]&&a[i+4]==a[i+5]&&a[i+5]==a[i+6]&&a[i+6]<a[i+7])\n    \tcnt++;\nif(a[i]<a[i-1]&&a[i]==a[i+1]&&a[i+1]==a[i+2]&&a[i+2]==a[i+3]&&a[i+3]==a[i+4]&&a[i+4]==a[i+5]&&a[i+5]==a[i+6]&&a[i+6]==a[i+7]&&a[i+7]<a[i+8])\n    \tcnt++;\n    }\n    sort(a+1,a+n+1);\n    if(a[3]==a[n-2])\n    cnt++;\n    cout<<cnt;\n\treturn 0;\n} ",WRONG_ANSWER,39,504
1591681134784995328,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-13 14:35:29,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,j,k=-1,sum=0;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(j=0;j<n;j++)\n    {\n        a[j]=a[j]-5;\n    }\n   while(k!=n-1)\n    {\n        if(k+3<=n-1)\n        {\n        if(a[k+1]>a[k+3])\n        {\n            sum+=a[k+1];\n            k=k+1;\n        }\n        else  if(a[k+3]>a[k+1])\n        {\n            sum+=a[k+3];\n            k=k+3;\n        }\n        }\n        else{\n            sum+=a[k+1];\n            k=k+1;\n        }\n    }\n    if(n==1)\n        printf(\""%d\"",a[0]);\n    else\n        printf(\""%d\"",sum);\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,400,200
1591681154393366528,0d24b4ee85e6e3a4cc694f7e11105fa2aaf93fd10d4cbe81657f252e2d675435,2022-11-13 14:35:33,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    int n1,n2,n3;\n    int sum =0;\n    scanf(\""%d %d %d\"",&n1,&n2,&n3);\n   // int i,j;\n    int t,t2,t3;\n    t= n1+ n2;\n    t2=n2+n3;\n    t3 =n1+n3;\n    if(t<t2){\n        sum = t;\n    }\n    else if(t< t3)\n        sum = t;\n    else if(t2<t3)\n        sum = t3;\n\n    printf(\""%d\"",sum);\n\n    return 0;\n}\n",WRONG_ANSWER,12,320
1591681181677314048,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-13 14:35:40,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,j,n;\n    int a[100],sum[100];\n    int max=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n        \n    }\n    for(j=0;j<n;j++){\n        int x=0;\n        for(i=0;i<n;i++)\n        {\n            if(a[j]<=a[i])\n                x++;\n            if((a[j]>a[i]&&j<i))\n                break;\n\n        }\n        sum[j]=x*a[j];\n    }\n    for(j=0;j<n;j++)\n    {\n       \n        if(sum[j]>=max)\n        {\n            max=sum[j];\n            \n         }   \n    }\n    printf(\""%d\"",max);\n    return 0;\n}",WRONG_ANSWER,4,208
1591681199758958592,7ecf54bf0ea2db8ab0397aa941f19ec79a351bc3e86e8c01673aa09a69b3a6db,2022-11-13 14:35:44,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n\tint n,l,max;\n\tscanf(\""%d\"",&n);\n\tint s[n];\n\t//录入\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&s[i]);\n\t}\n    max=s[0];\n\t//找最大矩形\n\tfor(int j=0;j<n;j++)\n\t{\n\t\tl = 1;\n\t\tfor(int k=j;k<n-1;k++)\n\t\t{\n            if(s[j]>s[k+1])break;\n\t\t\tl++;\n\t\t}\n\t\t//printf(\""%d %d\\n\"",s[j],l);\n\t\tif(max<=s[j]*l)max=s[j]*l;\n\t}\n\t//打印结果\n    if(max >= 99999999)  //防止爆长\n    {\n        printf(\""10000000000\\n\"");\n    }\n    else\n    {\n\t    printf(\""%d\\n\"",max);        \n    }\n\n}\n\n",WRONG_ANSWER,25,324
1591681218893328384,ccc42b8437aa15d1214e4623799ed35cd8ea8087c26cb1b596d51ae4556ea39c,2022-11-13 14:35:49,Python,0.0,1591610585635213315,1591129345182261248,1049226928954454016,a=eval(input())\nb=input().split()\ndeifen=0\nxiaohao=0\ni=-1\nwhile i<a-1:\n    if i+3<a:\n        if int(b[i+1])<=int(b[i+3]):\n            deifen+=int(b[i+3])\n            xiaohao+=5\n            i+=3\n        else:\n            deifen+=int(b[i+1])\n            xiaohao+=5\n            i+=1\n    else:\n        deifen+=int(b[i+1])\n        xiaohao+=5\n        i+=1\nprint(deifen-xiaohao),WRONG_ANSWER,24,3032
1591681271036960768,dcc1017bcd698bd6a0eee54e4ed848d4c51a3a26608990cdd2137e4c01065a1e,2022-11-13 14:36:01,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main (){\n    int p,q,r,min;\n    scanf(\""%d%d%d\"",&p,&q,&r);\n    if(p>q){\n        if(r>p){\n            min=p+q;\n        }\n        else{\n            min=q+r;\n        }\n    }\n    printf(\""%d\\n\"",min);\n    return 0;\n}",WRONG_ANSWER,7,352
1591681285008142336,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-13 14:36:05,C++,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int N=10005;\nint a[N];\nint main(){\n\tint n;\n\tint cnt=0;\n    cin>>n;\n    for(int i=1;i<=n;i++)\n    cin>>a[i];\n    for(int i=3;i<n-2;i++){\n    \tif(a[i]<a[i-1]&&a[i]<a[i+1])\n    \tcnt++;\n    \tif(a[i]<a[i-1]&&a[i]==a[i+1]&&a[i+1]<a[i+2])\n    \tcnt++;\n    \tif(a[i]<a[i-1]&&a[i]==a[i+1]&&a[i+1]==a[i+2]&&a[i+2]<a[i+3])\n    \tcnt++;\n    \tif(a[i]<a[i-1]&&a[i]==a[i+1]&&a[i+1]==a[i+2]&&a[i+2]==a[i+3]&&a[i+3]<a[i+4])\n    \tcnt++;\nif(a[i]<a[i-1]&&a[i]==a[i+1]&&a[i+1]==a[i+2]&&a[i+2]==a[i+3]&&a[i+3]==a[i+4]&&a[i+4]<a[i+5])\n    \tcnt++;\nif(a[i]<a[i-1]&&a[i]==a[i+1]&&a[i+1]==a[i+2]&&a[i+2]==a[i+3]&&a[i+3]==a[i+4]&&a[i+4]==a[i+5]&&a[i+5]<a[i+6])\n    \tcnt++;\nif(a[i]<a[i-1]&&a[i]==a[i+1]&&a[i+1]==a[i+2]&&a[i+2]==a[i+3]&&a[i+3]==a[i+4]&&a[i+4]==a[i+5]&&a[i+5]==a[i+6]&&a[i+6]<a[i+7])\n    \tcnt++;\nif(a[i]<a[i-1]&&a[i]==a[i+1]&&a[i+1]==a[i+2]&&a[i+2]==a[i+3]&&a[i+3]==a[i+4]&&a[i+4]==a[i+5]&&a[i+5]==a[i+6]&&a[i+6]==a[i+7]&&a[i+7]<a[i+8])\n    \tcnt++;\nif(a[i]<a[i-1]&&a[i]==a[i+1]&&a[i+1]==a[i+2]&&a[i+2]==a[i+3]&&a[i+3]==a[i+4]&&a[i+4]==a[i+5]&&a[i+5]==a[i+6]&&a[i+6]==a[i+7]&&a[i+7]==a[i+8]&&a[i+8]<a[i+9])\n    \tcnt++;\n    }\n    sort(a+1,a+n+1);\n    if(a[3]==a[n-2])\n    cnt++;\n    cout<<cnt;\n\treturn 0;\n} ",ACCEPTED,26,768
1591681293916889088,899c5501179552dc1fe5639f9047e15d0f835e7a87c8568193377882d0278985,2022-11-13 14:36:07,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<string.h>\nint main()\n{\n    int n,i,count=0;\n    scanf(\""%d\"",&n);\n    char s[80];\n    for(i=0;i<n;i++)\n        scanf(\""%c\"",&s[i]);\n    for(i=0;i<n;i++)\n    {\n        if(s[i]==s[i+1])\n            count+=4;\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",WRONG_ANSWER,6,324
1591681316197031936,a5291eb67188c2a916aa5dd9fc38f2e449aa9f9a3cd047f282d8c154ea2979cd,2022-11-13 14:36:12,C++,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <iostream>\n\nusing namespace std;\n\nconst int N = 1e6 + 10;\nint dp[N];\nint arr[N];\n\nint Max(int a,int b)\n{\n    return a > b ? a : b;\n}\n\nint main()\n{\n    int n = 0;\n    cin >> n;\n    for(int i = 1;i <= n;i++)\n    {\n        cin >> arr[i];\n        arr[i] = arr[i] - 5;\n    }\n    dp[0] = 0;\n    for(int i = 2;i <= n;i++)\n    {\n        if(i - 3 < 0)\n        {\n            dp[i] = dp[i - 1] + arr[i];\n        }\n        else if(i >= 3)\n        {\n            dp[i] = Max(dp[i - 1] + arr[i], dp[i - 3]);\n        }\n    }\n    \n    int max = 0;\n    for(int i = 1;i <= n;i++)\n    {\n        if(dp[i] > max)\n        {\n            max = dp[i];\n        }\n    }\n    \n    cout << max << endl;\n    \n}",WRONG_ANSWER,7,584
1591681347109019648,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-13 14:36:19,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,j,n;\n    int a[100],sum[100];\n    int max=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n        \n    }\n    for(j=0;j<n;j++){\n        int x=0;\n        for(i=0;i<n;i++)\n        {\n            if(a[j]<=a[i])\n                x++;\n            if((a[j]>a[i]&&j<=i))\n                break;\n\n        }\n        sum[j]=x*a[j];\n    }\n    for(j=0;j<n;j++)\n    {\n       \n        if(sum[j]>=max)\n        {\n            max=sum[j];\n            \n         }   \n    }\n    printf(\""%d\"",max);\n    return 0;\n}",WRONG_ANSWER,8,384
1591681374514601984,902d8082eea06043d392298983db4630cde4418ac8ee42282d537bfaae045c2f,2022-11-13 14:36:26,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,b=eval(input())\na=list(input())\ni=1\nwhile i<=len(a) - 1:\n    if a[i] != a[i - 1]:\n        a.pop(i)\n        a.pop(i - 1)\n        i=0\n    i=i+1\nprint(len(a)),WRONG_ANSWER,20,2892
1591681398111789056,5bd1a8718ea7fb820055421c67b8e0a468e08d951f729a24e55bf407b3bdb1f6,2022-11-13 14:36:31,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <iostream>\n#include <vector>\n#include <stdio.h>\n#include<math.h>\nusing namespace std;\n\n\n\nfloat getret(int c,int f,int x){\n    return (c/(f+1))*pow(x,f+1);\n}\n\n\nint main()\n{\n\n    int n,a,b;\n    cin>>n>>a>>b;\n\n    vector<int> c(n);\n    vector<int> f(n);\n    for(int i=0;i<n;i++){\n        cin>>c[i];\n        }\n    for(int j=0;j<n;j++){\n        cin>>f[j];\n        }\n\n\n    float sum1=0,sum2=0;\n\n    for(int k=0;k<n;k++)\n    {\n        sum1+=getret(c[k],f[k],a);\n        sum2+=getret(c[k],f[k],b);\n    }\n    cout<<sum1-sum2;\n    return 0;\n}\n",WRONG_ANSWER,8,760
1591681421327261696,9c773df96630087325d11d08f2dbc9851abb095c63fb7b3e55cb667898dfe23f,2022-11-13 14:36:37,C++,300.0,1591610585635213312,1589816514637750272,1049226928954454016,#include <iostream>\n#include <stack>\n\nusing namespace std;\n\nint main() {\n    int n;\n    string str;\n    cin >> n;\n    cin >> str;\n    int ans = 0;\n    stack<int> stk;\n    for (int i = 0; i < n; i++) {\n        if (!stk.empty() && stk.top() != str[i]) {\n            ans += 2;\n            stk.pop();\n        } else {\n            stk.push(str[i]);\n        }\n        \n    }\n    cout << ans;\n    return 0;\n},ACCEPTED,27,708
1591681444291076096,547094c7c62f34b25dac6d7d79e017d817767a29a120ff5083d5fe0c21b62800,2022-11-13 14:36:42,Python,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"list1=[]\na=eval(input())\nlist1=input().split(\"" \"")\nlist1.sort()\nmax=a*int(list1[0])\nfor i in range(a-1):\n    if int(list1[i])*(a-i)>max:\n        max=int(list1[i])*(a-i)\n    if list1[i]==list1[i+1]:\n        continue\nprint(max)\n",WRONG_ANSWER,16,2888
1591681464134328320,06b00897262b024d9e66dcd771cf81de9b63954f7a4554699d17c2158114c0d1,2022-11-13 14:36:47,Java,300.0,1591610585639407616,1591132307937943552,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner scan=new Scanner(System.in);\n\t\tint n=scan.nextInt();\n\t\tint arr[]=new int[n];\n\t\tint x=0;\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tarr[i]=scan.nextInt();\n\t\t}\n\t\tint m=0;\n\t\twhile(m<n-1) {\n\t\t\tif(arr[m]==arr[m+1]) {\n\t\t\t\tfor(int j=m;j<n-1;j++) {\n\t\t\t\t\tarr[j]=arr[j+1];\n\t\t\t\t}\n\t\t\t\tarr[n-1]=0;\n\t\t\t\tn=n-1;\n\t\t\t}else {\n\t\t\t\tm++;\n\t\t\t}\n\t\t}\n\t\tfor(int j=1;j<n-1;j++){\n\t\t\tif(arr[j]<arr[j-1]&&arr[j]<arr[j+1]) {\n\t\t\tx++;\t\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(x);\n\t\tscan.close();\n\t}\n\n},ACCEPTED,585,26332
1591681477069516800,902d8082eea06043d392298983db4630cde4418ac8ee42282d537bfaae045c2f,2022-11-13 14:36:50,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,b=eval(input())\na=list(input())\ni=1\nwhile i<=len(a) - 1:\n    if a[i] != a[i - 1]:\n        a.pop(i)\n        a.pop(i - 1)\n        i=0\n    i=i+1\nprint(b-len(a)),TIME_LIMIT_EXCEEDED,464,3968
1591681490503884800,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-13 14:36:54,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main(){\n\tint n,i,j;\n\tscanf(\""%d\"",&n);\n\tint m;\n\tm=n;\n\tchar a[n];\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%c\"",&a[i]);\n\t}\n\tfor(i=0;i<n-1;i++){\n\t\tif(a[i]==a[i+1])\tcontinue;\n\t\t\telse {\n\t\t\t\tn-=2;\n\t\t\tfor(j=i;j<n;j++){\n\t\t\t\ta[j]=a[j+2];\n\t\t\t}\n\t\t\ti=-1;\n\t\t}\n\t\t}\n\tif(m==n+2) printf(\""0\\n\"");\n\telse\tprintf(\""%d\\n\"",m-n);\n}",TIME_LIMIT_EXCEEDED,432,512
1591681502545764352,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-13 14:36:56,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,def clean(num):\n    for i in range(len(num)-1):\n        if num[i]!=num[i+1]:\n            num.pop(i)\n            num.pop(i)\n            return clean(num)\n    else:\n         return len(num)\n\nn=int(input())\nb=input()\nc=input()\na=list(b)\nprint(n-clean(a))\n,NON_ZERO_EXIT_CODE,16,2904
1591681506001825792,d4c94290401b65ee2ce02056ca325b624120f06a8f67557b729453a418b199fe,2022-11-13 14:36:57,C++,0.0,1591610585635213313,1589906790446387200,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nconst int N=1e5;\n\nint n,count1=0,a[N],t;\nstring str;\nint main(){\n\tcin>>t;\n\twhile(t--){\n\t\tcin>>n;\n\t\tfor(int i=1;i<=n;i++){\n\t\t\tcin>>a[i];\n\t\t}\n\t\tsort(a+1,a+n+1);\n\t\tint x=a[n]-a[n-1];\n\t\tint y=a[2]-a[1];\n\t\tint z=max(x,y);\n\t\tcout<<z+a[n]-a[1]<<endl;\n\t\tmemset(a,0,sizeof 0);\n\t}\n} ",WRONG_ANSWER,29,452
1591681511639015424,73af9d5098be5d450fba728363c8fdbe0f6a5526466daa2f3b74abf1acf75527,2022-11-13 14:36:59,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int n,a,b;\n    int i=0;\n    int c[10000],F[10000];\n    int sum=0;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&c[i]);\n\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&F[i]);\n\n    }\n    \n    for(i=0;i<n;i++)\n    {\n        int x=pow(a,F[i]+1 );\n        int y=pow(b,F[i]+1 );\n        if(a==0)\n            x=0;\n        if(b==0)\n            y=0;\n        \n        sum=sum+(c[i]/(F[i]+1))*(x-y);\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,5,352
1591681512071028736,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-13 14:36:59,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,j,k=-1,sum=0;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(j=0;j<n;j++)\n    {\n        a[j]=a[j]-5;\n    }\n   while(k!=n-1)\n    {\n        if(k+3<=n-1)\n        {\n        if(a[k+1]>a[k+3])\n        {\n            sum+=a[k+1];\n            k=k+1;\n        }\n        else  if(a[k+3]>=a[k+1])\n        {\n            sum+=a[k+3];\n            k=k+3;\n        }\n        }\n        else{\n            sum+=a[k+1];\n            k=k+1;\n        }\n    }\n    if(n==1)\n        printf(\""%d\"",a[0]);\n    else\n        printf(\""%d\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,9,352
1591681557314953216,fbea21dbaf89f1b064feaa20227f21c5e1c4888fdc371cf5e43f70615906e52a,2022-11-13 14:37:09,Python,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"n=int(input())\nm=list(map(int,input().split()))\nnum=0\nfor i in range(n):\n    if m[i]>=3:\n        num=num+1\n        continue\n        for j in range (i+1,n):\n            if m[j]>=3 and m[j-1]>=3:\n                num+=1\ns=3*num*1\nprint(s)\n    ",WRONG_ANSWER,17,2764
1591681560930476032,2bc6a85c0376656012a7970a7842a2a9d8769555a79ef4eec85ff45aa30ff7b7,2022-11-13 14:37:10,Java,300.0,1591610585635213312,1589816514637750272,1049226928954454016,import java.util.Scanner;\nimport java.util.Stack;\n\npublic class Main {\n    public static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tsc.nextLine();\n\t\tString s = sc.nextLine();\n\t\tStack<Character> s1 = new Stack<>();\n\t\tStack<Character> s2 = new Stack<>();\n\t\tfor(int i = 0; i < s.length(); i++) {\n\t\t\ts1.add(s.charAt(i));\n\t\t}\n\t\tint count = 0;\n\t\twhile(!s1.isEmpty()) {\n\t\t\tif(s2.isEmpty()) {\n\t\t\t\ts2.push(s1.pop());\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif(!s1.peek().equals(s2.peek())) {\n\t\t\t\tcount= count+2;\n\t\t\t\ts1.pop();\n\t\t\t\ts2.pop();\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\ts2.push(s1.pop());\n\t\t}\n\n\t\tSystem.out.println(count);\n\t}\n},ACCEPTED,669,31552
1591681565015695360,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-13 14:37:11,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n\tint n,a,b,i;\n\tscanf(\""%d %d %d\"",&n,&a,&b);\n\tint c[n],f[n];\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&c[i]);\n\t}\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&f[i]);\n\t}\n\tint a1,a2;\n\tint sum=0;\n\tfor(i=0;i<n;i++)\n\t{\n        a1=0;\n        a2=0;\n\t\ta1=c[i]/(f[i]+1)*pow(a,(f[i]+1));\n\t\ta2=c[i]/(f[i]+1)*pow(b,(f[i]+1));\n\t\tsum+=(a1-a2);\n\t}\n\tprintf(\""%d\\n\"",sum);\n\treturn 0;\n}",WRONG_ANSWER,6,220
1591681568417263616,ccc42b8437aa15d1214e4623799ed35cd8ea8087c26cb1b596d51ae4556ea39c,2022-11-13 14:37:12,Python,0.0,1591610585635213315,1591129345182261248,1049226928954454016,a=eval(input())\nb=input().split()\ndeifen=0\nxiaohao=0\ni=-1\nwhile i<a-1:\n    if i+3<a:\n        if int(b[i+1])<int(b[i+3]):\n            deifen+=int(b[i+3])\n            xiaohao+=5\n            i+=3\n        else:\n            deifen+=int(b[i+1])\n            xiaohao+=5\n            i+=1\n    else:\n        deifen+=int(b[i+1])\n        xiaohao+=5\n        i+=1\nprint(deifen-xiaohao),WRONG_ANSWER,22,3200
1591681587316842496,e9a50f3e071443bb6fb229966bff355c178d484f6cc10e5e1fc8dc5a537237ba,2022-11-13 14:37:17,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int b,c,i,j,max=0;\n    scanf(\""%d\"",&b);\n    int a[b];\n    for(i=0;i<b;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<b;i++){\n\n        for(j=i+1;j<b;j++)\n        {\n            if(a[i]>a[j]) break;\n            else  c=a[i]*j;\n        }\n       if(max<c) max=c;\n    }\n    printf(\""%d\"",max);\n}\n",WRONG_ANSWER,8,196
1591681610419036160,902d8082eea06043d392298983db4630cde4418ac8ee42282d537bfaae045c2f,2022-11-13 14:37:22,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,b=eval(input())\na=list(input())\ni=1\nwhile i<len(a):\n    if a[i]!= a[i - 1]:\n        a.pop(i)\n        a.pop(i - 1)\n        i=0\n    i=i+1\nprint(b-len(a)),TIME_LIMIT_EXCEEDED,465,3796
1591681619759751168,5d7d397496e2400ea10e8ecafd4566e19d1083215d66cad8e11230c22227362c,2022-11-13 14:37:24,C++,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <bits/stdc++.h>\n\nusing namespace std;\nconst int N=1e4+10;\nint n,l[N],res;\nvoid solve()\n{\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)scanf(\""%d\"",&l[i]);\n    res=0;\n    for(int i=1;i<n-1;i++)\n    {\n        if(l[i]<l[i-1]&&l[i]<l[i+1])\n        {\n            res++;\n        }\n        if(l[i]<l[i-1])\n        {\n            if(l[i]>l[i+1])continue;\n            else if(l[i]==l[i+1])\n            {\n                while(l[i]==l[i+1]&&i<n-1)i++;\n                if(l[i]<l[i+1])res++;\n            }\n        }\n    }\n    printf(\""%d\"",res);\n}\nint main()\n{\n    solve();\n    return 0;\n}\n",ACCEPTED,41,736
1591681630782414848,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-13 14:37:27,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,j,count=0;\n    int hi[n];\n    hi[0]=0;\n    hi[n-1]=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n    scanf(\""%d\"",&hi[n]);}\n    for(j=0;j<n-1;j++){\n    if(hi[j+1]<hi[j])\n        count++;\n   }\n    printf(\""%d\"",count);\n    return 0;\n}\n",WRONG_ANSWER,4,196
1591681662860419072,5a1c17b308a3b3595833d34c6bdfb75e9f5dd0d065acfeb7f28ab8102ba7406c,2022-11-13 14:37:35,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int n,a,b,i,j;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    int sum1 = 0;\n    int sum2 = 0;\n    int c[n],f[n];\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&c[i]);\n    }\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&f[i]);\n    }\n    for(j=0;j<n;j++){\n        double x = c[j]/(f[j]+1)*pow(a,f[j]+1);\n        sum1+=x;\n    }\n    for(j=0;j<n;j++){\n        double y = c[j]/(f[j]+1)*pow(b,f[j]+1);\n        sum2+=y;\n    }\n    int sum = sum1 - sum2;\n    printf(\""%d\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,6,352
1591681668514373632,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-13 14:37:36,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,def clean(num):\n    for i in range(len(num)-1):\n        if num[i]!=num[i+1]:\n            num.pop(i)\n            num.pop(i)\n            return clean(num)\n    else:\n         return len(num)\n\nn=int(input())\nb=input()\na=list(b)\nprint(n-clean(a))\n,NON_ZERO_EXIT_CODE,131,4832
1591681687749451776,5bd1a8718ea7fb820055421c67b8e0a468e08d951f729a24e55bf407b3bdb1f6,2022-11-13 14:37:41,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <iostream>\n#include <vector>\n#include <stdio.h>\n#include<math.h>\nusing namespace std;\n\n\n\nint getret(int c,int f,int x){\n    return (c/(f+1))*pow(x,f+1);\n}\n\n\nint main()\n{\n\n    int n,a,b;\n    cin>>n>>a>>b;\n\n    vector<int> c(n);\n    vector<int> f(n);\n    for(int i=0;i<n;i++){\n        cin>>c[i];\n        }\n    for(int j=0;j<n;j++){\n        cin>>f[j];\n        }\n\n\n    int sum1=0,sum2=0;\n\n    for(int k=0;k<n;k++)\n    {\n        sum1+=getret(c[k],f[k],a);\n        sum2+=getret(c[k],f[k],b);\n    }\n    cout<<sum1-sum2;\n    return 0;\n}\n",WRONG_ANSWER,6,340
1591681698935615488,7ecf54bf0ea2db8ab0397aa941f19ec79a351bc3e86e8c01673aa09a69b3a6db,2022-11-13 14:37:43,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n\tint n,l,max;\n\tscanf(\""%d\"",&n);\n\tint s[n];\n\t//录入\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&s[i]);\n\t}\n    max=s[0];\n\t//找最大矩形\n\tfor(int j=0;j<n;j++)\n\t{\n\t\tl = 1;\n\t\tfor(int k=j;k<n-1;k++)\n\t\t{\n            if(s[j]>s[k+1])break;\n\t\t\tl++;\n\t\t}\n\t\t//printf(\""%d %d\\n\"",s[j],l);\n\t\tif(max<=s[j]*l)max=s[j]*l;\n\t}\n\t//打印结果\n    if(s[0]>=1000000 && n>=10000)  //防止爆长\n    {\n        printf(\""10000000000\\n\"");\n    }\n    else\n    {\n\t    printf(\""%d\\n\"",max);        \n    }\n\n}\n\n",WRONG_ANSWER,17,328
1591681743210733568,a5291eb67188c2a916aa5dd9fc38f2e449aa9f9a3cd047f282d8c154ea2979cd,2022-11-13 14:37:54,C++,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <iostream>\n\nusing namespace std;\n\nconst int N = 1e6 + 10;\nint dp[N];\nint arr[N];\n\nint Max(int a,int b)\n{\n    return a > b ? a : b;\n}\n\nint main()\n{\n    int n = 0;\n    cin >> n;\n    for(int i = 1;i <= n;i++)\n    {\n        cin >> arr[i];\n        arr[i] = arr[i] - 5;\n    }\n    dp[0] = 0;\n    dp[1] = arr[1];\n    for(int i = 2;i <= n;i++)\n    {\n        if(i - 3 < 0)\n        {\n            dp[i] = dp[i - 1] + arr[i];\n        }\n        else if(i >= 3)\n        {\n            dp[i] = Max(dp[i - 1] + arr[i], dp[i - 3] + arr[i]);\n        }\n    }\n    \n    int max = 0;\n    for(int i = 1;i <= n;i++)\n    {\n        if(dp[i] > max)\n        {\n            max = dp[i];\n        }\n    }\n    \n    cout << max << endl;\n    \n}",WRONG_ANSWER,15,616
1591681747069448192,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-13 14:37:55,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint mian(){\n    int n,sum=0;\n    scanf(\""%d\"",&n);\n    int a[n],i;\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n     for(i=1;i<n-1;i++){\n         if(a[i]<a[i-1]&&a[i]<a[i+1]){\n             sum++;\n         }\n        if(a[i]=a[i+1]&&a[i-1]>a[i]&&a[i+2]>a[i+1])\n            sum++;\n     }\n   printf(\""%d\"",sum);\n    \n}",COMPILE_ERROR,0,0
1591681748357111808,54914c90623988219ee55c4a0b2e645efd9808505aa25f0099930bfa8bf18ad1,2022-11-13 14:37:55,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main() {\n\tint inp,i;\n\tscanf(\""%d\"",&inp);\n\tint a[inp];\n\tfor(i=0;i<inp;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tint max=0;\n\tint l=0,r=inp-1;\n\twhile(l<r){\n\t\tint min=21000;\n\t\tfor(i=l;i<=r;i++){\n\t\t\tif(a[i]<min){\n\t\t\t\tmin=a[i];\n\t\t\t}\n\t\t}\n\t\tif(min*(r-l+1)>max){\n\t\t\tmax = min*(r-l+1);\n\t\t}\n\t\tif(a[l]>a[r]){\n\t\t\tr--;\n\t\t}else{\n\t\t\tl++;\n\t\t}\n\t}\n\tprintf(\""%d\"",max);\n}",WRONG_ANSWER,25,476
1591681776664469504,e51465ce72346fac918042a342986433269a159492161f223a180a6e05d9a01a,2022-11-13 14:38:02,Java,300.0,1591610585639407616,1591132307937943552,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n\t\npublic static void main(String[] args) {\n\t    Scanner sc =new Scanner(System.in);\n\t    int num  =sc.nextInt();\n\t    int index=0;\n\t    int max = 0;\n\t    int result=0;\n\t    int s=0;\n\t    \n\t    int [] arr=new int [num];\n\t    int []dp=new int [num];\n\t    for(int i=0;i<num;i++){\n\t    \tarr[i]=sc.nextInt();\n\t    \t \n\t    }\n\t    for(int i=2;i<arr.length;i++){\n\t    \tif(arr[i-1]<arr[i-2]&&arr[i-1]<arr[i]){\n\t    \t\tindex++;\n\t    \t}\n\t    \tif(arr[i-1]==arr[i]&&arr[i+1]>arr[i-1]){\n\t    \t\tindex++;\n\t    \t}\n\t    }\n\t   \n\t    System.out.println(index);\n\t    \n}\n},ACCEPTED,600,25832
1591681778841313280,eeab3421c2b685f7d51b09a289b82fe82ba0d3896984d09aeffb9d022232d887,2022-11-13 14:38:02,Java,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.math.BigDecimal;\nimport java.util.Scanner;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n    public static void main(String[] args) {\n        FastReader fastReader =  new FastReader();\n       int n = fastReader.nextInt();\n       if(n == 0)\n       {\n           System.out.println(0);\n           return ;\n       }\n       long result = 0;\n       long[] f = new long[n];\n       for(int i=0;i<n;i++)\n           f[i] = fastReader.nextLong();\n       for(int i = 0;i<n;i++){\n           long m = f[i];\n           long t = 0;\n          for(int j=i+1;j<n;j++){\n              m = Math.min(m,f[j]);\n              t = Math.max(t,m*(j-i+1));\n          }\n          result = Math.max(result,t);\n       }\n        System.out.println(result);\n    }\n\n\n    static class FastReader {\n        BufferedReader br;\n        StringTokenizer st;\n        public FastReader()\n        {\n            br = new BufferedReader(\n                    new InputStreamReader(System.in));\n        }\n\n\n        String next()\n        {\n            while (st == null || !st.hasMoreElements()) {\n                try {\n                    st = new StringTokenizer(br.readLine());\n                }\n                catch (IOException e) {\n                    e.printStackTrace();\n                }\n            }\n            return st.nextToken();\n        }\n\n\n\n        int nextInt() { return Integer.parseInt(next()); }\n\n        long nextLong() { return Long.parseLong(next()); }\n\n        double nextDouble(){return Double.parseDouble(next());}\n\n\n        String nextLine()\n        {\n            String str = \""\"";\n\n            try {\n                if (st!= null && st.hasMoreTokens()){\n                    str = st.nextToken(\""\\n\"");\n                } else {\n                    str = br.readLine();\n                }\n            }\n            catch (IOException e) {\n                e.printStackTrace();\n            }\n            return str;\n        }\n\n\n    }\n}\n\n\n\n",WRONG_ANSWER,345,22936
1591681839671291904,547094c7c62f34b25dac6d7d79e017d817767a29a120ff5083d5fe0c21b62800,2022-11-13 14:38:17,Python,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"list1=[]\na=eval(input())\nlist1=input().split(\"" \"")\nlist1.sort()\nmax=a*int(list1[0])\nfor i in range(a-1):\n    if int(list1[i])*(a-i)>max:\n        max=int(list1[i])*(a-i)\n    if list1[i]==list1[i+1]:\n        continue\nif int(list1[a-1])>max:\n    max=int(list1[a-1])\nprint(max)\n",WRONG_ANSWER,15,2760
1591681922093572096,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 14:38:36,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[n],i,s,j;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n        for(j=1;j<i;j++)\n    {\n        if(a[i]=a[i+j])\n            s=(n-i)*a[i];\n        }\n    printf(\""%d\"",s);\n    return 0;\n}",RUNTIME_ERROR,13,352
1591681943119650816,0d24b4ee85e6e3a4cc694f7e11105fa2aaf93fd10d4cbe81657f252e2d675435,2022-11-13 14:38:41,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    int n1,n2,n3;\n    int sum =0;\n    scanf(\""%d %d %d\"",&n1,&n2,&n3);\n    int i,j;\n    int t,t2,t3;\n    t= n1+ n2;\n    t2=n2+n3;\n    t3 =n1+n3;\n\n    if(t<t3)\n    sum = (t<t2)? t:t2;\n    else\n    sum=(t3<t2)? t2:t3;\n\n\n    printf(\""%d\"",sum);\n\n    return 0;\n}\n\n",WRONG_ANSWER,22,372
1591681947880153088,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 14:38:43,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <string.h>\nint main()\n{\n    int k,len,i,g=0,l=0;\n    char str[50];\n    scanf(\""%d\"",&k);\n    scanf(\""%s\"",str);\n    len  = strlen(str);\n    for(i=0;i<=len;i++)\n    {\n        if(str[i]=='0')\n        g++;\n        else\n        l++;\n    }\n    //g-=8;//0的个数;\n    //l-=52;//1的个数;\n    if(g>l)\n    printf(\""%d\\n\"",2*l);\n    else\n    printf(\""%d\\n\"",2*g);\n    return 0;\n}\n\n",SEGMENTATION_FAULT,21,476
1591681980218224640,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-13 14:38:50,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,j,k=-1,sum=0;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(j=0;j<n;j++)\n    {\n        a[j]=a[j]-5;\n    }\n   while(k!=n-1)\n    {\n        if(k+3<=n-1)\n        {\n        if(a[k+1]>a[k+3])\n        {\n            sum+=a[k+1];\n            k=k+1;\n        }\n        else  if(a[k+3]>=a[k+1])\n        {\n            sum+=a[k+3];\n            k=k+3;\n        }\n        }\n        else{\n            sum+=a[k+1];\n            k=k+1;\n        }\n    }\n    if(n==1)\n        printf(\""%d\"",a[0]);\n    else\n        printf(\""%d\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,7,204
1591682000518668288,54914c90623988219ee55c4a0b2e645efd9808505aa25f0099930bfa8bf18ad1,2022-11-13 14:38:55,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main() {\n\tint inp,i;\n\tscanf(\""%d\"",&inp);\n\tint a[inp];\n\tfor(i=0;i<inp;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tint max=0;\n\tint l=0,r=inp-1;\n\twhile(l<=r){\n\t\tint min=21000;\n\t\tfor(i=l;i<=r;i++){\n\t\t\tif(a[i]<min){\n\t\t\t\tmin=a[i];\n\t\t\t}\n\t\t}\n\t\tif(min*(r-l+1)>max){\n\t\t\tmax = min*(r-l+1);\n\t\t}\n\t\tif(a[l]>a[r]){\n\t\t\tr--;\n\t\t}else{\n\t\t\tl++;\n\t\t}\n\t}\n\tprintf(\""%d\"",max);\n}",WRONG_ANSWER,17,508
1591682007451852800,0d24b4ee85e6e3a4cc694f7e11105fa2aaf93fd10d4cbe81657f252e2d675435,2022-11-13 14:38:57,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    int n1,n2,n3;\n    int sum =0;\n    scanf(\""%d %d %d\"",&n1,&n2,&n3);\n    int t,t2,t3;\n    t= n1+ n2;\n    t2=n2+n3;\n    t3 =n1+n3;\n\n    if(t<t3)\n    sum = (t<t2)? t:t2;\n    else\n    sum=(t3<t2)? t2:t3;\n\n\n    printf(\""%d\"",sum);\n\n    return 0;\n}\n\n",WRONG_ANSWER,22,352
1591682007816790016,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-13 14:38:57,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main(){\n\tint n,i,j;\n\tscanf(\""%d\"",&n);\n\tint m;\n\tm=n;\n\tchar a[n];\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%c\"",&a[i]);\n\t}\n\tfor(i=0;i<n-1;){\n\t\tif(a[i]==a[i+1])\ti++;\n\t\t\telse {\n\t\t\t\tn-=2;\n\t\t\tfor(j=i;j<n;j++){\n\t\t\t\ta[j]=a[j+2];\n\t\t\t}\n\t\t\ti=0;\n\t\t}\n\t\t}\n\tif(m==n+2) printf(\""0\\n\"");\n\telse\tprintf(\""%d\\n\"",m-n);\n}",TIME_LIMIT_EXCEEDED,426,512
1591682010169761792,e9a50f3e071443bb6fb229966bff355c178d484f6cc10e5e1fc8dc5a537237ba,2022-11-13 14:38:57,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int b,c,i,j,max=0;\n    scanf(\""%d\"",&b);\n    int a[b];\n    for(i=0;i<b;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<b;i++){\n\n        for(j=i+1;j<=b;j++)\n        {\n            if(a[i]>a[j]) break;\n            else  c=a[i]*j;\n        }\n       if(max<c) max=c;\n    }\n    printf(\""%d\\n\"",max);\n}\n",WRONG_ANSWER,4,200
1591682012904448000,c47b15e117166a3dd00078b9f795673d5284a2761e582479119229751cc734d3,2022-11-13 14:38:58,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#define S 10000\n\n\nint main()\n{\n    int a=0,n,i;\n    int h[S];\n    scanf(\""%d\"",&n);\n    if(n>=3 && n<=10000)\n    {\n        for(i=0;i<n;i++)\n        scanf(\""%d\"",&h[i]);\n    for(i=0;i<n;i++)\n    {\n        if(h[i]>h[i+1])\n        a+=1;\n    }\n    printf(\""%d\"",a-1);\n    }\n    printf(\""\\n\"");\n    return 0;\n}\n",WRONG_ANSWER,5,200
1591682023130161152,39afbda4ab6a7df2673bc0d0eec048a42b23ada2774ec941935a2b2fa044515a,2022-11-13 14:39:00,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <bits/stdc++.h>\nusing namespace std;\n#define MAX 100001\nint main()\n{\nint n,a,b,x,y;\nint c[MAX],f[MAX],sum=0;\ncin>>n>>a>>b;\nfor(int i=0;i<n;i++)\n    cin>>c[i];\nfor(int i=0;i<n;i++)\n    cin>>f[i];\n    for(int i=0;i<n-1;i++){\n        x=(c[i]/(f[i]+1))*pow(a,f[i]+1)+(c[i+1]/(f[i+1]+1))*pow(a,f[i+1]+1);\n        y=(c[i]/(f[i]+1))*pow(b,f[i]+1)+(c[i+1]/(f[i+1]+1))*pow(b,f[i+1]+1);\n        sum+=x-y;\n    }\n    cout<<sum;\n}\n\n",WRONG_ANSWER,14,452
1591682041148878848,27fbb32d960dbf49665c8905b68012d602eda68987686c6f224ec7b49ca3d0ac,2022-11-13 14:39:05,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint n,i,j,flog=0;\n\tscanf(\""%d\"",&n);\n\tint a[n],b[n];\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=0;i<n;i++)\n\t{\n\t\tfor(j=i;j<n;j++)\n\t\t{\n\t\t\tif(a[i]<=a[j])\n\t\t\t{\n\t\t\t\tflog++;\n\t\t\t}\n\t\t\telse\n\t\t\tbreak;\n\t\t}\n\t\tb[i]=a[i]*flog;\n\t\tflog=0;\n\t}\n\tint max=b[0];\n\tfor(i=1;i<n;i++)\n\t{\n\t\tif(max<b[i])\n\t\tmax=b[i];\n\t}\n\tprintf(\""%d\\n\"",max);\n\treturn 0;\n} ",WRONG_ANSWER,18,488
1591682060673409024,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 14:39:09,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i;\n    int sum=0;\n    int t=0;\n    scanf(\""%d\"",&n);\n        int a[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n-3;i=t)\n    {\n        if(a[i+1]>=a[i+3])\n        {\n            sum=sum+a[i+1]-5;\n            t=t+1;\n        }\n        else \n        {\n            sum=sum+a[i+3]-5;\n            t=t+3;\n        }\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,8,348
1591682077123469312,0d24b4ee85e6e3a4cc694f7e11105fa2aaf93fd10d4cbe81657f252e2d675435,2022-11-13 14:39:13,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    int n1,n2,n3;\n    int sum =0;\n    scanf(\""%d %d %d\"",&n1,&n2,&n3);\n    int t,t2,t3;\n    t= n1+ n2;\n    t2=n2+n3;\n    t3 =n1+n3;\n\n    if(t<=t3)\n    sum = (t<t2)? t:t2;\n    else\n    sum=(t3<=t2)? t2:t3;\n\n\n    printf(\""%d\"",sum);\n\n    return 0;\n}\n\n",WRONG_ANSWER,22,504
1591682101534285824,b80fc2aed0abde15bdaa9327874c9784da696b6ed442d90001602ff2a017be15,2022-11-13 14:39:19,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h> \n#include<math.h> \nint main()\n{\n   char n[1000];\n   int i,j,sum;\n   int a,m;\n   int b[10000];\n   scanf(\""%d\"",&a);\n  scanf(\""%s\"",n);\n  m=a;\n  for(j=0;j<m;j++)\n     {\n\t for(i=0;i<a-1;i++)\n\t {\n\t if(n[i]==n[i+1])\n\t   { \n\t   for(;i<a-2;i++)\n\t    n[i]=n[i+2];\n\t\ta=a-2;\n        sum=sum+2;\n\t\tbreak;\n\t}\n\t\n  } \n}\n   \n   printf(\""%d\"",sum);\n   return 0; \n   \n} ",WRONG_ANSWER,5,200
1591682110988279808,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-13 14:39:21,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,def clean(num):\n    for i in range(len(num)-1):\n        if num[i]!=num[i+1]:\n            num.pop(i)\n            num.pop(i)\n            return clean(num)\n    else:\n         return len(num)\n\nn=int(input())\nb=input()\na=list(b[:n])\nprint(n-clean(a))\n,NON_ZERO_EXIT_CODE,133,4916
1591682111688683520,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 14:39:22,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[n],i,s,j;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n        for(j=i+1;j<i+n;j++)\n    {\n        if(a[i]=a[j])\n            s=(n-i)*a[i];\n        }\n    printf(\""%d\"",s);\n    return 0;\n}",RUNTIME_ERROR,7,200
1591682122509987840,5bd1a8718ea7fb820055421c67b8e0a468e08d951f729a24e55bf407b3bdb1f6,2022-11-13 14:39:24,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <iostream>\n#include <vector>\n#include <stdio.h>\n#include<math.h>\nusing namespace std;\n\n\n\nlong long int getret(int c,int f,int x){\n    return (c/(f+1))*pow(x,f+1);\n}\n\n\nint main()\n{\n\n    int n,a,b;\n    cin>>n>>a>>b;\n\n    vector<int> c(n);\n    vector<int> f(n);\n    for(int i=0;i<n;i++){\n        cin>>c[i];\n        }\n    for(int j=0;j<n;j++){\n        cin>>f[j];\n        }\n\n\n    long long int sum1=0,sum2=0;\n\n    for(int k=0;k<n;k++)\n    {\n        sum1+=getret(c[k],f[k],a);\n        sum2+=getret(c[k],f[k],b);\n    }\n    cout<<sum1-sum2;\n    return 0;\n}\n",WRONG_ANSWER,6,484
1591682123290128384,0d24b4ee85e6e3a4cc694f7e11105fa2aaf93fd10d4cbe81657f252e2d675435,2022-11-13 14:39:24,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n1,n2,n3;\n    int sum =0;\n    scanf(\""%d %d %d\"",&n1,&n2,&n3);\n    int t,t2,t3;\n    t= n1+ n2;\n    t2=n2+n3;\n    t3 =n1+n3;\n\n    if(t<=t3)\n    sum = (t<t2)? t:t2;\n    else\n    sum=(t3<=t2)? t2:t3;\n\n\n    printf(\""%d\"",sum);\n\n    return 0;\n}\n\n",WRONG_ANSWER,19,488
1591682156978790400,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 14:39:32,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i;\n    int sum=0;\n    int t=0;\n    scanf(\""%d\"",&n);\n        int a[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n-3;i=t)\n    {\n        if(a[i]>=a[i+3])\n        {\n            sum=sum+a[i]-5;\n            t=t+1;\n        }\n        else \n        {\n            sum=sum+a[i+3]-5;\n            t=t+3;\n        }\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,5,480
1591682185630113792,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 14:39:39,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i;\n    int sum=0;\n    int t=0;\n    scanf(\""%d\"",&n);\n        int a[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n-3;i=t)\n    {\n        if(a[i]>=a[i+3])\n        {\n            sum=sum+a[i]-5;\n            t=t+1;\n        }\n        else \n        {\n            sum=sum+a[i+3]-5;\n            t=t+3;\n        }\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,9,324
1591682237261996032,172db3e4a89a3dc038ec44e9346ef3138ace8cc1576eb636ccaf26fd91d7a145,2022-11-13 14:39:52,C++,300.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <stack>\n\nusing namespace std;\nconst int N = 1e5 + 10;\nchar c[N];\nstack<int> s;\n\nint main(){\n\tint n;\n\tint cnt = 0;\n\tscanf(\""%d%s\"",&n,c);\n\tfor(int i=0;i<n;i++) {\n\t\tint a = c[i] - '0';\n\t\tif(s.size() == 0 || s.top() == a) s.push(a);\n\t\telse if(s.top() != a) {\n\t//\t\tprintf(\""*\"");\n\t\t\tcnt += 2;\n\t\t\ts.pop();\n\t\t}\n\t}\n\t\n\tprintf(\""%d\"",cnt);\n\treturn 0;\n} ",ACCEPTED,39,616
1591682251384172544,27fbb32d960dbf49665c8905b68012d602eda68987686c6f224ec7b49ca3d0ac,2022-11-13 14:39:55,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint n,i,j,flog=0;\n\tscanf(\""%d\"",&n);\n\tint a[n],b[n];\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=0;i<n;i++)\n\t{\n\t\tfor(j=i;j<n;j++)\n\t\t{\n\t\t\tif(a[i]<=a[j])\n\t\t\t{\n\t\t\t\tflog++;\n\t\t\t}\n\t\t\telse\n\t\t\tbreak;\n\t\t}\n\t\tb[i]=a[i]*flog;\n\t\tflog=0;\n\t}\n\tint max=b[0];\n\tfor(i=1;i<n;i++)\n\t{\n\t\tif(max<b[i])\n\t\tmax=b[i];\n\t}\n\tprintf(\""%d\\n\"",max);\n\treturn 0;\n} ",WRONG_ANSWER,12,348
1591682262939525120,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-13 14:39:58,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<iostream>\nusing namespace std;\nclass resolve{\n    public:\n    void resve(int *h,int n){\n        int nums=0;\n        for(int i=1;i<n-1;i++){\n            if(h[i]<h[i-1]){\n                for(int j=i;j<n-1;j++){\n                    if(h[i]<h[j]){\n                        nums++;\n                        i=j+1;\n                    }   \n                }\n            }\n        }\n        cout<<nums<<endl;\n    }  \n};\n\nint main(){\n    int n,h[1000]={0};\n    cin>>n;\n    if(n<3)\n        return 0;\n    for(int i=0;i<n;i++){\n        cin>>h[i];\n    }\n    resolve res;\n    res.resve(h,n);\n    return 0;\n}",WRONG_ANSWER,6,456
1591682305792684032,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-13 14:40:08,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main(){\n    int n,a[1000],count=0,i,j,t=0,c=1;\n      scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n        \n        \n    \n    for( j=1;j<n;j++)\n    {\n        \n        if(a[j]<a[j-1]&&a[j]<a[j+1])\n         count++;   \n             \n       else{\n        if(a[j]==a[j+1])\n        { c++;\n            continue;\n        }\n        else\n        if(a[j]<a[j+1]&&a[j]<a[j-c]) {count+=1;c=0;}\n      }\n        \n            \n    }\n    \n    \n \n    \n    printf(\""%d\\n\"",count);\n          \n}",WRONG_ANSWER,32,356
1591682344279662592,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-13 14:40:17,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,j,k=-1,sum=0;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(j=0;j<n;j++)\n    {\n        a[j]=a[j]-5;\n    }\n   while(k!=n-1)\n    {\n        if(k+3<=n-1)\n        {\n        if(a[k+1]>a[k+3])\n        {\n            sum+=a[k+1];\n            k=k+1;\n        }\n        else  if(a[k+3]>a[k+1])\n        {\n            sum+=a[k+3];\n            k=k+3;\n        }\n        }\n        else{\n            sum+=a[k+1];\n            k=k+1;\n        }\n    }\n    if(n==1)\n        printf(\""%d\"",a[0]);\n    else\n        printf(\""%d\"",sum);\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,400,512
1591682353356091392,f1feb45d46abad163f730e5b023ce1df76883054d0a1741228a76c2c69aa3eda,2022-11-13 14:40:19,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n,i,j,k;\n    k=0;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=1;i<n-1;i++){\n        if(a[i]<a[i-1]&&a[i]<a[i+1])\n            k++;\n        if(a[i]==a[i+1])\n            for(j=i+1;j<n-1;j++){\n                if(a[j+1]<a[j]){\n                \ti=j;\n                    break;\n                }\n                else if(a[j+1]>a[j]){\n                    k++;\n                    i=j;\n                    break;\n                }\n            }\n        }\n    printf(\""%d\\n\"",k);\n}",ACCEPTED,26,512
1591682380287762432,b80fc2aed0abde15bdaa9327874c9784da696b6ed442d90001602ff2a017be15,2022-11-13 14:40:26,C++,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h> \n#include<math.h> \nint main()\n{\n   char n[1000];\n   int i,j,sum;\n   int a,m;\n   int b[10000];\n   scanf(\""%d\"",&a);\n  scanf(\""%s\"",n);\n  m=a;\n  for(j=0;j<m;j++)\n     {\n\t for(i=0;i<a-1;i++)\n\t {\n\t if(n[i]==n[i+1])\n\t   { \n\t   for(;i<a-2;i++)\n\t    n[i]=n[i+2];\n\t\ta=a-2;\n        sum=sum+2;\n\t\tbreak;\n\t}\n  } \n}\n   \n   printf(\""%d\"",sum);\n   return 0; \n   \n} ",WRONG_ANSWER,11,512
1591682403285098496,b80fc2aed0abde15bdaa9327874c9784da696b6ed442d90001602ff2a017be15,2022-11-13 14:40:31,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h> \n#include<math.h> \nint main()\n{\n   char n[1000];\n   int i,j,sum;\n   int a,m;\n   int b[10000];\n   scanf(\""%d\"",&a);\n  scanf(\""%s\"",n);\n  m=a;\n  for(j=0;j<m;j++)\n     {\n\t for(i=0;i<a-1;i++)\n\t {\n\t if(n[i]==n[i+1])\n\t   { \n\t   for(;i<a-2;i++)\n\t    n[i]=n[i+2];\n\t\ta=a-2;\n        sum=sum+2;\n\t\tbreak;\n\t}\n  } \n}\n   \n   printf(\""%d\"",sum);\n   return 0; \n   \n} ",WRONG_ANSWER,8,368
1591682432615899136,c5cc6f9845df4bd1986af86c0696296436bbc0f00a10a9f891b4100e57bc3a19,2022-11-13 14:40:38,C++,300.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <bits/stdc++.h>\n#define N 10005\nusing namespace std;\nint main()\n{\n\tint n;\n\tcin>>n;\n\tint f[N];\n\tf[0]=0;\n\tint a[N];\n\tfor(int i=1;i<=n;i++) cin>>a[i];\n\tfor(int i=1;i<=n;i++) {\n\t\tif(i<3) f[i]=f[i-1]+a[i]-5;\n\t\telse f[i]= max(f[i-1]+a[i]-5 , f[i-3]+a[i]-5);\n\t}\n\tprintf(\""%d\"",f[n]);\n}",ACCEPTED,52,764
1591682497283678208,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 14:40:54,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i;\n    int sum=0;\n    int t=0;\n    scanf(\""%d\"",&n);\n        int a[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n-3;i=t)\n    {\n        if(a[i]>=a[i+3])\n        {\n            sum=sum+a[i]-5;\n            t=t+1;\n        }\n        else \n        {\n            sum=sum+a[i+3]-5;\n            t=t+3;\n        }\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,6,212
1591682511527489536,0b693affc66d8d407ff008bd1aaf4f2feb4a615f057943ba4b4ba3163d937dc6,2022-11-13 14:40:57,Java,300.0,1591610585635213314,1591128862958940160,1049226928954454016,"import java.io.*;\nimport java.util.*;\n\npublic class Main {\n\n    public static void main(String[] args) throws IOException {\n        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n        Scanner sc=new Scanner(System.in);\n        String s=br.readLine();\n        String[] str=br.readLine().split(\"" \"");\n        int n=Integer.parseInt(s);\n        int[] parent=new int[n+1];\n        Arrays.fill(parent,-1);\n        for (int i = 0; i < n-1; i++) {\n            int idx=i+2;\n            parent[idx]=Integer.parseInt(str[i]);\n        }\n        int[] sumChild=new int[n+1];\n        //Arrays.fill(sumChild,-1);\n        for (int i = 1; i < n + 1; i++) {\n            if (parent[i]!=-1)\n                sumChild[parent[i]]++;\n        }\n        //int[] res=new int[n+1];\n        for (int i =n ; i >=0 ; i--) {\n            if (sumChild[i]!=0 && parent[i]!=-1)\n                sumChild[parent[i]]+=sumChild[i];\n        }\n        for (int i = 1; i <= n; i++) {\n             if (i==n)\n                System.out.println(sumChild[i]+1);\n            else\n                System.out.printf(\""%d \"",sumChild[i]+1);\n        }\n    }\n}",ACCEPTED,1119,35280
1591682516132880384,e51465ce72346fac918042a342986433269a159492161f223a180a6e05d9a01a,2022-11-13 14:40:58,Java,0.0,1591610585639407617,1591132482555211776,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n\t\npublic static void main(String[] args) {\n\t    Scanner sc =new Scanner(System.in);\n\t    int num  =sc.nextInt();\n\t    int index=0;\n\t    int max = 0;\n\t    int result=0;\n\t    int s=0;\n\t    int [] arr=new int [num];\n\t    for(int i=0;i<num;i++){\n\t    \tarr[i]=sc.nextInt();\n\t    \t if(arr[i]>max){\n\t    \t\t max=arr[i];\n\t    \t }\t    \t  \n\t    }\n\t    \n\t    for(int i=0;i<=max;i++){\n\t    \t    index=0;\n\t    \tfor(int j=0;j<arr.length;j++){\n\t    \t\tif(arr[j]>=i){\n\t    \t\t\tindex++;\n\t    \t\t}\n\t    \t\t\n\t    \t}\n\t    \ts=index*i;\n    \t\t\n\t    \tif(s>result){\n\t    \t\tresult=s;\n\t    \t}\n\t    }\n\t    System.out.println(result);\n\t    \n}\n},WRONG_ANSWER,112,24652
1591682554061971456,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-13 14:41:07,C,300.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int num;\n    scanf(\""%d\"",&num);\n    int a[num+1];\n    int i,j;\n    int count = 0;\n    a[0] = 0;\n    for(i = 1;i < num+1;i++) {\n        scanf(\""%d\"",&a[i]);\n        a[i] -= 5;\n    }\n    for (i = 1;i<3;i++) {\n        a[i] += a[i-1];\n    }\n    for (i = 3;i<num+1;i++) {\n        a[i] += a[i-1]>a[i-3]?a[i-1]:a[i-3];\n    }\n    printf(\""%d\"",a[num]);\n    return 0;\n}",ACCEPTED,53,512
1591682559887859712,dcc1017bcd698bd6a0eee54e4ed848d4c51a3a26608990cdd2137e4c01065a1e,2022-11-13 14:41:08,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main (){\n    int p,q,r,min;\n    scanf(\""%d%d%d\"",&p,&q,&r);\n    if(p>q){\n        if(r>p){\n            min=p+q;\n        }\n        else{\n            min=q+r;\n        }}\n     else{\n            if(r>q){\n                min=p+q;\n            }\n            else{\n                min=r+p;\n            }\n        }\n    \n    printf(\""%d\\n\"",min);\n    return 0;\n}",ACCEPTED,40,480
1591682561620107264,a5291eb67188c2a916aa5dd9fc38f2e449aa9f9a3cd047f282d8c154ea2979cd,2022-11-13 14:41:09,C++,300.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <iostream>\n\nusing namespace std;\n\nconst int N = 1e6 + 10;\nint dp[N];\nint arr[N];\n\nint Max(int a,int b)\n{\n    return a > b ? a : b;\n}\n\nint main()\n{\n    int n = 0;\n    cin >> n;\n    for(int i = 1;i <= n;i++)\n    {\n        cin >> arr[i];\n        arr[i] = arr[i] - 5;\n    }\n    dp[0] = 0;\n    dp[1] = arr[1];\n    for(int i = 2;i <= n;i++)\n    {\n        if(i - 3 < 0)\n        {\n            dp[i] = dp[i - 1] + arr[i];\n        }\n        else if(i >= 3)\n        {\n            dp[i] = Max(dp[i - 1] + arr[i], dp[i - 3] + arr[i]);\n        }\n    }\n    \n    cout << dp[n] << endl;\n    \n}",ACCEPTED,40,604
1591682572412051456,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-13 14:41:11,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,def clean(num):\n    for i in range(len(num)-1):\n        if num[i]!=num[i+1]:\n            num.pop(i)\n            num.pop(i)\n            return clean(num)\n        return len(num)\n\nn=int(input())\nb=input()\na=list(b[:n])\nprint(n-clean(a))\n,WRONG_ANSWER,15,2760
1591682621414105088,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-11-13 14:41:23,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#define N 100\n\nint main()\n{\n    int n,a,b;\n    int c[N]={0},f[N]={0},e1[N]={0},e2[N]={0};\n    int i,j;\n    int sum=0;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&c[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&f[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        e1[i]=(c[i]/(f[i]+1)*pow(a,f[i]+1));\n        e2[i]=(c[i]/(f[i]+1)*pow(b,f[i]+1));\n    }\n    for(i=0;i<n;i++)\n    {\n        sum=sum+e1[i]-e2[i];\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,11,384
1591682682529275904,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-11-13 14:41:38,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#define N 100\n\nint main()\n{\n    int n,a,b;\n    int c[N]={0},f[N]={0},e1[N]={0},e2[N]={0};\n    int i,j;\n    int sum=0;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&c[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&f[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        e1[i]=(c[i]/(f[i]+1)*pow(a,f[i]+1));\n        e2[i]=(c[i]/(f[i]+1)*pow(b,f[i]+1));\n    }\n    for(i=0;i<n;i++)\n    {\n        sum=sum+e1[i]-e2[i];\n    }\n    printf(\""%d\\n\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,6,220
1591682694487269376,d830b0bcae7881ad6d1b2e2b14f3ffa3695b6d3bd622856493fa1cf903c9bf4e,2022-11-13 14:41:41,Java,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tint[] arr1 = new int[n];\n\t\tint[] arr2 = new int[n];\n\t\tfor(int i =0;i< arr1.length;i++){\n\t\t\t\tarr1[i]=sc.nextInt();\n\t\t\t\n\t\t}\n\t\tfor(int i =0;i< arr2.length;i++){\n\t\t\t    arr2[i]=sc.nextInt();\n\t\t\n\t\t}\n\t\tint res1=0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tres1+=(arr1[i]/(arr2[i]+1))*(Math.pow(a, arr2[i]+1));\n\t\t}\n\t\tint res2=0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tres2+=(arr1[i]/(arr2[i]+1))*(Math.pow(b, arr2[i]+1));\n\t\t}\n\t\tint res=res1-res2;\n\t\tSystem.out.print(res);\n\t}\n}",WRONG_ANSWER,108,24812
1591682719179137024,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 14:41:46,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i;\n    int sum=0;\n    int t=0;\n    scanf(\""%d\"",&n);\n        int a[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n-3;i=t)\n    {\n        if(a[i]>a[i+3])\n        {\n            sum=sum+a[i]-5;\n            t=t+1;\n        }\n        else \n        {\n            sum=sum+a[i+3]-5;\n            t=t+3;\n        }\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,29,384
1591682739542450176,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-13 14:41:51,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,def clean(num):\n    for i in range(len(num)-1):\n        if num[i]!=num[i+1]:\n            num.pop(i)\n            num.pop(i)\n            return clean(num)\n    return len(num)\n\nn=int(input())\nb=input()\na=list(b[:n])\nprint(n-clean(a))\n,NON_ZERO_EXIT_CODE,178,4816
1591682739701833728,fbea21dbaf89f1b064feaa20227f21c5e1c4888fdc371cf5e43f70615906e52a,2022-11-13 14:41:51,Python,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"n=int(input())\nm=list(map(int,input().split()))\nnum=0\nfor i in range(n):\n    if m[i]>=3:\n        num=num+1\n        break\nfor j in range (i+1,n):\n     if m[j]>=3 and m[j-1]>=3:\n          num+=1\ns=3*num*1\nprint(s)\n",WRONG_ANSWER,20,2944
1591682746530160640,899c5501179552dc1fe5639f9047e15d0f835e7a87c8568193377882d0278985,2022-11-13 14:41:53,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,a[n],i,count=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if((a[i-1]>a[i])&&(a[i+1]>a[i]))\n            count+=1;\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",WRONG_ANSWER,10,384
1591682765333213184,0d24b4ee85e6e3a4cc694f7e11105fa2aaf93fd10d4cbe81657f252e2d675435,2022-11-13 14:41:57,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n1,n2,n3;\n    int sum =0;\n    scanf(\""%d %d %d\"",&n1,&n2,&n3);\n    int t,t2,t3;\n    t= n1+ n2;\n    t2=n2+n3;\n    t3 =n1+n3;\n    if(t<=t3)\n    sum = (t<t2)?t:t2;\n    else\n    sum=(t3<t2)?t2:t3;\n    printf(\""%d\"",sum);\n    return 0;\n}\n\n",WRONG_ANSWER,51,512
1591682785839177728,9e0ba8d857885aa94eaa182d3a194e51593598b2d7817b16af4b1b57e49e10de,2022-11-13 14:42:02,Java,0.0,1591610585639407617,1591132482555211776,1049226928954454016,\nimport java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint a = scanner.nextInt();\n\t\tint[] b = new int[a];\n\n\t\tfor(int i = 0;i<b.length; i++) {\n\t\t\tb[i] = scanner.nextInt();\n\t\t}\n\t\tArrays.sort(b);\n\t\t\n\t\tint c = -1;\n\t\tint max = 0;\n\t\tint newmax = 0;\n\t\tfor(int i = 0;i < b.length; i++) {\n\t\t\tif(b[i] != c) {\n\t\t\t\tc = b[i];\n\t\t\t}\n\t\t\tnewmax = c * (b.length - i);\n\t\t\tif (newmax > max) {\n\t\t\t\tmax = newmax;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(max);\n\t}\n},WRONG_ANSWER,108,24032
1591682796115255296,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-13 14:42:05,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<iostream>\nusing namespace std;\nclass resolve{\n    public:\n    void resve(int *h,int n){\n        int nums=0;\n        for(int i=1;i<n-1;i++){\n            if(h[i]<h[i-1]){\n                for(int j=i;j<n-1;j++){\n                    if(h[i]<h[j]){\n                        nums++;\n                        i=j+1;\n                    }   \n                }\n            }\n        }\n        cout<<nums<<endl;\n    }  \n};\n\nint main(){\n    int n,h[1000]={0};\n    cin>>n;\n    if(n<3)\n        return 0;\n    for(int i=0;i<n;i++){\n        cin>>h[i];\n    }\n    resolve res;\n    if(h[0]==0&&h[n]==0)\n    \n        res.resve(h,n);\n    return 0;\n}",WRONG_ANSWER,27,440
1591682800867401728,630b8bfc88107b488e158fc7108c8faf0a195f9b9030c3faf51edac625714584,2022-11-13 14:42:06,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main(){\nint n,j=0,i,k=0,l;\nscanf(\""%d\"",&n);\nint h[n];\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&h[i]);\nfor(i=1;i<n+1;i++){\n    if(h[i]<h[i-1]) {l=i;break;}\n}\nif(l+1==n) printf(\""%d\"",k);\nelse{\nfor(i=l;i<n-1;i++){\n            j=i;\n        for(j;j<n-1;j++){\n            if(h[i]>=h[j+1]) continue;\n            else {k++;i=j+1;}\n        }\n    }\nprintf(\""%d\"",k);\n}\nreturn 0;\n}\n",WRONG_ANSWER,7,384
1591682813664223232,e715137eeb4190ade2330123b989bbdd6eebd9a5e1df2e292271d3bfe3a79c69,2022-11-13 14:42:09,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint a[10000];\nint main()\n{\n    int i,j,k,b,c=0,n;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=1;i<n-1;i++)\n    {\n        if(a[i-1]>a[i])\n        {\n            for(i;i<n;i++)\n            {\n                if(a[i]<a[i+1])\n                {\n                    c++;\n                    break;\n                }\n                if(a[i]>a[i+1])\n                    break;\n            }\n        }\n           \n        \n    }\n    printf(\""%d\\n\"",c);\n    return 0;\n}",ACCEPTED,89,436
1591682825311760384,54914c90623988219ee55c4a0b2e645efd9808505aa25f0099930bfa8bf18ad1,2022-11-13 14:42:12,C,300.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main() {\n\tint inp,i;\n\tscanf(\""%d\"",&inp);\n\tint a[inp];\n\tfor(i=0;i<inp;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tint max=0;\n\tint l=0,r=inp-1;\n\twhile(l<=r){\n\t\tint min=a[l];\n\t\tfor(i=l;i<=r;i++){\n\t\t\tif(a[i]<min){\n\t\t\t\tmin=a[i];\n\t\t\t}\n\t\t}\n\t\tif(min*(r-l+1)>max){\n\t\t\tmax = min*(r-l+1);\n\t\t}\n\t\tif(a[l]>a[r]){\n\t\t\tr--;\n\t\t}else{\n\t\t\tl++;\n\t\t}\n\t}\n\tprintf(\""%d\"",max);\n}",ACCEPTED,94,620
1591682847495434240,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 14:42:17,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i;\n    int sum=0;\n    int t=0;\n    scanf(\""%d\"",&n);\n        int a[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n-2;i=t)\n    {\n        if(a[i]>=a[i+2])\n        {\n            sum=sum+a[i]-5;\n            t=t+1;\n        }\n        else \n        {\n            sum=sum+a[i+2]-5;\n            t=t+3;\n        }\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,25,384
1591682934741151744,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-13 14:42:38,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<iostream>\nusing namespace std;\nclass resolve{\n    public:\n    void resve(int *h,int n){\n        int nums=0;\n        for(int i=1;i<n-1;i++){\n            if(h[i]<h[i-1]){\n                for(int j=i;j<n-1;j++){\n                    if(h[i]<h[j]){\n                        nums++;\n                        i=j+1;\n                    }   \n                }\n            }\n        }\n        cout<<nums<<endl;\n    }  \n};\n\nint main(){\n    int n,h[1000]={0};\n    cin>>n;\n    if(n<3)\n        return 0;\n    for(int i=0;i<n;i++){\n        cin>>h[i];\n    }\n    resolve res;\n    if(h[0]==0&&h[n-1]==0)\n        res.resve(h,n);\n    return 0;\n}",WRONG_ANSWER,5,604
1591682939094839296,6933dcb3592e2d6f6fc887ed9a5537aab21a30f76450c9b5043f7776bfc39a59,2022-11-13 14:42:39,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nint main(){\n    int n,i,j,temp;\n    scanf(\""%d\"",&n);\n    int high[n];\n    int x[n];\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&high[i]);\n    }\n    for(i=0;i<n;i++){\n        for(j=i,temp=0;j<n;j++){\n            temp++;\n            if(high[j+1]<high[i])\n                break;\n        }\n        x[i]=high[i]*temp;\n\n    }\n    sort(x,x+n);\n    printf(\""%d\"",x[n-1]);\n}",WRONG_ANSWER,18,196
1591682986243010560,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 14:42:50,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[n],i,s,j;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {   for(j=i+1;j<i+n;j++)\n    {\n        if(a[i]=a[j])\n            s=(n-i)*a[i];\n        }}\n    printf(\""%d\"",s);\n    return 0;\n}",RUNTIME_ERROR,6,512
1591682987975258112,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-13 14:42:51,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int n,a,b,i;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    int c[n],f[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&f[i]);\n    int sum=0,a1,2,s=0;\n    for(i=0;i<n;i++)\n    {\n        c1=0;\n        c2=0;\n        c1=c[i]*pow(a,f[i]+1)/(f[i]+1);\n        c2=c[i]*pow(b,f[i]+1)/(f[i]+1);\n        s=c1-c2;\n        sum+=s;\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1591683006912540672,40c43472973ea298adbdd1d4b900aeb63cfa4cfe17179f01a4827cd2c6624d3a,2022-11-13 14:42:55,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nmain()\n{\n    int n,h[20];\n    int i;\n    int t=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&h[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if(h[i]-h[i+1]>0)\n        {\n            t++;\n        }\n        if(h[i]==h[i+1])\n            t--;\n    }\n    printf(\""%d\"",t);\n}",WRONG_ANSWER,5,512
1591683022007840768,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-13 14:42:59,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main(){\n\tint n,i,j;\n\tscanf(\""%d\"",&n);\n\tint m;\n\tm=n;\n\tchar a[n];\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%c\"",&a[i]);\n\t}\n\ti=0;\n\twhile(i<n-1){\n\t\tif(a[i]==a[i+1])\t\n\t\ti++;\n\t\t\telse {\n\t\t\t\tn-=2;\n\t\t\tfor(j=i;j<n;j++){\n\t\t\t\ta[j]=a[j+2];\n\t\t\t}\n\t\t\ti=0;\n\t\t}\n\t\t}\n\tif(m==n) printf(\""0\\n\"");\n\telse\tprintf(\""%d\\n\"",m-n);\n}",WRONG_ANSWER,4,196
1591683066530390016,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 14:43:09,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i;\n    int sum=0;\n    int t=0;\n    scanf(\""%d\"",&n);\n        int a[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=1;i<n-3;i=t)\n    {\n        if(a[i]>=a[i+3])\n        {\n            sum=sum+a[i]-5;\n            t=t+1;\n        }\n        else \n        {\n            sum=sum+a[i+3]-5;\n            t=t+3;\n        }\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,12,324
1591683105503895552,efa7a60e7fa0d7fd13e87b47555eb8bfc0c4da0695990711fb851b886de3de22,2022-11-13 14:43:19,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,j;\n    int sum=0;\n    scanf(\""%d\"",&n);\n    int data[n];\n    int i;\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&data[i]);\n        for(j=i+1;j<n;j++){\n            if(data[j]<data[j+1]&&data[j]<=data[j-1]){\n                sum++;\n                \n            }\n        }\n    }\n    printf(\""3\"");\n    return 0;\n}",WRONG_ANSWER,5,200
1591683117847699456,6383c93cbdef4af3eda29400a925819f16ad4afc8368e604ccd580cba7055bdd,2022-11-13 14:43:21,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint i,k,j;\n\tint n;\n\tif(scanf(\""%d\"",&n)){\n\tint h[n];\n\tfor(i=0;i<=n-1;i++){\n\t\th[i] = 0;\n\t}\n\tfor(k=0;k<=n-1;k++){\n\t\tif(scanf(\""%d\"",&h[k])){}\n\t}\n\tint cnt = 0;\n\tfor(j=0;j<=n-1;j++){\n\t\tif(((h[j]<h[j-1])&&(h[j]<h[j+1]))||((h[j]==h[j+1])&&(h[j]<h[j-1])&&(h[j+1]<h[j+2]))){\n\t\t\tcnt++;\n\t\t}\n\t}\n\tprintf(\""%d\"",cnt);\n}\n\t\n\treturn 0; \n}",WRONG_ANSWER,4,324
1591683121270251520,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-13 14:43:22,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <math.h>\n#include <stdio.h>\n#define N 10000\nint main()\n{\n    int n,i,j,t=0;\n    scanf(\""%d\"",&n);\n    int a[N];\n    for(i=0;i<n;i++){\n    scanf(\""%d\"",&a[i]);}\n    for(j=1;j<n-1;j++)\n    {\n        if(a[j]<a[j-1]&&a[j]<a[j+1]) t+=1;\n        if(a[j]==a[j+1]&&a[j]<a[j-1]&&a[j]<a[j+2]) t+=1;\n    }\n    printf(\""%d\\n\"",t);\n    return 0;\n}",WRONG_ANSWER,32,640
1591683144557027328,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-13 14:43:28,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<iostream>\nusing namespace std;\nclass resolve{\n    public:\n    void resve(int *h,int n){\n        int nums=0;\n        for(int i=1;i<n-1;i++){\n            if(h[i]<h[i-1]){\n                for(int j=i+1;j<n-1;j++){\n                    if(h[i]<h[j]){\n                        nums++;\n                        i=j+1;\n                    }   \n                }\n            }\n        }\n        cout<<nums<<endl;\n    }  \n};\n\nint main(){\n    int n,h[1000]={0};\n    cin>>n;\n    if(n<3)\n        return 0;\n    for(int i=0;i<n;i++){\n        cin>>h[i];\n    }\n    resolve res;\n    if(h[0]==0&&h[n-1]==0)\n        res.resve(h,n);\n    return 0;\n}",WRONG_ANSWER,5,456
1591683146255720448,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-13 14:43:28,C,300.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int n,a,b,i;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    int c[n],f[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&f[i]);\n    int sum=0,a1,a2,s=0;\n    for(i=0;i<n;i++)\n    {\n        a1=0;\n        a2=0;\n        a1=c[i]*pow(a,f[i]+1)/(f[i]+1);\n        a2=c[i]*pow(b,f[i]+1)/(f[i]+1);\n        s=a1-a2;\n        sum+=s;\n    }\n    printf(\""%d\\n\"",sum);\n    return 0;\n}\n",ACCEPTED,26,512
1591683185090813952,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-13 14:43:38,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"a=int(input())\ndata=list(map(int,input().split()))\ncount=0\ndatas=[]\nfor i in range(0,a-1):\n    if len(datas)==0:\n       datas.append(data[i])\n    elif datas[len(datas)-1]<=data[i]:\n            datas.append(data[i])\n    elif i!=0:\n        datas=[]\n        count+=1\nprint(count)\n",WRONG_ANSWER,18,2884
1591683186684649472,3e087b0a196d30fcbb49ca80164c9eb5adf82ae3bb08ec0c141e5728fb180f0d,2022-11-13 14:43:38,Java,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"import java.util.Scanner;\n\npublic class Pb6 {\n\tstatic final int MAX=100;\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner sc=new Scanner(System.in);\n\t\tint n,a,b,res1=0,res2=0;\n\t\tdouble[] arr1=new double[MAX];\n\t\tdouble[] arr2=new double[MAX];\n\t\tn=sc.nextInt();\n\t\ta=sc.nextInt();\n\t\tb=sc.nextInt();\n\t\tfor(int i=0;i<n;i++){\n\t\t\tarr1[i]=sc.nextDouble();\n\t\t}\n\t\tfor(int i=0;i<n;i++){\n\t\t\tarr2[i]=sc.nextDouble();\n\t\t}\n\t\tfor(int i=0;i<n;i++){\n\t\t\tres1+=(arr1[i]/(arr2[i]+1))*Math.pow(a, arr2[i]+1);\n\t\t\tres2+=(arr1[i]/(arr2[i]+1))*Math.pow(b, arr2[i]+1);\n\t\t}\n\t\tSystem.out.print(res1-res2);\n\t}\n\n}",COMPILE_ERROR,0,0
1591683199343058944,d830b0bcae7881ad6d1b2e2b14f3ffa3695b6d3bd622856493fa1cf903c9bf4e,2022-11-13 14:43:41,Java,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint a= sc.nextInt();\n\t\tint b =sc.nextInt();\n\t\tint[] arr1 = new int[n];\n\t\tint[] arr2 = new int[n];\n\t\tfor(int i =0;i< arr1.length;i++){\n\t\t\t\tarr1[i]=sc.nextInt();\n\t\t\t\n\t\t}\n\t\tfor(int i =0;i< arr2.length;i++){\n\t\t\tarr2[i]=sc.nextInt();\n\t\t\n\t\t}\n\t\tint res1=0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tres1+=(arr1[i]/(arr2[i]+1))*((int)Math.pow(a, arr2[i]+1));\n\t\t}\n\t\tint res2=0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tres2+=(arr1[i]/(arr2[i]+1))*((int)Math.pow(b, arr2[i]+1));\n\t\t}\n\t\tint res=res1-res2;\n\t\tSystem.out.print(res);\n\t}\n}",WRONG_ANSWER,103,24500
1591683213775613952,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-13 14:43:44,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,def clean(num):\n    for i in range(len(num)-1):\n        if num[i]!=num[i+1]:\n            num.pop(i)\n            num.pop(i)\n            return clean(num)\n    return len(num)\n\nn=int(input())\nb=input()\na=list(b[:n])\nprint(n-clean(a))\n,NON_ZERO_EXIT_CODE,128,4832
1591683266443489280,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-13 14:43:57,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,def clean(num):\n    for i in range(len(num)-1):\n        if num[i]!=num[i+1]:\n            num.pop(i)\n            num.pop(i)\n            return clean(num)\nreturn len(num)\n\nn=int(input())\nb=input()\na=list(b[:n])\nprint(n-clean(a))\n,NON_ZERO_EXIT_CODE,20,2764
1591683287335317504,3e087b0a196d30fcbb49ca80164c9eb5adf82ae3bb08ec0c141e5728fb180f0d,2022-11-13 14:44:02,Java,300.0,1591610585635213317,1591130976212869120,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\tstatic final int MAX=100;\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner sc=new Scanner(System.in);\n\t\tint n,a,b,res1=0,res2=0;\n\t\tdouble[] arr1=new double[MAX];\n\t\tdouble[] arr2=new double[MAX];\n\t\tn=sc.nextInt();\n\t\ta=sc.nextInt();\n\t\tb=sc.nextInt();\n\t\tfor(int i=0;i<n;i++){\n\t\t\tarr1[i]=sc.nextDouble();\n\t\t}\n\t\tfor(int i=0;i<n;i++){\n\t\t\tarr2[i]=sc.nextDouble();\n\t\t}\n\t\tfor(int i=0;i<n;i++){\n\t\t\tres1+=(arr1[i]/(arr2[i]+1))*Math.pow(a, arr2[i]+1);\n\t\t\tres2+=(arr1[i]/(arr2[i]+1))*Math.pow(b, arr2[i]+1);\n\t\t}\n\t\tSystem.out.print(res1-res2);\n\t}\n\n}",ACCEPTED,633,28976
1591683297095507968,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-13 14:44:04,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,i,e=0,x1=0,x2=0,x3=0,x4=0,l,j,k;\n    scanf(\""%d\"",&n);\n    int s[n];\n    for(i=0;i<n;i++)\n    scanf(\""%d\"",&s[i]);\n    l=n;\n    for(i=0;i<n;i++)\n    {if(s[i]==1)\n        x1++;\n    if(s[i]==0)\n        x2++;\n    if(x1==n||x2==n)break;\n    if(s[i]!=s[i+1])\n    {\n     l=l-2;\n     e=e+2;\n    for(j=0;j<n-2;j++)\n    s[j]=s[j+2];\n    for(k=0;k<l;k++)\n     if(s[i]==1)\n         x3++;\n     if(s[i]==0)\n         x4++;\n      if(x3==l||x4==l||l==0)break;  \n    }\n    printf(\""%d\"",e);\n    return 0;\n    \n}",COMPILE_ERROR,0,0
1591683305186320384,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-13 14:44:06,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,def clean(num):\n    for i in range(len(num)-1):\n        if num[i]!=num[i+1]:\n            num.pop(i)\n            num.pop(i)\n        return clean(num)\n    return len(num)\n\nn=int(input())\nb=input()\na=list(b[:n])\nprint(n-clean(a))\n,NON_ZERO_EXIT_CODE,25,3908
1591683347221590016,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-13 14:44:16,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,def clean(num):\n    for i in range(len(num)-1):\n        if num[i]!=num[i+1]:\n            num.pop(i)\n            num.pop(i)\n            return clean(num)\n    return len(num)\n\nn=int(input())\nb=input()\na=list(b[:n])\nprint(n-clean(a))\n,NON_ZERO_EXIT_CODE,148,4828
1591683363554209792,a57fdafe4877cd9608fc0ac8a5120a47bc60a015785960e61b67b4e66187c2f2,2022-11-13 14:44:20,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n#define N 100\nint jifen (int a,int c,int f){\n    int j,w;\n    j=c/(f+1);\n    w=j*pow(a,f+1);\n    return w;\n}\nint main(){\n    int n,a,b,i,max=0;\n    int z[N],m[N],p[N];\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&z[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&m[i]);\n    for(i=0;i<n;i++){\n        p[i]=jifen(a,z[i],m[i])-jifen(b,z[i],m[i]);\n    }\n     for(i=0;i<n;i++){\n        max+=p[i];\n    }\n    printf(\""%d \"",max);\n}",WRONG_ANSWER,8,352
1591683440481951744,0ccbaaa612b3d01dbe621ce5e7366d6e26d2e5adf55047d92c6eb7adf78a979d,2022-11-13 14:44:38,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int n;cin>>n;\n    long long int a[n];\n    int maxArea=0;\n    for(int i=0;i<n;i++) cin>>a[i];\n    for(int i=0;i<n;i++)\n    {\n        int t,count=0;\n        for(int j=0;j<n;j++)\n        {\n            if(a[j]>=a[i]) {count++;continue;}\n            else if(a[j]<a[i]&&j>i) break;\n        }\n        t=count*a[i];\n        if(t>maxArea) maxArea=t;\n    }\n    if(a[n-1]>maxArea) maxArea=a[n-1];\n    cout<<maxArea;\n    return 0;\n}\n",WRONG_ANSWER,9,640
1591683452507009024,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-13 14:44:41,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,i,e=0,x1=0,x2=0,x3=0,x4=0,l,j,k;\n    scanf(\""%d\"",&n);\n    int s[n];\n    for(i=0;i<n;i++)\n    scanf(\""%d\"",&s[i]);\n    l=n;\n    for(i=0;i<n;i++)\n    {if(s[i]==1)\n        x1++;\n    if(s[i]==0)\n        x2++;\n    if(x1==n||x2==n)break;\n    if(s[i]!=s[i+1])\n    {\n     l=l-2;\n     e=e+2;\n    for(j=0;j<n-2;j++)\n    s[j]=s[j+2];\n    for(k=0;k<l;k++)\n     if(s[k]==1)\n         x3++;\n     if(s[k]==0)\n         x4++;\n      if(x3==l||x4==l||l==0)break;  \n    }\n    printf(\""%d\"",e);\n    return 0;\n    \n}",COMPILE_ERROR,0,0
1591683507574038528,fbea21dbaf89f1b064feaa20227f21c5e1c4888fdc371cf5e43f70615906e52a,2022-11-13 14:44:54,Python,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"n=int(input())\nm=list(map(int,input().split()))\nnum=0\nfor i in range(n):\n    if m[i]>=3:\n        num=num+1\n        break\nfor j in range (i+1,n):\n     if m[j]>=3 and m[j-1]>=3:\n          num+=1\ns=3*num\nprint(s)\n",WRONG_ANSWER,22,2816
1591683541833113600,d830b0bcae7881ad6d1b2e2b14f3ffa3695b6d3bd622856493fa1cf903c9bf4e,2022-11-13 14:45:03,Java,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tint[] arr1 = new int[n];\n\t\tint[] arr2 = new int[n];\n        int res1=0;\n        int res2=0;\n\t\tfor(int i =0;i< arr1.length;i++){\n\t\t\tarr1[i]=sc.nextInt();\n\t\t\t\n\t\t}\n\t\tfor(int i =0;i< arr2.length;i++){\n\t\t\tarr2[i]=sc.nextInt();\n\t\t\n\t\t}\n\t\tfor(int i=0;i<n;i++){\n\t\t\tres1+=(arr1[i]/(arr2[i]+1))*((int)Math.pow(a, arr2[i]+1));\n\t\t}\n\t\tfor(int i=0;i<n;i++){\n\t\t\tres2+=(arr1[i]/(arr2[i]+1))*((int)Math.pow(b, arr2[i]+1));\n\t\t}\n\t\tint res=res1-res2;\n\t\tSystem.out.print(res);\n\t}\n}",WRONG_ANSWER,106,25240
1591683557662449664,5a1c17b308a3b3595833d34c6bdfb75e9f5dd0d065acfeb7f28ab8102ba7406c,2022-11-13 14:45:06,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int n,a,b,i,j;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    int sum1 = 0;\n    int sum2 = 0;\n    int sum = sum1 - sum2;\n    int c[n],f[n];\n    if(n==0){\n        sum = a - b;\n    }else{\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&c[i]);\n    }\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&f[i]);\n    }\n    for(j=0;j<n;j++){\n        double x = c[j]/(f[j]+1)*pow(a,f[j]+1);\n        sum1+=x;\n    }\n    for(j=0;j<n;j++){\n        double y = c[j]/(f[j]+1)*pow(b,f[j]+1);\n        sum2+=y;\n    }\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,6,328
1591683646606860288,5bd1a8718ea7fb820055421c67b8e0a468e08d951f729a24e55bf407b3bdb1f6,2022-11-13 14:45:28,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <iostream>\n#include <vector>\n#include <stdio.h>\n#include<math.h>\n#define e 2.71828;\nusing namespace std;\n\n\n\nlong long int getret(int c,int f,int x){\n    if(f==-1)\n        return c*log(x);\n    return (c/(f+1))*pow(x,f+1);\n}\n\n\nint main()\n{\n\n    int n,a,b;\n    cin>>n>>a>>b;\n\n    vector<int> c(n);\n    vector<int> f(n);\n    for(int i=0;i<n;i++){\n        cin>>c[i];\n        }\n    for(int j=0;j<n;j++){\n        cin>>f[j];\n        }\n\n\n    long long int sum1=0,sum2=0;\n\n    for(int k=0;k<n;k++)\n    {\n        sum1+=getret(c[k],f[k],a);\n        sum2+=getret(c[k],f[k],b);\n    }\n    cout<<sum1-sum2;\n    return 0;\n}\n",WRONG_ANSWER,10,488
1591683711517876224,42cfad7191c5e6c0eee156c4369182744d6c5db3bc2a5dc87f9f1be6ee4bbcfe,2022-11-13 14:45:43,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main(){\n   int n,a[n];\n   scanf(\""%d\"",&n);\n   int i,sum=0;\n   for(i=0;i<n;i++)\n   scanf(\""%d \"",&a[i]);\n   for(i=1;i<n-1;i++){\n       if(a[i]>a[i+1]&&a[i+1]<a[i+2]){\n           \tsum=sum+1;\n        if(a[i]>a[i+1]&&a[i+1]<a[i+3]||a[i+1]==a[i+2])\n   \t\t\t sum=sum+1;\n       }\n\t    }\n\n   printf(\""%d\"",sum);\n   return 0;\n} ",WRONG_ANSWER,6,512
1591683720032346112,70c675ddfcb60b2192bc8ac38fb068fec0500208a5bf97a796c7cc074b43cf87,2022-11-13 14:45:45,Java,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"import java.util.Scanner;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner myScanner = new Scanner(System.in);\n\t\tint n = myScanner.nextInt();\n\t\tint[] arr = new int[n];\n\t\tint count = 0;\n\t\tint count1 = 0;\n\t\tfor(int i = 0; i < n;i++){\n\t\t\tarr[i] = myScanner.nextInt();\n\t\t}\n\t\tfor(int j = 1;j <= n-3;j++){\n\t\t\tif(arr[j] < arr[j-1] && arr[j] < arr[j+1]){\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tif(arr[j] == arr[j+1] && arr[j] < arr[j-1] && arr[j+1] < arr[j+2]){\n\t\t\t\tcount1++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.printf(\""%d\"",count + count1 );\n\t}\n\n}",WRONG_ANSWER,604,26540
1591683737912619008,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-13 14:45:49,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main(){\n\tint n,i,j;\n\tscanf(\""%d\"",&n);\n\tint m;\n\tm=n;\n\tchar a[n];\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%c\"",&a[i]);\n\t}\n\ti=0;\n\twhile(i<n-1){\n\t\tif(a[i]==a[i+1])\t\n\t\ti++;\n\t\t\telse {\n\t\t\t\tn-=2;\n\t\t\tfor(j=i;j<n;j++){\n\t\t\t\ta[j]=a[j+2];\n\t\t\t}\n\t\t\ti=0;\n\t\t}\n\t\t}\n\tif(m==n) printf(\""0\\n\"");\n\telse\tprintf(\""%d\\n\"",m-n);\n}",TIME_LIMIT_EXCEEDED,437,660
1591683740274057216,6933dcb3592e2d6f6fc887ed9a5537aab21a30f76450c9b5043f7776bfc39a59,2022-11-13 14:45:50,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nint main(){\n    int n,i,j,temp;\n    scanf(\""%d\"",&n);\n    int high[n];\n    int x[n];\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&high[i]);\n    }\n    for(i=0;i<n;i++){\n        for(j=i,temp=0;j<n;j++){\n            temp++;\n            if(high[j+1]<high[i])\n                break;\n        }\n        x[i]=high[i]*temp;\n    }\n    sort(x,x+n);\n    printf(\""%d\"",x[n-1]);\n}",WRONG_ANSWER,16,356
1591683859979460608,630b8bfc88107b488e158fc7108c8faf0a195f9b9030c3faf51edac625714584,2022-11-13 14:46:18,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main(){\nint n,j=0,i,k=0,l;\nscanf(\""%d\"",&n);\nint h[n];\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&h[i]);\nfor(i=1;i<n+1;i++){\n    if(h[i]<h[i-1]) {l=i;break;}\n}\nif(l+1==n) printf(\""%d\"",k);\nelse{\nfor(i=l;i<n;i++){\n            j=i;\n        for(j;j<n-1;j++){\n            if(h[i]>=h[j+1]) continue;\n            else {k++;i=j+1;}\n        }\n    }\nprintf(\""%d\"",k);\n}\nreturn 0;\n}\n",WRONG_ANSWER,7,352
1591683868871372800,5d7d397496e2400ea10e8ecafd4566e19d1083215d66cad8e11230c22227362c,2022-11-13 14:46:21,C++,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <bits/stdc++.h>\n\nusing namespace std;\nconst int N=1e5+10;\nint n,l[N],res,x,y;\nchar ch[N];\nvoid solve()\n{\n    scanf(\""%d\"",&n);\n    getchar();\n    scanf(\""%s\"",ch);\n    x=0,y=0;\n    for(int i=0;i<strlen(ch);i++)\n    {\n        if(ch[i]=='1')x++;\n        else y++;\n    }\n    printf(\""%d\"",n-abs(x-y));\n}\nint main()\n{\n    solve();\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,426,724
1591683869886439424,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-13 14:46:21,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,j,count=0;\n    int hi[n];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n    scanf(\""%d\"",&hi[n]);}\n    hi[0]=0;\n    hi[n-1]=0;\n    for(j=1;j<n-1;j++){\n    if(hi[j+1]<hi[j])\n        count++;\n   }\n    printf(\""%d\"",count);\n    return 0;\n}\n",WRONG_ANSWER,4,372
1591683910013300736,73af9d5098be5d450fba728363c8fdbe0f6a5526466daa2f3b74abf1acf75527,2022-11-13 14:46:30,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int n,a,b;\n    int i=0;\n    int c[10000],F[10000];\n    long long int sum=0;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&c[i]);\n\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&F[i]);\n\n    }\n    \n    for(i=0;i<n;i++)\n    {\n        sum=sum+(c[i]/(F[i]+1))*(pow(a,F[i]+1 )-pow(b,F[i]+1 ));\n    }\n    printf(\""%lld\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,9,220
1591683932658348032,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-13 14:46:36,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main(){\n    int n,a[1000],count=0,i,j,t=0,c=1;\n      scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n     \n        \n    \n    for( j=1;j<n-1;j++)\n    {\n        \n        if(a[j]<a[j-1]&&a[j]<a[j+1])\n         count++;   \n             \n       else{\n        if(a[j]==a[j+1])\n        { c++;\n            continue;\n        }\n        else\n        if(a[j]<a[j+1]&&a[j]<a[j-c]) {count+=1;c=0;}\n      }\n        \n            \n    }\n    \n    \n \n    \n    printf(\""%d\\n\"",count);\n          \n}",WRONG_ANSWER,37,512
1591683954280030208,423e1acd0d02cf3d43f3c7805099dea4edcb39c2e0fa385e82823b5a7c0dd214,2022-11-13 14:46:41,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int c[10000];\n    int f[10000];\n    int n,a,b;\n    scanf(\""%d\"",&n);\n    scanf(\""%d\"",&a);\n    scanf(\""%d\"",&b);\n    int i;\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&c[i]);\n    }\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&f[i]);\n    }\n    int e=0;\n    int g=0;\n    int d=0;\n    int h;\n    for(i=0;i<n;i++){\n            h=pow(a,f[i]+1);\n        e=c[i]/(f[i]+1)*h+g;\n        g=e;\n    }\n    for(i=0;i<n;i++){\n        h=pow(b,f[i]+1);\n        e=c[i]*h/(f[i]+1)+d;\n        d=e;\n    }\n    printf(\""%d\\n\"",g-d);\n    return 0;\n}\n",WRONG_ANSWER,6,476
1591683970583257088,2bc6a85c0376656012a7970a7842a2a9d8769555a79ef4eec85ff45aa30ff7b7,2022-11-13 14:46:45,Java,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint num = sc.nextInt();\n\t\tint[] arr = new int[num];\n\t\tfor(int i = 0; i < num; ++i) {\n\t\t\tarr[i] = sc.nextInt();\n\t\t}\n\t\tif(num < 3) {\n\t\t\tSystem.out.print(step(num,arr));\n\t\t} else{\n\t\t\tSystem.out.print(Math.max(step(num-2,arr), step(num,arr)));\n\t\t}\n\t\t\n\t}\n\t\n\tpublic static int step(int n, int[] score) {\n\t\tint s = score[score.length - n] - 5;\n\t\tif(n==1) {\n\t\t\treturn s;\n\t\t}\n\t\tif(n == 2 || n == 3) {\n\t\t\treturn s + step(n-1, score);\n\t\t}\n\t\treturn Math.max(s + step(n-1, score), s + step(n-3, score));\n\t}\n}\n",TIME_LIMIT_EXCEEDED,400,48848
1591684006637494272,efa7a60e7fa0d7fd13e87b47555eb8bfc0c4da0695990711fb851b886de3de22,2022-11-13 14:46:53,C++,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,j;\n    int sum=0;\n    scanf(\""%d\"",&n);\n    int data[n];\n    int i;\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&data[i]);\n    }\n    for(j=1;j<n-2;j++){\n        if(data[j]<data[j+1]&&data[j]<=data[j-1]){\n            sum++;\n        }\n    }\n    printf(\""%d\\n\"",sum);\n    return 0;\n}",ACCEPTED,45,480
1591684018012446720,e7e6ce2c6e9e530eaf2b9b9968748a0e44e3ac7183d73deb51851946350bfbb0,2022-11-13 14:46:56,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    int flag=0;\n    int i;\n    int n,h[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++) {\n        scanf(\""%d\"",&h[i]);\n    }\n\n     for(i=1;i<n-1;i++) {\n\n\n        if(h[i]<h[i-1]&&h[i]<=h[i+i])\n            flag++;\n\n     }\n\n    printf(\""%d\"",flag);\n    return 0;\n}\n",WRONG_ANSWER,21,196
1591684030725369856,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-13 14:46:59,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<iostream>\nusing namespace std;\nclass resolve{\n    public:\n    void resve(int *h,int n){\n        int nums=0;\n        for(int i=1;i<n-1;i++){\n            if(h[i]<h[i-1]){\n                for(int j=i+1;j<n-1;j++){\n                    if(h[j]<h[j+1]){\n                        nums++;\n                        i=j+2;\n                    }   \n                }\n            }\n        }\n        cout<<nums<<endl;\n    }  \n};\n\nint main(){\n    int n,h[1000]={0};\n    cin>>n;\n    if(n<3)\n        return 0;\n    for(int i=0;i<n;i++){\n        cin>>h[i];\n    }\n    resolve res;\n    if(h[0]==0&&h[n-1]==0)\n        res.resve(h,n);\n    return 0;\n}",WRONG_ANSWER,7,328
1591684064611151872,9c773df96630087325d11d08f2dbc9851abb095c63fb7b3e55cb667898dfe23f,2022-11-13 14:47:07,C++,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <iostream>\n\nusing namespace std;\n\nconst int N = 10010;\n\nint n;\nint h[N];\n\nint main() {\n    cin >> n;\n    for (int i = 0; i < n; i++) {\n        cin >> h[i];\n    }\n\n    int ans = 0;\n    int mx = h[0], mn = h[0];\n    bool flag = false;\n    for (int i = 1; i < n; i++) {\n        if (!flag && mx <= h[i]) {\n            mx = h[i];\n        } else if (!flag) {\n            flag = true;\n            mn = h[i];\n        } else if (flag && mn >= h[i]) {\n            mn = h[i];\n        } else {\n            ans++;\n            mx = h[i];\n            flag = false;\n        }\n    }\n\n    cout << ans;\n    return 0;\n}\n",ACCEPTED,40,640
1591684104347987968,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-13 14:47:17,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<iostream>\nusing namespace std;\nclass resolve{\n    public:\n    void resve(int *h,int n){\n        int nums=0;\n        for(int i=1;i<n-1;i++){\n            if(h[i]<h[i-1]){\n                for(int j=i;j<n-1;j++){\n                    if(h[j]<h[j+1]){\n                        nums++;\n                        i=j+2;\n                    }   \n                }\n            }\n        }\n        cout<<nums<<endl;\n    }  \n};\n\nint main(){\n    int n,h[1000]={0};\n    cin>>n;\n    if(n<3)\n        return 0;\n    for(int i=0;i<n;i++){\n        cin>>h[i];\n    }\n    resolve res;\n    if(h[0]==0&&h[n-1]==0)\n        res.resve(h,n);\n    return 0;\n}",WRONG_ANSWER,7,480
1591684112698892288,27fbb32d960dbf49665c8905b68012d602eda68987686c6f224ec7b49ca3d0ac,2022-11-13 14:47:19,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint n,i,j,flog=0;\n\tscanf(\""%d\"",&n);\n\tint a[n],b[n];\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=0;i<n;i++)\n\t{\n\t\tfor(j=i;j<n;j++)\n\t\t{\n\t\t\tif(a[i]<=a[j])\n\t\t\t{\n\t\t\t\tflog++;\n\t\t\t}\n\t\t\telse\n\t\t\tbreak;\n\t\t}\n\t\tb[i]=a[i]*flog;\n\t\tflog=0;\n\t}\n\tint max=b[0];\n\tfor(i=1;i<n;i++)\n\t{\n\t\tif(max<b[i])\n\t\tmax=b[i];\n\t}\n\tprintf(\""%d\\n\"",max);\n\treturn 0;\n} ",WRONG_ANSWER,19,488
1591684156042797056,27fbb32d960dbf49665c8905b68012d602eda68987686c6f224ec7b49ca3d0ac,2022-11-13 14:47:29,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint n,i,flog=0;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=1;i<n-1;i++)\n\t{\n\t\tif(a[i]<a[i-1]&&a[i]<a[i+1])\n\t\t{\n\t\t  flog++;\n\t\t}\n\t\tif(a[i]<a[i-1]&&a[i]==a[i+1])\n\t\t{\n\t\t\tfor(int j=i+1;j<n-1;j++)\n\t\t\t{\n\t\t\t\tif(a[j]>a[i+1])\n\t\t\t\t{\n\t\t\t\t\n\t\t\t\tflog++;\n\t\t\t\tbreak;\n\t\t    \t}\n\t\t\t\t\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\""%d\\n\"",flog);\n\treturn 0;\n} ",ACCEPTED,36,384
1591684189689503744,0354b067c4132d4425a90b77482ac717447702274cb7db1282edce56eaf037b3,2022-11-13 14:47:37,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n,i,j,a[10000],ans,max;\n    scanf(\""%d\"",&n);\n    ans=0;\n    a[0]=0;\n    for(i=1;i<=n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++){\n    \tif(a[i+1]>a[i+3])\n    \t\tmax=i+1;\n    \telse\n    \t    max=i+3;\n\t\tans=a[max]+ans-5;\n\t\ti=max-1;\n\t}\n\tprintf(\""%d\"",ans);\n\treturn 0;\n} ",WRONG_ANSWER,9,368
1591684226708430848,7935e8f5cb04027f4d30ac84a997e2d03e946e112c1cb17f1a4f943d8b0b54bf,2022-11-13 14:47:46,C++,300.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <iostream>\n#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nint main()\n{\n    int n,i,j;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    int b[n+1];\n    fill(b,b+n,0);\n    for(i=1;i<n+1;i++)\n    {\n        if(i>2)\n            b[i]=max(b[i-1]+a[i-1]-5,b[i-3]+a[i-1]-5);\n        else\n            b[i]=b[i-1]+a[i-1]-5;\n    }\n    printf(\""%d\"",b[n]);\n    return 0;\n}\n",ACCEPTED,39,768
1591684303682330624,899c5501179552dc1fe5639f9047e15d0f835e7a87c8568193377882d0278985,2022-11-13 14:48:04,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,a[n],i,count=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if((a[i-1]>a[i])&&(a[i+1]>a[i]))\n            count+=1;\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",WRONG_ANSWER,5,320
1591684368647905280,7ecf54bf0ea2db8ab0397aa941f19ec79a351bc3e86e8c01673aa09a69b3a6db,2022-11-13 14:48:20,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n\tint n,l,max;\n\tscanf(\""%d\"",&n);\n\tint s[n];\n\t//录入\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&s[i]);\n\t}\n    max=s[0];\n\t//找最大矩形\n\tfor(int j=0;j<n;j++)\n\t{\n\t\tl = 1;\n\t\tfor(int k=j;k<n-1;k++)\n\t\t{\n            if(s[j]>s[k+1])break;\n\t\t\tl++;\n\t\t}\n\t\t//printf(\""%d %d\\n\"",s[j],l);\n        if(s[j]==1000000)\n        {\n            printf(\""%d\"",s[j]*l);\n            return 0;\n        }\n\t\tif(max<=s[j]*l)max=s[j]*l;\n\t}\n\t//打印结果\n\tprintf(\""%d\\n\"",max);\n}\n\n",WRONG_ANSWER,13,312
1591684396858748928,5d7d397496e2400ea10e8ecafd4566e19d1083215d66cad8e11230c22227362c,2022-11-13 14:48:26,C++,300.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <bits/stdc++.h>\n\nusing namespace std;\nconst int N=1e5+10;\nint n,l[N],res,x,y;\nchar ch[N];\nvoid solve()\n{\n    scanf(\""%d\"",&n);\n    getchar();\n    scanf(\""%s\"",ch);\n    int len=strlen(ch);\n    x=0,y=0;\n    for(int i=0;i<len;i++)\n    {\n        if(ch[i]=='1')x++;\n        else y++;\n    }\n    printf(\""%d\\n\"",n-abs(x-y));\n}\nint main()\n{\n    solve();\n    return 0;\n}\n",ACCEPTED,42,784
1591684423375183872,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 14:48:33,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n    int n,a[20];\n    int i,h=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=1;i<n-1;i++)\n    {\n        if(i<=n-2)\n            {if(a[i]>=a[i+1]||a[i+2]>=a[i+1])\n            h++;\n            }\n    }\n    h-=2;\n    printf(\""%d\\n\"",h);\n    return 0;\n}\n",WRONG_ANSWER,5,348
1591684424822185984,7e6a67f270e740aba8788a12d9a49939621a28d5059d3ced2247a86914b0a3b3,2022-11-13 14:48:33,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\tint n,a,b;\n\tint i;\n\tscanf(\""%d %d %d\"",&n,&a,&b);\n\t\n\tint C[n];\n\t\n\tfor(i=0;i<n;i++)\n\t\tscanf(\""%d\"",&C[i]);\n\t\t\n\tint F[n];\n\t\n\tfor(i=0;i<n;i++)\n\t\tscanf(\""%d\"",&F[i]);\n\t\n\tint sum1=0;\n\tfor(i=0;i<n;i++)\n\t{\n\t\tsum1+=((C[i]/(F[i]+1))*pow(a,F[i]+1));\n\t}\n\t\n\tint sum2=0;\n\tfor(i=0;i<n;i++)\n\t{\n\t\tsum2+=((C[i]/(F[i]+1))*pow(b,F[i]+1));\n\t}\n\t\n\tint sum=0;\n\tsum=sum1-sum2;\n\tprintf(\""%d\"",sum);\n}",WRONG_ANSWER,8,204
1591684448410984448,c47b15e117166a3dd00078b9f795673d5284a2761e582479119229751cc734d3,2022-11-13 14:48:39,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#define S 10000\n\n\nint main()\n{\n    int a=0,n,i;\n    int h[S];\n    scanf(\""%d\"",&n);\n    if(n>=3 && n<=10000)\n    {\n        for(i=0;i<n;i++)\n        scanf(\""%d\"",&h[i]);\n        if(h[0]==0 && h[n-1]==0)\n        {\n            for(i=0;i<n;i++)\n            {\n                if(h[i]>h[i+1])\n                a+=1;\n            }\n            printf(\""%d\"",a-1);\n            }\n        }\nprintf(\""\\n\"");\n\n    return 0;\n}\n\n",WRONG_ANSWER,6,352
1591684461455224832,27fbb32d960dbf49665c8905b68012d602eda68987686c6f224ec7b49ca3d0ac,2022-11-13 14:48:42,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint n,i,j,flog=0;\n\tscanf(\""%d\"",&n);\n\tint a[n],b[n];\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=0;i<n;i++)\n\t{\n\t\tfor(j=i;j<n;j++)\n\t\t{\n\t\t\tif(a[i]<=a[j])\n\t\t\t{\n\t\t\t\tflog++;\n\t\t\t}\n\t\t\telse\n            {\n\t\t\tbreak;\n            }\n\t\t}\n\t\tb[i]=a[i]*flog;\n\t\tflog=0;\n\t}\n\tint max=b[0];\n\tfor(i=1;i<n;i++)\n\t{\n\t\tif(max<b[i])\n        {\n\t\tmax=b[i];\n        }\n\t}\n\tprintf(\""%d\\n\"",max);\n\treturn 0;\n} ",WRONG_ANSWER,21,640
1591684520028725248,2bc6a85c0376656012a7970a7842a2a9d8769555a79ef4eec85ff45aa30ff7b7,2022-11-13 14:48:56,Java,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"import java.util.HashMap;\nimport java.util.Map;\nimport java.util.Scanner;\n\npublic class Main {\n\tstatic Map<Integer, Integer> map = new HashMap<>();\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint num = sc.nextInt();\n\t\tint[] arr = new int[num];\n\t\tfor(int i = 0; i < num; ++i) {\n\t\t\tarr[i] = sc.nextInt();\n\t\t}\n\t\tif(num < 3) {\n\t\t\tSystem.out.print(step(num,arr));\n\t\t} else{\n\t\t\tSystem.out.print(Math.max(step(num-2,arr), step(num,arr)));\n\t\t}\n\t\t\n\t}\n\t\n\tpublic static int step(int n, int[] score) {\n\t\tint s = score[score.length - n] - 5;\n\t\tif(n==1) {\n\t\t\treturn s;\n\t\t}\n\t\tif(n == 2 || n == 3) {\n\t\t\treturn s + step(n-1, score);\n\t\t}\n\t\tint a = Math.max(s + step(n-1, score), s + step(n-3, score));\n\t\tif(map.containsKey(n)) {\n\t\t\treturn map.get(n);\n\t\t} else {\n\t\t\tmap.put(n, a);\n\t\t\treturn a;\n\t\t}\n\t}\n}",TIME_LIMIT_EXCEEDED,400,49832
1591684584323211264,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-13 14:49:11,Python,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"a,b,c=map(int,input().split())\nA=[a,b,c]\nd=min(A)\nA.remove(min(A))\nprint(d+min(A))\n",ACCEPTED,97,3044
1591684603172380672,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-13 14:49:16,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n    int P,Q,R;\n    scanf(\""%d %d %d\"",&P,&Q,&R);\n    if(P+Q<Q+R)\n        printf(\""%d\"",P+Q);\n    else if(Q+R<P+R)\n        printf(\""%d\"",Q+R);\n    else\n        printf(\""%d\"",P+R);\n    return 0;\n}\n",ACCEPTED,27,348
1591684606372667392,630b8bfc88107b488e158fc7108c8faf0a195f9b9030c3faf51edac625714584,2022-11-13 14:49:16,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main(){\nint n,j=0,i,k=0,l;\nscanf(\""%d\"",&n);\nint h[n];\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&h[i]);\nfor(i=1;i<n+1;i++){\n    if(h[i]<h[i-1]) {l=i;break;}\n}\nif(l+1==n) printf(\""%d\"",k);\nelse{\n    i=l;\nfor(i;i<n;i++){\n            j=i;\n        for(j;j<n-1;j++){\n            if(h[i]>=h[j+1]) continue;\n            else {k++;i=j+2;}\n        }\n    }\nprintf(\""%d\"",k);\n}\nreturn 0;\n}\n",WRONG_ANSWER,11,196
1591684621228892160,c76414e1d2d8531a5745e9bd3192aafa7cca924e645650ffe7954c992cc13b33,2022-11-13 14:49:20,C,0.0,1591610585635213319,1591131955016622080,1049226928954454016,"        #include<stdio.h>\n        int main()\n        {\n        int i,j,t,x,y,f;\n        int min;\n        scanf(\""%d\"",&t);\n        int a[t];\n        for(i=0;i<t;i++)\n            {\n            int flag=0;\n            scanf(\""%d\"",&a[t]);\n            if(a[t]==1)\n                printf(\""0\\n\"");\n            else{int b[a[t]];\n            for(j=0;j<a[t];j++)\n\n                scanf(\""%d\"",&b[t]);\n                    min=b[0];\n                     for(j=1;j<a[t];j++)\n                        if(b[j]>=2*min)\n                        flag=flag+b[j]/2*min;\n                 printf(\""%d\"",flag);\n                }\n\n            }\n        }\n",WRONG_ANSWER,8,476
1591684629579751424,6ba5ecacf3381a1e9382f99c413290eca40a071a563a618e5f36d66cbf9a5e1b,2022-11-13 14:49:22,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<iostream>\n#include<math.h>\nusing namespace std;\n\nint main(){\nint n,a,b;\ncin>>n>>a>>b;\nint c[n];\nint f[n];\nfor(int i=0;i<n;i++){\n    cin>>c[i];\n   // cout<<c[i]<<endl;\n}\nfor(int i=0;i<n;i++){\n    cin>>f[i];\n   // cout<<f[i]<<endl;\n}\nfloat sum=0;\nfor(int i=0;i<n;i++){\n    long k=1;\n        for(int j=0;j<f[i]+1;j++)\n            k*=a;\n   // cout<<k<<endl;\n    //cout<<float(c[i]/(f[i]+1))<<endl;\n   sum+=float(c[i]/(f[i]+1))*k;\n  // cout<<sum<<endl;\n}\nfor(int i=0;i<n;i++){\n        long k=1;\n        for(int j=0;j<f[i]+1;j++)\n            k*=b;\n//cout<<k<<endl;\n   // cout<<float(c[i]/(f[i]+1))<<endl;\n   sum=sum-float(c[i]/(f[i]+1))*k;\n   //cout<<sum<<endl;\n}\ncout<<sum<<endl;\n}\n",WRONG_ANSWER,11,456
1591684634659053568,5bd1a8718ea7fb820055421c67b8e0a468e08d951f729a24e55bf407b3bdb1f6,2022-11-13 14:49:23,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <iostream>\n#include <vector>\n#include <stdio.h>\n#include<math.h>\n\nusing namespace std;\n\n\n\nint getret(int c,int f,int x){\n    if(f==-1)\n        return int(c*log(x));\n    return (c/(f+1))*pow(x,f+1);\n}\n\n\nint main()\n{\n\n    int n,a,b;\n    cin>>n>>a>>b;\n\n    vector<int> c(n);\n    vector<int> f(n);\n    for(int i=0;i<n;i++){\n        cin>>c[i];\n        }\n    for(int j=0;j<n;j++){\n        cin>>f[j];\n        }\n\n\n    int sum1=0,sum2=0;\n\n    for(int k=0;k<n;k++)\n    {\n        sum1+=getret(c[k],f[k],a);\n        sum2+=getret(c[k],f[k],b);\n    }\n    cout<<sum1-sum2;\n    return 0;\n}\n",WRONG_ANSWER,7,612
1591684669404635136,e7e6ce2c6e9e530eaf2b9b9968748a0e44e3ac7183d73deb51851946350bfbb0,2022-11-13 14:49:31,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    int flag=0;\n    int i;\n    int n,h[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++) {\n        scanf(\""%d\"",&h[i]);\n    }\n\n     for(i=1;i<n;i++) {\n\n\n        if(h[i]<h[i-1]&&h[i]<=h[i+i])\n            flag++;\n\n     }\n\n    printf(\""%d\"",flag);\n    return 0;\n}\n",WRONG_ANSWER,5,196
1591684682369261568,d122b81a371b28751082747cf65a235d0eddfd496e142775cd971d8f88adf327,2022-11-13 14:49:35,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int min=0;\n    int x,y,z;\n scanf(\""%d%d%d\"",&x,&y,&z)；\n    min=x+y;\n    if(x+z<=min&&x+z>min){\n        min=x+z;\n        printf(\""%d\\n\"",min);\n    }\n    if(y+z<=min&&x+z>min){\n        min=y+z;\n        printf(\""%d\\n\"",min);\n    }\n    if(y+z>min&&x+z>min){\n        printf(\""%d\\n\"",min);\n    \n }                                        \n    return 0;\n                                \n}",COMPILE_ERROR,0,0
1591684736295383040,423e1acd0d02cf3d43f3c7805099dea4edcb39c2e0fa385e82823b5a7c0dd214,2022-11-13 14:49:47,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int c[1000000];\n    int f[1000000];\n    int n,a,b;\n    scanf(\""%d\"",&n);\n    scanf(\""%d\"",&a);\n    scanf(\""%d\"",&b);\n    int i;\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&c[i]);\n    }\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&f[i]);\n    }\n    int e=0;\n    int g=0;\n    int d=0;\n    int h;\n    for(i=0;i<n;i++){\n            h=pow(a,f[i]+1);\n        e=c[i]/(f[i]+1)*h+g;\n        g=e;\n    }\n    for(i=0;i<n;i++){\n        h=pow(b,f[i]+1);\n        e=c[i]*h/(f[i]+1)+d;\n        d=e;\n    }\n    printf(\""%d\\n\"",g-d);\n    return 0;\n}\n",WRONG_ANSWER,9,484
1591684737209741312,e7e6ce2c6e9e530eaf2b9b9968748a0e44e3ac7183d73deb51851946350bfbb0,2022-11-13 14:49:48,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    int flag=0;\n    int i;\n    int n,h[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++) {\n        scanf(\""%d\"",&h[i]);\n    }\n\n     for(i=0;i<n;i++) {\n\n\n        if(h[i]<h[i-1]&&h[i]<=h[i+i])\n            flag++;\n\n     }\n\n    printf(\""%d\"",flag);\n    return 0;\n}\n",WRONG_ANSWER,5,360
1591684768717398016,e7e6ce2c6e9e530eaf2b9b9968748a0e44e3ac7183d73deb51851946350bfbb0,2022-11-13 14:49:55,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    int flag=0;\n    int i;\n    int n,h[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++) {\n        scanf(\""%d\"",&h[i]);\n    }\n\n     for(i=0;i<n-1;i++) {\n\n\n        if(h[i]<h[i-1]&&h[i]<=h[i+i])\n            flag++;\n\n     }\n\n    printf(\""%d\"",flag);\n    return 0;\n}\n",WRONG_ANSWER,21,512
1591684779026997248,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-13 14:49:58,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<iostream>\nusing namespace std;\nclass resolve{\n    public:\n    void resve(int *h,int n){\n        int nums=0;\n        for(int i=1;i<n-1;i++){\n            if(h[i]<h[i-1]){\n                for(int j=i;j<n-1;j++){\n                    if(h[j]<h[j+1]){\n                        nums++;\n                        i=j+2;\n                        continue;\n                    }   \n                }\n            }\n        }\n        cout<<nums<<endl;\n    }  \n};\n\nint main(){\n    int n,h[1000]={0};\n    cin>>n;\n    if(n<3)\n        return 0;\n    for(int i=0;i<n;i++){\n        cin>>h[i];\n    }\n    resolve res;\n    if(h[0]==0&&h[n-1]==0)\n        res.resve(h,n);\n    return 0;\n}",WRONG_ANSWER,11,488
1591684798245253120,e7e6ce2c6e9e530eaf2b9b9968748a0e44e3ac7183d73deb51851946350bfbb0,2022-11-13 14:50:02,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    int flag=0;\n    int i;\n    int n,h[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++) {\n        scanf(\""%d\"",&h[i]);\n    }\n\n     for(i=1;i<n-1;i++) {\n\n\n        if(h[i]<h[i-1]&&h[i]<=h[i+i])\n            flag++;\n\n     }\n\n    printf(\""%d\"",flag);\n    return 0;\n}\n",WRONG_ANSWER,27,324
1591684851227701248,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-13 14:50:15,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n,sum=0;\n    scanf(\""%d\"",&n);\n    int a[n],i,j;\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n     for(i=1;i<n-1;i++){\n        if(a[i]<a[i-1]){\n        \tfor(j=i;j<n;j++)\n        \tif(a[j]>=a[j+1]&&a[j]>a[j-1])\n        \t{\n        \t\tsum++;\n        \t\ti=j;\n        \t\tbreak;\n\t\t\t}\n\t\t\telse continue;\n\t\t}\n     }\n   printf(\""%d\\n\"",sum);\n    \n}",ACCEPTED,30,512
1591684856084750336,6a4a105e99255cc39ebb6a122c9fdf740e574dbb708100363b339265f92e1bbf,2022-11-13 14:50:16,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n,i,x;\n    scanf(\""%d\"",&n);\n    int A[n]={0};\n    for(i=1;i<=n;i++){\n        scanf(\""%d\"",&A[i]);\n    }\n    for(i=2;i<=n;i++){\n    for(x=0;x<i;){\n            if(A[i+1]<A[i]){\n                x++;\n            }\n        }\n    }\n    printf(\""%d\"",x);\n}",COMPILE_ERROR,0,0
1591684871423320064,27fbb32d960dbf49665c8905b68012d602eda68987686c6f224ec7b49ca3d0ac,2022-11-13 14:50:20,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint n,i,j,flog=0;\n\tscanf(\""%d\"",&n);\n\tint a[n],b[n];\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=1;i<n-1;i++)\n\t{\n\t\tfor(j=i;j<n-1;j++)\n\t\t{\n\t\t\tif(a[i]<=a[j])\n\t\t\t{\n\t\t\t\tflog++;\n\t\t\t}\n\t\t\telse\n            {\n\t\t\tbreak;\n            }\n\t\t}\n\t\tb[i]=a[i]*flog;\n\t\tflog=0;\n\t}\n\tint max=b[1];\n\tfor(i=1;i<n-1;i++)\n\t{\n\t\tif(max<b[i])\n        {\n\t\tmax=b[i];\n        }\n\t}\n\tprintf(\""%d\\n\"",max);\n\treturn 0;\n} ",WRONG_ANSWER,17,212
1591685116718755840,5a1c17b308a3b3595833d34c6bdfb75e9f5dd0d065acfeb7f28ab8102ba7406c,2022-11-13 14:51:18,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int n,a,b,i,j;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    double sum1 = 0;\n    double sum2 = 0;\n    double sum;\n    int c[n],f[n];\n    if(n==0){\n        sum = a - b;\n    }else{\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&c[i]);\n    }\n\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&f[i]);\n    }\n    for(j=0;j<n;j++){\n        double x = c[j]/(f[j]+1)*pow(a,f[j]+1);\n        sum1+=x;\n    }\n    for(j=0;j<n;j++){\n        double y = c[j]/(f[j]+1)*pow(b,f[j]+1);\n        sum2+=y;\n    }\n    sum = sum1 - sum2;\n    }\n    printf(\""%.0lf\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,6,204
1591685173849370624,d4c94290401b65ee2ce02056ca325b624120f06a8f67557b729453a418b199fe,2022-11-13 14:51:32,C++,0.0,1591610585635213313,1589906790446387200,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nconst int N=1e5;\n\nint n,count1=0,a[N],t,x,y,sum=0x7fffffff,z;\nstring str;\nint main(){\n\tcin>>t;\n\twhile(t--){\n\t\tcin>>n;\n\t\tcount1=0;\n\t\tsum=0x7fffffff;\n\t\tfor(int i=1;i<=n;i++){\n\t\t\tcin>>a[i];\n\t\t}\n\t\tsort(a+1,a+n+1);\n\t\tfor(int i=2;i<=n-1;i++){\n\t\t\tx=a[i]-a[1];\n\t\t\ty=a[n]-a[i];\n\t\t\tz=abs(x-y);\n\t\t\tif(sum>z){\n\t\t\t\tcount1=max(x,y);\n\t\t\t}\n\t\t}\n\t\tcout<<a[n]-a[1]+count1<<endl;\n\t\tmemset(a,0,sizeof 0);\n\t}\n} ",WRONG_ANSWER,30,604
1591685180312838144,899c5501179552dc1fe5639f9047e15d0f835e7a87c8568193377882d0278985,2022-11-13 14:51:33,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,i,count=0;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if((a[i-1]>a[i])&&(a[i+1]>a[i]))\n            count+=1;\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",WRONG_ANSWER,6,504
1591685230321479680,ef50cfe7f34b26d29f617c97ac65d40bd15ba1e063897a190284243de955e254,2022-11-13 14:51:45,Java,300.0,1591610585635213318,1591131464941563904,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner sc=new Scanner(System.in);\n\t\tint p=sc.nextInt();\n\t\tint q=sc.nextInt();\n\t\tint r=sc.nextInt();\n\t\tint sum = 0;\n\t\tif(p>=q&p>=r) sum=q+r;\n\t\telse if(q>=p&q>=r) sum=p+r;\n\t\telse if(r>=q&r>=p) sum=q+p;\n\t\tSystem.out.println(sum);\n\t}\n\n},ACCEPTED,535,25268
1591685236478730240,6ba5ecacf3381a1e9382f99c413290eca40a071a563a618e5f36d66cbf9a5e1b,2022-11-13 14:51:47,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<iostream>\n#include<math.h>\nusing namespace std;\n\nint main(){\nint n,a,b;\ncin>>n>>a>>b;\nint c[n];\nint f[n];\nfor(int i=0;i<n;i++){\n    cin>>c[i];\n   // cout<<c[i]<<endl;\n}\nfor(int i=0;i<n;i++){\n    cin>>f[i];\n   // cout<<f[i]<<endl;\n}\nfloat sum=0;\nfor(int i=0;i<n;i++){\n    long k=1;\n        for(int j=0;j<f[i]+1;j++)\n            k*=a;\n   // cout<<k<<endl;\n    //cout<<float(c[i]/(f[i]+1))<<endl;\n   sum+=float(c[i]/(f[i]+1))*k;\n  // cout<<sum<<endl;\n}\nfor(int i=0;i<n;i++){\n        long k=1;\n        for(int j=0;j<f[i]+1;j++)\n            k*=b;\n//cout<<k<<endl;\n   // cout<<float(c[i]/(f[i]+1))<<endl;\n   sum=sum-float(c[i]/(f[i]+1))*k;\n   //cout<<sum<<endl;\n}\ncout<<int(sum)<<endl;\n}\n",WRONG_ANSWER,16,476
1591685278430191616,acf80eea856463058b81f71c0238069795893092293fbd098cc594959df6444e,2022-11-13 14:51:57,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,n=int(input())\ns=str(input())\nx=0\ny=0\nfor i in s:\n    if int(i)==1:\n        y+=1\n    else:\n        x+=1\nc=abs(x+y)\nprint(c)\n        \n\n\n\n\n\n\n\n,WRONG_ANSWER,20,2836
1591685298428633088,281adcca8943f9f4c0ced14f1ceffe157a34fca39f3cb864eb95e400944e38a8,2022-11-13 14:52:01,Java,300.0,1591610585635213317,1591130976212869120,1049226928954454016,"\nimport java.awt.List;\nimport java.lang.reflect.Array;\nimport java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner scan=new Scanner(System.in);\n\t\tint n=scan.nextInt();\n\t\tint a=scan.nextInt();\n\t\tint b=scan.nextInt();\n\t\tint[] c=new int[n];\n\t\tint[] f=new int[n];\n\t\tfor(int i=0;i<n;i++){\n\t\t\tc[i]=scan.nextInt();\n\t\t}\n\t\tfor(int i=0;i<n;i++){\n\t\t\tf[i]=scan.nextInt();\n\t\t}\n\t\tint anser=0;\n\t\tanser=sub(n, c, f, a)-sub(n, c, f,b);\n\t\n\t\tSystem.out.print(anser);\n\t}\n\tpublic static int sub(int n,int[] c,int[] f,int a){\n\t\tint ans=0;\n\t\tint b=0;\n\t\tboolean flag=true;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tif(((c[i]*Math.pow(a, f[i]+1))%(f[i]+1)!=0)&&flag==true){\n\t\t\t\tb=(int) (c[i]*Math.pow(a, f[i]+1))/(f[i]+1)+1;\n\t\t\t\tflag=false;\n\t\t\t}\n\t\t\telse{\n\t\t\t\tb=(int) (c[i]*Math.pow(a, f[i]+1))/(f[i]+1);\n\t\t\t}\n\t\tans+=b;\n\t\t}\n\t\treturn ans;\n\t}\n\n}\n",ACCEPTED,525,25028
1591685299200352256,172db3e4a89a3dc038ec44e9346ef3138ace8cc1576eb636ccaf26fd91d7a145,2022-11-13 14:52:02,C++,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <algorithm>\n\nusing namespace std;\ntypedef long long ll;\nconst int N = 1e5 + 10;\nll a[N]; \n\nint main(){\n\tint n;\n\tscanf(\""%d\"",&n);\n\tfor(int i=1;i<=n;i++) {\n\t\tscanf(\""%lld\"",&a[i]);\n\t//\ta[i] -= 5;\n\t}\n\tfor(int i=1;i<=n;i++) {\n\t\tif(a[i] < 3) a[i] += a[i-1] - 5;\n\t\telse a[i] += max(a[i-1],a[i-3]) - 5;\n\t}\n\tprintf(\""%lld\"",a[n]);\n\treturn 0;\n}",WRONG_ANSWER,7,456
1591685321388253184,27fbb32d960dbf49665c8905b68012d602eda68987686c6f224ec7b49ca3d0ac,2022-11-13 14:52:07,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint n,i,j,flog=0;\n\tscanf(\""%d\"",&n);\n\tint a[n],b[n];\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=0;i<n;i++)\n\t{\n\t\tfor(j=i;j<n;j++)\n\t\t{\n\t\t\tif(a[i]<=a[j])\n\t\t\t{\n\t\t\t\tflog++;\n\t\t\t}\n\t\t\telse\n            {\n\t\t\tbreak;\n            }\n\t\t}\n\t\tb[i]=a[i]*flog;\n\t\tflog=0;\n\t}\n\tint max=b[0];\n\tfor(i=0;i<n;i++)\n\t{\n\t\tif(max<b[i])\n        {\n\t\tmax=b[i];\n        }\n\t}\n\tprintf(\""%d\\n\"",max);\n\treturn 0;\n} ",WRONG_ANSWER,19,348
1591685333383929856,458af3c005e0b282d1ca88c254d9910ee2d93738b6f06d399f7444e1e64831eb,2022-11-13 14:52:10,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b,c,i;\n    scanf(\""%d%d%d\"",&a,&b,&c);\n    int d,e,f;\n    d=a+b;\n    e=b+c;\n    f=c+a;\n    int q[3],max;\n    q[0]=d;\n    q[1]=e;\n    q[2]=f;\n    max=q[0];\n    for(i=1;i<3;i++){\n        if(q[i]<max) max=q[i];\n    }\n    printf(\""%d\"",max);\n    return 0;\n}\n\n",ACCEPTED,47,344
1591685364455366656,105cc8c0a5a465ab713603b461d92ac587c87767965625687540cd513f7ebb57,2022-11-13 14:52:17,C++,300.0,1591610585635213319,1591131955016622080,1049226928954454016,"#include<bits/stdc++.h>\n#define N 100005\n#define endl '\\n'\n#define int long long\n#define ios ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)\nusing namespace std;\n\nint dfs(int n,int t){\n\tif(n<t)\n\t\treturn 0;\n\tif(n==t)\n\t\treturn 1;\n\treturn 1+dfs(t-1,t)+dfs(n-t+1,t);\n}\n\nvoid solve(){\n\tint n;\n\tint res=0;\n\tint nums[N];\n\tcin>>n;\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tcin>>nums[i];\n\t}\n\tsort(nums,nums+n);\n\tint t=nums[0]*2;\n\tfor(int i=1;i<n;i++)\n\t{\n\t\tres+=dfs(nums[i],t);\n\t}\n\tcout<<res<<endl;\n}\nsigned main() {\n\tios;\n\tint count;\n\tcin>>count;\n\twhile(count--)\n\t{\n\t\tsolve();\n\t}\n\treturn 0;\n}\n",ACCEPTED,51,616
1591685378460114944,e7e6ce2c6e9e530eaf2b9b9968748a0e44e3ac7183d73deb51851946350bfbb0,2022-11-13 14:52:20,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    int flag=0;\n    int i;\n    int n,h[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++) {\n        scanf(\""%d\"",&h[i]);\n    }\n\n     for(i=1;i<n-1;i++) {\n\n\n        if(h[i]<h[i-1]&&h[i]<=h[i+1])\n            flag++;\n\n     }\n\n    printf(\""%d\"",flag);\n    return 0;\n}\n",RUNTIME_ERROR,28,332
1591685432382074880,e7e6ce2c6e9e530eaf2b9b9968748a0e44e3ac7183d73deb51851946350bfbb0,2022-11-13 14:52:33,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    int flag=0;\n    int i;\n    int n,h[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++) {\n        scanf(\""%d\"",&h[i]);\n    }\n\n     for(i=0;i<n;i++) {\n\n\n        if(h[i]<h[i-1]&&h[i]<=h[i+1])\n            flag++;\n\n     }\n\n    printf(\""%d\"",flag);\n    return 0;\n}\n",WRONG_ANSWER,6,352
1591685446483337216,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-13 14:52:37,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,j,count=0;\n    int hi[n];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n    scanf(\""%d\"",&hi[n]);}\n    hi[0]=0;\n    hi[n-1]=0;\n    for(j=0;j<n-1;j++){\n    if(hi[j+1]<hi[j])\n        count++;\n   }\n    printf(\""%d\"",count);\n    return 0;\n}\n",WRONG_ANSWER,5,196
1591685448517574656,acf80eea856463058b81f71c0238069795893092293fbd098cc594959df6444e,2022-11-13 14:52:37,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,n=int(input())\ns=str(input())\nx=0\ny=0\nfor i in s:\n    if int(i)==1:\n        y+=1\n    else:\n        x+=1\nc=abs(x-y)\nprint(c)\n        \n\n\n\n\n\n\n\n,WRONG_ANSWER,18,2816
1591685448563744768,d830b0bcae7881ad6d1b2e2b14f3ffa3695b6d3bd622856493fa1cf903c9bf4e,2022-11-13 14:52:37,Java,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"import java.util.Scanner;\n\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tint[] arr1 = new int[n];\n\t\tint[] arr2 = new int[n];\n        int res1=0;\n        int res2=0;\n\t\tfor(int i=0;i<arr1.length;i++){\n\t\t\tarr1[i]=sc.nextInt();\n\t\t\t\n\t\t}\n\t\tfor(int i=0;i<arr2.length;i++){\n\t\t\tarr2[i]=sc.nextInt();\n\t\t\n\t\t}\n\t\tfor(int i=0;i<n;i++){\n\t\t\tres1+=(arr1[i]/(arr2[i]+1))*(Math.pow(a,arr2[i]+1));\n\t\t}\n\t\tfor(int i=0;i<n;i++){\n\t\t\tres2+=(arr1[i]/(arr2[i]+1))*(Math.pow(b,arr2[i]+1));\n\t\t}\n\t\tint res=res1-res2;\n\t\tSystem.out.print(res);\n\t}\n}",WRONG_ANSWER,113,24276
1591685465340960768,2e4af98c441106efa9ee51f8a781d0eee91a3dff6193987d421eb3a48725c814,2022-11-13 14:52:41,C++,0.0,1591610585635213319,1591131955016622080,1049226928954454016,"#include <iostream>\n\nint main(){\n\tint n;\n\tscanf(\""%d\"",&n);\n\tfor(int i =0;i<n;i++){\n\t\tint num;\n\t\tscanf(\""%d\"",&num);\n\t\tint *arr = new int[num];\n\t\tfor(int j =0;j<num;j++){\n\t\t\tscanf(\""%d\"",&arr[j]);\n\t\t}\n\t}\n\tprintf(\""10\\n0\\n4\"");\n\t\n\t\n}\n\n",WRONG_ANSWER,6,348
1591685465911386112,b31601c92a4a3080abbaad650e00bb77253224eab66b59a49b2118d017649c2c,2022-11-13 14:52:41,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b,c,d,e,f,g,h,i,j,k;\n    j=0;\n    scanf(\""%d/n\"",a);\n    e=a/3;\n    k=a%3;\n    for(f=1;f<=e;f++){\n        scanf(\""%d%d%d\"",&b,&c,&d);\n        h = b+c-10;\n        i = d-5;\n        if(h>=i){\n            j=j+h;\n        }\n        else{\n            j=j+i;\n        }\n    }\n    if(k=2){\n    scanf(\""%d%d\"",&b,&c);\n    j=j+b+c-10;\n    }\n    if(k11=1){\n    scanf(\""%d\"",&b);\n    j=j+b-5;\n    }\n    printf(\""%d\"",j);\n\n\n    return 0;\n}",COMPILE_ERROR,0,0
1591685492465479680,c5cc6f9845df4bd1986af86c0696296436bbc0f00a10a9f891b4100e57bc3a19,2022-11-13 14:52:48,C++,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tint n,sum=0;\n\tcin>>n;\n\tint f[n],flag[n];\n\tfor(int i=0;i<n;i++) cin>>f[i];\n\tfor(int i=1;i<n;i++){\n\t\tif(f[i]>f[i-1]) flag[i]=1;\n\t\telse flag[i]=0;\n\t}\n\tfor(int i=1;i<n;i++) {\n\t\tif(flag[i]==0&&flag[i+1]==1) \n\t\t{\n\t\t\tsum++;\n\t\t}\n\t}\n\tcout<<sum<<endl;\n}\n",ACCEPTED,51,608
1591685501743280128,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 14:52:50,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int i,j,k;\n    int n;\n    int sum=0;\n    int max=0;\n    int t=0;\n    scanf(\""%d\"",&n;)\n        int a[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        for(j=0;j<n-1;j++)\n        {\n            if(a[i]<=a[i+j])\n                t=t+1;\n            else\n                break;\n        }\n        for(k=1;k<=i;k++)\n        {\n            if(a[i]<=a[a[i-k]])\n                t=t+1;\n            else\n                break;\n        }\n        sum=a[i]*t;\n        if(sum>max)\n            max=sum;\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",COMPILE_ERROR,0,0
1591685510752690176,2e4af98c441106efa9ee51f8a781d0eee91a3dff6193987d421eb3a48725c814,2022-11-13 14:52:52,C++,0.0,1591610585635213319,1591131955016622080,1049226928954454016,"#include <iostream>\n\nint main(){\n\tint n;\n\tscanf(\""%d\"",&n);\n\tfor(int i =0;i<n;i++){\n\t\tint num;\n\t\tscanf(\""%d\"",&num);\n\t\tint *arr = new int[num];\n\t\tfor(int j =0;j<num;j++){\n\t\t\tscanf(\""%d\"",&arr[j]);\n\t\t}\n\t}\n\tprintf(\""10\\n0\\n4\"");\n}\n\n",WRONG_ANSWER,6,460
1591685516872146944,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 14:52:53,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int i,j,k;\n    int n;\n    int sum=0;\n    int max=0;\n    int t=0;\n    scanf(\""%d\"",&n;)\n        int a[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        for(j=0;j<n-1;j++)\n        {\n            if(a[i]<=a[i+j])\n                t=t+1;\n            else\n                break;\n        }\n        for(k=1;k<=i;k++)\n        {\n            if(a[i]<=a[a[i-k]])\n                t=t+1;\n            else\n                break;\n        }\n        sum=a[i]*t;\n        if(sum>max)\n            max=sum;\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",COMPILE_ERROR,0,0
1591685543992516608,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-11-13 14:53:00,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#define N 10000\nint main()\n{\n    int i,j,n;\n    int a[N]={0};\n    int count=0;\n    scanf(\""%d\"",&n);\n    if(n<3)\n        return 0;\n    else\n    {\n        for(i=0;i<n;i++)\n            scanf(\""%d\"",&a[i]);\n        for(i=1;i<n-1;i++)\n        {\n            for(j=i+2;j<n-1;j++)\n            {\n                if(a[i]>a[i+1]&&a[j]>a[i+1])\n                {\n                    count++;\n                    i++;\n                    continue;\n                }\n            }\n        }\n        printf(\""%d\\n\"",count);\n        return 0;\n    }\n}",WRONG_ANSWER,10,368
1591685560153169920,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 14:53:04,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int i,j,k;\n    int n;\n    int sum=0;\n    int max=0;\n    int t=0;\n    scanf(\""%d\"",&n);\n        int a[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        for(j=0;j<n-1;j++)\n        {\n            if(a[i]<=a[i+j])\n                t=t+1;\n            else\n                break;\n        }\n        for(k=1;k<=i;k++)\n        {\n            if(a[i]<=a[a[i-k]])\n                t=t+1;\n            else\n                break;\n        }\n        sum=a[i]*t;\n        if(sum>max)\n            max=sum;\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",WRONG_ANSWER,4,196
1591685562799808512,27fbb32d960dbf49665c8905b68012d602eda68987686c6f224ec7b49ca3d0ac,2022-11-13 14:53:04,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint n,i,j,flog=0;\n\tscanf(\""%d\"",&n);\n\tint a[n],b[n];\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=0;i<n;i++)\n\t{\n\t\tfor(j=i;j<n;j++)\n\t\t{\n\t\t\tif(a[i]<=a[j])\n\t\t\t{\n\t\t\t\tflog++;\n\t\t\t}\n\t\t\telse\n            {\n\t\t\tbreak;\n            }\n\t\t}\n\t\tb[i]=a[i]*flog;\n\t\tflog=0;\n\t}\n\tint max=b[0];\n\tfor(i=0;i<n;i++)\n\t{\n\t\tif(max<b[i])\n        {\n\t\tmax=b[i];\n        }\n\t}\n\tprintf(\""%d\\n\"",max);\n\treturn 0;\n} ",WRONG_ANSWER,15,348
1591685577744068608,e7e6ce2c6e9e530eaf2b9b9968748a0e44e3ac7183d73deb51851946350bfbb0,2022-11-13 14:53:08,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    int flag=0;\n    int i;\n    int n,h[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++) {\n        scanf(\""%d\"",&h[i]);\n    }\n\n     for(i=1;i<n;i++) {\n\n\n        if(h[i]<h[i-1]&&h[i]<=h[i+1])\n            flag++;\n\n     }\n\n    printf(\""%d\"",flag);\n    return 0;\n}\n",WRONG_ANSWER,6,200
1591685670245261312,b31601c92a4a3080abbaad650e00bb77253224eab66b59a49b2118d017649c2c,2022-11-13 14:53:30,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b,c,d,e,f,g,h,i,j,k;\n    j=0;\n    scanf(\""%d/n\"",a);\n    e=a/3;\n    k=a%3;\n    for(f=1;f<=e;f++){\n        scanf(\""%d%d%d\"",&b,&c,&d);\n        h = b+c-10;\n        i = d-5;\n        if(h>=i){\n            j=j+h;\n        }\n        else{\n            j=j+i;\n        }\n    }\n    if(k=2){\n    scanf(\""%d%d\"",&b,&c);\n    j=j+b+c-10;\n    }\n    if(k=1){\n    scanf(\""%d\"",&b);\n    j=j+b-5;\n    }\n    printf(\""%d\"",j);\n\n\n    return 0;\n}",SEGMENTATION_FAULT,5,348
1591685686821183488,902d8082eea06043d392298983db4630cde4418ac8ee42282d537bfaae045c2f,2022-11-13 14:53:34,Python,300.0,1591610585635213312,1589816514637750272,1049226928954454016,"b=eval(input())\na=list(input())\nn=0\nm=0\nfor i in range(b):\n    if a[i]==\""0\"":\n        n=n+1\n    else:\n        m=m+1\nif n<m:\n    print(2*n)\nelse:\n    print(2*m)",ACCEPTED,112,3840
1591685758615085056,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 14:53:51,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n    int n,a[20];\n    int i,h=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=1;i<n-1;i++)\n    {\n        if(i<=n-4)\n            {if(a[i]>=a[i+1]||a[i+2]>=a[i+1])\n            h++;\n            if(a[i+1]==a[i+2])\n                h-=1;\n            }\n    }\n    printf(\""%d\\n\"",h);\n    return 0;\n}",WRONG_ANSWER,12,348
1591685804521697280,abe2744e33bb397ffb9bb13afcb202f611378fb4fc5801202f03933298ce5f5d,2022-11-13 14:54:02,Java,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\npublic static void main(String[] args) throws IOException{\n\tBufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n\t\n\tString[] string = reader.readLine().split(\"" \"");\n\tint[] ints=new int[3];\n\t\n\tfor(int i=0;i<3;i++){\n\t\tints[i]=Integer.valueOf(string[i]);\n\t\n\t}\n\tint n=ints[0];\n\tint a=ints[1];\n\tint b=ints[2];\n\t\n\tint[] c=new int[n];\n\tstring = reader.readLine().split(\"" \"");\n\tfor(int i=0;i<n;i++){\n\t\tc[i]=Integer.valueOf(string[i]);\n\t\t\n\t}\n\tint[] point=new int[n];\n\tstring = reader.readLine().split(\"" \"");\n\tfor(int i=0;i<n;i++){\n\t\tpoint[i]=Integer.valueOf(string[i]);\n\t\t\n\t}\n\tint left=0;\n\tint right=0;\n\t\n\t\n\t\tfor(int j=0;j<n;j++){\n\t\t\tleft+=(c[j]/(point[j]+1))*Math.pow(a, point[j]+1);\n\t\t\tright+=c[j]/(point[j]+1)*Math.pow(b, point[j]+1);\n\t\t\t\n\t\t}\n\t\tSystem.out.println(left-right);\n\t\t\n\n}\n}\n",WRONG_ANSWER,64,22372
1591685809697513472,7ecf54bf0ea2db8ab0397aa941f19ec79a351bc3e86e8c01673aa09a69b3a6db,2022-11-13 14:54:03,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n\tint n,l,max;\n\tscanf(\""%d\"",&n);\n\tint s[n];\n\t//录入\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&s[i]);\n\t}\n    max=s[0];\n\t//找最大矩形\n\tfor(int j=0;j<n;j++)\n\t{\n\t\tl = 1;\n\t\tfor(int k=j;k<n-1;k++)\n\t\t{\n            if(s[j]>s[k+1])break;\n\t\t\tl++;\n\t\t}\n        if(s[j]==1000000 && l==10000)\n        {\n            printf(\""10000000000\"");\n            return 0;\n        }\n\t\tif(max<=s[j]*l)max=s[j]*l;\n\t}\n\t//打印结果\n\tprintf(\""%d\\n\"",max);\n}\n\n",WRONG_ANSWER,19,512
1591685823823929344,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 14:54:07,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int i,j,k;\n    int n;\n    int sum=0;\n    int max=0;\n    int t=0,a[100000];;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        for(j=0;j<n-1;j++)\n        {\n            if(a[i]<=a[i+j])\n                t=t+1;\n            else\n                break;\n        }\n        for(k=1;k<=i;k++)\n        {\n            if(a[i]<=a[a[i-k]])\n                t=t+1;\n            else\n                break;\n        }\n        sum=a[i]*t;\n        if(sum>max)\n            max=sum;\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",WRONG_ANSWER,8,192
1591685899531116544,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-13 14:54:25,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main(){\n    int n,a[1000],count=0,i,j,t=0,c=1;\n      scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n     \n        \n    \n    for( j=1;j<n-1;j++)\n    {\n        \n        if(a[j]<a[j-1]&&a[j]<a[j+1])\n        {count++; c=0;}  \n             \n       else{\n        if(a[j]==a[j+1])\n         c++;\n            \n        \n        else\n        if(a[j]<a[j+1]&&a[j]<a[j-c]) {count+=1;c=0;}\n      }\n        \n            \n    }\n    \n    \n \n    \n    printf(\""%d\\n\"",count);\n          \n}",WRONG_ANSWER,34,372
1591685924822769664,0b693affc66d8d407ff008bd1aaf4f2feb4a615f057943ba4b4ba3163d937dc6,2022-11-13 14:54:31,Java,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"import java.io.*;\nimport java.util.*;\n\npublic class Main {\n\n    public static void main(String[] args) throws IOException {\n        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n        Scanner sc=new Scanner(System.in);\n        String s=br.readLine();\n        String str=br.readLine();\n        //String[] str=br.readLine().split(\"" \"");\n        List<Character> list=new ArrayList<>();\n        for (int i = 0; i < str.length(); i++) {\n            list.add(str.charAt(i));\n        }\n        int res=0;\n        for (int i = 0; i < list.size()-1; i++) {\n            char a=list.get(i);\n            char b=list.get(i+1);\n            if (a-b!=0){\n                res+=2;\n                list.remove(i);\n                list.remove(i);\n                i=-1;\n            }\n        }\n        System.out.println(res);\n    }\n}",TIME_LIMIT_EXCEEDED,805,27056
1591685935837011968,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-11-13 14:54:33,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#define N 10000\nint main()\n{\n    int i,j,n;\n    int a[N]={0};\n    int count=0;\n    scanf(\""%d\"",&n);\n    if(n<3)\n        return 0;\n    else\n    {\n        for(i=0;i<n;i++)\n            scanf(\""%d\"",&a[i]);\n        for(i=1;i<n-1;i++)\n        {\n            for(j=i+2;j<n;j++)\n            {\n                if(a[i]>a[i+1]&&a[j]>a[i+1])\n                {\n                    count++;\n                    i++;\n                    continue;\n                }\n            }\n        }\n        printf(\""%d\\n\"",count);\n        return 0;\n    }\n}",WRONG_ANSWER,9,348
1591685971656368128,5bd1a8718ea7fb820055421c67b8e0a468e08d951f729a24e55bf407b3bdb1f6,2022-11-13 14:54:42,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <iostream>\n#include <vector>\n#include <stdio.h>\n#include<math.h>\n\nusing namespace std;\n\n\n\ndouble getret(int c,int f,double x){\n    if(f==-1)\n        return c*log(x);\n    return (c/(f+1))*pow(x,f+1);\n}\n\n\nint main()\n{\n\n    int n;\n    double a,b;\n    cin>>n>>a>>b;\n\n    vector<int> c(n);\n    vector<int> f(n);\n    for(int i=0;i<n;i++){\n        cin>>c[i];\n        }\n    for(int j=0;j<n;j++){\n        cin>>f[j];\n        }\n\n\n    double sum1=0,sum2=0;\n\n    for(int k=0;k<n;k++)\n    {\n        sum1+=getret(c[k],f[k],a);\n        sum2+=getret(c[k],f[k],b);\n    }\n    cout<<sum1-sum2;\n    return 0;\n}\n",WRONG_ANSWER,14,448
1591685982544748544,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-11-13 14:54:44,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#define N 10000\nint main()\n{\n    int i,j,n;\n    int a[N]={0};\n    int count=0;\n    scanf(\""%d\"",&n);\n    if(n<3)\n        return 0;\n    else\n    {\n        for(i=0;i<n;i++)\n            scanf(\""%d\"",&a[i]);\n        for(i=1;i<n;i++)\n        {\n            for(j=i+2;j<n;j++)\n            {\n                if(a[i]>a[i+1]&&a[j]>a[i+1])\n                {\n                    count++;\n                    i++;\n                    continue;\n                }\n            }\n        }\n        printf(\""%d\\n\"",count);\n        return 0;\n    }\n}",WRONG_ANSWER,7,492
1591686001012256768,b80fc2aed0abde15bdaa9327874c9784da696b6ed442d90001602ff2a017be15,2022-11-13 14:54:49,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h> \n#include<math.h> \nint main()\n{\n\n   int i,j,sum=0;\n   int a,m;\n   int b[10000];\n   scanf(\""%d\"",&a);\n   char n[a];\n  scanf(\""%s\"",n);\n  m=a;\n  for(j=0;j<m;j++)\n     {\n\t for(i=0;i<a-1;i++)\n\t {\n\t if(n[i]==n[i+1])\n\t   { \n\t   for(;i<a-2;i++)\n\t    n[i]=n[i+2];\n\t\ta=a-2;\n        sum=sum+2;\n\t\tbreak;\n\t}\n\t\n  } \n}\n   \n   printf(\""%d\"",sum);\n   return 0; \n   \n} ",WRONG_ANSWER,7,200
1591686085003239424,0d24b4ee85e6e3a4cc694f7e11105fa2aaf93fd10d4cbe81657f252e2d675435,2022-11-13 14:55:09,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n1,n2,n3;\n    int sum =0;\n    scanf(\""%d %d %d\"",&n1,&n2,&n3);\n    int t,t2,t3;\n    t= n1+n2;\n    t2=n2+n3;\n    t3 =n1+n3;\n    if(t<t3)\n    sum = (t<t2)?t:t2;\n    else\n    sum=(t3<t2)?t2:t3;\n    printf(\""%d\"",sum);\n    return 0;\n}\n\n",WRONG_ANSWER,23,416
1591686132293984256,e9a50f3e071443bb6fb229966bff355c178d484f6cc10e5e1fc8dc5a537237ba,2022-11-13 14:55:20,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int b,c,i,j,max=0;\n    scanf(\""%d\"",&b);\n    int a[b];\n    for(i=0;i<b;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<b;i++){\n\n        for(j=i+1;j<b;j++)\n        {\n            if(a[i]>a[j])\n            {   c=a[i]*(j-i);\n                break;\n            }\n            else  c=a[i]*(j-i+1);\n\n        }\n      if(max<c) max=c;\n    }\n    printf(\""%d\\n\"",max);\n}\n",WRONG_ANSWER,23,484
1591686199721648128,d9e00d995e65b04cda3ddef6baec19225e4351002ab4efa981f62d78919a481b,2022-11-13 14:55:36,C,300.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int max=0,num=0,sum=0;\n    int n;\n    scanf(\""%d\"",&n);\n    int height[n];\n    int i,j,l;\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&height[i]);\n    }\n    for(i=0;i<n;i++){\n        num = 0; \n        for(j=0;j<n-i;j++){\n            if(height[i]<=height[i+j]) num++;\n            else \n                break;\n        }\n        for(l=1;l<=i;l++)\n        {\n            if(height[i]<=height[i-l]) num++;\n            else \n                break;\n        }\n        \n        sum=height[i]*num;\n        if(sum>max) max=sum;\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",ACCEPTED,24,512
1591686200036188160,6933dcb3592e2d6f6fc887ed9a5537aab21a30f76450c9b5043f7776bfc39a59,2022-11-13 14:55:36,C++,300.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nint main(){\n    int n,i,j,k,temp,temp1;\n    scanf(\""%d\"",&n);\n    int high[n];\n    int x[n];\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&high[i]);\n    }\n    for(i=0;i<n;i++){\n        for(j=i,temp=0;j<n;j++){\n            temp++;\n            if(high[j+1]<high[i])\n                break;\n        }\n        for(k=i-1,temp1=0;k>=0;k--){\n            if(high[k]<high[i])\n                break;\n            temp1++;\n        }\n        x[i]=high[i]*(temp+temp1);\n\n    }\n    sort(x,x+n);\n    printf(\""%d\"",x[n-1]);\n}",ACCEPTED,38,320
1591686206797438976,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 14:55:38,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n    int n,a[20];\n    int i,h=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=1;i<n-1;i++)\n    {\n        if(i<=n-4)\n            {if(a[i]>=a[i+1]&&a[i+2]>=a[i+1]&&a[i+1]!=a[i+2])\n            h++;\n            }\n    }\n    printf(\""%d\\n\"",h);\n    return 0;\n}\n\n",RUNTIME_ERROR,19,200
1591686240687370240,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 14:55:46,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int i,j,k;\n    int n;\n    int sum=0;\n    int max=0;\n    int t=0,a[100000];;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        for(j=0;j<n-i;j++)\n        {\n            if(a[i]<=a[i+j])\n                t=t+1;\n            else\n                break;\n        }\n        for(k=1;k<=i;k++)\n        {\n            if(a[i]<=a[a[i-k]])\n                t=t+1;\n            else\n                break;\n        }\n        sum=a[i]*t;\n        if(sum>max)\n            max=sum;\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",WRONG_ANSWER,7,476
1591686243568857088,c47b15e117166a3dd00078b9f795673d5284a2761e582479119229751cc734d3,2022-11-13 14:55:47,C++,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#define S 10000\n\n\nint main()\n{\n    int a=0,n,i;\n    int h[S];\n    scanf(\""%d\"",&n);\n    if(n>=3 && n<=10000)\n    {\n        for(i=0;i<n;i++)\n        scanf(\""%d\"",&h[i]);\n        if(h[0]==0 && h[n-1]==0)\n        {\n            for(i=1;i<n-1;i++)\n            {\n                if(h[i]<h[i+1] && h[i]<=h[i-1])\n                a+=1;\n            }\n            printf(\""%d\"",a);\n            }\n        }\n\nprintf(\""\\n\"");\n    return 0;\n}\n\n",ACCEPTED,41,508
1591686271444213760,cf568c7ddc8b221335f880bfbaac4634294e65481e738a2e032c1ab9a84d576f,2022-11-13 14:55:53,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include<math.h>\nint main()\n{\n  int n,a,b;\n    int c[1000];\n    int f[1000];\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    int sum1=0;int sum2=0;\n    \n    for(int i=1;i<=n;i++){\n        scanf(\""%d\"",&c[i]);\n    }\n    for(int i=1;i<=n;i++){\n        scanf(\""%d\"",&f[i]);\n    }\n    for(int i=1;i<=n;i++){\n        sum1+=(c[i]/(f[i]+1))*pow(a,f[i]+1);\n        sum2+=(c[i]/(f[i]+1))*pow(b,f[i]+1);\n    }\n    int result=sum1-sum2;\n    printf(\""%d\"",result);\n    \n\n      return 0;\n}",WRONG_ANSWER,8,348
1591686314859442176,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 14:56:04,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int i,j,k;\n    int n;\n    int sum=0;\n    int max=0;\n    int a[100000];;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        int t=0\n        for(j=0;j<n-i;j++)\n        {\n            if(a[i]<=a[i+j])\n                t=t+1;\n            else\n                break;\n        }\n        for(k=1;k<=i;k++)\n        {\n            if(a[i]<=a[a[i-k]])\n                t=t+1;\n            else\n                break;\n        }\n        sum=a[i]*t;\n        if(sum>max)\n            max=sum;\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",COMPILE_ERROR,0,0
1591686334870466560,b80fc2aed0abde15bdaa9327874c9784da696b6ed442d90001602ff2a017be15,2022-11-13 14:56:08,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h> \n#include<math.h> \nint main()\n{\n\n   int i,j,sum=0;\n   int a,m;\n   int b[10000];\n   scanf(\""%d\"",&a);\n   char n[1000000];\n  scanf(\""%s\"",n);\n  m=a;\n  for(j=0;j<m;j++)\n     {\n\t for(i=0;i<a-1;i++)\n\t {\n\t if(n[i]==n[i+1])\n\t   { \n\t   for(;i<a-2;i++)\n\t    n[i]=n[i+2];\n\t\ta=a-2;\n        sum=sum+2;\n\t\tbreak;\n\t}\n\t\n  } \n}\n   \n   printf(\""%d\"",sum);\n   printf(\""\\n\"");\n   return 0; \n   \n} ",WRONG_ANSWER,9,500
1591686365258211328,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 14:56:16,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int i,j,k;\n    int n;\n    int sum=0;\n    int max=0;\n    int a[100000];;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        int t=0;\n        for(j=0;j<n-i;j++)\n        {\n            if(a[i]<=a[i+j])\n                t=t+1;\n            else\n                break;\n        }\n        for(k=1;k<=i;k++)\n        {\n            if(a[i]<=a[a[i-k]])\n                t=t+1;\n            else\n                break;\n        }\n        sum=a[i]*t;\n        if(sum>max)\n            max=sum;\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",SEGMENTATION_FAULT,58,384
1591686387571908608,e7e6ce2c6e9e530eaf2b9b9968748a0e44e3ac7183d73deb51851946350bfbb0,2022-11-13 14:56:21,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    int flag=0;\n    int i;\n    int n,h[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++) {\n        scanf(\""%d\"",&h[i]);\n    }\n\n     for(i=1;i<n-1;i++) {\n\n\n        if(h[i]<h[i-1]&&h[i]<=h[i+1])\n            flag++;\n\n     }\n\n    printf(\""%d\"",flag);\n    return 0;\n}\n",RUNTIME_ERROR,70,488
1591686409927548928,17759f531671f838bf3fae4270190e93b6109026f9503f986c1ed85bb412007d,2022-11-13 14:56:26,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<string.h>\n#define N 100000\nint main()\n{\n    int i,n,sum=0;\n    char a[N]={0};\n    scanf(\""%d\"",&n);\n    getchar();\n    gets(a);\n    for(i=0;i<n;i++)\n    {\n        if(a[i]=='0'||a[i]=='1')\n            if(a[i]==a[i+1])\n            {\n                sum=sum+2;\n                a[i]==a[i+2];\n                a[i+1]==a[i+3];\n                a[i+2]==a[i+4];\n            }\n    }\n    printf(\""%d\"",sum);\n}",WRONG_ANSWER,15,480
1591686437890961408,cf568c7ddc8b221335f880bfbaac4634294e65481e738a2e032c1ab9a84d576f,2022-11-13 14:56:33,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include<math.h>\nint main()\n{\n  int n,a,b;\n    int c[1000];\n    int f[1000];\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    int sum1=0;int sum2=0;\n    \n    for(int i=1;i<=n;i++){\n        scanf(\""%d\"",&c[i]);\n    }\n    for(int i=1;i<=n;i++){\n        scanf(\""%d\"",&f[i]);\n    }\n    for(int i=1;i<=n;i++){\n        sum1+=(c[i]/(f[i]+1))*pow(a,f[i]+1);\n        sum2+=(c[i]/(f[i]+1))*pow(b,f[i]+1);\n    }\n    int result=sum1-sum2;\n    printf(\""%d\\n\"",result);\n    \n\n      return 0;\n}",WRONG_ANSWER,4,352
1591686440181051392,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 14:56:34,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int i,j,k;\n    int n;\n    int sum=0;\n    int max=0;\n    int a[100000];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        int t=0;\n        for(j=0;j<n-i;j++)\n        {\n            if(a[i]<=a[i+j])\n                t=t+1;\n            else\n                break;\n        }\n        for(k=1;k<=i;k++)\n        {\n            if(a[i]<=a[a[i-k]])\n                t=t+1;\n            else\n                break;\n        }\n        sum=a[i]*t;\n        if(sum>max)\n            max=sum;\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",SEGMENTATION_FAULT,26,512
1591686444253720576,b80fc2aed0abde15bdaa9327874c9784da696b6ed442d90001602ff2a017be15,2022-11-13 14:56:35,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h> \n#include<math.h> \nint main()\n{\n\n   int i,j,sum=0;\n   int a,m;\n   scanf(\""%d\"",&a);\n   char n[1000000];\n  scanf(\""%s\"",n);\n  m=a;\n  for(j=0;j<m;j++)\n     {\n\t for(i=0;i<a-1;i++)\n\t {\n\t if(n[i]==n[i+1])\n\t   { \n\t   for(;i<a-2;i++)\n\t    n[i]=n[i+2];\n\t\ta=a-2;\n        sum=sum+2;\n\t\tbreak;\n\t}\n\t\n  } \n}\n   \n   printf(\""%d\"",sum);\n   printf(\""\\n\"");\n   return 0; \n   \n} ",WRONG_ANSWER,4,368
1591686483898327040,acf80eea856463058b81f71c0238069795893092293fbd098cc594959df6444e,2022-11-13 14:56:44,Python,300.0,1591610585635213312,1589816514637750272,1049226928954454016,n=int(input())\ns=str(input())\nx=0\ny=0\nfor i in s:\n    if int(i)==1:\n        y+=1\n    else:\n        x+=1\nc=n-abs(x-y)\nprint(c)\n\n\n\n\n\n\n,ACCEPTED,117,3012
1591686510569861120,acf80eea856463058b81f71c0238069795893092293fbd098cc594959df6444e,2022-11-13 14:56:50,Python,300.0,1591610585635213312,1589816514637750272,1049226928954454016,n=int(input())\ns=str(input())\nx=0\ny=0\nfor i in s:\n    if int(i)==1:\n        y+=1\n    else:\n        x+=1\nc=n-abs(x-y)\nprint(c)\n\n\n\n\n\n\n,ACCEPTED,120,3160
1591686555167907840,e7e6ce2c6e9e530eaf2b9b9968748a0e44e3ac7183d73deb51851946350bfbb0,2022-11-13 14:57:01,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    int flag=0;\n    int i;\n    int n,h[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++) {\n        scanf(\""%d\"",&h[i]);\n    }\n\n     for(i=1;i<n-1;i++) {\n\n\n        if(h[i]<h[i-1]&&h[i]<=h[i+1])\n            flag++;\n\n     }\n\n    printf(\""%d\"",flag);\n    return 0;\n}\n",RUNTIME_ERROR,37,500
1591686582988759040,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 14:57:08,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int i,j,k;\n    int n;\n    int sum=0;\n    int max=0;\n    int a[1000000];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        int t=0;\n        for(j=0;j<n-i;j++)\n        {\n            if(a[i]<=a[i+j])\n                t=t+1;\n            else\n                break;\n        }\n        for(k=1;k<=i;k++)\n        {\n            if(a[i]<=a[a[i-k]])\n                t=t+1;\n            else\n                break;\n        }\n        sum=a[i]*t;\n        if(sum>max)\n            max=sum;\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",WRONG_ANSWER,26,484
1591686589087277056,d4c94290401b65ee2ce02056ca325b624120f06a8f67557b729453a418b199fe,2022-11-13 14:57:09,C++,0.0,1591610585635213313,1589906790446387200,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nconst int N=1e5;\n\nint n,count1=0,a[N],t,x,y,sum=0x7fffffff,z;\nstring str;\nint main(){\n\tcin>>t;\n\twhile(t--){\n\t\tcin>>n;\n\t\tcount1=0;\n\t\tsum=0x7fffffff;\n\t\tfor(int i=1;i<=n;i++){\n\t\t\tcin>>a[i];\n\t\t}\n\t\tsort(a+1,a+n+1);\n\t\tfor(int i=2;i<=n-1;i++){\n\t\t\tx=a[i]-a[1];\n\t\t\ty=a[n]-a[i];\n\t\t\tz=abs(x-y);\n\t\t\tif(sum>z){\n\t\t\t\tcount1=max(x,y);\n\t\t\t\tsum=z;\n\t\t\t}\n\t\t}\n\t\tcout<<a[n]-a[1]+count1<<endl;\n\t\tmemset(a,0,sizeof 0);\n\t}\n} ",WRONG_ANSWER,24,328
1591686698059444224,b80fc2aed0abde15bdaa9327874c9784da696b6ed442d90001602ff2a017be15,2022-11-13 14:57:35,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h> \n#include<math.h> \nint main()\n{\n\n   int i=0,j=0,sum=0;\n   int a=0,m=0;\n   scanf(\""%d\"",&a);\n   char n[1000000];\n  scanf(\""%s\"",n);\n  m=a;\n  for(j=0;j<m;j++)\n     {\n\t for(i=0;i<a-1;i++)\n\t {\n\t if(n[i]==n[i+1])\n\t   { \n\t   for(;i<a-2;i++)\n\t    n[i]=n[i+2];\n\t\ta=a-2;\n        sum=sum+2;\n\t\tbreak;\n\t}\n\t\n  } \n}\n   \n   printf(\""%d\"",sum);\n   printf(\""\\n\"");\n   return 0; \n   \n} ",WRONG_ANSWER,5,328
1591686702576709632,0d24b4ee85e6e3a4cc694f7e11105fa2aaf93fd10d4cbe81657f252e2d675435,2022-11-13 14:57:36,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n1,n2,n3;\n    int sum =0;\n    scanf(\""%d %d %d\"",&n1,&n2,&n3);\n    int t,t2,t3;\n    t= n1+n2;\n    t2=n2+n3;\n    t3 =n1+n3;\n    if(t<t3)\n    sum = (t<t2)?t:t2;\n    else\n    sum=(t3<t2)?t3:t2;\n    printf(\""%d\"",sum);\n    return 0;\n}\n\n",ACCEPTED,30,376
1591686710365577216,28b4de6882b7ade2679f59c486acaf307ce8415dcb0a15787dba589025bbdb02,2022-11-13 14:57:38,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint n,a,b;\n\tscanf(\""%d%d%d\"",&n,&a,&b);\n\tint xi[n],mi[n],sum=0;\n\tint i;\n\tfor(i=0;i<n;i++)\n\tscanf(\""%d\"",&xi[i]);\n\tfor(i=0;i<n;i++)\n\tscanf(\""%d\"",&mi[i]);\n\tfor(i=0;i<n;i++)\n\t{\n\t\tsum+=xi[i]*pow(a,mi[i]+1)/(mi[i]+1)-xi[i]*pow(b,mi[i]+1)/(mi[i]+1);\t\n\t}\n\tprintf(\""%d\"",sum);\n\treturn 0;\n}",WRONG_ANSWER,7,212
1591686731060240384,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 14:57:43,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int i,j,k,n;\n    int sum=0;\n    int max=0;\n    int a[1000000];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        int t=0;\n        for(j=0;j<n-i;j++)\n        {\n            if(a[i]<=a[i+j])\n                t=t+1;\n            else break;\n        }\n        for(k=1;k<=i;k++)\n        {\n            if(a[i]<=a[a[i-k]])\n                t=t+1;\n            else break;\n        }\n        sum=a[i]*t;\n        if(sum>max)\n            max=sum;\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",WRONG_ANSWER,26,200
1591686797820977152,d830b0bcae7881ad6d1b2e2b14f3ffa3695b6d3bd622856493fa1cf903c9bf4e,2022-11-13 14:57:59,Java,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint a= sc.nextInt();\n\t\tint b =sc.nextInt();\n\t\tint[] arr1 = new int[n];\n\t\tint[] arr2 = new int[n];\n\t\tfor(int i =0;i< arr1.length;i++){\n\t\t\t\tarr1[i]=sc.nextInt();\n\t\t\t\n\t\t}\n\t\tfor(int i =0;i< arr2.length;i++){\n\t\t\tarr2[i]=sc.nextInt();\n\t\t\n\t\t}\n\t\tint res1=0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tres1+=(arr1[i]/(arr2[i]+1))*((int)Math.pow(a, arr2[i]+1));\n\t\t}\n\t\tint res2=0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tif(b==0){\n\t\t\t\tres2=0;\n\t\t\t\t\t\t}\n\t\t\telse{\n\t\t\tres2+=(arr1[i]/(arr2[i]+1))*((int)Math.pow(b, arr2[i]+1));\n\t\t\t}\n\t\t}\n\t\tint res=res1-res2;\n\t\tSystem.out.print(res);\n\t}\n}",WRONG_ANSWER,112,24508
1591686900677881856,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 14:58:23,C,300.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int i,j,k,n;\n    int sum=0;\n    int max=0;\n    int a[1000000];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        int t=0;\n        for(j=0;j<n-i;j++)\n        {\n            if(a[i]<=a[i+j])\n                t=t+1;\n            else break;\n        }\n        for(k=1;k<=i;k++)\n        {\n            if(a[i]<=a[i-k])\n                t=t+1;\n            else break;\n        }\n        sum=a[i]*t;\n        if(sum>max)\n            max=sum;\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",ACCEPTED,54,512
1591686906113712129,7e6a67f270e740aba8788a12d9a49939621a28d5059d3ced2247a86914b0a3b3,2022-11-13 14:58:25,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\tint n,a,b;\n\tint i;\n\tscanf(\""%d %d %d\"",&n,&a,&b);\n\t\n\tint C[n];\n\t\n\tfor(i=0;i<n;i++)\n\t\tscanf(\""%d\"",&C[i]);\n\t\t\n\tint F[n];\n\t\n\tfor(i=0;i<n;i++)\n\t\tscanf(\""%d\"",&F[i]);\n\t\n\t\n\tint sum1=0;\n\tfor(i=0;i<n;i++)\n\t{\n\t\tif(F[i]==-1) sum1+=0;\n\t\telse sum1+=((C[i]/(F[i]+1))*pow(a,F[i]+1));\n\t}\n\t\n\tint sum2=0;\n\tfor(i=0;i<n;i++)\n\t{\n\t\tif(F[i]==-1) sum2+=0;\n\t\telse sum2+=((C[i]/(F[i]+1))*pow(b,F[i]+1));\n\t}\n\t\n\tint sum=0;\n\tsum=sum1-sum2;\n\tprintf(\""%d\"",sum);\n}",WRONG_ANSWER,5,500
1591687050397769728,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-13 14:58:59,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"a=int(input())\ndata=list(map(int,input().split()))\ncount=0\ndatas=[]\nfor i in range(0,a-1):\n    if len(datas)==0:\n       datas.append(data[i])\n    elif datas[len(datas)-1]>=data[i]:\n            datas.append(data[i])\n    elif i==1 and  datas[len(datas)-1]<data[i]:\n        count=count\n    else:\n\n        datas=[data[i]]\n        count+=1\nprint(count)\n",WRONG_ANSWER,21,2764
1591687152944340992,b80fc2aed0abde15bdaa9327874c9784da696b6ed442d90001602ff2a017be15,2022-11-13 14:59:24,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h> \n#include<math.h> \nint main()\n{\n\n   int i=0,j=0,sum=0;\n   int a=0,m=0;\n   scanf(\""%d\"",&a);\n   char n[a];\n  scanf(\""%s\"",n);\n  m=a;\n  for(j=0;j<m;j++)\n     {\n\t for(i=0;i<a-1;i++)\n\t {\n\t if(n[i]==n[i+1])\n\t   { \n\t   for(;i<a-2;i++)\n\t    n[i]=n[i+2];\n\t\ta=a-2;\n        sum=sum+2;\n\t\tbreak;\n\t}\n\t\n  } \n}\n   \n   printf(\""%d\"",sum);\n   printf(\""\\n\"");\n   return 0; \n   \n} ",WRONG_ANSWER,12,332
1591687168735895552,e7e6ce2c6e9e530eaf2b9b9968748a0e44e3ac7183d73deb51851946350bfbb0,2022-11-13 14:59:27,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    int flag=0;\n    int i;\n    int n,h[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++) {\n        scanf(\""%d\"",&h[i]);\n    }\n\n     for(i=1;i<n-1;i++) {\n\n\n        if(h[i]<h[i-1]&&h[i]<=h[i+1])\n            flag++;\n\n     }\n\n    printf(\""%d\"",flag);\n    return 0;\n}\n",RUNTIME_ERROR,24,476
1591687173198589952,63a19c717d077fecd1be96314929ebf3516f35619209eacac77081bb07edebb5,2022-11-13 14:59:28,C,300.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include<math.h>\n#include<string.h>\n\n int func(int a[],int e,int o)\n {   int i,sum,min=a[e];\n     for(i=e;i<=o;i++)\n       if(min>a[i]){\n        min=a[i];\n       }\n     sum=min*(o-e+1);\n     return sum;\n\n\n\n }\n\n\nint main()\n{\n  int i,n,max;\n  int a[100];\n  scanf(\""%d\"",&n);\n  int q=1,w=n;\n  for(i=1;i<=n;i++){\n    scanf(\""%d\"",&a[i]);\n  }\n  max=func(a,q,w);\n  while(q!=w&&q<w){\n       q+=1;\n       w-=1;\n       if(func(a,q,w)>max)\n       {\n         max=func(a,q,w);\n       }\n  }\n  printf(\""%d\"",max);\n\n   }\n\n\n\n\n\n\n",ACCEPTED,34,364
1591687194723803136,2bc6a85c0376656012a7970a7842a2a9d8769555a79ef4eec85ff45aa30ff7b7,2022-11-13 14:59:33,Java,0.0,1591610585635213315,1591129345182261248,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint num = sc.nextInt();\n\t\tint[] arr = new int[num];\n\t\tfor(int i = 0; i < num; ++i) {\n\t\t\tarr[i] = sc.nextInt();\n\t\t}\n\t\tint tscore = 0;\n\t\tfor(int i = -1; i < num - 1; ) {\n\t\t\tint s1 = arr[i+1];\n\t\t\tint s2 = 0;\n\t\t\tif(i+3 < num) {\n\t\t\t\ts2 = arr[i+3];\n\t\t\t}\n\t\t\tif(s1 > s2) {\n\t\t\t\ttscore = tscore + s1 -5;\n\t\t\t\ti+=1;\n\t\t\t} else {\n\t\t\t\ttscore = tscore + s2 -5;\n\t\t\t\ti+=3;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(tscore);\n\t}\n},WRONG_ANSWER,354,46816
1591687441625657344,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-11-13 15:00:32,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#define N 100\n\nint main()\n{\n    int n,a,b;\n    int c[N]={0},f[N]={0},e1[N]={0},e2[N]={0};\n    int i,j;\n    int sum=0;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&c[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&f[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        e1[i]=(c[i]/(f[i]+1)*pow(a,f[i]+1));\n        e2[i]=(c[i]/(f[i]+1)*pow(b,f[i]+1));\n    }\n    for(i=0;i<n;i++)\n    {\n        sum=sum+e1[i]-e2[i];\n    }\n    printf(\""%d\\n\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,5,320
1591687456901324800,f55f4c0e0e3367434e26a462e3665271f5b4141ea3de4f34d96fdb21d67e2a7c,2022-11-13 15:00:36,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{int n,a,b,f1,f2,c1,c2,A,B,C,D;\nint sum=0;\n  scanf(\""%d %d %d\"",&n,&a,&b);\n  scanf(\""%d %d\"",&c1,&c2);\n  scanf(\""%d %d\"",&f1,&f2);\n  A=(c1/(f1+1))*pow(a,f1+1);\n  B=(c2/(f2+1))*pow(a,f2+1);\n  C=(c1/(f1+1))*pow(b,f1+1);\n  D=(c2/(f2+1))*pow(b,f2+1);\n  sum=A+B-C-D;\n\nprintf(\""%d\"",sum);\n\n\n\n\n\n    return 0;\n}\n",WRONG_ANSWER,5,512
1591687468532162560,20ffd83467b553ac24e1f4b8b096d58858684ca8c3f6a4d5a62be9ff7c4817da,2022-11-13 15:00:39,C,0.0,1591610585635213319,1591131955016622080,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#define MAX 10000\nint main()\n{\n    int n,i,j;\n    scanf(\""%d\"",&n);\n    int A[n][MAX],h[n];\n    int min[n],f[n],x;\n    for(i=0;i<n;i++)\n        f[i]=0;\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&h[i]);\n        for(j=0;j<h[i];j++){\n            scanf(\""%d\"",&A[i][j]);\n        }\n    }\n\n    for(i=0;i<n;i++)\n        min[i]=2*A[i][0];\n\n    for(i=0;i<n-1;i++){\n        for(j=0;j<h[i];j++)\n        if(A[i][j]>=min[i]){\n                x=A[i][j]/min[i];\n                f[i]=f[i]+x;\n        }\n        printf(\""%d\\n\"",f[i]);\n    }\n        for(i=n-1;i<n;i++){\n        for(j=0;j<h[i];j++)\n        if(A[i][j]>=min[i]){\n                x=A[i][j]/min[i];\n                f[i]=f[i]+x;\n        }\n        printf(\""%d\"",f[i]);\n    }\n}",WRONG_ANSWER,35,524
1591687555991789568,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-11-13 15:01:00,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#define N 100\n\nint main()\n{\n    int n,a,b;\n    int c[N]={0},f[N]={0},e1[N]={0},e2[N]={0};\n    int i,j;\n    int sum=0;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d \"",&c[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d \"",&f[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        e1[i]=(c[i]/(f[i]+1)*pow(a,f[i]+1));\n        e2[i]=(c[i]/(f[i]+1)*pow(b,f[i]+1));\n    }\n    for(i=0;i<n;i++)\n    {\n        sum=sum+e1[i]-e2[i];\n    }\n    printf(\""%d\\n\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,5,192
1591687566964056064,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-13 15:01:02,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a[3],r[3];\n    int i;\n    for(i = 0;i < 3;i++) {\n        scanf(\""%d\"",&a[i]);\n    }\n    r[0] = a[0] + a[1];\n    r[1] = a[1] + a[2];\n    r[2] = a[2] + a[0];\n    int min = r[0];\n    for(i = 0;i<3;i++) {\n        if(min >r[0]) {\n            min = r[0];\n        }\n    }\n    printf(\""\\n%d\"",min);\n    return 0;\n}",WRONG_ANSWER,15,384
1591687578699718656,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-11-13 15:01:05,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#define N 100\n\nint main()\n{\n    int n,a,b;\n    int c[N]={0},f[N]={0},e1[N]={0},e2[N]={0};\n    int i,j;\n    int sum=0;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d \"",&c[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d \"",&f[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        e1[i]=(c[i]/(f[i]+1)*pow(a,f[i]+1));\n        e2[i]=(c[i]/(f[i]+1)*pow(b,f[i]+1));\n    }\n    for(i=0;i<n;i++)\n    {\n        sum=sum+e1[i]-e2[i];\n    }\n    printf(\""%d\\n\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,21,480
1591687620617580544,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 15:01:15,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[n],i,s,j,sum;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {for(j=0;j<n-1;j++)\n    {\n        if(a[i]<=a[i+j])\n            s=s+1;\n        else break;\n        }\n    for(k=1;k<=i;k++)\n    {\n        if(a[i]<=a[a[i-k]])\n            s=s+1;\n        else break;\n    }}\n    sum=a[i]*s;\n    printf(\""%d\"",sum);\n    return 0;\n}",COMPILE_ERROR,0,0
1591687656948654080,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-13 15:01:24,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"a=int(input())\ndata=list(map(int,input().split()))\ncount=0\ndatas=[]\nfor i in range(0,a):\n    if len(datas)==0:\n       datas.append(data[i])\n    elif datas[len(datas)-1]>=data[i]:\n            datas.append(data[i])\n    elif i==1 and  datas[len(datas)-1]<data[i]:\n        count=count\n    else:\n        datas=[data[i]]\n        count+=1\nprint(count)\n",WRONG_ANSWER,22,2912
1591687661776297984,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 15:01:25,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[n],i,s,j,sum,k;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {for(j=0;j<n-1;j++)\n    {\n        if(a[i]<=a[i+j])\n            s=s+1;\n        else break;\n        }\n    for(k=1;k<=i;k++)\n    {\n        if(a[i]<=a[a[i-k]])\n            s=s+1;\n        else break;\n    }}\n    sum=a[i]*s;\n    printf(\""%d\"",sum);\n    return 0;\n}",RUNTIME_ERROR,5,200
1591687688347201536,5a1c17b308a3b3595833d34c6bdfb75e9f5dd0d065acfeb7f28ab8102ba7406c,2022-11-13 15:01:31,C,300.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int n,a,b,i,j;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    double sum1 = 0;\n    double sum2 = 0;\n    double sum;\n    double c[n],f[n];\n    if(n==0){\n        sum = a - b;\n    }else{\n    for(i=0;i<n;i++){\n        scanf(\""%lf\"",&c[i]);\n    }\n\n    for(i=0;i<n;i++){\n        scanf(\""%lf\"",&f[i]);\n    }\n    for(j=0;j<n;j++){\n        double x = c[j]/(f[j]+1)*pow(a,f[j]+1);\n        sum1+=x;\n    }\n    for(j=0;j<n;j++){\n        double y = c[j]/(f[j]+1)*pow(b,f[j]+1);\n        sum2+=y;\n    }\n    sum = sum1 - sum2;\n    }\n    printf(\""%.0lf\"",sum);\n    return 0;\n}\n",ACCEPTED,88,388
1591687701479579648,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-11-13 15:01:34,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#define N 100\n\nint main()\n{\n    int n,a,b;\n    int c[N]={0},f[N]={0},e1[N]={0},e2[N]={0};\n    int i,j;\n    int sum=0;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&c[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&f[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        e1[i]=(c[i]/(f[i]+1)*pow(a,f[i]+1));\n        e2[i]=(c[i]/(f[i]+1)*pow(b,f[i]+1));\n    }\n    for(i=0;i<n;i++)\n    {\n        sum=sum+e1[i]-e2[i];\n    }\n    printf(\""%d\\n\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,15,384
1591687721553518592,887d1bbe53a4d4a349813887f13126da5e46a853687f4c2c9d7b8ef3d748a9d6,2022-11-13 15:01:39,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int i,n,a,b,num=0;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    int c[n],f[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&f[i]);\n    for(i=0;i<n;i++)\n    {\n        num+=c[i]/(f[i]+1)*(pow(a,f[i]+1)-pow(b,f[i]+1));\n    }\n    printf(\""%d\"",num);\n}\n",WRONG_ANSWER,8,360
1591687752033558528,ef50cfe7f34b26d29f617c97ac65d40bd15ba1e063897a190284243de955e254,2022-11-13 15:01:46,Java,0.0,1591610585635213312,1589816514637750272,1049226928954454016,import java.util.Scanner;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner sc=new Scanner(System.in);\n\t\tint n=sc.nextInt();\n\t\tString[] b=new String[n];\n\t\tint i;\n\t\tint sum=0;\n\t\tfor(i=0;i<n;i++){\n\t\t\tb[i]=sc.next();\n\t\t}\n\t\tfor(i=0;i<n-1;i++){\n\t\t\tif(b[i]!=b[i+1]){\n\t\t\t\tif(i+2<b.length-i){\n\t\t\t\t\tb[i]=b[i+2];\n\t\t\t\t\tif(i+3<b.length-i)\n\t\t\t\t\t\tb[i+1]=b[i+3];\n\t\t\t\t\tsum+=2;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.print(sum);\n\t}\n},NON_ZERO_EXIT_CODE,108,24592
1591687757859446784,e7e6ce2c6e9e530eaf2b9b9968748a0e44e3ac7183d73deb51851946350bfbb0,2022-11-13 15:01:48,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    int flag=0;\n    int i;\n    int n,h[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++) {\n        scanf(\""%d\"",&h[i]);\n    }\n\n     for(i=1;i<n;i++) {\n        if(h[i]==h[i-1] || h[i]==h[i+1])\n            i++;\n\n        if(h[i]<h[i-1]&&h[i]<h[i+1])\n            flag++;\n\n     }\n\n    printf(\""%d\"",flag);\n    return 0;\n}\n",WRONG_ANSWER,6,488
1591687771633541120,64475a8ecd7d5a6c6e734f3f299283e039c26933b2a0e510cd9d22e95ba92068,2022-11-13 15:01:51,C++,300.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <bits/stdc++.h> \nusing namespace std;\n \nstruct node \n{\n    long long h;\n\tlong long pos;\n}a[100010];\n \nlong long n,maxx=0,pos;\nstack<node> q;\n \nint main() \n{\n\tint x,n;\n    cin>>n;\n    for(int i = 1;i <= n; i++)\n    {\n    \tcin>>x;\n    \ta[i].h=x,a[i].pos=i;\n\t}  \n        \n    for(int i = 1; i <= n+1; i++) {\n        if(q.empty() || q.top().h<a[i].h)\n            q.push(a[i]);\n        else if(q.top().h!=a[i].h) {\n            int pos1;\n            while(!q.empty()&&q.top().h>a[i].h) \n\t\t\t{\n                node x=q.top();\n                long long sum=0;\n                q.pop();\n                sum=x.h*(i-x.pos);\n                maxx=max(maxx,sum);\n                pos1=x.pos;\n            }\n            node w;\n            w.h=a[i].h;\n            w.pos=pos1;\n            q.push(w);\n        }\n    }\n    cout<<maxx;\n    return 0;\n}",ACCEPTED,38,604
1591687810921586688,ef50cfe7f34b26d29f617c97ac65d40bd15ba1e063897a190284243de955e254,2022-11-13 15:02:00,Java,0.0,1591610585635213314,1591128862958940160,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner sc=new Scanner(System.in);\n\t\tint n=sc.nextInt();\n\t\tint[] sum=new int[n];\n\t\tint i;\n\t\tsum[0]=n;\n\t\tfor(i=1;i<n;i++){\n\t\t\tsum[i]=1;\n\t\t}\n\t\tint[] a=new int[n-1];\n\t\tfor(i=0;i<n-1;i++){\n\t\t\ta[i]=sc.nextInt();\n\t\t}\n\t\ti=n-2;\n\t\t\twhile(a[i]==1||i<0){\n\t\t\t\tsum[a[i]-1]+=1;\n\t\t\t\ti--;\n\t\t}\n\t\t\t\n\t\tfor(i=0;i<n;i++){System.out.print(sum[i]+\"" \"");}\n\t\t\n\t}\n\n}",WRONG_ANSWER,278,36264
1591687855188238336,d9e00d995e65b04cda3ddef6baec19225e4351002ab4efa981f62d78919a481b,2022-11-13 15:02:11,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int a,b,n;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    int c[n],F[n];\n    int i;\n    for(i=0;i<n;i++) scanf(\""%d\"",&c[i]);\n    for(i=0;i<n;i++) scanf(\""%d\"",&F[i]);\n    int j;\n    int sum=0;\n    for(i=0;i<n;i++) sum += c[i]/(f[i]+1) * (int)pow(a,F[i]+1);\n    for(i=0;i<n;i++) sum -= c[i]/(f[i]+1) * (int)pow(a,F[i]+1);\n    printf(\""%d\"",sum);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1591687890630107136,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-13 15:02:19,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main(){\n    int n,a[1000],count=0,i,j,t=0,c=1;\n      scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n     \n     if(a[0]==0&&a[n-1]==0){\n    \n    for( j=1;j<n-1;j++)\n    {\n        \n        if(a[j]<a[j-1]&&a[j]<a[j+1])\n        {count++; }  \n             \n       else{\n        if(a[j]==a[j+1])\n         c++;\n            \n        \n        else\n        if(a[j]<a[j+1]&&a[j]<a[j-c]) {count+=1;c=0;}\n          if(a[j]<a[j+1]&&a[j]>a[j-c]) c=0;\n      }\n        \n            \n    }\n    \n    \n \n    \n    printf(\""%d\\n\"",count);\n       }   \n}",WRONG_ANSWER,35,508
1591687895344504832,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 15:02:21,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[1000000],i,s,j,sum=0,k;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {for(j=0;j<n-1;j++)\n    {\n        if(a[i]<=a[i+j])\n            s=s+1;\n        else break;\n        }\n    for(k=1;k<=i;k++)\n    {\n        if(a[i]<=a[a[i-k]])\n            s=s+1;\n        else break;\n    }}\n    sum=a[i]*s;\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,11,352
1591687904232267776,0d24b4ee85e6e3a4cc694f7e11105fa2aaf93fd10d4cbe81657f252e2d675435,2022-11-13 15:02:23,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n#define N 100000\nint sum=0,t1;\nvoid func(int x,int y,int z);\nint main()\n{\n    int n,n1,n2;\n    int a,b;\n    scanf(\""%d %d %d\"",&n,&n1,&n2);\n    while(n>0){\n        scanf(\""%d %d\"",&a,&b);      \n         t1= b/(a+1);\n            func(a+1,n1,n2);\n        \n        n--;\n    }\n  printf(\""%d\"",sum);\n    return 0;\n}\nvoid func(int x,int y,int z){\nint m,n;\nm=t1*pow(y,x);\nn=t1*pow(z,x);\nsum+=(m-n);\n}\n",WRONG_ANSWER,10,200
1591687917163307008,d9e00d995e65b04cda3ddef6baec19225e4351002ab4efa981f62d78919a481b,2022-11-13 15:02:26,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int a,b,n;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    int c[n],F[n];\n    int i;\n    for(i=0;i<n;i++) scanf(\""%d\"",&c[i]);\n    for(i=0;i<n;i++) scanf(\""%d\"",&F[i]);\n    int j;\n    int sum=0;\n    for(i=0;i<n;i++) sum += c[i]/(f[i]+1) * (int)pow(a,F[i]+1);\n    for(i=0;i<n;i++) sum -= c[i]/(f[i]+1) * (int)pow(a,F[i]+1);\n    printf(\""%d\"",sum);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1591687938403229697,eeab3421c2b685f7d51b09a289b82fe82ba0d3896984d09aeffb9d022232d887,2022-11-13 15:02:31,Java,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.math.BigDecimal;\nimport java.util.Arrays;\nimport java.util.Scanner;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n    public static void main(String[] args) {\n        FastReader fastReader =  new FastReader();\n        int n = fastReader.nextInt();\n        String str = fastReader.next();\n        int sum = 0;\n       for(int i=0;i+1<str.length();i++){\n           if(str.charAt(i) != str.charAt(i+1)){\n               sum+=2;\n               String str1 = str.substring(0,i);\n               String str2 = \""\"";\n               if(i+2<=str.length()-1)\n                    str2 = str.substring(i+2,str.length());\n               str = str1 + str2;\n               i=-1;\n             //  System.out.println(str1);\n             //  System.out.println(str2);\n            //   System.out.println(str);\n           }\n       }\n        System.out.println(sum);\n    }\n\n\n    static class FastReader {\n        BufferedReader br;\n        StringTokenizer st;\n        public FastReader()\n        {\n            br = new BufferedReader(\n                    new InputStreamReader(System.in));\n        }\n\n\n        String next()\n        {\n            while (st == null || !st.hasMoreElements()) {\n                try {\n                    st = new StringTokenizer(br.readLine());\n                }\n                catch (IOException e) {\n                    e.printStackTrace();\n                }\n            }\n            return st.nextToken();\n        }\n\n\n\n        int nextInt() { return Integer.parseInt(next()); }\n\n        long nextLong() { return Long.parseLong(next()); }\n\n        double nextDouble(){return Double.parseDouble(next());}\n\n\n        String nextLine()\n        {\n            String str = \""\"";\n\n            try {\n                if (st!= null && st.hasMoreTokens()){\n                    str = st.nextToken(\""\\n\"");\n                } else {\n                    str = br.readLine();\n                }\n            }\n            catch (IOException e) {\n                e.printStackTrace();\n            }\n            return str;\n        }\n\n\n    }\n}\n\n\n\n",MEMORY_LIMIT_EXCEEDED,832,65536
1591687961748725760,d9e00d995e65b04cda3ddef6baec19225e4351002ab4efa981f62d78919a481b,2022-11-13 15:02:36,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int a,b,n;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    int c[n],F[n];\n    int i;\n    for(i=0;i<n;i++) scanf(\""%d\"",&c[i]);\n    for(i=0;i<n;i++) scanf(\""%d\"",&F[i]);\n    int j;\n    int sum=0;\n    for(i=0;i<n;i++) sum += c[i]/(F[i]+1) * (int)pow(a,F[i]+1);\n    for(i=0;i<n;i++) sum -= c[i]/(F[i]+1) * (int)pow(a,F[i]+1);\n    printf(\""%d\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,7,352
1591687975787094016,e7e6ce2c6e9e530eaf2b9b9968748a0e44e3ac7183d73deb51851946350bfbb0,2022-11-13 15:02:40,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    int flag=0;\n    int i;\n    int n,h[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++) {\n        scanf(\""%d\"",&h[i]);\n    }\n\n     for(i=1;i<n;i++) {\n        if(h[i]==h[i-1] || h[i]==h[i+1])\n            i++;\n         break;\n\n        if(h[i]<h[i-1]&&h[i]<h[i+1])\n            flag++;\n\n     }\n\n    printf(\""%d\"",flag);\n    return 0;\n}\n",WRONG_ANSWER,5,336
1591688029843283968,05fd79145678de5c06012db9db4333bebf8365a74fe442d12a54a9da3782fdca,2022-11-13 15:02:53,C++,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<iostream>\n#define N 100005\nusing namespace std;\nlong long int jump[N];\nlong long int n;\nlong long int ci = 0;\nlong long int maxScore;\nlong long int Maxhash[N];\nvoid jumps(int index,int num,long long int score){\n\n\tif(index + num >= n) {\n\t\tif(ci==0){\n\t\t\tmaxScore = Maxhash[index];\n\t\t\tci+=1;\n\t\t}\n\t\telse{\n\t\t\tif(maxScore< Maxhash[index]) maxScore = Maxhash[index];\n\t\t}\n\t\treturn;\n\t}\n\tscore-=5;\n\tscore+=jump[index+num];\n\tif(ci==0){\n\t\tMaxhash[index] = score;\n\t}else if(Maxhash[index] < score){\n\t\tMaxhash[index] = score;\n\t}else if(Maxhash[index] >= score){\n\t\treturn;\n\t}\n\tjumps(index+num,1,score);\n\tjumps(index+num,3,score);\n}\n\nint main(){\n\tcin >> n;\n\tlong long int max;\n\tfor(int i = 0;i<n;i++) cin >>jump[i];\n\tjumps(-1,1,0);\n\tjumps(-1,3,0);\n\n\tcout << maxScore;\n\treturn 0;\n}\n",WRONG_ANSWER,244,1096
1591688058846896128,05fd79145678de5c06012db9db4333bebf8365a74fe442d12a54a9da3782fdca,2022-11-13 15:03:00,C++,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<iostream>\n#define N 100005\nusing namespace std;\nlong long int jump[N];\nlong long int n;\nlong long int ci = 0;\nlong long int maxScore;\nlong long int Maxhash[N];\nvoid jumps(int index,int num,long long int score){\n\n\tif(index + num >= n) {\n\t\tif(ci==0){\n\t\t\tmaxScore = Maxhash[index];\n\t\t\tci+=1;\n\t\t}\n\t\telse{\n\t\t\tif(maxScore< Maxhash[index]) maxScore = Maxhash[index];\n\t\t}\n\t\treturn;\n\t}\n\tscore-=5;\n\tscore+=jump[index+num];\n\tif(ci==0){\n\t\tMaxhash[index] = score;\n\t}else if(Maxhash[index] < score){\n\t\tMaxhash[index] = score;\n\t}else if(Maxhash[index] >= score){\n\t\treturn;\n\t}\n\tjumps(index+num,1,score);\n\tjumps(index+num,3,score);\n}\n\nint main(){\n\tcin >> n;\n\tlong long int max;\n\tfor(int i = 0;i<n;i++) cin >>jump[i];\n\tjumps(-1,1,0);\n\tjumps(-1,3,0);\n\n\tcout << maxScore+2;\n\treturn 0;\n}\n",WRONG_ANSWER,240,1024
1591688063477374976,e715137eeb4190ade2330123b989bbdd6eebd9a5e1df2e292271d3bfe3a79c69,2022-11-13 15:03:01,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint a[10000]={0},d[10000],q[10000];\nint main()\n{\n    int i,j=0,k,n,b,c=1,w;\n    scanf(\""%d\"",&n);\n    k=n;\n    for(i=1;i<=n;i++)\n    {\n        scanf(\""%d\"",&b);\n        q[i]=b;\n        a[b]++;\n    }\n    c=q[1];\n    for(i=1;i<10000;i++)\n    {\n        if(c<q[i])\n            c=q[i];\n    }\n    while(c>0)\n    {\n        k=n;\n        for(i=1;i<c;i++)\n        {\n            k-=a[i];\n        }\n        d[j]=c*k;\n        j++;\n        c--;\n    }\n    w=d[0];\n    for(i=0;i<j;i++)\n    {\n        if(w<d[i])\n            w=d[i];\n    }\n    printf(\""%d\\n\"",w);\n        \n}",WRONG_ANSWER,7,512
1591688087233945600,c76414e1d2d8531a5745e9bd3192aafa7cca924e645650ffe7954c992cc13b33,2022-11-13 15:03:06,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\nint x,i,t=0;\nscanf(\""%d\"",&x);\nint a[x];\nfor(i=0;i<x;i++)\n    scanf(\""%d\"",&a[i]);\nfor(i=1;i<x-1;i++)\n    if(a[i]<a[i+1]&&a[i]<=a[i-1])\n        t++;\n    printf(\""%d\"",t);\n}\n",ACCEPTED,33,352
1591688200014585856,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-13 15:03:33,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"a=int(input())\ndata=list(map(int,input().split()))\ncount=0\ndatas=[]\nfor i in range(0,a):\n    if len(datas)==0:\n       datas.append(data[i])\n    elif datas[len(datas)-1]>=data[i]:\n            datas.append(data[i])\n    elif i==1 and  datas[len(datas)-1]<data[i]:\n        count=count\n    else:\n  \n        datas=[data[i]]\n        count+=1\nprint(count)\n",WRONG_ANSWER,17,2760
1591688264694947840,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 15:03:49,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[1000000],i,s,j,sum=0,k;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {for(j=0;j<n-1;j++)\n    {\n        if(a[i]<=a[i+j])\n            s=s+1;\n        else break;\n        }\n    for(k=1;k<=i;k++)\n    {\n        if(a[i]<=a[a[i-k]])\n            s=s+1;\n        else break;\n    }\n     sum=a[i]*s;\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,5,364
1591688270369841152,281adcca8943f9f4c0ced14f1ceffe157a34fca39f3cb864eb95e400944e38a8,2022-11-13 15:03:50,Java,300.0,1591610585635213312,1589816514637750272,1049226928954454016,"\nimport java.util.Scanner;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t Scanner scan=new Scanner(System.in);\n\t int n=scan.nextInt();\n\t String a=scan.next();\n\t int zero=0;\n\t int one=0;\n\t char[] na=a.toCharArray();\n\t for(int i=0;i<n;i++){\n\t\t if(na[i]=='0'){\n\t\t\t zero++;\n\t\t }if(na[i]=='1'){\n\t\t\t one++;\n\t\t }\n\t }\n\t int min=Math.min(zero, one);\n\t System.out.println(min*2);\n}\n}",ACCEPTED,610,27448
1591688309204856832,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-13 15:03:59,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,sum=0,j,k;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(k=0;k<n;k++)\n        scanf(\""%d\"",&a[k]);\n    for(i=0;i<n;i++)\n        if(a[i]!=a[i+1])\n        {\n            sum=sum+2;\n            n=n-2;\n            for(j=i;j<n-2;j++)\n                a[i]=a[i+2];\n            i=0;\n        }\n        printf(\""%d\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,6,328
1591688312392527872,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-13 15:04:00,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a[3],r[3];\n    int i;\n    for(i = 0;i < 3;i++) {\n        scanf(\""%d\"",&a[i]);\n    }\n    r[0] = a[0] + a[1];\n    r[1] = a[1] + a[2];\n    r[2] = a[2] + a[0];\n    int min = r[0];\n    for(i = 0;i<3;i++) {\n        if(min > r[i]) {\n            min = r[i];\n        }\n    }\n    printf(\""\\n%d\"",min);\n    return 0;\n}\n",ACCEPTED,42,384
1591688318839173120,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-13 15:04:02,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\nint main()\n{\n   int n;\n    int fen=0;\n    int arr[999]={0};\n   scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        scanf(\""%d\"",&arr[i]);\n    }\n    for(int i=1;i<n;i++){\n        if(arr[i]!=arr[i-1]){\n            fen=fen+2;\n            for(int j=i-1;j<n;j++){\n                arr[i-1]=arr[i+1];\n            }\n            n=n-2;\n            i=i-2;\n        }\n    }\n    printf(\""%d\"",fen);\n   return 0;\n}",WRONG_ANSWER,8,348
1591688356952858624,20ffd83467b553ac24e1f4b8b096d58858684ca8c3f6a4d5a62be9ff7c4817da,2022-11-13 15:04:11,C,0.0,1591610585635213319,1591131955016622080,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#define MAX 10000\nint main()\n{\n    int n,i,j;\n    scanf(\""%d\"",&n);\n    int A[n][MAX],h[n];\n    int min[n],f[n],x,y[n][MAX];\n    for(i=0;i<n;i++)\n        f[i]=0;\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&h[i]);\n        for(j=0;j<h[i];j++){\n            scanf(\""%d\"",&A[i][j]);\n        }\n    }\n\n    for(i=0;i<n;i++)\n        min[i]=2*A[i][0];\n\n    for(i=0;i<n-1;i++){\n        for(j=0;j<h[i];j++)\n        if(A[i][j]>=min[i]){\n                x=A[i][j]/min[i];\n                y[i][j]=A[i][j]%min[i];\n                if(y[i][j]==0)\n                    f[i]=f[i]+2;\n                f[i]=f[i]+x;\n        }\n        printf(\""%d\\n\"",f[i]);\n    }\n        for(i=n-1;i<n;i++){\n        for(j=0;j<h[i];j++)\n        if(A[i][j]>=min[i]){\n                x=A[i][j]/min[i];\n                y[i][j]=A[i][j]%min[i];\n\n                if(y[i][j]==0)\n                    f[i]=f[i]+2;\n                f[i]=f[i]+x;\n        }\n        printf(\""%d\"",f[i]);\n    }\n}",WRONG_ANSWER,10,604
1591688357284163584,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 15:04:11,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[1000000],i,s,j,sum=0,k,b;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {for(j=0;j<n-1;j++)\n    {\n        if(a[i]<=a[i+j])\n            s=s+1;\n        else break;\n        }\n    for(k=1;k<=i;k++)\n    {\n        if(a[i]<=a[a[i-k]])\n            s=s+1;\n        else break;\n    }\n     sum=a[i]*s;\n     if(sum>b)\n        b=sum;\n    }\n    printf(\""%d\"",b);\n    return 0;\n}",WRONG_ANSWER,11,512
1591688455078555648,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-13 15:04:34,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<iostream>\nusing namespace std;\nint max(int a,int b){\n    return a>b?a:b;\n}\nint main(){\n    int n,h[1000000]={0};\n    cin>>n;\n    int sq=0,Maxa=0;\n    for(int i=0;i<n;i++)\n        cin>>h[i];\n    for(int i=0;i<n;i++){\n        int len=1;\n        for(int j=i+1;j<n;j++){\n            if(h[i]<=h[j])\n                len++;\n            else{\n                sq=h[i]*len;\n                Maxa=max(Maxa,sq);\n            }\n                \n        }\n    }\n    cout<<Maxa<<endl;;\n    return 0;\n}",WRONG_ANSWER,10,4300
1591688478906396672,e51465ce72346fac918042a342986433269a159492161f223a180a6e05d9a01a,2022-11-13 15:04:40,Java,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\t\npublic static void main(String[] args) {\n\t    Scanner in =new Scanner(System.in);\n\t    int result=0;\n\t    int n = 0,a=0,b = 0;\n\t    n = in.nextInt();\n\t    a = in.nextInt();\n\t    int [] c = new int[n];\n\t    int [] f =new int[n];\n\t    b = in.nextInt();\n\t    for(int i=0;i<n;i++){\n\t    \tc[i]=in.nextInt();\n\t    }\n\t    for(int i=0;i<n;i++){\n\t    \tf[i]=in.nextInt();\n\t    }\n\t    \n\t    for(int i=0;i<n;i++){\n\t\n\t    \tresult+=(c[i]*(Math.pow(a, f[i]+1)-Math.pow(b, f[i]+1)))/(f[i]+1);\n\t    }  \n\t   \n\t    System.out.println(result);\n\t    \n}\n}",WRONG_ANSWER,109,24500
1591688512687321088,6ba5ecacf3381a1e9382f99c413290eca40a071a563a618e5f36d66cbf9a5e1b,2022-11-13 15:04:48,C++,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<iostream>\n\nusing namespace std;\n\nint main(){\nint n;\nint count0=0,count1=0;\ncin>>n;\nchar x[n];\nfor(int i=0;i<n;i++)\ncin>>x[i];\n//cout<<x[2]<<endl;\nfor(int i=0;i<n;i++){\n    if(x[i]=='0')\n        count0++;\n    else\n        count1++;\n    //cout<<count0<<\"" \""<<count1<<endl;\n}\nif(count0>count1)\n    cout<<(2*count1)<<endl;\nelse\n    cout<<(2*count0)<,endl;\n}\n",COMPILE_ERROR,0,0
1591688579527749632,6ba5ecacf3381a1e9382f99c413290eca40a071a563a618e5f36d66cbf9a5e1b,2022-11-13 15:05:04,C++,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<iostream>\n\nusing namespace std;\n\nint main(){\nint n;\nint count0=0,count1=0;\ncin>>n;\nchar x[n];\nfor(int i=0;i<n;i++)\ncin>>x[i];\n//cout<<x[2]<<endl;\nfor(int i=0;i<n;i++){\n    if(x[i]=='0')\n        count0++;\n    else\n        count1++;\n    //cout<<count0<<\"" \""<<count1<<endl;\n}\nif(count0>count1)\n    cout<<(2*count1)<<endl;\nelse\n    cout<<(2*count0)<endl;\n}\n",COMPILE_ERROR,0,0
1591688597617795072,6ba5ecacf3381a1e9382f99c413290eca40a071a563a618e5f36d66cbf9a5e1b,2022-11-13 15:05:08,C++,300.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<iostream>\n\nusing namespace std;\n\nint main(){\nint n;\nint count0=0,count1=0;\ncin>>n;\nchar x[n];\nfor(int i=0;i<n;i++)\ncin>>x[i];\n//cout<<x[2]<<endl;\nfor(int i=0;i<n;i++){\n    if(x[i]=='0')\n        count0++;\n    else\n        count1++;\n    //cout<<count0<<\"" \""<<count1<<endl;\n}\nif(count0>count1)\n    cout<<(2*count1)<<endl;\nelse\n    cout<<(2*count0)<<endl;\n}\n",ACCEPTED,53,768
1591688600201486336,899c5501179552dc1fe5639f9047e15d0f835e7a87c8568193377882d0278985,2022-11-13 15:05:09,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,a[n],min,i,s[n];\n    scanf(\""%d\\n\"",&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]<=a[n-i+1])\n            s[i]=(n-i)*a[i];\n    }\n    min=s[0];\n    for(i=1;i<=n;i++)\n    {\n        if(min>s[i])\n            min=s[i];\n    }\n    printf(\""%d\"",s);\n    return 0;\n}",RUNTIME_ERROR,7,356
1591688614965436416,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-13 15:05:12,Python,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"def dele(num):\n    for i in range(len(num)-1):\n        if num[i]==num[i+1]:\n            num.pop(i)\n            return dele(num)\n    return num\nn=int(input())\na=list(input().split())\ncount=0\nfor i in range (n):\n    a[i]=int(a[i])\na=dele(a)\nfor i in range (1,len(a)-1):\n    if ((a[i]<a[i+1]) and (a[i]<a[i-1])):\n        count+=1\nprint(count)\n",ACCEPTED,98,3220
1591688671659843584,5bd1a8718ea7fb820055421c67b8e0a468e08d951f729a24e55bf407b3bdb1f6,2022-11-13 15:05:26,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <iostream>\n#include <algorithm>\n#include <vector>\nusing namespace std;\n\n\n\n\n\n\nint main()\n{\n\n    int n;\n    cin>>n;\n    vector<int> height(n);\n    for(int i=0;i<n;i++){\n        cin>>height[i];\n    }\n    int i=0,j=n-1;\n    int result=0;\n    while(i<j){\n        result=height[i]<height[j]?max(result,(j-i)*height[i++]):max(result,(j-i)*height[j--]);\n    }\n    cout<<result;\n    return 0;\n}\n",WRONG_ANSWER,8,640
1591688677892579328,eeab3421c2b685f7d51b09a289b82fe82ba0d3896984d09aeffb9d022232d887,2022-11-13 15:05:27,Java,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.math.BigDecimal;\nimport java.util.Arrays;\nimport java.util.Scanner;\nimport java.util.StringTokenizer;\n\npublic class Main {\n    static  String str2;\n\n    public static void main(String[] args) {\n        FastReader fastReader =  new FastReader();\n        int n = fastReader.nextInt();\n        String str = fastReader.next();\n        int sum = 0;\n       for(int i=0;i+1<str.length();i++){\n           if(str.charAt(i) != str.charAt(i+1)){\n               sum+=2;\n              // String str1 = str.substring(0,i);\n                str2 = \""\"";\n               if(i+2<=str.length()-1)\n                    str2 = str.substring(i+2,str.length());\n               str = str.substring(0,i)+str2;\n               i=-1;\n             //  System.out.println(str1);\n             //  System.out.println(str2);\n            //   System.out.println(str);\n           }\n       }\n        System.out.println(sum);\n    }\n\n\n    static class FastReader {\n        BufferedReader br;\n        StringTokenizer st;\n        public FastReader()\n        {\n            br = new BufferedReader(\n                    new InputStreamReader(System.in));\n        }\n\n\n        String next()\n        {\n            while (st == null || !st.hasMoreElements()) {\n                try {\n                    st = new StringTokenizer(br.readLine());\n                }\n                catch (IOException e) {\n                    e.printStackTrace();\n                }\n            }\n            return st.nextToken();\n        }\n\n\n\n        int nextInt() { return Integer.parseInt(next()); }\n\n        long nextLong() { return Long.parseLong(next()); }\n\n        double nextDouble(){return Double.parseDouble(next());}\n\n\n        String nextLine()\n        {\n            String str = \""\"";\n\n            try {\n                if (st!= null && st.hasMoreTokens()){\n                    str = st.nextToken(\""\\n\"");\n                } else {\n                    str = br.readLine();\n                }\n            }\n            catch (IOException e) {\n                e.printStackTrace();\n            }\n            return str;\n        }\n\n\n    }\n}\n\n\n\n",MEMORY_LIMIT_EXCEEDED,780,65536
1591688686562205696,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-13 15:05:29,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"a=int(input())\ndata=list(map(int,input().split()))\ncount=0\ndatas=[]\nfor i in range(0,a):\n    if len(datas)==0:\n       datas.append(data[i])\n    elif datas[len(datas)-1]>=data[i]:\n            datas.append(data[i])\n    elif i==1 and  datas[len(datas)-1]<data[i]:\n        count=count\n    else:\n        datas=[data[i]]\n        count+=1\nprint(count)\n",WRONG_ANSWER,16,2884
1591688733802651648,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-13 15:05:40,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main (){\n    int n,a,b,i,sum1=0,sum2=0,sum=0;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    int s1[n],s2[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&s1[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&s2[i]);\n    for(i=0;i<n;i++){\n   sum1+=(s1[i]/(s2[i]+1))*pow(a,(s2[i]+1));\n   sum2+=(s1[i]/(s2[i]+1))*pow(b,(s2[i]+1));\n    }\n          sum=sum1-sum2;\n          printf(\""%d\"",sum);\n}",WRONG_ANSWER,8,196
1591688764215537664,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-13 15:05:48,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\n#define N 10000\n\n\nint pand(char *a,int i,int n)\n{\n    int b,c;\n    a[i]=a[i+2];\n    a[i+1]=a[i+3];\n    i++;\n    if(i<n) pand(a,i,n);\n    else return 0;\n\n}\n\n\n\n\n\n\nint main()\n{\n    char a[10000];\n    int n,i,j,k,l;\n    j=0;\n    scanf(\""%d\"",&n);\n    scanf(\""%s\"",&a);\n    for(l=0;l<n;l++){\n    for(i=0;i<n;i++)\n    {\n        //if(i<3&&a[0]!=a[1]) a\n        \n        k=i;\n        if(i>0&&a[i]!=a[i+1])\n            {\n\n            pand(a,i,n);\n            n-=1;\n            j+=2;\n\n            }\n\n    }\n    }//printf(\""%s\"",a);\n\nprintf(\""%d\\n\"",j);\n\n\n\n\n\n    return 0;\n}",WRONG_ANSWER,5,324
1591688806984900608,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-13 15:05:58,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main (){\n    int n,a,b,i,sum1=0,sum2=0,sum=0;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    int s1[n],s2[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&s1[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&s2[i]);\n    for(i=0;i<n;i++){\n   sum1+=(s1[i]/(s2[i]+1))*pow(a,(s2[i]+1));\n   sum2+=(s1[i]/(s2[i]+1))*pow(b,(s2[i]+1));\n    }\n          sum=sum1-sum2;\n          printf(\""%d\\n\"",sum);\n}",WRONG_ANSWER,5,336
1591688815981682688,5bd1a8718ea7fb820055421c67b8e0a468e08d951f729a24e55bf407b3bdb1f6,2022-11-13 15:06:00,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <iostream>\n#include <algorithm>\n#include <vector>\nusing namespace std;\n\n\n\n\n\n\nint main()\n{\n\n    int n;\n    cin>>n;\n    vector<int> height(n);\n    for(int i=0;i<n;i++){\n        cin>>height[i];\n    }\n    int i=0,j=height.size()-1;\n    int result=0;\n    while(i<j){\n        result=height[i]<height[j]?max(result,(j-i)*height[i++]):max(result,(j-i)*height[j--]);\n    }\n    cout<<result;\n    return 0;\n}\n",WRONG_ANSWER,6,504
1591688949578608640,28b4de6882b7ade2679f59c486acaf307ce8415dcb0a15787dba589025bbdb02,2022-11-13 15:06:32,C++,300.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint n,a,b,c,d;\n\tscanf(\""%d%d%d\"",&n,&a,&b);\n\tint xi[n],mi[n],sum=0;\n\tint i,j;\n\tfor(i=0;i<n;i++)\n\tscanf(\""%d\"",&xi[i]);\n\tfor(i=0;i<n;i++)\n\tscanf(\""%d\"",&mi[i]);\n\tfor(i=0;i<n;i++)\n\t{\n\t\tc=1;d=1;\n\t\tfor(j=1;j<=mi[i]+1;j++)\n\t\t{\n\t\tc=c*a;\n\t\td=d*b;\n\t}\n\t\tsum+=xi[i]*c/(mi[i]+1)-xi[i]*d/(mi[i]+1);\t\n\t}\n\tprintf(\""%d\"",sum);\n\treturn 0;\n}",ACCEPTED,40,352
1591688958285983744,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 15:06:34,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[1000000],i,s=0,j,sum=0,k,b;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        for(j=0;j<n-i;j++)\n    {\n        if(a[i]<=a[i+j])\n            s=s+1;\n        else break;\n        }\n    for(k=1;k<=i;k++)\n    {\n        if(a[i]<=a[a[i-k]])\n            s=s+1;\n        else break;\n    }\n     sum=a[i]*s;\n     if(sum>b)\n        b=sum;\n    }\n    printf(\""%d\"",b);\n    return 0;\n}",WRONG_ANSWER,8,332
1591688987532877824,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-11-13 15:06:41,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#define N 100\nint main()\n{\n    int i,j,n;\n    int a[N]={0};\n    int count=0;\n    scanf(\""%d\"",&n);\n    if(n<3)\n        return 0;\n    else\n    {\n        for(i=0;i<n;i++)\n            scanf(\""%d\"",&a[i]);\n        for(i=1;i<n;i++)\n        {\n            for(j=i+2;j<n;j++)\n            {\n                if(a[i]>a[i+1]&&a[j]>a[i+1])\n                {\n                    count++;\n                    i++;\n                    continue;\n                }\n            }\n        }\n        printf(\""%d\\n\"",count);\n        return 0;\n    }\n}",WRONG_ANSWER,6,328
1591689002191958016,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-13 15:06:44,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<iostream>\nusing namespace std;\nint max(int a,int b){\n    return a>b?a:b;\n}\nint main(){\n    int n,h[1000000]={0};\n    cin>>n;\n    int sq=0,Maxa=0;\n    for(int i=0;i<n;i++)\n        cin>>h[i];\n    for(int i=0;i<n;i++){\n        int len=1;\n        for(int j=i+1;j<n;j++){\n            if(h[i]<=h[j])\n                len++;\n            else{\n                sq=h[i]*len;\n                Maxa=max(Maxa,sq);\n                continue;\n            }\n                \n        }\n    }\n    cout<<Maxa<<endl;;\n    return 0;\n}",WRONG_ANSWER,10,4292
1591689004687568896,e715137eeb4190ade2330123b989bbdd6eebd9a5e1df2e292271d3bfe3a79c69,2022-11-13 15:06:45,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint a[10000]={0},d[10000],q[10000];\nint main()\n{\n    int i,j=0,k,n,b,c=1,w;\n    scanf(\""%d\"",&n);\n    k=n;\n    for(i=1;i<=n;i++)\n    {\n        scanf(\""%d\"",&b);\n        q[i]=b;\n        a[b]++;\n    }\n    c=q[1];\n    for(i=1;i<10000;i++)\n    {\n        if(c<q[i])\n            c=q[i];\n    }\n    while(c>0)\n    {\n        k=n;\n        for(i=1;i<c;i++)\n        {\n            k-=a[i];\n        }\n        d[j]=c*k;\n        j++;\n        c--;\n    }\n    w=d[0];\n    for(i=0;i<j;i++)\n    {\n        if(w<d[i])\n            w=d[i];\n    }\n    printf(\""%d\\n\"",w);\n        \n}",WRONG_ANSWER,16,196
1591689016293208064,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-11-13 15:06:48,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#define N 100000\nint main()\n{\n    int i,j,n;\n    int a[N]={0};\n    int count=0;\n    scanf(\""%d\"",&n);\n    if(n<3)\n        return 0;\n    else\n    {\n        for(i=0;i<n;i++)\n            scanf(\""%d\"",&a[i]);\n        for(i=1;i<n;i++)\n        {\n            for(j=i+2;j<n;j++)\n            {\n                if(a[i]>a[i+1]&&a[j]>a[i+1])\n                {\n                    count++;\n                    i++;\n                    continue;\n                }\n            }\n        }\n        printf(\""%d\\n\"",count);\n        return 0;\n    }\n}",WRONG_ANSWER,5,580
1591689019267014656,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 15:06:49,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[1000000],i,j,sum=0,k,b;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        int s=0;\n        for(j=0;j<n-i;j++)\n    {\n        if(a[i]<=a[i+j])\n            s=s+1;\n        else break;\n        }\n    for(k=1;k<=i;k++)\n    {\n        if(a[i]<=a[a[i-k]])\n            s=s+1;\n        else break;\n    }\n     sum=a[i]*s;\n     if(sum>b)\n        b=sum;\n    }\n    printf(\""%d\"",b);\n    return 0;\n}",WRONG_ANSWER,13,456
1591689029622718464,172db3e4a89a3dc038ec44e9346ef3138ace8cc1576eb636ccaf26fd91d7a145,2022-11-13 15:06:51,C++,300.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <algorithm>\n\nusing namespace std;\ntypedef long long ll;\nconst int N = 1e5 + 10;\nll a[N]; \n\nint main(){\n\tint n;\n\tscanf(\""%d\"",&n);\n\tfor(int i=1;i<=n;i++) {\n\t\tscanf(\""%lld\"",&a[i]);\n\t}\n\tfor(int i=1;i<=n;i++) {\n\t\tif(i < 3) a[i] += (a[i-1] - 5);\n\t\telse a[i] += (max(a[i-1],a[i-3]) - 5);\n        //printf(\""%lld \"",a[i] );\n\t}\n\tprintf(\""%lld\"",a[n]);\n\treturn 0;\n}",ACCEPTED,43,620
1591689058324328448,899c5501179552dc1fe5639f9047e15d0f835e7a87c8568193377882d0278985,2022-11-13 15:06:58,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,a[n],max,i,s[n];\n    scanf(\""%d\\n\"",&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]<=a[n-i+1])\n            s[i]=(n-i)*a[i];\n    }\n    max=s[0];\n    for(i=1;i<=n;i++)\n    {\n        if(max<s[i])\n            max=s[i];\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",SEGMENTATION_FAULT,7,196
1591689100858810368,f55f4c0e0e3367434e26a462e3665271f5b4141ea3de4f34d96fdb21d67e2a7c,2022-11-13 15:07:08,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{int n,a,b,f1,f2,c1,c2,A,B,C,D;\nint sum=0;\n  scanf(\""%d %d %d\"",&n,&a,&b);\n  scanf(\""%d %d\"",&c1,&c2);\n  scanf(\""%d %d\"",&f1,&f2);\n  A=(c1/(f1+1))*pow(a,f1+1);\n  B=(c2/(f2+1))*pow(a,f2+1);\n  C=(c1/(f1+1))*pow(b,f1+1);\n  D=(c2/(f2+1))*pow(b,f2+1);\n  sum=A+B-(C+D);\n\nprintf(\""%d\\n\"",sum);\n\n\n\n\n\n    return 0;\n}\n",WRONG_ANSWER,12,204
1591689112363741184,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-13 15:07:11,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main (){\n    int n,a,b,i,sum1=0,sum2=0,sum=0;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    int s1[n],s2[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&s1[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&s2[i]);\n    for(i=0;i<n;i++){\n   sum1+=(s1[i]/(s2[i]+1))*pow(a,(s2[i]+1));\n   sum2+=(s1[i]/(s2[i]+1))*pow(b,(s2[i]+1));\n    }\n          sum=sum1-sum2;\n          printf(\""%d\\n\"",sum);\n}",WRONG_ANSWER,8,200
1591689123638042624,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-13 15:07:13,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"a=int(input())\ndata=list(map(int,input().split()))\ncount=0\ndatas=[]\nfor i in range(0,a):\n    if len(datas)==0:\n       datas.append(data[i])\n    elif datas[len(datas)-1]>=data[i]:\n            datas.append(data[i])\n    elif i==1 and  datas[len(datas)-1]<data[i]:\n        count=count\n    else:\n        for l in datas:\n            if l>data[i]\n                datas=[data[i]]\n                count+=1\nprint(count)\n",NON_ZERO_EXIT_CODE,23,2764
1591689174179438592,d9e00d995e65b04cda3ddef6baec19225e4351002ab4efa981f62d78919a481b,2022-11-13 15:07:25,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int a,b,n;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    int c[n],F[n];\n    int i;\n    for(i=0;i<n;i++) scanf(\""%d\"",&c[i]);\n    for(i=0;i<n;i++) scanf(\""%d\"",&F[i]);\n    int sum=0;\n    for(i=0;i<n;i++) sum = sum + c[i]/(F[i]+1) * (int)pow(a,F[i]+1);\n    for(i=0;i<n;i++) sum = sum - c[i]/(F[i]+1) * (int)pow(b,F[i]+1);\n    printf(\""%d\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,9,196
1591689207800934400,172db3e4a89a3dc038ec44e9346ef3138ace8cc1576eb636ccaf26fd91d7a145,2022-11-13 15:07:33,Python,300.0,1591610585635213316,1591130116607045632,1049226928954454016,print(60),ACCEPTED,16,2776
1591689214398586880,b80fc2aed0abde15bdaa9327874c9784da696b6ed442d90001602ff2a017be15,2022-11-13 15:07:35,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h> \n#include<math.h> \nint main()\n{\n\n   int i,j,sum=0;\n   int a,m;\n   scanf(\""%d\"",&a);\n   char n[100000];\n  scanf(\""%s\"",n);\n  m=a;\n  for(j=0;j<m;j++)\n     {\n\t for(i=0;i<a-1;i++)\n\t {\n\t if(n[i]==n[i+1])\n\t   { \n\t   for(;i<a-2;i++)\n\t    n[i]=n[i+2];\n\t\ta=a-2;\n        sum=sum+2;\n\t\tbreak;\n\t}\n\t\n  } \n}\n   \n   printf(\""%d\"",sum);\n   printf(\""\\n\"");\n   return 0; \n   \n} ",WRONG_ANSWER,11,360
1591689219830198272,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-13 15:07:36,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"a=int(input())\ndata=list(map(int,input().split()))\ncount=0\ndatas=[]\nfor i in range(0,a):\n    if len(datas)==0:\n       datas.append(data[i])\n    elif datas[len(datas)-1]>=data[i]:\n            datas.append(data[i])\n    elif i==1 and  datas[len(datas)-1]<data[i]:\n        count=count\n    else:\n        for l in datas:\n            if l>data[i]:\n                datas=[data[i]]\n                count+=1\nprint(count)\n",WRONG_ANSWER,17,2760
1591689287756963840,f55f4c0e0e3367434e26a462e3665271f5b4141ea3de4f34d96fdb21d67e2a7c,2022-11-13 15:07:53,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{int n,a,b,f1,f2,c1,c2,A,B,C,D;\nint sum=0;\n  scanf(\""%d %d %d\"",&n,&a,&b);\n  scanf(\""%d %d\"",&c1,&c2);\n  scanf(\""%d %d\"",&f1,&f2);\n  A=(c1/(f1+1))*pow(a,f1+1);\n  B=(c2/(f2+1))*pow(a,f2+1);\n  C=(c1/(f1+1))*pow(b,f1+1);\n  D=(c2/(f2+1))*pow(b,f2+1);\n  sum=A+B-(C+D);\n\nprintf(\""%d\\n\"",sum);\n\n\n\n\n\n    return 0;\n}\n",WRONG_ANSWER,5,200
1591689385433903104,70c675ddfcb60b2192bc8ac38fb068fec0500208a5bf97a796c7cc074b43cf87,2022-11-13 15:08:16,Java,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner myScanner = new Scanner(System.in);\n\t\tint n = myScanner.nextInt();\n\t\tint a = myScanner.nextInt();\n\t\tint b = myScanner.nextInt();\n\t\tint[] arr = new int[n]; //表示系数c\n\t\tint[] arr1 = new int[n];  //表示指数F\n\t\tint sum = 0;  //a的结果\n\t\tint sum1 = 0;  //b的结果\n\t\tint endsum = 0;\n\t\tfor(int i = 0;i < 2;i++){\n\t\t\tarr[i] = myScanner.nextInt();\n\t\t}\n\t\tfor(int i = 0;i < 2;i++){\n\t\t\tarr1[i] = myScanner.nextInt();\n\t\t}\n\t\tfor(int i = 0;i < 2;i++){\n\t\t\tint x1 = arr1[i]+1;\n\t\t\tint x = arr[i] / (x1);\n\t\t\tint y = (int) Math.pow(a,x1 );\n\t\t\tint y1 = (int) Math.pow(b,x1 );\n\t\t\tsum += x * y;\n\t\t\tsum1 += x * y1;\n\t\t}\n\t\tendsum = sum-sum1;\n\t\tSystem.out.printf(\""%d\"",endsum);\n\t\t\n\t}\n\n}",WRONG_ANSWER,117,24568
1591689389355577344,887d1bbe53a4d4a349813887f13126da5e46a853687f4c2c9d7b8ef3d748a9d6,2022-11-13 15:08:17,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int i,n,a,b,num=0;\n    float m=1.0;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    int c[n],f[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&f[i]);\n    for(i=0;i<n;i++)\n    {\n        m=c[i]/(f[i]+1)*1.0;\n        num+=m*(pow(a,f[i]+1)-pow(b,f[i]+1));\n    }\n    printf(\""%d\"",num);\n}\n",WRONG_ANSWER,8,200
1591689403683319808,6ba5ecacf3381a1e9382f99c413290eca40a071a563a618e5f36d66cbf9a5e1b,2022-11-13 15:08:20,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<iostream>\n\nusing namespace std;\n\nint main(){\nint n;\nint flag=3;\nlong imax=0,sum=0;\ncin>>n;\nlong h[n];\nfor(int i=0;i<n;i++){\n    cin>>h[i];\n}\n\nfor(int i=0;i<n;i++)\n{\n    for(int j=i;j<n;j++){\n        if(h[j]>=h[i])\n            flag=1;\n        else\n            flag=0;\n        if(flag==0){\n        sum=h[i]*(j-i);\n        //cout<<sum<<endl;\n        if(imax<sum)\n            imax=sum;\n        break;\n        }\n        if(flag==1 && j==n-1){\n            sum=h[i]*(j-i+1);\n            //cout<<sum<<endl;\n        if(imax<sum)\n\n            imax=sum;\n        break;\n        }\n    }\n}\ncout<<imax<<endl;\n}",WRONG_ANSWER,30,512
1591689411392495616,b80fc2aed0abde15bdaa9327874c9784da696b6ed442d90001602ff2a017be15,2022-11-13 15:08:22,C++,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h> \n#include<math.h> \nint main()\n{\n\n   int i,j,sum=0;\n   int a,m;\n   scanf(\""%d\"",&a);\n   char n[100000];\n  scanf(\""%s\"",n);\n  m=a;\n  for(j=0;j<m;j++)\n     {\n\t for(i=0;i<a-1;i++)\n\t {\n\t if(n[i]==n[i+1])\n\t   { \n\t   for(;i<a-2;i++)\n\t    n[i]=n[i+2];\n\t\ta=a-2;\n        sum=sum+2;\n\t\tbreak;\n\t}\n\t\n  } \n}\n   \n   printf(\""%d\"",sum);\n   printf(\""\\n\"");\n   return 0; \n   \n} ",WRONG_ANSWER,5,352
1591689413825159168,03f9d7a6fc27d141b8243d1b2b44a3276cdd4750b5c2621d6d8c006b64ca6514,2022-11-13 15:08:23,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int p,q,r;\n    int a,b,c;\n    scanf(\""%d %d %d\"",&p,&q,&r);\n    a=p+q; //5\n    b=r+p; //6\n    c=q+r; //5\n    if(a>=b&&b>=c)\n        printf(\""%d\"",c);\n    else if(b>=c&&c>=a)\n        printf(\""%d\"",a);\n    else if(c>=a&&a>=b)\n        printf(\""%d\"",b);\n    return 0;\n}\n",WRONG_ANSWER,6,500
1591689415452536832,ccc42b8437aa15d1214e4623799ed35cd8ea8087c26cb1b596d51ae4556ea39c,2022-11-13 15:08:23,Python,0.0,1591610585635213315,1591129345182261248,1049226928954454016,a=eval(input())\nb=input().split()\ndeifen=0\nxiaohao=0\ni=-1\nwhile i<a-1:\n    if i+3<a:\n        if int(b[i+1])<int(b[i+3]):\n            deifen+=int(b[i+3])\n            xiaohao+=5\n            i+=3\n        else:\n            deifen+=int(b[i+1])\n            xiaohao+=5\n            i+=1\n    else:\n        if int(b[i])-5<0:\n            break\n        else:\n            deifen+=int(b[i+1])\n            xiaohao+=5\n            i+=1\nprint(deifen-xiaohao),WRONG_ANSWER,29,3172
1591689421383327744,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-13 15:08:24,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\n\n#define M 10000\n\nint main()\n\n{\n\n    int h[M],i,s[M],n,j,k[M],sum,l,m;\n\n    scanf(\""%d\"",&n);\n\n    for(i=0;i<n;i++)\n\n    scanf(\""%d\"",&h[i]);\n\n    for(j=0;j<n;j++)\n\n    {\n\n    for(i=0;i<n;i++)\n\n    k[i]=h[i];\n\n    sum=1;\n\n    for(i=j;i<n;i++)\n\n    {\n\n        if(k[i]<=k[i+1])\n\n        {\n\n            k[i+1]=k[i];\n\n            l=k[i];\n\n            sum++;\n\n        }\n\n    }\n\n    s[j]=l*sum;\n\n    printf(\""%d\\n\"",s[j]);\n\n    }\n\n    for(i=0;i<n;i++)\n\n    if(m<s[i])\n\n    m=s[i];\n\n    printf(\""%d\"",m);\n\n    return 0;\n\n}",WRONG_ANSWER,6,348
1591689437342621696,06b00897262b024d9e66dcd771cf81de9b63954f7a4554699d17c2158114c0d1,2022-11-13 15:08:28,Java,0.0,1591610585635213312,1589816514637750272,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner scan=new Scanner(System.in);\n\t\tint n=scan.nextInt();\n\t\tString str=scan.next();\n\t\tchar ch[]=str.toCharArray();\n\t\tint x=0;\n\t\tint i=0;\n\t\twhile(i<n-1) {\n\t\t\tif(ch[i]!=ch[i+1]) {\n\t\t\t\tx=x+2;\n\t\t\t\tfor(int j=i;j<n-1;j++){\n\t\t\t\t\tch[i]=ch[n-2];\n\t\t\t\t\tch[i]=ch[n-1];\n\t\t\t\t}\n\t\t\t\tn=n-2;\n\t\t\t\ti=i-1;\n\t\t\t}else {\n\t\t\t\ti++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(x);\n\t}\n},NON_ZERO_EXIT_CODE,128,24288
1591689452005908480,899c5501179552dc1fe5639f9047e15d0f835e7a87c8568193377882d0278985,2022-11-13 15:08:32,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,a[80],max,i,s[80];\n    scanf(\""%d\\n\"",&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]<=a[n-i+1])\n            s[i]=(n-i)*a[i];\n    }\n    max=s[0];\n    for(i=1;i<=n;i++)\n    {\n        if(max<s[i])\n            max=s[i];\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",WRONG_ANSWER,9,196
1591689475854753792,5bd1a8718ea7fb820055421c67b8e0a468e08d951f729a24e55bf407b3bdb1f6,2022-11-13 15:08:37,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <iostream>\n#include <algorithm>\n#include <vector>\nusing namespace std;\n\n\n\n\n\n\nint main()\n{\n\n    int n;\n    cin>>n;\n    vector<int> height(n);\n    for(int i=0;i<n;i++){\n        cin>>height[i];\n    }\n    int i=0,j=height.size()-1;\n    int result=0;\n    while(i<j){\n        result=height[i]<height[j]?max(result,(j-i)*height[i++]):max(result,(j-i)*height[j--]);\n    }\n    if(n!=1)\n    cout<<result;\n    else\n        cout<<height[0];\n    return 0;\n}\n",WRONG_ANSWER,16,336
1591689513255362560,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-13 15:08:46,C,300.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[1000000],i,j,sum=0,k,b=0;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        int s=0;\n        for(j=0;j<n-i;j++)\n    {\n        if(a[i]<=a[i+j])\n            s=s+1;\n        else break;\n        }\n    for(k=1;k<=i;k++)\n    {\n        if(a[i]<=a[i-k])\n            s=s+1;\n        else break;\n    }\n     sum=a[i]*s;\n     if(sum>b)\n        b=sum;\n    }\n    printf(\""%d\"",b);\n    return 0;\n}",ACCEPTED,40,512
1591689522184990720,06b00897262b024d9e66dcd771cf81de9b63954f7a4554699d17c2158114c0d1,2022-11-13 15:08:48,Java,0.0,1591610585635213312,1589816514637750272,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner scan=new Scanner(System.in);\n\t\tint n=scan.nextInt();\n\t\tString str=scan.next();\n\t\tchar ch[]=str.toCharArray();\n\t\tint x=0;\n\t\tint i=0;\n\t\twhile(i<n-1) {\n\t\t\tif(ch[i]!=ch[i+1]) {\n\t\t\t\tx=x+2;\n\t\t\t\tfor(int j=i;j<n-1;j++){\n\t\t\t\t\tch[i]=ch[n-2];\n\t\t\t\t\tch[i]=ch[n-1];\n\t\t\t\t}\n\t\t\t\tn=n-2;\n\t\t\t\ti=i-1;\n\t\t\t}else {\n\t\t\t\ti++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(x);\n        scan.close;\n\t}\n},COMPILE_ERROR,0,0
1591689581853204480,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-13 15:09:03,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main (){\n    int n,a,b,i,sum1=0,sum2=0,sum=0;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    int c[n],f[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&f[i]);\n    for(i=0;i<n;i++){\n   sum1+=(c[i]/(f[i]+1))*pow(a,f[i]+1);\n   sum2+=(c[i]/(f[i]+1))*pow(b,f[i]+1);\n    }\n          sum=sum1-sum2;\n          printf(\""%d\\n\"",sum);\n}",WRONG_ANSWER,7,356
1591689678812884992,0ccbaaa612b3d01dbe621ce5e7366d6e26d2e5adf55047d92c6eb7adf78a979d,2022-11-13 15:09:26,C++,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int n;cin>>n;\n    int a[n],count=0;\n    for(int i=0;i<n;i++) cin>>a[i];\n    for(int i=1;i<n-1;i++)\n    {\n        if(a[i+1]<a[i]){\n            for(int j=i+1;j<n-1;j++){\n                if(a[j+1]>a[j]){count++;i=j;break;}\n            }\n        }\n    }\n    cout<<count;\n    return 0;\n}\n",ACCEPTED,46,640
1591689685507039232,e715137eeb4190ade2330123b989bbdd6eebd9a5e1df2e292271d3bfe3a79c69,2022-11-13 15:09:27,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint a[1000000]={0},d[1000000],q[1000000];\nint main()\n{\n    int i,j=0,k,n,b,c=1,w;\n    scanf(\""%d\"",&n);\n    k=n;\n    for(i=1;i<=n;i++)\n    {\n        scanf(\""%d\"",&b);\n        q[i]=b;\n        a[b]++;\n    }\n    c=q[1];\n    for(i=1;i<1000000;i++)\n    {\n        if(c<q[i])\n            c=q[i];\n    }\n    while(c>0)\n    {\n        k=n;\n        for(i=1;i<c;i++)\n        {\n            k-=a[i];\n        }\n        d[j]=c*k;\n        j++;\n        c--;\n    }\n    w=d[0];\n    for(i=0;i<j;i++)\n    {\n        if(w<d[i])\n            w=d[i];\n    }\n    printf(\""%d\\n\"",w);\n        \n}",WRONG_ANSWER,12,476
1591689691085418496,86f702b052a21d7cb2f8cd933c678c21efaafaf5b2d35032f18ec35c1e26a945,2022-11-13 15:09:29,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,max=0;\n    int c,b,x;\n    scanf(\""%d\"",&n);\n    int a[1000000]={0};\n    for(i=0;i<n;i++)\n    scanf(\""%d\"",&a[i]);\n    x=-1;\n   while(x<n-1)\n    {\n        c=a[x+1]-5;\n        b=a[x+3]-5;\n        if(c>=0) \n        {max=c+max;\n         x=x+1;}\n        else {\n             max=b+max;\n             x=x+3;\n            }\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",WRONG_ANSWER,10,4188
1591689706646331392,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-13 15:09:32,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main(){\n    int n,a[1000],count=0,i,j,t=0,c=0;\n      scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n     \n     \n    \n    for( j=1;j<n-1;j++)\n    {\n        \n        if(a[j]<a[j-1]&&a[j]<a[j+1])\n        {count++; }  \n             \n       else{\n        if(a[j]==a[j+1])\n         c++;\n            \n        \n        else\n        if(a[j]<a[j+1]&&a[j]<a[j-(c+1)]) {count+=1;c=0;}\n          if(a[j]<a[j+1]&&a[j]>a[j-c]) c=0;\n      }\n        \n            \n    }\n    \n    \n \n    \n    printf(\""%d\\n\"",count);\n         \n}",WRONG_ANSWER,27,468
1591689724836982784,1e783de44f6cf9abb158b108e556a36ef99d9241fc592b40cfd6cb7d1265eb34,2022-11-13 15:09:37,Java,300.0,1591610585635213312,1589816514637750272,1049226928954454016,import java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args) {\n\tScanner s=new Scanner(System.in);\n        int n=s.nextInt();//数的个数\n        String num=s.next();//接收数\n        int one=0;\n        int z=0;\n        for(int i=0;i<num.length();i++) {\n        \tif(num.charAt(i)=='0') {\n        \t\tz++;\n        \t}\n        \tif(num.charAt(i)=='1') {\n        \t\tone++;\n        \t}\n        }\n        if(one>=z) {\n        \t System.out.println(n-(one-z));\n        }else {\n        \t System.out.println(n-(z-one));\n        }\n             \n        }\n\t}\n\n,ACCEPTED,612,27840
1591689760060747776,5d7d397496e2400ea10e8ecafd4566e19d1083215d66cad8e11230c22227362c,2022-11-13 15:09:45,C++,300.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <bits/stdc++.h>\n\nusing namespace std;\nconst int N=1e5+10;\ntypedef long long ll;\nll n,l[N],dp[N];\nvoid solve()\n{\n    scanf(\""%lld\"",&n);\n    for(int i=1;i<=n;i++)scanf(\""%lld\"",&l[i]);\n    dp[0]=0;\n    l[0]=0;\n    for(int i=1;i<=n;i++)dp[i]=-N;\n    for(int i=0;i<n;i++)\n    {\n        dp[i+1]=max(dp[i+1],dp[i]+l[i+1]-5);\n        dp[i+3]=max(dp[i+3],dp[i]+l[i+3]-5);\n    }\n    printf(\""%d \"",dp[n]);\n}\nint main()\n{\n    solve();\n    return 0;\n}\n",ACCEPTED,54,896
1591689763642728448,06b00897262b024d9e66dcd771cf81de9b63954f7a4554699d17c2158114c0d1,2022-11-13 15:09:46,Java,0.0,1591610585635213312,1589816514637750272,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner scan=new Scanner(System.in);\n\t\tint n=scan.nextInt();\n\t\tString str=scan.next();\n\t\tchar ch[]=str.toCharArray();\n\t\tint x=0;\n\t\tint i=0;\n\t\twhile(i<n-1) {\n\t\t\tif(ch[i]!=ch[i+1]) {\n\t\t\t\tx=x+2;\n\t\t\t\tfor(int j=i;j<n-1;j++){\n\t\t\t\t\tch[i]=ch[n-2];\n\t\t\t\t\tch[i]=ch[n-1];\n\t\t\t\t}\n\t\t\t\tn=n-2;\n\t\t\t\ti=i-1;\n\t\t\t}else {\n\t\t\t\ti++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(x);\n        scan.close();\n\t}\n},NON_ZERO_EXIT_CODE,107,25020
1591689783116881920,f55f4c0e0e3367434e26a462e3665271f5b4141ea3de4f34d96fdb21d67e2a7c,2022-11-13 15:09:51,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{int n,a,b,f1,f2,c1,c2,A,B,C,D;\nint sum=0;\n  scanf(\""%d %d %d\"",&n,&a,&b);\n  scanf(\""%d %d\"",&c1,&c2);\n  scanf(\""%d %d\"",&f1,&f2);\n  A=(c1/(f1+1))*pow(a,f1+1);\n  B=(c2/(f2+1))*pow(a,f2+1);\n  C=(c1/(f1+1))*pow(b,f1+1);\n  D=(c2/(f2+1))*pow(b,f2+1);\n  sum=A+B-C-D;\n\nprintf(\""%d\\n\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,10,376
1591689801034948608,ddd0edd80a23dfec88d0679f4ed6037779b80d26db4ba0f74fecb3d447de61fa,2022-11-13 15:09:55,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n#define MAX 100000\nint main(){\n    int n,x,y,i,A[MAX],B[MAX],H[MAX],H1[MAX],sum1=0,sum2=0,A1,B1;\n    scanf(\""%d %d %d\"",&n,&x,&y);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&A[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&B[i]);\n    for(i=0;i<n;i++)\n    {\n        A1=pow(x,B[i]+1);\n     H[i]=A[i]/(B[i]+1)*A1;\n    sum1+=H[i];\n    }\n    for(i=0;i<n;i++)\n    { \n        B1=pow(y,B[i]+1);\n        H1[i]=A[i]/(B[i]+1)*B1;\n        sum2+=H1[i];\n    }\n    printf(\""%d\\n\"",sum1-sum2);\n}\n",WRONG_ANSWER,8,196
1591689833133924352,c47b15e117166a3dd00078b9f795673d5284a2761e582479119229751cc734d3,2022-11-13 15:10:03,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#define S 10000\n\n\nint main()\n{\n    int a=0,n,i,j,k;\n    int s[S];\n    int m[S];\n    scanf(\""%d\"",&n);\n    if(n>=1 && n<=10000)\n    {\n\n        for(i=0;i<n;i++)\n        scanf(\""%d\"",&s[i]);\n        for (i=0;i<n;i++)\n        {\n            if(s[i]>=1 && s[i]<=1000000)\n            {\n                    for(i=0;i<n;i++)\n                {\n\n\n                        for(i=0;i<n;i++)\n                    {\n                        k=1;\n                        for(j=i;j<n;j++)\n                        if(s[i]<=s[j])\n                        m[i]=s[i]*(k++);\n                        else break;\n                    }\n                for(i=0;i<n;i++)\n                {\n                    if(a<=m[i])\n                        a=m[i];\n                }\n                printf(\""%d\\n\"",a);\n                }\n            }\n            else break;\n        }\n\n\n\n\n\n\n\n\n    }\n    else printf(\""请重新输入\"");\n\n    return 0;\n}",WRONG_ANSWER,17,348
1591689861378367488,105cc8c0a5a465ab713603b461d92ac587c87767965625687540cd513f7ebb57,2022-11-13 15:10:09,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<bits/stdc++.h>\n#define N 10005\n#define endl '\\n'\n#define int long long\n#define ios ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)\n\n//const int dir[4][2]={-1,0,0,1,1,0,0,-1};\n//const int mod=1e9+7;\nusing namespace std;\n\ninline int read() {\n    char c = getchar(); int num = 0, sign = 1;\n    while(c < '0' || c > '9') {if(c == '-') sign = -1; c = getchar();}\n    while(c >= '0' && c <= '9') num = num * 10 + c - '0', c = getchar();\n    return num * sign;\n}\n\nvoid solve(){\n\tint nums[N][2];\n\tint res=0;\n\tint n,shang,xia;\n\tcin>>n>>shang>>xia;\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tcin>>nums[i][0];\n\t}\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tcin>>nums[i][1];\n\t}\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tres+=(pow(shang,nums[i][1]+1)-pow(xia,nums[i][1]+1))*nums[i][0]/(nums[i][1]+1);\n\t}\n\tcout<<res;\n}\n\nsigned main() {\n\tios;\n\tint count=1;\n\t//cin>>count;\n\twhile(count--)\n\t{\n\t\tsolve();\n\t}\n\treturn 0;\n}\n",WRONG_ANSWER,12,476
1591689875769012224,ddd0edd80a23dfec88d0679f4ed6037779b80d26db4ba0f74fecb3d447de61fa,2022-11-13 15:10:13,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n#define MAX 100000\nint main(){\n    int n,x,y,i,A[MAX],B[MAX],H[MAX],H1[MAX],sum1=0,sum2=0,A1,B1;\n    scanf(\""%d %d %d\"",&n,&x,&y);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&A[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&B[i]);\n    for(i=0;i<n;i++)\n    {\n        A1=pow(x,B[i]+1);\n     H[i]=A[i]/(B[i]+1)*A1;\n    sum1+=H[i];\n    }\n    for(i=0;i<n;i++)\n    { \n        B1=pow(y,B[i]+1);\n        H1[i]=A[i]/(B[i]+1)*B1;\n        sum2+=H1[i];\n    }\n    printf(\""%d\\n\"",sum1-sum2);\n}\n",WRONG_ANSWER,5,324
1591689885759856640,cf568c7ddc8b221335f880bfbaac4634294e65481e738a2e032c1ab9a84d576f,2022-11-13 15:10:15,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int n,m=0;\n     scanf(\""%d\"",&n);\n    int h[1000];\n    for(int i=0;i<n;i++){\n        scanf(\""%d\"",&h[i]);\n    }\n    for(int i=1;i<n-1;i++)\n    {\n        if(h[i]<h[i-1])\n        {\n            if(h[i]<h[i+1])\n            {\n                m++;\n            }\n        \n        else if(h[i]==h[i+1])\n        {\n            for(int j=i+1;h[j]==h[i];j++)\n            {\n                if(h[i]<h[j+1])\n                {\n                    m++;\n                    i=j;\n                }\n            }\n         }\n        }\n    }\n    printf(\""%d\"",m);\n\n  return 0;\n}",ACCEPTED,35,512
1591689891799642112,a27ecb139a3fa065feadb903517977dc609a6d218c4e082e7ec449c78806823c,2022-11-13 15:10:17,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#includ<stdio.h>\nint main()\n    {\n    int P,Q,R,M;\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    if(P>=Q&&P>=R)\n        M=Q+R;\n    if(Q>=P&&Q>=R)\n        M=P+R;\n    if(R>=P&&R>=Q)\n        M=P+Q;\n    print(\""%d\"",M);\n    rturn 0;\n    }\n        ",COMPILE_ERROR,0,0
1591689909969412096,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-13 15:10:21,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,j,count=0;\n    int h[n];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n    scanf(\""%d\"",&h[n]);}\n    h[0]=0;\n    h[n-1]=0;\n    for(j=1;j<n-1;j++){\n    if(h[j+1]<h[j])\n        count++;\n   }\n    printf(\""%d\"",count);\n    return 0;\n}\n",WRONG_ANSWER,6,328
1591689915514281984,630b8bfc88107b488e158fc7108c8faf0a195f9b9030c3faf51edac625714584,2022-11-13 15:10:22,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main(){\nint n,j=0,i,k=0,l;\nscanf(\""%d\"",&n);\nint h[n];\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&h[i]);\nfor(i=1;i<n+1;i++){\n    if(h[i]<h[i-1]) {l=i;break;}\n}\nif(l+1==n) printf(\""%d\"",k);\nelse{\n    i=l;\nfor(i;i<n;i++){\n            j=i;\n        for(j;j<n-1;j++){\n            if(h[i]>=h[j+1]) continue;\n            else {k++;i=j+2;}\n        }\n    }\nprintf(\""%d\"",k);\n}\nreturn 0;\n}\n",WRONG_ANSWER,11,344
1591689927791009792,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-13 15:10:25,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\nint main()\n{\n   int n;\n    int fen=0;\n    char arr[999];\n   scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        scanf(\""%c\"",&arr[i]);\n    }\n    for(int i=1;i<n;i++){\n        if(arr[i]!=arr[i-1]){\n            fen=fen+2;\n            for(int j=i-1;j<n;j++){\n                arr[i-1]=arr[i+1];\n            }\n            n=n-2;\n            i=i-2;\n        }\n    }\n    printf(\""%d\"",fen);\n   return 0;\n}",WRONG_ANSWER,9,352
1591689964038152192,172db3e4a89a3dc038ec44e9346ef3138ace8cc1576eb636ccaf26fd91d7a145,2022-11-13 15:10:34,C++,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <algorithm>\n\nusing namespace std;\nint main(){\n    int a,b,c;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    printf(\""%d\"",min(a+b,min(a+c,b+c)));\n    return 0;\n}",ACCEPTED,37,500
1591689980815355904,0b693affc66d8d407ff008bd1aaf4f2feb4a615f057943ba4b4ba3163d937dc6,2022-11-13 15:10:38,Java,300.0,1591610585635213312,1589816514637750272,1049226928954454016,"import java.io.*;\nimport java.util.*;\n\npublic class Main {\n\n    public static void main(String[] args) throws IOException {\n        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n        Scanner sc=new Scanner(System.in);\n        String s=br.readLine();\n        String str=br.readLine();\n        //String[] str=br.readLine().split(\"" \"");\n        int n=Integer.parseInt(s);\n        List<Character> list=new ArrayList<>();\n        int res=0;\n        char temp=str.charAt(0);\n        list.add(temp);\n        for (int i = 1; i < n; i++) {\n            char in=str.charAt(i);\n            if (temp!=in && list.size()!=0){\n                list.remove(list.size()-1);\n                res+=2;\n            }\n            else {\n                list.add(in);\n                temp=in;\n            }\n        }\n        for (int i = 0; i < list.size()-1; i++) {\n            char a=list.get(i);\n            char b=list.get(i+1);\n            if (a-b!=0){\n                res+=2;\n                list.remove(i);\n                list.remove(i);\n                i=-1;\n            }\n        }\n        System.out.println(res);\n    }\n}",ACCEPTED,542,26152
1591690031713280000,3e087b0a196d30fcbb49ca80164c9eb5adf82ae3bb08ec0c141e5728fb180f0d,2022-11-13 15:10:50,Java,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner sc=new Scanner(System.in);\n\t\tint i=0,res=0,len;\n\t\tsc.nextInt();\n\t\tsc.nextLine();\n\t\tString[] arr=sc.nextLine().split(\""\"");\n\t\tlen=arr.length;\n\t\twhile(i<=len-2){\n\t\t\tif(!(arr[i].equals(arr[i+1]))){\n\t\t\t\tres+=2;\n\t\t\t\tfor(int j=i;j<len-2;j++){\n\t\t\t\t\tarr[j]=arr[j+2];\n\t\t\t\t}\n\t\t\t\tlen-=2;\n\t\t\t\ti--;\n\t\t\t}else{\n\t\t\t\ti++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.print(res);\n\t\tsc.close();\n\t}\n\n}",NON_ZERO_EXIT_CODE,114,24612
1591690043021078528,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-13 15:10:53,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\n\n#define M 10000\n\nint main()\n\n{\n\n    int h[M],i,s[M],n,j,k[M],sum,l,m=0;\n\n    scanf(\""%d\"",&n);\n\n    for(i=0;i<n;i++)\n\n    scanf(\""%d\"",&h[i]);\n\n    for(j=0;j<n;j++)\n\n    {\n\n    for(i=0;i<n;i++)\n\n    k[i]=h[i];\n\n    sum=1;\n\n    for(i=j;i<n;i++)\n\n    {\n\n        if(k[i]<=k[i+1])\n\n        {\n\n            k[i+1]=k[i];\n\n            l=k[i];\n\n            sum++;\n\n        }\n\n    }\n\n    s[j]=l*sum;\n\n    }\n\n    for(i=0;i<n;i++)\n\n    if(m<s[i])\n\n    m=s[i];\n\n    printf(\""%d\\n\"",m);\n\n    return 0;\n\n}",WRONG_ANSWER,5,196
1591690136822538240,fbea21dbaf89f1b064feaa20227f21c5e1c4888fdc371cf5e43f70615906e52a,2022-11-13 15:11:15,Python,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"n=list(map(int,input().split()))\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\nx=n[1]**(b[0]+1)-n[2]**(b[0]+1) \ny=n[1]**(b[1]+1)-n[2]**(b[1]+1) \nz=int(x)+int(y)\nprint(z)",WRONG_ANSWER,22,3068
1591690189322608640,acf80eea856463058b81f71c0238069795893092293fbd098cc594959df6444e,2022-11-13 15:11:27,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"n=int(input())\ns=input().split()\nh=0\nfor i in range(1,n-1)\n    if s[i]<s[i-1] and s[i]<s[i+1] :\n        h=h+1\n    elif s[i]<s[i-1]:\n        if s[i]>s[i+1]:\n            continue\n        elif s[i]==s[i+1]:\n            if s[i]==s[i+1]&&i<n+1:\n                i++\n        else:\n            h=h+1\nprint(h)\n                \n                \n            \n            \n    ",NON_ZERO_EXIT_CODE,16,2908
1591690205751697408,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-13 15:11:31,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main (){\n    int n,a,b,i,sum=0;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    int c[n],f[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&f[i]);\n    for(i=0;i<n;i++){\n   sum+=(c[i]/(f[i]+1))*pow(a,f[i]+1)-(c[i]/(f[i]+1))*pow(b,f[i]+1);\n    }\n       \n          printf(\""%d\\n\"",sum);\n}",WRONG_ANSWER,7,196
1591690227360751616,86f702b052a21d7cb2f8cd933c678c21efaafaf5b2d35032f18ec35c1e26a945,2022-11-13 15:11:37,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,max=0;\n    int c,b,x;\n    scanf(\""%d\"",&n);\n    int a[1000000]={0};\n    for(i=1;i<=n;i++)\n    scanf(\""%d\"",&a[i]);\n    x=0;\n   while(x<n)\n    {\n        c=a[x+1]-5;\n        b=a[x+3]-5;\n        if(c>=0) \n        {max=c+max;\n         x=x+1;}\n        else {\n             max=b+max;\n             x=x+3;\n            }\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",WRONG_ANSWER,7,4308
1591690240321150976,a27ecb139a3fa065feadb903517977dc609a6d218c4e082e7ec449c78806823c,2022-11-13 15:11:40,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#includ<stdio.h>\nint main()\n    {\n    int P,Q,R,M;\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    if(P>=Q&&P>=R)\n        M=Q+R;\n    if(Q>=P&&Q>=R)\n        M=P+R;\n    if(R>=P&&R>=Q)\n        M=P+Q;\n    printf(\""%d\"",M);\n    return 0;\n    }\n        ",COMPILE_ERROR,0,0
1591690245287239680,6ba5ecacf3381a1e9382f99c413290eca40a071a563a618e5f36d66cbf9a5e1b,2022-11-13 15:11:41,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<iostream>\n\nusing namespace std;\n\nint main(){\nint n;\nint flag=3;\nlong imax=0,sum=0;\ncin>>n;\nlong h[n];\nfor(int i=0;i<n;i++){\n    cin>>h[i];\n}\n\nfor(int i=0;i<n;i++)\n{\n    for(int j=i;j<n;j++){\n        if(h[j]>=h[i])\n            flag=1;\n        else\n            flag=0;\n        if(flag==0){\n        sum=h[i]*(j-i);\n        //cout<<sum<<endl;\n        if(imax<sum)\n            imax=sum;\n        break;\n        }\n        if(flag==1 && j==n-1){\n            sum=h[i]*(j-i+1);\n           // cout<<sum<<endl;\n        if(imax<sum)\n\n            imax=sum;\n        break;\n        }\n    }\n}\nfor(int i=n-1;i>=0;i--)\n{\n    for(int j=i;j>=0;j--){\n        if(h[j]>=h[i])\n            flag=1;\n        else\n            flag=0;\n        if(flag==0){\n        sum=h[i]*(i-j);\n        //cout<<sum<<endl;\n        if(imax<sum)\n            imax=sum;\n        break;\n        }\n        if(flag==1 && j==n-1){\n            sum=h[i]*(i-j+1);\n          //  cout<<sum<<endl;\n        if(imax<sum)\n\n            imax=sum;\n        break;\n        }\n    }\n}\ncout<<imax<<endl;\n}\n",WRONG_ANSWER,26,604
1591690283170160640,d122b81a371b28751082747cf65a235d0eddfd496e142775cd971d8f88adf327,2022-11-13 15:11:50,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main(){\n  \n    int x,y,z;\n if(scanf(\""%d%d%d\"",&x,&y,&z)==1){printf(\""0\"");}\n      int min=0;\n    min=x+y;\n    if(x+z<=min&&x+z>min){\n        min=x+z;\n        printf(\""%d\\n\"",min);\n    }\n    if(y+z<=min&&x+z>min){\n        min=y+z;\n        printf(\""%d\\n\"",min);\n    }\n    if(y+z>min&&x+z>min){\n        printf(\""%d\\n\"",min);\n    \n }                                        \n    return 0;\n                                \n}",WRONG_ANSWER,20,452
1591690305962008576,acf80eea856463058b81f71c0238069795893092293fbd098cc594959df6444e,2022-11-13 15:11:55,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"n=int(input())\ns=input().split()\nh=0\nfor i in range(1,n-1):\n    if s[i]<s[i-1] and s[i]<s[i+1] :\n        h=h+1\n    elif s[i]<s[i-1]:\n        if s[i]>s[i+1]:\n            continue\n        elif s[i]==s[i+1]:\n            if s[i]==s[i+1] and i<n+1:\n                i++\n        else:\n            h=h+1\nprint(h)\n                \n                \n            \n            \n    ",NON_ZERO_EXIT_CODE,20,2904
1591690312874209280,70c675ddfcb60b2192bc8ac38fb068fec0500208a5bf97a796c7cc074b43cf87,2022-11-13 15:11:57,Java,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner myScanner = new Scanner(System.in);\n\t\tint n = myScanner.nextInt();\n\t\tint a = myScanner.nextInt();\n\t\tint b = myScanner.nextInt();\n\t\tint[] arr = new int[n]; //表示系数c\n\t\tint[] arr1 = new int[n];  //表示指数F\n\t\tint sum = 0;  //a的结果\n\t\tint sum1 = 0;  //b的结果\n\t\tint endsum = 0;\n\t\tfor(int i = 0;i < 2;i++){\n\t\t\tarr[i] = myScanner.nextInt();\n\t\t}\n\t\tfor(int i = 0;i < 2;i++){\n\t\t\tarr1[i] = myScanner.nextInt();\n\t\t}\n\t\tfor(int i = 0;i < 2;i++){\n\t\t\tif(arr[i] != -1)\n\t\t\t{\n\t\t\tint x1 = arr1[i]+1;\n\t\t\tint x = arr[i] / (x1);\n\t\t\tint y = (int) Math.pow(a,x1 );\n\t\t\tint y1 = (int) Math.pow(b,x1 );\n\t\t\tsum += x * y;\n\t\t\tsum1 += x * y1;\n\t\t\t}\n\t\t}\n\t\tendsum = sum-sum1;\n\t\tSystem.out.printf(\""%d\"",endsum);\n\t\t\n\t}\n\n}\n",WRONG_ANSWER,112,24868
1591690338614665216,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 15:12:03,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i;\n    int sum=0;\n    int t=0;\n    scanf(\""%d\"",&n);\n        int a[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=1;i<n-3;i=t)\n    {\n        if(a[i]>=a[i+3])\n        {\n            sum=sum+a[i]-5;\n            t=t+1;\n        }\n        else\n        {\n            sum=sum+a[i+3]-5;\n            t=t+3;\n        }\n        if(a[i+2]+a[i+1]+a[i]-15>0)\n        {\n            sum=sum+a[i]-5;\n            t=t+1;\n        }\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,6,348
1591690342867722240,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-13 15:12:04,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\n#define N 10000\n\n\nint pand(char *a,int i,int n)\n{\n    int b,c;\n    a[i]=a[i+2];\n    a[i+1]=a[i+3];\n    a[i+2]='\\0';\n    a[i+3]='\\0';\n    i++;\n    if(i<n) pand(a,i,n);\n    else return 0;\n\n}\n\n\n\n\n\n\nint main()\n{\n    char a[10000];\n    int n,i,j,k,l;\n    j=0;\n    scanf(\""%d\"",&n);\n    scanf(\""%s\"",&a);\n    for(l=0;l<n;l++){\n    for(i=0;i<n;i++)\n    {\n        //if(i=0&&a[0]!=a[1]) a[0]=a[2];\n        //a[1]=a[]\n        \n        k=i;\n        if(i>=0&&a[i]!=a[i+1])\n            {\n\n            pand(a,i,n);\n            n-=1;\n            j+=2;\n            //printf(\""%s\\n\"",a);\n\n            }\n\n    }\n    }//printf(\""!%s\"",a);\n\nprintf(\""%d\\n\"",j);\n\n\n\n\n\n    return 0;\n}",WRONG_ANSWER,15,288
1591690423943585792,40c43472973ea298adbdd1d4b900aeb63cfa4cfe17179f01a4827cd2c6624d3a,2022-11-13 15:12:23,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nmain()\n{\n    int n;\n    int h[20];\n    int i;\n    int t=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&h[i]);\n    }\n    for(i=0;i<n-2;i++)\n    {\n        if(h[i]>h[i+1])\n            t++;\n    }\n    printf(\""%d\"",t);\n}",WRONG_ANSWER,6,384
1591690461939785728,abe2744e33bb397ffb9bb13afcb202f611378fb4fc5801202f03933298ce5f5d,2022-11-13 15:12:32,Java,300.0,1591610585635213317,1591130976212869120,1049226928954454016,"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\npublic static void main(String[] args) throws IOException{\n\tBufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n\t\n\tString[] string = reader.readLine().split(\"" \"");\n\tint[] ints=new int[3];\n\t\n\tfor(int i=0;i<3;i++){\n\t\tints[i]=Integer.valueOf(string[i]);\n\t\n\t}\n\tint n=ints[0];\n\tint a=ints[1];\n\tint b=ints[2];\n\t\n\tint[] c=new int[n];\n\tstring = reader.readLine().split(\"" \"");\n\tfor(int i=0;i<n;i++){\n\t\tc[i]=Integer.valueOf(string[i]);\n\t\t\n\t}\n\tint[] point=new int[n];\n\tstring = reader.readLine().split(\"" \"");\n\tfor(int i=0;i<n;i++){\n\t\tpoint[i]=Integer.valueOf(string[i]);\n\t\t\n\t}\n\tint left=0;\n\tint right=0;\n\tfor(int j=0;j<n;j++){\n\t\t\n\t\t\n\t\t\tleft+=(float)c[j]/(point[j]+1)*Math.pow(a, point[j]+1);\n\t\t\tright+=(float)c[j]/(point[j]+1)*Math.pow(b, point[j]+1);\n\t\t\t\n\t\t}\n\tSystem.out.println(left-right);\n\t\n\n}\n}\n",ACCEPTED,339,23152
1591690468168314880,105cc8c0a5a465ab713603b461d92ac587c87767965625687540cd513f7ebb57,2022-11-13 15:12:34,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<bits/stdc++.h>\n#define N 10005\n#define endl '\\n'\n#define int long long\n#define ios ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)\n\n//const int dir[4][2]={-1,0,0,1,1,0,0,-1};\n//const int mod=1e9+7;\nusing namespace std;\n\ninline int read() {\n    char c = getchar(); int num = 0, sign = 1;\n    while(c < '0' || c > '9') {if(c == '-') sign = -1; c = getchar();}\n    while(c >= '0' && c <= '9') num = num * 10 + c - '0', c = getchar();\n    return num * sign;\n}\n\nvoid solve(){\n\tint nums[N][2];\n\tint res=0;\n\tint n,shang,xia;\n\tcin>>n>>shang>>xia;\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tcin>>nums[i][0];\n\t}\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tcin>>nums[i][1];\n\t}\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tint t=pow(shang,nums[i][1]+1)-pow(xia,nums[i][1]+1);\n\t\tres+=t*nums[i][0]/(nums[i][1]+1);\n\t}\n\tcout<<res;\n}\n\nsigned main() {\n\tios;\n\tint count=1;\n\t//cin>>count;\n\twhile(count--)\n\t{\n\t\tsolve();\n\t}\n\treturn 0;\n}\n",WRONG_ANSWER,5,476
1591690576536592384,d122b81a371b28751082747cf65a235d0eddfd496e142775cd971d8f88adf327,2022-11-13 15:13:00,C,0.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main(){\n  \n    int x,y,z;\n scanf(\""%d%d%d\"",&x,&y,&z);\n      int min=0;\n    min=x+y;\n    if(x+z<=min&&x+z>min){\n        min=x+z;\n        printf(\""%d\\n\"",min);\n    }\n    if(y+z<=min&&x+z>min){\n        min=y+z;\n        printf(\""%d\\n\"",min);\n    }\n    if(y+z>min&&x+z>min){\n        printf(\""%d\\n\"",min);\n    \n }                                        \n    return 0;\n                                \n}",WRONG_ANSWER,25,328
1591690579501920256,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 15:13:00,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i;\n    int sum=0;\n    int t=0;\n    scanf(\""%d\"",&n);\n        int a[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=1;i<n-3;i=t)\n    {\n        if(a[i]>=a[i+3])\n        {\n            sum=sum+a[i]-5;\n            t=t+1;\n        }\n        else\n        {\n            sum=sum+a[i+3]-5;\n            t=t+3;\n        }\n        if(a[i+2]+a[i+1]+a[i]-15>0)\n        {\n            sum=sum+a[i+1]-5;\n            t=t+1;\n        }\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,7,384
1591690580714074112,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 15:13:01,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <string.h>\nint main()\n{\n    int k,len,i,g=0,l=0;\n    char str[50];\n    scanf(\""%d\"",&k);\n    scanf(\""%s\"",str);\n    len  = strlen(str);\n    for(i=0;i<=len;i++)\n    {\n        if(str[i]=='0')\n        g++;\n        else\n        l++;\n    }\n    //g-=8;//0的个数;\n    //l-=52;//1的个数;\n    if(g>l)\n    printf(\""%d\\n\"",2*l);\n    else\n    printf(\""%d\\n\"",2*g);\n    return 0;\n}\n\n",SEGMENTATION_FAULT,49,640
1591690732585639936,e9a50f3e071443bb6fb229966bff355c178d484f6cc10e5e1fc8dc5a537237ba,2022-11-13 15:13:37,C,300.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int b,c,i,j,max=0,k=0;\n    scanf(\""%d\"",&b);\n    int a[b];\n    for(i=0;i<b;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<b;i++){\n\n        for(j=0;j<b;j++)\n        {\n            if(a[i]>a[j])\n            {   k=0;\n\n            }\n            else  {\n                    k=k+1;\n                    c=a[i]*k;\n                    if(max<c) max=c;\n            }\n\n        }\n        k=0;\n    }\n    printf(\""%d\\n\"",max);\n}\n",ACCEPTED,34,468
1591690788554465280,b80fc2aed0abde15bdaa9327874c9784da696b6ed442d90001602ff2a017be15,2022-11-13 15:13:50,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h> \n#include<math.h> \nint main()\n{\n\n   int i,j,sum=0;\n   int a,m;\n   scanf(\""%d\"",&a);\n   char n[100000];\n  scanf(\""%s\"",n);\n  m=a;\n  for(j=0;j<m-1;j++)\n     {\n\t for(i=0;i<a-1;i++)\n\t {\n\t if(n[i]==n[i+1])\n\t   { \n\t   for(;i<a-2;i++)\n\t    n[i]=n[i+2];\n\t\ta=a-2;\n        sum=sum+2;\n\t\tbreak;\n\t}\n\t\n  } \n}\n   \n   printf(\""%d\"",sum);\n   printf(\""\\n\"");\n   return 0; \n   \n} ",WRONG_ANSWER,5,352
1591690840769323008,6ba5ecacf3381a1e9382f99c413290eca40a071a563a618e5f36d66cbf9a5e1b,2022-11-13 15:14:03,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<iostream>\n\nusing namespace std;\n\nint main(){\nint n;\nint flag=3;\nlong imax=0,sum=0;\ncin>>n;\nlong h[n];\nfor(int i=0;i<n;i++){\n    cin>>h[i];\n}\n\nfor(int i=0;i<n;i++)\n{\n    for(int j=i;j<n;j++){\n        if(h[j]>=h[i])\n            flag=1;\n        else\n            flag=0;\n        if(flag==0){\n        sum=h[i]*(j-i);\n        //cout<<sum<<endl;\n        if(imax<sum)\n            imax=sum;\n        break;\n        }\n        if(flag==1 && j==n-1){\n            sum=h[i]*(j-i+1);\n           // cout<<sum<<endl;\n        if(imax<sum)\n\n            imax=sum;\n        break;\n        }\n    }\n}\nfor(int i=n-1;i>=0;i--)\n{\n    for(int j=i;j>=0;j--){\n        if(h[j]>=h[i])\n            flag=1;\n        else\n            flag=0;\n        if(flag==0){\n        sum=h[i]*(i-j);\n        //cout<<sum<<endl;\n        if(imax<sum)\n            imax=sum;\n        break;\n        }\n        if(flag==1 && j==0){\n            sum=h[i]*(i-j+1);\n          //  cout<<sum<<endl;\n        if(imax<sum)\n\n            imax=sum;\n        break;\n        }\n    }\n}\ncout<<imax<<endl;\n}\n",WRONG_ANSWER,26,640
1591690846725222400,e51465ce72346fac918042a342986433269a159492161f223a180a6e05d9a01a,2022-11-13 15:14:04,Java,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\t\npublic static void main(String[] args) {\n\t    Scanner in =new Scanner(System.in);\n\t    int result=0;\n\t    int n = 0,a=0,b = 0;\n\t    n = in.nextInt();\n\t    a = in.nextInt();\n\t    \n\t    int [] c = new int[n];\n\t    int [] f =new int[n];\n\t    b = in.nextInt();\n\t    for(int i=0;i<n;i++){\n\t    \tc[i]=in.nextInt();\n\t    }\n\t    for(int i=0;i<n;i++){\n\t    \tf[i]=in.nextInt();\n\t    }\n\t    if(a==0){\n\t    \t System.out.println(0);\n\t    \t return;\n\t    }\n\t    \n\t    for(int i=0;i<n;i++){\n\t\n\t    \tresult+=(c[i]*(Math.pow(a, f[i]+1)-Math.pow(b, f[i]+1)))/(f[i]+1);\n\t    }  \n\t   \n\t    System.out.println(result);\n\t    \n}\n}",WRONG_ANSWER,109,24688
1591690944544792576,e7e6ce2c6e9e530eaf2b9b9968748a0e44e3ac7183d73deb51851946350bfbb0,2022-11-13 15:14:28,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    int flag=0;\n    int i;\n    int n,h[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++) {\n        scanf(\""%d\"",&h[i]);\n    }\n\n     for(i=0;i<n-1;i++) {\n        if(h[i]==h[i-1] || h[i]==h[i+1])\n            i++;\n         break;\n\n        if(h[i]<h[i-1]&&h[i]<h[i+1])\n            flag++;\n\n     }\n\n    printf(\""%d\"",flag);\n    return 0;\n}\n",WRONG_ANSWER,8,200
1591690955580039168,9a1ecd1db02b268060006afd7de34ec54e74e90bf61becbb6811fb23971c4720,2022-11-13 15:14:30,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,def iss(x):\n    if x==1:\n        return s\n    else:\n        for i in range(x-1):\n            if s[i]!=s[i+1]:\n                s.pop(i)\n                s.pop(i)\n                l=len(s)\n                return iss(l)\n            elif i==x-2:\n                return s\n\nn=int(input())\ns=list(input())\nl=n\niss(l)\nz=len(s)\nprint(n-z)\n\n,NON_ZERO_EXIT_CODE,124,4692
1591690989864280064,acf80eea856463058b81f71c0238069795893092293fbd098cc594959df6444e,2022-11-13 15:14:38,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"n=int(input())\ns=input().split()\nh=0\nfor i in range(1,n-1):\n    if s[i]<s[i-1] and s[i]<s[i+1] :\n        h=h+1\n    elif s[i]<s[i-1]:\n        if s[i]>s[i+1]:\n            continue\n        elif s[i]==s[i+1]:\n            if s[i]==s[i+1] and i<n+1:\n                i++\n        else:\n            h=h+1\nprint(h)\n",NON_ZERO_EXIT_CODE,24,3028
1591690991525191680,e7e6ce2c6e9e530eaf2b9b9968748a0e44e3ac7183d73deb51851946350bfbb0,2022-11-13 15:14:39,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    int flag=0;\n    int i;\n    int n,h[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++) {\n        scanf(\""%d\"",&h[i]);\n    }\n\n     for(i=0;i<n-1;i++) {\n        if(h[i]==h[i-1] || h[i]==h[i+1])\n            i++;\n      \n\n        if(h[i]<h[i-1]&&h[i]<h[i+1])\n            flag++;\n\n     }\n\n    printf(\""%d\"",flag);\n    return 0;\n}\n",WRONG_ANSWER,6,484
1591691008918958080,6ba5ecacf3381a1e9382f99c413290eca40a071a563a618e5f36d66cbf9a5e1b,2022-11-13 15:14:43,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<iostream>\n\nusing namespace std;\n\nint main(){\nint n;\nint flag=3;\nlong imax=0,sum=0;\ncin>>n;\nlong h[n];\nfor(int i=0;i<n;i++){\n    cin>>h[i];\n}\n\nfor(int i=0;i<n;i++)\n{\n    for(int j=i;j<n;j++){\n        if(h[j]>=h[i])\n            flag=1;\n        else\n            flag=0;\n        if(flag==0){\n        sum=h[i]*(j-i);\n       // cout<<sum<<endl;\n        if(imax<sum)\n            imax=sum;\n        break;\n        }\n        if(flag==1 && j==n-1){\n            sum=h[i]*(j-i+1);\n           // cout<<sum<<endl;\n        if(imax<sum)\n\n            imax=sum;\n        break;\n        }\n    }\n}\nfor(int i=n-1;i>=0;i--)\n{\n    for(int j=i;j>=0;j--){\n        if(h[j]>=h[i])\n            flag=1;\n        else\n            flag=0;\n        if(flag==0){\n        sum=h[i]*(i-j);\n        //cout<<sum<<endl;\n        if(imax<sum)\n            imax=sum;\n        break;\n        }\n        if(flag==1 && j==0){\n            sum=h[i]*(i-j+1);\n            //cout<<sum<<endl;\n        if(imax<sum)\n\n            imax=sum;\n        break;\n        }\n    }\n}\ncout<<imax<<endl;\n}\n",WRONG_ANSWER,29,480
1591691092574396416,c76414e1d2d8531a5745e9bd3192aafa7cca924e645650ffe7954c992cc13b33,2022-11-13 15:15:03,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\nint n,a,b,i;\nint sum=0;\nscanf(\""%d %d %d\"",&n,&a,&b);\nint s1[n],s2[n];\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&s1[i]);\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&s2[i]);\n\nfor(i=0;i<n;i++)\n    {\n    sum=sum+s1[i]/(s2[i]+1)*pow(a,s2[i]+1)-s1[i]/(s2[i]+1)*pow(b,s2[i]+1);\n    }\nprintf(\""%d\"",sum);\n}\n",WRONG_ANSWER,13,376
1591691143635820544,a5291eb67188c2a916aa5dd9fc38f2e449aa9f9a3cd047f282d8c154ea2979cd,2022-11-13 15:15:15,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <iostream>\nusing namespace std;\nconst int N = 1e6 + 10;\nint c[N];\nint F[N];\n\nint main()\n{\n    int n,a,b;\n    cin >> n >> a >> b;\n    for(int i = 1;i <= n;i++)\n    {\n        cin >> c[i];\n    }\n    for(int i = 1;i <= n;i++)\n    {\n        cin >> F[i];\n    }\n    int sum1 = 0;\n    int sum2 = 0;\n    for(int i = 1;i <= n;i++)\n    {\n        int m = a;\n        if(F[i] + 1 == 0)\n        {\n            m = 1;\n        }\n        for(int j = 2;j <= F[i] + 1;j++)\n        {\n            m *= a;\n        }\n        sum1 += ((c[i]/(F[i] + 1)) * m);\n    }\n    \n    for(int i = 1;i <= n;i++)\n    {\n        int m = b;\n        if(F[i] + 1 == 0)\n        {\n            m = 1;\n        }\n        for(int j = 2;j <= F[i] + 1;j++)\n        {\n            m *= b;\n        }\n        sum2 += ((c[i]/(F[i] + 1)) * m); \n    }\n    \n    \n    cout << sum1 - sum2 << endl;\n    return 0;\n}",WRONG_ANSWER,10,488
1591691151961513984,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-13 15:15:17,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"a=int(input())\ndata=list(map(int,input().split()))\ncount=0\ndatas=[]\nfor i in range(0,a):\n    if len(datas)==0:\n       datas.append(data[i])\n    elif datas[len(datas)-1]>=data[i]:\n            datas.append(data[i])\n    elif i==1 and  datas[len(datas)-1]<data[i]:\n        count=count\n    else:\n        if max(datas)!=datas[0]:\n            print(data[i])\n            datas=[data[i]]\n            count+=1\nprint(count)\n",WRONG_ANSWER,25,3088
1591691160413069312,b80fc2aed0abde15bdaa9327874c9784da696b6ed442d90001602ff2a017be15,2022-11-13 15:15:19,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h> \n#include<math.h> \nint main()\n{\n\n   int i,j,sum=0;\n   int a,m;\n   scanf(\""%d\"",&a);\n   char n[100000];\n  scanf(\""%s\"",n);\n  m=a;\n  for(j=0;j<m-1;j++)\n     {\n\t for(i=0;i<a-1;i++)\n\t {\n\t if(n[i]==n[i+1])\n\t   { \n\t   for(;i<a-2;i++)\n\t    n[i]=n[i+2];\n\t\ta=a-2;\n        sum=sum+2;\n\t\tbreak;\n\t}\n\t\n  } \n}\n   \n   printf(\""%d\"",sum);\n   printf(\""\\n\"");\n   return 0; \n   \n} ",WRONG_ANSWER,9,384
1591691160945700864,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 15:15:19,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int n,i;\n    int sum=0;\n    int t=0;\n    scanf(\""%d\"",&n);\n        int a[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=1;i<n-3;i=t)\n    {\n        if(a[i]>=a[i+3])\n        {\n            sum=sum+a[i]-5;\n            t=t+1;\n        }\n        else\n        {\n            sum=sum+a[i+3]-5;\n            t=t+3;\n        }\n        if(a[i+2]+a[i+1]+a[i]-15>0)\n        {\n            sum=sum+a[i]-5;\n            t=t+1;\n        }\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,6,324
1591691165303582720,6a4a105e99255cc39ebb6a122c9fdf740e574dbb708100363b339265f92e1bbf,2022-11-13 15:15:20,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include <stdlib.h>\nint main(){\n    int n,i,x;\n    scanf(\""%d\\n\"",&n);\n    int s[n];\n    for(i=1;i<=n;i++){\n        scanf(\""%d\"",&s[i]);\n        }\n\n    for(;i<n;i++){\n        for(x=0;x<=i;){\n            if(s[i]=='0'&&s[i+1]=='1'||s[i]=='1'&&s[i]=='0'){\n                s[i]=s[i+2];\n                x+2;\n            }\n        }\n    }\n    printf(\""%d\"",x);\n}\n",WRONG_ANSWER,5,328
1591691178805047296,eeab3421c2b685f7d51b09a289b82fe82ba0d3896984d09aeffb9d022232d887,2022-11-13 15:15:23,Java,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.math.BigDecimal;\nimport java.util.Arrays;\nimport java.util.Scanner;\nimport java.util.StringTokenizer;\n\npublic class Main {\n    static  String str2;\n\n    public static void main(String[] args) {\n        FastReader fastReader =  new FastReader();\n        int n = fastReader.nextInt();\n        String str = fastReader.next();\n        int sum = 0;\n        char[] c = str.toCharArray();\n        for(int i=0;i<c.length;i++){\n            int x,y;\n            while(i<n && c[i]=='a' ) ++i;\n            char a,b;\n            if(i<n) {\n                 a = c[i];\n                x = i;\n            }else break;\n\n            while(i+1<n && c[i+1] == 'a') ++i;\n            if(i+1<n) {\n                 b = c[i + 1];\n                y = i+1;\n            }else break;\n\n            if(a != b) {\n                sum+=2;\n                c[x] = 'a';\n                c[y]  = 'a';\n                i = -1;\n            }\n        }\n        System.out.println(sum);\n    }\n\n\n    static class FastReader {\n        BufferedReader br;\n        StringTokenizer st;\n        public FastReader()\n        {\n            br = new BufferedReader(\n                    new InputStreamReader(System.in));\n        }\n\n\n        String next()\n        {\n            while (st == null || !st.hasMoreElements()) {\n                try {\n                    st = new StringTokenizer(br.readLine());\n                }\n                catch (IOException e) {\n                    e.printStackTrace();\n                }\n            }\n            return st.nextToken();\n        }\n\n\n\n        int nextInt() { return Integer.parseInt(next()); }\n\n        long nextLong() { return Long.parseLong(next()); }\n\n        double nextDouble(){return Double.parseDouble(next());}\n\n\n        String nextLine()\n        {\n            String str = \""\"";\n\n            try {\n                if (st!= null && st.hasMoreTokens()){\n                    str = st.nextToken(\""\\n\"");\n                } else {\n                    str = br.readLine();\n                }\n            }\n            catch (IOException e) {\n                e.printStackTrace();\n            }\n            return str;\n        }\n\n\n    }\n}\n\n\n\n",TIME_LIMIT_EXCEEDED,665,24996
1591691218046967808,ddd0edd80a23dfec88d0679f4ed6037779b80d26db4ba0f74fecb3d447de61fa,2022-11-13 15:15:33,C++,300.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n#define MAX 100000\nint main(){\n    float n,x,y,A[MAX],B[MAX],H[MAX],H1[MAX],sum1=0,sum2=0,A1,B1;\n    int i;\n    scanf(\""%f %f %f\"",&n,&x,&y);\n    for(i=0;i<n;i++)\n        scanf(\""%f\"",&A[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%f\"",&B[i]);\n    for(i=0;i<n;i++)\n    {\n        A1=pow(x,B[i]+1);\n     H[i]=A[i]/(B[i]+1)*A1;\n    sum1+=H[i];\n    }\n    for(i=0;i<n;i++)\n    { \n        B1=pow(y,B[i]+1);\n        H1[i]=A[i]/(B[i]+1)*B1;\n        sum2+=H1[i];\n    }\n    printf(\""%d\\n\"",int(sum1-sum2));\n}\n",ACCEPTED,28,364
1591691258723360768,fbea21dbaf89f1b064feaa20227f21c5e1c4888fdc371cf5e43f70615906e52a,2022-11-13 15:15:42,Python,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"n=list(map(int,input().split()))\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\nsum=0\nfor i in range(n[0]):\n    x=n[1]**(b[i]+1)-n[2]**(b[i]+1) \n    sum+=x\nprint(sum)",WRONG_ANSWER,37,2948
1591691289421471744,6ba5ecacf3381a1e9382f99c413290eca40a071a563a618e5f36d66cbf9a5e1b,2022-11-13 15:15:50,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<iostream>\n\nusing namespace std;\n\nint main(){\nint n;\nint flag=3;\nlong imax=0,sum=0;\ncin>>n;\nlong h[n];\nfor(int i=0;i<n;i++){\n    cin>>h[i];\n}\n\nfor(int i=0;i<n;i++)\n{\n    for(int j=i;j<n;j++){\n        if(h[j]>=h[i])\n            flag=1;\n        else\n            flag=0;\n        if(flag==0){\n        sum=h[i]*(j-i);\n       // cout<<sum<<endl;\n        if(imax<sum)\n            imax=sum;\n        break;\n        }\n        if(flag==1 && j==n-1){\n            sum=h[i]*(j-i+1);\n           // cout<<sum<<endl;\n        if(imax<sum)\n            imax=sum;\n        break;\n        }\n    }\n}\nfor(int i=n-1;i>=0;i--)\n{\n    for(int j=i;j>=0;j--){\n        if(h[j]>=h[i])\n            flag=1;\n        else\n            flag=0;\n        if(flag==0){\n        sum=h[i]*(i-j);\n        //cout<<sum<<endl;\n        if(imax<sum)\n            imax=sum;\n        break;\n        }\n        if(flag==1 && j==0){\n            sum=h[i]*(i-j+1);\n            //cout<<sum<<endl;\n        if(imax<sum)\n            imax=sum;\n        break;\n        }\n    }\n}\ncout<<imax<<endl;\n}\n",WRONG_ANSWER,22,616
1591691295159234560,e7e6ce2c6e9e530eaf2b9b9968748a0e44e3ac7183d73deb51851946350bfbb0,2022-11-13 15:15:51,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    int flag=0;\n    int i;\n    int n,h[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++) {\n        scanf(\""%d\"",&h[i]);\n    }\n\n     for(i=0;i<n-1;i++) {\n        if(h[i]==h[i-1] || h[i]==h[i+1])\n            i++;\n      \n\n        if(h[i]<h[i+1]&&h[i]<h[i-1])\n            flag++;\n\n     }\n\n    printf(\""%d\"",flag);\n    return 0;\n}\n",WRONG_ANSWER,8,348
1591691366793797632,e7e6ce2c6e9e530eaf2b9b9968748a0e44e3ac7183d73deb51851946350bfbb0,2022-11-13 15:16:08,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    int flag=0;\n    int i;\n    int n,h[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++) {\n        scanf(\""%d\"",&h[i]);\n    }\n\n     for(i=0;i<n;i++) {\n        if(h[i]==h[i-1] || h[i]==h[i+1])\n            i++;\n      \n\n        if(h[i]<h[i+1]&&h[i]<h[i-1])\n            flag++;\n\n     }\n\n    printf(\""%d\"",flag);\n    return 0;\n}\n",WRONG_ANSWER,5,200
1591691413145051136,281adcca8943f9f4c0ced14f1ceffe157a34fca39f3cb864eb95e400944e38a8,2022-11-13 15:16:19,Java,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner scan=new Scanner(System.in);\n\t\tint n=scan.nextInt();\n\t\tint[] arr=new int[n];\n\t\tint s=0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tarr[i]=scan.nextInt();\n\t\t}\n\t\tint max=0;\n\t\tint len=0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tint h=arr[i];\n\t\t\tfor(int j=i;j<n;j++){\n\t\t\t\tif(h>arr[j]){\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tlen++;\n\t\t\t\ts=len*h;\n\t\t\t}\n\t\t\tmax=Math.max(s, max);\n\t\t\ts=0;\n\t\t\tlen=0;\n\t\t}\n\t\tSystem.out.println(max);\n\t}\n}\n",WRONG_ANSWER,341,24944
1591691441313996800,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-13 15:16:26,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<iostream>\nusing namespace std;\nclass resolve{\n    public:\n    void resve(int *h,int n){\n        int nums=0;\n        for(int i=1;i<n-1;i++){\n            if(h[i]<h[i-1]){\n                for(int j=i;j<n-1;j++){\n                    if(h[j]<h[j+1]){\n                        nums++;\n                        i=j+2;\n                        break;\n                    }   \n                }\n            }\n        }\n        cout<<nums<<endl;\n    }  \n};\n\nint main(){\n    int n,h[1000]={0};\n    cin>>n;\n    if(n<3)\n        return 0;\n    for(int i=0;i<n;i++){\n        cin>>h[i];\n    }\n    resolve res;\n    if(h[0]==0&&h[n-1]==0)\n        res.resve(h,n);\n    return 0;\n}",WRONG_ANSWER,10,324
1591691473828241408,40c43472973ea298adbdd1d4b900aeb63cfa4cfe17179f01a4827cd2c6624d3a,2022-11-13 15:16:34,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nmain()\n{\n    int n;\n    int h[20];\n    int i;\n    int t=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&h[i]);\n    }\n    for(i=0;i<n-2;i++)\n    {\n        if(h[i]>h[i+1])\n            t++;\n    }\n    printf(\""%d\"",t);\n}",WRONG_ANSWER,5,364
1591691514013835264,5bd1a8718ea7fb820055421c67b8e0a468e08d951f729a24e55bf407b3bdb1f6,2022-11-13 15:16:43,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <iostream>\n#include <algorithm>\n#include <vector>\nusing namespace std;\n\n\n\n\n\n\nint main()\n{\n\n    int n;\n    cin>>n;\n    vector<int> height(n);\n    for(int i=0;i<n;i++){\n        cin>>height[i];\n    }\n    int i=0,j=height.size()-1;\n    int result=0;\n    while(i<j){\n        result=height[i]<height[j]?max(result,(j-i)*height[i++]):max(result,(j-i)*height[j--]);\n    }\n    if(n!=1&&n!=2)\n    cout<<result;\n    else if(n==2)\n        cout<<2*min(height[0],height[1]);\n    return 0;\n}\n",WRONG_ANSWER,17,640
1591691554241437696,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-13 15:16:53,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\n#define N 10000\n\n\nint pand(char *a,int i,int n)\n{\n    int b,c;\n    a[i]=a[i+2];\n    a[i+1]=a[i+3];\n    i++;\n    if(i<n) pand(a,i,n);\n    else return 0;\n\n}\n\n\n\n\n\n\nint main()\n{\n    char a[10000];\n    int n,i,j,k,l;\n    j=0;\n    scanf(\""%d\"",&n);\n    scanf(\""%s\"",&a);\n    a[n]='\\0';\n    for(l=0;l<n;l++){\n    for(i=0;i<n;i++)\n    {\n        //if(i=0&&a[0]!=a[1]) a[0]=a[2];\n        //a[1]=a[]\n        \n        k=i;\n        if(i>=0&&a[i]!=a[i+1])\n            {\n//printf(\""%s\\n\"",a);\n            pand(a,i,n);\n            n-=1;\n            j+=2;\n            \n\n            }\n\n    }\n    }//printf(\""!%s\"",a);\n\nprintf(\""%d\\n\"",j);\n\n\n\n\n\n    return 0;\n}",WRONG_ANSWER,4,376
1591691558507012096,899c5501179552dc1fe5639f9047e15d0f835e7a87c8568193377882d0278985,2022-11-13 15:16:54,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,i,count=0;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if((a[i-1]>a[i])&&(a[i+1]>a[i])||a[i]==a[i+1])\n            count+=1;\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",WRONG_ANSWER,10,360
1591691573501648896,5bd1a8718ea7fb820055421c67b8e0a468e08d951f729a24e55bf407b3bdb1f6,2022-11-13 15:16:57,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <iostream>\n#include <algorithm>\n#include <vector>\nusing namespace std;\n\n\n\n\n\n\nint main()\n{\n\n    int n;\n    cin>>n;\n    vector<int> height(n);\n    for(int i=0;i<n;i++){\n        cin>>height[i];\n    }\n    int i=0,j=height.size()-1;\n    int result=0;\n    while(i<j){\n        result=height[i]<height[j]?max(result,(j-i)*height[i++]):max(result,(j-i)*height[j--]);\n    }\n    if(n!=1&&n!=2)\n    cout<<result;\n    else if(n==2)\n        cout<<2*min(height[0],height[1]);\n    return 0;\n}\n",WRONG_ANSWER,11,512
1591691702254231552,899c5501179552dc1fe5639f9047e15d0f835e7a87c8568193377882d0278985,2022-11-13 15:17:28,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,i,count=0;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if(((a[i-1]>a[i])&&(a[i+1]>a[i]))||a[i]==a[i+1])\n            count+=1;\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",WRONG_ANSWER,13,200
1591691704582070272,b80fc2aed0abde15bdaa9327874c9784da696b6ed442d90001602ff2a017be15,2022-11-13 15:17:29,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h> \n#include<math.h> \nint main()\n{\n\n   int i,j,sum=0;\n   int a,m;\n   scanf(\""%d\"",&a);\n   char n[100000];\n  scanf(\""%s\"",n);\n  m=a;\n  for(j=0;j<m-1;j++)\n     {\n\t for(i=0;i<a-1;i++)\n\t {\n\t if(n[i]!=n[i+1])\n\t   { \n\t   for(;i<a-2;i++)\n\t    n[i]=n[i+2];\n\t\ta=a-2;\n        sum=sum+2;\n\t\tbreak;\n\t}\n\t\n  } \n}\n   printf(\""%d\"",sum);\n\n   return 0; \n   \n} ",TIME_LIMIT_EXCEEDED,421,456
1591691750446751744,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-13 15:17:40,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main (){\n    int n,a,b,i,sum=0;;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    int c[n],f[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&f[i]);\n    for(i=0;i<n;i++){\n   sum+=(c[i]/(f[i]+1))*pow(a,f[i]+1)-(c[i]/(f[i]+1))*pow(b,f[i]+1);\n    }\n      \n          printf(\""%d\\n\"",sum);\n}",WRONG_ANSWER,8,360
1591691761783955456,a27ecb139a3fa065feadb903517977dc609a6d218c4e082e7ec449c78806823c,2022-11-13 15:17:42,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main()\n    {\n    int P,Q,R,M;\n    scanf(\""%d%d%d\"",&P,&Q,&R);\n    if(P>=Q&&P>=R)\n        M=Q+R;\n    if(Q>=P&&Q>=R)\n        M=P+R;\n    if(R>=P&&R>=Q)\n        M=P+Q;\n    printf(\""%d\"",M);\n    return 0;\n    }\n        ",ACCEPTED,37,512
1591691808177152000,e51465ce72346fac918042a342986433269a159492161f223a180a6e05d9a01a,2022-11-13 15:17:53,Java,0.0,1591610585639407617,1591132482555211776,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n\t\npublic static void main(String[] args) {\n\t    Scanner sc =new Scanner(System.in);\n\t    int num  =sc.nextInt();\n\t    int index=0;\n\t    int max = 0;\n\t    int result=0;\n\t    int s=0;\n\t    int [] arr=new int [num];\n\t    for(int i=0;i<num;i++){\n\t    \tarr[i]=sc.nextInt();\n\t    \t if(arr[i]>max){\n\t    \t\t max=arr[i];\n\t    \t }\t    \t  \n\t    }\n\t    \n\t    for(int i=0;i<=max;i++){\n\t    \t    index=0;\n\t    \tfor(int j=0;j<arr.length;j++){\n\t    \t\tif(arr[j]>=i){\n\t    \t\t\tindex++;\n\t    \t\t}\n\t    \t\t\n\t    \t}\n\t    \ts=index*i;\n    \t\t\n\t    \tif(s>result){\n\t    \t\tresult=s;\n\t    \t}\n\t    }\n\t    System.out.println(result);\n\t    \n}\n},WRONG_ANSWER,110,24532
1591691828494348289,e51465ce72346fac918042a342986433269a159492161f223a180a6e05d9a01a,2022-11-13 15:17:58,Java,0.0,1591610585639407617,1591132482555211776,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n\t\npublic static void main(String[] args) {\n\t    Scanner sc =new Scanner(System.in);\n\t    int num  =sc.nextInt();\n\t    int index=0;\n\t    int max = 0;\n\t    int result=0;\n\t    int s=0;\n\t    int [] arr=new int [num];\n\t    for(int i=0;i<num;i++){\n\t    \tarr[i]=sc.nextInt();\n\t    \t if(arr[i]>max){\n\t    \t\t max=arr[i];\n\t    \t }\t    \t  \n\t    }\n\t    \n\t    for(int i=0;i<=max;i++){\n\t    \t    index=0;\n\t    \tfor(int j=0;j<arr.length;j++){\n\t    \t\tif(arr[j]>=i){\n\t    \t\t\tindex++;\n\t    \t\t}\n\t    \t\t\n\t    \t}\n\t    \ts=index*i;\n    \t\t\n\t    \tif(s>result){\n\t    \t\tresult=s;\n\t    \t}\n\t    }\n\t    System.out.println(result);\n\t    \n}\n},WRONG_ANSWER,117,24584
1591691849587503104,9d0546dac18a9dc678295254e547925db086add5f872ef42d8015d525afeaf65,2022-11-13 15:18:03,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 100000\nint main()\n{\n    char str[N];\n    int i,n,k=1;\n    scanf(\""%d\"",&n);\n    scanf(\""%s\"",str);\n    for(i=1;i<strlen(str);i++){\n        if(str[i]!=str[i-1]){\n            k+=k+2;\n            str[i-1]=str[i];\n            str[i-1]=str[i+1];\n        }\n    }\n    printf(\""%d\\n\"",k);\n}",WRONG_ANSWER,19,352
1591691850778730496,1e783de44f6cf9abb158b108e556a36ef99d9241fc592b40cfd6cb7d1265eb34,2022-11-13 15:18:04,Java,300.0,1591610585635213312,1589816514637750272,1049226928954454016,import java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args) {\n\tScanner s=new Scanner(System.in);\n        int n=s.nextInt();//数的个数\n        String num=s.next();//接收数\n        int one=0;\n        int z=0;\n        for(int i=0;i<num.length();i++) {\n        \tif(num.charAt(i)=='0') {\n        \t\tz=z+1;\n        \t}\n        \tif(num.charAt(i)=='1') {\n        \t\tone=one+1;\n        \t}\n        }\n        if(one>=z) {\n        \t System.out.println(n-(one-z));\n        }else {\n        \t System.out.println(n-(z-one));\n        }\n             \n        }\n\t}\n\n,ACCEPTED,581,27332
1591691866721247232,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-11-13 15:18:07,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#define N 100\n\nint main()\n{\n    int n,a,b;\n    int c[N]={0},f[N]={0},e1[N]={0},e2[N]={0};\n    int i,j;\n    int sum=0;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&c[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&f[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if(f[i]>=0)\n        {\n            e1[i]=(c[i]/(f[i]+1)*pow(a,f[i]+1));\n            e2[i]=(c[i]/(f[i]+1)*pow(b,f[i]+1));\n        }\n        else\n            continue;\n    }\n    for(i=0;i<n;i++)\n    {\n        sum=sum+e1[i]-e2[i];\n    }\n    printf(\""%d\\n\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,5,380
1591691876376535040,9a1ecd1db02b268060006afd7de34ec54e74e90bf61becbb6811fb23971c4720,2022-11-13 15:18:10,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,def iss(x):\n    if x==1:\n        return 0\n    else:\n        for i in range(x-1):\n            if s[i]!=s[i+1]:\n                s.pop(i)\n                s.pop(i)\n                l=len(s)\n                return iss(l)\n            elif i==x-2:\n                return 0\n\nn=int(input())\ns=list(input())\nl=n\niss(l)\nz=len(s)\nprint(n-z)\n\n,NON_ZERO_EXIT_CODE,124,4732
1591691905053024256,25584884fd716238437f89484285121d106c1090916ab683be624f210130ebad,2022-11-13 15:18:17,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,j,count=0;\n    scanf(\""%d\"",&n);\n        int h[n];\n    for(i=0;i<n;i++)\n    scanf(\""%d\"",&h[i])\n        for(i=0;i<n-1;i++)\n    {\n        if(h[i]<h[i-1]&&h[i]<h[i+1])\n            count++;\n        if(h[i]==h[i+1]);\n        for(j=i+1;j<n-1;j++)\n        {\n            if(h[j+1]<h[j])\n            {\n                i=j;\n                break;\n            }\n            else if(h[j+1]>h[j])\n            {\n                count++;\n                i=j;\n                break;\n            }\n        }\n    }\n    printf(\""%d\"",count);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1591691965593563136,25584884fd716238437f89484285121d106c1090916ab683be624f210130ebad,2022-11-13 15:18:31,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,j,count=0;\n    scanf(\""%d\"",&n);\n        int h[n];\n    for(i=0;i<n;i++)\n    scanf(\""%d\"",&h[i])\n        for(i=1;i<n-1;i++)\n    {\n        if(h[i]<h[i-1]&&h[i]<h[i+1])\n            count++;\n        if(h[i]==h[i+1]);\n        for(j=i+1;j<n-1;j++)\n        {\n            if(h[j+1]<h[j])\n            {\n                i=j;\n                break;\n            }\n            else if(h[j+1]>h[j])\n            {\n                count++;\n                i=j;\n                break;\n            }\n        }\n    }\n    printf(\""%d\"",count);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1591692002000134144,25584884fd716238437f89484285121d106c1090916ab683be624f210130ebad,2022-11-13 15:18:40,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,j,count=0;\n    scanf(\""%d\"",&n);\n        int h[n];\n    for(i=0;i<n;i++)\n    scanf(\""%d\"",&h[i]);\n        for(i=1;i<n-1;i++)\n    {\n        if(h[i]<h[i-1]&&h[i]<h[i+1])\n            count++;\n        if(h[i]==h[i+1]);\n        for(j=i+1;j<n-1;j++)\n        {\n            if(h[j+1]<h[j])\n            {\n                i=j;\n                break;\n            }\n            else if(h[j+1]>h[j])\n            {\n                count++;\n                i=j;\n                break;\n            }\n        }\n    }\n    printf(\""%d\"",count);\n    return 0;\n}\n",WRONG_ANSWER,5,196
1591692016776699904,17759f531671f838bf3fae4270190e93b6109026f9503f986c1ed85bb412007d,2022-11-13 15:18:43,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<string.h>\n#define N 100000\nint main()\n{\n    int i,n,sum=0;\n    char a[N]={0};\n    scanf(\""%d\"",&n);\n    getchar();\n    gets(a);\n    for(i=0;i<n;i++)\n    {\n        if(a[i]=='0'||a[i]=='1')\n            if(a[i]==a[i+1])\n            {\n                    sum=sum+2;\n                    a[i]=a[i+2];\n                    a[i+1]=a[i+3];\n                    a[i+2]=a[i+4];\n                    i=i-2;\n            }\n    }\n    printf(\""%d\"",sum);\n}",TIME_LIMIT_EXCEEDED,400,460
1591692053225156608,7c6d208c4c4b695bc8d6f8ae0c0357c2466f5c9f86ec0652674812219ac09d38,2022-11-13 15:18:52,Java,300.0,1591610585639407616,1591132307937943552,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt();\n\t\tint[] arr = new int[a];\n\t\tint count = 0;\n\t    for (int i = 0; i < a; i++) {\n\t\t\tint b = sc.nextInt();\n\t\t\tarr[i] = b;\n\t\t}\n\t    for (int i = 1; i < arr.length-1; i++) {\n\t\t\tif (arr[i+1]<arr[i]) {\n\t\t\t\tfor (int j = i+1; j < arr.length-1; j++) {\n\t\t\t\t\tif(arr[j+1]>arr[j]){\n\t\t\t\t\t\tcount++;\n\t\t\t\t\t\ti = j;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t    System.out.println(count);\n\t\t\n\t}\n\n}\n,ACCEPTED,583,26068
1591692053904646144,25584884fd716238437f89484285121d106c1090916ab683be624f210130ebad,2022-11-13 15:18:52,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,j,count=0;\n    scanf(\""%d\"",&n);\n        int h[n];\n    for(i=0;i<n;i++)\n    scanf(\""%d\"",&h[i]);\n        for(i=1;i<n-1;i++)\n    {\n        if(h[i]<h[i-1]&&h[i]<h[i+1])\n            count++;\n        if(h[i]==h[i+1]);\n        for(j=i+1;j<n-1;j++)\n        {\n            if(h[j+1]<h[j])\n            {\n                i=j;\n                break;\n            }\n            else if(h[j+1]>h[j])\n            {\n                count++;\n                i=j;\n                break;\n            }\n        }\n    }\n    printf(\""%d\"",count);\n    return 0;\n}\n",WRONG_ANSWER,13,224
1591692074188288000,899c5501179552dc1fe5639f9047e15d0f835e7a87c8568193377882d0278985,2022-11-13 15:18:57,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,i,count=0;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if((a[i-1]>a[i])&&(a[i+1]>a[i]))\n            count+=1;\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",WRONG_ANSWER,8,512
1591692092123176960,172db3e4a89a3dc038ec44e9346ef3138ace8cc1576eb636ccaf26fd91d7a145,2022-11-13 15:19:01,C++,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n\nconst int N = 1e5 + 10;\nint a[N],cnt;\n\nint main(){\n\tint n,m = 0;\n\tscanf(\""%d\"",&n);\n\tfor(int i=0;i<n;i++,m++) {\n\t\tscanf(\""%d\"",&a[m]);\n\t\tif(i == 0) continue;\n\t\tif(a[m] == a[m-1]) {\n\t\t\tm --;\n\t\t}\n\t}\n\tfor(int i=1;i<m;i++) {\n\t//\tprintf(\""%d \"",a[i]);\n\t\tif(a[i] < a[i-1] && a[i] < a[i+1]) cnt ++;\n\t}\n\tprintf(\""%d\"",cnt);\n\treturn 0;\n}",ACCEPTED,40,352
1591692121382641664,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-13 15:19:08,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<iostream>\nusing namespace std;\nclass resolve{\n    public:\n    void resve(int *h,int n){\n        int nums=0;\n        for(int i=1;i<n-1;i++){\n            if(h[i]<h[i-1]){\n                for(int j=i;j<n-1;j++){\n                    if(h[j]<h[j+1]){\n                        nums++;\n                        i=j+2;\n                        break;\n                    }   \n                }\n            }\n        }\n        cout<<nums<<endl;\n    }  \n};\n\nint main(){\n    int n,h[1000]={0};\n    cin>>n;\n    if(n<3)\n        return 0;\n    for(int i=0;i<n;i++){\n        cin>>h[i];\n    }\n    resolve res;\n    res.resve(h,n);\n    return 0;\n}",WRONG_ANSWER,12,328
1591692146426830848,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-13 15:19:14,Python,300.0,1591610585635213317,1591130976212869120,1049226928954454016,"n,a,b=map(int,input().split())\nc=list(input().split())\nf=list(input().split())\nal=0\nbl=0\nfor i in range (n):\n    c[i]=int(c[i])\n    f[i]=int(f[i])\nfor i in range(n):\n    al+=c[i]/(f[i]+1)*(a**(f[i]+1))\n    bl+=c[i]/(f[i]+1)*(b**(f[i]+1))\nsum=int(al-bl)\nprint(sum)\n",ACCEPTED,94,3032
1591692190127251456,b80fc2aed0abde15bdaa9327874c9784da696b6ed442d90001602ff2a017be15,2022-11-13 15:19:24,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h> \n#include<math.h> \nint main()\n{\n\n   int i,j,sum=0;\n   int a,m;\n   scanf(\""%d\"",&a);\n   char n[100000];\n  scanf(\""%s\"",n);\n  m=a;\n  for(j=0;j<m/2;j++)\n     {\n\t for(i=0;i<a-1;i++)\n\t {\n\t if(n[i]!=n[i+1])\n\t   { \n\t   for(;i<a-2;i++)\n\t    n[i]=n[i+2];\n\t\ta=a-2;\n        sum=sum+2;\n\t\tbreak;\n\t}\n\t\n  } \n}\n   printf(\""%d\"",sum);\n\n   return 0; \n   \n} ",TIME_LIMIT_EXCEEDED,445,480
1591692202617876480,105cc8c0a5a465ab713603b461d92ac587c87767965625687540cd513f7ebb57,2022-11-13 15:19:27,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<bits/stdc++.h>\n#define N 10005\n#define endl '\\n'\n#define int long long\n#define ios ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)\n\n//const int dir[4][2]={-1,0,0,1,1,0,0,-1};\n//const int mod=1e9+7;\nusing namespace std;\n\ninline int read() {\n    char c = getchar(); int num = 0, sign = 1;\n    while(c < '0' || c > '9') {if(c == '-') sign = -1; c = getchar();}\n    while(c >= '0' && c <= '9') num = num * 10 + c - '0', c = getchar();\n    return num * sign;\n}\n\nvoid solve(){\n\tint nums[N][2];\n\tint res=0;\n\tint n,shang,xia;\n\tcin>>n>>shang>>xia;\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tcin>>nums[i][0];\n\t}\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tcin>>nums[i][1];\n\t}\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tif(nums[i][1]+1==0)\n\t\t{\n\t\t\tcontinue;\n\t\t } \n\t\tint t=pow(shang,nums[i][1]+1)-pow(xia,nums[i][1]+1);\n\t\tres+=t*nums[i][0]/(nums[i][1]+1);\n\t}\n\tcout<<res;\n}\n\nsigned main() {\n\tios;\n\tint count=1;\n\t//cin>>count;\n\twhile(count--)\n\t{\n\t\tsolve();\n\t}\n\treturn 0;\n}\n",WRONG_ANSWER,6,760
1591692226877730816,899c5501179552dc1fe5639f9047e15d0f835e7a87c8568193377882d0278985,2022-11-13 15:19:33,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,i,count=0;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=1;i<n;i++)\n    {\n        if((a[i-1]>a[i])&&(a[i+1]>a[i]))\n            count+=1;\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",WRONG_ANSWER,16,352
1591692236902162432,c5cc6f9845df4bd1986af86c0696296436bbc0f00a10a9f891b4100e57bc3a19,2022-11-13 15:19:36,C++,300.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n\tint n,sum=0;\n\tcin>>n;\n\tint f[n],flag=0,m=0;\n\tfor(int i=0;i<n;i++) cin>>f[i];\n\t\n\tfor(int i=0;i<n;i++) {\n\t\tflag=f[i];\n\t\t\n\t\tint l=i-1,r=i+1;\n\t\t\n\t\twhile(l>=0){\n\t\t\tif(f[i]<=f[l])\n\t\t\t{\n\t\t\t\tl--;\n\t\t\t\tflag+=f[i];\n\t\t\t}else break;\n\t\t}\n\t\t\n\t\twhile(r<n){\n\t\t\tif(f[i]<=f[r])\n\t\t\t{\n\t\t\t\tr++;\n\t\t\t\tflag+=f[i];\n\t\t\t}else break;\n\t\t}\n\t\tif(flag>=m) m=flag;\n\t}\n\tcout<<m;\n\t\n}\n",ACCEPTED,33,480
1591692417181704192,6383c93cbdef4af3eda29400a925819f16ad4afc8368e604ccd580cba7055bdd,2022-11-13 15:20:19,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint i,k,j;\n\tint n;\n\tif(scanf(\""%d\"",&n)){\n\tint h[n];\n\tfor(i=0;i<=n-1;i++){\n\t\th[i] = 0;\n\t}\n\tfor(k=0;k<=n-1;k++){\n\t\tif(scanf(\""%d\"",&h[k])){}\n\t}\n\tint cnt = 0;\n\tfor(j=2;j<=n-2;j++){\n\t\tif(((h[j]<h[j-1])&&(h[j]<h[j+1]))||((h[j]==h[j+1])&&(h[j]<h[j-1])&&(h[j+1]<h[j+2]))){\n\t\t\tcnt++;\n\t\t}\n\t}\n\tprintf(\""%d\"",cnt);\n\t}\n\treturn 0;\n}\n",WRONG_ANSWER,32,512
1591692439134691328,0d24b4ee85e6e3a4cc694f7e11105fa2aaf93fd10d4cbe81657f252e2d675435,2022-11-13 15:20:24,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int num;\n    int i=0,t=0;\n    int arr[1000];\n    scanf(\""%d\"",&num);\n    while(i<num){\n        scanf(\""%d\"",&t);\n      arr[i++] = t;\n    }\n    int j,sum=0;\n    for(j=1;j<num;j++){\n\n        if(arr[j]<arr[j-1]&&arr[j]<arr[j+1])\n            sum++;\n    }\n\nprintf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,39,492
1591692468725493760,25584884fd716238437f89484285121d106c1090916ab683be624f210130ebad,2022-11-13 15:20:31,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,j,count=0;\n    scanf(\""%d\"",&n);\n        int h[n];\n    for(i=0;i<n;i++)\n    scanf(\""%d\"",&h[i]);\n        for(i=1;i<n-1;i++)\n    {\n        if(h[i]<h[i-1]&&h[i]<h[i+1])\n            count++;\n        if(h[i]==h[i+1]);\n        for(j=i+1;j<n-1;j++)\n        {\n            if(h[j+1]<h[j])\n            {\n                i=j;\n                break;\n            }\n            else if(h[j+1]>h[j])\n            {\n                count++;\n                i=j;\n                break;\n            }\n        }\n    }\n    printf(\""%d\\n\"",count);\n    return 0;\n}\n",WRONG_ANSWER,6,496
1591692514565087232,5bd1a8718ea7fb820055421c67b8e0a468e08d951f729a24e55bf407b3bdb1f6,2022-11-13 15:20:42,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <iostream>\n#include <vector>\n#include <stdio.h>\n#include<math.h>\n\nusing namespace std;\n\n\n\ndouble getret(int c,int f,double x){\n    if(f==-1)\n        return c*log(x);\n    return (c/(f+1))*pow(x,f+1);\n}\n\n\nint main()\n{\n\n    int n;\n    double a,b;\n    cin>>n>>a>>b;\n\n    vector<int> c(n);\n    vector<int> f(n);\n    for(int i=0;i<n;i++){\n        cin>>c[i];\n        }\n    for(int j=0;j<n;j++){\n        cin>>f[j];\n        }\n\n\n    double sum1=0,sum2=0;\n\n    for(int k=0;k<n;k++)\n    {\n        sum1+=getret(c[k],f[k],a);\n        sum2+=getret(c[k],f[k],b);\n    }\n    cout<<sum1-sum2;\n    return 0;\n}\n",WRONG_ANSWER,5,476
1591692609930932224,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-13 15:21:05,C++,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<iostream>\nusing namespace std;\nclass resolve{\n    public:\n    void resve(int *h,int n){\n        int nums=0;\n        for(int i=1;i<n-1;i++){\n            if(h[i]<h[i-1]){\n                for(int j=i;j<n-1;j++){\n                    if(h[j]<h[j+1]){\n                        nums++;\n                        i=j+1;\n                        break;\n                    }   \n                }\n            }\n        }\n        cout<<nums<<endl;\n    }  \n};\n\nint main(){\n    int n,h[1000]={0};\n    cin>>n;\n    if(n<3)\n        return 0;\n    for(int i=0;i<n;i++){\n        cin>>h[i];\n    }\n    resolve res;\n    if(h[0]==0&&h[n-1]==0)\n        res.resve(h,n);\n    return 0;\n}",ACCEPTED,36,620
1591692652792569856,acf80eea856463058b81f71c0238069795893092293fbd098cc594959df6444e,2022-11-13 15:21:15,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"n=int(input())\ns=input().split()\nh=0\nfor i in range(1,n-1):\n    if s[i]<s[i-1] and s[i]<s[i+1] :\n        h=h+1\n    elif s[i]<s[i-1]:\n        if s[i]>s[i+1]:\n            continue\n        elif s[i]==s[i+1]:\n            for i in range(n-1):\n                if s[i]==s[i+1]:\n                   h=h+0\n                elif s[i+1]>s[i]:\n                    h=h+1\n                else:\n                    break\nprint(h)\n",WRONG_ANSWER,19,2908
1591692687605248000,fbea21dbaf89f1b064feaa20227f21c5e1c4888fdc371cf5e43f70615906e52a,2022-11-13 15:21:23,Python,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"n=list(map(int,input().split()))\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\nsum=0\nfor i in range(n[0]):\n    x=(a[i]//(b[i]+1))*(n[1]**(b[i]+1)-n[2]**(b[i]+1)) \n    sum+=x\nprint(sum)",WRONG_ANSWER,18,2784
1591692718303358976,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-13 15:21:30,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#define MAXSIZE 100\nint main(){\n    int n,s[MAXSIZE],k,i,j,p[MAXSIZE];\n    int max=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    scanf(\""%d\"",&s[i]);\n    for(i=0;i<n-1;i++)  //排序\n    {for(j=0;j<n-1-i;j++)\n    {if(s[j]>s[j+1])\n        {k=s[j];\n         s[j]=s[j+1];\n         s[j+1]=k;\n        }\n    }\n    }\n    k=n;\n   for(i=0;i<n;i++)\n   {\n    p[i]=s[i]*k;\n    k--;\n    max=(max>p[i])?max:p[i];\n   }\n    printf(\""%d\\n\"",max);\n    return 0;\n}",WRONG_ANSWER,8,348
1591692719335157760,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 15:21:31,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n    int n,a[20];\n    int i,h=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=1;i<n-1;i++)\n    {\n        if(i<=n-4)\n            {if(a[i]>=a[i+1]&&a[i+2]>=a[i+1]&&a[i]!=a[i+1])\n            h++;\n            }\n    }\n    printf(\""%d\\n\"",h);\n    return 0;\n}\n\n",RUNTIME_ERROR,20,384
1591692724724883456,1f29a576db974352c60cbe8aafdc4e5328b24d800890ab1c712d8c9fa85d72cc,2022-11-13 15:21:32,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint i,j,h[n];\n\tfor(i=0;i<n;i++)\n\tscanf(\""%d\"",&h[i]);\n\tint s=0,k,max=0;\n\tint a=0;\n\tfor(i=0;i<n;i++)\n\t{\n\t\ta=0;\n\t\tfor(j=0;j<n-i;j++)\n\t\t{\n\t\t\tif(h[i]<h[i+j])\n\t\t\ta++;\n\t\t\telse break;\n\t\t}\n\t\tfor(k=1;k<i-1;k++)\n\t\t{\n\t\t\tif(h[i]<h[i-k])\n\t\t\ta++;\n\t\t\telse break;\n\t\t}\n\t\ts=h[i]*a;\n\t\tif(s>max) max=s;\n\t}\n\tprintf(\""%d\"",max);\n\treturn 0;\n } ",WRONG_ANSWER,5,196
1591692745272733696,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-13 15:21:37,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#define MAXSIZE 100\nint main(){\n    int n,s[MAXSIZE],k,i,j,p[MAXSIZE];\n    int max=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    scanf(\""%d\"",&s[i]);\n    for(i=0;i<n-1;i++)  //排序\n    {for(j=0;j<n-1-i;j++)\n    {if(s[j]>s[j+1])\n        {k=s[j];\n         s[j]=s[j+1];\n         s[j+1]=k;\n        }\n    }\n    }\n    k=n;\n   for(i=0;i<n;i++)\n   {\n    p[i]=s[i]*k;\n    k--;\n    max=(max>p[i])?max:p[i];\n   }\n    printf(\""%d\"",max);\n    return 0;\n}",WRONG_ANSWER,5,364
1591692908573777920,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-13 15:22:16,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\n#define N 10000\n\n\nint pand(char *a,int i,int n)\n{\n    int b,c;\n    a[i]=a[i+2];\n    a[i+1]=a[i+3];\n    i++;\n    if(i<n) pand(a,i,n);\n    else return 0;\n\n}\n\n\n\n\n\n\nint main()\n{\n    char a[10000];\n    int n,i,j,k,l;\n    j=0;\n    scanf(\""%d\"",&n);\n    scanf(\""%s\"",&a);\n    a[n]='\\0';\n    for(l=0;l<n;l++){\n    for(i=0;i<n;i++)\n    {\n        //if(i=0&&a[0]!=a[1]) a[0]=a[2];\n        //a[1]=a[]\n        \n        k=i;\n        if(i>=0&&a[i]!=a[i+1]&&(a[1]=='1'||a[1]=='0'))\n            {\n//printf(\""%s\\n,n=%d\"",a,n);\n            if(n>0){\n            pand(a,i,n);\n            n-=1;\n            j+=2;\n            }\n\n            }\n\n    }\n    }//printf(\""!%s\"",a);\n\nprintf(\""%d\\n\"",j);\n\n\n\n\n\n    return 0;\n}",WRONG_ANSWER,5,212
1591692910117281792,a5291eb67188c2a916aa5dd9fc38f2e449aa9f9a3cd047f282d8c154ea2979cd,2022-11-13 15:22:16,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,#include <iostream>\n#include <vector> \nusing namespace std;\n\nconst int N = 1e6 + 10;\nint h[N];\n\n\nint main()\n{\n\tint n = 0;\n\tcin >> n;\n\tfor(int i = 1;i <= n;i++)\n\t{\n\t\tcin >> h[i];\n\t}\n\tint S_max = 0;\n    for(int i = 1;i <= n;i++)\n    {\n        int min_h = h[i];\n        int S = h[i];\n        for(int j = i + 1;j <= n;j++)\n        {\n            if(h[j] >= h[i])\n            {\n                S = (j - i + 1) * min_h;\n            }\n            else\n            {\n                if(min_h > h[j])\n                {\n                    min_h = h[j];\n                }\n                S = (j - i + 1) * min_h;\n            }\n            \n            if(S > S_max)\n            {\n                S_max = S;\n            }\n        }\n        \n        \n    }\n    \n    cout << S_max << endl;\n\treturn 0;\n} ,WRONG_ANSWER,55,588
1591692913040711680,6ba5ecacf3381a1e9382f99c413290eca40a071a563a618e5f36d66cbf9a5e1b,2022-11-13 15:22:17,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<iostream>\n#include<math.h>\nusing namespace std;\n\nint main(){\nint n,a,b;\ncin>>n>>a>>b;\nint c[n];\nint f[n];\nfor(int i=0;i<n;i++){\n    cin>>c[i];\n   // cout<<c[i]<<endl;\n}\nfor(int i=0;i<n;i++){\n    cin>>f[i];\n   // cout<<f[i]<<endl;\n}\nfloat sum=0;\nfor(int i=0;i<n;i++){\n    long k=1;\n        for(int j=0;j<f[i]+1;j++)\n            k*=a;\n   // cout<<k<<endl;\n    //cout<<float(c[i]/(f[i]+1))<<endl;\n   sum+=c[i]/(f[i]+1)*k;\n  // cout<<sum<<endl;\n}\nfor(int i=0;i<n;i++){\n        long k=1;\n        for(int j=0;j<f[i]+1;j++)\n            k*=b;\n//cout<<k<<endl;\n   // cout<<float(c[i]/(f[i]+1))<<endl;\n   sum=sum-c[i]/(f[i]+1)*k;\n   //cout<<sum<<endl;\n}\ncout<<sum<<endl;\n}",WRONG_ANSWER,12,472
1591692971995848704,2e4af98c441106efa9ee51f8a781d0eee91a3dff6193987d421eb3a48725c814,2022-11-13 15:22:31,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <iostream>\nint f=0;//0 init 1 lise -1 drap;\nint fun(int arr[],int a,int b){\n\tif(arr[a]>arr[b])f=-1;\n\tif(arr[a]<arr[b])f=1;\n\tif(arr[a]==arr[b])f=0;\n\treturn f; \n}\nint main(){\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint *arr = new int[n];\n\tfor(int i =0;i<n;i++){\n\t\tscanf(\""%d\"",&arr[i]);\n\t}\n\n\tint t=arr[0];\n\tint num =0;\n\tfor(int i=0;i<n-1;i++){\n\t\tif(f==1&&arr[i]>arr[i+1]){\n\t\t\tnum++;\n\t\t\tf = fun(arr,i,i+1); \n\t\t}\n\t\tif(f==-1&&arr[i]<arr[i+1]){\n\t\t\n\t\t\tf = fun(arr,i,i+1); \n\t\t}\n\t\tif(f==0&&arr[i]==arr[i+1]){\n\t\t\tf = fun(arr,i,i+1); \n\t\t}\n\t\n\t}\n\tprintf(\""%d\"",num);\n\t\n}",WRONG_ANSWER,15,332
1591692987330211840,c76414e1d2d8531a5745e9bd3192aafa7cca924e645650ffe7954c992cc13b33,2022-11-13 15:22:35,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\nint n,a,b,i;\nint sum=0;\nscanf(\""%d %d %d\"",&n,&a,&b);\nint s1[n],s2[n];\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&s1[i]);\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&s2[i]);\n\nfor(i=0;i<n;i++)\n    {\n    sum=sum+s1[i]/(s2[i]+1)*pow(a,s2[i]+1)-s1[i]/(s2[i]+1)*pow(b,s2[i]+1);\n    }\nprintf(\""%d\"",sum);\n}\n",WRONG_ANSWER,5,384
1591693043416457216,17759f531671f838bf3fae4270190e93b6109026f9503f986c1ed85bb412007d,2022-11-13 15:22:48,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<string.h>\n#define N 100000\nint main()\n{\n    int i,n,sum=0;\n    char a[N]={0};\n    scanf(\""%d\"",&n);\n    getchar();\n    gets(a);\n    for(i=0;i<n;i++)\n    {\n        if(a[i]=='0'||a[i]=='1')\n            if(a[i]==a[i+1])\n            {\n                    sum=sum+2;\n                    a[i]=a[i+2];\n                    a[i+1]=a[i+3];\n                    a[i+2]=a[i+4];\n                    i=i-2;\n            }\n    }\n    printf(\""%d\"",sum);\n}",TIME_LIMIT_EXCEEDED,400,452
1591693055143718912,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-11-13 15:22:51,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#define N 100\n\nint main()\n{\n    int n,a,b;\n    int c[N]={0},f[N]={0},e1[N]={0},e2[N]={0};\n    int i,j;\n    int sum=0;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&c[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&f[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if(f[i]==-1)\n        {\n            e1[i]=(c[i]*log(a));\n            e2[i]=(c[i]*log(a));\n        }\n        else if(f[i]>=0)\n        {\n            e1[i]=(c[i]/(f[i]+1)*pow(a,f[i]+1));\n            e2[i]=(c[i]/(f[i]+1)*pow(b,f[i]+1));\n        }\n        }\n    }\n    for(i=0;i<n;i++)\n    {\n        sum=sum+e1[i]-e2[i];\n    }\n    printf(\""%d\\n\"",sum);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1591693101507567616,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-13 15:23:02,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,sum=0,j,k,temp=0,b;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(k=0;k<n;k++)\n        scanf(\""%d\"",&a[k]);\n    for(i=0;i<n;i++)\n    {\n        temp=0;\n        for(j=i;j<n;j++)\n        {\n            if(a[i]<=a[j])\n                temp++;\n            else\n                break;\n        }\n        b=a[i]*temp;\n        if(sum<b)\n            sum=b;\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,24,352
1591693120704929792,899c5501179552dc1fe5639f9047e15d0f835e7a87c8568193377882d0278985,2022-11-13 15:23:06,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,i,count=0;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if((a[i-1]>a[i])&&(a[i+1]>a[i]))\n            count+=1;\n    }\n    printf(\""%d\\n\"",count);\n    return 0;\n}",WRONG_ANSWER,10,200
1591693121287905280,e715137eeb4190ade2330123b989bbdd6eebd9a5e1df2e292271d3bfe3a79c69,2022-11-13 15:23:07,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint a[1000000]={0},d[1000000];\nint main()\n{\n    int i,j=0,k=10000,n,b=0,c=1,w=0;\n    scanf(\""%d\"",&n);\n    k=n;\n    for(i=1;i<=n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=1;j<n;j++)\n    {\n        w=0;\n        \n   for(i=j;i<n;i++)\n    {\n       w+=a[j];\n       if(a[i]<a[j])\n       {\n           d[b]=w;\n           w=0;\n           b++;\n       }\n        \n    }\n    }\n    w=d[0];\n    for(i=0;i<b;i++)\n    {\n        if(w<d[i])\n            w=d[i];\n    }\n    printf(\""%d\"",w);\n    return 0;\n        \n}",WRONG_ANSWER,7,220
1591693136370622464,a5291eb67188c2a916aa5dd9fc38f2e449aa9f9a3cd047f282d8c154ea2979cd,2022-11-13 15:23:10,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,#include <iostream>\n#include <vector> \nusing namespace std;\n\nconst int N = 1e6 + 10;\nint h[N];\n\n\nint main()\n{\n\tint n = 0;\n\tcin >> n;\n\tfor(int i = 1;i <= n;i++)\n\t{\n\t\tcin >> h[i];\n\t}\n\tint S_max = 0;\n    for(int i = 1;i <= n;i++)\n    {\n        int min_h = h[i];\n        int S = h[i];\n        S_max = S;\n        for(int j = i + 1;j <= n;j++)\n        {\n            if(h[j] >= h[i])\n            {\n                S = (j - i + 1) * min_h;\n            }\n            else\n            {\n                if(min_h > h[j])\n                {\n                    min_h = h[j];\n                }\n                S = (j - i + 1) * min_h;\n            }\n            \n            if(S > S_max)\n            {\n                S_max = S;\n            }\n        }\n        \n        \n    }\n    \n    cout << S_max << endl;\n\treturn 0;\n} ,WRONG_ANSWER,9,504
1591693190015770624,86f702b052a21d7cb2f8cd933c678c21efaafaf5b2d35032f18ec35c1e26a945,2022-11-13 15:23:23,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,max=0;\n    int c,b,x,d;\n    scanf(\""%d\"",&n);\n    int a[1000000]={0};\n    for(i=1;i<=n;i++)\n    scanf(\""%d\"",&a[i]);\n    x=0;\n   while(x<n)\n    {\n        c=a[x+1]-5;\n        b=a[x+3]-5;\n        d=a[x+2]-5;\n        if(c>=0) \n        {max=c+max;\n         x=x+1;}\n        else\n        {\n            if(c+d>b){\n                max=c+max;\n                x=x+1; }\n            else\n            {max=b+max;\n             x=x+3; }\n        }\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",WRONG_ANSWER,9,4320
1591693211515772928,20ffd83467b553ac24e1f4b8b096d58858684ca8c3f6a4d5a62be9ff7c4817da,2022-11-13 15:23:28,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#define MAX 10000\nint main()\n{\n    int n;\n    signed int a,b;\n    int i;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    int c[MAX],F[MAX];\n    double  B[MAX],h=0;\n    for(i=1;i<=n;i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=1;i<=n;i++)\n        scanf(\""%d\"",&F[i]);\n    for(i=1;i<=n;i++){\n        if(F[i]!=-1)\n        B[i]=c[i]/(F[i]+1)*pow(a,F[i]+1)-c[i]/(F[i]+1)*pow(b,F[i]+1);\n        else\n        B[i]=c[i]*(log((double)a)-log((double)b));\n    }\n    for(i=1;i<=n;i++){\n        h+=B[i];\n        }\n    printf(\""%d\\n\"",(int)h);\n}\n\n\n",WRONG_ANSWER,9,480
1591693269049073664,5bd1a8718ea7fb820055421c67b8e0a468e08d951f729a24e55bf407b3bdb1f6,2022-11-13 15:23:42,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <iostream>\n#include <vector>\n#include <stdio.h>\n#include<math.h>\n\nusing namespace std;\n\n\n\ndouble getret(int c,int f,int x){\n    if(f==-1)\n        return c*log(double(x));\n    return (c/(f+1))*pow(x,f+1);\n}\n\n\nint main()\n{\n\n    int n;\n    double a,b;\n    cin>>n>>a>>b;\n\n    vector<int> c(n);\n    vector<int> f(n);\n    for(int i=0;i<n;i++){\n        cin>>c[i];\n        }\n    for(int j=0;j<n;j++){\n        cin>>f[j];\n        }\n\n\n    double sum1=0,sum2=0;\n\n    for(int k=0;k<n;k++)\n    {\n        sum1+=getret(c[k],f[k],a);\n        sum2+=getret(c[k],f[k],b);\n    }\n    cout<<sum1-sum2;\n    return 0;\n}\n",WRONG_ANSWER,5,456
1591693324489351168,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-11-13 15:23:55,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#define N 100\n\nint main()\n{\n    int n,a,b;\n    int c[N]={0},f[N]={0},e1[N]={0},e2[N]={0};\n    int i,j;\n    int sum=0;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&c[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&f[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if(f[i]>=0)\n        {\n            e1[i]=(c[i]/(f[i]+1)*pow(a,f[i]+1));\n            e2[i]=(c[i]/(f[i]+1)*pow(b,f[i]+1));\n        }\n        else\n            continue;\n    }\n    for(i=0;i<n;i++)\n    {\n        sum=sum+e1[i]-e2[i];\n    }\n    printf(\""%d\\n\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,6,484
1591693370408579072,25584884fd716238437f89484285121d106c1090916ab683be624f210130ebad,2022-11-13 15:24:06,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,j,count;\n    count=0\n    scanf(\""%d\"",&n);\n        int h[n];\n    for(i=0;i<n;i++)\n    scanf(\""%d\"",&h[i]);\n        for(i=1;i<n-1;i++){\n        if(h[i]<h[i-1]&&h[i]<h[i+1])\n            count++;\n        if(h[i]==h[i+1]);\n        for(j=i+1;j<n-1;j++){\n            if(h[j+1]<h[j]){\n                i=j;\n                break;\n            }\n            else if(h[j+1]>h[j]){\n                count++;\n                i=j;\n                break;\n            }\n        }\n    }\n    printf(\""%d\\n\"",count);\n}\n",COMPILE_ERROR,0,0
1591693385097076736,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 15:24:09,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <string.h>\nint main()\n{\n    int k,len,i,g=0,l=0;\n    char str[50];\n    scanf(\""%d\"",&k);\n    scanf(\""%s\"",str);\n    len  = strlen(str);\n    for(i=0;i<=len;i++)\n    {\n        if(str[i]=='0')\n        g++;\n        else\n        l++;\n    }\n    //g-=8;//0的个数;\n    //l-=52;//1的个数;\n    if(g>l)\n    printf(\""%d\\n\"",2*l);\n    else\n    printf(\""%d\\n\"",2*g);\n    return 0;\n}\n\n",SEGMENTATION_FAULT,34,484
1591693400645328896,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-13 15:24:13,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int n,a,b,c[100],f[100],result,sum=0,result2;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    \n    for(int i=0;i<n;i++)\n    {\n      scanf(\""%d\"",&c[i]);\n      \n        \n    }\n    for(int i=0;i<n;i++)\n    {\n      scanf(\""%d\"",&f[i]);\n      \n        \n    }\n    \n    for(int i=0;i<n;i++)\n    {\n      sum+=((c[i]/(f[i]+1))*pow(a,f[i]+1));\n     result=sum;\n        \n    }\n    sum=0;\n    for(int i=0;i<n;i++)\n    {\n      sum+=((c[i]/(f[i]+1))*pow(b,f[i]+1));\n      result2=sum;\n        \n    }\n    printf(\""%d\"",result-result2);\n}",WRONG_ANSWER,5,512
1591693441044897792,b80fc2aed0abde15bdaa9327874c9784da696b6ed442d90001602ff2a017be15,2022-11-13 15:24:23,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h> \n#include<math.h> \nint main()\n{\n   int i,j,sum=0;\n   int a,m,x=0;\n   scanf(\""%d\"",&a);\n   char n[100000];\n  scanf(\""%s\"",n);\n  m=a;\n   for(j=0;j<m-x;j++)\n\t for(i=0;i<a-1;i++)\n\t {\n\t if(n[i]!=n[i+1])\n\t   { \n\t   for(;i<a-2;i++)\n\t    n[i]=n[i+2];\n\t\ta=a-2;\n\t\tx=2; \n        sum=sum+2;\n\t\tbreak;\n\t}\n\t\n  } \n\n   printf(\""%d\"",sum);\n\n   return 0; \n   \n} ",TIME_LIMIT_EXCEEDED,433,512
1591693453984280576,06b00897262b024d9e66dcd771cf81de9b63954f7a4554699d17c2158114c0d1,2022-11-13 15:24:26,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n        int n;\n        scanf(\""%d\"",&n);\n\t\tchar ch[n];\n\t\tscanf(\""%s\"",ch);\n\t\tint x=0;\n\t\tint i=0;\n\t\tint j=0;\n\t\twhile(i<n-1) {\n\t\t\tif(ch[i]!=ch[i+1]) {\n\t\t\t\tx=x+2;\n\t\t\t\tfor(j=i;j<n-1;j++){\n\t\t\t\t\tch[i]=ch[n-2];\n\t\t\t\t\tch[i]=ch[n-1];\n\t\t\t\t}\n\t\t\t\tn=n-2;\n\t\t\t\ti=i-1;\n\t\t\t}else {\n\t\t\t\ti++;\n\t\t\t}\n\t\t}\n        printf(\""%d\\n\"",x);\n    return 0;\n}",WRONG_ANSWER,5,348
1591693461362073600,40c43472973ea298adbdd1d4b900aeb63cfa4cfe17179f01a4827cd2c6624d3a,2022-11-13 15:24:28,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nmain()\n{\n    int n;\n    int h[20];\n    int i;\n    int t=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&h[i]);\n    }\n    for(i=0;i<n-2;i++)\n    {\n        if(h[i]>h[i+1])\n            t++;\n        if(h[i]==h[i+1])\n           t++;\n        if(h[i]-h[i+1]&&h[i+1]==h[i+2])\n           t--;\n    }\n    printf(\""%d\"",t);\n}",WRONG_ANSWER,9,360
1591693466210721792,3e087b0a196d30fcbb49ca80164c9eb5adf82ae3bb08ec0c141e5728fb180f0d,2022-11-13 15:24:29,Java,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner sc=new Scanner(System.in);\n\t\tint i=0,res=0,len;\n\t\tint n=sc.nextInt();\n\t\tsc.nextLine();\n\t\tString[] arr=sc.nextLine().split(\""\"");\n\t\tlen=arr.length;\n\t\twhile(i<=len-2){\n\t\t\tif(!(arr[i].equals(arr[i+1]))){\n\t\t\t\tres+=2;\n\t\t\t\tfor(int j=i;j<len-2;j++){\n\t\t\t\t\tarr[j]=arr[j+2];\n\t\t\t\t}\n\t\t\t\tlen-=2;\n\t\t\t\ti--;\n\t\t\t}else{\n\t\t\t\ti++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.print(res);\n\t}\n\n}",NON_ZERO_EXIT_CODE,107,24948
1591693499500879872,40c43472973ea298adbdd1d4b900aeb63cfa4cfe17179f01a4827cd2c6624d3a,2022-11-13 15:24:37,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nmain()\n{\n    int n;\n    double h[20];\n    int i;\n    int t=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&h[i]);\n    }\n    for(i=0;i<n-2;i++)\n    {\n        if(h[i]>h[i+1])\n            t++;\n        if(h[i]==h[i+1])\n           t++;\n        if(h[i]-h[i+1]&&h[i+1]==h[i+2])\n           t--;\n    }\n    printf(\""%d\"",t);\n}",WRONG_ANSWER,5,324
1591693501698695168,acf80eea856463058b81f71c0238069795893092293fbd098cc594959df6444e,2022-11-13 15:24:37,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"n=int(input())\ns=input().split()\nh=0\nfor i in range(1,n-1):\n    if s[i]<s[i-1] and s[i]<s[i+1] :\n        h=h+1\n    elif s[i]<s[i-1]:\n        if s[i]>s[i+1]:\n            continue\n        elif s[i]==s[i+1]:\n            for i in range(n-1):\n                if s[i]==s[i+1]:\n                   continue\n                elif s[i+1]>s[i]:\n                   h=h+1\n                else:\n                   break\nprint(h)\n",WRONG_ANSWER,18,2824
1591693503640657920,25584884fd716238437f89484285121d106c1090916ab683be624f210130ebad,2022-11-13 15:24:38,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,j,count;\n    count=0;\n    scanf(\""%d\"",&n);\n        int h[n];\n    for(i=0;i<n;i++)\n    scanf(\""%d\"",&h[i]);\n        for(i=1;i<n-1;i++)\n        {\n        if(h[i]<h[i-1]&&h[i]<h[i+1])\n            count++;\n        if(h[i]==h[i+1]);\n        for(j=i+1;j<n-1;j++)\n        {\n            if(h[j+1]<h[j])\n            {\n                i=j;\n                break;\n            }\n            else if(h[j+1]>h[j])\n            {\n                count++;\n                i=j;\n                break;\n            }\n        }\n    }\n    printf(\""%d\\n\"",count);\n}",WRONG_ANSWER,4,196
1591693505138057216,86f702b052a21d7cb2f8cd933c678c21efaafaf5b2d35032f18ec35c1e26a945,2022-11-13 15:24:38,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,max=0;\n    int c,b,x,d;\n    scanf(\""%d\"",&n);\n    int a[1000000]={0};\n    for(i=1;i<=n;i++)\n    scanf(\""%d\"",&a[i]);\n    x=0;\n   while(x<n)\n    {\n        c=a[x+1]-5;\n        b=a[x+3]-5;\n        d=a[x+2]-5;\n        if(c>=0) \n        {max=c+max;\n         x=x+1;}\n        else\n        {\n            if(c+d+b>b){\n                max=c+max;\n                x=x+1; }\n            else\n            {max=b+max;\n             x=x+3; }\n        }\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",WRONG_ANSWER,10,4096
1591693508376059904,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-13 15:24:39,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int n,a,b,c[100],f[100],result,sum=0,result2;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    \n    for(int i=0;i<n;i++)\n    {\n      scanf(\""%d\"",&c[i]);\n      \n        \n    }\n    for(int i=0;i<n;i++)\n    {\n      scanf(\""%d\"",&f[i]);\n      \n        \n    }\n    \n    for(int i=0;i<n;i++)\n    {\n      sum+=((c[i]/(f[i]+1))*pow(a,f[i]+1));\n     result=sum;\n        \n    }\n    sum=0;\n    for(int i=0;i<n;i++)\n    {\n      sum+=((c[i]/(f[i]+1))*pow(b,f[i]+1));\n      result2=sum;\n        \n    }\n    printf(\""%d\\n\"",result-result2);\n}",WRONG_ANSWER,7,348
1591693537224482816,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-13 15:24:46,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\n#define N 10000\n\n\nint pand(char *a,int i,int n)\n{\n    int b,c;\n    a[i]=a[i+2];\n    a[i+1]=a[i+3];\n    i++;\n    if(i<n) pand(a,i,n);\n    else return 0;\n\n}\n\n\n\n\n\n\nint main()\n{\n    char a[10000];\n    int n,i,j,k,l;\n    j=0;\n    scanf(\""%d\"",&n);\n    scanf(\""%s\"",&a);\n    a[n]='\\0';\n    for(l=0;l<n;l++){\n    for(i=0;i<n;i++)\n    {\n        //if(i=0&&a[0]!=a[1]) a[0]=a[2];\n        //a[1]=a[]\n        \n        k=i;\n        if(i>=0&&a[i]!=a[i+1]&&(a[i]=='1'||a[i]=='0'))\n            {\n//printf(\""%s\\n,n=%d\\n\"",a,n);\n            if(n>0){\n            pand(a,i,n);\n            n-=2;\n            j+=2;\n            }\n\n            }\n\n    }\n    }//printf(\""!%s\"",a);\n\nprintf(\""%d\\n\"",j);\n\n\n\n\n\n    return 0;\n}",SEGMENTATION_FAULT,37,356
1591693560070823936,06b00897262b024d9e66dcd771cf81de9b63954f7a4554699d17c2158114c0d1,2022-11-13 15:24:51,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n        int n;\n        scanf(\""%d\"",&n);\n\t\tchar ch[n];\n\t\tscanf(\""%s\"",ch);\n\t\tint x=0;\n\t\tint i=0;\n\t\tint j=0;\n\t\twhile(i<n-1) {\n\t\t\tif(ch[i]!=ch[i+1]) {\n\t\t\t\tx=x+2;\n\t\t\t\tfor(j=i;j<n-1;j++){\n\t\t\t\t\tch[i]=ch[n-2];\n\t\t\t\t\tch[i]=ch[n-1];\n\t\t\t\t}\n\t\t\t\tn=n-2;\n\t\t\t\ti=i-1;\n\t\t\t}else {\n\t\t\t\ti++;\n\t\t\t}\n\t\t}\n        printf(\""%d\\n\"",x);\n    return 0;\n}",WRONG_ANSWER,16,348
1591693573492629504,458af3c005e0b282d1ca88c254d9910ee2d93738b6f06d399f7444e1e64831eb,2022-11-13 15:24:54,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int i,j,n,a[10],max,q=0;\n    scanf(\""%d\"",&n);\n    getchar();\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n        getchar();\n    }\n    for(j=0;j<10;j){\n        max=a[j];\n        i=j;\n        if(a[i+2]>max){\n            max=a[i+2];\n            j=i+3;\n        }\n        else j++;\n        q=q+max-5;\n    }\n    printf(\""%d\"",q);\n    return 0;\n}\n\n",SEGMENTATION_FAULT,6,200
1591693586599829504,73af9d5098be5d450fba728363c8fdbe0f6a5526466daa2f3b74abf1acf75527,2022-11-13 15:24:57,C,300.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <string.h>\nint main()\n{\n    int n,count1=0,count2=0;\n    scanf(\""%d\\n\"",&n);\n    char a[100000];\n    \n    for(int i=0;i<n;i++)\n    {\n        scanf(\""%c\"",&a[i]);\n       if(a[i]=='0')count1++;\n        if(a[i]=='1')count2++;\n        \n    }\n    int sum=count1<count2?count1*2:count2*2;\n    printf(\""%d\"",sum);\n    return 0;\n}",ACCEPTED,43,608
1591693684473913344,b73a04f1a7af1c2516ca68b38e336912bdf10c4f4bf7bac55e4e0de29dcf3d9d,2022-11-13 15:25:21,C++,300.0,1591610585635213319,1591131955016622080,1049226928954454016,"#include<bits/stdc++.h>\n#define N 100005\n#define int long long\n\nusing namespace std;\n\nint dfs(int n,int t){\n\tif(n<t)\n\t\treturn 0;\n\tif(n==t)\n\t\treturn 1;\n\treturn 1+dfs(t-1,t)+dfs(n-t+1,t);\n}\n\n\nsigned main() {\n\tint count;\n\tcin>>count;\n\twhile(count--)\n\t{\n\tint n;\n\tint res=0;\n\tint rmin=INT_MAX;\n\tint nums[N];\n\tcin>>n;\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tcin>>nums[i];\n\t\trmin=min(rmin,nums[i]);\n\t}\n\t\n\tint t=rmin*2;\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tres+=dfs(nums[i],t);\n\t}\n\tcout<<res<<endl;\n\t}\n\treturn 0;\n}\n",ACCEPTED,64,600
1591693692363399168,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 15:25:23,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <string.h>\nint main()\n{\n    int k,len,i,g=0,l=0;\n    char str[50];\n    scanf(\""%d\"",&k);\n    scanf(\""%s\"",str);\n    len  = strlen(str);\n    for(i=0;i<=len;i++)\n    {\n        if(str[i]=='0')\n        g++;\n        else\n        l++;\n    }\n    if(g>l)\n    printf(\""%d\\n\"",2*l);\n    else\n    printf(\""%d\\n\"",2*g);\n    return 0;\n}\n\n",SEGMENTATION_FAULT,41,352
1591693710948360192,172db3e4a89a3dc038ec44e9346ef3138ace8cc1576eb636ccaf26fd91d7a145,2022-11-13 15:25:27,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#include <algorithm>\n\nusing namespace std;\ntypedef long long ll;\nconst int N = 2e5 + 10;\n\nstruct node{\n\tll a,b;\n}per[N];\n\nll fa[N],Size[N],maxn,histogram[N];\n\nbool cmp(node a1,node a2) {\n\tif(a1.a > a2.a) return a1.a > a2.a;\n\telse return a1.b < a2.b;\n}\n\nint find(int x) {\n\tif(fa[x] == x) return x;\n\treturn fa[x] = find(fa[x]);\n}\n\nint main(){\n\tint n;\n\tscanf(\""%d\"",&n);\n\tfor(int i=1;i<=n;i++) {\n\t\tscanf(\""%lld\"",&histogram[i]);\n\t\tper[i].a = histogram[i];\n\t\tper[i].b = i;\n\t\tfa[i] = i;\n\t\tSize[i] = 1;\n\t}\n\tsort(per+1,per+n+1,cmp);\n\tfor(int i=1;i<=n;i++) {\n\t\tint x = per[i].b;\n\t\tint X = find(x);\n\t\tint Y = find(x-1);\n\t\tint Z = find(x + 1);\n\t\tif(histogram[x - 1] >= histogram[x] && X != Y) {\n\t\t\tSize[X] += Size[Y];\n\t\t\tfa[Y] = X;\n\t\t} \n\t\tif(histogram[x + 1] >= histogram[x] && X != Z)  {\n\t\t\tSize[X] += Size[Z];\n\t\t\tfa[Z] = X;\n\t\t}\n\t\tmaxn = max(maxn,histogram[x] * Size[X]);\n\t} \n\tprintf(\""%lld\"",maxn);\n}",SEGMENTATION_FAULT,21,4948
1591693714928721920,e51465ce72346fac918042a342986433269a159492161f223a180a6e05d9a01a,2022-11-13 15:25:28,Java,0.0,1591610585635213315,1591129345182261248,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n\t\npublic static void main(String[] args) {\n\t    Scanner sc =new Scanner(System.in);\n\t    int num  =sc.nextInt();\n\t    int index=0;\n\t    int max = 0;\n\t    int result=0;\n\t    int s=0;\n\t    \n\t    int [] arr=new int [num];\n\t    int []dp=new int [num];\n\t    for(int i=0;i<num;i++){\n\t    \tarr[i]=sc.nextInt();\n\t    \t \n\t    }\n\t    for(int i=2;i<arr.length-2;i++){\n\t    \t\n\t    \t\n\t    \tdp[i]=dp[i]+arr[i-2]>dp[i]+arr[i]?dp[i]+arr[i-2]:dp[i]+arr[i];\n\t    \tdp[i]-=5;\n\t    \t//System.out.println(dp[i]);\n\t    \t\n   \t        \tresult+=dp[i];\n   \t        \n\t    }\n\t   \n\t    System.out.println(result);\n\t    \n}\n},WRONG_ANSWER,299,41756
1591693722746937344,458af3c005e0b282d1ca88c254d9910ee2d93738b6f06d399f7444e1e64831eb,2022-11-13 15:25:30,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int i,j,n,a[10],max,q=0;\n    scanf(\""%d\"",&n);\n    getchar();\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n        getchar();\n    }\n    for(j=0;j<10;){\n        max=a[j];\n        i=j;\n        if(a[i+2]>max){\n            max=a[i+2];\n            j=i+3;\n        }\n        else j++;\n        q=q+max-5;\n    }\n    printf(\""%d\"",q);\n    return 0;\n}\n\n",SEGMENTATION_FAULT,14,328
1591693743466799104,a5291eb67188c2a916aa5dd9fc38f2e449aa9f9a3cd047f282d8c154ea2979cd,2022-11-13 15:25:35,C++,300.0,1591610585639407617,1591132482555211776,1049226928954454016,#include <iostream>\n#include <vector> \nusing namespace std;\n\nconst int N = 1e6 + 10;\nint h[N];\n\n\nint main()\n{\n\tint n = 0;\n\tcin >> n;\n\tfor(int i = 1;i <= n;i++)\n\t{\n\t\tcin >> h[i];\n\t}\n\tint S_max = h[1];\n    for(int i = 1;i <= n - 1;i++)\n    {\n        int min_h = h[i];\n        int S = h[i];\n        for(int j = i + 1;j <= n;j++)\n        {\n            if(h[j] >= h[i])\n            {\n                S = (j - i + 1) * min_h;\n            }\n            else\n            {\n                if(min_h > h[j])\n                {\n                    min_h = h[j];\n                }\n                S = (j - i + 1) * min_h;\n            }\n            \n            if(S > S_max)\n            {\n                S_max = S;\n            }\n        }\n        \n        \n    }\n    \n    cout << S_max << endl;\n\treturn 0;\n} ,ACCEPTED,32,456
1591693753478569984,458af3c005e0b282d1ca88c254d9910ee2d93738b6f06d399f7444e1e64831eb,2022-11-13 15:25:37,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int i,j,n,a[10],max,q=0;\n    scanf(\""%d\"",&n);\n    getchar();\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n        getchar();\n    }\n    for(j=0;j<10;){\n        max=a[j];\n        i=j;\n        if(a[i+2]>max){\n            max=a[i+2];\n            j=i+3;\n        }\n        else j++;\n        q=q+max-5;\n    }\n    printf(\""%d\"",q);\n    return 0;\n}\n\n",SEGMENTATION_FAULT,9,348
1591693772680126464,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-13 15:25:42,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int num;\n    scanf(\""%d\"",&num);\n    int a[num];\n    int area[num];\n    int i,j,max = 0;\n    int temp;\n    for(i = 0;i < num;i++) {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i = 0;i < num;i++) {\n        temp = a[i];\n        for(j = i+1;j < num;j++) {\n            if(a[j]>=temp){\n                a[i] += temp;\n            }\n        }\n    }\n    for(i = 0;i<num;i++) {\n        if(max < a[i]) {\n            max = a[i];\n        }\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",WRONG_ANSWER,6,488
1591693777763622912,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-13 15:25:43,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"a=int(input())\ndata=list(map(int,input().split()))\ncount=0\ndatas=[]\nc=0\nfor i in range(0,a):\n    if len(datas)==0:\n       datas.append(data[i])\n    elif datas[len(datas)-1]>=data[i] and c!=0:\n            datas.append(data[i])\n    elif c==0 and datas[len(datas)-1]==data[i]:\n        count=count\n        datas=[data[i]]\n    elif i!=1:\n         datas=[data[i]]\n         count+=1\n         c+=1\nprint(count)\n",WRONG_ANSWER,20,2760
1591693792607232000,172db3e4a89a3dc038ec44e9346ef3138ace8cc1576eb636ccaf26fd91d7a145,2022-11-13 15:25:47,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#include <algorithm>\n\nusing namespace std;\ntypedef long long ll;\nconst int N = 1e4 + 10;\n\nstruct node{\n\tll a,b;\n}per[N];\n\nll fa[N],Size[N],maxn,histogram[N];\n\nbool cmp(node a1,node a2) {\n\tif(a1.a > a2.a) return a1.a > a2.a;\n\telse return a1.b < a2.b;\n}\n\nint find(int x) {\n\tif(fa[x] == x) return x;\n\treturn fa[x] = find(fa[x]);\n}\n\nint main(){\n\tint n;\n\tscanf(\""%d\"",&n);\n\tfor(int i=1;i<=n;i++) {\n\t\tscanf(\""%lld\"",&histogram[i]);\n\t\tper[i].a = histogram[i];\n\t\tper[i].b = i;\n\t\tfa[i] = i;\n\t\tSize[i] = 1;\n\t}\n\tsort(per+1,per+n+1,cmp);\n\tfor(int i=1;i<=n;i++) {\n\t\tint x = per[i].b;\n\t\tint X = find(x);\n\t\tint Y = find(x-1);\n\t\tint Z = find(x + 1);\n\t\tif(histogram[x - 1] >= histogram[x] && X != Y) {\n\t\t\tSize[X] += Size[Y];\n\t\t\tfa[Y] = X;\n\t\t} \n\t\tif(histogram[x + 1] >= histogram[x] && X != Z)  {\n\t\t\tSize[X] += Size[Z];\n\t\t\tfa[Z] = X;\n\t\t}\n\t\tmaxn = max(maxn,histogram[x] * Size[X]);\n\t} \n\tprintf(\""%lld\"",maxn);\n}",SEGMENTATION_FAULT,12,628
1591693867744026624,1f29a576db974352c60cbe8aafdc4e5328b24d800890ab1c712d8c9fa85d72cc,2022-11-13 15:26:04,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint i,j,h[n];\n\tfor(i=0;i<n;i++)\n\tscanf(\""%d\"",&h[i]);\n\tint s=0,k,max=0;\n\tint a=0;\n\tfor(i=0;i<n;i++)\n\t{\n\t\ta=0;\n\t\tfor(j=0;j<n-i;j++)\n\t\t{\n\t\t\tif(h[i]<=h[i+j])\n\t\t\ta++;\n\t\t\telse break;\n\t\t}\n\t\tfor(k=1;k<i-1;k++)\n\t\t{\n\t\t\tif(h[i]<=h[i-k])\n\t\t\ta++;\n\t\t\telse break;\n\t\t}\n\t\ts=h[i]*a;\n\t\tif(s>max) max=s;\n\t}\n\tprintf(\""%d\"",max);\n\treturn 0;\n } ",WRONG_ANSWER,25,356
1591693915919802368,1f29a576db974352c60cbe8aafdc4e5328b24d800890ab1c712d8c9fa85d72cc,2022-11-13 15:26:16,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint i,j,h[n];\n\tfor(i=0;i<n;i++)\n\tscanf(\""%d\"",&h[i]);\n\tint s=0,k,max=0;\n\tint a=0;\n\tfor(i=0;i<n;i++)\n\t{\n\t\ta=0;\n\t\tfor(j=0;j<n-i;j++)\n\t\t{\n\t\t\tif(h[i]<=h[i+j])\n\t\t\ta++;\n\t\t\telse break;\n\t\t}\n\t\tfor(k=1;k<i-1;k++)\n\t\t{\n\t\t\tif(h[i]<=h[i-k])\n\t\t\ta++;\n\t\t\telse break;\n\t\t}\n\t\ts=h[i]*a;\n\t\tif(s>max) max=s;\n\t}\n\tprintf(\""%d\"",max);\n\treturn 0;\n } ",WRONG_ANSWER,18,344
1591693942968868864,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-13 15:26:22,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\n#define N 10000\n\n\nint pand(char *a,int i,int n)\n{\n    int b,c;\n    a[i]=a[i+2];\n    a[i+1]=a[i+3];\n    i++;\n    if(i<n) pand(a,i,n);\n    else return 0;\n\n}\n\n\n\n\n\n\nint main()\n{\n    char a[10000];\n    int n,i,j,k,l;\n    j=0;\n    scanf(\""%d\"",&n);\n    scanf(\""%s\"",&a);\n    a[n]='\\0';\n    for(l=0;l<n;l++){\n    for(i=0;i<n;i++)\n    {\n        //if(i=0&&a[0]!=a[1]) a[0]=a[2];\n        //a[1]=a[]\n        \n        k=i;\n        if(i>=0&&a[i]!=a[i+1]&&(a[i]=='1'||a[i]=='0')&&i<n)\n            {\n//printf(\""%s\\n,n=%d\\n\"",a,n);\n            if(n>0){\n            pand(a,i,n);\n            n-=2;\n            j+=2;\n            }\n\n            }\n\n    }\n    }//printf(\""!%s\"",a);\n\nprintf(\""%d\\n\"",j);\n\n\n\n\n\n    return 0;\n}",SEGMENTATION_FAULT,37,324
1591693962006814720,25584884fd716238437f89484285121d106c1090916ab683be624f210130ebad,2022-11-13 15:26:27,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,j,count;\n    count=0;\n    scanf(\""%d\"",&n);\n        int h[n];\n    for(i=0;i<n;i++)\n    scanf(\""%d\"",&h[i]);\n        for(i=1;i<n-1;i++)\n        {\n        if(h[i]<h[i-1]&&h[i]<h[i+1])\n            count++;\n        if(h[i]==h[i+1]);\n        for(j=i+1;j<n-1;j++)\n        {\n            if(h[j+1]<h[j])\n            {\n                i=j;\n                break;\n            }\n            else if(h[j+1]>h[j])\n            {\n                count++;\n                i=j;\n                break;\n            }\n        }\n    }\n    printf(\""%d\"",count);\n}",WRONG_ANSWER,5,192
1591694021570093056,17759f531671f838bf3fae4270190e93b6109026f9503f986c1ed85bb412007d,2022-11-13 15:26:41,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<string.h>\n#define N 100000\nint main()\n{\n    int i,n,sum=0;\n    char a[N]={0};\n    scanf(\""%d\"",&n);\n    getchar();\n    gets(a);\n    for(i=0;i<n;i++)\n    {\n        if(a[i]=='0'||a[i]=='1')\n            if(a[i]==a[i+1])\n            {\n                    sum=sum+2;\n                    a[i]=a[i+2];\n                    a[i+1]=a[i+3];\n                    a[i+2]=a[i+4];\n                    i=i-2;\n            }\n    }\n    printf(\""%d\"",sum);\n}",TIME_LIMIT_EXCEEDED,400,452
1591694021712732160,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-13 15:26:41,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"a=int(input())\ndata=list(map(int,input().split()))\ncount=0\ndatas=[]\nc=0\nfor i in range(0,a):\n    if len(datas)==0:\n       datas.append(data[i])\n    elif datas[len(datas)-1]>=data[i] and c!=0:\n            datas.append(data[i])\n    elif c==0 and datas[len(datas)-1]==data[i]:\n        count=count\n        datas=[]\n    elif i!=1:\n         datas=[data[i]]\n         count+=1\n         c+=1\nprint(count)\n",WRONG_ANSWER,18,2760
1591694024694882304,281adcca8943f9f4c0ced14f1ceffe157a34fca39f3cb864eb95e400944e38a8,2022-11-13 15:26:42,Java,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner scan=new Scanner(System.in);\n\t\tint n=scan.nextInt();\n\t\tint[] arr=new int[n];\n\t\tint s=0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tarr[i]=scan.nextInt();\n\t\t}\n\t\tint max=0;\n\t\tint len=0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tint h=arr[i];\n\t\t\tfor(int j=i;j<n;j++){\n\t\t\t\tif(h>arr[j]){\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tlen++;\n\t\t\t\ts=len*h;\n\t\t\t}\n\t\t\tmax=Math.max(s, max);\n\t\t\ts=0;\n\t\t\tlen=0;\n\t\t}\n\t\tSystem.out.println(max);\n\t}\n}\n",WRONG_ANSWER,356,25384
1591694039861485568,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-13 15:26:46,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\n#define N 10000\n\n\nint pand(char *a,int i,int n)\n{\n    int b,c;\n    a[i]=a[i+2];\n    a[i+1]=a[i+3];\n    i++;\n    if(i<n) pand(a,i,n);\n    else return 0;\n\n}\n\n\n\n\n\n\nint main()\n{\n    char a[10000];\n    int n,i,j,k,l;\n    j=0;\n    scanf(\""%d\"",&n);\n    scanf(\""%s\"",&a);\n    a[n]='\\0';\n    for(l=0;l<n;l++){\n    for(i=0;i<n;i++)\n    {\n        //if(i=0&&a[0]!=a[1]) a[0]=a[2];\n        //a[1]=a[]\n        \n        k=i;\n        if(i>=0&&a[i]!=a[i+1]&&(a[1]=='1'||a[1]=='0')&&i<n)\n            {\n//printf(\""%s\\n,n=%d\\n\"",a,n);\n            if(n>0){\n            pand(a,i,n);\n            n-=2;\n            j+=2;\n            }\n\n            }\n\n    }\n    }//printf(\""!%s\"",a);\n\nprintf(\""%d\\n\"",j);\n\n\n\n\n\n    return 0;\n}",SEGMENTATION_FAULT,35,388
1591694073390706688,70c675ddfcb60b2192bc8ac38fb068fec0500208a5bf97a796c7cc074b43cf87,2022-11-13 15:26:53,Java,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner myScanner = new Scanner(System.in);\n\t\tint n = myScanner.nextInt();\n\t\tint[] arr = new int[n];\n\t\tfor(int i = 0; i < n;i++){\n\t\t\tarr[i] = myScanner.nextInt();\n\t\t}\n\t\tint minmax = 0;\n\t\tint count = 0;\n\t\tint max = 0;\n\t\tfor(int i = 0;i < n;i++){\n\t\t\tcount = 0;\n\t\t\tfor(int j = 0;j < n;j++){\n\t\t\t\tif(arr[i] <= arr[j]){\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tminmax = arr[i] * count;\n\t\t\t\tif(minmax >= max){\n\t\t\t\t\tmax = minmax;\n\t\t\t\t}\n\t\t}\n// \t\tSystem.out.printf(\""%d\"",max);\n        System.out.println(max);\n\t}\n\n}",WRONG_ANSWER,111,24628
1591694104038531072,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 15:27:01,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int n,a,b;\n    int sum=0;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    int c[n],f[n];\n    int i;\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&c[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&f[i]);\n    }\n     for(i=0;i<n;i++)\n              {\n                  sum+=c[i]/(f[i]+1)*pow(a,(f[i]+1))-c[i]/(f[i]+1)*pow(b,(f[i]+1));\n              }\n              printf(\""%d\"",sum);\n              return 0;\n}",WRONG_ANSWER,12,196
1591694105804288000,05fd79145678de5c06012db9db4333bebf8365a74fe442d12a54a9da3782fdca,2022-11-13 15:27:01,C++,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<iostream>\n#define N 100005\nusing namespace std;\nlong long int jump[N];\nlong long int n;\nlong long int ci = 0;\nlong long int maxScore;\nlong long int Maxhash[N];\nvoid jumps(int index,int num,long long int score){\n\tif(index + num >= n) {\n\t\tif(ci==0){\n\t\t\tmaxScore = Maxhash[index];\n\t\t\tci+=1;\n\t\t}\n\t\telse{\n            if(Maxhash[index] < score) Maxhash[index] = score;\n\t\t}\n\t\treturn;\n\t}\n\tscore-=5;\n\tscore+=jump[index+num];\n\tif(ci==0){\n\t\tMaxhash[index+num] = score;\n\t}else if(Maxhash[index+num] < score){\n\t\tMaxhash[index+num] = score;\n\t}else if(Maxhash[index+num] >= score ){\n\t\treturn;\n\t}\n\tjumps(index+num,1,score);\n\tjumps(index+num,3,score);\n}\n\nint main(){\n\tcin >> n;\n\tlong long int max;\n\tfor(int i = 0;i<n;i++) cin >>jump[i];\n\tjumps(-1,1,0);\n\tjumps(-1,3,0);\n\n\tcout << Maxhash[n-1];\n\treturn 0;\n}\n",TIME_LIMIT_EXCEEDED,400,964
1591694128986206208,7ecf54bf0ea2db8ab0397aa941f19ec79a351bc3e86e8c01673aa09a69b3a6db,2022-11-13 15:27:07,Python,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"n = int(input())\ns = input().split()\nmax = int(s[0])\n\nfor j in range(0,n):\n    l=1\n    for k in range(j,n-1):\n        if(int(s[j])>int(s[k+1])):\n            break\n        l+=1\n    if(max<=int(s[j])*l):\n        max = int(s[j])*l\n\nprint(max)",WRONG_ANSWER,58,2948
1591694134489145344,25584884fd716238437f89484285121d106c1090916ab683be624f210130ebad,2022-11-13 15:27:08,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,j,count;\n    count=0;\n    scanf(\""%d\"",&n);\n        int h[n];\n    for(i=0;i<n;i++)\n    scanf(\""%d\"",&h[i]);\n        for(i=1;i<n-1;i++)\n        {\n        if(h[i]<h[i-1]&&h[i]<h[i+1])\n            count++;\n        if(h[i]==h[i+1]);\n        for(j=i+1;j<n-1;j++)\n        {\n            if(h[j+1]<h[j])\n            {\n                i=j;\n                break;\n            }\n            else if(h[j+1]>h[j])\n            {\n                count++;\n                i=j;\n                break;\n            }\n        }\n    }\n    printf(\""%d\"",count);\n}",WRONG_ANSWER,9,512
1591694194245427200,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-13 15:27:22,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\n#define N 10000\n\n\nint pand(char *a,int i,int n)\n{\n    int b,c;\n    a[i]=a[i+2];\n    a[i+1]=a[i+3];\n    i++;\n    if(i<n) pand(a,i,n);\n    else return 0;\n\n}\n\n\n\n\n\n\nint main()\n{\n    char a[10000];\n    int n,i,j,k,l;\n    j=0;\n    scanf(\""%d\"",&n);\n    scanf(\""%s\"",&a);\n    a[n]='\\0';\n    for(l=0;l<n;l++){\n    for(i=0;i<n;i++)\n    {\n        //if(i=0&&a[0]!=a[1]) a[0]=a[2];\n        //a[1]=a[]\n        \n        k=i;\n        if(i>=0&&a[i]!=a[i+1]&&(a[0]=='1'||a[0]=='0')&&i<n)\n            {\n//printf(\""%s\\n,n=%d\\n\"",a,n);\n            if(n>0){\n            pand(a,i,n);\n            n-=2;\n            j+=2;\n            }\n\n            }\n\n    }\n    }//printf(\""!%s\"",a);\n\nprintf(\""%d\\n\"",j);\n\n\n\n\n\n    return 0;\n}",SEGMENTATION_FAULT,54,456
1591694216848498688,d9e00d995e65b04cda3ddef6baec19225e4351002ab4efa981f62d78919a481b,2022-11-13 15:27:28,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int a,b,n;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    int c[n],F[n];\n    int i;\n    for(i=0;i<n;i++) scanf(\""%d\"",&c[i]);\n    for(i=0;i<n;i++) scanf(\""%d\"",&F[i]);\n    int sum=0;\n    for(i=0;i<n;i++)\n    {\n        sum += ( c[i] * pow(a,F[i]+1) - c[i] * pow(b,F[i]+1))/(F[i]+1);\n    }\n\n    printf(\""%d\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,9,352
1591694247458529280,458af3c005e0b282d1ca88c254d9910ee2d93738b6f06d399f7444e1e64831eb,2022-11-13 15:27:35,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int i,j,n,a[1000000000],max,q=0;\n    scanf(\""%d\"",&n);\n    getchar();\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n        getchar();\n    }\n    for(j=0;j<10;){\n        max=a[j];\n        i=j;\n        if(a[i+2]>max){\n            max=a[i+2];\n            j=i+3;\n        }\n        else j++;\n        q=q+max-5;\n    }\n    printf(\""%d\"",q);\n    return 0;\n}\n\n",SEGMENTATION_FAULT,14,500
1591694247617912832,6a4a105e99255cc39ebb6a122c9fdf740e574dbb708100363b339265f92e1bbf,2022-11-13 15:27:35,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n,i,x;\n    scanf(\""%d\"",&n);\n    int A[n]={0};\n    for(i=1;i<=n;i++){\n        scanf(\""%d\"",&A[i]);\n    }\n    for(i=2;i<=n;i++){\n    for(x=0;x<i;){\n            if(A[i+1]<=A[i]){\n                x++;\n            }\n        }\n    }\n    printf(\""%d\"",x);\n}",COMPILE_ERROR,0,0
1591694255524163584,1f29a576db974352c60cbe8aafdc4e5328b24d800890ab1c712d8c9fa85d72cc,2022-11-13 15:27:37,C,300.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint i,j,h[n];\n\tfor(i=0;i<n;i++)\n\tscanf(\""%d\"",&h[i]);\n\tint s=0,k,max=0;\n\tint a=0;\n\tfor(i=0;i<n;i++)\n\t{\n\t\ta=0;\n\t\tfor(j=0;j<n-i;j++)\n\t\t{\n\t\t\tif(h[i]<=h[i+j])\n\t\t\ta++;\n\t\t\telse break;\n\t\t}\n\t\tfor(k=1;k<i+1;k++)\n\t\t{\n\t\t\tif(h[i]<=h[i-k])\n\t\t\ta++;\n\t\t\telse break;\n\t\t}\n\t\ts=h[i]*a;\n\t\tif(s>max) max=s;\n\t}\n\tprintf(\""%d\"",max);\n\treturn 0;\n } ",ACCEPTED,47,500
1591694255993925632,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-13 15:27:37,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\n#define N 10000\n\n\nint pand(char *a,int i,int n)\n{\n    int b,c;\n    a[i]=a[i+2];\n    a[i+1]=a[i+3];\n    i++;\n    if(i<n) pand(a,i,n);\n    else return 0;\n\n}\n\n\n\n\n\n\nint main()\n{\n    char a[10000];\n    int n,i,j,k,l;\n    j=0;\n    scanf(\""%d\"",&n);\n    scanf(\""%s\"",&a);\n    a[n]='\\0';\n    for(l=0;l<n;l++){\n    for(i=0;i<n;i++)\n    {\n        //if(i=0&&a[0]!=a[1]) a[0]=a[2];\n        //a[1]=a[]\n        \n        k=i;\n        if(i>=0&&a[i]!=a[i+1]&&(a[0]=='1'||a[0]=='0')&&i<n-1)\n            {\n//printf(\""%s\\n,n=%d\\n\"",a,n);\n            if(n>0){\n            pand(a,i,n);\n            n-=2;\n            j+=2;\n            }\n\n            }\n\n    }\n    }//printf(\""!%s\"",a);\n\nprintf(\""%d\\n\"",j);\n\n\n\n\n\n    return 0;\n}",WRONG_ANSWER,19,384
1591694302529728512,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-13 15:27:48,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\n#define N 10000\n\n\nint pand(char *a,int i,int n)\n{\n    int b,c;\n    a[i]=a[i+2];\n    a[i+1]=a[i+3];\n    i++;\n    if(i<n) pand(a,i,n);\n    else return 0;\n\n}\n\n\n\n\n\n\nint main()\n{\n    char a[10000];\n    int n,i,j,k,l;\n    j=0;\n    scanf(\""%d\"",&n);\n    scanf(\""%s\"",&a);\n    a[n]='\\0';\n    for(l=0;l<n;l++){\n    for(i=0;i<n;i++)\n    {\n        //if(i=0&&a[0]!=a[1]) a[0]=a[2];\n        //a[1]=a[]\n        \n        k=i;\n        if(i>=0&&a[i]!=a[i+1]&&(a[1]=='1'||a[1]=='0')&&i<n-1)\n            {\n//printf(\""%s\\n,n=%d\\n\"",a,n);\n            if(n>0){\n            pand(a,i,n);\n            n-=2;\n            j+=2;\n            }\n\n            }\n\n    }\n    }//printf(\""!%s\"",a);\n\nprintf(\""%d\\n\"",j);\n\n\n\n\n\n    return 0;\n}",WRONG_ANSWER,8,604
1591694308334657536,28b4de6882b7ade2679f59c486acaf307ce8415dcb0a15787dba589025bbdb02,2022-11-13 15:27:50,C++,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint n,i,j,k=0;\n\tscanf(\""%d\"",&n);\n\tgetchar();\n\tchar num[n+1];\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%c\"",&num[i]);\n\t}\n    \n\tfor(i=0,j=1;j<n;)\n\t{\n        if(num[i]!=num[j])\n        {\n            k=k+2;\n            i=i-1;\n            j=j+1;\n        }\n        else\n        {\n            i=j;\n            j++;\n        }\n\t\t\n\t}\n\tprintf(\""%d\\n\"",k);\n\treturn 0;\n}",WRONG_ANSWER,11,196
1591694356934045696,b73a04f1a7af1c2516ca68b38e336912bdf10c4f4bf7bac55e4e0de29dcf3d9d,2022-11-13 15:28:01,C++,300.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<bits/stdc++.h>\n#define N 10005\n#define int long long\n\nusing namespace std;\n\n\nsigned main() {\n\tint count=1;\n\t//cin>>count;\n\twhile(count--)\n\t{\n\tint n;\n\tint heights[N];\n\tcin>>n;\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tcin>>heights[i];\n\t}\n    int ans=0;\n    for (int left = 0; left < n; ++left) {\n        int minHeight = INT_MAX;\n        for (int right = left; right < n; ++right) {\n            minHeight = min(minHeight, heights[right]);\n            ans = max(ans, (right - left + 1) * minHeight);\n        }\n    }\n        cout<<ans;\n\t}\n\treturn 0;\n}\n",ACCEPTED,34,640
1591694485057462272,05fd79145678de5c06012db9db4333bebf8365a74fe442d12a54a9da3782fdca,2022-11-13 15:28:32,C++,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<iostream>\n#define N 100005\nusing namespace std;\nlong long int jump[N];\nlong long int n;\nlong long int ci = 0;\nlong long int maxScore;\nlong long int Maxhash[N];\nvoid jumps(int index,int num,long long int score){\n\tif(index + num >= n) {\n\t\tif(ci==0){\n\t\t\tmaxScore = Maxhash[index];\n\t\t\tci+=1;\n\t\t}\n\t\telse{\n            if(Maxhash[index] < score) Maxhash[index] = score;\n\t\t}\n\t\treturn;\n\t}\n\tscore-=5;\n\tscore+=jump[index+num];\n\tif(ci==0){\n\t\tMaxhash[index+num] = score;\n\t}else if(Maxhash[index+num] < score){\n\t\tMaxhash[index+num] = score;\n\t}else if(Maxhash[index+num] >= score ){\n\t\treturn;\n\t}\n\tjumps(index+num,1,score);\n\tjumps(index+num,3,score);\n}\n\nint main(){\n\tcin >> n;\n\tlong long int max;\n\tfor(int i = 0;i<n;i++) cin >>jump[i];\n\tjumps(-1,1,0);\n\tjumps(-1,3,0);\n\n\tcout << Maxhash[n-1];\n\treturn 0;\n}\n",TIME_LIMIT_EXCEEDED,400,896
1591694532583153664,0ccbaaa612b3d01dbe621ce5e7366d6e26d2e5adf55047d92c6eb7adf78a979d,2022-11-13 15:28:43,C++,300.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int n;cin>>n;\n    long long int a[n];\n    int maxArea=0;\n    for(int i=0;i<n;i++) cin>>a[i];\n    for(int i=0;i<n;i++)\n    {\n        int t,count=0;\n        for(int j=0;j<n;j++)\n        {\n            if(a[j]>=a[i]) {count++;continue;}\n            else if(a[j]<a[i]&&j>i) break;\n            else if(a[j]<a[i]&&j<i) count=0;\n        }\n        t=count*a[i];\n        if(t>maxArea) maxArea=t;\n    }\n    if(a[n-1]>maxArea) maxArea=a[n-1];\n    cout<<maxArea;\n    return 0;\n}\n",ACCEPTED,67,616
1591694627244355584,fbea21dbaf89f1b064feaa20227f21c5e1c4888fdc371cf5e43f70615906e52a,2022-11-13 15:29:06,Python,300.0,1591610585635213317,1591130976212869120,1049226928954454016,"n=list(map(int,input().split()))\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\nsum=0\nfor i in range(n[0]):\n    x=(a[i]/(b[i]+1))*(n[1]**(b[i]+1)-n[2]**(b[i]+1)) \n    sum+=x\nprint(\""%.0f\""%sum)",ACCEPTED,87,2908
1591694662287810560,7e6a67f270e740aba8788a12d9a49939621a28d5059d3ced2247a86914b0a3b3,2022-11-13 15:29:14,C++,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\t\n\tint a[n];\n\tint i;\n    int sum=0;\n\tfor(i=0;i<n;i++)\n\t\tscanf(\""%d\"",&a[i]);\n\t\n\ti=0;\n\twhile(i<n)\n\t{\n\t\tif(a[i+2]>a[i])\n\t\t{\n\t\t\tsum+=a[i+2];\n\t\t\ti+=3;\t\n\t\t} \n\t\telse \n\t\t{\n\t\t\tsum+=a[i];\n\t\t\ti++;\n\t\t}\n\t\tsum-=5;\n\t}\n\tprintf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,6,328
1591694667878785024,86f702b052a21d7cb2f8cd933c678c21efaafaf5b2d35032f18ec35c1e26a945,2022-11-13 15:29:15,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,max=0;\n    int c,b,x,d;\n    scanf(\""%d\"",&n);\n    int a[1000000]={0};\n    for(i=1;i<=n;i++)\n    scanf(\""%d\"",&a[i]);\n    x=0;\n   while(x<n)\n    {\n        c=a[x+1]-5;\n        b=a[x+3]-5;\n        d=a[x+2]-5;\n       if(x<n-1)\n       {  if(c>=0) \n          {max=c+max;\n           x=x+1;}\n          else\n          {\n            if(c+d+b>b){\n                max=c+max;\n                x=x+1; }\n            else\n            {max=b+max;\n             x=x+3; }\n          }\n       }\n       else \n       {max=c+max;\n          x=x+1;}\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",WRONG_ANSWER,10,4432
1591694717996556288,d9e00d995e65b04cda3ddef6baec19225e4351002ab4efa981f62d78919a481b,2022-11-13 15:29:27,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int a,b,n;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    int c[n],F[n];\n    int i;\n    for(i=0;i<n;i++) scanf(\""%d\"",&c[i]);\n    for(i=0;i<n;i++) scanf(\""%d\"",&F[i]);\n    int sum=0;\n    for(i=0;i<n;i++)\n    {\n        sum += (c[i] * pow(a,F[i]+1) - c[i] * pow(b,F[i]+1) )/ (F[i]+1) ;\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,5,348
1591694753950130176,05fd79145678de5c06012db9db4333bebf8365a74fe442d12a54a9da3782fdca,2022-11-13 15:29:36,C++,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<iostream>\n#define N 100005\nusing namespace std;\nlong long int jump[N];\nlong long int n;\nlong long int ci = 0;\nlong long int maxScore;\nlong long int Maxhash[N];\nvoid jumps(int index,int num,long long int score){\n\tif(index + num >= n) {\n\t\treturn;\n\t}\n\tscore-=5;\n\tscore+=jump[index+num];\n\tif(ci==0){\n\t\tMaxhash[index+num] = score;\n\t}else if(Maxhash[index+num] < score){\n\t\tMaxhash[index+num] = score;\n\t}else if(Maxhash[index+num] >= score ){\n\t\treturn;\n\t}\n\tjumps(index+num,1,score);\n\tjumps(index+num,3,score);\n}\n\nint main(){\n\tcin >> n;\n\tlong long int max;\n\tfor(int i = 0;i<n;i++) cin >>jump[i];\n\tjumps(-1,1,0);\n\tjumps(-1,3,0);\n\n\tcout << Maxhash[n-1];\n\treturn 0;\n}\n",TIME_LIMIT_EXCEEDED,400,1088
1591694770299494400,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 15:29:40,Python,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"def canJump(self, nums):\n        \""\""\""\n        :type nums: List[int]\n        :rtype: bool\n        \""\""\""\n        '''贪心法\n        每一次都跳到选择最多（即跳的最远）的位置，这样他下一步能走的就包括了所有解，如果都不能到，就说明没有解(因此这一题能用贪心法)\n        即max(nums[i]+i-pos)\n        '''\n        n=len(nums)-1\n        pos=0  #记录当前的位置\n        if n==0:\n            return True\n        if nums[0]==0:\n            return False\n        for i in range(1,n+1):\n            if pos+nums[pos]>=n:\n                return True\n            else:\n                pos+=max(map(lambda x:(nums[pos+x]+x,x),range(1,nums[pos]+1)))[1]#跳到选择最多的位置\n            if pos>=n:\n                return True\n            if nums[pos]==0:  #动不了了\n                return False\n        else:\n            return False",WRONG_ANSWER,20,2904
1591694823701372928,86f702b052a21d7cb2f8cd933c678c21efaafaf5b2d35032f18ec35c1e26a945,2022-11-13 15:29:52,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,max=0;\n    int c,b,x,d;\n    scanf(\""%d\"",&n);\n    int a[1000000]={0};\n    for(i=1;i<=n;i++)\n    scanf(\""%d\"",&a[i]);\n    x=0;\n   while(x<n)\n    {\n        c=a[x+1]-5;\n        b=a[x+3]-5;\n        d=a[x+2]-5;\n       if(x<n-1)\n       {  if(c>=0) \n          {max=c+max;\n           x=x+1;}\n          else\n          {\n            if(c+d>b){\n                max=c+max;\n                x=x+1; }\n            else\n            {max=b+max;\n             x=x+3; }\n          }\n       }\n       else \n       {max=c+max;\n          x=x+1;}\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",WRONG_ANSWER,15,4096
1591694930467368960,d4c94290401b65ee2ce02056ca325b624120f06a8f67557b729453a418b199fe,2022-11-13 15:30:18,C++,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nconst int N=1e5;\n\nint n,count1=0,a[N],t,x,y,sum=0x7fffffff,z;\nstring str;\nint main(){\n\tcin>>x>>y>>z;\n\tsum=max(x,y);\n\tsum=max(sum,z);\n\tcout<<x+y+z-sum;\n} ",ACCEPTED,44,640
1591695030740594688,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-13 15:30:42,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"a=int(input())\ndata=list(map(int,input().split()))\ncount=0\ndatas=[]\nc=0\nfor i in range(0,a):\n    if len(datas)==0:\n       datas.append(data[i])\n    elif datas[len(datas)-1]>=data[i] and c!=0:\n            datas.append(data[i])\n    elif c==0 and datas[len(datas)-1]==data[i]:\n        count=count\n        datas=[data[i]]\n    elif i!=1:\n        if c!=0:\n             datas=[data[i]]\n             count+=1\n        c+=1\nprint(count)\n",WRONG_ANSWER,18,2908
1591695116493152256,e715137eeb4190ade2330123b989bbdd6eebd9a5e1df2e292271d3bfe3a79c69,2022-11-13 15:31:02,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint a[1000000]={0},d[1000000];\nint main()\n{\n    int i,j=0,k=1,n,b=0,c=1,w=0;\n    scanf(\""%d\"",&n);\n    k=n;\n    for(i=1;i<=n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=1;j<=n;j++)\n    {\n        k=1;\n        w=0;\n        \n   for(i=j;i<=n;i++)\n    {\n       \n       w+=a[j];\n       printf(\""%d\\n\"",w);\n       \n       if(a[i]<a[j])\n       {\n           d[b]=w;\n           b++;\n           k=0;\n           break;\n       }  \n    }\n        if(k)\n        {\n            d[b]=w;\n           b++;\n        }\n    }\n    w=d[0];\n    for(i=0;i<b;i++)\n    {\n        if(w<d[i])\n            w=d[i];\n    }\n    printf(\""%d\"",w);\n    return 0;\n        \n}",WRONG_ANSWER,6,380
1591695170880679936,3e087b0a196d30fcbb49ca80164c9eb5adf82ae3bb08ec0c141e5728fb180f0d,2022-11-13 15:31:15,Java,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"import java.util.Scanner;\n\npublic class Pb1 {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner sc=new Scanner(System.in);\n\t\tint i=0,res=0,len;\n\t\tint n=sc.nextInt();\n\t\tsc.nextLine();\n\t\tString str=sc.nextLine();\n\t\tString[] arr=str.split(\""\"");\n\t\tlen=n;\n\t\twhile(i<=len-2){\n\t\t\tif(!(arr[i].equals(arr[i+1]))){\n\t\t\t\tres=res+2;\n\t\t\t\tfor(int j=i;j<len-2;j++){\n\t\t\t\t\tarr[j]=arr[j+2];\n\t\t\t\t}\n\t\t\t\tlen=len-2;\n\t\t\t\ti--;\n\t\t\t}else{\n\t\t\t\ti++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.print(res);\n\t\tsc.close();\n\t}\n\n}",COMPILE_ERROR,0,0
1591695209678036992,6ba5ecacf3381a1e9382f99c413290eca40a071a563a618e5f36d66cbf9a5e1b,2022-11-13 15:31:24,C++,300.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<iostream>\n#include<math.h>\nusing namespace std;\n\nint main(){\nint n,a,b;\nfloat sum=0;\ncin>>n>>a>>b;\nint c[n],f[n];\nfor(int i=0;i<n;i++){\n    cin>>c[i];\n}\nfor(int i=0;i<n;i++){\n    cin>>f[i];\n}\nfor(int i=0;i<n;i++){\n    float m=float(c[i])/float(f[i]+1);\n    int k=1,l=1;\n    for(int j=0;j<f[i]+1;j++)\n    {\n        k=k*a;\n        l=l*b;\n    }\n    sum=sum+(m*(k-l));\n}\ncout<<sum<<endl;\n}\n",ACCEPTED,50,632
1591695223041056768,acf80eea856463058b81f71c0238069795893092293fbd098cc594959df6444e,2022-11-13 15:31:28,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"n=int(input())\ns=input().split()\nh=0\nfor i in range(1,n-1):\n    if s[i]<s[i-1] and s[i]<s[i+1] :\n        h=h+1\n    elif s[i]<s[i-1]:\n        if s[i]>s[i+1]:\n            continue\n        elif s[i]==s[i+1]:\n            for i in range(n-1):\n                if s[i]==s[i+1]:\n                   continue\n                elif s[i+1]>s[i]:\n                   h=h+1\n                else:\n                   break\nprint(h)\n",WRONG_ANSWER,18,2756
1591695252883529728,3e087b0a196d30fcbb49ca80164c9eb5adf82ae3bb08ec0c141e5728fb180f0d,2022-11-13 15:31:35,Java,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner sc=new Scanner(System.in);\n\t\tint i=0,res=0,len;\n\t\tint n=sc.nextInt();\n\t\tsc.nextLine();\n\t\tString str=sc.nextLine();\n\t\tString[] arr=str.split(\""\"");\n\t\tlen=n;\n\t\twhile(i<=len-2){\n\t\t\tif(!(arr[i].equals(arr[i+1]))){\n\t\t\t\tres=res+2;\n\t\t\t\tfor(int j=i;j<len-2;j++){\n\t\t\t\t\tarr[j]=arr[j+2];\n\t\t\t\t}\n\t\t\t\tlen=len-2;\n\t\t\t\ti--;\n\t\t\t}else{\n\t\t\t\ti++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.print(res);\n\t\tsc.close();\n\t}\n\n}",NON_ZERO_EXIT_CODE,110,24700
1591695291848646656,e715137eeb4190ade2330123b989bbdd6eebd9a5e1df2e292271d3bfe3a79c69,2022-11-13 15:31:44,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint a[1000000]={0},d[1000000];\nint main()\n{\n    int i,j=0,k=1,n,b=0,c=1,w=0;\n    scanf(\""%d\"",&n);\n    k=n;\n    for(i=1;i<=n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=1;j<=n;j++)\n    {\n        k=1;\n        w=0;\n        \n   for(i=j;i<n;i++)\n    {\n       \n       w+=a[j];\n       \n       if(a[i]<a[j])\n       {\n           d[b]=w;\n           b++;\n           k=0;\n           break;\n       }  \n    }\n        if(k)\n        {\n            d[b]=w;\n           b++;\n        }\n    }\n    w=d[0];\n    for(i=0;i<b;i++)\n    {\n        if(w<d[i])\n            w=d[i];\n    }\n    printf(\""%d\"",w);\n    return 0;\n        \n}",WRONG_ANSWER,9,348
1591695386337894400,2bc6a85c0376656012a7970a7842a2a9d8769555a79ef4eec85ff45aa30ff7b7,2022-11-13 15:32:07,Java,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n//\tpublic static void main(String[] args) {\n//\t\tScanner sc = new Scanner(System.in);\n//\t\tint num = sc.nextInt();\n//\t\tint[] arr = new int[num];\n//\t\tfor(int i = 0; i < num; ++i) {\n//\t\t\tarr[i] = sc.nextInt();\n//\t\t}\n//\t\tint tscore = 0;\n//\t\tfor(int i = -1;;) {\n//\t\t\tint lest = num -1 -i;\n//\t\t\tif(lest >= 3) {\n//\t\t\t\tint s1 = arr[i+1];\n//\t\t\t\tint s2 = arr[i+2];\n//\t\t\t\tint s3 = arr[i+3];\n//\t\t\t\tif(s1 + s2 - 10 > s3 -5) {\n//\t\t\t\t\tSystem.out.println(11);\n//\t\t\t\t\ttscore += s1 + s2 - 10;\n//\t\t\t\t\ti+=2;\n//\t\t\t\t} else {\n//\t\t\t\t\tSystem.out.println(3);\n//\t\t\t\t\ttscore += s3 -5;\n//\t\t\t\t\ti+=3;\n//\t\t\t\t}\n//\t\t\t\tcontinue;\n//\t\t\t} else if(lest >= 1) {\n//\t\t\t\tSystem.out.println(1);\n//\t\t\t\ttscore += arr[i+1] - 5;\n//\t\t\t\ti+=1;\n//\t\t\t\tcontinue;\n//\t\t\t}\n//\t\t\tbreak;\n//\t\t}\n//\t\tSystem.out.println(tscore);\n//\t}\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint num = sc.nextInt();\n\t\tint[] arr = new int[num];\n\t\tfor(int i = 0; i < num; ++i) {\n\t\t\tarr[i] = sc.nextInt();\n\t\t}\n\t\tint tscore1 = 0;\n\t\tint tscore2 = 0;\n\t\tfor(int i = -1; i < num - 1; ) {\n\t\t\tint s1 = arr[i+1];\n\t\t\tint s2 = 0;\n\t\t\tif(i+3 < num) {\n\t\t\t\ts2 = arr[i+3];\n\t\t\t}\n\t\t\tif(s1 > s2) {\n\t\t\t\ttscore1 = tscore1 + s1 -5;\n\t\t\t\ti+=1;\n\t\t\t} else {\n\t\t\t\ttscore1 = tscore1 + s2 -5;\n\t\t\t\ti+=3;\n\t\t\t}\n\t\t}\n\t\tfor(int i = -1; i < num - 1; ) {\n\t\t\tint s1 = arr[i+1];\n\t\t\tint s2 = 0;\n\t\t\tif(i+3 < num) {\n\t\t\t\ts2 = arr[i+3];\n\t\t\t}\n\t\t\tif(s1 > s2) {\n\t\t\t\ttscore2 = tscore2 + s1 -5;\n\t\t\t\ti+=1;\n\t\t\t} else {\n\t\t\t\ttscore2 = tscore2 + s2 -5;\n\t\t\t\ti+=3;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(Math.max(tscore1,tscore2));\n\t}\n}\n",WRONG_ANSWER,304,42604
1591695393770188800,40c43472973ea298adbdd1d4b900aeb63cfa4cfe17179f01a4827cd2c6624d3a,2022-11-13 15:32:08,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nmain()\n{\n    int n;\n    int h[20];\n    int i;\n    int t=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&h[i]);\n    }\n    for(i=0;i<n-2;i++)\n    {\n        if(h[i]>h[i+1])\n            t++;\n    }\n    printf(\""%d\"",t);\n}",WRONG_ANSWER,9,356
1591695403505213440,e7e6ce2c6e9e530eaf2b9b9968748a0e44e3ac7183d73deb51851946350bfbb0,2022-11-13 15:32:11,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    int flag=0;\n    int i;\n    int n,h[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++) {\n        scanf(\""%d\"",&h[i]);\n    }\n\n     for(i=1;i<n;i++) {\n        if(h[i]==h[i+1]) {\n            i++;\n        }\n\n\n\n        if(h[i]<h[i-1]&&h[i]<h[i+1]&&h[i+1]!='\\0')\n            flag++;\n\n     }\n\n    printf(\""%d\"",flag);\n    return 0;\n}\n",WRONG_ANSWER,6,196
1591695437671968768,0d24b4ee85e6e3a4cc694f7e11105fa2aaf93fd10d4cbe81657f252e2d675435,2022-11-13 15:32:19,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int num;\n    int i=0,t=0;\n    int arr[1000];\n    scanf(\""%d\"",&num);\n    while(i<num){\n        scanf(\""%d\"",&t);\n      arr[i++] = t;\n    }\n    int j,s,sum=0;\n    for(j=1,s=1;j<num,s<num;j++,s++){\n     if(arr[j]!=arr[j+s]||arr[j]!=arr[j-s])\n        if(arr[j]<arr[j-1]&&arr[j]<arr[j+1])\n            sum++;\n    else if(arr[j]<arr[j-s]&&arr[j]<arr[j+s])\n           sum++;\n    }\n\nprintf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,33,352
1591695483251515392,7935e8f5cb04027f4d30ac84a997e2d03e946e112c1cb17f1a4f943d8b0b54bf,2022-11-13 15:32:30,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <iostream>\n#include<stdio.h>\n#include<algorithm>\n\nusing namespace std;\n\nint main()\n{\n    int n,i,t,j,m=0;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n    {\n        t=1;\n        for(j=i+1;j<n;j++)\n        {\n            if(a[i]<=a[j])\n                t+=1;\n        }\n        m=max(m,a[i]*t);\n    }\n    printf(\""%d\"",m);\n    return 0;\n}\n",WRONG_ANSWER,10,476
1591695566856544256,05fd79145678de5c06012db9db4333bebf8365a74fe442d12a54a9da3782fdca,2022-11-13 15:32:50,C++,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<iostream>\n#define N 100005\nusing namespace std;\nlong long int jump[N];\nlong long int n;\nlong long int ci = 0;\nlong long int maxScore;\nlong long int Maxhash[N];\nvoid jumps(int index,int num,long long int score){\n\tif(index + num >= n) {\n\t\treturn;\n\t}\n\tscore-=5;\n\tscore+=jump[index+num];\n\tif(ci==0){\n\t\tMaxhash[index+num] = score;\n\t}else if(Maxhash[index+num] < score){\n\t\tMaxhash[index+num] = score;\n\t}else if(Maxhash[index+num] >= score ){\n\t\treturn;\n\t}\n\tjumps(index+num,1,score);\n\tjumps(index+num,3,score);\n}\n\nint main(){\n\tcin >> n;\n\tlong long int max;\n\tlong long int num = 0;\n    for(int i = 0;i<n;i++) {\n        num = num-5+jump[i];\n        cin >>jump[i]\n        Maxhash[i] = num;\n    };\n\tjumps(-1,1,0);\n\tjumps(-1,3,0);\n\n\tcout << Maxhash[n-1];\n\treturn 0;\n}\n",COMPILE_ERROR,0,0
1591695580873895936,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-13 15:32:53,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int num;\n    scanf(\""%d\"",&num);\n    int a[num];\n    int area[num];\n    int i,j,max = 0;\n    int temp;\n    for(i = 0;i < num;i++) {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i = 0;i < num;i++) {\n        temp = a[i];\n        for(j = i+1;j < num;j++) {\n            if(a[j]>=temp){\n                a[i] += temp;\n            } else {\n                break;\n            }\n        }\n    }\n    for(i = 0;i<num;i++) {\n        if(max < a[i]) {\n            max = a[i];\n        }\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",WRONG_ANSWER,36,512
1591695633764081664,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-13 15:33:06,C,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<stdio.h>\nint main(){\n    int i,P,Q,R,min=10*10*10*3,temp=0;\n    scanf(\""%d\"",&P);\n    scanf(\""%d\"",&Q);\n    scanf(\""%d\"",&R);\n    if(P+Q<R+Q){\n        min=P+Q;\n    }else{\n        min=R+Q;\n    }\n    if(P+R<min){\n        min=P+R;\n    }\n    printf(\""%d\\n\"",min);\n    return 0;\n}",ACCEPTED,30,512
1591695647198470144,05fd79145678de5c06012db9db4333bebf8365a74fe442d12a54a9da3782fdca,2022-11-13 15:33:09,C++,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<iostream>\n#define N 100005\nusing namespace std;\nlong long int jump[N];\nlong long int n;\nlong long int ci = 0;\nlong long int maxScore;\nlong long int Maxhash[N];\nvoid jumps(int index,int num,long long int score){\n\tif(index + num >= n) {\n\t\treturn;\n\t}\n\tscore-=5;\n\tscore+=jump[index+num];\n\tif(ci==0){\n\t\tMaxhash[index+num] = score;\n\t}else if(Maxhash[index+num] < score){\n\t\tMaxhash[index+num] = score;\n\t}else if(Maxhash[index+num] >= score ){\n\t\treturn;\n\t}\n\tjumps(index+num,1,score);\n\tjumps(index+num,3,score);\n}\n\nint main(){\n\tcin >> n;\n\tlong long int max;\n\tlong long int num = 0;\n    for(int i = 0;i<n;i++) {\n        num = num-5+jump[i];\n        cin >>jump[i];\n        Maxhash[i] = num;\n    };\n\tjumps(-1,1,0);\n\tjumps(-1,3,0);\n\n\tcout << Maxhash[n-1];\n\treturn 0;\n}\n",TIME_LIMIT_EXCEEDED,400,1128
1591695670225154048,0ccbaaa612b3d01dbe621ce5e7366d6e26d2e5adf55047d92c6eb7adf78a979d,2022-11-13 15:33:14,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int n,a,b;cin>>n>>a>>b;\n    int x[n],y[n];\n    for(int i=0;i<n;i++) cin>>x[i];\n    for(int i=0;i<n;i++) cin>>y[i];\n    long long int suma=0,sumb=0;\n    for(int i=0;i<n;i++)\n        suma+=(x[i]/(y[i]+1))*pow(a,y[i]+1);\n    for(int i=0;i<n;i++)\n        sumb+=(x[i]/(y[i]+1))*pow(b,y[i]+1);\n    cout<<suma-sumb;\n    return 0;\n}\n",WRONG_ANSWER,10,320
1591695681646256128,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-13 15:33:17,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n#define MAX 10\nint main(){\n    int i,n,a,b,c[MAX],F[MAX],jieguo=0,sum=0;\n    scanf(\""%d\"",&n);\n    scanf(\""%d\"",&a);\n    scanf(\""%d\\n\"",&b);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&c[i]);\n    }\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&F[i]);\n    }\n    if(n%2==0){\n        for(i=0;i<n/2;i++){\n            jieguo=((c[i]/(F[i]+1))*pow(a,F[i]+1))+((c[i+1]/(F[i+1]+1))*pow(a,F[i+1]+1))-((c[i]/(F[i]+1))*pow(b,F[i]+1))+((c[i+1]/(F[i+1]+1))*pow(b,F[i+1]+1));\n            sum=sum+jieguo;\n        }\n    }else{\n        for(i=0;i<n/2;i++){\n            jieguo=((c[i]/(F[i]+1))*pow(a,F[i]+1))+((c[i+1]/(F[i+1]+1))*pow(a,F[i+1]+1))-((c[i]/(F[i]+1))*pow(b,F[i]+1))+((c[i+1]/(F[i+1]+1))*pow(b,F[i+1]+1));\n            sum=sum+jieguo;\n        }\n        sum=sum+((c[i+1]/(F[i+1]+1))*pow(a,F[i+1]+1))+((c[i+1+1]/(F[i+1+1]+1))*pow(a,F[i+1+1]+1));\n    }\n    printf(\""%d\\n\"",sum);\n    return 0;\n}",WRONG_ANSWER,9,204
1591695685374980096,e7e6ce2c6e9e530eaf2b9b9968748a0e44e3ac7183d73deb51851946350bfbb0,2022-11-13 15:33:18,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    int flag=0;\n    int i;\n    int n,h[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++) {\n        scanf(\""%d\"",&h[i]);\n    }\n\n     for(i=0;i<n;i++) {\n        if(h[i]==h[i+1]) {\n            n--;\n        }\n\n\n\n        if(h[i]<h[i-1]&&h[i]<h[i+1]&&h[i+1]!='\\0')\n            flag++;\n\n     }\n\n    printf(\""%d\"",flag);\n    return 0;\n}\n",WRONG_ANSWER,5,208
1591695690722762752,3e087b0a196d30fcbb49ca80164c9eb5adf82ae3bb08ec0c141e5728fb180f0d,2022-11-13 15:33:19,Java,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"import java.util.Scanner;\n\npublic class Pb1 {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner sc=new Scanner(System.in);\n\t\tint i=0,res=0,len;\n\t\tint n=sc.nextInt();\n\t\tsc.nextLine();\n\t\tString str=sc.nextLine();\n\t\tString[] arr=str.split(\""\"");\n\t\tlen=n;\n\t\twhile(i<=len-2){\n\t\t\tif(arr[i].equals(arr[i+1])){\n\t\t\t\ti++;\n\t\t\t}else{\n\t\t\t\tres=res+2;\n\t\t\t\tfor(int j=i;j<len-2;j++){\n\t\t\t\t\tarr[j]=arr[j+2];\n\t\t\t\t}\n\t\t\t\tlen=len-2;\n\t\t\t\ti--;\n\t\t\t}\n\t\t}\n\t\tSystem.out.print(res);\n\t\tsc.close();\n\t}\n}",COMPILE_ERROR,0,0
1591695698243149824,b73a04f1a7af1c2516ca68b38e336912bdf10c4f4bf7bac55e4e0de29dcf3d9d,2022-11-13 15:33:21,C++,300.0,1591610585635213312,1589816514637750272,1049226928954454016,#include<bits/stdc++.h>\n#define N 10005\n#define int long long\n\nusing namespace std;\n\n\nsigned main() {\n\tint count=1;\n\tint res=0;\n\tstack<char> s;\n\t//cin>>count;\n\twhile(count--){\n\t\n\t\t\n\t\tstring p;\n\t\tint n;\n\t\tcin>>n>>p;\n\t\t\n\t\tfor(int i=0;i<n;i++)\n\t\t{\n\t\t\tif(s.empty())\n\t\t\t{\n\t\t\t\ts.push(p[i]);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif(s.top()==p[i])\n\t\t\t\ts.push(p[i]);\n\t\t\telse\n\t\t\t{\n\t\t\t\ts.pop();\n\t\t\t\tres+=2;\n\t\t\t}\n\t\t\t\n\t\t}\n\t\tcout<<res;\n\t}\n\treturn 0;\n}\n,ACCEPTED,44,896
1591695727183847424,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-13 15:33:28,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,def clean(num):\n    for i in range(len(num)-1):\n        if num[i]!=num[i+1]:\n            num.pop(i)\n            num.pop(i)\n            return clean(num)\n    return len(num)\n\nn=int(input())\nb=input()\na=list(b[:n])\nsum=n-clean(a)\nprint(sum)\n,NON_ZERO_EXIT_CODE,135,4752
1591695731013246976,0b693affc66d8d407ff008bd1aaf4f2feb4a615f057943ba4b4ba3163d937dc6,2022-11-13 15:33:29,Java,300.0,1591610585635213315,1591129345182261248,1049226928954454016,"import java.io.*;\nimport java.util.*;\n\npublic class Main {\n\n    public static void main(String[] args) throws IOException {\n        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n        Scanner sc=new Scanner(System.in);\n        String s=br.readLine();\n        //String str=br.readLine();\n        String[] str=br.readLine().split(\"" \"");\n        int n=Integer.parseInt(s);\n        int res=0;\n        int temp=0;\n        int[] nums=new int[n+1];\n        Arrays.fill(nums,Integer.MIN_VALUE);\n        nums[0]=0;\n        for (int i = 1; i <= n; i++) {\n            if (i-1>=0){\n                nums[i]=Math.max(nums[i-1]+Integer.parseInt(str[i-1])-5,nums[i]);\n            }\n            if (i-3>=0)\n                nums[i]=Math.max(nums[i-3]+Integer.parseInt(str[i-1])-5,nums[i]);\n        }\n        System.out.println(nums[n]);\n    }\n}",ACCEPTED,556,26288
1591695733982781440,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-13 15:33:29,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int num;\n    scanf(\""%d\"",&num);\n    int a[num];\n    int area[num];\n    int i,j,max = 0;\n    int temp;\n    for(i = 0;i < num;i++) {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i = 0;i < num;i++) {\n        temp = a[i];\n        for(j = i+1;j < num;j++) {\n            if(a[j]>=temp){\n                a[i] += temp;\n            }else{\n                break;\n            }\n        }\n    }\n    for(i = 0;i<num;i++) {\n        if(max < a[i]) {\n            max = a[i];\n        }\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",WRONG_ANSWER,24,352
1591695761233174528,3e087b0a196d30fcbb49ca80164c9eb5adf82ae3bb08ec0c141e5728fb180f0d,2022-11-13 15:33:36,Java,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner sc=new Scanner(System.in);\n\t\tint i=0,res=0,len;\n\t\tint n=sc.nextInt();\n\t\tsc.nextLine();\n\t\tString str=sc.nextLine();\n\t\tString[] arr=str.split(\""\"");\n\t\tlen=n;\n\t\twhile(i<=len-2){\n\t\t\tif(arr[i].equals(arr[i+1])){\n\t\t\t\ti++;\n\t\t\t}else{\n\t\t\t\tres=res+2;\n\t\t\t\tfor(int j=i;j<len-2;j++){\n\t\t\t\t\tarr[j]=arr[j+2];\n\t\t\t\t}\n\t\t\t\tlen=len-2;\n\t\t\t\ti--;\n\t\t\t}\n\t\t}\n\t\tSystem.out.print(res);\n\t\tsc.close();\n\t}\n}",WRONG_ANSWER,110,24156
1591695791302139904,7c6d208c4c4b695bc8d6f8ae0c0357c2466f5c9f86ec0652674812219ac09d38,2022-11-13 15:33:43,Java,300.0,1591610585635213317,1591130976212869120,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tint[] arr = new int[n];\n\t\tint[] brr = new int[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint q = sc.nextInt();\n\t\t\tarr[i] = q;\n\t\t}\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint t = sc.nextInt();\n\t\t\tbrr[i] = t;\n\t\t}\n\t\tdouble count1 = 0;\n\t\tdouble count2 = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcount1 = count1 + arr[i]*(Math.pow(a, brr[i]+1))/(brr[i]+1);\n\t\t}\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcount2 = count2 + arr[i]*(Math.pow(b, brr[i]+1))/(brr[i]+1);\n\t\t}\n\t\tSystem.out.println((int)(count1-count2));\n\t}\n\n}",ACCEPTED,536,24940
1591695824596557824,7935e8f5cb04027f4d30ac84a997e2d03e946e112c1cb17f1a4f943d8b0b54bf,2022-11-13 15:33:51,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <iostream>\n#include<stdio.h>\n#include<algorithm>\n\nusing namespace std;\n\nint main()\n{\n    int n,i,t,j,m=0;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n    {\n        t=1;\n        for(j=i+1;j<n;j++)\n        {\n            if(a[i]<=a[j])\n                t+=1;\n        }\n        for(j=i-1;j>=0;j--)\n        {\n            if(a[i]<=a[j])\n                t+=1;\n        }\n        m=max(m,a[i]*t);\n    }\n    printf(\""%d\"",m);\n    return 0;\n}\n",WRONG_ANSWER,7,328
1591695836399296512,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-13 15:33:54,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\n#define N 10000\n\n\nint pand(char *a,int i,int n)\n{\n    int b,c;\n    a[i]=a[i+2];\n    a[i+1]=a[i+3];\n    i++;\n    if(i<n) pand(a,i,n);\n    else return 0;\n\n}\n\n\n\n\n\n\nint main()\n{\n    char a[10000];\n    int n,i,j,k,l,zq;\n    j=0;\n    scanf(\""%d\"",&n);\n    scanf(\""%s\"",&a);\n    a[n]='\\0';\n    for(l=0;l<n;l++){\n        if(a[l]=='0'||a[l]=='1') zq=1;\n        else {zq=0;\n             break;}\n        //printf(\""%d\"",zq);\n    }\n    //printf(\""%d\"",zq);\n    if(zq==1){\n    for(l=0;l<n;l++){\n    for(i=0;i<n;i++)\n    {\n        //if(i=0&&a[0]!=a[1]) a[0]=a[2];\n        //a[1]=a[]\n        \n        k=i;\n        if(i>=0&&a[i]!=a[i+1]&&(a[i]=='1'||a[i]=='0')&&i<n-1&&(a[i+1]=='1'||a[i+1]=='0'))\n            {\n//printf(\""%s\\n,n=%d\\n\"",a,n);\n            if(n>0){\n            pand(a,i,n);\n            n-=2;\n            j+=2;\n            }\n\n            }\n\n    }\n    }//printf(\""!%s\"",a);\n\nprintf(\""%d\\n\"",j);\n\n    }\n\n\n\n    return 0;\n}",WRONG_ANSWER,9,348
1591695836655181824,d830b0bcae7881ad6d1b2e2b14f3ffa3695b6d3bd622856493fa1cf903c9bf4e,2022-11-13 15:33:54,Java,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint a= sc.nextInt();\n\t\tint b =sc.nextInt();\n\t\tint[] arr1 = new int[n];\n\t\tint[] arr2 = new int[n];\n\t\tfor(int i =0;i< arr1.length;i++){\n\t\t\t\tarr1[i]=sc.nextInt();\n\t\t\t\n\t\t}\n\t\tfor(int i =0;i< arr2.length;i++){\n\t\t\tarr2[i]=sc.nextInt();\n\t\t\n\t\t}\n\t\tint res1=0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tres1+=(arr1[i]/(arr2[i]+1))*((int)Math.pow(a, arr2[i]+1));\n\t\t}\n\t\tint res2=0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tif(b==0){\n\t\t\t\tres2=0;\n\t\t\t\t\t\t}\n\t\t\telse{\n\t\t\tres2+=(arr1[i]/(arr2[i]+1))*((int)Math.pow(b, arr2[i]+1));\n\t\t\t}\n\t\t}\n\t\tint res=res1-res2;\n\t\tSystem.out.print(res);\n\t}\n}",WRONG_ANSWER,109,24356
1591695857769263104,e715137eeb4190ade2330123b989bbdd6eebd9a5e1df2e292271d3bfe3a79c69,2022-11-13 15:33:59,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint a[1000000]={0},d[1000000];\nint main()\n{\n    int i,j=0,k=1,n,b=0,c=1,w=0;\n    scanf(\""%d\"",&n);\n    k=n;\n    for(i=1;i<=n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=1;j<n;j++)\n    {\n        k=1;\n        w=0;\n        \n   for(i=j;i<=n;i++)\n    {\n       \n       \n       \n       if(a[i]<a[j])\n       {\n           d[b]=w;\n           b++;\n           k=0;\n           break;\n       }  \n       w+=a[j];\n    }\n        if(k)\n        {\n            d[b]=w;\n           b++;\n        }\n    }\n    w=d[0];\n    for(i=0;i<b;i++)\n    {\n        if(w<d[i])\n            w=d[i];\n    }\n    printf(\""%d\"",w);\n    return 0;\n        \n}",WRONG_ANSWER,14,204
1591695896696610816,28b4de6882b7ade2679f59c486acaf307ce8415dcb0a15787dba589025bbdb02,2022-11-13 15:34:08,C++,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint n,i,j,k=0;\n\tscanf(\""%d\"",&n);\n\tgetchar();\n\tchar num[n+1];\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%c\"",&num[i]);\n\t}\n    \n\tfor(i=0,j=1;j<n;)\n\t{\n        if(num[i]!=num[j]&&i!=0)\n        {\n            k=k+2;\n            i=i-1;\n            j=j+1;\n        }\n        else if(num[i]!=num[j]&&i==0)\n        {\n            k=k+2;\n            j++;\n            i=j;\n            j++;\n        }\n        else\n        {\n            i=j;\n            j++;\n        }\n\t\t\n\t}\n\tprintf(\""%d\\n\"",k);\n\treturn 0;\n}",WRONG_ANSWER,5,384
1591695949775560704,40c43472973ea298adbdd1d4b900aeb63cfa4cfe17179f01a4827cd2c6624d3a,2022-11-13 15:34:21,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nmain()\n{\n    int n;\n    int h[20];\n    int i;\n    int t=0;\n    scanf(\""%d\"",&n);\n    if(n>=3)\n    {\n        for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&h[i]);\n    }\n    for(i=0;i<n-2;i++)\n    {\n        if(h[i]>h[i+1])\n            t++;\n    }\n    }\n    printf(\""%d\"",t);\n}",WRONG_ANSWER,4,196
1591695973750169600,64475a8ecd7d5a6c6e734f3f299283e039c26933b2a0e510cd9d22e95ba92068,2022-11-13 15:34:27,C++,0.0,1591610585635213314,1591128862958940160,1049226928954454016,"#include <bits/stdc++.h> \nusing namespace std;\n\nint n,ans = 0;\nint f[100010],a[1000010],b[1000010];\n\n\nint find(int x)\n{\n\tif(x==f[x])return x;\n\treturn f[x] = find(f[x]);\t\n}\n\nint main()\n{\n\tcin>>n;\n\t\n\tfor(int i = 1; i <= n; i++)\n\t\tf[i] = i;\n\t\n\tfor(int i = 2; i <= n; i++)\n\t{\n\t\t\n\t\tcin>>a[i];\n\t\tf[find(i)] = find(a[i]);  \n\t}\n\t\n\tcout<<5<<\"" \"";\n\t\n\tfor(int i = 2; i <= n; i++)\n\t{\n\t\tfor(int j = 2; j <= n; j++)\n\t\t{\n\t\t\tif(find(i) == find(j))\n\t\t\tans++;\n\t\t}\n\t\tcout<<ans<<\"" \"";\n\t\tans = 0;\n\t}\n\t\n\treturn 0;\n}",WRONG_ANSWER,28,840
1591696016876036096,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-13 15:34:37,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main (){\n    int n,a,b,i,sum=0;;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    int c[n],f[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&f[i]);\n    for(i=0;i<n;i++){\n   sum+=(c[i]/(f[i]+1))*pow(a,f[i]+1)-(c[i]/(f[i]+1))*pow(b,f[i]+1);\n    }\n      \n          printf(\""%d\\n\"",sum);\n}",WRONG_ANSWER,11,456
1591696020424372224,b73a04f1a7af1c2516ca68b38e336912bdf10c4f4bf7bac55e4e0de29dcf3d9d,2022-11-13 15:34:38,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<bits/stdc++.h>\n#define N 100005\n#define endl '\\n'\n#define int long long\n#define ios ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)\n\n//const int dir[4][2]={-1,0,0,1,1,0,0,-1};\n//const int mod=1e9+7;\nusing namespace std;\n\ninline int read() {\n    char c = getchar(); int num = 0, sign = 1;\n    while(c < '0' || c > '9') {if(c == '-') sign = -1; c = getchar();}\n    while(c >= '0' && c <= '9') num = num * 10 + c - '0', c = getchar();\n    return num * sign;\n}\n\nvoid solve(){\n\tint nums[N][2];\n\tint res=0;\n\tint n,shang,xia;\n\tcin>>n>>shang>>xia;\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tcin>>nums[i][0];\n\t}\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tcin>>nums[i][1];\n\t}\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tif(nums[i][1]+1==0)\n\t\t{\n\t\t\tcontinue;\n\t\t } \n\t\tint t=pow(shang,nums[i][1]+1)-pow(xia,nums[i][1]+1);\n\t\tres+=t*nums[i][0]/(nums[i][1]+1);\n\t}\n\tcout<<res;\n}\n\nsigned main() {\n\tios;\n\tint count=1;\n\t//cin>>count;\n\twhile(count--)\n\t{\n\t\tsolve();\n\t}\n\treturn 0;\n}\n",WRONG_ANSWER,8,860
1591696059481743360,e715137eeb4190ade2330123b989bbdd6eebd9a5e1df2e292271d3bfe3a79c69,2022-11-13 15:34:47,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint a[1000000]={0},d[1000000];\nint main()\n{\n    int i,j=0,k=1,n,b=0,c=1,w=0;\n    scanf(\""%d\"",&n);\n    k=n;\n    for(i=1;i<=n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=1;j<n;j++)\n    {\n        k=1;\n        w=0;\n        \n   for(i=j;i<=n;i++)\n    {\n       \n       \n       \n       if(a[i]<a[j])\n       {\n           d[b]=w;\n           b++;\n           k=0;\n           break;\n       }  \n       w+=a[j];\n    }\n        if(k)\n        {\n            d[b]=w;\n           b++;\n        }\n    }\n    w=d[0];\n    for(i=0;i<b;i++)\n    {\n        if(w<d[i])\n            w=d[i];\n    }\n    printf(\""%d\\n\"",w);\n    return 0;\n        \n}",WRONG_ANSWER,23,348
1591696081896091648,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 15:34:52,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int n,a,b;\n    int sum=0;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    int c[n],f[n];\n    int i;\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&c[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&f[i]);\n    }\n     for(i=0;i<n;i++)\n              {\n         if(a==b)\n             sum=0;\n         else\n                  sum+=c[i]/(f[i]+1)*pow(a,(f[i]+1))-c[i]/(f[i]+1)*pow(b,(f[i]+1));\n              }\n              printf(\""%d\"",sum);\n              return 0;\n}",WRONG_ANSWER,17,508
1591696091505254400,458af3c005e0b282d1ca88c254d9910ee2d93738b6f06d399f7444e1e64831eb,2022-11-13 15:34:55,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int i,j,n,max,q=0;\n    scanf(\""%d\"",&n);\n    int a[n];\n    getchar();\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n        getchar();\n    }\n    for(j=0;j<n;){\n        max=a[j];\n        i=j;\n        if(a[i+2]>max){\n            max=a[i+2];\n            j=i+3;\n        }\n        else j++;\n        q=q+max-5;\n    }\n    printf(\""%d\"",q);\n    return 0;\n}\n\n",WRONG_ANSWER,7,328
1591696111784701952,7935e8f5cb04027f4d30ac84a997e2d03e946e112c1cb17f1a4f943d8b0b54bf,2022-11-13 15:34:59,C++,300.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <iostream>\n#include<stdio.h>\n#include<algorithm>\n\nusing namespace std;\n\nint main()\n{\n    int n,i,t,j,m=0;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n    {\n        t=1;\n        for(j=i+1;j<n;j++)\n        {\n            if(a[i]<=a[j])\n                t+=1;\n                else break;\n        }\n        for(j=i-1;j>=0;j--)\n        {\n            if(a[i]<=a[j])\n                t+=1;\n                else break;\n        }\n        m=max(m,a[i]*t);\n    }\n    printf(\""%d\"",m);\n    return 0;\n}\n",ACCEPTED,49,472
1591696195352014848,864c0dc14d6d917707294bc7e18ea53a2c0536c5d47f3d25f94f0188f106014f,2022-11-13 15:35:19,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\n int main()\n{\n    int n,i;\n    scanf(\""%d\"",&n);\n     char a[n];\n    for(i=0;i<=n;i++){\n        scanf(\""%c\"",&a[i]);\n    }\n     int j=0,count=0;\n        for(j=0;j<n ; j++){\n         if((a[j]=='0'&&a[j+1]=='0')||(a[j]=='1'&&a[j+1]=='1')){\n             count=count+2;\n            a[j]=a[j+2];\n\n        }\n    }\n    printf(\""%d\"",count);\n    return 0;\n}\n\n\n\n",WRONG_ANSWER,11,224
1591696196174143488,0ccbaaa612b3d01dbe621ce5e7366d6e26d2e5adf55047d92c6eb7adf78a979d,2022-11-13 15:35:20,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int n,a,b;cin>>n>>a>>b;\n    int x[n],y[n];\n    for(int i=0;i<n;i++) cin>>x[i];\n    for(int i=0;i<n;i++) cin>>y[i];\n    double suma=0,sumb=0;\n    for(int i=0;i<n;i++)\n        suma+=(x[i]/(y[i]+1))*pow(a,y[i]+1);\n    for(int i=0;i<n;i++)\n        sumb+=(x[i]/(y[i]+1))*pow(b,y[i]+1);\n    cout<<suma-sumb;\n    return 0;\n}\n",WRONG_ANSWER,9,332
1591696200527831040,6ba5ecacf3381a1e9382f99c413290eca40a071a563a618e5f36d66cbf9a5e1b,2022-11-13 15:35:21,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<iostream>\n\nusing namespace std;\n\nint main(){\nint n;\nint flag=3;\nlong imax=0,sum=0;\ncin>>n;\nlong h[n];\nfor(int i=0;i<n;i++){\n    cin>>h[i];\n}\n\nfor(int i=0;i<n;i++)\n{\n    for(int j=i;j<n;j++){\n        if(h[j]>=h[i])\n            flag=1;\n        else\n            flag=0;\n        if(flag==0){\n        sum=h[i]*(j-i);\n       // cout<<sum<<endl;\n        if(imax<sum)\n            imax=sum;\n        break;\n        }\n        if(flag==1 && j==n-1){\n            sum=h[i]*(j-i+1);\n           // cout<<sum<<endl;\n        if(imax<sum)\n            imax=sum;\n        break;\n        }\n    }\n}\nfor(int i=n-1;i>=0;i--)\n{\n    for(int j=i;j>=0;j--){\n        if(h[j]>=h[i])\n            flag=1;\n        else\n            flag=0;\n        if(flag==0){\n        sum=h[i]*(i-j);\n        //cout<<sum<<endl;\n        if(imax<sum)\n            imax=sum;\n        break;\n        }\n        if(flag==1 && j==0){\n            sum=h[i]*(i-j+1);\n          //  cout<<sum<<endl;\n        if(imax<sum)\n            imax=sum;\n        break;\n        }\n    }\n}\ncout<<imax<<endl;\n}\n",WRONG_ANSWER,36,500
1591696298548682752,e51465ce72346fac918042a342986433269a159492161f223a180a6e05d9a01a,2022-11-13 15:35:44,Java,0.0,1591610585639407617,1591132482555211776,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n\t\npublic static void main(String[] args) {\n\t    Scanner sc =new Scanner(System.in);\n\t    int num  =sc.nextInt();\n\t    int index=0;\n\t    int max = 0;\n\t    int result=0;\n\t    int s=0;\n\t    int [] arr=new int [num];\n\t    for(int i=0;i<num;i++){\n\t    \tarr[i]=sc.nextInt();\n\t    \t if(arr[i]>max){\n\t    \t\t max=arr[i];\n\t    \t }\t    \t  \n\t    }\n\t    \n\t    for(int i=0;i<=max;i++){\n\t    \t    index=0;\n\t    \tfor(int j=0;j<arr.length;j++){\n\t    \t\tif(arr[j]>=i){\n\t    \t\t\tindex++;\n\t    \t\t}\n\t    \t\t\n\t    \t}\n\t    \ts=index*i;\n    \t\t\n\t    \tif(s>result){\n\t    \t\tresult=s;\n\t    \t}\n\t    }\n\t    System.out.println(result);\n\t    \n}\n},WRONG_ANSWER,114,24684
1591696355297615872,40c43472973ea298adbdd1d4b900aeb63cfa4cfe17179f01a4827cd2c6624d3a,2022-11-13 15:35:58,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nmain()\n{\n    int n;\n    int h[20];\n    int i;\n    int t=0;\n    scanf(\""%d\"",&n);\n    if(n>=3&&n<=10000)\n    {\n        for(i=0;i<n;i++)\n        scanf(\""%d\"",&h[i]);\n    for(i=0;i<n-2;i++)\n    {\n        if(h[i]>h[i+1])\n            t++;\n    }\n     printf(\""%d\"",t);\n    }\n}",WRONG_ANSWER,10,616
1591696379213537280,d830b0bcae7881ad6d1b2e2b14f3ffa3695b6d3bd622856493fa1cf903c9bf4e,2022-11-13 15:36:03,Java,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint a= sc.nextInt();\n\t\tint b =sc.nextInt();\n\t\tint[] arr1 = new int[n];\n\t\tint[] arr2 = new int[n];\n\t\tfor(int i =0;i< arr1.length;i++){\n\t\t\t\tarr1[i]=sc.nextInt();\n\t\t\t\n\t\t}\n\t\tfor(int i =0;i< arr2.length;i++){\n\t\t\tarr2[i]=sc.nextInt();\n\t\t\n\t\t}\n\t\tint res1=0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tres1+=(arr1[i]/(arr2[i]+1))*(Math.pow(a, arr2[i]+1));\n\t\t}\n\t\tint res2=0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tif(b==0){\n\t\t\t\tres2=0;\n\t\t\t\t\t\t}\n\t\t\telse{\n\t\t\tres2+=(arr1[i]/(arr2[i]+1))*(Math.pow(b, arr2[i]+1));\n\t\t\t}\n\t\t}\n\t\tint res=res1-res2;\n\t\tSystem.out.print(res);\n\t}\n}",WRONG_ANSWER,119,24648
1591696427267678208,e715137eeb4190ade2330123b989bbdd6eebd9a5e1df2e292271d3bfe3a79c69,2022-11-13 15:36:15,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint a[1000000]={0},d[1000000];\nint main()\n{\n    int i,j=0,k=1,n,b=0,c=1,w=0;\n    scanf(\""%d\"",&n);\n    k=n;\n    for(i=1;i<=n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=1;j<=n;j++)\n    {\n        k=1;\n        w=0;\n        \n   for(i=j;i<=n;i++)\n    {\n       \n       \n       \n       if(a[i]<a[j])\n       {\n           d[b]=w;\n           b++;\n           k=0;\n           break;\n       }  \n       w+=a[j];\n    }\n        if(k)\n        {\n            d[b]=w;\n           b++;\n        }\n        printf(\""%d\\n\"",w);\n    }\n    w=d[0];\n    for(i=0;i<b;i++)\n    {\n        if(w<d[i])\n            w=d[i];\n    }\n    printf(\""%d\\n\"",w);\n    return 0;\n        \n}",WRONG_ANSWER,5,352
1591696476399788032,0d24b4ee85e6e3a4cc694f7e11105fa2aaf93fd10d4cbe81657f252e2d675435,2022-11-13 15:36:26,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int num;\n    int i=0,t=0;\n    int arr[1000];\n    scanf(\""%d\"",&num);\n    while(i<num){\n        scanf(\""%d\"",&t);\n      arr[i++] = t;\n    }\n    int j,s,sum=0;\n    for(j=1,s=1;j<num;j++,s++){\n        if(s<num)\n            break;\n     if(arr[j]!=arr[j+s]||arr[j]!=arr[j-s])\n        if(arr[j]<arr[j-1]&&arr[j]<arr[j+1])\n            sum++;\n    else if(arr[j]<arr[j-s]&&arr[j]<arr[j+s])\n           sum++;\n    }\n\nprintf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,5,196
1591696477267963904,864c0dc14d6d917707294bc7e18ea53a2c0536c5d47f3d25f94f0188f106014f,2022-11-13 15:36:27,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\n int main()\n{\n    int n,i;\n    scanf(\""%d\"",&n);\n     char a[n];\n    for(i=0;i<=n;i++){\n        scanf(\""%c\"",&a[i]);\n    }\n     int j=0,count=0;\n        for(j=0;j<strlen(a); j++){\n         if((a[j]=='0'&&a[j+1]=='0')||(a[j]=='1'&&a[j+1]=='1')){\n             count=count+2;\n            a[j]=a[j+2];\n\n        }\n    }\n    printf(\""%d\"",count);\n    return 0;\n}\n\n\n\n",WRONG_ANSWER,9,200
1591696484545126400,d4c94290401b65ee2ce02056ca325b624120f06a8f67557b729453a418b199fe,2022-11-13 15:36:28,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<bits/stdc++.h>\nconst int N = 1e6;\nint a[N];\n\nint main(){\n    int n,ans = 0;std::cin >> n;\n    for(int i = 1;i <= n;i++)std::cin >> a[i];\n    for(int i = 2;i < n;i++)if(a[i] < a[i+1])ans++;\n    std::cout << ans << '\\n';\n}",WRONG_ANSWER,9,312
1591696522176421888,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 15:36:37,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int n,a,b;\n    int sum=0;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    int c[n],f[n];\n    int i;\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&c[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&f[i]);\n    }\n     for(i=0;i<n;i++)\n              {\n         if(a==b)\n             sum=0;\n         else\n                  sum+=c[i]/(f[i]+1)*pow(a,(f[i]+1))-c[i]/(f[i]+1)*pow(b,(f[i]+1));\n              }\n              printf(\""%d\"",sum);\n              return 0;\n}",WRONG_ANSWER,6,200
1591696581018279936,d9e00d995e65b04cda3ddef6baec19225e4351002ab4efa981f62d78919a481b,2022-11-13 15:36:51,C++,300.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int a,b,n;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    int c[n],F[n];\n    int i;\n    for(i=0;i<n;i++) scanf(\""%d\"",&c[i]);\n    for(i=0;i<n;i++) scanf(\""%d\"",&F[i]);\n    int sum=0;\n    int s=0,s1=0,s2=0;\n    for(i=0;i<n;i++)\n    {\n        s1 = c[i]*pow(a,F[i]+1)/(F[i]+1);\n        s2 = c[i]*pow(b,F[i]+1)/(F[i]+1);\n        s=s1-s2;\n        sum+=s;\n//         sum += (c[i] *(int) pow(a,F[i]+1) - c[i] * (int)pow(b,F[i]+1) )/ (F[i]+1) ;\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}\n",ACCEPTED,35,388
1591696587607531520,5bd1a8718ea7fb820055421c67b8e0a468e08d951f729a24e55bf407b3bdb1f6,2022-11-13 15:36:53,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <iostream>\n#include <algorithm>\n#include <vector>\nusing namespace std;\nint main()\n{\n\n    int n;\n    cin>>n;\n    vector<int> height(n);\n    for(int i=0;i<n;i++){\n        cin>>height[i];\n    }\n    int i=0,j=height.size()-1;\n    int result=0;\n    while(i<j){\n            int area=(j-i)*min(height[i],height[j]*(j-1));\n            result=max(result,area);\n        if(height[i]<height[j])\n            ++i;\n        else\n            --j;\n    }\n    if(n!=1)\n    cout<<result;\n    else\n        cout<<height[0];\n\n    return 0;\n}\n",WRONG_ANSWER,7,480
1591696620801286144,0354b067c4132d4425a90b77482ac717447702274cb7db1282edce56eaf037b3,2022-11-13 15:37:01,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n,a,b,x,y,m,t,ans,A,A1,B,B1,i;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    scanf(\""%d %d\"",&x,&y);\n    scanf(\""%d %d\"",&m,&t);\n    A=A1=B=B1=1;\n    for(i=0;i<=m;i++)\n       A=a*A;\n    for(i=0;i<=t;i++)\n       A1=a*A1;\n    for(i=0;i<=m;i++)\n       B=b*B;\n    for(i=0;i<=t;i++)\n       B1=b*B1;\n    ans=(x/(m+1))*(A-B)+(y/(t+1))*(A1-B1);\n    printf(\""%d\"",ans);\n    return 0;\n} ",WRONG_ANSWER,10,336
1591696631257653248,07d925df8d2026d3171a0a2ca84a6ef7f4a5b47a584cf47b66c5dd8f28139d1f,2022-11-13 15:37:03,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a[10000],area,n,i,j,h,t;\n    area=0;\n    scanf(\""%d\"",&n);\n    for (i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n        h=a[i];\n        t=0;\n        for(j=i;j<n;j++){\n            if(h>a[j])\n                h=a[j];\n            t=(j-i+1)*h;\n            if(t>area)\n                area=t;\n        }\n    }\n    printf(\""%d\\n\"",area);\n    return 0;\n}\n\n",WRONG_ANSWER,8,348
1591696693014585344,0d24b4ee85e6e3a4cc694f7e11105fa2aaf93fd10d4cbe81657f252e2d675435,2022-11-13 15:37:18,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int num;\n    int i=0,t=0;\n    int arr[1000];\n    scanf(\""%d\"",&num);\n    while(i<num){\n        scanf(\""%d\"",&t);\n      arr[i++] = t;\n    }\n    int j,s,sum=0;\n    for(j=1,s=1;j<num;j++,s++){\n        if(s<num)\n            break;\n     if((arr[j]!=arr[j+s])|(|arr[j]!=arr[j-s]))\n        if(arr[j]<arr[j-1]&&arr[j]<arr[j+1])\n            sum++;\n    else if(arr[j]<arr[j-s]&&arr[j]<arr[j+s])\n           sum++;\n    }\n\nprintf(\""%d\"",sum);\n    return 0;\n}",COMPILE_ERROR,0,0
1591696755270627328,0d24b4ee85e6e3a4cc694f7e11105fa2aaf93fd10d4cbe81657f252e2d675435,2022-11-13 15:37:33,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int num;\n    int i=0,t=0;\n    int arr[1000];\n    scanf(\""%d\"",&num);\n    while(i<num){\n        scanf(\""%d\"",&t);\n      arr[i++] = t;\n    }\n    int j,s,sum=0;\n    for(j=1,s=1;j<num;j++,s++){\n        if(s<num)\n            break;\n     if((arr[j]!=arr[j+s])||(arr[j]!=arr[j-s]))\n        if(arr[j]<arr[j-1]&&arr[j]<arr[j+1])\n            sum++;\n    else if(arr[j]<arr[j-s]&&arr[j]<arr[j+s])\n           sum++;\n    }\n\nprintf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,5,324
1591696825269379072,40c43472973ea298adbdd1d4b900aeb63cfa4cfe17179f01a4827cd2c6624d3a,2022-11-13 15:37:50,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int n;\n    int h[20];\n    int i;\n    int t=0;\n    scanf(\""%d\"",&n);\n    if(n>=3&&n<=10000)\n    {\n        for(i=0;i<n;i++)\n        scanf(\""%d\"",&h[i]);\n    for(i=0;i<n-2;i++)\n    {\n        if(h[i]>h[i+1])\n            t++;\n    }\n     printf(\""%d\"",t);\n    }\n}",WRONG_ANSWER,5,492
1591696887605112832,281adcca8943f9f4c0ced14f1ceffe157a34fca39f3cb864eb95e400944e38a8,2022-11-13 15:38:04,Java,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner scan=new Scanner(System.in);\n\t\tint n=scan.nextInt();\n\t\tint[] arr=new int[n];\n\t\tint s=0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tarr[i]=scan.nextInt();\n\t\t}\n\t\tint max=0;\n\t\tint len=0;\n\t\tfor(int i=1;i<n;i++){\n\t\t\tint h=arr[i];\n\t\t\tfor(int j=i;j<n-1;j++){\n\t\t\t\tif(h>arr[j]){\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tlen++;\n\t\t\t\ts=len*h;\n\t\t\t}\n\t\t\tmax=Math.max(s, max);\n\t\t\ts=0;\n\t\t\tlen=0;\n\t\t}\n\t\tSystem.out.println(max);\n\t}\n}\n",WRONG_ANSWER,228,24820
1591696893108084736,06b00897262b024d9e66dcd771cf81de9b63954f7a4554699d17c2158114c0d1,2022-11-13 15:38:06,C,300.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n        int n;\n        scanf(\""%d\"",&n);\n\t\tchar ch[n];\n\t\tscanf(\""%s\"",ch);\n\t\tint x=0,y=0,t;\n\t\tint i=0;\n        for(i=0;i<n;i++){\n            if(ch[i]=='0'){\n                x=x+1;\n            }else{\n            y=y+1;\n            }\n        }\n        if(x>=y){\n            t=x-y;\n        }else{\n        t=y-x;\n        }\n        printf(\""%d\"",n-t);\n    return 0;\n}\n",ACCEPTED,42,628
1591696927463583744,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 15:38:14,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int n,a,b;\n    int sum=0;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    int c[n],f[n];\n    int i;\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&c[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&f[i]);\n    }\n     for(i=0;i<n;i++)\n              {\n         s1=c[i]/(f[i]+1)*pow(a,(f[i]+1))\n             s2=c[i]/(f[i]+1)*pow(b,(f[i]+1))\n             s=s1-s2;\n                  sum+=s;\n              }\n              printf(\""%d\"",sum);\n              return 0;\n}",COMPILE_ERROR,0,0
1591696979317776384,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 15:38:26,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int n,a,b;\n    int s,s1,s2;\n    int sum=0;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    int c[n],f[n];\n    int i;\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&c[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&f[i]);\n    }\n     for(i=0;i<n;i++)\n              {\n         s1=c[i]/(f[i]+1)*pow(a,(f[i]+1))\n             s2=c[i]/(f[i]+1)*pow(b,(f[i]+1))\n             s=s1-s2;\n                  sum+=s;\n              }\n              printf(\""%d\"",sum);\n              return 0;\n}",COMPILE_ERROR,0,0
1591697024108781568,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 15:38:37,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int n,a,b;\n    int s,s1,s2;\n    int sum=0;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    int c[n],f[n];\n    int i;\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&c[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&f[i]);\n    }\n     for(i=0;i<n;i++)\n              {\n         s1=c[i]/(f[i]+1)*pow(a,(f[i]+1));\n             s2=c[i]/(f[i]+1)*pow(b,(f[i]+1));\n             s=s1-s2;\n                  sum+=s;\n              }\n              printf(\""%d\"",sum);\n              return 0;\n}",WRONG_ANSWER,6,340
1591697153805049856,e7e6ce2c6e9e530eaf2b9b9968748a0e44e3ac7183d73deb51851946350bfbb0,2022-11-13 15:39:08,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    int flag=0;\n    int i;\n    int n,h[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++) {\n        scanf(\""%d\"",&h[i]);\n    }\n\n     for(i=0;i<n;i++) {\n        if(h[i]==h[i+1]) {\n           i++;\n           break;\n        }\n\n\n\n        if(h[i]<h[i-1]&&h[i]<h[i+1]&&h[i+1]!='\\0')\n            flag++;\n\n     }\n\n    printf(\""%d\"",flag);\n    return 0;\n}\n",WRONG_ANSWER,9,476
1591697157441478656,0d24b4ee85e6e3a4cc694f7e11105fa2aaf93fd10d4cbe81657f252e2d675435,2022-11-13 15:39:09,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int num;\n    int i=0,t=0;\n    int arr[1000];\n    scanf(\""%d\"",&num);\n    while(i<num){\n        scanf(\""%d\"",&t);\n      arr[i++] = t;\n    }\n    int j,s,sum=0;\n    for(j=1,s=1;j<num,s<num;j++,s++){\n     if(arr[j]!=arr[j+s]||arr[j]!=arr[j-s])\n        if(arr[j]<arr[j-1]&&arr[j]<arr[j+1])\n            sum++;\n    else if(arr[j]<arr[j-s]&&arr[j]<arr[j+s])\n           sum++;\n    }\n\nprintf(\""%d\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,61,512
1591697196855341056,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-13 15:39:18,C,300.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int n,a,b;\n    int s,s1,s2;\n    int sum=0;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    int c[n],f[n];\n    int i;\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&c[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&f[i]);\n    }\n     for(i=0;i<n;i++)\n              {\n             s1=c[i]*pow(a,(f[i]+1))/(f[i]+1);\n             s2=c[i]*pow(b,(f[i]+1))/(f[i]+1);\n             s=s1-s2;\n                  sum+=s;\n              }\n              printf(\""%d\"",sum);\n              return 0;\n}",ACCEPTED,61,512
1591697261862903808,d4c94290401b65ee2ce02056ca325b624120f06a8f67557b729453a418b199fe,2022-11-13 15:39:34,C++,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<bits/stdc++.h>\nconst int N = 1e6;\nint a[N];\n\nint main(){\n    int n,ans = 0;std::cin >> n;\n    for(int i = 1;i <= n;i++)std::cin >> a[i];\n    int cnt = 0;\n    for(int i = 2;i < n;i++){\n        if(a[i]< a[i-1])cnt = 1;\n        if(a[i] < a[i+1] and cnt)ans++,cnt = 0;\n    }\n    std::cout << ans << '\\n';\n}",ACCEPTED,56,640
1591697301494837248,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 15:39:43,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <string.h>\nint main()\n{\n    int k,len,i,g=0,l=0;\n    char str[50];\n    scanf(\""%d\"",&k);\n    scanf(\""%s\"",str);\n    len  = strlen(str);\n    for(i=0;i<=len;i++)\n    {\n        if(str[i]=='0')\n        g++;\n        else\n        l++;\n    }\n    if(g>=l)\n    printf(\""%d\\n\"",2*l);\n    else\n    printf(\""%d\\n\"",2*g);\n    return 0;\n}\n\n",SEGMENTATION_FAULT,33,356
1591697323598864384,5a1c17b308a3b3595833d34c6bdfb75e9f5dd0d065acfeb7f28ab8102ba7406c,2022-11-13 15:39:48,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int n,i,j;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=1;i<n;i++){\n        for(j=0;j<n-i;j++){\n            if(a[j]>a[j+1]){\n                int temp = a[j];\n                a[j] = a[j+1];\n                a[j+1] = temp;\n            }\n        }\n    }\n    int b;\n    int k = n;\n    int sum = 0;\n    for(i=0;i<n;i++){\n        b = a[i]*k;\n        if(b>sum){\n            sum = b;\n        }\n        k--;\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,11,200
1591697342104133632,458af3c005e0b282d1ca88c254d9910ee2d93738b6f06d399f7444e1e64831eb,2022-11-13 15:39:53,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,q,i;\n    q=0;\n    scanf(\""%d\"",&a);\n    int b[100000];\n    for(i=1;i<=a;i++){\n        scanf(\""%d\"",&b[i]);\n    }\n    if(a==3){\n                if(b[1]>=5) q=q+b[1]+b[2]+b[3]-15;\n                else q=q+b[3]-5;\n            }\n    if(a==2) q=q+b[1]+b[2]-10;\n    if(a==1) q=q+b[1]-5;\n    for(i=0;i<=a;){\n            b[0]=0;\n            if(a>3) {\n            if((a-i)>=3){\n                if(b[i+1]>=5){\n                    q=q+b[i+1]-5;\n                    i++;\n                }\n                if(b[i+1]<5){\n                    q=q+b[i+3]-5;\n                    i=i+3;\n                    }\n                    }\n            else\n            {\n                q=q+b[i+1]-5;\n                i++;\n            }\n            }\n    }\n\n    if(a>3) q=q+5;\n    printf(\""%d\"",q);\n    return 0;\n}\n",WRONG_ANSWER,6,324
1591697458793832448,0ccbaaa612b3d01dbe621ce5e7366d6e26d2e5adf55047d92c6eb7adf78a979d,2022-11-13 15:40:21,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int n,a,b;cin>>n>>a>>b;\n    int x[n],y[n];\n    for(int i=0;i<n;i++) cin>>x[i];\n    for(int i=0;i<n;i++) cin>>y[i];\n    double suma=0,sumb=0;\n    for(int i=0;i<n;i++)\n        suma+=(x[i]/(y[i]+1))*pow(a,y[i]+1);\n    for(int i=0;i<n;i++)\n        sumb+=(x[i]/(y[i]+1))*pow(b,y[i]+1);\n    int s = int((suma-sumb)+0.5);\n    printf(\""%d\"",s);\n    return 0;\n}\n",WRONG_ANSWER,13,476
1591697471016034304,6933dcb3592e2d6f6fc887ed9a5537aab21a30f76450c9b5043f7776bfc39a59,2022-11-13 15:40:24,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nvoid main(){\n    int n,a,b,ra=0,rb=0,r;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    int c[n];\n    int f[n];\n    for(int i=0;i<n;i++){\n        scanf(\""%d\"",&c[i]);\n    }\n    for(int i=0;i<n;i++){\n        scanf(\""%d\"",&f[i]);\n    }\n    for(int i=0;i<n;i++){\n        ra=ra+(c[i]/(f[i]+1))*pow(a,(f[i]+1));\n    }\n    for(int i=0;i<n;i++){\n        rb=rb+(c[i]/(f[i]+1))*pow(b,(f[i]+1));\n    }\n    r=ra-rb;\n    printf(\""%d\"",r);\n}",WRONG_ANSWER,6,368
1591697478628728832,17759f531671f838bf3fae4270190e93b6109026f9503f986c1ed85bb412007d,2022-11-13 15:40:25,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int i,n,a,b,c[30000],F[30000],sum,sum1=0,sum2=0;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&F[i]);\n    for(i=0;i<n;i++)\n    {\n        sum1=sum1+(c[i]/(F[i]+1))*(pow(a,(F[i]+1)));\n        sum2=sum2+(c[i]/(F[i]+1))*(pow(b,(F[i]+1)));\n    }\n    sum=sum1-sum2;\n    printf(\""%d\"",sum);\n}",WRONG_ANSWER,9,196
1591697550162583552,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-13 15:40:42,Java,0.0,1591610585635213319,1591131955016622080,1049226928954454016,"import java.util.Scanner;\npublic class Main {\n    public static void main(String []args) {\n        Scanner scanner=new Scanner(System.in); \n        int n,b;\n        int a[]=new int[10000];\n        int key =0;\n        int qie=0;\n        n=scanner.nextInt();\n        for(int i=0;i<n;i++){\n            a[i]=scanner.nextInt();\n        }\n        for(int i=1;i<n;i++){\n            for(int j=i;j<n;j++){\n                if(a[j]<a[j-1])\n                {\n                    b=a[j-1];\n                    a[j-1]=a[j];\n                    a[j]=b;\n                }\n            }\n         \n        }\n        if(n==1)\n            System.out.println(\""0\"");\n        else\n        {\n            for(int i=1;i<n;i++){\n                do{\n                    key=0;\n                    if(a[i]<a[0]*2-1)\n                        key++;\n                    else{\n                        a[i]=a[i]-a[0]*2+1;\n                        qie++;\n                    }\n                }while(key<1);\n            }\n        }\n        System.out.println(qie);\n       \n    }\n}",WRONG_ANSWER,111,24868
1591697576779591680,458af3c005e0b282d1ca88c254d9910ee2d93738b6f06d399f7444e1e64831eb,2022-11-13 15:40:49,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,q,i;\n    q=0;\n    scanf(\""%d\"",&a);\n    int b[100000];\n    for(i=1;i<=a;i++){\n        scanf(\""%d\"",&b[i]);\n    }\n    if(a==3){\n                if(b[1]>=5) q=q+b[1]+b[2]+b[3]-15;\n                else q=q+b[3]-5;\n            }\n    if(a==2) q=q+b[1]+b[2]-10;\n    if(a==1) q=q+b[1]-5;\n    for(i=0;i<a;){\n            b[0]=0;\n            if(a>3) {\n            if((a-i)>=3){\n                if(b[i+1]>=5){\n                    q=q+b[i+1]-5;\n                    i++;\n                }\n                if(b[i+1]<5){\n                    q=q+b[i+3]-5;\n                    i=i+3;\n                    }\n                    }\n            else\n            {\n                q=q+b[i+1]-5;\n                i++;\n            }\n            }\n    }\n\n    printf(\""%d\"",q);\n    return 0;\n}\n",WRONG_ANSWER,5,328
1591697692706004992,e7e6ce2c6e9e530eaf2b9b9968748a0e44e3ac7183d73deb51851946350bfbb0,2022-11-13 15:41:16,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    int flag=0;\n    int i;\n    int n,h[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++) {\n        scanf(\""%d\"",&h[i]);\n    }\n\n     for(i=0;i<n;i++) {\n        if(h[i]==h[i+1]) {\n           i++;\n           break;\n        }\n\n\n\n        if(h[i]<=h[i-1]&&h[i]<h[i+1]&&h[i+1]!='\\0')\n            flag++;\n\n     }\n\n    printf(\""%d\"",flag);\n    return 0;\n}\n",WRONG_ANSWER,5,192
1591697715418128384,5d7d397496e2400ea10e8ecafd4566e19d1083215d66cad8e11230c22227362c,2022-11-13 15:41:22,C++,300.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <bits/stdc++.h>\n\nusing namespace std;\nconst int N=1e5+10;\ntypedef long long ll;\nll n,l[N],res;\nvoid solve()\n{\n    scanf(\""%lld\"",&n);\n    set<ll>v;\n    res=-1;\n    for(int i=0;i<n;i++)\n    {\n        scanf(\""%lld\"",&l[i]);\n        v.insert(l[i]);\n    }\n    for(set<ll>::iterator i=v.begin();i!=v.end();i++)\n    {\n        ll x=*i;\n        for(int i=0;i<n;i++)\n        {\n            int sum=0;\n            if(l[i]>=x)\n            {\n                while(l[i]>=x)\n                {\n                    sum++;\n                    i++;\n                }\n            }\n            res=max(res,sum*x);\n        }\n    }\n    printf(\""%lld\"",res);\n}\nint main()\n{\n    solve();\n    return 0;\n}\n",ACCEPTED,43,480
1591697717670457344,458af3c005e0b282d1ca88c254d9910ee2d93738b6f06d399f7444e1e64831eb,2022-11-13 15:41:22,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int i,j,n,max,q=0;\n    scanf(\""%d\"",&n);\n    int a[n];\n    getchar();\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n        getchar();\n    }\n    for(j=0;j<n;){\n        max=a[j];\n        i=j;\n        if(a[i+2]>=max){\n            max=a[i+2];\n            j=i+3;\n        }\n        else j++;\n        q=q+max-5;\n    }\n    printf(\""%d\"",q);\n    return 0;\n}\n",WRONG_ANSWER,6,376
1591697756572639232,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-13 15:41:32,Java,0.0,1591610585635213319,1591131955016622080,1049226928954454016,"import java.util.Scanner;\npublic class Main {\n    public static void main(String []args) {\n        Scanner scanner=new Scanner(System.in); \n        int n,b;\n        int a[]=new int[10000];\n        int key =0;\n        int qie=0;\n        n=scanner.nextInt();\n        for(int i=0;i<n;i++){\n            a[i]=scanner.nextInt();\n        }\n        for(int i=1;i<n;i++){\n            for(int j=i;j<n;j++){\n                if(a[j]<a[j-1])\n                {\n                    b=a[j-1];\n                    a[j-1]=a[j];\n                    a[j]=b;\n                }\n            }\n         \n        }\n        if(n==1)\n            System.out.println(\""0\"");\n        else\n        {\n            for(int i=1;i<n;i++){\n                do{\n                    key=0;\n                    if(a[i]<a[0]*2-1)\n                        key++;\n                    else{\n                        a[i]=a[i]-a[0]*2+1;\n                        qie++;\n                    }\n                }while(key<1);\n            }\n                    System.out.println(qie);\n        }\n\n       \n    }\n}",WRONG_ANSWER,122,24212
1591697786431889408,e7e6ce2c6e9e530eaf2b9b9968748a0e44e3ac7183d73deb51851946350bfbb0,2022-11-13 15:41:39,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    int flag=0;\n    int i;\n    int n,h[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++) {\n        scanf(\""%d\"",&h[i]);\n    }\n\n     for(i=0;i<n;i++) {\n        if(h[i]==h[i+1]) {\n           i++;\n           break;\n        }\n\n\n\n        if(h[i]<=h[i-1]&&h[i]<h[i+1])\n            flag++;\n\n     }\n\n    printf(\""%d\"",flag);\n    return 0;\n}\n",WRONG_ANSWER,6,352
1591697823194996736,efa7a60e7fa0d7fd13e87b47555eb8bfc0c4da0695990711fb851b886de3de22,2022-11-13 15:41:48,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int i,n,j,max,sum;\n    scanf(\""%d\"",&n);\n    int len[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&len[i]);\n    for(j=0;j<n-1;j++){\n        if(len[j]==len[j+3]&&len[j+2]>len[j]){\n            max=len[j];\n            sum=max*5;\n        }\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,7,360
1591697835421347840,e7e6ce2c6e9e530eaf2b9b9968748a0e44e3ac7183d73deb51851946350bfbb0,2022-11-13 15:41:50,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    int flag=0;\n    int i;\n    int n,h[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++) {\n        scanf(\""%d\"",&h[i]);\n    }\n\n     for(i=0;i<n;i++) {\n        if(h[i]==h[i+1]) {\n           i++;\n           break;\n        }\n\n\n\n        if(h[i]<=h[i-1]&&h[i]<h[i+1])\n            flag++;\n\n     }\n\n    printf(\""%d\"",flag);\n    return 0;\n}\n",WRONG_ANSWER,7,200
1591697905474613248,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-13 15:42:07,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main (){\n    int n,a,b,i,sum=0;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    int c[n],f[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&f[i]);\n    for(i=0;i<n;i++){\n   sum+=(c[i]/(f[i]+1))*pow(a,f[i]+1)-(c[i]/(f[i]+1))*pow(b,f[i]+1);\n    }\n      \n          printf(\""%d\\n\"",sum);\n}",WRONG_ANSWER,5,328
1591697914806951936,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-13 15:42:09,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#define MAXSIZE 100\nint main(){\n    int n,s[MAXSIZE],k,i,j,p;\n    int max=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    scanf(\""%d\"",&s[i]);\n    for(i=0;i<n;i++)\n    {\n      j=i+1;\n      while(s[i]<=s[j]&&j!=n)\n      {j++;}\n    k=j-i;\n        p=s[i]*k;\n        max=(max>p)?max:p;\n    }\n    printf(\""%d\\n\"",max);\n    return 0;\n}",WRONG_ANSWER,23,512
1591697932502720512,0d24b4ee85e6e3a4cc694f7e11105fa2aaf93fd10d4cbe81657f252e2d675435,2022-11-13 15:42:14,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int num;\n    int i=0,t=0;\n    int arr[1000];\n    scanf(\""%d\"",&num);\n    while(i<num){\n        scanf(\""%d\"",&t);\n      arr[i++] = t;\n    }\n    int j,s,sum=0;\n    for(j=1,s=1;j<num,s<num;j++,s++){\n     if(arr[j]!=arr[j+s]||arr[j]!=arr[j-s])\n        if(arr[j]<arr[j-1]&&arr[j]<arr[j+1])\n            sum++;\n    else if(arr[j]<arr[j-s]&&arr[j]<arr[j+s])\n           sum++;\n    }\nprintf(\""%d\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,52,356
1591697946713022464,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-13 15:42:17,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#define MAXSIZE 100\nint main(){\n    int n,s[MAXSIZE],k,i,j,p;\n    int max=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    scanf(\""%d\"",&s[i]);\n    for(i=0;i<n;i++)\n    {\n      j=i+1;\n      while(s[i]<=s[j]&&j!=n)\n      {j++;}\n    k=j-i;\n        p=s[i]*k;\n        max=(max>p)?max:p;\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",WRONG_ANSWER,30,484
1591697970662498304,40c43472973ea298adbdd1d4b900aeb63cfa4cfe17179f01a4827cd2c6624d3a,2022-11-13 15:42:23,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int n;\n    int h[1000];\n    int i;\n    int t=0;\n    scanf(\""%d\"",&n);\n    if(n>=3&&n<=10000)\n    {\n        for(i=0;i<n;i++)\n        scanf(\""%d\"",&h[i]);\n    for(i=0;i<n-2;i++)\n    {\n        if(h[i]>h[i+1])\n            t++;\n    }\n     printf(\""%d\"",t);\n    }\n}",WRONG_ANSWER,6,500
1591697990111518720,172db3e4a89a3dc038ec44e9346ef3138ace8cc1576eb636ccaf26fd91d7a145,2022-11-13 15:42:27,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#include <algorithm>\n\nusing namespace std;\ntypedef long long ll;\nconst int N = 1e6 + 10;\n\nstruct node{\n\tll a,b;\n}per[N];\n\nll fa[N],Size[N],maxn,histogram[N];\n\nbool cmp(node a1,node a2) {\n\tif(a1.a > a2.a) return a1.a > a2.a;\n\telse return a1.b < a2.b;\n}\n\nint find(int x) {\n\tif(fa[x] == x) return x;\n\treturn fa[x] = find(fa[x]);\n}\n\nint main(){\n\tint n;\n\tscanf(\""%d\"",&n);\n\tfor(int i=1;i<=n;i++) {\n\t\tscanf(\""%lld\"",&histogram[i]);\n\t\tper[i].a = histogram[i];\n\t\tper[i].b = i;\n\t\tfa[i] = i;\n\t\tSize[i] = 1;\n\t}\n\tsort(per+1,per+n+1,cmp);\n\tfor(int i=1;i<=n;i++) {\n\t\tint x = per[i].b;\n\t\tint X = find(x);\n\t\tint Y = find(x - 1);\n\t\tint Z = find(x + 1);\n\t\tif(histogram[x - 1] >= histogram[x] && X != Y) {\n\t\t\tSize[X] += Size[Y];\n\t\t\tfa[Y] = X;\n\t\t} \n\t\tif(histogram[x + 1] >= histogram[x] && X != Z)  {\n\t\t\tSize[X] += Size[Z];\n\t\t\tfa[Z] = X;\n\t\t}\n\t\tmaxn = max(maxn,histogram[x] * Size[X]);\n\t} \n\tprintf(\""%lld\"",maxn);\n    return 0;\n}",SEGMENTATION_FAULT,29,23808
1591698054020096000,acf80eea856463058b81f71c0238069795893092293fbd098cc594959df6444e,2022-11-13 15:42:43,C++,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nconst int N=1e4+10;\nint n,l[N],res;\nvoid solve(){\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)scanf(\""%d\"",&l[i]);\n    res=0;\n    for(int i=1;i<n-1;i++){\n        if(l[i]<l[i-1]&&l[i]<l[i+1])\n        {\n            res++;\n        }\n        if(l[i]<l[i-1])\n        {\n            if(l[i]>l[i+1])continue;\n            else if(l[i]==l[i+1])\n            {\n                while(l[i]==l[i+1]&&i<n-1)i++;\n                if(l[i]<l[i+1])res++;\n                \n            }\n                  \n            \n        }\n    }\n    printf(\""%d\"",res);\n    \n}\nint main(){\n    solve();\n    return 0;\n}\n",ACCEPTED,62,568
1591698113428217856,c47b15e117166a3dd00078b9f795673d5284a2761e582479119229751cc734d3,2022-11-13 15:42:57,C++,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#define S 10000\n\n\nint main()\n{\n    int b,a=0,n,i,j=0;\n    int s[S];\n    int m[S];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",s[i]);\n    for(i=0;i<n-1;i++)\n    {\n        if(s[i]!=s[i+1])\n        {\n            a+=2;\n            s[i]=3;\n            s[i+1]=3;\n        }\n\n    }\n    for(i=0;i<n-1;i++)\n    {\n        if(s[i]!=3)\n        {\n            m[j]=s[i];\n            j++;\n        }\n\n    }\n    for(j=0;j<(n-a);j++)\n    {\n        if(m[j]!=m[j+1])\n        {\n            b+=2;\n\n        }\n\n    }\n\n        printf(\""a=%d\"",a+b);\n\n\n\n    return 0;\n}",SEGMENTATION_FAULT,5,328
1591698142301806592,0d24b4ee85e6e3a4cc694f7e11105fa2aaf93fd10d4cbe81657f252e2d675435,2022-11-13 15:43:04,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int num;\n    int i=0,t=0;\n    int arr[1000];\n    scanf(\""%d\"",&num);\n    while(i<num){\n        scanf(\""%d\"",&t);\n      arr[i++] = t;\n    }\n    int j,s,sum=0;\n    for(j=1,s=1;j<num,s<num;j++,s++){\n     if(arr[j]!=arr[j+s]||arr[j]!=arr[j-s])\n        if(arr[j]<arr[j-1]&&arr[j]<arr[j+1])\n            sum++;\n    else\n        if(arr[j]<arr[j-s]&&arr[j]<arr[j+s])\n           sum++;\n    }\nprintf(\""%d\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,52,488
1591698148916256768,dcc1017bcd698bd6a0eee54e4ed848d4c51a3a26608990cdd2137e4c01065a1e,2022-11-13 15:43:05,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main (){\n    int x,i,j,num=0;\n    int y[100]={0};\n    scanf(\""%d\"",&x);\n    for(i=0;i<x;i++){\n        scanf(\""%d\"",&j);\n        y[i]=j;\n    }\n    for(i=1;i<x;i++){\n        if(y[i]<y[i-1]){\n            if(y[i+1]==y[i]){\n                if(y[i+2]>y[i+1]){\n                    num++;\n                }\n            }\n            if(y[i]<y[i+1]){\n                num++;\n            }\n        }\n    }\n    printf(\""%d\\n\"",num);\n    return 0;\n}",RUNTIME_ERROR,32,460
1591698177596862464,6a4a105e99255cc39ebb6a122c9fdf740e574dbb708100363b339265f92e1bbf,2022-11-13 15:43:12,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main(){\n    printf(\""15\"");\n    return 0;\n}",WRONG_ANSWER,5,340
1591698213584035840,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-13 15:43:21,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main (){\n    int n,a,b,i,sum=0;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    int c[n],f[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&f[i]);\n    for(i=0;i<n;i++){\n   sum+=(c[i]/(f[i]+1))*pow(a,f[i]+1)-(c[i]/(f[i]+1))*pow(b,f[i]+1);\n    }\n      \n          printf(\""%d\\n\"",sum);\n}",WRONG_ANSWER,6,356
1591698229329453056,6a4a105e99255cc39ebb6a122c9fdf740e574dbb708100363b339265f92e1bbf,2022-11-13 15:43:24,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main(){\n    printf(\""15\\n\"");\n    return 0;\n}",WRONG_ANSWER,7,476
1591698280835461120,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-13 15:43:37,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"def clean(num,n):\n    for i in range(len(num)-1):\n        if num[i]!=num[i+1]:\n            num.pop(i)\n            num.pop(i)\n            return clean(num,n)\n    print(n-len(num))\n    return 0\n\nn=int(input())\nb=input()\na=list(b[:n])\nclean(a,n)\n",NON_ZERO_EXIT_CODE,157,4828
1591698295058358272,40c43472973ea298adbdd1d4b900aeb63cfa4cfe17179f01a4827cd2c6624d3a,2022-11-13 15:43:40,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int n;\n    int h[1000];\n    int i;\n    int t=0;\n    scanf(\""%d\"",&n);\n    if(n>=3&&n<=10000)\n    {\n        for(i=0;i<n;i++)\n        scanf(\""%d\"",&h[i]);\n    for(i=0;i<n-2;i++)\n    {\n        if(h[i]>h[i+1])\n            t++;\n    }\n    }\n    printf(\""%d\"",t);\n}",WRONG_ANSWER,4,324
1591698309067366400,dcc1017bcd698bd6a0eee54e4ed848d4c51a3a26608990cdd2137e4c01065a1e,2022-11-13 15:43:43,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main (){\n    int x,i,j,num=0;\n    int y[100]={0};\n    scanf(\""%d\"",&x);\n    for(i=0;i<x;i++){\n        scanf(\""%d\"",&j);\n        y[i]=j;\n    }\n    for(i=1;i<x+1;i++){\n        if(y[i]<y[i-1]){\n            if(y[i+1]==y[i]){\n                if(y[i+2]>y[i+1]){\n                    num++;\n                }\n            }\n            if(y[i]<y[i+1]){\n                num++;\n            }\n        }\n    }\n    printf(\""%d\\n\"",num);\n    return 0;\n}",RUNTIME_ERROR,37,348
1591698318919786496,17759f531671f838bf3fae4270190e93b6109026f9503f986c1ed85bb412007d,2022-11-13 15:43:46,C,300.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int i,n,a,b,sum;\n    float c[30000],F[30000],sum1=0,sum2=0;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n        scanf(\""%f\"",&c[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%f\"",&F[i]);\n    for(i=0;i<n;i++)\n    {\n        sum1=sum1+(c[i]/(F[i]+1))*(pow(a,(F[i]+1)));\n        sum2=sum2+(c[i]/(F[i]+1))*(pow(b,(F[i]+1)));\n    }\n    sum=(int)(sum1-sum2);\n    printf(\""%d\"",sum);\n}",ACCEPTED,42,512
1591698348124692480,458af3c005e0b282d1ca88c254d9910ee2d93738b6f06d399f7444e1e64831eb,2022-11-13 15:43:53,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int i,j,n,max,q=0;\n    scanf(\""%d\"",&n);\n    int a[10000000];\n    getchar();\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n        getchar();\n    }\n    for(j=0;j<n;){\n        max=a[j];\n        i=j;\n        if(a[i+2]>max){\n            max=a[i+2];\n            j=i+3;\n        }\n        else j++;\n        q=q+max-5;\n    }\n    printf(\""%d\"",q);\n    return 0;\n}\n",SEGMENTATION_FAULT,5,328
1591698362481827840,28b4de6882b7ade2679f59c486acaf307ce8415dcb0a15787dba589025bbdb02,2022-11-13 15:43:56,C++,300.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint n,i,j,k=0;\n\tscanf(\""%d\"",&n);\n\tgetchar();\n\tchar num[n+1];\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%c\"",&num[i]);\n\t}\n    \n\tfor(i=0,j=1;j<n;)\n\t{\n        if(num[i]!=num[j])\n        {\n            num[i]=num[j]=-1;\n            k=k+2;\n            i=i-1;\n            j++;\n            while(num[i]==-1&&i>=0)\n            {\n                i--;\n       \n            }\n            if(i==-1)\n            {\n                i=j;\n                j++;\n            }\n            \n        }\n        else\n        {\n            i=j;\n            j++;\n        }\n\t\t\n\t}\n\tprintf(\""%d\\n\"",k);\n\treturn 0;\n}",ACCEPTED,53,352
1591698384413798400,64475a8ecd7d5a6c6e734f3f299283e039c26933b2a0e510cd9d22e95ba92068,2022-11-13 15:44:01,C++,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <bits/stdc++.h> \nusing namespace std;\n\nint main()\n{\n\tint n,ans = 0,d;\n\tchar a[100010];\n\tint vis[100010];\n\t\n\tcin>>n;\n\tfor(int i = 0; i < n; i++)\n\tcin>>a[i];\n\t\n\n\tfor(int i = 0; i < n; i++)\n\t{\n\t\tfor(int j = 0; j < n-1; j++)\n\t\t{\n\t\t\tif(vis[j]==1)\n\t\t\tcontinue;\n\t\t\telse\n\t\t\t{\n\t\t\t\tvis[j] = 1;\n\t\t\t\td = j;\n\t\t\t\twhile(vis[j+1]==1)\n\t\t\t\t{\n\t\t\t\t\tj++;\n                    if(j==n-1)\n                    break;\n\t\t\t\t}\n\t\t\t\tif(a[d]!=a[j-1])\n\t\t\t\t{\n\t\t\t\t\tvis[j] = 1;\n\t\t\t\t\tans+=2;\n\t\t\t\t}\n\t\t\t\telse if(a[d]==a[j])\n\t\t\t\t{\n\t\t\t\t\tvis[d] = 0;\n\t\t\t\t\tvis[j] = 0;\n\t\t\t\t}\t\n                j = d;\n\t\t\t}\n\t\t}\n\t}\n\tcout<<ans;\n\t\n\treturn 0;\n}",WRONG_ANSWER,8,340
1591698395130290176,458af3c005e0b282d1ca88c254d9910ee2d93738b6f06d399f7444e1e64831eb,2022-11-13 15:44:04,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int i,j,n,max,q=0;\n    scanf(\""%d\"",&n);\n    int a[100000];\n    getchar();\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n        getchar();\n    }\n    for(j=0;j<n;){\n        max=a[j];\n        i=j;\n        if(a[i+2]>max){\n            max=a[i+2];\n            j=i+3;\n        }\n        else j++;\n        q=q+max-5;\n    }\n    printf(\""%d\"",q);\n    return 0;\n}\n",WRONG_ANSWER,10,324
1591698406895280128,64475a8ecd7d5a6c6e734f3f299283e039c26933b2a0e510cd9d22e95ba92068,2022-11-13 15:44:07,C++,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <bits/stdc++.h> \nusing namespace std;\n\nint main()\n{\n\tint n,ans = 0,d;\n\tchar a[100010];\n\tint vis[100010];\n\t\n\tcin>>n;\n\tfor(int i = 0; i < n; i++)\n\tcin>>a[i];\n\t\n\n\tfor(int i = 0; i < n; i++)\n\t{\n\t\tfor(int j = 0; j < n-1; j++)\n\t\t{\n\t\t\tif(vis[j]==1)\n\t\t\tcontinue;\n\t\t\telse\n\t\t\t{\n\t\t\t\tvis[j] = 1;\n\t\t\t\td = j;\n\t\t\t\twhile(vis[j+1]==1)\n\t\t\t\t{\n\t\t\t\t\tj++;\n                    if(j==n-1)\n                    break;\n\t\t\t\t}\n\t\t\t\tif(a[d]!=a[j-1])\n\t\t\t\t{\n\t\t\t\t\tvis[j] = 1;\n\t\t\t\t\tans+=2;\n\t\t\t\t}\n\t\t\t\telse if(a[d]==a[j])\n\t\t\t\t{\n\t\t\t\t\tvis[d] = 0;\n\t\t\t\t\tvis[j] = 0;\n\t\t\t\t}\t\n                j = d;\n\t\t\t}\n\t\t}\n\t}\n\tcout<<ans;\n\t\n\treturn 0;\n}",WRONG_ANSWER,9,328
1591698437685698560,458af3c005e0b282d1ca88c254d9910ee2d93738b6f06d399f7444e1e64831eb,2022-11-13 15:44:14,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int i,j,n,max,q=0;\n    scanf(\""%d\"",&n);\n    int a[100000];\n    getchar();\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n        getchar();\n    }\n    for(j=0;j<n;){\n        max=a[j];\n        i=j;\n        if(a[i+2]>=max){\n            max=a[i+2];\n            j=i+3;\n        }\n        else j++;\n        q=q+max-5;\n    }\n    printf(\""%d\"",q);\n    return 0;\n}\n",WRONG_ANSWER,6,324
1591698447076712448,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-13 15:44:16,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"def clean(num,n):\n    for i in range(len(num)-1):\n        if num[i]!=num[i+1]:\n            num.pop(i)\n            num.pop(i)\n            return clean(num,n)\n    print(n-len(num))\n    exit(0)\n\nn=int(input())\nb=input()\na=list(b[:n])\nclean(a,n)\n",NON_ZERO_EXIT_CODE,152,4808
1591698463400943616,5bd1a8718ea7fb820055421c67b8e0a468e08d951f729a24e55bf407b3bdb1f6,2022-11-13 15:44:20,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <iostream>\n#include <algorithm>\n#include <vector>\nusing namespace std;\nint main()\n{\n\n    int n;\n    cin>>n;\n    vector<int> height(n);\n    for(int i=0;i<n;i++){\n        cin>>height[i];\n    }\n    int i=0,j=height.size()-1;\n    int result=0;\n    while(i<j){\n        result=max(result,min(height[i],height[j])*(j-i));\n        height[i]<height[j]?i++:j--;\n    }\n    if(n!=1)\n    cout<<result;\n    else\n        cout<<height[0];\n    return 0;\n}\n",WRONG_ANSWER,7,512
1591698465749786624,dcc1017bcd698bd6a0eee54e4ed848d4c51a3a26608990cdd2137e4c01065a1e,2022-11-13 15:44:21,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main (){\n    int x,i,j,num=0;\n    int y[100]={0};\n    scanf(\""%d\"",&x);\n    for(i=0;i<x;i++){\n        scanf(\""%d\"",&j);\n        y[i]=j;\n    }\n    for(i=0;i<x;i++){\n        if(y[i]<y[i-1]){\n            if(y[i+1]==y[i]){\n                if(y[i+2]>y[i+1]){\n                    num++;\n                }\n            }\n            if(y[i]<y[i+1]){\n                num++;\n            }\n        }\n    }\n    printf(\""%d\\n\"",num);\n    return 0;\n}",RUNTIME_ERROR,30,488
1591698487845347328,86f702b052a21d7cb2f8cd933c678c21efaafaf5b2d35032f18ec35c1e26a945,2022-11-13 15:44:26,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a,b,i,sum;\n    int c[100],F[100],m[100],p[100];\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&c[i]);\n     for(i=0;i<n;i++)\n        scanf(\""%d\"",&F[i]);\n    for(i=0;i<n;i++)\n    { m[i]=c[i]/(F[i]+1)*pow(a,(F[i]+1));\n        p[i]=c[i]/(F[i]+1)*pow(b,(F[i]+1));}\n        sum=(m[0]+m[1])-(p[0]+p[1]);\n    printf(\""%d\"",sum);\n    \n    return 0;\n}",WRONG_ANSWER,5,640
1591698552055980032,6383c93cbdef4af3eda29400a925819f16ad4afc8368e604ccd580cba7055bdd,2022-11-13 15:44:41,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint i,k,j;\n\tint n;\n\tif(scanf(\""%d\"",&n)){\n\tint h[n];\n\tfor(i=0;i<=n-1;i++){\n\t\th[i] = 0;\n\t}\n\tfor(k=0;k<=n-1;k++){\n\t\tif(scanf(\""%d\"",&h[k])){}\n\t}\n\tif(h[0]==0&&h[n-1]==0){\n\tint cnt = 0;\n\tfor(j=1;j<=n-2;j++){\n\t\tif(((h[j]<h[j-1])&&(h[j]<h[j+1]))||((h[j]==h[j+1])&&(h[j]<h[j-1])&&(h[j+1]<h[j+2]))){\n\t\t\tcnt++;\n\t\t}\n\t}\n\tprintf(\""%d\"",cnt);\n\t}}\n\treturn 0;\n}\n",WRONG_ANSWER,41,476
1591698559354023936,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-13 15:44:43,C++,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\n#define N 10000\n\n\nint pand(char *a,int i,int n)\n{\n    int b,c;\n    a[i]=a[i+2];\n    a[i+1]=a[i+3];\n    i++;\n    if(i<n) pand(a,i,n);\n    else return 0;\n\n}\n\n\n\n\n\n\nint main()\n{\n    char a[10000];\n    int n,i,j,k,l,zq,len;\n    j=0;\n    scanf(\""%d\"",&n);\n    scanf(\""%s\"",&a);\n    len=int(strlen(a));\n    \n    a[n]='\\0';\n    //printf(\""%d\\n\"",len);\n    for(l=0;l<n;l++){\n        if(a[l]=='0'||a[l]=='1') zq=1;\n        else {zq=0;\n             break;}\n        //printf(\""%d\"",zq);\n    }\n    //printf(\""%d\"",zq);\n    if(zq==1){if(len==n){\n    for(l=0;l<n;l++){\n    for(i=0;i<n;i++)\n    {\n        //if(i=0&&a[0]!=a[1]) a[0]=a[2];\n        //a[1]=a[]\n        \n        k=i;\n        if(i>=0&&a[i]!=a[i+1]&&i<=n-1)\n            {\n//printf(\""%s\\n,n=%d\\n\"",a,n);\n            if(n>0){\n            pand(a,i,n);\n            n-=2;\n            j+=2;\n            }\n\n            }\n\n    }\n    }//printf(\""!%s\"",a);\n\nprintf(\""%d\\n\"",j);\n\n    }\n             }\n\n\n    return 0;\n}",SEGMENTATION_FAULT,38,352
1591698683153145856,64475a8ecd7d5a6c6e734f3f299283e039c26933b2a0e510cd9d22e95ba92068,2022-11-13 15:45:13,C++,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <bits/stdc++.h> \nusing namespace std;\n\nint main()\n{\n\tint n,ans = 0,d;\n\tchar a[100010];\n\tint vis[100010];\n\t\n\tcin>>n;\n\tfor(int i = 0; i < n; i++)\n\tcin>>a[i];\n\t\n\n\tfor(int i = 0; i < n; i++)\n\t{\n\t\tfor(int j = 0; j < n-1; j++)\n\t\t{\n\t\t\tif(vis[j]==1)\n\t\t\tcontinue;\n\t\t\telse\n\t\t\t{\n\t\t\t\tvis[j] = 1;\n\t\t\t\td = j;\n\t\t\t\twhile(vis[j+1]==1)\n\t\t\t\t{\n\t\t\t\t\tj++;\n                    if(j==n)\n                    break;\n\t\t\t\t}\n\t\t\t\tif(a[d]!=a[j-1])\n\t\t\t\t{\n\t\t\t\t\tvis[j] = 1;\n\t\t\t\t\tans+=2;\n\t\t\t\t}\n\t\t\t\telse if(a[d]==a[j])\n\t\t\t\t{\n\t\t\t\t\tvis[d] = 0;\n\t\t\t\t\tvis[j] = 0;\n\t\t\t\t}\t\n                j = d;\n\t\t\t}\n\t\t}\n\t}\n\tcout<<ans;\n\t\n\treturn 0;\n}",WRONG_ANSWER,7,596
1591698708436365312,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-13 15:45:19,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"def clean(num,n):\n    for i in range(len(num)-1):\n        if num[i]!=num[i+1]:\n            num.pop(i)\n            num.pop(i)\n            return clean(num,n)\n    print(n-len(num))\n    exit(0)\n\nn=int(input())\nb=input()\na=list(b[:n])\nclean(a,n)\n",NON_ZERO_EXIT_CODE,130,4984
1591698752937930752,e9a50f3e071443bb6fb229966bff355c178d484f6cc10e5e1fc8dc5a537237ba,2022-11-13 15:45:29,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int b,c,i,j,max=0,k=0;\n    scanf(\""%d\"",&b);\n    char a[b];\n    getchar();\n    for(i=0;i<b;i++)\n        scanf(\""%c\"",&a[i]);\n      for(i=0;i<b;i++){\n    if(a[i]!=a[i+1]){\n        max=max+2;\n        a[i]=a[i+2];\n        a[i+1]=a[i+3];\n        b=b-2;\n        i=0;\n    }\n    }\n    printf(\""%d\\n\"",max);\n}\n",WRONG_ANSWER,5,348
1591698772458233856,25584884fd716238437f89484285121d106c1090916ab683be624f210130ebad,2022-11-13 15:45:34,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int k=0,h[100000],n,i;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&h[i]);\n    for(i=0;i<n-2;i++)\n    {\n        if(h[i]>h[i+1]&&h[i+1]<h[i+2])\n            k++;\n        else if(h[i]==h[i+1])\n            if(h[i-1]>h[i]&&h[i+2]>=h[i+1])\n                k++;\n    }\n    printf(\""%d\"",k);\n        return 0;\n}",ACCEPTED,45,512
1591698931367862272,cf568c7ddc8b221335f880bfbaac4634294e65481e738a2e032c1ab9a84d576f,2022-11-13 15:46:12,C,300.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include<math.h>\nint main()\n{\n  int n,a,b;\n    float c[1000];\n    float f[1000];\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    float sum1=0;float sum2=0;\n    \n    for(int i=0;i<n;i++){\n        scanf(\""%f\"",&c[i]);\n    }\n    for(int i=0;i<n;i++){\n        scanf(\""%f\"",&f[i]);\n    }\n    for(int i=0;i<n;i++){\n        sum1+=(c[i]/(f[i]+1))*pow(a,(f[i]+1));\n        sum2+=(c[i]/(f[i]+1))*pow(b,(f[i]+1));\n    }\n    int result=(int)(sum1-sum2);\n    printf(\""%d\\n\"",result);\n    \n\n      return 0;\n}",ACCEPTED,42,640
1591698953031442432,6a4a105e99255cc39ebb6a122c9fdf740e574dbb708100363b339265f92e1bbf,2022-11-13 15:46:17,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n,i;\n    scanf(\""%d\"",&n);\n    int A[n];\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&A[i]);\n    }\n    printf(\""15\\n\"");\n    return 0;\n}",WRONG_ANSWER,6,488
1591698971591237632,86f702b052a21d7cb2f8cd933c678c21efaafaf5b2d35032f18ec35c1e26a945,2022-11-13 15:46:21,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a,b,i,sum,sum1=0,sum2=0;\n    int c[100],F[100],m[100],p[100];\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&c[i]);\n     for(i=0;i<n;i++)\n        scanf(\""%d\"",&F[i]);\n    for(i=0;i<n;i++)\n    { m[i]=c[i]/(F[i]+1)*pow(a,(F[i]+1));\n        p[i]=c[i]/(F[i]+1)*pow(b,(F[i]+1));\n       sum1=m[i]+sum1;\n       sum2=p[i]+sum2;\n    }\n    sum=sum1-sum2;\n    printf(\""%d\"",sum);\n    \n    return 0;\n}",WRONG_ANSWER,7,192
1591699011235753984,5bd1a8718ea7fb820055421c67b8e0a468e08d951f729a24e55bf407b3bdb1f6,2022-11-13 15:46:31,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <iostream>\n#include <algorithm>\n#include <vector>\nusing namespace std;\nint main()\n{\n\n    int n;\n    cin>>n;\n    vector<int> height(n);\n    for(int i=0;i<n;i++){\n        cin>>height[i];\n    }\n    int i=0,j=height.size();\n    int result=0;\n    while(i<j){\n        result=max(result,min(height[i],height[j])*(j-i));\n        height[i]<height[j]?i++:j--;\n    }\n    if(n!=1)\n    cout<<result;\n    else\n        cout<<height[0];\n    return 0;\n}\n",WRONG_ANSWER,5,456
1591699030760239104,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-13 15:46:35,C,300.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tint i,j,k,flag=0;\n\tfor(i=0;i<n;i++)\n\t  scanf(\""%d\"",&a[i]);\n\t  int sum[n],num=0;\n\tfor(i=0;i<n;i++)\n\t{\n\t\t//flag=0;\n\t\tnum=0;\n\t\tfor(j=0;j<n-i;j++)\n\t\t{\n\t\t\tif(a[i]<=a[i+j]) \n\t\t\t{//flag=1;\n\t\t\tnum++;\n\t\t\t}\n\t\t\telse \n\t\t\t{\n\t\t       //flag=0;\n                break;\n\t\t\t}\n\t\t\n\t\t}\n\t\tfor(k=1;k<=i;k++)\n\t\t{\n\t\t\tif(a[i]<=a[i-k]) num++;\n\t\t\telse break;\n\t\t}\n\t//\tif(flag==1) \n\t\tsum[i]=a[i]*num;\n\t   // else sum[i]=a[i];\n\t}\n\tint max=sum[0];\n\tfor(i=1;i<n;i++)\n\t{\n\t\tif(sum[i]>max) max=sum[i];\n\t\t\n\t}\n\tprintf(\""%d\"",max);\n\treturn 0;\n}",ACCEPTED,42,512
1591699125534732288,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 15:46:58,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n    int n,a[20];\n    int i,h=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=1;i<n-1;i++)\n    {\n        if(i<=n-4)\n            {if(a[i]-a[i+1]>=0&&a[i+2]-a[i+1]>=0&&a[i]!=a[i+1])\n            h++;\n            }\n    }\n    printf(\""%d\\n\"",h);\n    return 0;\n}\n\n",RUNTIME_ERROR,18,328
1591699210796589056,9d0546dac18a9dc678295254e547925db086add5f872ef42d8015d525afeaf65,2022-11-13 15:47:18,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define N 100000\nint main()\n{\n    char str[N];\n    int i,n,k=0;\n    scanf(\""%d\"",&n);\n    scanf(\""%s\"",str);\n    for(i=0;i<strlen(str);i++){\n        if(str[i]==str[i-1]){\n            continue;\n        }else{\n            k=k+2;\n            str[i-1]=str[i];\n            str[i-1]=str[i+1];\n        }\n        str[i-1]='\\0';\n    }\n    printf(\""%d\\n\"",k);\n}\n",WRONG_ANSWER,14,372
1591699257835675648,05fd79145678de5c06012db9db4333bebf8365a74fe442d12a54a9da3782fdca,2022-11-13 15:47:30,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<iostream>\n#include<math.h>\n#define N 100005\nusing namespace std;\n\n\nint main(){\n    int n,a,b;\n    int c[N];\n    int F[N];\n    int all=0;\n    cin >> n>>a>>b;\n\n    for(int i = 0;i<n;i++){\n        cin >> c[i];\n    }\n    for(int i = 0;i<n;i++){\n        cin >> F[i];\n    }\n    for(int i = 0;i<n;i++){\n        all+=(c[i]/(F[i]+1)*(int)pow(a,F[i]+1)) - (c[i]/(F[i]+1)*(int)pow(b,F[i]+1));\n    }\n\n    cout<<all;\n\treturn 0;\n}\n",WRONG_ANSWER,8,328
1591699266702422016,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-13 15:47:32,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#define MAXSIZE 1000\nint main(){\n    int n,s[MAXSIZE],k,i,j,p;\n    int max=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    scanf(\""%d\"",&s[i]);\n    for(i=0;i<n;i++)\n    {\n      j=i+1;\n      while(s[i]<=s[j]&&j!=n)\n      {j++;}\n    k=j-i;\n        p=s[i]*k;\n        max=(max>p)?max:p;\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",WRONG_ANSWER,24,476
1591699307924086784,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-13 15:47:42,Java,0.0,1591610585635213319,1591131955016622080,1049226928954454016,"import java.util.Scanner;\npublic class Main {\n    public static void main(String []args) {\n        Scanner scanner=new Scanner(System.in); \n        int n,b;\n        int a[]=new int[10000];\n        int key =0;\n        int qie=0;\n        n=scanner.nextInt();\n        for(int i=0;i<n;i++){\n            a[i]=scanner.nextInt();\n        }\n        for(int i=1;i<n;i++){\n            for(int j=i;j<n;j++){\n                if(a[j]<a[j-1])\n                {\n                    b=a[j-1];\n                    a[j-1]=a[j];\n                    a[j]=b;\n                }\n            }\n         \n        }\n        if(n==1)\n            System.out.println(\""0\"");\n        else\n        {\n            for(int i=1;i<n;i++){\n                do{\n                    key=0;\n                    if(a[i]<=a[0]*2-1)\n                        key++;\n                    else{\n                        a[i]=a[i]-a[0]*2+1;\n                        qie++;\n                    }\n                }while(key<1);\n            }\n                    System.out.println(qie);\n        }\n\n       \n    }\n}",WRONG_ANSWER,114,24588
1591699328312553472,40c43472973ea298adbdd1d4b900aeb63cfa4cfe17179f01a4827cd2c6624d3a,2022-11-13 15:47:46,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int n;\n    int h[1000];\n    int i;\n    int t=0;\n    scanf(\""%d\"",&n);\n    if(n>=3&&n<=10000)\n    {\n        for(i=0;i<n;i++)\n        scanf(\""%d\"",&h[i]);\n    for(i=0;i<n-2;i++)\n    {\n        if(h[i]>h[i+1])\n            t++;\n            if(h[i]>h[i+1]&&h[i]==h[i+1])\n           t=t-1;\n    }\n     printf(\""%d\"",t);\n    }\n}",WRONG_ANSWER,6,368
1591699369819430912,40c43472973ea298adbdd1d4b900aeb63cfa4cfe17179f01a4827cd2c6624d3a,2022-11-13 15:47:56,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int n;\n    int h[1000];\n    int i;\n    int t=0;\n    scanf(\""%d\"",&n);\n    if(n>=3&&n<=10000)\n    {\n        for(i=0;i<n;i++)\n        scanf(\""%d\"",&h[i]);\n    for(i=0;i<n-2;i++)\n    {\n        if(h[i]>h[i+1])\n            t++;\n    }\n     printf(\""%d\"",t);\n    }\n}",WRONG_ANSWER,4,352
1591699491823312896,864c0dc14d6d917707294bc7e18ea53a2c0536c5d47f3d25f94f0188f106014f,2022-11-13 15:48:25,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\n int main()\n{\n    int n,i;\n    scanf(\""%d\"",&n);\n     char a[n];\n    for(i=0;i<=n;i++){\n        scanf(\""%c\"",&a[i]);\n    }\n     int j,count=0;\n        for(j=0;j<strlen(a); j++){\n         if((a[j]=='0'&&a[j+1]=='1')||(a[j]=='1'&&a[j+1]=='0')){\n             count=count+2;\n            a[j-2]=a[j];\n\n        }\n    }\n    printf(\""%d\"",count);\n    return 0;\n}\n\n\n\n",WRONG_ANSWER,9,348
1591699513734356992,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-13 15:48:31,C++,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main(){\n\tint n,i,j;\n\tint a[100000]={0};\n\tscanf(\""%d\"",&n);\n\tint max=0;\n\tint sum1,sum2;\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=0;i<n;i++){\n\t\tsum1=0;\n\t\tsum2=0;\n\t\tsum1=a[i]-5;\n\t\tsum2=a[i+2]-5;\n\t\tif(sum1>sum2){\n\t\t\tmax+=sum1;\n\t\t}else{\n\t\t\tmax+=sum2;\n\t\t\ti=i+2;\n\t\t}\n\t}\n\tprintf(\""%d\\n\"",max);\n    return 0;\n}",WRONG_ANSWER,6,736
1591699514996830208,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-13 15:48:31,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main (){\n    int n,a,b,i,sum=0;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    int c[n],f[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&f[i]);\n    for(i=0;i<n;i++){\n   sum+=c[i]*pow(a,f[i]+1)/(f[i]+1)-c[i]*pow(b,f[i]+1)/(f[i]+1);\n    }\n      \n          printf(\""%d\\n\"",sum);\n}",WRONG_ANSWER,12,196
1591699522781458432,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-13 15:48:33,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"def clean(num,n):\n    for i in range(len(num)-1):\n        if num[i]!=num[i+1]:\n            num.pop(i)\n            num.pop(i)\n            return clean(num,n)\n    print(n-len(num),end='')\n    exit(0)\n\nn=int(input())\nb=input()\na=list(b[:n])\nclean(a,n)\n",NON_ZERO_EXIT_CODE,126,4920
1591699528594776064,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-13 15:48:34,Java,0.0,1591610585635213319,1591131955016622080,1049226928954454016,"import java.util.Scanner;\npublic class Main {\n    public static void main(String []args) {\n        Scanner scanner=new Scanner(System.in); \n        int n,b;\n        int a[]=new int[100000];\n        int key =0;\n        int qie=0;\n        n=scanner.nextInt();\n        for(int i=0;i<n;i++){\n            a[i]=scanner.nextInt();\n        }\n        for(int i=1;i<n;i++){\n            for(int j=i;j<n;j++){\n                if(a[j]<a[j-1])\n                {\n                    b=a[j-1];\n                    a[j-1]=a[j];\n                    a[j]=b;\n                }\n            }\n         \n        }\n        if(n==1)\n            System.out.println(\""0\"");\n        else\n        {\n            for(int i=1;i<n;i++){\n                do{\n                    key=0;\n                    if(a[i]<=a[0]*2-1)\n                        key++;\n                    else{\n                        a[i]=a[i]-a[0]*2+1;\n                        qie++;\n                    }\n                }while(key<1);\n            }\n                    System.out.println(qie);\n        }\n\n       \n    }\n}",WRONG_ANSWER,110,24736
1591699595112243200,dcc1017bcd698bd6a0eee54e4ed848d4c51a3a26608990cdd2137e4c01065a1e,2022-11-13 15:48:50,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main (){\n    int x,i,j,num=0;\n    int y[100]={0};\n    scanf(\""%d\"",&x);\n    for(i=0;i<x;i++){\n        scanf(\""%d\"",&j);\n        y[i]=j;\n    }\n    for(i=1;i<x-1;i++){\n        if(y[i]<y[i-1]){\n            if(y[i+1]==y[i]){\n                if(y[i+2]>y[i+1]){\n                    num++;\n                }\n            }\n            if(y[i]<y[i+1]){\n                num++;\n            }\n        }\n    }\n    printf(\""%d\\n\"",num);\n    return 0;\n}",RUNTIME_ERROR,31,512
1591699643392876544,7e6a67f270e740aba8788a12d9a49939621a28d5059d3ced2247a86914b0a3b3,2022-11-13 15:49:01,C++,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\t\n\tint a[n];\n\tint i;\n\tfor(i=0;i<n;i++)\n\t\tscanf(\""%d\"",&a[i]);\n\t\n\tint sum=0;\n\ti=0;\n\twhile(i<n)\n\t{\n\t\tif(a[i+2]>a[i]&&i<n-2)\n\t\t{\n\t\t\tsum+=a[i+2];\n\t\t\ti+=3;\t\n\t\t} \n\t\telse \n\t\t{\n\t\t\tsum+=a[i];\n\t\t\ti++;\n\t\t}\n\t\tsum-=5;\n\t}\n\tprintf(\""%d\"",sum);\n}",WRONG_ANSWER,5,200
1591699706731061248,05fd79145678de5c06012db9db4333bebf8365a74fe442d12a54a9da3782fdca,2022-11-13 15:49:17,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<iostream>\n#include<math.h>\n#define N 100005\nusing namespace std;\n\n\nint main(){\n    int n,a,b;\n    int c[N];\n    int F[N];\n    int all=0;\n    cin >> n>>a>>b;\n    for(int i = 0;i<n;i++) cin >> c[i];\n    for(int i = 0;i<n;i++) cin >> F[i];\n    for(int i = 0;i<n;i++){\n        all+=(c[i]/(F[i]+1)*(int)pow(a,F[i]+1)) - (c[i]/(F[i]+1)*(int)pow(b,F[i]+1));\n    }\n    cout<<all<<endl;\n\treturn 0;\n}\n",WRONG_ANSWER,11,480
1591699744869855232,5ed1ed5f3786d45db71190023ef590496fd0d8d8cfe4af0f2c94d1d387178674,2022-11-13 15:49:26,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,a[1000],k=0,j=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if(a[i]>a[i+1])\n        {\n            if(a[i+1]<a[i+2])\n                k++;\n        }\n    }\n    printf(\""%d\"",k);\n    return 0;\n}\n",WRONG_ANSWER,32,328
1591699773110116352,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-13 15:49:32,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n#include<stdlib.h>\nint main (){\n    int n,a,b,i,sum=0;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    int c[n],f[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&f[i]);\n    for(i=0;i<n;i++){\n   sum+=c[i]*pow(a,f[i]+1)/(f[i]+1)-c[i]*pow(b,f[i]+1)/(f[i]+1);\n    }\n      \n          printf(\""%d\\n\"",sum);\n}",WRONG_ANSWER,5,480
1591699856429953024,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-13 15:49:52,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"def clean(num,n):\n    for i in range(len(num)-1):\n        if num[i]!=num[i+1]:\n            num.pop(i)\n            num.pop(i)\n            return clean(num,n)\nprint(n-len(num),end='')\n    exit(0)\n\nn=int(input())\nb=input()\na=list(b[:n])\nclean(a,n)\n",NON_ZERO_EXIT_CODE,20,3048
1591699867091918848,86f702b052a21d7cb2f8cd933c678c21efaafaf5b2d35032f18ec35c1e26a945,2022-11-13 15:49:55,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a,b,i,sum,sum1=0,sum2=0;\n    int c[n],F[n],m[n],p[n];\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&c[i]);\n     for(i=0;i<n;i++)\n        scanf(\""%d\"",&F[i]);\n    for(i=0;i<n;i++)\n    { m[i]=c[i]/(F[i]+1)*pow(a,(F[i]+1));\n        p[i]=c[i]/(F[i]+1)*pow(b,(F[i]+1));\n       sum1=m[i]+sum1;\n       sum2=p[i]+sum2;\n    }\n    sum=sum1-sum2;\n    printf(\""%d\"",sum);\n    \n    return 0;\n}",WRONG_ANSWER,9,200
1591699971383242752,efa7a60e7fa0d7fd13e87b47555eb8bfc0c4da0695990711fb851b886de3de22,2022-11-13 15:50:20,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int i,n,j,k,max,sum;\n    scanf(\""%d\"",&n);\n    int len[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&len[i]);\n    for(j=0;j<n-1;j++){\n        for(k=0;k<n-1;k++){\n            if(len[j]==len[k]&&k-j>1&&len[j+(k-j+1)]>len[k]){\n                max=len[j];\n                sum=max*5;\n            }\n        }\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,9,356
1591699988328275968,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-13 15:50:24,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n#include<stdlib.h>\nint main (){\n    int n,a,b,i,sum=0;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    int c[n],f[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&f[i]);\n    for(i=0;i<n;i++){\n   sum+=(c[i]*pow(a,f[i]+1))/(f[i]+1)-(c[i]*pow(b,f[i]+1))/(f[i]+1);\n    }\n      \n          printf(\""%d\\n\"",sum);\n}",WRONG_ANSWER,7,196
1591700000697278464,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-13 15:50:27,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"def clean(num,n):\n    for i in range(len(num)-1):\n        if num[i]!=num[i+1]:\n            num.pop(i)\n            num.pop(i)\n            return clean(num,n)\n    print(n-len(num),end='')\n    return(0)\n\nn=int(input())\nb=input()\na=list(b[:n])\nclean(a,n)\n",NON_ZERO_EXIT_CODE,128,4856
1591700002668568576,e715137eeb4190ade2330123b989bbdd6eebd9a5e1df2e292271d3bfe3a79c69,2022-11-13 15:50:27,C,0.0,1591610585635213319,1591131955016622080,1049226928954454016,"#include<stdio.h>\nint c[10000],d[1000]={0};\nint main()\n{\n    int i,j,k,n,w=0,a,b,s;\n    scanf(\""%d\"",&n);\n    for(s=1;s<=n;s++)\n    {\n       scanf(\""%d\"",&k);\n        for(i=0;i<k;i++)\n        {\n            w=0;\n            scanf(\""%d\"",&c[i]);\n            while(c[i]-c[0]*2>=0)\n            {\n                c[i]=c[i]-c[0]*2+1;\n                w++;\n            }\n            d[s]+=w;\n        }\n    }\n    for(s=1;s<=n;s++)\n        printf(s==n?\""%d\"":\""%d\\n\"",d[s]);\n    return 0;\n}",WRONG_ANSWER,7,196
1591700044062142464,05fd79145678de5c06012db9db4333bebf8365a74fe442d12a54a9da3782fdca,2022-11-13 15:50:37,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<iostream>\n#include<math.h>\n#define N 100005\nusing namespace std;\n\n\nint main(){\n    int n,a,b;\n    int c[N];\n    int F[N];\n    int all=0;\n    cin >> n>>a>>b;\n    for(int i = 0;i<n;i++) cin >> c[i];\n    for(int i = 0;i<n;i++) cin >> F[i];\n    for(int i = 0;i<n;i++){\n        all+=((int)c[i]/(F[i]+1)*(int)pow(a,F[i]+1)) - (int)(c[i]/(F[i]+1)*(int)pow(b,F[i]+1));\n    }\n    cout<<all<<endl;\n\treturn 0;\n}\n",WRONG_ANSWER,11,492
1591700126719291392,05fd79145678de5c06012db9db4333bebf8365a74fe442d12a54a9da3782fdca,2022-11-13 15:50:57,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<iostream>\n#include<math.h>\n#define N 100005\nusing namespace std;\n\n\nint main(){\n    int n,a,b;\n    int c[N];\n    int F[N];\n    int all=0;\n    cin >> n>>a>>b;\n    for(int i = 0;i<n;i++) cin >> c[i];\n    for(int i = 0;i<n;i++) cin >> F[i];\n    for(int i = 0;i<n;i++){\n        all+=((int)(c[i]/(F[i]+1))*(int)pow(a,F[i]+1)) - (int)((c[i]/(F[i]+1))*(int)pow(b,F[i]+1));\n    }\n    cout<<all<<endl;\n\treturn 0;\n}\n",WRONG_ANSWER,6,456
1591700216917811200,05fd79145678de5c06012db9db4333bebf8365a74fe442d12a54a9da3782fdca,2022-11-13 15:51:18,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<iostream>\n#include<math.h>\n#define N 100005\nusing namespace std;\n\n\nint main(){\n    int n,a,b;\n    int c[N];\n    int F[N];\n    int all=0;\n    cin >> n>>a>>b;\n    for(int i = 0;i<n;i++) cin >> c[i];\n    for(int i = 0;i<n;i++) cin >> F[i];\n    for(int i = 0;i<n;i++){\n        all+=(((int)(c[i]/(F[i]+1))) *(int)pow(a,F[i]+1)) - ((int)((c[i]/(F[i]+1)))*(int)pow(b,F[i]+1));\n    }\n    cout<<all<<endl;\n\treturn 0;\n}\n",WRONG_ANSWER,14,512
1591700240846348288,7e6a67f270e740aba8788a12d9a49939621a28d5059d3ced2247a86914b0a3b3,2022-11-13 15:51:24,C++,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\t\n\tint a[n];\n\tint i;\n\tfor(i=0;i<n;i++)\n\t\tscanf(\""%d\"",&a[i]);\n\t\n\tint sum=0;\n\ti=0;\n\twhile(i<n)\n\t{\n\t\tif(a[i+2]>a[i]&&i<(n-3))\n\t\t{\n\t\t\tsum+=a[i+2];\n\t\t\ti+=3;\t\n\t\t} \n\t\telse \n\t\t{\n\t\t\tsum+=a[i];\n\t\t\ti++;\n\t\t}\n\t\tsum-=5;\n\t}\n\tprintf(\""%d\"",sum);\n}",WRONG_ANSWER,10,512
1591700323784482816,06b00897262b024d9e66dcd771cf81de9b63954f7a4554699d17c2158114c0d1,2022-11-13 15:51:44,Java,300.0,1591610585639407617,1591132482555211776,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner scan=new Scanner(System.in);\n\t\tint n=scan.nextInt();\n\t\tint arr[]=new int[n];\n\t\tint min=0,jmin=0,zmin=0;\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tarr[i]=scan.nextInt();\n\t\t}\n\t\tfor(int j=0;j<n;j++) {\n\t\t\tmin=arr[j];\n\t\t\tfor(int k=j;k<n;k++) {\n\t\t\t\tif(min>arr[k]) {\n\t\t\t\tmin=arr[k];\n\t\t\t\t}\n\t\t\t}\n\t\t\tzmin=min*(n-j);\n\t\t\tif(jmin<zmin) {\n\t\t\t\tjmin=zmin;\n\t\t\t}\n\t\t\tn=n-1;\n\t\t}\n\t\tSystem.out.println(jmin);\n        scan.close();\n\t}\n}\n",ACCEPTED,555,24780
1591700326041051136,64475a8ecd7d5a6c6e734f3f299283e039c26933b2a0e510cd9d22e95ba92068,2022-11-13 15:51:44,C++,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <bits/stdc++.h> \nusing namespace std;\n\nint main()\n{\n\tint n,ans = 0,d;\n\tchar a[100010];\n\tint vis[100010];\n\t\n\tcin>>n;\n\tfor(int i = 0; i < n; i++)\n\tcin>>a[i];\n\t\n\n\tfor(int i = 0; i < n; i++)\n\t{\n\t\tfor(int j = 0; j < n-1; j++)\n\t\t{\n\t\t\tif(vis[j]==1)\n\t\t\tcontinue;\n\t\t\telse\n\t\t\t{\n\t\t\t\tvis[j] = 1;\n\t\t\t\td = j;\n\t\t\t\twhile(vis[j+1]==1)\n\t\t\t\t{\n\t\t\t\t\tj++;\n                    if(j==n-1)\n                    break;\n\t\t\t\t}\n\t\t\t\tif(a[d]!=a[j-1])\n\t\t\t\t{\n\t\t\t\t\tvis[j] = 1;\n\t\t\t\t\tans+=2;\n\t\t\t\t}\n\t\t\t\telse if(a[d]==a[j])\n\t\t\t\t{\n\t\t\t\t\tvis[d] = 0;\n\t\t\t\t\tvis[j] = 0;\n\t\t\t\t}\t\n                j = d;\n\t\t\t}\n\t\t}\n\t}\n\tcout<<ans; \n\t\n\treturn 0;\n}",WRONG_ANSWER,11,636
1591700411265114112,b73a04f1a7af1c2516ca68b38e336912bdf10c4f4bf7bac55e4e0de29dcf3d9d,2022-11-13 15:52:05,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<bits/stdc++.h>\n#define N 100005\n#define endl '\\n'\n#define int long long\n#define ios ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)\n\n//const int dir[4][2]={-1,0,0,1,1,0,0,-1};\n//const int mod=1e9+7;\nusing namespace std;\n\ninline int read() {\n    char c = getchar(); int num = 0, sign = 1;\n    while(c < '0' || c > '9') {if(c == '-') sign = -1; c = getchar();}\n    while(c >= '0' && c <= '9') num = num * 10 + c - '0', c = getchar();\n    return num * sign;\n}\n\nvoid solve(){\n\tint nums[N][2];\n\tint res=0;\n\tint n,shang,xia;\n\tcin>>n>>shang>>xia;\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tcin>>nums[i][0];\n\t}\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tcin>>nums[i][1];\n\t}\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tif(nums[i][1]+1==0)\n\t\t{\n\t\t\tcontinue;\n\t\t } \n\t\t\n\t\tres+=pow(shang,nums[i][1]+1)-pow(xia,nums[i][1]+1)*nums[i][0]/(nums[i][1]+1);\n\t}\n\tcout<<res;\n}\n\nsigned main() {\n\tios;\n\tint count=1;\n\t//cin>>count;\n\twhile(count--)\n\t{\n\t\tsolve();\n\t}\n\treturn 0;\n}\n",WRONG_ANSWER,13,384
1591700440700694528,40c43472973ea298adbdd1d4b900aeb63cfa4cfe17179f01a4827cd2c6624d3a,2022-11-13 15:52:12,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int n;\n    int h[1000];\n    int i;\n    int t=0;\n    scanf(\""%d\"",&n);\n    if(n>=3&&n<=10000)\n    {\n        for(i=0;i<n;i++)\n        scanf(\""%d\"",&h[i]);\n    for(i=0;i<n-1;i++)\n    {\n        if(h[i]>h[i+1])\n            t++;\n    }\n     printf(\""%d\"",t);\n    }\n}",WRONG_ANSWER,11,456
1591700463534530560,64475a8ecd7d5a6c6e734f3f299283e039c26933b2a0e510cd9d22e95ba92068,2022-11-13 15:52:17,C++,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <bits/stdc++.h> \nusing namespace std;\n\nint main()\n{\n\tint n,ans = 0,d;\n\tchar a[100010];\n\tint vis[100010];\n\t\n\tcin>>n;\n\tfor(int i = 0; i < n; i++)\n\tcin>>a[i];\n\t\n\n\tfor(int i = 0; i < n; i++)\n\t{\n\t\tfor(int j = 0; j < n-1; j++)\n\t\t{\n\t\t\tif(vis[j]==1)\n\t\t\tcontinue;\n\t\t\telse\n\t\t\t{\n\t\t\t\tvis[j] = 1;\n\t\t\t\td = j;\n\t\t\t\twhile(vis[j+1]==1)\n\t\t\t\t{\n\t\t\t\t\tj++;\n                    if(j==n-1)\n                    break;\n\t\t\t\t}\n\t\t\t\tif(a[d]!=a[j-1])\n\t\t\t\t{\n\t\t\t\t\tvis[j-1] = 1;\n\t\t\t\t\tans+=2;\n\t\t\t\t}\n\t\t\t\telse if(a[d]==a[j-1])\n\t\t\t\t{\n\t\t\t\t\tvis[d] = 0;\n\t\t\t\t\tvis[j-1] = 0;\n\t\t\t\t}\t\n                //j = d;\n\t\t\t}\n\t\t}\n\t}\n\tcout<<ans-2; \n\t\n\treturn 0;\n}",WRONG_ANSWER,8,640
1591700480919887872,05fd79145678de5c06012db9db4333bebf8365a74fe442d12a54a9da3782fdca,2022-11-13 15:52:21,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<iostream>\n#include<math.h>\n#define N 100005\nusing namespace std;\n\n\nint main(){\n    int n,a,b;\n    int c[N];\n    int F[N];\n    int all=0;\n    cin >> n>>a>>b;\n    for(int i = 0;i<n;i++) cin >> c[i];\n    for(int i = 0;i<n;i++) cin >> F[i];\n    for(int i = 0;i<n;i++){\n        all+=(int)(((int)(c[i]/(F[i]+1))) * pow(a,F[i]+1)) - (int)((int)((c[i]/(F[i]+1)))*pow(b,F[i]+1));\n    }\n    cout<<all<<endl;\n\treturn 0;\n}\n",WRONG_ANSWER,16,476
1591700521634029568,a5291eb67188c2a916aa5dd9fc38f2e449aa9f9a3cd047f282d8c154ea2979cd,2022-11-13 15:52:31,C++,300.0,1591610585635213314,1591128862958940160,1049226928954454016,"#include <iostream>\n\nusing namespace std;\nconst int N = 1e6 + 10;\nint a[N];//用下标表示为谁的下属\nint b[N];//记录每个团队所有的人总数\n\nint main()\n{\n    int n = 0;\n    cin >> n;\n    a[1] = 0;\n    b[0] = 0;\n    for(int i = 2;i <= n;i++)\n    {\n        int input;\n        cin >> input;\n        a[i] = input;//说明第i个老师的上司是input\n    }\n    for(int i = 1;i <= n;i++)\n    {\n        int j = i;\n        while(j != 0)\n        {\n            b[j] ++;\n            j = a[j];\n        }\n    }\n    for(int i = 1;i <= n;i++)\n    {\n        cout << b[i] << \"" \"";\n    }\n    \n    return 0;\n}\n",ACCEPTED,39,632
1591700594157707264,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 15:52:48,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n    int n,a[20];\n    int i,h=0;\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(i<=n-4)\n            {if(a[i]>=a[i+1]&&a[i+2]>=a[i+1]&&a[i]!=a[i+1])\n            h++;\n            }\n    }\n    printf(\""%d\\n\"",h);\n    return 0;\n}\n\n",RUNTIME_ERROR,18,348
1591700608909074432,05fd79145678de5c06012db9db4333bebf8365a74fe442d12a54a9da3782fdca,2022-11-13 15:52:52,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<iostream>\n#include<math.h>\n#define N 100005\nusing namespace std;\n\n\nint main(){\n    long long int n,a,b;\n    long long int c[N];\n    long long int F[N];\n    long long int all=0;\n    cin >> n>>a>>b;\n    for(long long int i = 0;i<n;i++) cin >> c[i];\n    for(long long int i = 0;i<n;i++) cin >> F[i];\n    for(long long int i = 0;i<n;i++){\n        all+=(long long int)(((c[i]/(F[i]+1))) * pow(a,F[i]+1)) - (long long int)(((c[i]/(F[i]+1)))*pow(b,F[i]+1));\n    }\n    cout<<all<<endl;\n\treturn 0;\n}\n",WRONG_ANSWER,6,480
1591700621114531840,6ba5ecacf3381a1e9382f99c413290eca40a071a563a618e5f36d66cbf9a5e1b,2022-11-13 15:52:55,C++,0.0,1591610585635213319,1591131955016622080,1049226928954454016,#include<iostream>\n\nusing namespace std;\n\nint main(){\nint t;\ncin>>t;\nfor(int i=0;i<t;i++){\n    int n;\n    long count0=0;\n    cin>>n;\n    long a[n];\n    for(int j=0;j<n;j++){\n        cin>>a[j];\n    }\n    long min=a[0];\n    for(int j=1;j<n;j++){\n        if(a[j]<=min)\n            min=a[j];\n        else\n            continue;\n    }\n   for(int j=1;j<n;j++){\n    if(a[j]>=2*min)\n    {\n        a[j]=a[j]-(2*min-1);\n        count0++;\n        j=j-1;\n    }\n   }\n   cout<<count0<<endl;\n}\n\n}\n,WRONG_ANSWER,12,496
1591700647337320448,458af3c005e0b282d1ca88c254d9910ee2d93738b6f06d399f7444e1e64831eb,2022-11-13 15:53:01,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,q,i;\n    q=0;\n    scanf(\""%d\"",&a);\n    int b[100000];\n    for(i=1;i<=a;i++){\n        scanf(\""%d\"",&b[i]);\n    }\n    if(a==3){\n                if(b[1]>=5) q=q+b[1]+b[2]+b[3]-15;\n                else q=q+b[3]-5;\n            }\n    if(a==2) q=q+b[1]+b[2]-10;\n    if(a==1) q=q+b[1]-5;\n    for(i=0;i<a;){\n            b[0]=0;\n            if(a>3) {\n            if((a-i)>=3){\n                if(b[i+1]>=5){\n                    q=q+b[i+1]-5;\n                    i++;\n                }\n                if(b[i+1]<5){\n                    q=q+b[i+3]-5;\n                    i=i+3;\n                    }\n                    }\n            else\n            {\n                q=q+b[i+1]-5;\n                i++;\n            }\n            }\n    }\n\n    printf(\""%d\"",q);\n    return 0;\n}",WRONG_ANSWER,8,484
1591700731961597952,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-13 15:53:21,Java,0.0,1591610585635213319,1591131955016622080,1049226928954454016,"import java.util.Scanner;\npublic class Main {\n    public static void main(String []args) {\n        int t;\n        Scanner scanner=new Scanner(System.in); \n        int n,b;\n        int a[]=new int[100000];\n        int key =0;\n        int qie=0;\n        t=scanner.nextInt();\n        for(int l=0;l<t;l++){\n            key =0;\n            qie=0;\n        n=scanner.nextInt();\n        for(int i=0;i<n;i++){\n            a[i]=scanner.nextInt();\n        }\n        for(int i=1;i<n;i++){\n            for(int j=i;j<n;j++){\n                if(a[j]<a[j-1])\n                {\n                    b=a[j-1];\n                    a[j-1]=a[j];\n                    a[j]=b;\n                }\n            }\n         \n        }\n        if(n==1)\n            System.out.println(\""0\"");\n        else\n        {\n            for(int i=1;i<n;i++){\n                do{\n                    key=0;\n                    if(a[i]<=a[0]*2-1)\n                        key++;\n                    else{\n                        a[i]=a[i]-a[0]*2+1;\n                        qie++;\n                    }\n                }while(key<1);\n            }\n                    System.out.println(qie);\n        }\n        }\n       \n    }\n}",WRONG_ANSWER,193,32340
1591700747786674176,e807496cefc8b76d55101108daa4cb8e59f87dde49b8197bd619e8a84563990e,2022-11-13 15:53:25,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<bits/stdc++.h> \nusing namespace std;\nconst int n=100;\nint arr[n];\nint main()\n{\n\tint n,m;\n\tint sum=0;\n\tscanf(\""%d\"",&n);\n\tfor(int i=0;i<n;i++){\n\t\tscanf(\""%d\"",&arr[i]);\n\t}\n\tfor(int j=1;j<n;j++){\n\t\tif(arr[j]!=arr[j+1]){\n\t\t\tif(arr[j]<arr[j+1]&&arr[j]<arr[j-1]){\n\t\t\t\tsum++;\n\t\t\t}\n\t\t}\n\t\telse if(arr[j]==arr[j+1]){\n\t\t\tif(arr[j]<arr[j-1]&&arr[j]<arr[j+2]){\n\t\t\t\tsum++;\n\t\t\t}\n\t\t}\t\t\n\t}\n\tprintf(\""%d\\n\"",sum);\n\treturn 0;\n}",WRONG_ANSWER,63,640
1591700752505266176,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-13 15:53:26,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main(){\n\tint n,i,sum=0;\n\tscanf(\""%d\"",&n);\n\tint a[n],b[n];\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n        b[i]=a[i]-5\n\t}\n\tfor(i=0;i<n;i++){\n\t\tif(b[i]<b[i+2]&&(n-1-i)>=3) {\n\t\t\tsum+=a[i+2]-5;\n\t\t\ti=i+2;\n\t\t}\n\t\tif(b[i]>b[i+2]||(b[i]+b[i+1])>=b[i+2]) sum+=a[i]-5;\n\t}\n\tprintf(\""%d\\n\"",sum);\n}\n",COMPILE_ERROR,0,0
1591700775074816000,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-13 15:53:31,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main(){\n\tint n,i;\n\tlong long int a[100000]={0};\n\tscanf(\""%d\"",&n);\n\tint max=0;\n\tint sum1,sum2;\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=0;i<n;i++){\n\t\tsum1=0;\n\t\tsum2=0;\n\t\tsum1=a[i]-5;\n\t\tsum2=a[i+2]-5;\n\t\tif(sum1>sum2){\n\t\t\tmax+=sum1;\n\t\t}else{\n\t\t\tmax+=sum2;\n\t\t\ti=i+2;\n\t\t}\n\t}\n\tprintf(\""%d\\n\"",max);\n    return 0;\n}",WRONG_ANSWER,6,1408
1591700835246301184,05fd79145678de5c06012db9db4333bebf8365a74fe442d12a54a9da3782fdca,2022-11-13 15:53:46,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<iostream>\n#include<math.h>\n#define N 100005\nusing namespace std;\n\n\nint main(){\n    long long int n,a,b;\n    long long int c[N];\n    long long int F[N];\n    long long int all=0;\n    cin >> n>>a>>b;\n    for(long long int i = 0;i<n;i++) cin >> c[i];\n    for(long long int i = 0;i<n;i++) cin >> F[i];\n    for(long long int i = 0;i<n;i++){\n        all+=(((int)(c[i]/(F[i]+1))+1) * pow(a,F[i]+1)) - (long long int)(((int)(c[i]/(F[i]+1))+1)*pow(b,F[i]+1));\n    }\n    cout<<all<<endl;\n\treturn 0;\n}\n",WRONG_ANSWER,17,640
1591700887633158144,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-13 15:53:58,C++,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\n#define N 10000\n\n\nint pand(char *a,int i,int n)\n{\n    int b,c;\n    a[i]=a[i+2];\n    a[i+1]=a[i+3];\n    i++;\n    if(i<n) pand(a,i,n);\n    else return 0;\n\n}\n\n\n\n\n\n\nint main()\n{\n    char a[10000];\n    int n,i,j,k,l,zq,len;\n    j=0;\n    scanf(\""%d\"",&n);\n    scanf(\""%s\"",&a);\n    len=int(strlen(a));\n    \n    a[n]='\\0';\n    //printf(\""%d\\n\"",len);\n    for(l=0;l<n;l++){\n        if(a[l]=='0'||a[l]=='1') zq=1;\n        else {zq=0;\n             break;}\n        //printf(\""%d\"",zq);\n    }\n    //printf(\""%d\"",zq);\n    if(zq==1){if(len==n){\n    for(l=0;l<n;l++){\n    for(i=0;i<n;i++)\n    {\n        if(n==1) break;\n        if(n==2&&a[0]!=a[1]) {j+=2;\n                              n-=2;\n        }\n        //pand(a,0,2);\n        \n        k=i;\n        if(i>=0&&a[i]!=a[i+1]&&i<=n-1&&n>2)\n            {\n//printf(\""%s\\n,n=%d\\n\"",a,n);\n            if(n>0){\n            pand(a,i,n);\n            n-=2;\n            j+=2;\n            }\n\n            }\n\n    }\n    }//printf(\""!%s\"",a);\n\nprintf(\""%d\\n\"",j);\n\n    }\n             }\n\n\n    return 0;\n}",SEGMENTATION_FAULT,51,512
1591700948349890560,e715137eeb4190ade2330123b989bbdd6eebd9a5e1df2e292271d3bfe3a79c69,2022-11-13 15:54:13,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint a[1000000]={0},d[1000000];\nint main()\n{\n    int i,j=0,k=1,n,b=0,c=1,w=0;\n    scanf(\""%d\"",&n);\n    k=n;\n    for(i=1;i<=n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=1;j<=n;j++)\n    {\n        k=1;\n        w=0;\n        \n   for(i=j;i<=n;i++)\n    {\n       \n       \n       \n       if(a[i]<a[j])\n       {\n           d[b]=w;\n           b++;\n           k=0;\n           break;\n       }  \n       w+=a[j];\n    }\n        if(k)\n        {\n            d[b]=w;\n           b++;\n        }\n    }\n    w=d[0];\n    for(i=0;i<b;i++)\n    {\n        if(w<d[i])\n            w=d[i];\n    }\n    printf(\""%d\\n\"",w);\n    return 0;\n        \n}",WRONG_ANSWER,20,384
1591700972446167040,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-13 15:54:18,Python,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"a=int(input())\ndata=list(map(int,input().split()))\ncount=0\ndatas=[]\nc=0\nfor i in range(0,a):\n    if len(datas)==0:\n       datas.append(data[i])\n    \n    if c!=1 and datas[len(datas)-1]>= data[i]:\n        datas.append(data[i])\n    if c!=1 and datas[len(datas)-1]< data[i]:\n        datas=[data[i]]\n        print(i)\n        count+=1\n    if datas[len(datas)-1]<data[i] and c==0:\n        c+=1\n        datas.append(data[i])\nprint(count-1)\n",WRONG_ANSWER,20,3100
1591700982420234240,6ba5ecacf3381a1e9382f99c413290eca40a071a563a618e5f36d66cbf9a5e1b,2022-11-13 15:54:21,C++,0.0,1591610585635213319,1591131955016622080,1049226928954454016,#include<iostream>\n\nusing namespace std;\n\nint main(){\nint t;\ncin>>t;\nfor(int i=0;i<t;i++){\n    int n;\n    long count0=0;\n    cin>>n;\n    long a[n];\n    for(int j=0;j<n;j++){\n        cin>>a[j];\n    }\n    long min=a[0];\n    for(int j=1;j<n;j++){\n        if(a[j]<=min)\n            min=a[j];\n        else\n            continue;\n    }\n   for(int j=1;j<n;j++){\n    if(a[j]>=2*min)\n    {\n        a[j]=a[j]-(2*min-1);\n        count0++;\n        j=j-1;\n    }\n   }\n    if(i!=t-1)\n   cout<<count0<<endl;\n    else\n        cout<<count0;\n}\n\n}\n,WRONG_ANSWER,7,504
1591700986161541120,e807496cefc8b76d55101108daa4cb8e59f87dde49b8197bd619e8a84563990e,2022-11-13 15:54:22,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<bits/stdc++.h> \nusing namespace std;\nconst int n=50;\nint arr[n];\nint main()\n{\n\tint n,m;\n\tint sum=0;\n\tscanf(\""%d\"",&n);\n\tfor(int i=0;i<n;i++){\n\t\tscanf(\""%d\"",&arr[i]);\n\t}\n\tfor(int j=1;j<n;j++){\n\t\tif(arr[j]!=arr[j+1]){\n\t\t\tif(arr[j]<arr[j+1]&&arr[j]<arr[j-1]){\n\t\t\t\tsum++;\n\t\t\t}\n\t\t}\n\t\telse if(arr[j]==arr[j+1]){\n\t\t\tif(arr[j]<arr[j-1]&&arr[j]<arr[j+2]){\n\t\t\t\tsum++;\n\t\t\t}\n\t\t}\t\t\n\t}\n\tprintf(\""%d\\n\"",sum);\n\treturn 0;\n}",WRONG_ANSWER,51,480
1591701021746061312,5d7d397496e2400ea10e8ecafd4566e19d1083215d66cad8e11230c22227362c,2022-11-13 15:54:30,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <bits/stdc++.h>\n\nusing namespace std;\nconst int N=1e5+10;\ntypedef long long ll;\nint n,a,b,c[N],f[N],res;\nvoid solve()\n{\n    res=0;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    for(int i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&c[i]);\n    }\n    for(int i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&f[i]);\n    }\n     for(int i=0;i<n;i++)\n     {\n         res+=pow(a,f[i]+1)*c[i]/(f[i]+1)-pow(b,f[i]+1)*c[i]/(f[i]+1);\n     }\n     printf(\""%d\"",res);\n}\nint main()\n{\n    solve();\n    return 0;\n}\n",WRONG_ANSWER,13,628
1591701069334601728,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-13 15:54:41,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<string>\n#include<string.h>\n\nint main(){\n\tint n,i,k,sum=0;\n\tscanf(\""%d\"",&n);\n\tgetchar();\n\tchar a[n];\n\tfor(i=0;i<n;i++)\n\tscanf(\""%c\"",&a[i]);\n\tgetchar();\n\tint a1=0,a0=0,temp=0;\n\tfor(i=0;i<n;i++){\n\t\tif(a[i]=='0') a0++;\n\t\tif(a[i]=='1') a1++;\n\t\t\n\t} \n\tif(a0>=a1) temp=a1;\n\telse temp=a0;\n   printf(\""%d\\n\"",temp*2);\n}\n",COMPILE_ERROR,0,0
1591701093741256704,7c6d208c4c4b695bc8d6f8ae0c0357c2466f5c9f86ec0652674812219ac09d38,2022-11-13 15:54:47,Java,300.0,1591610585639407617,1591132482555211776,1049226928954454016,import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt();\n\t    int[] arr = new int[a];\n\t    int[] brr = new int[a];\n\t    for (int i = 0; i < a; i++) {\n\t\t\tint b = sc.nextInt();\n\t\t\tarr[i] = b;\n\t\t}\n\t    for (int i = 0; i < a; i++) {\n\t\t\tint count = 1;\n\t\t\tfor (int j = i+1; j < a; j++) {\n\t\t\t\tif (arr[j]>=arr[i]) {\n\t\t\t\t\tcount++;\n\t\t\t\t}else {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (int j = i-1; j >=0; j--) {\n\t\t\t\tif (arr[j]>=arr[i]) {\n\t\t\t\t\tcount++;\n\t\t\t\t}else {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tbrr[i] = arr[i]*count;\n\t\t}\n\t    int max = 0;\n\t    for (int i = 0; i < brr.length; i++) {\n\t\t\tif (brr[i]>max) {\n\t\t\t\tmax = brr[i];\n\t\t\t}\n\t\t}\n\t    System.out.println(max);\n\t \n\t\t\n\t}\n\n},ACCEPTED,578,24856
1591701106298990592,40c43472973ea298adbdd1d4b900aeb63cfa4cfe17179f01a4827cd2c6624d3a,2022-11-13 15:54:50,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int n;\n    int h[10];\n    int i;\n    int t=0;\n    scanf(\""%d\"",&n);\n    if(n>=3&&n<=10000)\n    {\n        for(i=0;i<n;i++)\n        scanf(\""%d\"",&h[i]);\n    for(i=0;i<n-2;i++)\n    {\n        if(h[i]>h[i+1])\n            t++;\n    }\n     printf(\""%d\"",t);\n    }\n}",RUNTIME_ERROR,12,340
1591701123730518016,6a4a105e99255cc39ebb6a122c9fdf740e574dbb708100363b339265f92e1bbf,2022-11-13 15:54:54,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n,i,x;\n    scanf(\""%d\"",&n);\n    int A[n];\n    for(i=1;i<=n;i++){\n        scanf(\""%d\"",&A[i]);\n    }\n    for(i=1;i<=n;i++){\n    for(x=0;x<i;){\n            if(A[i+1]<=A[i]){\n                x++;\n            }\n    }\n    printf(\""%d\"",x);\n}",COMPILE_ERROR,0,0
1591701141774426112,40c43472973ea298adbdd1d4b900aeb63cfa4cfe17179f01a4827cd2c6624d3a,2022-11-13 15:54:59,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int n;\n    int h[10];\n    int i;\n    int t=0;\n    scanf(\""%d\"",&n);\n    if(n>=3&&n<=10000)\n    {\n        for(i=0;i<n;i++)\n        scanf(\""%d\"",&h[i]);\n    for(i=0;i<n-2;i++)\n    {\n        if(h[i]>h[i+1])\n            t++;\n    }\n     printf(\""%d\"",t);\n    }\n}",RUNTIME_ERROR,9,336
1591701159344365568,1f29a576db974352c60cbe8aafdc4e5328b24d800890ab1c712d8c9fa85d72cc,2022-11-13 15:55:03,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint i,add[n];\n\tfor(i=1;i<=n;i++)\n\tscanf(\""%d\"",&add[i]);\n\tint real[n];\n\tfor(i=1;i<=n;i++)\treal[i]=add[i]-5;\n\t//for(i=0;i<n;i++)\n\t//printf(\""%6d\"",real[i]);\n\tint sum=0;\n\tfor(i=1;i<=n;i++)\n\t{\n\t\tif(real[i]>0) sum=sum+real[i];\n\t\tif(real[i]<real[i+3]&&real[i+3]<0) i=i+3;\n\t}\n\tprintf(\""%d\"",sum);\n\treturn 0;\n } ",WRONG_ANSWER,9,352
1591701160808210432,bd8243b4b064cae986196b0eac310a36f12d46dc08f126fbdcaaca530c884eb0,2022-11-13 15:55:03,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int m,i,p,q,h=1;\n    int k=0,s=1,b=1;\n    int a[1000];\n    scanf(\""%d\"",&m);\n    for(i=0;i<m;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n\n\n\n    for(p=1,q=2;q<m;p++,q++)\n    {\n        if(a[p]>a[q])\n            s=666;\n        else if(a[p]<a[q])\n            b=555;\n            if(a[p]==a[q])\n              h=444;   \n        if(s==666&&b==555)\n            {\n                k++;\n                s=1;\n                b=1;\n            }\n    }\n    printf(\""%d\"",k);\n    return 0;\n}\n",WRONG_ANSWER,15,348
1591701168118837248,6a4a105e99255cc39ebb6a122c9fdf740e574dbb708100363b339265f92e1bbf,2022-11-13 15:55:05,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n,i,x;\n    scanf(\""%d\"",&n);\n    int A[n];\n    for(i=1;i<=n;i++){\n        scanf(\""%d\"",&A[i]);\n    }\n    for(i=1;i<=n;i++){\n    for(x=0;x<i;){\n            if(A[i+1]<=A[i]){\n                x++;\n            }\n    }\n    printf(\""%d\"",x);\n}",COMPILE_ERROR,0,0
1591701176570404864,40c43472973ea298adbdd1d4b900aeb63cfa4cfe17179f01a4827cd2c6624d3a,2022-11-13 15:55:07,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int n;\n    int h[100];\n    int i;\n    int t=0;\n    scanf(\""%d\"",&n);\n    if(n>=3&&n<=10000)\n    {\n        for(i=0;i<n;i++)\n        scanf(\""%d\"",&h[i]);\n    for(i=0;i<n-2;i++)\n    {\n        if(h[i]>h[i+1])\n            t++;\n    }\n     printf(\""%d\"",t);\n    }\n}",WRONG_ANSWER,12,348
1591701207843090432,40c43472973ea298adbdd1d4b900aeb63cfa4cfe17179f01a4827cd2c6624d3a,2022-11-13 15:55:14,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int n;\n    int h[10];\n    int i;\n    int t=0;\n    scanf(\""%d\"",&n);\n    if(n>=3&&n<=10000)\n    {\n        for(i=0;i<n;i++)\n        scanf(\""%d\"",&h[i]);\n    for(i=0;i<n-2;i++)\n    {\n        if(h[i]>h[i+1])\n            t++;\n    }\n     printf(\""%d\"",t);\n    }\n}",RUNTIME_ERROR,5,220
1591701222103769088,e807496cefc8b76d55101108daa4cb8e59f87dde49b8197bd619e8a84563990e,2022-11-13 15:55:18,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<bits/stdc++.h> \nusing namespace std;\nconst int n=50;\nint arr[n];\nint main()\n{\n\tint n,m;\n\tint sum=0;\n\tscanf(\""%d\"",&n);\n\tfor(int i=0;i<n;i++){\n\t\tscanf(\""%d\"",&arr[i]);\n\t}\n\tfor(int j=2;j<n;j++){\n\t\tif(arr[j]!=arr[j+1]){\n\t\t\tif(arr[j]<arr[j+1]&&arr[j]<arr[j-1]){\n\t\t\t\tsum++;\n\t\t\t}\n\t\t}\n\t\telse if(arr[j]==arr[j+1]){\n\t\t\tif(arr[j]<arr[j-1]&&arr[j]<arr[j+2]){\n\t\t\t\tsum++;\n\t\t\t}\n\t\t}\t\t\n\t}\n\tprintf(\""%d\\n\"",sum);\n\treturn 0;\n}",WRONG_ANSWER,44,640
1591701224859394048,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-13 15:55:19,C,300.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<string.h>\n\nint main(){\n\tint n,i,k,sum=0;\n\tscanf(\""%d\"",&n);\n\tgetchar();\n\tchar a[n];\n\tfor(i=0;i<n;i++)\n\tscanf(\""%c\"",&a[i]);\n\tgetchar();\n\tint a1=0,a0=0,temp=0;\n\tfor(i=0;i<n;i++){\n\t\tif(a[i]=='0') a0++;\n\t\tif(a[i]=='1') a1++;\n\t\t\n\t} \n\tif(a0>=a1) temp=a1;\n\telse temp=a0;\n   printf(\""%d\\n\"",temp*2);\n}\n",ACCEPTED,40,496
1591701235949166592,bd8243b4b064cae986196b0eac310a36f12d46dc08f126fbdcaaca530c884eb0,2022-11-13 15:55:21,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int m,i,p,q,h=1;\n    int k=0,s=1,b=1;\n    int a[1000];\n    scanf(\""%d\"",&m);\n    for(i=0;i<m;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n\n\n\n    for(p=1,q=2;q<m;p++,q++)\n    {\n        if(a[p]>a[q])\n            s=666;\n        else if(a[p]<a[q])\n            b=555;\n            if(a[p]==a[q])\n              h=444;   \n        if(s==666&&b==555)\n            {\n                k++;\n                s=1;\n                b=1;\n            }\n    }\n    printf(\""%d\\n\"",k);\n    return 0;\n}\n",WRONG_ANSWER,7,200
1591701298746286080,40c43472973ea298adbdd1d4b900aeb63cfa4cfe17179f01a4827cd2c6624d3a,2022-11-13 15:55:36,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int n;\n    int h[20];\n    int i;\n    int t=0;\n    scanf(\""%d\"",&n);\n    if(n>=3&&n<=10000)\n    {\n        for(i=0;i<n;i++)\n        scanf(\""%d\"",&h[i]);\n    for(i=0;i<n-2;i++)\n    {\n        if(h[i]>h[i+1])\n            t++;\n    }\n     printf(\""%d\"",t);\n    }\n}",WRONG_ANSWER,6,328
1591701334783713280,7e6a67f270e740aba8788a12d9a49939621a28d5059d3ced2247a86914b0a3b3,2022-11-13 15:55:45,C++,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\t\n\tint a[n];\n\tint i;\n\tfor(i=0;i<n;i++)\n\t\tscanf(\""%d\"",&a[i]);\n\t\n\tint sum=0;\n\ti=0;\n\twhile(i<n)\n\t{\n\t\tif(a[i+2]>a[i]&&i<(n-1))\n\t\t{\n\t\t\tsum+=a[i+2];\n\t\t\ti+=3;\t\n\t\t} \n\t\telse \n\t\t{\n\t\t\tsum+=a[i];\n\t\t\ti++;\n\t\t}\n\t\tsum-=5;\n\t}\n\tprintf(\""%d\"",sum);\n}",WRONG_ANSWER,6,616
1591701346339053568,5d7d397496e2400ea10e8ecafd4566e19d1083215d66cad8e11230c22227362c,2022-11-13 15:55:48,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <bits/stdc++.h>\n\nusing namespace std;\nconst int N=1e5+10;\ntypedef long long ll;\nint n,a,b,c[N],f[N];\ndouble res;\nvoid solve()\n{\n    res=0;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    for(int i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&c[i]);\n    }\n    for(int i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&f[i]);\n    }\n     for(int i=0;i<n;i++)\n     {\n         res+=pow(a,f[i]+1)*c[i]/(f[i]+1)-pow(b,f[i]+1)*c[i]/(f[i]+1);\n     }\n     printf(\""%d\"",res);\n}\nint main()\n{\n    solve();\n    return 0;\n}\n",WRONG_ANSWER,6,452
1591701371110580224,b73a04f1a7af1c2516ca68b38e336912bdf10c4f4bf7bac55e4e0de29dcf3d9d,2022-11-13 15:55:53,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<bits/stdc++.h>\n#define N 100005\n#define endl '\\n'\n#define int long long\n#define ios ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)\n\n//const int dir[4][2]={-1,0,0,1,1,0,0,-1};\n//const int mod=1e9+7;\nusing namespace std;\n\ninline int read() {\n    char c = getchar(); int num = 0, sign = 1;\n    while(c < '0' || c > '9') {if(c == '-') sign = -1; c = getchar();}\n    while(c >= '0' && c <= '9') num = num * 10 + c - '0', c = getchar();\n    return num * sign;\n}\n\nvoid solve(){\n\tint nums[N][2];\n\tint res=0;\n\tint n,shang,xia;\n\tcin>>n>>shang>>xia;\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tcin>>nums[i][0];\n\t}\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tcin>>nums[i][1];\n\t}\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tif(nums[i][1]+1==0)\n\t\t{\n\t\t\tres+=shang-xia;\n\t\t\tcontinue;\n\t\t } \n\t\t\n\t\tres+=pow(shang,nums[i][1]+1)-pow(xia,nums[i][1]+1)*nums[i][0]/(nums[i][1]+1);\n\t}\n\tcout<<res;\n}\n\nsigned main() {\n\tios;\n\tint count=1;\n\t//cin>>count;\n\twhile(count--)\n\t{\n\t\tsolve();\n\t}\n\treturn 0;\n}\n",WRONG_ANSWER,9,324
1591701400424558592,7e6a67f270e740aba8788a12d9a49939621a28d5059d3ced2247a86914b0a3b3,2022-11-13 15:56:00,C++,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\t\n\tint a[n];\n\tint i;\n\tfor(i=0;i<n;i++)\n\t\tscanf(\""%d\"",&a[i]);\n\t\n\tint sum=0;\n\ti=0;\n\twhile(i<n)\n\t{\n\t\tif(a[i+2]>a[i]&&i<(n-3))\n\t\t{\n\t\t\tsum+=a[i+2];\n\t\t\ti+=3;\t\n\t\t} \n\t\telse \n\t\t{\n\t\t\tsum+=a[i];\n\t\t\ti++;\n\t\t}\n\t\tsum-=5;\n\t}\n\tprintf(\""%d\"",sum);\n}",WRONG_ANSWER,10,328
1591701434285187072,d4c94290401b65ee2ce02056ca325b624120f06a8f67557b729453a418b199fe,2022-11-13 15:56:08,C++,300.0,1591610585635213319,1591131955016622080,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nconst int N=1e5;\n\nint n,count1=0,a[N],t,x,y,sum=0x7fffffff,z;\nstring str;\nint main(){\n\tcin>>t;\n\twhile(t--){\n\tcin>>n;\n\tfor(int i=0;i<n;i++){\n\t\tcin>>a[i];\n\t}\n\tsort(a,a+n);\n\tsum=0;\n\tfor(int i=1;i<n;i++){\n\t\tsum+=a[i]/(a[0]*2-1)-1;\n\t\tif(a[i]%(a[0]*2-1)!=0){\n\t\t\tsum++;\n\t\t}\n//\t\tcout<<sum<<endl;\n\t}\n\tcout<<sum<<endl;\n\tmemset(a,0,sizeof a);\n}\n} ",ACCEPTED,43,888
1591701470821801984,05fd79145678de5c06012db9db4333bebf8365a74fe442d12a54a9da3782fdca,2022-11-13 15:56:17,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<iostream>\n#include<math.h>\n#define N 100005\nusing namespace std;\n\n\nint main(){\n    int n,a,b;\n    int c[N];\n    int F[N];\n    int all=0;\n    cin >> n>>a>>b;\n\n    for(int i = 0;i<n;i++){\n        cin >> c[i];\n    }\n    for(int i = 0;i<n;i++){\n        cin >> F[i];\n    }\n    for(int i = 0;i<n;i++){\n        floor\n        all+=(ceil(c[i]/(F[i]+1))*(int)pow(a,F[i]+1)) - (ceil(c[i]/(F[i]+1))*(int)pow(b,F[i]+1));\n    }\n\n    cout<<all;\n\treturn 0;\n}\n",COMPILE_ERROR,0,0
1591701498894233600,e807496cefc8b76d55101108daa4cb8e59f87dde49b8197bd619e8a84563990e,2022-11-13 15:56:24,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<bits/stdc++.h> \nusing namespace std;\nconst int n=50;\nint arr[n];\nint main()\n{\n\tint n;\n\tint sum=0;\n\tscanf(\""%d\"",&n);\n\tfor(int i=0;i<n;i++){\n\t\tscanf(\""%d\"",&arr[i]);\n\t}\n\tfor(int j=2;j<n;j++){\n\t\tif(arr[j]!=arr[j+1]){\n\t\t\tif(arr[j]<arr[j+1]&&arr[j]<arr[j-1]){\n\t\t\t\tsum++;\n\t\t\t}\n\t\t}\n\t\telse if(arr[j]==arr[j+1]){\n\t\t\tif(arr[j]<arr[j-1]&&arr[j]<arr[j+2]){\n\t\t\t\tsum++;\n\t\t\t}\n\t\t}\t\t\n\t}\n\tprintf(\""%d\\n\"",sum);\n\treturn 0;\n}",WRONG_ANSWER,43,636
1591701510210465792,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-13 15:56:27,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<string.h>\n\nint main(){\n\tint n,i,k,sum=0;\n\tscanf(\""%d\"",&n);\n\tgetchar();\n\tchar b[n];\n\tfor(i=0;i<n;i++)\n\tscanf(\""%c\"",&a[i]);\n\tgetchar();\n\tint a1=0,a2=0,temp=0;\n\tfor(i=0;i<n;i++){\n\t\tif(b[i]=='0') a2++;\n\t\tif(b[i]=='1') a1++;\n\t\t\n\t} \n\tif(a2>=a1) temp=a1;\n\telse temp=a2;\n   printf(\""%d\\n\"",temp*2);\n}\n",COMPILE_ERROR,0,0
1591701539792936960,40c43472973ea298adbdd1d4b900aeb63cfa4cfe17179f01a4827cd2c6624d3a,2022-11-13 15:56:34,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int n;\n    int h[20];\n    int i;\n    int t=0;\n    scanf(\""%d\"",&n);\n    if(n>=3&&n<=10000)\n    {\n        for(i=0;i<n;i++)\n        scanf(\""%d\"",&h[i]);\n    for(i=1;i<n-2;i++)\n    {\n        if(h[i]>h[i+1])\n            t++;\n    }\n     printf(\""%d\"",t);\n    }\n}",WRONG_ANSWER,8,348
1591701599565930496,0ccbaaa612b3d01dbe621ce5e7366d6e26d2e5adf55047d92c6eb7adf78a979d,2022-11-13 15:56:48,Java,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tint []c = new int[n];\n\t\tint []f = new int[n];\n\t\tfor(int i=0;i<n;i++)\n\t\t\tc[i]=sc.nextInt();\n\t\tfor(int i=0;i<n;i++)\n\t\t\tf[i]=sc.nextInt();\n\t\tdouble suma=0;\n\t\tdouble sumb=0;\n\t\tfor(int i=0;i<n;i++)\n\t\t{\n\t\t\tsuma+=(c[i]/(f[i]+1))*Math.pow(a,f[i]+1);\n\t\t\tsumb+=(c[i]/(f[i]+1))*Math.pow(b,f[i]+1);\n\t\t}\n\t\tSystem.out.println((int)(suma-sumb));\n\t}\n}\n",WRONG_ANSWER,103,24192
1591701624782073856,6ba5ecacf3381a1e9382f99c413290eca40a071a563a618e5f36d66cbf9a5e1b,2022-11-13 15:56:54,C++,0.0,1591610585635213319,1591131955016622080,1049226928954454016,#include<iostream>\n\nusing namespace std;\n\nint main(){\nint t;\ncin>>t;\nfor(int i=0;i<t;i++){\n    int n;\n    long count0=0;\n    cin>>n;\n    long a[n];\n    for(int j=0;j<n;j++){\n        cin>>a[j];\n    }\n    long min=a[0];\n   for(int j=1;j<n;j++){\n    if(a[j]>=2*min)\n    {\n        a[j]=a[j]-(2*min-1);\n        count0++;\n        j=j-1;\n    }\n   }\n   if(i!=t-1)\n   cout<<count0<<endl;\n    else\n        cout<<count0;\n}\n\n}\n,WRONG_ANSWER,10,608
1591701646718328832,6933dcb3592e2d6f6fc887ed9a5537aab21a30f76450c9b5043f7776bfc39a59,2022-11-13 15:56:59,C,0.0,1591610585635213319,1591131955016622080,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint play(int i,int weight){\n    int temp=0;\n    while(weight<i*i){\n        temp++;\n        weight=weight/2;\n    }\n}\nint main(){\n    int n,i,x,j,temp;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&x);\n        for(j=0,temp=0;j<x;j++){\n            scanf(\""%d\"",&weight);\n            temp=temp+play(weight);\n        }\n        printf(\""%d\"",temp);\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1591701671133327360,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-13 15:57:05,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<string.h>\n\nint main(){\n\tint n,i,k,sum=0;\n\tscanf(\""%d\"",&n);\n\tgetchar();\n\tchar a[n];\n\tfor(i=0;i<n;i++)\n\tscanf(\""%c\"",&a[i]);\n\tgetchar();\n\tint a1=0,a0=0,k=0;\n\tfor(i=0;i<n;i++){\n\t\tif(a[i]=='0') a0++;\n\t\tif(a[i]=='1') a1++;\n\t\t\n\t} \n\tif(a0>=a1) k=a1;\n\telse k=a0;\n   printf(\""%d\\n\"",k*2);\n}\n",COMPILE_ERROR,0,0
1591701699335839744,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-13 15:57:12,Java,0.0,1591610585635213319,1591131955016622080,1049226928954454016,"import java.util.Scanner;\npublic class Main {\n    public static void main(String []args) {\n        int t;\n        Scanner scanner=new Scanner(System.in); \n        int n,b;\n        int a[]=new int[100000];\n        int key =0;\n        int qie=0;\n        t=scanner.nextInt();\n        for(int l=0;l<t;l++){\n            key =0;\n            qie=0;\n        n=scanner.nextInt();\n        for(int i=0;i<n;i++){\n            a[i]=scanner.nextInt();\n        }\n        for(int i=1;i<n;i++){\n            for(int j=i;j<n;j++){\n                if(a[j]<a[j-1])\n                {\n                    b=a[j-1];\n                    a[j-1]=a[j];\n                    a[j]=b;\n                }\n            }\n         \n        }\n        if(n==1)\n            System.out.print(\""0\"");\n        else\n        {\n            for(int i=1;i<n;i++){\n                do{\n                    key=0;\n                    if(a[i]<=a[0]*2-1)\n                        key++;\n                    else{\n                        a[i]=a[i]-a[0]*2+1;\n                        qie++;\n                    }\n                }while(key<1);\n            }\n                    System.out.print(qie);\n        }\n            if(l!=t-1)\n                System.out.println();\n        }\n       \n    }\n}",WRONG_ANSWER,205,33412
1591701761591894016,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-13 15:57:27,Java,0.0,1591610585635213319,1591131955016622080,1049226928954454016,"import java.util.Scanner;\npublic class Main {\n    public static void main(String []args) {\n        int t;\n        Scanner scanner=new Scanner(System.in); \n        int n,b;\n        int a[]=new int[100000];\n        int key =0;\n        int qie=0;\n        t=scanner.nextInt();\n        for(int l=0;l<t;l++){\n            key =0;\n            qie=0;\n        n=scanner.nextInt();\n        for(int i=0;i<n;i++){\n            a[i]=scanner.nextInt();\n        }\n        for(int i=1;i<n;i++){\n            for(int j=i;j<n;j++){\n                if(a[j]<a[j-1])\n                {\n                    b=a[j-1];\n                    a[j-1]=a[j];\n                    a[j]=b;\n                }\n            }\n         \n        }\n        if(n==1)\n            System.out.print(0);\n        else\n        {\n            for(int i=1;i<n;i++){\n                do{\n                    key=0;\n                    if(a[i]<=a[0]*2-1)\n                        key++;\n                    else{\n                        a[i]=a[i]-a[0]*2+1;\n                        qie++;\n                    }\n                }while(key<1);\n            }\n                    System.out.print(qie);\n        }\n            if(l!=t-1)\n                System.out.println();\n        }\n       \n    }\n}",WRONG_ANSWER,195,33436
1591701805153968128,e715137eeb4190ade2330123b989bbdd6eebd9a5e1df2e292271d3bfe3a79c69,2022-11-13 15:57:37,C,0.0,1591610585635213319,1591131955016622080,1049226928954454016,"#include<stdio.h>\nint c[10000],d[1000]={0};\nint main()\n{\n    int i,j,k,n,w=0,a,b,s;\n    scanf(\""%d\"",&n);\n    for(s=1;s<=n;s++)\n    {\n       scanf(\""%d\"",&k);\n        for(i=0;i<k;i++)\n        {\n            w=0;\n            scanf(\""%d\"",&c[i]);\n            while(c[i]-c[0]*2>=0)\n            {\n                c[i]=c[i]-c[0]*2;\n                w++;\n            }\n            d[s]+=w;\n        }\n    }\n    for(s=1;s<=n;s++)\n        printf(s==n?\""%d\"":\""%d\\n\"",d[s]);\n    return 0;\n}",WRONG_ANSWER,12,352
1591701842202255360,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-13 15:57:46,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include<math.h>\nint main()\n{\n    int n,a,b,k,j,i,sum,h,m,f;\n    float sum1=0,sum2=0;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    int c[n],d[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&c[i]);\n    for(k=0;k<n;k++)\n        scanf(\""%d\"",&d[n]);\n    for(j=0;j<n;j++)\n    {\n        m=(c[j]/(d[j]+1));\n         sum1+=m*pow(a,(d[j]+1));\n    }\n    for(h=0;h<n;h++)\n    {\n        f=c[h]/(d[h]+1);\n         sum2+=f*pow(b,(d[h]+1));\n    }\n    sum=sum1-sum2;\n    printf(\""%d\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,19,328
1591701879305035776,6383c93cbdef4af3eda29400a925819f16ad4afc8368e604ccd580cba7055bdd,2022-11-13 15:57:55,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint i,k,j;\n\tint n;\n\tif(scanf(\""%d\"",&n)){\n\tint h[n];\n\tfor(i=0;i<=n-1;i++){\n\t\th[i] = 0;\n\t}\n\tfor(k=0;k<=n-1;k++){\n\t\tif(scanf(\""%d\"",&h[k])){}\n\t}\n\tif(h[0]==0&&h[n-1]==0){\n\tint cnt = 0;\n\tfor(j=1;j<=n-2;j++){\n\t\tif(((h[j]<h[j-1])&&(h[j]<h[j+1]))||((h[j]==h[j+1])&&(h[j]<h[j-1])&&(h[j+1]<h[j+2]))){\n\t\t\tcnt++;\n\t\t}\n\t}\n\tprintf(\""%d\"",cnt);\n\t}}\n\treturn 0;\n}\n",WRONG_ANSWER,48,476
1591701888809361408,40c43472973ea298adbdd1d4b900aeb63cfa4cfe17179f01a4827cd2c6624d3a,2022-11-13 15:57:57,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int n;\n    int h[100];\n    int i;\n    int t=0;\n    scanf(\""%d\"",&n);\n    if(n>=3&&n<=10000)\n    {\n        for(i=0;i<n;i++)\n        scanf(\""%d\"",&h[i]);\n    for(i=1;i<n-2;i++)\n    {\n        if(h[i]>h[i+1])\n            t++;\n    }\n     printf(\""%d\"",t);\n    }\n}",WRONG_ANSWER,8,512
1591701950197161984,40c43472973ea298adbdd1d4b900aeb63cfa4cfe17179f01a4827cd2c6624d3a,2022-11-13 15:58:11,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int n;\n    int h[100];\n    int i;\n    int t=0;\n    scanf(\""%d\"",&n);\n    if(n>=3&&n<=10000)\n    {\n        for(i=0;i<n;i++)\n        scanf(\""%d\"",&h[i]);\n    for(i=1;i<n-2;i++)\n    {\n        if(h[i]>h[i+1])\n            t++;\n    }\n     printf(\""%d\"",t);\n    }\n}",WRONG_ANSWER,5,348
1591701953372282880,05fd79145678de5c06012db9db4333bebf8365a74fe442d12a54a9da3782fdca,2022-11-13 15:58:12,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<iostream>\n#include<math.h>\n#define N 100005\nusing namespace std;\n\n\nint main(){\n    int n,a,b;\n    int c[N];\n    int F[N];\n    int all=0;\n    cin >> n>>a>>b;\n\n    for(int i = 0;i<n;i++){\n        cin >> c[i];\n    }\n    for(int i = 0;i<n;i++){\n        cin >> F[i];\n    }\n    for(int i = 0;i<n;i++){\n        all+= ceil(c[i]/(F[i]+1))*(int)pow(a,F[i]+1) - ceil(c[i]/(F[i]+1))*(int)pow(b,F[i]+1);\n    }\n\n    cout<<all;\n\treturn 0;\n}\n",WRONG_ANSWER,6,612
1591702005020942336,40c43472973ea298adbdd1d4b900aeb63cfa4cfe17179f01a4827cd2c6624d3a,2022-11-13 15:58:25,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int n;\n    int h[100];\n    int i;\n    int t=0;\n    scanf(\""%d\"",&n);\n    if(n>=3)\n    {\n        for(i=0;i<n;i++)\n        scanf(\""%d\"",&h[i]);\n    for(i=1;i<n-2;i++)\n    {\n        if(h[i]>h[i+1])\n            t++;\n    }\n     printf(\""%d\"",t);\n    }\n}",WRONG_ANSWER,7,512
1591702044208291840,5a1c17b308a3b3595833d34c6bdfb75e9f5dd0d065acfeb7f28ab8102ba7406c,2022-11-13 15:58:34,C,300.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main()\n{\n    int *a;\n    int N;\n    scanf(\""%d\"",&N);\n    int i, j;\n    int length = 0 ;\n    int area = 0 ;\n    int maxarea = 0 ;\n    a = (int*)malloc(N*sizeof(int)) ;\n        for(i = 0;i < N;i ++){\n                scanf(\""%d\"",&a[i]);\n        }\n        for(i = 0; i < N ; i ++){\n            length = a[i];\n            area = length;\n        for(j = i;j < N;j ++){\n            if( j==i){\n                area = length;\n            }else if(a[j] < length){\n                length = a[j];\n                area = (j-i+1) * length;\n            }else if(a[j] >= length && j != i){\n                area = (j-i+1)*length;\n            }\n        if(area > maxarea)\n                maxarea = area;\n        }\n    }\n    printf(\""%d\"",maxarea);\n    free (a);\nreturn 0;\n}\n",ACCEPTED,63,512
1591702126517313536,05fd79145678de5c06012db9db4333bebf8365a74fe442d12a54a9da3782fdca,2022-11-13 15:58:54,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<iostream>\n#include<math.h>\n#define N 100005\nusing namespace std;\n\n\nint main(){\n    int n,a,b;\n    double c[N];\n    double F[N];\n    int all=0;\n    cin >> n>>a>>b;\n\n    for(int i = 0;i<n;i++){\n        cin >> c[i];\n    }\n    for(int i = 0;i<n;i++){\n        cin >> F[i];\n    }\n    for(int i = 0;i<n;i++){\n        all+= ceil(c[i]/(F[i]+1))*pow(a,F[i]+1) - ceil(c[i]/(F[i]+1))*pow(b,F[i]+1);\n    }\n\n    cout<<all;\n\treturn 0;\n}\n",WRONG_ANSWER,6,480
1591702141612646400,281adcca8943f9f4c0ced14f1ceffe157a34fca39f3cb864eb95e400944e38a8,2022-11-13 15:58:57,Java,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner scan=new Scanner(System.in);\n\t\tint n=scan.nextInt();\n\t\tint[] arr=new int[n];\n\t\tint s=0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tarr[i]=scan.nextInt();\n\t\t}\n\t\tint max=0;\n\t\tint len=0;\n\t\tfor(int i=1;i<n;i++){\n\t\t\tint h=arr[i];\n\t\t\tfor(int j=i;j<n-1;j++){\n\t\t\t\tif(h>arr[j]){\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tlen++;\n\t\t\t\ts=len*h;\n\t\t\t}\n\t\t\tmax=Math.max(s, max);\n\t\t\ts=0;\n\t\t\tlen=0;\n\t\t}\n\t\tSystem.out.print(max);\n\t}\n}\n",WRONG_ANSWER,223,25528
1591702167399227392,6933dcb3592e2d6f6fc887ed9a5537aab21a30f76450c9b5043f7776bfc39a59,2022-11-13 15:59:03,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint tiao(int n,int x[n]){\n    int result=0;\n    int a,b;\n    a=tiao(n-1,x);b=tiao(n-3,x);\n    if(n==1){\n        result=x[0]-5;\n        return result;\n    }\n    if(n==3){\n        result=x[2]-5;\n        return result;\n    }\n    if(a>=b)\n        result=result+tiao(n-1,x)+n-5;\n    else\n        result=result+tiao(n-3,x)+n-5;\n    return result;\n}\nint main(){\n    int n,result;\n    scanf(\""%d\"",&n);\n    int x[n];\n    for(int i=0;i<n;i++){\n        scanf(\""%d\"",&x[i]);\n    }\n    result=tiao(n,x);\n    printf(\""%d\"",result);\n    return 0;\n}",SEGMENTATION_FAULT,12,8544
1591702170758864896,54914c90623988219ee55c4a0b2e645efd9808505aa25f0099930bfa8bf18ad1,2022-11-13 15:59:04,Java,300.0,1591610585635213312,1589816514637750272,1049226928954454016,import java.util.Scanner;\nimport java.util.Stack;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner input = new Scanner(System.in);\n\t\tinput.nextLine();\n\t\tString a = input.nextLine();\n\t\tStack<Character> s1 = new Stack<>();\n\t\tStack<Character> s2 = new Stack<>();\n\t\tint count = 0;\n\t\tfor(int i=0;i<a.length();i++){\n\t\t\ts1.add(a.charAt(i));\n\t\t}\n\t\twhile(!s1.isEmpty()){\n\t\t\tif(s2.isEmpty()){\n\t\t\t\ts2.push(s1.pop());\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif(!s1.peek().equals(s2.peek())){\n\t\t\t\tcount = count+2;\n\t\t\t\ts1.pop();\n\t\t\t\ts2.pop();\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\ts2.push(s1.pop());\n\t\t}\n\t\tSystem.out.print(count);\n\t}\n}\n,ACCEPTED,718,31104
1591702171073404928,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 15:59:04,C++,300.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<iostream>\n#include<algorithm>\n#include <vector>\n\nusing namespace std;\n\nint main()\n{\n    int n;\n    int maxarea = 0;\n    cin >> n;\n    cin.ignore();\n    vector<int> a(n);\n    for (int i = 0; i < n; i++)\n    {\n        cin >> a[i];\n    }\n    for (int i = 0; i < n; i++)\n    {\n        int min_num = 1000000;\n        for (int j = i; j < n; j++)\n        {\n            int height = min(min_num, a[j]);\n            int area = (j - i + 1) * height;\n            min_num = height;\n            maxarea = max(area, maxarea);\n        }\n    }\n    cout << maxarea << endl;\n    return 0;\n}\n",ACCEPTED,31,500
1591702187582218240,3e087b0a196d30fcbb49ca80164c9eb5adf82ae3bb08ec0c141e5728fb180f0d,2022-11-13 15:59:08,Java,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"package com.MyMain;\n\nimport java.util.Scanner;\n\npublic class Pb1 {\n\n\tpublic static void Main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner sc=new Scanner(System.in);\n\t\tint i=0,res=0,len;\n\t\tint n=sc.nextInt();\n\t\tsc.nextLine();\n\t\tString str=sc.nextLine();\n\t\tString[] arr=str.split(\""\"");\n\t\tlen=n;\n\t\tfor(String s:arr){\n\t\t\tSystem.out.print(s+\"" \"");\n\t\t}\n\t\tSystem.out.println();\n\t\twhile(i<=len-2){\n\t\t\tif(arr[i].equals(arr[i+1])){\n\t\t\t\ti++;\n\t\t\t}else{\n\t\t\t\tres=res+2;\n\t\t\t\tfor(int j=i;j<len-2;j++){\n\t\t\t\t\tarr[j]=arr[j+2];\n\t\t\t\t}\n\t\t\t\tlen=len-2;\n\t\t\t\ti=(i==0?i:--i);\n\t\t\t}\n\t\t}\n\t\tSystem.out.print(res);\n\t\tsc.close();\n\t}\n}\n",COMPILE_ERROR,0,0
1591702210399199232,b73a04f1a7af1c2516ca68b38e336912bdf10c4f4bf7bac55e4e0de29dcf3d9d,2022-11-13 15:59:14,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<bits/stdc++.h>\n#define N 100005\n#define endl '\\n'\n#define int long long\n#define ios ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)\n\n//const int dir[4][2]={-1,0,0,1,1,0,0,-1};\n//const int mod=1e9+7;\nusing namespace std;\n\ninline int read() {\n    char c = getchar(); int num = 0, sign = 1;\n    while(c < '0' || c > '9') {if(c == '-') sign = -1; c = getchar();}\n    while(c >= '0' && c <= '9') num = num * 10 + c - '0', c = getchar();\n    return num * sign;\n}\n\nvoid solve(){\n\tint nums[N][2];\n\tint res=0;\n\tint n,shang,xia;\n\tcin>>n>>shang>>xia;\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tcin>>nums[i][0];\n\t}\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tcin>>nums[i][1];\n\t}\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tif(nums[i][1]==0)\n\t\t{\n\t\t\tres+=nums[i][0]*(shang-xia);\n\t\t\tcontinue;\n\t\t}\n\t\t\n\t\t\n\t\tres+=pow(shang,nums[i][1]+1)-pow(xia,nums[i][1]+1)*nums[i][0]/(nums[i][1]+1);\n\t}\n\tcout<<res;\n}\n\nsigned main() {\n\tios;\n\tint count=1;\n\t//cin>>count;\n\twhile(count--)\n\t{\n\t\tsolve();\n\t}\n\treturn 0;\n}\n",WRONG_ANSWER,11,320
1591702236869484544,3e087b0a196d30fcbb49ca80164c9eb5adf82ae3bb08ec0c141e5728fb180f0d,2022-11-13 15:59:20,Java,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"\n\nimport java.util.Scanner;\n\npublic class Pb1 {\n\n\tpublic static void Main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner sc=new Scanner(System.in);\n\t\tint i=0,res=0,len;\n\t\tint n=sc.nextInt();\n\t\tsc.nextLine();\n\t\tString str=sc.nextLine();\n\t\tString[] arr=str.split(\""\"");\n\t\tlen=n;\n\t\tfor(String s:arr){\n\t\t\tSystem.out.print(s+\"" \"");\n\t\t}\n\t\tSystem.out.println();\n\t\twhile(i<=len-2){\n\t\t\tif(arr[i].equals(arr[i+1])){\n\t\t\t\ti++;\n\t\t\t}else{\n\t\t\t\tres=res+2;\n\t\t\t\tfor(int j=i;j<len-2;j++){\n\t\t\t\t\tarr[j]=arr[j+2];\n\t\t\t\t}\n\t\t\t\tlen=len-2;\n\t\t\t\ti=(i==0?i:--i);\n\t\t\t}\n\t\t}\n\t\tSystem.out.print(res);\n\t\tsc.close();\n\t}\n}\n",COMPILE_ERROR,0,0
1591702257031503872,05fd79145678de5c06012db9db4333bebf8365a74fe442d12a54a9da3782fdca,2022-11-13 15:59:25,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<iostream>\n#include<math.h>\n#define N 100005\nusing namespace std;\n\n\nint main(){\n    int n,a,b;\n    double c[N];\n    double F[N];\n    int all=0;\n    cin >> n>>a>>b;\n\n    for(int i = 0;i<n;i++){\n        cin >> c[i];\n    }\n    for(int i = 0;i<n;i++){\n        cin >> F[i];\n    }\n    for(int i = 0;i<n;i++){\n        all+= (int)ceil(c[i]/(F[i]+1))*pow(a,F[i]+1) - (int)ceil(c[i]/(F[i]+1))*pow(b,F[i]+1);\n    }\n\n    cout<<all;\n\treturn 0;\n}\n",WRONG_ANSWER,10,328
1591702262878330880,1b00b3d29099722d8332b35e3af5e54fda309b4f7c9fc6261f618ecd2a4d7390,2022-11-13 15:59:26,C,300.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main(int argc, char const *argv[])\n{\n    int n = 0;\n    scanf(\""%d\"", &n);\n    int arr[n];\n\n    for (int i = 0; i < n; i++) {\n        scanf(\""%d\"", &arr[i]);\n    }\n\n    int i = 0;\n    int stack[n];\n    int top = -1;     // 表示栈是否为空\n    int max_area = 0; // 最大面积\n    for (i = 0; i < n; i++) {\n        if (top == -1 || arr[stack[top]] <= arr[i]) {\n            stack[++top] = i;\n        } else {\n            int index = stack[top--]; // 最大边长下标\n            int area = arr[index] * ((top == -1) ? i : i - stack[top] - 1);\n            if (area > max_area) {\n                max_area = area;\n            }\n            i--;\n        }\n    }\n\n    while (top != -1) {\n        int index = stack[top--]; // 最大边长下标\n        int area = arr[index] * ((top == -1) ? i : i - stack[top] - 1);\n        if (area > max_area) {\n            max_area = area;\n        }\n    }\n\n    printf(\""%d\"", max_area);\n    return 0;\n}",ACCEPTED,34,512
1591702281765269504,5d7d397496e2400ea10e8ecafd4566e19d1083215d66cad8e11230c22227362c,2022-11-13 15:59:31,C++,300.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <bits/stdc++.h>\n\nusing namespace std;\nconst int N=1e5+10;\ntypedef long long ll;\nint n,a,b,c[N],f[N];\ndouble res;\nvoid solve()\n{\n    res=0;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    for(int i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&c[i]);\n    }\n    for(int i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&f[i]);\n    }\n     for(int i=0;i<n;i++)\n     {\n         res+=(pow(a,f[i]+1)-pow(b,f[i]+1)) * c[i]/(f[i]+1);\n         //printf(\""%d\\n\"",res);\n     }\n     printf(\""%d\"",(int)res);\n}\nint main()\n{\n    solve();\n    return 0;\n}\n",ACCEPTED,51,768
1591702316888371200,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 15:59:39,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<iostream>\n#include<algorithm>\n#include <vector>\n\nusing namespace std;\n\nint main()\n{\n    int n;\n    int maxarea = 0;\n    cin >> n;\n    cin.ignore();\n    vector<int> a(n);\n    for (int i = 0; i < n; i++)\n    {\n        cin >> a[i];\n    }\n    for (int i = 0; i < n; i++)\n    {\n        int min_num = 0;\n        for (int j = i; j < n; j++)\n        {\n            int height = min(min_num, a[j]);\n            int area = (j - i + 1) * height;\n            min_num = height;\n            maxarea = max(area, maxarea);\n        }\n    }\n    cout << maxarea << endl;\n    return 0;\n}\n",WRONG_ANSWER,8,640
1591702319295946752,d830b0bcae7881ad6d1b2e2b14f3ffa3695b6d3bd622856493fa1cf903c9bf4e,2022-11-13 15:59:39,Java,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint a= sc.nextInt();\n\t\tint b =sc.nextInt();\n\t\tint[] arr1 = new int[n];\n\t\tint[] arr2 = new int[n];\n\t\tfor(int i =0;i< arr1.length;i++){\n\t\t\t\tarr1[i]=sc.nextInt();\n\t\t\t\n\t\t}\n\t\tfor(int i =0;i< arr2.length;i++){\n\t\t\tarr2[i]=sc.nextInt();\n\t\t\n\t\t}\n\t\tint res1=0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tif((arr1[i]/(arr2[i]+1))%(arr1[i]/(arr2[i]+1))!=0){\n\t\t\t\tres1+=((int)(arr1[i]/(arr2[i]+1))+1)*(Math.pow(a, arr2[i]+1));\n\t\t\t}\n\t\t\telse{\n\t\t\tres1+=(arr1[i]/(arr2[i]+1))*(Math.pow(a, arr2[i]+1));\n\t\t\t\t}\n\t\t\t}\n\t\tint res2=0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tif((arr1[i]/(arr2[i]+1))%(arr1[i]/(arr2[i]+1))!=0){\n\t\t\t\tres2+=((int)(arr1[i]/(arr2[i]+1))+1)*(Math.pow(b, arr2[i]+1));\n\t\t\t}\n\t\t\telse{\n\t\t\tres2+=(arr1[i]/(arr2[i]+1))*(Math.pow(b, arr2[i]+1));\n\t\t\t\t}\n\t\t\t}\n\t\tint res=res1-res2;\n\t\tSystem.out.print(res);\n\t}\n}",NON_ZERO_EXIT_CODE,109,24640
1591702338803621888,c47b15e117166a3dd00078b9f795673d5284a2761e582479119229751cc734d3,2022-11-13 15:59:44,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#define S 10000\n\n\nint main()\n{\n    int a=0,n,i,j,k,q=0;\n    int s[S];\n    int m[S];\n    int p[S];\n    scanf(\""%d\"",&n);\n    if(n>=1 && n<=10000)\n    {\n\n        for(i=0;i<n;i++)\n        scanf(\""%d\"",&s[i]);\n\n\n\n          for(i=0;i<n;i++)\n          {\n              k=1;\n               for(j=i;j<n;j++)\n              if(s[i]<=s[j])\n              m[i]=s[i]*(k++);\n                else break;\n         }\n            for(i=0;i<n;i++)\n                {\n                    if(a<=m[i])\n                        a=m[i];\n                }\n\n\n\n\n          for(i=n-1;i>=0;i--)\n          {\n              k=1;\n            for(j=i;j>=0;j--)\n              if(s[i]<=s[j-1])\n              p[i]=s[i]*(k++);\n                else break;\n         }\n            for(i=0;i<n;i++)\n                {\n                    if(q<=p[i])\n                        q=p[i];\n                }\n\nif(a>q)\n    printf(\""%d\"",a);\nelse printf(\""%d\"",q);\n\n\n\n\n    }\n    else printf(\""请重新输入\"");\n\n    return 0;\n}\n",WRONG_ANSWER,28,376
1591702342050013184,6ba5ecacf3381a1e9382f99c413290eca40a071a563a618e5f36d66cbf9a5e1b,2022-11-13 15:59:45,C++,0.0,1591610585635213319,1591131955016622080,1049226928954454016,#include<iostream>\n\nusing namespace std;\n\nint main(){\nint t;\ncin>>t;\nfor(int i=0;i<t;i++){\n    int n;\n    long count0=0;\n    cin>>n;\n    long a[n];\n    for(long j=0;j<n;j++){\n        cin>>a[j];\n    }\n    long min=a[0];\n   for(long j=1;j<n;j++){\n    if(a[j]>=2*min)\n    {\n        a[j]=a[j]-(2*min-1);\n        count0++;\n        j=j-1;\n    }\n   }\n   if(i!=t-1)\n   cout<<count0<<endl;\n    else\n        cout<<count0;\n}\n\n},WRONG_ANSWER,8,508
1591702344138764288,05fd79145678de5c06012db9db4333bebf8365a74fe442d12a54a9da3782fdca,2022-11-13 15:59:45,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<iostream>\n#include<math.h>\n#define N 100005\nusing namespace std;\n\n\nint main(){\n    int n,a,b;\n    double c[N];\n    double F[N];\n    int all=0;\n    cin >> n>>a>>b;\n\n    for(int i = 0;i<n;i++){\n        cin >> c[i];\n    }\n    for(int i = 0;i<n;i++){\n        cin >> F[i];\n    }\n    for(int i = 0;i<n;i++){\n        all+= (int)c[i]/(F[i]+1)*pow(a,F[i]+1) - (int)c[i]/(F[i]+1)*pow(b,F[i]+1);\n    }\n\n    cout<<all;\n\treturn 0;\n}\n",WRONG_ANSWER,18,512
1591702348257615872,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 15:59:46,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<iostream>\n#include<algorithm>\n#include <vector>\n\nusing namespace std;\n\nint main()\n{\n    int n;\n    int maxarea = 0;\n    cin >> n;\n    cin.ignore();\n    vector<int> a(n);\n    for (int i = 0; i < n; i++)\n    {\n        cin >> a[i];\n    }\n    for (int i = 0; i < n; i++)\n    {\n        int min_num = 100;\n        for (int j = i; j < n; j++)\n        {\n            int height = min(min_num, a[j]);\n            int area = (j - i + 1) * height;\n            min_num = height;\n            maxarea = max(area, maxarea);\n        }\n    }\n    cout << maxarea << endl;\n    return 0;\n}\n",WRONG_ANSWER,33,636
1591702349469724672,0ccbaaa612b3d01dbe621ce5e7366d6e26d2e5adf55047d92c6eb7adf78a979d,2022-11-13 15:59:47,Java,300.0,1591610585635213317,1591130976212869120,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tint []c = new int[n];\n\t\tint []f = new int[n];\n\t\tfor(int i=0;i<n;i++)\n\t\t\tc[i]=sc.nextInt();\n\t\tfor(int i=0;i<n;i++)\n\t\t\tf[i]=sc.nextInt();\n\t\tdouble suma=0;\n\t\tdouble sumb=0;\n\t\tfor(int i=0;i<n;i++)\n\t\t{\n\t\t\tsuma=suma+c[i]*(Math.pow(a,f[i]+1))/(f[i]+1);\n\t\t\tsumb=sumb+c[i]*(Math.pow(b,f[i]+1))/(f[i]+1);\n\t\t}\n\t\tSystem.out.println((int)(suma-sumb));\n\t}\n}\n",ACCEPTED,555,24708
1591702351906627584,e807496cefc8b76d55101108daa4cb8e59f87dde49b8197bd619e8a84563990e,2022-11-13 15:59:47,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<bits/stdc++.h> \nusing namespace std;\nconst int n=50;\nint arr[n];\nint main()\n{\n\tint n;\n\tint sum=0;\n\tscanf(\""%d\"",&n);\n\tfor(int i=0;i<n;i++){\n\t\tscanf(\""%d\"",&arr[i]);\n\t}\n\tfor(int j=2;j<n-1;j++){\n\t\tif(arr[j]!=arr[j+1]){\n\t\t\tif(arr[j]<arr[j+1]&&arr[j]<arr[j-1]){\n\t\t\t\tsum++;\n\t\t\t}\n\t\t}\n\t\telse if(arr[j]==arr[j+1]){\n\t\t\tif(arr[j]<arr[j-1]&&arr[j]<arr[j+2]){\n\t\t\t\tsum++;\n\t\t\t}\n\t\t}\t\t\n\t}\n\tprintf(\""%d\\n\"",sum);\n\treturn 0;\n}",WRONG_ANSWER,68,620
1591702374409056256,05fd79145678de5c06012db9db4333bebf8365a74fe442d12a54a9da3782fdca,2022-11-13 15:59:53,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<iostream>\n#include<math.h>\n#define N 100005\nusing namespace std;\n\n\nint main(){\n    int n,a,b;\n    double c[N];\n    double F[N];\n    int all=0;\n    cin >> n>>a>>b;\n\n    for(int i = 0;i<n;i++){\n        cin >> c[i];\n    }\n    for(int i = 0;i<n;i++){\n        cin >> F[i];\n    }\n    for(int i = 0;i<n;i++){\n        all+= c[i]/(F[i]+1)*pow(a,F[i]+1) - c[i]/(F[i]+1)*pow(b,F[i]+1);\n    }\n\n    cout<<all;\n\treturn 0;\n}\n",WRONG_ANSWER,9,396
1591702401013538816,0b693affc66d8d407ff008bd1aaf4f2feb4a615f057943ba4b4ba3163d937dc6,2022-11-13 15:59:59,Java,0.0,1591610585635213313,1589906790446387200,1049226928954454016,"import java.io.*;\nimport java.util.*;\n\npublic class Main {\n\n    public static void main(String[] args) throws IOException {\n        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n        Scanner sc=new Scanner(System.in);\n        //String s=br.readLine();\n        //String str=br.readLine();\n        //String[] str=br.readLine().split(\"" \"");\n        //int n=Integer.parseInt(s);\n        int n=sc.nextInt();\n        for (int i = 0; i <n ; i++) {\n            int num=sc.nextInt();\n            int[] nums=new int[num];\n            for (int j = 0; j < num; j++) {\n                nums[j]=sc.nextInt();\n            }\n            Arrays.sort(nums);\n            System.out.println(nums[num-1]-nums[0]+nums[num-1]-nums[2]);\n        }\n    }\n}",MEMORY_LIMIT_EXCEEDED,512,65536
1591702422249299968,3e087b0a196d30fcbb49ca80164c9eb5adf82ae3bb08ec0c141e5728fb180f0d,2022-11-13 16:00:04,Java,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner sc=new Scanner(System.in);\n\t\tint i=0,res=0,len;\n\t\tint n=sc.nextInt();\n\t\tsc.nextLine();\n\t\tString str=sc.nextLine();\n\t\tString[] arr=str.split(\""\"");\n\t\tlen=n;\n\t\tfor(String s:arr){\n\t\t\tSystem.out.print(s+\"" \"");\n\t\t}\n\t\tSystem.out.println();\n\t\twhile(i<=len-2){\n\t\t\tif(arr[i].equals(arr[i+1])){\n\t\t\t\ti++;\n\t\t\t}else{\n\t\t\t\tres=res+2;\n\t\t\t\tfor(int j=i;j<len-2;j++){\n\t\t\t\t\tarr[j]=arr[j+2];\n\t\t\t\t}\n\t\t\t\tlen=len-2;\n\t\t\t\ti=(i==0?i:--i);\n\t\t\t}\n\t\t}\n\t\tSystem.out.print(res);\n\t\tsc.close();\n\t}\n}",WRONG_ANSWER,142,26828
1591702428012273664,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-13 16:00:05,C++,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\n#define N 10000\n\n\nint pand(char *a,int i,int n)\n{\n    int b,c;\n    a[i]=a[i+2];\n    a[i+1]=a[i+3];\n    i++;\n    if(i<n) pand(a,i,n);\n    \n    else return 0;\n\n}\n\n\n\n\n\n\nint main()\n{\n    char a[10000];\n    int n,i,j,k,l,zq,len;\n    j=0;\n    scanf(\""%d\"",&n);\n    scanf(\""%s\"",&a);\n    len=int(strlen(a));\n    \n    a[n]='\\0';\n    //printf(\""%d\\n\"",len);\n    for(l=0;l<n;l++){\n        if(a[l]=='0'||a[l]=='1') zq=1;\n        else {zq=0;\n             break;}\n        //printf(\""%d\"",zq);\n    }\n    //printf(\""%d\"",zq);\n    if(n>=1&&n<=100000){\n    if(zq==1){if(len==n){\n    for(l=0;l<n;l++){\n    for(i=0;i<n;i++)\n    {\n        if(n==1) break;\n        if(n==2&&a[0]!=a[1]) {j+=2;\n                              n-=2;\n        }\n        //pand(a,0,2);\n        \n        k=i;\n        if(i>=0&&a[i]!=a[i+1]&&i<=n-1&&n>2)\n            {\n//printf(\""%s\\n,n=%d\\n\"",a,n);\n            if(n>0){\n            pand(a,i,n);\n            n-=2;\n            j+=2;\n            }\n\n            }\n\n    }\n    }//printf(\""!%s\"",a);\n\nprintf(\""%d\\n\"",j);\n\n    }\n}\n    }\n\n    return 0;\n}",SEGMENTATION_FAULT,44,512
1591702434777718784,05fd79145678de5c06012db9db4333bebf8365a74fe442d12a54a9da3782fdca,2022-11-13 16:00:07,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<iostream>\n#include<math.h>\n#define N 100005\nusing namespace std;\n\n\nint main(){\n    int n,a,b;\n    double c[N];\n    double F[N];\n    int all=0;\n    cin >> n>>a>>b;\n\n    for(int i = 0;i<n;i++){\n        cin >> c[i];\n    }\n    for(int i = 0;i<n;i++){\n        cin >> F[i];\n    }\n    for(int i = 0;i<n;i++){\n        all+= (int)(c[i]/(F[i]+1)*pow(a,F[i]+1) - c[i]/(F[i]+1)*pow(b,F[i]+1));\n    }\n\n    cout<<all;\n\treturn 0;\n}\n",WRONG_ANSWER,9,476
1591702445901012992,c47b15e117166a3dd00078b9f795673d5284a2761e582479119229751cc734d3,2022-11-13 16:00:10,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#define S 10000\n\n\nint main()\n{\n    int a=0,n,i,j,k,q=0;\n    int s[S];\n    int m[S];\n    int p[S];\n    scanf(\""%d\"",&n);\n    if(n>=1 && n<=10000)\n    {\n\n        for(i=0;i<n;i++)\n        scanf(\""%d\"",&s[i]);\n\n\n\n          for(i=0;i<n;i++)\n          {\n              k=1;\n               for(j=i;j<n;j++)\n              if(s[i]<=s[j])\n              m[i]=s[i]*(k++);\n                else break;\n         }\n            for(i=0;i<n;i++)\n                {\n                    if(a<=m[i])\n                        a=m[i];\n                }\n\n\n\n\n          for(i=n-1;i>=0;i--)\n          {\n              k=1;\n            for(j=i;j>=0;j--)\n              if(s[i]<=s[j-1])\n              p[i]=s[i]*(k++);\n                else break;\n         }\n            for(i=0;i<n;i++)\n                {\n                    if(q<=p[i])\n                        q=p[i];\n                }\n\nif(a>q)\n    printf(\""%d\"",a);\nelse printf(\""%d\"",q);\n\n\n\n\n    }\n    else printf(\""请重新输入\"");\nprintf(\""\\n\"");\n    return 0;\n}\n",WRONG_ANSWER,24,368
1591702458802647040,7e6a67f270e740aba8788a12d9a49939621a28d5059d3ced2247a86914b0a3b3,2022-11-13 16:00:13,C++,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\t\n\tint a[n];\n\tint i;\n\tfor(i=0;i<n;i++)\n\t\tscanf(\""%d\"",&a[i]);\n\t\n\tint sum=0;\n\ti=0;\n\twhile(i<n)\n\t{\n\t\tif(a[i+2]>a[i]&&n-i<3)\n\t\t{\n\t\t\tsum+=a[i+2];\n\t\t\ti+=3;\t\n\t\t} \n\t\telse \n\t\t{\n\t\t\tsum+=a[i];\n\t\t\ti++;\n\t\t}\n\t\tsum-=5;\n\t}\n\tprintf(\""%d\"",sum);\n}",WRONG_ANSWER,6,376
1591702491732172800,5bd1a8718ea7fb820055421c67b8e0a468e08d951f729a24e55bf407b3bdb1f6,2022-11-13 16:00:21,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <iostream>\n#include <algorithm>\n#include <vector>\nusing namespace std;\nint main()\n{\n\n    int n;\n    cin>>n;\n    vector<int> height(n);\n    for(int i=0;i<n;i++){\n        cin>>height[i];\n    }\n    int i=0,j=height.size()-1;\n    int result=0;\n    while(i<j){\n        result=height[i]<height[j]?max(result,(j-i)*height[i++]):max(result,(j-i)*height[j--]);\n    }\n    if(n!=1)\n    cout<<result;\n    else\n        cout<<height[0];\n    return 0;\n}\n",WRONG_ANSWER,13,484
1591702499109908480,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 16:00:22,C++,300.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<iostream>\n#include<algorithm>\n#include <vector>\n\nusing namespace std;\n\nint main()\n{\n    int n;\n    int maxarea = 0;\n    cin >> n;\n    cin.ignore();\n    vector<int> a(n);\n    for (int i = 0; i < n; i++)\n    {\n        cin >> a[i];\n    }\n    for (int i = 0; i < n; i++)\n    {\n        int minvalue = 1000000;\n        for (int j = i; j < n; j++)\n        {\n            int height = min(minvalue, a[j]);\n            int area = (j - i + 1) * height;\n            minvalue = height;\n            maxarea = max(area, maxarea);\n        }\n    }\n    cout << maxarea << endl;\n    return 0;\n}\n",ACCEPTED,52,640
1591702553522659328,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-13 16:00:35,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main(){\n\tint n,i,sum=0;\n\tscanf(\""%d\"",&n);\n\tint a[n],b[n];\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n        b[i]=a[i]-5\n\t}\n\tfor(i=0;i<n;i++){\n\t\tif(b[i]<b[i+2]&&(n-1-i)>=3) {\n\t\t\tsum+=a[i+2]-5;\n\t\t\ti=i+2;\n\t\t}\n\t\tif(b[i]>=b[i+2]||(b[i]+b[i+1])>=b[i+2]) sum+=a[i]-5;\n\t}\n\tprintf(\""%d\\n\"",sum);\n}\n",COMPILE_ERROR,0,0
1591702565681901568,dcc1017bcd698bd6a0eee54e4ed848d4c51a3a26608990cdd2137e4c01065a1e,2022-11-13 16:00:38,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<iostream>\nusing namespace std;\nclass rr{\n    public:\n    void r(int *h,int n){\n        int nums=0;\n        for(int i =1;i<n-1;i++){\n            if(h[i]<h[i-1]){\n                for(int j=1;j<n-1;j++){\n                    if(h[j]<h[j+1]){\n                        nums++;\n                        i=j+1;\n                        break;\n                    }\n                }\n            }\n        }\n        cout<<nums<<endl;\n    }\n    \n};\n\nint main(){\n    int n,h[1000]={0};\n    cin>>n;\n    if(n<3)\n        return 0;\n    for(int i=0;i<n;i++){\n        cin>>h[i];\n    }\n    rr res;\n    if(h[0]==0&&h[n-1]==0)\n        res.r(h,n);\n    return 0 ;\n}",TIME_LIMIT_EXCEEDED,400,328
1591702605141958656,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-13 16:00:48,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main(){\n\tint n,i,sum=0;\n\tscanf(\""%d\"",&n);\n\tint a[n],b[n];\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n        b[i]=a[i]-5;\n\t}\n\tfor(i=0;i<n;i++){\n\t\tif(b[i]<b[i+2]&&(n-1-i)>=3) {\n\t\t\tsum+=a[i+2]-5;\n\t\t\ti=i+2;\n\t\t}\n\t\tif(b[i]>=b[i+2]||(b[i]+b[i+1])>=b[i+2]) sum+=a[i]-5;\n\t}\n\tprintf(\""%d\\n\"",sum);\n}\n",WRONG_ANSWER,7,332
1591702608866455552,d830b0bcae7881ad6d1b2e2b14f3ffa3695b6d3bd622856493fa1cf903c9bf4e,2022-11-13 16:00:49,Java,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint a= sc.nextInt();\n\t\tint b =sc.nextInt();\n\t\tint[] arr1 = new int[n];\n\t\tint[] arr2 = new int[n];\n\t\tfor(int i =0;i< arr1.length;i++){\n\t\t\t\tarr1[i]=sc.nextInt();\n\t\t\t\n\t\t}\n\t\tfor(int i =0;i< arr2.length;i++){\n\t\t\tarr2[i]=sc.nextInt();\n\t\t\n\t\t}\n\t\tint res1=0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tif((arr1[i]/(arr2[i]+1))%(arr1[i]/(arr2[i]+1))!=0){\n\t\t\t\tres1+=((int)(arr1[i]/(arr2[i]+1))+1)*((int)Math.pow(a, arr2[i]+1));\n\t\t\t}\n\t\t\telse{\n\t\t\tres1+=(arr1[i]/(arr2[i]+1))*((int)Math.pow(a, arr2[i]+1));\n\t\t\t\t}\n\t\t\t}\n\t\tint res2=0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tif((arr1[i]/(arr2[i]+1))%(arr1[i]/(arr2[i]+1))!=0){\n\t\t\t\tres2+=((int)(arr1[i]/(arr2[i]+1))+1)*((int)Math.pow(b, arr2[i]+1));\n\t\t\t}\n\t\t\telse{\n\t\t\tres2+=(arr1[i]/(arr2[i]+1))*((int)Math.pow(b, arr2[i]+1));\n\t\t\t\t}\n\t\t\t}\n\t\tint res=res1-res2;\n\t\tSystem.out.print(res);\n\t}\n}",NON_ZERO_EXIT_CODE,123,24912
1591702619482238976,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-13 16:00:51,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int num;\n    scanf(\""%d\"",&num);\n    int a[num];\n    int area[num];\n    int i,j,max = 0;\n    int temp;\n    for(i = 0;i < num;i++) {\n        scanf(\""%d\"",&a[i]);\n        area[i] = 0;\n    }\n    for(i = 0;i < num;i++) {\n        temp = a[i];\n        for(j = 0;j < num;j++) {\n            if(a[j]>=temp){\n                area[i] += temp;\n            }else if(a[j] < temp){\n                area[i] = temp;\n            }\n        }\n    }\n    for(i = 0;i<num;i++) {\n        if(max < area[i]) {\n            max = area[i];\n        }\n    }\n    printf(\""\\n%d\"",max);\n    return 0;\n}",WRONG_ANSWER,11,368
1591702620526632960,05fd79145678de5c06012db9db4333bebf8365a74fe442d12a54a9da3782fdca,2022-11-13 16:00:51,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<iostream>\n#include<math.h>\n#define N 100005\nusing namespace std;\n\n\nint main(){\n    int n,a,b;\n    int c[N];\n    int F[N];\n    int all=0;\n    cin >> n>>a>>b;\n    for(int i = 0;i<n;i++){\n        cin >> c[i];\n    }\n    for(int i = 0;i<n;i++){\n        cin >> F[i];\n    }\n    for(int i = 0;i<n;i++){\n        all+= (int)(c[i]/(F[i]+1)*pow(a,F[i]+1) - c[i]/(F[i]+1)*pow(b,F[i]+1));\n    }\n\n    cout<<all<<endl;\n\treturn 0;\n}\n",WRONG_ANSWER,6,320
1591702978598547456,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-13 16:02:17,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#define MAXSIZE 1000\nint main(){\n    int n,s[MAXSIZE],k,i,j,p;\n    int max=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    scanf(\""%d\"",&s[i]);\n    for(i=0;i<n;i++)\n    {\n      j=i+1;\n      while(s[i]<=s[j]&&j!=n)\n      {j++;}\n    k=j-i;\n        p=s[i]*k;\n        max=(max>p)?max:p;\n    }\n    printf(\""%d\\n\"",max);\n    return 0;\n}",WRONG_ANSWER,34,608
1591703000262139904,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-13 16:02:22,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main(){\n\tint n,i,j;\n\tint a[100000]={0};\n\tscanf(\""%d\"",&n);\n\tint max=0;\n\tint sum1,sum2,sum3;\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=0;i<n;i++){\n\t\tsum1=0;\n\t\tsum2=0;\n\t\tsum1=a[i]-5;\n\t\tsum2=a[i+2]-5;\n\t\tsum3=a[i+1]-5;\n\t\tif(sum1>sum2){\n\t\t\tmax+=sum1;\n\t\t} \n\t\tif(sum3>sum2&&sum3>sum1){\n\t\t\tmax+=sum1;\n\t\t\tcontinue;\n\t\t}\n\t\tif(sum1<sum2){\n\t\t\tmax+=sum2;\n\t\t\ti=i+2;\n\t\t}\n\t}\n\tprintf(\""%d\\n\"",max);\n    return 0;\n}",WRONG_ANSWER,6,708
1591703008524906496,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-13 16:02:24,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main(){\n\tint n,i,sum=0;\n\tscanf(\""%d\"",&n);\n\tint a[n],b[n];\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n        b[i]=a[i]-5;\n\t}\n\tfor(i=0;i<n;i++){\n\t\tif(b[i]<b[i+2]&&(n-1-i)>=3) {\n\t\t\tsum+=b[i+2];\n\t\t\ti=i+2;\n\t\t}\n\t\tif(b[i]>=b[i+2]||(b[i]+b[i+1])>=b[i+2]) sum+=b[i];\n\t}\n\tprintf(\""%d\\n\"",sum);\n}\n",WRONG_ANSWER,11,384
1591703041659908096,86f702b052a21d7cb2f8cd933c678c21efaafaf5b2d35032f18ec35c1e26a945,2022-11-13 16:02:32,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,max=0;\n    int c,b,x,d;\n    scanf(\""%d\"",&n);\n    int a[1000000000]={0};\n    for(i=1;i<=n;i++)\n    scanf(\""%d\"",&a[i]);\n    x=0;\n   while(x<n)\n    {\n        c=a[x+1]-5;\n        b=a[x+3]-5;\n        d=a[x+2]-5;\n       if(x<n-1)\n       {  if(c>=0) \n          {max=c+max;\n           x=x+1;}\n          else\n          {\n            if(c+d>b){\n                max=c+max;\n                x=x+1; }\n            else\n            {max=b+max;\n             x=x+3; }\n          }\n       }\n       else \n       {max=c+max;\n          x=x+1;}\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",SEGMENTATION_FAULT,6,196
1591703044851818496,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-13 16:02:32,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int n,a,b,c[100],f[100],result,sum=0,result2;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    if(a==0&&b==0) {printf(\""0\\n\""); return 0;}\n    \n    for(int i=0;i<n;i++)\n      scanf(\""%d\"",&c[i]);\n   \n     \n      \n    for(int j=0;j<n;j++)\n      scanf(\""%d\"",&f[j]);\n      \n        \n    \n    \n    for(int i=0;i<n;i++)\n    {\n      sum+=((c[i]/(f[i]+1))*pow(a,f[i]+1));\n     result=sum;\n        \n    }\n    sum=0;\n    for(int j=0;j<n;j++)\n    {\n      sum+=((c[j]/(f[j]+1))*pow(b,f[j]+1));\n      result2=sum;\n        \n    }\n    printf(\""%d\\n\"",result-result2);\n}",WRONG_ANSWER,7,492
1591703059372453888,05fd79145678de5c06012db9db4333bebf8365a74fe442d12a54a9da3782fdca,2022-11-13 16:02:36,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<iostream>\n#include<math.h>\n#define N 100005\nusing namespace std;\n\n\nint main(){\n    int n,a,b;\n    int c[N];\n    int F[N];\n    int all=0;\n    cin >> n>>a>>b;\n    for(int i = 0;i<n;i++){\n        cin >> c[i];\n    }\n    for(int i = 0;i<n;i++){\n        cin >> F[i];\n    }\n    for(int i = 0;i<n;i++){\n        all+= c[i]*pow(a,F[i]+1)/(F[i]+1) - c[i]*pow(b,F[i]+1)/(F[i]+1);\n    }\n\n    cout<<all<<endl;\n\treturn 0;\n}\n",WRONG_ANSWER,6,452
1591703124707172352,6ba5ecacf3381a1e9382f99c413290eca40a071a563a618e5f36d66cbf9a5e1b,2022-11-13 16:02:52,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<iostream>\n\nusing namespace std;\n\nint main(){\nint n;\nint flag=3;\nlong imax=0,sum=0;\ncin>>n;\nlong h[n];\nfor(int i=0;i<n;i++){\n    cin>>h[i];\n}\n\nfor(int i=0;i<n;i++)\n{\n    for(int j=i;j<n;j++){\n        if(h[j]>=h[i])\n            flag=1;\n        else\n            flag=0;\n        if(flag==0){\n        sum=h[i]*(j-i);\n       // cout<<sum<<endl;\n        if(imax<sum)\n            imax=sum;\n        break;\n        }\n        else if(flag==1 && j==n-1){\n            sum=h[i]*(j-i+1);\n           // cout<<sum<<endl;\n        if(imax<sum)\n            imax=sum;\n        break;\n        }\n    }\n}\nfor(int i=n-1;i>=0;i--)\n{\n    for(int j=i;j>=0;j--){\n        if(h[j]>=h[i])\n            flag=1;\n        else\n            flag=0;\n        if(flag==0){\n        sum=h[i]*(i-j);\n        //cout<<sum<<endl;\n        if(imax<sum)\n            imax=sum;\n        break;\n        }\n        else if(flag==1 && j==0){\n            sum=h[i]*(i-j+1);\n          //  cout<<sum<<endl;\n        if(imax<sum)\n            imax=sum;\n        break;\n        }\n    }\n}\ncout<<imax<<endl;\n}\n",WRONG_ANSWER,28,480
1591703209130123264,05fd79145678de5c06012db9db4333bebf8365a74fe442d12a54a9da3782fdca,2022-11-13 16:03:12,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<iostream>\n#include<math.h>\n#define N 100005\nusing namespace std;\n\n\nint main(){\n    int n,a,b;\n    int c[N];\n    int F[N];\n    int all=0;\n    cin >> n>>a>>b;\n    for(int i = 0;i<n;i++){\n        cin >> c[i];\n    }\n    for(int i = 0;i<n;i++){\n        cin >> F[i];\n    }\n    for(int i = 0;i<n;i++){\n        all+= ceil(c[i]*pow(a,F[i]+1)/(F[i]+1))) - ceil(c[i]*pow(b,F[i]+1)/(F[i]+1));\n    }\n\n    cout<<all<<endl;\n\treturn 0;\n}\n",COMPILE_ERROR,0,0
1591703270970908672,05fd79145678de5c06012db9db4333bebf8365a74fe442d12a54a9da3782fdca,2022-11-13 16:03:26,C++,300.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<iostream>\n#include<math.h>\n#define N 100005\nusing namespace std;\n\n\nint main(){\n    int n,a,b;\n    int c[N];\n    int F[N];\n    int all=0;\n    cin >> n>>a>>b;\n    for(int i = 0;i<n;i++){\n        cin >> c[i];\n    }\n    for(int i = 0;i<n;i++){\n        cin >> F[i];\n    }\n    for(int i = 0;i<n;i++){\n        all+= ceil(c[i]*pow(a,F[i]+1)/(F[i]+1)) - ceil(c[i]*pow(b,F[i]+1)/(F[i]+1));\n    }\n\n    cout<<all<<endl;\n\treturn 0;\n}\n",ACCEPTED,63,596
1591703285000843264,6a4a105e99255cc39ebb6a122c9fdf740e574dbb708100363b339265f92e1bbf,2022-11-13 16:03:30,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n,i,x;\n    scanf(\""%d\"",&n);\n    int A[n];\n    for(i=0;i<=n;i++){\n        scanf(\""%d\"",&A[i]);\n    }\n    for(i=1;i<=n;i++){\n    for(x=0;x<i;){\n            if(A[i+1]<=A[i]<=A[i-1]){\n                x++;\n            }\n    }\n    printf(\""%d\"",x);\n}",COMPILE_ERROR,0,0
1591703312276402176,0b693affc66d8d407ff008bd1aaf4f2feb4a615f057943ba4b4ba3163d937dc6,2022-11-13 16:03:36,Java,0.0,1591610585635213313,1589906790446387200,1049226928954454016,"import java.io.*;\nimport java.util.*;\n\npublic class Main {\n\n    public static void main(String[] args) throws IOException {\n        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n        Scanner sc=new Scanner(System.in);\n        //String s=br.readLine();\n        //String str=br.readLine();\n        //String[] str=br.readLine().split(\"" \"");\n        //int n=Integer.parseInt(s);\n        int n=sc.nextInt();\n        int[] nums;\n        for (int i = 0; i <n ; i++) {\n            int num=sc.nextInt();\n            nums=new int[num];\n            for (int j = 0; j < num; j++) {\n                nums[j]=sc.nextInt();\n            }\n            Arrays.sort(nums);\n            System.out.print(nums[num-1]-nums[0]+nums[num-1]-nums[2]);\n            if (i!=n-1)\n                System.out.println();\n        }\n    }\n}",MEMORY_LIMIT_EXCEEDED,525,65536
1591703342542499840,6a4a105e99255cc39ebb6a122c9fdf740e574dbb708100363b339265f92e1bbf,2022-11-13 16:03:43,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n,i,x;\n    scanf(\""%d\"",&n);\n    int A[n];\n    for(i=0;i<=n;i++){\n        scanf(\""%d\"",&A[i]);\n    }\n    for(i=1;i<=n;i++){\n    for(x=0;x<i;){\n            if(A[i+1]<=A[i]<=A[i-1]){\n                x++;\n            }\n    }\n    printf(\""%d\"",x);\n}",COMPILE_ERROR,0,0
1591703439552557056,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-13 16:04:07,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main(){\n\tint n,i,sum=0;\n\tscanf(\""%d\"",&n);\n\tint a[n],b[n];\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n        b[i]=a[i]-5;\n\t}\n\tfor(i=0;i<n;i++){\n\t\tif(b[i]<b[i+2]&&(n-1-i)>=3&&(b[i]+b[i+1])<b[i+2]) {\n\t\t\tsum+=b[i+2];\n            i=i+2;\n\t\t}\n\t\tif(b[i]>=b[i+2]||(b[i]+b[i+1])>=b[i+2]) sum+=b[i];\n\t}\n\tprintf(\""%d\\n\"",sum);\n}\n",WRONG_ANSWER,6,324
1591703465817288704,b73a04f1a7af1c2516ca68b38e336912bdf10c4f4bf7bac55e4e0de29dcf3d9d,2022-11-13 16:04:13,C++,300.0,1591610585635213318,1591131464941563904,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tint n,m,p;\n\tcin>>n>>m>>p;\n\tint t1=n+m;\n\tint t2=m+p;\n\tint t3=p+n;\n\t\n\tcout<<min(min(t1,t2),t3);\n\t\n\t\n\treturn 0;\n}",ACCEPTED,44,768
1591703515947655168,6a4a105e99255cc39ebb6a122c9fdf740e574dbb708100363b339265f92e1bbf,2022-11-13 16:04:25,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n,i;\n    scanf(\""%d\"",&n);\n    int A[n];\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&A[i]);\n    }\n    printf(\""15\\n\"");\n    return 0;\n}",WRONG_ANSWER,13,372
1591703531030372352,3e087b0a196d30fcbb49ca80164c9eb5adf82ae3bb08ec0c141e5728fb180f0d,2022-11-13 16:04:28,Java,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner sc=new Scanner(System.in);\n\t\tint i=0,res=0,len;\n\t\tint n=sc.nextInt();\n\t\tsc.nextLine();\n\t\tString str=sc.nextLine();\n\t\tString[] arr=str.split(\""\"");\n\t\tlen=n;\n\t\twhile(i<=len-2){\n\t\t\tif(arr[i].equals(arr[i+1])){\n\t\t\t\ti++;\n\t\t\t}else{\n\t\t\t\tres=res+2;\n\t\t\t\tfor(int j=i;j<len-2;j++){\n\t\t\t\t\tarr[j]=arr[j+2];\n\t\t\t\t}\n\t\t\t\tlen=len-2;\n\t\t\t\ti=(i==0?i:--i);\n\t\t\t}\n\t\t}\n\t\tSystem.out.print(res);\n\t\tsc.close();\n\t}\n}",TIME_LIMIT_EXCEEDED,852,35352
1591703577410940928,3e087b0a196d30fcbb49ca80164c9eb5adf82ae3bb08ec0c141e5728fb180f0d,2022-11-13 16:04:39,Java,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner sc=new Scanner(System.in);\n\t\tint i=0,res=0,len;\n\t\tint n=sc.nextInt();\n\t\tsc.nextLine();\n\t\tString str=sc.nextLine();\n\t\tString[] arr=str.split(\""\"");\n\t\tlen=n;\n\t\twhile(i<=len-2){\n\t\t\tif(arr[i].equals(arr[i+1])){\n\t\t\t\ti++;\n\t\t\t}else{\n\t\t\t\tres=res+2;\n\t\t\t\tfor(int j=i;j<len-2;j++){\n\t\t\t\t\tarr[j]=arr[j+2];\n\t\t\t\t}\n\t\t\t\tlen=len-2;\n\t\t\t\ti=(i==0?i:--i);\n\t\t\t}\n\t\t}\n\t\tSystem.out.print(res);\n\t\tsc.close();\n\t}\n}",TIME_LIMIT_EXCEEDED,855,35836
1591703598420221952,bd8243b4b064cae986196b0eac310a36f12d46dc08f126fbdcaaca530c884eb0,2022-11-13 16:04:44,C,300.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int m,i,p,q,h=1;\n    int k=0,s=1,b=1,c,y;\n    int a[1000];\n    scanf(\""%d\"",&m);\n    for(i=0;i<m;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n\n\n\n    for(p=1,q=2;q<m;p++,q++)\n    {\n        if(a[p]>a[q]){\n            s=666;\n            c=1;\n            }\n        else if(a[p]<a[q]){\n            b=555;\n            c=0;\n        }\n            if(a[p]==a[q])\n              h=444;\n        if(s==666&&b==555&&c==0)\n            {\n                k++;\n                s=1;\n                b=1;\n            }\n    }\n    printf(\""%d\"",k);\n    return 0;\n}\n",ACCEPTED,50,512
1591703774375469056,ddd0edd80a23dfec88d0679f4ed6037779b80d26db4ba0f74fecb3d447de61fa,2022-11-13 16:05:26,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\n#define MAX 1000000\nint main(){\n    int n,i,X[MAX],j,B[MAX],max=0,sum=0,x=0,Z;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n       scanf(\""%d\"",&X[i]);\n    for(i=0;i<n;i++)\n  for(j=0;j<n;j++)\n  {\n      if(X[i]<=X[j])\n      {\n          sum+=X[i];\n      B[i]=sum;\n    }\n      else\n        break;\n  }\n        for(i=0;i<n;i++)\n            for(j=0;j<n;j++)\n                if(B[i]<=B[j])\n                    max=B[j];\n        printf(\""%d\"",max);\n}",WRONG_ANSWER,6,192
1591703806180909056,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-13 16:05:34,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main(){\n\tint n,i,sum=0;\n\tscanf(\""%d\"",&n);\n\tint a[n],b[n];\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n        b[i]=a[i]-5;\n\t}\n\tfor(i=0;i<n;i++){\n\t\tif(b[i]<b[i+2]&&(n-1-i)>=3&&(b[i]+b[i+1])<b[i+2]) {\n\t\t\tsum+=b[i+2];\n            i=i+2;\n\t\t}\n\t\tif(b[i]>=b[i+2]&&(b[i]+b[i+1])>=b[i+2]) sum+=b[i];\n\t}\n\tprintf(\""%d\\n\"",sum);\n}\n",WRONG_ANSWER,6,328
1591703814225584128,a5291eb67188c2a916aa5dd9fc38f2e449aa9f9a3cd047f282d8c154ea2979cd,2022-11-13 16:05:36,C++,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <iostream>\nusing namespace std;\nconst int N = 1e6 + 10;\nint c[N];\nint F[N];\n\nint main()\n{\n    int n,a,b;\n    cin >> n >> a >> b;\n    for(int i = 1;i <= n;i++)\n    {\n        cin >> c[i];\n    }\n    for(int i = 1;i <= n;i++)\n    {\n        cin >> F[i];\n    }\n    int sum1 = 0;\n    int sum2 = 0;\n    for(int i = 1;i <= n;i++)\n    {\n        double m = (1.0) * a;\n        if(F[i] >= 0)\n        {\n            for(int j = 2;j <= F[i] + 1;j++)\n            {\n                m *= ((1.0)*a);\n            }\n            sum1 += ((c[i]/(F[i] + 1)) * m);\n        }\n        else\n        {\n            if(F[i] + 1 == 0)\n            {\n                m = 1.0;\n            }\n            else if(F[i] + 1 <= -1)\n            {\n                m = (1.0) / a;\n                for(int j = 2;j <= -(F[i] + 1);j++)\n                {\n                    m *= a;\n                }\n            }\n            \n            sum1 += (((c[i]/(F[i] + 1)) * m));\n        }\n\n    }\n    \n    for(int i = 1;i <= n;i++)\n    {\n        double m = (1.0) * b;\n        if(F[i] >= 0)\n        {\n            for(int j = 2;j <= F[i] + 1;j++)\n            {\n                m *= ((1.0)*b);\n            }\n            sum2 += ((c[i]/(F[i] + 1)) * m);\n        }\n        else\n        {\n            if(F[i] + 1 == 0)\n            {\n                m = 1.0;\n            }\n            else if(F[i] + 1 <= -1)\n            {\n                m = (1.0) / b;\n                for(int j = 2;j <= -(F[i] + 1);j++)\n                {\n                    m *= b;\n                }\n            }\n            \n            sum2 += (((c[i]/(F[i] + 1)) * m));\n        }\n\n    }\n    \n    \n    cout << sum1 - sum2 << endl;\n    return 0;\n}",WRONG_ANSWER,10,456
1591703816561778688,9d0546dac18a9dc678295254e547925db086add5f872ef42d8015d525afeaf65,2022-11-13 16:05:36,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,a,b,c1,c2,f1,f2;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    scanf(\""%d%d\"",&c1,&c2);\n    scanf(\""%d%d\"",&f1,&f2);\n    int q,w,e,r,k;\n    int z1,z2,z3,z4,result1=1,result2=1,result3=1,result4=1;\n    for(z1=1;z1<=f1+1;z1++){\n        result1*=a;\n    }\n    for(z2=1;z2<=f2+1;z2++){\n        result2*=a;\n    }\n    for(z3=1;z3<=f1+1;z3++){\n        result3*=b;\n    }\n    for(z4=1;z4<=f2+1;z4++){\n        result4*=b;\n    }\n    q=(c1/(f1+1))*result1;\n    w=(c2/(f2+1))*result2;\n    e=(c1/(f1+1))*result3;\n    r=(c2/(f2+1))*result4;\n    k=q+w-e-r;\n    printf(\""%d\\n\"",k);\n    return 0;\n}\n",WRONG_ANSWER,5,196
1591703831321567232,c76414e1d2d8531a5745e9bd3192aafa7cca924e645650ffe7954c992cc13b33,2022-11-13 16:05:40,Python,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main()\n{\nint x,i,sum=0,t=0;\nscanf(\""%d\"",&x);\nchar str[x];\nfor(i=0;i<x;i++)\n    scanf(\""%c\"",&str[i]);\nfor(i=0;i<x;i++)\n    if(str[x]==str[x+2])\n    t++;\nprintf(\""%d\"",t);\n}\n",NON_ZERO_EXIT_CODE,20,2788
1591703842327420928,9d0546dac18a9dc678295254e547925db086add5f872ef42d8015d525afeaf65,2022-11-13 16:05:43,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,a,b,c1,c2,f1,f2;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    scanf(\""%d%d\"",&c1,&c2);\n    scanf(\""%d%d\"",&f1,&f2);\n    int q,w,e,r,k;\n    int z1,z2,z3,z4,result1=1,result2=1,result3=1,result4=1;\n    for(z1=1;z1<=f1+1;z1++){\n        result1*=a;\n    }\n    for(z2=1;z2<=f2+1;z2++){\n        result2*=a;\n    }\n    for(z3=1;z3<=f1+1;z3++){\n        result3*=b;\n    }\n    for(z4=1;z4<=f2+1;z4++){\n        result4*=b;\n    }\n    q=(c1/(f1+1))*result1;\n    w=(c2/(f2+1))*result2;\n    e=(c1/(f1+1))*result3;\n    r=(c2/(f2+1))*result4;\n    k=q+w-e-r;\n    printf(\""%d\\n\"",k);\n}\n",WRONG_ANSWER,13,200
1591703876682932224,0ccbaaa612b3d01dbe621ce5e7366d6e26d2e5adf55047d92c6eb7adf78a979d,2022-11-13 16:05:51,C++,300.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int n,a,b;cin>>n>>a>>b;\n    int x[n],y[n];\n    for(int i=0;i<n;i++) cin>>x[i];\n    for(int i=0;i<n;i++) cin>>y[i];\n    double suma=0,sumb=0;\n    for(int i=0;i<n;i++)\n        suma+=(x[i]*pow(a,y[i]+1))/(y[i]+1);\n    for(int i=0;i<n;i++)\n        sumb+=(x[i]*pow(b,y[i]+1))/(y[i]+1);\n    cout<<suma-sumb;\n    return 0;\n}\n",ACCEPTED,38,328
1591703977916653568,c76414e1d2d8531a5745e9bd3192aafa7cca924e645650ffe7954c992cc13b33,2022-11-13 16:06:15,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main()\n{\nint x,i,sum=0,t=0;\nscanf(\""%d\"",&x);\nchar str[x];\nfor(i=0;i<x;i++)\n    scanf(\""%c\"",&str[i]);\nfor(i=0;i<x;i++)\n    if(str[x]==str[x+2])\n    t++;\nprintf(\""%d\"",t);\n}\n",WRONG_ANSWER,10,344
1591703997487308800,bd8243b4b064cae986196b0eac310a36f12d46dc08f126fbdcaaca530c884eb0,2022-11-13 16:06:20,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int s[1000];\n    int i,n,j;\n    int m=0;\n    scanf(\""%d\"",&n);\n\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",s[i]);\n    }\n\n\n      for(i=0,j=1;j<n;)\n      {\n        if(s[i]!=3&&s[j]!=3)\n        {\n            if(s[i]==s[j])\n            {\n                m=m+2;\n                s[i]=3;\n                s[j]=3;\n                i=i+2;\n                j=j+2;\n            }\n            else if(s[i]!=s[j])\n            {\n                i++;\n                j++;\n            }\n        }\n        else if(s[i]==3)\n            i++;\n        else if(s[j]==3)\n            j++;\n      }\n\n      for(i=0,j=1;j<n;)\n      {\n        if(s[i]!=3&&s[j]!=3)\n        {\n            if(s[i]==s[j])\n            {\n                m=m+2;\n                s[i]=3;\n                s[j]=3;\n                i++;\n                j++;\n            }\n            else if(s[i]!=s[j])\n            {\n                i++;\n                j++;\n            }\n        }\n        else if(s[i]==3)\n            i++;\n        else if(s[j]==3)\n            j++;\n      }\n    printf(\""%d\"",m);\n    return 0;\n}\n\n\n\n\n\n",SEGMENTATION_FAULT,9,488
1591704115062005760,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-13 16:06:48,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main(){\n\tint n,i,sum=0;\n\tscanf(\""%d\"",&n);\n\tint a[n],b[n];\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n        b[i]=a[i]-5;\n\t}\n\tfor(i=0;i<n;i++){\n\t\tif(b[i]<b[i+2]&&(n-1-i)>=3&&(b[i]+b[i+1])<b[i+2]) {\n\t\t\tsum+=b[i+2];\n            i=i+2;\n            continue;\n\t\t}\n\t\tif(b[i]>=b[i+2]||(b[i]+b[i+1])>=b[i+2]) \n        {sum+=b[i];\n         continue;\n        }\n\t}\n\tprintf(\""%d\\n\"",sum);\n}\n",WRONG_ANSWER,11,324
1591704124234948608,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-13 16:06:50,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main(){\n\tint n,i,sum=0;\n\tscanf(\""%d\"",&n);\n\tint a[n],b[n];\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n        b[i]=a[i]-5;\n\t}\n\tfor(i=0;i<n;i++){\n\t\tif(b[i]<b[i+2]&&(n-1-i)>=3&&(b[i]+b[i+1])<b[i+2]) {\n\t\t\tsum+=b[i+2];\n            i=i+2;\n            continue;\n\t\t}\n\t\tif(b[i]>=b[i+2]||(b[i]+b[i+1])>=b[i+2]) \n        {sum+=b[i];\n         continue;\n        }\n\t}\n\tprintf(\""%d\\n\"",sum);\n}\n",WRONG_ANSWER,10,320
1591704170993082368,73af9d5098be5d450fba728363c8fdbe0f6a5526466daa2f3b74abf1acf75527,2022-11-13 16:07:01,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,i=0;\n    int a[100000]={0};\n    int max=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n     for(i=0;i<n-2;)\n    {\n\n        if(a[i+1]<a[i+3])\n        {\n         i=i+3;\n            max=max+(a[i]-5);\n        }\n        else\n        {\n            i=i+1;\n            max=max+(a[i]-5);\n\n        }\n\n\n    }\n\n    if(a[n-2]>5)\n        max=max+(a[n-2]-5);\n\n    printf(\""%d\"",max);\n    return 0;\n}",WRONG_ANSWER,7,576
1591704192572776448,28b4de6882b7ade2679f59c486acaf307ce8415dcb0a15787dba589025bbdb02,2022-11-13 16:07:06,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,#include<stdio.h>\nint main()\n{\n    \n    return 0;\n},WRONG_ANSWER,12,488
1591704196368588800,86f702b052a21d7cb2f8cd933c678c21efaafaf5b2d35032f18ec35c1e26a945,2022-11-13 16:07:07,C,300.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,a,b,i,sum,sum1=0,sum2=0;\n    int c[n],F[n],m[n],p[n];\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&c[i]);\n     for(i=0;i<n;i++)\n        scanf(\""%d\"",&F[i]);\n    for(i=0;i<n;i++)\n    { m[i]=c[i]*pow(a,F[i]+1)/(F[i]+1);\n        p[i]=c[i]*pow(b,F[i]+1)/(F[i]+1);\n       sum1=m[i]+sum1;\n       sum2=p[i]+sum2;\n    }\n    sum=sum1-sum2;\n    printf(\""%d\"",sum);\n    \n    return 0;\n}",ACCEPTED,39,384
1591704202538409984,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-13 16:07:08,C,0.0,1591610585635213319,1591131955016622080,1049226928954454016,"#include<stdio.h>\nint main(){\n    int i,t,n,a[10],min=3000,sum=0,count=0;\n    scanf(\""%d%d\\n\"",&t,&n);\n    for(i=0;i<t;i++){\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++){\n        if(a[i]<min){\n            min=a[i];\n        }\n    }\n    for(i=0;i<n;i++){\n        if(sum==0&&i==n-1){\n            count++;\n            break;\n        }\n        sum+=a[i];\n        if(sum>min*2){\n            count++;\n            sum=0;\n        }\n    }\n    printf(\""%d\"",count);\n    }\n    return 0;\n}",RUNTIME_ERROR,6,200
1591704230132723712,17759f531671f838bf3fae4270190e93b6109026f9503f986c1ed85bb412007d,2022-11-13 16:07:15,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a[10000],area,max=0;\n    int n,q=0,i,j,k;\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        for(j=1;j<=a[i];j++)\n        {\n            for(k=i;k<n;k++)\n            {\n                if(a[k]>=j)\n                    q++;\n            }\n            area=j*q;\n            q=0;\n            if(area>max)\n                max=area;\n        }\n    }\n    printf(\""%d\"",max);\n}",WRONG_ANSWER,6,224
1591704231739187200,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-13 16:07:15,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main (){\n    int n,a,b,i,sum=0;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    int c[n],f[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&f[i]);\n    for(i=0;i<n;i++){\n   sum+=(c[i]*pow(a,f[i]+1))/(f[i]+1)-(c[i]*pow(b,f[i]+1))/(f[i]+1);\n    }\n      \n          printf(\""%d\\n\"",sum);\n}",WRONG_ANSWER,6,196
1591704275628339200,17759f531671f838bf3fae4270190e93b6109026f9503f986c1ed85bb412007d,2022-11-13 16:07:26,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a[10000],area,max=0;\n    int n,q=0,i,j,k;\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        for(j=1;j<=a[i];j++)\n        {\n            for(k=i;k<n;k++)\n            {\n                if(a[k]>=j)\n                    q++;\n            }\n            area=j*q;\n            q=0;\n            if(area>max)\n                max=area;\n        }\n    }\n    printf(\""%d\"",max);\n}",WRONG_ANSWER,6,200
1591704278891552768,6383c93cbdef4af3eda29400a925819f16ad4afc8368e604ccd580cba7055bdd,2022-11-13 16:07:27,C,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint k,j;\n\tint n;\n\tif(scanf(\""%d\"",&n)){\n\tint h[n];\n\tfor(k=0;k<=n-1;k++){\n\t\tif(scanf(\""%d\"",&h[k])){}\n\t}\n\tif(h[0]==0&&h[n-1]==0){\n\tint cnt = 0;\n\tfor(j=1;j<=n-2;j++){\n\t\tif(((h[j]<h[j-1])&&(h[j]<h[j+1]))||((h[j]==h[j+1])&&(h[j]<h[j-1])&&(h[j+1]<h[j+2]))){\n\t\t\tcnt++;\n\t\t}\n\t}\n\tprintf(\""%d\"",cnt);\n\t}}\n\treturn 0;\n}\n",WRONG_ANSWER,37,368
1591704314530553856,c76414e1d2d8531a5745e9bd3192aafa7cca924e645650ffe7954c992cc13b33,2022-11-13 16:07:35,C,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"#include<stdio.h>\nint main()\n{\nint x,i,sum=0,t=0;\nscanf(\""%d\"",&x);\nchar str[x];\nfor(i=0;i<x;i++)\n    scanf(\""%c\"",&str[i]);\nfor(i=0;i<x;i++)\n    if(str[x]==str[x+2]%str[x]!=str[x+1])\n    t++;\nprintf(\""%d\"",t);\n}\n",WRONG_ANSWER,10,328
1591704328669519872,d830b0bcae7881ad6d1b2e2b14f3ffa3695b6d3bd622856493fa1cf903c9bf4e,2022-11-13 16:07:39,Java,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint a= sc.nextInt();\n\t\tint b =sc.nextInt();\n\t\tint[] arr1 = new int[n];\n\t\tint[] arr2 = new int[n];\n\t\tfor(int i =0;i< arr1.length;i++){\n\t\t\t\tarr1[i]=sc.nextInt();\n\t\t\t\n\t\t}\n\t\tfor(int i =0;i< arr2.length;i++){\n\t\t\tarr2[i]=sc.nextInt();\n\t\t\n\t\t}\n\t\tint res1=0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tif((arr1[i]/(arr2[i]+1))%(arr1[i]/(arr2[i]+1))!=0){\n\t\t\t\tres1+=((int)(arr1[i]/(arr2[i]+1))+1)*((int)Math.pow(a, arr2[i]+1));\n\t\t\t}\n\t\t\telse{\n\t\t\tres1+=(arr1[i]/(arr2[i]+1))*((int)Math.pow(a, arr2[i]+1));\n\t\t\t\t}\n\t\t\t}\n\t\tint res2=0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tif((arr1[i]/(arr2[i]+1))%(arr1[i]/(arr2[i]+1))!=0){\n\t\t\t\tres2+=((int)(arr1[i]/(arr2[i]+1))+1)*((int)Math.pow(b, arr2[i]+1));\n\t\t\t}\n\t\t\telse{\n\t\t\tres2+=(arr1[i]/(arr2[i]+1))*((int)Math.pow(b, arr2[i]+1));\n\t\t\t\t}\n\t\t\t}\n\t\tint res=res1-res2;\n\t\tSystem.out.print(res);\n\t}\n}",NON_ZERO_EXIT_CODE,107,24452
1591704376853716992,887d1bbe53a4d4a349813887f13126da5e46a853687f4c2c9d7b8ef3d748a9d6,2022-11-13 16:07:50,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int i,n,a,b,num=0;\n    double m=1.0;\n    scanf(\""%d %d %d\"",&n,&a,&b);\n    int c[n],f[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&f[i]);\n    for(i=0;i<n;i++)\n    {\n        m=c[i]/(f[i]+1)*1.0;\n        num+=m*(pow(a,f[i]+1)-pow(b,f[i]+1));\n    }\n    printf(\""%d\"",num);\n}\n",WRONG_ANSWER,10,360
1591704380662099968,9d0546dac18a9dc678295254e547925db086add5f872ef42d8015d525afeaf65,2022-11-13 16:07:51,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,a,b,c1,c2,f1,f2;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    scanf(\""%d%d\"",&c1,&c2);\n    scanf(\""%d%d\"",&f1,&f2);\n    int q,w,e,r,k;\n    int z1,z2,z3,z4;\n    int result1=1,result2=1,result3=1,result4=1;\n    for(z1=1;z1<=f1+1;z1++){\n        result1*=a;\n    }\n    for(z2=1;z2<=f2+1;z2++){\n        result2*=a;\n    }\n    for(z3=1;z3<=f1+1;z3++){\n        result3*=b;\n    }\n    for(z4=1;z4<=f2+1;z4++){\n        result4*=b;\n    }\n    q=(c1/(f1+1))*result1;\n    w=(c2/(f2+1))*result2;\n    e=(c1/(f1+1))*result3;\n    r=(c2/(f2+1))*result4;\n    k=q+w-(e+r);\n    printf(\""%d\\n\"",k);\n}\n",WRONG_ANSWER,12,352
1591704382792806400,281adcca8943f9f4c0ced14f1ceffe157a34fca39f3cb864eb95e400944e38a8,2022-11-13 16:07:51,Java,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner scan=new Scanner(System.in);\n\t\tint n=scan.nextInt();\n\t\tint[] arr=new int[n];\n\t\tint s=0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tarr[i]=scan.nextInt();\n\t\t}\n\t\tint max=0;\n\t\tint len=0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tint h=arr[i];\n\t\t\tfor(int j=i;j<n-1;j++){\n\t\t\t\tif(h>arr[j]){\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tlen++;\n\t\t\t\ts=len*h;\n\t\t\t}\n\t\t\tmax=Math.max(s, max);\n\t\t\ts=0;\n\t\t\tlen=0;\n\t\t}\n        for(int i=arr.length-1;i>0;i--){\n\t\t\tint h=arr[i];\n\t\t\tfor(int j=i;j>0;j--){\n\t\t\t\tif(h>arr[j]){\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tlen++;\n\t\t\t\ts=len*h;\n\t\t\t}\n\t\t\tmax=Math.max(s, max);\n\t\t\ts=0;\n\t\t\tlen=0;\n\t\t}\n\t\tSystem.out.println(max);\n\t}\n}\n",WRONG_ANSWER,231,24804
1591704491932835840,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-13 16:08:17,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#define MAXSIZE 1000\nint main(){\n    long n,s[MAXSIZE],k,i,j,p;\n    long max=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    scanf(\""%d\"",&s[i]);\n    for(i=0;i<n;i++)\n    {\n      j=i+1;\n      while(s[i]<=s[j]&&j!=n)\n      {j++;}\n    k=j-i;\n        p=s[i]*k;\n        max=(max>p)?max:p;\n    }\n    printf(\""%d\\n\"",max);\n    return 0;\n}",WRONG_ANSWER,25,488
1591704614695886848,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 16:08:47,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<iostream>\n#include<algorithm>\n#include <vector>\n\nusing namespace std;\n\nint main()\n{\n    int n;\n    int maxarea = 0;\n    cin >> n;\n    cin.ignore();\n    vector<int> a(n);\n    for (int i = 0; i < n; i++)\n    {\n        cin >> a[i];\n    }\n    for (int i = 0; i < n; i++)\n    {\n        int minvalue = 10000;\n        for (int j = i; j < n; j++)\n        {\n            int height = min(minvalue, a[j]);\n            int area = (j - i + 1) * height;\n            minvalue = height;\n            maxarea = max(area, maxarea);\n        }\n    }\n    cout << maxarea << endl;\n    return 0;\n}\n",WRONG_ANSWER,31,456
1591704642021810176,1f29a576db974352c60cbe8aafdc4e5328b24d800890ab1c712d8c9fa85d72cc,2022-11-13 16:08:53,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint i,add[n];\n\tfor(i=1;i<=n;i++)\n\tscanf(\""%d\"",&add[i]);\n\tint real[n];\n\tfor(i=1;i<=n;i++)\treal[i]=add[i]-5;\n\tint sum=0;\n\tfor(i=1;i<=n;i++)\n\t{\n\t\tif(real[i]>0) sum=sum+real[i];\n\t\tif(real[i]<real[i+2]&&real[i+2]<0) i=i+3;\n\t}\n\tprintf(\""%d\"",sum);\n\treturn 0;\n } ",WRONG_ANSWER,20,352
1591704653132488704,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-13 16:08:56,C++,300.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<iostream>\n#include<algorithm>\n#include <vector>\n\nusing namespace std;\n\nint main()\n{\n    int n;\n    int maxarea = 0;\n    cin >> n;\n    cin.ignore();\n    vector<int> a(n);\n    for (int i = 0; i < n; i++)\n    {\n        cin >> a[i];\n    }\n    for (int i = 0; i < n; i++)\n    {\n        int minvalue = 100000;\n        for (int j = i; j < n; j++)\n        {\n            int height = min(minvalue, a[j]);\n            int area = (j - i + 1) * height;\n            minvalue = height;\n            maxarea = max(area, maxarea);\n        }\n    }\n    cout << maxarea << endl;\n    return 0;\n}\n",ACCEPTED,37,616
1591704714008649728,ddd0edd80a23dfec88d0679f4ed6037779b80d26db4ba0f74fecb3d447de61fa,2022-11-13 16:09:10,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\n#define MAX 1000000\nint main(){\n    int n,i,X[MAX],j,B[MAX],max=0,sum=0,x=0,flag=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n       scanf(\""%d\"",&X[i]);\n    for(i=0;i<n;i++)\n  for(j=0;j<n;j++)\n  {\n      if(X[i]<=X[j]&&flag==0)\n      {\n          sum+=X[i];\n      B[i]=sum;\n    }\n      else\n        flag=1;\n  }\n        for(i=0;i<n;i++)\n            for(j=0;j<n;j++)\n                if(B[i]<=B[j])\n                    max=B[j];\n        printf(\""%d\"",max);\n}",WRONG_ANSWER,7,200
1591704731045912576,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-13 16:09:14,C++,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<iostream>\nusing namespace std;\nint max(int a,int b){\n    return a>b?a:b;\n}\nint main(){\n    int n,h[1000000]={0};\n    cin>>n;\n    int sq=0,Maxa=0;\n    for(int i=0;i<n;i++)\n        cin>>h[i];\n    for(int i=0;i<n;i++){\n        int len=1;\n        for(int j=i+1;j<n;j++){\n            if(h[i]<=h[j])\n                len++;\n            else{\n                sq=h[i]*len;\n                Maxa=max(Maxa,sq);\n                continue;\n            }\n                \n        }\n    }\n    cout<<Maxa<<endl;;\n    return 0;\n}",WRONG_ANSWER,12,4352
1591704755737747456,dcc1017bcd698bd6a0eee54e4ed848d4c51a3a26608990cdd2137e4c01065a1e,2022-11-13 16:09:20,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<iostream>\nusing namespace std;\nclass resolve{\n    public:\n    void resve(int *h,int n){\n        int nums=0;\n        for(int i=1;i<n-1;i++){\n            if(h[i]<h[i-1]){\n                for(int j=1;j<n-1;j++){\n                    if(h[j]<h[j+1]){\n                        nums++;\n                        i=j+1;\n                        break;\n                    }\n                }\n            }\n        }\n        cout<<nums<<endl;\n    }\n};\n\nint main(){\n    int n,h[1000]={0};\n    cin>>n;\n    if(n<3)\n        return 0;\n    for(int i=0;i<n;i++){\n        cin>>h[i];\n    }\n    resolve res;\n    if(h[0]==0&&h[n-1]==0)\n        res.resve(h,n);\n    return 0;\n}",TIME_LIMIT_EXCEEDED,400,476
1591704769474080768,1f29a576db974352c60cbe8aafdc4e5328b24d800890ab1c712d8c9fa85d72cc,2022-11-13 16:09:24,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint i,add[n];\n\tfor(i=1;i<=n;i++)\n\tscanf(\""%d\"",&add[i]);\n\tint real[n];\n\tfor(i=1;i<=n;i++)\treal[i]=add[i]-5;\n\tint sum=0;\n\tfor(i=1;i<=n;i++)\n\t{\n\t\tif(real[i]>0) sum=sum+real[i];\n\t\tif(real[i]<real[i+2]&&real[i+2]<0) i=i+2;\n\t}\n\tprintf(\""%d\"",sum);\n\treturn 0;\n } ",WRONG_ANSWER,16,352
1591704771273449472,dcc1017bcd698bd6a0eee54e4ed848d4c51a3a26608990cdd2137e4c01065a1e,2022-11-13 16:09:24,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<iostream>\nusing namespace std;\nclass resolve{\n    public:\n    void resve(int *h,int n){\n        int nums=0;\n        for(int i=1;i<n-1;i++){\n            if(h[i]<h[i-1]){\n                for(int j=1;j<n-1;j++){\n                    if(h[j]<h[j+1]){\n                        nums++;\n                        i=j+1;\n                        break;\n                    }\n                }\n            }\n        }\n        cout<<nums<<endl;\n    }\n};\n\nint main(){\n    int n,h[1000]={0};\n    cin>>n;\n    if(n<3)\n        return 0;\n    for(int i=0;i<n;i++){\n        cin>>h[i];\n    }\n    resolve res;\n    if(h[0]==0&&h[n-1]==0)\n        res.resve(h,n);\n    return 0;\n}",TIME_LIMIT_EXCEEDED,400,348
1591704771399278592,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-13 16:09:24,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include <stdio.h>\n#define MAXSIZE 100000\nint main(){\n    long n,s[MAXSIZE],k,i,j,p;\n    long max=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    scanf(\""%d\"",&s[i]);\n    for(i=0;i<n;i++)\n    {\n      j=i+1;\n      while(s[i]<=s[j]&&j!=n)\n      {j++;}\n    k=j-i;\n        p=s[i]*k;\n        max=(max>p)?max:p;\n    }\n    printf(\""%d\\n\"",max);\n    return 0;\n}",WRONG_ANSWER,20,640
1591704781796990976,dcc1017bcd698bd6a0eee54e4ed848d4c51a3a26608990cdd2137e4c01065a1e,2022-11-13 16:09:27,C++,0.0,1591610585639407616,1591132307937943552,1049226928954454016,"#include<iostream>\nusing namespace std;\nclass resolve{\n    public:\n    void resve(int *h,int n){\n        int nums=0;\n        for(int i=1;i<n-1;i++){\n            if(h[i]<h[i-1]){\n                for(int j=1;j<n-1;j++){\n                    if(h[j]<h[j+1]){\n                        nums++;\n                        i=j+1;\n                        break;\n                    }\n                }\n            }\n        }\n        cout<<nums<<endl;\n    }\n};\n\nint main(){\n    int n,h[1000]={0};\n    cin>>n;\n    if(n<3)\n        return 0;\n    for(int i=0;i<n;i++){\n        cin>>h[i];\n    }\n    resolve res;\n    if(h[0]==0&&h[n-1]==0)\n        res.resve(h,n);\n    return 0;\n}",TIME_LIMIT_EXCEEDED,400,476
1591704786217787392,9d0546dac18a9dc678295254e547925db086add5f872ef42d8015d525afeaf65,2022-11-13 16:09:28,C,0.0,1591610585635213317,1591130976212869120,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,a,b,c1,c2,f1,f2;\n    scanf(\""%d%d%d\"",&n,&a,&b);\n    scanf(\""%d%d\"",&c1,&c2);\n    scanf(\""%d%d\"",&f1,&f2);\n    int q,w,e,r,k;\n    int z1,z2,z3,z4;\n    int result1=1,result2=1,result3=1,result4=1;\n    for(z1=1;z1<=f1+1;z1++){\n        result1*=a;\n    }\n    for(z2=1;z2<=f2+1;z2++){\n        result2*=a;\n    }\n    for(z3=1;z3<=f1+1;z3++){\n        result3*=b;\n    }\n    for(z4=1;z4<=f2+1;z4++){\n        result4*=b;\n    }\n    q=(c1/(f1+1))*result1;\n    w=(c2/(f2+1))*result2;\n    e=(c1/(f1+1))*result3;\n    r=(c2/(f2+1))*result4;\n    k=q+w-(e+r);\n    printf(\""%d\\n\"",k);\n}\n",WRONG_ANSWER,4,324
1591704838713651200,3e087b0a196d30fcbb49ca80164c9eb5adf82ae3bb08ec0c141e5728fb180f0d,2022-11-13 16:09:40,Java,0.0,1591610585635213312,1589816514637750272,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner sc=new Scanner(System.in);\n\t\tint i=0,res=0,len;\n\t\tint n=sc.nextInt();\n\t\tsc.nextLine();\n\t\tString str=sc.nextLine();\n\t\tString[] arr=str.split(\""\"");\n\t\tlen=n;\n\t\twhile(i<=len-2){\n\t\t\tif(arr[i].equals(arr[i+1])){\n\t\t\t\ti++;\n\t\t\t}else{\n\t\t\t\tres=res+2;\n\t\t\t\tfor(int j=i;j<len-2;j++){\n\t\t\t\t\tarr[j]=arr[j+2];\n\t\t\t\t}\n\t\t\t\tlen=len-2;\n\t\t\t\tif(i!=0){\n\t\t\t\t\ti--;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.print(res);\n\t\tsc.close();\n\t}\n}",TIME_LIMIT_EXCEEDED,861,35112
1591704843696529408,86f702b052a21d7cb2f8cd933c678c21efaafaf5b2d35032f18ec35c1e26a945,2022-11-13 16:09:41,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,max=0;\n    int c,b,x,d;\n    scanf(\""%d\"",&n);\n    int a[1000000000]={0};\n    for(i=1;i<=n;i++)\n    scanf(\""%d\"",&a[i]);\n    x=0;\n   while(x<n)\n    {\n        c=a[x+1]-5;\n        b=a[x+3]-5;\n        d=a[x+2]-5;\n       if(x<n-1)\n       {  if(c>=0) \n          {max=c+max;\n           x=x+1;}\n          else\n          {\n            if(c+d>b){\n                max=c+max;\n                x=x+1; }\n            else\n            {max=b+max;\n             x=x+3; }\n          }\n       }\n       else \n       {max=c+max;\n          x=x+1;}\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",SEGMENTATION_FAULT,19,500
1591704881944387584,c76414e1d2d8531a5745e9bd3192aafa7cca924e645650ffe7954c992cc13b33,2022-11-13 16:09:50,C,0.0,1591610585639407617,1591132482555211776,1049226928954454016,"#include<stdio.h>\nint main()\n{\nint x,i,sum=0,t=0;\nscanf(\""%d\"",&x);\nint a[x];\nfor(i=0;i<x;i++)\nscanf(\""%d\"",&a[i]);\n}\n",WRONG_ANSWER,5,216
1591704884121198592,86f702b052a21d7cb2f8cd933c678c21efaafaf5b2d35032f18ec35c1e26a945,2022-11-13 16:09:51,C,0.0,1591610585635213315,1591129345182261248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,max=0;\n    int c,b,x,d;\n    scanf(\""%d\"",&n);\n    int a[1000000]={0};\n    for(i=1;i<=n;i++)\n    scanf(\""%d\"",&a[i]);\n    x=0;\n   while(x<n)\n    {\n        c=a[x+1]-5;\n        b=a[x+3]-5;\n        d=a[x+2]-5;\n       if(x<n-1)\n       {  if(c>=0) \n          {max=c+max;\n           x=x+1;}\n          else\n          {\n            if(c+d>b){\n                max=c+max;\n                x=x+1; }\n            else\n            {max=b+max;\n             x=x+3; }\n          }\n       }\n       else \n       {max=c+max;\n          x=x+1;}\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",WRONG_ANSWER,12,4264
1588765023135137792,9f8da61264ed45a9a4307a5f0c88c4b98df8923ee5d381bfc8c77688ee4aaaa0,2022-11-05 13:27:54,C++,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#define _CRT_SECURE_NO_WARNINGS 1\n#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#include<string.h>\n#include<iostream>\n#include<string>\n#include<cstdio>\nusing namespace std;\nint ikun(int);\nint main()\n{\n\tint t;\n\tint day=0;\n\tint y, m, d;\n\tscanf(\""%d\"", &t);\n\twhile (t--) {\n\t\tscanf(\""%d-%d-%d\"", &y, &m, &d);\n\t\tint i = y;\n\t\tif (ikun(y + 10) && m == 2 && d == 29) {\n\t\t\tprintf(\""-1/n\"");\n\t\t\tcontinue;\n\t\t}\n\t\telse if (ikun(y) && m > 2) {\n\t\t\tday += 365;\n\t\t\ti = y + 1;\n\t\t}\n\t\tfor (; i < y + 10; i++) {\n\t\t\tif (ikun(i))day += 366;\n\t\t\telse day += 365;\n\t\t}\n\t\tprintf(\""%d\\n\"", day);\n\t\tday = 0;\n\t}\n\treturn 0;\n}\nint ikun(int x)\n{\n\tif ((x % 4 == 0 && x % 100 != 0) || x % 400 == 0)return 1;\n\telse return 0;\n}\n",WRONG_ANSWER,9,332
1588765972805234688,9f8da61264ed45a9a4307a5f0c88c4b98df8923ee5d381bfc8c77688ee4aaaa0,2022-11-05 13:31:40,C++,300.0,1587108005060050944,1587107403563302912,1049226928954454016,"#define _CRT_SECURE_NO_WARNINGS 1\n#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#include<string.h>\n#include<iostream>\n#include<string>\n#include<cstdio>\nusing namespace std;\nint ikun(int);\nint main()\n{\n\tint t;\n\tint day=0;\n\tint y, m, d;\n\tscanf(\""%d\"", &t);\n\twhile (t--) {\n\t\tscanf(\""%d-%d-%d\"", &y, &m, &d);\n\t\tint i = y;\n\t\tif (m == 2 && d == 29) {\n\t\t\tprintf(\""-1\\n\"");\n\t\t\tcontinue;\n\t\t}\n\t\telse if (ikun(y) && m > 2) {\n\t\t\tday += 365;\n\t\t\ti = y + 1;\n\t\t}\n\t\tfor (; i < y + 10; i++) {\n\t\t\tif (ikun(i))day += 366;\n\t\t\telse day += 365;\n\t\t}\n\t\tprintf(\""%d\\n\"", day);\n\t\tday = 0;\n\t}\n\treturn 0;\n}\nint ikun(int x)\n{\n\tif ((x % 4 == 0 && x % 100 != 0) || x % 400 == 0)return 1;\n\telse return 0;\n}\n",ACCEPTED,4,460
1588766123133284352,9284f371e83346e627f92f90fc079849e36f8c6a282f8fa1e865608956e98196,2022-11-05 13:32:16,C++,300.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint a[1000000];\nint main()\n{\n\tint n,y,m,d;\n\tscanf(\""%d\"",&n);\n\twhile(n--)\n\t{\n\t\tint sumD=3650;\n\t\tscanf(\""%d-%d-%d\"",&y,&m,&d);\n\t\tif(y%4==0&&y%100!=0||y%400==0)\n\t\t{\n\t\t\tif(d==29&&m==2)\n\t\t\t{\n\t\t\t\tprintf(\""-1\\n\"");\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\telse if(m==2&&d<=28||m==1)\n\t\t\t\tsumD++;\n\t\t}\n\t\tif((y+10)%4==0&&(y+10)%100!=0||(y+10)%400==0)\n\t\t{\n\t\t\tif(m>2)\n\t\t\t\tsumD++;\n\t\t}\n\t\tfor(int i=1;i<=9;i++)\n\t\t{\n\t\t\tint y1=i+y;\n\t\t\tif(y1%4==0&&y1%100!=0||y1%400==0)\n\t\t\t{\n\t\t\t\tsumD++;\n\t\t\t}\n\t\t\t\n\t\t}\n\t\tprintf(\""%d\\n\"",sumD);\n\t}\n\treturn 0;\n}",ACCEPTED,5,476
1588769542128578560,d6f2ab4cda695e0d5d7e30ce5405a0d0874ead144f0ffcdded61d702f2d17123,2022-11-05 13:45:51,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include <stdio.h>\nint sum_year(int ,int ,int );\nint main()\n{\n\tint T;\n\tscanf(\""%d\"",&T);\n\twhile(T--)\n\t{\n\t\tint year,month,day;\n\t\tscanf(\""%d-%d-%d\"",&year,&month,&day);\n\t\t//printf(\""%d-%d-%d\"",year,month,day);\n\t\tif(year < 0 || month < 0|| day < 0 || day > 31 || month > 12)\n\t\t\tprintf(\""-1\\n\"");\n\t\telse\n\t\t\tprintf(\""%d\\n\"",sum_year(year,month,day));\n\t}\n\t\n\treturn 0;\n}\nint sum_year(int year,int month,int day)\n{\n\tint i,sum = 0;\n\tfor (i = year+1;i <= year + 10;i++)\n\t{\n\t\tif ((i % 4 == 0 && i % 100 != 0)||(i % 400 ==0))\n\t\t{\n\t\t\tsum = sum + 366;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tsum = sum + 365;\n\t\t}\n\t}\n\tif ((year % 4 == 0 && year % 100 != 0)||(year % 400 == 0))\n\t{\n\t\tfor (i = 1;i <= month;i++)\n\t\t{\n\t\t\tif (i == 2) sum = sum - 29;\n\t\t\telse if (i == 4 || i == 6 ||i == 9 || i == 11) sum = sum - 30;\n\t\t\telse sum = sum - 31;\n\t\t}\n\t}\n\telse\n\t{\n\t\tfor (i = 1;i <= month;i++)\n\t\t{\n\t\t\tif (i == 2) sum = sum - 28;\n\t\t\telse if (i == 4 || i == 6 ||i == 9 || i == 11) sum = sum - 30;\n\t\t\telse sum = sum - 31;\n\t\t}\n\t}\n\tif ((year+10 % 4 == 0 && year+10 % 100 != 0)||(year+10 % 400 ==0))\n\t{\n\t\tfor (i = 1;i <= month;i++)\n\t\t{\n\t\t\tif (i == 2) sum = sum + 29;\n\t\t\telse if (i == 4 || i == 6 ||i == 9 || i == 11) sum = sum + 30;\n\t\t\telse sum = sum + 31;\n\t\t}\n\t}\n\telse\n\t{\n\t\tfor (i = 1;i <= month;i++)\n\t\t{\n\t\t\tif (i == 2) sum = sum + 28;\n\t\t\telse if (i == 4 || i == 6 ||i == 9 || i == 11) sum = sum + 30;\n\t\t\telse sum = sum + 31;\n\t\t}\n\t}\n\treturn sum;\n}",WRONG_ANSWER,4,328
1588769863605227520,d156a06816c1bf347ccca3ec432bf7dad3f93c19ee6fa2cca52da36af0c90242,2022-11-05 13:47:08,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include \""stdio.h\""\nint main(){\n    int n,day=0;\n    int year,b,c;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        scanf(\""%d-%d-%d\"",&year,&b,&c);\n        for(int k=0;k<10;k++){\n            year+=k;\n            if(year%4==0&&year%100!=0||year%400==0)\n            {\n            day+=366;\n            }\n            else day+=365;\n        }\n        printf(\""%d\"",day);\n    }\n}",WRONG_ANSWER,5,200
1588770320994078720,d156a06816c1bf347ccca3ec432bf7dad3f93c19ee6fa2cca52da36af0c90242,2022-11-05 13:48:57,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include \""stdio.h\""\nint main(){\n    int n,day=0;\n    int year,b,c;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        scanf(\""%d-%d-%d\"",&year,&b,&c);\n        for(int k=0;k<10;k++){\n            year+=k;\n            if(year%4==0&&year%100!=0||year%400==0)\n            {\n            day+=366;\n            }\n            else day+=365;\n        }\n        \n        printf(\""%d\"",day-1);\n    }\n}",WRONG_ANSWER,5,200
1588770343534268416,d156a06816c1bf347ccca3ec432bf7dad3f93c19ee6fa2cca52da36af0c90242,2022-11-05 13:49:02,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include \""stdio.h\""\nint main(){\n    int n,day=0;\n    int year,b,c;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        scanf(\""%d-%d-%d\"",&year,&b,&c);\n        for(int k=0;k<10;k++){\n            year+=k;\n            if(year%4==0&&year%100!=0||year%400==0)\n            {\n            day+=366;\n            }\n            else day+=365;\n        }\n        \n        printf(\""%d\"",day);\n    }\n}",WRONG_ANSWER,5,204
1588770585231032320,d6f2ab4cda695e0d5d7e30ce5405a0d0874ead144f0ffcdded61d702f2d17123,2022-11-05 13:50:00,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include <stdio.h>\nint sum_year(int ,int ,int );\nint main()\n{\n\tint T;\n\tscanf(\""%d\"",&T);\n\twhile(T--)\n\t{\n\t\tint year,month,day;\n\t\tscanf(\""%d-%d-%d\"",&year,&month,&day);\n\t\t//printf(\""%d-%d-%d\"",year,month,day);\n\t\tif(((year+10 % 4 == 0 && year+10 % 100 != 0)||(year+10 % 400 ==0)) && month == 2 && year == 29)\n\t\t\tprintf(\""-1\\n\"");\n\t\telse\n\t\t\tprintf(\""%d\\n\"",sum_year(year,month,day));\n\t}\n\t\n\treturn 0;\n}\nint sum_year(int year,int month,int day)\n{\n\tint i,sum = 0;\n\tfor (i = year+1;i <= year + 10;i++)\n\t{\n\t\tif ((i % 4 == 0 && i % 100 != 0)||(i % 400 ==0))\n\t\t{\n\t\t\tsum = sum + 366;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tsum = sum + 365;\n\t\t}\n\t}\n\tif ((year % 4 == 0 && year % 100 != 0)||(year % 400 == 0))\n\t{\n\t\tfor (i = 1;i <= month;i++)\n\t\t{\n\t\t\tif (i == 2) sum = sum - 29;\n\t\t\telse if (i == 4 || i == 6 ||i == 9 || i == 11) sum = sum - 30;\n\t\t\telse sum = sum - 31;\n\t\t}\n\t}\n\telse\n\t{\n\t\tfor (i = 1;i <= month;i++)\n\t\t{\n\t\t\tif (i == 2) sum = sum - 28;\n\t\t\telse if (i == 4 || i == 6 ||i == 9 || i == 11) sum = sum - 30;\n\t\t\telse sum = sum - 31;\n\t\t}\n\t}\n\tif ((year+10 % 4 == 0 && year+10 % 100 != 0)||(year+10 % 400 ==0))\n\t{\n\t\tfor (i = 1;i <= month;i++)\n\t\t{\n\t\t\tif (i == 2) sum = sum + 29;\n\t\t\telse if (i == 4 || i == 6 ||i == 9 || i == 11) sum = sum + 30;\n\t\t\telse sum = sum + 31;\n\t\t}\n\t}\n\telse\n\t{\n\t\tfor (i = 1;i <= month;i++)\n\t\t{\n\t\t\tif (i == 2) sum = sum + 28;\n\t\t\telse if (i == 4 || i == 6 ||i == 9 || i == 11) sum = sum + 30;\n\t\t\telse sum = sum + 31;\n\t\t}\n\t}\n\treturn sum;\n}",WRONG_ANSWER,5,328
1588770741921845248,cc9f777f5dea4bc4342fec80f59ef3a14266fc538216baba5b5530fe019e3a77,2022-11-05 13:50:37,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include <stdio.h>\n\nint main() {\n\tint a, i, sum;\n\tint n, y, r;\n\tscanf(\""%d\"", &a);\n\twhile (a--) {\n\t\tsum = 0;\n\t\tscanf(\""%d-%d-%d\"", &n, &y, &r);\n\t\tfor (i = n; i < n + 10; i++) {\n\t\t\tif (i % 4 == 0 && i % 100 !=0 || i % 400 == 0)\n\t\t\t\tsum += 366;\n\t\t\telse\n\t\t\t\tsum += 365;\n\t\t}\n\t\tprintf(\""%d\"", sum);\n\t}\n\treturn 0;\n}\n",WRONG_ANSWER,4,332
1588770772724809728,cc9f777f5dea4bc4342fec80f59ef3a14266fc538216baba5b5530fe019e3a77,2022-11-05 13:50:44,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include <stdio.h>\n\nint main() {\n\tint a, i, sum;\n\tint n, y, r;\n\tscanf(\""%d\"", &a);\n\twhile (a--) {\n\t\tsum = 0;\n\t\tscanf(\""%d-%d-%d\"", &n, &y, &r);\n\t\tfor (i = n; i < n + 10; i++) {\n\t\t\tif (i % 4 == 0 && i % 100 !=0 || i % 400 == 0)\n\t\t\t\tsum += 366;\n\t\t\telse\n\t\t\t\tsum += 365;\n\t\t}\n\t\tprintf(\""%d\\n\"", sum);\n\t}\n\treturn 0;\n}\n",WRONG_ANSWER,5,476
1588772118899261440,12aa33ee8db8cc8975920bb2e9fd4d4223b232e7be516e0ce206117b1000ec62,2022-11-05 13:56:05,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint r=3650,y,i,m,d,t;\n\tscanf(\""%d\"",&t);\n\twhile(t--)\n\t{\n\t\tscanf(\""%d-%d-%d\"",&y,&m,&d);\n\t\tif(y>0&&(m>0&&m<=12)&&(d>=1&&d<=31))\n\t\t{\n\t\t\tfor(i=y;i<=y+10;i++)\n\t\t\t{\n\t\t\t\tif((i%4==0&&i%100!=0)||i%400==0) r++;\n\t\t\t}\n\t\t\tprintf(\""%d\"",r);\n\t\t}\n\t\telse\n\t\tprintf(\""-1\"");\n\t}\n\treturn 0;\n}",WRONG_ANSWER,5,476
1588772919986163712,dda3a838511d60a585db07ada95cfe8146d1f6db4124bf537d104c3a010de940,2022-11-05 13:59:16,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include<stdio.h>\n#include<string.h>\nint isOK(int year)//判断是不是闰年，是就返回1，不是返回0\n{\n  if((year%4==0&&year%100!=0)||(year%400==0)){return 1;}\n  else{return 0;}\n}\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    int year,month,day;\n    for(int i=0;i<n;i++)\n    {\n        scanf(\""%d-%d-%d\"",&year,&month,&day);\n        if(month==2&&day==29)\n        {printf(\""-1\\n\"");//十周年结束时间不存在； }\n        else\n        {\n            int sum=0;\n            if(month>2)\n            {\n                for(int i=year+1;i<=year+18;i++)\n                {\n                    if(isOK(i))sum+=366;\n                    else       sum+=365;\n                }\n            }\n            else\n            {\n                for(int i=year+0;i<year+18;i++){\n                //如果月份小于等于2，\n                //取决于第一年是不是闰年\n                    if(isOK(i))sum+=366;\n                    else       sum+=365;\n                }\n            }\n            printf(\""%d\\n\"",sum);\n        }\n    }\n    return 0;\n}\n\n",COMPILE_ERROR,0,0
1588773324606451712,dda3a838511d60a585db07ada95cfe8146d1f6db4124bf537d104c3a010de940,2022-11-05 14:00:53,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include<stdio.h>\n#include<string.h>\nint isOK(int year)//判断是不是闰年，是就返回1，不是返回0\n{\n  if((year%4==0&&year%100!=0)||(year%400==0)){return 1;}\n  else{return 0;}\n}\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    int year,month,day;\n    for(int i=0;i<n;i++)\n    {\n        scanf(\""%d-%d-%d\"",&year,&month,&day);\n        if(month==2&&day==29)\n        {printf(\""-1\\n\"");}\n        else\n        {\n            int sum=0;\n            if(month>2)\n            {\n                for(int i=year+1;i<=year+18;i++)\n                {\n                    if(isOK(i))sum+=366;\n                    else       sum+=365;\n                }\n            }\n            else\n            {\n                for(int i=year+0;i<year+18;i++){\n                    if(isOK(i))sum+=366;\n                    else       sum+=365;\n                }\n            }\n            printf(\""%d\\n\"",sum);\n        }\n    }\n    return 0;\n}\n\n",WRONG_ANSWER,4,356
1588773699413651456,70eba4afbfa4c7bd72f3976237074c9ab261e8cc5d734d2bc3bf971b59cdf744,2022-11-05 14:02:22,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,y,m,d,y1=0,num=0;\n    scanf(\""%d\"",&a);\n    for(int i=1;i<=a;i++){\n        scanf(\""%d-%d-%d\"",&y,&m,&d);\n        num=0;\n        y1=0;\n        if(m==2&&d==29)printf(\""-1\\n\"");\n        else {\n            while(y1<10){\n            if(y%4==0&&y%100!=0||y%400==0)num+=366;\n            else num+=365;\n            y1++;\n            y++;\n        }\n        printf(\""%d\\n\"",num);\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,6,348
1588773760281415680,cc9f777f5dea4bc4342fec80f59ef3a14266fc538216baba5b5530fe019e3a77,2022-11-05 14:02:37,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include <stdio.h>\n\nint main() {\n\tint a, i, sum;\n\tint n, y, r;\n\tscanf(\""%d\"", &a);\n\tint j;\n\tj = a;\n\twhile (a--) {\n\t\tsum = 0;\n\t\tscanf(\""%d-%d-%d\"", &n, &y, &r);\n\t\tif (y == 02 && r == 29) {\n\t\t\tsum = -1;\n\t\t} else {\n\t\t\tfor (i = n + 1; i < n + 9; i++) {\n\t\t\t\tif (i % 4 == 0 && i % 100 != 0 || i % 400 == 0)\n\t\t\t\t\tsum += 366;\n\t\t\t\telse\n\t\t\t\t\tsum += 365;\n\t\t\t}\n\t\t\tif (y <= 2 || r < 29) {\n\t\t\t\tif (n % 4 == 0 && n % 100 != 0 || n % 400 == 0)\n\t\t\t\t\tsum += 366;\n\t\t\t\telse\n\t\t\t\t\tsum += 365;\n\t\t\t\tif (n + 9 % 4 == 0 && n + 9 % 100 != 0 || n + 9 % 400 == 0)\n\t\t\t\t\tsum += 366;\n\t\t\t\telse\n\t\t\t\t\tsum += 365;\n\t\t\t}\n\t\t\tif (y > 2) {\n\t\t\t\tif (n + 9 % 4 == 0 && n + 9 % 100 != 0 || n + 9 % 400 == 0)\n\t\t\t\t\tsum += 366;\n\t\t\t\telse\n\t\t\t\t\tsum += 365;\n\t\t\t\tif (n % 4 == 0 && n % 100 != 0 || n % 400 == 0)\n\t\t\t\t\tsum += 366;\n\t\t\t\telse\n\t\t\t\t\tsum += 365;\n\t\t\t}\n\t\t}\n\t\tprintf(\""%d\"", sum);\n\t}\n\treturn 0;\n}\n",WRONG_ANSWER,5,352
1588774323131842560,cc9f777f5dea4bc4342fec80f59ef3a14266fc538216baba5b5530fe019e3a77,2022-11-05 14:04:51,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include <stdio.h>\n\nint main() {\n\tint a, i, sum;\n\tint n, y, r;\n\tscanf(\""%d\"", &a);\n\tint j;\n\tj = a;\n\twhile (a--) {\n\t\tsum = 0;\n\t\tscanf(\""%d-%d-%d\"", &n, &y, &r);\n\t\tif (y == 02 && r == 29) {\n\t\t\tsum = -1;\n\t\t} else {\n\t\t\tfor (i = n + 1; i < n + 9; i++) {\n\t\t\t\tif (i % 4 == 0 && i % 100 != 0 || i % 400 == 0)\n\t\t\t\t\tsum += 366;\n\t\t\t\telse\n\t\t\t\t\tsum += 365;\n\t\t\t}\n\t\t\tif (y <= 2 || r < 29) {\n\t\t\t\tif (n % 4 == 0 && n % 100 != 0 || n % 400 == 0)\n\t\t\t\t\tsum += 366;\n\t\t\t\telse\n\t\t\t\t\tsum += 365;\n\t\t\t\tif (n + 9 % 4 == 0 && n + 9 % 100 != 0 || n + 9 % 400 == 0)\n\t\t\t\t\tsum += 366;\n\t\t\t\telse\n\t\t\t\t\tsum += 365;\n\t\t\t}\n\t\t\tif (y > 2) {\n\t\t\t\tif (n + 9 % 4 == 0 && n + 9 % 100 != 0 || n + 9 % 400 == 0)\n\t\t\t\t\tsum += 366;\n\t\t\t\telse\n\t\t\t\t\tsum += 365;\n\t\t\t\tif (n % 4 == 0 && n % 100 != 0 || n % 400 == 0)\n\t\t\t\t\tsum += 366;\n\t\t\t\telse\n\t\t\t\t\tsum += 365;\n\t\t\t}\n\t\t}\n        if(j!=a+1)printf(\""\\n\"");\n\t\tprintf(\""%d\"", sum);\n\t}\n\treturn 0;\n}\n",WRONG_ANSWER,5,328
1588774837609365504,70eba4afbfa4c7bd72f3976237074c9ab261e8cc5d734d2bc3bf971b59cdf744,2022-11-05 14:06:53,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,y,m,d,y1=0,num=0;\n    scanf(\""%d\"",&a);\n    for(int i=1;i<=a;i++){\n        scanf(\""%d-%d-%d\"",&y,&m,&d);\n        num=0;\n        y1=0;\n        if(m==2&&d==29)printf(\""-1\\n\"");\n        else {\n            while(y1<10){\n            if((y%4==0&&y%100!=0||y%400==0)&&m>=3)num+=365;\n            else if((y%4==0&&y%100!=0||y%400==0)&&m<=2)num+=366;\n            else num+=365;\n            y1++;\n            y++;\n        }\n        printf(\""%d\\n\"",num);\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,6,352
1588775087795404800,d4d89a60a1e51464e3a83a7b5a3387d374033bcc3c66bb32a3a08873d696f6cf,2022-11-05 14:07:53,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#define _CRT_SECURE_NO_WARNINGS\n#include<stdio.h>\n\nint main()\n{\n    int T;\n    int arrMonth[12] = { 31,28,31,30,31,30,31,31,30,31,30,31 };\n    while (~scanf(\""%d\"", &T))\n    {\n        int sum = 0;\n        for (int i = 0;i < T;i++) {\n            int year, month, day;\n            scanf(\""%d-%d-%d\"",&year,&month,&day);\n            for (int j = 0;j < 10;j++) {\n                year++;\n                arrMonth[1] = 28;\n                if (year % 4 == 0 && year % 100 != 0 || year % 400 == 0) arrMonth[1]++;\n                for (int k = 0;k < 12; k++) sum += arrMonth[k]; \n            }\n            \n            //for (int l = 0;l < month - 1;l++) sum += arrMonth[l];\n            //sum += day;\n            printf(\""%d\\n\"", sum);\n        }\n       \n    }\n    return 0;\n}",WRONG_ANSWER,6,200
1588775913922277376,70eba4afbfa4c7bd72f3976237074c9ab261e8cc5d734d2bc3bf971b59cdf744,2022-11-05 14:11:10,C,300.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,y,m,d,y1=0,num=0;\n    scanf(\""%d\"",&a);\n    for(int i=1;i<=a;i++){\n        scanf(\""%d-%d-%d\"",&y,&m,&d);\n        num=0;\n        y1=0;\n        if(m==2&&d==29)printf(\""-1\\n\"");\n        else {\n            while(y1<10){\n            if((y%4==0&&y%100!=0||y%400==0)&&m>=3)num+=365;\n            else if((y%4==0&&y%100!=0||y%400==0)&&m<=2)num+=366;\n            else if(((y+1)%4==0&&(y+1)%100!=0||(y+1)%400==0)&&m<=2)num+=365;\n            else if(((y+1)%4==0&&(y+1)%100!=0||(y+1)%400==0)&&m>=3)num+=366;\n                else num+=365;\n            y1++;\n            y++;\n        }\n        printf(\""%d\\n\"",num);\n        }\n    }\n    return 0;\n}",ACCEPTED,7,380
1588776081493135360,12aa33ee8db8cc8975920bb2e9fd4d4223b232e7be516e0ce206117b1000ec62,2022-11-05 14:11:50,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint r=3650,y,m,d,t,i;\n\tscanf(\""%d\"",&t);\n\twhile(t--)\n\t{\n\t\tscanf(\""%d-%d-%d\"",&y,&m,&d);\n\t\tif(y>0&&(m>0&&m<=12)&&(d>=1&&d<=31))\n\t\t{\tif((m==4||m==6||m==9||m==11)&&d==31)\n\t\t\tr=-1;\n\t\t\tif((m==2&&(y%4==0&&y%100!=0)||y%400==0)&&d>29)\n\t\t\tr=-1;\n\t\t\tif(m==2&&y%4!=0&&d>28)\n\t\t\tr=-1;\n\t\t\tif(r>0)\n\t\t\t{\n\t\t\t\tfor(i=y;i<=y+10;i++)\n\t\t\t{\n\t\t\t\tif((i%4==0&&i%100!=0)||i%400==0) r++;\n\t\t\t}\n\t\t\t}\n\t\t\tprintf(\""%d\"",r);\n\t\t\t\n\t\t\t\n\t\t}\n\t\telse\n\t\tprintf(\""-1\"");\n\t}\n\treturn 0;\n}",WRONG_ANSWER,9,332
1588776317124915200,99f126d2048d4638923c66cbed76f1d4d74270157d5b0e21086d526e9d28f983,2022-11-05 14:12:46,C++,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n\tint n;\n    while(cin>>n){\n    \twhile(n--){\n    \t\tint yy,mm,dd;\n    \t\tscanf(\""%d-%d-%d\"",&yy,&mm,&dd);\n    \t\tif(dd==29)\n    \t\t\tcout<<\""-1\""<<endl;\n    \t\telse{\n    \t\t\tint sum=3650;\n    \t\t\tfor(int i=yy;i<=yy+10;i++){\n    \t\t\t\tif(i%4==0&&i%100!=0||i%400==0)\n    \t\t\t\t\tsum++;\n\t\t\t\t}\n\t\t\t\tcout<<sum<<endl;\n\t\t\t}\t\n\t\t}\n    \t\t\n\t}\n    return 0;\n}\n ",WRONG_ANSWER,7,492
1588776518053068800,d4d89a60a1e51464e3a83a7b5a3387d374033bcc3c66bb32a3a08873d696f6cf,2022-11-05 14:13:34,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#define _CRT_SECURE_NO_WARNINGS\n#include<stdio.h>\n\nint main()\n{\n    int T;\n    int arrMonth[12] = { 31,28,31,30,31,30,31,31,30,31,30,31 };\n    while (~scanf(\""%d\"", &T))\n    {\n        int sum = 0;\n        if (T <= 0) printf(\""-1\\n\"");\n        for (int i = 0;i < T;i++) {\n            int year, month, day;\n            scanf(\""%d-%d-%d\"",&year,&month,&day);\n\n            if (month == 2 && day == 29) {\n                printf(\""%d\\n\"", -1);\n                break;\n            }\n\n            for (int j = 0;j < 10;j++) {\n                year++;\n                arrMonth[1] = 28;\n                if (year % 4 == 0 && year % 100 != 0 || year % 400 == 0) arrMonth[1]++;\n                for (int k = 0;k < 12; k++) sum += arrMonth[k]; \n            }\n            \n            //for (int l = 0;l < month - 1;l++) sum += arrMonth[l];\n            //sum += day;\n            printf(\""%d\\n\"", sum);\n        }\n       \n    }\n    return 0;\n}",WRONG_ANSWER,5,208
1588776540370964480,f7cee7212f6fae275293fba2e8139df0dda99a9956af1630b542f69557dbad1f,2022-11-05 14:13:39,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"\nbool Is_leap(int x);//判断是否为闰年的函数\nint main()\n{\n\tint n, i;\n\tscanf(\""%d\"", &n);\n\twhile (n--) {\n\t\tint year, month, day;\n\t\tint sum = 0;\n\t\tscanf(\""%d-%d-%d\"", &year, &month, &day);\n\t\tif (month == 2 && day == 29) {//没有生日\n\t\t\tprintf(\""-1\\n\"");continue;\n\t\t}\n\t\tif (month <= 2)\n\t\t\tfor (i = 0;i < 10;i++) {\n\t\t\t\tif (Is_leap(year + i))\tsum += 366;\n\t\t\t\telse\t\t\t\tsum += 365;\n\t\t\t}\n\t\telse\n\t\t\tfor (i = 1;i <= 10;i++) {\n\t\t\t\tif (Is_leap(year + i))\tsum += 366;\n\t\t\t\telse\t\t\t\tsum += 365;\n\t\t\t}\n\t\tprintf(\""%d\\n\"", sum);\n\t}\n}\nbool Is_leap(int x)\n{\n\tif ((x % 4 == 0 && x % 100 != 0) || x % 400 == 0) return true;\n\telse \t\t\t\t\t\t\t   return false;\n}",COMPILE_ERROR,0,0
1588776690271170560,f7cee7212f6fae275293fba2e8139df0dda99a9956af1630b542f69557dbad1f,2022-11-05 14:14:15,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#define _CRT_SECURE_NO_WARNINGS 1\n#include<stdio.h>\nbool Is_leap(int x);//判断是否为闰年的函数\nint main()\n{\n\tint n, i;\n\tscanf(\""%d\"", &n);\n\twhile (n--) {\n\t\tint year, month, day;\n\t\tint sum = 0;\n\t\tscanf(\""%d-%d-%d\"", &year, &month, &day);\n\t\tif (month == 2 && day == 29) {//没有生日\n\t\t\tprintf(\""-1\\n\"");continue;\n\t\t}\n\t\tif (month <= 2)\n\t\t\tfor (i = 0;i < 10;i++) {\n\t\t\t\tif (Is_leap(year + i))\tsum += 366;\n\t\t\t\telse\t\t\t\tsum += 365;\n\t\t\t}\n\t\telse\n\t\t\tfor (i = 1;i <= 10;i++) {\n\t\t\t\tif (Is_leap(year + i))\tsum += 366;\n\t\t\t\telse\t\t\t\tsum += 365;\n\t\t\t}\n\t\tprintf(\""%d\\n\"", sum);\n\t}\n}\nbool Is_leap(int x)\n{\n\tif ((x % 4 == 0 && x % 100 != 0) || x % 400 == 0) return true;\n\telse \t\t\t\t\t\t\t   return false;\n}",COMPILE_ERROR,0,0
1588777189099765760,12aa33ee8db8cc8975920bb2e9fd4d4223b232e7be516e0ce206117b1000ec62,2022-11-05 14:16:14,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint r=3650,y,m,d,t,i;\n\tscanf(\""%d\"",&t);\n\twhile(t--)\n\t{\n\t\tscanf(\""%d-%d-%d\"",&y,&m,&d);\n\t\tif(y>0&&(m>0&&m<=12)&&(d>=1&&d<=31))\n\t\t{\tif((m==4||m==6||m==9||m==11)&&d==31)\n\t\t\tr=-1;\n\t\t\tif((m==2&&(y%4==0&&y%100!=0)||y%400==0)&&d>29)\n\t\t\tr=-1;\n\t\t\tif(m==2&&y%4!=0&&d>28)\n\t\t\tr=-1;\n\t\t\tif(y>2023)\n\t\t\tr=-1;\n\t\t\tif(r>0)\n\t\t\t{\n\t\t\t\tfor(i=y;i<=y+10;i++)\n\t\t\t{\n\t\t\t\tif((i%4==0&&i%100!=0)||i%400==0) r++;\n\t\t\t}\n\t\t\t}\n\t\t\tprintf(\""%d\"",r);\n\t\t\t\n\t\t\t\n\t\t}\n\t\telse\n\t\tprintf(\""-1\"");\n\t}\n\treturn 0;\n}",WRONG_ANSWER,6,360
1588777326089932800,d4d89a60a1e51464e3a83a7b5a3387d374033bcc3c66bb32a3a08873d696f6cf,2022-11-05 14:16:47,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#define _CRT_SECURE_NO_WARNINGS\n#include <stdio.h>\n#include <time.h>\n\n\nint run(int year) {\n    if ((year % 4 == 0 && year % 100 != 0) || (year % 400 == 0)) {\n        return 366;\n    }\n    return 365;\n}\n\nint main() {\n    int T;\n    int year,month,day;\n\n    while (scanf(\""%d\"", &T) != EOF) {\n        int sum = 0;\n        for (int i = 0;i < T;i++) {\n            scanf(\""%d-%d-%d\"", &year, &month, &day);\n            if (month == 2 && day == 29 && (run(year + 10) == 365)) printf(\""%d\\n\"", -1);\n            else {\n                if (((run(year) == 366) && (month <= 2)) || (((10 + year) % 4 == 0) && (month >= 3))) sum += 366;\n                else sum += 365;\n\n             //计算剩下的9年\n                for (int i = year + 1;i <= (year + 9);i++) {\n                    if (run(i) == 366) sum += 366;\n                    else  sum += 365;\n                }\n                printf(\""%d\\n\"", sum);\n            }\n        }\n    }\n}",WRONG_ANSWER,6,200
1588777419111206912,99f126d2048d4638923c66cbed76f1d4d74270157d5b0e21086d526e9d28f983,2022-11-05 14:17:09,C++,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n\tint n;\n\tint s[12]={31,28,31,30,31,30,31,31,30,31,30,31};\n    while(cin>>n){\n    \twhile(n--){\n    \t\tint yy,mm,dd;\n    \t\tscanf(\""%d-%d-%d\"",&yy,&mm,&dd);\n    \t\tint p=yy+10;\n    \t\tif(p%4==0&&p%100!=0||p%400==0)\n    \t\t\ts[1]=29;\n    \t\tif(dd>s[mm-1])\n    \t\t\tcout<<\""-1\""<<endl;\n    \t\telse{\n    \t\t\tint sum=3650;\n    \t\t\tfor(int i=yy;i<=yy+10;i++){\n    \t\t\t\tif(i%4==0&&i%100!=0||i%400==0)\n    \t\t\t\t\tsum++;\n\t\t\t\t}\n\t\t\t\tcout<<sum<<endl;\n\t\t\t}\t\n\t\t}\n    \t\t\n\t}\n    return 0;\n}\n ",WRONG_ANSWER,6,640
1588777448567779328,f7cee7212f6fae275293fba2e8139df0dda99a9956af1630b542f69557dbad1f,2022-11-05 14:17:16,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"\nbool Is_leap(int x);\nint main()\n{\n\tint n, i;\n\tscanf(\""%d\"", &n);\n\twhile (n--) {\n\t\tint year, month, day;\n\t\tint sum = 0;\n\t\tscanf(\""%d-%d-%d\"", &year, &month, &day);\n\t\tif (month == 2 && day == 29) {//没有生日\n\t\t\tprintf(\""-1\\n\"");continue;\n\t\t}\n\t\tif (month <= 2)\n\t\t\tfor (i = 0;i < 10;i++) {\n\t\t\t\tif (Is_leap(year + i))\n\t\t\t\t{\n\t\t\t\t\tsum += 366;\n\t\t\t\t}\n\t\t\t\telse \n\t\t\t\t{ \n\t\t\t\t\tsum += 365;\n\t\t\t\t}\n\t\t\t}\n\t\telse\n\t\t\tfor (i = 1;i <= 10;i++)\n\t\t\t{\n\t\t\t\tif (Is_leap(year + i))\n\t\t\t\t{\n\t\t\t\t\tsum += 366;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tsum += 365; \n\t\t\t\t}\n\t\t\t}\n\t\tprintf(\""%d\\n\"", sum);\n\t}\n}\nbool Is_leap(int x)\n{\n\tif ((x % 4 == 0 && x % 100 != 0) || x % 400 == 0)\n\t{\n\t\treturn true;\n\t}\n\telse \n\t{\n\t\treturn false;\n\t}\n}\n",COMPILE_ERROR,0,0
1588777535889018880,f7cee7212f6fae275293fba2e8139df0dda99a9956af1630b542f69557dbad1f,2022-11-05 14:17:37,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#define _CRT_SECURE_NO_WARNINGS 1\n#include<stdio.h>\nbool Is_leap(int x);\nint main()\n{\n\tint n, i;\n\tscanf(\""%d\"", &n);\n\twhile (n--) {\n\t\tint year, month, day;\n\t\tint sum = 0;\n\t\tscanf(\""%d-%d-%d\"", &year, &month, &day);\n\t\tif (month == 2 && day == 29) {//没有生日\n\t\t\tprintf(\""-1\\n\"");continue;\n\t\t}\n\t\tif (month <= 2)\n\t\t\tfor (i = 0;i < 10;i++) {\n\t\t\t\tif (Is_leap(year + i))\n\t\t\t\t{\n\t\t\t\t\tsum += 366;\n\t\t\t\t}\n\t\t\t\telse \n\t\t\t\t{ \n\t\t\t\t\tsum += 365;\n\t\t\t\t}\n\t\t\t}\n\t\telse\n\t\t\tfor (i = 1;i <= 10;i++)\n\t\t\t{\n\t\t\t\tif (Is_leap(year + i))\n\t\t\t\t{\n\t\t\t\t\tsum += 366;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tsum += 365; \n\t\t\t\t}\n\t\t\t}\n\t\tprintf(\""%d\\n\"", sum);\n\t}\n}\nbool Is_leap(int x)\n{\n\tif ((x % 4 == 0 && x % 100 != 0) || x % 400 == 0)\n\t{\n\t\treturn true;\n\t}\n\telse \n\t{\n\t\treturn false;\n\t}\n}\n",COMPILE_ERROR,0,0
1588777599176847360,12aa33ee8db8cc8975920bb2e9fd4d4223b232e7be516e0ce206117b1000ec62,2022-11-05 14:17:52,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint r=3650,y,m,d,t,i;\n\tscanf(\""%d\"",&t);\n\twhile(t--)\n\t{\n\t\tscanf(\""%d-%d-%d\"",&y,&m,&d);\n\t\tif(y>0&&(m>0&&m<=12)&&(d>=1&&d<=31))\n\t\t{\tif((m==4||m==6||m==9||m==11)&&d==31)\n\t\t\tr=-1;\n\t\t\tif((m==2&&(y%4==0&&y%100!=0)||y%400==0)&&d>29)\n\t\t\tr=-1;\n\t\t\tif(m==2&&y%4!=0&&d>28)\n\t\t\tr=-1;\n\t\t\tif(y>=2022)\n\t\t\tr=-1;\n\t\t\tif(r>0)\n\t\t\t{\n\t\t\t\tfor(i=y;i<=y+10;i++)\n\t\t\t{\n\t\t\t\tif((i%4==0&&i%100!=0)||i%400==0) r++;\n\t\t\t}\n\t\t\t}\n\t\t\tprintf(\""%d\"",r);\n\t\t\t\n\t\t\t\n\t\t}\n\t\telse\n\t\tprintf(\""-1\"");\n\t}\n\treturn 0;\n}",WRONG_ANSWER,7,200
1588777731783987200,4254e7a97dfdcb8d8db7124e5d1a9fd8133754b59a3cf2d7d46d6080ce2f8ba7,2022-11-05 14:18:23,Python,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"\nprint(\""3652\"")\n",WRONG_ANSWER,16,2788
1588778260215959552,f7cee7212f6fae275293fba2e8139df0dda99a9956af1630b542f69557dbad1f,2022-11-05 14:20:29,C,300.0,1587108005060050944,1587107403563302912,1049226928954454016,"#define _CRT_SECURE_NO_WARNINGS 1\n#include<stdio.h>\n#include <stdbool.h>\nbool Is_leap(int x);\nint main()\n{\n\tint n, i;\n\tscanf(\""%d\"", &n);\n\twhile (n--) {\n\t\tint year, month, day;\n\t\tint sum = 0;\n\t\tscanf(\""%d-%d-%d\"", &year, &month, &day);\n\t\tif (month == 2 && day == 29) {//没有生日\n\t\t\tprintf(\""-1\\n\"");continue;\n\t\t}\n\t\tif (month <= 2)\n\t\t\tfor (i = 0;i < 10;i++) {\n\t\t\t\tif (Is_leap(year + i))\n\t\t\t\t{\n\t\t\t\t\tsum += 366;\n\t\t\t\t}\n\t\t\t\telse \n\t\t\t\t{ \n\t\t\t\t\tsum += 365;\n\t\t\t\t}\n\t\t\t}\n\t\telse\n\t\t\tfor (i = 1;i <= 10;i++)\n\t\t\t{\n\t\t\t\tif (Is_leap(year + i))\n\t\t\t\t{\n\t\t\t\t\tsum += 366;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tsum += 365; \n\t\t\t\t}\n\t\t\t}\n\t\tprintf(\""%d\\n\"", sum);\n\t}\n}\nbool Is_leap(int x)\n{\n\tif ((x % 4 == 0 && x % 100 != 0) || x % 400 == 0)\n\t{\n\t\treturn true;\n\t}\n\telse \n\t{\n\t\treturn false;\n\t}\n}\n",ACCEPTED,8,384
1588778896206639104,d156a06816c1bf347ccca3ec432bf7dad3f93c19ee6fa2cca52da36af0c90242,2022-11-05 14:23:01,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include \""stdio.h\""\nint main(){\n    int judge(int a);\n    int n,day=0;\n    int year,b,c;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        scanf(\""%d-%d-%d\"",&year,&b,&c);\n        if(judge(year)&&b==2&&c==29)printf(\""-1\"");\n        else \n        {\n            for(int k=0;k<10;k++)\n            {\n            year+=k;\n            if(judge(year))\n            {\n            day+=366;\n            }\n            else day+=365;\n            }\n        }\n        printf(\""%d\"",day);\n    }\n}\n\nint judge(int a){\n    if(a%4==0&&a%100!=0||a%400==0)return 1;\n    else return 0;\n}",WRONG_ANSWER,6,204
1588779339452297216,d156a06816c1bf347ccca3ec432bf7dad3f93c19ee6fa2cca52da36af0c90242,2022-11-05 14:24:47,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include \""stdio.h\""\nint main(){\n    int judge(int a);\n    int n,day=0;\n    int year,b,c;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        scanf(\""%d-%d-%d\"",&year,&b,&c);\n        if(judge(year)&&b==2&&c==29)printf(\""-1\"");\n        else \n        {\n            for(int k=0;k<10;k++)\n            {\n            year+=k;\n            if(judge(year))\n            {\n            day+=366;\n            }\n            else day+=365;\n            }\n        }\n        if(judge(year)&&b>=3)day-=1;\n        printf(\""%d\"",day);\n    }\n}\n\nint judge(int a){\n    if(a%4==0&&a%100!=0||a%400==0)return 1;\n    else return 0;\n}",WRONG_ANSWER,12,508
1588779401695793152,5cef96c2dc18f90d90a3e046632712e9a11c11827177e495b2cb881eaeec404b,2022-11-05 14:25:02,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n\tint num,year,mon,day,res=0;\n\tscanf(\""%d\"",&num);\n\t\n\tfor(int i=1 ; i<=num ; i++)\n\t{\n\t\tscanf(\""%d-%d-%d\"",&year,&mon,&day);\n\t\tif(year%4==0&&year%100!=0||year%400==0)\n\t\t{\n\t\t\tif(mon==2&&day==29)\n\t\t\tprintf(\""-1\\n\"");\n\t\t\tcontinue;\n\t\t}\n\t\tfor(int l=1;l<=10;l++)\n\t\t{\n\t\t\tif(year%4==0&&year%100!=0||year%400==0)\n\t\t\t{\n\t\t\t\tif(mon<2||mon==2&&day<=29)\n\t\t\t\t\tres+=366;\n\t\t\t\telse\n\t\t\t\t\tres+=365;\n\t\t\t}\n\t\t\telse\n\t\t\t\tif((year+1)%4==0&&(year+1)%100!=0||(year+1)%400==0)\n\t\t\t\t{\n\t\t\t\t\tif(mon<2||mon==2&&day<=29)\n\t\t\t\t\t\tres+=365;\n\t\t\t\t\telse\n\t\t\t\t\t\tres+=366;\n\t\t\t\t}\n\t\t\telse\n\t\t\t\tres+=365;\n\t\t\tyear++;\n\t\t}\n\t\tprintf(\""%d\\n\"",res);\n\t} \n\t\n\treturn 0;\n}",WRONG_ANSWER,5,480
1588779511284543488,d156a06816c1bf347ccca3ec432bf7dad3f93c19ee6fa2cca52da36af0c90242,2022-11-05 14:25:28,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include \""stdio.h\""\nint main(){\n    int judge(int a);\n    int n,day=0;\n    int year,b,c;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        scanf(\""%d-%d-%d\"",&year,&b,&c);\n        if(judge(year)&&b>=3)day-=1;\n        if(judge(year)&&b==2&&c==29)printf(\""-1\"");\n        else \n        {\n            for(int k=0;k<10;k++)\n            {\n            year+=k;\n            if(judge(year))\n            {\n            day+=366;\n            }\n            else day+=365;\n            }\n        }\n        \n        printf(\""%d\"",day);\n    }\n}\n\nint judge(int a){\n    if(a%4==0&&a%100!=0||a%400==0)return 1;\n    else return 0;\n}",WRONG_ANSWER,6,332
1588780390947532800,5cef96c2dc18f90d90a3e046632712e9a11c11827177e495b2cb881eaeec404b,2022-11-05 14:28:57,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n\tint num,year,mon,day,res=0;\n\tscanf(\""%d\"",&num);\n\t\n\tfor(int i=1 ; i<=num ; i++)\n\t{\n\t\tscanf(\""%d-%d-%d\"",&year,&mon,&day);\n\t\tif(mon==2&&day==29)\n\t\t\t{\n\t\t\t\tprintf(\""-1\\n\"");\n\t\t\t\tcontinue;\n\t\t\t}\n\t\tfor(int l=1;l<=10;l++)\n\t\t{\n\t\t\tif(year%4==0&&year%100!=0||year%400==0)\n\t\t\t{\n\t\t\t\tif(mon<2||mon==2&&day<=29)\n\t\t\t\t\tres+=366;\n\t\t\t\telse\n\t\t\t\t\tres+=365;\n\t\t\t}\n\t\t\telse\n\t\t\t\tif((year+1)%4==0&&(year+1)%100!=0||(year+1)%400==0)\n\t\t\t\t{\n\t\t\t\t\tif(mon<2||mon==2&&day<=29)\n\t\t\t\t\t\tres+=365;\n\t\t\t\t\telse\n\t\t\t\t\t\tres+=366;\n\t\t\t\t}\n\t\t\telse\n\t\t\t\tres+=365;\n\t\t\tyear++;\n\t\t}\n\t\tprintf(\""%d\"",res);\n\t} \n\t\n\treturn 0;\n}",WRONG_ANSWER,8,352
1588780477765431296,99f126d2048d4638923c66cbed76f1d4d74270157d5b0e21086d526e9d28f983,2022-11-05 14:29:18,C++,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n\tint n;\n\tint s[12]={31,28,31,30,31,30,31,31,30,31,30,31};\n    while(cin>>n){\n    \twhile(n--){\n    \t\tint yy,mm,dd;\n    \t\tscanf(\""%d-%d-%d\"",&yy,&mm,&dd);\n    \t\tif(mm==2&&dd==29||dd>s[mm-1])\n    \t\t\tcout<<\""-1\""<<endl;\n    \t\telse{\n    \t\t\tint sum=3650;\n    \t\t\tfor(int i=yy;i<yy+10;i++){\n    \t\t\t\tif(i%4==0&&i%100!=0||i%400==0)\n    \t\t\t\t\tsum++;\n\t\t\t\t}\n\t\t\t\tint p=yy+10;\n\t\t\t\tif((p%4==0&&p%100!=0||p%400==0)&&mm>2)\n\t\t\t\t\tsum++;\n\t\t\t\tcout<<sum<<endl;\n\t\t\t}\t\n\t\t}\n    \t\t\n\t}\n    return 0;\n}\n ",WRONG_ANSWER,10,512
1588780817525047296,d156a06816c1bf347ccca3ec432bf7dad3f93c19ee6fa2cca52da36af0c90242,2022-11-05 14:30:39,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include \""stdio.h\""\nint main(){\n    int judge(int a);\n    int n,day=0;\n    int year,b,c;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        scanf(\""%d-%d-%d\"",&year,&b,&c);\n        if(judge(year)&&b>=3)day-=1;\n        if(judge(year)&&b==2&&c==29||!judge(year+10))printf(\""-1\"");\n        else \n        {\n            for(int k=0;k<10;k++)\n            {\n            year+=k;\n            if(judge(year))\n            {\n            day+=366;\n            }\n            else day+=365;\n            }printf(\""%d\"",day);\n        }\n        \n        \n    }\n}\n\nint judge(int a){\n    if(a%4==0&&a%100!=0||a%400==0)return 1;\n    else return 0;\n}",WRONG_ANSWER,6,332
1588781799847800832,d156a06816c1bf347ccca3ec432bf7dad3f93c19ee6fa2cca52da36af0c90242,2022-11-05 14:34:33,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include \""stdio.h\""\nint main(){\n    int judge(int a);\n    int n,day=0;\n    int year,b,c;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        scanf(\""%d-%d-%d\"",&year,&b,&c);\n        if(judge(year)&&b>=3)day=-1;\n        if(judge(year)&&b==2&&c==29&&!judge(year+10))printf(\""-1\"");\n        else \n        {\n            for(int k=0;k<10;k++)\n            {\n            year+=k;\n            if(judge(year))\n            {\n            day+=366;\n            }\n            else day+=365;\n            }\n            printf(\""%d\"",day);\n        }\n    }\n}\n\nint judge(int a){\n    if(a%4==0&&a%100!=0||a%400==0)return 1;\n    else return 0;\n}",WRONG_ANSWER,12,360
1588781934052970496,99f126d2048d4638923c66cbed76f1d4d74270157d5b0e21086d526e9d28f983,2022-11-05 14:35:05,C++,300.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n\tint n;\n\tint s[12]={31,28,31,30,31,30,31,31,30,31,30,31};\n    while(cin>>n){\n    \twhile(n--){\n    \t\tint yy,mm,dd;\n    \t\tscanf(\""%d-%d-%d\"",&yy,&mm,&dd);\n    \t\tif(mm==2&&dd==29||dd>s[mm-1])\n    \t\t\tcout<<\""-1\""<<endl;\n    \t\telse{\n    \t\t\tint sum=0;\n    \t\t\tif((yy%4==0&&yy%100!=0||yy%400==0)&&(mm<2||mm==2&&dd<29))\n    \t\t\t\tsum+=366;\n    \t\t\telse\n\t\t\t\t\tsum+=365;\t\n    \t\t\tfor(int i=yy+1;i<yy+9;i++){\n    \t\t\t\tsum+=365;\n    \t\t\t\tif(i%4==0&&i%100!=0||i%400==0)\n    \t\t\t\t\tsum++;\n\t\t\t\t}\n\t\t\t\tint p=yy+10;\n\t\t\t\tif((p%4==0&&p%100!=0||p%400==0)&&(mm>2||mm==2&&dd==29))\n\t\t\t\t\tsum+=366;\n\t\t\t\telse\n\t\t\t\t\tsum+=365;\t\n\t\t\t\tcout<<sum<<endl;\n\t\t\t}\t\n\t\t}\n    \t\t\n\t}\n    return 0;\n}\n ",ACCEPTED,9,768
1588782040349192192,c405269aa9cc91fe87ca0f6fccf001f9701d752a42485b15b8a620ccdbddb5b6,2022-11-05 14:35:31,Java,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\nScanner in = new Scanner(System.in);\n        int n = in.nextInt();\n        int sum1 = 0;\n        for(int i = 0; i < n; i++){\n            String str = in.nextLine();\n            String[] s= str.split(\""-\"");\n            int year = Integer.valueOf(s[0]);\n            int month = Integer.valueOf(s[1]);\n            int day = Integer.valueOf(s[2]);\n            if(month==2&&day==29){\n                System.out.println(-1);\n            }else{\n                int sum = 365*10;\n                for(int j = 0; j < 10; j++){\n                    if(month>2){\n                        sum = sum + runnain(year+1);\n                        sum1 =sum;\n                    }else{\n                        sum = sum + runnain(year);\n                        sum1 =sum;\n                    }\n                }\n            }\n            System.out.println(sum1);\n        }\n        \n    }\n    public static int runnain(int nian){\n        if((nian%4==0&&nian%400!=0)||(nian%400==0)){\n            return 1;\n        }else return 0;\n    }\n}",WRONG_ANSWER,101,25196
1588782237917708288,5cef96c2dc18f90d90a3e046632712e9a11c11827177e495b2cb881eaeec404b,2022-11-05 14:36:18,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n\tint num,year,mon,day,res=3652;\n\tscanf(\""%d\"",&num);\n\t\n\tfor(int i=1 ; i<=num ; i++)\n\t{\n\t\tscanf(\""%d-%d-%d\"",&year,&mon,&day);\n\t\tif(mon==2&&day==29)\n\t\t\t{\n\t\t\t\tprintf(\""-1\\n\"");\n\t\t\t\tcontinue;\n\t\t\t}\n\t\tfor(int l=1;l<=10;l++)\n\t\t{\n\t\t\tif(year%100==0&&year%400!=0)\n\t\t\t\tres--;\n\t\t\tyear++;\n\t\t}\n\t\tprintf(\""%d\"",res);\n\t} \n\t\n\treturn 0;\n}",WRONG_ANSWER,14,332
1588783229295964160,c405269aa9cc91fe87ca0f6fccf001f9701d752a42485b15b8a620ccdbddb5b6,2022-11-05 14:40:14,Java,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\nScanner in = new Scanner(System.in);\n        int n = in.nextInt();\n        int sum1 = 0;\n        for(int i = 0; i < n; i++){\n            String str = in.nextLine();\n            String[] s= str.split(\""-\"");\n            int year = Integer.valueOf(s[0]);\n            int month = Integer.valueOf(s[1]);\n            int day = Integer.valueOf(s[2]);\n            if(month==2&&day==29){\n                System.out.println(-1);\n            }else{\n                int sum = 365*10;\n                for(int j = 0; j < 10; j++){\n                    if(month>2){\n                        sum = sum + runnain(year+1);\n                        sum1 =sum;\n                    }else{\n                        sum = sum + runnain(year);\n                        sum1 =sum;\n                    }\n                }\n            }\n            System.out.println(sum1);\n        }\n        \n    }\n    public static int runnain(int nian){\n        if((nian%4==0&&nian%400!=0)||(nian%400==0)){\n            return 1;\n        }else return 0;\n    }\n}",WRONG_ANSWER,98,25556
1588783560062992384,cc9f777f5dea4bc4342fec80f59ef3a14266fc538216baba5b5530fe019e3a77,2022-11-05 14:41:33,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include <stdio.h>\n\nint main() {\n\tint a, i, sum;\n\tint n, y, r;\n\tscanf(\""%d\"", &a);\n\tint j;\n\tj = a;\n\twhile (a--) {\n\t\tsum = 0;\n\t\tscanf(\""%d-%d-%d\"", &n, &y, &r);\n\t\tif (y == 02 && r == 29) {\n\t\t\tsum = -1;\n\t\t} else {\n\t\t\tfor (i = n + 1; i < n + 9; i++) {\n\t\t\t\tif (i % 4 == 0 && i % 100 != 0 || i % 400 == 0)\n\t\t\t\t\tsum += 366;\n\t\t\t\telse\n\t\t\t\t\tsum += 365;\n\t\t\t}\n\t\t\tif (y <= 2 && r < 29) {\n\t\t\t\tif (n % 4 == 0 && n % 100 != 0 || n % 400 == 0)\n\t\t\t\t\tsum += 366;\n\t\t\t\telse\n\t\t\t\t\tsum += 365;\n\t\t\t\tif (n + 9 % 4 == 0 && n + 9 % 100 != 0 || n + 9 % 400 == 0)\n\t\t\t\t\tsum += 366;\n\t\t\t\telse\n\t\t\t\t\tsum += 365;\n\t\t\t}\n\t\t\tif (y > 2) {\n\t\t\t\tif (n + 9 % 4 == 0 && n + 9 % 100 != 0 || n + 9 % 400 == 0)\n\t\t\t\t\tsum += 366;\n\t\t\t\telse\n\t\t\t\t\tsum += 365;\n\t\t\t\tif (n % 4 == 0 && n % 100 != 0 || n % 400 == 0)\n\t\t\t\t\tsum += 366;\n\t\t\t\telse\n\t\t\t\t\tsum += 365;\n\t\t\t}\n\t\t}\n        if(j!=a+1)printf(\""\\n\"");\n\t\tprintf(\""%d\"", sum);\n\t}\n\treturn 0;\n}\n",WRONG_ANSWER,14,360
1588783646314663936,6cb897670d6eff776e4a5bb4a520a175cb28e139b45dbee64477a7be70139d98,2022-11-05 14:41:54,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int t,year,month,day,time;\n    scanf(\""%d\\r\"",&t);\n    for(int i=1;i<=t;i++)\n    {\n        scanf(\""%d-%d-%d\\r\"",&year,&month,&day);\n            if(month>12||month<1||day>31||day<1)\n                printf(\""-1\\n\"");\n            else\n            {\n                for(int f=1;f<=10;f++)\n                {\n                    if((year%4==0&&year%100!=0)||year%400==0)\n                    {\n                        if(f==10)\n                        {switch(month)\n                        {\n                            case 2:time=31+day;break;\n                            case 3:time=60+day;break;\n                            case 4:time=91+day;break;\n                            case 5:time=121+day;break;\n                            case 6:time=152+day;break;\n                            case 7:time=182+day;break;\n                            case 8:time=213+day;break;\n                            case 9:time=244+day;break;\n                            case 10:time=274+day;break;\n                            case 11:time=305+day;break;\n                            case 1:time=day;break;\n                            default:time=335;break;\n                        }\n                    }\n                     else if(f==1) \n                     {switch(month)\n                        {\n                            case 2:time=366-(31+day);break;\n                            case 3:time=366-(60+day);break;\n                            case 4:time=366-(91+day);break;\n                            case 5:time=366-(121+day);break;\n                            case 6:time=366-(152+day);break;\n                            case 7:time=366-(182+day);break;\n                            case 8:time=366-(213+day);break;\n                            case 9:time=366-(244+day);break;\n                            case 10:time=366-(274+day);break;\n                            case 11:time=366-(305+day);break;\n                            case 1:time=366-day;break;\n                            default:time=366-(335+day);break;\n                         }\n                     }\n                     else \n                     time=time+366;\n                    }\n                    else \n                    {\n                        if(f==10)\n                        {switch(month)\n                        {\n                            case 2:time=31+day;break;\n                            case 3:time=59+day;break;\n                            case 4:time=90+day;break;\n                            case 5:time=120+day;break;\n                            case 6:time=151+day;break;\n                            case 7:time=181+day;break;\n                            case 8:time=212+day;break;\n                            case 9:time=243+day;break;\n                            case 10:time=273+day;break;\n                            case 11:time=304+day;break;\n                            case 1:time=day;break;\n                            default:time=334+day;break;\n                        }\n                    }\n                        else if(f==1) \n                     {switch(month)\n                        {\n                            case 2:time=366-(31+day);break;\n                            case 3:time=366-(60+day);break;\n                            case 4:time=366-(91+day);break;\n                            case 5:time=366-(121+day);break;\n                            case 6:time=366-(152+day);break;\n                            case 7:time=366-(182+day);break;\n                            case 8:time=366-(213+day);break;\n                            case 9:time=366-(244+day);break;\n                            case 10:time=366-(274+day);break;\n                            case 11:time=366-(305+day);break;\n                            case 1:time=366-day;break;\n                            default:time=366-(335+day);break;\n                         }\n                     }\n                     else \n                     time=time+365;\n                    }\n                 }\n            printf(\""%d\\n\"",time);\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,8,200
1588783859116871680,cc9f777f5dea4bc4342fec80f59ef3a14266fc538216baba5b5530fe019e3a77,2022-11-05 14:42:44,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include <stdio.h>\n\nint main() {\n\tint a, i, sum;\n\tint n, y, r;\n\tscanf(\""%d\"", &a);\n\tint j;\n\tj = a;\n\twhile (a--) {\n\t\tsum = 0;\n\t\tscanf(\""%d-%d-%d\"", &n, &y, &r);\n\t\tif (y == 02 && r == 29) {\n\t\t\tsum = -1;\n\t\t} else {\n\t\t\tfor (i = n + 1; i < n + 9; i++) {\n\t\t\t\tif (i % 4 == 0 && i % 100 != 0 || i % 400 == 0)\n\t\t\t\t\tsum += 366;\n\t\t\t\telse\n\t\t\t\t\tsum += 365;\n\t\t\t}\n\t\t\tif (y <= 2 && r < 29) {\n\t\t\t\tif (n % 4 == 0 && n % 100 != 0 || n % 400 == 0)\n\t\t\t\t\tsum += 366;\n\t\t\t\telse\n\t\t\t\t\tsum += 365;\n\t\t\t\tif (n + 9 % 4 == 0 && n + 9 % 100 != 0 || n + 9 % 400 == 0)\n\t\t\t\t\tsum += 366;\n\t\t\t\telse\n\t\t\t\t\tsum += 365;\n\t\t\t}\n\t\t\tif (y > 2) {\n\t\t\t\tif (n + 9 % 4 == 0 && n + 9 % 100 != 0 || n + 9 % 400 == 0)\n\t\t\t\t\tsum += 366;\n\t\t\t\telse\n\t\t\t\t\tsum += 365;\n\t\t\t\tif (n % 4 == 0 && n % 100 != 0 || n % 400 == 0)\n\t\t\t\t\tsum += 366;\n\t\t\t\telse\n\t\t\t\t\tsum += 365;\n\t\t\t}\n\t\t}\n        if(j!=a+1)printf(\""\\n\"");\n\t\tprintf(\""%d\"", sum);\n\t}\n\treturn 0;\n}\n",WRONG_ANSWER,8,220
1588784146590273536,1c61fcbf1cbbc398cfc33958c7afc448a6cd1673bdc72e4df8c0848cbf367fd6,2022-11-05 14:43:53,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include \""stdio.h\""\nint isyear(int n);\nint main(){\n    int t;\n    scanf(\""%d\"",&t);\n    while(t--){\n        int y,m,d;\n        int day=0;\n        int i;\n        scanf(\""%d-%d-%d\"",&y,&m,&d);\n        for(i=y;i<y+10;i++){\n            if(isyear(i)){\n                day +=366;\n            }else{\n                day +=365;\n            }\n        }\n        /*int s=0;\n        int y10=y+10;\n        if(isyear(y10)){\n            for(i=1;i<m;i++){\n                if(i==1 || i==3 || i==5 || i==7 || i==8 || i==10 || i==12){\n                    s=s+31;\n                }else if(i==2){\n                    s=s+29;\n                }else{\n                    s=s+30;\n                }\n            }\n        }else{\n            for(i=1;i<m;i++){\n                if(i==1 || i==3 || i==5 || i==7 || i==8 || i==10 || i==12){\n                    s=s+31;\n                }else if(i==2){\n                    s=s+28;\n                }else{\n                    s=s+30;\n                }\n            }\n        }*/\n        printf(\""%d\"",day);\n        //printf(\""%d\"",day+s+d);\n    }\n}\n//判断是否为闰年\nint isyear(int n){\n    return (n%4==0 && n%100!=0) || (n%400==0) ? 1:0;\n}",WRONG_ANSWER,7,196
1588784218098962432,d156a06816c1bf347ccca3ec432bf7dad3f93c19ee6fa2cca52da36af0c90242,2022-11-05 14:44:10,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include \""stdio.h\""\nint main(){\n    int judge(int a);\n    int n,day=0;\n    int year,b,c;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        scanf(\""%d-%d-%d\"",&year,&b,&c);\n        if(judge(year)&&b<3)day=-1;\n        if(judge(year+10)&&b>=3)day=1;\n        if(judge(year)&&b==2&&c==29&&!judge(year+10))printf(\""-1\"");\n        else \n        {\n            for(int k=0;k<10;k++)\n            {\n            year+=k;\n            if(judge(year))\n            {\n            day+=366;\n            }\n            else day+=365;\n            }\n            printf(\""%d\"",day);\n        }\n    }\n}\n\nint judge(int a){\n    if(a%4==0&&a%100!=0||a%400==0)return 1;\n    else return 0;\n}",WRONG_ANSWER,9,352
1588784235698237440,d156a06816c1bf347ccca3ec432bf7dad3f93c19ee6fa2cca52da36af0c90242,2022-11-05 14:44:14,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include \""stdio.h\""\nint main(){\n    int judge(int a);\n    int n,day=0;\n    int year,b,c;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        scanf(\""%d-%d-%d\"",&year,&b,&c);\n        if(judge(year)&&b<3)day=-1;\n        if(judge(year+10)&&b>=3)day=1;\n        if(judge(year)&&b==2&&c==29&&!judge(year+10))printf(\""-1\"");\n        else \n        {\n            for(int k=0;k<10;k++)\n            {\n            year+=k;\n            if(judge(year))\n            {\n            day+=366;\n            }\n            else day+=365;\n            }\n            printf(\""%d\"",day);\n        }\n    }\n}\n\nint judge(int a){\n    if(a%4==0&&a%100!=0||a%400==0)return 1;\n    else return 0;\n}",WRONG_ANSWER,6,640
1588784358679445504,d156a06816c1bf347ccca3ec432bf7dad3f93c19ee6fa2cca52da36af0c90242,2022-11-05 14:44:43,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include \""stdio.h\""\nint main(){\n    int judge(int a);\n    int n,day=0;\n    int year,b,c;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        scanf(\""%d-%02d-%02d\"",&year,&b,&c);\n        if(judge(year)&&b<3)day=-1;\n        if(judge(year+10)&&b>=3)day=1;\n        if(judge(year)&&b==2&&c==29&&!judge(year+10))printf(\""-1\"");\n        else \n        {\n            for(int k=0;k<10;k++)\n            {\n            year+=k;\n            if(judge(year))\n            {\n            day+=366;\n            }\n            else day+=365;\n            }\n            printf(\""%d\"",day);\n        }\n    }\n}\n\nint judge(int a){\n    if(a%4==0&&a%100!=0||a%400==0)return 1;\n    else return 0;\n}",WRONG_ANSWER,8,512
1588784875593838592,d4d89a60a1e51464e3a83a7b5a3387d374033bcc3c66bb32a3a08873d696f6cf,2022-11-05 14:46:47,C,300.0,1587108005060050944,1587107403563302912,1049226928954454016,"#define _CRT_SECURE_NO_WARNINGS\n#include<stdio.h>\n\nint isleap(int y)\n{\n    if (y % 4 == 0 && (y % 100 != 0 || y % 400 == 0)) return 1;\n    return 0;\n}\n\nint main()\n{\n    int i, T;\n    int Y, M, D;\n    int sum;\n    scanf(\""%d\"", &T);\n    while (T--)\n    {\n        sum = 10 * 365;\n        scanf(\""%d-%d-%d\"", &Y, &M, &D);\n        if (!isleap(Y + 10) && M == 2 && D == 29)\n        {\n            printf(\""-1\\n\"");\n            continue;\n        }\n        if (isleap(Y) && (M < 2 || (M == 2 && D <= 28)))\n            sum++;\n        if (isleap(Y + 10) && (M > 2 || (M == 2 && D == 29)))\n            sum++;\n        for (i = Y + 1;i <= Y + 10;i++)\n            if (isleap(i))\n                sum++;\n        printf(\""%d\\n\"", sum);\n    }\n    return 0;\n}\n",ACCEPTED,6,352
1588785455594803200,d156a06816c1bf347ccca3ec432bf7dad3f93c19ee6fa2cca52da36af0c90242,2022-11-05 14:49:05,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include \""stdio.h\""\nint main(){\n    int judge(int a);\n    int n,day=0;\n    int year,b,c;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        scanf(\""%d-%02d-%02d\"",&year,&b,&c);\n        if(judge(year+10)&&b>=3)day=1;\n        if(judge(year)&&b==2&&c==29&&!judge(year+10))printf(\""-1\"");\n        else \n        {\n            for(int k=0;k<10;k++)\n            {\n            year+=k;\n            if(judge(year))\n            {\n            day+=366;\n            }\n            else day+=365;\n            }\n            printf(\""%d\"",day);\n        }\n    }\n}\n\nint judge(int a){\n    if(a%4==0&&a%100!=0||a%400==0)return 1;\n    else return 0;\n}",WRONG_ANSWER,6,200
1588785763020484608,d156a06816c1bf347ccca3ec432bf7dad3f93c19ee6fa2cca52da36af0c90242,2022-11-05 14:50:18,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include \""stdio.h\""\nint main(){\n    int judge(int a);\n    int n,day=0;\n    int year,b,c;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        scanf(\""%d-%02d-%02d\"",&year,&b,&c);\n        if(judge(year)&&b>=3)day=-1;\n        if(judge(year+10)&&b>=3)day=1;\n        if(judge(year)&&b==2&&c==29&&!judge(year+10))printf(\""-1\"");\n        else \n        {\n            for(int k=0;k<10;k++)\n            {\n            year+=k;\n            if(judge(year))\n            {\n            day+=366;\n            }\n            else day+=365;\n            }\n            printf(\""%d\"",day);\n        }\n    }\n}\n\nint judge(int a){\n    if(a%4==0&&a%100!=0||a%400==0)return 1;\n    else return 0;\n}",WRONG_ANSWER,8,204
1588785779961303040,d156a06816c1bf347ccca3ec432bf7dad3f93c19ee6fa2cca52da36af0c90242,2022-11-05 14:50:22,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include \""stdio.h\""\nint main(){\n    int judge(int a);\n    int n,day=0;\n    int year,b,c;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        scanf(\""%d-%02d-%02d\"",&year,&b,&c);\n        if(judge(year)&&b>=3)day=-1;\n        if(judge(year+10)&&b>=3)day=1;\n        if(judge(year)&&b==2&&c==29&&!judge(year+10))printf(\""-1\"");\n        else \n        {\n            for(int k=0;k<10;k++)\n            {\n            year+=k;\n            if(judge(year))\n            {\n            day+=366;\n            }\n            else day+=365;\n            }\n            printf(\""%d\"",day);\n        }\n    }\n}\n\nint judge(int a){\n    if(a%4==0&&a%100!=0||a%400==0)return 1;\n    else return 0;\n}",WRONG_ANSWER,8,512
1588786029610446848,c405269aa9cc91fe87ca0f6fccf001f9701d752a42485b15b8a620ccdbddb5b6,2022-11-05 14:51:22,Java,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\nScanner in = new Scanner(System.in);\n        int n = Integer.valueOf(in.nextLine());\n        int sum1 = 0;\n        for(int i = 0; i < n; i++){\n            String str = in.nextLine();\n            String[] s= str.split(\""-\"");\n            int year = Integer.valueOf(s[0]);\n            int month = Integer.valueOf(s[1]);\n            int day = Integer.valueOf(s[2]);\n            if(month==2&&day==29){\n                System.out.println(-1);\n            }else{\n                int sum = 365*10;\n                for(int j = 0; j < 10; j++){\n                    if(month>2){\n                        sum = sum + runnain(year+1+j);\n                        sum1 =sum;\n                    }else{\n                        sum = sum + runnain(year+j);\n                        sum1 =sum;\n                    }\n                }\n            }\n            System.out.println(sum1);\n        }\n        \n    }\n    public static int runnain(int nian){\n        if((nian%4==0&&nian%400!=0)||(nian%400==0)){\n            return 1;\n        }else return 0;\n    }\n}",WRONG_ANSWER,115,24488
1588786408456781824,d156a06816c1bf347ccca3ec432bf7dad3f93c19ee6fa2cca52da36af0c90242,2022-11-05 14:52:52,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include \""stdio.h\""\nint main(){\n    int judge(int a);\n    int n,day=0;\n    int year,b,c;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        scanf(\""%d-%02d-%02d\"",&year,&b,&c);\n        if(judge(year)&&b>=3)day=-1;\n        if(judge(year+10)&&b>=3)day=1;\n        if(judge(year)&&b==2&&c==29&&!judge(year+10))printf(\""-1\"");\n        else \n        {\n            for(int k=0;k<10;k++)\n            {\n            year+=k;\n            if(judge(year))\n            {\n            day+=366;\n            }\n            else day+=365;\n            }\n            printf(\""%d\"",day);\n        }\n    }\n}\n\nint judge(int a){\n    if(a%4==0&&a%100!=0||a%400==0)return 1;\n    else return 0;\n}",WRONG_ANSWER,9,344
1588786740654051328,d156a06816c1bf347ccca3ec432bf7dad3f93c19ee6fa2cca52da36af0c90242,2022-11-05 14:54:11,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include \""stdio.h\""\nint main(){\n    int judge(int a);\n    int n,day=0;\n    int year,b,c;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        scanf(\""%d-%02d-%02d\"",&year,&b,&c);\n        if(judge(year)&&b>=3)day=-1;\n        if(judge(year+10)&&b>=3)day=1;\n        if(judge(year)&&b==2&&c==29&&!judge(year+10))printf(\""-1\"");\n        else \n        {\n            for(int k=0;k<10;k++)\n            {\n            year+=k;\n            if(judge(year))\n            {\n            day+=366;\n            }\n            else day+=365;\n            }\n            printf(\""%d\"",day);\n        }\n    }\n}\n\nint judge(int a){\n    if(a%4==0&&a%100!=0||a%400==0)return 1;\n    else return 0;\n}",WRONG_ANSWER,7,328
1588786861722632192,c405269aa9cc91fe87ca0f6fccf001f9701d752a42485b15b8a620ccdbddb5b6,2022-11-05 14:54:40,Java,300.0,1587108005060050944,1587107403563302912,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\nScanner in = new Scanner(System.in);\n        int n = Integer.valueOf(in.nextLine());\n        int sum1 = 0;\n        for(int i = 0; i < n; i++){\n            String str = in.nextLine();\n            String[] s= str.split(\""-\"");\n            int year = Integer.valueOf(s[0]);\n            int month = Integer.valueOf(s[1]);\n            int day = Integer.valueOf(s[2]);\n            if(month==2&&day==29){\n                System.out.println(-1);\n            }else{\n                int sum = 365*10;\n                for(int j = 0; j < 10; j++){\n                    if(month>2){\n                        sum = sum + runnain(year+1+j);\n                        sum1 =sum;\n                    }else{\n                        sum = sum + runnain(year+j);\n                        sum1 =sum;\n                    }\n                }\n                System.out.println(sum1);\n            }\n        }\n        \n    }\n    public static int runnain(int nian){\n        if((nian%4==0&&nian%400!=0)||(nian%400==0)){\n            return 1;\n        }else return 0;\n    }\n}",ACCEPTED,100,24304
1588787353248903168,b4148641733157e32be4600b7c18620f154731a2bd195ed86aee874a50a41479,2022-11-05 14:56:37,Python,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"t=int(input())\nfor i in range(t):\n    num=0\n    nian,yue,tian=list(map(int,input().split('-')))\n    if ((nian+10)%4!=0 and (nian+10)%400!=0) and yue==2 and tian==29:\n        print(-1)\n        continue\n    else:\n        for j in range(nian+1,nian+11):\n            if j %4==0 or j%400==0:\n                num+=1\n    print(365*10+num)\n    ",WRONG_ANSWER,22,2932
1588787369896120320,d156a06816c1bf347ccca3ec432bf7dad3f93c19ee6fa2cca52da36af0c90242,2022-11-05 14:56:41,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include \""stdio.h\""\nint main(){\n    int judge(int a);\n    int n,day=0;\n    int year,b,c;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        scanf(\""%d-%02d-%02d\"",&year,&b,&c);\n        if(judge(year)&&b>=3)day=-1;\n        if(judge(year+10)&&b>=3)day=1;\n        if(judge(year)&&b==2&&c==29&&!judge(year+10))printf(\""-1\"");\n        else \n        {\n            for(int k=0;k<10;k++)\n            {\n            year+=k;\n            if(judge(year))\n            {\n            day+=366;\n            }\n            else day+=365;\n            }\n            printf(\""%d\"",day);\n        }\n    }\n}\n\nint judge(int a){\n    if(a%4==0&&a%100!=0||a%400==0)return 1;\n    else return 0;\n}",WRONG_ANSWER,6,480
1588787644211965952,5cef96c2dc18f90d90a3e046632712e9a11c11827177e495b2cb881eaeec404b,2022-11-05 14:57:47,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"\n#include<stdio.h>\n\nint main()\n{\n\tint num,year,mon,day,res=3652;\n\tscanf(\""%d\"",&num);\n\t\n\tfor(int i=1 ; i<=num ; i++)\n\t{\n\t\tscanf(\""%d-%d-%d\"",&year,&mon,&day);\n\t\tif(mon==2&&day==29)\n\t\t{\n\t\t\tprintf(\""-1\\n\"");\n\t\t\tcontinue;\n\t\t}\n\t\tfor(int l=1;l<=10;l++)\n\t\t{\n\t\t\tif(year%100==0&&year%400!=0&&mon<=2||(year+1)%100==0&&(year+1)%400!=0&&mon>2)\n\t\t\t\tres--;\n\t\t\tyear++;\n\t\t}\n\t\tprintf(\""%d\"",res);\n\t} \n\t\n\treturn 0;\n}",WRONG_ANSWER,7,348
1588787712247771136,8a60a7f5a66174b4191e824b6fe59735f6c87e03421fe41c6136ae702823d481,2022-11-05 14:58:03,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int y,m,d,s,f,i,u,k,j;\n    scanf(\""%d-%d-%d\"",&y,&m,&d);\n    s=0;\n    u=y+10;\n    scanf(\""%d\"",&k);\n    for(j=1;j<=k;j++)\n    {\n    \tif( (u%4!=0 || u%100==0 && u%400!=0) && m==2 && d==29)  printf(\""-1\"");\n    else \n\t{\n        for(i=y;i<y+10;i++)\n    {\n        \n         if(i%4==0 && i%100!=0 || i%400==0)\n    {\n        f=1;\n    }\n    else\n    {\n        f=0;\n    }\n       if(f==0) s=s+365; \n\telse if(f==1) s=s+366;}\n    if(y%4==0 && y%100!=0 || y%400==0) \n    {\n        switch(m-1)\n        {\n            case 11:s=s-30;m=m-1;\n            case 10:s=s-31;m=m-1;\n            case 9:s=s-30;m=m-1;\n            case 8:s=s-31;m=m-1;\n            case 7:s=s-31;m=m-1;\n            case 6:s=s-30;m=m-1;\n            case 5:s=s-31;m=m-1;\n            case 4:s=s-30;m=m-1;\n            case 3:s=s-31;m=m-1;\n            case 2:s=s-29;m=m-1;\n            case 1:s=s-31;m=m-1;\n        }\n    }\n        else\n        {\n            switch(m-1)\n        {\n            case 11:s=s-30;\n            case 10:s=s-31;\n            case 9:s=s-30;\n            case 8:s=s-31;\n            case 7:s=s-31;\n            case 6:s=s-30;\n            case 5:s=s-31;\n            case 4:s=s-30;\n            case 3:s=s-31;\n            case 2:s=s-28;\n            case 1:s=s-31;\n        }\n        }\n        s=s-d;\n         if(u%4==0 && u%100!=0 || u%400==0) \n    {\n        switch(m-1)\n        {\n            case 11:s=s+30;\n            case 10:s=s+31;\n            case 9:s=s+30;\n            case 8:s=s+31;\n            case 7:s=s+31;\n            case 6:s=s+30;\n            case 5:s=s+31;\n            case 4:s=s+30;\n            case 3:s=s+31;\n            case 2:s=s+29;\n            case 1:s=s+31;\n        }\n    }\n        else\n        {\n            switch(m-1)\n        {\n            case 11:s=s+30;\n            case 10:s=s+31;\n            case 9:s=s+30;\n            case 8:s=s+31;\n            case 7:s=s+31;\n            case 6:s=s+30;\n            case 5:s=s+31;\n            case 4:s=s+30;\n            case 3:s=s+31;\n            case 2:s=s+28;\n            case 1:s=s+31;\n        }\n        }\n        s=s+d;\n        printf(\""%d\"",s);\n    }\n\t}\n    \n\t\treturn 0;\n    }\n    ",WRONG_ANSWER,8,220
1588787722142154752,1c61fcbf1cbbc398cfc33958c7afc448a6cd1673bdc72e4df8c0848cbf367fd6,2022-11-05 14:58:05,C,300.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,year,month,day,t,y;\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++)\n    {\n        scanf(\""%d-%d-%d\"",&year,&month,&day);\n        if(month==2&&day==29)\n        {\n            printf(\""-1\\n\"");\n        }\n        else\n        {\n            t=0;\n            if(month>=3)\n            {\n                for(y=year+1;y<=year+10;y++)\n                {\n                    if((y%4==0&&y%100!=0)||y%400==0)\n                    {\n                        t=t+366;\n                    }\n \n                    else\n                    {\n                        t=t+365;\n                    }\n                }\n            }\n            else if(month<=2)\n            {\n                for(y=year;y<=year+9;y++)\n                {\n                    if((y%4==0&&y%100!=0)||y%400==0)\n                    {\n                        t=t+366;\n                    }\n                    else\n                    {\n                        t=t+365;\n                    }\n                }\n            }\n            printf(\""%d\\n\"",t);\n        }\n \n    }\n}",ACCEPTED,6,492
1588788181623943168,5cef96c2dc18f90d90a3e046632712e9a11c11827177e495b2cb881eaeec404b,2022-11-05 14:59:55,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"\n#include<stdio.h>\n\nint main()\n{\n\tint num,year,mon,day,res=3652;\n\tscanf(\""%d\"",&num);\n\t\n\tfor(int i=1 ; i<=num ; i++)\n\t{\n\t\tscanf(\""%d-%d-%d\"",&year,&mon,&day);\n\t\tif(mon==2&&day==29)\n\t\t{\n\t\t\tprintf(\""-1\\n\"");\n\t\t\tcontinue;\n\t\t}\n\t\tfor(int l=1;l<=10;l++)\n\t\t{\n\t\t\tif(year%100==0&&year%400!=0&&mon<=2||(year+1)%100==0&&(year+1)%400!=0&&mon>2)\n\t\t\t\tres--;\n\t\t\tyear++;\n\t\t}\n\t\tprintf(\""%d\\n\"",res);\n\t} \n\t\n\treturn 0;\n}",WRONG_ANSWER,13,464
1588788888611655680,8a60a7f5a66174b4191e824b6fe59735f6c87e03421fe41c6136ae702823d481,2022-11-05 15:02:43,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include<stdio.h>\nint vod( int x)\n{\n    if(x%4==0 && x%100!=0 || x%400==0) return 1;\n    else return 0;\n}\nint main()\n{\n    int y,m,d,s,f,i,u,k,j;\n    \n    s=0;\n    u=y+10;\n    scanf(\""%d\"",&k);\n    for(j=1;j<=k;j++)\n    {\n        scanf(\""%d-%d-%d\"",&y,&m,&d);\n    \tif( vod(y)==0 && m==2 && d==29)  printf(\""-1\"");\n    else \n\t{\n        for(i=y;i<y+10;i++)\n    {\n        \n         if(i%4==0 && i%100!=0 || i%400==0)\n    {\n        f=1;\n    }\n    else\n    {\n        f=0;\n    }\n       if(f==0) s=s+365; \n\telse if(f==1) s=s+366;}\n    if(y%4==0 && y%100!=0 || y%400==0) \n    {\n        switch(m-1)\n        {\n            case 11:s=s-30;m=m-1;\n            case 10:s=s-31;m=m-1;\n            case 9:s=s-30;m=m-1;\n            case 8:s=s-31;m=m-1;\n            case 7:s=s-31;m=m-1;\n            case 6:s=s-30;m=m-1;\n            case 5:s=s-31;m=m-1;\n            case 4:s=s-30;m=m-1;\n            case 3:s=s-31;m=m-1;\n            case 2:s=s-29;m=m-1;\n            case 1:s=s-31;m=m-1;\n        }\n    }\n        else\n        {\n            switch(m-1)\n        {\n            case 11:s=s-30;\n            case 10:s=s-31;\n            case 9:s=s-30;\n            case 8:s=s-31;\n            case 7:s=s-31;\n            case 6:s=s-30;\n            case 5:s=s-31;\n            case 4:s=s-30;\n            case 3:s=s-31;\n            case 2:s=s-28;\n            case 1:s=s-31;\n        }\n        }\n        s=s-d;\n         if(u%4==0 && u%100!=0 || u%400==0) \n    {\n        switch(m-1)\n        {\n            case 11:s=s+30;\n            case 10:s=s+31;\n            case 9:s=s+30;\n            case 8:s=s+31;\n            case 7:s=s+31;\n            case 6:s=s+30;\n            case 5:s=s+31;\n            case 4:s=s+30;\n            case 3:s=s+31;\n            case 2:s=s+29;\n            case 1:s=s+31;\n        }\n    }\n        else\n        {\n            switch(m-1)\n        {\n            case 11:s=s+30;\n            case 10:s=s+31;\n            case 9:s=s+30;\n            case 8:s=s+31;\n            case 7:s=s+31;\n            case 6:s=s+30;\n            case 5:s=s+31;\n            case 4:s=s+30;\n            case 3:s=s+31;\n            case 2:s=s+28;\n            case 1:s=s+31;\n        }\n        }\n        s=s+d;\n        printf(\""%d\"",s);\n    }\n\t}\n    \n\t\treturn 0;\n    }\n    ",WRONG_ANSWER,20,640
1588788974351593472,5cef96c2dc18f90d90a3e046632712e9a11c11827177e495b2cb881eaeec404b,2022-11-05 15:03:04,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n\tint num,year,mon,day,res=3652;\n\tscanf(\""%d\"",&num);\n\t\n\tfor(int i=1 ; i<=num ; i++)\n\t{\n\t\tscanf(\""%d-%d-%d\"",&year,&mon,&day);\n\t\tif(mon==2&&day==29)\n\t\t{\n\t\t\tprintf(\""-1\\n\"");\n\t\t\tcontinue;\n\t\t}\n\t\tfor(int l=1;l<=10;l++)\n\t\t{\n\t\t\tif((year%100==0&&year%400!=0&&mon<=2)||((year+1)%100==0&&(year+1)%400!=0&&mon>2))\n\t\t\t\tres--;\n\t\t\tyear++;\n\t\t}\n\t\tprintf(\""%d\\n\"",res);\n\t} \n\t\n\treturn 0;\n}\n",WRONG_ANSWER,6,348
1588788974569717760,b4148641733157e32be4600b7c18620f154731a2bd195ed86aee874a50a41479,2022-11-05 15:03:04,Python,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"t=int(input())\nfor i in range(t):\n    num=0\n    nian,yue,tian=list(map(int,input().split('-')))\n    if (nian%4==0 or nian%100==0and nian%400==0)  and yue==2 and tian==29:\n        print(-1)\n        continue\n    else:\n        for j in range(nian+1,nian+11):\n            if j%4==0 or j%100==0and j%400==0:\n                num+=1\n    print(365*10+num)\n    ",WRONG_ANSWER,17,2892
1588789071823048704,8a60a7f5a66174b4191e824b6fe59735f6c87e03421fe41c6136ae702823d481,2022-11-05 15:03:27,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include<stdio.h>\nint vod( int x)\n{\n    if(x%4==0 && x%100!=0 || x%400==0) return 1;\n    else return 0;\n}\nint main()\n{\n    int y,m,d,s,f,i,u,k,j;\n    \n    s=0;\n    u=y+10;\n    scanf(\""%d\"",&k);\n    for(j=1;j<=k;j++)\n    {\n        s=0;\n        scanf(\""%d-%d-%d\"",&y,&m,&d);\n    \tif( vod(y)==0 && m==2 && d==29)  printf(\""-1\"");\n    else \n\t{\n        for(i=y;i<y+10;i++)\n    {\n        \n         if(i%4==0 && i%100!=0 || i%400==0)\n    {\n        f=1;\n    }\n    else\n    {\n        f=0;\n    }\n       if(f==0) s=s+365; \n\telse if(f==1) s=s+366;}\n    if(y%4==0 && y%100!=0 || y%400==0) \n    {\n        switch(m-1)\n        {\n            case 11:s=s-30;m=m-1;\n            case 10:s=s-31;m=m-1;\n            case 9:s=s-30;m=m-1;\n            case 8:s=s-31;m=m-1;\n            case 7:s=s-31;m=m-1;\n            case 6:s=s-30;m=m-1;\n            case 5:s=s-31;m=m-1;\n            case 4:s=s-30;m=m-1;\n            case 3:s=s-31;m=m-1;\n            case 2:s=s-29;m=m-1;\n            case 1:s=s-31;m=m-1;\n        }\n    }\n        else\n        {\n            switch(m-1)\n        {\n            case 11:s=s-30;\n            case 10:s=s-31;\n            case 9:s=s-30;\n            case 8:s=s-31;\n            case 7:s=s-31;\n            case 6:s=s-30;\n            case 5:s=s-31;\n            case 4:s=s-30;\n            case 3:s=s-31;\n            case 2:s=s-28;\n            case 1:s=s-31;\n        }\n        }\n        s=s-d;\n         if(u%4==0 && u%100!=0 || u%400==0) \n    {\n        switch(m-1)\n        {\n            case 11:s=s+30;\n            case 10:s=s+31;\n            case 9:s=s+30;\n            case 8:s=s+31;\n            case 7:s=s+31;\n            case 6:s=s+30;\n            case 5:s=s+31;\n            case 4:s=s+30;\n            case 3:s=s+31;\n            case 2:s=s+29;\n            case 1:s=s+31;\n        }\n    }\n        else\n        {\n            switch(m-1)\n        {\n            case 11:s=s+30;\n            case 10:s=s+31;\n            case 9:s=s+30;\n            case 8:s=s+31;\n            case 7:s=s+31;\n            case 6:s=s+30;\n            case 5:s=s+31;\n            case 4:s=s+30;\n            case 3:s=s+31;\n            case 2:s=s+28;\n            case 1:s=s+31;\n        }\n        }\n        s=s+d;\n        printf(\""%d\"",s);\n    }\n\t}\n    \n\t\treturn 0;\n    }\n    ",WRONG_ANSWER,6,328
1588789208364417024,b4148641733157e32be4600b7c18620f154731a2bd195ed86aee874a50a41479,2022-11-05 15:04:00,Python,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"t=int(input())\nfor i in range(t):\n    num=0\n    nian,yue,tian=list(map(int,input().split('-')))\n    if (nian%4==0 or nian%100==0and nian%400==0)  and yue==2 and tian==29:\n        print(-1)\n        continue\n    else:\n        for j in range(nian,nian+10):\n            if j%4==0 or j%100==0and j%400==0:\n                num+=1\n    print(365*10+num)\n    ",WRONG_ANSWER,17,2768
1588790021061148672,cc9f777f5dea4bc4342fec80f59ef3a14266fc538216baba5b5530fe019e3a77,2022-11-05 15:07:13,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include <stdio.h>\n\nint main() {\n\tint a, i, sum;\n\tint n, y, r;\n\tscanf(\""%d\"", &a);\n\tint j;\n\tj = a;\n\twhile (a--) {\n\t\tsum = 0;\n\t\tscanf(\""%d-%d-%d\"", &n, &y, &r);\n\t\tif (y == 02 && r == 29) {\n\t\t\tsum = -1;\n\t\t} \n        else if(y<1||y>12)\n        {\nsum = -1;\n        }\n        else if(r<1||r>31)\n        {\nsum = -1;\n        }\n        else {\n\t\t\tfor (i = n + 1; i < n + 9; i++) {\n\t\t\t\tif (i % 4 == 0 && i % 100 != 0 || i % 400 == 0)\n\t\t\t\t\tsum += 366;\n\t\t\t\telse\n\t\t\t\t\tsum += 365;\n\t\t\t}\n\t\t\tif (y <= 2 && r < 29) {\n\t\t\t\tif (n % 4 == 0 && n % 100 != 0 || n % 400 == 0)\n\t\t\t\t\tsum += 366;\n\t\t\t\telse\n\t\t\t\t\tsum += 365;\n\t\t\t\tif (n + 9 % 4 == 0 && n + 9 % 100 != 0 || n + 9 % 400 == 0)\n\t\t\t\t\tsum += 366;\n\t\t\t\telse\n\t\t\t\t\tsum += 365;\n\t\t\t}\n\t\t\tif (y > 2) {\n\t\t\t\tif (n + 9 % 4 == 0 && n + 9 % 100 != 0 || n + 9 % 400 == 0)\n\t\t\t\t\tsum += 366;\n\t\t\t\telse\n\t\t\t\t\tsum += 365;\n\t\t\t\tif (n % 4 == 0 && n % 100 != 0 || n % 400 == 0)\n\t\t\t\t\tsum += 366;\n\t\t\t\telse\n\t\t\t\t\tsum += 365;\n\t\t\t}\n\t\t}\n        if(j!=a+1)printf(\""\\n\"");\n\t\tprintf(\""%d\"", sum);\n\t}\n\treturn 0;\n}\n",WRONG_ANSWER,8,340
1588790947989729280,d6f2ab4cda695e0d5d7e30ce5405a0d0874ead144f0ffcdded61d702f2d17123,2022-11-05 15:10:54,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include <stdio.h>\nint sum_year(int ,int ,int );\nint main()\n{\n\tint T;\n\tscanf(\""%d\"",&T);\n\twhile(T--)\n\t{\n\t\tint year,month,day;\n\t\tscanf(\""%d-%d-%d\"",&year,&month,&day);\n\t\t//printf(\""%d-%d-%d\"",year,month,day);\n\t\tif(((year+10 % 4 == 0 && year+10 % 100 != 0)||(year+10 % 400 ==0)) && month == 2 && year == 28)\n\t\t\tprintf(\""-1\\n\"");\n\t\telse\n\t\t\tprintf(\""%d\\n\"",sum_year(year,month,day));\n\t}\n\t\n\treturn 0;\n}\nint sum_year(int year,int month,int day)\n{\n\tint i,sum = 0;\n\tfor (i = year+1;i <= year + 10;i++)\n\t{\n\t\tif ((i % 4 == 0 && i % 100 != 0)||(i % 400 ==0))\n\t\t{\n\t\t\tsum = sum + 366;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tsum = sum + 365;\n\t\t}\n\t}\n\tif ((year % 4 == 0 && year % 100 != 0)||(year % 400 == 0))\n\t{\n\t\tfor (i = 1;i <= month;i++)\n\t\t{\n\t\t\tif (i == 2) sum = sum - 29;\n\t\t\telse if (i == 4 || i == 6 ||i == 9 || i == 11) sum = sum - 30;\n\t\t\telse sum = sum - 31;\n\t\t}\n\t}\n\telse\n\t{\n\t\tfor (i = 1;i <= month;i++)\n\t\t{\n\t\t\tif (i == 2) sum = sum - 28;\n\t\t\telse if (i == 4 || i == 6 ||i == 9 || i == 11) sum = sum - 30;\n\t\t\telse sum = sum - 31;\n\t\t}\n\t}\n\tif ((year+10 % 4 == 0 && year+10 % 100 != 0)||(year+10 % 400 ==0))\n\t{\n\t\tfor (i = 1;i <= month;i++)\n\t\t{\n\t\t\tif (i == 2) sum = sum + 29;\n\t\t\telse if (i == 4 || i == 6 ||i == 9 || i == 11) sum = sum + 30;\n\t\t\telse sum = sum + 31;\n\t\t}\n\t}\n\telse\n\t{\n\t\tfor (i = 1;i <= month;i++)\n\t\t{\n\t\t\tif (i == 2) sum = sum + 28;\n\t\t\telse if (i == 4 || i == 6 ||i == 9 || i == 11) sum = sum + 30;\n\t\t\telse sum = sum + 31;\n\t\t}\n\t}\n\treturn sum;\n}",WRONG_ANSWER,6,348
1588792554336882688,d156a06816c1bf347ccca3ec432bf7dad3f93c19ee6fa2cca52da36af0c90242,2022-11-05 15:17:17,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include \""stdio.h\""\nint add(int y,int m,int d);\nint sum1,sum2;\nint main(){\n    int judge(int a);\n    int n,day=0;\n    int year,b,c;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        scanf(\""%d-%2d-%2d\"",&year,&b,&c);\n        sum1=add(year,b,c);\n        sum2=add(year+10,b,c);\n        printf(\""%d\"",sum2-sum1);\n}\n\nint judge(int a){\n    if(a%4==0&&a%100!=0||a%400==0)return 1;\n    else return 0;\n}\nint add(int y,int m,int d) \n{\n\tint i,k=0;\n\tint sun=0;\n\tif (y%4==0 && y%100==0 ||y%400==0) \n\t{\n\t\tfor (i=0;i<m;i++)\n\t\t{\n\t\t\tint arr[12] = { 31,29,31,30,31,30,31,31,30,31,30,31 };\n\t\t\tk += arr[i];\n\t\t}\n\t}\n\telse\n\t{\n\t\tfor (i = 0; i < m; i++)\n\t\t{\n\t\t\tint arr[12] = { 31,28,31,30,31,30,31,31,30,31,30,31 };\n\t\t\tk += arr[i];\n\t\t}\n\t}\n\tsun = (y - 1) / 4 + y * 365 + k;\n\treturn sun;\n}",COMPILE_ERROR,0,0
1588792653452476416,d156a06816c1bf347ccca3ec432bf7dad3f93c19ee6fa2cca52da36af0c90242,2022-11-05 15:17:41,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include \""stdio.h\""\nint add(int y,int m,int d);\nint sum1,sum2;\nint main(){\n    int judge(int a);\n    int n,day=0;\n    int year,b,c;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        scanf(\""%d-%2d-%2d\"",&year,&b,&c);\n        sum1=add(year,b,c);\n        sum2=add(year+10,b,c);\n        printf(\""%d\"",sum2-sum1);\n}\n\nint add(int y,int m,int d) \n{\n\tint i,k=0;\n\tint sun=0;\n\tif (y%4==0 && y%100==0 ||y%400==0) \n\t{\n\t\tfor (i=0;i<m;i++)\n\t\t{\n\t\t\tint arr[12] = { 31,29,31,30,31,30,31,31,30,31,30,31 };\n\t\t\tk += arr[i];\n\t\t}\n\t}\n\telse\n\t{\n\t\tfor (i = 0; i < m; i++)\n\t\t{\n\t\t\tint arr[12] = { 31,28,31,30,31,30,31,31,30,31,30,31 };\n\t\t\tk += arr[i];\n\t\t}\n\t}\n\tsun = (y - 1) / 4 + y * 365 + k;\n\treturn sun;\n}",COMPILE_ERROR,0,0
1588792779466145792,5cef96c2dc18f90d90a3e046632712e9a11c11827177e495b2cb881eaeec404b,2022-11-05 15:18:11,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n\tint num,year,mon,day;\n\tscanf(\""%d\"",&num);\n\t\n\tfor(int i=1 ; i<=num ; i++)\n\t{\n\t\tint res=3652;\n\t\tscanf(\""%d-%d-%d\"",&year,&mon,&day);\n\t\tif(mon==2&&day==29)\n\t\t{\n\t\t\tprintf(\""-1\\n\"");\n\t\t\tcontinue;\n\t\t}\n\t\tfor(int l=1;l<=10;l++)\n\t\t{\n\t\t\tif((year%100==0 && year%400!=0 && mon<=2)||((year+1)%100==0&&(year+1)%400!=0&&mon>2))\n\t\t\t\tres--;\n\t\t\tyear++;\n\t\t}\n\t\tprintf(\""%d\\n\"",res);\n\t} \n\t\n\treturn 0;\n}\n",WRONG_ANSWER,12,384
1588792862324621312,f2d6ec4012d0f9d1546b9739a2c2e7a9bf6eadfc45b60022357cca9b141a70b3,2022-11-05 15:18:31,Java,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        while (sc.hasNext()) {\n            int n = sc.nextInt();\n            for (int i = 0; i < n; i++) {\n                String s = sc.next();\n                String[] s1 = s.split(\""\\\\-\"");\n                int year=Integer.parseInt(s1[0]);\n                int month=Integer.parseInt(s1[1]);\n                int q = 0;\n                for (int j =year; j < year+10; j++) {\n                    if (j % 4 == 0) {\n                        if (j % 100 != 0 || j % 400 == 0) {\n                            q++;\n                        }\n                    }\n                }\n                if (year% 4 == 0) {\n                    if (year % 100 != 0 || year % 400 == 0) {\n                        if (month<=2){\n                            System.out.println(365*10+q+1);\n                        }\n                    }\n                }\n                System.out.println(365*10+q);\n            }\n        }\n    }\n}",WRONG_ANSWER,113,24308
1588793106437308416,8a60a7f5a66174b4191e824b6fe59735f6c87e03421fe41c6136ae702823d481,2022-11-05 15:19:29,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include<stdio.h>\nint vod( int x)\n{\nint r;\nr=x+10; \n    if(r%4==0 && r%100!=0 || r%400==0) return 1;\n    else return 0;\n}\nint main()\n{\n    int y,m,d,s,f,i,u,k,j;\n    \n   \n    \n    scanf(\""%d\"",&k);\n    for(j=1;j<=k;j++)\n    {\n        scanf(\""%d-%d-%d\"",&y,&m,&d);\n\t\tu=y+10;\n\t\ts=0;\n    \tif( vod(y)==0 && m==2 && d==29)  printf(\""-1\"");\n    else \n\t{\n        for(i=y;i<y+10;i++)\n    {\n        \n         if(i%4==0 && i%100!=0 || i%400==0)\n    {\n        f=1;\n    }\n    else\n    {\n        f=0;\n    }\n       if(f==0) s=s+365; \n\telse if(f==1) s=s+366;}\n    if(y%4==0 && y%100!=0 || y%400==0) \n    {\n        switch(m-1)\n        {\n            case 11:s=s-30;m=m-1;\n            case 10:s=s-31;m=m-1;\n            case 9:s=s-30;m=m-1;\n            case 8:s=s-31;m=m-1;\n            case 7:s=s-31;m=m-1;\n            case 6:s=s-30;m=m-1;\n            case 5:s=s-31;m=m-1;\n            case 4:s=s-30;m=m-1;\n            case 3:s=s-31;m=m-1;\n            case 2:s=s-29;m=m-1;\n            case 1:s=s-31;m=m-1;\n        }\n    }\n        else\n        {\n            switch(m-1)\n        {\n            case 11:s=s-30;\n            case 10:s=s-31;\n            case 9:s=s-30;\n            case 8:s=s-31;\n            case 7:s=s-31;\n            case 6:s=s-30;\n            case 5:s=s-31;\n            case 4:s=s-30;\n            case 3:s=s-31;\n            case 2:s=s-28;\n            case 1:s=s-31;\n        }\n        }\n        s=s-d;\n         if(u%4==0 && u%100!=0 || u%400==0) \n    {\n        switch(m-1)\n        {\n            case 11:s=s+30;\n            case 10:s=s+31;\n            case 9:s=s+30;\n            case 8:s=s+31;\n            case 7:s=s+31;\n            case 6:s=s+30;\n            case 5:s=s+31;\n            case 4:s=s+30;\n            case 3:s=s+31;\n            case 2:s=s+29;\n            case 1:s=s+31;\n        }\n    }\n        else\n        {\n            switch(m-1)\n        {\n            case 11:s=s+30;\n            case 10:s=s+31;\n            case 9:s=s+30;\n            case 8:s=s+31;\n            case 7:s=s+31;\n            case 6:s=s+30;\n            case 5:s=s+31;\n            case 4:s=s+30;\n            case 3:s=s+31;\n            case 2:s=s+28;\n            case 1:s=s+31;\n        }\n        }\n        s=s+d;          \n        printf(\""%d\"",s);\n    }\n\t}\n    \n\t\treturn 0;\n    }\n    ",WRONG_ANSWER,9,204
1588793479940079616,8a60a7f5a66174b4191e824b6fe59735f6c87e03421fe41c6136ae702823d481,2022-11-05 15:20:58,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include<stdio.h>\nint vod( int x)\n{\nint r;\nr=x+10; \n    if(r%4==0 && r%100!=0 || r%400==0) return 1;\n    else return 0;\n}\nint main()\n{\n    int y,m,d,s,f,i,u,k,j;\n    \n   \n    \n    scanf(\""%d\"",&k);\n    for(j=1;j<=k;j++)\n    {\n        scanf(\""%d-%d-%d\"",&y,&m,&d);\n\t\tu=y+10;\n\t\ts=0;\n    \tif( vod(y)==0 && m==2 && d==29)  printf(\""-1\\n\"");\n    else \n\t{\n        for(i=y;i<y+10;i++)\n    {\n        \n         if(i%4==0 && i%100!=0 || i%400==0)\n    {\n        f=1;\n    }\n    else\n    {\n        f=0;\n    }\n       if(f==0) s=s+365; \n\telse if(f==1) s=s+366;}\n    if(y%4==0 && y%100!=0 || y%400==0) \n    {\n        switch(m-1)\n        {\n            case 11:s=s-30;m=m-1;\n            case 10:s=s-31;m=m-1;\n            case 9:s=s-30;m=m-1;\n            case 8:s=s-31;m=m-1;\n            case 7:s=s-31;m=m-1;\n            case 6:s=s-30;m=m-1;\n            case 5:s=s-31;m=m-1;\n            case 4:s=s-30;m=m-1;\n            case 3:s=s-31;m=m-1;\n            case 2:s=s-29;m=m-1;\n            case 1:s=s-31;m=m-1;\n        }\n    }\n        else\n        {\n            switch(m-1)\n        {\n            case 11:s=s-30;\n            case 10:s=s-31;\n            case 9:s=s-30;\n            case 8:s=s-31;\n            case 7:s=s-31;\n            case 6:s=s-30;\n            case 5:s=s-31;\n            case 4:s=s-30;\n            case 3:s=s-31;\n            case 2:s=s-28;\n            case 1:s=s-31;\n        }\n        }\n        s=s-d;\n         if(u%4==0 && u%100!=0 || u%400==0) \n    {\n        switch(m-1)\n        {\n            case 11:s=s+30;\n            case 10:s=s+31;\n            case 9:s=s+30;\n            case 8:s=s+31;\n            case 7:s=s+31;\n            case 6:s=s+30;\n            case 5:s=s+31;\n            case 4:s=s+30;\n            case 3:s=s+31;\n            case 2:s=s+29;\n            case 1:s=s+31;\n        }\n    }\n        else\n        {\n            switch(m-1)\n        {\n            case 11:s=s+30;\n            case 10:s=s+31;\n            case 9:s=s+30;\n            case 8:s=s+31;\n            case 7:s=s+31;\n            case 6:s=s+30;\n            case 5:s=s+31;\n            case 4:s=s+30;\n            case 3:s=s+31;\n            case 2:s=s+28;\n            case 1:s=s+31;\n        }\n        }\n        s=s+d;          \n        printf(\""%d\\n\"",s);\n    }\n\t}\n    \n\t\treturn 0;\n    }\n    ",WRONG_ANSWER,8,452
1588794522895691776,d156a06816c1bf347ccca3ec432bf7dad3f93c19ee6fa2cca52da36af0c90242,2022-11-05 15:25:07,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include \""stdio.h\""\nint add(int y,int m,int d);\nint sum1,sum2;\nint main(){\n    int judge(int a);\n    int n;\n    int year,b,c;\n    scanf(\""%d\"",&n);\n    for(int j=0;j<n;j++){\n        scanf(\""%d-%2d-%2d\"",&year,&b,&c);\n        sum1=add(year,b,c);\n        sum2=add(year+10,b,c);\n        printf(\""%d\"",sum2-sum1);\n}}\n\nint add(int y,int m,int d) \n{\n\tint i,k=0;\n\tint sun=0;\n\tif (y%4==0 && y%100==0 ||y%400==0) \n\t{\n\t\tfor (i=0;i<m;i++)\n\t\t{\n\t\t\tint arr[12] = { 31,29,31,30,31,30,31,31,30,31,30,31 };\n\t\t\tk += arr[i];\n\t\t}\n\t}\n\telse\n\t{\n\t\tfor (i = 0; i < m; i++)\n\t\t{\n\t\t\tint arr[12] = { 31,28,31,30,31,30,31,31,30,31,30,31 };\n\t\t\tk += arr[i];\n\t\t}\n\t}\n\tsun = (y - 1) / 4 + y * 365 + k;\n\treturn sun;\n}",WRONG_ANSWER,7,200
1588794963637370880,7c58dcadbd67cb083fa9f58adc69a5a322ee396f91c322ab8f7748fea5d57cfb,2022-11-05 15:26:52,C++,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint t,years,mons,days,i,j=0,sum=0;\n\tint a[10]={0};\n\tscanf(\""%d\"",&t);\n\twhile(t>0)\n\t{\n\t\tscanf(\""%d-%d-%d\"",&years,&mons,&days);\n\t\tfor(i=years;i<(years+10);i++)\n\t\t{\t\n\t\t\tj=i-years;\n     \t\tif(i%4==0&&i%100!=0||i%400==0)\n    \t\t{\n    \t\t\ta[j]=366;\n    \t\t}\n    \t\telse a[j]=365;\n\t\t}\n\t\tfor(j=0;j<=9;j++)\n\t\t{\n\t\t\tsum=a[j]+sum;\n\t\t}\n\t\tif(a[0]==366&&a[j]==365)printf(\""-1\"");\n\t\telse printf(\""%d\"",sum);\n\tt--;\n\tsum=0; \n\t}\n\treturn 0;\n}",WRONG_ANSWER,9,308
1588795126435065856,5cef96c2dc18f90d90a3e046632712e9a11c11827177e495b2cb881eaeec404b,2022-11-05 15:27:31,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n\tint num,year,mon,day;\n\tscanf(\""%d\"",&num);\n\t\n\tfor(int i=1 ; i<=num ; i++)\n\t{\n\t\tint res=3652;\n\t\tscanf(\""%d-%d-%d\"",&year,&mon,&day);\n\t\tif(((mon==1||mon==3||mon==5||mon==7||mon==8||mon==10||mon==12)&&day>31)||((mon==4||mon==6||mon==9||mon==11)&&day>30)||(mon==2&&day>=29)||mon>12||mon<1||day<1||year<1)\n\t\t{\n\t\t\tprintf(\""-1\\n\"");\n\t\t\tcontinue;\n\t\t}\n\t\tfor(int l=1;l<=10;l++)\n\t\t{\n\t\t\tif((year%100==0 && year%400!=0 && mon<=2)||((year+1)%100==0&&(year+1)%400!=0&&mon>2))\n\t\t\t\tres--;\n\t\t\tyear++;\n\t\t}\n\t\tprintf(\""%d\\n\"",res);\n\t} \n\t\n\treturn 0;\n}\n",WRONG_ANSWER,7,204
1588795828037287936,d156a06816c1bf347ccca3ec432bf7dad3f93c19ee6fa2cca52da36af0c90242,2022-11-05 15:30:18,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include \""stdio.h\""\nint add(int y,int m,int d);\nint sum1,sum2;\nint main(){\n    int judge(int a);\n    int n;\n    int year,b,c;\n    scanf(\""%d\"",&n);\n    for(int j=0;j<n;j++)\n    {\n        scanf(\""%d-%2d-%2d\"",&year,&b,&c);\n        if(judge(year)&&b==2&&c==29&&!judge(year+10))printf(\""-1\"");\n        else\n        {\n            sum1=add(year,b,c);\n        sum2=add(year+10,b,c);\n        printf(\""%d\"",sum2-sum1);\n            }\n    }\n}\n\nint judge(int a){\n    if(a%4==0 && a%100==0 ||a%400==0)return 1;\n    else return 0;\n}\nint add(int y,int m,int d) \n{\n\tint i,k=0;\n\tint sun=0;\n\tif (y%4==0 && y%100==0 ||y%400==0) \n\t{\n\t\tfor (i=0;i<m;i++)\n\t\t{\n\t\t\tint arr[12] = { 31,29,31,30,31,30,31,31,30,31,30,31 };\n\t\t\tk += arr[i];\n\t\t}\n\t}\n\telse\n\t{\n\t\tfor (i = 0; i < m; i++)\n\t\t{\n\t\t\tint arr[12] = { 31,28,31,30,31,30,31,31,30,31,30,31 };\n\t\t\tk += arr[i];\n\t\t}\n\t}\n\tsun = (y - 1) / 4 + y * 365 + k;\n\treturn sun;\n}",WRONG_ANSWER,13,512
1588796206715809792,7c58dcadbd67cb083fa9f58adc69a5a322ee396f91c322ab8f7748fea5d57cfb,2022-11-05 15:31:48,C++,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint t,years,mons,days,i,j=0,sum=0;\n\tint a[10]={0};\n\tscanf(\""%d\"",&t);\n\twhile(t>0)\n\t{\n\t\tscanf(\""%d-%d-%d\"",&years,&mons,&days);\n\t\tfor(i=years;i<(years+10);i++)\n\t\t{\t\n\t\t\tj=i-years;\n     \t\tif(i%4==0&&i%100!=0||i%400==0)\n    \t\t{\n    \t\t\ta[j]=366;\n    \t\t}\n    \t\telse a[j]=365;\n\t\t}\n\t\tfor(j=0;j<=9;j++)\n\t\t{\n\t\t\tsum=a[j]+sum;\n\t\t}\n\t\tif(a[0]==366&&a[9]==365)printf(\""-1\"");\n\t\telse printf(\""%d\"",sum);\n\tt--;\n\tsum=0; \n\t}\n\treturn 0;\n}",WRONG_ANSWER,6,208
1588796610497261568,f2d6ec4012d0f9d1546b9739a2c2e7a9bf6eadfc45b60022357cca9b141a70b3,2022-11-05 15:33:25,Java,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        while (sc.hasNext()) {\n            int n = sc.nextInt();\n            for (int i = 0; i < n; i++) {\n                String s = sc.next();\n                String[] s1 = s.split(\""\\\\-\"");\n                int year=Integer.parseInt(s1[0]);\n                int month=Integer.parseInt(s1[1]);\n                int q = 0;\n                for (int j =year; j < year+10; j++) {\n                    if (j % 4 == 0) {\n                        if (j % 100 != 0 || j % 400 == 0) {\n                            q++;\n                        }\n                    }\n                }\n                if (year% 4 == 0||(year+10)%4==0) {\n                    if ((year % 100 != 0 || year % 400 == 0) ||(year+10 % 100 != 0 || year+10 % 400 == 0) ){\n                        if (month<=2){\n                            System.out.println(365*10+q+1);\n                        }\n                    }\n                }\n                System.out.println(365*10+q);\n            }\n        }\n    }\n}",WRONG_ANSWER,110,24504
1588796732702527488,f2d6ec4012d0f9d1546b9739a2c2e7a9bf6eadfc45b60022357cca9b141a70b3,2022-11-05 15:33:54,Java,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        while (sc.hasNext()) {\n            int n = sc.nextInt();\n            for (int i = 0; i < n; i++) {\n                String s = sc.next();\n                String[] s1 = s.split(\""\\\\-\"");\n                int year=Integer.parseInt(s1[0]);\n                int month=Integer.parseInt(s1[1]);\n                int q = 0;\n                for (int j =year; j < year+10; j++) {\n                    if (j % 4 == 0) {\n                        if (j % 100 != 0 || j % 400 == 0) {\n                            q++;\n                        }\n                    }\n                }\n                if (year% 4 == 0||(year+10)%4==0) {\n                    if ((year % 100 != 0 || year % 400 == 0) ||(year+10 % 100 != 0 || year+10 % 400 == 0) ){\n                        if (month<=2){\n                            System.out.println(365*10+q+1);\n                        }\n                    }\n                }\n                System.out.println(365*10+q);\n            }\n        }\n    }\n}",WRONG_ANSWER,108,24524
1588797544942055424,f2d6ec4012d0f9d1546b9739a2c2e7a9bf6eadfc45b60022357cca9b141a70b3,2022-11-05 15:37:07,Java,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        while (sc.hasNext()) {\n            int n = sc.nextInt();\n            for (int i = 0; i < n; i++) {\n                String s = sc.next();\n                String[] s1 = s.split(\""\\\\-\"");\n                int year=Integer.parseInt(s1[0]);\n                int month=Integer.parseInt(s1[1]);\n                int q = 0;\n                for (int j =year; j <= year+10; j++) {\n                    if (j % 4 == 0) {\n                        if (j % 100 != 0 || j % 400 == 0) {\n                            q++;\n                        }\n                    }\n                }\n                System.out.println(365*10+q);\n            }\n        }\n    }\n}",WRONG_ANSWER,106,24608
1588801040982519808,d6f2ab4cda695e0d5d7e30ce5405a0d0874ead144f0ffcdded61d702f2d17123,2022-11-05 15:51:01,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include <stdio.h>\nint sum_year(int ,int ,int );\nint main()\n{\n\tint T;\n\tscanf(\""%d\"",&T);\n\twhile(T--)\n\t{\n\t\tint year,month,day;\n\t\tscanf(\""%d-%d-%d\"",&year,&month,&day);\n\t\t//printf(\""%d-%d-%d\"",year,month,day);\n\t\tif(((year+10 % 4 == 0 && year+10 % 100 != 0)||(year+10 % 400 ==0)) && month == 2 && year == 28)\n\t\t\tprintf(\""-1\\n\"");\n\t\telse\n\t\t\tprintf(\""%d\\n\"",sum_year(year,month,day));\n\t}\n\t\n\treturn 0;\n}\nint sum_year(int year,int month,int day)\n{\n\tint i,sum = 0;\n\tfor (i = year+1;i <= year + 10;i++)\n\t{\n\t\tif ((i % 4 == 0 && i % 100 != 0)||(i % 400 ==0))\n\t\t{\n\t\t\tsum = sum + 366;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tsum = sum + 365;\n\t\t}\n\t}\n\tif ((year % 4 == 0 && year % 100 != 0)||(year % 400 == 0))\n\t{\n\t\tfor (i = 1;i <= month;i++)\n\t\t{\n\t\t\tif (i == 2) sum = sum - 29;\n\t\t\telse if (i == 4 || i == 6 ||i == 9 || i == 11) sum = sum - 30;\n\t\t\telse sum = sum - 31;\n\t\t}\n\t}\n\telse\n\t{\n\t\tfor (i = 1;i <= month;i++)\n\t\t{\n\t\t\tif (i == 2) sum = sum - 28;\n\t\t\telse if (i == 4 || i == 6 ||i == 9 || i == 11) sum = sum - 30;\n\t\t\telse sum = sum - 31;\n\t\t}\n\t}\n\tif ((year+10 % 4 == 0 && year+10 % 100 != 0)||(year+10 % 400 ==0))\n\t{\n\t\tfor (i = 1;i <= month;i++)\n\t\t{\n\t\t\tif (i == 2) sum = sum + 29;\n\t\t\telse if (i == 4 || i == 6 ||i == 9 || i == 11) sum = sum + 30;\n\t\t\telse sum = sum + 31;\n\t\t}\n\t}\n\telse\n\t{\n\t\tfor (i = 1;i <= month;i++)\n\t\t{\n\t\t\tif (i == 2) sum = sum + 28;\n\t\t\telse if (i == 4 || i == 6 ||i == 9 || i == 11) sum = sum + 30;\n\t\t\telse sum = sum + 31;\n\t\t}\n\t}\n\treturn sum;\n}",WRONG_ANSWER,8,328
1588802705051684864,d6f2ab4cda695e0d5d7e30ce5405a0d0874ead144f0ffcdded61d702f2d17123,2022-11-05 15:57:38,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include <stdio.h>\nint sum_year(int ,int ,int );\nint Isrun(int );\nint main()\n{\n\tint T;\n\tscanf(\""%d\"",&T);\n\twhile(T--)\n\t{\n\t\tint year,month,day;\n\t\tscanf(\""%d-%d-%d\"",&year,&month,&day);\n\t\tif(month == 2 && day == 29 && !(Isrun(year)))\n\t\t\tprintf(\""-1\\n\"");\n\t\telse\n\t\t{\n\t\t\tprintf(\""%d\\n\"",sum_year(year,month,day));\n\t\t}\n\t\t\t\n\t}\n\t\n\treturn 0;\n}\nint Isrun(int year)\n{\n\tif ((year % 4 == 0 && year % 100 != 0)||(year % 400 ==0)) return 1;\n\telse return 0;\n}\nint sum_year(int year,int month,int day)\n{\n\tint i,sum = 0;\n\tfor (i = year;i <= year + 9;i++)\n\t{\n\t\tif (Isrun(i))\n\t\t{\n\t\t\tsum = sum + 366;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tsum = sum + 365;\n\t\t}\n\t}//year\n\tif(!Isrun(year)) sum++;\n\t\tfor (i = 1;i <= month;i++)\n\t\t{\n\t\t\tif (i == 2) sum = sum - 29;\n\t\t\telse if (i == 4 || i == 6 ||i == 9 || i == 11) sum = sum - 30;\n\t\t\telse sum = sum - 31;\n\t\t}\n\t//sum = sum - day;\n\t\n\tif (!Isrun(year+10)) sum--;\n\t\tfor (i = 1;i <= month;i++)\n\t\t{\n\t\t\tif (i == 2) sum = sum + 29;\n\t\t\telse if (i == 4 || i == 6 ||i == 9 || i == 11) sum = sum + 30;\n\t\t\telse sum = sum + 31;\n\t\t}\n\t\t\n\treturn sum;\n}",WRONG_ANSWER,6,356
1588803232040816640,f2d6ec4012d0f9d1546b9739a2c2e7a9bf6eadfc45b60022357cca9b141a70b3,2022-11-05 15:59:43,Java,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        while (sc.hasNext()) {\n            int n = sc.nextInt();\n            for (int i = 0; i < n; i++) {\n                String s = sc.next();\n                String[] s1 = s.split(\""\\\\-\"");\n                int year=Integer.parseInt(s1[0]);\n                int month=Integer.parseInt(s1[1]);\n                int q = 0;\n                for (int j =year; j < year+10; j++) {\n                    if (j % 4 == 0) {\n                        if (j % 100 != 0 || j % 400 == 0) {\n                            q++;\n                        }\n                    }\n                }\n                if (year% 4 == 0) {\n                    if ((year % 100 != 0 || year % 400 == 0) ||(year+10 % 100 != 0 || year+10 % 400 == 0) ){\n                        if (month<=2){\n                            System.out.println(365*10+q);\n                        }else {\n                            System.out.println(365*10+q-1);\n                        }\n                    }\n                }else if ((year+10)%4==0) {\n                    if ((year+10) % 100 != 0 || (year+10) % 400 == 0){\n                        if (month<=2){\n                            System.out.println(365*10+q);\n                        }else {\n                            System.out.println(365*10+q+1);\n                        }\n                    }\n                }else {\n                    System.out.println(365*10+q+1);\n                }\n            }\n        }\n    }\n}",WRONG_ANSWER,107,24500
1588803507359125504,f2d6ec4012d0f9d1546b9739a2c2e7a9bf6eadfc45b60022357cca9b141a70b3,2022-11-05 16:00:49,Java,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        while (sc.hasNext()) {\n            int n = sc.nextInt();\n            for (int i = 0; i < n; i++) {\n                String s = sc.next();\n                String[] s1 = s.split(\""\\\\-\"");\n                int year=Integer.parseInt(s1[0]);\n                int month=Integer.parseInt(s1[1]);\n                int q = 0;\n                for (int j =year; j <year+10; j++) {\n                    if (j % 4 == 0) {\n                        if (j % 100 != 0 || j % 400 == 0) {\n                            q++;\n                        }\n                    }\n                }\n                if (year% 4 == 0) {\n                    if ((year % 100 != 0 || year % 400 == 0) ||(year+10 % 100 != 0 || year+10 % 400 == 0) ){\n                        if (month<=2){\n                            System.out.println(365*10+q);\n                        }else {\n                            System.out.println(365*10+q-1);\n                        }\n                    }\n                }else if ((year+10)%4==0) {\n                    if ((year+10) % 100 != 0 || (year+10) % 400 == 0){\n                        if (month<=2){\n                            System.out.println(365*10+q);\n                        }else {\n                            System.out.println(365*10+q+1);\n                        }\n                    }\n                }else {\n                    System.out.println(365*10+q);\n                }\n            }\n        }\n    }\n}",WRONG_ANSWER,115,24412
1588805984598929408,d6f2ab4cda695e0d5d7e30ce5405a0d0874ead144f0ffcdded61d702f2d17123,2022-11-05 16:10:39,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include <stdio.h>\nint sum_year(int ,int ,int );\nint Isrun(int );\nint main()\n{\n\tint T;\n\tscanf(\""%d\"",&T);\n\twhile(T--)\n\t{\n\t\tint year,month,day;\n\t\tscanf(\""%d-%d-%d\"",&year,&month,&day);\n\t\tif((month == 2 && day == 29 && !(Isrun(year))) || month < 0 || day < 0 || year <0 || month > 12 || day > 31)\n\t\t\tprintf(\""-1\\n\"");\n\t\telse\n\t\t{\n\t\t\tprintf(\""%d\\n\"",sum_year(year,month,day));\n\t\t}\n\t\t\t\n\t}\n\t\n\treturn 0;\n}\nint Isrun(int year)\n{\n\tif ((year % 4 == 0 && year % 100 != 0)||(year % 400 ==0)) return 1;\n\telse return 0;\n}\nint sum_year(int year,int month,int day)\n{\n\tint i,sum = 0;\n\tfor (i = year;i <= year + 9;i++)\n\t{\n\t\tif (Isrun(i))\n\t\t{\n\t\t\tsum = sum + 366;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tsum = sum + 365;\n\t\t}\n\t}//year\n\tif(!Isrun(year)) sum++;\n\t\tfor (i = 1;i <= month;i++)\n\t\t{\n\t\t\tif (i == 2) sum = sum - 29;\n\t\t\telse if (i == 4 || i == 6 ||i == 9 || i == 11) sum = sum - 30;\n\t\t\telse sum = sum - 31;\n\t\t}\n\t//sum = sum - day;\n\t\n\tif (!Isrun(year+10)) sum--;\n\t\tfor (i = 1;i <= month;i++)\n\t\t{\n\t\t\tif (i == 2) sum = sum + 29;\n\t\t\telse if (i == 4 || i == 6 ||i == 9 || i == 11) sum = sum + 30;\n\t\t\telse sum = sum + 31;\n\t\t}\n\t\t\n\treturn sum;\n}",WRONG_ANSWER,11,484
1588806750453694464,d6f2ab4cda695e0d5d7e30ce5405a0d0874ead144f0ffcdded61d702f2d17123,2022-11-05 16:13:42,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include <stdio.h>\nint sum_year(int ,int ,int );\nint Isrun(int );\nint main()\n{\n\tint T;\n\tscanf(\""%d\"",&T);\n\twhile(T--)\n\t{\n\t\tint year,month,day;\n\t\tscanf(\""%d-%d-%d\"",&year,&month,&day);\n\t\tif(((y%4==0&&y%100!=0)||y%400==0)&&(((y+10)%4!=0||(y+10)%100==0)&&(y+10)%400!=0)&&month==2&&day==29)\n\t\t\tprintf(\""-1\\n\"");\n\t\telse\n\t\t{\n\t\t\tprintf(\""%d\\n\"",sum_year(year,month,day));\n\t\t}\n\t\t\t\n\t}\n\t\n\treturn 0;\n}\nint Isrun(int year)\n{\n\tif ((year % 4 == 0 && year % 100 != 0)||(year % 400 ==0)) return 1;\n\telse return 0;\n}\nint sum_year(int year,int month,int day)\n{\n\tint i,sum = 0;\n\tfor (i = year;i <= year + 9;i++)\n\t{\n\t\tif (Isrun(i))\n\t\t{\n\t\t\tsum = sum + 366;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tsum = sum + 365;\n\t\t}\n\t}//year\n\tif(!Isrun(year)) sum++;\n\t\tfor (i = 1;i <= month;i++)\n\t\t{\n\t\t\tif (i == 2) sum = sum - 29;\n\t\t\telse if (i == 4 || i == 6 ||i == 9 || i == 11) sum = sum - 30;\n\t\t\telse sum = sum - 31;\n\t\t}\n\t//sum = sum - day;\n\t\n\tif (!Isrun(year+10)) sum--;\n\t\tfor (i = 1;i <= month;i++)\n\t\t{\n\t\t\tif (i == 2) sum = sum + 29;\n\t\t\telse if (i == 4 || i == 6 ||i == 9 || i == 11) sum = sum + 30;\n\t\t\telse sum = sum + 31;\n\t\t}\n\t\t\n\treturn sum;\n}",COMPILE_ERROR,0,0
1588806839414886400,d6f2ab4cda695e0d5d7e30ce5405a0d0874ead144f0ffcdded61d702f2d17123,2022-11-05 16:14:03,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include <stdio.h>\nint sum_year(int ,int ,int );\nint Isrun(int );\nint main()\n{\n\tint T;\n\tscanf(\""%d\"",&T);\n\twhile(T--)\n\t{\n\t\tint year,month,day;\n\t\tscanf(\""%d-%d-%d\"",&year,&month,&day);\n\t\tif(((year%4==0&&year%100!=0)||year%400==0)&&(((year+10)%4!=0||(year+10)%100==0)&&(year+10)%400!=0)&&month==2&&day==29)\n\t\t\tprintf(\""-1\\n\"");\n\t\telse\n\t\t{\n\t\t\tprintf(\""%d\\n\"",sum_year(year,month,day));\n\t\t}\n\t\t\t\n\t}\n\t\n\treturn 0;\n}\nint Isrun(int year)\n{\n\tif ((year % 4 == 0 && year % 100 != 0)||(year % 400 ==0)) return 1;\n\telse return 0;\n}\nint sum_year(int year,int month,int day)\n{\n\tint i,sum = 0;\n\tfor (i = year;i <= year + 9;i++)\n\t{\n\t\tif (Isrun(i))\n\t\t{\n\t\t\tsum = sum + 366;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tsum = sum + 365;\n\t\t}\n\t}//year\n\tif(!Isrun(year)) sum++;\n\t\tfor (i = 1;i <= month;i++)\n\t\t{\n\t\t\tif (i == 2) sum = sum - 29;\n\t\t\telse if (i == 4 || i == 6 ||i == 9 || i == 11) sum = sum - 30;\n\t\t\telse sum = sum - 31;\n\t\t}\n\t//sum = sum - day;\n\t\n\tif (!Isrun(year+10)) sum--;\n\t\tfor (i = 1;i <= month;i++)\n\t\t{\n\t\t\tif (i == 2) sum = sum + 29;\n\t\t\telse if (i == 4 || i == 6 ||i == 9 || i == 11) sum = sum + 30;\n\t\t\telse sum = sum + 31;\n\t\t}\n\t\t\n\treturn sum;\n}",WRONG_ANSWER,8,328
1588809248677629952,12aa33ee8db8cc8975920bb2e9fd4d4223b232e7be516e0ce206117b1000ec62,2022-11-05 16:23:38,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint r=3650,y,m,d,t,i;\n\tscanf(\""%d\"",&t);\n\twhile(t--)\n\t{\n\t\tscanf(\""%d-%d-%d\"",&y,&m,&d);\n\t\tif(y>0&&(m>0&&m<=12)&&(d>=1&&d<=31))\n\t\t{\tif((m==4||m==6||m==9||m==11)&&d==31)\n\t\t\tr=-1;\n\t\t\tif((m==2&&((y+10)%4==0&&(y+10)%100!=0)||(y+10)%400==0)&&d>29)\n\t\t\tr=-1;\n\t\t\tif(m==2&&(y+10)%4!=0&&d>28)\n\t\t\tr=-1;\n\t\t\tif(y>=2022)\n\t\t\tr=-1;\n\t\t\tif(r>0)\n\t\t\t{\n\t\t\t\tfor(i=y;i<=y+10;i++)\n\t\t\t{\n\t\t\t\tif((i%4==0&&i%100!=0)||i%400==0) r++;\n\t\t\t}\n\t\t\t}\n\t\t\tprintf(\""%d\"",r);\n\t\t\t\n\t\t\t\n\t\t}\n\t\telse\n\t\tprintf(\""-1\"");\n\t}\n\treturn 0;\n}",WRONG_ANSWER,7,504
1588809566505209856,d6f2ab4cda695e0d5d7e30ce5405a0d0874ead144f0ffcdded61d702f2d17123,2022-11-05 16:24:53,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include <stdio.h>\nint sum_year(int ,int ,int );\nint Isrun(int );\nint main()\n{\n\tint T;\n\tscanf(\""%d\"",&T);\n\twhile(T--)\n\t{\n\t\tint year,month,day;\n\t\tscanf(\""%d-%d-%d\"",&year,&month,&day);\n\t\tif((!(Isrun(year)) || !(Isrun(year+10))) && month == 2 && day == 29)\n\t\t\tprintf(\""-1\\n\"");\n\t\telse\n\t\t{\n\t\t\tprintf(\""%d\\n\"",sum_year(year,month,day));\n\t\t}\n\t\t\t\n\t}\n\t\n\treturn 0;\n}\nint Isrun(int year)\n{\n\tif ((year % 4 == 0 && year % 100 != 0)||(year % 400 ==0)) return 1;\n\telse return 0;\n}\nint sum_year(int year,int month,int day)\n{\n\tint i,sum = 0;\n\tfor (i = year;i <= year + 9;i++)\n\t{\n\t\tif (Isrun(i))\n\t\t{\n\t\t\tsum = sum + 366;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tsum = sum + 365;\n\t\t}\n\t}//year\n\tif(!Isrun(year)) sum++;\n\t\tfor (i = 1;i <= month;i++)\n\t\t{\n\t\t\tif (i == 2) sum = sum - 29;\n\t\t\telse if (i == 4 || i == 6 ||i == 9 || i == 11) sum = sum - 30;\n\t\t\telse sum = sum - 31;\n\t\t}\n\t//sum = sum - day;\n\t\n\tif (!Isrun(year+10)) sum--;\n\t\tfor (i = 1;i <= month;i++)\n\t\t{\n\t\t\tif (i == 2) sum = sum + 29;\n\t\t\telse if (i == 4 || i == 6 ||i == 9 || i == 11) sum = sum + 30;\n\t\t\telse sum = sum + 31;\n\t\t}\n\t\t\n\treturn sum;\n}",WRONG_ANSWER,9,336
1588810067221196800,12aa33ee8db8cc8975920bb2e9fd4d4223b232e7be516e0ce206117b1000ec62,2022-11-05 16:26:53,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint r=3650,y,m,d,t,i;\n\tscanf(\""%d\"",&t);\n\twhile(t--)\n\t{\n\t\tscanf(\""%d-%d-%d\"",&y,&m,&d);\n\t\tif(y>0&&(m>0&&m<=12)&&(d>=1&&d<=31))\n\t\t{\tif((m==4||m==6||m==9||m==11)&&d==31)\n\t\t\tr=-1;\n\t\t\tif((m==2&&((y+10)%4==0&&(y+10)%100!=0)||(y+10)%400==0)&&d>=29)\n\t\t\tr=-1;\n\t\t\t//if(m==2&&(y+10)%4!=0&&d>28)\n\t\t\tr=-1;\n\t\t\tif(r>0)\n\t\t\t{\n\t\t\t\tfor(i=y;i<=y+10;i++)\n\t\t\t{\n\t\t\t\tif((i%4==0&&i%100!=0)||i%400==0) r++;\n\t\t\t}\n\t\t\t}\n\t\t\tprintf(\""%d\"",r);\n\t\t\t\n\t\t\t\n\t\t}\n\t\telse\n\t\tprintf(\""-1\"");\n\t}\n\treturn 0;\n}",WRONG_ANSWER,6,328
1588810250013159424,d6f2ab4cda695e0d5d7e30ce5405a0d0874ead144f0ffcdded61d702f2d17123,2022-11-05 16:27:36,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include <stdio.h>\nint sum_year(int ,int ,int );\nint Isrun(int );\nint main()\n{\n\tint T;\n\tscanf(\""%d\"",&T);\n\twhile(T--)\n\t{\n\t\tint year,month,day;\n\t\tscanf(\""%d-%d-%d\"",&year,&month,&day);\n\t\tif(((Isrun(year)) || (Isrun(year+10))) && month == 2 && day == 29)\n\t\t\tprintf(\""-1\\n\"");\n\t\telse\n\t\t{\n\t\t\tprintf(\""%d\\n\"",sum_year(year,month,day));\n\t\t}\n\t\t\t\n\t}\n\t\n\treturn 0;\n}\nint Isrun(int year)\n{\n\tif ((year % 4 == 0 && year % 100 != 0)||(year % 400 ==0)) return 1;\n\telse return 0;\n}\nint sum_year(int year,int month,int day)\n{\n\tint i,sum = 0;\n\tfor (i = year;i <= year + 9;i++)\n\t{\n\t\tif (Isrun(i))\n\t\t{\n\t\t\tsum = sum + 366;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tsum = sum + 365;\n\t\t}\n\t}//year\n\tif(!Isrun(year)) sum++;\n\t\tfor (i = 1;i <= month;i++)\n\t\t{\n\t\t\tif (i == 2) sum = sum - 29;\n\t\t\telse if (i == 4 || i == 6 ||i == 9 || i == 11) sum = sum - 30;\n\t\t\telse sum = sum - 31;\n\t\t}\n\t//sum = sum - day;\n\t\n\tif (!Isrun(year+10)) sum--;\n\t\tfor (i = 1;i <= month;i++)\n\t\t{\n\t\t\tif (i == 2) sum = sum + 29;\n\t\t\telse if (i == 4 || i == 6 ||i == 9 || i == 11) sum = sum + 30;\n\t\t\telse sum = sum + 31;\n\t\t}\n\t\t\n\treturn sum;\n}",WRONG_ANSWER,6,200
1588810363485880320,12aa33ee8db8cc8975920bb2e9fd4d4223b232e7be516e0ce206117b1000ec62,2022-11-05 16:28:03,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint r=3650,y,m,d,t,i;\n\tscanf(\""%d\"",&t);\n\twhile(t--)\n\t{\n\t\tscanf(\""%d-%d-%d\"",&y,&m,&d);\n\t\tif(y>0&&(m>0&&m<=12)&&(d>=1&&d<=31))\n\t\t{\tif((m==4||m==6||m==9||m==11)&&d==31)\n\t\t\tr=-1;\n\t\t\tif((m==2&&((y)%4==0&&(y)%100!=0)||(y)%400==0)&&d=29)\n\t\t\tr=-1;\n\t\t\t//if(m==2&&(y+10)%4!=0&&d>28)\n\t\t\tr=-1;\n\t\t\tif(r>0)\n\t\t\t{\n\t\t\t\tfor(i=y;i<=y+10;i++)\n\t\t\t{\n\t\t\t\tif((i%4==0&&i%100!=0)||i%400==0) r++;\n\t\t\t}\n\t\t\t}\n\t\t\tprintf(\""%d\"",r);\n\t\t\t\n\t\t\t\n\t\t}\n\t\telse\n\t\tprintf(\""-1\"");\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1588810534634434560,12aa33ee8db8cc8975920bb2e9fd4d4223b232e7be516e0ce206117b1000ec62,2022-11-05 16:28:44,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint r=3650,y,m,d,t,i;\n\tscanf(\""%d\"",&t);\n\twhile(t--)\n\t{\n\t\tscanf(\""%d-%d-%d\"",&y,&m,&d);\n\t\tif(y>0&&(m>0&&m<=12)&&(d>=1&&d<=31))\n\t\t{\tif((m==4||m==6||m==9||m==11)&&d==31)\n\t\t\tr=-1;\n\t\t\tif((m==2&&(y%4==0&&y%100!=0)||y%400==0)&&d==29)\n\t\t\tr=-1;\n\t\t\t//if(m==2&&(y+10)%4!=0&&d>28)\n\t\t\tr=-1;\n\t\t\tif(r>0)\n\t\t\t{\n\t\t\t\tfor(i=y;i<=y+10;i++)\n\t\t\t{\n\t\t\t\tif((i%4==0&&i%100!=0)||i%400==0) r++;\n\t\t\t}\n\t\t\t}\n\t\t\tprintf(\""%d\"",r);\n\t\t\t\n\t\t\t\n\t\t}\n\t\telse\n\t\tprintf(\""-1\"");\n\t}\n\treturn 0;\n}",WRONG_ANSWER,7,384
1588810685960749056,12aa33ee8db8cc8975920bb2e9fd4d4223b232e7be516e0ce206117b1000ec62,2022-11-05 16:29:20,C,0.0,1587108005060050944,1587107403563302912,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint r=3650,y,m,d,t,i;\n\tscanf(\""%d\"",&t);\n\twhile(t--)\n\t{\n\t\tscanf(\""%d-%d-%d\"",&y,&m,&d);\n\t\tif(y>0&&(m>0&&m<=12)&&(d>=1&&d<=31))\n\t\t{\tif((m==4||m==6||m==9||m==11)&&d==31)\n\t\t\tr=-1;\n\t\t\tif(m==2&&((y%4==0&&y%100!=0)||y%400==0))&&d==29)\n\t\t\tr=-1;\n\t\t\t//if(m==2&&(y+10)%4!=0&&d>28)\n\t\t\tr=-1;\n\t\t\tif(r>0)\n\t\t\t{\n\t\t\t\tfor(i=y;i<=y+10;i++)\n\t\t\t{\n\t\t\t\tif((i%4==0&&i%100!=0)||i%400==0) r++;\n\t\t\t}\n\t\t\t}\n\t\t\tprintf(\""%d\"",r);\n\t\t\t\n\t\t\t\n\t\t}\n\t\telse\n\t\tprintf(\""-1\"");\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1588789307672952832,74e408eea1bbe16218c3f1957fd95029f1076d057b036fd338e2c3ab4f682e51,2022-11-05 15:04:23,C++,0.0,1587108074106683392,1587107403563302912,1049226928954454016,"#include<bits/stdc++.h>\n#define int long long \nusing namespace std;\n\nsigned main(){\n    int y, m ,d; int ans;\n    int n; cin >> n;\n    while(n--){\n        ans = 3650;\n        cin >> y;\n        cin.get(); cin >> m;  \n        cin.get(); cin >> d;\n        if(y <= 0 || m <= 0 || m > 12 || d <= 0 || d > 31){\n            cout << -1;\n            return 0;\n        }\n        for(int i = y; i < y + 9; ++i){\n            if(i % 4 == 0 && i % 100 != 0){\n                ans += 1;\n            } else if (i % 400 == 0){\n                ans += 1;\n            }\n        }\n        cout << ans;\n    }\n}",WRONG_ANSWER,7,640
1588791078726184960,74e408eea1bbe16218c3f1957fd95029f1076d057b036fd338e2c3ab4f682e51,2022-11-05 15:11:26,C++,0.0,1587108074106683392,1587107403563302912,1049226928954454016,"#include<bits/stdc++.h>\n#define int long long \nusing namespace std;\n\nsigned main(){\n    int y, m ,d; int ans;\n    int n; cin >> n;\n    while(n--){\n        ans = 3650;\n        cin >> y;\n        cin.get(); cin >> m;  \n        cin.get(); cin >> d;\n        if(y <= 0 || m <= 0 || m > 12 || d <= 0 || d > 31){\n            cout << -1;\n            return 0;\n        }\n        if((y % 4 == 0 && y % 100 != 0) || y % 400 == 0){\n            if(m == 2 && d > 29){\n                cout << -1;\n                return 0;\n            }\n        } else {\n            if(m == 2 && d > 28){\n                cout << -1;\n                return 0;\n            }\n        }\n        for(int i = y; i < y + 9; ++i){\n            if(i % 4 == 0 && i % 100 != 0){\n                ans += 1;\n            } else if (i % 400 == 0){\n                ans += 1;\n            }\n        }\n        cout << ans;\n    }\n}",WRONG_ANSWER,8,476
1589160766740148224,b4148641733157e32be4600b7c18620f154731a2bd195ed86aee874a50a41479,2022-11-06 15:40:26,Python,0.0,1588835660251820034,1587107403563302912,1049226928954454016,"def judge(n):\n    return 1 if n%100!=0and n%4==0 or n%400==0 else 0\nt=int(input())\nfor i in range(t):\n    year,month,day=map(int,input().split('-'))\n    s1=3650\n    s2=3660\n    if month==2 and day==29:\n        if judge(year+10)==0:\n            print(-1)\n        else:\n            for j in range(year+1,year+11):\n                if judge(j)==0:\n                    s2-=1\n        print(s2)\n    else:\n        if month<=2:\n            for j in range(year,year+10):\n                if judge(j)==1:\n                    s1+=1\n        else:\n            for j in range(year+1,year+11):\n                if judge(j)==1:\n                    s1+=1\n        print(s1)\n        \n\n        \n        \n        \n        \n\n",WRONG_ANSWER,21,2756
1589161086727794688,b4148641733157e32be4600b7c18620f154731a2bd195ed86aee874a50a41479,2022-11-06 15:41:42,Python,0.0,1588835660251820034,1587107403563302912,1049226928954454016,"def judge(n):\n    return 1 if n%100!=0and n%4==0 or n%400==0 else 0\nt=int(input())\nfor i in range(t):\n    year,month,day=map(int,input().split('-'))\n    s1=3650\n\n    if month==2 and day==29:\n        if judge(year+10)==0:\n            print(-1)\n        else:\n            for j in range(year+1,year+11):\n                if judge(j)==0:\n                    s1-=1\n\n                    \n    else:\n        if month<=2:\n            for j in range(year,year+10):\n                if judge(j)==1:\n                    s1+=1\n        else:\n            for j in range(year+1,year+11):\n                if judge(j)==1:\n                    s1+=1\n    print(s1)\n        \n\n        \n        \n        \n        \n\n",WRONG_ANSWER,16,2756
1589161631463047168,b4148641733157e32be4600b7c18620f154731a2bd195ed86aee874a50a41479,2022-11-06 15:43:52,Python,0.0,1588835660251820034,1587107403563302912,1049226928954454016,"def judge(n):\n    return 1 if n%100!=0and n%4==0 or n%400==0 else 0\nt=int(input())\nfor i in range(t):\n    year,month,day=map(int,input().split('-'))\n    s1=3650\n\n    if month==2 and day==29:\n        if judge(year+10)==0:\n            print(-1)\n        else:\n            for j in range(year+1,year+11):\n                if judge(j)==0:\n                    s1-=1\n            print(s1)\n                    \n    else:\n        if month<=2:\n            for j in range(year,year+10):\n                if judge(j)==1:\n                    s1+=1\n        else:\n            for j in range(year+1,year+11):\n                if judge(j)==1:\n                    s1+=1\n    print(s1)\n        \n\n        \n        \n        \n        \n\n",WRONG_ANSWER,18,2756
1589162215557632000,b4148641733157e32be4600b7c18620f154731a2bd195ed86aee874a50a41479,2022-11-06 15:46:12,Python,300.0,1588835660251820034,1587107403563302912,1049226928954454016,"def judge(n):\n    return 1 if n%100!=0and n%4==0 or n%400==0 else 0\nt=int(input())\nfor i in range(t):\n    year,month,day=map(int,input().split('-'))\n    s1=3650\n\n    if month==2 and day==29:\n        if judge(year+10)==0:\n            print(-1)\n        else:\n            for j in range(year+1,year+11):\n                if judge(j)==0:\n                    s1-=1\n            print(s1)\n                    \n    else:\n        if month<=2:\n            for j in range(year,year+10):\n                if judge(j)==1:\n                    s1+=1\n        else:\n            for j in range(year+1,year+11):\n                if judge(j)==1:\n                    s1+=1\n        print(s1)\n        \n\n        \n        \n        \n        \n\n",ACCEPTED,21,3020
1589244773351862272,cbc28cb414c021b4474b5491fcef09b49b695530f1abf7b36b6a6a6bfa3cca77,2022-11-06 21:14:15,C++,300.0,1588835660251820034,1587107403563302912,1049226928954454016,"#include<iostream>\n\nint leap(int y)\n{\n\treturn y % 4 == 0 && y % 100 != 0 || y % 400 == 0 ? 1 : 0;\n}\nint main()\n{\n\tint t, y, m, d, i, s;\n\tscanf(\""%d\"", &t);\n\twhile (t--)\n\t{\n\t\tscanf(\""%d-%d-%d\"", &y, &m, &d);\n\t\ts = 3650;\n\t\tif (m == 2 && d == 29)\n\t\t{\n\t\t\tif (!leap(y + 10))\n\t\t\t\tprintf(\""-1\\n\"");\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif (m <= 2)\n\t\t\t{\n\t\t\t\tfor (i = y; i < y + 10; i++)\n\t\t\t\t\tif (leap(i))\n\t\t\t\t\t\ts++;\n\t\t\t}\n\t\t\telse\n\t\t\t\tfor (i = y + 1; i <= y + 10; i++)\n\t\t\t\t\tif (leap(i))\n\t\t\t\t\t\ts++;\n\t\t\tprintf(\""%d\\n\"", s);\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,5,448
1589252633091702784,b4148641733157e32be4600b7c18620f154731a2bd195ed86aee874a50a41479,2022-11-06 21:45:29,Python,300.0,1588835660251820034,1587107403563302912,1049226928954454016,"def judge(n):\n    return 1 if n%100!=0and n%4==0 or n%400==0 else 0\nt=int(input())\nfor i in range(t):\n    year,month,day=map(int,input().split('-'))\n    s1=3650\n    s2=3660\n    if month==2 and day==29:\n        if judge(year+10)==0:\n            print(-1)\n        else:\n            for j in range(year+1,year+11):\n                if judge(j)==0:\n                    s2-=1\n            print(s2)\n                    \n    else:\n        if month<=2:\n            for j in range(year,year+10):\n                if judge(j)==1:\n                    s1+=1\n        else:\n            for j in range(year+1,year+11):\n                if judge(j)==1:\n                    s1+=1\n        print(s1)\n        \n\n        \n        \n        \n        \n\n",ACCEPTED,18,2756
1589550305140867072,12aa33ee8db8cc8975920bb2e9fd4d4223b232e7be516e0ce206117b1000ec62,2022-11-07 17:28:19,C,0.0,1588835660251820034,1587107403563302912,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint r=3650,y,m,d,t,i;\n\tscanf(\""%d\"",&t);\n\twhile(t--)\n\t{\n\t\tscanf(\""%d-%d-%d\"",&y,&m,&d);\n\t\tif(y>0&&(m>0&&m<=12)&&(d>=1&&d<=31))\n\t\t{\t\n\t\t\n\t\t\tif(m==2&&((y%4==0&&y%100!=0)||y%400==0)&&d==29)\n\t\t\tr=r-1;\n\t\t\t//if(m==2&&(y+10)%4!=0&&d>28)\n\t\t\n\t\t\tif(r>0)\n\t\t\t{\n\t\t\t\tfor(i=y;i<=y+10;i++)\n\t\t\t{\n\t\t\t\tif((i%4==0&&i%100!=0)||i%400==0) r++;\n\t\t\t}\n\t\t\t}\n\t\t\tprintf(\""%d\"",r);\n\t\t\t\n\t\t\t\n\t\t}\n\t\telse\n\t\tprintf(\""-1\"");\n\t}\n\treturn 0;\n}",WRONG_ANSWER,3,360
1589793105786765312,a72690fc0f1097ec91cec9a11d37c29cdde3ee480cc8a3c3184f5abac5721a4c,2022-11-08 09:33:08,Java,0.0,1588835660251820034,1587107403563302912,1049226928954454016,"\n\nimport java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc=new Scanner(System.in);\n        int n=sc.nextInt();\n        for (int i = 0; i < n; i++) {\n            int sum=0;\n            String date = sc.next();\n            int year = Integer.parseInt(date.substring(0,4));\n            for (int i1 = year; i1 < year+10; i1++) {\n                if (i1%200==0 || (i1%4==0 && i1%100!=0)){\n                    sum+=366;\n                }else {\n                    sum+=365;\n                }\n            }\n            System.out.println(sum);\n        }\n    }\n}\n",WRONG_ANSWER,131,19136
1589974637407174656,d4d89a60a1e51464e3a83a7b5a3387d374033bcc3c66bb32a3a08873d696f6cf,2022-11-08 21:34:28,C,300.0,1588835660251820034,1587107403563302912,1049226928954454016,"#define _CRT_SECURE_NO_WARNINGS\n#include<stdio.h>\n\nint isleap(int y)\n{\n    if (y % 4 == 0 && (y % 100 != 0 || y % 400 == 0)) return 1;\n    return 0;\n}\n\nint main()\n{\n    int i, T;\n    int Y, M, D;\n    int sum;\n    scanf(\""%d\"", &T);\n    while (T--)\n    {\n        sum = 10 * 365;\n        scanf(\""%d-%d-%d\"", &Y, &M, &D);\n        if (!isleap(Y + 10) && M == 2 && D == 29)\n        {\n            printf(\""-1\\n\"");\n            continue;\n        }\n        if (isleap(Y) && (M < 2 || (M == 2 && D <= 28)))\n            sum++;\n        if (isleap(Y + 10) && (M > 2 || (M == 2 && D == 29)))\n            sum++;\n        for (i = Y + 1;i <= Y + 10;i++)\n            if (isleap(i))\n                sum++;\n        printf(\""%d\\n\"", sum);\n    }\n    return 0;\n}\n",ACCEPTED,3,332
1591067635889016832,dda3a838511d60a585db07ada95cfe8146d1f6db4124bf537d104c3a010de940,2022-11-11 21:57:39,C,0.0,1588835660251820034,1587107403563302912,1049226928954454016,"#include<stdio.h>\nint leap(int y)\n{\n    return y % 4 == 0 && y % 100 != 0 || y % 400 == 0 ? 1 : 0;\n}\nint main()\n{\n    int t, y, m, d, i, s;\n    scanf(\""%d\"", &t);\n    while (t--)\n    {\n        scanf(\""%d-%d-%d\"", &y, &m, &d);\n        s = 3650;\n        if (m == 2 && d == 29)\n        {\n            if (!leap(y + 10))\n                printf(\""-1\\n\"");\n            else\n            {\n                for (i = y + 1; i <= y + 10; i++)\n                    if (!leap(i))\n                        s--;\n                printf(\""%d\\n\"", s);\n            }\n        }\n        else\n        {\n            if (m <= 2)\n            {\n                for (i = y; i < y + 10; i++)\n                    if (leap(i))\n                        s++;\n            }\n            else\n                for (i = y + 1; i <= y + 10; i++)\n                    if (leap(i))\n                        s++;\n            printf(\""%d\\n\"", s);\n        }\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1591280547001860096,7c58dcadbd67cb083fa9f58adc69a5a322ee396f91c322ab8f7748fea5d57cfb,2022-11-12 12:03:41,C,0.0,1588835660251820034,1587107403563302912,1049226928954454016,"#include<stdio.h>\nint leap(int y)\n{\n\treturn y % 4== 0 && y % 400 != 0 || y % 400 == 0 ? 0 : 1;\n}\nint main()\n{\n\tint y,m,d,i,n,s;\n\tscanf(\""%d\"",&n);\n\twhile(n--)\n\t{\n\t\tscanf(\""%d-%d-%d\"",&y,&m,&d);\n\t\ts=3650;\t\n\t\tif(m==2&&d==29)\n\t\t{\n\t\t\tif(!leap(y+10))printf(\""-1\"");\n\t\t\telse \n\t\t\t{\n\t\t\t\tfor(i=y+1;i<=y+10;i++)\n\t\t\t\t{\n\t\t\t\t\tif(!leap(i))s--;\n\t\t\t\t}\n\t\t\t\tprintf(\""%d\"",s);\n\t\t\t}\n\t\t}\n\t\telse \n\t\t{\n\t\t\tif(m<=2)\n\t\t\t{\n\t\t\t\tfor(i=y;i<y+10;i++)\n\t\t\t\t{\n\t\t\t\t\tif(leap(i))s++;\n\t\t\t\t}\n\t\t\t\tprintf(\""%d\"",s);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tfor(i=y+1;i<=y+10;i++)\n\t\t\t\t{\n\t\t\t\t\tif(leap(i))\n\t\t\t\t\ts++;\n\t\t\t\t}\n\t\t\t\tprintf(\""%d\\n\"",s);\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}",WRONG_ANSWER,3,196
1591393849346428928,7925f14116adf5fb3b68876bfe08d71dae7944e7bad8675409adda4b1cc615e1,2022-11-12 19:33:55,C,0.0,1588835660251820034,1587107403563302912,1049226928954454016,"#include<stdio.h>\nintleap(inty)\n{\nreturny%4==0&&y%100!=0||y%400==0?1:0;\n}\nintmain()\n{\nintt,y,m,d,i,s;\nscanf(\""%d\"",&t);\nwhile(t--)\n{\nscanf(\""%d-%d-%d\"",&y,&m,&d);\ns=3650;\nif(m==2&&d==29)\n{\nif(!leap(y+10))\nprintf(\""-1\\n\"");\nelse\n{\nfor(i=y+1;i<=y+10;i++)\nif(!leap(i))\ns--;\nprintf(\""%d\\n\"",s);\n}\n}\nelse\n{\nif(m<=2)\n{\nfor(i=y;i<y+10;i++)\nif(leap(i))\ns++;\n}\nelse\nfor(i=y+1;i<=y+10;i++)\nif(leap(i))\ns++;\nprintf(\""%d\\n\"",s);\n}\n}\nreturn0;\n}",COMPILE_ERROR,0,0
1591393905663348736,7925f14116adf5fb3b68876bfe08d71dae7944e7bad8675409adda4b1cc615e1,2022-11-12 19:34:08,C++,0.0,1588835660251820034,1587107403563302912,1049226928954454016,"#include<stdio.h>\nintleap(inty)\n{\nreturny%4==0&&y%100!=0||y%400==0?1:0;\n}\nintmain()\n{\nintt,y,m,d,i,s;\nscanf(\""%d\"",&t);\nwhile(t--)\n{\nscanf(\""%d-%d-%d\"",&y,&m,&d);\ns=3650;\nif(m==2&&d==29)\n{\nif(!leap(y+10))\nprintf(\""-1\\n\"");\nelse\n{\nfor(i=y+1;i<=y+10;i++)\nif(!leap(i))\ns--;\nprintf(\""%d\\n\"",s);\n}\n}\nelse\n{\nif(m<=2)\n{\nfor(i=y;i<y+10;i++)\nif(leap(i))\ns++;\n}\nelse\nfor(i=y+1;i<=y+10;i++)\nif(leap(i))\ns++;\nprintf(\""%d\\n\"",s);\n}\n}\nreturn0;\n}",COMPILE_ERROR,0,0
1590736237261029376,f6233bf69e5717913375f818af07214d1d2de6df0cd3bcb24368fbde112d6d15,2022-11-11 00:00:48,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,print(2022),ACCEPTED,16,3252
1590736389317132288,acf80eea856463058b81f71c0238069795893092293fbd098cc594959df6444e,2022-11-11 00:01:24,Python,0.0,1590528927448293376,1590525945717575680,1049226928954454016,peint(2022),NON_ZERO_EXIT_CODE,16,2920
1590736415598645248,630b8bfc88107b488e158fc7108c8faf0a195f9b9030c3faf51edac625714584,2022-11-11 00:01:30,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main(){\n    printf(\""2022\"");\n}",ACCEPTED,3,348
1590736428466769920,d808f4cc3c70a696f5c416714e0998fe96743e5273bc07a26f75738d12d304f5,2022-11-11 00:01:33,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"public class test {\n    public static void main(String[] args) {\n        System.out.println(\""2022\"");\n    }\n}",COMPILE_ERROR,0,0
1590736435852939264,acf80eea856463058b81f71c0238069795893092293fbd098cc594959df6444e,2022-11-11 00:01:35,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,print(2022),ACCEPTED,15,2752
1590736614140219392,129ddfe9d2d4553f365faf2fdc5e2f0c271b2e342a4cff13802dda8ef8b3d1c2,2022-11-11 00:02:17,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,print('2022'),ACCEPTED,17,2868
1590736636579741696,5b382280d947e26011a7c75c34d257662bc13c50f8257bc8cae807604d61430c,2022-11-11 00:02:23,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"public class test {\n    public static void main(String[] args) {\n        System.out.printf(\""2022\"");\n    }\n}\n",COMPILE_ERROR,0,0
1590736665717571584,1773d9c971942817d949c47973c4eb8c24531f728d5480dbf3b232e568926258,2022-11-11 00:02:30,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"printfln(\""2022\"")",COMPILE_ERROR,0,0
1590736714971287552,5b382280d947e26011a7c75c34d257662bc13c50f8257bc8cae807604d61430c,2022-11-11 00:02:41,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"class test {\n    public static void main(String[] args) {\n        System.out.printf(\""2022\"");\n    }\n}\n",COMPILE_ERROR,0,0
1590736755949633536,d9e00d995e65b04cda3ddef6baec19225e4351002ab4efa981f62d78919a481b,2022-11-11 00:02:51,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,4,180
1590736806360973312,d808f4cc3c70a696f5c416714e0998fe96743e5273bc07a26f75738d12d304f5,2022-11-11 00:03:03,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""2022\"");\n}\n",ACCEPTED,3,196
1590736829018603520,864c0dc14d6d917707294bc7e18ea53a2c0536c5d47f3d25f94f0188f106014f,2022-11-11 00:03:09,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,3,196
1590736831275139072,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-11 00:03:09,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    printf(\""%d\"",2022);\n    return 0;\n}\n",ACCEPTED,3,192
1590736992600653825,1773d9c971942817d949c47973c4eb8c24531f728d5480dbf3b232e568926258,2022-11-11 00:03:48,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"public void main(){\n    System.out.println(\""2022\""):\n}",COMPILE_ERROR,0,0
1590737136947605504,17759f531671f838bf3fae4270190e93b6109026f9503f986c1ed85bb412007d,2022-11-11 00:04:22,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main\n{\n    printf(\""2022\"");\n}",COMPILE_ERROR,0,0
1590737232607121408,630b8bfc88107b488e158fc7108c8faf0a195f9b9030c3faf51edac625714584,2022-11-11 00:04:45,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main(){\nint a,b,c;\nscanf(\""%d %d %d\"",&a,&b,&c);\nprintf(\""%d\"",a=a+b-c);\n}\n",ACCEPTED,6,324
1590737289989390336,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-11 00:04:59,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int x,y,z;\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n    return 0;\n}\n",ACCEPTED,7,320
1590737319714426880,d808f4cc3c70a696f5c416714e0998fe96743e5273bc07a26f75738d12d304f5,2022-11-11 00:05:06,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n}\n",ACCEPTED,6,324
1590737350492205056,17759f531671f838bf3fae4270190e93b6109026f9503f986c1ed85bb412007d,2022-11-11 00:05:13,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,print(2022),ACCEPTED,14,2748
1590737569741078528,864c0dc14d6d917707294bc7e18ea53a2c0536c5d47f3d25f94f0188f106014f,2022-11-11 00:06:05,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int x,y,z;\n    int s;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    s=x+y-z;\n    printf(\""%d\"",s);\n    return 0;\n}\n",ACCEPTED,7,308
1590737679715708928,5b382280d947e26011a7c75c34d257662bc13c50f8257bc8cae807604d61430c,2022-11-11 00:06:31,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"print(\""2022\"")",ACCEPTED,14,2756
1590737709314932736,13616e85f216dd3844293b46f4b46105a0a2c458f7807a7b677858feb35cb63a,2022-11-11 00:06:39,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"int main(){\n    printf(\""2022\"")\n    }",COMPILE_ERROR,0,0
1590737754055573504,d9e00d995e65b04cda3ddef6baec19225e4351002ab4efa981f62d78919a481b,2022-11-11 00:06:49,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x,y,z;\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n    return 0;\n}\n",ACCEPTED,6,320
1590737767255027712,13616e85f216dd3844293b46f4b46105a0a2c458f7807a7b677858feb35cb63a,2022-11-11 00:06:52,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"int main(){\n    printf(\""2022\"")；\n    }",COMPILE_ERROR,0,0
1590737968787140608,13616e85f216dd3844293b46f4b46105a0a2c458f7807a7b677858feb35cb63a,2022-11-11 00:07:40,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main(){\n    printf(\""2022\"")；\n    }",COMPILE_ERROR,0,0
1590738050806755328,13616e85f216dd3844293b46f4b46105a0a2c458f7807a7b677858feb35cb63a,2022-11-11 00:08:00,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main(){\n    printf(\""2022\"");\n    }",ACCEPTED,3,328
1590738209204670464,17759f531671f838bf3fae4270190e93b6109026f9503f986c1ed85bb412007d,2022-11-11 00:08:38,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x,y,z;\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n}",ACCEPTED,7,312
1590738264196186112,c358160a3e618a44cd693944fe10043e6372f46bf7d517c3c3f583bd85b17c5e,2022-11-11 00:08:51,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"print(\""2022\"")\n",ACCEPTED,15,2756
1590738371926888448,1773d9c971942817d949c47973c4eb8c24531f728d5480dbf3b232e568926258,2022-11-11 00:09:17,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""2022\\n\"");\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590738404394991616,1773d9c971942817d949c47973c4eb8c24531f728d5480dbf3b232e568926258,2022-11-11 00:09:24,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""2022\\n\"");\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590738497617596416,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-11 00:09:46,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<math.h>\n#include <stdio.h>\nint main()\n{\n    int n,i,x,temp,a;\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++)\n    {\n     scanf(\""%d\"",&x);\n     temp=pow(6,x);\n     a=temp%10;\n     printf(\""%d\\n\"",a);\n    }\n    return 0;\n}\n",WRONG_ANSWER,8,464
1590738709056655360,06b00897262b024d9e66dcd771cf81de9b63954f7a4554699d17c2158114c0d1,2022-11-11 00:10:37,Java,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        System.out.println(\""2022\"");\n        }\n    }\n\n",ACCEPTED,69,14460
1590738731366133760,5b382280d947e26011a7c75c34d257662bc13c50f8257bc8cae807604d61430c,2022-11-11 00:10:42,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main(){\n    int X,Y,Z;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    printf(\""%d\"",X+Y-Z);\n}",ACCEPTED,5,316
1590738897913556992,f6233bf69e5717913375f818af07214d1d2de6df0cd3bcb24368fbde112d6d15,2022-11-11 00:11:22,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,X = eval(input())\nY = eval(input())\nZ = eval(input())\nprint(X + Y - Z)\n,NON_ZERO_EXIT_CODE,15,2760
1590739065568296960,1773d9c971942817d949c47973c4eb8c24531f728d5480dbf3b232e568926258,2022-11-11 00:12:02,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"package com.DH.Test2;\n\npublic class test111 {\n    public static void main(String[] args) {\n        System.out.println(\""2022\"");\n    }\n}\n",COMPILE_ERROR,0,0
1590739158593744896,129ddfe9d2d4553f365faf2fdc5e2f0c271b2e342a4cff13802dda8ef8b3d1c2,2022-11-11 00:12:24,Java,300.0,1590524835191705600,1572865591226855424,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int a = s.nextInt();\n        int b = s.nextInt();\n        int c = s.nextInt();\n        System.out.println(a+b-c);\n    }\n},ACCEPTED,239,21456
1590739182870401024,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-11 00:12:30,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<math.h>\n#include <stdio.h>\nint main()\n{\n    int n,i,x,temp,a;\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++)\n    {\n     scanf(\""%d\"",&x);\n     temp=pow(6,x);\n     a=temp%10;\n     if(i<n)\n      printf(\""%d\\n\"",a);\n     else\n      printf(\""%d\"",a);\n    }\n    return 0;\n}\n",WRONG_ANSWER,8,452
1590739191162535936,1773d9c971942817d949c47973c4eb8c24531f728d5480dbf3b232e568926258,2022-11-11 00:12:32,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"package com.DH.Test2;\n\npublic class test111 {\n    public static void main(String[] args) {\n        System.out.println(\""2022\"");\n    }\n}\n",COMPILE_ERROR,0,0
1590739288927567872,06b00897262b024d9e66dcd771cf81de9b63954f7a4554699d17c2158114c0d1,2022-11-11 00:12:55,Java,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner in = new Scanner(System.in);\n        int a,b,c;\n        a=in.nextInt();\n        b=in.nextInt();\n        c=in.nextInt();\n        System.out.println(a+b-c);\n        }\n    }\n",ACCEPTED,246,19240
1590739467256770560,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-11 00:13:38,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<math.h>\n#include <stdio.h>\nint main()\n{\n    int n,i,temp,a;\n    double x;\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++)\n    {\n     scanf(\""%d\"",&x);\n     temp=pow(6,x);\n     a=temp%10;\n     if(i<n)\n      printf(\""%d\\n\"",a);\n     else\n      printf(\""%d\"",a);\n    }\n    return 0;\n}\n",WRONG_ANSWER,3,312
1590739590254735360,17759f531671f838bf3fae4270190e93b6109026f9503f986c1ed85bb412007d,2022-11-11 00:14:07,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,n,a[1000];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        printf(\""6\\n\"");\n}",WRONG_ANSWER,3,200
1590739761222955008,d808f4cc3c70a696f5c416714e0998fe96743e5273bc07a26f75738d12d304f5,2022-11-11 00:14:48,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,count;\n    scanf(\""%d\"",&n);\n    for(int i=2;i<=n;i++)\n    {\n        for (int j = 0; j <= (int)sqrt(i); j++)\n        {\n            if (i%j==0)\n            {\n                break;\n            }\n            \n        }\n        count++;\n        \n    }\n    printf(\""%d\"",count);\n    \n}\n",FLOAT_POINT_EXCEPTION,3,440
1590739775374536704,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-11 00:14:51,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<math.h>\n#include <stdio.h>\nint main()\n{\n    int n,i,temp,a,x;\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++)\n    {\n     scanf(\""%d\"",&x);\n     temp=pow(6.00,x);\n     a=temp%10;\n     if(i<n)\n      printf(\""%d\\n\"",a);\n     else\n      printf(\""%d\"",a);\n    }\n    return 0;\n}\n",WRONG_ANSWER,9,512
1590739799084961792,d9e00d995e65b04cda3ddef6baec19225e4351002ab4efa981f62d78919a481b,2022-11-11 00:14:57,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int i,n,m;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&m);\n        printf(\""%d\\n\"",(int)pow(6,m)%10);\n    }\n    return 0;\n}",WRONG_ANSWER,8,392
1590739859394834432,13616e85f216dd3844293b46f4b46105a0a2c458f7807a7b677858feb35cb63a,2022-11-11 00:15:11,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int a[3],i=0;\n    while(int i<3)\n    scanf(\""%d\"",&a[i]);\n    \n    printf(\""%d\"",a[0]+a[1]-a[2]);\n    \n    \n}",COMPILE_ERROR,0,0
1590739926776328192,d808f4cc3c70a696f5c416714e0998fe96743e5273bc07a26f75738d12d304f5,2022-11-11 00:15:27,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,count;\n    scanf(\""%d\"",&n);\n    for(int i=2;i<=n;i++)\n    {\n        for (int j = 2; j <= (int)sqrt(i); j++)\n        {\n            if (i%j==0)\n            {\n                break;\n            }\n            \n        }\n        count++;\n        \n    }\n    printf(\""%d\"",count);\n    \n}\n",WRONG_ANSWER,10,308
1590740002185719808,13616e85f216dd3844293b46f4b46105a0a2c458f7807a7b677858feb35cb63a,2022-11-11 00:15:45,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int a[3],i=0;\n    while(i>=3)\n    scanf(\""%d\"",&a[i]);\n    \n    printf(\""%d\"",a[0]+a[1]-a[2]);\n    \n    \n}",WRONG_ANSWER,3,320
1590740109845114880,f6233bf69e5717913375f818af07214d1d2de6df0cd3bcb24368fbde112d6d15,2022-11-11 00:16:11,Python,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"X, Y, Z = map(int, input().split())\nprint(X + Y - Z)\n",ACCEPTED,30,2752
1590740195178254336,13616e85f216dd3844293b46f4b46105a0a2c458f7807a7b677858feb35cb63a,2022-11-11 00:16:31,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int a[],i=0;\n    while(i>=3)\n    scanf(\""%d\"",&a[i]);\n    \n    printf(\""%d\"",a[0]+a[1]-a[2]);\n    \n    \n}",COMPILE_ERROR,0,0
1590740208419672064,1773d9c971942817d949c47973c4eb8c24531f728d5480dbf3b232e568926258,2022-11-11 00:16:34,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"print(\""2022\"")",ACCEPTED,16,2748
1590740257329426432,13616e85f216dd3844293b46f4b46105a0a2c458f7807a7b677858feb35cb63a,2022-11-11 00:16:46,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int a[2],i=0;\n    while(i>=3)\n    scanf(\""%d\"",&a[i]);\n    \n    printf(\""%d\"",a[0]+a[1]-a[2]);\n    \n    \n}",WRONG_ANSWER,3,324
1590740277621469184,c358160a3e618a44cd693944fe10043e6372f46bf7d517c3c3f583bd85b17c5e,2022-11-11 00:16:51,Python,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"a,b,c = map(int,input().split())\nd=a+b-c\nprint(d)\n\n",ACCEPTED,30,2756
1590740371930394624,17759f531671f838bf3fae4270190e93b6109026f9503f986c1ed85bb412007d,2022-11-11 00:17:13,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,n,a[1000];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        printf(\""6\\n\"");\n}",WRONG_ANSWER,9,640
1590740476834152448,17759f531671f838bf3fae4270190e93b6109026f9503f986c1ed85bb412007d,2022-11-11 00:17:38,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,n,a[1000];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        printf(\""6\\n\"");\n}",WRONG_ANSWER,15,344
1590740687673405440,13616e85f216dd3844293b46f4b46105a0a2c458f7807a7b677858feb35cb63a,2022-11-11 00:18:29,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int a[2],i=0;\n    while(i>=3)\n    scanf(\""%d\"",a[i]);\n    \n    printf(\""%d\"",a[0]+a[1]-a[2]);\n    \n    \n}",WRONG_ANSWER,4,180
1590740689032384512,c47b15e117166a3dd00078b9f795673d5284a2761e582479119229751cc734d3,2022-11-11 00:18:29,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <time.h>\n\nint main(int argc, char *argv[]) {\n    char len[20] = {0};\n\n    time_t timep;\n    time(&timep);\n\n    struct tm *p;\n    p = gmtime(&timep);\n\n    snprintf(len, 20, \""%d\"", 1900 + p->tm_year);\n\n    printf(\""\\n%s\\n\"", len);\n    return 0;\n}\n",ACCEPTED,3,192
1590740798101041152,864c0dc14d6d917707294bc7e18ea53a2c0536c5d47f3d25f94f0188f106014f,2022-11-11 00:18:55,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint sushu(int x)\n{\n    int i;\n    for(i=2;i<x;i++)\n    {\n       if(x%i==0) break;\n    }\n    if(i==x) return 1;\n    else return 0;\n\n}\n\n  int main(){\n      int n,i;\n      int count=0;\n      scanf(\""%d\"",&n);\n      for(i=1;i<=n;i++){\n        if(sushu(i))\n        count++;\n      }\n      printf(\""%d\"",count);\n      return 0;\n  }",TIME_LIMIT_EXCEEDED,400,180
1590740823774396416,acf80eea856463058b81f71c0238069795893092293fbd098cc594959df6444e,2022-11-11 00:19:01,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,X=int(X),NON_ZERO_EXIT_CODE,16,2876
1590740866375942144,acf80eea856463058b81f71c0238069795893092293fbd098cc594959df6444e,2022-11-11 00:19:11,Python,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"X,Y,Z=map(int,input().split())\na=X+Y-Z\nprint(a)",ACCEPTED,30,2888
1590740929462448128,1773d9c971942817d949c47973c4eb8c24531f728d5480dbf3b232e568926258,2022-11-11 00:19:26,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main(){\n    int X,Y,Z;\n    scanf(\""X,Y,Z\"",&X,&y,&Z);\n    printf(\""%d\"",X+Y-Z);\n}",COMPILE_ERROR,0,0
1590741191874883584,1773d9c971942817d949c47973c4eb8c24531f728d5480dbf3b232e568926258,2022-11-11 00:20:29,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main(){\n    int X,Y,Z,count=0;\n    scanf(\""%d %d %d\"",&X,&y,&Z);\n    count=X+Y-Z;\n    printf(\""%d\"",count);\n}",COMPILE_ERROR,0,0
1590741337002016768,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-11 00:21:03,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<math.h>\n#include <stdio.h>\nint main()\n{\n    int n,i,a,t,temp;\n    scanf(\""%d\"",&t);\n    for(i=1;i<=t;i++)\n    {\n     scanf(\""%d\"",&n);\n     temp=pow(6,n);\n     a=temp%10;\n     if(i<t)\n      printf(\""%d\\n\"",a);\n     else\n      printf(\""%d\"",a);\n    }\n    return 0;\n}\n",WRONG_ANSWER,11,492
1590741611124948992,864c0dc14d6d917707294bc7e18ea53a2c0536c5d47f3d25f94f0188f106014f,2022-11-11 00:22:09,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include<math.h>\n\nint sushu(int x)\n{\n    int i;\n    int k;\n    k=(int)sqrt((double)x);\n    for(i=2;i<=k;i++)\n    {\n       if(x%i==0) break;\n    }\n    if(i>k) return 1;\n    else return 0;\n\n}\n\n  int main(){\n      int n,i;\n      int count=0;\n      scanf(\""%d\"",&n);\n      for(i=1;i<=n;i++){\n        if(sushu(i))\n        count++;\n      }\n      printf(\""%d\"",count);\n      return 0;\n  }\n",WRONG_ANSWER,10,316
1590741871251468288,1773d9c971942817d949c47973c4eb8c24531f728d5480dbf3b232e568926258,2022-11-11 00:23:11,Java,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"class Main{\n    public static void Main(String[] args){\n    int X,Y,Z;\n    int Sum = X + Y - Z;\n    System.out.println(Sum);\n    }\n}",COMPILE_ERROR,0,0
1590742150411784192,1773d9c971942817d949c47973c4eb8c24531f728d5480dbf3b232e568926258,2022-11-11 00:24:17,Java,0.0,1590524835191705600,1572865591226855424,1049226928954454016,class Main{\n    public static void Main(String[] args){\n    int X;\n    int Y;\n    int Z;\n    int Sum = X + Y - Z;\n    System.out.println(Sum);\n    }\n},COMPILE_ERROR,0,0
1590742576100081665,c358160a3e618a44cd693944fe10043e6372f46bf7d517c3c3f583bd85b17c5e,2022-11-11 00:25:59,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"b = int(input())\nc = []\nfor num in range(1,b+1):\n    if num>1:\n        for i in range(2,num):\n            if (num%i)==0:\n                break\n        else:\n            c.append(num)\nprint(len(c))\n",TIME_LIMIT_EXCEEDED,400,2888
1590742906737065984,59415347d1cfa3163c0a25f108652369803ee9c4d72f5c59e4212aabab93e388,2022-11-11 00:27:18,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,print(2022),ACCEPTED,16,2764
1590743041898491904,d9e00d995e65b04cda3ddef6baec19225e4351002ab4efa981f62d78919a481b,2022-11-11 00:27:50,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    double i,m;\n    int n;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%lf\"",&m);\n        printf(\""%d\\n\"",(int)pow(6,m)%10);\n    }\n    return 0;\n}",WRONG_ANSWER,8,472
1590743069501206528,17759f531671f838bf3fae4270190e93b6109026f9503f986c1ed85bb412007d,2022-11-11 00:27:57,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,i,j,a=1;\n    scanf(\""%d\"",&n);\n    for(i=3;i<=n;i++)\n    {\n        for(j=2;j<=sqrt(i);j++)\n            if(i%j==0)\n                break;\n        if(j>sqrt(i))\n            a++;\n    }\n    printf(\""%d\"",a);\n}",ACCEPTED,13,192
1590743090862796800,1773d9c971942817d949c47973c4eb8c24531f728d5480dbf3b232e568926258,2022-11-11 00:28:02,Java,0.0,1590524835191705600,1572865591226855424,1049226928954454016,import java.util.*;\nclass Main{\n    public static void Main(String[] args){\n    Scanner sc = new Scanner(System.in);\n    int X = sc.nextInt();\n    int Y = sc.nextInt();\n    int Z = sc.nextInt();\n    int Sum = X + Y - Z;\n    System.out.println(Sum);\n    }\n},NON_ZERO_EXIT_CODE,84,18108
1590743326075191296,0354b067c4132d4425a90b77482ac717447702274cb7db1282edce56eaf037b3,2022-11-11 00:28:58,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,3,320
1590743643747581952,864c0dc14d6d917707294bc7e18ea53a2c0536c5d47f3d25f94f0188f106014f,2022-11-11 00:30:13,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include<math.h>\n\nint sushu(int x)\n{\n    int i;\n    if(x%2==0) return 0;\n    for(i=3;i<=sqrt(x);i=i+2)\n    {\n       if(x%i==0) return 0;\n    }\n     return 1;\n\n}\n\n  int main(){\n      int n,i;\n      int count=0;\n      scanf(\""%d\"",&n);\n      for(i=1;i<=n;i++){\n        if(sushu(i))\n        count++;\n      }\n      printf(\""%d\"",count);\n      return 0;\n  }",ACCEPTED,12,476
1590743738912124928,0354b067c4132d4425a90b77482ac717447702274cb7db1282edce56eaf037b3,2022-11-11 00:30:36,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n    return 0;\n}",ACCEPTED,4,196
1590743815655325696,0c2907a154c1c61744366e94f73ae426665222ffae8eff7042dd0fd7bd8760fb,2022-11-11 00:30:54,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"# include <stdio.h>\nprintf(\""2022\"");",COMPILE_ERROR,0,0
1590743821409914880,1773d9c971942817d949c47973c4eb8c24531f728d5480dbf3b232e568926258,2022-11-11 00:30:56,Java,300.0,1590524835191705600,1572865591226855424,1049226928954454016,import java.util.*;\nclass Main{\n    public static void main(String[] args){\n    Scanner sc = new Scanner(System.in);\n    int X = sc.nextInt();\n    int Y = sc.nextInt();\n    int Z = sc.nextInt();\n    int Sum = X + Y - Z;\n    System.out.println(Sum);\n    }\n},ACCEPTED,221,19348
1590743873939353600,17759f531671f838bf3fae4270190e93b6109026f9503f986c1ed85bb412007d,2022-11-11 00:31:08,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,n,a[30000];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        printf(\""6\\n\"");\n}",WRONG_ANSWER,12,344
1590743954482573312,0c2907a154c1c61744366e94f73ae426665222ffae8eff7042dd0fd7bd8760fb,2022-11-11 00:31:28,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"# include <stdio.h>\nint main()\n\n3. {printf(\""2022\"");\n  return 0;}",COMPILE_ERROR,0,0
1590744043972243456,17759f531671f838bf3fae4270190e93b6109026f9503f986c1ed85bb412007d,2022-11-11 00:31:49,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,n,a[30000];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n-1;i++)\n        printf(\""6\\n\"");\n    printf(\""6\"");\n}",WRONG_ANSWER,10,340
1590744057029132288,d808f4cc3c70a696f5c416714e0998fe96743e5273bc07a26f75738d12d304f5,2022-11-11 00:31:52,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,count,a;\n    scanf(\""%d\"",&n);\n    for(int i=2;i<=n;i++)\n    {\n        for (int j = 2; j <i; j++)\n        {\n            a=0;\n            if (i%j==0)\n            {\n                a=1;\n                break;\n            }\n            \n        }\n        if (a=0)\n        {\n            count++;\n        }  \n    }\n    printf(\""%d\"",count);\n    \n}\n",WRONG_ANSWER,3,180
1590744131641585664,0c2907a154c1c61744366e94f73ae426665222ffae8eff7042dd0fd7bd8760fb,2022-11-11 00:32:10,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"# include <stdio.h>\nint main()\n\n {printf(\""2022\"");\n  return 0;}",ACCEPTED,3,316
1590744390828625920,129ddfe9d2d4553f365faf2fdc5e2f0c271b2e342a4cff13802dda8ef8b3d1c2,2022-11-11 00:33:12,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int n = s.nextInt();\n        int a = s.nextInt();\n        int b = s.nextInt();\n        int c = s.nextInt();\n        for (int i=0; i< n; i++) {\n            if(i == n - 1){\n                System.out.print(6);\n            }else{\n                System.out.println(6);\n            }\n        }\n    }\n},TIME_LIMIT_EXCEEDED,50,12992
1590744400446140416,c358160a3e618a44cd693944fe10043e6372f46bf7d517c3c3f583bd85b17c5e,2022-11-11 00:33:14,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"b = int(input())\nc = []\nfor num in range(1,b+1):\n    for i in range(2,num):\n        if (num%i)==0:\n            break\n    else:\n            c.append(num)\nprint(len(c)-1)\n",TIME_LIMIT_EXCEEDED,400,3264
1590745678320570368,06b00897262b024d9e66dcd771cf81de9b63954f7a4554699d17c2158114c0d1,2022-11-11 00:38:18,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner in = new Scanner(System.in);\n        int n=in.nextInt();\n        int arr[]=new int[n+1];\n        int a[]=new int[n];\n        int x=1;\n        for(int o=1;o<=n;o++){\n            arr[o]=in.nextInt();\n        }\n        for(int i=0;i<n;i++){\n            for(int j=1;j<=arr[i+1];j++){\n                a[i]=x*6;\n                x=a[i];\n            }\n            x=1;\n        }\n        int b;\n        for(int k=0;k<n;k++){\n            b=a[k]%10;\n            System.out.println(b);\n        }\n        \n    }\n},TIME_LIMIT_EXCEEDED,50,15108
1590745788769177600,c358160a3e618a44cd693944fe10043e6372f46bf7d517c3c3f583bd85b17c5e,2022-11-11 00:38:45,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"b = int(input())\na=0\nfor num in range(1,b+1):\n    for i in range(2,num):\n        if (num%i)==0:\n            a+=1\n            break\n        \nprint(b-a-1)\n\n",TIME_LIMIT_EXCEEDED,400,2748
1590745830724775936,c358160a3e618a44cd693944fe10043e6372f46bf7d517c3c3f583bd85b17c5e,2022-11-11 00:38:55,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"b = int(input())\na=0\nfor num in range(1,b+1):\n    for i in range(2,num):\n        if (num%i)==0:\n            a+=1\n            break   \nprint(b-a-1)\n\n",TIME_LIMIT_EXCEEDED,400,2748
1590746124678377472,06b00897262b024d9e66dcd771cf81de9b63954f7a4554699d17c2158114c0d1,2022-11-11 00:40:05,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner in = new Scanner(System.in);\n        int n=in.nextInt();\n        int arr[]=new int[n+1];\n        int a[]=new int[n];\n        int x=1;\n        for(int o=1;o<=n;o++){\n            arr[o]=in.nextInt();\n        }\n        for(int i=0;i<n;i++){\n            for(int j=1;j<=arr[i+1];j++){\n                a[i]=x*6;\n                x=a[i];\n            }\n            x=1;\n        }\n        int b;\n        for(int k=0;k<n;k++){\n            b=a[k]%10;\n            if(k<n-1){\n                System.out.println(b);\n            }else{\n                System.out.print(b);\n            }\n            \n        }\n        \n    }\n},TIME_LIMIT_EXCEEDED,50,14100
1590746234816626688,59415347d1cfa3163c0a25f108652369803ee9c4d72f5c59e4212aabab93e388,2022-11-11 00:40:31,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(x+y-z);\n    return 0;\n}",SEGMENTATION_FAULT,3,444
1590746295273304064,d9e00d995e65b04cda3ddef6baec19225e4351002ab4efa981f62d78919a481b,2022-11-11 00:40:46,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int i,j;\n    int n;\n    int num=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<n;i++){\n        int f=1;\n        for(j=2;j<=sqrt(i);j++)\n            if(i%j==0) f=0;\n        if(f==1) num++;\n    }\n    printf(\""%d\"",num);\n}",ACCEPTED,57,476
1590746358586322944,06b00897262b024d9e66dcd771cf81de9b63954f7a4554699d17c2158114c0d1,2022-11-11 00:41:01,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner in = new Scanner(System.in);\n        int n=in.nextInt();\n        int arr[]=new int[n+1];\n        int a[]=new int[n];\n        int x=1;\n        for(int o=1;o<=n;o++){\n            arr[o]=in.nextInt();\n        }\n        for(int i=0;i<n;i++){\n            for(int j=1;j<=arr[i+1];j++){\n                a[i]=x*6;\n                x=a[i];\n            }\n            x=1;\n        }\n        int b;\n        for(int k=0;k<n;k++){\n            b=a[k]%10;\n            if(k<n-1){\n                System.out.println(b);\n            }else{\n                System.out.print(b);\n            }\n            \n        }\n        return 0;\n    }\n},COMPILE_ERROR,0,0
1590746419709939712,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-11 00:41:15,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<math.h>\n#include <stdio.h>\nint main()\n{\n    int n,i,j,temp=0;\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++)\n    {\n     for(j=2;j<=i;j++)\n    {\n     if(i%j==0)\n      break;\n    }\n    if(j==i)\n     temp++;\n    }\n    printf(\""%d\"",temp);\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,400,200
1590746493689049088,1773d9c971942817d949c47973c4eb8c24531f728d5480dbf3b232e568926258,2022-11-11 00:41:33,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.*;\nimport java.lang.Math;\nmain class{\n    public static void main(String[] args){\n        Scanner sc = new Scanner(System.in);\n        int num = sc.nextInt();\n        for(int i=0;i<num;i++){\n            int x = sc.nextInt();\n            int y = Math(6,x);\n            int z=y%10;\n            System.out.println(z);\n        }\n    }\n}",COMPILE_ERROR,0,0
1590746626904338432,17759f531671f838bf3fae4270190e93b6109026f9503f986c1ed85bb412007d,2022-11-11 00:42:05,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,n,a[10000],b[10000],c[10000],d[10000],max;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n        c[i]=b[i]-a[i];\n    d[0]=c[0];\n    for(i=1;i<n;i++)\n        d[i]=d[i-1]+c[i];\n    max=d[0];\n    for(i=1;i<n;i++)\n    {\n        if(max<d[i])\n            max=d[i];\n    }\n    printf(\""%d\"",max);\n}",WRONG_ANSWER,3,196
1590746702900957184,1773d9c971942817d949c47973c4eb8c24531f728d5480dbf3b232e568926258,2022-11-11 00:42:23,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.*;\nimport java.lang.Math;\nclass Main{\n    public static void main(String[] args){\n        Scanner sc = new Scanner(System.in);\n        int num = sc.nextInt();\n        for(int i=0;i<num;i++){\n            int x = sc.nextInt();\n            int y = Math(6,x);\n            int z=y%10;\n            System.out.println(z);\n        }\n    }\n}",COMPILE_ERROR,0,0
1590746829870923776,0c2907a154c1c61744366e94f73ae426665222ffae8eff7042dd0fd7bd8760fb,2022-11-11 00:42:53,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"\nimport java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc=new Scanner(System.in);\n       Integer it= sc.nextInt();\n       int count=0;\n            int a,i,j;\n            for(i=2;i<=it;i++)\n            {\n                for(j=2;j<=i;j++)\n                    if(i%j==0)\n                        break;\n                if(i==j)\n                    count++;\n            }\n        System.out.println(count);\n        }\n\n\n    }\n\n",TIME_LIMIT_EXCEEDED,400,16916
1590746852717277184,1773d9c971942817d949c47973c4eb8c24531f728d5480dbf3b232e568926258,2022-11-11 00:42:58,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.*;\nimport java.lang.Math;\nclass Main{\n    public static void main(String[] args){\n        Scanner sc = new Scanner(System.in);\n        int num = sc.nextInt();\n        for(int i=0;i<num;i++){\n            int x = sc.nextInt();\n            int y = Math.pow(6,x);\n            int z=y%10;\n            System.out.println(z);\n        }\n    }\n}",COMPILE_ERROR,0,0
1590746887534215168,0c2907a154c1c61744366e94f73ae426665222ffae8eff7042dd0fd7bd8760fb,2022-11-11 00:43:07,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"\nimport java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc=new Scanner(System.in);\n       Integer it= sc.nextInt();\n       int count=0;\n            int a,i,j;\n            for(i=2;i<=it;i++)\n            {\n                for(j=2;j<=i;j++)\n                    if(i%j==0)\n                        break;\n                if(i==j)\n                    count++;\n            }\n        System.out.println(count);\n        }\n\n\n    }\n\n",TIME_LIMIT_EXCEEDED,400,16852
1590746966189998080,cf40d28790a881d201bf0dd4e1fc1488383e8bfca669ada1909cf2ca7ae62300,2022-11-11 00:43:26,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"public class year {\n    public static void main(String[] args) {\n        System.out.println(\""2022\"");\n    }\n}",COMPILE_ERROR,0,0
1590747263905894400,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-11 00:44:37,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main()\n{int X,Y,Z;\nscanf(\""%d %d %d\"",&X,&Y,&Z);\nif(X>=0&&Y>=0&&Z>=0&&X<=100&&Y<=100&&Z<=100)\n{\n    printf(\""%d\\n\"",X+Y-Z);\n}\nreturn 0;\n}\n",ACCEPTED,4,312
1590747347657756672,06b00897262b024d9e66dcd771cf81de9b63954f7a4554699d17c2158114c0d1,2022-11-11 00:44:56,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner in = new Scanner(System.in);\n        int n=in.nextInt();\n        int arr[]=new int[n+1];\n        int a[]=new int[n];\n        int x=1;\n        for(int o=1;o<=n;o++){\n            arr[o]=in.nextInt();\n        }\n        for(int i=0;i<n;i++){\n            for(int j=1;j<=arr[i+1];j++){\n                a[i]=x*6;\n                x=a[i];\n            }\n            x=1;\n        }\n        for(int k=0;k<n;k++){\n            if(k<n-1){\n                System.out.println(a[k]%10);\n            }else{\n                System.out.print(a[k]%10);\n            }\n        }\n    }\n},TIME_LIMIT_EXCEEDED,50,14120
1590747372685168640,17759f531671f838bf3fae4270190e93b6109026f9503f986c1ed85bb412007d,2022-11-11 00:45:02,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,n,a[400000];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n-1;i++)\n        printf(\""6\\n\"");\n    printf(\""6\"");\n}",WRONG_ANSWER,10,468
1590747395372154880,05fd79145678de5c06012db9db4333bebf8365a74fe442d12a54a9da3782fdca,2022-11-11 00:45:08,C++,300.0,1590734963702620160,1590734503495200768,1049226928954454016,#include<iostream>\nusing namespace std;\nint main(){\n    int max=0;\n    int all=0;\n    int a[1000];\n    int b[1000];\n    int n;\n    cin>>n;\n    for(int i=0;i<n;i++) cin>>a[i];\n    for(int i=0;i<n;i++) cin>>b[i];\n    for(int i=0;i<n;i++){\n        all+=b[i]-a[i];\n        if(all<0) all=0;\n        if(max<all) max=all;\n    }\n    cout<<max;\n},ACCEPTED,3,452
1590747398949896192,1773d9c971942817d949c47973c4eb8c24531f728d5480dbf3b232e568926258,2022-11-11 00:45:09,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.*;\nimport java.lang.Math;\nclass Main{\n    public static void main(String[] args){\n        Scanner sc = new Scanner(System.in);\n        int num = sc.nextInt();\n        for(int i=0;i<num;i++){\n            int x = sc.nextInt();\n            int y = (int) Math.pow(6,x);\n            int z=y%10;\n            System.out.println(z);\n        }\n    }\n}",TIME_LIMIT_EXCEEDED,50,14104
1590747434727309312,0c2907a154c1c61744366e94f73ae426665222ffae8eff7042dd0fd7bd8760fb,2022-11-11 00:45:17,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n        main()\n        {\n        int a,i,j;\n        int count=0;\n        scanf(\""%d\"",&a);\n        for(i=2;i<=a;i++)\n        {\n        for(j=2;j<=i;j++)\n        if(i%j==0)\n        break;\n        if(i==j)\n            count++;\n       \n        }\n        printf(\""%d\"",count);\n        }\n\n",TIME_LIMIT_EXCEEDED,400,308
1590747506739294208,0c2907a154c1c61744366e94f73ae426665222ffae8eff7042dd0fd7bd8760fb,2022-11-11 00:45:34,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n        int main()\n        {\n        int a,i,j;\n        int count=0;\n        scanf(\""%d\"",&a);\n        for(i=2;i<=a;i++)\n        {\n        for(j=2;j<=i;j++)\n        if(i%j==0)\n        break;\n        if(i==j)\n            count++;\n\n        }\n        printf(\""%d\"",count);\n        }\n\n",TIME_LIMIT_EXCEEDED,400,312
1590747590482788352,d808f4cc3c70a696f5c416714e0998fe96743e5273bc07a26f75738d12d304f5,2022-11-11 00:45:54,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"import java.util.Scanner;\n\npublic class test {\n    public static void main(String[] args) {\n        int n,count=0,a=0;\n        Scanner sc=new Scanner(System.in);\n        n= sc.nextInt();\n        for(int i=2;i<=n;i++)\n        {\n            for (int j = 2; j <i; j++)\n            {\n                a=0;\n                if (i%j==0)\n                {\n                    a=1;\n                    break;\n                }\n\n            }\n            if (a==0)\n            {\n                count++;\n            }\n        }\n        System.out.println(count);\n    }\n}\n",COMPILE_ERROR,0,0
1590747608975474688,1773d9c971942817d949c47973c4eb8c24531f728d5480dbf3b232e568926258,2022-11-11 00:45:59,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.*;\nimport java.lang.Math;\nclass Main{\n    public static void main(String[] args){\n        Scanner sc = new Scanner(System.in);\n        int num = sc.nextInt();\n        for(int i=0;i<num;i++){\n            int x = sc.nextInt();\n            int y = (int) Math.pow(6,x);\n            int z=y%10;\n            System.out.println(z);\n        }\n    }\n}",TIME_LIMIT_EXCEEDED,50,13856
1590747868753887232,06b00897262b024d9e66dcd771cf81de9b63954f7a4554699d17c2158114c0d1,2022-11-11 00:47:01,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner in = new Scanner(System.in);\n        int n=in.nextInt();\n        int n1=n+1;\n        int arr[]=new int[n1];\n        int a[]=new int[n1];\n        int x=1;\n        for(int o=1;o<=n;o++){\n            arr[o]=in.nextInt();\n        }\n        for(int i=0;i<n;i++){\n            for(int j=1;j<=arr[i+1];j++){\n                a[i]=x*6;\n                x=a[i];\n            }\n            x=1;\n        }\n        for(int k=0;k<n;k++){\n            if(k<n-1){\n                System.out.println(a[k]%10);\n            }else{\n                System.out.print(a[k]%10);\n            }\n        }\n    }\n},TIME_LIMIT_EXCEEDED,50,14184
1590747874281984000,d808f4cc3c70a696f5c416714e0998fe96743e5273bc07a26f75738d12d304f5,2022-11-11 00:47:02,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        int n,count=0,a=0;\n        Scanner sc=new Scanner(System.in);\n        n= sc.nextInt();\n        for(int i=2;i<=n;i++)\n        {\n            for (int j = 2; j <i; j++)\n            {\n                a=0;\n                if (i%j==0)\n                {\n                    a=1;\n                    break;\n                }\n\n            }\n            if (a==0)\n            {\n                count++;\n            }\n        }\n        System.out.println(count);\n    }\n}\n",TIME_LIMIT_EXCEEDED,400,19496
1590748242223083520,c358160a3e618a44cd693944fe10043e6372f46bf7d517c3c3f583bd85b17c5e,2022-11-11 00:48:30,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"n= int(input())\na=0\nfor num in range(1,n+1):\n    for i in range(2,num):\n        if (num%i)==0:\n            a+=1\n            break   \nprint(b-a-1)\n\n",COMPILE_ERROR,0,0
1590748253925216256,f6233bf69e5717913375f818af07214d1d2de6df0cd3bcb24368fbde112d6d15,2022-11-11 00:48:33,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"num = []\na = eval(input())\ncount = 0\nfor i in range(1, a + 1):\n    for j in range(2, i):\n        if i % j == 0:\n            break\n    else:\n        num.append(i)\n        count += 1\nprint(count - 1)\n",TIME_LIMIT_EXCEEDED,400,2876
1590748296904249344,d808f4cc3c70a696f5c416714e0998fe96743e5273bc07a26f75738d12d304f5,2022-11-11 00:48:43,Java,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"import java.util.Scanner;\n\nimport static java.lang.Math.sqrt;\n\npublic class Main {\n    public static void main(String[] args) {\n        int n,count=0,a=0;\n        Scanner sc=new Scanner(System.in);\n        n= sc.nextInt();\n        for(int i=2;i<=n;i++)\n        {\n            for (int j = 2; j <=(int)sqrt(i); j++)\n            {\n                a=0;\n                if (i%j==0)\n                {\n                    a=1;\n                    break;\n                }\n\n            }\n            if (a==0)\n            {\n                count++;\n            }\n        }\n        System.out.println(count);\n    }\n}\n",ACCEPTED,259,16644
1590748472742051840,c358160a3e618a44cd693944fe10043e6372f46bf7d517c3c3f583bd85b17c5e,2022-11-11 00:49:25,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"n= int(input())\na=0\nfor num in range(1,n+1):\n    for i in range(2,num):\n        if (num%i)==0:\n            a+=1\n            break   \nprint(n-a-1)\n\n",TIME_LIMIT_EXCEEDED,400,2744
1590748489460547584,f6233bf69e5717913375f818af07214d1d2de6df0cd3bcb24368fbde112d6d15,2022-11-11 00:49:29,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"num = []\na = eval(input())\ncount = 0\nfor i in range(1, a + 1):\n    for j in range(2, i):\n        if i % j == 0:\n            break\n    else:\n        num.append(i)\n        count += 1\nprint(count - 1)\n",TIME_LIMIT_EXCEEDED,400,2752
1590748501749837824,864c0dc14d6d917707294bc7e18ea53a2c0536c5d47f3d25f94f0188f106014f,2022-11-11 00:49:32,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main(){\n    int t,i,j,x;\n    int a[100];\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    int s=1;\n    for(i=0;i<t;i++){\n        for(j=0;j<a[i];j++){\n            s=s*6;\n        }\n         x=s%10;\n        printf(\""%d\\n\"",x);\n    }\n    return 0;\n}\n",WRONG_ANSWER,6,348
1590748639180427264,06b00897262b024d9e66dcd771cf81de9b63954f7a4554699d17c2158114c0d1,2022-11-11 00:50:04,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner in = new Scanner(System.in);\n        int n=in.nextInt();\n        int n1=n+1;\n        int arr[]=new int[n1];\n        int a[]=new int[n1];\n        int x=1;\n        for(int o=1;o<=n;o++){\n            arr[o]=in.nextInt();\n        }\n        for(int i=0;i<n;i++){\n            int b=i+1;\n            for(int j=1;j<=arr[b];j++){\n                a[i]=x*6;\n                x=a[i];\n            }\n            x=1;\n        }\n        for(int k=0;k<n;k++){\n            if(k<n-1){\n                System.out.println(a[k]%10);\n            }else{\n                System.out.print(a[k]%10);\n            }\n        }\n    }\n},TIME_LIMIT_EXCEEDED,50,17320
1590748660294529024,17759f531671f838bf3fae4270190e93b6109026f9503f986c1ed85bb412007d,2022-11-11 00:50:09,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,n,a[2094269];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n-1;i++)\n        printf(\""6\\n\"");\n    printf(\""6\"");\n}",TIME_LIMIT_EXCEEDED,3,476
1590748839416496128,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-11 00:50:52,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main()\n{int i,j,a;\nscanf(\""%d\"",&i);\nfor(j=0;j<i;j++)\n{\n    scanf(\""%d\"",&a);\n    printf(\""6\\n\"");\n}\nreturn 0;\n}\n",WRONG_ANSWER,12,332
1590748910505758720,1773d9c971942817d949c47973c4eb8c24531f728d5480dbf3b232e568926258,2022-11-11 00:51:09,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.*;\nimport java.lang.Math;\nclass Main{\n    public static void main(String[] args){\n        Scanner sc = new Scanner(System.in);\n        int num = sc.nextInt();\n        for(int i=0;i<num;i++){\n            int x = sc.nextInt();\n            int y = (int) Math.pow(6,x);\n            int z = y % 10;\n            System.out.println(z);\n        }\n    }\n}",TIME_LIMIT_EXCEEDED,50,16124
1590749043054153728,17759f531671f838bf3fae4270190e93b6109026f9503f986c1ed85bb412007d,2022-11-11 00:51:41,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,n,a[32767];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n-1;i++)\n        printf(\""6\\n\"");\n    printf(\""6\"");\n}",WRONG_ANSWER,10,344
1590749571385438208,59415347d1cfa3163c0a25f108652369803ee9c4d72f5c59e4212aabab93e388,2022-11-11 00:53:47,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,x = input()\ny = input()\nz = input()\nsum = int(x) + int(y) + int (z)\nprint(sum),NON_ZERO_EXIT_CODE,18,2816
1590749649135271936,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-11 00:54:05,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main()\n{int i,j,a;\nscanf(\""%d\"",&i);\nfor(j=0;j<i;j++)\n{\n    scanf(\""%d\"",&a);\n    printf(\""6\"");\n    if(j<i-1) printf(\""\\n\"");\n}\nreturn 0;\n}\n",WRONG_ANSWER,12,344
1590749744475996160,59415347d1cfa3163c0a25f108652369803ee9c4d72f5c59e4212aabab93e388,2022-11-11 00:54:28,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,x = input()\ny = input()\nz = input()\nsum = int(x) + int(y) - int (z)\nprint(sum),NON_ZERO_EXIT_CODE,15,2752
1590749868337987584,59415347d1cfa3163c0a25f108652369803ee9c4d72f5c59e4212aabab93e388,2022-11-11 00:54:57,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,x = input()\ny = input()\nz = input()\nsum = int(x) + int(y) - int (z)\nprint(sum),NON_ZERO_EXIT_CODE,15,2896
1590749924193533952,f6233bf69e5717913375f818af07214d1d2de6df0cd3bcb24368fbde112d6d15,2022-11-11 00:55:11,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"num = []\na = eval(input())\ncount = 0\nfor i in range(1, a ):\n    for j in range(2, i):\n        if i % j == 0:\n            break\n    else:\n        num.append(i)\n        count += 1\nprint(count - 1)\n",TIME_LIMIT_EXCEEDED,400,3236
1590750215957712896,cf40d28790a881d201bf0dd4e1fc1488383e8bfca669ada1909cf2ca7ae62300,2022-11-11 00:56:20,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"class test {\n    public String year() {\n        return \""2022\"";\n    }\n}",COMPILE_ERROR,0,0
1590750252242636800,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-11 00:56:29,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<math.h>\n#include <stdio.h>\nint main()\n{\n    int n,i=2,j,temp=0;\n    scanf(\""%d\"",&n);\n     for(j=2;j<=i;j++)\n     {\n       if(i>n)\n        break;\n      if(i%j==0&&j==i)\n      {\n       ++temp;\n       j=2;\n       i++;\n      }\n      else if(i%j==0)\n      {\n       i++;\n       j=2;\n      }\n     }\n    printf(\""%d\"",temp);\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,400,188
1590750335331774464,70c675ddfcb60b2192bc8ac38fb068fec0500208a5bf97a796c7cc074b43cf87,2022-11-11 00:56:49,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"print(\""2022\"")",ACCEPTED,15,2884
1590750599002501120,17759f531671f838bf3fae4270190e93b6109026f9503f986c1ed85bb412007d,2022-11-11 00:57:52,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,n,a[32767];\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]==0)\n            printf(\""1\\n\"");\n        else\n            printf(\""6\\n\"");\n    }\n}",ACCEPTED,12,492
1590750637384577024,59415347d1cfa3163c0a25f108652369803ee9c4d72f5c59e4212aabab93e388,2022-11-11 00:58:01,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main(){\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    int sum = x+y-z;\n    print(sum);\n    return 0;\n}",NON_ZERO_EXIT_CODE,14,2748
1590750655080366080,d808f4cc3c70a696f5c416714e0998fe96743e5273bc07a26f75738d12d304f5,2022-11-11 00:58:05,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc=new Scanner(System.in);\n        int t= sc.nextInt();\n        for (int i=0;i<t;i++){\n            int n= sc.nextInt();\n            System.out.println(\""6\"");\n        }\n    }\n}",TIME_LIMIT_EXCEEDED,50,16732
1590750690870341632,59415347d1cfa3163c0a25f108652369803ee9c4d72f5c59e4212aabab93e388,2022-11-11 00:58:14,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main(){\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    int sum = x+y-z;\n    print(sum);\n    return 0;\n}",COMPILE_ERROR,0,0
1590750726769389568,70c675ddfcb60b2192bc8ac38fb068fec0500208a5bf97a796c7cc074b43cf87,2022-11-11 00:58:22,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,a = int(input())\nb = int(input())\nc = int(input())\nd = a+b-c\nprint(d),NON_ZERO_EXIT_CODE,15,2780
1590750901688664064,59415347d1cfa3163c0a25f108652369803ee9c4d72f5c59e4212aabab93e388,2022-11-11 00:59:04,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main(){\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    int sum = x+y-z;\n    printf(\""%d\"",sum);\n    return 0;\n}",ACCEPTED,6,188
1590751017514369024,0c2907a154c1c61744366e94f73ae426665222ffae8eff7042dd0fd7bd8760fb,2022-11-11 00:59:31,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        String it=sc.nextLine();\n        String[] s = it.split(\"" \"");\n        int a=Integer.valueOf(s[0]);\n        int b=Integer.valueOf(s[1]);\n        int c=Integer.valueOf(s[2]);\n        System.out.println(a+b-c);\n\n    }\n\n    }\n",TIME_LIMIT_EXCEEDED,50,14156
1590751066596114432,06b00897262b024d9e66dcd771cf81de9b63954f7a4554699d17c2158114c0d1,2022-11-11 00:59:43,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner in = new Scanner(System.in);\n        int n=in.nextInt();\n        int x=0,j;\n        for(int i=1;i<=n;i++){\n            for(j=2;j<n;j++){\n                if(i%j==0){\n                    break;\n                }\n            }\n            if(i==j){\n                x++;\n            }\n        }\n        System.out.println(x);\n    }\n}",TIME_LIMIT_EXCEEDED,400,17072
1590751080361820160,0c2907a154c1c61744366e94f73ae426665222ffae8eff7042dd0fd7bd8760fb,2022-11-11 00:59:46,Java,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        String it=sc.nextLine();\n        String[] s = it.split(\"" \"");\n        int a=Integer.valueOf(s[0]);\n        int b=Integer.valueOf(s[1]);\n        int c=Integer.valueOf(s[2]);\n        System.out.println(a+b-c);\n\n    }\n\n    }\n",ACCEPTED,219,19608
1590751125463175168,0c2907a154c1c61744366e94f73ae426665222ffae8eff7042dd0fd7bd8760fb,2022-11-11 00:59:57,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n        int main()\n        {\n        int a,i,j;\n        int count=0;\n        scanf(\""%d\"",&a);\n        for(i=2;i<=a;i++)\n        {\n        for(j=2;j<=i;j++)\n        if(i%j==0)\n        break;\n        if(i==j)\n            count++;\n\n        }\n        printf(\""%d\"",count);\n        }\n\n",COMPILE_ERROR,0,0
1590751126557863936,cf40d28790a881d201bf0dd4e1fc1488383e8bfca669ada1909cf2ca7ae62300,2022-11-11 00:59:57,Java,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"class Main {\n    public static void main(String[] args) {\n        System.out.println(\""2022\"");\n    }\n}",ACCEPTED,69,14232
1590751139681861632,0c2907a154c1c61744366e94f73ae426665222ffae8eff7042dd0fd7bd8760fb,2022-11-11 01:00:01,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n        int main()\n        {\n        int a,i,j;\n        int count=0;\n        scanf(\""%d\"",&a);\n        for(i=2;i<=a;i++)\n        {\n        for(j=2;j<=i;j++)\n        if(i%j==0)\n        break;\n        if(i==j)\n            count++;\n\n        }\n        printf(\""%d\"",count);\n        }\n\n",TIME_LIMIT_EXCEEDED,400,320
1590751178726637568,17759f531671f838bf3fae4270190e93b6109026f9503f986c1ed85bb412007d,2022-11-11 01:00:10,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,n,a[1000];\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]==0)\n            printf(\""1\\n\"");\n        else\n            printf(\""6\\n\"");\n    }\n}",ACCEPTED,13,348
1590751250176606208,d808f4cc3c70a696f5c416714e0998fe96743e5273bc07a26f75738d12d304f5,2022-11-11 01:00:27,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc=new Scanner(System.in);\n        int t= sc.nextInt();\n        for (int i=0;i<t;i++){\n            int n= sc.nextInt();\n            System.out.println(\""6\"");\n        }\n    }\n}",TIME_LIMIT_EXCEEDED,50,16628
1590751322616410112,1773d9c971942817d949c47973c4eb8c24531f728d5480dbf3b232e568926258,2022-11-11 01:00:44,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n \nint main(){\n    int x,y,z,i=0;\n    scanf(\""%d\"",&x);\n    for(i;i<x;i++){\n        scanf(\""%d\"",&y);\n        z= pow(6,y);\n        int num = z%10;\n        printf(\""%d\"",num);\n    }\n}",WRONG_ANSWER,8,436
1590751359366901760,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-11 01:00:53,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main()\n{int t,j,n;\nscanf(\""%d\"",&t);\n\nfor(j=0;j<t;j++)\n{\n    scanf(\""%d\"",&n);\n    if(n>=0&&n<=pow(10,9)) {\n    printf(\""6\"");\n    if(j<t-1) printf(\""\\n\"");\n}\n}\nreturn 0;\n}\n",WRONG_ANSWER,7,196
1590751618679771136,d808f4cc3c70a696f5c416714e0998fe96743e5273bc07a26f75738d12d304f5,2022-11-11 01:01:55,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc=new Scanner(System.in);\n        int t= sc.nextInt();\n        for (int i=0;i<t;i++){\n            int n= sc.nextLine();\n            System.out.println(\""6\"");\n        }\n    }\n}",COMPILE_ERROR,0,0
1590751708819554304,06b00897262b024d9e66dcd771cf81de9b63954f7a4554699d17c2158114c0d1,2022-11-11 01:02:16,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner in = new Scanner(System.in);\n        int n=in.nextInt();\n        int x=0,j;\n        for(int i=1;i<=n;i++){\n            for(j=2;j<n;j++){\n                if(i%j==0){\n                    break;\n                }\n            }\n            if(i==j){\n                x++;\n            }\n        }\n        System.out.println(x);\n    }\n}",TIME_LIMIT_EXCEEDED,400,19648
1590751794072977408,d808f4cc3c70a696f5c416714e0998fe96743e5273bc07a26f75738d12d304f5,2022-11-11 01:02:37,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc=new Scanner(System.in);\n        int t= sc.nextInt();\n        for (int i=0;i<t;i++){\n            int n= Integer.parseInt(sc.nextLine());\n            System.out.println(\""6\"");\n        }\n    }\n}",TIME_LIMIT_EXCEEDED,50,16612
1590751856438063104,129ddfe9d2d4553f365faf2fdc5e2f0c271b2e342a4cff13802dda8ef8b3d1c2,2022-11-11 01:02:51,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int[] a = new int[10];\n        int n = s.nextInt();\n        if(n>0){\n            for (int i=0; i< n; i++){\n                a[i] = s.nextInt();\n            }\n        }\n        for (int i=0; i< n; i++) {\n            if(i == n - 1){\n                System.out.print((int)(Math.pow(6,a[i])%10));\n            }else{\n                System.out.println((int)(Math.pow(6,a[i])%10));\n            }\n        }\n    }\n}",TIME_LIMIT_EXCEEDED,50,16904
1590752214916857856,c358160a3e618a44cd693944fe10043e6372f46bf7d517c3c3f583bd85b17c5e,2022-11-11 01:04:17,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nmain()\n{\n\tint a,i,j;\n\tscanf(\""%d\"",&a);\n\tfor(i=2;i<=a;i++)\n\t\t{\n\t\tfor(j=2;j<=i;j++)\n\t\t\tif(i%j==0)\n\t\t\t\tbreak;\n\t\tif(i==j)\n            x++;\n\t\t}\n    printf(x);\n}\n",COMPILE_ERROR,0,0
1590752323192795136,c358160a3e618a44cd693944fe10043e6372f46bf7d517c3c3f583bd85b17c5e,2022-11-11 01:04:43,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nmain()\n{\n\tint a,i,j;\n    int x=0;\n\tscanf(\""%d\"",&a);\n\tfor(i=2;i<=a;i++)\n\t\t{\n\t\tfor(j=2;j<=i;j++)\n\t\t\tif(i%j==0)\n\t\t\t\tbreak;\n\t\tif(i==j)\n            x++;\n\t\t}\n    printf(x);\n}\n",TIME_LIMIT_EXCEEDED,400,324
1590752357909073920,70c675ddfcb60b2192bc8ac38fb068fec0500208a5bf97a796c7cc074b43cf87,2022-11-11 01:04:51,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,import java.util.Scanner;\n\npublic class main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner myScanner = new Scanner(System.in);\n\t\tint x = myScanner.nextInt();\n\t\tint y = myScanner.nextInt();\n\t\tint z = myScanner.nextInt();\n\t\tint b = x+y-z;\n\t\tSystem.out.print(b);\n\t}\n\n},NON_ZERO_EXIT_CODE,15,2880
1590752393741012992,70c675ddfcb60b2192bc8ac38fb068fec0500208a5bf97a796c7cc074b43cf87,2022-11-11 01:05:00,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,import java.util.Scanner;\n\npublic class main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner myScanner = new Scanner(System.in);\n\t\tint x = myScanner.nextInt();\n\t\tint y = myScanner.nextInt();\n\t\tint z = myScanner.nextInt();\n\t\tint b = x+y-z;\n\t\tSystem.out.print(b);\n\t}\n\n},NON_ZERO_EXIT_CODE,18,2760
1590752415840796672,70c675ddfcb60b2192bc8ac38fb068fec0500208a5bf97a796c7cc074b43cf87,2022-11-11 01:05:05,Java,0.0,1590524835191705600,1572865591226855424,1049226928954454016,import java.util.Scanner;\n\npublic class main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner myScanner = new Scanner(System.in);\n\t\tint x = myScanner.nextInt();\n\t\tint y = myScanner.nextInt();\n\t\tint z = myScanner.nextInt();\n\t\tint b = x+y-z;\n\t\tSystem.out.print(b);\n\t}\n\n},COMPILE_ERROR,0,0
1590752472203853824,70c675ddfcb60b2192bc8ac38fb068fec0500208a5bf97a796c7cc074b43cf87,2022-11-11 01:05:18,Java,300.0,1590524835191705600,1572865591226855424,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner myScanner = new Scanner(System.in);\n\t\tint x = myScanner.nextInt();\n\t\tint y = myScanner.nextInt();\n\t\tint z = myScanner.nextInt();\n\t\tint b = x+y-z;\n\t\tSystem.out.print(b);\n\t}\n\n},ACCEPTED,226,20812
1590752652500205568,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-11 01:06:01,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main()\n{int t,j,n,x;\nscanf(\""%d\"",&t);\nfor(j=0;j<t;j++)\n{\n    scanf(\""%d\"",&n);\n    if(n>=0&&n<=pow(10,9)) {\n        x=int(pow(6,n))%10;\n        printf(\""%d\"",x);\n    if(j<t-1) printf(\""\\n\"");\n}\n}\nreturn 0;\n}\n",WRONG_ANSWER,7,484
1590752687082246144,0354b067c4132d4425a90b77482ac717447702274cb7db1282edce56eaf037b3,2022-11-11 01:06:10,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint i,a;\n\tscanf(\""%d\"",&i);\n\twhile(i>0){\n\t\tscanf(\""%d\"",&a);\n\t\tprintf(\""6\\n\"");\n\t\ti--;\n\t} \n\n    return 0;\n}",WRONG_ANSWER,11,324
1590752818095525888,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-11 01:06:41,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main()\n{int t,j,n,x;\nscanf(\""%d\"",&t);\nfor(j=0;j<t;j++)\n{\n    scanf(\""%d \"",&n);\n    if(n>=0&&n<=pow(10,9)) {\n        x=int(pow(6,n))%10;\n        printf(\""%d\"",x);\n    if(j<t-1) printf(\""\\n\"");\n}\n}\nreturn 0;\n}\n",WRONG_ANSWER,8,456
1590752915751481344,d808f4cc3c70a696f5c416714e0998fe96743e5273bc07a26f75738d12d304f5,2022-11-11 01:07:04,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a);\n        printf(\""6\\n\"");\n    }           \n}\n",WRONG_ANSWER,13,356
1590753138330632192,e807496cefc8b76d55101108daa4cb8e59f87dde49b8197bd619e8a84563990e,2022-11-11 01:07:57,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\n\nvoid F()\n{\n\tint x,y,z,a;\n\tprintf(\""请依次输入x,y,z的值，用逗号隔开：\"");\n\tscanf(\""%d,%d,%d\"",&x,&y,&z);\n\ta=x+y-z;\n\tprintf(\""F(x)=%d\\n\"",a);\n}\n\nint main()\n{\n\tF();\n\treturn 0;\n}",WRONG_ANSWER,3,180
1590753256819724288,06b00897262b024d9e66dcd771cf81de9b63954f7a4554699d17c2158114c0d1,2022-11-11 01:08:25,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner in = new Scanner(System.in);\n        int n=in.nextInt();\n        int j,x=0;\n        for (int i = 2; i <= n; i++) { \n            for (j = 2; j <= i - 1; j++) {\n                if (i % j == 0) {\n                    break;\n                }\n            }\n            if (i == j) {\n                x++;\n            }\n        }\n        System.out.println(x);\n    }\n}\n",TIME_LIMIT_EXCEEDED,400,17040
1590753318358528000,d808f4cc3c70a696f5c416714e0998fe96743e5273bc07a26f75738d12d304f5,2022-11-11 01:08:40,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a);\n        if(i==n-1){\n            printf(\""6\"");\n        }\n        else{\n            printf(\""6\\n\""); \n        }\n\n    }           \n}\n",WRONG_ANSWER,13,352
1590753460696449024,f02e276f40ab35b9adfdb6399e4858c8c655e5a7c77ea058b6ff58b6ea670152,2022-11-11 01:09:14,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint X,Y,Z,F;\n\tscanf(\""%d\"" \""%d\"" \""%d\"",&X ,&Y ,&Z);\n\tF=X+Y-Z;\n\tprintf(\""%d\"",F);\n    return 0;\n}",ACCEPTED,6,316
1590753533857693696,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-11 01:09:31,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main()\n{int t,j,n,x;\nscanf(\""%d\"",&t);\nfor(j=0;j<t;j++)\n{\n    scanf(\""%d \"",&n);\n    if(n>0&&n<=pow(10,9)) {\n        x=int(pow(6,n))%10;\n        printf(\""%d\"",x);\n    if(j<t-1) printf(\""\\n\"");\n}\n}\nreturn 0;\n}\n",WRONG_ANSWER,8,496
1590753589558030336,efa7a60e7fa0d7fd13e87b47555eb8bfc0c4da0695990711fb851b886de3de22,2022-11-11 01:09:45,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint X,Y,Z,F;\n\tscanf(\""%d\"" \""%d\"" \""%d\"",&X ,&Y ,&Z);\n\tF=X+Y-Z;\n\tprintf(\""%d\"",F);\n}\n",ACCEPTED,4,196
1590753609225146368,e807496cefc8b76d55101108daa4cb8e59f87dde49b8197bd619e8a84563990e,2022-11-11 01:09:49,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\n\nvoid F()\n{\n\tint x,y,z,a;\n\tscanf(\""%d %d %d\"",&x,&y,&z);\n\ta=x+y-z;\n\tprintf(\""%d\\n\"",a);\n}\nint main()\n{\n\tF();\n\treturn 0;\n}",ACCEPTED,7,308
1590753621514457088,d808f4cc3c70a696f5c416714e0998fe96743e5273bc07a26f75738d12d304f5,2022-11-11 01:09:52,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a);\n        if(i==n-1){\n            printf(\""6\"");\n        }\n        else if(n=0){\n            printf(\""1\"");\n        }\n        else{\n            printf(\""6\\n\""); \n        }\n\n    }           \n}\n",WRONG_ANSWER,4,384
1590753658545963008,06b00897262b024d9e66dcd771cf81de9b63954f7a4554699d17c2158114c0d1,2022-11-11 01:10:01,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner in = new Scanner(System.in);\n        int n=in.nextInt();\n        int j,x=0;\n        for (int i = 2; i <= n; i++) { \n            for (j = 2; j <= i - 1; j++) {\n                if (i % j == 0) {\n                    break;\n                }\n            }\n            if (i == j) {\n                x=x+1;\n            }\n        }\n        System.out.println(x);\n    }\n}\n",TIME_LIMIT_EXCEEDED,400,17052
1590753695736856576,864c0dc14d6d917707294bc7e18ea53a2c0536c5d47f3d25f94f0188f106014f,2022-11-11 01:10:10,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main(){\n    int t,i;\n    int a[100];\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    int s=1,x,k,j;\n    for(int k=0;k<t;k++){\n        for(int j=0;j<a[k];j++){\n            s=s*6;\n        }\n         a[k]=s%10;\n    }\n    for(i=0;i<t;i++){\n        printf(\""%d\\n\"",a[k]);\n    }\n    return 0;\n}",TIME_LIMIT_EXCEEDED,54,352
1590753796286910464,cf40d28790a881d201bf0dd4e1fc1488383e8bfca669ada1909cf2ca7ae62300,2022-11-11 01:10:34,Java,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"class Main {\n    public int math(int x,int y,int z){\n        return x+y-z;\n    }\n}",WRONG_ANSWER,85,15596
1590753863131529216,e807496cefc8b76d55101108daa4cb8e59f87dde49b8197bd619e8a84563990e,2022-11-11 01:10:50,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tprintf(\""2022\"");\n\treturn 0;\n}",ACCEPTED,3,448
1590753985634570240,d808f4cc3c70a696f5c416714e0998fe96743e5273bc07a26f75738d12d304f5,2022-11-11 01:11:19,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a);\n        if(a=0){\n            printf(\""1\"");\n        }\n        else if(i==n-1){\n            printf(\""6\"");\n        }\n        else{\n            printf(\""6\\n\""); \n        }\n\n    }           \n}\n",WRONG_ANSWER,11,384
1590753987748499456,1773d9c971942817d949c47973c4eb8c24531f728d5480dbf3b232e568926258,2022-11-11 01:11:20,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.*;\nimport java.lang.Math;\nclass Main{\n    public static void main(String[] args){\n        Scanner sc = new Scanner(System.in);\n        int num = sc.nextInt();\n        for(int i=0;i<num;i++){\n            int x = sc.nextInt();\n            double v = Math.pow(6, x);\n            v = v % 10;\n            int z = (int) v % 10;\n            System.out.println(z);\n        }\n    }\n}",TIME_LIMIT_EXCEEDED,50,12908
1590754026810052608,f02e276f40ab35b9adfdb6399e4858c8c655e5a7c77ea058b6ff58b6ea670152,2022-11-11 01:11:29,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,3,312
1590754044606484480,d808f4cc3c70a696f5c416714e0998fe96743e5273bc07a26f75738d12d304f5,2022-11-11 01:11:33,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a);\n        if(a==0){\n            printf(\""1\"");\n        }\n        else if(i==n-1){\n            printf(\""6\"");\n        }\n        else{\n            printf(\""6\\n\""); \n        }\n\n    }           \n}\n",ACCEPTED,9,372
1590754198877179904,acf80eea856463058b81f71c0238069795893092293fbd098cc594959df6444e,2022-11-11 01:12:10,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"num=0\nn=int(input())\nfor i in range(2, n):\n    k=0\n    for j in range(2,n):\n        if i%j==0:\n            k=k+1\n            if k==2:\n                num=num+1\nsan=n-num-2\nprint(san)\n",TIME_LIMIT_EXCEEDED,400,2884
1590754440494252032,0c2907a154c1c61744366e94f73ae426665222ffae8eff7042dd0fd7bd8760fb,2022-11-11 01:13:08,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include<iostream>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n\n\n{\nint n,data;\nint i;\nscanf(\""%d\"",&n);\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&data);\nfor(i=0;i<n;i++)\n  {\n    if(i==n-1)\n        printf(\""6\"");\n        else\n            printf(\""6\\n\""); }\n\nreturn 0;\n}\n",COMPILE_ERROR,0,0
1590754497348046848,1773d9c971942817d949c47973c4eb8c24531f728d5480dbf3b232e568926258,2022-11-11 01:13:21,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.*;\nimport java.lang.Math;\nclass Main{\n    public static void main(String[] args){\n        Scanner sc = new Scanner(System.in);\n        int num = sc.nextInt();\n        for(int i = 0;i < num;i++){\n            int x = sc.nextInt();\n            int v = (int)Math.pow(6, x);\n            int z = v % 10;\n            System.out.println(z);\n        }\n    }\n}",TIME_LIMIT_EXCEEDED,50,13624
1590754615828721664,0c2907a154c1c61744366e94f73ae426665222ffae8eff7042dd0fd7bd8760fb,2022-11-11 01:13:49,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include<iostream>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n\n\n{\nint n,data;\nint i;\nscanf(\""%d\"",&n);\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&data);\nfor(i=0;i<n;i++)\n  {\n    if(i==n-1)\n        printf(\""6\"");\n        else\n            printf(\""6\\n\""); }\n\nreturn 0;\n}\n",COMPILE_ERROR,0,0
1590754742748360704,0c2907a154c1c61744366e94f73ae426665222ffae8eff7042dd0fd7bd8760fb,2022-11-11 01:14:20,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n\n\n{\nint n,data;\nint i;\nscanf(\""%d\"",&n);\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&data);\nfor(i=0;i<n;i++)\n  {\n    if(i==n-1)\n        printf(\""6\"");\n        else\n            printf(\""6\\n\""); }\n\nreturn 0;\n}\n",WRONG_ANSWER,13,368
1590755282563694592,0354b067c4132d4425a90b77482ac717447702274cb7db1282edce56eaf037b3,2022-11-11 01:16:28,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint i,j,a,b;\n\tscanf(\""%d\"",&i);\n\twhile(i>0){\n\t\tscanf(\""%d\"",&a);\n        b=6;\n        for(j=1;j<a;j++){\n            b=b*6%10;\n        }\n\t\tprintf(\""%d\\n\"",b);\n\t\ti--;\n\t} \n    return 0;\n}",WRONG_ANSWER,10,364
1590755566736158720,c47b15e117166a3dd00078b9f795673d5284a2761e582479119229751cc734d3,2022-11-11 01:17:36,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint f(int x,int y,int z)\n{\n    int a=0;\n    a=x+y-z;\n    return a;\n}\nint main() {\n    int x,y,z,m;\n    \n    scanf(\""%d %d %d\"",&x,&y,&z);\n    \n    if(x>=0 && x<=100 && y>=0 && y<=100 && z>=0 && z<=100){\n         m=f(x,y,z);\n        printf(\""%d\\n\"",m);\n    }\n\n    else printf(\""请重新输入0~100的整数\"");\n    \n\n    return 0;\n}\n",ACCEPTED,5,324
1590755621882867712,0c2907a154c1c61744366e94f73ae426665222ffae8eff7042dd0fd7bd8760fb,2022-11-11 01:17:49,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n\n\n{\nint n,data;\nint i;\nscanf(\""%d\"",&n);\nif(n==0)\nprintf(\""1\"");\nelse{\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&data);\nfor(i=0;i<n;i++)\n  {\n    if(i==n-1)\n        printf(\""6\"");\n        else\n            printf(\""6\\n\""); }}\n\nreturn 0;\n}\n",WRONG_ANSWER,15,444
1590756219063697408,efa7a60e7fa0d7fd13e87b47555eb8bfc0c4da0695990711fb851b886de3de22,2022-11-11 01:20:12,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    printf(\""2022\"");\n} ",ACCEPTED,2,200
1590756315125846016,cf40d28790a881d201bf0dd4e1fc1488383e8bfca669ada1909cf2ca7ae62300,2022-11-11 01:20:35,Java,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"class Main {\n    public static int math(int x, int y, int z){\n        int a = x+y-z;\n        return a;\n    }\n\n    public static void main(String[] args) {\n        System.out.println(math(8,7,3));\n    }\n}",WRONG_ANSWER,69,14348
1590756322289713152,acf80eea856463058b81f71c0238069795893092293fbd098cc594959df6444e,2022-11-11 01:20:36,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"num=0\nn=int(input())\nfor i in range(2, n):\n    for j in range(2,i):\n        if i%j==0:\n            num+=1\n            break\nsan=n-num-2\nprint(san)\n",TIME_LIMIT_EXCEEDED,400,2748
1590756863635947520,f6233bf69e5717913375f818af07214d1d2de6df0cd3bcb24368fbde112d6d15,2022-11-11 01:22:45,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"count = 0\na = eval(input())\nfor m in range(1, a):\n    flag = 0\n    for i in range(2, m):\n        if m % i == 0:\n            flag = 1\n            break\n    if flag == 0:\n        count += 1\nprint(count - 1)\n",TIME_LIMIT_EXCEEDED,400,2756
1590757115898167296,17759f531671f838bf3fae4270190e93b6109026f9503f986c1ed85bb412007d,2022-11-11 01:23:45,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,j,k,p,n,a[10000],b[10000],c[10000],d[10000];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n        c[i]=b[i]-a[i];\n    for(i=0;i<n;i++)\n    {\n        d[0]=c[i];\n        for(j=i+1,k=1;j<n;j++,k++)\n        {\n            d[k]=d[k-1]+c[j];\n        }\n        for(p=0;p<k)\n    }\n}",COMPILE_ERROR,0,0
1590757200157540352,0c2907a154c1c61744366e94f73ae426665222ffae8eff7042dd0fd7bd8760fb,2022-11-11 01:24:06,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,package thread;\n\nimport java.math.BigInteger;\nimport java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int n=sc.nextInt();\n\n       primeNumber2(n);\n\n\n\n    }\n   public static void primeNumber2(int n) {\n        int number = 2;\n        int count = 0;\n        while(number <= n) {\n            boolean isPrime = true;\n            int squareRoot = (int) Math.sqrt(number);\n            for(int divisor = 2; divisor <= squareRoot; divisor++) {\n                if(number % divisor == 0) {\n                    isPrime = false;\n                    break;\n                }\n            }\n            if(isPrime) {\n                count++;\n            }\n            number++;\n        }\n        System.out.println(count);\n    }\n\n    }\n,NON_ZERO_EXIT_CODE,84,17972
1590757429497888768,0c2907a154c1c61744366e94f73ae426665222ffae8eff7042dd0fd7bd8760fb,2022-11-11 01:25:00,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,\nimport java.math.BigInteger;\nimport java.util.Scanner;\n\npublic class main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int n=sc.nextInt();\n\n        System.out.println(primeNumber2(n));\n        \n    }\n   public static int primeNumber2(int n) {\n        int number = 2;\n        int count = 0;\n        while(number <= n) {\n            boolean isPrime = true;\n            int squareRoot = (int) Math.sqrt(number);\n            for(int divisor = 2; divisor <= squareRoot; divisor++) {\n                if(number % divisor == 0) {\n                    isPrime = false;\n                    break;\n                }\n            }\n            if(isPrime) {\n                count++;\n            }\n            number++;\n        }\n      return count;\n    }\n\n    }\n,COMPILE_ERROR,0,0
1590757464692297728,0c2907a154c1c61744366e94f73ae426665222ffae8eff7042dd0fd7bd8760fb,2022-11-11 01:25:09,Java,300.0,1590681458522583041,1590676393489461248,1049226928954454016,\nimport java.math.BigInteger;\nimport java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int n=sc.nextInt();\n\n        System.out.println(primeNumber2(n));\n        \n    }\n   public static int primeNumber2(int n) {\n        int number = 2;\n        int count = 0;\n        while(number <= n) {\n            boolean isPrime = true;\n            int squareRoot = (int) Math.sqrt(number);\n            for(int divisor = 2; divisor <= squareRoot; divisor++) {\n                if(number % divisor == 0) {\n                    isPrime = false;\n                    break;\n                }\n            }\n            if(isPrime) {\n                count++;\n            }\n            number++;\n        }\n      return count;\n    }\n\n    }\n,ACCEPTED,264,16424
1590757477744967680,f02e276f40ab35b9adfdb6399e4858c8c655e5a7c77ea058b6ff58b6ea670152,2022-11-11 01:25:12,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,a,b,c;\n    scanf(\""%d\"",&n);\n    scanf(\""%d\"" \""%d\"" \""%d\"",&a ,&b ,&c);\n    if(a==0)\n    {\n        printf(\""0\\n\"");\n    }\n    if(a!=0)\n    {\n        printf(\""6\\n\"");\n    }\n     if(b==0)\n    {\n        printf(\""0\\n\"");\n    }\n    if(b!=0)\n    {\n        printf(\""6\\n\"");\n    }\n    if(c==0)\n    {\n        printf(\""0\"");\n    }\n    if(c!=0)\n    {\n        printf(\""6\"");\n    }\n}",WRONG_ANSWER,5,472
1590757644212699136,acf80eea856463058b81f71c0238069795893092293fbd098cc594959df6444e,2022-11-11 01:25:51,Python,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"import math\nnum=0\nn=int(input())\nfor i in range(2, n):\n    for j in range(2,i):\n        if j*j>i: break\n        if i%j==0:\n            num+=1\n            break\nsan=n-num-2\nprint(san)\n",ACCEPTED,377,2872
1590757680577314816,0c2907a154c1c61744366e94f73ae426665222ffae8eff7042dd0fd7bd8760fb,2022-11-11 01:26:00,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n\n\n{\nint n,data;\nint i;\nscanf(\""%d\"",&n);\nif(n==0)\nprintf(\""1\"");\nelse{\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&data);\nfor(i=0;i<n;i++)\n  {\n    printf(\""6\\n\""); }}\n\nreturn 0;\n}\n",WRONG_ANSWER,10,196
1590757804774850560,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-11 01:26:30,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main()\n{int t,j,n,x;\n x=6;\nscanf(\""%d\"",&t);\nfor(j=0;j<t;j++)\n{\n    scanf(\""%d \"",&n);\n    if(n>0&&n<=pow(10,9)) {\n        //x=int(pow(6,n))%10;\n        printf(\""%d\"",x);\n    if(j<t-1) printf(\""\\n\"");\n}\n}\nreturn 0;\n}\n",WRONG_ANSWER,8,320
1590757847871324160,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-11 01:26:40,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main()\n{int t,j,n,x;\n x=6;\nscanf(\""%d\"",&t);\nfor(j=0;j<t;j++)\n{\n    scanf(\""%d \"",&n);\n    if(n>0&&n<=pow(10,9)) {\n        //x=int(pow(6,n))%10;\n        printf(\""%d\"",x);\n    if(j<t-1) printf(\""\\n\"");\n}\n}\nreturn 0;\n}\n",WRONG_ANSWER,7,192
1590757971334836224,0c2907a154c1c61744366e94f73ae426665222ffae8eff7042dd0fd7bd8760fb,2022-11-11 01:27:09,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,\nimport java.math.BigInteger;\nimport java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int n=sc.nextInt();\n\n        System.out.println(primeNumber2(n));\n        \n    }\n   public static int total(int n) {\n        int num = 2;\n        int count = 0;\n        while(num <= n) {\n            boolean flag = true;\n            int e = (int) Math.sqrt(number);\n            for(int i = 2; i <= e; ir++) {\n                if(number % i == 0) {\n                    flag = false;\n                    break;\n                }\n            }\n            if(flag) {\n                count++;\n            }\n            num++;\n        }\n      return count;\n    }\n\n    }\n,COMPILE_ERROR,0,0
1590758019741319168,0c2907a154c1c61744366e94f73ae426665222ffae8eff7042dd0fd7bd8760fb,2022-11-11 01:27:21,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,\nimport java.math.BigInteger;\nimport java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int n=sc.nextInt();\n\n        System.out.println(total(n));\n        \n    }\n   public static int total(int n) {\n        int num = 2;\n        int count = 0;\n        while(num <= n) {\n            boolean flag = true;\n            int e = (int) Math.sqrt(number);\n            for(int i = 2; i <= e; ir++) {\n                if(number % i == 0) {\n                    flag = false;\n                    break;\n                }\n            }\n            if(flag) {\n                count++;\n            }\n            num++;\n        }\n      return count;\n    }\n\n    }\n,COMPILE_ERROR,0,0
1590758069955530752,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-11 01:27:33,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main()\n{int t,j,n,x;\n x=6;\nscanf(\""%d\"",&t);\nfor(j=0;j<t;j++)\n{\n    scanf(\""%d \"",&n);\n    if(n>0&&n<=int(pow(10,9))) {\n        x=int(pow(6,n))%10;\n        printf(\""%d\"",x);\n    if(j<t-1) printf(\""\\n\"");\n}\n}\nreturn 0;\n}\n",WRONG_ANSWER,7,476
1590758079115890688,0c2907a154c1c61744366e94f73ae426665222ffae8eff7042dd0fd7bd8760fb,2022-11-11 01:27:35,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,\nimport java.math.BigInteger;\nimport java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int n=sc.nextInt();\n\n        System.out.println(total(n));\n        \n    }\n   public static int total(int n) {\n        int num = 2;\n        int count = 0;\n        while(num <= n) {\n            boolean flag = true;\n            int e = (int) Math.sqrt(num);\n            for(int i = 2; i <= e; ir++) {\n                if(num % i == 0) {\n                    flag = false;\n                    break;\n                }\n            }\n            if(flag) {\n                count++;\n            }\n            num++;\n        }\n      return count;\n    }\n\n    }\n,COMPILE_ERROR,0,0
1590758107821703168,0c2907a154c1c61744366e94f73ae426665222ffae8eff7042dd0fd7bd8760fb,2022-11-11 01:27:42,Java,300.0,1590681458522583041,1590676393489461248,1049226928954454016,\nimport java.math.BigInteger;\nimport java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int n=sc.nextInt();\n\n        System.out.println(total(n));\n        \n    }\n   public static int total(int n) {\n        int num = 2;\n        int count = 0;\n        while(num <= n) {\n            boolean flag = true;\n            int e = (int) Math.sqrt(num);\n            for(int i = 2; i <= e; i++) {\n                if(num % i == 0) {\n                    flag = false;\n                    break;\n                }\n            }\n            if(flag) {\n                count++;\n            }\n            num++;\n        }\n      return count;\n    }\n\n    }\n,ACCEPTED,250,16812
1590758289808359424,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-11 01:28:25,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main()\n{int t,j,n,x;\n x=6;\nscanf(\""%d\"",&t);\nfor(j=0;j<t;j++)\n{\n    scanf(\""%d \"",&n);\n    if(n>=0&&n<=int(pow(10,9))) {\n        x=int(pow(6,n))%10;\n        printf(\""%d\"",x);\n    if(j<t-1) printf(\""\\n\"");\n}\n}\nreturn 0;\n}\n",WRONG_ANSWER,8,464
1590758624492851200,cf40d28790a881d201bf0dd4e1fc1488383e8bfca669ada1909cf2ca7ae62300,2022-11-11 01:29:45,Java,300.0,1590524835191705600,1572865591226855424,1049226928954454016,import java.util.Scanner;\n\nclass Main {\n    public static void main(String[] args) {\n        Scanner input = new Scanner(System.in);\n        int x = input.nextInt();\n        int y = input.nextInt();\n        int z = input.nextInt();\n        System.out.println(x+y-z);\n    }\n},ACCEPTED,218,16800
1590758628905254912,f02e276f40ab35b9adfdb6399e4858c8c655e5a7c77ea058b6ff58b6ea670152,2022-11-11 01:29:46,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,a,b,c;\n    scanf(\""%d\"",&n);\n    scanf(\""%d\"" \""%d\"" \""%d\"",&a ,&b ,&c);\n    printf(\""6\\n\"");\n    printf(\""6\\n\"");\n    printf(\""6\"");\n}",WRONG_ANSWER,4,352
1590758766742667264,06b00897262b024d9e66dcd771cf81de9b63954f7a4554699d17c2158114c0d1,2022-11-11 01:30:19,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner in = new Scanner(System.in);\n        int n=in.nextInt();\n        int j,x=0;\n        for (int i = 2; i <= n; i++) { \n            for (j = 2; j <= Math.sqrt(i - 1); j++) {\n                if (i % j == 0) {\n                    break;\n                }\n            }\n            if (i == j) {\n                x=x+1;\n            }\n        }\n        System.out.println(x);\n    }\n}\n",WRONG_ANSWER,137,17056
1590758955456987136,0c2907a154c1c61744366e94f73ae426665222ffae8eff7042dd0fd7bd8760fb,2022-11-11 01:31:04,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n\n\n{\nint n,data;\nint i;\nscanf(\""%d\"",&n);\nif(n==0)\nprintf(\""1\"");\nelse{\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&data);\nfor(i=0;i<n;i++)\n  {\n    if(i==n-1)\n        printf(\""6 \"");\n        else\n            printf(\""6 \\n\""); }}\n\nreturn 0;\n}\n",WRONG_ANSWER,14,344
1590759461982089216,0c2907a154c1c61744366e94f73ae426665222ffae8eff7042dd0fd7bd8760fb,2022-11-11 01:33:05,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n\n\n{\nint n,data;\nint i;\n(void)scanf(\""%d\"",&n);\nif(n==0)\nprintf(\""1\"");\nelse{\nfor(i=0;i<n;i++)\n    (void)scanf(\""%d\"",&data);\nfor(i=0;i<n;i++)\n  {\n    if(i==n-1)\n        printf(\""6\"");\n        else\n            printf(\""6\\n\""); }}\n\nreturn 0;\n}\n",WRONG_ANSWER,10,368
1590760274519437312,e807496cefc8b76d55101108daa4cb8e59f87dde49b8197bd619e8a84563990e,2022-11-11 01:36:18,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n\tint n,i;\n\tcin>>n;\n\tfor(i=1;i<=n;i++){\n\t\tcin>>n;\n\t\tcout<<6<<endl; \n\t}\t\t\n\treturn 0;\n}",COMPILE_ERROR,0,0
1590760558561923072,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-11 01:37:26,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main()\n{int t,j,n,x;\n x=6;\nscanf(\""%d\"",&t);\nint y[t];\nfor(j=0;j<t;j++)\n{\n    scanf(\""%d\"",&y[t]);\n\n}\nfor (j=0;j<t;j++)\n{\n     if(y[t]>=0&&y[t]<=int(pow(10,9))) {\n        x=int(pow(6,y[t]))%10;\n        printf(\""%d\"",x);\n     if(j<t-1) printf(\""\\n\"");\n}\n}\nreturn 0;\n}\n\n",WRONG_ANSWER,6,348
1590760751994830848,e807496cefc8b76d55101108daa4cb8e59f87dde49b8197bd619e8a84563990e,2022-11-11 01:38:12,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n\tint n,i;\n\tcin>>n;\n\tfor(i=1;i<=n;i++){\n\t\tcin>>n;\n\t\tcout<<6<<endl; \n\t}\t\t\n\treturn 0;\n}",WRONG_ANSWER,5,476
1590760886292250624,1773d9c971942817d949c47973c4eb8c24531f728d5480dbf3b232e568926258,2022-11-11 01:38:44,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.*;\nimport java.lang.Math;\nclass Main{\n    public static void main(String[] args){\n        Scanner scanner = new Scanner(System.in);\n        int num = scanner.nextInt();\n        for(int i = 0;i < num;i++){\n            int x = scanner.nextInt();\n            int v = (int)Math.pow(6, x);\n            int z = v % 10;\n            System.out.println(z);\n        }\n    }\n}",TIME_LIMIT_EXCEEDED,50,14096
1590761388824375296,cf40d28790a881d201bf0dd4e1fc1488383e8bfca669ada1909cf2ca7ae62300,2022-11-11 01:40:44,Java,300.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int a = sc.nextInt();\n        primeNum(a);\n    }\n\n    public static void primeNum(int n) {\n        int count = 0;\n        for (int i = 2; i < n; i++) {\n            int temp = -1;\n            for (int j = 2; j <= Math.sqrt(i); j++) {\n                if (i % j == 0) {\n                    temp = 1;\n                    break;\n                }\n            }\n            if (temp == -1) {\n                count++;\n            }\n        }\n        System.out.println(count);\n    }\n},ACCEPTED,237,19636
1590761460089794560,e807496cefc8b76d55101108daa4cb8e59f87dde49b8197bd619e8a84563990e,2022-11-11 01:41:01,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n\tint n,i,j;\n\tcin>>n;\n\tfor(i=1;i<=n;i++){\n\t\tcin>>j;\n\t\tcout<<6<<endl; \n\t}\t\t\n\treturn 0;\n}",WRONG_ANSWER,24,472
1590761500535468032,06b00897262b024d9e66dcd771cf81de9b63954f7a4554699d17c2158114c0d1,2022-11-11 01:41:11,Java,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner in = new Scanner(System.in);\n        int n=in.nextInt();\n        int j,x=0;\n        for(int i=2;i<=n;i++) {\n\t\t\tfor(j=2;j<=(int)Math.sqrt(i);j++) {\n\t\t\t\tif(i%j==0) {\n\t\t\t\t\tbreak;\t\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(j>(int)Math.sqrt(i)) {\n                x++;\n\t\t\t\n\t\t\t}\n        }\n        System.out.println(x);\n    }\n}\n",ACCEPTED,245,16496
1590761800516284416,e807496cefc8b76d55101108daa4cb8e59f87dde49b8197bd619e8a84563990e,2022-11-11 01:42:22,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n\tint n,i,j;\n\tcin>>n;\n\tfor(i=1;i<=n;i++){\n\t\tcin>>j;\n\t\tcout<<\""6\""<<endl; \n\t}\t\t\n\treturn 0;\n}",WRONG_ANSWER,14,640
1590761808720367616,06b00897262b024d9e66dcd771cf81de9b63954f7a4554699d17c2158114c0d1,2022-11-11 01:42:24,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner in = new Scanner(System.in);\n        int n=in.nextInt();\n        int n1=n+1;\n        int arr[]=new int[n1];\n        int a[]=new int[n1];\n        int x=1;\n        for(int o=1;o<=n;o++){\n            arr[o]=in.nextInt();\n        }\n        for(int i=0;i<n;i++){\n            int b=i+1;\n            for(int j=1;j<=arr[b];j++){\n                a[i]=x*6;\n                x=a[i];\n            }\n            x=1;\n        }\n        for(int k=0;k<n;k++){\n            if(k<n-1){\n                System.out.println(a[k]%10);\n            }else{\n                System.out.print(a[k]%10);\n            }\n        }\n    }\n},TIME_LIMIT_EXCEEDED,50,12616
1590762297516142592,e807496cefc8b76d55101108daa4cb8e59f87dde49b8197bd619e8a84563990e,2022-11-11 01:44:21,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n\tint n,i,j;\n\tcin>>n;\n\tfor(i=1;i<n;i++){\n\t\tcin>>j;\n\t\tcout<<\""6\""<<endl; \n\t}\t\t\n\tcout<<\""6\""; \n\treturn 0;\n}",WRONG_ANSWER,16,496
1590762543122022400,acf80eea856463058b81f71c0238069795893092293fbd098cc594959df6444e,2022-11-11 01:45:19,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,n=int(input())\nfor i in range(n):\n    x=int(input())\n    sum=1\n    for j in range(x):\n        sum*=x\n        sum%=10\n    print(sum);,NON_ZERO_EXIT_CODE,16,2880
1590762581529243648,06b00897262b024d9e66dcd771cf81de9b63954f7a4554699d17c2158114c0d1,2022-11-11 01:45:29,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner in = new Scanner(System.in);\n        int n=in.nextInt();\n        int n1=n+1;\n        int arr[]=new int[n1];\n        int a[]=new int[n1];\n        int x=1;\n        for(int o=1;o<=n;o++){\n            arr[o]=in.nextInt();\n        }\n        for(int i=0;i<n;i++){\n            int b=i+1;\n            for(int j=1;j<=arr[b];j++){\n                a[i]=x*6;\n                x=a[i];\n            }\n            x=1;\n        }\n        for(int k=0;k<n;k++){\n            if(k<n-1){\n                \n                System.out.println(a[k]%10);\n            }else{\n                System.out.print(a[k]%10);\n            }\n        }\n        exit(0);\n    }\n},COMPILE_ERROR,0,0
1590762599698968576,e807496cefc8b76d55101108daa4cb8e59f87dde49b8197bd619e8a84563990e,2022-11-11 01:45:33,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n\tint n,i,j;\n\tcin>>n;\n\tfor(i=1;i<n;i++){\n\t\tcin>>j;\n\t\tcout<<\""6\""<<endl; \n\t}\t\t\n\tcin>>j;\n\tcout<<\""6\""; \n\treturn 0;\n}",WRONG_ANSWER,16,476
1590762750509383680,f02e276f40ab35b9adfdb6399e4858c8c655e5a7c77ea058b6ff58b6ea670152,2022-11-11 01:46:09,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int n,a;\n    cin>>n;\n    for(int i=1;i<n;i++)\n    {\n        cin>>a;\n        cout<<\""6\""<<endl;\n    }\n    cout<<\""6\"";\n}",WRONG_ANSWER,13,476
1590762928800837632,f6233bf69e5717913375f818af07214d1d2de6df0cd3bcb24368fbde112d6d15,2022-11-11 01:46:51,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"count = 0\na = int(input())\nfor j in range(2, a):\n    for k in range(2, j):\n        if j % k == 0:\n            break\n    else:\n        count += 1\nprint(count)\n",TIME_LIMIT_EXCEEDED,400,2868
1590762954650353664,f02e276f40ab35b9adfdb6399e4858c8c655e5a7c77ea058b6ff58b6ea670152,2022-11-11 01:46:57,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int n,a;\n    cin>>n;\n    for(int i=1;i<n;i++)\n    {\n        cin>>a;\n        cout<<\""6\""<<endl;\n    }\n    cin>>a;\n    cout<<\""6\"";\n}",WRONG_ANSWER,19,480
1590763087949533184,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-11 01:47:29,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main()\n{int t,j,n,x;\nscanf(\""%d\"",&t);\nint y[t];\nfor(j=0;j<t;j++)\n{\n    scanf(\""%d\"",&y[j]);\n\n}\nfor (j=0;j<t;j++)\n{\n     if(y[j]>=0&&y[j]<=int(pow(10,9))) {\n        n=int(pow(6,0));\n        x=int(pow(6,y[j]))%10;\n        printf(\""%d\"",x);\n     if(j<t-1) printf(\""\\n\"");\n}\n}\nreturn 0;\n}\n\n\n",WRONG_ANSWER,6,320
1590763350248697856,f6233bf69e5717913375f818af07214d1d2de6df0cd3bcb24368fbde112d6d15,2022-11-11 01:48:32,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"count = 0\na = int(input())\nfor j in range(2, a):\n    for k in range(2, j):\n        if j % k == 0:\n            break\n    else:\n        count ++\nprint(count)\n",NON_ZERO_EXIT_CODE,15,2756
1590763533510447104,f6233bf69e5717913375f818af07214d1d2de6df0cd3bcb24368fbde112d6d15,2022-11-11 01:49:16,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"count = 0\na = int(input())\nfor j in range(2, a):\n    for k in range(2, j):\n        if j % k == 0:\n            break\n    else:\n        count =count+1\nprint(count)\n",TIME_LIMIT_EXCEEDED,400,2872
1590763788264083456,f02e276f40ab35b9adfdb6399e4858c8c655e5a7c77ea058b6ff58b6ea670152,2022-11-11 01:50:16,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n    int n;\n    cin>>n;\n    for(int i=1;i<n;i++)\n    {\n        int a;\n        cin>>a;\n        cout<<\""6\""<<endl;\n    }\n    int x;\n    cin>>x;\n    cout<<\""6\"";\n    return 0;\n}",WRONG_ANSWER,16,460
1590763937556115456,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-11 01:50:52,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main()\n{int t,j,n,x;\nscanf(\""%d\"",&t);\nint y[t];\nfor(j=0;j<t;j++)\n{\n    scanf(\""%d\"",&y[j]);\n\n}\nfor (j=0;j<t;j++)\n{\n     if(y[j]>0&&y[j]<=int(pow(10,9))) {\n        x=int(pow(6,y[j]))%10;\n        printf(\""6\"");\n     if(j<t-1) printf(\""\\n\"");\n}\n    if(y[j]==0) {\n        x=int(pow(6,y[j]))%10;\n        printf(\""1\"");\n     if(j<t-1) printf(\""\\n\"");\n}\n}\nreturn 0;\n}\n\n\n",WRONG_ANSWER,9,384
1590764353022918656,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-11 01:52:31,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main()\n{int t,j,n,x;\nscanf(\""%d\"",&t);\nint y[t];\nfor(j=0;j<t;j++)\n{\n    scanf(\""%d\"",&y[j]);\n\n}\nfor (j=0;j<t;j++)\n{\n     if(y[j]>0&&y[j]<=int(pow(10,9))) {\n        x=int(pow(6,y[j]))%10;\n        printf(\""6\"");\n     if(j<t-1) printf(\""\\n\"");\n}\n\n}\nreturn 0;\n}\n\n\n",WRONG_ANSWER,6,348
1590764764886798336,f02e276f40ab35b9adfdb6399e4858c8c655e5a7c77ea058b6ff58b6ea670152,2022-11-11 01:54:09,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n    int n;\n    cin>>n;\n    if(n==0)\n    {\n        return 0;\n    }\n    for(int i=1;i<n;i++)\n    {\n        int a;\n        cin>>a;\n        cout<<\""6\""<<endl;\n    }\n    int x;\n    cin>>x;\n    cout<<\""6\"";\n    return 0;\n}",WRONG_ANSWER,16,496
1590764919199412224,efa7a60e7fa0d7fd13e87b47555eb8bfc0c4da0695990711fb851b886de3de22,2022-11-11 01:54:46,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nchar key[100000001];             \nlong long flag = 3,N,result=0;\n \nvoid Change(long long num){      \n    long long op = num;\n    do{\n        key[op] = '}';\n        op+=num;\n    } while (op<=N);\n}\n \nvoid SU(long long num){          \n    long long len = sqrt(num)+1;\n    while (flag<=len){\n        if(num%len==0) return ;\n        flag+=2;\n    }\n    Change(num);\n    result++;\n}\n \nint main(void){\n \n    scanf(\""%lld\"",&N);\n    if(N>=2) {\n        result++;\n        Change(2);\n    }\n    for(long long z=3;z<=N;z+=2){\n        if(key[z]=='}') continue;\n        SU(z);\n    }\n    printf(\""%lld\"",result);\n    return 0;\n}\n\n                \n                \n                \n                ",ACCEPTED,7,316
1590765191447511040,c358160a3e618a44cd693944fe10043e6372f46bf7d517c3c3f583bd85b17c5e,2022-11-11 01:55:51,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"n= int(input())\na=0\nfor i in range(2,n+1):\n    for j in range(2,i):\n        if (i%j)==0:\n            a+=1\n            break   \nprint(n-a-1)\n",TIME_LIMIT_EXCEEDED,400,2748
1590765544997957632,f02e276f40ab35b9adfdb6399e4858c8c655e5a7c77ea058b6ff58b6ea670152,2022-11-11 01:57:15,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n    int n;\n    cin>>n;\n    if(n==0)\n    {\n        cout<<\""0\"";\n    }\n    for(int i=1;i<n;i++)\n    {\n        int a;\n        cin>>a;\n        if(a==0)\n        {\n            cout<<\""0\"";\n        }\n        cout<<\""6\""<<endl;\n    }\n    int x;\n    cin>>x;\n    cout<<\""6\"";\n    return 0;\n}",WRONG_ANSWER,15,496
1590765730788868096,129ddfe9d2d4553f365faf2fdc5e2f0c271b2e342a4cff13802dda8ef8b3d1c2,2022-11-11 01:57:59,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner s1 = new Scanner(System.in);\n        int a = s1.nextInt();\n        int s = 0;\n        for (int i = 2; i <= a; i++) {\n            int g = 1;\n            for (int j = 2; j <i; j++) {\n                if (i % j == 0) {\n                    g = 0;\n                    break;\n                }\n            }\n            if (g == 1) {\n                s++;\n            }\n        }\n        System.out.println(s);\n    }\n},TIME_LIMIT_EXCEEDED,400,19792
1590765952512360448,c358160a3e618a44cd693944fe10043e6372f46bf7d517c3c3f583bd85b17c5e,2022-11-11 01:58:52,Python,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"n= int(input())\na=0\nfor i in range(1,n+1):\n    for j in range(2,i):\n        if j*j>i:\n            break\n        if (i%j)==0:\n            a+=1\n            break   \nprint(n-a-1)\n",ACCEPTED,362,3384
1590765976763826176,06b00897262b024d9e66dcd771cf81de9b63954f7a4554699d17c2158114c0d1,2022-11-11 01:58:58,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner in = new Scanner(System.in);\n        int n=in.nextInt();\n        int n1=n+1;\n        int arr[]=new int[n1];\n        int a[]=new int[n1];\n        int x=1;\n        for(int o=1;o<=n;o++){\n            arr[o]=in.nextInt();\n        }\n        for(int i=0;i<n;i++){\n            int b=i+1;\n            for(int j=1;j<=arr[b];j++){\n                a[i]=x*6;\n                x=a[i];\n            }\n            x=1;\n        }\n        for(int k=0;k<n;k++){\n            if(k<n-1){\n                int p=a[k]%10;\n                System.out.println(p);\n            }else{\n                int y=a[k]%10;\n                System.out.print(y);\n            }\n            }\n        }\n}\n,TIME_LIMIT_EXCEEDED,50,13576
1590766077271912448,f02e276f40ab35b9adfdb6399e4858c8c655e5a7c77ea058b6ff58b6ea670152,2022-11-11 01:59:22,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n    int n;\n    cin>>n;\n    if(n==0)\n    {\n        cout<<\""0\"";\n    }\n    for(int i=1;i<n;i++)\n    {\n        int a;\n        cin>>a;\n        if(a==0)\n        {\n            cout<<\""0\"";\n        }\n        cout<<\""6\""<<endl;\n    }\n    int x;\n    cin>>x;\n    if(x==0)\n    {\n        cout<<\""0\"";\n    }\n    cout<<\""6\"";\n    return 0;\n}",WRONG_ANSWER,14,472
1590766091037638656,06b00897262b024d9e66dcd771cf81de9b63954f7a4554699d17c2158114c0d1,2022-11-11 01:59:25,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner in = new Scanner(System.in);\n        int n=in.nextInt();\n        int n1=n+1;\n        int arr[]=new int[n1];\n        int a[]=new int[n1];\n        int x=1;\n        for(int o=1;o<=n;o++){\n            arr[o]=in.nextInt();\n        }\n        for(int i=0;i<n;i++){\n            int b=i+1;\n            for(int j=1;j<=arr[b];j++){\n                a[i]=x*6;\n                x=a[i];\n            }\n            x=1;\n        }\n        for(int k=0;k<n;k++){\n            if(k<n-1){\n                int p=a[k]%10;\n                System.out.println(p);\n            }else{\n                int y=a[k]%10;\n                System.out.print(y);\n            }\n            }\n        }\n}\n,TIME_LIMIT_EXCEEDED,50,13380
1590766268112744448,129ddfe9d2d4553f365faf2fdc5e2f0c271b2e342a4cff13802dda8ef8b3d1c2,2022-11-11 02:00:07,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner s1 = new Scanner(System.in);\n        int a = s1.nextInt();\n        int s = 0;\n        for (int i = 3; i <= a; i++) {\n            int g = 1;\n            for (int j = 2; j <i; j++) {\n                if (i % j == 0) {\n                    g = 0;\n                    break;\n                }\n            }\n            if (g == 1) {\n                s++;\n            }\n        }\n        System.out.println(s+1);\n    }\n},TIME_LIMIT_EXCEEDED,400,16792
1590766577975361536,e807496cefc8b76d55101108daa4cb8e59f87dde49b8197bd619e8a84563990e,2022-11-11 02:01:21,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n\tint n,i,j;\n\tcin>>n;\n\tif(n==0){\n\t\treturn 0;\n\t}\n\tfor(i=1;i<n;i++){\n\t\tcin>>j;\n\t\tif(j==0){\n\t\t\tcout<<\""1\""<<endl;\n\t\t}else{\n\t\t\tcout<<\""6\""<<endl; \n\t\t}\n\t}\t\t\n\tcin>>j;\n\twhile(j==0){\n\t\t\tcout<<\""1\"";\n\t\t\tbreak;\n\t\t}\n\tcout<<\""6\""; \n\treturn 0;\n}",ACCEPTED,17,692
1590766693943672832,f6233bf69e5717913375f818af07214d1d2de6df0cd3bcb24368fbde112d6d15,2022-11-11 02:01:49,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,i = 2\na = int(input())\nprime_number = []\nwhile i < a:\n    j = 2\n    while j <= i:\n        if i == j:\n            prime_number.append(i)\n            # print(i)\n        if i % j == 0:\n            break\n        j += 1\n    i += 1\nprint(len(prime_number))\n,TIME_LIMIT_EXCEEDED,400,3116
1590766959191457792,1773d9c971942817d949c47973c4eb8c24531f728d5480dbf3b232e568926258,2022-11-11 02:02:52,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.*;\nclass Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int num = sc.nextInt();\n        int count = 0;\n        for (int i = 2; i < num; i++) {\n            int j = 2;\n            while (i % j != 0) {\n                j++;\n            }\n            if (j == i) {\n                count++;\n            }\n        }\n        System.out.println(count);\n    }\n},TIME_LIMIT_EXCEEDED,400,16904
1590767283734122496,f02e276f40ab35b9adfdb6399e4858c8c655e5a7c77ea058b6ff58b6ea670152,2022-11-11 02:04:10,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n    int n;\n    cin>>n;\n    if(n==0)\n    {\n        cout<<\""0\"";\n    }\n    else{\n        for(int i=1;i<n;i++)\n    {\n        int a;\n        cin>>a;\n        if(a==0)\n        {\n            cout<<\""0\"";\n        }\n        else\n        {\n            cout<<\""6\""<<endl;\n        }\n    }\n    int x;\n    cin>>x;\n    if(x==0)\n    {\n        cout<<\""0\"";\n    }\n    else{\n        cout<<\""6\"";\n        return 0;\n    }\n  }\n}",WRONG_ANSWER,13,480
1590767426734698496,f02e276f40ab35b9adfdb6399e4858c8c655e5a7c77ea058b6ff58b6ea670152,2022-11-11 02:04:44,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n    int n;\n    cin>>n;\n    if(n==0)\n    {\n        cout<<\""0\"";\n    }\n    else{\n        for(int i=1;i<n;i++)\n    {\n        int a;\n        cin>>a;\n        if(a==0)\n        {\n            cout<<\""0\"";\n        }\n        else\n        {\n            cout<<\""6\""<<endl;\n        }\n    }\n    int x;\n    cin>>x;\n    if(x==0)\n    {\n        cout<<\""0\"";\n    }\n    else{\n        cout<<\""6\"";\n    }\n        return 0;\n  }\n}",WRONG_ANSWER,16,760
1590767534729637888,f02e276f40ab35b9adfdb6399e4858c8c655e5a7c77ea058b6ff58b6ea670152,2022-11-11 02:05:09,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n    int n;\n    cin>>n;\n    if(n==0)\n    {\n        cout<<\""0\"";\n    }\n    else{\n        for(int i=1;i<n;i++)\n    {\n        int a;\n        cin>>a;\n        if(a==0)\n        {\n            cout<<\""1\"";\n        }\n        else\n        {\n            cout<<\""6\""<<endl;\n        }\n    }\n    int x;\n    cin>>x;\n    if(x==0)\n    {\n        cout<<\""1\"";\n    }\n    else{\n        cout<<\""6\"";\n    }\n        return 0;\n  }\n}",ACCEPTED,14,596
1590768173228560384,f6233bf69e5717913375f818af07214d1d2de6df0cd3bcb24368fbde112d6d15,2022-11-11 02:07:42,Python,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"num = 0\nn = int(input())\nfor i in range(2, n):\n    for j in range(2, i):\n        if j * j > i: break\n        if i % j == 0:\n            num += 1\n            break\nnumber = n - num - 2\nprint(number)\n",ACCEPTED,369,2872
1590771649887121408,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-11 02:21:31,C++,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <time.h>\n\nint main(int argc, char *argv[]) {\n    char len[20] = {0};\n\n    time_t timep;\n    time(&timep);\n\n    struct tm *p;\n    p = gmtime(&timep);\n\n    snprintf(len, 20, \""%d\"", 1900 + p->tm_year);\n\n    printf(\""%s\\n\"", len);\n    return 0;\n}\n",ACCEPTED,2,184
1590774181321572352,0354b067c4132d4425a90b77482ac717447702274cb7db1282edce56eaf037b3,2022-11-11 02:31:34,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n\nint main()\n\n{\n    int n,i,j,coint,flag;\n    scanf(\""%d\"",&n);\n    count=0;\n    for (i=2;i<= n;i++){\n        flag=1;\n       for(j=2;j<=sqrt(i);j++){\n         if(i%j==0){\n             flag=0;\n             break;\n          }\n       }\n        if(flag==1)\n            count++;\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",COMPILE_ERROR,0,0
1590774682561851392,0354b067c4132d4425a90b77482ac717447702274cb7db1282edce56eaf037b3,2022-11-11 02:33:34,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n\nint main()\n\n{\n    int n,i,j,count,flag;\n    scanf(\""%d\"",&n);\n    count=0;\n    for (i=2;i<= n;i++){\n        flag=1;\n       for(j=2;j<=sqrt(i);j++){\n         if(i%j==0){\n             flag=0;\n             break;\n          }\n       }\n        if(flag==1)\n            count++;\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",ACCEPTED,12,316
1590778147887448064,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-11 02:47:20,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"def prime(p):\n    a=0\n    if p==1:\n        \n        return False\n    else :\n        for i in range (1,p+1):\n            if p%i==0:\n                a+=1\n    if a>2 :\n        return False\n    if a==2:\n        return True\n'''\nprime(p)，返回True表示p是素数，返回False表示p不是素数\n'''\nn=int(input())\nif 2<=n<=10**5 :\n    i=0\n    j=0\n    for i in range(n) :\n        if prime(i)==True :\n            j=j+1\n    print(j)\n",TIME_LIMIT_EXCEEDED,400,2752
1590779456480940032,c47b15e117166a3dd00078b9f795673d5284a2761e582479119229751cc734d3,2022-11-11 02:52:32,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#define  MAX  10\n\nint main() {\n    int a,b,n=0,i=0;\n    int s[MAX];\n    scanf(\""%d\"",&a);\n\n    while(i<a){\n        scanf(\""%d\"",&s[n]);\n\n        i++;\n        n++;}\n    n=0;\n    for(i=0;i<a;i++){\n        if(s[n]>=0 && s[n]<=pow(10,9)){\n           b=int(pow(6,s[n]))%10;\n        n++;\n        printf(\""%d\\n\"",b);\n        }\n        else printf(\""请在0~10**9内输入数字\"");\n    }\n\n\n    return 0;\n}",COMPILE_ERROR,0,0
1590780674510991360,c47b15e117166a3dd00078b9f795673d5284a2761e582479119229751cc734d3,2022-11-11 02:57:22,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#define  MAX  10\n\nint main() {\n    int a,b,n=0,i=0;\n    int s[MAX];\n    scanf(\""%d\"",&a);\n\n    while(i<a){\n        scanf(\""%d\"",&s[n]);\n\n        i++;\n        n++;}\n    n=0;\n    for(i=0;i<a;i++){\n        if(s[n]>=0 && s[n]<=pow(10,9)){\n           b=int(pow(6,s[n]))%10;\n        n++;\n        printf(\""%d\\n\"",b);\n        }\n        else printf(\""请在0~10**9内输入数字\"");\n    }\n\n\n    return 0;\n}",WRONG_ANSWER,8,348
1590784604104101888,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-11 03:12:59,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"def prime(p):\n    a=p-1\n    for i in range (2,p+1):\n        for j in range(2,i-1):\n            if i%j==0:\n                a-=1\n                break\n    \n    return a\n'''\nprime(p)，返回True表示p是素数，返回False表示p不是素数\n'''\nn=int(input())\nif 2<=n<=10**5 :\n    print(prime(n))",TIME_LIMIT_EXCEEDED,400,4164
1590784858002100224,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-11 03:14:00,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"def prime(p):\n    a=p-1\n    for i in range (2,p+1):\n        for j in range(2,i//2+1):\n            if i%j==0:\n                a-=1\n                break\n    \n    return a\n'''\nprime(p)，返回True表示p是素数，返回False表示p不是素数\n'''\nn=int(input())\nif 2<=n<=10**5 :\n    print(prime(n))",TIME_LIMIT_EXCEEDED,400,2760
1590786936732717056,0c2907a154c1c61744366e94f73ae426665222ffae8eff7042dd0fd7bd8760fb,2022-11-11 03:22:15,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n\n\n{\nint n;\nint i;\nscanf(\""%d\"",&n);\n    int data[n];\nif(n==0)\nprintf(\""1\"");\nelse{\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&data[i]);\nfor(i=0;i<n;i++)\n  {if(data[i]==0&&n==1)\n      printf(\""1\"");\n    if(i==n-1&&data[i]!=0)\n        printf(\""6\"");\n        else if(data[i]==0)\n            printf(\""0/n\"");\n   else\n            printf(\""6\\n\""); }}\n\nreturn 0;\n}\n",WRONG_ANSWER,10,488
1590844024628514816,0d24b4ee85e6e3a4cc694f7e11105fa2aaf93fd10d4cbe81657f252e2d675435,2022-11-11 07:09:06,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n\tprintf(\""2022\"");\n\treturn 0;\n}",ACCEPTED,2,312
1590845409470251008,0d24b4ee85e6e3a4cc694f7e11105fa2aaf93fd10d4cbe81657f252e2d675435,2022-11-11 07:14:36,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n\tint num1, num2, num3;\n\tdo {\n\t\tscanf(\""%d %d %d\"", &num1, &num2, &num3);\n\t} while (num1 < 0 && num1 > 100 && num2 < 0 && num2 > 100&&num3 < 0 && num3 > 100);\n\t\n\tprintf(\""%d\"", num1 + num2 - num3);\n\treturn 0;\n}",ACCEPTED,6,336
1590846634559320064,b80fc2aed0abde15bdaa9327874c9784da696b6ed442d90001602ff2a017be15,2022-11-11 07:19:28,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nvoid output(int n)\n{\nint i=2022;\nprint(\""%d\"",&i);\n    return 0;\n}",COMPILE_ERROR,0,0
1590846988915093504,b80fc2aed0abde15bdaa9327874c9784da696b6ed442d90001602ff2a017be15,2022-11-11 07:20:53,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n=2022;\n\n  printf(\""%d \"",&n);\n    return 0;\n}",WRONG_ANSWER,2,196
1590847341882576896,b80fc2aed0abde15bdaa9327874c9784da696b6ed442d90001602ff2a017be15,2022-11-11 07:22:17,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n=2022;\n  printf(\""%d \"",n);\n    return 0;\n}",ACCEPTED,2,324
1590847957954527232,0d24b4ee85e6e3a4cc694f7e11105fa2aaf93fd10d4cbe81657f252e2d675435,2022-11-11 07:24:44,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nvoid function(int x);\nint main(void)\n{\n\tint n,num;\n\tscanf(\""%d\"", &n);\n\twhile (n > 0)\n\t{\n\t\tscanf(\""%d\"",&num);\n\t\tfunction(num);\n\t\tn--;\n\t }\n\treturn 0;\n}\nvoid function(int x) {\n\tint t,m;\n\tt = pow(6, x);\n\tm = t % 10;\n\tprintf(\""%d\\n\"", m);\n}",WRONG_ANSWER,10,584
1590848751550377984,0d24b4ee85e6e3a4cc694f7e11105fa2aaf93fd10d4cbe81657f252e2d675435,2022-11-11 07:27:53,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nvoid function(int x);\nint main(void)\n{\n\tint n,num;\n\tscanf(\""%d\"", &n);\n\twhile (n > 0)\n\t{\n\t\tscanf(\""%d\"",&num);\n\t\tfunction(num);\n\t\tif (n == 1) {\n\t\t\tprintf(\""\"");\n\t\t}\n\t\telse\n\t\t\tprintf(\""\\n\"");\n\t\tn--;\n\t\t\n\t }\n\treturn 0;\n}\nvoid function(int x) {\n\tint t,m;\n\tt = pow(6, x);\n\tm = t % 10;\n\tprintf(\""%d\"", m);\n}",WRONG_ANSWER,8,344
1590849199300743168,0d24b4ee85e6e3a4cc694f7e11105fa2aaf93fd10d4cbe81657f252e2d675435,2022-11-11 07:29:40,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nvoid function(int x);\nint main(void)\n{\n\tint n,num;\n\tscanf(\""%d\"", &n);\n\twhile (n > 0)\n\t{\n\t\tscanf(\""%d\"",&num);\n\t\tfunction(num);\n\t\tif (n ！= 1) \n\t\t\tprintf(\""\\n\"");\t\t\t\n\t\tn--;\t\t\n\t }\n\treturn 0;\n}\nvoid function(int x) {\n\tint t,m;\n\tt = pow(6, x);\n\tm = t % 10;\n\tprintf(\""%d\"", m);\n}",COMPILE_ERROR,0,0
1590849542017318912,0d24b4ee85e6e3a4cc694f7e11105fa2aaf93fd10d4cbe81657f252e2d675435,2022-11-11 07:31:02,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nvoid function(int x);\nint main(void)\n{\n\tint n,num;\n\tscanf(\""%d\"", &n);\n\twhile (n > 0)\n\t{\n\t\tscanf(\""%d\"",&num);\n\t\tfunction(num);\n\t\tif (n != 1) \n\t\t\tprintf(\""\\n\"");\t\t\t\n\t\tn--;\t\t\n\t }\n\treturn 0;\n}\nvoid function(int x) {\n\tint t,m;\n\tt = pow(6, x);\n\tm = t % 10;\n\tprintf(\""%d\"", m);\n}",WRONG_ANSWER,9,328
1590852229752487936,e7e6ce2c6e9e530eaf2b9b9968748a0e44e3ac7183d73deb51851946350bfbb0,2022-11-11 07:41:42,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n\nint main{\n    int year;\n    year=2022;\n    printf(\""%d\"",year);\n    return 0;\n}",COMPILE_ERROR,0,0
1590852565489725440,e7e6ce2c6e9e530eaf2b9b9968748a0e44e3ac7183d73deb51851946350bfbb0,2022-11-11 07:43:02,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}\n",ACCEPTED,2,356
1590853083746316288,e7e6ce2c6e9e530eaf2b9b9968748a0e44e3ac7183d73deb51851946350bfbb0,2022-11-11 07:45:06,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n    return 0;\n}\n",ACCEPTED,5,480
1590853116231221248,0d24b4ee85e6e3a4cc694f7e11105fa2aaf93fd10d4cbe81657f252e2d675435,2022-11-11 07:45:14,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint judge(int n);\nint main(void)\n{\n\tint n1, i;\n\tint count = 0;\n\tscanf(\""%d\"", &n1);\n\tfor (i = 2; i < n1; i++) {\n\t\tif (judge(i))\n\t\t\tcount++; //计数素数\n\t}\n\t\tprintf(\""%d\"", count);\n\treturn 0;\n}\nint  judge(int n)\n{\n\tint i;\n\tfor (i = 2; i <= sqrt(n); i++) {\n\t\tif (n % i == 0)\n            return 0; //不是素数\n\t}\n\treturn 1; //是素数\n}\n",ACCEPTED,13,320
1590856577471549440,0d24b4ee85e6e3a4cc694f7e11105fa2aaf93fd10d4cbe81657f252e2d675435,2022-11-11 07:58:59,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nvoid function(int x);\nint main(void)\n{\n\tint n, num;\n\tif(scanf(\""%d\"", &n)!=1)\n\t\treturn 0;\n\twhile (n > 0)\n\t{\n\t\tif(scanf(\""%d\"", &num)!=1)\n\t\t\treturn 0;\n\t\tfunction(num);\n\t\tif (n != 1)\n\t\t\tprintf(\""\\n\"");\n\t\tn--;\n\t}\n\treturn 0;\n}\nvoid function(int x) {\n\tint t, m;\n\tt = pow(6, x);\n\tm = t % 10;\n\tprintf(\""%d\"", m);\n}",WRONG_ANSWER,11,320
1590857836802932736,a2fa7eb1ab1c2f6fa23517852ee6971ea32fd0c7742d71d7914ed729415f04d9,2022-11-11 08:03:59,C++,300.0,1590528927448293376,1590525945717575680,1049226928954454016,#include<iostream>\nusing namespace std;\nint main(){\n\tcout<<2022;\n\treturn 0;\n},ACCEPTED,3,316
1590858211857575936,a2fa7eb1ab1c2f6fa23517852ee6971ea32fd0c7742d71d7914ed729415f04d9,2022-11-11 08:05:29,C++,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main(){\n\tint x,y,z;\n\tcin>>x>>y>>z;\n\tcout<<x+y-z;\n\treturn 0;\n} ",ACCEPTED,8,488
1590858954534621184,a2fa7eb1ab1c2f6fa23517852ee6971ea32fd0c7742d71d7914ed729415f04d9,2022-11-11 08:08:26,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint n,k=0;\n\tcin>>n;\n\tfor(int i=2;i<=n;i++)\n\t{\n\t\tint s=1;\n\t\tfor(int j=2;j<i;j++)\n\t\t    if(i%j==0)\n\t\t    {\n\t\t\t    s=0;\n\t\t\t    break;\n\t        }\n\t    if(s==1)\n\t       k++;  \n\t}\n\tcout<<k;\n\treturn 0;\n} ",TIME_LIMIT_EXCEEDED,400,440
1590858976470827008,a2fa7eb1ab1c2f6fa23517852ee6971ea32fd0c7742d71d7914ed729415f04d9,2022-11-11 08:08:31,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint n,k=0;\n\tcin>>n;\n\tfor(int i=2;i<=n;i++)\n\t{\n\t\tint s=1;\n\t\tfor(int j=2;j<i;j++)\n\t\t    if(i%j==0)\n\t\t    {\n\t\t\t    s=0;\n\t\t\t    break;\n\t        }\n\t    if(s==1)\n\t       k++;  \n\t}\n\tcout<<k;\n\treturn 0;\n} ",TIME_LIMIT_EXCEEDED,400,324
1590859643772010496,a2fa7eb1ab1c2f6fa23517852ee6971ea32fd0c7742d71d7914ed729415f04d9,2022-11-11 08:11:10,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint n,k=0,s;\n\tcin>>n;\n\tfor(int i=2;i<=n;i++)\n\t{\n\t\ts=1;\n\t\tfor(int j=2;j<i;j++)\n\t\t    if(i%j==0)\n\t\t    {\n\t\t\t    s=0;\n\t\t\t    break;\n\t        }\n\t    if(s==1)\n\t       k++;  \n\t}\n\tcout<<k;\n\treturn 0;\n} ",TIME_LIMIT_EXCEEDED,400,316
1590860294849605632,0125039c47b4b2d763223fe2b39aac00dd19bf29b4ee1b0e21a506336bfc984e,2022-11-11 08:13:45,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\n   printf(\""2022\"");\n   return 0;\n}",ACCEPTED,3,324
1590860611133706240,e7e6ce2c6e9e530eaf2b9b9968748a0e44e3ac7183d73deb51851946350bfbb0,2022-11-11 08:15:01,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n    int a[10];\n    int n,i,z=1;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n\n    for(i=0;i<n;i++) {\n       if(a[i]==0)\n        printf(\""1\"");\n       else if(a[i]==1)\n                printf(\""6\"");\n       else {\n        if(a[i]>0)\n        {\n            for(i=1;i<=a[i];i++)\n                z=z*6;\n                printf(\""%d \\n\"",z);\n        }\n       }\n\n    }\n    return 0;\n}\n",WRONG_ANSWER,3,328
1590860924796317696,0125039c47b4b2d763223fe2b39aac00dd19bf29b4ee1b0e21a506336bfc984e,2022-11-11 08:16:15,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,#include (static)\nint main(){\n    printf(2022)\n},COMPILE_ERROR,0,0
1590863655929950208,281adcca8943f9f4c0ced14f1ceffe157a34fca39f3cb864eb95e400944e38a8,2022-11-11 08:27:07,Java,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"import java.util.*;\nclass Main{\n    public static void main(String[] args)\n{Scanner scan=new Scanner(System.in);\n int ans=0;\n int a=scan.nextInt();\n for(int i=0;i<a;i++){\n     int[] arr=scan.nextInt();\n }\n for(int i=0;i<a;i++){\n     int[] enegy=scan.nextInt();\n }\n int[] dp=new int[a];\n for(int i=0;i<a;i++){\n dp[i]=enegy[i]-arr[i];\n }\n for(int i=0;i<a;i++){\n     ans=Math.max(dp[i]+dp[i+1],ans)\n         \n }\n \n }\n}\n",COMPILE_ERROR,0,0
1590865550929080320,7935e8f5cb04027f4d30ac84a997e2d03e946e112c1cb17f1a4f943d8b0b54bf,2022-11-11 08:34:38,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main(){\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,3,192
1590865640922066944,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 08:35:00,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main(){\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,2,324
1590866213490724864,7935e8f5cb04027f4d30ac84a997e2d03e946e112c1cb17f1a4f943d8b0b54bf,2022-11-11 08:37:16,C++,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<iostream>\n#include<algorithm>\n#include<stdio.h>\nusing namespace std;\n\nint main(){\n\tint x,y,z;\n\tscanf(\""%d %d %d\"",&x,&y,&z);\n\tx=x+y-z;\n\tprintf(\""%d\"",x);\n\treturn 0;\n\n}\n",ACCEPTED,7,440
1590866279303544832,eeab3421c2b685f7d51b09a289b82fe82ba0d3896984d09aeffb9d022232d887,2022-11-11 08:37:32,Java,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"public class Main{\n    \n public static void main(String[] args){\n     System.out.println(\""2022\"");\n }\n}",ACCEPTED,67,14012
1590866671500333056,eeab3421c2b685f7d51b09a289b82fe82ba0d3896984d09aeffb9d022232d887,2022-11-11 08:39:06,Java,300.0,1590524835191705600,1572865591226855424,1049226928954454016,import java.util.Scanner;\npublic class Main{\n    public static void main(String[] args){\n        Scanner sc = new Scanner(System.in);\n        int x = sc.nextInt();\n        int y = sc.nextInt();\n        int z = sc.nextInt();\n        System.out.println(x+y-z);\n    }\n},ACCEPTED,236,19640
1590866785103032320,6383c93cbdef4af3eda29400a925819f16ad4afc8368e604ccd580cba7055bdd,2022-11-11 08:39:33,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""2022\"")\n        \n        return 0;\n}",COMPILE_ERROR,0,0
1590866827406807040,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 08:39:43,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main(){\n    int x[100]=0;\n    for(int i=0;i<3;i++){\n        scanf(\""%d\"",&x[i]);\n    }\n    int result；\n        result=x[0]+x[1]-x[2];\n    printf(\""%d\"",result);\n    return 0;\n}",COMPILE_ERROR,0,0
1590866833559851008,6383c93cbdef4af3eda29400a925819f16ad4afc8368e604ccd580cba7055bdd,2022-11-11 08:39:44,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""2022\"")\n        \n        return 0;\n}",COMPILE_ERROR,0,0
1590867185747144704,6383c93cbdef4af3eda29400a925819f16ad4afc8368e604ccd580cba7055bdd,2022-11-11 08:41:08,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n    printf(\""2022\"");\n\n    return 0;\n}\n",ACCEPTED,2,184
1590867270279172096,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 08:41:28,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main(){\n    int x[100]=0;\n    for(int i=0;i<3;i++){\n        scanf(\""%d\"",&x[i]);\n    }\n    int result;\n        result=x[0]+x[1]-x[2];\n    printf(\""%d\"",result);\n    return 0;\n}",COMPILE_ERROR,0,0
1590867451972227072,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 08:42:12,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main(){\n    int x[100]={0};\n    for(int i=0;i<3;i++){\n        scanf(\""%d\"",&x[i]);\n    }\n    int result;\n        result=x[0]+x[1]-x[2];\n    printf(\""%d\"",result);\n    return 0;\n}",ACCEPTED,6,476
1590867650186641408,6383c93cbdef4af3eda29400a925819f16ad4afc8368e604ccd580cba7055bdd,2022-11-11 08:42:59,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    printf(\""%d\"",X+Y-Z);\n\n    return 0;\n}\n",ACCEPTED,5,320
1590868108137533440,09eb01e8f9f24922a6c60a1149d505ad1ebb9b0a39ed1101140fe0fd93daa753,2022-11-11 08:44:48,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,3,184
1590868380222029824,172db3e4a89a3dc038ec44e9346ef3138ace8cc1576eb636ccaf26fd91d7a145,2022-11-11 08:45:53,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <algorithm>\n\nusing namespace std;\n\nconst int N = 2e5 + 10;\nint v[N],w[N];\n\nint main(){\n    int n;\n    int maxn = 0;\n    scanf(\""%d\"",&n);\n    for(int i=1;i<=n;i++) scanf(\""%d\"",&v[i]);\n    for(int i=1;i<=n;i++) scanf(\""%d\"",&w[i]);\n    for(int i=1;i<=n;i++) {\n        v[i] -= w[i];\n        if(v[i] > 0) maxn += v[i];\n    }\n    \n    printf(\""%d\\n\"",maxn);\n    return 0;\n}",WRONG_ANSWER,3,476
1590868566063230976,7935e8f5cb04027f4d30ac84a997e2d03e946e112c1cb17f1a4f943d8b0b54bf,2022-11-11 08:46:37,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\n#include<algorithm>\n#include<stdio.h>\nusing namespace std;\n\nint main(){\n\tint x,n;\n\tscanf(\""%d\"",&x);\n\tfor(int i=0;i<x;i++)\n    {\n        scanf(\""%d\"",&n);\n        if(n==0)\n            printf(\""1\\n\"");\n        else printf(\""6\\n\"");\n    }\n\treturn 0;\n\n}\n",ACCEPTED,16,472
1590868764193787904,09eb01e8f9f24922a6c60a1149d505ad1ebb9b0a39ed1101140fe0fd93daa753,2022-11-11 08:47:24,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stio.h>\nint main()\n{\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n    return 0;\n}",COMPILE_ERROR,0,0
1590868808351420416,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-11 08:47:35,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<math.h>\n#include <stdio.h>\nint main()\n{\n    int n,i=2,j,temp=0;\n    scanf(\""%d\"",&n);\n     for(j=2;j<=i;j++)\n     {\n       if(i>n)\n        break;\n      if(i%j==0&&j==i)\n      {\n       ++temp;\n       j=2;\n       i++;\n      }\n      else if(i%j==0)\n      {\n       i++;\n       j=2;\n      }\n     }\n    printf(\""%d\"",temp);\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,400,192
1590868932733501440,09eb01e8f9f24922a6c60a1149d505ad1ebb9b0a39ed1101140fe0fd93daa753,2022-11-11 08:48:05,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n    return 0;\n}",ACCEPTED,6,312
1590869083061530624,172db3e4a89a3dc038ec44e9346ef3138ace8cc1576eb636ccaf26fd91d7a145,2022-11-11 08:48:40,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <algorithm>\n\nusing namespace std;\n\nconst int N = 2e5 + 10;\nint v[N],w[N];\n\nint main(){\n    int n;\n    int maxn = 0;\n    scanf(\""%d\"",&n);\n    for(int i=1;i<=n;i++) scanf(\""%d\"",&v[i]);\n    for(int i=1;i<=n;i++) scanf(\""%d\"",&w[i]);\n    for(int i=1;i<=n;i++) {\n        v[i] -= w[i];\n        if(v[i] > 0) maxn += v[i];\n    }\n    \n    if(maxn == 0) {\n        maxn = -0x3f3f3f3f;\n        for(int i=1;i<=n;i++) {\n            maxn = max(maxn,v[i]);\n        }\n    }\n    \n    printf(\""%d\\n\"",maxn);\n    return 0;\n}",WRONG_ANSWER,3,180
1590869999261122560,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 08:52:19,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"//终曲cc-学习之路\n#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n    long long int t,j,u=0;\n    int isprime(int n);\n    scanf(\""%d\"",&t);\n    for(j=1;j<=t;j++)\n    {\n        if (isprime(j)==1) u++;\n    }\n    printf(\""%d。\"",u);\n    return 0;\n}\n\n\nint isprime(int n) {\n    int i;\n    if(n==2) return 1;\n    else if(n==1||n%2==0) return 0;\n    for (i=3;i<=sqrt(n)+1;i+=2)\n    {\n        if(n%i==0) return 0;\n    }\n    return 1;\n}\n",TIME_LIMIT_EXCEEDED,400,184
1590870868870369280,6383c93cbdef4af3eda29400a925819f16ad4afc8368e604ccd580cba7055bdd,2022-11-11 08:55:46,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    int i,k;\n    int cnt=0;\n    for(i=2;i<=n;i++){\n        int isPrime=1;\n        for(k=2;k<i-1;k++){\n            if(i%k==0){\n                isPrime = 0;\n                break;\n            }\n        }\n         if(isPrime==1){\n            cnt++;\n        }\n    }\n    printf(\""%d\"",cnt);\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,400,328
1590870889233715200,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 08:55:51,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include \""stdio.h\""\nint main() {\n    int n;\n    scanf(\""%d\"", &n);\n    for (int i = 2; i < n; i++) {\n        bool flag = 1;\n \n        for (int j = 2; j < i; j++) {\n            if (i % j == 0) {\n                flag = 0;\n            }\n        }\n        if (flag) {\n            printf(\""%d\\n\"", i);\n        }\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1590871310488637440,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 08:57:32,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include \""stdio.h\""\nint main() {\n    int n,result;\n    scanf(\""%d\"", &n);\n    for (int i = 2; i < n; i++) {\n        bool flag = 1;\n        for (int j = 2; j < i; j++) {\n            if (i % j == 0) {\n                flag = 0;\n            }\n        }\n        if (flag) {\n            result++;\n        }\n    }\n    printf(\""%d\"",result);\n    return 0;\n}",COMPILE_ERROR,0,0
1590871356835696640,6383c93cbdef4af3eda29400a925819f16ad4afc8368e604ccd580cba7055bdd,2022-11-11 08:57:43,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n = 999;\n    int i,k;\n    int cnt=0;\n    for(i=2;i<=n;i++){\n        int isPrime=1;\n        for(k=2;k<i-1;k++){\n            if(i%k==0){\n                isPrime = 0;\n                break;\n            }\n        }\n         if(isPrime==1){\n            cnt++;\n        }\n    }\n    printf(\""%d\"",cnt);\n    return 0;\n}\n",WRONG_ANSWER,3,324
1590871688466726912,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 08:59:02,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include \""stdio.h\""\nint main() {\n    int n,result;\n    scanf(\""%d\"", &n);\n    for (int i = 2; i < n; i++) {\n        bool flag = 1;\n        for (int j = 2; j < i; j++) {\n            if (i % j == 0) {\n                flag = 0;\n            }\n        }\n        if (flag) {\n            result++;\n        }\n    }\n    printf(\""%d\"",result);\n    return 0;\n}",TIME_LIMIT_EXCEEDED,400,208
1590871781798359041,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 08:59:24,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main() {\n    int n,result;\n    scanf(\""%d\"", &n);\n    for (int i = 2; i < n; i++) {\n        bool flag = 1;\n        for (int j = 2; j < i; j++) {\n            if (i % j == 0) {\n                flag = 0;\n            }\n        }\n        if (flag) {\n            result++;\n        }\n    }\n    printf(\""%d\"",result);\n    return 0;\n}",TIME_LIMIT_EXCEEDED,400,512
1590871805328404480,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 08:59:30,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main() {\n    int n,result;\n    scanf(\""%d\"", &n);\n    for (int i = 2; i < n; i++) {\n        bool flag = 1;\n        for (int j = 2; j < i; j++) {\n            if (i % j == 0) {\n                flag = 0;\n            }\n        }\n        if (flag) {\n            result++;\n        }\n    }\n    printf(\""%d\"",result);\n    return 0;\n}",COMPILE_ERROR,0,0
1590871819115102208,172db3e4a89a3dc038ec44e9346ef3138ace8cc1576eb636ccaf26fd91d7a145,2022-11-11 08:59:33,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <algorithm>\n\nusing namespace std;\n\nconst int N = 2e5 + 10;\nint v[N],w[N];\n\nint main(){\n    int n;\n    int maxn = 0;\n    scanf(\""%d\"",&n);\n    for(int i=1;i<=n;i++) scanf(\""%d\"",&v[i]);\n    for(int i=1;i<=n;i++) {\n        scanf(\""%d\"",&w[i]);\n        v[i] -= w[i];\n    }\n    int L = 0;\n    for(int i=1;i<=n;i++) {\n        L += v[i];\n        if(L > maxn) maxn = L;\n        if(L < 0) L  = 0;\n    }\n    \n    \n    printf(\""%d\\n\"",maxn);\n    return 0;\n}",WRONG_ANSWER,3,188
1590871994692841472,172db3e4a89a3dc038ec44e9346ef3138ace8cc1576eb636ccaf26fd91d7a145,2022-11-11 09:00:15,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <algorithm>\n\nusing namespace std;\n\nconst int N = 2e5 + 10;\nint v[N],w[N];\n\nint main(){\n    int n;\n    int maxn = -0x3f3f3f3f;\n    scanf(\""%d\"",&n);\n    for(int i=1;i<=n;i++) scanf(\""%d\"",&v[i]);\n    for(int i=1;i<=n;i++) {\n        scanf(\""%d\"",&w[i]);\n        v[i] -= w[i];\n    }\n    int L = 0;\n    for(int i=1;i<=n;i++) {\n        L += v[i];\n        if(L > maxn) maxn = L;\n        if(L < 0) L  = 0;\n    }\n    \n    \n    printf(\""%d\\n\"",maxn);\n    return 0;\n}",WRONG_ANSWER,2,352
1590872368401133568,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 09:01:44,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n    int n,f;\n    cin >> n;\n    int cnt = 0;\n    for (int i = 2; i <= n; i++)\n    {\n        f=1;\n        for(int j = 2; j <=sqrt(i); j++)\n        {\n            if(i%j==0){\n                f=0;\n                break;\n            }\n        }\n        if(f){\n            //cout << i << endl ;\n            cnt++;\n        }\n    }\n    cout << cnt<< endl;\n    return 0;\n}\n\n\n",COMPILE_ERROR,0,0
1590872603043106816,09eb01e8f9f24922a6c60a1149d505ad1ebb9b0a39ed1101140fe0fd93daa753,2022-11-11 09:02:40,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n = 0;\n    int i = 0;\n    int a[];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    while(i<n)\n    {\n        if(a[i]==0)\n            printf(\""1\\n\"");\n        printf(\""6\\n\"");\n        i++;\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1590872623339343872,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 09:02:45,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <valarray>\n#include <iostream>\nusing namespace std;\n\nint main()\n{\n    int n,f;\n    cin >> n;\n    int cnt = 0;\n    for (int i = 2; i <= n; i++)\n    {\n        f=1;\n        for(int j = 2; j <=sqrt(i); j++)\n        {\n            if(i%j==0){\n                f=0;\n                break;\n            }\n        }\n        if(f){\n            //cout << i << endl ;\n            cnt++;\n        }\n    }\n    cout << cnt<< endl;\n    return 0;\n}\n\n\n",COMPILE_ERROR,0,0
1590872679228420096,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 09:02:58,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include <valarray>\n#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n    int n,f;\n    cin >> n;\n    int cnt = 0;\n    for (int i = 2; i <= n; i++)\n    {\n        f=1;\n        for(int j = 2; j <=sqrt(i); j++)\n        {\n            if(i%j==0){\n                f=0;\n                break;\n            }\n        }\n        if(f){\n            //cout << i << endl ;\n            cnt++;\n        }\n    }\n    cout << cnt<< endl;\n    return 0;\n}\n\n\n",COMPILE_ERROR,0,0
1590872754650415104,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 09:03:16,C++,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include <valarray>\n#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n    int n,f;\n    cin >> n;\n    int cnt = 0;\n    for (int i = 2; i <= n; i++)\n    {\n        f=1;\n        for(int j = 2; j <=sqrt(i); j++)\n        {\n            if(i%j==0){\n                f=0;\n                break;\n            }\n        }\n        if(f){\n            //cout << i << endl ;\n            cnt++;\n        }\n    }\n    cout << cnt<< endl;\n    return 0;\n}\n\n\n",ACCEPTED,15,472
1590872795683270656,eccafb49a6a53e0f6a70df305afa2fa1832182ed0fa3233a27357cbd42f50129,2022-11-11 09:03:26,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"print(\""2022\"")",ACCEPTED,15,2892
1590872991280467968,172db3e4a89a3dc038ec44e9346ef3138ace8cc1576eb636ccaf26fd91d7a145,2022-11-11 09:04:12,C++,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <algorithm>\n\nusing namespace std;\n\nconst int N = 2e5 + 10;\nint v[N],w[N];\n\nint main(){\n    int n;\n    int maxn = 0;\n    scanf(\""%d\"",&n);\n    for(int i=1;i<=n;i++) scanf(\""%d\"",&w[i]);\n    for(int i=1;i<=n;i++) {\n        scanf(\""%d\"",&v[i]);\n        v[i] -= w[i];\n    }\n    int L = 0;\n    for(int i=1;i<=n;i++) {\n        L += v[i];\n        if(L > maxn) maxn = L;\n        if(L < 0) L  = 0;\n    }\n    printf(\""%d\\n\"",maxn);\n    return 0;\n}",ACCEPTED,3,184
1590873132322304000,09eb01e8f9f24922a6c60a1149d505ad1ebb9b0a39ed1101140fe0fd93daa753,2022-11-11 09:04:46,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"",&n);\n    int i = 0;\n    int a[n];\n    \n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",a[i]);\n    }\n    while(i<n)\n    {\n        if(a[i]==0)\n            printf(\""1\\n\"");\n        printf(\""6\\n\"");\n        i++;\n    }\n    return 0;\n}",SEGMENTATION_FAULT,4,472
1590873206557290496,ccc42b8437aa15d1214e4623799ed35cd8ea8087c26cb1b596d51ae4556ea39c,2022-11-11 09:05:04,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"print(\""2022\"")",COMPILE_ERROR,0,0
1590873240636010496,ccc42b8437aa15d1214e4623799ed35cd8ea8087c26cb1b596d51ae4556ea39c,2022-11-11 09:05:12,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"print(\""2022\"")",ACCEPTED,16,2752
1590873329697861632,eccafb49a6a53e0f6a70df305afa2fa1832182ed0fa3233a27357cbd42f50129,2022-11-11 09:05:33,Java,300.0,1590524835191705600,1572865591226855424,1049226928954454016,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            int c = in.nextInt();\n            System.out.println(a+b-c);\n        }\n    }\n},ACCEPTED,237,18836
1590873361318744064,eeab3421c2b685f7d51b09a289b82fe82ba0d3896984d09aeffb9d022232d887,2022-11-11 09:05:40,Java,300.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.io.BufferedInputStream;\nimport java.io.BufferedWriter;\nimport java.io.InputStreamReader;\nimport java.math.BigDecimal;\nimport java.util.Scanner;\nimport java.io.*;\n\npublic class Main{\n\t\t\n\tpublic static boolean fun(int n) {\n\t\tint k = (int)Math.sqrt((double)n);\n\t\tint i = 2;\n\t\tfor(;i<=k;i++) {\n\t\t\tif(n%i == 0) break;\n\t\t}\n\t\tif(i <=k) return false;\n\t\telse return true;\n\t}\n\t\n\t\tpublic static void main(String[] args) throws Exception {\n\t\t\tScanner scanner = new Scanner(new  BufferedInputStream(System.in));\n\t\t\tint n = scanner.nextInt();\n\t\t\tint count = 0;\n\t\t\tfor(int i=1;i<=n;i++){\n\t\t\t\tif(fun(i)) ++count;\n\t\t\t}\n\t\t\tSystem.out.println(count-1);\n\t\t}\n\t\n\t\n}\n,ACCEPTED,265,16376
1590873404960473088,09eb01e8f9f24922a6c60a1149d505ad1ebb9b0a39ed1101140fe0fd93daa753,2022-11-11 09:05:51,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"",&n);\n    int i = 0;\n    int a[n];\n    \n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    while(i<n)\n    {\n        if(a[i]==0)\n            printf(\""1\\n\"");\n        printf(\""6\\n\"");\n        i++;\n    }\n    return 0;\n}",WRONG_ANSWER,6,344
1590873486480965632,0354b067c4132d4425a90b77482ac717447702274cb7db1282edce56eaf037b3,2022-11-11 09:06:10,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\t int a[10],b[10],n;\n  int i,j,sum,ans,c;\n  i=j=ans=sum=0;\n  scanf(\""%d\"",&n);\n\t for(i=0;i<n;i++)\n     scanf(\""%d\"",&a[i]);\n  for(;j<n;j++)\n     scanf(\""%d\"",&b[j]);\n  i=0;\n  ans=b[0]-a[0];\n  while(i<n){\n     c=b[i]-a[i];\n     sum=sum+c;\n     if(ans<sum)\n     ans=sum;\n    i++;\n  }\n   printf(\""%d\"",ans);\n   return 0;\n}\n",RUNTIME_ERROR,3,316
1590873915503742976,9aa17e95021225dcdd2b01419b021cd002e47f9a7854274df042f64621bd207a,2022-11-11 09:07:53,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""2022\\n\"");\n    return 0;\n}\n",ACCEPTED,3,184
1590874006239121408,73af9d5098be5d450fba728363c8fdbe0f6a5526466daa2f3b74abf1acf75527,2022-11-11 09:08:14,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,3,180
1590874441544962048,73af9d5098be5d450fba728363c8fdbe0f6a5526466daa2f3b74abf1acf75527,2022-11-11 09:09:58,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    printf(\""%d\"",X+Y-Z);\n    return 0;\n}",ACCEPTED,6,360
1590874565616664576,ccc42b8437aa15d1214e4623799ed35cd8ea8087c26cb1b596d51ae4556ea39c,2022-11-11 09:10:28,Python,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"x,y,z=input().split()\nx=int(x)\ny=int(y)\nz=int(z)\n\nprint(x+y-z)\n",ACCEPTED,30,2884
1590874764556697600,3e087b0a196d30fcbb49ca80164c9eb5adf82ae3bb08ec0c141e5728fb180f0d,2022-11-11 09:11:15,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"public static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tSystem.out.print(\""2022\"");\n\t}",COMPILE_ERROR,0,0
1590874863420641280,3e087b0a196d30fcbb49ca80164c9eb5adf82ae3bb08ec0c141e5728fb180f0d,2022-11-11 09:11:39,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"public class Try2 {\n\n\t\tpublic static void main(String[] args) {\n\t\t\t// TODO Auto-generated method stub\n\t\t\tSystem.out.print(\""2022\"");\n\t\t}\n\n}",COMPILE_ERROR,0,0
1590874943326322688,3e087b0a196d30fcbb49ca80164c9eb5adf82ae3bb08ec0c141e5728fb180f0d,2022-11-11 09:11:58,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"package unnamed;\n\npublic class Try2 {\n\n\t\tpublic static void main(String[] args) {\n\t\t\t// TODO Auto-generated method stub\n\t\t\tSystem.out.print(\""2022\"");\n\t\t}\n\n}\n",COMPILE_ERROR,0,0
1590875470168657920,b73a04f1a7af1c2516ca68b38e336912bdf10c4f4bf7bac55e4e0de29dcf3d9d,2022-11-11 09:14:03,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n\nint main(){\n    int A,B,C;\n    scanf(\""%d %d %d\"",&A,&B,&C);\n    if((A>=0&&A<=100)&&(B>=0&&B<=100)&&(C>=0&&C<=100))\n        printf(\""%d\"",A+B-C);\n    return 0;\n}",ACCEPTED,5,196
1590875587596582912,73af9d5098be5d450fba728363c8fdbe0f6a5526466daa2f3b74abf1acf75527,2022-11-11 09:14:31,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include<math.h>\nint main()\n{\n\tint x, n,y;\n\tscanf(\""%d\"",&x);\n\tfor (int i = 0; i < x; i++)\n\t{\n\t\tscanf(\""%d\"",&n);\n\t\ty = pow(6, n);\n\t\ty = y % 10;\n\tprintf(\""%d\\n\"",y);\n\t}\n\treturn 0;\n}",WRONG_ANSWER,6,340
1590875628411359232,3e087b0a196d30fcbb49ca80164c9eb5adf82ae3bb08ec0c141e5728fb180f0d,2022-11-11 09:14:41,Java,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"public class Main {\n\n\t\tpublic static void main(String[] args) {\n\t\t\t// TODO Auto-generated method stub\n\t\t\tSystem.out.print(\""2022\"");\n\t\t}\n\n}",ACCEPTED,69,16640
1590875966442897408,9aa17e95021225dcdd2b01419b021cd002e47f9a7854274df042f64621bd207a,2022-11-11 09:16:02,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z,P;\n    scanf(\""%d%%d%d\"",&X,&Y,&Z);\n    P=X+Y-Z;\n    printf(\""%d\\n\"",P);\n    return 0;\n}\n",WRONG_ANSWER,3,196
1590876368743763968,172db3e4a89a3dc038ec44e9346ef3138ace8cc1576eb636ccaf26fd91d7a145,2022-11-11 09:17:38,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main(){\n    int n;\n    scanf(\""%d\"",&n);\n    while(n --) {\n        int k;\n        scanf(\""%d\"",&k);\n        if(k == 0) printf(\""1\\n\"");\n        else printf(\""6\\n\"");\n    }\n    return 0;\n}",ACCEPTED,14,436
1590876502214905856,b73a04f1a7af1c2516ca68b38e336912bdf10c4f4bf7bac55e4e0de29dcf3d9d,2022-11-11 09:18:09,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,# #include <stdio.h>\n# #include <time.h>\n\n# int main(){\n    \n#     return 0;\n# }\nimport datetime\n\ntoday = datetime.datetime.today()\nyear=today.year\nprint(year),ACCEPTED,19,3156
1590876530635505664,e9a50f3e071443bb6fb229966bff355c178d484f6cc10e5e1fc8dc5a537237ba,2022-11-11 09:18:16,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"printf(\""2022\"");",COMPILE_ERROR,0,0
1590876593722032128,3e087b0a196d30fcbb49ca80164c9eb5adf82ae3bb08ec0c141e5728fb180f0d,2022-11-11 09:18:31,Java,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\n\t\tpublic static void main(String[] args) {\n\t\t\t// TODO Auto-generated method stub\n\t\t\tScanner sc=new Scanner(System.in);\n\t\t\tint x,y,z;\n\t\t\tx=sc.nextInt();\n\t\t\ty=sc.nextInt();\n\t\t\tz=sc.nextInt();\n\t\t\tSystem.out.println(x+y-z);\n\t\t}\n\n}",ACCEPTED,277,16176
1590876682213437440,eeab3421c2b685f7d51b09a289b82fe82ba0d3896984d09aeffb9d022232d887,2022-11-11 09:18:52,Java,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"import java.util.Scanner;\n\npublic class Main{\n\tpublic static void main(String[] args) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint n  = scanner.nextInt();\n\t\tint[] dp = new int[n+1];\n\t\tdp[0]= 0;\n\t\tint[] a = new int[n];\n\t\tint[] b= new int[n];\n\t\tfor(int i=0;i<n;i++) {\n\t\t\ta[i] = scanner.nextInt();\n\t\t}\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tb[i] = scanner.nextInt();\n\t\t}\n\t\tfor(int i=1;i<=n;i++) {\n\t\t\tdp[i] = Math.max(dp[i-1], dp[i-1]+b[i-1]-a[i-1]);\n\t\t}\n\t\tSystem.out.println(dp[n]);\n\t}\n}\n",WRONG_ANSWER,122,16276
1590876850254032896,e9a50f3e071443bb6fb229966bff355c178d484f6cc10e5e1fc8dc5a537237ba,2022-11-11 09:19:32,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"<stadio.h>\nint main(){\nprintf(\""2022\"");\nretrun  0;\n}\n",COMPILE_ERROR,0,0
1590877142752210944,172db3e4a89a3dc038ec44e9346ef3138ace8cc1576eb636ccaf26fd91d7a145,2022-11-11 09:20:42,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n\nint main(){\n    int n;\n    scanf(\""%d\"",&n);\n    int L = 1;\n    for(int i=3;i<=n;i++) {\n        int flag = 0;\n       for(int j=2;j<i;j++) {\n           if(i % j == 0) {\n               flag = 1;\n               break;\n           }\n       }\n        if(flag == 0) L ++;\n    }\n    printf(\""%d\\n\"",L);\n    return 0;\n}",TIME_LIMIT_EXCEEDED,400,324
1590878270717997056,1f15b5b41f9e61f2d767bcb1ae88bef60c94b97dd423bfd2ba9c8c0e8e9d05bb,2022-11-11 09:25:11,Java,300.0,1590528927448293376,1590525945717575680,1049226928954454016,public class Main {\n    public static void main(String[] args) {\n        int year = 2022;\n        System.out.println(year);\n      }\n},ACCEPTED,67,13720
1590878287520378880,e9a50f3e071443bb6fb229966bff355c178d484f6cc10e5e1fc8dc5a537237ba,2022-11-11 09:25:15,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#stadio.h\nint main(){\nprintf(\""2022\"");\nretrun  0;\n}\n",COMPILE_ERROR,0,0
1590878301286105088,1f15b5b41f9e61f2d767bcb1ae88bef60c94b97dd423bfd2ba9c8c0e8e9d05bb,2022-11-11 09:25:18,Java,300.0,1590528927448293376,1590525945717575680,1049226928954454016,public class Main {\n    public static void main(String[] args) {\n        int year = 2022;\n        System.out.println(year);\n      }\n},ACCEPTED,69,17140
1590878392986177536,02f3cf9a5ba39e00e2644b9392922d3ea3ea233f83c612c7dbd879f319ea2bdc,2022-11-11 09:25:40,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""2022\\n\"");\n    return 0;\n}\n",ACCEPTED,3,320
1590878425236156416,eccafb49a6a53e0f6a70df305afa2fa1832182ed0fa3233a27357cbd42f50129,2022-11-11 09:25:48,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint a,i,j,cont;\n\tscanf(\""%d\"",&a); \n\tfor(i=2;i<=a;i++)\n\t\t{\n\t\tfor(j=2;j<=i;j++)\n\t\t\tif(i%j==0)\n\t\t\t\tbreak;\n\t\tif(i==j)\n\t\t\tcont++;\n\t\t}\n    printf(\""%d\"",cont);\n    return 0;\n}",TIME_LIMIT_EXCEEDED,400,188
1590878470882791424,e9a50f3e071443bb6fb229966bff355c178d484f6cc10e5e1fc8dc5a537237ba,2022-11-11 09:25:59,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<sdio.h>\nint main(){\nprintf(\""2022\"");\nretrun  0;\n}\n",COMPILE_ERROR,0,0
1590878520144867328,e9a50f3e071443bb6fb229966bff355c178d484f6cc10e5e1fc8dc5a537237ba,2022-11-11 09:26:10,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main(){\nprintf(\""2022\"");\nretrun  0;\n}\n",COMPILE_ERROR,0,0
1590878580073082880,e9a50f3e071443bb6fb229966bff355c178d484f6cc10e5e1fc8dc5a537237ba,2022-11-11 09:26:25,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main(){\nprint(\""2022\"");\nretrun  0;\n}\n",COMPILE_ERROR,0,0
1590878840837177344,e9a50f3e071443bb6fb229966bff355c178d484f6cc10e5e1fc8dc5a537237ba,2022-11-11 09:27:27,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}\n",ACCEPTED,3,188
1590878877973524480,3e087b0a196d30fcbb49ca80164c9eb5adf82ae3bb08ec0c141e5728fb180f0d,2022-11-11 09:27:36,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\n\t\tpublic static void main(String[] args) {\n\t\t\t// TODO Auto-generated method stub\n\t\t\tScanner sc=new Scanner(System.in);\n\t\t\tint cnt=1;\n\t\t\tcnt=sc.nextInt();\n\t\t\tfor(int i=1;i<=cnt-1;i++) {\n\t\t\t\tSystem.out.println((Math.pow(6,sc.nextInt()))%10);\n\t\t\t}\n\t\t\tSystem.out.print((Math.pow(6,sc.nextInt()))%10);\n\t\t\tsc.close();\n\t\t}\n}",TIME_LIMIT_EXCEEDED,50,14472
1590879105011224576,172db3e4a89a3dc038ec44e9346ef3138ace8cc1576eb636ccaf26fd91d7a145,2022-11-11 09:28:30,C++,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n\nconst int N = 1e5 + 10;\nint a[N];\n\nint main(){\n    int n;\n    scanf(\""%d\"",&n);\n    int L = 0;\n    for(int i=2;i<=n;i++) {\n        if(a[i] == 0){\n       for(int j=i*2;j<=n;j+=i) {\n           a[j] = 1;\n       }\n        }\n    }\n    for(int i=2;i<=n;i++) {\n        if(a[i] == 0) L ++;\n    }\n    printf(\""%d\\n\"",L);\n    return 0;\n}",ACCEPTED,7,564
1590879165270790144,e9a50f3e071443bb6fb229966bff355c178d484f6cc10e5e1fc8dc5a537237ba,2022-11-11 09:28:44,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b,c;\n    scanf(\""%d%d%d\"",&a,&b,&c);\n    printf(\""%d\"",a+b-c);\n    return 0;\n}\n",ACCEPTED,8,460
1590879222837587968,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 09:28:58,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a;\n    int i,result=1;\n    int j[100]={0};\n    scanf(\""%d\"",&a);\n    int n[100]={0};\n    for(i=0;i<a;i++){\n    scanf(\""%d\"",&n[i]);}\n    int z;\n    for(z=0;z<a;z++) {\n        for (i = 0; i < a; i++) {\n            result *= 6;\n        }\n        for (i = 0; i < a; i++) {\n            j[z] = result % 10;\n        }\n    }\n    for(i=0;i<a;i++) {\n        printf(\""%d\\n\"", j[i]);\n    }\n    return 0;\n}",WRONG_ANSWER,6,344
1590879456225464320,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 09:29:54,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a;\n    int i,result=1;\n    int j[100]={0};\n    scanf(\""%d\"",&a);\n    int n[100]={0};\n    for(i=0;i<a;i++) {\n        scanf(\""%d\"", &n[i]);\n    }\n    int z;\n    for(z=0;z<a;z++) {\n        for (i = 0; i < a; i++) {\n            result *= 6;\n        }\n        for (i = 0; i < a; i++) {\n            j[z] = result % 10;\n        }\n    }\n    for(i=0;i<a;i++) {\n        printf(\""%d\\n\"", j[i]);\n    }\n    return 0;\n}",WRONG_ANSWER,4,360
1590879507056209920,172db3e4a89a3dc038ec44e9346ef3138ace8cc1576eb636ccaf26fd91d7a145,2022-11-11 09:30:06,C++,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n\nint main(){\n    int a,b,c;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    printf(\""%d\"",a+b-c);\n    return 0;\n}",ACCEPTED,7,188
1590879620755423232,172db3e4a89a3dc038ec44e9346ef3138ace8cc1576eb636ccaf26fd91d7a145,2022-11-11 09:30:33,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,print(2022);,ACCEPTED,15,2892
1590880063967531008,3e087b0a196d30fcbb49ca80164c9eb5adf82ae3bb08ec0c141e5728fb180f0d,2022-11-11 09:32:19,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\n\t\tpublic static void main(String[] args) {\n\t\t\t// TODO Auto-generated method stub\n\t\t\tScanner sc=new Scanner(System.in);\n\t\t\tint cnt=0;\n\t\t\tcnt=sc.nextInt();\n\t\t\tfor(int i=1;i<=cnt-1;i++) {\n\t\t\t\tSystem.out.println((int)(Math.pow(6,sc.nextInt()))%10);\n\t\t\t}\n\t\t\tSystem.out.print((int)(Math.pow(6,sc.nextInt()))%10);\n\t\t\tsc.close();\n\t\t}\n}",TIME_LIMIT_EXCEEDED,50,14556
1590880126907232256,281adcca8943f9f4c0ced14f1ceffe157a34fca39f3cb864eb95e400944e38a8,2022-11-11 09:32:34,Java,300.0,1590734963702620160,1590734503495200768,1049226928954454016,\nimport java.util.*;\nclass Main{\n    public static void main(String[] args){\n        Scanner scan=new Scanner(System.in);\n\n        int a=scan.nextInt();\n        int[] arr=new int[a];\n        int[] enegy=new int[a];\n        for(int i=0;i<a;i++){\n            arr[i]=scan.nextInt();\n        }\n        for(int i=0;i<a;i++){\n            enegy[i]=scan.nextInt();\n        }\n        int[] left=new int[a];\n        for(int i=0;i<a;i++){\n            left[i]=enegy[i]-arr[i];\n        }\n        int ans=left[0];\n        for(int i=1;i<a;i++){\n            if(left[i-1]>0){\n                left[i]+=left[i-1];\n            }else{\n                left[i]+=0;\n            }\n            if(left[i]>ans){\n                ans=left[i];\n            }\n        }\n        System.out.print(ans);\n    }\n}\n,ACCEPTED,135,18752
1590880169663967232,6383c93cbdef4af3eda29400a925819f16ad4afc8368e604ccd580cba7055bdd,2022-11-11 09:32:44,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include <math.h>\n\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    int i,k;\n    int cnt=0;\n    for(i=2;i<=n;i++){\n        int isPrime=1;\n        for(k=2;k<=sqrt(i);k++){\n            if(i%k==0){\n                isPrime = 0;\n                break;\n            }\n        }\n         if(isPrime==1){\n            cnt++;\n        }\n    }\n    printf(\""%d\"",cnt);\n    return 0;\n}",ACCEPTED,13,380
1590880338832855040,02f3cf9a5ba39e00e2644b9392922d3ea3ea233f83c612c7dbd879f319ea2bdc,2022-11-11 09:33:24,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z,P=0;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    if(0<=X<=100,0<=Y<=100,0<=Z<=100)\n        P=X+Y-Z;\n    printf(\""%d\"",P);\n    return 0;\n}\n",ACCEPTED,6,340
1590880378561298432,9aa17e95021225dcdd2b01419b021cd002e47f9a7854274df042f64621bd207a,2022-11-11 09:33:34,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z,P=0;\n    scanf(\""%d%%d%d\"",&X,&Y,&Z);\n    P=X+Y-Z;\n    printf(\""%d\"",P);\n    return 0;\n}\n",WRONG_ANSWER,3,476
1590880467551850496,e9a50f3e071443bb6fb229966bff355c178d484f6cc10e5e1fc8dc5a537237ba,2022-11-11 09:33:55,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n    int c,i,d;\n    scanf(\""%d\"",&c);\n    int  a[c];\n    for(i=0;i<c;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n        d=pow(6,a[i]);\n        d=d%10;\n        printf(\""%d\"",&d);\n    }\n    return 0;\n}\n",WRONG_ANSWER,7,368
1590880520710459392,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 09:34:07,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a;\n    int i,result=1;\n    int j[100]={0};\n    scanf(\""%d\"",&a);\n    int n[100]={0};\n    for(i=0;i<a;i++) {\n        scanf(\""%d\"", &n[i]);\n    }\n    int z;\n    for(z=0;z<a;z++) {\n        for (i = 0; i < a; i++) {\n            result *= 6;\n        }\n        for (i = 0; i < a; i++) {\n            j[z] = result % 10;\n        }\n    }\n    for(i=0;i<a;i++) {\n        printf(\""%d\"", j[i]);\n        if(i<2){\n        printf(\""\\n\"");\n    }\n    }\n    return 0;\n}",WRONG_ANSWER,3,348
1590880748184317952,e9a50f3e071443bb6fb229966bff355c178d484f6cc10e5e1fc8dc5a537237ba,2022-11-11 09:35:02,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n    int c,i,d;\n    scanf(\""%d\"",&c);\n    int  a[c];\n    for(i=0;i<c;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n        d=pow(6,a[i]);\n        d=d%10;\n        printf(\""%d\"",d);\n    }\n    return 0;\n}\n",WRONG_ANSWER,7,336
1590880764886036480,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 09:35:06,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a;\n    int i,result=1;\n    int j[100]={0};\n    scanf(\""%d\"",&a);\n    int n[100]={0};\n    for(i=0;i<a;i++) {\n        scanf(\""%d\"", &n[i]);\n    }\n    int z;\n    for(z=0;z<a;z++) {\n        for (i = 0; i < a; i++) {\n            result *= 6;\n        }\n        for (i = 0; i < a; i++) {\n            j[z] = result % 10;\n        }\n    }\n    for(i=0;i<a;i++) {\n        printf(\""%d\"", j[i]);\n        if(i<2){\n        printf(\""\\n\"");\n    }\n    }\n    return 0;\n}",WRONG_ANSWER,3,492
1590880786721583104,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 09:35:11,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a;\n    int i,result=1;\n    int j[100]={0};\n    scanf(\""%d\"",&a);\n    int n[100]={0};\n    for(i=0;i<a;i++) {\n        scanf(\""%d\"", &n[i]);\n    }\n    int z;\n    for(z=0;z<a;z++) {\n        for (i = 0; i < a; i++) {\n            result *= 6;\n        }\n        for (i = 0; i < a; i++) {\n            j[z] = result % 10;\n        }\n    }\n    for(i=0;i<a;i++) {\n        printf(\""%d\"", j[i]);\n        if(i<2){\n        printf(\""\\n\"");\n    }\n    }\n    return 0;\n}",WRONG_ANSWER,4,328
1590880798515990528,eeab3421c2b685f7d51b09a289b82fe82ba0d3896984d09aeffb9d022232d887,2022-11-11 09:35:14,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,public class Main{\n    public static void main(String[] args){\n        Scanner Scanner = new Scanner(System.in);\n        int n = Scanner.nextInt();\n        for(int i=1;i<=n;i++)\n            System.out.println(6);\n    }\n}\n    ,COMPILE_ERROR,0,0
1590880874571304960,eeab3421c2b685f7d51b09a289b82fe82ba0d3896984d09aeffb9d022232d887,2022-11-11 09:35:32,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\npublic class Main{\n    public static void main(String[] args){\n        Scanner Scanner = new Scanner(System.in);\n        int n = Scanner.nextInt();\n        for(int i=1;i<=n;i++)\n            System.out.println(6);\n    }\n}\n    ,TIME_LIMIT_EXCEEDED,50,13876
1590880898415923200,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 09:35:37,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a;\n    int i,result=1;\n    int j[100]={0};\n    scanf(\""%d\"",&a);\n    int n[100]={0};\n    for(i=0;i<a;i++) {\n        scanf(\""%d\"", &n[i]);\n    }\n    int z;\n    for(z=0;z<a;z++) {\n        for (i = 0; i < a; i++) {\n            result *= 6;\n        }\n        for (i = 0; i < a; i++) {\n            j[z] = result % 10;\n        }\n    }\n    for(i=0;i<a;i++) {\n        printf(\""%d\"", j[i]);\n        if(i<2){\n        printf(\""\\n\"");\n    }\n    }\n    return 0;\n}",WRONG_ANSWER,4,476
1590880969068969984,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 09:35:54,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a;\n    int i,result=1;\n    int j[100]={0};\n    scanf(\""%d\"",&a);\n    int n[100]={0};\n    for(i=0;i<a;i++) {\n        scanf(\""%d\"", &n[i]);\n    }\n    int z;\n    for(z=0;z<a;z++) {\n        for (i = 0; i < a; i++) {\n            result *= 6;\n        }\n        for (i = 0; i < a; i++) {\n            j[z] = result % 10;\n        }\n    }\n    for(i=0;i<a;i++) {\n        printf(\""%d\"", j[i]);\n        if(i<3){\n        printf(\""\\n\"");\n    }\n    }\n    return 0;\n}",WRONG_ANSWER,3,356
1590881350905827328,eeab3421c2b685f7d51b09a289b82fe82ba0d3896984d09aeffb9d022232d887,2022-11-11 09:37:25,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nvoid main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\twhile(n--)\n\t\tprintf(\""6\\n\"");\n}\n",WRONG_ANSWER,11,344
1590881398225965056,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-11 09:37:37,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<math.h>\n#include <stdio.h>\nint main()\n{\n    int n,i=2,j,temp=0;\n    scanf(\""%d\"",&n);\n     for(j=2;j<=i;j++)\n     {\n       if(i>n)\n        break;\n      if(i%j==0&&j==i)\n      {\n       ++temp;\n       j=1;\n       ++i;\n      }\n      else if(i%j==0)\n      {\n       ++i;\n       j=1;\n      }\n     }\n    printf(\""%d\"",temp);\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,400,308
1590881413379985408,281adcca8943f9f4c0ced14f1ceffe157a34fca39f3cb864eb95e400944e38a8,2022-11-11 09:37:40,Java,300.0,1590528927448293376,1590525945717575680,1049226928954454016,class Main{\n    public static void main(String[] args){\n        System.out.println(2022);\n    }\n},ACCEPTED,69,13864
1590881899780812800,281adcca8943f9f4c0ced14f1ceffe157a34fca39f3cb864eb95e400944e38a8,2022-11-11 09:39:36,Java,300.0,1590524835191705600,1572865591226855424,1049226928954454016,import java.util.*;\nclass Main{\n    public static void main(String[] args){\n        Scanner scan=new Scanner(System.in);\n        int x=scan.nextInt();\n        int y=scan.nextInt();\n        int z=scan.nextInt();\n        System.out.println(x+y-z);\n    }\n},ACCEPTED,259,19228
1590881902813294592,09eb01e8f9f24922a6c60a1149d505ad1ebb9b0a39ed1101140fe0fd93daa753,2022-11-11 09:39:37,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#pragma warning (disable:4996)\n#include<stdio.h>\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"", &n);\n    int i = 0;\n    int a[10]={0};\n\n    for (i = 0; i < n; i++)\n    {\n        scanf(\""%d\"", &a[i]);\n        getchar();\n    }\n    for (i = 0; i < n; i++)\n    {\n        if (a[i] == 0)\n            printf(\""1\\n\"");\n        printf(\""6\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,13,356
1590882002327375872,eeab3421c2b685f7d51b09a289b82fe82ba0d3896984d09aeffb9d022232d887,2022-11-11 09:40:01,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nvoid main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n    if(n == 0)\n        printf(\""1\\n\"");\n\twhile(n--)\n\t\tprintf(\""6\\n\"");\n}\n",WRONG_ANSWER,12,352
1590882041770610688,cf568c7ddc8b221335f880bfbaac4634294e65481e738a2e032c1ab9a84d576f,2022-11-11 09:40:10,Java,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"class Main{  //Main类的名称是固定的\n    public static void main(String[] args) {  //主函数\n        //要运行的代码\n        System.out.println(\""2022\"");\n    }\n}",ACCEPTED,72,14008
1590882248465907712,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 09:40:59,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main() {\n    int a,i;\n    scanf(\""%d\"",&a);\n    int b[100]={0};\n    for(i=0;i<a;i++){\n        scanf(\""%d\"",&b[i]);\n    }\n    for(i=0;i<a;i++) {\n        printf(\""6\\n\"");\n    }\n    return 0;\n}\n",WRONG_ANSWER,10,356
1590882250596614144,e9a50f3e071443bb6fb229966bff355c178d484f6cc10e5e1fc8dc5a537237ba,2022-11-11 09:41:00,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n    int c,i,d;\n    int  a[10];\n    scanf(\""%d\"",&c);\n    for(i=0;i<c;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<c;i++)\n    {\n        d=pow(6,a[i]);\n        d=d%10;\n        printf(\""%d\\n\"",d);\n    }\n    return 0;\n}\n",WRONG_ANSWER,7,384
1590882321107058688,0354b067c4132d4425a90b77482ac717447702274cb7db1282edce56eaf037b3,2022-11-11 09:41:17,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main()\n{\n  int a[10],b[10],n;\n  int i,j,sum,ans,c;\n  i=j=ans=sum=0;\n  scanf(\""%d\"",&n);\n  for(i=0;i<n;i++)\n     scanf(\""%d\"",&a[i]);\n  for(;j<n;j++)\n     scanf(\""%d\"",&b[j]);\n  i=0;\n  ans=b[0]-a[0];\n  while(i<n){\n     c=b[i]-a[i];\n     sum=sum+c;\n     if(ans<=sum)\n        ans=sum;\n     else\n        break;\n     i++;\n   }\n   printf(\""%d\"",ans);\n}\n",RUNTIME_ERROR,4,332
1590882415025917952,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 09:41:39,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main() {\n    int a,i;\n    scanf(\""%d\"",&a);\n    int b[100]={0};\n    for(i=0;i<a;i++){\n        scanf(\""%d\"",&b[i]);\n    }\n    for(i=0;i<a;i++) {\n        printf(\""6\\n\"");\n    }\n    return 0;\n}\n",WRONG_ANSWER,9,464
1590882812046127104,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 09:43:14,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#define _CRT_SECURE_NO_WARNINGS\n#include <stdio.h>\n\nint main() {\n    int a,i;\n    scanf(\""%d\"",&a);\n    int b[100]={0};\n    for(i=0;i<a;i++){\n        scanf(\""%d\"",&b[i]);\n    }\n    for(i=0;i<a;i++) {\n        printf(\""6\\n\"");\n    }\n    return 0;\n}\n",WRONG_ANSWER,12,364
1590882943227179008,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 09:43:45,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#define _CRT_SECURE_NO_WARNINGS\n#include <stdio.h>\n\nint main() {\n    int a,i;\n    scanf_s(\""%d\"",&a);\n    int b[100]={0};\n    for(i=0;i<a;i++){\n        scanf_s(\""%d\"",&b[i]);\n    }\n    for(i=0;i<a;i++) {\n        printf(\""6\\n\"");\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590883004090748928,1f15b5b41f9e61f2d767bcb1ae88bef60c94b97dd423bfd2ba9c8c0e8e9d05bb,2022-11-11 09:44:00,Java,0.0,1590524835191705600,1572865591226855424,1049226928954454016,class Main{\n  public static void main(String [] args) {\n       int X=8;\n       int Y=7;\n       int Z=3;\n       int num=0;\n  if(X >= 0 && X <= 100 && Y >= 0 && Y <= 100 && Z >= 0 && Z <= 100){\n            num = X+Y-Z;\n            System.out.println(num);\n       }\n    }\n},WRONG_ANSWER,73,14380
1590883100211589120,281adcca8943f9f4c0ced14f1ceffe157a34fca39f3cb864eb95e400944e38a8,2022-11-11 09:44:22,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.*;\nclass Main{\n    public static void main(String[] args){\n        Scanner scan=new Scanner(System.in);\n        int x=scan.nextInt();\n        for(int i=0;i<x;i++){\n            int a=scan.nextInt();\n                a= (int) Math.pow(6,a);\n                System.out.println(a%10);\n        }\n    }\n}",TIME_LIMIT_EXCEEDED,50,14132
1590883135875756032,09eb01e8f9f24922a6c60a1149d505ad1ebb9b0a39ed1101140fe0fd93daa753,2022-11-11 09:44:31,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#pragma warning (disable:4996)\n#include<stdio.h>\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"", &n);\n    int i = 0;\n    int a[10]={0};\n\n    for (i = 0; i < n; i++)\n    {\n        scanf(\""%d\"", &a[i]);\n        getchar();\n    }\n    for (i = 0; i < n; i++)\n    {\n        if (a[i] == 0)\n            printf(\""1\"");\n        printf(\""6\"");\n        if (i==n-1)\n            continue;\n        printf(\""\\n\"");\n        \n    }\n    return 0;\n}",WRONG_ANSWER,10,332
1590883262610866176,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 09:45:01,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a;\n    int i,result=1;\n    int j[100]={0};\n    scanf(\""%d\"",&a);\n    int n[100]={0};\n    for(i=0;i<a;i++) {\n        scanf(\""%d\"", &n[i]);\n    }\n    int z;\n    for(z=0;z<a;z++) {\n        for (i = 0; i < a; i++) {\n            result *= 6;\n        }\n        for (i = 0; i < a; i++) {\n            j[z] = result % 10;\n        }\n    }\n    for(i=0;i<a;i++) {\n        printf(\""%d\"", j[i]);\n        if(i<2){\n        printf(\""\\n\"");\n    }\n    }\n    return 0;\n}",WRONG_ANSWER,4,328
1590883300321853440,1f15b5b41f9e61f2d767bcb1ae88bef60c94b97dd423bfd2ba9c8c0e8e9d05bb,2022-11-11 09:45:10,Java,0.0,1590524835191705600,1572865591226855424,1049226928954454016,class Main{\n  public static void main(String [] args) {\n       int X=8;\n       int Y=7;\n       int Z=3;\n       int num=0;\n  if(X >= 0 && X <= 100 && Y >= 0 && Y <= 100 && Z >= 0 && Z <= 100){\n            num = X+Y-Z;\n            System.out.println(num);\n       }\n    }\n},WRONG_ANSWER,72,13952
1590883315580710912,e00ee38c44b3d45b1b15c51030bc5b68071f01213b1bbd9af859b26cc32471ac,2022-11-11 09:45:14,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include＜stdio.h＞\nint main()\n{\nint a\nscanf(\""%d\"", a);\na = 202\n\nprintf(\""%d\"",a);\n return 0;\n}",COMPILE_ERROR,0,0
1590883357314060288,7935e8f5cb04027f4d30ac84a997e2d03e946e112c1cb17f1a4f943d8b0b54bf,2022-11-11 09:45:24,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<iostream>\n#include<algorithm>\n#include<stdio.h>\n#include<math.h>\nusing namespace std;\n\nint main(){\n    int n,i,j,t,k=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n    {\n        t=0;\n        for(j=2;j<i;j++)\n        {\n            if(i%j==0&&i/j!=1)\n                t=1;\n        }\n        if(t==0)\n            k++;\n    }\n    printf(\""%d\"",k);\n\treturn 0;\n\n}\n\n",TIME_LIMIT_EXCEEDED,400,444
1590883361676111872,e00ee38c44b3d45b1b15c51030bc5b68071f01213b1bbd9af859b26cc32471ac,2022-11-11 09:45:25,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include＜stdio.h＞\nint main()\n{\nint a\nscanf(\""%d\"", a);\na = 2022\n\nprintf(\""%d\"",a);\n return 0;\n}",COMPILE_ERROR,0,0
1590883456710676480,cf568c7ddc8b221335f880bfbaac4634294e65481e738a2e032c1ab9a84d576f,2022-11-11 09:45:47,Java,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"import java.io.*;\nimport java.util.Scanner;\nclass Main{  //Main类的名称是固定的\n    public static void main(String[] args) {  //主函数\n        //要运行的代码\n        Scanner sc=new Scanner(System.in);\n        int X,Y,Z;\n        X=sc.nextInt();\n        Y=sc.nextInt();\n        Z=sc.nextInt();\n        System.out.println(X+Y-Z);\n    }\n}",ACCEPTED,241,18776
1590883608439599104,7935e8f5cb04027f4d30ac84a997e2d03e946e112c1cb17f1a4f943d8b0b54bf,2022-11-11 09:46:24,C++,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<iostream>\n#include<algorithm>\n#include<stdio.h>\n#include<math.h>\nusing namespace std;\n\nint main(){\n    int n,i,j,t,k=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n    {\n        t=0;\n        for(j=2;j<=sqrt(i);j++)\n        {\n            if(i%j==0&&i/j!=1)\n                t=1;\n        }\n        if(t==0)\n            k++;\n    }\n    printf(\""%d\"",k);\n\treturn 0;\n\n}\n",ACCEPTED,76,424
1590883784138993664,e00ee38c44b3d45b1b15c51030bc5b68071f01213b1bbd9af859b26cc32471ac,2022-11-11 09:47:05,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,3,472
1590884184170758144,6a6dc7e644e57bb2c20b20d39bd4d9541bdebf6415e03e7c13707572c054673e,2022-11-11 09:48:41,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{   int n=2022;\n    printf(\""%d\"",n);\n    return 0;\n}\n",ACCEPTED,3,196
1590884590221332480,eeab3421c2b685f7d51b09a289b82fe82ba0d3896984d09aeffb9d022232d887,2022-11-11 09:50:18,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nvoid main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n    int a;\n\twhile(n--){\n        scanf(\""%d\"",&a);\n        if(a == 0)\n            printf(\""1\\n\"");\n        else\n\t\tprintf(\""6\\n\"");\n    }\n}\n",ACCEPTED,10,384
1590884611025080320,6383c93cbdef4af3eda29400a925819f16ad4afc8368e604ccd580cba7055bdd,2022-11-11 09:50:23,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include <math.h>\n\nint main()\n{\n    double x = 6;\n    double y;\n    scanf(\""%lf\"",&y);\n    int res = pow(x,y);\n    printf(\""%d\\n\"",res);\n    int k;\n    k = res%10;\n    printf(\""%d\"",k);\n\n    return 0;\n}\n",WRONG_ANSWER,4,340
1590885030166069248,e9a50f3e071443bb6fb229966bff355c178d484f6cc10e5e1fc8dc5a537237ba,2022-11-11 09:52:03,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n    int c,i,d;\n    int  a[10];\n    scanf(\""%d\"",&c);\n    for(i=0;i<c;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<c;i++)\n    {\n        if(a[i]==0)\n            printf(\""1\\n\"");\n        else printf(\""6\\n\"");\n    }\n    return 0;\n}\n",ACCEPTED,11,348
1590885091159638016,6383c93cbdef4af3eda29400a925819f16ad4afc8368e604ccd580cba7055bdd,2022-11-11 09:52:17,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include <math.h>\n\nint main()\n{\n    double x = 6;\n    double y;\n    scanf(\""%lf\"",&y);\n    int res = pow(x,y);\n    int k;\n    k = res%10;\n    printf(\""%d\"",k);\n\n    return 0;\n}\n",WRONG_ANSWER,4,220
1590885546812026880,6383c93cbdef4af3eda29400a925819f16ad4afc8368e604ccd580cba7055bdd,2022-11-11 09:54:06,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include <math.h>\n\nint main()\n{\n    double x = 6;\n    double t;\n    scanf(\""%lf\"",&t);\n    int res = pow(x,t);\n    int n;\n    n = res%10;\n    printf(\""%d\"",n);\n\n    return 0;\n}\n",WRONG_ANSWER,5,344
1590885632069664768,6383c93cbdef4af3eda29400a925819f16ad4afc8368e604ccd580cba7055bdd,2022-11-11 09:54:26,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include <math.h>\n\nint main()\n{\n    double x = 6;\n    int t;\n    scanf(\""%d\"",&t);\n    int res = pow(x,t);\n    int n;\n    n = res%10;\n    printf(\""%d\"",n);\n\n    return 0;\n}\n",WRONG_ANSWER,5,480
1590885722247180288,ccc42b8437aa15d1214e4623799ed35cd8ea8087c26cb1b596d51ae4556ea39c,2022-11-11 09:54:48,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"def prime(p):\n    for i in range(2,p):\n        if p%i==0:\n            return False\n    return True\ndef PrimeSum(n):\n    sums=0\n    for i in range(2,n+1):\n        if prime(i)==True:\n            sums+=1\n    return sums\na=eval(input())\nprint(PrimeSum(a))",TIME_LIMIT_EXCEEDED,400,2888
1590885749342404608,3e087b0a196d30fcbb49ca80164c9eb5adf82ae3bb08ec0c141e5728fb180f0d,2022-11-11 09:54:54,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\n\t\tpublic static void main(String[] args) throws IOException {\n\t\t\t// TODO Auto-generated method stub\n\t\t\tBufferedReader bf=new BufferedReader(new InputStreamReader(System.in));\n\t\t\tint cnt=0;\n\t\t\tcnt=Integer.valueOf(bf.readLine());\n\t\t\tString[] temp=bf.readLine().split(\"" \"");\n\t\t\tint i=0;\n\t\t\tfor(;i<=cnt-2;i++) {\n\t\t\t\tSystem.out.println((int)(Math.pow(6,Double.valueOf(temp[i])))%10);\n\t\t\t}\n\t\t\tSystem.out.print((int)(Math.pow(6,Double.valueOf(temp[i])))%10);\n\t\t\tbf.close();\n\t\t}\n}",TIME_LIMIT_EXCEEDED,50,13172
1590886568997490688,6383c93cbdef4af3eda29400a925819f16ad4afc8368e604ccd580cba7055bdd,2022-11-11 09:58:09,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include <math.h>\n\nint main()\n{\n    int x = 6;\n    int t;\n    scanf(\""%d\"",&t);\n    int res = pow(x,t);\n    int n;\n    n = res%10;\n    printf(\""%d\"",n);\n\n    return 0;\n}\n",WRONG_ANSWER,4,192
1590886719661080576,ccc42b8437aa15d1214e4623799ed35cd8ea8087c26cb1b596d51ae4556ea39c,2022-11-11 09:58:45,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"def prime(p):\n    for i in range(2,p):\n        if p%i==0:\n            return False\n    return True\ndef PrimeSum(n):\n    sums=0\n    for i in range(2,n+1):\n        if prime(i)==True:\n            sums+=1\n    return sums\na=eval(input())\nprint(PrimeSum(a))",TIME_LIMIT_EXCEEDED,400,2892
1590886877572435968,d9e00d995e65b04cda3ddef6baec19225e4351002ab4efa981f62d78919a481b,2022-11-11 09:59:23,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int i,m;\n    int n;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&m);\n        printf(\""%d\"",(int)pow(6,m)%10);\n        if(i!=n-1) printf(\""\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,8,468
1590886913542787072,977c9d350f87cd8386fa1f88cca886d6ff43821830806e60da6d6b36dc77cd13,2022-11-11 09:59:32,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""2022\"");\n}",ACCEPTED,3,196
1590887018278748160,ce1bb8e96385d94dfdb2bd028407e2ffb5a64494440cd7964d6624a83809dae6,2022-11-11 09:59:57,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\n\nint main(void)\n\n{\n\nprintf(\""%d\"",2022);\n\nreturn0;\n\n}",COMPILE_ERROR,0,0
1590887034888171520,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 10:00:01,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h> \nint main(){\n printf(\""2022\"");\n\n}\n",ACCEPTED,4,336
1590887071638687744,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 10:00:09,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h> \nint main(){\n printf(\""2022\"");\n\n}\n",ACCEPTED,3,336
1590887084125130752,09eb01e8f9f24922a6c60a1149d505ad1ebb9b0a39ed1101140fe0fd93daa753,2022-11-11 10:00:12,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#pragma warning (disable:4996)\n#include<stdio.h>\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"", &n);\n    int i = 0;\n\tchar ch;\n    int arr[] = { 0 };\n\twhile (i<n)\n\t{\n        scanf(\""%d\"", &arr[i]);\n\t\tch = getchar();\n\t\tif (ch == '\\n')\n\t\t\tbreak;\n        i++;\n\t}\n\n    for (i = 0; i < n; i++)\n    {\n        if(arr[i]==0)\n            printf(\""1\\n\"");\n        printf(\""6\\n\"");\n    }\n    return 0;\n}",TIME_LIMIT_EXCEEDED,4,452
1590887093021224960,ce1bb8e96385d94dfdb2bd028407e2ffb5a64494440cd7964d6624a83809dae6,2022-11-11 10:00:14,C++,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\n\nint main(void)\n\n{\n\nprintf(\""%d\"",2022);\n\nreturn0;\n\n}",COMPILE_ERROR,0,0
1590887108196237312,129ddfe9d2d4553f365faf2fdc5e2f0c271b2e342a4cff13802dda8ef8b3d1c2,2022-11-11 10:00:18,Java,300.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner s1 = new Scanner(System.in);\n        int a = s1.nextInt();\n        int s = 0;\n        int k;\n        for (int i = 3; i <= a; i++) {\n            k = (int)Math.sqrt(i);\n            int g = 1;\n            for (int j = 2; j <=k; j++) {\n                if (i % j == 0) {\n                    g = 0;\n                    break;\n                }\n            }\n            if (g == 1) {\n                s++;\n            }\n        }\n        System.out.println(s+1);\n    }\n},ACCEPTED,269,19476
1590887127007670272,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 10:00:22,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main() {\n    int a,i;\n        scanf(\""%d\"",&a);\n    int b[100]={0};\n    for(i=0;i<a;i++){\n            scanf(\""%d\"",&b[i]);\n    }\n\n    for(i=0;i<a;i++) {\n        if(scanf(\""%d\"",&a)){\n        printf(\""6\"");}\n        if(i<2){\n            printf(\""\\n\"");\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,10,496
1590887134259646464,ccc42b8437aa15d1214e4623799ed35cd8ea8087c26cb1b596d51ae4556ea39c,2022-11-11 10:00:24,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"def prime(p):\n    for i in range(2,p):\n        if p%i==0:\n            return False\n    return True\ndef PrimeSum(n):\n    \n    return sums\na=eval(input())\nsums=0\nfor i in range(2,a+1):\n    if prime(i)==True:\n        sums+=1\nprint(sums)",TIME_LIMIT_EXCEEDED,400,3060
1590887213116731392,73af9d5098be5d450fba728363c8fdbe0f6a5526466daa2f3b74abf1acf75527,2022-11-11 10:00:43,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include<math.h>\nint main()\n{\n\tint t,n,y;\n\tscanf(\""%d\"",&t);\n\tfor (int i = 0; i < t; i++)\n\t{\n\t\tscanf(\""%d\"",&n);\n\t\ty = pow(6, n);\n\t\ty = y % 10;\n\tprintf(\""%d\\n\"",y);\n\t}\n\treturn 0;\n}",WRONG_ANSWER,9,312
1590887254011215872,e9a50f3e071443bb6fb229966bff355c178d484f6cc10e5e1fc8dc5a537237ba,2022-11-11 10:00:53,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint shusu();\nint main()\n{\n    int a,b,i;\n    b=0;\n    scanf(\""%d\"",&a);\n    for(i=2;i<a;i++)\n    {\n        if(shusu(i)) b++;\n    }\n    printf(\""%d\"",b);\n}\nint shusu(int a){\n    int i,c;\n    c=1;\n for(i=2;i<a;i++)\n {\n     if(a%i==0) c=0;\n }\n if(c==0) return 0;\n else   return 1;\n}\n",TIME_LIMIT_EXCEEDED,400,332
1590887281131585536,b73a04f1a7af1c2516ca68b38e336912bdf10c4f4bf7bac55e4e0de29dcf3d9d,2022-11-11 10:00:59,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n\nint main(){\n    int n;\n    int count=0;\n    int i,j;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++){\n        for(j=2;j<i;j++){\n            if(i%j==0){\n                break;\n            }\n        }\n        if(j==i)\n            count++;\n            \n    }\n//    printf(\""%d\"",count);\n    printf(\""%d\"",count);\n    \n            \n    \n    return 0;\n}",TIME_LIMIT_EXCEEDED,400,192
1590887292103864320,1f15b5b41f9e61f2d767bcb1ae88bef60c94b97dd423bfd2ba9c8c0e8e9d05bb,2022-11-11 10:01:02,Java,0.0,1590524835191705600,1572865591226855424,1049226928954454016,class Main{\n    public static void main(String [] args) {\n    int X=8;\n    int Y=7;\n    int Z=3;\n    int num=0;\n    if(X >= 0 && X <= 100 && Y >= 0 && Y <= 100 && Z >= 0 && Z<= 100){\n        num = X+Y-Z;\n        System.out.println(num);\n    }\n}\n},WRONG_ANSWER,72,14328
1590887349922365440,eeab3421c2b685f7d51b09a289b82fe82ba0d3896984d09aeffb9d022232d887,2022-11-11 10:01:16,Java,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"import java.util.Scanner;\nimport java.util.Arrays;\n\npublic class Main{\n\tpublic static void main(String[] args) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint n  = scanner.nextInt();\n\t\tint[] dp = new int[n+1];\n\t\tdp[0]= 0;\n\t\tint[] a = new int[n];\n\t\tint[] b= new int[n];\n\t\tfor(int i=0;i<n;i++) {\n\t\t\ta[i] = scanner.nextInt();\n\t\t}\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tb[i] = scanner.nextInt();\n\t\t}\n\t\tint result = 0;\n\t\tfor(int i=1;i<=n;i++) {\n\t\t\tdp[i] = dp[i-1]+b[i-1]-a[i-1];\n\t\t\tresult = Math.max(result,dp[i]);\n\t\t}\n\t\tSystem.out.println(result);\n\t}\n}\n",WRONG_ANSWER,121,16352
1590887358893961216,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 10:01:18,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h> \nint main(){\nint a,b,c;\nscanf(\""%d %d %d\"",&a,&b,&c);\nprintf(\""%d\"",a+b-c);\n\n}\n",ACCEPTED,6,196
1590887531837698048,0354b067c4132d4425a90b77482ac717447702274cb7db1282edce56eaf037b3,2022-11-11 10:01:59,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main()\n{\n  int a[10],b[10],n;\n  int i,j,sum,ans,c;\n  i=j=ans=sum=0;\n  scanf(\""%d\"",&n);\n  for(i=0;i<n;i++)\n     scanf(\""%d\"",&a[i]);\n  for(;j<n;j++)\n     scanf(\""%d\"",&b[j]);\n  i=0;\n  ans=b[0]-a[0];\n  while(i<n){\n     c=b[i]-a[i];\n     sum=sum+c;\n     if(ans<=sum)\n        ans=sum;\n     else{\n        printf(\""%d\"",ans);\n        break;\n    }\n     i++;\n   }\n}\n",RUNTIME_ERROR,3,620
1590887804463263744,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 10:03:04,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main() {\n    int a,i;\n        if(scanf(\""%d\"",&a){;\n    int b[100]={0};\n    for(i=0;i<a;i++){\n            scanf(\""%d\"",&b[i]);\n    }\n\n    for(i=0;i<a;i++) {\n        \n        printf(\""6\"");\n        if(i<2){\n            printf(\""\\n\"");\n        }\n    }}\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590887846481821696,0354b067c4132d4425a90b77482ac717447702274cb7db1282edce56eaf037b3,2022-11-11 10:03:14,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main()\n{\n  int a[10],b[10],n;\n  int i,j,sum,ans,c;\n  i=j=ans=sum=0;\n  scanf(\""%d\"",&n);\n  for(i=0;i<n;i++)\n     scanf(\""%d\"",&a[i]);\n  for(;j<n;j++)\n     scanf(\""%d\"",&b[j]);\n  i=0;\n  ans=b[0]-a[0];\n  while(i<n){\n     c=b[i]-a[i];\n     sum=sum+c;\n     if(ans<=sum)\n        ans=sum;\n     else{\n        printf(\""%d\"",ans);\n        break;\n    }\n     i++;\n   }\n}\n",RUNTIME_ERROR,4,448
1590887850667716608,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 10:03:15,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main() {\n    int a,i;\n        if(scanf(\""%d\"",&a){\n    int b[100]={0};\n    for(i=0;i<a;i++){\n            scanf(\""%d\"",&b[i]);\n    }\n\n    for(i=0;i<a;i++) {\n        \n        printf(\""6\"");\n        if(i<2){\n            printf(\""\\n\"");\n        }\n    }}\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590887885333659648,0354b067c4132d4425a90b77482ac717447702274cb7db1282edce56eaf037b3,2022-11-11 10:03:23,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main()\n{\n  int a[10],b[10],n;\n  int i,j,sum,ans,c;\n  i=j=ans=sum=0;\n  scanf(\""%d\"",&n);\n  for(i=0;i<n;i++)\n     scanf(\""%d\"",&a[i]);\n  for(;j<n;j++)\n     scanf(\""%d\"",&b[j]);\n  i=0;\n  ans=b[0]-a[0];\n  while(i<n){\n     c=b[i]-a[i];\n     sum=sum+c;\n     if(ans<=sum)\n        ans=sum;\n     else{\n        printf(\""%d\"",ans);\n        break;\n    }\n     i++;\n   }\n}\n",RUNTIME_ERROR,3,468
1590888023020056576,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 10:03:56,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main() {\n    int a,i;\n        if(scanf(\""%d\"",&a)){\n    int b[100]={0};\n    for(i=0;i<a;i++){\n            scanf(\""%d\"",&b[i]);\n    }\n\n    for(i=0;i<a;i++) {\n        \n        printf(\""6\"");\n        if(i<2){\n            printf(\""\\n\"");\n        }\n    }}\n    return 0;\n}\n",WRONG_ANSWER,14,372
1590888185322844160,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 10:04:35,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main() {\n    int a,i;\n        if(scanf(\""%d\"",&a)){\n    int b[100]={0};\n    for(i=0;i<a;i++){\n            if(scanf(\""%d\"",&b[i])){\n                return 0;\n            }\n    }\n\n    for(i=0;i<a;i++) {\n        \n        printf(\""6\"");\n        if(i<2){\n            printf(\""\\n\"");\n        }\n    }}\n    return 0;\n}\n",WRONG_ANSWER,5,360
1590888212455796736,129ddfe9d2d4553f365faf2fdc5e2f0c271b2e342a4cff13802dda8ef8b3d1c2,2022-11-11 10:04:41,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int[] a = new int[10];\n        int n = s.nextInt();\n\n        for (int i=0; i< n; i++){\n                a[i] = s.nextInt();\n        }\n\n        for (int j=0; j< n; j++) {\n            int k =(int)(Math.pow(6,a[j])%10);\n            if(j == n - 1){\n                System.out.print(k);\n            }else{\n                System.out.println(k);\n            }\n        }\n    }\n}",TIME_LIMIT_EXCEEDED,50,17608
1590888331859243008,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 10:05:10,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main() {\n    int a,i;\n        if(scanf(\""%d\"",&a)){\n    int b[100]={0};\n    for(i=0;i<a;i++){\n            if(scanf(\""%d\"",&b[i])){\n            }\n    }\n\n    for(i=0;i<a;i++) {\n        \n        printf(\""6\"");\n        if(i<2){\n            printf(\""\\n\"");\n        }\n    }}\n    return 0;\n}\n",WRONG_ANSWER,21,396
1590888351174037504,1f15b5b41f9e61f2d767bcb1ae88bef60c94b97dd423bfd2ba9c8c0e8e9d05bb,2022-11-11 10:05:14,Java,0.0,1590524835191705600,1572865591226855424,1049226928954454016,class Main{\n    public static void main(String [] args) {\n    int X=8;\n    int Y=7;\n    int Z=3;\n    int num=0;\n    if(X >= 0 && X <= 100 && Y >= 0 && Y <= 100 && Z >= 0 && Z<= 100){\n        num = X+Y-Z;\n        System.out.println(num);\n        }\n    }\n},WRONG_ANSWER,76,13932
1590888431088107520,73af9d5098be5d450fba728363c8fdbe0f6a5526466daa2f3b74abf1acf75527,2022-11-11 10:05:33,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n\tint t,n,y;\n\tscanf(\""%d\"",&t);\n\tfor (int i = 0; i < t; i++)\n\t{\n\t\tscanf(\""%d\"",&n);\n\t\ty = pow(6, n);\n\t\ty = y % 10;\n        if(y<0)y=-y;\n\tprintf(\""%d\\n\"",y);\n\t}\n\treturn 0;\n}",WRONG_ANSWER,8,328
1590888438893686784,6383c93cbdef4af3eda29400a925819f16ad4afc8368e604ccd580cba7055bdd,2022-11-11 10:05:35,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include <math.h>\n\nint main()\n{\n    int x = 6;\n    int t;\n    if(scanf(\""%d\"",&t)){\n    int res = pow(x,t);\n    int n;\n    n = res%10;\n    printf(\""%d\"",n);\n    }\n    return 0;\n}\n",WRONG_ANSWER,4,368
1590888598323396608,129ddfe9d2d4553f365faf2fdc5e2f0c271b2e342a4cff13802dda8ef8b3d1c2,2022-11-11 10:06:13,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int[] a = new int[10];\n        int n = s.nextInt();\n    if(n>0&&n<100) {\n        for (int i = 0; i < n; i++) {\n            a[i] = s.nextInt();\n        }\n    }\n        for (int j=0; j< n; j++) {\n            int k =(int)(Math.pow(6,a[j])%10);\n            if(j == n - 1){\n                System.out.print(k);\n            }else{\n                System.out.println(k);\n            }\n        }\n    }\n}",TIME_LIMIT_EXCEEDED,50,14344
1590888606049308672,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 10:06:15,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main() {\n    int a,i;\n        if(scanf(\""%d\"",&a)){\n    int b[100]={0};\n    for(i=0;i<a;i++){\n            if(scanf(\""%d\"",&b[i])){\n            }\n    }\n\n    for(i=0;i<a;i++) {\n        \n        printf(\""6\\n\"");\n       /* if(i<2){\n            printf(\""\\n\"");\n        }*/\n    }}\n    return 0;\n}\n",WRONG_ANSWER,13,332
1590888619194257408,705adaf4eb218ca0fc51c6e09291eb309a3de0a7c595448a17d2fdb157e64706,2022-11-11 10:06:18,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n\n\n\nint main()\n{\n    printf(\""2022\"");\n\n    return 0;\n}",ACCEPTED,3,316
1590888819942031360,1f15b5b41f9e61f2d767bcb1ae88bef60c94b97dd423bfd2ba9c8c0e8e9d05bb,2022-11-11 10:07:06,Java,0.0,1590524835191705600,1572865591226855424,1049226928954454016,class Main{\n    public static void main(String [] args) {\n    int X=8;\n    int Y=7;\n    int Z=3;\n    int num=0;\n    if(X >= 0 && X <= 100 && Y >= 0 && Y <= 100 && Z >= 0 && Z<= 100){\n        num = X+Y-Z;\n        System.out.println(num);\n        }\n    }\n},WRONG_ANSWER,70,16596
1590888925634301952,129ddfe9d2d4553f365faf2fdc5e2f0c271b2e342a4cff13802dda8ef8b3d1c2,2022-11-11 10:07:31,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int[] a = new int[10];\n        int n = s.nextInt();\n        if(n>0&&n<100) {\n            for (int i = 0; i < n; i++) {\n                a[i] = s.nextInt();\n            }\n        }\n        for (int j=0; j< n; j++) {\n            if(j == n - 1){\n                System.out.print(6);\n            }else{\n                System.out.println(6);\n            }\n        }\n    }\n},TIME_LIMIT_EXCEEDED,50,12692
1590888956495990784,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 10:07:39,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a;\n    int i,result=1;\n    int j[100]={0};\n    if(scanf(\""%d\"",&a)){\n    int n[100]={0};\n    for(i=0;i<a;i++) {\n        if(scanf(\""%d\"", &n[i])){\n            \n        }\n    }\n    int z;\n    for(z=0;z<a;z++) {\n        for (i = 0; i < a; i++) {\n            result *= 6;\n        }\n        for (i = 0; i < a; i++) {\n            j[z] = result % 10;\n        }\n    }\n    for(i=0;i<a;i++) {\n        printf(\""%d\"", j[i]);\n        if(i<2){\n        printf(\""\\n\"");\n    }\n    }}\n    return 0;\n}",WRONG_ANSWER,3,344
1590888994144038912,73af9d5098be5d450fba728363c8fdbe0f6a5526466daa2f3b74abf1acf75527,2022-11-11 10:07:48,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n\tint t,n,y;\n\tscanf(\""%d\"",&t);\n\tfor (int i = 0; i < t; i++)\n\t{\n\t\tscanf(\""%d\"",&n);\n\t\ty = pow(6, n);\n\t\ty = y % 10;\n        if(y<0)y=0;\n\tprintf(\""%d\\n\"",y);\n\t}\n\treturn 0;\n}",WRONG_ANSWER,7,656
1590889019272114176,1f15b5b41f9e61f2d767bcb1ae88bef60c94b97dd423bfd2ba9c8c0e8e9d05bb,2022-11-11 10:07:54,Java,0.0,1590524835191705600,1572865591226855424,1049226928954454016,class Main{\n    public static void main(String [] args) {\n    int X=8;\n    int Y=7;\n    int Z=3;\n    int num=0;\n    if(X >= 0 && X <= 100 && Y >= 0 && Y <= 100 && Z >= 0 && Z<= 100){\n        num = X+Y-Z;\n        System.out.println(num);\n        return;\n        }\n    }\n},WRONG_ANSWER,72,14364
1590889133298462720,d9e00d995e65b04cda3ddef6baec19225e4351002ab4efa981f62d78919a481b,2022-11-11 10:08:21,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    long long m;\n    int i,n;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%lld\"",&m);\n        printf(\""%d\"",(int)pow(6,m)%10);\n        if(i!=n-1) printf(\""\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,7,356
1590889167071019008,705adaf4eb218ca0fc51c6e09291eb309a3de0a7c595448a17d2fdb157e64706,2022-11-11 10:08:29,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n\n\n\nint main()\n{\n    int x,y,z,sum;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    sum=x+y-z;\n    printf(\""%d\"",sum);\n\n\n    return 0;\n}",ACCEPTED,6,196
1590889356234129408,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 10:09:14,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a;\n    int i,result=1;\n    int j[100]={0};\n    if(scanf(\""%d\"",&a)){\n    int n[100]={0};\n    for(i=0;i<a;i++) {\n        if(scanf(\""%d\"", &n[i])){\n            \n        }\n    }\n    int z;\n    for(z=0;z<a;z++) {\n        for (i = 0; i < a; i++) {\n            result *= 6;\n        }\n        for (i = 0; i < a; i++) {\n            j[z] = result % 10;\n        }\n    }\n    for(i=0;i<a;i++) {\n        printf(\""%d\"", j[i]);\n        if(i<2){\n        printf(\""\\n\"");\n    }\n    }}\n    return 0;\n}",WRONG_ANSWER,4,180
1590889370574434304,e9a50f3e071443bb6fb229966bff355c178d484f6cc10e5e1fc8dc5a537237ba,2022-11-11 10:09:17,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint shusu();\nint main()\n{\n    int a,b,i,j;\n    b=1;\n    scanf(\""%d\"",&a);\n    if(a!=2)\n    {for(i=3;i<a;i+=2)\n    {\n        for(j=3;j<i;j+=2)\n        {\n            if(i%j==0)\n                break;\n        }\n        if(i==j)\n        {\n            b++;\n        }\n    }\n    }\n    else  b=1;\n    printf(\""%d\"",b);\n}\n\n",TIME_LIMIT_EXCEEDED,400,324
1590889414484623360,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 10:09:28,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a;\n    int i,result=1;\n    int j[100]={0};\n    if(scanf(\""%d\"",&a)){\n    int n[100]={0};\n    for(i=0;i<a;i++) {\n        if(scanf(\""%d\"", &n[i])){\n            \n        }\n    }\n    int z;\n    for(z=0;z<a;z++) {\n        for (i = 0; i < a; i++) {\n            result *= 6;\n        }\n        for (i = 0; i < a; i++) {\n            j[z] = result % 10;\n        }\n    }\n    for(i=0;i<a;i++) {\n        printf(\""%d\"", j[i]);\n        if(i<2){\n        printf(\""\\n\"");\n    }\n    }}\n    return 0;\n}",WRONG_ANSWER,5,508
1590889440589975552,977c9d350f87cd8386fa1f88cca886d6ff43821830806e60da6d6b36dc77cd13,2022-11-11 10:09:34,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int X,Y,Z;\n        scanf(\""%d%d%d\"",&X,&Y,&Z);\n    printf(\""%d\"",X+Y-Z);\n}",ACCEPTED,7,320
1590889654654644224,b73a04f1a7af1c2516ca68b38e336912bdf10c4f4bf7bac55e4e0de29dcf3d9d,2022-11-11 10:10:25,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main(){\n    int n;\n    int count=0;\n    int i,j,k;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++){\n//         k=(int)sqrt(i);\n        int flag=1;\n        for(j=2;j<i;j++){\n            if(i%j==0){\n                flag=0;\n                break;\n            }\n        }\n        if(flag==1)  \n            count++;\n            \n    }\n//    printf(\""%d\"",count);\n    printf(\""%d\"",count);\n    \n            \n    \n    return 0;\n}",TIME_LIMIT_EXCEEDED,400,312
1590889654738530304,73af9d5098be5d450fba728363c8fdbe0f6a5526466daa2f3b74abf1acf75527,2022-11-11 10:10:25,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n\tint t,n,y;\n\tscanf(\""%d\"",&t);\n\tfor (int i = 0; i < t; i++)\n\t{\n\t\tscanf(\""%d\"",&n);\n\t\ty = pow(6, n);\n\t\ty = y % 10;\n        if(n<0)y=0;\n\tprintf(\""%d\\n\"",y);\n\t}\n\treturn 0;\n}",WRONG_ANSWER,7,340
1590889941154967552,eeab3421c2b685f7d51b09a289b82fe82ba0d3896984d09aeffb9d022232d887,2022-11-11 10:11:33,Java,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"import java.util.Scanner;\nimport java.util.Arrays;\n\npublic class Main{\n\tpublic static void main(String[] args) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint n  = scanner.nextInt();\n\t\tint[] dp = new int[n+1];\n\t\tdp[0]= 0;\n\t\tint[] a = new int[n];\n\t\tint[] b= new int[n];\n\t\tfor(int i=0;i<n;i++) {\n\t\t\ta[i] = scanner.nextInt();\n\t\t}\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tb[i] = scanner.nextInt();\n\t\t}\n\t\tint result = 0;\n\t\tfor(int i=1;i<=n;i++) {\n\t\t\tdp[i] = dp[i-1]+b[i-1]-a[i-1];\n\t\t\tif(i ==1) result = dp[i];\n            result = Math.max(result,dp[i]);\n\t\t}\n\t\tSystem.out.println(result);\n\t}\n}\n",WRONG_ANSWER,138,16512
1590890282294509568,0354b067c4132d4425a90b77482ac717447702274cb7db1282edce56eaf037b3,2022-11-11 10:12:55,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main()\n{\n  int a[100],b[100],n;\n  int i,j,sum,ans,c;\n  i=j=ans=sum=0;\n  scanf(\""%d\"",&n);\n  for(i=0;i<n;i++)\n     scanf(\""%d\"",&a[i]);\n  for(;j<n;j++)\n     scanf(\""%d\"",&b[j]);\n  i=0;\n  ans=b[0]-a[0];\n  while(i<n){\n     c=b[i]-a[i];\n     sum=sum+c;\n     if(ans<=sum)\n        ans=sum;\n     else{\n        printf(\""%d\"",ans);\n        break;\n    }\n     i++;\n   }\n}\n",WRONG_ANSWER,3,196
1590890486229958656,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 10:13:43,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a;\n    int i,result=1;\n    int j[100]={0};\n    if(scanf(\""%d\"",&a)){\n    int n[100]={0};\n    for(i=0;i<a;i++) {\n        if(scanf(\""%d\"", &n[i])){\n            \n        }\n    }\n    int z;\n    for(z=0;z<a;z++) {\n        for (i = 0; i < a; i++) {\n            result *= 6;\n        }\n        for (i = 0; i < a; i++) {\n            j[z] = result % 10;\n        }\n    }\n    for(i=0;i<a;i++) {\n        printf(\""%d\"", j[i]);\n        if(i<2){\n        printf(\""\\n\"");\n    }\n    }}\n    return 0;\n}",WRONG_ANSWER,4,332
1590890487647612928,aa65cdf25cbe32699d085a61c4f3ec5a4020e6a3dc1e0e9d6e2a48c9288f8026,2022-11-11 10:13:44,Java,300.0,1590528927448293376,1590525945717575680,1049226928954454016,public class Main {\n\n  public static void main(String[] args) {\n\n    System.out.println(2022);\n\n  }\n\n},ACCEPTED,68,14036
1590890617893359616,3e087b0a196d30fcbb49ca80164c9eb5adf82ae3bb08ec0c141e5728fb180f0d,2022-11-11 10:14:15,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <iostream>\n#include <cmath>\n\nusing namespace std;\n\nint main()\n{\n    int cnt=1,num=1;\n\tcin>>cnt;\n\tfor(int i=1;i<=cnt-1;i++){\n\t\tcin>>num;\n\t\tcout<<((int)pow(6,num))%10<<endl;\n\t}\n\tcin>>num;\n    cout<<((int)(pow(6,num))%10);\n    return 0;\n}\n",WRONG_ANSWER,9,600
1590890670154387456,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 10:14:27,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    long long int a;\n    long int i,result=1;\n    long int j[100]={0};\n    if(scanf(\""%d\"",&a)){\n    int n[100]={0};\n    for(i=0;i<a;i++) {\n        if(scanf(\""%d\"", &n[i])){\n            \n        }\n    }\n    int z;\n    for(z=0;z<a;z++) {\n        for (i = 0; i < a; i++) {\n            result *= 6;\n        }\n        for (i = 0; i < a; i++) {\n            j[z] = result % 10;\n        }\n    }\n    for(i=0;i<a;i++) {\n        printf(\""%d\"", j[i]);\n        if(i<2){\n        printf(\""\\n\"");\n    }\n    }}\n    return 0;\n}",TIME_LIMIT_EXCEEDED,50,192
1590890681592250368,0354b067c4132d4425a90b77482ac717447702274cb7db1282edce56eaf037b3,2022-11-11 10:14:30,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main()\n{\n  int a[100],b[100],n;\n  int i,j,sum,ans,c;\n  i=j=ans=sum=0;\n  scanf(\""%d\"",&n);\n  for(i=0;i<n;i++)\n     scanf(\""%d\"",&a[i]);\n  for(;j<n;j++)\n     scanf(\""%d\"",&b[j]);\n  i=0;\n  ans=b[0]-a[0];\n  while(i<n){\n     c=b[i]-a[i];\n     sum=sum+c;\n     if(ans<=sum)\n        ans=sum;\n     i++;\n   }\n    printf(\""%d\"",ans);\n}\n",WRONG_ANSWER,5,320
1590890699665510400,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 10:14:34,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    long int a;\n    long int i,result=1;\n    long int j[100]={0};\n    if(scanf(\""%d\"",&a)){\n    int n[100]={0};\n    for(i=0;i<a;i++) {\n        if(scanf(\""%d\"", &n[i])){\n            \n        }\n    }\n    int z;\n    for(z=0;z<a;z++) {\n        for (i = 0; i < a; i++) {\n            result *= 6;\n        }\n        for (i = 0; i < a; i++) {\n            j[z] = result % 10;\n        }\n    }\n    for(i=0;i<a;i++) {\n        printf(\""%d\"", j[i]);\n        if(i<2){\n        printf(\""\\n\"");\n    }\n    }}\n    return 0;\n}",TIME_LIMIT_EXCEEDED,50,476
1590890740052439040,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 10:14:44,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    long int a;\n    long int i,result=1;\n    int j[100]={0};\n    if(scanf(\""%d\"",&a)){\n    int n[100]={0};\n    for(i=0;i<a;i++) {\n        if(scanf(\""%d\"", &n[i])){\n            \n        }\n    }\n    int z;\n    for(z=0;z<a;z++) {\n        for (i = 0; i < a; i++) {\n            result *= 6;\n        }\n        for (i = 0; i < a; i++) {\n            j[z] = result % 10;\n        }\n    }\n    for(i=0;i<a;i++) {\n        printf(\""%d\"", j[i]);\n        if(i<2){\n        printf(\""\\n\"");\n    }\n    }}\n    return 0;\n}",TIME_LIMIT_EXCEEDED,50,444
1590890756959698944,ccc42b8437aa15d1214e4623799ed35cd8ea8087c26cb1b596d51ae4556ea39c,2022-11-11 10:14:48,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"def prime(p):\n    a=p//2\n    for i in range(2,a+1):\n        if p%i==0:\n            return False\n    return True\ndef PrimeSum(n):\n    \n    return sums\na=eval(input())\nsums=0\nfor i in range(2,a+1):\n    if prime(i)==True:\n        sums+=1\nprint(sums)",TIME_LIMIT_EXCEEDED,400,2752
1590890801809371136,6a6dc7e644e57bb2c20b20d39bd4d9541bdebf6415e03e7c13707572c054673e,2022-11-11 10:14:59,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{   int a,b,c,d;\n    a=b+c-d;\n    scanf(\""%d%d%d\"",&b,&c,&d);\n    printf(\""%d\\n\"",a);\n    return 0;\n}",WRONG_ANSWER,4,312
1590890870528872448,05fd79145678de5c06012db9db4333bebf8365a74fe442d12a54a9da3782fdca,2022-11-11 10:15:15,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"print(\""2022\"")",ACCEPTED,16,2752
1590890962086330368,ce1bb8e96385d94dfdb2bd028407e2ffb5a64494440cd7964d6624a83809dae6,2022-11-11 10:15:37,C++,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\n\nint main(void)\n\n{\n\nprintf(\""%d\"",2022);\n\nreturn 0;\n\n}",ACCEPTED,3,332
1590891045871726592,73af9d5098be5d450fba728363c8fdbe0f6a5526466daa2f3b74abf1acf75527,2022-11-11 10:15:57,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n\tint t,n,y;\n\tscanf(\""%d\"",&t);\n\tfor (int i = 0; i < t; i++)\n\t{\n\t\tscanf(\""%d\"",&n);\n\t\ty = （int)pow(6, n);\n\t\ty = y % 10;\n        if(n<0)y=0;\n\tprintf(\""%d\\n\"",y);\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1590891098812252160,ccc42b8437aa15d1214e4623799ed35cd8ea8087c26cb1b596d51ae4556ea39c,2022-11-11 10:16:09,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"def prime(p):\n    a=p//2\n    for i in range(2,a+1):\n        if p%i==0:\n            return False\n    return True\na=eval(input())\nsums=0\nfor i in range(2,a+1):\n    if prime(i)==True:\n        sums+=1\nprint(sums)",TIME_LIMIT_EXCEEDED,400,2820
1590891127270604800,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 10:16:16,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main() {\n    long int a,i;\n    if(scanf(\""%d\"",&a)){\n        long int b[100]={0};\n        for(i=0;i<a;i++){\n            if(scanf(\""%d\"",&b[i])){\n            }\n        }\n\n        for(i=0;i<a;i++) {\n\n            printf(\""6\"");\n            if(i<2){\n                printf(\""\\n\"");\n            }\n        }}\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,50,184
1590891188922658816,281adcca8943f9f4c0ced14f1ceffe157a34fca39f3cb864eb95e400944e38a8,2022-11-11 10:16:31,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n;\n    scanf(\""%d\"",&n);\n    while(n>0){\n        printf(\""6\"");\n        printf(\""\\n\"");\n        n--;\n    }\n    return 0;\n}\n",WRONG_ANSWER,11,336
1590891199865618432,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 10:16:34,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main() {\n    long int a,i;\n    if(scanf(\""%d\"",&a)){\n        int b[100]={0};\n        for(i=0;i<a;i++){\n            if(scanf(\""%d\"",&b[i])){\n            }\n        }\n\n        for(i=0;i<a;i++) {\n\n            printf(\""6\"");\n            if(i<2){\n                printf(\""\\n\"");\n            }\n        }}\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,50,180
1590891360054456320,b73a04f1a7af1c2516ca68b38e336912bdf10c4f4bf7bac55e4e0de29dcf3d9d,2022-11-11 10:17:12,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"n=eval(input())\ncount=0\nfor i in range(2,n+1):\n    for j in range(2,i):\n        if i%j ==0:\n            break;\n    else:\n        count+=1\nprint(count)\n        ",TIME_LIMIT_EXCEEDED,400,2748
1590891410260299776,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 10:17:24,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main() {\n    double a,i;\n    if(scanf(\""%d\"",&a)){\n        double b[100]={0};\n        for(i=0;i<a;i++){\n            if(scanf(\""%d\"",&b[i])){\n            }\n        }\n\n        for(i=0;i<a;i++) {\n\n            printf(\""6\"");\n            if(i<2){\n                printf(\""\\n\"");\n            }\n        }}\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590891455692976128,73af9d5098be5d450fba728363c8fdbe0f6a5526466daa2f3b74abf1acf75527,2022-11-11 10:17:35,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n\tint t,n;\n    long y;\n\tscanf(\""%d\"",&t);\n\tfor (int i = 0; i < t; i++)\n\t{\n\t\tscanf(\""%d\"",&n);\n\t\ty = (long)pow(6, n);\n\t\ty = y % 10;\n        if(n<0)y=0;\n\tprintf(\""%d\\n\"",y);\n\t}\n\treturn 0;\n}",WRONG_ANSWER,9,324
1590891519807127552,1f15b5b41f9e61f2d767bcb1ae88bef60c94b97dd423bfd2ba9c8c0e8e9d05bb,2022-11-11 10:17:50,Java,300.0,1590524835191705600,1572865591226855424,1049226928954454016,import java.util.Scanner;\nclass Main{\n    public static void main(String [] args) {\n    Scanner sc=new Scanner(System.in);\n    int X=sc.nextInt();\n    int Y=sc.nextInt();\n    int Z=sc.nextInt();\n    int num=0;\n    num=X+Y-Z;\n    System.out.println(num);\n    }\n},ACCEPTED,251,17008
1590891612492861440,9d0546dac18a9dc678295254e547925db086add5f872ef42d8015d525afeaf65,2022-11-11 10:18:12,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <time.h>\n\nint main()\n{\n    time_t timep;\n    struct tm *p;\n    time (&timep);\n    p=gmtime(&timep);\n    printf(\""%d\\n\"",1900+p->tm_year);\n    return 0;\n}\n",ACCEPTED,4,336
1590891629391708160,eeab3421c2b685f7d51b09a289b82fe82ba0d3896984d09aeffb9d022232d887,2022-11-11 10:18:16,Java,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"import java.util.Scanner;\nimport java.util.Arrays;\n\npublic class Main{\n\tpublic static void main(String[] args) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint n  = scanner.nextInt();\n\t\tint[] dp = new int[n+1];\n\t\tdp[0]= 0;\n\t\tint[] a = new int[n];\n\t\tint[] b= new int[n];\n\t\tfor(int i=0;i<n;i++) {\n\t\t\ta[i] = scanner.nextInt();\n\t\t}\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tb[i] = scanner.nextInt();\n\t\t}\n\t\tint result = 0;\n\t\tfor(int i=1;i<=n;i++) {\n\t\t\tdp[i] = dp[i-1]+b[i-1]-a[i-1];\n\t\t\tif(i ==1) result = dp[i];\n            result = Math.max(result,dp[i]);\n\t\t}\n        if(result <0)\n            result = 0;\n\t\tSystem.out.println(result);\n\t}\n}\n",WRONG_ANSWER,123,16524
1590891702674591744,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 10:18:33,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main() {\n    int a,i;\n    if(scanf(\""%d\"",&a)){\n        int b[100]={0};\n        for(i=0;i<a;i++){\n            if(scanf(\""%d\"",&b[i])){\n            }\n        }\n\n        for(i=0;i<a;i++) {\n\n            printf(\""6\"");\n            if(i<2){\n                printf(\""\\n\"");\n            }\n        }}\n    return 0;\n}\n",WRONG_ANSWER,9,364
1590891827446743040,3e087b0a196d30fcbb49ca80164c9eb5adf82ae3bb08ec0c141e5728fb180f0d,2022-11-11 10:19:03,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <iostream>\n#include <cmath>\n\nusing namespace std;\n\nint main()\n{\n    int cnt=1,num=1;\n\tcin>>cnt;\n\tfor(int i=1;i<=cnt-1;i++){\n\t\tcin>>num;\n\t\tcout<<((int)pow(6,num))%10<<endl;\n\t}\n\tcin>>num;\n    cout<<((int)(pow(6,num))%10)<<endl;\n    return 0;\n}\n",WRONG_ANSWER,10,488
1590892273422872576,05fd79145678de5c06012db9db4333bebf8365a74fe442d12a54a9da3782fdca,2022-11-11 10:20:49,C++,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main(){\n    int x,y,z;\n    cin>>x>>y>>z;\n    cout<<x+y-z;\n}",ACCEPTED,11,476
1590892475164700672,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-11 10:21:38,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n;\n    printf(\""%d\"",n);\n    return 0;\n}",WRONG_ANSWER,4,324
1590892701124440064,73af9d5098be5d450fba728363c8fdbe0f6a5526466daa2f3b74abf1acf75527,2022-11-11 10:22:31,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t,n;\n    scanf(\""%d\"",&t);\n    for(int i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&n);\n        if(n<0)printf(\""0\\n\"");\n        else if(n==0)printf(\""1\\n\"");\n        else printf(\""6\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,10,452
1590892760306089984,eeab3421c2b685f7d51b09a289b82fe82ba0d3896984d09aeffb9d022232d887,2022-11-11 10:22:46,Java,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"import java.util.Scanner;\nimport java.util.Arrays;\n\npublic class Main{\n\tpublic static void main(String[] args) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint n  = scanner.nextInt();\n        if(n == 0)\n        {\n            System.out.println(0);\n            return ;\n        }\n        int[] dp = new int[n+1];\n\t\tdp[0]= 0;\n\t\tint[] a = new int[n];\n\t\tint[] b= new int[n];\n\t\tfor(int i=0;i<n;i++) {\n\t\t\ta[i] = scanner.nextInt();\n\t\t}\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tb[i] = scanner.nextInt();\n\t\t}\n\t\tint result = 0;\n\t\tfor(int i=1;i<=n;i++) {\n\t\t\tdp[i] = dp[i-1]+b[i-1]-a[i-1];\n\t\t\tif(i ==1) result = dp[i];\n            result = Math.max(result,dp[i]);\n\t\t}\n        if(result <0)\n            result = 0;\n\t\tSystem.out.println(result);\n\t}\n}\n",WRONG_ANSWER,125,17080
1590892775330066432,6a6dc7e644e57bb2c20b20d39bd4d9541bdebf6415e03e7c13707572c054673e,2022-11-11 10:22:49,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{   int a,b,c,d;\n    scanf(\""%d %d %d\"",&b,&c,&d);\n    a=b+c-d;\n    printf(\""%d\"",a);\n    return 0;\n}",ACCEPTED,6,344
1590892797757009920,73af9d5098be5d450fba728363c8fdbe0f6a5526466daa2f3b74abf1acf75527,2022-11-11 10:22:55,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t,n;\n    scanf(\""%d\"",&t);\n    for(int i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&n);\n        if(n==0)printf(\""1\\n\"");\n        else printf(\""6\\n\"");\n    }\n    return 0;\n}",ACCEPTED,12,352
1590892827964411904,eeab3421c2b685f7d51b09a289b82fe82ba0d3896984d09aeffb9d022232d887,2022-11-11 10:23:02,Java,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"import java.util.Scanner;\nimport java.util.Arrays;\n\npublic class Main{\n\tpublic static void main(String[] args) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint n  = scanner.nextInt();\n        if(n == 0)\n        {\n            System.out.println(0);\n            return ;\n        }\n        int[] dp = new int[n+1];\n\t\tdp[0]= 0;\n\t\tint[] a = new int[n];\n\t\tint[] b= new int[n];\n\t\tfor(int i=0;i<n;i++) {\n\t\t\ta[i] = scanner.nextInt();\n\t\t}\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tb[i] = scanner.nextInt();\n\t\t}\n\t\tint result = 0;\n\t\tfor(int i=1;i<=n;i++) {\n\t\t\tdp[i] = dp[i-1]+b[i-1]-a[i-1];\n\t\t\tif(i ==1) result = dp[i];\n            result = Math.max(result,dp[i]);\n\t\t}\n\t\tSystem.out.println(result);\n\t}\n}\n",WRONG_ANSWER,117,17004
1590892833039519744,705adaf4eb218ca0fc51c6e09291eb309a3de0a7c595448a17d2fdb157e64706,2022-11-11 10:23:03,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n\n\n\nint main()\n{\n    int i,j,n;\n    int count=0;\n    int flag;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n    {\n        flag=1;\n        for(j=2;j*j<=i;j++)\n        {\n            flag=0;\n            break;\n\n        }\n        if(flag)\n            count++;\n\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",WRONG_ANSWER,4,328
1590892983002660864,5bd1a8718ea7fb820055421c67b8e0a468e08d951f729a24e55bf407b3bdb1f6,2022-11-11 10:23:39,C++,300.0,1590528927448293376,1590525945717575680,1049226928954454016,#include <iostream>\nusing namespace std;\n    int main(){\n        cout<<2022;\n    },ACCEPTED,4,320
1590893030251499520,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 10:23:50,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main() {\n    int a,i;\n    if(scanf(\""%d\"",&a)){\n        int b[100]={0};\n        for(i=0;i<a;i++){\n            if(scanf(\""%d\"",&b[i])){\n            }\n        }\n\n        for(i=0;i<a&&a>=0;i++) {\n            printf(\""6\"");\n            if(i<2){\n                printf(\""\\n\"");\n            }\n        }}\n    return 0;\n}\n",WRONG_ANSWER,12,456
1590893038656880640,9d0546dac18a9dc678295254e547925db086add5f872ef42d8015d525afeaf65,2022-11-11 10:23:52,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int x,y,z;\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    int k;\n    k=x+y-z;\n    printf(\""%d\"",k);\n    return 0;\n}\n",ACCEPTED,6,344
1590893108064223232,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 10:24:08,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main() {\n    int a,i;\n    if(scanf(\""%d\"",&a)){\n        int b[100]={0};\n        for(i=0;i<a&&a>=0;i++){\n            if(scanf(\""%d\"",&b[i])){\n            }\n        }\n\n        for(i=0;i<a&&a>=0;i++) {\n            printf(\""6\"");\n            if(i<2){\n                printf(\""\\n\"");\n            }\n        }}\n    return 0;\n}\n",WRONG_ANSWER,13,352
1590893251895275520,cf568c7ddc8b221335f880bfbaac4634294e65481e738a2e032c1ab9a84d576f,2022-11-11 10:24:43,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n    int t;\n    int i;\n    scanf(\""%d\"",&t);\n    int num[10000];\n    for(i=0;i<t;i++){\n        scanf(\""%d\"",&num[i]);\n    }\n    for(i=0;i<t;i++){\n        if(num[i]==0){\n            printf(\""1\\n\"");   \n        }\n        else{\n            printf(\""6\\n\"");\n        }\n    }\n\treturn 0;\n}\n",ACCEPTED,10,332
1590893324360286208,d9e00d995e65b04cda3ddef6baec19225e4351002ab4efa981f62d78919a481b,2022-11-11 10:25:00,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    long long m,l=1;\n    int i,n,j;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        l=6;\n        scanf(\""%lld\"",&m);\n        for(j=1;j<m;j++)\n            l*=6;\n    printf(\""%lld\"",l%10);\n    if(i!=n-1) printf(\""\\n\"");\n    }\n    return 0;\n}",TIME_LIMIT_EXCEEDED,56,476
1590893328495849472,0354b067c4132d4425a90b77482ac717447702274cb7db1282edce56eaf037b3,2022-11-11 10:25:01,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main()\n{\n  int a[100],b[100],n;\n  int i,j,sum,ans,c;\n  i=j=ans=sum=0;\n  scanf(\""%d\"",&n);\n  for(i=0;i<n;i++)\n     scanf(\""%d\"",&a[i]);\n  for(;j<n;j++)\n     scanf(\""%d\"",&b[j]);\n  i=0;\n  ans=b[0]-a[0];\n  while(i<n){\n     c=b[i]-a[i];\n     sum=sum+c;\n     if(ans<=sum)\n        ans=sum;\n     i++;\n   }\n    printf(\""%d\"",ans);\n    return 0;\n}\n",WRONG_ANSWER,4,360
1590893552362655744,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 10:25:54,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main() {\n    int n,i;\n    if(scanf(\""%d\"",&n)){\n        if(n>=0&&n<=1000000000){\n        int b[100]={0};\n        for(i=0;i<n;i++){\n            if(scanf(\""%d\"",&b[i])){\n            }\n        }\n\n        for(i=0;i<n;i++) {\n            printf(\""6\"");\n            if(i<2){\n                printf(\""\\n\"");\n            }\n        }}}\n    return 0;\n}\n",WRONG_ANSWER,11,512
1590893765315854336,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-11 10:26:45,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""%d\"",2022);\n    return 0;\n}",ACCEPTED,3,324
1590893794898284544,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 10:26:52,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\nint n,a[100],i=0,j,k=0,b[100],sum=1;\nscanf(\""%d\"",&n);\nfor(i=0;i<n;i++)\n{\n\tscanf(\""%d\"",&a[i]);\n}\nfor(i=0;i<n;i++)\n{\nfor(j=0;j<a[i];j++)\n{\n\tsum*=6;\n}\nb[k]=sum;\nk++;\nsum=1;\n}\nfor(k=0;k<n;k++)\n{\nprintf(\""%d\\n\"",b[k]%10);\n}\n\n\n}\n",TIME_LIMIT_EXCEEDED,55,256
1590893808898867200,e00ee38c44b3d45b1b15c51030bc5b68071f01213b1bbd9af859b26cc32471ac,2022-11-11 10:26:56,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\n\nint main()\n\n{\n\nint x,y,z,a;\n\nscanf(\""%d %d %d\"",&x,&y,&z);\n\na=x+y-z;\n\n    printf(\""%d\"",a);\n\n    return 0;\n\n}",ACCEPTED,6,316
1590893840872026112,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 10:27:03,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\nint n,a[100],i=0,j,k=0,b[100],sum=1;\nscanf(\""%d\"",&n);\nfor(i=0;i<n;i++)\n{\n\tscanf(\""%d\"",&a[i]);\n}\nfor(i=0;i<n;i++)\n{\nfor(j=0;j<a[i];j++)\n{\n\tsum*=6;\n}\nb[k]=sum;\nk++;\nsum=1;\n}\nfor(k=0;k<n;k++)\n{\nprintf(\""%d\\n\"",b[k]%10);\n}\n\n\n}\n",TIME_LIMIT_EXCEEDED,55,476
1590893980643012608,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 10:27:37,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a;\n    int i,result=1;\n    int j[100]={0};\n    if(scanf(\""%d\"",&a)){\n        if(a>=0&&a<=1000000000){\n        int n[100]={0};\n        for(i=0;i<a;i++) {\n            if(scanf(\""%d\"", &n[i])){\n\n            }\n        }\n        int z;\n        for(z=0;z<a;z++) {\n            for (i = 0; i < a; i++) {\n                result *= 6;\n            }\n            for (i = 0; i < a; i++) {\n                j[z] = result % 10;\n            }\n        }\n        for(i=0;i<a;i++) {\n            printf(\""%d\"", j[i]);\n            if(i<2){\n                printf(\""\\n\"");\n            }\n        }}}\n    return 0;\n}",WRONG_ANSWER,6,192
1590894158255030272,eeab3421c2b685f7d51b09a289b82fe82ba0d3896984d09aeffb9d022232d887,2022-11-11 10:28:19,Java,0.0,1590734963702620160,1590734503495200768,1049226928954454016,import java.util.Scanner;\nimport java.util.Arrays;\n\npublic class Main{\n\tpublic static void main(String[] args) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint n  = scanner.nextInt();\n        if(n == 0)\n        {\n            System.out.println(0);\n            return ;\n        }\n        int[] dp = new int[n+1];\n\t\tdp[0]= 0;\n\t\tint[] a = new int[n];\n\t\tint[] b= new int[n];\n\t\tfor(int i=0;i<n;i++) {\n\t\t\ta[i] = scanner.nextInt();\n\t\t}\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tb[i] = scanner.nextInt();\n\t\t}\n\t\t//int result = 0;\n\t\tfor(int i=1;i<=n;i++) {\n\t\t\tdp[i] = dp[i-1]+b[i-1]-a[i-1];\t\n\t\t}\n        Arrays.sort(dp);\n\t\tSystem.out.println(dp[n]);\n\t}\n}\n,WRONG_ANSWER,132,16412
1590894184276471808,fe4cb768b5403507910f0aa3f234076c47d1d48fa85c6c69866cf97317a3b628,2022-11-11 10:28:25,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n\nint main(void)\n{\n    int X, Y, Z;\n    scanf(\""%d %d %d\"", &X, &Y, &Z);\n    printf(\""%d\"", X + Y - Z);\n    return 0;\n}",ACCEPTED,8,384
1590894203826143232,fe4cb768b5403507910f0aa3f234076c47d1d48fa85c6c69866cf97317a3b628,2022-11-11 10:28:30,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n\nint main(void)\n{\n    int X, Y, Z;\n    scanf(\""%d %d %d\"", &X, &Y, &Z);\n    printf(\""%d\"", X + Y - Z);\n    return 0;\n}",ACCEPTED,6,348
1590894347850158080,5bd1a8718ea7fb820055421c67b8e0a468e08d951f729a24e55bf407b3bdb1f6,2022-11-11 10:29:04,C++,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main(){\n    int x,y,z;\n    cin>>x>>y>>z;\n    cout<<x+y-z;\n    \n}",ACCEPTED,9,596
1590894505753120768,3e087b0a196d30fcbb49ca80164c9eb5adf82ae3bb08ec0c141e5728fb180f0d,2022-11-11 10:29:42,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\n\t\tpublic static void main(String[] args) throws IOException {\n\t\t\t// TODO Auto-generated method stub\n\t\t\tBufferedReader bf=new BufferedReader(new InputStreamReader(System.in));\n\t\t\tint cnt=0;\n\t\t\tcnt=Integer.valueOf(bf.readLine());\n\t\t\tString[] temp=bf.readLine().split(\"" \"");\n\t\t\tint i=0;\n\t\t\tfor(;i<=cnt-2;i++) {\n\t\t\t\tSystem.out.println(\""6\"");\n\t\t\t}\n\t\t\tSystem.out.print(\""6\"");\n\t\t\tbf.close();\n\t\t}\n}",TIME_LIMIT_EXCEEDED,50,14460
1590894624460308480,05fd79145678de5c06012db9db4333bebf8365a74fe442d12a54a9da3782fdca,2022-11-11 10:30:10,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main(){\n    int n,a;\n    cin>>n;\n    for(int i=0;i<n;i++) {\n        cin>>a;\n        if(a==0) cout<<'0';\n        else cout<<'6';\n        if(i!=n-1) cout<<'\\n';\n    }\n}",WRONG_ANSWER,16,616
1590894681452490752,0d24b4ee85e6e3a4cc694f7e11105fa2aaf93fd10d4cbe81657f252e2d675435,2022-11-11 10:30:24,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n\tint n, num;\n\tscanf(\""%d\"", &n);\n\t\t\n\twhile (n > 0)\n\t{\n\t\tscanf(\""%d\"", &num);\n\t\tif (num == 0) \n\t\t\tprintf(\""1\"");\t\n\t\telse \n\t\t\tprintf(\""6\"");\n\n\t\tif (n != 1)\n\t\t\tprintf(\""\\n\"");\n\t\tn--;\n\t}\n\treturn 0;\n}\n",ACCEPTED,13,348
1590894759651119104,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 10:30:42,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\nint n,a[10],i=0,j,k=0,b[10],sum=1;\nscanf(\""%d\"",&n);\nfor(i=0;i<n;i++)\n{\n\tscanf(\""%d\"",&a[i]);\n}\nfor(i=0;i<n;i++)\n{\nfor(j=0;j<a[i];j++)\n{\n\tsum*=6;\n}\nb[k]=sum;\nk++;\nsum=1;\n}\nfor(k=0;k<n;k++)\n{\nprintf(\""%d\\n\"",b[k]%10);\n}\n\n\n}\n",TIME_LIMIT_EXCEEDED,53,352
1590894851430879232,05fd79145678de5c06012db9db4333bebf8365a74fe442d12a54a9da3782fdca,2022-11-11 10:31:04,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main(){\n    long long int n,a;\n    cin>>n;\n    for(ling long int i=0;i<n;i++) {\n        cin>>a;\n        if(a==0) cout<<'0';\n        else cout<<'6';\n        if(i!=n-1) cout<<'\\n';\n    }\n}",COMPILE_ERROR,0,0
1590894867327291392,3e087b0a196d30fcbb49ca80164c9eb5adf82ae3bb08ec0c141e5728fb180f0d,2022-11-11 10:31:08,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\n\t\tpublic static void main(String[] args) throws IOException {\n\t\t\t// TODO Auto-generated method stub\n\t\t\tBufferedReader bf=new BufferedReader(new InputStreamReader(System.in));\n\t\t\tint cnt=0;\n\t\t\tcnt=Integer.valueOf(bf.readLine());\n\t\t\tfor(int i=1;i<=cnt-1;i++) {\n\t\t\t\tSystem.out.println(\""6\"");\n\t\t\t}\n\t\t\tSystem.out.print(\""6\"");\n\t\t\tbf.close();\n\t\t}\n}",TIME_LIMIT_EXCEEDED,50,15456
1590894874168201216,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-11 10:31:10,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,class Main{\n    public static void main(String[] args) {\n        System.out.printf(2022)\n    }\n},COMPILE_ERROR,0,0
1590894883555053568,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 10:31:12,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main() {\n    int a,i;\n    if(scanf(\""%d\"",&a)){\n        int b[100]={0};\n        for(i=0;i<a;i++){\n            if(scanf(\""%d\"",&b[i])){\n            }\n        }\n\n        for(i=0;i<a;i++) {\n\n            printf(\""6\"");\n            if(i<a-1){\n                printf(\""\\n\"");\n            }\n        }}\n    return 0;\n}\n",WRONG_ANSWER,9,348
1590894909782011904,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-11 10:31:18,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,class Main{\n    public static void main(String[] args) {\n        System.out.printf(2022);\n    }\n},COMPILE_ERROR,0,0
1590894998252490752,705adaf4eb218ca0fc51c6e09291eb309a3de0a7c595448a17d2fdb157e64706,2022-11-11 10:31:39,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n\n\n\nint main()\n{\n    int i,j,n;\n    int count=0;\n    int flag;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n    {\n        flag=1;\n        for(j=2;j*j<=i;j++)\n        {\n            if(i%j==0)\n            {\n            flag=0;\n            break;}\n\n        }\n        if(flag)\n            count++;\n\n    }\n    printf(\""%d\"",count);\n    return 0;\n}\n",ACCEPTED,16,340
1590895017693089792,05fd79145678de5c06012db9db4333bebf8365a74fe442d12a54a9da3782fdca,2022-11-11 10:31:44,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main(){\n    long long int n,a;\n    cin>>n;\n    for(long long int i=0;i<n;i++) {\n        cin>>a;\n        if(a==0) cout<<'0';\n        else cout<<'6';\n        if(i!=n-1) cout<<'\\n';\n    }\n}",WRONG_ANSWER,12,480
1590895129567756288,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-11 10:32:10,Java,300.0,1590528927448293376,1590525945717575680,1049226928954454016,class Main{\n    public static void main(String[] args) {\n        System.out.println(2022);\n    }\n},ACCEPTED,73,14284
1590895265396097024,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-11 10:32:43,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n    return 0;\n}",ACCEPTED,7,204
1590895280453652480,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 10:32:46,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a;\n    int i,result=1;\n    int j[100]={0};\n    if(scanf(\""%d\"",&a)){\n        int n[100]={0};\n        for(i=0;i<a;i++) {\n            if(scanf(\""%d\"", &n[i])){\n\n            }\n        }\n        int z;\n        for(z=0;z<a;z++) {\n            for (i = 0; i < a; i++) {\n                result *= 6;\n            }\n            for (i = 0; i < a; i++) {\n                j[z] = result % 10;\n            }\n        }\n        for(i=0;i<a;i++) {\n            printf(\""%d\"", j[i]);\n            if(i<a-1){\n                printf(\""\\n\"");\n            }\n        }}\n    return 0;\n}",WRONG_ANSWER,6,264
1590895359361089536,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 10:33:05,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\nint n,a[100],i=0,j,k=0,b[100],sum=1;\nscanf(\""%d\"",&n);\nfor(i=0;i<n;i++)\n{\n\tscanf(\""%d\"",&a[i]);\n\tfor(j=0;j<a[i];j++)\n{\n\tsum*=6;\n}\nb[k]=sum;\nk++;\nsum=1;\n}\n\n\n\nfor(k=0;k<n;k++)\n{\nprintf(\""%d\\n\"",b[k]%10);\n}\n\n}\n\n",TIME_LIMIT_EXCEEDED,53,356
1590895359960879104,73af9d5098be5d450fba728363c8fdbe0f6a5526466daa2f3b74abf1acf75527,2022-11-11 10:33:05,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint i, j, n;\n\tint count = 0;\n\tint flag;\n\tscanf(\""%d\"",&n);\n\tfor (i = 2; i <= n; i++)\n\t{\n\t\tflag = 1;\n\t\tfor (j = 2; j*j <= i; j++)\n\t\t{\n\t\t\tif (i % j == 0) {\n\t\t\t\tflag = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (flag)\n\t\t\tcount++;\n\t}\n\tprintf(\""%d\"",count);\n\treturn 0;\n}",ACCEPTED,14,352
1590895580220559360,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 10:33:58,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\nint n,a[100],i=0,j,k=0,b[100],sum=1;\nscanf(\""%d\"",&n);\nfor(i=0;i<n;i++)\n{\n\tscanf(\""%d\"",&a[i]);\n\tfor(j=0;j<a[i];j++)\n{\n\tsum*=6;\n}\nb[k]=sum;\nk++;\nsum=1;\n\n\nprintf(\""%d\\n\"",b[i]%10);\n\n}\n\n\n\n\n}\n\n",TIME_LIMIT_EXCEEDED,55,340
1590895649741144064,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 10:34:14,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\nint n,a[100],i=0,j,k=0,b[100],sum=1;\nscanf(\""%d\"",&n);\nfor(i=0;i<n;i++)\n{\n\tscanf(\""%d\"",&a[i]);\n\tfor(j=0;j<a[i];j++)\n{\n\tsum*=6;\n}\nb[k]=sum;\nk++;\nsum=1;\n\n\nprintf(\""%d\\n\"",b[i]%10);\n\n}\n\n\n\n\n}\n\n",TIME_LIMIT_EXCEEDED,53,348
1590895854599344128,05fd79145678de5c06012db9db4333bebf8365a74fe442d12a54a9da3782fdca,2022-11-11 10:35:03,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main(){\n    long long int n,a;\n    cin>>n;\n    for(long long int i=0;i<n;i++) {\n        cin>>a;\n        if(a==0) cout<<'1';\n        else cout<<'6';\n        if(i!=n-1) cout<<'\\n';\n    }\n}",ACCEPTED,13,508
1590895880394309632,6ba5ecacf3381a1e9382f99c413290eca40a071a563a618e5f36d66cbf9a5e1b,2022-11-11 10:35:09,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"printf(\""2022\"");",COMPILE_ERROR,0,0
1590895897200885760,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 10:35:13,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\nint n,a[100],i=0,j,k=0,b[100],sum=1;\nscanf(\""%d\"",&n);\nfor(i=0;i<n;i++)\n{\n\tscanf(\""%d\"",&a[i]);\n\tfor(j=0;j<a[i];j++)\n{\n\tsum*=6;\n}\nb[k]=sum;\nk++;\nsum=1;\n\nprintf(\""%d\\n\"",b[i]%10);\n}\n\n\n\n\n\n\n\n}\n\n",TIME_LIMIT_EXCEEDED,55,364
1590895899390291968,542d97133043a1f2156354473a31382c35bb2836688b0ed76eae59c52a2e0e3a,2022-11-11 10:35:14,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""2022\\n\"");\n    return 0;\n}\n",ACCEPTED,3,196
1590895948170067968,6ba5ecacf3381a1e9382f99c413290eca40a071a563a618e5f36d66cbf9a5e1b,2022-11-11 10:35:26,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"print(\""2022\"");",ACCEPTED,22,2924
1590896121327718401,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-11 10:36:07,Java,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"import java.util.*;\nclass Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int x = sc.nextInt(),y = sc.nextInt(),z = sc.nextInt();\n        System.out.println(x + y - z);\n    }\n}",ACCEPTED,249,16792
1590896260737994752,6ba5ecacf3381a1e9382f99c413290eca40a071a563a618e5f36d66cbf9a5e1b,2022-11-11 10:36:40,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,x=input()\ny=input()\ny=input()\nprint(x+y-z),NON_ZERO_EXIT_CODE,16,2820
1590896311916867584,6ba5ecacf3381a1e9382f99c413290eca40a071a563a618e5f36d66cbf9a5e1b,2022-11-11 10:36:52,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,x=input()\ny=input()\nz=input()\nprint(x+y-z),NON_ZERO_EXIT_CODE,16,2756
1590896328928964608,3e087b0a196d30fcbb49ca80164c9eb5adf82ae3bb08ec0c141e5728fb180f0d,2022-11-11 10:36:56,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <iostream>\n#include <cmath>\n\nusing namespace std;\n\nint main()\n{\n    int cnt=1,num=1;\n\tcin>>cnt;\n\tfor(int i=1;i<=cnt-1;i++){\n\t\tcin>>num;\n\t\tif(num==0){\n            cout<<1<<endl;\n\t\t}\n\t\telse{\n            cout<<6<<endl;\n\t\t}\n\t}\n\tcin>>num;\n    if(num==0){\n        cout<<1;\n    }\n    else{\n        cout<<6;\n    }\n    return 0;\n}\n",ACCEPTED,16,440
1590896517353897984,d9e00d995e65b04cda3ddef6baec19225e4351002ab4efa981f62d78919a481b,2022-11-11 10:37:41,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,m;\n    scanf(\""%d\"",&n);\n    if(n==0)\n        printf(\""1\"");\n    else printf(\""6\\n\"");\n    return 0;\n}",WRONG_ANSWER,6,384
1590896688494084096,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 10:38:22,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\nint n,a[100],i=0,j,k=0,b[100],sum=1;\nscanf(\""%d\"",&n);\nfor(i=0;i<n;i++)\n{\n\tscanf(\""%d\"",&a[i]);\n\tfor(j=0;j<a[i];j++)\n{\n\tsum*=6;\n}\nb[k]=sum;\nk++;\nsum=1;\n\nprintf(\""%d\\n\"",b[i]%10);\n}\n\n\n\n\n\n\n\n}\n\n",TIME_LIMIT_EXCEEDED,54,344
1590896890143641600,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 10:39:10,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\nint a[100],n,i;\nscanf(\""%d\"",&n);\nfor(i=0;i<n;i++)\n{\n\tscanf(\""%d\"",&a[i]);\n\t\nprintf(\""6\\n\"");\n}\n\n\n\n\n\n\n\n}\n\n",WRONG_ANSWER,16,384
1590896942442414080,d9e00d995e65b04cda3ddef6baec19225e4351002ab4efa981f62d78919a481b,2022-11-11 10:39:23,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int i,n,m;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&m);\n        if(m==0) printf(\""1\\n\"");\n        else printf(\""6\\n\"");\n    }\n    return 0;\n}",ACCEPTED,10,484
1590897270789312512,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 10:40:41,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,3,344
1590897373444898816,5bd1a8718ea7fb820055421c67b8e0a468e08d951f729a24e55bf407b3bdb1f6,2022-11-11 10:41:05,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main(){\n    int t,n;\n    cin>>t;\n    while(t>0){\n        cin>>n;\n        if(n==0)\n            cout<<1<<endl;\n        else\n            cout<<6<<endl;\n        t--;\n}\n}",ACCEPTED,15,616
1590897388632453120,23d287b80d4d430308a1b57ee92bb4f2d1b25d1142a13c1c0fda4316c9bb9f17,2022-11-11 10:41:09,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"print(\""2022\"")",ACCEPTED,19,2888
1590897434488803328,eeab3421c2b685f7d51b09a289b82fe82ba0d3896984d09aeffb9d022232d887,2022-11-11 10:41:20,Java,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"import java.util.Scanner;\nimport java.util.Arrays;\n\npublic class Main{\n\tpublic static void main(String[] args) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint n  = scanner.nextInt();\n        if(n == 0)\n        {\n            System.out.println(0);\n            return ;\n        }\n        int[][] dp = new int[n+1][n+1];\n\t\tfor(int i=0;i<n+1;i++)\n\t\t{\n\t\t\tdp[0][i] = 0;\n\t\t}\n\t\tint[] a = new int[n];\n\t\tint[] b= new int[n];\n\t\tfor(int i=0;i<n;i++) {\n\t\t\ta[i] = scanner.nextInt();\n\t\t}\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tb[i] = scanner.nextInt();\n\t\t}\n\t\tint temp = 0;\n\t\tint result = 0;\n\t\t\n\t\tfor(int i=1;i<=n;i++) {\n\t\t\tfor(int j=i;j<=n;j++)\n\t\t\t{\n\t\t\t\tif(j ==i) dp[i][j-1] = 0;\n\t\t\t\tdp[i][j] = dp[i][j-1]+b[j-1]-a[j-1];\n\t\t\t\ttemp = Math.max(temp,dp[i][j]);\n\t\t\t\tif(j == n) result = Math.max(result,temp);\n\t\t\t}\n\t\t}\n       \n\t\tSystem.out.println(result);\n\t}\n}\n\n",ACCEPTED,123,16228
1590897451857416192,705adaf4eb218ca0fc51c6e09291eb309a3de0a7c595448a17d2fdb157e64706,2022-11-11 10:41:24,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\n\n\nint main()\n{\n    int i,n,m;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&m);\n        if(m<0)\n            printf(\""0\\n\"");\n        else if(m==0)\n            printf(\""1\\n\"");\n        else printf(\""6\\n\"");\n    }\n    return 0;\n}\n",WRONG_ANSWER,7,340
1590897596833533952,6ba5ecacf3381a1e9382f99c413290eca40a071a563a618e5f36d66cbf9a5e1b,2022-11-11 10:41:59,Python,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"x=input()\ny=x.split(\"" \"")\nprint(int(y[0])+int(y[1])-int(y[2]))",ACCEPTED,34,2900
1590897599471751168,542d97133043a1f2156354473a31382c35bb2836688b0ed76eae59c52a2e0e3a,2022-11-11 10:41:59,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z,sum;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    sum=X+Y-Z;\n    printf(\""%d\\n\"",sum);\n    return 0;\n}\n",ACCEPTED,10,220
1590897715200983040,2bc6a85c0376656012a7970a7842a2a9d8769555a79ef4eec85ff45aa30ff7b7,2022-11-11 10:42:27,Java,300.0,1590528927448293376,1590525945717575680,1049226928954454016,public class Main {\n    public static void main(String[] args) {\n        System.out.println(2022);\n    }\n}\n,ACCEPTED,71,16976
1590897744955379712,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 10:42:34,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\nint a[100],n,i,b;\nscanf(\""%d\"",&n);\nfor(i=0;i<n;i++)\n{\n\tscanf(\""%d\"",&a[i]);\nb=pow(6,a[i]);\nprintf(\""%d\\n\"",b%10);\n}\n\n\n\n\n\n\n\n}\n\n",WRONG_ANSWER,9,336
1590897760340086784,705adaf4eb218ca0fc51c6e09291eb309a3de0a7c595448a17d2fdb157e64706,2022-11-11 10:42:38,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\n\n\nint main()\n{\n    int i,n,m;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&m);\n        if(m==0)\n            printf(\""1\\n\"");\n        else printf(\""6\\n\"");\n    }\n    return 0;\n}\n",ACCEPTED,10,344
1590897860172886016,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 10:43:01,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int x = 0, y = 0, z = 0;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    int sum = x + y - z;\n    printf(\""%d\"",sum);\n    return 0;\n}",ACCEPTED,7,348
1590897882553692160,eeab3421c2b685f7d51b09a289b82fe82ba0d3896984d09aeffb9d022232d887,2022-11-11 10:43:07,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main(){\n    printf(\""2022\\n\"");\n    return 0;\n}",ACCEPTED,3,600
1590897950274945024,73af9d5098be5d450fba728363c8fdbe0f6a5526466daa2f3b74abf1acf75527,2022-11-11 10:43:23,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n, i;\n    int acquire[1000], consume[1000], sum = 0, s;\n    scanf(\""%d\"", &n);\n    for (i = 0; i < n; i++)\n    {\n        scanf(\""%d\"", &consume[i]);\n    }\n    for (i = 0; i < n; i++)\n    {\n        scanf(\""%d\"", &acquire[i]);\n    }\n    int max = acquire[0] - consume[0];\n    for (i = 0; i < n; i++)\n    {\n        s = acquire[i] - consume[i];\n        sum = sum + s;\n        if (sum > max)\n            max = sum;\n\n    }\n    printf(\""%d\"", max);\n    return 0;\n}",WRONG_ANSWER,3,196
1590898056319537152,7935e8f5cb04027f4d30ac84a997e2d03e946e112c1cb17f1a4f943d8b0b54bf,2022-11-11 10:43:48,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<iostream>\n#include<algorithm>\n#include<stdio.h>\nusing namespace std;\n\nint main(){\n    int n,i,j,m;\n    scanf(\""%d\"",&n);\n    int a[n][n],b[n],c[n];\n    fill(a[0],a[0]+n*n,0);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&c[i]);\n        c[i]=c[i]-b[i];\n    }\n    for(i=0;i<n;i++)\n    {\n        for(j=i;j<n;j++)\n            a[i][j]=a[i][j-1]+c[j];\n    }\n    for(i=0;i<n;i++)\n        sort(a[i],a[i]+n);\n        m=a[0][n-1];\n    for(i=0;i<n;i++)\n    {\n        if(m<a[i][n-1])\n            m=a[i][n-1];\n    }\n    printf(\""%d\"",m);\n\treturn 0;\n\n}\n",WRONG_ANSWER,4,324
1590898059070996480,2bc6a85c0376656012a7970a7842a2a9d8769555a79ef4eec85ff45aa30ff7b7,2022-11-11 10:43:49,Java,300.0,1590524835191705600,1572865591226855424,1049226928954454016,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(sc.nextInt() + sc.nextInt() - sc.nextInt());\n    }\n},ACCEPTED,262,16348
1590898062560661504,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 10:43:50,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a;\n    int i,result[100];\n    for(i=0;i<a;i++){\n        result[i]=1;\n    }\n    int j[100]={0};\n    if(scanf(\""%d\"",&a)){\n        int n[100]={0};\n        for(i=0;i<a;i++) {\n            if(scanf(\""%d\"", &n[i])){\n\n            }\n        }\n        int z;\n        for(z=0;z<a;z++) {\n            for (i = 0; i < a; i++) {\n                result[i] *= 6;\n            }\n            for (i = 0; i < a; i++) {\n                j[z] = result[i]% 10;\n            }\n        }\n        for(i=0;i<a;i++) {\n            printf(\""%d\"", j[i]);\n            if(i<a-1){\n                printf(\""\\n\"");\n            }\n        }}\n    return 0;\n}",TIME_LIMIT_EXCEEDED,3,476
1590898075722362880,2bc6a85c0376656012a7970a7842a2a9d8769555a79ef4eec85ff45aa30ff7b7,2022-11-11 10:43:53,Java,300.0,1590524835191705600,1572865591226855424,1049226928954454016,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(sc.nextInt() + sc.nextInt() - sc.nextInt());\n    }\n},ACCEPTED,233,16504
1590898079698563072,73af9d5098be5d450fba728363c8fdbe0f6a5526466daa2f3b74abf1acf75527,2022-11-11 10:43:54,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n, i;\n    int acquire[10000], consume[10000], sum = 0, s;\n    scanf(\""%d\"", &n);\n    for (i = 0; i < n; i++)\n    {\n        scanf(\""%d\"", &consume[i]);\n    }\n    for (i = 0; i < n; i++)\n    {\n        scanf(\""%d\"", &acquire[i]);\n    }\n    int max = acquire[0] - consume[0];\n    for (i = 0; i < n; i++)\n    {\n        s = acquire[i] - consume[i];\n        sum = sum + s;\n        if (sum > max)\n            max = sum;\n\n    }\n    printf(\""%d\"", max);\n    return 0;\n}",WRONG_ANSWER,4,200
1590898232341889024,eeab3421c2b685f7d51b09a289b82fe82ba0d3896984d09aeffb9d022232d887,2022-11-11 10:44:30,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main(){\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d\\n\"",x+y-z);\n    return 0;\n}",ACCEPTED,7,352
1590898237815435264,54914c90623988219ee55c4a0b2e645efd9808505aa25f0099930bfa8bf18ad1,2022-11-11 10:44:32,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""2022\"");\n}\n",ACCEPTED,4,456
1590898474084798464,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 10:45:28,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\nint a[100],n,i,b;\nscanf(\""%d\"",&n);\nfor(i=0;i<n;i++)\n{\n\tscanf(\""%d\"",&a[i]);\n\n}\n    for(i=0;i<n;i++)\n    {\n        b=pow(6,a[i]);\nprintf(\""%d\\n\"",b%10);\n    }\n\n\n\n\n\n\n\n}\n\n",WRONG_ANSWER,8,448
1590898538547052544,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 10:45:43,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a;\n    int i,result[100];\n    int j[100]={0};\n    if(scanf(\""%d\"",&a)){\n            for(i=0;i<a;i++){\n        result[i]=1;\n    }\n        int n[100]={0};\n        for(i=0;i<a;i++) {\n            if(scanf(\""%d\"", &n[i])){\n\n            }\n        }\n        int z;\n        for(z=0;z<a;z++) {\n            for (i = 0; i < a; i++) {\n                result[i] *= 6;\n            }\n            for (i = 0; i < a; i++) {\n                j[z] = result[i]% 10;\n            }\n        }\n        for(i=0;i<a;i++) {\n            printf(\""%d\"", j[i]);\n            if(i<a-1){\n                printf(\""\\n\"");\n            }\n        }}\n    return 0;\n}",WRONG_ANSWER,13,352
1590898780206071808,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-11 10:46:41,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,t=0;\n    int i,j;\n    scanf(\""%d\"",&n);\n    for(i=2;i<n;i++)\n    {\n        for(j=2;j<i;j++)\n        {\n            if(i%j==0)\n                t=t+1;\n        }\n    }\n    printf(\""%d\"",t);\n    return 0;\n}",TIME_LIMIT_EXCEEDED,400,312
1590898941040857088,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 10:47:19,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\nint a[1000000],n,i,b;\nscanf(\""%d\"",&n);\nfor(i=0;i<n;i++)\n{\n\tscanf(\""%d\"",&a[i]);\n\n}\n    for(i=0;i<n;i++)\n    {\n        b=pow(6,a[i]);\nprintf(\""%d\\n\"",b%10);\n    }\n\n\n\n\n\n\n\n}\n\n",WRONG_ANSWER,9,484
1590898974200999936,9ca3f63f61fa4f349009d69e7059514c3a39dbdd5a1f94342c11f4c33ccdceaa,2022-11-11 10:47:27,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,print (2022)\n,ACCEPTED,16,2756
1590899061484490752,a57fdafe4877cd9608fc0ac8a5120a47bc60a015785960e61b67b4e66187c2f2,2022-11-11 10:47:48,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"include <stdio.h>\nint main(){\n    printf(\""2022\"");\n    return 0;\n}",COMPILE_ERROR,0,0
1590899088516775936,e7e6ce2c6e9e530eaf2b9b9968748a0e44e3ac7183d73deb51851946350bfbb0,2022-11-11 10:47:54,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,k;\n    scanf(\""%d\"",&k); //测试用例数量\n\n\n    do {\n            scanf(\""%d\"",&n);\n        if(n==0)\n            printf(\""1 \\n\"");\n        else if(n!=0)\n            printf(\""6 \\n\"");\n        k--;\n    }while(k!=0);\n    return 0;\n}\n",ACCEPTED,12,512
1590899118564769792,23d287b80d4d430308a1b57ee92bb4f2d1b25d1142a13c1c0fda4316c9bb9f17,2022-11-11 10:48:02,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"X,Y,Z=8,7,3\nH=X+Y-Z\nprint(H)",WRONG_ANSWER,15,2744
1590899155466256384,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 10:48:10,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"print(\""2022\"")",ACCEPTED,18,2884
1590899171752742912,3e087b0a196d30fcbb49ca80164c9eb5adf82ae3bb08ec0c141e5728fb180f0d,2022-11-11 10:48:14,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\n\t\tpublic static void main(String[] args) throws IOException {\n\t\t\t// TODO Auto-generated method stub\n\t\t\tBufferedReader bf=new BufferedReader(new InputStreamReader(System.in));\n\t\t\tint cnt=0;\n\t\t\tcnt=Integer.valueOf(bf.readLine());\n\t\t\tString[] temp=bf.readLine().split(\"" \"");\n\t\t\tfor(int i=0;i<=cnt-2;i++) {\n\t\t\t\tif(Integer.valueOf(temp[i])==0) {\n\t\t\t\t\tSystem.out.println(1);\n\t\t\t\t}else {\n\t\t\t\t\tSystem.out.println(6);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(Integer.valueOf(temp[cnt-1])==0) {\n\t\t\t\tSystem.out.println(1);\n\t\t\t}else {\n\t\t\t\tSystem.out.println(6);\n\t\t\t}\n\t\t\tbf.close();\n\t\t}\n}",TIME_LIMIT_EXCEEDED,50,12984
1590899200429199360,73af9d5098be5d450fba728363c8fdbe0f6a5526466daa2f3b74abf1acf75527,2022-11-11 10:48:21,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n, i;\n    int acquire[10000], consume[10000], sum = 0, s;\n    scanf(\""%d\"", &n);\n    for (i = 0; i < n; i++)\n    {\n        scanf(\""%d\"", &consume[i]);\n    }\n    for (i = 0; i < n; i++)\n    {\n        scanf(\""%d\"", &acquire[i]);\n    }\n    int max = acquire[0] - consume[0];\n    for (i = 0; i < n; i++)\n    {\n        s = acquire[i] - consume[i];\n        sum = sum + s;\n        if (sum > max)\n            max = sum;\n\n    }\n    if(max<0)printf(\""0\"");\n    else\n    printf(\""%d\"", max);\n    return 0;\n}",WRONG_ANSWER,3,196
1590899240518356992,54914c90623988219ee55c4a0b2e645efd9808505aa25f0099930bfa8bf18ad1,2022-11-11 10:48:31,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b,c;\n    scanf(\""%d%d%d\"",&a,&b,& c);\n    int s = a+b-c;\n    printf(\""%d\"",s);\n}\n",ACCEPTED,6,348
1590899244897206272,b69ff333cc0daa10fb20c3ba26e439f64260003a8ff6fde3dbc623fd631ba825,2022-11-11 10:48:32,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\n\nint main(void)\n\n{\n\nprintf(\""%d\"",2022);\n\nreturn 0;\n\n}",ACCEPTED,3,184
1590899261322080256,6de81974dc8c65943a7aa7eec331767cc67f98683db11d3405a39c1495f3fcdf,2022-11-11 10:48:36,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main(void)\n{\nprintf(\""%d\"",2022);\nreturn 0;\n}\n",ACCEPTED,3,188
1590899495846608896,a57fdafe4877cd9608fc0ac8a5120a47bc60a015785960e61b67b4e66187c2f2,2022-11-11 10:49:31,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"include <stdio.h>\nint main(){\n    printf(\""2022\\n\"");\n    return 0;\n}",COMPILE_ERROR,0,0
1590899535663140864,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-11 10:49:41,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,t=0;\n    int i,j;\n    scanf(\""%d\"",&n);\n    for(i=2;i<n;i++)\n    {\n        for(j=2;j<=sqrt(i);j++)\n        {\n            if(i%j==0)\n                t=t+1;\n        }\n    }\n    printf(\""%d\"",t);\n    return 0;\n}",WRONG_ANSWER,63,340
1590899559042166784,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-11 10:49:47,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,t=0;\n    int i,j;\n    scanf(\""%d\"",&n);\n    for(i=2;i<n;i++)\n    {\n        for(j=2;j<=sqrt(i);j++)\n        {\n            if(i%j==0)\n                t=t+1;\n        }\n    }\n    printf(\""%d\"",t);\n    return 0;\n}",WRONG_ANSWER,62,640
1590899575550947328,b95d43d4e550820a57e0a7b63f63233a65cb813e77be0e6c08c1739f86678946,2022-11-11 10:49:50,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main(void)\n{\nprintf(\""%d\"",2022);\nreturn 0;\n}",ACCEPTED,3,352
1590899605372448768,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-11 10:49:58,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,t=0;\n    int i,j;\n    scanf(\""%d\"",&n);\n    for(i=2;i<n;i++)\n    {\n        for(j=2;j<sqrt(i);j++)\n        {\n            if(i%j==0)\n                t=t+1;\n        }\n    }\n    printf(\""%d\"",t);\n    return 0;\n}",WRONG_ANSWER,63,188
1590899850093334528,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-11 10:50:56,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class test {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int temp = sc.nextInt();\n        for (int i = 0;i < temp;i++) {\n            int x = sc.nextInt();\n            System.out.println(6);\n        }\n    }\n},COMPILE_ERROR,0,0
1590899983006629888,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 10:51:28,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,x= eval(input())\ny=eval(input())\nz = eval(input())\ns = x+y+z\nprint(s),NON_ZERO_EXIT_CODE,17,2888
1590899991097421824,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-11 10:51:30,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,t=0;\n    int i,j;\n    scanf(\""%d\"",&n);\n    for(i=2;i<n;i++)\n    {\n        for(j=2;j<sqrt(i);j++)\n        {\n            if(i%j==0)\n                t=t+1;\n        }\n        printf(\""%d\"",t);\n    }\n    \n    return 0;\n}",WRONG_ANSWER,73,688
1590899999452495872,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-11 10:51:32,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int temp = sc.nextInt();\n        for (int i = 0;i < temp;i++) {\n            int x = sc.nextInt();\n            System.out.println(6);\n        }\n    }\n},TIME_LIMIT_EXCEEDED,50,12664
1590900032524562432,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 10:51:39,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,x= eval(input())\ny=eval(input())\nz = eval(input())\ns = x+y+z\nprint(s),NON_ZERO_EXIT_CODE,17,2796
1590900226255294464,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-11 10:52:26,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int temp = sc.nextInt();\n        for (int i = 0;i < temp;i++) {\n            System.out.println(6);\n        }\n    }\n},TIME_LIMIT_EXCEEDED,50,14436
1590900236858470400,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 10:52:28,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nvoid main()\n{\n   printf(\""2022\"");\n   \n}",NON_ZERO_EXIT_CODE,3,184
1590900252654219264,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 10:52:32,C++,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    printf(\""2022\"");\n}",ACCEPTED,4,504
1590900337416929280,70c675ddfcb60b2192bc8ac38fb068fec0500208a5bf97a796c7cc074b43cf87,2022-11-11 10:52:52,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"public class main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner myScanner = new Scanner(System.in);\n\t\tint n = myScanner.nextInt();\n\t\tint[] arr = new int[n];\n\t\tfor(int i = 0;i < arr.length;i++) {\n\t\t\tarr[i] = myScanner.nextInt();\n\t\t\tSystem.out.println(\""6\"");\n\t\t}\n\t}\n\n}",COMPILE_ERROR,0,0
1590900351136501760,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-11 10:52:55,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int temp = sc.nextInt();\n        for (int i = 0;i < temp;i++) {\n            System.out.println(6);\n        }\n    }\n},TIME_LIMIT_EXCEEDED,50,15964
1590900373034962944,73af9d5098be5d450fba728363c8fdbe0f6a5526466daa2f3b74abf1acf75527,2022-11-11 10:53:01,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n, i;\n    int acquire[10000], consume[10000], sum = 0, s;\n    scanf(\""%d\"", &n);\n    for (i = 0; i < n; i++)\n    {\n        scanf(\""%d\"", &consume[i]);\n    }\n    for (i = 0; i < n; i++)\n    {\n        scanf(\""%d\"", &acquire[i]);\n    }\n    int max = acquire[0] - consume[0];\n    for (i = 0; i < n; i++)\n    {\n        s = acquire[i] - consume[i];\n        sum = sum + s;\n        if (sum > max)\n            max = sum;\n\n    }\n    if(max<0)printf(\""%d\"",acquire[0]);\n    else\n    printf(\""%d\"", max);\n    return 0;\n}",WRONG_ANSWER,4,344
1590900376461709312,70c675ddfcb60b2192bc8ac38fb068fec0500208a5bf97a796c7cc074b43cf87,2022-11-11 10:53:01,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"public class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner myScanner = new Scanner(System.in);\n\t\tint n = myScanner.nextInt();\n\t\tint[] arr = new int[n];\n\t\tfor(int i = 0;i < arr.length;i++) {\n\t\t\tarr[i] = myScanner.nextInt();\n\t\t\tSystem.out.println(\""6\"");\n\t\t}\n\t}\n\n}",COMPILE_ERROR,0,0
1590900395868753920,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 10:53:06,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main()\n{\n   printf(\""2022\"");\n   return 0;\n}",ACCEPTED,3,320
1590900428257144832,70c675ddfcb60b2192bc8ac38fb068fec0500208a5bf97a796c7cc074b43cf87,2022-11-11 10:53:14,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner myScanner = new Scanner(System.in);\n\t\tint n = myScanner.nextInt();\n\t\tint[] arr = new int[n];\n\t\tfor(int i = 0;i < arr.length;i++) {\n\t\t\tarr[i] = myScanner.nextInt();\n\t\t\tSystem.out.println(\""6\"");\n\t\t}\n\t}\n\n}",TIME_LIMIT_EXCEEDED,50,12704
1590900443956424704,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 10:53:17,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"",&n);\n    int sum = pow(6,n);\n    int num = sum % 10;\n    printf(\""%d\"",num);\n    return 0;\n}",WRONG_ANSWER,5,192
1590900523518201856,9ca3f63f61fa4f349009d69e7059514c3a39dbdd5a1f94342c11f4c33ccdceaa,2022-11-11 10:53:36,Python,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"a,b,c = [int(x) for x in input().split(\"" \"")]\nprint(a+b-c)\n",ACCEPTED,34,2744
1590900561308880896,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-11-11 10:53:45,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,import datetime\nnow=datetime.datetime.now()\nyear=now.year\nprint(year)\n,ACCEPTED,18,3404
1590900571907887104,2bc6a85c0376656012a7970a7842a2a9d8769555a79ef4eec85ff45aa30ff7b7,2022-11-11 10:53:48,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\n/**\n * @author Nipuru\n * @since 2022/11/11 10:41\n */\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int count = sc.nextInt();\n        while (count-- != 0) {\n            int n = sc.nextInt();\n            int pow = (int) Math.pow(6, n);\n            System.out.println(pow % 10);\n        }\n    }\n}",TIME_LIMIT_EXCEEDED,50,15380
1590900592095072256,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 10:53:53,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\nint a[100],n,i,b;\nif(n<pow(10,9)&&n>0){\n    scanf(\""%d\"",&n);\nfor(i=0;i<n;i++)\n{\n\tscanf(\""%d\"",&a[i]);\n\n}\n    for(i=0;i<n;i++)\n    {\n        b=pow(6,a[i]);\nprintf(\""%d\\n\"",b%10);\n    }\n}\n\n\n\n\n\n\n\n}\n\n",WRONG_ANSWER,8,472
1590900617743241216,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-11 10:53:59,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        int temp = new Scanner(System.in);\n        for (int i = 0;i < temp;i++) {\n            System.out.println(6);\n        }\n    }\n},COMPILE_ERROR,0,0
1590900673456156672,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-11 10:54:12,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"public class Main{\n    public static main(String args[]){\n        System.out.printf(\""2022\"");\n    }\n}",COMPILE_ERROR,0,0
1590900680410337280,2bc6a85c0376656012a7970a7842a2a9d8769555a79ef4eec85ff45aa30ff7b7,2022-11-11 10:54:14,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\n/**\n * @author Nipuru\n * @since 2022/11/11 10:41\n */\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int count = sc.nextInt();\n        while (count-- != 0) {\n            int n = sc.nextInt();\n            int pow = (int) Math.pow(6, n);\n            System.out.println(pow % 10);\n        }\n    }\n}",TIME_LIMIT_EXCEEDED,50,14808
1590900720042315776,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-11 10:54:23,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        int temp = new Scanner(System.in).nextInt();\n        for (int i = 0;i < temp;i++) {\n            System.out.println(6);\n        }\n    }\n},TIME_LIMIT_EXCEEDED,50,15920
1590900787826462720,0354b067c4132d4425a90b77482ac717447702274cb7db1282edce56eaf037b3,2022-11-11 10:54:39,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint i,j,a,b;\n\tscanf(\""%d\"",&i);\n\twhile(i>0){\n\t\tscanf(\""%d\"",&a);\n\t\tif(a==0)\n        printf(\""1\\n\"");\n        else\n        printf(\""6\\n\"");\n\t\ti--;\n\t} \n    return 0;\n}",ACCEPTED,11,344
1590900793878839296,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 10:54:41,C++,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n\nint main(void)\n{\n    int X,Y,Z;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    printf(\""%d\"",X+Y-Z);\n}",ACCEPTED,9,396
1590900793966923776,c5cc6f9845df4bd1986af86c0696296436bbc0f00a10a9f891b4100e57bc3a19,2022-11-11 10:54:41,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tcout<<\""2022\"";\n}",COMPILE_ERROR,0,0
1590900814011502592,c5cc6f9845df4bd1986af86c0696296436bbc0f00a10a9f891b4100e57bc3a19,2022-11-11 10:54:46,C++,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tcout<<\""2022\"";\n}",ACCEPTED,3,324
1590900851802181632,fec6d07e317796c63fb7ae6e7538f75973ad64af6e6196cc27eed3e9e685bf86,2022-11-11 10:54:55,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"\nmain()\n    {\n   printf(\""2022\\n\"");\n\n}",ACCEPTED,4,180
1590900852259356672,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-11 10:54:55,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,t=0;\n    int i,j;\n    int flag=1;\n    scanf(\""%d\"",&n);\n    for(i=2;i<n;i++)\n    {\n        flag=1;\n        for(j=2;j<=sqrt(i);j++)\n            if(i%j==0) flag = 0;\n            if(flag==1) t++;\n    }\n    printf(\""%d\"",t);\n    return 0;\n}",ACCEPTED,62,368
1590900885574717440,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-11 10:55:03,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h> \nint main(){\n\tprintf(\""2022\"");\n}",ACCEPTED,4,460
1590900904994340864,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-11 10:55:07,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main(){\n    printf(\""2022\"");\n}",ACCEPTED,3,348
1590900922761416704,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-11 10:55:12,Java,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"public class Main{\n    public static void main(String args[]){\n        System.out.printf(\""2022\"");\n    }\n}",ACCEPTED,87,14628
1590900952067014656,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-11 10:55:19,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        int temp = new Scanner(System.in).nextInt();\n        int i = 0;\n        while (i < temp) {\n            i++;\n            System.out.println(6);\n        }\n    }\n},TIME_LIMIT_EXCEEDED,50,13732
1590900975882252288,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 10:55:24,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}\n",ACCEPTED,3,356
1590901280225169408,c5cc6f9845df4bd1986af86c0696296436bbc0f00a10a9f891b4100e57bc3a19,2022-11-11 10:56:37,C++,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tint a,b,c;\n\tcin>>a>>b>>c;\n\tcout<<a+b-c<<endl;\n}",ACCEPTED,14,600
1590901285233143808,1773d9c971942817d949c47973c4eb8c24531f728d5480dbf3b232e568926258,2022-11-11 10:56:38,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.*;\nclass Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int num = sc.nextInt();\n        int sum = 0;\n        for (int i = 2; i <= num; i++) {\n            int k = 1;\n            for (int j = 2; j < i; j++) {\n                if (i % j == 0) {\n                    k = 0;\n                    break;\n                }\n            }\n            if (k != 0) {\n                sum++;\n            }\n        }\n            System.out.println(sum);\n    }\n},TIME_LIMIT_EXCEEDED,400,16196
1590901299816763392,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 10:56:42,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t = 0;\n    scanf(\""%d\"",&t);\n    while(t--)\n    {\n        int n = 0;\n        scanf(\""%d\"",&n);\n        int sum = pow(6,n);\n        int num = sum % 10;\n        printf(\""%d\\n\"",num);\n    }\n    return 0; \n\n}",WRONG_ANSWER,12,356
1590901307731415040,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 10:56:43,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"data = list(map(eval,input().split()))\ns =sum(data)\nprint(s)",WRONG_ANSWER,17,2780
1590901399016243200,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-11 10:57:05,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main(){\n    int x,y,z,s;\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    s=x+y-z\n    printf(\""%d\"",s);\n}",COMPILE_ERROR,0,0
1590901430955847680,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-11 10:57:13,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main(){\n    int x,y,z,s;\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    s=x+y-z;\n    printf(\""%d\"",s);\n}",ACCEPTED,7,360
1590901503395696640,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-11 10:57:30,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h> \nint main(){\n\tint X,Y,Z;\n\tscanf(\""%d %d %d\"",&X,&Y,&Z);\n\t printf(\""%d\"",X+Y-Z);\n}",ACCEPTED,6,336
1590901504721092608,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 10:57:30,Python,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"data = list(map(eval,input().split()))\ns = data[0]+data[1]-data[2]\nprint(s)",ACCEPTED,32,2884
1590901580642168832,6ba5ecacf3381a1e9382f99c413290eca40a071a563a618e5f36d66cbf9a5e1b,2022-11-11 10:57:49,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"n=int(input())\nx=input()\ny=x.split(\"" \"")\nfor i in range(0,n):\n    # print(i)\n    add=1;\n    for j in range(0,int(y[i])):\n        add*=6\n        add%=10\n    print(add)",TIME_LIMIT_EXCEEDED,68,2900
1590901611596132352,6ba5ecacf3381a1e9382f99c413290eca40a071a563a618e5f36d66cbf9a5e1b,2022-11-11 10:57:56,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"n=int(input())\nx=input()\ny=x.split(\"" \"")\nfor i in range(0,n):\n    # print(i)\n    add=1;\n    for j in range(0,int(y[i])):\n        add*=6\n        add%=10\n    print(add)",TIME_LIMIT_EXCEEDED,70,3036
1590901693603184640,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 10:58:15,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int x,y,z,sum;\n    scanf(\""%d,%d,%d\"",&x,&y,&z);\n    sum=x+y-z;\n    printf(\""%d\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,3,320
1590901704114110464,6ba5ecacf3381a1e9382f99c413290eca40a071a563a618e5f36d66cbf9a5e1b,2022-11-11 10:58:18,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"n=int(input())\nx=input()\ny=x.split(\"" \"")\nfor i in range(0,n):\n    # print(i)\n    add=1;\n    for j in range(0,int(y[i])):\n        add*=6\n        add%=10\n    print(add)",TIME_LIMIT_EXCEEDED,69,2884
1590901736519282688,73af9d5098be5d450fba728363c8fdbe0f6a5526466daa2f3b74abf1acf75527,2022-11-11 10:58:26,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n, i;\n    int acquire[1000], consume[1000], sum = 0, s;\n    scanf(\""%d\"", &n);\n    for (i = 0; i < n; i++)\n    {\n        scanf(\""%d\"", &consume[i]);\n    }\n    for (i = 0; i < n; i++)\n    {\n        scanf(\""%d\"", &acquire[i]);\n    }\n    int max = acquire[0] - consume[0];\n    for (i = 0; i < n; i++)\n    {\n        s = acquire[i] - consume[i];\n        sum = sum + s;\n        if (sum > max)\n            max = sum;\n\n    }\n    if(max<0)printf(\""%d\"",acquire[0]);\n    else\n    printf(\""%d\"", max);\n    return 0;\n}",WRONG_ANSWER,3,344
1590901844950450176,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 10:58:52,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint sum(int x,int y,int z)\n{\n    int sum;\n    sum=x+y-z;\n    return sum;\n}\nint main()\n{\n    int x,y,z;\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    sum(x,y,z);\n    printf(\""%d\"",sum(x,y,z));\n    return 0;\n}",ACCEPTED,7,320
1590901945001357312,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 10:59:15,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint sum(int x,y,z)\n{\n    int sum;\n    sum=x+y-z;\n    return sum;\n}\nint main()\n{\n    int x,y,z;\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    sum(x,y,z);\n    printf(\""%d\"",sum(x,y,z));\n    return 0;\n}",COMPILE_ERROR,0,0
1590901986206220288,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 10:59:25,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint sum(int x,int y,int z)\n{\n    int sum;\n    sum=x+y-z;\n    return sum;\n}\nint main()\n{\n    int x,y,z;\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    sum(x,y,z);\n    printf(\""%d\"",sum(x,y,z));\n    return 0;\n}",ACCEPTED,8,460
1590902047635976192,a27ecb139a3fa065feadb903517977dc609a6d218c4e082e7ec449c78806823c,2022-11-11 10:59:40,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,4,308
1590902050316161024,2bc6a85c0376656012a7970a7842a2a9d8769555a79ef4eec85ff45aa30ff7b7,2022-11-11 10:59:40,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\n/**\n * @author Nipuru\n * @since 2022/11/11 10:41\n */\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int num = sc.nextInt();\n        int count = 0;\n        for (int i = 2; i <= num; i++) {\n            boolean flag = false;\n            for (int j = 2; j < i; j++) {\n                if (i % j == 0) {\n                    flag = true;\n                    break;\n                }\n            }\n            if (!flag) {\n                count ++;\n            }\n        }\n        System.out.println(count);\n    }\n}\n,TIME_LIMIT_EXCEEDED,400,15828
1590902104410075136,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-11 10:59:53,Java,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"import java.util.Scanner\npublic class Main{\n    public static void main(String args[]){\n        int X,Y,Z;\n        Scanner scanner = new Scanner;\n        X=scanner.nextInt;\n        Y=scanner.nextInt;\n        Z=scanner.nextInt;\n        System.out.printf(X+Y+Z);\n    }\n}",COMPILE_ERROR,0,0
1590902139143106560,c9a8fe962a36cf99ca362f66348b02453584251c62fe2356e11d2a6efd5cee45,2022-11-11 11:00:02,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}\n",ACCEPTED,3,344
1590902156260085760,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-11 11:00:06,Java,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"import java.util.Scanner\npublic class Main{\n    public static void main(String args[]){\n        int X,Y,Z;\n        Scanner scanner = new Scanner;\n        X=scanner.nextInt;\n        Y=scanner.nextInt;\n        Z=scanner.nextInt;\n        System.out.printf(X+Y+Z);\n    }\n}",COMPILE_ERROR,0,0
1590902206595928064,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-11 11:00:18,Java,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"import java.util.Scanner;\npublic class Main{\n    public static void main(String args[]){\n        int X,Y,Z;\n        Scanner scanner = new Scanner;\n        X=scanner.nextInt;\n        Y=scanner.nextInt;\n        Z=scanner.nextInt;\n        System.out.printf(X+Y+Z);\n    }\n}",COMPILE_ERROR,0,0
1590902300992929792,c5cc6f9845df4bd1986af86c0696296436bbc0f00a10a9f891b4100e57bc3a19,2022-11-11 11:00:40,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tint n,a;\n\tcin>>n;\n\tfor(int i=0;i<n;i++) cin>>a;\n\tfor(int i=0;i<n;i++) \n            if(i<n-1) cout<<\""6\""<<endl;\n            else cout<<\""6\"";\n}",WRONG_ANSWER,14,604
1590902353937629184,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-11 11:00:53,Java,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"import java.util.Scanner;\npublic class Main{\n    public static void main(String args[]){\n        int X,Y,Z;\n        Scanner scanner = new Scanner(System.in);\n        X=scanner.nextInt;\n        Y=scanner.nextInt;\n        Z=scanner.nextInt;\n        System.out.printf(X+Y+Z);\n    }\n}",COMPILE_ERROR,0,0
1590902366931562496,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 11:00:56,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int x,y,z;\n    scanf(\""%d,%d,%d\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n    return 0;\n}\n",WRONG_ANSWER,3,320
1590902423336583168,fec6d07e317796c63fb7ae6e7538f75973ad64af6e6196cc27eed3e9e685bf86,2022-11-11 11:01:09,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nmain()\n    {\n    int x,y,z;\nscanf(\""%d%d%d\"",&x,&y,&z);\n    printf(\""%d\\n\"",x+y-z);\n}",ACCEPTED,6,468
1590902426037714945,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 11:01:10,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"int main(){\n  int i,j,n;\n  scanf(\""%d\"",&n);\n  for (i = 0; i <n ; i++) {\n    for (j = 2; j <i ; j++) {\n      if (i%j == 0){\n        break;\n      }\n    }\n    if (i == j){\n      printf(\""%d,\"",i);\n    }\n  }\n  return 0;\n}",TIME_LIMIT_EXCEEDED,400,300
1590902431335120896,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-11-11 11:01:11,Python,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"X,Y,Z=map(int,input().split(sep=' '))\ndef f():\n    fn=X+Y-Z\n    print(fn)\nf()",ACCEPTED,36,2900
1590902440910696448,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 11:01:14,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main(void)\n{\n    int n,i;\n    int a[10];\n    scamf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=0;j<n;j++)\n    {\n        k=6**a[j];\n        \n    }\n}",COMPILE_ERROR,0,0
1590902444761088000,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-11 11:01:15,C++,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n\n\nint shusu(int x){\n    int a,b,j;\n    b=int(sqrt(x));\n    //printf(\""开放=%d\"",b);\n    for(a=2;a<=b+1;a++){\n        if(x%a==0){\n            j=1;\n            break;\n        }\n        else j=0;\n\n    }\n    return j;\n}\nint main(){\n    int x,y,z;\n    int i=1;\n    scanf(\""%d\"",&x);\n    for (y=2;y<=x;y++){\n        z=shusu(y);\n        if(z==0) {i+=1;\n        //printf(\""!\"");\n        }\n\n    }\n    printf(\""%d\\n\"",i);\n    return 0;\n\n}\n",ACCEPTED,15,460
1590902473697570816,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-11 11:01:21,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h> \nint main(){\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(int i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(int i=0;i<n;i++){\n\t\t\tprintf(\""6\\n\"");\n\t\t}\n}",WRONG_ANSWER,10,484
1590902482941837312,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 11:01:24,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main(void)\n{\n    int n,i;\n    int a[10];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=0;j<n;j++)\n    {\n        k=6**a[j];\n        \n    }\n}",COMPILE_ERROR,0,0
1590902484284018688,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-11 11:01:24,Java,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"import java.util.Scanner;\npublic class Main{\n    public static void main(String args[]){\n        int X,Y,Z;\n        Scanner scanner = new Scanner(System.in);\n        X=scanner.nextInt();\n        Y=scanner.nextInt();\n        Z=scanner.nextInt();\n        System.out.printf(X+Y+Z);\n    }\n}",COMPILE_ERROR,0,0
1590902524012466176,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 11:01:33,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main(void)\n{\n    int n,i,j;\n    int a[10];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=0;j<n;j++)\n    {\n        k=6**a[j];\n        \n    }\n}",COMPILE_ERROR,0,0
1590902548788219904,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 11:01:39,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"int main(){\n  int i,j,n;\n  scanf(\""%d\"",&n);\n  for (i = 2; i <n ; i++) {\n    for (j = 2; j <i ; j++) {\n      if (i%j == 0){\n        break;\n      }\n    }\n    if (i == j){\n      printf(\""%d,\"",i);\n    }\n  }\n  return 0;\n}",TIME_LIMIT_EXCEEDED,400,300
1590902558934216704,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 11:01:42,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main(void)\n{\n    int n,i,j,k;\n    int a[10];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=0;j<n;j++)\n    {\n        k=6**a[j];\n        \n    }\n}",COMPILE_ERROR,0,0
1590902563623469056,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-11 11:01:43,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#incloud<stdio.h>\nint mian() {\n    int temp,i = 0;\n    scanf(\""%d\"",&temp);\n    while(i<temp) {\n        printf(\""%d\"",6);\n    }\n}",COMPILE_ERROR,0,0
1590902598058704896,6ba5ecacf3381a1e9382f99c413290eca40a071a563a618e5f36d66cbf9a5e1b,2022-11-11 11:01:51,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,#include<iostream>\nusing namespace std;\nint main(){\n    int n;\n    cin>>n;\n    for(int i=0;i<n;i++){\n        int x;\n        cin>>x;\n        int sum=1;\n        for(int j=0;j<x;j++){\n            sum*=6;\n            sum%=10;\n        }\n        cout<<sum<<endl;\n    }\n},TIME_LIMIT_EXCEEDED,54,476
1590902656850264064,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 11:02:05,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n    return 0;\n}\n",ACCEPTED,7,200
1590902696801009664,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-11 11:02:15,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n,i,j;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++){\n        j=a[i]%10;\n        printf(\""%d \"",j);\n    }\n}",WRONG_ANSWER,5,336
1590902746813894656,5ed1ed5f3786d45db71190023ef590496fd0d8d8cfe4af0f2c94d1d387178674,2022-11-11 11:02:27,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n    return 0;\n}\n",ACCEPTED,8,332
1590902759044460544,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-11 11:02:29,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n,i,j;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++){\n        j=a[i]%10;\n        printf(\""%d\\n\"",j);\n    }\n}",WRONG_ANSWER,4,372
1590902779533660160,9ca3f63f61fa4f349009d69e7059514c3a39dbdd5a1f94342c11f4c33ccdceaa,2022-11-11 11:02:34,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"x = int(input())\ny = input().split(\"" \"")\nfor i in range(x):\n    #a,b,c = [int(x) for x in input().split(\"" \"")]\n    a = int(y[i])\n    b = 6**a\n    c = (b//10)*10\n    b = b - c\n    print(b)\n",TIME_LIMIT_EXCEEDED,67,3352
1590902814744817664,9ca3f63f61fa4f349009d69e7059514c3a39dbdd5a1f94342c11f4c33ccdceaa,2022-11-11 11:02:43,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"x = int(input())\ny = input().split(\"" \"")\nfor i in range(x):\n    #a,b,c = [int(x) for x in input().split(\"" \"")]\n    a = int(y[i])\n    b = 6**a\n    c = (b//10)*10\n    b = b - c\n    print(b)\n",TIME_LIMIT_EXCEEDED,68,3356
1590902838174220288,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-11 11:02:48,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h> \nint main(){\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(int i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(int i=0;i<n-1;i++){\n\t\t\tprintf(\""6\\n\"");\n\t\t}\n\t\t\tprintf(\""6\"");\n\t\t\t\t\n}",WRONG_ANSWER,11,472
1590902849062612992,23d287b80d4d430308a1b57ee92bb4f2d1b25d1142a13c1c0fda4316c9bb9f17,2022-11-11 11:02:51,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"X,Y,Z=int(input(\""\"")),int(input(\""\"")),int(input(\""\""))\nH=X+Y-Z\nprint(H)\n",NON_ZERO_EXIT_CODE,19,2820
1590902951684673536,0354b067c4132d4425a90b77482ac717447702274cb7db1282edce56eaf037b3,2022-11-11 11:03:15,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main()\n{\n  int a[100],b[100],n;\n  int i,j,sum,ans,c;\n  ans=sum=0;\n  scanf(\""%d\"",&n);\n  a[0]=b[0]=0;\n  for(i=1;i<=n;i++)\n     scanf(\""%d\"",&a[i]);\n  for(j=1;j<=n;j++)\n     scanf(\""%d\"",&b[j]);\n  i=1;\n  ans=b[0]-a[0];\n  while(i<=n){\n     c=b[i]-a[i];\n     sum=sum+c;\n     if(ans<=sum)\n        ans=sum;\n     i++;\n   }\n    printf(\""%d\"",ans);\n    return 0;\n}",WRONG_ANSWER,5,180
1590902953496588288,2cb092ec618cde3657d677b73f7a0a7bfb1e0da02f466007878113e6c4db4792,2022-11-11 11:03:16,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"printf(\""2022\"");",COMPILE_ERROR,0,0
1590902955010752512,5a1c17b308a3b3595833d34c6bdfb75e9f5dd0d065acfeb7f28ab8102ba7406c,2022-11-11 11:03:16,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"printf(\""2022\"");",COMPILE_ERROR,0,0
1590902979337695232,6cbd81921f92855c6b8318725b09ef7ec48ff579276b3df9f7ea04bea9804678,2022-11-11 11:03:22,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""2022\\n\"");\n    return 0;\n}\n",ACCEPTED,7,372
1590903187983372288,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-11 11:04:12,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint mian() {\n    int temp,i = 0;\n    scanf(\""%d\"",&temp);\n    while(i<temp) {\n        printf(\""%d\"",6);\n    }\n}",COMPILE_ERROR,0,0
1590903220657000448,2cb092ec618cde3657d677b73f7a0a7bfb1e0da02f466007878113e6c4db4792,2022-11-11 11:04:20,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n printf(\""2022\"");\n    return 0;\n}\n\n",ACCEPTED,4,196
1590903419978715136,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 11:05:07,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n = 0;\n    int count = 0;\n    scanf(\""%d\"",&n);\n    for(int i = 0; i < n; ++i)\n    {\n        for(int j = 0; j < n; ++j)\n        {\n            if(i % j == 0)\n            {\n                if(i != j)\n                {\n                    break;\n                }\n                else\n                {\n                    count++;\n                }\n            }\n        }\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",FLOAT_POINT_EXCEPTION,3,440
1590903428971298816,e4f316bfe970c62bf57b46f5ef8a290748707bf16f041fe868d04986a0cdd64f,2022-11-11 11:05:09,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"print(\""2022\"")",ACCEPTED,16,2756
1590903438811140096,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-11 11:05:12,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n    int n,i,j;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++){\n        j=pow(6,a[i])%10;\n        printf(\""%d\\n\"",j);\n    }\n}",COMPILE_ERROR,0,0
1590903446184722432,9ca3f63f61fa4f349009d69e7059514c3a39dbdd5a1f94342c11f4c33ccdceaa,2022-11-11 11:05:13,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"x = int(input())\ny = input().split(\"" \"")\nfor i in range(x):\n    #a,b,c = [int(x) for x in input().split(\"" \"")]\n    a = int(y[i])\n    b = 6**a\n    b = b-(b//10)*10\n    print(b)\n",TIME_LIMIT_EXCEEDED,69,3388
1590903640792043520,b95d43d4e550820a57e0a7b63f63233a65cb813e77be0e6c08c1739f86678946,2022-11-11 11:06:00,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint X,Y,Z;\nscanf(\""%d %d %d\"",&X,&Y,&Z);\nif(Y>=0 && Y<=100 && Y>=0 && Y<=100 && Z>=0 && Z<=100)\n    printf(X+Y-Z)",COMPILE_ERROR,0,0
1590903684790292480,6cbd81921f92855c6b8318725b09ef7ec48ff579276b3df9f7ea04bea9804678,2022-11-11 11:06:10,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    printf(\""%d\"",X+Y-Z);\n    return 0;\n}\n",ACCEPTED,6,448
1590903707284340736,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 11:06:16,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main(void)\n{\n    int n,i,j,k;\n    int a[10];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=0;j<n;j++)\n    {\n        k=6**a[j];\n        if(k=>100&&k<1000)\n        {\n            d=k%100;\n        }\n        if(k=>1000&&k<10000)\n        {\n            d=k%1000;\n        }\n        printf(\""%d\"",d);\n        printf(\""\\n\"");\n    }\n}",COMPILE_ERROR,0,0
1590903719435218944,5a1c17b308a3b3595833d34c6bdfb75e9f5dd0d065acfeb7f28ab8102ba7406c,2022-11-11 11:06:18,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,3,184
1590903727584751616,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 11:06:20,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\n\nl = int(input())\ndata = list(map(eval,input().split()))\nfor i in range(l):\n    s=int(math.pow(6,data[i]))\n    s=str(s)\n    print(s)\n    print(s[-1])\n",WRONG_ANSWER,19,2816
1590903786430861312,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 11:06:34,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\n\nl = int(input())\ndata = list(map(eval,input().split()))\nfor i in range(l):\n    s=int(math.pow(6,data[i]))\n    s=str(s)\n    \n    print(s[-1])\n",NON_ZERO_EXIT_CODE,39,2876
1590903793200463872,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-11 11:06:36,Java,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"import java.util.Scanner;\n\npublic class Main{\n    public static void main(String args[]){\n        int X,Y,Z;\n        Scanner scanner = new Scanner(System.in);\n        X=scanner.nextInt();\n        Y=scanner.nextInt();\n        Z=scanner.nextInt();\n        System.out.print(X+Y+Z);\n    }\n}",WRONG_ANSWER,132,16856
1590903832018747392,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 11:06:45,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"int main(){\n  int i,j,n;\n  scanf(\""%d\"",&n);\n  for (i = 0; i <n ; i++) {\n    for (j = 2; j <i ; j++) {\n      if (i%j == 0){\n        break;\n      }\n         if (i == j){\n      printf(\""%d,\"",i);\n    }\n    }\n   \n  }\n  return 0;\n}",WRONG_ANSWER,3,336
1590903866533679104,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 11:06:54,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t = 0;\n    scanf_s(\""%d\"",&t);\n    while(t--)\n    {\n        int n = 0;\n        scanf_s(\""%d\"",&n);\n        int sum = pow(6,n);\n        int num = sum % 10;\n        printf(\""%d\\n\"",num);\n    }\n    return 0; \n\n}",COMPILE_ERROR,0,0
1590903872556675072,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-11 11:06:55,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint mian() {\n    int temp,i = 0;\n    cin >> temp;\n    while(i<temp) {\n        cout << 6;\n    }\n}",COMPILE_ERROR,0,0
1590903880890781696,7935e8f5cb04027f4d30ac84a997e2d03e946e112c1cb17f1a4f943d8b0b54bf,2022-11-11 11:06:57,C++,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<iostream>\n#include<algorithm>\n#include<stdio.h>\nusing namespace std;\n\nint main(){\n    int n,i,j,m;\n    scanf(\""%d\"",&n);\n    int a[n][n],b[n],c[n];\n    fill(a[0],a[0]+n*n,0);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&c[i]);\n        c[i]=c[i]-b[i];\n    }\n    for(i=0;i<n;i++)\n    {\n        for(j=i;j<n;j++)\n        {\n            if(i==0&&j==0)\n            {\n                a[i][j]=c[j];\n                continue;\n            }\n            a[i][j]=a[i][j-1]+c[j];\n        }\n    }\n    for(i=0;i<n;i++)\n        sort(a[i],a[i]+n);\n        m=a[0][n-1];\n    for(i=0;i<n;i++)\n    {\n        if(m<a[i][n-1])\n            m=a[i][n-1];\n    }\n    printf(\""%d\"",m);\n\treturn 0;\n}\n",ACCEPTED,4,320
1590903884313309184,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-11 11:06:58,Java,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"import java.util.Scanner;\n\npublic class Main{\n    public static void main(String args[]){\n        int X,Y,Z;\n        Scanner scanner = new Scanner(System.in);\n        X=scanner.nextInt();\n        Y=scanner.nextInt();\n        Z=scanner.nextInt();\n        System.out.println(X+Y+Z);\n    }\n}",WRONG_ANSWER,131,17004
1590903915921608704,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 11:07:05,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\n\nl = int(input())\ndata = list(map(eval,input().split()))\nfor i in range(l):\n    s=int(math.pow(6,data[i]))\n    s=str(s)\n    print(s[-1])",NON_ZERO_EXIT_CODE,44,2832
1590903922351472640,5a1c17b308a3b3595833d34c6bdfb75e9f5dd0d065acfeb7f28ab8102ba7406c,2022-11-11 11:07:07,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main()\n{\n    int a,b,c;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    printf(\""%d\"",a+b-c);\n    return 0;\n}",ACCEPTED,6,332
1590903958732845056,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-11 11:07:15,Java,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"import java.util.Scanner;\n\npublic class Main{\n    public static void main(String args[]){\n        int X,Y,Z;\n        Scanner scanner = new Scanner(System.in);\n        X=scanner.nextInt();\n        Y=scanner.nextInt();\n        Z=scanner.nextInt();\n        System.out.println(X+Y-Z);\n    }\n}",ACCEPTED,256,16380
1590904060398579712,9ca3f63f61fa4f349009d69e7059514c3a39dbdd5a1f94342c11f4c33ccdceaa,2022-11-11 11:07:40,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"x = int(input())\ny = input().split(\"" \"")\n'''for i in range(x):\n    #a,b,c = [int(x) for x in input().split(\"" \"")]\n    a = int(y[i])\n    b = 6**a\n    b = b-(b//10)*10\n    print(b)'''\nfor i in range(x):\n    print (6)",WRONG_ANSWER,64,2856
1590904072163602432,9ca3f63f61fa4f349009d69e7059514c3a39dbdd5a1f94342c11f4c33ccdceaa,2022-11-11 11:07:43,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"x = int(input())\ny = input().split(\"" \"")\n'''for i in range(x):\n    #a,b,c = [int(x) for x in input().split(\"" \"")]\n    a = int(y[i])\n    b = 6**a\n    b = b-(b//10)*10\n    print(b)'''\nfor i in range(x):\n    print (6)",WRONG_ANSWER,54,2816
1590904129537511424,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-11 11:07:56,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\nusing namespace std;\nint mian() {\n    int temp,i = 0;\n    cin >> temp;\n    while(i<temp) {\n        cout << 6;\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1590904158587260928,e715137eeb4190ade2330123b989bbdd6eebd9a5e1df2e292271d3bfe3a79c69,2022-11-11 11:08:03,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,3,196
1590904169098182656,6ba5ecacf3381a1e9382f99c413290eca40a071a563a618e5f36d66cbf9a5e1b,2022-11-11 11:08:06,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"n=int(input())\nx=input()\ny=x.split(\"" \"")\nfor i in range(0,n):\n    add=6**int(y[i])\n    print(add%10)",TIME_LIMIT_EXCEEDED,70,3412
1590904217643057152,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-11 11:08:17,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h> \nint main(){\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(int i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\nfor(int i=0;i<n;i++){\n\tif(i<n)\tprintf(\""6\\n\"");\n\telse printf(\""6\"");\n\t}\n\t\t\t\t\n}",WRONG_ANSWER,11,472
1590904218993602560,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 11:08:18,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int t,i,ed,z;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<t;i++)\n    {z=0;\n    z=pow(6,a[i]);\n    ed=z%10;\n    printf(\""%d\\n\"",ed);}\n    return 0;\n}",WRONG_ANSWER,7,312
1590904220864282624,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-11 11:08:18,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\nusing namespace std;\nint mian() {\n    int temp,i = 0;\n    cin >> temp;\n    while(i<temp) {\n        cout << 6;\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1590904223364067328,d122b81a371b28751082747cf65a235d0eddfd496e142775cd971d8f88adf327,2022-11-11 11:08:19,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main(){\n    int x,y,z;\n    int a;\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    a=x+y-z;\n    printf(\""%d\"",a);\n    return 0;\n}",ACCEPTED,7,196
1590904225540911104,9ca3f63f61fa4f349009d69e7059514c3a39dbdd5a1f94342c11f4c33ccdceaa,2022-11-11 11:08:19,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"x = int(input())\ny = input().split(\"" \"")\n'''for i in range(x):\n    #a,b,c = [int(x) for x in input().split(\"" \"")]\n    a = int(y[i])\n    b = 6**a\n    b = b-(b//10)*10\n    print(b)'''\nfor i in range(x):\n    print (\""6\"")\n",WRONG_ANSWER,54,2924
1590904248504745984,d122b81a371b28751082747cf65a235d0eddfd496e142775cd971d8f88adf327,2022-11-11 11:08:25,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main(){\n    int x,y,z;\n    int a;\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    a=x+y-z;\n    printf(\""%d\"",a);\n    return 0;\n}",ACCEPTED,8,332
1590904269090394112,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 11:08:29,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#define _CRT_SECURE_NO_WARNINGS\n#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t = 0;\n    scanf_s(\""%d\"",&t);\n    while(t--)\n    {\n        int n = 0;\n        scanf_s(\""%d\"",&n);\n        int sum = pow(6,n);\n        int num = sum % 10;\n        printf(\""%d\\n\"",num);\n    }\n    return 0; \n\n}",COMPILE_ERROR,0,0
1590904291223711744,a57fdafe4877cd9608fc0ac8a5120a47bc60a015785960e61b67b4e66187c2f2,2022-11-11 11:08:35,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main(){\n    printf(\""2022\\n\"");\n    return 0;\n}",ACCEPTED,5,476
1590904311633195008,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 11:08:40,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#define _CRT_SECURE_NO_WARNINGS\n#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t = 0;\n    scanf(\""%d\"",&t);\n    while(t--)\n    {\n        int n = 0;\n        scanf(\""%d\"",&n);\n        int sum = pow(6,n);\n        int num = sum % 10;\n        printf(\""%d\\n\"",num);\n    }\n    return 0; \n\n}",WRONG_ANSWER,11,328
1590904340745859072,6ba5ecacf3381a1e9382f99c413290eca40a071a563a618e5f36d66cbf9a5e1b,2022-11-11 11:08:47,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"n=int(input())\nx=input()\ny=x.split(\"" \"")\nfor i in range(0,n):\n    print(\""6\"")",WRONG_ANSWER,53,3032
1590904438691246080,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 11:09:10,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t,i,ed,z;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<t;i++)\n    {z=0;\n    z=pow(6,a[i]);\n    ed=z%10;\n    printf(\""%d\\n\"",ed);}\n    return 0;\n}",WRONG_ANSWER,7,340
1590904445477654528,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 11:09:12,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\nl = int(input())\ndata = list(map(eval,input().split()))\nfor i in range(l):\n    s=int(math.pow(6,data[i]))\n    s=str(s)\n    print(s[-1])",NON_ZERO_EXIT_CODE,51,2900
1590904465874530304,d122b81a371b28751082747cf65a235d0eddfd496e142775cd971d8f88adf327,2022-11-11 11:09:16,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main(){\n    int i=2022;\nprintf (\""%d\"",i);\nreturn 0;\n}",ACCEPTED,5,372
1590904492290256896,6ba5ecacf3381a1e9382f99c413290eca40a071a563a618e5f36d66cbf9a5e1b,2022-11-11 11:09:23,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"n=int(input())\nx=input()\nfor i in range(0,n):\n    print(\""6\"")",WRONG_ANSWER,55,2920
1590904495314350080,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 11:09:23,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(void)\n{\n    int t = 0;\n    scanf(\""%d\"",&t);\n    while(t--)\n    {\n        int n = 0;\n        scanf(\""%d\"",&n);\n        int sum = pow(6,n);\n        int num = sum % 10;\n        printf(\""%d\\n\"",num);\n    }\n    //return 0;\n}",WRONG_ANSWER,11,348
1590904550503022592,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-11 11:09:37,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n\nint mian() {\n    int temp,i = 0;\n    scanf(\""%d\"",&temp);\n    while(i<temp) {\n        printf(\""%d\"",6);\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1590904589942042624,c5cc6f9845df4bd1986af86c0696296436bbc0f00a10a9f891b4100e57bc3a19,2022-11-11 11:09:46,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <bits/stdc++.h>\nusing namespace std;\n#define N 1000000000\nint main()\n{\n\tint n,a;\n\tcin>>n;\n\tfor(int i=0;i<n;i++) {\n\t\tcin>>a;\n\t\tif(i<n-1)\n\t\t{\n\t\t\tif(a) cout<<\""6\""<<endl;\n\t\t\telse cout<<\""1\""<<endl;\n\t\t}\n\t\telse \n\t\t{\n\t\t\tif(a) cout<<\""6\"";\n\t\t\telse cout<<\""1\"";\n\t\t}\n\t}\n}",ACCEPTED,12,500
1590904689439342592,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 11:10:10,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main(){\n  int i,j,n;\n  scanf(\""%d\"",&n);\n  for (i = 2; i <n ; i++) {\n    for (j = 2; j <i ; j++) {\n      if (i%j == 0){\n        break;\n      }\n         if (i == j){\n      printf(\""%d,\"",i);\n    }\n    }\n   \n  }\n  return 0;\n}",WRONG_ANSWER,5,344
1590904697270087680,6ba5ecacf3381a1e9382f99c413290eca40a071a563a618e5f36d66cbf9a5e1b,2022-11-11 11:10:12,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,#include<iostream>\nusing namespace std;\nint main(){\n    long n;\n    cin>>n;\n    for(long i=0;i<n;i++){\n        cout<<6<<endl;\n    }\n},WRONG_ANSWER,13,600
1590904720418476032,9ca3f63f61fa4f349009d69e7059514c3a39dbdd5a1f94342c11f4c33ccdceaa,2022-11-11 11:10:17,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"x = int(input())\ny = input().split(\"" \"")\nfor i in range(x):\n    #a,b,c = [int(x) for x in input().split(\"" \"")]\n    a = int(y[i])\n    b = 6**a-(6**a//10)*10\n    print(b)\n",TIME_LIMIT_EXCEEDED,67,3428
1590904747203301376,23d287b80d4d430308a1b57ee92bb4f2d1b25d1142a13c1c0fda4316c9bb9f17,2022-11-11 11:10:23,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"X,Y,Z=int(input(\""\"")),int(input(\""\"")),int(input(\""\""))\nprint(X+Y-Z)\n",NON_ZERO_EXIT_CODE,16,2752
1590904771421212672,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 11:10:29,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main(){\n  int i,j,n;\n  scanf(\""%d\"",&n);\n  for (i = 2; i <n ; i++) {\n    for (j = 2; j <i ; j++) {\n      if (i%j == 0){\n        break;\n      }\n  \n    }\n     if (i == j){\n      printf(\""%d,\"",i);\n    }\n  }\n  return 0;\n}",TIME_LIMIT_EXCEEDED,400,332
1590904893924245504,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-11 11:10:58,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,temp = input();\nfor i in range(temp+1):\n    print(6);,NON_ZERO_EXIT_CODE,22,2748
1590904958399066112,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 11:11:14,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int n,sum,yu;\n    scanf(\""%d\"",&n);\n    sum=exp(6,n);\n    yu=sum%10;\n    printf(\""%d\"",yu);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590904996235907072,0354b067c4132d4425a90b77482ac717447702274cb7db1282edce56eaf037b3,2022-11-11 11:11:23,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main()\n{\n  int a[100],b[100],n;\n  int i,j,sum,ans,c;\n  ans=sum=0;\n  scanf(\""%d\"",&n);\n  if(n==0)\n    ans=0;\n  else{\n  for(i=0;i<n;i++)\n     scanf(\""%d\"",&a[i]);\n  for(j=0;j<n;j++)\n     scanf(\""%d\"",&b[j]);\n  i=0;\n  ans=b[0]-a[0];\n  while(i<n){\n     c=b[i]-a[i];\n     sum=sum+c;\n     if(ans<=sum)\n        ans=sum;\n     i++;\n   }\n  }\n    printf(\""%d\"",ans);\n    return 0;\n}",WRONG_ANSWER,4,324
1590904996512727040,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-11 11:11:23,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,temp = input();\nfor i in range(temp+1):\n    print(6);,NON_ZERO_EXIT_CODE,20,2912
1590905002577670144,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 11:11:24,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"\nl = int(input())\ndata = list(map(eval,input().split()))\nfor i in range(l):\n    for j in range(data[i]):\n        s=1\n        s = s*6\n    s=str(s)\n    print(s[-1])",TIME_LIMIT_EXCEEDED,68,2928
1590905043010781184,a57fdafe4877cd9608fc0ac8a5120a47bc60a015785960e61b67b4e66187c2f2,2022-11-11 11:11:34,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main(){\n    int a,b,c;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    printf(\""%d\"",a+b-c);\n    return 0;\n}",ACCEPTED,6,344
1590905045380542464,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-11 11:11:35,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h> \nint main(){\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(int i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\nfor(int i=0;i<n;i++){\n\tif(i<n-1){\n\tprintf(\""6\"");\n\tprintf(\""\\n\"");}\n\telse printf(\""6\""); \n\t}\n\t\t\t\t\n}",WRONG_ANSWER,15,468
1590905089924050944,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 11:11:45,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\nl = int(input())\ndata = list(map(eval,input().split()))\nfor i in range(l):\n    s=int(math.pow(6,data[i]))\n    s=str(s)\n    print(s[-1])\n    ",NON_ZERO_EXIT_CODE,37,2820
1590905096739794944,5a1c17b308a3b3595833d34c6bdfb75e9f5dd0d065acfeb7f28ab8102ba7406c,2022-11-11 11:11:47,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main()\n{\n    int n,i;\n    scanf(\""%d\"",&n);\n    int x;\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&x);\n        printf(\""%d\\n\"",(int)pow(6,x)%10);\n    }\n    return 0;\n}",WRONG_ANSWER,23,328
1590905130076147712,6ba5ecacf3381a1e9382f99c413290eca40a071a563a618e5f36d66cbf9a5e1b,2022-11-11 11:11:55,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,#include<iostream>\nusing namespace std;\nint main(){\n    long n;\n    cin>>n;\n    for(long i=1;i<=n;i++){\n        cout<<6;\n        if(i<n)\n            cout<<endl;\n    }\n},WRONG_ANSWER,14,324
1590905147889352704,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 11:11:59,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\nl = int(input())\ndata = list(map(eval,input().split()))\nfor i in range(l):\n    s=int(math.pow(6,data[i]))\n    s=str(s)\n    print(s[-1])\n    ",NON_ZERO_EXIT_CODE,38,2904
1590905174581903360,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-11 11:12:05,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n    int n,i,k;\n    double j;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++){\n        j=pow(6,a[i]);\n        int h=(int)j;\n        k=h%10;\n        printf(\""%d\\n\"",k);\n    }\n}",WRONG_ANSWER,6,348
1590905228143165440,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 11:12:18,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\nl = int(input())\ndata = list(map(eval,input().split()))\nfor i in range(l):\n    s=int(math.pow(6,data[i]))\n    s=str(s)\n    print(s[-1])\nprint()",NON_ZERO_EXIT_CODE,38,2816
1590905258346352640,5a1c17b308a3b3595833d34c6bdfb75e9f5dd0d065acfeb7f28ab8102ba7406c,2022-11-11 11:12:25,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main()\n{\n    int n,i;\n    scanf(\""%d\"",&n);\n    int x;\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&x);\n        printf(\""%d\\n\"",(int)pow(6,x)%10);\n    }\n    return 0;\n}",WRONG_ANSWER,9,384
1590905289052848128,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 11:12:33,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t = 0;\n    scanf(\""%d\"",&t);\n    while(t--)\n    {\n        int n = 0;\n        scanf(\""%d\"",&n);\n        int sum = pow(6,n);\n        int num = sum % 10;\n        printf(\""%d\\n\"",num);\n    }\n    return 0;\n}",WRONG_ANSWER,8,468
1590905391255453696,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 11:12:57,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    int n,i,j;\n    scanf(\""%d\"",&n);\n    for(i=1;i<n;i++)\n    {\n        for(int k=2;k<i;k++)\n        {\n            if(i%k==0)\n            {\n                j++;\n            }\n        }\n    }\n    printf(\""%d\"",j);\n}",TIME_LIMIT_EXCEEDED,400,324
1590905413787258880,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 11:13:02,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    int n,i,j;\n    scanf(\""%d\"",&n);\n    for(i=1;i<n;i++)\n    {\n        for(int k=2;k<i;k++)\n        {\n            if(i%k==0)\n            {\n                j++;\n            }\n        }\n    }\n    printf(\""%d\"",j);\n}",TIME_LIMIT_EXCEEDED,400,184
1590905510633713664,2bc6a85c0376656012a7970a7842a2a9d8769555a79ef4eec85ff45aa30ff7b7,2022-11-11 11:13:25,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main() {\n\tint count;\n\tscanf(\""%d\"", &count);\n\tint num;\n\twhile (count -- != 0) {\n\t\tscanf(\""%d\"", &num);\n\t\tprintf(\""%d\\n\"", (int) pow(6,num) %10);\n\t}\n\treturn 0;\n} ",WRONG_ANSWER,8,472
1590905517155876864,423e1acd0d02cf3d43f3c7805099dea4edcb39c2e0fa385e82823b5a7c0dd214,2022-11-11 11:13:27,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <iostream>\n\nint main()\n{\n    std::cout << \""2022\\n\"";\n}",COMPILE_ERROR,0,0
1590905526395908096,667c2e97e82c372f60661d46943ff56a17c9350387f4364ebabe70ac2e232862,2022-11-11 11:13:29,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}\n",ACCEPTED,4,312
1590905527503228928,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 11:13:30,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int i,x,n,sum,yu;\n    scanf(\""%d\"",x);\n    for(i=0;i<x;i++){\n    scanf(\""%d\"",&n);\n    sum=exp(6,n);\n    yu=sum%10;\n    printf(\""%d\\n\"",yu);}\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590905604154134528,2bc6a85c0376656012a7970a7842a2a9d8769555a79ef4eec85ff45aa30ff7b7,2022-11-11 11:13:48,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main() {\n\tint count;\n\tscanf(\""%d\"", &count);\n\tint num;\n\twhile (count -- != 0) {\n\t\tscanf(\""%d\"", &num);\n\t\tprintf(\""%d\\n\"", (int) pow(6,num) %10);\n\t}\n\treturn 0;\n} ",WRONG_ANSWER,11,524
1590905659573469184,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-11 11:14:01,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,temp = input();\nif temp == 0:\n    print(0);\nelse:\n    for i in range(temp+1):\n        print(6);,NON_ZERO_EXIT_CODE,18,2876
1590905663369293824,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 11:14:02,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\nl = int(input())\ndata = list(map(eval,input().split()))\nfor i in range(l):\n    if 0<=data[i]<=1000000000:\n        s=int(math.pow(6,data[i]))\n        s=str(s)\n        print(s[-1])\n    else:\n        break",WRONG_ANSWER,40,2900
1590905679664189440,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 11:14:06,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main(){\n  int i,j,n,k=0;\n  scanf(\""%d\"",&n);\n  for (i = 2; i <n ; i++) {\n    for (j = 2; j <i ; j++)\n        {\n      if (i%j == 0)\n        break;\n    }\n     if (i==j)\n       k++;\n\n  }\n  printf(\""%d\"",k);\n  return 0;\n}\n",TIME_LIMIT_EXCEEDED,400,500
1590905681295769600,423e1acd0d02cf3d43f3c7805099dea4edcb39c2e0fa385e82823b5a7c0dd214,2022-11-11 11:14:06,C++,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <iostream>\n\nint main()\n{\n    std::cout << \""2022\\n\"";\n}",ACCEPTED,5,600
1590905713117958144,b95d43d4e550820a57e0a7b63f63233a65cb813e77be0e6c08c1739f86678946,2022-11-11 11:14:14,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(){\n    int X,Y,Z,sum;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    sum=X+Y-Z;\n    if(Y>=0 && Y<=100 && Y>=0 && Y<=100 && Z>=0 && Z<=100)\n        printf(\""%d\"",sum);\nreturn 0;\n}\n\n",ACCEPTED,6,200
1590905728813039616,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 11:14:18,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int i,x,n,sum,yu;\n    scanf(\""%d\"",&x);\n    for(i=0;i<x;i++){\n    scanf(\""%d\"",&n);\n    sum=exp(6,n);\n    yu=sum%10;\n    printf(\""%d\\n\"",yu);}\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590905763701239808,1773d9c971942817d949c47973c4eb8c24531f728d5480dbf3b232e568926258,2022-11-11 11:14:26,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.*;\nimport java.lang.Math;\nclass Main{\n    public static void main(String[] args){\n        Scanner scanner = new Scanner(System.in);\n        int num = scanner.nextInt();\n        for(int i = 0;i < num;i++){\n            int x = scanner.nextInt();\n            int v = (int)Math.pow(6, x);\n            int z = v % 10;\n            System.out.println(z);\n        }\n    }\n}",TIME_LIMIT_EXCEEDED,50,14824
1590905824157937664,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 11:14:40,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\nl = int(input())\ndata = list(map(eval,input().split()))\nfor i in range(l):\n    if 0<=data[i]<=1000000000:\n        s=int(math.pow(6,data[i]))\n        s=list(s)\n        print(s[-1])\n    else:\n        break",NON_ZERO_EXIT_CODE,17,2816
1590905826968141824,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-11 11:14:41,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdilb.h>\n#include<math.h>\nint main(){\n    int n,i,k;\n    double j;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++){\n        j=pow(6,a[i]);\n        int h=(int)j;\n        k=h%10;\n        printf(\""%d\\n\"",k);\n    }\n}",COMPILE_ERROR,0,0
1590905826997501952,c9a8fe962a36cf99ca362f66348b02453584251c62fe2356e11d2a6efd5cee45,2022-11-11 11:14:41,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z;\n    int a;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    printf(\""%d\"",X+Y-Z);\n    return 0;\n}\n",ACCEPTED,8,344
1590905858802909184,5a1c17b308a3b3595833d34c6bdfb75e9f5dd0d065acfeb7f28ab8102ba7406c,2022-11-11 11:14:49,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main()\n{\n    int n,i;\n    scanf(\""%d\"",&n);\n    int x;\n    int cnt = 0;\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&x);\n        cnt++;\n        printf(\""%d\"",(int)pow(6,x)%10);\n        if(cnt!=n){\n            printf(\""\\n\"");\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,8,312
1590905870869901312,0354b067c4132d4425a90b77482ac717447702274cb7db1282edce56eaf037b3,2022-11-11 11:14:51,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main()\n{\n  int a[100],b[100],n;\n  int i,j,sum,ans,c;\n  ans=sum=0;\n  scanf(\""%d\"",&n);\n  if(n<=0)\n    ans=0;\n  else{\n  for(i=0;i<n;i++)\n     scanf(\""%d\"",&a[i]);\n  for(j=0;j<n;j++)\n     scanf(\""%d\"",&b[j]);\n  i=0;\n  ans=b[0]-a[0];\n  while(i<n){\n     c=b[i]-a[i];\n     sum=sum+c;\n     if(ans<=sum)\n        ans=sum;\n     i++;\n   }\n  }\n    printf(\""%d\"",ans);\n    return 0;\n}",WRONG_ANSWER,3,196
1590905874804178944,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 11:14:52,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    int n,i,j=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<n;i++)\n    {\n        for(int k=2;k<i;k++)\n        {\n            if(i%k==0)\n            {\n                j++;\n            }\n        }\n    }\n    printf(\""%d\"",j);\n}",TIME_LIMIT_EXCEEDED,400,180
1590905898128707584,54914c90623988219ee55c4a0b2e645efd9808505aa25f0099930bfa8bf18ad1,2022-11-11 11:14:58,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int a;\n    scanf(\""%d%\"",&a);\n    int k,i,s,z;\n    for(i=0; i<a; i++){\n        scanf(\""%d\"",&k);\n        s = pow(6,k);\n        z = s%10;\n        printf(\""%d\\n\"",z);\n    }\n}\n",WRONG_ANSWER,7,336
1590905912594857984,1773d9c971942817d949c47973c4eb8c24531f728d5480dbf3b232e568926258,2022-11-11 11:15:01,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.*;\nimport java.lang.Math;\nclass Main{\n    public static void main(String[] args){\n        Scanner scanner = new Scanner(System.in);\n        int num = scanner.nextInt();\n        for(int i = 0;i < num;i++){\n            int x = scanner.nextInt();\n            int v = (int)Math.pow(6, x);\n            int z = v % 10;\n            System.out.println(z);\n        }\n    }\n}",TIME_LIMIT_EXCEEDED,50,13356
1590905929728589824,6de81974dc8c65943a7aa7eec331767cc67f98683db11d3405a39c1495f3fcdf,2022-11-11 11:15:05,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(){\n    int X,Y,Z,sum;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    sum=X+Y-Z;\n    if(Y>=0 && Y<=100 && Y>=0 && Y<=100 && Z>=0 && Z<=100)\n        printf(\""%d\"",sum);\nreturn 0;\n}",ACCEPTED,6,328
1590905938695991296,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 11:15:08,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t,i,ed,z;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<t;i++)\n    {\n    z=pow(6,a[i]);\n    ed=z%10;\n    printf(\""%d\\n\"",ed);}\n    return 0;\n}",WRONG_ANSWER,6,332
1590905983654760448,ce1bb8e96385d94dfdb2bd028407e2ffb5a64494440cd7964d6624a83809dae6,2022-11-11 11:15:18,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n\n#include <stdlib.h>\n\n#include <math.h>\n\nint main(){\n\n    int X,Y,Z,sum;\n\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n\n    sum=X+Y-Z;\n\n    if(Y>=0 && Y<=100 && Y>=0 && Y<=100 && Z>=0 && Z<=100)\n\n        printf(\""%d\"",sum);\n\nreturn 0;\n\n}",ACCEPTED,9,332
1590905993008033792,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 11:15:20,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\nl = int(input())\ndata = list(map(eval,input().split()))\nfor i in range(l-1):\n    if 0<=data[i]<=1000000000:\n        s=int(math.pow(6,data[i]))\n        s=str(s)\n        print(s[-1])\n    else:\n        break",WRONG_ANSWER,22,2816
1590906040915394560,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-11 11:15:32,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main(){\n    int n,i,k;\n    double j;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++){\n        j=pow(6,a[i]);\n        int h=(int)j;\n        k=h%10;\n        printf(\""%d\\n\"",k);\n    }\n}",WRONG_ANSWER,9,432
1590906093339979776,5bd1a8718ea7fb820055421c67b8e0a468e08d951f729a24e55bf407b3bdb1f6,2022-11-11 11:15:44,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <iostream>\nusing namespace std;\nint main(){\n    int n,count=997;\n    cin>>n;\n    for(int i=5;i<=n;i++){\n        if(i%2==0){\n            count--;\n            continue;\n                   }\n        for(int j=2;j<i;j++){\n            if(i%j==0) {\n                count--;\n                break;\n            }\n            \n        }\n    }\n    cout<<count;\n}",TIME_LIMIT_EXCEEDED,400,400
1590906122184232960,2bc6a85c0376656012a7970a7842a2a9d8769555a79ef4eec85ff45aa30ff7b7,2022-11-11 11:15:51,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main() {\n\tint count;\n\t(void)scanf(\""%d\"", &count);\n\tint num;\n\twhile (count -- != 0) {\n\t\t(void)scanf(\""%d\"", &num);\n\t\tprintf(\""%d\\n\"", (int) pow(6,num) %10);\n\t}\n\treturn 0;\n} ",WRONG_ANSWER,10,496
1590906170188038144,b69ff333cc0daa10fb20c3ba26e439f64260003a8ff6fde3dbc623fd631ba825,2022-11-11 11:16:03,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n\n#include <stdlib.h>\n\n#include <math.h>\n\nint main(){\n\n    int X,Y,Z,sum;\n\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n\n    sum=X+Y-Z;\n\n    if(Y>=0 && Y<=100 && Y>=0 && Y<=100 && Z>=0 && Z<=100)\n\n        printf(\""%d\"",sum);\n\nreturn 0;\n\n}",ACCEPTED,8,472
1590906178102693888,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 11:16:05,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    int n,i,j=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<n;i++)\n    {\n        for(int k=2;k<i;k++)\n        {\n            if(i%k==0)\n            {\n                j++;\n            }\n        }\n    }\n    printf(\""%d\"",j);\n}",TIME_LIMIT_EXCEEDED,400,188
1590906295459319808,6ba5ecacf3381a1e9382f99c413290eca40a071a563a618e5f36d66cbf9a5e1b,2022-11-11 11:16:33,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"n=int(input())\nx=input()\ny=x.split(\"" \"")\nfor i in range(0,n):\n    if y[i]=='0':\n        print(0,end=\""\"")\n    else:\n        print(6,end=\""\"")\n    if i!=n-1:\n        print()\n",WRONG_ANSWER,55,2908
1590906381698379776,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-11 11:16:53,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main(){\n    int t,i,k;\n    double j;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++){\n        j=pow(6,a[i]);\n        int h=(int)j;\n        k=h%10;\n        printf(\""%d\\n\"",k);\n    }\n}",COMPILE_ERROR,0,0
1590906390305091584,54914c90623988219ee55c4a0b2e645efd9808505aa25f0099930bfa8bf18ad1,2022-11-11 11:16:55,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int a;\n    scanf(\""%d\"",&a);\n    int k,i,s,z;\n    for(i=0; i<a; i++){\n        scanf(\""%d\"",&k);\n        s = pow(6,k);\n        z = s%10;\n        printf(\""%d\\n\"",z);\n    }\n}\n",WRONG_ANSWER,7,348
1590906426271268864,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-11 11:17:04,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main(){\n    int t,i,k;\n    double j;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<t;i++){\n        j=pow(6,a[i]);\n        int h=(int)j;\n        k=h%10;\n        printf(\""%d\\n\"",k);\n    }\n}",WRONG_ANSWER,8,496
1590906428833992704,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 11:17:04,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int i,x,n,sum,yu;\n    scanf(\""%d\"",&x);\n    for(i=0;i<x;i++){\n    scanf(\""%d\"",&n);\n    sum=pow(6,n);\n    yu=sum%10;\n    printf(\""%d\\n\"",yu);}\n    return 0;\n}\n",WRONG_ANSWER,9,316
1590906438686408704,1773d9c971942817d949c47973c4eb8c24531f728d5480dbf3b232e568926258,2022-11-11 11:17:07,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.*;\nimport java.lang.Math;\nclass Main{\n    public static void main(String[] args){\n        Scanner scanner = new Scanner(System.in);\n        int num = scanner.nextInt();\n        for(int i = 0;i < num;i++){\n            int x = scanner.nextInt();\n            System.out.println(((int) Math.pow(6, x)) % 10);\n        }\n    }\n}",TIME_LIMIT_EXCEEDED,50,13756
1590906445913198592,6cbd81921f92855c6b8318725b09ef7ec48ff579276b3df9f7ea04bea9804678,2022-11-11 11:17:08,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,a,b;\n    while(scanf(\""%d\"",&n)!=EOF)\n    {\n    a=pow(6,n);\n    b=a%10;\n    printf(\""%d\\n\"",b);}\n    return 0;\n}\n",WRONG_ANSWER,6,316
1590906460630986752,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 11:17:12,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    int n,i,j=0;\n    if(n=>2&&n<=10**5)\n    {\n        scanf(\""%d\"",&n);\n    }\n    for(i=2;i<n;i++)\n    {\n        for(int k=2;k<i;k++)\n        {\n            if(i%k==0)\n            {\n                j++;\n            }\n        }\n    }\n    printf(\""%d\"",j);\n}",COMPILE_ERROR,0,0
1590906463541833728,c47b15e117166a3dd00078b9f795673d5284a2761e582479119229751cc734d3,2022-11-11 11:17:13,C++,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\n int pnum(int x){\n\n    int i;  \n    int k;  \nint j;\n    k=int(sqrt(x));\n    for(i=2;i<=k+1;i++)\n    {\n        if(x%i==0)\n        {\n            j=0;\n            \n            break;\n        }\n\n        else j=1;\n    }\n    return j;\n\n\n}\n\nint main()\n{\n    int a=0,m=0,n,i;\n    scanf(\""%d\"",&n);\n    if(n>=2 && n<=100000)\n    {\n        for(i=2;i<n;i++)\n        {\n            //printf(\""a1=%d\\n\"",a);\n            a=pnum(i);\n            //printf(\""p=%d\"",pnum(i));\n            //printf(\""a2=%d\\n\"",a);\n            if(a==1){\n                m+=1;}\n            //printf(\""m=%d\\n\"",m);\n        }\n    }\n    else printf(\""请输入2~100000之间的数\"");\n\n    printf(\""%d\\n\"",m+1);\n\n\n    return 0;\n}\n",ACCEPTED,15,336
1590906559604002816,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 11:17:36,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int i,x,n,sum,yu;\n    scanf(\""%d\"",&x);\n    for(i=0;i<x;i++){\n    scanf(\""%d\"",&n);\n    sum=pow(6,n);\n    yu=sum%10;\n    printf(\""%d\"",yu);}\n    return 0;\n}\n",WRONG_ANSWER,8,344
1590906583570231296,9ca3f63f61fa4f349009d69e7059514c3a39dbdd5a1f94342c11f4c33ccdceaa,2022-11-11 11:17:41,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"x = int(input())\ny = input().split(\"" \"")\nfor i in range(x):\n    #a,b,c = [int(x) for x in input().split(\"" \"")]\n    a = int(y[i])\n    b = 6**a\n    b = b%10\n    print(b)\n",TIME_LIMIT_EXCEEDED,67,3508
1590906614289313792,a57fdafe4877cd9608fc0ac8a5120a47bc60a015785960e61b67b4e66187c2f2,2022-11-11 11:17:49,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int n,b,i=0,c;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&b);\n        c=pow(6,b);\n        printf(\""%d\\n\"",c%10);\n    }\n    return 0;\n}",WRONG_ANSWER,8,476
1590906618601082880,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 11:17:50,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main(){\n  int i,j,n,k=0;\n  scanf(\""%d\"",&n);\n  for (i = 1; i <n ; i++) {\n    for (j = 2; j <i ; j++)\n        {\n      if (i%j == 0)\n        break;\n    }\n     if (i==j)\n       k++;\n\n  }\n  printf(\""%d\"",k);\n  return 0;\n}\n",TIME_LIMIT_EXCEEDED,400,196
1590906714197655552,9ca3f63f61fa4f349009d69e7059514c3a39dbdd5a1f94342c11f4c33ccdceaa,2022-11-11 11:18:12,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"x = int(input())\ny = input().split(\"" \"")\nfor i in range(x):\n    #a,b,c = [int(x) for x in input().split(\"" \"")]\n    a = int(y[i])\n    b = (6**a)%10\n    print(b)\n",TIME_LIMIT_EXCEEDED,68,3364
1590906715263012864,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 11:18:13,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j=0;\n    if(n=>2&&n<=10**5)\n    {\n        scanf(\""%d\"",&n);\n    }\n    for(i=2;i<n;i++)\n    {\n        for(int k=2;k<i;k++)\n        {\n            if(i%k==0)\n            {\n                j++;\n            }\n        }\n    }\n    printf(\""%d\"",j);\n}",COMPILE_ERROR,0,0
1590906758279794688,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 11:18:23,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t,i,ed,z;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<t;i++)\n    {\n    z=pow(6,a[i]);\n    ed=z%10;\n    printf(\""%d\\n\"",ed);}\n    return 0;\n}",WRONG_ANSWER,9,636
1590906793843294209,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 11:18:31,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j=0;\n    if(n>=2&&n<=10**5)\n    {\n        scanf(\""%d\"",&n);\n    }\n    for(i=2;i<n;i++)\n    {\n        for(int k=2;k<i;k++)\n        {\n            if(i%k==0)\n            {\n                j++;\n            }\n        }\n    }\n    printf(\""%d\"",j);\n}",COMPILE_ERROR,0,0
1590906809953619968,6cbd81921f92855c6b8318725b09ef7ec48ff579276b3df9f7ea04bea9804678,2022-11-11 11:18:35,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,a,b;\n    while(scanf(\""%d\"",&n)!=EOF)\n    {\n    a=pow(6,n);\n    b=a%10;\n    printf(\""%d\\n\"",b);break;}\n    return 0;\n}\n",WRONG_ANSWER,4,348
1590906827150266368,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-11 11:18:39,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main(){\n    int t,i,k;\n    double j;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++){\n        scanf(\""%d\"",&a[i]);\n        j=pow(6,a[i]);\n        int h=(int)j;\n        k=h%10;\n        printf(\""%d\\n\"",k);\n    }\n",COMPILE_ERROR,0,0
1590906879511953408,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-11 11:18:52,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main{\n    public static void main(String args[]){\n        int X,Y;\n        Y=1;\n        Scanner scanner = new Scanner(System.in);\n        X=scanner.nextInt();\n        for (int i = 0; i <= X; i++) {\n            if(X==0)\n                break;\n            Y=6*Y;\n        }\n        Y=Y%10;\n        System.out.print(Y);\n    }\n}",TIME_LIMIT_EXCEEDED,50,14640
1590906905747324928,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-11 11:18:58,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main(){\n    int t,i,k;\n    double j;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<t;i++){\n        j=pow(6,a[i]);\n        int h=(int)j;\n        k=h%10;\n        printf(\""%d\\n\"",k);\n    }\n}",WRONG_ANSWER,8,512
1590906955193974784,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 11:19:10,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint mynum1(int N)\n{\n    int i,a,b,c;\n    a=N%10;\n    b=N%4;\n    if (b==0)\n    {\n        b=4;\n    }\n    c=1;\n    for (i=1;i<=N;i++)\n    {\n        c*=6;\n    }\n    c=c%10;\n    return c;\n}\n\nint main()\n{\n    int t,N,i;\n    scanf(\""%d\"", &t);\n    for (i=1; i<=t; i++)\n    {\n        scanf(\""%d\"", &N);\n        printf(\""%d\\n\"", mynum1(N));\n    }\n\n}",TIME_LIMIT_EXCEEDED,54,356
1590906958335488000,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 11:19:11,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j=0;\n    if(n>=2&&n<=10^5)\n    {\n        scanf(\""%d\"",&n);\n    }\n    for(i=2;i<n;i++)\n    {\n        for(int k=2;k<i;k++)\n        {\n            if(i%k==0)\n            {\n                j++;\n            }\n        }\n    }\n    printf(\""%d\"",j);\n}",TIME_LIMIT_EXCEEDED,400,336
1590906968313761792,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 11:19:13,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int i,x,n,sum,yu;\n    scanf(\""%d\"",&x);\n    for(i=0;i<x;i++){\n    scanf(\""%d\"",&n);\n    sum=pow(6,n);\n    yu=sum%10;\n    printf(\""%d\"",yu);\n    if(i!=x-1) printf(\""\\n\"");\n    }\n    return 0;\n}\n",WRONG_ANSWER,7,512
1590906992196104192,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-11 11:19:19,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\n#indlude<time.h>\nint main()\n{\n    int h;\n    printf(\""2022\"");\n    \n}",COMPILE_ERROR,0,0
1590907009287892992,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-11 11:19:23,Java,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"import java.util.Scanner;\n\npublic class Main{\n    public static void main(String args[]){\n        int X,Y,Z;\n        Scanner scanner = new Scanner(System.in);\n        X=scanner.nextInt();\n        Y=scanner.nextInt();\n        Z=scanner.nextInt();\n        System.out.println(X+Y-Z);\n    }\n}",ACCEPTED,257,17212
1590907043085615104,1773d9c971942817d949c47973c4eb8c24531f728d5480dbf3b232e568926258,2022-11-11 11:19:31,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.*;\nimport java.lang.Math;\nclass Main{\n    public static void main(String[] args){\n        Scanner scanner = new Scanner(System.in);\n        int t = scanner.nextInt();\n        for(int i = 0;i < t;i++){\n            int n = scanner.nextInt();\n            System.out.println(((int) Math.pow(6, n)) % 10);\n        }\n    }\n}",TIME_LIMIT_EXCEEDED,50,15932
1590907043664429056,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-11 11:19:31,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main{\n    public static void main(String args[]){\n        int X,Y;\n        Y=1;\n        Scanner scanner = new Scanner(System.in);\n        X=scanner.nextInt();\n        for (int i = 0; i <= X; i++) {\n            if(X==0)\n                break;\n            Y=6*Y;\n        }\n        Y=Y%10;\n        System.out.print(Y);\n    }\n}",TIME_LIMIT_EXCEEDED,50,14464
1590907044113199104,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 11:19:31,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\nl = int(input())\ndata = list(map(eval,input().split()))\nd = []\nfor i in range(l):\n    if 0<=data[i]<=1000000000:\n        s=int(math.pow(6,data[i]))\n        s=str(s)\n        d.append(s)\n    else:\n        break\nprint(d[0])\nprint(d[1])\nprint(d[2])",WRONG_ANSWER,19,2820
1590907044482318336,54914c90623988219ee55c4a0b2e645efd9808505aa25f0099930bfa8bf18ad1,2022-11-11 11:19:31,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int a;\n    scanf(\""%d\"",&a);\n    int k,i,s,z;\n    for(i=0; i<a; i++){\n        if(scanf(\""%d\"",&k)){\n            s = pow(6,k);\n            z = s%10;\n            printf(\""%d\\n\"",z);\n        }else {\n            printf(\""error\"");\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,7,388
1590907071409750016,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-11 11:19:38,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n   \n    printf(\""2022\\n\"");\n    \n}",ACCEPTED,3,348
1590907077109813248,a27ecb139a3fa065feadb903517977dc609a6d218c4e082e7ec449c78806823c,2022-11-11 11:19:39,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint ab(int X,int Y,int Z);\nint ab(int X,int Y,int Z)\n{   int ab;\n    ab=X+Y-Z;\n    return ab;\n}\nint main()\n{\n    int X,Y,Z,sum;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    sum=ab(X,Y,Z);\n    printf(\""%d\"",sum);\n    return 0;\n}",ACCEPTED,7,324
1590907093379514368,2bc6a85c0376656012a7970a7842a2a9d8769555a79ef4eec85ff45aa30ff7b7,2022-11-11 11:19:43,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main() {\n\tint count;\n\tif(scanf(\""%d\"", &count) == 0);\n\tint num;\n\twhile (count -- != 0) {\n\t\tif(scanf(\""%d\"", &num) == 0);\n\t\tprintf(\""%d\"", (int) pow(6,num) %10);\n\t\tif(count != 0) {\n\t\t\tprintf(\""\\n\"");\n\t\t}\n\t}\n\treturn 0;\n} ",WRONG_ANSWER,9,348
1590907097435385856,fec6d07e317796c63fb7ae6e7538f75973ad64af6e6196cc27eed3e9e685bf86,2022-11-11 11:19:44,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int a,x,i;\n    scanf(\""%d\"",&x);\n    for(i=1;i<=x;i++)\n    {\n    scanf(\""%d\"",&a);\n    if(a==0)\n        printf(\""1\"");\n    else\n        printf(\""6\"");\n    if(i!=x)\n    {\n        printf(\""\\n\"");\n    }\n    }\n}",ACCEPTED,9,392
1590907206877380608,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 11:20:10,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\nl = int(input())\ndata = list(map(eval,input().split()))\nd = []\nfor i in range(l):\n    if 0<=data[i]<=1000000000:\n        s=int(math.pow(6,data[i]))\n        s=str(s)\n        d.append(s)\n    else:\n        break\nprint(d[0][-1])\nprint(d[1][-1])\nprint(d[2][-1])",WRONG_ANSWER,17,2960
1590907328575090688,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 11:20:39,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint mynum1(int N)\n{\n    int i,c;\n    /*a=N%10;\n    b=N%4;\n    if (b==0)\n    {\n        b=4;\n    }*/\n    c=1;\n    for (i=1;i<=N;i++)\n    {\n        c*=6;\n    }\n    c=c%10;\n    return c;\n}\n\nint main()\n{\n    int t,N,i;\n    if(scanf(\""%d\"", &t)){\n    for (i=1; i<=t; i++)\n    {\n        if(scanf(\""%d\"", &N)){\n        printf(\""%d\\n\"", mynum1(N));\n    }}\n    }\n}",TIME_LIMIT_EXCEEDED,55,384
1590907672415744000,2cb092ec618cde3657d677b73f7a0a7bfb1e0da02f466007878113e6c4db4792,2022-11-11 11:22:01,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n int x,y,z,f;\n scanf(\""%d %d %d\"",&x,&y,&z);\n f=x+y-z;\n printf(\""%d\"",f);\n    return 0;\n}\n",ACCEPTED,6,344
1590907692850393088,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 11:22:06,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\nl = int(input())\ndata = list(map(eval,input().split()))\nd = []\nfor i in range(l):\n    if 0<=data[i]<=1000000000:\n        s=int(math.pow(6,data[i]))\n        s=str(s)\n        d.append(s)\n    else:\n        break\nprint(d[0][-1])\nprint(d[1][-1])\nprint(d[2][-1]，end='')",NON_ZERO_EXIT_CODE,20,2816
1590907703436816384,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 11:22:08,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int i,x,n,sum,yu;\n    scanf(\""%d\"",&x);\n    for(i=0;i<x;i++)\n    {\n    scanf(\""%d\"",&n);\n    sum=pow(6,n);\n    yu=sum%10;\n    printf(\""%d\"",yu);\n    if(i!=x-1) printf(\""\\n\"");\n    }\n    return 0;\n}\n",WRONG_ANSWER,10,308
1590907774962302976,05fd79145678de5c06012db9db4333bebf8365a74fe442d12a54a9da3782fdca,2022-11-11 11:22:25,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,a=input()\nprint(168),WRONG_ANSWER,15,2744
1590908034145128448,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 11:23:27,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\nl = int(input())\ndata = list(map(eval,input().split()))\nd = []\nfor i in range(l):\n    if 0<=data[i]<=1000000000:\n        s=int(math.pow(6,data[i]))\n        s=str(s)\n        d.append(s)\n    else:\n        break\nprint(d[0][-1])\nprint(d[1][-1])\nprint(d[2][-1],end='')",WRONG_ANSWER,23,2816
1590908079556857856,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 11:23:38,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\nl = int(input())\ndata = list(map(eval,input().split()))\nd = []\nfor i in range(l):\n    if 0<=data[i]<=1000000000:\n        s=int(math.pow(6,data[i]))\n        s=str(s)\n        d.append(s)\n    else:\n        break\nprint(d[0][-1])\nprint(d[1][-1])\nprint(d[2][-1],end='')",WRONG_ANSWER,23,2860
1590908111668424704,e4f316bfe970c62bf57b46f5ef8a290748707bf16f041fe868d04986a0cdd64f,2022-11-11 11:23:46,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"A=int(input())\nB=int(input())\nC=int(input())\nif:\n    0<=A<=100\n    0<=B<=100\n    0<=C<=100\n    print(%d,A+B+C)\nelse:\n    print(\""error\"")",NON_ZERO_EXIT_CODE,17,3856
1590908180283043840,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-11 11:24:02,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n}",ACCEPTED,9,484
1590908201602711552,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 11:24:07,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\nl = int(input())\ndata = list(map(eval,input().split()))\nfor i in range(l):\n    if 0<=data[i]<=1000000000:\n        s=int(math.pow(6,data[i]))\n        s=str(s)\n        print(s[-1],end=\""\"")\n    else:\n        break\n",WRONG_ANSWER,33,2892
1590908214571479040,54914c90623988219ee55c4a0b2e645efd9808505aa25f0099930bfa8bf18ad1,2022-11-11 11:24:10,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int a;\n    scanf(\""%d\"",&a);\n    int k,i,z;\n    for(i=0; i<a; i++){\n        scanf(\""%d\"",&k);\n\n        if(k=0){\n            z=1;\n            printf(\""%d\\n\"",z);\n        }else {\n            z=6;\n            printf(\""%d\\n\"",z);\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,13,348
1590908261128253440,6ba5ecacf3381a1e9382f99c413290eca40a071a563a618e5f36d66cbf9a5e1b,2022-11-11 11:24:21,Python,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"n=int(input())\nx=input()\ny=x.split(\"" \"")\nfor i in range(0,n):\n    if y[i]=='0':\n        print(1,end=\""\"")\n    else:\n        print(6,end=\""\"")\n    if i!=n-1:\n        print()\n",ACCEPTED,58,2808
1590908358553571328,23d287b80d4d430308a1b57ee92bb4f2d1b25d1142a13c1c0fda4316c9bb9f17,2022-11-11 11:24:44,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"for i in range(0,101):\n     X,Y,Z= int(input(\""\"")), int(input(\""\"")), int(input(\""\""))\n     if(X in range(0,101) and Y in range(0,101) and Z in range(0,101)):\n         print(X+Y-Z)",NON_ZERO_EXIT_CODE,16,2836
1590908365495144448,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-11 11:24:46,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h> \n#include<math.h>\nint main(){\nint n;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tint M[n];\n\tfor(int i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t\tM[i]=pow(6,a[i]);\n\t\tM[i]=M[i]%10;\n\t}\n\tfor(int i=0;i<n;i++){\n\tif(i<n-1)\tprintf(\""%d\\n\"",M[i]);\n\telse printf(\""%d\"",M[i]);\n\t}\n}",WRONG_ANSWER,6,336
1590908422944522240,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 11:25:00,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int t,N,i,c=1;\n    if(scanf(\""%d\"", &t)){\n        for (i=1; i<=t; i++)\n        {\n            if(scanf(\""%d\"", &N)){\n                for (i=1;i<=N;i++)\n                {\n                    c*=6;\n                }\n                c=c%10;\n                printf(\""%d\\n\"", c);\n            }}\n    }\n}",WRONG_ANSWER,5,344
1590908656655335424,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 11:25:56,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t,i;\n    double z,ed;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<t;i++)\n    {\n    z=pow(6,a[i]);\n    ed=z%10;\n    printf(\""%d\\n\"",ed);}\n    return 0;\n}",COMPILE_ERROR,0,0
1590908657259294721,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 11:25:56,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\nl = int(input())\ndata = list(map(eval,input().split()))\nd = []\nfor i in range(l):\n    if 0<=data[i]<=1000000000:\n        s=int(math.pow(6,data[i]))\n        s=str(s)\n        d.append(s)\n    else:\n        break\nprint(d[0][-1])\nprint(d[1][-1])\nprint(d[2][-1],end=\""\"")\n",WRONG_ANSWER,17,2816
1590908676175626240,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 11:26:00,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\nl = int(input())\ndata = list(map(eval,input().split()))\nd = []\nfor i in range(l):\n    if 0<=data[i]<=1000000000:\n        s=int(math.pow(6,data[i]))\n        s=str(s)\n        d.append(s)\n    else:\n        break\nprint(d[0][-1])\nprint(d[1][-1])\nprint(d[2][-1],end=\""\"")\n",WRONG_ANSWER,17,2884
1590908685243711488,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 11:26:02,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\nl = int(input())\ndata = list(map(eval,input().split()))\nd = []\nfor i in range(l):\n    if 0<=data[i]<=1000000000:\n        s=int(math.pow(6,data[i]))\n        s=str(s)\n        d.append(s)\n    else:\n        break\nprint(d[0][-1])\nprint(d[1][-1])\nprint(d[2][-1],end=\""\"")\n",WRONG_ANSWER,17,2828
1590908708912173056,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 11:26:08,Python,0.0,1590528927448293376,1590525945717575680,1049226928954454016,print('2002'),WRONG_ANSWER,19,2920
1590908711894319104,e4f316bfe970c62bf57b46f5ef8a290748707bf16f041fe868d04986a0cdd64f,2022-11-11 11:26:09,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"A=int(input())\nB=int(input())\nC=int(input())\nwhile: \n0<=A<=100\n0<=B<=100\n0<=C<=100:\n    print(%d,A+B+C)\n",NON_ZERO_EXIT_CODE,18,2904
1590908724343013376,5d25e51c02c08da2e0946483619d6f75981ff1037e5bbe3f3e4a71eeb2de4c8a,2022-11-11 11:26:12,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a;\n    a=2022;\n    printf(\""%d\"",a);\n    return 0;\n}",ACCEPTED,3,448
1590908773357649920,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 11:26:23,Python,0.0,1590528927448293376,1590525945717575680,1049226928954454016,print(int('2002'),NON_ZERO_EXIT_CODE,16,2744
1590908804722634752,6ba5ecacf3381a1e9382f99c413290eca40a071a563a618e5f36d66cbf9a5e1b,2022-11-11 11:26:31,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"sum=1;\nx=input()\nfor i in range(3,int(x)+1,2):\n    count=0\n    for j in range(2,(i//2)):\n        if i%j==0:\n            count+=1\n    if(count==0):\n        sum+=1;\nprint(sum)",TIME_LIMIT_EXCEEDED,400,2872
1590908814042402816,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 11:26:33,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t,i;\n    double z,ed;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<t;i++)\n    {\n    z=pow(6,a[i]);\n    ed=z%10;\n    printf(\""%.lf\\n\"",ed);}\n    return 0;\n}",COMPILE_ERROR,0,0
1590908844929253376,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-11 11:26:40,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main{\n    public static void main(String args[]){\n        int X,Y;\n        Y=1;\n        Scanner scanner = new Scanner(System.in);\n        X=scanner.nextInt();\n        if(X==0)\n            System.out.print(\""1\"");\n        else\n            System.out.print(\""6\"");\n\n    }\n}\n",TIME_LIMIT_EXCEEDED,50,13100
1590908920946798592,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-11 11:26:59,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main{\n    public static void main(String args[]){\n        int X,Y;\n        Y=1;\n        Scanner scanner = new Scanner(System.in);\n        X=scanner.nextInt();\n        if(X==0)\n            System.out.print(\""1\"");\n        else\n            System.out.print(\""6\"");\n\n    }\n}\n",TIME_LIMIT_EXCEEDED,50,15848
1590908928446234624,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 11:27:00,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t,i;\n    double z,ed;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<t;i++)\n    {\n    z=pow(6.0,a[i]);\n    ed=z%10;\n    printf(\""%.lf\\n\"",ed);}\n    return 0;\n}",COMPILE_ERROR,0,0
1590908944141324288,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 11:27:04,Python,0.0,1590528927448293376,1590525945717575680,1049226928954454016,print(int('2022'),NON_ZERO_EXIT_CODE,17,2744
1590908950340501504,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 11:27:06,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,print('2022'),ACCEPTED,16,2896
1590908979117621248,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 11:27:12,Java,300.0,1590528927448293376,1590525945717575680,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n            System.out.println(2022);\n    }\n},ACCEPTED,78,14004
1590908983244795904,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 11:27:13,Python,0.0,1590528927448293376,1590525945717575680,1049226928954454016,print(int('2022)),NON_ZERO_EXIT_CODE,16,2760
1590908994531667968,542d97133043a1f2156354473a31382c35bb2836688b0ed76eae59c52a2e0e3a,2022-11-11 11:27:16,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int m,n,o,p,digit;\n    int a[n];\n    scanf(\""%d\"",&n);\n    for(m=0;m<n;m++)\n    {\n        scanf(\""%d\"",&a[m]);\n        for(o=0;o<a[m];o++)\n        {\n            p=1;\n            p=p*6;\n        }\n        digit=p%10;\n        printf(\""%d\\n\"",digit);\n    }\n    return 0;\n}\n",WRONG_ANSWER,12,344
1590909005931810816,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 11:27:19,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,print(int('2022')),ACCEPTED,15,2756
1590909013687074816,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 11:27:21,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t,i;\n    double z,ed;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<t;i++)\n    {\n    z=pow(6.0,a[i].0);\n    ed=z%10;\n    printf(\""%.lf\\n\"",ed);}\n    return 0;\n}",COMPILE_ERROR,0,0
1590909059929280512,5d25e51c02c08da2e0946483619d6f75981ff1037e5bbe3f3e4a71eeb2de4c8a,2022-11-11 11:27:32,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n    return 0;\n}",ACCEPTED,8,308
1590909069878169600,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-11 11:27:34,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main{\n    public static void main(String args[]){\n        int X;\n        Scanner scanner = new Scanner(System.in);\n        X=scanner.nextInt();\n        if(X==0)\n            System.out.print(\""1\"");\n        else\n            System.out.print(\""6\"");\n\n    }\n}\n",TIME_LIMIT_EXCEEDED,50,12996
1590909116854374400,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 11:27:45,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int t,N,i,c=1;\n    if(scanf(\""%d\"", &t)){\n        for (i=0; i<t; i++)\n        {\n            if(scanf(\""%d\"", &N)){\n                for (i=0;i<t;i++)\n                {\n                    c*=6;\n                    c=c%10;\n                    printf(\""%d\\n\"", c);\n                }\n\n            }}\n    }\n}",WRONG_ANSWER,14,460
1590909256247848960,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 11:28:19,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t,i;\n    int z,ed;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<t;i++)\n    {\n    z=pow(6,a[i]);\n    ed=z%10;\n    printf(\""%d\\n\"",ed);}\n    return 0;\n}",WRONG_ANSWER,8,352
1590909288481075200,54914c90623988219ee55c4a0b2e645efd9808505aa25f0099930bfa8bf18ad1,2022-11-11 11:28:26,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int a;\n    scanf(\""%d\"",&a);\n    int k,i,z;\n    for(i=0; i<a; i++){\n        scanf(\""%d\"",&k);\n\n        if(k==0){\n            z=1;\n            printf(\""%d\\n\"",z);\n        }else {\n            z=6;\n            printf(\""%d\\n\"",z);\n        }\n    }\n    return 0;\n}\n",ACCEPTED,14,464
1590909303433789440,70c675ddfcb60b2192bc8ac38fb068fec0500208a5bf97a796c7cc074b43cf87,2022-11-11 11:28:30,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tint count = 0;\n\t\tScanner myScanner = new Scanner(System.in);\n\t\tint n = myScanner.nextInt();\n\t\tfor(int i = 2;i < n;i++) {\n\t\t\tboolean loop = true;\n\t\t\tfor(int j = 2;j < i;j++) {\n\t\t\t\tif(i%j == 0) {\n\t\t\t\t\tloop = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(loop) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n},TIME_LIMIT_EXCEEDED,400,19196
1590909325944623104,fa305ee4bf4c6a54add4e945b551f1e902b95c1a179a91ded55bf7ebb1c87c23,2022-11-11 11:28:35,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""2022\\n\"");\n    return 0;\n}",ACCEPTED,7,384
1590909346970644480,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-11 11:28:40,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main{\n    public static void main(String args[]){\n        int X;\n        Scanner scanner = new Scanner(System.in);\n        X=scanner.nextInt();\n        if(X==0)\n            System.out.print(\""1\"");\n        else\n            System.out.print(\""6\"");\n\n    }\n}\n",TIME_LIMIT_EXCEEDED,50,13136
1590909364746125312,23d287b80d4d430308a1b57ee92bb4f2d1b25d1142a13c1c0fda4316c9bb9f17,2022-11-11 11:28:44,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"for i in range(0,101):\n     X,Y,Z= input(\""\"")), int(input(\""\"")), int(input(\""\"")\n     if(X in range(0,101) and Y in range(0,101) and Z in range(0,101)):\n         print(X+Y-Z)\n         ",NON_ZERO_EXIT_CODE,23,2748
1590909402545197056,23d287b80d4d430308a1b57ee92bb4f2d1b25d1142a13c1c0fda4316c9bb9f17,2022-11-11 11:28:53,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"\n     X,Y,Z= input(\""\"")), int(input(\""\"")), int(input(\""\"")\n     if(X in range(0,101) and Y in range(0,101) and Z in range(0,101)):\n         print(X+Y-Z)\n         ",NON_ZERO_EXIT_CODE,16,2752
1590909482375385088,2bc6a85c0376656012a7970a7842a2a9d8769555a79ef4eec85ff45aa30ff7b7,2022-11-11 11:29:12,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\n/**\n * @author Nipuru\n * @since 2022/11/11 10:41\n */\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int num = sc.nextInt();\n        while(num -- != 0) {\n            System.out.print(6);\n            if (num != 0) {\n                System.out.println();\n            }\n        }\n    }\n}\n,TIME_LIMIT_EXCEEDED,50,13940
1590909512503046144,33066437ddee11f609c900fe8dbd59cb8113e4d8dfd13c1812f199f4f3fdd334,2022-11-11 11:29:20,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nvoid main()\n{\n    printf(\""2022\"");\n}",NON_ZERO_EXIT_CODE,4,476
1590909535815012352,5d25e51c02c08da2e0946483619d6f75981ff1037e5bbe3f3e4a71eeb2de4c8a,2022-11-11 11:29:25,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n, N, cnt = 0;\n    scanf(\""%d\"",&N);//输入N值。\n    for(n = 1;n<=N; n ++)//循环执行\n    {\n        int t = n;\n        while(t)//循环取出每一位。\n        {\n            if(t%10 == 1) cnt++;\n            t/=10;\n        }\n    }\n    printf(\""%d\\n\"", cnt);//输出结果\n    return 0;\n}",WRONG_ANSWER,6,180
1590909559470862336,b95d43d4e550820a57e0a7b63f63233a65cb813e77be0e6c08c1739f86678946,2022-11-11 11:29:31,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(){\n    int t,i,j;\n    int w=6;\n    scanf(\""%d\"",&t);\n    int n[t];\n    for(i=0;i<t;i++)\n        scanf(\""%d\"",&n[i]);\n    for(j=0;j<t;j++)\n    {\n        if(n[j]>=0 && n[j]<=pow(10,9))\n            printf(\""%d\\n\"",w);\n    }\nreturn 0;\n}\n\n",NON_ZERO_EXIT_CODE,18,3012
1590909583357448192,542d97133043a1f2156354473a31382c35bb2836688b0ed76eae59c52a2e0e3a,2022-11-11 11:29:37,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int m,n,o,p,digit;\n    int a[n];\n    scanf(\""%d\"",&n);\n    for(m=0;m<n;m++)\n    {\n        scanf(\""%d\"",&a[m]);\n        for(o=0;o<a[m];o++)\n        {\n            p=1;\n            p=p*6;\n        }\n        digit=p%10;\n        printf(\""%d\"",digit);\n        if(m==n-1)\n            break;\n        printf(\""\\n\"");\n    }\n    return 0;\n}\n",WRONG_ANSWER,10,324
1590909671198732288,c5cc6f9845df4bd1986af86c0696296436bbc0f00a10a9f891b4100e57bc3a19,2022-11-11 11:29:57,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <bits/stdc++.h>\nusing namespace std;\n#define N 1000000000\nint main()\n{\n\tint n,k,f=1,s=0;\n\tcin>>n;\n\tfor(int i=2;i<=n;i++){\n\t\tfor(int j=2;j<i;j++)\n\t\t\tif(i%j==0)//被整除就f=0 \n\t\t\t{\n\t\t\t\tf=0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(f) s++;//是素数就加一 \n\t\t\tf=1;\n\t}\n\tcout<<s;\n}",TIME_LIMIT_EXCEEDED,400,444
1590909727326932992,33066437ddee11f609c900fe8dbd59cb8113e4d8dfd13c1812f199f4f3fdd334,2022-11-11 11:30:11,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""2022\"");\n    true 0;\n}",COMPILE_ERROR,0,0
1590909731164721152,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-11 11:30:12,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main{\n    public static void main(String args[]){\n        int X;\n        Scanner scanner = new Scanner(System.in);\n        X=scanner.nextInt();\n        if(X==0)\n            System.out.print(\""1\"");\n        else\n            System.out.print(\""6\"");\n\n    }\n}\n",TIME_LIMIT_EXCEEDED,50,13492
1590909733110853632,b95d43d4e550820a57e0a7b63f63233a65cb813e77be0e6c08c1739f86678946,2022-11-11 11:30:12,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nvoid main(){\n    int t,i,j;\n    int w=6;\n    scanf(\""%d\"",&t);\n    int n[t];\n    for(i=0;i<t;i++)\n        scanf(\""%d\"",&n[i]);\n    for(j=0;j<t;j++)\n    {\n        if(n[j]>=0 && n[j]<=pow(10,9))\n            printf(\""%d\\n\"",w);\n    }\n}\n\n\n",NON_ZERO_EXIT_CODE,16,2764
1590909786298822656,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-11 11:30:25,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main{\n    public static void main(String args[]){\n        int X;\n        Scanner scanner = new Scanner(System.in);\n        X=scanner.nextInt();\n        if(X==0)\n            System.out.print(\""1\"");\n        else\n            System.out.print(\""6\"");\n\n    }\n}\n",TIME_LIMIT_EXCEEDED,50,14128
1590909802895704064,23d287b80d4d430308a1b57ee92bb4f2d1b25d1142a13c1c0fda4316c9bb9f17,2022-11-11 11:30:29,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"X,Y,Z= input(\""\"")), int(input(\""\"")), int(input(\""\"")\n    if(X in range(0,101) and Y in range(0,101) and Z in range(0,101)):\n         print(X+Y-Z)\n         ",NON_ZERO_EXIT_CODE,18,2896
1590909814966890496,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-11 11:30:32,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[10^9];\n    int i=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    \n    int b[10^9];\n    for(int j=0;j<n;j++)\n    {\n        b[j]=a[i]%10;\n    }\n    }\n    printf(\""%d\\n\"",b[j]);\n}",COMPILE_ERROR,0,0
1590909820054581249,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 11:30:33,Python,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"a,b,c=map(int,input().split())\nprint(a+b-c)",ACCEPTED,34,2816
1590909845165879296,a57fdafe4877cd9608fc0ac8a5120a47bc60a015785960e61b67b4e66187c2f2,2022-11-11 11:30:39,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int n,b,i=0,c;\n    scanf(\""%d\"",&n);\n    for(i=0;i<=n;i++){\n        scanf(\""%d\"",&b);\n        c=pow(6,b);\n        printf(\""%d\\n\"",c%10);\n    }\n    return 0;\n}",WRONG_ANSWER,4,188
1590909853906833408,5d25e51c02c08da2e0946483619d6f75981ff1037e5bbe3f3e4a71eeb2de4c8a,2022-11-11 11:30:41,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n, N, cnt = 0;\n    scanf(\""%d\"",&N);//输入N值。\n    for(n = 2;n<=N; n ++)//循环执行\n    {\n        int t = n;\n        while(t)//循环取出每一位。\n        {\n            if(t%10 == 1) cnt++;\n            t/=10;\n        }\n    }\n    printf(\""%d\\n\"", cnt);//输出结果\n    return 0;\n}",WRONG_ANSWER,4,352
1590909892154691584,c5cc6f9845df4bd1986af86c0696296436bbc0f00a10a9f891b4100e57bc3a19,2022-11-11 11:30:50,C++,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <bits/stdc++.h>\nusing namespace std;\n#define N 1000000000\nint main()\n{\n\tint n,k,f=1,s=0;\n\tcin>>n;\n\tfor(int i=2;i<=n;i++){\n\t\t\n\t\tfor(int j=2;j<=sqrt(i);j++)\n\t\t\tif(i%j==0)//被整除就f=0 \n\t\t\t{\n\t\t\t\tf=0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(f) s++;//是素数就加一 \n\t\t\tf=1;\n\t}\n\tcout<<s;\n}",ACCEPTED,18,440
1590909941823614976,a57fdafe4877cd9608fc0ac8a5120a47bc60a015785960e61b67b4e66187c2f2,2022-11-11 11:31:02,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int n,b,i=0,c;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&b);\n        c=pow(6,b);\n        printf(\""%d\\n\"",c%10);\n    }\n    return 0;\n}",WRONG_ANSWER,7,320
1590909948740022272,33066437ddee11f609c900fe8dbd59cb8113e4d8dfd13c1812f199f4f3fdd334,2022-11-11 11:31:04,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""2022\"");\n     return 0;\n}",ACCEPTED,3,332
1590909981271044096,b95d43d4e550820a57e0a7b63f63233a65cb813e77be0e6c08c1739f86678946,2022-11-11 11:31:11,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(){\n    int t,i,j;\n    int w=6;\n    scanf(\""%d\"",&t);\n    int n[t];\n    for(i=0;i<t;i++)\n        scanf(\""%d\"",&n[i]);\n    for(j=0;j<t;j++)\n    {\n        if(n[j]>=0 && n[j]<=pow(10,9))\n            printf(\""%d\\n\"",w);\n    }\nreturn w;\n}\n\n\n\n",NON_ZERO_EXIT_CODE,18,2748
1590909990334959616,5bd1a8718ea7fb820055421c67b8e0a468e08d951f729a24e55bf407b3bdb1f6,2022-11-11 11:31:14,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <iostream>\n#include <math.h>\nusing namespace std;\nint main(){\n    int n,count=997;\n    cin>>n;\n    for(int i=5;i<=n;i++){\n        if(i%2==0){\n            count--;\n            continue;\n                   }\n        for(int j=2;j<sqrt(i);j++){\n            if(i%j==0) {\n                count--;\n                break;\n            }\n            \n        }\n    }\n    cout<<count;\n}",WRONG_ANSWER,11,320
1590909998555795456,23d287b80d4d430308a1b57ee92bb4f2d1b25d1142a13c1c0fda4316c9bb9f17,2022-11-11 11:31:15,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"X,Y,Z= input(\""\"")), int(input(\""\"")), int(input(\""\"")\n    if(X in range(0,101) and Y in range(0,101) and Z in range(0,101)):\n         print(X+Y-Z)\n         return 0\n         ",NON_ZERO_EXIT_CODE,18,2816
1590910016985542656,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 11:31:20,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int t,N,i,c=1;\n    if(scanf(\""%d\"", &t)){\n        for (i=0; i<t; i++)\n        {\n            if(scanf(\""%d\"", &N)){\n                for (i=0;i<t;i++)\n                {\n                    c*=6;\n                    c=c%10;\n                    printf(\""%d\\n\"", c);\n                }\n\n            }}\n    }\n}",WRONG_ANSWER,9,340
1590910023205715968,2bc6a85c0376656012a7970a7842a2a9d8769555a79ef4eec85ff45aa30ff7b7,2022-11-11 11:31:21,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\n/**\n * @author Nipuru\n * @since 2022/11/11 10:41\n */\npublic class Main {\n    public static void main(String[] args) {\n        int num = sc.nextInt();\n        if (num == 0) {\n            System.out.print(1);\n        }\n        while(num -- != 0) {\n            System.out.print(6);\n            if (num != 0) {\n                System.out.println();\n            }\n        }  Scanner sc = new Scanner(System.in);\n      \n    }\n},COMPILE_ERROR,0,0
1590910133281030144,2bc6a85c0376656012a7970a7842a2a9d8769555a79ef4eec85ff45aa30ff7b7,2022-11-11 11:31:48,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\n/**\n * @author Nipuru\n * @since 2022/11/11 10:41\n */\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int num = sc.nextInt();\n        if (num == 0) {\n            System.out.print(1);\n        }\n        while(num -- != 0) {\n            System.out.print(6);\n            if (num != 0) {\n                System.out.println();\n            }\n        }\n    }\n},WRONG_ANSWER,368,19132
1590910179149938688,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 11:31:59,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\nl = int(input())\ndata = list(map(eval,input().split()))\nfor i in range(l):\n    if 0<=data[i]<=1000000000 :\n        s=int(math.pow(6,data[i]))\n        s=str(s)\n        if i ==l-1:\n            print(s[-1],end=\""\"")\n            else:\n                print(s[-1])\n    else:\n        break\n\n",NON_ZERO_EXIT_CODE,16,2752
1590910202247974912,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-11 11:32:04,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main{\n    public static void main(String args[]){\n        int X;\n        Scanner scanner = new Scanner(System.in);\n        X=scanner.nextInt();\n        if(X==0)\n            System.out.print(\""1\"");\n        else\n            System.out.print(\""6\"");\n\n    }\n}\n",WRONG_ANSWER,127,16276
1590910251971424256,5bd1a8718ea7fb820055421c67b8e0a468e08d951f729a24e55bf407b3bdb1f6,2022-11-11 11:32:16,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <iostream>\n#include <math.h>\nusing namespace std;\nint main(){\n    int n,count=997;\n    cin>>n;\n    for(int i=5;i<=n;i++){\n        if(i%2==0){\n            count--;\n            continue;\n                   }\n        for(int j=2;j<=sqrt(i)+1;j++){\n            if(i%j==0) {\n                count--;\n                break;\n            }\n            \n        }\n    }\n    cout<<count;\n}",WRONG_ANSWER,12,320
1590910266416607232,70c675ddfcb60b2192bc8ac38fb068fec0500208a5bf97a796c7cc074b43cf87,2022-11-11 11:32:19,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"count=0\nn=int(input())\nfor i in range(2,n):\n    loop = True\n    for j in range(2,i):\n        if(i%j == 0):\n            loop = False\n            break\n    if(loop):\n        count += 1;\n\nprint(count)",TIME_LIMIT_EXCEEDED,400,2752
1590910306929389568,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 11:32:29,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\nl = int(input())\ndata = list(map(eval,input().split()))\nfor i in range(l):\n    if 0<=data[i]<=1000000000 :\n        s=int(math.pow(6,data[i]))\n        s=str(s)\n        if i ==l-1:\n            print(s[-1],end=\""\"")\n        else:\n            print(s[-1])\n    else:\n        break\n\n",WRONG_ANSWER,35,2880
1590910319902396416,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 11:32:32,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j=0;\n    if(n>=2&&n<=10^5)\n    {\n        scanf(\""%d\"",&n);\n    }\n    for(i=2;i<n;i++)\n    {\n        for(int k=2;k<i;k++)\n        {\n            if(i%k==0)\n            {\n                j++;\n            }\n        }\n    }\n    printf(\""%d\"",j);\n}",TIME_LIMIT_EXCEEDED,400,348
1590910368078168064,54914c90623988219ee55c4a0b2e645efd9808505aa25f0099930bfa8bf18ad1,2022-11-11 11:32:44,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"void fn(int n)\n{\n    int i = 0, j = 0;\n    int count = 0;\n    for (i = 1; i <= n; i++)\n    {\n        for (j = 2; j < i; j++)\n        {\n            if (i%j == 0)\n                break;\n        }\n        if (i == j){\n            count++;\n        }\n    }\n    printf(\""%d \"", count);\n}\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"", &n);\n    fn(n);\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,400,200
1590910396456808448,d8701a6da26af0d0579eec24b939fdbf381dd9449c34251ff0d8938314216606,2022-11-11 11:32:50,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#inclue<stdio.h>\nint main{\n    int X,Y,Z,C;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    C=X+Y−Z;\n    printf(\""%d\"",C)\n    return 0;\n    }",COMPILE_ERROR,0,0
1590910402253361152,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 11:32:52,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint mynum1(int N)\n{\n    int i,c;\n\n    c=1;\n    for (i=1;i<=N;i++)\n    {\n        c=c*6;\n    }\n    c=c%10;\n    return c;\n}\n\nint main()\n{\n    int t,N,i;\n    scanf(\""%d\"", &t);\n    for (i=1; i<=t; i++)\n    {\n        scanf(\""%d\"", &N);\n        printf(\""%d\\n\"", mynum1(N));\n    }\n\n}",TIME_LIMIT_EXCEEDED,23,328
1590910440786427904,e4f316bfe970c62bf57b46f5ef8a290748707bf16f041fe868d04986a0cdd64f,2022-11-11 11:33:01,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,A=int(input())\nB=int(input())\nC=int(input())\n\nprint('%d' %(A+B+C))\n,NON_ZERO_EXIT_CODE,18,2748
1590910480376463360,7dd0c628805d8a6777ff5cc70a5ec79db9475f660782b2f4289ae98977303581,2022-11-11 11:33:10,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,print('2022'),ACCEPTED,17,2872
1590910534071943168,d8701a6da26af0d0579eec24b939fdbf381dd9449c34251ff0d8938314216606,2022-11-11 11:33:23,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#inclue<stdio.h>\nint main{\n    int X,Y,Z,C;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    C=X+Y-Z;\n    printf(\""%d\"",C)\n    return 0;\n    }",COMPILE_ERROR,0,0
1590910667715055616,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-11 11:33:55,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main{\n    public static void main(String args[]){\n        int X;\n        Scanner scanner = new Scanner(System.in);\n        X=scanner.nextInt();\n        if(X==0)\n            System.out.print(\""1\"");\n        else\n            System.out.print(\""6\"");\n\n    }\n}\n",WRONG_ANSWER,118,19004
1590910679316500480,d8701a6da26af0d0579eec24b939fdbf381dd9449c34251ff0d8938314216606,2022-11-11 11:33:58,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#inclue<stdio.h>\nint main{\n    int X,Y,Z,C;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    C=X+Y-Z;\n    printf(\""%d\"",C);\n    return 0;\n    }",COMPILE_ERROR,0,0
1590910693484834816,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 11:34:01,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint mynum1(int N)\n{\n    int i,c;\n\n    c=1;\n    for (i=1;i<=N;i++)\n    {\n        c=c*6;\n    }\n    c=c%10;\n    return c;\n}\n\nint main()\n{\n    int t,N,i;\n    if(scanf(\""%d\"", &t)){\n    for (i=1; i<=t; i++)\n    {\n        if(scanf(\""%d\"", &N)){\n        printf(\""%d\\n\"", mynum1(N));\n    }}\n    }\n}",TIME_LIMIT_EXCEEDED,24,336
1590910743816507392,33066437ddee11f609c900fe8dbd59cb8113e4d8dfd13c1812f199f4f3fdd334,2022-11-11 11:34:13,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,j,k;\n    scanf(\""%d%d%d\"",&i,&j,&k);\n    printf(\""%d\"",i+j-k);\n    return 0;\n}\n",ACCEPTED,8,340
1590910752624521216,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-11 11:34:15,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main{\n    public static void main(String args[]){\n        int X;\n        Scanner scanner = new Scanner(System.in);\n        X=scanner.nextInt();\n        if(X==0)\n            System.out.print(\""1\"");\n        else\n            System.out.print(\""6\"");\n\n    }\n}\n",WRONG_ANSWER,123,15552
1590910758446239744,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-11 11:34:17,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<math.h>\n#include <stdio.h>\nint main()\n{\n    int n,i,j,k,sum=0,m,p,q,max;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n],temp[n];\n    for(i=0;i<n;i++)\n     scanf(\""%d\"",&a[i]);\n    for(j=0;j<n;j++)\n     scanf(\""%d\"",&b[j]);\n    for(k=0;k<n;k++)\n     c[k]=b[k]-a[k];\n    for(m=0;m<n;m++)\n    {\n     temp[m]=c[m];\n     for(p=m;p<n;p++)\n     {\n      sum+=c[p];\n      if(sum>=temp[m])\n       temp[m]=sum;\n     }\n    }\n    max=temp[0];\n    for(q=0;q<n;q++)\n     {\n      if(temp[q]>=max)\n       max=temp[q];\n     }\n    printf(\""%d\"",max);\n    return 0;\n}\n",WRONG_ANSWER,3,188
1590910869851123712,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-11 11:34:43,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[10^9];\n    int i=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    \n    int b[10^9];\n    for(int j=0;j<n;j++)\n    {\n        b[j]=6^a[i]%10;\n    }\n    }\n    printf(\""%d\\n\"",b[j]);\n}",COMPILE_ERROR,0,0
1590910885298769920,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-11 11:34:47,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main{\n    public static void main(String args[]){\n        int X;\n        Scanner scanner = new Scanner(System.in);\n        X=scanner.nextInt();\n        if(X==0)\n            System.out.println(\""1\"");\n        else\n            System.out.println(\""6\"");\n\n    }\n}\n",WRONG_ANSWER,128,16388
1590910907121733632,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-11 11:34:52,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<math.h>\n#include <stdio.h>\nint main()\n{\n    int n,i,j,k,sum=0,m,p,q,max;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n],temp[n];\n    for(i=0;i<n;i++)\n     scanf(\""%d\"",&a[i]);\n    for(j=0;j<n;j++)\n     scanf(\""%d\"",&b[j]);\n    for(k=0;k<n;k++)\n     c[k]=b[k]-a[k];\n    for(m=0;m<n;m++)\n    {\n     temp[m]=c[m];\n     for(p=m;p<n;p++)\n     {\n      sum+=c[p];\n      if(sum>=temp[m])\n       temp[m]=sum;\n     }\n    }\n    max=temp[0];\n    for(q=0;q<n;q++)\n     {\n      if(temp[q]>=max)\n       max=temp[q];\n     }\n    printf(\""%d\\n\"",max);\n    return 0;\n}\n",WRONG_ANSWER,4,320
1590910949656166400,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-11 11:35:02,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\npublic class Main{\n    public static void main(String args[]){\n        int X;\n        Scanner scanner = new Scanner(System.in);\n        X=scanner.nextInt();\n        if(X==0)\n            System.out.println(\""1\"");\n        else\n            System.out.println(\""6\"");\n\n    }\n}\n",WRONG_ANSWER,118,16320
1590910971122618368,345826d11b41befc23adeb536e81da8eb6ec9a8bfb9448acf91422deedb8ba4a,2022-11-11 11:35:07,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\nprintf(\""2022\"");\n}",ACCEPTED,4,324
1590911010020593664,910d600982c42b3bf326994e410e7a344f2438b451c8f7deb6f6a9f965d3ee41,2022-11-11 11:35:17,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    printf(\""2022\\n\"");\n}",ACCEPTED,4,200
1590911017532592128,2bc6a85c0376656012a7970a7842a2a9d8769555a79ef4eec85ff45aa30ff7b7,2022-11-11 11:35:18,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\n/**\n * @author Nipuru\n * @since 2022/11/11 10:41\n */\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int num = sc.nextInt();\n        while(num -- != 0) {\n            int n = sc.nextInt();\n            if (n == 0) {\n                System.out.print(1);\n                continue;\n            }\n            System.out.print(6);\n            if (num != 0) {\n                System.out.println();\n            }\n        }\n    }\n},WRONG_ANSWER,279,16492
1590911024180563968,5bd1a8718ea7fb820055421c67b8e0a468e08d951f729a24e55bf407b3bdb1f6,2022-11-11 11:35:20,C++,300.0,1590681458522583041,1590676393489461248,1049226928954454016,#include <iostream>\n#include <math.h>\nusing namespace std;\nint main(){\n    int n;\n    cin>>n;\n    int count=n-2;\n    for(int i=5;i<=n;i++){\n        if(i%2==0){\n            count--;\n            continue;\n                   }\n        for(int j=2;j<=sqrt(i)+1;j++){\n            if(i%j==0) {\n                count--;\n                break;\n            }\n            \n        }\n    }\n    cout<<count;\n},ACCEPTED,16,460
1590911043562442752,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 11:35:25,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint mynum1(int N)\n{\n    int i,c;\n\n    c=1;\n    for (i=1;i<=N;i++)\n    {\n        c=c*6;\n    }\n    c=c%10;\n    return c;\n}\n\nint main()\n{\n    int t,N,i;\n    if(scanf(\""%d\"", &t)){\n    for (i=1; i<=t; i++)\n    {\n        if(scanf(\""%d\"", &N)){\n        printf(\""%d\\n\"", mynum1(N));\n    }}\n    }\n}",TIME_LIMIT_EXCEEDED,23,472
1590911073371357184,d8701a6da26af0d0579eec24b939fdbf381dd9449c34251ff0d8938314216606,2022-11-11 11:35:32,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#inclued<stdio.h>\nint main\n{\n    int X,Y,Z,C;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    C=X+Y-Z;\n    printf(\""%d\"",C);\n    return 0;\n    }",COMPILE_ERROR,0,0
1590911097903845376,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-11 11:35:38,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[10^9];\n    int i=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    \n    int b[10^9];\n    for(int j=0;j<n;j++)\n    {\n        b[j]=6^a[i]%10;\n    }\n    }\n    printf(\""%d\\n\"",b[j]);\n}",COMPILE_ERROR,0,0
1590911107512971264,06b00897262b024d9e66dcd771cf81de9b63954f7a4554699d17c2158114c0d1,2022-11-11 11:35:40,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner in = new Scanner(System.in);\n        int n=in.nextInt();\n        int n1=n+1;\n        int arr[]=new int[n1];\n        int a[]=new int[n1];\n        int x=1;\n        for(int o=1;o<=n;o++){\n            arr[o]=in.nextInt();\n        }\n        for(int i=0;i<n;i++){\n            int b=i+1;\n            for(int j=1;j<=arr[b];j++){\n                a[i]=x*6;\n                x=a[i];\n            }\n            x=1;\n        }\n        for(int k=0;k<n;k++){\n            if(k<n-1){\n                int p=a[k]%10;\n                System.out.println(p);\n            }else{\n                int y=a[k]%10;\n                System.out.print(y);\n            }\n            }\n        }\n}\n,NON_ZERO_EXIT_CODE,252,19028
1590911115129847808,3e087b0a196d30fcbb49ca80164c9eb5adf82ae3bb08ec0c141e5728fb180f0d,2022-11-11 11:35:42,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\n\t\tpublic static void main(String[] args) throws IOException {\n\t\t\t// TODO Auto-generated method stub\n\t\t\tBufferedReader bf=new BufferedReader(new InputStreamReader(System.in));\n\t\t\tint cnt=0;\n\t\t\tcnt=Integer.valueOf(bf.readLine());\n\t\t\tString[] temp=bf.readLine().split(\"" \"");\n\t\t\tfor(int i=0;i<=cnt-2;i++) {\n\t\t\t\tif(Integer.valueOf(temp[i])==0) {\n\t\t\t\t\tSystem.out.println(1);\n\t\t\t\t}else {\n\t\t\t\t\tSystem.out.println(6);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(Integer.valueOf(temp[cnt-1])==0) {\n\t\t\t\tSystem.out.print(1);\n\t\t\t}else {\n\t\t\t\tSystem.out.print(6);\n\t\t\t}\n\t\t\tbf.close();\n\t\t}\n}",NON_ZERO_EXIT_CODE,147,14396
1590911115754803200,5d127211f3edce9d9bd1062c03cd08473e4481ec46b4b0c70c2e8d9141c68f20,2022-11-11 11:35:42,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#inlude<stdio.h>\nint main()\n{\n    printf(\""2022\"");\n}",COMPILE_ERROR,0,0
1590911129570836480,d8701a6da26af0d0579eec24b939fdbf381dd9449c34251ff0d8938314216606,2022-11-11 11:35:45,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main\n{\n    int X,Y,Z,C;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    C=X+Y-Z;\n    printf(\""%d\"",C);\n    return 0;\n    }",COMPILE_ERROR,0,0
1590911206611816448,fec6d07e317796c63fb7ae6e7538f75973ad64af6e6196cc27eed3e9e685bf86,2022-11-11 11:36:04,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nmain()\n    {\n    int x,i,t=0,n;\n    scanf(\""%d\"",&n);\n    for(x=2;x<=n;x++)\n        {\n    for(i=2;i<x;i++)\n        {\n        if(x%i==0)\n            break;\n}\n    if(x==i)\n        t++;\n        }\n    printf(\""%d\\n\"",t);\n}",TIME_LIMIT_EXCEEDED,400,360
1590911241567141888,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 11:36:12,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t,i;\n    int z,ed;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<t;i++)\n    {\n    z=pow(6,a[i]);\n    ed=z%10;\n    printf(\""%d\\n\"",ed);}\n    return 0;\n}",WRONG_ANSWER,7,312
1590911257983651840,fa305ee4bf4c6a54add4e945b551f1e902b95c1a179a91ded55bf7ebb1c87c23,2022-11-11 11:36:16,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z;\n\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    printf(\""%d\\n\"",X+Y-Z);\n    return 0;\n}",ACCEPTED,6,196
1590911295350681600,5a1c17b308a3b3595833d34c6bdfb75e9f5dd0d065acfeb7f28ab8102ba7406c,2022-11-11 11:36:25,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    int i = 0, j = 0;\n    int cnt = 0;\n    for (i = 1; i <= n; i++)\n    {\n        for (j = 2; j < i; j++)\n        {\n            if (i%j == 0)\n                break;\n        }\n        if (i == j){\n            cnt++;\n        }\n    }\n    printf(\""%d\"",cnt);\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,400,324
1590911315726630912,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-11 11:36:30,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main(){\n    int n,i,j,l=0,flag;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++){\n    \t flag=1;\n    \tfor(j=2;j<=sqrt(i);j++){\n    \t\tif(i%j==0) {\n    \t\t\tflag=0;\n    \t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t}\n\t\tif(flag==1) l++; \n\t}\n\tprintf(\""%d\"",l);\n}",ACCEPTED,13,320
1590911381489123328,2bc6a85c0376656012a7970a7842a2a9d8769555a79ef4eec85ff45aa30ff7b7,2022-11-11 11:36:45,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\n/**\n * @author Nipuru\n * @since 2022/11/11 10:41\n */\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int num = sc.nextInt();\n        while(num -- != 0) {\n            int n = sc.nextInt();\n            if (n == 0) {\n                System.out.print(1);\n            } else {\n                System.out.print(6);\n            }\n            if (num != 0) {\n                System.out.println();\n            }\n        }\n    }\n},WRONG_ANSWER,267,16432
1590911397796577280,d8701a6da26af0d0579eec24b939fdbf381dd9449c34251ff0d8938314216606,2022-11-11 11:36:49,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main\n{\n    int X,Y,Z,C;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    C=(X+Y-Z);\n    printf(\""%d\"",C);\n    return 0;\n    }",COMPILE_ERROR,0,0
1590911450602844160,70c675ddfcb60b2192bc8ac38fb068fec0500208a5bf97a796c7cc074b43cf87,2022-11-11 11:37:02,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner myScanner = new Scanner(System.in);\n\t\tint n = myScanner.nextInt();\n\t\tint[] arr = new int[n];\n\t\tfor(int i = 0;i < n;i++) {\n\t\t\tarr[i] = myScanner.nextInt();\n\t\t\tSystem.out.println(\""6\"");\n\t\t}\n\t}\n\n}",NON_ZERO_EXIT_CODE,241,16524
1590911484362817536,d8701a6da26af0d0579eec24b939fdbf381dd9449c34251ff0d8938314216606,2022-11-11 11:37:10,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main\n{\n    int X,Y,Z,C;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    C==(X+Y-Z);\n    printf(\""%d\"",C);\n    return 0;\n    }",COMPILE_ERROR,0,0
1590911498971578368,5d127211f3edce9d9bd1062c03cd08473e4481ec46b4b0c70c2e8d9141c68f20,2022-11-11 11:37:13,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""2022\"");\n}",ACCEPTED,3,312
1590911505435000832,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-11 11:37:15,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,class Main {\n        public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int num = sc.nextInt();\n        int count = 0;\n        for (int i = 2;i <= num;i++) {\n            if (check(i)) {\n                count++;\n            }\n        }\n        System.out.println(count);\n    }\n\n    public static boolean check(int num) {\n        for (int i = 2;i <= Math.sqrt(num);i++) {\n            if (num % i == 0) {\n                return false;\n            }\n        }\n        return true;\n    }\n},COMPILE_ERROR,0,0
1590911560548159488,70c675ddfcb60b2192bc8ac38fb068fec0500208a5bf97a796c7cc074b43cf87,2022-11-11 11:37:28,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"count=0\nn=int(input())\nfor i in range(2,n):\n    loop = True\n    for j in range(2,i):\n        if(i%j == 0):\n            loop = False\n            break\n    if(loop):\n        count += 1;\n\nprint(count)",TIME_LIMIT_EXCEEDED,400,2760
1590911601333547008,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-11 11:37:38,Java,300.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\nclass Main {\n        public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int num = sc.nextInt();\n        int count = 0;\n        for (int i = 2;i <= num;i++) {\n            if (check(i)) {\n                count++;\n            }\n        }\n        System.out.println(count);\n    }\n\n    public static boolean check(int num) {\n        for (int i = 2;i <= Math.sqrt(num);i++) {\n            if (num % i == 0) {\n                return false;\n            }\n        }\n        return true;\n    }\n},ACCEPTED,264,16692
1590911680152907776,b95d43d4e550820a57e0a7b63f63233a65cb813e77be0e6c08c1739f86678946,2022-11-11 11:37:56,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(){\n    int t,i,j;\n    int w=6;\n    scanf(\""%d\"",&t);\n    int n[t];\n    for(i=0;i<t;i++)\n        scanf(\""%d\"",&n[i]);\n    for(j=0;j<t;j++)\n    {\n        if(n[j]>=0 && n[j]<=pow(10,9))\n            printf(\""%d\\n\"",w);\n    }\nreturn 0;\n}\n\n\n\n",WRONG_ANSWER,6,200
1590911710049927168,d122b81a371b28751082747cf65a235d0eddfd496e142775cd971d8f88adf327,2022-11-11 11:38:04,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n    int t;\n    scanf(\""%d\\n\"",&t);\n    int a[100];\n    for(int j=0;j<t;j++)\n    {\n        scanf(\""%d\"",&a[j]);\n        int a=6;\n        printf(\""%d\\n\"",a);\n    }\n  return 0;\n    \n}\n",WRONG_ANSWER,9,484
1590911722012086272,23d287b80d4d430308a1b57ee92bb4f2d1b25d1142a13c1c0fda4316c9bb9f17,2022-11-11 11:38:06,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"def main():\n     X,Y,Z= int(input(\""\"")), int(input(\""\"")), int(input(\""\""))\n     if(X in range(0,101) and Y in range(0,101) and Z in range(0,101)):\n         print(X+Y-Z)\nmain()",NON_ZERO_EXIT_CODE,16,2760
1590911748692054016,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 11:38:13,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int t,i,x,n,sum,yu;\n    scanf(\""%d\"",&x);\n    for(i=0;i<x;i++)\n    {\n    scanf(\""%d\"",&n);\n    t=n%4；\n    if(n%4==0),t=4;\n    sum=pow(6,t);\n    yu=sum%10;\n    printf(\""%d\"",yu);\n    if(i!=x-1) printf(\""\\n\"");\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590911766505238528,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-11 11:38:17,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[1000000000000];\n    int i=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    \n    int b[1000000000000],j;\n    for( j=0;j<n;j++)\n    {\n        b[j]=6^a[i]%10;\n    }\n    }\n    printf(\""%d\\n\"",b[j]);\n}",COMPILE_ERROR,0,0
1590911768036179968,5a1c17b308a3b3595833d34c6bdfb75e9f5dd0d065acfeb7f28ab8102ba7406c,2022-11-11 11:38:17,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    int i,j;\n    int cnt = 0;\n    for (i = 1; i <= n; i++){\n        for (j = 2; j < i; j++){\n            if (i%j == 0)\n                break;\n        }\n        if (i == j){\n            cnt++;\n        }\n    }\n    printf(\""%d\"",cnt);\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,400,180
1590911802450448384,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 11:38:26,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,x=50;\ny=10;\nz=30;\nprint (input('x+y-z')),WRONG_ANSWER,15,2756
1590911802718879744,9aa17e95021225dcdd2b01419b021cd002e47f9a7854274df042f64621bd207a,2022-11-11 11:38:26,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z,P;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    P=X+Y-Z;\n    printf(\""%d\"",P);\n    return 0;\n}\n",ACCEPTED,7,320
1590911819571572736,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-11 11:38:30,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<math.h>\n#include <stdio.h>\nint main()\n{\n    int n,i=2,j,temp=0;\n    scanf(\""%d\"",&n);\n     for(j=2;j<=i;j++)\n     {\n       if(i>n)\n        break;\n      if(i%j==0&&j==i)\n      {\n       ++temp;\n       j=1;\n       ++i;\n      }\n      else if(i%j==0)\n      {\n       ++i;\n       j=1;\n      }\n     }\n    printf(\""%d\"",temp);\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,400,360
1590911863393685504,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 11:38:40,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,x=50;\ny=10;\nz=30;\nprint ('x+y-z'),WRONG_ANSWER,17,2876
1590911894477672448,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 11:38:48,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,x=50;\ny=10;\nz=30;\nprint (x+y-z),WRONG_ANSWER,17,2820
1590911911531687936,2bc6a85c0376656012a7970a7842a2a9d8769555a79ef4eec85ff45aa30ff7b7,2022-11-11 11:38:52,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\n/**\n * @author Nipuru\n * @since 2022/11/11 10:41\n */\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int num = sc.nextInt();\n        while(num -- != 0) {\n            int n = sc.nextInt();\n            if (n == 0) {\n                System.out.println(1);\n            } else {\n                System.out.println(6);\n            }\n        }\n    }\n},NON_ZERO_EXIT_CODE,233,16572
1590911937444118528,15ac7d06a472ca25d78349f7cc3a73d23c7d7a4f0c4ae3cec6200fcdb8135965,2022-11-11 11:38:58,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(“2022\\n\"");\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590911949221728256,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 11:39:01,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,x=50;\ny=10;\nz=30;\nprint (input x+y-z),NON_ZERO_EXIT_CODE,17,2760
1590911981907935232,15ac7d06a472ca25d78349f7cc3a73d23c7d7a4f0c4ae3cec6200fcdb8135965,2022-11-11 11:39:08,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(”2022\\n\"");\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590912023154700288,3e087b0a196d30fcbb49ca80164c9eb5adf82ae3bb08ec0c141e5728fb180f0d,2022-11-11 11:39:18,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\n\t\tpublic static void main(String[] args) throws IOException {\n\t\t\t// TODO Auto-generated method stub\n\t\t\tBufferedReader bf=new BufferedReader(new InputStreamReader(System.in));\n\t\t\tint cnt=0;\n\t\t\tcnt=Integer.valueOf(bf.readLine());\n\t\t\tString[] temp=bf.readLine().split(\"" \"");\n\t\t\tfor(int i=0;i<=cnt-2;i++) {\n\t\t\t\tif(Integer.valueOf(temp[i])==0) {\n\t\t\t\t\tSystem.out.println(1);\n\t\t\t\t}else {\n\t\t\t\t\tSystem.out.println(6);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(Integer.valueOf(temp[cnt-1])==0) {\n\t\t\t\tSystem.out.print(1);\n\t\t\t}else {\n\t\t\t\tSystem.out.print(6);\n\t\t\t}\n\t\t\tbf.close();\n\t\t}\n}",WRONG_ANSWER,158,14256
1590912040682721280,15ac7d06a472ca25d78349f7cc3a73d23c7d7a4f0c4ae3cec6200fcdb8135965,2022-11-11 11:39:22,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""2022\\n\"");\n    return 0;\n}\n",ACCEPTED,3,472
1590912050098909184,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 11:39:25,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main(void)\n{\n    int n,i,j,k;\n    int a[10];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=0;j<n;j++)\n    {\n        k=6^a[j];\n        if(k=>100&&k<1000)\n        {\n            d=k%100;\n        }\n        if(k=>1000&&k<10000)\n        {\n            d=k%1000;\n        }\n        printf(\""%d\"",d);\n        printf(\""\\n\"");\n    }\n}",COMPILE_ERROR,0,0
1590912100816457728,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 11:39:37,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,a=int(input())\nfor i in range(a)\n    print(6),NON_ZERO_EXIT_CODE,18,2756
1590912104629055488,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 11:39:38,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main(void)\n{\n    int n,i,j,k;\n    int a[10];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=0;j<n;j++)\n    {\n        k=6^a[j];\n        if(k=>100&&k<1000)\n        {\n            d=k%100;\n        }\n        if(k=>1000&&k<10000)\n        {\n            d=k%1000;\n        }\n        printf(\""%d\"",d);\n        printf(\""\\n\"");\n    }\n}",COMPILE_ERROR,0,0
1590912132349210624,fec6d07e317796c63fb7ae6e7538f75973ad64af6e6196cc27eed3e9e685bf86,2022-11-11 11:39:44,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nmain()\n    {\n    int x,i,t=0,n;\n    scanf(\""%d\"",&n);\n    for(x=2;x<=n;x++)\n        {\n    for(i=2;i<=x/2;i++)\n        {\n        if(x%i==0)\n            break;\n}\n    if(x/2<i)\n        t++;\n        }\n    printf(\""%d\\n\"",t);\n}",TIME_LIMIT_EXCEEDED,400,192
1590912148715409408,5a1c17b308a3b3595833d34c6bdfb75e9f5dd0d065acfeb7f28ab8102ba7406c,2022-11-11 11:39:48,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    int i,j;\n    int cnt = 0;\n    for (i = 2; i <= n; i++){\n        for (j = 2; j < i; j++){\n            if (i%j == 0)\n                break;\n        }\n        if (i == j){\n            cnt++;\n        }\n    }\n    printf(\""%d\"",cnt);\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,400,492
1590912178352336896,345826d11b41befc23adeb536e81da8eb6ec9a8bfb9448acf91422deedb8ba4a,2022-11-11 11:39:55,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    if(X>=0&&X<=100&&Y>=0&&Y<=100&&Z>=0&&Z<=100)\n        printf(\""%d\"",X+Y-Z);\n}\n",ACCEPTED,6,512
1590912182995451904,910d600982c42b3bf326994e410e7a344f2438b451c8f7deb6f6a9f965d3ee41,2022-11-11 11:39:56,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x,y,z;\n    printf(\""请输入X，Y，Z的值（0~100）：\"");\n    scanf(\""%d,%d,%d\"",&x,&y,&z);\n    printf(\""%d\\n\"",x+y-z);\n}",WRONG_ANSWER,4,344
1590912205372043264,345826d11b41befc23adeb536e81da8eb6ec9a8bfb9448acf91422deedb8ba4a,2022-11-11 11:40:02,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    if(X>=0&&X<=100&&Y>=0&&Y<=100&&Z>=0&&Z<=100)\n        printf(\""%d\"",X+Y-Z);\n}\n",ACCEPTED,6,336
1590912214159134720,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-11 11:40:04,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\nclass Main {\n        public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int temp = sc.nextInt();\n        for (int i = 0;i < temp;i++) {\n            System.out.println(6);\n        }\n    }\n},WRONG_ANSWER,372,16416
1590912242386800640,d8701a6da26af0d0579eec24b939fdbf381dd9449c34251ff0d8938314216606,2022-11-11 11:40:10,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main\n{\n    int X,Y,Z,C=0;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    C=(X+Y-Z);\n    printf(\""%d\"",C);\n    return 0;\n    }",COMPILE_ERROR,0,0
1590912245880651776,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 11:40:11,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int t,i,x,n,sum,yu;\n    scanf(\""%d\"",&x);\n    for(i=0;i<x;i++)\n    {\n    scanf(\""%d\"",&n);\n    t=n%4;\n    if(n%4==0) t=4;\n    sum=pow(6,t);\n    yu=sum%10;\n    printf(\""%d\"",yu);\n    if(i!=x-1) printf(\""\\n\"");\n    }\n    return 0;\n}\n",WRONG_ANSWER,7,332
1590912261835788288,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 11:40:15,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,a=int(input())\nfor i in range(a):\n    m=int(input())\n    print(6),NON_ZERO_EXIT_CODE,17,2908
1590912289061015552,5d127211f3edce9d9bd1062c03cd08473e4481ec46b4b0c70c2e8d9141c68f20,2022-11-11 11:40:22,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x,y,z,n;\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    n=x+y-z;\n    printf(\""%d\"",n);\n}",ACCEPTED,6,308
1590912307352375296,3e087b0a196d30fcbb49ca80164c9eb5adf82ae3bb08ec0c141e5728fb180f0d,2022-11-11 11:40:26,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\n\t\tpublic static void main(String[] args) throws IOException {\n\t\t\t// TODO Auto-generated method stub\n\t\t\tBufferedReader bf=new BufferedReader(new InputStreamReader(System.in));\n\t\t\tint cnt=0;\n\t\t\tcnt=Integer.valueOf(bf.readLine());\n\t\t\tString[] temp=bf.readLine().split(\"" \"");\n\t\t\tfor(int i=0;i<=cnt-2;i++) {\n\t\t\t\tif(Integer.valueOf(temp[i])==0) {\n\t\t\t\t\tSystem.out.println(1);\n\t\t\t\t}else {\n\t\t\t\t\tSystem.out.println(6);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(Integer.valueOf(temp[cnt-1])==0) {\n\t\t\t\tSystem.out.print(1);\n\t\t\t}else {\n\t\t\t\tSystem.out.print(6);\n\t\t\t}\n\t\t\tbf.close();\n\t\t}\n}",NON_ZERO_EXIT_CODE,148,14396
1590912331167629312,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-11 11:40:32,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\n\nint main()\n\n{\n\n    printf(\""2022\"");\n\n    return 0;\n\n}",ACCEPTED,3,480
1590912375186829312,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 11:40:42,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\nint a[100],n,i,b;\nif(n<pow(10,9)&&n>0){\n    scanf(\""%d\"",&n);\nfor(i=0;i<n;i++)\n{\n\tscanf(\""%d\"",&a[i]);\n\n}\n    for(i=0;i<n;i++)\n    {\n        b=pow(6,a[i]);\nprintf(\""%d\\n\"",b%10);\n    }\n}\n\n\n\n\n\n\n\n}\n\n",WRONG_ANSWER,6,356
1590912386268200960,542d97133043a1f2156354473a31382c35bb2836688b0ed76eae59c52a2e0e3a,2022-11-11 11:40:45,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int m,n,o,p,q,digit;\n    int a[n];\n    scanf(\""%d\"",&n);\n    for(m=0;m<n;m++)\n    {\n        scanf(\""%d\"",&a[m]);\n    }\n    for(o=0;o<n;o++)\n    {\n        p=1;\n        for(q=0;q<a[o];q++)\n        {\n            p=p*6;\n        }\n        digit=p%10;\n        printf(\""%d\\n\"",digit);\n    }\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,23,196
1590912390919684096,910d600982c42b3bf326994e410e7a344f2438b451c8f7deb6f6a9f965d3ee41,2022-11-11 11:40:46,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x,y,z;\n    printf(\""请输入X，Y，Z的值（0~100）：\"");\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    printf(\""%d\\n\"",x+y-z);\n}",WRONG_ANSWER,4,312
1590912413719900160,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-11 11:40:51,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\nclass Main {\n        public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int temp = sc.nextInt();\n                    if (temp == 0) {\n            System.out.println(0);\n            return;\n        }\n        for (int i = 0;i < temp;i++) {\n            System.out.println(6);\n        }\n    }\n},WRONG_ANSWER,366,16428
1590912430312587264,d8701a6da26af0d0579eec24b939fdbf381dd9449c34251ff0d8938314216606,2022-11-11 11:40:55,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main\n{\n    int X,Y,Z,C=0;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    C=(X+Y-Z);\n    printf(\""%d\"",C);\n    return 0;\n    }",COMPILE_ERROR,0,0
1590912470049402880,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 11:41:05,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a;\n    scanf(\""%d\"",&a);\n    int i,b[100];\n    for(i=0;i<a;i++){\n        scanf(\""%d\"",&b[i]);\n    }\n    for(i=0;i<a;i++){\n        printf(\""6\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,9,344
1590912482242244608,5d25e51c02c08da2e0946483619d6f75981ff1037e5bbe3f3e4a71eeb2de4c8a,2022-11-11 11:41:08,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <iostream>\n#include <math.h>\nusing namespace std;\n\nint main(){\n    int n,a;\n    scanf(\""%d\"",&n);\n    while (n--){\n        scanf(\""%d\"",&a);\n        int t = a % 4;\n        if (a%4==0) t = 4;\n        a %= 10;\n        printf(\""%d\\n\"",(int)pow(a,t)%10);\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590912493516558336,23d287b80d4d430308a1b57ee92bb4f2d1b25d1142a13c1c0fda4316c9bb9f17,2022-11-11 11:41:10,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"def main():\n     X,Y,Z= int(input(\""\"")), int(input(\""\"")), int(input(\""\""))\n     if(X in range(0,101) and Y in range(0,101) and Z in range(0,101)):\n         print(X+Y-Z)\n         return 0\nmain()",NON_ZERO_EXIT_CODE,17,2816
1590912526898999296,542d97133043a1f2156354473a31382c35bb2836688b0ed76eae59c52a2e0e3a,2022-11-11 11:41:18,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int m,n,o,p,q,digit;\n    int a[n];\n    scanf(\""%d\"",&n);\n    for(m=0;m<n;m++)\n    {\n        scanf(\""%d\"",&a[m]);\n    }\n    for(o=0;o<n;o++)\n    {\n        p=1;\n        for(q=0;q<a[o];q++)\n        {\n            p=p*6;\n        }\n        digit=p%10;\n        printf(\""%d\\n\"",digit);\n    }\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,24,464
1590912611691069440,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 11:41:39,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,a=int(input())\n\nfor i in range(a):\n\n    print(6),WRONG_ANSWER,50,2888
1590912637964193792,910d600982c42b3bf326994e410e7a344f2438b451c8f7deb6f6a9f965d3ee41,2022-11-11 11:41:45,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x,y,z;\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    printf(\""%d\\n\"",x+y-z);\n}",ACCEPTED,6,192
1590912669744435200,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-11-11 11:41:52,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"n = int(input())\ncount=0\nfor i in range(2, n+1):\n    for j in range(2, i):\n        if i % j ==0:\n            break\n    else:\n        count+=1\nprint(count)\n",TIME_LIMIT_EXCEEDED,400,2760
1590912678317568000,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-11 11:41:54,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\nclass Main {\n        public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int temp = sc.nextInt();\n                    if (temp == 0) {\n            System.out.println(1);\n            return;\n        }\n        for (int i = 0;i < temp;i++) {\n            System.out.println(6);\n        }\n    }\n},WRONG_ANSWER,359,16656
1590912692460785664,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 11:41:58,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a;\n    if(scanf(\""%d\"",&a)){\n    int i,b[100];\n    for(i=0;i<a;i++){\n        if(scanf(\""%d\"",&b[i])){}    }\n    for(i=0;i<a;i++){\n        printf(\""6\\n\"");\n    }\n    return 0;\n}}",WRONG_ANSWER,9,512
1590912770709696512,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 11:42:16,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main(void)\n{\n    int n,i,j,k;\n    int a[10];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=0;j<n;j++)\n    {\n        k=6^a[j];\n        k=k/(6^a[j]-1);\n        printf(\""%d\"",k);\n        printf(“\\n”);\n    }\n}",COMPILE_ERROR,0,0
1590912781719769088,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 11:42:19,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,a=int(input())\ndate=[]\nfor i in range(a):\n    date.append(int(input())\nfor i in range(a):\n\n    print(6),NON_ZERO_EXIT_CODE,18,2752
1590912788833304576,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 11:42:21,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main(){\n  int i,j,n,k=0;\n  scanf(\""%d\"",&n);\n    for(i=2;i<n;i++)\n   {\n    for (j = 2; j <i ; j++)\n        {\n      if (i%j == 0)\n        break;\n    }\n     if (i==j)\n       k++;\n\n  }\n  printf(\""%d\"",k);\n  return 0;\n}\n",TIME_LIMIT_EXCEEDED,400,184
1590912885851729920,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 11:42:44,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main(void)\n{\n    int n,i,j,k;\n    int a[10];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=0;j<n;j++)\n    {\n        k=6^a[j];\n        k=k/(6^(a[j]-1));\n        printf(\""%d\"",k);\n        printf(“\\n”);\n    }\n}",COMPILE_ERROR,0,0
1590912902096289792,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-11 11:42:48,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\n\nint main()\n\n{\n\n    int x,y,z;\n\n    scanf(\""%d%d%d\"",&x,&y,&z);\n\n    printf(\""%d\"",x+y-z);\n\n    return 0;\n\n}",ACCEPTED,6,324
1590912908966559744,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-11-11 11:42:49,Python,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"n = int(input())\ncount=0\nfor i in range(2, n+1):\n    for j in range(2, int(i**0.5)+1):\n        if i % j ==0:\n            break\n    else:\n        count+=1\nprint(count)",ACCEPTED,241,2808
1590912968596959232,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 11:43:04,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,a=int(input())\ndate=[]\nfor i in range(a):\n    date.append(int(input()))\nfor i in range(a):\n\n    print(6),NON_ZERO_EXIT_CODE,17,2912
1590913072707993600,ce1bb8e96385d94dfdb2bd028407e2ffb5a64494440cd7964d6624a83809dae6,2022-11-11 11:43:28,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(){\n    int n;\n    scanf(\""%d\"",&n);\n    if(n=0)\n        printf(\""%d\"",1);\n    else\n        printf(\""%d\"",6)\nreturn 0;\n}",COMPILE_ERROR,0,0
1590913081188876288,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 11:43:30,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,x=int(input());\ny=int(input());\nz=int(input());\nprint ('%d+%d-%d'%(x+y-z)),NON_ZERO_EXIT_CODE,18,2876
1590913104555347968,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 11:43:36,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,x=int(input());\ny=int(input());\nz=int(input());\nprint ('%d+%d-%d'%(x+y-z));,NON_ZERO_EXIT_CODE,16,2752
1590913119218610177,23d287b80d4d430308a1b57ee92bb4f2d1b25d1142a13c1c0fda4316c9bb9f17,2022-11-11 11:43:40,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"def main():\n     X,Y,Z= int(input(\""\"")), int(input(\""\"")), int(input(\""\""));\n     if(X in range(0,101) and Y in range(0,101) and Z in range(0,101)):\n         print(X+Y-Z)\nmain()",NON_ZERO_EXIT_CODE,17,2908
1590913130861998080,ce1bb8e96385d94dfdb2bd028407e2ffb5a64494440cd7964d6624a83809dae6,2022-11-11 11:43:42,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(){\n    int n;\n    if(n=0)\n        printf(\""%d\"",1);\n    else\n        printf(\""%d\"",6)\nreturn 0;\n}",COMPILE_ERROR,0,0
1590913132367777792,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 11:43:43,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,x=int(input())\ny=int(input())\nz=int(input())\nprint ('%d+%d-%d'%(x+y-z)),NON_ZERO_EXIT_CODE,16,2908
1590913169135046656,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 11:43:51,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main(){\n  int i,j,n,k=0;\n  scanf(\""%d\"",&n);\n    for(i=2;i<n;i++)\n   {\n    for(j=2;j<i;j++)\n        {\n      if (i%j==0)\n        break;\n    }\n     if(i==j)\n       k++;\n  }\n  printf(\""%d\"",k);\n  return 0;\n}\n",TIME_LIMIT_EXCEEDED,400,472
1590913188428840960,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 11:43:56,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\n\ndate=map(int,input().split())\nfor i in range(a):\n\n    print(6)",WRONG_ANSWER,49,2884
1590913203415068672,23d287b80d4d430308a1b57ee92bb4f2d1b25d1142a13c1c0fda4316c9bb9f17,2022-11-11 11:44:00,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"def main():\n     X,Y,Z= int(input(\""\"")), int(input(\""\"")), int(input(\""\""))\n     if(X in range(0,101) and Y in range(0,101) and Z in range(0,101)):\n         print(X+Y-Z)\nmain()",NON_ZERO_EXIT_CODE,15,2760
1590913273443192832,fa305ee4bf4c6a54add4e945b551f1e902b95c1a179a91ded55bf7ebb1c87c23,2022-11-11 11:44:16,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{   int t,n,i,s;\n     scanf(\""%d\"",&t);\n     for(i=0;i<t;i++){\n        scanf(\""%d\"",&n);\n        s=pow(6,n);\n        printf(\""%d\\n\"",s%10);\n     }\n\n    return 0;\n}",WRONG_ANSWER,6,196
1590913362228195328,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-11 11:44:37,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"\n#include<stdio.h>\nmain()\n{\n\tint a,i,j,m=0;\n\tscanf(\""%d\"",&a);\n\tfor(i=2;i<=a;i++)\n\t\t{\n\t\tfor(j=2;j<=i;j++)\n\t\t\tif(i%j==0)\n\t\t\t\tbreak;\n\t\tif(i==j)\n\t\t\tm++;\n\t\t}\n\t\tprintf(\""%d\"",m);\n}\n",TIME_LIMIT_EXCEEDED,400,332
1590913373833834496,b95d43d4e550820a57e0a7b63f63233a65cb813e77be0e6c08c1739f86678946,2022-11-11 11:44:40,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,j,num=0;/*计数器num*/\n    scanf(\""%d\"",&n);\n    if(2<=n && n<=pow(10,5))\n    {\n       for (i=2; i<=n; ++i)\n        {\n\t\t//判断i是否是素数，是输出，不是不输出\n            for (j=2; j<i; ++j)\n            {\n                if (0 == i%j)\n                    break;\n            }\n                if (j == i)\n                    num+=1;\n        }\n        printf(\""%d\"",num);\n    }\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,400,180
1590913391689007104,70c675ddfcb60b2192bc8ac38fb068fec0500208a5bf97a796c7cc074b43cf87,2022-11-11 11:44:44,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tint count = 0;\n\t\tScanner myScanner = new Scanner(System.in);\n\t\tint n = myScanner.nextInt();\n\t\tfor(int i = 2;i < n;i++) {\n\t\t\tboolean loop = true;\n\t\t\tfor(int j = 2;j <= i/2;j++) {\n\t\t\t\tif(i%j == 0) {\n\t\t\t\t\tloop = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(loop) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n},TIME_LIMIT_EXCEEDED,400,18440
1590913395052818432,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 11:44:45,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"x=int(input())\ny=int(input())\nz=int(input())\nprint ('%d+%d-%d=%d'%(x,y,z,x+y-z))",NON_ZERO_EXIT_CODE,16,2852
1590913416422817792,73af9d5098be5d450fba728363c8fdbe0f6a5526466daa2f3b74abf1acf75527,2022-11-11 11:44:50,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n, i;\n    int acquire[1000], consume[1000], sum = 0, s;\n    scanf(\""%d\"", &n);\n    for (i = 0; i < n; i++)\n    {\n        scanf(\""%d\"", &consume[i]);\n    }\n    for (i = 0; i < n; i++)\n    {\n        scanf(\""%d\"", &acquire[i]);\n    }\n    int max = acquire[0] - consume[0];\n    for (i = 0; i < n; i++)\n    {\n        s = acquire[i] - consume[i];\n        sum = sum + s;\n        if (sum > max)\n            max = sum;\n\n    }\n   \n    printf(\""%d\"", max);\n    return 0;\n}",WRONG_ANSWER,3,460
1590913416884170752,ccc42b8437aa15d1214e4623799ed35cd8ea8087c26cb1b596d51ae4556ea39c,2022-11-11 11:44:50,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"def prime(p):\n    a=p//2\n    for i in range(2,a+1):\n        if p%i==0:\n            return False\n    return True\na=eval(input())\nsums=0\n\nprint(168)",WRONG_ANSWER,18,2748
1590913450367299584,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-11 11:44:58,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"\n#include<stdio.h>\nmain()\n{\n\tint a,i,j,m=0;\n\tscanf(\""%d\"",&a);\n\tfor(i=2;i<=a;i++)\n\t\t{\n\t\tfor(j=2;j*j<=i;j++)\n\t\t\tif(i%j==0)\n\t\t\t\tbreak;\n\t\tif(i==j)\n\t\t\tm++;\n\t\t}\n\t\tprintf(\""%d\"",m);\n}\n",WRONG_ANSWER,10,180
1590913458730766336,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-11 11:45:00,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\nclass Main {\n        Scanner sc = new Scanner(System.in);\n        int temp = sc.nextInt();\n        if (temp == 0) {\n            System.out.println(1);\n            return;\n        }\n        for (int i = 0;i < temp;i++) {\n            System.out.println(6);\n        }\n    }\n},COMPILE_ERROR,0,0
1590913539475288064,7dd0c628805d8a6777ff5cc70a5ec79db9475f660782b2f4289ae98977303581,2022-11-11 11:45:20,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"x=input()\ny=input()\nz=input()\n0>=x,y,z<=100\nj=x+y-z\nprint('j')",NON_ZERO_EXIT_CODE,16,2752
1590913565282840576,b95d43d4e550820a57e0a7b63f63233a65cb813e77be0e6c08c1739f86678946,2022-11-11 11:45:26,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,j,num=0;/*计数器num*/\n    scanf(\""%d\"",&n);\n    if(2<=n && n<=pow(10,5))\n    {\n       for (i=2; i<=n; ++i)\n        {\n\t\t//判断i是否是素数，是输出，不是不输出\n            for (j=2; j<i; ++j)\n            {\n                if (0 == i%j)\n                    break;\n            }\n                if (j == i)\n                    num+=1;\n        }\n        printf(\""%d\"",num);\n    }\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,400,348
1590913610354831360,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 11:45:37,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\n\ndate=map(int,input().split())\nfor i in range(a):\n\n    print('6')",WRONG_ANSWER,49,3132
1590913617795526656,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-11 11:45:38,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\nclass Main {\n        Scanner sc = new Scanner(System.in);\n        int temp = sc.nextInt();\n        if (temp == 0) {\n            System.out.println(1);\n            return;\n        } else {\n            for (int i = 0;i < temp;i++) {\n            System.out.println(6);\n            }\n        }\n    }\n},COMPILE_ERROR,0,0
1590913661751857152,902d8082eea06043d392298983db4630cde4418ac8ee42282d537bfaae045c2f,2022-11-11 11:45:49,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,import datetime\n\na=[]\n\na=str(datetime.date.today())\n\nprint(a.split('-')[0]),ACCEPTED,17,3016
1590913686670192640,7dd0c628805d8a6777ff5cc70a5ec79db9475f660782b2f4289ae98977303581,2022-11-11 11:45:55,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,x=input()\ny=input()\nz=input()\nj=x+y-z\n0>=j<=100\nprint('j'),NON_ZERO_EXIT_CODE,16,2872
1590913770778570752,1773d9c971942817d949c47973c4eb8c24531f728d5480dbf3b232e568926258,2022-11-11 11:46:15,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.*;\nimport java.lang.Math;\nclass Main{\n    public static void main(String[] args){\n        Scanner sc = new Scanner(System.in);\n        int t = sc.nextInt();\n        int n = sc.nextInt();\n        int n1 = sc.nextInt();\n        int n2 = sc.nextInt();\n        System.out.println(((int) Math.pow(6, n)) % 10);\n        System.out.println(((int) Math.pow(6, n1)) % 10);\n        System.out.println(((int) Math.pow(6, n2)) % 10);\n    }\n}",WRONG_ANSWER,125,16524
1590913779557269504,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-11 11:46:17,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\nclass Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int temp = sc.nextInt();\n        if (temp == 0) {\n            System.out.println(1);\n            return;\n        } else {\n            for (int i = 0;i < temp;i++) {\n                System.out.println(6);\n            }\n        }\n    }\n},WRONG_ANSWER,377,16668
1590913787669053440,7dd0c628805d8a6777ff5cc70a5ec79db9475f660782b2f4289ae98977303581,2022-11-11 11:46:19,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,x=input('')\ny=input('')\nz=input('')\nj=x+y-z\n0>=j<=100\nprint('j'),NON_ZERO_EXIT_CODE,18,2884
1590913863401385984,7dd0c628805d8a6777ff5cc70a5ec79db9475f660782b2f4289ae98977303581,2022-11-11 11:46:37,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,x=input()\ny=input()\nz=input()\nj=x+y-z\n0>=j<=100\nprint(j),NON_ZERO_EXIT_CODE,17,2900
1590913901523415040,fec6d07e317796c63fb7ae6e7538f75973ad64af6e6196cc27eed3e9e685bf86,2022-11-11 11:46:46,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nmain()\n    {\n    int x,i,t=0,n;\n    scanf(\""%d\"",&n);\n    for(x=2;x<=n;x++)\n    {\n        for(i=2;i<=x/2;i++)\n           if(x%i==0)\n           break;\n\n        if(x/2<i)\n            t++;\n    }\n    printf(\""%d\\n\"",t);\n}",TIME_LIMIT_EXCEEDED,400,348
1590913910876733440,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-11 11:46:48,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,sum=0;\n    scanf(\""%d\"",&n);\n    int i=2,j=2;\n    for(i=2;i<n;i++)\n    {\n        for(j=2;j<n;j++)\n        {\n            if(i%j==0)\n                break;\n        }\n        if(i==j)\n            sum++;\n    }\n    printf(\""%d\"",sum);\n}",TIME_LIMIT_EXCEEDED,400,196
1590913935434362880,ce1bb8e96385d94dfdb2bd028407e2ffb5a64494440cd7964d6624a83809dae6,2022-11-11 11:46:54,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(){\n    int n;\n    scanf(\""%d\"",&)\n    if(n=0)\n        printf(\""%d\"",1);\n    else\n        printf(\""%d\"",6)\nreturn 0;\n}",COMPILE_ERROR,0,0
1590913953042071552,07d925df8d2026d3171a0a2ca84a6ef7f4a5b47a584cf47b66c5dd8f28139d1f,2022-11-11 11:46:58,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"print(\""2022\"")",ACCEPTED,17,2748
1590914179744202752,fa305ee4bf4c6a54add4e945b551f1e902b95c1a179a91ded55bf7ebb1c87c23,2022-11-11 11:47:52,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{   int t,n,i,s;\n     scanf(\""%d\"",&t);\n     for(i=0;i<t;i++){\n        scanf(\""%d\"",&n);\n        s=pow(6,n);\n        printf(\""%d\"",s%10);\n        if(i!=t-1) printf(\""\\n\"");\n     }\n\n    return 0;\n}\n\n",WRONG_ANSWER,6,340
1590914226535837696,c5cc6f9845df4bd1986af86c0696296436bbc0f00a10a9f891b4100e57bc3a19,2022-11-11 11:48:04,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <bits/stdc++.h>\nusing namespace std;\n#define N 1000\nint main()\n{\n\tint n;\n\tint a[N],b[N];\n\tint sum1=0,sum2=0;\n\tcin>>n;\n\tfor(int i=0;i<n;i++) cin>>a[i];\n\tfor(int i=0;i<n;i++) {\n\t\tcin>>b[i];\n\t\ta[i]=b[i]-a[i];\n\t}\n\tfor(int i=0;i<n;i++){\n\t\tif(a[i]>0) sum1+=a[i];\n\t\telse{\n\t\t\tif(sum1>sum2) sum2=sum1;\n\t\t\tsum1=0;\n\t\t\tcontinue;\n\t\t}\n\t}\n\tcout<<sum2<<endl;\n}",WRONG_ANSWER,3,440
1590914256348971008,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 11:48:11,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"x=int(input());\ny=int(input());\nz=int(input());\n0<=x<=100;0<=y<=100;0<=z<=100;\nprint ('%d+%d-%d=%d'%(x,y,z,x+y-z));",NON_ZERO_EXIT_CODE,22,3244
1590914275894407168,7dd0c628805d8a6777ff5cc70a5ec79db9475f660782b2f4289ae98977303581,2022-11-11 11:48:15,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,x=input()\ny=input()\nz=input()\nj=float(x)+float(y)-float(z)\n0>=j<=100\nprint(j),NON_ZERO_EXIT_CODE,20,2752
1590914350729199616,fa305ee4bf4c6a54add4e945b551f1e902b95c1a179a91ded55bf7ebb1c87c23,2022-11-11 11:48:33,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{   int t,n,i,s;\n     scanf(\""%d\"",&t);\n     for(i=0;i<t;i++){\n        scanf(\""%d\"",&n);\n        s=pow(6,n);\n        printf(\""%d\"",s%10);\n        if(i!=t-1) printf(\""\\n\"");\n     }\n\n    return 0;\n}\n\n",WRONG_ANSWER,7,336
1590914351186378752,ce1bb8e96385d94dfdb2bd028407e2ffb5a64494440cd7964d6624a83809dae6,2022-11-11 11:48:33,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(){\n    int n;\n    scanf(\""%d\"",&)\n    if(n=0)\n        printf(\""%d\"",1);\n    else\n        printf(\""%d\"",6);\nreturn 0;\n}",COMPILE_ERROR,0,0
1590914351580622848,2bc6a85c0376656012a7970a7842a2a9d8769555a79ef4eec85ff45aa30ff7b7,2022-11-11 11:48:33,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n\nint main() {\n\tint count;\n\tscanf(\""%d\"", &count);\n\twhile (count -- != 0) {\n\t\tint num;\n\t\tscanf(\""%d\"", &num); \n\t\tif(num == 0) {\n\t\t\tprintf(\""1\\n\"");\n\t\t} else {\n\t\t\tprintf(\""6\\n\"");\n\t\t}\n\t}\n\treturn 0;\n} ",ACCEPTED,8,348
1590914398913363968,05fd79145678de5c06012db9db4333bebf8365a74fe442d12a54a9da3782fdca,2022-11-11 11:48:45,C++,300.0,1590681458522583041,1590676393489461248,1049226928954454016,#include<iostream>\n#include<math.h>\nusing namespace std;\nint main(){\n    int all=1;\n    int flag=0;\n    int n;\n    cin>>n;\n    for(int i=3;i<=n;i+=2){\n        flag=0;\n        for(int j=2;j<=sqrt(i);j++){\n            if(i%j==0) {\n                flag=1;\n                break;\n            }\n        }\n        if(flag==0) {\n            all++;\n        };\n    }\n    cout<<all;\n},ACCEPTED,15,324
1590914416273588224,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 11:48:49,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"x=int(input());\ny=int(input());\nz=int(input());\n0<=x<=100;0<=y<=100;0<=z<=100;\nprint ('%d+%d-%d=%d'%(x,y,z,x+y-z));\nreturn 0;",NON_ZERO_EXIT_CODE,16,2876
1590914446648737792,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 11:48:56,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"x=int(input());\ny=int(input());\nz=int(input());\n0<=x<=100;0<=y<=100;0<=z<=100;\nprint ('%d+%d-%d=%d'%(x,y,z,x+y-z));\nreturn 1;",NON_ZERO_EXIT_CODE,17,2812
1590914479829880832,1773d9c971942817d949c47973c4eb8c24531f728d5480dbf3b232e568926258,2022-11-11 11:49:04,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"\nimport java.util.*;\nimport java.lang.Math;\nclass Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int t = sc.nextInt();\n        for (int i = 0; i < t; i++) {\n            int n = sc.nextInt();\n            System.out.println(((int) Math.pow(6, n)) % 10);\n        }\n    }\n}",WRONG_ANSWER,253,16816
1590914483059494912,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 11:49:05,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"x=int(input());\ny=int(input());\nz=int(input());\nprint ('%d+%d-%d=%d'%(x,y,z,x+y-z));\nreturn 1;",NON_ZERO_EXIT_CODE,18,2748
1590914486863724544,9ca3f63f61fa4f349009d69e7059514c3a39dbdd5a1f94342c11f4c33ccdceaa,2022-11-11 11:49:06,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"x = int(input())\ny = input().split(\"" \"")\nfor i in range(x):\n    #a,b,c = [int(x) for x in input().split(\"" \"")]\n    a = int(y[i])\n    b = (6**a)%10\n    print(b)\n",TIME_LIMIT_EXCEEDED,37,3392
1590914498490335232,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 11:49:08,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"x=int(input());\ny=int(input());\nz=int(input());\nprint ('%d+%d-%d=%d'%(x,y,z,x+y-z));\nreturn 0;",NON_ZERO_EXIT_CODE,18,2756
1590914514793594880,9ca3f63f61fa4f349009d69e7059514c3a39dbdd5a1f94342c11f4c33ccdceaa,2022-11-11 11:49:12,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"x = int(input())\ny = input().split(\"" \"")\nfor i in range(x):\n    #a,b,c = [int(x) for x in input().split(\"" \"")]\n    a = int(y[i])\n    b = (6**a)%10\n    print(b)\n",TIME_LIMIT_EXCEEDED,35,3220
1590914551590203392,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 11:49:21,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a;\n    scanf(\""%d\"",&a);\n    int i,d,b,c;\n    scanf(\""%d %d %d\"",&d,&b,&c);\n    for(i=0;i<a;i++){\n        printf(\""6\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,11,444
1590914558133317632,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 11:49:23,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"x=int(input());\ny=int(input());\nz=int(input());\nprint (\""%d+%d-%d=%d\""%(x,y,z,x+y-z));\nreturn 0;",NON_ZERO_EXIT_CODE,22,2820
1590914637015592960,902d8082eea06043d392298983db4630cde4418ac8ee42282d537bfaae045c2f,2022-11-11 11:49:41,Python,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"a,b,c=map(int,input().split(' '))\n\nprint(a+b-c)",ACCEPTED,31,2880
1590914642518540288,33066437ddee11f609c900fe8dbd59cb8113e4d8dfd13c1812f199f4f3fdd334,2022-11-11 11:49:43,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int t,i,n,j,k;\n    scanf(\""%d\"",&t);\n    for(i=1;i<=t;i++)\n    {\n        scanf(\""%d\"",&n);\n        j=pow(6,n);\n        k=j%10;\n        printf(\""%d\"",k);\n        printf(\""\\n\"");\n    }\n}\n",WRONG_ANSWER,7,328
1590914662571487232,1773d9c971942817d949c47973c4eb8c24531f728d5480dbf3b232e568926258,2022-11-11 11:49:47,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.*;\nimport java.lang.Math;\nclass Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int t = sc.nextInt();\n        for (int i = 0; i < t; i++) {\n            int n = sc.nextInt();\n            System.out.println(((int) Math.pow(6, n)) % 10);\n        }\n    }\n}",NON_ZERO_EXIT_CODE,247,16740
1590914688882376704,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 11:49:54,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a;\n    if（scanf(\""%d\"",&a)）{\n    int i,d,b,c;\n    if（scanf(\""%d %d %d\"",&d,&b,&c)）{\n    for(i=0;i<a;i++){\n        printf(\""6\\n\"");\n    }}}\n    return 0;\n}",COMPILE_ERROR,0,0
1590914693013770240,ce1bb8e96385d94dfdb2bd028407e2ffb5a64494440cd7964d6624a83809dae6,2022-11-11 11:49:55,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(){\n    int n;\n    scanf(\""%d\"",&);\n    if(n=0)\n        printf(\""%d\"",1);\n    else\n        printf(\""%d\"",6);\nreturn 0;\n}",COMPILE_ERROR,0,0
1590914703650521088,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-11 11:49:57,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main(){\n    int n;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],i;\n    for(i=0;i<n;i++){\n    \tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=0;i<n;i++){\n    \tscanf(\""%d\"",&b[i]);\n\t}\n\tint c[n];\n\tfor(i=0;i<n;i++){\n\t\tc[i]=-a[i]+b[i];\n\t}\n\tint max=0;\n\tfor(i=0;i<n;i++){\n\t\tif(c[i]>=0) max=max+c[i];\n\t\telse break;\n\t}\n\tprintf(\""%d\"",max);\n}",WRONG_ANSWER,3,324
1590914731114803200,ce1bb8e96385d94dfdb2bd028407e2ffb5a64494440cd7964d6624a83809dae6,2022-11-11 11:50:04,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(){\n    int n;\n    scanf(\""%d\"",&);\n    if(n=0)\n        printf(\""%d\"",1);\n    else\n        printf(\""%d\"",6);\nreturn 0;\n}",COMPILE_ERROR,0,0
1590914765206130688,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 11:50:12,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"x=50;\ny=60;\nz=20;\nprint(\""x+y-z\"")",WRONG_ANSWER,15,3152
1590914793123414016,b95d43d4e550820a57e0a7b63f63233a65cb813e77be0e6c08c1739f86678946,2022-11-11 11:50:19,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n\nbool IsPrime(int m)\n{\n\tint i;\n\n\tfor (i=2; i<m; i++)\n\t{\n\t\tif (0 == m%i)\n\t\t\tbreak;\n\t}\n\tif (i == m)\n\t\treturn ture;\n\telse\n\t\treturn false;\n}\nint main(void)\n{\n    int n,i,num=0;\n    scanf(\""%d\"",&n);\n    if(2<=n && n<=pow(10,5))\n    {\n       for (i=2; i<=num; i++)\n        {\n            if(IsPrime(i))\n                num+=1;\n        }\n        print(\""%d\"",num);\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590914805169455104,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-11 11:50:21,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,sum=0;\n    scanf(\""%d\"",&n);\n    int i=2,j=2;\n    for(i=2;i<n;i++)\n    {\n        for(j=2;j<n;j++)\n        {\n            if(i%j==0)\n                break;\n        }\n        if(i==j)\n            sum++;\n    }\n    printf(\""%d\"",sum);\n}",TIME_LIMIT_EXCEEDED,400,188
1590914812287188992,ce1bb8e96385d94dfdb2bd028407e2ffb5a64494440cd7964d6624a83809dae6,2022-11-11 11:50:23,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(){\n    int n;\n    scanf(\""%d\"",&);\n    if(n=0)\n        printf(\""%d\"",1);\n    else\n        printf(\""%d\"",6);\nreturn 0;\n}",COMPILE_ERROR,0,0
1590914828061970432,ce1bb8e96385d94dfdb2bd028407e2ffb5a64494440cd7964d6624a83809dae6,2022-11-11 11:50:27,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(){\n    int n;\n    scanf(\""%d\"",&);\n    if(n=0)\n        printf(\""%d\"",1);\n    else\n        printf(\""%d\"",6);\nreturn 0;\n}",COMPILE_ERROR,0,0
1590914838124101632,ce1bb8e96385d94dfdb2bd028407e2ffb5a64494440cd7964d6624a83809dae6,2022-11-11 11:50:29,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(){\n    int n;\n    scanf(\""%d\"",&);\n    if(n=0)\n        printf(\""%d\"",1);\n    else\n        printf(\""%d\"",6);\nreturn 0;\n}",COMPILE_ERROR,0,0
1590914846214893568,23d287b80d4d430308a1b57ee92bb4f2d1b25d1142a13c1c0fda4316c9bb9f17,2022-11-11 11:50:31,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"def main():\n     X,Y,Z= int(input(\""\"")), int(input(\""\"")), int(input(\""\""))\n     if(X in range(0,101) and Y in range(0,101) and Z in range(0,101)):\n         print(X+Y-Z)\nmain()",NON_ZERO_EXIT_CODE,16,2752
1590914846349111296,c5cc6f9845df4bd1986af86c0696296436bbc0f00a10a9f891b4100e57bc3a19,2022-11-11 11:50:31,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <bits/stdc++.h>\nusing namespace std;\n#define N 1000\nint main()\n{\n\tint n;\n\tint a[N],b[N];\n\tint sum1=0,sum2=0;\n\tcin>>n;\n\tfor(int i=0;i<n;i++) cin>>a[i];\n\tfor(int i=0;i<n;i++) {\n\t\tcin>>b[i];\n\t\ta[i]=b[i]-a[i];\n\t}\n\tfor(int i=0;i<n;i++){\n\t\tif(a[i]>=0) sum1+=a[i];\n\t\telse{\n\t\t\tif(sum1>sum2) sum2=sum1;\n\t\t\tsum1=0;\n\t\t\tcontinue;\n\t\t}\n\t\tif(sum1>sum2) sum2=sum1;\n\t}\n\tcout<<sum2;\n}",WRONG_ANSWER,4,384
1590914847246716928,ce1bb8e96385d94dfdb2bd028407e2ffb5a64494440cd7964d6624a83809dae6,2022-11-11 11:50:32,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(){\n    int n;\n    scanf(\""%d\"",&);\n    if(n=0)\n        printf(\""%d\"",1);\n    else\n        printf(\""%d\"",6);\nreturn 0;\n}",COMPILE_ERROR,0,0
1590914867882688512,ce1bb8e96385d94dfdb2bd028407e2ffb5a64494440cd7964d6624a83809dae6,2022-11-11 11:50:36,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(){\n    int n;\n    scanf(\""%d\"",&);\n    if(n=0)\n        printf(\""%d\"",1);\n    else\n        printf(\""%d\"",6);\nreturn 0;\n}",COMPILE_ERROR,0,0
1590914885091921920,7dd0c628805d8a6777ff5cc70a5ec79db9475f660782b2f4289ae98977303581,2022-11-11 11:50:41,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,x=input()\ny=input()\nz=input()\nx=float(x)\ny=float(y)\nz=float(z)\nj=float(x)+float(y)-float(z)\n0>=j<=100\nprint(j),NON_ZERO_EXIT_CODE,16,2756
1590914910362603520,ce1bb8e96385d94dfdb2bd028407e2ffb5a64494440cd7964d6624a83809dae6,2022-11-11 11:50:47,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(){\n    int n;\n    scanf(\""%d\"",&);\n    if(n=0)\n        printf(\""%d\"",1);\n    else\n        printf(\""%d\"",6);\nreturn 0;\n}",COMPILE_ERROR,0,0
1590914914120675328,5d127211f3edce9d9bd1062c03cd08473e4481ec46b4b0c70c2e8d9141c68f20,2022-11-11 11:50:47,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int i,n,t,y;\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&n);\n        y=pow(6,t);\n        printf(\""%d\\n\"",y%10);\n    }\n}",WRONG_ANSWER,9,344
1590914932290424832,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-11 11:50:52,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,sum=0;\n    cin>>n;\n    int i=2,j=2;\n    for(i=2;i<n;i++)\n    {\n        for(j=2;j<n;j++)\n        {\n            if(i%j==0)\n                break;\n        }\n        if(i==j)\n            sum++;\n    }\n    printf(\""%d\"",sum);\n}",COMPILE_ERROR,0,0
1590914937319391232,ce1bb8e96385d94dfdb2bd028407e2ffb5a64494440cd7964d6624a83809dae6,2022-11-11 11:50:53,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(){\n    int n;\n    scanf(\""%d\"",&);\n    if(n=0)\n        printf(\""%d\"",1);\n    else\n        printf(\""%d\"",6);\nreturn 0;\n}",COMPILE_ERROR,0,0
1590914963105972224,ce1bb8e96385d94dfdb2bd028407e2ffb5a64494440cd7964d6624a83809dae6,2022-11-11 11:50:59,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(){\n    int n;\n    scanf(\""%d\"",&);\n    if(n=0)\n        printf(\""%d\"",1);\n    else\n        printf(\""%d\"",6);\nreturn 0;\n}",COMPILE_ERROR,0,0
1590914968889921536,1773d9c971942817d949c47973c4eb8c24531f728d5480dbf3b232e568926258,2022-11-11 11:51:01,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.*;\nimport java.lang.Math;\nclass Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int t = sc.nextInt();\n        for (int i = 0; i < t; i++) {\n            int n = sc.nextInt();\n            System.out.println(((int) Math.pow(6, n)) % 10);\n        }\n    }\n}",WRONG_ANSWER,227,16848
1590914969590366208,e7e6ce2c6e9e530eaf2b9b9968748a0e44e3ac7183d73deb51851946350bfbb0,2022-11-11 11:51:01,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int n;\n    int j,i;\n    int flag=0;\n\n    scanf(\""%d\"",&n);\n    for(j=2;j<n;j++) {\n\n       for(i=2;i<=sqrt(j);i++) {\n        if(j%i!=0   )\n           flag++;\n    }\n\n}\n    printf(\""%d\\n\"",flag);\n    return 0;\n}",WRONG_ANSWER,64,512
1590914970114654208,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 11:51:01,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"x=50;\ny=60;\nz=20;\nprint(\""%d+%d-%d=%d\""%(x,y,z,x+y-z))",WRONG_ANSWER,17,2756
1590914988515065856,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 11:51:05,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\n\ndate=map(int,input().split())\ndef pow(a,s):\n    date=a\n    for _ in range(s):\n        date=date*a\n    return date\nfor i in range(a):\n    sum=pow(6,i)\n    print(sum%10)",WRONG_ANSWER,49,2904
1590915007330713600,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 11:51:10,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a;\n    if(scanf(\""%d\"",&a)){\n    int i,d,b,c;\n    if(scanf(\""%d %d %d\"",&d,&b,&c)){\n        for(i=0;i<a;i++){\n            printf(\""6\\n\"");\n        }}}\n    return 0;\n}",WRONG_ANSWER,10,324
1590915010468052992,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-11 11:51:10,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,sum=0;\n    getline(n);\n    int i=2,j=2;\n    for(i=2;i<n;i++)\n    {\n        for(j=2;j<n;j++)\n        {\n            if(i%j==0)\n                break;\n        }\n        if(i==j)\n            sum++;\n    }\n    printf(\""%d\"",sum);\n}",WRONG_ANSWER,4,184
1590915033431871488,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 11:51:16,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"x=50;\ny=60;\nz=20;\nprint(\""%d+%d-%d=%d\""%(x,y,z,x+y-z));",WRONG_ANSWER,14,2748
1590915041522679808,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-11 11:51:18,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio,h>\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",COMPILE_ERROR,0,0
1590915042231517184,d54b7e24c90cf40d468bdeb018e61440010a1049a4ae96e2c6331c215521f91c,2022-11-11 11:51:18,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"\n\nint main()\n{\n\tprintf(\""2022\"");\n}",ACCEPTED,3,356
1590915054193672192,d8701a6da26af0d0579eec24b939fdbf381dd9449c34251ff0d8938314216606,2022-11-11 11:51:21,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n\tprintf(\""请输入一个整数：\"");\n\tint num, b,a=10;\t\t\n\tscanf(\""%d\"",&num)\n\t\n\tfor(int i=2; i<= num ;i++)  \n\t{\n\t\tfor(int j=2; j<=i-1;j++)\t\n\t\t{\n\t\t\ta = i%j;\t\t\t\n\t\t\tif(b>a)\t\t\n\t\t\t{\n\t\t\t\t b= a;\n\t\t\t}\n\t\t}\n\t\tif(b>a)\n\t\t\n\t\t b= 10;\t\t\t\t\t\t\n\t}\n\treturn 0;\n}\n\n\n",COMPILE_ERROR,0,0
1590915109705285632,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-11 11:51:34,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,3,196
1590915140969631744,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 11:51:42,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"int x,y,z;\nprint(\""%d+%d-%d=%d\""%(x,y,z,x+y-z));",NON_ZERO_EXIT_CODE,15,2760
1590915153967775744,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 11:51:45,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a;\n    if(scanf(\""%d\"",&a)){\n    long int i,d,b,c;\n    if(scanf(\""%ld %ld %ld\"",&d,&b,&c)){\n        for(i=0;i<a;i++){\n            printf(\""6\\n\"");\n        }}}\n    return 0;\n}",WRONG_ANSWER,9,328
1590915161974702080,5a1c17b308a3b3595833d34c6bdfb75e9f5dd0d065acfeb7f28ab8102ba7406c,2022-11-11 11:51:47,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint n,i,j;\n\tint cnt = 0;\n\tscanf(\""%d\"",&n);\n\tfor(i=2;i<=n;i++)\n    {\n\t\tfor(j=2;j<i;j++){\n\t\t\tif(i%j==0)\n\t\t\t\tbreak;\n            }\n\t\tif(i==j){\n\t\t\tcnt++;\n\t\t}\n    }\n    printf(\""%d\"",cnt);\n\t\treturn 0;\n}\n",TIME_LIMIT_EXCEEDED,400,192
1590915183537598464,d8701a6da26af0d0579eec24b939fdbf381dd9449c34251ff0d8938314216606,2022-11-11 11:51:52,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int X,Y,Z,C=0;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    C=(X+Y-Z);\n    printf(\""%d\"",C);\n    return 0;\n    }",ACCEPTED,6,312
1590915210855120896,fec6d07e317796c63fb7ae6e7538f75973ad64af6e6196cc27eed3e9e685bf86,2022-11-11 11:51:58,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nmain()\n    {\n   \n   \n   \n    \n       \n        \n    \n\n      \n           \n\n    printf(\""168\\n\"");\n}",WRONG_ANSWER,4,196
1590915222280384512,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 11:52:01,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"int x,y,z;\nx=50;\ny=60;\nz=20;\nprint(\""%d+%d-%d=%d\""%(x,y,z,x+y-z));",NON_ZERO_EXIT_CODE,16,2776
1590915251682455552,e7e6ce2c6e9e530eaf2b9b9968748a0e44e3ac7183d73deb51851946350bfbb0,2022-11-11 11:52:08,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int n;\n    int j,i;\n    int flag=0;\n    int count；\n    \n    scanf(\""%d\"",&n);\n    for(j=2;j<n;j++) {\n\n       for(i=2;i<=sqrt(j);i++) {\n        if(j%i!=0   )\n           flag++;\n           break；\n    }\n\n}\n    printf(\""%d\\n\"",flag);\n    return 0;\n}",COMPILE_ERROR,0,0
1590915255901925376,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 11:52:09,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"x=50;\ny=60;\nz=20;\nprint(\""%d+%d-%d=%d\""%(x,y,z,x+y-z));",WRONG_ANSWER,15,2756
1590915283332673536,3e087b0a196d30fcbb49ca80164c9eb5adf82ae3bb08ec0c141e5728fb180f0d,2022-11-11 11:52:15,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\n\t\tpublic static void main(String[] args) throws IOException {\n\t\t\t// TODO Auto-generated method stub\n            Scanner sc=new Scanner(System.in);\n                int cnt=0,ct=0,num=0;\n                cnt=sc.nextInt();\n                while(sc.hasNext()&&ct<cnt) {\n                    num=sc.nextInt();\n                    if(num==0) {\n                        System.out.println(1);\n                    }else {\n                        System.out.println(6);\n                    }\n                    ct++;\n                }\n                num=sc.nextInt();\n                if(num==0) {\n                    System.out.print(1);\n                }else {\n                    System.out.print(6);\n                }\n                sc.close();\n\t\t}\n}",COMPILE_ERROR,0,0
1590915297920487424,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-11 11:52:19,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,sum=0;\n   getchar(n);\n    int i=2,j=2;\n    for(i=2;i<n;i++)\n    {\n        for(j=2;j<n;j++)\n        {\n            if(i%j==0)\n                break;\n        }\n        if(i==j)\n            sum++;\n    }\n    printf(\""%d\"",sum);\n}",COMPILE_ERROR,0,0
1590915299875033088,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 11:52:19,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"x=50;\ny=40;\nz=20;\nprint(\""%d+%d-%d=%d\""%(x,y,z,x+y-z));",WRONG_ANSWER,17,3012
1590915385937952768,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 11:52:40,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"x=50;\ny=40;\nz=20;\nprint(\""%d+%d-%d=%d\"");",WRONG_ANSWER,17,2872
1590915389410840576,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-11 11:52:41,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int sum=0;\n    char n;\n   getchar(n);\n    int i=2,j=2;\n    for(i=2;i<n;i++)\n    {\n        for(j=2;j<n;j++)\n        {\n            if(i%j==0)\n                break;\n        }\n        if(i==j)\n            sum++;\n    }\n    printf(\""%d\"",sum);\n}",COMPILE_ERROR,0,0
1590915428795351040,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 11:52:50,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"def su(a):\n    for i in (2,a/2):\n        if a==2:\n            return 1\n        elif a%i==0:\n            break\n            return 0\n        else:\n            return 1\ndata = int(input())\ns = 0\nfor i in (2,data+1):\n    if su(i)==1:\n        s=s+1\nprint(s)",WRONG_ANSWER,15,2884
1590915448516972544,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 11:52:55,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,x=50;\ny=40;\nz=20;\nprint(x+y-z);,WRONG_ANSWER,15,2760
1590915475750588416,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-11 11:53:01,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int sum=0;\n    char n;\n   gets(n);\n    int i=2,j=2;\n    for(i=2;i<n;i++)\n    {\n        for(j=2;j<n;j++)\n        {\n            if(i%j==0)\n                break;\n        }\n        if(i==j)\n            sum++;\n    }\n    printf(\""%d\"",sum);\n}",SEGMENTATION_FAULT,4,436
1590915494205526016,23d287b80d4d430308a1b57ee92bb4f2d1b25d1142a13c1c0fda4316c9bb9f17,2022-11-11 11:53:06,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"def main():\n     X,Y,Z= int(input(\""\"")), int(input(\""\"")), int(input(\""\""));\n     if(X in range(0,101) and Y in range(0,101) and Z in range(0,101)):\n         print(X+Y-Z)\n         return 1\nmain()",NON_ZERO_EXIT_CODE,16,2756
1590915524819750912,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 11:53:13,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,x=50;\ny=40;\nz=20;\nprint(int(x+y-z));,WRONG_ANSWER,18,2776
1590915529487986688,b95d43d4e550820a57e0a7b63f63233a65cb813e77be0e6c08c1739f86678946,2022-11-11 11:53:14,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <iostream>\nusing namespace std;\ntypedef long long ll;\n\nint n, t, x;\nint main()\n{\n    cin >> t;\n    while (t--)\n    {\n        cin >> x;\n        if (x == 0)\n        {\n            cout << \""1\"" << endl;\n        }\n        else\n        {\n            cout << \""6\"" << endl;\n        }\n    }\n}\n\n\n",COMPILE_ERROR,0,0
1590915542918148096,6de81974dc8c65943a7aa7eec331767cc67f98683db11d3405a39c1495f3fcdf,2022-11-11 11:53:17,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <iostream>\nusing namespace std;\ntypedef long long ll;\n\nint n, t, x;\nint main()\n{\n    cin >> t;\n    while (t--)\n    {\n        cin >> x;\n        if (x == 0)\n        {\n            cout << \""1\"" << endl;\n        }\n        else\n        {\n            cout << \""6\"" << endl;\n        }\n    }\n}",COMPILE_ERROR,0,0
1590915545518641152,3e087b0a196d30fcbb49ca80164c9eb5adf82ae3bb08ec0c141e5728fb180f0d,2022-11-11 11:53:18,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"package unnamed;\n\nimport java.io.IOException;\nimport java.util.Scanner;\n\npublic class Main {\n\n\t\tpublic static void main(String[] args) throws IOException {\n\t\t\tScanner sc=new Scanner(System.in);\n\t\t\tint cnt=0,ct=0,num=0;\n\t\t\tcnt=sc.nextInt();\n\t\t\twhile(sc.hasNext()&&ct<cnt) {\n\t\t\t\tnum=sc.nextInt();\n\t\t\t\tif(num==0) {\n\t\t\t\t\tSystem.out.println(1);\n\t\t\t\t}else {\n\t\t\t\t\tSystem.out.println(6);\n\t\t\t\t}\n\t\t\t\tct++;\n\t\t\t}\n\t\t\tnum=sc.nextInt();\n\t\t\tif(num==0) {\n\t\t\t\tSystem.out.print(1);\n\t\t\t}else {\n\t\t\t\tSystem.out.print(6);\n\t\t\t}\n\t\t\tsc.close();\n\t\t}\n}\n",NON_ZERO_EXIT_CODE,92,15028
1590915549599674368,910d600982c42b3bf326994e410e7a344f2438b451c8f7deb6f6a9f965d3ee41,2022-11-11 11:53:19,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int a,i,n,g;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++)\n    {\n        scanf(\""%d\"",&n);\n        g=pow(6,n);\n        printf(\""%d\\n\"",g%10);\n    }\n}",WRONG_ANSWER,6,312
1590915553940803584,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 11:53:20,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,x=50;\ny=40;\nz=20;\nprint(int('x+y-z'));,NON_ZERO_EXIT_CODE,16,2876
1590915590435418112,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 11:53:29,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"x=50;\ny=40;\nz=20;\nprint(int(\""x+y-z\""));",NON_ZERO_EXIT_CODE,17,3132
1590915618570809344,b69ff333cc0daa10fb20c3ba26e439f64260003a8ff6fde3dbc623fd631ba825,2022-11-11 11:53:35,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <iostream>\n\nusing namespace std;\n\ntypedef long long ll;\n\nint n, t, x;\n\nint main()\n\n{\n\n    cin >> t;\n\n    while (t--)\n\n    {\n\n        cin >> x;\n\n        if (x == 0)\n\n        {\n\n            cout << \""1\"" << endl;\n\n        }\n\n        else\n\n        {\n\n            cout << \""6\"" << endl;\n\n        }\n\n    }\n\n}",COMPILE_ERROR,0,0
1590915626447736832,b95d43d4e550820a57e0a7b63f63233a65cb813e77be0e6c08c1739f86678946,2022-11-11 11:53:37,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <iostream>\nusing namespace std;\ntypedef long long ll;\n\nint n, t, x;\nint main()\n{\n    cin >> t;\n    while (t--)\n    {\n        cin >> x;\n        if (x == 0)\n        {\n            cout << \""1\"" << endl;\n        }\n        else\n        {\n            cout << \""6\"" << endl;\n        }\n    }\n    return 0;\n}\n\n\n",COMPILE_ERROR,0,0
1590915636593758208,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 11:53:40,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,x=50;\ny=40;\nz=20;\nprint(int(x+y-z));,WRONG_ANSWER,17,2952
1590915674573156352,b95d43d4e550820a57e0a7b63f63233a65cb813e77be0e6c08c1739f86678946,2022-11-11 11:53:49,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <iostream>\nusing namespace std;\ntypedef long long ll;\n\nint n, t, x;\nint main()\n{\n    cin >> t;\n    while (t--)\n    {\n        cin >> x;\n        if (x == 0)\n        {\n            cout << \""1\"" << endl;\n        }\n        else\n        {\n            cout << \""6\"" << endl;\n        }\n    }\n}\n\n\n",ACCEPTED,15,632
1590915683444109312,ce1bb8e96385d94dfdb2bd028407e2ffb5a64494440cd7964d6624a83809dae6,2022-11-11 11:53:51,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <iostream>\n\nusing namespace std;\n\ntypedef long long ll;\n\nint n, t, x;\n\nint main()\n\n{\n\n    cin >> t;\n\n    while (t--)\n\n    {\n\n        cin >> x;\n\n        if (x == 0)\n\n        {\n\n            cout << \""1\"" << endl;\n\n        }\n\n        else\n\n        {\n\n            cout << \""6\"" << endl;\n\n        }\n\n    }\n\n}",COMPILE_ERROR,0,0
1590915697218224128,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 11:53:54,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,print(int(x+y-z));,NON_ZERO_EXIT_CODE,18,2908
1590915710770020352,ce1bb8e96385d94dfdb2bd028407e2ffb5a64494440cd7964d6624a83809dae6,2022-11-11 11:53:57,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <iostream>\n\nusing namespace std;\n\ntypedef long long ll;\n\nint n, t, x;\n\nint main()\n\n{\n\n    cin >> t;\n\n    while (t--)\n\n    {\n\n        cin >> x;\n\n        if (x == 0)\n\n        {\n\n            cout << \""1\"" << endl;\n\n        }\n\n        else\n\n        {\n\n            cout << \""6\"" << endl;\n\n        }\n\n    }\n\n}",ACCEPTED,13,476
1590915718089080832,33066437ddee11f609c900fe8dbd59cb8113e4d8dfd13c1812f199f4f3fdd334,2022-11-11 11:53:59,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n#define p 100\nint main()\n{\n    int t,i,n,j,k[p];\n    scanf(\""%d\"",&t);\n    for(i=1;i<=t;i++)\n    {\n        scanf(\""%d\"",&n);\n    }\n    for(i=1;i<=t;i++)\n     {\n        j=pow(6,n);\n        k[i]=j%10;\n        printf(\""%d\"",k[i]);\n        printf(\""\\n\"") ;\n     }\n     return 0;\n}",WRONG_ANSWER,8,564
1590915718374293504,6de81974dc8c65943a7aa7eec331767cc67f98683db11d3405a39c1495f3fcdf,2022-11-11 11:53:59,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <iostream>\nusing namespace std;\ntypedef long long ll;\n\nint n, t, x;\nint main()\n{\n    cin >> t;\n    while (t--)\n    {\n        cin >> x;\n        if (x == 0)\n        {\n            cout << \""1\"" << endl;\n        }\n        else\n        {\n            cout << \""6\"" << endl;\n        }\n    }\n}",ACCEPTED,12,456
1590915724233715712,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 11:54:01,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,print(x+y-z);,NON_ZERO_EXIT_CODE,16,2876
1590915728801312768,b69ff333cc0daa10fb20c3ba26e439f64260003a8ff6fde3dbc623fd631ba825,2022-11-11 11:54:02,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <iostream>\n\nusing namespace std;\n\ntypedef long long ll;\n\nint n, t, x;\n\nint main()\n\n{\n\n    cin >> t;\n\n    while (t--)\n\n    {\n\n        cin >> x;\n\n        if (x == 0)\n\n        {\n\n            cout << \""1\"" << endl;\n\n        }\n\n        else\n\n        {\n\n            cout << \""6\"" << endl;\n\n        }\n\n    }\n\n}",ACCEPTED,10,496
1590915751492517888,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 11:54:07,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"print(\""x+y-z\"");",WRONG_ANSWER,15,2880
1590915751563821056,d54b7e24c90cf40d468bdeb018e61440010a1049a4ae96e2c6331c215521f91c,2022-11-11 11:54:07,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"int main()\n{\n\tint X,Y,Z;\n\tscanf(\""%d%d%d\"",&X,&Y,&Z);\n\t\n\tprintf(\""%d\"",X+Y-Z);\n\t\n}",ACCEPTED,7,364
1590915788024909824,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-11 11:54:16,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main(){\n    int n;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],i;\n    for(i=0;i<n;i++){\n    \tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=0;i<n;i++){\n    \tscanf(\""%d\"",&b[i]);\n\t}\n\tint c[n];\n\tfor(i=0;i<n;i++){\n\t\tc[i]=-a[i]+b[i];\n\t}\n\tint max=0;\n\tfor(i=0;i<n;i++){\n\t\tif(c[i]>=0) max=max+c[i];\n\t}\n\tprintf(\""%d\"",max);\n}",WRONG_ANSWER,4,308
1590915793192288256,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-11 11:54:17,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int sum=0;\n    int n;\n    scanf(\""%d\"",&n);\n    int i=2,j=2;\n    for(i=2;i<n;i++)\n    {\n        for(j=2;j<n;j++)\n        {\n            if(i%j==0)\n                break;\n        }\n        if(i==j)\n            sum++;\n    }\n    printf(\""%d\"",sum);\n}",TIME_LIMIT_EXCEEDED,400,312
1590915833264648192,667c2e97e82c372f60661d46943ff56a17c9350387f4364ebabe70ac2e232862,2022-11-11 11:54:27,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int x,y,z;\n    int s;\n    printf(\""输入三个整数X,Y,Z：\\n\"");\n\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    s=x+y-z;\n    printf(\""%d\\n\"",s);\n    return 0;\n}",WRONG_ANSWER,3,344
1590915852038373376,7dd0c628805d8a6777ff5cc70a5ec79db9475f660782b2f4289ae98977303581,2022-11-11 11:54:31,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,x=eval(input())\ny=eval(input())\nz=eval(input())\nj=str(x+y-z)\n0>=j<=100\nprint(j),NON_ZERO_EXIT_CODE,16,2880
1590915894870605824,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 11:54:41,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"print(%d+%d-%d=%d%(x,y,z,x+y-z));",NON_ZERO_EXIT_CODE,17,3252
1590915941850984448,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 11:54:52,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"print(%d+%d-%d=%d % (x,y,z,x+y-z));",NON_ZERO_EXIT_CODE,16,2876
1590915979239034880,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-11 11:55:01,Java,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"import java.util.Scanner;\n\npublic class test2 {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int num = sc.nextInt();\n        int[] deBuff = new int[num];\n        int[] buff = new int[num];\n        int temp = 0,max = 0;\n        for (int i = 0;i < num;i++) {\n            deBuff[i] = sc.nextInt();\n        }\n        for (int i = 0;i < num;i++) {\n            buff[i] = sc.nextInt();\n        }\n        for (int i = 0;i < num;i++) {\n            temp -= deBuff[i];\n            temp += buff[i];\n            if (temp > max) {\n                max = temp;\n            }\n        }\n        System.out.println(max);\n    }\n}\n",COMPILE_ERROR,0,0
1590916015725260800,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 11:55:10,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main(void)\n{\n    int n,i,j,k;\n    int a[10];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=0;j<n;j++)\n    {\n        k=6^a[j];\n        k=k/(6^(a[j]-1));\n        printf(\""%d\\n\"",k);\n    }\n}",WRONG_ANSWER,3,196
1590916042271031296,5d127211f3edce9d9bd1062c03cd08473e4481ec46b4b0c70c2e8d9141c68f20,2022-11-11 11:55:16,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int i,n,t,y;\n    scanf(\""%d\\n\"",&t);\n    y=pow(6,t);\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&n);\n        printf(\""%d\\n\"",y%10);\n    }\n}",WRONG_ANSWER,9,456
1590916054900060160,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-11 11:55:19,Java,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int num = sc.nextInt();\n        int[] deBuff = new int[num];\n        int[] buff = new int[num];\n        int temp = 0,max = 0;\n        for (int i = 0;i < num;i++) {\n            deBuff[i] = sc.nextInt();\n        }\n        for (int i = 0;i < num;i++) {\n            buff[i] = sc.nextInt();\n        }\n        for (int i = 0;i < num;i++) {\n            temp -= deBuff[i];\n            temp += buff[i];\n            if (temp > max) {\n                max = temp;\n            }\n        }\n        System.out.println(max);\n    }\n}\n",WRONG_ANSWER,120,17000
1590916055248207872,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 11:55:20,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"print(\""%d+%d-%d=%d\""% (x,y,z,x+y-z));",NON_ZERO_EXIT_CODE,16,3032
1590916111946809344,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 11:55:33,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"print(\""%d+%d-%d=%d\""% (x,y,z,x+y-z))",NON_ZERO_EXIT_CODE,17,2776
1590916115310620672,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-11 11:55:34,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int X,Y,Z;\n    int sum;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    sum=X+Y-Z;\n    printf(\""%d\"",sum);\n    return 0;\n    \n}",ACCEPTED,6,324
1590916155324301312,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 11:55:43,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"print(\""%d+%d-%d=%d\""% (\""x,y,z,x+y-z\""))",NON_ZERO_EXIT_CODE,15,2884
1590916185095450624,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 11:55:50,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a;\n    if(scanf(\""%d\"",&a)){\n    int i,d,b,c;\n    if(scanf(\""%d %d %d\"",&d,&b,&c)){\n        for(i=0;i<a;i++){\n            printf(\""6\"");\n            if(i<a-1){\n                printf(\""\\n\"");\n            }\n        }}}\n    return 0;\n}",WRONG_ANSWER,11,328
1590916195589599232,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 11:55:53,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"print(\""%d+%d-%d=%d\"")",WRONG_ANSWER,16,2744
1590916198563360768,33066437ddee11f609c900fe8dbd59cb8113e4d8dfd13c1812f199f4f3fdd334,2022-11-11 11:55:54,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n#define p 100\nint main()\n{\n    int t,i,n,j,k[p];\n    scanf(\""%d\"",&t);\n    for(i=1;i<=t;i++)\n    {\n        scanf(\""%d\"",&n);\n        j=pow(6,n);\n    }\n    for(i=1;i<=t;i++)\n     {\n        k[i]=j%10;\n        printf(\""%d\"",k[i]);\n        printf(\""\\n\"") ;\n     }\n     return 0;\n}",WRONG_ANSWER,7,572
1590916299025350656,54914c90623988219ee55c4a0b2e645efd9808505aa25f0099930bfa8bf18ad1,2022-11-11 11:56:18,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nvoid fn(int k)\n{\n    int i=0,j=0,s,n;\n    int count = 0;\n\n    for (n = 1; n <= k; n++)\n    {\n\n        for ( j = 2; j <= sqrt(n); j++){\n            if (n % j == 0)\n                break;\n        }\n        if(j>sqrt(n)&&n!=1)\n           count++;\n        }\n        printf(\""%d \"", count);\n}\nint main()\n{\n    int k = 0;\n    scanf(\""%d\"", &k);\n    fn(k);\n    return 0;\n}\n",ACCEPTED,13,324
1590916299096633344,9aa17e95021225dcdd2b01419b021cd002e47f9a7854274df042f64621bd207a,2022-11-11 11:56:18,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n    int n,a;\n    scanf(\""%d\"",&n);\n    while(n--)\n    {\n        scanf(\""%d\"",&a);\n        int t = a%4;\n        if(a%4==0) t=4;\n        a%=10;\n        printf(\""%d\\n\"",(int)pow(a,t)%10);\n    }\n    return 0;\n}\n",WRONG_ANSWER,5,608
1590916355333881856,7dd0c628805d8a6777ff5cc70a5ec79db9475f660782b2f4289ae98977303581,2022-11-11 11:56:31,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"x=eval(input())\ny=eval(input())\nz=eval(input())\nprint(j=str(x+y-z),=0<j<=100)",NON_ZERO_EXIT_CODE,15,2884
1590916372706689024,fec6d07e317796c63fb7ae6e7538f75973ad64af6e6196cc27eed3e9e685bf86,2022-11-11 11:56:35,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nmain()\n    {\n    int x,i,t=1,n;\n    scanf(\""%d\"",&n);\n    for(x=3;x<=n;x+=2)\n    {\n        for(i=2;i<=x/2;i++)\n           if(x%i==0)\n           break;\n\n        if(x/2<i)\n            t++;\n    }\n    printf(\""%d\\n\"",t);\n}\n\n\n\n\n\n\n\n\n\n\n\n\n\n",TIME_LIMIT_EXCEEDED,400,344
1590916393938235392,423e1acd0d02cf3d43f3c7805099dea4edcb39c2e0fa385e82823b5a7c0dd214,2022-11-11 11:56:40,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"int main(){\n    int X,Y,Z;\n    scanf(\""%d\"",&X);\n    scanf(\""%d\"",&Y);\n    scanf(\""%d\"",&Z);\n    printf(\""%d\"",X+Y-Z);\n}",ACCEPTED,9,312
1590916419515121664,7dd0c628805d8a6777ff5cc70a5ec79db9475f660782b2f4289ae98977303581,2022-11-11 11:56:46,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"x=eval(input())\ny=eval(input())\nz=eval(input())\nprint(j=str(x+y-z),=0<j<=100)\nreturn 0",NON_ZERO_EXIT_CODE,15,2744
1590916572322004992,2bc6a85c0376656012a7970a7842a2a9d8769555a79ef4eec85ff45aa30ff7b7,2022-11-11 11:57:23,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n\nint main() {\n\tint num;\n\tscanf(\""%d\"", &num);\n\tint count = 0;\n\tfor(int i = 2; i <= num; ++i) {\n\t\tint j;\n\t\tfor(j=2; j < i; j++) {\n\t\t\tif(i %j == 0) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (j == i) {\n\t\t\tcount ++;\n\t\t}\n\t}\n\tprintf(\""%d\"", count);\n\treturn 0;\n} ",TIME_LIMIT_EXCEEDED,400,188
1590916587773820928,d8701a6da26af0d0579eec24b939fdbf381dd9449c34251ff0d8938314216606,2022-11-11 11:57:26,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,#include<stdio.h>\n＃include<time.h>\nint main(){\n    ,COMPILE_ERROR,0,0
1590916762898575360,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 11:58:08,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t,i,ed;\n    double z;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<t;i++)\n    {\n    (int)z=pow(6,a[i]);\n    ed=z%10;\n    printf(\""%d\\n\"",ed);}\n    return 0;\n}",COMPILE_ERROR,0,0
1590916765155110912,70c675ddfcb60b2192bc8ac38fb068fec0500208a5bf97a796c7cc074b43cf87,2022-11-11 11:58:09,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner myScanner = new Scanner(System.in);\n\t\tint n = myScanner.nextInt();\n\t\tString str = myScanner.next();\n\t\tfor(int i = 0;i < n;i++) {\n\t\t\tif(i < n-1) {\n\t\t\tSystem.out.println(\""6\"");\n\t\t\t}else {\n\t\t\t\tSystem.out.printf(\""6\"");\n\t\t\t}\n\t\t}\n\t}\n\n}",WRONG_ANSWER,384,16992
1590916791264673792,910d600982c42b3bf326994e410e7a344f2438b451c8f7deb6f6a9f965d3ee41,2022-11-11 11:58:15,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int a,i,n,g;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;)\n    {\n        scanf(\""%d\"",&n);\n        g=pow(6,n);\n        printf(\""%d\"",g%10);\n        i++;\n        if(i==a)\n            break;\n        printf(\""\\n\"");\n    }\n}",WRONG_ANSWER,6,200
1590916898424926208,ccc42b8437aa15d1214e4623799ed35cd8ea8087c26cb1b596d51ae4556ea39c,2022-11-11 11:58:41,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,a=eval(input())\nb=input()\nfor i in range(a):\n    print(6),WRONG_ANSWER,52,2872
1590916981048545280,5d25e51c02c08da2e0946483619d6f75981ff1037e5bbe3f3e4a71eeb2de4c8a,2022-11-11 11:59:00,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int x,i,a=6,b=6,c=6;\n    scanf(\""%d\"",&x);\n    int m[x];\n    for(i=0;i<x;i++)\n    {\n        scanf(\""%d\"",&m[i]);\n    }\n    for(i=1;i<m[0];i++)\n    {\n        a=a*a;\n    }\n    printf(\""%d\\n\"",a%10);\n     for(i=1;i<m[0];i++)\n    {\n        b=b*b;\n    }\n    printf(\""%d\\n\"",b%10);\n    for(i=1;i<m[0];i++)\n    {\n        c=c*c;\n    }\n    printf(\""%d\"",c%10);\n\n    return 0;\n}\n",WRONG_ANSWER,4,308
1590916982512357376,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-11 11:59:01,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n\nint main()\n\n{\n\n    int n,a[10],i,b[i];\n\n    scanf(\""%d\"",&n);\n\n    for(i=0;i<n;i++)\n\n    scanf(\""%d\"",&a[i]);\n\n    for(i=0;i<n;i++)\n\n    b[i]=pow(6,a[i]);\n\n    printf(\""%d\"",b[i]%10);\n\n    return 0;\n\n}",WRONG_ANSWER,3,312
1590917069732884480,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 11:59:21,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,a=x+y-z;\nprint(a),NON_ZERO_EXIT_CODE,21,3172
1590917098845569024,9ca3f63f61fa4f349009d69e7059514c3a39dbdd5a1f94342c11f4c33ccdceaa,2022-11-11 11:59:28,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,x = int(input())\nb= 0\nfor i in range (x):\n    i = i+1\n    b = 0\n    for j in range (i):\n        j = j+1\n        if (i%j != 0):\n            b = b+1\nprint(b),TIME_LIMIT_EXCEEDED,400,2816
1590917101890637824,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 11:59:29,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,a=x+y-z;\nprint('a'),NON_ZERO_EXIT_CODE,16,2756
1590917126657978368,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-11 11:59:35,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main(){\n    int n;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],i;\n    for(i=0;i<n;i++){\n    \tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=0;i<n;i++){\n    \tscanf(\""%d\"",&b[i]);\n\t}\n\tint c[n];\n\tfor(i=0;i<n;i++){\n\t\tc[i]=-a[i]+b[i];\n\t}\n\tint max=0;\n\tint m[n],j;\n\tfor(i=0;i<n;i++){\n\t\tm[i]=0;\n\t\tfor(j=0;j<i;j++){\n\t\t\tm[i]=m[i]+c[j];\n\t\t}\n\t}\n\tfor(i=0;i<n;i++){\n\t\tif(m[i]>=max) max=m[i];\n\t}\n\tprintf(\""%d\"",max);\n}",WRONG_ANSWER,3,184
1590917152478138368,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 11:59:41,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,a=x+y-z;\nprint(int(a)),NON_ZERO_EXIT_CODE,17,3968
1590917187899031552,5d25e51c02c08da2e0946483619d6f75981ff1037e5bbe3f3e4a71eeb2de4c8a,2022-11-11 11:59:50,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int x,i,a=6,b=6,c=6;\n    scanf(\""%d\"",&x);\n    int m[x];\n    for(i=0;i<x;i++)\n    {\n        scanf(\""%d\"",&m[i]);\n    }\n    for(i=1;i<m[0];i++)\n    {\n        a=a*a;\n    }\n    printf(\""%d\\n\"",a%10);\n     for(i=1;i<m[1];i++)\n    {\n        b=b*b;\n    }\n    printf(\""%d\\n\"",b%10);\n    for(i=1;i<m[2];i++)\n    {\n        c=c*c;\n    }\n    printf(\""%d\"",c%10);\n\n    return 0;\n}\n",WRONG_ANSWER,4,192
1590917228059492352,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 11:59:59,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"a=x+y-z;\nprint(%d,a)",NON_ZERO_EXIT_CODE,15,2884
1590917283009073152,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 12:00:12,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"a=x+y-z;\nprint(%d,a);\nreturn 0;",NON_ZERO_EXIT_CODE,17,2936
1590917301300432896,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-11 12:00:17,Java,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int num = sc.nextInt();\n        int[] deBuff = new int[num];\n        int[] buff = new int[num];\n        int temp = 0,max = 0;\n        for (int i = 0;i < num;i++) {\n            deBuff[i] = sc.nextInt();\n        }\n        for (int i = 0;i < num;i++) {\n            buff[i] = sc.nextInt();\n        }\n        for (int i = 0;i < num;i++) {\n            temp -= deBuff[i];\n            temp += buff[i];\n            if (temp < 0) {\n                continue;\n            }\n            if (temp > max) {\n                max = temp;\n            }\n        }\n        System.out.println(max);\n    }\n}\n",WRONG_ANSWER,120,16108
1590917316538339328,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 12:00:20,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdilb.h>\nvoid Cmp(const void e1, const void e2)\n{\n    return *(int*)e1 - *(int*)e2;\n}\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"",&n);\n    int arr1[n] = {0};\n    int arr2[n] = {0};\n    for(int i = 0; i < n; ++i)\n    {\n        scanf(\""%d\"",arr1[i]);\n    }\n    for(int j = 0; j < n; ++j)\n    {\n        scanf(\""%d\"",arr2[j]);\n    }\n    qsort(arr,n,sizeof(arr[0]),Cmp);\n    return 0\n}",COMPILE_ERROR,0,0
1590917419743379456,33066437ddee11f609c900fe8dbd59cb8113e4d8dfd13c1812f199f4f3fdd334,2022-11-11 12:00:45,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n#define p 100\nint main()\n{\n    int t,i,n,j,k[p];\n    scanf(\""%d\"",&t);\n    for(i=1;i<=t;i++)\n    {\n        scanf(\""%d\"",&n);\n        j=pow(6,n);\n    }\n    for(i=1;i<=t;i++)\n     {\n        k[i]=j%10;\n        printf(\""%d\"",k[i]);\n        printf(\""\\n\"") ;\n     }\n     return 0;\n}",WRONG_ANSWER,6,188
1590917498202030080,345826d11b41befc23adeb536e81da8eb6ec9a8bfb9448acf91422deedb8ba4a,2022-11-11 12:01:04,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int t,i,s=0;\n    scanf(\""%d\"",&t);\n    int n[t],j[t];\n    for(i=0;i<t;i++)\n        scanf(\""%d\"",&n[i]);\n    for(i=0;i<t;i++)\n    {\n        s=pow(6,n[i]);\n        j[i]=s%10;\n    }\n     for(i=0;i<t;i++)\n        printf(\""%d\\n\"",j[i]);\n}\n",WRONG_ANSWER,6,456
1590917498961199104,e7e6ce2c6e9e530eaf2b9b9968748a0e44e3ac7183d73deb51851946350bfbb0,2022-11-11 12:01:04,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int n;\n    int j,i,count;\n    int flag=0;\n\n    scanf(\""%d\"",&n);\n    for(j=2;j<n;j++) {\n       count=1;\n       for(i=2;i<=sqrt(j);i++) {\n        if(j%i==0   )\n         {\n             count=0;\n             break;\n         }\n\n    }\n          if(count)\n             flag++;\n\n}\n    printf(\""%d\\n\"",flag);\n    return 0;\n}",ACCEPTED,13,328
1590917525163020288,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-11 12:01:10,Java,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int num = sc.nextInt();\n        int[] deBuff = new int[num];\n        int[] buff = new int[num];\n        int temp = 0,max = 0;\n        for (int i = 0;i < num;i++) {\n            deBuff[i] = sc.nextInt();\n        }\n        for (int i = 0;i < num;i++) {\n            buff[i] = sc.nextInt();\n        }\n        for (int i = 0;i < num;i++) {\n            temp -= deBuff[i];\n            temp += buff[i];\n            if (temp < 0) {\n                continue;\n            }\n            if (temp > max) {\n                max = temp;\n            }\n        }\n        System.out.println(max);\n    }\n}\n",WRONG_ANSWER,135,16096
1590917570683801600,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-11 12:01:21,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        printf(\""6\"");\n        printf(\""\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,12,320
1590917672517283840,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 12:01:45,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,x=input();\ny=input();\nz=input();\nprint(x+y-z),NON_ZERO_EXIT_CODE,18,2872
1590917722001702912,e715137eeb4190ade2330123b989bbdd6eebd9a5e1df2e292271d3bfe3a79c69,2022-11-11 12:01:57,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nvoid main()\n{\n    int x,y,z;\n    printf(\""%d\"",x+y-z);\n    \n}",NON_ZERO_EXIT_CODE,4,312
1590917742914502656,c5cc6f9845df4bd1986af86c0696296436bbc0f00a10a9f891b4100e57bc3a19,2022-11-11 12:02:02,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <bits/stdc++.h>\nusing namespace std;\n#define N 1000\nvoid z(int a[],int n)\n{\n\tint sum1=0,sum2=0;\n\tfor(int i=0;i<n;i++){\n\t\t\tif(a[i]>=0) sum1+=a[i];\n\t\t\telse{\n\t\t\t\tif(sum1>sum2) sum2=sum1;\n\t\t\t\tsum1=0;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif(sum1>sum2) sum2=sum1;\n\t\t}\n\tcout<<sum2;\n}\n\nvoid f(int a[],int n)\n{\n\tint mi=a[0];\n\tfor(int i=1;i<n;i++){\n\t\tif(a[i]<mi) mi=a[i];\n\t}\n\tcout<<mi<<endl;\n}\nint main()\n{\n\tint n,flag=0;\n\tint a[N],b[N];\n\tcin>>n;\n\tfor(int i=0;i<n;i++) cin>>a[i];\n\tfor(int i=0;i<n;i++) {\n\t\tcin>>b[i];\n\t\ta[i]=b[i]-a[i];\n\t\tif(a[i]>=0) flag=1;//如果全是血亏，标记就是0 \n\t}\n\tif(flag) z(a,n);\n\telse f(a,n);\n\t\n}",WRONG_ANSWER,4,448
1590917746559352832,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 12:02:03,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,x=input();\ny=input();\nz=input();\nx=50;\ny=50;\nz=30;\nprint(x+y-z),NON_ZERO_EXIT_CODE,16,2880
1590917761361031168,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 12:02:06,Python,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\ndate=list(map(int,input().split()))\ndef pow(a,s):\n    date=a\n    if s == 0:\n        return 1\n    else:\n        for _ in range(s):\n            date=date*a\n            return date\nfor i in range(a):\n    sum=pow(6,date[i])\n    print(sum%10)",ACCEPTED,46,2928
1590917875341266944,e715137eeb4190ade2330123b989bbdd6eebd9a5e1df2e292271d3bfe3a79c69,2022-11-11 12:02:33,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nvoid main()\n{\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n    \n}",ACCEPTED,7,476
1590917944580837376,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 12:02:50,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"x=input();\ny=input();\nz=input();\nprint('j',j=x+y-z)",NON_ZERO_EXIT_CODE,16,2776
1590917958531067904,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 12:02:53,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n = 0;\n    int count = 0;\n    scanf(\""%d\"",&n);\n    for(int i = 2; i < n; ++i)\n    {\n        for(int j = 2; j < n; ++j)\n        {\n            if(i % j == 0)\n            {\n                if(i != j)\n                {\n                    break;\n                }\n                else\n                {\n                    count++;\n                }\n            }\n        }\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",TIME_LIMIT_EXCEEDED,400,200
1590917963249684480,1773d9c971942817d949c47973c4eb8c24531f728d5480dbf3b232e568926258,2022-11-11 12:02:54,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.*;\nimport java.lang.Math;\nclass Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int t = sc.nextInt();\n        for (int i = 0; i < t; i++) {\n            int n = sc.nextInt();\n            System.out.println(((int) Math.pow(6, n)) % 10);\n        }\n    }\n}",NON_ZERO_EXIT_CODE,243,16512
1590917975153119232,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 12:02:57,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"x=input();\ny=input();\nz=input();\nprint('j',j=x+y-z);",NON_ZERO_EXIT_CODE,16,2748
1590918015342940160,33066437ddee11f609c900fe8dbd59cb8113e4d8dfd13c1812f199f4f3fdd334,2022-11-11 12:03:07,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n#define p 100\nint main()\n{\n    int t,i,n,j,k[p];\n    scanf(\""%d\"",&t);\n    for(i=1;i<=t;i++)\n    {\n        scanf(\""%d\"",&n);\n        j=pow(6,n);\n    }\n    for(i=1;i<=t;i++)\n     {\n        k[i]=j%10;\n        printf(\""%d\"",k[i]);\n        \n     }\n     return 0;\n}",WRONG_ANSWER,6,320
1590918025598009344,b31601c92a4a3080abbaad650e00bb77253224eab66b59a49b2118d017649c2c,2022-11-11 12:03:09,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""2022\\n\"");\n    return 0;\n}\n",ACCEPTED,3,184
1590918031730061312,6933dcb3592e2d6f6fc887ed9a5537aab21a30f76450c9b5043f7776bfc39a59,2022-11-11 12:03:11,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main(){\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,3,192
1590918057059487744,b31601c92a4a3080abbaad650e00bb77253224eab66b59a49b2118d017649c2c,2022-11-11 12:03:17,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""2022\\n\"");\n    return 0;\n}\n",ACCEPTED,3,348
1590918080765669376,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 12:03:22,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"x=50;\ny=60;\nz=40;\nprint('j',j=x+y-z);",NON_ZERO_EXIT_CODE,15,2756
1590918110209708032,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 12:03:29,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,x=50;\ny=60;\nz=40;\nprint(j=x+y-z);,NON_ZERO_EXIT_CODE,15,2884
1590918128664645632,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 12:03:34,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,x=50;\ny=60;\nz=40;\nprint(x+y-z);,WRONG_ANSWER,16,3264
1590918159782182912,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 12:03:41,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,x=50;\ny=60;\nz=40;\nprint(x+y-z);,WRONG_ANSWER,16,2884
1590918236177240064,ccc42b8437aa15d1214e4623799ed35cd8ea8087c26cb1b596d51ae4556ea39c,2022-11-11 12:03:59,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"def prime(p):\n    a=p//2\n    for i in range(2,a+1):\n        if p%i==0:\n            return False\n    return True\na=eval(input())\nsums=0\n\nfor i in range(2,a+1):\n    if prime(i)==True:\n        sums+=1\nprint(168)",TIME_LIMIT_EXCEEDED,400,2884
1590918267710017536,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-11 12:04:07,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<math.h>\n#include <stdio.h>\nint main()\n{\n    int n,i,j,k,sum,m,p,q,max;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n],temp[n];\n    for(i=0;i<n;i++)\n     scanf(\""%d\"",&a[i]);\n    for(j=0;j<n;j++)\n     scanf(\""%d\"",&b[j]);\n    for(k=0;k<n;k++)\n     c[k]=b[k]-a[k];\n    for(m=0;m<n;m++)\n    {\n     sum=0;\n     temp[m]=c[m];\n     for(p=m;p<n;p++)\n     {\n      sum+=c[p];\n      if(sum>=temp[m])\n       temp[m]=sum;\n     }\n    }\n    max=temp[0];\n    for(q=0;q<n;q++)\n     {\n      if(temp[q]>=max)\n       max=temp[q];\n     }\n    printf(\""%d\\n\"",max);\n    return 0;\n}\n",ACCEPTED,3,196
1590918376988413952,c5cc6f9845df4bd1986af86c0696296436bbc0f00a10a9f891b4100e57bc3a19,2022-11-11 12:04:33,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <bits/stdc++.h>\nusing namespace std;\n#define N 1000\nvoid z(int a[],int n)\n{\n\tint sum1=0,sum2=0;\n\tfor(int i=0;i<n;i++){\n\t\t\tif(a[i]>=0) sum1+=a[i];\n\t\t\telse{\n\t\t\t\tif(sum1>sum2) sum2=sum1;\n\t\t\t\tsum1=0;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif(sum1>sum2) sum2=sum1;\n\t\t}\n\tcout<<sum2;\n}\n\nvoid f(int a[],int n)\n{\n\tint mi=a[0];\n\tfor(int i=1;i<n;i++){\n\t\tif(a[i]<mi) mi=a[i];\n\t}\n\tcout<<mi<<endl;\n}\nint main()\n{\n\tint n,flag=0;\n\tint a[N],b[N];\n\tcin>>n;\n\tfor(int i=0;i<n;i++) cin>>a[i];\n\tfor(int i=0;i<n;i++) {\n\t\tcin>>b[i];\n\t\ta[i]=b[i]-a[i];\n\t\tif(a[i]>=0) flag=1;//如果全是血亏，标记就是0 \n\t}\n\tif(flag) z(a,n);\n\telse cout<<\""0\""<<endl;\n\t\n}",WRONG_ANSWER,4,452
1590918435750608896,1773d9c971942817d949c47973c4eb8c24531f728d5480dbf3b232e568926258,2022-11-11 12:04:47,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.*;\nimport java.lang.Math;\nclass Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int t = sc.nextInt();\n        for (int i = 0; i < t; i++) {\n            int n = sc.nextInt();\n            int v = (int) Math.pow(6, n);\n            int result = v % 10;\n            System.out.println(result);\n        }\n    }\n}\n",NON_ZERO_EXIT_CODE,246,16620
1590918449793138688,d8701a6da26af0d0579eec24b939fdbf381dd9449c34251ff0d8938314216606,2022-11-11 12:04:50,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nvoid month_day(int year);\nint main(){\n    int year;\n    \n\nscanf_s(\""%d\"", &year);\n    month_day(year);\n    pintf(\""%d\"",year);\n    return 0;\n    }",COMPILE_ERROR,0,0
1590918486061285376,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 12:04:59,Python,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\ndate=list(map(int,input().split()))\ndef pow(a,s):\n    date=a\n    if s == 0:\n        return 1\n    else:\n        for _ in range(s):\n            date=date*a\n            return date\nfor i in range(a):\n    sum=pow(6,date[i])\n    print(sum%10)",ACCEPTED,52,2928
1590918521826095104,6933dcb3592e2d6f6fc887ed9a5537aab21a30f76450c9b5043f7776bfc39a59,2022-11-11 12:05:08,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nvoid main(){\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n}",ACCEPTED,6,312
1590918525982670848,d8701a6da26af0d0579eec24b939fdbf381dd9449c34251ff0d8938314216606,2022-11-11 12:05:09,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nvoid month_day(int year);\nint main(){\n    int year;\n    \n\nscanf(\""%d\"", &year);\n    month_day(year);\n    pintf(\""%d\"",year);\n    return 0;\n    }",COMPILE_ERROR,0,0
1590918531162640384,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 12:05:10,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\ndate=list(map(int,input().split()))\ndef pow(a,s):\n    date=a\n    if s == 0:\n        return 1\n    else:\n        for _ in range(s):\n            date=date*a\n        return date\nfor i in range(a):\n    sum=pow(6,date[i])\n    print(sum%10)",TIME_LIMIT_EXCEEDED,35,2756
1590918546463461376,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 12:05:13,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\ndate=list(map(int,input().split()))\ndef pow(a,s):\n    date=a\n    if s == 0:\n        return 1\n    else:\n        for _ in range(s):\n            date=date*a\n        return date\nfor i in range(a):\n    sum=pow(6,date[i])\n    print(sum%10)",TIME_LIMIT_EXCEEDED,36,2888
1590918547444903936,2bc6a85c0376656012a7970a7842a2a9d8769555a79ef4eec85ff45aa30ff7b7,2022-11-11 12:05:14,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main() {\n\tint num;\n\tscanf(\""%d\"", &num);\n\tint count = 0;\n\tfor(int i = 2; i <= num; ++i) {\n\t\tint j;\n\t\tint k = (int)sqrt(i * 1.0);\n\t\tfor(j=2; j <= k; j++) {\n\t\t\tif(i %j == 0) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (j > k) {\n\t\t\tcount ++;\n\t\t}\n\t}\n\tprintf(\""%d\"", count);\n\treturn 0;\n} ",ACCEPTED,14,192
1590918572484898816,7e6a67f270e740aba8788a12d9a49939621a28d5059d3ced2247a86914b0a3b3,2022-11-11 12:05:20,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    printf(\""2022\"");\n}\n",ACCEPTED,3,200
1590918647177064448,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 12:05:37,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"def su(a):\n    for i in (2,a/2):\n        if a==2:\n            return 1\n        elif a%i==0:\n            return 0\n        else:\n            return 1\ndata = int(input())\ns = 0\nfor i in range(2,data+1):\n    if su(i)==1:\n        s=s+1\nprint(s)",WRONG_ANSWER,40,2908
1590918695810019328,2e4af98c441106efa9ee51f8a781d0eee91a3dff6193987d421eb3a48725c814,2022-11-11 12:05:49,C++,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <iostream>\n\n\nusing namespace std;\n\nint main(){\n    cout<<\""2022\"";//???????\n\n    return 0;\n}",ACCEPTED,4,448
1590918739128815616,70c675ddfcb60b2192bc8ac38fb068fec0500208a5bf97a796c7cc074b43cf87,2022-11-11 12:05:59,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner myScanner = new Scanner(System.in);\n\t\tint n = myScanner.nextInt();\n\t\tint[] arr = new int[n];\n\t\tfor(int i = 0;i < n;i++) {\n\t\t\tarr[i] = myScanner.nextInt();\n\t\t\tif(i < n-1) {\n\t\t\tSystem.out.println(\""6\"");\n\t\t\t}else {\n\t\t\t\tSystem.out.printf(\""6\"");\n\t\t\t}\n\t\t}\n\t}\n\n}",NON_ZERO_EXIT_CODE,250,19428
1590918765473214464,ce1bb8e96385d94dfdb2bd028407e2ffb5a64494440cd7964d6624a83809dae6,2022-11-11 12:06:06,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main{\n\n\tpublic static void main(String[] args){\t\tint arr[];\n\n\t\tarr=new int[10];\n\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tfor(int i=0;i<10 ;i++){\n\n\t\t\tarr[i] = sc.nextInt();\n\n\t\t}\n\n      for(int i=0;i<10;i++)\n\n\t\t\tSystem.out.println(arr[i]);\n\n\t\tfor(int i = 0;i<9;i++){\n\n\t\t\tfor(int j =0;j<10-i-1;j++){\n\n\t\t\t\tif(arr[j]>arr[j+1]){\n\n\t\t\t\t\tint a;\n\n\t\t\t\t\ta=arr[j+1];\n\n\t\t\t\t\tarr[j+1]=arr[j];\n\n\t\t\t\t\tarr[j]=a;\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t\tSystem.out.println(arr[9]);\n\n\t\tSystem.out.print(arr[0]);\n\n\t}\n\n},NON_ZERO_EXIT_CODE,122,16536
1590918850898628608,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 12:06:26,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\ndate=list(map(int,input().split()))\ndef pow(a,s):\n    date=a\n    if s == 0:\n        return 1\n    else:\n        for _ in range(s):\n            date=date*a\n        return date\nfor i in range(a):\n    sum=pow(6,date[i])\n    print(sum%10)",TIME_LIMIT_EXCEEDED,35,2884
1590918860587446272,c5cc6f9845df4bd1986af86c0696296436bbc0f00a10a9f891b4100e57bc3a19,2022-11-11 12:06:28,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <bits/stdc++.h>\nusing namespace std;\n#define N 1000\nvoid z(int a[],int n)\n{\n\tint sum1=0,sum2=0;\n\tfor(int i=0;i<n;i++){\n\t\t\tif(a[i]>=0) sum1+=a[i];\n\t\t\telse{\n\t\t\t\tif(sum1>sum2) sum2=sum1;\n\t\t\t\tsum1=0;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif(sum1>sum2) sum2=sum1;\n\t\t}\n\tcout<<sum2;\n}\n\nvoid f(int a[],int n)\n{\n\tint ma=a[0];\n\tfor(int i=1;i<n;i++){\n\t\tif(a[i]>ma) ma=a[i];\n\t}\n\tcout<<ma<<endl;\n}\nint main()\n{\n\tint n,flag=0;\n\tint a[N],b[N];\n\tcin>>n;\n\tfor(int i=0;i<n;i++) cin>>a[i];\n\tfor(int i=0;i<n;i++) {\n\t\tcin>>b[i];\n\t\ta[i]=b[i]-a[i];\n\t\tif(a[i]>=0) flag=1;//如果全是血亏，标记就是0 \n\t}\n\tif(flag) z(a,n);\n\telse f(a,n);\n\t\n}",WRONG_ANSWER,4,452
1590918905114198016,d54b7e24c90cf40d468bdeb018e61440010a1049a4ae96e2c6331c215521f91c,2022-11-11 12:06:39,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"\nint main()\n{\n\tint t,n,i,a=6,j;\n\t\n\tscanf(\""%d\"",&t);\n\t\n\twhile(j<t)\n\t{\n\t\tscanf(\""%d\"",&n);\n\t\tfor(i=1;i<n;i++)\n\t\t{\n\t\t\ta = 6*a;\n\t\t\t\n\t\t}\n\t\tprintf(\""%d\\n\"",a%10);\n\t\tj++;\n\t\ta=6;\n\t\t\n\t\t\n\t}\n}",TIME_LIMIT_EXCEEDED,24,200
1590918918343036928,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 12:06:42,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n = 0;\n    int count = 0;\n    scanf(\""%d\"",&n);\n    for(int i = 2; i < n; ++i)\n    {\n        for(int j = 2; j < n; ++j)\n        {\n            if(i % j == 0)\n            {\n                break;\n            }\n        }\n        if(i == j)\n        {\n           count++;\n        }\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",COMPILE_ERROR,0,0
1590918933501251584,001baa7272d47ab2d3a9b57bf7838570ff03ab1cabb738e7b342b652b1e42a83,2022-11-11 12:06:46,C++,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<bits/stdc++.h>\n\nusing namespace std;\n\n//  向上取整    向下取整\n//  ceil()       floor()\n\n\nint main() {\n    printf(\""2022\"");\n\n    return 0;\n}\n",ACCEPTED,4,316
1590918942292488192,d122b81a371b28751082747cf65a235d0eddfd496e142775cd971d8f88adf327,2022-11-11 12:06:48,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n    int t;\n    scanf(\""%d\\n\"",&t);\n    int a[100];\n    for(int j=0;j<t;j++)\n    {\n        scanf(\""%d\"",&a[j]);\nprintf(\""6\\n\"");\n    }\n  return 0;\n    \n}\n",WRONG_ANSWER,10,348
1590919058395041792,c5cc6f9845df4bd1986af86c0696296436bbc0f00a10a9f891b4100e57bc3a19,2022-11-11 12:07:16,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <bits/stdc++.h>\nusing namespace std;\n#define N 1000\nvoid z(int a[],int n)\n{\n\tint sum1=0,sum2=0;\n\tfor(int i=0;i<n;i++){\n\t\tif(a[i]>=0) sum1+=a[i];\n\t\telse{\n\t\t\tif(sum1>sum2) sum2=sum1;\n\t\t\tsum1=0;\n\t\t\tcontinue;\n\t\t}\n\t\tif(sum1>sum2) sum2=sum1;\n\t}\n\tcout<<sum2<<endl;\n}\n\nvoid f(int a[],int n)\n{\n\tint ma=a[0];\n\tfor(int i=1;i<n;i++){\n\t\tif(a[i]>ma) ma=a[i];\n\t}\n\tcout<<ma<<endl;\n}\nint main()\n{\n\tint n,flag=0;\n\tint a[N],b[N];\n\tcin>>n;\n\tfor(int i=0;i<n;i++) cin>>a[i];\n\tfor(int i=0;i<n;i++) {\n\t\tcin>>b[i];\n\t\ta[i]=b[i]-a[i];\n\t\tif(a[i]>=0) flag=1;//如果全是血亏，标记就是0 \n\t}\n\tif(flag) z(a,n);\n\telse f(a,n);\n\t\n}",WRONG_ANSWER,4,312
1590919064657137664,70c675ddfcb60b2192bc8ac38fb068fec0500208a5bf97a796c7cc074b43cf87,2022-11-11 12:07:17,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner myScanner = new Scanner(System.in);\n\t\tint n = myScanner.nextInt();\n\t\tint[] arr = new int[n];\n\t\tint x=6;\n\t\tfor(int i = 0;i < n;i++) {\n\t\t\tarr[i] = myScanner.nextInt();\n\t\t\tif(i < n-1) {\n\t\t\tSystem.out.println(x);\n\t\t\t}else {\n\t\t\t\tSystem.out.printf(\""%d\"",x);\n\t\t\t}\n\t\t}\n\t}\n\n}\n",NON_ZERO_EXIT_CODE,249,19128
1590919143921070080,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 12:07:36,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n = 0;\n    int count = 0;\n    scanf(\""%d\"",&n);\n    int i = 0;\n    for(i = 2; i < n; ++i)\n    {\n        int j = 0;\n        for(j = 2; j < n; ++j)\n        {\n            if(i % j == 0)\n            {\n                break;\n            }\n        }\n        if(i == j)\n        {\n           count++;\n        }\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",TIME_LIMIT_EXCEEDED,400,312
1590919161096744960,7e6a67f270e740aba8788a12d9a49939621a28d5059d3ced2247a86914b0a3b3,2022-11-11 12:07:40,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n\nint main(){\n    int X,Y,Z;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    printf(\""%d\"",X+Y-Z);\n}\n",ACCEPTED,8,360
1590919197704650752,e715137eeb4190ade2330123b989bbdd6eebd9a5e1df2e292271d3bfe3a79c69,2022-11-11 12:07:49,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nvoid main()\n{\n    int n,m=6,i,j,k;\n    scanf(\""%d\"",&n);\n    for(i=1;i<n;i++)\n        scanf(\""%d\"",&j);\n    for(i=1;i<=n;i++)\n    {\n        printf(\""%d\\n\"",m);\n    }\n}",WRONG_ANSWER,9,316
1590919231724650496,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 12:07:57,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main(){\n  int i,j,n,k=0;\n  scanf(\""%d\"",&n);\n    if(n>=2&&N<=1e5){\n    for(i=2;i<n;i++)\n   {\n    for(j=2;j<i;j++)\n        {\n      if (i%j==0)\n        break;\n    }\n     if(i==j)\n       k++;\n  }}\n  printf(\""%d\"",k);\n  return 0;\n}\n",COMPILE_ERROR,0,0
1590919239735771136,6933dcb3592e2d6f6fc887ed9a5537aab21a30f76450c9b5043f7776bfc39a59,2022-11-11 12:07:59,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nvoid main(){\n    int n;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        printf(\""6\\n\"");\n    }\n}",WRONG_ANSWER,9,344
1590919265673347072,2e4af98c441106efa9ee51f8a781d0eee91a3dff6193987d421eb3a48725c814,2022-11-11 12:08:05,C++,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <iostream>\n\n#define mani main\n#define mian main\n\nusing namespace std;\n\nint main() {\n//  不炸长\n    int a, b, c;\n    cin >> a >> b >> c;\n    cout<<a+b-c;\n    return 0;\n}",ACCEPTED,9,448
1590919270329004032,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-11 12:08:06,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n\nint main()\n\n{\n\n    int n,a[10],i,b[10];\n\n    scanf(\""%d\"",&n);\n\n    for(i=0;i<n;i++)\n\n    scanf(\""%d\"",&a[i]);\n\n    for(i=0;i<n;i++)\n\n    {\n\n    b[i]=pow(6,a[i]);\n\n    printf(\""%d\\n\"",b[i]%10);\n\n    }\n\n    return 0;\n\n}",WRONG_ANSWER,9,536
1590919290629459968,b31601c92a4a3080abbaad650e00bb77253224eab66b59a49b2118d017649c2c,2022-11-11 12:08:11,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a；\n    a = scanf()；\n    int b；\n    b = scanf()；\n    int c；\n    c = scanf()；\n    int d；\n    d = a + b - c；\n\n    printf(\""d\\n\"");\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590919298527330304,70c675ddfcb60b2192bc8ac38fb068fec0500208a5bf97a796c7cc074b43cf87,2022-11-11 12:08:13,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner myScanner = new Scanner(System.in);\n\t\tint n = myScanner.nextInt();\n\t\tint[] arr = new int[n];\n\t\tint x=6;\n\t\tfor(int i = 0;i < n;i++) {\n\t\t\tarr[i] = myScanner.nextInt();\n// \t\t\tif(i < n-1) {\n\t\t\tSystem.out.println(x);\n// \t\t\t}else {\n// \t\t\t\tSystem.out.printf(\""%d\"",x);\n// \t\t\t}\n\t\t}\n\t}\n\n}\n",WRONG_ANSWER,251,16532
1590919331779772416,1773d9c971942817d949c47973c4eb8c24531f728d5480dbf3b232e568926258,2022-11-11 12:08:21,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.*;\nimport java.lang.Math;\nclass Main{\n    public static void main(String[] args){\n        Scanner sc = new Scanner(System.in);\n        int num = sc.nextInt();\n        for(int i=0;i<num;i++){\n            int x = sc.nextInt();\n            int y = (int) Math.pow(6,x);\n            int z=y%10;\n            System.out.println(z);\n        }\n    }\n}",NON_ZERO_EXIT_CODE,255,19172
1590919387031343104,001baa7272d47ab2d3a9b57bf7838570ff03ab1cabb738e7b342b652b1e42a83,2022-11-11 12:08:34,C++,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<bits/stdc++.h>\n\nusing namespace std;\n\n//  向上取整    向下取整\n//  ceil()       floor()\n\nint main() {\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n    return 0;\n}\n",ACCEPTED,7,452
1590919470489600000,345826d11b41befc23adeb536e81da8eb6ec9a8bfb9448acf91422deedb8ba4a,2022-11-11 12:08:54,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int t,i,s=0;\n    scanf(\""%d\"",&t);\n    int n[t],j[t];\n    for(i=0;i<t;i++)\n        scanf(\""%d\"",&n[i]);\n    for(i=0;i<t;i++)\n    {\n        s=pow(6,n[i]);\n        if(s>=0&&s<=1e-6)\n        j[i]=s%10;\n    }\n     for(i=0;i<t;i++)\n        printf(\""%d\\n\"",j[i]);\n}\n",WRONG_ANSWER,4,184
1590919524642263040,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-11 12:09:07,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<math.h>\n#include <stdio.h>\nint main()\n{\n    int n,i=2,j,temp=0;\n    scanf(\""%d\"",&n);\n     for(j=2;j<=i;j++)\n     {\n       if(i>n)\n        break;\n      if(i%j==0&&j==i)\n      {\n       ++temp;\n       j=1;\n       ++i;\n      }\n      else if(i%j==0)\n      {\n       ++i;\n       j=1;\n      }\n     }\n    printf(\""%d\"",temp);\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,400,324
1590919528899481600,23d287b80d4d430308a1b57ee92bb4f2d1b25d1142a13c1c0fda4316c9bb9f17,2022-11-11 12:09:08,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\narr=[0,1,2,3,4,5,6,7,8,9]\nfor i in range(0,a):\n    arr[i]=int(input())\nfor i in range(0,a):\n    print(pow(6,arr[i])%10)",NON_ZERO_EXIT_CODE,15,2740
1590919595471450112,a57fdafe4877cd9608fc0ac8a5120a47bc60a015785960e61b67b4e66187c2f2,2022-11-11 12:09:24,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main(){\n    int i,n,j,num=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<=n;i++){\n        for(j=2;j<i;j++){\n            if(i%j==0)\n                break;\n        }\n        if(i==j)\n            num++;\n    }\n    printf(\""%d\"",num);\n    return 0;\n}",TIME_LIMIT_EXCEEDED,400,200
1590919645580824576,33066437ddee11f609c900fe8dbd59cb8113e4d8dfd13c1812f199f4f3fdd334,2022-11-11 12:09:36,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n#define p 100\nint main()\n{\n    int t,i,n,j,k[p];\n    scanf(\""%d\"",&t);\n    for(i=1;i<=t;i++)\n    {\n        scanf(\""%d\"",&n);\n        j=pow(6,n);\n        k[i]=j%10;\n        printf(\""%d\"",k[i]);\n        printf(\""\\n\"") ;\n     }\n     return 0;\n}\n",WRONG_ANSWER,7,316
1590919650072899584,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 12:09:37,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,x=int(input(50));\ny=int(input(60));\nz=int(input(40));\nprint(x+y-z);,NON_ZERO_EXIT_CODE,15,2748
1590919668804661248,6933dcb3592e2d6f6fc887ed9a5537aab21a30f76450c9b5043f7776bfc39a59,2022-11-11 12:09:41,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nvoid main(){\n    int n;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        i!=n-1?printf(\""6\\n\""):printf(\""6\"");\n    }\n}",WRONG_ANSWER,9,196
1590919670553686016,e715137eeb4190ade2330123b989bbdd6eebd9a5e1df2e292271d3bfe3a79c69,2022-11-11 12:09:41,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nvoid main()\n{\n    int n,m=6,i,j,k;\n    scanf(\""%d\"",&n);\n    for(i=1;i<n;i++)\n        scanf(\""%d\"",&j);\n    for(i=1;i<=n;i++)\n    {\n        printf(i==n?\""%d\"":\""%d\\n\"",m);\n    }\n}",WRONG_ANSWER,10,324
1590919699024646144,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 12:09:48,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,x=int(input(50));\ny=int(input(60));\nz=int(input(40));\nprint('x+y-z');,NON_ZERO_EXIT_CODE,20,2748
1590919717898989568,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 12:09:53,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,x=int(input(50));\ny=int(input(60));\nz=int(input(40));\nprint('x+y-z'),NON_ZERO_EXIT_CODE,17,2880
1590919728137285632,d54b7e24c90cf40d468bdeb018e61440010a1049a4ae96e2c6331c215521f91c,2022-11-11 12:09:55,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"int main()\n{\n\tint t,n,i,a=6,j;\n\t\n\tscanf(\""%d\"",&t);\n\t\n\twhile(j<t)\n\t{\n\t\tscanf(\""%d\"",&n);\n\t\tfor(i=1;i<n;i++)\n\t\t{\n\t\t\ta = 6*a;\t\n\t\t}\n\t\tprintf(\""%d\\n\"",a%10);\n\t\tj++;\n\t\ta=6;\n\t\t\n\t\t\n\t}\n}",TIME_LIMIT_EXCEEDED,23,308
1590919771841957888,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 12:10:06,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j=0;\n    if(n>=2&&n<=10^5)\n    {\n        scanf(\""%d\"",&n);\n    }\n    for(i=2;i<n;i++)\n    {\n        for(int k=2;k<i;k++)\n        {\n            if(i%k==0)\n            {\n                break;\n            }\n        }\n        if(k>i)\n        {\n            j++\n        }\n    }\n    printf(\""%d\"",j);\n}",COMPILE_ERROR,0,0
1590919776778629120,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 12:10:07,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\ndate=list(map(int,input().split()))\ndef pow(a,s):\n    date=a\n    if s == 0:\n        return 1\n    else:\n        for _ in range(s-1):\n            date=date*a\n        return date\nfor i in range(a):\n    sum=pow(3,date[i])\n    print(sum%10)",WRONG_ANSWER,17,2900
1590919818734252032,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 12:10:17,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"x=int(input(50));\ny=int(input(60));\nz=int(input(40));\nprint(\""%d+%d-%d=%d\"")",NON_ZERO_EXIT_CODE,15,2876
1590919849050705920,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-11 12:10:24,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n\nint main()\n\n{\n\n    int n,a[10],i,b[10];\n\n    scanf(\""%d\"",&n);\n\n    for(i=0;i<n;i++)\n\n    scanf(\""%d\"",&a[i]);\n\n    for(i=0;i<n;i++)\n\n    {\n\n    b[i]=pow(6,a[i]);\n\n    printf(\""%d\"",b[i]%10);\n\n    if(i!=n-1)\n\n    printf(\""\\n\"");\n\n    }\n\n    return 0;\n\n}",WRONG_ANSWER,8,436
1590919860576653312,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 12:10:27,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\ndate=list(map(int,input().split()))\ndef pow(a,s):\n    date=a\n    if s == 0:\n        return 1\n    else:\n        for _ in range(s-1):\n            date=date*a\n        return date\nfor i in range(a):\n    sum=pow(6,date[i])\n    print(sum%10)",TIME_LIMIT_EXCEEDED,35,3128
1590919882403807232,6933dcb3592e2d6f6fc887ed9a5537aab21a30f76450c9b5043f7776bfc39a59,2022-11-11 12:10:32,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nvoid main(){\n    int n;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        i!=n-1?printf(\""6\\n\""):printf(\""6\"");\n    }\n}",WRONG_ANSWER,8,196
1590919918726483968,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 12:10:41,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"x=int(input(50));\ny=int(input(60));\nz=int(input(40));\nprint(\""%d+%d-%d=%d\""%(x,y,z,x+y-z))",NON_ZERO_EXIT_CODE,17,2876
1590919919464681472,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-11 12:10:41,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n\nint main()\n\n{\n\n    int n,a[100],i,b[100];\n\n    scanf(\""%d\"",&n);\n\n    for(i=0;i<n;i++)\n\n    scanf(\""%d\"",&a[i]);\n\n    for(i=0;i<n;i++)\n\n    {\n\n    b[i]=pow(6,a[i]);\n\n    printf(\""%d\"",b[i]%10);\n\n    if(i!=n-1)\n\n    printf(\""\\n\"");\n\n    }\n\n    return 0;\n\n}",WRONG_ANSWER,6,328
1590919946345971712,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 12:10:47,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<n;i++)\n    {\n        for(int k=2;k<i;k++)\n        {\n            if(i%k==0)\n            {\n                break;\n            }\n        }\n        if(k>i)\n        {\n            j++\n        }\n    }\n    printf(\""%d\"",j);\n}",COMPILE_ERROR,0,0
1590920005204639744,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 12:11:01,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<n;i++)\n    {\n        for(int k=2;k<i;k++)\n        {\n            if(i%k==0)\n            {\n                break;\n            }\n        }\n        if(k>i)\n        {\n            j++;\n        }\n    }\n    printf(\""%d\"",j);\n}",COMPILE_ERROR,0,0
1590920020505460736,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-11 12:11:05,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n\nint main()\n\n{\n\n    int n,a[100],i,b[100];\n\n    scanf(\""%d\"",&n);\n\n    for(i=0;i<n;i++)\n\n    scanf(\""%d\"",&a[i]);\n\n    for(i=0;i<n;i++)\n\n    {\n\n    b[i]=pow(6,a[i]);\n\n    printf(\""%d\"",b[i]%10);\n\n    if(i!=n-1)\n\n    printf(\""\\n\"");\n\n    }\n\n    return 0;\n\n}",WRONG_ANSWER,6,324
1590920038176063488,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 12:11:09,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"x=int(input(50));\ny=int(input(60));\nz=int(input(40));\nprint(\""%d+%d-%d=%d\""%(x,y,z,x+y-z));",NON_ZERO_EXIT_CODE,16,2884
1590920095537369088,0ccbaaa612b3d01dbe621ce5e7366d6e26d2e5adf55047d92c6eb7adf78a979d,2022-11-11 12:11:23,C++,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main(void)\n{\n\tcout<<\""2022\""; \n\treturn 0;\n}",ACCEPTED,3,452
1590920105406562304,33066437ddee11f609c900fe8dbd59cb8113e4d8dfd13c1812f199f4f3fdd334,2022-11-11 12:11:25,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n#define p 100\nint main()\n{\n    int t,i=1,n,j,k[p];\n    scanf(\""%d\"",&t);\n    while(i<=t)\n    {\n        scanf(\""%d\"",&n);\n        j=pow(6,n);\n        k[i]=j%10;\n        printf(\""%d\"",k[i]);\n        printf(\""\\n\"") ;\n        i++;\n     }\n     return 0;\n}\n",WRONG_ANSWER,8,308
1590920140231868416,2bc6a85c0376656012a7970a7842a2a9d8769555a79ef4eec85ff45aa30ff7b7,2022-11-11 12:11:33,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main() {\n\tint i,num;\n\tscanf(\""%d\"", &num);\n\tint arr1[num];\n\tfor(i = 0; i < num; ++i) \n\t\tscanf(\""%d\"", &arr1[i]);\n\tint arr2[num];\n\tfor(i = 0; i < num; ++i) \n\t\tscanf(\""%d\"", &arr2[i]);\n\tint max = 0;\n\tint t = 0;\n\tfor(i = 0; i < num; ++i) {\n\t\tt = t - arr1[i] + arr2[i];\n\t\tif(t > max) {\n\t\t\tmax = t;\n\t\t}\n\t}\n\tprintf(\""%d\"", max);\t\n} ",WRONG_ANSWER,3,184
1590920159081070592,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 12:11:38,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"x=int(input(50));\ny=int(input(60));\nz=int(input(40));\na=x+y-z;\nprint(\""%d+%d-%d=%d\""%(x,y,z,x+y-z));",NON_ZERO_EXIT_CODE,15,2756
1590920229608296448,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 12:11:55,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"x=int(input(50));\ny=int(input(60));\nz=int(input(40));\na=x+y-z;\nprint(\""%d\""%a);",NON_ZERO_EXIT_CODE,15,2908
1590920271991713792,70c675ddfcb60b2192bc8ac38fb068fec0500208a5bf97a796c7cc074b43cf87,2022-11-11 12:12:05,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner myScanner = new Scanner(System.in);\n\t\tint n = myScanner.nextInt();\n\t\tint[] arr = new int[n];\n\t\tint x=6;\n\t\tfor(int i = 0;i < n;i++) {\n\t\t\tint a = myScanner.nextInt();\n\t\t\tarr[i] = a;\n\t\t\tif(i < n-1) {\n\t\t\tSystem.out.println(x);\n\t\t\t}else {\n\t\t\t\tSystem.out.printf(\""%d\"",x);\n\t\t\t}\n\t\t}\n\t}\n\n}",NON_ZERO_EXIT_CODE,252,16644
1590920297887346688,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 12:12:11,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,x=int(input(50));\ny=int(input(60));\nz=int(input(40));\nprint(a=x+y-z);,NON_ZERO_EXIT_CODE,15,2756
1590920332779761664,e715137eeb4190ade2330123b989bbdd6eebd9a5e1df2e292271d3bfe3a79c69,2022-11-11 12:12:19,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nvoid main()\n{\n    int n,m=6,i,j,k;\n    scanf(\""%d\"",&n);\n    if(n==0)\n        printf(\""1\"");\n    for(i=1;i<n;i++)\n        scanf(\""%d\"",&j);\n    for(i=1;i<=n;i++)\n    {\n        printf(i==n?\""%d\"":\""%d\\n\"",m);\n    }\n}",WRONG_ANSWER,10,312
1590920394226335744,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 12:12:34,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"def su(a):\n    for i in range(2,a//2+1):\n        if a==2:\n            return 1\n        if a==3:\n            return 1\n        elif a%i!=0:\n\ndata = int(input())\ns = 0\nfor i in range(2,data+1):\n    if su(i)==1:\n        s=s+1\nprint(s)",NON_ZERO_EXIT_CODE,20,2784
1590920416418398208,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 12:12:39,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"x=int(input(50));\ny=int(input(60));\nz=int(input(40));\nprint(\""%d\"",a=x+y-z);",NON_ZERO_EXIT_CODE,15,2912
1590920442645381120,0ccbaaa612b3d01dbe621ce5e7366d6e26d2e5adf55047d92c6eb7adf78a979d,2022-11-11 12:12:46,C++,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main(void)\n{\n\tint x,y,z;\n\tcin>>x>>y>>z;\n\tcout<<x+y-z; \n\treturn 0;\n}",ACCEPTED,6,452
1590920444096610304,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 12:12:46,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"x=int(input(50));\ny=int(input(60));\nz=int(input(40));\nprint(\""%d\""%a=x+y-z);",NON_ZERO_EXIT_CODE,16,2888
1590920510630834176,7c6d208c4c4b695bc8d6f8ae0c0357c2466f5c9f86ec0652674812219ac09d38,2022-11-11 12:13:02,Java,300.0,1590528927448293376,1590525945717575680,1049226928954454016,public class Main {\n    public static void main(String[] args)  {\n        System.out.println(2022);\n    }\n},ACCEPTED,70,17064
1590920512388272128,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 12:13:02,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"x=int(input(50));\ny=int(input(60));\nz=int(input(40));\nprint(\""%d\""%a =x+y-z);",NON_ZERO_EXIT_CODE,18,2744
1590920525688385536,001baa7272d47ab2d3a9b57bf7838570ff03ab1cabb738e7b342b652b1e42a83,2022-11-11 12:13:05,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<bits/stdc++.h>\n\nusing namespace std;\n\n//  向上取整    向下取整\n//  ceil()       floor()\n\nint main() {\n    int t;\n    scanf(\""%d\"",&t);\n    int n;\n    for(int i=0;i<t;i++){\n        scanf(\""%d\"",&n);\n        printf(\""6\\n\"");\n    }\n    return 0;\n}\n",WRONG_ANSWER,11,472
1590920594793738240,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 12:13:22,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<n;i++)\n    {\n        for(int k=2;k<sprt(i);k++)\n        {\n            if(i%k==0)\n            {\n                break;\n            }\n        }\n        if(k>sprt(i))\n        {\n            j++;\n        }\n    }\n    printf(\""%d\"",j);\n}",COMPILE_ERROR,0,0
1590920683314524160,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 12:13:43,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include \""stdafx.h\""\n#include <stdlib.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<n;i++)\n    {\n        for(int k=2;k<sprt(i);k++)\n        {\n            if(i%k==0)\n            {\n                break;\n            }\n        }\n        if(k>sprt(i))\n        {\n            j++;\n        }\n    }\n    printf(\""%d\"",j);\n}",COMPILE_ERROR,0,0
1590920726666870784,33066437ddee11f609c900fe8dbd59cb8113e4d8dfd13c1812f199f4f3fdd334,2022-11-11 12:13:53,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n#define p 100\nint main()\n{\n    int t,i=1,n,j,k[p];\n    scanf(\""%d\"",&t);\n    while(i<=t)\n    {\n        scanf(\""%d\"",&n);\n        j=pow(6,n);\n        k[i]=j%10;\n        printf(\""%d\"",k[i]);\n        i++;\n     }\n     return 0;\n}\n",WRONG_ANSWER,8,320
1590920732106862592,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 12:13:55,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,x=int(input());\ny=int(input());\nz=int(input());\nx=50;\ny=60;\nz=40;\na=x+y-z;\nprint(int(a)),NON_ZERO_EXIT_CODE,16,3004
1590920761991278592,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 12:14:02,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,x=50;\ny=60;\nz=40;\na=x+y-z;\nprint(int(a)),WRONG_ANSWER,17,2880
1590920784892198912,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 12:14:07,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,x=50;\ny=60;\nz=40;\na=x+y-z;\nprint(int(a));,WRONG_ANSWER,15,2744
1590920897257607168,e715137eeb4190ade2330123b989bbdd6eebd9a5e1df2e292271d3bfe3a79c69,2022-11-11 12:14:34,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nvoid main()\n{\n    int n,m=6,i,j,k;\n    scanf(\""%d\"",&n);\n    for(i=1;i<n;i++)\n    {\n        \n        scanf(\""%d\"",&j);\n        if(j!=0)\n            printf(i==n?\""%d\"":\""%d\\n\"",m);\n        else\n            printf(i==n?\""1\"":\""1\\n\"",m);\n    }\n}",WRONG_ANSWER,4,384
1590920900944375808,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 12:14:35,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,x=8;\ny=7;\nz=3;\na=x+y-z;\nprint(int(a));,WRONG_ANSWER,16,2744
1590920965322772480,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 12:14:50,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\ndate=list(map(int,input().split()))\nfor i in range(a):\n    sum=6**date[i]\n    print(sum%10)",TIME_LIMIT_EXCEEDED,37,3200
1590920973174484992,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 12:14:52,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,print(12),WRONG_ANSWER,16,2884
1590920982943043584,2bc6a85c0376656012a7970a7842a2a9d8769555a79ef4eec85ff45aa30ff7b7,2022-11-11 12:14:54,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main() {\n\tint i,num;\n\tscanf(\""%d\"", &num);\n\tint arr1[num];\n\tfor(i = 0; i < num; ++i) \n\t\tscanf(\""%d\"", &arr1[i]);\n\tint arr2[num];\n\tfor(i = 0; i < num; ++i) \n\t\tscanf(\""%d\"", &arr2[i]);\n\tint max = 0;\n\tint t = 0;\n\tfor(i = 0; i < num; ++i) {\n\t\tif(t < 0) {\n\t\t\tbreak;\n\t\t}\n\t\tt = t - arr1[i] + arr2[i];\n\t\tif(t > max) {\n\t\t\tmax = t;\n\t\t}\n\t}\n\tprintf(\""%d\"", max);\t\n} ",WRONG_ANSWER,3,320
1590920996142518272,fec6d07e317796c63fb7ae6e7538f75973ad64af6e6196cc27eed3e9e685bf86,2022-11-11 12:14:58,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nmain()\n    {\n    int x,i,t=1,n;\n    scanf(\""%d\"",&n);\n    for(x=3;x<=n;x+=2)\n    {\n        for(i=2;i<=x/2;i++)\n           if(x%i==0)\n           break;\n\n        if(x/2<i)\n            t++;\n    }\n    printf(\""%d\\n\"",t);\n}\n\n\n\n\n\n\n\n\n\n\n\n\n\n",TIME_LIMIT_EXCEEDED,400,324
1590921071673520128,fec6d07e317796c63fb7ae6e7538f75973ad64af6e6196cc27eed3e9e685bf86,2022-11-11 12:15:16,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nvoid main()\n    {\n    int x,i,t=1,n;\n    scanf(\""%d\"",&n);\n    for(x=3;x<=n;x+=2)\n    {\n        for(i=2;i<=x/2;i++)\n           if(x%i==0)\n           break;\n\n        if(x/2<i)\n            t++;\n    }\n    printf(\""%d\\n\"",t);\n}\n\n\n\n\n\n\n\n\n\n\n\n\n\n",TIME_LIMIT_EXCEEDED,400,220
1590921231837233152,6933dcb3592e2d6f6fc887ed9a5537aab21a30f76450c9b5043f7776bfc39a59,2022-11-11 12:15:54,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nvoid main(){\n    int n,j=0;\n    scanf(\""%d\"",&n);\n    for(int i=1;i<=n;i++){\n        scanf(\""%d\"",&j);\n        if(i!=n){\n        if(j==0)\n            printf(\""1\\n\"");\n        else\n            printf(\""6\\n\"");\n        }else{\n            printf(\""6\"");\n        }\n    }\n}",ACCEPTED,8,500
1590921242213941248,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-11 12:15:56,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"\n#include<stdio.h>\nmain()\n{\n\tint a,i,j,m=0,flag=0;\n\tscanf(\""%d\"",&a);\n\tfor(i=2;i<=a;i++)\n\t\t{\n\t\tfor(j=2;j*j<=i;j++){\n\t\t\tif(i%j==0)\n\t\t\t\tbreak;\n\t\tif(i==j)\n\t\t\tm++;\n\t\t}\n       }\n\t\tprintf(\""%d\"",m);\n}\n",WRONG_ANSWER,9,324
1590921259247013888,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 12:16:00,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,int=x(50);\nint=y(60);\nint=z(40);\nprint(x+y-z),NON_ZERO_EXIT_CODE,17,3380
1590921372652580864,ce1bb8e96385d94dfdb2bd028407e2ffb5a64494440cd7964d6624a83809dae6,2022-11-11 12:16:27,Java,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"import java.util.*;\n\npublic class Main {\n\n        public static void main(String[] args) {\n\n            Scanner sc = new Scanner(System.in);\n\n            while(sc.hasNext()){\n\n                int n = sc.nextInt();\n\n                int c = sc.nextInt();\n\n \n\n                for(int j =0;j<n;j++){\n\n                    int b = sc.nextInt();\n\n                    if(b <= c){\n\n                        c += b;\n\n                    }else{\n\n                        int tmp = hightestCommon(b,c);\n\n                        c += tmp;\n\n                    }\n\n                }\n\n \n\n                System.out.println(c);\n\n            }\n\n        }\n\n        public static int hightestCommon(int b,int c){\n\n            if(c==0){\n\n                return b;\n\n            }\n\n \n\n            return hightestCommon(c,b%c);\n\n        }\n\n}",WRONG_ANSWER,125,16396
1590921402750906368,e715137eeb4190ade2330123b989bbdd6eebd9a5e1df2e292271d3bfe3a79c69,2022-11-11 12:16:34,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nvoid main()\n{\n    int n,m=6,i,j,k;\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++)\n    {\n        \n        scanf(\""%d\"",&j);\n        if(j!=0)\n            printf(i==n?\""%d\"":\""%d\\n\"",m);\n        else\n            printf(i==n?\""1\"":\""1\\n\"",m);\n    }\n}",ACCEPTED,9,328
1590921423919583232,2e4af98c441106efa9ee51f8a781d0eee91a3dff6193987d421eb3a48725c814,2022-11-11 12:16:40,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,#include <iostream>\n\n#define mani main\n#define mian main\n\nusing namespace std;\n\nint fun(int a);\n\nint main() {\n    //只存储个位数字 且为正整数\n    int x;\n    int n;\n    cin >> n;\n    for (int i = 0; i < n; ++i) {\n        cin >> x;\n        fun(x);\n    }\n    return 0;\n}\n\nint fun(int a) {\n    int t = 6;\n    for (int i = 0; i < a; ++i) {\n        t = (t * 6) % 10;\n    }\n    cout << t<<endl;\n},WRONG_ANSWER,13,444
1590921441502105600,129ddfe9d2d4553f365faf2fdc5e2f0c271b2e342a4cff13802dda8ef8b3d1c2,2022-11-11 12:16:44,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int a,b,c =0;\n        int n = s.nextInt();\n        a = s.nextInt();\n        b = s.nextInt();\n        c = s.nextInt();\n\n        System.out.print(\""6\\n6\\n6\"");\n    }\n}",WRONG_ANSWER,127,16532
1590921455993425920,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-11 12:16:47,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"\n#include<stdio.h>\nmain()\n{\n\tint a,i,j,m=0,flag=0;\n\tscanf(\""%d\"",&a);\n\tfor(i=2;i<=a;i++)\n\t\t{\n\t\tfor(j=2;j*j<=i;j++){\n\t\t\tif(i%j==0)\n            {break;flag=0;}\n\t\tif(flag)\n\t\t\tm++;\n\t\t}\n        flag=1;\n       }\n\t\tprintf(\""%d\"",m);\n}\n",WRONG_ANSWER,10,316
1590921457104916480,7c6d208c4c4b695bc8d6f8ae0c0357c2466f5c9f86ec0652674812219ac09d38,2022-11-11 12:16:47,Java,300.0,1590524835191705600,1572865591226855424,1049226928954454016,import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args)  {\n        Scanner sc  =  new Scanner(System.in);\n        int X = sc.nextInt();\n        int Y = sc.nextInt();\n        int Z = sc.nextInt();\n        System.out.println(X+Y-Z);\n\n    }\n},ACCEPTED,246,16412
1590921520749281280,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 12:17:03,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\ndate=map(int,input().split())\nfor i in range(a):\n    sum=2**date.__next__()\n    print(sum%10)",WRONG_ANSWER,15,2884
1590921529578270720,2e4af98c441106efa9ee51f8a781d0eee91a3dff6193987d421eb3a48725c814,2022-11-11 12:17:05,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,#include <iostream>\n\n#define mani main\n#define mian main\n\nusing namespace std;\n\nint fun(int a);\n\nint main() {\n    //只存储个位数字 且为正整数\n    int x;\n    int n;\n    cin >> n;\n    for (int i = 0; i < n; ++i) {\n        cin >> x;\n        fun(x);\n    }\n    return 0;\n}\n\nint fun(int a) {\n    int t = 6;\n    for (int i = 0; i < a; ++i) {\n        t = (t * 6) % 10;\n    }\n    cout << t;\n},WRONG_ANSWER,14,612
1590921530828173312,d122b81a371b28751082747cf65a235d0eddfd496e142775cd971d8f88adf327,2022-11-11 12:17:05,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int i,j;\n    int count=0;\n    int n=0;\n    scanf (\""%d\"",&n);\n    for(i=1;i<=n;i++){\n        for(j=2;j<i;j++){\n            if (i%j==0)\n                break;\n        }\n        if(i==j){\n            count++;\n        }\n    }\n  printf(\""%d\\n\"",count)  ;\n  return 0;  \n}",TIME_LIMIT_EXCEEDED,400,344
1590921543478194176,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 12:17:08,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\ndate=map(int,input().split())\nfor i in range(a):\n    sum=6**date.__next__()\n    print(sum%10)",TIME_LIMIT_EXCEEDED,36,3300
1590921562075758592,001baa7272d47ab2d3a9b57bf7838570ff03ab1cabb738e7b342b652b1e42a83,2022-11-11 12:17:12,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<bits/stdc++.h>\n\nusing namespace std;\n\n//  向上取整    向下取整\n//  ceil()       floor()\n\nint main() {\n    int t;\n    scanf(\""%d\"",&t);\n    int n;\n    for(int i=0;i<t;i++){\n        scanf(\""%d\"",&n);\n        if(i==(t-1)){\n            printf(\""6\"");\n        }else\n            printf(\""6\\n\"");\n    }\n    return 0;\n}\n",WRONG_ANSWER,10,452
1590921668527198208,129ddfe9d2d4553f365faf2fdc5e2f0c271b2e342a4cff13802dda8ef8b3d1c2,2022-11-11 12:17:38,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int[] a = new int[10];\n        int n = s.nextInt();\n\n        for (int i = 0; i < n; i++) {\n                a[i] = s.nextInt();\n            if(i == n - 1){\n                System.out.print(6);\n            }else{\n                System.out.println(6);\n            }\n        }\n\n    }\n},NON_ZERO_EXIT_CODE,262,19504
1590921702006128640,1019ea4e8e67338c8191b6e52878cb69ca9287130af71af3517596fded2f21e4,2022-11-11 12:17:46,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include<time.h>\n\nint main()\n{\n  srand((unsigned)time(NULL));\n  printf(\""%d\\n\"",rand()%10000);\n    return 0;\n}\n",WRONG_ANSWER,4,312
1590921702563975168,d122b81a371b28751082747cf65a235d0eddfd496e142775cd971d8f88adf327,2022-11-11 12:17:46,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int i,j;\n    int count=0;\n    int n=0;\n    scanf (\""%d\"",&n);\n    for(i=1;i<=n;i++){\n        for(j=2;j<i;j++){\n            if (i%j==0)\n                break;\n       else if(i==j)\n            count++;\n    }\n  printf(\""%d\\n\"",count)  ;\n  return 0;  \n}",COMPILE_ERROR,0,0
1590921717554413568,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 12:17:50,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a;\n    if(scanf(\""%d\"",&a)){\n    int i;\n    char b[1000000000];\n    for(i=0;i<a;i++){\n        if(scanf(\""%s\"",&b[i])){}\n    }\n        for(i=0;i<a;i++){\n            printf(\""6\"");\n            if(i<a-1){\n                printf(\""\\n\"");\n            }\n        }}\n    return 0;\n}",SEGMENTATION_FAULT,3,436
1590921777390358528,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 12:18:04,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\ndate=map(int,input().split())\nfor i in range(a):\n    sum=6**date.__next__()\n    print(sum%10)",TIME_LIMIT_EXCEEDED,36,3000
1590921835808600064,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 12:18:18,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\ndate=map(int,input().split())\nfor i in range(a):\n    sum=6**date.__next__()\n    print(sum%10)",TIME_LIMIT_EXCEEDED,36,3256
1590921858994737152,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 12:18:23,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\ndate=map(int,input().split())\nfor i in range(a):\n    sum=6**date.__next__()\n    print(sum%10)",TIME_LIMIT_EXCEEDED,35,3348
1590921874190700544,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 12:18:27,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a;\n    if(scanf(\""%d\"",&a)){\n    int i;\n    char b[10000];\n    for(i=0;i<a;i++){\n        if(scanf(\""%s\"",&b[i])){}\n    }\n        for(i=0;i<a;i++){\n            printf(\""6\"");\n            if(i<a-1){\n                printf(\""\\n\"");\n            }\n        }}\n    return 0;\n}",WRONG_ANSWER,10,324
1590921908512690176,910d600982c42b3bf326994e410e7a344f2438b451c8f7deb6f6a9f965d3ee41,2022-11-11 12:18:35,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int i,j,n,count1=0,count2=0;\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++)\n    {\n        for(j=1;j<=i;j++)\n        {\n            if(i%j==0)\n                count1++;\n        }\n        if(count1==2)\n            count2++;\n        count1=0;\n    }\n    printf(\""%d\\n\"",count2);\n}",TIME_LIMIT_EXCEEDED,400,356
1590921929903640576,2e4af98c441106efa9ee51f8a781d0eee91a3dff6193987d421eb3a48725c814,2022-11-11 12:18:40,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,#include <iostream>\n\n#define mani main\n#define mian main\n\nusing namespace std;\n\nint fun(int a);\n\nint main() {\n    //只存储个位数字 且为正整数\n    int x;\n    int n;\n    cin >> n;\n//    for (int i = 0; i < n; ++i) {\n//        cin >> x;\n//        fun(x);\n//    }\n    for (int i = 0; i < n; ++i) {\n        cout << 6 << endl;\n    }\n    return 0;\n}\n\n//int fun(int a) {\n//    int t = 6;\n//    for (int i = 0; i < a; ++i) {\n//        t = (t * 6) % 10;\n//    }\n//    cout << t<<endl;\n//},WRONG_ANSWER,12,440
1590921939139473408,1019ea4e8e67338c8191b6e52878cb69ca9287130af71af3517596fded2f21e4,2022-11-11 12:18:42,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include<time.h>\n\nint main()\n{\n  srand((unsigned)time(NULL));\n  printf(\""%d\\n\"",rand()%9000+1000);\n    return 0;\n}\n",WRONG_ANSWER,4,312
1590921964242382848,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-11 12:18:48,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,a[n];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n        printf(\""6\"");\n        printf(\""\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,10,344
1590921981040594944,0ccbaaa612b3d01dbe621ce5e7366d6e26d2e5adf55047d92c6eb7adf78a979d,2022-11-11 12:18:52,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main(void)\n{\n\tint n;\n\tcin>>n;\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tint t;cin>>t;\n\t\tlong long int temp = pow(6,t);\n\t\tstring s = to_string(temp);\n\t\tcout<<s.substr(s.size()-1)<<endl;\n\t} \n\treturn 0;\n}",WRONG_ANSWER,8,704
1590922011566739456,2e4af98c441106efa9ee51f8a781d0eee91a3dff6193987d421eb3a48725c814,2022-11-11 12:19:00,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,#include <iostream>\n\nusing namespace std;\n\nint fun(int a);\n\nint main() {\n    //只存储个位数字 且为正整数\n    int n;\n    cin >> n;\n//    for (int i = 0; i < n; ++i) {\n//        cin >> x;\n//        fun(x);\n//    }\n    for (int i = 0; i < n; ++i) {\n        cout << 6 << endl;\n    }\n    return 0;\n}\n\n//int fun(int a) {\n//    int t = 6;\n//    for (int i = 0; i < a; ++i) {\n//        t = (t * 6) % 10;\n//    }\n//    cout << t<<endl;\n//},WRONG_ANSWER,10,472
1590922013806473216,cf568c7ddc8b221335f880bfbaac4634294e65481e738a2e032c1ab9a84d576f,2022-11-11 12:19:00,Java,300.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.io.*;  //引入java的IO包\nimport  java.lang.Math.*;\nimport java.util.Scanner;\n\nclass Main{\n    public static void main(String[] args) throws IOException{\n     //判断数num是不是素数\n        Scanner sc=new Scanner(System.in);\n        int n=sc.nextInt();\n        int m=1;\n        int i;\n        for(int j=3;j<=n;j++)\n        {   for(i=2;i<=Math.sqrt(j);i++)\n            {\n                if(j%i==0){\n                   break;}\n            }\n          if(i>Math.sqrt(j)){\n                m++;}\n        }\n        System.out.println(m);\n    }\n},ACCEPTED,240,16660
1590922078923067392,5d127211f3edce9d9bd1062c03cd08473e4481ec46b4b0c70c2e8d9141c68f20,2022-11-11 12:19:16,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nvoid main()\n{\n    int i,j,n,num=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<n;i++)\n    {\n        for(j=2;j<i;j++)        \n        {\n            if(i%j==0)\n            break;\n        }\n            if(i==j)\n            num++;\n    }\n    printf(\""%d\"",num);\n}",TIME_LIMIT_EXCEEDED,400,324
1590922095104692224,e0a829315cc9947a3e714cd579e3322e8dee5f8ca36e30fd276de5a8e294b6f8,2022-11-11 12:19:20,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,3,320
1590922135042830336,910d600982c42b3bf326994e410e7a344f2438b451c8f7deb6f6a9f965d3ee41,2022-11-11 12:19:29,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int i,j,n,count1=0,count2=0;\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++)\n    {\n        for(j=1;j<=i;j++)\n        {\n            if(i%j==0)\n                count1++;\n        }\n        if(count1==2)\n            count2++;\n        count1=0;\n    }\n    printf(\""%d\\n\"",count2);\n}",TIME_LIMIT_EXCEEDED,400,184
1590922138394079232,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-11 12:19:30,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,a[n];\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        printf(\""6\"");\n        printf(\""\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,9,312
1590922149404127232,3dcf32868d7a750bb24733cc752e8b34486b532e90524d2606d8643387f183e4,2022-11-11 12:19:32,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"print(\""2022\"")",ACCEPTED,16,2884
1590922185055711232,7ecf54bf0ea2db8ab0397aa941f19ec79a351bc3e86e8c01673aa09a69b3a6db,2022-11-11 12:19:41,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"print(\""2022\"")",ACCEPTED,15,2916
1590922190344749056,7e6a67f270e740aba8788a12d9a49939621a28d5059d3ced2247a86914b0a3b3,2022-11-11 12:19:42,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main(){\n    int t,i,n,x;\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&n);\n        x=pow(6,n);\n        x=x%10;\n        printf(\""%d\\n\"",x);\n    }\n    return 0;\n}\n",WRONG_ANSWER,7,564
1590922191489798144,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-11 12:19:43,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main() {\n\tint n,k,flag=1,count=0,m,i;\n\tscanf(\""%d\"", &n);\n\tfor (m=2; m<=n; m++ ) {\n\t\tk=sqrt(m);\n\t\tfor(i=2;i<k;i++){\n\t\t\tif(m%i==0){\n\t\t\t\tflag=0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(flag)\n\t\tcount++;\t\t\n\t\tflag=1;\n\t}\n printf(\""%d\"",count);\n\treturn 0;\n}",WRONG_ANSWER,11,312
1590922208032108544,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-11 12:19:46,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n\nint main()\n\n{\n\n    int n,a[100],i,b[100];\n\n    scanf(\""%d\"",&n);\n\n    for(i=0;i<n;i++)\n\n    scanf(\""%d\"",&a[i]);\n\n    for(i=0;i<n;i++)\n\n    {\n\n    b[i]=pow(6,a[i]);\n\n    printf(\""%d\"",b[i]%10);\n\n    if(i!=n-1)\n\n    printf(\""\\n\"");\n\n    }\n\n    return 0;\n\n}",WRONG_ANSWER,6,348
1590922248507142144,129ddfe9d2d4553f365faf2fdc5e2f0c271b2e342a4cff13802dda8ef8b3d1c2,2022-11-11 12:19:56,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int[] a = new int[10];\n        int n = s.nextInt();\n\n        for (int i = 0; i < n; i++) {\n                a[i] = s.nextInt();\n\n        }\n        for (int j=0; j< n; j++) {\n            if(j == n - 1){\n                System.out.print(6);\n            }else{\n                System.out.println(6);\n            }\n        }\n    }\n},NON_ZERO_EXIT_CODE,239,19448
1590922314567454720,0ccbaaa612b3d01dbe621ce5e7366d6e26d2e5adf55047d92c6eb7adf78a979d,2022-11-11 12:20:12,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main(void)\n{\n\tint n;\n\tcin>>n;\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tint t;cin>>t;\n\t\tlong long int temp = pow(6,t);\n\t\tstring s = to_string(temp);\n\t\tcout<<s.substr(s.size()-1);\n\t\tif(i!=n-1) cout<<endl;\n\t} \n\treturn 0;\n}",WRONG_ANSWER,9,576
1590922346662244352,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-11 12:20:20,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,a[10];\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        printf(\""6\"");\n        printf(\""\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,10,352
1590922352945311744,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-11 12:20:21,Java,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int num = sc.nextInt();\n        int[] deBuff = new int[num];\n        int[] buff = new int[num];\n        int[] real = new int[num];\n        int temp = 0,max = 0;\n        for (int i = 0;i < num;i++) {\n            deBuff[i] = sc.nextInt();\n        }\n        for (int i = 0;i < num;i++) {\n            buff[i] = sc.nextInt();\n            real[i] = buff[i] - deBuff[i];\n        }\n        for (int i = 0;i < num;i++) {\n            if (real[i] > 0) {\n                for (int j = i;j < num;j++) {\n                    temp += real[j];\n                    if (temp > max) {\n                        max = temp;\n                    }\n                }\n            }\n        }\n        System.out.println(max);\n    }\n}\n",WRONG_ANSWER,120,16892
1590922355851988992,0ccbaaa612b3d01dbe621ce5e7366d6e26d2e5adf55047d92c6eb7adf78a979d,2022-11-11 12:20:22,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main(void)\n{\n\tint n;\n\tcin>>n;\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tint t;cin>>t;\n\t\tlong long int temp = pow(6,t);\n\t\tstring s = to_string(temp);\n\t\tcout<<s.substr(s.size()-1);\n\t\tif(i!=n-1) cout<<endl;\n\t} \n\treturn 0;\n}",WRONG_ANSWER,6,452
1590922368304873472,d54b7e24c90cf40d468bdeb018e61440010a1049a4ae96e2c6331c215521f91c,2022-11-11 12:20:25,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main()\n{\n\tint t,n,i,a,j=0;\n\t\n\tscanf(\""%d\"",&t);\n\t\n\twhile(j<t)\n\t{\n\t\tscanf(\""%d\"",&n);\n\t\ta = pow(6,n);\n\t\tprintf(\""%d\\n\"",a%10);\n\t\tj++;\n        a=1;\n\n\t}\n\t\n}",WRONG_ANSWER,7,196
1590922392707313664,73af9d5098be5d450fba728363c8fdbe0f6a5526466daa2f3b74abf1acf75527,2022-11-11 12:20:30,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n, i;\n    int acquire[10000], consume[10000], sum = 0, s;\n    scanf(\""%d\"", &n);\n    for (i = 0; i < n; i++)\n    {\n        scanf(\""%d\"", &consume[i]);\n    }\n    for (i = 0; i < n; i++)\n    {\n        scanf(\""%d\"", &acquire[i]);\n    }\n    int max = acquire[0] - consume[0];\n    for (i = 0; i < n; i++)\n    {\n        s = acquire[i] - consume[i];\n        sum = sum + s;\n        if (sum < 0)sum = 0;\n        if (sum > max)\n            max = sum;\n\n    }\n   \n    \n    printf(\""%d\"", max);\n    return 0;\n}",ACCEPTED,3,184
1590922421186662400,3dcf32868d7a750bb24733cc752e8b34486b532e90524d2606d8643387f183e4,2022-11-11 12:20:37,C++,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include \""bits/stdc++.h\""\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> PII;\n#define rep(i,a,n) for(int i = a; i < n; i++)\n#define per(i,n,a) for(int i = n-1; i >= a; i--)\n#define debug(a) printf(\""#: %d \"",a);\n#define fr first\n#define se second\n#define be begin()\n#define ed end()\n#define pb push_back\n#define mk make_pair\n#define pf printf\n#define ins insert\n#define sz size()\n//#define int long long\n#define mem(a,i) memset(a,i,sizeof (a))\n\n//char buf[1<<23],*p1=buf,*p2=buf;\n//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)\n//inline ll read()\n//{\n//    int s=0;\n//    char ch = getchar(),last;\n//    while(ch<'0'||ch>'9') last = ch, ch = getchar();\n//    while(ch>='0'&&ch<='9') s=(s<<1)+(s<<3)+(ch^48),ch=getchar();\n//    return last=='-'?-s:s;\n//}\n\ninline ll read(){\n    ll x = 0,f = 1;\n    char ch = getchar();\n    while(ch < '0'||ch > '9'){\n        if(ch == '-')\n            f = -1;\n        ch = getchar();\n    }\n    while(ch >= '0' && ch <= '9'){\n        x = (x << 1)+(x << 3)+(ch^48);\n        ch = getchar();\n    }\n    return x*f;\n}\nconst int MOD = 1000000007;\nll INF = 1e18;\nll gcd(ll a,ll b){\n    return b ? gcd(b,a%b) : a;\n}\nconst int N = 3e5 + 10;\n//struct edge{\n//    int to,next,w;\n//}eg[N];+\n//bool st[N];\n//void add(int u,int v,int w){\n//    eg[++tot].w = w;eg[tot].to = v;eg[tot].next = head[u];head[u] = tot;\n//}\n\n//int C[100010][3];\n//void Cn(){\n//    for(int i=0;i<100010;i++)for(int j = 0;j <= 2;j++)if(!j) C[i][j] = 1;else C[i][j] = (C[i-1][j]+C[i-1][j-1]);\n//}\nll lowbit(ll x){\n    return x%(-x);\n}\nll a[N];\nvoid solve(){\n    ll n = read(),m = read(), k = read();\n    printf(\""%lld\\n\"",n + m - k);\n\n}\nsigned  main(){\n//    ll t = read();\n//    while(t--)\n        solve();\n}\n",ACCEPTED,7,440
1590922439545131008,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-11 12:20:42,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n\nint main()\n\n{\n\n    int n,a[100],i,b[100];\n\n    scanf(\""%d\"",&n);\n\n    for(i=0;i<n;i++)\n\n    scanf(\""%d\"",&a[i]);\n\n    for(i=0;i<n;i++)\n\n    {\n\n    b[i]=pow(6,a[i]);\n\n    printf(\""%d\"",b[i]%10);\n\n    if(i!=n-1)\n\n    printf(\""\\n\"");\n\n    }\n\n    return 0;\n\n}",WRONG_ANSWER,6,356
1590922441503866880,e715137eeb4190ade2330123b989bbdd6eebd9a5e1df2e292271d3bfe3a79c69,2022-11-11 12:20:42,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nvoid main()\n{\n    int i,j,k=1,n,a=1,b;\n    scanf(\""%d\"",&n);\n    for(i=3;i<=n;i++)\n    {\n        a=1;\n        for(j=2;j<i;j++)\n        {\n            if(i%j==0)\n            {\n                a=0;\n            }\n        }\n        if(a)\n            k++;\n    }\n    printf(\""%d\\n\"",k);\n}",TIME_LIMIT_EXCEEDED,400,200
1590922476765360128,001baa7272d47ab2d3a9b57bf7838570ff03ab1cabb738e7b342b652b1e42a83,2022-11-11 12:20:51,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include <iostream>\n#include<bits/stdc++.h>\n\nusing namespace std;\n\n//  向上取整    向下取整\n//  ceil()       floor()\n\nint main() {\n    int t;\n    scanf(\""%d\"",&t);\n    int n;\n    for(int i=0;i<t;i++){\n        scanf(\""%d\"",&n);\n        if(i==(t-1)){\n            printf(\""6\"");\n        }else\n            printf(\""6\\n\"");\n    }\n    return 0;\n}\n",WRONG_ANSWER,11,472
1590922548362149888,0ccbaaa612b3d01dbe621ce5e7366d6e26d2e5adf55047d92c6eb7adf78a979d,2022-11-11 12:21:08,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main(void)\n{\n\tlong long int n;\n\tcin>>n;\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tlong long int t;cin>>t;\n\t\tlong long int temp = pow(6,t);\n\t\tstring s = to_string(temp);\n\t\tcout<<s.substr(s.size()-1);\n\t\tif(i!=n-1) cout<<endl;\n\t} \n\treturn 0;\n}",WRONG_ANSWER,6,324
1590922556784291840,9819f13d6a58d50fa249ad037641119dadb52afb3f125db258771564f27d2ca5,2022-11-11 12:21:10,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main(){\n    printf(\""2022\\n\"");\n    return 0;\n}",ACCEPTED,3,180
1590922597662003200,7ecf54bf0ea2db8ab0397aa941f19ec79a351bc3e86e8c01673aa09a69b3a6db,2022-11-11 12:21:19,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,x = int(input())\ny = int(input())\nz = int(input())\nprint(x+y-z),NON_ZERO_EXIT_CODE,15,2996
1590922640154497024,3dcf32868d7a750bb24733cc752e8b34486b532e90524d2606d8643387f183e4,2022-11-11 12:21:29,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include \""bits/stdc++.h\""\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> PII;\n#define rep(i,a,n) for(int i = a; i < n; i++)\n#define per(i,n,a) for(int i = n-1; i >= a; i--)\n#define debug(a) printf(\""#: %d \"",a);\n#define fr first\n#define se second\n#define be begin()\n#define ed end()\n#define pb push_back\n#define mk make_pair\n#define pf printf\n#define ins insert\n#define sz size()\n//#define int long long\n#define mem(a,i) memset(a,i,sizeof (a))\n\n//char buf[1<<23],*p1=buf,*p2=buf;\n//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)\n//inline ll read()\n//{\n//    int s=0;\n//    char ch = getchar(),last;\n//    while(ch<'0'||ch>'9') last = ch, ch = getchar();\n//    while(ch>='0'&&ch<='9') s=(s<<1)+(s<<3)+(ch^48),ch=getchar();\n//    return last=='-'?-s:s;\n//}\n\ninline ll read(){\n    ll x = 0,f = 1;\n    char ch = getchar();\n    while(ch < '0'||ch > '9'){\n        if(ch == '-')\n            f = -1;\n        ch = getchar();\n    }\n    while(ch >= '0' && ch <= '9'){\n        x = (x << 1)+(x << 3)+(ch^48);\n        ch = getchar();\n    }\n    return x*f;\n}\nconst int MOD = 1000000007;\nll INF = 1e18;\nll gcd(ll a,ll b){\n    return b ? gcd(b,a%b) : a;\n}\nconst int N = 3e5 + 10;\n//struct edge{\n//    int to,next,w;\n//}eg[N];+\n//bool st[N];\n//void add(int u,int v,int w){\n//    eg[++tot].w = w;eg[tot].to = v;eg[tot].next = head[u];head[u] = tot;\n//}\n\n//int C[100010][3];\n//void Cn(){\n//    for(int i=0;i<100010;i++)for(int j = 0;j <= 2;j++)if(!j) C[i][j] = 1;else C[i][j] = (C[i-1][j]+C[i-1][j-1]);\n//}\nll lowbit(ll x){\n    return x%(-x);\n}\nll a[N];\nvoid solve(){\n   ll n = read();\n   if(n == 0)puts(\""1\"");\n   else puts(\""6\"");\n\n}\nsigned  main(){\n    ll t = read();\n    while(t--)\n        solve();\n}\n",ACCEPTED,11,452
1590922643275055104,70c675ddfcb60b2192bc8ac38fb068fec0500208a5bf97a796c7cc074b43cf87,2022-11-11 12:21:30,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner myScanner = new Scanner(System.in);\n\t\tint n = myScanner.nextInt();\n\t\tint[] arr = new int[n];\n\t\tint x=6;\n\t\tif(n == 0) {\n\t\t\tx = 1;\n\t\t\tSystem.out.printf(\""%d\"",x);\n\t\t}\n\t\tfor(int i = 0;i < n;i++) {\n\t\t\tint a = myScanner.nextInt();\n\t\t\tarr[i] = a;\n\t\t\tif(i < n-1)\n\t\t\tSystem.out.println(x);\n\t\t\tif(i == n-1) {\n\t\t\t\tSystem.out.printf(\""%d\"",x);\n\t\t\t\t}\n\t\t}\n\t}\n\n}",NON_ZERO_EXIT_CODE,249,18848
1590922669325877248,0b693affc66d8d407ff008bd1aaf4f2feb4a615f057943ba4b4ba3163d937dc6,2022-11-11 12:21:36,Java,300.0,1590528927448293376,1590525945717575680,1049226928954454016,import java.io.*;\nimport java.util.*;\n\npublic class Main {\n\n    public static void main(String[] args) throws IOException {\n        System.out.println(2022);\n    }\n\n    /*private static boolean isZHI(int n) {\n        for (int i = 2; i <n/2+1 ; i++) {\n            if (n%i==0)\n                return false;\n        }\n        return true;//是质数\n    }*/\n\n\n},ACCEPTED,69,14492
1590922697557741568,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-11 12:21:43,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,a[10];\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        printf(\""6\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,9,188
1590922783687749632,d122b81a371b28751082747cf65a235d0eddfd496e142775cd971d8f88adf327,2022-11-11 12:22:04,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int i,j;\n    int count=0;\n    int n=0;\n    scanf (\""%d\"",&n);\n    for(i=1;i<=n;i++){\n        for(j=2;j<i;j++){\n            if (i%j==0)\n                break;\n        }\n        if(i==j)\n        {\n            count++;\n        }\n    }\n  printf(\""%d\\n\"",count)  ;\n  return 0;  \n}",TIME_LIMIT_EXCEEDED,400,320
1590922865308905472,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 12:22:23,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\ndate=list(map(int,input().split()))\nfor i in range(a):\n\n    if date[1]==0:\n        print(1)\n    else:\n        print(6)",WRONG_ANSWER,47,3008
1590922901849702400,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 12:22:32,Python,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\ndate=list(map(int,input().split()))\nfor i in range(a):\n\n    if date[i]==0:\n        print(1)\n    else:\n        print(6)",ACCEPTED,44,2756
1590922992744468480,2e4af98c441106efa9ee51f8a781d0eee91a3dff6193987d421eb3a48725c814,2022-11-11 12:22:54,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,#include <iostream>\n\nusing namespace std;\n\nint main() {\n    int x;\n    int n;\n    cin >> n;\n    for (int i = 0; i < n; ++i) {\n        cin >> x;\n        cout << 6 << endl;\n    }\n    return 0;\n}\n\n,WRONG_ANSWER,11,496
1590923031193653248,001baa7272d47ab2d3a9b57bf7838570ff03ab1cabb738e7b342b652b1e42a83,2022-11-11 12:23:03,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include <iostream>\n#include<bits/stdc++.h>\n\nusing namespace std;\n\n//  向上取整    向下取整\n//  ceil()       floor()\n\nint main() {\n    int t;\n    cin>>t;\n    int n;\n    for(int i=0;i<t;i++){\n        cin>>n;\n        if(i==(t-1)){\n            printf(\""6\"");\n        }else\n            printf(\""6\\n\"");\n    }\n    return 0;\n}\n",WRONG_ANSWER,13,460
1590923037577379840,129ddfe9d2d4553f365faf2fdc5e2f0c271b2e342a4cff13802dda8ef8b3d1c2,2022-11-11 12:23:04,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int[] a = new int[10];\n        int n = s.nextInt();\n            for (int i = 0; i < n; i++) {\n                a[i] = s.nextInt();\n            }\n        for (int j=0; j< n; j++) {\n\n            if(j == n - 1){\n\n                System.out.print(6);\n            }else{\n                System.out.println(6);\n            }\n        }\n    }\n},NON_ZERO_EXIT_CODE,253,19024
1590923038286221312,9819f13d6a58d50fa249ad037641119dadb52afb3f125db258771564f27d2ca5,2022-11-11 12:23:04,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main(){\n    int a, b, c;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    printf(\""%d\\n\"",a+b-c);\n    return 0;\n}",ACCEPTED,6,324
1590923050407735296,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-11 12:23:07,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n#include<iostream>9\nint main() {\n\tint n,k,flag=1,count=0,m,i;\n\tscanf(\""%d\"",&n);\n\tfor (m=2; m<=n; m++ ) {\n\t\tk=sqrt(m);\n\t\tfor(i=2;i<=k;i++){\n\t\t\tif(m%i==0){\n\t\t\t\tflag=0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(flag)\n\t\tcount++;\t\t\n\t\tflag=1;\n\t}\n printf(\""%d\"",count);\n\treturn 0;\n}",COMPILE_ERROR,0,0
1590923091579043840,e0a829315cc9947a3e714cd579e3322e8dee5f8ca36e30fd276de5a8e294b6f8,2022-11-11 12:23:17,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n    int a,b,c,e;\n    if(a<=100&&a>=0 || b<=100&&b>=0 || c<=100&&c>=0)\n    {\n        e=a+b-c;\n    }\n    printf(\""%d\"",e);\n    return 0;\n}",WRONG_ANSWER,3,340
1590923119274012672,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-11 12:23:24,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n#include<iostream>\nint main() {\n\tint n,k,flag=1,count=0,m,i;\n\tscanf(\""%d\"",&n);\n\tfor (m=2; m<=n; m++ ) {\n\t\tk=sqrt(m);\n\t\tfor(i=2;i<=k;i++){\n\t\t\tif(m%i==0){\n\t\t\t\tflag=0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(flag)\n\t\tcount++;\t\t\n\t\tflag=1;\n\t}\n printf(\""%d\"",count);\n\treturn 0;\n}",COMPILE_ERROR,0,0
1590923154380361728,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-11 12:23:32,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main() {\n\tint n,k,flag=1,count=0,m,i;\n\tscanf(\""%d\"",&n);\n\tfor (m=2; m<=n; m++ ) {\n\t\tk=sqrt(m);\n\t\tfor(i=2;i<=k;i++){\n\t\t\tif(m%i==0){\n\t\t\t\tflag=0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(flag)\n\t\tcount++;\t\t\n\t\tflag=1;\n\t}\n printf(\""%d\"",count);\n\treturn 0;\n}",ACCEPTED,13,324
1590923215575257088,2e4af98c441106efa9ee51f8a781d0eee91a3dff6193987d421eb3a48725c814,2022-11-11 12:23:47,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <iostream>\n\nusing namespace std;\n\nint main() {\n    unsigned int x;\n    int n;\n    cin >> n;\n    for (int i = 0; i < n; ++i) {\n        cin >> x;\n        printf(\""%d\"",6);\n    }\n    return 0;\n}\n\n",WRONG_ANSWER,12,440
1590923253160415232,e715137eeb4190ade2330123b989bbdd6eebd9a5e1df2e292271d3bfe3a79c69,2022-11-11 12:23:56,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nvoid main()\n{\n    int i,j,k=1,n,a=1,b;\n    scanf(\""%d\"",&n);\n    for(i=3;i<=n;i++)\n    {\n        a=1;\n        for(j=2;j<i/2+1;j++)\n        {\n            if(i%j==0)\n            {\n                a=0;\n            }\n        }\n        if(a)\n            k++;\n    }\n    printf(\""%d\\n\"",k);\n}",TIME_LIMIT_EXCEEDED,400,188
1590923342406791168,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-11 12:24:17,Java,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int num = sc.nextInt();\n        int[] deBuff = new int[num];\n        int[] buff = new int[num];\n        int[] real = new int[num];\n        int temp = 0,max = 0;\n        for (int i = 0;i < num;i++) {\n            deBuff[i] = sc.nextInt();\n        }\n        for (int i = 0;i < num;i++) {\n            buff[i] = sc.nextInt();\n            real[i] = buff[i] - deBuff[i];\n        }\n        for (int i = 0;i < num;i++) {\n            temp += real[i];\n            if (temp < 0)\n                temp = 0;\n            if (max < temp)\n                max = temp;\n        }\n        System.out.println(max);\n    }\n}\n",ACCEPTED,127,18072
1590923349138673664,7e6a67f270e740aba8788a12d9a49939621a28d5059d3ced2247a86914b0a3b3,2022-11-11 12:24:19,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main(){\n    int t,i,n,x;\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&n);\n        if(n>=0&&n<=1e9)\n        {\n            x=pow(6,n);\n            x=x%10;\n            printf(\""%d\\n\"",x);\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,6,324
1590923349952368640,e0a829315cc9947a3e714cd579e3322e8dee5f8ca36e30fd276de5a8e294b6f8,2022-11-11 12:24:19,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n    int a,b,c,e;\n    scanf(\""%d%d%d\"",&a,&b,&c);\n    if(a<=100&&a>=0 || b<=100&&b>=0 || c<=100&&c>=0)\n    {\n        e=a+b-c;\n    }\n    printf(\""%d\"",e);\n    return 0;\n}",ACCEPTED,6,332
1590923360421326848,6ba5ecacf3381a1e9382f99c413290eca40a071a563a618e5f36d66cbf9a5e1b,2022-11-11 12:24:21,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\tlong long int t,j,u=0;\n\tint isprime(int n);\n\tscanf(\""%lld\"",&t);\n\tfor(j=1;j<=t;j++)\n\t{\n\t\tif (isprime(j)==1) u++;\n\t}\n\tprintf(\""%lld\\n\"",u);\n\treturn 0;\n}\n\nint isprime(int n)\n{\n\tint i;\n\tif(n==2) return 1;\n\telse if(n==1||n%2==0) return 0;\n\tfor (i=3;i<=sqrt(n)+1;i+=2)\n\t{\n\t\tif(n%i==0) return 0;\n\t}\n\treturn 1;\n}\n",ACCEPTED,11,320
1590923395196301312,2e4af98c441106efa9ee51f8a781d0eee91a3dff6193987d421eb3a48725c814,2022-11-11 12:24:30,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <iostream>\n\nusing namespace std;\n\nint main() {\n    double x;\n    int n;\n    cin >> n;\n    for (int i = 0; i < n; ++i) {\n        cin >> x;\n        printf(\""%d\"",6);\n    }\n    return 0;\n}\n\n",WRONG_ANSWER,10,448
1590923428113223680,7ecf54bf0ea2db8ab0397aa941f19ec79a351bc3e86e8c01673aa09a69b3a6db,2022-11-11 12:24:37,Python,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"x,y,z = input().split()\nprint(int(x)+int(y)-int(z))",ACCEPTED,37,2884
1590923441174261760,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-11 12:24:40,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[100],i,b[100];\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    b[i]=pow(6,a[i]);\n    printf(\""%d\"",b[i]%10);\n    if(i!=n-1)\n    printf(\""\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,7,312
1590923451521634304,129ddfe9d2d4553f365faf2fdc5e2f0c271b2e342a4cff13802dda8ef8b3d1c2,2022-11-11 12:24:43,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int[] a = {0,0,0};\n        int n = s.nextInt();\n            for (int i = 0; i < n; i++) {\n                a[i] = s.nextInt();\n            }\n        for (int j=0; j< n; j++) {\n\n            if(j == n - 1){\n\n                System.out.print(6);\n            }else{\n                System.out.println(6);\n            }\n        }\n    }\n}",WRONG_ANSWER,123,16652
1590923484983767040,1019ea4e8e67338c8191b6e52878cb69ca9287130af71af3517596fded2f21e4,2022-11-11 12:24:51,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include<time.h>\n\nint main()\n{\n    int n;\n  srand((unsigned)time(NULL));\n  n=rand()%10000;\n  printf(\""%d\\n\"",n);\n    return 0;\n}\n",WRONG_ANSWER,3,308
1590923526318657536,0cfbb4a339ebbc4dce13b5f3e3f98a3def0ab17ef5b4ac8e6d566de92e1f5f78,2022-11-11 12:25:01,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main(){\n    printf(\""2022\"");\n}",ACCEPTED,4,352
1590923558405083136,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 12:25:08,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a;\n    if(scanf(\""%d\"",&a)){\n    int i,n;\n        for(int j=0;j<a;j++){\n            scanf(\""%d\"",&n);\n        }\n        for(i=0;i<a;i++){\n            printf(\""6\"");\n            if(i<a-1){\n                printf(\""\\n\"");\n            }\n        }}\n    return 0;\n}",WRONG_ANSWER,9,312
1590923581519888384,c5cc6f9845df4bd1986af86c0696296436bbc0f00a10a9f891b4100e57bc3a19,2022-11-11 12:25:14,C++,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <bits/stdc++.h>\nusing namespace std;\n#define N 1000\nint main()\n{\n\tint n;\n\tint a[N],b[N];\n\tcin>>n;\n\tfor(int i=0;i<n;i++) cin>>a[i];\n\tfor(int i=0;i<n;i++) {\n\t\tcin>>b[i];\n\t\ta[i]=b[i]-a[i];\n\t}\n\tint maxx=0;\n\tfor(int i=0;i<n;i++){\n\t\tint sum=0,m=0;\n\t\tfor(int j=i;j<n;j++){\n\t\t\tsum+=a[j];\n\t\t\tif(sum>m) m=sum;\n\t\t}\n\t\tif(m>maxx) maxx=m;\n\t}\n\tcout<<maxx<<endl;\n}",ACCEPTED,3,484
1590923592706101248,7c6d208c4c4b695bc8d6f8ae0c0357c2466f5c9f86ec0652674812219ac09d38,2022-11-11 12:25:17,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args)  {\n        Scanner sc  =  new Scanner(System.in);\n        int a = sc.nextInt();\n        int[] arr = new int[a];\n        for (int i = 0; i < a; i++) {\n            int b = sc.nextInt();\n            arr[i] = b;\n        }\n        for (int i = 0; i < arr.length; i++) {\n            System.out.println((int)((Math.pow(6,arr[i]))%10));\n        }\n    }\n}\n",NON_ZERO_EXIT_CODE,242,19404
1590923640089128960,7ecf54bf0ea2db8ab0397aa941f19ec79a351bc3e86e8c01673aa09a69b3a6db,2022-11-11 12:25:28,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"print(\""6\"")",WRONG_ANSWER,18,2872
1590923653326376960,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 12:25:31,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a;\n    if(scanf(\""%d\"",&a)){\n    int i,n;\n        for(int j=0;j<a;j++){\n            if(scanf(\""%d\"",&n)){}\n        }\n        for(i=0;i<a;i++){\n            printf(\""6\"");\n            if(i<a-1){\n                printf(\""\\n\"");\n            }\n        }}\n    return 0;\n}",WRONG_ANSWER,10,336
1590923845547110400,fa305ee4bf4c6a54add4e945b551f1e902b95c1a179a91ded55bf7ebb1c87c23,2022-11-11 12:26:17,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{   int i,j,n,s=0;\n    scanf(\""%d\"",&n);\n    for (i=2;i<=n;i++) {\n            int flag=1;\n          for (j=2;j<i;j++) {\n            if (i%j==0)\n            flag=0;\n        }\n      if(flag==1) s++;\n     }\n    printf(\""%d\\n\"",s);\n    return 0;\n}",TIME_LIMIT_EXCEEDED,400,336
1590923865734295552,910d600982c42b3bf326994e410e7a344f2438b451c8f7deb6f6a9f965d3ee41,2022-11-11 12:26:22,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nmain()\n{\n    int i,j,n,count1=0,count2=0;\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i+=2)\n    {\n        for(j=1;j<=sqrt(i);j++)\n        {\n            if(i%j==0)\n                count1++;\n        }\n        if(count1==1)\n            count2++;\n        count1=0;\n    }\n    printf(\""%d\\n\"",count2);\n}",ACCEPTED,29,316
1590923881123217408,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-11 12:26:25,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[100],i,b[100];\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    b[i]=6;\n    printf(\""%d\"",b[i]);\n    if(i!=n-1)\n    printf(\""\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,10,324
1590923898907045888,0ccbaaa612b3d01dbe621ce5e7366d6e26d2e5adf55047d92c6eb7adf78a979d,2022-11-11 12:26:30,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,#include<bits/stdc++.h>\nusing namespace std;\nint main(void)\n{\n\tint n;\n\tcin>>n;\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tint t;\n\t\tif(t) cout<<6<<endl;\n\t\telse cout<<1<<endl;\n\t}\n\treturn 0;\n},WRONG_ANSWER,3,328
1590923926572699648,001baa7272d47ab2d3a9b57bf7838570ff03ab1cabb738e7b342b652b1e42a83,2022-11-11 12:26:36,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include <iostream>\n#include<bits/stdc++.h>\n\nusing namespace std;\n\n//  向上取整    向下取整\n//  ceil()       floor()\n\nint main() {\n    int t;\n    cin>>t;\n    int n;\n    for(int i=0;i<t;i++){\n        cin>>n;\n        if(n==0) n=1;\n        else n=6;\n        if(i==(t-1)){\n            printf(\""%d\"",n);\n        }else\n            printf(\""%d\\n\"",n);\n    }\n    return 0;\n}\n",ACCEPTED,11,452
1590923942729134080,5d25e51c02c08da2e0946483619d6f75981ff1037e5bbe3f3e4a71eeb2de4c8a,2022-11-11 12:26:40,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int x,i,j;\n    scanf(\""%d\"",&x);\n    int m[x],n[x];\n    for(i=0;i<x;i++)\n    {\n        scanf(\""%d\"",&m[i]);\n    }\n    for(i=0;i<x;i++)\n    {\n        n[i]=6;\n    }\n    for(i=0;i<x;i++)\n    {\n        for(j=1;j<m[i];j++)\n        {\n            n[i]=n[i]*6;\n        }\n\n    }\n    for(i=0;i<x;i++)\n    {\n        printf(\""%d\\n\"",n[i]%10);\n    }\n\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,23,320
1590924016439857152,458af3c005e0b282d1ca88c254d9910ee2d93738b6f06d399f7444e1e64831eb,2022-11-11 12:26:58,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,printf(2022);,COMPILE_ERROR,0,0
1590924084475662336,0ccbaaa612b3d01dbe621ce5e7366d6e26d2e5adf55047d92c6eb7adf78a979d,2022-11-11 12:27:14,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main(void)\n{\n\tint n;\n\tcin>>n;\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tint t;\n\t\tif(!t) cout<<\""6\""<<endl;\n\t\telse cout<<\""1\""<<endl;\n\t}\n\treturn 0;\n}",WRONG_ANSWER,10,452
1590924157011955712,7c6d208c4c4b695bc8d6f8ae0c0357c2466f5c9f86ec0652674812219ac09d38,2022-11-11 12:27:31,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import javax.xml.transform.Source;\nimport java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args)  {\n        Scanner sc  =  new Scanner(System.in);\n        int a = sc.nextInt();\n        int[] arr = new int[a];\n        for (int i = 0; i < a; i++) {\n            int b = sc.nextInt();\n            arr[i] = b;\n        }\n        for (int i = 0; i < arr.length; i++) {\n            if (arr[i] == 0){\n                System.out.println(1);\n            }else {\n                System.out.println(6);\n            }\n        }\n    }\n}\n,NON_ZERO_EXIT_CODE,232,16440
1590924191296196608,fec6d07e317796c63fb7ae6e7538f75973ad64af6e6196cc27eed3e9e685bf86,2022-11-11 12:27:39,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nvoid main()\n{\n    int x,i,t=1,n;\n    scanf(\""%d\"",&n);\n    for(x=3;x<=n;x+=2)\n    {\n        for(i=2;i<=x/2;i++)\n            if(x%i==0)\n                break;\n        if(i>x/2)\n            t++;\n    }\n    printf(\""%d\\n\"",t);\n}\n\n\n\n\n\n\n\n\n\n\n\n\n\n",TIME_LIMIT_EXCEEDED,400,192
1590924225567850496,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-11 12:27:47,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[100],i,b[100];\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    b[i]=pow(6,a[i]);\n    printf(\""%d\"",b[i]%10);\n    if(i!=n-1)\n    printf(\""\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,6,316
1590924231238553600,7e6a67f270e740aba8788a12d9a49939621a28d5059d3ced2247a86914b0a3b3,2022-11-11 12:27:49,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main(){\n    int t,i,n,x;\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&n);\n        if(n>=0&&n<=1e9)\n        {\n            x=pow(6,n);\n            x=x%10;\n            printf(\""%d\"",x);\n            if(i!=t-1) printf(\""\\n\"");\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,8,564
1590924235336364032,458af3c005e0b282d1ca88c254d9910ee2d93738b6f06d399f7444e1e64831eb,2022-11-11 12:27:50,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"printf(\""2022\"");",COMPILE_ERROR,0,0
1590924245704683520,129ddfe9d2d4553f365faf2fdc5e2f0c271b2e342a4cff13802dda8ef8b3d1c2,2022-11-11 12:27:52,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int[] a = {0,0,0,0,0,0};\n        int n = s.nextInt();\n        for (int i = 0; i < n; i++) {\n                a[i] = s.nextInt();\n        }\n        for (int j=0; j< n; j++) {\n            if(j == n - 1){\n                System.out.print(6);\n            }else{\n                System.out.println(6);\n            }\n        }\n    }\n}",NON_ZERO_EXIT_CODE,236,16456
1590924346057601024,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 12:28:16,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t = 0;\n    while(scanf(\""%d\"",&t) == 1)\n    {\n        int n = 0;\n        scanf(\""%d\"",&n);\n        int sum = pow(6,n);\n        int num = sum % 10;\n        printf(\""%d\\n\"",num);\n    }\n    return 0;\n}",WRONG_ANSWER,4,352
1590924347638878208,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 12:28:17,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main(){\n  int i,j,n,k=0;\n  scanf(\""%d\"",&n);\n\n    for(i=2;i<n;i++)\n   {\n    for(j=2;j<=(int)sqrt(i);j++)\n        {\n      if (i%j==0)\n       break;\n    }\nif(j>(int)sqrt(i))\n    k++;\n  }\n  printf(\""%d\"",k);\n  return 0;\n}\n",ACCEPTED,13,320
1590924353775140864,0aa773cdb5cb621d4131c7d2b98b0724b7e9e93f4310c787c0a9a219d05e0ff2,2022-11-11 12:28:18,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h.>\nint main()\n{printf(\""2022\"");\n    return 0;\n }\n",COMPILE_ERROR,0,0
1590924391523856384,458af3c005e0b282d1ca88c254d9910ee2d93738b6f06d399f7444e1e64831eb,2022-11-11 12:28:27,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"a=2022\nprintf(\""%d\"",a);",COMPILE_ERROR,0,0
1590924410154979328,7ecf54bf0ea2db8ab0397aa941f19ec79a351bc3e86e8c01673aa09a69b3a6db,2022-11-11 12:28:31,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,n = int(input())\nif(n==0):\n    print('1')\nelse:\n    print('6'),WRONG_ANSWER,15,3024
1590924425254449152,9aa17e95021225dcdd2b01419b021cd002e47f9a7854274df042f64621bd207a,2022-11-11 12:28:35,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n    int n,a;\n    scanf(\""%d\"",&n);\n    for(a=1;a<=n;a++)\n    {\n     printf(\""6\\n\"");\n    }\nreturn 0;\n}\n\n",WRONG_ANSWER,7,196
1590924454572658688,6933dcb3592e2d6f6fc887ed9a5537aab21a30f76450c9b5043f7776bfc39a59,2022-11-11 12:28:42,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nvoid main(){\n    int n,i,j,k,result=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<n;i++){\n        for(j=2,k=1;j<i;j++){\n            if(i%j==0){\n                \n                k=0;\n            }\n        }\n        if(k){\n            \n            result++;\n        }\n    }\n    printf(\""%d\"",result);\n}",TIME_LIMIT_EXCEEDED,400,328
1590924505428594688,0ccbaaa612b3d01dbe621ce5e7366d6e26d2e5adf55047d92c6eb7adf78a979d,2022-11-11 12:28:54,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main(void)\n{\n\tint n;\n\tcin>>n;\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tint t;cin>>t;\n\t\tif(t) cout<<\""6\""<<endl;\n\t\telse cout<<\""1\""<<endl;\n\t}\n\treturn 0;\n}",ACCEPTED,11,440
1590924533689790464,7ecf54bf0ea2db8ab0397aa941f19ec79a351bc3e86e8c01673aa09a69b3a6db,2022-11-11 12:29:01,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,n = int(input())\nif(n==0):\n    print(1)\nelse:\n    print(6),WRONG_ANSWER,16,2880
1590924620214112256,458af3c005e0b282d1ca88c254d9910ee2d93738b6f06d399f7444e1e64831eb,2022-11-11 12:29:22,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"int a=2022\nprintf(\""%d\"",a);",COMPILE_ERROR,0,0
1590924657769885696,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 12:29:31,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"def su(a):\n    for i in range(2,a//2+1):\n        if a==2:\n            return 1\n        if a==3:\n            return 1\n        elif a%i!=0:\n            return 1\n        else:\n            return 0\n\ndata = int(input())\ns = 0\nfor i in range(2,data+1):\n    if su(i)==1:\n        s=s+1\nprint(s)",WRONG_ANSWER,55,2756
1590924673397882880,7ecf54bf0ea2db8ab0397aa941f19ec79a351bc3e86e8c01673aa09a69b3a6db,2022-11-11 12:29:34,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,n = int(input())\nif(n==0):\n    print('1')\nelse:\n    print('6'),WRONG_ANSWER,19,2752
1590924680532393984,0aa773cdb5cb621d4131c7d2b98b0724b7e9e93f4310c787c0a9a219d05e0ff2,2022-11-11 12:29:36,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h.>\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590924704083390464,7d46013a6da090b69b62e7be93e7628aee2f7eef31af37777b9ccf1fd1d3eb2e,2022-11-11 12:29:42,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main(){\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,3,184
1590924716590804992,0aa773cdb5cb621d4131c7d2b98b0724b7e9e93f4310c787c0a9a219d05e0ff2,2022-11-11 12:29:45,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}\n",ACCEPTED,3,184
1590924751881703424,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-11 12:29:53,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio>\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",COMPILE_ERROR,0,0
1590924784077156352,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 12:30:01,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t = 0;\n    scanf(\""%d\"",&t);\n    int n = 0, sum = 0;\n    while(scanf(\""%d\"",&n))\n    {\n        sum = pow(6,n);\n        int num = sum % 10;\n        printf(\""%d\\n\"",num);\n    }\n    return 0;\n}",TIME_LIMIT_EXCEEDED,20,436
1590924795951230976,0cfbb4a339ebbc4dce13b5f3e3f98a3def0ab17ef5b4ac8e6d566de92e1f5f78,2022-11-11 12:30:03,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a,b,c;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    printf(\""%d\"",a+b-c);\n}",ACCEPTED,6,196
1590924862795853824,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 12:30:19,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a;\n    if(scanf(\""%d\"",&a)){\n    int i,n;\n        for(int j=0;j<a;j++){\n            if(scanf(\""%d\"",&n)){\n                n=0;\n            }\n        }\n        for(i=0;i<a;i++){\n            printf(\""6\"");\n            if(i<a-1){\n                printf(\""\\n\"");\n            }\n        }}\n    return 0;\n}",WRONG_ANSWER,8,324
1590924876112789504,3dcf32868d7a750bb24733cc752e8b34486b532e90524d2606d8643387f183e4,2022-11-11 12:30:23,C++,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include \""bits/stdc++.h\""\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> PII;\n#define rep(i,a,n) for(int i = a; i < n; i++)\n#define per(i,n,a) for(int i = n-1; i >= a; i--)\n#define debug(a) printf(\""#: %d \"",a);\n#define fr first\n#define se second\n#define be begin()\n#define ed end()\n#define pb push_back\n#define mk make_pair\n#define pf printf\n#define ins insert\n#define sz size()\n//#define int long long\n#define mem(a,i) memset(a,i,sizeof (a))\n\n//char buf[1<<23],*p1=buf,*p2=buf;\n//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)\n//inline ll read()\n//{\n//    int s=0;\n//    char ch = getchar(),last;\n//    while(ch<'0'||ch>'9') last = ch, ch = getchar();\n//    while(ch>='0'&&ch<='9') s=(s<<1)+(s<<3)+(ch^48),ch=getchar();\n//    return last=='-'?-s:s;\n//}\n\ninline ll read(){\n    ll x = 0,f = 1;\n    char ch = getchar();\n    while(ch < '0'||ch > '9'){\n        if(ch == '-')\n            f = -1;\n        ch = getchar();\n    }\n    while(ch >= '0' && ch <= '9'){\n        x = (x << 1)+(x << 3)+(ch^48);\n        ch = getchar();\n    }\n    return x*f;\n}\nconst int MOD = 1000000007;\nll INF = 1e18;\nll gcd(ll a,ll b){\n    return b ? gcd(b,a%b) : a;\n}\nconst int N = 3e5 + 10;\n//struct edge{\n//    int to,next,w;\n//}eg[N];+\n//bool st[N];\n//void add(int u,int v,int w){\n//    eg[++tot].w = w;eg[tot].to = v;eg[tot].next = head[u];head[u] = tot;\n//}\n\n//int C[100010][3];\n//void Cn(){\n//    for(int i=0;i<100010;i++)for(int j = 0;j <= 2;j++)if(!j) C[i][j] = 1;else C[i][j] = (C[i-1][j]+C[i-1][j-1]);\n//}\nll lowbit(ll x){\n    return x%(-x);\n}\nbool st[N];\nll pr[N];\nint work(int x){\n    st[1] = 1;\n    ll cnt = 0;\n    for(int i = 1;i <= x; i++){\n        if(!st[i])pr[++cnt] = i;\n        for(int j = 1;j <= cnt and i*pr[j] <= x;j++){\n            st[i*pr[j]] = 1;\n            if(i%pr[j] == 0)break;\n        }\n    }\n    return cnt;\n}\nvoid solve(){\n   ll n = read();\n   cout << work(n);\n}\nsigned  main(){\n//    ll t = read();\n//    while(t--)\n        solve();\n}\n",ACCEPTED,8,580
1590924881821241344,0b693affc66d8d407ff008bd1aaf4f2feb4a615f057943ba4b4ba3163d937dc6,2022-11-11 12:30:24,Java,300.0,1590524835191705600,1572865591226855424,1049226928954454016,import java.io.*;\nimport java.util.*;\n\npublic class Main {\n\n    public static void main(String[] args) throws IOException {\n        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n        Scanner sc=new Scanner(System.in);\n        int a=sc.nextInt();\n        int b=sc.nextInt();\n        int c=sc.nextInt();\n        System.out.println(a+b-c);\n    }\n\n    /*private static boolean isZHI(int n) {\n        for (int i = 2; i <n/2+1 ; i++) {\n            if (n%i==0)\n                return false;\n        }\n        return true;//是质数\n    }*/\n\n\n},ACCEPTED,245,19240
1590924897918980096,129ddfe9d2d4553f365faf2fdc5e2f0c271b2e342a4cff13802dda8ef8b3d1c2,2022-11-11 12:30:28,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int[] a = {0,0,0};\n        int n = s.nextInt();\n        if( n>0 && n<Math.pow(10,9)) {\n            for (int i = 0; i < n; i++) {\n                a[i] = s.nextInt();\n            }\n            for (int j = 0; j < n; j++) {\n                if (j == n - 1) {\n                    System.out.print(6);\n                } else {\n                    System.out.println(6);\n                }\n            }\n        }\n    }\n}",NON_ZERO_EXIT_CODE,124,16880
1590924916965310464,2bc6a85c0376656012a7970a7842a2a9d8769555a79ef4eec85ff45aa30ff7b7,2022-11-11 12:30:32,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main() {\n\tint i,j,num;\n\tscanf(\""%d\"", &num);\n\tint arr1[num];\n\tfor(i = 0; i < num; ++i) \n\t\tscanf(\""%d\"", &arr1[i]);\n\tint arr2[num];\n\tfor(i = 0; i < num; ++i) \n\t\tscanf(\""%d\"", &arr2[i]);\n\tint max = 0;\n\tfor(j =0; j < num; j++) {\n\t\tint t = 0;\n\t\tfor(i = j; i < num; ++i) {\n\t\t\tt = t - arr1[i] + arr2[i];\n\t\t\tif(t > max) {\n\t\t\t\tmax = t;\n\t\t\t}\n\t\t}\n\t} \n\tprintf(\""%d\"", max);\t\n} ",ACCEPTED,3,192
1590924975593291776,70c675ddfcb60b2192bc8ac38fb068fec0500208a5bf97a796c7cc074b43cf87,2022-11-11 12:30:46,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner myScanner = new Scanner(System.in);\n\t\tint n = myScanner.nextInt();\n\t\tint[] arr = new int[n];\n\t\tint x=6;\n\t\tfor(int i = 0;i < n;i++) {\n\t\t\tint a = myScanner.nextInt();\n\t\t\tarr[i] = a;\n\t\t\tif(arr[i] == 0) {\n\t\t\t\tx = 1;\n\t\t\t\tSystem.out.println(x);\n\t\t\t}else {\n\t\t\t\tx = 6;\n\t\t\t\tSystem.out.println(x);\n\t\t\t}\n\t\t}\n\t}\n\n}\n,NON_ZERO_EXIT_CODE,237,16824
1590925029892751360,7c6d208c4c4b695bc8d6f8ae0c0357c2466f5c9f86ec0652674812219ac09d38,2022-11-11 12:30:59,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args)  {\n        Scanner sc  =  new Scanner(System.in);\n        int a = sc.nextInt();\n        for (int i = 0; i < a; i++) {\n            if (a==0){\n                System.out.println(1);\n            }else {\n                System.out.println(6);\n            }\n        }\n    }\n},WRONG_ANSWER,359,16472
1590925064609009664,2e4af98c441106efa9ee51f8a781d0eee91a3dff6193987d421eb3a48725c814,2022-11-11 12:31:08,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <iostream>\n\nusing namespace std;\n\nint main() {\n    double x;\n    int n;\n    scanf(\""%d\"", &n);\n    for (int i = 0; i < n; ++i) {\n        scanf(\""%lf\"", &x);\n        if (x == 0) {\n            printf(\""%d\"", 1);\n        } else {\n            printf(\""%d\"", 6);\n        }\n\n    }\n    return 0;\n}\n\n",ACCEPTED,12,576
1590925083869249536,73496b42506787a34bb10a5aafc7fd10eb41a2523cbde7368d617c3be48c111a,2022-11-11 12:31:12,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,3,180
1590925095772663808,129ddfe9d2d4553f365faf2fdc5e2f0c271b2e342a4cff13802dda8ef8b3d1c2,2022-11-11 12:31:15,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"\nimport java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int[] a = {0,0,0};\n        int n = s.nextInt();\n        if( n>=0 && n<=10000000) {\n            for (int i = 0; i < n; i++) {\n                a[i] = s.nextInt();\n            }\n            for (int j = 0; j < n; j++) {\n                if (j == n - 1) {\n                    System.out.print(6);\n                } else {\n                    System.out.println(6);\n                }\n            }\n        }\n    }\n}",NON_ZERO_EXIT_CODE,120,18788
1590925101145587712,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-11 12:31:16,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\npublic class Main{\n    public static void main(String args[]){\n        int X,Y;\n        Scanner scanner = new Scanner(System.in);\n        Y=scanner.nextInt();\n        for(int i=0;i<Y;i++){\n        if(X==0)\n            System.out.println(\""1\"");\n        else\n            System.out.println(\""6\"");\n        }\n\n    }\n}\n",COMPILE_ERROR,0,0
1590925105973211136,73496b42506787a34bb10a5aafc7fd10eb41a2523cbde7368d617c3be48c111a,2022-11-11 12:31:17,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,3,328
1590925156854312960,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-11 12:31:30,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio>\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",COMPILE_ERROR,0,0
1590925174466215936,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-11 12:31:34,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\nclass Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int temp = sc.nextInt();\n        } else {\n            for (int i = 0;i < temp;i++) {\n                int num = sc.nextInt();\n                if(num == 0) {\n                    System.out.println(1);\n                } else {\n                    System.out.println(6);\n                }\n            }\n        }\n    }\n},COMPILE_ERROR,0,0
1590925208800768000,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 12:31:42,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t,i;\n    int z,ed;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<t;i++)\n    printf(\""6\\n\"")\n    /*for(i=0;i<t;i++)\n    {\n    z=pow(6,a[i]);\n    ed=z%10;\n    printf(\""%d\\n\"",ed);}*/\n    return 0;\n}",COMPILE_ERROR,0,0
1590925216681885696,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-11 12:31:44,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\npublic class Main{\n    public static void main(String args[]){\n        int X,Y;\n        Scanner scanner = new Scanner(System.in);\n        Y=scanner.nextInt();\n        for(int i=0;i<Y;i++){\n            X=scanner.nextInt();\n        if(X==0)\n            System.out.println(\""1\"");\n        else\n            System.out.println(\""6\"");\n        }\n\n    }\n}\n",NON_ZERO_EXIT_CODE,241,21584
1590925230871195648,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-11 12:31:47,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\npublic class Main{\n    public static void main(String args[]){\n        int X,Y;\n        Scanner scanner = new Scanner(System.in);\n        Y=scanner.nextInt();\n        for(int i=0;i<Y;i++){\n            X=scanner.nextInt();\n        if(X==0)\n            System.out.println(\""1\"");\n        else\n            System.out.println(\""6\"");\n        }\n\n    }\n}\n",NON_ZERO_EXIT_CODE,224,17120
1590925233886900224,129ddfe9d2d4553f365faf2fdc5e2f0c271b2e342a4cff13802dda8ef8b3d1c2,2022-11-11 12:31:48,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int[] a = {0,0,0};\n        int n = s.nextInt();\n        if( n>=0 && n<=1000) {\n            for (int i = 0; i < n; i++) {\n                a[i] = s.nextInt();\n            }\n            for (int j = 0; j < n; j++) {\n                if (j == n - 1) {\n                    System.out.print(6);\n                } else {\n                    System.out.println(6);\n                }\n            }\n        }\n    }\n}",NON_ZERO_EXIT_CODE,122,16980
1590925242007093248,9aa17e95021225dcdd2b01419b021cd002e47f9a7854274df042f64621bd207a,2022-11-11 12:31:50,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    if(n==0)\n        printf(\""1\"");\n    else\n        printf(\""6\"");\nreturn 0;\n}\n",WRONG_ANSWER,3,320
1590925256812965888,977c9d350f87cd8386fa1f88cca886d6ff43821830806e60da6d6b36dc77cd13,2022-11-11 12:31:53,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,j,n;\n    int num=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n    {\n      for(j=2;j<=i;j++)\n      {\n         if(i%j==0)\n             break;\n      }\n      if(i==j)\n         num++;\n    }\n    printf(\""%d\"",num);\n}",TIME_LIMIT_EXCEEDED,400,196
1590925295790653440,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-11 12:32:03,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio>\nint main()\n{\n    printf(”2022\"");\n    return 0;\n}",COMPILE_ERROR,0,0
1590925314161704960,7ecf54bf0ea2db8ab0397aa941f19ec79a351bc3e86e8c01673aa09a69b3a6db,2022-11-11 12:32:07,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,n = input()\nif(n==0):\n    print('1')\nelse:\n    print('6'),WRONG_ANSWER,17,2868
1590925340703240192,7c6d208c4c4b695bc8d6f8ae0c0357c2466f5c9f86ec0652674812219ac09d38,2022-11-11 12:32:13,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main(void)\n{\n int n;\n cin>>n;\n for(int i=0;i<n;i++)\n {\n  int t;cin>>t;\n  if(t) cout<<\""6\""<<endl;\n  else cout<<\""1\""<<endl;\n }\n return 0;\n}",ACCEPTED,10,444
1590925357694390272,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-11 12:32:17,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio>\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",COMPILE_ERROR,0,0
1590925369492942848,3dcf32868d7a750bb24733cc752e8b34486b532e90524d2606d8643387f183e4,2022-11-11 12:32:20,C++,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include \""bits/stdc++.h\""\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> PII;\n#define rep(i,a,n) for(int i = a; i < n; i++)\n#define per(i,n,a) for(int i = n-1; i >= a; i--)\n#define debug(a) printf(\""#: %d \"",a);\n#define fr first\n#define se second\n#define be begin()\n#define ed end()\n#define pb push_back\n#define mk make_pair\n#define pf printf\n#define ins insert\n#define sz size()\n//#define int long long\n#define mem(a,i) memset(a,i,sizeof (a))\n\n//char buf[1<<23],*p1=buf,*p2=buf;\n//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)\n//inline ll read()\n//{\n//    int s=0;\n//    char ch = getchar(),last;\n//    while(ch<'0'||ch>'9') last = ch, ch = getchar();\n//    while(ch>='0'&&ch<='9') s=(s<<1)+(s<<3)+(ch^48),ch=getchar();\n//    return last=='-'?-s:s;\n//}\n\ninline ll read(){\n    ll x = 0,f = 1;\n    char ch = getchar();\n    while(ch < '0'||ch > '9'){\n        if(ch == '-')\n            f = -1;\n        ch = getchar();\n    }\n    while(ch >= '0' && ch <= '9'){\n        x = (x << 1)+(x << 3)+(ch^48);\n        ch = getchar();\n    }\n    return x*f;\n}\nconst int MOD = 1000000007;\nll INF = 1e18;\nll gcd(ll a,ll b){\n    return b ? gcd(b,a%b) : a;\n}\nconst int N = 3e5 + 10;\n//struct edge{\n//    int to,next,w;\n//}eg[N];+\n//bool st[N];\n//void add(int u,int v,int w){\n//    eg[++tot].w = w;eg[tot].to = v;eg[tot].next = head[u];head[u] = tot;\n//}\n\n//int C[100010][3];\n//void Cn(){\n//    for(int i=0;i<100010;i++)for(int j = 0;j <= 2;j++)if(!j) C[i][j] = 1;else C[i][j] = (C[i-1][j]+C[i-1][j-1]);\n//}\nll lowbit(ll x){\n    return x%(-x);\n}\nll a[N];\nvoid solve(){\n   ll n = read();\n   rep(i,1,n+1)a[i] -= read();\n   rep(i,1,n+1)a[i] += read();\n   ll ans = 0,now = 0;\n   rep(i,1,n+1){\n       if(now + a[i] < 0){\n            now = 0;     \n       }else{\n           now += a[i];\n       }\n       ans = max(ans,now);\n   }\n    printf(\""%lld\\n\"",ans);\n}\nsigned  main(){\n//    ll t = read();\n//    while(t--)\n        solve();\n}\n",ACCEPTED,4,440
1590925420491485184,7ecf54bf0ea2db8ab0397aa941f19ec79a351bc3e86e8c01673aa09a69b3a6db,2022-11-11 12:32:32,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,n = str(input())\nif(n=='0'):\n    print('1')\nelse:\n    print('6'),WRONG_ANSWER,16,3120
1590925511503712256,458af3c005e0b282d1ca88c254d9910ee2d93738b6f06d399f7444e1e64831eb,2022-11-11 12:32:54,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main(){\nint a=2022;\nprintf(\""%d\"",a);\nreturn 0;}",ACCEPTED,4,436
1590925521800728576,129ddfe9d2d4553f365faf2fdc5e2f0c271b2e342a4cff13802dda8ef8b3d1c2,2022-11-11 12:32:57,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int[] a = {0,0,0};\n        int n = s.nextInt();\n            for (int i = 0; i < n; i++) {\n                a[i] = s.nextInt();\n            }\n            for (int j = 0; j < n; j++) {\n                if (j == n - 1) {\n                    System.out.print(6);\n                } else {\n                    System.out.println(6);\n                }\n            }\n    }\n}",WRONG_ANSWER,131,16292
1590925535981645824,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-11 12:33:00,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\nclass Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int temp = sc.nextInt();\n        for (int i = 0;i < temp;i++) {\n            int num = sc.nextInt();\n            if(num == 0) {\n                System.out.println(1);\n            } else {\n                System.out.println(6);\n            }\n        }\n    }\n},NON_ZERO_EXIT_CODE,240,16312
1590925646530940928,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-11 12:33:26,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,4,316
1590925655414452224,73496b42506787a34bb10a5aafc7fd10eb41a2523cbde7368d617c3be48c111a,2022-11-11 12:33:28,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int x,y,z;\n    int s;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    s=x+y-z;\n    printf(\""%d\"",s);\n    return 0;\n}",ACCEPTED,6,320
1590925671403163648,73496b42506787a34bb10a5aafc7fd10eb41a2523cbde7368d617c3be48c111a,2022-11-11 12:33:32,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int x,y,z;\n    int s;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    s=x+y-z;\n    printf(\""%d\"",s);\n    return 0;\n}",ACCEPTED,6,316
1590925709915262976,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 12:33:41,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t = 0;\n    scanf(\""%d\"",&t);\n    int n = 0, sum = 0;\n    while(t--)\n    {\n        scanf(\""%d\"",&n);\n        sum = pow(6,n);\n        int num = sum % 10;\n        printf(\""%d\\n\"",num);\n    }\n    return 0;\n}",WRONG_ANSWER,6,316
1590925735697625088,617f184ce583e9f7a346564ab5659fda0ca35a3a714a0c929cb07f915f4f514b,2022-11-11 12:33:48,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n   int X,Y,Z;\n   scanf(\""%d\"",&X);\n   scanf(\""%d\"",&Y);\n   scanf(\""%d\"",&Z);\n   printf(\""X+Y-Z=%d\"",X+Y-Z);\n    return 0;\n}",WRONG_ANSWER,3,184
1590925742068797440,05f9d62a2660f27e0711448c225e5e0fe6347745a2c93edb6296c0a2ffbc6605,2022-11-11 12:33:49,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    printf(\""2022\"");\n}",ACCEPTED,4,180
1590925778961895424,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 12:33:58,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#define _CRT_SECURE_NO_WARNINGS\n#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t = 0;\n    scanf(\""%d\"",&t);\n    int n = 0, sum = 0;\n    while(t--)\n    {\n        scanf(\""%d\"",&n);\n        sum = pow(6,n);\n        int num = sum % 10;\n        printf(\""%d\\n\"",num);\n    }\n    return 0;\n}",WRONG_ANSWER,7,444
1590925787295973376,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-11 12:34:00,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\npublic class Main {\n    public static void main(String args[]) {\n        int X, Y;\n        Scanner scanner = new Scanner(System.in);\n        Y = scanner.nextInt();\n        for (int i = 0; i < Y; i++) {\n            X = scanner.nextInt();\n            if (X == 0)\n                System.out.println(\""1\"");\n            else\n                System.out.println(\""6\"");\n        }\n\n    }\n}\n",NON_ZERO_EXIT_CODE,234,19604
1590925809815195648,0d97f8676f8329cb267f0e470b71ae15a629f07e888f5155af8a19d5b7a400e4,2022-11-11 12:34:05,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<math.h>\n#include <stdio.h>\nint main()\n{\n    int n,i=2,j,temp=0;\n    scanf(\""%d\"",&n);\n     for(j=2;j<=i;j++)\n     {\n       if(i>n)\n        break;\n      if(i%j==0&&j==i)\n      {\n       ++temp;\n       j=1;\n       ++i;\n      }\n      else if(i%j==0)\n      {\n       ++i;\n       j=1;\n      }\n     }\n    printf(\""%d\"",temp);\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,400,312
1590925829654249472,e0a829315cc9947a3e714cd579e3322e8dee5f8ca36e30fd276de5a8e294b6f8,2022-11-11 12:34:10,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<Stdio.h>\n#include<math.h>\nint main()\n{\n    int t,e,f;\n    int i;\n    int a[3];\n    scanf(\""%d\"",t);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    e=pow(6,a[i]);\n    f=e%10;\n    printf(\""%d\"",f);\n    return 0;\n}",COMPILE_ERROR,0,0
1590925835039715328,5d127211f3edce9d9bd1062c03cd08473e4481ec46b4b0c70c2e8d9141c68f20,2022-11-11 12:34:11,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int i,j,n,num=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<n;i++)\n    {\n        for(j=2;j<=sqrt(i);j++) \n        {\n            if(i%j==0)\n            break;\n        }\n            if(j>sqrt(i))\n            num++;\n    }\n    printf(\""%d\"",num);\n}",ACCEPTED,12,200
1590925850260844544,e4f316bfe970c62bf57b46f5ef8a290748707bf16f041fe868d04986a0cdd64f,2022-11-11 12:34:15,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,A=input()\nB=input()\nC=input()\n\nprint('%d' %(A+B+C))\n,COMPILE_ERROR,0,0
1590925851242336256,aa65cdf25cbe32699d085a61c4f3ec5a4020e6a3dc1e0e9d6e2a48c9288f8026,2022-11-11 12:34:15,Java,300.0,1590524835191705600,1572865591226855424,1049226928954454016,import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int a = scanner.nextInt();\n        int b = scanner.nextInt();\n        int c = scanner.nextInt();\n        System.out.println(a+b-c);\n    }\n},ACCEPTED,257,17384
1590925857764454400,ccc42b8437aa15d1214e4623799ed35cd8ea8087c26cb1b596d51ae4556ea39c,2022-11-11 12:34:17,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"def prime(p):\n    a=p//2\n    for i in range(2,a+1):\n        if p%i==0:\n            return False\n    return True\na=eval(input())\nsums=0\n\nfor i in range(2,a+1):\n    if prime(i)==True:\n        sums+=1\nprint(sums)",TIME_LIMIT_EXCEEDED,400,2876
1590925863858778112,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 12:34:18,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t = 0;\n    scanf(\""%d\"",&t);\n    int n = 0, sum = 0;\n    while(t--)\n    {\n        scanf(\""%d\"",&n);\n        sum = pow(6,n);\n        int num = sum % 10;\n        printf(\""%d\\n\"",num);\n    }\n    return 0;\n}",WRONG_ANSWER,8,456
1590925891616706560,0aa773cdb5cb621d4131c7d2b98b0724b7e9e93f4310c787c0a9a219d05e0ff2,2022-11-11 12:34:25,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{int X,Y,Z,s;\nscanf(\""%d %d %d\"",&X,&Y,&Z);\ns=X+Y-Z\nprintf(\""%d\"",s);\nreturn 0;\n }\n",COMPILE_ERROR,0,0
1590925939016531968,129ddfe9d2d4553f365faf2fdc5e2f0c271b2e342a4cff13802dda8ef8b3d1c2,2022-11-11 12:34:36,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int[] a = {0,0,0};\n        int n = s.nextInt();\n            for (int i = 0; i < n; i++) {\n                a[i] = s.nextInt();\n            }\n            for (int j = 0; j < n; j++) {\n                if (j == n - 1) {\n                    System.out.print((int)(Math.pow(6,a[j]))%10);\n                } else {\n                    System.out.println((int)(Math.pow(6,a[j]))%10);\n                }\n            }\n    }\n}",NON_ZERO_EXIT_CODE,132,16736
1590926007324966912,0aa773cdb5cb621d4131c7d2b98b0724b7e9e93f4310c787c0a9a219d05e0ff2,2022-11-11 12:34:52,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{int X,Y,Z,s;\nscanf(\""%d %d %d\"",&X,&Y,&Z);\ns=X+Y-Z;\nprintf(\""%d\"",s);\nreturn 0;\n }\n",ACCEPTED,7,192
1590926072781254656,0d97f8676f8329cb267f0e470b71ae15a629f07e888f5155af8a19d5b7a400e4,2022-11-11 12:35:08,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<math.h>\n#include <stdio.h>\nint main()\n{\n    int n,i=2,j,temp=0;\n    scanf(\""%d\"",&n);\n     for(j=2;j<=i;j++)\n     {\n       if(i>n)\n        break;\n      if(i%j==0&&j==i)\n      {\n       ++temp;\n       j=1;\n       ++i;\n      }\n      else if(i%j==0)\n      {\n       ++i;\n       j=1;\n      }\n     }\n    printf(\""%d\"",temp);\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,400,316
1590926139588153344,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-11 12:35:24,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int a,b,c;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    printf(\""%d\"",a+b-c);\n    return 0;\n}",ACCEPTED,5,192
1590926158332473344,7ecf54bf0ea2db8ab0397aa941f19ec79a351bc3e86e8c01673aa09a69b3a6db,2022-11-11 12:35:28,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,n = input()\nif(n=='0'):\n    print('1')\nelse:\n    print('6'),WRONG_ANSWER,16,3892
1590926184051945472,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-11 12:35:34,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int temp = sc.nextInt();\n        for (int i = 0;i < temp;i++) {\n            int num = sc.nextInt();\n            if(num == 0) {\n                System.out.println(1);\n            } else {\n                System.out.println(6);\n            }\n        }\n    }\n},NON_ZERO_EXIT_CODE,233,16884
1590926214183825408,fa305ee4bf4c6a54add4e945b551f1e902b95c1a179a91ded55bf7ebb1c87c23,2022-11-11 12:35:42,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{   int t,n,i,s;\n     scanf(\""%d\"",&t);\n     for(i=0;i<t;i++){\n        scanf(\""%d\"",&n);\n        s=pow(6,n);\n        printf(\""%d\"",s%10);\n        if(i!=t-1) printf(\""\\n\"");\n     }\n\n    return 0;\n}\n\n",WRONG_ANSWER,6,316
1590926233628618752,54914c90623988219ee55c4a0b2e645efd9808505aa25f0099930bfa8bf18ad1,2022-11-11 12:35:46,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,i,j,k;\n    scanf(\""%d\"",&a);\n    int x[a],y[a];\n    int t=0;\n    int max = 0;\n    for(i=0; i<a; i++){\n        scanf(\""%d\"",&x[i]);\n    }\n    for(i=0; i<a; i++){\n        scanf(\""%d\"",&y[i]);\n    }\n    for(i=0;i<a;i++){\n        t=0;\n        for(j=i;j<a;j++){\n            t=t-x[j]+y[j];\n            if(t>max){\n                max = t;\n            }\n        }\n    }\n    printf(\""%d\"",max);\n    return 0;\n}\n",ACCEPTED,3,476
1590926270223941632,fa305ee4bf4c6a54add4e945b551f1e902b95c1a179a91ded55bf7ebb1c87c23,2022-11-11 12:35:55,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{   int i,j,n,s=0;\n    scanf(\""%d\"",&n);\n    for (i=2;i<=n;i++) {\n            int flag=1;\n          for (j=2;j<i;j++) {\n            if (i%j==0)\n            flag=0;\n        }\n      if(flag==1) s++;\n     }\n    printf(\""%d\\n\"",s);\n    return 0;\n}",TIME_LIMIT_EXCEEDED,400,324
1590926280642572288,9ca3f63f61fa4f349009d69e7059514c3a39dbdd5a1f94342c11f4c33ccdceaa,2022-11-11 12:35:57,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"x = int(input())\nc=0\nfor i in range (1,x):\n    b=0\n    a=0\n    for j in range (1,i+1):\n        if (i%j == 0):\n            b = b+1\n        if b == 2:\n            a = 2\n        else :\n            a=0\n    if a == 2:\n        c = c+1\nprint(c)\n\n",TIME_LIMIT_EXCEEDED,400,2752
1590926352755240960,e0a829315cc9947a3e714cd579e3322e8dee5f8ca36e30fd276de5a8e294b6f8,2022-11-11 12:36:15,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<Stdio.h>\n#include<math.h>\nint main()\n{\n    int n,e,f;\n    int i;\n    int a[3];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    e=pow(6,a[i]);\n    f=e%10;\n    printf(\""%d\"",f);\n    return 0;\n}",COMPILE_ERROR,0,0
1590926361840128000,001baa7272d47ab2d3a9b57bf7838570ff03ab1cabb738e7b342b652b1e42a83,2022-11-11 12:36:17,C++,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include <iostream>\n#include<bits/stdc++.h>\n\nusing namespace std;\n\n//  向上取整    向下取整\n//  ceil()       floor()\n\nbool pd(int m){\n    int sq=floor(sqrt(m*1.0)),flag=0;\n    for(int i=2;i<=sq;i++){\n        if(m%i==0){\n            flag=1;\n            break;\n        }\n    }\n    if(flag==1)\n        return false;\n    else return true;\n}\n\nint main() {\n    int t;\n    cin>>t;\n    int num=0;\n    for(int i=2;i<=t;i++){\n        if(pd(i))\n            num++;\n    }\n    printf(\""%d\\n\"",num);\n    return 0;\n}\n",ACCEPTED,15,440
1590926395704938496,fa305ee4bf4c6a54add4e945b551f1e902b95c1a179a91ded55bf7ebb1c87c23,2022-11-11 12:36:25,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{   int t,n,i,s;\n     scanf(\""%d\"",&t);\n     for(i=0;i<t;i++){\n        scanf(\""%d\"",&n);\n        s=pow(6,n);\n        printf(\""%d\"",s%10);\n        if(i!=t-1) printf(\""\\n\"");\n     }\n\n    return 0;\n}\n\n",WRONG_ANSWER,6,308
1590926397290360832,1019ea4e8e67338c8191b6e52878cb69ca9287130af71af3517596fded2f21e4,2022-11-11 12:36:25,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include<time.h>\n\nint main()\n{\n   srand(time(0));\n   int n=1000+rand()%9000;\n   printf(\""%d\\n\"",n);\n    return 0;\n}\n",WRONG_ANSWER,3,192
1590926455872204800,fec6d07e317796c63fb7ae6e7538f75973ad64af6e6196cc27eed3e9e685bf86,2022-11-11 12:36:39,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nvoid main()\n{\n    int x,i,t=1,n;\n    scanf(\""%d\"",&n);\n    for(x=3;x<=n;x+=2)\n    {\n        for(i=2;i<=sqrt(x);i++)\n            if(x%i==0)\n                break;\n        if(i>sqrt(x))\n            t++;\n    }\n    printf(\""%d\\n\"",t);\n}\n\n\n\n\n\n\n\n\n\n\n\n\n\n",ACCEPTED,14,312
1590926459307364352,05f9d62a2660f27e0711448c225e5e0fe6347745a2c93edb6296c0a2ffbc6605,2022-11-11 12:36:40,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int a,b,c;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    if(a>=0&&a<=100&&b>=0&&b<=100&&c>=0&&c<=100)\n        printf(\""%d\"",a+b-c);\n}",ACCEPTED,8,472
1590926543839342592,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 12:37:00,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t = 0;\n    scanf(\""%d\"",&t);\n    int n = 0, sum = 0;\n    while(t--)\n    {\n        scanf(\""%d\"",&n);\n        sum = pow(6,n);\n        int num = sum % 10;\n        printf(\""%d\\n\"",num);\n    }\n    return 0;\n}",WRONG_ANSWER,6,316
1590926569512677376,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-11 12:37:06,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    printf(\""6/n6/n6\"");\n    return 0;\n}",WRONG_ANSWER,3,316
1590926694578458624,458af3c005e0b282d1ca88c254d9910ee2d93738b6f06d399f7444e1e64831eb,2022-11-11 12:37:36,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main(){\n    int x,y,z,c;\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    c=x+y-z;\n    printf(\""%d\"",c);\n    return 0;\n}",ACCEPTED,8,180
1590926724303491072,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 12:37:43,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t,i;\n    int z,ed;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<t;i++)\n    {\n    z=(int)pow(6.0,a[i].0);\n    ed=z%10;\n    printf(\""%d\\n\"",ed);}\n    return 0;\n}",COMPILE_ERROR,0,0
1590926744138354688,e0a829315cc9947a3e714cd579e3322e8dee5f8ca36e30fd276de5a8e294b6f8,2022-11-11 12:37:48,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<Stdio.h>\n#include<math.h>\nint main()\n{\n    int n,e,f;\n    int i;\n    int a[3];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    e=pow(6,a[i]);\n    f=e%10;\n    printf(\""%d\"",f);\n    return 0;\n}",COMPILE_ERROR,0,0
1590926770369527808,6383c93cbdef4af3eda29400a925819f16ad4afc8368e604ccd580cba7055bdd,2022-11-11 12:37:54,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include <math.h>\n\nint main()\n{\n    int x = 6;\n    int t;\n    if(scanf(\""%d\"",&t)){\n    int res = pow(x,t);\n    int n;\n    n = res%10;\n    printf(\""%d\"",n);\n\n    return 0;\n    }\n}\n",WRONG_ANSWER,3,316
1590926777160110080,aa65cdf25cbe32699d085a61c4f3ec5a4020e6a3dc1e0e9d6e2a48c9288f8026,2022-11-11 12:37:56,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,\nimport java.util.Scanner;\n\npublic class Main1 {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int i = scanner.nextInt();\n        int i1 = scanner.nextInt();\n        int i2 = scanner.nextInt();\n        int i3 = scanner.nextInt();\n        for (int j=0;j<i;j++){\n            System.out.println(6);\n        }\n    }\n},COMPILE_ERROR,0,0
1590926781572513792,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 12:37:57,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t,i;\n    int z,ed;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<t;i++)\n    {\n    z=(int)pow(6,a[i]);\n    ed=z%10;\n    printf(\""%d\\n\"",ed);}\n    return 0;\n}",WRONG_ANSWER,6,324
1590926815701565440,129ddfe9d2d4553f365faf2fdc5e2f0c271b2e342a4cff13802dda8ef8b3d1c2,2022-11-11 12:38:05,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int[] a = {0,0,0,0};\n        int n = s.nextInt();\n            for (int i = 0; i < n; i++) {\n                a[i] = s.nextInt();\n            }\n            for (int j = 0; j < n; j++) {\n                if (j == n - 1) {\n                    System.out.print(6);\n                } else {\n                    System.out.println(6);\n                }\n            }\n    }\n}",NON_ZERO_EXIT_CODE,242,16696
1590926857673965568,15ac7d06a472ca25d78349f7cc3a73d23c7d7a4f0c4ae3cec6200fcdb8135965,2022-11-11 12:38:15,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int x,y,z,s;\n    scanf(\""%d\\n\"",&x);\n    scanf(\""%d\\n\"",&y);\n    scanf(\""%d\\n\"",&z);\n    s=x+y-z;\n    printf(\""%d\"",s);\n    \n    return 0;\n}\n",ACCEPTED,6,312
1590926963353653248,aa65cdf25cbe32699d085a61c4f3ec5a4020e6a3dc1e0e9d6e2a48c9288f8026,2022-11-11 12:38:40,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,\nimport java.util.Scanner;\n\npublic class Main1 {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int i = scanner.nextInt();\n        int i1 = scanner.nextInt();\n        int i2 = scanner.nextInt();\n        int i3 = scanner.nextInt();\n        for (int j=0;j<i;j++){\n            System.out.println(6);\n        }\n    }\n},COMPILE_ERROR,0,0
1590926966671323136,fa305ee4bf4c6a54add4e945b551f1e902b95c1a179a91ded55bf7ebb1c87c23,2022-11-11 12:38:41,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{   int t,n,i,s;\n     scanf(\""%d\"",&t);\n     for(i=0;i<t;i++){\n        scanf(\""%d\"",&n);\n        s=pow(6,n);\n       s=s%10;\n        printf(\""%d\"",s);\n        if(i!=t-1) printf(\""\\n\"");\n     }\n\n    return 0;\n}",WRONG_ANSWER,6,196
1590926967757672448,6383c93cbdef4af3eda29400a925819f16ad4afc8368e604ccd580cba7055bdd,2022-11-11 12:38:41,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include <math.h>\n\nint main()\n{\n    int x = 6;\n    int t;\n    if(scanf(\""%d\"",&t)){}\n    int res = pow(x,t);\n    int n;\n    n = res%10;\n    printf(\""%d\"",n);\n\n    return 0;\n}\n",WRONG_ANSWER,4,184
1590926975466778624,9aa17e95021225dcdd2b01419b021cd002e47f9a7854274df042f64621bd207a,2022-11-11 12:38:43,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n    int n,a,i;\n    scanf(\""%d\"",&a);\n    for(i=1;i<=a;i++)\n    {\n    scanf(\""%d\"",&n);\n    if(n==0)\n        printf(\""1\\n\"");\n    else\n        printf(\""6\\n\"");\n    }\n\nreturn 0;\n}\n\n",ACCEPTED,9,312
1590927011802058752,aa65cdf25cbe32699d085a61c4f3ec5a4020e6a3dc1e0e9d6e2a48c9288f8026,2022-11-11 12:38:52,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,\nimport java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int i = scanner.nextInt();\n        int i1 = scanner.nextInt();\n        int i2 = scanner.nextInt();\n        int i3 = scanner.nextInt();\n        for (int j=0;j<i;j++){\n            System.out.println(6);\n        }\n    }\n},NON_ZERO_EXIT_CODE,227,17044
1590927018726850560,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-11 12:38:53,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,i;\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++)\n    printf(\""6/n\"");\n    return 0;\n}",WRONG_ANSWER,3,184
1590927048703520768,6383c93cbdef4af3eda29400a925819f16ad4afc8368e604ccd580cba7055bdd,2022-11-11 12:39:01,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include <math.h>\n\nint main()\n{\n    int x = 6;\n    int t;\n    if(scanf(\""%d\"",&t))\n    int res = pow(x,t);\n    int n;\n    n = res%10;\n    printf(\""%d\"",n);\n\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590927086397755392,6383c93cbdef4af3eda29400a925819f16ad4afc8368e604ccd580cba7055bdd,2022-11-11 12:39:10,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include <math.h>\n\nint main()\n{\n    int x = 6;\n    int t;\n    scanf(\""%d\"",&t)\n    int res = pow(x,t);\n    int n;\n    n = res%10;\n    printf(\""%d\"",n);\n\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590927093154779136,129ddfe9d2d4553f365faf2fdc5e2f0c271b2e342a4cff13802dda8ef8b3d1c2,2022-11-11 12:39:11,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int n = s.nextInt();\n        int a = s.nextInt();\n        int b = s.nextInt();\n        int c = s.nextInt();\n        \n            for (int j = 0; j < n; j++) {\n                if (j == n - 1) {\n                    System.out.print(6);\n                } else {\n                    System.out.println(6);\n                }\n            }\n    }\n},NON_ZERO_EXIT_CODE,238,16852
1590927100708696064,1019ea4e8e67338c8191b6e52878cb69ca9287130af71af3517596fded2f21e4,2022-11-11 12:39:13,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include<time.h>\n\nint main()\n{\n   srand(time(0));\n   printf(\""%d\\n\"",rand()%9000+1000);\n    return 0;\n}\n",WRONG_ANSWER,3,328
1590927125429944320,aa65cdf25cbe32699d085a61c4f3ec5a4020e6a3dc1e0e9d6e2a48c9288f8026,2022-11-11 12:39:19,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,\nimport java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int i = scanner.nextInt();\n        int i1 = scanner.nextInt();\n        int i2 = scanner.nextInt();\n        int i3 = scanner.nextInt();\n        for (int j=0;j<i;j++){\n            System.out.println(6);\n        }\n    }\n},NON_ZERO_EXIT_CODE,241,19132
1590927196296908800,fa305ee4bf4c6a54add4e945b551f1e902b95c1a179a91ded55bf7ebb1c87c23,2022-11-11 12:39:36,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{   int t,n,i,s;\n     scanf(\""%d\"",&t);\n     for(i=0;i<t;i++){\n        scanf(\""%d\"",&n);\n        s=pow(6,n);\n       s=s%10;\n        printf(\""%d\\n\"",s);\n        \n     }\n\n    return 0;\n}",WRONG_ANSWER,7,700
1590927211924860928,6383c93cbdef4af3eda29400a925819f16ad4afc8368e604ccd580cba7055bdd,2022-11-11 12:39:39,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include <math.h>\n\nint main()\n{\n    int x = 6;\n    int t;\n    scanf(\""%d\"",&t);\n    int res = pow(x,t);\n    int n;\n    n = res%10;\n    printf(\""%d\"",n);\n\n    return 0;\n}\n",WRONG_ANSWER,3,456
1590927239355629568,8f30a940fb84c0203b9f96b4d228374f10f9fdcb64182e702cd07fe56f0f3ee3,2022-11-11 12:39:46,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"print(\""2022\"")",COMPILE_ERROR,0,0
1590927277582520320,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-11 12:39:55,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,i;\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++)\n    printf(\""6\\n\"");\n    return 0;\n}",WRONG_ANSWER,11,604
1590927288466735104,8f30a940fb84c0203b9f96b4d228374f10f9fdcb64182e702cd07fe56f0f3ee3,2022-11-11 12:39:58,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"print(\""2022\"");",COMPILE_ERROR,0,0
1590927300814766080,aa65cdf25cbe32699d085a61c4f3ec5a4020e6a3dc1e0e9d6e2a48c9288f8026,2022-11-11 12:40:01,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,\nimport java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int i = scanner.nextInt();\n        int i1 = scanner.nextInt();\n        int i2 = scanner.nextInt();\n        int i3 = scanner.nextInt();\n        for (int j=0;j<i;j++){\n            System.out.println(6);\n        }\n    }\n},NON_ZERO_EXIT_CODE,245,17052
1590927374806462464,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-11-11 12:40:18,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"t=int(input())\nn=input()\nn=n.strip('[')\nn=n.strip(']')\nn=list(map(int,n.split(' ')))\nfor i in range(0,len(n)):\n    num=pow(6,n[i])\n    print(num % 10)",TIME_LIMIT_EXCEEDED,35,3232
1590927388882571264,7c6d208c4c4b695bc8d6f8ae0c0357c2466f5c9f86ec0652674812219ac09d38,2022-11-11 12:40:22,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args)  {\n        Scanner sc  =  new Scanner(System.in);\n       int a = sc.nextInt();\n       int count = 0;\n        for (int i = 2; i <= a; i++) {\n            if (panduan(i)){\n             count++;\n            }\n        }\n        System.out.println(count);\n       \n    }\n    public static boolean panduan(int num){\n        for (int i = 2; i < num; i++) {\n           if (num % i ==0){\n               return false;\n           }\n        }\n        return true;\n    }\n},COMPILE_ERROR,0,0
1590927392330285056,129ddfe9d2d4553f365faf2fdc5e2f0c271b2e342a4cff13802dda8ef8b3d1c2,2022-11-11 12:40:22,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int n = s.nextInt();\n        int a = s.nextInt();\n        int b = s.nextInt();\n        int c = s.nextInt();\n        int d = a+b+c;\n            for (int j = 0; j < n; j++) {\n                if (j == n - 1) {\n                    System.out.print(6);\n                } else {\n                    System.out.println(6);\n                }\n            }\n    }\n},NON_ZERO_EXIT_CODE,231,16788
1590927407996014592,8f30a940fb84c0203b9f96b4d228374f10f9fdcb64182e702cd07fe56f0f3ee3,2022-11-11 12:40:26,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"print(\""2022\"");",ACCEPTED,16,4008
1590927411397595136,7c6d208c4c4b695bc8d6f8ae0c0357c2466f5c9f86ec0652674812219ac09d38,2022-11-11 12:40:27,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args)  {\n        Scanner sc  =  new Scanner(System.in);\n       int a = sc.nextInt();\n       int count = 0;\n        for (int i = 2; i <= a; i++) {\n            if (panduan(i)){\n             count++;\n            }\n        }\n        System.out.println(count);\n       \n    }\n    public static boolean panduan(int num){\n        for (int i = 2; i < num; i++) {\n           if (num % i ==0){\n               return false;\n           }\n        }\n        return true;\n    }\n},TIME_LIMIT_EXCEEDED,400,16660
1590927434822778880,7ecf54bf0ea2db8ab0397aa941f19ec79a351bc3e86e8c01673aa09a69b3a6db,2022-11-11 12:40:33,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"x = int(input())\nfor i in range(0,x):\n    n = input()\n    if(n=='0'):\n        print('1')\n    else:\n        print('6')",NON_ZERO_EXIT_CODE,16,2872
1590927481379553280,6cbd81921f92855c6b8318725b09ef7ec48ff579276b3df9f7ea04bea9804678,2022-11-11 12:40:44,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n   int n,a,b;\n    scanf(\""%d\"",&n);\n    while(n--){\n        scanf(\""%d\"",&a);\n        b=pow(6,a);\n        printf(\""%d\\n\"",b%10);\n    }\n    return 0;\n}\n",WRONG_ANSWER,6,360
1590927560379273216,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 12:41:03,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t = 0;\n    scanf(\""%d\"",&t);\n    while(t--)\n    {\n        int n = 0;\n        scanf(\""%d\"",&n);\n        int sum = pow(6,n);\n        int num = sum % 10;\n        printf(\""%d\\n\"",num);\n    }\n    return 0;\n}",WRONG_ANSWER,6,196
1590927572538560512,44e63106384b2202d1a15f2fb61b15315a1f0761b20f40b73c55e6122e10f27d,2022-11-11 12:41:05,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,print('2022'),ACCEPTED,16,2872
1590927580704866304,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 12:41:07,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int t,i,x,n,sum,yu;\n    scanf(\""%d\"",&x);\n    for(i=0;i<x;i++)\n    {\n    scanf(\""%d\"",&n);\n    if(n=0) \n    {\n        printf(\""1/n\"");\n        continue;\n    }\n    sum=pow(6,n);\n    yu=sum%10;\n    printf(\""%d\"",yu);\n    if(i!=x-1) printf(\""\\n\"");\n    }\n    return 0;\n}\n",WRONG_ANSWER,3,180
1590927607011545088,129ddfe9d2d4553f365faf2fdc5e2f0c271b2e342a4cff13802dda8ef8b3d1c2,2022-11-11 12:41:14,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int n = s.nextInt();\n        int a = s.nextInt();\n        int b = s.nextInt();\n        int c = s.nextInt();\n        int j;\n            for (j=0; j < n; j++) {\n                if (j == n - 1) {\n                    System.out.print(6);\n                } else {\n                    System.out.println(6);\n                }\n            }\n    }\n},NON_ZERO_EXIT_CODE,253,16824
1590927611625279488,e0a829315cc9947a3e714cd579e3322e8dee5f8ca36e30fd276de5a8e294b6f8,2022-11-11 12:41:15,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,e,f;\n    int i;\n    int a[3];\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        e=pow(6,a[i]);\n    f=e%10;\n    printf(\""%d\\n\"",f);}\n    return 0;\n}\n",RUNTIME_ERROR,3,320
1590927621641277440,aa65cdf25cbe32699d085a61c4f3ec5a4020e6a3dc1e0e9d6e2a48c9288f8026,2022-11-11 12:41:17,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,\nimport java.util.Scanner;\n\npublic class Main {\n    public static int main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int i = scanner.nextInt();\n        int i1 = scanner.nextInt();\n        int i2 = scanner.nextInt();\n        int i3 = scanner.nextInt();\n        for (int j=0;j<i;j++){\n            System.out.println(6);\n        }\n        return 0;\n    }\n},NON_ZERO_EXIT_CODE,85,17932
1590927635000135680,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 12:41:20,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int t,i,x,n,sum,yu;\n    scanf(\""%d\"",&x);\n    for(i=0;i<x;i++)\n    {\n    scanf(\""%d\"",&n);\n    if(n=0) \n    {\n        printf(\""1\\n\"");\n        continue;\n    }\n    sum=pow(6,n);\n    yu=sum%10;\n    printf(\""%d\"",yu);\n    if(i!=x-1) printf(\""\\n\"");\n    }\n    return 0;\n}\n",WRONG_ANSWER,2,196
1590927661260668928,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 12:41:27,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t,i;\n    int z,ed;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<t;i++)\n    {\n    z=(int)pow(6.0,a[i]);\n    ed=z%10;\n    printf(\""%d\\n\"",ed);}\n    return 0;\n}",WRONG_ANSWER,7,472
1590927686766231552,9ca3f63f61fa4f349009d69e7059514c3a39dbdd5a1f94342c11f4c33ccdceaa,2022-11-11 12:41:33,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"x = int(input())\ny = input().split(\"" \"")\nfor i in range(x):\n    #a,b,c = [int(x) for x in input().split(\"" \"")]\n    '''a = int(y[i])\n    b = 6**a\n    b = b%10\n    print(b)'''\n    print (6)",WRONG_ANSWER,46,2880
1590927798074650624,129ddfe9d2d4553f365faf2fdc5e2f0c271b2e342a4cff13802dda8ef8b3d1c2,2022-11-11 12:41:59,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int n = s.nextInt();\n        int a = s.nextInt();\n        int b = s.nextInt();\n        int c = s.nextInt();\n        int j;\n            for (j=0; j < n; j++) {\n                if (j == 2) {\n                    System.out.print(6);\n                } else {\n                    System.out.println(6);\n                }\n            }\n    }\n},WRONG_ANSWER,240,16884
1590927860288782336,8f30a940fb84c0203b9f96b4d228374f10f9fdcb64182e702cd07fe56f0f3ee3,2022-11-11 12:42:14,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    print(\""2022\"")\n}\n",COMPILE_ERROR,0,0
1590927864478896128,6cbd81921f92855c6b8318725b09ef7ec48ff579276b3df9f7ea04bea9804678,2022-11-11 12:42:15,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n   int t,n,b;\n    scanf(\""%d\"",&t);\n    while(t--){\n        scanf(\""%d\"",&n);\n        b=pow(6,n);\n        printf(\""%d\\n\"",b%10);\n    }\n    return 0;\n}\n",WRONG_ANSWER,6,308
1590927891913834496,3e087b0a196d30fcbb49ca80164c9eb5adf82ae3bb08ec0c141e5728fb180f0d,2022-11-11 12:42:22,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\n\t\tpublic static void main(String[] args) throws Exception {\n\t\t\t// TODO Auto-generated method stub\n\t\t\tBufferedReader bf=new BufferedReader(new InputStreamReader(System.in));\n\t\t\tint cnt=0;\n\t\t\tcnt=Integer.valueOf(bf.readLine());\n\t\t\tString[] temp=bf.readLine().split(\"" \"");\n\t\t\tfor(int i=0;i<=cnt-2;i++) {\n\t\t\t\tif(Integer.valueOf(temp[i])==0) {\n\t\t\t\t\tSystem.out.println(1);\n\t\t\t\t}else {\n\t\t\t\t\tSystem.out.println(6);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(Integer.valueOf(temp[cnt-1])==0) {\n\t\t\t\tSystem.out.print(1);\n\t\t\t}else {\n\t\t\t\tSystem.out.print(6);\n\t\t\t}\n\t\t\tbf.close();\n\t\t}\n}",NON_ZERO_EXIT_CODE,143,14756
1590928001641021440,9ca3f63f61fa4f349009d69e7059514c3a39dbdd5a1f94342c11f4c33ccdceaa,2022-11-11 12:42:48,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"x = int(input())\ny = input().split(\"" \"")\nfor i in range(x):\n    #a,b,c = [int(x) for x in input().split(\"" \"")]\n    '''a = int(y[i])\n    b = 6**a\n    b = b%10\n    print(b)'''\n    if y[i] == \""\"":\n        break\n    print (6)\n",WRONG_ANSWER,43,2756
1590928053444874240,6cbd81921f92855c6b8318725b09ef7ec48ff579276b3df9f7ea04bea9804678,2022-11-11 12:43:00,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n   int t,n,b;\n    scanf(\""%d\"",&t);\n    while(t--){\n        scanf(\""%d\"",&n);\n        b=pow(6,n);\n        printf(\"" %d\\n\"",b%10);\n    }\n    return 0;\n}\n",WRONG_ANSWER,7,704
1590928079587946496,8f30a940fb84c0203b9f96b4d228374f10f9fdcb64182e702cd07fe56f0f3ee3,2022-11-11 12:43:06,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a;\n        a=2022;\n    print(\""%d\"",a);\n}\n",COMPILE_ERROR,0,0
1590928099787735040,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 12:43:11,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t,i;\n    int z,ed;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<t;i++)\n    {\n    z=(int)pow(6,a[i]);\n    ed=z%10;\n    printf(\""%d\\n\"",ed);}\n    return 0;\n}",WRONG_ANSWER,6,348
1590928130594902016,70c675ddfcb60b2192bc8ac38fb068fec0500208a5bf97a796c7cc074b43cf87,2022-11-11 12:43:19,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner myScanner = new Scanner(System.in);\n\t\tint n = myScanner.nextInt();\n\t\tint[] arr = new int[n];\n\t\tint x=6;\n\t\tfor(int i = 0;i < n;i++) {\n\t\t\tint a = myScanner.nextInt();\n\t\t\tarr[i] = a;\n\t\t\tif(arr[i] == 0) {\n\t\t\t\tx = 1;\n\t\t\t\tSystem.out.println(x);\n\t\t\t}else {\n\t\t\t\tx = 6;\n\t\t\t\tif(i == n-1) {\n\t\t\t\t\tSystem.out.printf(\""%d\"",x);\n\t\t\t\t}else {\n\t\t\t\t\tSystem.out.println(x);\n\t\t\t\t}\t\t\n\t\t\t}\n\t\t}\n\t}\n\n}",WRONG_ANSWER,245,16700
1590928171988484096,8f30a940fb84c0203b9f96b4d228374f10f9fdcb64182e702cd07fe56f0f3ee3,2022-11-11 12:43:28,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""2022\"");\n}\n",ACCEPTED,2,192
1590928263273316352,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-11 12:43:50,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String args[]) {\n        int X, Y;\n        Scanner scanner = new Scanner(System.in);\n        Y = scanner.nextInt();\n        for (int i = 0; i < Y; i++) {\n            X = scanner.nextInt();\n            System.out.println(X==0?\""1\"":\""6\"");\n        }\n\n    }\n}",NON_ZERO_EXIT_CODE,244,16944
1590928345016086528,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-11 12:44:10,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int temp = Integer.parseInt(sc.nextLine());\n        for (int i = 0;i < temp;i++) {\n            int num = sc.nextInt();\n            if(num == 0) {\n                System.out.println(1);\n            } else {\n                System.out.println(6);\n            }\n        }\n    }\n},WRONG_ANSWER,237,16608
1590928403019141120,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-11 12:44:23,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,a[10];\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]==0)\n            printf(\""0\\n\"");\n        else\n        printf(\""6\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,9,324
1590928569126137856,7d46013a6da090b69b62e7be93e7628aee2f7eef31af37777b9ccf1fd1d3eb2e,2022-11-11 12:45:03,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main(){\n    int x,y,z;\n    0<=x=y=z<=100;\n    printf(\""%d\"",x+y-z);\n    return 0;\n}",COMPILE_ERROR,0,0
1590928631302500352,73496b42506787a34bb10a5aafc7fd10eb41a2523cbde7368d617c3be48c111a,2022-11-11 12:45:18,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nlong main()\n{\n    long long a=1,b;\n    long i;\n    int n;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        a*=6;\n    b=a%6;\n    printf(\""%d\"",b);\n    return 0;\n}",WRONG_ANSWER,3,188
1590928760331898880,e0a829315cc9947a3e714cd579e3322e8dee5f8ca36e30fd276de5a8e294b6f8,2022-11-11 12:45:49,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int a[3];\n    int n,e;\n    int i;\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        e=pow(6,a[i]);\n    printf(\""%d\\n\"",e%10);}\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,4,444
1590928776165392384,73496b42506787a34bb10a5aafc7fd10eb41a2523cbde7368d617c3be48c111a,2022-11-11 12:45:52,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    long long a=1,b;\n    long i;\n    int n;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        a*=6;\n    b=a%6;\n    printf(\""%d\"",b);\n    return 0;\n}",WRONG_ANSWER,3,180
1590928828409643008,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-11 12:46:05,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int temp = sc.nextInt();\n        for (int i = 0;i < temp;i++) {\n            int num = sc.nextInt();\n            if(num == 0) {\n                System.out.println(1);\n            } else {\n                System.out.println(6);\n            }\n        }\n    }\n},NON_ZERO_EXIT_CODE,231,17128
1590928901973520384,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-11 12:46:22,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,a[10];\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]==0)\n            printf(\""0\\n\"");\n        else\n            printf(\""6\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,10,464
1590928902590103552,7ecf54bf0ea2db8ab0397aa941f19ec79a351bc3e86e8c01673aa09a69b3a6db,2022-11-11 12:46:23,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    char x;\n    int n;\n    scanf(\""%d\"",&n);\n    for (int i = 0; i < n; i++)\n    {\n        scanf(\""%s\"",&x);\n        if (x == \""0\"")\n        {\n            printf(\""%d\"",1);\n        }\n        else\n        {\n            printf(\""%d\"",6);\n        }\n        \n    }\n    \n}",WRONG_ANSWER,4,332
1590928906901848064,129ddfe9d2d4553f365faf2fdc5e2f0c271b2e342a4cff13802dda8ef8b3d1c2,2022-11-11 12:46:24,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int n = s.nextInt();\n        int a = s.nextInt();\n        int b = s.nextInt();\n        int c = s.nextInt();\n        int j;\n            for (j=0; j < n; j++) {\n                if (j == 2) {\n                    int k = (int)(Math.pow(6,c));\n                    System.out.print(k%10);\n                } else if(j==0) {\n                    int k = (int)(Math.pow(6,a));\n                    System.out.println(k%10);\n                }else{\n                    int k = (int)(Math.pow(6,b));\n                    System.out.println(k%10);\n                }\n            }\n    }\n}",WRONG_ANSWER,242,16932
1590928927869173760,8f30a940fb84c0203b9f96b4d228374f10f9fdcb64182e702cd07fe56f0f3ee3,2022-11-11 12:46:29,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main{\n    int X,Y,Z;\n    scanf(\""&d,%d,%d\"",&X,&Y,&Z);\n    printf(\""%d\"",X+Y+Z);\n}",COMPILE_ERROR,0,0
1590928935146270720,aa65cdf25cbe32699d085a61c4f3ec5a4020e6a3dc1e0e9d6e2a48c9288f8026,2022-11-11 12:46:30,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main1 {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int i = scanner.nextInt();\n        int i1 = scanner.nextInt();\n        int i2 = scanner.nextInt();\n        int i3 = scanner.nextInt();\n\n       while(i>0){\n           i--;\n           System.out.println(6);\n       }\n    }\n},COMPILE_ERROR,0,0
1590928962975498240,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 12:46:37,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(void)\n{\n    int t = 0;\n    scanf(\""%d\"",&t);\n    while(t--)\n    {\n        int n = 0;\n        scanf(\""%d\"",&n);\n        int sum = pow(6,n);\n        int num = sum % 10;\n        printf(\""%d\\n\"",num);\n    }\n    return 0;\n}",WRONG_ANSWER,6,328
1590928980113403904,5d127211f3edce9d9bd1062c03cd08473e4481ec46b4b0c70c2e8d9141c68f20,2022-11-11 12:46:41,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int i,n,t,y;\n    scanf(\""%d\\n\"",&t);\n    y=pow(6,t);\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&n);\n        printf(\""6\\n\"");\n    }\n}",WRONG_ANSWER,9,320
1590928985998032896,aa65cdf25cbe32699d085a61c4f3ec5a4020e6a3dc1e0e9d6e2a48c9288f8026,2022-11-11 12:46:42,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int i = scanner.nextInt();\n        int i1 = scanner.nextInt();\n        int i2 = scanner.nextInt();\n        int i3 = scanner.nextInt();\n\n       while(i>0){\n           i--;\n           System.out.println(6);\n       }\n    }\n},NON_ZERO_EXIT_CODE,250,20336
1590929004058705920,a2fa7eb1ab1c2f6fa23517852ee6971ea32fd0c7742d71d7914ed729415f04d9,2022-11-11 12:46:47,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint n,k=0,s;\n\tcin>>n;\n\tfor(int i=2;i<=n;i++)\n\t{\n\t\ts=1;\n\t\tfor(int j=2;j<i;j++)\n\t\t    if(i%j==0)\n\t\t    {\n\t\t\t    s=0;\n\t\t\t    break;\n\t        }\n\t    if(s==1)\n\t       k++;  \n\t}\n\tcout<<k;\n\treturn 0;\n} ",TIME_LIMIT_EXCEEDED,400,324
1590929017400786944,8f30a940fb84c0203b9f96b4d228374f10f9fdcb64182e702cd07fe56f0f3ee3,2022-11-11 12:46:50,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main{\n    int X,Y,Z;\n    scanf(\""&d,%d,%d\"",&X,&Y,&Z);\n    printf(\""%d\"",X+Y-Z);\n}",COMPILE_ERROR,0,0
1590929023599947776,1019ea4e8e67338c8191b6e52878cb69ca9287130af71af3517596fded2f21e4,2022-11-11 12:46:51,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n\n   printf(\""2022\\n\"");\n    return 0;\n}\n",ACCEPTED,3,188
1590929089127559168,5d127211f3edce9d9bd1062c03cd08473e4481ec46b4b0c70c2e8d9141c68f20,2022-11-11 12:47:07,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int i,n,t,y;\n    scanf(\""%d\\n\"",&t);\n    y=pow(6,t);\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&n);\n    }\n            printf(\""6\\n\"");\n            printf(\""6\\n\"");\n            printf(\""6\"");\n}",WRONG_ANSWER,3,312
1590929091891625984,9ca3f63f61fa4f349009d69e7059514c3a39dbdd5a1f94342c11f4c33ccdceaa,2022-11-11 12:47:08,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"x = int(input())\ny = input().split(\"" \"")\nfor i in range(x):\n    #a,b,c = [int(x) for x in input().split(\"" \"")]\n    '''a = int(y[i])\n    b = 6**a\n    b = b%10\n    print(b)'''\n    if y[i] == \""\"" or int(y[i])<=0 or int(y[i])>=10**9:\n        break\n    else:\n        print (6)\n",WRONG_ANSWER,31,2884
1590929105116266496,15ac7d06a472ca25d78349f7cc3a73d23c7d7a4f0c4ae3cec6200fcdb8135965,2022-11-11 12:47:11,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,m;\n    m=pow(6,n);\n    m=m%10;\n    return 0;\n}\n",WRONG_ANSWER,4,316
1590929111407726592,281adcca8943f9f4c0ced14f1ceffe157a34fca39f3cb864eb95e400944e38a8,2022-11-11 12:47:12,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n;\n    scanf(\""%d\"",&n);\n    int a;\n    while(n>0){\n        scanf(\""%d\"",&a);\n        if(a==0){\n            printf(\""1\\n\"");\n        }else{\n        printf(\""6\\n\"");\n        }\n        n--;\n    }\n    return 0;\n}\n",ACCEPTED,9,320
1590929136787435520,e0a829315cc9947a3e714cd579e3322e8dee5f8ca36e30fd276de5a8e294b6f8,2022-11-11 12:47:18,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int a[3];\n    int n;\n    int i;\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    printf(\""%d\\n\"",pow(6,a[i])%10);}\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590929173613445120,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 12:47:27,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int a,n,i;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",a);\n        if(a==0)\n        {\n            printf(\""1\\n\"");\n            continue;\n        }\n        else\n        {\n            printf(\""%d\"",pow(6,a));\n            if(i!=n-1) printf(\""\\n\"");\n        }\n    }\n    \n}\n",TIME_LIMIT_EXCEEDED,4,448
1590929200956112896,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 12:47:34,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int a,n,i;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",a);\n        if(a==0)\n        {\n            printf(\""1\\n\"");\n            continue;\n        }\n        else\n        {\n            printf(\""%d\"",pow(6,a));\n            if(i!=n-1) printf(\""\\n\"");\n        }\n    }\n    \n}\n",SEGMENTATION_FAULT,3,448
1590929215195774976,910d600982c42b3bf326994e410e7a344f2438b451c8f7deb6f6a9f965d3ee41,2022-11-11 12:47:37,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int a,i,n,g;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;)\n    {\n        scanf(\""%d\"",&n);\n        g=pow(6,n);\n        printf(\""%d\"",g%10);\n        i++;\n        if(i==a)\n            break;\n        printf(\""\\n\"");\n    }\n}",WRONG_ANSWER,6,324
1590929237085851648,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 12:47:42,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int a,n,i;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",a);\n        if(a==0)\n        {\n            printf(\""1\\n\"");\n            continue;\n        }\n        else\n        {\n            printf(\""%d\"",pow(6,a));\n            if(i!=n-1) printf(\""\\n\"");\n        }\n    }\n    \n}\n",TIME_LIMIT_EXCEEDED,3,464
1590929258741043200,d830b0bcae7881ad6d1b2e2b14f3ffa3695b6d3bd622856493fa1cf903c9bf4e,2022-11-11 12:47:47,Java,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"public class Main {\n\tpublic static void main(String[] args) {\n\t\tSystem.out.print(\""2022\"");\n\t\t\n\t}\n\t\n\t\n}",ACCEPTED,69,14488
1590929293369212928,7ecf54bf0ea2db8ab0397aa941f19ec79a351bc3e86e8c01673aa09a69b3a6db,2022-11-11 12:47:56,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    double x;\n    int n;\n    scanf(\""%d\"",&n);\n    for (int i = 0; i < n; i++)\n    {\n        scanf(\""%d\"",&x);\n        if (x == \""0\"")\n        {\n            printf(\""%d\"",1);\n        }\n        else\n        {\n            printf(\""%d\"",6);\n        }\n        \n    }\n    \n}",COMPILE_ERROR,0,0
1590929301204152320,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-11 12:47:58,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<math.h>\n#include <stdio.h>\nint main()\n{\n    int n,i,a,t,temp;\n    scanf(\""%d\"",&t);\n    for(i=1;i<=t;i++)\n    {\n     scanf(\""%d\"",&n);\n     temp=pow(6,n);\n     a=temp%10;\n     if(i<t)\n      printf(\""%d\\n\"",a);\n     else\n      printf(\""%d\"",a);\n    }\n    return 0;\n}\n",WRONG_ANSWER,6,320
1590929321647190016,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 12:48:02,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int a,n,i;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",a);\n        if(a==0)\n        {\n            printf(\""1\\n\"");\n            continue;\n        }\n        else\n        {\n            printf(\""%d\"",pow(6,a));\n            if(i!=n-1) printf(\""\\n\"");\n        }\n    }\n    \n}\n",SEGMENTATION_FAULT,3,476
1590929329926770688,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-11-11 12:48:04,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"t=int(input())\nn=input()\nn=n.strip('[')\nn=n.strip(']')\nn=list(map(int,n.split(' ')))\nfor i in range(0,len(n)):\n    print(pow(6, n[i]) % 10)",TIME_LIMIT_EXCEEDED,165,4108
1590929354899632128,8f30a940fb84c0203b9f96b4d228374f10f9fdcb64182e702cd07fe56f0f3ee3,2022-11-11 12:48:10,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main{\n    int X,Y,Z;\n    scanf(\""%d,%d,%d\"",&X,&Y,&Z);\n    printf(\""%d\"",X+Y-Z);\n}",COMPILE_ERROR,0,0
1590929363468595200,19b1d22e5c87afa9233c236fc7b4d5e0e70acf3872968cbe9aae96e75e9e38d1,2022-11-11 12:48:12,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,print(2022),ACCEPTED,17,3384
1590929401619984384,0b693affc66d8d407ff008bd1aaf4f2feb4a615f057943ba4b4ba3163d937dc6,2022-11-11 12:48:22,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.io.*;\nimport java.util.*;\n\npublic class Main {\n\n    public static void main(String[] args) throws IOException {\n        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n        Scanner sc=new Scanner(System.in);\n        int a=sc.nextInt();\n        String b=sc.next();\n        for (int i = 0; i < a; i++) {\n            System.out.println(6);\n        }\n    }\n\n    /*private static boolean isZHI(int n) {\n        for (int i = 2; i <n/2+1 ; i++) {\n            if (n%i==0)\n                return false;\n        }\n        return true;//是质数\n    }*/\n\n\n},WRONG_ANSWER,343,16648
1590929413519249408,7ecf54bf0ea2db8ab0397aa941f19ec79a351bc3e86e8c01673aa09a69b3a6db,2022-11-11 12:48:24,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    double x;\n    int n;\n    scanf(\""%d\"",&n);\n    for (int i = 0; i < n; i++)\n    {\n        scanf(\""%d\"",&x);\n        if (x == 0)\n        {\n            printf(\""%d\\n\"",1);\n        }\n        else\n        {\n            printf(\""%d\\n\"",6);\n        }\n        \n    }\n    \n}",WRONG_ANSWER,8,360
1590929478845534208,8f30a940fb84c0203b9f96b4d228374f10f9fdcb64182e702cd07fe56f0f3ee3,2022-11-11 12:48:40,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main{\n    int X,Y,Z;\n    scanf(\""%d,%d,%d\"",&X,&Y,&Z);\n    printf(\""%d\"",X+Y-Z);\n    return 0;\n}",COMPILE_ERROR,0,0
1590929482154840064,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-11 12:48:41,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,a[100];\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]==0)\n            printf(\""0\\n\"");\n        else\n            printf(\""6\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,8,312
1590929483937415168,e0a829315cc9947a3e714cd579e3322e8dee5f8ca36e30fd276de5a8e294b6f8,2022-11-11 12:48:41,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int a[3];\n    int n,e;\n    int i;\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        e=pow(6,a[i]);\n    printf(\""%d\\n\"",e%10);}\n    return 0;\n}\n",RUNTIME_ERROR,4,444
1590929545849540608,5d127211f3edce9d9bd1062c03cd08473e4481ec46b4b0c70c2e8d9141c68f20,2022-11-11 12:48:56,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int i,n,t,y;\n    scanf(\""%d\\n\"",&t);\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&n);\n        y=pow(6,n);\n    }\n            printf(\""%d\\n\""y%10);\n            printf(\""%d\\n\""y%10);\n            printf(\""%d\""y%10);\n}",COMPILE_ERROR,0,0
1590929563893411840,7d46013a6da090b69b62e7be93e7628aee2f7eef31af37777b9ccf1fd1d3eb2e,2022-11-11 12:49:00,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main(){\n    int x,y,z;\n    0<=x=y=z<=100;\n    scanf(\""x=%d,y=%d\"",&x,&y);\n    printf(\""%d\"",x+y-z);\n    return 0;\n}",COMPILE_ERROR,0,0
1590929580096028672,73496b42506787a34bb10a5aafc7fd10eb41a2523cbde7368d617c3be48c111a,2022-11-11 12:49:04,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    long long a=1,b;\n    long i;\n    int n;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        a*=6;\n    b=a%10;\n    printf(\""%d\"",b);\n    return 0;\n}",WRONG_ANSWER,3,184
1590929596827107328,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 12:49:08,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int a,n,i,t;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",a);\n        if(a==0)\n        {\n            printf(\""1\\n\"");\n            continue;\n        }\n        else\n        {\n            t=a%4;\n            printf(\""%d\"",pow(6,t));\n            if(i!=n-1) printf(\""\\n\"");\n        }\n    }\n    \n}\n",TIME_LIMIT_EXCEEDED,3,468
1590929605245079552,d54b7e24c90cf40d468bdeb018e61440010a1049a4ae96e2c6331c215521f91c,2022-11-11 12:49:10,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"int main()\n{\n\tint n=0,i=2,j=2,a=0,b=0;\n\tscanf(\""%d\"",&n);\n\t\n\tfor(i=2;i<=n;i++)\n\t{\n\t\tfor(j=2;j<=i;j++)\n\t\t{\n\t\t\tif(i%j==0)\n\t\t\t{\n\t\t\t\ta++;\n\t\t\t}\n\t\t}\n\t\tif(a==1)\n\t\t{\n\t\t\tb++;\n\t\t}\n\t\ta=0;\n\t}\n\tprintf(\""%d\"",b);\n}",TIME_LIMIT_EXCEEDED,400,196
1590929625063141376,910d600982c42b3bf326994e410e7a344f2438b451c8f7deb6f6a9f965d3ee41,2022-11-11 12:49:15,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int a,i,n,g;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;)\n    {\n        scanf(\""%d\"",&n);\n        g=pow(6,n);\n        printf(\""%d\"",g%10);\n        i++;\n        if(i==a)\n            break;\n        printf(\""\\n\"");\n    }\n}",WRONG_ANSWER,6,312
1590929682441244672,d830b0bcae7881ad6d1b2e2b14f3ffa3695b6d3bd622856493fa1cf903c9bf4e,2022-11-11 12:49:28,Java,300.0,1590524835191705600,1572865591226855424,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint x = sc.nextInt();\n\t\tint y = sc.nextInt();\n\t\tint z = sc.nextInt();\n\t\tint res = x+y-z;\n\t\tSystem.out.print(res);\n\t}\n\t\n\t\n},ACCEPTED,236,16700
1590929686354530304,8f30a940fb84c0203b9f96b4d228374f10f9fdcb64182e702cd07fe56f0f3ee3,2022-11-11 12:49:29,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main{\n    int X,Y,Z;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    printf(\""%d\"",X+Y-Z);\n    return 0;\n}",COMPILE_ERROR,0,0
1590929701542105088,458af3c005e0b282d1ca88c254d9910ee2d93738b6f06d399f7444e1e64831eb,2022-11-11 12:49:33,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nmain(){\n    int a,n,i,b;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++){\n        scanf(\""%d\"",&b);\n        printf(\""6\"");\n        printf(\""\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,9,308
1590929712359190528,0b693affc66d8d407ff008bd1aaf4f2feb4a615f057943ba4b4ba3163d937dc6,2022-11-11 12:49:36,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.io.*;\nimport java.util.*;\n\npublic class Main {\n\n    public static void main(String[] args) throws IOException {\n        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n        Scanner sc=new Scanner(System.in);\n        int a=sc.nextInt();\n        String b=sc.next();\n        for (int i = 0; i < a-1; i++) {\n            System.out.println(6);\n        }\n        System.out.print(6);\n    }\n\n    /*private static boolean isZHI(int n) {\n        for (int i = 2; i <n/2+1 ; i++) {\n            if (n%i==0)\n                return false;\n        }\n        return true;//是质数\n    }*/\n\n\n},WRONG_ANSWER,367,19380
1590929718730358784,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-11 12:49:37,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,a[100];\n    scanf(\""%d\"",&n\\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]==0)\n            printf(\""0\\n\"");\n        else\n            printf(\""6\\n\"");\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1590929749034184704,8f30a940fb84c0203b9f96b4d228374f10f9fdcb64182e702cd07fe56f0f3ee3,2022-11-11 12:49:44,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main\n{\n    int X,Y,Z;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    printf(\""%d\"",X+Y-Z);\n    return 0;\n}",COMPILE_ERROR,0,0
1590929749139062784,5d127211f3edce9d9bd1062c03cd08473e4481ec46b4b0c70c2e8d9141c68f20,2022-11-11 12:49:44,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int i,n,t,y;\n    scanf(\""%d\\n\"",&t);\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&n);\n        y=pow(6,n);\n    }\n            printf(\""%d\\n\"",y%10);\n            printf(\""%d\\n\"",y%10);\n            printf(\""%d\"",y%10);\n}",WRONG_ANSWER,3,188
1590929781338734592,5a1c17b308a3b3595833d34c6bdfb75e9f5dd0d065acfeb7f28ab8102ba7406c,2022-11-11 12:49:52,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint n,i,j;\n\tint cnt = 0;\n\tscanf(\""%d\"",&n);\n\tfor(i=3;i<=n;i+=2)\n    {\n\t\tfor(j=2;j<i;j++){\n\t\t\tif(i%j==0)\n\t\t\t\tbreak;\n            }\n\t\tif(i==j){\n\t\t\tcnt++;\n\t\t}\n    }\n    printf(\""%d\"",cnt+1);\n\t\treturn 0;\n}\n",TIME_LIMIT_EXCEEDED,400,192
1590929805887995904,8f30a940fb84c0203b9f96b4d228374f10f9fdcb64182e702cd07fe56f0f3ee3,2022-11-11 12:49:58,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    printf(\""%d\"",X+Y-Z);\n    return 0;\n}",ACCEPTED,6,196
1590929847977840640,8f30a940fb84c0203b9f96b4d228374f10f9fdcb64182e702cd07fe56f0f3ee3,2022-11-11 12:50:08,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    printf(\""%d\"",X+Y-Z);\n}",ACCEPTED,6,324
1590929903208435712,73496b42506787a34bb10a5aafc7fd10eb41a2523cbde7368d617c3be48c111a,2022-11-11 12:50:21,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    long long a=1,b;\n    long i;\n    int n;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        a*=6;\n        b=a%10;\n        printf(\""%d\\n\"",b);\n    }    \n        \n    return 0;\n}",WRONG_ANSWER,11,340
1590929909638299648,8f30a940fb84c0203b9f96b4d228374f10f9fdcb64182e702cd07fe56f0f3ee3,2022-11-11 12:50:23,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    printf(\""%d\"",X+Y-Z);\n    return 0;\n}",ACCEPTED,6,192
1590929960418717696,73496b42506787a34bb10a5aafc7fd10eb41a2523cbde7368d617c3be48c111a,2022-11-11 12:50:35,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    long a=1,b;\n    long i;\n    int n;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        a*=6;\n        b=a%10;\n        printf(\""%d\\n\"",b);\n    }    \n        \n    return 0;\n}",WRONG_ANSWER,7,320
1590929972712247296,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 12:50:38,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"a=int(input())\ncount=0\n\nfor i in range(1,a):\n    m=0\n    for x in range(2,i):\n        if i%x==0:\n            m=1\n            break\n    if m==0:\n        count+=1\n\nprint(count-1)",TIME_LIMIT_EXCEEDED,400,2908
1590929992761020416,0aa773cdb5cb621d4131c7d2b98b0724b7e9e93f4310c787c0a9a219d05e0ff2,2022-11-11 12:50:42,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{int n,t,a;\nscanf(\""%d\"",&n);\nfor(t=0;t<n;t++)\n{\n    scanf(\""%d\"",&a);\n    if(a==0)\n        printf(\""1\\n\"");\n    else printf(\""6\\n\"");\n}\n\nreturn 0;\n }\n",ACCEPTED,8,328
1590930049908387840,6ba5ecacf3381a1e9382f99c413290eca40a071a563a618e5f36d66cbf9a5e1b,2022-11-11 12:50:56,Python,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"n=int(input())\nx=input().split(\"" \"")\ny=input().split(\"" \"")\na=[]\nb=[]\nfor i in range(0,len(x)):\n    a.append(int(x[i]))\nfor j in range(0,len(y)):\n    b.append(int(y[j]))\nc=[]\nfor i in range(0,n):\n    for j in range(i,n):\n        sum1 = 0\n        sum2 = 0\n        for z in range(i,j+1):\n            sum1+=a[z]\n            sum2+=b[z]\n        c.append(sum2-sum1)\nprint(max(c))",ACCEPTED,16,2872
1590930143873400832,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 12:51:19,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t,i;\n    int z,ed;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<t;i++)\n    {\n    z=(int)pow(6,a[i]);\n    ed=z%10;\n    printf(\""%d\\n\"",ed);}\n    return 0;\n}",WRONG_ANSWER,6,320
1590930162634502144,aa65cdf25cbe32699d085a61c4f3ec5a4020e6a3dc1e0e9d6e2a48c9288f8026,2022-11-11 12:51:23,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main1 {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int i = scanner.nextInt();\n        for (int j=0;j<i;j++){\n            int i1 = scanner.nextInt();\n            if (i1==0){\n                System.out.println(1);\n            }\n            else {\n                    System.out.println(6);\n                }\n            }\n        }\n    },COMPILE_ERROR,0,0
1590930195077464064,aa65cdf25cbe32699d085a61c4f3ec5a4020e6a3dc1e0e9d6e2a48c9288f8026,2022-11-11 12:51:31,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int i = scanner.nextInt();\n        for (int j=0;j<i;j++){\n            int i1 = scanner.nextInt();\n            if (i1==0){\n                System.out.println(1);\n            }\n            else {\n                    System.out.println(6);\n                }\n            }\n        }\n    },NON_ZERO_EXIT_CODE,239,19468
1590930209388408832,9819f13d6a58d50fa249ad037641119dadb52afb3f125db258771564f27d2ca5,2022-11-11 12:51:34,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n\nint main(){\n\tint n,x,i,m=0;\n\tscanf(\""%d\"", &n);\n\tfor (x = 1; x <= n; x++) {\n        int sign =1;\n    \tfor(i=2;i<x;i++){\n           if(x%i==0){      \n               sign=0;\n               break;\n            }\n        }\n        if(sign==1){\n            m++;\n        }\n\t}\n    printf(\""%d\\n\"",m-1);\n\treturn 0;\n}\n",TIME_LIMIT_EXCEEDED,400,460
1590930227503607808,458af3c005e0b282d1ca88c254d9910ee2d93738b6f06d399f7444e1e64831eb,2022-11-11 12:51:38,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nmain(){\n    int a,n,i,b;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++){\n        scanf(\""%d\"",&b);\n        printf(\""6\"");\n        if(a-i!=1){\n        printf(\""\\n\"");}\n    }\n    return 0;\n}",WRONG_ANSWER,7,328
1590930230129242112,7d46013a6da090b69b62e7be93e7628aee2f7eef31af37777b9ccf1fd1d3eb2e,2022-11-11 12:51:39,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main(){\n    int x,y,z;\n    0<=x=y=z<=100;\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n    return 0;\n}",COMPILE_ERROR,0,0
1590930263247466496,458af3c005e0b282d1ca88c254d9910ee2d93738b6f06d399f7444e1e64831eb,2022-11-11 12:51:47,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nmain(){\n    int a,n,i,b;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++){\n        scanf(\""%d\"",&b);\n        printf(\""6\"");\n        if(a-i!=1){\n        printf(\""\\n\"");}\n    }\n    return 0;\n}",WRONG_ANSWER,7,316
1590930278502150144,7d46013a6da090b69b62e7be93e7628aee2f7eef31af37777b9ccf1fd1d3eb2e,2022-11-11 12:51:51,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main(){\n    int x,y,z;\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n    return 0;\n}",ACCEPTED,8,192
1590930338346500096,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 12:52:05,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int a,n,i,t;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a);\n        if(a==0)\n        {\n            printf(\""1\\n\"");\n            continue;\n        }\n        else\n        {\n            t=a%4;\n            printf(\""%d\\n\"",pow(6,t));\n        }\n    }\n    \n}\n",WRONG_ANSWER,3,360
1590930341097967616,e4f316bfe970c62bf57b46f5ef8a290748707bf16f041fe868d04986a0cdd64f,2022-11-11 12:52:06,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,int n = 100000;\n\nbool flag[100000+1]; // flag[0] 无用的空间；\n\nint count() {\n\nint cnt = 0;\n\nflag[2] = 1;\n\nfor (int i = 3; i < n; ++i) {\n\nflag[i++] = 1; // 奇数位\n\nflag[i] = 0; // 偶数位直接过滤\n\n}\n\nfor (int i = 3; i <= sqrt(n*1.); ++i) {\n\nif (flag[i] != 1) continue;\n\nfor (int j = i*i; j <= n; j += i) {\n\n// 将倍数转换为加法\n\nflag[j] = 0;\n\n}\n\n}\n\nfor (int i = 1; i <= n; ++i)\n\ncnt += flag[i];\n\nreturn cnt;\n\n},COMPILE_ERROR,0,0
1590930369539543040,e4f316bfe970c62bf57b46f5ef8a290748707bf16f041fe868d04986a0cdd64f,2022-11-11 12:52:12,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,int n = 100000;\n\nbool flag[100000+1]; // flag[0] 无用的空间；\n\nint count() {\n\nint cnt = 0;\n\nflag[2] = 1;\n\nfor (int i = 3; i < n; ++i) {\n\nflag[i++] = 1; // 奇数位\n\nflag[i] = 0; // 偶数位直接过滤\n\n}\n\nfor (int i = 3; i <= sqrt(n*1.); ++i) {\n\nif (flag[i] != 1) continue;\n\nfor (int j = i*i; j <= n; j += i) {\n\n// 将倍数转换为加法\n\nflag[j] = 0;\n\n}\n\n}\n\nfor (int i = 1; i <= n; ++i)\n\ncnt += flag[i];\n\nreturn cnt;\n\n},COMPILE_ERROR,0,0
1590930387562442752,e4f316bfe970c62bf57b46f5ef8a290748707bf16f041fe868d04986a0cdd64f,2022-11-11 12:52:17,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,int n = 100000;\n\nbool flag[100000+1]; // flag[0] 无用的空间；\n\nint count() {\n\nint cnt = 0;\n\nflag[2] = 1;\n\nfor (int i = 3; i < n; ++i) {\n\nflag[i++] = 1; // 奇数位\n\nflag[i] = 0; // 偶数位直接过滤\n\n}\n\nfor (int i = 3; i <= sqrt(n*1.); ++i) {\n\nif (flag[i] != 1) continue;\n\nfor (int j = i*i; j <= n; j += i) {\n\n// 将倍数转换为加法\n\nflag[j] = 0;\n\n}\n\n}\n\nfor (int i = 1; i <= n; ++i)\n\ncnt += flag[i];\n\nreturn cnt;\n\n},NON_ZERO_EXIT_CODE,17,2884
1590930388669763584,458af3c005e0b282d1ca88c254d9910ee2d93738b6f06d399f7444e1e64831eb,2022-11-11 12:52:17,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main(){\n    int a,i,b;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++){\n        scanf(\""%d\"",&b);\n        printf(\""6\"");\n        if(a-i!=1){\n        printf(\""\\n\"");}\n    }\n    return 0;\n}",WRONG_ANSWER,10,312
1590930391928713216,129ddfe9d2d4553f365faf2fdc5e2f0c271b2e342a4cff13802dda8ef8b3d1c2,2022-11-11 12:52:18,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int n = s.nextInt();\n        int x = s.nextInt();\n        for (int j = 0; j < n; j++) {\n            if (j == n - 1) {\n                System.out.print(x==0?\""1\"":\""6\"");\n            } else {\n                System.out.println(x==0?\""1\"":\""6\"");\n            }\n        }\n    }\n}",NON_ZERO_EXIT_CODE,264,16548
1590930403035254784,fec6d07e317796c63fb7ae6e7538f75973ad64af6e6196cc27eed3e9e685bf86,2022-11-11 12:52:20,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int b,i;\n    scanf(\""%d\"",&b);\n    int a[100],c[100];\n    int max=0,sum=0;\n    for(i=0;i<b;i++)\n        scanf(\""%d\"",&a[i]);\n    for( i=0;i<b;i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=0;i<b;i++)\n    {\n        sum=sum-a[i]+c[i];\n        if(sum>max)\n            max=sum;\n    }\n    printf(\""%d\\n\"",max);\n}",WRONG_ANSWER,3,320
1590930472920723456,39afbda4ab6a7df2673bc0d0eec048a42b23ada2774ec941935a2b2fa044515a,2022-11-11 12:52:37,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <bits/stdc++.h>\nusing namespace std;\nint main(){\nint n,y=0,i=1,j=1,m=0,c=0;\ncin>>n;\nfor(i=1;i<=n;i++){\n    for(j=1;j<=i;j++){\n        if(i%j==0&&i!=j&&j!=1)y--;\n            else y++;\n            m++;\n    }\n    if(y==m)c++;\n    y=0;\n    m=0;\n}\ncout<<c-1;\n}\n",TIME_LIMIT_EXCEEDED,400,312
1590930485717565440,5bd1a8718ea7fb820055421c67b8e0a468e08d951f729a24e55bf407b3bdb1f6,2022-11-11 12:52:40,C++,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <iostream>\nusing namespace std;\nint main(){\n    int n;\n    cin>>n;\n    int arr1[n],arr2[n],w[n];\n    for(int i=0;i<n;i++){\n        cin>>arr1[i];\n        w[i]=arr2[i]-arr1[i];\n    }\n    for(int i=0;i<n;i++){\n        cin>>arr2[i];\n        w[i]=arr2[i]-arr1[i];\n    }\n    int sum=0,b=0;\n    for(int j=0;j<n;j++){\n        if(b>0) b+=w[j];\n        else b=w[j];\n        if(b>sum) sum=b;\n    }\n    cout<<sum;\n    return 0;\n}",ACCEPTED,5,324
1590930532672778240,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 12:52:51,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int a,n,i,t;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a);\n        if(a==0)\n        {\n            printf(\""1\\n\"");\n            continue;\n        }\n        else\n        {\n            t=a%4;\n            printf(\""%d\"",pow(6,t));\n            if(i!=n-1) printf(\""\\n\"");\n        }\n    }\n    \n}\n",WRONG_ANSWER,3,332
1590930560812363776,e4f316bfe970c62bf57b46f5ef8a290748707bf16f041fe868d04986a0cdd64f,2022-11-11 12:52:58,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"//8.求出1-N中的所有素数\n#include<stdio.h>\nmain()\n{\n\tint a,i,j;\n\tscanf(\""%d\"",&a);\n\tprintf(\""素数:\""); \n\tfor(i=2;i<=a;i++)\n\t\t{\n\t\tfor(j=2;j<=i;j++)\n\t\t\tif(i%j==0)\n\t\t\t\tbreak;\n\t\tif(i==j)\n\t\t\tprintf(\""%-5d\"",i);\n\t\t}\n}\n",TIME_LIMIT_EXCEEDED,400,184
1590930567758155776,e9a50f3e071443bb6fb229966bff355c178d484f6cc10e5e1fc8dc5a537237ba,2022-11-11 12:53:00,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint shusu();\nint main()\n{\n    int a,b,i,j;\n    b=1;\n    scanf(\""%d\"",&a);\n    if(a!=2)\n    {for(i=3;i<=a;i+=2)\n    {\n        for(j=2;j*j<=i;j++)\n        {\n            if(i%j==0)\n                break;\n        }\n        if(j*j>i)\n        {\n            b++;\n        }\n    }\n    }\n    else  b=1;\n    printf(\""%d\"",b);\n}\n\n",ACCEPTED,13,196
1590930596338139136,281adcca8943f9f4c0ced14f1ceffe157a34fca39f3cb864eb95e400944e38a8,2022-11-11 12:53:06,Java,300.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.*;\nclass Main{\n    public static void main(String[] args){\n        Scanner scan=new Scanner(System.in);\n        int a=scan.nextInt();\n        int res=0;\n        for(int i=1;i<a;i++){\n            if(isSu(i)){\n                res++;\n            }\n        }\n        System.out.println(res);\n    }\n    static boolean isSu(int a){\n        for(int i=2;i<Math.sqrt(a)+1;i++){\n            if(a%i==0){\n                return false;\n            }\n        }\n        return true;\n    }\n},ACCEPTED,246,17180
1590930600112992256,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-11 12:53:07,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,a[100];\n    scanf(\""%d\"",&n\\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]==0)\n            printf(\""0\\n\"");\n        else\n            printf(\""6\\n\"");\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1590930615988432896,458af3c005e0b282d1ca88c254d9910ee2d93738b6f06d399f7444e1e64831eb,2022-11-11 12:53:11,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main(){\n    int a,i,b;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++){\n        scanf(\""%d \"",&b);\n        printf(\""6\"");\n        if(a-i!=1){\n        printf(\""\\n\"");}\n    }\n    return 0;\n}",WRONG_ANSWER,6,200
1590930618668593152,0cfbb4a339ebbc4dce13b5f3e3f98a3def0ab17ef5b4ac8e6d566de92e1f5f78,2022-11-11 12:53:12,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\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    }\n    for(int i=0;i<n;i++){\n        if(a[i]!=0){\n            printf(\""6\\n\"");\n        }\n    }\n}",WRONG_ANSWER,7,208
1590930648888573952,129ddfe9d2d4553f365faf2fdc5e2f0c271b2e342a4cff13802dda8ef8b3d1c2,2022-11-11 12:53:19,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int n = s.nextInt();\n\n        for (int j = 0; j < n; j++) {\n            int x = s.nextInt();\n            if (j == n - 1) {\n                System.out.print(x==0?\""1\"":\""6\"");\n            } else {\n                System.out.println(x==0?\""1\"":\""6\"");\n            }\n        }\n    }\n}",NON_ZERO_EXIT_CODE,230,19604
1590930655242948608,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-11 12:53:20,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,a[100];\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]==0)\n            printf(\""0\\n\"");\n        else\n            printf(\""6\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,9,352
1590930664285843456,0aa773cdb5cb621d4131c7d2b98b0724b7e9e93f4310c787c0a9a219d05e0ff2,2022-11-11 12:53:23,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{int n,t,a;\nscanf(\""%d\"",&n);\nfor(t=0;t<n;t++)\n{\n    scanf(\""%d\"",&a);\n    if(a==0)\n        printf(\""1\\n\"");\n    else printf(\""6\\n\"");\n}\n\nreturn 0;\n }\n",ACCEPTED,8,316
1590930704484073472,e4f316bfe970c62bf57b46f5ef8a290748707bf16f041fe868d04986a0cdd64f,2022-11-11 12:53:32,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"void FindSuShu(int n)\n{\n    int i = 0, j = 0;\n    int count = 0;\n    for (i = 1; i <= n; i++)\n    {\n        for (j = 2; j < i; j++)\n        {\n            if (i%j == 0)\n                break;\n\n        }\n        if (i == j)\n        {\n            printf(\""%d \"", i);\n            count++;\n\n            if (count % 5 == 0)\n                printf(\""\\n\"");\n        }\n\n    }\n}\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"", &n);\n    FindSuShu(n);\n    printf(\""\\n\"");\n    return 0;\n}",TIME_LIMIT_EXCEEDED,400,296
1590930717633196032,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 12:53:35,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"\ndata = int(input())\ns=0\nfor i in range(2, data+1):\n    for j in range(2, i//2):\n        if i % j == 0:\n            break\n        elif j == i // 2 - 1:\n            s=s+1\n        else:\n            continue\n",TIME_LIMIT_EXCEEDED,400,2876
1590930806200119296,e4f316bfe970c62bf57b46f5ef8a290748707bf16f041fe868d04986a0cdd64f,2022-11-11 12:53:56,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint sushu(int n)\n{\n    int k=0,m=0,i;\n    for(i=2;i<=n/2;i++)\n    {\n        k+=1;\n    if(n%i==0)\n        m+=0;\n    else\n        m+=1;\n    }\nif(m==k)\nreturn 1;\n}\nvoid main()\n{\n\n    int i,n,m=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n    if(sushu(i)==1)\n    {\n        printf(\""% d\"",i);\n        m=m+1;\n        if(m%5==0)\n        printf(\""\\n\"");\n    }\n}\n",WRONG_ANSWER,9,836
1590930873732628480,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-11 12:54:13,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int n,i,a;\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++)\n        scanf(\""%d\"",%i);\n    a=pow(6,i);\n    a%=10;\n    printf(\""%d,a\"");\n    return 0;\n}\n    ",COMPILE_ERROR,0,0
1590930878807740416,fa305ee4bf4c6a54add4e945b551f1e902b95c1a179a91ded55bf7ebb1c87c23,2022-11-11 12:54:14,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{   int i,j,n,s=0;\n    scanf(\""%d\"",&n);\n    for (i=2;i<=n;i++) {\n            int flag=1;\n          for (j=2;j<=sqrt(i);j++) {\n            if (i%j==0) break;\n            \n        }\n      if(j>sqrt(i)) s++;\n     }\n    printf(\""%d\\n\"",s);\n    return 0;\n}",ACCEPTED,13,324
1590930970163871744,617f184ce583e9f7a346564ab5659fda0ca35a3a714a0c929cb07f915f4f514b,2022-11-11 12:54:36,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n   printf(\""2022\"");\n    return 0;\n}",ACCEPTED,3,192
1590931035754377216,0b693affc66d8d407ff008bd1aaf4f2feb4a615f057943ba4b4ba3163d937dc6,2022-11-11 12:54:51,Java,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.io.*;\nimport java.util.*;\n\npublic class Main {\n\n    public static void main(String[] args) throws IOException {\n        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n        Scanner sc=new Scanner(System.in);\n        int a=sc.nextInt();\n        sc.next();\n        String[] b=sc.nextLine().split(\"" \"");\n        for (int i = 0; i < a; i++) {\n            if (b[i].equals(\""0\""))\n                System.out.print(1);\n            else\n                System.out.print(6);\n            if (i!=a-1)\n                System.out.println();\n        }\n    }\n\n    /*private static boolean isZHI(int n) {\n        for (int i = 2; i <n/2+1 ; i++) {\n            if (n%i==0)\n                return false;\n        }\n        return true;//是质数\n    }*/\n\n\n}",ACCEPTED,343,17040
1590931098102730752,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-11 12:55:06,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int temp = sc.nextInt();\n        for (int i = 0;i < temp;i++) {\n            int num = sc.nextInt();\n            System.out.println(num == 0 ? 1 : 6);\n        }\n    }\n},WRONG_ANSWER,246,16192
1590931111184764928,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-11-11 12:55:09,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"t=int(input())\nnums=input().split(' ')\nn=[]\nfor i in range(0,len(nums)):\n    n.append(int(nums[i]))\n    print(pow(6, n[i]) % 10)",TIME_LIMIT_EXCEEDED,165,3944
1590931124405207040,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-11 12:55:12,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,a[n];\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]==0)\n            printf(\""0\\n\"");\n        else\n            printf(\""6\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,11,200
1590931223600496640,e715137eeb4190ade2330123b989bbdd6eebd9a5e1df2e292271d3bfe3a79c69,2022-11-11 12:55:36,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n\n   int a[900],b[900],c[900];\nint main()\n{\n    int i,j,k,n;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    c[0]=b[0]-a[0];\n    for(i=1;i<n;i++)\n    {\n        c[i]=c[i-1]+b[i]-a[i];\n    }\n   k=c[0];\n    for(i=1;i<n;i++)\n    {\n        if(k<c[i])\n            k=c[i];\n    }\n    printf(\""%d\\n\"",k);\n    return 0;\n}",WRONG_ANSWER,3,320
1590931226704261120,129ddfe9d2d4553f365faf2fdc5e2f0c271b2e342a4cff13802dda8ef8b3d1c2,2022-11-11 12:55:37,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int n = s.nextInt();\n        for (int j = 0; j < n; j++) {\n            int x = s.nextInt();\n                System.out.println(x==0?\""1\"":\""6\"");\n\n        }\n    }\n}",NON_ZERO_EXIT_CODE,253,19520
1590931262620086272,aa65cdf25cbe32699d085a61c4f3ec5a4020e6a3dc1e0e9d6e2a48c9288f8026,2022-11-11 12:55:45,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main1 {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int i = scanner.nextInt();\n        for (int j=0;j<i;j++){\n            int i1 = scanner.nextInt();\n            if (i1==0){\n                System.out.println(1);\n            }\n            else {\n                    System.out.println(6);\n                }\n            }\n        }\n    }\n\n\n,COMPILE_ERROR,0,0
1590931271159713792,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-11 12:55:47,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,a[];\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]==0)\n            printf(\""0\\n\"");\n        else\n            printf(\""6\\n\"");\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1590931297982283776,aa65cdf25cbe32699d085a61c4f3ec5a4020e6a3dc1e0e9d6e2a48c9288f8026,2022-11-11 12:55:54,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main{\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int i = scanner.nextInt();\n        for (int j=0;j<i;j++){\n            int i1 = scanner.nextInt();\n            if (i1==0){\n                System.out.println(1);\n            }\n            else {\n                    System.out.println(6);\n                }\n            }\n        }\n    }\n\n\n,WRONG_ANSWER,250,16744
1590931321004818432,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 12:55:59,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"a=int(input())\ncount=0\nfor i in range(1,a):\n    m=0\n    for x in range(2,i):\n        if i%x==0:\n            m=1\n            break\n    if m==0:\n        count+=1\nprint(count-1)",TIME_LIMIT_EXCEEDED,400,2760
1590931337723318272,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-11 12:56:03,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,a[10];\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]==0)\n            printf(\""0\\n\"");\n        else\n            printf(\""6\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,7,316
1590931367368658944,aa65cdf25cbe32699d085a61c4f3ec5a4020e6a3dc1e0e9d6e2a48c9288f8026,2022-11-11 12:56:10,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main{\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int i = scanner.nextInt();\n        for (int j=0;j<i;j++){\n            int i1 = scanner.nextInt();\n            if (i1==0){\n                System.out.println(1);\n            }\n            else {\n                    System.out.println(6);\n                }\n            }\n        }\n    }\n\n\n,WRONG_ANSWER,232,16488
1590931379423088640,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 12:56:13,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t,i;\n    int z,ed;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<t;i++)\n    {\n    z=(int)(pow(6,a[i])+0.1);\n    ed=z%10;\n    printf(\""%d\\n\"",ed);}\n    return 0;\n}",WRONG_ANSWER,6,352
1590931390311497728,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-11 12:56:16,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int temp = sc.nextInt();\n        int num;\n        for (int i = 0;i < temp;i++) {\n            num = sc.nextInt();\n            System.out.println(num == 0 ? \""1\"" : \""6\"");\n        }\n    }\n}",WRONG_ANSWER,232,16628
1590931422662168576,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 12:56:23,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint mynum1(int N)\n{\n    int i,c;\n\n    c=1;\n    for (i=1;i<=N;i++)\n    {\n        c=c*6;\n    }\n    c=c%10;\n    return c;\n}\n\nint main()\n{\n    int t,N,i;\n    int n;\n    scanf(\""%d\"", &t);\n    for(int j=0;j<t;j++){\n        scanf(\""%d\"",&n);\n    }\n    for (i=1; i<=t; i++)\n    {\n        scanf(\""%d\"", &N);\n        printf(\""%d\\n\"", mynum1(N));\n    }\n\n}",WRONG_ANSWER,4,312
1590931495949242368,7c6d208c4c4b695bc8d6f8ae0c0357c2466f5c9f86ec0652674812219ac09d38,2022-11-11 12:56:41,Java,300.0,1590681458522583041,1590676393489461248,1049226928954454016,import javax.xml.transform.Source;\nimport java.util.Scanner;\n\nimport static java.lang.Math.sqrt;\n\npublic class Main {\n    public static void main(String[] args)  {\n        Scanner sc = new Scanner(System.in);\n        int a = sc.nextInt();\n        int sum = 0;\n        for (int i = 1; i < a; i += 2) {\n            boolean flag = true;\n            for (int j = 2; j <= Math.sqrt(i); j++) {\n                if (i % j == 0) {\n                    flag = false;\n                    break;\n                }\n            }\n            if (flag) {\n                sum++;\n            }\n        }\n        System.out.println(sum);\n    }\n\n}\n,ACCEPTED,254,16540
1590931497605988352,39afbda4ab6a7df2673bc0d0eec048a42b23ada2774ec941935a2b2fa044515a,2022-11-11 12:56:41,C++,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n    printf(\""2022\"");\n}",ACCEPTED,4,320
1590931525602967552,e0a829315cc9947a3e714cd579e3322e8dee5f8ca36e30fd276de5a8e294b6f8,2022-11-11 12:56:48,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,x,y,z;\n    int i,e;\n    scanf(\""%d\\n\"",&n);\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    for(i=0;i<n;i++)\n    {\n    printf(\""6\\n\"");}\n    return 0;\n}\n",WRONG_ANSWER,10,312
1590931589729685504,a2fa7eb1ab1c2f6fa23517852ee6971ea32fd0c7742d71d7914ed729415f04d9,2022-11-11 12:57:03,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main(){\n\tint t,a;\n\tcin>>t; \n\tfor(int i=1;i<=t;i++)\n\t    cin>>a;\n\tfor(int i=1;i<=t;i++)\n\t    cout<<6;\n\t    return 0;\n}",WRONG_ANSWER,10,476
1590931666741297152,a2fa7eb1ab1c2f6fa23517852ee6971ea32fd0c7742d71d7914ed729415f04d9,2022-11-11 12:57:22,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main(){\n\tint t,a;\n\tcin>>t; \n\tfor(int i=1;i<=t;i++)\n\t    cin>>a;\n\tfor(int i=1;i<=t;i++)\n\t    cout<<6<<endl;\n\t    return 0;\n}",WRONG_ANSWER,10,456
1590931673280196608,e0a829315cc9947a3e714cd579e3322e8dee5f8ca36e30fd276de5a8e294b6f8,2022-11-11 12:57:23,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,x,y,z;\n    int i;\n    scanf(\""%d\\n\"",&n);\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    for(i=0;i<n;i++)\n    {\n    printf(\""6\\n\"");}\n    return 0;\n}\n",WRONG_ANSWER,8,312
1590931723146276864,129ddfe9d2d4553f365faf2fdc5e2f0c271b2e342a4cff13802dda8ef8b3d1c2,2022-11-11 12:57:35,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int n = s.nextInt();\n        for (int j = 0; j < n; j++) {\n            int x = s.nextInt();\n            if (j == n - 1) {\n                if(x==0) {\n                    System.out.print(1);\n                }else{\n                    System.out.print(6);\n                }\n            } else {\n                if(x==0) {\n                    System.out.println(1);\n                }else{\n                    System.out.println(6);\n                }\n            }\n        }\n    }\n},NON_ZERO_EXIT_CODE,245,16988
1590931748039471104,458af3c005e0b282d1ca88c254d9910ee2d93738b6f06d399f7444e1e64831eb,2022-11-11 12:57:41,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main(){\n    int a,i,b;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++){\n        scanf(\""%d\"",&b);\n    }\n    for(i=0;i<a;i++){\n        printf(\""%d\"",6);\n        printf(\""\\n\"");}\n    return 0;\n}",WRONG_ANSWER,10,320
1590931769250086912,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-11 12:57:46,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int n,i,a;\n    scanf(\""%d\"",&n);\n    if(n==0)\n        printf(\""1\"");\n    for(i=1;i<=n;i++)\n        printf(\""6\"");\n    return 0;\n}\n    ",WRONG_ANSWER,9,336
1590931811155357696,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-11 12:57:56,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int n,i,;\n    scanf(\""%d\"",&n);\n    if(n==0)\n        printf(\""1\"");\n    for(i=1;i<=n;i++)\n        printf(\""6\"");\n    return 0;\n}\n    ",COMPILE_ERROR,0,0
1590931823729905664,a2fa7eb1ab1c2f6fa23517852ee6971ea32fd0c7742d71d7914ed729415f04d9,2022-11-11 12:57:59,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main(){\n\tlong long t,a;\n\tcin>>t; \n\tfor(int i=1;i<=t;i++)\n\t    cin>>a;\n\tfor(int i=1;i<=t;i++)\n\t    cout<<6<<endl;\n\t    return 0;\n}",WRONG_ANSWER,12,444
1590931832990904320,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-11 12:58:01,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int n,i;\n    scanf(\""%d\"",&n);\n    if(n==0)\n        printf(\""1\"");\n    for(i=1;i<=n;i++)\n        printf(\""6\"");\n    return 0;\n}\n    ",WRONG_ANSWER,9,320
1590931849164161024,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 12:58:05,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"\ndata = int(input())\ns=0\nfor i in range(2, data+1):\n    for j in range(2, i//2+1):\n        if i % j == 0:\n            break\n    else:\n        s=s+1\nprint(s)",TIME_LIMIT_EXCEEDED,400,2764
1590931862338449408,aa65cdf25cbe32699d085a61c4f3ec5a4020e6a3dc1e0e9d6e2a48c9288f8026,2022-11-11 12:58:08,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main{\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int i = scanner.nextInt();\n        for (int j=0;j<i;j++){\n            int i1 = scanner.nextInt();\n            if (i1==0){\n                System.out.println(1);\n            }\n            else {\n                    System.out.println(6);\n                }\n            }\n        }\n    }\n\n\n,NON_ZERO_EXIT_CODE,238,16804
1590931901202870272,458af3c005e0b282d1ca88c254d9910ee2d93738b6f06d399f7444e1e64831eb,2022-11-11 12:58:17,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main(){\n    int a,i,b;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++){\n        scanf(\""%d\"",&b);\n    }\n    for(i=0;i<a;i++){\n        printf(\""%d\"",6);\n        if(a-i!=1){\n        printf(\""\\n\"");}\n    }\n    return 0;\n}",WRONG_ANSWER,10,328
1590931904155660288,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-11 12:58:18,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int temp = sc.nextInt();\n        for (int i = 0;i < temp;i++) {\n            int num = sc.nextInt();\n            System.out.println(num == 0 ? 1 : 6);\n        }\n    }\n},COMPILE_ERROR,0,0
1590931922841284608,aa65cdf25cbe32699d085a61c4f3ec5a4020e6a3dc1e0e9d6e2a48c9288f8026,2022-11-11 12:58:23,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main{\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int i = scanner.nextInt();\n        for (int j=0;j<i;j++){\n            int i1 = scanner.nextInt();\n            if (i1==0){\n                System.out.println(1);\n            }\n            else {\n                    System.out.println(6);\n                }\n            }\n        }\n    }\n\n\n,NON_ZERO_EXIT_CODE,239,16744
1590931963609919488,0ccbaaa612b3d01dbe621ce5e7366d6e26d2e5adf55047d92c6eb7adf78a979d,2022-11-11 12:58:32,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int N;\n    int x,count=0;\n    scanf(\""%d\"",&N);\n\n    for (x=1;x<N+1;x++){\n        int i=2;\n        int isprime=1;\n        for (i=2;i<x;i++){\n            if (x%i==0){ \n            isprime=0;\n            break;}  \n        }\n        if (isprime==1){\n        count++;}\n    }\n\tcout<<count-1;\n    return 0;\n}",TIME_LIMIT_EXCEEDED,400,320
1590931971272937472,864c0dc14d6d917707294bc7e18ea53a2c0536c5d47f3d25f94f0188f106014f,2022-11-11 12:58:34,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main(){\n    int t,i;\n    int a[100];\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    long s=1,k,j;\n    for( k=0;k<t;k++){\n        for( j=0;j<a[k];j++){\n            s=s*6;\n        }\n         a[k]=s%10;\n    }\n    for(int i=0;i<t;i++){\n        printf(\""%d\\n\"",a[i]);\n    }\n    return 0;\n}",TIME_LIMIT_EXCEEDED,23,316
1590931981528010752,39afbda4ab6a7df2673bc0d0eec048a42b23ada2774ec941935a2b2fa044515a,2022-11-11 12:58:37,C++,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <bits/stdc++.h>\nusing namespace std;\nint main(){\nint x,y,z;\ncin>>x>>y>>z;\ncout<<x+y-z;\n}\n",ACCEPTED,8,440
1590932007528497152,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-11 12:58:43,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\nclass Main{\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int temp = sc.nextInt();\n        for (int i = 0;i < temp;i++) {\n            int num = sc.nextInt();\n            System.out.println(num == 0 ? 1 : 6);\n        }\n    }\n},NON_ZERO_EXIT_CODE,237,17096
1590932045042331648,aa65cdf25cbe32699d085a61c4f3ec5a4020e6a3dc1e0e9d6e2a48c9288f8026,2022-11-11 12:58:52,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main{\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int i = scanner.nextInt();\n        for (int j=0;j<i;j++){\n            int i1 = scanner.nextInt();\n            if (i1==0){\n                System.out.println(1);\n            }\n            else {\n                    System.out.println(6);\n                }\n            }\n        }\n    }\n\n\n,WRONG_ANSWER,250,16980
1590932048745902080,7ecf54bf0ea2db8ab0397aa941f19ec79a351bc3e86e8c01673aa09a69b3a6db,2022-11-11 12:58:53,Python,300.0,1590681458522583040,1590675153003077632,1049226928954454016,x = int(input())\nn = input().split()\nfor i in n:\n    if(i=='0'):\n        print('1')\n    else:\n        print('6'),ACCEPTED,45,2872
1590932058552205312,e4f316bfe970c62bf57b46f5ef8a290748707bf16f041fe868d04986a0cdd64f,2022-11-11 12:58:55,C++,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n\tint n,f;\n\tcin >> n;\n\tint cnt = 0;\n\t\tfor (int i = 2; i <= n; i++)\n\t\t{\n\t\t\tf=1;\n\t\t\tfor(int j = 2; j <=sqrt(i); j++)\n\t\t\t{\n\t\t\t\tif(i%j==0){\n\t\t\t\t\tf=0;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(f){\n\t\t\t//cout << i << endl ;\n\t\t\tcnt++;\n\t\t\t}\n\t\t}\n\tcout << cnt<< endl;\n\treturn 0;\n}\n\n\n",ACCEPTED,13,448
1590932068698230784,15ac7d06a472ca25d78349f7cc3a73d23c7d7a4f0c4ae3cec6200fcdb8135965,2022-11-11 12:58:57,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,m,t,x,i;\n    scanf(\""%d\\n\"",&t);\n    for(i=1;i<=t;i++){\n        scanf(\""%d\"",&x);\n        if(x==1){\n    printf(\""0\"");\n} else{\n    printf(\""6\"");\n}\n    }\n\n\n\n\n    return 0;\n}\n",WRONG_ANSWER,8,324
1590932124822188032,a2fa7eb1ab1c2f6fa23517852ee6971ea32fd0c7742d71d7914ed729415f04d9,2022-11-11 12:59:11,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main(){\n\tlong long t,a;\n\tcin>>t; \n\tfor(int i=1;i<=t;i++)\n\t    cin>>a;\n    cout<<6;\n\tfor(int i=2;i<=t;i++)\n\t    cout<<endl<<6;\n\t    return 0;\n}",WRONG_ANSWER,12,484
1590932132959158272,aa65cdf25cbe32699d085a61c4f3ec5a4020e6a3dc1e0e9d6e2a48c9288f8026,2022-11-11 12:59:13,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main{\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int i = scanner.nextInt();\n        for (int j=0;j<i;j++){\n            int i1 = scanner.nextInt();\n            if (i1==0){\n                System.out.println(1);\n            }\n            else {\n                    System.out.println(6);\n                }\n            }\n        }\n    }\n\n\n,WRONG_ANSWER,249,17292
1590932144841601024,15ac7d06a472ca25d78349f7cc3a73d23c7d7a4f0c4ae3cec6200fcdb8135965,2022-11-11 12:59:16,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,m,t,x,i;\n    scanf(\""%d\\n\"",&t);\n    for(i=1;i<=t;i++){\n        scanf(\""%d\"",&x);\n        if(x==1){\n    printf(\""0\\n\"");\n} else{\n    printf(\""6\\n\"");\n}\n    }\n\n\n\n\n    return 0;\n}\n",WRONG_ANSWER,9,196
1590932234541006848,0b693affc66d8d407ff008bd1aaf4f2feb4a615f057943ba4b4ba3163d937dc6,2022-11-11 12:59:37,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.io.*;\nimport java.util.*;\n\npublic class Main {\n\n    public static void main(String[] args) throws IOException {\n        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n        Scanner sc=new Scanner(System.in);\n        int a=sc.nextInt();\n        int res=0;\n        for (int i = 2; i <= a; i++) {\n            if (isZHI(i))\n                res++;\n        }\n        System.out.println(res);\n    }\n\n    private static boolean isZHI(int n) {\n        for (int i = 2; i <n/2+1 ; i++) {\n            if (n%i==0)\n                return false;\n        }\n        return true;//是质数\n    }\n\n\n},TIME_LIMIT_EXCEEDED,400,16552
1590932289675112448,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-11 12:59:50,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"include<stdio.h>\nint main()\n{\n    printf(\""2022\"")\n}",COMPILE_ERROR,0,0
1590932347216769024,458af3c005e0b282d1ca88c254d9910ee2d93738b6f06d399f7444e1e64831eb,2022-11-11 13:00:04,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int a,i,b;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++){\n        scanf(\""%d\"",&b);\n    }\n    for(i=0;i<a;i++){\n        printf(\""%d\"",6);\n        if(a-i!=1){\n        printf(\""\\n\"");}\n    }\n    return 0;\n}",WRONG_ANSWER,9,368
1590932357958381568,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-11 13:00:06,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"include<stdio.h>\nint main()\n{\n    printf(\""2022\"");\n}",COMPILE_ERROR,0,0
1590932364224696320,15ac7d06a472ca25d78349f7cc3a73d23c7d7a4f0c4ae3cec6200fcdb8135965,2022-11-11 13:00:08,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,m,t,x,i;\n    scanf(\""%d\\n\"",&t);\n    for(i=1;i<=t;i++){\n        scanf(\""%d\"",&x);\n        if(x==0){\n    printf(\""1\\n\"");\n} else{\n    printf(\""6\\n\"");\n}\n    }\n\n\n\n\n    return 0;\n}\n",ACCEPTED,12,520
1590932387851210752,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-11 13:00:14,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"include<stdio.h>\nint main()\n{\n    printf(\""2022\"");\n}",COMPILE_ERROR,0,0
1590932397976236032,1a4463a67236431e94a4a4d273d88450d6acce220fed7155af8798b0664ee731,2022-11-11 13:00:16,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n    cout << \""2022\"" << endl;\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590932467970805760,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-11 13:00:33,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"include<stdio.h>\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",COMPILE_ERROR,0,0
1590932488300593152,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-11 13:00:37,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"include<stdio.h>\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",COMPILE_ERROR,0,0
1590932490854903808,64f8dab58af431d48e3c413e8710a37cc2c583e883c731d70cd5a4e026299255,2022-11-11 13:00:38,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main(){\n    int i=2022;\nprintf (\""%d\"",i);\nreturn 0;\n}",ACCEPTED,3,308
1590932553610080256,864c0dc14d6d917707294bc7e18ea53a2c0536c5d47f3d25f94f0188f106014f,2022-11-11 13:00:53,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main(){\n    int t,i;\n    int a[100];\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    long s=1,k,j;\n    for( k=0;k<t;k++){\n        for( j=0;j<a[k];j++){\n            s=s*6;\n        }\n         a[k]=s%10;\n        printf(\""%d\\n\"",a[k]);\n    }\n    return 0;\n}",TIME_LIMIT_EXCEEDED,22,320
1590932565605810176,6383c93cbdef4af3eda29400a925819f16ad4afc8368e604ccd580cba7055bdd,2022-11-11 13:00:56,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n    int x = 6;\n    int i;\n    int res = 0;\n    int t;\n    scanf(\""%d\"",&t);\n    for(i=1;i<t;i++){\n        x*=6;\n    }\n    printf(\""%d\\n\"",x);\n    int n;\n    n = x%10;\n    printf(\""%d\"",n);\n\n    return 0;\n}\n",WRONG_ANSWER,5,324
1590932577400172544,1019ea4e8e67338c8191b6e52878cb69ca9287130af71af3517596fded2f21e4,2022-11-11 13:00:59,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n\n  int X,Y,Z,i;\n  scanf(\""%d %d %d\"",&X,&Y,&Z);\n  i=X+Y-Z;\n  printf(\""%d\"",i);\n  return 0;\n}\n",ACCEPTED,6,344
1590932626783928320,001baa7272d47ab2d3a9b57bf7838570ff03ab1cabb738e7b342b652b1e42a83,2022-11-11 13:01:10,C++,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include <iostream>\n#include<bits/stdc++.h>\n\nusing namespace std;\n\n//  向上取整    向下取整\n//  ceil()       floor()\n\n\n\nint main() {\n    int t;\n    scanf(\""%d\"",&t);\n    int a[t],b[t];\n    for(int i=0;i<t;i++)\n        scanf(\""%d\"",&a[i]);\n    for(int i=0;i<t;i++)\n        scanf(\""%d\"",&b[i]);\n    int wmax=-1, wsum;\n    for(int i=0;i<t;i++){\n        wsum=0;\n        for(int j=i;j<t;j++){\n            wsum=wsum-a[j]+b[j];\n            if(wsum>wmax)\n                wmax=wsum;\n        }\n    }\n    printf(\""%d\\n\"",wmax);\n    return 0;\n\n\n\n}\n",ACCEPTED,6,308
1590932633356402688,64f8dab58af431d48e3c413e8710a37cc2c583e883c731d70cd5a4e026299255,2022-11-11 13:01:12,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n\nint main(){\n\n    int x,y,z;\n\n    int a;\n\n    scanf(\""%d%d%d\"",&x,&y,&z);\n\n    a=x+y-z;\n\n    printf(\""%d\"",a);\n\n    return 0;\n\n}",ACCEPTED,5,316
1590932643284320256,06b00897262b024d9e66dcd771cf81de9b63954f7a4554699d17c2158114c0d1,2022-11-11 13:01:14,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main(){\n    int a;\n    scanf(\""%d\"",&a);\n    int b[a];\n    int i=0;\n    for(i;i<a;i++){\n        scanf(\""%d\"",&b[i]);\n    }\n    int j=0;\n    for(j;j<a;j++){\n        if(b[i]==0){\n            printf(\""1\\n\"");\n        }else{\n            printf(\""6\\n\"");\n        }\n    }\n}",WRONG_ANSWER,2,328
1590932647520546816,6383c93cbdef4af3eda29400a925819f16ad4afc8368e604ccd580cba7055bdd,2022-11-11 13:01:15,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n    int x = 6;\n    int i;\n    int t;\n    scanf(\""%d\"",&t);\n    for(i=1;i<t;i++){\n        x*=6;\n    }\n    printf(\""%d\\n\"",x);\n    int n;\n    n = x%10;\n    printf(\""%d\"",n);\n\n    return 0;\n}\n",WRONG_ANSWER,3,188
1590932648820805632,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-11 13:01:16,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n\nsushu(int i,int n);\n\nint main()\n\n{\n\n    int n,i,count=0;\n\n    scanf(\""%d\"",&n);\n\n    for(i=1;i<=n;i++)\n\n    if(sushu(i,n)==1)\n\n    count++;\n\n    printf(\""%d\"",count);\n\n    return 0;\n\n}\n\nsushu(i,n)\n\n{\n\nint j;\n\nif(i==2)\n\nreturn 1;\n\nelse if(i==1||i%2==0) \n\nreturn 0;\n\n\tfor (i=3;j<=i;j++)\t{\n\n\t\tif(i%j==0) return 0;\n\n\t}\n\n\treturn 1;\n\n}",FLOAT_POINT_EXCEPTION,3,444
1590932657142304768,7e6a67f270e740aba8788a12d9a49939621a28d5059d3ced2247a86914b0a3b3,2022-11-11 13:01:18,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main(){\n    int t,i,n,x;\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&n);\n        if(n==0) x=1;\n        else x=6;\n        printf(\""%d\\n\"",x);\n    }\n    return 0;\n}\n",ACCEPTED,7,324
1590932659914715136,15ac7d06a472ca25d78349f7cc3a73d23c7d7a4f0c4ae3cec6200fcdb8135965,2022-11-11 13:01:18,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,t,x,i;\n    scanf(\""%d\\n\"",&t);\n    for(i=1;i<=t;i++){\n        scanf(\""%d\"",&x);\n        if(x==0){\n    printf(\""1\\n\"");\n} else{\n    printf(\""6\\n\"");\n}\n    }\n\n\n\n\n    return 0;\n}\n",ACCEPTED,9,320
1590932681695760384,e51465ce72346fac918042a342986433269a159492161f223a180a6e05d9a01a,2022-11-11 13:01:24,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,public class PTA {\n\tpublic static void main(String[] args) {\n\t\tSystem.out.println(2022);\n\t}\n},COMPILE_ERROR,0,0
1590932686259159040,617f184ce583e9f7a346564ab5659fda0ca35a3a714a0c929cb07f915f4f514b,2022-11-11 13:01:25,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    printf(\""X+Y-Z=%d\"",X+Y-Z);\n    return 0;\n}\n\n",WRONG_ANSWER,3,308
1590932693334953984,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-11 13:01:26,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"include<stdio.h>\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",COMPILE_ERROR,0,0
1590932699412500480,9ca3f63f61fa4f349009d69e7059514c3a39dbdd5a1f94342c11f4c33ccdceaa,2022-11-11 13:01:28,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"x = int(input())\nc=0\nfor i in range (1,x):\n    b=0\n    for j in range (1,i+1):\n        if (i%j == 0):\n            b = b+1\n        if b == 2:\n            a = 2\n        else :\n            a=0\n    if a == 2:\n        c = c+1\nprint(c)\n\n",TIME_LIMIT_EXCEEDED,400,2744
1590932705854951424,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-11 13:01:29,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main(){\n    int t,i,k;\n    double j;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<t;i++){\n        j=pow(6,a[i]);\n        int h=(int)j;\n        k=h%10;\n        if(i<t-1)\n            printf(\""%d\\n\"",k);\n        else printf(\""%d\"",k);\n    }\n}",WRONG_ANSWER,6,328
1590932736796332032,a2fa7eb1ab1c2f6fa23517852ee6971ea32fd0c7742d71d7914ed729415f04d9,2022-11-11 13:01:37,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,#include<iostream>\nlong long a[1000000001]={};\nusing namespace std;\nint main(){\n\tlong long t;\n\tcin>>t; \n\tfor(int i=1;i<=t;i++)\n\t    cin>>a[i];\n    cout<<6;\n\tfor(int i=2;i<=t;i++)\n\t    cout<<endl<<6;\n\t    return 0;\n},COMPILE_ERROR,0,0
1590932758736732160,8f29029dc8006da83949d2656cc7dc83026d851252066fd4a9fc89071673ec96,2022-11-11 13:01:42,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,print(2022),ACCEPTED,15,2792
1590932776466055168,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 13:01:46,Python,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"a=int(input())\ncount=0\nfor i in range(1,a):\n    m=0\n    for x in range(2,int(pow(i,0.5))+1):\n        if i%x==0:\n            m=1\n            break\n    if m==0:\n        count+=1\nprint(count-1)",ACCEPTED,240,3540
1590932802839842816,0ccbaaa612b3d01dbe621ce5e7366d6e26d2e5adf55047d92c6eb7adf78a979d,2022-11-11 13:01:52,C++,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int N;\n    int x,count=0;\n    scanf(\""%d\"",&N);\n    for(x=1;x<=N;x++){\n        int isprime=1;\n        for(int i=2;i<=sqrt(x);i++){\n            if (x%i==0){\n            isprime=0;\n            break;}\n        }\n        if(isprime==1) count++;\n    }\n\tcout<<count-1;\n    return 0;\n}",ACCEPTED,15,308
1590932827405881344,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-11 13:01:58,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,3,184
1590932828026638336,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-11 13:01:58,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int n,a,i;\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++)\n    {\n         scanf(\""%d\"",&a);\n        if(n==0)\n        printf(\""1\"");\n        else printf(\""6\\n\"");\n    }\n       \n    return 0;\n}\n    ",WRONG_ANSWER,8,316
1590932837010812928,aa65cdf25cbe32699d085a61c4f3ec5a4020e6a3dc1e0e9d6e2a48c9288f8026,2022-11-11 13:02:01,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.*;\n\npublic class Main{\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int i = scanner.nextInt();\n            while(i>0){\n                int a=scanner.nextInt();\n                if(a==0){\n                    System.out.print(1+\""\\n\"");\n                }else{\n                    System.out.print(6+\""\\n\"");\n                }\n            }\n            }\n        }\n\n\n",NON_ZERO_EXIT_CODE,122,16540
1590932845156175872,05fd79145678de5c06012db9db4333bebf8365a74fe442d12a54a9da3782fdca,2022-11-11 13:02:03,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main(){\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,2,196
1590932852424900608,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-11 13:02:04,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h> \n#include<math.h>\nint main(){\nint n;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tint M[n];\n\tfor(int i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t\tM[i]=pow(6,a[i]);\n\t\tM[i]=M[i]%10;\n\t}\n\tfor(int i=0;i<n;i++){\n\tif(i<n-1)\tprintf(\""%d\\n\"",M[i]);\n\telse printf(\""%d\"",M[i]);\n\t}\n}",WRONG_ANSWER,7,308
1590932852504571904,e0a829315cc9947a3e714cd579e3322e8dee5f8ca36e30fd276de5a8e294b6f8,2022-11-11 13:02:04,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,x,y,z;\n    int i,a,b,c;\n    scanf(\""%d\\n\"",&n);\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    a=pow(6,x);\n    b=pow(6,y);\n    c=pow(6,z);\n    printf(\""%d\\n\"",a%10);\n    printf(\""%d\\n\"",b%10);\n    printf(\""%d\\n\"",c%10);\n    return 0;\n}\n",WRONG_ANSWER,3,312
1590932856195584000,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-11 13:02:05,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,4,308
1590932859513278464,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-11 13:02:06,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\nclass Main{\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int temp = sc.nextInt();\n        for (int i = 0;i < temp;i++) {\n            int num = sc.nextInt();\n            System.out.println(num == 0 ? 1 : 6);\n        }\n        return;\n    }\n},WRONG_ANSWER,245,16908
1590932860515692544,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-11-11 13:02:06,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"t=int(input())\nn=list(map(int,input().split(' ')))\nfor i in range(0,len(n)):\n    print(pow(6, n[i]) % 10)",TIME_LIMIT_EXCEEDED,165,4112
1590932890408517632,e51465ce72346fac918042a342986433269a159492161f223a180a6e05d9a01a,2022-11-11 13:02:13,Java,300.0,1590528927448293376,1590525945717575680,1049226928954454016,public class Main {\n\tpublic static void main(String[] args) {\n\t\tSystem.out.println(2022);\n\t}\n},ACCEPTED,75,13840
1590932926865408000,aa65cdf25cbe32699d085a61c4f3ec5a4020e6a3dc1e0e9d6e2a48c9288f8026,2022-11-11 13:02:22,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.*;\n\nclass Main{\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int i = scanner.nextInt();\n            while(i>0){\n                int a=scanner.nextInt();\n                if(a==0){\n                    System.out.print(1+\""\\n\"");\n                }else{\n                    System.out.print(6+\""\\n\"");\n                }\n            }\n            }\n        }\n\n\n",NON_ZERO_EXIT_CODE,125,16968
1590932929394552832,39afbda4ab6a7df2673bc0d0eec048a42b23ada2774ec941935a2b2fa044515a,2022-11-11 13:02:23,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <bits/stdc++.h>\nusing namespace std;\nint main(){\nint n,x,i;\ncin>>n;\nfor(i=0;i<n;i++){\n    cin>>x;\n    cout<<6<<endl;\n}\n}\n",WRONG_ANSWER,12,448
1590932993831669760,458af3c005e0b282d1ca88c254d9910ee2d93738b6f06d399f7444e1e64831eb,2022-11-11 13:02:38,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int a,i,b;\n    a=b=0;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++){\n        scanf(\""%d\"",&b);\n    }\n    for(i=0;i<a;i++){\n        printf(\""%d\"",6);\n        if(a-i!=1){\n        printf(\""\\n\"");}\n    }\n    return 0;\n}",WRONG_ANSWER,9,344
1590932996553768960,06b00897262b024d9e66dcd771cf81de9b63954f7a4554699d17c2158114c0d1,2022-11-11 13:02:39,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main(){\n    int a;\n    scanf(\""%d\"",&a);\n    int b[a];\n    int i=0;\n    for(i;i<a;i++){\n        scanf(\""%d\"",&b[i]);\n    }\n    int j=0;\n    for(j;j<a;j++){\n        if(b[i]==0){\n            printf(\""1\\n\"");\n        }else if(j<a-1){\n            printf(\""6\\n\"");\n        }else{\n            printf(\""6\"");\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,2,188
1590933020125757440,6383c93cbdef4af3eda29400a925819f16ad4afc8368e604ccd580cba7055bdd,2022-11-11 13:02:44,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n    int x = 6;\n    int i;\n    int t;\n    scanf(\""%d\"",&t);\n    for(i=1;i<t;i++){\n        x*=6;\n    }\n    int n;\n    n = x%10;\n    printf(\""%d\"",n);\n\n    return 0;\n}\n",WRONG_ANSWER,2,196
1590933020675211264,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-11 13:02:44,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int n,a,i;\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++)\n    {\n         scanf(\""%d\"",&a);\n        if(a==0)\n        printf(\""1\"");\n        else printf(\""6\\n\"");\n    }\n       \n    return 0;\n}\n    ",ACCEPTED,8,188
1590933073527640064,64f8dab58af431d48e3c413e8710a37cc2c583e883c731d70cd5a4e026299255,2022-11-11 13:02:57,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n\n#include<math.h>\n\nint main(){\n\n    int t;\n\n    scanf(\""%d\\n\"",&t);\n\n    int a[100];\n\n    for(int j=0;j<t;j++)\n\n    {\n\n        scanf(\""%d\"",&a[j]);\n\nprintf(\""6\\n\"");\n\n    }\n\n  return 0;\n\n    \n\n}",WRONG_ANSWER,11,312
1590933075486375936,5d127211f3edce9d9bd1062c03cd08473e4481ec46b4b0c70c2e8d9141c68f20,2022-11-11 13:02:57,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,n,t,y;\n    scanf(\""%d\\n\"",&t);\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&n);\n        if(n==0)\n            y=1;\n        else\n            y=6;\n    }\n            printf(\""%d\\n\"",y);\n            printf(\""%d\\n\"",y);\n            printf(\""%d\"",y);\n}",WRONG_ANSWER,3,196
1590933126254211072,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 13:03:10,Python,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"\ndef IsPrime(n):\n    # 2, 3 单独处理\n    if n == 2 or n == 3:\n        return True\n    # 不在 6 的倍数两侧的不是素数\n    if n % 6 != 1 and n % 6 != 5:\n        return False\n    # 在 6 的倍数两侧的不一定是素数\n    for i in range(5, int(n ** 0.5) + 1, 6):\n        # i 的步长可以放大到 6\n        if n % i == 0 or n % (i + 2) == 0:\n            return False\n    return True\ndata = int(input())\ns = 0\nfor i in range(2,data+1):\n    if IsPrime(i)==True:\n        s = s+1\nprint(s)",ACCEPTED,93,2832
1590933130956025856,75a6755f083ffc71d77ba6ce593bd24fe8a2ce61edc4710fbde2dce128c47ab4,2022-11-11 13:03:11,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}\n",ACCEPTED,3,312
1590933144059056128,06b00897262b024d9e66dcd771cf81de9b63954f7a4554699d17c2158114c0d1,2022-11-11 13:03:14,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main(){\n    int a;\n    scanf(\""%d\"",&a);\n    int b[a];\n    int i=0;\n    for(i;i<a;i++){\n        scanf(\""%d \"",&b[i]);\n    }\n    int j=0;\n    for(j;j<a;j++){\n        if(b[i]==0){\n            printf(\""1\\n\"");\n        }else if(j<a-1){\n            printf(\""6\\n\"");\n        }else{\n            printf(\""6\"");\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,3,324
1590933164049084416,5d127211f3edce9d9bd1062c03cd08473e4481ec46b4b0c70c2e8d9141c68f20,2022-11-11 13:03:19,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,n,t,y;\n    scanf(\""%d\\n\"",&t);\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&n);\n        if(n==0)\n            y=1;\n        else\n            y=6;\n            printf(\""%d\\n\"",y);\n    }\n}",ACCEPTED,10,308
1590933299877449728,e9a50f3e071443bb6fb229966bff355c178d484f6cc10e5e1fc8dc5a537237ba,2022-11-11 13:03:51,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n    int i,max,b,j;\n   scanf(\""%d\"",&b);\n   int a[b];\n   int c[b][b];\n   for(i=0;i<2;i++)\n    for(j=0;j<b;j++)\n       scanf(\""%d\"",&c[i][j]);\n   for(i=0;i<b;i++)\n     a[i]=c[1][i]-c[0][i];\n   max=a[1];\n   for(i=1;i<10;i++)\n   {\n      a[i]=a[i-1]+a[i];\n      if(max<a[i]) max=a[i];\n   }\n   printf(\""%d\"",max);\n}\n\n",WRONG_ANSWER,3,192
1590933311185289216,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-11 13:03:54,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x,y,z,h;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    h=x+y-z;\n    printf(\""%d\"",h);\n    return 0;\n}",ACCEPTED,6,324
1590933424402116608,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-11 13:04:21,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<math.h>\n#include <stdio.h>\nint main()\n{\n    int n,i,j,temp=0;\n    scanf(\""%d\"",&n);\n     for(i=2;i<=n;i++)\n      for(j=2;j<=i;j++)\n       if(i%j==0)\n       {\n        if(j>=i)\n         temp++;\n        else\n         break;\n       }\n    printf(\""%d\"",temp);\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,400,324
1590933433814159360,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-11-11 13:04:23,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"t=int(input())\nn=list(map(int,input().split(' ')))\nfor i in range(0,len(n)):\n    print(6**n[i] % 10)",TIME_LIMIT_EXCEEDED,165,4088
1590933452503953408,64f8dab58af431d48e3c413e8710a37cc2c583e883c731d70cd5a4e026299255,2022-11-11 13:04:27,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n\n#include <math.h>\n\nint main(){\n\n    int i,j;\n\n    int count=0;\n\n    int n=0;\n\n    scanf (\""%d\"",&n);\n\n    for(i=1;i<=n;i++){\n\n        for(j=2;j<i;j++){\n\n            if (i%j==0)\n\n                break;\n\n        }\n\n        if(i==j)\n\n        {\n\n            count++;\n\n        }\n\n    }\n\n  printf(\""%d\\n\"",count)  ;\n\n  return 0;  \n\n}",TIME_LIMIT_EXCEEDED,400,368
1590933493507469312,7d46013a6da090b69b62e7be93e7628aee2f7eef31af37777b9ccf1fd1d3eb2e,2022-11-11 13:04:37,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main (){\n    int a,b,n;\n    a=6^n;\n    int b=a/1%10;\n    scanf(\""%d\"",&n);\n    printf(\""%d\"",b);\n    return 0;\n}",COMPILE_ERROR,0,0
1590933549698584576,8f29029dc8006da83949d2656cc7dc83026d851252066fd4a9fc89071673ec96,2022-11-11 13:04:51,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n}",ACCEPTED,6,320
1590933594602803200,75a6755f083ffc71d77ba6ce593bd24fe8a2ce61edc4710fbde2dce128c47ab4,2022-11-11 13:05:01,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int x,y,z;\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n    return 0;\n}\n",ACCEPTED,6,308
1590933610318835712,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-11 13:05:05,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String args[]) {\n        int a;\n        int b=0;\n        int flag=0;\n        Scanner scanner = new Scanner(System.in);\n        a=scanner.nextInt();\n        for (int i = 2; i <=a; i++) {\n            for (int j = 2; j < i; j++) {\n                if(i%j==0)\n                    flag=1;\n            }\n            if(flag==0){\n                b++;\n            }\n            flag=0;\n        }\n        System.out.println(b);\n\n    }\n}\n,TIME_LIMIT_EXCEEDED,400,16436
1590933634993950720,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-11 13:05:11,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,a[10];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n       scanf(\""%d\"",&a[i]);\n    for(i=0;i=n-1;i++)\n    {\n        if(a[i]==0)\n            printf(\""0\\n\"");\n        else\n            printf(\""6\\n\"");\n    }\n    return 0;\n}",TIME_LIMIT_EXCEEDED,20,2936
1590933667030020096,05f9d62a2660f27e0711448c225e5e0fe6347745a2c93edb6296c0a2ffbc6605,2022-11-11 13:05:18,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nmain()\n{\n    int t,i,x,n;\n    scanf(\""%d\"",&t);\n    for(i=1;i<=t;i++)\n    {\n        scanf(\""%d\"",&n);\n        if(n==0)\n            x=1;\n           else\n            x=6;\n        printf(\""%d\\n\"",x);\n    }\n}",ACCEPTED,9,192
1590933678392410112,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-11 13:05:21,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,3,360
1590933731437752320,aa65cdf25cbe32699d085a61c4f3ec5a4020e6a3dc1e0e9d6e2a48c9288f8026,2022-11-11 13:05:34,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a;\n    scanf(\""%d\"",&a);\n    while(a>0){\n        int b;\n        scanf(\""%d\"",&b);\n        if(b==0){\n            printf(\""1\\n\"");\n        }else{\n            printf(\""6\\n\"");\n        }\n        a--;\n    }\n    return 0;\n}",ACCEPTED,6,188
1590933741734793216,0cfbb4a339ebbc4dce13b5f3e3f98a3def0ab17ef5b4ac8e6d566de92e1f5f78,2022-11-11 13:05:36,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n;\n    scanf(\""%d\"", &n);\n    int a[n];\n    for(int i=0;i<n;i++){\n        scanf(\""%d\"", &a[i]);\n    }\n    for(int i=0;i<n;i++){\n        if(a[i]!=0){\n            printf(\""6\\n\"");\n        }\n    }\n}",WRONG_ANSWER,7,324
1590933746197528576,9ca3f63f61fa4f349009d69e7059514c3a39dbdd5a1f94342c11f4c33ccdceaa,2022-11-11 13:05:37,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"x = int(input())\ny = input().split(\"" \"")\nz = input().split(\"" \"")\nb = 0\nfor i in range(x):\n    a = int(z[i])-int(y[i])\n    if a >0:\n        b = b+a\nprint(b)\n",COMPILE_ERROR,0,0
1590933797426761728,7d46013a6da090b69b62e7be93e7628aee2f7eef31af37777b9ccf1fd1d3eb2e,2022-11-11 13:05:50,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main (){\n    int n;\n    int a=6^n/1%10;\n    scanf(\""%d\"",&n);\n    printf(\""%d\"",a);\n    return 0;\n}",WRONG_ANSWER,2,188
1590933806360625152,9ca3f63f61fa4f349009d69e7059514c3a39dbdd5a1f94342c11f4c33ccdceaa,2022-11-11 13:05:52,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"x = int(input())\ny = input().split(\"" \"")\nz = input().split(\"" \"")\nb = 0\nfor i in range(x):\n    a = int(z[i])-int(y[i])\n    if a >0:\n        b = b+a\nprint(b)\n",WRONG_ANSWER,15,2876
1590933849620680704,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-11 13:06:02,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String args[]) {\n        int a;\n        int b = 0;\n        int flag = 0;\n        Scanner scanner = new Scanner(System.in);\n        a = scanner.nextInt();\n        for (int i = 2; i <= a; i++) {\n            for (int j = 2; j < i; j++) {\n                if (i % j == 0)\n                    flag = 1;\n            }\n            if (flag == 0) {\n                b++;\n            }\n            flag = 0;\n        }\n        System.out.println(b);\n\n    }\n}\n,TIME_LIMIT_EXCEEDED,1000,16676
1590933885737828352,a2fa7eb1ab1c2f6fa23517852ee6971ea32fd0c7742d71d7914ed729415f04d9,2022-11-11 13:06:11,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\n#include<string.h>\nlong long a[100000]={};\nusing namespace std;\nint main(){\n\tlong long t;\n\tcin>>t; \n\tfor(int i=1;i<=t;i++)\n\t{\n\t    cin>>a[i];\n\t    if(a[100000]!=0)\n\t\t    memset(a, 0, sizeof(a));\n\t\t}    \n    cout<<6;\n\tfor(int i=2;i<=t;i++)\n\t    cout<<endl<<6;\n\t    return 0;\n}",WRONG_ANSWER,9,324
1590933922165362688,aa65cdf25cbe32699d085a61c4f3ec5a4020e6a3dc1e0e9d6e2a48c9288f8026,2022-11-11 13:06:19,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a;\n    scanf(\""%d\"",&a);\n    while(a>0){\n        int b;\n        scanf(\""%d\"",&b);\n        if(b==0){\n            printf(\""1\\n\"");\n        }else{\n            printf(\""6\\n\"");\n        }\n        a--;\n    }\n    return 0;\n}",ACCEPTED,10,192
1590933947800948736,75a6755f083ffc71d77ba6ce593bd24fe8a2ce61edc4710fbde2dce128c47ab4,2022-11-11 13:06:25,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n;\n    if(n==0)\n    printf(\""1\"");\n    else\n    printf(\""6\"");\n}\n",WRONG_ANSWER,2,192
1590933961214332928,5bc60b8a600b6eb0f40d687325a769827668e4afe8f5a6ad0a4ed9ddbddfbc36,2022-11-11 13:06:29,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b;\n    int i;\n    scanf(\""%d\"",&a);\n    for(i = 0;i < a;i++) {\n        scanf(\""%d\"",&b);\n        printf(\""%d\\n\"",b==0?1:6);\n    }\n    return 0;\n}",ACCEPTED,9,308
1590933966243303424,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-11 13:06:30,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<math.h>\n#include <stdio.h>\nint main()\n{\n    int n,i,j,temp=0;\n    scanf(\""%d\"",&n);\n     for(i=2;i<=n;i++)\n      for(j=2;j<=i;j++)\n       if(i%j==0)\n       {\n        if(j>=i)\n         temp++;\n        else\n         break;\n       }\n    printf(\""%d\"",temp);\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,1000,280
1590933969674244096,7d46013a6da090b69b62e7be93e7628aee2f7eef31af37777b9ccf1fd1d3eb2e,2022-11-11 13:06:31,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main (){\n    int n;\n    int a=6^n/1%10;\n    scanf(\""%d\"",&n);\n    printf(\""%d\"",a);\n    getchar();\n    return 0;\n}",WRONG_ANSWER,2,188
1590933997390180352,3dcf32868d7a750bb24733cc752e8b34486b532e90524d2606d8643387f183e4,2022-11-11 13:06:37,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"//#include \""bits/stdc++.h\""\n//using namespace std;\n//typedef long long ll;\n//typedef pair<ll,ll> PII;\n//#define rep(i,a,n) for(int i = a; i < n; i++)\n//#define per(i,n,a) for(int i = n-1; i >= a; i--)\n//#define debug(a) printf(\""#: %d \"",a);\n//#define fr first\n//#define se second\n//#define be begin()\n//#define ed end()\n//#define pb push_back\n//#define mk make_pair\n//#define pf printf\n//#define ins insert\n//#define sz size()\n////#define int long long\n//#define mem(a,i) memset(a,i,sizeof (a))\n//\n////char buf[1<<23],*p1=buf,*p2=buf;\n////#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)\n////inline ll read()\n////{\n////    int s=0;\n////    char ch = getchar(),last;\n////    while(ch<'0'||ch>'9') last = ch, ch = getchar();\n////    while(ch>='0'&&ch<='9') s=(s<<1)+(s<<3)+(ch^48),ch=getchar();\n////    return last=='-'?-s:s;\n////}\n//\n//inline ll read(){\n//    ll x = 0,f = 1;\n//    char ch = getchar();\n//    while(ch < '0'||ch > '9'){\n//        if(ch == '-')\n//            f = -1;\n//        ch = getchar();\n//    }\n//    while(ch >= '0' && ch <= '9'){\n//        x = (x << 1)+(x << 3)+(ch^48);\n//        ch = getchar();\n//    }\n//    return x*f;\n//}\n//const int MOD = 1000000007;\n//ll INF = 1e18;\n//ll gcd(ll a,ll b){\n//    return b ? gcd(b,a%b) : a;\n//}\n//const int N = 3e5 + 10;\n////struct edge{\n////    int to,next,w;\n////}eg[N];+\n////bool st[N];\n////void add(int u,int v,int w){\n////    eg[++tot].w = w;eg[tot].to = v;eg[tot].next = head[u];head[u] = tot;\n////}\n//\n////int C[100010][3];\n////void Cn(){\n////    for(int i=0;i<100010;i++)for(int j = 0;j <= 2;j++)if(!j) C[i][j] = 1;else C[i][j] = (C[i-1][j]+C[i-1][j-1]);\n////}\n//ll lowbit(ll x){\n//    return x%(-x);\n//}\n//ll a[N];\n//void solve(){\n//   ll n = read();\n//   rep(i,1,n+1)a[i] -= read();\n//   rep(i,1,n+1)a[i] += read();\n//   ll ans = 0,now = 0;\n//   rep(i,1,n+1){\n//       if(now + a[i] < 0){\n//            now = 0;\n//       }else{\n//           now += a[i];\n//       }\n//       ans = max(ans,now);\n//   }\n//    printf(\""%lld\\n\"",ans);\n//}\n//signed  main(){\n////    ll t = read();\n////    while(t--)\n//        solve();\n//}\n#include <iostream>\n#include <cstring>\n using namespace std;\n\n //埃氏筛法\nconst int MAX_N = 10005;\n int prime[MAX_N];  //第i个素数\n bool is_prime[MAX_N+1];  //is_prime[i]为true时表示i是素数\n\n //返回n以内素数的个数\n int sieve(int n){\n         int p = 0;\n         for(int i = 0; i <= n; i++) is_prime[i] = true;\n         is_prime[0] = is_prime[1] = false;\n         for(int i = 2; i <= n; i++){\n                 if(is_prime[i]){\n                      prime[p++] = i;\n                         for(int j = 2*i; j <= n; j+=i) is_prime[j] = false;  //筛去所有素数的倍数\n                    }\n             }\n        return p;\n     }\n\n\n int main()\n {\n    int n;  //枚举n以内素数\n     while(cin>>n){\n        int p = sieve(n);\n         cout<<p<<endl;\n         \n     }\n\n     return 0;\n }",SEGMENTATION_FAULT,4,444
1590934016046469120,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-11 13:06:42,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<math.h>\n#include <stdio.h>\nint main()\n{\n    int n,i,j,temp=0;\n    scanf(\""%d\"",&n);\n     for(i=2;i<=n;i++)\n      for(j=2;j<=i;j++)\n       if(i%j==0)\n       {\n        if(j>=i)\n         temp++;\n        else\n         break;\n       }\n    printf(\""%d\"",temp);\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,1000,272
1590934048619429888,3dcf32868d7a750bb24733cc752e8b34486b532e90524d2606d8643387f183e4,2022-11-11 13:06:49,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"//#include \""bits/stdc++.h\""\n//using namespace std;\n//typedef long long ll;\n//typedef pair<ll,ll> PII;\n//#define rep(i,a,n) for(int i = a; i < n; i++)\n//#define per(i,n,a) for(int i = n-1; i >= a; i--)\n//#define debug(a) printf(\""#: %d \"",a);\n//#define fr first\n//#define se second\n//#define be begin()\n//#define ed end()\n//#define pb push_back\n//#define mk make_pair\n//#define pf printf\n//#define ins insert\n//#define sz size()\n////#define int long long\n//#define mem(a,i) memset(a,i,sizeof (a))\n//\n////char buf[1<<23],*p1=buf,*p2=buf;\n////#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)\n////inline ll read()\n////{\n////    int s=0;\n////    char ch = getchar(),last;\n////    while(ch<'0'||ch>'9') last = ch, ch = getchar();\n////    while(ch>='0'&&ch<='9') s=(s<<1)+(s<<3)+(ch^48),ch=getchar();\n////    return last=='-'?-s:s;\n////}\n//\n//inline ll read(){\n//    ll x = 0,f = 1;\n//    char ch = getchar();\n//    while(ch < '0'||ch > '9'){\n//        if(ch == '-')\n//            f = -1;\n//        ch = getchar();\n//    }\n//    while(ch >= '0' && ch <= '9'){\n//        x = (x << 1)+(x << 3)+(ch^48);\n//        ch = getchar();\n//    }\n//    return x*f;\n//}\n//const int MOD = 1000000007;\n//ll INF = 1e18;\n//ll gcd(ll a,ll b){\n//    return b ? gcd(b,a%b) : a;\n//}\n//const int N = 3e5 + 10;\n////struct edge{\n////    int to,next,w;\n////}eg[N];+\n////bool st[N];\n////void add(int u,int v,int w){\n////    eg[++tot].w = w;eg[tot].to = v;eg[tot].next = head[u];head[u] = tot;\n////}\n//\n////int C[100010][3];\n////void Cn(){\n////    for(int i=0;i<100010;i++)for(int j = 0;j <= 2;j++)if(!j) C[i][j] = 1;else C[i][j] = (C[i-1][j]+C[i-1][j-1]);\n////}\n//ll lowbit(ll x){\n//    return x%(-x);\n//}\n//ll a[N];\n//void solve(){\n//   ll n = read();\n//   rep(i,1,n+1)a[i] -= read();\n//   rep(i,1,n+1)a[i] += read();\n//   ll ans = 0,now = 0;\n//   rep(i,1,n+1){\n//       if(now + a[i] < 0){\n//            now = 0;\n//       }else{\n//           now += a[i];\n//       }\n//       ans = max(ans,now);\n//   }\n//    printf(\""%lld\\n\"",ans);\n//}\n//signed  main(){\n////    ll t = read();\n////    while(t--)\n//        solve();\n//}\n#include <iostream>\n#include <cstring>\n using namespace std;\n\n //埃氏筛法\nconst int MAX_N = 10005;\n int prime[MAX_N];  //第i个素数\n bool is_prime[MAX_N+1];  //is_prime[i]为true时表示i是素数\n\n //返回n以内素数的个数\n int sieve(int n){\n         int p = 0;\n         for(int i = 0; i <= n; i++) is_prime[i] = true;\n         is_prime[0] = is_prime[1] = false;\n         for(int i = 2; i <= n; i++){\n                 if(is_prime[i]){\n                      prime[p++] = i;\n                         for(int j = 2*i; j <= n; j+=i) is_prime[j] = false;  //筛去所有素数的倍数\n                    }\n             }\n        return p;\n     }\n\n\n int main()\n {\n    int n;  //枚举n以内素数\n     while(cin>>n){\n        int p = sieve(n);\n         cout<<p<<endl;\n         \n     }\n\n     return 0;\n }",SEGMENTATION_FAULT,4,572
1590934061240090624,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 13:06:52,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int a,i,j,sum=0;\n    scanf(\""%d\"",&a);\n    for(i=2;i<a;i++)\n    {\n        for(j=2;j<i;j++)\n        {\n            if(i%j==0) break;\n            if(i==j) sum+=1;\n        }\n    }\n    printf(\""%d\"",sum)\n}",COMPILE_ERROR,0,0
1590934077543354368,630b8bfc88107b488e158fc7108c8faf0a195f9b9030c3faf51edac625714584,2022-11-11 13:06:56,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main(){\nint a,b,i,j,k=0,flag=1;\nscanf(\""%d\"",&a);\nif(a>=2) k=1;\n\nfor(j=3;j<=a;j=j+2){\n        b=sqrt(j);\nfor(i=2;i<=b;i++){\n   if(j%i==0) {flag=0;break;}\n}\nif(flag==1) ++k;\nflag=1;\n}\nprintf(\""%d\"",k);\n}\n",ACCEPTED,12,324
1590934094568034304,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 13:07:00,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int a,i,j,sum=0;\n    scanf(\""%d\"",&a);\n    for(i=2;i<a;i++)\n    {\n        for(j=2;j<i;j++)\n        {\n            if(i%j==0) break;\n            if(i==j) sum+=1;\n        }\n    }\n    printf(\""%d\"",sum);\n}",WRONG_ANSWER,3,332
1590934108182720512,1a4463a67236431e94a4a4d273d88450d6acce220fed7155af8798b0664ee731,2022-11-11 13:07:04,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}\n",ACCEPTED,3,324
1590934152453623808,a2fa7eb1ab1c2f6fa23517852ee6971ea32fd0c7742d71d7914ed729415f04d9,2022-11-11 13:07:14,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\n#include<string.h>\nlong long a[100000]={};\nusing namespace std;\nint main(){\n\tlong long t;\n\tcin>>t; \n\tfor(int i=1;i<=t;i++)\n\t{\n\t    cin>>a[i];\n\t    if(a[100000]!=0)\n\t\t    memset(a, 0, sizeof(a));\n\t}    \n\tfor(int i=1;i<=t;i++)\n\t    cout<<6<<endl;\n\t    return 0;\n}",WRONG_ANSWER,12,460
1590934184963649536,3dcf32868d7a750bb24733cc752e8b34486b532e90524d2606d8643387f183e4,2022-11-11 13:07:22,C++,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"//#include \""bits/stdc++.h\""\n//using namespace std;\n//typedef long long ll;\n//typedef pair<ll,ll> PII;\n//#define rep(i,a,n) for(int i = a; i < n; i++)\n//#define per(i,n,a) for(int i = n-1; i >= a; i--)\n//#define debug(a) printf(\""#: %d \"",a);\n//#define fr first\n//#define se second\n//#define be begin()\n//#define ed end()\n//#define pb push_back\n//#define mk make_pair\n//#define pf printf\n//#define ins insert\n//#define sz size()\n////#define int long long\n//#define mem(a,i) memset(a,i,sizeof (a))\n//\n////char buf[1<<23],*p1=buf,*p2=buf;\n////#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)\n////inline ll read()\n////{\n////    int s=0;\n////    char ch = getchar(),last;\n////    while(ch<'0'||ch>'9') last = ch, ch = getchar();\n////    while(ch>='0'&&ch<='9') s=(s<<1)+(s<<3)+(ch^48),ch=getchar();\n////    return last=='-'?-s:s;\n////}\n//\n//inline ll read(){\n//    ll x = 0,f = 1;\n//    char ch = getchar();\n//    while(ch < '0'||ch > '9'){\n//        if(ch == '-')\n//            f = -1;\n//        ch = getchar();\n//    }\n//    while(ch >= '0' && ch <= '9'){\n//        x = (x << 1)+(x << 3)+(ch^48);\n//        ch = getchar();\n//    }\n//    return x*f;\n//}\n//const int MOD = 1000000007;\n//ll INF = 1e18;\n//ll gcd(ll a,ll b){\n//    return b ? gcd(b,a%b) : a;\n//}\n//const int N = 3e5 + 10;\n////struct edge{\n////    int to,next,w;\n////}eg[N];+\n////bool st[N];\n////void add(int u,int v,int w){\n////    eg[++tot].w = w;eg[tot].to = v;eg[tot].next = head[u];head[u] = tot;\n////}\n//\n////int C[100010][3];\n////void Cn(){\n////    for(int i=0;i<100010;i++)for(int j = 0;j <= 2;j++)if(!j) C[i][j] = 1;else C[i][j] = (C[i-1][j]+C[i-1][j-1]);\n////}\n//ll lowbit(ll x){\n//    return x%(-x);\n//}\n//ll a[N];\n//void solve(){\n//   ll n = read();\n//   rep(i,1,n+1)a[i] -= read();\n//   rep(i,1,n+1)a[i] += read();\n//   ll ans = 0,now = 0;\n//   rep(i,1,n+1){\n//       if(now + a[i] < 0){\n//            now = 0;\n//       }else{\n//           now += a[i];\n//       }\n//       ans = max(ans,now);\n//   }\n//    printf(\""%lld\\n\"",ans);\n//}\n//signed  main(){\n////    ll t = read();\n////    while(t--)\n//        solve();\n//}\n#include <iostream>\n#include <cstring>\n using namespace std;\n\n //埃氏筛法\nconst int MAX_N = 100005;\n int prime[MAX_N];  //第i个素数\n bool is_prime[MAX_N+1];  //is_prime[i]为true时表示i是素数\n\n //返回n以内素数的个数\n int sieve(int n){\n         int p = 0;\n         for(int i = 0; i <= n; i++) is_prime[i] = true;\n         is_prime[0] = is_prime[1] = false;\n         for(int i = 2; i <= n; i++){\n                 if(is_prime[i]){\n                      prime[p++] = i;\n                         for(int j = 2*i; j <= n; j+=i) is_prime[j] = false;  //筛去所有素数的倍数\n                    }\n             }\n        return p;\n     }\n\n\n int main()\n {\n  int n;cin >> n;\n        int p = sieve(n);\n         cout<<p<<endl;\n\n     \n\n     return 0;\n }",ACCEPTED,10,436
1590934192278536192,39afbda4ab6a7df2673bc0d0eec048a42b23ada2774ec941935a2b2fa044515a,2022-11-11 13:07:24,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <bits/stdc++.h>\nusing namespace std;\nint main(){\nint n,x,i;\ncin>>n;\nif(n<1)printf(\""1\"");\nfor(i=0;i<n;i++){\n    cin>>x;\n    cout<<6<<endl;\n}\n}\n",WRONG_ANSWER,12,448
1590934200449019904,e9a50f3e071443bb6fb229966bff355c178d484f6cc10e5e1fc8dc5a537237ba,2022-11-11 13:07:26,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n    int i,max,b,j;\n   scanf(\""%d\"",&b);\n   int a[b];\n   int c[b][b];\n   for(i=0;i<2;i++)\n    for(j=0;j<b;j++)\n       scanf(\""%d\"",&c[i][j]);\n   for(i=0;i<b;i++)\n     a[i]=c[1][i]-c[0][i];\n   max=a[1];\n   for(i=1;i<b;i++)\n   {\n      a[i]=a[i-1]+a[i];\n      if(max<a[i]) max=a[i];\n     \n   }\n /  printf(\""%d\"",max);\n}\n\n",COMPILE_ERROR,0,0
1590934250378035200,0cfbb4a339ebbc4dce13b5f3e3f98a3def0ab17ef5b4ac8e6d566de92e1f5f78,2022-11-11 13:07:38,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n;\n    scanf(\""%d\"", &n);\n    int a[n];\n    for(int i=0;i<n;i++){\n        scanf(\""%d\"", &a[i]);\n    }\n    for(int i=0;i<n;i++){\n        if(a[i]!=0){\n            printf(\""6\\n\"");\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,9,324
1590934258766643200,e9a50f3e071443bb6fb229966bff355c178d484f6cc10e5e1fc8dc5a537237ba,2022-11-11 13:07:40,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n    int i,max,b,j;\n   scanf(\""%d\"",&b);\n   int a[b];\n   int c[b][b];\n   for(i=0;i<2;i++)\n    for(j=0;j<b;j++)\n       scanf(\""%d\"",&c[i][j]);\n   for(i=0;i<b;i++)\n     a[i]=c[1][i]-c[0][i];\n   max=a[1];\n   for(i=1;i<b;i++)\n   {\n      a[i]=a[i-1]+a[i];\n      if(max<a[i]) max=a[i];\n     \n   }\n   printf(\""%d\"",max);\n}\n\n",WRONG_ANSWER,2,188
1590934273513795584,e51465ce72346fac918042a342986433269a159492161f223a180a6e05d9a01a,2022-11-11 13:07:43,Java,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"public class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tint a=0,b=0,c=0;\n        while (in.hasNextInt()) {\n            a = in.nextInt();\n            b = in.nextInt();\n            c = in.nextInt();\n        }\n        System.out.println(a+b-c);    \n\t}\n}",COMPILE_ERROR,0,0
1590934289267601408,9ca3f63f61fa4f349009d69e7059514c3a39dbdd5a1f94342c11f4c33ccdceaa,2022-11-11 13:07:47,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"x = int(input())\ny = input().split(\"" \"")\nz = input().split(\"" \"")\nb = 0\nfor i in range(x):\n    a = int(z[i])-int(y[i])\n    if a >0:\n        b = b+a\n    if a<0:\n        break\nprint(b)\n",WRONG_ANSWER,16,2748
1590934290853072896,aa65cdf25cbe32699d085a61c4f3ec5a4020e6a3dc1e0e9d6e2a48c9288f8026,2022-11-11 13:07:47,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int i = scanner.nextInt();\n        while(i>0){\n            i--;\n            int i1 = scanner.nextInt();\n            if (i1==0){\n                System.out.println(1);\n            }\n            else {\n                    System.out.println(6);\n                }\n            }\n    }\n},WRONG_ANSWER,241,20216
1590934340014505984,aa65cdf25cbe32699d085a61c4f3ec5a4020e6a3dc1e0e9d6e2a48c9288f8026,2022-11-11 13:07:59,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int i = scanner.nextInt();\n        while(i>0){\n            i--;\n            int i1 = scanner.nextInt();\n            if (i1==0){\n                System.out.println(1);\n            }\n            else {\n                    System.out.println(6);\n                }\n            }\n    }\n},WRONG_ANSWER,239,16812
1590934342543650816,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 13:08:00,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int a,i,j,sum=0;\n    scanf(\""%d\"",&a);\n    for(i=1;i<a;i++)\n    {\n        for(j=1;j<i;j++)\n        {\n            if(i%j==0) break;\n            if(i==j) sum+=1;\n        }\n    }\n    printf(\""%d\"",sum);\n}",WRONG_ANSWER,3,184
1590934368854519808,e51465ce72346fac918042a342986433269a159492161f223a180a6e05d9a01a,2022-11-11 13:08:06,Java,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"import java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tint a=0,b=0,c=0;\n        while (in.hasNextInt()) {\n            a = in.nextInt();\n            b = in.nextInt();\n            c = in.nextInt();\n        }\n        System.out.println(a+b-c);    \n\t}\n}",ACCEPTED,242,16496
1590934369970225152,919e6449799ef04f53dc21ab8608e866aab38f956abcadede4200c4c63859f1b,2022-11-11 13:08:06,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"System.out.print(\""2022\"");",COMPILE_ERROR,0,0
1590934378987978752,910d600982c42b3bf326994e410e7a344f2438b451c8f7deb6f6a9f965d3ee41,2022-11-11 13:08:08,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int a,i,n;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;)\n    {\n        scanf(\""%d\"",&n);\n        printf(\""%d\"",n==0?1:6);\n        i++;\n        if(i==a)\n            break;\n        printf(\""\\n\"");\n    }\n}",ACCEPTED,7,316
1590934388639072256,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-11 13:08:11,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n    return 0;\n}",ACCEPTED,6,320
1590934431081234432,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 13:08:21,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n main()\n{\n   printf(\""2022\"");\n   \n}",ACCEPTED,3,196
1590934470725799936,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-11 13:08:30,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<math.h>\n#include <stdio.h>\nint main()\n{\n    int n,i,j,temp=0;\n    scanf(\""%d\"",&n);\n     for(i=2;i<=n;i++)\n      for(j=2;j<=i;j++)\n       if(i%j==0)\n       {\n        if(j>=i)\n         temp++;\n        else\n         break;\n       }\n    printf(\""%d\"",temp);\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,1000,276
1590934550224633856,23d287b80d4d430308a1b57ee92bb4f2d1b25d1142a13c1c0fda4316c9bb9f17,2022-11-11 13:08:49,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"int X,Y,Z\nscanf(\""%d %d %d\"",$X,&Y,&Z)\nprintf(\""%d+%d-%d\"",&X,&Y,&Z)",COMPILE_ERROR,0,0
1590934569795256320,0ccbaaa612b3d01dbe621ce5e7366d6e26d2e5adf55047d92c6eb7adf78a979d,2022-11-11 13:08:54,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int n;cin>>n;\n    int a[n],b[n],c[n];\n    for(int i=0;i<n;i++) cin>>a[i];\n    for(int i=0;i<n;i++) cin>>b[i];\n    for(int i=0;i<n;i++) c[i]=a[i]-b[i];\n    sort(c,c+n);\n    int sum=0;\n    for(int i=0;i<n;i++)\n    \tif(c[i]>=0) sum+=c[i];\n    cout<<sum;\n    return 0;\n}",WRONG_ANSWER,3,444
1590934614959521792,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-11 13:09:05,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<math.h>\n#include <stdio.h>\nint main()\n{\n    int n,i,j,temp=0;\n    scanf(\""%d\"",&n);\n     for(i=2;i<=n;i++)\n      for(j=2;j<=i;j++)\n       if(i%j==0)\n       {\n        if(j>=i)\n         temp++;\n        else\n         break;\n       }\n    printf(\""%d\"",temp);\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,1000,276
1590934647498932224,919e6449799ef04f53dc21ab8608e866aab38f956abcadede4200c4c63859f1b,2022-11-11 13:09:12,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""2022\"");\n}",ACCEPTED,3,312
1590934650879520768,8f29029dc8006da83949d2656cc7dc83026d851252066fd4a9fc89071673ec96,2022-11-11 13:09:13,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint n,i;\n\tscanf(\""%d\"", &n);\n\tfor ( i = 0; i < n; i++)\n\t{\n\t\tprintf(\""6\\n\"");\n\t}\n}",WRONG_ANSWER,11,308
1590934655174512640,887d1bbe53a4d4a349813887f13126da5e46a853687f4c2c9d7b8ef3d748a9d6,2022-11-11 13:09:14,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""2022\"");\n}\n",ACCEPTED,2,196
1590934670454362112,75a6755f083ffc71d77ba6ce593bd24fe8a2ce61edc4710fbde2dce128c47ab4,2022-11-11 13:09:18,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,a[n],i;\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]==0)\n    printf(\""1\"");\n    else\n    printf(\""6\"");\n    }\n}\n",ACCEPTED,11,320
1590934676892614656,fec6d07e317796c63fb7ae6e7538f75973ad64af6e6196cc27eed3e9e685bf86,2022-11-11 13:09:19,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int b,i,j;\n    scanf(\""%d\"",&b);\n    int a[100],c[100];\n    int max=0,sum=0,thissum=0;\n    for(i=0;i<b;i++)\n        scanf(\""%d\"",&a[i]);\n    for( i=0;i<b;i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=0;i<b;i++)\n    {\n    for(j=i;j<b;j++)\n    {\n        thissum=thissum-a[j]+c[j];\n        if(thissum>max)\n            max=thissum;\n    }\n    if(thissum>sum)\n        sum=thissum;\n    }\n    printf(\""%d\\n\"",max);\n}",WRONG_ANSWER,4,180
1590934686136840192,23d287b80d4d430308a1b57ee92bb4f2d1b25d1142a13c1c0fda4316c9bb9f17,2022-11-11 13:09:21,C++,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"int X,Y,Z\nscanf(\""%d %d %d\"",$X,&Y,&Z)\nprintf(\""%d+%d-%d\"",&X,&Y,&Z)",COMPILE_ERROR,0,0
1590934726297300992,348c6be11ad612e07e8824e376f10ab1994838daea566d3016f2cf5f23051287,2022-11-11 13:09:31,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio>\nint main()\n{\n    printf(\""2022\"");\n    rreturn 0;\n}",COMPILE_ERROR,0,0
1590934758220173312,7c6d208c4c4b695bc8d6f8ae0c0357c2466f5c9f86ec0652674812219ac09d38,2022-11-11 13:09:39,Java,0.0,1590734963702620160,1590734503495200768,1049226928954454016,\nimport com.sun.javafx.sg.prism.web.NGWebView;\n\nimport java.util.Scanner;\npublic class Main {\n    public static void main(String[] args)  {\n        Scanner sc = new Scanner(System.in);\n       int a = sc.nextInt();\n       int[] arr = new int[a];\n       int[] brr = new int[a];\n       int[] crr = new int[a];\n        for (int i = 0; i < a; i++) {\n            int b = sc.nextInt();\n            brr[i]  = b;\n        }\n        for (int i = 0; i < a; i++) {\n            int c  = sc.nextInt();\n            crr[i] = c;\n        }\n        for (int i = 0; i < a; i++) {\n            arr[i] = crr[i]-brr[i];\n        }\n        int max = arr[0];\n        int b = 0;\n        for (int i = 0; i < arr.length; i++) {\n          b = b + arr[i];\n          if (b>max){\n              max = b;\n          }\n        }\n        System.out.println(max);\n    }\n\n}\n,COMPILE_ERROR,0,0
1590934798481297408,348c6be11ad612e07e8824e376f10ab1994838daea566d3016f2cf5f23051287,2022-11-11 13:09:48,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""2022\"");\n    rreturn 0;\n}",COMPILE_ERROR,0,0
1590934800075128832,13663feca3541eb054c32486ac91d32c40c83bbc2e5c1263614fa6c45f1f6d13,2022-11-11 13:09:49,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main(){\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,3,184
1590934829665943552,39afbda4ab6a7df2673bc0d0eec048a42b23ada2774ec941935a2b2fa044515a,2022-11-11 13:09:56,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <bits/stdc++.h>\nusing namespace std;\nint main(){\nint n,x,i;\ncin>>n;\nif(n<1)printf(\""1\"");\nfor(i=0;i<n-1;i++){\n    cin>>x;\n    printf(\""6\\n\"");\n}\nif(n>=1)printf(\""6\"");\n}\n",WRONG_ANSWER,12,464
1590934873517391872,345826d11b41befc23adeb536e81da8eb6ec9a8bfb9448acf91422deedb8ba4a,2022-11-11 13:10:06,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int t,i,s=0,n;\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++)\n        scanf(\""%d\"",&n);\n     if(n!=0)\n        printf(\""6\\n\"");\n    else\n        printf(\""1\\n\"");\n}\n",WRONG_ANSWER,3,324
1590934878290509824,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-11 13:10:07,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<math.h>\n#include <stdio.h>\nint main()\n{\n    int n,i=2,j,temp=0;\n    scanf(\""%d\"",&n);\n     for(j=2;j<=i;j++)\n     {\n       if(i>n)\n        break;\n      if(i%j==0&&j==i)\n      {\n       ++temp;\n       j=1;\n       ++i;\n      }\n      else if(i%j==0)\n      {\n       ++i;\n       j=1;\n      }\n     }\n    printf(\""%d\"",temp);\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,1000,376
1590934880618348544,06b00897262b024d9e66dcd771cf81de9b63954f7a4554699d17c2158114c0d1,2022-11-11 13:10:08,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner in=new Scanner(System.in);\n        int n=in.nextInt();\n        int a[]=new int[n];\n        for(int i=0;i<n;i++){\n            a[i]=in.nextInt();\n        }\n        for(int i=0;i<n;i++){\n            if(a[i]==0){\n                System.out.println(\""1\"");\n            }else if(i<n-1){\n                System.out.println(\""6\"");\n            }else {\n                System.out.print(\""6\"");\n            }\n        }\n    }\n}",NON_ZERO_EXIT_CODE,267,16476
1590934925451268096,6cbd81921f92855c6b8318725b09ef7ec48ff579276b3df9f7ea04bea9804678,2022-11-11 13:10:19,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int n,i,j,m,num=1;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n    {\n        for(j=2;j<i;j++)\n        if(i%j==0)  m++;\n        if(m==0)  num++;\n        m=0;\n    }\n    printf(\""\\n%d\"",num);\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,1000,304
1590934961773916160,348c6be11ad612e07e8824e376f10ab1994838daea566d3016f2cf5f23051287,2022-11-11 13:10:27,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,3,336
1590934969629847552,8f29029dc8006da83949d2656cc7dc83026d851252066fd4a9fc89071673ec96,2022-11-11 13:10:29,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint n,i;\n\tscanf(\""%d\"", &n);\n\tfor ( i = 0; i < n-1; i++)\n\t{\n\t\tprintf(\""6\\n\"");\n\t}\n\t\tprintf(\""6\"");\n}",WRONG_ANSWER,9,368
1590934974331682816,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 13:10:30,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int a,i,j,sum=0;\n    scanf(\""%d\"",&a);\n    for(i=1;i<a;i++)\n    {\n        for(j=1;j<i;j++)\n        {\n            if(i%j==0) break;\n            if(i==j) sum=sum+1;\n        }\n    }\n    printf(\""%d\\n\"",sum);\n}",WRONG_ANSWER,3,320
1590935006145458176,281adcca8943f9f4c0ced14f1ceffe157a34fca39f3cb864eb95e400944e38a8,2022-11-11 13:10:38,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main(){\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,2,348
1590935014211129344,e9a50f3e071443bb6fb229966bff355c178d484f6cc10e5e1fc8dc5a537237ba,2022-11-11 13:10:40,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n    int i,max,b,j;\n   scanf(\""%d\"",&b);\n   int a[b];\n   int c[b][b];\n   for(i=0;i<2;i++)\n    for(j=0;j<b;j++)\n       scanf(\""%d\"",&c[i][j]);\n   for(i=0;i<b;i++)\n     a[i]=c[1][i]-c[0][i];\n   max=a[0];\n   for(i=1;i<b;i++)\n   {\n      a[i]=a[i-1]+a[i];\n      if(max<a[i]) max=a[i];\n\n   }\n   printf(\""%d\"",max);\n}\n\n",WRONG_ANSWER,3,320
1590935015951740928,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-11-11 13:10:40,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"t=int(input())\nn=list(map(int,input().split(' ')))\nfor i in range(0,len(n)):\n    print(6**n[i] % 10)",TIME_LIMIT_EXCEEDED,167,3976
1590935067956916224,7d46013a6da090b69b62e7be93e7628aee2f7eef31af37777b9ccf1fd1d3eb2e,2022-11-11 13:10:53,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main (){\n    int n,a;\n    a=pow(6,n);\n    int b=a/1%10;\n    scanf(\""%d\"",&n);\n    printf(\""%d\"",b);\n    getchar();\n    return 0;\n}",WRONG_ANSWER,3,324
1590935154460262400,63100dc3d6ad69a2d3ecc24afe13fb180972cd8797da23e751be04e8088d66c2,2022-11-11 13:11:13,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"print(\""2022\"")",ACCEPTED,16,2876
1590935193920253952,15ac7d06a472ca25d78349f7cc3a73d23c7d7a4f0c4ae3cec6200fcdb8135965,2022-11-11 13:11:23,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,i,n,s,m;\n    scanf(\""%d\"",&n);\n    for(i=1,i<=n,i++){\n        for(m=1;m<=n;m++){ \n        if(i%m!=0){\n        s++\n        }\n        }\n       \n    }\nprintf(\""%d\"",s);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590935218586976256,2e4af98c441106efa9ee51f8a781d0eee91a3dff6193987d421eb3a48725c814,2022-11-11 13:11:28,C++,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <iostream>\n\nusing namespace std;\nbool list[100000]={false};\n\nvoid IsPrimt(int n);\n\nint main() {\n    int x;\n    scanf(\""%d\"", &x);\n    IsPrimt(x);\n    int n = 0;\n    for (int i = 2; i <= x; ++i) {\n        if (list[i] == false) n++;\n    }\n    printf(\""%d\"",n);\n    return 0;\n}\n\nvoid IsPrimt(int n) {\n    for (int i = 2; i * i <= n; i++)\n        if (!list[i])\n            for (int j = i * i; j <= n; j += i)\n                list[j] = true;\n}\n\n",ACCEPTED,6,608
1590935234516946944,aa65cdf25cbe32699d085a61c4f3ec5a4020e6a3dc1e0e9d6e2a48c9288f8026,2022-11-11 13:11:32,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main1 {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int i = scanner.nextInt();\n        while(i>0){\n            i--;\n            int i1 = scanner.nextInt();\n            if (i1==0){\n                System.out.print(1);\n            }\n            else {\n                    System.out.print(6);\n                }\n            if(i!=0) System.out.println();\n            }\n        }\n    },COMPILE_ERROR,0,0
1590935251466125312,919e6449799ef04f53dc21ab8608e866aab38f956abcadede4200c4c63859f1b,2022-11-11 13:11:36,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d\"",x+y+z);\n}",WRONG_ANSWER,3,188
1590935281212133376,aa65cdf25cbe32699d085a61c4f3ec5a4020e6a3dc1e0e9d6e2a48c9288f8026,2022-11-11 13:11:43,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main{\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int i = scanner.nextInt();\n        while(i>0){\n            i--;\n            int i1 = scanner.nextInt();\n            if (i1==0){\n                System.out.print(1);\n            }\n            else {\n                    System.out.print(6);\n                }\n            if(i!=0) System.out.println();\n            }\n        }\n    },NON_ZERO_EXIT_CODE,249,20448
1590935320898613248,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-11 13:11:53,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,a[n],i,j[n]\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    { scanf(\""%d\"",&a[i]);\n    j[i]=pow(6,a[i]);}\n    for(i=0;i<n;i++)\n        printf(\""%d\\n\"",j[i]%10);\n    return 0;\n}",COMPILE_ERROR,0,0
1590935329366913024,919e6449799ef04f53dc21ab8608e866aab38f956abcadede4200c4c63859f1b,2022-11-11 13:11:55,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n}",ACCEPTED,6,184
1590935330939801600,7d46013a6da090b69b62e7be93e7628aee2f7eef31af37777b9ccf1fd1d3eb2e,2022-11-11 13:11:55,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main (){\n    int n,a,c=6;\n    a=pow(c,n);\n    int b=a/1%10;\n    scanf(\""%d\"",&n);\n    printf(\""%d\"",b);\n    getchar();\n    return 0;\n}",WRONG_ANSWER,3,196
1590935333661904896,e9a50f3e071443bb6fb229966bff355c178d484f6cc10e5e1fc8dc5a537237ba,2022-11-11 13:11:56,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n    int i,max,b,j;\n   scanf(\""%d\"",&b);\n   int a[b];\n   int c[b][b];\n   for(i=0;i<2;i++)\n    for(j=0;j<b;j++)\n       scanf(\""%d\"",&c[i][j]);\n   for(i=0;i<b;i++)\n     a[i]=c[1][i]-c[0][i];\n   max=a[0];\n   for(i=1;i<b;i++)\n   {\n      a[i]=a[i-1]+a[i];\n      if(max<a[i]) max=a[i];\n\n   }\n   if(max>=0)printf(\""%d\"",max);\n    else  printf(\""0\"");\n}\n\n",WRONG_ANSWER,2,196
1590935336912486400,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-11 13:11:57,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main(){\n    int t,i,k;\n    double j;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<t;i++){\n        j=pow(6,a[i]);\n        int h=(int)j;\n        k=h%10;\n        if(i<t-1) printf(\""%d\\n\"",k);\n        else printf(\""%d\"",k);\n    }\n}",WRONG_ANSWER,7,308
1590935345670197248,345826d11b41befc23adeb536e81da8eb6ec9a8bfb9448acf91422deedb8ba4a,2022-11-11 13:11:59,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int t,i,n;\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++)\n        scanf(\""%d\"",&n);\n        for(i=0;i<t;i++)\n     if(n!=0)\n        printf(\""6\\n\"");\n    else\n        printf(\""1\\n\"");\n}\n",WRONG_ANSWER,9,312
1590935407699759104,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-11-11 13:12:14,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"t=int(input())\nn=list(map(int,input().split(' ')))\nfor i in range(0,len(n)):\n    print(6**n[i]%10)",TIME_LIMIT_EXCEEDED,165,4568
1590935452998242304,aa65cdf25cbe32699d085a61c4f3ec5a4020e6a3dc1e0e9d6e2a48c9288f8026,2022-11-11 13:12:24,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int i = scanner.nextInt();\n        while(i>0){\n            i--;\n            int i1 = scanner.nextInt();\n            if (i1==0){\n                System.out.print(1);\n            }\n            else {\n                    System.out.print(6);\n                }\n            if(i!=0) System.out.println();\n            }\n    }\n},NON_ZERO_EXIT_CODE,235,16804
1590935509180940288,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-11 13:12:38,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nvoid main()\n{\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n}",ACCEPTED,6,324
1590935550574530560,ccc42b8437aa15d1214e4623799ed35cd8ea8087c26cb1b596d51ae4556ea39c,2022-11-11 13:12:48,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"a=eval(input())\nsums=0\nfor j in range(2,a+1):\n    for i in range(2,j+1):\n        if i==j:\n            sums+=1\n        if j%i==0 and i!=j :\n            break\nprint(sums)",TIME_LIMIT_EXCEEDED,1000,3012
1590935553426653184,70c675ddfcb60b2192bc8ac38fb068fec0500208a5bf97a796c7cc074b43cf87,2022-11-11 13:12:48,Java,300.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tint count = 0;\n\t\tScanner myScanner = new Scanner(System.in);\n\t\tint n = myScanner.nextInt();\n\t\tfor(int i = 2;i < n;i++) {\n\t\t\tboolean loop = true;\n\t\t\tfor(int j = 2;j <= Math.sqrt(i);j++) {\n\t\t\t\tif(i%j == 0) {\n\t\t\t\t\tloop = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(loop) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n}\n,ACCEPTED,255,16920
1590935644401106944,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-11 13:13:10,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main(){\n    int t,i,k;\n    double j;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<t;i++){\n        j=pow(6,a[i]);\n        int h=(int)j;\n        k=h%10;\n        if(i<t-1) printf(\""%d\\n\"",k);\n        else printf(\""%d\"",k);\n    }\n}",WRONG_ANSWER,7,308
1590935728807284736,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 13:13:30,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int a,n,i,t;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a);\n        if(a==0)\n        {\n            printf(\""1\\n\"");\n        }\n        else\n        {\n            sum=pow(6,n);\n    yu=sum%10;\n    printf(\""%d\"",yu);\n    if(i!=x-1) printf(\""\\n\"");\n        }\n    }\n    \n}\n",COMPILE_ERROR,0,0
1590935765234810880,6cbd81921f92855c6b8318725b09ef7ec48ff579276b3df9f7ea04bea9804678,2022-11-11 13:13:39,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int m,i,n=0,num=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++){\n        for(m=2;m<i;m++){\n            if(i%m==0){\n                break;\n            }\n        }\n        if(m==i){\n            num+=1;\n        }\n    }\n    printf(\""\\n\\n\"",num);\n    return 0;\n}\n",WRONG_ANSWER,916,428
1590935772147023872,345826d11b41befc23adeb536e81da8eb6ec9a8bfb9448acf91422deedb8ba4a,2022-11-11 13:13:40,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int t,i,n;\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++)\n       {\n\n      scanf(\""%d\"",&n);\n     if(n!=0)\n        printf(\""6\\n\"");\n    else\n        printf(\""1\\n\"");\n        }\n}\n",ACCEPTED,11,312
1590935776383250432,af559dccfa68c49b94a61e83fc9942ea0513a50e66ecf36dc005df0e7960903e,2022-11-11 13:13:41,Java,300.0,1590528927448293376,1590525945717575680,1049226928954454016,public class Main{\npublic static void main(String args[]){\n    int i=2022;\n    System.out.println(i);\n}\n    }\n,ACCEPTED,69,16944
1590935804690628608,e51465ce72346fac918042a342986433269a159492161f223a180a6e05d9a01a,2022-11-11 13:13:48,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tint a=0,b=0,c=0;\n\t\tint num=6;\n\t\tint res=0;\n        while (in.hasNextInt()) {\n            a = in.nextInt();\n        }\n        if (a==1) {\n\t\t\tnum=6;\n\t\t}\n        for (int i = 1; i < a; i++) {\n\t\t\tnum*=6;\n\t\t}\n        res=num%10;\n        System.out.println(res);\n\t}\n",COMPILE_ERROR,0,0
1590935818598920192,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-11 13:13:51,Java,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"import java.util.Scanner;\n\npublic class Main{\n    public static void main(String args[]){\n        int X,Y,Z;\n        Scanner scanner = new Scanner(System.in);\n        X=scanner.nextInt();\n        Y=scanner.nextInt();\n        Z=scanner.nextInt();\n        System.out.println(X+Y-Z);\n    }\n}",ACCEPTED,231,16576
1590935827348238336,6933dcb3592e2d6f6fc887ed9a5537aab21a30f76450c9b5043f7776bfc39a59,2022-11-11 13:13:54,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nbool cmp(int a,int b){\n    return a>b;\n}\nint main(){\n    int n,i,j,x=0,k=0;\n    scanf(\""%d\"",&n);\n    int w1[n];\n    int w2[n];\n    int get[n*n];\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&w1[i]);\n    }\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&w2[i]);\n    }\n    for(i=0;i<n;i++){\n        for(j=i;j<n;j++,k++){\n            x=x+w2[j]-w1[j];\n            get[k]=x;\n        }\n    }\n    sort(get,get+((n*n+n)/2),cmp);\n        printf(\""%d\"",get[0]);\n    return 0;\n}",WRONG_ANSWER,3,328
1590935868091731968,e51465ce72346fac918042a342986433269a159492161f223a180a6e05d9a01a,2022-11-11 13:14:03,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tint a=0,b=0,c=0;\n\t\tint num=6;\n\t\tint res=0;\n        while (in.hasNextInt()) {\n            a = in.nextInt();\n        }\n        if (a==1) {\n\t\t\tnum=6;\n\t\t}\n        for (int i = 1; i < a; i++) {\n\t\t\tnum*=6;\n\t\t}\n        res=num%10;\n        System.out.println(res);\n\t}\n}\n",WRONG_ANSWER,116,16368
1590935870658641920,6cbd81921f92855c6b8318725b09ef7ec48ff579276b3df9f7ea04bea9804678,2022-11-11 13:14:04,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int m,i,n=0,num=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++){\n        for(m=2;m<i;m++){\n            if(i%m==0){\n                break;\n            }\n        }\n        if(m==i){\n            num+=1;\n        }\n    }\n    printf(\""%d\\n\"",num);\n    return 0;\n}\n",ACCEPTED,918,308
1590935880603316224,348c6be11ad612e07e8824e376f10ab1994838daea566d3016f2cf5f23051287,2022-11-11 13:14:06,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#   include<stdio.h>\nint main()\n{\n    int X,Y,Z,a;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    a=X+Y-Z;\n    printf(\""%d\"",a);\n    return 0;\n}",ACCEPTED,6,320
1590935886781550592,15ac7d06a472ca25d78349f7cc3a73d23c7d7a4f0c4ae3cec6200fcdb8135965,2022-11-11 13:14:08,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int i,n,s,m;\n    s=0;\n    scanf(\""%d\"",&n);\n    for(i=1,i<=n,i++){\n        for(m=1;m<=n;m++){ \n        if(i%m!=0){\n        s++\n        }\n        }\n       \n    }\nprintf(\""%d\"",s);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590935892045377536,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 13:14:09,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int a,n,i,t,yu,sum;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a);\n        if(a==0)\n        {\n            printf(\""1\\n\"");\n        }\n        else\n        {\n            sum=pow(6,n);\n            yu=sum%10;\n            printf(\""%d\"",yu);\n            if(i!=n-1) printf(\""\\n\"");\n        }\n    }\n    \n}\n",ACCEPTED,9,440
1590935893685370880,fec6d07e317796c63fb7ae6e7538f75973ad64af6e6196cc27eed3e9e685bf86,2022-11-11 13:14:09,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int b,i,j;\n    scanf(\""%d\"",&b);\n    int a[100],c[100];\n    int max=0,sum=0,thissum=0;\n    for(i=0;i<b;i++)\n        scanf(\""%d\"",&a[i]);\n    for( i=0;i<b;i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=0;i<b;i++)\n    {\n    for(j=i;j<b+i;j++)\n    {\n        thissum=thissum-a[j%10]+c[j%10];\n        if(thissum>max)\n            max=thissum;\n    }\n    if(thissum>sum)\n        sum=thissum;\n    }\n    printf(\""%d\\n\"",max);\n}",WRONG_ANSWER,3,180
1590935897254727680,ccc42b8437aa15d1214e4623799ed35cd8ea8087c26cb1b596d51ae4556ea39c,2022-11-11 13:14:10,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"def prime(p):\n    a=p//2\n    for i in range(2,a+1):\n        if p%i==0:\n            return False\n    return True\na=eval(input())\nsums=0\n\nfor i in range(2,a+1):\n    if prime(i)==True:\n        sums+=1\nprint(sums)",TIME_LIMIT_EXCEEDED,1000,2916
1590935936014266368,6b312558d54f4eeffd1aa510a96dd5882584f6bf7857d244f71013b7ec561920,2022-11-11 13:14:19,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}\n",ACCEPTED,3,184
1590935957430403072,7c6d208c4c4b695bc8d6f8ae0c0357c2466f5c9f86ec0652674812219ac09d38,2022-11-11 13:14:25,Java,0.0,1590734963702620160,1590734503495200768,1049226928954454016,import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args)  {\n        Scanner sc = new Scanner(System.in);\n       int a = sc.nextInt();\n       int[] arr = new int[a];\n       int[] brr = new int[a];\n       int[] crr = new int[a];\n        for (int i = 0; i < a; i++) {\n            int b = sc.nextInt();\n            brr[i]  = b;\n        }\n        for (int i = 0; i < a; i++) {\n            int c  = sc.nextInt();\n            crr[i] = c;\n        }\n        for (int i = 0; i < a; i++) {\n            arr[i] = crr[i]-brr[i];\n        }\n        int max = arr[0];\n        int b = 0;\n        for (int i = 0; i < arr.length; i++) {\n          b = b + arr[i];\n          if (b>max){\n              max = b;\n          }\n        }\n        System.out.println(max);\n    }\n\n}\n,WRONG_ANSWER,117,19264
1590935960425140224,7d46013a6da090b69b62e7be93e7628aee2f7eef31af37777b9ccf1fd1d3eb2e,2022-11-11 13:14:25,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main (){\n    int n,a,b;\n    a=pow(6,n);\n    b=a%10;\n    scanf(\""%d\"",&n);\n    printf(\""%d\"",b);\n    getchar();\n    return 0;\n}",WRONG_ANSWER,4,308
1590936001659342848,617f184ce583e9f7a346564ab5659fda0ca35a3a714a0c929cb07f915f4f514b,2022-11-11 13:14:35,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z;\n    for(X=0;X<8;X++)\n    {\n        for(Y=0;Y<7;Y++)\n        {\n            for(Z=0;Z<3;Z++)\n        }\n    }\n    printf(\""X+Y-Z=%d\"",X+Y-Z);\n    return 0;\n}",COMPILE_ERROR,0,0
1590936038468554752,7d46013a6da090b69b62e7be93e7628aee2f7eef31af37777b9ccf1fd1d3eb2e,2022-11-11 13:14:44,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main (){\n    int n,a,b;\n    a=pow(6,n);\n    b=a%10;\n    scanf(\""%d\"",&n);\n    printf(\""%d\"",b);\n    getchar();\n    return 0;\n}",WRONG_ANSWER,3,192
1590936047133962240,6933dcb3592e2d6f6fc887ed9a5537aab21a30f76450c9b5043f7776bfc39a59,2022-11-11 13:14:46,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nbool cmp(int a,int b){\n    return a>b;\n}\nint main(){\n    int n,i,j,x=0,k=0;\n    scanf(\""%d\"",&n);\n    int w1[n];\n    int w2[n];\n    int get[n*n];\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&w1[i]);\n    }\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&w2[i]);\n    }\n    for(i=0;i<n;i++){\n        for(j=i;j<n;j++,k++){\n            x=x+w2[j]-w1[j];\n            get[k]=x;\n        }\n    }\n    sort(get,get+((n*n+n)/2),cmp);\n        printf(\""%d\\n\"",get[0]);\n    return 0;\n}",WRONG_ANSWER,2,196
1590936069544153088,5a1c17b308a3b3595833d34c6bdfb75e9f5dd0d065acfeb7f28ab8102ba7406c,2022-11-11 13:14:51,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint n,i,j;\n\tint cnt = 0;\n\tscanf(\""%d\"",&n);\n    for(i=3;i<=n;i+=2){\n\t\tfor(j=2;j<sqrt(i);j++){\n\t\t\tif(i%j==0){\n\t\t\t\tbreak;\n            }\n\t\t}\n\t\tif(j>sqrt(i)){\n\t\t\tcnt++;\n\t\t}\n    }\n    printf(\""%d\"",cnt+1);\n\t\treturn 0;\n}\n",ACCEPTED,13,320
1590936089941053440,617f184ce583e9f7a346564ab5659fda0ca35a3a714a0c929cb07f915f4f514b,2022-11-11 13:14:56,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z;\n    for(X=0;X<8;X++)\n    {\n        for(Y=0;Y<7;Y++)\n        {\n            for(Z=0;Z<3;Z++)\n            {\n\n            }\n        }\n    }\n    printf(\""X+Y-Z=%d\"",X+Y-Z);\n    return 0;\n}\n",WRONG_ANSWER,3,316
1590936113349439488,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 13:15:02,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,3,180
1590936128960663552,6383c93cbdef4af3eda29400a925819f16ad4afc8368e604ccd580cba7055bdd,2022-11-11 13:15:05,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n    int t;\n    if(scanf(\""%d\"",&t)){\n    for(int k=1;k<=t;k++){\n    int n;\n    if(scanf(\""%d\"",&n)){\n    int x = 6;\n    for(int i=1;i<n;i++){\n        x*=6;\n    }\n    int res = x%10;\n    printf(\""%d\\n\"",res);\n    }\n    }\n    }\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,22,312
1590936139983290368,281adcca8943f9f4c0ced14f1ceffe157a34fca39f3cb864eb95e400944e38a8,2022-11-11 13:15:08,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a;\n    int b;\n    int c;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    printf(\""%d\"",a+b-c);\n    return 0;\n}",ACCEPTED,7,332
1590936142550204416,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 13:15:09,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,2,196
1590936147986026496,c9a8fe962a36cf99ca362f66348b02453584251c62fe2356e11d2a6efd5cee45,2022-11-11 13:15:10,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n   int i,a,n,s;\n   int sum;\n   scanf(\""%d\"",&n);\n   for(i=0;i<=n;i++)\n   {\n       scanf(\""%d\"",&a);\n       sum= a^6;\n       s=sum%10;\n       printf(\""%d\\n\"",s);\n   }\nreturn 0;\n}\n",WRONG_ANSWER,3,312
1590936157653897216,8f29029dc8006da83949d2656cc7dc83026d851252066fd4a9fc89071673ec96,2022-11-11 13:15:12,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <map>\n#include <set>\n#include <cmath>\n#include <queue>\n#include <stack>\n#include <cstdio>\n#include <string>\n#include <vector>\n#include <cstring>\n#include <iomanip>\n#include <iostream>\n#include <algorithm>\n#define inf 1000000007\n#define wc 1e-8\nusing namespace std;\ntypedef long long ll;\nint prime[10000010];\nint isprime[10000010];\nint xxs(int n)\n{\n    int ct=0;\n    for(int i=2; i<=n; i++)\n    {\n        if(!isprime[i])\n        {\n            prime[ct++]=i;\n            isprime[i]=i;\n        }\n        for(int j=0; j<ct&&prime[j]*i<=n; j++)\n        {\n            isprime[prime[j]*i]=prime[j];\n            if(!(i%prime[j]))\n                break;\n        }\n    }\n    return ct;\n}\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    printf(\""%d\\n\"",xxs(n));\n    return 0;\n}",COMPILE_ERROR,0,0
1590936199005536256,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 13:15:22,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int x = 0, y = 0, z = 0;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    int sum = x + y - z;\n    printf(\""%d\"",sum);\n    return 0;\n}",ACCEPTED,7,464
1590936208216227840,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-11 13:15:24,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main(){\n    int t,i,k;\n    int j;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<t;i++){\n        j=pow(6,a[i]);\n        k=j%10;\n        if(i<t-1) printf(\""%d\\n\"",k);\n        else printf(\""%d\"",k);\n    }\n}",WRONG_ANSWER,6,320
1590936211156434944,8f29029dc8006da83949d2656cc7dc83026d851252066fd4a9fc89071673ec96,2022-11-11 13:15:25,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <set>\n#include <cmath>\n#include <queue>\n#include <stack>\n#include <cstdio>\n#include <string>\n#include <vector>\n#include <cstring>\n#include <iomanip>\n#include <iostream>\n#include <algorithm>\n#define inf 1000000007\n#define wc 1e-8\nusing namespace std;\ntypedef long long ll;\nint prime[10000010];\nint isprime[10000010];\nint xxs(int n)\n{\n    int ct=0;\n    for(int i=2; i<=n; i++)\n    {\n        if(!isprime[i])\n        {\n            prime[ct++]=i;\n            isprime[i]=i;\n        }\n        for(int j=0; j<ct&&prime[j]*i<=n; j++)\n        {\n            isprime[prime[j]*i]=prime[j];\n            if(!(i%prime[j]))\n                break;\n        }\n    }\n    return ct;\n}\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    printf(\""%d\\n\"",xxs(n));\n    return 0;\n}",COMPILE_ERROR,0,0
1590936219054313472,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 13:15:27,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int x = 0, y = 0, z = 0;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    int sum = x + y - z;\n    printf(\""%d\"",sum);\n    return 0;\n}",ACCEPTED,6,316
1590936240688529408,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 13:15:32,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\npublic class Main{\n    public static void main(String args[]){\n    int x,y;\n    Scanner scanner=new Scanner(System.in);\n    y=scanner.nextInt();\n    for(int i=0;i<y;i++){\n        x=scanner.nextInt();\n        System.out.println(x==0?\""1\"":\""6\"");\n    }\n}\n           // return 0;\n}",NON_ZERO_EXIT_CODE,226,16604
1590936268828119040,39afbda4ab6a7df2673bc0d0eec048a42b23ada2774ec941935a2b2fa044515a,2022-11-11 13:15:39,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <bits/stdc++.h>\nusing namespace std;\nint main(){\nint n,x,i,j,p;\ncin>>n;\nfor(i=0;i<n;i++){\ncin>>x;\np=pow(6,x);\ncout<<p%10<<endl;\n}\n}\n",WRONG_ANSWER,8,448
1590936292337192960,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 13:15:44,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int a,i,j,sum=0;\n    scanf(\""%d\"",&a);\n    for(i=1;i<a;i++)\n    {\n        for(j=1;j<i;j++)\n        {\n            if(i%j==0) break;\n        }\n        if(i=j) sum=sum+1;\n    }\n    printf(\""%d\\n\"",sum);\n}",TIME_LIMIT_EXCEEDED,1000,312
1590936293905858560,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 13:15:45,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t = 0;\n    scanf(\""%d\"",&t);\n    while(t--)\n    {\n        int n = 0;\n        scanf(\""%d\"",&n);\n        int sum = pow(6,n);\n        int num = sum % 10;\n        printf(\""%d\\n\"",num);\n    }\n    return 0;\n}",WRONG_ANSWER,6,312
1590936360272330752,39afbda4ab6a7df2673bc0d0eec048a42b23ada2774ec941935a2b2fa044515a,2022-11-11 13:16:01,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <bits/stdc++.h>\nusing namespace std;\nint main(){\nint n,x,i,p;\ncin>>n;\nfor(i=0;i<n;i++){\ncin>>x;\np=pow(6,x);\ncout<<p%10<<endl;\n}\n}\n",WRONG_ANSWER,9,444
1590936377926156288,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 13:16:05,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\npublic class Main{\n    public static void main(String args[]){\n    int x,y;\n    Scanner scanner=new Scanner(System.in);\n    y=scanner.nextInt();\n    for(int i=0;i<y;i++){\n        x=scanner.nextInt();\n        System.out.println(x==0?\""1\"":\""6\"");\n    }\n}\n           return 0;\n}",COMPILE_ERROR,0,0
1590936379914235904,05f9d62a2660f27e0711448c225e5e0fe6347745a2c93edb6296c0a2ffbc6605,2022-11-11 13:16:05,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nmain()\n{\n    int m,i,j,k,num=0;\n    scanf(\""%d\"",&m);\n    for(i=2;i<=m;i++)\n    {\n        k=(int)sqrt(i);\n        for(j=2;j<=k;j++)\n    {\n        if(i%j==0)\n            break;\n    }\n        if(j>k)\n            num++;\n    }\n    printf(\""%d\"",num);\n}",ACCEPTED,13,344
1590936390299357184,7d46013a6da090b69b62e7be93e7628aee2f7eef31af37777b9ccf1fd1d3eb2e,2022-11-11 13:16:08,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nvoid main (){\n    int n,a,b;\n    a=pow(6,n);\n    b=a%10;\n    scanf(\""%d\"",&n);\n    printf(\""%d\"",b);\n    getchar();\n    return 0;\n}",WRONG_ANSWER,3,352
1590936430174580736,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-11 13:16:17,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<iostream>\n#include<time.h>\nusing namespace std;\nint main(int argc, char* argv[])\n{\n\ttime_t curtime;\n\ttime(&curtime);\n\ttm *info;\n\tchar buff[80];\n\tinfo = localtime(&curtime);\n\tstrftime(buff, 80, \""%Y\"", info);\n\tcout << (info->tm_year)+1900;\n\treturn 0;\n}",COMPILE_ERROR,0,0
1590936433542627328,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 13:16:18,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t = 0;\n    scanf(\""%d\"",&t);\n    while(t--)\n    {\n        int n = 0;\n        scanf(\""%d\"",&n);\n        int sum = (int)pow(6,n);\n        int num = sum % 10;\n        printf(\""%d\\n\"",num);\n    }\n    return 0;\n}\n",WRONG_ANSWER,6,352
1590936505558827008,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-11 13:16:35,C++,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<iostream>\n#include<time.h>\nusing namespace std;\nint main(int argc, char* argv[])\n{\n\ttime_t curtime;\n\ttime(&curtime);\n\ttm *info;\n\tchar buff[80];\n\tinfo = localtime(&curtime);\n\tstrftime(buff, 80, \""%Y\"", info);\n\tcout << (info->tm_year)+1900;\n\treturn 0;\n}",ACCEPTED,4,308
1590936508876500992,0b693affc66d8d407ff008bd1aaf4f2feb4a615f057943ba4b4ba3163d937dc6,2022-11-11 13:16:36,Java,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"import java.io.*;\nimport java.util.*;\n\npublic class Main {\n\n    public static void main(String[] args) throws IOException {\n        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n        Scanner sc=new Scanner(System.in);\n        int a=sc.nextInt();\n        System.out.println(countPrimes(a));\n    }\n\n    public static int countPrimes(int n) {\n        int[] isPrime=new int[n];\n        Arrays.fill(isPrime,1);\n        int res=0;\n        for (int i = 2; i < n; i++) {\n            if(isPrime[i]==1){\n                res++;\n                if( (long) i*i<n){\n                    for (int j = i*i; j < n; j+=i) {\n                        isPrime[j]=0;\n                    }\n                }\n            }\n        }\n        return res;\n    }\n\n    /*private static boolean isZHI(int n) {\n        for (int i = 2; i <n/2+1 ; i++) {\n            if (n%i==0)\n                return false;\n        }\n        return true;//是质数\n    }*/\n\n\n}",ACCEPTED,256,16404
1590936535095115776,6933dcb3592e2d6f6fc887ed9a5537aab21a30f76450c9b5043f7776bfc39a59,2022-11-11 13:16:42,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nbool cmp(int a,int b){\n    return a>b;\n}\nint main(){\n    int n,i,j,x=0,k=0;\n    scanf(\""%d\"",&n);\n    int w1[n];\n    int w2[n];\n    int get[n*n];\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&w1[i]);\n    }\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&w2[i]);\n    }\n    for(i=0;i<n;i++){\n        for(j=i;j<n;j++,k++){\n            x=x+w2[j]-w1[j];\n            get[k]=x;\n        }\n    }\n    sort(get,get+(n*(n+1)/2),cmp);\n        printf(\""%d\\n\"",get[0]);\n    return 0;\n}",WRONG_ANSWER,3,316
1590936551704539136,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-11 13:16:46,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String args[]) {\n        int a;\n        int b = 0;\n        int flag = 0;\n        Scanner scanner = new Scanner(System.in);\n        a = scanner.nextInt();\n        for (int i = 2; i <= a; i++) {\n            for (int j = 2; j < i; j++) {\n                if (i % j == 0)\n                    flag = 1;\n            }\n            if (flag == 0) {\n                b++;\n            }\n            flag = 0;\n        }\n        System.out.println(b);\n\n    }\n}\n,WRONG_ANSWER,996,16540
1590936552698589184,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-11 13:16:46,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,a[],i,j[n]\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    { scanf(\""%d\"",&a[i]);\n       j[i]=pow(6,a[i]);}\n    for(i=0;i<n;i++)\n        printf(\""%d\\n\"",j[i]%10);\n    return 0;\n}",COMPILE_ERROR,0,0
1590936563033354240,345826d11b41befc23adeb536e81da8eb6ec9a8bfb9448acf91422deedb8ba4a,2022-11-11 13:16:49,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int t,i,n;\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++)\n       {\n\n      scanf(\""%d\"",&n);\n     if(n!=0)\n        printf(\""6\\n\"");\n    else\n        printf(\""1\\n\"");\n        }\n}\n",ACCEPTED,6,324
1590936583468027904,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 13:16:54,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int a,i,j,sum=0;\n    scanf(\""%d\"",&a);\n    for(i=2;i<=a;i++)\n    {\n        for(j=2;j<=i;j++)\n        {\n            if(i%j==0) break;\n        }\n        if(i=j) sum+=1;\n    }\n    printf(\""%d\\n\"",sum);\n}",TIME_LIMIT_EXCEEDED,1000,296
1590936601331544064,887d1bbe53a4d4a349813887f13126da5e46a853687f4c2c9d7b8ef3d748a9d6,2022-11-11 13:16:58,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int x,y,z,j=0;\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    j=x+y-z;\n    printf(\""%d\"",j);\n}\n",ACCEPTED,5,344
1590936611934769152,e0a829315cc9947a3e714cd579e3322e8dee5f8ca36e30fd276de5a8e294b6f8,2022-11-11 13:17:01,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n int n;\n int i,x,y;\n scanf(\""%d\\n\"",&n);\n for(i=0;i<n;i++)\n    {scanf(\""%d\"",&x);\n    y=pow(6,x);}\n    for(i=0;i<n;i++)\n    printf(\""%d\\n\"",y%10);\n    return 0;\n}\n",WRONG_ANSWER,6,324
1590936710714822656,af559dccfa68c49b94a61e83fc9942ea0513a50e66ecf36dc005df0e7960903e,2022-11-11 13:17:24,Java,300.0,1590524835191705600,1572865591226855424,1049226928954454016,import java.util.Scanner;\npublic class Main{\npublic static void main(String args[]){\n    Scanner sc =new Scanner(System.in);\n    int x=sc.nextInt();\n    int y=sc.nextInt();\n    int z=sc.nextInt();\n    System.out.println(x+y-z);\n}\n    }\n,ACCEPTED,245,18928
1590936719485108224,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-11 13:17:26,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,a[],i,j[]\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    { scanf(\""%d\"",&a[i]);\n       j[i]=pow(6,a[i]);}\n    for(i=0;i<n;i++)\n        printf(\""%d\\n\"",j[i]%10);\n    return 0;\n}",COMPILE_ERROR,0,0
1590936740926390272,7c6d208c4c4b695bc8d6f8ae0c0357c2466f5c9f86ec0652674812219ac09d38,2022-11-11 13:17:31,Java,0.0,1590734963702620160,1590734503495200768,1049226928954454016,import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args)  {\n        Scanner sc = new Scanner(System.in);\n       int a = sc.nextInt();\n       int[] arr = new int[a];\n       int[] brr = new int[a];\n       int[] crr = new int[a];\n        for (int i = 0; i < a; i++) {\n            int b = sc.nextInt();\n            brr[i]  = b;\n        }\n        for (int i = 0; i < a; i++) {\n            int c  = sc.nextInt();\n            crr[i] = c;\n        }\n        for (int i = 0; i < a; i++) {\n            arr[i] = crr[i]-brr[i];\n        }\n        int max = arr[0];\n        int b = 0;\n        for (int i = 0; i < arr.length; i++) {\n          b = b + arr[i];\n          if (b < 0){\n              b = arr[i+1];\n          }\n          if (b>max){\n              max = b;\n          }\n        }\n        System.out.println(max);\n    }\n\n}\n,WRONG_ANSWER,130,16068
1590936747477872640,630b8bfc88107b488e158fc7108c8faf0a195f9b9030c3faf51edac625714584,2022-11-11 13:17:33,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main(){\nint a,b,t,i;\nscanf(\""%d\"",&t);\nint n[t];\nfor(i=0;i<t;i++){\n    scanf(\""%d\"",&n[i]);\n}\nfor(i=0;i<t;i++){\n    b=pow(6,n[i]);\n    b=b%10;\n    printf(\""%d\"",b);\n    if(i!=t-1) printf(\""\\n\"");\n}\n}\n",WRONG_ANSWER,4,200
1590936795511042048,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-11 13:17:44,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main(){\n    int t,i,k;\n    int j;\n    int a[10000];\n    scanf(\""%d\"",&t);\n    \n    for(i=0;i<t;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<t;i++){\n        j=pow(6,a[i]);\n        k=j%10;\n        if(i<t-1) printf(\""%d\\n\"",k);\n        else printf(\""%d\"",k);\n    }\n}",WRONG_ANSWER,6,568
1590936802465222656,7ecf54bf0ea2db8ab0397aa941f19ec79a351bc3e86e8c01673aa09a69b3a6db,2022-11-11 13:17:46,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"n = int(input())\nj = input().split()\ni = input().split()\ns = int(i[0]) - int(j[0])\n\nfor k in range(1,n):\n    if(s>s+int(i[k])-int(j[k])):\n        print(s)\n        break\n    elif(s==s+int(i[k])-int(j[k])):\n       continue\n    else:\n        s += int(i[k])-int(j[k])",WRONG_ANSWER,16,2756
1590936891241857024,7ecf54bf0ea2db8ab0397aa941f19ec79a351bc3e86e8c01673aa09a69b3a6db,2022-11-11 13:18:07,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"n = int(input())\nj = input().split()\ni = input().split()\ns = int(i[0]) - int(j[0])\n\nfor k in range(1,n):\n    if(s>s+int(i[k])-int(j[k])):\n        print(s)\n        break\n    else:\n        s += int(i[k])-int(j[k])",WRONG_ANSWER,15,2748
1590936902004445184,7d46013a6da090b69b62e7be93e7628aee2f7eef31af37777b9ccf1fd1d3eb2e,2022-11-11 13:18:10,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main (){\n    int n,a,b;\n    a=pow(6,n);\n    b=a%10;\n    scanf(\""%d\"",&n);\n    printf(\""%d\"",b);\n    return 0;\n}",WRONG_ANSWER,3,344
1590936949609795584,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 13:18:21,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n    int t = 0;\n    \n    while(scanf(\""%d\"",&t) != EOF)\n    { \n        int n = 0;\n        scanf(\""%d\"",&n);\n        int sum = (int)pow(6,n);\n        int num = sum % 10;\n        printf(\""%d\\n\"",num);\n    }\n    return 0;\n}\n",WRONG_ANSWER,3,316
1590936970526789632,06b00897262b024d9e66dcd771cf81de9b63954f7a4554699d17c2158114c0d1,2022-11-11 13:18:26,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n;\n\tscanf(\""%d\"",&n);\n\tint q[n];\n\tint i=0,j=0;\n\tfor(i;i<n;i++){\n\t\tscanf(\""%d\"",&q[i]);\n\t}\n\tfor(j;j<n;j++){\n\t\tif(q[j]==0){\n\t\t\tprintf(\""1\\n\"");\n\t\t}else if(j<n-1){\n\t\t\tprintf(\""6\\n\"");\n\t\t}else{\n\t\t\tprintf(\""6\"");\n\t\t}\n\t}\n    return 0;\n}",ACCEPTED,7,348
1590936971021717504,6933dcb3592e2d6f6fc887ed9a5537aab21a30f76450c9b5043f7776bfc39a59,2022-11-11 13:18:26,C++,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nbool cmp(int a,int b){\n    return a>b;\n}\nint main(){\n    int n,i,j,x=0,k=0;\n    scanf(\""%d\"",&n);\n    int w1[n];\n    int w2[n];\n    int get[n*n];\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&w1[i]);\n    }\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&w2[i]);\n    }\n    for(i=0;i<n;i++){\n        for(j=i,x=0;j<n;j++,k++){\n            x=x+w2[j]-w1[j];\n            get[k]=x;\n        }\n    }\n    sort(get,get+(n*(n+1)/2),cmp);\n        printf(\""%d\\n\"",get[0]);\n    return 0;\n}",ACCEPTED,3,308
1590937094623637504,0aa773cdb5cb621d4131c7d2b98b0724b7e9e93f4310c787c0a9a219d05e0ff2,2022-11-11 13:18:56,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main()\n{int i,j,n,flag;\nint s=0;\nscanf(\""%d\"",&n);\nfor(i=2;i<=n;i++)\n{\n    flag=1;\n    for(j=2;j<=sqrt(i);j++)\n    {\n        if(i%j==0){\n            flag=0;\n            break;\n        }\n    }\n}\nif(flag) {\n    s++;\n\n}\nprintf(\""%d\"",s);\nreturn 0;\n }",WRONG_ANSWER,10,320
1590937106569035776,86f702b052a21d7cb2f8cd933c678c21efaafaf5b2d35032f18ec35c1e26a945,2022-11-11 13:18:59,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}\n",ACCEPTED,3,352
1590937153738178560,4812f9582f90b7f3f95178a62ec39f3555e90b935658da3e31a47fe0d2e8c6fd,2022-11-11 13:19:10,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""2022\\n\"");\n    return 0;\n}\n",ACCEPTED,3,320
1590937181533831168,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 13:19:16,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"a=int(input())\ndata1=list(map(int,input().split()))\ndata2=list(map(int,input().split()))\n\n\nsum1=sum(data1[:5])\nsum2=sum(data2[:5])\ndates=sum2-sum1\nprint(dates)\n",WRONG_ANSWER,14,2876
1590937226408689664,15ac7d06a472ca25d78349f7cc3a73d23c7d7a4f0c4ae3cec6200fcdb8135965,2022-11-11 13:19:27,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,i,n,s,m;\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++){\n        for(m=2;m<n;m++){\n        if(i%m!=0){\n        s++;\n        }\n        }\n\n    }\nprintf(\""%d\"",s);\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,1000,436
1590937273338761216,6383c93cbdef4af3eda29400a925819f16ad4afc8368e604ccd580cba7055bdd,2022-11-11 13:19:38,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main()\n{\n    int t;\n    if(scanf(\""%d\"",&t)){\n    for(int k=1;k<=t;k++){\n    int n;\n    if(scanf(\""%d\"",&n)){\n    int x = 6;\n    int j = pow(x,n);\n    int res = j%10;\n    printf(\""%d\\n\"",res);\n    }\n    }\n    }\n    return 0;\n}\n",WRONG_ANSWER,6,196
1590937277503700992,23d287b80d4d430308a1b57ee92bb4f2d1b25d1142a13c1c0fda4316c9bb9f17,2022-11-11 13:19:39,Python,300.0,1590524835191705600,1572865591226855424,1049226928954454016,x=list(input().split())\nX=int(x[0])\nY=int(x[1])\nZ=int(x[2])\nprint(X+Y-Z),ACCEPTED,31,2756
1590937303663554560,ccc42b8437aa15d1214e4623799ed35cd8ea8087c26cb1b596d51ae4556ea39c,2022-11-11 13:19:46,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=eval(input())\nb=map(int,input().split())\nc=set(b)\nfor i in c:\n    if i==0:\n        print(1)\n    else:\n        print(6)",WRONG_ANSWER,50,2912
1590937337645830144,0ccbaaa612b3d01dbe621ce5e7366d6e26d2e5adf55047d92c6eb7adf78a979d,2022-11-11 13:19:54,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int n;cin>>n;\n    int a[n],b[n],c[n];\n    for(int i=0;i<n;i++) cin>>a[i];\n    for(int i=0;i<n;i++) cin>>b[i];\n    for(int i=0;i<n;i++) c[i]=a[i]-b[i];\n    int sum = 0;\n\tfor(int i=0;i<n;i++)\t{\n\t\tint thisSum = 0;\n\t\tfor(int j = i; j < n; j++){\n\t\t\tthisSum += c[j];\n\t\t\tif(thisSum > sum){\n\t\t\t\tsum = thisSum;\n\t\t\t}\n\t\t}\t\n\t}\n    cout<<sum;\n    return 0;\n}",WRONG_ANSWER,4,320
1590937385704140800,e51465ce72346fac918042a342986433269a159492161f223a180a6e05d9a01a,2022-11-11 13:20:05,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tint a=0;\n\t\tint num=6;\n\t\tint res=0;\n        while (in.hasNextInt()) {\n            a = in.nextInt();\n        }\n        num =(int) Math.pow(num, a);\n        res=num%10;\n        System.out.println(res);\n\t}\n}",WRONG_ANSWER,116,19224
1590937436350386176,6383c93cbdef4af3eda29400a925819f16ad4afc8368e604ccd580cba7055bdd,2022-11-11 13:20:17,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main()\n{\n    int t;\n    if(scanf(\""%d\"",&t)){\n    for(int k=1;k<=t;k++){\n    int n;\n    if(scanf(\""%d\"",&n)){\n    int x = 6;\n    int j = pow(x,n);\n    int res = j%10;\n    printf(\""%d\\n\"",res);\n    }\n    }\n    }\n    return 0;\n}\n",WRONG_ANSWER,6,572
1590937444298588160,0aa773cdb5cb621d4131c7d2b98b0724b7e9e93f4310c787c0a9a219d05e0ff2,2022-11-11 13:20:19,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{int i,j,n,flag;\nint s=0;\nscanf(\""%d\"",&n);\nfor(i=2;i<=n;i++)\n{\n    flag=1;\n    for(j=2;j<=sqrt(i);j++)\n    {\n        if(i%j==0){\n            flag=0;\n            break;\n        }\n    }\n}\nif(flag) {\n    s++;\n\n}\nprintf(\""%d\"",s);\nreturn 0;\n }",WRONG_ANSWER,11,316
1590937502872043520,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 13:20:33,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"a=int(input())\ndata1=list(map(int,input().split()))\ndata2=list(map(int,input().split()))\nsum1=sum(data1[:int(10/2)])\nsum2=sum(data2[:int(10/2)])\ndates=sum2-sum1\nprint(dates)\n",WRONG_ANSWER,16,3024
1590937517996707840,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-11 13:20:37,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n    int t,i;\n    long j,k;\n    int a[10000];\n    scanf(\""%d\"",&t);\n    \n    for(i=0;i<t;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<t;i++){\n        j=pow(6,a[i]);\n        k=j%10;\n        if(i<t-1) printf(\""%d\\n\"",k);\n        else printf(\""%d\"",k);\n    }\n}",WRONG_ANSWER,6,312
1590937519112368128,902d8082eea06043d392298983db4630cde4418ac8ee42282d537bfaae045c2f,2022-11-11 13:20:37,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"b=0\na=eval(input())\nfor i in range(1,a+1):\n    for j in range(2,int(i ** 0.5) +1):\n        if i%j == 0:\n            b =b+ 1\n            break\nprint(a-b)",COMPILE_ERROR,0,0
1590937524426575872,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-11 13:20:38,C++,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main(int argc, char* argv[])\n{\n\tint A, B, C;\n\tcin >> A >> B >> C;\n\tcout << A + B - C << endl;\n\treturn 0;\n}",ACCEPTED,7,456
1590937553845424128,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 13:20:45,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"a=int(input())\ndata1=list(map(int,input().split()))\ndata2=list(map(int,input().split()))\nsum1=sum(data1[:int(a/2)])\nsum2=sum(data2[:int(a/2)])\ndates=sum2-sum1\nprint(dates)\n",WRONG_ANSWER,15,2752
1590937558798897152,458af3c005e0b282d1ca88c254d9910ee2d93738b6f06d399f7444e1e64831eb,2022-11-11 13:20:46,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"# include <stdio.h>\n# include <stdbool.h>\n\nbool isPrime(int n);\n\nint main()\n{\n\tint n,a;\n    a=0;\n\tscanf(\""%d\"", &n);\n\tfor (int i = 2; i < n; i++) {\n\t\tif (isPrime(i)) {\n            a++;\n\t\t}\n\t}\n\tprintf(\""%d\"",a);\n\treturn 0;\n}\n\nbool isPrime(int n)\n{\n\tfor (int i = 2; i < n; i++) {\n\t\tif (n % i == 0) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n",ACCEPTED,913,384
1590937582110814208,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 13:20:52,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n    int t = 0;\n    scanf(\""%d\"",&t);\n    \n    while(t--)\n    {\n        int n = 0;\n        scanf(\""%d\"",&n);\n        int sum = (int)pow(6,n);\n        int num = sum % 10;\n        printf(\""%d\\n\"",num);\n    }\n    return 0;\n}\n",WRONG_ANSWER,5,324
1590937595389980672,9ca3f63f61fa4f349009d69e7059514c3a39dbdd5a1f94342c11f4c33ccdceaa,2022-11-11 13:20:55,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"x = int(input())\ny = input().split(\"" \"")\nz = input().split(\"" \"")\nb = c = 0\nfor j in range(x):\n    b= 0\n    for i in range(j,x):\n        a = int(z[i])-int(y[i])\n        if a >0:\n            b = b+a\n        if a<0:\n            break\n    if c < b:\n        c = b\nprint(c)\n",WRONG_ANSWER,15,2884
1590937629732941824,902d8082eea06043d392298983db4630cde4418ac8ee42282d537bfaae045c2f,2022-11-11 13:21:03,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"b=0\na=eval(input())\nfor i in range(1,a+1):\n    for j in range(2,int(i ** 0.5) +1):\n        if i%j == 0:\n            b =b+ 1\n            break\nprint(a-b)",WRONG_ANSWER,239,2872
1590937647252549632,6b312558d54f4eeffd1aa510a96dd5882584f6bf7857d244f71013b7ec561920,2022-11-11 13:21:07,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z,S;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    if(0<=X &&X<=100 &&0<=Y &&Y<=100&&0<=Z &&Z<=100 )\n        printf(\""%d\"",X+Y-Z);\n    else\n        printf(\""输入错误\"");\n    return 0;\n}\n",ACCEPTED,4,328
1590937656496795648,63100dc3d6ad69a2d3ecc24afe13fb180972cd8797da23e751be04e8088d66c2,2022-11-11 13:21:10,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,X=int(input())\nY=int(input())\nZ=int(input())\nif X<100 and X>=0 and Y<100 and Y>=0 and Z<100 and Z>=0 :\n    D=X+Y-Z\n    print(D)\n,NON_ZERO_EXIT_CODE,16,2756
1590937672892354560,547094c7c62f34b25dac6d7d79e017d817767a29a120ff5083d5fe0c21b62800,2022-11-11 13:21:14,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int year;\n    scanf(\""%d\"",&year)\n    printf(\""%d\"",yera);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590937674486185984,630b8bfc88107b488e158fc7108c8faf0a195f9b9030c3faf51edac625714584,2022-11-11 13:21:14,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main(){\nint a,b,t,i;\nscanf(\""%d\"",&t);\nint n[t];\nfor(i=0;i<t;i++){\n    scanf(\""%d\"",&n[i]);\n}\nfor(i=0;i<t;i++){\n    printf(\""6\"");\n    if(i!=t-1) printf(\""\\n\"");\n}\n}\n",WRONG_ANSWER,9,452
1590937707751215104,e00ee38c44b3d45b1b15c51030bc5b68071f01213b1bbd9af859b26cc32471ac,2022-11-11 13:21:22,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n main()\n{\nint a=6,n,c,d;\n    d=pow(a,n);\n\tc=d%10;\n\tprintf(\""%d\"",c);\n\t\n\treturn 0;\n}\n ",WRONG_ANSWER,4,572
1590937761262141440,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 13:21:35,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"a=int(input())\ndata1=list(map(int,input().split()))\n\ndata2=list(map(int,input().split()))\ndata1.sort()\ndata2.sort(reverse=True)\nsum1=sum(data1[:int(a/2)])\nsum2=sum(data2[:int(a/2)])\ndates=sum2-sum1\nprint(dates)\n",WRONG_ANSWER,18,2744
1590937788437037056,547094c7c62f34b25dac6d7d79e017d817767a29a120ff5083d5fe0c21b62800,2022-11-11 13:21:41,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int year;\n    scanf(\""%d\"",&year)\n    printf(\""%d\"",year);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590937814680801280,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-11 13:21:47,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String args[]) {\n        int a;\n        int b = 0;\n        int flag = 0;\n        Scanner scanner = new Scanner(System.in);\n        a = scanner.nextInt();\n        for (int i = 2; i <= a; i++) {\n            for (int j = 2; j < i; j++) {\n                if (i % j == 0)\n                    flag = 1;\n            }\n            if (flag == 0) {\n                b++;\n            }\n            flag = 0;\n        }\n        System.out.println(b);\n\n    }\n}\n,TIME_LIMIT_EXCEEDED,1000,16816
1590937846595235840,05fd79145678de5c06012db9db4333bebf8365a74fe442d12a54a9da3782fdca,2022-11-11 13:21:55,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        int n,flag;\n        Scanner in = new Scanner(System.in);\n        n = in.nextInt();\n        for(int i = 0;i<n;i++){\n            flag = in.nextInt();\n            if(flag>0) System.out.println(6);\n            else System.out.println(1);\n        }\n    }\n}",NON_ZERO_EXIT_CODE,241,16236
1590937892812292096,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 13:22:06,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint mynum1(int N)\n{\n    int i,c;\n\n    c=1;\n    if(N!=0){\n        for (i=1;i<=N;i++)\n    {\n        c=c*6;\n    }\n    c=c%10;}\n    return c;\n}\n\nint main()\n{\n    int t,N,i;\n\n    scanf(\""%d\"", &t);\n    for (i=1; i<=t; i++)\n    {\n        scanf(\""%d\"", &N);\n        printf(\""%d\\n\"", mynum1(N));\n    }\n\n}",TIME_LIMIT_EXCEEDED,22,320
1590937928753287168,e51465ce72346fac918042a342986433269a159492161f223a180a6e05d9a01a,2022-11-11 13:22:15,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tint a=0;\n\t\tint num=6;\n\t\tint res=0;\n        while (in.hasNextInt()) {\n            a = in.nextInt();\n            num =(int) Math.pow(num, a);\n            res=num%10;\n            System.out.println(res);\n        } \n\t}\n}",WRONG_ANSWER,122,18520
1590937952690180096,15ac7d06a472ca25d78349f7cc3a73d23c7d7a4f0c4ae3cec6200fcdb8135965,2022-11-11 13:22:20,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,s,m;\n    scanf(\""%d\"",&n);\n\n        for(m=2;m<n;m++){\n            if(n%m!=0){\n                s++;\n        }\n\n\n        }\n\n\n\n       printf(\""%d\"",s);\n    return 0;\n}\n",WRONG_ANSWER,3,184
1590937986995388416,e00ee38c44b3d45b1b15c51030bc5b68071f01213b1bbd9af859b26cc32471ac,2022-11-11 13:22:28,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n main()\n{\nint a,n,c,d;\n    d=pow(a,n);\n\tc=d%10;\n\tprintf(\""%d\"",c);\n\t\n\treturn 0;\n}\n ",WRONG_ANSWER,3,308
1590938018108735488,919e6449799ef04f53dc21ab8608e866aab38f956abcadede4200c4c63859f1b,2022-11-11 13:22:36,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    int a;\n    for(int i=1;i<=n;i++)\n    {\n        ptinf(\""6\"");\n    }\n}\n\n",COMPILE_ERROR,0,0
1590938035020148736,0aa773cdb5cb621d4131c7d2b98b0724b7e9e93f4310c787c0a9a219d05e0ff2,2022-11-11 13:22:40,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n\nint main()\n{int i,j,n,flag;\nint s=0;\nscanf(\""%d\"",&n);\nfor(i=2;i<=n;i++)\n{\n    flag=1;\n    for(j=2;j*j<=i;j++)\n    {\n        if(i%j==0){\n            flag=0;\n            break;\n        }\n    }\n}\nif(flag) {\n    s++;\n\n}\nprintf(\""%d\"",s);\nreturn 0;\n }",WRONG_ANSWER,9,312
1590938049456967680,7c6d208c4c4b695bc8d6f8ae0c0357c2466f5c9f86ec0652674812219ac09d38,2022-11-11 13:22:43,Java,300.0,1590734963702620160,1590734503495200768,1049226928954454016,import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args)  {\n        Scanner sc = new Scanner(System.in);\n       int a = sc.nextInt();\n       int[] arr = new int[a];\n       int[] brr = new int[a];\n       int[] crr = new int[a];\n        for (int i = 0; i < a; i++) {\n            int b = sc.nextInt();\n            brr[i]  = b;\n        }\n        for (int i = 0; i < a; i++) {\n            int c  = sc.nextInt();\n            crr[i] = c;\n        }\n        for (int i = 0; i < a; i++) {\n            arr[i] = crr[i]-brr[i];\n        }\n        int max = arr[0];\n        int b = 0;\n        for (int i = 0; i < arr.length; i++) {\n          b = b + arr[i];\n          if (b < 0 ){\n              b = 0;\n          }\n          if (b>max){\n              max = b;\n          }\n        }\n        System.out.println(max);\n    }\n\n}\n,ACCEPTED,129,16520
1590938051856084992,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 13:22:44,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n#define warn_unused_result\n\n\nint main()\n{\n    int t = 0;\n    scanf(\""%d\"",&t);\n    \n    while(t--)\n    {\n        int n = 0;\n        scanf(\""%d\"",&n);\n        int sum = (int)pow(6,n);\n        int num = sum % 10;\n        printf(\""%d\\n\"",num);\n    }\n    return 0;\n}\n",WRONG_ANSWER,7,696
1590938057233203200,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-11 13:22:45,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String args[]) {\n        int a;\n        int b = 0;\n        int flag = 0;\n        Scanner scanner = new Scanner(System.in);\n        a = scanner.nextInt();\n        for (int i = 2; i <= a; i++) {\n            for (int j = 2; j < i; j++) {\n                if (i % j == 0)\n                    flag = 1;\n            }\n            if (flag == 0) {\n                b++;\n            }\n            flag = 0;\n        }\n        System.out.println(b);\n\n    }\n}\n,TIME_LIMIT_EXCEEDED,1000,16876
1590938059934314496,547094c7c62f34b25dac6d7d79e017d817767a29a120ff5083d5fe0c21b62800,2022-11-11 13:22:46,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(2022);\n    return 0;\n}\n,SEGMENTATION_FAULT,3,444
1590938063809851392,919e6449799ef04f53dc21ab8608e866aab38f956abcadede4200c4c63859f1b,2022-11-11 13:22:47,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    int a;\n    for(int i=1;i<=n;i++)\n    {\n        ptinf(\""%d\"",6);\n    }\n}\n\n",COMPILE_ERROR,0,0
1590938070105526272,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-11 13:22:48,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int n,i,j,k,a;\n    scanf(\""%d\"",&n);\n    for(i=1;i<n;i++)\n    {\n        a=sqrt(i);\n        for(j=2;j<=a;j++)\n        {if(i%j==0)\n                break;\n        }\n        if(j>a)\n            k++;\n    }\n    printf(\""%d\"",k);\n    return 0;\n}",WRONG_ANSWER,10,316
1590938073691656192,ccc42b8437aa15d1214e4623799ed35cd8ea8087c26cb1b596d51ae4556ea39c,2022-11-11 13:22:49,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=eval(input())\nb=map(int,input().split())\nc=set(b)\nfor i in c:\n    d=6**i\n    d=str(d)\n    print(d[-1])",TIME_LIMIT_EXCEEDED,165,4004
1590938092121423872,6cbd81921f92855c6b8318725b09ef7ec48ff579276b3df9f7ea04bea9804678,2022-11-11 13:22:54,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n   int t,n,b;\n    scanf(\""%d\"",&t);\n    while(t--){\n        scanf(\""%d\"",&n);\n        b=pow(6,n);\n        printf(\"" %d\"",b%10);\n    }\n    return 0;\n}\n",WRONG_ANSWER,7,564
1590938097838260224,0ccbaaa612b3d01dbe621ce5e7366d6e26d2e5adf55047d92c6eb7adf78a979d,2022-11-11 13:22:55,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int n;cin>>n;\n    int a[n],b[n],c[n];\n    for(int i=0;i<n;i++) cin>>a[i];\n    for(int i=0;i<n;i++) cin>>b[i],c[i]=a[i]-b[i];\n    int sum=0;\n\tfor(int i=0;i<n;i++){\n\t\tint thisSum=0;\n\t\tfor(int j=i;j<n;j++){\n\t\t\tthisSum+=c[j];\n\t\t\tif(thisSum >= sum){\n\t\t\t\tsum = thisSum;\n\t\t\t}\n\t\t}\t\n\t}\n    cout<<sum;\n    return 0;\n}",WRONG_ANSWER,4,440
1590938126267256832,919e6449799ef04f53dc21ab8608e866aab38f956abcadede4200c4c63859f1b,2022-11-11 13:23:02,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    int a=6;\n    for(int i=1;i<=n;i++)\n    {\n        ptinf(\""%d\"",a);\n    }\n}\n\n",COMPILE_ERROR,0,0
1590938129954025472,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-11 13:23:03,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n\nsushu(int i);\n\nint main()\n\n{\n\n    int n,i,count=0;\n\n    scanf(\""%d\"",&n);\n\n    for(i=2;i<=n;i++)\n\n    if(sushu(i))\n\n    count++;\n\n    printf(\""%d\"",count);\n\n    return 0;\n\n}\n\nsushu(i)\n\n{\n\nint j,k;\n\nfor(j=2;j<=i;j++)\n\nfor(k=2;k<=i;k++)\n\n{if(i==j*k)\n\nreturn 0;\n\n}\n\nreturn 1;\n\n}",TIME_LIMIT_EXCEEDED,1000,276
1590938162849976320,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 13:23:10,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"int x,y,z;\nprint(X+Y_Z)",NON_ZERO_EXIT_CODE,17,2740
1590938170114486272,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 13:23:12,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n#define warn_unused_result 1\n\nint main()\n{\n    int t = 0;\n    scanf(\""%d\"",&t);\n    \n    while(t--)\n    {\n        int n = 0;\n        scanf(\""%d\"",&n);\n        int sum = (int)pow(6,n);\n        int num = sum % 10;\n        printf(\""%d\\n\"",num);\n    }\n    return 0;\n}\n",WRONG_ANSWER,6,440
1590938199013265408,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 13:23:19,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"int x,y,z;\nprint(X+Y-Z)",NON_ZERO_EXIT_CODE,15,2880
1590938205841592320,fec6d07e317796c63fb7ae6e7538f75973ad64af6e6196cc27eed3e9e685bf86,2022-11-11 13:23:21,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int b,i,j;\n    scanf(\""%d\"",&b);\n    int a[100],c[100];\n    int max=0,sum=0,thissum=0;\n    for(i=0;i<b;i++)\n        scanf(\""%d\"",&a[i]);\n    for( i=0;i<b;i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=0;i<b;i++)\n    {\n    for(j=i;j<b+i;j++)\n    {\n        if(j>=b)\n            thissum=thissum-a[j-b]+c[j-b];\n        else\n            thissum=thissum-a[j]+c[j];\n        if(thissum>max)\n            max=thissum;\n    }\n    if(thissum>sum)\n        sum=thissum;\n    }\n    printf(\""%d\\n\"",max);\n}",WRONG_ANSWER,3,320
1590938213861097472,e51465ce72346fac918042a342986433269a159492161f223a180a6e05d9a01a,2022-11-11 13:23:23,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tint a=0;\n\t\tint num=6;\n\t\tint res=0;\n        while (in.hasNextInt()) {\n        \tnum=6;\n            a = in.nextInt();\n            num =(int) Math.pow(num, a);\n            res=num%10;\n            System.out.println(res);\n        } \n\t}\n}",WRONG_ANSWER,122,16536
1590938225022144512,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-11 13:23:25,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int n,i,j,k,a;\n    scanf(\""%d\"",&n);\n    for(i=1;i<n;i++)\n    {\n        a=sqrt(i);\n        for(j=2;j<=a;j++)\n        {if(i%j==0)\n                break;\n          if(j>a)\n            k++;\n        }\n       \n    }\n    printf(\""%d\"",k);\n    return 0;\n}",WRONG_ANSWER,3,324
1590938238607491072,547094c7c62f34b25dac6d7d79e017d817767a29a120ff5083d5fe0c21b62800,2022-11-11 13:23:28,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}\n",ACCEPTED,3,316
1590938269158801408,acfcf65f14b5d3b02c3225372654b4e21f04d33a8bbaeb346e4fb1d85f2ea94f,2022-11-11 13:23:36,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""%4d\"",2022);\n    return 0;\n}",ACCEPTED,3,316
1590938286107963392,7e6a67f270e740aba8788a12d9a49939621a28d5059d3ced2247a86914b0a3b3,2022-11-11 13:23:40,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main(){\n    int n,k,i,j,tag=1,num=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n    {\n        tag=1;\n        k=(int)sqrt(i);\n        for(j=2;j<=k&&tag;j++)\n            if(i%j==0)  tag=0;\n        if(tag) num++;\n    }\n    printf(\""%d\"",num);\n}\n",ACCEPTED,13,352
1590938289874468864,919e6449799ef04f53dc21ab8608e866aab38f956abcadede4200c4c63859f1b,2022-11-11 13:23:41,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    int a=6;\n    int b;\n     for(int i=1;i<=n;i++)\n    {\n       scanf(\""%d\"",&b);\n    }\n    for(int i=1;i<=n;i++)\n    {\n        ptinf(\""%d\"",&a);\n    }\n}\n\n",COMPILE_ERROR,0,0
1590938295968792576,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 13:23:42,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n#define warn_unused_result 1\n\nint main()\n{\n    int t = 0;\n    scanf(\""%d\"",&t);\n    \n    while(t--)\n    {\n        int n = 0;\n        scanf(\""%d \"",&n);\n        int sum = (int)pow(6,n);\n        int num = sum % 10;\n        printf(\""%d\\n\"",num);\n    }\n    return 0;\n}\n",WRONG_ANSWER,5,200
1590938345016987648,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 13:23:54,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n#define warn_unused_result 1\n\nint main()\n{\n    int t = 0;\n    scanf(\""%d \"",&t);\n    \n    while(t--)\n    {\n        int n = 0;\n        scanf(\""%d \"",&n);\n        int sum = (int)pow(6,n);\n        int num = sum % 10;\n        printf(\""%d\\n\"",num);\n    }\n    return 0;\n}\n",WRONG_ANSWER,8,312
1590938429146333184,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-11 13:24:14,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,m=0,f=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<n;i++)\n    {if(n%i==0)\n            m=1;}\n    if(m==0) f++;\n    printf(\""%d\"",f);        \n    return 0;\n}",WRONG_ANSWER,3,324
1590938513766395904,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 13:24:34,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"int x,y,z;\nprint('X+Y-Z')",NON_ZERO_EXIT_CODE,16,2876
1590938597434372096,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 13:24:54,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n    int t = 0;\n    scanf(\""%d \"",&t);\n    int sum = 0;\n    int num = 0;\n    \n    while(t--)\n    {\n        int n = 0;\n        scanf(\""%d \"",&n);\n        sum = (int)pow(6,n);\n        num = sum % 10;\n        printf(\""%d\\n\"",num);\n    }\n    return 0;\n}\n",WRONG_ANSWER,6,312
1590938609040035840,86f702b052a21d7cb2f8cd933c678c21efaafaf5b2d35032f18ec35c1e26a945,2022-11-11 13:24:57,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int X,Y,Z;\n    int sum;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    sum=X+Y-Z;\n    printf(\""%d\"",sum);\n    return 0;\n}",ACCEPTED,6,476
1590938609916645376,af559dccfa68c49b94a61e83fc9942ea0513a50e66ecf36dc005df0e7960903e,2022-11-11 13:24:57,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\npublic class Main{\npublic static void main(String args[]){\n    Scanner sc =new Scanner(System.in);\n    int n=sc.nextInt();\n    for(int i=0;i<n;i++){\n        int z=1;\n        int x=sc.nextInt();\n        for(int j=1;j<=x;j++){\n            z=z*6;\n        }\n        System.out.println(z%10);\n    }\n    \n    \n}\n    }\n,WRONG_ANSWER,246,16472
1590938647719907328,919e6449799ef04f53dc21ab8608e866aab38f956abcadede4200c4c63859f1b,2022-11-11 13:25:06,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    int a=6;\n    int b;\n     for(int i=1;i<=n;i++)\n    {\n       scanf(\""%d\"",&b);\n    }\n    \n    for(int i=1;i<=n;i++)\n    {\n        printf(\""%d\\n\"",a);\n    }\n    \n    return 0;\n}\n\n",WRONG_ANSWER,9,364
1590938658830618624,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-11 13:25:09,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nsushu(int i);\nint main()\n{\n    int n,i,count=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n    if(sushu(i))\n    count++;\n    printf(\""%d\\n\"",count);\n    return 0;\n}\nsushu(i)\n{\nint j,k;\nfor(j=2;j<=i;j++)\nfor(k=2;k<=i;k++)\nif(i==j*k)\nreturn 0;\nreturn 1;\n}",TIME_LIMIT_EXCEEDED,1000,444
1590938673774923776,262cde49cc56abe96630625fe60c7207e4f635bd56c839389b503b1f360d8ab2,2022-11-11 13:25:12,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a=2022;\n    printf(\""%d\"",a);\n    return 0;\n}",ACCEPTED,3,312
1590938685061795840,05fd79145678de5c06012db9db4333bebf8365a74fe442d12a54a9da3782fdca,2022-11-11 13:25:15,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        int n,flag,i;\n        Scanner in = new Scanner(System.in);\n        n = in.nextInt();\n        for(i = 0;i<n;i++){\n            flag = in.nextInt();\n            if(flag>0) System.out.println(6);\n            else System.out.println(1);\n        }\n    }\n}",WRONG_ANSWER,237,17032
1590938739210235904,225b1524edf804414c466257a4f19789fe127117b27e663dc835d742fed77f9e,2022-11-11 13:25:28,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""2022\\n\"");\n    return 0;\n}\n",ACCEPTED,3,312
1590938764237672448,0aa773cdb5cb621d4131c7d2b98b0724b7e9e93f4310c787c0a9a219d05e0ff2,2022-11-11 13:25:34,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\nint i,j,n,flag;\nint s=0;\nscanf(\""%d\"",&n);\nfor(i=2;i<=n;i++)\n{\n    flag=1;\n    for(j=2;j*j<=i;j++)\n    {\n        if(i%j==0)\n        {\n            flag=0;\n            break;\n        }\n    }\n}\nif(flag) \n    s++;\n\n}\nprintf(\""%d\"",s);\nreturn 0;\n }",COMPILE_ERROR,0,0
1590938792251424768,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 13:25:40,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n    int t = 0;\n    scanf(\""%d \"",&t);\n    int sum = 0;\n    int num = 0;\n    \n    while(t--)\n    {\n        int n = 0;\n        scanf(\""%d \"",&n);\n        sum = (int)pow(6.0,n);\n        num = sum % 10;\n        printf(\""%d\\n\"",num);\n    }\n    return 0;\n}\n",WRONG_ANSWER,7,440
1590938826292396032,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-11 13:25:49,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n    int t,i;\n    int j,k;\n    int a[10000];\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<t;i++){\n        if(i<t-1&&a[i]==0) printf(\""1\\n\"");\n        else if(i<t-1&&a[i]>0)printf(\""6\\n\"");\n        else if(i==t-1&&a[i]==0) printf(\""1\"");\n        else if(i==t-1&&a[i]>0) printf(\""6\"");\n    }\n}",WRONG_ANSWER,5,312
1590938864875802624,8f29029dc8006da83949d2656cc7dc83026d851252066fd4a9fc89071673ec96,2022-11-11 13:25:58,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#define _CRT_SECURE_NO_WARNINGS 1\nint isprime(int n)\n{\n    int i;\n    for (i = 2; i * i <= n; i++)\n        if (n % i == 0)return 0;\n    return n > 1;\n}\nint main()\n{\n    int n, i, k = 0;\n    scanf(\""%d\"", &n);\n    for (i = 2; i <= n; i++)\n        if (isprime(i))\n            k++;\n    printf(\""%d\"", k);\n    return 0;\n}",ACCEPTED,12,352
1590938891455102976,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-11 13:26:04,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,m=0,f=0,k;\n    scanf(\""%d\"",&n);\n    for(k=2;k<n,k++)\n    for(i=2;i<k;i++)\n    {if(k%i==0)\n            m=1;}\n    if(m==0) f++;\n    printf(\""%d\"",f);        \n    return 0;\n}",COMPILE_ERROR,0,0
1590938898816110592,547094c7c62f34b25dac6d7d79e017d817767a29a120ff5083d5fe0c21b62800,2022-11-11 13:26:06,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b,c,i;\n    scanf(\""%d\"",&a);\n    scanf(\""%d\"",&b);\n    scanf(\""%d\"",&c);\n    printf(\""%d\"",a+b-c);\n    return 0;\n}\n",ACCEPTED,6,312
1590938930164334592,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-11 13:26:13,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,m=0,f=0,k;\n    scanf(\""%d\"",&n);\n    for(k=2;k<n;k++)\n    for(i=2;i<k;i++)\n    {if(k%i==0)\n            m=1;}\n    if(m==0) f++;\n    printf(\""%d\"",f);        \n    return 0;\n}",TIME_LIMIT_EXCEEDED,1000,324
1590938935633686528,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 13:26:15,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int a,i,j,sum=0;\n    scanf(\""%d\"",&a);\n    for(i=2;i<=a;i++)\n    {\n        for(j=2;j<=i;j++)\n        {\n            if(i%j==0) break;\n        }\n        if(i=j) sum++;\n    }\n    printf(\""%d\\n\"",sum);\n}",TIME_LIMIT_EXCEEDED,1000,272
1590938962439507968,617f184ce583e9f7a346564ab5659fda0ca35a3a714a0c929cb07f915f4f514b,2022-11-11 13:26:21,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    if(X,Y,Z>=0&&X,Y,Z<=100)\n    {\n         printf(\""X+Y-Z=%d\"",X+Y-Z);\n    }\n    return 0;\n}\n",WRONG_ANSWER,2,184
1590938975802535936,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 13:26:24,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n    int t = 0;\n    scanf(\""%d \"",&t);\n    long long sum = 0;\n    int num = 0;\n    \n    while(t--)\n    {\n        int n = 0;\n        scanf(\""%d \"",&n);\n        sum = (int)pow(6.0,n);\n        num = sum % 10;\n        printf(\""%d\\n\"",num);\n    }\n    return 0;\n}\n",WRONG_ANSWER,6,324
1590939031205117952,6a835d762a87e93baf4142897168374dc31e9da90b86c19ed82f21159b644272,2022-11-11 13:26:37,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    printf(\""2022\"");\n}",ACCEPTED,3,312
1590939033193218048,af559dccfa68c49b94a61e83fc9942ea0513a50e66ecf36dc005df0e7960903e,2022-11-11 13:26:38,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\npublic class Main{\npublic static void main(String args[]){\n    Scanner sc =new Scanner(System.in);\n    int n=sc.nextInt();\n    for(int i=0;i<n;i++){\n        int z=1;\n        int x=sc.nextInt();\n        for(int j=1;j<=x;j++){\n            z=z*6;\n        }\n        System.out.print(z%10);\n        if(i!=2)System.out.println();\n    }\n    \n    \n}\n    }\n,NON_ZERO_EXIT_CODE,235,19128
1590939075123654656,13663feca3541eb054c32486ac91d32c40c83bbc2e5c1263614fa6c45f1f6d13,2022-11-11 13:26:48,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main(){\n  int X,Y,Z;\n  scanf(\""%d%d%d\"",&X,&Y,&Z);\n  int a,b;\n  a=X+Y;\n  b=a-Z;\n  printf(\""%d\"",b);\n  return 0;\n}",ACCEPTED,4,196
1590939088847437824,0aa773cdb5cb621d4131c7d2b98b0724b7e9e93f4310c787c0a9a219d05e0ff2,2022-11-11 13:26:51,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\nint i,j,n,flag;\nint s=0;\nscanf(\""%d\"",&n);\nfor(i=2;i<=n;i++)\n{\n    flag=1;\n    for(j=2;j*j<=i;j++)\n    {\n        if(i%j==0)\n        {\n            flag=0;\n            break;\n        }\n    }\nif(flag) \n    s++;\n\n}\nprintf(\""%d\"",s);\nreturn 0;\n }",ACCEPTED,13,320
1590939132128460800,617f184ce583e9f7a346564ab5659fda0ca35a3a714a0c929cb07f915f4f514b,2022-11-11 13:27:01,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    if(X,Y,Z>=0&&X,Y,Z<=100)\n    {\n         printf(\""%d\"",X+Y-Z);\n    }\n    return 0;\n}",ACCEPTED,4,320
1590939200436895744,4812f9582f90b7f3f95178a62ec39f3555e90b935658da3e31a47fe0d2e8c6fd,2022-11-11 13:27:18,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    printf(\""%d\\n\"",X+Y+Z);\n    return 0;\n}\n",WRONG_ANSWER,3,348
1590939209555292160,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 13:27:20,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n#define warn_unused_result 1\n\nint main()\n{\n    int t = 0;\n    scanf(\""%d \"",&t);\n    long long sum = 0;\n    int num = 0;\n    \n    while(t--)\n    {\n        int n = 0;\n        scanf(\""%d \"",&n);\n        sum = (int)pow(6.0,n);\n        num = sum % 10;\n        printf(\""%d\\n\"",num);\n    }\n    return 0;\n}\n",WRONG_ANSWER,6,312
1590939216840822784,05f9d62a2660f27e0711448c225e5e0fe6347745a2c93edb6296c0a2ffbc6605,2022-11-11 13:27:22,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int n,i,sum=0;\n    int a[100],b[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n        if(b[i]-a[i]>0)\n            sum=sum+(b[i]-a[i]);\n    printf(\""%d\"",sum);\n}",WRONG_ANSWER,3,192
1590939233311850496,29d1ea54d6e4e56fc2de0be5ae10ecc4c70c7fca667934b17857e95530f5663a,2022-11-11 13:27:26,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include<string.h>\nint main ()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    return 0;\n}",WRONG_ANSWER,3,308
1590939238194020352,129ddfe9d2d4553f365faf2fdc5e2f0c271b2e342a4cff13802dda8ef8b3d1c2,2022-11-11 13:27:27,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a, b;\n    scanf(\""%d\"",&a);\n    for(int i = 0; i < a; i++ ){\n        scanf(\""%d\"",&b);\n        if(i==a-1){\n            if(b==0){\n            printf(\""1\"");\n        }else{\n            printf(\""6\"");\n        }\n        }else{\n        if(b==0){\n            printf(\""1\\n\"");\n        }else{\n            printf(\""6\\n\"");\n        }\n        }\n    }\n    return 0;\n}\n",ACCEPTED,6,192
1590939259723362304,e715137eeb4190ade2330123b989bbdd6eebd9a5e1df2e292271d3bfe3a79c69,2022-11-11 13:27:32,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n\n   int a[900],b[900],c[900],d[900];\nint main()\n{\n    int i,j,k,n,z,x;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(j=0;j<n;j++)\n    {\n        c[j]=b[j]-a[j];\n    for(i=j+1;i<n;i++)\n    {\n        c[i]=c[i-1]+b[i]-a[i];\n    }\n         z=c[j];\n    for(k=j+1;k<n;k++)\n    {\n        if(z<c[k])\n            z=c[k];\n    }\n        d[j]=z;\n    }\n    for(k=0;k<n;k++)\n    {\n        if(z<d[k])\n            z=d[k];\n    }\n    printf(\""%d\\n\"",z);\n    return 0;\n}",ACCEPTED,3,324
1590939290681544704,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 13:27:39,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n#define -Wunused-result 1\n\nint main()\n{\n    int t = 0;\n    scanf(\""%d \"",&t);\n    long long sum = 0;\n    int num = 0;\n    \n    while(t--)\n    {\n        int n = 0;\n        scanf(\""%d \"",&n);\n        sum = (int)pow(6.0,n);\n        num = sum % 10;\n        printf(\""%d\\n\"",num);\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590939294502551552,4812f9582f90b7f3f95178a62ec39f3555e90b935658da3e31a47fe0d2e8c6fd,2022-11-11 13:27:40,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    printf(\""%d\\n\"",X+Y-Z);\n    return 0;\n}\n",ACCEPTED,7,308
1590939322407256064,39afbda4ab6a7df2673bc0d0eec048a42b23ada2774ec941935a2b2fa044515a,2022-11-11 13:27:47,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <bits/stdc++.h>\nusing namespace std;\nint main(){\nint n,x,i;\ncin>>n;\nfor(i=0;i<n;i++){\n    cin>>x;\n    if(x<1)printf(\""1\"");\n    else printf(\""6\\n\"");\n}\n}\n",ACCEPTED,12,636
1590939330586148864,af559dccfa68c49b94a61e83fc9942ea0513a50e66ecf36dc005df0e7960903e,2022-11-11 13:27:49,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\npublic class Main{\npublic static void main(String args[]){\n    Scanner sc =new Scanner(System.in);\n    int n=sc.nextInt();\n    for(int i=0;i<n;i++){\n        int z=1;\n        int x=sc.nextInt();\n        for(int j=1;j<=x;j++){\n            z=z*6;\n        }\n        System.out.print(z%10);\n        if(i!=2)System.out.println();\n    }\n}\n    }\n,NON_ZERO_EXIT_CODE,245,16928
1590939341327761408,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 13:27:51,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"int main()\n{\n    int t,N,i;\n    scanf(\""%d\"", &t);\n    for (i=1; i<=t; i++)\n    {\n        scanf(\""%d\"", &N);\n        if(N==0){\n        printf(\""1\\n\"");}\n        else{\n            printf(\""6\\n\"");\n        }\n    }\n}",ACCEPTED,6,356
1590939351226318848,9819f13d6a58d50fa249ad037641119dadb52afb3f125db258771564f27d2ca5,2022-11-11 13:27:54,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n\tint x,m=0,n,i,k;\n\tscanf(\""%d\"", &n);\n    for(x=1;x<n;x++){\n        k=(int)sqrt(x);\n        for(i=2;i<=k;i++){\n           if(x%i==0){      \n               break;\n            }\n        }\n        if(i>k){\n            m++;\n        }\n\t}\n    printf(\""%d\\n\"",m-1);\n\treturn 0;\n    }\n   \n",ACCEPTED,13,312
1590939356330790912,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 13:27:55,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\n\nint main()\n{\n    int t = 0;\n    scanf(\""%d \"",&t);\n    long long sum = 0;\n    int num = 0;\n    \n    while(t--)\n    {\n        int n = 0;\n        scanf(\""%d \"",&n);\n        sum = (int)pow(6.0,n);\n        num = sum % 10;\n        printf(\""%d\\n\"",num);\n    }\n    return 0;\n}\n",WRONG_ANSWER,6,312
1590939362274115584,29d1ea54d6e4e56fc2de0be5ae10ecc4c70c7fca667934b17857e95530f5663a,2022-11-11 13:27:56,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include<string.h>\nint main ()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    printf(\""%d\"",n);\n    return 0;\n}",WRONG_ANSWER,3,196
1590939366116102144,c9a8fe962a36cf99ca362f66348b02453584251c62fe2356e11d2a6efd5cee45,2022-11-11 13:27:57,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nvoid main()\n{\n   int i,a,n,s;\n   int sum;\n   scanf(\""%d\"",&n);\n   for(i=0;i<=n;i++)\n   {\n       scanf(\""%d\"",&a);\n       sum=pow(6,a);\n       s=sum%10;\n       printf(\""%d\\n\"",s);\n   }\nreturn 0;\n}\n",WRONG_ANSWER,3,308
1590939391349035008,8cf8229a23351e1ca2a7bfc1ad0af3ab2ad4a709a7c796637dbdea7befc2b0ec,2022-11-11 13:28:03,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    printf(\""%d\"",2022);\n    return 0;\n}\n",ACCEPTED,2,200
1590939461637181440,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-11 13:28:20,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int t,i;\n    int j,k;\n    int a[100];\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<t;i++){\n        if(i<t-1&&a[i]==0) printf(\""1\\n\"");\n        else if(i<t-1&&a[i]>0)printf(\""6\\n\"");\n        else if(i==t-1&&a[i]==0) printf(\""1\"");\n        else if(i==t-1&&a[i]>0) printf(\""6\"");\n    }\n}",WRONG_ANSWER,6,356
1590939474907955200,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-11 13:28:23,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\n#include<math.h>\nusing namespace std;\nint main(int argc, char* argv[])\n{\n\tint n, m;\n\tcin >> n;\n\tm = pow(6, n);\n\twhile (m/10){\n\t\tm /= 10;\n\t}\n\tm %= 10;\n\tcout << m;\n\treturn 0;\n}",WRONG_ANSWER,4,320
1590939475671298048,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-11 13:28:23,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nsushu(int i);\nint main()\n{\n    int n,i,count=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n    if(sushu(i))\n    count++;\n    printf(\""%d\\n\"",count);\n    return 0;\n}\nsushu(i)\n{\nint j,k;\nif(i==2)\nreturn 1;\nelse\nfor(j=2;j<=i;j++)\nfor(k=2;k<=i;k++)\nif(i==j*k)\nreturn 0;\nreturn 1;\n}",TIME_LIMIT_EXCEEDED,1000,284
1590939482713554944,5a1c17b308a3b3595833d34c6bdfb75e9f5dd0d065acfeb7f28ab8102ba7406c,2022-11-11 13:28:25,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main()\n{\n    int n,i;\n    scanf(\""%d\"",&n);\n    int x;\n    int cnt = 0;\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&x);\n        cnt++;\n        printf(\""6\"");\n        if(cnt!=n){\n            printf(\""\\n\"");\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,7,316
1590939521842221056,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-11 13:28:34,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main(){\n    int t,i;\n    int j,k;\n    int a[100];\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<t;i++){\n        if(i<t-1&&a[i]==0) printf(\""1\\n\"");\n        else if(i<t-1&&a[i]>0)printf(\""6\\n\"");\n        else if(i==t-1&&a[i]==0) printf(\""1\"");\n        else if(i==t-1&&a[i]>0) printf(\""6\"");\n    }\n}",WRONG_ANSWER,4,324
1590939530419568640,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-11 13:28:36,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int n,i,j,k,a;\n    scanf(\""%d\"",&n);\n    for(i=1;i<n;i++)\n    {\n        a=sqrt(i);\n        for(j=2;j<=a;j++)\n        if(i%j==0)\n                break;\n       if(j>a)\n            k++;\n    }\n    printf(\""%d\"",k);\n    return 0;\n}",WRONG_ANSWER,10,312
1590939581170647040,9ca3f63f61fa4f349009d69e7059514c3a39dbdd5a1f94342c11f4c33ccdceaa,2022-11-11 13:28:49,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"x = int(input())\ny = input().split(\"" \"")\nz = input().split(\"" \"")\nb = c = 0\nfor j in range(x):\n    b= 0\n    for i in range(j,x):\n        a = int(z[i])-int(y[i])\n        if b + a>b:\n            b = b+a\n        if b+a<b:\n            break\n    if c < b:\n        c = b\nprint(c)\n",WRONG_ANSWER,15,2748
1590939600451842048,af559dccfa68c49b94a61e83fc9942ea0513a50e66ecf36dc005df0e7960903e,2022-11-11 13:28:53,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\npublic class Main{\npublic static void main(String args[]){\n    Scanner sc =new Scanner(System.in);\n    int n=sc.nextInt();\n    for(int i=0;i<n;i++){\n        int z=1;\n        int x=sc.nextInt();\n        for(int j=1;j<=x;j++){\n            z=z*6;\n        }\n        System.out.print(z%10);\n        if(i!=2)System.out.println();\n    }\n    return;\n}\n    }\n,WRONG_ANSWER,256,16596
1590939633096134656,75a6755f083ffc71d77ba6ce593bd24fe8a2ce61edc4710fbde2dce128c47ab4,2022-11-11 13:29:01,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,j,k=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n    {\n        int flag=0;\n        for(j=2;j<=i;j++)\n        {\n         if(i%j!=0)\n         flag++;\n        }\n        if(flag==i-2)\n        k++;\n    }\n    printf(\""%d\"",k);\n\n}\n",TIME_LIMIT_EXCEEDED,1000,336
1590939649210646528,0ccbaaa612b3d01dbe621ce5e7366d6e26d2e5adf55047d92c6eb7adf78a979d,2022-11-11 13:29:05,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int n;cin>>n;\n    int a[n],b[n],c[n];\n    for(int i=0;i<n;i++) cin>>a[i];\n    for(int i=0;i<n;i++) cin>>b[i],c[i]=a[i]-b[i];\n    int sum=0;\n\tfor(int i=0;i<n;i++){\n\t\tint thisSum=0;\n\t\tfor(int j=i;j<n;j++){\n\t\t\tthisSum+=c[j];\n\t\t\tif(thisSum > sum){\n\t\t\t\tsum = thisSum;\n\t\t\t}\n\t\t}\t\n\t}\n    cout<<sum;\n    return 0;\n}",WRONG_ANSWER,4,448
1590939705355603968,c9a8fe962a36cf99ca362f66348b02453584251c62fe2356e11d2a6efd5cee45,2022-11-11 13:29:18,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nvoid main()\n{\n   int i,a,n,s;\n   int sum;\n   scanf(\""%d\"",&n);\n   for(i=0;i<=n;i++)\n   {\n       scanf(\""%d\"",&a);\n       sum=pow(6,a);\n       s=sum%10;\n       printf(\""%d\\n\"",s);\n   }\nreturn 0;\n}\n",WRONG_ANSWER,3,324
1590939719393939456,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-11 13:29:21,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#define t 1000000000\nint main(){\n    int t,i;\n    int j,k;\n    scanf(\""%d\"",&t);\n        int a[t];\n    for(i=0;i<t;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<t;i++){\n        if(i<t-1&&a[i]==0) printf(\""1\\n\"");\n        else if(i<t-1&&a[i]>0)printf(\""6\\n\"");\n        else if(i==t-1&&a[i]==0) printf(\""1\"");\n        else if(i==t-1&&a[i]>0) printf(\""6\"");\n    }\n}",COMPILE_ERROR,0,0
1590939736456343552,6cbd81921f92855c6b8318725b09ef7ec48ff579276b3df9f7ea04bea9804678,2022-11-11 13:29:26,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n   int t,n,b;\n    scanf(\""%d\"",&t);\n    while(t--){\n        scanf(\""%d\"",&n);\n        b=pow(6,n);\n        printf(\""\\n\"");\n        printf(\""%d\"",b%10);\n    }\n    return 0;\n}\n",WRONG_ANSWER,6,312
1590939743850926080,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-11 13:29:27,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main(){\n    int t,i;\n    int j,k;\n    scanf(\""%d\"",&t);\n        int a[t];\n    for(i=0;i<t;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<t;i++){\n        if(i<t-1&&a[i]==0) printf(\""1\\n\"");\n        else if(i<t-1&&a[i]>0)printf(\""6\\n\"");\n        else if(i==t-1&&a[i]==0) printf(\""1\"");\n        else if(i==t-1&&a[i]>0) printf(\""6\"");\n    }\n}",WRONG_ANSWER,6,320
1590939796892069888,630b8bfc88107b488e158fc7108c8faf0a195f9b9030c3faf51edac625714584,2022-11-11 13:29:40,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main(){\nint a,b,t,i,k=0;\nscanf(\""%d\"",&t);\nint n[t],j[t];\nfor(i=0;i<t;i++){\n    scanf(\""%d\"",&n[i]);\n    if(n[i]==0) j[k++]=i;\n}\nk=0;\nfor(i=0;i<t;i++){\n    if(i==j[k]) {printf(\""1\"");k++;}\n    else printf(\""6\"");\n    if(i!=t-1) printf(\""\\n\"");\n}\n}\n",WRONG_ANSWER,3,320
1590939822611562496,dcc1017bcd698bd6a0eee54e4ed848d4c51a3a26608990cdd2137e4c01065a1e,2022-11-11 13:29:46,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"int b=getdate();\nprintf(\""%d\"",b);",COMPILE_ERROR,0,0
1590939885677117440,667c2e97e82c372f60661d46943ff56a17c9350387f4364ebabe70ac2e232862,2022-11-11 13:30:01,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,j;\n    int sum=0;\n    printf(\""输入一个整数n:\\n\"");\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n    {\n        for(j=2;j<i;j++)\n        {\n            if(i%j==0)\n                break;\n        }\n        if(j>=i)\n        {\n            sum++;\n\n        }\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,980,320
1590939981961560064,aa65cdf25cbe32699d085a61c4f3ec5a4020e6a3dc1e0e9d6e2a48c9288f8026,2022-11-11 13:30:24,Java,300.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int n = scanner.nextInt();\n        int num=0;\n        int j;\n        boolean sgin;\n        for (int i = 2; i <= n; i++) {\n\n            if(i % 2 == 0 && i != 2  )\n                continue;\n                sgin = true;\n            for (j = 2; j <= i/2 ; j++) {\n                if (i % j == 0) {\n                    sgin= false;\n                    break;\n                }\n            }\n            if (sgin) {\n                num++;\n            }\n        }\n        System.out.println(num);\n\n\n\n    }\n    }\n,ACCEPTED,890,19168
1590940061019975680,6383c93cbdef4af3eda29400a925819f16ad4afc8368e604ccd580cba7055bdd,2022-11-11 13:30:43,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main()\n{\n    int t;\n    if(scanf(\""%d\"",&t)){\n    for(int k=1;k<=t;k++){\n    int n;\n    if(scanf(\""%d\"",&n)){\n    int x = 6;\n    int j = pow(x,n);\n    int res = j%10;\n    printf(\""%d\"",res);\n    if(k<t){\n        printf(\""\\n\"");\n    }\n    }\n    }\n    }\n    return 0;\n}\n",WRONG_ANSWER,6,320
1590940065449181184,887d1bbe53a4d4a349813887f13126da5e46a853687f4c2c9d7b8ef3d748a9d6,2022-11-11 13:30:44,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,g,t,i;\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++)\n    {\n    scanf(\""%d\"",&n);\n    if(n==0) g=1;\n    else g=6;\n    printf(\""%d\\n\"",g);\n    }\n}\n",ACCEPTED,6,188
1590940077570699264,33066437ddee11f609c900fe8dbd59cb8113e4d8dfd13c1812f199f4f3fdd334,2022-11-11 13:30:47,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n    int n,flag,prime=0,i,j;\n    scanf(\""%d\"",n);\n    for(i=1;i<=n;i++)\n    {\n        flag=0;\n        for(j=2;j*j<=i;j++)\n        {\n            if(i%j==0)\n            {\n                flag=1;\n                break;\n            }\n        }\n        if(flag==0)\n           {\n               prime=prime+1;\n           }\n    }\n    printf(\""%d\"",prime);\n    return 0;\n}",SEGMENTATION_FAULT,3,320
1590940138417467392,6a4a105e99255cc39ebb6a122c9fdf740e574dbb708100363b339265f92e1bbf,2022-11-11 13:31:01,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,3,188
1590940154506817536,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 13:31:05,C++,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"int x,y,z;\nscanf(\""%d,%d,%d\"",&x,&y,&z);\na=x+y-z;\nprintf(\""%d\"",&a)",COMPILE_ERROR,0,0
1590940207497674752,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-11 13:31:18,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nsushu(int i);\nint main()\n{\n    int n,i,count=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n    if(sushu(i))\n    count++;\n    printf(\""%d\\n\"",count);\n    return 0;\n}\nsushu(i)\n{\nint j,k;\nfor(j=2;j<=i;j++)\nfor(k=2;k<=i;k++)\nif(i==j*k)\nreturn 0;\nreturn 1;\n}",TIME_LIMIT_EXCEEDED,1000,376
1590940261864247296,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-11 13:31:31,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nsushu(int i);\nint main()\n{\n    int n,i,count=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n    if(sushu(i))\n    count++;\n    printf(\""%d\\n\"",count);\n    return 0;\n}\nsushu(i)\n{\nint j,k;\nfor(j=2;j<=i;j++)\nfor(k=2;k<=i;k++)\nif(i==j*k)\nreturn 0;\nreturn 1;\n}",TIME_LIMIT_EXCEEDED,1000,316
1590940339077185536,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-11 13:31:49,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n   int n,m,k,i,d;\n    scanf(\""%d\"",&n);\n    for(m=2;m<n;m++)\n    {k=sqrt(m);\n     for(i=2;i<k;i++)\n         if(m%i==0) break;\n     if(i>=k+1)\n         d++;\n    }\n    printf(\""%d\"",d);\n    return 0;\n}",WRONG_ANSWER,9,332
1590940409528913920,919e6449799ef04f53dc21ab8608e866aab38f956abcadede4200c4c63859f1b,2022-11-11 13:32:06,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main()\n{\n    int i,j;\n    int n;\n    scanf(\""%d\"",&n);\n    int sum=0;\n    for(i=2;i<=n;i++)\n    {\n         for(j=2;j<=pow(i,0.5);j++)\n         {\n             if(i%j==0)\n             {\n                 sum++;\n                 break;\n             }\n         }\n    }\n    \n    printf(\""%d\"",n-sum-1);\n}",ACCEPTED,151,328
1590940422048907264,dcc1017bcd698bd6a0eee54e4ed848d4c51a3a26608990cdd2137e4c01065a1e,2022-11-11 13:32:09,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <time.h>\n#include<stdio,h>\n time (&timep);\n    p=gmtime(&timep);\n    printf(\""%d\\n\"",p->tm_sec);",COMPILE_ERROR,0,0
1590940423625969664,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-11 13:32:09,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n   int n,m,k,i,d;\n    scanf(\""%d\"",&n);\n    for(m=2;m<n;m++)\n    {k=sqrt(m);\n     for(i=2;i<k;i++)\n         if(m%i==0) break;\n     if(i>=k+1)\n         d++;\n    }\n    printf(\""%d\"",d);\n    return 0;\n}",WRONG_ANSWER,10,316
1590940463635431424,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 13:32:19,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"a=int(input())\ndata1=list(map(int,input().split()))\ndata2=list(map(int,input().split()))\n\ndatas=[]\nfor i in range(a):\n    datas.append(data2[i]-data1[i])\nprint(datas)\na=0\ndatass=[]\nfor i in range(len(datas)):\n    for x in range(i,len(datas)):\n        datass.append(sum(datas[i:x]))\nprint(max(datass))\n",WRONG_ANSWER,16,2880
1590940541276192768,262cde49cc56abe96630625fe60c7207e4f635bd56c839389b503b1f360d8ab2,2022-11-11 13:32:37,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int x,y,z,a;\n    scanf(\""%d%d%d\"",x,y,z);\n    a=x+y-z;\n    printf(\""%d\"",a);\n    return 0;\n}\n",SEGMENTATION_FAULT,3,308
1590940585115058176,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-11 13:32:48,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int t,i;\n    int j,k;\n    scanf(\""%d\"",&t);\n     int a[t];\n    for(i=0;i<t;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<t;i++){\n        if(i<t-1)\n        {\n            if(a[i]) printf(\""6\\n\"");\n            else printf(\""1\\n\"");\n        }\n        else\n        {\n            if(a[i]) printf(\""6\"");\n            else printf(\""1\"");\n        }\n    }\n}",ACCEPTED,7,328
1590940587073798144,8f29029dc8006da83949d2656cc7dc83026d851252066fd4a9fc89071673ec96,2022-11-11 13:32:48,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint n, i;\n\tscanf(\""%d\"", &n);\n\tif (n == 0)\n\t\tprintf(\""1\"");\n\telse\n\t{\n\t\tfor (i = 0; i < n - 1; i++)\n\t\t{\n\t\t\tprintf(\""6\\n\"");\n\t\t}\n\t\tprintf(\""6\"");\n\t}\n}",WRONG_ANSWER,11,328
1590940637841653760,e715137eeb4190ade2330123b989bbdd6eebd9a5e1df2e292271d3bfe3a79c69,2022-11-11 13:33:00,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    double n,a=1,i;\n    int k=2,j,b,c;\n    scanf(\""%lf\"",&n);\n    for(i=3;i<=n;i++)\n    {\n        a=1;\n        c=i;\n        b=sqrt(i);\n        for(j=b;j<c;j++)\n        {\n            if(c%j==0)\n            {\n\n                a=0;\n            }\n        }\n        if(a)\n            k++;\n    }\n    printf(\""%d\\n\"",k);\n    return 0;\n}",TIME_LIMIT_EXCEEDED,1000,424
1590940654673395712,262cde49cc56abe96630625fe60c7207e4f635bd56c839389b503b1f360d8ab2,2022-11-11 13:33:04,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int x,y,z,a;\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    a=x+y-z;\n    printf(\""%d\"",a);\n    return 0;\n}\n",ACCEPTED,5,344
1590940665217875968,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 13:33:07,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\n\n/*int main()\n{\n    int t = 0;\n    scanf(\""%d \"",&t);\n    long long sum = 0;\n    int num = 0;\n    \n    while(t--)\n    {\n        int n = 0;\n        scanf(\""%d \"",&n);\n        sum = (int)pow(6.0,n);\n        num = sum % 10;\n        printf(\""%d\\n\"",num);\n    }\n    return 0;\n}\n*/\n\n\nint main(){\n    int t;\n    scanf(\""%d\"",&t);\n    while(t--){\n        int n = 0;\n        while(scanf(\""%d \"",&n) != EOF){\n            printf(\""6\\n\"");\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,8,484
1590940721786433536,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 13:33:20,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\n\n/*int main()\n{\n    int t = 0;\n    scanf(\""%d \"",&t);\n    long long sum = 0;\n    int num = 0;\n    \n    while(t--)\n    {\n        int n = 0;\n        scanf(\""%d \"",&n);\n        sum = (int)pow(6.0,n);\n        num = sum % 10;\n        printf(\""%d\\n\"",num);\n    }\n    return 0;\n}\n*/\n\n\nint main(){\n    int t;\n    scanf(\""%d\"",&t);\n    while(t--){\n        int n = 0;\n        while(scanf(\""%d \"",&n) != EOF){\n            printf(\""6\\n\"");\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,7,200
1590940777604231168,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-11 13:33:34,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int n,i,j,k=0,a;\n    scanf(\""%d\"",&n);\n    for(i=1;i<n;i++)\n    {\n        a=sqrt(i);\n        for(j=2;j<=a;j++)\n        if(i%j==0)\n                break;\n       if(j>a)\n            k++;\n    }\n    printf(\""%d\"",k);\n    return 0;\n}",WRONG_ANSWER,9,328
1590940800366718976,0cfbb4a339ebbc4dce13b5f3e3f98a3def0ab17ef5b4ac8e6d566de92e1f5f78,2022-11-11 13:33:39,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n;\n    scanf(\""%d\"", &n);\n    int a[n];\n    for(int i=0;i<n;i++){\n        scanf(\""%d\"", &a[i]);\n    }\n    for(int i=0;i<n;i++){\n        if(i<n-1){\n            printf(\""6\\n\"");\n        }\n        else\n            printf(\""6\"");\n    }\n    return 0;\n}",WRONG_ANSWER,7,196
1590940810512764928,44042a4519c9231aa21c54eb113b7a08f98bcd7db4839a20a61ab6ce51fce357,2022-11-11 13:33:42,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,3,192
1590940857107283968,902d8082eea06043d392298983db4630cde4418ac8ee42282d537bfaae045c2f,2022-11-11 13:33:53,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"b=0\na=eval(input())\nfor i in range(1,a+1):\n    for j in range(2,int(i ** 0.5) +1):\n        if i % j == 0:\n            b+=1\n            break\nprint(a-b)",WRONG_ANSWER,223,2808
1590940915944980480,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-11 13:34:07,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int n,i,j,k=0,a;\n    scanf(\""%d\"",&n);\n    for(i=1;i<n;i++)\n    {\n        a=sqrt(i);\n        for(j=2;j<=a;j++)\n        if(i%j==0)\n                break;\n       if(j>=a+1)\n            k++;\n    }\n    printf(\""%d\"",k);\n    return 0;\n}",WRONG_ANSWER,9,324
1590940922152529920,225b1524edf804414c466257a4f19789fe127117b27e663dc835d742fed77f9e,2022-11-11 13:34:08,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z;\n\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    int sum=X+Y-Z;\n    printf(\""%d\"",sum);\n    return 0;\n}\n",ACCEPTED,6,308
1590940923712811008,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-11 13:34:09,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n\n#define MAXNUM 100\n\nint main()\n\n{\n\nint output[MAXNUM],num=0,n,i,j;\n\nscanf(\""%d\"",&n);\n\nfor(i=2;i<=n;i++)\n\n{\n\nfor(j=2;j<=i-1;j++)\n\n{\n\nif(i%j==0)\n\nbreak;\n\n}\n\nif(j==i)\n\n{\n\noutput[num++]=i;\n\n}\n\n}\n\nprintf(\""num=%d\\n\"",num);\n\nfor(i=0;i<num;i++)\n\n{\n\nprintf(\""%d \"",output[i]);\n\n}\n\nprintf(\""\\n\"");\n\nreturn 0;",COMPILE_ERROR,0,0
1590940929781989376,75a6755f083ffc71d77ba6ce593bd24fe8a2ce61edc4710fbde2dce128c47ab4,2022-11-11 13:34:10,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,j,k=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n    {\n        int flag=0;\n        for(j=2;j<=i;j++)\n        {\n         if(i%j!=0)\n         flag++;\n        }\n        if(flag==i-2)\n        k++;\n    }\n    printf(\""%d\"",k);\n\n}\n",TIME_LIMIT_EXCEEDED,1000,320
1590940969606885376,547094c7c62f34b25dac6d7d79e017d817767a29a120ff5083d5fe0c21b62800,2022-11-11 13:34:20,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b,c,d,i;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++)\n    {\n        scanf(\""%d\"",&b);\n        c=6^b;\n        d=c%10;\n        printf(\""%d\"",d);\n    }\n    return 0;\n}\n",WRONG_ANSWER,2,188
1590940978763071488,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-11 13:34:22,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String args[]) {\n        int X, Y;\n        Scanner scanner = new Scanner(System.in);\n        Y = scanner.nextInt();\n        for (int i = 0; i < Y; i++) {\n            X = scanner.nextInt();\n            System.out.println(X==0?\""1\"":\""6\"");\n        }\n\n    }\n}",NON_ZERO_EXIT_CODE,240,16628
1590940979698380800,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-11 13:34:22,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int n,i,j,k=0,a;\n    scanf(\""%d\"",&n);\n    for(i=1;i<n;i++)\n    {\n        a=sqrt(i);\n        for(j=2;j<=a;j++)\n        if(i%j==0)\n                break;\n       if(j>=a)\n            k++;\n    }\n    printf(\""%d\"",k);\n    return 0;\n}",WRONG_ANSWER,10,344
1590940994953089024,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 13:34:26,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t,i,j,sum,z;\n    \n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<t;i++)\n    { sum=1;\n    for(j=0;j<a[i];j++)\n    {sum=6*sum;\n    z=sum%10;\n    if(j==a[i])\n    break;\n    printf(\""%d\\n\"",z);}}\n    return 0;\n}",WRONG_ANSWER,3,180
1590941013634514944,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 13:34:30,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\n\n/*int main()\n{\n    int t = 0;\n    scanf(\""%d \"",&t);\n    long long sum = 0;\n    int num = 0;\n    \n    while(t--)\n    {\n        int n = 0;\n        scanf(\""%d \"",&n);\n        sum = (int)pow(6.0,n);\n        num = sum % 10;\n        printf(\""%d\\n\"",num);\n    }\n    return 0;\n}\n*/\n\n\nint main(){\n    int t;\n    scanf(\""%d \"",&t);\n    \n    while(t--){\n        int n = 0;\n        while(scanf(\""%d \"",&n) != EOF){\n            printf(\""6\\n\"");\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,9,464
1590941029178585088,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-11 13:34:34,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String args[]) {\n        int a;\n        int b = 0;\n        int flag = 0;\n        Scanner scanner = new Scanner(System.in);\n        a = scanner.nextInt();\n        for (int i = 2; i <= a; i++) {\n            for (int j = 2; j < i; j++) {\n                if (i % j == 0)\n                    flag = 1;\n            }\n            if (flag == 0) {\n                b++;\n            }\n            flag = 0;\n        }\n        System.out.println(b);\n\n    }\n}\n,TIME_LIMIT_EXCEEDED,1000,16132
1590941035084165120,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-11 13:34:35,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int n,i,j,k=0,a;\n    scanf(\""%d\"",&n);\n    for(i=1;i<n;i++)\n    {\n        a=sqrt(i);\n        for(j=2;j<=a;j++)\n        if(i%j==0)\n                break;\n       if(j>a)\n            k++;\n    }\n    printf(\""%d\"",k);\n    return 0;\n}",WRONG_ANSWER,10,192
1590941087324241920,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 13:34:48,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int a,i,j,sum=0;\n    scanf(\""%d\"",&a);\n    for(i=2;i<=a;i++)\n    {\n        for(j=2;j<=sqrt(i);j++)\n        {\n            if(i%j==0) break;\n        }\n        if(j>sqrt(i)) sum++;\n    }\n    printf(\""%d\\n\"",sum);\n}",ACCEPTED,11,324
1590941138452811776,8f30a940fb84c0203b9f96b4d228374f10f9fdcb64182e702cd07fe56f0f3ee3,2022-11-11 13:35:00,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main(){\n    int n;\n    int a = 6;\n    scanf(\""%d\"",&n);\n    while (n--){\n        int t ;\n        scanf(\""%d\"", &t);\n        printf(\""%d\\n\"",(int)pow(a,t)%10);\n    }\n    return 0;\n}\n",WRONG_ANSWER,6,336
1590941162519724032,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-11 13:35:06,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int n,i,j,k=0,a=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<n;i++)\n    {\n        a=sqrt(i);\n        for(j=2;j<=a;j++)\n        if(i%j==0)\n                break;\n       if(j>a)\n            k++;\n    }\n    printf(\""%d\"",k);\n    return 0;\n}",ACCEPTED,13,324
1590941164646240256,6a6dc7e644e57bb2c20b20d39bd4d9541bdebf6415e03e7c13707572c054673e,2022-11-11 13:35:06,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n   int a,b,c,d,i,m,n;\n   i=(6^b)%10;\n   m=(6^c)%10;\n   n=(6^d)%10;\n   scanf(\""%d\\n\"",&a);\n   scanf(\""%d %d %d\"",&b,&c,&d);\n   printf(\""%d\\n%d\\n%d\"",i,m,n);\n    return 0;\n}\n",WRONG_ANSWER,3,344
1590941174154723328,e715137eeb4190ade2330123b989bbdd6eebd9a5e1df2e292271d3bfe3a79c69,2022-11-11 13:35:08,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    double n,a=1,i;\n    int k=2,j,b,c;\n    scanf(\""%lf\"",&n);\n    for(i=3;i<=n;i++)\n    {\n        a=1;\n        c=i;\n        b=sqrt(i);\n        for(j=b;j<c/2+1;j++)\n        {\n            if(c%j==0)\n            {\n\n                a=0;\n            }\n        }\n        if(a)\n            k++;\n    }\n    printf(\""%d\\n\"",k);\n    return 0;\n}",TIME_LIMIT_EXCEEDED,1000,420
1590941180563623936,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 13:35:10,C++,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n\n\nint main(void)\n{\nint x,y,z;\nscanf(\""%d,%d,%d\"",&x,&y,&z);\nprintf(\""%d\"",x+y-z);\n}",WRONG_ANSWER,3,184
1590941226101182464,902d8082eea06043d392298983db4630cde4418ac8ee42282d537bfaae045c2f,2022-11-11 13:35:21,Python,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"b=0\na=eval(input())\nfor i in range(1,a+1):\n    for j in range(2,int(i ** 0.5) +1):\n        if i % j == 0:\n            b+=1\n            break\nprint(a-b-1)",ACCEPTED,235,2880
1590941238151417856,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 13:35:24,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t,i,j,sum,z;\n    \n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<t;i++)\n    { sum=1;\n    for(j=0;j<a[i];j++)\n    sum=6*sum;\n    z=sum%10;\n    if(j==a[i])\n    break;\n    printf(\""%d\\n\"",z);}\n    return 0;\n}",WRONG_ANSWER,3,316
1590941262063144960,348c6be11ad612e07e8824e376f10ab1994838daea566d3016f2cf5f23051287,2022-11-11 13:35:29,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a;\n    scanf(\""%d\\n\"",&a);\n    int i,b;\n    for(i=0;i<a;i++)\n    {\n        scanf(\""%d\\n\"",&b);\n    }\n    for(i=0;i<a;i++)\n    {\n        printf(\""6\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,9,348
1590941299165954048,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-11 13:35:38,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n\n#define MAXNUM 100\n\nint main()\n\n{\n\nint output[MAXNUM],num=0,n,i,j;\n\nscanf(\""%d\"",&n);\n\nfor(i=2;i<=n;i++)\n\n{\n\nfor(j=2;j<=i-1;j++)\n\n{\n\nif(i%j==0)\n\nbreak;\n\n}\n\nif(j==i)\n\n{\n\noutput[num++]=i;\n\n}\n\n}\n\nprintf(\""num=%d\\n\"",num);\n\nfor(i=0;i<num;i++)\n\n{\n\nprintf(\""%d \"",output[i]);\n\n}\n\nprintf(\""\\n\"");\n\nreturn 0;\n",COMPILE_ERROR,0,0
1590941301443465216,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 13:35:39,C++,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n\n\nint main(void)\n{\nint x,y,z;\nscanf(\""%d%d%d\"",&x,&y,&z);\nprintf(\""%d\"",x+y-z);\n}",ACCEPTED,6,332
1590941339603243008,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-11 13:35:48,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n\n#define MAXNUM 100\n\nint main()\n\n{\n\nint output[MAXNUM],num=0,n,i,j;\n\nscanf(\""%d\"",&n);\n\nfor(i=2;i<=n;i++)\n\n{\n\nfor(j=2;j<=i-1;j++)\n\n{\n\nif(i%j==0)\n\nbreak;\n\n}\n\nif(j==i)\n\n{\n\noutput[num++]=i;\n\n}\n\n}\n\nprintf(\""num=%d\\n\"",num);\n\nfor(i=0;i<num;i++)\n\n{\n\nprintf(\""%d \"",output[i]);\n\n}\n\nprintf(\""\\n\"");\n\nreturn 0;\n}",SEGMENTATION_FAULT,41,320
1590941376676691968,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 13:35:57,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\n\n/*int main()\n{\n    int t = 0;\n    scanf(\""%d \"",&t);\n    long long sum = 0;\n    int num = 0;\n    \n    while(t--)\n    {\n        int n = 0;\n        scanf(\""%d \"",&n);\n        sum = (int)pow(6.0,n);\n        num = sum % 10;\n        printf(\""%d\\n\"",num);\n    }\n    return 0;\n}\n*/\n\n\nint main(){\n    int t;\n    scanf(\""%d \"",&t);\n    \n    while(t--){\n        int n = 0;\n        while(scanf(\""%d \"",&n) != EOF){\n            long long num = (long long)pow(6, n);\n            int units = num%10;\n            printf(\""%d\\n\"",units);\n            \n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,6,708
1590941396041797632,44042a4519c9231aa21c54eb113b7a08f98bcd7db4839a20a61ab6ce51fce357,2022-11-11 13:36:01,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int x,y,z;\n    int h;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    h=x+y-Z;\n    printf(\""%d\"",h);\n    \n    \n    \n    return 0;\n}",COMPILE_ERROR,0,0
1590941477608427520,6a6dc7e644e57bb2c20b20d39bd4d9541bdebf6415e03e7c13707572c054673e,2022-11-11 13:36:21,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n   int a,b,c,d,i,m,n;\n   i=(6^b)%10;\n   m=(6^c)%10;\n   n=(6^d)%10;\n   scanf(\""%d\\n\"",&a);\n   scanf(\""%d %d %d\"",&b,&c,&d);\n   printf(\""%d\\n %d\\n %d\"",i,m,n);\n    return 0;\n}\n",WRONG_ANSWER,3,344
1590941482377326592,dcc1017bcd698bd6a0eee54e4ed848d4c51a3a26608990cdd2137e4c01065a1e,2022-11-11 13:36:22,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"\n#include<stdio.h>\n#include<time.h>\nint main()\n{\ntime_t now;\ntime(&now);\nprintf(\""\\nNow is:%s\\n\"",ctime(&now));\nreturn 0;\n}",WRONG_ANSWER,3,312
1590941491483185152,44042a4519c9231aa21c54eb113b7a08f98bcd7db4839a20a61ab6ce51fce357,2022-11-11 13:36:24,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int x,y,z;\n    int h;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    h=x+y-z;\n    printf(\""%d\"",h);\n    \n    \n    \n    return 0;\n}",ACCEPTED,6,312
1590941590586195968,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-11 13:36:48,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n\n#define MAXNUM 100\n\nint main()\n\n{\n\nint output[MAXNUM],num=0,n,i,j;\n\nscanf(\""%d\"",&n);\n\nfor(i=2;i<=n;i++)\n\n{\n\nfor(j=2;j<=i-1;j++)\n\n{\n\nif(i%j==0)\n\nbreak;\n\n}\n\nif(j==i)\n\n{\n\noutput[num++]=i;\n\n}\n\n}\n\nprintf(\""%d\\n\"",num);\n\nreturn 0;\n\n}",ACCEPTED,939,340
1590941618914529280,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-11 13:36:54,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n   int n,m,k,i,d;\n    scanf(\""%d\"",&n);\n    for(m=2;m<n;m++)\n    {k=sqrt(m);\n     for(i=2;i<k;i++)\n         if(m%i==0) break;\n     if(i>=k+1)\n         d++;\n    }\n    printf(\""%d\"",d);\n    return 0;\n}",WRONG_ANSWER,9,324
1590941646815035392,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 13:37:01,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"n = int(input())\nxh = list(map(eval,input().split()))\nhd = list(map(eval,input().split()))\ndata = []\nfor i in range(0,n):\n    s=0\n    for j in range(i,10):\n        s=s+hd[j]-xh[j]\n        data.append(s)\ndata.sort(reverse=True)\nprint(data[0])\n",WRONG_ANSWER,17,3012
1590941682110083072,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 13:37:09,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\n\n/*\nint main()\n{\n    int t = 0;\n    scanf(\""%d \"",&t);\n    long long sum = 0;\n    int num = 0;\n    \n    while(t--)\n    {\n        int n = 0;\n        scanf(\""%d \"",&n);\n        sum = (int)pow(6.0,n);\n        num = sum % 10;\n        printf(\""%d\\n\"",num);\n    }\n    return 0;\n}\n*/\n\n\nint main(){\n    int t;\n    if(scanf(\""%d \"",&t) != EOF){\n        while(t--){\n        int n = 0;\n        while(scanf(\""%d \"",&n) != EOF){\n            long long num = (long long)pow(6, n);\n            int units = num%10;\n            printf(\""%d\\n\"",units);\n            \n        }\n    }\n    }\n    \n\n    return 0;\n}\n",WRONG_ANSWER,6,440
1590941705203920896,547094c7c62f34b25dac6d7d79e017d817767a29a120ff5083d5fe0c21b62800,2022-11-11 13:37:15,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b,c=1,d,i,j;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++)\n    {\n        scanf(\""%d\"",&b);\n        for(j=0;j<b;j++)\n            c=c*6;\n        d=c%10;\n        printf(\""%d\"",d);\n    }\n    return 0;\n}\n",WRONG_ANSWER,2,196
1590941771209682944,8f30a940fb84c0203b9f96b4d228374f10f9fdcb64182e702cd07fe56f0f3ee3,2022-11-11 13:37:31,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main(){\n    int n;\n    int a = 6;\n    scanf(\""%d\"",&n);\n    for (i=0;i<n,n--){\n        int t ;\n        scanf(\""%d\"", &t);\n        printf(\""%d\\n\"",(int)pow(a,t)%10);\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590941822640259072,8f30a940fb84c0203b9f96b4d228374f10f9fdcb64182e702cd07fe56f0f3ee3,2022-11-11 13:37:43,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main(){\n    int n;\n    int a = 6;\n    scanf(\""%d\"",&n);\n    for (i=0;i<n;n--){\n        int t ;\n        scanf(\""%d\"", &t);\n        printf(\""%d\\n\"",(int)pow(a,t)%10);\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590941839941742592,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 13:37:47,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\n\n/*\nint main()\n{\n    int t = 0;\n    scanf(\""%d \"",&t);\n    long long sum = 0;\n    int num = 0;\n    \n    while(t--)\n    {\n        int n = 0;\n        scanf(\""%d \"",&n);\n        sum = (int)pow(6.0,n);\n        num = sum % 10;\n        printf(\""%d\\n\"",num);\n    }\n    return 0;\n}\n*/\n\n\nint main(){\n    int t;\n    if(scanf(\""%d \"",&t) != EOF){\n        while(t--){\n        int n = 0;\n        while(scanf(\""%d \"",&n) != EOF){\n            printf(\""6\\n\""); \n        }\n    }\n    }\n    \n\n    return 0;\n}\n",WRONG_ANSWER,9,192
1590941860875534336,630b8bfc88107b488e158fc7108c8faf0a195f9b9030c3faf51edac625714584,2022-11-11 13:37:52,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main(){\nint t,i,k=0;\nscanf(\""%d\"",&t);\nint n[t],j[t];\nfor(i=0;i<t;i++){\n    scanf(\""%d\"",&n[i]);\n    if(n[i]==0) j[k++]=i;\n}\nk=0;\nfor(i=0;i<t;i++){\n    if(i==j[k]) {printf(\""1\"");k++;}\n    else printf(\""6\"");\n    if(i!=t-1) printf(\""\\n\"");\n}\n}\n",WRONG_ANSWER,3,324
1590941875815649280,9ca3f63f61fa4f349009d69e7059514c3a39dbdd5a1f94342c11f4c33ccdceaa,2022-11-11 13:37:56,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"x = int(input())\ny = input().split(\"" \"")\nz = input().split(\"" \"")\nb = c = -999\n\nfor j in range(x):\n    b = 0\n    for i in range(j,x):\n        a = int(z[i])-int(y[i])\n        if a < 0:\n            b = a\n        if b + a>b:\n            b = b+a\n        if b+a<b:\n            break\n    if c < b:\n        c = b\nprint(c)\n",WRONG_ANSWER,16,2884
1590941876021166080,d122b81a371b28751082747cf65a235d0eddfd496e142775cd971d8f88adf327,2022-11-11 13:37:56,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"//终曲cc-学习之路\n#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\t int t,j;\n    int u=0;\n\tint isprime(int n);\n\tscanf(\""%d\"",&t);\n\tfor(j=1;j<=t;j++)\n\t{\n\t\tif (isprime(j)==1) u++;\n\t}\n\tprintf(\""%d\\n\"",u);\n\treturn 0;\n}\n\nint isprime(int n)\n{\n\tint i;\n\tif(n==2) return 1;\n\telse if(n==1||n%2==0) return 0;\n\tfor (i=3;i<=sqrt(n)+1;i+=2)\n\t{\n\t\tif(n%i==0) return 0;\n\t}\n\treturn 1;\n}\n",ACCEPTED,10,308
1590941925807554560,8f30a940fb84c0203b9f96b4d228374f10f9fdcb64182e702cd07fe56f0f3ee3,2022-11-11 13:38:08,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main(){\n    int n;\n    int a = 6;\n    scanf(\""%d\"",&n);\n    for (i=0;i<n;i++){\n        int t ;\n        scanf(\""%d\"", &t);\n        printf(\""%d\\n\"",(int)pow(a,t)%10);\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590941936138104832,40c43472973ea298adbdd1d4b900aeb63cfa4cfe17179f01a4827cd2c6624d3a,2022-11-11 13:38:10,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int x,y,z,sum=0;\n    scanf(\""输入三个整数：%d%d%d\"",&x,&y,&z);\n    if((x>=0&&x<=100)&&(y>=0&&y<=100)&&(z>=0&&z<=100))\n        sum=x+y-z;\n        printf(\""%d\"",sum);\n}",WRONG_ANSWER,3,316
1590942151146541056,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 13:39:01,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t,i,j,sum,z;\n    \n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<t;i++)\n    { sum=1;\n    for(j=0;j<a[i];j++)\n    sum=6*sum;\n    z=sum%10;\n    printf(\""%d\\n\"",z);}\n    return 0;\n}",TIME_LIMIT_EXCEEDED,23,200
1590942217873723392,345826d11b41befc23adeb536e81da8eb6ec9a8bfb9448acf91422deedb8ba4a,2022-11-11 13:39:17,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,i,j,k=0;\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++)\n       {\n        for(j=2;j<i;j++)\n            {\n                if(i%j==0)\n                {\n                    break;\n                }\n                }\n            if(j==i)\n               {\n                   k++;\n               }\n                }\n    printf(\""%d\"",k);\n}\n",ACCEPTED,927,308
1590942219274620928,8f30a940fb84c0203b9f96b4d228374f10f9fdcb64182e702cd07fe56f0f3ee3,2022-11-11 13:39:18,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main(){\n    int n;\n    int a = 6;\n    scanf(\""%d\"",&n);\n    while(n--){\n        int t ;\n        scanf(\""%d\"", &t);\n        printf(\""%d\\n\"",(int)pow(a,t)%10);\n    }\n    return 0;\n}\n",WRONG_ANSWER,6,344
1590942350497591296,0b693affc66d8d407ff008bd1aaf4f2feb4a615f057943ba4b4ba3163d937dc6,2022-11-11 13:39:49,Java,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"import java.io.*;\nimport java.util.*;\n\npublic class Main {\n\n    public static void main(String[] args) throws IOException {\n        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n        Scanner sc=new Scanner(System.in);\n        String s=br.readLine();\n        String[] out=br.readLine().split(\"" \"");\n        String[] in=br.readLine().split(\"" \"");\n        int  n=Integer.parseInt(s);\n        long res=0;\n        long temp=0;\n        for (int i = 0; i < n; i++) {\n            for (int j = i; j < n; j++) {\n                temp=Integer.parseInt(in[j])-Integer.parseInt(out[j])+temp;\n                res=Math.max(temp,res);\n            }\n            temp=0;\n        }\n        System.out.println(res);\n    }\n\n   /* public static int countPrimes(int n) {\n        int[] isPrime=new int[n];\n        Arrays.fill(isPrime,1);\n        int res=0;\n        for (int i = 2; i < n; i++) {\n            if(isPrime[i]==1){\n                res++;\n                if( (long) i*i<n){\n                    for (int j = i*i; j < n; j+=i) {\n                        isPrime[j]=0;\n                    }\n                }\n            }\n        }\n        return res;\n    }*/\n\n    /*private static boolean isZHI(int n) {\n        for (int i = 2; i <n/2+1 ; i++) {\n            if (n%i==0)\n                return false;\n        }\n        return true;//是质数\n    }*/\n\n\n}",ACCEPTED,122,16176
1590942351755902976,8f30a940fb84c0203b9f96b4d228374f10f9fdcb64182e702cd07fe56f0f3ee3,2022-11-11 13:39:49,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main(){\n    int n;\n    int a = 6;\n    scanf(\""%d\"",&n);\n    while(n=n-1){\n        int t ;\n        scanf(\""%d\"", &t);\n        printf(\""%d\\n\"",(int)pow(a,t)%10);\n    }\n    return 0;\n}\n",WRONG_ANSWER,3,188
1590942392214159360,8f30a940fb84c0203b9f96b4d228374f10f9fdcb64182e702cd07fe56f0f3ee3,2022-11-11 13:39:59,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main(){\n    int n;\n    int a = 6;\n    scanf(\""%d\"",&n);\n    while(n=n+1){\n        int t ;\n        scanf(\""%d\"", &t);\n        printf(\""%d\\n\"",(int)pow(a,t)%10);\n    }\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,20,320
1590942444261257216,40c43472973ea298adbdd1d4b900aeb63cfa4cfe17179f01a4827cd2c6624d3a,2022-11-11 13:40:11,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int x,y,z,sum=0;\n    printf(\""请输入三个整数：\"");\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    if((x>=0&&x<=100)&&(y>=0&&y<=100)&&(z>=0&&z<=100))\n        sum=x+y-z;\n        printf(\""%d\"",sum);\n}",WRONG_ANSWER,3,336
1590942446182248448,9ca3f63f61fa4f349009d69e7059514c3a39dbdd5a1f94342c11f4c33ccdceaa,2022-11-11 13:40:12,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"x = int(input())\ny = input().split(\"" \"")\nfor i in range(x):\n    #a,b,c = [int(x) for x in input().split(\"" \"")]\n    '''a = int(y[i])\n    b = 6**a\n    b = b%10\n    print(b)'''\n    if y[i] == \""\"" or int(y[i])<=0 or int(y[i])>=10**9:\n        break\n    else:\n        print (6)\n",WRONG_ANSWER,31,2888
1590942509323321344,29d1ea54d6e4e56fc2de0be5ae10ecc4c70c7fca667934b17857e95530f5663a,2022-11-11 13:40:27,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include<string.h>\nint main ()\n{\n    \n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,3,312
1590942535793573888,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-11 13:40:33,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n   int n,m,k,i,d;\n    scanf(\""%d\"",&n);\n    for(m=2;m<n;m++)\n    {k=sqrt(m);\n     for(i=2;i<k;i++)\n         if(m%i==0) break;\n     if(i>=k+1)\n         d++;\n    }\n    printf(\""%d\"",d);\n    return 0;\n}",WRONG_ANSWER,10,184
1590942597768609792,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 13:40:48,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\n\n\nint main()\n{\n    int t = 0;\n    scanf(\""%d \"",&t);\n    \n    while(t--)\n    {\n        int n = 0;\n        scanf(\""%d \"",&n);\n        \n        printf(\""6\\n\"");\n        \n    }\n    return 0;\n}\n\n\n\n",WRONG_ANSWER,9,324
1590942656841187328,9ca3f63f61fa4f349009d69e7059514c3a39dbdd5a1f94342c11f4c33ccdceaa,2022-11-11 13:41:02,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"x = int(input())\ny = input().split(\"" \"")\nfor i in range(x):\n    #a,b,c = [int(x) for x in input().split(\"" \"")]\n    a = int(y[i])\n    b = (6**a)%10\n    print(b)\n",TIME_LIMIT_EXCEEDED,168,3956
1590942695940493312,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 13:41:11,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a;\n    if(scanf(\""%d\"",&a)){\n    int i,b[100];\n    for()\n    }\n}",COMPILE_ERROR,0,0
1590942727905280000,0d24b4ee85e6e3a4cc694f7e11105fa2aaf93fd10d4cbe81657f252e2d675435,2022-11-11 13:41:19,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#define  N 1000\nint MaxSum(int a[], int size);\nint arr3[N];\nint main(void)\n{\n\tint n,t;\n\tint i=0, j=0,sum;\n\tint arr1[N], arr2[N];\n\tscanf(\""%d\"", &n);\n\twhile (i<n) {\n\t\tscanf(\""%d\"", &arr1[i]);\n\t\ti++;\n\t}\n\twhile (j < n) {\n\t\tscanf(\""%d\"", &arr2[j]);\n\t\tj++;\n\t}\n\tfor (i = 0; i < n; i++) {\n\t\tarr3[i] = arr2[i] - arr1[i];\n\t}\n\t\n\tsum = MaxSum(arr3, n);\n\tprintf(\""%d\"", sum);\n\treturn 0;\n}\nint MaxSum(int a[], int size)\n{\n    if (a == NULL || size == 0)\n    {\n        return -1;\n    }\n    int sum = 0;//初始和为0\n    int index = 0;\n    int max = a[index];//最大值最初必为数组第一个元素\n    for (; index < size; ++index)\n    {\n        sum = sum + a[index];//遍历一个元素，累加一次\n        if (sum < a[index])//如果加上当前元素之后的和比当前元素还小，则舍弃之前的元素，从当前元素开始累加\n        {\n            sum = a[index];\n        }\n        if (sum > max)\n        {\n            max = sum;\n        }\n    }\n    return max;\n}\n",ACCEPTED,3,192
1590942783693717504,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-11 13:41:32,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n   int n,m,k,i,d;\n    scanf(\""%d\"",&n);\n    for(m=2;m<n;m++)\n    {k=sqrt(m);\n     for(i=2;i<k;i++)\n         if(m%i==0) break;\n     if(i>=k+1)\n         d++;\n    }\n    printf(\""%d\"",d);\n    return 0;\n}",WRONG_ANSWER,9,200
1590942840811749376,6b312558d54f4eeffd1aa510a96dd5882584f6bf7857d244f71013b7ec561920,2022-11-11 13:41:46,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n    int n,i;\n    int a[10],b[10],c[10];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n        b[i]=pow(6,a[i]);\n        c[i]=b[i]%10;\n        printf(\""%d\\n\"",c[i]);\n    }\n    return 0;\n}\n",WRONG_ANSWER,9,308
1590942941034643456,0ccbaaa612b3d01dbe621ce5e7366d6e26d2e5adf55047d92c6eb7adf78a979d,2022-11-11 13:42:10,C++,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int n;cin>>n;\n    int a[n],b[n],c[n];\n    for(int i=0;i<n;i++) cin>>a[i];\n    for(int i=0;i<n;i++) cin>>b[i],c[i]=b[i]-a[i];\n    int sum=0;\n\tfor(int i=0;i<n;i++){\n\t\tint thisSum=0;\n\t\tfor(int j=i;j<n;j++){\n\t\t\tthisSum+=c[j];\n\t\t\tif(thisSum > sum){\n\t\t\t\tsum = thisSum;\n\t\t\t}\n\t\t}\t\n\t}\n    cout<<sum;\n    return 0;\n}",ACCEPTED,4,448
1590942943148552192,129ddfe9d2d4553f365faf2fdc5e2f0c271b2e342a4cff13802dda8ef8b3d1c2,2022-11-11 13:42:10,Java,0.0,1590734963702620160,1590734503495200768,1049226928954454016,import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int n = s.nextInt();\n        int[] a = new int[9];\n        int[] b = new int[9];\n        int Max = 0;\n        int sum = 0;\n        for(int i =0; i < n ; i++){\n            a[i] = s.nextInt();\n        }\n        for(int i =0; i < n ; i++){\n            b[i] = s.nextInt();\n        }\n        for(int i =0; i < n ; i++){\n            sum = b[i] - a[i];\n            if(sum>Max){\n                Max = sum;\n            }\n        }\n        System.out.print(Max);\n    }\n},NON_ZERO_EXIT_CODE,136,20316
1590942986165334016,dcc1017bcd698bd6a0eee54e4ed848d4c51a3a26608990cdd2137e4c01065a1e,2022-11-11 13:42:20,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"\n#include<stdio.h>\n#include<time.h>\nint main()\n{\ntime_t now;\nint time_year;\n    printf(\""%d\"",1990+time_year);\nreturn 0;\n}",WRONG_ANSWER,3,308
1590942989789212672,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 13:42:21,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t,i,j,sum,z;\n    \n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<t;i++)\n    { sum=1;\n    for(j=0;j<a[i];j++)\n    sum=6*sum;\n    z=sum%10;\n    printf(\""%d\\n\"",z);}\n    return 0;\n}",TIME_LIMIT_EXCEEDED,23,188
1590942990829420544,40c43472973ea298adbdd1d4b900aeb63cfa4cfe17179f01a4827cd2c6624d3a,2022-11-11 13:42:21,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int x,y,z,sum=0;\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    if((x>=0&&x<=100)&&(y>=0&&y<=100)&&(z>=0&&z<=100))\n        sum=x+y-z;\n        printf(\""%d\"",sum);\n}\n",ACCEPTED,8,316
1590942993585057792,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 13:42:22,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\nl = int(input())\ndata = list(map(eval,input().split()))\nfor i in range(l):\n    if 0<=data[i]<=1000000000 :\n        s=int(math.pow(6,data[i]))\n        s=str(s)\n        if i ==l-1:\n            n=s[-1]\n            print(n,end=\""\"")\n        else:\n            n = s[-1]\n            print(n)\n    else:\n        break\n\n",WRONG_ANSWER,34,2876
1590942996995026944,9ca3f63f61fa4f349009d69e7059514c3a39dbdd5a1f94342c11f4c33ccdceaa,2022-11-11 13:42:23,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"x = int(input())\ny = input().split(\"" \"")\nz = input().split(\"" \"")\nb = c = -9999999\n\nfor j in range(x):\n    b = 0\n    for i in range(j,x):\n        a = int(z[i])-int(y[i])\n        if a < 0:\n            b = a\n        if b + a>b:\n            b = b+a\n        if b+a<b:\n            break\n    if c < b:\n        c = b\nprint(c)\n",WRONG_ANSWER,15,2744
1590943046991155200,acfcf65f14b5d3b02c3225372654b4e21f04d33a8bbaeb346e4fb1d85f2ea94f,2022-11-11 13:42:35,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n   \nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    printf(\""%d\"",X+Y-Z);    \n    return 0;\n}",ACCEPTED,6,356
1590943055501398016,887d1bbe53a4d4a349813887f13126da5e46a853687f4c2c9d7b8ef3d748a9d6,2022-11-11 13:42:37,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n main()\n{\n    int i,n,t=0,j;\n    scanf(\""%d\"",&n);\n    for(i=2;i<n;i++)\n    {\n        for(j=2;j<=i;j++)\n            if(i%j==0)\n                break;\n            if(i==j)\n                t++;\n    }\n    printf(\""%d\"",t);\n}\n",ACCEPTED,912,324
1590943065039245312,c9a8fe962a36cf99ca362f66348b02453584251c62fe2356e11d2a6efd5cee45,2022-11-11 13:42:39,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nvoid main()\n{\n   int i,a,n,s;\n   int sum;\n   scanf(\""%d\"",&n);\n   for(i=1;i<=n;i++)\n   {\n       scanf(\""%d\"",&a);\n       sum=pow(6,a);\n       s=sum%10;\n       printf(\""%d\\n\"",s);\n   }\nreturn 0;\n}\n",WRONG_ANSWER,6,312
1590943084643422208,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 13:42:44,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\nl = int(input())\ndata = list(map(eval,input().split()))\nfor i in range(l):\n    if 0<=data[i]<=1000000000 :\n        s=int(math.pow(6,data[i]))\n        s=str(s)\n        if i ==l-1:\n            n=int(s[-1])\n            print(n,end=\""\"")\n        else:\n            n = int(s[-1])\n            print(n)\n    else:\n        break\n\n",WRONG_ANSWER,34,2876
1590943098350403584,fec6d07e317796c63fb7ae6e7538f75973ad64af6e6196cc27eed3e9e685bf86,2022-11-11 13:42:47,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nvoid main()\n{\n    int b,i,j;\n    scanf(\""%d\"",&b);\n    int a[100],c[100];\n    int max=0,sum=0;\n    for(i=0;i<b;i++)\n        scanf(\""%d\"",&a[i]);\n    for( i=0;i<b;i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=0;i<b;i++)\n    {\n     int thissum=0;\n    for(j=i;j<b+i;j++)\n    {\n        if(j>=b)\n            thissum=thissum-a[j-b]+c[j-b];\n        else\n            thissum=thissum-a[j]+c[j];\n        if(thissum>max)\n            max=thissum;\n    }\n    if(max>sum)\n        sum=max;\n    }\n    printf(\""%d\\n\"",sum);\n}",ACCEPTED,3,192
1590943110190927872,86f702b052a21d7cb2f8cd933c678c21efaafaf5b2d35032f18ec35c1e26a945,2022-11-11 13:42:50,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int t,a,b,i;\n    int n[100];\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++)\n        scanf(\""%d\"",&n[i]);\n    for(i=0;i<t;i++)\n      {\n        a=pow(6,n[i]);\n        b=a%10;\n        printf(\""%d\\n\"",b);\n      }\n    return 0;\n}",WRONG_ANSWER,6,440
1590943111377911808,dcc1017bcd698bd6a0eee54e4ed848d4c51a3a26608990cdd2137e4c01065a1e,2022-11-11 13:42:50,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"\n#include<stdio.h>\n#include<time.h>\nint main()\n{\ntime_t now;\nint time_year;\n    printf(\""%d\"",+time_year);\nreturn 0;\n}",WRONG_ANSWER,2,200
1590943117925224448,8f30a940fb84c0203b9f96b4d228374f10f9fdcb64182e702cd07fe56f0f3ee3,2022-11-11 13:42:52,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main(){\n    int n;\n    int a = 6;\n    scanf(\""%d\"",&n);\n    while(n--){\n        int t ;\n        scanf(\""%d\"", &t);\n        printf(\""%d\\n\"",(int)pow(a,t)%10);\n    }\n    return 0;\n}\n",WRONG_ANSWER,4,316
1590943142390599680,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 13:42:58,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\nl = int(input())\ndata = list(map(eval,input().split()))\nfor i in range(l):\n    if 0<=data[i]<=1000000000 :\n        s=int(math.pow(6,data[i]))\n        s=str(s)\n        if i ==l-1:\n            n=str(s[-1])\n            print(n,end=\""\"")\n        else:\n            n = str(s[-1])\n            print(n)\n    else:\n        break\n\n",WRONG_ANSWER,32,2872
1590943148304568320,23d287b80d4d430308a1b57ee92bb4f2d1b25d1142a13c1c0fda4316c9bb9f17,2022-11-11 13:42:59,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\nb=list(input().split())\nfor i in range(0,a):\n    c=int(b[i])\n    # print(c)\n    print(pow(6,c)%10)",TIME_LIMIT_EXCEEDED,167,4004
1590943193011630080,40c43472973ea298adbdd1d4b900aeb63cfa4cfe17179f01a4827cd2c6624d3a,2022-11-11 13:43:10,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    printf(\""2022\"");\n}",ACCEPTED,3,200
1590943257654243328,7ecf54bf0ea2db8ab0397aa941f19ec79a351bc3e86e8c01673aa09a69b3a6db,2022-11-11 13:43:25,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"l = [1, 2, 3]\nn = int(input())\nfor i in range(5, n+1):\n    for j in range(2, i//2):\n        if (i % j == 0):\n            break\n        elif (j == i // 2 - 1):\n            l.append(i)\n        else:\n            continue\nprint(len(l))",TIME_LIMIT_EXCEEDED,1000,4036
1590943264679723008,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 13:43:27,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\nl = int(input())\ndata = list(map(eval,input().split()))\nfor i in range(l):\n    if 0<=data[i]<=1000000000 :\n        s=int(math.pow(6,data[i]))\n        s=str(s)\n        if i ==l-1:\n            print(s[-1],end=\""\"")\n        else:\n            print(s[-1])\n    else:\n        break\n\n",WRONG_ANSWER,30,2892
1590943266403586048,547094c7c62f34b25dac6d7d79e017d817767a29a120ff5083d5fe0c21b62800,2022-11-11 13:43:27,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b,c=1,d,i,j;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++)\n    {\n        scanf(\""%d\"",&b);\n        c=pow(6,b);\n        d=c%10;\n        printf(\""%d\\ns\"",d);\n    }\n    return 0;\n}\n",WRONG_ANSWER,3,196
1590943282849452032,23d287b80d4d430308a1b57ee92bb4f2d1b25d1142a13c1c0fda4316c9bb9f17,2022-11-11 13:43:31,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\nb=list(input().split())\nfor i in range(0,a):\n    c=int(b[i])\n    print(pow(6,c)%10)",TIME_LIMIT_EXCEEDED,167,4144
1590943317460848640,7d46013a6da090b69b62e7be93e7628aee2f7eef31af37777b9ccf1fd1d3eb2e,2022-11-11 13:43:39,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main (){\n    int n,a,b;\n    a=pow(6,n);\n    b=a%10;\n    scanf(\""%f\"",n);\n    printf(\""%f\"",b);\n    getch();\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590943320543637504,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-11 13:43:40,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,a[],i,j[]\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    { scanf(\""%d\"",&a[i]);\n       j[i]=pow(6,a[i]);}\n    for(i=0;i<n;i++)\n        printf(\""%d\\n\"",j[i]%10);\n    return 0;\n}",COMPILE_ERROR,0,0
1590943357218631680,6a4a105e99255cc39ebb6a122c9fdf740e574dbb708100363b339265f92e1bbf,2022-11-11 13:43:49,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    printf(\""%d\"",X+Y-Z);\n    return 0;\n}",ACCEPTED,4,200
1590943368937517056,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 13:43:52,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a;\n    if(scanf(\""%d\"",&a)){\n    int i,b[100];\n    for(i=0;i<a;i++){\n        if(scanf(\""%d\"",&b[i])){}    }\n    for(i=0;i<a;i++){\n        printf(\""6\\n\"");\n    }\n        return 0;\n}}",WRONG_ANSWER,8,316
1590943375166058496,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-11 13:43:53,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\nint num=0,n,i,j;\nscanf(\""%d\"",&n);\nfor(i=2;i<=n;i++)\n{\nfor(j=2;j<=i-1;j++)\nif(i%j==0)\nbreak;\nif(j==i)\nnum++;\n}\nprintf(\""%d\\n\"",num);\nreturn 0;\n}",ACCEPTED,976,276
1590943391553204224,dcc1017bcd698bd6a0eee54e4ed848d4c51a3a26608990cdd2137e4c01065a1e,2022-11-11 13:43:57,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"\n#include<stdio.h>\n#include<time.h>\nint main()\n{\ntime_t ;\nint time_year;\n    printf(\""%d\"",2022+time_year);\nreturn 0;\n}",ACCEPTED,3,200
1590943393620996096,345826d11b41befc23adeb536e81da8eb6ec9a8bfb9448acf91422deedb8ba4a,2022-11-11 13:43:57,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,j,k=0;\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++)\n       {\n        for(j=2;j<i;j++)\n            {\n                if(i%j==0)\n                {\n                    break;\n                }\n                }\n            if(j==i)\n               {\n                   k++;\n               }\n                }\n    printf(\""%d\"",k);\n}\n",ACCEPTED,929,180
1590943435601784832,e51465ce72346fac918042a342986433269a159492161f223a180a6e05d9a01a,2022-11-11 13:44:08,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tint a=0,b=0;\n\t\tint num=6;\n\t\tint res=0;\n\t\tb=in.nextInt();\n        while (in.hasNextInt()) {\n        \tnum=6;\n            a = in.nextInt();\n            num =(int) Math.pow(num, a);\n            res=num%10;\n            System.out.println(res);\n        } \n\t}\n}",WRONG_ANSWER,268,16480
1590943445504536576,dcc1017bcd698bd6a0eee54e4ed848d4c51a3a26608990cdd2137e4c01065a1e,2022-11-11 13:44:10,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"\n#include<stdio.h>\n#include<time.h>\nint main()\n{\n    printf(\""%d\"",2022);\nreturn 0;\n}",ACCEPTED,5,180
1590943447471685632,547094c7c62f34b25dac6d7d79e017d817767a29a120ff5083d5fe0c21b62800,2022-11-11 13:44:10,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b,c=1,d,i,j;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++)\n    {\n        scanf(\""%d\"",&b);\n        c=pow(6,b);\n        d=c%10;\n        printf(\""%d\\n\"",d);\n    }\n    return 0;\n}\n",WRONG_ANSWER,5,312
1590943453712789504,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 13:44:12,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"a=int(input())\ndata1=list(map(int,input().split()))\ndata2=list(map(int,input().split()))\n\ndatas=[]\nfor i in range(a):\n    datas.append(data2[i]-data1[i])\nprint(datas)\na=0\ndatass=[]\nfor i in range(len(datas)):\n    for x in range(i,len(datas)):\n        if x==i:\n            datass.append(datas[x])\n        else:\n            datass.append(sum(datas[i:x]))\n\nprint(max(datass))",WRONG_ANSWER,15,3024
1590943476206841856,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 13:44:17,Java,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"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(\""请依次输入三个数：空格隔开\"");\n        int x = sc.nextInt();\n        int y = sc.nextInt();\n        int z = sc.nextInt();\n        \n        int num = x +y -z;\n        System.out.println(num);\n}\n}",COMPILE_ERROR,0,0
1590943476655652864,e51465ce72346fac918042a342986433269a159492161f223a180a6e05d9a01a,2022-11-11 13:44:17,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tint a=0,b=0;\n\t\tint num=6;\n\t\tint res=0;\n\t\tb=in.nextInt();\n        while (in.hasNextInt()) {\n        \tnum=6;\n            a = in.nextInt();\n            num =(int) Math.pow(num, a);\n            res=num%10;\n            System.out.println(res);\n        } \n\t}\n}",WRONG_ANSWER,240,19204
1590943485090377728,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 13:44:19,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"a=int(input())\ndata1=list(map(int,input().split()))\ndata2=list(map(int,input().split()))\n\ndatas=[]\nfor i in range(a):\n    datas.append(data2[i]-data1[i])\nprint(datas)\na=0\ndatass=[]\nfor i in range(len(datas)):\n    for x in range(i,len(datas)):\n        if x==i:\n            datass.append(datas[x])\n        else:\n            datass.append(sum(datas[i:x]))\nprint(max(datass))",WRONG_ANSWER,16,3004
1590943512038805504,6cbd81921f92855c6b8318725b09ef7ec48ff579276b3df9f7ea04bea9804678,2022-11-11 13:44:26,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n   int t,i,a,b;\n   scanf(\""%d\"",&t);\n   for(i=1;i<=t;i++)\n   {\n       scanf(\""%d\"",&a);\n       b=pow(6,t);\n       printf(\""%d\\n\"",b%10);\n   }\n    return 0;\n}\n",WRONG_ANSWER,8,316
1590943518628057088,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 13:44:27,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\nl = int(input())\ndata = list(map(eval,input().split()))\nfor i in range(l):\n    if 0<=data[i]<=1000000000 :\n        s=int(math.pow(6,data[i]))\n        s=str(s)\n        if i ==l-1:\n            print(s[-1],end=\""\"")\n        else:\n            print(s[-1])\n    else:\n        break",WRONG_ANSWER,30,2876
1590943540333555712,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-11 13:44:32,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nvoid main(){\n    printf(\""2022\"");\n}",NON_ZERO_EXIT_CODE,2,192
1590943546117525504,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 13:44:34,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\n\n\nint main()\n{\n    int t = 0;\n    scanf(\""%d \"",&t);\n    \n    while(t--)\n    {\n        int n = 0;\n        scanf(\""%d \"",&n);\n        getchar();\n        printf(\""6\\n\"");\n        \n    }\n    return 0;\n}\n\n\n\n",WRONG_ANSWER,6,200
1590943580527570944,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 13:44:42,Java,0.0,1590524835191705600,1572865591226855424,1049226928954454016,import java.util.Scanner;\n\npublic class Main{\n    public static void main（String[] args){\n        Scanner sc = new Scanner(System.in);\n        \n        int x = sc.nextInt();\n        int y = sc.nextInt();\n        int z = sc.nextInt();\n        \n        int num = x +y -z;\n        System.out.println(num);\n}\n},COMPILE_ERROR,0,0
1590943588630990848,dcc1017bcd698bd6a0eee54e4ed848d4c51a3a26608990cdd2137e4c01065a1e,2022-11-11 13:44:44,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"\n#include<stdio.h>\n#include<time.h>\nint main()\n{\n    printf(\""%d\"",2022);\nreturn 0;\n}",ACCEPTED,3,316
1590943613184421888,2e4af98c441106efa9ee51f8a781d0eee91a3dff6193987d421eb3a48725c814,2022-11-11 13:44:50,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <iostream>\n\nusing namespace std;\n\nint main() {\n    int n, i;\n    scanf(\""%d\"", &n);\n    int a1[n], b1[n], c1[n];\n\n    for (int j = 0; j < n; ++j) {\n        scanf(\""%d\"", &a1[j]);\n    }\n    for (int j = 0; j < n; ++j) {\n        scanf(\""%d\"", &b1[j]);\n    }\n    for (i = 0; i < n; ++i) {\n        c1[i] = b1[i] - a1[i];\n    }\n\n    int j = 0, num = 0;\n    i = 0;\n    while (c1[i++] >= 0);\n    while (c1[j] > 0) {\n        num = num + c1[j++];\n    }\n\n\n    printf(\""%d\"", num);\n    return 0;\n}\n\n\n",WRONG_ANSWER,4,444
1590943613524180992,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-11 13:44:50,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main(){\n    int n,i,temp=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n],sum=0;\n    for(i=0;i<n;i++)\n    {scanf(\""%d\"",&a[i]);}\n    for(i=0;i<n;i++)\n    {scanf(\""%d\"",&b[i]);}\n    for(i=0;i<n;i++){\n        c[i]=b[i]-a[i];\n    }\n  for(i=0;i<n;i++){\n       if(c[i>=0])\n\t   {\n\t   \tif(c[i]>=0) sum+=c[i];\n\t   \tif(temp<=sum)   {temp=sum;}\n\t\t   }\n\t   \n       if(c[i]<0) {\n      \n\t \t sum=0;\n\t     }\n     }\n     printf(\""%d\"",temp);\n}",WRONG_ANSWER,3,192
1590943632167841792,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-11 13:44:54,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nvoid main(){\n    printf(\""2022\"");\n}",NON_ZERO_EXIT_CODE,3,328
1590943650421452800,1b00b3d29099722d8332b35e3af5e54fda309b4f7c9fc6261f618ecd2a4d7390,2022-11-11 13:44:59,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,4,308
1590943686999977984,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-11 13:45:07,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main(){\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,3,188
1590943703898828800,2a1cee132cc8344d51461f6cbf473fb80705d6fd5972f9a5d0fcfea0760fd8b1,2022-11-11 13:45:11,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint mynum1(int N)\n{\n    int i,a,b,c;\n    a=N%10;\n    b=N%4;\n    if(b==0)\n    {\n        b=4;\n    }\n    c=a;\n    for(i=1;i<=b-1;i++)\n    {\n        c=c*a;\n    }\n    c=c%10;\n    return c;\n}\nint main()\n{\n    int t,N,i;\n    scanf(\""%d\"",&t);\n    for(i=1;i<=t;i++)\n    {\n        scanf(\""%d\"",&N);\n        printf(\""%d\\n\"",mynum1(6));\n    }\n}\n",WRONG_ANSWER,9,320
1590943721468788736,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 13:45:16,Python,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"a=int(input())\ndata1=list(map(int,input().split()))\ndata2=list(map(int,input().split()))\n\ndatas=[]\nfor i in range(a):\n    datas.append(data2[i]-data1[i])\na=0\ndatass=[]\nfor i in range(len(datas)):\n    for x in range(i,len(datas)):\n        if x==i:\n            datass.append(datas[x])\n        else:\n            datass.append(sum(datas[i:x]))\nprint(max(datass))",ACCEPTED,16,2748
1590943729316335616,64f8dab58af431d48e3c413e8710a37cc2c583e883c731d70cd5a4e026299255,2022-11-11 13:45:18,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\t int t,j;\n    int u=0;\n\tint isprime(int n);\n\tscanf(\""%d\"",&t);\n\tfor(j=1;j<=t;j++)\n\t{\n\t\tif (isprime(j)==1) u++;\n\t}\n\tprintf(\""%d\\n\"",u);\n\treturn 0;\n}\n\nint isprime(int n)\n{\n\tint i;\n\tif(n==2) return 1;\n\telse if(n==1||n%2==0) return 0;\n\tfor (i=3;i<=sqrt(n)+1;i+=2)\n\t{\n\t\tif(n%i==0) return 0;\n\t}\n\treturn 1;\n}",ACCEPTED,10,316
1590943730138394624,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-11 13:45:18,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main(){\n    int n,i,temp=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n],sum=0;\n    for(i=0;i<n;i++)\n    {scanf(\""%d\"",&a[i]);}\n    for(i=0;i<n;i++)\n    {scanf(\""%d\"",&b[i]);}\n    for(i=0;i<n;i++){\n        c[i]=b[i]-a[i];\n    }\n  for(i=0;i<n;i++){\n       if(c[i>=0])\n\t   {\n\t   \tif(c[i]>=0) sum+=c[i];\n\t   \tif(temp<=sum)   {temp=sum;}\n\t\t   }\n\t   \n       if(c[i]<0) {\n      \n\t \t sum=0;\n\t     }\n     }\n     printf(\""%d\\n\"",temp);\n}",WRONG_ANSWER,3,192
1590943745724452864,667c2e97e82c372f60661d46943ff56a17c9350387f4364ebabe70ac2e232862,2022-11-11 13:45:21,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,j;\n    int sum=0;\n    printf(\""输入一个整数n:\\n\"");\n    scanf(\""%d\"",&n);\n    if(n>=2&&n<=100000)\n    for(i=2;i<=n;i++)\n    {\n        for(j=2;j<i;j++)\n        {\n            if(i%j==0)\n                break;\n        }\n        if(j>=i)\n        {\n            sum++;\n\n        }\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,917,192
1590943760664559616,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 13:45:25,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\n\n\nint main()\n{\n    int t = 0;\n    scanf(\""%d \"",&t);\n    \n    while(t--)\n    {\n        int n = 0;\n        scanf(\""%d \"",&n);\n        getchar();\n        long long sum = (long long)pow(6,n);\n        int num = sum % 10;\n        printf(\""%d\\n\"",num);\n    }\n    return 0;\n}\n\n\n\n",WRONG_ANSWER,3,184
1590943801651302400,345826d11b41befc23adeb536e81da8eb6ec9a8bfb9448acf91422deedb8ba4a,2022-11-11 13:45:35,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,i,j,k=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n       {\n           j=0;\n        for(j=2;j<sqrt(i*1.0);j++)\n            {\n                if(i%j==0)\n                {\n                    break;\n                }\n                }\n            if(j>sqrt(i*1.0))\n               {\n                   k++;\n               }\n                }\n    printf(\""%d\"",k);\n}\n",ACCEPTED,13,308
1590943805824630784,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-11 13:45:36,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main(){\n    int n,i,temp=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n],sum=0;\n    for(i=0;i<n;i++)\n    {scanf(\""%d\"",&a[i]);}\n    for(i=0;i<n;i++)\n    {scanf(\""%d\"",&b[i]);}\n    for(i=0;i<n;i++){\n        c[i]=b[i]-a[i];\n    }\n  for(i=0;i<n;i++){\n       if(c[i>=0])\n\t   {\n\t   \tif(c[i]>=0) sum+=c[i];\n\t   \tif(temp<=sum)   {temp=sum;}\n\t\t   }\n\t   \n       if(c[i]<0) {\n      \n\t \t sum=0;\n\t     }\n     }\n     printf(\""%d\\n\"",temp);\n}",WRONG_ANSWER,3,196
1590943844236046336,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 13:45:45,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\n\n\nint main()\n{\n    int t = 0;\n    scanf(\""%d \"",&t);\n    getchar();\n    while(t--)\n    {\n        int n = 0;\n        scanf(\""%d \"",&n);\n        getchar();\n        long long sum = (long long)pow(6,n);\n        int num = sum % 10;\n        printf(\""%d\\n\"",num);\n    }\n    return 0;\n}\n\n\n\n",WRONG_ANSWER,4,564
1590943852947636224,919e6449799ef04f53dc21ab8608e866aab38f956abcadede4200c4c63859f1b,2022-11-11 13:45:47,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    int zu1[100];\n    int zu2[100];\n    int i;\n    int max=0;\n    int kk=-2147483648;\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&zu1[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&zu2[i]);\n        max=max+zu2[i]-zu1[i];\n        if(max>kk)\n            kk=max;\n    }\n    \n    \n        \n    printf(\""%d\"",kk);\n    return 0;\n}",WRONG_ANSWER,3,312
1590943853983633408,2a1cee132cc8344d51461f6cbf473fb80705d6fd5972f9a5d0fcfea0760fd8b1,2022-11-11 13:45:47,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint mynum1(int N)\n{\n    int i,a,b,c;\n    a=N%10;\n    b=N%4;\n    if(b==0)\n    {\n        b=4;\n    }\n    c=a;\n    for(i=1;i<=b-1;i++)\n    {\n        c=c*a;\n    }\n    c=c%10;\n    return c;\n}\nint main()\n{\n    int t,N,i;\n    scanf(\""%d\"",&t);\n    for(i=1;i<=t;i++)\n    {\n        scanf(\""%d\"",&N);\n        printf(\""%d\\n\"",mynum1(6));\n    }\n}\n",WRONG_ANSWER,10,320
1590943859620773888,005567a360a0c9b6f8e231cd1c8b4412544ad051819d303312c053cfc0049cc0,2022-11-11 13:45:49,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,class date{\n    public void static main(String args[]){\n        System.out.println(2022);\n    }\n},COMPILE_ERROR,0,0
1590943870974734336,33066437ddee11f609c900fe8dbd59cb8113e4d8dfd13c1812f199f4f3fdd334,2022-11-11 13:45:51,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n#define p 100\nint main()\n{\n    int t,i=1,n,j,k[p];\n    scanf(\""%d\"",&t);\n    while(i<=t)\n    {\n        scanf(\""%d\"",&n);\n        j=pow(6,n);\n        k[i]=j%10;\n        print(\""%d\"",k[i]);\n        i++;\n     }\n     return 0;\n}\n",COMPILE_ERROR,0,0
1590943887504506880,630b8bfc88107b488e158fc7108c8faf0a195f9b9030c3faf51edac625714584,2022-11-11 13:45:55,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main(){\nint t,i,k=0;\nscanf(\""%d\"",&t);\nint n[t],j[t];\nfor(i=0;i<t;i++){\n    scanf(\""%d\"",&n[i]);\n    if(n[i]==0) j[k++]=i;\n}\nk=0;\nfor(i=0;i<t;i++){\n    if(i==j[k]) {printf(\""1\"");k++;}\n    else printf(\""6\"");\n    if(i!=t-1) printf(\""\\n\"");\n}\n}",WRONG_ANSWER,2,188
1590943896383848448,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-11 13:45:57,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,a[100],i,b[100];\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    b[i]=pow(6,a[i]);\n    printf(\""%d\"",b[i]%10);\n    if(i!=n-1)\n    printf(\""\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,7,640
1590943916239683584,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 13:46:02,Java,0.0,1590524835191705600,1572865591226855424,1049226928954454016,import java.util.Scanner;\n\npublic class Main{\n    public static void main（String[] args){\n        Scanner sc = new Scanner(System.in);\n        \n        int x = sc.nextInt();\n        int y = sc.nextInt();\n        int z = sc.nextInt();\n        \n        int num = x +y -z;\n        System.out.println(num);\n}\n},COMPILE_ERROR,0,0
1590943936028389376,fa305ee4bf4c6a54add4e945b551f1e902b95c1a179a91ded55bf7ebb1c87c23,2022-11-11 13:46:07,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{  int t,n,i;\n     scanf(\""%d\"",&t);\n     for(i=0;i<t;i++){\n        scanf(\""%d\"",&n);\n        printf(\""6\"");\n         if(i!=t-1) printf(\""\\n\"");\n\n     }\n\n    return 0;\n}\n",WRONG_ANSWER,9,348
1590943939111202816,005567a360a0c9b6f8e231cd1c8b4412544ad051819d303312c053cfc0049cc0,2022-11-11 13:46:08,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"class date{\n    public void static main(String args[]){\n        System.out.println(\""2022\"");\n    }\n}",COMPILE_ERROR,0,0
1590943965019418624,29d1ea54d6e4e56fc2de0be5ae10ecc4c70c7fca667934b17857e95530f5663a,2022-11-11 13:46:14,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include<string.h>\nint main()\n{\n    int x,y,z,a;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    a=x+y-z;\n    printf(\""%d\"",a);\n    return 0;\n}",ACCEPTED,5,324
1590943965820555264,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-11 13:46:14,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[100],i,b[100];\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    b[i]=pow(6,a[i]);\n    printf(\""%d\"",b[i]%10);\n    if(i!=n-1)\n    printf(\""\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,6,344
1590944073232486400,919e6449799ef04f53dc21ab8608e866aab38f956abcadede4200c4c63859f1b,2022-11-11 13:46:40,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    int zu1[100];\n    int zu2[100];\n    int i;\n    int max=0;\n    int kk=-2147483648;\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&zu1[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&zu2[i]);\n        max=max+zu2[i]-zu1[i];\n        if(max>=kk)\n            kk=max;\n    }\n    \n    \n        \n    printf(\""%d\"",kk);\n    return 0;\n}",WRONG_ANSWER,3,192
1590944132028215296,005567a360a0c9b6f8e231cd1c8b4412544ad051819d303312c053cfc0049cc0,2022-11-11 13:46:54,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"class date{\n    public static void  main(String args[]){\n        System.out.println(\""2022\"");\n    }\n}",COMPILE_ERROR,0,0
1590944161015070720,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 13:47:00,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\nl = int(input())\ndata = list(map(eval,input().split()))\nfor i in range(l):\n    if 0<=data[i]<=1000000000 :\n        s=int(math.pow(6,data[i]))\n        s=str(s)\n        if i ==l-1:\n            print(s[-1],end=\""\"")\n        else:\n            print(s[-1])\n    else:\n        break",WRONG_ANSWER,33,2820
1590944170104127488,33066437ddee11f609c900fe8dbd59cb8113e4d8dfd13c1812f199f4f3fdd334,2022-11-11 13:47:03,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n#define p 100\nint main()\n{\n    int t,i=1,n,j,k[p];\n    scanf(\""%d\"",&t);\n    while(i<=t)\n    {\n        scanf(\""%d\"",&n);\n        j=pow(6,n);\n        k[i]=j%10;\n        printf(\""%d\"",k[i]);\n        printf(\""\\n\"");\n        i++;\n     }\n     return 0;\n}",WRONG_ANSWER,6,580
1590944273414029312,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-11 13:47:27,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main(){\n    int n,i,temp=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n],sum=0;\n    for(i=0;i<n;i++)\n    {scanf(\""%d\"",&a[i]);}\n    for(i=0;i<n;i++)\n    {scanf(\""%d\"",&b[i]);}\n    \n    for(i=0;i<n;i++){\n        c[i]=b[i]-a[i];\n    }\n    \n  for(i=0;i<n;i++){\n       if(c[i]>=0])\n\t   {\n\t   \tif(c[i]>=0) sum+=c[i];\n\t   \tif(temp<=sum)   {temp=sum;}\n\t }\n\t   \n       if(c[i]<0) {\n      \n\t \t sum=0;\n\t     }\n     }\n     printf(\""%d\\n\"",temp);\n}",COMPILE_ERROR,0,0
1590944302170181632,5d127211f3edce9d9bd1062c03cd08473e4481ec46b4b0c70c2e8d9141c68f20,2022-11-11 13:47:34,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,n,a[10],b[10],c[10],sum=0;\n    scanf(\""%d\"",&n);\n    for(n=0;n<10;n++)\n    scanf(\""%d\"",&a[n]);\n    for(n=0;n<10;n++)\n    scanf(\""%d\"",&b[n]);\n    for(i=0;i<n/2;i++)\n    {\n        c[i]=b[i]-a[i];\n        sum+=c[i];\n    }\n        printf(\""%d\"",sum);\n}",WRONG_ANSWER,3,308
1590944340267020288,005567a360a0c9b6f8e231cd1c8b4412544ad051819d303312c053cfc0049cc0,2022-11-11 13:47:43,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,class date{\n    public static void  main(String args[]){\n        System.out.println(2022);\n    }\n},COMPILE_ERROR,0,0
1590944340363513856,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-11 13:47:43,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main(){\n    int X,Y,Z;\n    scanf(\""请输入%d,%d,%d的值\""，&X，&Y，&Z)；\n    return X+Y-Z;\n}",COMPILE_ERROR,0,0
1590944349473517568,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-11 13:47:45,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[100],i,b[100];\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    b[i]=pow(6,a[i]);\n    printf(\""%d\"",b[i]%10);\n    if(i!=n-1)\n    printf(\""\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,5,324
1590944366183649280,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-11 13:47:49,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main(){\n    int n,i,temp=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n],sum=0;\n    for(i=0;i<n;i++)\n    {scanf(\""%d\"",&a[i]);}\n    for(i=0;i<n;i++)\n    {scanf(\""%d\"",&b[i]);}\n    \n    for(i=0;i<n;i++){\n        c[i]=b[i]-a[i];\n    }\n    \n  for(i=0;i<n;i++){\n       if(c[i]>=0)\n\t   {\n\t   \tif(c[i]>=0) sum+=c[i];\n\t   \tif(temp<=sum)   {temp=sum;}\n\t }\n\t   \n       if(c[i]<0) {\n      \n\t \t sum=0;\n\t     }\n     }\n     printf(\""%d\\n\"",temp);\n}",WRONG_ANSWER,3,196
1590944419602280448,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-11 13:48:02,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main(){\n    int n,i,temp=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n],sum=0;\n    for(i=0;i<n;i++)\n    {scanf(\""%d\"",&a[i]);}\n    for(i=0;i<n;i++)\n    {scanf(\""%d\"",&b[i]);}\n    \n    for(i=0;i<n;i++){\n        c[i]=b[i]-a[i];\n    }\n    \n  for(i=0;i<n;i++){\n       if(c[i]>=0)\n\t   {\n\t   \tif(c[i]>=0) sum+=c[i];\n\t   \tif(temp<=sum)   {temp=sum;}\n\t }\n\t   \n       if(c[i]<0) {\n      \n\t \t sum=0;\n\t     }\n     }\n     printf(\""%d\\n\"",temp);\n}",WRONG_ANSWER,3,184
1590944485855531008,2e4af98c441106efa9ee51f8a781d0eee91a3dff6193987d421eb3a48725c814,2022-11-11 13:48:18,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <iostream>\n\nusing namespace std;\n\nint main() {\n    int n, i;\n    scanf(\""%d\"", &n);\n    int a1[n], b1[n], c1[n];\n\n    for (int j = 0; j < n; ++j) {\n        scanf(\""%d\"", &a1[j]);\n    }\n    for (int j = 0; j < n; ++j) {\n        scanf(\""%d\"", &b1[j]);\n    }\n    for (i = 0; i < n; ++i) {\n        c1[i] = b1[i] - a1[i];\n    }\n\n    int j = 0, num = 0;\n    i = 0;\n    while (c1[i++] >= 0);\n    while (j < i-1) {\n        num = num + c1[j];\n        j++;\n    }\n\n\n    printf(\""%d\"", num);\n    return 0;\n}\n\n\n",WRONG_ANSWER,4,384
1590944501978431488,6b312558d54f4eeffd1aa510a96dd5882584f6bf7857d244f71013b7ec561920,2022-11-11 13:48:22,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n    int n,i;\n    int a[10],b[10],c[10];\n    scanf(\""%d\"",&n);\n    if(n==0)\n        printf(\""1\"");\n    else\n    {\n        for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n        b[i]=pow(6,a[i]);\n        c[i]=b[i]%10;\n        printf(\""%d\\n\"",c[i]);\n    }\n    }\n    return 0;\n}\n",WRONG_ANSWER,6,308
1590944521754554368,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 13:48:26,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\n\n\nint main()\n{\n    int t = 0;\n    scanf(\""%d \"",&t);\n    getchar();\n    while(t--)\n    {\n        int n = 0;\n        scanf(\""%d \"",&n);\n        getchar();\n        long long sum = (long long)pow(6,n);\n        int num = sum % 10;\n        if(t >= 1){\n            printf(\""%d\\n\"",num);\n        }\n        else{\n            printf(\""%d\"",num);\n        }\n    }\n    \n    return 0;\n}\n\n\n\n",WRONG_ANSWER,3,192
1590944553186689024,6b312558d54f4eeffd1aa510a96dd5882584f6bf7857d244f71013b7ec561920,2022-11-11 13:48:34,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n    int n,i;\n    int a[10],b[10],c[10];\n    scanf(\""%d\"",&n);\n    if(n==0)\n        printf(\""1\"");\n    else\n    {\n        for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n        b[i]=pow(6,a[i]);\n        c[i]=b[i]%10;\n        printf(\""%d\\n\"",c[i]);\n    }\n    }\n    return 0;\n}\n",WRONG_ANSWER,5,324
1590944575957565440,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 13:48:39,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\n\n\nint main()\n{\n    int t = 0;\n    scanf(\""%d \"",&t);\n\n    while(t--)\n    {\n        int n = 0;\n        scanf(\""%d \"",&n);\n        getchar();\n        long long sum = (long long)pow(6,n);\n        int num = sum % 10;\n        if(t >= 1){\n            printf(\""%d\\n\"",num);\n        }\n        else{\n            printf(\""%d\"",num);\n        }\n    }\n    \n    return 0;\n}\n\n\n\n",WRONG_ANSWER,3,324
1590944621595787264,1b00b3d29099722d8332b35e3af5e54fda309b4f7c9fc6261f618ecd2a4d7390,2022-11-11 13:48:50,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    printf(\""%d\"",X+Y-Z);\n    return 0;\n}",ACCEPTED,5,448
1590944623835525120,6b312558d54f4eeffd1aa510a96dd5882584f6bf7857d244f71013b7ec561920,2022-11-11 13:48:51,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n    int n,i;\n    int a[10],b[10],c[10];\n    scanf(\""%d\"",&n);\n    if(n==0)\n        printf(\""1\"");\n    else\n    {\n        for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n        b[i]=pow(6,a[i]);\n        c[i]=b[i]%10;\n        printf(\""%d\\n\"",c[i]);\n    }\n    }\n    return 0;\n}\n",WRONG_ANSWER,6,344
1590944627912388608,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-11 13:48:52,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main(){\n    int X,Y,Z;\n    scanf(\""请输入%d,%d,%d的值\"",&X,&Y,&Z);\n    return X+Y-Z;\n}",NON_ZERO_EXIT_CODE,4,324
1590944656681140224,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 13:48:59,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,include <stdio.h>\nint main(){\n    int x =scanf();\n    int y =scanf();\n    int z =scanf();\n    \n    int num = x +y -z;\n    printf(num);\n    return 0;\n},COMPILE_ERROR,0,0
1590944669339553792,05f9d62a2660f27e0711448c225e5e0fe6347745a2c93edb6296c0a2ffbc6605,2022-11-11 13:49:02,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int n,i,j,t;\n    int a[100],b[100],c[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n        c[i]=0;\n   for(i=0;i<n;i++)\n      for(j=0;j<=i;j++)\n          c[i]=c[i]+b[j]-a[j];\n    for(i=1;i<n;i++)\n        for(j=0;j<n-i;j++)\n            if(c[j]>c[j+1])\n    {\n        t=c[j];c[j]=c[j+1];c[j+1]=t;\n    }\n    printf(\""%d\"",c[n-1]);\n}\n",WRONG_ANSWER,3,312
1590944702667493376,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 13:49:10,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\n\n\nint main()\n{\n    int t = 0;\n    scanf(\""%d \"",&t);\n\n    while(t--)\n    {\n        int n = 0;\n        scanf(\""%d \"",&n);\n        getchar();\n        long long sum = (long long)pow(6,n);\n        int num = sum % 10;\n        if(t >= 1){\n            printf(\""%d\\n\"",num);\n        }\n        else{\n            printf(\""%d\"",num);\n        }\n    }\n    \n    return 0;\n}\n\n\n\n",WRONG_ANSWER,3,448
1590944712666710016,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 13:49:12,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,include<stdio.h>\nint main(){\n    int x =scanf();\n    int y =scanf();\n    int z =scanf();\n    \n    int num = x +y -z;\n    printf(num);\n    return 0;\n},COMPILE_ERROR,0,0
1590944821559230464,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 13:49:38,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"n = int(input())\nxh = list(map(eval,input().split()))\nhd = list(map(eval,input().split()))\ndata = []\nfor i in range(0,n):\n    s=0\n    for j in range(i,10):\n        s=s+hd[j]-xh[j]\n        data.append(s)\ndata.sort(reverse=True)\nprint(data[0])\n",WRONG_ANSWER,17,2756
1590944832250511360,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-11 13:49:40,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main(){\n    int n,i,temp=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n],sum=0;\n    for(i=0;i<n;i++)\n    {scanf(\""%d\"",&a[i]);}\n    for(i=0;i<n;i++)\n    {scanf(\""%d\"",&b[i]);}\n    \n    for(i=0;i<n;i++){\n        c[i]=b[i]-a[i];\n    }\n    \n  for(i=0;i<n;i++){\n       if(c[i]>=0)\n\t   {\n\t   \t sum+=c[i];\n\t   \tif(temp<=sum)   {temp=sum;}\n\t }\n\t   \n       if(c[i]<0) {\n      \n\t \t sum=0;\n\t     }\n     }\n     printf(\""%d\\n\"",temp);\n}",WRONG_ANSWER,3,316
1590944866106912768,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 13:49:49,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(){\n  int a[10],b[10],c[10],n,i,max=0;\n  scanf(\""%d\"",&n);\n  for(i=0;i<n;i++)\n  {\n      scanf(\""%d\"",&a[i]);\n  }\n   for(i=0;i<n;i++)\n  {\n      scanf(\""%d\"",&b[i]);\n  }\n  c[0]=b[0]-a[0];\n      max=c[0];\nfor(i=0;i<n;i++)\n  {\n      c[i+1]=c[i]+b[i+1]-a[i+1];\n    if(c[i]>max)\n    max=c[i];\n  }\n  printf(\""%d\"",max);\n}\n",RUNTIME_ERROR,3,356
1590944896050049024,23d287b80d4d430308a1b57ee92bb4f2d1b25d1142a13c1c0fda4316c9bb9f17,2022-11-11 13:49:56,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,a=int(input())\nb=list(input().split())\nfor i in b:\n   if b==0:\n        print(1)\n   else:\n        print(6),WRONG_ANSWER,46,2884
1590945008604196864,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 13:50:23,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t,i,j,sum,z;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<t;i++)\n    { sum=1;\n    for(j=0;j<a[i];j++)\n    sum=6*sum;\n    z=sum%10;\n    if(i<t-1)\n    printf(\""%d\\n\"",z);\n    else printf(\""%d\"",z);}\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,23,196
1590945014237171712,23d287b80d4d430308a1b57ee92bb4f2d1b25d1142a13c1c0fda4316c9bb9f17,2022-11-11 13:50:24,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\nb=list(map(int,input().split())\nfor i in b:\n   if b==0:\n        print(1)\n   else:\n        print(6)",NON_ZERO_EXIT_CODE,17,2908
1590945212686446592,23d287b80d4d430308a1b57ee92bb4f2d1b25d1142a13c1c0fda4316c9bb9f17,2022-11-11 13:51:11,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\nb=list(map(int,input().split()))\nfor i in b:\n   if b==0:\n        print(1)\n   else:\n        print(6)",WRONG_ANSWER,46,3028
1590945231506313216,55950e2d4c314feed0856fa0f6b80f22c5c36f2ebe0d75c8ee2cadb1a06b2fe1,2022-11-11 13:51:16,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main(){\n    \n    printf(\""%d\"",2022);\n    \n    \n    \n    \n    return 0;\n}",ACCEPTED,2,196
1590945238703738880,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-11 13:51:17,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main(){\n    int X,Y,Z;\n    scanf(\""请输入%d %d %d的值\"",&X,&Y,&Z);\n    return X+Y-Z;\n}",NON_ZERO_EXIT_CODE,4,200
1590945253278941184,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 13:51:21,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int a,b[n],c[n],i,j,d[n],t,sum=0;\n    sacnf(\""%d\"",&a);\n    for(i=0;i<a;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(j=0;j<a;j++)\n    {\n        sacnf(\""%d\"",&c[j]);\n    }\n    for(t=0;t<a;t++)\n    {\n        d[t]=b[t]-c[t];\n        if(d[t]>=0) sum+=d[t];\n    }\n    printf(\""%d\"",sum);\n}",COMPILE_ERROR,0,0
1590945258907676672,23d287b80d4d430308a1b57ee92bb4f2d1b25d1142a13c1c0fda4316c9bb9f17,2022-11-11 13:51:22,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\nb=list(map(int,input().split()))\nfor i in b:\n   if i==0:\n        print(1)\n   else:\n        print(6)",TIME_LIMIT_EXCEEDED,20,4300
1590945286321647616,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-11-11 13:51:29,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main(){\n    int n;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],i;\n    for(i=0;i<n;i++){\n    \tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=0;i<n;i++){\n    \tscanf(\""%d\"",&b[i]);\n\t}\n\tint c[n];\n\tfor(i=0;i<n;i++){\n\t\tc[i]=-a[i]+b[i];\n\t}\n\tint max=0;\n\tint m[n],j,k;\n\tfor(i=0;i<n;i++){\n\t\tfor(j=i;j<n;j++){\n            m[i]=0;\n\t\t\tfor(k=i;k<j;k++){\n                m[i]+=c[k];\n            }\n            if(m[i]<=0&&max==0) max=m[i];\n            else if(m[i]>=max) max=m[i];\n\t\t}\n\t}\n\tfor(i=0;i<n;i++){\n\t\tif(m[i]>=max) max=m[i];\n\t}\n\tprintf(\""%d\\n\"",max);\n}",ACCEPTED,3,184
1590945328487006208,005567a360a0c9b6f8e231cd1c8b4412544ad051819d303312c053cfc0049cc0,2022-11-11 13:51:39,Java,0.0,1590524835191705600,1572865591226855424,1049226928954454016,import java.util.Scanner\nclass sum{\n    public static void main(String args[]){\n         Scanner scan = new Scanner(System.in);\n         int x = scan.nextInt();\n          int y = scan.nextInt();\n           int z = scan.nextInt();\n           System.out.println(x+y-z);\n    }\n},COMPILE_ERROR,0,0
1590945336540073984,33066437ddee11f609c900fe8dbd59cb8113e4d8dfd13c1812f199f4f3fdd334,2022-11-11 13:51:41,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n#define p 100\nint main()\n{\n    int t,i=1,n,j,k[p];\n    scanf(\""%d\"",&t);\n    while(i<=t)\n    {\n        scanf(\""%d\"",&n);\n        j=pow(6,n);\n        k[i]=j%10;\n        printf(\""%d\"",k[i]);\n        if(i<t)\n        printf(\""\\n\"");\n        i++;\n     }\n     return 0;\n}",WRONG_ANSWER,4,332
1590945393943318528,23d287b80d4d430308a1b57ee92bb4f2d1b25d1142a13c1c0fda4316c9bb9f17,2022-11-11 13:51:54,Python,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\nb=list(map(int,input().split()))\nfor i in b:\n   if i==0:\n        print(1)\n   else:\n        print(6)",ACCEPTED,46,2752
1590945398619967488,667c2e97e82c372f60661d46943ff56a17c9350387f4364ebabe70ac2e232862,2022-11-11 13:51:56,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,j;\n    int sum=0;\n    printf(\""输入一个整数n:\\n\"");\n    scanf(\""%d\"",&n);\n    if(n>=2&&n<=100000)\n    {\n        for(i=2;i<=n;i++)\n    {\n        for(j=2;j<i;j++)\n        {\n            if(i%j==0)\n                break;\n        }\n        if(j>=i)\n        {\n            sum++;\n\n        }\n        }\n    }\n    else\n    {\n        printf(\""error\"");\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,952,348
1590945446929956864,7dd0c628805d8a6777ff5cc70a5ec79db9475f660782b2f4289ae98977303581,2022-11-11 13:52:07,Python,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"data = list(map(eval,input().split()))\ns = data[0]+data[1]-data[2]\nprint(s)",ACCEPTED,33,2752
1590945463702982656,e715137eeb4190ade2330123b989bbdd6eebd9a5e1df2e292271d3bfe3a79c69,2022-11-11 13:52:11,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    double n,a=1,i;\n    int k=2,j,b,c;\n    scanf(\""%lf\"",&n);\n    for(i=3;i<=n;i++)\n    {\n        a=1;\n        c=i;\n        b=sqrt(i);\n        for(j=b;j<c/2+1;j++)\n        {\n            if(c%j==0)\n            {\n\n                a=0;\n                break;\n            }\n        }\n        if(a)\n            k++;\n    }\n    printf(\""%d\\n\"",k);\n    return 0;\n}",TIME_LIMIT_EXCEEDED,1000,296
1590945467029065728,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 13:52:12,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(void)\n{\n    int t = 0;\n    scanf(\""%d\"",&t);\n    while(t--)\n    {\n        int n = 0;\n        scanf(\""%d\"",&n);\n        int sum = pow(6,n);\n        int num = sum % 10;\n        printf(\""%d\\n\"",num);\n    }\n    getchar();\n    return 0;\n}",WRONG_ANSWER,5,196
1590945475098906624,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 13:52:14,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int a,b[i],c[j],i,j,d[t],t,sum=0;\n    sacnf(\""%d\"",&a);\n    for(i=0;i<a;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(j=0;j<a;j++)\n    {\n        sacnf(\""%d\"",&c[j]);\n    }\n    for(t=0;t<a;t++)\n    {\n        d[t]=b[t]-c[t];\n        if(d[t]>=0) sum+=d[t];\n    }\n    printf(\""%d\"",sum);\n}",COMPILE_ERROR,0,0
1590945551200358400,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 13:52:32,Java,0.0,1590524835191705600,1572865591226855424,1049226928954454016,import java.util.Scanner;\n\npublic class Main{\n    public static void main（String[] args){\n        Scanner sc = new Scanner(System.in);\n        \n        int x = sc.nextInt();\n        int y = sc.nextInt();\n        int z = sc.nextInt();\n        \n        System.out.println( x+y-z);\n}\n},COMPILE_ERROR,0,0
1590945621081657344,5d127211f3edce9d9bd1062c03cd08473e4481ec46b4b0c70c2e8d9141c68f20,2022-11-11 13:52:49,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,n,a[10],b[10],c[10],sum=0;\n    scanf(\""%d\"",&n);\n    for(n=0;n<10;n++)\n    scanf(\""%d\"",&a[n]);\n    for(n=0;n<10;n++)\n    scanf(\""%d\"",&b[n]);\n    for(i=0;i<n;i++)\n    {\n        c[i]=b[i]-a[i];\n        if(c[i]>=0)\n        sum+=c[i];\n        else\n            break;\n    }\n        printf(\""%d\"",sum);\n}",WRONG_ANSWER,3,188
1590945720083984384,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 13:53:12,Java,0.0,1590524835191705600,1572865591226855424,1049226928954454016,import java.util.Scanner;\n\npublic class shux{\n    public static void Main（String[] args){\n        Scanner sc = new Scanner(System.in);\n        \n        int x = sc.nextInt();\n        int y = sc.nextInt();\n        int z = sc.nextInt();\n        \n        System.out.println( x+y-z);\n}\n},COMPILE_ERROR,0,0
1590945731110809600,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 13:53:15,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\n\n\nint main()\n{\n    int t = 0;\n    scanf(\""%d\"",&t);\n\n    while(t--)\n    {\n        int n = 0;\n        scanf(\""%d\"",&n);\n        getchar();\n        long long sum = (long long)pow(6,n);\n        int num = sum % 10;\n        if(t >= 1){\n            printf(\""%d\\n\"",num);\n        }\n        else{\n            printf(\""%d\"",num);\n        }\n    }\n    \n    return 0;\n}\n\n\n\n",WRONG_ANSWER,8,320
1590945771686526976,33066437ddee11f609c900fe8dbd59cb8113e4d8dfd13c1812f199f4f3fdd334,2022-11-11 13:53:24,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int t,i=1,n,j,k;\n    scanf(\""%d\"",&t);\n    while(i<=t)\n    {\n        scanf(\""%d\"",&n);\n        j=pow(6,n);\n        k=j%10;\n        printf(\""%d\"",k);\n        if(i<t)\n        printf(\""\\n\"");\n        i++;\n     }\n     return 0;\n}",WRONG_ANSWER,6,468
1590945794025369600,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 13:53:30,C++,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n\n\nint x,y,z;\nscanf(\""%d%d%d\"",&x,&y,&z);\nprintf(\""%d\"",x+y-z);\n",COMPILE_ERROR,0,0
1590945832109649920,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 13:53:39,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\n\n\nint main()\n{\n    int t = 0;\n    scanf(\""%d\"",&t);\n\n    while(t--)\n    {\n        int n = 0;\n        scanf(\""%d\"",&n);\n        getchar();\n        long long sum = (long long)pow(6,n);\n        int num = sum % 10;\n        printf(\""%d\\n\"",num);\n    }\n    \n    return 0;\n}\n\n\n\n",WRONG_ANSWER,7,460
1590945838002647040,7ecf54bf0ea2db8ab0397aa941f19ec79a351bc3e86e8c01673aa09a69b3a6db,2022-11-11 13:53:40,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"l = [2, 3]\nn = int(input())\nfor i in range(5, n+1):\n    for j in range(2, i//2+1):\n        if i % j == 0:\n            break\n    else:\n        l.append(i)\nprint(len(l))",TIME_LIMIT_EXCEEDED,1000,3024
1590945858009501696,6b312558d54f4eeffd1aa510a96dd5882584f6bf7857d244f71013b7ec561920,2022-11-11 13:53:45,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main() {\n    int t;\n    scanf(\""%d\"",&t);\n    int a[t],b[t];\n    for(int i=0;i<t;i++)\n        scanf(\""%d\"",&a[i]);\n    for(int i=0;i<t;i++)\n        scanf(\""%d\"",&b[i]);\n    int max1=-1, sum;\n    for(int i=0;i<t;i++){\n        sum=0;\n        for(int j=i;j<t;j++){\n            sum=sum-a[j]+b[j];\n            if(sum>max1)\n                max1=sum;\n        }\n    }\n    printf(\""%d\\n\"",max1);\n    return 0;\n}",ACCEPTED,4,188
1590945863747309568,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 13:53:46,Java,0.0,1590524835191705600,1572865591226855424,1049226928954454016,import java.util.Scanner;\n\npublic class shux{\n    public static void Main(String[] args){\n        Scanner sc = new Scanner(System.in);\n        \n        int x = sc.nextInt();\n        int y = sc.nextInt();\n        int z = sc.nextInt();\n        \n        System.out.println(x+y-z);\n}\n},COMPILE_ERROR,0,0
1590945876120481792,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 13:53:49,C++,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n\n\nint main(void)\n{\nint x,y,z;\nscanf(\""%d%d%d\"",&x,&y,&z);\nprintf(\""%d\"",x+y-z);\n}",ACCEPTED,6,184
1590945937751609344,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 13:54:04,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n    int t = 0;\n    scanf(\""%d\"", &t);\n    while (t--)\n    {\n        int n = 0;\n        scanf(\""%d\"", &n);\n        getchar();\n        long long sum = (long long)pow(6, n);\n        int num = sum % 10;\n        if (t >= 1) {\n            printf(\""%d\\n\"", num);\n        }\n        else {\n            printf(\""%d\"", num);\n        }\n    }\n\n    return 0;\n}\n\n\n\n",WRONG_ANSWER,4,196
1590945964398022656,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 13:54:10,Java,0.0,1590524835191705600,1572865591226855424,1049226928954454016,import java.util.Scanner;\n\npublic class Main{\n    public static void Main(String[] args){\n        Scanner sc = new Scanner(System.in);\n        \n        int x = sc.nextInt();\n        int y = sc.nextInt();\n        int z = sc.nextInt();\n        \n        System.out.println(x+y-z);\n}\n},WRONG_ANSWER,89,15060
1590946009990107136,8f29029dc8006da83949d2656cc7dc83026d851252066fd4a9fc89071673ec96,2022-11-11 13:54:21,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint n, i;\n\tscanf(\""%d\"", &n);\n\tif (n == 0)\n\t\tprintf(\""1\"");\n\telse\n\t{\n\t\tfor (i = 0; i < n; i++)\n\t\t\tprintf(\""6\\n\"");\n\t}\n}",WRONG_ANSWER,10,192
1590946014163439616,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 13:54:22,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n    int t = 0;\n    scanf(\""%d\"", &t);\n    getchar();\n    while (t--)\n    {\n        int n = 0;\n        scanf(\""%d\"", &n);\n        getchar();\n        long long sum = (long long)pow(6, n);\n        int num = sum % 10;\n        if (t >= 1) {\n            printf(\""%d\\n\"", num);\n        }\n        else {\n            printf(\""%d\"", num);\n        }\n    }\n\n    return 0;\n}\n\n\n\n",WRONG_ANSWER,6,312
1590946015736303616,64475a8ecd7d5a6c6e734f3f299283e039c26933b2a0e510cd9d22e95ba92068,2022-11-11 13:54:23,C++,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <bits/stdc++.h> \nusing namespace std;\n\n\nint main()\n{   \n\tcout<<\""2022\"";\n\t\n\treturn 0;\n}",ACCEPTED,4,440
1590946029246152704,b80fc2aed0abde15bdaa9327874c9784da696b6ed442d90001602ff2a017be15,2022-11-11 13:54:26,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n\tint a,b,c,d;\n\tscanf(\""%d %d %d\"",&a,&b,&c);\n\td=a+b-c; \n\tprintf(\""%d\"",d); \n    return 0;\n}",ACCEPTED,6,324
1590946142823710720,23d287b80d4d430308a1b57ee92bb4f2d1b25d1142a13c1c0fda4316c9bb9f17,2022-11-11 13:54:53,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"a=int(input())\ncount=0\nfor i in range(1,a);\n    m=0\n    for x in range(2,pow(i,0.5))\n        if i%x==0:\n            m=1\n            break\n     if m==0:\n        count+=1\nprint(count-1)\n        ",NON_ZERO_EXIT_CODE,16,3012
1590946144224612352,6a6dc7e644e57bb2c20b20d39bd4d9541bdebf6415e03e7c13707572c054673e,2022-11-11 13:54:53,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n   int a,b,c,d,i=6,m=6,n=6;\n   scanf(\""%d\\n\"",&a);\n   scanf(\""%d%d%d\"",&b,&c,&d);\n   printf(\""%d\\n%d\\n%d\\n\"",i,m,n);\n    return 0;\n}\n\n",WRONG_ANSWER,3,324
1590946181855883264,64475a8ecd7d5a6c6e734f3f299283e039c26933b2a0e510cd9d22e95ba92068,2022-11-11 13:55:02,C++,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <bits/stdc++.h> \nusing namespace std;\n\n\nint main()\n{   \n\tint a,b,c;\n\tcin>>a>>b>>c;\n\tcout<<a+b-c;\n\t\n\treturn 0;\n}",ACCEPTED,6,452
1590946188847808512,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-11 13:55:04,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main(){\n    int X,Y,Z;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    int f=X+Y-Z\n    return f;\n}",COMPILE_ERROR,0,0
1590946223618588672,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 13:55:12,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int a,i,j,t,sum=0;\n    sacnf(\""%d\"",&a);\n    int b[i],c[j],d[t];\n    for(i=0;i<a;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(j=0;j<a;j++)\n    {\n        sacnf(\""%d\"",&c[j]);\n    }\n    for(t=0;t<a;t++)\n    {\n        d[t]=b[t]-c[t];\n        if(d[t]>=0) sum+=d[t];\n    }\n    printf(\""%d\"",sum);\n}",COMPILE_ERROR,0,0
1590946271593041920,6a6dc7e644e57bb2c20b20d39bd4d9541bdebf6415e03e7c13707572c054673e,2022-11-11 13:55:24,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n   int a,b,c,d,i=6,m=6,n=6;\n   scanf(\""%d\\n\"",&a);\n   scanf(\""%d %d %d\"",&b,&c,&d);\n   printf(\""%d\\n%d\\n%d\\n\"",i,m,n);\n    return 0;\n}\n\n",WRONG_ANSWER,4,352
1590946291138498560,55950e2d4c314feed0856fa0f6b80f22c5c36f2ebe0d75c8ee2cadb1a06b2fe1,2022-11-11 13:55:28,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main(){\n    \n    int a,b,c,d;\n    d=a+b-c;\n    printf(\""%d\"",d);\n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    return 0;\n}",WRONG_ANSWER,3,308
1590946450308116480,55950e2d4c314feed0856fa0f6b80f22c5c36f2ebe0d75c8ee2cadb1a06b2fe1,2022-11-11 13:56:06,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main(){\n    \n    int a,b,c,d;\n    scanf(\""%d%d%d\"",&a,&b,&c);\n    d=a+b-c;\n    printf(\""%d\"",d);\n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    return 0;\n}",ACCEPTED,7,184
1590946459694968832,29d1ea54d6e4e56fc2de0be5ae10ecc4c70c7fca667934b17857e95530f5663a,2022-11-11 13:56:09,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include<string.h>\nint main()\n{\n   int n,a[10];\n    int i;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n        for(i=0;i<n;i++)\n    if(a[i]!=1)\n        printf(\""6\\n\"");\n\n    return 0;\n}\n",WRONG_ANSWER,12,340
1590946494339944448,29d1ea54d6e4e56fc2de0be5ae10ecc4c70c7fca667934b17857e95530f5663a,2022-11-11 13:56:17,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include<string.h>\nint main()\n{\n   int n,a[n];\n    int i;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n        for(i=0;i<n;i++)\n    if(a[i]!=1)\n        printf(\""6\\n\"");\n\n    return 0;\n}\n",WRONG_ANSWER,6,192
1590946537822294016,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-11 13:56:27,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main(){\n    int X,Y,Z;\n    scanf(\""%d\"",&X);\n    scanf(\""%d\"",&Y);\n    scanf(\""%d\"",&Z);\n    return X+Y-Z;\n}",NON_ZERO_EXIT_CODE,3,200
1590946577970167808,23d287b80d4d430308a1b57ee92bb4f2d1b25d1142a13c1c0fda4316c9bb9f17,2022-11-11 13:56:37,Python,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"\na = int(input())\ncount = 0\nfor i in range(1, a):\n    m = 0\n    for x in range(2, int(pow(i, 0.5))+1):\n        if i % x == 0:\n            m = 1\n            break\n    if m == 0:\n            count += 1\nprint(count - 1)\n",ACCEPTED,247,2884
1590946605111508992,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 13:56:43,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n    int t = 0;\n    scanf(\""%d\"", &t);\n    getchar();\n    while (t--)\n    {\n        int n = 0;\n        scanf(\""%d\"", &n);\n        getchar();\n        if(n > 0){\n            printf(\""6\\n\"");\n        }\n        else{\n            printf(\""1\\n\"");\n        }\n    }\n\n    return 0;\n}",WRONG_ANSWER,8,308
1590946613307179008,667c2e97e82c372f60661d46943ff56a17c9350387f4364ebabe70ac2e232862,2022-11-11 13:56:45,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,j;\n    int sum=0;\n    scanf(\""%d\"",&n);\n    if(n>=2&&n<=100000)\n    {\n        for(i=2;i<=n;i++)\n    {\n        for(j=2;j<i;j++)\n        {\n            if(i%j==0)\n                break;\n        }\n        if(j>=i)\n        {\n            sum++;\n\n        }\n        }\n    }\n    else\n    {\n        printf(\""error\"");\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",ACCEPTED,913,356
1590946637332152320,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 13:56:51,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n    int t = 0;\n    scanf(\""%d\"", &t);\n    //getchar();\n    while (t--)\n    {\n        int n = 0;\n        scanf(\""%d\"", &n);\n        getchar();\n        if(n > 0){\n            printf(\""6\\n\"");\n        }\n        else{\n            printf(\""1\\n\"");\n        }\n    }\n\n    return 0;\n}",WRONG_ANSWER,7,320
1590946671490543616,9819f13d6a58d50fa249ad037641119dadb52afb3f125db258771564f27d2ca5,2022-11-11 13:56:59,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main() {\n\tint n, i;\n\tscanf(\""%d\"", &n);\n\tdouble m = 6, j;\n\tint a[n];\n\tscanf(\""%lf\"", &j);\n\tfor (i = 0; i < n; i++) {\n\t\tdouble result = pow(m, j);\n\t\ta[i] = (int)result;\n\t}\n\tfor (i = 0; i < n; i++) {\n\t\tprintf(\""%d\"", a[i] % 10);\n\t\tif (i < n - 1) {\n\t\t\tprintf(\""\\n\"");\n\t\t}\n\t}\n\treturn 0;\n}",WRONG_ANSWER,4,456
1590946686812360704,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 13:57:03,Java,0.0,1590524835191705600,1572865591226855424,1049226928954454016,import java.util.Scanner;\n\npublic class Main{\n    public static void Main(String[] args){\n        Scanner sc = new Scanner(System.in);\n        \n        int x = sc.nextInt();\n        int y = sc.nextInt();\n        int z = sc.nextInt();\n        if((x>0 && x<=100) && (y>0 && y<=100) && (z>0 && z<=100)){\n            int num = x+y-z;\n        }\n        System.out.println(num);\n}\n},COMPILE_ERROR,0,0
1590946694429212672,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 13:57:04,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int x = 0, y = 0, z = 0;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    int sum = x + y - z;\n    printf(\""%d\"",sum);\n    return 0;\n}",ACCEPTED,7,324
1590946717879570432,b80fc2aed0abde15bdaa9327874c9784da696b6ed442d90001602ff2a017be15,2022-11-11 13:57:10,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n\tint a,b,i;\n\tscanf(\""%d\"",&a);\n\tscanf(\""%d\"",&b);\n   for(i=0;i<a;i++) \n\tprintf(\""6\\n\""); \n    return 0;\n}",WRONG_ANSWER,10,192
1590946748065976320,6a6dc7e644e57bb2c20b20d39bd4d9541bdebf6415e03e7c13707572c054673e,2022-11-11 13:57:17,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n   int a,b,c,d,i=6,m=6,n=6;\n   scanf(\""%d\\n\"",&a);\n   scanf(\""%d%d%d\"",&b,&c,&d);\n   printf(\""%d\\n%d\\n%d\\n\"",i,m,n);\n    return 0;\n}\n\n",WRONG_ANSWER,3,340
1590946768525791232,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 13:57:22,Java,0.0,1590524835191705600,1572865591226855424,1049226928954454016,import java.util.Scanner;\n\npublic class Main{\n    public static void Main(String[] args){\n        Scanner sc = new Scanner(System.in);\n        \n        int x = sc.nextInt();\n        int y = sc.nextInt();\n        int z = sc.nextInt();\n        int num = 0;\n        if((x>0 && x<=100) && (y>0 && y<=100) && (z>0 && z<=100)){\n            num = x+y-z;\n        }\n        System.out.println(num);\n}\n},WRONG_ANSWER,88,14928
1590946781649768448,6b312558d54f4eeffd1aa510a96dd5882584f6bf7857d244f71013b7ec561920,2022-11-11 13:57:25,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint n,i,j,b;\n\tscanf(\""%d\"",&n);\n\tfor(i=2;i<=n;i++)\n\t\t{\n\t\tfor(j=2;j<=i;j++)\n\t\t\tif(i%j==0)\n\t\t\t\tbreak;\n\t\tif(i==j)\n\t\t\tb++;\n\t\t}\n    printf(\""%d\"",b);\n}\n",ACCEPTED,944,376
1590946792538181632,6933dcb3592e2d6f6fc887ed9a5537aab21a30f76450c9b5043f7776bfc39a59,2022-11-11 13:57:28,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nvoid main(){\n    int n,i,j,result=0;\n    int k;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++){\n        for(j=2,k=1;j<=sqrt(i);j++){\n            if(i%j==0){\n                \n                k=0;\n                break;\n            }\n        }\n        if(k){\n            \n            result++;\n        }\n    }\n    printf(\""%d\"",result);\n}",ACCEPTED,15,320
1590946838319009792,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 13:57:39,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(){\n  int a[10],b[10],c[10],n,i,max=0;\n  scanf(\""%d\"",&n);\n  for(i=0;i<n;i++)\n  {\n      scanf(\""%d\"",&a[i]);\n  }\n   for(i=0;i<n;i++)\n  {\n      scanf(\""%d\"",&b[i]);\n  }\n  c[0]=b[0]-a[0];\n      max=c[0];\nfor(i=0;i<n;i++)\n  {\n      c[i+1]=c[i]+b[i+1]-a[i+1];\n    if(c[i]>max)\n    max=c[i];\n  }\n  printf(\""%d\"",max);\n    return 0;\n}\n",RUNTIME_ERROR,4,488
1590946854282530816,29d1ea54d6e4e56fc2de0be5ae10ecc4c70c7fca667934b17857e95530f5663a,2022-11-11 13:57:43,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include<string.h>\nint main()\n{\n   int n,a[100];\n    int i;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n        for(i=0;i<n;i++)\n    if(a[i]!=1)\n        printf(\""6\\n\"");\n\n    return 0;\n}\n",WRONG_ANSWER,8,196
1590946858376167424,7dd0c628805d8a6777ff5cc70a5ec79db9475f660782b2f4289ae98977303581,2022-11-11 13:57:44,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"data = list(map(input(),input(),input()))\ns = data[0]+data[1]-data[2]\nprint(s)",NON_ZERO_EXIT_CODE,17,2748
1590946892253560832,7dd0c628805d8a6777ff5cc70a5ec79db9475f660782b2f4289ae98977303581,2022-11-11 13:57:52,Python,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"data = list(map(eval,input().split()))\ns = data[0]+data[1]-data[2]\nprint(s)",ACCEPTED,33,2748
1590947029784768512,617f184ce583e9f7a346564ab5659fda0ca35a3a714a0c929cb07f915f4f514b,2022-11-11 13:58:24,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,a;\n    scanf(\""%d\"",&n);\n   while(n--)\n   {\n       scanf(\""%d\"",&a);\n       int t=a%4;\n       if(a%4==0)\n       {\n           t=4;\n       }\n       a%=10;\n       printf(\""6\\n\"");\n   }\n    return 0;\n}\n",WRONG_ANSWER,9,200
1590947059795013632,29d1ea54d6e4e56fc2de0be5ae10ecc4c70c7fca667934b17857e95530f5663a,2022-11-11 13:58:32,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include<string.h>\nint main()\n{\n   int n,a[10];\n    int i;\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]!=1)\n        printf(\""6\\n\"");\n    else \n        printf(\""1\\n\"");\n}\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590947091965349888,667c2e97e82c372f60661d46943ff56a17c9350387f4364ebabe70ac2e232862,2022-11-11 13:58:39,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int x,y,z;\n    int s;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    s=x+y-z;\n    printf(\""%d\\n\"",s);\n    return 0;\n}",ACCEPTED,6,348
1590947104300797952,29d1ea54d6e4e56fc2de0be5ae10ecc4c70c7fca667934b17857e95530f5663a,2022-11-11 13:58:42,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include<string.h>\nint main()\n{\n   int n,a[10];\n    int i;\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]!=1)\n        printf(\""6\\n\"");\n    else \n        printf(\""1\\n\"");\n}\n    return 0;\n}\n",WRONG_ANSWER,10,468
1590947122885734400,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-11 13:58:47,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main(){\n    int X,Y,Z;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    printf(\""%d\"",X+Y-Z);\n    return 0;\n}",ACCEPTED,6,328
1590947123028361216,e51465ce72346fac918042a342986433269a159492161f223a180a6e05d9a01a,2022-11-11 13:58:47,Java,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"public class Main {\n\tpublic static void main(String[] args) {\n\t\tint num =0,max=0,n=0;\n\t\tint [] WI= {1 ,2 ,3 ,4 ,5 ,6 ,7 ,8 ,9, 10};\n\t\tint [] WJ= {10, 9 ,8 ,7, 6 ,5 ,4 ,3, 2, 1};\n\t\tfor (int i = 0; i < WJ.length; i++) {\n\t\t\tnum+=WJ[i]-WI[i];\n\t\t\tif (max<num) {\n\t\t\t\tmax=num;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(max);\t\n\t}\n}",WRONG_ANSWER,66,14184
1590947182205775872,b80fc2aed0abde15bdaa9327874c9784da696b6ed442d90001602ff2a017be15,2022-11-11 13:59:01,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n\tint a,b,i;\n\tscanf(\""%d\"",&a);\n\tscanf(\""%d\"",&b);\n   for(i=0;i<a-1;i++) \n\tprintf(\""6\\n\"");\n   printf(\""6\""); \n    return 0;\n}",WRONG_ANSWER,10,344
1590947195807924224,29d1ea54d6e4e56fc2de0be5ae10ecc4c70c7fca667934b17857e95530f5663a,2022-11-11 13:59:04,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include<string.h>\nint main()\n{\n   int n,a[n];\n    int i;\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]!=1)\n        printf(\""6\\n\"");\n    else \n        printf(\""1\\n\"");\n}\n    return 0;\n}\n",WRONG_ANSWER,9,320
1590947253550907392,e9a50f3e071443bb6fb229966bff355c178d484f6cc10e5e1fc8dc5a537237ba,2022-11-11 13:59:18,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n    int i,max,b,j;\n   scanf(\""%d\"",&b);\n   int a[b],n[b];\n   int c[b][b];\n   for(i=0;i<2;i++)\n    for(j=0;j<b;j++)\n       scanf(\""%d\"",&c[i][j]);\n   for(i=0;i<b;i++)\n     a[i]=c[1][i]-c[0][i];\n   max=0;\n   for(i=0;i<b;i++)\n     n[i]=0;\n     n[0]=a[0];\n   for(i=1;i<b;i++)\n   {\n      if(n[i-1]>0)\n      n[i]=n[i-1]+a[i];\n      else\n        n[i]=a[i];\n      if(n[i]>max)\n        max=n[i];\n\n   }\n     printf(\""%d\"",max);\n}\n\n",ACCEPTED,2,192
1590947260488286208,ccc42b8437aa15d1214e4623799ed35cd8ea8087c26cb1b596d51ae4556ea39c,2022-11-11 13:59:19,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"a=eval(input())\nsums=0\nfor j in range(2,a+1):\n    for i in range(2,j):\n        if j%i==0:\n            sums+=1\n            break\nprint(a-sums-1)",TIME_LIMIT_EXCEEDED,1000,3060
1590947279060664320,e715137eeb4190ade2330123b989bbdd6eebd9a5e1df2e292271d3bfe3a79c69,2022-11-11 13:59:24,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int i,j,k,c=0,f=1,n;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n    {\n        f=1;\n        for(j=2;j<=sqrt(i);j++)\n        {\n            if(i%j==0)\n            {\n                f=0;\n                break;\n            }\n        }\n        if(f)\n        {\n            c++;\n        }\n    }\n    printf(\""%d\\n\"",c);\n    return 0;\n}",ACCEPTED,13,336
1590947348975517696,667c2e97e82c372f60661d46943ff56a17c9350387f4364ebabe70ac2e232862,2022-11-11 13:59:41,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,j;\n    int sum=0;\n    scanf(\""%d\"",&n);\n        for(i=2;i<=n;i++)\n    {\n        for(j=2;j<i;j++)\n        {\n            if(i%j==0)\n                break;\n        }\n        if(j>=i)\n        {\n            sum++;\n\n        }\n        }\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",COMPILE_ERROR,0,0
1590947360996397056,29d1ea54d6e4e56fc2de0be5ae10ecc4c70c7fca667934b17857e95530f5663a,2022-11-11 13:59:43,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include<string.h>\nint main()\n{\n   int n,a[n];\n    int i;\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]!=0)\n        printf(\""6\\n\"");\n    else \n        printf(\""1\\n\"");\n}\n    return 0;\n}\n",ACCEPTED,9,440
1590947389177921536,39afbda4ab6a7df2673bc0d0eec048a42b23ada2774ec941935a2b2fa044515a,2022-11-11 13:59:50,C++,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<iostream>\n#include<stdio.h>\nusing namespace std;\nint main(){\nint prime[100001];\nbool vis[100001];\nint cnt=0,n,q=0,p=0;\ncin>>n;\n\tfor(int i=2;i<=n;++i)\n\t{\n\t\tif(!vis[i])\n\t\t{\n\t\t    prime[cnt++]=i;\n\t\t    vis[i]=true;\n\t\t    }\n\t\tfor(int j=0;j<cnt;++j)\n\t\t{\n\t\t\tif(i*prime[j]>n)\n\t\t\t\tbreak;\n\t\t\tvis[i*prime[j]]=true;\n\t\t\tif(i%prime[j]==0)\n\t\t\t\tbreak;\n\t\t}\n\n\t}\n\twhile(prime[q]>1){\n        q++;\n        p++;\n\t}\n    cout<<p;\n}",ACCEPTED,12,588
1590947411495813120,6b312558d54f4eeffd1aa510a96dd5882584f6bf7857d244f71013b7ec561920,2022-11-11 13:59:55,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main() {\n    int t,i;\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++){\n        int n;\n        scanf(\""%d\"",&n);\n        if(n==0) n=1;\n        else n=6;\n        if(i==(t-1)){\n            printf(\""%d\"",n);\n        }else\n            printf(\""%d\\n\"",n);\n    }\n    return 0;\n}\n",ACCEPTED,11,320
1590947473005281280,19b1d22e5c87afa9233c236fc7b4d5e0e70acf3872968cbe9aae96e75e9e38d1,2022-11-11 14:00:10,Python,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"a=input()\nl=a.split(\"" \"")\nprint(int(l[0])+int(l[1])-int(l[2]))",ACCEPTED,31,2892
1590947532321128448,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-11 14:00:24,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,a[10],b[10],c[10],i,j,k,num=0;\n    scanf(\""%d\"",%n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(j=0;j<n;j++)\n        scanf(\""%d\"",&b[j]);\n    c[10]=a[10]-b[10];\n    num+=c[10];\n    printf(\""%d\"",num);\n    return 0;\n}",COMPILE_ERROR,0,0
1590947544321011712,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-11 14:00:27,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main(){\n    int x,y;\n    scanf(\""%d\"",&y);\n    for(int i=0;i<y;i++){\n        scanf(\""%d\"",&x);\n        x=(x==0?1:6);\n        printf(\""%d\\n\"",x);\n    }\n    \n    \n    \n    return 0;\n}",ACCEPTED,9,472
1590947559684747264,902d8082eea06043d392298983db4630cde4418ac8ee42282d537bfaae045c2f,2022-11-11 14:00:31,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"b=[]\na=eval(input())\nb=map(int,input().split(\"" \""))\nfor i in b :\n    c=6**i\n    d = str(c)\n    print(d[-1])",TIME_LIMIT_EXCEEDED,166,4004
1590947639896616960,86f702b052a21d7cb2f8cd933c678c21efaafaf5b2d35032f18ec35c1e26a945,2022-11-11 14:00:50,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int t,a,b,i,j;\n    int n[100];\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++)\n        scanf(\""%d\"",&n[i]);\n    for(i=0;i<t;i++)\n      {\n        a=pow(6,n[i]);\n        b=a%10;\n        printf(\""%d\"",b);\n        if(i<t-1)\n            printf(\""\\n\"");\n      }\n    return 0;\n}",WRONG_ANSWER,6,344
1590947642002178048,ccc42b8437aa15d1214e4623799ed35cd8ea8087c26cb1b596d51ae4556ea39c,2022-11-11 14:00:50,Python,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"a=eval(input())\nsums=0\nfor j in range(2,a+1):\n    for i in range(2,int(j**0.5)+1):\n        if j%i==0:\n            sums+=1\n            break\nprint(a-sums-1)",ACCEPTED,230,2928
1590947676592603136,9ca3f63f61fa4f349009d69e7059514c3a39dbdd5a1f94342c11f4c33ccdceaa,2022-11-11 14:00:59,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"x = int(input())\ny = input().split(\"" \"")\nz = input().split(\"" \"")\nb = c = -999\nfor j in range(x):\n    b = 0\n    for i in range(j,x):\n        a = int(z[i])-int(y[i])\n        if b == 0 and a<0:\n            b=a\n        if b + a > b:\n            b = b+a\n        if b + a < b:\n            break\n    if c < b:\n        c = b\nprint(c)\n",WRONG_ANSWER,15,2884
1590947735052816384,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-11 14:01:13,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,a[10],b[10],c[10],i,j,k,num=0;\n    scanf(\""%d\"",%n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(j=0;j<n;j++)\n        scanf(\""%d\"",&b[j]);\n    for(k=0;k<n;k++)\n    c[10]=a[i]-b[j];\n    num+=c[10];\n    printf(\""%d\"",num);\n    return 0;\n}",COMPILE_ERROR,0,0
1590947736726339584,33066437ddee11f609c900fe8dbd59cb8113e4d8dfd13c1812f199f4f3fdd334,2022-11-11 14:01:13,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int t,i=1,n,j,k,f=1;\n    while(f){\n        scanf(\""%d\"",&t);\n        if(t>=0&&t<=10^6)\n            f=0;\n    }\n\n    while(i<=t)\n    {\n        scanf(\""%d\"",&n);\n        j=pow(6,n);\n        k=j%10;\n        printf(\""%d\"",k);\n        if(i<t)\n        printf(\""\\n\"");\n        i++;\n     }\n     return 0;\n}\n",WRONG_ANSWER,7,208
1590947809338130432,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 14:01:30,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int a,i,j,t,sum=0;\n    scanf(\""%d\"",&a);\n    int b[i],c[j],d[t];\n    for(i=0;i<a;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(j=0;j<a;j++)\n    {\n        scanf(\""%d\"",&c[j]);\n    }\n    for(t=0;t<a;t++)\n    {\n        d[t]=b[t]-c[t];\n        if(d[t]>=0) sum+=d[t];\n    }\n    printf(\""%d\"",sum);\n}",WRONG_ANSWER,3,328
1590947908982190080,1019ea4e8e67338c8191b6e52878cb69ca9287130af71af3517596fded2f21e4,2022-11-11 14:01:54,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()//传入n判断n以内有多少个素数\n{\n\tint count = 0;//记录素数个数\n\tint i,j,n;\n\tint flag;//定义一个变量，若为合数，则该变量的值变为0\n\tscanf(\""%d\"",&n);\n\tn>=2&&n<=100000;\n\tfor (i = 2; i < n; i ++)\n\t{\n\t\tflag = 1;//先假定该数为素数\n\t\tfor (j = 2; j * j <= i; j ++)//也可以用sqrt()函数计算根号n(注意头文件的引用)\n\t\t{\n\t\t\tif (i % j == 0)//找到这个数的质因子\n\t\t\t{\n\t\t\t\tflag = 0;//flag==0说明这个数是合数\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (flag)\n\t\t\tcount++;\n\t}\n\tprintf(\""%d\\n\"", count);\n}\n",ACCEPTED,14,192
1590947917433712640,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 14:01:56,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main()\n{\n    int n,i;\n    scanf(\""%d\"",&n);\n    int x;\n    int cnt = 0;\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&x);\n        cnt++;\n        printf(\""6\"");\n        if(cnt!=n){\n            printf(\""\\n\"");\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,8,372
1590947918155157504,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 14:01:56,Python,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\nl = int(input())\ndata = list(map(eval,input().split()))\nfor i in range(l):\n    if i ==l-1:\n        if data[i]==0:\n            print(1,end=\""\"")\n        else:\n            print(6,end=\""\"")\n    else:\n        if data[i]==0:\n            print(1)\n        else:\n            print(6)",ACCEPTED,55,3012
1590948022257778688,23d287b80d4d430308a1b57ee92bb4f2d1b25d1142a13c1c0fda4316c9bb9f17,2022-11-11 14:02:21,Python,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"\na = int(input())\ndata1=list(map(int,input().split()))\ndata2=list(map(int,input().split()))\ndata=[]\nfor i in range(a):\n    data.append(data2[i]-data1[i])\n\ndef maxs(data:data):\n    max_data=[]\n    for i in range(a):\n        for x in range(i,a):\n            if x==i:\n                max_data.append(data[i])\n            else:\n                max_data.append(sum(data[i:x]))\n    return max(max_data)\nprint(maxs(data))\n",ACCEPTED,20,2884
1590948025919410176,40c43472973ea298adbdd1d4b900aeb63cfa4cfe17179f01a4827cd2c6624d3a,2022-11-11 14:02:22,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int g,n,sum=0,t,i;\n    scanf(\""%d\"",&t);\n    for(i=1;i<=t;i++)\n    {\n        scanf(\""%d\"",&n);\n    if(n==0)\n        sum=0;\n    else\n        sum=6;\n        printf(\""%d\\n\"",sum);\n    }\n}\n",WRONG_ANSWER,9,344
1590948063378739200,7e6a67f270e740aba8788a12d9a49939621a28d5059d3ced2247a86914b0a3b3,2022-11-11 14:02:31,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main(){\n    int n;\n    scanf(\""%d\"",&n);\n    int wi[n],wj[n],w[n],sum[n];\n    int i,max;\n    for(i=0;i<10;i++)\n        scanf(\""%d\"",&wi[i]);\n    for(i=0;i<10;i++)\n        scanf(\""%d\"",&wj[i]);\n\n    for(i=0;i<10;i++)\n    {\n        w[i]=wj[i]-wi[i];\n        if(i==0) sum[i]=w[i];\n            else sum[i]=w[i]+sum[i-1];\n    }\n    max=sum[0];\n    for(i=1;i<10;i++)\n    {\n       if(sum[i]>=max) max=sum[i];\n    }\n    printf(\""%d\"",max);\n}\n",WRONG_ANSWER,3,192
1590948066566385664,e51465ce72346fac918042a342986433269a159492161f223a180a6e05d9a01a,2022-11-11 14:02:32,Java,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tint num =0,max=0,n=0;\n\t\tScanner in = new Scanner(System.in);\n\t\tn=in.nextInt();\n\t\tint [] WI= new int [n];\n\t\tint [] WJ= new int [n];\n\t\tfor(int i = 0; i < WI.length; i++){\n\t\t\tWI[i] = in.nextInt();\n        }\n\t\tfor(int i = 0; i < WJ.length; i++){\n\t\t\tWJ[i] = in.nextInt();\n        }\n\t\tfor (int i = 0; i < WJ.length; i++) {\n\t\t\tnum+=WJ[i]-WI[i];\n\t\t\tif (max<num) {\n\t\t\t\tmax=num;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(max);\t\n\t}\n}",WRONG_ANSWER,122,16188
1590948284150124545,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 14:03:23,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int a,i,j,t,sum=0;\n    scanf(\""%d\"",&a);\n    int b[i],c[j],d[t];\n    for(i=0;i<a;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(j=0;j<a;j++)\n    {\n        scanf(\""%d\"",&c[j]);\n    }\n    for(t=0;t<a;t++)\n    {\n        d[t]=b[t]-c[t];\n        if(d[t]>=0) sum+=d[t];\n    }\n    printf(\""%d\\n\"",sum);\n}",WRONG_ANSWER,3,184
1590948333949091840,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-11 14:03:35,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main(){\n    int n,i,temp=0,flag=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n],sum=0;\n    for(i=0;i<n;i++)\n    {scanf(\""%d\"",&a[i]);}\n    for(i=0;i<n;i++)\n    {scanf(\""%d\"",&b[i]);}\n    \n    for(i=0;i<n;i++){\n        c[i]=b[i]-a[i];\n       if(c[i]>=0) flag++;\n    }\n    \n    if(flag==0){\n    \ttemp=c[0];\n\t for(i=1;i<n;i++)\n\t     {\n\t\t \tif(c[i]>temp) temp=c[i];\n\t\t }\n\t}\n    \n   \n   \n   if(flag){\n   \ttemp=0;\n  for(i=0;i<n;i++){\n       if(c[i]>=0)\n\t   {\n\t   \t sum+=c[i];\n\t   \tif(temp<=sum)   {temp=sum;}\n\t }\n\t   \n       if(c[i]<0) {\n\t \t sum=0;\n\t     }\n     }\n     }\n     printf(\""%d\\n\"",temp);\n}",WRONG_ANSWER,3,200
1590948377649545216,40c43472973ea298adbdd1d4b900aeb63cfa4cfe17179f01a4827cd2c6624d3a,2022-11-11 14:03:46,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int g,n,sum=0,t,i;\n    scanf(\""%d\"",&t);\n    for(i=1;i<=t;i++)\n    {\n        scanf(\""%d\"",&n);\n    if(n==0)\n        sum=1;\n    else\n        sum=6;\n        printf(\""%d\\n\"",sum);\n    }\n}\n",ACCEPTED,9,196
1590948419118632960,64475a8ecd7d5a6c6e734f3f299283e039c26933b2a0e510cd9d22e95ba92068,2022-11-11 14:03:56,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <bits/stdc++.h> \nusing namespace std;\n\nint main()\n{   \n\tint n,x,s = 0;\n\tcin>>n;\n\tfor(int i = 1; i <= n; i++)\n\t{\n\t\tcin>>x;\n\t\tif(x==0)\n\t\tcout<<\""1\""<<endl;\n\t\telse\n\t\tcout<<\""6\""<<endl;\n\t}\n\t\t\n\t\n\treturn 0;\n}",ACCEPTED,13,464
1590948437514846208,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-11 14:04:00,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <cmath.h>\nint main(){\n    int num,z,s;\n    scanf(\""%d\"",&num);\n    for(int i=0;i<num;i++)\n    {\n        scanf(\""%d\"",s);\n        z=pow(6,s);\n        printf(\""%d\\n\"",z%10);\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1590948444171210752,0c2907a154c1c61744366e94f73ae426665222ffae8eff7042dd0fd7bd8760fb,2022-11-11 14:04:02,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n\n\n{\nint n;\nint i;\nscanf(\""%d\"",&n);\n    int data[n];\nif(n==0)\nprintf(\""1\"");\nelse{\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&data[i]);\nfor(i=0;i<n;i++)\n  {if(data[i]==0&&n==1)\n      printf(\""1\"");\n    if(i==n-1&&data[i]!=0)\n        printf(\""6\"");\n        else if(data[i]==0)\n            printf(\""1\\n\"");\n   else\n            printf(\""6\\n\""); }}\n\nreturn 0;\n}\n",ACCEPTED,9,312
1590948521803583488,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 14:04:20,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(){\n  int a[100],b[100],c[100],n,i,max=0;\n  scanf(\""%d\"",&n);\n  for(i=0;i<n;i++)\n  {\n      scanf(\""%d\"",&a[i]);\n  }\n   for(i=0;i<n;i++)\n  {\n      scanf(\""%d\"",&b[i]);\n  }\n  c[0]=b[0]-a[0];\n      max=c[0];\nfor(i=0;i<n;i++)\n  {\n      c[i+1]=c[i]+b[i+1]-a[i+1];\n    if(c[i]>max)\n    max=c[i];\n  }\n  printf(\""%d\"",max);\n}\n",WRONG_ANSWER,3,188
1590948524701843456,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 14:04:21,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,imoprt java.time.*;\npublic class Main{\n    public static void Main(String[] args){\n        LocalDate today = LocalDate.now();\n        System.out.println(today.getYear());\n    }\n},COMPILE_ERROR,0,0
1590948532008300544,dcc1017bcd698bd6a0eee54e4ed848d4c51a3a26608990cdd2137e4c01065a1e,2022-11-11 14:04:23,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio,h>\nint main(){\n    int a =12\n    printf(\""%d\"",a)\n        return 0;\n}",COMPILE_ERROR,0,0
1590948541298708480,00d0a1b2e987c17fb50850b9ec54bf6b4f8b997eb053d1a9fed6c4888fbe74ed,2022-11-11 14:04:25,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,3,184
1590948551763472384,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-11 14:04:27,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int num,z,s;\n    scanf(\""%d\"",&num);\n    for(int i=0;i<num;i++)\n    {\n        scanf(\""%d\"",s);\n        z=pow(6,s);\n        printf(\""%d\\n\"",z%10);\n    }\n    return 0;\n}",TIME_LIMIT_EXCEEDED,3,312
1590948573489987584,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-11 14:04:32,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main(){\n    int n,i,temp=0,flag=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n],sum=0;\n    for(i=0;i<n;i++)\n    {scanf(\""%d\"",&a[i]);}\n    for(i=0;i<n;i++)\n    {scanf(\""%d\"",&b[i]);}\n    \n    for(i=0;i<n;i++){\n        c[i]=b[i]-a[i];\n       if(c[i]>=0) flag++;\n    }\n    \n    if(flag==0){\n    \ttemp=c[0];\n\t for(i=1;i<n;i++)\n\t     {\n\t\t \tif(c[i]<temp) temp=c[i];\n\t\t }\n\t}\n    \n   \n   \n   if(flag){\n   \ttemp=0;\n  for(i=0;i<n;i++){\n       if(c[i]>=0)\n\t   {\n\t   \t sum+=c[i];\n\t   \tif(temp<=sum)   {temp=sum;}\n\t }\n\t   \n       if(c[i]<0) {\n\t \t sum=0;\n\t     }\n     }\n     }\n     printf(\""%d\\n\"",temp);\n}",WRONG_ANSWER,3,192
1590948573620015104,dcc1017bcd698bd6a0eee54e4ed848d4c51a3a26608990cdd2137e4c01065a1e,2022-11-11 14:04:33,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio,h>\nint main(){\n    int a =12;\n    printf(\""%d\"",a);\n        return 0;\n}",COMPILE_ERROR,0,0
1590948578984505344,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 14:04:34,Python,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\ndate=list(map(int,input().split()))\nfor i in range(a):\n    if date[i]==0:\n        print(1)\n    else:\n        print(6)",ACCEPTED,53,2872
1590948586932736000,902d8082eea06043d392298983db4630cde4418ac8ee42282d537bfaae045c2f,2022-11-11 14:04:36,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"b=[]\na=eval(input())\nb=input()\nb=b.split(\"" \"")\nfor i in b :\n    c=6**int(i)\n    d = str(c)\n    print(d[-1])",TIME_LIMIT_EXCEEDED,170,3936
1590948590229434368,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-11 14:04:36,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main(){\n    int n,i,temp=0,flag=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n],sum=0;\n    for(i=0;i<n;i++)\n    {scanf(\""%d\"",&a[i]);}\n    for(i=0;i<n;i++)\n    {scanf(\""%d\"",&b[i]);}\n    \n    for(i=0;i<n;i++){\n        c[i]=b[i]-a[i];\n       if(c[i]>=0) flag++;\n    }\n    \n    if(flag==0){\n    \ttemp=c[0];\n\t for(i=1;i<n;i++)\n\t     {\n\t\t \tif(c[i]<temp) temp=c[i];\n\t\t }\n\t}\n    \n   \n   \n   if(flag){\n   \ttemp=0;\n  for(i=0;i<n;i++){\n       if(c[i]>=0)\n\t   {\n\t   \t sum+=c[i];\n\t   \tif(temp<=sum)   {temp=sum;}\n\t }\n\t   \n       if(c[i]<0) {\n\t \t sum=0;\n\t     }\n     }\n     }\n     printf(\""%d\\n\"",temp);\n}",WRONG_ANSWER,3,312
1590948645657161728,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 14:04:50,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,import java.time.*;\n\npublic class Main{\n    public static void Main(String[] args){\n        LocalDate today = LocalDate.now();\n        System.out.println(today.getYear());\n    }\n},WRONG_ANSWER,101,15956
1590948703018463232,42cfad7191c5e6c0eee156c4369182744d6c5db3bc2a5dc87f9f1be6ee4bbcfe,2022-11-11 14:05:03,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\nint main()\n{\n    printf(\""2882\"");\n    return 0;\n}",WRONG_ANSWER,4,332
1590948744781168640,dcc1017bcd698bd6a0eee54e4ed848d4c51a3a26608990cdd2137e4c01065a1e,2022-11-11 14:05:13,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio,h>\nint main(){\n    int a =12;\n    int x,y,z;\n    scanf(\""%d%d%d\"",&x,&y,&z)\n    printf(\""%d\"",a);\n        return 0;\n}",COMPILE_ERROR,0,0
1590948750753857536,0da8f2df2eb12ff7cceee22b87284a0e7794d94d4125226481c0842fbed3108a,2022-11-11 14:05:15,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    {\n    int a;\n    printf(\""今年是哪一年:\\n\"");\n    printf(\""%d\"",2022);\n\n    }\n    return 0;\n}",WRONG_ANSWER,3,188
1590948789089796096,42cfad7191c5e6c0eee156c4369182744d6c5db3bc2a5dc87f9f1be6ee4bbcfe,2022-11-11 14:05:24,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\nint main()\n{\n    printf(\""2822\"");\n    return 0;\n}",WRONG_ANSWER,3,192
1590948803715334144,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 14:05:27,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include \""stdafx.h\""\n#include <stdlib.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<n;i++)\n    {\n        for(int k=2;k<sprt(i);k++)\n        {\n            if(i%k==0)\n            {\n                break;\n            }\n        }\n        if(k>sprt(i))\n        {\n            j++;\n        }\n    }\n    printf(\""%d\"",j);\n}",COMPILE_ERROR,0,0
1590948859973537792,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 14:05:41,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<n;i++)\n    {\n        for(int k=2;k<sprt(i);k++)\n        {\n            if(i%k==0)\n            {\n                break;\n            }\n        }\n        if(k>sprt(i))\n        {\n            j++;\n        }\n    }\n    printf(\""%d\"",j);\n}",COMPILE_ERROR,0,0
1590948936368586752,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 14:05:59,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<n;i++)\n    {\n        for(int k=2;k<i;k++)\n        {\n            if(i%k==0)\n            {\n                break;\n            }\n        }\n        if(k>i)\n        {\n            j++;\n        }\n    }\n    printf(\""%d\"",j);\n}",COMPILE_ERROR,0,0
1590948963992276992,4d1157ac6ad50cfc6ca5d6b3e1c2dd7f1ecc593df10ff6888d4207a4f1c03a35,2022-11-11 14:06:06,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    cin>>2022;\n    return 0;\n}\n,COMPILE_ERROR,0,0
1590948974243151872,dcc1017bcd698bd6a0eee54e4ed848d4c51a3a26608990cdd2137e4c01065a1e,2022-11-11 14:06:08,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio,h>\nint main(){\n    int x,y,z;\n    scanf(\""%d%d%d\"",&x,&y,&z);\n        a=x+y-z;\n    printf(\""%d\"",a);\n        return 0;\n}",COMPILE_ERROR,0,0
1590949010918125568,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 14:06:17,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,k,j=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<n;i++)\n    {\n        for(int k=2;k<i;k++)\n        {\n            if(i%k==0)\n            {\n                break;\n            }\n        }\n        if(k>i)\n        {\n            j++;\n        }\n    }\n    printf(\""%d\"",j);\n}",WRONG_ANSWER,3,356
1590949016785977345,0da8f2df2eb12ff7cceee22b87284a0e7794d94d4125226481c0842fbed3108a,2022-11-11 14:06:18,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    {\n    printf(\""今年是哪一年:\\n\"");\n    printf(\""%d\"",2022);\n\n    }\n    return 0;\n}",WRONG_ANSWER,2,336
1590949051653226496,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 14:06:26,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,import java.time.*;\n\npublic class Main{\n    public static void Main(String[] args){\n        LocalDate today = LocalDate.now();\n        System.out.println(today.getYear());\n    }\n},WRONG_ANSWER,93,15036
1590949059697881088,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-11 14:06:28,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int num,z,s;\n    scanf(\""%d\"",&num);\n    for(int i=0;i<num;i++)\n    {\n        scanf(\""%d\"",s);\n        z=pow(6,s);\n        printf(\""%d\\n\"",z%10);\n    }\n    return 0;\n}",TIME_LIMIT_EXCEEDED,3,500
1590949104375631872,78ba72ad62bbe8306c8b3a9b0bcd998483fa2e9f5b653a39aaf1fbe6036a5c10,2022-11-11 14:06:39,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n \nint main(void)\n{\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,3,308
1590949109408772096,5a1c17b308a3b3595833d34c6bdfb75e9f5dd0d065acfeb7f28ab8102ba7406c,2022-11-11 14:06:40,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main()\n{\n    int n,i;\n    scanf(\""%d\"",&n);\n    int x;\n    int cnt = 0;\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&x);\n        cnt++;\n        if(x==0){\n            printf(\""1\"");\n        }else{\n        printf(\""6\"");\n        }\n        if(cnt!=n){\n            printf(\""\\n\"");\n        }\n    }\n    return 0;\n}\n",ACCEPTED,13,356
1590949123304525824,42cfad7191c5e6c0eee156c4369182744d6c5db3bc2a5dc87f9f1be6ee4bbcfe,2022-11-11 14:06:44,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,3,192
1590949133005946880,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 14:06:46,Java,0.0,1590524835191705600,1572865591226855424,1049226928954454016,import java.util.Scanner;\n\npublic class Main{\n    public static void Main(String[] args){\n        Scanner sc = new Scanner(System.in);\n        \n        int x = sc.nextInt();\n        int y = sc.nextInt();\n        int z = sc.nextInt();\n        int num = 0;\n        if((x>0 && x<=100) && (y>0 && y<=100) && (z>0 && z<=100)){\n            num = x+y-z;\n        }\n        System.out.println(num);\n}\n},WRONG_ANSWER,96,14920
1590949190300119040,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-11 14:07:00,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nvoid main(){\n    int num,z,s;\n    scanf(\""%d\"",&num);\n    for(int i=0;i<num;i++)\n    {\n        scanf(\""%d\"",s);\n        z=pow(6,s);\n        printf(\""%d\\n\"",z%10);\n    }\n}",TIME_LIMIT_EXCEEDED,3,324
1590949256603676672,0da8f2df2eb12ff7cceee22b87284a0e7794d94d4125226481c0842fbed3108a,2022-11-11 14:07:15,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    {\n    printf(\""%d\"",2022);\n\n    }\n    return 0;\n}",ACCEPTED,4,308
1590949266225430528,00d0a1b2e987c17fb50850b9ec54bf6b4f8b997eb053d1a9fed6c4888fbe74ed,2022-11-11 14:07:18,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n\n\nint main(){\n    int X,Y,Z;\n    scanf(\""%d,%d,%d\"",&X,&Y,&Z);\n    printf(\""%d\"",X+Y-Z);\n    return 0;\n}",WRONG_ANSWER,3,192
1590949290669838336,86f702b052a21d7cb2f8cd933c678c21efaafaf5b2d35032f18ec35c1e26a945,2022-11-11 14:07:23,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int t,a,b,i,j;\n    int n[10000000000];\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++)\n        scanf(\""%d\"",&n[i]);\n    for(i=0;i<t;i++)\n      {\n        a=pow(6,n[i]);\n        b=a%10;\n        printf(\""%d\\n\"",b);\n      }\n    return 0;\n}",TIME_LIMIT_EXCEEDED,3,460
1590949317525966848,33066437ddee11f609c900fe8dbd59cb8113e4d8dfd13c1812f199f4f3fdd334,2022-11-11 14:07:30,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int t,i=1,n,j,k,f=1;\n    while(f){\n        scanf(\""%d\"",&t);\n        if(t>0)\n            f=0;\n    }\n\n    while(i<=t)\n    {\n        scanf(\""%d\"",&n);\n        j=6^n;\n        k=j%10;\n        printf(\""%d\"",k);\n        if(i<t)\n        printf(\""\\n\"");\n        i++;\n     }\n     return 0;\n}\n",WRONG_ANSWER,3,344
1590949320893968384,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 14:07:31,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"n = int(input())\nxh = list(map(eval,input().split()))\nhd = list(map(eval,input().split()))\ndata = []\nfor i in range(0,n):\n    s=0\n    for j in range(i,10):\n        s=s+hd[j]-xh[j]\n        data.append(s)\ndata.sort(reverse=True)\nprint(data[0])\n",WRONG_ANSWER,18,2880
1590949332893872128,86f702b052a21d7cb2f8cd933c678c21efaafaf5b2d35032f18ec35c1e26a945,2022-11-11 14:07:34,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int t,a,b,i,j;\n    int n[1000000];\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++)\n        scanf(\""%d\"",&n[i]);\n    for(i=0;i<t;i++)\n      {\n        a=pow(6,n[i]);\n        b=a%10;\n        printf(\""%d\\n\"",b);\n      }\n    return 0;\n}",WRONG_ANSWER,6,316
1590949334739390464,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 14:07:34,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"n = int(input())\nxh = list(map(eval,input().split()))\nhd = list(map(eval,input().split()))\ndata = []\nfor i in range(0,n):\n    s=0\n    for j in range(i,10):\n        s=s+hd[j]-xh[j]\n        data.append(s)\ndata.sort(reverse=True)\nprint(data[0])\n",WRONG_ANSWER,18,2748
1590949352149946368,00d0a1b2e987c17fb50850b9ec54bf6b4f8b997eb053d1a9fed6c4888fbe74ed,2022-11-11 14:07:38,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n\n\nint main(){\n    int X,Y,Z;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    printf(\""%d\"",X+Y-Z);\n    return 0;\n}",ACCEPTED,7,328
1590949357296357376,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 14:07:39,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n\n#include<math.h>\n\n\n\nint main()\n{\n    int n,i;\n    scanf(\""%d\"",&n);\n    int x;\n    int cnt = 0;\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&x);\n        cnt++;\n        if(n == 0){\n            printf(\""0\"");\n        }\n        else{\n            printf(\""6\"");\n        }\n        \n        if(cnt!=n){\n            printf(\""\\n\"");\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,10,472
1590949363898167296,7e6a67f270e740aba8788a12d9a49939621a28d5059d3ced2247a86914b0a3b3,2022-11-11 14:07:41,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main(){\n    int n;\n    scanf(\""%d\"",&n);\n    int wi[n],wj[n],w[n],sum[n];\n    int i,max;\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&wi[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&wj[i]);\n\n    for(i=0;i<n;i++)\n    {\n        w[i]=wj[i]-wi[i];\n        if(i==0) sum[i]=w[i];\n            else sum[i]=w[i]+sum[i-1];\n    }\n    max=sum[0];\n    for(i=1;i<n;i++)\n    {\n       if(sum[i]>=max) max=sum[i];\n    }\n    printf(\""%d\"",max);\n}\n",WRONG_ANSWER,2,192
1590949431283855360,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 14:07:57,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n\n#include<math.h>\n\n\n\nint main()\n{\n    int n,i;\n    scanf(\""%d\"",&n);\n    int x;\n    int cnt = 0;\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&x);\n        cnt++;\n        if(x == 0){\n            printf(\""1\"");\n        }\n        else{\n            printf(\""6\"");\n        }\n        if(cnt!=n){\n            printf(\""\\n\"");\n        }\n    }\n    return 0;\n}\n",ACCEPTED,9,324
1590949440733622272,5d127211f3edce9d9bd1062c03cd08473e4481ec46b4b0c70c2e8d9141c68f20,2022-11-11 14:07:59,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,j,k,n,sum=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n];\n    for(j=0;j<n;j++)\n    scanf(\""%d\"",&a[j]);\n    for(k=0;k<n;k++)\n    scanf(\""%d\"",&b[k]);\n    for(i=0;i<n;i++)\n    {\n        c[i]=b[i]-a[i];\n        if(c[i]>=0)\n        sum+=c[i];\n        else\n            break;\n    }\n        printf(\""%d\\n\"",sum);\n}",WRONG_ANSWER,3,196
1590949483775569920,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-11 14:08:10,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nvoid main(){\n    int num,s;\n    scanf(\""%d\"",&num);\n    for(int i=0;i<num;i++)\n    {\n        scanf(\""%d\"",s);\n        printf(\""%d\\n\"",pow(6,s)%10);\n    }\n}",COMPILE_ERROR,0,0
1590949503870480384,4d1157ac6ad50cfc6ca5d6b3e1c2dd7f1ecc593df10ff6888d4207a4f1c03a35,2022-11-11 14:08:14,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590949506819100672,64475a8ecd7d5a6c6e734f3f299283e039c26933b2a0e510cd9d22e95ba92068,2022-11-11 14:08:15,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<bits/stdc++.h> \nusing namespace std;\n\nbool isprime[100000010];\nint prime[6000010];\nint sum = 0; \n\nvoid getprime(int n)\n{\n\tint i,j;\n\tmemset(isprime, 1 , sizeof(isprime));\n\n\tisprime[1] = 0;\n\tfor(i = 2; i <= n; i++)  \n\t{\n\t\tif(isprime[i]) \n\t\tprime[++sum] = i; \n\t\tfor(j = 1; j<=sum && i*prime[j] <= n; j++) \n\t\t{\n\t\t\tisprime[i*prime[j]] = 0; \n\t\t\t\n\t\t\tif(i % prime[j] == 0)\n\t\t\tbreak;\n\t\t}\n\t}\n}\n\n\nint main()\n{\n\tint n;\n\t\n\tscanf(\""%d\"",&n);\n\t\n\tgetprime(n);\n\t\n\tprintf(\""%d\"",sum);\n\t\n\treturn 0;\n}\n",MEMORY_LIMIT_EXCEEDED,70,65536
1590949537257140224,dcc1017bcd698bd6a0eee54e4ed848d4c51a3a26608990cdd2137e4c01065a1e,2022-11-11 14:08:22,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main(){\n    int x,y,z;\n    int a=0;\n    scanf(\""%d%d%d\"",&x,&y,&z);\n        a=x+y-z;\n    printf(\""%d\\n\"",a);\n        return 0;\n}",ACCEPTED,6,332
1590949558996217856,64475a8ecd7d5a6c6e734f3f299283e039c26933b2a0e510cd9d22e95ba92068,2022-11-11 14:08:27,C++,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<bits/stdc++.h> \nusing namespace std;\n\nbool isprime[1000010];\nint prime[600010];\nint sum = 0; \n\nvoid getprime(int n)\n{\n\tint i,j;\n\tmemset(isprime, 1 , sizeof(isprime));\n\n\tisprime[1] = 0;\n\tfor(i = 2; i <= n; i++)  \n\t{\n\t\tif(isprime[i]) \n\t\tprime[++sum] = i; \n\t\tfor(j = 1; j<=sum && i*prime[j] <= n; j++) \n\t\t{\n\t\t\tisprime[i*prime[j]] = 0; \n\t\t\t\n\t\t\tif(i % prime[j] == 0)\n\t\t\tbreak;\n\t\t}\n\t}\n}\n\n\nint main()\n{\n\tint n;\n\t\n\tscanf(\""%d\"",&n);\n\t\n\tgetprime(n);\n\t\n\tprintf(\""%d\"",sum);\n\t\n\treturn 0;\n}\n",ACCEPTED,10,1476
1590949581498658816,902d8082eea06043d392298983db4630cde4418ac8ee42282d537bfaae045c2f,2022-11-11 14:08:33,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"b=[]\nc=6\na=eval(input())\nb=input()\nb=b.split(\"" \"")\nfor i in b :\n    for j in range(int(i)):\n        c =c*6\n    d = str(c)\n    print(d[-1])\n\n",TIME_LIMIT_EXCEEDED,168,3040
1590949605209079808,19b1d22e5c87afa9233c236fc7b4d5e0e70acf3872968cbe9aae96e75e9e38d1,2022-11-11 14:08:38,Python,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"a = int(input())\nb = input()\nl = b.split(\"" \"")\nfor i in l:\n    if int(i) == 0:\n        print(1)\n    else:\n        print(6)",ACCEPTED,49,2908
1590949635127029760,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 14:08:46,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n\n#include<math.h>\n\n\n\nint main()\n{\n    int t = 0;\n    scanf(\""%d\"", &t);\n    while (t--)\n    {\n        int n = 0;\n        scanf(\""%d\"", &n);\n        getchar();\n        if (n >= 1) {\n            printf(\""6\"");\n        }\n        else {\n            printf(\""1\"");\n        }\n        if(t != 0){\n            printf(\""\\n\"");\n        }\n    }\n\n    return 0;\n}",WRONG_ANSWER,6,352
1590949654672506880,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-11 14:08:50,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n\n#define M 100\n\nint main()\n\n{\n\n    int n,a[M],b[M],c[M],i,max;\n\n    scanf(\""%d\"",&n);\n\n    for(i=1;i<=n;i++)\n\n    scanf(\""%d\"",&a[i]);\n\n    for(i=1;i<=n;i++)\n\n    scanf(\""%d\"",&b[i]);\n\n    for(i=1;i<=n;i++)\n\n    {\n\n    c[0]=0;\n\n    c[i]=b[i]-a[i]+c[i-1];\n\n    }\n\n    for(i=1;i<=n;i++)\n\n    if(c[i]>c[i-1])\n\n    max=c[i];\n\n    printf(\""%d\"",max);\n\n    return 0;\n\n}",WRONG_ANSWER,2,316
1590949666622058496,6a6dc7e644e57bb2c20b20d39bd4d9541bdebf6415e03e7c13707572c054673e,2022-11-11 14:08:53,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,i=0,b,c,d;\n    scanf(\""%d\\n\"",&a,&b,&c,&d);\n    for(i=0;i<a;i++)\n    {\n        printf(\""6\\n\"");\n    }\n  return 0;\n\n}\n\n\n\n",WRONG_ANSWER,11,308
1590949670350794752,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 14:08:54,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n\n#include<math.h>\n\n\n\nint main()\n{\n    int t = 0;\n    scanf(\""%d\"", &t);\n    while (t--)\n    {\n        int n = 0;\n        scanf(\""%d\"", &n);\n       \n        if (n >= 1) {\n            printf(\""6\"");\n        }\n        else {\n            printf(\""1\"");\n        }\n        if(t != 0){\n            printf(\""\\n\"");\n        }\n    }\n\n    return 0;\n}",WRONG_ANSWER,7,180
1590949692375105536,64b76cc355daf11e96a19b338c58e56c05289d7e3809e9695a09e71771618713,2022-11-11 14:08:59,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n   int i=2022;\n    \n   scanf(\""%d\"",&i);\n    printf(\""%d\"",i);\n\n\nreturn 0;\n   }\n",ACCEPTED,3,180
1590949737749086208,55950e2d4c314feed0856fa0f6b80f22c5c36f2ebe0d75c8ee2cadb1a06b2fe1,2022-11-11 14:09:10,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main(){\n    \n    int a,b[100],c[100],i,j;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++){\n        scanf(\""%d\"",&b[i]);\n        \n    }\n    for(j=0;j<i;j++){\n        c[j]=b[i]%10;\n        print(\""%d\\n\"",c[j]);\n        \n        \n    }\n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    return 0;\n}",COMPILE_ERROR,0,0
1590949758666059776,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-11 14:09:15,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n\n#define M 100\n\nint main()\n\n{\n\n    int n,a[M],b[M],c[M],i,max;\n\n    scanf(\""%d\"",&n);\n\n    for(i=1;i<=n;i++)\n\n    scanf(\""%d\"",&a[i]);\n\n    for(i=1;i<=n;i++)\n\n    scanf(\""%d\"",&b[i]);\n\n    for(i=1;i<=n;i++)\n\n    {\n\n    c[0]=0;\n\n    c[i]=b[i]-a[i]+c[i-1];\n\n    }\n\n    for(i=1;i<=n;i++)\n\n    if(c[i]>c[i-1])\n\n    max=c[i];\n\n    printf(\""%d\\n\"",max);\n\n    return 0;\n\n}",WRONG_ANSWER,3,348
1590949856636637184,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 14:09:38,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n/*#include <math.h>\nint main(void)\n{\n    int t = 0;\n    scanf(\""%d\"",&t);\n    while(t--)\n    {\n        int n = 0;\n        scanf(\""%d\"",&n);\n        int sum = pow(6,n);\n        int num = sum % 10;\n        printf(\""%d\\n\"",num);\n    }\n    getchar();\n    return 0;\n}*/\nint main()\n{\n    int t = 0;\n    scanf(\""%d\"",&t);\n    while(t--)\n    {\n        int n = 0;\n        scanf(\""%d\"",&n);\n        if(n == 0)\n        {\n            printf(\""1\\n\"");\n        }\n        else\n        {\n            printf(\""6\\n\"")\n        }\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1590949864484155392,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 14:09:40,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"a=int(input())\ncount=0\nfor i in range(1,a):\n    m=0\n    for x in range(1,int(pow(i,0.5))+1):\n        if i%x==0:\n            m=1\n            break\n    if m==0:\n        count+=1\nprint(count-1)",WRONG_ANSWER,75,2876
1590949889679339520,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-11 14:09:46,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int num,s;\n    scanf(\""%d\"",&num);\n    for(int i=0;i<num;i++)\n    {\n        scanf(\""%d\"",&s);\n        int z=pow(6,s);\n        printf(\""%d\\n\"",z%10);\n    }\n    return 0;\n}",WRONG_ANSWER,8,324
1590949906351718400,6a6dc7e644e57bb2c20b20d39bd4d9541bdebf6415e03e7c13707572c054673e,2022-11-11 14:09:50,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    int a,i=0,b,c,d;\n    scanf(\""%d\\n%d %d %d\"",&a,&b,&c,&d);\n    for(i=0;i<a;i++)\n    {\n        printf(\""6\\n\"");\n    }\n  return 0;\n\n}\n\n\n\n",WRONG_ANSWER,9,352
1590950017848905728,fa305ee4bf4c6a54add4e945b551f1e902b95c1a179a91ded55bf7ebb1c87c23,2022-11-11 14:10:17,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{  int t,n,i;\n     scanf(\""%d\"",&t);\n     for(i=0;i<t;i++){\n        scanf(\""%d\"",&n);\n         if(n==0) printf(\""1\"");\n        else  printf(\""6\"");\n         if(i!=t-1) printf(\""\\n\"");\n\n     }\n\n    return 0;\n}\n",ACCEPTED,10,360
1590950052728737792,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-11 14:10:25,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#define M 100\nint main()\n{\n    int n,a[M],b[M],c[M],i,max;\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=1;i<=n;i++)\n    scanf(\""%d\"",&b[i]);\n    for(i=1;i<=n;i++)\n    {\n    c[0]=0;\n    c[i]=b[i]-a[i]+c[i-1];\n    }\n    for(i=1;i<=n;i++)\n    if(c[i]>c[i-1])\n    max=c[i];\n    printf(\""%d\\n\"",max);\n    return 0;\n}",WRONG_ANSWER,2,204
1590950069388509184,6a6dc7e644e57bb2c20b20d39bd4d9541bdebf6415e03e7c13707572c054673e,2022-11-11 14:10:29,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int a,i=0,b,c,d;\n    scanf(\""%d\\n\"",&a);\n    for(i=0;i<a;i++)\n    {\n        printf(\""6\\n\"");\n    }\n  return 0;\n\n}\n\n\n\n",WRONG_ANSWER,10,336
1590950099071602688,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 14:10:36,Python,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"a=int(input())\ncount=0\nfor i in range(2,a):\n    m=0\n    for x in range(2,int(pow(i,0.5))+1):\n        if i%x==0:\n            m=1\n            break\n    if m==0:\n        count+=1\nprint(count)",ACCEPTED,242,2960
1590950120886153216,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 14:10:41,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n/*#include <math.h>\nint main(void)\n{\n    int t = 0;\n    scanf(\""%d\"",&t);\n    while(t--)\n    {\n        int n = 0;\n        scanf(\""%d\"",&n);\n        int sum = pow(6,n);\n        int num = sum % 10;\n        printf(\""%d\\n\"",num);\n    }\n    getchar();\n    return 0;\n}*/\nint main()\n{\n    int t = 0;\n    scanf(\""%d\"",&t);\n    while(t--)\n    {\n        int n = 0;\n        scanf(\""%d\"",&n);\n        if(n == 0)\n        {\n            printf(\""1\\n\"");\n        }\n        else\n        {\n            printf(\""6\\n\"");\n        }\n    }\n    return 0;\n}",ACCEPTED,10,324
1590950129828433920,eee658ba43cf6fba46676f4d9f167223fd9b57ec54a5d813fd1d01afc3088139,2022-11-11 14:10:44,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""2022\\n\"");\n    return 0;\n}",ACCEPTED,3,180
1590950219854974976,e51465ce72346fac918042a342986433269a159492161f223a180a6e05d9a01a,2022-11-11 14:11:05,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tlong a=0,b=0;\n\t\tlong num=6;\n\t\tlong res=0;\n\t\tb=in.nextInt();\n        while (in.hasNextInt()) {\n        \tnum=6;\n            a = in.nextInt();\n            num = (long) Math.pow(num, a);\n            res=num%10;\n            System.out.println(res);\n        } \n\t}\n}",WRONG_ANSWER,246,16344
1590950262842396672,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 14:11:15,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,k,j=0;\n    scanf(\""%d\"",&n);\n    for(i=1;i<n;i++)\n    {\n        if(i%2!==0)\n        {\n            j++;\n        }\n    }\n    printf(\""%d\"",j);\n}",COMPILE_ERROR,0,0
1590950320459546624,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 14:11:29,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j=0;\n    scanf(\""%d\"",&n);\n    for(i=1;i<n;i++)\n    {\n        if(i%2!==0)\n        {\n            j++;\n        }\n    }\n    printf(\""%d\"",j);\n}",COMPILE_ERROR,0,0
1590950326843277312,b73a04f1a7af1c2516ca68b38e336912bdf10c4f4bf7bac55e4e0de29dcf3d9d,2022-11-11 14:11:31,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"n=eval(input())\ncount=0\nfor i in range(2,n+1):\n    flag=1\n    for j in range(2,i):\n        if i%j ==0:\n            flag=0\n            break;\n    if flag==1:\n        count+=1\nprint(count)\n        \n    \n#         for(i=2;i<=n;i++){\n# //         k=(int)sqrt(i);\n#         int flag=1;\n#         for(j=2;j<i;j++){\n#             if(i%j==0){\n#                 flag=0;\n#                 break;\n#             }\n#         }\n#         if(flag==1)  \n#             count++;\n            \n#     }",TIME_LIMIT_EXCEEDED,1000,2992
1590950350390099968,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 14:11:36,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int t = 0;\n    scanf(\""%d\"",&t);\n    while(t--)\n    {\n        int n = 0;\n        scanf(\""%d\"",&n);\n        if(n == 0)\n        {\n            printf(\""1\\n\"");\n        }\n        else\n        {\n            printf(\""6\\n\"");\n        }\n    }\n    return 0;\n}",ACCEPTED,9,348
1590950352478842880,42cfad7191c5e6c0eee156c4369182744d6c5db3bc2a5dc87f9f1be6ee4bbcfe,2022-11-11 14:11:37,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\nint main()\n{\n    int X,Y,Z;\n    int sum=0;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    sum=X+Y-Z;\n    printf(\""%d\"",sum);\n    return 0;\n}",ACCEPTED,6,312
1590950376604499968,630b8bfc88107b488e158fc7108c8faf0a195f9b9030c3faf51edac625714584,2022-11-11 14:11:42,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main(){\nint t,i,k=0;\nscanf(\""%d\"",&t);\nint n[t],j[t];\nfor(i=0;i<t;i++){\n    scanf(\""%d\"",&n[i]);\n    if(n[i]==0) j[k++]=i;\n}\nk=0;\nfor(i=0;i<t;i++){\n    if(i==j[k]) {printf(\""1\"");k++;}\n    else printf(\""6\"");\n    if(i!=t-1) printf(\""\\n\"");\n}\n}",WRONG_ANSWER,3,188
1590950379922173952,617f184ce583e9f7a346564ab5659fda0ca35a3a714a0c929cb07f915f4f514b,2022-11-11 14:11:43,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int n,a,res;\n    scanf(\""%d\"",&n);\n    if(n>=0&&n<=1000000000)\n    {\n        while(n--)\n        {\n            int i;\n            scanf(\""%d\"",&a);\n            res=pow(6,a);\n            i=res%10;\n            printf(\""%d\\n\"",i);\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,9,324
1590950385865502720,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 14:11:45,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n/*#include <math.h>\nint main(void)\n{\n    int t = 0;\n    scanf(\""%d\"",&t);\n    while(t--)\n    {\n        int n = 0;\n        scanf(\""%d\"",&n);\n        int sum = pow(6,n);\n        int num = sum % 10;\n        printf(\""%d\\n\"",num);\n    }\n    getchar();\n    return 0;\n}*/\nint main()\n{\n    int t = 0;\n    scanf(\""%d\"",&t);\n    while(t--)\n    {\n        int n = 0;\n        scanf(\""%d\"",&n);\n        if(n == 0)\n        {\n            printf(\""1\\n\"");\n        }\n        else\n        {\n            printf(\""6\\n\"");\n        }\n    }\n    return 0;\n}",ACCEPTED,10,348
1590950408510550016,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 14:11:50,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,import java.time.*;\n\npublic class Main{\n    public static void Main(String[] args){\n        LocalDate today = LocalDate.now();\n        System.out.println(today.getYear());\n    }\n},WRONG_ANSWER,91,15152
1590950437207998464,55950e2d4c314feed0856fa0f6b80f22c5c36f2ebe0d75c8ee2cadb1a06b2fe1,2022-11-11 14:11:57,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main(){\n    \n    int a,b[100],c[100],i,j;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++){\n        scanf(\""%d\"",&b[i]);\n        \n    }\n    for(j=0;j<i;j++){\n        c[j]=b[i]%10;\n        print(\""%d\\n\"",c[j]);\n        \n        \n    }\n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    return 0;\n}",COMPILE_ERROR,0,0
1590950489498386432,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 14:12:09,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n\n#include<math.h>\n\n\n\nint main()\n{\n    int t = 0;\n    scanf(\""%d\"", &t);\n    while (t--)\n    {\n        int n = 0;\n        scanf(\""%d\"", &n);\n        if (n == 0) {\n            printf(\""1\"");\n        }\n        else {\n            printf(\""6\"");\n        }\n        if (t != 0) {\n            printf(\""\\n\"");\n        }\n    }\n\n    return 0;\n}",ACCEPTED,10,348
1590950503624806400,55950e2d4c314feed0856fa0f6b80f22c5c36f2ebe0d75c8ee2cadb1a06b2fe1,2022-11-11 14:12:13,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main(){\n    \n    int a,b[100],c[100],i,j;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++){\n        scanf(\""%d\"",&b[i]);\n        \n    }\n    for(j=0;j<i;j++){\n        c[j]=b[i]%10;\n        printf(\""%d\\n\"",c[j]);\n        \n        \n    }\n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    return 0;\n}",WRONG_ANSWER,3,196
1590950533635051520,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 14:12:20,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n\n#include<math.h>\n\n\n\nint main()\n{\n    int t = 0;\n    scanf(\""%d\"", &t);\n    while (t--)\n    {\n        int n = 0;\n        scanf(\""%d\"", &n);\n        if (n == 0) {\n            printf(\""1\"");\n        }\n        else {\n            printf(\""6\"");\n        }\n        if (t != 0) {\n            printf(\""\\n\"");\n        }\n    }\n\n    return 0;\n}",ACCEPTED,10,204
1590950548772290560,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-11 14:12:23,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,a[10],b[10],c[10],i,j,k,m,max=0;\n    scanf(\""%d\"",%n);\n    for(k=0;k<n;k++)\n    {\n        for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n        for(j=0;j<n;j++)\n        scanf(\""%d\"",&b[j]);\n        c[k]=a[i]-b[j];\n    }\n    for(m=0;m<=k;m++)\n        if(c[m]>max) \n            max=c[m];\n    return 0;\n}",COMPILE_ERROR,0,0
1590950633765666816,4d1157ac6ad50cfc6ca5d6b3e1c2dd7f1ecc593df10ff6888d4207a4f1c03a35,2022-11-11 14:12:44,C++,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}\n",ACCEPTED,4,316
1590950693542887424,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-11 14:12:58,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int num,s;\n    scanf(\""%d\"",&num);\n    for(int i=0;i<num;i++)\n    {\n        scanf(\""%d\"",&s);\n        int z=pow(6,s);\n        printf(\""%d,z%10);\n             if(i!=num-1)\n               printf(\""\\n\"");\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1590950763881365504,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-11 14:13:15,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int num,s;\n    scanf(\""%d\"",&num);\n    for(int i=0;i<num;i++)\n    {\n        scanf(\""%d\"",&s);\n        int z=pow(6,s);\n        printf(\""%d\"",z%10);\n             if(i!=num-1)\n               printf(\""\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,7,312
1590950782529241088,ccc42b8437aa15d1214e4623799ed35cd8ea8087c26cb1b596d51ae4556ea39c,2022-11-11 14:13:19,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,a=eval(input())\nb=input().split()\nfor i in b:\n    if i==0:\n        print(1)\n    else:\n        print(6),WRONG_ANSWER,50,2904
1590950834043682816,6a6dc7e644e57bb2c20b20d39bd4d9541bdebf6415e03e7c13707572c054673e,2022-11-11 14:13:31,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n    int a,i=0,b;\n    scanf(\""%d\\n\"",&a);\n    for(i=0;i<a;i++)\n    {   scanf(\""%d\"",&b);\n\n        printf(\""6\\n\"");\n      }\n  return 0;\n\n}\n\n\n\n\n\n",WRONG_ANSWER,10,348
1590950881313492992,887d1bbe53a4d4a349813887f13126da5e46a853687f4c2c9d7b8ef3d748a9d6,2022-11-11 14:13:43,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n int main()\n{   int n,i;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],max=0;\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n        for(i=0;i<n;i++)\n        {\n            if(b[i]-a[i]>=0)\n                max+=b[i]-a[i];\n            else\n                break;\n        }\n        printf(\""%d\"",max);\n}\n",WRONG_ANSWER,3,192
1590950896660447232,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-11 14:13:46,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int num,s;\n    scanf(\""%d\"",&num);\n    for(int i=0;i<num;i++)\n    {\n        scanf(\""%d\"",&s);\n        int z=pow(6,s);\n        printf(\""%d\"",z%10);\n             if(i!=num-1)\n               printf(\""\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,8,512
1590950913441837056,303021c0ef4f93101c801ad0c8851ab3828a16b5c728ce8e6859ab342ddc4b26,2022-11-11 14:13:50,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""%d\"",2022);\n    return 0;\n}\n",ACCEPTED,2,348
1590950941434642432,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-11 14:13:57,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,a[10],b[10],c[10],i,j,k,m,max=0;\n    scanf(\""%d\"",&n);\n    for(k=0;k<n;k++)\n    {\n        for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n        for(j=0;j<n;j++)\n        scanf(\""%d\"",&b[j]);\n        c[k]=a[i]-b[j];\n    }\n    for(m=0;m<=k;m++)\n        if(c[m]>max) \n            max=c[m];\n    return 0;\n}",RUNTIME_ERROR,4,320
1590950944681033728,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 14:13:58,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n = 0;\n    int count = 0;\n    scanf(\""%d\"",&n);\n    if(n > 2)\n    {\n            int i = 0;\n    for(i = 2; i < n; ++i)\n    {\n        int j = 0;\n        for(j = 2; j < n; ++j)\n        {\n            if(i % j == 0)\n            {\n                break;\n            }\n        }\n        if(i == j)\n        {\n           count++;\n        }\n    }\n    printf(\""%d\"",count);\n    }\n\n    return 0;\n}",ACCEPTED,923,332
1590950948262973440,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-11 14:13:59,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int num,s;\n    scanf(\""%d\"",&num);\n    for(int i=0;i<num;i++)\n    {\n        scanf(\""%d\"",&s);\n        int z=pow(6,s);\n        printf(\""%d\"",z%10);\n             if(i!=num-1)\n               printf(\""\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,6,328
1590951030899146752,40c43472973ea298adbdd1d4b900aeb63cfa4cfe17179f01a4827cd2c6624d3a,2022-11-11 14:14:18,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nmain()\n{\n    int i,j,n,count=0,k,m;\n    scanf(\""%d\"",&n);\n    k=sqrt(m);\n    for(i=2;i<=n;i++)\n    {\n        for(j=2;j<=k;j++)\n        {\n            if(i%j==0)\n                break;\n        }\n        if(i==j)\n            count++;\n    }\n    printf(\""%d\"",count);\n}\n",WRONG_ANSWER,3,324
1590951058124374016,e51465ce72346fac918042a342986433269a159492161f223a180a6e05d9a01a,2022-11-11 14:14:25,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tlong a=0,b=0;\n\t\tlong num=6;\n\t\tlong res=0;\n\t\tb=in.nextInt();\n        while (in.hasNextInt()) {\n        \tnum=6;\n            a = in.nextInt();\n            \n            num = (long) Math.pow(num, a);\n            res=num%10;\n            System.out.print(res);\n        } \n\t}\n}",WRONG_ANSWER,247,16580
1590951122322395136,902d8082eea06043d392298983db4630cde4418ac8ee42282d537bfaae045c2f,2022-11-11 14:14:40,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,a=eval(input())\nb=input()\nfor i in range(a) :\n    print(6)\n,WRONG_ANSWER,45,2884
1590951131612774400,ccc42b8437aa15d1214e4623799ed35cd8ea8087c26cb1b596d51ae4556ea39c,2022-11-11 14:14:42,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,a=eval(input())\nb=input().split()\nfor i in b:\n    if i==0:\n        print(1)\n    else:\n        print(6),WRONG_ANSWER,50,2880
1590951154853412864,40c43472973ea298adbdd1d4b900aeb63cfa4cfe17179f01a4827cd2c6624d3a,2022-11-11 14:14:48,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nmain()\n{\n    int i,j,n,count=0,k,m;\n    scanf(\""%d\"",&n);\n    k=sqrt(m);\n    for(i=1;i<=n;i++)\n    {\n        for(j=2;j<=k;j++)\n        {\n            if(i%j==0)\n                break;\n        }\n        if(i==j)\n            count++;\n    }\n    printf(\""%d\"",count);\n}\n",WRONG_ANSWER,3,324
1590951156405309440,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-11 14:14:48,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,a[10],b[10],c[10],i,j,k,m,max=0;\n    scanf(\""%d\"",&n);\n    for(k=0;k<n;k++)\n    {\n        for(i=0;i<k;i++)\n        scanf(\""%d\"",&a[i]);\n        for(j=0;j<k;j++)\n        scanf(\""%d\"",&b[j]);\n        c[k]=a[i]-b[j];\n    }\n    for(m=0;m<=k;m++)\n        if(c[m]>max) \n            max=c[m];\n    return 0;\n}",WRONG_ANSWER,3,188
1590951200055406592,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-11 14:14:59,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int num,s;\n    scanf(\""%d\"",&num);\n    for(int i=0;i<num;i++)\n    {\n        scanf(\""%d\"",&s);\n        int z=pow(6,s);\n        printf(\""%d\"",z%10);\n             if(i!=num-1)\n               printf(\""\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,5,324
1590951211388416000,630b8bfc88107b488e158fc7108c8faf0a195f9b9030c3faf51edac625714584,2022-11-11 14:15:01,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main(){\nint t,i;\nscanf(\""%d\"",&t);\nint n[t];\nfor(i=0;i<t;i++){\n    scanf(\""%d\"",&n[i]);\n    if(n[i]!=0) printf(\""6\"");\n    else printf(\""1\"");\n    if(i!=t-1) printf(\""\\n\"");\n}\n    return 0;\n}",ACCEPTED,9,340
1590951218795581440,4d1157ac6ad50cfc6ca5d6b3e1c2dd7f1ecc593df10ff6888d4207a4f1c03a35,2022-11-11 14:15:03,C++,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int x,y,z,sum;\n    cin>>x>>y>>z;\n    sum=x+y-z;\n    cout<<sum;\n    return 0;\n}",ACCEPTED,8,476
1590951290329411584,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-11 14:15:20,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int num,s;\n    scanf(\""%d\"",&num);\n    for(int i=0;i<num;i++)\n    {\n        scanf(\""%d\"",&s);\n        int z=pow(6,s);\n        printf(\""%d\"",z%10);\n             if(i!=num-1)\n               printf(\""\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,7,512
1590951325641281536,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-11 14:15:29,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int num,s;\n    scanf(\""%d\"",&num);\n    for(int i=0;i<num;i++)\n    {\n        scanf(\""%d\"",&s);\n        int z=pow(6,s);\n        printf(\""%d\"",z%10);\n             if(i!=num-1)\n               printf(\""\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,7,464
1590951511482478592,8cf8229a23351e1ca2a7bfc1ad0af3ab2ad4a709a7c796637dbdea7befc2b0ec,2022-11-11 14:16:13,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n   int X,Y,Z,sum;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    sum=X+Y-Z;\n    printf(\""%d\"",sum);\n    return 0;\n}\n",ACCEPTED,7,320
1590951538254721024,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-11 14:16:19,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main(){\n    int n,i,temp=0,flag=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n],sum=0;\n    for(i=0;i<n;i++)\n    {scanf(\""%d\"",&a[i]);}\n    for(i=0;i<n;i++)\n    {scanf(\""%d\"",&b[i]);}\n    \n    for(i=0;i<n;i++){\n        c[i]=b[i]-a[i];\n       if(c[i]>=0) flag++;\n    }\n    \n    if(flag==0){\n    \ttemp=c[0];\n\t for(i=1;i<n;i++)\n\t     {\n\t\t \tif(c[i]>=temp) temp=c[i];\n\t\t }\n\t}\n    \n   \n   \n   if(flag){\n   \ttemp=0;\n  for(i=0;i<n;i++){\n       if(c[i]>=0)\n\t   {\n\t   \t sum+=c[i];\n\t   \tif(temp<=sum)   {temp=sum;}\n\t }\n\t   \n       if(c[i]<0) {\n\t \t sum=0;\n\t     }\n     }\n     }\n     \n     printf(\""%d\\n\"",temp);\n}",WRONG_ANSWER,3,192
1590951622010777600,e3700fa579dc7c925fa010ac870390ba9776ef5ee08f67752aeef4a9467c7624,2022-11-11 14:16:39,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"include <stdio.h>\nprintf(\""2022\\n\"");",COMPILE_ERROR,0,0
1590951698460377088,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-11 14:16:58,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[100],i,b[100];\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]==0)\n        printf(\""1\"");\n    else\n        printf(\""6\"");\n    if(i!=n-1)\n        printf(\""\\n\"");\n    }\n    return 0;\n}",ACCEPTED,9,324
1590951706513420288,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 14:16:59,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<n;i++)\n    {\n        if(i%2!==0)\n        {\n            j++;\n        }\n    }\n    printf(\""%d\"",j);\n}",COMPILE_ERROR,0,0
1590951728382545920,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-11 14:17:05,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,a[10],b[10],c[10],i,j,k,m,max=0;\n    scanf(\""%d\"",&n);\n    for(k=0;k<n;k++)\n    {\n        for(i=0;i<k;i++)\n        scanf(\""%d\"",&a[i]);\n        for(j=0;j<k;j++)\n        scanf(\""%d\"",&b[j]);\n        c[k]=a[i]-b[j];\n    }\n    for(m=0;m<=k;m++)\n        if(c[m]>max) \n            max=c[m];\n    printf(\""%d\"",max);\n    return 0;\n}",RUNTIME_ERROR,3,476
1590951732874620928,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 14:17:06,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<n;i++)\n    {\n        if(i%2!==0)\n        {\n            j++;\n        }\n    }\n    printf(\""%d\"",j);\n}",COMPILE_ERROR,0,0
1590951787937464320,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 14:17:19,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<n;i++)\n    {\n        if(i%2!=0)\n        {\n            j++;\n        }\n    }\n    printf(\""%d\"",j);\n}",WRONG_ANSWER,3,344
1590951799043960832,00d0a1b2e987c17fb50850b9ec54bf6b4f8b997eb053d1a9fed6c4888fbe74ed,2022-11-11 14:17:22,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n#define n 10\n\nint main()\n{\n    int t,i,a[n];\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n        a[i]=pow(6,a[i]);\n        a[i]=a[i]%10;\n    }\n    for(i=0;i<t;i++)\n    {\n        printf(\""%d\"",a[i]);\n        printf(\""\\n\"");\n    }\n    return 0;\n}\n",WRONG_ANSWER,6,380
1590951803129212928,55950e2d4c314feed0856fa0f6b80f22c5c36f2ebe0d75c8ee2cadb1a06b2fe1,2022-11-11 14:17:22,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main(){\n    \n    int a,b[100],c[100],i,j;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++){\n        scanf(\""%d\"",&b[i]);\n        \n    }\n    \n    for(j=0;j<i;j++){\n        c[j]=pow(6,b[i]);\n        \n        \n    }\n    c[j]=c[j]%10;\n    for(k=0;k<a;k++){\n        printf(\""%d\\n\"",c[j])\n        \n    }\n \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    return 0;\n}",COMPILE_ERROR,0,0
1590951807407403008,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-11 14:17:23,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main(){\n    int n,i,temp=0,flag=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n],sum=0;\n    for(i=0;i<n;i++)\n    {scanf(\""%d\"",&a[i]);}\n    for(i=0;i<n;i++)\n    {scanf(\""%d\"",&b[i]);}\n    \n    for(i=0;i<n;i++){\n        c[i]=b[i]-a[i];\n       if(c[i]>=0) flag++;\n    }\n    \n    if(flag==0){\n    \ttemp=c[0];\n\t for(i=1;i<n;i++)\n\t     {\n\t\t \tif(c[i]>=temp) temp=c[i];\n\t\t }\n\t}\n    \n   \n   \n   if(flag){\n   \ttemp=0;\n  for(i=0;i<n;i++){\n       if(c[i]>=0)\n\t   {\n\t   \t sum+=c[i];\n\t   \tif(temp<=sum)   {temp=sum;}\n\t }\n\t   \n       if(c[i]<0) {\n\t \t sum=0;\n\t     }\n     }\n     }\n     \n     printf(\""%d\\n\"",temp);\n}",WRONG_ANSWER,3,316
1590951813568835584,40c43472973ea298adbdd1d4b900aeb63cfa4cfe17179f01a4827cd2c6624d3a,2022-11-11 14:17:25,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int i,j,n,count=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n    {\n        for(j=2;j<=i;j++)\n        {\n            if(i%j==0)\n                break;\n        }\n        if(i==j)\n            count++;\n    }\n    printf(\""%d\"",count);\n}\n",ACCEPTED,936,384
1590951886985953280,29d1ea54d6e4e56fc2de0be5ae10ecc4c70c7fca667934b17857e95530f5663a,2022-11-11 14:17:42,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include<string.h>\nint main()\n{\n   int n,sum,i,j;\n    scanf(\""%d\"",&n);\n    sum=1;\n    for(i=3;i<n;i+=2)\n    {\n        for(j=2;j<i;j++)\n        {\n            if(i%j==0)\n                break;\n            if(i==j)\n                sum++;\n    }\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,3,180
1590951944846376960,55950e2d4c314feed0856fa0f6b80f22c5c36f2ebe0d75c8ee2cadb1a06b2fe1,2022-11-11 14:17:56,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main(){\n    \n    int a,b[100],c[100],i,j;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++){\n        scanf(\""%d\"",&b[i]);\n        \n    }\n    \n    for(j=0;j<i;j++){\n        c[j]=pow(6,b[i]);\n        \n        \n    }\n    c[j]=c[j]%10;\n    for(k=0;k<a;k++){\n        printf(\""%d\\n\"",c[j])\n        \n    }\n \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    return 0;\n}",COMPILE_ERROR,0,0
1590951986848137216,55950e2d4c314feed0856fa0f6b80f22c5c36f2ebe0d75c8ee2cadb1a06b2fe1,2022-11-11 14:18:06,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main(){\n    \n    int a,b[100],c[100],i,j;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++){\n        scanf(\""%d\"",&b[i]);\n        \n    }\n    \n    for(j=0;j<i;j++){\n        c[j]=pow(6,b[i]);\n        \n        \n    }\n    c[j]=c[j]%10;\n    for(k=0;k<a;k++){\n        printf(\""%d\\n\"",c[j]);\n        \n    }\n \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    return 0;\n}",COMPILE_ERROR,0,0
1590952025980973056,55950e2d4c314feed0856fa0f6b80f22c5c36f2ebe0d75c8ee2cadb1a06b2fe1,2022-11-11 14:18:16,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main(){\n    \n    int a,b[100],c[100],i,j,k;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++){\n        scanf(\""%d\"",&b[i]);\n        \n    }\n    \n    for(j=0;j<i;j++){\n        c[j]=pow(6,b[i]);\n        \n        \n    }\n    c[j]=c[j]%10;\n    for(k=0;k<a;k++){\n        printf(\""%d\\n\"",c[j]);\n        \n    }\n \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    return 0;\n}",WRONG_ANSWER,3,436
1590952052329590784,00d0a1b2e987c17fb50850b9ec54bf6b4f8b997eb053d1a9fed6c4888fbe74ed,2022-11-11 14:18:22,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n#define n 10\n\nint main()\n{\n    int t,i,a[n];\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n        a[i]=pow(6,a[i]);\n        a[i]=a[i]%10;\n    }\n    for(i=0;i<t-1;i++)\n    {\n        printf(\""%d\"",a[i]);\n        printf(\""\\n\"");\n    }\n    printf(\""%d\"",a[i]);\n    return 0;\n}\n",WRONG_ANSWER,6,312
1590952063775870976,86f702b052a21d7cb2f8cd933c678c21efaafaf5b2d35032f18ec35c1e26a945,2022-11-11 14:18:25,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int t,a,b,i,n;\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++)\n      { scanf(\""%d\"",&n);\n        a=pow(6,n);\n        b=a%10;\n        printf(\""%d\\n\"",b);\n      }\n    return 0;\n}",WRONG_ANSWER,6,464
1590952066632192000,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 14:18:25,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\nint a[100],n,i;\n\n    scanf(\""%d\"",&n);\nfor(i=0;i<n;i++)\n{\n\tscanf(\""%d\"",&a[i]);\n\n}\n    for(i=0;i<n;i++)\n    {\nprintf(\""%d\\n\"",6);\n    }\n    return 0;\n}\n\n\n\n\n\n\n\n\n\n",WRONG_ANSWER,9,324
1590952101411360768,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-11 14:18:34,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int num,s;\n    scanf(\""%d\"",&num);\n    for(int i=0;i<num;i++)\n    {\n        scanf(\""%d\"",&s);\n        if(s!=0)\n        printf(\""6\"");\n        else printf(\""1\"");\n             if(i!=num-1)\n               printf(\""\\n\"");\n    }\n    return 0;\n}",ACCEPTED,11,344
1590952148052021248,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-11 14:18:45,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int num,s;\n    scanf(\""%d\"",&num);\n    for(int i=0;i<num;i++)\n    {\n        scanf(\""%d\"",&s);\n        if(s!=0)\n        printf(\""6\"");\n        else printf(\""1\"");\n             if(i!=num-1)\n             printf(\""\\n\"");\n    }\n    return 0;\n}",ACCEPTED,8,480
1590952158126739456,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 14:18:47,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#define n 100000\nint main()\n{\n    int a,i,j,t,sum=0;\n    scanf(\""%d\"",&a);\n    int b[n],c[n],d[n];\n    for(i=0;i<a;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(j=0;j<a;j++)\n    {\n        scanf(\""%d\"",&c[j]);\n    }\n    for(t=0;t<a;t++)\n    {\n        d[t]=b[t]-c[t];\n        if(d[t]>=0) sum+=d[t];\n    }\n    printf(\""%d\\n\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,4,316
1590952177928024064,2a1cee132cc8344d51461f6cbf473fb80705d6fd5972f9a5d0fcfea0760fd8b1,2022-11-11 14:18:52,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""2022\\n\"");\n    return 0;\n}\n",ACCEPTED,3,312
1590952180406857728,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 14:18:52,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n\n\nint main()\n{\n    int n = 0;\n    int count = 0;\n    scanf(\""%d\"",&n);\n    int i = 0;\n    for(i = 2; i < n; ++i)\n    {\n        int j = 0;\n        for(j = 2; j < n; ++j)\n        {\n            if(i % j == 0)\n            {\n                break;\n            }\n        }\n        if(i == j)\n        {\n           count++;\n        }\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",ACCEPTED,946,348
1590952188380250112,1a4463a67236431e94a4a4d273d88450d6acce220fed7155af8798b0664ee731,2022-11-11 14:18:54,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n\nint main()\n\n{\n\n    int m,i,n=0,num=0,k=0;\n\n    scanf(\""%d\"",&n);\n\n\nfor(m=2;m<=n;m++)\n\n{\n    for(i=2;i<m;i++)\n\n    if(m%i==0){\n\n        k++;\n\n\n    }\n\n    if(k==0){\n\n    printf(\""%d,\"",m);\n\n    num++;}\n\n    k=0;\n}\n\n\n    printf(\""\\n%d以内共有%d个素数\\n\"",n,num);\n\n    return 0;\n}",TIME_LIMIT_EXCEEDED,1000,376
1590952251529691136,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 14:19:09,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,import java.time.*;\n\npublic class Main{\n    public static void Main(String[] args){\n        LocalDate today = LocalDate.now();\n        System.out.println(today.getYear());\n    }\n},WRONG_ANSWER,87,15292
1590952263349243904,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 14:19:12,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n\n\nint main()\n{\n    int n = 0;\n    int count = 0;\n    scanf(\""%d\"",&n);\n    int i = 0;\n    for(i = 2; i < n; ++i)\n    {\n        int j = 0;\n        for(j = 2; j < qsort(n); ++j)\n        {\n            if(i % j == 0)\n            {\n                break;\n            }\n        }\n        if(i == j)\n        {\n           count++;\n        }\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",WRONG_ANSWER,4,312
1590952293338492928,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-11 14:19:19,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main(){\n    int n,i,temp=0,flag=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n],sum=0;\n    for(i=0;i<n;i++)\n    {scanf(\""%d\"",&a[i]);}\n    for(i=0;i<n;i++)\n    {scanf(\""%d\"",&b[i]);}\n    \n    for(i=0;i<n;i++){\n        c[i]=b[i]-a[i];\n       if(c[i]>=0) flag++;\n    }\n    \n    if(flag==0){\n    \ttemp=c[0];\n\t for(i=1;i<n;i++)\n\t     {\n\t\t \tif(c[i]>=temp) temp=c[i];\n\t\t }\n\t}\n    \n   \n   \n   if(flag){\n   \ttemp=0;\n  for(i=0;i<n;i++){\n       if(c[i]>=0)\n\t   {\n\t   \t sum+=c[i];\n\t   \tif(temp<=sum)   {temp=sum;}\n\t }\n\t   \n       if(c[i]<0) {\n\t \t sum=0;\n\t     }\n     }\n     }\n     \n     printf(\""%d\\n\"",temp);\n}",WRONG_ANSWER,4,340
1590952333448622080,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 14:19:29,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n    int n = 0;\n    int count = 0;\n    scanf(\""%d\"",&n);\n    int i = 0;\n    for(i = 2; i < n; ++i)\n    {\n        int j = 0;\n        for(j = 2; j < qsort(n); ++j)\n        {\n            if(i % j == 0)\n            {\n                break;\n            }\n        }\n        if(i == j)\n        {\n           count++;\n        }\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",WRONG_ANSWER,5,332
1590952369964232704,129ddfe9d2d4553f365faf2fdc5e2f0c271b2e342a4cff13802dda8ef8b3d1c2,2022-11-11 14:19:38,Java,300.0,1590734963702620160,1590734503495200768,1049226928954454016,import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int n = s.nextInt();\n        int[] a = new int[n];\n        int[] b = new int[n];\n        int[] c = new int[n];\n        int[] d = new int[n];\n        int Max = 0;\n        for(int i =0; i < n ; i++){\n            a[i] = s.nextInt();\n        }\n        for(int i =0; i < n ; i++){\n            b[i] = s.nextInt();\n        }\n        for(int i =0; i < n ; i++){\n            c[i] = b[i] - a[i];\n        }\n        d[0] = c[0];\n        for(int i =1; i <n ; i++){\n            if(d[i-1]>0){\n                d[i] = d[i-1] +c[i];\n            }else{\n                d[i]=c[i];\n            }\n            if(d[i]>Max){\n                Max = d[i];\n            }\n        }\n        System.out.print(Max);\n    }\n},ACCEPTED,131,16460
1590952382907854848,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 14:19:41,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n    int n = 0;\n    int count = 0;\n    scanf(\""%d\"",&n);\n    int i = 0;\n    for(i = 2; i < n; ++i)\n    {\n        int j = 0;\n        for(j = 2; j < sort(n); ++j)\n        {\n            if(i % j == 0)\n            {\n                break;\n            }\n        }\n        if(i == j)\n        {\n           count++;\n        }\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",COMPILE_ERROR,0,0
1590952421168320512,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 14:19:50,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<n;i++)\n    {\n        for(int k=2;k<i;k++)\n        {\n            break;\n        }\n        j++;\n    }\n    printf(\""%d\"",j);\n}",WRONG_ANSWER,5,320
1590952434854309888,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 14:19:53,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n    int n = 0;\n    int count = 0;\n    scanf(\""%d\"",&n);\n    int i = 0;\n    for(i = 2; i < n; ++i)\n    {\n        int j = 0;\n        for(j = 2; j < sqrt(n); ++j)\n        {\n            if(i % j == 0)\n            {\n                break;\n            }\n        }\n        if(i == j)\n        {\n           count++;\n        }\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",WRONG_ANSWER,24,308
1590952451094654976,d122b81a371b28751082747cf65a235d0eddfd496e142775cd971d8f88adf327,2022-11-11 14:19:57,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n    int t;\n    scanf(\""%d\\n\"",&t);\n    int a[100];\n    for(int j=0;j<t;j++)\n    {\n        scanf(\""%d\"",&a[j]);}\nprintf(\""6\\n6\\n6\"");\n    \n  return 0;\n}\n",WRONG_ANSWER,3,472
1590952523375120384,1a4463a67236431e94a4a4d273d88450d6acce220fed7155af8798b0664ee731,2022-11-11 14:20:14,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n\nint main()\n\n{\n\n    int m,i,n=0,num=0,k=0;\n\n    scanf(\""%d\"",&n);\n\n\nfor(m=2;m<=n;m++)\n\n{\n    for(i=2;i<m;i++)\n\n    if(m%i==0){\n\n        k++;\n\n\n    }\n\n    if(k==0){\n\n    num++;}\n\n    k=0;\n}\n\n\n    printf(\""\\n%d以内共有%d个素数\\n\"",n,num);\n\n    return 0;\n}",TIME_LIMIT_EXCEEDED,1000,356
1590952546565427200,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-11 14:20:20,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,a[10],b[10],c[10],i,j,k,m,max=0,num=0;\n    scanf(\""%d\"",&n);\n    for(k=0;k<n;k++)\n    {\n        for(i=0;i<k;i++)\n        scanf(\""%d\"",&a[i]);\n        for(j=0;j<k;j++)\n        scanf(\""%d\"",&b[j]);\n        c[k]=a[i]-b[j];\n    }\n    if(c[k]>0)\n        num+=c[k];\n    printf(\""%d\"",num);\n    return 0;\n}",RUNTIME_ERROR,3,448
1590952556438794240,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 14:20:22,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n    int n = 0;\n    int count = 0;\n    scanf(\""%d\"",&n);\n    int i = 0;\n    for(i = 0; i < n; ++i)\n    {\n        int j = 0;\n        for(j = 2; j < sqrt(n); ++j)\n        {\n            if(i % j == 0)\n            {\n                break;\n            }\n        }\n        if(i == j)\n        {\n           count++;\n        }\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",WRONG_ANSWER,22,324
1590952602186088448,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 14:20:33,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n\n\nint main()\n{\n    int n = 0;\n    int count = 0;\n    scanf(\""%d\"",&n);\n    int i = 0;\n    for(i = 2; i < n; ++i)\n    {\n        int j = 0;\n        for(j = 2; j < n; ++j)\n        {\n            if(i % j == 0)\n            {\n                break;\n            }\n        }\n        if(i == j)\n        {\n           count++;\n        }\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",ACCEPTED,966,324
1590952627536441344,d122b81a371b28751082747cf65a235d0eddfd496e142775cd971d8f88adf327,2022-11-11 14:20:39,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n    int t;\n    scanf(\""%d\\n\"",&t);\n    int a[100];\n    for(int j=0;j<t;j++)\n    {\n        scanf(\""%d\"",&a[j]);\nprintf(\""6\\n\"");}\n  return 0;\n}\n",WRONG_ANSWER,9,196
1590952681827536896,617f184ce583e9f7a346564ab5659fda0ca35a3a714a0c929cb07f915f4f514b,2022-11-11 14:20:52,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int t;\n    scanf(\""%d\"",&t);\n    if(t>=0&&t<=1000000000)\n    {\n        while(t--)\n        {\n            int i,n,res;\n            scanf(\""%d\"",&n);\n            res=pow(6,n);\n            i=res%10;\n            printf(\""%d\\n\"",i);\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,7,312
1590952697006723072,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-11 14:20:56,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main(){\n    int n,i,temp=0,flag=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n],sum=0;\n    for(i=0;i<n;i++)\n    {scanf(\""%d\"",&a[i]);}\n    for(i=0;i<n;i++)\n    {scanf(\""%d\"",&b[i]);}\n    \n    for(i=0;i<n;i++){\n        c[i]=b[i]-a[i];\n       if(c[i]>=0) flag++;\n    }\n    \n    if(flag==0){\n    \ttemp=-100;\n\t for(i=1;i<n;i++)\n\t     {\n\t\t \tif(c[i]>=temp) temp=c[i];\n\t\t }\n\t}\n    \n   \n   \n   if(flag){\n   \ttemp=0;\n  for(i=0;i<n;i++){\n       if(c[i]>=0)\n\t   {\n\t   \t sum+=c[i];\n\t   \tif(temp<=sum)   {temp=sum;}\n\t }\n\t   \n       if(c[i]<0) {\n\t \t sum=0;\n\t     }\n     }\n     }\n     \n     printf(\""%d\\n\"",temp);\n}",WRONG_ANSWER,2,200
1590952739805401088,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 14:21:06,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#define n 100000\nint main()\n{\n    int a,i,j,t,sum=0;\n    scanf(\""%d\"",&a);\n    int b[n],c[n],d[n];\n    for(i=0;i<a;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(j=0;j<a;j++)\n    {\n        scanf(\""%d\"",&c[j]);\n    }\n    for(t=0;t<a;t++)\n    {\n        d[t]=b[t]-c[t];\n        if(d[t]>=0) sum+=d[t];\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,3,196
1590952759711543296,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 14:21:11,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<n;i++)\n    {\n        for(int k=2;k<i;k++)\n        {\n           if(i%k==0)\n           {\n               break;\n           }\n        }\n        j++;\n    }\n    printf(\""%d\"",j);\n}",WRONG_ANSWER,2,196
1590952770864218112,d21dc339d37b0772b2547441444d4b660b000ac3ebe190aee01769e2dd619c10,2022-11-11 14:21:13,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,print('2022'),ACCEPTED,16,2884
1590952840695185408,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 14:21:30,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#define n 100000\nint main()\n{\n    int a,i,j,t,sum=0;\n    scanf(\""%d\"",&a);\n    int b[n],c[n],d[n];\n    for(i=0;i<a;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(j=0;j<a;j++)\n    {\n        scanf(\""%d\"",&c[j]);\n    }\n    for(t=0;t<a;t++)\n    {\n        d[t]=b[t]-c[t];\n        if(d[t]>=0) sum+=d[t];\n    }\n    printf(\""%d\\n\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,3,184
1590952896122916864,44e63106384b2202d1a15f2fb61b15315a1f0761b20f40b73c55e6122e10f27d,2022-11-11 14:21:43,Python,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"data = list(map(eval,input().split()))\ns = data[0]+data[1]-data[2]\nprint(s)\n",ACCEPTED,32,2904
1590952966696275968,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 14:22:00,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"public class Main{\n    public static void Main(String[] args){\n       System.out.println(\""2022\"");\n    }\n}",WRONG_ANSWER,94,15020
1590952988875755520,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-11 14:22:05,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,t;\n    int i;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&t)\n    }\n    for(i=0;i<n;i++)\n    {\n        printf(\""%d\"",6);\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1590953009700450304,acf80eea856463058b81f71c0238069795893092293fbd098cc594959df6444e,2022-11-11 14:22:10,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"n=int(input())\na=list(map(int,input().split()))\nfor i in range(n):\n    b=6**a[i]\n    c=b%10\n    print(c)",TIME_LIMIT_EXCEEDED,167,3944
1590953016474251264,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 14:22:12,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,public class Main{\n    public static void Main(String[] args){\n       System.out.println(2022);\n    }\n},WRONG_ANSWER,87,15392
1590953024695111680,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 14:22:14,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"n = int(input())\nxh = list(map(eval,input().split()))\nhd = list(map(eval,input().split()))\ns=hd-xh\nprint(s)\ndata = []\nfor i in range(0,n):\n    s=0\n    for j in range(i,10):\n        s=s+hd[j]-xh[j]\n        data.append(s)\ndata.sort(reverse=True)\nprint(data[0])\n",NON_ZERO_EXIT_CODE,20,2884
1590953027337498624,29d1ea54d6e4e56fc2de0be5ae10ecc4c70c7fca667934b17857e95530f5663a,2022-11-11 14:22:14,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include<string.h>\nint main()\n{\n   int n,sum,i,j;\n    scanf(\""%d\"",&n);\n    sum=1;\n    for(i=3;i<=n;i+=2)\n    {\n        for(j=2;j<i;j++)\n        \n            if(i%j==0)\n                break;\n            if(j==i)\n                sum++;\n    \n    }\n    printf(\""%d\"",sum);\n    return 0;\n}\n",ACCEPTED,950,340
1590953040327258112,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-11 14:22:17,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,t;\n    int i;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&t);\n    }\n    for(i=0;i<n;i++)\n    {\n        printf(\""%d\"",6);\n    }\n    return 0;\n}",WRONG_ANSWER,8,312
1590953050540388352,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 14:22:20,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n\n\nint main()\n{\n    int n = 0;\n    int count = 0;\n    scanf(\""%d\"",&n);\n    int i = 0;\n    for(i = 2; i < n; i += 2)\n    {\n        int j = 0;\n        for(j = 2; j < n; ++j)\n        {\n            if(i % j == 0)\n            {\n                break;\n            }\n        }\n        if(i == j)\n        {\n           count++;\n        }\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",WRONG_ANSWER,3,180
1590953062066360320,eee658ba43cf6fba46676f4d9f167223fd9b57ec54a5d813fd1d01afc3088139,2022-11-11 14:22:23,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z;\n    scanf (\""%d %d %d\"",&X,&Y,&Z);\n    if(X>=0&&Z<=100)\n    {\n        printf(\""%d\\n\"",X+Y-Z);\n    }\n    return 0;\n}\n",ACCEPTED,6,192
1590953073894297600,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 14:22:25,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,public class Main{\n    public static void Main(String[] args){\n        int x =2022;\n       System.out.println(x);\n    }\n},NON_ZERO_EXIT_CODE,94,17840
1590953075840454656,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 14:22:26,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n\n\nint main()\n{\n    int n = 0;\n    int count = 0;\n    scanf(\""%d\"",&n);\n    int i = 0;\n    for(i = 1; i < n; i += 2)\n    {\n        int j = 0;\n        for(j = 2; j < n; ++j)\n        {\n            if(i % j == 0)\n            {\n                break;\n            }\n        }\n        if(i == j)\n        {\n           count++;\n        }\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",WRONG_ANSWER,956,512
1590953130278322176,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 14:22:39,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n\n\nint main()\n{\n    int n = 0;\n    int count = 0;\n    scanf(\""%d\"",&n);\n    int i = 0;\n    for(i = 2; i < n; ++i)\n    {\n        int j = 0;\n        for(j = 2; j < n; ++j)\n        {\n            if(i % j == 0)\n            {\n                break;\n            }\n        }\n        if(i == j)\n        {\n           count++;\n        }\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",ACCEPTED,938,332
1590953150641647616,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-11 14:22:44,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,a[10],b[10],c[10],i,j,k,m,max=0,num=0;\n    scanf(\""%d\"",&n);\n    for(k=0;k<n;k++)\n    {\n        for(i=0;i<=k;i++)\n        scanf(\""%d\"",&a[i]);\n        for(j=0;j<=k;j++)\n        scanf(\""%d\"",&b[j]);\n        c[k]=a[i]-b[j];\n    }\n    if(c[k]>0)\n        num+=c[k];\n    printf(\""%d\"",num);\n    return 0;\n}",RUNTIME_ERROR,4,440
1590953182845513728,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-11 14:22:51,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a[100],i;\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]==0)\n        printf(\""1\"");\n    else\n        printf(\""6\"");\n    if(i!=n-1)\n        printf(\""\\n\"");\n    }\n    return 0;\n}",ACCEPTED,8,472
1590953187446685696,46a5b5de1986c03ade4ef3715390240d3b4a1729dbb6afcb5e53fc1bee0f1a07,2022-11-11 14:22:53,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"package lan1;\n\npublic class s1 {\n\n\tpublic static void main(String[] args) {\n\t\tSystem.out.print(\""2022\"");\n\n\t}\n\n}\n",COMPILE_ERROR,0,0
1590953191007629312,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-11 14:22:53,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main(){\n    int n,i,temp=0,flag=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n],sum=0;\n    for(i=0;i<n;i++)\n    {scanf(\""%d\"",&a[i]);}\n    for(i=0;i<n;i++)\n    {scanf(\""%d\"",&b[i]);}\n    \n    for(i=0;i<n;i++){\n        c[i]=b[i]-a[i];\n       if(c[i]>=0) flag++;\n    }\n    \n    if(flag==0){\n    \ttemp=c[0];\n\t for(i=1;i<n;i++)\n\t     {\n\t\t \tif(c[i]>=temp) temp=c[i];\n\t\t }\n\t}\n    \n   \n   \n   if(flag>0){\n   \ttemp=0;\n  for(i=0;i<n;i++){\n       if(c[i]>=0)\n\t   {\n\t   \t sum+=c[i];\n\t   \tif(temp<=sum)   {temp=sum;}\n\t }\n\t   \n       if(c[i]<0) {\n\t \t sum=0;\n\t     }\n     }\n     }\n     \n     printf(\""%d\\n\"",temp);\n}",WRONG_ANSWER,3,180
1590953321903489024,46a5b5de1986c03ade4ef3715390240d3b4a1729dbb6afcb5e53fc1bee0f1a07,2022-11-11 14:23:25,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"\n\npublic class s1 {\n\n\tpublic static void main(String[] args) {\n\t\tSystem.out.print(\""2022\"");\n\n\t}\n\n}\n",COMPILE_ERROR,0,0
1590953361602576384,2a1cee132cc8344d51461f6cbf473fb80705d6fd5972f9a5d0fcfea0760fd8b1,2022-11-11 14:23:34,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    if(X,Y,Z>=0&&X,Y,Z<=100)\n    {\n        printf(\""%d\"",X+Y-Z);\n    }\n    return 0;\n}\n",ACCEPTED,10,368
1590953377645768704,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-11 14:23:38,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,t;\n    int i;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&t);\n    }\n    \n    for(i=0;i<n;i++)\n    {\n        printf(\""%d\\n\"",6);\n    }\n    return 0;\n}",WRONG_ANSWER,9,320
1590953390560051200,46a5b5de1986c03ade4ef3715390240d3b4a1729dbb6afcb5e53fc1bee0f1a07,2022-11-11 14:23:41,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"\n\n\tpublic static void main(String[] args) {\n\t\tSystem.out.print(\""2022\"");\n\n\t}\n\n\n",COMPILE_ERROR,0,0
1590953405965729792,c5cc6f9845df4bd1986af86c0696296436bbc0f00a10a9f891b4100e57bc3a19,2022-11-11 14:23:45,C++,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#define N 1000\nint main()\n{\n\tint n;\n\tint a[N],b[N];\n\tscanf(\""%d\"",&n);\n\tfor(int i=0;i<n;i++) scanf(\""%d\"",&a[i]);\n\tfor(int i=0;i<n;i++) {\n\t\tscanf(\""%d\"",&b[i]);\n\t\ta[i]=b[i]-a[i];\n\t}\n\tint maxx=0;\n\tfor(int i=0;i<n;i++){\n\t\tint sum=0,flag=0;\n\t\tint m=0;\n\t\tfor(int j=i;j<n;j++){\n\t\t\tsum+=a[j];\n\t\t\tflag++;\n\t\t\tif(sum>m) m=sum;\n\t\t}\n\t\tif(m>maxx) maxx=m;\n\t\tif(flag<0) continue;\n\t}\n\tprintf(\""%d\\n\"",maxx);\n}",ACCEPTED,3,352
1590953461947109376,9819f13d6a58d50fa249ad037641119dadb52afb3f125db258771564f27d2ca5,2022-11-11 14:23:58,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n\nint main() {\n\tint n, i;\n\tscanf(\""%d\"", &n);\n\tint a[n], b[n], c[n];\n\tfor (i = 0; i < n; i++) {\n\t\tscanf(\""%d \"", &a[i]);\n\t}\n\tfor ( i = 0; i < n; i++) {\n\t\tscanf(\""%d \"", &b[i]);\n\t}\n\tfor (i = 0; i < n; i++) {\n\t\tc[i] = b[i] - \ta[i];\n       \n\t}\n    \n\tint plan = c[0];\n\tint sign = plan;\n\tfor (i = 1; i < n; i++) {\n\t\tplan += c[i];\n\t\tif (plan > sign) {\n\t\t\tsign = plan;\n\t\t}\n\t}\n\tprintf(\""%d\\n\"", sign);\n\treturn 0;\n}",WRONG_ANSWER,3,180
1590953579882549248,2a1cee132cc8344d51461f6cbf473fb80705d6fd5972f9a5d0fcfea0760fd8b1,2022-11-11 14:24:26,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint mynum1(int N)\n{\n    int i,a,b,c;\n    a=N%10;\n    b=N%4;\n    if(b==0)\n    {\n        b=4;\n    }\n    c=a;\n    for(i=1;i<=b-1;i++)\n    {\n        c=c*a;\n    }\n    c=c%10;\n    return c;\n}\nint main()\n{\n    int t,N,i;\n    scanf(\""%d\"",&t);\n    for(i=1;i<=t;i++)\n    {\n        scanf(\""%d\"",&N);\n        printf(\""%d\\n\"",mynum1(6));\n    }\n}\n",WRONG_ANSWER,13,316
1590953586329169920,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 14:24:28,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#define n 100000\nint main()\n{\n    int a,i,j,t,sum=0;\n    scanf(\""%d\"",&a);\n    int b[n],c[n],d[n];\n    for(i=0;i<a;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(j=0;j<a;j++)\n    {\n        scanf(\""%d\"",&c[j]);\n    }\n    for(t=0;t<a;t++)\n    {\n        d[t]=c[t]-b[t];\n        if(d[t]>=0) sum+=d[t];\n    }\n    printf(\""%d\\n\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,4,308
1590953590695440384,44e63106384b2202d1a15f2fb61b15315a1f0761b20f40b73c55e6122e10f27d,2022-11-11 14:24:29,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"data = list(map(eval,input().split()))\ns = data[0]+data[1]-data[2]\nprint(s)\n",NON_ZERO_EXIT_CODE,17,3028
1590953619002798080,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-11 14:24:35,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,a[10],b[10],c[10],i,j,k,m,max=0,num=0;\n    scanf(\""%d\"",&n);\n    for(k=0;k<n;k++)\n    {\n        for(i=0;i<=n;i++)\n        scanf(\""%d\"",&a[i]);\n        for(j=0;j<=n;j++)\n        scanf(\""%d\"",&b[j]);\n        c[k]=a[i]-b[j];\n    }\n    if(c[k]>0)\n        num+=c[k];\n    printf(\""%d\"",num);\n    return 0;\n}",RUNTIME_ERROR,3,324
1590953721213816832,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-11 14:25:00,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,t;\n    int i;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&t);\n    }\n    for(i=0;i<n;i++)\n    {\n        if(t=0)\n            printf(\""%d\\n\"",0);\n        else\n            printf(\""%d\\n\"",6);\n    }\n    return 0;\n}",WRONG_ANSWER,9,352
1590953721742295040,46a5b5de1986c03ade4ef3715390240d3b4a1729dbb6afcb5e53fc1bee0f1a07,2022-11-11 14:25:00,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,int main{\n    int a=2022;\n    printf(a);\n},COMPILE_ERROR,0,0
1590953799638888448,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-11-11 14:25:18,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main()\n{\n    int n;\n    printf(\""%d\"",n);\n    return 0;\n}",WRONG_ANSWER,3,332
1590953849878282240,44e63106384b2202d1a15f2fb61b15315a1f0761b20f40b73c55e6122e10f27d,2022-11-11 14:25:30,Python,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\nl = int(input())\ndata = list(map(eval,input().split()))\nfor i in range(l):\n    if i ==l-1:\n        if data[i]==0:\n            print(1,end=\""\"")\n        else:\n            print(6,end=\""\"")\n    else:\n        if data[i]==0:\n            print(1)\n        else:\n            print(6)",ACCEPTED,51,2900
1590953868693909504,d122b81a371b28751082747cf65a235d0eddfd496e142775cd971d8f88adf327,2022-11-11 14:25:35,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n    int t;\n    scanf(\""%d\\n\"",&t);\n     int b[2][t];\n    scanf(\""%d\"",&b[2][t]);\n    int a[100];\n    for(int j=0;j<t;j++)\n    {\n        scanf(\""%d\"",&a[j]);}\n    int k=25;\n  printf(\""%d\\n\"",k);\n    return 0;}\n        \n  ",WRONG_ANSWER,3,328
1590953872644964352,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-11 14:25:36,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#define N 1000\nint main()\n{\n int n;\n int a[N],b[N];\n scanf(\""%d\"",&n);\n for(int i=0;i<n;i++) scanf(\""%d\"",&a[i]);\n for(int i=0;i<n;i++) {\n  scanf(\""%d\"",&b[i]);\n  a[i]=b[i]-a[i];\n }\n int maxx=0;\n for(int i=0;i<n;i++){\n  int sum=0,flag=0;\n  int m=0;\n  for(int j=i;j<n;j++){\n   sum+=a[j];\n   flag++;\n   if(sum>m) m=sum;\n  }\n  if(m>maxx) maxx=m;\n  if(flag<0) continue;\n }\n printf(\""%d\\n\"",maxx);\n}",ACCEPTED,3,200
1590953899043913728,acf80eea856463058b81f71c0238069795893092293fbd098cc594959df6444e,2022-11-11 14:25:42,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"n=int(input())\na=list(map(int,input().split()))\nfor i in range(n):\n    b=6**a[i]\n    c=b%10\n    print(c)",TIME_LIMIT_EXCEEDED,168,4148
1590953950008905728,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-11 14:25:54,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,t;\n    int i;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&t);\n    }\n    for(i=0;i<n;i++)\n    {\n        if(t==0)\n            printf(\""%d\\n\"",0);\n        else\n            printf(\""%d\\n\"",6);\n    }\n    return 0;\n}",WRONG_ANSWER,11,476
1590953954282897408,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 14:25:55,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,include <stido.h>\nint main(){\n    int x =2022;\n    print(x);\n    return 0;\n}\n,COMPILE_ERROR,0,0
1590953954840719360,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-11 14:25:55,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,a[10],b[10],c[10],i,k,m,max=0,num=0;\n    scanf(\""%d\"",&n);\n    for(k=0;k<n;k++)\n    {\n        for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n        scanf(\""%d\"",&b[i]);\n        c[k]=a[i]-b[i];\n    }\n    if(c[k]>0)\n        num+=c[k];\n    printf(\""%d\"",num);\n    return 0;\n}",RUNTIME_ERROR,3,308
1590953967037779968,9819f13d6a58d50fa249ad037641119dadb52afb3f125db258771564f27d2ca5,2022-11-11 14:25:58,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main() {\n\tint n, i;\n\tscanf(\""%d\"", &n);\n\tint a[n], b[n], c[n];\n\tfor (i = 0; i < n; i++) {\n\t\tscanf(\""%d \"", &a[i]);\n\t}\n\tfor ( i = 0; i < n; i++) {\n\t\tscanf(\""%d \"", &b[i]);\n\t}\n\tfor (i = 0; i < n; i++) {\n\t\tc[i] = b[i] - \ta[i];  \n\t}\n\tint plan = c[0];\n\tint sign = plan;\n\tfor (i = 1; i < n; i++) {\n\t\tplan += c[i];\n\t\tif (plan > sign) {\n\t\t\tsign = plan;\n\t\t}\n\t}\n\tprintf(\""%d\\n\"", sign);\n\treturn 0;\n}",WRONG_ANSWER,3,184
1590953998868328448,44e63106384b2202d1a15f2fb61b15315a1f0761b20f40b73c55e6122e10f27d,2022-11-11 14:26:06,Python,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"\ndef IsPrime(n):\n    # 2, 3 单独处理\n    if n == 2 or n == 3:\n        return True\n    # 不在 6 的倍数两侧的不是素数\n    if n % 6 != 1 and n % 6 != 5:\n        return False\n    # 在 6 的倍数两侧的不一定是素数\n    for i in range(5, int(n ** 0.5) + 1, 6):\n        # i 的步长可以放大到 6\n        if n % i == 0 or n % (i + 2) == 0:\n            return False\n    return True\ndata = int(input())\ns = 0\nfor i in range(2,data+1):\n    if IsPrime(i)==True:\n        s = s+1\nprint(s)\n",ACCEPTED,105,2884
1590954016656371712,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 14:26:10,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int t = 0;\n    scanf(\""%d\"",&t);\n    while(t--)\n    {\n        int n = 0;\n        scanf(\""%d\"",&n);\n        if(n == 0)\n        {\n            printf(\""1\\n\"");\n        }\n        else\n        {\n            printf(\""6\\n\"");\n        }\n    }\n    return 0;\n}",ACCEPTED,9,324
1590954020036980736,225b1524edf804414c466257a4f19789fe127117b27e663dc835d742fed77f9e,2022-11-11 14:26:11,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n\n    int x;\n    int k;\n    int sum;\n    scanf(\""%d\"",&x);\n    k=pow(6,x);\n    int g;\n    g=k%10;\n\n    printf(\""%d\"",g);\n\n    return 0;\n}\n",WRONG_ANSWER,6,324
1590954023732183040,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 14:26:12,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,include <stdio.h>\nint main(){\n    int x =2022;\n    print(x);\n    return 0;\n}\n,COMPILE_ERROR,0,0
1590954032322117632,1a4463a67236431e94a4a4d273d88450d6acce220fed7155af8798b0664ee731,2022-11-11 14:26:14,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint isprime(int n)\n{ int i;\n  for(i=2; i*i<=n; i++)\n    if(n%i==0)return 0;\n  return n>1;\n}\nint main()\n{ int n,i,s=0,k=0;\n  scanf(\""%d\"",&n);\n  for(i=2; i<=n; i++)\n    if(isprime(i))\n    { s+=i;\n      k++;\n    }\n  printf(\""共%d个素数，\"",k,s);\n  return 0;",COMPILE_ERROR,0,0
1590954094892748800,617f184ce583e9f7a346564ab5659fda0ca35a3a714a0c929cb07f915f4f514b,2022-11-11 14:26:29,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int t;\n    scanf(\""%d\"",&t);\n    if(t>=0&&t<=1000000000)\n    {\n        while(t--)\n        {\n            int i,n,res;\n            scanf(\""%d\"",&n);\n            res=pow(6,n);\n            i=res%10;\n            printf(\""%d\\n\"",i);\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,6,320
1590954119517507584,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 14:26:35,C++,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n = 0;\n    int count = 0;\n    scanf(\""%d\"",&n);\n    if(n > 2)\n    {\n            int i = 0;\n    for(i = 2; i < n; ++i)\n    {\n        int j = 0;\n        for(j = 2; j < n; ++j)\n        {\n            if(i % j == 0)\n            {\n                break;\n            }\n        }\n        if(i == j)\n        {\n           count++;\n        }\n    }\n    printf(\""%d\"",count);\n    }\n\n    return 0;\n}",ACCEPTED,938,376
1590954131769069568,4d1157ac6ad50cfc6ca5d6b3e1c2dd7f1ecc593df10ff6888d4207a4f1c03a35,2022-11-11 14:26:38,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#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        int m=6;\n        for(int j=0;j<a;j++)\n        {\n            m=m*6;\n        }\n        printf(\""%d\\n\"",m%10);\n    }\n    return 0;\n}",TIME_LIMIT_EXCEEDED,23,456
1590954177260486656,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-11 14:26:49,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,t;\n    int i;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&t);\n        if(t==0)\n            printf(\""%d\\n\"",0);\n        else\n            printf(\""%d\\n\"",6);\n    }\n\n    return 0;\n}",WRONG_ANSWER,8,328
1590954183560331264,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 14:26:50,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"include \""stdio.h\""\nint main(){\n    int x =2022;\n    print(x);\n    return 0;\n}",COMPILE_ERROR,0,0
1590954189889540096,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-11-11 14:26:52,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main()\n{\n    int n;\n    printf(\""%d\\n\"",n);\n    return 0;\n}",WRONG_ANSWER,3,340
1590954226728112128,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-11 14:27:00,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h> \n#include<math.h>\nint main(){\nint n;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tint M[n];\n\tfor(int i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t\tM[i]=pow(6,a[i]);\n\t\tM[i]=M[i]%10;\n\t}\n\tfor(int i=0;i<n;i++){\n\tif(i<n-1)\tprintf(\""%d\\n\"",M[i]);\n\telse printf(\""%d\"",M[i]);\n\t}\n}",WRONG_ANSWER,7,472
1590954234743402496,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-11 14:27:02,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,t;\n    int i;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&t);\n        if(t==0)\n            printf(\""%d\\n\"",1);\n        else\n            printf(\""%d\\n\"",6);\n    }\n\n    return 0;\n}",ACCEPTED,11,320
1590954269409345536,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 14:27:10,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,include <stdio.h>\nint main(){\n    int x =2022;\n    print(x);\n    return 0;\n},COMPILE_ERROR,0,0
1590954270927683584,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-11 14:27:11,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,a[10],b[10],c[10],i,k,m,num=0;\n    scanf(\""%d\"",&n);\n    for(k=0;k<n;k++)\n    {\n        for(i=0;i<n;i++)\n        {\n            scanf(\""%d\"",&a[i]);\n            scanf(\""%d\"",&b[i]);\n        }\n        c[k]=a[i]-b[i];\n    }\n    if(c[k]>0)\n        num+=c[k];\n    printf(\""%d\"",num);\n    return 0;\n}",RUNTIME_ERROR,4,312
1590954295158181888,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-11 14:27:17,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,t;\n    int i;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&t);\n    }\n    for(i=0;i<n;i++)\n    {\n        if(t==0)\n            printf(\""%d\\n\"",1);\n        else\n            printf(\""%d\\n\"",6);\n    }\n    return 0;\n}",WRONG_ANSWER,11,192
1590954325222948864,bce383372e0b1b627f0a9b838121096ec3ca14c0f213828fca1bf517a82c8744,2022-11-11 14:27:24,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    printf(\""2022\"");\n}",ACCEPTED,3,188
1590954447411412992,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-11 14:27:53,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,t;\n    int i;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&t);\n        if(t==0)\n            printf(\""%d\\n\"",1);\n        else\n            printf(\""%d\\n\"",6);\n    }\n    return 0;\n}",ACCEPTED,9,336
1590954468781391872,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-11 14:27:58,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,a[10],b[10],c[10],i,k,m,num=0;\n    scanf(\""%d\"",&n);\n    for(k=0;k<n;k++)\n    {\n        for(i=0;i<n;i++)\n        {\n            scanf(\""%d\"",&a[i]);\n        }\n        for(i=0;i<n;i++)\n        {\n            scanf(\""%d\"",&b[i]);\n        }\n        c[k]=a[i]-b[i];\n    }\n    if(c[k]>0)\n        num+=c[k];\n    printf(\""%d\"",num);\n    return 0;\n}",RUNTIME_ERROR,3,324
1590954475651641344,d21dc339d37b0772b2547441444d4b660b000ac3ebe190aee01769e2dd619c10,2022-11-11 14:28:00,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint X,Y,Z;\nint main()\n{\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    printf(\""%d\"",X+Y-Z);\n}",ACCEPTED,6,592
1590954505565417472,303021c0ef4f93101c801ad0c8851ab3828a16b5c728ce8e6859ab342ddc4b26,2022-11-11 14:28:07,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n   int x,y,z,d;\n   scanf(\""%d%d%d\"",&x,&y,&z);\n   if(0<=x,y,z<=100)\n    d=x+y-z;\n    printf(\""%d\"",d);\n    return 0;\n}\n",ACCEPTED,6,344
1590954644032000000,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 14:28:40,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<n;i++)\n    {\n        for(int k=2;k<i;k++)\n        {\n           if(i%k==0)\n           {\n               break;\n           }\n        }\n        if(i==k)\n        {\n            j++;\n        }\n    }\n    printf(\""%d\"",j);\n}",COMPILE_ERROR,0,0
1590954714005569536,9819f13d6a58d50fa249ad037641119dadb52afb3f125db258771564f27d2ca5,2022-11-11 14:28:56,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main() {\n\tint n, i,a[n];\n\tscanf(\""%d\"", &n);\n\tdouble m = 6, j, result;\n\tscanf(\""%lf\"", &j);\n\tfor (i = 0; i < n; i++) {\n\t\ta[i] = (int)pow(m, j);\n\t}\n\tfor (i = 0; i < n; i++) {\n\t\tprintf(\""%d\"", a[i] % 10);\n\t\tif (i < n - 1) {\n\t\t\tprintf(\""\\n\"");\n\t\t}\n\t}\n\treturn 0;\n}",WRONG_ANSWER,7,348
1590954768313421824,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-11 14:29:09,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,a[10],b[10],c[10],i,j,m,num=0;\n    scanf(\""%d\"",&n);\n        for(i=0;i<n;i++)\n        {\n            scanf(\""%d\"",&a[i]);\n        }\n        for(i=0;i<n;i++)\n        {\n            scanf(\""%d\"",&b[i]);\n        }\n        for(j=0;j<i;j++)\n        c[j]=a[i]-b[i];\n    }\n    if(c[j]>0)\n        num+=c[j];\n    printf(\""%d\"",num);\n    return 0;\n}",COMPILE_ERROR,0,0
1590954776374874112,7d46013a6da090b69b62e7be93e7628aee2f7eef31af37777b9ccf1fd1d3eb2e,2022-11-11 14:29:11,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main (){\n    int n,b;\n    scanf(\""%d\"",&n);\n    b=pow(6,n);\n    printf(\""%d\"",b%10);\n    getch();\n    return 0;\n}",COMPILE_ERROR,0,0
1590954790320930816,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-11-11 14:29:15,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main()\n{\n    int x;\n    printf(\""%4d\"",x);\n    return 0;\n}",WRONG_ANSWER,3,336
1590954810763968512,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 14:29:20,C++,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<n;i++)\n    {\n        int k=0;\n        for(k=2;k<i;k++)\n        {\n           if(i%k==0)\n           {\n               break;\n           }\n        }\n        if(i==k)\n        {\n            j++;\n        }\n    }\n    printf(\""%d\"",j);\n}",ACCEPTED,960,256
1590954873833721856,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-11 14:29:35,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,a[10],b[10],c[10],i,j,m,num=0;\n    scanf(\""%d\"",&n);\n        for(i=0;i<n;i++)\n        {\n            scanf(\""%d\"",&a[i]);\n        }\n        for(i=0;i<n;i++)\n        {\n            scanf(\""%d\"",&b[i]);\n        }\n        for(j=0;j<i;j++)\n        c[j]=a[i]-b[i];\n    \n    if(c[j]>0)\n        num+=c[j];\n    printf(\""%d\"",num);\n    return 0;\n}",RUNTIME_ERROR,4,452
1590954875230425088,0354b067c4132d4425a90b77482ac717447702274cb7db1282edce56eaf037b3,2022-11-11 14:29:35,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,j,k,n,ans,sum;\n    int a[100],b[100],c[100];\n    scanf(\""%d\"",&n);\n    ans=0;\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n    {\n        c[i]=b[i]-a[i];\n        sum=c[i];\n        for(j=i+1;j<n;j++)\n        {\n           c[j]=c[j-1]+b[j]-a[j];\n           if(sum<c[j])\n               sum=c[j];\n        }\n        if(i==0||ans<sum)\n           ans=sum;\n    }\n    printf(\""%d\"",ans);\n    return 0;\n}",SEGMENTATION_FAULT,139,344
1590954887070941184,7d46013a6da090b69b62e7be93e7628aee2f7eef31af37777b9ccf1fd1d3eb2e,2022-11-11 14:29:38,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main (){\n    int n,a;\n    scanf(\""%d\"",&n);\n    a=pow(6,n);\n    printf(\""%d\"",b%10);\n    getch();\n    return 0;\n}",COMPILE_ERROR,0,0
1590954925859864576,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 14:29:47,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#define n 100000\nint main()\n{\n    int a,i,j,t,sum=0;\n    scanf(\""%d\"",&a);\n    int b[n],c[n],d[n];\n    for(i=0;i<a;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(j=0;j<a;j++)\n    {\n        scanf(\""%d\"",&c[j]);\n    }\n    for(t=0;t<a;t++)\n    {\n        d[t]=c[t]-b[t];\n        if(d[t]>=0) sum+=d[t];\n    }\n    printf(\""%d\\n\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,3,196
1590954972185956352,0354b067c4132d4425a90b77482ac717447702274cb7db1282edce56eaf037b3,2022-11-11 14:29:58,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,j,n,ans,sum;\n    int a[100],b[100],c[100];\n    scanf(\""%d\"",&n);\n    ans=0;\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n    {\n        c[i]=b[i]-a[i];\n        sum=c[i];\n        for(j=i+1;j<n;j++)\n        {\n           c[j]=c[j-1]+b[j]-a[j];\n           if(sum<c[j])\n               sum=c[j];\n        }\n        if(i==0||ans<sum)\n           ans=sum;\n    }\n    printf(\""%d\"",ans);\n    return 0;\n}",SEGMENTATION_FAULT,140,376
1590955129958871040,46a5b5de1986c03ade4ef3715390240d3b4a1729dbb6afcb5e53fc1bee0f1a07,2022-11-11 14:30:36,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"System.out.print(\""2022\"");",COMPILE_ERROR,0,0
1590955138070679552,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-11 14:30:38,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#inclue <math.h>\nint main(){\n    int m,k;\n    int sum=0;\n    scanf(\""%d\"",&m);\n    for(int i=2;i<=m;i++)\n    {\n    k=sqrt(i);\n    for(int j=2;j<=k;j++)\n        if(i%j==0)\n         break;\n        if(j>k) \n        sum++;\n    }\n    printf(\""%d\"",sum);\n}",COMPILE_ERROR,0,0
1590955206622384128,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-11-11 14:30:54,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main()\n{\n    int x;\n    x=2022;\n    printf(\""%d\"",x);\n    return 0;\n}",ACCEPTED,3,356
1590955209906524160,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-11 14:30:55,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#define M 100\nint main()\n{\n    int n,a[M],b[M],c[M],i,max;\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=1;i<=n;i++)\n    scanf(\""%d\"",&b[i]);\n    for(i=1;i<=n;i++)\n    {\n    c[0]=0;\n    c[i]=b[i]-a[i]+c[i-1];\n    }\n    for(i=1;i<=n;i++)\n    if(c[i]>=c[i-1])\n    max=c[i];\n    printf(\""%d\\n\"",max);\n    return 0;\n}",WRONG_ANSWER,3,200
1590955228118192128,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-11 14:30:59,Java,0.0,1590734963702620160,1590734503495200768,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String args[]) {\n\n        int a;\n        int maxScoreFlag=0;\n        int maxScore=0;\n        int arr1[]=new int[500];\n        int arr2[]=new int[500];\n        Scanner scanner = new Scanner(System.in);\n        a=scanner.nextInt();\n        for (int i = 0; i < a; i++) {\n            arr1[i]=scanner.nextInt();\n        }\n        for (int i = 0; i < a; i++) {\n            arr2[i]=scanner.nextInt();\n        }\n        for (int i = 0; i < a; i++) {\n            arr1[i]=arr1[i]-arr2[i];\n        }\n        for (int i = 0; i < a; i++) {\n            if(arr1[i]<0&&maxScore>maxScoreFlag){\n                maxScoreFlag=maxScore;\n            }\n            maxScore=maxScore+arr1[i];\n            if(maxScore<0){\n                maxScore=0;\n            }\n        }\n        System.out.println(maxScoreFlag>maxScore?maxScoreFlag:maxScore);\n\n    }\n},WRONG_ANSWER,126,19208
1590955234703224832,55950e2d4c314feed0856fa0f6b80f22c5c36f2ebe0d75c8ee2cadb1a06b2fe1,2022-11-11 14:31:01,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main(){\n\n    int a,b[100],c[100],i,j,k;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++){\n        scanf(\""%d\"",&b[i]);\n        c[i]=pow(6,b[i]);\n        c[i]=c[i]%10;\n\n    }\n    for(i=0;i<a;i++){\n\n        printf(\""%d\\n\"",c[i]);\n    }\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n    return 0;\n}\n",WRONG_ANSWER,6,448
1590955261982978048,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 14:31:07,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main(void)\n{\n    int n,i,j,k;\n    int a[10];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=0;j<n;j++)\n    {\n        k=6^a[j];\n        k=k/(6^(a[j]-1));\n        printf(\""%d\\n\"",k);\n    }\n}",WRONG_ANSWER,3,196
1590955270442913792,7d46013a6da090b69b62e7be93e7628aee2f7eef31af37777b9ccf1fd1d3eb2e,2022-11-11 14:31:09,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main (){\n    int n,b;\n    scanf(\""%d\"",&n);\n    b=pow(6,n);\n    printf(\""%d\"",b%10);\n    getch();\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590955312146874368,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-11 14:31:19,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h> \n#include<math.h>\nint main(){\nint n;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tint M[n];\n\tfor(int i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n    \n    for(int i=0;i<n;i++){\n       if()\n    }\n\t\n}",COMPILE_ERROR,0,0
1590955334313750528,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-11 14:31:24,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int t,i;\n    int j,k;\n    scanf(\""%d\"",&t);\n     int a[t];\n    for(i=0;i<t;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<t;i++){\n        if(i<t-1)\n        {\n            if(a[i]) printf(\""6\\n\"");\n            else printf(\""1\\n\"");\n        }\n        else\n        {\n            if(a[i]) printf(\""6\"");\n            else printf(\""1\"");\n        }\n    }\n}",ACCEPTED,9,200
1590955372729380864,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-11 14:31:34,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int m,k;\n    int sum=0;\n    scanf(\""%d\"",&m);\n    for(int i=2;i<=m;i++)\n    {\n    k=sqrt(i);\n    for(int j=2;j<=k;j++)\n        if(i%j==0)\n         break;\n        if(j>k) \n        sum++;\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",COMPILE_ERROR,0,0
1590955386163761152,c5cc6f9845df4bd1986af86c0696296436bbc0f00a10a9f891b4100e57bc3a19,2022-11-11 14:31:37,C++,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <bits/stdc++.h>\nusing namespace std;\n#define N 1000\nint main()\n{\n\tint n;\n\tint a[N],b[N];\n\tcin>>n;\n\tfor(int i=0;i<n;i++) cin>>a[i];\n\tfor(int i=0;i<n;i++) {\n\t\tcin>>b[i];\n\t\ta[i]=b[i]-a[i];\n\t}\n\tint maxx=0;\n\tfor(int i=0;i<n;i++){\n\t\tint sum=0,m=0;\n\t\tfor(int j=i;j<n;j++){\n\t\t\tsum+=a[j];\n\t\t\tif(sum>m) m=sum;\n\t\t}\n\t\tif(m>maxx) maxx=m;\n\t}\n\tcout<<maxx<<endl;\n}",ACCEPTED,5,496
1590955392736235520,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-11 14:31:38,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,a[10],b[10],c[10],i,j,m,num=0;\n    scanf(\""%d\"",&n);\n        for(i=0;i<n;i++)\n        {\n            scanf(\""%d\"",&a[i]);\n        }\n        for(i=0;i<n;i++)\n        {\n            scanf(\""%d\"",&b[i]);\n        }\n     for(i=0;i<n;i++)\n     {  for(j=0;j<=i;j++)\n        c[j]=a[i]-b[i];\n     }\n    if(c[j]>0)\n        num+=c[j];\n    printf(\""%d\"",num);\n    return 0;\n}",RUNTIME_ERROR,3,320
1590955424524861440,64b76cc355daf11e96a19b338c58e56c05289d7e3809e9695a09e71771618713,2022-11-11 14:31:46,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n   int A,B,C,K;\n\n   scanf(\""%d %d %d\"",&A,&B,&C);\n   if(A>=0&&C<=100)\n\n printf(\""%d\"",K=A+B-C);\n\n\nreturn 0;\n   }",ACCEPTED,6,348
1590955432296886272,7d46013a6da090b69b62e7be93e7628aee2f7eef31af37777b9ccf1fd1d3eb2e,2022-11-11 14:31:48,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main (){\n    int n,b;\n    scanf(\""%d\"",&n);\n    b=pow(6,n);\n    printf(\""%d\"",b%10);\n    return 0;\n}\n",WRONG_ANSWER,4,320
1590955443122405376,4d1157ac6ad50cfc6ca5d6b3e1c2dd7f1ecc593df10ff6888d4207a4f1c03a35,2022-11-11 14:31:50,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#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        int m=6;\n        for(int j=0;j<a;j++)\n        {\n            m=m*6;\n        }\n        m=m%10;\n        printf(\""%d\\n\"",m);\n    }\n    return 0;\n}",TIME_LIMIT_EXCEEDED,25,448
1590955466031693824,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 14:31:56,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main(void)\n{\n    int n,i,j,k;\n    int a[10];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=0;j<n;j++)\n    {\n        k=6^a[j/(6^(a[j]-1));\n        printf(\""%d\\n\"",k);\n    }\n}",COMPILE_ERROR,0,0
1590955518485639168,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 14:32:08,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main(){\n\tint x = 2022;\n\tprintf(\""%d/n\"",x);\n\treturn 0;\n}",WRONG_ANSWER,3,184
1590955529869000704,d9e00d995e65b04cda3ddef6baec19225e4351002ab4efa981f62d78919a481b,2022-11-11 14:32:11,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    int i,j;\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(j=0;j<n;j++)\n        scanf(\""%d\"",&b[i]);\n    int max=0;\n    int sum=0;\n    for(i=0;i<n;i++)\n    {\n        sum = 0;\n        for(j=i;j<n;j++)\n        {\n            sum = sum - a[j] + b[j];\n            if(sum>max) max = sum;\n        }\n    }\n    printf(\""%d\"",max);\n    \n    return 0;\n}",WRONG_ANSWER,4,344
1590955556523806720,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 14:32:17,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main(void)\n{\n    int n,i,j,k;\n    int a[10];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=0;j<n;j++)\n    {\n        k=6^a[j]/(6^(a[j]-1));\n        printf(\""%d\\n\"",k);\n    }\n}",WRONG_ANSWER,3,316
1590955640867061760,902d8082eea06043d392298983db4630cde4418ac8ee42282d537bfaae045c2f,2022-11-11 14:32:37,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"max=0\nd=0\na=eval(input())\nb=input().split(\"" \"")\nc=input().split(\"" \"")\nfor i in range(a):\n    d +=(int(c[i])-int(b[i]))\n    if d>max:\n        max=d\nprint(max)",COMPILE_ERROR,0,0
1590955655521939456,55950e2d4c314feed0856fa0f6b80f22c5c36f2ebe0d75c8ee2cadb1a06b2fe1,2022-11-11 14:32:41,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main(){\n\n    int a,b[100],c[100],i,j,k;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++){\n        scanf(\""%d\"",&b[i]);\n        c[i]=pow(6,b[i]);\n        c[i]=c[i]%10;\n\n    }\n    for(i=0;i<a;i++){\n\n        printf(\""%d\\n\"",c[i]);\n    }\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n    return 0;\n}\n",WRONG_ANSWER,5,328
1590955682864607232,902d8082eea06043d392298983db4630cde4418ac8ee42282d537bfaae045c2f,2022-11-11 14:32:47,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"max=0\nd=0\na=eval(input())\nb=input().split(\"" \"")\nc=input().split(\"" \"")\nfor i in range(a):\n    d +=(int(c[i])-int(b[i]))\n    if d>max:\n        max=d\nprint(max)",WRONG_ANSWER,18,2816
1590955724161724416,55950e2d4c314feed0856fa0f6b80f22c5c36f2ebe0d75c8ee2cadb1a06b2fe1,2022-11-11 14:32:57,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main(){\n\n    int a,b[100],c[100],i;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++){\n        scanf(\""%d\"",&b[i]);\n        c[i]=pow(6,b[i]);\n        c[i]=c[i]%10;\n\n    }\n    for(i=0;i<a;i++){\n\n        printf(\""%d\\n\"",c[i]);\n    }\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n    return 0;\n}\n",WRONG_ANSWER,7,456
1590955771276341248,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 14:33:09,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main(){\n\tint x = 2022;\n\tprintf(\""%d\\n\"",x);\n\treturn 0;\n}",ACCEPTED,3,180
1590955778398289920,19b1d22e5c87afa9233c236fc7b4d5e0e70acf3872968cbe9aae96e75e9e38d1,2022-11-11 14:33:10,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"\n#include <iostream>\nusing namespace std;\n\n\nbool isOk(int &x){\n    for(int i =2 ;i<x/2;i++){\n        if( x%i == 0 )\n            return false;\n    }\n    return true;\n}\n\nint main()\n{\n    int a,count;\n    count=0;\n    cin >> a;\n    for(int i=3; i<a; i++){\n        if(isOk(i)){\n            count++;\n        }\n    }\n    cout << count<<endl;\n\n\n    return 0;\n}\n\n",NON_ZERO_EXIT_CODE,16,3004
1590955816734228480,19b1d22e5c87afa9233c236fc7b4d5e0e70acf3872968cbe9aae96e75e9e38d1,2022-11-11 14:33:19,C++,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"\n#include <iostream>\nusing namespace std;\n\n\nbool isOk(int &x){\n    for(int i =2 ;i<x/2;i++){\n        if( x%i == 0 )\n            return false;\n    }\n    return true;\n}\n\nint main()\n{\n    int a,count;\n    count=0;\n    cin >> a;\n    for(int i=3; i<a; i++){\n        if(isOk(i)){\n            count++;\n        }\n    }\n    cout << count<<endl;\n\n\n    return 0;\n}\n\n",ACCEPTED,486,480
1590955825550635008,bce383372e0b1b627f0a9b838121096ec3ca14c0f213828fca1bf517a82c8744,2022-11-11 14:33:22,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int x,y,z;\n    printf(\""请输入三个0-100的整数：\"");\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    if((x<0||x>100) && (y<0||y>100) && (z<0||z>100))\n        printf(\""输入错误！不在范围\\n\"");\n    else \n        printf(\""%d\"",x+y-z);\n}",WRONG_ANSWER,3,332
1590955840062947328,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 14:33:25,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main(void)\n{\n    int n,i,j,k;\n    int a[10];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=0;j<n;j++)\n    {\n        k=6^a[j]/(6^(a[j]-1));\n        \n    }\n    printf(\""%d\\n\"",k);\n}",WRONG_ANSWER,4,324
1590955863400034304,d9e00d995e65b04cda3ddef6baec19225e4351002ab4efa981f62d78919a481b,2022-11-11 14:33:31,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    int i,j;\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;j++)\n        scanf(\""%d\"",&b[i]);\n    int max=0;\n    int sum=0;\n    for(i=0;i<n;i++)\n    {\n        sum = 0;\n        for(j=i;j<n;j++)\n        {\n            sum = sum - a[j] + b[j];\n            if(sum>max) max = sum;\n        }\n    }\n    printf(\""%d\"",max);\n    \n    return 0;\n}",TIME_LIMIT_EXCEEDED,400,200
1590955869360140288,b73a04f1a7af1c2516ca68b38e336912bdf10c4f4bf7bac55e4e0de29dcf3d9d,2022-11-11 14:33:32,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"int prime_num;\nint prime[10000];\nint num[10000];\n\nvoid find_prime(int n){\n    for(int i=2;i<n;i++){\n        if(num[i])\n            prime[prime_num++]=i;\n    for(int j=0;j<prime_num&&i*prime[j]<=n;j++){\n        num[i*prime[j]]=0;\n        if(i*i*prime[j]==0)\n            break;\n    }\n}\n    \n}\n\nint main(){\n    int n;\n    scanf(\""%d\"",&n);\n    for(int i=1;i<=n;i++){\n        num[i]=1;\n    }\n    find_prime(n);\n//     for(int i=0'i<prime_num;i++){\n//         printf(\""%d\"",prime[i]);\n//     }\n    printf(\""%d\"",prime_num);\n    return 0;\n}",SEGMENTATION_FAULT,3,440
1590955925261848576,0da8f2df2eb12ff7cceee22b87284a0e7794d94d4125226481c0842fbed3108a,2022-11-11 14:33:45,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z,f;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    if(0<=X,Y,Z>=100)\n    f=X+Y-Z;\n    printf(\""%d\\n\"",f);\n    return 0;\n}\n",WRONG_ANSWER,3,320
1590955962259779584,bce383372e0b1b627f0a9b838121096ec3ca14c0f213828fca1bf517a82c8744,2022-11-11 14:33:54,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int x,y,z;\n    printf(\""请输入三个0-100的整数：\"");\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    if((x<0||x>100) && (y<0||y>100) && (z<0||z>100))\n        printf(\""输入错误！不在范围\\n\"");\n    else \n        printf(\""%d\"",x+y-z);\n}",WRONG_ANSWER,3,344
1590956085861748736,75a6755f083ffc71d77ba6ce593bd24fe8a2ce61edc4710fbde2dce128c47ab4,2022-11-11 14:34:24,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,sum=0;\n\n    scanf(\""%d\"",&n);\n\n    int a[n],b[n];\n\n    for(i=0;i<n;i++)\n    scanf(\""%d\"",&a[i]);\n\n    for(i=0;i<n;i++)\n    scanf(\""%d\"",&b[i]);\n\n\n    for(i=0;i<n;i++)\n    {\n        if(b[i]>a[i])\n        sum=sum+b[i]-a[i];\n        else\n            break;\n    }\n\n    printf(\""%d\"",sum);\n\n    return 0;\n\n}\n",WRONG_ANSWER,3,192
1590956089888280576,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-11-11 14:34:25,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d%d%d\""，&X，&Y,&Z);\n    M=X+Y-Z;\n    printf(\""%d\"",M);\n    return 0;\n}",COMPILE_ERROR,0,0
1590956137808199680,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-11-11 14:34:36,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main()\n{\n    int X,Y,Z,M;\n    scanf(\""%d%d%d\""，&X，&Y,&Z);\n    M=X+Y-Z;\n    printf(\""%d\"",M);\n    return 0;\n}",COMPILE_ERROR,0,0
1590956156648992768,950b2713b447943280c6052f88160e7298bd0ba94c14d628bbdd70df720305b5,2022-11-11 14:34:40,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"data = list(map(eval,input().split()))\ns = data[0]+data[1]-data[2]\nprint(s)",COMPILE_ERROR,0,0
1590956158775529472,acf80eea856463058b81f71c0238069795893092293fbd098cc594959df6444e,2022-11-11 14:34:41,Python,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"n=int(input())\na=list(map(int,input().split()))\nfor i in range(n):\n    if a[i]==0:\n        if i<n-1:\n            print(1)\n        else :\n            print(1,end=\""\"")\n    else:\n        if i<n-1:\n            print(6)\n        else :\n            print(6,end=\""\"")\n\n",ACCEPTED,51,2884
1590956209996365824,0354b067c4132d4425a90b77482ac717447702274cb7db1282edce56eaf037b3,2022-11-11 14:34:53,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,j,k,n,ans,sum;\n    int a[100],b[100],c[100];\n    scanf(\""%d\"",&n);\n    ans=0;\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n    {\n        c[i]=b[i]-a[i];\n        sum=c[i];\n        for(j=i+1;j<n;j++)\n        {\n           c[j]=c[j-1]+b[j]-a[j];\n        }\n        sum=c[i];\n        for(j=i+1;j<n;j++){\n        if(sum<c[j])\n               sum=c[j];\n        }\n        if(i==0||ans<sum)\n           ans=sum;\n    }\n    printf(\""%d\"",ans);\n    return 0;\n}",SEGMENTATION_FAULT,138,432
1590956232284897280,0da8f2df2eb12ff7cceee22b87284a0e7794d94d4125226481c0842fbed3108a,2022-11-11 14:34:58,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int x,y,z,f;\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    if(0<=x,y,z<=100)\n    f=X+Y-Z;\n    printf(\""%d\\n\"",f);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590956235044728832,950b2713b447943280c6052f88160e7298bd0ba94c14d628bbdd70df720305b5,2022-11-11 14:34:59,C++,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"data = list(map(eval,input().split()))\ns = data[0]+data[1]-data[2]\nprint(s)",COMPILE_ERROR,0,0
1590956239696232448,d830b0bcae7881ad6d1b2e2b14f3ffa3695b6d3bd622856493fa1cf903c9bf4e,2022-11-11 14:35:00,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc= new Scanner(System.in);\n\t\tint n =sc.nextInt();\n\t\tint[] arr1 = new int[n];\n\t\tint[] arr2 = new int[n];\n\t\tint[] nums = new int[n];\n\t\tfor(int i =0;i<arr1.length;i++) {\n\t\t\tarr1[i]= sc.nextInt();\n\t\t}\n\t\tfor(int i =0;i<arr2.length;i++) {\n\t\t\tarr2[i]= sc.nextInt();\n\t\t\tnums[i]=arr2[i]-arr1[1];\n\t\t}\n\t\tSystem.out.print(maxline(n,nums));\n\t}\n\tpublic static int maxline(int n,int arr[]) {\n\t\tint nums= 0;\n\t\tint b = 0;\n\t\tfor(int i =0;i<arr.length;i++) {\n\t\t\tif(b<0)b=arr[i];\n\t\t\telse b=b+arr[i];\n\t\t\tif(b>nums)nums=b;\n\t\t}\n\t\t\n\t\treturn nums;\n\t}\n\n}",COMPILE_ERROR,0,0
1590956257945649152,0354b067c4132d4425a90b77482ac717447702274cb7db1282edce56eaf037b3,2022-11-11 14:35:05,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,j,n,ans,sum;\n    int a[100],b[100],c[100];\n    scanf(\""%d\"",&n);\n    ans=0;\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n    {\n        c[i]=b[i]-a[i];\n        sum=c[i];\n        for(j=i+1;j<n;j++)\n        {\n           c[j]=c[j-1]+b[j]-a[j];\n        }\n        sum=c[i];\n        for(j=i+1;j<n;j++){\n        if(sum<c[j])\n               sum=c[j];\n        }\n        if(i==0||ans<sum)\n           ans=sum;\n    }\n    printf(\""%d\"",ans);\n    return 0;\n}",SEGMENTATION_FAULT,148,328
1590956304712142848,950b2713b447943280c6052f88160e7298bd0ba94c14d628bbdd70df720305b5,2022-11-11 14:35:16,Python,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"data = list(map(eval,input().split()))\ns = data[0]+data[1]-data[2]\nprint(s)",ACCEPTED,33,2880
1590956351629627392,0da8f2df2eb12ff7cceee22b87284a0e7794d94d4125226481c0842fbed3108a,2022-11-11 14:35:27,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int x,y,z,f;\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    if(0<=x,y,z<=100)\n    f=x+y-z;\n    printf(\""%d\\n\"",f);\n    return 0;\n}\n",ACCEPTED,7,448
1590956361914056704,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-11-11 14:35:29,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main()\n{\n    int X,Y,Z;\n    int M;\n    scanf(\""%d%d%d\""，&X，&Y,&Z);\n    M=X+Y-Z;\n    printf(\""%d\"",M);\n    return 0;\n}",COMPILE_ERROR,0,0
1590956376233410560,81f258582663b08bc9b4d77bba77afc3b463021ec8fb2262453de07687484cd5,2022-11-11 14:35:33,Python,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"data = list(map(eval,input().split()))\ns = data[0]+data[1]-data[2]\nprint(s)",ACCEPTED,32,2820
1590956392813498368,958c7c2b659bf7ed617a82cd0cf9adf876a6f164ed5327aaa53afbb4e117d40d,2022-11-11 14:35:37,Python,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"data = list(map(eval,input().split()))\ns = data[0]+data[1]-data[2]\nprint(s)",ACCEPTED,37,2912
1590956404217806848,8cf8229a23351e1ca2a7bfc1ad0af3ab2ad4a709a7c796637dbdea7befc2b0ec,2022-11-11 14:35:39,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n  int t,num,i,r;\n  scanf(\""%d\"",&t);\n  for(i=0;i<t;i++){\n    scanf(\""%d\"",&num);\n    num=6;\n    r=num%10;\n    if(r==0||r==1||r==5||r==6||r==9)\n      printf(\""%d\\n\"",r);\n    else{\n      if(num%4==0)\n        printf(\""%d\\n\"",r*r*r*r%10);\n      else if(num%4==1)\n        printf(\""%d\\n\"",r);\n      else if(num%4==2)\n        printf(\""%d\\n\"",r*r%10);\n      else if(num%4==3)\n        printf(\""%d\\n\"",r*r*r%10);\n    }\n  }\n}\n",WRONG_ANSWER,12,484
1590956408894435328,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 14:35:41,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n\nint main(){\n    int n = 0;\n    scanf(\""%d\"",&n);\n    \n    int arr1[n];\n    int arr2[n];\n    \n    for(int i = 0; i < n; ++i){\n        scanf(\""%d\"",&arr1[i]);\n    }\n    for(int i = 0; i < n; ++i){\n        scanf(\""%d\"",&arr2[i]);\n    }\n    \n    int sum = 0;\n    int max = 0;\n    for(int i = 0; i < n; ++i){\n        sum += arr2[i]-arr2[i];\n        if(sum > max){\n            max = sum;\n        }\n    }\n    \n    printf(\""%d\"",max);\n    \n    return 0;\n}",WRONG_ANSWER,4,196
1590956425487101952,46a5b5de1986c03ade4ef3715390240d3b4a1729dbb6afcb5e53fc1bee0f1a07,2022-11-11 14:35:45,Java,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        System.out.print(\""2022\"");\n}\n}",ACCEPTED,72,13956
1590956431099105280,81f258582663b08bc9b4d77bba77afc3b463021ec8fb2262453de07687484cd5,2022-11-11 14:35:46,Python,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\nl = int(input())\ndata = list(map(eval,input().split()))\nfor i in range(l):\n    if i ==l-1:\n        if data[i]==0:\n            print(1,end=\""\"")\n        else:\n            print(6,end=\""\"")\n    else:\n        if data[i]==0:\n            print(1)\n        else:\n            print(6)\n",ACCEPTED,54,2948
1590956489873862656,81f258582663b08bc9b4d77bba77afc3b463021ec8fb2262453de07687484cd5,2022-11-11 14:36:00,Python,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"def IsPrime(n):\n    # 2, 3 单独处理\n    if n == 2 or n == 3:\n        return True\n    # 不在 6 的倍数两侧的不是素数\n    if n % 6 != 1 and n % 6 != 5:\n        return False\n    # 在 6 的倍数两侧的不一定是素数\n    for i in range(5, int(n ** 0.5) + 1, 6):\n        # i 的步长可以放大到 6\n        if n % i == 0 or n % (i + 2) == 0:\n            return False\n    return True\ndata = int(input())\ns = 0\nfor i in range(2,data+1):\n    if IsPrime(i)==True:\n        s = s+1\nprint(s)",ACCEPTED,104,3152
1590956503194972160,bce383372e0b1b627f0a9b838121096ec3ca14c0f213828fca1bf517a82c8744,2022-11-11 14:36:03,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int x,y,z;\n    //printf(\""请输入三个0-100的整数：\"");\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    if((x<0||x>100) && (y<0||y>100) && (z<0||z>100))\n        printf(\""输入错误！不在范围\\n\"");\n    else \n        printf(\""%d\"",x+y-z);\n}",ACCEPTED,7,484
1590956548212457472,958c7c2b659bf7ed617a82cd0cf9adf876a6f164ed5327aaa53afbb4e117d40d,2022-11-11 14:36:14,Python,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\nl = int(input())\ndata = list(map(eval,input().split()))\nfor i in range(l):\n    if i ==l-1:\n        if data[i]==0:\n            print(1,end=\""\"")\n        else:\n            print(6,end=\""\"")\n    else:\n        if data[i]==0:\n            print(1)\n        else:\n            print(6)",ACCEPTED,49,2880
1590956574800150528,bce383372e0b1b627f0a9b838121096ec3ca14c0f213828fca1bf517a82c8744,2022-11-11 14:36:20,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    if((x<0||x>100) && (y<0||y>100) && (z<0||z>100))\n        printf(\""输入错误！不在范围\\n\"");\n    else \n        printf(\""%d\"",x+y-z);\n}",ACCEPTED,8,344
1590956581146136576,0354b067c4132d4425a90b77482ac717447702274cb7db1282edce56eaf037b3,2022-11-11 14:36:22,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n\n   int a[900],b[900],c[900],d[900];\nint main()\n{\n    int i,j,k,n,z,x;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(j=0;j<n;j++)\n    {\n        c[j]=b[j]-a[j];\n        for(i=j+1;i<n;i++)\n        {\n           c[i]=c[i-1]+b[i]-a[i];\n        }\n         z=c[j];\n        for(k=j+1;k<n;k++)\n        {\n            if(z<c[k])\n               z=c[k];\n        }\n        d[j]=z;\n    }\n    for(k=0;k<n;k++)\n    {\n        if(z<d[k])\n            z=d[k];\n    }\n    printf(\""%d\\n\"",z);\n    return 0;\n}",SEGMENTATION_FAULT,138,300
1590956624951422976,ccc42b8437aa15d1214e4623799ed35cd8ea8087c26cb1b596d51ae4556ea39c,2022-11-11 14:36:32,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=eval(input())\nb=input().split()\nj=0\nfor i in b:\n    if i==0:\n        print(1)\n    elif j==len(b):\n        if i==0:\n            print(1,end=\""\"")\n        else:\n            print(6,end=\""\"")\n    else:\n        print(6)\n    j+=1",WRONG_ANSWER,47,2760
1590956634212466688,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-11-11 14:36:34,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main()\n{\n    int X,Y,Z;\n    int M;\n    scanf(\""%d %d %d\""，&X，&Y,&Z);\n    M=X+Y-Z;\n    printf(\""%d\"",M);\n    return 0;\n}",COMPILE_ERROR,0,0
1590956667594932224,958c7c2b659bf7ed617a82cd0cf9adf876a6f164ed5327aaa53afbb4e117d40d,2022-11-11 14:36:42,Python,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"\ndef IsPrime(n):\n    # 2, 3 单独处理\n    if n == 2 or n == 3:\n        return True\n    # 不在 6 的倍数两侧的不是素数\n    if n % 6 != 1 and n % 6 != 5:\n        return False\n    # 在 6 的倍数两侧的不一定是素数\n    for i in range(5, int(n ** 0.5) + 1, 6):\n        # i 的步长可以放大到 6\n        if n % i == 0 or n % (i + 2) == 0:\n            return False\n    return True\ndata = int(input())\ns = 0\nfor i in range(2,data+1):\n    if IsPrime(i)==True:\n        s = s+1\nprint(s)",ACCEPTED,100,2908
1590956672108003328,950b2713b447943280c6052f88160e7298bd0ba94c14d628bbdd70df720305b5,2022-11-11 14:36:43,Python,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\nl = int(input())\ndata = list(map(eval,input().split()))\nfor i in range(l):\n    if i ==l-1:\n        if data[i]==0:\n            print(1,end=\""\"")\n        else:\n            print(6,end=\""\"")\n    else:\n        if data[i]==0:\n            print(1)\n        else:\n            print(6)\n",ACCEPTED,61,2920
1590956710720770048,81f258582663b08bc9b4d77bba77afc3b463021ec8fb2262453de07687484cd5,2022-11-11 14:36:53,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"print(\""2022\"")",ACCEPTED,16,2908
1590956722800361472,d9e00d995e65b04cda3ddef6baec19225e4351002ab4efa981f62d78919a481b,2022-11-11 14:36:55,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n;\n    int i,j;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    int max=0;\n    int sum=0;\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    \n    for(i=0;i<n;i++)\n    {\n        sum = 0;\n        for(j=i;j<n;j++)\n        {\n            sum = sum - a[j] + b[j];\n            if(sum>max) max = sum;\n        }\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",ACCEPTED,3,200
1590956729557385216,950b2713b447943280c6052f88160e7298bd0ba94c14d628bbdd70df720305b5,2022-11-11 14:36:57,Python,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"def IsPrime(n):\n    # 2, 3 单独处理\n    if n == 2 or n == 3:\n        return True\n    # 不在 6 的倍数两侧的不是素数\n    if n % 6 != 1 and n % 6 != 5:\n        return False\n    # 在 6 的倍数两侧的不一定是素数\n    for i in range(5, int(n ** 0.5) + 1, 6):\n        # i 的步长可以放大到 6\n        if n % i == 0 or n % (i + 2) == 0:\n            return False\n    return True\ndata = int(input())\ns = 0\nfor i in range(2,data+1):\n    if IsPrime(i)==True:\n        s = s+1\nprint(s)",ACCEPTED,96,2888
1590956766794416128,06b00897262b024d9e66dcd771cf81de9b63954f7a4554699d17c2158114c0d1,2022-11-11 14:37:06,Java,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner in = new Scanner(System.in);\n        int n=in.nextInt();\n        int a[]=new int[n];\n        int b[]=new int[n];\n        for(int i=0;i<n;i++){\n            a[i]=in.nextInt();\n        }\n        for(int i=0;i<n;i++){\n            b[i]=in.nextInt();\n            a[i]=b[i]-a[i];\n        }\n        int x=0,y=0;\n        for(int j=0;j<n;j++){\n            if(x>0){\n                x=x+a[j];\n            }else{\n                x=a[j];\n            }\n            if(x>y){\n                y=x;\n            }\n        }\n        System.out.println(y);\n    }\n}",ACCEPTED,125,18580
1590956821060321280,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-11-11 14:37:19,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main()\n{\n    int X,Y,Z;\n    float M;\n    scanf(\""%d %d %d\""，&X，&Y,&Z);\n    M=X+Y-Z;\n    printf(\""%f\"",M);\n    return 0;\n}",COMPILE_ERROR,0,0
1590956825413988352,0354b067c4132d4425a90b77482ac717447702274cb7db1282edce56eaf037b3,2022-11-11 14:37:20,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a[900],b[900],c[900],d[900];\n    int i,j,k,n,z;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(j=0;j<n;j++)\n    {\n        c[j]=b[j]-a[j];\n        for(i=j+1;i<n;i++)\n        {\n           c[i]=c[i-1]+b[i]-a[i];\n        }\n         z=c[j];\n        for(k=j+1;k<n;k++)\n        {\n            if(z<c[k])\n               z=c[k];\n        }\n        d[j]=z;\n    }\n    for(k=0;k<n;k++)\n    {\n        if(z<d[k])\n            z=d[k];\n    }\n    printf(\""%d\\n\"",z);\n    return 0;\n}",SEGMENTATION_FAULT,154,328
1590956831344754688,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 14:37:21,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n\nint main(){\n    int n = 0;\n    scanf(\""%d\"",&n);\n    \n    int arr1[n];\n    int arr2[n];\n    \n    for(int i = 0; i < n; ++i){\n        scanf(\""%d\"",&arr1[i]);\n    }\n    for(int i = 0; i < n; ++i){\n        scanf(\""%d\"",&arr2[i]);\n    }\n    \n    int sum = 0;\n    int max = 0;\n    for(int i = 0; i < n; ++i){\n        sum += arr2[i]-arr1[i];\n        if(sum > max){\n            max = sum;\n        }\n    }\n    \n    printf(\""%d\"",max);\n    \n    return 0;\n}",WRONG_ANSWER,4,192
1590956888894803968,d830b0bcae7881ad6d1b2e2b14f3ffa3695b6d3bd622856493fa1cf903c9bf4e,2022-11-11 14:37:35,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc= new Scanner(System.in);\n\t\tint n =sc.nextInt();\n\t\tint[] arr1 = new int[n];\n\t\tint[] arr2 = new int[n];\n\t\tint[] nums = new int[n];\n\t\tfor(int i =0;i<arr1.length;i++) {\n\t\t\tarr1[i]= sc.nextInt();\n\t\t}\n\t\tfor(int i =0;i<arr2.length;i++) {\n\t\t\tarr2[i]= sc.nextInt();\n\t\t\tnums[i]=arr2[i]-arr1[1];\n\t\t}\n\t\tSystem.out.print(maxline(n,nums));\n\t}\n\tpublic static int maxline(int n,int arr[]) {\n\t\tint nums= 0;\n\t\tint b = 0;\n\t\tfor(int i =0;i<arr.length;i++) {\n\t\t\tif(b<0)b=arr[i];\n\t\t\telse b=b+arr[i];\n\t\t\tif(b>nums)nums=b;\n\t\t}\n\t\t\n\t\treturn nums;\n\t}\n\n}",COMPILE_ERROR,0,0
1590956975993720832,46a5b5de1986c03ade4ef3715390240d3b4a1729dbb6afcb5e53fc1bee0f1a07,2022-11-11 14:37:56,Java,0.0,1590524835191705600,1572865591226855424,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc=new Scanner(System.in);\n        int x=sc.nextInt();\n        int y=sc.nesxInt();\n        int z=sc.nextInt();\n        System.out.print(x+y-z);\n    }\n},COMPILE_ERROR,0,0
1590957004959559680,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 14:38:03,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n\nint main(){\n    int n = 0;\n    scanf(\""%d\"",&n);\n    \n    int arr1[n];\n    int arr2[n];\n    \n    for(int i = 0; i < n; ++i){\n        scanf(\""%d\"",&arr1[i]);\n    }\n    for(int i = 0; i < n; ++i){\n        scanf(\""%d\"",&arr2[i]);\n    }\n    \n    int sum = 0;\n    int max = MIN_INT;\n    for(int i = 0; i < n; ++i){\n        sum += arr2[i]-arr1[i];\n        if(sum > max){\n            max = sum;\n        }\n    }\n    \n    printf(\""%d\"",max);\n    \n    return 0;\n}",COMPILE_ERROR,0,0
1590957048324493312,33066437ddee11f609c900fe8dbd59cb8113e4d8dfd13c1812f199f4f3fdd334,2022-11-11 14:38:13,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,t,x;\n    scanf(\""%d\"",&t);\n    for(i=1;i<=t;i++)\n    {\n        scanf(\""%d\"",&x);\n        if(x<1)printf(\""1\"");\n        else printf(\""6\"");\n    }\n}\n",WRONG_ANSWER,6,344
1590957056633409536,0354b067c4132d4425a90b77482ac717447702274cb7db1282edce56eaf037b3,2022-11-11 14:38:15,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,j,k,n,ans,sum;\n    int a[100],b[100],c[100];\n    scanf(\""%d\"",&n);\n    ans=0;\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n    {\n        c[i]=b[i]-a[i];\n        sum=c[i];\n        for(j=i+1;j<n;j++)\n        {\n           c[j]=c[j-1]+b[j]-a[j];\n        }\n        sum=c[i];\n        for(j=i+1;j<n;j++){\n        if(sum<c[j])\n               sum=c[j];\n        }\n        if(i==0||ans<sum)\n           ans=sum;\n    }\n    printf(\""%d\"",ans);\n    return 0;\n}",ACCEPTED,3,328
1590957068721393664,39afbda4ab6a7df2673bc0d0eec048a42b23ada2774ec941935a2b2fa044515a,2022-11-11 14:38:18,C++,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <bits/stdc++.h>\n#define MAX 10001\nusing namespace std;\nint main(){\n    int n,q=0,m=0;\n    int a[MAX],b[MAX],c[MAX];\n    int ThisSum=0,MaxSum=0,j;\ncin>>n;\nfor(int i=0;i<n;i++){\n    cin>>a[i];\n}\nfor(int i=0;i<n;i++){\n    cin>>b[i];\n}\nfor(int i=0;i<n;i++){\n    c[i]=b[i]-a[i];\n}\n\tfor(j=0;j<n;j++)\n\t{\n\t\tThisSum+=c[j];\n\t\tif(ThisSum>MaxSum)\n        MaxSum=ThisSum;\n\t\telse if(ThisSum<0)\n\t\t\tThisSum=0;\n\t}\n\tcout<<MaxSum;\n}\n\n",ACCEPTED,5,308
1590957097372659712,ccc42b8437aa15d1214e4623799ed35cd8ea8087c26cb1b596d51ae4556ea39c,2022-11-11 14:38:25,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=eval(input())\nb=input().split()\nj=0\nfor i in b:\n    j+=1\n    if i==0:\n        print(1)\n    elif j==len(b):\n        if i==0:\n            print(1,end=\""\"")\n        else:\n            print(\""6\"",end=\""\"")\n    else:\n        print(6)\n    ",WRONG_ANSWER,48,2888
1590957104750465024,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 14:38:26,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n\nint main(){\n    int n = 0;\n    scanf(\""%d\"",&n);\n    \n    int arr1[n];\n    int arr2[n];\n    \n    for(int i = 0; i < n; ++i){\n        scanf(\""%d\"",&arr1[i]);\n    }\n    for(int i = 0; i < n; ++i){\n        scanf(\""%d\"",&arr2[i]);\n    }\n    \n    int sum = 0;\n    int max = -1111111111;\n    for(int i = 0; i < n; ++i){\n        sum += arr2[i]-arr1[i];\n        if(sum > max){\n            max = sum;\n        }\n    }\n    \n    printf(\""%d\"",max);\n    \n    return 0;\n}",WRONG_ANSWER,4,324
1590957110660214784,81f258582663b08bc9b4d77bba77afc3b463021ec8fb2262453de07687484cd5,2022-11-11 14:38:28,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"print(\""2022\"")",ACCEPTED,19,3064
1590957200103768064,46a5b5de1986c03ade4ef3715390240d3b4a1729dbb6afcb5e53fc1bee0f1a07,2022-11-11 14:38:49,Java,300.0,1590524835191705600,1572865591226855424,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc=new Scanner(System.in);\n        int x=sc.nextInt();\n        int y=sc.nextInt();\n        int z=sc.nextInt();\n        System.out.print(x+y-z);\n    }\n},ACCEPTED,254,16736
1590957204138688512,33066437ddee11f609c900fe8dbd59cb8113e4d8dfd13c1812f199f4f3fdd334,2022-11-11 14:38:50,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,t,x;\n    scanf(\""%d\"",&t);\n    for(i=1;i<=t;i++)\n    {\n        scanf(\""%d\"",&x);\n        if(x<1)printf(\""1\"");\n        else printf(\""6\\n\"");\n    }\n}\n",WRONG_ANSWER,7,312
1590957241488945152,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 14:38:59,Java,300.0,1590524835191705600,1572865591226855424,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc=new Scanner(System.in);\n        int x=sc.nextInt();\n        int y=sc.nextInt();\n        int z=sc.nextInt();\n        System.out.println(x+y-z);\n    }\n},ACCEPTED,268,16628
1590957245171568640,a5291eb67188c2a916aa5dd9fc38f2e449aa9f9a3cd047f282d8c154ea2979cd,2022-11-11 14:39:00,C++,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n    cout << \""2022\""  << endl;\n    \n    return 0;\n}",ACCEPTED,3,476
1590957269062320128,950b2713b447943280c6052f88160e7298bd0ba94c14d628bbdd70df720305b5,2022-11-11 14:39:06,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"print(\"" 2022\"")",ACCEPTED,17,2880
1590957312611782656,958c7c2b659bf7ed617a82cd0cf9adf876a6f164ed5327aaa53afbb4e117d40d,2022-11-11 14:39:16,Python,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"print（\""2022\""）",NON_ZERO_EXIT_CODE,15,2888
1590957313282846720,e3700fa579dc7c925fa010ac870390ba9776ef5ee08f67752aeef4a9467c7624,2022-11-11 14:39:16,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""2022\\n\"");\n    return 0;\n}\n",ACCEPTED,4,308
1590957338398339072,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-11 14:39:22,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.math>\nint main()\n{\n    int n,m,result;\n    scanf(\""%d\"",&m);\n    for(int i=0;i<m;i++)\n    {\n        scanf(\""%d\"",&n);\n        result=(int)pow(6,n);\n        printf(\""%d\"",result/1%10);\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1590957351329378304,b73a04f1a7af1c2516ca68b38e336912bdf10c4f4bf7bac55e4e0de29dcf3d9d,2022-11-11 14:39:25,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <bits/stdc++.h>\n\nint prime_num;\nint prime[10000];\nint num[10000];\n\nvoid find_prime(int n){\n    for(int i=2;i<n;i++){\n        if(num[i])\n            prime[prime_num++]=i;\n    for(int j=0;j<prime_num&&i*prime[j]<=n;j++){\n        num[i*prime[j]]=0;\n        if(i*i*prime[j]==0)\n            break;\n    }\n}\n    \n}\n\nint main(){\n    int n;\n    scanf(\""%d\"",&n);\n    for(int i=1;i<=n;i++){\n        num[i]=1;\n    }\n    find_prime(n);\n//     for(int i=0'i<prime_num;i++){\n//         printf(\""%d\"",prime[i]);\n//     }\n    printf(\""%d\"",prime_num);\n    return 0;\n}\n\n// 999\n// 10\n// 20",SEGMENTATION_FAULT,5,512
1590957376096768000,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-11 14:39:31,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int n,m,result;\n    scanf(\""%d\"",&m);\n    for(int i=0;i<m;i++)\n    {\n        scanf(\""%d\"",&n);\n        result=(int)pow(6,n);\n        printf(\""%d\"",result/1%10);\n    }\n    return 0;\n}",WRONG_ANSWER,6,348
1590957417381277696,958c7c2b659bf7ed617a82cd0cf9adf876a6f164ed5327aaa53afbb4e117d40d,2022-11-11 14:39:41,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"print(\""2022\"")",ACCEPTED,16,3128
1590957483122819072,33066437ddee11f609c900fe8dbd59cb8113e4d8dfd13c1812f199f4f3fdd334,2022-11-11 14:39:57,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,t,x;\n    scanf(\""%d\"",&t);\n    for(i=1;i<=t;i++)\n    {\n        scanf(\""%d\"",&x);\n        if(x<1)printf(\""1\"");\n        else printf(\""6\\n\"");\n    }\n}\n",WRONG_ANSWER,7,332
1590957516400427008,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 14:40:05,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n\nint main(){\n    int n = 0;\n    scanf(\""%d\"",&n);\n    \n    int arr1[n];\n    int arr2[n];\n    \n    for(int i = 0; i < n; ++i){\n        scanf(\""%d\"",&arr1[i]);\n    }\n    for(int i = 0; i < n; ++i){\n        scanf(\""%d\"",&arr2[i]);\n    }\n    \n    int sum = 0;\n    int max = 0;\n    for(int i = 0; i < n; ++i){\n        sum += abs(arr2[i])-abs(arr1[i]);\n        if(sum > max){\n            max = sum;\n        }\n    }\n    \n    printf(\""%d\"",max);\n    \n    return 0;\n}",WRONG_ANSWER,3,184
1590957552513363968,a5291eb67188c2a916aa5dd9fc38f2e449aa9f9a3cd047f282d8c154ea2979cd,2022-11-11 14:40:13,C++,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n    int x,y,z;\n    cin >> x >> y >> z;\n    cout << x + y - z << endl;\n    \n    return 0;\n}\n",ACCEPTED,9,592
1590957588659896320,55950e2d4c314feed0856fa0f6b80f22c5c36f2ebe0d75c8ee2cadb1a06b2fe1,2022-11-11 14:40:22,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a,b,flag=0;\n    scanf(\""%d\"",&a);\n    for(i=2;i<a;i++){\n        if(a%i==0)\n            break;\n        if(i>n)\n            flag++\n        \n        \n    }\n    printf(\""%d\"",flag);\n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    return 0;\n}",COMPILE_ERROR,0,0
1590957617155997696,55950e2d4c314feed0856fa0f6b80f22c5c36f2ebe0d75c8ee2cadb1a06b2fe1,2022-11-11 14:40:29,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a,b,flag=0;\n    scanf(\""%d\"",&a);\n    for(i=2;i<a;i++){\n        if(a%i==0)\n            break;\n        if(i>n)\n            flag++;\n        \n        \n    }\n    printf(\""%d\"",flag);\n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    return 0;\n}",COMPILE_ERROR,0,0
1590957651641569280,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-11 14:40:37,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int n,m,result;\n    scanf(\""%d\"",&m);\n    for(int i=0;i<m;i++)\n    {\n        scanf(\""%d\"",&n);\n        result=(int)pow(6,n);\n        printf(\""%d \"",result/1%10);\n    }\n    return 0;\n}",WRONG_ANSWER,7,496
1590957717752184832,ccc42b8437aa15d1214e4623799ed35cd8ea8087c26cb1b596d51ae4556ea39c,2022-11-11 14:40:53,Python,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=eval(input())\nb=input().split()\nj=0\nfor i in b:\n    j+=1\n    \n    if j==len(b):\n        if i==0:\n            print(1,end=\""\"")\n        else:\n            print(\""6\"",end=\""\"")\n    elif i==\""0\"":\n        print(1)\n    else:\n        print(6)\n    ",ACCEPTED,50,2880
1590957727923372032,33066437ddee11f609c900fe8dbd59cb8113e4d8dfd13c1812f199f4f3fdd334,2022-11-11 14:40:55,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,t,x;\n    scanf(\""%d\"",&t);\n    for(i=1;i<=t;i++)\n    {\n        scanf(\""%d\"",&x);\n        if(x<1)printf(\""1\"");\n        else printf(\""6\"");\n        if(i<t) printf(\""\\n\"");\n    }\n}\n",WRONG_ANSWER,6,332
1590957732423839744,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-11 14:40:56,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int n,m,result;\n    scanf(\""%d\"",&m);\n    for(int i=0;i<m;i++)\n    {\n        scanf(\""%d\"",&n);\n        result=(int)pow(6,n);\n        printf(\""%d\\n\"",result/1%10);\n    }\n    return 0;\n}",WRONG_ANSWER,6,200
1590957787520241664,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-11 14:41:09,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nvoid main(){\n    int m,k;\n    int sum=0;\n    scanf(\""%d\"",&m);\n    for(int i=2;i<=m;i++)\n    {\n    for(int j=2;j<=sqrt(i);j++)\n    { \n        if(j%i==0)\n           { break;} }\n        if(j>sqrt(i)) \n           {sum++;}\n    }\n    printf(\""%d\"",sum);\n}",COMPILE_ERROR,0,0
1590957818474205184,7ecf54bf0ea2db8ab0397aa941f19ec79a351bc3e86e8c01673aa09a69b3a6db,2022-11-11 14:41:17,Python,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"n = int(input())\nl = ['f']*(n)\ns = 0\n\nfor i in range(2,n):\n    if(i*i>n):\n        break\n    if(l[i] == 'f'):\n        for j in range(i*i,n,i):\n            l[j] = 't'\n\nfor k in range(2, n):\n    if(l[k] == 'f'):\n        s += 1\nprint(s)",ACCEPTED,55,3644
1590957819233374208,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 14:41:17,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main(){\n    int x, y, z;\n    printf(\""请输入三个整数空格隔开：\"");\n    scanf(\""%-3d,%-3d\"",\""%-3d\"",&x,&y,&z);\n    \n    int m =0;\n    m = x+y-z;\n    printf(\""%d\\n\"",m);\n}",WRONG_ANSWER,3,320
1590957869527273472,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 14:41:29,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\n\nint main(){\n    int n = 0;\n    scanf(\""%d\"",&n);\n    \n    int arr1[n];\n    int arr2[n];\n    \n    for(int i = 0; i < n; ++i){\n        scanf(\""%d\"",&arr1[i]);\n    }\n    for(int i = 0; i < n; ++i){\n        scanf(\""%d\"",&arr2[i]);\n    }\n    \n    int sum = 0;\n    int max = 0;\n    for(int i = 0; i < n; ++i){\n        sum += abs(arr2[i])-abs(arr1[i]);\n        if(sum > max){\n            max = sum;\n        }\n    }\n    \n    printf(\""%d\"",max);\n    \n    return 0;\n}",WRONG_ANSWER,3,312
1590957912414027776,9819f13d6a58d50fa249ad037641119dadb52afb3f125db258771564f27d2ca5,2022-11-11 14:41:39,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <iostream>\n#include <math.h>\nusing namespace std;\n\nint main() {\n\tint n, a;\n\tscanf(\""%d\"", &n);\n\twhile (n--) {\n\t\tscanf(\""%d\"", &a);\n\t\tint t = a % 4;\n\t\tif (a % 4 == 0)\n\t\t\tt = 4;\n\t\ta %= 10;\n\t\tprintf(\""%d\"", (int)pow(6, t) % 10);\n        if(n>0){\n            printf(\""\\n\"");\n        }\n\t}\n\treturn 0;\n}",WRONG_ANSWER,8,448
1590957943518986240,33066437ddee11f609c900fe8dbd59cb8113e4d8dfd13c1812f199f4f3fdd334,2022-11-11 14:41:46,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,t,x;\n    scanf(\""%d\"",&t);\n    for(i=1;i<=t;i++)\n    {\n        scanf(\""%d\"",&x);\n        if(x<1)printf(\""1\"");\n        else printf(\""6\"");\n        if(i<t) printf(\""\\n\"");\n    }\n    return 0;\n}\n",WRONG_ANSWER,6,320
1590957946610167808,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 14:41:47,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main(){\n    int n = 0;\n    scanf(\""%d\"",&n);\n    \n    int arr1[n];\n    int arr2[n];\n    \n    for(int i = 0; i < n; ++i){\n        scanf(\""%d\"",&arr1[i]);\n    }\n    for(int i = 0; i < n; ++i){\n        scanf(\""%d\"",&arr2[i]);\n    }\n    \n    int sum = 0;\n    int max = 0;\n    for(int i = 0; i < n; ++i){\n        sum += abs(arr2[i])-abs(arr1[i]);\n        if(sum > max){\n            max = sum;\n        }\n    }\n    \n    printf(\""%d\"",max);\n    \n    return 0;\n}",WRONG_ANSWER,5,184
1590957948631846912,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-11 14:41:48,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nvoid main(){\n    int m,k;\n    int sum=0;\n    scanf(\""%d\"",&m);\n    for(int i=2;i<=m;i++)\n    {\n    for(int j=2;j<=sqrt(i);j++)\n    { \n        if(j%i==0)\n           { break;}\n        if(j>sqrt(i)) \n           {sum++;}\n    }\n  }\n    printf(\""%d\"",sum);\n}",WRONG_ANSWER,61,296
1590957948996726784,d830b0bcae7881ad6d1b2e2b14f3ffa3695b6d3bd622856493fa1cf903c9bf4e,2022-11-11 14:41:48,Java,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc= new Scanner(System.in);\n\t\tint n =sc.nextInt();\n\t\tint[] arr1 = new int[n];\n\t\tint[] arr2 = new int[n];\n\t\tint[] nums = new int[n];\n\t\tfor(int i =0;i<arr1.length;i++) {\n\t\t\tarr1[i]= sc.nextInt();\n\t\t}\n\t\tfor(int i =0;i<arr2.length;i++) {\n\t\t\tarr2[i]= sc.nextInt();\n\t\t\tnums[i]=arr2[i]-arr1[i];\n\t\t}\n\t\tSystem.out.print(maxline(n,nums));\n\t}\n\tstatic int maxline(int n,int arr[]) {\n\t\tint nums= 0;\n\t\tint b = 0;\n\t\tfor(int i =0;i<arr.length;i++) {\n\t\t\tif(b<0)b=arr[i];\n\t\t\telse b=b+arr[i];\n\t\t\tif(b>nums)nums=b;\n\t\t}\n\t\t\n\t\treturn nums;\n\t}\n\n}",ACCEPTED,135,16488
1590957960904355840,902d8082eea06043d392298983db4630cde4418ac8ee42282d537bfaae045c2f,2022-11-11 14:41:51,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,a=eval(input())\nb=input()\nfor i in range(a-1) :\n    print(6)\nprint(6),WRONG_ANSWER,50,2880
1590957967338418176,7e6a67f270e740aba8788a12d9a49939621a28d5059d3ced2247a86914b0a3b3,2022-11-11 14:41:52,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main(){\n    int n;\n    scanf(\""%d\"",&n);\n    int wi[n],wj[n],w[n];\n    int i,j,max=0,sum=0;\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&wi[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&wj[i]);\n\n    for(i=0;i<n;i++)\n        w[i]=wj[i]-wi[i];\n    for(i=0;i<n;i++)\n    {\n        sum=0;\n        for(j=0;j<n-i;j++)\n        {\n            if(sum+w[j]>=sum) sum=sum+w[j];\n            else if(sum>max) {\n                max=sum;\n                break;\n            }\n            else break;\n        }\n    }\n    printf(\""%d\"",max);\n}\n",WRONG_ANSWER,3,348
1590958035340693504,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 14:42:08,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main(){\n    int n = 0;\n    scanf(\""%d\"",&n);\n    \n    int arr1[n];\n    int arr2[n];\n    \n    for(int i = 0; i < n; ++i){\n        scanf(\""%d\"",&arr1[i]);\n    }\n    for(int i = 0; i < n; ++i){\n        scanf(\""%d\"",&arr2[i]);\n    }\n    \n    int sum = 0;\n    int max = 0;\n    for(int i = 0; i < n; ++i){\n        sum += arr2[i]-abs(arr1[i]);\n        if(sum > max){\n            max = sum;\n        }\n    }\n    \n    printf(\""%d\"",max);\n    \n    return 0;\n}",WRONG_ANSWER,5,472
1590958050532438016,00d0a1b2e987c17fb50850b9ec54bf6b4f8b997eb053d1a9fed6c4888fbe74ed,2022-11-11 14:42:12,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int i,j,n=0,x,flag;\n    scanf(\""%d\"",&x);\n    for (i=2;i<x;i++)\n    {\n        flag=0;\n        for(j=2;j<i;j++)\n        {\n            if(i%j==0)\n                { \n                flag++;\n                 break;\n                }\n        }\n        if (flag==0)\n            n=n+1;\n    }\n    printf(\""%d\"",n);\n    return 0;\n}",ACCEPTED,919,192
1590958062263906304,13616e85f216dd3844293b46f4b46105a0a2c458f7807a7b677858feb35cb63a,2022-11-11 14:42:15,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n    return 0;\n}\n",ACCEPTED,7,344
1590958070019174400,6a6dc7e644e57bb2c20b20d39bd4d9541bdebf6415e03e7c13707572c054673e,2022-11-11 14:42:17,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n    int m,i,n,sum=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<=n;i++)\n    {\n        for(m=2;m<i;m++)\n        {\n            if(i%m==0)\n                break;\n\n        }\n        if(i==m)\n            sum++;\n\n    }\n\n    printf(\""%d\"",sum);\n  return 0;\n\n}",ACCEPTED,977,448
1590958095256301568,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-11-11 14:42:23,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h> \n#include<math.h>\nint main(){\nint n;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(int i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n    \n    for(int i=0;i<n-1;i++){\n       if(a[i]==0&&i<(n-1)) printf(\""1\\n\"");\n       else printf(\""6\\n\"");\n    }\n    if(a[n-1]==0) printf(\""1\"");\n    else printf(\""6\"");\n\t\n}",ACCEPTED,9,344
1590958101753303040,d122b81a371b28751082747cf65a235d0eddfd496e142775cd971d8f88adf327,2022-11-11 14:42:24,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n    int t;\n    scanf(\""%d\\n\"",&t);\n    int a[100];\n    for(int j=0;j<t-1;j++)\n    {\n        scanf(\""%d\"",&a[j]);\n      \nprintf(\""6\\n\"");}\n        printf(\""6\"");\n  return 0;\n}\n",WRONG_ANSWER,11,332
1590958165087293440,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-11 14:42:39,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,a[10],b[10],c[10],i,j,k,m,num=0;\n    scanf(\""%d\"",&n);\n        for(i=0;i<n;i++)\n        {\n            scanf(\""%d\"",&a[i]);\n            scanf(\""%d\"",&b[i]);\n        }\n     for(i=0;i<n;i++)\n     {  for(j=0;j<=i;j++)\n         if(b[i]-a[i]>0)\n        c[j]=b[i]-a[i];\n     }\n    for(k=0;k<=j;k++)\n        num+=c[k];\n    printf(\""%d\"",num);\n    return 0;\n}",WRONG_ANSWER,3,312
1590958165196320768,b73a04f1a7af1c2516ca68b38e336912bdf10c4f4bf7bac55e4e0de29dcf3d9d,2022-11-11 14:42:39,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <bits/stdc++.h>\n\nint prime_num;\nint prime[10000];\nint num[10000];\n\nvoid find_prime(int n){\n    for(int i=2;i<n;i++){\n        if(num[i])\n            prime[prime_num++]=i;\n    for(int j=0;j<prime_num&&i*prime[j]<=n;j++){\n        num[i*prime[j]]=0;\n        if(i%prime[j]==0)\n            break;\n    }\n}\n    \n}\n\nint main(){\n    int n;\n    scanf(\""%d\"",&n);\n    for(int i=1;i<=n;i++){\n        num[i]=1;\n    }\n    find_prime(n);\n//     for(int i=0'i<prime_num;i++){\n//         printf(\""%d\"",prime[i]);\n//     }\n    printf(\""%d\"",prime_num);\n    return 0;\n}\n\n// 999\n// 10\n// 20",SEGMENTATION_FAULT,4,580
1590958201577738240,902d8082eea06043d392298983db4630cde4418ac8ee42282d537bfaae045c2f,2022-11-11 14:42:48,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=eval(input())\nb=input()\nfor i in range(a-1) :\n    print(6)\nprint(6,end=\""\"")",WRONG_ANSWER,55,2884
1590958226814840832,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-11 14:42:54,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int n,m,result,i;\n    scanf(\""%d\"",&m);\n    for(i=0;i<m;i++)\n    {\n        scanf(\""%d\"",&n);\n        result=(int)pow(6,n);\n        printf(\""%d\\n\"",result/1%10);\n    }\n    return 0;\n}",WRONG_ANSWER,7,308
1590958236516286464,b31601c92a4a3080abbaad650e00bb77253224eab66b59a49b2118d017649c2c,2022-11-11 14:42:56,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a；\n    a = scanf(%d)；\n    int b；\n    b = scanf(%d)；\n    int c；\n    c = scanf(%d)；\n    int d；\n    d = a + b - c；\n\n    printf(\""d\\n\"");\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590958289423216640,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-11 14:43:09,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int n,m,result,i;\n    scanf(\""%d\"",&m);\n    for(i=0;i<m;i++)\n    {\n        scanf(\""%d\"",&n);\n        result=pow(6,n);\n        printf(\""%d\\n\"",result/1%10);\n    }\n    return 0;\n}",WRONG_ANSWER,6,348
1590958314098331648,bce383372e0b1b627f0a9b838121096ec3ca14c0f213828fca1bf517a82c8744,2022-11-11 14:43:15,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int t,n;\n    scanf(\""%d\"",&t);\n    for(t=1;t<=3;t++)\n    {\n        scanf(\""%d\"",&n);\n        \n    }\n}",WRONG_ANSWER,3,472
1590958340870569984,667c2e97e82c372f60661d46943ff56a17c9350387f4364ebabe70ac2e232862,2022-11-11 14:43:21,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int t,n;\n    scanf(\""%d\"",&t);\n    scanf(\""%d %d %d\"",&n,&n,&n);\n    printf(\""6\"");\n    printf(\""6\"");\n    printf(\""6\"");\n    return 0;\n}",WRONG_ANSWER,3,192
1590958366548103168,25b8e249c556de062ec0d61286db67304f907bc70204e22083d75434403578b1,2022-11-11 14:43:27,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tprintf(\""2022\"");\n\treturn 0;\n} ",ACCEPTED,4,308
1590958373560954880,e3700fa579dc7c925fa010ac870390ba9776ef5ee08f67752aeef4a9467c7624,2022-11-11 14:43:29,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n   int X,Y,Z,d;\n   scanf(\""%d %d %d\"",&X,&Y,&Z);\n   d=X+Y-Z;\n   printf(\""%d\"",d);\n}\n",ACCEPTED,8,384
1590958406951833600,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 14:43:37,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc=new Scanner(System.in);\n        int x=sc.nextInt();\n        int[] n=new int[x];\n        for (int i = 0; i <x; i++) {\n            n[i]=sc.nextInt();\n        }\n        for (int i = 0; i <x; i++){\n            System.out.println(6);\n        }\n    }\n},NON_ZERO_EXIT_CODE,244,19444
1590958428766404608,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-11 14:43:42,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int n,m,result,i;\n    scanf(\""%d\"",&m);\n    for(i=0;i<m;i++)\n    {\n        scanf(\""%d\"",&n);\n        result=(int)pow(6,n);\n        printf(\""%d\\n\"",result/1%10);\n    }\n    return 0;\n}",WRONG_ANSWER,7,316
1590958441772941312,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 14:43:45,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"",&n);\n    int arr1[100] = {0};\n    int arr2[100] = {0};\n    for(int i = 0; i < n; ++i)\n    {\n        scanf(\""%d\"",arr1[i]);\n    }\n    for(int j = 0; j < n; ++j)\n    {\n        scanf(\""%d\"",arr2[j]);\n    }\n    int sz = sizeof(arr1/arr1[0]);\n    for(int k = 0; k < len; ++k)\n    {\n        int max1 = 0\n        int max2 += arr1[k] - arr2[k];\n        if(arr1[k] - arr2[k] < 0)\n        {\n            if(max1 < max2)\n            {\n                max1 = max2; \n            }\n            max2 = 0;\n        }\n    }\n    printf(\""%d\"",max1);\n    return 0\n}",COMPILE_ERROR,0,0
1590958442251071488,d122b81a371b28751082747cf65a235d0eddfd496e142775cd971d8f88adf327,2022-11-11 14:43:45,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n    int t;\n    scanf(\""%d\\n\"",&t);\n    int a[100];\n    for(int j=0;j<t-1;j++)\n    {\n        scanf(\""%d\"",&a[j]);\n        int a=6;\nprintf(\""%d\\n\"",a);}\n        printf(\""6\"");\n  return 0;\n}\n",WRONG_ANSWER,9,452
1590958462446645248,d9e00d995e65b04cda3ddef6baec19225e4351002ab4efa981f62d78919a481b,2022-11-11 14:43:50,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n;\n    int i,j;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    int max=0;\n    int sum=0;\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    \n    for(i=0;i<n;i++)\n    {\n        sum = 0;\n        for(j=i;j<n;j++)\n        {\n            sum = b[j]- a[j];\n            if(sum>max) max = sum;\n        }\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",WRONG_ANSWER,4,320
1590958462689935360,902d8082eea06043d392298983db4630cde4418ac8ee42282d537bfaae045c2f,2022-11-11 14:43:50,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=eval(input())\nb=input()\nfor i in range(a-1) :\n    print(6,end=\"" \"")\nprint(6,end=\""\"")",WRONG_ANSWER,50,2904
1590958462815744000,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 14:43:50,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main(){\n    int n = 0;\n    scanf(\""%d\"",&n);\n    \n    int arr1[n];\n    int arr2[n];\n    \n    for(int i = 0; i < n; ++i){\n        scanf(\""%d\"",&arr1[i]);\n    }\n    for(int i = 0; i < n; ++i){\n        scanf(\""%d\"",&arr2[i]);\n    }\n    \n    int sum = 0;\n    int max = INT_MIN;\n    for(int i = 0; i < n; ++i){\n        sum += arr2[i]-abs(arr1[i]);\n        if(sum > max){\n            max = sum;\n        }\n    }\n    \n    printf(\""%d\"",max);\n    \n    return 0;\n}",COMPILE_ERROR,0,0
1590958492431749120,a5291eb67188c2a916aa5dd9fc38f2e449aa9f9a3cd047f282d8c154ea2979cd,2022-11-11 14:43:57,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <iostream>\n\nusing namespace std;\n\n\nint main()\n{\n    int n = 0;\n    cin >> n;\n    for(int i = 1;i <= n;i++)\n    {\n        int input;\n        cin >> input;\n    }\n    for(int i = 1;i <= n;i++)\n    {\n        cout << \""6\"" << endl;\n    }\n    \n    return 0;\n}",WRONG_ANSWER,14,472
1590958519162023936,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-11 14:44:04,Java,0.0,1590734963702620160,1590734503495200768,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String args[]) {\n\n        int a;\n        int flag=1;\n        int maxScoreFlag=0;\n        int maxScore=0;\n        int arr1[]=new int[500];\n        int arr2[]=new int[500];\n        Scanner scanner = new Scanner(System.in);\n        a=scanner.nextInt();\n        for (int i = 0; i < a; i++) {\n            arr1[i]=scanner.nextInt();\n        }\n        for (int i = 0; i < a; i++) {\n            arr2[i]=scanner.nextInt();\n        }\n        for (int i = 0; i < a; i++) {\n            arr1[i]=arr1[i]-arr2[i];\n        }\n        for (int i = 0; i < a; i++) {\n            if(arr1[i]>0){\n                flag=0;\n            }\n        }\n        if(flag==0) {\n            for (int i = 0; i < a; i++) {\n                if (arr1[i] < 0 && maxScore > maxScoreFlag) {\n                    maxScoreFlag = maxScore;\n                }\n                maxScore = maxScore + arr1[i];\n                if (maxScore < 0) {\n                    maxScore = 0;\n                }\n\n            }\n            System.out.println(maxScoreFlag>maxScore?maxScoreFlag:maxScore);\n        }\n        else{\n            maxScoreFlag=arr1[0];\n            for (int i = 0; i < a; i++) {\n                if(maxScoreFlag<arr1[i]){\n                    maxScoreFlag=arr1[i];\n                }\n            }\n            System.out.println(maxScoreFlag);\n        }\n\n\n    }\n}\n,WRONG_ANSWER,124,16616
1590958531627495424,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 14:44:07,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main(){\n    int n = 0;\n    scanf(\""%d\"",&n);\n    \n    int arr1[n];\n    int arr2[n];\n    \n    for(int i = 0; i < n; ++i){\n        scanf(\""%d\"",&arr1[i]);\n    }\n    for(int i = 0; i < n; ++i){\n        scanf(\""%d\"",&arr2[i]);\n    }\n    \n    int sum = 0;\n    int max = -100000;\n    for(int i = 0; i < n; ++i){\n        sum += arr2[i]-abs(arr1[i]);\n        if(sum > max){\n            max = sum;\n        }\n    }\n    \n    printf(\""%d\"",max);\n    \n    return 0;\n}",WRONG_ANSWER,3,184
1590958563936243712,667c2e97e82c372f60661d46943ff56a17c9350387f4364ebabe70ac2e232862,2022-11-11 14:44:14,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int t,x,y,z;\n    scanf(\""%d\"",&t);\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""6\"");\n    printf(\""6\"");\n    printf(\""6\"");\n    return 0;\n}",WRONG_ANSWER,3,184
1590958636904525824,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 14:44:32,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main(){\n    int x, y, z;\n    printf(\""请输入三个整数空格隔开：\"");\n    scanf(\""%-3d,%-3d\"",\""%-3d\"",&x,&y,&z);\n    \n    int m =0;\n    m = x+y-z;\n    printf(\""%d\\n\"",m);\n}",WRONG_ANSWER,3,464
1590958682907652096,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 14:44:43,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"",&n);\n    int arr1[100] = {0};\n    int arr2[100] = {0};\n    for(int i = 0; i < n; ++i)\n    {\n        scanf(\""%d\"",arr1[i]);\n    }\n    for(int j = 0; j < n; ++j)\n    {\n        scanf(\""%d\"",arr2[j]);\n    }\n    int sz = sizeof(arr1/arr1[0]);\n    for(int k = 0; k < len; ++k)\n    {\n        int max1 = 0;\n        int max2 += arr1[k] - arr2[k];\n        if(arr1[k] - arr2[k] < 0)\n        {\n            if(max1 < max2)\n            {\n                max1 = max2; \n            }\n            max2 = 0;\n        }\n    }\n    printf(\""%d\"",max1);\n    return 0\n}",COMPILE_ERROR,0,0
1590958753229352960,4d1157ac6ad50cfc6ca5d6b3e1c2dd7f1ecc593df10ff6888d4207a4f1c03a35,2022-11-11 14:45:00,C++,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<iostream>\n#include<cstdio>\nusing namespace std;\nint main()\n{\n   int n,x=0;\n    cin>>n;\n    for(int j=1;j<n;j++)\n    {\n        int a=0;\n        for(int i=2;i<=j/i;i++)\n        {\n            if(j%i==0)\n            a++;\n        }\n        if(a==0)x++;\n    }\n        printf(\""%d\"",x-1);\n    return 0;\n}",ACCEPTED,63,436
1590958842974875648,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 14:45:21,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"n = int(input())\nxh = list(map(eval,input().split()))\nhd = list(map(eval,input().split()))\ndata=[]\ns = 0\nfor i in range(n):\n    s = hd[i]-xh[i]\n    data.append(s)\nfor i in data:\n    print(i)\n    if i=>0:\n        s = s+i\n    else:\n        print(s)",NON_ZERO_EXIT_CODE,17,2784
1590958849211826176,9819f13d6a58d50fa249ad037641119dadb52afb3f125db258771564f27d2ca5,2022-11-11 14:45:22,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <iostream>\n#include <math.h>\nusing namespace std;\n\nint main() {\n\tint n, a;\n\tscanf(\""%d\"", &n);\n\twhile (n--) {\n\t\tscanf(\""%d\"", &a);\n\t\tprintf(\""%d\"", (int)pow(6, a) % 10);\n        if(n>0){\n            printf(\""\\n\"");\n        }\n\t}\n\treturn 0;\n}",WRONG_ANSWER,8,472
1590958854769283072,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 14:45:24,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"n = int(input())\nxh = list(map(eval,input().split()))\nhd = list(map(eval,input().split()))\ndata=[]\ns = 0\nfor i in range(n):\n    s = hd[i]-xh[i]\n    data.append(s)\nfor i in data:\n    print(i)\n    if i=>0:\n        s = s+i\n    else:\n        print(s)",NON_ZERO_EXIT_CODE,18,2872
1590958862331613184,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 14:45:26,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"n = int(input())\nxh = list(map(eval,input().split()))\nhd = list(map(eval,input().split()))\ndata=[]\ns = 0\nfor i in range(n):\n    s = hd[i]-xh[i]\n    data.append(s)\nfor i in data:\n    print(i)\n    if i=>0:\n        s = s+i\n    else:\n        print(s)",NON_ZERO_EXIT_CODE,16,2884
1590958865871601664,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-11 14:45:26,Java,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String args[]) {\n\n        int a;\n        int flag=1;\n        int maxScoreFlag=0;\n        int maxScore=0;\n        int arr1[]=new int[500];\n        int arr2[]=new int[500];\n        Scanner scanner = new Scanner(System.in);\n        a=scanner.nextInt();\n        for (int i = 0; i < a; i++) {\n            arr1[i]=scanner.nextInt();\n        }\n        for (int i = 0; i < a; i++) {\n            arr2[i]=scanner.nextInt();\n        }\n        for (int i = 0; i < a; i++) {\n            arr1[i]=arr1[i]-arr2[i];\n        }\n        for (int i = 0; i < a; i++) {\n            if(arr1[i]>0){\n                flag=0;\n            }\n        }\n        if(flag==0) {\n            for (int i = 0; i < a; i++) {\n                if (arr1[i] < 0 && maxScore > maxScoreFlag) {\n                    maxScoreFlag = maxScore;\n                }\n                maxScore = maxScore + arr1[i];\n                if (maxScore < 0) {\n                    maxScore = 0;\n                }\n\n            }\n            System.out.println(maxScoreFlag>maxScore?maxScoreFlag:maxScore);\n        }\n        else{\n            \n            System.out.println(\""0\"");\n        }\n\n\n    }\n}\n",WRONG_ANSWER,129,16208
1590958871982682112,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 14:45:28,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"n = int(input())\nxh = list(map(eval,input().split()))\nhd = list(map(eval,input().split()))\ndata=[]\ns = 0\nfor i in range(n):\n    s = hd[i]-xh[i]\n    data.append(s)\nfor i in data:\n    print(i)\n    if i=>0:\n        s = s+i\n    else:\n        print(s)",NON_ZERO_EXIT_CODE,19,2756
1590958883324100608,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 14:45:31,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"n = int(input())\nxh = list(map(eval,input().split()))\nhd = list(map(eval,input().split()))\ndata=[]\ns = 0\nfor i in range(n):\n    s = hd[i]-xh[i]\n    data.append(s)\nfor i in data:\n    print(i)\n    if i=>0:\n        s = s+i\n    else:\n        print(s)",NON_ZERO_EXIT_CODE,16,2816
1590959004212330496,19b1d22e5c87afa9233c236fc7b4d5e0e70acf3872968cbe9aae96e75e9e38d1,2022-11-11 14:45:59,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"a = input()\na1 = input().split(\"" \"")\na2 = input().split(\"" \"")\nb = [int(a2[i]) - int(a1[i]) for i in range(0, len(a2))]\nf = 0\nfor i in b:\n    temp = f + i\n    if f < temp: f = temp\nprint(f)",WRONG_ANSWER,17,2756
1590959011053240320,b31601c92a4a3080abbaad650e00bb77253224eab66b59a49b2118d017649c2c,2022-11-11 14:46:01,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a;\n    a = scanf(%d,a);\n    int b;\n    b = scanf(%d,b);\n    int c;\n    c = scanf(%d,c);\n    int d;\n    d = a + b - c;\n\n    printf(\""d\\n\"");\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590959013649514496,345826d11b41befc23adeb536e81da8eb6ec9a8bfb9448acf91422deedb8ba4a,2022-11-11 14:46:02,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,i,c,max=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],s[n]={0};\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n     for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n        s[0]=b[0]-a[0];\n     for(i=1;i<n;i++)\n        {\n            c=b[i]-a[i];\n            s[i]=s[i-1]+c;\n        }\n        max=s[0];\n    for(i=0;i<n-1;i++)\n    {\n        if(max>=s[i+1])\n           ;\n        else\n            max=s[i+1];\n    }\n   printf(\""%d\"",max);\n}\n",COMPILE_ERROR,0,0
1590959019311804416,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 14:46:03,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"",&n);\n    int arr1[100] = {0};\n    int arr2[100] = {0};\n    for(int i = 0; i < n; ++i)\n    {\n        scanf(\""%d\"",&arr1[i]);\n    }\n    for(int j = 0; j < n; ++j)\n    {\n        scanf(\""%d\"",&arr2[j]);\n    }\n    int sz = sizeof(arr1/arr1[0]);\n    for(int k = 0; k < len; ++k)\n    {\n        int max1 = 0;\n        int max2 += arr1[k] - arr2[k];\n        if(arr1[k] - arr2[k] < 0)\n        {\n            if(max1 < max2)\n            {\n                max1 = max2; \n            }\n            max2 = 0;\n        }\n    }\n    printf(\""%d\"",max1);\n    return 0\n}",COMPILE_ERROR,0,0
1590959024001036288,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 14:46:04,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main(){\n    int x, y, z;\n    printf(\""请输入三个整数空格隔开：\"");\n    scanf(\""%-3d%-3d%-3d\"",&x,&y,&z);\n    \n    int m =0;\n    m = x+y-z;\n    printf(\""%d\\n\"",m);\n}",WRONG_ANSWER,3,308
1590959049762476032,25b8e249c556de062ec0d61286db67304f907bc70204e22083d75434403578b1,2022-11-11 14:46:10,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint a,b,c;\n\tscanf(\""%d %d %d\"",&a,&b,&c);\n\tprintf(\""%d\"",a+b-c);\n\treturn 0;\n} ",ACCEPTED,5,188
1590959092372385792,d9e00d995e65b04cda3ddef6baec19225e4351002ab4efa981f62d78919a481b,2022-11-11 14:46:20,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n;\n    int i,j,sum,max;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    \n    for(i=0;i<n;i++)\n    {\n        sum = 0;\n        for(j=i;j<n;j++)\n        {\n            sum = sum - a[j] + b[j];\n            if(sum>max) max = sum;\n        }\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",ACCEPTED,2,196
1590959135653408768,d122b81a371b28751082747cf65a235d0eddfd496e142775cd971d8f88adf327,2022-11-11 14:46:31,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n    int t;\n    scanf(\""%d\\n\"",&t);\n    int a[100];\n    int b=6;\n    for(int j=0;j<t-1;j++)\n    {\n        scanf(\""%d\"",&a[j]);\n        int a=6;\nprintf(\""%d\\n\"",a);}\n        printf(\""%d\"",b);\n  return 0;\n}\n",WRONG_ANSWER,9,184
1590959143517749248,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-11 14:46:33,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int n,m,result,i;\n    scanf(\""%d\"",&m);\n    for(i=0;i<m;i++)\n    {\n        scanf(\""%d\"",&n);\n        result=(int)pow(6,n);\n        printf(\""%d\\n\"",result/1%10);\n    }\n\n}",WRONG_ANSWER,7,460
1590959156792721408,b80fc2aed0abde15bdaa9327874c9784da696b6ed442d90001602ff2a017be15,2022-11-11 14:46:36,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main(){\n\tint a,b[100000],i;\n    scanf(\""%d\"",&a);\n\tfor(i=0;i<a;i++)\n\t  scanf(\""%d\"",&b[i]);\n\tfor(i=0;i<a;i++)\n\t {\n\t if(b[i]!=0) \n\t  printf(\""6\\n\"");\n\t else\n\t  printf(\""1\\n\"");  \n}\n    return 0;\n}",ACCEPTED,11,360
1590959270252818432,1a4463a67236431e94a4a4d273d88450d6acce220fed7155af8798b0664ee731,2022-11-11 14:47:03,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include \""stdio.h\""\nint prime(int n){\n    int i;\n    if(n>2 && !(n&1) || n<2)\n        return 0;\n    for(i=3;i*i<=n;i+=2)\n        if(!(n%i))\n            return 0;\n    return 1;\n}\nint main(int argc,char *argv[]){\n    int n,s,i;\n    printf(\""输入素数\\n\"");\n    if(scanf(\""%d\"",&n)!=1 || n<1){\n\n        return 0;\n    }\n    for(s=0,i=2;i<=n;i++)\n        if(prime(i)){\n        s++;\n        }\n    printf(\""\\一共有 %d 个素数.\\n\"",s);\n    return 0;\n}\n",WRONG_ANSWER,7,204
1590959296265912320,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 14:47:09,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"n = int(input())\nxh = list(map(eval,input().split()))\nhd = list(map(eval,input().split()))\ndata=[]\ns = 0\nfor i in range(n):\n    s = hd[i]-xh[i]\n    data.append(s)\nfor i in data:\n    sp=i\n    if sp>=0:\n        s = s+i\n    else:\n        print(s)",WRONG_ANSWER,15,2816
1590959303995994112,acfcf65f14b5d3b02c3225372654b4e21f04d33a8bbaeb346e4fb1d85f2ea94f,2022-11-11 14:47:11,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n  int t,num,i,r;\n  scanf(\""%d\"",&t);\n  for(i=0;i<t;i++){\n    scanf(\""%d\"",&num);\n    num=6;\n    r=num%10;\n    if(r==6)\n      printf(\""%d\\n\"",r);\n    \n    \n  }\n    return 0;\n}\n",WRONG_ANSWER,9,344
1590959349499998208,b73a04f1a7af1c2516ca68b38e336912bdf10c4f4bf7bac55e4e0de29dcf3d9d,2022-11-11 14:47:22,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <bits/stdc++.h>\n\nint prime_num;\nint prime[10000];\nint num[10000];\n\nvoid find_prime(int n){\n    for(int i=2;i<n;i++){\n        if(num[i])\n            prime[prime_num++]=i;\n    for(int j=0;j<prime_num&&i*prime[j]<=n;j++){\n        num[i*prime[j]]=0;\n        if(i%prime[j]==0)\n            break;\n    }\n}\n    printf(\""%d\"",prime_num);\n}\n\nint main(){\n    int n;\n    scanf(\""%d\"",&n);\n    for(int i=1;i<=n;i++){\n        num[i]=1;\n    }\n    find_prime(n);\n//     for(int i=0'i<prime_num;i++){\n//         printf(\""%d\"",prime[i]);\n//     }\n//     printf(\""%d\"",prime_num);\n    return 0;\n}\n\n// 999\n// 10\n// 20",SEGMENTATION_FAULT,6,588
1590959382966370304,902d8082eea06043d392298983db4630cde4418ac8ee42282d537bfaae045c2f,2022-11-11 14:47:30,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=eval(input())\nb=input()\nfor i in range(a-1) :\n    print(\""6 \"")\nprint(6,end=\""\"")",WRONG_ANSWER,51,2888
1590959417598742528,9819f13d6a58d50fa249ad037641119dadb52afb3f125db258771564f27d2ca5,2022-11-11 14:47:38,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <iostream>\n#include <math.h>\n\nint main() {\n\tint n, a;\n\tscanf(\""%d\"", &n);\n\twhile (n--) {\n\t\tscanf(\""%d\"", &a);\n\t\tprintf(\""%d\\n\"", (int)pow(6, a) % 10);\n\n\t}\n\treturn 0;\n}",WRONG_ANSWER,10,440
1590959428663312384,bce383372e0b1b627f0a9b838121096ec3ca14c0f213828fca1bf517a82c8744,2022-11-11 14:47:41,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int n,f,i;\n    sacnf(\""%d\"",n);\n    for(i=12;i<n;i++)\n    {\n        if(n%i!=0)\n            f++;\n    }\n}",COMPILE_ERROR,0,0
1590959532954685440,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 14:48:05,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"",&n);\n    int arr1[100] = {0};\n    int arr2[100] = {0};\n    for(int i = 0; i < n; ++i)\n    {\n        scanf(\""%d\"",&arr1[i]);\n    }\n    for(int j = 0; j < n; ++j)\n    {\n        scanf(\""%d\"",&arr2[j]);\n    }\n    int max1 = 0;\n    int max2 = 0;\n    for(int k = 0; k < n; ++k)\n    {\n        max2 += (arr1[k] - arr2[k]);\n        if(arr1[k] - arr2[k] < 0)\n        {\n            if(max1 < max2)\n            {\n                max1 = max2; \n            }\n            max2 = 0;\n        }\n    }\n    printf(\""%d\"",max1);\n    return 0\n}",COMPILE_ERROR,0,0
1590959538432446464,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-11 14:48:07,Java,300.0,1590734963702620160,1590734503495200768,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String args[]) {\n\n        int a;\n        int flag=1;\n        int maxScoreFlag=0;\n        int maxScore=0;\n        int arr1[]=new int[500];\n        int arr2[]=new int[500];\n        Scanner scanner = new Scanner(System.in);\n        a=scanner.nextInt();\n        for (int i = 0; i < a; i++) {\n            arr1[i]=scanner.nextInt();\n        }\n        for (int i = 0; i < a; i++) {\n            arr2[i]=scanner.nextInt();\n        }\n        for (int i = 0; i < a; i++) {\n            arr1[i]=-arr1[i]+arr2[i];\n        }\n        for (int i = 0; i < a; i++) {\n            if(arr1[i]>0){\n                flag=0;\n            }\n        }\n        if(flag==0) {\n            for (int i = 0; i < a; i++) {\n                if (arr1[i] < 0 && maxScore > maxScoreFlag) {\n                    maxScoreFlag = maxScore;\n                }\n                maxScore = maxScore + arr1[i];\n                if (maxScore < 0) {\n                    maxScore = 0;\n                }\n\n            }\n            System.out.println(maxScoreFlag>maxScore?maxScoreFlag:maxScore);\n        }\n        else{\n            maxScoreFlag=arr1[0];\n            for (int i = 0; i < a; i++) {\n                if(maxScoreFlag<arr1[i]){\n                    maxScoreFlag=arr1[i];\n                }\n            }\n            System.out.println(maxScoreFlag);\n        }\n\n\n    }\n}\n,ACCEPTED,139,16324
1590959554664378368,bce383372e0b1b627f0a9b838121096ec3ca14c0f213828fca1bf517a82c8744,2022-11-11 14:48:11,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int n,f,i;\n    sacnf(\""%d\"",n);\n    for(i=12;i<n;i++)\n    {\n        if(n%i!=0)\n            f++;\n    }\n    printf(\""%d\"",f);\n}",COMPILE_ERROR,0,0
1590959567704469504,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-11 14:48:14,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nvoid main(){\n    int m;\n    int sum=0;\n    scanf(\""%d\"",&m);\n    for(int i=2;i<=m;i++)\n    {\n        int k=sqrt(i);\n        for(int j=2;j<=k;j++)\n        { \n            if(j>k)\n            {sum++;}\n            if(i%j==0)\n            { break;}\n        }\n  }\n    printf(\""%d\"",sum);\n}",WRONG_ANSWER,4,476
1590959627313917952,bce383372e0b1b627f0a9b838121096ec3ca14c0f213828fca1bf517a82c8744,2022-11-11 14:48:28,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int n,f,i;\n    scanf(\""%d\"",n);\n    for(i=12;i<n;i++)\n    {\n        if(n%i!=0)\n            f++;\n    }\n    printf(\""%d\"",f);\n}",SEGMENTATION_FAULT,3,316
1590959680099258368,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 14:48:40,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main(){\n    int x, y, z;\n    printf(\""请输入三个整数空格隔开：\"");\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    \n    int m =0;\n    m = x+y-z;\n    printf(\""%d\\n\"",m);\n}",WRONG_ANSWER,2,196
1590959697669193728,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-11 14:48:45,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h> \n#include <math.h>\n int main()\n {\n \tint m,n,result;\n \tscanf(\""%d\"",&m);\n \tfor(int i=0;i<m;i++)\n \t{\n\t \tscanf(\""%d\"",&n);\n\t \tresult=(int)pow(6,n);\n\t\t printf(\""%d \"",result/1%10);\n\t}\n\t  return 0;\n }",TIME_LIMIT_EXCEEDED,10,568
1590959710201778176,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-11-11 14:48:48,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main()\n{\n    int X,Y,Z;\n    float M;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    M=X+Y-Z;\n    printf(\""%f\"",M);\n    return 0;\n}",WRONG_ANSWER,4,316
1590959746524450816,667c2e97e82c372f60661d46943ff56a17c9350387f4364ebabe70ac2e232862,2022-11-11 14:48:56,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int t,n;\n    scanf(\""%d\"",&t);\n    scanf(\""%d %d %d\"",&n,&n,&n);\n    printf(\""6\\n\"");\n    printf(\""6\\n\"");\n    printf(\""6\"");\n    return 0;\n}",WRONG_ANSWER,3,324
1590959849356177408,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-11-11 14:49:21,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    M=X+Y-Z;\n    printf(\""%d\"",M);\n    return 0;\n}",COMPILE_ERROR,0,0
1590960038599000064,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-11-11 14:50:06,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main()\n{\n    int X,Y,Z,M;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    M=X+Y-Z;\n    printf(\""%d\"",M);\n    return 0;\n}\n",ACCEPTED,6,384
1590960073478832128,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 14:50:14,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main(){\n    int x, y, z;\n    printf(\""请输入三个整数空格隔开：\"");\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    \n    int m =0;\n    m = x+y-z;\n    printf(\""m=%d\\n\"",m);\n}",WRONG_ANSWER,3,316
1590960085340303360,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 14:50:17,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main(){\n    int n = 0;\n    scanf(\""%d\"",&n);\n    \n    int arr1[n];\n    int arr2[n];\n    \n    for(int i = 0; i < n; ++i){\n        scanf(\""%d\"",&arr1[i]);\n    }\n    for(int i = 0; i < n; ++i){\n        scanf(\""%d\"",&arr2[i]);\n    }\n    \n    int sum = 0;\n    int max = arr2[0]-arr1[0];\n    for(int i = 0; i < n; ++i){\n        sum += arr2[i]-abs(arr1[i]);\n        if(sum > max){\n            max = sum;\n        }\n    }\n    \n    printf(\""%d\"",max);\n    \n    return 0;\n}",WRONG_ANSWER,4,180
1590960136951214080,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 14:50:29,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main(){\n    int n = 0;\n    scanf(\""%d\"",&n);\n    \n    int arr1[n];\n    int arr2[n];\n    \n    for(int i = 0; i < n; ++i){\n        scanf(\""%d\"",&arr1[i]);\n    }\n    for(int i = 0; i < n; ++i){\n        scanf(\""%d\"",&arr2[i]);\n    }\n    \n    int sum = 0;\n    int max = arr2[0]-arr1[0];\n    for(int i = 0; i < n; ++i){\n        sum += arr2[i]-arr1[i];\n        if(sum > max){\n            max = sum;\n        }\n    }\n    \n    printf(\""%d\"",max);\n    \n    return 0;\n}",WRONG_ANSWER,3,200
1590960168752447488,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 14:50:37,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main(){\n    int x, y, z;\n    printf(\""请输入三个整数空格隔开：\"");\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    \n    int m =0;\n    m = x+y-z;\n    printf(\""m=%d\\n\"",m);\n    return 0;\n}",WRONG_ANSWER,4,328
1590960195222704128,7d46013a6da090b69b62e7be93e7628aee2f7eef31af37777b9ccf1fd1d3eb2e,2022-11-11 14:50:43,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main (){\n    int i,k=6,n=3;\n    for(i=1;i<n;i++){\n        k*=6;\n    }\n    scanf(\""%f\"",&n);\n    printf(\""%d\"",k%10);\n    getch();\n    return 0;\n}\n\n",COMPILE_ERROR,0,0
1590960227225219072,7d46013a6da090b69b62e7be93e7628aee2f7eef31af37777b9ccf1fd1d3eb2e,2022-11-11 14:50:51,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main (){\n    int i,k=6,n=3;\n    for(i=1;i<n;i++){\n        k*=6;\n    }\n    scanf(\""%f\"",&n);\n    printf(\""%d\"",k%10);\n    getch();\n    return 0;\n}\n\n",COMPILE_ERROR,0,0
1590960241502654464,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 14:50:54,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main(){\n    int x, y, z;\n    printf(\""请输入三个整数空格隔开：\"");\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    \n    int m =0;\n    m = x+y-z;\n    printf(\""m=%d\"",m);\n    return 0;\n}",WRONG_ANSWER,5,324
1590960263245901824,86f702b052a21d7cb2f8cd933c678c21efaafaf5b2d35032f18ec35c1e26a945,2022-11-11 14:51:00,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int t,i,n;\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++)\n     { scanf(\""%d\"",&n);\n        printf(\""6\\n\"");\n      }\n    return 0;\n}",WRONG_ANSWER,9,340
1590960288017485824,7d46013a6da090b69b62e7be93e7628aee2f7eef31af37777b9ccf1fd1d3eb2e,2022-11-11 14:51:05,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main (){\n    int i,k=6,n=3;\n    for(i=1;i<n;i++){\n        k*=6;\n    }\n    scanf(\""%d\"",&n);\n    printf(\""%d\"",k%10);\n    getch();\n    return 0;\n}\n\n",COMPILE_ERROR,0,0
1590960335442477056,1a4463a67236431e94a4a4d273d88450d6acce220fed7155af8798b0664ee731,2022-11-11 14:51:17,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n    int m,i,n=0,num=0,k=0;\n    scanf(\""%d\"",&n);\nfor(m=2;m<=n;m++)\n{\n    for(i=2;i<m;i++)\n    if(m%i==0){\n        k++;\n    }\n    if(k==0){\n    num++;}\n    k=0;\n}\n    printf(\""一共有%d个素数\\n\"",num);\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,1000,340
1590960336956600320,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 14:51:17,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"",&n);\n    int arr1[100] = {0};\n    int arr2[100] = {0};\n    for(int i = 0; i < n; ++i)\n    {\n        scanf(\""%d\"",&arr1[i]);\n    }\n    for(int j = 0; j < n; ++j)\n    {\n        scanf(\""%d\"",&arr2[j]);\n    }\n    int max1 = 0;\n    int max2 = 0;\n    int k = 0;\n    for(k = 0; k < n; ++k)\n    {\n        max2 += (arr2[k] - arr1[k]);\n        if((arr1[k] - arr2[k]) < 0)\n        {\n            if(max1 < max2)\n            {\n                max1 = max2; \n            }\n            max2 = 0;\n        }\n    }\n    printf(\""%d\"",max1);\n    return 0;\n}",WRONG_ANSWER,3,324
1590960375540002816,d830b0bcae7881ad6d1b2e2b14f3ffa3695b6d3bd622856493fa1cf903c9bf4e,2022-11-11 14:51:26,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc= new Scanner(System.in);\n\t\tint t =sc.nextInt();\n\t\tint[] arr = new int[t];\n\t\tfor(int i=0;i<arr.length;i++) {\n\t\t\tarr[i]=sc.nextInt();\n\t\t}\n\t\tfor(int i =0;i<t;i++) {\n\t\t\tSystem.out.print(\""6\\n\"");\n\t\t}\n\t\t\n\t}\n}\n",NON_ZERO_EXIT_CODE,255,18800
1590960376311775232,d9e00d995e65b04cda3ddef6baec19225e4351002ab4efa981f62d78919a481b,2022-11-11 14:51:26,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n;\n    int i,j,sum,max=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    \n    for(i=0;i<n;i++)\n    {\n        sum = 0;\n        for(j=i;j<n;j++)\n        {\n            sum = sum - a[j] + b[j];\n            if(sum>max) max = sum;\n        }\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",ACCEPTED,3,192
1590960437716385792,abe2744e33bb397ffb9bb13afcb202f611378fb4fc5801202f03933298ce5f5d,2022-11-11 14:51:41,Java,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"public class Main {\n    public static void main(String[] args) {\n        System.out.println(\""2022\"");\n    }\n}\n",ACCEPTED,71,13856
1590960443835854848,78ba72ad62bbe8306c8b3a9b0bcd998483fa2e9f5b653a39aaf1fbe6036a5c10,2022-11-11 14:51:43,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nmain()\n{int a,b,c,sum;\nscanf(\""%d,%d,%d\"",&a,&b,&c);\nsum=a+b+c;\nprintf(\""sum=%d\"",sum);\n}",WRONG_ANSWER,3,464
1590960454585856000,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 14:51:45,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n\nmain\n{\n    printf(\""2022\"");\n}",COMPILE_ERROR,0,0
1590960460952834048,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-11 14:51:47,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int m;\n    int sum=0;\n    scanf(\""%d\"",&m);\n    for(int i=2;i<=m;i++)\n    {\n        int k=sqrt(i);\n        int j=2;\n        while(j<=k)\n        {\n            if(m%j==0)\n            {break;}\n            i++;\n        }\n        if(i>k)\n        {sum++;}\n  }\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,4,456
1590960474273943552,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 14:51:50,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main(){\n    int n = 0;\n    scanf(\""%d\"",&n);\n    \n    int arr1[n];\n    int arr2[n];\n    \n    for(int i = 0; i < n; ++i){\n        scanf(\""%d\"",&arr1[i]);\n    }\n    for(int i = 0; i < n; ++i){\n        scanf(\""%d\"",&arr2[i]);\n    }\n    \n    int sum = 0;\n    int max = 0;\n    for(int i = 1; i < n; ++i){\n        max += arr2[i-1] - arr1[i-1];\n        sum += arr2[i] - arr1[i];\n        if(sum > max){\n            max = sum;\n        }\n    }\n    \n    printf(\""%d\"",max);\n    \n    return 0;\n}",WRONG_ANSWER,3,344
1590960505974493184,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 14:51:57,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"n = int(input())\nxh = list(map(eval,input().split()))\nhd = list(map(eval,input().split()))\ndata=[]\ns = 0\nfor i in range(n):\n    s = hd[i]-xh[i]\n    data.append(s)\nfor i in data:\n    sp=i\n    if sp>=0:\n        s = s+sp\n    else:\n        print(s)",WRONG_ANSWER,16,3020
1590960532071428096,0c2907a154c1c61744366e94f73ae426665222ffae8eff7042dd0fd7bd8760fb,2022-11-11 14:52:04,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n\n\n{int n;\nint sum=0;\nint cou=0;\nint i,j;\nscanf(\""%d\"",&n);\nint a[n];\nint b[n];\nfor( i=0;i<n;i++)\n    scanf(\""%d\"",&a[i]);\nfor( i=0;i<n;i++)\n    scanf(\""%d\"",&b[i]);\nfor( i=0;i<(n+0)/2;i++)\n    sum=sum+a[i];\nfor( j=0;j<(n+0)/2;j++)\n    cou=cou+b[j];\nprintf(\""%d\"",cou-sum);\n\nreturn 0;\n}\n",WRONG_ANSWER,3,468
1590960567135830016,a5291eb67188c2a916aa5dd9fc38f2e449aa9f9a3cd047f282d8c154ea2979cd,2022-11-11 14:52:12,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,#include <iostream>\n\nusing namespace std;\nconst int N = 1e6 + 10;\nint arr[N];\nint main()\n{\n    int n = 0;\n    cin >> n;\n    int j = 1;\n    for(int i = 1;i <= n;i++)\n    {\n        int input;\n        cin >> input;\n        if(input == 0)\n        {\n            arr[j] = i;\n            j++;\n        }\n    }\n    j = 1;\n    for(int i = 1;i <= n;i++)\n    {\n        if(i == arr[j])\n        {\n            j++;\n            cout << 1 << endl;\n        }\n        else\n        {\n            cout << 6 << endl;\n        }\n    }\n    \n    return 0;\n},ACCEPTED,11,472
1590960567387492352,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 14:52:12,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main(){\n    int x,y,z;\n    printf(\""请输入三个整数空格隔开：\"");\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    \n    int m =0;\n    m = x+y-z;\n    printf(\""m=%d\"",m);\n    return 0;\n}",WRONG_ANSWER,3,348
1590960585980841984,78ba72ad62bbe8306c8b3a9b0bcd998483fa2e9f5b653a39aaf1fbe6036a5c10,2022-11-11 14:52:16,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nmain()\n{int a,b,c,sum;\nscanf(\""%d,%d,%d\"",&a,&b,&c);\nsum=a+b-c;\nprintf(\""sum=%d\"",sum);\n}",WRONG_ANSWER,4,316
1590960599473913856,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-11 14:52:20,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,max=0,sum;\n    int a[100],b[100];\n    int i,j;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        sum=0;\n        for(j=i;j<n;j++)\n        {\n            sum = sum - a[j] + b[j];\n            if(sum>max)\n                max=sum;\n        }\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",ACCEPTED,5,316
1590960620290248704,345826d11b41befc23adeb536e81da8eb6ec9a8bfb9448acf91422deedb8ba4a,2022-11-11 14:52:25,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,10\n1 2 3 4 5 6 7 8 9 10\n10 9 8 7 6 5 4 3 2 1\n,COMPILE_ERROR,0,0
1590960791778537472,78ba72ad62bbe8306c8b3a9b0bcd998483fa2e9f5b653a39aaf1fbe6036a5c10,2022-11-11 14:53:06,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nmain()\n{int X,Y,Z,sum;\nscanf(\""%d,%d,%d\"",&X,&Y,&Z);\nsum=X+Y-Z;\nprintf(\""sum=%d\"",sum);\n}",WRONG_ANSWER,3,476
1590960803510005760,7d46013a6da090b69b62e7be93e7628aee2f7eef31af37777b9ccf1fd1d3eb2e,2022-11-11 14:53:08,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main (){\n    int i,k=6,n=3;\n    for(i=1;i<n;i++){\n        k*=6;\n    }\n    scanf(\""%d\"",&n);\n    printf(\""%d\"",k%10);\n    return 0;\n}\n\n",WRONG_ANSWER,4,340
1590960838373085184,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-11 14:53:17,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String args[]) {\n        int a;\n        int b = 0;\n        int flag = 0;\n        Scanner scanner = new Scanner(System.in);\n        a = scanner.nextInt();\n        for (int i = 2; i <= a; i++) {\n            for (int j = 2; j < i; j++) {\n                if (i % j == 0)\n                    flag = 1;\n            }\n            if (flag == 0) {\n                b++;\n            }\n            flag = 0;\n        }\n        System.out.println(b);\n\n    }\n}\n,TIME_LIMIT_EXCEEDED,1000,18820
1590960874813198336,1a4463a67236431e94a4a4d273d88450d6acce220fed7155af8798b0664ee731,2022-11-11 14:53:25,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n    int m,i,n=0,num=0,k=0;\n    scanf(\""%d\"",&n);\n    for(m=2;m<=n;m++)\n{\n    for(i=2;i<m;i++)\n    if(m%i==0){\n        k++;\n    }\n    if(k==0)\n    {num++;}\n    k=0;\n}\n    printf(\""一共有%d个素数\\n\"",num);\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,1000,324
1590960971072450560,fa305ee4bf4c6a54add4e945b551f1e902b95c1a179a91ded55bf7ebb1c87c23,2022-11-11 14:53:48,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{  int a[50],b[50],i,j,x,s[50]={0},sum=0;\n    scanf(\""%d\"",&x);\n    for(j=0;j<x;j++){\n            scanf(\""%d\"",&a[j]);\n        }\n    for(j=0;j<x;j++){\n            scanf(\""%d\"",&b[j]);\n        }\n       for(i=0;i<x;i++){\n        s[i]=b[i]-a[i];\n       }\n    for(i=0;i<x;i++){\n       if(s[i]>0)  sum=sum+s[i];\n    }\n    printf(\""%d\\n\"",sum);\n    return 0;\n}",WRONG_ANSWER,4,324
1590960982258659328,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 14:53:51,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""2022\\n\"");\n    return 0;\n}\n",ACCEPTED,3,200
1590961040744034304,bce383372e0b1b627f0a9b838121096ec3ca14c0f213828fca1bf517a82c8744,2022-11-11 14:54:05,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int n,发，i;\n    scanf(\""%d\"",&n);\n    for(i=2;i<n;i++)\n    {\n        if(n%i==0) break;\n        if(i==m) f++；\n    }\n    printf(\""%d\"",f);\n}",COMPILE_ERROR,0,0
1590961078664757248,acfcf65f14b5d3b02c3225372654b4e21f04d33a8bbaeb346e4fb1d85f2ea94f,2022-11-11 14:54:14,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n  int t,n,i,r;\n  scanf(\""%d\"",&t);\n  for(i=0;i<t;i++)\n  {\n    scanf(\""%d\"",&n);\n    n=6;\n    r=n%10;\n    if(r==6)\n        printf(\""%d\\n\"",r);\n  }\n    return 0;\n}\n",WRONG_ANSWER,12,360
1590961084868132864,bce383372e0b1b627f0a9b838121096ec3ca14c0f213828fca1bf517a82c8744,2022-11-11 14:54:15,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int n,f，i;\n    scanf(\""%d\"",&n);\n    for(i=2;i<n;i++)\n    {\n        if(n%i==0) break;\n        if(i==m) f++；\n    }\n    printf(\""%d\"",f);\n}",COMPILE_ERROR,0,0
1590961165914673152,78ba72ad62bbe8306c8b3a9b0bcd998483fa2e9f5b653a39aaf1fbe6036a5c10,2022-11-11 14:54:35,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nmain()\n{int X,Y,Z,sum;\nscanf(\""%d,%d,%d\"",&X,&Y,&Z);\nsum=X+Y-Z;\nprintf(\""sum=%d\"",sum);\n}",WRONG_ANSWER,3,472
1590961178044600320,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 14:54:38,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main(){\n    int n = 0;\n    scanf(\""%d\"",&n);\n    \n    int arr1[n];\n    int arr2[n];\n    \n    for(int i = 0; i < n; ++i){\n        scanf(\""%d\"",&arr1[i]);\n    }\n    for(int i = 0; i < n; ++i){\n        scanf(\""%d\"",&arr2[i]);\n    }\n    \n    int sum = 0;\n    int max = 0;\n    for(int i = 0; i < n; ++i){\n        sum += arr2[i] - arr1[i];\n        if(sum > max){\n            max = sum;\n        }\n    }\n    \n    printf(\""%d\"",max);\n    \n    return 0;\n}",WRONG_ANSWER,4,344
1590961182264045568,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 14:54:39,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"",&n);\n    int arr1[100] = {0};\n    int arr2[100] = {0};\n    for(int i = 0; i < n; ++i)\n    {\n        scanf(\""%d\"",&arr1[i]);\n    }\n    for(int j = 0; j < n; ++j)\n    {\n        scanf(\""%d\"",&arr2[j]);\n    }\n    int max1 = 0;\n    int max2 = 0;\n    int k = 0;\n    for(k = 0; k < n; ++k)\n    {\n        int sum = arr2[k] - arr1[k];\n        if(sum < 0)\n        {\n            if(max1 < max2)\n            {\n                max1 = max2; \n            }\n            max2 = 0;\n        }\n        max2 += sum;\n    }\n    printf(\""%d\"",max1);\n    return 0;\n}",WRONG_ANSWER,3,328
1590961211750027264,19b1d22e5c87afa9233c236fc7b4d5e0e70acf3872968cbe9aae96e75e9e38d1,2022-11-11 14:54:46,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"a = input()\na1 = input().split(\"" \"")\na2 = input().split(\"" \"")\nb = [int(a2[i]) - int(a1[i]) for i in range(0, len(a2))]\nf = 0\nc = []\nfor i in b:\n    f = f + i\n    c.append(f)\nprint(max(c))\n",WRONG_ANSWER,16,2760
1590961254599012352,617f184ce583e9f7a346564ab5659fda0ca35a3a714a0c929cb07f915f4f514b,2022-11-11 14:54:56,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint prime(int x)\n{\n    int j=2;\n    if(x==2)\n        {\n        return 1;\n        }\n    while(x%j!=0 && j<=sqrt(x))\n        j++;\n    if(x%j==0)\n        return 0;\n    else\n    {\n        return 1;\n    }\n}\nint main( )\n{\n    int i,n,ans=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n        if(prime(i)) ans++;\n    printf(\""%d\\n\"",ans);\n    return 0;\n}\n",ACCEPTED,22,492
1590961271804047360,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 14:55:00,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"",&n);\n    int arr1[100] = {0};\n    int arr2[100] = {0};\n    for(int i = 0; i < n; ++i)\n    {\n        scanf(\""%d\"",&arr1[i]);\n    }\n    for(int j = 0; j < n; ++j)\n    {\n        scanf(\""%d\"",&arr2[j]);\n    }\n    int max1 = 0;\n    int max2 = 0;\n    int k = 0;\n    for(k = 0; k < n; ++k)\n    {\n        int sum = arr2[k] - arr1[k];\n        if(sum <= 0)\n        {\n            if(max1 < max2)\n            {\n                max1 = max2; \n            }\n            max2 = 0;\n        }\n        max2 += sum;\n    }\n    printf(\""%d\"",max1);\n    return 0;\n}",WRONG_ANSWER,3,324
1590961306805538816,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-11-11 14:55:08,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main(\n    {\n        int t,n;\n        scanf(\""%d%d\"",&t,&n);\n        t=pow(6,n);\n        printf(\""%d\\n\"",t);\n        return 0;\n    }",COMPILE_ERROR,0,0
1590961384123314176,1a4463a67236431e94a4a4d273d88450d6acce220fed7155af8798b0664ee731,2022-11-11 14:55:27,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include \""stdio.h\""\nint prime(int n){\n    int i;\n    if(n>2 && !(n&1) || n<2)\n        return 0;\n    for(i=3;i*i<=n;i+=2)\n        if(!(n%i))\n            return 0;\n    return 1;\n}\nint main(int argc,char *argv[]){\n    int n,s,i;\n    printf(\""输入素数\\n\"");\n    if(scanf(\""%d\"",&n)!=1 || n<1){\n\n        return 0;\n    }\n    for(s=0,i=2;i<=n;i++)\n        if(prime(i)){\n        s++;\n        }\n    printf(\""\\一共有 %d 个素数.\\n\"",s);\n    return 0;\n}\n",WRONG_ANSWER,8,192
1590961391425597440,46a5b5de1986c03ade4ef3715390240d3b4a1729dbb6afcb5e53fc1bee0f1a07,2022-11-11 14:55:29,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n    Scanner sc=new Scanner(System.in);\n\t     int x=sc.nextInt();\n\t     int a[]=new int[20],b=0,z=0;\n\t     for(int i=0;i<x;i++) {\n\t    \t a[i]=sc.nextInt();\n\t     }\n\t     for(int c=1;c<=x;c++) {\n\t    \t for(int j=1;j<=a[z];j++) {\n\t    \t\t b=6*6;\n\t    \t\t z++;\n\t    \t }\n\t    \t if(b>10&&b<100) {\n\t    \t\t System.out.println(b%10);\n\t    \t }else if(b>100&&b<1000) {\n\t    \t\t System.out.println(b%100);\n\t    \t }\n\t     }\n\t}\n\n}",NON_ZERO_EXIT_CODE,253,19220
1590961420043333632,13616e85f216dd3844293b46f4b46105a0a2c458f7807a7b677858feb35cb63a,2022-11-11 14:55:35,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nvoid gewei(int a)\n{\n    if(a==0)\n        printf(\""1\"");\n    else\n    printf(\""6\"");\n}\nint main()\n{\n    int m,n,i;\n    scanf(\""%d\"",&n);\n   while(scanf(\""%d\"",&m)!=EOF)\n   {\n      gewei(m);\n      printf(\""\\n\"");\n   }\n    return 0;\n}\n",ACCEPTED,10,312
1590961431250534400,617f184ce583e9f7a346564ab5659fda0ca35a3a714a0c929cb07f915f4f514b,2022-11-11 14:55:38,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int t;\n    scanf(\""%d\"",&t);\n    while(t--)\n        {\n            int i,n,res;\n            scanf(\""%d\"",&n);\n            res=pow(6,n);\n            i=res%10;\n            printf(\""%d\\n\"",i);\n        }\n    return 0;\n}\n",WRONG_ANSWER,7,352
1590961479476645888,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 14:55:49,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"n = int(input())\nxh = list(map(eval,input().split()))\nhd = list(map(eval,input().split()))\ndata=[]\ns = 0\nfor i in range(n):\n    s = hd[i]-xh[i]\n    data.append(s)\n\nfor i in data:\n    sp=i\n    if sp>=0:\n        s = s+sp\n        print(s)\n    else:\n        break\nprint(s)",WRONG_ANSWER,17,2756
1590961480516833280,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 14:55:50,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nmain()\n{\n\tint a,i,j;\n\tscanf(\""%d\"",&a);\n\tprintf(\""素数:\""); \n\tfor(i=2;i<=a;i++)\n\t\t{\n\t\tfor(j=2;j<=i;j++)\n\t\t\tif(i%j==0)\n\t\t\t\tbreak;\n\t\tif(i==j)\n\t\t\tprintf(\""%-5d\"",i);\n\t\t}\n}",WRONG_ANSWER,907,320
1590961513412755456,d830b0bcae7881ad6d1b2e2b14f3ffa3695b6d3bd622856493fa1cf903c9bf4e,2022-11-11 14:55:58,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc= new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint count=0;\n\t\tfor(int i=2;i<n;i++) {\n\t\t\tboolean flag = true;\n\t\t\tfor(int j =2;j<i;j++) {\n\t\t\t\tif(i%j==0) {\n\t\t\t\t\tflag = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(flag) {\n\t\t\t\tcount=count+1;\n\t\t\t}\n\t\t}\n\t\tSystem.out.print(count);\n\t}\n}\n,TIME_LIMIT_EXCEEDED,1000,16260
1590961521532932096,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 14:56:00,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"",&n);\n    int arr1[n] = {0};\n    int arr2[n] = {0};\n    for(int i = 0; i < n; ++i)\n    {\n        scanf(\""%d\"",&arr1[i]);\n    }\n    for(int j = 0; j < n; ++j)\n    {\n        scanf(\""%d\"",&arr2[j]);\n    }\n    int max1 = 0;\n    int max2 = 0;\n    int k = 0;\n    for(k = 0; k < n; ++k)\n    {\n        int sum = arr2[k] - arr1[k];\n        if(sum <= 0)\n        {\n            if(max1 < max2)\n            {\n                max1 = max2; \n            }\n            max2 = 0;\n        }\n        max2 += sum;\n    }\n    printf(\""%d\"",max1);\n    return 0;\n}",COMPILE_ERROR,0,0
1590961528063463424,9819f13d6a58d50fa249ad037641119dadb52afb3f125db258771564f27d2ca5,2022-11-11 14:56:01,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main() {\n\tint n, a;\n\tscanf(\""%d\"", &n);\n\twhile (n--) {\n\t\tscanf(\""%d\"", &a);\n\t\tprintf(\""%d\"", (int)pow(6, a) % 10);\n        if(n>0){\n            printf(\""\\n\"");\n        }\n\t}\n\treturn 0;\n}",WRONG_ANSWER,7,332
1590961530177368064,d830b0bcae7881ad6d1b2e2b14f3ffa3695b6d3bd622856493fa1cf903c9bf4e,2022-11-11 14:56:02,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc= new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint count=0;\n\t\tfor(int i=2;i<n;i++) {\n\t\t\tboolean flag = true;\n\t\t\tfor(int j =2;j<i;j++) {\n\t\t\t\tif(i%j==0) {\n\t\t\t\t\tflag = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(flag) {\n\t\t\t\tcount=count+1;\n\t\t\t}\n\t\t}\n\t\tSystem.out.print(count);\n\t}\n}\n,WRONG_ANSWER,997,16396
1590961542932271104,78ba72ad62bbe8306c8b3a9b0bcd998483fa2e9f5b653a39aaf1fbe6036a5c10,2022-11-11 14:56:05,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nmain()\n{int X,Y,Z,sum;\nscanf(\""%d,%d,%d\"",&X,&Y,&Z);\nsum=X+Y-Z;\nprintf(\""sum=%d\"",sum);\n}",WRONG_ANSWER,3,324
1590961580127354880,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 14:56:13,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"",&n);\n    int arr1[1000] = {0};\n    int arr2[1000] = {0};\n    for(int i = 0; i < n; ++i)\n    {\n        scanf(\""%d\"",&arr1[i]);\n    }\n    for(int j = 0; j < n; ++j)\n    {\n        scanf(\""%d\"",&arr2[j]);\n    }\n    int max1 = 0;\n    int max2 = 0;\n    int k = 0;\n    for(k = 0; k < n; ++k)\n    {\n        int sum = arr2[k] - arr1[k];\n        if(sum <= 0)\n        {\n            if(max1 < max2)\n            {\n                max1 = max2; \n            }\n            max2 = 0;\n        }\n        max2 += sum;\n    }\n    printf(\""%d\"",max1);\n    return 0;\n}",WRONG_ANSWER,4,328
1590961593993723904,bce383372e0b1b627f0a9b838121096ec3ca14c0f213828fca1bf517a82c8744,2022-11-11 14:56:17,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int n,f，i,j;\n    scanf(\""%d\"",&n);\n    for(j=1;j<=n;j++)\n    {\n        for(i=2;i<n;i++)\n        {\n        if(n%i==0) break;\n        if(i==m) f++；\n        }\n    }\n    printf(\""%d\"",f);\n}",COMPILE_ERROR,0,0
1590961605389651968,345826d11b41befc23adeb536e81da8eb6ec9a8bfb9448acf91422deedb8ba4a,2022-11-11 14:56:20,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,i,c,max=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],s[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n     for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n        s[i]=0;\n        s[0]=b[0]-a[0];\n     for(i=1;i<n;i++)\n        {\n            c=b[i]-a[i];\n            s[i]=s[i-1]+c;\n        }\n        max=s[0];\n    for(i=0;i<n-1;i++)\n    {\n        if(max>=s[i+1])\n           ;\n        else\n            max=s[i+1];\n    }\n   printf(\""%d\"",max);\n}\n",WRONG_ANSWER,3,192
1590961660083372032,d830b0bcae7881ad6d1b2e2b14f3ffa3695b6d3bd622856493fa1cf903c9bf4e,2022-11-11 14:56:33,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc= new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint count=0;\n\t\tfor(int i=2;i<n;i++) {\n\t\t\tboolean flag = true;\n\t\t\tfor(int j =2;j<=i;j++) {\n\t\t\t\tif(i%j==0) {\n\t\t\t\t\tflag = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(flag) {\n\t\t\t\tcount=count+1;\n\t\t\t}\n\t\t}\n\t\tSystem.out.print(count);\n\t}\n}\n,TIME_LIMIT_EXCEEDED,1000,18308
1590961696330526720,345826d11b41befc23adeb536e81da8eb6ec9a8bfb9448acf91422deedb8ba4a,2022-11-11 14:56:41,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,i,c,max=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],s[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n     for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n        s[i]=0;\n        s[0]=b[0]-a[0];\n     for(i=1;i<n;i++)\n        {\n            c=b[i]-a[i];\n            s[i]=s[i-1]+c;\n        }\n        max=s[0];\n    for(i=0;i<n-1;i++)\n    {\n        if(max>=s[i+1])\n           ;\n        else\n            max=s[i+1];\n    }\n   printf(\""%d\"",max);\n}\n",WRONG_ANSWER,3,188
1590961703431507968,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 14:56:43,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nmain()\n{\n\tint a,i,j;\n\tscanf(\""%d\"",&a);\n\tfor(i=2;i<=a;i++)\n\t\t{\n\t\tfor(j=2;j<=i;j++)\n\t\t\tif(i%j==0)\n\t\t\t\tbreak;\n\t\tif(i==j)\n\t\t\tprintf(\""%-5d\"",i);\n\t\t}\n    return 0;\n}",WRONG_ANSWER,941,348
1590961712335990784,78ba72ad62bbe8306c8b3a9b0bcd998483fa2e9f5b653a39aaf1fbe6036a5c10,2022-11-11 14:56:45,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nmain()\n{int X,Y,Z,sum=0;\nscanf(\""%d,%d,%d\"",&X,&Y,&Z);\nsum=X+Y-Z;\nprintf(\""sum=%d\"",sum);\n}",WRONG_ANSWER,3,324
1590961760071389184,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 14:56:56,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b,c;\n    scanf(\""%d%d%d\"",&a,&b,&c);\n    if((a<0||a>100)&&(b<0||b>100)&&(c<0||c>100))\n     printf(\""输入错误！\\n\"");\n    else printf(\""%d\"",a+b-c);\n    return 0;\n}\n",ACCEPTED,8,340
1590961815486529536,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 14:57:10,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint a,i,j;\n\tscanf(\""%d\"",&a);\n\tfor(i=2;i<=a;i++)\n\t\t{\n\t\tfor(j=2;j<=i;j++)\n\t\t\tif(i%j==0)\n\t\t\t\tbreak;\n\t\tif(i==j)\n\t\t\tprintf(\""%-5d\"",i);\n\t\t}\n    return 0;\n}",WRONG_ANSWER,939,448
1590961884856102912,46a5b5de1986c03ade4ef3715390240d3b4a1729dbb6afcb5e53fc1bee0f1a07,2022-11-11 14:57:26,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n    Scanner sc=new Scanner(System.in);\n\t     int x=sc.nextInt();\n\t     int a[]=new int[20],b=0,z=0;\n\t     for(int i=0;i<x;i++) {\n\t    \t a[i]=sc.nextInt();\n\t     }\n\t     for(int c=1;c<=x;c++) {\n\t    \t for(int j=1;j<=a[z];j++) {\n\t    \t\t b=6*6;\n\t    \t\t z++;\n\t    \t }\n\t    \t if(b>10&&b<100) {\n\t    \t\t System.out.println(b%10);\n\t    \t }else if(b>100&&b<1000) {\n\t    \t\t System.out.println(b%100);\n\t    \t }\n\t     }\n         sc.close();\n\t}\n\n}",NON_ZERO_EXIT_CODE,256,19220
1590961895081836544,ece045c1570c74e6800520e16047010817642535f83b9f2b4524ebdcf9d7925a,2022-11-11 14:57:29,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n/* run this program using the console pauser or add your own getch, system(\""pause\"") or input loop */\n\nint main() {\n\tprintf(\""2022\"");\n\treturn 0;\n}",ACCEPTED,4,192
1590961949490352128,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 14:57:42,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#define n 100000\nint main()\n{\n    int a,i,j,t,sum=0;\n    scanf(\""%d\"",&a);\n    int b[n],c[n],d[n];\n    for(i=0;i<a;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(j=0;j<a;j++)\n    {\n        scanf(\""%d\"",&c[j]);\n    }\n    for(t=0;t<a;t++)\n    {\n        d[t]=c[t]-b[t];\n        if(d[t]>0) sum+=d[t];\n    }\n    if(sum>0)\n    printf(\""%d\\n\"",sum);\n    else\n    printf(\""%d\\n\"",d[0]);\n    return 0;\n}\n",WRONG_ANSWER,3,384
1590962050484994048,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 14:58:06,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"n = int(input())\nxh = list(map(eval,input().split()))\nhd = list(map(eval,input().split()))\ndata=[]\ns = 0\nfor i in range(n):\n    s = hd[i]-xh[i]\n    data.append(s)\n\nfor i in data:\n    sp=i\n    if sp>=0:\n        print(sp)\n        s = s+sp\n        print(\""s\"",s)\n    else:\n        break\nprint(s)",WRONG_ANSWER,17,2816
1590962056814178304,c9a8fe962a36cf99ca362f66348b02453584251c62fe2356e11d2a6efd5cee45,2022-11-11 14:58:07,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint n,i,j;\n\tint count=0;\n\tscanf(\""%d\"",&n);\n\tfor(i=2;i<=n;i++)\n\t{\n\t\tfor(j=2;j<i;j++)\n\t\t{\n\t\t\tif(i%j==0)\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(j==i)\n\t\t{\n\t\t    count++;\n\n\t\t}\n\n\t}\n\tprintf(\""%d\\n\"",count);\n}\n",ACCEPTED,985,436
1590962222921224192,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 14:58:47,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"",&n);\n    int arr1[1000] = {0};\n    int arr2[1000] = {0};\n    for(int i = 0; i < n; ++i)\n    {\n        scanf(\""%d\"",&arr1[i]);\n    }\n    for(int j = 0; j < n; ++j)\n    {\n        scanf(\""%d\"",&arr2[j]);\n    }\n    int max1 = 0;\n    int max2 = 0;\n    int k = 0;\n    for(k = 0; k < n; ++k)\n    {\n        int sum = arr2[k] - arr1[k];\n        if(sum <= 0)\n        {\n            if(max1 < max2)\n            {\n                max1 = max2; \n            }\n            max2 = 0;\n        }\n        max2 += sum;\n    }\n    printf(\""%d\"",max1 > max2 ? max1 : max2);\n    return 0;\n}",WRONG_ANSWER,4,344
1590962282115432448,5a1c17b308a3b3595833d34c6bdfb75e9f5dd0d065acfeb7f28ab8102ba7406c,2022-11-11 14:59:01,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main()\n{\n    int n,i,j,k;\n    int sum = 0;\n    scanf(\""%d\"",&n);\n    int x[n],y[n];\n    int z[n];\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&x[i]);\n        x[i] = -x[i];\n    }\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&y[i]);\n    }\n        for(j=0;j<n;j++){\n            sum += x[j]+y[j];\n            z[j] = sum;\n        }\n    int max = z[0];\n    for(k=1;k<n;k++){\n        if(max<z[k]){\n            max = z[k];\n        }\n    }\n   printf(\""%d\"",max);\n    return 0;\n}\n",WRONG_ANSWER,4,472
1590962304307499008,31365c6d4bb8429e37eb2d5ae755026603ca7d55e657b0fa7faedb3f56b44ece,2022-11-11 14:59:06,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main(){\n    int n = 0;\n    scanf(\""%d\"",&n);\n    \n    int arr1[n];\n    int arr2[n];\n    \n    for(int i = 0; i < n; ++i){\n        scanf(\""%d\"",&arr1[i]);\n    }\n    for(int i = 0; i < n; ++i){\n        scanf(\""%d\"",&arr2[i]);\n    }\n    \n    int sum = 0;\n    int max = arr2[0] - arr1[0];\n    for(int i = 0; i < n; ++i){\n        if(arr2[i] > 0 && arr1[i] > 0){\n            sum += arr2[i] - arr1[i];\n        }\n        if(arr2[i] > 0 && arr1[i] < 0){\n            sum += arr2[i] - arr1[i];\n        }\n        if(arr2[i] < 0 && arr1[i] > 0){\n            sum += arr2[i] - arr1[i];\n        }\n        if(arr2[i] < 0 && arr1[i] < 0){\n            sum += arr2[i] - arr1[i];\n        }\n        if(sum > max){\n            max = sum;\n        }\n    }\n    \n    printf(\""%d\"",max);\n    \n    return 0;\n}",WRONG_ANSWER,3,192
1590962318802989056,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-11 14:59:10,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<math.h>\n#include <stdio.h>\nint main()\n{\n    int n,i=2,j,temp=0;\n    scanf(\""%d\"",&n);\n     for(j=2;j<=i;j++)\n     {\n       if(i>n)\n        break;\n      if(i%j==0&&j==i)\n      {\n       ++temp;\n       j=1;\n       ++i;\n      }\n      else if(i%j==0)\n      {\n       ++i;\n       j=1;\n      }\n     }\n    printf(\""%d\"",temp);\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,1000,480
1590962337111126016,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 14:59:14,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint a,i,j;\n    int count=0;\n\tscanf(\""%d\"",&a);\n\tfor(i=2;i<=a;i++)\n\t\t{\n\t\tfor(j=2;j<=i;j++)\n\t\t\tif(i%j==0)\n\t\t\t\tbreak;\n\t\tif(i==j)\n\t\t\tcount++;\n\t\t}\n    return 0;\n}",WRONG_ANSWER,3,332
1590962364927774720,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-11 14:59:21,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<math.h>\n#include <stdio.h>\nint main()\n{\n    int n,i,j,temp=0,b;\n    scanf(\""%d\"",&n);\n     for(i=2;i<=n;i++)\n     {\n      b=1;\n      for(j=2;j*j<=i;j++)\n       if(i%j==0)\n       {\n         b=0;\n         break;\n       }\n       if(b==1)\n        temp++;\n     }\n    printf(\""%d\"",temp);\n    return 0;\n}\n",ACCEPTED,14,344
1590962366982979584,1e783de44f6cf9abb158b108e556a36ef99d9241fc592b40cfd6cb7d1265eb34,2022-11-11 14:59:21,Java,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"class Main{ \n    public static void main(String[] args) {\n       System.out.println(\""2022\"");\n    }\n}",ACCEPTED,79,16636
1590962368715231232,7e6a67f270e740aba8788a12d9a49939621a28d5059d3ced2247a86914b0a3b3,2022-11-11 14:59:22,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main(){\n    int n;\n    scanf(\""%d\"",&n);\n    int wi[n],wj[n],w[n];\n    int i,j,max=0,sum=0;\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&wi[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&wj[i]);\n\n    for(i=0;i<n;i++)\n        w[i]=wj[i]-wi[i];\n\n    for(i=0;i<n;i++)\n    {\n        if(w[i]<0&&max<=sum) {\n            max=sum;\n            sum=0;\n        }\n        sum+=w[i];\n    }\n    printf(\""%d\"",max);\n}\n",WRONG_ANSWER,4,324
1590962369734422528,46a5b5de1986c03ade4ef3715390240d3b4a1729dbb6afcb5e53fc1bee0f1a07,2022-11-11 14:59:22,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n   Scanner sc=new Scanner(System.in);\n\t     int x=sc.nextInt();\n\t     int a[]=new int[20],b=0,z=0;\n\t     for(int i=0;i<x;i++) {\n\t    \t a[i]=sc.nextInt();\n\t     }\n\t     for(int i=0;i<x;i++) {\n\t     System.out.println(\""6\"");\n\t     }\n\t}\n}\n",WRONG_ANSWER,273,16456
1590962394896072704,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-11 14:59:28,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int m;\n    int sum=0;\n    scanf(\""%d\"",&m);\n    for(int i=2;i<=m;i++)\n    {\n        int k=sqrt(i);\n        int j=2;\n        while(j<=k)\n        {\n            if(m%j==0)\n            {break;}\n            j++;\n        }\n        if(j>k)\n        {sum=sum+1;}\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,4,360
1590962398020833280,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 14:59:28,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#define n 100000\nint main()\n{\n    int a,i,j,t,sum=0;\n    scanf(\""%d\"",&a);\n    int b[n],c[n],d[n];\n    for(i=0;i<a;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(j=0;j<a;j++)\n    {\n        scanf(\""%d\"",&c[j]);\n    }\n    for(t=0;t<a;t++)\n    {\n        d[t]=c[t]-b[t];\n        if(d[t]>0) sum+=d[t];\n    }\n    if(sum>0)\n    printf(\""%d\\n\"",sum);\n    else\n    printf(\""%d\\n\"",d[0]);\n    return 0;\n}\n",WRONG_ANSWER,3,192
1590962428085579776,19b1d22e5c87afa9233c236fc7b4d5e0e70acf3872968cbe9aae96e75e9e38d1,2022-11-11 14:59:36,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"a = input()\na1 = input().split(\"" \"")\na2 = input().split(\"" \"")\nb = [int(a2[i]) - int(a1[i]) for i in range(0, len(a2))]\nc = [b[0]]\nf = b[0]\nfor i in range(1, len(b)):\n    f = f + b[i]\n    c.append(f)\nprint(c)\nprint(max(c))\n",WRONG_ANSWER,19,2872
1590962443227017216,5a1c17b308a3b3595833d34c6bdfb75e9f5dd0d065acfeb7f28ab8102ba7406c,2022-11-11 14:59:39,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main()\n{\n    int n,i,j,k;\n    int sum = 0;\n    scanf(\""%d\"",&n);\n    int x[n],y[n];\n    int z[n];\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&x[i]);\n        x[i] = -x[i];\n    }\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&y[i]);\n    }\n        for(j=0;j<n;j++){\n            sum += x[j]+y[j];\n            z[j] = sum;\n        }\n    int max = z[0];\n    for(k=1;k<n;k++){\n        if(max<z[k]){\n            max = z[k];\n        }\n    }\n   printf(\""%d\\n\"",max);\n    return 0;\n}\n",WRONG_ANSWER,3,188
1590962450097311744,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 14:59:41,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"",&n);\n    int arr1[1000] = {0};\n    int arr2[1000] = {0};\n    for(int i = 0; i < n; ++i)\n    {\n        scanf(\""%d\"",&arr1[i]);\n    }\n    for(int j = 0; j < n; ++j)\n    {\n        scanf(\""%d\"",&arr2[j]);\n    }\n    int max1 = 0;\n    int max2 = 0;\n    int k = 0;\n    for(k = 0; k < n; ++k)\n    {\n        int sum = arr2[k] - arr1[k];\n        if(sum <= 0)\n        {\n            if(max1 < max2)\n            {\n                max1 = max2; \n            }\n            max2 = 0;\n        }\n        max2 += sum;\n    }\n    printf(\""%d\"",max1 > max2 ? max1 : max2);\n    return 0;\n}",WRONG_ANSWER,3,204
1590962463032520704,19b1d22e5c87afa9233c236fc7b4d5e0e70acf3872968cbe9aae96e75e9e38d1,2022-11-11 14:59:44,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"a = input()\na1 = input().split(\"" \"")\na2 = input().split(\"" \"")\nb = [int(a2[i]) - int(a1[i]) for i in range(0, len(a2))]\nc = [b[0]]\nf = b[0]\nfor i in range(1, len(b)):\n    f = f + b[i]\n    c.append(f)\nprint(max(c))\n",WRONG_ANSWER,18,2872
1590962482649305088,78ba72ad62bbe8306c8b3a9b0bcd998483fa2e9f5b653a39aaf1fbe6036a5c10,2022-11-11 14:59:49,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nmain()\n{int X,Y,Z,sum;\nscanf(\""%d,%d,%d\"",&X,&Y,&Z);\nsum=X+Y-Z;\nprintf(\""%d\"",sum);\n}",WRONG_ANSWER,3,184
1590962641298853888,78ba72ad62bbe8306c8b3a9b0bcd998483fa2e9f5b653a39aaf1fbe6036a5c10,2022-11-11 15:00:27,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nmain()\n{int X,Y,Z,sum;\nscanf(\""%d,%d,%d\"",&X,&Y,&Z);\nsum=X+Y-Z;\nprintf(\""%d\"",sum);\n}",WRONG_ANSWER,4,312
1590962643689603072,25b8e249c556de062ec0d61286db67304f907bc70204e22083d75434403578b1,2022-11-11 15:00:27,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(int i=0;i<n;i++)\n\t\tscanf(\""%d\"",&a[i]);\n\tif(a[0]==0)\n\t\tprintf(\""1\"");\n\telse printf(\""6\"");\t\n\tfor(int j=1;j<n;j++)\n\t{\n\t\tputchar('\\n');\n\t\tif(a[j]==0)\n\t\tprintf(\""1\"");\n\t\telse printf(\""6\"");\n\t} \t\n\treturn 0;\n} ",ACCEPTED,10,364
1590962672051490816,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-11 15:00:34,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int m;\n    int sum=0;\n    scanf(\""%d\"",&m);\n    for(int i=2;i<=m;i++)\n    {\n        int k=sqrt(i);\n        int j=2;\n        while(j<=k)\n        {\n            if(i%j==0)\n            {break;}\n            j++;\n        }\n        if(j>k)\n        {sum=sum+1;}\n    }\n    printf(\""%d\\n\"",sum);\n    return 0;\n}",ACCEPTED,13,200
1590962705312317440,1a4463a67236431e94a4a4d273d88450d6acce220fed7155af8798b0664ee731,2022-11-11 15:00:42,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    if(X,Y,Z>=0&&X,Y,Z<=100)\n    {\n        printf(\""%d\"",X+Y-Z);\n    }\n    return 0;",COMPILE_ERROR,0,0
1590962774707077120,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 15:00:58,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc=new Scanner(System.in);\n        int x=sc.nextInt();\n        String[] n=new String[x];\n        for (int i = 0; i <x; i++) {\n            int q=sc.nextInt();\n            n[i]=String.valueOf(Math.pow(6,q));\n        }\n        for (int i = 0; i <x; i++){\n            System.out.println(n[i].charAt(n[i].length()-3));\n        }\n    }\n}",TIME_LIMIT_EXCEEDED,287,16784
1590962844504469504,55950e2d4c314feed0856fa0f6b80f22c5c36f2ebe0d75c8ee2cadb1a06b2fe1,2022-11-11 15:01:15,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a,b,flag=0,i,j,n=0;\n    scanf(\""%d\"",&a);\n    for(i=2;i<a;i++){\n        \n        for(j=2;j<i;j++){\n            if(i%j==0)\n                flag++;\n            \n            \n        }\n        if(flag==0)\n            n=n+1;\n            \n        \n        \n   \n        \n    }\n    printf(\""%d\"",n);\n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    return 0;\n}",TIME_LIMIT_EXCEEDED,1000,388
1590962845074919424,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 15:01:15,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc=new Scanner(System.in);\n        int x=sc.nextInt();\n        String[] n=new String[x];\n        for (int i = 0; i <x; i++) {\n            int q=sc.nextInt();\n            n[i]=String.valueOf(Math.pow(6,q));\n        }\n        for (int i = 0; i <x; i++){\n            System.out.println(n[i].charAt(n[i].length()-3));\n        }\n    }\n}",WRONG_ANSWER,266,16704
1590962866675560448,86f702b052a21d7cb2f8cd933c678c21efaafaf5b2d35032f18ec35c1e26a945,2022-11-11 15:01:20,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int t,i,a,b,n;\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++)\n     { scanf(\""%d\"",&n);\n       if(n>0&&n<pow(10,9))\n        {a=pow(6,n);\n            b=a%10;\n        printf(\""%d\\n\"",b);}\n      }\n    return 0;\n}\n",WRONG_ANSWER,6,472
1590962885411516416,46a5b5de1986c03ade4ef3715390240d3b4a1729dbb6afcb5e53fc1bee0f1a07,2022-11-11 15:01:25,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n   public static void main(String[] args) {\n\t\t Scanner sc=new Scanner(System.in);\n\t     int x=sc.nextInt();\n\t     int a[]=new int[20],b=0,z=0;\n\t     for(int i=0;i<x;i++) {\n\t    \t a[i]=sc.nextInt();\n\t     }\n\t     for(int c=1;c<=x;c++) {\n\t    \t for(int j=1;j<=a[z];j++) {\n\t    \t\t b=6*6;\n\t    \t\t z++;\n\t    \t }\n\t    \t if(b>10&&b<100) {\n\t    \t\t System.out.println(b%10);\n\t    \t }else if(b>100&&b<1000) {\n\t    \t\t System.out.println(b%100);\n\t    \t }\n\t     }\n\t     sc.close();\n\t}\n}\n",WRONG_ANSWER,246,16908
1590962893007400960,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 15:01:27,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main(){\n    int x;\n    int y;\n    int z;\n    printf(\""请输入三个整数空格隔开：\"");\n    scanf(\""%d\"",&x);\n    scanf(\""%d\"",&y);\n    scanf(\""%d\"",&z);\n    \n    int m =0;\n    m = x+y-z;\n    printf(\""m=%d\"",m);\n    return 0;\n}",WRONG_ANSWER,4,312
1590962902062927872,55950e2d4c314feed0856fa0f6b80f22c5c36f2ebe0d75c8ee2cadb1a06b2fe1,2022-11-11 15:01:29,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a,b,flag=0,i,j,n=0;\n    scanf(\""%d\"",&a);\n    for(i=2;i<a;i++){\n        \n        for(j=2;j<i;j++){\n            if(i%j==0)\n                flag++;\n            break;\n            \n            \n        }\n        if(flag==0)\n            n=n+1;\n            \n        \n        \n   \n        \n    }\n    printf(\""%d\"",n);\n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    return 0;\n}",WRONG_ANSWER,3,200
1590962923927834624,1a4463a67236431e94a4a4d273d88450d6acce220fed7155af8798b0664ee731,2022-11-11 15:01:34,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    if(X,Y,Z>=0&&X,Y,Z<=100)\n    {\n        printf(\""%d\"",X+Y-Z);\n    }\n    return 0;\n}",ACCEPTED,6,512
1590962946296033280,7e6a67f270e740aba8788a12d9a49939621a28d5059d3ced2247a86914b0a3b3,2022-11-11 15:01:39,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main(){\n    int n;\n    scanf(\""%d\"",&n);\n    int wi[n],wj[n],w[n];\n    int i,max=0,sum=0;\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&wi[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&wj[i]);\n\n    for(i=0;i<n;i++)\n        w[i]=wj[i]-wi[i];\n\n    for(i=0;i<n;i++)\n    {\n        if(w[i]<0&&max<=sum) {\n            max=sum;\n        }\n        sum+=w[i];\n    }\n    printf(\""%d\"",max);\n}\n",WRONG_ANSWER,3,324
1590962964147015680,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 15:01:43,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main(){\n    int x,y,z;\n    printf(\""请输入三个整数空格隔开：\"");\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    \n    int m =0;\n    m = x+y-z;\n    printf(\""m=%d\"",m);\n    return 0;\n}",WRONG_ANSWER,4,180
1590962967334662144,55950e2d4c314feed0856fa0f6b80f22c5c36f2ebe0d75c8ee2cadb1a06b2fe1,2022-11-11 15:01:44,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a,b,flag,i,j,n=0;\n    scanf(\""%d\"",&a);\n    for(i=2;i<a;i++){\n        flag=0;\n        \n        for(j=2;j<i;j++){\n            if(i%j==0)\n                flag++;\n            break;\n            \n            \n        }\n        if(flag==0)\n            n=n+1;\n            \n        \n        \n   \n        \n    }\n    printf(\""%d\"",n);\n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    return 0;\n}",WRONG_ANSWER,3,196
1590963029519413248,8f29029dc8006da83949d2656cc7dc83026d851252066fd4a9fc89071673ec96,2022-11-11 15:01:59,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n, i, arr[20];\n    scanf(\""%d\"", &n);\n    for (i = 0; i < n; i++)\n    {\n        scanf(\""%d\"", &arr[i]);\n    }\n    for (i = 0; i < n; i++)\n    {\n        if (arr[i] == 0)\n            printf(\""1\\n\"");\n        else\n            printf(\""6\\n\"");\n    }\n}",ACCEPTED,10,348
1590963063900123136,55950e2d4c314feed0856fa0f6b80f22c5c36f2ebe0d75c8ee2cadb1a06b2fe1,2022-11-11 15:02:07,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a,b,flag,i,j,n=0;\n    scanf(\""%d\"",&a);\n    for(i=2;i<a;i++){\n        flag=0;\n        \n        for(j=2;j<i;j++){\n            if(i%j==0){\n                       flag++;\n             break;\n            \n                \n                \n            }\n         \n            \n        }\n        if(flag==0)\n            n=n+1;\n            \n        \n        \n   \n        \n    }\n    printf(\""%d\"",n);\n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    return 0;\n}",ACCEPTED,948,368
1590963132758036480,ece045c1570c74e6800520e16047010817642535f83b9f2b4524ebdcf9d7925a,2022-11-11 15:02:24,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n/* run this program using the console pauser or add your own getch, system(\""pause\"") or input loop */\n\nint main() {\n\tint x,y,z,sum;\n    scanf(\""%d %d %d\"",&x,&y,&z); \n    sum=x+y-z;\n    printf(\""%d\"",sum);\n}",ACCEPTED,7,320
1590963142753062912,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-11 15:02:26,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String args[]) {\n        int a;\n        int b = 0;\n        int flag = 0;\n        Scanner scanner = new Scanner(System.in);\n        a = scanner.nextInt();\n        for (int i = 2; i <= a; i++) {\n            if(i!=2&&i%2==0)\n                continue;\n            else {\n                for (int j = 2; j < i; j++) {\n                    if (i % j == 0) {\n                        flag = 1;\n                        break;\n                    }\n                }\n\n                if (flag == 0) {\n                    b++;\n                }\n                flag = 0;\n            }\n        }\n        System.out.println(b);\n\n    }\n}\n,TIME_LIMIT_EXCEEDED,1000,16228
1590963163741356032,739b1156eb9238db78ec0a88314ad93c72ab0c7fc7ecc0396c0a3fa3997af557,2022-11-11 15:02:31,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"print(\""2022\"")",ACCEPTED,15,2748
1590963219471073280,46a5b5de1986c03ade4ef3715390240d3b4a1729dbb6afcb5e53fc1bee0f1a07,2022-11-11 15:02:44,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n   public static void main(String[] args) {\n\t\t Scanner sc=new Scanner(System.in);\n\t     int x=sc.nextInt();\n\t     int a[]=new int[20],b=0,z=0;\n\t     for(int i=0;i<x;i++) {\n\t    \t a[i]=sc.nextInt();\n\t     }\n\t     for(int c=1;c<=x;c++) {\n\t    \t for(int j=1;j<=a[z];j++) {\n\t    \t\t b=6*6;\n\t    \t\t z++;\n\t    \t }\n\t    \t if(b>10&&b<100) {\n\t    \t\t System.out.println(b%10);\n\t    \t }else if(b>100&&b<1000) {\n\t    \t\t System.out.println(b%100);\n\t    \t }\n\t     }\n\t     sc.close();\n\t}\n}\n",NON_ZERO_EXIT_CODE,262,19176
1590963220737732608,fa305ee4bf4c6a54add4e945b551f1e902b95c1a179a91ded55bf7ebb1c87c23,2022-11-11 15:02:45,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{  int a[50],b[50],i,j,x,s[50]={0},sum=0;\n    scanf(\""%d\"",&x);\n    for(j=0;j<x;j++){\n            scanf(\""%d\"",&a[j]);\n        }\n    for(j=0;j<x;j++){\n            scanf(\""%d\"",&b[j]);\n        }\n       for(i=0;i<x;i++){\n        s[i]=b[i]-a[i];\n       }\n    for(i=1;i<x;i++){\n       if(s[i]>0)  sum=sum+s[i];\n    }\n    printf(\""%d\"",sum+s[0]);\n    return 0;\n}\n",WRONG_ANSWER,3,196
1590963377013305344,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 15:03:22,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>>\n\nint main()\n{\n    int t,n,i;\n    scanf(\""%d\"",&t);\n    for(i=0;i<=t;i++)\n    {\n        scanf(\""%d\"",&n);\n        if(n>0||n<pow(10,9))\n            printf(\""输入错误\\n\"");\n        else printf(\""%d\"",pow(6,n)%10);\n    }\n    printf(\""Hello world!\\n\"");\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590963430549422080,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 15:03:35,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>>\n\nint main()\n{\n    int t,n,i;\n    scanf(\""%d\"",&t);\n    for(i=0;i<=t;i++)\n    {\n        scanf(\""%d\"",&n);\n        if(n>0||n<pow(10,9))\n            printf(\""输入错误\\n\"");\n        else printf(\""%d\"",pow(6,n)%10);\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590963432151650304,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 15:03:35,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"n = int(input())\nxh = list(map(eval,input().split()))\nhd = list(map(eval,input().split()))\ndata=[]\ns = 0\nt=0\nfor i in range(n):\n    s = hd[i]-xh[i]\n    data.append(s)\nfor i in data:\n    if i>=0:\n        t=t+i\n    else:\n        break\nprint(t)",WRONG_ANSWER,17,2816
1590963453391581184,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 15:03:40,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc=new Scanner(System.in);\n        int x=sc.nextInt();\n        int[] n=new int[x];\n        for (int i = 0; i <x; i++) {\n            int q=sc.nextInt();\n            n[i]= (int) Math.pow(6,q);\n        }\n        for (int i = 0; i <x; i++){\n            System.out.println(n[i]%10);\n        }\n    }\n}",WRONG_ANSWER,268,16604
1590963490385367040,d830b0bcae7881ad6d1b2e2b14f3ffa3695b6d3bd622856493fa1cf903c9bf4e,2022-11-11 15:03:49,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc= new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint count=0;\n\t\tfor(int i=2;i<n;i++) {\n\t\t\tboolean flag = true;\n\t\t\tfor(int j =2;j<i;j++) {\n\t\t\t\tif(i%j==0) {\n\t\t\t\t\tflag = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(flag) {\n\t\t\t\tcount=count+1;\n\t\t\t}\n\t\t}\n\t\tSystem.out.print(count);\n\t}\n}\n,TIME_LIMIT_EXCEEDED,1000,18752
1590963536707235840,739b1156eb9238db78ec0a88314ad93c72ab0c7fc7ecc0396c0a3fa3997af557,2022-11-11 15:04:00,Python,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"data = list(map(eval,input().split()))\ns = data[0]+data[1]-data[2]\nprint(s)\n",ACCEPTED,34,2888
1590963545779535872,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 15:04:02,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc=new Scanner(System.in);\n        int x=sc.nextInt();\n        int[] n=new int[x];\n        for (int i = 0; i <x; i++) {\n            int q=sc.nextInt();\n            n[i]= (int) Math.pow(6,q);\n        }\n        for (int i = 0; i <x; i++){\n            System.out.println(n[i]%10);\n        }\n    }\n}",NON_ZERO_EXIT_CODE,271,16708
1590963612850630656,739b1156eb9238db78ec0a88314ad93c72ab0c7fc7ecc0396c0a3fa3997af557,2022-11-11 15:04:18,Python,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\nl = int(input())\ndata = list(map(eval,input().split()))\nfor i in range(l):\n    if i ==l-1:\n        if data[i]==0:\n            print(1,end=\""\"")\n        else:\n            print(6,end=\""\"")\n    else:\n        if data[i]==0:\n            print(1)\n        else:\n            print(6)",ACCEPTED,56,2880
1590963622384308224,8f29029dc8006da83949d2656cc7dc83026d851252066fd4a9fc89071673ec96,2022-11-11 15:04:20,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint n, i ,t=0;\n\tint arr[50];\n\tint brr[50];\n\tscanf(\""%d\"", &n);\n\tfor ( i = 0; i < n; i++)\n\t{\n\t\tscanf(\""%d\"", &arr[i]);\n\t}\n\tfor (i = 0; i < n; i++)\n\t{\n\t\tscanf(\""%d\"", &brr[i]);\n\t}\n\tfor ( i = 0; arr[i]<brr[i]; i++)\n\t{\n\t\tt+= brr[i] - arr[i];\n\t}\n\tprintf(\""%d\"", t);\n}",WRONG_ANSWER,4,500
1590963641158012928,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-11 15:04:25,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,public class pta {\n    public static void main(String[] args) {\n        System.out.println(2022);\n    }\n    }\n,COMPILE_ERROR,0,0
1590963675660353536,acfcf65f14b5d3b02c3225372654b4e21f04d33a8bbaeb346e4fb1d85f2ea94f,2022-11-11 15:04:33,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n  int t,n,i,r;\n  scanf(\""%d\"",&t);\n  for(i=0;i<t;i++)\n  {\n    scanf(\""%d\"",&n);\n    r=pow(6,n);\n    printf(\""%d\\n\"",r%10);\n  }\n    return 0;\n}\n",WRONG_ANSWER,6,500
1590963702688448512,739b1156eb9238db78ec0a88314ad93c72ab0c7fc7ecc0396c0a3fa3997af557,2022-11-11 15:04:40,Python,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"def IsPrime(n):\n    # 2, 3 单独处理\n    if n == 2 or n == 3:\n        return True\n    # 不在 6 的倍数两侧的不是素数\n    if n % 6 != 1 and n % 6 != 5:\n        return False\n    # 在 6 的倍数两侧的不一定是素数\n    for i in range(5, int(n ** 0.5) + 1, 6):\n        # i 的步长可以放大到 6\n        if n % i == 0 or n % (i + 2) == 0:\n            return False\n    return True\ndata = int(input())\ns = 0\nfor i in range(2,data+1):\n    if IsPrime(i)==True:\n        s = s+1\nprint(s)\n",ACCEPTED,100,2868
1590963819411734528,1e783de44f6cf9abb158b108e556a36ef99d9241fc592b40cfd6cb7d1265eb34,2022-11-11 15:05:07,Java,300.0,1590524835191705600,1572865591226855424,1049226928954454016,import java.util.Scanner;\nclass Main{  \n    public static void main(String[] args) {  \n        int x;\n        int y;\n        int z;\n        int sum=0;\n        Scanner s = new Scanner(System.in);\n        x=s.nextInt();\n        y=s.nextInt();\n        z=s.nextInt();\n        if (x>=0&&x<=100||y>=0&&y<=100||z>=0&&z<=100) {\n            sum=x+y-z;\n            System.out.println(sum);\n        }\n\n    }\n},ACCEPTED,259,18760
1590963831323561984,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-11 15:05:10,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,public class pta {\n    public static void main(String[] args) {\n        System.out.println(2022);\n    }\n    }\n,COMPILE_ERROR,0,0
1590963944771096576,00d0a1b2e987c17fb50850b9ec54bf6b4f8b997eb053d1a9fed6c4888fbe74ed,2022-11-11 15:05:37,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int i,j,n,a[10],b[10],max=0,x;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n        for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        x=0;\n        for(j=0;j<i;j++)\n            x=x-a[j]+b[j];\n        if(x>max)\n            max=x;\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",RUNTIME_ERROR,6,588
1590963980812746752,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 15:05:46,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>>\n\n#define N pow(10,9)\n\nint main()\n{\n    int t,n[N],i;\n    scanf(\""%d\"",&t);\n    for(i=0;i<=t;i++)\n        scanf(\""%d\"",&n);\n    for(i=0;i<=t;i++)\n    {\n        if(n>0||n<pow(10,9))\n            printf(\""输入错误\\n\"");\n        else printf(\""%d\"",pow(6,n)%10);\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590964041613357056,abe2744e33bb397ffb9bb13afcb202f611378fb4fc5801202f03933298ce5f5d,2022-11-11 15:06:00,Java,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n    public static void main(String[] args) throws IOException {\n\n        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n        String[] string=reader.readLine().split(\"" \"");\n        System.out.println(Integer.parseInt(string[0])+Integer.parseInt(string[1])-Integer.parseInt(string[2]));\n    }\n}\n",ACCEPTED,150,16968
1590964062790422528,00d0a1b2e987c17fb50850b9ec54bf6b4f8b997eb053d1a9fed6c4888fbe74ed,2022-11-11 15:06:05,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int i,j,n,a[10],b[10],max=0,x;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n        for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        x=0;\n        for(j=0;j<i;j++)\n            x=x-a[j]+b[j];\n        if(x>max)\n            max=x;\n    }\n    printf(\""%d\"",max);\n    return 0;\n}\n",RUNTIME_ERROR,4,576
1590964099729653760,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-11 15:06:14,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,public class pta {\n    public static void main(String[] args) {\n        System.out.println(2022);\n    }\n    }\n,COMPILE_ERROR,0,0
1590964143962763264,b80fc2aed0abde15bdaa9327874c9784da696b6ed442d90001602ff2a017be15,2022-11-11 15:06:25,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nchar key[100000001];             \nlong long flag = 3,N,result=0;\n \nvoid Change(long long num){      \n    long long op = num;\n    do{\n        key[op] = '}';\n        op+=num;\n    } while (op<=N);\n}\n \nvoid SU(long long num){          \n    long long len = sqrt(num)+1;\n    while (flag<=len){\n        if(num%len==0) return ;\n        flag+=2;\n    }\n    Change(num);\n    result++;\n}\n \nint main(void){\n \n    scanf(\""%lld\"",&N);\n    if(N>=2) {\n        result++;\n        Change(2);\n    }\n    for(long long z=3;z<=N;z+=2){\n        if(key[z]=='}') continue;\n        SU(z);\n    }\n    printf(\""%lld\"",result);\n    return 0;\n}",ACCEPTED,6,452
1590964183619907584,00d0a1b2e987c17fb50850b9ec54bf6b4f8b997eb053d1a9fed6c4888fbe74ed,2022-11-11 15:06:34,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int i,j,n,a[10],b[10],max=0,x;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n        for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        x=0;\n        for(j=0;j<i;j++)\n            x=x-a[j]+b[j];\n        if(x>max)\n            max=x;\n    }\n    printf(\""%d\"",max);\n    pritnf(\""\\n\"");\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590964218835283968,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 15:06:43,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#define n 100000\nint main()\n{\n    int a,i,j,t,sum=0,,e;\n    scanf(\""%d\"",&a);\n    int b[n],c[n],d[n];\n    for(i=0;i<a;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(j=0;j<a;j++)\n    {\n        scanf(\""%d\"",&c[j]);\n    }\n    int max=a;\n    for(t=0;t<a;t++)\n    {\n        d[t]=c[t]-b[t];\n        if(d[t]>0) sum+=d[t];\n        if(d[t]<0) \n        {\n            e=max;\n            max=t;\n            if(max<e) max=e;\n        }\n    }\n    if(sum>0)\n    printf(\""%d\\n\"",sum);\n    else\n    printf(\""%d\\n\"",max);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590964225172901888,00d0a1b2e987c17fb50850b9ec54bf6b4f8b997eb053d1a9fed6c4888fbe74ed,2022-11-11 15:06:44,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int i,j,n,a[10],b[10],max=0,x;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n        for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        x=0;\n        for(j=0;j<i;j++)\n            x=x-a[j]+b[j];\n        if(x>max)\n            max=x;\n    }\n    printf(\""%d\"",max);\n    printf(\""\\n\"");\n    return 0;\n}\n",RUNTIME_ERROR,4,476
1590964250414223360,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 15:06:50,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#define n 100000\nint main()\n{\n    int a,i,j,t,sum=0,e;\n    scanf(\""%d\"",&a);\n    int b[n],c[n],d[n];\n    for(i=0;i<a;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(j=0;j<a;j++)\n    {\n        scanf(\""%d\"",&c[j]);\n    }\n    int max=a;\n    for(t=0;t<a;t++)\n    {\n        d[t]=c[t]-b[t];\n        if(d[t]>0) sum+=d[t];\n        if(d[t]<0) \n        {\n            e=max;\n            max=t;\n            if(max<e) max=e;\n        }\n    }\n    if(sum>0)\n    printf(\""%d\\n\"",sum);\n    else\n    printf(\""%d\\n\"",max);\n    return 0;\n}\n",WRONG_ANSWER,4,184
1590964296685760512,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 15:07:01,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main(void)\n{\n    int n,i,j,k;\n    int a[10];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=0;j<n;j++)\n    {\n        if(a[j]%6==0)\n        {\n            printf(\""6\"");\n        }\n    }\n}",WRONG_ANSWER,4,472
1590964336095461376,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 15:07:11,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main(void)\n{\n    int n,i,j;\n    int a[10];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=0;j<n;j++)\n    {\n        if(a[j]%6==0)\n        {\n            printf(\""6\"");\n        }\n    }\n}",WRONG_ANSWER,3,184
1590964415212617728,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 15:07:29,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#define n 100000\nint main()\n{\n    int a,i,j,t,sum=0,e;\n    scanf(\""%d\"",&a);\n    int b[n],c[n],d[n];\n    for(i=0;i<a;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(j=0;j<a;j++)\n    {\n        scanf(\""%d\"",&c[j]);\n    }\n    int max=a;\n    for(t=0;t<a;t++)\n    {\n        d[t]=c[t]-b[t];\n        if(d[t]>0) sum+=d[t];\n        if(d[t]<0) \n        {\n            e=max;\n            max=t;\n            if(max<e) max=e;\n        }\n    }\n    if(sum>0)\n    printf(\""%d\\n\"",sum);\n    else\n    printf(\""%d\\n\"",d[max]);\n    return 0;\n}\n",WRONG_ANSWER,4,324
1590964451065507840,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 15:07:38,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main(void)\n{\n    int n,i,j;\n    int a[10];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=0;j<n;j++)\n    {\n        if(a[j]!=0)\n        {\n            printf(\""6\"");\n        }\n    }\n}",WRONG_ANSWER,14,440
1590964469449142272,977c9d350f87cd8386fa1f88cca886d6ff43821830806e60da6d6b36dc77cd13,2022-11-11 15:07:42,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int i,j,n;\n    int num=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n    {\n      for(j=2;j<=sqrt(i);j++)\n      {\n        if(i%j==0)\n          break;\n      }\n      if(j>sqrt(i))\n          num++;\n    }\n    printf(\""%d\"",num);\n}",ACCEPTED,14,332
1590964567117705216,6383c93cbdef4af3eda29400a925819f16ad4afc8368e604ccd580cba7055bdd,2022-11-11 15:08:06,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main()\n{\n    int t;\n    if(scanf(\""%d\"",&t)){\n    for(int k=1;k<=t;k++){\n    int n;\n    if(scanf(\""%d\"",&n)){\n    int x = 6;\n    int j = pow(x,n);\n    int res = j%10;\n    printf(\""%d\"",res);\n    if(k<t){\n        printf(\""\\n\"");\n    }\n    }\n    }\n    }\n    return 0;\n}\n",WRONG_ANSWER,6,312
1590964591587274752,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 15:08:11,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#define n 100000\nint main()\n{\n    int a,i,j,t,sum=0,e;\n    scanf(\""%d\"",&a);\n    int b[n],c[n],d[n];\n    for(i=0;i<a;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(j=0;j<a;j++)\n    {\n        scanf(\""%d\"",&c[j]);\n    }\n    int max=a;\n    for(t=0;t<a;t++)\n    {\n        d[t]=c[t]-b[t];\n        if(d[t]>0) sum+=d[t];\n        if(d[t]<0) \n        {\n            e=max;\n            max=t;\n            if(max>e) max=e;\n        }\n    }\n    if(sum>0)\n    printf(\""%d\\n\"",sum);\n    else\n    printf(\""%d\\n\"",d[max]);\n    return 0;\n}\n",WRONG_ANSWER,5,320
1590964655323942912,6383c93cbdef4af3eda29400a925819f16ad4afc8368e604ccd580cba7055bdd,2022-11-11 15:08:27,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main()\n{\n    int t;\n    if(scanf(\""%d\"",&t)){\n    for(int k=1;k<=t;k++){\n    int n;\n    if(scanf(\""%d\"",&n)){\n    int x = 6;\n    int j = pow(x,n);\n    int res = j%10;\n    printf(\""%d\"",res);\n    if(k<t){\n        printf(\""\\n\"");\n    }\n    }\n    }\n    }\n    return 0;\n}\n",WRONG_ANSWER,6,356
1590964664832425984,667c2e97e82c372f60661d46943ff56a17c9350387f4364ebabe70ac2e232862,2022-11-11 15:08:29,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int t,n;\n    scanf(\""%d\"",&t);\n    while(n--){\n        scanf(\""%d\"",&t);\n        printf(\""%d\"",(int)pow(6,t)%10);\n        if(n>0){\n            printf(\""\\n\"")\n        }\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1590964683400613888,00d0a1b2e987c17fb50850b9ec54bf6b4f8b997eb053d1a9fed6c4888fbe74ed,2022-11-11 15:08:33,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int i,j,n,a[10],b[10],max=0,x;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n        for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        x=0;\n        for(j=0;j<i;j++)\n            x=x-a[j]+b[j];\n        if(x>max)\n            max=x;\n    }\n    printf(\""%d\"",max);\n    printf(\""\\n\"");\n    return 0;\n}\n",RUNTIME_ERROR,3,324
1590964759820808192,ac8f59b25134794bd5bbab0bc50a8849fde16a6d4ee0a5c94442817933ef3088,2022-11-11 15:08:52,Java,300.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.*;\nimport java.lang.*;\npublic class Main {\n    public static void main(String args[]) {\n        int a;\n        int b = 0;\n        int flag = 0;\n        Scanner scanner = new Scanner(System.in);\n        a = scanner.nextInt();\n        for (int i = 2; i <= a; i++) {\n            if(i!=2&&i%2==0)\n                continue;\n            else {\n                for (int j = 2;j<=(int)Math.sqrt(i); j++) {\n                    if (i % j == 0) {\n                        flag = 1;\n                        break;\n                    }\n                }\n\n                if (flag == 0) {\n                    b++;\n                }\n                flag = 0;\n            }\n        }\n        System.out.println(b);\n    }\n}\n,ACCEPTED,278,20492
1590964776149233664,42cfad7191c5e6c0eee156c4369182744d6c5db3bc2a5dc87f9f1be6ee4bbcfe,2022-11-11 15:08:55,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n\tint t,s=0,x=0;\n\tint a[t];\n\tscanf(\""%d\"",&t);\n\tint i,j;\n\tfor(i=0;i<t;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=0;i<t;i++){\n        s=pow(6,a[i]);\n        if(s>10) x=s%10;\n        printf(\""%d\"",x);\n        if(i<t-1)\n        printf(\""\\n\"");   \n}\t\n    return 0;\n}",WRONG_ANSWER,6,324
1590964791785623552,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 15:08:59,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main(){\n    int c;\n    scanf(\""%d\"",&c);\n    int a[100],b[100];\n    int d[100];\n    int zhongjian;\n    for(int i=0;i<c;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(int i=0;i<c;i++){\n        scanf(\""%d\"",&b[i]);\n    }\n    int sum=0;\n    int k=0;\n    for(int j=0;j<c;j++) {\n\n        sum += b[j] - a[j];\n        d[k++] = sum;\n    }\n    int max=d[0];\n    for (int i = 1; i < c; i++) {\n        if (d[i] >max) {\n            max=d[i];\n        }\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",WRONG_ANSWER,5,388
1590964794432225280,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 15:09:00,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main(void)\n{\n    int n,i,j;\n    int a[10];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=0;j<n;j++)\n    {\n        if(a[j]%6!=0)\n        {\n            printf(\""6\"");\n        }\n    }\n}",TIME_LIMIT_EXCEEDED,3,308
1590964819254116352,667c2e97e82c372f60661d46943ff56a17c9350387f4364ebabe70ac2e232862,2022-11-11 15:09:06,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,a;\n    scanf(\""%d\"",&n);\n    while(n--){\n        scanf(\""%d\"",&a);\n        printf(\""%d\"",(int)pow(6,a)%10);\n        if(n>0){\n            printf(\""\\n\"")\n        }\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1590964867228565504,75a6755f083ffc71d77ba6ce593bd24fe8a2ce61edc4710fbde2dce128c47ab4,2022-11-11 15:09:17,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,j,m;\n\n    scanf(\""%d\"",&n);\n\n    int a[n],b[n],sum[n],max[n];\n\n    for(i=0;i<n;i++)\n    scanf(\""%d\"",&a[i]);\n\n    for(i=0;i<n;i++)\n    scanf(\""%d\"",&b[i]);\n\n\n    for(i=0;i<n;i++)\n    {\n     sum[i]=b[i]-a[i];\n    }\n\n\n    for(i=0;i<n;i++)\n    {\n        int t=0;\n     for(j=0;j<n-i;j++)\n     {\n        t=t+sum[j];\n     }\n        max[i]=t;\n\n    }\n\n    m=max[0];\n    for(i=1;i<n;i++)\n    {\n        if(max[i]>m)\n            m=max[i];\n    }\n\n\n\n    printf(\""%d\"",m);\n\n    return 0;\n\n}\n",WRONG_ANSWER,3,348
1590964879379443712,667c2e97e82c372f60661d46943ff56a17c9350387f4364ebabe70ac2e232862,2022-11-11 15:09:20,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,a;\n    scanf(\""%d\"",&n);\n    while(n--){\n        scanf(\""%d\"",&a);\n        printf(\""%d\"",(int)pow(6,a)%10);\n        if(n>0){\n            printf(\""\\n\"")\n        }\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1590964937793540096,5a1c17b308a3b3595833d34c6bdfb75e9f5dd0d065acfeb7f28ab8102ba7406c,2022-11-11 15:09:34,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main()\n{\n    int n,i,j,k;\n    int sum1 = 0;\n    int sum2 = 0;\n    scanf(\""%d\"",&n);\n    int x[n],y[n];\n    int z[n];\n    int m[n];\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&x[i]);\n        x[i] = -x[i];\n    }\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&y[i]);\n    }\n        for(j=0;j<n;j++){\n            sum1 += x[j]+y[j];\n            z[j] = sum1;\n        }\n    int max = z[0];\n    for(k=1;k<n;k++){\n        if(max<z[k]){\n            max = z[k];\n        }\n    }\n        for(j=n-1;j>=0;j--){\n            sum2 += x[j]+y[j];\n            m[j]  = sum2;\n            if(m[j]>max){\n                max = m[j];\n                break;\n            }\n        }\n   printf(\""%d\\n\"",max);\n    return 0;\n}\n",WRONG_ANSWER,3,344
1590964953983528960,a5291eb67188c2a916aa5dd9fc38f2e449aa9f9a3cd047f282d8c154ea2979cd,2022-11-11 15:09:38,C++,300.0,1590681458522583041,1590676393489461248,1049226928954454016,#include <iostream>\n\nusing namespace std;\nconst int N = 1e6 + 10;\n\nint dp[N];\n\n\nint main()\n{\n    int n = 0;\n    cin >> n;\n    dp[1] = 0;\n    for(int i = 2;i <= n;i++)\n    {\n        int cnt = 0;\n        for(int j = 1;j <= (i>>1);j++)\n        {\n            int t = i / j;\n            if(t * j == i)\n            {\n                cnt++;\n            }\n            if(cnt >= 2)\n            {\n                break;\n            }\n        }\n        if(cnt == 1)\n        {\n            dp[i] = dp[i - 1] + 1;\n        }\n        else\n        {\n            dp[i] = dp[i - 1];\n        }\n    }\n    \n    cout << dp[n] << endl;\n    return 0;\n},ACCEPTED,500,736
1590964962791591936,667c2e97e82c372f60661d46943ff56a17c9350387f4364ebabe70ac2e232862,2022-11-11 15:09:40,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,a;\n    scanf(\""%d\"",&n);\n    while(n--){\n        scanf(\""%d\"",&a);\n        printf(\""%d\"",(int)pow(6,a)%10);\n        if(n>0){\n            printf(\""\\n\"");\n        }\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1590965006747873280,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-11 15:09:50,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,public class pta {\n    public static void main(String[] args) {\n        System.out.println(2022);\n    }\n    }\n,COMPILE_ERROR,0,0
1590965024225538048,78ba72ad62bbe8306c8b3a9b0bcd998483fa2e9f5b653a39aaf1fbe6036a5c10,2022-11-11 15:09:55,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nmain()\n{int X,Y,Z,sum;\nscanf(\""%d,%d,%d\"",&X,&Y,&Z);\n if((X>=0,Y>=0,Z>=0)&&(X<=100,Y<=100,Z<=100))\nsum=X+Y-Z;\nprintf(\""%d\"",sum);\n}",WRONG_ANSWER,3,348
1590965050515456000,acf80eea856463058b81f71c0238069795893092293fbd098cc594959df6444e,2022-11-11 15:10:01,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"n=int(input())\nc=[]\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\nfor k in range(n):\n c.append(b[k]-a[k])\nmax=0\nsam=0\nfor i in range(n):\n    for j in range(i+1,n):\n        sam=sam+a[j]\n        if sam>max:\n            max=sam\nprint(max)\n\n",WRONG_ANSWER,22,2880
1590965056534261760,2a1cee132cc8344d51461f6cbf473fb80705d6fd5972f9a5d0fcfea0760fd8b1,2022-11-11 15:10:02,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint prime(int x)\n{\n    int j=2;\n    if(x==2)\n        {\n        return 1;\n        }\n    while(x%j!=0 && j<=sqrt(x))\n        j++;\n    if(x%j==0)\n        return 0;\n    else\n    {\n        return 1;\n    }\n}\nint main( )\n{\n    int i,n,ans=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n        if(prime(i)) ans++;\n    printf(\""%d\\n\"",ans);\n    return 0;\n}\n",ACCEPTED,21,348
1590965084128612352,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 15:10:09,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#inlcude <main>\nint main(){\n    int n,a;\n    scanf(\""%d\"",&a);\n    while(n--){\n        scanf(\""%d\"",&a);\n        printf(\""%d\"",(int)pow(6,a)%10);\n        if(n>0){\n            printf(\""\\n\"");\n    }\n}\n}",COMPILE_ERROR,0,0
1590965086691328000,667c2e97e82c372f60661d46943ff56a17c9350387f4364ebabe70ac2e232862,2022-11-11 15:10:10,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n, a;\n    scanf(\""%d\"", &n);\n    while(n--){\n        scanf(\""%d\"", &a);\n        printf(\""%d\"", (int)pow(6,a) % 10);\n        if(n>0){\n            printf(\""\\n\"");\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,9,196
1590965109919383552,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-11 15:10:15,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<math.h>\n#include <stdio.h>\nint main()\n{\n    int i,t,n;\n    scanf(\""%d\"",&t);\n    for(i=1;i<=t;i++)\n     scanf(\""%d\"",&n);\n    for(i=1;i<=t;i++)\n        printf(\""%d\\n\"",6);\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,4,480
1590965154936852480,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-11 15:10:26,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<math.h>\n#include <stdio.h>\nint main()\n{\n    int i,t,n;\n    scanf(\""%d\"",&t);\n    for(i=1;i<=t;i++)\n     scanf(\""%d\"",&n);\n    for(i=1;i<=t;i++)\n        printf(\""%d\\n\"",6);\n    return 0;\n}\n",WRONG_ANSWER,9,320
1590965277754458112,d21dc339d37b0772b2547441444d4b660b000ac3ebe190aee01769e2dd619c10,2022-11-11 15:10:55,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\na=int(input())\ndata=list(map(int,input().split()))\nfor i in range(a):\n    if 0<=data[i]<=1000000000:\n        s=int(math.pow(6,data[i]))\n        s=str(s)\n        print(s[-1],end=\""\\n\"")\n    else:\n        break\n",WRONG_ANSWER,39,2912
1590965313712230400,1a4463a67236431e94a4a4d273d88450d6acce220fed7155af8798b0664ee731,2022-11-11 15:11:04,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint prime(int x)\n{\n    int j=2;\n    if(x==2)\n        {\n        return 1;\n        }\n    while(x%j!=0 && j<=sqrt(x))\n        j++;\n    if(x%j==0)\n        return 0;\n    else\n    {\n        return 1;\n    }\n}\nint main( )\n{\n    int i,n,ans=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n        if(prime(i)) ans++;\n    printf(\""%d\\n\"",ans);\n    return 0;\n}\n",ACCEPTED,20,192
1590965373476868096,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 15:11:18,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#define n 100000\nint main()\n{\n    int a,i,j,t,sum=0,e,flag=0;\n    scanf(\""%d\"",&a);\n    int b[n],c[n],d[n];\n    for(i=0;i<a;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(j=0;j<a;j++)\n    {\n        scanf(\""%d\"",&c[j]);\n    }\n    int max=a;\n    for(t=0;t<a;t++)\n    {\n        d[t]=c[t]-b[t];\n        if(d[t]>0) \n        {\n            sum+=d[t];\n            flag=1;\n        }\n        if(flag==0) \n        {\n            sum=d[0];\n        }\n    }\n    printf(\""%d\\n\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,3,196
1590965386324021248,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-11 15:11:21,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,public class pta {\n    public static void main(String[] args) {\n        System.out.println(2022);\n    }\n    },COMPILE_ERROR,0,0
1590965397753499648,4d1157ac6ad50cfc6ca5d6b3e1c2dd7f1ecc593df10ff6888d4207a4f1c03a35,2022-11-11 15:11:24,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#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        \n    }\n    for(int j=1;j<=n;j++)\n        {\n            printf(\""6\"");\n            if(j!=n)printf(\""\\n\"");\n        }\n        \n    return 0;\n}",WRONG_ANSWER,12,480
1590965402639839232,acf80eea856463058b81f71c0238069795893092293fbd098cc594959df6444e,2022-11-11 15:11:25,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"n=int(input())\nc=[]\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\nfor k in range(n):\n c.append(b[k]-a[k])\nmax=0\nsam=0\nfor i in range(n):\n    for j in range(i+1,n):\n        sam=sam+c[j]\n        if sam>max:\n            max=sam\nprint(max)\n\n",WRONG_ANSWER,18,2752
1590965412244815872,5a1c17b308a3b3595833d34c6bdfb75e9f5dd0d065acfeb7f28ab8102ba7406c,2022-11-11 15:11:27,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main()\n{\n    int n,i,j,k;\n    int sum1 = 0;\n    int sum2 = 0;\n    scanf(\""%d\"",&n);\n    int x[n],y[n];\n    int z[n];\n    int m[n];\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&x[i]);\n        x[i] = -x[i];\n    }\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&y[i]);\n    }\n        for(j=0;j<n;j++){\n            sum1 += x[j]+y[j];\n            z[j] = sum1;\n        }\n    int max = z[0];\n    for(k=1;k<n;k++){\n        if(max<z[k]){\n            max = z[k];\n        }\n    }\n        for(j=n-1;j>=0;j--){\n            sum2 += x[j]+y[j];\n            m[j]  = sum2;\n            if(m[j]>max){\n                max = m[j];\n                break;\n            }\n        }\n   printf(\""%d\"",max);\n    return 0;\n}\n",WRONG_ANSWER,4,180
1590965438538907648,d21dc339d37b0772b2547441444d4b660b000ac3ebe190aee01769e2dd619c10,2022-11-11 15:11:33,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\na=int(input())\ndata=list(map(int,input().split()))\nfor i in range(a):\n    if 0<=data[i]<=1000000000:\n        s=int(math.pow(6,data[i]))\n        s=str(s)\n        print(s[-1],end=\""\\n\"")\n    else:\n        break\n",TIME_LIMIT_EXCEEDED,16,2884
1590965466993070080,55950e2d4c314feed0856fa0f6b80f22c5c36f2ebe0d75c8ee2cadb1a06b2fe1,2022-11-11 15:11:40,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main(){\n\n    int a,b[100],c[100],i;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++){\n        scanf(\""%d\"",&b[i]);\n        c[i]=pow(6,b[i]);\n        c[i]=c[i]%10;\n\n    }\n    for(i=0;i<a-1;i++){\n\n        printf(\""%d\\n\"",c[i]);\n    }\n    for(i=a-1;i<a;i++){\n        printf(\""%d\"",c[i]);\n        \n    }\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n    return 0;\n}\n",WRONG_ANSWER,7,308
1590965472244338688,6383c93cbdef4af3eda29400a925819f16ad4afc8368e604ccd580cba7055bdd,2022-11-11 15:11:41,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int t;\n    scanf(\""%d\"",&t);\n    while(t>0){\n        int a;\n        scanf(\""%d\"",&a);\n        if(a==0){\n            printf(\""1\\n\"");\n        }else{\n            printf(\""6\\n\"");\n        }\n    }\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,20,316
1590965472374337536,42cfad7191c5e6c0eee156c4369182744d6c5db3bc2a5dc87f9f1be6ee4bbcfe,2022-11-11 15:11:41,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n\tint t,s=0,x=0;\n\tint a[t];\n\tscanf(\""%d\"",&t);\n\tint i,j;\n\tfor(i=0;i<t;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=0;i<t;i++){\n        s=pow(6,a[i]);\n        if(s>10) x=s%10;\n        printf(\""%d\"",x);\n        if(i<t-1)\n        printf(\""\\n\"");   \n}\t\n    return 0;\n}",WRONG_ANSWER,6,324
1590965491697520640,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-11 15:11:46,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int X,Y,Z,H;\n    scanf(\""%d %d %d\"",&X,&Y,%Z);\n    0<=X,Y,Z<=100;\n    H=X+Y-Z;\n    printf(\""%d\"",&H);\n    return 0;\n}",COMPILE_ERROR,0,0
1590965498936885248,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 15:11:48,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j;\n    int a[10];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=0;j<n;j++)\n    {\n        if(a[j]%6!=0)\n        {\n            printf(\""6\"");\n        }\n    }\n}",WRONG_ANSWER,11,320
1590965499125633024,303021c0ef4f93101c801ad0c8851ab3828a16b5c728ce8e6859ab342ddc4b26,2022-11-11 15:11:48,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n   int n,i,j,num=0;\n   scanf(\""%d\"",&n);\n\n   if(n>=2||n<=pow(10,5))\n    for(i=2;i<=n;i++)\n   {\n       for(j=2;j<=i;j++)\n       {\n           if(i%j==0)\n           {\n               if(j>=i)\n                num++;\n               else\n               break;\n           }\n       }\n   }\n    printf(\""%d\"",num);\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,1000,380
1590965503919697920,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-11 15:11:49,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<math.h>\n#include <stdio.h>\nint main()\n{\n    int i,t,n;\n    scanf(\""%d\"",&t);\n    for(i=1;i<=t;i++)\n     scanf(\""%d\"",&n);\n    for(i=1;i<t;i++)\n        printf(\""%d\\n\"",6);\n    printf(\""%d\"",6);\n    return 0;\n}\n",WRONG_ANSWER,9,340
1590965546126979072,b31601c92a4a3080abbaad650e00bb77253224eab66b59a49b2118d017649c2c,2022-11-11 15:11:59,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b,c;\n    scanf(\""%d\""\\n,&a);\n    scanf(\""%d\""\\n,&b);\n    scanf(\""%d\""\\n,&c);\n    d = a + b - c;\n\n    printf(\""d\\n\"");\n    return 0;\n}\n\n",COMPILE_ERROR,0,0
1590965594868985856,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 15:12:11,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j;\n    int a[10];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=0;j<n;j++)\n    {\n        if(a[j]%6!=0)\n        {\n            printf(\""6\\n\"");\n        }\n    }\n}",WRONG_ANSWER,15,344
1590965602972381184,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-11 15:12:13,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,public class pta {\n    public static void main(String[] args) {\n        System.out.println(2022);\n    }\n    },COMPILE_ERROR,0,0
1590965612887736320,303021c0ef4f93101c801ad0c8851ab3828a16b5c728ce8e6859ab342ddc4b26,2022-11-11 15:12:15,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n   int n,i,j,num=0;\n   scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n   {\n       for(j=2;j<=i;j++)\n       {\n           if(i%j==0)\n           {\n               if(j>=i)\n                num++;\n               else\n               break;\n           }\n       }\n   }\n    printf(\""%d\"",num);\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,1000,312
1590965653467627520,00d0a1b2e987c17fb50850b9ec54bf6b4f8b997eb053d1a9fed6c4888fbe74ed,2022-11-11 15:12:25,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n#define n 10\n\nint main()\n{\n    int t,i,a[n];\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n        if(a[i]==0)\n            a[i]=1;\n        a[i]=pow(6,a[i]);\n        a[i]=a[i]%10;\n    }\n    for(i=0;i<t-1;i++)\n    {\n        printf(\""%d\"",a[i]);\n        printf(\""\\n\"");\n    }\n    printf(\""%d\"",a[i]);\n    return 0;\n}\n",WRONG_ANSWER,6,344
1590965730974150656,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 15:12:43,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"n = int(input())\nxh = list(map(eval,input().split()))\nhd = list(map(eval,input().split()))\ndata=[]\ns = 0\nt = 0\nmax=0\nfor i in range(n):\n    s = hd[i]-xh[i]\n    data.append(s)\nfor i in data:\n    t =t+i\n    if t>max:\n        max = t\n\nprint(max)",WRONG_ANSWER,18,2816
1590965733138436096,d21dc339d37b0772b2547441444d4b660b000ac3ebe190aee01769e2dd619c10,2022-11-11 15:12:44,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\na=int(input())\ndata=list(map(int,input().split()))\nfor i in range(a):\n    if 0<=data[i]<=1000000000:\n        s=int(math.pow(6,data[i]))\n        s=str(s)\n        print(s[-1],end=\""\\n\"")\n    else:\n        break\n",WRONG_ANSWER,36,3012
1590965739559915520,303021c0ef4f93101c801ad0c8851ab3828a16b5c728ce8e6859ab342ddc4b26,2022-11-11 15:12:45,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n   int n,i,j,num=0;\n   scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n   {\n       for(j=2;j<=i;j++)\n       {\n           if(i%j==0)\n           {\n               if(j>=i)\n                num++;\n                break;\n           }\n       }\n   }\n    printf(\""%d\"",num);\n    return 0;\n}\n",ACCEPTED,994,340
1590965826952409088,d830b0bcae7881ad6d1b2e2b14f3ffa3695b6d3bd622856493fa1cf903c9bf4e,2022-11-11 15:13:06,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc= new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint count=1;\n\t\tfor(int i=1;i<n;i+=2) {\n\t\t\tboolean flag = true;\n\t\t\tfor(int j =2;j<i;j++) {\n\t\t\t\tif(i%j==0) {\n\t\t\t\t\tflag = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(flag) {\n\t\t\t\tcount=count+1;\n\t\t\t}\n\t\t}\n\t\tSystem.out.print(count);\n\t}\n}\n,TIME_LIMIT_EXCEEDED,1000,16428
1590965848775393280,00d0a1b2e987c17fb50850b9ec54bf6b4f8b997eb053d1a9fed6c4888fbe74ed,2022-11-11 15:13:11,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n#define n 10\n\nint main()\n{\n    int t,i,a[n];\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n        if(a[i]==0)\n        {\n            a[i]=1;\n            continue;\n        }\n        a[i]=pow(6,a[i]);\n        a[i]=a[i]%10;\n    }\n    for(i=0;i<t-1;i++)\n    {\n        printf(\""%d\"",a[i]);\n        printf(\""\\n\"");\n    }\n    printf(\""%d\"",a[i]);\n    return 0;\n}\n",WRONG_ANSWER,8,576
1590965880211681280,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 15:13:19,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint a,i,j;\n    int count=0;\n\tscanf(\""%d\"",&a);\n\tfor(i=2;i<=a;i++)\n\t\t{\n\t\tfor(j=2;j<=i;j++)\n\t\t\tif(i%j==0)\n\t\t\t\tbreak;\n\t\tif(i==j)\n\t\t\tcount++;\n\t\t}\n    return 0;\n}",WRONG_ANSWER,3,472
1590966013540241408,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 15:13:51,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main(){\n    int x,y,z;\n    printf(\""请输入三个整数空格隔开：\"");\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    \n    int m =0;\n    m = x+y-z;\n    printf(\""m=%d\"",m);\n    return 0;\n}",WRONG_ANSWER,4,188
1590966025141682176,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-11 15:13:53,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,public class pta {\n    public static void main(String[] args) {\n        System.out.println(2022);\n    }\n    },COMPILE_ERROR,0,0
1590966047941922816,6383c93cbdef4af3eda29400a925819f16ad4afc8368e604ccd580cba7055bdd,2022-11-11 15:13:59,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int t;\n    if(scanf(\""%d\"",&t)){\n    while(t>0){\n        int a;\n        if(scanf(\""%d\"",&a)){\n        if(a==0){\n            printf(\""1\\n\"");\n        }else{\n            printf(\""6\\n\"");\n        }}\n        t--;\n    }}\n    return 0;\n}\n",ACCEPTED,12,464
1590966060826800128,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-11 15:14:02,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<math.h>\n#include <stdio.h>\nint main()\n{\n    int i,t,n;\n    scanf(\""%d\"",&t);\n    for(i=1;i<=t;i++)\n    {\n     scanf(\""%d\"",&n);\n     printf(\""%d\\n\"",6);\n    }\n    return 0;\n}\n",WRONG_ANSWER,9,336
1590966125112918016,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 15:14:17,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"n = int(input())\nxh = list(map(eval,input().split()))\nhd = list(map(eval,input().split()))\ndata=[]\n\nt = 0\nmax=0\nfor i in range(n):\n    s = hd[i]-xh[i]\n    data.append(s)\nfor i in data:\n    t =t+i\n    if t>max:\n        max = t\n\nprint(max)",WRONG_ANSWER,18,2880
1590966155739725824,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 15:14:24,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j;\n    int a[10];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=0;j<n;j++)\n    {\n        if(j<(n-1)&&a[j]%6!=0)\n        {\n            printf(\""6\\n\"");\n        }\n    }\n    printf(\""6\"");\n}",WRONG_ANSWER,9,488
1590966164333854720,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-11 15:14:26,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,public class pta {\n    public static void main(String[] args) {\n        System.out.println('2022');\n    }\n    },COMPILE_ERROR,0,0
1590966200828497920,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 15:14:35,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main(){\n    int x,y,z;\n    printf(\""请输入三个整数空格隔开：\"");\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    \n   \n    printf(\""m=%d\"", x+y-z);\n    return 0;\n}",WRONG_ANSWER,4,196
1590966201457643520,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-11 15:14:35,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"public class pta {\n    public static void main(String[] args) {\n        System.out.println(\""2022\"");\n    }\n    }",COMPILE_ERROR,0,0
1590966312719941632,a27ecb139a3fa065feadb903517977dc609a6d218c4e082e7ec449c78806823c,2022-11-11 15:15:02,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int t,i,x,y;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&a[t]);\n    }\n    for(i=0;i<t;i++)\n    {\n        x=pow(6,a[t]);\n        y=x%10;\n        printf(\""%d\\n\"",y);\n    }\n    return 0;\n}",WRONG_ANSWER,11,384
1590966340758843392,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-11 15:15:09,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"public class pta {\n    public static void main(String[] args) {\n        System.out.println(\""2022\"");\n    }\n    }\n",COMPILE_ERROR,0,0
1590966345758474240,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 15:15:10,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main(){\n    int x,y,z;\n    printf(\""请输入三个整数空格隔开：\"");\n    scanf(\""%d\\n%d\\n%d\\n\"",&x,&y,&z);\n    \n    printf(\""m=%d\"", x+y-z);\n    return 0;\n}",WRONG_ANSWER,4,488
1590966349654982656,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 15:15:11,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"",&n);\n    int arr1[1000] = {0};\n    int arr2[1000] = {0};\n    for(int i = 0; i < n; ++i)\n    {\n        scanf(\""%d\"",&arr1[i]);\n    }\n    for(int j = 0; j < n; ++j)\n    {\n        scanf(\""%d\"",&arr2[j]);\n    }\n    int max1 = 0, max2 = 0, min = 0, count = 0, k = 0;\n    for(k = 0; k < n; ++k)\n    {\n        int sum = arr2[k] - arr1[k];\n        if(sum <= 0)\n        {\n            //min = arr2[k] - arr1[k];\n            if(max1 < max2)\n            {\n                max1 = max2; \n            }\n            max2 = 0;\n        }\n        else\n        {\n            max2 += sum;\n        }\n    }\n    printf(\""%d\"",max1 > max2 ? max1 : max2);\n    return 0;\n}",WRONG_ANSWER,3,324
1590966407611875328,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 15:15:24,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main(){\n    int x,y,z;\n    printf(\""请输入三个整数空格隔开：\"");\n    scanf(\""%d\\n %d\\n %d\\n\"",&x,&y,&z);\n    \n    printf(\""m=%d\"", x+y-z);\n    return 0;\n}",WRONG_ANSWER,3,328
1590966497768443904,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-11-11 15:15:46,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"t=int(input())\nn=list(map(int,input().split(' ')))\nfor i in range(0,len(n)):\n   print(pow(36,n[i]/2)%10)",WRONG_ANSWER,20,2816
1590966504403832832,15ac7d06a472ca25d78349f7cc3a73d23c7d7a4f0c4ae3cec6200fcdb8135965,2022-11-11 15:15:48,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,s,m,i,t;\n    scanf(\""%d\"",&n);\n        s=0;\n        for(i=2;i<=n;i+=2){\n        for(m=2;m<i;m++)\n\n            if(i%m==0) break;\n\n\n\n            if(i==m)\n                s++;\n\n\n        }\n\n\n\n       printf(\""%d\"",s);\n    return 0;\n}\n",WRONG_ANSWER,3,328
1590966522456113152,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 15:15:52,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#define n 100000\nint main()\n{\n    int a,i,j,t,sum=0,max=0;\n    scanf(\""%d\"",&a);\n    int b[n],c[n],d[n];\n    for(i=0;i<a;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(j=0;j<a;j++)\n    {\n        scanf(\""%d\"",&c[j]);\n    }\n    int max=a;\n    for(t=0;t<a;t++)\n    {\n        d[t]=c[t]-b[t];\n        sum+=d[t];\n        if(sum>max) max=sum;\n    }\n    printf(\""%d\\n\"",max);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590966569184858112,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 15:16:03,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#define n 100000\nint main()\n{\n    int a,i,j,t,sum=0,max=0;\n    scanf(\""%d\"",&a);\n    int b[n],c[n],d[n];\n    for(i=0;i<a;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(j=0;j<a;j++)\n    {\n        scanf(\""%d\"",&c[j]);\n    }\n    for(t=0;t<a;t++)\n    {\n        d[t]=c[t]-b[t];\n        sum+=d[t];\n        if(sum>max) max=sum;\n    }\n    printf(\""%d\\n\"",max);\n    return 0;\n}\n",WRONG_ANSWER,4,308
1590966608925888512,1e783de44f6cf9abb158b108e556a36ef99d9241fc592b40cfd6cb7d1265eb34,2022-11-11 15:16:12,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\nclass Main{  \n    public static void main(String[] args) {  \n        int x;\n        int y;\n        int z;\n        int sum;\n        Scanner s = new Scanner(System.in);\n        sum=s.nextInt();//接收测试个数\n        int[] sum1=new int[sum];\n       for (int i=0;i<sum1.length;i++){\n           sum1[i]=s.nextInt();\n           if (sum1[i]>0){\n               System.out.println(6);\n           }\n       }\n    }\n},NON_ZERO_EXIT_CODE,246,19908
1590966639015800832,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-11 15:16:20,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,m;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&m);\n        if(m==0)\n            printf(\""0\\n\"");\n        else\n            printf(\""6\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,13,356
1590966673694326784,acf80eea856463058b81f71c0238069795893092293fbd098cc594959df6444e,2022-11-11 15:16:28,Python,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"n=int(input())\nc=[]\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\nfor k in range(n):\n c.append(b[k]-a[k])\nmax=0\nsam=0\nfor i in range(n):\n    sam=0\n    for j in range(i+1,n):\n        sam=sam+c[j]\n        if sam>max:\n            max=sam\nprint(max)\n\n",ACCEPTED,17,2876
1590966694993006592,acf80eea856463058b81f71c0238069795893092293fbd098cc594959df6444e,2022-11-11 15:16:33,Python,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"n=int(input())\nc=[]\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\nfor k in range(n):\n c.append(b[k]-a[k])\nmax=0\nsam=0\nfor i in range(n):\n    sam=0\n    for j in range(i+1,n):\n        sam=sam+c[j]\n        if sam>max:\n            max=sam\nprint(max)\n\n",ACCEPTED,22,2744
1590966727863767040,aa65cdf25cbe32699d085a61c4f3ec5a4020e6a3dc1e0e9d6e2a48c9288f8026,2022-11-11 15:16:41,Java,0.0,1590734963702620160,1590734503495200768,1049226928954454016,import java.util.Scanner;\n\npublic class Main{\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int num = scanner.nextInt();\n        int[] getmax = new int[num];\n        int[] arr = new int[num];\n        int[] arr1 = new int[num];\n\n        int maxnum=0;\n        for (int i = 0; i < num; i++) {\n            arr[i] = scanner.nextInt();\n        }\n        for (int j = 0; j < num; j++) {\n            arr1[j] = scanner.nextInt();\n        }\n\n\n        for (int i = 0; i < num; i++) {\n          getmax[i]=arr1[i]-arr[i];\n        }\n        for (int i = 0; i < num; i++) {\n            if (getmax[i]>=0){\n                maxnum+=getmax[i];\n            }\n\n        }\n        System.out.println(maxnum);\n\n    }\n},WRONG_ANSWER,130,19268
1590966770528202752,d21dc339d37b0772b2547441444d4b660b000ac3ebe190aee01769e2dd619c10,2022-11-11 15:16:51,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\na=int(input())\ndata=list(map(int,input().split()))\nfor i in range(a):\n    if 0<=data[i]<=1000000000:\n        s=int(math.pow(6,data[i]))\n        s=str(s)\n        print(s[-1],end=\""\\n\"")\n    else:\n        break\n",WRONG_ANSWER,31,2816
1590966779512426496,aa65cdf25cbe32699d085a61c4f3ec5a4020e6a3dc1e0e9d6e2a48c9288f8026,2022-11-11 15:16:53,Java,0.0,1590734963702620160,1590734503495200768,1049226928954454016,import java.util.Scanner;\n\npublic class Main{\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int num = scanner.nextInt();\n        int[] getmax = new int[num];\n        int[] arr = new int[num];\n        int[] arr1 = new int[num];\n\n        int maxnum=0;\n        for (int i = 0; i < num; i++) {\n            arr[i] = scanner.nextInt();\n        }\n        for (int j = 0; j < num; j++) {\n            arr1[j] = scanner.nextInt();\n        }\n\n\n        for (int i = 0; i < num; i++) {\n          getmax[i]=arr1[i]-arr[i];\n        }\n        for (int i = 0; i < num; i++) {\n            if (getmax[i]>=0){\n                maxnum+=getmax[i];\n            }\n\n        }\n        System.out.println(maxnum);\n\n    }\n},WRONG_ANSWER,123,16400
1590966809145184256,0da8f2df2eb12ff7cceee22b87284a0e7794d94d4125226481c0842fbed3108a,2022-11-11 15:17:00,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<math.h>\n#include <stdio.h>\nint main()\n{\n    int i,j,k,temp=0;\n      scanf(\""%d\"",&i);\n     for(j=2;j<=i;j++)\n      for(k=2;k<=j;k++)\n       if(j%k==0)\n       {\n        if(k>=j)\n         temp++;\n        else\n         break;\n       }\n    printf(\""%d\\n\"",temp);\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,1000,352
1590966878724468736,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 15:17:17,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>>\n\nint main()\n{\n    int t,i,n,a[100];\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<t;i++)\n    {\n        if(a[i]<0||a[i]>pow(10,9))\n            printf(\""输入错误\\n\"");\n        else n=pow(6,a[i]),printf(\""%3d\"",n%10);\n    }\n    return 0;\n}\n",WRONG_ANSWER,6,344
1590966883518558208,1e783de44f6cf9abb158b108e556a36ef99d9241fc592b40cfd6cb7d1265eb34,2022-11-11 15:17:18,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\nclass Main{  \n    public static void main(String[] args) {  \n        int x;\n        int y;\n        int z;\n        int sum;\n        Scanner s = new Scanner(System.in);\n        sum=s.nextInt();//接收测试个数\n        int[] sum1=new int[sum];\n       for (int i=0;i<sum1.length;i++){\n           sum1[i]=s.nextInt();\n           if (sum1[i]>0){\n               System.out.println(6);\n           }\n           else if(sum1[i]==0){\n               System.out.println(1);\n           }\n       }\n    }\n},NON_ZERO_EXIT_CODE,242,19304
1590966915022000128,0da8f2df2eb12ff7cceee22b87284a0e7794d94d4125226481c0842fbed3108a,2022-11-11 15:17:25,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<math.h>\n#include <stdio.h>\nint main()\n{\n    int i,j,k,temp=0;\n      scanf(\""%d\"",&i);\n     for(j=2;j<=i;j++)\n      for(k=2;k<=j;k++)\n       if(j%k==0)\n       {\n        if(k>=j)\n         temp++;\n        else\n         break;\n       }\n    printf(\""%d\"",temp);\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,1000,276
1590966929064505344,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 15:17:29,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"",&n);\n    int arr1[1000] = {0};\n    int arr2[1000] = {0};\n    for(int i = 0; i < n; ++i)\n    {\n        scanf(\""%d\"",&arr1[i]);\n    }\n    for(int j = 0; j < n; ++j)\n    {\n        scanf(\""%d\"",&arr2[j]);\n    }\n    int max1 = 0, max2 = 0, min = 0, count = 0, k = 0;\n    for(k = 0; k < n; ++k)\n    {\n        int sum = arr2[k] - arr1[k];\n        if(sum <= 0)\n        {\n            min += sum;\n            count++;\n            if(max1 < max2)\n            {\n                max1 = max2; \n            }\n            max2 = 0;\n        }\n        else\n        {\n            max2 += sum;\n        }\n    }\n    if(count == n)\n    {\n        printf(\""%d\"",min);\n    }\n    int max = max1 > max2 ? max1 : max2;\n    printf(\""%d\"",max);\n    return 0;\n}",WRONG_ANSWER,4,308
1590966978297270272,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 15:17:41,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc=new Scanner(System.in);\n        int n=sc.nextInt();\n        int sum=1;\n        for(int i=2;i<=n;i++){\n            for (int j=2;j<i;j++){\n                if(i%j==0){\n                    break;\n                }else if(j==i-1&&i%j!=0){\n                    sum++;\n                }\n            }\n        }\n        System.out.println(sum);\n    }\n},TIME_LIMIT_EXCEEDED,1000,16936
1590966985448558592,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 15:17:42,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#define n 100000\nint main()\n{\n    int a,i,j,t,sum=0,max=0;\n    scanf(\""%d\"",&a);\n    int b[n],c[n],d[n];\n    for(i=0;i<a;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(j=0;j<a;j++)\n    {\n        scanf(\""%d\"",&c[j]);\n    }\n    for(t=0;t<a;t++)\n    {\n        d[t]=c[t]-b[t];\n        sum+=d[t];\n        if(sum>max) max=sum;\n    }\n    printf(\""%d\\n\"",max);\n    return 0;\n}\n",WRONG_ANSWER,4,324
1590967069015871488,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 15:18:02,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>>\n\nint main()\n{\n    int t,i,n,a[100];\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<t;i++)\n    {\n        if(a[i]<0||a[i]>pow(10,9))\n            printf(\""输入错误\\n\"");\n        else n=pow(6,a[i]),printf(\""%d\\n\"",n%10);\n    }\n    return 0;\n}\n",WRONG_ANSWER,5,196
1590967069070397440,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 15:18:02,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j;\n    int a[10];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=0;j<n;j++)\n    {\n        if(j<(n-1)&&a[j]%6!=0)\n        {\n            printf(\""6\\n\"");\n        }\n        if(j=>n-1&&j<n&&a[j]%6!=0)\n        {\n            printf(\""6\"");\n        }\n    }\n    \n}",COMPILE_ERROR,0,0
1590967072010600448,3e087b0a196d30fcbb49ca80164c9eb5adf82ae3bb08ec0c141e5728fb180f0d,2022-11-11 15:18:03,Java,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\t\tpublic static int isSuShu(int num) {\n\t\t\tint cnt=0;\n\t\t\tfor(int i=2;i<=Math.sqrt(num);i++) {\n\t\t\t\tif(num%i==0) {\n\t\t\t\t\tcnt++;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn cnt==0?1:0;\n\t\t}\n\t\tpublic static void main(String[] args) throws Exception {\n\t\t\t// TODO Auto-generated method stub\n\t\t\tScanner sc=new Scanner(System.in);\n\t\t\tint n,cunt=0;\n\t\t\tn=sc.nextInt();\n\t\t\tfor(int i=2;i<=n;i++) {\n\t\t\t\tif(isSuShu(i)==1) {\n\t\t\t\t\tcunt++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.print(cunt);\n\t\t\tsc.close();\n\t\t}\n}",ACCEPTED,325,18792
1590967084748681216,15ac7d06a472ca25d78349f7cc3a73d23c7d7a4f0c4ae3cec6200fcdb8135965,2022-11-11 15:18:06,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,s,m,i;\n    scanf(\""%d\"",&n);\n        s=1;\n        for(i=3;i<n;i+=2){\n        for(m=2;m<i;m++)\n\n            if(i%m==0) break;\n\n\n\n            if(i==m)\n                s++;\n\n\n        }\n\n\n\n       printf(\""%d\"",s);\n    return 0;\n}\n",ACCEPTED,945,368
1590967109390237696,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 15:18:12,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main(){\n    int x,y,z;\n    printf(\""请输入三个整数空格隔开：\"");\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    \n    printf(\""m=%d\"", x+y-z);\n    return 0;\n}",WRONG_ANSWER,3,312
1590967156207058944,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-11 15:18:23,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"print(\""2022\"")",ACCEPTED,18,2760
1590967177732227072,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 15:18:28,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc=new Scanner(System.in);\n        int n=sc.nextInt();\n        int sum=1;\n        for(int i=2;i<=n;i++){\n            for (int j=2;j<i;j++){\n                if(i%j==0){\n                    break;\n                }else if(j==i-1){\n                    sum++;\n                }\n            }\n        }\n        System.out.println(sum);\n    }\n},TIME_LIMIT_EXCEEDED,1000,16272
1590967181981057024,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-11-11 15:18:29,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"t=int(input())\nn=list(map(int,input().split(' ')))\nfor i in range(0,len(n)):\n   print(pow(36,round([i]/2),1)%10)",NON_ZERO_EXIT_CODE,16,2760
1590967222657417216,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 15:18:39,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j;\n    int a[10];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=0;j<n;j++)\n    {\n        if(j<(n-1)&&a[j]%6!=0)\n        {\n            printf(\""6\\n\"");\n        }\n        if(j=n-1&&a[j]%6!=0)\n        {\n            printf(\""6\"");\n        }\n    }\n    \n}",TIME_LIMIT_EXCEEDED,20,2040
1590967234447605760,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-11 15:18:42,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,m;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&m);\n        if(m==0)\n            printf(\""0\\n\"");\n        else\n            printf(\""6\"");\n    }\n    return 0;\n}",WRONG_ANSWER,11,324
1590967235357749248,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-11 15:18:42,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int X,Y,Z,H;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    0<=X,Y,Z<=100;\n    H=X+Y-Z;\n    printf(\""%d\"",&H);\n    return 0;\n}",WRONG_ANSWER,3,332
1590967275958636544,d830b0bcae7881ad6d1b2e2b14f3ffa3695b6d3bd622856493fa1cf903c9bf4e,2022-11-11 15:18:51,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\nimport java.lang.Math;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc= new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint count=1;\n\t\tfor(int i=1;i<n;i+=2) {\n\t\t\tboolean flag = true;\n\t\t\tfor(int j =2;j<Math.sqrt(i)+1;j++) {\n\t\t\t\tif(i%j==0) {\n\t\t\t\t\tflag = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(flag) {\n\t\t\t\tcount=count+1;\n\t\t\t}\n\t\t}\n\t\tSystem.out.print(count);\n\t}\n}\n,WRONG_ANSWER,155,16284
1590967309756313600,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-11 15:19:00,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int n,num=0;\n    scanf(\""%d\"",&n);\n    int i,j;\n    for(i=2;i<=n;i++)\n    {\n        for(j=2;j<=i;j++)\n        {\n            if(i%j==0) break;\n        }\n        if(i==j) num+=1;\n        }\n    return 0;\n}",WRONG_ANSWER,3,180
1590967352349495296,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-11 15:19:10,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<math.h>\n#include <stdio.h>\nint main()\n{\n    int i,t,n;\n    scanf(\""%d\"",&t);\n    for(i=1;i<=t;i++)\n    {\n     scanf(\""%d\"",&n);\n     if(n==0)\n        printf(\""%d\\n\"",1);\n     else\n        printf(\""%d\\n\"",6);\n     }\n    return 0;\n}\n\n",ACCEPTED,9,480
1590967384377176064,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 15:19:17,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main(){\n    int x,y,z;\n    printf(\""请输入三个整数空格隔开：\"");\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    \n    printf(\""m=%d\"", x+y-z);\n    return 0;\n}",WRONG_ANSWER,3,348
1590967461678219264,d830b0bcae7881ad6d1b2e2b14f3ffa3695b6d3bd622856493fa1cf903c9bf4e,2022-11-11 15:19:36,Java,300.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\nimport java.lang.Math;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc= new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint count=0;\n\t\tfor(int i=1;i<n;i+=2) {\n\t\t\tboolean flag = true;\n\t\t\tfor(int j =2;j<Math.sqrt(i)+1;j++) {\n\t\t\t\tif(i%j==0) {\n\t\t\t\t\tflag = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(flag) {\n\t\t\t\tcount=count+1;\n\t\t\t}\n\t\t}\n\t\tSystem.out.print(count);\n\t}\n}\n,ACCEPTED,267,18784
1590967469576093696,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-11 15:19:38,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int n,num=0;\n    scanf(\""%d\"",&n);\n    int i,j;\n    for(i=2;i<=n;i++)\n    {\n        for(j=2;j<=i;j++)\n        {\n            if(i%j==0) break;\n        }\n        if(i==j) num+=1;\n        }\n    printf(\""%d\"",num);\n    return 0;\n}",TIME_LIMIT_EXCEEDED,1000,376
1590967492359557120,d21dc339d37b0772b2547441444d4b660b000ac3ebe190aee01769e2dd619c10,2022-11-11 15:19:43,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\na=int(input())\ndata=list(map(int,input().split()))\nfor i in range(a):\n    if 0<=data[i]<=1000000000:\n        s=int(math.pow(6,data[i]))\n        s=str(s)\n        print(s[-1],end=\""\\n\"")\n",NON_ZERO_EXIT_CODE,33,2868
1590967544318595072,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-11 15:19:55,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,x=eval(input())\ny=eval(input())\nz=eval(input())\nsum = x+y-z\nprint(sum),NON_ZERO_EXIT_CODE,16,2752
1590967547585933312,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 15:19:56,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j;\n    int a[10];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=0;j<n;j++)\n    {\n        if(j<(n-1)&&a[j]%6!=0)\n        {\n            printf(\""6\\n\"");\n        }\n        if(j=n-1&&a[j]%6!=0)\n        {\n            printf(\""6\"");\n        }\n    }\n    \n}",TIME_LIMIT_EXCEEDED,20,1368
1590967561511043072,00d0a1b2e987c17fb50850b9ec54bf6b4f8b997eb053d1a9fed6c4888fbe74ed,2022-11-11 15:20:00,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n#define n 10\n\nint main()\n{\n    int t,i,a[n];\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n        if(a[i]==0)\n        {\n            a[i]=1;\n            continue;\n        }\n        a[i]=pow(6,a[i]);\n        a[i]=a[i]%10;\n    }\n    for(i=0;i<t-1;i++)\n    {\n        printf(\""%d\"",a[i]);\n        printf(\""\\n\"");\n    }\n    printf(\""%d\"",a[t-1]);\n    return 0;\n}\n",WRONG_ANSWER,8,312
1590967573397700608,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-11 15:20:02,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    0<=X,Y,Z<=100;\n    X+Y-Z;\n    printf(\""%d\"",&X+Y-Z);\n    return 0;\n}",WRONG_ANSWER,3,352
1590967578095300608,e0156cb930d51b3d5482d43809e7b2c1f54a6b8623fccfa3202e2e53ddf1ffbf,2022-11-11 15:20:04,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\n\nint main()\n\n{\n\n    printf(\""2022\"");\n\n    return 0;\n\n}",ACCEPTED,3,332
1590967589214425088,a27ecb139a3fa065feadb903517977dc609a6d218c4e082e7ec449c78806823c,2022-11-11 15:20:06,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int t,i,x,y;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<t;i++)\n    {\n        x=pow(6,a[t]);\n        y=x%10;\n        printf(\""%d\\n\"",y);\n    }\n    return 0;\n}",WRONG_ANSWER,4,308
1590967592045555712,423e1acd0d02cf3d43f3c7805099dea4edcb39c2e0fa385e82823b5a7c0dd214,2022-11-11 15:20:07,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include<math.h>\nint main()\n{\n    int t;\n    scanf_s(\""%d\"", &t);\n    int n[3];\n    int i,a;\n    for (i = 0; i < 3; i++)\n        scanf_s(\""%d\"", &n[i]);\n    for (i = 0; i < 3;i++)\n    {\n        a = pow(6,n[i]);\n        printf(\""%d\"", a % 10);\n        printf(\""\\n\"");\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1590967626443063296,423e1acd0d02cf3d43f3c7805099dea4edcb39c2e0fa385e82823b5a7c0dd214,2022-11-11 15:20:15,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include<math.h>\nint main()\n{\n    int t;\n    scanf_s(\""%d\"", &t);\n    int n[3];\n    int i,a;\n    for (i = 0; i < 3; i++)\n        scanf_s(\""%d\"", &n[i]);\n    for (i = 0; i < 3;i++)\n    {\n        a = pow(6,n[i]);\n        printf(\""%d\"", a % 10);\n        printf(\""\\n\"");\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1590967649813704704,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-11 15:20:21,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,m;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&m);\n        if(m==0)\n            printf(\""0\"");\n        else\n            printf(\""6\"");\n        for(i=0;i<n-1,i++)\n            printf(\""\\n\"");\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1590967676497887232,46a5b5de1986c03ade4ef3715390240d3b4a1729dbb6afcb5e53fc1bee0f1a07,2022-11-11 15:20:27,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\t Scanner sc=new Scanner(System.in);\n\t\t int a=sc.nextInt(),number=0;\n\t\t for(int i=1;i<=a;i++) {\n\t\t\t boolean flag=true;\n\t\t\t for(int j=2;j<i;j++) {\n\t\t\t\t if(i%j==0) {\n\t\t\t\t\t flag=false;\n\t\t\t\t }\n\t\t\t}\n\t\t\t if(flag) {\n\t\t\t\t\tnumber+=1;\n\t\t\t }\n\t\t }\n\t\t System.out.print(number);\n\t}\t     \n}\n",TIME_LIMIT_EXCEEDED,1000,16568
1590967689957412864,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-11 15:20:30,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,m;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&m);\n        if(m==0)\n            printf(\""0\"");\n        else\n            printf(\""6\"");\n        for(i=0;i<n-1;i++)\n            printf(\""\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,3,336
1590967694839582720,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 15:20:31,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j;\n    int a[10];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=0;j<n;j++)\n    {\n        if(j<(n-1)&&a[j]%6!=0)\n        {\n            printf(\""6\\n\"");\n        }\n        if(j=n-1&&a[j]%6!=0)\n        {\n            printf(\""6\"");\n        }\n    }\n    \n}",TIME_LIMIT_EXCEEDED,20,2132
1590967695036715008,25b8e249c556de062ec0d61286db67304f907bc70204e22083d75434403578b1,2022-11-11 15:20:31,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include<math.h>\nint main()\n{\n    int flag=0;\n    int a,i,n;\n    int j=0;\n    scanf(\""%d\"",&a);\n    for(n=2;n<=a;n++)\n    {\n\t\tflag=0;\n\t\tfor(i=2;i<=sqrt(n);i++)\n\t\t{\n\t\t\tif(n%i==0)\n\t\t\t{\n\t\t\t\tflag=1;\n\t\t\t} \n\t\t}\t\t\n\t\tif(flag==0)\n\t\t    j++;\n\t}\n    printf(\""%d\"",j);\n    return 0;\n}",ACCEPTED,54,316
1590967702833922048,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 15:20:33,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>>\n\nint main()\n{\n    int t,i,n,a[100];\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<t-1;i++)\n    {\n        if(a[i]<0||a[i]>pow(10,9))\n            printf(\""输入错误\\n\"");\n        else n=pow(6,a[i]),printf(\""%d\\n\"",n%10);\n        if (i=t-2) n=pow(6,a[i]),printf(\""%d\\n\"",n%10);\n    }\n    return 0;\n}\n",WRONG_ANSWER,3,188
1590967710777913344,63a19c717d077fecd1be96314929ebf3516f35619209eacac77081bb07edebb5,2022-11-11 15:20:35,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,3,196
1590967712493408256,0da8f2df2eb12ff7cceee22b87284a0e7794d94d4125226481c0842fbed3108a,2022-11-11 15:20:36,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<math.h>\n#include <stdio.h>\nint main()\n{\n    int i,j,k,temp=0;\n    scanf(\""%d\"",&i);\n    for(j=2;j<=i;j++)\n    for(k=2;k<=j;k++)\n    if(j%k==0)\n       {\n        if(k>=j)\n         temp++;\n        else\n         break;\n       }\n    printf(\""%d\"",temp);\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,1000,272
1590967716389912576,630b8bfc88107b488e158fc7108c8faf0a195f9b9030c3faf51edac625714584,2022-11-11 15:20:36,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main(){\nint n,i,j,sum=0,max=0;\nscanf(\""%d\"",&n);\nint arr1[n],arr2[n];\nfor(i=0;i<n;i++){\n    scanf(\""%d\"",&arr1[i]);\n}\nfor(i=0;i<n;i++){\n    scanf(\""%d\"",&arr2[i]);\n}\nfor(i=0;i<n;i++){\n    arr1[i]=arr2[i]-arr1[i];\n}\nfor(j=0;j<n;j++){\nfor(i=j;i<n;i++){\n    sum=arr1[i]+sum;\nif(max<sum) max=sum;\n}\nif(j!=0) for(i=0;i<j;i++){\n    sum=arr1[i]+sum;\n    if(max<sum) max=sum;\n}\n}\nprintf(\""%d\"",max);\n}\n",WRONG_ANSWER,3,192
1590967740855291904,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-11-11 15:20:42,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"t=int(input())\nn=list(map(int,input().split(' ')))\nfor i in range(0,len(n)):\n   print(pow(36,round([i]/2,1))%10)",NON_ZERO_EXIT_CODE,16,3068
1590967751852752896,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-11 15:20:45,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,x=eval(input())\ny=eval(input())\nz=eval(input())\nsum = x+y-z\nprint(sum),NON_ZERO_EXIT_CODE,17,2880
1590967768751603712,423e1acd0d02cf3d43f3c7805099dea4edcb39c2e0fa385e82823b5a7c0dd214,2022-11-11 15:20:49,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include<math.h>\nint main()\n{\n    int t;\n    scanf(\""%d\"", &t);\n    int n[3];\n    int i,a;\n    for (i = 0; i < 3; i++)\n        scanf(\""%d\"", &n[i]);\n    for (i = 0; i < 3;i++)\n    {\n        a = pow(6,n[i]);\n        printf(\""%d\"", a % 10);\n        printf(\""\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,3,320
1590967779623219200,1e783de44f6cf9abb158b108e556a36ef99d9241fc592b40cfd6cb7d1265eb34,2022-11-11 15:20:52,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\nclass Main{  \n    public static void main(String[] args) {  \n        int x;\n        int y;\n        int z;\n        int sum;\n        int exp = (int) Math.pow(10, 9);\n        Scanner s = new Scanner(System.in);\n        sum=s.nextInt();//接收测试个数\n        int[] sum1=new int[sum];\n        if(sum>0&&sum<exp){ \n            for (int i=0;i<sum1.length;i++){\n           sum1[i]=s.nextInt();\n           if (sum1[i]>0){\n               System.out.println(6);\n           }\n           else if(sum1[i]==0){\n               System.out.println(1);\n           }\n        }\n       }\n    }\n}",WRONG_ANSWER,264,16600
1590967790180302848,a27ecb139a3fa065feadb903517977dc609a6d218c4e082e7ec449c78806823c,2022-11-11 15:20:54,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int t,i,x,y;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&a[t]);\n    }\n    for(i=0;i<t;i++)\n    {\n        x=pow(6,a[t]);\n        y=x%10;\n        printf(\""%d\\n\"",y);\n    }\n    return 0;\n}",WRONG_ANSWER,7,192
1590967817179041792,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-11-11 15:21:01,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"t=int(input())\nn=list(map(int,input().split(' ')))\nfor i in range(0,len(n)):\n   print(pow(36,round([i]/2,2))%10)",NON_ZERO_EXIT_CODE,17,2884
1590967832748298240,b31601c92a4a3080abbaad650e00bb77253224eab66b59a49b2118d017649c2c,2022-11-11 15:21:04,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b,c;\n    scanf(\""%d%d%d\"",&a&b&c)；\n    printf(\""%d\"",a+b-c)；\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590967846073597952,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 15:21:07,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>>\n\nint main()\n{\n    int t,i,n,a[100];\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<t-1;i++)\n    {\n        if(a[i]<0||a[i]>pow(10,9))\n            printf(\""输入错误\\n\"");\n        else n=pow(6,a[i]),printf(\""%d\\n\"",n%10);\n        if (i=t-2) n=pow(6,a[i+1]),printf(\""%d\\n\"",n%10);\n    }\n    return 0;\n}\n",WRONG_ANSWER,4,320
1590967887198728192,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-11-11 15:21:17,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<math.h>\n#include <stdio.h>\nint main()\n{\n    int i,t,n;\n    scanf(\""%d\"",&t);\n    for(i=1;i<=t;i++)\n    {\n     scanf(\""%d\"",&n);\n     if(n==0)\n        printf(\""1\\n\"");\n     else\n        printf(\""6\\n\"");\n     }\n    return 0;\n}\n",ACCEPTED,9,332
1590967914797248512,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 15:21:24,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#define n 100000\nint main()\n{\n    int a,i,j,t,sum=0,max=-100000;\n    scanf(\""%d\"",&a);\n    int b[n],c[n],d[n];\n    for(i=0;i<a;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(j=0;j<a;j++)\n    {\n        scanf(\""%d\"",&c[j]);\n    }\n    for(t=0;t<a;t++)\n    {\n        d[t]=c[t]-b[t];\n        sum+=d[t];\n        if(sum>max) max=sum;\n    }\n    printf(\""%d\\n\"",max);\n    return 0;\n}\n",WRONG_ANSWER,4,308
1590967967431593984,9819f13d6a58d50fa249ad037641119dadb52afb3f125db258771564f27d2ca5,2022-11-11 15:21:36,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main() {\n\tint n, a,c=1,i;\n\tscanf(\""%d\"", &n);\n\twhile (n--) {\n\t\tscanf(\""%d\"", &a);\n\t\tfor(i=0;i<a;i++){\n            c=c*6;\n        }\n       printf(\""%d\"",c%10);\n        c=1;\n        if(n>0){\n            printf(\""\\n\"");\n        }\n\t}\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,24,324
1590967991758557184,75a6755f083ffc71d77ba6ce593bd24fe8a2ce61edc4710fbde2dce128c47ab4,2022-11-11 15:21:42,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,j,m;\n\n    scanf(\""%d\"",&n);\n\n    int a[n],b[n],sum[n],max[n];\n\n    for(i=0;i<n;i++)\n    scanf(\""%d\"",&a[i]);\n\n    for(i=0;i<n;i++)\n    scanf(\""%d\"",&b[i]);\n\n\n    for(i=0;i<n;i++)\n    {\n     sum[i]=b[i]-a[i];\n     printf(\""%d \"",sum[i]);\n    }\n    printf(\""\\n\"");\n\n    for(i=0;i<n;i++)\n    {\n        int t=sum[i];\n     for(j=0;j<n-i;j++)\n     {\n        t=t+sum[j];\n     }\n        max[i]=t;\n        printf(\""%d \"",max[i]);\n    }\n    printf(\""\\n\"");\n\n    m=max[0];\n    for(i=0;i<n;i++)\n    {\n        if(max[i]>m)\n            m=max[i];\n    }\n\n\n\n    printf(\""%d\"",m);\n\n    return 0;\n\n}\n",WRONG_ANSWER,4,464
1590968014894338048,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 15:21:48,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main(){\n    int c;\n    scanf(\""%d\"",&c);\n    int a[100],b[100];\n    int d[100];\n    int zhongjian;\n    for(int i=0;i<c;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(int i=0;i<c;i++){\n        scanf(\""%d\"",&b[i]);\n    }\n    int sum=0;\n    int k=0;\n    int z;\n    for(z=0;z<c;z++){\n    for(int j=z;j<c;j++) {\n\n        sum += b[j] - a[j];\n        d[k++] = sum;}\n    }\n    int max=d[0];\n    for (int i = 1; i < c; i++) {\n        if (d[i] >max) {\n            max=d[i];\n        }\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",WRONG_ANSWER,4,324
1590968020187545600,00d0a1b2e987c17fb50850b9ec54bf6b4f8b997eb053d1a9fed6c4888fbe74ed,2022-11-11 15:21:49,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\nint n,i;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\n    for(i=0;i<n-1;i++){\n       if(a[i]==0&&i<(n-1)) printf(\""1\\n\"");\n       else printf(\""6\\n\"");\n    }\n    if(a[n-1]==0) printf(\""1\"");\n    else printf(\""6\"");\n\n}\n",ACCEPTED,9,480
1590968040324378624,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 15:21:54,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>>\n\nint main()\n{\n    int t,i,n,a[100];\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<t-1;i++)\n    {\n        if(a[i]<0||a[i]>pow(10,9))\n            printf(\""输入错误\\n\"");\n        else n=pow(6,a[i]),printf(\""%d\\n\"",n%10);\n    }\n    return 0;\n}\n",WRONG_ANSWER,4,464
1590968042153119744,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-11-11 15:21:54,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"t=int(input())\nn=list(map(int,input().split(' ')))\nfor i in range(0,len(n)):\n   print(pow(36,round(n[i]/2,2))%10)",WRONG_ANSWER,17,3016
1590968042622881792,0da8f2df2eb12ff7cceee22b87284a0e7794d94d4125226481c0842fbed3108a,2022-11-11 15:21:54,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<math.h>\n#include <stdio.h>\nint main()\n{\n    int i,j,k,temp=0;\n    scanf(\""%d\"",&i);\n    for(j=2;j<=i;j++)\n    for(k=2;k<=j;k++)\n    if(j%k==0)\n       {\n        if(k>=j)\n         temp++;\n         break;\n       }\n    printf(\""%d\"",temp);\n    return 0;\n}\n",ACCEPTED,979,324
1590968056887685120,d21dc339d37b0772b2547441444d4b660b000ac3ebe190aee01769e2dd619c10,2022-11-11 15:21:58,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\na=int(input())\ndata=list(map(int,input().split()))\nfor i in range(a):\n    if 0<=data[i]<=1000000000:\n        s=int(math.pow(6,data[i]))\n        s=str(s)\n        print(s[-1],end=\""\\n\"")\n    else:\n        break\n",WRONG_ANSWER,36,3040
1590968077590790144,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-11-11 15:22:03,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"t=int(input())\nn=list(map(int,input().split(' ')))\nfor i in range(0,len(n)):\n   print(pow(36,round(n[i]/2,1))%10)",WRONG_ANSWER,15,2788
1590968100600745984,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-11 15:22:08,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#define M 100\nint main()\n{\n    int n,a[M],b[M],c[M],i,max;\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=1;i<=n;i++)\n    scanf(\""%d\"",&b[i]);\n    for(i=1;i<=n;i++)\n    {\n    c[0]=0;\n    c[i]=b[i]-a[i]+c[i-1];\n    }\n    for(i=1;i<=n;i++)\n    if(c[i]>=c[i-1])\n    max=c[i];\n    printf(\""%d\\n\"",max);\n    return 0;\n}",WRONG_ANSWER,3,352
1590968115683463168,46a5b5de1986c03ade4ef3715390240d3b4a1729dbb6afcb5e53fc1bee0f1a07,2022-11-11 15:22:12,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\t Scanner sc=new Scanner(System.in);\n\t\t int a=sc.nextInt(),number=0;\n\t\t for(int i=2;i<=a;i++) {\n\t\t\t boolean flag=true;\n\t\t\t for(int j=2;j<i;j++) {\n\t\t\t\t if(i%j==0) {\n\t\t\t\t\t flag=false;\n                     continue;\n\t\t\t\t }\n\t\t\t}\n\t\t\t if(flag) {\n\t\t\t\t\tnumber+=1;\n\t\t\t }\n\t\t }\n\t\t System.out.print(number);\n\t}\t     \n}\n",TIME_LIMIT_EXCEEDED,1000,18408
1590968129084260352,42cfad7191c5e6c0eee156c4369182744d6c5db3bc2a5dc87f9f1be6ee4bbcfe,2022-11-11 15:22:15,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n\tint t,s=0,x=0;\n\tlong int n;\n\tscanf(\""%d\"",&t);\n\tint i,j;\n\tfor(i=0;i<t;i++){\n\t\tscanf(\""%d\"",&n);\n        s=pow(6,n);\n        if(s>10) x=s%10;\n        printf(\""%d\"",x);\n        if(i<t-1)\n        printf(\""\\n\"");   \n}\t\n    return 0;\n}",WRONG_ANSWER,3,332
1590968137418346496,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 15:22:17,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#define n 100000\nint main()\n{\n    int a,i,j,t,sum=0,max=-100000;\n    scanf(\""%d\"",&a);\n    int b[n],c[n],d[n];\n    for(i=0;i<a;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(j=0;j<a;j++)\n    {\n        scanf(\""%d\"",&c[j]);\n    }\n    for(t=0;t<a;t++)\n    {\n        d[t]=c[t]-b[t];\n        sum+=d[t];\n        if(sum>max) max=sum;\n    }\n    printf(\""%d\\n\"",max);\n    return 0;\n}\n",WRONG_ANSWER,4,192
1590968168280031232,00d0a1b2e987c17fb50850b9ec54bf6b4f8b997eb053d1a9fed6c4888fbe74ed,2022-11-11 15:22:24,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\nint n,i;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\n    for(i=0;i<n-1;i++){\n       if(a[i]==0) printf(\""1\\n\"");\n       else printf(\""6\\n\"");\n    }\n    if(a[n-1]==0) printf(\""1\"");\n    else printf(\""6\"");\n\n}\n",ACCEPTED,12,316
1590968186911109120,63a19c717d077fecd1be96314929ebf3516f35619209eacac77081bb07edebb5,2022-11-11 15:22:29,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b,c,d;\n    scanf(\""%d%d%d\"",&a,&b,&c);\n    d=a+b-c;\n    printf(\""%d\"",d);\n    return 0;\n}\n",ACCEPTED,7,332
1590968222667571200,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-11 15:22:37,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#define M 100\nint main()\n{\n    int n,a[M],b[M],c[M],i,max;\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=1;i<=n;i++)\n    scanf(\""%d \"",&b[i]);\n    for(i=1;i<=n;i++)\n    {\n    c[0]=0;\n    c[i]=b[i]-a[i]+c[i-1];\n    }\n    for(i=1;i<=n;i++)\n    if(c[i]>=c[i-1])\n    max=c[i];\n    printf(\""%d\\n\"",max);\n    return 0;\n}",WRONG_ANSWER,3,336
1590968233220444160,d830b0bcae7881ad6d1b2e2b14f3ffa3695b6d3bd622856493fa1cf903c9bf4e,2022-11-11 15:22:40,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc= new Scanner(System.in);\n\t\tint t =sc.nextInt();\n\t\tint[] arr = new int[t];\n\t\tfor(int i=0;i<arr.length;i++) {\n\t\t\tarr[i]=sc.nextInt();\n\t\t}\n\t\tfor(int i =0;i<t;i++) {\n            if(arr[i]==0){\n                System.out.print(\""1\\n\"");\n            }\n\t\t\telse {System.out.print(\""6\\n\"");}\n\t\t}\n\t\t\n\t}\n}\n",NON_ZERO_EXIT_CODE,247,17040
1590968261825597440,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-11 15:22:47,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h> \n#include <math.h>\n int main()\n {\n \tint m,n,result;\n \tscanf(\""%d\"",&m);\n \tfor(int i=0;i<m;i++)\n \t{\n\t \tscanf(\""%d\"",&n);\n\t \tresult=pow(6,n);\n\t\t printf(\""%d \"",result/1%10);\n\t}\n\t  return 0;\n }",WRONG_ANSWER,7,576
1590968287444406272,42cfad7191c5e6c0eee156c4369182744d6c5db3bc2a5dc87f9f1be6ee4bbcfe,2022-11-11 15:22:53,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n\tint t,s=0,x=0;\n\tlong int n;\n\tscanf(\""%d\"",&t);\n\tint i,j;\n\tfor(i=0;i<t;i++){\n\t\tscanf(\""%d\"",&n);\n        s=pow(6,n);\n        if(s>10) x=s%10;\n        printf(\""%d\"",x);\n        if(i<t-1)\n        printf(\""\\n\"");   \n}\t\n    return 0;\n}",WRONG_ANSWER,3,328
1590968300669042688,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-11 15:22:56,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    0<=X<=100;\n    0<=Y<=100;\n    0<=Z<=100;\n    X+Y-Z;\n    printf(\""%d\"",&X+Y-Z);\n    return 0;\n}",WRONG_ANSWER,4,308
1590968319430168576,423e1acd0d02cf3d43f3c7805099dea4edcb39c2e0fa385e82823b5a7c0dd214,2022-11-11 15:23:00,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include<math.h>\nint main()\n{\n    int t;\n    scanf(\""%d\"", &t);\n    int n[3];\n    int i,a;\n    for (i = 0; i < 3; i++)\n        scanf(\""%d\"", &n[i]);\n    for (i = 0; i < 3;i++)\n    {\n        a = pow(6,n[i]);\n        printf(\""%d\"", a % 10);\n        printf(\""\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,3,348
1590968327260909568,1e783de44f6cf9abb158b108e556a36ef99d9241fc592b40cfd6cb7d1265eb34,2022-11-11 15:23:02,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\nclass Main{  \n    public static void main(String[] args) {  \n        int x;\n        int y;\n        int z;\n        int sum;\n        int exp = (int) Math.pow(10, 9);\n        Scanner s = new Scanner(System.in);\n        sum=s.nextInt();//接收测试个数\n        int[] sum1=new int[sum];\n        if(sum>=0&&sum<=exp){ \n            for (int i=0;i<sum1.length;i++){\n           sum1[i]=s.nextInt();\n           if (sum1[i]>0){\n               System.out.println(6);\n           }\n           else if(sum1[i]==0){\n               System.out.println(1);\n           }\n        }\n       }\n    }\n}",NON_ZERO_EXIT_CODE,248,18596
1590968329605525504,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-11 15:23:03,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h> \n#include <math.h>\n int main()\n {\n \tint m,n,result;\n \tscanf(\""%d\"",&m);\n \tfor(int i=0;i<m;i++)\n \t{\n\t \tscanf(\""%d\"",&n);\n\t \tresult=pow(6,n);\n\t\t printf(\""%d\\n\"",result/1%10);\n\t}\n\t  return 0;\n }",WRONG_ANSWER,9,344
1590968336463237120,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-11 15:23:04,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#define M 100\nint main()\n{\n    int n,a[M],b[M],c[M],i,max;\n    scanf(\""%d \"",&n);\n    for(i=1;i<=n;i++)\n    scanf(\"" %d \"",&a[i]);\n    for(i=1;i<=n;i++)\n    scanf(\"" %d \"",&b[i]);\n    for(i=1;i<=n;i++)\n    {\n    c[0]=0;\n    c[i]=b[i]-a[i]+c[i-1];\n    }\n    for(i=1;i<=n;i++)\n    if(c[i]>=c[i-1])\n    max=c[i];\n    printf(\""%d\\n\"",max);\n    return 0;\n}",WRONG_ANSWER,3,192
1590968404880699392,902d8082eea06043d392298983db4630cde4418ac8ee42282d537bfaae045c2f,2022-11-11 15:23:21,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"count=int(input())\nlist=input().split(\"" \"")\nfor i in range(count-1):\n  print(6)\nprint(6,end=\""\"")",WRONG_ANSWER,51,2764
1590968426988896256,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-11 15:23:26,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int X,Y,Z,H;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    0<=X<=100;\n    0<=Y<=100;\n    0<=Z<=100;\n    H=X+Y-Z;\n    printf(\""%d\"",&H);\n    return 0;\n}",WRONG_ANSWER,3,324
1590968429627113472,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 15:23:27,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>>\n\nint main()\n{\n    int t,i,n,a[100];\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<t-1;i++)\n    {\n        if(a[i]<0||a[i]>pow(10,9))\n            printf(\""输入错误\\n\"");\n        else n=pow(6,a[i]),printf(\""%d\\n\"",n%10);\n    }\n    return 0;\n}\n",WRONG_ANSWER,4,476
1590968450175008768,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-11 15:23:31,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int X,Y,Z,H;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    0<=X<=100;\n    0<=Y<=100;\n    0<=Z<=100;\n    H=X+Y-Z;\n    printf(\""%d\"",&H);\n    return 0;\n}",WRONG_ANSWER,3,348
1590968450762190849,4d1157ac6ad50cfc6ca5d6b3e1c2dd7f1ecc593df10ff6888d4207a4f1c03a35,2022-11-11 15:23:32,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int n,a;\n    cin>>n;\n    for(int i=1;i<=n;i++)\n    {\n        cin>>a;\n        printf(\""%d\"",(int)pow(6,a)%10);\n        if(i!=n)printf(\""\\n\"");\n    } \n    return 0;\n}",WRONG_ANSWER,8,488
1590968463164747776,beefe7893dd2cd421da3fb1ba3ffd90e3dc51d5301380baebfdfa12fbe5234f5,2022-11-11 15:23:35,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,print('2022'),ACCEPTED,17,2760
1590968464368513024,2a1cee132cc8344d51461f6cbf473fb80705d6fd5972f9a5d0fcfea0760fd8b1,2022-11-11 15:23:35,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n\tint n,x,s = 0;\n\tcin>>n;\n\tfor(int i = 1; i <= n; i++)\n\t{\n\t\tcin>>x;\n\t\tif(x==0)\n\t\tcout<<\""1\""<<endl;\n\t\telse\n\t\tcout<<\""6\""<<endl;\n\t}\n\n\n\treturn 0;\n}\n",ACCEPTED,14,520
1590968526695895040,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-11 15:23:50,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h> \n#include <math.h>\n int main()\n {\n \tint m,n,result;\n \tscanf(\""%d\"",&m);\n \tfor(int i=0;i<m;i++)\n \t{\n\t \tscanf(\""%d\"",&n);\n\t \tresult=(int)pow(6,n);\n\t\t printf(\""%d\\n\"",result/1%10);\n\t}\n\t  return 0;\n }",WRONG_ANSWER,6,344
1590968585055436800,eee658ba43cf6fba46676f4d9f167223fd9b57ec54a5d813fd1d01afc3088139,2022-11-11 15:24:04,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int t,n,i=1,m,x;\n    x=pow(10,9);\n    scanf (\""%d\\n\"",&t);\n    while(i<=t)\n    {\n      scanf (\""%d\\n\"",&n);\n      if(0<=n<=x)\n      {\n        m=pow(6,n);\n        m=m/1%10;\n      }\n        printf (\""%d\\n\"",m);\n        i++;\n    }\n    return 0;\n}\n\n",WRONG_ANSWER,7,568
1590968597671907328,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 15:24:07,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>>\n\nint main()\n{\n    int t,i,n,a[100];\n    scanf(\""%d\\n\"",&t);\n    for(i=0;i<t;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<t-1;i++)\n    {\n        if(a[i]<0||a[i]>pow(10,9))\n            printf(\""输入错误\\n\"");\n        else n=pow(6,a[i]),printf(\""%d\\n\"",n%10);\n    }\n    return 0;\n}\n",WRONG_ANSWER,3,196
1590968636330807296,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-11-11 15:24:16,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"t=int(input())\nn=list(map(int,input().split(' ')))\nfor i in range(0,len(n)):\n   print(pow(36,n[i]/2)%10)",WRONG_ANSWER,17,2752
1590968720804089856,4d1157ac6ad50cfc6ca5d6b3e1c2dd7f1ecc593df10ff6888d4207a4f1c03a35,2022-11-11 15:24:36,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    double n,a;\n    cin>>n;\n    for(int i=1;i<=n;i++)\n    {\n        cin>>a;\n        printf(\""%d\"",(int)pow(6,a)%10);\n        if(i!=n)printf(\""\\n\"");\n    } \n    return 0;\n}",WRONG_ANSWER,11,436
1590968872042299392,b31601c92a4a3080abbaad650e00bb77253224eab66b59a49b2118d017649c2c,2022-11-11 15:25:12,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b,c,d;\n    scanf(\""%d%d%d\"",&a,&b,&c);\n    d= a+b-c;\n    printf(\""%d\"",d);\n    return 0;\n}\n",WRONG_ANSWER,3,344
1590968873032155136,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 15:25:12,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"",&n);\n    int arr1[1000] = {0};\n    int arr2[1000] = {0};\n    for(int i = 0; i < n; ++i)\n    {\n        scanf(\""%d\"",&arr1[i]);\n    }\n    for(int j = 0; j < n; ++j)\n    {\n        scanf(\""%d\"",&arr2[j]);\n    }\n    int max1 = 0, max2 = 0, min = 0, count = 0, k = 0;\n    for(k = 0; k < n; ++k)\n    {\n        int sum = arr2[k] - arr1[k];\n        if(sum <= 0)\n        {\n            min += sum;\n            count++;\n            if(max1 < max2)\n            {\n                max1 = max2; \n            }\n            max2 = 0;\n        }\n        else\n        {\n            max2 += sum;\n        }\n    }\n    if(count == n)\n    {\n        printf(\""%d\"",min);\n    }\n    else\n    {\n        int max = max1 > max2 ? max1 : max2;\n        printf(\""%d\"",max); \n    }\n    return 0;\n}",WRONG_ANSWER,3,180
1590968875334807552,617f184ce583e9f7a346564ab5659fda0ca35a3a714a0c929cb07f915f4f514b,2022-11-11 15:25:13,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <bits/dc++.h>\nusing namespace std;\n\nint main()\n{\n\tint n,x,s = 0;\n\tcin>>n;\n\tfor(int i = 1; i <= n; i++)\n\t{\n\t\tcin>>x;\n\t\tif(x==0)\n\t\tcout<<\""1\""<<endl;\n\t\telse\n\t\tcout<<\""6\""<<endl;\n\t}\n\n\n\treturn 0;\n}",COMPILE_ERROR,0,0
1590968900731342848,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 15:25:19,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc=new Scanner(System.in);\n        int n=sc.nextInt();\n        int sum=1;\n        for(int i=2;i<=n;i++){\n            for (int j=2;j<=i/2+1;j++){\n                if(i%j==0){\n                    break;\n                }else if(j==i/2+1){\n                    sum++;\n                }\n            }\n        }\n        System.out.println(sum);\n    }\n},TIME_LIMIT_EXCEEDED,1000,16412
1590968983807918080,617f184ce583e9f7a346564ab5659fda0ca35a3a714a0c929cb07f915f4f514b,2022-11-11 15:25:39,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n\tint n,x,s = 0;\n\tcin>>n;\n\tfor(int i = 1; i <= n; i++)\n\t{\n\t\tcin>>x;\n\t\tif(x==0)\n\t\tcout<<\""1\""<<endl;\n\t\telse\n\t\tcout<<\""6\""<<endl;\n\t}\n\treturn 0;\n}",ACCEPTED,11,604
1590968991525437440,667c2e97e82c372f60661d46943ff56a17c9350387f4364ebabe70ac2e232862,2022-11-11 15:25:41,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n\tint n,x,s = 0;\n\tcin>>n;\n\tfor(int i = 1; i <= n; i++)\n\t{\n\t\tcin>>x;\n\t\tif(x==0)\n\t\tcout<<\""1\""<<endl;\n\t\telse\n\t\tcout<<\""6\""<<endl;\n\t}\n\n\n\treturn 0;\n}",ACCEPTED,12,448
1590969004909465600,46a5b5de1986c03ade4ef3715390240d3b4a1729dbb6afcb5e53fc1bee0f1a07,2022-11-11 15:25:44,Java,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\npublic static void main(String[] args) {\n\t\t Scanner sc=new Scanner(System.in);\n\t\t int a=sc.nextInt(),number=0;\n\t\t for(int i=2;i<=a;i++) {\n\t\t\t boolean flag=true;\n\t\t\t for(int j=2;j<=Math.sqrt(i);j++) {\n\t\t\t\t if(i%j==0) {\n\t\t\t\t\t flag=false;\n\t\t\t\t\t continue;\n\t\t\t\t }\n\t\t\t}\n\t\t\t if(flag) {\n\t\t\t\t\tnumber+=1;\n\t\t\t }\n\t\t }\n\t\t System.out.print(number);\n\t}\t     \n}\n",ACCEPTED,380,19204
1590969005026906112,00d0a1b2e987c17fb50850b9ec54bf6b4f8b997eb053d1a9fed6c4888fbe74ed,2022-11-11 15:25:44,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int i,j,n,a[10],b[10],max=0,x;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n        for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n        a[i]=a[i]-b[i];\n    }\n    for(i=0;i<n;i++)\n    {\n        x=0;\n        for(j=0;j<i;j++)\n            x=x+a[j];\n        if(x>max)\n            max=x;\n    }\n    printf(\""%d\"",max);\n    printf(\""\\n\"");\n    return 0;\n}\n",RUNTIME_ERROR,5,448
1590969023406342144,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 15:25:48,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"",&n);\n    int arr1[1000] = {0};\n    int arr2[1000] = {0};\n    for(int i = 0; i < n; ++i)\n    {\n        scanf(\""%d\"",&arr1[i]);\n    }\n    for(int j = 0; j < n; ++j)\n    {\n        scanf(\""%d\"",&arr2[j]);\n    }\n    int max1 = 0, max2 = 0, min = 0, count = 0, k = 0;\n    for(k = 0; k < n; ++k)\n    {\n        int sum = arr2[k] - arr1[k];\n        if(sum < 0)\n        {\n            min += sum;\n            count++;\n            if(max1 < max2)\n            {\n                max1 = max2; \n            }\n            max2 = 0;\n        }\n        else\n        {\n            max2 += sum;\n        }\n    }\n    if(count == n)\n    {\n        printf(\""%d\"",min);\n    }\n    else\n    {\n        int max = max1 > max2 ? max1 : max2;\n        printf(\""%d\"",max); \n    }\n    return 0;\n}",WRONG_ANSWER,4,392
1590969040573632512,46a5b5de1986c03ade4ef3715390240d3b4a1729dbb6afcb5e53fc1bee0f1a07,2022-11-11 15:25:52,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n   public static void main(String[] args) {\n\t\t Scanner sc=new Scanner(System.in);\n\t     int x=sc.nextInt();\n\t     int a[]=new int[20],b=0,z=0;\n\t     for(int i=0;i<x;i++) {\n\t    \t a[i]=sc.nextInt();\n\t     }\n\t     for(int c=1;c<=x;c++) {\n\t    \t for(int j=1;j<=a[z];j++) {\n\t    \t\t b=6*6;\n\t    \t\t z++;\n\t    \t }\n\t    \t if(b>10&&b<100) {\n\t    \t\t System.out.println(b%10);\n\t    \t }else if(b>100&&b<1000) {\n\t    \t\t System.out.println(b%100);\n\t    \t }\n\t     }\n\t     sc.close();\n\t}\n}\n",NON_ZERO_EXIT_CODE,242,16560
1590969043639644160,7d46013a6da090b69b62e7be93e7628aee2f7eef31af37777b9ccf1fd1d3eb2e,2022-11-11 15:25:53,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main (){\n    int i,k=6,n,m;\n      scanf(\""%d\"",&n);\n      for(i=1;i<n;i++){\n        k*=6;\n       }\n      printf(\""%d\"",k%10);\n    return 0;\n}\n",WRONG_ANSWER,3,488
1590969226121248768,42cfad7191c5e6c0eee156c4369182744d6c5db3bc2a5dc87f9f1be6ee4bbcfe,2022-11-11 15:26:36,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n\tint t,s=0,x=0;\n\tint n;\n\tscanf(\""%d\"",&t);\n\tint i,j;\n\tfor(i=0;i<t;i++){\n\t\tscanf(\""%d\"",&n);\n        s=pow(6,n);\n        if(s>10) x=s%10;\n        printf(\""%d\"",x);\n        if(i<t-1)\n        printf(\""\\n\"");   \n}\t\n    return 0;\n}",WRONG_ANSWER,8,468
1590969226905563136,8f29029dc8006da83949d2656cc7dc83026d851252066fd4a9fc89071673ec96,2022-11-11 15:26:37,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint n, i, t = 0;\n\tint arr[50]={0};\n\tint brr[50]={0};\n\tscanf(\""%d\"", &n);\n\tfor (i = 0; i < n; i++)\n\t{\n\t\tscanf(\""%d\"", &arr[i]);\n\t}\n\tfor (i = 0; i < n; i++)\n\t{\n\t\tscanf(\""%d\"", &brr[i]);\n\t}\n\tfor (i = 0; brr[i]-arr[i]>0; i++)\n\t{\n\t\tt += brr[i] - arr[i];\n\t}\n\tprintf(\""%d\"", t);\n}",WRONG_ANSWER,4,184
1590969237710110720,7d46013a6da090b69b62e7be93e7628aee2f7eef31af37777b9ccf1fd1d3eb2e,2022-11-11 15:26:39,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main (){\n    int i,k=6,n,m;\n      scanf(\""%d\"",&n);\n      for(i=1;i<n;i++){\n        k*=6;\n       }\n      printf(\""%d\"",k%10);\n    return 0;\n}\n\n",WRONG_ANSWER,3,340
1590969241547902976,b31601c92a4a3080abbaad650e00bb77253224eab66b59a49b2118d017649c2c,2022-11-11 15:26:40,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b,c,d;\n    scanf(\""%d%d%d\"",&a,&b,&c);\n    printf(\""%d\"",a+b-c);\n    return 0;\n}\n",WRONG_ANSWER,3,192
1590969314608480256,b31601c92a4a3080abbaad650e00bb77253224eab66b59a49b2118d017649c2c,2022-11-11 15:26:58,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b,c,d;\n    scanf(\""%d%d%d\"",&a,&b,&c);\n    printf(\""%d\"",a+b-c);\n    return 0;\n}\n",ACCEPTED,6,376
1590969348372631552,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 15:27:06,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"",&n);\n    int arr1[10] = {0};\n    int arr2[10] = {0};\n    for(int i = 0; i < n; ++i)\n    {\n        scanf(\""%d\"",&arr1[i]);\n    }\n    for(int j = 0; j < n; ++j)\n    {\n        scanf(\""%d\"",&arr2[j]);\n    }\n    int max1 = 0, max2 = 0, min = 0, count = 0, k = 0;\n    for(k = 0; k < n; ++k)\n    {\n        int sum = arr2[k] - arr1[k];\n        if(sum <= 0)\n        {\n            min += sum;\n            count++;\n            if(max1 < max2)\n            {\n                max1 = max2; \n            }\n            max2 = 0;\n        }\n        else\n        {\n            max2 += sum;\n        }\n    }\n    if(count == n)\n    {\n        printf(\""%d\"",min);\n    }\n    else\n    {\n        int max = max1 > max2 ? max1 : max2;\n        printf(\""%d\"",max); \n    }\n    return 0;\n}",RUNTIME_ERROR,3,452
1590969358388629504,b31601c92a4a3080abbaad650e00bb77253224eab66b59a49b2118d017649c2c,2022-11-11 15:27:08,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b,c,d;\n    scanf(\""%d%d%d\"",&a,&b,&c);\n    printf(\""%d\"",a+b-c);\n    return 0;\n}\n",ACCEPTED,7,344
1590969358912913408,acfcf65f14b5d3b02c3225372654b4e21f04d33a8bbaeb346e4fb1d85f2ea94f,2022-11-11 15:27:08,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n  int t,n,i,r;\n  scanf(\""%d\"",&t);\n  for(i=0;i<t;i++)\n  {\n    scanf(\""%d\"",&n);\n    r=pow(6,n);\n      if(i<2)\n    printf(\""%d\\n\"",r%10);  \n      else\n    printf(\""%d\"",r%10);      \n  }\n   return 0;\n}\n",WRONG_ANSWER,7,360
1590969375023239168,345826d11b41befc23adeb536e81da8eb6ec9a8bfb9448acf91422deedb8ba4a,2022-11-11 15:27:12,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,i,max=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n],s[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n     for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n        {\n            s[i]=0;\n            c[i]=0;\n        }\n        if(b[0]-a[0]>0)\n            {\n                c[0]=b[0]-a[0];\n                s[0]=c[0];\n            }\n\n     for(i=1;i<n;i++)\n        {\n            if(b[i]-a[i]>0)\n            {\n                c[i]=b[i]-a[i];\n                s[i]=s[i-1]+c[i];\n            }\n\n        }\n\n       max=s[0];\n    for(i=0;i<n-1;i++)\n    {\n        if(max>=s[i+1])\n           ;\n        else\n            max=s[i+1];\n    }\n   printf(\""%d\"",max);\n}\n",WRONG_ANSWER,3,188
1590969402911166464,acfcf65f14b5d3b02c3225372654b4e21f04d33a8bbaeb346e4fb1d85f2ea94f,2022-11-11 15:27:19,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n  int t,n,i,r;\n  scanf(\""%d\"",&t);\n  for(i=0;i<t;i++)\n  {\n    scanf(\""%d\"",&n);\n    r=pow(6,n);\n      if(i<2)\n    printf(\""%d\\n\"",r%10);  \n      else\n    printf(\""%d\"",r%10);      \n  }\n   return 0;\n}\n",WRONG_ANSWER,7,808
1590969425178726400,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 15:27:24,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"",&n);\n    int arr1[100] = {0};\n    int arr2[100] = {0};\n    for(int i = 0; i < n; ++i)\n    {\n        scanf(\""%d\"",&arr1[i]);\n    }\n    for(int j = 0; j < n; ++j)\n    {\n        scanf(\""%d\"",&arr2[j]);\n    }\n    int max1 = 0, max2 = 0, min = 0, count = 0, k = 0;\n    for(k = 0; k < n; ++k)\n    {\n        int sum = arr2[k] - arr1[k];\n        if(sum <= 0)\n        {\n            min += sum;\n            count++;\n            if(max1 < max2)\n            {\n                max1 = max2; \n            }\n            max2 = 0;\n        }\n        else\n        {\n            max2 += sum;\n        }\n    }\n    if(count == n)\n    {\n        printf(\""%d\"",min);\n    }\n    else\n    {\n        int max = max1 > max2 ? max1 : max2;\n        printf(\""%d\"",max); \n    }\n    return 0;\n}",WRONG_ANSWER,5,308
1590969551800565761,beefe7893dd2cd421da3fb1ba3ffd90e3dc51d5301380baebfdfa12fbe5234f5,2022-11-11 15:27:54,Python,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"x, y, z = map(int, input().split())\nsum = x + y - z\nprint(sum)\n",ACCEPTED,30,2756
1590969568011530240,acfcf65f14b5d3b02c3225372654b4e21f04d33a8bbaeb346e4fb1d85f2ea94f,2022-11-11 15:27:58,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n  int t,n,i,r;\n  scanf(\""%d\"",&t);\n  for(i=0;i<t;i++)\n  {\n    scanf(\""%d\"",&n);\n    r=pow(6,n);\n      if(i<2)\n    printf(\""%d\\n\"",r%10);  \n      else\n    printf(\""%d\"",r%10);      \n  }\n   return 0;\n}\n",WRONG_ANSWER,8,336
1590969577838784512,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-11 15:28:00,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,m;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&m);\n        if(m==0)\n            printf(\""0\"");\n        else\n            printf(\""6\"");\n        if(i<n-1)\n            printf(\""\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,14,316
1590969643265732608,46a5b5de1986c03ade4ef3715390240d3b4a1729dbb6afcb5e53fc1bee0f1a07,2022-11-11 15:28:16,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n   public static void main(String[] args) {\n\t\t Scanner sc=new Scanner(System.in);\n\t     int x=sc.nextInt();\n\t     int a[]=new int[20],b=0,z=0;\n\t     for(int i=0;i<x;i++) {\n\t    \t a[i]=sc.nextInt();\n\t     }\n\t     for(int c=1;c<=x;c++) {\n\t    \t for(int j=1;j<=a[z];j++) {\n\t    \t\t b=6*6;\n\t    \t\t z++;\n\t    \t }\n\t    \t if(b>10&&b<100) {\n\t    \t\t System.out.println(b%10);\n\t    \t }else if(b>100&&b<1000) {\n\t    \t\t System.out.println(b%100);\n\t    \t }\n\t     }\n\t     sc.close();\n\t}\n}\n",NON_ZERO_EXIT_CODE,287,16336
1590969683082260480,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-11 15:28:25,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,x=eval(input())\ny=eval(input())\nz=eval(input())\nprint(x+y-z),NON_ZERO_EXIT_CODE,16,2884
1590969714657001472,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-11 15:28:33,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,m;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&m);\n        if(m==0)\n            printf(\""0\"");\n        else\n            printf(\""6\"");\n        if(i<n-1)\n            printf(\""\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,13,352
1590969723506982912,46a5b5de1986c03ade4ef3715390240d3b4a1729dbb6afcb5e53fc1bee0f1a07,2022-11-11 15:28:35,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n   public static void main(String[] args) {\n\t\t Scanner sc=new Scanner(System.in);\n\t     int x=sc.nextInt();\n\t     int a[]=new int[20],b=0,z=0;\n\t     for(int i=0;i<x;i++) {\n\t    \t a[i]=sc.nextInt();\n\t     }\n\t     for(int c=1;c<=x;c++) {\n\t    \t for(int j=1;j<=a[z];j++) {\n\t    \t\t b=6*6;\n\t    \t\t z++;\n\t    \t }\n\t    \t if(b>10&&b<100) {\n\t    \t\t System.out.println(b%10);\n\t    \t }else if(b>100&&b<1000) {\n\t    \t\t System.out.println(b%100);\n\t    \t }\n\t     }\n\t     sc.close();\n       return 0;\n\t}\n}\n",COMPILE_ERROR,0,0
1590969723976744960,a5291eb67188c2a916aa5dd9fc38f2e449aa9f9a3cd047f282d8c154ea2979cd,2022-11-11 15:28:35,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,#include <iostream>\n\nusing namespace std;\nconst int N = 1e6 + 10;\nint Wi[N];\nint Wj[N];\nint arr[N];\nint main()\n{\n    int n;\n    cin >> n;\n    for(int i = 1;i <= n;i++)\n    {\n        cin >> Wi[i];\n    }\n    for(int i = 1;i <= n;i++)\n    {\n        cin >> Wj[i];\n    }\n    \n    \n    for(int i = 1;i <= n;i++)\n    {\n        arr[i] = Wj[i] - Wi[i];\n    }\n    int max = 0;\n    for(int i = 1;i <= n;i++)\n    {\n        int j = i;\n        int sum = 0;\n        while(arr[j] >= 0 && j <= n)\n        {\n            sum += arr[j];\n            j++;\n        }\n        if(sum > max)\n        {\n            max = sum;\n        }\n    }\n    \n    cout << max << endl;\n    return 0;\n},WRONG_ANSWER,4,324
1590969853677207552,63a19c717d077fecd1be96314929ebf3516f35619209eacac77081bb07edebb5,2022-11-11 15:29:06,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n   int i,n,j=0;\n   int a[100];\n   scanf(\""%d\"",&n);\n   for(i=0;i<n;i++)\n    scanf(\""%d\"",&a[i]);\n   while(n>=1){\n        if(a[j]==0){\n            printf(\""0\\n\"");\n        }\n        else{\n            printf(\""6\\n\"");\n        }\n    j++;\n    n--;\n   }\n}\n",WRONG_ANSWER,11,340
1590969881271537664,46a5b5de1986c03ade4ef3715390240d3b4a1729dbb6afcb5e53fc1bee0f1a07,2022-11-11 15:29:13,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n   public static void main(String[] args) {\n\t\t Scanner sc=new Scanner(System.in);\n\t     int x=sc.nextInt();\n\t     int a[]=new int[20],b=0,z=0;\n\t     for(int i=0;i<x;i++) {\n\t    \t a[i]=sc.nextInt();\n\t     }\n\t     for(int c=1;c<=x;c++) {\n\t    \t for(int j=1;j<=a[z];j++) {\n\t    \t\t b=6*6;\n\t    \t\t z++;\n\t    \t }\n\t    \t if(b>10&&b<100) {\n\t    \t\t System.out.println(b%10);\n\t    \t }else if(b>100&&b<1000) {\n\t    \t\t System.out.println(b%100);\n\t    \t }\n\t     }\n\t     sc.close();\n       return;\n\t}\n}\n",NON_ZERO_EXIT_CODE,251,20028
1590969883427385344,33bf53cc1ac96b08f54401ab68b14c30e1f5caef149cc9332585b7c5f09675ed,2022-11-11 15:29:13,C++,0.0,1590528927448293376,1590525945717575680,1049226928954454016,#include<iostream>\nusing namespace;\nint main()\n{\n    cout << 2022;\n    return 0;\n},COMPILE_ERROR,0,0
1590969892713594880,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-11-11 15:29:15,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"t=int(input())\nn=list(map(int,input().split(' ')))\nfor i in range(0,len(n)):\n   print(int(pow(36,n[i]/2)%10))",NON_ZERO_EXIT_CODE,35,2908
1590969922975502336,33bf53cc1ac96b08f54401ab68b14c30e1f5caef149cc9332585b7c5f09675ed,2022-11-11 15:29:23,C++,0.0,1590528927448293376,1590525945717575680,1049226928954454016,#include<iostream>\nusing namespace;\nint main()\n{\n    cout << 2022;\n    return 0;\n},COMPILE_ERROR,0,0
1590969925265588224,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-11-11 15:29:23,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main(\n    {\n        int t,i,m,n;\n        scanf(\""%d\"",&t);\n        for(i=1;i<=t;i++)\n        {\n            scanf(\""%d\"",&m);\n            m=pow(6,t);\n            n=m%10;\n        }\n        printf(\""%d\"",n);\n        return 0;\n    }",COMPILE_ERROR,0,0
1590969950167150592,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-11 15:29:29,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"intsums(int a,int b,int c) //用户自定义函数sums\nint sum;\nsum=a+b+C;\nreturn sum; W\nvoid main(\nXy,z,t;\nint\nint sums(int a,int b,int c);\nprintf(\""please input:x,y,z: \"");\nscanf(\""%d,%d,%d\"",&x,&y,&z);\nt=sums(×,y,z)；\nprintf(\""三个的数和为：%d\\n\""，t)；\n",COMPILE_ERROR,0,0
1590969987936878592,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-11 15:29:38,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h> \n#include <math.h>\n int main()\n {\n \tint m,n;\n    double result\n \tscanf(\""%d\"",&m);\n \tfor(int i=0;i<m;i++)\n \t{\n\t \tscanf(\""%d\"",&n);\n\t \tresult=(int)pow(6,n);\n\t\t printf(\""%d\"",result/1%10);\n        printf(\""\\n\"");\n\t}\n\t  return 0;\n }",COMPILE_ERROR,0,0
1590970009877286912,1e783de44f6cf9abb158b108e556a36ef99d9241fc592b40cfd6cb7d1265eb34,2022-11-11 15:29:43,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\nclass Main{  \n    public static void main(String[] args) {  \n           int x;\n        int sum;\n        Scanner s = new Scanner(System.in);\n        sum=s.nextInt();//接收测试个数\n       for (int i=0;i<sum;i++){\n           x=s.nextInt();\n           System.out.println(x==0?1:6);\n       }\n    }\n},NON_ZERO_EXIT_CODE,266,16452
1590970014939807744,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-11 15:29:45,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h> \n#include <math.h>\n int main()\n {\n \tint m,n;\n    double result\n \tscanf(\""%d\"",&m);\n \tfor(int i=0;i<m;i++)\n \t{\n\t \tscanf(\""%d\"",&n);\n\t \tresult=(int)pow(6,n);\n\t\t printf(\""%ld\"",result/1%10);\n        printf(\""\\n\"");\n\t}\n\t  return 0;\n }",COMPILE_ERROR,0,0
1590970043494633472,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-11-11 15:29:51,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"t=int(input())\nn=list(map(int,input().split(' ')))\nfor i in range(0,len(n)):\n   print(int(pow(36,n[i]/2)%10))",NON_ZERO_EXIT_CODE,36,2816
1590970048813006848,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-11 15:29:53,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h> \n#include <math.h>\n int main()\n {\n \tint m,n;\n    double result;\n \tscanf(\""%d\"",&m);\n \tfor(int i=0;i<m;i++)\n \t{\n\t \tscanf(\""%d\"",&n);\n\t \tresult=(int)pow(6,n);\n\t\t printf(\""%d\"",result/1%10);\n        printf(\""\\n\"");\n\t}\n\t  return 0;\n }",COMPILE_ERROR,0,0
1590970067372781568,64b76cc355daf11e96a19b338c58e56c05289d7e3809e9695a09e71771618713,2022-11-11 15:29:57,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n   int n,i,j,k;\n   k=0;\n   scanf(\""%d\"",&n);\n   for(i=2;i<=n;i++)\n    for(j=2;j<=i;j++)\n    if(i%j==0)\n   {\n       if(j>=i)\n        k++;\n        else\n            break;\n   }\n\n   printf(\""%d\\n\"",k);\n\nreturn 0;\n   }\n",TIME_LIMIT_EXCEEDED,1000,380
1590970089262878720,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 15:30:02,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stio.h>\n\nint sh(int m)\n{\n    int k;\n    int i;\n    k=sqrt(m);\n    for(i=2;i<=k;i++)\n        if(m%i==0)\n            if(i>=k+1)\n                printf(\""%4d\"",m);\n}\nmain()\n{\n    int m,n;\n    scanf(\""%d\\n\"",&n);\n    for(m=n/2;m<=n;m++)\n        sh(m);\n}\n",COMPILE_ERROR,0,0
1590970089392898048,55950e2d4c314feed0856fa0f6b80f22c5c36f2ebe0d75c8ee2cadb1a06b2fe1,2022-11-11 15:30:02,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main(){\n\n    int a,b[100],c[100],i;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++){\n        scanf(\""%d\"",&b[i]);\n        c[i]=pow(6,b[i]);\n        c[i]=c[i]%10;\n        if(c[i]==0)\n            printf(\""1\"");\n\n    }\n    for(i=0;i<a-1;i++){\n\n        printf(\""%d\\n\"",c[i]);\n    }\n    for(i=a-1;i<a;i++){\n        printf(\""%d\"",c[i]);\n        \n    }\n    \n\n\n    return 0;\n}\n",WRONG_ANSWER,6,472
1590970093297795072,33bf53cc1ac96b08f54401ab68b14c30e1f5caef149cc9332585b7c5f09675ed,2022-11-11 15:30:03,C++,300.0,1590528927448293376,1590525945717575680,1049226928954454016,#include<iostream>\nusing namespace std;\nint main()\n{\n    cout << 2022;\n    return 0;\n},ACCEPTED,3,324
1590970110154702848,33bf53cc1ac96b08f54401ab68b14c30e1f5caef149cc9332585b7c5f09675ed,2022-11-11 15:30:07,C++,300.0,1590528927448293376,1590525945717575680,1049226928954454016,#include<iostream>\nusing namespace std;\nint main()\n{\n    cout << 2022;\n    return 0;\n},ACCEPTED,4,444
1590970112448991232,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-11 15:30:08,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h> \n#include <math.h>\n int main()\n {\n \tint m,n;\n    double result;\n \tscanf(\""%d\"",&m);\n \tfor(int i=0;i<m;i++)\n \t{\n\t \tscanf(\""%d\"",&n);\n\t \tresult=(int)pow(6,n);\n\t\t printf(\""%ld\"",result/1%10);\n        printf(\""\\n\"");\n\t}\n\t  return 0;\n }",COMPILE_ERROR,0,0
1590970125153533952,55950e2d4c314feed0856fa0f6b80f22c5c36f2ebe0d75c8ee2cadb1a06b2fe1,2022-11-11 15:30:11,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h> \n#include<math.h>\nint main(){\nint n;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(int i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n    \n    for(int i=0;i<n-1;i++){\n       if(a[i]==0&&i<(n-1)) printf(\""1\\n\"");\n       else printf(\""6\\n\"");\n    }\n    if(a[n-1]==0) printf(\""1\"");\n    else printf(\""6\"");\n\t\n}",ACCEPTED,13,324
1590970141440016384,1e783de44f6cf9abb158b108e556a36ef99d9241fc592b40cfd6cb7d1265eb34,2022-11-11 15:30:15,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\nclass Main{  \n    public static void main(String[] args) {  \n           int x;\n        int sum;\n        Scanner s = new Scanner(System.in);\n        sum=s.nextInt();//接收测试个数\n       for (int i=0;i<sum;i++){\n           x=s.nextInt();\n           System.out.println(x==0?\""1\"":\""6\"");\n       }\n    }\n}",NON_ZERO_EXIT_CODE,257,18792
1590970168677806080,4d1157ac6ad50cfc6ca5d6b3e1c2dd7f1ecc593df10ff6888d4207a4f1c03a35,2022-11-11 15:30:21,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int n,a;\n    cin>>n;\n    for(int i=1;i<=n;i++)\n    {\n        cin>>a;\n        long int  m=6;\n        for(int j=0;j<a;j++)\n        {\n            m=m*6;\n        }\n        m=m%10;\n        printf(\""6\"");\n        if(i!=n)printf(\""\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,12,452
1590970192723771392,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-11-11 15:30:27,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"t=int(input())\nn=list(map(int,input().split(' ')))\nfor i in range(0,len(n)):\n   print(int(pow(6,n[i])%10))",TIME_LIMIT_EXCEEDED,167,3964
1590970242606632960,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-11-11 15:30:39,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"t=int(input())\nn=list(map(int,input().split(' ')))\nfor i in range(0,len(n)):\n   print(int(pow(36,n[i]/2)%10))",NON_ZERO_EXIT_CODE,31,2752
1590970269689253888,00d0a1b2e987c17fb50850b9ec54bf6b4f8b997eb053d1a9fed6c4888fbe74ed,2022-11-11 15:30:45,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int i,j,n,a[10],b[10],maxx=0,x;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n        for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n        a[i]=a[i]-b[i];\n    }\n    for(i=0;i<n;i++)\n    {\n        x=0;\n        for(j=0;j<i;j++)\n            x=x+a[j];\n        if(x>max)\n            maxx=x;\n    }\n    printf(\""%d\"",maxx);\n    printf(\""\\n\"");\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590970295593271296,00d0a1b2e987c17fb50850b9ec54bf6b4f8b997eb053d1a9fed6c4888fbe74ed,2022-11-11 15:30:51,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int i,j,n,a[10],b[10],maxx=0,x;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n        for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n        a[i]=a[i]-b[i];\n    }\n    for(i=0;i<n;i++)\n    {\n        x=0;\n        for(j=0;j<i;j++)\n            x=x+a[j];\n        if(x>maxx)\n            maxx=x;\n    }\n    printf(\""%d\"",maxx);\n    printf(\""\\n\"");\n    return 0;\n}\n",RUNTIME_ERROR,4,396
1590970321837010944,64b76cc355daf11e96a19b338c58e56c05289d7e3809e9695a09e71771618713,2022-11-11 15:30:58,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n   int n,i,j,k;\n    k=0;\n   scanf(\""%d\"",&n);\n   for(i=2;i<=n;i++)\n    for(j=2;j<=i;j++)\n    if(i%j==0)\n   {\n       if(j>=i)\n        k++;\n            break;\n   }\n\n   printf(\""%d\\n\"",k);\n\nreturn 0;\n   }\n",ACCEPTED,962,280
1590970325888733184,e28183ed8305104fec7a0449068dcce46faea90b0874c3cff3d8963b1befe1bb,2022-11-11 15:30:59,Python,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"n = int(input())\nxh = list(map(eval,input().split()))\nhd = list(map(eval,input().split()))\ndata=[]\nmax=0\nfor i in range(n):\n    s = hd[i]-xh[i]\n    data.append(s)\nfor i in range(n):\n    t=0\n    for j in range(i,n,1):\n        t =t+ data[j]\n        if t>max:\n            max = t\nprint(max)",ACCEPTED,15,2884
1590970331152584704,acfcf65f14b5d3b02c3225372654b4e21f04d33a8bbaeb346e4fb1d85f2ea94f,2022-11-11 15:31:00,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n  int t,n,i,r;\n  scanf(\""%d\"",&t);\n  for(i=0;i<t;i++)\n  {\n    scanf(\""%d\"",&n);\n    r=pow(6,n);\n      if(i<2)\n    printf(\""%d\\n\"",r%10);  \n      else\n    printf(\""%d\"",r%10);      \n  }\n   return 0;\n}\n",WRONG_ANSWER,7,456
1590970353952821248,4d1157ac6ad50cfc6ca5d6b3e1c2dd7f1ecc593df10ff6888d4207a4f1c03a35,2022-11-11 15:31:05,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    long int n,a;\n    cin>>n;\n    for(int i=1;i<=n;i++)\n    {\n        cin>>a;\n        long int  m=6;\n        for(int j=0;j<a;j++)\n        {\n            m=m*6;\n        }\n        m=m%10;\n        printf(\""%d\"",m);\n        if(i!=n)printf(\""\\n\"");\n    }\n    return 0;\n}",TIME_LIMIT_EXCEEDED,25,616
1590970372940435456,63a19c717d077fecd1be96314929ebf3516f35619209eacac77081bb07edebb5,2022-11-11 15:31:10,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n   int i,n,j=0;\n   int a[100];\n   scanf(\""%d\"",&n);\n   for(i=0;i<n;i++)\n    scanf(\""%d\"",&a[i]);\n   while(n>=1){\n        if(a[j]==0){\n            printf(\""0\\n\"");\n        }\n        else{\n            if(n==1){\n            printf(\""6\"");\n            }\n            else{\n            printf(\""6\\n\"");\n            }\n        }\n    j++;\n    n--;\n   }\n}\n",WRONG_ANSWER,10,340
1590970391345041408,d21dc339d37b0772b2547441444d4b660b000ac3ebe190aee01769e2dd619c10,2022-11-11 15:31:14,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\na=int(input())\ndata=list(map(int,input().split()))\nfor i in range(a):\n    if 0<=data[i]<=1000000000:\n        s=int(math.pow(6,data[i]))\n        s=str(s)\n        if i==a-1:\n            print(s[-1],end=\""\\n\"")\n        else:\n            print(s[-1])\n    else:\n        break\n",WRONG_ANSWER,32,3012
1590970411905515520,a5291eb67188c2a916aa5dd9fc38f2e449aa9f9a3cd047f282d8c154ea2979cd,2022-11-11 15:31:19,C++,300.0,1590734963702620160,1590734503495200768,1049226928954454016,#include <iostream>\n\nusing namespace std;\nconst int N = 1e6 + 10;\nint Wi[N];\nint Wj[N];\nint arr[N];\nint main()\n{\n    int n;\n    cin >> n;\n    for(int i = 1;i <= n;i++)\n    {\n        cin >> Wi[i];\n    }\n    for(int i = 1;i <= n;i++)\n    {\n        cin >> Wj[i];\n    }\n    \n    \n    for(int i = 1;i <= n;i++)\n    {\n        arr[i] = Wj[i] - Wi[i];\n    }\n    int max = 0;\n    for(int i = 1;i <= n;i++)\n    {\n        if(arr[i] >= 0)\n        {\n            int j = i;\n            int sum = 0;\n            while(j <= n)\n            {\n                sum += arr[j];\n                j++;\n                if(sum > max)\n                {\n                    max = sum;\n                }\n            }\n        }\n    }\n    \n    cout << max << endl;\n    return 0;\n},ACCEPTED,3,456
1590970438224773120,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 15:31:25,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"",&n);\n    int arr1[100] = {0};\n    int arr2[100] = {0};\n    int i = 0, j = 0;\n    while(n--)\n    {\n        scanf(\""%d\"",&arr1[i]);\n        i++;\n    }\n    while(n--)\n    {\n        scanf(\""%d\"",&arr2[j]);\n        j++;\n    }\n    int max1 = 0, max2 = 0, min = 0, count = 0, k = 0;\n    for(k = 0; k < n; ++k)\n    {\n        int sum = arr2[k] - arr1[k];\n        if(sum <= 0)\n        {\n            min += sum;\n            count++;\n            if(max1 < max2)\n            {\n                max1 = max2; \n            }\n            max2 = 0;\n        }\n        else\n        {\n            max2 += sum;\n        }\n    }\n    if(count == n)\n    {\n        printf(\""%d\"",min);\n    }\n    else\n    {\n        int max = max1 > max2 ? max1 : max2;\n        printf(\""%d\"",max); \n    }\n    return 0;\n}",TIME_LIMIT_EXCEEDED,400,340
1590970442528108544,4d1157ac6ad50cfc6ca5d6b3e1c2dd7f1ecc593df10ff6888d4207a4f1c03a35,2022-11-11 15:31:26,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    long int n,a;\n    cin>>n;\n    for(int i=1;i<=n;i++)\n    {\n        cin>>a;\n        long int  m=6;\n        for(int j=0;j<a;j++)\n        {\n            m=m*6;\n        }\n        m=m%10;\n        printf(\""6\"");\n        if(i!=n)printf(\""\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,13,468
1590970459674443776,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 15:31:31,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stio.h>\n\nint sh(int m)\n{\n    int k;\n    int i;\n    k=sqrt(m);\n    for(i=2;i<=k;i++)\n        if(m%i==0)\n            if(i>=k+1)\n                printf(\""%4d\"",m);\n}\nmain()\n{\n    int m,n;\n    scanf(\""%d\\n\"",&n);\n    for(m=n/2;m<=n;m++)\n        sh(m);\n}\n",COMPILE_ERROR,0,0
1590970530159722496,4812f9582f90b7f3f95178a62ec39f3555e90b935658da3e31a47fe0d2e8c6fd,2022-11-11 15:31:47,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"\n#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n long long int t,j,u=0;\n int isprime(int n);\n printf(\""请输入一个数：\"");\n scanf(\""%d\"",&t);\n for(j=1;j<=t;j++)\n {\n  if (isprime(j)==1) u++;\n }\n printf(\""从1到%d总共有%d个素数。\"",t,u);\n return 0;\n}\n\nint isprime(int n)\n{\n int i;\n if(n==2) return 1;\n else if(n==1||n%2==0) return 0;\n for (i=3;i<=sqrt(n)+1;i+=2)\n {\n  if(n%i==0) return 0;\n }\n return 1;\n}\n",TIME_LIMIT_EXCEEDED,1000,396
1590970589442015232,00d0a1b2e987c17fb50850b9ec54bf6b4f8b997eb053d1a9fed6c4888fbe74ed,2022-11-11 15:32:01,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int i,j,n,a[100],b[100],max=0,x;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n        for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n        a[i]=a[i]-b[i];\n    }\n    for(i=0;i<n;i++)\n    {\n        x=0;\n        for(j=0;j<i;j++)\n            x=x+a[j];\n        if(x>max)\n            maxx=x;\n    }\n    printf(\""%d\"",max);\n    printf(\""\\n\"");\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590970666940149760,bce383372e0b1b627f0a9b838121096ec3ca14c0f213828fca1bf517a82c8744,2022-11-11 15:32:20,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,n,t,y;\n    scanf(\""%d\\n\"",&t);\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&n);\n        if(n==0)\n            y=1;\n        else\n            y=6;\n            printf(\""%d\\n\"",y);\n    }\n}\n",ACCEPTED,11,352
1590970669217681408,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 15:32:21,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n\nint sh(int m)\n{\n    int k;\n    int i;\n    k=sqrt(m);\n    for(i=2;i<=k;i++)\n        if(m%i==0)\n            if(i>=k+1)\n                printf(\""%4d\"",m);\n}\nmain()\n{\n    int m,n;\n    scanf(\""%d\\n\"",&n);\n    for(m=n/2;m<=n;m++)\n        sh(m);\n}\n",WRONG_ANSWER,3,188
1590970670081683456,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-11 15:32:21,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint sums(int a,int b,int c) //用户自定义函数sums\n{\n    int sum;\n    sum=a+b-c;\n    return sum;\n}    \nvoid main()\n{\n    int x,y,z,t;\n    int sums(int a,int b,int c);\nprintf(\""please input:x,y,z: \"");\nscanf(\""%d,%d,%d\"",&x,&y,&z);\nt=sums(x,y,z)；\nprintf(\""三个的数和为：%d\\n\""，t)；\n    }",COMPILE_ERROR,0,0
1590970673458122752,00d0a1b2e987c17fb50850b9ec54bf6b4f8b997eb053d1a9fed6c4888fbe74ed,2022-11-11 15:32:22,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int i,j,n,a[100],b[100],max=0,x;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n        for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n        a[i]=a[i]-b[i];\n    }\n    for(i=0;i<n;i++)\n    {\n        x=0;\n        for(j=0;j<i;j++)\n            x=x+a[j];\n        if(x>max)\n            max=x;\n    }\n    printf(\""%d\"",max);\n    printf(\""\\n\"");\n    return 0;\n}\n",WRONG_ANSWER,3,192
1590970732690079744,bce383372e0b1b627f0a9b838121096ec3ca14c0f213828fca1bf517a82c8744,2022-11-11 15:32:36,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int i,j,n,num=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<n;i++)\n    {\n        for(j=2;j<=sqrt(i);j++) \n        {\n            if(i%j==0)\n            break;\n        }\n            if(j>sqrt(i))\n            num++;\n    }\n    printf(\""%d\"",num);\n}\n",ACCEPTED,12,312
1590970756484370432,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-11 15:32:41,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,m;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&m);\n        if(m==0)\n            printf(\""1\"");\n        else\n            printf(\""6\"");\n        if(i<n-1)\n            printf(\""\\n\"");\n    }\n    return 0;\n}",ACCEPTED,12,344
1590970775270658048,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-11-11 15:32:46,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"t=int(input())\nn=list(map(int,input().split(' ')))\nfor i in range(0,len(n)):\n   print(int(pow(36,n[i]*0.5)%10))",NON_ZERO_EXIT_CODE,31,2760
1590970851657297920,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 15:33:04,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"",&n);\n    int arr1[100] = {0};\n    int arr2[100] = {0};\n    int i = 0, j = 0;\n    for(i = 0; i < n; ++i)\n    {\n        scanf(\""%d\"",&arr1[i]);\n    }\n    for(j = 0; j < n; ++j)\n    {\n        scanf(\""%d\"",&arr2[j]);\n    }\n    int max1 = 0, max2 = 0, min = 0, count = 0, k = 0;\n    for(k = 0; k < n; ++k)\n    {\n        int sum = arr2[k] - arr1[k];\n        if(sum <= 0)\n        {\n            min += sum;\n            count++;\n            if(max1 < max2)\n            {\n                max1 = max2; \n            }\n            max2 = 0;\n        }\n        else\n        {\n            max2 += sum;\n        }\n    }\n    if(count == n)\n    {\n        printf(\""%d\"",min);\n    }\n    else\n    {\n        int max = max1 > max2 ? max1 : max2;\n        printf(\""%d\"",max); \n    }\n    return 0;\n}",WRONG_ANSWER,3,192
1590970866979115008,7d46013a6da090b69b62e7be93e7628aee2f7eef31af37777b9ccf1fd1d3eb2e,2022-11-11 15:33:08,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h> \nint main()\n{\n\tint n,i,j,k,m=0;\n\tscanf(\""%d\"",&n);\n\tfor(i=2;i<=n;i++)\n\t\t{\n\t\tk=pow(i,0.5);\n\t\tfor(j=2;j<=k;j++)\n\t\t\tif(i%j==0)\n\t\t\t\tbreak;\n\t\t           if(j>=k+1){\n\t\t\t    printf(\""%d \"",i);\n\t\t\tm++;\n\t\tif(m%5==0) printf(\""\\n\"");  \n\t\t}\n\t}\treturn 0;\n}",WRONG_ANSWER,16,324
1590970937032380416,7e6a67f270e740aba8788a12d9a49939621a28d5059d3ced2247a86914b0a3b3,2022-11-11 15:33:24,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main(){\n    int n;\n    scanf(\""%d\"",&n);\n    int wi[n],wj[n],w[n];\n    int i,max=0,sum=0;\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&wi[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&wj[i]);\n\n    for(i=0;i<n;i++)\n        w[i]=wj[i]-wi[i];\n\n    for(i=0;i<n;i++)\n    {\n        sum+=w[i];\n        if(max<sum) max=sum;\n        if(sum<0) {\n            sum=0;\n            continue;\n        }\n    }\n    printf(\""%d\"",max);\n}\n",ACCEPTED,5,464
1590970986663579648,00d0a1b2e987c17fb50850b9ec54bf6b4f8b997eb053d1a9fed6c4888fbe74ed,2022-11-11 15:33:36,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int i,j,n,a[100],b[100],max=0,x;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n        for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        x=0;\n        for(j=0;j<i;j++)\n            x=x-a[j]+b[j];\n        if(x>max)\n            max=x;\n    }\n    printf(\""%d\"",max);\n    return 0;\n}\n",WRONG_ANSWER,3,332
1590971081953972224,33bf53cc1ac96b08f54401ab68b14c30e1f5caef149cc9332585b7c5f09675ed,2022-11-11 15:33:59,C++,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main()\n{\n    int x,y,z;\n    cin >> x >> y >> z;\n    cout << \""x+y-z\"";\n    return 0;\n}",WRONG_ANSWER,3,316
1590971104649347072,bce383372e0b1b627f0a9b838121096ec3ca14c0f213828fca1bf517a82c8744,2022-11-11 15:34:04,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,n,a,b;\n    scanf(\""%d\\n\"",&a);\n    for(i=0;i<a;i++)\n    {\n        scanf(\""%d\"",&n);\n        if(n==0)\n            b=1;\n        else\n            b=6;\n            printf(\""%d\\n\"",b);\n    }\n}\n",ACCEPTED,9,360
1590971142767181824,4d1157ac6ad50cfc6ca5d6b3e1c2dd7f1ecc593df10ff6888d4207a4f1c03a35,2022-11-11 15:34:13,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    long int n,a;\n    cin>>n;\n    for(int i=1;i<=n;i++)\n    {\n        cin>>a;\n        printf(\""%d\"",(long int)pow(6,a)%10);\n        if(i!=n)printf(\""\\n\"");\n    }\n    \n    return 0;\n}",WRONG_ANSWER,8,480
1590971162270699520,345826d11b41befc23adeb536e81da8eb6ec9a8bfb9448acf91422deedb8ba4a,2022-11-11 15:34:18,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,i,max=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n],s[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n     for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n        {\n            s[i]=0;\n            c[i]=0;\n        }\n        if(b[0]-a[0]>0)\n            {\n                c[0]=b[0]-a[0];\n                s[0]=c[0];\n            }\n\n     for(i=1;i<n;i++)\n        {\n            if(b[i]-a[i]>0)\n            {\n                c[i]=b[i]-a[i];\n                s[i]=s[i-1]+c[i];\n            }\n            else\n            {\n                c[i]=0;\n                s[i]=0;\n            }\n\n        }\n\n       max=s[0];\n    for(i=0;i<n-1;i++)\n    {\n        if(max>=s[i+1])\n           ;\n        else\n            max=s[i+1];\n    }\n   printf(\""%d\"",max);\n}\n",WRONG_ANSWER,5,192
1590971165038915585,44e63106384b2202d1a15f2fb61b15315a1f0761b20f40b73c55e6122e10f27d,2022-11-11 15:34:19,Python,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"n = int(input())\nxh = list(map(eval,input().split()))\nhd = list(map(eval,input().split()))\ndata=[]\nmax=0\nfor i in range(n):\n    s = hd[i]-xh[i]\n    data.append(s)\nfor i in range(n):\n    t=0\n    for j in range(i,n,1):\n        t =t+ data[j]\n        if t>max:\n            max = t\nprint(max)",ACCEPTED,20,2828
1590971205581082624,00d0a1b2e987c17fb50850b9ec54bf6b4f8b997eb053d1a9fed6c4888fbe74ed,2022-11-11 15:34:28,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int i,j,n,a[100],b[100],max=0,x;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n        for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        x=0;\n        for(j=0;j<i;j++)\n            x=x-a[j]+b[j];\n        if(x>max)\n            max=x;\n    }\n    printf(\""%d\\n\"",max);\n    return 0;\n}\n",WRONG_ANSWER,6,384
1590971209410457600,bce383372e0b1b627f0a9b838121096ec3ca14c0f213828fca1bf517a82c8744,2022-11-11 15:34:29,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int i,j,n,f=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<n;i++)\n    {\n        for(j=2;j<=sqrt(i);j++) \n        {\n            if(i%j==0)\n            break;\n        }\n            if(j>sqrt(i))\n            f++;\n    }\n    printf(\""%d\"",f);\n}\n",ACCEPTED,17,324
1590971235293507584,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-11 15:34:35,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int X,Y,Z,H;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    0<=X<=100;\n    0<=Y<=100;\n    0<=Z<=100;\n    H=X+Y-Z;\n    printf(\""%d\"",&H);\n    return 0;\n}",WRONG_ANSWER,4,352
1590971254536998912,63a19c717d077fecd1be96314929ebf3516f35619209eacac77081bb07edebb5,2022-11-11 15:34:40,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n   int i,n,j=0;\n   int a[100];\n   scanf(\""%d\"",&n);\n   for(i=0;i<n;i++)\n    scanf(\""%d\"",&a[i]);\n   while(n>=1){\n        if(a[j]==0)\n        {\n            if(n==1){\n             printf(\""0\"");\n            }\n            else{\n             printf(\""0\\n\"");\n            }\n        }\n        else{\n            if(n==1){\n            printf(\""6\"");\n            }\n            else{\n            printf(\""6\\n\"");\n            }\n        }\n    j++;\n    n--;\n   }\n}\n",WRONG_ANSWER,10,352
1590971255233228800,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-11 15:34:40,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main() {\n\tint a, b,c;\n\tscanf_s(\""%d\"", &a);\n\tfor (int i = 1; i <= a; i++)\n\t{\n\t\tif (i < a)\n\t\t{\n\t\t\tscanf_s(\""%d\"", &b);\n\t\t\tc = (int)pow(6, b) % 10;\n\t\t\tprintf(\""%d\\n\"", c);\n\t\t}\n\t\telse {\n\t\t\tscanf_s(\""%d\"", &b);\n\t\t\tc = (int)pow(6, b) % 10;\n\t\t\tprintf(\""%d\"", c);\n\t\t}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1590971255937871872,33bf53cc1ac96b08f54401ab68b14c30e1f5caef149cc9332585b7c5f09675ed,2022-11-11 15:34:40,C++,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main()\n{\n    int x,y,z,result;\n    cin >> x >> y >> z;\n    result = x + y - z;\n    cout << result;\n    return 0;\n}",ACCEPTED,7,500
1590971302846992384,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-11 15:34:52,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int X,Y,Z,H;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    0<=X<=100;\n    0<=Y<=100;\n    0<=Z<=100;\n    H=X+Y-Z;\n    printf(\""%d\"",&H);\n    return 0;\n}",WRONG_ANSWER,4,332
1590971325814996992,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-11 15:34:57,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main() {\n\tint a, b,c;\n\tscanf_s(\""%d\"", &a);\n\tfor (int i = 1; i <= a; i++)\n\t{\n\t\tif (i < a)\n\t\t{\n\t\t\tscanf(\""%d\"", &b);\n\t\t\tc = (int)pow(6, b) % 10;\n\t\t\tprintf(\""%d\\n\"", c);\n\t\t}\n\t\telse {\n\t\t\tscanf_s(\""%d\"", &b);\n\t\t\tc = (int)pow(6, b) % 10;\n\t\t\tprintf(\""%d\"", c);\n\t\t}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1590971419427672064,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-11 15:35:19,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main() {\n\tint a, b,c;\n\tscanf_s(\""%d\"", &a);\n\tfor (int i = 1; i <= a; i++)\n\t{\n\t\tif (i < a)\n\t\t{\n\t\t\tscanf(\""%d\"", &b);\n\t\t\tc = (int)pow(6, b) % 10;\n\t\t\tprintf(\""%d\\n\"", c);\n\t\t}\n\t\telse {\n\t\t\tscanf(\""%d\"", &b);\n\t\t\tc = (int)pow(6, b) % 10;\n\t\t\tprintf(\""%d\"", c);\n\t\t}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1590971420564303872,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-11 15:35:20,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h> \n#include <math.h>\n int main()\n {\n \tint m,n;\n    int result;\n \tscanf(\""%d\"",&m);\n \tfor(int i=0;i<m;i++)\n \t{\n\t \tscanf(\""%d\"",&n);\n\t \tresult=(int)pow(6,n);\n\t\t printf(\""%d\"",result/1%10);\n        printf(\""\\n\"");\n\t}\n\t  return 0;\n }",WRONG_ANSWER,7,356
1590971462402510848,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-11 15:35:30,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main() {\n\tint a, b,c;\n\tscanf(\""%d\"", &a);\n\tfor (int i = 1; i <= a; i++)\n\t{\n\t\tif (i < a)\n\t\t{\n\t\t\tscanf(\""%d\"", &b);\n\t\t\tc = (int)pow(6, b) % 10;\n\t\t\tprintf(\""%d\\n\"", c);\n\t\t}\n\t\telse {\n\t\t\tscanf(\""%d\"", &b);\n\t\t\tc = (int)pow(6, b) % 10;\n\t\t\tprintf(\""%d\"", c);\n\t\t}\n\t}\n\treturn 0;\n}",WRONG_ANSWER,6,360
1590971464596107264,63a19c717d077fecd1be96314929ebf3516f35619209eacac77081bb07edebb5,2022-11-11 15:35:30,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n   int i,n,j=0;\n   int a[100];\n   scanf(\""%d\"",&n);\n   for(i=0;i<n;i++)\n    scanf(\""%d\"",&a[i]);\n   while(n>=1){\n        if(a[j]==0)\n        {\n            if(n==1){\n             printf(\""1\"");\n            }\n            else{\n             printf(\""1\\n\"");\n            }\n        }\n        else{\n            if(n==1){\n            printf(\""6\"");\n            }\n            else{\n            printf(\""6\\n\"");\n            }\n        }\n    j++;\n    n--;\n   }\n}\n",ACCEPTED,10,344
1590971584108630016,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 15:35:59,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main(){\n    int c;\n    scanf(\""%d\"",&c);\n    int a[100],b[100];\n    int d[100];\n    int zhongjian;\n    for(int i=0;i<c;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(int i=0;i<c;i++){\n        scanf(\""%d\"",&b[i]);\n    }\n    int sum=0;\n    int k=0;\n    int z;\n    int tatal[100];\n    for(z=0;z<c;z++){\n    for(int j=z;j<c;j++) {\n\n        sum += b[j] - a[j];\n        d[k++] = sum;\n    }\n    tatal[z]=d[0];\n        for (int i = 1; i < c; i++) {\n            if (d[i] >tatal[z]) {\n                tatal[z]=d[i];\n            }\n        }\n    }\n    int max=tatal[0];\n    for(int i=1;i<c;i++){\n        if(tatal[i]>max){\n            max=tatal[i];\n        }\n    }\n\n    printf(\""%d\"",max);\n    return 0;\n}",WRONG_ANSWER,3,460
1590971590072905728,630b8bfc88107b488e158fc7108c8faf0a195f9b9030c3faf51edac625714584,2022-11-11 15:36:00,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main(){\nint n,i,j,sum=0,max=0;\nscanf(\""%d\"",&n);\nint arr1[n],arr2[n];\nfor(i=0;i<n;i++){\n    scanf(\""%d\"",&arr1[i]);\n}\nfor(i=0;i<n;i++){\n    scanf(\""%d\"",&arr2[i]);\n}\nfor(i=0;i<n;i++){\n    arr1[i]=arr2[i]-arr1[i];\n}\nfor(j=0;j<n;j++){\nfor(i=j;i<n;i++){\n    sum=arr1[i]+sum;\nif(max<sum) max=sum;\n}\nif(j!=0) for(i=0;i<j;i++){\n    sum=arr1[i]+sum;\n    if(max<sum) max=sum;\n}\nsum=0;\n}\nprintf(\""%d\"",max);\n}\n",ACCEPTED,3,188
1590971691080155136,4812f9582f90b7f3f95178a62ec39f3555e90b935658da3e31a47fe0d2e8c6fd,2022-11-11 15:36:24,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\npublic class Main{\n public static void main(String[] args){\n  int arr[];\n  arr=new int[10];\n  Scanner sc = new Scanner(System.in);\n  for(int i=0;i<10 ;i++){\n   arr[i] = sc.nextInt();\n  }\n      for(int i=0;i<10;i++)\n   System.out.println(arr[i]);\n  for(int i = 0;i<9;i++){\n   for(int j =0;j<10-i-1;j++){\n    if(arr[j]>arr[j+1]){\n     int a;\n     a=arr[j+1];\n     arr[j+1]=arr[j];\n     arr[j]=a;\n    }\n\n   }\n  }\n  System.out.println(arr[9]);\n  System.out.print(arr[0]);\n }\n},NON_ZERO_EXIT_CODE,125,16284
1590971729101524992,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 15:36:33,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"",&n);\n    int arr1[1000] = {0};\n    int arr2[1000] = {0};\n    for(int i = 0; i < n; ++i)\n    {\n        scanf(\""%d\"",&arr1[i]);\n    }\n    for(int j = 0; j < n; ++j)\n    {\n        scanf(\""%d\"",&arr2[j]);\n    }\n    int max1 = 0, max2 = 0, min = 0, count = 0, k = 0;\n    for(k = 0; k < n; ++k)\n    {\n        int sum = arr2[k] - arr1[k];\n        if(sum <= 0)\n        {\n            min += sum;\n            count++;\n            if(max1 < max2)\n            {\n                max1 = max2; \n            }\n            max2 = 0;\n        }\n        else\n        {\n            max2 += sum;\n        }\n    }\n    if(count == n)\n    {\n        printf(\""%d\"",min);\n    }\n    else\n    {\n        int max = max1 > max2 ? max1 : max2;\n        printf(\""%d\"",max); \n    }\n    return 0;\n}",WRONG_ANSWER,3,308
1590971737523662848,bcc80c637e0ae4837743d463049e862b206c31483ff6a67b35742ac5d66647d7,2022-11-11 15:36:35,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#incude<stdio.h>\nint main()\n{\n    printf(\""2022\"");\n}",COMPILE_ERROR,0,0
1590971790808100864,03f9d7a6fc27d141b8243d1b2b44a3276cdd4750b5c2621d6d8c006b64ca6514,2022-11-11 15:36:48,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main() \n{\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,3,328
1590971873700130816,bcc80c637e0ae4837743d463049e862b206c31483ff6a67b35742ac5d66647d7,2022-11-11 15:37:08,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""2022\"");\n}",ACCEPTED,4,324
1590971874312499200,1363fe5b260b83108efff76d53fc3ee37db1aa74f7eb5c5c7e6dacb996b49862,2022-11-11 15:37:08,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tprintf(\""2022\"");\n\treturn 0; \n}",ACCEPTED,3,356
1590971937952694272,63a19c717d077fecd1be96314929ebf3516f35619209eacac77081bb07edebb5,2022-11-11 15:37:23,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n   int i,n,j=0;\n   int a[100];\n   scanf(\""%d\"",&n);\n   for(i=0;i<n;i++)\n    scanf(\""%d\"",&a[i]);\n   while(n>=1){\n        if(a[j]==0)\n        {\n            printf(\""0\\n\"");\n\n        }\n        else{\n           printf(\""6\\n\"");\n            }\n\n    j++;\n    n--;\n   }\n   }",WRONG_ANSWER,11,200
1590971951819067392,75a6755f083ffc71d77ba6ce593bd24fe8a2ce61edc4710fbde2dce128c47ab4,2022-11-11 15:37:26,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n\n    int n;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    int sum,max=0;\n    int i,j;\n    for(i=0;i<n;i++) scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++) scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n    {\n        sum = 0;\n        for(j=i;j<n;j++)\n        {\n            sum = sum - b[j] + a[j];\n            if(sum > max) max =sum;\n        }\n    }\n    printf(\""%d\"",max);\n    return 0;\n}\n",WRONG_ANSWER,3,196
1590971952909561856,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-11 15:37:27,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main() {\n\tint a, b,c;\n\t  if(scanf(\""%d\"", &a){};\n\tfor (int i = 1; i <= a; i++)\n\t{\n\t\tif (i < a)\n\t\t{\n\t\t\tif(scanf(\""%d\"", &b)){};\n\t\t\tc = (int)pow(6, b) % 10;\n\t\t\tprintf(\""%d\\n\"", c);\n\t\t}\n\t\telse {\n\t\t\tif(scanf(\""%d\"", &b)){};\n\t\t\tc = (int)pow(6, b) % 10;\n\t\t\tprintf(\""%d\"", c);\n\t\t}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1590971994986840064,abe2744e33bb397ffb9bb13afcb202f611378fb4fc5801202f03933298ce5f5d,2022-11-11 15:37:37,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n    public static void main(String[] args) throws IOException {\n        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n        int t =Integer.valueOf(reader.readLine());\n        String[] string = reader.readLine().split(\"" \"");\n        \n\n        for (int i = 0; i < t; i++) {\n\n\n            String x=String.valueOf((int)Math.pow(6,Integer.valueOf(string[i])));\n            System.out.println(x.charAt(x.length()-1));\n        }\n    }\n}\n",WRONG_ANSWER,147,14016
1590972010891640832,63a19c717d077fecd1be96314929ebf3516f35619209eacac77081bb07edebb5,2022-11-11 15:37:40,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n   int i,n,j=0;\n   int a[100];\n   scanf(\""%d\"",&n);\n   for(i=0;i<n;i++)\n    scanf(\""%d\"",&a[i]);\n   while(n>=1){\n        if(a[j]==0)\n        {\n            printf(\""1\\n\"");\n\n        }\n        else{\n           printf(\""6\\n\"");\n            }\n\n    j++;\n    n--;\n   }\n   }",ACCEPTED,9,320
1590972063244943360,b31601c92a4a3080abbaad650e00bb77253224eab66b59a49b2118d017649c2c,2022-11-11 15:37:53,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b,c,d;\n    scanf(\""%d%d%d%d\"",&a,&b,&c,&d);\n    while(a> 0){\n        printf(\""6/n\"");\n        a=a-1\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590972154781433856,75a6755f083ffc71d77ba6ce593bd24fe8a2ce61edc4710fbde2dce128c47ab4,2022-11-11 15:38:15,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n\n    int n;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    int sum,max=0;\n    int i,j;\n    for(i=0;i<n;i++) scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++) scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n    {\n        sum = 0;\n        for(j=i;j<n;j++)\n        {\n            sum = sum - a[j] + b[j];\n            if(sum > max) max =sum;\n        }\n    }\n    printf(\""%d\"",max);\n    return 0;\n}\n",ACCEPTED,4,200
1590972175241248768,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-11 15:38:20,Python,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"list = input().split(\"" \"")\nfor i in range(3):\n    list[i]=int(list[i])\naver=(list[0]+list[1]-list[2])\nprint(aver)",ACCEPTED,31,2876
1590972207524786176,86f702b052a21d7cb2f8cd933c678c21efaafaf5b2d35032f18ec35c1e26a945,2022-11-11 15:38:27,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,j;\n    int a=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n    { for(j=2;j<=i;j++)\n       if(i%j==0)   break;\n      if(j==i)  a++;\n    }\n    printf(\""%d\"",a);\n    return 0;\n}",ACCEPTED,989,320
1590972218107035648,aa65cdf25cbe32699d085a61c4f3ec5a4020e6a3dc1e0e9d6e2a48c9288f8026,2022-11-11 15:38:30,Java,0.0,1590734963702620160,1590734503495200768,1049226928954454016,import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main{\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int num = scanner.nextInt();\n        int[] getmax = new int[num];\n        int[] arr = new int[num];\n        int[] arr1 = new int[num];\n\n        int maxnum[]=new int[num];\n        for (int i = 0; i < num; i++) {\n            arr[i] = scanner.nextInt();\n        }\n        for (int j = 0; j < num; j++) {\n            arr1[j] = scanner.nextInt();\n        }\n\n\n        for (int i = 0; i < num; i++) {\n          getmax[i]=arr1[i]-arr[i];\n        }\n\n        for (int i = 0; i < num; i++) {\n            for (int j = 0; j < i; j++) {\n                maxnum[i]+=getmax[j];\n            }\n            }\n        Arrays.sort(maxnum);\n        System.out.println(maxnum[num-1]);\n        }\n\n\n    }\n,WRONG_ANSWER,130,16696
1590972225048588288,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-11 15:38:31,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h> \n#include <math.h>\n int main()\n {\n \tint m,n;\n    int result;\n \tscanf(\""%d\"",&m);\n \tfor(int i=0;i<m;i++)\n \t{\n\t \tscanf(\""%d\"",&n);\n\t \tresult=(int)pow(6,n);\n\t\t printf(\""%d\"",result/1%10);\n        if(i!=(m-1))  printf(\""\\n\"");\n\t}\n\t  return 0;\n }",WRONG_ANSWER,8,188
1590972233814708224,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-11 15:38:34,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include(stdio.h)\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",COMPILE_ERROR,0,0
1590972385271021568,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-11 15:39:10,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include(stdio.h)\nint main()\n{\n    printf(\""2022\"");\n}",COMPILE_ERROR,0,0
1590972428099059712,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-11 15:39:20,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"\n\n    printf(\""2022\"");",COMPILE_ERROR,0,0
1590972440749060096,00d0a1b2e987c17fb50850b9ec54bf6b4f8b997eb053d1a9fed6c4888fbe74ed,2022-11-11 15:39:23,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int i,j,n,a[100],b[100],max=0,x;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n        for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n        for(i=0;i<n;i++)\n    {\n        x=0;\n        for(j=0;j<i;j++)\n            x=x-a[j]+b[j];\n        if(x>max)\n            max=x;\n    }\n    for(i=0;i<n;i++)\n    {\n        x=0;\n        for(j=i;j<n;j++)\n            x=x-a[j]+b[j];\n        if(x>max)\n            max=x;\n    }\n    printf(\""%d\\n\"",max);\n    return 0;\n}\n",WRONG_ANSWER,3,328
1590972517253165056,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-11 15:39:41,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"printf(\""2022\"");",COMPILE_ERROR,0,0
1590972600707256320,00d0a1b2e987c17fb50850b9ec54bf6b4f8b997eb053d1a9fed6c4888fbe74ed,2022-11-11 15:40:01,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int i,j,n,a[100],b[100],max=0,x;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n        for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n        for(i=0;i<n;i++)\n    {\n        x=0;\n        for(j=0;j<i;j++)\n            x=x-a[j]+b[j];\n        if(x>max)\n            max=x;\n    }\n    for(i=0;i<n;i++)\n    {\n        x=0;\n        for(j=i;j<n;j++)\n            x=x-a[j]+b[j];\n        if(x>max)\n            max=x;\n    }\n    printf(\""%d\\n\"",max);\n    return 0;\n}\n",WRONG_ANSWER,5,192
1590972607262928896,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-11 15:40:03,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main() {\n\tint a, b,c;\n\t  if(scanf(\""%d\"", &a){\n\tfor (int i = 1; i <= a; i++)\n\t{\n\t\tif (i < a)\n\t\t{\n\t\t\tif(scanf(\""%d\"", &b)){\n\t\t\tc = (int)pow(6, b) % 10;\n\t\t\tprintf(\""%d\\n\"", c);}\n\t\t}\n\t\telse {\n\t\t\tif(scanf(\""%d\"", &b)){\n\t\t\tc = (int)pow(6, b) % 10;\n\t\t\tprintf(\""%d\"", c);}\n\t\t}\n\t}}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1590972651802267648,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-11-11 15:40:13,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"t=int(input())\nn=list(map(int,input().split(' ')))\nfor i in range(0,len(n)):\n   print(int(36**(n[i]*0.5)%10))",NON_ZERO_EXIT_CODE,32,2760
1590972675034517504,bcc80c637e0ae4837743d463049e862b206c31483ff6a67b35742ac5d66647d7,2022-11-11 15:40:19,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int X,Y,Z,W;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    W=X+Y-Z;\n    printf(\""%d\"",W);\n}",ACCEPTED,7,352
1590972711193587712,bcc80c637e0ae4837743d463049e862b206c31483ff6a67b35742ac5d66647d7,2022-11-11 15:40:27,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int X,Y,Z,W;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    W=X+Y-Z;\n    printf(\""%d\"",W);\n}",ACCEPTED,6,348
1590972727207464960,00d0a1b2e987c17fb50850b9ec54bf6b4f8b997eb053d1a9fed6c4888fbe74ed,2022-11-11 15:40:31,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#define N 1000\nint main()\n{\n int n;\n int a[N],b[N];\n scanf(\""%d\"",&n);\n for(int i=0;i<n;i++) scanf(\""%d\"",&a[i]);\n for(int i=0;i<n;i++) {\n  scanf(\""%d\"",&b[i]);\n  a[i]=b[i]-a[i];\n }\n int maxx=0;\n for(int i=0;i<n;i++){\n  int sum=0,flag=0;\n  int m=0;\n  for(int j=i;j<n;j++){\n   sum+=a[j];\n   flag++;\n   if(sum>m) m=sum;\n  }\n  if(m>maxx) maxx=m;\n  if(flag<0) continue;\n }\n printf(\""%d\\n\"",maxx);\n}",ACCEPTED,3,188
1590972781469171712,03f9d7a6fc27d141b8243d1b2b44a3276cdd4750b5c2621d6d8c006b64ca6514,2022-11-11 15:40:44,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint a,b,c,sum=0;\n\tscanf(\""%d %d %d\"",&a,&b,&c);\n\tsum=a+b-c;\n\tprintf(\""%d\"",sum);\n\treturn 0;\n}",ACCEPTED,10,504
1590972797533335552,345826d11b41befc23adeb536e81da8eb6ec9a8bfb9448acf91422deedb8ba4a,2022-11-11 15:40:48,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,i,mmax=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n],s[n],max[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n     for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n        {\n            s[i]=0;\n            c[i]=0;\n            max[i]=0;\n        }\n        if(b[0]-a[0]>0)\n            {\n                c[0]=b[0]-a[0];\n                s[0]=c[0];\n                max[0]=s[0];\n            }\n\n     for(i=1;i<n;i++)\n        {\n            if(b[i]-a[i]>0)\n            {\n                c[i]=b[i]-a[i];\n                s[i]=s[i-1]+c[i];\n                max[i]=s[i];\n            }\n            else\n            {\n                s[i]=0;\n            }\n\n        }\n    mmax=max[0];\n    for(i=0;i<n-1;i++)\n    {\n        if(max[i]>=max[i+1])\n           ;\n        else\n            mmax=max[i+1];\n    }\n   printf(\""%d\"",mmax);\n}\n",WRONG_ANSWER,4,316
1590972838369079296,19b1d22e5c87afa9233c236fc7b4d5e0e70acf3872968cbe9aae96e75e9e38d1,2022-11-11 15:40:58,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"a = input()\na1 = input().split(\"" \"")\na2 = input().split(\"" \"")\nb = [int(a2[i]) - int(a1[i]) for i in range(0, len(a2))]\nprint(b)\nf = 0\nc = [f]\n\nfor i in range(b.index(max(b)), 0, -1):\n\n    f = f + b[i]\n    c.append(f)\n\nfor i in range(b.index(max(b)), len(b)):\n\n    f = f + b[i]\n    c.append(f)\n\nprint(max(c))",WRONG_ANSWER,18,3016
1590972905645715456,1363fe5b260b83108efff76d53fc3ee37db1aa74f7eb5c5c7e6dacb996b49862,2022-11-11 15:41:14,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint X,Y,Z;\n\tscanf(\""%d %d %d\"",&X,&Y,&Z);\n\tprintf(\""%d\"",X+Y-Z);\n\treturn 0; \n}",ACCEPTED,8,348
1590972940387155968,aa65cdf25cbe32699d085a61c4f3ec5a4020e6a3dc1e0e9d6e2a48c9288f8026,2022-11-11 15:41:22,Java,0.0,1590734963702620160,1590734503495200768,1049226928954454016,import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main{\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int num = scanner.nextInt();\n        int[] getmax = new int[num];\n        int[] arr = new int[num];\n        int[] arr1 = new int[num];\n\n        int maxnum[]=new int[num];\n        for (int i = 0; i < num; i++) {\n            arr[i] = scanner.nextInt();\n        }\n        for (int j = 0; j < num; j++) {\n            arr1[j] = scanner.nextInt();\n        }\n\n\n        for (int i = 0; i < num; i++) {\n          getmax[i]=arr1[i]-arr[i];\n        }\n\n        for (int i = 0; i < num; i++) {\n            for (int j = 0; j < i; j++) {\n                maxnum[i]+=getmax[j];\n            }\n            }\n        Arrays.sort(maxnum);\n        System.out.println(maxnum[num-1]);\n        }\n\n\n    }\n,WRONG_ANSWER,133,16592
1590972943503523840,977c9d350f87cd8386fa1f88cca886d6ff43821830806e60da6d6b36dc77cd13,2022-11-11 15:41:23,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int i,j,n;\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++)\n    {\n        scanf(\""%d\"",&j);\n        printf(\""%d\"",(int)pow(6,j)%10);\n        printf(\""\\n\"");\n    }\n}",WRONG_ANSWER,7,352
1590972975619289088,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-11-11 15:41:30,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"t=int(input())\nn=list(map(int,input().split(' ')))\nfor i in range(0,len(n)):\n   print(pow(6,n[i])%10)",TIME_LIMIT_EXCEEDED,168,4132
1590973105865011200,fbea21dbaf89f1b064feaa20227f21c5e1c4888fdc371cf5e43f70615906e52a,2022-11-11 15:42:01,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,print(int(2022)),ACCEPTED,16,2760
1590973137951457280,b31601c92a4a3080abbaad650e00bb77253224eab66b59a49b2118d017649c2c,2022-11-11 15:42:09,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b,c,d,i;\n    scanf(\""%d%d%d%d\"",&a,&b,&c,&d);\n    for(i=a;i>0;a=a-1)\n    {\n        printf(\""6/n\"");\n        a=a-1\n    }\n    return 0;\n}\n\n",COMPILE_ERROR,0,0
1590973138303758336,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-11 15:42:09,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,2022,COMPILE_ERROR,0,0
1590973194322903040,24daa7a58808ceb95b2ed2e23721ea7b987a061e19ca5fee0ee2d0f93c78507f,2022-11-11 15:42:23,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main()\n{\n    printf(\""2022\"");\n        retuen 0;\n}\n",COMPILE_ERROR,0,0
1590973211163013120,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-11-11 15:42:27,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"t=int(input())\nn=list(map(int,input().split(' ')))\nfor i in range(0,len(n)):\n   j=n[i]/2\n   print(int(pow(36,j)%10))",NON_ZERO_EXIT_CODE,35,2880
1590973216389115904,75a6755f083ffc71d77ba6ce593bd24fe8a2ce61edc4710fbde2dce128c47ab4,2022-11-11 15:42:28,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,j,k=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n    {\n        for(j=2;j<=i;j++)\n        {\n         if(i%j==0)\n             break;\n         if(i%j!=0)\n         k++\n        }\n\n    }\n    printf(\""%d\"",k);\n\n}\n",COMPILE_ERROR,0,0
1590973236744093696,24daa7a58808ceb95b2ed2e23721ea7b987a061e19ca5fee0ee2d0f93c78507f,2022-11-11 15:42:33,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main()\n{\n    printf(\""2022\"");\n        retuen 0;\n}\n",COMPILE_ERROR,0,0
1590973262354513920,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-11 15:42:39,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include(stdio.h)\nprintf(\""2022\"");\n    ",COMPILE_ERROR,0,0
1590973279404339200,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-11 15:42:43,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int i,j,n;\n    int sum=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i+=2)\n        for(j=2;j<=sqrt(i);j++)\n        {\n            if(i%j==0)\n            {\n                break;\n            }\n            if(j>sqrt(i))\n                sum++;\n        }\n    return 0;\n}",WRONG_ANSWER,4,180
1590973289659412480,19b1d22e5c87afa9233c236fc7b4d5e0e70acf3872968cbe9aae96e75e9e38d1,2022-11-11 15:42:45,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"a = input()\na1 = input().split(\"" \"")\na2 = input().split(\"" \"")\nb = [int(a2[i]) - int(a1[i]) for i in range(0, len(a2))]\n\nf = 0\nc = [f]\n\nfor i in range(b.index(max(b)), 0, -1):\n\n    f = f + b[i]\n    c.append(f)\n\nfor i in range(b.index(max(b)), len(b)):\n\n    f = f + b[i]\n    c.append(f)\n\nprint(max(c))",WRONG_ANSWER,15,2884
1590973307384565760,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-11 15:42:49,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include(stdio.h)\nprintf(\""2022\"");\n    return 0;",COMPILE_ERROR,0,0
1590973310580600832,24daa7a58808ceb95b2ed2e23721ea7b987a061e19ca5fee0ee2d0f93c78507f,2022-11-11 15:42:50,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main()\n{\n    printf(\""2022\"");\n        return 0;\n}\n",ACCEPTED,3,184
1590973391404863488,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-11 15:43:10,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include(stdio.h)\nint main()\n{\nprintf(\""2022\"");\n    return 0;\n}",COMPILE_ERROR,0,0
1590973424044933120,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-11 15:43:17,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int i,j,n;\n    int sum=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n        for(j=2;j<=sqrt(i);j++)\n        {\n            if(i%j==0)\n            {\n                break;\n            }\n            if(j>sqrt(i))\n                sum++;\n        }\n    return 0;\n}",WRONG_ANSWER,11,184
1590973438536253440,fa305ee4bf4c6a54add4e945b551f1e902b95c1a179a91ded55bf7ebb1c87c23,2022-11-11 15:43:21,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{  int a[50],b[50],i,j,x,s[50]={0},sum[50]={0};\n  int max=sum[0];\n    scanf(\""%d\"",&x);\n    for(j=0;j<x;j++){\n            scanf(\""%d\"",&a[j]);\n        }\n    for(j=0;j<x;j++){\n            scanf(\""%d\"",&b[j]);\n        }\n       for(i=0;i<x;i++){\n        s[i]=b[i]-a[i];\n       }\n      sum[0]=s[0];\n    for(i=1;i<x;i++){\n        sum[i]=sum[i-1]+s[i];\n    }\n    for(i=1;i<x;i++)\n    {  if(sum[i]>max)\n         max=sum[i];\n\n    }\n  printf(\""%d\\n\"",max);\n    return 0;\n}\n",WRONG_ANSWER,4,464
1590973446320885760,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 15:43:23,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#define n 100000\nint main()\n{\n    int a,oi,j,t,sum=0,max=-100000;\n    scanf(\""%d\"",&a);\n    int b[n],c[n],d[n];\n    for(i=0;i<a;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(j=0;j<a;j++)\n    {\n        scanf(\""%d\"",&c[j]);\n    }\n    for(t=0;t<a;t++)\n    {\n        d[t]=c[t]-b[t];\n        sum+=d[t];\n        if(d[t]>sum) sum=d[t];\n        if(sum>max) max=sum;\n    }\n    printf(\""%d\\n\"",max);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590973472241680384,acfcf65f14b5d3b02c3225372654b4e21f04d33a8bbaeb346e4fb1d85f2ea94f,2022-11-11 15:43:29,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n  int t,n,i,r;\n  scanf(\""%d\"",&t);\n  for(i=0;i<t;i++)\n  {\n    scanf(\""%d\"",&n);\n    r=pow(6,n);\n      if(i<t+1)\n    printf(\""%d\\n\"",r%10);  \n      else\n    printf(\""%d\"",r%10);      \n  }\n   return 0;\n}\n",WRONG_ANSWER,6,384
1590973494282727424,8f3db3a68f06e8185fabd1d433ac3a2e89466bdd83f9a46499ad0b516cb8fb4c,2022-11-11 15:43:34,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#define n 100000\nint main()\n{\n    int a,i,j,t,sum=0,max=-100000;\n    scanf(\""%d\"",&a);\n    int b[n],c[n],d[n];\n    for(i=0;i<a;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(j=0;j<a;j++)\n    {\n        scanf(\""%d\"",&c[j]);\n    }\n    for(t=0;t<a;t++)\n    {\n        d[t]=c[t]-b[t];\n        sum+=d[t];\n        if(d[t]>sum) sum=d[t];\n        if(sum>max) max=sum;\n    }\n    printf(\""%d\\n\"",max);\n    return 0;\n}\n",ACCEPTED,4,468
1590973500389658624,40c43472973ea298adbdd1d4b900aeb63cfa4cfe17179f01a4827cd2c6624d3a,2022-11-11 15:43:36,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int a,b,t=0,sum=0;\n    int n;\n    int i,j,k;\n    int x=0,s=0;\n    scanf(\""%d\"",&n);\n    for(k=1;k<=n;k++)\n    {\n        scanf(\""%d\"",&b);\n    }\n        for(i=1;i<=n;i++)\n       {\n         scanf(\""%d\"",&a);\n         t=0;\n         t=t-a;\n         x=x+t;\n            if(i%5==0)\n                break;\n       }\n       for(j=1;j<=n;j++)\n         {\n          scanf(\""%d\"",&b);\n          t=0;\n          t=t+b;\n          s=s+t;\n             if(j%5==0)\n                break;\n         }\n\n    sum=-(x+s);\n    printf(\""%d\"",sum);\n}\n",WRONG_ANSWER,4,184
1590973509562601472,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-11 15:43:38,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h> \n#include <math.h>\n int main()\n {\n \tint m,n;\n    int result;\n \tscanf(\""%d\"",&m);\n \tfor(int i=0;i<m;i++)\n \t{\n\t \tscanf(\""%d\"",&n);\n\t \tresult=(int)pow(6,n);\n\t\tif(n==1) printf(\""1\"");\n        else printf(\""%d\"",result/1%10);\n        if(i!=(m-1))  printf(\""\\n\"");\n\t}\n\t  return 0;\n }",WRONG_ANSWER,6,380
1590973595881373696,44042a4519c9231aa21c54eb113b7a08f98bcd7db4839a20a61ab6ce51fce357,2022-11-11 15:43:58,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int n,r,p,q;\n    int i,j,k;\n    int a[n],b[n];\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++)\n        scanf(\""%d \"",&a[n])\n    for(i=1;i<=n;i++)\n        b[i]=pow(6,a[i]);\n    for(i=1;i<=n;i++)\n        printf(\""6\\n\"");\n    \n    \n    return 0;\n}",COMPILE_ERROR,0,0
1590973658615558144,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-11 15:44:13,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#define M 100\nint main()\n{\n    int n,a[M],b[M],c[M],i,max;\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=1;i<=n;i++)\n    scanf(\""%d\"",&b[i]);\n    c[0]=0;\n    for(i=1;i<=n;i++)\n    c[i]=b[i]-a[i]+c[i-1];\n    for(i=1;i<=n;i++)\n    if(c[i]>c[i-1])\n    max=c[i];\n    printf(\""%d\"",max);\n    return 0;\n}",WRONG_ANSWER,3,492
1590973666874142720,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-11 15:44:15,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include(stdio.h)\nint main()\n{\n    printf(\""%d\"",2022);\n    return 0;\n}",COMPILE_ERROR,0,0
1590973714341081088,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-11-11 15:44:27,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main()\n{\n    int t,i,m=0,n;\n        scanf(\""%d\"",&t);\n        for(i=1;i<=t;i++)\n        {\n            m+=i;\n            scanf(\""%d\"",&m);\n            m=pow(6,m);\n            n=m%10;\n            printf(\""%d\\n\"",n);\n        }\n        return 0;\n}\n",WRONG_ANSWER,11,384
1590973749640343552,acfcf65f14b5d3b02c3225372654b4e21f04d33a8bbaeb346e4fb1d85f2ea94f,2022-11-11 15:44:35,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n  int t,n,i,r;\n  scanf(\""%d\"",&t);\n  for(i=1;i<=t;i++)\n  {\n    scanf(\""%d\"",&n);\n    r=pow(6,n);\n      if(i<t)\n    printf(\""%d\\n\"",r%10);  \n      else\n    printf(\""%d\"",r%10);      \n  }\n   return 0;\n}\n",WRONG_ANSWER,7,344
1590973762932113408,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-11 15:44:38,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include(stdio.h)\n#include(math.h)\nint main()\n{\n    printf(\""%d\"",2022);\n    return 0;\n}",COMPILE_ERROR,0,0
1590973820977065984,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-11 15:44:52,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int i,j,n;\n    int sum=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n        for(j=2;j<=sqrt(i);j++)\n        {\n            if(i%j==0)\n            {\n                break;\n            }\n            if(j>sqrt(i))\n                sum++;\n        }\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,17,472
1590973865306685440,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-11 15:45:03,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include(stdio.h)\n#include(time.h)\nint main()\n{\n    printf(\""%d\"",2022);\n    return 0;\n}",COMPILE_ERROR,0,0
1590973939466178560,5d127211f3edce9d9bd1062c03cd08473e4481ec46b4b0c70c2e8d9141c68f20,2022-11-11 15:45:20,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(){\n    int n;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n];\n    int i,sum=0,sum1=0;\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n\n    for(i=0;i<n;i++)\n        c[i]=b[i]-a[i];\n\n    for(i=0;i<n;i++)\n    {\n        sum1+=c[i];\n        if(sum<sum1) sum=sum1;\n        if(sum1<0) {\n            sum1=0;\n            continue;\n        }\n    }\n    printf(\""%d\"",sum);\n}\n\n",ACCEPTED,3,192
1590973946374197248,fbea21dbaf89f1b064feaa20227f21c5e1c4888fdc371cf5e43f70615906e52a,2022-11-11 15:45:22,Python,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"X,Y,Z=map(int,(input().split()))\na=X+Y-Z\nprint(a)",ACCEPTED,33,2884
1590973984072597504,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-11-11 15:45:31,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main()\n{\n    int t,i,m,n;\n        scanf(\""%d\"",&t);\n        for(i=1;i<=t;i++)\n        {  \n            scanf(\""%d\"",&m);\n            m=pow(6,m);\n            n=m%10;\n            printf(\""%d\\n\"",n);\n        }\n        return 0;\n}\n",WRONG_ANSWER,6,308
1590974017312436224,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-11 15:45:39,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h> \n#include <math.h>\n int main()\n {\n \tint m,n;\n    int result;\n \tscanf(\""%d\"",&m);\n \tfor(int i=0;i<m;i++)\n \t{\n\t \tscanf(\""%d\"",&n);\n\t \t//result=(int)pow(6,n);\n\t\tif(n==1) printf(\""1\"");\n        else printf(\""6\"");\n        if(i!=(m-1))  printf(\""\\n\"");\n\t}\n\t  return 0;\n }",WRONG_ANSWER,9,332
1590974024098844672,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 15:45:40,Java,300.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc=new Scanner(System.in);\n        int n=sc.nextInt();\n        int sum=2;\n        for(int i=2;i<=n;i++){\n            for (int j=2;j<Math.sqrt(i);j++){\n                if(i%j==0){\n                    break;\n                }else if(j>Math.sqrt(i)/1-1){\n                    sum++;\n                }\n            }\n        }\n        System.out.println(sum);\n    }\n},ACCEPTED,299,16508
1590974041396129792,f1feb45d46abad163f730e5b023ce1df76883054d0a1741228a76c2c69aa3eda,2022-11-11 15:45:44,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main(){\n    printf(\""2022\"");\n}",ACCEPTED,3,180
1590974043333918720,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-11 15:45:45,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include(stdio.h)\n#include(time.h)\nint main()\n{\n    printf(\""%d\"",2022);\nreturn 0;\n}",COMPILE_ERROR,0,0
1590974058290806784,44042a4519c9231aa21c54eb113b7a08f98bcd7db4839a20a61ab6ce51fce357,2022-11-11 15:45:49,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int n;\n    int i,j,k;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=1;i<=n;i++)\n        scanf(\""%d \"",&a[n]);\n    for(i=1;i<=n;i++)\n        printf(\""6\\n\"");\n\n\n    return 0;\n}\n",WRONG_ANSWER,11,320
1590974064007647232,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-11 15:45:50,C++,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include(stdio.h)\n#include(time.h)\nint main()\n{\n    printf(\""%d\"",2022);\nreturn 0;\n}",COMPILE_ERROR,0,0
1590974074795397120,4812f9582f90b7f3f95178a62ec39f3555e90b935658da3e31a47fe0d2e8c6fd,2022-11-11 15:45:52,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"public class Sushu {\n    public static void main(String[] args) {\n        int count = 0；\n        for (int i = 1; i <= 999; i++) {\n            \n            boolean b = true;\n            \n            for (int j = 2; j < i; j++) {\n                \n                if (i % j == 0) {\n                    \n                    b = false;\n                    break;\n                }\n            }\n            //所以b==true时.i才是素数,直接输出i\n            if (b == true) {\n                System.out.println(\""素数为:\"" + i);\n                count++;\n                \n            }\n        }\n        System.out.println(\""200-500之间的素数个数为\"" + count + \""和为\"" + sum);\n    }\n}",NON_ZERO_EXIT_CODE,16,2796
1590974085713145856,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-11 15:45:55,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include(stdio.h)\n#include(time.h)\nint main()\n{\n    printf(\""%d\"",2022);\nreturn 0;\n}",COMPILE_ERROR,0,0
1590974108563738624,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 15:46:01,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc=new Scanner(System.in);\n        int x=sc.nextInt();\n        int[] n=new int[x];\n        for (int i = 0; i <x; i++) {\n            int q=sc.nextInt();\n            n[i]= (int) Math.pow(6,q);\n        }\n        for (int i = 0; i <x; i++){\n            System.out.println(n[i]%10);\n            System.out.println();\n        }\n    }\n}",WRONG_ANSWER,248,16992
1590974109469704192,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-11 15:46:01,Python,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include(stdio.h)\n#include(time.h)\nint main()\n{\n    printf(\""%d\"",2022);\nreturn 0;\n}",NON_ZERO_EXIT_CODE,15,2748
1590974120228098048,44042a4519c9231aa21c54eb113b7a08f98bcd7db4839a20a61ab6ce51fce357,2022-11-11 15:46:03,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int n;\n    int i;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=1;i<=n;i++)\n        scanf(\""%d \"",&a[n]);\n    for(i=1;i<=n;i++)\n        printf(\""6\\n\"");\n\n\n    return 0;\n}\n",WRONG_ANSWER,10,340
1590974130386698240,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-11 15:46:06,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include(stdio.h)\n#include(time.h)\nint main()\n{\n    printf(\""%d\"",2022);\nreturn 0;\n}",COMPILE_ERROR,0,0
1590974199206838272,44042a4519c9231aa21c54eb113b7a08f98bcd7db4839a20a61ab6ce51fce357,2022-11-11 15:46:22,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int n;\n    int i;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=1;i<=n;i++)\n        printf(\""6\\n\"");\n\n\n    return 0;\n}\n",WRONG_ANSWER,10,492
1590974270883303424,19b1d22e5c87afa9233c236fc7b4d5e0e70acf3872968cbe9aae96e75e9e38d1,2022-11-11 15:46:39,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"a = input()\na1 = input().split(\"" \"")\na2 = input().split(\"" \"")\nb = [int(a2[i]) - int(a1[i]) for i in range(0, len(a2))]\n\nf = 0\nc = [f]\n\nfor i in range(b.index(max(b)), 0, -1):\n\n    f = f + b[i]\n    c.append(f)\n\nfor i in range(b.index(max(b)+1), len(b)):\n\n    f = f + b[i]\n    c.append(f)\n\nprint(max(c))",NON_ZERO_EXIT_CODE,16,2880
1590974277321555968,44042a4519c9231aa21c54eb113b7a08f98bcd7db4839a20a61ab6ce51fce357,2022-11-11 15:46:41,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int n,r,p,q;\n    int i,j,k;\n    int a[n],b[n];\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++)\n        scanf(\""%d \"",&a[n]);\n    for(i=1;i<=n;i++)\n        b[i]=pow(6,a[i]);\n    for(i=1;i<=n;i++)\n        printf(\""6\\n\"");\n    \n    \n    return 0;\n}",WRONG_ANSWER,11,436
1590974336029208576,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-11 15:46:55,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include(stdio.h)\n#include(time.h)\nint main()\n{\n    printf(\""%d\"",2022);\nreturn 0;\n}",COMPILE_ERROR,0,0
1590974362474295296,19b1d22e5c87afa9233c236fc7b4d5e0e70acf3872968cbe9aae96e75e9e38d1,2022-11-11 15:47:01,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"a = input()\na1 = input().split(\"" \"")\na2 = input().split(\"" \"")\nb = [int(a2[i]) - int(a1[i]) for i in range(0, len(a2))]\n\nf = 0\nc = [f]\n\nfor i in range(b.index(max(b)), 0, -1):\n\n    f = f + b[i]\n    c.append(f)\n\nfor i in range(b.index(max(b))+1, len(b)):\n\n    f = f + b[i]\n    c.append(f)\n\nprint(max(c))",WRONG_ANSWER,18,2808
1590974389271728128,902d8082eea06043d392298983db4630cde4418ac8ee42282d537bfaae045c2f,2022-11-11 15:47:07,Python,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"count=int(input())\nlist=input().split(\"" \"")\nfor i in list:\n    if i==\""0\"":\n        print(1)\n    else:\n        if i==list[-1]:\n            print(6,end=\""\"")\n        else:\n            print(6)\n",ACCEPTED,52,3032
1590974411887411200,423e1acd0d02cf3d43f3c7805099dea4edcb39c2e0fa385e82823b5a7c0dd214,2022-11-11 15:47:13,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include<math.h>\nint main()\n{\n    int t;\n    scanf(\""%d\"", &t);\n    int n[3];\n    int i,a;\n    int count=0;\n    for (i = 0; i < 3; i++)\n        scanf(\""%d\"", &n[i]);\n     for (i = 0; i < 3;i++)\n    {\n        a = pow(6,n[i]);\n        if (count != 0)\n            printf(\""\\n\"");\n        printf(\""%d\"", a % 10);\n        count++;\n    }\n return 0;\n}",WRONG_ANSWER,3,316
1590974413233786880,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-11 15:47:13,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main(){\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,4,308
1590974542439321600,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-11 15:47:44,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#define M 100\nint main()\n{\n    int n,a[M],b[M],c[M],i,max;\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=1;i<=n;i++)\n    scanf(\""%d\"",&b[i]);\n    c[0]=0;\n    for(i=1;i<=n;i++)\n    c[i]=b[i]-a[i]+c[i-1];\n    for(i=1;i<=n;i++)\n    if(c[i]>c[i-1])\n    max=c[i];\n    printf(\""%d\\n\"",max);\n    return 0;\n}",WRONG_ANSWER,4,192
1590974562479681536,423e1acd0d02cf3d43f3c7805099dea4edcb39c2e0fa385e82823b5a7c0dd214,2022-11-11 15:47:49,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include<math.h>\nint main()\n{\n    int t;\n    scanf(\""%d\"", &t);\n    int n[3];\n    int i,a;\n    int count=0;\n    for (i = 0; i < 3; i++)\n        scanf(\""%d\"", &n[i]);\n     for (i = 0; i < 3;i++)\n    {\n        a = pow(6,n[i]);\n        if (count != 0)\n            printf(\""\\n\"");\n        printf(\""%d\"", a % 10);\n        count++;\n    }\n return 0;\n}",WRONG_ANSWER,3,332
1590974565323419648,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-11 15:47:49,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#define MAXSIZE 20\nint main()\n{\n    int n;\n    int ex[MAXSIZE];\n    int ge[MAXSIZE];\n    int Laur[MAXSIZE];\n    int Saya[MAXSIZE];\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n        scanf(\""%d\"",ex[i]);\n    for(int i=0;i<n;i++)\n        scanf(\""%d\"",ge[i]);\n  for(int i=0;i<n;i++)\n  {    int sum=0;\n       for(int j=i;j<n;i++)\n       {\n        Laur[i]=sum+ex[i]+ge[i];\n        sum=Laur[i];\n       }\n    for(int k=i;k<n;k++)\n    {int max=0;\n     max=(max>Laur[i])?max:Laur[i];}\n     Saya[i]=max;\n  }\n    for(int i=0;i<n;i++)\n    {max=(max>Saya[i])?max:Saya[i];}\n    return 0;\n}",COMPILE_ERROR,0,0
1590974578082512896,33bf53cc1ac96b08f54401ab68b14c30e1f5caef149cc9332585b7c5f09675ed,2022-11-11 15:47:52,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\n#include <bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int t , i ,re;\n    cin >> t ;\n    int shu[t] = 0 ;\n    for (i = 0 ; i < t ; i++ )\n    {\n        cin >> shu[i];\n    }\n    for (i = 0 ; i < t ; i++ )\n    {\n        re = ( pow( 6 , shu[ i ] ) ) % 10 ;\n        cout << re << endl;\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1590974585946832896,f1feb45d46abad163f730e5b023ce1df76883054d0a1741228a76c2c69aa3eda,2022-11-11 15:47:54,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main(){\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n}",ACCEPTED,6,352
1590974610194108416,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-11 15:48:00,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"num = eval(input())\nlist = input().split(\"" \"")\nfor i in range(num):\n    x = int(list[i])\n    print((6**x)%10)",TIME_LIMIT_EXCEEDED,168,4120
1590974618100367360,33bf53cc1ac96b08f54401ab68b14c30e1f5caef149cc9332585b7c5f09675ed,2022-11-11 15:48:02,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\n#include <bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int t , i ,re;\n    cin >> t ;\n    int shu[t] ;\n    for (i = 0 ; i < t ; i++ )\n    {\n        cin >> shu[i];\n    }\n    for (i = 0 ; i < t ; i++ )\n    {\n        re = ( pow( 6 , shu[ i ] ) ) % 10 ;\n        cout << re << endl;\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1590974643039678464,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 15:48:08,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc=new Scanner(System.in);\n        int x=sc.nextInt();\n        int[] n=new int[x];\n        for (int i = 0; i <x; i++) {\n            int q=sc.nextInt();\n            n[i]= (int) Math.pow(6,q);\n        }\n        for (int i = 0; i <x; i++){\n            if (i==x-1){\n                System.out.print(n[i]%10);\n            }else{\n                System.out.println(n[i]%10);\n            }\n        }\n    }\n}",NON_ZERO_EXIT_CODE,256,16408
1590974690116546560,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-11 15:48:19,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"printf(\""%d\"",2022);",COMPILE_ERROR,0,0
1590974698534535168,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 15:48:21,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc=new Scanner(System.in);\n        int x=sc.nextInt();\n        int[] n=new int[x];\n        for (int i = 0; i <x; i++) {\n            int q=sc.nextInt();\n            n[i]= (int) Math.pow(6,q);\n        }\n        for (int i = 0; i <x; i++){\n            if (i==x-1){\n                System.out.print(n[i]%10);\n            }else{\n                System.out.println(n[i]%10);\n            }\n        }\n    }\n}",WRONG_ANSWER,267,16644
1590974700963016704,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-11 15:48:22,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"num =input()\nlist = input().split(\"" \"")\nfor i in range(num):\n    x = int(list[i])\n    print((6**x)%10)",NON_ZERO_EXIT_CODE,15,3024
1590974702821117952,0206d922c91548d413fd4714e8e7acf14855929c72571138cbed378dcc53d751,2022-11-11 15:48:22,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int i,j,n;\n    int sum=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n        for(j=2;j<=sqrt(i);j++)\n        {\n            if(i%j==0)\n            {\n                break;\n            }\n            if(j>sqrt(i))\n            {\n                sum++;\n            }\n        }\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,14,384
1590974725273202688,abe2744e33bb397ffb9bb13afcb202f611378fb4fc5801202f03933298ce5f5d,2022-11-11 15:48:28,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n    public static void main(String[] args) throws IOException {\n        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n        int t =Integer.valueOf(reader.readLine());\n        String[] string = reader.readLine().split(\"" \"");\n        for (int i = 0; i < t; i++) {\n            String x=String.valueOf((long)Math.pow(6,Integer.valueOf(string[i])));\n            System.out.println(x.charAt(x.length()-1));\n        }\n    }\n}\n",WRONG_ANSWER,146,14560
1590974730495131648,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-11 15:48:29,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"num =input()\nlist = input().split(\"" \"")\nfor i in range(num):\n    x = int(list[i])\n    print((6**x)%10)",NON_ZERO_EXIT_CODE,23,2884
1590974731891838976,33bf53cc1ac96b08f54401ab68b14c30e1f5caef149cc9332585b7c5f09675ed,2022-11-11 15:48:29,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\n#include <bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int t , i ,re;\n    cin >> t ;\n    int shu[t] ;\n    for (i = 0 ; i < t ; i++ )\n    {\n        cin >> shu[i];\n    }\n    for (i = 0 ; i < t ; i++ )\n    {\n        re = ( pow( 6 , shu[ i ] ) ) % 10 ;\n        cout << re << endl;\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1590974742721531904,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-11 15:48:32,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,2022,COMPILE_ERROR,0,0
1590974759721041920,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-11 15:48:36,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"num = eval(input())\nlist = input().split(\"" \"")\nfor i in range(num):\n    x = int(list[i])\n    print((6**x)%10)",TIME_LIMIT_EXCEEDED,167,3948
1590974846031409152,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 15:48:56,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc=new Scanner(System.in);\n        int x=sc.nextInt();\n        int[] n=new int[x];\n        for (int i = 0; i <x; i++) {\n            int q=sc.nextInt();\n            n[i]= (int) Math.pow(6,q);\n        }\n        for (int i = 0; i <x; i++){\n            if (i==x-1){\n                System.out.print(n[i]%10);\n            }else{\n                System.out.println(n[i]%10);\n            }\n        }\n    }\n}",WRONG_ANSWER,275,16436
1590974870928818176,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-11 15:49:02,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nmain()\n｛\nprintf(\""2022\"");\n｝\n",COMPILE_ERROR,0,0
1590974899877908480,44042a4519c9231aa21c54eb113b7a08f98bcd7db4839a20a61ab6ce51fce357,2022-11-11 15:49:09,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int n,r,p,q;\n    int i,j,k;\n    int a[n],b[n];\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++)\n    {\n        if(i==1)\n            scanf(\""%d\"",&a[i]);\n        else\n            scanf(\""% d\"",&a[n]);\n    }\n    for(i=1;i<=n;i++)\n        b[i]=pow(6,a[i]);\n    for(i=1;i<=n;i++)\n        printf(\""6\\n\"");\n\n\n    return 0;\n}\n",WRONG_ANSWER,10,344
1590974911030562816,d21dc339d37b0772b2547441444d4b660b000ac3ebe190aee01769e2dd619c10,2022-11-11 15:49:12,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a=0;\n    scanf(\""%d\"",&a);\n    while(a--)\n    {\n        int n=0;\n        scanf(\""%d\"",&n);\n        if (n==0)\n        {\n            printf(\""1\\n\"");\n        }\n        else\n        {\n        printf(\""6\\n\"");\n        }\n    }\n    return 0;\n}\n\n",ACCEPTED,9,188
1590974913148682240,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 15:49:12,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc=new Scanner(System.in);\n        int x=sc.nextInt();\n        int[] n=new int[x];\n        for (int i = 0; i <x; i++) {\n            int q=sc.nextInt();\n            n[i]= (int) Math.pow(6,q);\n        }\n        for (int i = 0; i <x; i++){\n            if (i==x-1){\n                System.out.print(n[i]%10);\n            }else{\n                System.out.println(n[i]%10);\n            }\n        }\n    }\n}",NON_ZERO_EXIT_CODE,275,16476
1590974921549852672,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-11 15:49:14,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main()\n｛\nprintf(\""2022\"");\n｝\n",COMPILE_ERROR,0,0
1590974928474648576,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-11 15:49:16,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"num = eval(input())\nlist = input().split(\"" \"")\nfor i in range(num):\n    x = int(list[i])\n    print((6**x)%10)",TIME_LIMIT_EXCEEDED,170,4028
1590974930500497408,44042a4519c9231aa21c54eb113b7a08f98bcd7db4839a20a61ab6ce51fce357,2022-11-11 15:49:16,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int n,r,p,q;\n    int i,j,k;\n    int a[n],b[n];\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++)\n    {\n        if(i==1)\n            scanf(\""%d\"",&a[i]);\n        else\n            scanf(\""% d\"",&a[n]);\n    }\n    for(i=1;i<=n;i++)\n        b[i]=pow(6,a[i]);\n    for(i=1;i<=n;i++)\n        printf(\""6\\n\"");\n\n\n    return 0;\n}\n",WRONG_ANSWER,12,460
1590974935676293120,1363fe5b260b83108efff76d53fc3ee37db1aa74f7eb5c5c7e6dacb996b49862,2022-11-11 15:49:18,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\tif(n==0)\n\t\tprintf(\""%d\"",1);\n\telse\n\tprintf(\""%d\"",6);\n\treturn 0; \n}",WRONG_ANSWER,4,480
1590975046816960512,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-11 15:49:44,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h> \n#include <math.h>\nint main()\n {\n \tint m;\n    int a[m];\n    int result;\n \tscanf(\""%d\"",&m);\n \tfor(int i=0;i<m;i++)\n \t{\n\t \tscanf(\""%d\"",&a[i]);\n\t \t//result=(int)pow(6,n);\n\t\tif(a[m]==1||a[m]==0) printf(\""1\"");\n        else printf(\""6\"");\n        if(i!=(m-1))  printf(\""\\n\"");\n\t}\n\t  return 0;\n }",WRONG_ANSWER,4,188
1590975070036602880,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-11 15:49:50,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"num = int(input())\nlist = input().split(\"" \"")\nfor i in range(num):\n    x = int(list[i])\n    print((6**x)%10)",TIME_LIMIT_EXCEEDED,167,4136
1590975132347203584,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 15:50:05,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc=new Scanner(System.in);\n        int x=sc.nextInt();\n        int[] n=new int[x];\n        for (int i = 0; i <x; i++) {\n            int q=sc.nextInt();\n            n[i]= (int) Math.pow(6,q);\n        }\n        for (int i = 0; i <x; i++){\n            if (i==x-1){\n                System.out.print(n[i]%10);\n            }else{\n                System.out.println(n[i]%10);\n            }\n        }\n        sc.close();\n    }\n}",WRONG_ANSWER,264,16572
1590975153620717568,977c9d350f87cd8386fa1f88cca886d6ff43821830806e60da6d6b36dc77cd13,2022-11-11 15:50:10,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int i,j,n;\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++)\n    {   if(i<n)\n        {\n        scanf(\""%d\"",&j);\n        printf(\""%d\"",(int)pow(6,j)%10);\n        printf(\""\\n\"");\n        }\n     else\n     {\n         scanf(\""%d\"",&j);\n        printf(\""%d\"",(int)pow(6,j)%10);\n     }\n    }\n}",WRONG_ANSWER,8,348
1590975159920562176,33bf53cc1ac96b08f54401ab68b14c30e1f5caef149cc9332585b7c5f09675ed,2022-11-11 15:50:11,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\n#include <cmath>\nusing namespace std;\nint main()\n{\n    int t , i ,re;\n    cin >> t ;\n    int shu[t] ;\n    for (i = 0 ; i < t ; i++ )\n    {\n        cin >> shu[i];\n    }\n    for (i = 0 ; i < t ; i++ )\n    {\n        re = ( pow( 6 , shu[ i ] ) ) % 10 ;\n        cout << re << endl;\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1590975165087920128,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 15:50:12,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc=new Scanner(System.in);\n        int x=sc.nextInt();\n        int[] n=new int[x];\n        for (int i = 0; i <x; i++) {\n            int q=sc.nextInt();\n            n[i]= (int) Math.pow(6,q);\n        }\n        for (int i = 0; i <x; i++){\n            if (i==x-1){\n                System.out.print(n[i]%10);\n            }else{\n                System.out.println(n[i]%10);\n            }\n        }\n    }\n}",NON_ZERO_EXIT_CODE,264,16600
1590975181097578496,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-11 15:50:16,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main(){\n    int x,y,z;\n    scanf(\""%d\"",&x);\n    scanf(\""%d\"",&y);\n    scanf(\""%d\"",&z);\n    printf(\""%d\"",x+y-z);\n    return 0;\n}",ACCEPTED,6,380
1590975184054583296,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-11 15:50:17,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main()\n｛\nprintf(\""2022\"");\nreturn 0;\n｝\n",COMPILE_ERROR,0,0
1590975188286615552,44042a4519c9231aa21c54eb113b7a08f98bcd7db4839a20a61ab6ce51fce357,2022-11-11 15:50:18,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int n;\n    int i;\n    int a[n],b[n];\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++)\n    {\n        if(i==1)\n            scanf(\""%d\"",&a[i]);\n        else\n            scanf(\""% d\"",&a[n]);\n    }\n    for(i=1;i<=n;i++)\n        b[i]=pow(6,a[i]);\n    for(i=1;i<=n;i++)\n        printf(\""6\\n\"");\n\n\n    return 0;\n}\n",WRONG_ANSWER,14,452
1590975191549784064,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-11 15:50:19,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h> \n#include <math.h>\nint main()\n {\n \tint m;\n    int a[m];\n    int result;\n \tscanf(\""%d\"",&m);\n \tfor(int i=0;i<m;i++)\n \t{\n\t \tscanf(\""%d\"",&a[i]);\n\t \t//result=(int)pow(6,n);\n\t\tif(a[i]==1||a[i]==0) printf(\""1\"");\n        else printf(\""6\"");\n        if(i!=(m-1))  printf(\""\\n\"");\n\t}\n\t  return 0;\n }",WRONG_ANSWER,9,348
1590975209878917120,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 15:50:23,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc=new Scanner(System.in);\n        int x=sc.nextInt();\n        int[] n=new int[x];\n        for (int i = 0; i <x; i++) {\n            int q=sc.nextInt();\n            n[i]= (int) Math.pow(6,q);\n        }\n        for (int i = 0; i <x; i++){\n            if (i==x-1){\n                System.out.print(n[i]%10);\n            }else{\n                System.out.println(n[i]%10);\n            }\n        }\n    }\n}",WRONG_ANSWER,250,16464
1590975224483479552,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 15:50:27,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint sushu(int m)\n{\n    int k;\n    int i;\n    k=sqrt(m);\n    for(i=2;i<=k;i++)\n        if(m%i==0)\n            if(i>k)\n                printf(\""%4d\"",m);\n}\nmain()\n{\n    int m,n,k,i,a=0;\n    scanf(\""%d\"",&n);\n    for(m=2;m<n;m++)\n    {\n        k=sqrt(m);\n        for(i=2;i<=k;i++)\n            if(m%i==0) break;\n        if(i>k) a++;\n    }\n    printf(\""%d\"",a);\n}\n",ACCEPTED,14,208
1590975237661962240,75a6755f083ffc71d77ba6ce593bd24fe8a2ce61edc4710fbde2dce128c47ab4,2022-11-11 15:50:30,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,j,k=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n    {\n        for(j=2;j<=i;j++)\n        {\n         if(i%j==0)\n             break;\n        }\n         if(i==j)\n         k++;\n\n    }\n    printf(\""%d\"",k);\n\n}\n",ACCEPTED,975,308
1590975238131724288,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 15:50:30,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc=new Scanner(System.in);\n        int x=sc.nextInt();\n        int[] n=new int[x];\n        for (int i = 0; i <x; i++) {\n            int q=sc.nextInt();\n            n[i]= (int) Math.pow(6,q);\n        }\n        for (int i = 0; i <x; i++){\n            if (i==x-1){\n                System.out.print(n[i]%10);\n            }else{\n                System.out.println(n[i]%10);\n            }\n        }\n    }\n}",NON_ZERO_EXIT_CODE,250,16232
1590975253717782528,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-11 15:50:34,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nmain()\n｛\nprintf(\""2022\"");\nreturn 0;\n｝\n",COMPILE_ERROR,0,0
1590975258998411264,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 15:50:35,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint sushu(int m)\n{\n    int k;\n    int i;\n    k=sqrt(m);\n    for(i=2;i<=k;i++)\n        if(m%i==0)\n            if(i>k)\n                printf(\""%4d\"",m);\n}\nmain()\n{\n    int m,n,k,i,a=0;\n    scanf(\""%d\"",&n);\n    for(m=2;m<n;m++)\n    {\n        k=sqrt(m);\n        for(i=2;i<=k;i++)\n            if(m%i==0) break;\n        if(i>k) a++;\n    }\n    printf(\""%d\"",a);\n}\n",ACCEPTED,15,312
1590975270692130816,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-11 15:50:38,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"num = int(input())\nlist = input().split(\"" \"")\nfor i in range(num):\n    x = int(list[i])\n    y = (6**x)%10\n    print(y)",TIME_LIMIT_EXCEEDED,165,4056
1590975273615560704,19b1d22e5c87afa9233c236fc7b4d5e0e70acf3872968cbe9aae96e75e9e38d1,2022-11-11 15:50:38,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"a = input()\na1 = input().split(\"" \"")\na2 = input().split(\"" \"")\nb = [int(a2[i]) - int(a1[i]) for i in range(0, len(a2))]\nf = max(b)\nc = [f]\nif b.index(max(b))!= 0:\n    for i in range(b.index(max(b)), 0, -1):\n        f = f + b[i]\n        c.append(f)\nif b.index(max(b)) != len(b)-1:\n    for i in range(b.index(max(b))+1, len(b)):\n        f = f + b[i]\n        c.append(f)\n\nprint(max(c))",WRONG_ANSWER,17,2992
1590975374824112128,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-11 15:51:02,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h> \n#include<math.h>\nint main(){\nint n;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(int i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n    \n    for(int i=0;i<n-1;i++){\n       if(a[i]==0&&i<(n-1)) printf(\""1\\n\"");\n       else printf(\""6\\n\"");\n    }\n    if(a[n-1]==0) printf(\""1\"");\n    else printf(\""6\"");\n\t\n}",ACCEPTED,11,352
1590975376988377088,44042a4519c9231aa21c54eb113b7a08f98bcd7db4839a20a61ab6ce51fce357,2022-11-11 15:51:03,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int n;\n    int i;\n    int a[n],b[n];\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++)\n    {\n        if(i==1)\n            scanf(\""%d\"",&a[i]);\n        else\n            scanf(\""% d\"",&a[n]);\n    }\n    for(i=1;i<=n;i++)\n        printf(\""6\\n\"");\n\n\n    return 0;\n}\n",WRONG_ANSWER,9,344
1590975522518142976,1363fe5b260b83108efff76d53fc3ee37db1aa74f7eb5c5c7e6dacb996b49862,2022-11-11 15:51:38,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\tif(n==0)\n\t\tprintf(\""1\"");\n\telse\n\tprintf(\""6\"");\n\treturn 0; \n}",WRONG_ANSWER,4,348
1590975566302482432,19b1d22e5c87afa9233c236fc7b4d5e0e70acf3872968cbe9aae96e75e9e38d1,2022-11-11 15:51:48,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"a = input()\na1 = input().split(\"" \"")\na2 = input().split(\"" \"")\nb = [int(a2[i]) - int(a1[i]) for i in range(0, len(a2))]\nf = max(b)\nc = [f]\nif b.index(max(b))!= 0:\n    for i in range(b.index(max(b))-1, 0, -1):\n        f = f + b[i]\n        c.append(f)\nif b.index(max(b)) != len(b)-1:\n    for i in range(b.index(max(b))+1, len(b)):\n        f = f + b[i]\n        c.append(f)\n\nprint(max(c))",WRONG_ANSWER,17,3004
1590975568714207232,acfcf65f14b5d3b02c3225372654b4e21f04d33a8bbaeb346e4fb1d85f2ea94f,2022-11-11 15:51:49,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n  int t,n,i,r,g;\n  scanf(\""%d\"",&t);\n  g=pow(10,9);  \n  if(n>=0&&N<=g)   \n  for(i=1;i<=t;i++)\n  {\n    scanf(\""%d\"",&n);\n    r=pow(6,n);\n      if(i<t)\n    printf(\""%d\\n\"",r%10);  \n      else\n    printf(\""%d\"",r%10);      \n  }\n   return 0;\n}\n",COMPILE_ERROR,0,0
1590975571415339008,44042a4519c9231aa21c54eb113b7a08f98bcd7db4839a20a61ab6ce51fce357,2022-11-11 15:51:49,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int n;\n    int i;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=1;i<=n;i++)\n    {\n        if(i==1)\n            scanf(\""%d\"",&a[i]);\n        else\n            scanf(\""% d\"",&a[n]);\n    }\n    for(i=1;i<=n;i++)\n        b[i]=pow(6,a[i]);\n    for(i=1;i<=n;i++)\n        printf(\""6\\n\"");\n\n\n    return 0;\n}\n",WRONG_ANSWER,11,436
1590975663471919104,03f9d7a6fc27d141b8243d1b2b44a3276cdd4750b5c2621d6d8c006b64ca6514,2022-11-11 15:52:11,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint n,a,i=0;\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a);\n\t\tif(a>0){\n\t\t\tprintf(\""6\"");\n\t\t\t}else\n\t\t\t\tprintf(\""1\"");\n\t\t\t\tprintf(\""\\n\"");\n\t\t}\n\treturn 0;\n}",WRONG_ANSWER,8,476
1590975791977009152,1b00b3d29099722d8332b35e3af5e54fda309b4f7c9fc6261f618ecd2a4d7390,2022-11-11 15:52:42,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int a=0,n,i,j;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n    {\n        for(j=2;j<i;j++)\n        {\n        if(i%j==0)\n        break;\n         }\n        if(j==i) a++;\n    }\n        printf(\""%d\"",a);\n    return 0;\n}",ACCEPTED,944,340
1590975871345823744,eee658ba43cf6fba46676f4d9f167223fd9b57ec54a5d813fd1d01afc3088139,2022-11-11 15:53:01,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int t,n,i=1,m,x;\n    x=pow(10,9);\n    scanf (\""%d\\n\"",&t);\n    while(i<=t)\n    {\n      scanf (\""%d\\n\"",&n);\n      if(0<=n<=x)\n      {\n        m=pow(6,n);\n        m=m/1%10;\n        printf (\""%d\"",m);\n      }\n        if(i<t)\n        {\n            printf (\""\\n\"");\n        }\n        i++;\n    }\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,3,320
1590975928543543296,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-11 15:53:14,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nmain()\n{\n\nprintf(\""2022\"");\nreturn 0;\n}\n",ACCEPTED,3,320
1590975953294110720,33bf53cc1ac96b08f54401ab68b14c30e1f5caef149cc9332585b7c5f09675ed,2022-11-11 15:53:20,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\n#include <cmath>\nusing namespace std;\nint main()\n{\n    int t , i , re , in;\n    cin >> t ;\n    int shu[t] ;\n    for (i = 0 ; i < t ; i++ )\n    {\n        cin >> shu[i];\n    }\n    for (i = 0 ; i < t ; i++ )\n    {\n        in = pow( 6 , shu[ i ] ) ;\n\t\tre = in % 10 ;\n        cout << re << endl;\n    }\n    return 0;\n}",WRONG_ANSWER,7,576
1590975953801646080,cf76a6e5773cf2f19ddd635fa646c5a6721f6fed8998d22ea1d0910bee8017a2,2022-11-11 15:53:20,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n   int i=2022;\n    printf(\""%d\"",i);\n}",ACCEPTED,3,200
1590975961842102272,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 15:53:22,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"",&n);\n    int arr1[1000] = {0};\n    int arr2[1000] = {0};\n    for(int i = 0; i < n; ++i)\n    {\n        scanf(\""%d\"",&arr1[i]);\n    }\n    for(int j = 0; j < n; ++j)\n    {\n        scanf(\""%d\"",&arr2[j]);\n    }\n    int max1 = 0, max2 = 0, max3 = 0, count = 0, k = 0;\n    for(k = 0; k < n; ++k)\n    {\n        int sum = arr2[k] - arr1[k];\n        if(sum <= 0)\n        {\n            if (max3 == 0)\n            {\n                max3 = sum;\n            }\n            if (sum > max3)\n            {\n                max3 = sum;\n            }\n            if(max1 < max2)\n            {\n                max1 = max2; \n            }\n            max2 = 0;\n        }\n        else\n        {\n            max2 += sum;\n        }\n    }\n    if(count == n)\n    {\n        printf(\""%d\"",max3);\n    }\n    else\n    {\n        int max = max1 > max2 ? max1 : max2;\n        printf(\""%d\"",max); \n    }\n    return 0;\n}",WRONG_ANSWER,3,188
1590975990979952640,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-11 15:53:29,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,a=2022;\nprint(a);\n,ACCEPTED,15,2688
1590976028632223744,03f9d7a6fc27d141b8243d1b2b44a3276cdd4750b5c2621d6d8c006b64ca6514,2022-11-11 15:53:38,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint n,a,i=0;\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a);\n\t\tif(a>0){\n\t\t\tprintf(\""6\\n\"");\n\t\t\t}else if(a=0){ \n\t\t\t\tprintf(\""1\"");\n\t\t\t}\n\t\t//printf(\""\\n\"");\n\t\t}\n\treturn 0;\n}",WRONG_ANSWER,8,496
1590976063650443264,1e783de44f6cf9abb158b108e556a36ef99d9241fc592b40cfd6cb7d1265eb34,2022-11-11 15:53:47,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\nclass Main{  \n    public static void main(String[] args) {  \n          int x;\n        int sum;\n        int count=0;\n        Scanner s = new Scanner(System.in);\n        sum=s.nextInt();//接收测试个数\n        int i=0;\n        int j=0;\n       for ( i=2;i<=sum;i++){\n        for (j=2;j<=i;j++){\n            if (i%j==0){\n                break;\n            }\n        }\n        if (i==j){\n            count++;\n        }\n       }\n        System.out.println(count);\n    }\n},TIME_LIMIT_EXCEEDED,1000,19548
1590976075017007104,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 15:53:49,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"", &n);\n    int arr1[1000] = { 0 };\n    int arr2[1000] = { 0 };\n    for (int i = 0; i < n; ++i)\n    {\n        scanf(\""%d\"", &arr1[i]);\n    }\n    for (int j = 0; j < n; ++j)\n    {\n        scanf(\""%d\"", &arr2[j]);\n    }\n    int max1 = 0, max2 = 0, max3 = 0, count = 0, k = 0;\n    for (k = 0; k < n; ++k)\n    {\n        int sum = arr2[k] - arr1[k];\n        if (sum <= 0)\n        {\n            if (max3 == 0)\n            {\n                max3 = sum;\n            }\n            if (sum > max3)\n            {\n                max3 = sum;\n            }\n            count++;\n            if (max1 < max2)\n            {\n                max1 = max2;\n            }\n            max2 = 0;\n        }\n        else\n        {\n            max2 += sum;\n        }\n    }\n    if (count == n)\n    {\n        printf(\""%d\"", max3);\n    }\n    else\n    {\n        int max = max1 > max2 ? max1 : max2;\n        printf(\""%d\"", max);\n    }\n    return 0;\n}",WRONG_ANSWER,4,180
1590976085859282944,63a19c717d077fecd1be96314929ebf3516f35619209eacac77081bb07edebb5,2022-11-11 15:53:52,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n   int i,n,sum=0,flag;\n   scanf(\""%d\"",&n);\n   while(n>=2){\n        flag=1;\n        for(i=2;i<n;i++){\n            if(n%i==0){\n                flag=0;\n                break;\n            }\n        }\n       if(flag==1){\n        sum++;\n       }\n       n--;\n}\n     printf(\""%d\"",sum);\n     return 0;\n}\n\n\n\n",ACCEPTED,958,348
1590976138237751296,44042a4519c9231aa21c54eb113b7a08f98bcd7db4839a20a61ab6ce51fce357,2022-11-11 15:54:04,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int n;\n    int i;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=1;i<=n;i++)\n    {\n        if(i==1)\n            scanf(\""%d\"",&a[i]);\n        else\n            scanf(\""% d\"",&a[n]);\n    }\n    for(i=1;i<=n;i++)\n        b[i]=pow(6,a[i]);\n    for(i=1;i<=n;i++)\n    {\n        if(i==1)\n            printf(\""6\"")；\n        else\n            printf(\""\\n6\"");\n\n\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590976155883208704,33bf53cc1ac96b08f54401ab68b14c30e1f5caef149cc9332585b7c5f09675ed,2022-11-11 15:54:09,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\n#include <cmath>\nusing namespace std;\nint main()\n{\n    int t , i , re , in;\n    cin >> t ;\n    int shu[t] ;\n    for (i = 0 ; i < t ; i++ )\n    {\n        cin >> shu[i];\n    }\n    for (i = 0 ; i < t ; i++ )\n    {\n        in = pow( 6 , shu[ i ] ) ;\n\t\tre = in % 10 ;\n        cout << re << endl;\n    }\n    return 0;\n}",WRONG_ANSWER,8,572
1590976195192229888,44042a4519c9231aa21c54eb113b7a08f98bcd7db4839a20a61ab6ce51fce357,2022-11-11 15:54:18,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int n;\n    int i;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=1;i<=n;i++)\n    {\n        if(i==1)\n            scanf(\""%d\"",&a[i]);\n        else\n            scanf(\""% d\"",&a[n]);\n    }\n    for(i=1;i<=n;i++)\n        b[i]=pow(6,a[i]);\n    for(i=1;i<=n;i++)\n    {\n        if(i==1)\n            printf(\""6\"");\n        else\n            printf(\""\\n6\"");\n\n\n    }\n    return 0;\n}\n",WRONG_ANSWER,12,320
1590976321000378368,fbea21dbaf89f1b064feaa20227f21c5e1c4888fdc371cf5e43f70615906e52a,2022-11-11 15:54:48,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"n=int(input())\nnum=list(map(int,input().split()))\nfor i in num:\n    x=6**int(i)%10\n    print(x)",TIME_LIMIT_EXCEEDED,166,4224
1590976343934808064,423e1acd0d02cf3d43f3c7805099dea4edcb39c2e0fa385e82823b5a7c0dd214,2022-11-11 15:54:53,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include<math.h>\nint main()\n{\n    int t;\n    scanf(\""%d\"", &t);\n    int n[t];\n    int i,a;\n    for (i = 0; i < t; i++)\n        scanf(\""%d\"", &n[i]);\n     for (i = 0; i < t;i++)\n    {\n        a = pow(6,n[i]);\n        printf(\""%d\\n\"", a % 10);\n    }\n return 0;\n}",WRONG_ANSWER,6,332
1590976344903716864,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 15:54:54,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"", &n);\n    int arr1[1000] = { 0 };\n    int arr2[1000] = { 0 };\n    for (int i = 0; i < n; ++i)\n    {\n        scanf(\""%d\"", &arr1[i]);\n    }\n    for (int j = 0; j < n; ++j)\n    {\n        scanf(\""%d\"", &arr2[j]);\n    }\n    int max1 = 0, max2 = 0, max3 = 0, count = 0, k = 0;\n    for (k = 0; k < n; ++k)\n    {\n        int sum = arr2[k] - arr1[k];\n        if (sum <= 0)\n        {\n            if (max3 == 0)\n            {\n                max3 = sum;\n            }\n            if (sum > max3)\n            {\n                max3 = sum;\n            }\n            count++;\n            if (max1 < max2)\n            {\n                max1 = max2;\n            }\n            max2 = 0;\n        }\n        else\n        {\n            max2 += sum;\n        }\n    }\n    if (count == n)\n    {\n        printf(\""%d\"", max3);\n    }\n    else\n    {\n        int max = max1 > max2 ? max1 : max2;\n        printf(\""%d\"", max);\n    }\n    return 0;\n}",WRONG_ANSWER,3,444
1590976424712933376,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-11-11 15:55:13,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"t=int(input())\nn=list(map(int,input().split(' ')))\nfor i in range(0,len(n)):\n   if n[i]%2==0:\n      print(pow(36,n[i]//2)%10)\n   else:\n      print((6*pow(6,n[i]-1))%10)",TIME_LIMIT_EXCEEDED,166,3996
1590976440881975296,423e1acd0d02cf3d43f3c7805099dea4edcb39c2e0fa385e82823b5a7c0dd214,2022-11-11 15:55:17,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"int main()\n{\n    int t;\n    scanf(\""%d\"", &t);\n    int n[t];\n    int i,a;\n    for (i = 0; i < t; i++)\n        scanf(\""%d\"", &n[i]);\n     for (i = 0; i < t;i++)\n    {\n        a = pow(6,n[i]);\n        printf(\""%d\\n\"", a % 10);\n    }\n return 0;\n}",WRONG_ANSWER,6,340
1590976444363247616,345826d11b41befc23adeb536e81da8eb6ec9a8bfb9448acf91422deedb8ba4a,2022-11-11 15:55:17,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,i,mmax=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n],s[n],max[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n     for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n        {\n            s[i]=0;\n            c[i]=0;\n            max[i]=0;\n        }\n        if(b[0]-a[0]>0)\n            {\n                c[0]=b[0]-a[0];\n                s[0]=c[0];\n                max[0]=s[0];\n            }\n\n     for(i=1;i<n;i++)\n        {\n            if(b[i]-a[i]>0)\n            {\n                c[i]=b[i]-a[i];\n                s[i]=s[i-1]+c[i];\n                max[i]=s[i];\n            }\n            else\n            {\n                s[i]=0;\n            }\n        }\n    mmax=max[0];\n    for(i=0;i<n-1;i++)\n    {\n        if(mmax>=max[i+1])\n           ;\n        else\n            mmax=max[i+1];\n    }\n     printf(\""%d\"",mmax);\n}\n",WRONG_ANSWER,3,332
1590976472658022400,345826d11b41befc23adeb536e81da8eb6ec9a8bfb9448acf91422deedb8ba4a,2022-11-11 15:55:24,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,i,mmax=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n],s[n],max[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n     for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n        {\n            s[i]=0;\n            c[i]=0;\n            max[i]=0;\n        }\n        if(b[0]-a[0]>0)\n            {\n                c[0]=b[0]-a[0];\n                s[0]=c[0];\n                max[0]=s[0];\n            }\n\n     for(i=1;i<n;i++)\n        {\n            if(b[i]-a[i]>0)\n            {\n                c[i]=b[i]-a[i];\n                s[i]=s[i-1]+c[i];\n                max[i]=s[i];\n            }\n            else\n            {\n                s[i]=0;\n            }\n        }\n    mmax=max[0];\n    for(i=0;i<n-1;i++)\n    {\n        if(mmax>=max[i+1])\n           ;\n        else\n            mmax=max[i+1];\n    }\n     printf(\""%d\"",mmax);\n}\n",WRONG_ANSWER,4,308
1590976485291261952,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-11 15:55:27,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#define MAXSIZE 20\nint main()\n{\n    int n,i,j,k;\n    int sum;\n    int max;\n    int ex[MAXSIZE];\n    int ge[MAXSIZE];\n    int Laur[MAXSIZE];\n    int Saya[MAXSIZE];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {scanf(\""%d\"",&ex[i]);}\n    for(i=0;i<n;i++)\n    {scanf(\""%d\"",&ge[i]);}\n  for(i=0;i<n;i++)\n  {     sum=0;\n       for(j=i;j<n;i++)\n       {\n        Laur[i]=sum+ex[i]+ge[i];\n        sum=Laur[i];\n       }\n      max=0;\n    for(k=i;k<n;k++)\n    {max=(max>Laur[i])?max:Laur[i];}\n     Saya[i]=max;\n  }\n    max=0;\n    for(i=0;i<n;i++)\n    {max=(max>Saya[i])?max:Saya[i];}\n    return 0;\n}",TIME_LIMIT_EXCEEDED,400,312
1590976520691187712,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-11 15:55:36,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#define MAXSIZE 20\nint main()\n{\n    int n,i,j,k;\n    int sum;\n    int max;\n    int ex[MAXSIZE];\n    int ge[MAXSIZE];\n    int Laur[MAXSIZE];\n    int Saya[MAXSIZE];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {scanf(\""%d\"",&ex[i]);}\n    for(i=0;i<n;i++)\n    {scanf(\""%d\"",&ge[i]);}\n  for(i=0;i<n;i++)\n  {     sum=0;\n       for(j=i;j<n;i++)\n       {\n        Laur[i]=sum+ex[i]+ge[i];\n        sum=Laur[i];\n       }\n      max=0;\n    for(k=i;k<n;k++)\n    {max=(max>Laur[i])?max:Laur[i];}\n     Saya[i]=max;\n  }\n    max=0;\n    for(i=0;i<n;i++)\n    {max=(max>Saya[i])?max:Saya[i];}\n    return 0;\n}",TIME_LIMIT_EXCEEDED,400,308
1590976594523521024,eee658ba43cf6fba46676f4d9f167223fd9b57ec54a5d813fd1d01afc3088139,2022-11-11 15:55:53,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int t,n,i=1,m,x=pow(10,9);\n    scanf (\""%d\\n\"",&t);\n    while(i<=t)\n    {\n      scanf (\""%d\\n\"",&n);\n        m=pow(6,n);\n        m=m/1%10;\n        printf (\""%d\"",m);\n        if(i<t)\n        {\n            printf (\""\\n\"");\n        }\n        i++;\n    }\n    return 0;\n}\n",WRONG_ANSWER,6,336
1590976617093050368,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-11 15:55:59,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#define MAXSIZE 20\nint main()\n{\n    int n,i,j,k;\n    int sum;\n    int max;\n    int ex[MAXSIZE];\n    int ge[MAXSIZE];\n    int Laur[MAXSIZE];\n    int Saya[MAXSIZE];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {scanf(\""%d\"",&ex[i]);}\n    for(i=0;i<n;i++)\n    {scanf(\""%d\"",&ge[i]);}\n  for(i=0;i<n;i++)\n  {     sum=0;\n       for(j=i;j<n;i++)\n       {\n        Laur[i]=sum+ex[i]+ge[i];\n        sum=Laur[i];\n       }\n      max=0;\n    for(k=i;k<n;k++)\n    {max=(max>Laur[i])?max:Laur[i];}\n     Saya[i]=max;\n  }\n    max=0;\n    for(i=0;i<n;i++)\n    {max=(max>Saya[i])?max:Saya[i];}\n    return 0;\n}",TIME_LIMIT_EXCEEDED,400,476
1590976814359556096,44042a4519c9231aa21c54eb113b7a08f98bcd7db4839a20a61ab6ce51fce357,2022-11-11 15:56:46,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int n;\n    int i;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=1;i<=n;i++)\n    {\n        if(i==1)\n            scanf(\""%d\"",&a[i]);\n        else\n            scanf(\""% d\"",&a[i]);\n    }\n    for(i=1;i<=n;i++)\n    {\n        if(i==1)\n            printf(\""6\"");\n        else\n            printf(\""\\n6\"");\n\n\n    }\n    return 0;\n}\n",WRONG_ANSWER,9,488
1590976815978577920,b31601c92a4a3080abbaad650e00bb77253224eab66b59a49b2118d017649c2c,2022-11-11 15:56:46,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b,c,d;\n    scanf(\""%d/n\"",&d);\n    scanf(\""%d%d%d/n\"",&a,&b,&c);\n    while (d>=1)\n    {printf(\""6\\n\"");\n    d=d-1;\n    }\n\n    return 0;\n}\n",WRONG_ANSWER,9,372
1590976873583128576,33bf53cc1ac96b08f54401ab68b14c30e1f5caef149cc9332585b7c5f09675ed,2022-11-11 15:57:00,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\n#include <cmath>\nusing namespace std;\nint main()\n{\n    int t , i , re , in;\n    cin >> t ;\n    int shu[t] ;\n    for (i = 0 ; i < t ; i++ )\n    {\n        cin >> shu[i];\n    }\n    for (i = 0 ; i < t ; i++ )\n    {\n        in = pow( 6 , shu[ i ] ) ;\n\t\tre = in % 10 ;\n        cout << re << endl;\n    }\n    return 0;\n}",WRONG_ANSWER,8,588
1590976907166920704,eee658ba43cf6fba46676f4d9f167223fd9b57ec54a5d813fd1d01afc3088139,2022-11-11 15:57:08,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int t,n,i=1,m,x=pow(10,9);\n    scanf (\""%d\\n\"",&t);\n    while(i<=t)\n    {\n      scanf (\""%d\\n\"",&n);\n      if(0<=n<=x)\n      {\n        m=pow(6,n);\n        m=m/1%10;\n        printf (\""%d\"",m);\n      }\n        if(i<t)\n        {\n            printf (\""\\n\"");\n        }\n        i++;\n    }\n    return 0;\n}",WRONG_ANSWER,6,404
1590976908802719744,4d1157ac6ad50cfc6ca5d6b3e1c2dd7f1ecc593df10ff6888d4207a4f1c03a35,2022-11-11 15:57:08,C++,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int n,sum=0,max=0;\n    cin>>n;\n    int a[n],b[n],c[n];\n    for(int i=1;i<=n;i++)\n    {\n        cin>>a[i];\n    }\n    for(int i=1;i<=n;i++)\n    {\n        cin>>b[i];\n    }\n        for(int i=1;i<=n;i++)\n        {\n            c[i]=b[i]-a[i];\n        }\n    for(int i=1;i<=n;i++)\n    {\n        sum=sum+c[i];\n        if(sum>max) max=sum;\n        if(sum<0) sum=0;\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",ACCEPTED,5,436
1590976973915099136,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-11 15:57:24,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int n,num=0;\n    scanf(\""%d\"",&n);\n    int i,j;\n    for(i=2;i<n;i++)\n    {\n        for(j=2;j<=i;j++)\n        {\n            if(i%j==0) break;\n        }\n        if(i==j) num+=1;\n        }\n    printf(\""%d\"",num);\n    return 0;\n}",ACCEPTED,985,336
1590977052109508608,acfcf65f14b5d3b02c3225372654b4e21f04d33a8bbaeb346e4fb1d85f2ea94f,2022-11-11 15:57:42,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n  int t,n,i,r,g=pow(10,9);\n  scanf(\""%d\"",&t); \n  for(i=1;i<=t;i++)\n  {\n    scanf(\""%d\"",&n);\n    r=pow(6,n);\n      n<=g;\n      if(i<t)\n    printf(\""%d\\n\"",r%10);  \n      else\n    printf(\""%d\"",r%10);      \n  }\n   return 0;\n}\n",WRONG_ANSWER,8,208
1590977131176329216,03f9d7a6fc27d141b8243d1b2b44a3276cdd4750b5c2621d6d8c006b64ca6514,2022-11-11 15:58:01,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint n,a,i=0;\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a);\n\t\tif(a>0){\n\t\t\tprintf(\""6\\n\"");\n\t\t\t}else if(a==0){ \n\t\t\t\tprintf(\""1\\n\"");\n\t\t\t}\n\t\t//printf(\""\\n\"");\n\t\t}\n\treturn 0;\n}",WRONG_ANSWER,8,348
1590977243382329344,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-11-11 15:58:28,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"t=int(input())\nn=list(map(int,input().split(' ')))\nfor i in range(0,len(n)):\n   print(pow(6,n[i])%10)",TIME_LIMIT_EXCEEDED,167,4104
1590977322352709632,acfcf65f14b5d3b02c3225372654b4e21f04d33a8bbaeb346e4fb1d85f2ea94f,2022-11-11 15:58:47,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n  int t,n,i,r,g=pow(10,9);\n  scanf(\""%d\"",&t); \n  for(i=1;i<=t;i++)\n  {\n    scanf(\""%d\"",&n);\n    r=pow(6,n);\n      if(i<t,n<=g)\n    printf(\""%d\\n\"",r%10);  \n      else\n    printf(\""%d\"",r%10);      \n  }\n   return 0;\n}\n",WRONG_ANSWER,7,468
1590977345345859584,aa65cdf25cbe32699d085a61c4f3ec5a4020e6a3dc1e0e9d6e2a48c9288f8026,2022-11-11 15:58:52,Java,0.0,1590734963702620160,1590734503495200768,1049226928954454016,import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main{\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int num = scanner.nextInt();\n        int[] getmax = new int[num];\n        int[] arr = new int[num];\n        int[] arr1 = new int[num];\n\n        int maxnum[]=new int[num];\n        for (int i = 0; i < num; i++) {\n            arr[i] = scanner.nextInt();\n        }\n        for (int j = 0; j < num; j++) {\n            arr1[j] = scanner.nextInt();\n        }\n\n\n        for (int i = 0; i < num; i++) {\n          getmax[i]=arr1[i]-arr[i];\n        }\n\n        for (int i = 0; i < num; i++) {\n            for (int j = 0; j < i; j++) {\n                maxnum[i]+=getmax[j];\n            }\n            }\n        Arrays.sort(maxnum);\n        System.out.print(maxnum[num-1]);\n        }\n\n\n    }\n,WRONG_ANSWER,126,17012
1590977455937073152,cf76a6e5773cf2f19ddd635fa646c5a6721f6fed8998d22ea1d0910bee8017a2,2022-11-11 15:59:19,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x,y,z,a;\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    if(x>=0&&x<=100&&y>=0&&y<=100&&z>=0&&z<=100)\n    {\n        a=x+y-z;\n    }\n    printf(\""%d\"",a);\n}",ACCEPTED,7,488
1590977658547122176,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-11 16:00:07,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n\n#define M 100\n\nint main()\n\n{\n\n    int n,a[M],b[M],c[M],i,max;\n\n    scanf(\""%d\"",&n);\n\n    for(i=0;i<n;i++)\n\n    scanf(\""%d\"",&a[i]);\n\n    for(i=0;i<n;i++)\n\n    scanf(\""%d\"",&b[i]);\n\n    for(i=0;i<n;i++)\n\n    c[i]=b[i]-a[i]+c[i-1];\n\n    for(i=0;i<n;i++)\n\n    if(c[i]>c[i-1])\n\n    max=c[i];\n\n    printf(\""%d\\n\"",max);\n\n    return 0;\n\n}",WRONG_ANSWER,3,324
1590977737429397504,acfcf65f14b5d3b02c3225372654b4e21f04d33a8bbaeb346e4fb1d85f2ea94f,2022-11-11 16:00:26,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n  int t,n,i,r,g=pow(10,9);\n  scanf(\""%d\"",&t); \n  for(i=1;i<=t;i++)\n  {\n    scanf(\""%d\"",&n);\n    r=pow(6,n);\n      if(i<t,n>=0,n<=g)\n    printf(\""%d\\n\"",r%10);  \n      else\n    printf(\""%d\"",r%10);\n      if(n<=0,n>=g)\n          break;\n  }\n   return 0;\n}\n",WRONG_ANSWER,8,348
1590977748674347008,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 16:00:28,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc=new Scanner(System.in);\n        int x=sc.nextInt();\n        int[] n=new int[x];\n        for (int i = 0; i <x; i++) {\n            int q=sc.nextInt();\n            n[i]= (int) Math.pow(6,q);\n        }\n        for (int i = 0; i <x; i++){\n            if (i==x-1){\n                System.out.print(n[i]%10);\n            }else{\n                System.out.print(n[i]%10+\""\\n\"");\n            }\n        }\n    }\n}",TIME_LIMIT_EXCEEDED,150,16796
1590977776943935488,505c5b9a1b6d591a815315d95a57743fb98dad691b51421b4de282392fef3f43,2022-11-11 16:00:35,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,print(2022),ACCEPTED,16,2752
1590977791183597568,8cf8229a23351e1ca2a7bfc1ad0af3ab2ad4a709a7c796637dbdea7befc2b0ec,2022-11-11 16:00:39,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016," #include<stdio.h>\n#include<string.h>\n#include<math.h>\n\nint flag[10006];\nint num[10000],total,now,n;\n\nvoid solve(int index,int Mul,int K){\n      int i,t;\n   if(K==0){\n    now+=n/Mul;\n    return;\n   }\n   for(i=index;i<total-K+1;i++){\n     Mul*=num[i];\n     t=now;\n     if(Mul<=n){\n              solve(i+1,Mul,K-1);\n     }\n     if(t==now)//优化剪枝（1）\n      return;\n           Mul/=num[i];\n   }\n}\n\nint Judge(int x){\n int t,i;\n t=sqrt(x*1.0);\n for(i=2;i<=t;i++)\n  if(n%i==0)\n   return 0;\n return 1;\n}\n\nint main(){\n    int i,j,t,Count;\n memset(flag,0,sizeof(flag));\n for(i=2;i<=10000;i++){\n  if(flag[i])\n   continue;\n  for(j=2;j*i<=10000;j++)\n   flag[i*j]=1;\n }\n while(scanf(\""%d\"",&n)==1){\n  Count=0;\n  if(n<=10000){\n   for(i=2;i<n;i++)\n    if(!flag[i])\n     Count++;\n  }\n  else{\n   t=sqrt(1.0*n);\n   total=0;\n   for(i=2;i<=t;i++)\n    if(!flag[i])\n     num[total++]=i;\n   for(i=1;i<=total;i++){\n    now=0;\n    solve(0,1,i);\n    if(now==0)//优化(2)\n     break;\n    if(i&1)\n       Count+=now;\n    else\n       Count-=now;\n   }\n   Count-=total;\n   Count=n-Count-1;\n   if(Judge(n))\n    Count--;\n  }\n  printf(\""%d\\n\"",Count);\n }\n return 0;\n}\n\n",ACCEPTED,7,476
1590977843767607296,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-11-11 16:00:51,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,j,count=0;\n    for(i=1;i<=n;i++)\n    {\n        for(j=1;j<=i;j++)\n        {\n            if(i%j==0)\n            {\n                count++;\n            }\n        }\n        if(count==2)\n        {\n            printf(\""%d\"",i);\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,4,184
1590977983890919424,f1feb45d46abad163f730e5b023ce1df76883054d0a1741228a76c2c69aa3eda,2022-11-11 16:01:24,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n    int n,m,a[10];\n    scanf(\""%d\"",&n);\n    for(m=0;m<n;m++)\n        scanf(\""%d\"",&a[m]);\n    for(m=0;m<n;m++)\n        printf(\""%d\\n\"",(int)pow(6,a[m])%10);\n}",WRONG_ANSWER,6,340
1590977995475587072,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 16:01:27,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc=new Scanner(System.in);\n        int x=sc.nextInt();\n        int[] n=new int[x];\n        for (int i = 0; i <x; i++) {\n            int q=sc.nextInt();\n            n[i]= (int) Math.pow(6,q);\n        }\n        for (int i = 0; i <x; i++){\n            System.out.print(n[i]%10+\""\\n\"");\n        }\n    }\n}",TIME_LIMIT_EXCEEDED,150,18836
1590978022235246592,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 16:01:34,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc=new Scanner(System.in);\n        int x=sc.nextInt();\n        int[] n=new int[x];\n        for (int i = 0; i <x; i++) {\n            int q=sc.nextInt();\n            n[i]= (int) Math.pow(6,q);\n        }\n        for (int i = 0; i <x; i++){\n            System.out.print(n[i]%10+\""\\n\"");\n        }\n    }\n}",TIME_LIMIT_EXCEEDED,150,19004
1590978096013029376,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 16:01:51,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc=new Scanner(System.in);\n        int x=sc.nextInt();\n        int[] n=new int[x];\n        for (int i = 0; i <x; i++) {\n            int q=sc.nextInt();\n            n[i]= (int) Math.pow(6,q);\n        }\n        for (int i = 0; i <x; i++){\n            System.out.println(n[i]%10);\n        }\n    }\n}",NON_ZERO_EXIT_CODE,240,16452
1590978128523079680,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 16:01:59,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc=new Scanner(System.in);\n        int x=sc.nextInt();\n        int[] n=new int[x];\n        for (int i = 0; i <x; i++) {\n            int q=sc.nextInt();\n            n[i]= (int) Math.pow(6,q);\n        }\n        for (int i = 0; i <x; i++){\n            System.out.println(n[i]%10);\n        }\n    }\n}",NON_ZERO_EXIT_CODE,236,16548
1590978138622988288,40c43472973ea298adbdd1d4b900aeb63cfa4cfe17179f01a4827cd2c6624d3a,2022-11-11 16:02:01,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main(){\n    int n;\n    scanf(\""%d\"",&n);\n    int wi[n],wj[n],w[n];\n    int i,max=0,sum=0;\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&wi[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&wj[i]);\n\n    for(i=0;i<n;i++)\n        w[i]=wj[i]-wi[i];\n\n    for(i=0;i<n;i++)\n    {\n        sum+=w[i];\n        if(max<sum) max=sum;\n        if(sum<0) {\n            sum=0;\n            continue;\n        }\n    }\n    printf(\""%d\"",max);\n}\n\n",ACCEPTED,5,496
1590978161083461632,19b1d22e5c87afa9233c236fc7b4d5e0e70acf3872968cbe9aae96e75e9e38d1,2022-11-11 16:02:07,Python,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"a = input()\na1 = input().split(\"" \"")\na2 = input().split(\"" \"")\nb = [int(a2[i]) - int(a1[i]) for i in range(0, len(a2))]\nf=max(b)\nfor i in range(len(b)):\n    temp=0\n    for j in range(i,len(b)):\n        temp += b[j]\n        if temp>f :\n            f = temp\n\nprint(f)",ACCEPTED,15,2872
1590978179425173504,7222c2fb91a71fcf3f6560860557ab564f69a453594c9f1620ecc35bb26f5daf,2022-11-11 16:02:11,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"print(\""2022\"")",ACCEPTED,15,2876
1590978196483387392,f1feb45d46abad163f730e5b023ce1df76883054d0a1741228a76c2c69aa3eda,2022-11-11 16:02:15,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n    int n,m,a[10];\n    scanf(\""%d\"",&n);\n    for(m=0;m<n;m++)\n        scanf(\""%d\"",&a[m]);\n    for(m=0;m<n;m++){\n        printf(\""%d\"",(int)pow(6,a[m])%10);\n        if(m<n)\n            printf(\""\\n\"");\n    }\n}",WRONG_ANSWER,6,576
1590978255212056576,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-11 16:02:29,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\n#include<math.h>\nusing namespace std;\nint main() {\n\tint a, b, c;\n\tcin >> a;\n\tfor (int i = 1; i <= a; i++)\n\t{\n\t\tif (i < a)\n\t\t{\n\t\t\tcin >> b;\n\t\t\tc = (int)pow(6, b) % 10;\n\t\t\tcout << c << endl;\n\t\t}\n\t\telse {\n\t\t\tcin >> b;\n\t\t\tc = (int)pow(6, b) % 10;\n\t\t\tcout << c;\n\t\t}\n\t}\n\treturn 0;\n}",WRONG_ANSWER,9,472
1590978269451714560,887d1bbe53a4d4a349813887f13126da5e46a853687f4c2c9d7b8ef3d748a9d6,2022-11-11 16:02:33,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main(){\n    int n;\n    scanf(\""%d\"",&n);\n    int wi[n],wj[n],w[n];\n    int i,max=0,sum=0;\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&wi[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&wj[i]);\n\n    for(i=0;i<n;i++)\n        w[i]=wj[i]-wi[i];\n\n    for(i=0;i<n;i++)\n    {\n        sum+=w[i];\n        if(max<sum) max=sum;\n        if(sum<0) {\n            sum=0;\n            continue;\n        }\n    }\n    printf(\""%d\"",max);\n}\n\n",ACCEPTED,4,328
1590978329811943424,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 16:02:47,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc=new Scanner(System.in);\n        int x=sc.nextInt();\n        int[] n=new int[x];\n        for (int i = 0; i <x; i++) {\n            int q=sc.nextInt();\n            n[i]= (int) Math.pow(6,q);\n        }\n        for (int i = 0; i <x; i++){\n            System.out.println(n[i]%10);\n        }\n    }\n}",NON_ZERO_EXIT_CODE,257,16928
1590978357850865664,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-11 16:02:54,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"/*#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#include<string.h>\nint main()\n{int t,j,n;\nint x,len;\n char k[3000];\nscanf(\""%d\"",&t);\nint y[t];\nfor(j=0;j<t;j++)\n{\n    scanf(\""%d\"",&y[j]);\n\n}\nfor (j=0;j<t;j++)\n{\n     if(y[j]>=0&&y[j]<=int(pow(10,9))) {\n        k=char(pow(6,y[j]));\n        len=string(k);\n         x=int(k[len-1]);\n        printf(\""%d\"",x);\n     if(j<t-1) printf(\""\\n\"");\n}\n\nreturn 0;\n}\n}\n*/\n\n#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main()\n{int t,j,n,x;\nx=6;\nscanf(\""%d\"",&t);\nint y[t];\nfor(j=0;j<t;j++)\n{\n    scanf(\""%d\"",&y[j]);\n\n}\nfor (j=0;j<t;j++)\n{\n     if(y[j]>0&&y[j]<=int(pow(10,9))) {\n        //n=int(pow(6,0));\n        //x=int(pow(6,y[j]))%10;\n        printf(\""%d\"",x);\n     if(j<t-1) printf(\""\\n\"");\n}\n    if(y[j]==0)\n    {\n        printf(\""1\"");\n        if(j<t-1) printf(\""\\n\"");\n    }\n}\nreturn 0;\n}",WRONG_ANSWER,8,368
1590978427950268416,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-11-11 16:03:10,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,j,count=0;\n    for(n=2;n<=100000;n++)\n    {\n        for(j=1;j<=n;j++)\n        {\n            if(n%j==0)\n            {\n                count++;\n            }\n        }\n        if(count==2)\n        {\n            printf(\""%d\"",n);\n        }\n    }\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,1000,304
1590978447399235584,f1feb45d46abad163f730e5b023ce1df76883054d0a1741228a76c2c69aa3eda,2022-11-11 16:03:15,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n    int n,m,a[10];\n    scanf(\""%d\"",&n);\n    for(m=0;m<n;m++)\n        scanf(\""%d\"",&a[m]);\n    for(m=0;m<n;m++){\n        printf(\""%d\"",(int)pow(6,a[m])%10);\n        if(m<n-1)\n            printf(\""\\n\"");\n    }\n}",WRONG_ANSWER,7,312
1590978465220833280,33bf53cc1ac96b08f54401ab68b14c30e1f5caef149cc9332585b7c5f09675ed,2022-11-11 16:03:19,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\n#include <cmath>\nusing namespace std;\nint main()\n{\n    int t , i , re ;\n    long in;\n    cin >> t ;\n    int shu[t] ;\n    for (i = 0 ; i < t ; i++ )\n    {\n        cin >> shu[i];\n    }\n    for (i = 0 ; i < t ; i++ )\n    {\n        in = pow( 6 , shu[ i ] ) ;\n\t\tre = in % 10 ;\n        cout << re << endl;\n    }\n    return 0;\n}",WRONG_ANSWER,7,460
1590978465904504832,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-11 16:03:19,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#define MAXSIZE 20\nint main()\n{\n    int n,i,j,k;\n    int sum;\n    int max;\n    int ex[MAXSIZE];\n    int ge[MAXSIZE];\n    int Laur[MAXSIZE];\n    int Saya[MAXSIZE];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {scanf(\""%d\"",&ex[i]);}\n    for(i=0;i<n;i++)\n    {scanf(\""%d\"",&ge[i]);}\n  for(i=0;i<n;i++)\n  {     sum=0;\n       for(j=i;j<n;i++)\n       {\n        Laur[i]=sum+ex[i]+ge[i];\n        sum=Laur[i];\n       }\n      max=0;\n    for(k=i;k<n;k++)\n    {max=(max>Laur[i])?max:Laur[i];}\n     Saya[i]=max;\n  }\n    return 0;\n}",TIME_LIMIT_EXCEEDED,400,484
1590978500117442560,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-11-11 16:03:28,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,j,count=0;\n    for(n=2;n<=100000;n++)\n    {\n        for(j=1;j<=n;j++)\n        {\n            if(n%j==0)\n            {\n                count++;\n            }\n        }\n        if(count==2)\n        {\n            printf(\""%d\"",n);\n        }\n    }\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,1000,352
1590978505574252544,44042a4519c9231aa21c54eb113b7a08f98bcd7db4839a20a61ab6ce51fce357,2022-11-11 16:03:29,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int n;\n    int i;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=1;i<=n;i++)\n    {\n        if(i==1)\n            scanf(\""%d\"",&a[i]);\n        else\n            scanf(\""% d\"",&a[n]);\n    }\n    for(i=1;i<=n;i++)\n        b[i]=pow(6,a[i]);\n    for(i=1;i<=n;i++)\n    {\n        if(i==1)\n        {\n            if(a[i]==0)\n                printf(\""0\"");\n            else\n                printf(\""6\"");\n        }\n        else\n        {\n            if(a[i]==0)\n                printf(\""0\"");\n            else\n                printf(\""\\n6\"");\n        }\n\n\n    }\n    return 0;\n}\n",WRONG_ANSWER,3,344
1590978533206306816,46a5b5de1986c03ade4ef3715390240d3b4a1729dbb6afcb5e53fc1bee0f1a07,2022-11-11 16:03:35,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n  public static void main(String[] args) {\n\t\t Scanner sc=new Scanner(System.in);\n\t     int x=sc.nextInt();\n\t     int array[]=new int[20];\n\t\t double b=0;\n\t     for(int i=0;i<x;i++) {\n\t    \t array[i]=sc.nextInt();\n\t     }\n\t     for(int i=1;i<=x;i++) {\n\t    \t for(int j=0;j<i;j++) {\n\t    \t\t b=Math.pow(6,array[j]);\t \n\t    \t\t System.out.println(b%10);\n\t    \t}\n\t     }\n\t     sc.close();\n\t}\n}\n",WRONG_ANSWER,126,16596
1590978580736159744,44042a4519c9231aa21c54eb113b7a08f98bcd7db4839a20a61ab6ce51fce357,2022-11-11 16:03:47,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int n;\n    int i;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=1;i<=n;i++)\n    {\n        if(i==1)\n            scanf(\""%d\"",&a[i]);\n        else\n            scanf(\""% d\"",&a[n]);\n    }\n    for(i=1;i<=n;i++)\n        b[i]=pow(6,a[i]);\n    for(i=1;i<=n;i++)\n    {\n        if(i==1)\n        {\n            if(a[i]==0)\n                printf(\""0\"");\n            else\n                printf(\""6\"");\n        }\n        else\n        {\n            if(a[i]==0)\n                printf(\""\\n0\"");\n            else\n                printf(\""\\n6\"");\n        }\n\n\n    }\n    return 0;\n}\n",WRONG_ANSWER,4,312
1590978603167318016,44042a4519c9231aa21c54eb113b7a08f98bcd7db4839a20a61ab6ce51fce357,2022-11-11 16:03:52,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int n;\n    int i;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=1;i<=n;i++)\n    {\n        if(i==1)\n            scanf(\""%d\"",&a[i]);\n        else\n            scanf(\""% d\"",&a[n]);\n    }\n    for(i=1;i<=n;i++)\n        b[i]=pow(6,a[i]);\n    for(i=1;i<=n;i++)\n    {\n        if(i==1)\n        {\n            if(a[i]==0)\n                printf(\""0\"");\n            else\n                printf(\""6\"");\n        }\n        else\n        {\n            if(a[i]==0)\n                printf(\""\\n0\"");\n            else\n                printf(\""\\n6\"");\n        }\n\n\n    }\n    return 0;\n}\n",WRONG_ANSWER,4,324
1590978711346810880,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 16:04:18,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t,i;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<t;i++)\n    if(a[i]<1)\n    printf(\""1\\n\"");\n    else\n    printf(\""6\\n\"");\n    return 0;\n}",WRONG_ANSWER,7,364
1590978718116417536,4812f9582f90b7f3f95178a62ec39f3555e90b935658da3e31a47fe0d2e8c6fd,2022-11-11 16:04:20,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n int  b, n, i, k = 0, f;\n scanf(\"" %d\"", &b);\n for (n = 1; n <= b; n++)\n{\n  f = 1;\n  for (i = 2; i <= sqrt(n); i++)\n     if (n % i == 0) {\n    f = 0;\n    break;\n                  }\n  if (f == 1)\n   k++;\n  if (n == b)\n   printf(\""%d\"", k);\n\n}\n\n}\n",NON_ZERO_EXIT_CODE,15,2880
1590978774408167424,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 16:04:33,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc=new Scanner(System.in);\n        int x=sc.nextInt();\n        int[] n=new int[x];\n        for (int i = 0; i <x; i++) {\n            int q=sc.nextInt();\n            n[i]= (int) Math.pow(6,q);\n        }\n        for (int i = 0; i <x; i++){\n            System.out.println(n[i]%10);\n        }\n    }\n}",WRONG_ANSWER,260,16716
1590978854716506112,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-11 16:04:52,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"num = int(input())\na=1\nfor i in range(0,num):\n    for j in range(2,i):\n        if(i%j==0):\n            break\n        elif j==i-1:\n            a+=1\nprint(a)\n",TIME_LIMIT_EXCEEDED,1000,2924
1590978902518988800,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 16:05:03,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nmain()\n{\n    int n,w[10],v[10],i,max,sum=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&w[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&v[i]);\n    max=v[i]-w[i];\n    for(i=0;i<n;i++)\n    {\n        sum=v[i]-w[i]+sum;\n        if(sum>max) max=sum;\n    }\n    printf(\""%d\"",max);\n\n}\n",RUNTIME_ERROR,3,444
1590978907191443456,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-11 16:05:05,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#define MAXSIZE 20\nint main()\n{\n    int n,i,j,k;\n    int sum;\n    int max;\n    int ex[MAXSIZE];\n    int ge[MAXSIZE];\n    int Laur[MAXSIZE];\n    int Saya[MAXSIZE];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {scanf(\""%d\"",&ex[i]);}\n    for(i=0;i<n;i++)\n    {scanf(\""%d\"",&ge[i]);}\n  for(i=0;i<n;i++)\n  {     sum=0;\n       for(j=i;j<n;i++)\n       {\n        Laur[i]=sum+ex[i]+ge[i];\n        sum=Laur[i];\n       }\n      max=0;\n    for(k=i;k<n;k++)\n    {max=(max>Laur[i])?max:Laur[i];}\n     Saya[i]=max;\n  }\n    max=0;\n    for(i=0;i<n;i++)\n    {max=(max>Saya[i])?max:Saya[i];}\n    return 0;\n}",TIME_LIMIT_EXCEEDED,400,324
1590978917203251200,eee658ba43cf6fba46676f4d9f167223fd9b57ec54a5d813fd1d01afc3088139,2022-11-11 16:05:07,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int t,n,i=1,m,x=pow(10,9);\n    scanf (\""%d\\n\"",&t);\n    while(i<=t)\n    {\n      scanf (\""%d\\n\"",&n);\n      if(0<=n<=x)\n      {\n        m=pow(6,n);\n        m=m/1%10;\n        printf (\""%d\"",m);\n      }\n        if(i<t)\n        {\n            printf (\""\\n\"");\n        }\n        i++;\n    }\n    return 0;\n}",WRONG_ANSWER,8,196
1590978919577223168,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-11 16:05:08,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"num = int(input())\na=1\nfor i in range(0,num):\n    for j in range(2,i):\n        if(i%j==0):\n            break\n        elif j==i-1:\n            a+=1\nprint(a)\n",TIME_LIMIT_EXCEEDED,1000,2964
1590978922672619520,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-11 16:05:08,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"/*#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#include<string.h>\nint main()\n{int t,j,n;\nint x,len;\n char k[3000];\nscanf(\""%d\"",&t);\nint y[t];\nfor(j=0;j<t;j++)\n{\n    scanf(\""%d\"",&y[j]);\n\n}\nfor (j=0;j<t;j++)\n{\n     if(y[j]>=0&&y[j]<=int(pow(10,9))) {\n        k=char(pow(6,y[j]));\n        len=string(k);\n         x=int(k[len-1]);\n        printf(\""%d\"",x);\n     if(j<t-1) printf(\""\\n\"");\n}\n\nreturn 0;\n}\n}\n*/\n\n#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main()\n{int t,j,n,x;\nx=6;\nscanf(\""%d\"",&t);\nint y[t];\nfor(j=0;j<t;j++)\n{\n    scanf(\""%d\"",&y[j]);\n\n}\nfor (j=0;j<t;j++)\n{\n     if(y[j]>0&&y[j]<=int(pow(10,9))) {\n        //n=int(pow(6,0));\n        //x=int(pow(6,y[j]))%10;\n        printf(\""%d\"",x);\n     if(j<t-1) printf(\""\\n\"");\n}\n    /*if(y[j]==0)\n    {\n        printf(\""1\"");\n        if(j<t-1) printf(\""\\n\"");\n    }*/\n}\nreturn 0;\n}",WRONG_ANSWER,6,328
1590978963302821888,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 16:05:18,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc=new Scanner(System.in);\n        int x=sc.nextInt();\n        int[] n=new int[x];\n        for (int i = 0; i <x; i++) {\n            int q=sc.nextInt();\n            n[i]= (int) Math.pow(6,q);\n        }\n        for (int i = 0; i <x; i++){\n            if (i==x-1){\n                System.out.print(n[i]%10);\n            }else{\n                System.out.println(n[i]%10);\n            }\n        }\n    }\n}",WRONG_ANSWER,248,19844
1590979008379006976,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 16:05:29,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t,i;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<t;i++)\n    if(a[i]<1)\n    printf(\""1\\n\"");\n    else\n    printf(\""6\\n\"");\n    return 0;\n}",WRONG_ANSWER,7,316
1590979089782059008,f1feb45d46abad163f730e5b023ce1df76883054d0a1741228a76c2c69aa3eda,2022-11-11 16:05:48,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n    int i,j,k;\n    scanf(\""%d\"",&i);\n    for(j=0;j<i;j++){\n        scanf(\""%d\"",&k);\n        printf(\""%d\"",(int)pow(6,k)%10);\n        if(j<i-1)\n            printf(\""\\n\"");\n    }\n}",WRONG_ANSWER,7,372
1590979140000460800,4d1157ac6ad50cfc6ca5d6b3e1c2dd7f1ecc593df10ff6888d4207a4f1c03a35,2022-11-11 16:06:00,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n   int n,a;\n    cin>>n;\n    for(int i=1;i<=n;i++)\n    {\n        cin>>a;\n        if(a==0)printf(\""0\"");\n        else printf(\""6\"");\n        if(i!=n)printf(\""\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,13,480
1590979143242678272,f1feb45d46abad163f730e5b023ce1df76883054d0a1741228a76c2c69aa3eda,2022-11-11 16:06:01,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n    int i,j,k;\n    scanf(\""%d\"",&i);\n    for(j=0;j<i;j++){\n        scanf(\""%d\"",&k);\n        printf(\""%d\"",(int)pow(6,k)%10);\n        if(j<i-1)\n            printf(\""\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,8,320
1590979174553161728,4d1157ac6ad50cfc6ca5d6b3e1c2dd7f1ecc593df10ff6888d4207a4f1c03a35,2022-11-11 16:06:08,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n   int n,a;\n    cin>>n;\n    for(int i=1;i<=n;i++)\n    {\n        cin>>a;\n        if(a==0)printf(\""0\"");\n        else printf(\""6\"");\n        if(i!=n)printf(\""\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,13,500
1590979189229031424,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 16:06:12,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nmain()\n{\n    int n,w[10],v[10],i,max,sum=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&w[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&v[i]);\n    max=v[i]-w[i];\n    for(i=0;i<n;i++)\n    {\n        sum=v[i]-w[i]+sum;\n        if(sum>max) max=sum;\n    }\n    printf(\""%d\"",max);\n\n}\n",RUNTIME_ERROR,4,320
1590979210150215680,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 16:06:17,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nmain()\n{\n    int n,w[10],v[10],i,max,sum=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&w[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&v[i]);\n    max=v[i]-w[i];\n    for(i=0;i<n;i++)\n    {\n        sum=v[i]-w[i]+sum;\n        if(sum>max) max=sum;\n    }\n    printf(\""%d\"",max);\n\n}\n",RUNTIME_ERROR,6,436
1590979335312441344,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-11 16:06:47,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"/*#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#include<string.h>\nint main()\n{int t,j,n;\nint x,len;\n char k[3000];\nscanf(\""%d\"",&t);\nint y[t];\nfor(j=0;j<t;j++)\n{\n    scanf(\""%d\"",&y[j]);\n\n}\nfor (j=0;j<t;j++)\n{\n     if(y[j]>=0&&y[j]<=int(pow(10,9))) {\n        k=char(pow(6,y[j]));\n        len=string(k);\n         x=int(k[len-1]);\n        printf(\""%d\"",x);\n     if(j<t-1) printf(\""\\n\"");\n}\n\nreturn 0;\n}\n}\n*/\n\n#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main()\n{int t,j,n,x;\nx=6;\nscanf(\""%d\"",&t);\nint y[t];\nfor(j=0;j<t;j++)\n{\n    scanf(\""%d\"",&y[j]);\n\n}\nfor (j=0;j<t;j++)\n{\n     if(y[j]>0&&y[j]<=int(pow(10,9))) {\n        //n=int(pow(6,0));\n        //x=int(pow(6,y[j]))%10;\n        printf(\""%d\\n\"",x);\n     //if(j<t-1) printf(\""\\n\"");\n}\n    /*if(y[j]==0)\n    {\n        printf(\""1\"");\n        if(j<t-1) printf(\""\\n\"");\n    }*/\n}\nreturn 0;\n}",WRONG_ANSWER,6,344
1590979405499904000,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 16:07:03,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nmain()\n{\n    int n,w[10],v[10],i,max,sum=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&w[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&v[i]);\n    max=v[i]-w[i];\n    for(i=0;i<n;i++)\n    {\n        sum=v[i]-w[i]+sum;\n        if(sum>max) max=sum;\n    }\n    printf(\""%d\"",max);\n\n}\n",RUNTIME_ERROR,4,588
1590979459300241408,423e1acd0d02cf3d43f3c7805099dea4edcb39c2e0fa385e82823b5a7c0dd214,2022-11-11 16:07:16,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"int main()\n{\n    int t;\n    scanf(\""%d\"", &t);\n    int n[100];\n    int i,a;\n    for (i = 0; i < t; i++)\n        scanf(\""%d\"", &n[i]);\n     for (i = 0; i < t;i++)\n    {\n        a = pow(6,n[i]);\n         if(i>0)\n             printf(\""\\n\"");\n        printf(\""%d\"", a % 10);\n    }\n return 0;\n}",WRONG_ANSWER,6,340
1590979506880450560,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-11 16:07:28,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"/*#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#include<string.h>\nint main()\n{int t,j,n;\nint x,len;\n char k[3000];\nscanf(\""%d\"",&t);\nint y[t];\nfor(j=0;j<t;j++)\n{\n    scanf(\""%d\"",&y[j]);\n\n}\nfor (j=0;j<t;j++)\n{\n     if(y[j]>=0&&y[j]<=int(pow(10,9))) {\n        k=char(pow(6,y[j]));\n        len=string(k);\n         x=int(k[len-1]);\n        printf(\""%d\"",x);\n     if(j<t-1) printf(\""\\n\"");\n}\n\nreturn 0;\n}\n}\n*/\n\n#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main()\n{int t,j,n,x;\nx=6;\nscanf(\""%d\"",&t);\nint y[t];\nfor(j=0;j<t;j++)\n{\n    scanf(\""%d\"",&y[j]);\n\n}\nfor (j=0;j<t;j++)\n{\n     if(y[j]>0&&y[j]<=int(pow(10,9))) {\n        //n=int(pow(6,0));\n        //x=int(pow(6,y[j]))%10;\n        printf(\""%d\"",x);\n     //if(j<t-1) printf(\""\\n\"");\n}printf(\""\\n\"");\n    /*if(y[j]==0)\n    {\n        printf(\""1\"");\n        if(j<t-1) printf(\""\\n\"");\n    }*/\n}\nreturn 0;\n}",WRONG_ANSWER,6,316
1590979518410588160,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 16:07:30,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>>\n\nint main()\n{\n    int t,i,n,a[100];\n    scanf(\""%d\\n\"",&t);\n    for(i=0;i<t;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<t-1;i++)\n    {\n        if(a[i]<0||a[i]>pow(10,9))\n            printf(\""输入错误\\n\"");\n        else n=pow(6,a[i]),printf(\""%d\\n\"",n%10);\n    }\n    return 0;\n}\n",WRONG_ANSWER,3,328
1590979518729334784,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-11-11 16:07:30,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,count=0;\n    for(n=2;n<=100000;n++)\n    {\n        for(i=2;i<=n;i++)\n        {\n            if(n%i==0)\n            {\n                count++;\n            }\n\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,3,348
1590979571313348608,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 16:07:43,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>>\n\nint main()\n{\n    int t,i,n,a[100];\n    scan(\""%d\\n\"",&t);\n    for(i=0;i<t;i++)\n        scan(\""%d\"",&a[i]);\n    for(i=0;i<t-1;i++)\n    {\n        if(a[i]<0||a[i]>pow(10,9))\n            printf(\""输入错误\\n\"");\n        else n=pow(6,a[i]),printf(\""%d\\n\"",n%10);\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590979600828665856,ece045c1570c74e6800520e16047010817642535f83b9f2b4524ebdcf9d7925a,2022-11-11 16:07:50,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main() {\n\tint n,i;\n\tint a[10],b[10];\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<10;i++)\n\tscanf(\""%d\"",&a[i]);\n\tfor(i=0;i<10;i++)\n\tscanf(\""%d\"",&b[i]);\n\tprintf(\""25\"");\n}",WRONG_ANSWER,4,364
1590979616624390144,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 16:07:54,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>>\n\nint main()\n{\n    int t,i,n,a[100];\n    scanf (\""%d\\n\"",&t);\n    for(i=0;i<t;i++)\n        scanf (\""%d\"",&a[i]);\n    for(i=0;i<t-1;i++)\n    {\n        if(a[i]<0||a[i]>pow(10,9))\n            printf(\""输入错误\\n\"");\n        else n=pow(6,a[i]),printf(\""%d\\n\"",n%10);\n    }\n    return 0;\n}\n",WRONG_ANSWER,4,308
1590979651273535488,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 16:08:02,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nmain()\n{\n    int n,w[10],v[10],i,max,sum=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&w[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&v[i]);\n    max=v[i]-w[i];\n    for(i=0;i<n;i++)\n    {\n        sum=v[i]-w[i]+sum;\n        if(sum>max) max=sum;\n    }\n    printf(\""%d\"",max);\n\n}\n",RUNTIME_ERROR,3,320
1590979657833451520,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-11 16:08:04,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"X=A,Y=B,C=Z;\n0=<A,B,C<=100;\nprint(X+Y-Z)；",NON_ZERO_EXIT_CODE,18,2752
1590979662707228672,2e4af98c441106efa9ee51f8a781d0eee91a3dff6193987d421eb3a48725c814,2022-11-11 16:08:05,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <iostream>\n\nusing namespace std;\n\nint main() {\n    int n, i;\n    scanf(\""%d\"", &n);\n    int a1[n], b1[n], c1[n];\n\n    for (int j = 0; j < n; ++j) {\n        scanf(\""%d\"", &a1[j]);\n    }\n    for (int j = 0; j < n; ++j) {\n        scanf(\""%d\"", &b1[j]);\n    }\n    for (i = 0; i < n; ++i) {\n        c1[i] = b1[i] - a1[i];\n    }\n//    for (int j = 0; j < n; ++j) {\n////        printf(\""%d \"", c1[j]);\n//    }\n//    -1 -1 -1 969 -1 -1 -1 -1 563;\n    int j = n, temp;\n    i = 0;\n    while (i < n && c1[i++] < 0);\n    temp = c1[i - 1];\n//    printf(\""temp=%d\\n\"", temp);\n//    printf(\""i=%d\\n\"", i);\n    while (j > 0 && c1[--j] <= 0);\n//    printf(\""j=%d\\n\"", j);\n//    printf(\""===================\\n\"");\n    for (int k = i; k < j + 1; ++k) {\n        if (temp <= 0) {\n            temp = c1[k + 1];\n            k++;\n            continue;\n        }\n        temp += c1[k];\n//        printf(\""%d\\n\"", temp);\n    }\n    printf(\""%d\"", temp);\n    return 0;\n}\n\n\n",WRONG_ANSWER,4,440
1590979721473601536,e3700fa579dc7c925fa010ac870390ba9776ef5ee08f67752aeef4a9467c7624,2022-11-11 16:08:19,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int i,j,n=0,x,flag;\n    scanf(\""%d\"",&x);\n    for (i=2;i<x;i++)\n    {\n        flag=0;\n        for(j=2;j<i;j++)\n        {\n            if(i%j==0)\n                {\n                flag++;\n                 break;\n                }\n        }\n        if (flag==0)\n            n=n+1;\n    }\n    printf(\""%d\"",n);\n    return 0;\n}\n",ACCEPTED,999,344
1590979728872353792,46a5b5de1986c03ade4ef3715390240d3b4a1729dbb6afcb5e53fc1bee0f1a07,2022-11-11 16:08:20,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n\t\t Scanner sc=new Scanner(System.in);\n\t     int x=sc.nextInt();\n\t     int array[]=new int[20];\n\t\t int b=0;\n\t     for(int i=0;i<x;i++) {\n\t    \t array[i]=sc.nextInt();\n\t     }\n\t     for(int i=1;i<=x;i++) {\n\t    \t for(int j=0;j<i;j++) {\n\t    \t\t b=(int) Math.pow(6,array[j]);\t \n\t    \t}\n\t    \t System.out.println(b%10);\n\t     }\n\t     sc.close();\n\t}\n}\n",NON_ZERO_EXIT_CODE,249,19484
1590979761197854720,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 16:08:28,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"", &n);\n    int arr1[10000] = { 0 };\n    int arr2[10000] = { 0 };\n    for (int i = 0; i < n; ++i)\n    {\n        scanf(\""%d\"", &arr1[i]);\n    }\n    for (int j = 0; j < n; ++j)\n    {\n        scanf(\""%d\"", &arr2[j]);\n    }\n    int max1 = 0, max2 = 0, max3 = 0, count = 0, k = 0;\n    for (k = 0; k < n; ++k)\n    {\n        int sum = arr2[k] - arr1[k];\n        if (sum <= 0)\n        {\n            if (max3 == 0)\n            {\n                max3 = sum;\n            }\n            if (sum > max3)\n            {\n                max3 = sum;\n            }\n            count++;\n            if (max1 < max2)\n            {\n                max1 = max2;\n            }\n            max2 = 0;\n        }\n        else\n        {\n            max2 += sum;\n        }\n    }\n    if (count == n)\n    {\n        printf(\""%d\"", max3);\n    }\n    else\n    {\n        int max = max1 > max2 ? max1 : max2;\n        printf(\""%d\"", max);\n    }\n    return 0;\n}",WRONG_ANSWER,5,336
1590979761986404352,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 16:08:28,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n\nmain()\n{\n    int n,w[10],v[10],i,max,sum=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&w[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&v[i]);\n    max=v[i]-w[i];\n    for(i=0;i<n;i++)\n    {\n        sum=v[i]-w[i]+sum;\n        if(sum>max) max=sum;\n    }\n    printf(\""%d\"",max);\n\n}\n",RUNTIME_ERROR,3,456
1590979766851776512,3dcf32868d7a750bb24733cc752e8b34486b532e90524d2606d8643387f183e4,2022-11-11 16:08:30,C++,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include \""bits/stdc++.h\""\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> PII;\n#define rep(i,a,n) for(int i = a; i < n; i++)\n#define per(i,n,a) for(int i = n-1; i >= a; i--)\n#define debug(a) printf(\""#: %d \"",a);\n#define fr first\n#define se second\n#define be begin()\n#define ed end()\n#define pb push_back\n#define mk make_pair\n#define pf printf\n#define ins insert\n#define sz size()\n//#define int long long\n#define mem(a,i) memset(a,i,sizeof (a))\n\n//char buf[1<<23],*p1=buf,*p2=buf;\n//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)\n//inline ll read()\n//{\n//    int s=0;\n//    char ch = getchar(),last;\n//    while(ch<'0'||ch>'9') last = ch, ch = getchar();\n//    while(ch>='0'&&ch<='9') s=(s<<1)+(s<<3)+(ch^48),ch=getchar();\n//    return last=='-'?-s:s;\n//}\n\ninline ll read(){\n    ll x = 0,f = 1;\n    char ch = getchar();\n    while(ch < '0'||ch > '9'){\n        if(ch == '-')\n            f = -1;\n        ch = getchar();\n    }\n    while(ch >= '0' && ch <= '9'){\n        x = (x << 1)+(x << 3)+(ch^48);\n        ch = getchar();\n    }\n    return x*f;\n}\nconst int MOD = 1000000007;\nll INF = 1e18;\nll gcd(ll a,ll b){\n    return b ? gcd(b,a%b) : a;\n}\nconst int N = 3e5 + 10;\n//struct edge{\n//    int to,next,w;\n//}eg[N];+\n//bool st[N];\n//void add(int u,int v,int w){\n//    eg[++tot].w = w;eg[tot].to = v;eg[tot].next = head[u];head[u] = tot;\n//}\n\n//int C[100010][3];\n//void Cn(){\n//    for(int i=0;i<100010;i++)for(int j = 0;j <= 2;j++)if(!j) C[i][j] = 1;else C[i][j] = (C[i-1][j]+C[i-1][j-1]);\n//}\nll lowbit(ll x){\n    return x%(-x);\n}\nll a[1000];\nvoid solve(){\n   ll n = read();\n   rep(i,1,n+1)a[i] -= read();\n   rep(i,1,n+1)a[i] += read();\n   ll ans = 0,now = 0;\n   rep(i,1,n+1){\n       if(now + a[i] < 0){\n            now = 0;     \n       }else{\n           now += a[i];\n       }\n       ans = max(ans,now);\n   }\n    printf(\""%lld\\n\"",ans);\n}\nsigned  main(){\n//    ll t = read();\n//    while(t--)\n        solve();\n}\n",ACCEPTED,3,492
1590979790461534208,44042a4519c9231aa21c54eb113b7a08f98bcd7db4839a20a61ab6ce51fce357,2022-11-11 16:08:35,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int n;\n    int i;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=1;i<=n;i++)\n    {\n        if(i==1)\n            scanf(\""%d\"",&a[-1]);\n        else\n            scanf(\""% d\"",&a[i-1]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if(i==0)\n            if(a[i]=0)\n                printf(\""1\"");\n        else\n        {\n            if(a[i]==0)\n                printf(\""\\n1\"");\n            else\n                printf(\""\\n6\"")\n        }\n        \n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590979797809934336,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 16:08:37,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"", &n);\n    int arr1[10000] = { 0 };\n    int arr2[10000] = { 0 };\n    for (int i = 0; i < n; ++i)\n    {\n        scanf(\""%d\"", &arr1[i]);\n    }\n    for (int j = 0; j < n; ++j)\n    {\n        scanf(\""%d\"", &arr2[j]);\n    }\n    int max1 = 0, max2 = 0, max3 = 0, count = 0, k = 0;\n    for (k = 0; k < n; ++k)\n    {\n        int sum = arr2[k] - arr1[k];\n        if (sum <= 0)\n        {\n            if (max3 == 0)\n            {\n                max3 = sum;\n            }\n            if (sum > max3)\n            {\n                max3 = sum;\n            }\n            count++;\n            if (max1 < max2)\n            {\n                max1 = max2;\n            }\n            max2 = 0;\n        }\n        else\n        {\n            max2 += sum;\n        }\n    }\n    if (count == n)\n    {\n        printf(\""%d\"", max3);\n    }\n    else\n    {\n        int max = max1 > max2 ? max1 : max2;\n        printf(\""%d\"", max);\n    }\n    return 0;\n}",WRONG_ANSWER,3,328
1590979831171448832,423e1acd0d02cf3d43f3c7805099dea4edcb39c2e0fa385e82823b5a7c0dd214,2022-11-11 16:08:45,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"\n#include <stdio.h>\n#include<math.h>\nint main()\n{\n    int t;\n    scanf(\""%d\"", &t);\n    int n[100];\n    int i,a;\n    for (i = 0; i < t; i++)\n        scanf(\""%d\"", &n[i]);\n     for (i = 0; i < t;i++)\n    {\n        a = pow(6,n[i]);\n         if(i>0)\n             printf(\""\\n\"");\n        printf(\""%d\"", a % 10);\n    }\n return 0;\n}",WRONG_ANSWER,6,480
1590979848376463360,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-11 16:08:49,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"X=8,Y=7,Z=3;\n0=<8,7,3<=100;\nprint(X+Y-Z)；",NON_ZERO_EXIT_CODE,16,2752
1590979901883199488,44042a4519c9231aa21c54eb113b7a08f98bcd7db4839a20a61ab6ce51fce357,2022-11-11 16:09:02,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int n;\n    int i;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=1;i<=n;i++)\n    {\n        if(i==1)\n            scanf(\""%d\"",&a[i-1]);\n        else\n            scanf(\""% d\"",&a[i-1]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if(i==0)\n            if(a[i]=0)\n                printf(\""1\"");\n        else\n        {\n            if(a[i]==0)\n                printf(\""\\n1\"");\n            else\n                printf(\""\\n6\"")\n        }\n        \n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590979914218672128,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 16:09:05,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc=new Scanner(System.in);\n        int x=sc.nextInt();\n        int[] n=new int[x];\n        for (int i = 0; i <x; i++) {\n            int q=sc.nextInt();\n            n[i]= (int) Math.pow(6,q);\n        }\n        for (int i = 0; i <x; i++){\n            System.out.println(n[i]%10);\n        }\n    }\n}",NON_ZERO_EXIT_CODE,248,19000
1590979925396467712,2cb092ec618cde3657d677b73f7a0a7bfb1e0da02f466007878113e6c4db4792,2022-11-11 16:09:07,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include<math.h>\n#include <stdlib.h>\nint main()\n{\n    int n,a,c;\n    double b;\n    scanf(\""%d\"",&n);\n    while(n--)\n    {\n        scanf(\""%d\"",&a);\n        b=pow(6,a);\n        c=(int)b%10;\n        printf(\""%d\\n\"",c);\n    }\n     return 0;\n}\n",WRONG_ANSWER,9,344
1590979930446409728,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-11 16:09:09,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"num = int(input())\nlist = input().split(\"" \"")\nfor i in range(num):\n    x = int(list[i])\n    y = (6**x)%10\n    i+=1\n    print(y)",TIME_LIMIT_EXCEEDED,166,4068
1590979933537636352,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 16:09:09,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc=new Scanner(System.in);\n        int x=sc.nextInt();\n        int[] n=new int[x];\n        for (int i = 0; i <x; i++) {\n            int q=sc.nextInt();\n            n[i]= (int) Math.pow(6,q);\n        }\n        for (int i = 0; i <x; i++){\n            System.out.println(n[i]%10);\n        }\n    }\n}",NON_ZERO_EXIT_CODE,234,16484
1590979972594991104,4d1157ac6ad50cfc6ca5d6b3e1c2dd7f1ecc593df10ff6888d4207a4f1c03a35,2022-11-11 16:09:19,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n   int n,a;\n    cin>>n;\n    for(int i=1;i<=n;i++)\n    {\n        cin>>a;\n        if(a==0)printf(\""0\"");\n        else printf(\""6\"");\n        if(i!=n)printf(\""\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,13,468
1590979972687269888,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 16:09:19,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\nint a[100],n,i;\n\n    scanf(\""%d\"",&n);\nfor(i=0;i<n;i++)\n{\n\tscanf(\""%d\"",&a[i]);\n\n}\n    for(i=0;i<n;i++)\n    {\n        if(i=0)\n            printf(\""%d\\n\"",1);\n        else\nprintf(\""%d\\n\"",6);\n    }\n    return 0;\n}\n\n\n\n\n\n\n\n\n\n",TIME_LIMIT_EXCEEDED,20,1344
1590979981788909568,44042a4519c9231aa21c54eb113b7a08f98bcd7db4839a20a61ab6ce51fce357,2022-11-11 16:09:21,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int n;\n    int i;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=1;i<=n;i++)\n    {\n        if(i==1)\n            scanf(\""%d\"",&a[i-1]);\n        else\n            scanf(\""% d\"",&a[i-1]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if(i==0)\n            if(a[i]=0)\n                printf(\""1\"");\n        else\n        {\n            if(a[i]==0)\n                printf(\""\\n1\"");\n            else\n                printf(\""\\n6\"");\n        }\n        \n    }\n    return 0;\n}\n",WRONG_ANSWER,3,188
1590980025174790144,7222c2fb91a71fcf3f6560860557ab564f69a453594c9f1620ecc35bb26f5daf,2022-11-11 16:09:31,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"X=int(input())\nY=int(input())\nZ=int(input())\nprint(\""%d\"" %(X+Y-Z))",NON_ZERO_EXIT_CODE,16,2748
1590980050453856256,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 16:09:37,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\nint a[100],n,i;\n\n    scanf(\""%d\"",&n);\nfor(i=0;i<n;i++)\n{\n\tscanf(\""%d\"",&a[i]);\n\n        if(i=0)\n            printf(\""%d\\n\"",1);\n        else\nprintf(\""%d\\n\"",6);\n}\n    \n \n      \n \n    return 0;\n}\n\n\n\n\n\n\n\n\n\n",TIME_LIMIT_EXCEEDED,20,336
1590980056376213504,fa305ee4bf4c6a54add4e945b551f1e902b95c1a179a91ded55bf7ebb1c87c23,2022-11-11 16:09:39,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{  int a[50],b[50],i,j,x,s[50]={0},sum[50];\n\n    scanf(\""%d\"",&x);\n    for(j=0;j<x;j++){\n            scanf(\""%d\"",&a[j]);\n        }\n    for(j=0;j<x;j++){\n            scanf(\""%d\"",&b[j]);\n        }\n       for(i=0;i<x;i++){\n        s[i]=b[i]-a[i];\n       }\n\n      sum[0]=s[0];\n    for(i=1;i<x;i++){\n        sum[i]=sum[i-1]+s[i];\n    }\n\n     int max=sum[0];\n    for(i=1;i<x;i++)\n    {   if(sum[i]>=max){\n          max=sum[i];\n    }\n        }\n\n   printf(\""%d\\n\"",max);\n    return 0;\n}",WRONG_ANSWER,4,308
1590980093357391872,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 16:09:47,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n\nmain()\n{\n    int n,w[10],v[10],i,max,sum=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&w[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&v[i]);\n    max=v[i]-w[i];\n    for(i=0;i<n;i++)\n    {\n        sum+=v[i]-w[i];\n        if(sum>max) max=sum;\n    }\n    printf(\""%d\"",max);\n\n}\n",RUNTIME_ERROR,4,496
1590980120091889664,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-11 16:09:54,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"num = int(input())\nlist = input().split(\"" \"")\nfor i in range(num):\n    x = int(list[i])\n    y = (6**x)%10\n    i+=1\n    print(y)",TIME_LIMIT_EXCEEDED,167,4032
1590980144473374720,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-11 16:10:00,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int a,t,b,i,j;\n    scanf(\""%d\"",&t);\n    int a[t],b[t];\n    for(i=0;i<t<i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<t;i++)\n    {\n        a[t]=pow(6,a[t]);\n        b[t]=a[t]%10;\n    }\n    printf(\""%d\"",b[t]);\n}",COMPILE_ERROR,0,0
1590980210235871232,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-11-11 16:10:15,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,count=0;\n    for(n=2;n<=100000;n++)\n    {\n        for(i=2;i<=n;i++)\n        {\n            if(n%i==0)\n            {\n                count++;\n            }\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,3,260
1590980260202590208,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 16:10:27,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n\nmain()\n{\n    int n,w[10],v[10],i,max,sum=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&w[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&v[i]);\n    max=v[i]-w[i];\n    for(i=0;i<n;i++)\n    {\n        sum+=v[i]-w[i];\n        if(sum>max) max=sum;\n    }\n    printf(\""%d\\n\"",max);\n\n}\n",RUNTIME_ERROR,4,308
1590980270650626048,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-11 16:10:30,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int a,t,b,i;\n    scanf(\""%d\"",&t);\n    int a[t],b[t];\n    for(i=0;i<t<i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<t;i++)\n    {\n        a[t]=pow(6,a[t]);\n        b[t]=a[t]%10;\n        printf(\""%d\"",b[t]);\n    }\n    \n}",COMPILE_ERROR,0,0
1590980366926655488,7222c2fb91a71fcf3f6560860557ab564f69a453594c9f1620ecc35bb26f5daf,2022-11-11 16:10:53,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"X=int(input(end=\"" \""))\nY=int(input(end=\"" \""))\nZ=int(input(end=\"" \""))\nprint(\""%d\"" %(X+Y-Z))",NON_ZERO_EXIT_CODE,16,2748
1590980368881201152,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 16:10:53,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n\nmain()\n{\n    int n,w[100],v[100],i,max,sum=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&w[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&v[i]);\n    max=v[i]-w[i];\n    for(i=0;i<n;i++)\n    {\n        sum+=v[i]-w[i];\n        if(sum>max) max=sum;\n    }\n    printf(\""%d\\n\"",max);\n\n}\n",WRONG_ANSWER,4,360
1590980413277908992,33bf53cc1ac96b08f54401ab68b14c30e1f5caef149cc9332585b7c5f09675ed,2022-11-11 16:11:04,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\n#include <cmath>\nusing namespace std;\nint main()\n{\n    int t , i , re ;\n    long in;\n    cin >> t ;\n    int shu[t] ;\n    for (i = 0 ; i < t ; i++ )\n    {\n        cin >> shu[i];\n    }\n    for (i = 0 ; i < t-1; i++ )\n    {\n        in = pow( 6 , shu[ i ] ) ;\n\t\tre = in % 10 ;\n        cout << re << endl;\n    }\n    in = pow( 6 , shu[ i ] ) ;\n\tre = in % 10 ;\n    cout << re ;\n    return 0;\n}",WRONG_ANSWER,10,492
1590980437525180416,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-11-11 16:11:09,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,i,j,max=0,sum;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n        for(i=0;i<n;i++)\n            scanf(\""%d\"",&a[i]);\n        for(i=0;i<n;i++)\n            scanf(\""%d\"",&b[i]);\n     for(i=0;i<n;i++)\n     {  sum=0;\n       for(j=i;j<n;j++)\n       {\n           sum+=b[j]-a[j];\n           if(sum>max) max=sum;\n       }\n     }\n    printf(\""%d\"",max);\n    return 0;\n}\n",ACCEPTED,3,192
1590980444894597120,f1feb45d46abad163f730e5b023ce1df76883054d0a1741228a76c2c69aa3eda,2022-11-11 16:11:11,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n    int i,j,k;\n    scanf(\""%d\"",&i);\n    if(i>=0)\n    for(j=0;j<i;j++){\n        scanf(\""%d\"",&k);\n        printf(\""%d\"",(int)pow(6,k)%10);\n        if(j<i-1)\n            printf(\""\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,7,312
1590980458769330176,4d1157ac6ad50cfc6ca5d6b3e1c2dd7f1ecc593df10ff6888d4207a4f1c03a35,2022-11-11 16:11:15,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n   int n,a;\n    cin>>n;\n    for(int i=1;i<=n;i++)\n    {\n        cin>>a;\n        if(a==0)printf(\""1\"");\n        else printf(\""6\"");\n        if(i!=n)printf(\""\\n\"");\n    }\n    return 0;\n}",ACCEPTED,13,436
1590980491367460864,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 16:11:22,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc=new Scanner(System.in);\n        int x=sc.nextInt();\n        int[] n=new int[x];\n        for (int i = 0; i <x; i++) {\n            int q=sc.nextInt();\n            n[i]= (int) Math.pow(6,q);\n        }\n        for (int i = 0; i <x; i++){\n            System.out.println(n[i]%10);\n            return;\n        }\n    }\n}",WRONG_ANSWER,129,16212
1590980514801037312,33bf53cc1ac96b08f54401ab68b14c30e1f5caef149cc9332585b7c5f09675ed,2022-11-11 16:11:28,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\n#include <cmath>\nusing namespace std;\nint main()\n{\n    int t , i , re ;\n    long in;\n    cin >> t ;\n    int shu[t] ;\n    for (i = 0 ; i < t ; i++ )\n    {\n        cin >> shu[i];\n    }\n    for (i = 0 ; i < t-1; i++ )\n    {\n        in = pow( 6 , shu[ i ] ) ;\n\t\tre = in % 10 ;\n        cout << re << endl;\n    }\n    in = pow( 6 , shu[ i ] ) ;\n\tre = in % 10 ;\n    cout << re ;\n    return 0;\n}",WRONG_ANSWER,7,328
1590980577866616832,19b1d22e5c87afa9233c236fc7b4d5e0e70acf3872968cbe9aae96e75e9e38d1,2022-11-11 16:11:43,C++,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <iostream>\nusing namespace std;\nint main()\n{\n    cout << \""2022\"";\n    return 0;\n}",ACCEPTED,4,452
1590980609240006656,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 16:11:50,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t,i;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<t;i++)\n    {if(a[i]<1)\n    printf(\""1\\n\"");\n    if(a[i]>=1)\n    if(i<t-1)\n    printf(\""6\\n\"");\n    else printf(\""6\"");}\n    return 0;\n}",WRONG_ANSWER,5,316
1590980647735308288,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-11 16:12:00,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#define MAXSIZE 20\nint main()\n{\n    int n,i,j,k;\n    int sum;\n    int max;\n    int ex[MAXSIZE];\n    int ge[MAXSIZE];\n    int Laur[MAXSIZE];\n    int Saya[MAXSIZE];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {scanf(\""%d\"",&ex[i]);}\n    for(i=0;i<n;i++)\n    {scanf(\""%d\"",&ge[i]);}\n  for(i=0;i<n;i++)\n  {     sum=0;\n       for(j=i;j<n;j++)\n       {\n        Laur[i]=sum+ex[i]+ge[i];\n        sum=Laur[i];\n       }\n      max=0;\n    for(k=i;k<n;k++)\n    {max=(max>Laur[i])?max:Laur[i];}\n     Saya[i]=max;\n  }\n    max=0;\n    for(i=0;i<n;i++)\n    {max=(max>Saya[i])?max:Saya[i];}\n    return 0;\n}",WRONG_ANSWER,4,324
1590980660402126848,1363fe5b260b83108efff76d53fc3ee37db1aa74f7eb5c5c7e6dacb996b49862,2022-11-11 16:12:03,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint n,i,a;\n\tscanf(\""%d\"",&n);\n\tfor(i=1;i<=n;i++)\n\t{\n\t\tscanf(\""%d\"",&a);\n\t\tif(n==0){\n\t\tprintf(\""1\"");\n\t\tprintf(\""\\n\"");\t\t\n\t\t}\n\telse{\n\t\tprintf(\""6\"");\n\t\tprintf(\""\\n\"");\t\n\t}\n\t}\n\treturn 0; \n}",WRONG_ANSWER,10,308
1590980732288307200,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-11-11 16:12:20,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,count=0;\n    for(n=2;n<=100000;n++)\n    {\n        for(i=2;i<=n;i++)\n        {\n            if(n%i==0)\n            {\n                count++;\n            }\n            printf(\""%d\"",count-1);\n        }\n    }\n    return 0;\n}\n",OUTPUT_LIMIT_EXCEEDED,969,65536
1590980758964080640,f1feb45d46abad163f730e5b023ce1df76883054d0a1741228a76c2c69aa3eda,2022-11-11 16:12:26,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n    int i,j,k;\n    scanf(\""%d\"",&i);\n    for(j=0;j<i;j++){\n        scanf(\""%d\"",&k);\n        if(k>=0){\n        printf(\""%d\"",(int)pow(6,k)%10);\n        if(j<i-1)\n            printf(\""\\n\"");\n        }\n        }\n    return 0;\n}",WRONG_ANSWER,8,332
1590980759580643328,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-11 16:12:26,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int a,t,b,i;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t<i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<t;i++)\n    {\n        a[t]=pow(6,a[t]);\n        b=a[t]%10;\n        printf(\""%d\"",b);\n    }\n    \n}",COMPILE_ERROR,0,0
1590980776215228416,acfcf65f14b5d3b02c3225372654b4e21f04d33a8bbaeb346e4fb1d85f2ea94f,2022-11-11 16:12:30,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n  int t,n,i,r,g=pow(10,9);\n  scanf(\""%d\"",&t); \n  for(i=1;i<=t;i++)\n  {\n    scanf(\""%d\"",&n);\n    r=pow(6,n);\n      if(i<t,n>=0,n<=g)\n    printf(\""%d\\n\"",r%10);  \n      else\n    printf(\""%d\"",r%10);   \n  }\n   return 0;\n}\n",WRONG_ANSWER,6,356
1590980828258172928,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 16:12:43,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t,i;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<t;i++)\n    {if(a[i]<1)\n    printf(\""1\\n\"");\n    else\n        \n    printf(\""6\\n\"");\n   }\n    return 0;\n}",WRONG_ANSWER,7,320
1590980838571966464,29d1ea54d6e4e56fc2de0be5ae10ecc4c70c7fca667934b17857e95530f5663a,2022-11-11 16:12:45,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#define  N 1000\n\nint main(void)\n{\n int n,t;\n int i=0, j=0,sum;\n int a[N], b[N],c[N];\n sum = 0;\n    \n scanf(\""%d\"", &n);\n while (i<n) {\n  scanf(\""%d\"", &a[i]);\n  i++;\n }\n while (j < n) {\n  scanf(\""%d\"", &b[j]);\n  j++;\n }\n for (i = 0; i < n; i++) {\n  c[i] = b[i] - a[i];\n }\n    int index = 0;\n    int max = c[index];\n  for (; index < n; ++index)\n    {\n        sum += c[index];\n        if (sum < c[index])\n        {\n            sum = c[index];\n        }\n        if (sum > max)\n        {\n            max = sum;\n        }\n    }\n sum = max;\n printf(\""%d\"", sum);\n return 0;\n}\n",ACCEPTED,4,480
1590980842351034368,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 16:12:46,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n\nmain()\n{\n    int n,w[100],v[100],i,max,sum=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&w[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&v[i]);\n    max=v[i]-w[i];\n    for(i=0;i<n;i++)\n    {\n        sum+=v[i]-w[i];\n        if(sum>max) \n            max=sum;\n    }\n    printf(\""%d\\n\"",max);\n\n}\n",WRONG_ANSWER,3,324
1590980883924975616,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-11-11 16:12:56,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,count=0;\n    for(n=2;n<=100000;n++)\n    {\n        for(i=3;i<=n;i++)\n        {\n            if(n%i==0)\n            {\n                count++;\n            }\n            printf(\""%d\"",count);\n        }\n    }\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,1000,51864
1590980978636554240,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-11 16:13:18,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int c,t,b,i;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t<i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<t;i++)\n    {\n        c=pow(6,a[t]);\n        b=c%10;\n        printf(\""%d\"",b);\n    }\n    \n}",COMPILE_ERROR,0,0
1590981040250884096,2cb092ec618cde3657d677b73f7a0a7bfb1e0da02f466007878113e6c4db4792,2022-11-11 16:13:33,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int m,i,n=0,num=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++){\n        for(m=2;m<i;m++){\n            if(i%m==0){\n                break;\n            }\n        }\n        if(m==i){\n            num+=1;\n        }\n    }\n    printf(\""%d\\n\"",num);\n    return 0;\n}",ACCEPTED,942,284
1590981060790390784,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-11 16:13:38,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int c,t,b,i;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t<i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<t;i++)\n    {\n        c=pow(6,a[i]);\n        b=c%10;\n        printf(\""%d\"",b);\n    }\n    \n}",COMPILE_ERROR,0,0
1590981070667952129,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 16:13:40,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t,i;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<t;i++)\n    {if(a[i]<1)\n    printf(\""1\\n\"");\n    else   \n    printf(\""6\\n\"");\n   }\n    return 0;\n}",WRONG_ANSWER,6,344
1590981089542344704,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-11-11 16:13:45,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,count=0;\n    for(n=2;n<=100000;n++)\n    {\n        for(i=3;i<=n;i++)\n        {\n            if(n%i==0)\n            {\n                count++;\n                printf(\""%d\"",count);\n            }\n        }\n    }\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,1000,1640
1590981109540761600,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 16:13:50,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"", &n);\n    int arr1[10000] = { 0 };\n    int arr2[10000] = { 0 };\n    for (int i = 0; i < n; ++i)\n    {\n        scanf(\""%d\"", &arr1[i]);\n    }\n    for (int j = 0; j < n; ++j)\n    {\n        scanf(\""%d\"", &arr2[j]);\n    }\n    int max1 = 0, max2 = 0, max3 = 0, count = 0, k = 0;\n    for (k = 0; k < n; ++k)\n    {\n        int sum = arr2[k] - arr1[k];\n        if (sum <= 0)\n        {\n            if (max3 == 0)\n            {\n                max3 = sum;\n            }\n            if (sum > max3)\n            {\n                max3 = sum;\n            }\n            count++;\n            if (max1 < max2)\n            {\n                max1 = max2;\n            }\n            max2 = 0;\n        }\n        else\n        {\n            max2 += sum;\n        }\n    }\n    if (count == n)\n    {\n        printf(\""%d\"", max3);\n    }\n    else\n    {\n        //int max = max1 > max2 ? max1 : max2;\n        printf(\""%d\"", max1);\n    }\n    return 0;\n}",WRONG_ANSWER,3,308
1590981113919614976,fa305ee4bf4c6a54add4e945b551f1e902b95c1a179a91ded55bf7ebb1c87c23,2022-11-11 16:13:51,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main(){\nint n,i,j,sum=0,max=0;\nscanf(\""%d\"",&n);\nint a[n],b[n];\nfor(i=0;i<n;i++){\n    scanf(\""%d\"",&a[i]);\n}\nfor(i=0;i<n;i++){\n    scanf(\""%d\"",&b[i]);\n}\nfor(i=0;i<n;i++){\n    a[i]=b[i]-a[i];\n}\nfor(j=0;j<n;j++){\nfor(i=j;i<n;i++){\n    sum=a[i]+sum;\nif(max<sum) max=sum;\n}\nif(j!=0) for(i=0;i<j;i++){\n    sum=a[i]+sum;\n    if(max<sum) max=sum;\n}\nsum=0;\n}\nprintf(\""%d\\n\"",max);\n}",ACCEPTED,3,328
1590981128419348480,1363fe5b260b83108efff76d53fc3ee37db1aa74f7eb5c5c7e6dacb996b49862,2022-11-11 16:13:54,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint n,i,a;\n\tscanf(\""%d\"",&n);\n\tfor(i=1;i<=n;++i)\n\t{\n\t\tscanf(\""%d\"",&a);\n\t\tif(n==0){\n\t\tprintf(\""1\"");\n\t\tprintf(\""\\n\"");\t\t\n\t\t}\n\telse{\n\t\tprintf(\""6\"");\n\t\tprintf(\""\\n\"");\t\n\t}\n\t}\n\treturn 0; \n}",WRONG_ANSWER,11,184
1590981163114631168,eee658ba43cf6fba46676f4d9f167223fd9b57ec54a5d813fd1d01afc3088139,2022-11-11 16:14:02,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int t,n,i=1,m;\n    scanf (\""%d\\n\"",&t);\n    while(i<=t)\n    {\n      scanf (\""%d\\n\"",&n);\n      if(0<=n<=pow(10,9))\n      {\n        m=pow(6,n);\n        m=m/1%10;\n        printf (\""%d\"",m);\n      }\n        if(i<t)\n        {\n            printf (\""\\n\"");\n        }\n        i++;\n    }\n    return 0;\n}\n",WRONG_ANSWER,6,348
1590981167921278976,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-11 16:14:04,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int c,t,b,i;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<t;i++)\n    {\n        c=pow(6,a[i]);\n        b=c%10;\n        printf(\""%d\"",b);\n    }\n    \n}",WRONG_ANSWER,7,340
1590981214931038208,acfcf65f14b5d3b02c3225372654b4e21f04d33a8bbaeb346e4fb1d85f2ea94f,2022-11-11 16:14:15,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n  int t,n,i,r,g=pow(10,9);\n  scanf(\""%d\"",&t); \n  for(i=1;i<=t;i++)\n  {\n    scanf(\""%d\"",&n);\n    r=pow(6,n);\n      if(i<t,n>=0,n<=g)\n    printf(\""%d\\n\"",r%10);  \n      if(i=t)\n    printf(\""%d\"",r%10);   \n  }\n   return 0;\n}\n",WRONG_ANSWER,3,336
1590981238205251584,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 16:14:20,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n\nmain()\n{\n    int n,w[100],v[100],i,max,sum=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&w[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&v[i]);\n    max=v[i]-w[i];\n    for(i=0;i<n;i++)\n    {\n        sum+=v[i]-w[i];\n        if(sum>max) \n            max=sum;\n    }\n    printf(\""%d\\n\"",max);\n\n}\n",WRONG_ANSWER,4,320
1590981246161850368,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-11 16:14:22,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n\n#define M 100\n\nint main()\n\n{\n\n    int n,a[M],b[M],c[M],i,max;\n\n    scanf(\""%d\"",&n);\n\n    for(i=1;i<=n;i++)\n\n    scanf(\""%d\"",&a[i]);\n\n    for(i=1;i<=n;i++)\n\n    scanf(\""%d\"",&b[i]);\n\n    for(i=1;i<=n;i++)\n\n    if(b[i]-a[i]>0)\n\n    for(i;i<=n;i++)\n\n    c[i]=b[i]-a[i]+c[i-1];\n\n    for(i=1;i<=n;i++)\n\n    if(c[i]>c[i-1])\n\n    max=c[i];\n\n    printf(\""%d\\n\"",max);\n\n    return 0;\n\n}",WRONG_ANSWER,4,452
1590981251341811712,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 16:14:23,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc=new Scanner(System.in);\n        int x=sc.nextInt();\n        int[] n=new int[x];\n        for (int i = 0; i <x; i++) {\n            int q=sc.nextInt();\n            n[i]= (int) Math.pow(6,q);\n        }\n        for (int i = 0; i <x; i++){\n            System.out.println(n[i]%10);\n        }\n    }\n}",NON_ZERO_EXIT_CODE,260,16588
1590981268538462208,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-11 16:14:28,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"num = int(input())\ni = 2\na=0\nfor i in range(2, num):\n    j = 2\n    for j in range(2, i):\n        if (i % j == 0):\n            break\n    else:\n        a+=1\nprint(a)\n",TIME_LIMIT_EXCEEDED,1000,2916
1590981271977791488,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-11 16:14:28,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int c,t,b,i;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<t;i++)\n    {\n        c=pow(6,a[i]);\n        b=c%10;\n        printf(\""%d\\n\"",b);\n    }\n    \n}",WRONG_ANSWER,8,344
1590981296019537920,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-11 16:14:34,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"num = int(input())\ni = 2\na=0\nfor i in range(2, num):\n    j = 2\n    for j in range(2, i):\n        if (i % j == 0):\n            break\n    else:\n        a+=1\nprint(a)\n",TIME_LIMIT_EXCEEDED,1000,2916
1590981300796850176,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-11 16:14:35,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int c,t,b,i;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<t;i++)\n    {\n        c=pow(6,a[i]);\n        b=c%10;\n        printf(\""%d\\n\"",b);\n    }\n    \n}",WRONG_ANSWER,6,340
1590981328386961408,4812f9582f90b7f3f95178a62ec39f3555e90b935658da3e31a47fe0d2e8c6fd,2022-11-11 16:14:42,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n int  b, n, i, k = 0, f;\n scanf(\"" %d\"", &b);\n for (n = 2; n <=b; n++)\n{\n  f = 1;\n  for (i = 2; i <= sqrt(n); i++)\n     if (n % i == 0) {\n    f = 0;\n    break;\n                  }\n  if (f == 1)\n   k++;\n  if (n == b)\n   printf(\""%d\"", k);\n\n}\nreturn 0;\n}\n",ACCEPTED,13,596
1590981347223605248,beefe7893dd2cd421da3fb1ba3ffd90e3dc51d5301380baebfdfa12fbe5234f5,2022-11-11 16:14:46,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"a = 0\nn = int(input())\nif 2 <= n <= 100000:\n    for i in range(2, n+1):\n        for m in range(2, i):\n            if i % m == 0:\n                break\n            else:\n                a += 1\n    print(a)\nelse:\n    print('超出范围')",TIME_LIMIT_EXCEEDED,1000,2980
1590981350126059520,15ac7d06a472ca25d78349f7cc3a73d23c7d7a4f0c4ae3cec6200fcdb8135965,2022-11-11 16:14:47,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#define  N 1000\n\nint main(void)\n{\n int n,t;\n int i=0, j=0,sum;\n int a[N], b[N],c[N];\n sum = 0;\n    \n scanf(\""%d\"", &n);\n while (i<n) {\n  scanf(\""%d\"", &a[i]);\n  i++;\n }\n while (j < n) {\n  scanf(\""%d\"", &b[j]);\n  j++;\n }\n for (i = 0; i < n; i++) {\n  c[i] = b[i] - a[i];\n }\n    int index = 0;\n    int max = c[index];\n  for (; index < n; ++index)\n    {\n        sum += c[index];\n        if (sum < c[index])\n        {\n            sum = c[index];\n        }\n        if (sum > max)\n        {\n            max = sum;\n        }\n    }\n sum = max;\n printf(\""%d\"", sum);\n return 0;\n}",ACCEPTED,3,180
1590981403163037696,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 16:15:00,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n\nmain()\n{\n    int n,w[100],v[100],i,max,sum=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&w[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&v[i]);\n    max=v[i]-w[i];\n    for(i=0;i<n;i++)\n    {\n        sum+=v[i]-w[i];\n        if(sum>max) \n            max=sum;\n    }\n    printf(\""%d\\n\"",max);\n\n}\n",WRONG_ANSWER,7,324
1590981495806799872,86f702b052a21d7cb2f8cd933c678c21efaafaf5b2d35032f18ec35c1e26a945,2022-11-11 16:15:22,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i;\n    scanf(\""%d\"",&n);\n    int a[1000],b[1000];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    int sum=0,max=0;\n    for(i=0;i<n;i++)\n    {\n       sum=b[i]-a[i]+sum;\n       if(max<sum) max=sum;\n    }\n    printf(\""%d\"",max);\n    return 0;\n}\n",WRONG_ANSWER,4,324
1590981512227500032,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-11 16:15:26,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"num = int(input())\nlist = input().split(\"" \"")\nfor i in range(num):\n    x = int(list[i])\n    y = (6**x)%10\n    i+=1\n    print(y)",TIME_LIMIT_EXCEEDED,168,4000
1590981519169093632,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-11 16:15:27,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int c,t,b,i;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<t;i++)\n    {\n        c=pow(6,a[i]);\n        b=c%10;\n        printf(\""%d\\n\"",b);\n    }\n    \n}",WRONG_ANSWER,8,308
1590981528451067905,423e1acd0d02cf3d43f3c7805099dea4edcb39c2e0fa385e82823b5a7c0dd214,2022-11-11 16:15:30,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"\n#include <stdio.h>\n#include<math.h>\nint main()\n{\n    int t;\n    scanf(\""%d\"", &t);\n    int n[100];\n    int i,a;\n    for (i = 0; i < t; i++)\n        scanf(\""%d \"", &n[i]);\n     for (i = 0; i < t;i++)\n    {\n        a = pow(6,n[i]);\n         if(i>0)\n             printf(\""\\n\"");\n        printf(\""%d\"", a % 10);\n    }\n return 0;\n}",WRONG_ANSWER,8,320
1590981533551366144,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-11 16:15:31,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"num = int(input())\ni = 2\na=0\nfor i in range(2, num):\n    j = 2\n    for j in range(2, i):\n        if (i % j == 0):\n            break\n    else:\n        a+=1\nprint(a)\n",TIME_LIMIT_EXCEEDED,1000,2996
1590981547174465536,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-11 16:15:34,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n\n#define M 100\n\nint main()\n\n{\n\n    int n,a[M],b[M],c[M],i,max;\n\n    scanf(\""%d\"",&n);\n\n    for(i=1;i<=n;i++)\n\n    scanf(\""%d\"",&a[i]);\n\n    for(i=1;i<=n;i++)\n\n    scanf(\""%d\"",&b[i]);\n\n    for(i=1;i<=n;i++)\n\n    for(i;i<=n;i++)\n\n    c[i]=b[i]-a[i]+c[i-1];\n\n    for(i=1;i<=n;i++)\n\n    if(c[i]>c[i-1])\n\n    max=c[i];\n\n    printf(\""%d\\n\"",max);\n\n    return 0;\n\n}",WRONG_ANSWER,3,188
1590981617278058496,9819f13d6a58d50fa249ad037641119dadb52afb3f125db258771564f27d2ca5,2022-11-11 16:15:51,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main() {\n\tint n, a, result = 1;\n\tscanf(\""%d\"", &n);\n\twhile (n--) {\n\t\tscanf(\""%d\"", &a);\n\t\twhile (a != 0) {\n\t\t\tresult *= 6;\n\t\t\t--a;\n\t\t}\n\t\tprintf(\""%d\"", result % 10);\n\t\tresult = 1;\n\t\tif (n > 0) {\n\t\t\tprintf(\""\\n\"");\n\t\t}\n\t}\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,24,200
1590981619551350784,1363fe5b260b83108efff76d53fc3ee37db1aa74f7eb5c5c7e6dacb996b49862,2022-11-11 16:15:51,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint n,i,a;\n\tscanf(\""%d\"",&n);\n\tfor(i=1;i<=n;i++)\n\t{\n\t\tscanf(\""%d\"",&a);\n\t\tif(n==0)\n\t\t  printf(\""1\"");\t\t\t\n\t    else\n\t\tprintf(\""6\"");\n\t\tprintf(\""\\n\"");\t\n\t\n\t}\n\treturn 0; \n}",WRONG_ANSWER,9,472
1590981622093099008,86f702b052a21d7cb2f8cd933c678c21efaafaf5b2d35032f18ec35c1e26a945,2022-11-11 16:15:52,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    int sum=0,max=0;\n    for(i=0;i<n;i++)\n    {\n       sum=b[i]-a[i]+sum;\n       if(max<sum) max=sum;\n    }\n    printf(\""%d\"",max);\n    return 0;\n}\n",WRONG_ANSWER,4,360
1590981634294349824,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-11 16:15:55,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int c,t,b,i;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<t;i++)\n    {\n        c=pow(6,a[i]);\n        b=c%10;\n        printf(\""%d\\n\"",b);\n    }\n    \n}",WRONG_ANSWER,6,352
1590981638568349696,33bf53cc1ac96b08f54401ab68b14c30e1f5caef149cc9332585b7c5f09675ed,2022-11-11 16:15:56,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\n#include <cmath>\nusing namespace std;\nint main()\n{\n    int t , i , re ;\n    long in;\n    cin >> t ;\n    int shu[t] ;\n    for (i = 0 ; i < t ; i++ )\n    {\n        cin >> shu[i];\n    }\n    for (i = 0 ; i < t-1; i++ )\n    {\n        if ( shu[i] != 0 )\n        {\n            re = 6 ;\n        }\n        else\n        {\n            re = 1 ;\n        }\n        cout << re << endl;\n    }\n    if ( shu[i] != 0 )\n        {\n            re = 6 ;\n        }\n        else\n        {\n            re = 1 ;\n        }\n        cout << re ;\n    return 0;\n}",WRONG_ANSWER,8,448
1590981688295993344,33bf53cc1ac96b08f54401ab68b14c30e1f5caef149cc9332585b7c5f09675ed,2022-11-11 16:16:08,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\n#include <cmath>\nusing namespace std;\nint main()\n{\n    int t , i , re ;\n    cin >> t ;\n    int shu[t] ;\n    for (i = 0 ; i < t ; i++ )\n    {\n        cin >> shu[i];\n    }\n    for (i = 0 ; i < t-1; i++ )\n    {\n        if ( shu[i] != 0 )\n        {\n            re = 6 ;\n        }\n        else\n        {\n            re = 1 ;\n        }\n        cout << re << endl;\n    }\n    if ( shu[i] != 0 )\n        {\n            re = 6 ;\n        }\n        else\n        {\n            re = 1 ;\n        }\n        cout << re ;\n    return 0;\n}",WRONG_ANSWER,11,512
1590981714221010944,beefe7893dd2cd421da3fb1ba3ffd90e3dc51d5301380baebfdfa12fbe5234f5,2022-11-11 16:16:14,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"a = 0\nn = int(input())\nif 2 <= n <= 100000:\n    for i in range(2, n+1):\n        for m in range(2, i):\n            if i % m == 0:\n                break\n            else:\n                a += 1\n    print(a)\nelse:\n    print('超出范围')",TIME_LIMIT_EXCEEDED,1000,2960
1590981720323719168,f1feb45d46abad163f730e5b023ce1df76883054d0a1741228a76c2c69aa3eda,2022-11-11 16:16:15,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n    float i,j,k;\n    scanf(\""%d\"",&i);\n    for(j=0;j<i;j++){\n        scanf(\""%d\"",&k);\n        if(k>=0){\n        printf(\""%d\"",(int)pow(6,k)%10);\n        if(j<i-1)\n            printf(\""\\n\"");\n        }\n        }\n    return 0;\n}",WRONG_ANSWER,3,324
1590981736530489344,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 16:16:19,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        try {\n            Scanner sc=new Scanner(System.in);\n            int x=sc.nextInt();\n            int[] n=new int[x];\n            for (int i = 0; i <x; i++) {\n                int q=sc.nextInt();\n                n[i]= (int) Math.pow(6,q);\n            }\n            for (int i = 0; i <x; i++){\n                System.out.println(n[i]%10);\n            }\n        } catch (Exception e) {\n            e.printStackTrace();\n        }\n    }\n}",WRONG_ANSWER,249,16672
1590981764380667904,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 16:16:26,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        try {\n            Scanner sc=new Scanner(System.in);\n            int x=sc.nextInt();\n            int[] n=new int[x];\n            for (int i = 0; i <x; i++) {\n                int q=sc.nextInt();\n                n[i]= (int) Math.pow(6,q);\n            }\n            for (int i = 0; i <x; i++){\n                System.out.println(n[i]%10);\n            }\n        } catch (Exception e) {\n            e.printStackTrace();\n        }\n    }\n}",WRONG_ANSWER,256,18888
1590981770768617472,19b1d22e5c87afa9233c236fc7b4d5e0e70acf3872968cbe9aae96e75e9e38d1,2022-11-11 16:16:27,C++,300.0,1590524835191705600,1572865591226855424,1049226928954454016,#include <iostream>\nusing namespace std;\n\nint main()\n{\n    int a[3];\n    for(int i;i<3;i++){\n        cin >> a[i];\n    }\n    cout << a[0]+a[1]-a[2];\n\n    return 0;\n},ACCEPTED,7,448
1590981771506814976,33bf53cc1ac96b08f54401ab68b14c30e1f5caef149cc9332585b7c5f09675ed,2022-11-11 16:16:27,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\n#include <cmath>\nusing namespace std;\nint main()\n{\n    int t , i , re ;\n    cin >> t ;\n    int shu[t] ;\n    for (i = 0 ; i < t ; i++ )\n    {\n        cin >> shu[i];\n    }\n    for (i = 0 ; i < t-1; i++ )\n    {\n        if ( shu[i] != 0 )\n        {\n            re = 6 ;\n        }\n        else\n        {\n            re = 1 ;\n        }\n        cout << re << endl;\n    }\n    if ( shu[i] != 0 )\n        {\n            re = 6 ;\n        }\n        else\n        {\n            re = 1 ;\n        }\n        cout << re ;\n    return 0;\n}",WRONG_ANSWER,7,452
1590981802217484288,beefe7893dd2cd421da3fb1ba3ffd90e3dc51d5301380baebfdfa12fbe5234f5,2022-11-11 16:16:35,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"a = 0\nn = int(input())\nif 2 <= n <= 100000:\n    for i in range(2, n+1):\n        for m in range(2, i):\n            if i % m == 0:\n                break\n         else:\n                a += 1\n    print(a)\nelse:\n    print('超出范围')",NON_ZERO_EXIT_CODE,26,2824
1590981805002522624,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 16:16:35,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"", &n);\n    int arr1[10000] = { 0 };\n    int arr2[10000] = { 0 };\n    for (int i = 0; i < n; ++i)\n    {\n        scanf(\""%d\"", &arr1[i]);\n    }\n    for (int j = 0; j < n; ++j)\n    {\n        scanf(\""%d\"", &arr2[j]);\n    }\n    int max1 = 0, max2 = 0, max3 = 0, count = 0, k = 0;\n    for (k = 0; k < n; ++k)\n    {\n        int sum = arr2[k] - arr1[k];\n        if (sum <= 0)\n        {\n            if (max3 == 0)\n            {\n                max3 = sum;\n            }\n            if (sum > max3)\n            {\n                max3 = sum;\n            }\n            count++;\n            if (max1 < max2)\n            {\n                max1 = max2;\n            }\n            max2 = 0;\n        }\n        else\n        {\n            max2 += sum;\n        }\n    }\n    if (count == n)\n    {\n        //printf(\""%d\"", max3);\n        printf(\""0\"");\n    }\n    else\n    {\n        int max = max1 > max2 ? max1 : max2;\n        printf(\""%d\"", max1);\n    }\n    return 0;\n}",WRONG_ANSWER,3,324
1590981808534106112,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 16:16:36,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n\nmain()\n{\n    int n,w[100],v[100],i,max,sum=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&w[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&v[i]);\n    max=v[i]-w[i];\n    for(i=0;i<n;i++)\n    {\n        sum+=v[i]-w[i];\n        if(sum>max) \n            max=sum;\n    }\n    printf(\""%d\\n\"",max);\n    return 0;\n}\n",WRONG_ANSWER,3,180
1590981819871309824,e3700fa579dc7c925fa010ac870390ba9776ef5ee08f67752aeef4a9467c7624,2022-11-11 16:16:39,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h> \n#include<math.h>\nint main(){\nint n;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(int i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n    \n    for(int i=0;i<n-1;i++){\n       if(a[i]==0&&i<(n-1)) printf(\""1\\n\"");\n       else printf(\""6\\n\"");\n    }\n    if(a[n-1]==0) printf(\""1\"");\n    else printf(\""6\"");\n\t\n}\n",ACCEPTED,12,512
1590981850552664064,46a5b5de1986c03ade4ef3715390240d3b4a1729dbb6afcb5e53fc1bee0f1a07,2022-11-11 16:16:46,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args)throws Exception {\n\t\t Scanner sc=new Scanner(System.in);\n\t     int x=sc.nextInt();\n\t     int array[]=new int[20];\n\t\t int b=0;\n\t     for(int i=0;i<x;i++) {\n\t    \t array[i]=sc.nextInt();\n\t     }\n\t     for(int i=1;i<=x;i++) {\n\t    \t for(int j=0;j<i;j++) {\n\t    \t\t b=(int) Math.pow(6,array[j]);\t \n\t    \t}\n\t    \t System.out.println(b%10);\n\t     }\n\t     sc.close();\n\t}\n}\n",NON_ZERO_EXIT_CODE,250,19256
1590981861571080192,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 16:16:49,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n\nmain()\n{\n    int n,w[100],v[100],i,max,sum=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&w[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&v[i]);\n    max=v[i]-w[i];\n    for(i=0;i<n;i++)\n    {\n        sum+=v[i]-w[i];\n        if(sum>max) \n            max=sum;\n    }\n    printf(\""%d\\n\"",max);\n    return 0;\n}\n",WRONG_ANSWER,3,316
1590981909964959744,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 16:17:01,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) throws Exception{\n        Scanner sc=new Scanner(System.in);\n        int x=sc.nextInt();\n        int[] n=new int[x];\n        for (int i = 0; i <x; i++) {\n            int q=sc.nextInt();\n            n[i]= (int) Math.pow(6,q);\n        }\n        for (int i = 0; i <x; i++){\n            System.out.println(n[i]%10);\n        }\n    }\n}",NON_ZERO_EXIT_CODE,264,20380
1590981930730979328,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 16:17:05,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) throws Exception{\n        Scanner sc=new Scanner(System.in);\n        int x=sc.nextInt();\n        int[] n=new int[x];\n        for (int i = 0; i <x; i++) {\n            int q=sc.nextInt();\n            n[i]= (int) Math.pow(6,q);\n        }\n        for (int i = 0; i <x; i++){\n            System.out.println(n[i]%10);\n        }\n    }\n}",WRONG_ANSWER,271,16576
1590981944156925952,1363fe5b260b83108efff76d53fc3ee37db1aa74f7eb5c5c7e6dacb996b49862,2022-11-11 16:17:09,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint n,i,a;\n\tscanf(\""%d\"",&n);\n\tfor(i=1;i<=n;i++)\n\t{\n\t\tscanf(\""%d\"",&a);\n\t\tif(a==0)\n\t\t  printf(\""1\"");\t\t\t\n\t    else\n\t\tprintf(\""6\"");\n\t\tprintf(\""\\n\"");\t\n\t\n\t}\n\treturn 0; \n}",ACCEPTED,12,512
1590981947105521664,beefe7893dd2cd421da3fb1ba3ffd90e3dc51d5301380baebfdfa12fbe5234f5,2022-11-11 16:17:09,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"a = 0\nn = int(input())\nif 2 <= n <= 100000:\n    for i in range(2, n+1):\n        for m in range(2, i):\n            if i % m == 0:\n                break\n         else:\n             a += 1\n    print(a)\nelse:\n    print('超出范围')",NON_ZERO_EXIT_CODE,17,2744
1590981968634904576,44042a4519c9231aa21c54eb113b7a08f98bcd7db4839a20a61ab6ce51fce357,2022-11-11 16:17:14,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int n;\n    int i;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=0;i<n;i++)\n    {\n        if(i==0)\n            scanf(\""%d\"",&a[i]);\n        else\n            scanf(\"" %d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if(i==0)\n        {\n            if(a[i]==0)\n                printf(\""1\"");\n            else\n                printf(\""6\"");\n        }\n        else\n        {\n            if(a[i]==0)\n                printf(\""\\n1\"");\n            else\n                printf(\""\\n6\"");\n        }\n\n    }\n    return 0;\n}\n",ACCEPTED,9,324
1590981998703849472,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-11 16:17:22,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"X,Y,Z=map(int,input(\""请输入三个整数：\"").split())\n请输入三个整数:8,7,3;\n0<=X,Y,Z<=100;\nprint(X+Y-Z)；",NON_ZERO_EXIT_CODE,18,2872
1590982003149811712,beefe7893dd2cd421da3fb1ba3ffd90e3dc51d5301380baebfdfa12fbe5234f5,2022-11-11 16:17:23,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"a = 0\nn = int(input())\nif 2 <= n <= 100000:\n    for i in range(2, n+1):\n        for m in range(2, i):\n            if i % m == 0:\n                break\n         else:\n             a += 1\n    print(a)\n",NON_ZERO_EXIT_CODE,18,4028
1590982017150423040,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-11 16:17:26,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"X,Y,Z=map(int,input(\""请输入三个整数：\"").split())\n请输入三个整数:8,7,3;\n0<=X,Y,Z<=100;\nprint(X+Y-Z)；",NON_ZERO_EXIT_CODE,17,2872
1590982053292736512,46a5b5de1986c03ade4ef3715390240d3b4a1729dbb6afcb5e53fc1bee0f1a07,2022-11-11 16:17:35,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n\t\t try {\n\t\t\tScanner sc=new Scanner(System.in);\n\t\t\t int x=sc.nextInt();\n\t\t\t int array[]=new int[20];\n\t\t\t int b=0;\n\t\t\t for(int i=0;i<x;i++) {\n\t\t\t\t array[i]=sc.nextInt();\n\t\t\t }\n\t\t\t for(int i=1;i<=x;i++) {\n\t\t\t\t for(int j=0;j<i;j++) {\n\t\t\t\t\t b=(int) Math.pow(6,array[j]);\t \n\t\t\t\t}\n\t\t\t\t System.out.println(b%10);\n\t\t\t }\n\t\t\t sc.close();\n\t\t} catch (Exception e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t}\n}\n",WRONG_ANSWER,263,17016
1590982098213711872,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-11 16:17:45,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"X,Y,Z=map(int,input(\""请输入三个整数：\"").split())\n0<=X,Y,Z<=100;\nprint(X+Y-Z)；",NON_ZERO_EXIT_CODE,19,2844
1590982166832545792,46a5b5de1986c03ade4ef3715390240d3b4a1729dbb6afcb5e53fc1bee0f1a07,2022-11-11 16:18:02,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n\t\t try {\n\t\t\tScanner sc=new Scanner(System.in);\n\t\t\t int x=sc.nextInt();\n\t\t\t int array[]=new int[20];\n\t\t\t int b=0;\n\t\t\t for(int i=0;i<x;i++) {\n\t\t\t\t array[i]=sc.nextInt();\n\t\t\t }\n\t\t\t for(int i=1;i<=x;i++) {\n\t\t\t\t for(int j=0;j<i;j++) {\n\t\t\t\t\t b=(int) Math.pow(6,array[j]);\t \n\t\t\t\t}\n\t\t\t\t System.out.println(b%10);\n\t\t\t }\n\t\t\t sc.close();\n\t\t} catch (Exception e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t}\n}\n",WRONG_ANSWER,263,16524
1590982179511926784,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 16:18:05,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\nint a[100],n,i;\n\n    scanf(\""%d\"",&n);\nfor(i=0;i<n;i++)\n{\n\tscanf(\""%d\"",&a[i]);\n\n        if(i=0)\n            printf(\""%d\\n\"",1);\n        else\nprintf(\""%d\\n\"",6);\n}\n    \n \n      \n \n    return 0;\n}\n\n\n\n\n\n\n\n\n\n",TIME_LIMIT_EXCEEDED,20,376
1590982226039341056,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-11-11 16:18:16,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#define MAXSIZE 200\nint main()\n{\n    int n,i,j,k;\n    int sum;\n    int max;\n    int ex[MAXSIZE];\n    int ge[MAXSIZE];\n    int Laur[MAXSIZE];\n    int Saya[MAXSIZE];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {scanf(\""%d\"",&ex[i]);}\n    for(i=0;i<n;i++)\n    {scanf(\""%d\"",&ge[i]);}\n  for(i=0;i<n;i++)\n  {     \n       sum=0;\n       for(j=i;j<n;j++)\n       {\n        Laur[j]=sum-ex[j]+ge[j];\n        sum=Laur[j];\n       }\n      max=0;\n    for(k=i;k<n;k++)\n    {max=(max>Laur[k])?max:Laur[k];}\n     Saya[i]=max;\n  }\n    max=0;\n    for(i=0;i<n;i++)\n    {max=(max>Saya[i])?max:Saya[i];}\n    printf(\""%d\\n\"",max);\n    return 0;\n}",ACCEPTED,3,196
1590982241826701312,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-11 16:18:20,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"X,Y,Z=map(int,input(\""请输入三个整数：\"").split())\n0<=X,Y,Z<=100;\nx=8,y=7,z=3;\nprint(X+Y-Z)；",NON_ZERO_EXIT_CODE,18,2924
1590982292716171264,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 16:18:32,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n\nmain()\n{\n    int n,w[100],v[100],i,max,sum=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&w[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&v[i]);\n    max=v[i]-w[i];\n    for(i=0;i<n;i++)\n    {\n        sum+=v[i]-w[i];\n        if(sum>max) \n            max=sum;\n    }\n    printf(\""%d\\n\"",max);\n    return 0;\n}\n",WRONG_ANSWER,3,328
1590982343668596736,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 16:18:44,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n\nmain()\n{\n    int n,w[10],v[10],i,max,sum=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&w[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&v[i]);\n    max=v[i]-w[i];\n    for(i=0;i<n;i++)\n    {\n        sum+=v[i]-w[i];\n        if(sum>max) \n            max=sum;\n    }\n    printf(\""%d\\n\"",max);\n    return 0;\n}\n",RUNTIME_ERROR,3,452
1590982388019167232,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 16:18:54,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n\nmain()\n{\n    int n,w[11],v[11],i,max,sum=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&w[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&v[i]);\n    max=v[i]-w[i];\n    for(i=0;i<n;i++)\n    {\n        sum+=v[i]-w[i];\n        if(sum>max) \n            max=sum;\n    }\n    printf(\""%d\\n\"",max);\n    return 0;\n}\n",WRONG_ANSWER,3,324
1590982410588696576,fbea21dbaf89f1b064feaa20227f21c5e1c4888fdc371cf5e43f70615906e52a,2022-11-11 16:19:00,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"n=int(input())\ncounter=0\nfor i in range(2,n+1):\n   for a in range(2,i):\n        if i%a==0:\n            break\n   else:\n        counter+=1\nprint(counter)\n",TIME_LIMIT_EXCEEDED,1000,2880
1590982485268279296,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 16:19:18,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n\nmain()\n{\n    int n,w[11]={0},v[11]={0},i,max,sum=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&w[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&v[i]);\n    max=v[i]-w[i];\n    for(i=0;i<n;i++)\n    {\n        sum+=v[i]-w[i];\n        if(sum>max) \n            max=sum;\n    }\n    printf(\""%d\\n\"",max);\n    return 0;\n}\n",WRONG_ANSWER,4,324
1590982491224215552,abe2744e33bb397ffb9bb13afcb202f611378fb4fc5801202f03933298ce5f5d,2022-11-11 16:19:19,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n    public static void main(String[] args) throws IOException {\n        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n        int t =Integer.valueOf(reader.readLine());\n        for (int i = 0; i < t; i++) {\n            System.out.println(6);\n        }\n    }\n}\n,WRONG_ANSWER,228,17440
1590982651895418880,34d1cf71a2e3af8f7f6669b464d5dca494efd62633cf73f401f93fdeaa8e22e9,2022-11-11 16:19:57,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}\n",ACCEPTED,3,316
1590982696413761536,33bf53cc1ac96b08f54401ab68b14c30e1f5caef149cc9332585b7c5f09675ed,2022-11-11 16:20:08,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main()\n{\n    int t , i , re ;\n    cin >> t ;\n    long shu[t] ;\n    for (i = 0 ; i < t ; i++ )\n    {\n        cin >> shu[i];\n    }\n    for (i = 0 ; i < t-1; i++ )\n    {\n        if ( shu[i] != 0 )\n        {\n            re = 6 ;\n        }\n        else\n        {\n            re = 1 ;\n        }\n        cout << re << endl;\n    }\n    if ( shu[i] != 0 )\n        {\n            re = 6 ;\n        }\n        else\n        {\n            re = 1 ;\n        }\n        cout << re ;\n    return 0;\n}",ACCEPTED,12,600
1590982759424765952,beefe7893dd2cd421da3fb1ba3ffd90e3dc51d5301380baebfdfa12fbe5234f5,2022-11-11 16:20:23,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"a = 0\nn = int(input())\nif 2 <= n <= 100000:\n    for i in range(2, n+1):\n        for m in range(2, i):\n            if i % m == 0:\n                break\n         else:\n              a += 1\n    print(a)\n",NON_ZERO_EXIT_CODE,17,2788
1590982788675842048,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 16:20:30,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n\nmain()\n{\n    int n,w[11]={0},v[11]={0},i,max,sum=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&w[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&v[i]);\n    max=v[i]-w[i];\n    for(i=0;i<n;i++)\n    {\n        sum+=v[i]-w[i];\n        if(sum>max) \n            max=sum;\n    }\n    printf(\""%d\\n\"",max);\n    return 0;\n}\n",WRONG_ANSWER,7,324
1590982843566718976,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-11 16:20:43,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"num = int(input())\na=0\nfor i in range(2, num):\n    j = 2\n    for j in range(2, i):\n        if (i % j == 0):\n            break\n    else:\n        a+=1\nprint(a)\n",TIME_LIMIT_EXCEEDED,1000,2924
1590982948436881408,beefe7893dd2cd421da3fb1ba3ffd90e3dc51d5301380baebfdfa12fbe5234f5,2022-11-11 16:21:08,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"a = 0\nn = int(input())\nif 2 <= n <= 100000:\n    for i in range(2, n+1):\n        for m in range(2, i):\n            if i % m == 0:\n                break\n        else:\n            a += 1\n    print(a)\n",TIME_LIMIT_EXCEEDED,1000,2996
1590983117966475264,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-11 16:21:49,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"X,Y,Z=map(int,input(\""请输入三个整数：\"").split())\n0<=X,Y,Z<=100;\nx=8,y=7,z=3;\nprint(X,Y,Z)；",NON_ZERO_EXIT_CODE,16,2752
1590983128561287168,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-11 16:21:51,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"/*#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#include<string.h>\nint main()\n{int t,j,n;\nint x,len;\n char k[3000];\nscanf(\""%d\"",&t);\nint y[t];\nfor(j=0;j<t;j++)\n{\n    scanf(\""%d\"",&y[j]);\n\n}\nfor (j=0;j<t;j++)\n{\n     if(y[j]>=0&&y[j]<=int(pow(10,9))) {\n        k=char(pow(6,y[j]));\n        len=string(k);\n         x=int(k[len-1]);\n        printf(\""%d\"",x);\n     if(j<t-1) printf(\""\\n\"");\n}\n\nreturn 0;\n}\n}\n*/\n\n#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#include<string.h>\nint main()\n{int t,j,n,x;\nx=6;\nscanf(\""%d\"",&t);\nint y[t];\nfor(j=0;j<t;j++)\n{\n    scanf(\""%d\"",&y[j]);\n\n}\nfor (j=0;j<t;j++)\n{\n     if(y[j]>0) {\n        //n=int(pow(6,0));\n        //x=int(pow(6,y[j]))%10;\n        printf(\""%d\"",x);\n     if(j<t-1) printf(\""\\n\"");\n}\n    if(y[j]==0)\n    {\n        printf(\""1\"");\n        if(j<t-1) printf(\""\\n\"");\n    }\n}\nreturn 0;\n}",WRONG_ANSWER,6,332
1590983139097382912,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-11 16:21:54,Python,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"list = input().split(\"" \"")\nfor i in range(3):\n    list[i]=int(list[i])\naver=(list[0]+list[1]-list[2])\nprint(aver)",ACCEPTED,33,2872
1590983204071321600,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-11 16:22:09,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"X,Y,Z=map(int,input(\""请输入三个整数：\"").split())\nprint(X,Y,Z)；",NON_ZERO_EXIT_CODE,16,2876
1590983229031624704,44eff53b3369f1a61cc23d34ceef2d2de14a1f860795a5cf6565b8cf46bfc2ee,2022-11-11 16:22:15,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main(){\n    int a=2022;\n    printf(\""%d\"",a);\n    return 0;\n}",ACCEPTED,3,200
1590983245238415361,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-11 16:22:19,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"/*#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#include<string.h>\nint main()\n{int t,j,n;\nint x,len;\n char k[3000];\nscanf(\""%d\"",&t);\nint y[t];\nfor(j=0;j<t;j++)\n{\n    scanf(\""%d\"",&y[j]);\n\n}\nfor (j=0;j<t;j++)\n{\n     if(y[j]>=0&&y[j]<=int(pow(10,9))) {\n        k=char(pow(6,y[j]));\n        len=string(k);\n         x=int(k[len-1]);\n        printf(\""%d\"",x);\n     if(j<t-1) printf(\""\\n\"");\n}\n\nreturn 0;\n}\n}\n*/\n\n#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#include<string.h>\nint main()\n{int t,j,n,x;\nx=6;\nscanf(\""%d\"",&t);\nint y[t];\nfor(j=0;j<t;j++)\n{\n    scanf(\""%d\"",&y[j]);\n\n}\nfor (j=0;j<t;j++)\n{\n     if(y[j]>0) {\n        //n=int(pow(6,0));\n        //x=int(pow(6,y[j]))%10;\n        printf(\""%d\"",x);\n     if(j<t-1) printf(\""\\n\"");\n}\n    if(y[j]==0)\n    {\n        printf(\""1\"");\n        if(j<t-1) printf(\""\\n\"");\n    }\n}\nreturn 0;\n}",WRONG_ANSWER,8,324
1590983292927672320,ece045c1570c74e6800520e16047010817642535f83b9f2b4524ebdcf9d7925a,2022-11-11 16:22:30,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main() {\n\tint x,n,i,j;\n\tscanf(\""%d\"",&n);\n\tfor(i=2;i<=n;i++)\n\t{\n\t\tint k=0;\n\t\tfor(j=1;j<=i;j++)\n\t\t{\n\t\tif(i%j==0)\n\t\tk++;\n      \t}\n      \tif(k<=2)\n      \tx++;\n\t}\n\tprintf(\""%d\"",x);\n}\n",TIME_LIMIT_EXCEEDED,1000,340
1590983292940255232,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-11 16:22:30,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"X,Y,Z=map(int,input(\""请输入三个整数：\"").split())\nprint(X,Y,Z)；\n8,7,3",NON_ZERO_EXIT_CODE,18,2872
1590983294441816064,46a5b5de1986c03ade4ef3715390240d3b4a1729dbb6afcb5e53fc1bee0f1a07,2022-11-11 16:22:31,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n\tScanner sc=new Scanner(System.in);\n\t\t\t int x=sc.nextInt();\n\t\t\t int array[]=new int[20];\n\t\t\t int b=0;\n\t\t\t for(int i=0;i<x;i++) {\n\t\t\t\t array[i]=sc.nextInt();\n\t\t\t }\n\t\t\t for(int i=1;i<=x;i++) {\n\t\t\t\t for(int j=0;j<i;j++) {\n\t\t\t\t\t b=(int) Math.pow(6,array[j]);\t \n\t\t\t\t}\n\t\t\t\t System.out.println(6);\n\t\t\t }\n\t\t\t sc.close();\n\t}\n}\n",WRONG_ANSWER,277,16816
1590983324145881088,1b00b3d29099722d8332b35e3af5e54fda309b4f7c9fc6261f618ecd2a4d7390,2022-11-11 16:22:38,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,j,c=0,k;//c初始能量值,k闯关数\n    scanf(\""%d\"",&n);\n    int a[n],b[n],max;\n    max=0;\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);//每关消耗能量\n    for(j=0;j<n;j++)\n        scanf(\""%d\"",&b[j]);//每关获得能量\n    for(k=0;k<n;k++)\n    {\n            c=b[k]-a[k]+c;\n        if(c>max) max=c;\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",WRONG_ANSWER,3,328
1590983365665271808,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 16:22:48,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\nint a[100],n,i;\n\n    scanf(\""%d\"",&n);\nfor(i=0;i<n;i++)\n{\n\tscanf(\""%d\"",&a[i]);\n\n        if(a[i]=0)\n            printf(\""%d\\n\"",1);\n        else\nprintf(\""%d\\n\"",6);\n}\n\n\n\n\n    return 0;\n}\n\n\n\n\n\n\n\n\n\n",WRONG_ANSWER,10,380
1590983426533011456,423e1acd0d02cf3d43f3c7805099dea4edcb39c2e0fa385e82823b5a7c0dd214,2022-11-11 16:23:02,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"\n#include <stdio.h>\n#include<math.h>\nint main()\n{\n    int t;\n    scanf(\""%d\"", &t);\n    int n[100];\n    int i,a;\n     for (i = 0; i < t;i++)\n    {\n         if(scanf(\""%d\"", &n[i])==1)\n         {\n             a = pow(6,n[i]);\n         printf(\""%d\\n\"", a % 10);\n         }\n         else\n                printf(\""wrong\\n\"");\n    }\n return 0;\n}",WRONG_ANSWER,8,356
1590983472024432640,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 16:23:13,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\nint a[100],n,i;\n\n    scanf(\""%d\"",&n);\nfor(i=0;i<n;i++)\n{\n\tscanf(\""%d\"",&a[i]);\n\n        if(a[i]=0)\n            printf(\""1\\n\"");\n        else\nprintf(\""6\\n\"");\n}\n\n\n\n\n    return 0;\n}\n\n\n\n\n\n\n\n\n\n",WRONG_ANSWER,8,472
1590983559022706688,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-11 16:23:34,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"X,Y,Z=map(int,input(\""请输入三个整数：\"").split())\nprint(X,Y,Z)；\n8,7,3\ntype(X)\n<class 'int'>",NON_ZERO_EXIT_CODE,18,2772
1590983663351824384,abe2744e33bb397ffb9bb13afcb202f611378fb4fc5801202f03933298ce5f5d,2022-11-11 16:23:59,Java,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n    public static void main(String[] args) throws IOException {\n        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n        int t =Integer.valueOf(reader.readLine());\n        String[] string = reader.readLine().split(\"" \"");\n        for (int i = 0; i < t; i++) {\n            if (string[i].equals(\""0\"")){\n                System.out.println(1);\n            }\n            else\n            System.out.println(6);\n        }\n    }\n}\n",ACCEPTED,227,16944
1590983689683664896,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-11 16:24:05,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"print(\""2022\"")",ACCEPTED,21,2688
1590983722780917760,f1feb45d46abad163f730e5b023ce1df76883054d0a1741228a76c2c69aa3eda,2022-11-11 16:24:13,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n    int i,j;\n    scanf(\""%d\"",&i);\n    for(j=0;j<i;j++){\n        scanf(\""%d\"",&k);\n        if(k!=0)\n            printf(\""%d\"",6);\n        else\n            printf(\""%d\"",1);\n    }\n}",COMPILE_ERROR,0,0
1590983790548287488,f1feb45d46abad163f730e5b023ce1df76883054d0a1741228a76c2c69aa3eda,2022-11-11 16:24:29,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int i,j;\n    scanf(\""%d\"",&i);\n    for(j=0;j<i;j++){\n        scanf(\""%d\"",&k);\n        if(k!=0)\n            printf(\""%d\"",6);\n        else\n            printf(\""%d\"",1);\n    }\n}",COMPILE_ERROR,0,0
1590983832566804480,44eff53b3369f1a61cc23d34ceef2d2de14a1f860795a5cf6565b8cf46bfc2ee,2022-11-11 16:24:39,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main(){\n    int x,y,z,c;\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    c=x+y-z;\n    printf(\""%d\"",c);\n    return 0;\n}",ACCEPTED,6,344
1590983986107715584,f1feb45d46abad163f730e5b023ce1df76883054d0a1741228a76c2c69aa3eda,2022-11-11 16:25:16,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int i,j;\n    scanf(\""%d\"",&i);\n    for(j=0;j<i;j++){\n        scanf(\""%d\"",&k);\n        if(k!=0)\n            printf(\""%d\"",6);\n        else\n            printf(\""%d\"",1);\n        if(j<i-1)\n            printf(\""\\n\"")\n    }\n}",COMPILE_ERROR,0,0
1590984014066921472,f1feb45d46abad163f730e5b023ce1df76883054d0a1741228a76c2c69aa3eda,2022-11-11 16:25:22,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int i,j;\n    scanf(\""%d\"",&i);\n    for(j=0;j<i;j++){\n        scanf(\""%d\"",&k);\n        if(k!=0)\n            printf(\""%d\"",6);\n        else\n            printf(\""%d\"",1);\n        if(j<i-1)\n            printf(\""\\n\"");\n    }\n}",COMPILE_ERROR,0,0
1590984017229447168,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 16:25:23,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n\nmain()\n{\n    int n,w[11]={0},v[11]={0},i,max,sum=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&w[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&v[i]);\n    /*max=v[i]-w[i];\n    for(i=0;i<n;i++)\n    {\n        sum+=v[i]-w[i];\n        if(sum>max) \n            max=sum;\n    }\n    printf(\""%d\\n\"",max);*/\n    printf(\""25\"");\n    return 0;\n}\n",WRONG_ANSWER,4,308
1590984057725456384,46a5b5de1986c03ade4ef3715390240d3b4a1729dbb6afcb5e53fc1bee0f1a07,2022-11-11 16:25:33,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n\tScanner sc=new Scanner(System.in);\n\t\t\t int x=sc.nextInt();\n\t\t\t int array[]=new int[20];\n\t\t\t int b=0,a=0;\n\t\t\t for(int i=0;i<x;i++) {\n\t\t\t\t array[i]=sc.nextInt();\n\t\t\t }\n\t\t\t for(int i=1;i<=x;i++) {\n\t\t\t\t for(int j=0;j<i;j++) {\n\t\t\t\t\t b=(int) Math.pow(6,array[j]);\t \n\t\t\t\t}\n\t\t\t\t a=b%10;\n\t\t\t\t System.out.println(a);\n\t\t\t }\n\t\t\t sc.close();\n\t}\n}\n",WRONG_ANSWER,249,16652
1590984066646736896,262cde49cc56abe96630625fe60c7207e4f635bd56c839389b503b1f360d8ab2,2022-11-11 16:25:35,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"# include\n# include\nbool isPrime(int n);\nint main()\n{\nint n,a;\na=0;\nscanf(\""%d\"", &n);\nfor (int i = 2; i < n; i++) {\nif (isPrime(i)) {\na++;\n}\n}\nprintf(\""%d\"",a);\nreturn 0;\n}\nbool isPrime(int n)\n{\nfor (int i = 2; i < n; i++) {\nif (n % i == 0) {\nreturn false;\n}\n}\nreturn true;\n}",COMPILE_ERROR,0,0
1590984090176786432,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 16:25:40,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"", &n);\n    int arr1[10000] = { 0 };\n    int arr2[10000] = { 0 };\n    for (int i = 0; i < n; ++i)\n    {\n        scanf(\""%d\"", &arr1[i]);\n    }\n    for (int j = 0; j < n; ++j)\n    {\n        scanf(\""%d\"", &arr2[j]);\n    }\n    int max1 = 0, max2 = 0, max3 = 0, count = 0, k = 0;\n    for (k = 0; k < n; ++k)\n    {\n        int sum = arr2[k] - arr1[k];\n        if (sum <= 0)\n        {\n            if (max3 == 0)\n            {\n                max3 = sum;\n            }\n            if (sum > max3)\n            {\n                max3 = sum;\n            }\n            count++;\n            max2 = 0;\n        }\n        else\n        {\n            max2 += sum;\n        }\n        if (max1 < max2)\n        {\n            max1 = max2;\n        }\n    }\n    if (count == n)\n    {\n        printf(\""%d\"", max3);\n    }\n    else\n    {\n        printf(\""%d\"", max1);\n    }\n    return 0;\n}",WRONG_ANSWER,5,308
1590984134636404736,f1feb45d46abad163f730e5b023ce1df76883054d0a1741228a76c2c69aa3eda,2022-11-11 16:25:51,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int i,j,k;\n    scanf(\""%d\"",&i);\n    for(j=0;j<i;j++){\n        scanf(\""%d\"",&k);\n        if(k!=0)\n            printf(\""%d\"",6);\n        else\n            printf(\""%d\"",1);\n        if(j<i-1)\n            printf(\""\\n\"");\n    }\n}",ACCEPTED,9,348
1590984170279600128,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 16:25:59,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) throws Exception{\n        Scanner sc=new Scanner(System.in);\n        int x=sc.nextInt();\n        int[] n=new int[x];\n        for (int i = 0; i <x; i++) {\n            int q=sc.nextInt();\n            n[i]=(int)Math.pow(6,q);\n        }\n        for (int i = 0; i <x; i++){\n            System.out.println(Integer.toString(n[i]%10));\n        }\n    }\n}",WRONG_ANSWER,244,16856
1590984175639900160,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-11 16:26:01,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"X,Y,Z=map(int,input(\""请输入三个整数：\"").split())\n请输入三个整数：8,7,3\nprint(X,Y,Z)；\n",NON_ZERO_EXIT_CODE,15,2756
1590984228311994368,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-11 16:26:13,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"X,Y,Z=map(int,input(\""请输入三个整数：\"").split())\n请输入三个整数：8,7,3\nprint(X,Y,Z)；\n",NON_ZERO_EXIT_CODE,17,2756
1590984247823896576,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 16:26:18,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int n,a;\n    cin>>n;\n    for(int i=1;i<=n;i++)\n    {cin>>a;\n    if(a==0)printf(\""1\\n\"");\n     else printf(\""6\\n\"");\n     \n    }\n    return 0;\n}\n\n\n\n\n\n\n\n\n",COMPILE_ERROR,0,0
1590984272956166144,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-11 16:26:24,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"X,Y,Z=map(int,input(\""请输入三个整数：\"").split())\n请输入三个整数:8,7,3\nprint(X,Y,Z)；\n",NON_ZERO_EXIT_CODE,19,2756
1590984293428559872,423e1acd0d02cf3d43f3c7805099dea4edcb39c2e0fa385e82823b5a7c0dd214,2022-11-11 16:26:29,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"\n#include <stdio.h>\n#include<math.h>\nint main()\n{\n    int t;\n    if(scanf(\""%d\"", &t)==1)\n    {\n       int n[100];\n       int i,a;\n        for (i = 0; i < t;i++)\n        {\n          if(scanf(\""%d\"", &n[i])==1)\n           {\n             a = pow(6,n[i]);\n             printf(\""%d\\n\"", a % 10);\n           }\n         else\n                printf(\""wrong\\n\"");\n         } \n    }\n   else\n       printf(\""wrong\\n\"");\n return 0;\n}",WRONG_ANSWER,9,340
1590984301083168768,7222c2fb91a71fcf3f6560860557ab564f69a453594c9f1620ecc35bb26f5daf,2022-11-11 16:26:31,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#inclde <stdio.h>\nint main (){\n    \n    int X,Y,Z;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    printf(\""%d\"",X+Y-Z);\n}",COMPILE_ERROR,0,0
1590984339993726976,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 16:26:40,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int n,a;\n    cin>>n;\n    for(int i=1;i<=n;i++)\n    {cin>>a;\n    if(a==0)printf(\""1\\n\"");\n     else printf(\""6\\n\"");\n     \n    }\n    return 0;\n}\n\n\n\n\n\n\n\n\n",ACCEPTED,10,468
1590984426295726080,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 16:27:00,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n\nmain()\n{\n    int n,w[11]={0},v[11]={0},i,max,sum=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&w[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&v[i]);\n    max=v[i]-w[i];\n    for(i=0;i<n;i++)\n        for(j=i;j<n;j++)\n    {\n        sum+=v[j]-w[j];\n        if(sum>max) \n            max=sum;\n    }\n    printf(\""%d\\n\"",max);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590984453214744576,262cde49cc56abe96630625fe60c7207e4f635bd56c839389b503b1f360d8ab2,2022-11-11 16:27:07,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include\n#include\nbool isPrime(int n);\nint main()\n{\nint n,a;\na=0;\nscanf(\""%d\"",&n);\nfor(int i = 2; i < n; i++){\nif(isPrime(i)){\na++;\n}\n}\nprintf(\""%d\"",a);\nreturn 0;\n}\nbool isPrime(int n)\n{\nfor(int i = 2; i < n; i++){\nif(n%i==0){\nreturn false;\n}\n}\nreturn true;\n}",COMPILE_ERROR,0,0
1590984458751246336,46a5b5de1986c03ade4ef3715390240d3b4a1729dbb6afcb5e53fc1bee0f1a07,2022-11-11 16:27:08,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n\tScanner sc=new Scanner(System.in);\n\t\t\t int x=sc.nextInt();\n\t\t\t int array[]=new int[20];\n\t\t\t int b=0,a=0;\n\t\t\t for(int i=0;i<x;i++) {\n\t\t\t\t array[i]=sc.nextInt();\n                 System.out.println(6);\n\t\t\t }\n }\n}\n",WRONG_ANSWER,261,16636
1590984545531375616,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 16:27:29,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n\nmain()\n{\n    int n,w[11]={0},v[11]={0},i,j,max,sum=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&w[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&v[i]);\n    max=v[i]-w[i];\n    for(i=0;i<n;i++)\n        for(j=i;j<n;j++)\n    {\n        sum+=v[j]-w[j];\n        if(sum>max) \n            max=sum;\n    }\n    printf(\""%d\\n\"",max);\n    return 0;\n}\n",WRONG_ANSWER,3,196
1590984611306475520,7222c2fb91a71fcf3f6560860557ab564f69a453594c9f1620ecc35bb26f5daf,2022-11-11 16:27:45,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#inclde <stdio.h>\nint main (){\n    \n    int X,Y,Z;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    printf(\""%d\"",X+Y-Z);\n    retirn 0;\n}",COMPILE_ERROR,0,0
1590984640528191488,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 16:27:52,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"", &n);\n    int arr1[10000] = { 0 };\n    int arr2[10000] = { 0 };\n    for (int i = 0; i < n; ++i)\n    {\n        scanf(\""%d\"", &arr1[i]);\n    }\n    for (int j = 0; j < n; ++j)\n    {\n        scanf(\""%d\"", &arr2[j]);\n    }\n    int max1 = 0, max2 = 0, max3 = 0, count = 0, k = 0;\n    for (k = 0; k < n; ++k)\n    {\n        int sum = arr2[k] - arr1[k];\n        max2 += sum;\n        if (sum <= 0)\n        {\n            if (max3 == 0)\n            {\n                max3 = sum;\n            }\n            if (sum > max3)\n            {\n                max3 = sum;\n            }\n            count++;\n            max2 = 0;\n        }\n        if (max1 < max2)\n        {\n            max1 = max2;\n        }\n    }\n    if (count == n)\n    {\n        printf(\""%d\"", max3);\n    }\n    else\n    {\n        printf(\""%d\"", max1);\n    }\n    return 0;\n}",WRONG_ANSWER,4,452
1590984715555901440,7222c2fb91a71fcf3f6560860557ab564f69a453594c9f1620ecc35bb26f5daf,2022-11-11 16:28:09,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#inclde <stdio.h>\nint main (){\n    \n    int X,Y,Z;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    printf(\""%d\"",X+Y-Z);\n    return 0;\n}",COMPILE_ERROR,0,0
1590984775052103680,7222c2fb91a71fcf3f6560860557ab564f69a453594c9f1620ecc35bb26f5daf,2022-11-11 16:28:24,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main (){\n    \n    int X,Y,Z;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    printf(\""%d\"",X+Y-Z);\n    return 0;\n}",ACCEPTED,6,484
1590984824356143104,262cde49cc56abe96630625fe60c7207e4f635bd56c839389b503b1f360d8ab2,2022-11-11 16:28:35,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<stdbool.h>\nbool isPrime(int n);\nint main()\n{\nint n,a;\na=0;\nscanf(\""%d\"",&n);\nfor(int i = 2; i < n; i++){\nif(isPrime(i)){\na++;\n}\n}\nprintf(\""%d\"",a);\nreturn 0;\n}\nbool isPrime(int n)\n{\nfor(int i = 2; i < n; i++){\nif(n%i==0){\nreturn false;\n}\n}\nreturn true;\n}",ACCEPTED,962,320
1590984846661455872,a27ecb139a3fa065feadb903517977dc609a6d218c4e082e7ec449c78806823c,2022-11-11 16:28:41,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int t,i,x,y;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<t;i++)\n    {\n        x=pow(6,a[i]);\n        y=x%10;\n        printf(\""%d\\n\"",y);\n    }\n\n    return 0;\n}\n",WRONG_ANSWER,7,512
1590984913128591360,423e1acd0d02cf3d43f3c7805099dea4edcb39c2e0fa385e82823b5a7c0dd214,2022-11-11 16:28:57,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"\n#include <stdio.h>\n#include<math.h>\nint main()\n{\n    int t;\n    if(scanf(\""%d\"", &t)==1)\n    {\n       int n[100];\n       int i,a;\n        for (i = 0; i < t;i++)\n        {\n          if(0<=scanf(\""%d\"", &n[i])<=pow(10,9))\n           {\n             a = pow(6,n[i]);\n             printf(\""%d\\n\"", a % 10);\n           }\n         else\n                printf(\""wrong\\n\"");\n         } \n    }\n   else\n       printf(\""wrong\\n\"");\n return 0;\n}",WRONG_ANSWER,8,608
1590984936276955136,ece045c1570c74e6800520e16047010817642535f83b9f2b4524ebdcf9d7925a,2022-11-11 16:29:02,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main() {\n\tint x,n,i,j;\n\tscanf(\""%d\"",&n);\n\tfor(i=2;i<=n;i++)\n\t{\n\t\tint k=0;\n\t\tfor(j=2;j<i;j++)\n\t\t{\n\t\tif(i%j==0)\n\t\tk++;\n\t\tif(k>0)\n\t\tbreak;\n      \t}\n      \tif(k==0)\n      \tx++;\n\t}\n\tprintf(\""%d\\n\"",x);\n}\n",ACCEPTED,961,468
1590984959563730944,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-11 16:29:08,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"0=<X,Y,Z=<100;\nX,Y,Z=map(int,input(\""请输入三个整数：\"").split())\nprint(X+Y-Z)；\n",NON_ZERO_EXIT_CODE,18,2748
1590984970095624192,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 16:29:10,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"", &n);\n    int arr1[1000] = { 0 };\n    int arr2[1000] = { 0 };\n    for (int i = 0; i < n; ++i)\n    {\n        scanf(\""%d\"", &arr1[i]);\n    }\n    for (int j = 0; j < n; ++j)\n    {\n        scanf(\""%d\"", &arr2[j]);\n    }\n    int max1 = 0, max2 = 0, max3 = 0, count = 0, k = 0;\n    for (k = 0; k < n; ++k)\n    {\n        int sum = arr2[k] - arr1[k];\n        max2 += sum;\n        if (sum <= 0)\n        {\n            if (max3 == 0)\n            {\n                max3 = sum;\n            }\n            if (sum > max3)\n            {\n                max3 = sum;\n            }\n            count++;\n            max2 = 0;\n        }\n        if (max1 < max2)\n        {\n            max1 = max2;\n        }\n    }\n    if (count == n)\n    {\n        //printf(\""%d\"", max3);\n        printf(\""0\"");\n        \n    }\n    else\n    {\n        printf(\""%d\"", max1);\n    }\n    return 0;\n}",WRONG_ANSWER,3,348
1590985011388551168,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 16:29:20,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"", &n);\n    int arr1[10000] = { 0 };\n    int arr2[10000] = { 0 };\n    for (int i = 0; i < n; ++i)\n    {\n        scanf(\""%d\"", &arr1[i]);\n    }\n    for (int j = 0; j < n; ++j)\n    {\n        scanf(\""%d\"", &arr2[j]);\n    }\n    int max1 = 0, max2 = 0, max3 = 0, count = 0, k = 0;\n    for (k = 0; k < n; ++k)\n    {\n        int sum = arr2[k] - arr1[k];\n        max2 += sum;\n        if (sum <= 0)\n        {\n            if (max3 == 0)\n            {\n                max3 = sum;\n            }\n            if (sum > max3)\n            {\n                max3 = sum;\n            }\n            count++;\n            max2 = 0;\n        }\n        if (max1 < max2)\n        {\n            max1 = max2;\n        }\n    }\n    if (count == n)\n    {\n        //printf(\""%d\"", max3);\n        printf(\""0\"");\n        \n    }\n    else\n    {\n        printf(\""%d\"", max1);\n    }\n    return 0;\n}",WRONG_ANSWER,4,308
1590985055571349504,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 16:29:30,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"", &n);\n    int arr1[10000] = { 0 };\n    int arr2[10000] = { 0 };\n    for (int i = 0; i < n; ++i)\n    {\n        scanf(\""%d\"", &arr1[i]);\n    }\n    for (int j = 0; j < n; ++j)\n    {\n        scanf(\""%d\"", &arr2[j]);\n    }\n    int max1 = 0, max2 = 0, max3 = 0, count = 0, k = 0;\n    for (k = 0; k < n; ++k)\n    {\n        int sum = arr2[k] - arr1[k];\n        max2 += sum;\n        if (sum <= 0)\n        {\n            if (max3 == 0)\n            {\n                max3 = sum;\n            }\n            if (sum > max3)\n            {\n                max3 = sum;\n            }\n            count++;\n            max2 = 0;\n        }\n        if (max1 < max2)\n        {\n            max1 = max2;\n        }\n    }\n    if (count == n)\n    {\n        printf(\""%d\"", max3);\n    }\n    else\n    {\n        printf(\""%d\"", max1);\n    }\n    return 0;\n}",WRONG_ANSWER,3,316
1590985082372952064,8cf8229a23351e1ca2a7bfc1ad0af3ab2ad4a709a7c796637dbdea7befc2b0ec,2022-11-11 16:29:37,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016," #include<stdio.h>\n#include<string.h>\n#include<math.h>\n\nint flag[10006];\nint num[10000],total,now,n;\n\nvoid solve(int index,int Mul,int K){\n      int i,t;\n   if(K==0){\n    now+=n/Mul;\n    return;\n   }\n   for(i=index;i<total-K+1;i++){\n     Mul*=num[i];\n     t=now;\n     if(Mul<=n){\n              solve(i+1,Mul,K-1);\n     }\n     if(t==now)//优化剪枝（1）\n      return;\n           Mul/=num[i];\n   }\n}\n\nint Judge(int x){\n int t,i;\n t=sqrt(x*1.0);\n for(i=2;i<=t;i++)\n  if(n%i==0)\n   return 0;\n return 1;\n}\n\nint main(){\n    int i,j,t,Count;\n memset(flag,0,sizeof(flag));\n for(i=2;i<=10000;i++){\n  if(flag[i])\n   continue;\n  for(j=2;j*i<=10000;j++)\n   flag[i*j]=1;\n }\n while(scanf(\""%d\"",&n)==1){\n  Count=0;\n  if(n<=10000){\n   for(i=2;i<n;i++)\n    if(!flag[i])\n     Count++;\n  }\n  else{\n   t=sqrt(1.0*n);\n   total=0;\n   for(i=2;i<=t;i++)\n    if(!flag[i])\n     num[total++]=i;\n   for(i=1;i<=total;i++){\n    now=0;\n    solve(0,1,i);\n    if(now==0)//优化(2)\n     break;\n    if(i&1)\n       Count+=now;\n    else\n       Count-=now;\n   }\n   Count-=total;\n   Count=n-Count-1;\n   if(Judge(n))\n    Count--;\n  }\n  printf(\""%d\\n\"",Count);\n }\n return 0;\n}\n\n",ACCEPTED,6,328
1590985137247031296,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-11 16:29:50,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"0=<X,Y,Z=<100;\nX,Y,Z=map(int,input(\""请输入三个整数:\"").split())\nprint(X+Y-Z)；\n",NON_ZERO_EXIT_CODE,16,2896
1590985173611642880,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-11 16:29:59,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"0=<X,Y,Z=<100;\nX,Y,Z=map(int,input(\""请输入三个整数：\"").split())\nprint(X+Y-Z)；\n",NON_ZERO_EXIT_CODE,17,2784
1590985238078074880,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-11 16:30:14,Python,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"x,y,z = map(int,input().split())\nif 0<=x<=100 and 0<=y<=100 and 0<=z<=100:\n    print(x+y-z)",ACCEPTED,40,3028
1590985315777556480,44eff53b3369f1a61cc23d34ceef2d2de14a1f860795a5cf6565b8cf46bfc2ee,2022-11-11 16:30:33,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdbool.h>\nbool isPrime(int n);\nint main(){\n    int n,a;\n    a=0;\n        scanf(\""%d\"",&n);\n    for(int i=2;i<n;i++){\n        if(isPrime(i)){\n            a++;\n        }\n    }\n    printf(\""%d\"",a);\n    return 0;\n}\nbool isPrime(int n){\n    for(int i=2;i<n;i++){\n        if(n%i==0){\n            return false;\n        }\n    }\n    return true;\n}",ACCEPTED,953,344
1590985348572839936,2e4af98c441106efa9ee51f8a781d0eee91a3dff6193987d421eb3a48725c814,2022-11-11 16:30:40,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <iostream>\n\nusing namespace std;\n\nint main() {\n    int n, i;\n    scanf(\""%d\"", &n);\n    int a1[n], b1[n], c1[n];\n\n    for (int j = 0; j < n; ++j) {\n        scanf(\""%d\"", &a1[j]);\n    }\n    for (int j = 0; j < n; ++j) {\n        scanf(\""%d\"", &b1[j]);\n    }\n    for (i = 0; i < n; ++i) {\n        c1[i] = b1[i] - a1[i];\n    }\n//    for (int j = 0; j < n; ++j) {\n//        printf(\""%d \"", c1[j]);\n//    }\n//    -1 -1 -1 969 -1 -1 -1 -1 563;\n    int j = n, temp;\n    i = 0;\n    while (i < n && c1[i++] < 0);\n    temp = c1[i - 1];\n//    printf(\""temp=%d\\n\"", temp);\n//    printf(\""i=%d\\n\"", i);\n    while (j > 0 && c1[--j] < 0);\n//    printf(\""j=%d\\n\"", j);\n//    printf(\""===================\\n\"");\n    for (int k = i; k <= j; ++k) {\n        if (temp <= 0 && k + 1 < n) {\n            temp = c1[k + 1] < 0 ? 0 : c1[k + 1];\n            k++;\n            continue;\n        }\n        temp += c1[k];\n//        printf(\""%d\\n\"", temp);\n    }\n    printf(\""%d\"", temp);\n    return 0;\n}\n\n\n//10\n//-3 4 5 -6 8 9 -4 5 9 -4\n//3 2 4 5 -6 -7 -7 5 -8 4\n//6 -2 -1 11 -14 -16 -3 0 -17 8\n",WRONG_ANSWER,5,320
1590985366763536384,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-11 16:30:45,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"0<=X,Y,Z<=100;\nX,Y,Z=map(int,input(\""请输入三个整数：\"").split())\nprint(X+Y-Z)；\n",NON_ZERO_EXIT_CODE,16,2748
1590985398636032000,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-11 16:30:52,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"0<=X,Y,Z<=100;\nX,Y,Z=map(int,input(\""请输入三个整数：\"").split())\nprint(X+Y-Z)；\n",NON_ZERO_EXIT_CODE,18,2784
1590985408907907072,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 16:30:55,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n\nmain()\n{\n    int n,w[11]={0},v[11]={0},i,j,max,sum;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&w[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&v[i]);\n    max=v[i]-w[i];\n    for(i=0;i<n;i++)\n        for(j=i,sum=0;j<n;j++)\n    {\n        sum+=v[j]-w[j];\n        if(sum>max) \n            max=sum;\n    }\n    printf(\""%d\\n\"",max);\n    return 0;\n}\n",WRONG_ANSWER,4,180
1590985464109142016,a27ecb139a3fa065feadb903517977dc609a6d218c4e082e7ec449c78806823c,2022-11-11 16:31:08,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int t,i,x,y;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<t;i++)\n    {\n        x=pow(6,a[i]);\n        y=x%10;\n        printf(\""%d\\n\"",y);\n    }\n\n    return 0;\n}\n",WRONG_ANSWER,8,348
1590985666329116672,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-11 16:31:56,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"0<=X,Y,Z<=100\nX,Y,Z=map(int,input(\""请输入三个整数：\"").split())\nprint(X,Y,Z)\n",NON_ZERO_EXIT_CODE,17,2888
1590985705126428672,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 16:32:05,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) throws Exception{\n        Scanner sc=new Scanner(System.in);\n        int x=sc.nextInt();\n\n        List<Integer> n=new ArrayList<>();\n        if (x >= 0) {\n            for (int i = 0; i <x; i++) {\n                int q=sc.nextInt();\n                n.add((int)Math.pow(6,q));\n            }\n            for (int i = 0; i <x; i++){\n                System.out.println(n.get(i)%10);\n            }\n        }\n    }\n}",COMPILE_ERROR,0,0
1590985751557353472,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-11 16:32:16,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"0<=X,Y,Z<=100\nX,Y,Z=map(int,input(\""请输入三个整数：\"").split())\nprint(X,Y,Z)\nprint(X+Y-Z)\n",NON_ZERO_EXIT_CODE,16,2800
1590985800492318720,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 16:32:28,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\nimport java.util.ArrayList;\nimport java.util.List\n\npublic class Main {\n    public static void main(String[] args) throws Exception{\n        Scanner sc=new Scanner(System.in);\n        int x=sc.nextInt();\n\n        List<Integer> n=new ArrayList<>();\n        if (x >= 0) {\n            for (int i = 0; i <x; i++) {\n                int q=sc.nextInt();\n                n.add((int)Math.pow(6,q));\n            }\n            for (int i = 0; i <x; i++){\n                System.out.println(n.get(i)%10);\n            }\n        }\n    }\n}",COMPILE_ERROR,0,0
1590985800693649408,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-11 16:32:28,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"0<=X,Y,Z<=100\nX,Y,Z=map(int,input(\""请输入三个整数：\"").split())\nprint(X+Y-Z)\n",NON_ZERO_EXIT_CODE,23,3124
1590985848571625472,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 16:32:40,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\nimport java.util.*;\n\npublic class Main {\n    public static void main(String[] args) throws Exception{\n        Scanner sc=new Scanner(System.in);\n        int x=sc.nextInt();\n\n        List<Integer> n=new ArrayList<>();\n        if (x >= 0) {\n            for (int i = 0; i <x; i++) {\n                int q=sc.nextInt();\n                n.add((int)Math.pow(6,q));\n            }\n            for (int i = 0; i <x; i++){\n                System.out.println(n.get(i)%10);\n            }\n        }\n    }\n}",NON_ZERO_EXIT_CODE,268,19772
1590985871921319936,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 16:32:45,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\nimport java.util.*;\n\npublic class Main {\n    public static void main(String[] args) throws Exception{\n        Scanner sc=new Scanner(System.in);\n        int x=sc.nextInt();\n\n        List<Integer> n=new ArrayList<>();\n        if (x >= 0) {\n            for (int i = 0; i <x; i++) {\n                int q=sc.nextInt();\n                n.add((int)Math.pow(6,q));\n            }\n            for (int i = 0; i <x; i++){\n                System.out.println(n.get(i)%10);\n            }\n        }\n    }\n}",NON_ZERO_EXIT_CODE,237,16860
1590985942742142976,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-11 16:33:02,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"0<=X,Y,Z<=100\nX,Y,Z=map(int,input(\""请输入三个整数：\"").split(8,7,3))\nprint(X+Y-Z)\n",NON_ZERO_EXIT_CODE,17,2748
1590985956025479168,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-11 16:33:05,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"0<=X,Y,Z<=100\nX,Y,Z=map(int,input(\""请输入三个整数：\"").split(8,7,3))\nprint(X+Y-Z)\n",NON_ZERO_EXIT_CODE,15,2764
1590986000720003072,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-11 16:33:16,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"/*#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#include<string.h>\nint main()\n{int t,j,n;\nint x,len;\n char k[3000];\nscanf(\""%d\"",&t);\nint y[t];\nfor(j=0;j<t;j++)\n{\n    scanf(\""%d\"",&y[j]);\n\n}\nfor (j=0;j<t;j++)\n{\n     if(y[j]>=0&&y[j]<=int(pow(10,9))) {\n        k=char(pow(6,y[j]));\n        len=string(k);\n         x=int(k[len-1]);\n        printf(\""%d\"",x);\n     if(j<t-1) printf(\""\\n\"");\n}\n\nreturn 0;\n}\n}\n*/\n/*\n#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#include<string.h>\nint main()\n{int t,j,n,x;\nx=6;\nscanf(\""%d\"",&t);\nint y[t];\nfor(j=0;j<t;j++)\n{\n    scanf(\""%d\"",&y[j]);\n\n}\nfor (j=0;j<t;j++)\n{\n     if(y[j]>0) {\n        //n=int(pow(6,0));\n        //x=int(pow(6,y[j]))%10;\n        printf(\""%d\"",x);\n     if(j<t-1) printf(\""\\n\"");\n}\n    if(y[j]==0)\n    {\n        printf(\""1\"");\n        if(j<t-1) printf(\""\\n\"");\n    }\n}\nreturn 0;\n}*/\n#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main()\n{int t,j,n,x;\nx=6;\nscanf(\""%d\"",&t);\nint y;\nfor (j=0;j<t;j++)\n{\n    scanf(\""%d\"",&y);\n    if(y>0) printf(\""6\\n\"");\n    else printf(\""1\\n\"");\n\n}\nreturn 0;\n}",WRONG_ANSWER,6,196
1590986052733566976,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 16:33:28,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n\nmain()\n{\n    int n,w[11]={0},v[11]={0},i,j,max,sum;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&w[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&v[i]);\n    max=v[i]-w[i];\n    for(i=0;i<n;i++)\n        for(j=i,sum=0;j<n;j++)\n    {\n        sum+=v[j]-w[j];\n        if(sum>max) \n            max=sum;\n    }\n    printf(\""%d\\n\"",max);\n    return 0;\n}\n",WRONG_ANSWER,3,344
1590986066037878784,505c5b9a1b6d591a815315d95a57743fb98dad691b51421b4de282392fef3f43,2022-11-11 16:33:31,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"x=int(input(\""请输入第一个数字：\""))+int(input(\""请输入第二个数字：\""))-int(input(\""请输入第三个数字：\""))\nprint(x)\n\n",NON_ZERO_EXIT_CODE,19,2748
1590986102100504576,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-11 16:33:40,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"0<=X,Y,Z<=100\nX,Y,Z=map(int,input(\""请输入三个整数：\"").split(8,7,3))\nprint(X+Y-Z)\n",NON_ZERO_EXIT_CODE,15,2760
1590986118382817280,19b1d22e5c87afa9233c236fc7b4d5e0e70acf3872968cbe9aae96e75e9e38d1,2022-11-11 16:33:44,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <iostream>\n#include <vector>\nusing namespace std;\n\nint main(){\n    vector<int> a;\n    int n,temp;\n    cin >> n;\n\n    for(int i=0; i < n ; i++){\n        cin >> temp;\n        a.push_back(temp);\n    }\n\n    for(int i=0; i < n ; i++){\n        if(a.at(i) == 0)\n            cout<<1<<endl;\n        else\n            cout<<6<<endl;\n    }\n\n    return 0;\n}",ACCEPTED,13,476
1590986149806542848,9819f13d6a58d50fa249ad037641119dadb52afb3f125db258771564f27d2ca5,2022-11-11 16:33:51,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main() {\n\tint n, a;\n\tscanf(\""%d\"", &n);\n\twhile (n--) {\n\t\tscanf(\""%d\"", &a);\n\t\tif(a==0){\n            printf(\""1\"");\n        }else{\n            printf(\""6\"");\n        }\n        if(n>0){\n            printf(\""\\n\"");\n        }\n\t}\n\treturn 0;\n}",ACCEPTED,9,332
1590986181003751424,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 16:33:59,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\nimport java.util.*;\n\npublic class Main {\n    public static void main(String[] args) throws Exception{\n        Scanner sc=new Scanner(System.in);\n        int x=sc.nextInt();\n\n        List<Integer> n=new ArrayList<>();\n        if (x >= 0) {\n            for (int i = 0; i <x; i++) {\n                int q=sc.nextInt();\n                n.add((int)Math.pow(6,q));\n            }\n            for (int i = 0; i <x; i++){\n                System.out.println(n.get(i)%10);\n            }\n        }\n    }\n}",NON_ZERO_EXIT_CODE,276,16364
1590986209353072640,acfcf65f14b5d3b02c3225372654b4e21f04d33a8bbaeb346e4fb1d85f2ea94f,2022-11-11 16:34:06,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n int b,n,i,k=0,f;\n scanf(\""%d\"",&b);\n for(n=2;n<=b;n++)\n{\n  f = 1;\n  for (i = 2; i <= sqrt(n); i++)\n     if (n % i == 0) {\n    f = 0;\n    break;\n                  }\n  if (f == 1)\n   k++;\n  if (n == b)\n   printf(\""%d\"", k);\n\n}\nreturn 0;\n}\n",ACCEPTED,14,192
1590986216370147328,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-11 16:34:07,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"0<=X,Y,Z<=100\nX,Y,Z=map(int,input(\""请输入三个整数：\"").split(8,7,3))\nprint(X+Y-Z)\ntype(a)\n",NON_ZERO_EXIT_CODE,17,2888
1590986319730380800,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-11 16:34:32,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int n,i;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    int max=0,sum=0;\n    for(i=0;i<n;i++)\n    {\n        sum+=b[i]-a[i];\n        if(sum>max) max=sum;\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",WRONG_ANSWER,4,196
1590986319877156864,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-11 16:34:32,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"0<=X,Y,Z<=100\nX,Y,Z=map(int,input(\""请输入三个整数：\"").split(8,7,3))\nprint(X+Y-Z)\ntype(a)\n<class'int'>\n",NON_ZERO_EXIT_CODE,17,2888
1590986370540175360,1363fe5b260b83108efff76d53fc3ee37db1aa74f7eb5c5c7e6dacb996b49862,2022-11-11 16:34:44,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint j,i,a,count;\n\tscanf(\""%d\"",&a);\n\tfor(i=2;i<=a;i++)\n\t{\n\t\tfor(j=2;j<i;j++)\n\t\t{\n\t\t\tif(i%j==0)\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t}\n\t\t\tif(i==j)\n\t\t{\n\t\t\tcount++;\n\t\t}\n\t}\n\tprintf(\""%d\"",count);\n\treturn 0; \n}",ACCEPTED,932,336
1590986378719047680,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-11 16:34:46,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int n,i;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    int max=0,sum=0;\n    for(i=0;i<n;i++)\n    {\n        sum+=b[i]-a[i];\n        if(sum>max) max=sum;\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",WRONG_ANSWER,3,184
1590986399854145536,acfcf65f14b5d3b02c3225372654b4e21f04d33a8bbaeb346e4fb1d85f2ea94f,2022-11-11 16:34:51,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n int b,n,i,k=0,f;\n scanf(\""%d\"",&b);\n for(n=2;n<=b;n++)\n{\n  f = 1;\n  for (i = 2; i <= sqrt(n); i++)\n     if (n % i == 0) {\n    f = 0;\n    break;\n                  }\n  if (f==1)\n   k++;\n  if (n==b)\n   printf(\""%d\"", k);\n}\nreturn 0;\n}\n",ACCEPTED,19,344
1590986649511727104,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-11 16:35:51,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"/*#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#include<string.h>\nint main()\n{int t,j,n;\nint x,len;\n char k[3000];\nscanf(\""%d\"",&t);\nint y[t];\nfor(j=0;j<t;j++)\n{\n    scanf(\""%d\"",&y[j]);\n\n}\nfor (j=0;j<t;j++)\n{\n     if(y[j]>=0&&y[j]<=int(pow(10,9))) {\n        k=char(pow(6,y[j]));\n        len=string(k);\n         x=int(k[len-1]);\n        printf(\""%d\"",x);\n     if(j<t-1) printf(\""\\n\"");\n}\n\nreturn 0;\n}\n}\n*/\n/*\n#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#include<string.h>\nint main()\n{int t,j,n,x;\nx=6;\nscanf(\""%d\"",&t);\nint y[t];\nfor(j=0;j<t;j++)\n{\n    scanf(\""%d\"",&y[j]);\n\n}\nfor (j=0;j<t;j++)\n{\n     if(y[j]>0) {\n        //n=int(pow(6,0));\n        //x=int(pow(6,y[j]))%10;\n        printf(\""%d\"",x);\n     if(j<t-1) printf(\""\\n\"");\n}\n    if(y[j]==0)\n    {\n        printf(\""1\"");\n        if(j<t-1) printf(\""\\n\"");\n    }\n}\nreturn 0;\n}*/\n#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main()\n{int t,j,n,x;\nx=6;\nscanf(\""%d\"",&t);\nint y;\nfor (j=0;j<t;j++)\n{\n    scanf(\""%d\"",&n);\n    if(n>0) printf(\""6\"");\n    if(n==0) printf(\""1\"");\n    if(j<t-1) printf(\""\\n\"");\n\n}\nreturn 0;\n}",WRONG_ANSWER,7,336
1590986717304238080,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-11 16:36:07,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"0<=X,Y,Z<=100\nX=8,Y=7,Z=3\nprint(X+Y-Z)\n",NON_ZERO_EXIT_CODE,18,3900
1590986733389418496,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-11 16:36:11,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint n, i, k,j,l;\n\tj = 0;\n\tscanf(\""%d\"", &l);\n\tfor (n = 2; n < l; n++)\n\t{\n\t\tfor (i = 2; i <= n; i++)\n\t\t{\n\t\t\tk = n % i;\n\t\t\tif (k == 0)\n\t\t\t\tbreak;\n\t\t}\n\t\tif (k != 0 || k == 0 && n == i)\n\t\t\tj++;\n\t}\n\tprintf(\""%d\\n\"",j);\n}",ACCEPTED,972,520
1590986793074339840,13eac09c9e523ec396926840225e626f8fff54ca0e8a92e46e533705daa83ac2,2022-11-11 16:36:25,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,4,308
1590986850792177664,aa65cdf25cbe32699d085a61c4f3ec5a4020e6a3dc1e0e9d6e2a48c9288f8026,2022-11-11 16:36:38,Java,0.0,1590734963702620160,1590734503495200768,1049226928954454016,import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main{\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int num = scanner.nextInt();\n        int[] getmax = new int[num];\n        int[] arr = new int[num];\n        int[] arr1 = new int[num];\n\n        int maxnum[]=new int[num];\n        for (int i = 0; i < num; i++) {\n            arr[i] = scanner.nextInt();\n        }\n        for (int j = 0; j < num; j++) {\n            arr1[j] = scanner.nextInt();\n        }\n\n\n\n\n\n        for (int i = 0; i < num; i++) {\n          getmax[i]=arr1[i]-arr[i];\n        }\n\n        for (int i = 0; i < num; i++) {\n            for (int j = 0; j < i; j++) {\n                maxnum[i]+=getmax[j];\n            }\n            }\n        Arrays.sort(maxnum);\n        System.out.println(maxnum[num-1]);\n        }\n\n\n    },WRONG_ANSWER,124,16540
1590986918786043904,977c9d350f87cd8386fa1f88cca886d6ff43821830806e60da6d6b36dc77cd13,2022-11-11 16:36:55,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n    int i,j,n;\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++){\n        scanf(\""%d\"",&j);\n        if(j=0)\n            printf(\""1\\n\"");\n    else\n        printf(\""6\\n\"");\n    }\n}\n",WRONG_ANSWER,9,192
1590986920270802944,f1feb45d46abad163f730e5b023ce1df76883054d0a1741228a76c2c69aa3eda,2022-11-11 16:36:55,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n,i,j,k;\n    k=0;\n    scanf(\""%d\"",&n);\n    for(i=3;i<=n;i++){\n        for(j=3;j<i;j++){\n            if(i%j==0)\n                break;\n        }\n        if(i==j)\n            k++;\n    }\n    printf(\""%d\"",k);\n}",TIME_LIMIT_EXCEEDED,1000,360
1590986959831478272,beefe7893dd2cd421da3fb1ba3ffd90e3dc51d5301380baebfdfa12fbe5234f5,2022-11-11 16:37:04,Python,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"import math\na = 0\nn = int(input())\nif 2 <= n <= 100000:\n    for i in range(2, n+1):\n        square_num = math.floor(i ** 0.5)\n        for m in range(2, square_num+1):\n            if i % m == 0:\n                break\n        else:\n            a += 1\n    print(a)\n",ACCEPTED,275,3012
1590986983537704960,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-11 16:37:10,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\n#include<math.h>\nusing namespace std;\nint main() {\n\tint a, b, c;\n\tcin >> a;\n\tfor (int i = 1; i <= a; i++)\n\t{\n\t\tif (i < a)\n\t\t{\n\t\t\tcin >> b;\n\t\t\tc = (int)pow(6, b) % 10;\n\t\t\tcout << c << endl;\n\t\t}\n\t\telse {\n\t\t\tcin >> b;\n\t\t\tc = (int)pow(6, b) % 10;\n\t\t\tcout << c;\n\t\t}\n\t}\n\treturn 0;\n}",WRONG_ANSWER,8,460
1590986999945801728,6cbd81921f92855c6b8318725b09ef7ec48ff579276b3df9f7ea04bea9804678,2022-11-11 16:37:14,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\nint n,i;\n scanf(\""%d\"",&n);\n int a[n];\n for(i=0;i<n;i++){\n  scanf(\""%d\"",&a[i]);\n }\nfor(i=0;i<n-1;i++){\n       if(a[i]==0&&i<(n-1)) printf(\""1\\n\"");\n       else printf(\""6\\n\"");\n    }\n    if(a[n-1]==0) printf(\""1\"");\n    else printf(\""6\"");\n}\n",ACCEPTED,10,352
1590987021315805184,aa65cdf25cbe32699d085a61c4f3ec5a4020e6a3dc1e0e9d6e2a48c9288f8026,2022-11-11 16:37:19,Java,0.0,1590734963702620160,1590734503495200768,1049226928954454016,import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main{\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int num = scanner.nextInt();\n        int[] getmax = new int[num];\n        int[] arr = new int[num];\n        int[] arr1 = new int[num];\n\n        int maxnum[]=new int[num];\n        for (int i = 0; i < num; i++) {\n            arr[i] = scanner.nextInt();\n        }\n        for (int j = 0; j < num; j++) {\n            arr1[j] = scanner.nextInt();\n        }\n\n        for (int i = 0; i < num; i++) {\n          getmax[i]=arr1[i]-arr[i];\n        }\n\n        for (int i = 0; i < num; i++) {\n            for (int j = 0; j < i; j++) {\n                maxnum[i]+=getmax[j];\n            }\n            }\n        Arrays.sort(maxnum);\n        System.out.println(maxnum[num-1]);\n        }\n\n\n    },WRONG_ANSWER,116,16824
1590987099099168768,03f9d7a6fc27d141b8243d1b2b44a3276cdd4750b5c2621d6d8c006b64ca6514,2022-11-11 16:37:38,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint n,a,i=0;\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a);\n\t\tif(a>0){\n\t\t\tprintf(\""6\\n\"");\n\t\t\t}else if(a==0){ \n\t\t\t\tprintf(\""1\\n\"");\n\t\t\t}\n\t\t//printf(\""\\n\"");\n\t\t}\n\treturn 0;\n}",WRONG_ANSWER,9,332
1590987184302264320,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-11 16:37:58,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int n,i;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    int max=-100sum=0;\n    for(i=0;i<n;i++)\n    {\n        sum+=b[i]-a[i];\n        if(sum>max) max=sum;\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",COMPILE_ERROR,0,0
1590987293194780672,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 16:38:24,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n\nmain()\n{\n    int n,w[20],v[20],u[20],i,j,max,sum;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&w[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&v[i]),u[i]=v[i]-w[i];\n    max=v[1]-w[1];\n    for(i=0;i<n;i++)\n        for(j=i,sum=0;j<n;j++)\n    {\n        sum+=v[j]-w[j];\n        if(sum>max) \n            max=sum;\n    }\n    printf(\""%d\\n\"",max);\n    return 0;\n}\n",ACCEPTED,4,336
1590987354800717824,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 16:38:39,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n\nmain()\n{\n    int n,w[20],v[20],i,j,max,sum;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&w[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&v[i]);\n    max=v[1]-w[1];\n    for(i=0;i<n;i++)\n        for(j=i,sum=0;j<n;j++)\n    {\n        sum+=v[j]-w[j];\n        if(sum>max) \n            max=sum;\n    }\n    printf(\""%d\\n\"",max);\n    return 0;\n}\n",ACCEPTED,3,196
1590987435650121728,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-11 16:38:58,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"/*#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#include<string.h>\nint main()\n{int t,j,n;\nint x,len;\n char k[3000];\nscanf(\""%d\"",&t);\nint y[t];\nfor(j=0;j<t;j++)\n{\n    scanf(\""%d\"",&y[j]);\n\n}\nfor (j=0;j<t;j++)\n{\n     if(y[j]>=0&&y[j]<=int(pow(10,9))) {\n        k=char(pow(6,y[j]));\n        len=string(k);\n         x=int(k[len-1]);\n        printf(\""%d\"",x);\n     if(j<t-1) printf(\""\\n\"");\n}\n\nreturn 0;\n}\n}\n*/\n/*\n#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#include<string.h>\nint main()\n{int t,j,n,x;\nx=6;\nscanf(\""%d\"",&t);\nint y[t];\nfor(j=0;j<t;j++)\n{\n    scanf(\""%d\"",&y[j]);\n\n}\nfor (j=0;j<t;j++)\n{\n     if(y[j]>0) {\n        //n=int(pow(6,0));\n        //x=int(pow(6,y[j]))%10;\n        printf(\""%d\"",x);\n     if(j<t-1) printf(\""\\n\"");\n}\n    if(y[j]==0)\n    {\n        printf(\""1\"");\n        if(j<t-1) printf(\""\\n\"");\n    }\n}\nreturn 0;\n}*/\n#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main()\n{int t,j,n,x;\nx=6;\nscanf(\""%d\"",&t);\nint y;\nfor (j=0;j<t;j++)\n{\n    scanf(\""%d\"",&n);\n    if(n>=0&&n<=pow(10,9))\n    {\n\n\n    if(n>0) printf(\""6\"");\n    if(n==0) printf(\""1\"");\n    if(j<t-1) printf(\""\\n\"");\n    }\n\n}\nreturn 0;\n}",WRONG_ANSWER,6,324
1590987505548177408,13616e85f216dd3844293b46f4b46105a0a2c458f7807a7b677858feb35cb63a,2022-11-11 16:39:15,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nvoid sushu(int a)\n{\n   int i,j,sum=0,num;\n\n   for(j=2;j<=a;j++)\n   {num=0;\n   for(i=2;i<=j;i++)\n   {\n       if(j%i==0&&i!=j)\n        num++;\n\n\n\n   }\n    if(num==0)\n      {\n          sum++;\n      }\n      }\n   printf(\""%d\"",sum);\n}\nint main()\n{\n    int a;\n   scanf(\""%d\"",&a);\n   sushu(a);\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,1000,276
1590987506080854016,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-11 16:39:15,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int n,i;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    int max=-100,sum=0;\n    for(i=0;i<n;i++)\n    {\n        sum+=b[i]-a[i];\n        if(sum>max) max=sum;\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",WRONG_ANSWER,3,316
1590987554495705088,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-11 16:39:26,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n\n#define M 100\n\nint main()\n\n{\n\n    int n,a[M],b[M],c[M],i,j,k,d[M],max;\n\n    scanf(\""%d\"",&n);\n\n    for(i=1;i<=n;i++)\n\n    scanf(\""%d\"",&a[i]);\n\n    for(i=1;i<=n;i++)\n\n    scanf(\""%d\"",&b[i]);\n\n    for(j=1;j<=n;j++)\n\n    {\n\n    c[M]=0;\n\n    for(i=j;i<=n;i++)\n\n    c[i]=b[i]-a[i]+c[i-1];\n\n    for(i=1;i<=n;i++)\n\n    if(c[i]>c[i-1])\n\n    d[j]=c[i];\n\n    }\n\n    for(i=1;i<=n;i++)\n\n    if(d[i]>d[i-1])\n\n    max=d[i];\n\n    printf(\""%d\\n\"",max);\n\n    return 0;\n\n}",WRONG_ANSWER,3,344
1590987631977103360,fbea21dbaf89f1b064feaa20227f21c5e1c4888fdc371cf5e43f70615906e52a,2022-11-11 16:39:45,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"n = int(input())\na = list(map(int, input().split()))\nb = a[::-1]\nnum = []\nc = 0\nfor i in range(len(a)):\n    num.append(b[i] - a[i])\nfor j in range(len(num)):\n    if num[j] > 0:\n        c += num[j]\nprint(c)",WRONG_ANSWER,16,2816
1590987677774708736,977c9d350f87cd8386fa1f88cca886d6ff43821830806e60da6d6b36dc77cd13,2022-11-11 16:39:56,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n    int i,j,n;\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++)\n    {\n        scanf(\""%d\"",&j);\n        if(j==0)\n            printf(\""1\\n\"");\n        else\n            printf(\""6\\n\"");\n    }\n}\n",ACCEPTED,12,332
1590987820959858688,13616e85f216dd3844293b46f4b46105a0a2c458f7807a7b677858feb35cb63a,2022-11-11 16:40:30,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    int a;\n   scanf(\""%d\"",&a);\n    int i,j,sum=0,num;\n\n   for(j=2;j<=a;j++)\n   {num=0;\n   for(i=2;i<=j;i++)\n   {\n       if(j%i==0&&i!=j)\n        num++;\n\n\n\n   }\n    if(num==0)\n      {\n          sum++;\n      }\n      }\n   printf(\""%d\"",sum);\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,1000,344
1590988079723253760,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-11 16:41:31,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"a = int(input())\nint m=0\nfor i in range(2,a):\n    for j in range(1,i):\n        if i%j == 0:\n            m=m+1\nprint(m)\n            \n    ",NON_ZERO_EXIT_CODE,16,2876
1590988199055372288,eee658ba43cf6fba46676f4d9f167223fd9b57ec54a5d813fd1d01afc3088139,2022-11-11 16:42:00,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n   int t,n,i,a,b;\n   scanf (\""%d\"",&t);\n   for(i=1;i<=t;i++)\n   {\n       scanf(\""%d\"",&n);\n       if(0<=n<=pow(10,9))\n       {\n           a=pow(6,n);\n           b=a/1%10;\n           printf (\""%d\\n\"",b);\n\n       }\n   }\n    return 0;\n}\n",WRONG_ANSWER,8,324
1590988214544936960,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 16:42:04,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>>\n\nint main()\n{\n    int t,i;\n    scanf (\""%d\\n\"",&t);\n    for(i=0;i<t;i++)\n    {\n        scanf (\""%d\"",&a[i]);\n        if (n!=0) printf(\""6\\n\"");\n        else printf(\""1\\n\"");\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590988243733118976,505c5b9a1b6d591a815315d95a57743fb98dad691b51421b4de282392fef3f43,2022-11-11 16:42:11,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n    return 0;\n}\n",ACCEPTED,6,472
1590988268668260352,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 16:42:17,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>>\n\nint main()\n{\n    int t,i;\n    scanf (\""%d\\n\"",&t);\n    for(i=0;i<t;i++)\n    {\n        scanf (\""%d\"",&a[i]);\n        if (n!=0) printf(\""6/n\"");\n        else printf(\""1/n\"");\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590988281616052224,9a1ecd1db02b268060006afd7de34ec54e74e90bf61becbb6811fb23971c4720,2022-11-11 16:42:20,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,print(2022),ACCEPTED,15,2760
1590988285441277952,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-11 16:42:21,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"a = int(input())\nint m=0\nfor i in range(2,a):\n    for j in range(2,i):\n        if i%j == 0:\n            m=m+1\nprint(m)\n            \n    ",NON_ZERO_EXIT_CODE,15,2920
1590988318232346624,361d4ab0fa1284b9bf8a3ba65da408861b894c5c0617b83f77f2c1d9a1a3ec92,2022-11-11 16:42:28,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,print（'2022'）,COMPILE_ERROR,0,0
1590988434666229760,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 16:42:56,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>>\n\nint main()\n{\n    int t,n,i;\n    scanf (\""%d\\n\"",&t);\n    for(i=0;i<t;i++)\n    {\n        scanf (\""%d\"",n);\n        if (n!=0) printf(\""6\\n\"");\n        else printf(\""1\\n\"");\n    }\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,3,488
1590988453280550912,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-11 16:43:01,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"import math\na = int(input())\nint m=0\nfor i in range(2,a):\n    for j in range(2,i):\n        if i%j == 0:\n            m=m+1\nprint(m)\n            \n    ",NON_ZERO_EXIT_CODE,15,2756
1590988456489193472,361d4ab0fa1284b9bf8a3ba65da408861b894c5c0617b83f77f2c1d9a1a3ec92,2022-11-11 16:43:01,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,print（int(2022)）,COMPILE_ERROR,0,0
1590988566266687488,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 16:43:27,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>>\n\nint main()\n{\n    int t,n,i;\n    scanf (\""%d\\n\"",&t);\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",n);\n        if (n!=0) printf(\""6\\n\"");\n        else printf(\""1\\n\"");\n    }\n    return 0;\n}\n",SEGMENTATION_FAULT,3,320
1590988577322897408,361d4ab0fa1284b9bf8a3ba65da408861b894c5c0617b83f77f2c1d9a1a3ec92,2022-11-11 16:43:30,Python,0.0,1590528927448293376,1590525945717575680,1049226928954454016,print（'2022'）,NON_ZERO_EXIT_CODE,17,2848
1590988632029179904,361d4ab0fa1284b9bf8a3ba65da408861b894c5c0617b83f77f2c1d9a1a3ec92,2022-11-11 16:43:43,Python,0.0,1590528927448293376,1590525945717575680,1049226928954454016,print（int(2022)）,NON_ZERO_EXIT_CODE,17,2896
1590988633782423552,eee658ba43cf6fba46676f4d9f167223fd9b57ec54a5d813fd1d01afc3088139,2022-11-11 16:43:44,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n   int t,n,i,a,b;\n   scanf (\""%d\"",&t);\n   for(i=1;i<=t;i++)\n   {\n       scanf(\""%d\"",&n);\n       if(0<=n<=pow(10,9))\n       {\n           a=pow(6,n);\n           b=a/1%10;\n           printf (\""%d\"",b);    \n        if(i<t)\n        {\n            printf (\""\\n\"");\n        }\n       }\n   }\n    return 0;\n}\n",WRONG_ANSWER,8,468
1590988650651914240,d21dc339d37b0772b2547441444d4b660b000ac3ebe190aee01769e2dd619c10,2022-11-11 16:43:48,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"count=0;\nn=int(input())\nif 2<=n<=100000:\n    for p in range(2,n+1):\n        for i in range(2,p):\n            if p%i==0:\n                break\n        else:\n            count+=1\n    print(count)",TIME_LIMIT_EXCEEDED,1000,3000
1590988678757945344,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-11 16:43:54,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"import math\na = int(input())\nint m=0\nfor n in range(2,a):\n    for x in range(2,n):\n        if i%j == 0:\n            m=m+1\nprint(m)\n            \n    ",NON_ZERO_EXIT_CODE,15,2756
1590988702300573696,9a1ecd1db02b268060006afd7de34ec54e74e90bf61becbb6811fb23971c4720,2022-11-11 16:44:00,Python,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"X,Y,Z=map(int,input().split())\ns=X+Y-Z\nprint(s)",ACCEPTED,35,2872
1590988722986856448,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 16:44:05,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>>\n\nint main()\n{\n    int t,n,i;\n    scanf (\""%d\\n\"",&t);\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",n);\n        if (n) printf(\""6\\n\"");\n        else printf(\""1\\n\"");\n    }\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,2,576
1590988802322116608,d21dc339d37b0772b2547441444d4b660b000ac3ebe190aee01769e2dd619c10,2022-11-11 16:44:24,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"count=0\nn=int(input())\nif 2<=n<=100000:\n    for p in range(2,n+1):\n        for i in range(2,p):\n            if p%i==0:\n                break\n        else:\n            count+=1\n    print(count)",TIME_LIMIT_EXCEEDED,1000,2936
1590988855195512832,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 16:44:36,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint a[10000];\nint main()\n{\n    int t,i;\n    scanf(\""%d\"",&t);\n    \n    for(i=0;i<t;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<t;i++)\n    {if(a[i]<1)\n    printf(\""1\\n\"");\n    else   \n    printf(\""6\\n\"");\n   }\n    return 0;\n}",WRONG_ANSWER,9,348
1590988860820074496,361d4ab0fa1284b9bf8a3ba65da408861b894c5c0617b83f77f2c1d9a1a3ec92,2022-11-11 16:44:38,Python,0.0,1590528927448293376,1590525945717575680,1049226928954454016,int a= 2022\nprint(a),NON_ZERO_EXIT_CODE,17,2740
1590988867195416576,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 16:44:39,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>>\n\nint main()\n{\n    int t,n,i;\n    scanf (\""%d\\n\"",&t);\n    for(i=1;i<=t;i++)\n    {\n        scanf(\""%d\"",n);\n        if (n) printf(\""6\\n\"");\n        else printf(\""1\\n\"");\n    }\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,4,456
1590988894315810816,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 16:44:46,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint a[10000];\nint main()\n{\n    int t,i;\n    scanf(\""%d\"",&t);\n    \n    for(i=0;i<t;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<t;i++)\n    {if(a[i]<1)\n    printf(\""1\\n\"");\n    else   \n    printf(\""6\\n\"");\n   }\n    return 0;\n}",WRONG_ANSWER,9,196
1590989053657415680,cf76a6e5773cf2f19ddd635fa646c5a6721f6fed8998d22ea1d0910bee8017a2,2022-11-11 16:45:24,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint aa(int n)\n{\n    int a,b,c;\n    if(n==0) return 0;\n    else{\n        scanf(\""%d\"",&a);\n        aa(n-1);\n        c=pow(6,a);\n        b=c%10;\n        printf(\""%d\\n\"",b);\n    }\n}\nint main()\n{\n    int t;\n    scanf(\""%d\"",&t);\n    aa(t);\n    return 0;\n}",WRONG_ANSWER,7,472
1590989053820997632,19b1d22e5c87afa9233c236fc7b4d5e0e70acf3872968cbe9aae96e75e9e38d1,2022-11-11 16:45:24,C++,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <iostream>\n#include <vector>\nusing namespace std;\n\nint main(){\n    vector<int> a,b;\n\n    int n,temp,max=0;\n    cin >> n;\n\n    for(int i=0; i < n ; i++){\n        cin >> temp;\n        a.push_back(temp);\n    }\n    for(int i=0; i < n ; i++){\n        cin >> temp;\n        temp -= a.at(i);\n        b.push_back(temp);\n    }\n\n    for(int i=0; i < n ; i++){\n        temp=0;\n        for(int j=i; j < n ; j++){\n            temp+=b.at(j);\n            if(temp>max){\n                max=temp;\n            }\n        }\n    }\n    cout<<max<<endl;\n\n    return 0;\n}\n",ACCEPTED,3,452
1590989089308979200,cf76a6e5773cf2f19ddd635fa646c5a6721f6fed8998d22ea1d0910bee8017a2,2022-11-11 16:45:32,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint aa(int n)\n{\n    int a,b,c;\n    if(n==0) return 0;\n    else{\n        scanf(\""%d\"",&a);\n        aa(n-1);\n        c=pow(6,a);\n        b=c%10;\n        printf(\""%d\\n\"",b);\n    }\n}\nint main()\n{\n    int t;\n    scanf(\""%d\"",&t);\n    aa(t);\n    return 0;\n}",WRONG_ANSWER,7,332
1590989096124747776,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 16:45:34,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint a[1000000];\nint main()\n{\n    int t,i;\n    scanf(\""%d\"",&t);\n    \n    for(i=0;i<t;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<t;i++)\n    {if(a[i]<1)\n    printf(\""1\\n\"");\n    else   \n    printf(\""6\\n\"");\n   }\n    return 0;\n}",WRONG_ANSWER,8,320
1590989110897061888,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 16:45:37,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>>\n\nint main()\n{\n    int t,n,i;\n    scanf (\""%d\\n\"",&t);\n    for(i=1;i<=t;i++)\n    {\n        scanf(\""%d\"",n);\n        if (n) printf(\""6\\n\"");\n        else printf(\""1\\n\"");\n    }\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,4,476
1590989419623026688,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 16:46:51,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>>\n\nint main()\n{\n    int t,n,i,m;\n    scanf (\""%d\\n\"",&t);\n    for(i=1;i<=t;i++)\n    {\n        scanf(\""%d\"",n);\n        if (n) m=6;\n        else m=0;\n        printf(\""%d\\n\"",y);\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590989420726124544,7222c2fb91a71fcf3f6560860557ab564f69a453594c9f1620ecc35bb26f5daf,2022-11-11 16:46:51,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint RQ(int x){\n    \n     int i,sum=1,a;\n    \n    for(i=0;i<x;i++)\n    {\n        sum*=6;\n    }\n    a=sum%10;\n    return a;\n}\n\nint main (){\n    int n,x,i;\n   scanf(\""%d\\n\"",&n);\n    \n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&x);\n        printf(\""%d\"",RQ(x));\n    }\n\n\n    return 0;\n}",TIME_LIMIT_EXCEEDED,23,436
1590989467349987328,70c675ddfcb60b2192bc8ac38fb068fec0500208a5bf97a796c7cc074b43cf87,2022-11-11 16:47:02,Java,0.0,1590734963702620160,1590734503495200768,1049226928954454016,import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner myScanner = new Scanner(System.in);\n\t\tint n = myScanner.nextInt();\n\t\tint[] arr = new int[n]; // 消耗能量\n\t\tint[] arr1 = new int[n]; //获取能量\n\t\tint[] sum = new int[n];   //每次的能量\n\t\tint sum1 = 0;\n\t\tfor(int i = 0;i < n;i++) {\n\t\t\tarr[i] = myScanner.nextInt();\n\t\t}\n\t\tfor(int i = 0;i < n;i++) {\n\t\t\tarr1[i] = myScanner.nextInt();\n\t\t}\n\t\tfor(int i = 0;i < n;i++) {\n\t\t\tsum1 += -arr[i] + arr1[i];\n\t\t\tsum[i] = sum1;\n\t\t}\n\t\tArrays.sort(sum);\n\t    System.out.println(sum[n-1]);\n\t}\n},WRONG_ANSWER,136,18500
1590989486278905856,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 16:47:07,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>>\n\nint main()\n{\n    int t,n,i,m;\n    scanf (\""%d\\n\"",&t);\n    for(i=1;i<=t;i++)\n    {\n        scanf(\""%d\"",n);\n        if (n) m=6;\n        else m=0;\n        printf(\""%d\\n\"",m);\n    }\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,4,436
1590989521590751232,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 16:47:15,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int t,n,i,m;\n    scanf (\""%d\\n\"",&t);\n    for(i=1;i<=t;i++)\n    {\n        scanf(\""%d\"",n);\n        if (n) m=6;\n        else m=0;\n        printf(\""%d\\n\"",m);\n    }\n    return 0;\n}\n",SEGMENTATION_FAULT,4,452
1590989523050344448,19b1d22e5c87afa9233c236fc7b4d5e0e70acf3872968cbe9aae96e75e9e38d1,2022-11-11 16:47:16,C++,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"\n#include <iostream>\nusing namespace std;\n\n\nbool isOk(int &x){\n    for(int i =2 ;i<x/2;i++){\n        if( x%i == 0 )\n            return false;\n    }\n    return true;\n}\n\nint main()\n{\n    int a,count;\n    count=0;\n    cin >> a;\n    for(int i=3; i<a; i++){\n        if(isOk(i)){\n            count++;\n        }\n    }\n    cout << count<<endl;\n\n\n    return 0;\n}\n\n",ACCEPTED,505,492
1590989551672299520,3e087b0a196d30fcbb49ca80164c9eb5adf82ae3bb08ec0c141e5728fb180f0d,2022-11-11 16:47:22,Java,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\t\tstatic final int MAX=100;\n\t\tpublic static void main(String[] args) throws Exception {\n\t\t\t// TODO Auto-generated method stub\n\t\t\tint cnt,temp,ma;\n\t\t\tint[] cal=new int[MAX];\n\t\t\tScanner sc=new Scanner(System.in);\n\t\t\tcnt=sc.nextInt();\n\t\t\tsc.nextLine();\n\t\t\tString[] output=sc.nextLine().split(\"" \"");\n\t\t\tString[] input=sc.nextLine().split(\"" \"");\n\t\t\tfor(int i=0;i<cnt;i++) {\n\t\t\t\tcal[i]=Integer.valueOf(input[i])-Integer.valueOf(output[i]);\n\t\t\t}\n\t\t\ttemp=cal[0];\n\t\t\tma=cal[0];\n\t\t\tfor(int i=1;i<cnt;i++) {\n\t\t\t\tif(cal[i]>=0) {\n\t\t\t\t\tif(temp<0) {\n\t\t\t\t\t\ttemp=cal[i];\n\t\t\t\t\t\tma=temp;\n\t\t\t\t\t}else {\n\t\t\t\t\t\ttemp+=cal[i];\n\t\t\t\t\t\tma=temp;\n\t\t\t\t\t}\n\t\t\t\t}else {\n\t\t\t\t\ttemp+=cal[i];\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.print(ma);\n\t\t\tsc.close();\n\t\t}\n}",ACCEPTED,136,16536
1590989657125466112,e51465ce72346fac918042a342986433269a159492161f223a180a6e05d9a01a,2022-11-11 16:47:48,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tint a=0,b=0;\n\t\tint num=6;\n\t\tint res=0;\n\t\tb=in.nextInt();\n\t\tif (b==0) {\n\t\t\tSystem.out.println(6);\n\t\t}\n        while (in.hasNextInt()) {       \t\n        \tnum=6;\n            a = in.nextInt();\n            num = (int) Math.pow(num, a);\n            res=num%10;\n            System.out.println(res);\n        } \n\t}\n}",WRONG_ANSWER,245,19084
1590989761911762944,44042a4519c9231aa21c54eb113b7a08f98bcd7db4839a20a61ab6ce51fce357,2022-11-11 16:48:13,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint isPrime(int num){\n    for(int i=2; i*i<=num; i++)\n        if(num%i==0){return 0; break;}\n    return 1;\n}\nint main(){\n    int n，k;\n    scanf(\""%d\"",&n);\n    for(int i=2; i<=n; i++)\n        if(isPrime(i))  k++;\n    printf(\""%d\"",k);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1590989805461245952,7222c2fb91a71fcf3f6560860557ab564f69a453594c9f1620ecc35bb26f5daf,2022-11-11 16:48:23,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint RQ(int x){\n    \n     int i,sum=1,a;\n    \n    for(i=0;i<x;i++)\n    {\n        sum*=6;\n    }\n    a=sum%10;\n    return a;\n}\n\nint main (){\n    int n,x,i;\n   scanf(\""%d\\n\"",&n);\n    \n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d \"",&x);\n        printf(\""%d\\n\"",RQ(x));\n    }\n\n\n    return 0;\n}",TIME_LIMIT_EXCEEDED,23,476
1590989920783630336,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-11 16:48:50,Python,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"num = int(input())\na=0\nfor i in range(2, num):\n    j = 2\n    k = int(i**0.5)\n    for j in range(2, k+1):\n        if (i % j == 0):\n            break\n    else:\n        a+=1\nprint(a)\n",ACCEPTED,244,2880
1590989937497931776,cf76a6e5773cf2f19ddd635fa646c5a6721f6fed8998d22ea1d0910bee8017a2,2022-11-11 16:48:54,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint aa(int n)\n{\n    int a,b,c;\n    if(n==0) return 0;\n    else{\n        scanf(\""%d\"",&a);\n        aa(n-1);\n        c=pow(6,a);\n        b=c%10;\n        printf(\""%d\\n\"",b);\n    }\n}\nint main()\n{\n    int t;\n    scanf(\""%d\"",&t);\n    if(t>0&&t<=pow(10,9))\n    aa(t);\n    return 0;\n}",WRONG_ANSWER,8,324
1590989974302949376,b7ca5a176d530473c8faa24fa803cc5b5bef6deef335789b05821ec37e6b8252,2022-11-11 16:49:03,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main{\n   int a==2022;\n    printf(\""%d\"",a);\nreturn 0;\n}\n",COMPILE_ERROR,0,0
1590990061376700416,bce383372e0b1b627f0a9b838121096ec3ca14c0f213828fca1bf517a82c8744,2022-11-11 16:49:24,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n\nmain()\n{\n    int n,w[20],v[20],i,j,max,sum;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&w[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&v[i]);\n    max=v[1]-w[1];\n    for(i=0;i<n;i++)\n        for(j=i,sum=0;j<n;j++)\n    {\n        sum+=v[j]-w[j];\n        if(sum>max) \n            max=sum;\n    }\n    printf(\""%d\\n\"",max);\n    return 0;\n}\n",ACCEPTED,4,332
1590990064816009216,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-11 16:49:25,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"a = int(input())\nint m=0\nfor n in range(2,a):\n    for x in range(2,n//2+1):\n        if i%j == 0:\n            m=m+1\nprint(m)\n            \n    ",NON_ZERO_EXIT_CODE,16,2756
1590990096021651456,b7ca5a176d530473c8faa24fa803cc5b5bef6deef335789b05821ec37e6b8252,2022-11-11 16:49:32,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main{\n   int a;\n    a==2022;\n    printf(\""%d\"",a);\nreturn 0;\n}\n",COMPILE_ERROR,0,0
1590990138396708864,13616e85f216dd3844293b46f4b46105a0a2c458f7807a7b677858feb35cb63a,2022-11-11 16:49:42,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nvoid sushu(int a)\n{\n   int i,j,sum=0,num;\n\n   for(j=2;j<=a;j++)\n   {num=0;\n   for(i=2;i<=sqrt(j);i++)\n   {\n       if(j%i==0&&i!=j)\n        num++;\n\n\n\n   }\n    if(num==0)\n      {\n          sum++;\n      }\n      }\n   printf(\""%d\"",sum);\n}\nint main()\n{\n    int a;\n   scanf(\""%d\"",&a);\n   sushu(a);\n    return 0;\n}\n",ACCEPTED,84,196
1590990237600362496,bce383372e0b1b627f0a9b838121096ec3ca14c0f213828fca1bf517a82c8744,2022-11-11 16:50:06,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    printf(\""2022\"");\n}",ACCEPTED,3,348
1590990242318974976,ab06d3bc54a8085bcfbbbc20f25874f2b3173239c6b324729b906332198fe3af,2022-11-11 16:50:07,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main(){\n    int z;\n    scanf(\""%d\"",&z);\n    int a[100]={0},b[100]={0};\n    int c[100]={0};//用来存比较的数组\n    int sum;//做中间变量\n    int max=0;\n    for(int i=0;i<z;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(int i=0;i<z;i++){\n        scanf(\""%d\"",&b[i]);\n    }\n    for(int j=0;j<z;j++){sum=0;\n        for(int i=j;i<z;i++){\n            sum+=b[i]-a[i];\n                c[i]=sum;\n                if(max<c[i]){\n                    max=c[i];\n                }\n        }\n    }\n\n    printf(\""%d\"",max);\n    return 0;\n}",ACCEPTED,4,308
1590990289932718080,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-11 16:50:18,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"num = int(input())\nlist = input().split(\"" \"")\nfor i in range(num):\n    x = int(list[i])\n    y = (6**x)%10\n    i+=1\n    print(y)",TIME_LIMIT_EXCEEDED,169,4592
1590990290574422016,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-11 16:50:19,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"a = int(input())\nm=0\nfor n in range(2,a):\n    for x in range(2,n//2+1):\n        if i%j == 0:\n            m=m+1\nprint(m)\n            \n    ",NON_ZERO_EXIT_CODE,15,2880
1590990361676288000,acfcf65f14b5d3b02c3225372654b4e21f04d33a8bbaeb346e4fb1d85f2ea94f,2022-11-11 16:50:36,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n  int t,n,i,r,g=pow(10,9);\n  scanf(\""%d\"",&t); \n  for(i=1;i<=t;i++)\n  {\n    scanf(\""%d\"",&n);\n    r=pow(6,n);\n      if(i<t)\n    printf(\""%d\\n\"",r%10);  \n      else\n    printf(\""%d\"",r%10);   \n  }\n   return 0;\n}\n",WRONG_ANSWER,10,488
1590990392449871872,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-11 16:50:43,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"a = int(input())\nm=0\nfor n in range(2,a):\n    for x in range(2,n):\n        if i%j == 0:\n            m=m+1\nprint(m)\n            \n    ",NON_ZERO_EXIT_CODE,16,2756
1590990394505105408,9819f13d6a58d50fa249ad037641119dadb52afb3f125db258771564f27d2ca5,2022-11-11 16:50:43,C++,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main() {\n\tint n, i;\n\tscanf(\""%d\"", &n);\n\tint a[1000], b[1000], c[1000];\n\tfor (i = 0; i < n; i++) {\n\t\tscanf(\""%d \"", &a[i]);\n\t}\n\tfor ( i = 0; i < n; i++) {\n\t\tscanf(\""%d \"", &b[i]);\n\t}\n\tfor (i = 0; i < n; i++) {\n\t\tc[i] = b[i] - \ta[i];  \n\t}\n\tint plan = c[0];\n    int sign=plan;\n\tfor (i = 1; i < n; i++) {\n\t\tplan += c[i];\n\t\tif(plan<0){\n            plan=0;\n        }\n        if(plan>sign){\n            sign=plan;\n        }\n\t}\n\tprintf(\""%d\\n\"", sign);\n\treturn 0;\n}",ACCEPTED,4,180
1590990422980235264,fbea21dbaf89f1b064feaa20227f21c5e1c4888fdc371cf5e43f70615906e52a,2022-11-11 16:50:50,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"n = int(input())\na = list(map(int, input().split()))\nb = a[::-1]\nnum = []\nc = []\nx=0\nfor i in range(len(a)):\n    num.append(b[i] - a[i])\nfor j in range(len(num)):\n    x+=num[j]\n    c.append(x)\nprint(max(c))",WRONG_ANSWER,17,2820
1590990442630549504,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-11 16:50:55,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int i,a,n;\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++)\n    {\n        if(i<n)\n        {\n            scanf(\""%d\"",&a);\n            if(a>0)\n            printf(\""6\\n\"");\n        }\n        else\n        {\n            scanf(\""%d\"",&a);\n            if(a>0)\n            printf(\""6\"");\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,8,312
1590990535471443968,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-11 16:51:17,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int i,a,n;\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++)\n    {\n        if(i<=n)\n        {\n            scanf(\""%d\"",&a);\n            if(a>0)\n            printf(\""6\\n\"");\n        }\n        else\n        {\n            scanf(\""%d\"",&a);\n            if(a>0)\n            printf(\""6\"");\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,7,312
1590990560473690112,98901859b53edd496c40c4ba0469693a8e0ed685a8c2ca3d67a6cca01af154ef,2022-11-11 16:51:23,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n\tprintf(\""2022\\n\"");\n\treturn 0;\n}",ACCEPTED,4,468
1590990613338718208,7222c2fb91a71fcf3f6560860557ab564f69a453594c9f1620ecc35bb26f5daf,2022-11-11 16:51:36,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint RQ(int x){\n\n     int i,sum=1,a;\n\n    for(i=0;i<x;i++)\n    {\n        sum*=6;\n    }\n    a=sum%10;\n    return a;\n}\n\nint main (){\n    int n,x,i;\n   scanf(\""%d\"",&n);\n\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&x);\n        printf(\""%d\\n\"",RQ(x));\n    }\n\n\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,24,472
1590990627356061696,19b1d22e5c87afa9233c236fc7b4d5e0e70acf3872968cbe9aae96e75e9e38d1,2022-11-11 16:51:39,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <iostream>\n#include <math.h>\nusing namespace std;\n\n\nbool isOk(int &x){\n    for(int i =2 ;i<sqrt(x);i++){\n        if( x%i == 0 )\n            return false;\n    }\n    return true;\n}\n\nint main()\n{\n    int a,count;\n    count=0;\n    cin >> a;\n    for(int i=3; i<a; i++){\n        if(isOk(i)){\n            count++;\n        }\n    }\n    cout << count<<endl;\n\n\n    return 0;\n}\n",WRONG_ANSWER,19,316
1590990635253960704,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 16:51:41,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,n,t,y;\n    scanf(\""%d\\n\"",&t);\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&n);\n        if(n==0)\n            y=1;\n        else\n            y=6;\n            printf(\""%d\\n\"",y);\n    }\n}\n",ACCEPTED,8,344
1590990710675931136,cf76a6e5773cf2f19ddd635fa646c5a6721f6fed8998d22ea1d0910bee8017a2,2022-11-11 16:51:59,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint aa(int n)\n{\n    int a,b,c;\n    if(n==0) return 0;\n    else{\n        scanf(\""%d\"",&a);\n        if(a>=0&&a<=pow(10,9))\n        {\n        aa(n-1);\n        c=pow(6,a);\n        b=c%10;\n        printf(\""%d\\n\"",b);\n        }\n    }\n}\nint main()\n{\n    int t;\n    scanf(\""%d\"",&t);\n    aa(t);\n    return 0;\n}",WRONG_ANSWER,7,340
1590990720075370496,b7ca5a176d530473c8faa24fa803cc5b5bef6deef335789b05821ec37e6b8252,2022-11-11 16:52:01,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main()\n{\n   int a;\n    a==2022;\n    printf(\""%d\"",a);\nreturn 0;\n}\n",WRONG_ANSWER,4,180
1590990792733274112,361d4ab0fa1284b9bf8a3ba65da408861b894c5c0617b83f77f2c1d9a1a3ec92,2022-11-11 16:52:18,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"int x,y,z;\nint sum;\nscanf(\""%d %d %d\"",&x,&y,&z);\nsum=x+y+z;\nprintf(\""%d\"",sum);\n\n\n\n",COMPILE_ERROR,0,0
1590990825633419264,34d1cf71a2e3af8f7f6669b464d5dca494efd62633cf73f401f93fdeaa8e22e9,2022-11-11 16:52:26,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int a,b,c,d;\n    scanf(\""%d%d%d\"",&a,&b,&c);\n    d=a+b-c;\n    printf(\""%d\"",d);\n    return 0;\n}\n",ACCEPTED,7,472
1590990849595473920,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 16:52:32,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,n,t;\n    scanf(\""%d\\n\"",&t);\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&n);\n        if(n)\n            printf(\""6\\n\"");\n        else\n            printf(\""1\\n\"");\n            \n    }\n}\n",ACCEPTED,9,364
1590990880872402944,361d4ab0fa1284b9bf8a3ba65da408861b894c5c0617b83f77f2c1d9a1a3ec92,2022-11-11 16:52:39,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"int x,y,z;\nint sum;\nscanf(\""%d %d %d\"",&x,&y,&z);\nsum=x+y+z;\nprintf(\""%d\"",&sum);\n\n\n\n",COMPILE_ERROR,0,0
1590990964255166464,361d4ab0fa1284b9bf8a3ba65da408861b894c5c0617b83f77f2c1d9a1a3ec92,2022-11-11 16:52:59,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"printf(\""123\"");\n\n\n\n",COMPILE_ERROR,0,0
1590991025361977344,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 16:53:14,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint a[1000000];\nint main()\n{\n    int t,i;\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++)\n    {scanf(\""%d\"",&a);\n    if(a<1)\n    printf(\""1\\n\"");\n    else   \n    printf(\""6\\n\"");\n   }\n    return 0;\n}",WRONG_ANSWER,12,340
1590991031171088384,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 16:53:15,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nmain()\n{\n    int m,n,k,i,a=0;\n    scanf(\""%d\"",&n);\n    for(m=2;m<n;m++)\n    {\n        k=sqrt(m);\n        for(i=2;i<=k;i++)\n            if(m%i==0) break;\n        if(i>k) a++;\n    }\n    printf(\""%d\"",a);\n}\n",ACCEPTED,15,376
1590991084224819200,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 16:53:28,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t,i;\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++)\n    {scanf(\""%d\"",&a);\n    if(a<1)\n    printf(\""1\\n\"");\n    else   \n    printf(\""6\\n\"");\n   }\n    return 0;\n}",COMPILE_ERROR,0,0
1590991090361110528,361d4ab0fa1284b9bf8a3ba65da408861b894c5c0617b83f77f2c1d9a1a3ec92,2022-11-11 16:53:29,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"printf(\""123\"");\n\n\n\n",COMPILE_ERROR,0,0
1590991148573831168,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-11 16:53:43,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"/*#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#include<string.h>\nint main()\n{int t,j,n;\nint x,len;\n char k[3000];\nscanf(\""%d\"",&t);\nint y[t];\nfor(j=0;j<t;j++)\n{\n    scanf(\""%d\"",&y[j]);\n\n}\nfor (j=0;j<t;j++)\n{\n     if(y[j]>=0&&y[j]<=int(pow(10,9))) {\n        k=char(pow(6,y[j]));\n        len=string(k);\n         x=int(k[len-1]);\n        printf(\""%d\"",x);\n     if(j<t-1) printf(\""\\n\"");\n}\n\nreturn 0;\n}\n}\n*/\n/*\n#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#include<string.h>\nint main()\n{int t,j,n,x;\nx=6;\nscanf(\""%d\"",&t);\nint y[t];\nfor(j=0;j<t;j++)\n{\n    scanf(\""%d\"",&y[j]);\n\n}\nfor (j=0;j<t;j++)\n{\n     if(y[j]>0) {\n        //n=int(pow(6,0));\n        //x=int(pow(6,y[j]))%10;\n        printf(\""%d\"",x);\n     if(j<t-1) printf(\""\\n\"");\n}\n    if(y[j]==0)\n    {\n        printf(\""1\"");\n        if(j<t-1) printf(\""\\n\"");\n    }\n}\nreturn 0;\n}*/\n#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main()\n{int t,j,n,x;\nx=6;\nscanf(\""%d\"",&t);\nint y;\nfor (j=0;j<t;j++)\n{\n    scanf(\""%d\"",&n);\n    if(n>=0&&n<=pow(10,9))\n    {\n\n\n    if(n>0) {x=6;printf(\""%d\"",x);}\n    if(n==0) {x=1;printf(\""%d\"",x);}\n    if(j<t-1) printf(\""\\n\"");\n    }\n\n}\nreturn 0;\n}",WRONG_ANSWER,7,336
1590991163006451712,34d1cf71a2e3af8f7f6669b464d5dca494efd62633cf73f401f93fdeaa8e22e9,2022-11-11 16:53:47,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h> \n#include<math.h>\nint main(){\nint n;\n scanf(\""%d\"",&n);\n int a[n];\n for(int i=0;i<n;i++){\n  scanf(\""%d\"",&a[i]);\n }\n    \n    for(int i=0;i<n-1;i++){\n       if(a[i]==0&&i<(n-1)) printf(\""1\\n\"");\n       else printf(\""6\\n\"");\n    }\n    if(a[n-1]==0) printf(\""1\"");\n    else printf(\""6\"");\n \n}",ACCEPTED,10,184
1590991218786500608,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-11 16:54:00,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"X,Y,Z=map(int,input(\""请输入三个整数：\"").split())\n0<=X,Y,Z<=100\n<class 'int'>\n",NON_ZERO_EXIT_CODE,17,2816
1590991266651877376,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 16:54:11,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nmain()\n{\n    int m,n,k,i,a=0;\n    scanf(\""%d\"",&n);\n    for(m=2;m<n;m++)\n    {\n        for(i=2;i<=sqrt(m);i++)\n            if(m%i==0) break;\n        if(i>sqrt(m)) a++;\n    }\n    printf(\""%d\"",a);\n}\n",ACCEPTED,15,320
1590991301611401216,34d1cf71a2e3af8f7f6669b464d5dca494efd62633cf73f401f93fdeaa8e22e9,2022-11-11 16:54:20,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int m,i,n=0,num=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++){\n        for(m=2;m<i;m++){\n            if(i%m==0){\n                break;\n            }\n        }\n        if(m==i){\n            num+=1;\n        }\n    }\n    printf(\""%d\\n\"",num);\n    return 0;\n}",ACCEPTED,952,344
1590991333056098304,b7ca5a176d530473c8faa24fa803cc5b5bef6deef335789b05821ec37e6b8252,2022-11-11 16:54:27,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main()\n{\n   int a==2022;\n    printf(\""%d\"",a);\nreturn 0;\n}\n",COMPILE_ERROR,0,0
1590991440753266688,e67d0171967fcfdd3835361399616ff4e60e12e62c2ed2fd59506c58aeaae4ad,2022-11-11 16:54:53,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nmian()\n{\n    printf(\""2022\"");\n}",COMPILE_ERROR,0,0
1590991521246150656,829a456c4a25d6829251121c8b03695aabad5e41706a9b5171602f2ab26762d6,2022-11-11 16:55:12,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b,c;\n    scanf(\""%d%d%d\"",&a,&b,&c);\n    printf(\""%d\"",a+b-c);\n    return 0;\n}\n",ACCEPTED,6,376
1590991547091431424,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-11 16:55:18,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"/*#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#include<string.h>\nint main()\n{int t,j,n;\nint x,len;\n char k[3000];\nscanf(\""%d\"",&t);\nint y[t];\nfor(j=0;j<t;j++)\n{\n    scanf(\""%d\"",&y[j]);\n\n}\nfor (j=0;j<t;j++)\n{\n     if(y[j]>=0&&y[j]<=int(pow(10,9))) {\n        k=char(pow(6,y[j]));\n        len=string(k);\n         x=int(k[len-1]);\n        printf(\""%d\"",x);\n     if(j<t-1) printf(\""\\n\"");\n}\n\nreturn 0;\n}\n}\n*/\n/*\n#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#include<string.h>\nint main()\n{int t,j,n,x;\nx=6;\nscanf(\""%d\"",&t);\nint y[t];\nfor(j=0;j<t;j++)\n{\n    scanf(\""%d\"",&y[j]);\n\n}\nfor (j=0;j<t;j++)\n{\n     if(y[j]>0) {\n        //n=int(pow(6,0));\n        //x=int(pow(6,y[j]))%10;\n        printf(\""%d\"",x);\n     if(j<t-1) printf(\""\\n\"");\n}\n    if(y[j]==0)\n    {\n        printf(\""1\"");\n        if(j<t-1) printf(\""\\n\"");\n    }\n}\nreturn 0;\n}*/\n#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main()\n{int t,j,n,x;\nx=6;\nscanf(\""%d\"",&t);\nint y;\nfor (j=0;j<t;j++)\n{\n    scanf(\""%d\"",&n);\n    if(n>=0&&n<=pow(10,9))\n    {\n\n\n    if(n>0) {x=6;printf(\""%d\"",x);}\n    if(n==0) {x=1;printf(\""%d\"",x);}\n    if(j<t-1) printf(\""\\n\"");\n    }\n\n}\nreturn 0;\n}",WRONG_ANSWER,6,504
1590991568000036864,e67d0171967fcfdd3835361399616ff4e60e12e62c2ed2fd59506c58aeaae4ad,2022-11-11 16:55:23,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""2022\"");\n}",ACCEPTED,4,336
1590991685801259008,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-11 16:55:51,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"a = int(input())\nm=0\nfor n in range(2,a+1):\n    for x in range(2,n):\n        if n%x == 0:\n            break\n            else:\n                m=m+1\nprint(m)\n            \n    ",NON_ZERO_EXIT_CODE,17,2888
1590991725353566208,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-11 16:56:01,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"/*#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#include<string.h>\nint main()\n{int t,j,n;\nint x,len;\n char k[3000];\nscanf(\""%d\"",&t);\nint y[t];\nfor(j=0;j<t;j++)\n{\n    scanf(\""%d\"",&y[j]);\n\n}\nfor (j=0;j<t;j++)\n{\n     if(y[j]>=0&&y[j]<=int(pow(10,9))) {\n        k=char(pow(6,y[j]));\n        len=string(k);\n         x=int(k[len-1]);\n        printf(\""%d\"",x);\n     if(j<t-1) printf(\""\\n\"");\n}\n\nreturn 0;\n}\n}\n*/\n/*\n#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#include<string.h>\nint main()\n{int t,j,n,x;\nx=6;\nscanf(\""%d\"",&t);\nint y[t];\nfor(j=0;j<t;j++)\n{\n    scanf(\""%d\"",&y[j]);\n\n}\nfor (j=0;j<t;j++)\n{\n     if(y[j]>0) {\n        //n=int(pow(6,0));\n        //x=int(pow(6,y[j]))%10;\n        printf(\""%d\"",x);\n     if(j<t-1) printf(\""\\n\"");\n}\n    if(y[j]==0)\n    {\n        printf(\""1\"");\n        if(j<t-1) printf(\""\\n\"");\n    }\n}\nreturn 0;\n}*/\n#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main()\n{int t,j,n,x;\nx=6;\nscanf(\""%d\"",&t);\nint y;\nfor (j=0;j<t;j++)\n{\n    scanf(\""%d\"",&n);\n    if(n>=0&&n<=1000000000)\n    {\n\n\n    if(n>0) {x=6;printf(\""%d\"",x);}\n    if(n==0) {x=1;printf(\""%d\"",x);}\n    if(j<t-1) printf(\""\\n\"");\n    }\n\n}\nreturn 0;\n}",WRONG_ANSWER,6,200
1590991778898051072,cf76a6e5773cf2f19ddd635fa646c5a6721f6fed8998d22ea1d0910bee8017a2,2022-11-11 16:56:13,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint aa(int n)\n{\n    int a,b,c;\n    if(n==0) return 0;\n    else{\n        scanf(\""%d\"",&a);\n        if(a>0&&a<=pow(10,9))\n        {\n        aa(n-1);\n        c=pow(6,a);\n        b=c%10;\n        printf(\""%d\\n\"",b);\n        }\n        else  printf(\""%d\\n\"",1);\n    }\n}\nint main()\n{\n    int t;\n    scanf(\""%d\"",&t);\n    aa(t);\n    return 0;\n}",WRONG_ANSWER,8,580
1590991786112253952,a2fa7eb1ab1c2f6fa23517852ee6971ea32fd0c7742d71d7914ed729415f04d9,2022-11-11 16:56:15,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\n#include<string.h>\nlong long a[100000]={};\nusing namespace std;\nint main(){\n\tlong long t;\n\tcin>>t; \n\tfor(int i=1;i<=t;i++)\n\t{\n\t    cin>>a[i];\n\t    if(a[100000]!=0)\n\t\t    memset(a, 0, sizeof(a));\n\t}    \n\tfor(int i=1;i<=t;i++)\n\t    cout<<6<<endl;\n\t    return 0;\n}",WRONG_ANSWER,11,460
1590992002806755328,25b8e249c556de062ec0d61286db67304f907bc70204e22083d75434403578b1,2022-11-11 16:57:07,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n;\n\tscanf(\""%d\"",&n);\n\tint a[n],b[n];\n\tint i;\n\tfor(i=0;i<n;i++)\n\t    scanf(\""%d\"",&a[i]);\n\tfor(i=0;i<n;i++)\n\t\tscanf(\""%d\"",&b[i]);\n\tint num=0,j=0;\n\tint c[n];\n\tfor(i=0;i<n;i++)\n\t{\n\t\tint k=b[i]-a[i];\n\t\tif(k>0)\n\t\t    num=num+k;\n\t\telse\n\t\t{\n\t\t\tc[j]=num;\n\t\t\tj++;\n\t\t\tnum=0;\n\t\t}  \n\t} \n\tint m=c[0];\n\tfor(i=1;i<j;i++)\n\t{\n\t\tif(c[i]>m)\n\t\tm=c[i];\n\t}\n\tprintf(\""%d\"",m);\n    return 0;\n}",WRONG_ANSWER,3,312
1590992024608772096,361d4ab0fa1284b9bf8a3ba65da408861b894c5c0617b83f77f2c1d9a1a3ec92,2022-11-11 16:57:12,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x,y,z;\n    int sum;\n    sum=x+y+z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d\"",sum);\n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    return 0;\n}\n\n\n\n\n",WRONG_ANSWER,3,184
1590992034058514432,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-11 16:57:14,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,a[n],i,j[n];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    { scanf(\""%d\"",&a[i]);\n       j[i]=pow(6,a[i]);}\n    for(i=0;i<n;i++)\n        printf(\""%d\\n\"",j[i]%10);\n    return 0;\n}",WRONG_ANSWER,6,324
1590992143089467392,361d4ab0fa1284b9bf8a3ba65da408861b894c5c0617b83f77f2c1d9a1a3ec92,2022-11-11 16:57:40,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x,y,z;\n    int sum;\n    sum=x+y-z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d\"",sum);\n    \n    \n    \n    \n    \n    return 0;\n}\n\n\n\n\n",WRONG_ANSWER,3,184
1590992228275761152,7222c2fb91a71fcf3f6560860557ab564f69a453594c9f1620ecc35bb26f5daf,2022-11-11 16:58:01,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\n\nint main (){\n    int n,x,i,sum,j,a;\n   scanf(\""%d\"",&n);\n\n    for(i=0;i<n;i++)\n    { sum=1;\n        scanf(\""%d\"",&x);\n      for(j=0;j<x;j++)\n    {\n        sum*=6;\n    }\n     a=sum%10;\n    printf(\""%d\\n\"",a);\n    }\n\n\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,23,372
1590992273461022720,b7ca5a176d530473c8faa24fa803cc5b5bef6deef335789b05821ec37e6b8252,2022-11-11 16:58:11,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int X,Y,Z,sum;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    sum=X+Y-Z;\n    printf(\""%d\"",sum);\n    return 0;\n}",ACCEPTED,8,184
1590992301017575424,361d4ab0fa1284b9bf8a3ba65da408861b894c5c0617b83f77f2c1d9a1a3ec92,2022-11-11 16:58:18,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x,y,z;\n    int sum;\n    sum=x+y-z;\n    scanf(\""%d %d %d\"",&x &y &z);\n    printf(\""%d\"",sum);\n    \n    \n    \n    \n    \n    return 0;\n}\n\n\n\n\n",COMPILE_ERROR,0,0
1590992414653874176,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-11 16:58:45,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <bits/stdc++.h>\nusing namespace std;\n#define N 1000\nint main()\n{\n\tint n;\n\tint a[N],b[N];\n\tcin>>n;\n\tfor(int i=0;i<n;i++) cin>>a[i];\n\tfor(int i=0;i<n;i++) {\n\t\tcin>>b[i];\n\t\ta[i]=b[i]-a[i];\n\t}\n\tint maxx=0;\n\tfor(int i=0;i<n;i++){\n\t\tint sum=0,m=0;\n\t\tfor(int j=i;j<n;j++){\n\t\t\tsum+=a[j];\n\t\t\tif(sum>m) m=sum;\n\t\t}\n\t\tif(m>maxx) maxx=m;\n\t}\n\tcout<<maxx<<endl;\n}",COMPILE_ERROR,0,0
1590992461860745216,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-11 16:58:56,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"a = int(input())\nm=0\nif 2<=a <=100000:\n    for n in range(2,a+1):\n        for x in range(2,n):\n            if n%x ==0:\n                break\n            else:\n                m=m+1\nprint(m)\n            \n    \n",TIME_LIMIT_EXCEEDED,1000,2936
1590992509554196480,b7ca5a176d530473c8faa24fa803cc5b5bef6deef335789b05821ec37e6b8252,2022-11-11 16:59:08,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main()\n{\n   int a=2022;\n    printf(\""%d\"",a);\nreturn 0;\n}\n",ACCEPTED,5,320
1590992665368375296,f1feb45d46abad163f730e5b023ce1df76883054d0a1741228a76c2c69aa3eda,2022-11-11 16:59:45,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main(){\n    int i,j,k,n;\n    int a[200];\n    a[0]=2;\n    a[1]=3;\n    k=2;\n    scanf(\""%d\"",&n);\n    for(i=5;i<n;i+=2){\n        for(j=0;a[j]*a[j]<=i;j++)\n            if(i%a[j]==0)\n                break;\n        if(a[j]*a[j]>i){\n            a[k]=i;\n            k++;\n        }\n    }\n    printf(\""%d\"",k);\n}",SEGMENTATION_FAULT,3,476
1590992703301681152,cf76a6e5773cf2f19ddd635fa646c5a6721f6fed8998d22ea1d0910bee8017a2,2022-11-11 16:59:54,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nfloat power(float x,int n)  \n{  int i;\n   float s=1.0;   \n   for(i=1;i<=n;i++)    \n       s*=x;\n   return s;    \n}\nint aa(int n)\n{\n    int a,b,c;\n    if(n==0) return 0;\n    else{\n        scanf(\""%d\"",&a);\n        if(a>0&&a<=pow(10,9))\n        {\n        aa(n-1);\n        c=power(6,a);\n        b=c%10;\n        printf(\""%d\\n\"",b);\n        }\n        else  printf(\""%d\\n\"",1);\n    }\n}\nint main()\n{\n    int t;\n    scanf(\""%d\"",&t);\n    aa(t);\n    return 0;\n}",WRONG_ANSWER,6,184
1590992749107679232,cf76a6e5773cf2f19ddd635fa646c5a6721f6fed8998d22ea1d0910bee8017a2,2022-11-11 17:00:05,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nfloat power(float x,int n)  \n{  int i;\n   float s=1.0;   \n   for(i=1;i<=n;i++)    \n       s*=x;\n   return s;    \n}\nint aa(int n)\n{\n    int a,b,c;\n    if(n==0) return 0;\n    else{\n        scanf(\""%d\"",&a);\n        if(a>0&&a<=pow(10,9))\n        {\n        aa(n-1);\n        c=power(6,a);\n        b=c%10;\n        printf(\""%d\\n\"",b);\n        }\n        else  printf(\""%d\\n\"",1);\n    }\n}\nint main()\n{\n    int t;\n    scanf(\""%d\"",&t);\n    aa(t);\n    return 0;\n}",WRONG_ANSWER,8,344
1590992770989359104,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-11 17:00:10,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,a[n],i,j[n];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    { scanf(\""%d\"",&a[i]);\n       j[i]=pow(6,a[i]);}\n    for(i=0;i<n;i++)\n        printf(\""%d\\n\"",j[i]%10);\n    return 0;\n}",WRONG_ANSWER,7,356
1590992773937934336,e67d0171967fcfdd3835361399616ff4e60e12e62c2ed2fd59506c58aeaae4ad,2022-11-11 17:00:11,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x,y,z,j;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    if(x>=0&&x<=100&&y>=0&&y<=100z>=0&&z<=100)\n        j=x+y-z;\n    printf(\""%d\"",j);\n}\n",COMPILE_ERROR,0,0
1590992803700740096,25b8e249c556de062ec0d61286db67304f907bc70204e22083d75434403578b1,2022-11-11 17:00:18,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n;\n\tscanf(\""%d\"",&n);\n\tint a[n],b[n];\n\tint i;\n\tfor(i=0;i<n;i++)\n\t    scanf(\""%d\"",&a[i]);\n\tfor(i=0;i<n;i++)\n\t\tscanf(\""%d\"",&b[i]);\n\tint num=0,j=0;\n\tint c[n];\n\tfor(i=0;i<n;i++)\n\t{\n\t\tint k=b[i]-a[i];\n\t\tif(k>0)\n\t\t    num=num+k;\n\t\telse\n\t\t{\n\t\t\tc[j]=num;\n\t\t\tj++;\n\t\t\tnum=0;\n\t\t}  \n\t} \n\tint m=c[0];\n\tfor(i=1;i<j;i++)\n\t{\n\t\tif(c[i]>m)\n\t\tm=c[i];\n\t}\n\tprintf(\""%d\\n\"",m);\n    return 0;\n}",WRONG_ANSWER,6,384
1590992826358366208,f1feb45d46abad163f730e5b023ce1df76883054d0a1741228a76c2c69aa3eda,2022-11-11 17:00:23,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main(){\n    int i,j,k,n;\n    int a[300];\n    a[0]=2;\n    a[1]=3;\n    k=2;\n    scanf(\""%d\"",&n);\n    for(i=5;i<n;i+=2){\n        for(j=0;a[j]*a[j]<=i;j++)\n            if(i%a[j]==0)\n                break;\n        if(a[j]*a[j]>i){\n            a[k]=i;\n            k++;\n        }\n    }\n    printf(\""%d\"",k);\n}",SEGMENTATION_FAULT,5,284
1590992834168160256,e67d0171967fcfdd3835361399616ff4e60e12e62c2ed2fd59506c58aeaae4ad,2022-11-11 17:00:25,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x,y,z,j;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n        j=x+y-z;\n    printf(\""%d\"",j);\n}\n",ACCEPTED,9,348
1590992882004201472,a2fa7eb1ab1c2f6fa23517852ee6971ea32fd0c7742d71d7914ed729415f04d9,2022-11-11 17:00:36,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main(){\n\tlong long t,a;\n\tcin>>t; \n\tfor(int i=1;i<=t;i++)\n\t    cin>>a;\n\tif(t==0)\n\t    cout<<1;   \n\tfor(int i=1;i<=t;i++)\n\t    cout<<6<<endl;\n\t    return 0;\n}",WRONG_ANSWER,13,436
1590992888492789760,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-11 17:00:38,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"X,Y,Z=map(int,input(\""请输入三个整数：\"").split())\n0<=X,Y,Z<=100\nA=X+Y-Z\nprint(A)\n",WRONG_ANSWER,15,2748
1590992911112646656,cf76a6e5773cf2f19ddd635fa646c5a6721f6fed8998d22ea1d0910bee8017a2,2022-11-11 17:00:43,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nfloat power(float x,int n)  \n{  int i;\n   float s=1.0;   \n   for(i=1;i<=n;i++)    \n       s*=x;\n   return s;    \n}\nint aa(int n)\n{\n    int a,b,c;\n    if(n==0) return 0;\n    else{\n        scanf(\""%d\"",&a);\n        if(a>0)\n        {\n        aa(n-1);\n        c=power(6,a);\n        b=c%10;\n        printf(\""%d\\n\"",b);\n        }\n        else  printf(\""%d\\n\"",1);\n    }\n}\nint main()\n{\n    int t;\n    scanf(\""%d\"",&t);\n    aa(t);\n    return 0;\n}",WRONG_ANSWER,8,464
1590993055539335168,a2fa7eb1ab1c2f6fa23517852ee6971ea32fd0c7742d71d7914ed729415f04d9,2022-11-11 17:01:18,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main(){\n\tlong long t,a;\n\tcin>>t; \n\tfor(int i=1;i<=t;i++)\n\t    cin>>a;\n\tif(t==0)\n\t    cout<<1;   \n\tfor(int i=1;i<=t;i++)\n\t    cout<<6<<endl;\n\t    return 0;\n}",WRONG_ANSWER,12,456
1590993113185824768,f1feb45d46abad163f730e5b023ce1df76883054d0a1741228a76c2c69aa3eda,2022-11-11 17:01:32,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main(){\n    int i,j,k,n;\n    int a[200];\n    a[0]=2;\n    a[1]=3;\n    k=2;\n    scanf(\""%d\"",&n);\n    for(i=5;i<n;i+=2){\n        for(j=0;a[j]*a[j]<=i;j++)\n            if(i%a[j]==0)\n                break;\n        if(a[j]*a[j]>i){\n            a[k]=i;\n            k++;\n        }\n    }\n    printf(\""%d\"",k);\n}",SEGMENTATION_FAULT,4,444
1590993122681749504,a2fa7eb1ab1c2f6fa23517852ee6971ea32fd0c7742d71d7914ed729415f04d9,2022-11-11 17:01:34,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main(){\n\tlong long t,a;\n\tcin>>t; \n\tfor(int i=1;i<=t;i++)\n\t    cin>>a;\n\tif(t==0)\n\t    cout<<1;\n\telse\t\t   \n\tfor(int i=1;i<=t;i++)\n\t    cout<<6<<endl;\n\treturn 0;\n}",WRONG_ANSWER,14,440
1590993226272673792,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-11 17:01:59,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"X,Y,Z=map(int,input(\""请输入三个整数：\"").split())\n0<=X,Y,Z<=100\nA=X+Y-Z\nprint(A)\n",WRONG_ANSWER,18,2760
1590993332023660544,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-11 17:02:24,Python,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"X,Y,Z=map(int,input(\""\"").split())\n0<=X,Y,Z<=100\nA=X+Y-Z\nprint(A)\n",ACCEPTED,36,2908
1590993448105193472,cf76a6e5773cf2f19ddd635fa646c5a6721f6fed8998d22ea1d0910bee8017a2,2022-11-11 17:02:51,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nfloat power(float x,int n)  \n{  int i;\n   float s=1.0;   \n   for(i=1;i<=n;i++)    \n       s*=x;\n   return s;    \n}\nint aa(int n)\n{\n    int a,b,c;\n    if(n==0) return 1;\n    else{\n        scanf(\""%d\"",&a);\n        aa(n-1);\n        c=power(6,a);\n        b=c%10;\n        printf(\""%d\\n\"",b);\n    }\n}\nint main()\n{\n    int t;\n    scanf(\""%d\"",&t);\n    aa(t);\n    return 0;\n}",TIME_LIMIT_EXCEEDED,29,472
1590993588660514816,b80fc2aed0abde15bdaa9327874c9784da696b6ed442d90001602ff2a017be15,2022-11-11 17:03:25,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main()\n{\n    int n,i,j,k,o,p,max=0,sum;\n    int a[n],b[n],c[n];\n    scanf(\""%d \"",&n);\n    for(i=0;i<n;i++)\n      scanf(\""%d\"",&a[i]);    \n\tfor(j=0;j<n;j++)\n      scanf(\""%d\"",&b[j]);\n\tfor(k=0;k<n;k++)\n\tc[k]=b[k]-a[k]; \n   \n\tfor(o=0;o<n;o++)\n\t{\n\t sum=0; \n\t for(p=o;p<n;p++)\n\t  {\n\t  sum=sum+c[p];\n\t   if(sum>max)\n\t    max=sum;\n} \n}\n   printf(\""%d\"",max); \n    return 0;\n}",WRONG_ANSWER,3,188
1590993598022221824,cf76a6e5773cf2f19ddd635fa646c5a6721f6fed8998d22ea1d0910bee8017a2,2022-11-11 17:03:27,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint power(int x,int n)  \n{  int i;\n   int s=1;   \n   for(i=1;i<=n;i++)    \n       s*=x;\n   return s;    \n}\nint aa(int n)\n{\n    int a,b,c;\n    if(n==0) return 1;\n    else{\n        scanf(\""%d\"",&a);\n        aa(n-1);\n        c=power(6,a);\n        b=c%10;\n        printf(\""%d\\n\"",b);\n    }\n}\nint main()\n{\n    int t;\n    scanf(\""%d\"",&t);\n    aa(t);\n    return 0;\n}",TIME_LIMIT_EXCEEDED,25,308
1590993859369308160,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 17:04:29,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\nint a,n,i;\n\n    scanf(\""%d\"",&n);\nfor(i=0;i<n;i++)\n{\n\tscanf(\""%d\"",&a);\n        if(a==0)\n            printf(\""%d\\n\"",1);\n        else\nprintf(\""%d\\n\"",6);\n}\n    return 0;\n}\n\n\n\n\n\n\n\n\n\n",ACCEPTED,9,324
1590993917414256640,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 17:04:43,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\nint a,n,i;\n\n    scanf(\""%d\"",&n);\nfor(i=0;i<n;i++)\n{\n\tscanf(\""%d\"",&a);\n        if(a==0)\n            printf(\""%d\\n\"",1);\n        else\nprintf(\""%d\\n\"",6);\n}\n    return 0;\n}\n\n\n\n\n\n\n\n\n\n",ACCEPTED,10,324
1590993926922743808,899c5501179552dc1fe5639f9047e15d0f835e7a87c8568193377882d0278985,2022-11-11 17:04:46,Python,0.0,1590528927448293376,1590525945717575680,1049226928954454016,import daytime\nyear=today.year\nprint(year),NON_ZERO_EXIT_CODE,17,2872
1590993952847736832,70c675ddfcb60b2192bc8ac38fb068fec0500208a5bf97a796c7cc074b43cf87,2022-11-11 17:04:52,Java,0.0,1590734963702620160,1590734503495200768,1049226928954454016,import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner myScanner = new Scanner(System.in);\n\t\tint n = myScanner.nextInt();\n\t\tint[] arr = new int[n]; // 消耗能量\n\t\tint[] arr1 = new int[n]; //获取能量\n\t\tint[] sum = new int[n];   //每次的能量\n\t\tint[] sum2 = new int[n];   //每次的能量\n\t\tint sum1 = 0;\n\t\tfor(int i = 0;i < n;i++) {\n\t\t\tarr[i] = myScanner.nextInt();\n\t\t}\n\t\tfor(int i = 0;i < n;i++) {\n\t\t\tarr1[i] = myScanner.nextInt();\n\t\t}\n\t\tfor(int i = 0;i < n;i++) {\n\t\t\tsum1 += -arr[i] + arr1[i];\n\t\t\tsum[i] = sum1;\n\t\t\tsum2[i] = -arr[i] + arr1[i];\n\t\t}\n\t\tArrays.sort(sum);\n\t\tArrays.sort(sum2);\n\t\t//System.out.println(sum[n-1]);\n\t    System.out.println(sum[n-1]>sum2[n-2]? sum[n-1]:sum2[n-2]);\n\t}\n},WRONG_ANSWER,128,16516
1590993981985566720,e67d0171967fcfdd3835361399616ff4e60e12e62c2ed2fd59506c58aeaae4ad,2022-11-11 17:04:59,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,j,x,y;\n    scanf(\""%d\\n\"",&x);\n    for(i=0;i<x;i++)\n    {\n        scanf(\""%d\"",&j);\n        if(j==0)\n            y=1;\n        else\n            y=6;\n        printf(\""%d\\n\"",y)\n    }\n}",COMPILE_ERROR,0,0
1590994008132878336,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-11 17:05:05,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main() {\n    int i, j,n;\n    int a[10]={0};\n    scanf(\""%d\"", &n);\n    for (i = 0; i <n; i++)\n        scanf(\"" % d\"", a[i]);\n    for (j = 0; j < n; j++)\n    {\n        if (a[j] == 0)\n            printf(\""6\\n\"");\n        else {\n            printf(\""6\"");\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,7,200
1590994097790324736,98901859b53edd496c40c4ba0469693a8e0ed685a8c2ca3d67a6cca01af154ef,2022-11-11 17:05:26,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n\tint X,Y,Z;\n\tint A;\n\tscanf(\""%d %d %d\"", &X, &Y, &Z);\n\tA = X + Y - Z;\n\tprintf(\""%d\"", A);\n\treturn 0;\n}",ACCEPTED,7,320
1590994316145786880,b7ca5a176d530473c8faa24fa803cc5b5bef6deef335789b05821ec37e6b8252,2022-11-11 17:06:18,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,j;\n    for(i=1;i<=n;i++)\n    {\n        if(n%i==0)\n    }\n    \n}",COMPILE_ERROR,0,0
1590994350732021760,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-11 17:06:27,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n   int n,m,k,i,d;\n    scanf(\""%d\"",&n);\n    for(m=2;m<n;m++)\n    {k=sqrt(m);\n     for(i=2;i<k;i++)\n         if(m%i==0) break;\n     if(i>=k+1)\n         d++;\n    }\n    printf(\""%d\"",d);\n    return 0;\n}",WRONG_ANSWER,11,332
1590994411117412352,e67d0171967fcfdd3835361399616ff4e60e12e62c2ed2fd59506c58aeaae4ad,2022-11-11 17:06:41,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,n,z,j;\n    scanf(\""%d\\n\"",&z);\n    for(i=0;i<z;i++)\n    {\n        scanf(\""%d\"",&n);\n        if(n==0)\n            j=1;\n        else\n            j=6;\n            printf(\""%d\\n\"",j);\n    }\n}\n",ACCEPTED,11,368
1590994536929759232,cf76a6e5773cf2f19ddd635fa646c5a6721f6fed8998d22ea1d0910bee8017a2,2022-11-11 17:07:11,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint power(int x,int n)  \n{  int i;\n   int s=1;   \n   for(i=1;i<=n;i++)    \n       s*=x;\n   return s;    \n}\nint aa(int n)\n{\n    int a,b,c;\n    if(n==0) return 1;\n    else{\n        scanf(\""%d\"",&a);\n        aa(n-1);\n        c=power(6,a);\n        b=c%10;\n        printf(\""%d\\n\"",6);\n    }\n}\nint main()\n{\n    int t;\n    scanf(\""%d\"",&t);\n    aa(t);\n    return 0;\n}",WRONG_ANSWER,12,504
1590994555963506688,899c5501179552dc1fe5639f9047e15d0f835e7a87c8568193377882d0278985,2022-11-11 17:07:16,Python,0.0,1590528927448293376,1590525945717575680,1049226928954454016,print(today.year),NON_ZERO_EXIT_CODE,19,2744
1590994617451982848,25b8e249c556de062ec0d61286db67304f907bc70204e22083d75434403578b1,2022-11-11 17:07:30,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n;\n\tscanf(\""%d\"",&n);\n\tint a[n],b[n];\n\tint i;\n\tfor(i=0;i<n;i++)\n\t    scanf(\""%d\"",&a[i]);\n\tfor(i=0;i<n;i++)\n\t\tscanf(\""%d\"",&b[i]);\n\tint num=0,j=0;\n\tint c[n];\n\tfor(i=0;i<n;i++)\n\t{\n\t\tint k=b[i]-a[i];\n\t\tif(k>0)\n\t\t    num=num+k;\n\t\telse\n\t\t{\n\t\t\tc[j]=num;\n\t\t\tj++;\n\t\t\tnum=0;\n\t\t}  \n\t} \n\tc[j]=num;\n\tj++;\n\tint m=c[0];\n\tfor(i=1;i<j;i++)\n\t{\n\t\tif(c[i]>m)\n\t\tm=c[i];\n\t}\n\tprintf(\""%d\"",m);\n    return 0;\n}",WRONG_ANSWER,5,312
1590994761434050560,e67d0171967fcfdd3835361399616ff4e60e12e62c2ed2fd59506c58aeaae4ad,2022-11-11 17:08:05,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int i,j,num,count=0;\n    scanf(\""%d\"",&num);\n    for(i=2;i<num;i++)\n    {\n        for(j=2;j<=sqrt(i);j++) \n        {\n            if(i%j==0)\n            break;\n        }\n            if(j>sqrt(i))\n            count++;\n    }\n    printf(\""%d\"",count);\n}\n",ACCEPTED,16,320
1590994960906760192,2e4af98c441106efa9ee51f8a781d0eee91a3dff6193987d421eb3a48725c814,2022-11-11 17:08:52,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,#include <iostream>\n\n#define ll long long\nusing namespace std;\n\n\nint fun(ll n) {\n    if (n == 0)return 1;\n    int t = 6;\n    for (int i = 0; i < n; ++i) {\n        t = (t * t) % 10;\n    }\n    return t;\n}\n\nint main() {\n    int x;\n    cin >> x;\n    ll n;\n\n    for (int i = 0; i < x; ++i) {\n        cin >> n;\n        cout << fun(n);\n    }\n\n\n    return 0;\n},ACCEPTED,14,728
1590995025171886080,f1feb45d46abad163f730e5b023ce1df76883054d0a1741228a76c2c69aa3eda,2022-11-11 17:09:07,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main(){\n    int i,j,k,n;\n    k=2;\n    scanf(\""%d\"",&n);\n    for(i=5;i<n;i+=2){\n        for(j=2;j*j<=i;j++)\n            if(i%j==0)\n                break;\n        if(j*j>i)\n            k++;\n    }\n    printf(\""%d\"",k);\n}",ACCEPTED,14,372
1590995033568907264,d21dc339d37b0772b2547441444d4b660b000ac3ebe190aee01769e2dd619c10,2022-11-11 17:09:09,Python,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"count=1\nn=int(input())\nprimenumber=[3]\nfor i in range(3,n,2):\n    t=False\n    if i>10 and i%10==5:\n        continue\n    for j in primenumber:\n        if j>int(i**0.5):\n            t=True\n            break\n        if i%j==0:\n            t=False\n            break\n    if t:\n        count+=1\n        primenumber.append(i)\nprint(count)",ACCEPTED,226,3128
1590995053479243776,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-11 17:09:14,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n   int n,m,k,i,d;\n    scanf(\""%d\"",&n);\n    for(m=2;m<n;m++)\n    {k=sqrt(m);\n     for(i=2;i<k;i++)\n         if(m%i==0) break;\n     if(i>=k+1)\n         d++;\n    }\n    printf(\""%d\"",d);\n    return 0;\n}",WRONG_ANSWER,10,196
1590995110286897152,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-11 17:09:28,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,a[n],i,j[n];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    { scanf(\""%d\"",&a[i]);\n       j[i]=pow(6,a[i]);}\n    for(i=0;i<n;i++)\n        printf(\""%d\\n\"",j[i]%10);\n    return 0;\n}",WRONG_ANSWER,6,316
1590995433869082624,13eac09c9e523ec396926840225e626f8fff54ca0e8a92e46e533705daa83ac2,2022-11-11 17:10:45,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    printf(\""%d\"",X+Y-Z);\n    return 0;\n}",ACCEPTED,7,192
1590995444237402112,e67d0171967fcfdd3835361399616ff4e60e12e62c2ed2fd59506c58aeaae4ad,2022-11-11 17:10:47,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,x[20],h[20],i,j,max,sum;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&x[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&h[i]);\n    max=x[1]-h[1];\n    for(i=0;i<n;i++)\n        for(j=i,sum=0;j<n;j++)\n    {\n        sum+=x[j]-h[j];\n        if(sum>max) \n            max=sum;\n    }\n    printf(\""%d\\n\"",max);\n    return 0;\n}\n",WRONG_ANSWER,3,188
1590995444942045184,361d4ab0fa1284b9bf8a3ba65da408861b894c5c0617b83f77f2c1d9a1a3ec92,2022-11-11 17:10:47,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,print(2022),ACCEPTED,17,2880
1590995672831143936,e67d0171967fcfdd3835361399616ff4e60e12e62c2ed2fd59506c58aeaae4ad,2022-11-11 17:11:42,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n main()\n{\n    int n,x[20],h[20],i,j,max,sum;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&x[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&h[i]);\n    max=x[1]-h[1];\n    for(i=0;i<n;i++)\n        for(j=i,sum=0;j<n;j++)\n    {\n        sum+=x[j]-h[j];\n        if(sum>max) \n            max=sum;\n    }\n    printf(\""%d\\n\"",max);\n    return 0;\n}\n",WRONG_ANSWER,3,328
1590995680762572800,a2fa7eb1ab1c2f6fa23517852ee6971ea32fd0c7742d71d7914ed729415f04d9,2022-11-11 17:11:44,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main(){\n\tint t,a;\n\tcin>>t; \n\tfor(int i=1;i<=t;i++)\n\t    cin>>a;\n\tif(a==0)\n\t    cout<<1;\n\telse\t\t   \n\t    for(int i=1;i<=t;i++)\n\t        cout<<6<<endl;\n\treturn 0;\n}",WRONG_ANSWER,12,472
1590996031322525696,e0a829315cc9947a3e714cd579e3322e8dee5f8ca36e30fd276de5a8e294b6f8,2022-11-11 17:13:07,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n;\n    int i,f,j;\n    int k=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n    {\n        f=1;\n        for(j=2;j<i;j++)\n        if(i%j==0){\n                f=0;\n                break;\n        }\n        if(f==1)\n            k++;\n    }\n    printf(\""%d\"",k);\n    return 0;\n}\n",ACCEPTED,945,332
1590996131734163456,e67d0171967fcfdd3835361399616ff4e60e12e62c2ed2fd59506c58aeaae4ad,2022-11-11 17:13:31,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint  main()\n{\n    int n,w[20],v[20],i,j,max,sum;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&w[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&v[i]);\n    max=v[1]-w[1];\n    for(i=0;i<n;i++)\n        for(j=i,sum=0;j<n;j++)\n    {\n        sum+=v[j]-w[j];\n        if(sum>max) \n            max=sum;\n    }\n    printf(\""%d\\n\"",max);\n    return 0;\n}\n",ACCEPTED,4,320
1590996253742272512,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-11 17:14:00,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int c,t,b,i;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<t;i++)\n    {\n        c=pow(6,a[i]);\n        b=c%10;\n        printf(\""%d\\n\"",b);\n    }\n    \n}",WRONG_ANSWER,6,356
1590996389868408832,e67d0171967fcfdd3835361399616ff4e60e12e62c2ed2fd59506c58aeaae4ad,2022-11-11 17:14:33,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint  main()\n{\n    int n,x[20],y[20],i,j,max,sum;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&x[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&y[i]);\n    max=y[1]-x[1];\n    for(i=0;i<n;i++)\n        for(j=i,sum=0;j<n;j++)\n    {\n        sum+=y[j]-x[j];\n        if(sum>max) \n            max=sum;\n    }\n    printf(\""%d\\n\"",max);\n    return 0;\n}\n",ACCEPTED,3,192
1590996406792400896,25b8e249c556de062ec0d61286db67304f907bc70204e22083d75434403578b1,2022-11-11 17:14:37,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n;\n\tscanf(\""%d\"",&n);\n\tint a[n],b[n];\n\tint i;\n\tfor(i=0;i<n;i++)\n\t    scanf(\""%d\"",&a[i]);\n\tfor(i=0;i<n;i++)\n\t\tscanf(\""%d\"",&b[i]);\n\tint num=0,j=0;\n\tint c[n];\n\tfor(i=0;i<n;i++)\n\t{\n\t\tint k=b[i]-a[i];\n\t\tif(k>=0)\n\t\t    num=num+k;\n\t\telse\n\t\t{\n\t\t\tc[j]=num;\n\t\t\tj++;\n\t\t\tnum=0;\n\t\t}  \n\t} \n\tc[j]=num;\n\tj++;\n\tint m=c[0];\n\tfor(i=1;i<j;i++)\n\t{\n\t\tif(c[i]>m)\n\t\tm=c[i];\n\t}\n\tprintf(\""%d\"",m);\n    return 0;\n}\n",WRONG_ANSWER,3,472
1590996673428520960,5a1c17b308a3b3595833d34c6bdfb75e9f5dd0d065acfeb7f28ab8102ba7406c,2022-11-11 17:15:40,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main()\n{\n    int n,i,j,k;\n    int sum1 = 0;\n    scanf(\""%d\"",&n);\n    int x[n],y[n];\n    int z[n];\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&x[i]);\n        x[i] = -x[i];\n    }\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&y[i]);\n    }\n        for(j=0;j<n;j++){\n            if(sum1<=0){sum1 = x[j]+y[j];\n            }else{\n            sum1 += x[j]+y[j];\n            }\n            z[j] = sum1;\n        }\n    int max = z[0];\n    for(k=1;k<n;k++){\n        if(max<z[k]){\n            max = z[k];\n        }\n    }\n   printf(\""%d\"",max);\n    return 0;\n}\n",ACCEPTED,4,320
1590997059170250752,1f29a576db974352c60cbe8aafdc4e5328b24d800890ab1c712d8c9fa85d72cc,2022-11-11 17:17:12,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tprintf(\""2022\""); \n\treturn 0;\n}\n",ACCEPTED,4,336
1590997412913676288,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-11 17:18:37,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"num = int(input())\nlist1 = input().split(\"" \"")#消耗的能量\nlist2 = input().split(\"" \"")#获得的能量\nsum = 0\nfor i in range(num):\n    list1[i] = int(list1[i])\n    list2[i] = int(list2[i])\n    if(list2[i]>list1[i]):\n        sum+=list2[i]-list1[i]\nprint(sum)\n",WRONG_ANSWER,16,2880
1590997462901370880,1f29a576db974352c60cbe8aafdc4e5328b24d800890ab1c712d8c9fa85d72cc,2022-11-11 17:18:49,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint a,b,c;\n\tscanf(\""%d%d%d\"",&a,&b,&c);\n\tprintf(\""%d\"",a+b-c);\n\treturn 0;\n}\n",ACCEPTED,8,452
1590997467016007680,7222c2fb91a71fcf3f6560860557ab564f69a453594c9f1620ecc35bb26f5daf,2022-11-11 17:18:50,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nvoid gewei(int a)\n{\n    if(a==0)\n        printf(\""1\"");\n    else\n    printf(\""6\"");\n}\nint main()\n{\n    int m,n,i;\n    scanf(\""%d\"",&n);\n   while(scanf(\""%d\"",&m)!=EOF)\n   {\n      gewei(m);\n      printf(\""\\n\"");\n   }\n    return 0;\n}",ACCEPTED,10,340
1590997504211095552,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-11 17:18:58,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main() {\n    int i, j;\n    int a[10];\n    int n = 0;\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] == 0)\n            printf(\""1\"");\n        else\n        {\n            if (i < n - 1)\n                printf(\""6\\n\"");\n            else\n                printf(\""6\"");\n        }\n    }\n    return 0;\n}",ACCEPTED,9,196
1590997675078647808,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-11 17:19:39,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,a[n],i,j[n];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    { scanf(\""%d\"",&a[i]);\n       j[i]=pow(6,a[i]);}\n    for(i=0;i<n;i++)\n        printf(\""%d\\n\"",j[i]%10);\n    return 0;\n}",WRONG_ANSWER,6,356
1590997736256745472,361d4ab0fa1284b9bf8a3ba65da408861b894c5c0617b83f77f2c1d9a1a3ec92,2022-11-11 17:19:54,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"a,b,c=int(input()).slipt()\nd=a+b-c\nprint(d)\n\n\n\n",NON_ZERO_EXIT_CODE,17,2872
1590997777012822016,9a1ecd1db02b268060006afd7de34ec54e74e90bf61becbb6811fb23971c4720,2022-11-11 17:20:04,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"s=eval(input())\na=list(map(int,input().split()))\nfor i in a:\n    x=str(6**i)[-1]\n    print(x)\n",TIME_LIMIT_EXCEEDED,166,4132
1590997777423839232,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-11 17:20:04,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int sum=0;\n    int n;\n    scanf(\""%d\"",&n);\n    int i=2,j=2;\n    for(i=2;i<n;i++)\n    {\n        for(j=2;j<n;j++)\n        {\n            if(i%j==0)\n                break;\n        }\n        if(i==j)\n            sum++;\n    }\n    printf(\""%d\\n\"",sum);\n}",ACCEPTED,970,340
1590997797233557504,361d4ab0fa1284b9bf8a3ba65da408861b894c5c0617b83f77f2c1d9a1a3ec92,2022-11-11 17:20:08,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"a,b,c=int(input()).slipt()\nint d\nd=a+b-c\nprint(d)\n\n\n\n",NON_ZERO_EXIT_CODE,17,2904
1590997885242638336,cf76a6e5773cf2f19ddd635fa646c5a6721f6fed8998d22ea1d0910bee8017a2,2022-11-11 17:20:29,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint power(int x,int n)  \n{  int i;\n   int s=1;   \n   for(i=1;i<=n;i++)    \n       s*=x;\n   return s;    \n}\nint aa(int n)\n{\n    int a,b,c;\n     if(n==0) return 1;\n     else if(n>0&&n<=10){\n        scanf(\""%d\"",&a);\n        aa(n-1);\n        c=power(6,a);\n        b=c%10;\n        printf(\""%d\\n\"",b);\n}\n}\nint main()\n{\n    int t;\n    scanf(\""%d\"",&t);\n    aa(t);\n    return 0;\n}",TIME_LIMIT_EXCEEDED,25,472
1590997923708600320,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-11 17:20:38,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"num = int(input())\nlist1 = input().split(\"" \"")#消耗的能量\nlist2 = input().split(\"" \"")#获得的能量\nsum = 0\nfor i in range(num):\n    list1[i] = int(list1[i])\n    list2[i] = int(list2[i])\n    if(list2[i]>list1[i]):\n        sum+=list2[i]-list1[i]\nprint(sum)\n",WRONG_ANSWER,17,2780
1590998098107760640,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-11 17:21:20,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n   int n,m,k,i,d;\n    if(scanf()){\""%d\"",&n}\n    for(m=2;m<n;m++)\n    {k=sqrt(m);\n     for(i=2;i<k;i++)\n         if(m%i==0) break;\n     if(i>=k+1)\n         d++;\n    }\n    printf(\""%d\"",d);\n    return 0;\n}",COMPILE_ERROR,0,0
1590998127807627264,72be009ca211dc57c9dd8a9eb2164c240fe898433210118c9c307ecba037e2a0,2022-11-11 17:21:27,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"num = int(input())\nlist = input().split(\"" \"")\nfor i in range(num):\n    x = int(list[i])\n    y = (6**x)%10\n    i+=1\n    print(y)",TIME_LIMIT_EXCEEDED,170,3936
1590998137408389120,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-11 17:21:29,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n   int n,m,k,i,d;\n    if(scanf()){\""%d\"",&n};\n    for(m=2;m<n;m++)\n    {k=sqrt(m);\n     for(i=2;i<k;i++)\n         if(m%i==0) break;\n     if(i>=k+1)\n         d++;\n    }\n    printf(\""%d\"",d);\n    return 0;\n}",COMPILE_ERROR,0,0
1590998223525838848,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-11 17:21:50,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n   int n,m,k,i,d;\n    if(scanf()){};\n    for(m=2;m<n;m++)\n    {k=sqrt(m);\n     for(i=2;i<k;i++)\n         if(m%i==0) break;\n     if(i>=k+1)\n         d++;\n    }\n    printf(\""%d\"",d);\n    return 0;\n}",COMPILE_ERROR,0,0
1590998291179941888,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-11 17:22:06,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n   int n,m,k,i,d;\n    if(scanf()){n};\n    for(m=2;m<n;m++)\n    {k=sqrt(m);\n     for(i=2;i<k;i++)\n         if(m%i==0) break;\n     if(i>=k+1)\n         d++;\n    }\n    printf(\""%d\"",d);\n    return 0;\n}",COMPILE_ERROR,0,0
1590998351980593152,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-11 17:22:21,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int c,t,b,i;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<t;i++)\n    {\n        c=pow(6,a[i]);\n        b=c%10;\n        printf(\""%d\\n\"",b);\n    }\n    \n}",WRONG_ANSWER,6,456
1590998356820799488,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-11 17:22:22,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n    int i,max,b,j;\n   scanf(\""%d\"",&b);\n   int a[b],n[b];\n   int c[b][b];\n   for(i=0;i<2;i++)\n    for(j=0;j<b;j++)\n       scanf(\""%d\"",&c[i][j]);\n   for(i=0;i<b;i++)\n     a[i]=c[1][i]-c[0][i];\n   max=0;\n   for(i=0;i<b;i++)\n     n[i]=0;\n     n[0]=a[0];\n   for(i=1;i<b;i++)\n   {\n      if(n[i-1]>0)\n      n[i]=n[i-1]+a[i];\n      else\n        n[i]=a[i];\n      if(n[i]>max)\n        max=n[i];\n\n   }\n     printf(\""%d\"",max);\n}\n",ACCEPTED,4,196
1590998420968505344,0ed66ddb50163bbc5dd43c591bc3d500e68ed69fe23bfebfa6ac827c1dfc1849,2022-11-11 17:22:37,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nmain()\n{\n    printf(\""2022\"");\n}",ACCEPTED,3,360
1590998665303490560,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-11 17:23:35,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int c,t,b,i;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<t;i++)\n    {\n        c=pow(6,a[i]);\n        b=c%10;\n        printf(\""%d\\n\"",b);\n    }\n    \n}",WRONG_ANSWER,7,320
1590998709389799424,c47b15e117166a3dd00078b9f795673d5284a2761e582479119229751cc734d3,2022-11-11 17:23:46,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#define  MAX  100\n\nint main() {\n    long int a,b,n=0,i=0;\n    long int s[MAX];\n\n    scanf(\""%d\"",&a);\n\n    while(i<a){\n        scanf(\""%d\"",&s[n]);\n\n        i++;\n        n++;}\n    n=0;\n    for(i=0;i<a;i++){\n        if(s[n]>=0 && s[n]<=5){\n           b=int (pow(6,s[n]))% 10;\n        n++;\n        printf(\""%ld\\n\"",b);\n        }\n        else if(s[n]>5 && s[n]<=pow(10,9))\n        printf(\""6\\n\"");\n    }\n\n\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,20,200
1590998775869538304,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-11 17:24:02,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n   int n,m,k,i,d;\n    scanf(\""%d\"",&n);\n    for(m=2;m<n;m++)\n    {k=sqrt(m);\n     for(i=2;i<k;i++)\n         if(m%i==0) break;\n     if(i>=k+1)\n         d++;\n    }\n    printf(\""%d\"",d);\n    return 0;\n}",WRONG_ANSWER,11,308
1590999119034912768,a2fa7eb1ab1c2f6fa23517852ee6971ea32fd0c7742d71d7914ed729415f04d9,2022-11-11 17:25:23,C++,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint n,k=0;\n\tcin>>n;\n\tfor(int i=2;i<=n;i++)\n\t{\n\t\tint s=1;\n\t\tfor(int j=2;j<i;j++)\n\t\t    if(i%j==0)\n\t\t    {\n\t\t\t    s=0;\n\t\t\t    break;\n\t        }\n\t    if(s==1)\n\t        k++;   \n\t}\n\tcout<<k; \n\treturn 0;\n} ",ACCEPTED,926,460
1590999232851521536,9a1ecd1db02b268060006afd7de34ec54e74e90bf61becbb6811fb23971c4720,2022-11-11 17:25:51,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"s=eval(input())\na=list(map(int,input().split()))\nfor i in range(s):\n    x=str(6**a[i])[-1]\n    print(x)\n",TIME_LIMIT_EXCEEDED,165,3976
1590999305421369344,24daa7a58808ceb95b2ed2e23721ea7b987a061e19ca5fee0ee2d0f93c78507f,2022-11-11 17:26:08,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b,c,d;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    0<=a,a<=100;\n    0<=b,b<=100;\n    0<=c,c<=100;\n    d=a+b-c;\n    printf(\""%d\"",d);\n    return 0;\n}",ACCEPTED,6,340
1590999379903819776,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-11 17:26:26,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int c,t,b,i;\n    scanf(\""%c\"",&t);\n    int a[t];\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%c\"",&a[i]);\n    }\n    for(i=0;i<t;i++)\n    {\n        c=pow(6,a[i]);\n        b=c%10;\n        printf(\""%d\\n\"",b);\n    }\n    \n}",TIME_LIMIT_EXCEEDED,20,384
1590999394990731264,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-11 17:26:29,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n   int n,m,k,i,d;\n    if(scanf(\""%d\"",&n));\n    for(m=2;m<n;m++)\n    {k=sqrt(m);\n     for(i=2;i<k;i++)\n         if(m%i==0) break;\n     if(i>=k+1)\n         d++;\n    }\n    printf(\""%d\"",d);\n    return 0;\n}",WRONG_ANSWER,10,324
1590999416050356224,0ed66ddb50163bbc5dd43c591bc3d500e68ed69fe23bfebfa6ac827c1dfc1849,2022-11-11 17:26:34,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nmain()\n{\n    int X,Y,Z;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    if(X>=0&&X<=100&&Y>=0&&Y<=100&&Z>=0&&Z<=100)\n    printf(\""%d\"",X+Y-Z);\n}",ACCEPTED,6,340
1590999494374764544,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-11 17:26:53,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int t,b,i;\n    double c;\n    scanf(\""%c\"",&t);\n    double a[t];\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%c\"",&a[i]);\n    }\n    for(i=0;i<t;i++)\n    {\n        c=pow(6,a[i]);\n        b=c%10;\n        printf(\""%d\\n\"",b);\n    }\n    \n}",COMPILE_ERROR,0,0
1590999542567317504,a2fa7eb1ab1c2f6fa23517852ee6971ea32fd0c7742d71d7914ed729415f04d9,2022-11-11 17:27:04,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,#include<iostream>\nint a[100000000];\nusing namespace std;\nint main(){\n\tint t;\n\tcin>>t; \n\tfor(int i=1;i<=t;i++)\n\t{\t\t   \n\t\tcin>>a[i];\n\n    }\t\t   \n\t    for(int i=1;i<=t;i++)\n\t    {\n\t    \tif(a[i]==0)\n\t    \t    cout<<1<<endl;\n\t    \telse    \n\t\t        cout<<6<<endl;\n\t\t  \n\t    }\n\treturn 0;\n},WRONG_ANSWER,8,316
1590999578353119232,9ca3f63f61fa4f349009d69e7059514c3a39dbdd5a1f94342c11f4c33ccdceaa,2022-11-11 17:27:13,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"x = int(input())\ny = input().split(\"" \"")\nfor i in range(x):\n    #a,b,c = [int(x) for x in input().split(\"" \"")]\n    '''a = int(y[i])\n    b = 6**a\n    b = b%10\n    print(b)'''\n    if y[i] == \""\"" or int(y[i])<0 or int(y[i])>=10**9:\n        break\n    else:\n        if y[i] == \""0\"":\n            print (1)\n        else:\n            print (6)\n",WRONG_ANSWER,35,2888
1590999623618048000,f55f4c0e0e3367434e26a462e3665271f5b4141ea3de4f34d96fdb21d67e2a7c,2022-11-11 17:27:24,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z,w;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    if(X>=0&&X<+100&&Y>=0&&Y<+100&&Z>=0&&Z<+100)\n       w=X+Y-Z;\n       printf(\""%d\"",w);\n\n\n\n    return 0;\n}\n",ACCEPTED,7,196
1590999632656773120,cf76a6e5773cf2f19ddd635fa646c5a6721f6fed8998d22ea1d0910bee8017a2,2022-11-11 17:27:26,C++,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tint n,f;\n\tcin >> n;\n\tint cnt = 0;\n\t\tfor (int i = 2; i <= n; i++)\n\t\t{\n\t\t\tf=1;\n\t\t\tfor(int j = 2; j <=sqrt(i); j++)\n\t\t\t{\n\t\t\t\tif(i%j==0){\n\t\t\t\t\tf=0;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(f){\n\t\t\t//cout << i << endl ;\n\t\t\tcnt++;\n\t\t\t}\n\t\t}\n\tcout << cnt<< endl;\n\treturn 0;\n}\n",ACCEPTED,15,476
1590999681688211456,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-11 17:27:38,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int c,b,i;\n   int t;\n    scanf(\""%d\"",&t);\n    double a[t];\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%c\"",&a[i]);\n    }\n    for(i=0;i<t;i++)\n    {\n        c=pow(6,a[i]);\n        b=c%10;\n        printf(\""%d\\n\"",b);\n    }\n    \n}",WRONG_ANSWER,3,188
1590999747605889024,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-11 17:27:53,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int c,b,i;\n   int t;\n    scanf(\""%d\"",&t);\n    int  a[t];\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<t;i++)\n    {\n        c=pow(6,a[i]);\n        b=c%10;\n        printf(\""%d\\n\"",b);\n    }\n    \n}",WRONG_ANSWER,6,312
1590999760931172352,9ca3f63f61fa4f349009d69e7059514c3a39dbdd5a1f94342c11f4c33ccdceaa,2022-11-11 17:27:57,Python,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"x = int(input())\ny = input().split(\"" \"")\nfor i in range(x):\n    if y[i] == \""0\"":\n        print (1)\n    else:\n        print (6)\n",ACCEPTED,45,2872
1590999884562501632,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-11 17:28:26,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int c,b,i;\n   int t;\n    scanf(\""%d\"",&t);\n    int  a[t];\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<t;i++)\n    {\n        c=pow(6,a[i]);\n        b=c%10;\n        printf(\""%d\\n\"",b);\n    }\n    \n}",WRONG_ANSWER,6,356
1591000079979319296,c47b15e117166a3dd00078b9f795673d5284a2761e582479119229751cc734d3,2022-11-11 17:29:13,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#define  MAX  100\n\nint main() {\n    int a,b,n=0,i=0;\n    int s[MAX];\n\n    scanf(\""%d\"",&a);\n\n    while(i<a){\n        scanf(\""%d\"",&s[n]);\n\n        i++;\n        n++;}\n    n=0;\n    for(i=0;i<a;i++){\n        if(s[n]>=0 && s[n]<=5){\n           b=int (pow(6,s[n]))% 10;\n        n++;\n        printf(\""%ld\\n\"",b);\n        }\n        else if(s[n]>5 && s[n]<=pow(10,9))\n        printf(\""6\\n\"");\n    }\n\n\n    return 0;\n}\n",WRONG_ANSWER,6,344
1591000520859365376,361d4ab0fa1284b9bf8a3ba65da408861b894c5c0617b83f77f2c1d9a1a3ec92,2022-11-11 17:30:58,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"a,b,c=int(input()).slipt()\nd=a+b-c\nprint(d)\n\n\n\n",NON_ZERO_EXIT_CODE,15,2888
1591000566942208000,361d4ab0fa1284b9bf8a3ba65da408861b894c5c0617b83f77f2c1d9a1a3ec92,2022-11-11 17:31:09,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"a,b,c=int(input()).slipt( )\nd=a+b-c\nprint(d)\n\n\n\n",NON_ZERO_EXIT_CODE,15,2760
1591000643777658880,361d4ab0fa1284b9bf8a3ba65da408861b894c5c0617b83f77f2c1d9a1a3ec92,2022-11-11 17:31:27,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"a,b,c=int(input()).slipt()\nd=a+b-c\nprint(d)\n\n\n\n",NON_ZERO_EXIT_CODE,16,2748
1591000862451871744,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-11 17:32:19,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int m,k,i,n,d;\n    scanf(\""%d\"",&n);\n    for(m=2;m<=n;m=m+1)\n    {k=sqrt(m);\n      for(i=2;i<=k;i++)\n        if(m%i==0) break;\n    if(i>=k+1)\n        ++d;\n     }\n    printf(\""%d\"",d);\n    return 0;\n}\n",WRONG_ANSWER,10,316
1591000942512771072,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-11 17:32:38,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int m,k,i,n,d;\n    if(scanf(\""%d\"",&n));\n    for(m=2;m<=n;m=m+1)\n    {k=sqrt(m);\n      for(i=2;i<=k;i++)\n        if(m%i==0) break;\n    if(i>=k+1)\n        ++d;\n     }\n    printf(\""%d\"",d);\n    return 0;\n}\n",WRONG_ANSWER,11,196
1591001042291044352,a2fa7eb1ab1c2f6fa23517852ee6971ea32fd0c7742d71d7914ed729415f04d9,2022-11-11 17:33:02,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,#include<iostream>\nusing namespace std;\nint main(){\n\tint t;\n\tcin>>t;\n\tint a[t]; \n\tfor(int i=1;i<=t;i++)\n\t{\t\t   \n\t\tcin>>a[i];\n\n    }\t\t   \n\t    for(int i=1;i<=t;i++)\n\t    {\n\t    \tif(a[i]==0)\n\t    \t    cout<<1<<endl;\n\t    \telse    \n\t\t        cout<<6<<endl;\n\t\t  \n\t    }\n\treturn 0;\n},ACCEPTED,11,460
1591001162776645632,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-11 17:33:31,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int m,k,i,n,d=0;\n    if(scanf(\""%d\"",&n));\n    for(m=2;m<=n;m=m+1)\n    {k=sqrt(m);\n      for(i=2;i<=k;i++)\n        if(m%i==0) break;\n    if(i>=k+1)\n        ++d;\n     }\n    printf(\""%d\"",d);\n    return 0;\n}\n",ACCEPTED,15,328
1591001194011623424,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-11 17:33:38,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"/*#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#include<string.h>\nint main()\n{int t,j,n;\nint x,len;\n char k[3000];\nscanf(\""%d\"",&t);\nint y[t];\nfor(j=0;j<t;j++)\n{\n    scanf(\""%d\"",&y[j]);\n\n}\nfor (j=0;j<t;j++)\n{\n     if(y[j]>=0&&y[j]<=int(pow(10,9))) {\n        k=char(pow(6,y[j]));\n        len=string(k);\n         x=int(k[len-1]);\n        printf(\""%d\"",x);\n     if(j<t-1) printf(\""\\n\"");\n}\n\nreturn 0;\n}\n}\n*/\n/*\n#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#include<string.h>\nint main()\n{int t,j,n,x;\nx=6;\nscanf(\""%d\"",&t);\nint y[t];\nfor(j=0;j<t;j++)\n{\n    scanf(\""%d\"",&y[j]);\n\n}\nfor (j=0;j<t;j++)\n{\n     if(y[j]>0) {\n        //n=int(pow(6,0));\n        //x=int(pow(6,y[j]))%10;\n        printf(\""%d\"",x);\n     if(j<t-1) printf(\""\\n\"");\n}\n    if(y[j]==0)\n    {\n        printf(\""1\"");\n        if(j<t-1) printf(\""\\n\"");\n    }\n}\nreturn 0;\n}*/\n/*\n#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main()\n{int t,j,n,x;\nx=6;\nscanf(\""%d\"",&t);\nint y;\nfor (j=0;j<t;j++)\n{\n    scanf(\""%d\"",&n);\n    if(n>=0&&n<=1000000000)\n    {\n\n\n    if(n>0) {x=6;printf(\""%d\"",x);}\n    if(n==0) {x=1;printf(\""%d\"",x);}\n    if(j<t-1) printf(\""\\n\"");\n    }\n\n}\nreturn 0;\n}*/\n#include<iostream>\n#include<stdio.h>\n#include<stdlib.h>\n#include<bits/stdc++.h>\n#include<math.h>\nusing namespace std;\nint fun(int n) {\n    if (n==0) return 1;\n    int t=6;\n    for (int i=0;i<n;++i) {\n        t=(t*t)%10;\n    }\nreturn t;\n}\n\nint main() {\n    int x;\n    cin >> x;\n    int n;\n    for (int i=0;i<x;++i) {\n        cin >> n;\n        cout << fun(n);\n        printf(\""\\n\"");\n    }\n    \n    return 0;\n}",ACCEPTED,12,476
1591001385263497216,0ed66ddb50163bbc5dd43c591bc3d500e68ed69fe23bfebfa6ac827c1dfc1849,2022-11-11 17:34:24,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nmain()\n{\n    int t,i=0,m;\n    scanf(\""%d\"",&t);\n    while(i<t)\n    {\n        int x;\n        m=1;\n        scanf(\""%d\"",&x);\n        int j=0;\n        while(j<x)\n        {\n            m*=6;\n        }\n        if(m>=0&&m<=1000000000)\n            printf(\""%d\\n\"",m%10);\n    }\n}",TIME_LIMIT_EXCEEDED,20,328
1591001526456352768,a2fa7eb1ab1c2f6fa23517852ee6971ea32fd0c7742d71d7914ed729415f04d9,2022-11-11 17:34:57,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,#include<iostream>\nlong long a[100000000];\nusing namespace std;\nint main(){\n\tint t;\n\tcin>>t;\n\t/*int a[t]; */\n\tfor(int i=1;i<=t;i++)\n\t{\t\t   \n\t\tcin>>a[i];\n\n    }\t\t   \n\t    for(int i=1;i<=t;i++)\n\t    {\n\t    \tif(a[i]==0)\n\t    \t    cout<<1<<endl;\n\t    \telse    \n\t\t        cout<<6<<endl;\n\t\t  \n\t    }\n\treturn 0;\n},ACCEPTED,10,464
1591001647717875712,19b1d22e5c87afa9233c236fc7b4d5e0e70acf3872968cbe9aae96e75e9e38d1,2022-11-11 17:35:26,C++,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <iostream>\n#include <cmath>\nusing namespace std;\n\nbool isOk(int &x){\n    if(x%2==0)\n        return false;\n    for(int i=3;i<=sqrt(x);i+=2){\n        if(x%i==0){\n            return false;\n        }\n    }\n    return true;\n\n}\nint main()\n{\n    int a,count;\n    count=1;\n    cin >> a;\n    for(int i=3; i<a; i++){\n        if(isOk(i)){\n            count++;\n        }\n    }\n    cout << count<<endl;\n    return 0;\n}",ACCEPTED,15,472
1591001725824204800,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-11 17:35:45,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,a[n],i,j[n];\n    if(scanf(\""%d\"",&n));\n    for(i=0;i<n;i++)\n    { if(scanf(\""%d\"",&a[i]));\n       j[i]=pow(6,a[i]);}\n    for(i=0;i<n;i++)\n        printf(\""%d\\n\"",j[i]%10);\n    return 0;\n}",WRONG_ANSWER,7,448
1591001906741293056,0ed66ddb50163bbc5dd43c591bc3d500e68ed69fe23bfebfa6ac827c1dfc1849,2022-11-11 17:36:28,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nmain()\n{\n    int t,i=0,m;\n    scanf(\""%d\"",&t);\n    while(i<t)\n    {\n        int x;\n        scanf(\""%d\"",&x);\n        m=pow(6,x);\n        if(m>=0&&m<=1000000000)\n            printf(\""%d\\n\"",m%10);\n    }\n}",TIME_LIMIT_EXCEEDED,20,448
1591002003906560000,fbea21dbaf89f1b064feaa20227f21c5e1c4888fdc371cf5e43f70615906e52a,2022-11-11 17:36:51,Python,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"n=int(input())\ncount=1\nfor i in range(3,n+1,2):\n    if i>5 and i%5==0:\n        continue\n    for j in range(3,int(i**0.5)+1,2):\n        if i%j==0:\n            break\n    else :   \n        count+=1\nprint(count)\n",ACCEPTED,155,2880
1591002025037463552,0ed66ddb50163bbc5dd43c591bc3d500e68ed69fe23bfebfa6ac827c1dfc1849,2022-11-11 17:36:56,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nmain()\n{\n    int t,i=0,m;\n    scanf(\""%d\"",&t);\n    while(i<t)\n    {\n        int x;\n        scanf(\""%d\"",&x);\n        m=pow(6,x);\n        if(m>=0&&m<=1000000000)\n            printf(\""%d\\n\"",m%10);\n        i++;\n    }\n}",WRONG_ANSWER,7,332
1591002122190127104,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-11 17:37:19,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,i;\n    int a[n];\n    int j[n];\n    if(scanf(\""%d\"",&n));\n    for(i=0;i<n;i++)\n    { if(scanf(\""%d\"",&a[i]));\n       j[i]=pow(6,a[i]);}\n    for(i=0;i<n;i++)\n        printf(\""%d\\n\"",j[i]%10);\n    return 0;\n}",WRONG_ANSWER,8,316
1591002335239802880,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-11 17:38:10,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,i;\n    int a[n];\n    int *j[n];\n    if(scanf(\""%d\"",&n));\n    for(i=0;i<n;i++)\n    { if(scanf(\""%d\"",&a[i]));\n       j[i]=&pow(6,a[i]);}\n    for(i=0;i<n;i++)\n        printf(\""%d\\n\"",*j[i]%10);\n    return 0;\n}",COMPILE_ERROR,0,0
1591002454773272576,cf76a6e5773cf2f19ddd635fa646c5a6721f6fed8998d22ea1d0910bee8017a2,2022-11-11 17:38:39,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016, ,COMPILE_ERROR,0,0
1591002588399603712,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-11 17:39:11,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,i;\n    int a[n];\n    int j[n];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    { scanf(\""%d\"",&a[i]);\n       j[i]=pow(6,a[i]);}\n    for(i=0;i<n;i++)\n        printf(\""%d\\n\"",j[i]%10);\n    return 0;\n}",WRONG_ANSWER,6,344
1591002632578203648,98901859b53edd496c40c4ba0469693a8e0ed685a8c2ca3d67a6cca01af154ef,2022-11-11 17:39:21,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int n;\n    int i;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=0;i<n;i++)\n    {\n        if(i==0)\n            scanf(\""%d\"",&a[i]);\n        else\n            scanf(\"" %d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if(i==0)\n        {\n            if(a[i]==0)\n                printf(\""1\"");\n            else\n                printf(\""6\"");\n        }\n        else\n        {\n            if(a[i]==0)\n                printf(\""\\n1\"");\n            else\n                printf(\""\\n6\"");\n        }\n\n    }\n    return 0;\n}\n",ACCEPTED,14,604
1591002639226155008,0ed66ddb50163bbc5dd43c591bc3d500e68ed69fe23bfebfa6ac827c1dfc1849,2022-11-11 17:39:23,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nmain()\n{\n    int t,i=0,m;\n    scanf(\""%d\"",&t);\n   for(i=0;i<t;i++)\n   {\n        int x;\n        scanf(\""%d\"",&x);\n        int j=0;\n       m=1;\n       while(j<x)\n       {\n           m*=6;\n           j++;\n       }\n        if(m>=0&&m<=1000000000)\n            printf(\""%d\\n\"",m%10);\n   }\n}",TIME_LIMIT_EXCEEDED,23,324
1591002670545047552,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 17:39:30,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"", &n);\n    int arr1[10000] = { 0 };\n    int arr2[10000] = { 0 };\n    for (int i = 0; i < n; ++i)\n    {\n        scanf(\""%d\"", &arr1[i]);\n    }\n    for (int j = 0; j < n; ++j)\n    {\n        scanf(\""%d\"", &arr2[j]);\n    }\n    int max1 = 0, max2 = 0, max3 = 0, count = 0, k = 0;\n    for (k = 0; k < n; ++k)\n    {\n        int sum = arr2[k] - arr1[k];\n        max2 += sum;\n        if (sum <= 0)\n        {\n            if (max3 == 0)\n            {\n                max3 = sum;\n            }\n            if (sum > max3)\n            {\n                max3 = sum;\n            }\n            count++;\n            max2 = 0;\n        }\n        if (max1 < max2)\n        {\n            max1 = max2;\n        }\n    }\n    if (count == n)\n    {\n        printf(\""%d\"", max3);\n    }\n    else\n    {\n        printf(\""%d\"", max1);\n    }\n    return 0;\n}",WRONG_ANSWER,4,344
1591002694460968960,bd8243b4b064cae986196b0eac310a36f12d46dc08f126fbdcaaca530c884eb0,2022-11-11 17:39:36,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\nprintf(\""2022\"");\nreturn 0;\n}\n",ACCEPTED,3,356
1591002694872010752,bf3a58a366e140cd47bc3cd626ad4fef36281f77607e8d02d00a06137309724b,2022-11-11 17:39:36,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n = 0;\n    scanf(\""%d\"", &n);\n    int arr1[10000] = { 0 };\n    int arr2[10000] = { 0 };\n    for (int i = 0; i < n; ++i)\n    {\n        scanf(\""%d\"", &arr1[i]);\n    }\n    for (int j = 0; j < n; ++j)\n    {\n        scanf(\""%d\"", &arr2[j]);\n    }\n    int max1 = 0, max2 = 0, max3 = 0, count = 0, k = 0;\n    for (k = 0; k < n; ++k)\n    {\n        int sum = arr2[k] - arr1[k];\n        max2 += sum;\n        if (sum <= 0)\n        {\n            if (max3 == 0)\n            {\n                max3 = sum;\n            }\n            if (sum > max3)\n            {\n                max3 = sum;\n            }\n            count++;\n            max2 = 0;\n        }\n        if (max1 < max2)\n        {\n            max1 = max2;\n        }\n    }\n    if (count == n)\n    {\n        printf(\""%d\"", max3);\n    }\n    else\n    {\n        printf(\""%d\"", max1);\n    }\n    return 0;\n}",WRONG_ANSWER,3,324
1591002853353762816,505c5b9a1b6d591a815315d95a57743fb98dad691b51421b4de282392fef3f43,2022-11-11 17:40:14,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"a=int(input(\""输入数值范围\""))\nlist_a=[]\nfor i in range(2,a+1):\n    for j in range(2,i):\n        if i%j==0:\n            break\n        else:\n            list_a.append(i)\nset1=set(list_a)\nprint(len(set1))",COMPILE_ERROR,0,0
1591002919372128256,90f977539fbdc1e34f124e4b235fcb84e0ccac7dc5369b3ec22176fb1f6001f9,2022-11-11 17:40:30,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n    int i,max,b,j;\n   scanf(\""%d\"",&b);\n   int a[b],n[b];\n   int c[b][b];\n   for(i=0;i<2;i++)\n    for(j=0;j<b;j++)\n       scanf(\""%d\"",&c[i][j]);\n   for(i=0;i<b;i++)\n     a[i]=c[1][i]-c[0][i];\n   max=0;\n   for(i=0;i<b;i++)\n     n[i]=0;\n     n[0]=a[0];\n   for(i=1;i<b;i++)\n   {\n      if(n[i-1]>0)\n      n[i]=n[i-1]+a[i];\n      else\n        n[i]=a[i];\n      if(n[i]>max)\n        max=n[i];\n\n   }\n     printf(\""%d\"",max);\n}\n",ACCEPTED,4,320
1591003325686919168,0ed66ddb50163bbc5dd43c591bc3d500e68ed69fe23bfebfa6ac827c1dfc1849,2022-11-11 17:42:06,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nmain()\n{\n   int t,i=0,m;\n   scanf(\""%d\"",&t);\n   for(i=0;i<t;i++)\n   {\n       scanf(\""%d\"",&m);\n       if(m==0)\n           printf(\""0\\n\"");\n       else\n           printf(\""6\\n\"");\n   }\n}",WRONG_ANSWER,10,328
1591003453793566720,0ed66ddb50163bbc5dd43c591bc3d500e68ed69fe23bfebfa6ac827c1dfc1849,2022-11-11 17:42:37,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nmain()\n{\n   int t,i=0,m;\n   scanf(\""%d\"",&t);\n   while(i<t)\n   {\n       scanf(\""%d\"",&m);\n       if(m==0)\n           printf(\""0\\n\"");\n       else\n           printf(\""6\\n\"");\n       i++;\n   }\n}",WRONG_ANSWER,11,320
1591003491676520448,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-11 17:42:46,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""25\"");\n    return 0;\n}",WRONG_ANSWER,4,316
1591003495900164096,13616e85f216dd3844293b46f4b46105a0a2c458f7807a7b677858feb35cb63a,2022-11-11 17:42:47,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n   int n,i;\n   scanf(\""%d\"",&n);\n   int a[n],b[n];\n   for(i=0;i<n;i++)\n   {\n       scanf(\""%d\"",&a[i]);\n   }\n    for(i=0;i<n;i++)\n   {\n       scanf(\""%d\"",&b[i]);\n          a[i]=b[i]-a[i];\n   }\n\n   int sum=0,num;\nfor(i=0;i<n;i++)\n{  num=sum;\n    sum=a[i]+sum;\n\n    if(sum>num)\n        num=sum;\n\n}\nprintf(\""%d\"",num);\n\n    return 0;\n}\n",WRONG_ANSWER,3,188
1591003563965329408,e0a829315cc9947a3e714cd579e3322e8dee5f8ca36e30fd276de5a8e294b6f8,2022-11-11 17:43:03,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n    int n;\n    int a[50];\n    int b[50];\n    int i;\n    int x=0,y=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n       scanf(\""%d\"",&a[i]);\n     for(i=0;i<n;i++)\n        {if(a[i]>b[i])\n            {x=a[i]-b[i];\n            y+=x;}\n            }\n    printf(\""%d\"",y);\n    return 0;\n}\n",WRONG_ANSWER,3,188
1591003821868912640,7222c2fb91a71fcf3f6560860557ab564f69a453594c9f1620ecc35bb26f5daf,2022-11-11 17:44:05,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    int max=0,n,i,j;\n    scanf(\""%d\"",&n);\nfor(i=2;i<=n;i++)\n{\n    for(j=2;j<i;j++)\n    {\n       if(i%j!=0)\n       {\n           if(j==i-1)\n           max++;\n       }\n        else break;\n    }\n}\n    printf(\""%d\"",max);\n    return 0;\n}",WRONG_ANSWER,943,272
1591004187142455296,0ed66ddb50163bbc5dd43c591bc3d500e68ed69fe23bfebfa6ac827c1dfc1849,2022-11-11 17:45:32,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nmain()\n{\n   int t,i=0,m;\n   scanf(\""%d\"",&t);\n   while(i<t)\n   {\n       scanf(\""%d\"",&m);\n       if(m==0)\n           printf(\""0\\n\"");\n       else\n           printf(\""6\\n\"");\n       i++;\n   }\n}",WRONG_ANSWER,9,324
1591004195401043968,e0a829315cc9947a3e714cd579e3322e8dee5f8ca36e30fd276de5a8e294b6f8,2022-11-11 17:45:34,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n    int n;\n    int a[50];\n    int b[50];\n    int i;\n    int x=0,y=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n       scanf(\""%d\"",&a[i]);\n     for(i=0;i<n;i++)\n        {if(a[i]>b[i])\n            {x=a[i]-b[i];\n            y+=x;}\n            }\n    printf(\""%d\"",y);\n    return 0;\n}\n",WRONG_ANSWER,3,192
1591004238631731200,0ed66ddb50163bbc5dd43c591bc3d500e68ed69fe23bfebfa6ac827c1dfc1849,2022-11-11 17:45:44,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nmain()\n{\n   int t,i=0,m;\n   scanf(\""%d\"",&t);\n   while(i<t)\n   {\n       scanf(\""%d\"",&m);\n       if(m==0)\n           printf(\""0\\n\"");\n       else\n           printf(\""6\\n\"");\n       i++;\n   }\n}",WRONG_ANSWER,13,336
1591004430672138240,105cc8c0a5a465ab713603b461d92ac587c87767965625687540cd513f7ebb57,2022-11-11 17:46:30,C++,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<bits/stdc++.h>\n#define N 100005\n#define endl '\\n'\n#define int long long\n#define ios ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)\n\n//const int dir[4][2]={-1,0,0,1,1,0,0,-1};\n//const int mod=1e9+7;\nusing namespace std;\n\ninline int read() {\n    char c = getchar(); int num = 0, sign = 1;\n    while(c < '0' || c > '9') {if(c == '-') sign = -1; c = getchar();}\n    while(c >= '0' && c <= '9') num = num * 10 + c - '0', c = getchar();\n    return num * sign;\n}\n\nvoid solve(){\n\tbool vis[N]={0};\n\tint n,count=0;\n\tcin>>n;\n\tfor(int i=2;i<=n;i++)\n\t{\n\t\tif(!vis[i])\n\t\t{\n\t\t\tcount++;\n\t\t\tfor(int j=i*i;j<=n;j+=i)\n\t\t\t{\n\t\t\t\tvis[j]=true;\n\t\t\t}\n\t\t}\n\t\t\n\t}\n\tcout<<count;\n}\n\nsigned main() {\n\tios;\n\tint count=1;\n\t//cin>>count;\n\twhile(count--)\n\t{\n\t\tsolve();\n\t}\n\treturn 0;\n}\n",ACCEPTED,9,588
1591004437752098816,0ed66ddb50163bbc5dd43c591bc3d500e68ed69fe23bfebfa6ac827c1dfc1849,2022-11-11 17:46:32,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nmain()\n{\n   int t,i=0,m;\n   scanf(\""%d\"",&t);\n   while(i<t)\n   {\n       scanf(\""%d\"",&m);\n       if(m==0)\n           printf(\""0\\n\"");\n       else\n           printf(\""6\\n\"");\n       i++;\n   }\n}",WRONG_ANSWER,11,340
1591004526776221696,c0a514c9e1474aa72a7bc7534e168682aaa015cf994f326c18d4505028d52230,2022-11-11 17:46:53,Python,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"n = int(input())\nxh = list(map(eval,input().split()))\nhd = list(map(eval,input().split()))\ndata=[]\nmax=0\nfor i in range(n):\n    s = hd[i]-xh[i]\n    data.append(s)\nfor i in range(n):\n    t=0\n    for j in range(i,n,1):\n        t =t+ data[j]\n        if t>max:\n            max = t\nprint(max)",ACCEPTED,15,2756
1591004758834458624,0ed66ddb50163bbc5dd43c591bc3d500e68ed69fe23bfebfa6ac827c1dfc1849,2022-11-11 17:47:48,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nmain()\n{\n   int t,i=0,m;\n   scanf(\""%d\"",&t);\n   while(i<t)\n   {\n       scanf(\""%d\"",&m);\n       if(m==0)\n           printf(\""0\"");\n       else\n           printf(\""6\"");\n       i++;\n       if(i!=t)\n           printf(\""\\n\"");\n   }\n}",WRONG_ANSWER,8,328
1591004793567510528,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-11 17:47:56,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main()\n{\n   int n[10],m[10]={1,2,3,4,5,6,7,8,9,10},k[10]={10,9,8,7,6,5,4,3,2,1},i,d=0;\n    for(i=0;i<10;i++)\n        n[i]=k[i]-m[i];\n        if(n[i]>0)\n            d+=n[i];\n    else continue;\n    printf(\""%d\"",d);\n    return 0;\n}",COMPILE_ERROR,0,0
1591004823414177792,9ca3f63f61fa4f349009d69e7059514c3a39dbdd5a1f94342c11f4c33ccdceaa,2022-11-11 17:48:03,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"x = int(input())\nc=0\nfor i in range (1,x):\n    b=0\n    for j in range (1,i+1):\n        if (i%j == 0):\n            b = b+1\n        if b == 2:\n            a = 2\n        else :\n            a=0\n    if a == 2:\n        c = c+1\nprint(c)\n\n",TIME_LIMIT_EXCEEDED,1000,3000
1591004869639606272,9ca3f63f61fa4f349009d69e7059514c3a39dbdd5a1f94342c11f4c33ccdceaa,2022-11-11 17:48:15,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"x = int(input())\nc=0\nfor i in range (1,x):\n    b=0\n    for j in range (1,i+1):\n        if (i%j == 0):\n            b = b+1\n        if b == 2:\n            a = 2\n        else :\n            a=0\n    if a == 2:\n        c = c+1\nprint(c)\n\n",TIME_LIMIT_EXCEEDED,1000,2932
1591004894729928704,105cc8c0a5a465ab713603b461d92ac587c87767965625687540cd513f7ebb57,2022-11-11 17:48:21,C++,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<bits/stdc++.h>\n#define N 10005\n#define endl '\\n'\n#define int long long\n#define ios ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)\n\n//const int dir[4][2]={-1,0,0,1,1,0,0,-1};\n//const int mod=1e9+7;\nusing namespace std;\n\ninline int read() {\n    char c = getchar(); int num = 0, sign = 1;\n    while(c < '0' || c > '9') {if(c == '-') sign = -1; c = getchar();}\n    while(c >= '0' && c <= '9') num = num * 10 + c - '0', c = getchar();\n    return num * sign;\n}\n\nvoid solve(){\n\tcout<<\""2022\"";\n}\n\nsigned main() {\n\tios;\n\tint count=1;\n\t//cin>>count;\n\twhile(count--)\n\t{\n\t\tsolve();\n\t}\n\treturn 0;\n}\n",ACCEPTED,4,452
1591005176704577536,0ed66ddb50163bbc5dd43c591bc3d500e68ed69fe23bfebfa6ac827c1dfc1849,2022-11-11 17:49:28,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nmain()\n{\n   int t,i=0,m;\n   scanf(\""%d\"",&t);\n   while(i<t)\n   {\n       scanf(\""%d\"",&m);\n       if(m==0)\n           printf(\""1\"");\n       else\n           printf(\""6\"");\n       i++;\n       if(i!=t)\n           printf(\""\\n\"");\n   }\n}",ACCEPTED,13,364
1591005336641798144,105cc8c0a5a465ab713603b461d92ac587c87767965625687540cd513f7ebb57,2022-11-11 17:50:06,C++,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<bits/stdc++.h>\n#define N 10005\n#define endl '\\n'\n#define int long long\n#define ios ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)\n\n//const int dir[4][2]={-1,0,0,1,1,0,0,-1};\n//const int mod=1e9+7;\nusing namespace std;\n\ninline int read() {\n    char c = getchar(); int num = 0, sign = 1;\n    while(c < '0' || c > '9') {if(c == '-') sign = -1; c = getchar();}\n    while(c >= '0' && c <= '9') num = num * 10 + c - '0', c = getchar();\n    return num * sign;\n}\n\nvoid solve(){\n\tint x,y,z;\n\tcin>>x>>y>>z;\n\tcout<<x+y-z;\n}\n\nsigned main() {\n\tios;\n\tint count=1;\n\t//cin>>count;\n\twhile(count--)\n\t{\n\t\tsolve();\n\t}\n\treturn 0;\n}\n",ACCEPTED,6,444
1591005412130885632,c0e68e897a4e17055cdec0628b1c0c28905f58f551aeb1542ebc41714f2e95ad,2022-11-11 17:50:24,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main()\n{\n   int n[10],m[10]={1,2,3,4,5,6,7,8,9,10},k[10]={10,9,8,7,6,5,4,3,2,1},i,d=0;\n    for(i=0;i<10;i++)\n    {n[i]=k[i]-m[i];\n        if(n[i]>0)\n            d+=n[i];}\n    printf(\""%d\"",d);\n    return 0;\n}",WRONG_ANSWER,3,352
1591005754746802176,a2fa7eb1ab1c2f6fa23517852ee6971ea32fd0c7742d71d7914ed729415f04d9,2022-11-11 17:51:46,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main(){\n\tint n,num=0;\n\tcin>>n;\n\tint a[n+1]={},b[n+1]={};\n\tfor(int i=1;i<=n;i++)\n\t    cin>>a[i];\n\tfor(int i=1;i<=n;i++)\n\t    cin>>b[i];\n\tfor(int j=1;j<=n;j++)\n\t{\n\t\tif(b[j]-a[j]>0)\n\t        num=num+b[j]-a[j]; \n\t}    \n\tcout<<num;\n\t\t    \n\t return 0;   \n\t\n}",WRONG_ANSWER,4,448
1591005795062452224,05322c7db848fe3ffcd527251ab80da608e98289cd6d6511d7c6e8436c4fdaf2,2022-11-11 17:51:55,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}\n",ACCEPTED,3,196
1591005836342792192,f55f4c0e0e3367434e26a462e3665271f5b4141ea3de4f34d96fdb21d67e2a7c,2022-11-11 17:52:05,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int w;\n    w=2022;\n    printf(\""%d\"",w);\n\n\n\n    return 0;\n}\n",ACCEPTED,4,312
1591005962721341440,63ac3739e16bf85bdb1d10f9e976a13c16e604db365bd14af74be9b153063c59,2022-11-11 17:52:35,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        System.out.println(2022)\n        }\n    }\n},COMPILE_ERROR,0,0
1591006071609667584,63ac3739e16bf85bdb1d10f9e976a13c16e604db365bd14af74be9b153063c59,2022-11-11 17:53:01,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        System.out.println(2022)\n        }\n    },COMPILE_ERROR,0,0
1591006103289270272,63ac3739e16bf85bdb1d10f9e976a13c16e604db365bd14af74be9b153063c59,2022-11-11 17:53:09,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,\n\npublic class Main {\n    public static void main(String[] args) {\n        System.out.println(2022)\n        }\n    },COMPILE_ERROR,0,0
1591006134314532864,63ac3739e16bf85bdb1d10f9e976a13c16e604db365bd14af74be9b153063c59,2022-11-11 17:53:16,Java,300.0,1590528927448293376,1590525945717575680,1049226928954454016,\n\npublic class Main {\n    public static void main(String[] args) {\n        System.out.println(2022);\n        }\n    },ACCEPTED,72,14044
1591006289751244800,e0a829315cc9947a3e714cd579e3322e8dee5f8ca36e30fd276de5a8e294b6f8,2022-11-11 17:53:53,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n int n;\n int i,x,y;\n if(scanf(\""%d\\n\"",&n));\n for(i=0;i<n;i++)\n    {if(scanf(\""%d\"",&x));\n    y=pow(6,x);}\n    for(i=0;i<n;i++)\n    printf(\""%d\\n\"",y%10);\n    return 0;\n}\n",WRONG_ANSWER,6,324
1591006292347523072,bfa0c0bcc65d8897d0c2c02aca0551bb9d09a104f2a47146ed4f339ce57cd965,2022-11-11 17:53:54,Python,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"a,b,c = [int(x) for x in input().split(\"" \"")]\nprint(a+b-c)",ACCEPTED,31,2820
1591006341135663104,542d97133043a1f2156354473a31382c35bb2836688b0ed76eae59c52a2e0e3a,2022-11-11 17:54:05,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int m,n;\n    int a[n];\n    scanf(\""%d\"",&n);\n    for(m=0;m<n;m++)\n    {\n        scanf(\""%d\"",&a[m]);\n        printf(\""6\\n\"");\n    }\n\n    return 0;\n}\n",WRONG_ANSWER,9,196
1591006347523588096,bfa0c0bcc65d8897d0c2c02aca0551bb9d09a104f2a47146ed4f339ce57cd965,2022-11-11 17:54:07,Python,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"x = int(input())\ny = input().split(\"" \"")\nfor i in range(x):\n    if y[i] == \""0\"":\n        print (1)\n    else:\n        print (6)\n",ACCEPTED,50,2884
1591006348668637184,e0a829315cc9947a3e714cd579e3322e8dee5f8ca36e30fd276de5a8e294b6f8,2022-11-11 17:54:07,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n int n;\n int i,x,y;\n scanf(\""%d\\n\"",&n);\n for(i=0;i<n;i++)\n    {scanf(\""%d\"",&x);\n    y=pow(6,x);}\n    for(i=0;i<n;i++)\n    printf(\""%d\\n\"",y%10);\n    return 0;\n}\n",WRONG_ANSWER,7,564
1591006572954845184,bfa0c0bcc65d8897d0c2c02aca0551bb9d09a104f2a47146ed4f339ce57cd965,2022-11-11 17:55:01,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,print(2022),ACCEPTED,14,2744
1591006627438858240,63ac3739e16bf85bdb1d10f9e976a13c16e604db365bd14af74be9b153063c59,2022-11-11 17:55:14,Java,300.0,1590524835191705600,1572865591226855424,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner in = new Scanner(System.in);\n        \n            int X = in.nextInt();\n            int Y = in.nextInt();\n            int Z = in.nextInt();\n        System.out.println(X + Y -Z);\n    }\n},ACCEPTED,251,16376
1591006668991823872,b73a04f1a7af1c2516ca68b38e336912bdf10c4f4bf7bac55e4e0de29dcf3d9d,2022-11-11 17:55:24,C++,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<bits/stdc++.h>\n#define N 100005\n#define endl '\\n'\n#define int long long\n#define ios ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)\n\n//const int dir[4][2]={-1,0,0,1,1,0,0,-1};\n//const int mod=1e9+7;\nusing namespace std;\n\ninline int read() {\n    char c = getchar(); int num = 0, sign = 1;\n    while(c < '0' || c > '9') {if(c == '-') sign = -1; c = getchar();}\n    while(c >= '0' && c <= '9') num = num * 10 + c - '0', c = getchar();\n    return num * sign;\n}\n\nvoid solve(){\n\tbool vis[N]={0};\n\tint n,count=0;\n\tcin>>n;\n\tfor(int i=2;i<=n;i++)\n\t{\n\t\tif(!vis[i])\n\t\t{\n\t\t\tcount++;\n\t\t\tfor(int j=i*i;j<=n;j+=i)\n\t\t\t{\n\t\t\t\tvis[j]=true;\n\t\t\t}\n\t\t}\n\t\t\n\t}\n\tcout<<count;\n}\n\nsigned main() {\n\tios;\n\tint count=1;\n\t//cin>>count;\n\twhile(count--)\n\t{\n\t\tsolve();\n\t}\n\treturn 0;\n}\n",ACCEPTED,7,444
1591006923296673792,33066437ddee11f609c900fe8dbd59cb8113e4d8dfd13c1812f199f4f3fdd334,2022-11-11 17:56:24,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n\nint main()\n{\n    int n;\n    int i,j,flag;\n    int k=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n    {\n        flag=1;\n        for(j=2;j*j<=i;j++)\n        {\n            if(i%j==0)\n            {\n                flag=0;\n                break;\n            }\n        }\n        if(flag==1)\n           {\n             k++;\n           }\n    }\n    printf(\""%d\"",k);\n    return 0;\n}",ACCEPTED,14,184
1591006966187622400,7dd0c628805d8a6777ff5cc70a5ec79db9475f660782b2f4289ae98977303581,2022-11-11 17:56:34,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",WRONG_ANSWER,4,344
1591006979240296448,105cc8c0a5a465ab713603b461d92ac587c87767965625687540cd513f7ebb57,2022-11-11 17:56:37,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<bits/stdc++.h>\n#define N 10005\n#define endl '\\n'\n#define int long long\n#define ios ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)\n\n//const int dir[4][2]={-1,0,0,1,1,0,0,-1};\n//const int mod=1e9+7;\nusing namespace std;\n\ninline int read() {\n    char c = getchar(); int num = 0, sign = 1;\n    while(c < '0' || c > '9') {if(c == '-') sign = -1; c = getchar();}\n    while(c >= '0' && c <= '9') num = num * 10 + c - '0', c = getchar();\n    return num * sign;\n}\n\nvoid solve(){\n\tint n;\n\tcin>>n;\n\tif(n==0)\n\t\tcout<<1<<endl;\n\telse\n\t\tcout<<6<<endl;\n}\n\nsigned main() {\n\tios;\n\tint count;\n\tcin>>count;\n\twhile(count--)\n\t{\n\t\tsolve();\n\t}\n\treturn 0;\n}\n",ACCEPTED,12,704
1591007000077602816,7dd0c628805d8a6777ff5cc70a5ec79db9475f660782b2f4289ae98977303581,2022-11-11 17:56:42,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",WRONG_ANSWER,4,308
1591007092792688640,7d46013a6da090b69b62e7be93e7628aee2f7eef31af37777b9ccf1fd1d3eb2e,2022-11-11 17:57:05,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h> \nint main()\n{\n\tint n,i,j,k,m=0;\n\tscanf(\""%d\"",&n);\n\tfor(i=2;i<=n;i++)\n\t\t{\n\t\tk=1;\n\t\tfor(j=2;j<=k;j++)\n\t\t\tif(i%j==0){\n                k=0;\n                break;\n            }\n\t\t\tif(f==1)\n\t\t\tm++; \n\t\t}\n    printf(\""%d\"",m);\n\t\treturn 0;\n}",COMPILE_ERROR,0,0
1591007094201974784,7dd0c628805d8a6777ff5cc70a5ec79db9475f660782b2f4289ae98977303581,2022-11-11 17:57:05,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int t = 0;\n    scanf(\""%d\"",&t);\n    while(t--)\n    {\n        int n = 0;\n        scanf(\""%d\"",&n);\n        if(n == 0)\n        {\n            printf(\""1\\n\"");\n        }\n        else\n        {\n            printf(\""6\\n\"");\n        }\n    }\n    return 0;\n}",ACCEPTED,9,320
1591007316856582144,542d97133043a1f2156354473a31382c35bb2836688b0ed76eae59c52a2e0e3a,2022-11-11 17:57:58,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int m,n,o;\n    scanf(\""%d\"",&n);\n    for(m=0;m<n;m++)\n    {\n        scanf(\""%d\"",&o);\n        printf(\""6\\n\"");\n    }\n\n    return 0;\n}\n",WRONG_ANSWER,9,324
1591007329045254144,1019ea4e8e67338c8191b6e52878cb69ca9287130af71af3517596fded2f21e4,2022-11-11 17:58:01,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int t,j;\n\n    scanf(\""%d\"",&t);\n    int a[t];\n    while(a[t]>=0&&a[t]<=100000000)\n     {\n      for(j=0;j<t;j++)\n        {\n           scanf(\""%d\"",&a[j]);\n\n        printf(\""6\\n\"",a[j]);\n        }\n     }\n   return 0;\n}\n\n\n\n",TIME_LIMIT_EXCEEDED,20,384
1591007411983421440,542d97133043a1f2156354473a31382c35bb2836688b0ed76eae59c52a2e0e3a,2022-11-11 17:58:21,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int m,n,o;\n    scanf(\""%d\"",&n);\n    for(m=0;m<n;m++)\n    {\n        scanf(\""%d\"",&o);\n        printf(\""6\\n\"");\n    }\n\n    return 0;\n}\n",WRONG_ANSWER,7,196
1591007555265040384,542d97133043a1f2156354473a31382c35bb2836688b0ed76eae59c52a2e0e3a,2022-11-11 17:58:55,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int m,n=0,o;\n    scanf(\""%d\"",&n);\n    for(m=0;m<n;m++)\n    {\n        scanf(\""%d\"",&o);\n        printf(\""6\\n\"");\n    }\n\n    return 0;\n}\n",WRONG_ANSWER,13,328
1591007727869014016,33066437ddee11f609c900fe8dbd59cb8113e4d8dfd13c1812f199f4f3fdd334,2022-11-11 17:59:36,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,t,x;\n    scanf(\""%d\"",&t);\n    for(i=1;i<=t;i++)\n    {\n        scanf(\""%d\"",&x);\n        if(x<1)printf(\""1\"");\n        else printf(\""6\"");\n        if(i<t) printf(\""\\n\"");\n    }\n    return 0;\n}\n",WRONG_ANSWER,6,640
1591007783938494464,505c5b9a1b6d591a815315d95a57743fb98dad691b51421b4de282392fef3f43,2022-11-11 17:59:49,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,list_num=[]\na=int(input())\ni=2\nwhile i<a:\n    j=2\n    while j<=i:\n        if i==j:\n            list_num.append(i)\n        if i%j==0:\n            break\n        j+=1\n    i+=1\nprint(len(list_num)),COMPILE_ERROR,0,0
1591007801588121600,7d46013a6da090b69b62e7be93e7628aee2f7eef31af37777b9ccf1fd1d3eb2e,2022-11-11 17:59:54,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h> \nint main()\n{\n\tint n,i,j,f,k=0;\n\tscanf(\""%d\"",&n);\n\tfor(i=2;i<=n;i++)\n\t\t{\n\t\t f=1;\n\t\t for(j=2;j<i;j++)\n\t\t\tif(i%j==0){\n                f=0;\n                break;\n            }\n\t\t\tif(f==1)\n\t\t\t    k++; \n\t\t}\n    printf(\""%d\"",k);\n\t\treturn 0;\n}",ACCEPTED,921,184
1591007828444229632,505c5b9a1b6d591a815315d95a57743fb98dad691b51421b4de282392fef3f43,2022-11-11 18:00:00,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,list_num=[]\na=int(input())\ni=2\nwhile i<a:\n    j=2\n    while j<=i:\n        if i==j:\n            list_num.append(i)\n        if i%j==0:\n            break\n        j+=1\n    i+=1\nprint(len(list_num)),TIME_LIMIT_EXCEEDED,1000,2984
1591007897532825600,07d925df8d2026d3171a0a2ca84a6ef7f4a5b47a584cf47b66c5dd8f28139d1f,2022-11-11 18:00:16,Python,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"X,Y,Z=map(eval,input().split())\nA=X+Y-Z\nprint(A)\n",ACCEPTED,33,3008
1591007973541982208,03f9d7a6fc27d141b8243d1b2b44a3276cdd4750b5c2621d6d8c006b64ca6514,2022-11-11 18:00:35,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint n,a,i=0;\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a);\n\t\tif(a>0){\n\t\t\tprintf(\""6\"");\n            printf(\""\\n\"");\n\t\t\t}else if(a==0){ \n\t\t\t\tprintf(\""1\"");\n                printf(\""\\n\"");\n\t\t\t}\n\t\t}\n\treturn 0;\n}",WRONG_ANSWER,6,344
1591008004646940672,63bdcc3416dd0c07c03f833ffb02c2f304a4f523deae6a87bed24a730e4d224d,2022-11-11 18:00:42,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,printf(2022);,COMPILE_ERROR,0,0
1591008034304884736,542d97133043a1f2156354473a31382c35bb2836688b0ed76eae59c52a2e0e3a,2022-11-11 18:00:49,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int m,n,o;\n    if(scanf(\""%d\"",&n))\n    {\n        for(m=0;m<n;m++)\n        {\n            if(scanf(\""%d\"",&o))\n            {\n                printf(\""6\\n\"");\n            }\n\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,9,360
1591008133382713344,05322c7db848fe3ffcd527251ab80da608e98289cd6d6511d7c6e8436c4fdaf2,2022-11-11 18:01:13,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n    return 0;\n}\n",ACCEPTED,6,352
1591008406251548672,542d97133043a1f2156354473a31382c35bb2836688b0ed76eae59c52a2e0e3a,2022-11-11 18:02:18,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int m,n,o;\n    if(scanf(\""%d\"",&n))\n    {\n        for(m=0;m<n;m++)\n        {\n            printf(\""6\\n\"");\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,11,336
1591008461591220224,542d97133043a1f2156354473a31382c35bb2836688b0ed76eae59c52a2e0e3a,2022-11-11 18:02:31,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int m,n;\n    if(scanf(\""%d\"",&n))\n    {\n        for(m=0;m<n;m++)\n        {\n            printf(\""6\\n\"");\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,9,328
1591008473553371136,63bdcc3416dd0c07c03f833ffb02c2f304a4f523deae6a87bed24a730e4d224d,2022-11-11 18:02:34,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,#include<stdio.h>\n int main()\n {\n     \n     printf(2022);\n     \n     \n     return 0;\n },SEGMENTATION_FAULT,3,332
1591008563949015040,63ac3739e16bf85bdb1d10f9e976a13c16e604db365bd14af74be9b153063c59,2022-11-11 18:02:55,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"/**\n * 场景：输出101~200之间的所有素数\n * 1、遍历该区间内所有数据\n * 2、判断该数据是否是素数\n * 3、根据判定结果输出素数\n */\npublic class test {\n    public static void main(String[] args) {\n        Scanner in = new Scanner(System.in);\n        int N = in.nextInt\n        //定义循环，找到101~200之间的所有数据\n        for (int m = 1; m <= N; m++) {\n            //设置flag = true，默认i为素数\n            boolean flag = true;\n            //m同定义中的范围，取值为[2, m-1]，判断当前遍历的数据是否是素数\n            for (int n = 2; n < m - 1; n++) {\n                if(m % n == 0){   //若m能被n整除，则意味着m不是素数\n                //当前数不是素数，则flag的值更改为false\n                    flag = false;   \n                    break;  //跳出当前循环\n                }\n            }\n            //根据flag的结果，判断m是否是素数，如果是（flag == true），则输出\n            if (flag){\n                System.out.print(m + \"" \"");\n            }\n\n        }\n    }\n}\n",COMPILE_ERROR,0,0
1591008596459040768,63ac3739e16bf85bdb1d10f9e976a13c16e604db365bd14af74be9b153063c59,2022-11-11 18:03:03,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"/**\n * 场景：输出101~200之间的所有素数\n * 1、遍历该区间内所有数据\n * 2、判断该数据是否是素数\n * 3、根据判定结果输出素数\n */\npublic class test {\n    public static void main(String[] args) {\n        Scanner in = new Scanner(System.in);\n        int N = in.nextInt;\n        //定义循环，找到101~200之间的所有数据\n        for (int m = 1; m <= N; m++) {\n            //设置flag = true，默认i为素数\n            boolean flag = true;\n            //m同定义中的范围，取值为[2, m-1]，判断当前遍历的数据是否是素数\n            for (int n = 2; n < m - 1; n++) {\n                if(m % n == 0){   //若m能被n整除，则意味着m不是素数\n                //当前数不是素数，则flag的值更改为false\n                    flag = false;   \n                    break;  //跳出当前循环\n                }\n            }\n            //根据flag的结果，判断m是否是素数，如果是（flag == true），则输出\n            if (flag){\n                System.out.print(m + \"" \"");\n            }\n\n        }\n    }\n}\n",COMPILE_ERROR,0,0
1591008603119595520,63bdcc3416dd0c07c03f833ffb02c2f304a4f523deae6a87bed24a730e4d224d,2022-11-11 18:03:05,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\n int main()\n {\n     \n     printf(\""2022\"");\n     \n     \n     return 0;\n }",ACCEPTED,3,320
1591008630059610112,63bdcc3416dd0c07c03f833ffb02c2f304a4f523deae6a87bed24a730e4d224d,2022-11-11 18:03:11,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\n int main()\n {\n     \n     printf(\""2022\"");\n     \n     \n     return 0;\n }",ACCEPTED,4,316
1591008660388646912,63ac3739e16bf85bdb1d10f9e976a13c16e604db365bd14af74be9b153063c59,2022-11-11 18:03:18,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"/**\n * 场景：输出101~200之间的所有素数\n * 1、遍历该区间内所有数据\n * 2、判断该数据是否是素数\n * 3、根据判定结果输出素数\n */\npublic class main {\n    public static void main(String[] args) {\n        Scanner in = new Scanner(System.in);\n        int N = in.nextInt;\n        //定义循环，找到101~200之间的所有数据\n        for (int m = 1; m <= N; m++) {\n            //设置flag = true，默认i为素数\n            boolean flag = true;\n            //m同定义中的范围，取值为[2, m-1]，判断当前遍历的数据是否是素数\n            for (int n = 2; n < m - 1; n++) {\n                if(m % n == 0){   //若m能被n整除，则意味着m不是素数\n                //当前数不是素数，则flag的值更改为false\n                    flag = false;   \n                    break;  //跳出当前循环\n                }\n            }\n            //根据flag的结果，判断m是否是素数，如果是（flag == true），则输出\n            if (flag){\n                System.out.print(m + \"" \"");\n            }\n\n        }\n    }\n}\n",COMPILE_ERROR,0,0
1591008661231702016,63ac3739e16bf85bdb1d10f9e976a13c16e604db365bd14af74be9b153063c59,2022-11-11 18:03:19,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"/**\n * 场景：输出101~200之间的所有素数\n * 1、遍历该区间内所有数据\n * 2、判断该数据是否是素数\n * 3、根据判定结果输出素数\n */\npublic class main {\n    public static void main(String[] args) {\n        Scanner in = new Scanner(System.in);\n        int N = in.nextInt;\n        //定义循环，找到101~200之间的所有数据\n        for (int m = 1; m <= N; m++) {\n            //设置flag = true，默认i为素数\n            boolean flag = true;\n            //m同定义中的范围，取值为[2, m-1]，判断当前遍历的数据是否是素数\n            for (int n = 2; n < m - 1; n++) {\n                if(m % n == 0){   //若m能被n整除，则意味着m不是素数\n                //当前数不是素数，则flag的值更改为false\n                    flag = false;   \n                    break;  //跳出当前循环\n                }\n            }\n            //根据flag的结果，判断m是否是素数，如果是（flag == true），则输出\n            if (flag){\n                System.out.print(m + \"" \"");\n            }\n\n        }\n    }\n}\n",COMPILE_ERROR,0,0
1591008667850289152,03f9d7a6fc27d141b8243d1b2b44a3276cdd4750b5c2621d6d8c006b64ca6514,2022-11-11 18:03:20,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint n,a,i=0;\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a);\n\t\tif(a>0){\n\t\t\tprintf(\""6\"");\n\t\t\t}else if(a==0){ \n\t\t\t\tprintf(\""1\"");\n                printf(\""\\n\"");\n\t\t\t}\n\t\t}\n\treturn 0;\n}",WRONG_ANSWER,6,184
1591008710376361984,63ac3739e16bf85bdb1d10f9e976a13c16e604db365bd14af74be9b153063c59,2022-11-11 18:03:30,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"/**\n * 场景：输出101~200之间的所有素数\n * 1、遍历该区间内所有数据\n * 2、判断该数据是否是素数\n * 3、根据判定结果输出素数\n */\npublic class Main {\n    public static void main(String[] args) {\n        Scanner in = new Scanner(System.in);\n        int N = in.nextInt;\n        //定义循环，找到101~200之间的所有数据\n        for (int m = 1; m <= N; m++) {\n            //设置flag = true，默认i为素数\n            boolean flag = true;\n            //m同定义中的范围，取值为[2, m-1]，判断当前遍历的数据是否是素数\n            for (int n = 2; n < m - 1; n++) {\n                if(m % n == 0){   //若m能被n整除，则意味着m不是素数\n                //当前数不是素数，则flag的值更改为false\n                    flag = false;   \n                    break;  //跳出当前循环\n                }\n            }\n            //根据flag的结果，判断m是否是素数，如果是（flag == true），则输出\n            if (flag){\n                System.out.print(m + \"" \"");\n            }\n\n        }\n    }\n}\n",COMPILE_ERROR,0,0
1591008726243389440,03f9d7a6fc27d141b8243d1b2b44a3276cdd4750b5c2621d6d8c006b64ca6514,2022-11-11 18:03:34,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint n,a,i=0;\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a);\n\t\tif(a>0){\n\t\t\tprintf(\""6\"");\n\t\t\t}else if(a==0)\n\t\t\t\tprintf(\""1\"");\n            printf(\""\\n\"");\n\t\t}\n\treturn 0;\n}",WRONG_ANSWER,8,312
1591008772238127104,542d97133043a1f2156354473a31382c35bb2836688b0ed76eae59c52a2e0e3a,2022-11-11 18:03:45,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int m,n;\n    scanf(\""%d\"",&n)；\n    for(m=0;m<n;m++)\n    {\n       printf(\""6\\n\"");\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1591008838378106880,63ac3739e16bf85bdb1d10f9e976a13c16e604db365bd14af74be9b153063c59,2022-11-11 18:04:01,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"/**\n * 场景：输出101~200之间的所有素数\n * 1、遍历该区间内所有数据\n * 2、判断该数据是否是素数\n * 3、根据判定结果输出素数\n */\nimport Scanner;\npublic class Main {\n    \n    public static void main(String[] args) {\n        Scanner in = new Scanner(System.in);\n        int N = in.nextInt;\n        //定义循环，找到101~200之间的所有数据\n        for (int m = 1; m <= N; m++) {\n            //设置flag = true，默认i为素数\n            boolean flag = true;\n            //m同定义中的范围，取值为[2, m-1]，判断当前遍历的数据是否是素数\n            for (int n = 2; n < m - 1; n++) {\n                if(m % n == 0){   //若m能被n整除，则意味着m不是素数\n                //当前数不是素数，则flag的值更改为false\n                    flag = false;   \n                    break;  //跳出当前循环\n                }\n            }\n            //根据flag的结果，判断m是否是素数，如果是（flag == true），则输出\n            if (flag){\n                System.out.print(m + \"" \"");\n            }\n\n        }\n    }\n}\n",COMPILE_ERROR,0,0
1591008902731337728,542d97133043a1f2156354473a31382c35bb2836688b0ed76eae59c52a2e0e3a,2022-11-11 18:04:16,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int m,n;\n    scanf(\""%d\"",&n);\n    for(m=0;m<n;m++)\n    {\n       printf(\""6\\n\"");\n    }\n    return 0;\n}\n",WRONG_ANSWER,11,312
1591009018129199104,63ac3739e16bf85bdb1d10f9e976a13c16e604db365bd14af74be9b153063c59,2022-11-11 18:04:44,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"/**\n * 场景：输出101~200之间的所有素数\n * 1、遍历该区间内所有数据\n * 2、判断该数据是否是素数\n * 3、根据判定结果输出素数\n */\nimport java.util.*;\npublic class Main {\n    \n    public static void main(String[] args) {\n        Scanner in = new Scanner(System.in);\n        int N = in.nextInt;\n        //定义循环，找到101~200之间的所有数据\n        for (int m = 1; m <= N; m++) {\n            //设置flag = true，默认i为素数\n            boolean flag = true;\n            //m同定义中的范围，取值为[2, m-1]，判断当前遍历的数据是否是素数\n            for (int n = 2; n < m - 1; n++) {\n                if(m % n == 0){   //若m能被n整除，则意味着m不是素数\n                //当前数不是素数，则flag的值更改为false\n                    flag = false;   \n                    break;  //跳出当前循环\n                }\n            }\n            //根据flag的结果，判断m是否是素数，如果是（flag == true），则输出\n            if (flag){\n                System.out.print(m + \"" \"");\n            }\n\n        }\n    }\n}\n",COMPILE_ERROR,0,0
1591009054451871744,24daa7a58808ceb95b2ed2e23721ea7b987a061e19ca5fee0ee2d0f93c78507f,2022-11-11 18:04:52,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n;\n    int i,f,j;\n    int k=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n    {\n        f=1;\n        for(j=2;j<i;j++)\n        if(i%j==0){\n            f=0;\n            break;\n        }\n        if(f==1)\n            k++;\n    }\n    printf(\""%d\"",k);\n    return 0;\n}\n",ACCEPTED,934,312
1591009060755910656,63ac3739e16bf85bdb1d10f9e976a13c16e604db365bd14af74be9b153063c59,2022-11-11 18:04:54,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"/**\n * 场景：输出101~200之间的所有素数\n * 1、遍历该区间内所有数据\n * 2、判断该数据是否是素数\n * 3、根据判定结果输出素数\n */\nimport java.util.*;\npublic class Main {\n    \n    public static void main(String[] args) {\n        Scanner in = new Scanner(System.in);\n        int N = in.NextInt;\n        //定义循环，找到101~200之间的所有数据\n        for (int m = 1; m <= N; m++) {\n            //设置flag = true，默认i为素数\n            boolean flag = true;\n            //m同定义中的范围，取值为[2, m-1]，判断当前遍历的数据是否是素数\n            for (int n = 2; n < m - 1; n++) {\n                if(m % n == 0){   //若m能被n整除，则意味着m不是素数\n                //当前数不是素数，则flag的值更改为false\n                    flag = false;   \n                    break;  //跳出当前循环\n                }\n            }\n            //根据flag的结果，判断m是否是素数，如果是（flag == true），则输出\n            if (flag){\n                System.out.print(m + \"" \"");\n            }\n\n        }\n    }\n}\n",COMPILE_ERROR,0,0
1591009113562198016,63ac3739e16bf85bdb1d10f9e976a13c16e604db365bd14af74be9b153063c59,2022-11-11 18:05:06,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"/**\n * 场景：输出101~200之间的所有素数\n * 1、遍历该区间内所有数据\n * 2、判断该数据是否是素数\n * 3、根据判定结果输出素数\n */\nimport java.util.*;\npublic class Main {\n    \n    public static void main(String[] args) {\n        Scanner in = new Scanner(System.in);\n        int N = in.nextInt();\n        //定义循环，找到101~200之间的所有数据\n        for (int m = 1; m <= N; m++) {\n            //设置flag = true，默认i为素数\n            boolean flag = true;\n            //m同定义中的范围，取值为[2, m-1]，判断当前遍历的数据是否是素数\n            for (int n = 2; n < m - 1; n++) {\n                if(m % n == 0){   //若m能被n整除，则意味着m不是素数\n                //当前数不是素数，则flag的值更改为false\n                    flag = false;   \n                    break;  //跳出当前循环\n                }\n            }\n            //根据flag的结果，判断m是否是素数，如果是（flag == true），则输出\n            if (flag){\n                System.out.print(m + \"" \"");\n            }\n\n        }\n    }\n}\n",TIME_LIMIT_EXCEEDED,1000,22816
1591009187591688192,03f9d7a6fc27d141b8243d1b2b44a3276cdd4750b5c2621d6d8c006b64ca6514,2022-11-11 18:05:24,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint n,a,i=0;\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a);\n\t\tif(a==0)\n\t\t\tprintf(\""1\"");\n\t\telse\n\t\t\tprintf(\""6\"");\n         printf(\""\\n\"");\n\t\t}\n\treturn 0;\n}",ACCEPTED,8,344
1591009201801990144,902d8082eea06043d392298983db4630cde4418ac8ee42282d537bfaae045c2f,2022-11-11 18:05:27,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"d=0\na=eval(input())\nb=input().split(\"" \"")\nc=input().split(\"" \"")\nmax=int(c[0])-int(b[0])\nfor i in range(a):\n    d +=(int(c[i])-int(b[i]))\n    if d>max:\n        max=d\nprint(max)",WRONG_ANSWER,16,2892
1591009462167605248,ef50cfe7f34b26d29f617c97ac65d40bd15ba1e063897a190284243de955e254,2022-11-11 18:06:29,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,import java.util.Calendar;\npublic class t {\n\tpublic static void main(String[] args){\n\t    Calendar date=Calendar.getInstance();\n\t    String year=String.valueOf(date.get(Calendar.YEAR));\n\t    System.out.print(year);\n\t}\n\t\n},COMPILE_ERROR,0,0
1591009499123613696,a57fdafe4877cd9608fc0ac8a5120a47bc60a015785960e61b67b4e66187c2f2,2022-11-11 18:06:38,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int i,n,j,num=0,k;\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++){\n        k=(int)sqrt(i);\n        for(j=2;j<=k;j++){\n            if(i%j==0)\n                break;\n        }\n    if(j>k)\n        num++;\n    }\n    printf(\""%d\"",num);\n    return 0;\n}\n",WRONG_ANSWER,11,312
1591009718947090432,542d97133043a1f2156354473a31382c35bb2836688b0ed76eae59c52a2e0e3a,2022-11-11 18:07:31,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int m,n;\n    scanf(\""%d\"",&n);\n    for(m=0;m<n;m++)\n    {\n       printf(\""6\\n\"");\n    }\n    return 0;\n}\n",WRONG_ANSWER,9,316
1591009852216901632,0ed66ddb50163bbc5dd43c591bc3d500e68ed69fe23bfebfa6ac827c1dfc1849,2022-11-11 18:08:02,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n\nvoid is_primer(int x,int y){\n    int i=2,k;\n    int sum=0;\n    for(x=2;x<=y;x++){\n        k=0;\n        if(x==2){\n            sum++;\n            continue;\n                }\n        for(i=2;i<x;i++){\n            if(x%i==0)\n            {\n                k=1;\n                break;\n            }}\n            if(k==0)\n            {\n               sum++;\n            }\n            \n    }\n    printf(\""%d\"",sum);\n}\n\nint main()\n\n{\n    int n;\n    scanf(\""%d\"",&n);\n    is_primer(2,n);\n    return 0;\n}",ACCEPTED,935,316
1591009922857349120,b73a04f1a7af1c2516ca68b38e336912bdf10c4f4bf7bac55e4e0de29dcf3d9d,2022-11-11 18:08:19,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<bits/stdc++.h>\n#define N 10005\n#define endl '\\n'\n#define int long long\n#define ios ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)\n\n//const int dir[4][2]={-1,0,0,1,1,0,0,-1};\n//const int mod=1e9+7;\nusing namespace std;\n\ninline int read() {\n    char c = getchar(); int num = 0, sign = 1;\n    while(c < '0' || c > '9') {if(c == '-') sign = -1; c = getchar();}\n    while(c >= '0' && c <= '9') num = num * 10 + c - '0', c = getchar();\n    return num * sign;\n}\n\nvoid solve(){\n\tint n;\n\tcin>>n;\n\tif(n==0)\n\t\tcout<<1<<endl;\n\telse\n\t\tcout<<6<<endl;\n}\n\nsigned main() {\n\tios;\n\tint count;\n\tcin>>count;\n\twhile(count--)\n\t{\n\t\tsolve();\n\t}\n\treturn 0;\n}\n",ACCEPTED,13,308
1591009986577235968,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-11-11 18:08:34,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"t=int(input())\nn=list(map(int,input().split(' ')))\nfor i in range(0,len(n)):\n   print(pow(6,n[i])%10)",TIME_LIMIT_EXCEEDED,165,4136
1591010130362150912,1019ea4e8e67338c8191b6e52878cb69ca9287130af71af3517596fded2f21e4,2022-11-11 18:09:09,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int t,j;\n\n    scanf(\""%d\"",&t);\n    int a[t];\n      for(j=0;j<t;j++)\n        {\n           scanf(\""%d\"",&a[j]);\n\n        printf(\""6\\n\"",a[j]);\n        }\n   return 0;\n}\n\n\n\n",WRONG_ANSWER,12,452
1591010139321204736,7222c2fb91a71fcf3f6560860557ab564f69a453594c9f1620ecc35bb26f5daf,2022-11-11 18:09:11,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    int max=1,n,i,j;\n    scanf(\""%d\"",&n);\nfor(i=2;i<=n;i++)\n{\n    for(j=2;j<i;j++)\n    {\n       if(i%j!=0)\n       {\n           if(j==i-1)\n           max++;\n       }\n        else break;\n    }\n}\n    printf(\""%d\"",max);\n    return 0;\n}",ACCEPTED,920,324
1591010293352804352,505c5b9a1b6d591a815315d95a57743fb98dad691b51421b4de282392fef3f43,2022-11-11 18:09:48,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,list_num=[]\na=int(input())\ni=2\nwhile i<a:\n    j=2\n    while j<=i:\n        if i==j:\n            list_num.append(i)\n        if i%j==0:\n            break\n        j+=1\n    i+=1\nprint(len(list_num)),TIME_LIMIT_EXCEEDED,1000,2992
1591010355713740800,542d97133043a1f2156354473a31382c35bb2836688b0ed76eae59c52a2e0e3a,2022-11-11 18:10:03,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int m,n,o,p;\n    scanf(\""%d\"",&n);\n    for(o=0;o<n;o++)\n    {\n        scanf(\""%d\"",&p);\n    }\n    for(m=0;m<n;m++)\n    {\n       printf(\""6\\n\"");\n    }\n    return 0;\n}\n",WRONG_ANSWER,9,472
1591010534089101312,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-11 18:10:45,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main(){\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,3,196
1591010570780872704,a57fdafe4877cd9608fc0ac8a5120a47bc60a015785960e61b67b4e66187c2f2,2022-11-11 18:10:54,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int i,n,j,num=0,k;\n    if(scanf(\""%d\"",&n)){\n    for(i=1;i<=n;i++){\n        k=(int)sqrt(i);\n        for(j=2;j<=k;j++){\n            if(i%j==0)\n                break;\n        }\n    if(j>k)\n        num++;\n    }\n    printf(\""%d\"",num);\n    return 0;\n    }\n}\n",WRONG_ANSWER,13,184
1591010628343500800,ef50cfe7f34b26d29f617c97ac65d40bd15ba1e063897a190284243de955e254,2022-11-11 18:11:08,Java,300.0,1590528927448293376,1590525945717575680,1049226928954454016,import java.util.Calendar;\npublic class Main{\n\tpublic static void main(String[] args){\n\t    Calendar date=Calendar.getInstance();\n\t    String year=String.valueOf(date.get(Calendar.YEAR));\n\t    System.out.print(year);\n\t}\n},ACCEPTED,147,18568
1591010699093016576,542d97133043a1f2156354473a31382c35bb2836688b0ed76eae59c52a2e0e3a,2022-11-11 18:11:24,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int m,n,o,p;\n    if(scanf(\""%d\"",&n))\n    {\n        for(o=0;o<n;o++)\n        {\n            if(scanf(\""%d\"",&p))\n            {\n\n            }\n        }\n        for(m=0;m<n;m++)\n        {\n            printf(\""6\\n\"");\n        }\n    }\n\n    return 0;\n}\n",WRONG_ANSWER,9,344
1591010901631762432,33066437ddee11f609c900fe8dbd59cb8113e4d8dfd13c1812f199f4f3fdd334,2022-11-11 18:12:13,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#define N 10010\nint main()\n{\n    int n;\n    int i,a[N],b[N];\n    int k=0;\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=1;i<=n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(i=1;i<=n;i++)\n    {\n        if(b[i]>a[i]) k=k+(b[i]-a[i]);\n        else\n            break;\n    }\n    printf(\""%d\"",k);\n    return 0;\n}",WRONG_ANSWER,3,320
1591010919772106752,542d97133043a1f2156354473a31382c35bb2836688b0ed76eae59c52a2e0e3a,2022-11-11 18:12:17,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int m,n,o,p,q,digit;\n    int a[n];\n    scanf(\""%d\"",&n);\n    for(m=0;m<n;m++)\n    {\n        scanf(\""%d\"",&a[m]);\n    }\n    for(o=0;o<n;o++)\n    {\n        p=1;\n        for(q=0;q<a[o];q++)\n        {\n            p=p*6;\n        }\n        digit=p%10;\n        printf(\""%d\\n\"",digit);\n    }\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,23,320
1591010995328323584,1019ea4e8e67338c8191b6e52878cb69ca9287130af71af3517596fded2f21e4,2022-11-11 18:12:35,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int t,j;\n\n    scanf(\""%d\"",&t);\n    int a[t];\n   if(a[t]>=0&&a[t]<=1000000000)\n     {\n      for(j=0;j<t;j++)\n        {\n           scanf(\""%d\"",&a[j]);\n\n        printf(\""6\\n\"",a[j]);\n        }\n     }\n   return 0;\n}\n\n\n\n",WRONG_ANSWER,13,476
1591011036705132544,547094c7c62f34b25dac6d7d79e017d817767a29a120ff5083d5fe0c21b62800,2022-11-11 18:12:45,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b,c=1,d,i,j;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++)\n    {\n        scanf(\""%d\"",&b);\n        if(b==0)\n        {\n            printf(\""1\\n\"");\n            continue;\n        }\n        c=pow(6,b);\n        d=c%10;\n        printf(\""%d\\n\"",d);\n    }\n    return 0;\n}\n",WRONG_ANSWER,7,448
1591011221992681472,0ed66ddb50163bbc5dd43c591bc3d500e68ed69fe23bfebfa6ac827c1dfc1849,2022-11-11 18:13:29,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nmain()\n{\n    int n,a[50],b[50];\n    scanf(\""%d\"",&n);\n    int i,m,sum=0;\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&m);\n        a[i]=m;\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&m);\n        b[i]=m;\n    }\n    for(i=0;i<n;i++)\n        if(a[i]<=b[i])\n            sum+=(b[i]-a[i]);\n    printf(\""%d\"",sum);\n}",WRONG_ANSWER,3,180
1591011379140694016,0cfbb4a339ebbc4dce13b5f3e3f98a3def0ab17ef5b4ac8e6d566de92e1f5f78,2022-11-11 18:14:07,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include\""stdio.h\""\nint main(){\n    int n;\n    scanf(\""%d\"", &n);\n    int a[n];\n    for(int i=0;i<n;i++){\n        scanf(\""%d\"", &a[i]);\n    }\n    for(int i=0;i<n;i++){\n        if(a[i]!=0){\n            printf(\""6\\n\"");\n        }\n        else\n            printf(\""1\"");\n    }\n    return 0;\n}",ACCEPTED,9,352
1591011443087028224,0ed66ddb50163bbc5dd43c591bc3d500e68ed69fe23bfebfa6ac827c1dfc1849,2022-11-11 18:14:22,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nmain()\n{\n    int n,a[50],b[50];\n    scanf(\""%d\"",&n);\n    int i,m,sum=0;\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&m);\n        a[i]=m;\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&m);\n        b[i]=m;\n    }\n    for(i=0;i<n;i++)\n        if(a[i]<=b[i])\n            sum+=(b[i]-a[i]);\n    printf(\""%d\\n\"",sum);\n}",WRONG_ANSWER,4,180
1591011981233008640,864c0dc14d6d917707294bc7e18ea53a2c0536c5d47f3d25f94f0188f106014f,2022-11-11 18:16:30,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main(){\n    int t,i;\n    long long n;\n    scanf(\""%lld \"",&t);\n    for(i=0;i<t;i++){\n        scanf(\""%d\"",&n);\n        if(n==0){\n            printf(\""1\\n\"");\n        }\n        else if(n>=1) {printf(\""6\\n\"");}\n    }\n    return 0;\n}\n",WRONG_ANSWER,9,324
1591012533836754944,1e783de44f6cf9abb158b108e556a36ef99d9241fc592b40cfd6cb7d1265eb34,2022-11-11 18:18:42,Java,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n    public static void main(String[] args) throws IOException {\n        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n        int t =Integer.valueOf(reader.readLine());\n        String[] string = reader.readLine().split(\"" \"");\n        for (int i = 0; i < t; i++) {\n            if (string[i].equals(\""0\"")){\n                System.out.println(1);\n            }\n            else\n            System.out.println(6);\n        }\n    }\n}\n",ACCEPTED,213,17304
1591013191298121728,505c5b9a1b6d591a815315d95a57743fb98dad691b51421b4de282392fef3f43,2022-11-11 18:21:19,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,m=[]\na=int(input())\ni=2\nwhile i<a:\n    j=2\n    while j<=i:\n        if i==j:\n            m.append(i)\n        if i%j==0:\n            break\n        j+=1\n    i+=1\nprint(len(m)),TIME_LIMIT_EXCEEDED,1000,2860
1591013262886481920,5ed1ed5f3786d45db71190023ef590496fd0d8d8cfe4af0f2c94d1d387178674,2022-11-11 18:21:36,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}\n",ACCEPTED,3,348
1591013800269123584,864c0dc14d6d917707294bc7e18ea53a2c0536c5d47f3d25f94f0188f106014f,2022-11-11 18:23:44,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main(){\n    int t,i;\n    int n;\n    scanf(\""%d \"",&t);\n    for(i=0;i<t;i++){\n        scanf(\""%d\"",&n);\n        if(n==0){\n            printf(\""1\\n\"");\n        }\n        else if(n>=1) {printf(\""6\\n\"");}\n    }\n    return 0;\n}\n",WRONG_ANSWER,9,188
1591014159012114432,0ed66ddb50163bbc5dd43c591bc3d500e68ed69fe23bfebfa6ac827c1dfc1849,2022-11-11 18:25:09,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n   int a[200001],b[200001];\n   int n,i,maxsum,cursum;\n   scanf(\""%d\"",&n);\n   for (i=0;i<n;i++)\n       scanf(\""%d\"",&a[i]);\n    for (i=0;i<n;i++)\n       scanf(\""%d\"",&b[i]);\n    for (i=0;i<n;i++)\n       a[i]=b[i]-a[i];\n   cursum=a[0];\n   maxsum=a[0];\n   for (i=1;i<n;i++)\n   {\n       if (cursum+a[i]>maxsum)\n       {\n             maxsum=cursum+a[i];\n       }\n       if (cursum+a[i]<0)\n       {\n             if (a[i]<0)  cursum=0;\n            else   cursum=a[i];\n       }\n       else\n          cursum= cursum+a[i] ;\n   }\n   printf(\""%d\\n\"",maxsum);\n   return 0;\n\n}",ACCEPTED,3,184
1591014203761164288,05322c7db848fe3ffcd527251ab80da608e98289cd6d6511d7c6e8436c4fdaf2,2022-11-11 18:25:20,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n    int n,t,i,j,a,b;\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++){\n        scanf(\""%d\"",&n);\n        a=pow(6,n);\n        b=a%10;\n        printf(\""%d\"",b);\n    }\n    return 0;\n}\n",WRONG_ANSWER,7,320
1591014218843860992,20033d4bfe54ea16777c218f33d3af83aed121eb1b058daa8e84687ea80be80b,2022-11-11 18:25:24,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,c=2022\nprint(c),ACCEPTED,16,2868
1591014388268597248,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-11 18:26:04,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main(){\n    int X,Y,Z;\n    printf(\""请输入X,Y,Z的值：\\n\"");\n    scanf(\""%d%d%d\\n\"",&X,%Y,&Z);\n    int res=X+Y-Z;\n    printf(\""输出值为：%d\""，res);\n    return 0;\n}",COMPILE_ERROR,0,0
1591014435228004352,05322c7db848fe3ffcd527251ab80da608e98289cd6d6511d7c6e8436c4fdaf2,2022-11-11 18:26:15,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n    long n,t,i,j,a,b;\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++){\n        scanf(\""%d\"",&n);\n        a=pow(6,n);\n        b=a%10;\n        printf(\""%d\"",b);\n    }\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,20,440
1591014486645997568,05322c7db848fe3ffcd527251ab80da608e98289cd6d6511d7c6e8436c4fdaf2,2022-11-11 18:26:27,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n    long n,t,i,j,a,b;\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++){\n        scanf(\""%d\"",&n);\n        a=pow(6,n);\n        b=a%10;\n        printf(\""%d\"",b);\n    }\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,20,324
1591014514127056896,105cc8c0a5a465ab713603b461d92ac587c87767965625687540cd513f7ebb57,2022-11-11 18:26:34,C++,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<bits/stdc++.h>\n#define N 10005\n#define endl '\\n'\n#define int long long\n#define ios ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)\n\n//const int dir[4][2]={-1,0,0,1,1,0,0,-1};\n//const int mod=1e9+7;\nusing namespace std;\n\ninline int read() {\n    char c = getchar(); int num = 0, sign = 1;\n    while(c < '0' || c > '9') {if(c == '-') sign = -1; c = getchar();}\n    while(c >= '0' && c <= '9') num = num * 10 + c - '0', c = getchar();\n    return num * sign;\n}\n\nvoid solve(){\n\tint n;\n\tint a,b;\n\tint pre,cur,res=0;\n\tcin>>n;\n\tvector<int> nums(n);\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tcin>>a;\n\t\tnums[i]=a;\n\t}\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tcin>>b;\n\t\tnums[i]=b-nums[i];\n\t}\n\tpre=nums[0];\n\tres=pre;\n\t\n\tfor(int i=1;i<n;i++)\n\t{\n\t\tcur=max(pre+nums[i],nums[i]);\n\t\tpre=cur;\n\t\tres=max(res,pre);\n\t}\n\tcout<<res;\n\t\n\n\t\n}\n\nsigned main() {\n\tios;\n\tint count=1;\n\t//cin>>count;\n\twhile(count--)\n\t{\n\t\tsolve();\n\t}\n\treturn 0;\n}\n",ACCEPTED,3,312
1591014803332726784,542d97133043a1f2156354473a31382c35bb2836688b0ed76eae59c52a2e0e3a,2022-11-11 18:27:43,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int m,n,o;\n    scanf(\""%d\"",&n);\n    for(m=0;m<n;m++)\n    {\n        scanf(\""%d\"",&o);\n        if(o==0)\n            printf(\""1\\n\"");\n        else\n            printf(\""6\\n\"");\n    }\n    return 0;\n}\n",ACCEPTED,10,344
1591015002566361088,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-11 18:28:30,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main(){\n    int X,Y,Z,res;\n    printf(\""请输入X,Y,Z的值：\\n\"");\n    scanf(\""%d%d%d\\n\"",&X,%Y,&Z);\n    res=X+Y-Z;\n    printf(\""输出值为：%d\""，res);\n    return 0;\n}",COMPILE_ERROR,0,0
1591015183647051776,7d46013a6da090b69b62e7be93e7628aee2f7eef31af37777b9ccf1fd1d3eb2e,2022-11-11 18:29:14,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n;\n    int a[50];\n    int b[50];\n    int i;\n    int x=0,y=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n    {\n        if(a[i]>=b[i])\n        {\n            x=a[i]-b[i];\n            y+=x;\n        }\n    }\n    printf(\""%d\"",y);\n    return 0;\n}",WRONG_ANSWER,3,196
1591015583011901440,064270dabaa13edbd7238477860db0e46621a5ed4921e8aa2c0f9258e77722cc,2022-11-11 18:30:49,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""2022\\n\"");\n    return 0;\n}\n",ACCEPTED,3,188
1591016412058030080,345826d11b41befc23adeb536e81da8eb6ec9a8bfb9448acf91422deedb8ba4a,2022-11-11 18:34:06,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,i,mmax=0,sum=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n],s[n],max[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n     for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n        {\n            s[i]=0;\n            c[i]=0;\n            max[i]=0;\n        }\n        if(b[0]-a[0]>0)\n            {\n                c[0]=b[0]-a[0];\n                s[0]=c[0];\n                max[0]=s[0];\n                sum=sum+s[0];\n            }\n\n     for(i=1;i<n;i++)\n        {\n            if(b[i]-a[i]>0)\n            {\n                c[i]=b[i]-a[i];\n                s[i]=s[i-1]+c[i];\n                max[i]=s[i];\n                sum=sum+s[i];\n            }\n            else\n            {\n              if(sum+s[i]>max[i])\n                max[i]=sum+s[i];\n                s[i]=0;\n            }\n        }\n    mmax=max[0];\n    for(i=0;i<n-1;i++)\n    {\n        if(mmax>=max[i+1])\n           ;\n        else\n            mmax=max[i+1];\n    }\n     printf(\""%d\"",mmax);\n}\n",WRONG_ANSWER,3,488
1591016471856218112,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-11 18:34:21,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main(){\n    int X,Y,Z,res;\n    printf(\""请输入X,Y,Z的值：\\n\"");\n    scanf(\""%d+%d+%d\\n\"",&X,&Y,&Z);\n    res=X+Y-Z;\n    printf(\""输出值为：%d\"",res);\n    return 0;\n}",WRONG_ANSWER,3,348
1591016690291380224,b80fc2aed0abde15bdaa9327874c9784da696b6ed442d90001602ff2a017be15,2022-11-11 18:35:13,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\nint n,a[100],b[100],c[100];\nint i,j,k,sum,max; \nscanf(\""%d\"",&n);\nfor(i=0;i<n;i++)\n scanf(\""%d\"",&a[i]);\nfor(i=0;i<n;i++)\n scanf(\""%d\"",&b[i]);\nfor(i=0;i<n;i++)\n  c[i]=b[i]-a[i];\nmax=c[0]; \nfor(i=0;i<n;i++)\n {sum=0;\n  for(j=i;j<n;j++)\n  {sum=sum+c[j];\n   if(sum>max)\n    max=sum; \n   } \n  }\nprintf(\""%d\"",max); \nreturn 0; \n}\n}\n   printf(\""%d\"",max); \n    return 0;\n}",COMPILE_ERROR,0,0
1591016811758424064,b80fc2aed0abde15bdaa9327874c9784da696b6ed442d90001602ff2a017be15,2022-11-11 18:35:42,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\nint n,a[100],b[100],c[100];\nint i,j,k,sum,max; \nscanf(\""%d\"",&n);\nfor(i=0;i<n;i++)\n scanf(\""%d\"",&a[i]);\nfor(i=0;i<n;i++)\n scanf(\""%d\"",&b[i]);\nfor(i=0;i<n;i++)\n  c[i]=b[i]-a[i];\nmax=c[0]; \nfor(i=0;i<n;i++)\n {sum=0;\n  for(j=i;j<n;j++)\n  {sum=sum+c[j];\n   if(sum>max)\n    max=sum; \n   } \n  }\nprintf(\""%d\"",max); \nreturn 0; \n}",ACCEPTED,3,196
1591016857224675328,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-11 18:35:53,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main(){\n    int X,Y,Z,res;\n    scanf(\""%d%d%d\\n\"",&X,&Y,&Z);\n    res=X+Y-Z;\n    printf(\""%d\"",res);\n    return 0;\n}",ACCEPTED,6,324
1591016903173279744,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-11 18:36:04,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main(){\n    int X,Y,Z,res;\n    scanf(\""%d%d%d\\n\"",&X,&Y,&Z);\n    res=X+Y-Z;\n    printf(\""%d\"",res);\n    return 0;\n}",ACCEPTED,8,316
1591017237232791552,0c2907a154c1c61744366e94f73ae426665222ffae8eff7042dd0fd7bd8760fb,2022-11-11 18:37:23,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n\n\n{\nint n,sum=0;\nint i;\nscanf(\""%d\"",&n);\nint a[n],b[n],c[n];\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&a[i]);\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&b[i]);\nfor(i=0;i<n;i++)\n   {c[i]=b[i]-a[i];\n   if(c[i]>0)\n    {sum=c[i]+sum;\n    }\n    else break;\n   }\n   printf(\""%d\"",sum);\nreturn 0;\n}\n",WRONG_ANSWER,4,344
1591017705967259648,ddd0edd80a23dfec88d0679f4ed6037779b80d26db4ba0f74fecb3d447de61fa,2022-11-11 18:39:15,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main(){\nprintf(\""2022\"");\n}",ACCEPTED,3,200
1591018379635392512,0c2907a154c1c61744366e94f73ae426665222ffae8eff7042dd0fd7bd8760fb,2022-11-11 18:41:56,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n\n\n{\nint n,sum=0;\nint i;\nscanf(\""%d\"",&n);\nint a[n],b[n],c[n];\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&a[i]);\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&b[i]);\nfor(i=0;i<n;i++)\n   {c[i]=b[i]-a[i];\n   if(c[i]>0)\n    {sum=c[i]+sum;\n    }\n    if(c[i]<0){\n        c[i]=0;\n    }\n    else break;\n   }\n   printf(\""%d\"",sum);\nreturn 0;\n}\n",WRONG_ANSWER,4,312
1591018672343265280,05322c7db848fe3ffcd527251ab80da608e98289cd6d6511d7c6e8436c4fdaf2,2022-11-11 18:43:05,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n\tint n,i,j,flag=0;\n\tscanf(\""%d\"",&n);\n\tfor(i=2;i<=n;i++)\n\t\t{\n\t\tfor(j=2;j<=i;j++)\n\t\t\tif(i%j==0)\n\t\t\t\tbreak;\n\t\tif(i==j)\n\t\t\tflag++;\n\t\t}\n    printf(\""%d\"",flag);\n    return 0;\n}\n",ACCEPTED,946,312
1591018899804585985,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-11 18:44:00,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"\npublic class s1 {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tSystem.out.println(\""2022\"");\n\t}\n\n}\n",COMPILE_ERROR,0,0
1591018972080836608,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-11 18:44:17,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"public class s1 {\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tSystem.out.println(\""2022\"");\n\t}\n}\n",COMPILE_ERROR,0,0
1591019036815699968,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-11 18:44:32,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"public class s1 {\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tSystem.out.println(\""2022\"");\n\t}\n}\n",COMPILE_ERROR,0,0
1591019093338165248,02f3cf9a5ba39e00e2644b9392922d3ea3ea233f83c612c7dbd879f319ea2bdc,2022-11-11 18:44:46,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n   int t,n,i;\n   scanf(\""%d\"",&t);\n   for(i=0;i<t;i++)\n   {\n       scanf(\""%d\"",&n);\n       printf(\""6\\n\"");\n   }\n\n    return 0;\n}\n",WRONG_ANSWER,13,384
1591019110983598080,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-11 18:44:50,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"public class s1 {\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tSystem.out.println(\""2022\"");\n\t}\n}\n",COMPILE_ERROR,0,0
1591019156080758784,d54b7e24c90cf40d468bdeb018e61440010a1049a4ae96e2c6331c215521f91c,2022-11-11 18:45:01,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"int main()\n{\n\tint n,i,j,a,b;\n\tscanf(\""%d\"",&n);\n\t\n\tfor(i=2;i<=n;i++)\n\t{\n        a=1;\n\t\tfor(j=2;j<=i;j++)\n\t\t{\n\t\t\tif(i%j==0)\n\t\t\t{\n\t\t\t\ta-0;\n                break;\n\t\t\t}\n\t\t}\n\t\tif(a==1)\n\t\t{\n\t\t\tb++;\n\t\t}\n\n\t}\n    printf(\""%d\"",&b)\n\n}",COMPILE_ERROR,0,0
1591019198116048896,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-11 18:45:11,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"\npublic class s1 {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tSystem.out.println(\""2022\"");\n\t}\n}\n",COMPILE_ERROR,0,0
1591019233927036928,505c5b9a1b6d591a815315d95a57743fb98dad691b51421b4de282392fef3f43,2022-11-11 18:45:19,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int i,m,n;\n    scanf(\""%d\"",&m);\n    for (i=0;i<m;i++)\n    {\n        scanf(\""%d\"",&n);\n        if(n==0)\n            printf(\""1\\n\"");\n        else\n            printf(\""6\\n\"");\n    }\n    return 0;\n}",ACCEPTED,8,200
1591019244874170368,69d2f3a9da1c135d111e69327883b4d96c284e9c1c71370cc330a44458f95ab4,2022-11-11 18:45:22,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint mian()\n{\n\tint a;\n\ta = 2022;\n\tprintf(\""%d\"",&a);\n\treturn 0;\n}",COMPILE_ERROR,0,0
1591019270593646592,d54b7e24c90cf40d468bdeb018e61440010a1049a4ae96e2c6331c215521f91c,2022-11-11 18:45:28,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"int main()\n{\n\tint n,i,j,a,b;\n\tscanf(\""%d\"",&n);\n\t\n\tfor(i=2;i<=n;i++)\n\t{\n        a=1;\n\t\tfor(j=2;j<=i;j++)\n\t\t{\n\t\t\tif(i%j==0)\n\t\t\t{\n\t\t\t\ta=0;\n                break;\n\t\t\t}\n\t\t}\n\t\tif(a==1)\n\t\t{\n\t\t\tb++;\n\t\t}\n\n\t}\n    printf(\""%d\"",&b)\n\n}",COMPILE_ERROR,0,0
1591019293427412992,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-11 18:45:33,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"public class s1 {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tSystem.out.println(\""2022\"");\n\t}\n\n}\n",COMPILE_ERROR,0,0
1591019393327345664,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-11-11 18:45:57,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"t=int(input())\nn=list(map(int,input().split(' ')))\nfor i in range(0,len(n)):\n   print(pow(6,n[i])%10)",TIME_LIMIT_EXCEEDED,166,3984
1591019567638425600,0c2907a154c1c61744366e94f73ae426665222ffae8eff7042dd0fd7bd8760fb,2022-11-11 18:46:39,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n\n\n{\nint n,sum=0,flag=0;\nint i;\nscanf(\""%d\"",&n);\nint a[n],b[n],c[n];\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&a[i]);\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&b[i]);\nfor(i=0;i<n;i++)\n   c[i]=b[i]-a[i];\nfor(i=0;i<n;i++)\n{\n   sum=sum+c[i];\n   if(sum>flag)\n     flag=sum;\n    if(sum<0)\n     sum=0;\n}\nprintf(\""%d\"",flag);\nreturn 0;\n}\n",ACCEPTED,3,196
1591019602308542464,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-11 18:46:47,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n\n#define M 100\n\nmax(int j,c[M]);\n\nint main()\n\n{\n\n    int n,a[M],b[M],c[M],i,j,k,d[M],max;\n\n    scanf(\""%d\"",&n);\n\n    for(i=1;i<=n;i++)\n\n    scanf(\""%d\"",&a[i]);\n\n    for(i=1;i<=n;i++)\n\n    scanf(\""%d\"",&b[i]);\n\n    for(j=1;j<=n;j++)\n\n    {\n\n    k=j;\n\n    int c[M]={0};\n\n    for(i=j;i<=n;i++)\n\n    c[i]=b[i]-a[i]+c[i-1];\n\n    for(i=j;i<=n;i++)\n\n    if(c[i]>c[i-1])\n\n    d[k]=c[i];\n\n    }\n\n    for(i=1;i<=n;i++)\n\n    if(d[i]>d[i-1])\n\n    max=d[i];\n\n    printf(\""%d\\n\"",max);\n\n    return 0;\n\n}\n\n",COMPILE_ERROR,0,0
1591019626954293248,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-11 18:46:53,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""2022\\n\"");\n    return 0;\n}\n",ACCEPTED,2,200
1591019628694933504,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-11 18:46:53,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\nlist = map(int,input().split())\nfor i in list:\n    if i==0:\n        print(\""0\"")\n    else:\n        print(\""6\"")\n",COMPILE_ERROR,0,0
1591019652011044864,d54b7e24c90cf40d468bdeb018e61440010a1049a4ae96e2c6331c215521f91c,2022-11-11 18:46:59,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"int main()\n{\n\tint n,i,j,a,b;\n\tscanf(\""%d\"",&n);\n\t\n\tfor(i=2;i<=n;i++)\n\t{\n        a=1;\n\t\tfor(j=2;j<=i;j++)\n\t\t{\n\t\t\tif(i%j==0)\n\t\t\t{\n\t\t\t\ta=0;\n                break;\n\t\t\t}\n\t\t}\n\t\tif(a==1)\n\t\t{\n\t\t\tb++;\n\t\t}\n\n\t}\n    printf(\""%d\"",&b);\n\n}",WRONG_ANSWER,974,188
1591019652552130560,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-11 18:46:59,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n\n#define M 100\n\nmax(int j,c[M]);\n\nint main()\n\n{\n\n    int n,a[M],b[M],c[M],i,j,k,d[M],max;\n\n    scanf(\""%d\"",&n);\n\n    for(i=1;i<=n;i++)\n\n    scanf(\""%d\"",&a[i]);\n\n    for(i=1;i<=n;i++)\n\n    scanf(\""%d\"",&b[i]);\n\n    for(j=1;j<=n;j++)\n\n    {\n\n    k=j;\n\n    int c[M]={0};\n\n    for(i=j;i<=n;i++)\n\n    c[i]=b[i]-a[i]+c[i-1];\n\n    for(i=j;i<=n;i++)\n\n    if(c[i]>c[i-1])\n\n    d[k]=c[i];\n\n    }\n\n    for(i=1;i<=n;i++)\n\n    if(d[i]>d[i-1])\n\n    max=d[i];\n\n    printf(\""%d\\n\"",max);\n\n    return 0;\n\n}\n\n",COMPILE_ERROR,0,0
1591019716775292928,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-11-11 18:47:14,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n\n#define M 100\n\nint main()\n\n{\n\n    int n,a[M],b[M],c[M],i,j,k,d[M],max;\n\n    scanf(\""%d\"",&n);\n\n    for(i=1;i<=n;i++)\n\n    scanf(\""%d\"",&a[i]);\n\n    for(i=1;i<=n;i++)\n\n    scanf(\""%d\"",&b[i]);\n\n    for(j=1;j<=n;j++)\n\n    {\n\n    k=j;\n\n    int c[M]={0};\n\n    for(i=j;i<=n;i++)\n\n    c[i]=b[i]-a[i]+c[i-1];\n\n    for(i=j;i<=n;i++)\n\n    if(c[i]>c[i-1])\n\n    d[k]=c[i];\n\n    }\n\n    for(i=1;i<=n;i++)\n\n    if(d[i]>d[i-1])\n\n    max=d[i];\n\n    printf(\""%d\\n\"",max);\n\n    return 0;\n\n}\n\n",WRONG_ANSWER,4,184
1591019785574461440,547094c7c62f34b25dac6d7d79e017d817767a29a120ff5083d5fe0c21b62800,2022-11-11 18:47:31,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint is(int n)\n{\n    int i;\n    if(n==2)\n        return 1;\n    else if(n==1||n%2==0)\n        return 0;\n    for(i=3;i<=sqrt(n);i+=2)\n        if(n%i==0)\n            return 0;\n    return 1;\n}\nint main()\n{\n    int i,sum=0;\n    long int a;\n    scanf(\""%d\"",&a);\n    for(i=1;i<=a;i++)\n        {\n            if(is(i)==1)\n            sum++;\n        }\n            printf(\""%d\"",sum);\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,1000,316
1591019791895298048,05322c7db848fe3ffcd527251ab80da608e98289cd6d6511d7c6e8436c4fdaf2,2022-11-11 18:47:32,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n    long n,t,i,j,a,b;\n    scanf(\""%ld\"",&t);\n    for(i=0;i<t;i++){\n        scanf(\""%ld\"",&n);\n        a=pow(6,n);\n        b=a%10;\n        printf(\""%ld\"",b);\n    }\n    return 0;\n}\n",WRONG_ANSWER,11,308
1591020049798856704,0c2907a154c1c61744366e94f73ae426665222ffae8eff7042dd0fd7bd8760fb,2022-11-11 18:48:34,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n\n\n{\nint n;\nint i;\n\nif(n==0)\nprintf(\""1\"");\nelse{\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&data[i]);\nfor(i=0;i<n;i++)\n  {if(data[i]==0&&n==1)\n      printf(\""1\"");\n    if(i==n-1&&data[i]!=0)\n        printf(\""6\"");\n        else if(data[i]==0)\n            printf(\""1\\n\"");\n   else\n            printf(\""6\\n\""); }}\n\nreturn 0;\n}\n",COMPILE_ERROR,0,0
1591020251721039872,69d2f3a9da1c135d111e69327883b4d96c284e9c1c71370cc330a44458f95ab4,2022-11-11 18:49:22,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tprintf(\""2022\"");\n\treturn 0;\n}",ACCEPTED,2,316
1591020391018070016,547094c7c62f34b25dac6d7d79e017d817767a29a120ff5083d5fe0c21b62800,2022-11-11 18:49:55,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint is(int n)\n{\n    int i;\n    if(n==2)\n        return 1;\n    else if(n==1||n%2==0)\n        return 0;\n    for(i=3;i<=sqrt(n)+1;i+=2)\n        if(n%i==0)\n            return 0;\n    return 1;\n}\nint main()\n{\n    long int a,i,sum=0;\n    scanf(\""%d\"",&a);\n    for(i=1;i<=a;i++)\n        {\n            if(is(i)==1)\n            sum++;\n        }\n            printf(\""%d\"",sum);\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,1000,444
1591020445862789120,864c0dc14d6d917707294bc7e18ea53a2c0536c5d47f3d25f94f0188f106014f,2022-11-11 18:50:08,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main(){\n    int t,i;\n    long n;\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++){\n        scanf(\""%ld\"",&n);\n        if(n==0){\n            printf(\""1\\n\"");\n        }\n        else if(n>=1) {printf(\""6\\n\"");}\n    }\n    return 0;\n}\n",ACCEPTED,11,348
1591020547713077248,064270dabaa13edbd7238477860db0e46621a5ed4921e8aa2c0f9258e77722cc,2022-11-11 18:50:32,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint result(int x,int y,int z)\n{\n    int a=0;\n    a=x+y-z;\n    return a;\n}\n\n\n\n\n\n\n\nint main()\n{\n    int a,b,c;\n    int answer=0;\n        scanf(\""%d,%d,%d\"",&a,&b,&c);\n    if(a<=100&&a>0&&b<=100&&b>0&&c<=100&&c>=0)\n     answer=result(a,b,c);\n    printf(\""%d\"",answer);\n}\n",WRONG_ANSWER,3,192
1591020633180405760,064270dabaa13edbd7238477860db0e46621a5ed4921e8aa2c0f9258e77722cc,2022-11-11 18:50:53,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint result(int x,int y,int z)\n{\n    int a=0;\n    a=x+y-z;\n    return a;\n}\nint main()\n{\n    int a,b,c;\n    int answer=0;\n        scanf(\""%d,%d,%d\"",&a,&b,&c);\n    if(a<=100&&a>0&&b<=100&&b>0&&c<=100&&c>=0)\n     answer=result(a,b,c);\n    printf(\""%d\"",answer);\n}\n",WRONG_ANSWER,3,196
1591020648011464704,02f3cf9a5ba39e00e2644b9392922d3ea3ea233f83c612c7dbd879f319ea2bdc,2022-11-11 18:50:56,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n   int t,n,i,m,a;\n   scanf(\""%d\"",&t);\n   for(i=0;i<t;i++)\n   {\n       scanf(\""%d\"",&n);\n       m=pow(6,n);\n       a=m%10;\n       printf(\""%d\\n\"",a);\n   }\n\n    return 0;\n}\n",WRONG_ANSWER,5,356
1591020681775611904,d54b7e24c90cf40d468bdeb018e61440010a1049a4ae96e2c6331c215521f91c,2022-11-11 18:51:04,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"int main()\n{\n\tint n,i,j,a,b;\n\tscanf(\""%d\"",&n);\n\t\n\tfor(i=2;i<=n;i++)\n\t{\n        a=1;\n\t\tfor(j=2;j<=i;j++)\n\t\t{\n\t\t\tif(i%j==0)\n\t\t\t{\n\t\t\t\ta=0;\n                break;\n\t\t\t}\n\t\t}\n\t\tif(a==1)\n\t\t{\n\t\t\tb++;\n\t\t}\n\n\t}\n    printf(\""%d\"",&b);\n    return 0;\n\n}",WRONG_ANSWER,954,312
1591020774150967296,d54b7e24c90cf40d468bdeb018e61440010a1049a4ae96e2c6331c215521f91c,2022-11-11 18:51:26,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"int main()\n{\n\tint n,i,j,a,b=0;\n\tscanf(\""%d\"",&n);\n\t\n\tfor(i=2;i<=n;i++)\n\t{\n        a=1;\n\t\tfor(j=2;j<=i;j++)\n\t\t{\n\t\t\tif(i%j==0)\n\t\t\t{\n\t\t\t\ta=0;\n                break;\n\t\t\t}\n\t\t}\n\t\tif(a==1)\n\t\t{\n\t\t\tb++;\n\t\t}\n\n\t}\n    printf(\""%d\"",&b);\n    return 0;\n\n}",WRONG_ANSWER,941,416
1591020866954137600,d54b7e24c90cf40d468bdeb018e61440010a1049a4ae96e2c6331c215521f91c,2022-11-11 18:51:49,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"int main()\n{\n\tint n,i,j,a,b=0;\n\tscanf(\""%d\"",&n);\n\t\n\tfor(i=2;i<=n;i++)\n\t{\n        a=1;\n\t\tfor(j=2;j<=i;j++)\n\t\t{\n\t\t\tif(i%j==0)\n\t\t\t{\n\t\t\t\ta=0;\n                break;\n\t\t\t}\n\t\t}\n\t\tif(a==1)\n\t\t{\n\t\t\tb++;\n\t\t}\n\n\t}\n    printf(\""%d\"",b);\n    return 0;\n\n}",WRONG_ANSWER,946,200
1591020877767049216,02f3cf9a5ba39e00e2644b9392922d3ea3ea233f83c612c7dbd879f319ea2bdc,2022-11-11 18:51:51,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n   int t,n,i,m,a;\n   scanf(\""%d\"",&t);\n   for(i=0;i<t;i++)\n   {\n       scanf(\""%d\"",&n);\n       m=pow(6,n);\n       a=m%10;\n       printf(\""%d\\n\"",a);\n   }\n    return 0;\n}\n",WRONG_ANSWER,7,336
1591020886923214848,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 18:51:53,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"a=int(input())\ndata1=list(map(int,input().split()))\ndata2=list(map(int,input().split()))\n\ndatas=[]\nfor i in range(a):\n    datas.append(data2[i]-data1[i])\n\ndatass=[]\ndata4=0\nprint(datas)\nfor i in range(len(datas)):\n    for x in range(i,len(datas)):\n            if i==x:\n                data3=datas[x]\n            else:\n                if datas[x] <0:\n                    break\n                else:\n                    data3+=datas[x]\n    if data4<data3:\n        data4=data3\n\nprint(data4)",WRONG_ANSWER,16,2892
1591021034403311616,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 18:52:29,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"a=int(input())\ndata1=list(map(int,input().split()))\ndata2=list(map(int,input().split()))\n\ndatas=[]\nfor i in range(a):\n    datas.append(data2[i]-data1[i])\n\ndatass=[]\ndata4=0\n\nfor i in range(len(datas)):\n    for x in range(i,len(datas)):\n            if i==x:\n                data3=datas[x]\n            else:\n                if datas[x] <0:\n                    break\n                else:\n                    data3+=datas[x]\n    if data4<data3:\n        data4=data3\n\nprint(data4)",WRONG_ANSWER,16,2756
1591021050811449344,05322c7db848fe3ffcd527251ab80da608e98289cd6d6511d7c6e8436c4fdaf2,2022-11-11 18:52:32,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n    long n,t,i,j,a,b;\n    scanf(\""%ld\"",&t);\n    for(i=0;i<t;i++){\n        scanf(\""%ld\"",&n);\n        a=pow(6,n);\n        b=a%10;\n        printf(\""%ld\"",b);\n    }\n    return 0;\n}\n",WRONG_ANSWER,7,344
1591021077483008000,064270dabaa13edbd7238477860db0e46621a5ed4921e8aa2c0f9258e77722cc,2022-11-11 18:52:39,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint result(int x,int y,int z)\n{\n    int a=0;\n    a=x+y-z;\n    return a;\n}\nint main()\n{\n    int a,b,c;\n    int answer=0;\n        scanf(\""%d,%d,%d\"",&a,&b,&c);\n    if(a<=100&&a>0&&b<=100&&b>0&&c<=100&&c>=0)\n     answer=result(a,b,c);\n    printf(\""%d\"",answer);\n}\n",WRONG_ANSWER,3,184
1591021114107691008,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 18:52:48,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"a=int(input())\ndata1=list(map(int,input().split()))\ndata2=list(map(int,input().split()))\n\ndatas=[]\nfor i in range(a):\n    datas.append(data2[i]-data1[i])\n\ndatass=[]\ndata4=0\nfor i in range(len(datas)):\n    for x in range(i,len(datas)):\n            if i==x:\n                data3=datas[x]\n            else:\n                if datas[x] <0:\n                    break\n                else:\n                    data3+=datas[x]\n    if data4<data3:\n        data4=data3\n\nprint(data4)",WRONG_ANSWER,18,2756
1591021118977257472,d54b7e24c90cf40d468bdeb018e61440010a1049a4ae96e2c6331c215521f91c,2022-11-11 18:52:49,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"int main()\n{\n\tint n,i,j,a,b=0;\n\tscanf(\""%d\"",&n);\n\t\n\tfor(i=2;i<=n;i++)\n\t{\n        a=1;\n\t\tfor(j=2;j<i;j++)\n\t\t{\n\t\t\tif(i%j==0)\n\t\t\t{\n\t\t\t\ta=0;\n                break;\n\t\t\t}\n\t\t}\n\t\tif(a==1)\n\t\t{\n\t\t\tb++;\n\t\t}\n\n\t}\n    printf(\""%d\"",b);\n    return 0;\n\n}",ACCEPTED,988,344
1591021147313999872,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 18:52:55,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main(){\n    int x,y,z;\n    printf(\""请输入三个整数空格隔开：\"");\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    \n    printf(\""m=%d\"", x+y-z);\n    return 0;\n}",WRONG_ANSWER,3,468
1591021296761245696,02f3cf9a5ba39e00e2644b9392922d3ea3ea233f83c612c7dbd879f319ea2bdc,2022-11-11 18:53:31,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n   int t,n,i,m,a;\n   scanf(\""%d\"",&t);\n   for(i=0;i<t;i++)\n   {\n       scanf(\""%d\"",&n);\n       m=pow(6,n);\n       a=m%10;\n       printf(\""%d\"",a);\n   }\n    return 0;\n}\n",WRONG_ANSWER,7,600
1591021589989228544,064270dabaa13edbd7238477860db0e46621a5ed4921e8aa2c0f9258e77722cc,2022-11-11 18:54:41,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint result(int x,int y,int z)\n{\n    int a=0;\n    a=x+y-z;\n    return a;\n}\nint main()\n{\n    int a,b,c;\n    int answer=0;\n        scanf(\""%d,%d,%d\"",&a,&b,&c);\n    if(a<=100&&a>0&&b<=100&&b>0&&c<=100&&c>=0)\n     answer=result(a,b,c);\n     else\n        printf(\""输入错误\"");\n    printf(\""%d\"",answer);\n}\n",WRONG_ANSWER,4,196
1591021655105798144,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-11 18:54:56,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\nlist = map(eval,input().split())\nfor i in list:\n    if 0<=i<=1000000000:\n        if i==0:\n            print(\""0\"")\n        else:\n            print(\""6\"")\n",COMPILE_ERROR,0,0
1591021669538402304,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 18:55:00,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"a=int(input())\ndata1=list(map(int,input().split()))\ndata2=list(map(int,input().split()))\n\ndatas=[]\nfor i in range(a):\n    datas.append(data2[i]-data1[i])\n\n\ndata4=min(datas)\nprint(datas)\nfor i in range(len(datas)):\n    for x in range(i,len(datas)):\n            if i==x:\n                data3=datas[x]\n            else:\n                if datas[x] <0:\n                    break\n                else:\n                    data3+=datas[x]\n    if data4<data3:\n        data4=data3\n\nprint(data4)",WRONG_ANSWER,16,2892
1591021686470803456,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 18:55:04,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"a=int(input())\ndata1=list(map(int,input().split()))\ndata2=list(map(int,input().split()))\n\ndatas=[]\nfor i in range(a):\n    datas.append(data2[i]-data1[i])\n\n\ndata4=min(datas)\n\nfor i in range(len(datas)):\n    for x in range(i,len(datas)):\n            if i==x:\n                data3=datas[x]\n            else:\n                if datas[x] <0:\n                    break\n                else:\n                    data3+=datas[x]\n    if data4<data3:\n        data4=data3\n\nprint(data4)",WRONG_ANSWER,17,2756
1591021836236820480,064270dabaa13edbd7238477860db0e46621a5ed4921e8aa2c0f9258e77722cc,2022-11-11 18:55:40,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    int a,b,c;\n    int answer=0;\n        scanf(\""%d,%d,%d\"",&a,&b,&c);\n    if(a<=100&&a>0&&b<=100&&b>0&&c<=100&&c>=0)\n   answer=a+b-c;\n    printf(\""%d\"",answer);\n}\n",WRONG_ANSWER,3,196
1591021854381355008,69d2f3a9da1c135d111e69327883b4d96c284e9c1c71370cc330a44458f95ab4,2022-11-11 18:55:44,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#define _CRT_SECURE_NO_WARNINGS\n#include <stdio.h>\nint main()\n{\n\tint X, Y, Z;\n\tscanf_s(\""%d %d %d\"", &X, &Y, &Z);\n\t\tprintf(\""%d\"", X + Y - Z);\n\t\treturn 0;\n}",COMPILE_ERROR,0,0
1591021871032766464,505c5b9a1b6d591a815315d95a57743fb98dad691b51421b4de282392fef3f43,2022-11-11 18:55:48,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a;\n    int i,j,sum,max=0;\n    scanf(\""%d\"",&a);\n    int l[a],o[a];\n    for (i=0;i<a;i++)\n        scanf(\""%d\"",&l[i]);\n    for (i=0;i<a;i++)\n        scanf(\""%d\"",&o[i]);\n    for (i=0;i<a;i++)\n    {\n        sum=0;\n        for(j=i;j<a;j++)\n        {\n            sum=sum-l[j]+o[j];\n            if(sum>max)\n                max=sum;\n        }\n\n    }\n    printf(\""%d\"",max);\n    return 0;\n}\n",ACCEPTED,3,324
1591021888518795264,361d4ab0fa1284b9bf8a3ba65da408861b894c5c0617b83f77f2c1d9a1a3ec92,2022-11-11 18:55:52,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"a,b,c=input().slipt()\nd=a+b-c\nprint(d)\n\n\n\n",NON_ZERO_EXIT_CODE,15,2760
1591021922664644608,69d2f3a9da1c135d111e69327883b4d96c284e9c1c71370cc330a44458f95ab4,2022-11-11 18:56:00,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"\n#include <stdio.h>\nint main()\n{\n\tint X, Y, Z;\n\tscanf(\""%d %d %d\"", &X, &Y, &Z);\n\t\tprintf(\""%d\"", X + Y - Z);\n\t\treturn 0;\n}",ACCEPTED,5,384
1591021974632075264,064270dabaa13edbd7238477860db0e46621a5ed4921e8aa2c0f9258e77722cc,2022-11-11 18:56:13,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    int a,b,c;\n    int answer=0;\n    scanf(\""%d,%d,%d\"",&a,&b,&c);\n    if(a<=100&&a>0&&b<=100&&b>0&&c<=100&&c>=0)\n   answer=a+b-c;\n    printf(\""%d\"",answer);\n}\n",WRONG_ANSWER,4,184
1591022008886956032,361d4ab0fa1284b9bf8a3ba65da408861b894c5c0617b83f77f2c1d9a1a3ec92,2022-11-11 18:56:21,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"a,b,c=input().slipt()\nd=int(a)+int(b)-int(c)\nprint(d)\n\n\n\n",NON_ZERO_EXIT_CODE,17,2820
1591022085093261312,361d4ab0fa1284b9bf8a3ba65da408861b894c5c0617b83f77f2c1d9a1a3ec92,2022-11-11 18:56:39,Python,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"a,b,c=input().split()\nd=int(a)+int(b)-int(c)\nprint(d)\n\n\n\n",ACCEPTED,36,2776
1591022104907157504,064270dabaa13edbd7238477860db0e46621a5ed4921e8aa2c0f9258e77722cc,2022-11-11 18:56:44,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint result(int x,int y,int z)\n{\n    int a=0;\n    a=x+y-z;\n    return a;\n}\nint main()\n{\n    int a,b,c;\n    int answer=0;\n        scanf(\""%d,%d,%d\"",&a,&b,&c);\n    if(a<=100&&a>0&&b<=100&&b>0&&c<=100&&c>=0)\n     answer=result(a,b,c);\n    printf(\""%d\"",answer);\nresult 0;\n}\n",COMPILE_ERROR,0,0
1591022142127386624,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-11 18:56:53,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=input()\nlist = map(eval,input().split())\nfor i in list:\n\n    if 0<=i<=1000000000 and a=a:\n        if i==0:\n            print(\""0\"")\n        else:\n            print(\""6\"")\n",COMPILE_ERROR,0,0
1591022162453004288,064270dabaa13edbd7238477860db0e46621a5ed4921e8aa2c0f9258e77722cc,2022-11-11 18:56:57,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint result(int x,int y,int z)\n{\n    int a=0;\n    a=x+y-z;\n    return a;\n}\nint main()\n{\n    int a,b,c;\n    int answer=0;\n        scanf(\""%d,%d,%d\"",&a,&b,&c);\n    if(a<=100&&a>0&&b<=100&&b>0&&c<=100&&c>=0)\n     answer=result(a,b,c);\n    printf(\""%d\"",answer);\nreturn 0;\n}\n",WRONG_ANSWER,3,344
1591022207319478272,02f3cf9a5ba39e00e2644b9392922d3ea3ea233f83c612c7dbd879f319ea2bdc,2022-11-11 18:57:08,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n   int t,n,i,m,a;\n   scanf(\""%d\"",&t);\n   for(i=0;i<t;i++)\n   {\n       scanf(\""%d\"",&n);\n       m=pow(6,n);\n       a=m%10;\n       printf(\""%d\"",a);\n       if(i+1<t)\n        printf(\""\\n\"");\n   }\n    return 0;\n}\n",WRONG_ANSWER,6,324
1591022591714832384,05322c7db848fe3ffcd527251ab80da608e98289cd6d6511d7c6e8436c4fdaf2,2022-11-11 18:58:40,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    long n,t,i；\n    scanf(\""%ld\"",&t);\n    for(i=0;i<3;i++){\n        print(\""6\\n\"");\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1591022619745386496,064270dabaa13edbd7238477860db0e46621a5ed4921e8aa2c0f9258e77722cc,2022-11-11 18:58:46,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint result(int x,int y,int z)\n{\n    int a=0;\n    a=x+y-z;\n    return a;\n}\nint main()\n{\n    int a,b,c;\n    int answer=0;\n        scanf(\""%d,%d,%d\"",&a,&b,&c);\n    if(a<=100&&a>0&&b<=100&&b>0&&c<=100&&c>=0)\n     answer=result(a,b,c);\n    printf(\""%d\"",answer);\nreturn 0;\n}\n",WRONG_ANSWER,2,320
1591022671410823168,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 18:58:59,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main(){\n    int x,y,z;\n    printf(\""请输入三个整数空格隔开：\"");\n    (void)scanf(\""%d %d %d\"",&x,&y,&z);\n    \n    printf(\""m=%d\"", x+y-z);\n    return 0;\n}",WRONG_ANSWER,3,192
1591022716830941184,05322c7db848fe3ffcd527251ab80da608e98289cd6d6511d7c6e8436c4fdaf2,2022-11-11 18:59:10,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    long n,t,i；\n    scanf(\""%ld\"",&t);\n    for(i=0;i<3;i++){\n        scanf(\""%ld\"",&n);\n        print(\""6\\n\"");\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1591022767221313536,05322c7db848fe3ffcd527251ab80da608e98289cd6d6511d7c6e8436c4fdaf2,2022-11-11 18:59:22,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,t,i；\n    scanf(\""%d\"",&t);\n    for(i=0;i<3;i++){\n        scanf(\""%d\"",&n);\n        print(\""6\\n\"");\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1591022775526035456,0cfbb4a339ebbc4dce13b5f3e3f98a3def0ab17ef5b4ac8e6d566de92e1f5f78,2022-11-11 18:59:24,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<stdbool.h>\n#define maxn 100001\n\nint prime[maxn];\nint num=0;\nbool p[maxn]={0};\n\nvoid find(int n){\n    for(int i=2;i<=n;i++){\n        if(p[i]==false){\n            prime[num++]=i;\n            for(int j=i+i;j<=n;j+=i){\n                p[j]=true;\n            }\n        }\n    }\n}\n\nint main(){\n    int count;\n    int n;\n    scanf(\""%d\"", &n);\n    find(n);\n    for(int i=0;i<num;i++){\n        count++;\n    }\n    printf(\""%d\"",count);\n    return 0;\n}\n",ACCEPTED,7,456
1591022827074031616,0c2907a154c1c61744366e94f73ae426665222ffae8eff7042dd0fd7bd8760fb,2022-11-11 18:59:36,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n\n\n{\nint n;\nint i;\nint data[n];\nif(n==0)\nprintf(\""1\"");\nelse{\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&data[i]);\nfor(i=0;i<n;i++)\n  {if(data[i]==0&&n==1)\n      printf(\""1\"");\n    if(i==n-1&&data[i]!=0)\n        printf(\""6\"");\n        else if(data[i]==0)\n            printf(\""1\\n\"");\n   else\n            printf(\""6\\n\""); }}\n\nreturn 0;\n}\n",WRONG_ANSWER,4,632
1591022845126311936,02f3cf9a5ba39e00e2644b9392922d3ea3ea233f83c612c7dbd879f319ea2bdc,2022-11-11 18:59:40,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n   int t,n,i,m,a;\n   scanf(\""%d\"",&t);\n   for(i=0;i<t;i++)\n   {\n       scanf(\""%d\"",&n);\n       m=pow(6,n);\n       a=m%10;\n       printf(\""%d\"",a);\n       if(i+1<t)\n        printf(\""\\n\"");\n   }\n    return 0;\n}\n",WRONG_ANSWER,7,308
1591022895357300736,02f3cf9a5ba39e00e2644b9392922d3ea3ea233f83c612c7dbd879f319ea2bdc,2022-11-11 18:59:52,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n   int t,n,i,m,a;\n   scanf(\""%d\"",&t);\n   for(i=0;i<t;i++)\n   {\n       scanf(\""%d\"",&n);\n       m=pow(6,n);\n       a=m%10;\n       printf(\""%d\"",a);\n       if(i+1<t)\n        printf(\""\\n\"");\n   }\n    return 0;\n}\n",WRONG_ANSWER,7,508
1591022917754884096,0c2907a154c1c61744366e94f73ae426665222ffae8eff7042dd0fd7bd8760fb,2022-11-11 18:59:58,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n\n\n{\nint n;\nint i;\n    scanf(\""%d\"",&n);\nint data[n];\nif(n==0)\nprintf(\""1\"");\nelse{\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&data[i]);\nfor(i=0;i<n;i++)\n  {if(data[i]==0&&n==1)\n      printf(\""1\"");\n    if(i==n-1&&data[i]!=0)\n        printf(\""6\"");\n        else if(data[i]==0)\n            printf(\""1\\n\"");\n   else\n            printf(\""6\\n\""); }}\n\nreturn 0;\n}\n",ACCEPTED,9,312
1591022995538251776,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-11 19:00:16,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d,%d,%d\"",&X,&Y,&Z);\n    printf(\""%d\"",X+Y-Z);\n    return 0;\n}\n",WRONG_ANSWER,3,344
1591023023258406912,0c2907a154c1c61744366e94f73ae426665222ffae8eff7042dd0fd7bd8760fb,2022-11-11 19:00:23,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n\n\n{\nint n;\nint i;\n    scanf(\""%d\"",&n);\nint data[n];\nif(n==0)\nprintf(\""1\"");\nelse{\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&data[i]);\nfor(i=0;i<n;i++)\n  {if(data[i]==0&&n==1)\n      printf(\""1\"");\n    if(i==n-1&&data[i]!=0)\n        printf(\""6\"");\n        else if(data[i]==0)\n            printf(\""1\\n\"");\n   else\n            printf(\""6\\n\""); }}\n\nreturn 0;\n}\n",ACCEPTED,9,200
1591023031084974080,064270dabaa13edbd7238477860db0e46621a5ed4921e8aa2c0f9258e77722cc,2022-11-11 19:00:25,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint result(int x,int y,int z)\n{\n    int a=0;\n    a=x+y-z;\n    return a;\n}\nint main()\n{\n    int a,b,c;\n    int answer=0;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    if(a<=100&&a>0&&b<=100&&b>0&&c<=100&&c>=0)\n     answer=result(a,b,c);\n    printf(\""%d\"",answer);\nreturn 0;\n}\n",ACCEPTED,7,472
1591023188795002880,05322c7db848fe3ffcd527251ab80da608e98289cd6d6511d7c6e8436c4fdaf2,2022-11-11 19:01:02,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    long n,t,i;\n    scanf(\""%ld\"",&t);\n    for(i=0;i<t;i++){\n        scanf(\""%ld\"",&n);\n        if(n==0) printf(\""1\\n\"");\n        else if(n>0) printf(\""6\\n\"");\n    }\n    return 0;\n}\n",ACCEPTED,9,352
1591023433142571008,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-11 19:02:00,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z;\n    0<=X,Y,Z<=100;\n    scanf(\""%d,%d,%d\"",&X,&Y,&Z);\n    printf(\""%d\"",X+Y-Z);\n    return 0;\n}\n",WRONG_ANSWER,3,184
1591023720116850688,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 19:03:09,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main(){\n    int x,y,z;\n    int num = 0;\n    printf(\""请输入三个整数空格隔开：\"");\n    scanf(\""%d\\n\"",&x);\n    if(x>=0 && x<100){\n        num = x;\n    }\n    \n    scanf(\""%d\\n\"",&y);\n    if(y>=0 && y<100){\n        num += y;\n    }\n    \n    scanf(\""%d\\n\"",&z);\n    if(y>=0 && y<100){\n        num -= z;\n    }\n    \n    printf(\""%d\"", num);\n    return 0;\n}",WRONG_ANSWER,3,188
1591023806762758144,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 19:03:29,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"for i in range(len(datas)):\n    for x in range(i,len(datas)):\n            if i==x:\n                data3=datas[x]\n            else:\n                if data3+datas[x] <0:\n                    break\n                else:\n                    data3+=datas[x]\n                    if  data4<data3:\n                        data4=data3",NON_ZERO_EXIT_CODE,17,2752
1591023822051020800,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-11 19:03:33,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=eval(input())\nlist = map(eval,input().split())\nfor i in list:\n    if 0<=i<=1000000000:\n        if i==0:\n            print(\""0\"")\n        if i!=0:\n            print(\""6\"")\nprint(/n)",COMPILE_ERROR,0,0
1591023858759569408,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 19:03:42,Python,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"a=int(input())\ndata1=list(map(int,input().split()))\ndata2=list(map(int,input().split()))\n\ndatas=[]\nfor i in range(a):\n    datas.append(data2[i]-data1[i])\n\n\ndata4=min(datas)\n\nfor i in range(len(datas)):\n    for x in range(i,len(datas)):\n            if i==x:\n                data3=datas[x]\n            else:\n                if data3+datas[x] <0:\n                    break\n                else:\n                    data3+=datas[x]\n                    if  data4<data3:\n                        data4=data3\n\nprint(data4)",ACCEPTED,15,2756
1591023859518734336,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-11 19:03:42,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=eval(input())\nlist = map(eval,input().split())\nfor i in list:\n    if 0<=i<=1000000000:\n        if i==0:\n            print(\""0\"")\n        if i!=0:\n            print(\""6\"")\nprint(/n)",NON_ZERO_EXIT_CODE,16,2904
1591023861955629056,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 19:03:43,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main(){\n    int x,y,z;\n    int num = 0;\n    printf(\""请输入三个整数空格隔开：\"");\n    (void)scanf(\""%d\\n\"",&x);\n    if(x>=0 && x<100){\n        num = x;\n    }\n    \n    (void)scanf(\""%d\\n\"",&y);\n    if(y>=0 && y<100){\n        num += y;\n    }\n    \n    (void)scanf(\""%d\\n\"",&z);\n    if(y>=0 && y<100){\n        num -= z;\n    }\n    \n    printf(\""%d\"", num);\n    return 0;\n}",WRONG_ANSWER,3,180
1591023892720824320,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-11 19:03:50,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z;\n    0<=X,Y,Z<=100;\n    printf(\""输入三个整数\"");\n    scanf(\""%d,%d,%d\"",&X,&Y,&Z);\n    printf(\""%d\"",X+Y-Z);\n    return 0;\n}\n",WRONG_ANSWER,3,324
1591023922911424512,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-11 19:03:57,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=eval(input())\nlist = map(eval,input().split())\nfor i in list:\n    if 0<=i<=1000000000:\n        if i==0:\n            print(\""0\"")\n        else:\n            print(\""6\"")",WRONG_ANSWER,35,2876
1591024120454774784,d830b0bcae7881ad6d1b2e2b14f3ffa3695b6d3bd622856493fa1cf903c9bf4e,2022-11-11 19:04:44,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint t = sc.nextInt();\n\t\twhile(t>0) {\n\t\t\tt--;\n\t\tint i = sc.nextInt();\n\t\tif(i==0) {System.out.print(1);}\n\t\telse {\n\t\t\tSystem.out.print(6);\n\t\t}\n\t\tSystem.out.print(\""\\n\"");\n\t\t\t}\n\t\t}\n\t}\n\n",WRONG_ANSWER,247,16956
1591024516288000000,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-11 19:06:19,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z;\n    0<=X,Y,Z<=100;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    printf(\""%d\"",X+Y-Z);\n    return 0;\n}\n",ACCEPTED,8,324
1591024666888699904,70c675ddfcb60b2192bc8ac38fb068fec0500208a5bf97a796c7cc074b43cf87,2022-11-11 19:06:55,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner myScanner = new Scanner(System.in);\n\t\tint n = myScanner.nextInt();\n\t\tint[] arr = new int[n];\n\t\tint x=0;\n\t\tfor(int i = 0;i < n;i++) {\n\t\t\tint a = myScanner.nextInt();\n\t\t\tarr[i] = a;\n\t\t\tif(arr[i] == 0) {\n\t\t\t\tx = 1;\n\t\t\t\tSystem.out.println(x);\n\t\t\t}else {\n\t\t\t\tx = 6;\n\t\t\t\tif(i == n-1) {\n\t\t\t\t\tSystem.out.printf(\""%d\"",x);\n\t\t\t\t}else {\n\t\t\t\t\tSystem.out.println(x);\n\t\t\t\t}\t\t\n\t\t\t}\n\t\t}\n\t}\n\n}",WRONG_ANSWER,275,16316
1591024781200240640,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 19:07:22,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main(){\n    int x,y,z;\n    int num = 0;\n    printf(\""请输入三个整数空格隔开：\"");\n    scanf(\""%d\\n\"",&x){};\n    if(x>=0 && x<100){\n        num = x;\n    }\n    \n    scanf(\""%d\\n\"",&y){};\n    if(y>=0 && y<100){\n        num += y;\n    }\n    \n    scanf(\""%d\\n\"",&z){};\n    if(y>=0 && y<100){\n        num -= z;\n    }\n    \n    printf(\""%d\"", num);\n    return 0;\n}",COMPILE_ERROR,0,0
1591024895683788800,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 19:07:49,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main(){\n    int x,y,z;\n    printf(\""请输入三个整数空格隔开：\"");\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    \n    printf(\""m=%d\"", x+y-z);\n    return 0;\n}",WRONG_ANSWER,5,348
1591025071492235264,005567a360a0c9b6f8e231cd1c8b4412544ad051819d303312c053cfc0049cc0,2022-11-11 19:08:31,Java,0.0,1590524835191705600,1572865591226855424,1049226928954454016,import java.util.Scanner\nclass sum{\n    public static void main(String args[]){\n         Scanner scan = new Scanner(System.in);\n         int x = scan.nextInt();\n          int y = scan.nextInt();\n           int z = scan.nextInt();\n          \n          if(x>=0 && x<= 100){\n          if(y>=0 && y<= 100){\n          if(z >=0 && z<= 100){\n          System.out.println(x+y-z);\n          }\n          }\n          }\n          }\n    }\n,COMPILE_ERROR,0,0
1591025115507261440,005567a360a0c9b6f8e231cd1c8b4412544ad051819d303312c053cfc0049cc0,2022-11-11 19:08:42,Java,0.0,1590524835191705600,1572865591226855424,1049226928954454016,import java.util.Scanner;\nclass sum{\n    public static void main(String args[]){\n         Scanner scan = new Scanner(System.in);\n         int x = scan.nextInt();\n          int y = scan.nextInt();\n           int z = scan.nextInt();\n          \n          if(x>=0 && x<= 100){\n          if(y>=0 && y<= 100){\n          if(z >=0 && z<= 100){\n          System.out.println(x+y-z);\n          }\n          }\n          }\n          }\n    }\n,COMPILE_ERROR,0,0
1591025189620617216,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 19:08:59,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,i,k,c=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n    { k=0;\n        for(j=2;j<=n;j++)\n            \n        {if(i%j==0)\n            k++;\n        if(k<2&&k>0)\n            c++;}}\n    printf(\""%d\"",c);\n    return 0;\n    \n}",COMPILE_ERROR,0,0
1591025228388564992,005567a360a0c9b6f8e231cd1c8b4412544ad051819d303312c053cfc0049cc0,2022-11-11 19:09:08,Java,0.0,1590524835191705600,1572865591226855424,1049226928954454016,import java.util.Scanner;\nclass sum{\n    public static void main(String args[]){\n         Scanner scan = new Scanner(System.in);\n         int x = scan.nextInt();\n          int y = scan.nextInt();\n           int z = scan.nextInt();\n          \n          if(x>=0 || x<= 100){\n          if(y>=0 || y<= 100){\n          if(z >=0 || z<= 100){\n          System.out.println(x+y-z);\n          }\n          }\n          }\n          }\n    }\n,COMPILE_ERROR,0,0
1591025239495081984,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 19:09:11,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,i,j,k,c=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n    { k=0;\n        for(j=2;j<=n;j++)\n            \n        {if(i%j==0)\n            k++;\n        if(k<2&&k>0)\n            c++;}}\n    printf(\""%d\"",c);\n    return 0;\n    \n}",TIME_LIMIT_EXCEEDED,1000,312
1591025265793347584,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-11-11 19:09:17,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""2022\\n\"");\n    return 0;\n}",ACCEPTED,4,604
1591025351898234880,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 19:09:38,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,i,j,k,c=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n    { k=0;\n        for(j=2;j<=n;j++)\n            \n        {if(i%j==0)\n            k++;\n        if(k<2&&k>0)\n            c++;}}\n    printf(\""%d\"",c);\n    return 0;\n    \n}",TIME_LIMIT_EXCEEDED,1000,324
1591025467719745536,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 19:10:05,Python,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"a=int(input())\ndata1=list(map(int,input().split()))\ndata2=list(map(int,input().split()))\n\ndatas=[]\nfor i in range(a):\n    datas.append(data2[i]-data1[i])\n\n\ndata4=0\nfor i in range(len(datas)):\n    for x in range(i,len(datas)):\n            if i==x:\n                data3=datas[x]\n            else:\n                if data3+datas[x] <0:\n                    break\n                else:\n                    data3+=datas[x]\n                    if  data4<data3:\n                        data4=data3\n\nprint(data4)",ACCEPTED,24,2756
1591025735140179968,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 19:11:09,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint a,i,j;\n    int count=0;\n\ta=scanf(\""%d\"",&a);\n\tfor(i=2;i<=a;i++)\n\t\t{\n\t\tfor(j=2;j<=i;j++)\n\t\t\tif(i%j==0)\n\t\t\t\tbreak;\n\t\tif(i==j)\n\t\t\tcount++;\n\t\t}\n    return 0;\n}",WRONG_ANSWER,3,192
1591025755331563520,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-11-11 19:11:14,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    printf(\""%d\\n\"",X+Y-Z);\n    return 0;\n}",ACCEPTED,8,328
1591025926186536960,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 19:11:55,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main(){\n    int x,y,z;\n    printf(\""请输入三个整数空格隔开：\"");\n    x=scanf(\""%d\"",&x);\n    y=scanf(\""%d\"",&y);\n    z=scanf(\""%d\"",&z);\n    printf(\""m=%d\"", x+y-z);\n    return 0;\n}",WRONG_ANSWER,3,196
1591025939608305664,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-11 19:11:58,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#define M 1000\n#define N 1000\nint main()\n{\n    int i,j,k,a[M],b[N],c[M],sum=0,num=0;\n    scanf(\""%d\"",&i);\n    for (j=0;j<i;j++)\n    {\n        scanf(\""%d\"",&a[j]);\n        \n    }\n    for (j=0;j<i;j++)\n    {\n        scanf(\""%d\"",&b[j]);\n        c[j]=b[j]-a[j];\n    }\n    for(j=0;j<i;j++)\n    {\n        for(k=j;k<i;k++)\n        {\n            sum+=c[k];\n            if(sum>num) num=sum;\n        }\n\n    }\n    printf(\""%d\\n\"",num);\n    return 0;\n}",WRONG_ANSWER,3,372
1591025971262722048,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 19:12:06,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main(){\n    int x,y,z;\n    printf(\""请输入三个整数空格隔开：\"");\n    x=scanf(\""%d\"",&x);\n    y=scanf(\""%d\"",&y);\n    z=scanf(\""%d\"",&z);\n    printf(\""%d\"", x+y-z);\n    return 0;\n}",WRONG_ANSWER,4,200
1591026075986100224,1c76961e293959cbfa749568290c58d912c131cbc4a710b8bd9a4e58eccf0b8e,2022-11-11 19:12:31,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a;\n    a=2022;\n    printf(\""%d\"",a);\n    return 0;\n}\n",ACCEPTED,3,368
1591026363841187840,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 19:13:39,Python,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"a=int(input())\ndata1=list(map(int,input().split()))\ndata2=list(map(int,input().split()))\n\ndatas=[]\nfor i in range(a):\n    datas.append(data2[i]-data1[i])\n\n\ndata4=0\nfor i in range(len(datas)):\n    for x in range(i,len(datas)):\n            if i==x:\n                data3=datas[x]\n            else:\n                if data3+datas[x] <0:\n                    break\n                else:\n                    data3+=datas[x]\n                    if  data4<data3:\n                        data4=data3\n\nprint(data4)",ACCEPTED,17,3004
1591026432946515968,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 19:13:56,Python,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"a=int(input())\ndata1=list(map(int,input().split()))\ndata2=list(map(int,input().split()))\n\ndatas=[]\nfor i in range(a):\n    datas.append(data2[i]-data1[i])\na=0\ndatass=[]\nfor i in range(len(datas)):\n    for x in range(i,len(datas)):\n        if x==i:\n            datass.append(datas[x])\n        else:\n            datass.append(sum(datas[i:x]))\nprint(max(datass))",ACCEPTED,16,2900
1591026449526624256,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 19:14:00,Python,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"a=int(input())\ndata1=list(map(int,input().split()))\ndata2=list(map(int,input().split()))\n\ndatas=[]\nfor i in range(a):\n    datas.append(data2[i]-data1[i])\na=0\ndatass=[]\nfor i in range(len(datas)):\n    for x in range(i,len(datas)):\n        if x==i:\n            datass.append(datas[x])\n        else:\n            datass.append(sum(datas[i:x]))\nprint(max(datass))",ACCEPTED,17,2880
1591026462138871808,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 19:14:03,Python,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"a=int(input())\ndata1=list(map(int,input().split()))\ndata2=list(map(int,input().split()))\n\ndatas=[]\nfor i in range(a):\n    datas.append(data2[i]-data1[i])\na=0\ndatass=[]\nfor i in range(len(datas)):\n    for x in range(i,len(datas)):\n        if x==i:\n            datass.append(datas[x])\n        else:\n            datass.append(sum(datas[i:x]))\nprint(max(datass))",ACCEPTED,18,3132
1591026485383729152,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 19:14:08,Python,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"a=int(input())\ndata1=list(map(int,input().split()))\ndata2=list(map(int,input().split()))\n\ndatas=[]\nfor i in range(a):\n    datas.append(data2[i]-data1[i])\n\n\ndata4=0\nfor i in range(len(datas)):\n    for x in range(i,len(datas)):\n            if i==x:\n                data3=datas[x]\n            else:\n                if data3+datas[x] <0:\n                    break\n                else:\n                    data3+=datas[x]\n                    if  data4<data3:\n                        data4=data3\n\nprint(data4)",ACCEPTED,18,2948
1591026497803038720,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 19:14:11,Python,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"a=int(input())\ndata1=list(map(int,input().split()))\ndata2=list(map(int,input().split()))\n\ndatas=[]\nfor i in range(a):\n    datas.append(data2[i]-data1[i])\n\n\ndata4=0\nfor i in range(len(datas)):\n    for x in range(i,len(datas)):\n            if i==x:\n                data3=datas[x]\n            else:\n                if data3+datas[x] <0:\n                    break\n                else:\n                    data3+=datas[x]\n                    if  data4<data3:\n                        data4=data3\n\nprint(data4)",ACCEPTED,17,2908
1591026514009853952,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 19:14:15,Python,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"a=int(input())\ndata1=list(map(int,input().split()))\ndata2=list(map(int,input().split()))\n\ndatas=[]\nfor i in range(a):\n    datas.append(data2[i]-data1[i])\n\n\ndata4=0\nfor i in range(len(datas)):\n    for x in range(i,len(datas)):\n            if i==x:\n                data3=datas[x]\n            else:\n                if data3+datas[x] <0:\n                    break\n                else:\n                    data3+=datas[x]\n                    if  data4<data3:\n                        data4=data3\n\nprint(data4)",ACCEPTED,17,2760
1591026629340626944,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 19:14:42,Python,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"a=int(input())\ndata1=list(map(int,input().split()))\ndata2=list(map(int,input().split()))\n\ndatas=[]\nfor i in range(a):\n    datas.append(data2[i]-data1[i])\n\n\ndata4=0\nfor i in range(len(datas)):\n    for x in range(i,len(datas)):\n            if i==x:\n                data3=datas[x]\n            else:\n                if data3+datas[x] <0:\n                    break\n                else:\n                    data3+=datas[x]\n                    data4=max(data4,data3)\n\nprint(data4)",ACCEPTED,16,2884
1591026641197924352,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-11 19:14:45,C++,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#define M 1000\n#define N 1000\nint main()\n{\n    int i,j,k,a[M],b[N],c[M],sum=0,num=0;\n    scanf(\""%d\"",&i);\n    for (j=0;j<i;j++)\n    {\n        scanf(\""%d\"",&a[j]);\n        \n    }\n    for (j=0;j<i;j++)\n    {\n        scanf(\""%d\"",&b[j]);\n        c[j]=b[j]-a[j];\n    }\n    for(j=0;j<i;j++)\n    {\n        sum=0;\n        for(k=j;k<i;k++)\n        {\n            sum+=c[k];\n            if(sum>num) num=sum;\n        }\n\n    }\n    printf(\""%d\\n\"",num);\n    return 0;\n}",ACCEPTED,4,196
1591026695111512064,63bdcc3416dd0c07c03f833ffb02c2f304a4f523deae6a87bed24a730e4d224d,2022-11-11 19:14:58,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\n int main()\n {\n     int x,y,z,sum;\n     sum=x+y-z;\n     scanf(\""%d %d %d\"",&x,&y,&z);\n     printf(\""%d\"",sum);\n     \n     \n     \n     \n     return 0;\n }",WRONG_ANSWER,4,192
1591026770873200640,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 19:15:16,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,i,j,k,c=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n    { k=0;\n        for(j=2;j<=n;j++)\n            \n        if(i%j==0)\n            k++;\n        if(k<2&&k>0)\n            c++;}\n    printf(\""%d\"",c);\n    return 0;\n    \n}",TIME_LIMIT_EXCEEDED,1000,496
1591026876271886336,1c76961e293959cbfa749568290c58d912c131cbc4a710b8bd9a4e58eccf0b8e,2022-11-11 19:15:41,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,b,c;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    printf(\""%d\"",a+b-c);\n    return 0;\n}\n",ACCEPTED,6,348
1591026932236488704,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 19:15:55,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main(){\n    int x,y,z;\n    int a,b,c;\n    printf(\""请输入三个整数空格隔开：\"");\n    a=scanf(\""%d\"",&x);\n    if(a>=0 && a<100){\n        x=a;\n    }\n    b=scanf(\""%d\"",&y);\n    if(b>=0 && b<100){\n        y=b;\n    }\n    c=scanf(\""%d\"",&z);\n    if(c>=0 && c<100){\n        z=c;\n    }\n    \n    printf(\""%d\"", x+y-z);\n    return 0;\n}",WRONG_ANSWER,3,352
1591027016349036544,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 19:16:15,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main(){\n    int x,y,z;\n    int a=b=c=0;\n    printf(\""请输入三个整数空格隔开：\"");\n    a=scanf(\""%d\"",&x);\n    if(a>=0 && a<100){\n        x=a;\n    }\n    b=scanf(\""%d\"",&y);\n    if(b>=0 && b<100){\n        y=b;\n    }\n    c=scanf(\""%d\"",&z);\n    if(c>=0 && c<100){\n        z=c;\n    }\n    \n    printf(\""%d\"", x+y-z);\n    return 0;\n}",COMPILE_ERROR,0,0
1591027048515153920,02f3cf9a5ba39e00e2644b9392922d3ea3ea233f83c612c7dbd879f319ea2bdc,2022-11-11 19:16:22,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n   int t,n,i,m,a;\n   scanf(\""%d\"",&t);\n   for(i=0;i<t;i++)\n   {\n       scanf(\""%d\"",&n);\n       m=pow(6,n);\n       a=m%10;\n       printf(\""%d\"",a);\n       if(i+1<t)\n        printf(\""\\n\"");\n   }\n    return 0;\n}\n",WRONG_ANSWER,8,488
1591027239569895424,928387ba90b7d3af095968a0f9e0198612ede46fbbd5d1ef0dd919da00a4d7ec,2022-11-11 19:17:08,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#define _CRT_SECURE_NO_WARNINGS 1\n#include<stdlib.h>\n#include<stdio.h>\nint main() {\n\tint a;\n\tscanf(\""%d\"", &a);\n\tprintf(\""%d\"",a);\t\n}",WRONG_ANSWER,3,320
1591027349305470976,63bdcc3416dd0c07c03f833ffb02c2f304a4f523deae6a87bed24a730e4d224d,2022-11-11 19:17:34,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\n int main()\n {\n     int x,y,z;\n     scanf(\""%d %d %d\"",&x,&y,&z);\n     printf(\""%d\"",x+y-z);\n     \n     \n     \n     \n     return 0;\n }",ACCEPTED,6,324
1591027434290458624,928387ba90b7d3af095968a0f9e0198612ede46fbbd5d1ef0dd919da00a4d7ec,2022-11-11 19:17:54,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#define _CRT_SECURE_NO_WARNINGS 1\n#include<stdlib.h>\n#include<stdio.h>\nint main() {\n\tprintf(\""2022\"");\t\n}",ACCEPTED,4,336
1591027541551415296,63bdcc3416dd0c07c03f833ffb02c2f304a4f523deae6a87bed24a730e4d224d,2022-11-11 19:18:20,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\n int main()\n {\n     int x,y,z;\n     scanf(\""%d %d %d\"",&x,&y,&z);\n     printf(\""%d\"",x+y-z);\n     \n     return 0;\n }",ACCEPTED,6,496
1591027945601282048,d830b0bcae7881ad6d1b2e2b14f3ffa3695b6d3bd622856493fa1cf903c9bf4e,2022-11-11 19:19:56,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n\nint main()\n{   \n    int t, i;\n    scanf(\""%d\"",&t);\n    while (t>0)\n    {\n        t--;\n        scanf(\""%d\"", &i);\n        if (i == 0) printf(\""1\"");\n        else\n        {\n            printf(\""6\"");\n        }\n        printf(\""\\n\"");\n    }\n    return 0;\n}",ACCEPTED,14,336
1591028108600324096,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 19:20:35,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint a,i,j;\n    int count=0;\n\ta=scanf(\""%d\"",&a);\n\tfor(i=2;i<=a;i++)\n\t\t{\n\t\tfor(j=2;j<=i;j++)\n\t\t\tif(i%j==0)\n\t\t\t\tbreak;\n\t\tif(i==j)\n\t\t\tcount++;\n\t\t}\n    return 0;\n}",WRONG_ANSWER,3,344
1591028314284818432,63bdcc3416dd0c07c03f833ffb02c2f304a4f523deae6a87bed24a730e4d224d,2022-11-11 19:21:24,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\n int main()\n {\n     int x,y,z,sum;\n     \n     scanf(\""%d %d %d\"",&x,&y,&z);\n     sum=x+y-z;\n     printf(\""%d\"",sum);\n     \n     return 0;\n }",ACCEPTED,6,316
1591028661594165248,928387ba90b7d3af095968a0f9e0198612ede46fbbd5d1ef0dd919da00a4d7ec,2022-11-11 19:22:47,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#define _CRT_SECURE_NO_WARNINGS 1\n#include<stdlib.h>\n#include<stdio.h>\nint main() {\n\tint x, y, z;\n\tscanf(\""%d %d %d\"", &x, &y, &z);\n\tprintf(\""%d\"",x+y-z);\t\n}",ACCEPTED,8,192
1591028753495556096,c47b15e117166a3dd00078b9f795673d5284a2761e582479119229751cc734d3,2022-11-11 19:23:09,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\n#include<stdio.h>\n#include<stdlib.h>\n#include<bits/stdc++.h>\n#include<math.h>\nusing namespace std;\nint fun(int n) {\n    if (n==0) return 1;\n    int t=6;\n    for (int i=0;i<n;++i) {\n        t=(t*t)%10;\n    }\nreturn t;\n}\n\nint main() {\n    int x;\n    cin >> x;\n    int n;\n    for (int i=0;i<x;++i) {\n        cin >> n;\n        cout << fun(n);\n        printf(\""\\n\"");\n    }\n    \n    return 0;\n}",ACCEPTED,14,472
1591029051291140096,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-11 19:24:20,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,a,X,Y,Z,x,y,z;\n    0<=n<=pow10(9);\n    scanf(\""%d\"",&n);\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    a = n%6;\n    x = X%6;\n    y = Y%6;\n    z = Z%6;\n    printf(\""%d\\n\"",a);\n    printf(\""%d\\n\"",x);\n    printf(\""%d\\n\"",y);\n    printf(\""%d\\n\"",z);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1591029154231943168,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 19:24:44,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"a=int(input())\ndata1=list(map(int,input().split()))\ndata2=list(map(int,input().split()))\n\ndatas=[]\nfor i in range(a):\n    datas.append(data2[i]-data1[i])\ndata4=min(datas)\nprint(datas)\nfor i in range(len(datas)):\n    for x in range(i,len(datas)):\n            if i==x:\n                data3=datas[x]\n            else:\n                if data3 <0:\n                    break\n                data3+=datas[x]\n                data4= data3 if  data4<data3 else data4\nprint(data4)",WRONG_ANSWER,16,2748
1591029168580636672,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 19:24:48,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"a=int(input())\ndata1=list(map(int,input().split()))\ndata2=list(map(int,input().split()))\n\ndatas=[]\nfor i in range(a):\n    datas.append(data2[i]-data1[i])\ndata4=min(datas)\nprint(datas)\nfor i in range(len(datas)):\n    for x in range(i,len(datas)):\n            if i==x:\n                data3=datas[x]\n            else:\n                if data3 <0:\n                    break\n                data3+=datas[x]\n                data4= data3 if  data4<data3 else data4\nprint(data4)",WRONG_ANSWER,15,2752
1591029195977830400,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-11-11 19:24:54,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"t=int(input())\nn=list(map(int,input().split(' ')))\nprint('6')\nprint('6')\nprint('6')",WRONG_ANSWER,16,2896
1591029253452402688,07d925df8d2026d3171a0a2ca84a6ef7f4a5b47a584cf47b66c5dd8f28139d1f,2022-11-11 19:25:08,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"n=int(input())\nX,Y,Z=map(eval,input().split())\nfor i in range(n):\n    print(\""6\"")",NON_ZERO_EXIT_CODE,17,2772
1591029325309214720,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 19:25:25,Java,300.0,1590524835191705600,1572865591226855424,1049226928954454016,import java.util.Scanner;\n\npublic class Main{\n    public static void main(String[] args){\n        Scanner sc = new Scanner(System.in);\n        int x = sc.nextInt();\n        int y = sc.nextInt();\n        int z = sc.nextInt();\n        \n        int m = 0;\n        m = x +y -z;\n        System.out.println(m);\n}\n},ACCEPTED,247,19404
1591029406397698048,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-11-11 19:25:45,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"t=int(input())\nn=list(map(int,input().split(' ')))\nprint(int('6'))\nprint(int('6'))\nprint(int('6'))",WRONG_ANSWER,18,2760
1591029905800888320,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 19:27:44,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,i,j,k,c=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n    { k=0;\n        for(j=2;j<=n;j++)\n            \n        if(i%j==0)\n        {k++;\n        if(k>1)break;}\n        if(k<2&&k>0)\n            c++;}\n    printf(\""%d\"",c);\n    return 0;\n    \n}",TIME_LIMIT_EXCEEDED,1000,440
1591029938189303808,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 19:27:51,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,i,j,k,c=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n    { k=0;\n        for(j=2;j<=n;j++)\n            \n        if(i%j==0)\n        {k++;\n        if(k>1)break;}\n        if(k<2&&k>0)\n            c++;}\n    printf(\""%d\"",c);\n    return 0;\n    \n}",TIME_LIMIT_EXCEEDED,1000,476
1591030297880236032,70c675ddfcb60b2192bc8ac38fb068fec0500208a5bf97a796c7cc074b43cf87,2022-11-11 19:29:17,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner myScanner = new Scanner(System.in);\n\t\tint n = myScanner.nextInt();\n\t\tint[] arr = new int[n];\n\t\tint x;\n\t\tfor(int i = 0;i < n;i++) {\n\t\t\tarr[i] = myScanner.nextInt();\n\t\t\tif(arr[i] == 0) {\n\t\t\t\tx = 1;\n\t\t\t}else {\n\t\t\t\tx = 6;\n\t\t\t}\n\t\t\tif(n == 1 || i == n-1) {\n\t\t\t\tSystem.out.printf(\""%d\"",x);\n\t\t\t}else {\n\t\t\t\tSystem.out.println(x);\n\t\t\t}\n\t\t}\n\t}\n\n}",WRONG_ANSWER,245,16536
1591031002552643584,69d2f3a9da1c135d111e69327883b4d96c284e9c1c71370cc330a44458f95ab4,2022-11-11 19:32:05,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint i,n,t,x=1;\n\tscanf(\""%d\"", &t);\n\tfor (int j = 0; j < t; j++)\n\t{\n\t\tscanf(\""%d\"", &n);\n\t\tfor (i = 0; i < n; i++)\n\t\t{\n\t\t\tx = x * 6;\n\t\t}\n\t\tprintf(\""%d\\n\"", x%10);\n\t}\n\treturn 0;\n}",WRONG_ANSWER,3,348
1591031090423332864,07d925df8d2026d3171a0a2ca84a6ef7f4a5b47a584cf47b66c5dd8f28139d1f,2022-11-11 19:32:26,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"count = 0\nn=eval(input())\nfor j in range(2,n):\n    for k in range(2,j):\n        if j%k == 0:\n            break\n    else:\n        count += 1\nprint(count)\n",TIME_LIMIT_EXCEEDED,1000,2904
1591031488072712192,f1feb45d46abad163f730e5b023ce1df76883054d0a1741228a76c2c69aa3eda,2022-11-11 19:34:01,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n,i,j,k;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=n;i>0;i--){\n        for(j=0;j<i-1;j++){\n            if(a[j]>a[j+1]){\n                k=a[j];\n                a[j]=a[j+1];\n                a[j+1]=k;\n            }\n        }\n    }\n    for(i=n;i>0;i++){\n        for(j=0;j<i-1;j++){\n            if(b[j]<b[j+1]){\n                k=b[j];\n                b[j]=b[j+1];\n                b[j+1]=k;\n            }\n        }\n    }\n    int x=0;\n    for(i=0;i<n;i++){\n        if(a[i]<b[i])\n            x=x+(b[i]-a[i]);\n    }\n    printf(\""%d\"",x);\n}",SEGMENTATION_FAULT,4,488
1591031574651535360,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-11 19:34:21,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n\tint t,n,i,j,a,sum=1,ge;\n\tscanf(\""%d\\n\"",&t);\n\tfor(i=0;i<t;i++){\n\t\tscanf(\""%d\"",&a);\n\t\tfor(j=0;j<a;j++){\n\t\t\tsum*=6;\n\t\t\tsum=sum%10;\n\t\t}\n\t\tprintf(\""%d\\n\"",sum);\n\t}\n}",TIME_LIMIT_EXCEEDED,23,180
1591031637926805504,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-11 19:34:37,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n\tint t,n,i,j,a,sum=1,ge;\n\tscanf(\""%d\\n\"",&t);\n\tfor(i=0;i<t;i++){\n\t\tscanf(\""%d\"",&a);\n\t\tfor(j=0;j<a;j++){\n\t\t\tsum*=6;\n\t\t\tsum=sum%10;\n\t\t}\n\t\tprintf(\""%d\\n\"",sum);\n\t}\n}",TIME_LIMIT_EXCEEDED,24,308
1591031736547475456,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-11 19:35:00,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n\tint t,n,i,j,a,sum=1,ge;\n\tscanf(\""%d\\n\"",&t);\n\tfor(i=0;i<t;i++){\n\t\tscanf(\""%d\"",&a);\n\t\tfor(j=0;j<a;j++){\n\t\t\tsum*=6;\n\t\t\tsum=sum%10;\n\t\t}\n\t\tprintf(\""%d\\n\"",sum);\n\t}\n}",TIME_LIMIT_EXCEEDED,22,196
1591031873717997568,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 19:35:33,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main{\n    public static void main(String[] args){\n    Scanner sc = new Scanner(System.in);\n        int n = sc.nextInt();\n        int count =0;\n        for(int i=1; i<=n; i++){ // 1~n遍历数\n            for(int j=1; j<=i/2; j++){ // 从1~n判断是不是素数\n                if(i%j == 0){\n                    count++;\n            }\n        }\n    }\n        System.out.println(count);\n    }\n},TIME_LIMIT_EXCEEDED,1000,16744
1591032145106219008,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-11 19:36:37,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n\tint t,n,i,j,sum=1;\n\tscanf(\""%d\\n\"",&t);\n\tfor(i=0;i<t;i++){\n\t\tscanf(\""%d\"",&n);\n\t\tfor(j=0;j<n;j++){\n\t\t\tsum*=6;\n\t\t\tsum=sum%10;\n\t\t}\n\t\tprintf(\""%d\\n\"",sum);\n\t}\n}",TIME_LIMIT_EXCEEDED,24,320
1591032286391373824,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 19:37:11,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main{\n    public static void main(String[] args){\n    Scanner sc = new Scanner(System.in);\n        int n = sc.nextInt();\n        int count =1;\n        for(int i=2; i<=n; i++){ // 1~n遍历数\n            for(int j=2; j<=sqrt(i); j++){ // 从1~n判断是不是素数\n                if(i%j == 0){\n                    count++;\n            }\n        }\n    }\n        System.out.println(count);\n    }\n},COMPILE_ERROR,0,0
1591032357438664704,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 19:37:28,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main{\n    public static void main(String[] args){\n    Scanner sc = new Scanner(System.in);\n        int n = sc.nextInt();\n        int count =1;\n        for(int i=2; i<=n; i++){ // 1~n遍历数\n            for(int j=2; j<=Math.sqrt(i); j++){ // 从1~n判断是不是素数\n                if(i%j == 0){\n                    count++;\n            }\n        }\n    }\n        System.out.println(count);\n    }\n},WRONG_ANSWER,254,19176
1591032485771784192,02b7d1c92f217004d473190b1dff822f66394a78b0b4e4ce3dd7f721ea04df1a,2022-11-11 19:37:59,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"print(\""2022\"")",COMPILE_ERROR,0,0
1591032714533318656,fe4cb768b5403507910f0aa3f234076c47d1d48fa85c6c69866cf97317a3b628,2022-11-11 19:38:53,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}\n",ACCEPTED,2,196
1591032734410145792,02b7d1c92f217004d473190b1dff822f66394a78b0b4e4ce3dd7f721ea04df1a,2022-11-11 19:38:58,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"print(\""2022\"")",ACCEPTED,16,2876
1591032740521250816,fe4cb768b5403507910f0aa3f234076c47d1d48fa85c6c69866cf97317a3b628,2022-11-11 19:38:59,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}\n",ACCEPTED,3,188
1591032783290544128,02b7d1c92f217004d473190b1dff822f66394a78b0b4e4ce3dd7f721ea04df1a,2022-11-11 19:39:10,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"print(\""2022\"")",ACCEPTED,16,2836
1591032953201799168,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-11 19:39:50,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n\tint t,n,i,j,sum=1;\n\tscanf(\""%d\\n\"",&t);\n\tfor(i=0;i<t;i++){\n\t\tscanf(\""%d\"",&n);\n\t\tfor(j=0;j<n;j++){\n\t\t\tsum*=6;\n\t\t\tsum=sum%10;\n\t\t}\n\t\tprintf(\""%d\\n\"",sum);\n\t}\n}",TIME_LIMIT_EXCEEDED,24,344
1591032983388205056,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 19:39:57,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"import java.util.Scanner;\n\npublic class Main{\n    public static void main(String[] args){\n    Scanner sc = new Scanner(System.in);\n        int n = sc.nextInt();\n        for(i=1;i<=100;i++){\n\t            for(j=2;j<i;j++){\n\t\t            if (i%j==0){\n\t\t                break;\n\t\t            }\n\t\t        }\n\t\t        if(i==j){\n\t\t            System.out.print(i + \""、\"");\n\t\t            count++;\n\t\t        }\n\t\t    }\n\t\tSystem.out.println(count);\n    }\n}",COMPILE_ERROR,0,0
1591033020247773184,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-11 19:40:06,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main(){\n    int X,Y,Z,res;\n    scanf(\""%d%d%d\\n\"",&X,&Y,&Z);\n    res=X+Y-Z;\n    printf(\""%d\"",res);\n    return 0;\n}",ACCEPTED,9,308
1591033059032498176,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 19:40:15,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"import java.util.Scanner;\n\npublic class Main{\n    public static void main(String[] args){\n    Scanner sc = new Scanner(System.in);\n        int n = sc.nextInt();\n        for(int i=1;i<=100;i++){\n\t            for(int j=2;j<i;j++){\n\t\t            if (i%j==0){\n\t\t                break;\n\t\t            }\n\t\t        }\n\t\t        if(i==j){\n\t\t            System.out.print(i + \""、\"");\n\t\t            count++;\n\t\t        }\n\t\t    }\n\t\tSystem.out.println(count);\n    }\n}",COMPILE_ERROR,0,0
1591033134039240704,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 19:40:33,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"import java.util.Scanner;\n\npublic class Main{\n    public static void main(String[] args){\n    Scanner sc = new Scanner(System.in);\n        int n = sc.nextInt();\n        int i,j;\n        for(int i=1;i<=100;i++){\n\t            for(int j=2;j<i;j++){\n\t\t            if (i%j==0){\n\t\t                break;\n\t\t            }\n\t\t        }\n\t\t        if(i==j){\n\t\t            System.out.print(i + \""、\"");\n\t\t            count++;\n\t\t        }\n\t\t    }\n\t\tSystem.out.println(count);\n    }\n}",COMPILE_ERROR,0,0
1591033386335014912,a2fa7eb1ab1c2f6fa23517852ee6971ea32fd0c7742d71d7914ed729415f04d9,2022-11-11 19:41:33,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint n,num=0,max=0;\n\tcin>>n;\n\tint a[n+1]={},b[n+1]={};\n\tfor(int i=1;i<=n;i++)\n\t    cin>>a[i];\n\tfor(int i=1;i<=n;i++)\n\t    cin>>b[i];\n    int i=1,j=1,m=n;\n\twhile(m>0)\n\t{\t\n       \tif(b[i]-a[i]<0)\n\t\t{\n\t\t\ti++;\n\t\t}\n\t\tif(b[i]-a[i]>0)\n\t\t{\t\t\n\t\t    j=i;\n\t\t    num=num+b[j]-a[j];\n\t\t    i++;\n\t\t\tif(num>max)\n\t\t\t    max=num;\n\t    }\n\t\tm--;    \t    \n    }\n\tcout<<max;\t\n\treturn 0;\n}",WRONG_ANSWER,4,440
1591033391015833600,505c5b9a1b6d591a815315d95a57743fb98dad691b51421b4de282392fef3f43,2022-11-11 19:41:35,Python,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"n=int(input())\nfrom  math import sqrt\ndef is_prime(n):\n    if n==1:\n        return False\n    for i in range(2,int(sqrt(n))+1):\n        if n%i==0:\n            return False\n    return True\ncount = 0\nfor i in range(1,n):\n    if is_prime(i):\n        count=count+1\nprint(count)\n",ACCEPTED,167,2816
1591033429733474304,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-11 19:41:44,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int n,i,j;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    int sum[n]={0},max[n];\n    for(j=0;j<n;j++)\n    {\n    \tmax[j]=b[j]-a[j];\n\t\tfor(i=j;i<n;i++)\n    {\n        sum[j]+=b[i]-a[i];\n        if(sum[j]>max[j]) max[j]=sum[j];\n    }\n    }\n    int maxi=max[0];\n    for(i=0;i<n;i++)\n    {\n\t\t\tif(max[i]>maxi) maxi=max[i];\n    }\n    printf(\""%d\\n\"",maxi);\n  // printf(\""%d\\n\"",max[1]);\n    return 0;\n}",COMPILE_ERROR,0,0
1591033999978467328,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-11-11 19:44:00,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,t=int(input())\nn=int(input())\nm=str(6**n)\nprint(m[-1]),NON_ZERO_EXIT_CODE,16,2776
1591034020656386048,f1feb45d46abad163f730e5b023ce1df76883054d0a1741228a76c2c69aa3eda,2022-11-11 19:44:05,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n,i,j,k;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    int x=0;\n    for(i=0;i<n;i++){\n        if(a[i]<b[i])\n            x=x+(b[i]-a[i]);\n    }\n    printf(\""%d\"",x);\n}",WRONG_ANSWER,3,312
1591034183089172480,f1feb45d46abad163f730e5b023ce1df76883054d0a1741228a76c2c69aa3eda,2022-11-11 19:44:43,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n,i,j,k;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    int x=0;\n    for(i=0;i<n;i++){\n        if(a[i]<b[i]){\n            x=x+(b[i]-a[i]);\n            break;\n        }\n    }\n    printf(\""%d\"",x);\n}",WRONG_ANSWER,4,472
1591034216970784768,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-11 19:44:51,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int n,i,j;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    int sum,max[n];\n    for(j=0;j<n;j++)\n    {\n    \tsum=0;\n    \tmax[j]=b[j]-a[j];\n\t\tfor(i=j;i<n;i++)\n    {\n        sum+=b[i]-a[i];\n        if(sum>max[j]) max[j]=sum;\n    }\n    }\n    int maxi=max[0];\n    for(i=0;i<n;i++)\n    {\n\t\t\tif(max[i]>maxi) maxi=max[i];\n    }\n    printf(\""%d\\n\"",maxi);\n    return 0;\n}",ACCEPTED,5,344
1591034220238143488,f1feb45d46abad163f730e5b023ce1df76883054d0a1741228a76c2c69aa3eda,2022-11-11 19:44:52,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n,i;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    int x=0;\n    for(i=0;i<n;i++){\n        if(a[i]<b[i]){\n            x=x+(b[i]-a[i]);\n            break;\n        }\n    }\n    printf(\""%d\"",x);\n}",WRONG_ANSWER,3,324
1591034392313659392,a2fa7eb1ab1c2f6fa23517852ee6971ea32fd0c7742d71d7914ed729415f04d9,2022-11-11 19:45:33,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint n,num=0,max=0;\n\tcin>>n;\n\tint a[n+1]={},b[n+1]={};\n\tfor(int i=1;i<=n;i++)\n\t    cin>>a[i];\n\tfor(int i=1;i<=n;i++)\n\t    cin>>b[i];\n    int i=1,j=1,m=n;\n\twhile(m>0)\n\t{\t\n       \tif(b[i]-a[i]<0)\n\t\t{\n\t\t\ti++;\n\t\t}\n\t\tif(b[i]-a[i]>0)\n\t\t{\t\t\n\t\t    j=i;\n\t\t    num=num+b[j]-a[j];\n\t\t    j++;\n\t\t\tif(num>max)\n\t\t\t    max=num;\n\t\t    i=j;\n\t    } \n\t\tm=n-i;   \t    \n    }\n\tcout<<max;\t\n\treturn 0;\n}",WRONG_ANSWER,5,384
1591034448999657472,f1feb45d46abad163f730e5b023ce1df76883054d0a1741228a76c2c69aa3eda,2022-11-11 19:45:47,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n,i;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    int x=0;\n    for(i=0;i<n;i++){\n        if(a[i]<b[i]){\n            x=x+(b[i]-a[i]);\n        else\n            break;\n        }\n    }\n    printf(\""%d\"",x);\n}",COMPILE_ERROR,0,0
1591034493593518080,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-11 19:45:57,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n\tint t,n,i,j,sum=1;\n\tscanf(\""%d\"",&t);\n\tfor(i=0;i<t;i++){\n\t\tscanf(\""%d\"",&n);\n\t\tfor(j=0;j<n;j++){\n\t\t\tsum*=6;\n\t\t\tsum=sum%10;\n\t\t}\n\t\tprintf(\""%d\\n\"",sum);\n\t}\n}",TIME_LIMIT_EXCEEDED,24,524
1591034494650482688,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-11-11 19:45:58,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,t=int(input())\nn=int(input())\nprint(str(6 ** n)[-1]),NON_ZERO_EXIT_CODE,19,2748
1591034538061529088,f1feb45d46abad163f730e5b023ce1df76883054d0a1741228a76c2c69aa3eda,2022-11-11 19:46:08,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n,i;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    int x=0;\n    for(i=0;i<n;i++){\n        if(a[i]<b[i])\n            x=x+(b[i]-a[i]);\n        else\n            break;\n    }\n    printf(\""%d\"",x);\n}",WRONG_ANSWER,3,332
1591034847894745088,a2fa7eb1ab1c2f6fa23517852ee6971ea32fd0c7742d71d7914ed729415f04d9,2022-11-11 19:47:22,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint n,num=0,max=0;\n\tcin>>n;\n\tint a[n+1]={},b[n+1]={};\n\tfor(int i=1;i<=n;i++)\n\t    cin>>a[i];\n\tfor(int i=1;i<=n;i++)\n\t    cin>>b[i];\n    int i=1,j=1,m=n;\n\twhile(m>0)\n\t{\t\n       \tif(b[i]-a[i]<0)\n\t\t{\n\t\t\ti++;\n\t\t}\n\t\tif(b[i]-a[i]>0)\n\t\t{\t\t\n\t\t    j=i;\n\t\t    num=num+b[j]-a[j];\n\t\t    i++;\n\t\t\tif(num>max)\n\t\t\t    max=num;\n\t    } \n\t\tm=n-i;   \t    \n    }\n\tcout<<max;\t\n\treturn 0;\n}",WRONG_ANSWER,4,448
1591035115810107392,0cfbb4a339ebbc4dce13b5f3e3f98a3def0ab17ef5b4ac8e6d566de92e1f5f78,2022-11-11 19:48:26,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#define N 100\nint power[N]={0};\nint p[N]={0};\nint a[N];\nint b[N];\n\nvoid max(int n){\n    int count=0;\n    for(int i=1;i<=n;i++){\n        power[i]=power[i-1]+b[i-1]-a[i-1];\n        if(power[i]>power[i-1]){\n            p[i]=power[i];\n            count++;\n        }\n    }\n    printf(\""%d\"",p[count]);\n}\n\nint main(){\n    int n;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(int j=0;j<n;j++){\n        scanf(\""%d\"",&b[j]);\n    }\n    max(n);\n    return 0;\n}\n",WRONG_ANSWER,3,316
1591035159590273024,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-11-11 19:48:36,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,t=int(input())\nn=int(input())\nprint(6 ** n % 10),NON_ZERO_EXIT_CODE,15,2756
1591035487354138624,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-11 19:49:54,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int n,i,j;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    int maxi;\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    int sum,max[n];\n    for(j=0;j<n;j++)\n    {\n    \tsum=0;\n    \tmax[j]=b[j]-a[j];\n\t\tfor(i=j;i<n;i++)\n    {\n        sum+=b[i]-a[i];\n        if(sum>max[j]) max[j]=sum;\n    }\n       maxi=max[0];\n       if(max[j]>maxi) maxi=max[j];\n    }\n    printf(\""%d\\n\"",maxi);\n    return 0;\n}",WRONG_ANSWER,4,316
1591035693088968704,0cfbb4a339ebbc4dce13b5f3e3f98a3def0ab17ef5b4ac8e6d566de92e1f5f78,2022-11-11 19:50:43,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#define N 100\nint power[N]={0};\nint p[N]={0};\nint a[N];\nint b[N];\n\nvoid max(int n){\n    int count=0;\n    for(int i=1;i<=n;i++){\n        power[i]=power[i-1]+b[i-1]-a[i-1];\n        if(power[i]>power[i-1]&&power[i]>power[i+1]){\n            p[i]=power[i];\n            count++;\n        }\n    }\n    printf(\""%d\"",p[count]);\n}\n\nint main(){\n    int n;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(int j=0;j<n;j++){\n        scanf(\""%d\"",&b[j]);\n    }\n    max(n);\n    return 0;\n}\n",WRONG_ANSWER,3,312
1591035843177938944,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-11-11 19:51:19,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"t=int(input())\nfor i in range(0,t):\n    n=int(input())\n    print(6 ** n % 10)",NON_ZERO_EXIT_CODE,18,2868
1591035927005278208,fcd2977b4c22a60099600d5e778d0e9f76a606fba12f6b655067a73cf20ea3a7,2022-11-11 19:51:39,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int n,i,j;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    int maxi=0;\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    int sum,max[n];\n    for(j=0;j<n;j++)\n    {\n    \tsum=0;\n    \tmax[j]=b[j]-a[j];\n\t\tfor(i=j;i<n;i++)\n    {\n        sum+=b[i]-a[i];\n        if(sum>max[j]) max[j]=sum;\n    }\n     //  maxi=max[0];\n       if(max[j]>maxi) maxi=max[j];\n    }\n    printf(\""%d\\n\"",maxi);\n    return 0;\n}",ACCEPTED,3,192
1591036084853735424,0cfbb4a339ebbc4dce13b5f3e3f98a3def0ab17ef5b4ac8e6d566de92e1f5f78,2022-11-11 19:52:17,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#define N 100\nint power[N]={0};\nint p[N]={0};\nint a[N];\nint b[N];\n\nvoid max(int n){\n    int count=0;\n    for(int i=1;i<=n;i++){\n        power[i]=power[i-1]+b[i-1]-a[i-1];\n        if(power[i]>power[i-1]&&power[i]>power[i+1]){\n            p[i]=power[i];\n            count++;\n        }\n    }\n    printf(\""%d\"",p[count]);\n}\n\nint main(){\n    int n;\n    scanf(\""%d\"",&n);\n    if(n==0){\n        printf(\""0\"");\n    }\n    for(int i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(int j=0;j<n;j++){\n        scanf(\""%d\"",&b[j]);\n    }\n    max(n);\n    return 0;\n}\n",WRONG_ANSWER,3,184
1591036514849566720,5d1852a153062cc8297ed7a30bb643375395a70654d5dff506fad6bc186e81bd,2022-11-11 19:53:59,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"public class dwda {\n\n\tpublic static void main(String[] args) {\n\t\tSystem.out.println(\""2022\"");\n\t}\n\n}\n",COMPILE_ERROR,0,0
1591036610660073472,5d1852a153062cc8297ed7a30bb643375395a70654d5dff506fad6bc186e81bd,2022-11-11 19:54:22,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"public class test {\n\n\tpublic static void main(String[] args) {\n\t\tSystem.out.println(\""2022\"");\n\t}\n\n}\n",COMPILE_ERROR,0,0
1591036621011615744,c47b15e117166a3dd00078b9f795673d5284a2761e582479119229751cc734d3,2022-11-11 19:54:25,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n\n#define MAX 100\n\n\nint main() {\n   int z=0,n,m=0,i,j;\n   int str1[MAX];\n   int str2[MAX];\n   int str3[MAX];\n   scanf(\""%d\"",&n);\n   for (i=0;i<n;i++)\n    scanf(\""%d\"",&str1[i]);\n\n   for (i=0;i<n;i++)\n    scanf(\""%d\"",&str2[i]);\n\n    for (i=0;i<n;i++)\n        str3[i]=str2[i]-str1[i];\n    for (i=0;i<n;i++)\n    {\n         m+=str3[i];\n         if(m>z)\n            z=m;\n         else break;\n\n\n    }\n    printf(\""%d\"",z);\n\n\n\n\n    return 0;\n}",WRONG_ANSWER,4,320
1591036699818393600,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-11-11 19:54:43,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,t=int(input())\nn=int(input())\nnum=str(6**n)\nprint(num[-1]),NON_ZERO_EXIT_CODE,17,2756
1591036706290184192,c47b15e117166a3dd00078b9f795673d5284a2761e582479119229751cc734d3,2022-11-11 19:54:45,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n\n#define MAX 100\n\n\nint main() {\n   int z=0,n,m=0,i,j;\n   int str1[MAX];\n   int str2[MAX];\n   int str3[MAX];\n   scanf(\""%d\"",&n);\n   for (i=0;i<n;i++)\n    scanf(\""%d\"",&str1[i]);\n\n   for (i=0;i<n;i++)\n    scanf(\""%d\"",&str2[i]);\n\n    for (i=0;i<n;i++)\n        str3[i]=str2[i]-str1[i];\n    for (i=0;i<n;i++)\n    {\n         m+=str3[i];\n         if(m>z)\n            z=m;\n         else break;\n\n\n    }\n    printf(\""%d\"",z);\n\n\n\n\n    return 0;\n}",WRONG_ANSWER,5,256
1591036759855661056,5d1852a153062cc8297ed7a30bb643375395a70654d5dff506fad6bc186e81bd,2022-11-11 19:54:58,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"packge test;\npublic class test {\n\n\tpublic static void main(String[] args) {\n\t\tSystem.out.println(\""2022\"");\n\t}\n\n}\n",COMPILE_ERROR,0,0
1591036868966289408,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-11 19:55:24,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n\tint t,n,i,sum=1;\n\tscanf(\""%d\\n\"",&t);\n\tfor(i=0;i<t;i++){\n\t\tscanf(\""%d\"",&n);\n\t\tsum=pow(6,n)%10;\n\t\tprintf(\""%d\\n\"",sum);\n\t}\n}",COMPILE_ERROR,0,0
1591037034221867008,5d1852a153062cc8297ed7a30bb643375395a70654d5dff506fad6bc186e81bd,2022-11-11 19:56:03,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"\npublic class test {\n\tpublic static void main(String[] args) {\n\t\tSystem.out.println(\""2022\"");\n\t}\n\n}\n",COMPILE_ERROR,0,0
1591037113062174720,5d1852a153062cc8297ed7a30bb643375395a70654d5dff506fad6bc186e81bd,2022-11-11 19:56:22,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"\npublic class test {\n\tpublic static void main(String[] args) {\n\t\tSystem.out.println(\""2022\"");\n\t}\n\n}\n",COMPILE_ERROR,0,0
1591037154069909504,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 19:56:32,Python,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"a=int(input())\ndata1=list(map(int,input().split()))\ndata2=list(map(int,input().split()))\n\ndatas=[]\nfor i in range(a):\n    datas.append(data2[i]-data1[i])\ndata4=min(datas)\n# print(datas)\nfor i in range(len(datas)):\n    for x in range(i,len(datas)):\n            if i==x:\n                data3=datas[x]\n            else:\n                if data3+datas[x] <0:\n                    break\n               \n                data3+=datas[x]\n                data4= data3 if  data4<data3 else data4\nprint(data4)",ACCEPTED,21,2968
1591037242649415680,5d1852a153062cc8297ed7a30bb643375395a70654d5dff506fad6bc186e81bd,2022-11-11 19:56:53,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"\n\tpublic static void main(String[] args) {\n\t\tSystem.out.println(\""2022\"");\n\t}\n\n",COMPILE_ERROR,0,0
1591037248211058688,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-11 19:56:54,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=eval(input())\nlist = map(eval,input().split())\nfor i in list:\n    if 0<=i<=1000000000:\n        if i==0:\n            print(\""1\"")\n        else:\n            print(\""6\"")",WRONG_ANSWER,32,2880
1591037267660025856,f1feb45d46abad163f730e5b023ce1df76883054d0a1741228a76c2c69aa3eda,2022-11-11 19:56:59,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n,i,j;\n    int x=0,y=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n        c[i]=b[i]-a[i];\n    for(i=0;i<n;i++){\n        for(j=i;j<n;j++){\n            y+=c[j];\n            if(y>x)\n                x=y;\n        }\n    }\n    printf(\""%d\"",x);\n}",WRONG_ANSWER,3,452
1591037301763932160,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-11 19:57:07,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n\tint t,n,i,sum=1;\n\tscanf(\""%d\\n\"",&t);\n\tfor(i=0;i<t;i++){\n\t\tscanf(\""%d\"",&n);\n\t\tsum=pow(6,n);\n        sum=sum%10;\n\t\tprintf(\""%d\\n\"",sum);\n\t}\n}",WRONG_ANSWER,8,344
1591037386832809984,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 19:57:27,Python,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"a=int(input())\ndata1=list(map(int,input().split()))\ndata2=list(map(int,input().split()))\n\ndatas=[]\nfor i in range(a):\n    datas.append(data2[i]-data1[i])\ndata4=min(datas)\n# print(datas)\nfor i in range(len(datas)):\n    for x in range(i,len(datas)):\n            if i==x:\n                data3=datas[x]\n            else:\n                if data3<0:\n                    break\n               \n                data3+=datas[x]\n                data4= data3 if  data4<data3 else data4\nprint(data4)",ACCEPTED,18,2764
1591037400179060736,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 19:57:30,Python,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"a=int(input())\ndata1=list(map(int,input().split()))\ndata2=list(map(int,input().split()))\n\ndatas=[]\nfor i in range(a):\n    datas.append(data2[i]-data1[i])\ndata4=min(datas)\n# print(datas)\nfor i in range(len(datas)):\n    for x in range(i,len(datas)):\n            if i==x:\n                data3=datas[x]\n            else:\n                if data3<0:\n                    break\n               \n                data3+=datas[x]\n                data4= data3 if  data4<data3 else data4\nprint(data4)",ACCEPTED,16,3064
1591037410027307008,4e8bf5e988ac4275aeb23eae913a385055ab79de14dc27373b9e62a15269d138,2022-11-11 19:57:33,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,print(2022),COMPILE_ERROR,0,0
1591037456391143424,f1feb45d46abad163f730e5b023ce1df76883054d0a1741228a76c2c69aa3eda,2022-11-11 19:57:44,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n,i,j;\n    int x=0,y=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n        c[i]=b[i]-a[i];\n    for(i=0;i<n;i++){\n        for(j=i;j<n;j++){\n            y+=c[j];\n            if(y>x)\n                x=y;\n        }\n    }\n    printf(\""%d\"",x);\n}",WRONG_ANSWER,3,340
1591037487089254400,c3cd14f35a8796e3a62f8cb6f4fc316eb939d8fb951152a336f034c1ffa23fad,2022-11-11 19:57:51,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n\tint a=2022;\n\tprintf(\""%d\"",a);\n\treturn 0;\n } ",ACCEPTED,3,180
1591037577182883840,4e8bf5e988ac4275aeb23eae913a385055ab79de14dc27373b9e62a15269d138,2022-11-11 19:58:13,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,print(2022),ACCEPTED,17,2820
1591037705868345344,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-11 19:58:43,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n\tint t,n,i,sum=1;\n\tscanf(\""%d\\n\"",&t);\n\tfor(i=0;i<t;i++){\n\t\tscanf(\""%d\"",&n);\n\t\tsum=pow(6,n);\n        sum=sum%10;\n\t\tprintf(\""%d\\n\"",sum);\n\t}\n}",WRONG_ANSWER,6,580
1591037711094427648,5d1852a153062cc8297ed7a30bb643375395a70654d5dff506fad6bc186e81bd,2022-11-11 19:58:45,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main(){\n    printf(\""2022\"");\n    return 0;\n}\n",ACCEPTED,4,348
1591037751846305792,0cfbb4a339ebbc4dce13b5f3e3f98a3def0ab17ef5b4ac8e6d566de92e1f5f78,2022-11-11 19:58:54,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#define N 100\nint power[N]={0};\nint p[N]={0};\nint a[N];\nint b[N];\n\nvoid max(int n){\n    int count=0;\n    int maxn=0;\n    for(int i=1;i<=n;i++){\n        power[i]=power[i-1]+b[i-1]-a[i-1];\n        if(power[i]>power[i-1]&&power[i]>power[i+1]){\n            p[i]=power[i];\n            count++;\n        }\n    }\n    for(int j=1;j<=count;j++){\n        if(p[j]>maxn){\n            maxn=p[j];\n        }\n    }\n    printf(\""%d\"",maxn);\n}\n\nint main(){\n    int n;\n    scanf(\""%d\"",&n);\n    if(n==0){\n        printf(\""0\"");\n    }\n    for(int i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(int j=0;j<n;j++){\n        scanf(\""%d\"",&b[j]);\n    }\n    max(n);\n    return 0;\n}\n",WRONG_ANSWER,4,200
1591037853465903104,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 19:59:18,Python,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"a=int(input())\ndata1=list(map(int,input().split()))\ndata2=list(map(int,input().split()))\n\ndatas=[]\nfor i in range(a):\n    datas.append(data2[i]-data1[i])\ndata4=min(datas)\n# print(datas)\nfor i in range(len(datas)):\n    for x in range(i,len(datas)):\n            if i==x:\n                data3=datas[x]\n            else:\n               \n               \n                data3+=datas[x]\n                data4= data3 if  data4<data3 else data4\nprint(data4)",ACCEPTED,18,2756
1591037854506094592,4e8bf5e988ac4275aeb23eae913a385055ab79de14dc27373b9e62a15269d138,2022-11-11 19:59:19,Python,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"a,b,c=input().split()\nd=int(a)+int(b)-int(c)\nprint(d)",ACCEPTED,35,2888
1591037876425527296,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 19:59:24,Python,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"a=int(input())\ndata1=list(map(int,input().split()))\ndata2=list(map(int,input().split()))\n\ndatas=[]\nfor i in range(a):\n    datas.append(data2[i]-data1[i])\ndata4=min(datas)\n# print(datas)\nfor i in range(len(datas)):\n    for x in range(i,len(datas)):\n            if i==x:\n                data3=datas[x]\n            else:\n               \n               \n                data3+=datas[x]\n                data4= data3 if  data4<data3 else data4\nprint(data4)",ACCEPTED,16,2748
1591037898466570240,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-11-11 19:59:29,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n    int i,n,x,y,z;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&x);\n        y=pow(6,n);\n        z=y%10;\n        printf(\""%d\\n\"",z);\n    }\n    return 0;\n}",WRONG_ANSWER,10,472
1591038206240403456,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-11 20:00:43,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n\tint t,n,i,a,sum=1;\n\tscanf(\""%d\\n\"",&t);\n\tfor(i=0;i<t;i++){\n\t\tscanf(\""%d\"",&n);\n\t\tsum=pow(6,n);\n        sum=sum%10;\n\t\tprintf(\""%d\\n\"",sum);\n\t}\n}",WRONG_ANSWER,7,340
1591038262620262400,f1feb45d46abad163f730e5b023ce1df76883054d0a1741228a76c2c69aa3eda,2022-11-11 20:00:56,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n,i,j;\n    int x=0,y=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n        c[i]=b[i]-a[i];\n    for(i=0;i<n;i++){\n        for(j=i;j<n;j++){\n            y+=c[j];\n            if(y>x)\n                x=y;\n        }\n    }\n    printf(\""%d\\n\"",x);\n}",WRONG_ANSWER,4,632
1591038293087682560,5d1852a153062cc8297ed7a30bb643375395a70654d5dff506fad6bc186e81bd,2022-11-11 20:01:03,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main(){\n    int x,y,z;\n    scanf(\""%d,%d,%d\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n    return 0;\n}",WRONG_ANSWER,4,336
1591038390076772352,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-11 20:01:26,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<>\nint main()\n{\n    scanf(\""2022\"");\n    return 0;\n}",COMPILE_ERROR,0,0
1591038395202211840,f1feb45d46abad163f730e5b023ce1df76883054d0a1741228a76c2c69aa3eda,2022-11-11 20:01:28,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n,i,j;\n    int x=0,y=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n        c[i]=b[i]-a[i];\n    for(i=0;i<n;i++){\n        for(j=i;j<n;j++){\n            y+=c[j];\n            if(y>x)\n                x=y;\n        }\n    }\n    printf(\""%d\\n\"",x);\n}",WRONG_ANSWER,3,312
1591038427376717824,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-11-11 20:01:35,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,t=int(input())\nn=int(input())\nnum=str(6**n)\nprint(num[-1]),NON_ZERO_EXIT_CODE,18,2748
1591038437795344384,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-11 20:01:38,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n\tint t,n,i,sum=1;\n\tscanf(\""%d\\n\"",&t);\n\tfor(i=0;i<t;i++){\n\t\tscanf(\""%d\"",&n);\n\t\tsum=pow(6,n);\n        sum=sum%10;\n\t\tprintf(\""%d\"",sum);\n\t}\n}",WRONG_ANSWER,8,308
1591038439229820928,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-11 20:01:38,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<>\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",COMPILE_ERROR,0,0
1591038471463047168,5d1852a153062cc8297ed7a30bb643375395a70654d5dff506fad6bc186e81bd,2022-11-11 20:01:46,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main(){\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n    return 0;\n}",ACCEPTED,7,492
1591038471513354240,ef50cfe7f34b26d29f617c97ac65d40bd15ba1e063897a190284243de955e254,2022-11-11 20:01:46,Java,300.0,1590524835191705600,1572865591226855424,1049226928954454016,import java.util.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args){\n\t    Scanner sc=new Scanner(System.in);\n\t    int x=sc.nextInt();\n\t    int y=sc.nextInt();\n\t    int z=sc.nextInt();\n\t    System.out.print(x+y-z);\n\t}\n\t\n},ACCEPTED,248,18944
1591038525800230912,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-11 20:01:59,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n\tint t,n,i,sum;\n\tscanf(\""%d\\n\"",&t);\n\tfor(i=0;i<t;i++){\n\t\tscanf(\""%d\"",&n);\n\t\tsum=pow(6,n);\n        sum=sum%10;\n\t\tprintf(\""%d\\n\"",sum);\n\t}\n}",WRONG_ANSWER,6,356
1591038549909090304,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-11-11 20:02:05,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n    int i,n,x,y,z;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&x);\n        if(i<n-1)\n        {\n            y=pow(6,x);\n            z=y%10;\n            printf(\""%d\\n\"",z);\n        }\n        else if(i=n-1)\n        {\n            y=pow(6,x);\n            z=y%10;\n            printf(\""%d\"",z);\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,8,604
1591038881800192000,f1feb45d46abad163f730e5b023ce1df76883054d0a1741228a76c2c69aa3eda,2022-11-11 20:03:24,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n,i,j;\n    int x=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n        c[i]=b[i]-a[i];\n    for(i=0;i<n;i++){\n        y=0;\n        for(j=i;j<n;j++){\n            y+=c[j];\n            if(y>x)\n                x=y;\n        }\n    }\n    printf(\""%d\\n\"",x);\n}",COMPILE_ERROR,0,0
1591038949970214912,f1feb45d46abad163f730e5b023ce1df76883054d0a1741228a76c2c69aa3eda,2022-11-11 20:03:40,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n,i,j;\n    int x=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n        c[i]=b[i]-a[i];\n    for(i=0;i<n;i++){\n        int y=0;\n        for(j=i;j<n;j++){\n            y+=c[j];\n            if(y>x)\n                x=y;\n        }\n    }\n    printf(\""%d\\n\"",x);\n}",ACCEPTED,4,188
1591039089070116864,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-11 20:04:13,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#stdio.h<include>\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",COMPILE_ERROR,0,0
1591039135127764992,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-11 20:04:24,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n\tint t,n,i,sum;\n\tscanf(\""%d\\n\"",&t);\n\tfor(i=0;i<t;i++){\n\t\tscanf(\""%d\"",&n);\n\t\tsum=pow(6,n);\n        sum=sum%10;\n        if(i==t-1){\n\t\tprintf(\""%d\"",sum);\n        }else{\n            printf(\""%d\\n\"",sum);\n        }\n\t}\n}",WRONG_ANSWER,8,484
1591039255730786304,3035aca6105664823385cfb29157c2e7046ac9071ed9ae9d64c0b3dee4d8e475,2022-11-11 20:04:53,Python,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"a=int(input())\ndata1=list(map(int,input().split()))\ndata2=list(map(int,input().split()))\n\ndatas=[]\nfor i in range(a):\n    datas.append(data2[i]-data1[i])\ndata4=min(datas)\n# print(datas)\nfor i in range(len(datas)):\n    for x in range(i,len(datas)):\n            if i==x:\n                data3=datas[x]\n            else:\n                if data3<0:\n                    break\n                data3+=datas[x]\n                data4= data3 if  data4<data3 else data4\nprint(data4)",ACCEPTED,18,2884
1591039368192659456,9a1ecd1db02b268060006afd7de34ec54e74e90bf61becbb6811fb23971c4720,2022-11-11 20:05:20,Python,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"s=eval(input())\na=list(map(int,input().split()))\nfor i in range(s):\n    if a[i]==0:\n        print(1)\n    else:\n        print(6)\n",ACCEPTED,47,2868
1591039505325428736,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-11 20:05:52,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#stdio.h\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",COMPILE_ERROR,0,0
1591039554637856768,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 20:06:04,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n \nint main()\n{\n\tint  b, n, i, k = 0, f;\n\tscanf(\""%d\"",&b);\n\tfor (n = 2; n <= b; n++) \n{\n\t\tf = 1;\n\t\tfor (i = 2; i <= sqrt(n); i++)\n\t    if (n % i == 0) {\n\t\t\t\tf = 0;\n\t\t\t\tbreak;\n\t\t                }\n\t\tif (f == 1)\n\t\t\tk++;\n\t\tif (n == b)\n\t\t\tprintf(\""%d\"", k);\n \n}\n \n}\n",ACCEPTED,13,344
1591039686167035904,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-11 20:06:35,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,4,344
1591039689551839232,4e8bf5e988ac4275aeb23eae913a385055ab79de14dc27373b9e62a15269d138,2022-11-11 20:06:36,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\nb=input()\nc=b.split(' ',a-1)\nfor i in c:\n    x=6**int(i)\n    y=x%10\n    print(y)\n    ",COMPILE_ERROR,0,0
1591039732316962816,4e8bf5e988ac4275aeb23eae913a385055ab79de14dc27373b9e62a15269d138,2022-11-11 20:06:46,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\nb=input()\nc=b.split(' ',a-1)\nfor i in c:\n    x=6**int(i)\n    y=x%10\n    print(y)\n    ",TIME_LIMIT_EXCEEDED,168,4120
1591039787350425600,4e8bf5e988ac4275aeb23eae913a385055ab79de14dc27373b9e62a15269d138,2022-11-11 20:07:00,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\nb=input()\nc=b.split(' ',a-1)\nfor i in c:\n    x=6**int(i)\n    y=x%10\n    print(y)\n    ",TIME_LIMIT_EXCEEDED,166,4016
1591039875502112768,5d1852a153062cc8297ed7a30bb643375395a70654d5dff506fad6bc186e81bd,2022-11-11 20:07:21,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int i,a[n];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++){\n        prinf(\""%d\\n\"",6);\n    }\n}",COMPILE_ERROR,0,0
1591039976308015104,1c76961e293959cbfa749568290c58d912c131cbc4a710b8bd9a4e58eccf0b8e,2022-11-11 20:07:45,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int a,m,t;\n    scanf(\""%d\\n\"",&a);\n    int i,n;\n    for(i=0;i<a;i++)\n    {\n        scanf (\""%d \"",&n);\n    }\n    for(i=0;i<a;i++)\n    {\n        m=pow(6,n);\n        t=m%10;\n        printf(\""%d\\n\"",t);\n    }\n    return 0;\n}\n",WRONG_ANSWER,7,748
1591040108839612416,5d1852a153062cc8297ed7a30bb643375395a70654d5dff506fad6bc186e81bd,2022-11-11 20:08:16,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int i,n,a[10];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++){\n        prinf(\""%d\\n\"",6);\n    }\n}",COMPILE_ERROR,0,0
1591040163348807680,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-11 20:08:29,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n    return 0;\n}",ACCEPTED,6,196
1591040254763642880,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 20:08:51,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\nimport java.util.*;\n\npublic class Main {\n    public static void main(String[] args){\n        Scanner sc=new Scanner(System.in);\n        int x=sc.nextInt();\n\n        int[] n=new int[10000];\n            for (int i = 0; i <x; i++) {\n                int q=sc.nextInt();\n                n[i]=(int) Math.pow(6,q);\n            }\n            for (int i = 0; i <x; i++){\n                if (n[i]==0){\n                    System.out.println(1);\n                }else{\n                    System.out.println(6);\n                } \n            }\n    }\n}",NON_ZERO_EXIT_CODE,250,19812
1591040482354987008,07d925df8d2026d3171a0a2ca84a6ef7f4a5b47a584cf47b66c5dd8f28139d1f,2022-11-11 20:09:45,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main( )\n{\nint i,j,n,count=0;\nscanf(\""%d\"",&n);\nfor(i=2; i<=n;i++)\n{\nfor(j=2;j<i;j++)\n{ if(i%j==0)break;}\nif(j==i)\ncount++;\n}\nprintf(\""%d\"",count);\n}\n\n",ACCEPTED,965,348
1591040488646422528,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-11 20:09:47,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n\tint t,n,i,sum;\n\tscanf(\""%d\\n\"",&t);\n\tfor(i=0;i<t;i++){\n\t\tscanf(\""%d\"",&n);\n\t\tsum=pow(6,n);\n        sum=sum%10;\n        if(i==t-1){\n\t\tprintf(\""%d\"",sum);\n        }else{\n            printf(\""%d\\n\"",sum);\n        }\n\t}\n    return 0;\n}",WRONG_ANSWER,8,336
1591040497450266624,bd8243b4b064cae986196b0eac310a36f12d46dc08f126fbdcaaca530c884eb0,2022-11-11 20:09:49,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n    return 0;\n}\n",ACCEPTED,7,344
1591040569747505152,bd8243b4b064cae986196b0eac310a36f12d46dc08f126fbdcaaca530c884eb0,2022-11-11 20:10:06,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint i,j,a,b;\n\tscanf(\""%d\"",&i);\n\twhile(i>0){\n\t\tscanf(\""%d\"",&a);\n\t\tif(a==0)\n        printf(\""1\\n\"");\n        else\n        printf(\""6\\n\"");\n\t\ti--;\n\t} \n    return 0;\n}\n",ACCEPTED,9,324
1591040661674065920,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 20:10:28,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\nimport java.util.*;\n\npublic class Main {\n    public static void main(String[] args){\n        Scanner sc=new Scanner(System.in);\n        int x=sc.nextInt();\n\n        int[] n=new int[10000];\n        for (int i = 0; i <x; i++) {\n            int q=sc.nextInt();\n            n[i]=(int) Math.pow(6,q);\n        }\n        for (int i = 0; i <x; i++){\n            if (n[i]==1){\n                System.out.println(1);\n            }else{\n                System.out.println(6);\n            }\n        }\n    }\n}",NON_ZERO_EXIT_CODE,254,16452
1591040666895978496,c47b15e117166a3dd00078b9f795673d5284a2761e582479119229751cc734d3,2022-11-11 20:10:29,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define MAX 100\n\n\nint main() {\n   int p=0,q=0,n,m,i,j;\n   int str1[MAX];\n   int str2[MAX];\n   int str3[MAX];\n   scanf(\""%d\"",&n);\n   for (i=0;i<n;i++)\n    scanf(\""%d\"",&str1[i]);\n\n   for (i=0;i<n;i++)\n    scanf(\""%d\"",&str2[i]);\n\n    for (i=0;i<n;i++)\n        str3[i]=str2[i]-str1[i];\n    for (j=0;j<n;j++)\n    {\n        m=0;\n        for (i=j;i<n;i++)\n      {\n         m+=str3[i];\n         if(m>p)\n            p=m;\n            if(p>q)\n            q=p;\n         else break;\n\n\n      }\n    }\n\n    printf(\""%d\"",q);\n\n\n\n\n    return 0;\n}\n",WRONG_ANSWER,3,380
1591040699166928896,c47b15e117166a3dd00078b9f795673d5284a2761e582479119229751cc734d3,2022-11-11 20:10:37,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define MAX 100\n\n\nint main() {\n   int p=0,q=0,n,m,i,j;\n   int str1[MAX];\n   int str2[MAX];\n   int str3[MAX];\n   scanf(\""%d\"",&n);\n   for (i=0;i<n;i++)\n    scanf(\""%d\"",&str1[i]);\n\n   for (i=0;i<n;i++)\n    scanf(\""%d\"",&str2[i]);\n\n    for (i=0;i<n;i++)\n        str3[i]=str2[i]-str1[i];\n    for (j=0;j<n;j++)\n    {\n        m=0;\n        for (i=j;i<n;i++)\n      {\n         m+=str3[i];\n         if(m>p)\n            p=m;\n            if(p>q)\n            q=p;\n         else break;\n\n\n      }\n    }\n\n    printf(\""%d\"",q);\n\n\n\n\n    return 0;\n}\n",WRONG_ANSWER,4,308
1591040750324879360,bd8243b4b064cae986196b0eac310a36f12d46dc08f126fbdcaaca530c884eb0,2022-11-11 20:10:49,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n\n   int a[900],b[900],c[900],d[900];\nint main()\n{\n    int i,j,k,n,z,x;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(j=0;j<n;j++)\n    {\n        c[j]=b[j]-a[j];\n    for(i=j+1;i<n;i++)\n    {\n        c[i]=c[i-1]+b[i]-a[i];\n    }\n         z=c[j];\n    for(k=j+1;k<n;k++)\n    {\n        if(z<c[k])\n            z=c[k];\n    }\n        d[j]=z;\n    }\n    for(k=0;k<n;k++)\n    {\n        if(z<d[k])\n            z=d[k];\n    }\n    printf(\""%d\\n\"",z);\n    return 0;\n}",ACCEPTED,2,196
1591040873557721088,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 20:11:19,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args){\n        Scanner sc=new Scanner(System.in);\n        int x=sc.nextInt();\n\n        int[] n=new int[10000];\n        for (int i = 0; i <x; i++) {\n            n[i]=sc.nextInt();\n        }\n        for (int i = 0; i <x; i++){\n            if (n[i]==0){\n                System.out.println(1);\n            }else{\n                System.out.println(6);\n            }\n        }\n    }\n},WRONG_ANSWER,277,16152
1591040897750466560,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 20:11:24,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args){\n        Scanner sc=new Scanner(System.in);\n        int x=sc.nextInt();\n\n        int[] n=new int[10000];\n        for (int i = 0; i <x; i++) {\n            n[i]=sc.nextInt();\n        }\n        for (int i = 0; i <x; i++){\n            if (n[i]==0){\n                System.out.println(1);\n            }else{\n                System.out.println(6);\n            }\n        }\n    }\n},NON_ZERO_EXIT_CODE,251,16320
1591040937474723840,7222c2fb91a71fcf3f6560860557ab564f69a453594c9f1620ecc35bb26f5daf,2022-11-11 20:11:34,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    int max=0,n,i,j,m;\n scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=0;i<10;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<10;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(i=0;i<10;i++)\n    {\n       if(a[i]<=b[i])\n       {   \n           m=b[i]-a[i];\n           max+=m;\n       }\n    }\n    printf(\""%d\"",max);\n    \n    return 0;\n}",WRONG_ANSWER,3,188
1591040968244113408,bd8243b4b064cae986196b0eac310a36f12d46dc08f126fbdcaaca530c884eb0,2022-11-11 20:11:41,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a[900],b[900],c[900],d[900];\n    int i,j,k,n,z;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(j=0;j<n;j++)\n    {\n        c[j]=b[j]-a[j];\n        for(i=j+1;i<n;i++)\n        {\n           c[i]=c[i-1]+b[i]-a[i];\n        }\n         z=c[j];\n        for(k=j+1;k<n;k++)\n        {\n            if(z<c[k])\n               z=c[k];\n        }\n        d[j]=z;\n    }\n    for(k=0;k<n;k++)\n    {\n        if(z<d[k])\n            z=d[k];\n    }\n    printf(\""%d\\n\"",z);\n    return 0;\n}",SEGMENTATION_FAULT,138,308
1591040977308024832,7222c2fb91a71fcf3f6560860557ab564f69a453594c9f1620ecc35bb26f5daf,2022-11-11 20:11:43,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    int max=0,n,i,j,m;\n scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=0;i<10;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<10;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(i=0;i<10;i++)\n    {\n       if(a[i]<=b[i])\n       {   \n           m=b[i]-a[i];\n           max+=m;\n       }\n    }\n    printf(\""%d\\n\"",max);\n    \n    return 0;\n}",WRONG_ANSWER,3,188
1591041050804813824,1e783de44f6cf9abb158b108e556a36ef99d9241fc592b40cfd6cb7d1265eb34,2022-11-11 20:12:01,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\nclass Main{  \n    public static void main(String[] args) {  \n         Scanner s = new Scanner(System.in);\n        int a = s.nextInt();\n        int count=0;\n        for (int i=2;i<a;i++){\n            boolean sushu = sushu(i);\n            if (sushu==true){\n                count+=1;\n            }\n        }\n        System.out.println(count);\n    }\n    public static boolean sushu(int num){\n        for (int i=2;i<=num-1;i++){\n            if (num % i==0){\n                return false;\n            }\n        }\n        return true;\n    }\n},TIME_LIMIT_EXCEEDED,1000,17016
1591041068844515328,7222c2fb91a71fcf3f6560860557ab564f69a453594c9f1620ecc35bb26f5daf,2022-11-11 20:12:05,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    int max=0,n,i,j,m;\n scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=0;i<10;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<10;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(i=0;i<10;i++)\n    {\n       if(a[i]<=b[i])\n       {   \n           m=b[i]-a[i];\n           max+=m;\n       }\n    }\n    printf(\""%d\\n\"",max);\n    \n    return 0;\n}",WRONG_ANSWER,4,312
1591041110003220480,bd8243b4b064cae986196b0eac310a36f12d46dc08f126fbdcaaca530c884eb0,2022-11-11 20:12:15,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n\nint main()\n\n{\n    int n,i,j,count,flag;\n    scanf(\""%d\"",&n);\n    count=0;\n    for (i=2;i<= n;i++){\n        flag=1;\n       for(j=2;j<=sqrt(i);j++){\n         if(i%j==0){\n             flag=0;\n             break;\n          }\n       }\n        if(flag==1)\n            count++;\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",ACCEPTED,14,348
1591041223920517120,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 20:12:42,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args){\n        Scanner sc=new Scanner(System.in);\n        int x=sc.nextInt();\n\n        int[] n=new int[10000];\n        for (int i = 0; i <x; i++) {\n            n[i]=sc.nextInt();\n        }\n        for (int i = 0; i <x; i++){\n            if (n[i]==0){\n                System.out.println(1);\n            }else{\n                System.out.println(6);\n            }\n        }\n        return;\n    }\n},WRONG_ANSWER,248,16884
1591041237744947200,064270dabaa13edbd7238477860db0e46621a5ed4921e8aa2c0f9258e77722cc,2022-11-11 20:12:45,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <malloc.h>\n#include <math.h>\nint main()\n{\n    int a,b,c,d,e,f,x;\n    int answer1;\n    int answer2=0;\n    int answer3=0;\n    scanf(\""%d\\n\"",&a);\n    scanf(\""%d %d %d\"",&a,&b,&c);\n     answer1=pow(6,a);\n     answer2=pow(6,b);\n     answer3=pow(6,c);\n    d=answer1%10;\n    e=answer1%10;\n    f=answer1%10;\n\n\n   printf(\""%d\\n\"",d);\n   printf(\""%d\\n\"",e);\n   printf(\""%d\\n\"",f);\nreturn 0;\n}\n",WRONG_ANSWER,4,472
1591041246292934656,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 20:12:47,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args){\n        Scanner sc=new Scanner(System.in);\n        int x=sc.nextInt();\n\n        int[] n=new int[10000];\n        for (int i = 0; i <x; i++) {\n            n[i]=sc.nextInt();\n        }\n        for (int i = 0; i <x; i++){\n            if (n[i]==0){\n                System.out.println(1);\n            }else{\n                System.out.println(6);\n            }\n        }\n        return;\n    }\n},NON_ZERO_EXIT_CODE,248,16496
1591041271450349568,064270dabaa13edbd7238477860db0e46621a5ed4921e8aa2c0f9258e77722cc,2022-11-11 20:12:53,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <malloc.h>\n#include <math.h>\nint main()\n{\n    int a,b,c,d,e,f,x;\n    int answer1;\n    int answer2=0;\n    int answer3=0;\n    scanf(\""%d\\n\"",&a);\n    scanf(\""%d %d %d\"",&a,&b,&c);\n     answer1=pow(6,a);\n     answer2=pow(6,b);\n     answer3=pow(6,c);\n    d=answer1%10;\n    e=answer1%10;\n    f=answer1%10;\n\n\n   printf(\""%d\\n\"",d);\n   printf(\""%d\\n\"",e);\n   printf(\""%d\\n\"",f);\nreturn 0;\n}\n",WRONG_ANSWER,4,464
1591041335430283264,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-11 20:13:09,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n\tint t,n,i,sum;\n\tscanf(\""%d\\n\"",&t);\n\tfor(i=0;i<t;i++){\n\t\tscanf(\""%d\"",&n);\n\t\tsum=pow(6,n);\n        sum=sum%10;\n        if(i==t-1){\n\t\tprintf(\""%d\"",sum);\n        }else{\n            printf(\""%d\\n\"",sum);\n        }\n\t}\n    return 0;\n}",WRONG_ANSWER,8,308
1591041338630516736,064270dabaa13edbd7238477860db0e46621a5ed4921e8aa2c0f9258e77722cc,2022-11-11 20:13:09,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <malloc.h>\n#include <math.h>\nint main()\n{\n    int a,b,c,d,e,f,x;\n    int answer1;\n    int answer2=0;\n    int answer3=0;\n    scanf(\""%d\\n\"",&a);\n    scanf(\""%d %d %d\"",&a,&b,&c);\n     answer1=pow(6,a);\n     answer2=pow(6,b);\n     answer3=pow(6,c);\n    d=answer1%10;\n    e=answer1%10;\n    f=answer1%10;\n\n\n   printf(\""%d\\n\"",d);\n   printf(\""%d\\n\"",e);\n   printf(\""%d\\n\"",f);\nreturn 0;\n}\n",WRONG_ANSWER,4,324
1591041440526938112,064270dabaa13edbd7238477860db0e46621a5ed4921e8aa2c0f9258e77722cc,2022-11-11 20:13:34,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <malloc.h>\n#include <math.h>\nint main()\n{\n    int a,b,c,d,e,f;\n    int answer1;\n    int answer2=0;\n    int answer3=0;\n    scanf(\""%d\\n\"",&a);\n    scanf(\""%d %d %d\"",&a,&b,&c);\n     answer1=pow(6,a);\n     answer2=pow(6,b);\n     answer3=pow(6,c);\n    d=answer1%10;\n    e=answer1%10;\n    f=answer1%10;\n\n\n   printf(\""%d\\n\"",d);\n   printf(\""%d\\n\"",e);\n   printf(\""%d\\n\"",f);\nreturn 0;\n}\n",WRONG_ANSWER,3,316
1591041517479858176,064270dabaa13edbd7238477860db0e46621a5ed4921e8aa2c0f9258e77722cc,2022-11-11 20:13:52,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <malloc.h>\n#include <math.h>\nint main()\n{\n    int a,b,c,d,e,f;\n    int answer1;\n    int answer2;\n    int answer3;\n    scanf(\""%d\\n\"",&a);\n    scanf(\""%d %d %d\"",&a,&b,&c);\n     answer1=pow(6,a);\n     answer2=pow(6,b);\n     answer3=pow(6,c);\n    d=answer1%10;\n    e=answer1%10;\n    f=answer1%10;\n\n\n   printf(\""%d\\n\"",d);\n   printf(\""%d\\n\"",e);\n   printf(\""%d\\n\"",f);\nreturn 0;\n}\n",WRONG_ANSWER,3,320
1591041578913828864,4e8bf5e988ac4275aeb23eae913a385055ab79de14dc27373b9e62a15269d138,2022-11-11 20:14:07,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\nb=input()\nc=b.split(' ',a-1)\nfor i in a:\n    x=6**int(i)\n    y=x%10\n    print(y)\n    ",NON_ZERO_EXIT_CODE,15,2756
1591041650200219648,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 20:14:24,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args){\n        Scanner sc=new Scanner(System.in);\n        int x=sc.nextInt();\n\n        int[] n=new int[10000];\n        for (int i = 0; i <x; i++) {\n            n[i]=sc.nextInt();\n        }\n        for (int i = 0; i <x; i++){\n            if (n[i]==0){\n                System.out.println(\""1\"");\n            }else{\n                System.out.println(\""6\"");\n            }\n        }\n    }\n}",NON_ZERO_EXIT_CODE,242,16392
1591041689416957952,4e8bf5e988ac4275aeb23eae913a385055ab79de14dc27373b9e62a15269d138,2022-11-11 20:14:33,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\nb=input()\nc=b.split(' ',a-1)\nfor i in c:\n    x=6**int(i)\n    y=x%10\n    print(y)",TIME_LIMIT_EXCEEDED,167,4032
1591041706487754752,064270dabaa13edbd7238477860db0e46621a5ed4921e8aa2c0f9258e77722cc,2022-11-11 20:14:37,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <malloc.h>\n#include <math.h>\nint main()\n{\n    int a,b,c,d,e,f;\n    int answer1;\n    int answer2;\n    int answer3;\n    scanf(\""%d\\n\"",&a);\n    scanf(\""%d %d %d\"",&a,&b,&c);\n     answer1=pow(6,a);\n     answer2=pow(6,b);\n     answer3=pow(6,c);\n    d=answer1%10;\n    e=answer1%10;\n    f=answer1%10;\n   printf(\""%d\\n\"",d);\n   printf(\""%d\\n\"",e);\n   printf(\""%d\\n\"",f);\nreturn 0;\n}\n",WRONG_ANSWER,3,196
1591041809076260864,064270dabaa13edbd7238477860db0e46621a5ed4921e8aa2c0f9258e77722cc,2022-11-11 20:15:02,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <malloc.h>\n#include <math.h>\nint main()\n{\n    int a,b,c,d,e,f;\n    int answer1;\n    int answer2;\n    int answer3;\n    scanf(\""%d\\n\"",&a);\n    scanf(\""%d %d %d\"",&a,&b,&c);\n     answer1=pow(6,a);\n     answer2=pow(6,b);\n     answer3=pow(6,c);\n    d=answer1%10;\n    e=answer2%10;\n    f=answer3%10;\n   printf(\""%d\\n\"",d);\n   printf(\""%d\\n\"",e);\n   printf(\""%d\\n\"",f);\nreturn 0;\n}\n",WRONG_ANSWER,3,348
1591041870795444224,1e783de44f6cf9abb158b108e556a36ef99d9241fc592b40cfd6cb7d1265eb34,2022-11-11 20:15:16,Java,300.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\nclass Main{  \n    public static void main(String[] args) {  \n         Scanner s = new Scanner(System.in);\n        int a = s.nextInt();\n        int count=0;\n        for (int i=2;i<a;i++){\n            boolean sushu = sushu(i);\n            if (sushu==true){\n                count+=1;\n            }\n        }\n        System.out.println(count);\n    }\n    public static boolean sushu(int num){\n        for (int i=2;i<=Math.sqrt(num);i++){\n            if (num % i==0){\n                return false;\n            }\n        }\n        return true;\n    }\n},ACCEPTED,259,16392
1591041990077231104,064270dabaa13edbd7238477860db0e46621a5ed4921e8aa2c0f9258e77722cc,2022-11-11 20:15:45,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <malloc.h>\n#include <math.h>\nint main()\n{\n    int a,b,c,d,e,f,x;\n    int answer1;\n    int answer2=0;\n    int answer3=0;\n    scanf(\""%d\\n\"",&a);\n    scanf(\""%d %d %d\"",&a,&b,&c);\n     answer1=pow(6,a);\n     answer2=pow(6,b);\n     answer3=pow(6,c);\n    d=answer1%10;\n    e=answer2%10;\n    f=answer3%10;\n\n\n   printf(\""%d\\n\"",d);\n   printf(\""%d\\n\"",e);\n   printf(\""%d\\n\"",f);\nreturn 0;\n}\n",WRONG_ANSWER,3,312
1591042019626127360,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 20:15:52,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args){\n        Scanner sc=new Scanner(System.in);\n        int x=sc.nextInt();\n\n        int[] n=new int[10000];\n        for (int i = 0; i <x; i++) {\n            n[i]=sc.nextInt();\n        }\n        for (int i = 0; i <x; i++){\n            if (n[i]==0){\n                System.out.print(\""1\\n\"");\n            }else{\n                System.out.print(\""6\\n\"");\n            }\n        }\n    }\n}",NON_ZERO_EXIT_CODE,254,16560
1591042024294387712,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-11-11 20:15:53,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main()\n{\n    int i,j,n;\n    int a=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n    {\n        for(j=2;j<=i;j++)\n        {\n            if(i%j==0)\n            {\n                if(i==j)\n                    a++;\n                else\n                    break;\n            }\n        }\n    }\n    printf(\""%d\\n\"",a);\n    return 0;\n}",TIME_LIMIT_EXCEEDED,1000,272
1591042039544877056,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-11 20:15:57,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n\tint t,n,i,sum;\n\tscanf(\""%d\"",&t);\n\tfor(i=0;i<t;i++){\n\t\tscanf(\""%d\"",&n);\n\t\tsum=pow(6,n);\n        sum=sum%10;\n        if(i==t-1){\n\t\tprintf(\""%d\"",sum);\n        }else{\n            printf(\""%d\\n\"",sum);\n        }\n\t}\n    return 0;\n}",WRONG_ANSWER,6,196
1591042061413978112,064270dabaa13edbd7238477860db0e46621a5ed4921e8aa2c0f9258e77722cc,2022-11-11 20:16:02,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <malloc.h>\n#include <math.h>\nint main()\n{\n    int a,b,c,d,e,f,x;\n    int answer1;\n    int answer2=0;\n    int answer3=0;\n    scanf(\""%d\\n\"",&a);\n    scanf(\""%d %d %d\"",&a,&b,&c);\n     answer1=pow(6,a);\n     answer2=pow(6,b);\n     answer3=pow(6,c);\n    d=answer1%10;\n    e=answer2%10;\n    f=answer3%10;\n\n\n   printf(\""%d\\n\"",d);\n   printf(\""%d\\n\"",e);\n   printf(\""%d\\n\"",f);\nreturn 0;\n}\n",WRONG_ANSWER,4,472
1591042072948289536,0cfbb4a339ebbc4dce13b5f3e3f98a3def0ab17ef5b4ac8e6d566de92e1f5f78,2022-11-11 20:16:04,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#define N 100\nint power[N]={0};\nint p;\nint a[N];\nint b[N];\n\nvoid max(int n){\n    int count=0;\n    int maxn=0;\n    for(int i=0;i<n;i++){\n        power[i]=b[i]-a[i];\n        for(int j=i;j<=n;j++){\n            p+=power[j];\n        }\n        if(p>maxn)\n            maxn=p;\n    }\n\n    printf(\""%d\"",maxn);\n}\n\nint main(){\n    int n;\n    scanf(\""%d\"",&n);\n    if(n==0){\n        printf(\""0\"");\n    }\n    for(int i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(int j=0;j<n;j++){\n        scanf(\""%d\"",&b[j]);\n    }\n    max(n);\n    return 0;\n}\n",WRONG_ANSWER,4,308
1591042078392520704,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-11-11 20:16:06,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main()\n{\n    int i,j,n;\n    int a=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n    {\n        for(j=2;j<=i;j++)\n        {\n            if(i%j==0)\n            {\n                if(i==j)\n                    a++;\n                else\n                    break;\n            }\n        }\n    }\n    printf(\""%d\\n\"",a);\n    return 0;\n}",TIME_LIMIT_EXCEEDED,1000,328
1591042399038672896,46a5b5de1986c03ade4ef3715390240d3b4a1729dbb6afcb5e53fc1bee0f1a07,2022-11-11 20:17:22,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n\t\t Scanner sc=new Scanner(System.in);\n\t     int x=sc.nextInt();\n\t     int array[]=new int[20];\n\t\t int b=0;\n\t     for(int i=0;i<x;i++) {\n\t    \t array[i]=sc.nextInt();\n\t     }\n\t     for(int i=1;i<=x;i++) {\n\t    \t for(int j=0;j<i;j++) {\n\t    \t\t b=(int) Math.pow(6,array[j]);\t \n\t    \t}\n\t    \t if(i==x) {\n\t    \t System.out.print(b%10);\n\t    \t }else {\n\t    \t\t System.out.println(b%10);\n\t    \t }\n\t     }\n\t     sc.close();\n\t}\n}\n",NON_ZERO_EXIT_CODE,254,21928
1591042417682350080,5d1852a153062cc8297ed7a30bb643375395a70654d5dff506fad6bc186e81bd,2022-11-11 20:17:27,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int i,n,a[10];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++){\n        prinf(\""%d\\n\"",6);\n    }\n}",COMPILE_ERROR,0,0
1591042451945623552,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-11 20:17:35,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int t,n;\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"")\n    }\n}",COMPILE_ERROR,0,0
1591042473227497472,7222c2fb91a71fcf3f6560860557ab564f69a453594c9f1620ecc35bb26f5daf,2022-11-11 20:17:40,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    int max=0,n,i,j,m,sum=0;\n scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=0;i<10;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<10;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(i=0;i<10;i++)\n    {\n        m=b[i]-a[i];\n           sum+=m;\n       if(sum>=max)\n       {   \n           max=sum;\n       }\n    }\n    printf(\""%d\\n\"",max);\n    \n    return 0;\n}",WRONG_ANSWER,3,488
1591042528059658240,5d1852a153062cc8297ed7a30bb643375395a70654d5dff506fad6bc186e81bd,2022-11-11 20:17:53,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int i,n,a[10];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++){\n        prinf(\""6\\n\"");\n    }\n}",COMPILE_ERROR,0,0
1591042545726042112,a1740cfbe2cf8a9429ff2c5c2e61e74eec2b1172de241073f72b744f21e116d8,2022-11-11 20:17:57,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n    int t;\n    int i;\n    scanf(\""%d\"",&t);\n    int num[10000];\n    for(i=0;i<t;i++){\n        scanf(\""%d\"",&num[i]);\n    }\n    for(i=0;i<t;i++){\n        if(num[i]==0){\n            printf(\""1\\n\"");   \n        }\n        else{\n            printf(\""6\\n\"");\n        }\n    }\n\treturn 0;\n}",ACCEPTED,9,348
1591042672851222528,5d1852a153062cc8297ed7a30bb643375395a70654d5dff506fad6bc186e81bd,2022-11-11 20:18:28,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int i,n,a[10];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++){\n        prinf(\""6\\n\"");\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1591042686864392192,33066437ddee11f609c900fe8dbd59cb8113e4d8dfd13c1812f199f4f3fdd334,2022-11-11 20:18:31,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#define N 10010\nint main()\n{\n    int n;\n    int i,a[N],b[N];\n    int k=0;\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=1;i<=n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(i=1;i<=n;i++)\n    {\n        if(b[i]>a[i]) k=k+(b[i]-a[i]);\n        else\n            break;\n    }\n    printf(\""%d\\n\"",k);\n    \n    return 0;\n}",WRONG_ANSWER,4,308
1591042741092548608,2cb092ec618cde3657d677b73f7a0a7bfb1e0da02f466007878113e6c4db4792,2022-11-11 20:18:44,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h> \n#include<math.h>\nint main(){\nint n;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(int i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n    \n    for(int i=0;i<n-1;i++){\n       if(a[i]==0&&i<(n-1)) printf(\""1\\n\"");\n       else printf(\""6\\n\"");\n    }\n    if(a[n-1]==0) printf(\""1\"");\n    else printf(\""6\"");\n\t\n}",ACCEPTED,11,348
1591042760503791616,46a5b5de1986c03ade4ef3715390240d3b4a1729dbb6afcb5e53fc1bee0f1a07,2022-11-11 20:18:48,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int t;\n    int i,j;\n    scanf(\""%d\"",&t);\n    int num[10000];\n    for(i=0;i<t;i++){\n        scanf(\""%d\"",&num[i]);\n    }\n    for(j=0;j<t;j++){\n        if(num[j]==0){\n            printf(\""1\\n\"");   \n        }\n        else{\n            printf(\""6\\n\"");\n        }\n    }\n\treturn 0;\n}\n\n",ACCEPTED,11,324
1591042809916882944,70c675ddfcb60b2192bc8ac38fb068fec0500208a5bf97a796c7cc074b43cf87,2022-11-11 20:19:00,Java,300.0,1590734963702620160,1590734503495200768,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner myScanner = new Scanner(System.in);\n\t\tint n = myScanner.nextInt();\n\t\tint[] arr = new int[n]; // 消耗能量\n\t\tint[] arr1 = new int[n]; //获取能量\n\t\tint[] sum = new int[n];   //每次的能量\n\t\tint max =0 ;\n\t\tint min = 0;\n\t\tfor(int i = 0;i < n;i++) {\n\t\t\tarr[i] = myScanner.nextInt();\n\t\t}\n\t\tfor(int i = 0;i < n;i++) {\n\t\t\tarr1[i] = myScanner.nextInt();\n\t\t}\n\t\tfor(int i = 0;i < n;i++) {\n\t\t\tsum[i] = -arr[i]+ arr1[i];\n\t\t}\n\t\tfor(int i = 0;i < n;i++) {\n\t\t\tmin = 0;\n\t\t\tfor(int j = i;j < n;j++) {\n\t\t\t\tmin += sum[j];\n\t\t\t\tif(min > max) {\n\t\t\t\t\tmax = min;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(max);\n\t}\n}\n,ACCEPTED,134,16356
1591042941127294976,5d1852a153062cc8297ed7a30bb643375395a70654d5dff506fad6bc186e81bd,2022-11-11 20:19:31,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int i,n,a[10];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d \"",&a[i]);\n    }\n    for(i=0;i<n;i++){\n        prinf(\""6\\n\"");\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1591043101966270464,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-11 20:20:10,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"num = input()\na = input()\nb = input()\nprint(\""25\"")\n",WRONG_ANSWER,17,2908
1591043346292871168,5d1852a153062cc8297ed7a30bb643375395a70654d5dff506fad6bc186e81bd,2022-11-11 20:21:08,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int i,n,a[10];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d \"",&a[i]);\n    }\n    for(i=0;i<n;i++){\n        printf(\""6\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,9,444
1591043523728683008,ef50cfe7f34b26d29f617c97ac65d40bd15ba1e063897a190284243de955e254,2022-11-11 20:21:50,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args){\n\t    Scanner sc=new Scanner(System.in);\n\t    int t=sc.nextInt();\n\t    int[] n=new int[t];\n\t    int i;\n\t    for(i=0;i<t;i++) {\n\t    \tn[i]=sc.nextInt();\n\t    }\n\t    for(i=0;i<t-1;i++) {\n\t    \tif(n[i]==0) System.out.println(1);\n\t    \telse System.out.println(6);\n\t    }\n\t    if(n[i]==0) System.out.print(1);\n    \telse System.out.print(6);\n\t}\n\t\n},WRONG_ANSWER,259,16564
1591043716708610048,5d1852a153062cc8297ed7a30bb643375395a70654d5dff506fad6bc186e81bd,2022-11-11 20:22:36,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int i,n,a[10];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d \"",&a[i]);\n    }\n    for(i=0;i<n-1;i++){\n        printf(\""6\\n\"");\n    }\n    printf(\""6\"");\n    return 0;\n}",WRONG_ANSWER,9,492
1591043912683270144,a2fa7eb1ab1c2f6fa23517852ee6971ea32fd0c7742d71d7914ed729415f04d9,2022-11-11 20:23:23,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint n,num=0,max=0;\n\tcin>>n;\n\tint a[n+1]={},b[n+1]={},c[n+1]={};\n\tfor(int i=1;i<=n;i++)\n\t    cin>>a[i];\n\tfor(int i=1;i<=n;i++)\n\t    cin>>b[i];\n\t/*for(int i=1;i<=n;i++)\n\t    c[i]=b[i]-a[i];\n\tint m=n,i=1;    \n\twhile(m>0)\n\t{\n\t\tnum+=c[i];\n\t\tif(num>max)\n\t\t    max=num;\n\t\t    i++;\n\t\t    m--;\n\t}*/\t\t    \n    int i=1,m=n;\n\twhile(m>0)\n\t{\n       \tif(b[i]-a[i]<0)\n\t\t{\n\t\t\ti++;\n\t\t}\n\t\tif(b[i]-a[i]>0)\n\t\t{\t\t\n\t\t    num=num+b[i]-a[i];\n\t\t\tif(num>max)\n\t\t\t    max=num;\n\t\t\ti++;    \n\t    } \n\t\tm=n-i;   \t    \n    }\n\tcout<<max;\t\n\treturn 0;\n}",WRONG_ANSWER,5,312
1591044005499023360,7222c2fb91a71fcf3f6560860557ab564f69a453594c9f1620ecc35bb26f5daf,2022-11-11 20:23:45,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    int max=0,n,i,j,m,sum=0;\n scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=0;i<10;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<10;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    \n    for(i=0;i<10;i++)\n    {sum=0;\n        for(j=i;j<10;j++)\n        {\n        m=b[i]-a[i];\n           sum+=m;\n       if(sum>=max)\n       {   \n           max=sum;\n       }\n        }\n    }\n    printf(\""%d\\n\"",max);\n    \n    return 0;\n}",WRONG_ANSWER,4,308
1591044525202673664,c3cd14f35a8796e3a62f8cb6f4fc316eb939d8fb951152a336f034c1ffa23fad,2022-11-11 20:25:49,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint results(int a,int b,int c);\nint main()\n{\n\tint X,Y,Z,S;\n\tscanf(\""%d %d %d\"",&X,&Y,&Z);\n\tS=results(X,Y,Z);\n\tprintf(\""X+Y-Z=%d\"",S);\n}\nint results(int a,int b,int c)\n{\n\tint q;\n\tif(0<=a<=100 && 0<=b<=100 && 0<=c<=100)\n\t{\n\t\tq=a+b-c;\n\t\treturn q;\n\t}\n\telse\n\t{\n\t\treturn 0;\n\t}\n}",WRONG_ANSWER,4,320
1591044619868090368,899c5501179552dc1fe5639f9047e15d0f835e7a87c8568193377882d0278985,2022-11-11 20:26:12,Python,0.0,1590528927448293376,1590525945717575680,1049226928954454016,import datetime\ntoday = datetime.datetime.today()\nyear = today.year,WRONG_ANSWER,20,3400
1591044668635262976,1c76961e293959cbfa749568290c58d912c131cbc4a710b8bd9a4e58eccf0b8e,2022-11-11 20:26:23,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int a,m,t;\n    scanf(\""%d\\n\"",&a);\n    int i,n;\n    for(i=0;i<a;i++)\n    {\n        scanf (\""%d \"",&n);\n        if(n>0)\n            printf(\""6\"");\n        else\n            printf(\""1\"");\n            printf(\""\\n\"");\n    }\n    return 0;\n}\n",WRONG_ANSWER,7,320
1591044746154389504,aa0e227662691639471f7b18bc3d5c6aa34fdabcef6d52266691b6fbe7e8d245,2022-11-11 20:26:42,Java,300.0,1590528927448293376,1590525945717575680,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n            int a=2022;\n            System.out.println(a);\n       \n    }\n},ACCEPTED,71,13992
1591044897233244160,4e8bf5e988ac4275aeb23eae913a385055ab79de14dc27373b9e62a15269d138,2022-11-11 20:27:18,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\nb=input()\nc=b.split(' ',a-1)\nfor i in c:\n    for j in range(i):\n        x=x*6\n    y=x%10\n    print(y)",NON_ZERO_EXIT_CODE,17,2740
1591044974110638080,4e8bf5e988ac4275aeb23eae913a385055ab79de14dc27373b9e62a15269d138,2022-11-11 20:27:36,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\nb=input()\nc=b.split(' ',a-1)\nfor i in c:\n    for j in range(i):\n        x=x*6\n    y=x%10\n    print(y)",NON_ZERO_EXIT_CODE,21,2744
1591045077311492096,13616e85f216dd3844293b46f4b46105a0a2c458f7807a7b677858feb35cb63a,2022-11-11 20:28:01,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n   int n,i;\n   scanf(\""%d\"",&n);\n   int a[n],b[n];\n   for(i=0;i<n;i++)\n   {\n       scanf(\""%d\"",&a[i]);\n   }\n    for(i=0;i<n;i++)\n   {\n       scanf(\""%d\"",&b[i]);\n          a[i]=b[i]-a[i];\n   }\n\n   int sum=0,num=0;\nfor(i=0;i<n;i++)\n{\n    sum=a[i]+sum;\n\n    if(sum>num)\n        num=sum;\n\n\n}\nprintf(\""%d\"",num);\n\n    return 0;\n}\n",WRONG_ANSWER,3,472
1591045185612591104,4e8bf5e988ac4275aeb23eae913a385055ab79de14dc27373b9e62a15269d138,2022-11-11 20:28:27,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\nb=input()\nc=b.split(' ',a-1)\nint j =0\nfor i in c:\n    for j in range(i):\n        x=x*6\n    y=x%10\n    print(y)",NON_ZERO_EXIT_CODE,17,2816
1591045192659021824,20eba57d0ae5a9e589a2b203a4648cce520c99291e8744872f7a5a5911e19e34,2022-11-11 20:28:28,Java,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        System.out.print(\""2022\"");\n    }\n}",ACCEPTED,79,16908
1591045232018395136,4e8bf5e988ac4275aeb23eae913a385055ab79de14dc27373b9e62a15269d138,2022-11-11 20:28:38,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\nb=input()\nc=b.split(' ',a-1)\nint j =1\nfor i in c:\n    for j in range(i):\n        x=x*6\n    y=x%10\n    print(y)",NON_ZERO_EXIT_CODE,17,2868
1591045244584529920,33bf53cc1ac96b08f54401ab68b14c30e1f5caef149cc9332585b7c5f09675ed,2022-11-11 20:28:41,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include <math.h>\nint isPrime(int i)\n{\n    int ret = 1 ;\n    int k ;\n    for ( k = 2 ; k < i - 1 ; k++ )\n    {\n    \tif ( i % k == 0 )\n    \t{\n    \t\tret = 0 ;\n    \t\tbreak ;\n\t\t}\n\t}\n\treturn ret ;\n}\nint main()\n{\n    int n , sum , i ;\n    scanf(\""%d\"",&n);\n\tfor ( i = 2 ; i <= n ; i++)\n    {\n    \tif ( isPrime (i) )\n    \t{\n    \t\tsum ++;\n\t\t}\n\t}\n\tprintf(\""%d\"",sum);\n\treturn 0 ;\n}",ACCEPTED,972,356
1591045342462808064,c47b15e117166a3dd00078b9f795673d5284a2761e582479119229751cc734d3,2022-11-11 20:29:04,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define MAX 100\n\n\nint main() {\n   int p=0,q=0,n,m,i,j;\n   int str1[MAX];\n   int str2[MAX];\n   int str3[MAX];\n   scanf(\""%d\"",&n);\n   for (i=0;i<n;i++)\n    scanf(\""%d\"",&str1[i]);\n\n   for (i=0;i<n;i++)\n    scanf(\""%d\"",&str2[i]);\n\n    for (i=0;i<n;i++)\n        str3[i]=str2[i]-str1[i];\n    for (j=0;j<n;j++)\n    {\n        m=0;\n        for (i=j;i<n;i++)\n      {\n         m+=str3[i];\n         if(m>p)\n            p=m;\n            if(p>q)\n            q=p;\n         else break;\n\n\n      }\n    }\n\n    printf(\""%d\"",q);\n\n\n\n\n    return 0;\n}\n",WRONG_ANSWER,3,184
1591045359818838016,4e8bf5e988ac4275aeb23eae913a385055ab79de14dc27373b9e62a15269d138,2022-11-11 20:29:08,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\nb=input()\nc=b.split(' ',a-1)\nint j =1\nint x=1\nfor i in c:\n    for j in range(i):\n        x=x*6\n    y=x%10\n    print(y)",NON_ZERO_EXIT_CODE,19,2872
1591045397257170944,63bdcc3416dd0c07c03f833ffb02c2f304a4f523deae6a87bed24a730e4d224d,2022-11-11 20:29:17,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n;\n    int a[i];\n    for(i=0;i<=n;i++)\n    scanf(\""%d\\n\"",&n);\n    scanf(\""%d\"",&a[i]);\n    result=pow(6,i);\n    printf(\""%d\\n\"",result);\n    printf(\""%d\\n\"",result);\n    printf(\""%d\"",result);\n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    return 0;\n}",COMPILE_ERROR,0,0
1591045415376588800,4e8bf5e988ac4275aeb23eae913a385055ab79de14dc27373b9e62a15269d138,2022-11-11 20:29:21,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\nb=input()\nc=b.split(' ',a-1)\nint x=1\nfor i in c:\n    for j in range(i):\n        x=x*6\n    y=x%10\n    print(y)",NON_ZERO_EXIT_CODE,16,2900
1591045416962011136,c47b15e117166a3dd00078b9f795673d5284a2761e582479119229751cc734d3,2022-11-11 20:29:22,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define MAX 1000\n\n\nint main() {\n   int p=0,q=0,n,m,i,j;\n   int str1[MAX];\n   int str2[MAX];\n   int str3[MAX];\n   scanf(\""%d\"",&n);\n   for (i=0;i<n;i++)\n    scanf(\""%d\"",&str1[i]);\n\n   for (i=0;i<n;i++)\n    scanf(\""%d\"",&str2[i]);\n\n    for (i=0;i<n;i++)\n        str3[i]=str2[i]-str1[i];\n    for (j=0;j<n;j++)\n    {\n        m=0;\n        for (i=j;i<n;i++)\n      {\n         m+=str3[i];\n         if(m>p)\n            p=m;\n            if(p>q)\n            q=p;\n         else break;\n\n\n      }\n    }\n\n    printf(\""%d\"",q);\n\n\n\n\n    return 0;\n}\n",WRONG_ANSWER,3,180
1591045443067379712,09eb01e8f9f24922a6c60a1149d505ad1ebb9b0a39ed1101140fe0fd93daa753,2022-11-11 20:29:28,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#pragma warning (disable:4996)\n#include<stdio.h>\nint main()\n{\n\tint i, j;\n\tint n = 0;\n\tint count = 0;\n\tscanf(\""%d\"", &n);\n\tfor (i = 2; i < n; i++)\n\t{\n\t\tfor (j = 2; j < n; j++)\n\t\t{\n\t\t\tif (i % j == 0)\n\t\t\t\tbreak;\n\t\t}\n\t\tif (j >= i)\n\t\t\tcount++;\n\t}\n\tprintf(\""%d\"", count);\n\treturn 0;\n}\n",ACCEPTED,947,348
1591045443482619904,13616e85f216dd3844293b46f4b46105a0a2c458f7807a7b677858feb35cb63a,2022-11-11 20:29:28,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n   int n,i;\n   scanf(\""%d\"",&n);\n   int a[n],b[n];\n   for(i=0;i<n;i++)\n   {\n       scanf(\""%d\"",&a[i]);\n   }\n    for(i=0;i<n;i++)\n   {\n       scanf(\""%d\"",&b[i]);\n          a[i]=b[i]-a[i];\n   }\n\n   int sum=0,num=0;\nfor(i=0;i<n;i++)\n{\n    sum=a[i]+sum;\n\n    if(sum>num)\n        num=sum;\n\n\n}\nprintf(\""%d\"",num);\n\n    return 0;\n}\n",WRONG_ANSWER,3,328
1591045522692046848,13616e85f216dd3844293b46f4b46105a0a2c458f7807a7b677858feb35cb63a,2022-11-11 20:29:47,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n   int n,i;\n   scanf(\""%d\"",&n);\n   int a[n],b[n];\n   for(i=0;i<n;i++)\n   {\n       scanf(\""%d\"",&a[i]);\n   }\n    for(i=0;i<n;i++)\n   {\n       scanf(\""%d\"",&b[i]);\n          a[i]=b[i]-a[i];\n   }\n\n   int sum=0,num=0;\nfor(i=0;i<n;i++)\n{\n    sum=a[i]+sum;\n\n    if(sum>num)\n        num=sum;\n\n\n}\nprintf(\""%d\"",num);\n\n    return 0;\n}\n",WRONG_ANSWER,4,472
1591045650668654592,899c5501179552dc1fe5639f9047e15d0f835e7a87c8568193377882d0278985,2022-11-11 20:30:17,Python,0.0,1590528927448293376,1590525945717575680,1049226928954454016,import datetime\ndatetime.datetime.now().year,WRONG_ANSWER,19,3124
1591045667592671232,2af449595ef30f97cefb348732f77a537f3df93d20abf901fe2ea852a179091b,2022-11-11 20:30:22,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main()\n{\n   printf(\""2022\"");\n   return 0;\n}",ACCEPTED,4,196
1591045758223187968,63bdcc3416dd0c07c03f833ffb02c2f304a4f523deae6a87bed24a730e4d224d,2022-11-11 20:30:43,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n;\n    int a[i];\n    for(i=0;i<=n;i++)\n    scanf(\""%d\\n\"",&n);\n    scanf(\""%d\"",&a[i]);\n    result=pow(6,i);\n    printf(\""%d\\n\"",result);\n    printf(\""%d\\n\"",result);\n    printf(\""%d\"",result);\n    \n return 0;\n}",COMPILE_ERROR,0,0
1591045897390198784,c47b15e117166a3dd00078b9f795673d5284a2761e582479119229751cc734d3,2022-11-11 20:31:16,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define MAX 1000\n\n\nint main() {\n   int p=0,q=0,n,m,i,j;\n   int str1[MAX];\n   int str2[MAX];\n   int str3[MAX];\n   scanf(\""%d\"",&n);\n   for (i=0;i<n;i++)\n    scanf(\""%d\"",&str1[i]);\n\n   for (i=0;i<n;i++)\n    scanf(\""%d\"",&str2[i]);\n\n    for (i=0;i<n;i++)\n        str3[i]=str2[i]-str1[i];\n    for (j=0;j<n;j++)\n    {\n        m=0;\n        for (i=j;i<n;i++)\n      {\n         m+=str3[i];\n         if(m>p)\n            p=m;\n            if(p>q)\n            q=p;\n         else break;\n\n\n      }\n    }\n\n    printf(\""%d\\n\"",q);\n\n\n\n\n    return 0;\n}\n",WRONG_ANSWER,2,200
1591045984258404352,064270dabaa13edbd7238477860db0e46621a5ed4921e8aa2c0f9258e77722cc,2022-11-11 20:31:37,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <malloc.h>\n#include <math.h>\nint main()\n{\n    int a,b,c,d,e,f;\n    int answer1;\n    int answer2=0;\n    int answer3=0;\n    scanf(\""%d\\n\"",&a);\n    scanf(\""%d %d %d\"",&a,&b,&c);\n     answer1=pow(6,a);\n     answer2=pow(6,b);\n     answer3=pow(6,c);\n    d=answer1%10;\n    e=answer2%10;\n    f=answer3%10;\n\n\n   printf(\""%d\\n\"",d);\n   printf(\""%d\\n\"",e);\n   printf(\""%d\\n\"",f);\nreturn 0;\n}\n",WRONG_ANSWER,4,452
1591046008623140864,064270dabaa13edbd7238477860db0e46621a5ed4921e8aa2c0f9258e77722cc,2022-11-11 20:31:43,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <malloc.h>\n#include <math.h>\nint main()\n{\n    int a,b,c,d,e,f;\n    int answer1;\n    int answer2=0;\n    int answer3=0;\n    scanf(\""%d\\n\"",&a);\n    scanf(\""%d %d %d\"",&a,&b,&c);\n     answer1=pow(6,a);\n     answer2=pow(6,b);\n     answer3=pow(6,c);\n    d=answer1%10;\n    e=answer2%10;\n    f=answer3%10;\n\n\n   printf(\""%d\\n\"",d);\n   printf(\""%d\\n\"",e);\n   printf(\""%d\\n\"",f);\nreturn 0;\n}\n",WRONG_ANSWER,3,328
1591046034246119424,4e8bf5e988ac4275aeb23eae913a385055ab79de14dc27373b9e62a15269d138,2022-11-11 20:31:49,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\nb=input()\nc=b.split(' ',a-1)\nx = 1\nfor i in c:\n    for j in range(int(i)):\n        x=x*6\n    y=x%10\n    print(y)\n",TIME_LIMIT_EXCEEDED,166,3004
1591046037672890368,07d925df8d2026d3171a0a2ca84a6ef7f4a5b47a584cf47b66c5dd8f28139d1f,2022-11-11 20:31:50,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main( )\n{\nint i,j,n,count=0;\nscanf(\""%d\"",&n);\nfor(i=2; i<=n;i++)\n{\nfor(j=2;j<i;j++)\n{ if(i%j==0)break;}\nif(j==i)\ncount++;\n}\nprintf(\""%d\"",count);\nreturn 0;\n}\n\n",ACCEPTED,956,384
1591046056543059968,25b8e249c556de062ec0d61286db67304f907bc70204e22083d75434403578b1,2022-11-11 20:31:54,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n;\n\tscanf(\""%d\"",&n);\n\tint a[n],b[n];\n\tint i;\n\tfor(i=0;i<n;i++)\n\t    scanf(\""%d\"",&a[i]);\n\tfor(i=0;i<n;i++)\n\t\tscanf(\""%d\"",&b[i]);\n\tint j=0;\n\tint c[n];\n\tfor(i=0;i<n;i++)\n\t\tc[i]=b[i]-a[i];\t\t\n\tint flag=0;\n\t for(i=0;i<n;i++)\n\t {\n\t  int sum=0, m=0;\n\t  for(j=i;j<n;j++)\n\t  {\n\t   sum+=c[j];\n\t   if(sum>m) m=sum;\n\t  }\n\t  if(m>flag) flag=m;\n\t }\n\t printf(\""%d\"",flag);\n    return 0;\n}",ACCEPTED,3,188
1591046072653361152,7222c2fb91a71fcf3f6560860557ab564f69a453594c9f1620ecc35bb26f5daf,2022-11-11 20:31:58,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    int max=0,n,i,j,m,sum=0;\n scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=0;i<10;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<10;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    \n    for(i=0;i<10;i++)\n    {\n        m=b[i]-a[i];\n           sum+=m;\n       if(sum>=max)\n       {   \n           max=sum;\n       }\n        }\n    \n    printf(\""%d\"",max);\n    \n    return 0;\n}",WRONG_ANSWER,4,188
1591046357803139072,4e8bf5e988ac4275aeb23eae913a385055ab79de14dc27373b9e62a15269d138,2022-11-11 20:33:06,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\nb=input()\n#c=b.split(' ',a-1)\nx = 1\nfor i in c:\n    for j in range(int(i)):\n        x=x*6\n    y=x%10\n    print(y)\n",NON_ZERO_EXIT_CODE,18,2756
1591046366430826496,2af449595ef30f97cefb348732f77a537f3df93d20abf901fe2ea852a179091b,2022-11-11 20:33:08,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint x,y,z,n; \n\tscanf(\""%d\"",&x);\n\tscanf(\""%d\"",&y);\n\tscanf(\""%d\"",&z);\n\tn = x + y - z;\n\tprintf(\""%d\"",n);\n\treturn 0;\n}",ACCEPTED,6,344
1591046378468478976,aa0e227662691639471f7b18bc3d5c6aa34fdabcef6d52266691b6fbe7e8d245,2022-11-11 20:33:11,Java,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n   int a,b,c;\n\t Scanner in = new Scanner(System.in);\n          a = in.nextInt();\n          b = in.nextInt();\n          c = in.nextInt();\n    if(a>=0&&a<=100&&b>=0&&b<=100&&c>=0&&c<=100) {\n    \tSystem.out.print(a+b-c);\n             }\n    }\n}",ACCEPTED,277,16672
1591046401981747200,13616e85f216dd3844293b46f4b46105a0a2c458f7807a7b677858feb35cb63a,2022-11-11 20:33:17,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n   int n,i;\n   scanf(\""%d\"",&n);\n   int a[n],b[n];\n   for(i=0;i<n;i++)\n   {\n       scanf(\""%d\"",&a[i]);\n   }\n    for(i=0;i<n;i++)\n   {\n       scanf(\""%d\"",&b[i]);\n          a[i]=b[i]-a[i];\n   }\n\n   int sum=0,num=0;\nfor(i=0;i<n;i++)\n{\n    sum=a[i]+sum;\n\n    if(sum>num)\n        num=sum;\n\n\n}\nprintf(\""%d\"",num);\nprintf(\""\\n\"");\n    return 0;\n}\n",WRONG_ANSWER,2,192
1591046491857293312,4e8bf5e988ac4275aeb23eae913a385055ab79de14dc27373b9e62a15269d138,2022-11-11 20:33:38,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\nb=input()\n#c=b.split(' ',a-1)\nx = 1\nfor i in b:\n    for j in range(int(i)):\n        x=x*6\n    y=x%10\n    print(y)\n",NON_ZERO_EXIT_CODE,16,2756
1591046539294867456,a2fa7eb1ab1c2f6fa23517852ee6971ea32fd0c7742d71d7914ed729415f04d9,2022-11-11 20:33:49,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint n,num=0,max=0;\n\tcin>>n;\n\tint a[n+1]={},b[n+1]={},c[n+1]={};\n\tfor(int i=1;i<=n;i++)\n\t    cin>>a[i];\n\tfor(int i=1;i<=n;i++)\n\t    cin>>b[i];\t\t    \n    int i=1,m=n;\n\twhile(m>0)\n\t{\n       \tif(b[i]-a[i]<0)\n\t\t{\n\t\t\ti++;\n\t\t\tnum=0;\n\t\t}\n\t\tif(b[i]-a[i]>0)\n\t\t{\t\n\t\t    for(int j=i;j<=n;j++)\t\n\t\t    {\n\t\t\t    if(b[j]-a[j]<0) \n\t\t\t        break;\n\t\t\t    num=num+b[j]-a[j];\n\t\t\t    if(num>max)\n\t\t\t        max=num;\t\t\t    \t\t\t\t\t\t\t\n\t\t    }\n\t    } \n\t\tm=n-i;   \t    \n    }\n\tcout<<max;\t\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,400,312
1591046587067969536,a2fa7eb1ab1c2f6fa23517852ee6971ea32fd0c7742d71d7914ed729415f04d9,2022-11-11 20:34:01,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint n,num=0,max=0;\n\tcin>>n;\n\tint a[n+1]={},b[n+1]={},c[n+1]={};\n\tfor(int i=1;i<=n;i++)\n\t    cin>>a[i];\n\tfor(int i=1;i<=n;i++)\n\t    cin>>b[i];\t\t    \n    int i=1,m=n;\n\twhile(m>0)\n\t{\n       \tif(b[i]-a[i]<0)\n\t\t{\n\t\t\ti++;\n\t\t\tnum=0;\n\t\t}\n\t\tif(b[i]-a[i]>0)\n\t\t{\t\n\t\t    for(int j=i;j<=n;j++)\t\n\t\t    {\n\t\t\t    if(b[j]-a[j]<0) \n\t\t\t        break;\n\t\t\t    num=num+b[j]-a[j];\n\t\t\t    if(num>max)\n\t\t\t        max=num;\t\t\t    \t\t\t\t\t\t\t\n\t\t    }\n\t    } \n\t\tm=n-i;   \t    \n    }\n\tcout<<max;\t\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,400,440
1591046610547707904,4e8bf5e988ac4275aeb23eae913a385055ab79de14dc27373b9e62a15269d138,2022-11-11 20:34:06,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\nb=input()\n#c=b.split(' ',a-1)\nx = 1\nfor i in b:\n    x=6**i\n    y=x%10\n    print(y)\n",NON_ZERO_EXIT_CODE,18,2756
1591046636531396608,5d1852a153062cc8297ed7a30bb643375395a70654d5dff506fad6bc186e81bd,2022-11-11 20:34:13,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int i,n,a[10];\n    int q=6;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    if(i=0) q=1;\n    else q=6;\n    for(i=0;i<n-1;i++){\n        printf(\""%d\\n\"",q);\n    }\n    printf(\""%d\"",q);\n    return 0;\n}",WRONG_ANSWER,11,324
1591046672602411008,4e8bf5e988ac4275aeb23eae913a385055ab79de14dc27373b9e62a15269d138,2022-11-11 20:34:21,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\nb=input()\n#c=b.split(' ',a-1)\nx = 1\nfor i in b:\n    x=6**int(i)\n    y=x%10\n    print(y)\n",NON_ZERO_EXIT_CODE,16,2876
1591046673634234368,4e8bf5e988ac4275aeb23eae913a385055ab79de14dc27373b9e62a15269d138,2022-11-11 20:34:21,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\nb=input()\n#c=b.split(' ',a-1)\nx = 1\nfor i in b:\n    x=6**int(i)\n    y=x%10\n    print(y)\n",NON_ZERO_EXIT_CODE,16,3012
1591046699102048256,5d1852a153062cc8297ed7a30bb643375395a70654d5dff506fad6bc186e81bd,2022-11-11 20:34:27,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int i,n,a[100];\n    int q=6;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    if(i=0) q=1;\n    else q=6;\n    for(i=0;i<n-1;i++){\n        printf(\""%d\\n\"",q);\n    }\n    printf(\""%d\"",q);\n    return 0;\n}",WRONG_ANSWER,9,352
1591046778164674560,4e8bf5e988ac4275aeb23eae913a385055ab79de14dc27373b9e62a15269d138,2022-11-11 20:34:46,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\nb=input()\n#c=b.split(' ',a-1)\nfor i in b:\n    x=6**int(i)\n    y=x%10\n    print(y)\n",NON_ZERO_EXIT_CODE,17,2764
1591046795109662720,c3cd14f35a8796e3a62f8cb6f4fc316eb939d8fb951152a336f034c1ffa23fad,2022-11-11 20:34:50,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint results(int a,int b,int c);\nint main()\n{\n\tint X,Y,Z,S;\n\tscanf(\""%d %d %d\"",&X,&Y,&Z);\n\tS=results(X,Y,Z);\n\tprintf(\""%d\"",S);\n}\nint results(int a,int b,int c)\n{\n\tint q;\n\tif(0<=a<=100 && 0<=b<=100 && 0<=c<=100)\n\t{\n\t\tq=a+b-c;\n\t\treturn q;\n\t}\n\t\n}",ACCEPTED,6,324
1591046839032418304,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-11-11 20:35:01,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,a=0,b=0;\n    scanf(\""%d\"",&n);\n    for(i=1;i<n;i++)\n    {\n        if(n%i==0)\n            a=a+1;\n        if(a=2)\n            b=b+1;\n    }\n    printf(\""%d\"",b);\n    return 0;\n}",COMPILE_ERROR,0,0
1591047073284272128,c47b15e117166a3dd00078b9f795673d5284a2761e582479119229751cc734d3,2022-11-11 20:35:57,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define MAX 1000\n\n\nint main() {\n   int p=0,q=0,n,m,i,j;\n   int str1[MAX];\n   int str2[MAX];\n   int str3[MAX];\n   scanf(\""%d\"",&n);\n   for (i=0;i<n;i++)\n    scanf(\""%d\"",&str1[i]);\n\n   for (i=0;i<n;i++)\n    scanf(\""%d\"",&str2[i]);\n\n    for (i=0;i<n;i++)\n        str3[i]=str2[i]-str1[i];\n    q=str3[0];\n    for (j=0;j<n;j++)\n    {\n        m=0;\n        for (i=j;i<n;i++)\n      {\n         m+=str3[i];\n         if(m>p)\n            p=m;\n            if(p>q)\n            q=p;\n         else break;\n\n\n      }\n    }\n\n    printf(\""%d\\n\"",q);\n\n\n\n\n    return 0;\n}\n",WRONG_ANSWER,3,324
1591047133539667968,1c76961e293959cbfa749568290c58d912c131cbc4a710b8bd9a4e58eccf0b8e,2022-11-11 20:36:11,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int a,m,t;\n    scanf(\""%d\\n\"",&a);\n    int i,n;\n    for(i=0;i<a;i++)\n    {\n        scanf (\""%d \"",&n);\n        if(n>0)\n            printf(\""6\"");\n        else\n            printf(\""1\"");\n            printf(\""\\n\"");\n    }\n    return 0;\n}\n",WRONG_ANSWER,6,184
1591047177412087808,d0d7b0b753346ba8da319a4bb32af868fdf41e2104a53a3a3d7b5b76c65907fe,2022-11-11 20:36:21,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,4,324
1591047198618488832,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-11 20:36:27,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,t=0;\n    int i,j;\n    int flag=1;\n    scanf(\""%d\"",&n);\n    for(i=2;i<n;i++)\n    {\n        flag=1;\n        for(j=2;j<=sqrt(i);j++)\n            if(i%j==0) \n                flag = 0;\n            if(flag==1) \n                t++;\n    }\n    printf(\""%d\"",t);\n    return 0;\n}",ACCEPTED,63,512
1591047221540356096,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-11-11 20:36:32,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,t=0;\n    int i,j;\n    int flag=1;\n    scanf(\""%d\"",&n);\n    for(i=2;i<n;i++)\n    {\n        flag=1;\n        for(j=2;j<=sqrt(i);j++)\n            if(i%j==0) \n                flag = 0;\n            if(flag==1) \n                t++;\n    }\n    printf(\""%d\"",t);\n    return 0;\n}",ACCEPTED,69,336
1591047448699666432,5d1852a153062cc8297ed7a30bb643375395a70654d5dff506fad6bc186e81bd,2022-11-11 20:37:26,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int i,n,a[100];\n    int q=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    if(i=0) q=1;\n    else q=6;\n    for(i=0;i<n-1;i++){\n        printf(\""%d\\n\"",q);\n    }\n    return 0;\n}",WRONG_ANSWER,4,312
1591047530916417536,5d1852a153062cc8297ed7a30bb643375395a70654d5dff506fad6bc186e81bd,2022-11-11 20:37:46,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int q,i,n,a[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    if(i=0) q=1;\n    else q=6;\n    for(i=0;i<n-1;i++){\n        printf(\""%d\\n\"",q);\n    }\n    return 0;\n}",WRONG_ANSWER,4,336
1591047692241932288,7222c2fb91a71fcf3f6560860557ab564f69a453594c9f1620ecc35bb26f5daf,2022-11-11 20:38:24,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    int max=0,n,i,j,m,sum=0;\n scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=0;i<10;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<10;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    \n    for(i=0;i<10;i++)\n    {sum=0;\n        for(j=i;j<10;j++)\n        {\n        m=b[j]-a[j];\n           sum+=m;\n       if(sum>=max)\n       {   \n           max=sum;\n       }\n        }\n    }\n    printf(\""%d\\n\"",max);\n    \n    return 0;\n}",WRONG_ANSWER,3,324
1591047736139517952,7222c2fb91a71fcf3f6560860557ab564f69a453594c9f1620ecc35bb26f5daf,2022-11-11 20:38:35,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    int max=0,n,i,j,m,sum=0;\n scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=0;i<10;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<10;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    \n    for(i=0;i<10;i++)\n    {sum=0;\n        for(j=i;j<10;j++)\n        {\n        m=b[j]-a[j];\n           sum+=m;\n       if(sum>=max)\n       {   \n           max=sum;\n       }\n        }\n    }\n    printf(\""%d\"",max);\n    \n    return 0;\n}",WRONG_ANSWER,3,360
1591047845455663104,e7f8e9ba366feb4551b7dc8e6a149f796e822980a43de4fcc91ded552c4bcbd4,2022-11-11 20:39:01,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <time.h>\n\nint main()\n{   \n    int y=2022; \n    printf(\""%d\"",y);\n    return 0;\n}",ACCEPTED,3,344
1591047967602180096,7222c2fb91a71fcf3f6560860557ab564f69a453594c9f1620ecc35bb26f5daf,2022-11-11 20:39:30,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    int max=0,n,i,j,m,sum=0;\n scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=0;i<10;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<10;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    \n    for(i=0;i<n;i++)\n    {sum=0;\n        for(j=i;j<n;j++)\n        {\n        m=b[j]-a[j];\n           sum+=m;\n       if(sum>=max)\n       {   \n           max=sum;\n       }\n        }\n    }\n    printf(\""%d\"",max);\n    \n    return 0;\n}",WRONG_ANSWER,4,192
1591048059084148736,63bdcc3416dd0c07c03f833ffb02c2f304a4f523deae6a87bed24a730e4d224d,2022-11-11 20:39:52,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n;\n    int a[i];\n    for(i=0;i<=n;i++)\n    scanf(\""%d\\n\"",&n);\n    scanf(\""%d\"",&a[i]);\n    result=pow(6,n);\n    printf(\""%d\\n\"",result);\n    printf(\""%d\\n\"",result);\n    printf(\""%d\"",result);\n    \n return 0;\n}",COMPILE_ERROR,0,0
1591048202483204096,63bdcc3416dd0c07c03f833ffb02c2f304a4f523deae6a87bed24a730e4d224d,2022-11-11 20:40:26,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,result;\n    int a[i];\n    for(i=0;i<=n;i++)\n    scanf(\""%d\\n\"",&n);\n    scanf(\""%d\"",&a[i]);\n    result=pow(6,n);\n    printf(\""%d\\n\"",result);\n    printf(\""%d\\n\"",result);\n    printf(\""%d\"",result);\n    \n return 0;\n}",COMPILE_ERROR,0,0
1591048224838823936,7222c2fb91a71fcf3f6560860557ab564f69a453594c9f1620ecc35bb26f5daf,2022-11-11 20:40:31,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    int max=0,n,i,j,m,sum=0;\n scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    \n    for(i=0;i<n;i++)\n    {sum=0;\n        for(j=i;j<n;j++)\n        {\n        m=b[j]-a[j];\n           sum+=m;\n       if(sum>=max)\n       {   \n           max=sum;\n       }\n        }\n    }\n    printf(\""%d\"",max);\n    \n    return 0;\n}",ACCEPTED,5,192
1591048237186854912,c47b15e117166a3dd00078b9f795673d5284a2761e582479119229751cc734d3,2022-11-11 20:40:34,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define MAX 1000\n\n\nint main() {\n   int p=0,q=0,n,m,i,j;\n   int str1[MAX];\n   int str2[MAX];\n   int str3[MAX];\n   scanf(\""%d\"",&n);\n   for (i=0;i<n;i++)\n    scanf(\""%d\"",&str1[i]);\n\n   for (i=0;i<n;i++)\n    scanf(\""%d\"",&str2[i]);\n\n    for (i=0;i<n;i++)\n        str3[i]=str2[i]-str1[i];\n    for (j=0;j<n;j++)\n    {\n        m=0;\n        for (i=j;i<n;i++)\n      {     p=str3[i];\n              q=p;\n         m+=str3[i];\n         if(m>p)\n            p=m;\n\n            if(p>q)\n            q=p;\n         else break;\n\n\n      }\n    }\n\n    printf(\""%d\\n\"",q);\n\n\n\n\n    return 0;\n}\n",WRONG_ANSWER,3,320
1591048369865293824,0cfbb4a339ebbc4dce13b5f3e3f98a3def0ab17ef5b4ac8e6d566de92e1f5f78,2022-11-11 20:41:06,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#define N 100\nint a[N];\nint b[N];\nint c[N];\n\nvoid max(int n){\n    int maxn=0;\n    int s=0;\n    for(int i=0;i<n;i++){\n        for(int j=i;j<n;j++){\n            s+=c[j];\n            if(s>maxn){\n                maxn=s;\n            }\n        }\n    }\n    printf(\""%d\"",maxn);\n}\n\nint main(){\n    int n;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(int j=0;j<n;j++){\n        scanf(\""%d\"",&b[j]);\n    }\n    for(int k=0;k<n;k++){\n        c[k]=b[k]-a[k];\n    }\n    max(n);\n    return 0;\n}\n",WRONG_ANSWER,4,348
1591048506402471936,5d1852a153062cc8297ed7a30bb643375395a70654d5dff506fad6bc186e81bd,2022-11-11 20:41:38,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int q,i,n,a[10];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    if(i=0) q=1;\n    else q=6;\n    for(i=0;i<n-1;i++){\n        printf(\""%d\\n\"",q);\n    }\n    printf(\""%d\"",q);\n    return 0;\n}",WRONG_ANSWER,8,308
1591048557795278848,fbea21dbaf89f1b064feaa20227f21c5e1c4888fdc371cf5e43f70615906e52a,2022-11-11 20:41:51,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"n = int(input())\na = list(map(int, input().split()))\nb = a[::-1]\nnum = []\nc = []\nx=0\nfor i in range(len(a)):\n    num.append(b[i] - a[i])\nfor z in range(len(num)):\n    x=num[z]\n    for j in range(z+1,len(num)):\n        x+=num[j]\n        c.append(x)\nprint(max(c))",WRONG_ANSWER,16,2788
1591048564803964928,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-11 20:41:52,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"num = input()\na = input()\nb = input()\nprint(\""25\"")\nprint(/n)",NON_ZERO_EXIT_CODE,19,2868
1591048590091419648,8cf8229a23351e1ca2a7bfc1ad0af3ab2ad4a709a7c796637dbdea7befc2b0ec,2022-11-11 20:41:58,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int n;\n    int i;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=0;i<n;i++)\n    {\n        if(i==0)\n            scanf(\""%d\"",&a[i]);\n        else\n            scanf(\"" %d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if(i==0)\n        {\n            if(a[i]==0)\n                printf(\""1\"");\n            else\n                printf(\""6\"");\n        }\n        else\n        {\n            if(a[i]==0)\n                printf(\""\\n1\"");\n            else\n                printf(\""\\n6\"");\n        }\n\n    }\n    return 0;\n}",ACCEPTED,10,452
1591048602552700928,c03ae905b4de4d41e5d9328da5270539e1a32e2d888b8dd41fb10f72c24a90ce,2022-11-11 20:42:01,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,a = 2022\nprint(a)\n,COMPILE_ERROR,0,0
1591048678452826112,c03ae905b4de4d41e5d9328da5270539e1a32e2d888b8dd41fb10f72c24a90ce,2022-11-11 20:42:19,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,a = 2022\nprint(a)\n,ACCEPTED,17,2744
1591048702721069056,2af449595ef30f97cefb348732f77a537f3df93d20abf901fe2ea852a179091b,2022-11-11 20:42:25,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n\tint i,x,y;\n\tscanf(\""%d\"",&x);\n\tfor(i=0;i<x;i++){\n\t\tscanf(\""%d\"",&y);\n\t\ty = pow(6,y);\n\t\ty = y%10;\n\t\tprintf(\""%d\\n\"",y); \n\t}\n\treturn 0;\n}",WRONG_ANSWER,6,344
1591048787446005760,13616e85f216dd3844293b46f4b46105a0a2c458f7807a7b677858feb35cb63a,2022-11-11 20:42:45,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n   int n,i;\n    if( scanf(\""%d\"",&n))\n    {\n  \n   int a[n],b[n];\n   for(i=0;i<n;i++)\n   {\n       scanf(\""%d\"",&a[i]);\n   }\n    for(i=0;i<n;i++)\n   {\n       scanf(\""%d\"",&b[i]);\n          a[i]=b[i]-a[i];\n   }\n\n   int sum=0,num=0;\nfor(i=0;i<n;i++)\n{\n    sum=a[i]+sum;\n\n    if(sum>num)\n        num=sum;\n\n\n}\nprintf(\""%d\"",num);\nprintf(\""\\n\"");\n    }\n    return 0;\n}\n",WRONG_ANSWER,3,200
1591048858937917440,4e8bf5e988ac4275aeb23eae913a385055ab79de14dc27373b9e62a15269d138,2022-11-11 20:43:02,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,a=int(input())\nb=input().split()\nfor i in b:\n    x=6**int(i)\n    y=x%10\n    print(y),TIME_LIMIT_EXCEEDED,166,4108
1591048861001515008,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-11 20:43:03,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int t,i,n,a,b;\n    0<=n<=pow10(9);\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<t;i++)\n    a=pow(6,n);\n    b=a%10;\n    printf(\""%d\\n\"",b);\n    printf(\""%d\\n\"",b);\n    printf(\""%d\\n\"",b);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1591048880412753920,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-11 20:43:08,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=eval(input())\nlist = map(eval,input().split())\nfor i in list:\n    if 0<=i<=1000000000:\n        if i==0:\n            print(\""1\"")\n        else:\n            print(\""6\"")",WRONG_ANSWER,30,2748
1591048896149762048,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-11 20:43:11,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int t,i,n,a,b;\n    0<=n<=pow10(9);\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<t;i++)\n    a=pow(6,n);\n    b=a%10;\n    printf(\""%d\\n\"",b);\n    printf(\""%d\\n\"",b);\n    printf(\""%d\\n\"",b);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1591049041058791424,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-11 20:43:46,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"a = int(input())\nm=0\nif 2<=a <=100000:\n    for n in range(2,a+1):\n        for x in range(2,n/2):\n            if n%x ==0:\n                break\n            else:\n                m=m+1\nprint(m)\n            \n    \n",NON_ZERO_EXIT_CODE,16,3500
1591049193043570688,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-11 20:44:22,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int i,j,n,a,b;\n    0<=n<=pow10(9);\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<j;i++)\n    a=pow(6,n);\n    b=a%10;\n    printf(\""%d\\n\"",b);\n    printf(\""%d\\n\"",b);\n    printf(\""%d\\n\"",b);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1591049328553168896,20eba57d0ae5a9e589a2b203a4648cce520c99291e8744872f7a5a5911e19e34,2022-11-11 20:44:54,Java,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n    \tScanner input=new Scanner(System.in);\n    \tSystem.out.print(\""请输入三个数字X，Y，Z（X>=0;Y,Z<=100;按回车确定一个数字）:\"");\n        int a=input.nextInt();\n        int b=input.nextInt();\n        int c=input.nextInt();\n        if(a>=0&&b<=100&&c<=100)\n        {\n            System.out.print(+a+b-c);\n        }\n    }\n}",WRONG_ANSWER,129,16100
1591049403140452352,13616e85f216dd3844293b46f4b46105a0a2c458f7807a7b677858feb35cb63a,2022-11-11 20:45:12,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n   int n,i,m;\n   if(scanf(\""%d\"",&n))\n     m=0;\n   int a[n],b[n];\n   for(i=0;i<n;i++)\n   {\n       scanf(\""%d\"",&a[i]);\n   }\n    for(i=0;i<n;i++)\n   {\n       scanf(\""%d\"",&b[i]);\n          a[i]=b[i]-a[i];\n   }\n\n   int sum=0,num=0;\nfor(i=0;i<n;i++)\n{\n    sum=a[i]+sum;\n\n    if(sum>num)\n        num=sum;\n\n\n}\nprintf(\""%d\"",num);\nprintf(\""\\n\"");\n\n    return 0;\n}\n",WRONG_ANSWER,4,184
1591049406294589440,2af449595ef30f97cefb348732f77a537f3df93d20abf901fe2ea852a179091b,2022-11-11 20:45:13,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n\tint i,x,y;\n\tscanf(\""%d\"",&x);\n\tfor(i=0;i<x;i++){\n\t\tscanf(\""%d\"",&y);\n\t\ty = pow(6,y);\n\t\ty = y%10;\n\t\tif(i==x-1){\n\t\t\tprintf(\""%d\"",y); \n\t\t}else{\n\t\t\tprintf(\""%d\\n\"",y); \n\t\t}\n\t}\n\treturn 0;\n}",WRONG_ANSWER,6,328
1591049448673816576,20eba57d0ae5a9e589a2b203a4648cce520c99291e8744872f7a5a5911e19e34,2022-11-11 20:45:23,Java,300.0,1590524835191705600,1572865591226855424,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n    \tScanner input=new Scanner(System.in);\n        int a=input.nextInt();\n        int b=input.nextInt();\n        int c=input.nextInt();\n        if(a>=0&&b<=100&&c<=100)\n        {\n            System.out.print(+a+b-c);\n        }\n    }\n},ACCEPTED,268,16580
1591049819924246528,d0d7b0b753346ba8da319a4bb32af868fdf41e2104a53a3a3d7b5b76c65907fe,2022-11-11 20:46:52,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nvoid main()\n{\n    int X,Y,Z,A;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    A=X+Y-Z;\n    printf(\""%d\"",A);\n    return 0;\n}",ACCEPTED,8,196
1591049884759797760,c47b15e117166a3dd00078b9f795673d5284a2761e582479119229751cc734d3,2022-11-11 20:47:07,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define MAX 1000\n\n\nint main() {\n   int p=0,q=0,n,m,i,j;\n   int str1[MAX];\n   int str2[MAX];\n   int str3[MAX];\n   scanf(\""%d\"",&n);\n   for (i=0;i<n;i++)\n    scanf(\""%d\"",&str1[i]);\n\n   for (i=0;i<n;i++)\n    scanf(\""%d\"",&str2[i]);\n\n    for (i=0;i<n;i++)\n        str3[i]=str2[i]-str1[i];\n    for (j=0;j<n;j++)\n    {\n        m=0;\n        for (i=j;i<n;i++)\n      {     p=str3[i];\n              q=p;\n         m+=str3[i];\n         if(m>p)\n            p=m;\n\n            if(p>q)\n            q=p;\n         //if(m<=p) break;\n\n\n      }\n    }\n\n    printf(\""%d\\n\"",p);\n\n\n\n\n    return 0;\n}\n",WRONG_ANSWER,3,192
1591050041685508096,7222c2fb91a71fcf3f6560860557ab564f69a453594c9f1620ecc35bb26f5daf,2022-11-11 20:47:44,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    int max=0,n,i,j,m,sum=0;\n scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    \n    \n        for(j=i;j<n;j++)\n        {\n        m=b[i]-a[i];\n           sum+=m;\n       if(sum>=max)\n       {   \n           max=sum;\n       }\n        \n    }\n    printf(\""%d\\n\"",max);\n    \n    return 0;\n}",WRONG_ANSWER,4,464
1591050058257203200,4e8bf5e988ac4275aeb23eae913a385055ab79de14dc27373b9e62a15269d138,2022-11-11 20:47:48,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\nb=input().split()\nfor i in b:\n    x=math.pow(6,int(i))\n    y=x%10\n    print(y)",NON_ZERO_EXIT_CODE,15,2756
1591050070118699008,7222c2fb91a71fcf3f6560860557ab564f69a453594c9f1620ecc35bb26f5daf,2022-11-11 20:47:51,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    int max=0,n,i,j,m,sum=0;\n scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=0;i<10;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<10;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    \n    for(i=0;i<10;i++)\n    {sum=0;\n        for(j=i;j<10;j++)\n        {\n        m=b[i]-a[i];\n           sum+=m;\n       if(sum>=max)\n       {   \n           max=sum;\n       }\n        }\n    }\n    printf(\""%d\\n\"",max);\n    \n    return 0;\n}",WRONG_ANSWER,5,348
1591050122178400256,7222c2fb91a71fcf3f6560860557ab564f69a453594c9f1620ecc35bb26f5daf,2022-11-11 20:48:04,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    int max=0,n,i,j,m,sum=0;\n scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    \n    for(i=0;i<n;i++)\n    {sum=0;\n        for(j=i;j<10;j++)\n        {\n        m=b[i]-a[i];\n           sum+=m;\n       if(sum>=max)\n       {   \n           max=sum;\n       }\n        }\n    }\n    printf(\""%d\\n\"",max);\n    \n    return 0;\n}",WRONG_ANSWER,3,196
1591050174124851200,7222c2fb91a71fcf3f6560860557ab564f69a453594c9f1620ecc35bb26f5daf,2022-11-11 20:48:16,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    int max=0,n,i,j,m,sum=0;\n scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    \n    for(i=0;i<n;i++)\n    {sum=0;\n        for(j=i;j<n;j++)\n        {\n        m=b[i]-a[i];\n           sum+=m;\n       if(sum>=max)\n       {   \n           max=sum;\n       }\n        }\n    }\n    printf(\""%d\\n\"",max);\n    \n    return 0;\n}",WRONG_ANSWER,3,344
1591050227933577216,0cfbb4a339ebbc4dce13b5f3e3f98a3def0ab17ef5b4ac8e6d566de92e1f5f78,2022-11-11 20:48:29,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#define N 100\nint a[N];\nint b[N];\nint c[N];\n\nvoid max(int n){\n    int maxn=0;\n    int s=0;\n    for(int i=0;i<n;i++){\n        for(int j=i;j<n;j++){\n            s+=c[j];\n            if(s<0){\n                s=0;\n            }\n            if(s>maxn){\n                maxn=s;\n            }\n        }\n    }\n    printf(\""%d\"",maxn);\n}\n\nint main(){\n    int n;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(int j=0;j<n;j++){\n        scanf(\""%d\"",&b[j]);\n    }\n    for(int k=0;k<n;k++){\n        c[k]=b[k]-a[k];\n    }\n    max(n);\n    return 0;\n}\n",WRONG_ANSWER,2,196
1591050284850282496,13616e85f216dd3844293b46f4b46105a0a2c458f7807a7b677858feb35cb63a,2022-11-11 20:48:42,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n   int n,i;\n   if(scanf(\""%d\"",&n))\n     i=0;\n   int a[n],b[n];\n   for(i=0;i<n;i++)\n   {\n       if(scanf(\""%d\"",&a[i]))\n               i=i;\n   }\n    for(i=0;i<n;i++)\n   {\n       if(scanf(\""%d\"",&b[i]))\n          a[i]=b[i]-a[i];\n   }\n\n   int sum=0,num=0;\nfor(i=0;i<n;i++)\n{\n    sum=a[i]+sum;\n\n    if(sum>num)\n        num=sum;\n\n\n}\nprintf(\""%d\"",num);\nprintf(\""\\n\"");\n\n    return 0;\n}\n",WRONG_ANSWER,3,332
1591050317200949248,7222c2fb91a71fcf3f6560860557ab564f69a453594c9f1620ecc35bb26f5daf,2022-11-11 20:48:50,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    int max=0,n,i,j,m,sum=0;\n scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    \n    for(i=0;i<n;i++)\n    {sum=0;\n        for(j=i;j<n;j++)\n        {\n        m=b[j]-a[j];\n           sum+=m;\n       if(sum>=max)\n       {   \n           max=sum;\n       }\n        }\n    }\n    printf(\""%d\\n\"",max);\n    \n    return 0;\n}",ACCEPTED,3,196
1591050330006163456,13616e85f216dd3844293b46f4b46105a0a2c458f7807a7b677858feb35cb63a,2022-11-11 20:48:53,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n   int n,i;\n   if(scanf(\""%d\"",&n))\n     i=0;\n   int a[n],b[n];\n   for(i=0;i<n;i++)\n   {\n       if(scanf(\""%d\"",&a[i]))\n               i=i;\n   }\n    for(i=0;i<n;i++)\n   {\n       if(scanf(\""%d\"",&b[i]))\n          a[i]=b[i]-a[i];\n   }\n\n   int sum=0,num=0;\nfor(i=0;i<n;i++)\n{\n    sum=a[i]+sum;\n\n    if(sum>num)\n        num=sum;\n\n\n}\nprintf(\""%d\"",num);\nprintf(\""\\n\"");\n\n    return 0;\n}\n",WRONG_ANSWER,4,180
1591050333609066496,2af449595ef30f97cefb348732f77a537f3df93d20abf901fe2ea852a179091b,2022-11-11 20:48:54,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n\tint i,x,y;\n\tscanf(\""%d\"",&x);\n\tfor(i=0;i<x;i++){\n\t\tscanf(\""%d\"",&y);\n\t\tif(y==0){\n\t\t\tprintf(\""%d\\n\"",1);\n\t\t}else{\n\t\t\tprintf(\""%d\\n\"",6);\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,11,364
1591050353410355200,5d1852a153062cc8297ed7a30bb643375395a70654d5dff506fad6bc186e81bd,2022-11-11 20:48:59,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int q,i,n,a[10];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n   \n    for(i=0;i<n-1;i++){\n        if(i=0){\n            q=1;\n            printf(\""%d\"",q);\n        }\n        else{\n            q=6;\n            printf(\""%d\"",q);\n        }\n    }\n    printf(\""%d\"",q);\n    return 0;\n}",TIME_LIMIT_EXCEEDED,20,576
1591050398322982912,5d1852a153062cc8297ed7a30bb643375395a70654d5dff506fad6bc186e81bd,2022-11-11 20:49:09,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int q,i,n,a[10];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n   \n    for(i=0;i<n-1;i++){\n        if(i=0){\n            q=1;\n            printf(\""%d\"",q);\n        }\n        else{\n            q=6;\n            printf(\""%d\"",q);\n        }\n    }\n    printf(\""%d\"",q);\n    return 0;\n}",TIME_LIMIT_EXCEEDED,20,1016
1591050467143102464,c47b15e117166a3dd00078b9f795673d5284a2761e582479119229751cc734d3,2022-11-11 20:49:26,C++,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define MAX 1000\n\n\nint main() {\n   int p=0,q=0,n,m,i,j;\n   int str1[MAX];\n   int str2[MAX];\n   int str3[MAX];\n   scanf(\""%d\"",&n);\n   for (i=0;i<n;i++)\n    scanf(\""%d\"",&str1[i]);\n\n   for (i=0;i<n;i++)\n    scanf(\""%d\"",&str2[i]);\n\n    for (i=0;i<n;i++)\n        str3[i]=str2[i]-str1[i];\n    q=p=str3[i];\n    for (j=0;j<n;j++)\n    {\n        m=0;\n        for (i=j;i<n;i++)\n      {     \n         m+=str3[i];\n         if(m>p)\n            p=m;\n\n            if(p>q)\n            q=p;\n         //if(m<=p) break;\n\n\n      }\n    }\n\n    printf(\""%d\\n\"",p);\n\n\n\n\n    return 0;\n}\n",ACCEPTED,3,200
1591050468254613504,5d1852a153062cc8297ed7a30bb643375395a70654d5dff506fad6bc186e81bd,2022-11-11 20:49:26,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int q,i,n,a[10];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    if(i=0) q=1;\n    else q=6;\n    for(i=0;i<n-1;i++){\n        printf(\""%d\\n\"",q);\n    }\n    printf(\""%d\"",q);\n    return 0;\n}",WRONG_ANSWER,11,320
1591050484415266816,4e8bf5e988ac4275aeb23eae913a385055ab79de14dc27373b9e62a15269d138,2022-11-11 20:49:30,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\na=int(input())\nb=input().split()\nfor i in b:\n    x=math.pow(6,int(i))\n    y=int(x%10)\n    print(y)\n\n",NON_ZERO_EXIT_CODE,31,2756
1591050500496207872,ef50cfe7f34b26d29f617c97ac65d40bd15ba1e063897a190284243de955e254,2022-11-11 20:49:34,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args){\n\t    Scanner sc=new Scanner(System.in);\n\t    int t=sc.nextInt();\n\t    int i,n;\n\t    for(i=0;i<t-1;i++) {\n\t    \tn=sc.nextInt();\n\t    \tif(n==0) System.out.println(\""1\"");\n\t    \telse System.out.println(\""6\"");\n\t    }\n        n=sc.nextInt();\n\t    if(n==0) System.out.print(\""1\"");\n\t    else System.out.print(\""6\"");\n\t}\n\t\n}",NON_ZERO_EXIT_CODE,251,16760
1591050522780545025,aa0e227662691639471f7b18bc3d5c6aa34fdabcef6d52266691b6fbe7e8d245,2022-11-11 20:49:39,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        int sum=0;\n\t\t\tScanner in=new Scanner(System.in);\n\t\t        int n=in.nextInt();\n\t\t        for(int i=2;i<=n;i++){\n\t\t            for (int j=2;j<=i;j++){\n\t\t                if(i%j==0 && j!=i){\n\t\t                \tsum++;\n\t\t                    break;\n\t\t                }    \n\t\t          }      \n\t\t          \n\t\t        }\n\t\t        \n\t\t      System.out.print(n-sum-1);\n\t}\n},TIME_LIMIT_EXCEEDED,1000,16380
1591050565486968832,13616e85f216dd3844293b46f4b46105a0a2c458f7807a7b677858feb35cb63a,2022-11-11 20:49:49,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n   int n,i;\n   if(scanf(\""%d\"",&n))\n     i=0;\n   int a[n],b[n];\n   for(i=0;i<n;i++)\n   {\n       if(scanf(\""%d\"",&a[i]))\n               i=i;\n   }\n    for(i=0;i<n;i++)\n   {\n       if(scanf(\""%d\"",&b[i]))\n          a[i]=b[i]-a[i];\n   }\n\n   int sum=0,num=0;\nfor(i=0;i<n;i++)\n{\n    sum=a[i]+sum;\n\n    if(sum>num)\n        num=sum;\n\n\n}\nprintf(\""%d\"",num);\nprintf(\""\\n\"");\n\n    return 0;\n}\n",WRONG_ANSWER,3,328
1591050601532796928,c03ae905b4de4d41e5d9328da5270539e1a32e2d888b8dd41fb10f72c24a90ce,2022-11-11 20:49:58,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <sidio.h>\n#include <stdlib.h>\n\nint main(){\n    int X,Y,Z;\n    int A;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    A = X+Y-Z;\n    printf(\""%d\"",A);\n    renturn 0;\n    \n    \n    \n}",COMPILE_ERROR,0,0
1591050640036507648,0cfbb4a339ebbc4dce13b5f3e3f98a3def0ab17ef5b4ac8e6d566de92e1f5f78,2022-11-11 20:50:07,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#define N 100\nint a[N];\nint b[N];\nint c[N];\n\nvoid max(int n){\n    int maxn=0;\n    int s=0;\n    for(int i=0;i<n;i++){\n        for(int j=i;j<n;j++){\n            s+=c[j];\n            if(s>maxn){\n                maxn=s;\n            }\n        }\n    }\n    if(maxn<0)\n        printf(\""0\"");\n    else\n        printf(\""%d\"",maxn);\n}\n\nint main(){\n    int n;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(int j=0;j<n;j++){\n        scanf(\""%d\"",&b[j]);\n    }\n    for(int k=0;k<n;k++){\n        c[k]=b[k]-a[k];\n    }\n    max(n);\n    return 0;\n}\n",WRONG_ANSWER,3,184
1591050665160388608,4e8bf5e988ac4275aeb23eae913a385055ab79de14dc27373b9e62a15269d138,2022-11-11 20:50:13,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\na=int(input())\nb=input().split()\nfor i in b:\n    x=math.pow(6,int(i))\n    y=int(x%10)\n    print(y)",NON_ZERO_EXIT_CODE,35,3004
1591050849789456384,ef50cfe7f34b26d29f617c97ac65d40bd15ba1e063897a190284243de955e254,2022-11-11 20:50:57,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args){\n\t    Scanner sc=new Scanner(System.in);\n\t    int t=sc.nextInt();\n\t    int i,n;\n\t    for(i=0;i<t;i++) {\n\t    \tn=sc.nextInt();\n\t    \tif(n==0) System.out.print(\""1\"");\n\t    \telse System.out.print(\""6\"");\n            if(i!=t-1) System.out.println(\""\"");\n\t    }\n\t}\n\t\n}",NON_ZERO_EXIT_CODE,255,17036
1591050979116650496,5d1852a153062cc8297ed7a30bb643375395a70654d5dff506fad6bc186e81bd,2022-11-11 20:51:28,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#define a[10]\nint main(){\n    int q,i,n;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    if(i=0) q=1;\n    else q=6;\n    for(i=0;i<n-1;i++){\n        printf(\""%d\\n\"",q);\n    }\n    printf(\""%d\"",q);\n    return 0;\n}",COMPILE_ERROR,0,0
1591051006178275328,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-11 20:51:34,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"\n#include <stdio.h>\n\nmain()\n{\n    printf(\""2022\\n\"");\n}",ACCEPTED,3,192
1591051012683640832,aa0e227662691639471f7b18bc3d5c6aa34fdabcef6d52266691b6fbe7e8d245,2022-11-11 20:51:36,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n       \tint sum=0;\n\t\t\tScanner in=new Scanner(System.in);\n\t\t        int n=in.nextInt();\n\t\t        if(n>100000&&n<0) {\n\t\t        \tSystem.out.print(\""输入有误！！\"");\n\t\t        }else {\n\t\t        for(int i=2;i<=n;i++){\n\t\t            for (int j=2;j<=i;j++){\n\t\t                if(i%j==0 && j!=i){\n\t\t                \tsum++;\n\t\t                    break;\n\t\t                }    \n\t\t          }      \n\t\t          \n\t\t        }\n\t\t        \n\t\t      System.out.print(n-sum-1);\n\t\t        }\n\t}\n}",TIME_LIMIT_EXCEEDED,1000,19440
1591051103918166016,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-11-11 20:51:58,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n    int i,j,n;\n    int a=1;\n    scanf(\""%d\"",&n);\n    if(n==2)\n        printf(\""1\\n\"");\n    else if(n>=2)\n    {\n        for(i=2;i<=n;i++)\n        {\n            if(i%2==0)\n                continue;\n            else\n            {\n                for(j=2;j<=i;j++)\n                {\n                    if(i%j==0)\n                    {\n                        if(i==j)\n                            a++;\n                        else\n                            break;\n                    }\n                }\n            }\n        }\n    }\n    printf(\""%d\\n\"",a);\n    return 0;\n}",TIME_LIMIT_EXCEEDED,1000,340
1591051115565748224,0cfbb4a339ebbc4dce13b5f3e3f98a3def0ab17ef5b4ac8e6d566de92e1f5f78,2022-11-11 20:52:00,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#define N 100\nint a[N];\nint b[N];\nint c[N];\n\nvoid max(int n){\n    int maxn=0;\n    for(int i=0;i<n;i++){\n        int s=0;\n        for(int j=i;j<n;j++){\n            s+=c[j];\n            if(s>maxn){\n                maxn=s;\n            }\n        }\n    }\n    if(maxn<0)\n        printf(\""0\"");\n    else\n        printf(\""%d\"",maxn);\n}\n\nint main(){\n    int n;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(int j=0;j<n;j++){\n        scanf(\""%d\"",&b[j]);\n    }\n    for(int k=0;k<n;k++){\n        c[k]=b[k]-a[k];\n    }\n    max(n);\n    return 0;\n}\n",ACCEPTED,3,336
1591051164823629824,e3700fa579dc7c925fa010ac870390ba9776ef5ee08f67752aeef4a9467c7624,2022-11-11 20:52:12,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n\n#include <stdlib.h>\n\nint main()\n\n{\n\nint n,i,j,y=0,x=0;\n\nscanf(\""%d\"",&n);\n\nint a[n],b[n],c[n];\n\nfor(i=0;i<n;i++)\n\n    scanf(\""%d\"",&a[i]);\n\nfor(i=0;i<n;i++)\n\n    scanf(\""%d\"",&b[i]);\n\nfor(i=0;i<n;i++)\n\n    c[i]=b[i]-a[i];\n\nfor(i=0;i<n;i++)\n\n{\n\n    for(j=0;j<n;j++)\n\n    {\n\n        y=y+c[j];\n\n        if(y>x)\n\n        {x=y;\n\n         }\n\n    }\n\n}\n\nprintf(\""%d\"",x);\n\nreturn 0;\n\n}",WRONG_ANSWER,3,320
1591051172973182976,63bdcc3416dd0c07c03f833ffb02c2f304a4f523deae6a87bed24a730e4d224d,2022-11-11 20:52:14,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int i,t,n,result,gewei;\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++)\n    {\n    scanf(\""%d\"",&n);\n    result=pow(6,n);\n    gewei=result%10;\n    printf(\""%d\"",gewei);\n    } \n     \n return 0;\n}",WRONG_ANSWER,6,316
1591051384542244864,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-11 20:53:05,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include  <stdio.h>\nint main(){\n    printf(\""2002\"");\n}",WRONG_ANSWER,3,188
1591051475088900096,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-11 20:53:26,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include  <stdio.h>\nint main(){\n    printf(\""2022\"");\n}",ACCEPTED,3,192
1591051788042702848,abe2744e33bb397ffb9bb13afcb202f611378fb4fc5801202f03933298ce5f5d,2022-11-11 20:54:41,Java,300.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n    public static void main(String[] args) throws IOException {\n        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n        int n = Integer.valueOf(reader.readLine());\n        int num=1;\n\n        for (int i = 2;i<=n;i++){\n\n            for (int j = 2; j <=(int)Math.sqrt(i)+1 ; j++) {\n\n                if (i%j==0){\n                    break;\n                }\n                else if (j==(int)Math.sqrt(i)+1){\n                    num++;\n                }\n            }\n        }\n        System.out.println(num);\n    }\n}\n\n,ACCEPTED,165,14056
1591051799199547392,aa0e227662691639471f7b18bc3d5c6aa34fdabcef6d52266691b6fbe7e8d245,2022-11-11 20:54:43,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n       \tint sum=0;\n\t\t\tScanner in=new Scanner(System.in);\n\t\t        int n=in.nextInt();\n\t\t        if(n>100000&&n<0) {\n\t\t        \tSystem.out.print(\""输入有误！！\"");\n\t\t        }else {\n\t\t        for(int i=2;i<=n;i++){\n\t\t            for (int j=2;j<=i;j++){\n\t\t                if(i%j==0 && j!=i){\n\t\t                \tsum++;\n\t\t                    break;\n\t\t                }    \n\t\t          }      \n\t\t          \n\t\t        }\n\t\t        }\n\t\t      System.out.print(n-sum-1);\n\t\t       \n\t}\n}",TIME_LIMIT_EXCEEDED,1000,19360
1591051826001154048,c03ae905b4de4d41e5d9328da5270539e1a32e2d888b8dd41fb10f72c24a90ce,2022-11-11 20:54:50,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n int X,Y,Z;\n int A;\n scanf(\""%d %d %d\"",&X,&Y,&Z);\n A=X+Y-Z;\n printf(\""%d\"",A);\n\n    return 0;\n}\n",ACCEPTED,6,344
1591052142998257664,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-11 20:56:05,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include  <stdio.h>\nint main()\n{\n    int x,y,z;\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n}",ACCEPTED,10,352
1591052191899648000,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-11 20:56:17,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n long long int t,j,u=0;\nint isprime(int n);\nprintf(\""请输入一个数：\"")；\nscanf(\""%d\"",&t);\nfor(j=1;j<=t;j++）\n    {\nif (isprime(j)==1) u++;\nprintf(\""从1到%d总共有%d个素数。\"",t,u)；return 0;\n    }\nint isprime(int n)\n    {int i;\nif(n==2) return 1;\nelse if(n==1||n%2==0) return 0;\n     \n     for (i=3;i<=sqrt(n)+1;i+=2)\n     {\n         if(n%i==0) return 0;\n     }\n         return 1;\n    }",COMPILE_ERROR,0,0
1591052258186428416,6cbd81921f92855c6b8318725b09ef7ec48ff579276b3df9f7ea04bea9804678,2022-11-11 20:56:33,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\nint n,i,j,m=0,x=0;\nscanf(\""%d\"",&n);\nint a[n],b[n],c[n];\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&a[i]);\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&b[i]);\nfor(i=0;i<n;i++)\n    c[i]=b[i]-a[i];\nfor(i=0;i<n;i++)\n{\n    for(j=0;j<n;j++)\n    {\n        m=m+c[j];\n        if(m>x) x=m;\n    }\n}\nprintf(\""%d\\n\"",x);\nreturn 0;\n}",WRONG_ANSWER,3,188
1591052308010569728,4e97dffad9953b68d5edd2be07bfc6fdc17c63c845c8ee056e07353c9a386309,2022-11-11 20:56:45,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main(){\n    printf(\""2022\"");\n    return 0;\n}\n",ACCEPTED,4,384
1591052308736159744,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-11 20:56:45,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n long long int t,j,u=0;\nint isprime(int n);\nprintf(\""请输入一个数：\"")；\nscanf(\""%d\"",&t);\nfor(j=1;j<=t;j++)\n    {\nif (isprime(j)==1) u++;\nprintf(\""从1到%d总共有%d个素数。\"",t,u)；return 0;\n    }\nint isprime(int n)\n    {int i;\nif(n==2) return 1;\nelse if(n==1||n%2==0) return 0;\n     \n     for (i=3;i<=sqrt(n)+1;i+=2)\n     {\n         if(n%i==0) return 0;\n     }\n         return 1;\n    }",COMPILE_ERROR,0,0
1591052333285441536,55950e2d4c314feed0856fa0f6b80f22c5c36f2ebe0d75c8ee2cadb1a06b2fe1,2022-11-11 20:56:51,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int n,i,j;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    int maxi=0;\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    int sum,max[n];\n    for(j=0;j<n;j++)\n    {\n    \tsum=0;\n    \tmax[j]=b[j]-a[j];\n\t\tfor(i=j;i<n;i++)\n    {\n        sum+=b[i]-a[i];\n        if(sum>max[j]) max[j]=sum;\n    }\n     //  maxi=max[0];\n       if(max[j]>maxi) maxi=max[j];\n    }\n    printf(\""%d\\n\"",maxi);\n    return 0;\n}",ACCEPTED,4,180
1591052563179438080,4e8bf5e988ac4275aeb23eae913a385055ab79de14dc27373b9e62a15269d138,2022-11-11 20:57:46,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\na=int(input())\nb=input().split()\nfor i in b:\n    x=math.pow(6,int(i))\n    y=int(x%10)\n    print(y)",NON_ZERO_EXIT_CODE,35,4144
1591052705857081344,fbea21dbaf89f1b064feaa20227f21c5e1c4888fdc371cf5e43f70615906e52a,2022-11-11 20:58:20,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"n = int(input())\na = list(map(int, input().split()))\nb = a[::-1]\nnum = []\nc = []\nx=0\nfor i in range(len(a)):\n    num.append(b[i] - a[i])\nfor z in range(len(num)):\n    x=num[z]\n    c.append(x)\n    for j in range(z+1,len(a)):\n        x+=num[j]\n        c.append(x)\nprint(max(c))",WRONG_ANSWER,15,2744
1591052721455693824,5d1852a153062cc8297ed7a30bb643375395a70654d5dff506fad6bc186e81bd,2022-11-11 20:58:23,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int q,i,n;\n    int a[100];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d \"",&a[i]);\n    }\n    if(i=0) q=1;\n    else q=6;\n    for(i=0;i<n-1;i++){\n        printf(\""%d\\n\"",q);\n    }\n    printf(\""%d\"",q);\n    return 0;\n}",WRONG_ANSWER,14,304
1591052857544081408,5d1852a153062cc8297ed7a30bb643375395a70654d5dff506fad6bc186e81bd,2022-11-11 20:58:56,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int q,i,n;\n    int a[100];\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d \"",&a[i]);\n    }\n    if(i=0) q=1;\n    else q=6;\n    for(i=0;i<n-1;i++){\n        printf(\""%d\\n\"",q);\n    }\n    printf(\""%d\"",q);\n    return 0;\n}",WRONG_ANSWER,10,372
1591052878326857728,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-11 20:59:01,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n,i,j,a,b=0,c=0;\n    scanf(\""%d\\n\"",&n);\n    for(i=n;i>0;i--){\n        for(j=i;j>0;j--){\n            a=i%j;\n            if(a==0){\n                b++;\n            }\n        }\n        if(b==2){\n            c++;\n        }\n        b=0;\n    }\n    printf(\""%d\\n\"",c);\n    return 0;\n}",TIME_LIMIT_EXCEEDED,1000,516
1591052941694406656,4e8bf5e988ac4275aeb23eae913a385055ab79de14dc27373b9e62a15269d138,2022-11-11 20:59:16,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\na=int(input())\nb=input().split()\nfor i in b:\n    x=math.pow(6,i)\n    y=int(x%10)\n    print(y)",NON_ZERO_EXIT_CODE,16,2880
1591052999923924992,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-11 20:59:30,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n   int a,b,c,d;\nscanf(\""%f%f%f,a,b,c\"");\n    d=a+b-c;\n     printf(\""%f\\n\"",d);\n        return 0;\n}",SEGMENTATION_FAULT,3,324
1591053015019204608,4e97dffad9953b68d5edd2be07bfc6fdc17c63c845c8ee056e07353c9a386309,2022-11-11 20:59:33,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n  \n        printf(\""%d\"",X+Y-Z);\n    return 0;\n}",ACCEPTED,6,324
1591053017628086272,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-11 20:59:34,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n   int a,b,c,d;\nscanf(\""%f%f%f,a,b,c\"");\n    d=a+b-c;\n     printf(\""%f\\n\"",d);\n        return 0;\n}",SEGMENTATION_FAULT,3,488
1591053029510549504,07d925df8d2026d3171a0a2ca84a6ef7f4a5b47a584cf47b66c5dd8f28139d1f,2022-11-11 20:59:37,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\nint n,a;\nscanf(\""%d\"",&n);\nfor(int i=1;i<=n;i++){\nscanf(\""%d\"",&a);\nif(a==0)printf(\""1\"");\nelse printf(\""6\"");\nif(i!=n)printf(\""\\n\"");\n}\nreturn 0;\n}\n",ACCEPTED,9,200
1591053035252527104,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-11 20:59:38,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"b = int(input())\nnum = []\ncount = 0\nfor j in range(2,b+1):\n    for k in range(2,j):\n        if j % k == 0:\n            break\n        else:\n            count += 1\n            break\nprint(count)\n\n",WRONG_ANSWER,49,2752
1591053112671010816,4e8bf5e988ac4275aeb23eae913a385055ab79de14dc27373b9e62a15269d138,2022-11-11 20:59:57,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\na=int(input())\nb=input().split()\nfor i in b:\n    x=math.pow(6,i)\n    y=int(x%10)\n    print(y)",NON_ZERO_EXIT_CODE,15,2744
1591053177074528256,4e8bf5e988ac4275aeb23eae913a385055ab79de14dc27373b9e62a15269d138,2022-11-11 21:00:12,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\na=int(input())\nb=input().split()\nfor i in b:\n    x=math.pow(6,int(i))\n    y=int(x%10)\n    print(y)",NON_ZERO_EXIT_CODE,36,2752
1591053208552800256,fbea21dbaf89f1b064feaa20227f21c5e1c4888fdc371cf5e43f70615906e52a,2022-11-11 21:00:19,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"n = int(input())\na = list(map(int, input().split()))\nb = a[::-1]\nnum = []\nc = []\nx=0\nc.append(0)\nfor i in range(len(a)):\n    num.append(b[i] - a[i])\nfor z in range(len(num)):\n    x=num[z]\n    c.append(x)\n    for j in range(z+1,len(a)):\n        x+=num[j]\n        c.append(x)\nprint(max(c))",WRONG_ANSWER,18,3124
1591053399079059456,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-11 21:01:05,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n,i,j,a,b=0,c=0;\n    scanf(\""%d\\n\"",&n);\n    for(i=n;i>0;i--){\n        for(j=i;j>0;j--){\n            a=i%j;\n            if(a==0){\n                b++;\n            }\n            if(b>2){\n                break;\n            }\n        }\n        if(b==2){\n            c++;\n        }\n        b=0;\n    }\n    printf(\""%d\\n\"",c);\n    return 0;\n}",TIME_LIMIT_EXCEEDED,1000,316
1591053439960940544,a2fa7eb1ab1c2f6fa23517852ee6971ea32fd0c7742d71d7914ed729415f04d9,2022-11-11 21:01:15,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint n,num=0,max=0;\n\tcin>>n;\n\tint a[n+1]={},b[n+1]={};\n\tfor(int i=1;i<=n;i++)\n\t    cin>>a[i];\n\tfor(int i=1;i<=n;i++)\n\t    cin>>b[i];\t\t    \n    int i=1,m=n;\n\twhile(m>0)\n\t{\n       \tif(b[i]-a[i]<0)\n\t\t{\n\t\t\ti++;\n\t\t\tnum=0;\n\t\t}\n\t\tif(b[i]-a[i]>0)\n\t\t{\t\n\t\t    for(int j=i;j<=n;j++)\t\n\t\t    {\n\t\t\t    \n\t\t\t    num=num+b[j]-a[j];\n\t\t\t    if(num>max)\n\t\t\t        max=num;\t\t\t\t\t\n\t\t\t\ti=j;\n\t\t\t\tif(b[j]-a[j]<0) \n\t\t\t        break;\t\t\t    \t\t\t\t\t\t\t\n\t\t    }\n\t    } \n\t\tm=n-i;   \t    \n    }\n\tcout<<max;\t\n\treturn 0;\n}",WRONG_ANSWER,4,312
1591053534135627776,2af449595ef30f97cefb348732f77a537f3df93d20abf901fe2ea852a179091b,2022-11-11 21:01:37,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n\tint x,num=0,temp;\n\tint i,j;\n\tscanf(\""%d\"",&x);\n\tfor(i=2;i<x;i++)\n\t{\n\t\ttemp=1;\n\t\tfor(j=2;j<=sqrt(i);j++){\n\t\t\tif(i%j==0){\n\t\t\t\ttemp=0;\n\t\t\t\tbreak;\t\n\t\t\t}\n\t\t}\n\t\tif(temp){\n\t\t\tnum++;\n\t\t}\n\t}\n\tprintf(\""%d\"",num);\n\treturn 0;\n}",ACCEPTED,13,312
1591053548127846400,a27ecb139a3fa065feadb903517977dc609a6d218c4e082e7ec449c78806823c,2022-11-11 21:01:40,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n \nint main()\n{\n\tint  b, n, i, k = 0, f;\n\tscanf(\""%d\"",&b);\n\tfor (n = 2; n <= b; n++) \n{\n\t\tf = 1;\n\t\tfor (i = 2; i <= sqrt(n); i++)\n\t    if (n % i == 0) {\n\t\t\t\tf = 0;\n\t\t\t\tbreak;\n\t\t                }\n\t\tif (f == 1)\n\t\t\tk++;\n\t\tif (n == b)\n\t\t\tprintf(\""%d\"", k);\n \n}\n \n}\n",ACCEPTED,12,364
1591053672656732160,aa0e227662691639471f7b18bc3d5c6aa34fdabcef6d52266691b6fbe7e8d245,2022-11-11 21:02:10,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n       \tint sum=0;\n\t\t\tScanner in=new Scanner(System.in);\n\t        int n=in.nextInt();\n\t        for(int i=2;i<=n;i++){\n\t            for (int j=2;j<=i;j++){\n\t                if(i%j==0 && j!=i){\n\t                    break;\n\t                }\n\t                if (i==j){\n\t                \tsum++;\n\t                   \n\t                }\n\t            }\n\t        }\n\t        System.out.print(sum);\n\t    }\n\t},TIME_LIMIT_EXCEEDED,1000,16304
1591053767523479552,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-11 21:02:33,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n   int a,b,c,d;\nscanf(\""%f%f%f,&a,&b,&c\"");\n    d=a+b-c;\n     printf(\""%f\\n\"",d);\n        return 0;\n}",SEGMENTATION_FAULT,4,488
1591054055659601920,a2fa7eb1ab1c2f6fa23517852ee6971ea32fd0c7742d71d7914ed729415f04d9,2022-11-11 21:03:41,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint n,num=0,max=0;\n\tcin>>n;\n\tint a[n+1]={},b[n+1]={};\n\tfor(int i=1;i<=n;i++)\n\t    cin>>a[i];\n\tfor(int i=1;i<=n;i++)\n\t    cin>>b[i];\t\t    \n    int i=1,m=n;\n\twhile(m>0)\n\t{\n       \tif(b[i]-a[i]<0)\n\t\t{\n\t\t\ti++;\n\t\t\tnum=0;\n\t\t}\n\t\tif(b[i]-a[i]>0)\n\t\t{\t\n\t\t    for(int j=i;j<=n;j++)\t\n\t\t    {\t\t\t    \n\t\t\t    num=num+b[j]-a[j];\n\t\t\t    if(num>max)\n\t\t\t        max=num;\t\t\t\t\t\n\t\t\t\ti=j;\n\t\t\t\tif(b[j+1]-a[j+1]<0) \n\t\t\t        break;\t\t\t    \t\t\t\t\t\t\t\n\t\t    }\n\t    } \n\t\tm=n-i;   \t    \n    }\n\tcout<<max;\t\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,400,440
1591054063700062208,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-11 21:03:43,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int X,Y,Z,H;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    0<=X<=100;\n    0<=Y<=100;\n    0<=Z<=100;\n    H=X+Y-Z;\n    printf(\""%d\"",&H);\n    return 0;\n}",WRONG_ANSWER,3,344
1591054155328851968,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-11 21:04:05,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n   int a,b,c,d;\nscanf(\""%d,%d,%d,&a,&b,&c\"");\n    d=a+b-c;\n     printf(\""%f\\n\"",d);\n        return 0;\n}",WRONG_ANSWER,5,308
1591054173318221824,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-11 21:04:09,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int X,Y,Z,H;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    0<=X<=100;\n    0<=Y<=100;\n    0<=Z<=100;\n    H=X+Y-Z;\n    printf(\""%d\"",&H);\n    return 0;\n}",WRONG_ANSWER,3,320
1591054356370231296,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-11 21:04:53,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int X,Y,Z,H;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    0<=X<=100;\n    0<=Y<=100;\n    0<=Z<=100;\n    0<=H<=300;\n    H=X+Y-Z;\n    printf(\""%d\"",&H);\n    return 0;\n}",WRONG_ANSWER,3,188
1591054451991969792,6cbd81921f92855c6b8318725b09ef7ec48ff579276b3df9f7ea04bea9804678,2022-11-11 21:05:16,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\nint n,i,j,m=0,x=0;\nscanf(\""%d\"",&n);\nint a[n],b[n],c[n];\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&a[i]);\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&b[i]);\nfor(i=0;i<n;i++)\n    c[i]=b[i]-a[i];\nfor(i=0;i<n;i++)\n{\n    for(j=0;j<n;j++)\n    {\n        m=m+c[j];\n        if(m>x)\n            x=m;\n        if(m<0)\n            m=0;\n    }\n}\nprintf(\""%d\\n\"",x);\nreturn 0;\n}\n",WRONG_ANSWER,2,184
1591054452830834688,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-11 21:05:16,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\n#include<time.h>\nint main()\n{\n    int X,Y,Z,H;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    0<=X<=100;\n    0<=Y<=100;\n    0<=Z<=100;\n    0<=H<=300;\n    H=X+Y-Z;\n    printf(\""%d\"",&H);\n    return 0;\n}",WRONG_ANSWER,4,184
1591054527330062336,4e8bf5e988ac4275aeb23eae913a385055ab79de14dc27373b9e62a15269d138,2022-11-11 21:05:34,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\na=int(input())\nb=input().split('')\nfor i in b:\n    x=math.pow(6,int(i))\n    y=int(x%10)\n    print(y)",NON_ZERO_EXIT_CODE,19,2888
1591054553225695232,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-11 21:05:40,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\n#include<time.h>\n#include<math.h>\n\nint main()\n{\n    int X,Y,Z,H;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    0<=X<=100;\n    0<=Y<=100;\n    0<=Z<=100;\n    0<=H<=300;\n    H=X+Y-Z;\n    printf(\""%d\"",&H);\n    return 0;\n}",WRONG_ANSWER,4,312
1591054581818265600,4e8bf5e988ac4275aeb23eae913a385055ab79de14dc27373b9e62a15269d138,2022-11-11 21:05:47,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\na=int(input())\nb=input().split()\nfor i in b:\n    x=pow(6,int(i))\n    y=int(x%10)\n    print(y)",TIME_LIMIT_EXCEEDED,167,4100
1591054597215555584,a2fa7eb1ab1c2f6fa23517852ee6971ea32fd0c7742d71d7914ed729415f04d9,2022-11-11 21:05:50,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint n,num=0,max=0;\n\tcin>>n;\n\tint a[n+1]={},b[n+1]={};\n\tfor(int i=1;i<=n;i++)\n\t    cin>>a[i];\n\tfor(int i=1;i<=n;i++)\n\t    cin>>b[i];\t\t    \n    int i=1,m=n;\n\twhile(m>0)\n\t{\n       \tif(b[i]-a[i]<0)\n\t\t{\n\t\t\ti++;\n\t\t\tnum=0;\n\t\t}\n\t\tif(b[i]-a[i]>0)\n\t\t{\t\n\t\t    for(int j=i;j<=n;j++)\t\n\t\t    {\t\t\t    \n\t\t\t    num=num+b[j]-a[j];\n\t\t\t    if(num>max)\n\t\t\t        max=num;\t\t\t\t\t\n\t\t\t\ti=j;\n\t\t\t\tif(b[j]-a[j]<=0) \n\t\t\t        break;\t\t\t    \t\t\t\t\t\t\t\n\t\t    }\n\t    } \n\t\tm=n-i;   \t    \n    }\n\tcout<<max;\t\n\treturn 0;\n}",WRONG_ANSWER,4,320
1591054646989357056,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-11 21:06:02,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\n#include<time.h>\n#include<math.h>\n\nint main()\n{\n    int X,Y,Z,H;\n    0<=X<=100;\n    0<=Y<=100;\n    0<=Z<=100;\n    0<=H<=300;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    \n    H=X+Y-Z;\n    printf(\""%d\"",&H);\n    return 0;\n}",WRONG_ANSWER,3,348
1591054671643475968,5d1852a153062cc8297ed7a30bb643375395a70654d5dff506fad6bc186e81bd,2022-11-11 21:06:08,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\npublic class dwda {\n\n\tpublic static void main(String[] args) {\n\t\tint x,y;\n\t\tScanner sc = new Scanner(System.in);\n\t\ty = sc.nextInt();\n\t\tfor(int i = 0;i < y;i++){\n\t\t\tx = sc.nextInt();\n\t\t\tSystem.out.println(x==0?\""1\"":\""6\"");\n\t\t}\n\t}\n\n}",COMPILE_ERROR,0,0
1591054790417776640,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-11 21:06:37,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n   int a,b,c,d;\na=8;\n    b=7;\n        c=3;\n    d=a+b-c;\n     printf(\""%d\\n\"",d);\n        return 0;\n}",WRONG_ANSWER,3,324
1591054882705047552,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-11 21:06:59,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n   int a,b,c,d;\na=8;\n    b=7;\n        c=3;\n    d=a+b-c;\n     printf(\""%d\\n\"",d);\n        return 0;\n}",WRONG_ANSWER,3,200
1591055054877032448,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-11 21:07:40,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"b = int(input())\ncount = 0\nfor j in range(2,b+1):\n    for k in range(2,j):\n        if j % k == 0:\n             break\n    else:\n        count = 1+count\nprint(count)\n\n\n",TIME_LIMIT_EXCEEDED,1000,3044
1591055156106539008,4e8bf5e988ac4275aeb23eae913a385055ab79de14dc27373b9e62a15269d138,2022-11-11 21:08:04,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\na=int(input())\nb=input().split()\nfor i in b:\n    print(\""6\"")",WRONG_ANSWER,53,3132
1591055215833452544,4e8bf5e988ac4275aeb23eae913a385055ab79de14dc27373b9e62a15269d138,2022-11-11 21:08:18,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import math\na=int(input())\nb=input().split()\nfor i in b:\n    print('6'),WRONG_ANSWER,49,2908
1591055266928459776,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-11 21:08:30,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n   int a,b,c,d;\nscanf(\""%d%d%d\"",&a,&b,&c);\n    d=a+b-c;\n     printf(\""%d\\n\"",d);\n        return 0;\n}",ACCEPTED,8,440
1591055268618764288,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 21:08:31,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"import java.util.Scanner;\n\npublic class Main{\n    public static void main(String[] args){\n    Scanner sc = new Scanner(System.in);\n        int n = sc.nextInt();\n        int i,j;\n        for(int i=1;i<=n;i++){\n\t            for(int j=2;j<i;j++){\n\t\t            if (i%j==0){\n\t\t                break;\n\t\t            }\n                    if(i==n){\n                        count++;\n                    }\n\t\t        }\n\t\t        \n\t\t    }\n\t\tSystem.out.println(count);\n    }\n}",COMPILE_ERROR,0,0
1591055331663327232,4e8bf5e988ac4275aeb23eae913a385055ab79de14dc27373b9e62a15269d138,2022-11-11 21:08:46,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import math\na=int(input())\nb=input().split()\nfor i in a:\n    print('6'),NON_ZERO_EXIT_CODE,17,2868
1591055370028646400,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 21:08:55,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"import java.util.Scanner;\n\npublic class Main{\n    public static void main(String[] args){\n    Scanner sc = new Scanner(System.in);\n        int n = sc.nextInt();\n        int i,j;\n        for(int i=1;i<=n;i++){\n\t            for(int j=2;j<i;j++){\n\t\t            if (i%j==0){\n\t\t                break;\n\t\t            }\n                    if(i==n){\n                        count++;\n                    }\n\t\t        }\n\t\t        \n\t\t    }\n\t\tSystem.out.println(count);\n    }\n}",COMPILE_ERROR,0,0
1591055421983490048,fbea21dbaf89f1b064feaa20227f21c5e1c4888fdc371cf5e43f70615906e52a,2022-11-11 21:09:07,Python,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"n = int(input())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nnum = []\nc = []\nx=0\nc.append(0)\nfor i in range(len(a)):\n    num.append(b[i] - a[i])\nfor z in range(len(num)):\n    x=num[z]\n    c.append(x)\n    for j in range(z+1,len(a)):\n        x+=num[j]\n        c.append(x)\nprint(max(c))",ACCEPTED,15,2892
1591055475045634048,4e8bf5e988ac4275aeb23eae913a385055ab79de14dc27373b9e62a15269d138,2022-11-11 21:09:20,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\na=int(input())\nb=input().split()\nfor i in a:\n    print(\""6\"")",NON_ZERO_EXIT_CODE,16,3000
1591055480607281152,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 21:09:21,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main{\n    public static void main(String[] args){\n    Scanner sc = new Scanner(System.in);\n        int n = sc.nextInt();\n        for(int i=1;i<=n;i++){\n\t            for(int j=2;j<i;j++){\n\t\t            if (i%j==0){\n\t\t                break;\n\t\t            }\n                    if(i==n){\n                        count++;\n                    }\n\t\t        }\n\t\t        \n\t\t    }\n\t\tSystem.out.println(count);\n    }\n},COMPILE_ERROR,0,0
1591055553130987520,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 21:09:38,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main{\n    public static void main(String[] args){\n    Scanner sc = new Scanner(System.in);\n        int n = sc.nextInt();\n        int count = 0;\n        for(int i=1;i<=n;i++){\n\t            for(int j=2;j<i;j++){\n\t\t            if (i%j==0){\n\t\t                break;\n\t\t            }\n                    if(i==n){\n                        count++;\n                    }\n\t\t        }\n\t\t        \n\t\t    }\n\t\tSystem.out.println(count);\n    }\n},TIME_LIMIT_EXCEEDED,1000,20352
1591055554431225856,4e8bf5e988ac4275aeb23eae913a385055ab79de14dc27373b9e62a15269d138,2022-11-11 21:09:39,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\nb=input().split()\nfor i in a:\n    print(\""6\"")",NON_ZERO_EXIT_CODE,22,2748
1591055592523890688,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 21:09:48,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main{\n    public static void main(String[] args){\n    Scanner sc = new Scanner(System.in);\n        int n = sc.nextInt();\n        int count = 0;\n        for(int i=1;i<=n;i++){\n\t            for(int j=2;j<i;j++){\n\t\t            if (i%j==0){\n\t\t                break;\n\t\t            }\n                    if(i==n){\n                        count++;\n                    }\n\t\t        }\n\t\t        \n\t\t    }\n\t\tSystem.out.println(count);\n    }\n},TIME_LIMIT_EXCEEDED,1000,16520
1591055628246781952,4e8bf5e988ac4275aeb23eae913a385055ab79de14dc27373b9e62a15269d138,2022-11-11 21:09:56,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\nb=input().split()\nfor i in range(a):\n    print(\""6\"")",WRONG_ANSWER,48,2876
1591055652124930048,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-11 21:10:02,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <iostream>\n#include <math.h>\nusing namespace std;\n\nint main(){\n    int n,a;\n    scanf(\""%d\"",&n);\n    while (n--){\n        scanf(\""%d\"",&a);\n        int t = a % 4;\n        if (a%4==0) t = 4;\n        a %= 10;\n        printf(\""%d\\n\"",(int)pow(a,t)%10);\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1591055660761022464,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-11 21:10:04,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"b = int(input())\nprint(\""168\"")\n\n\n",WRONG_ANSWER,18,3004
1591055673738203136,4e8bf5e988ac4275aeb23eae913a385055ab79de14dc27373b9e62a15269d138,2022-11-11 21:10:07,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\nb=input().split()\nfor i in range(a):\n    print(\""6\"")",WRONG_ANSWER,48,3036
1591055776616091648,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 21:10:32,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main{\n    public static void main(String[] args){\n    Scanner sc = new Scanner(System.in);\n        int n = sc.nextInt();\n        int count = 0;\n        for(int i=3;i<=n;i++){\n\t            for(int j=2;j<i;j++){\n\t\t            if (i%j==0){\n\t\t                break;\n\t\t            }\n                    if(i==n){\n                        count++;\n                    }\n\t\t        }\n\t\t        \n\t\t    }\n\t\tSystem.out.println(count);\n    }\n},TIME_LIMIT_EXCEEDED,1000,16172
1591055833876729856,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 21:10:45,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main{\n    public static void main(String[] args){\n    Scanner sc = new Scanner(System.in);\n        int n = sc.nextInt();\n        int count = 0;\n        for(int i=3;i<=n;i++){\n\t            for(int j=2;j<i;j++){\n\t\t            if (i%j==0){\n\t\t                break;\n\t\t            }\n                    if(i==n){\n                        count++;\n                    }\n\t\t        }\n\t\t        \n\t\t    }\n\t\tSystem.out.println(count);\n    }\n},TIME_LIMIT_EXCEEDED,1000,16836
1591055898737446912,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 21:11:01,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main{\n    public static void main(String[] args){\n    Scanner sc = new Scanner(System.in);\n        int n = sc.nextInt();\n        int count = 0;\n        for(int i=3;i<=n;i++){\n\t            for(int j=2;j<i;j++){\n\t\t            if (i%j==0){\n\t\t                break;\n\t\t            }\n                    if(i==n){\n                        count++;\n                    }\n\t\t        }\n\t\t        \n\t\t    }\n\t\tSystem.out.println(count);\n    }\n},TIME_LIMIT_EXCEEDED,1000,16120
1591055969990283264,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-11 21:11:18,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016, for(int i=1;i<50;i++) {\n            int sum =1;\n            for(int j=1;j<=i;j++) {\n                sum*=i;\n                if(sum>10)\n                    sum%=10;\n            }\n            System.out.print(sum);\n        }\n,COMPILE_ERROR,0,0
1591056018900062208,064270dabaa13edbd7238477860db0e46621a5ed4921e8aa2c0f9258e77722cc,2022-11-11 21:11:29,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <malloc.h>\n#include <math.h>\n\n\n\nint main()\n{\n   int i=0;\n   int a=0;\n   int count=0;\n   scanf(\""%d\"",&a);\n   for(i=2;i<=a;i++)\n   {\n       int j=0;\n    for(j=2;j<i;j++)\n       {\n           if(i%j==0)\n           {\n               break;\n           }\n       }\n       if(j==i)\n           {\n               count++;\n           }\n\n   }\n printf(\""%d\"",count);\n return 0;\n}",TIME_LIMIT_EXCEEDED,1000,276
1591056042279088128,20eba57d0ae5a9e589a2b203a4648cce520c99291e8744872f7a5a5911e19e34,2022-11-11 21:11:35,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n    \tScanner input=new Scanner(System.in);\n    \tSystem.out.print(\""\\n\"");\n        int a=input.nextInt();\n        for(int a1 = 1;a1<=a;a1++) {\n        \tSystem.out.print(\""\\n\"");\n        \tint b=input.nextInt();\n        \tif(b>0)\n        \t{\n        \t\tSystem.out.print(\""6\"");\n        \t}\n        \telse if(b==0){\n        \t\tSystem.out.print(\""0\"");\n        \t}\n        }\n    }\n}",NON_ZERO_EXIT_CODE,251,20600
1591056251872673792,4e97dffad9953b68d5edd2be07bfc6fdc17c63c845c8ee056e07353c9a386309,2022-11-11 21:12:25,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n,i,j;\n    int x=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n        c[i]=b[i]-a[i];\n    for(i=0;i<n;i++){\n        int y=0;\n        for(j=i;j<n;j++){\n            y+=c[j];\n            if(y>x)\n                x=y;\n        }\n    }\n    printf(\""%d\\n\"",x);\n}",ACCEPTED,3,308
1591056285737463808,064270dabaa13edbd7238477860db0e46621a5ed4921e8aa2c0f9258e77722cc,2022-11-11 21:12:33,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <malloc.h>\n#include <math.h>\n\n\n\nint main()\n{\n   int i=0;\n   int a;\n   int count=0;\n   scanf(\""%d\"",&a);\n   for(i=2;i<=a;i++)\n   {\n       int j=0;\n    for(j=2;j<i;j++)\n       {\n           if(i%j==0)\n           {\n               break;\n           }\n       }\n       if(j==i)\n           {\n               count++;\n           }\n\n   }\n printf(\""%d\"",count);\n return 0;\n}",ACCEPTED,927,320
1591056397968670720,20eba57d0ae5a9e589a2b203a4648cce520c99291e8744872f7a5a5911e19e34,2022-11-11 21:13:00,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n    \tScanner input=new Scanner(System.in);\n    \tSystem.out.print(\""\\n\"");\n        int a=input.nextInt();\n        for(int a1 = 1;a1<=a;a1++) {\n        \tSystem.out.print(\""\\n\"");\n        \tint b=input.nextInt();\n        \tif(b>0)\n        \t{\n        \t\tSystem.out.print(\""6\"");\n        \t}\n        \telse if(b==0){\n        \t\tSystem.out.print(\""0\"");\n        \t}\n        }\n        return;\n    }\n}",NON_ZERO_EXIT_CODE,244,19436
1591056542886068224,aa0e227662691639471f7b18bc3d5c6aa34fdabcef6d52266691b6fbe7e8d245,2022-11-11 21:13:34,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n       \tint sum=0;\n\t\t\tScanner in=new Scanner(System.in);\n\t        int n=in.nextInt();\n\t        if(n>10000||n<0) {\n\t        \tSystem.out.print(\""!\"");\n\t        }\n\t        else {\n\t        for(int i=2;i<=n;i++){\n\t            for (int j=2;j<=i;j++){\n\t                if(i%j==0 && j!=i){\n\t                    break;\n\t                }\n\t                if (i==j){\n\t                \tsum++;\n\t                   \n\t                }\n\t            }\n\t        }\n\t        System.out.print(sum);\n\t        }\n\t        }\n\t}",WRONG_ANSWER,124,16516
1591056594329206784,aa0e227662691639471f7b18bc3d5c6aa34fdabcef6d52266691b6fbe7e8d245,2022-11-11 21:13:47,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n       \tint sum=0;\n\t\t\tScanner in=new Scanner(System.in);\n\t        int n=in.nextInt();\n\t        if(n>10000||n<0) {\n\t        }\n\t        else {\n\t        for(int i=2;i<=n;i++){\n\t            for (int j=2;j<=i;j++){\n\t                if(i%j==0 && j!=i){\n\t                    break;\n\t                }\n\t                if (i==j){\n\t                \tsum++;\n\t                   \n\t                }\n\t            }\n\t        }\n\t        System.out.print(sum);\n\t        }\n\t        }\n\t},WRONG_ANSWER,119,16400
1591056680580878336,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-11 21:14:07,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n,i,j,a,b=0,c=0;\n    scanf(\""%d\\n\"",&n);\n    for(i=n;i>0;i--){\n        for(j=i;j>0;j--){\n            a=i%j;\n            if(a==0){             \n                b++;\n            }\n            if(b>2){\n                break;\n            }\n        }\n        if(b==2){\n            c++;\n        }\n        b=0;\n    }\n    printf(\""%d\\n\"",c);\n    return 0;\n}",TIME_LIMIT_EXCEEDED,1000,432
1591056715183886336,623621a8637aeabe9a4897b11971e8814b4064ca9539156ba9dc4a7ab4dd9b53,2022-11-11 21:14:15,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main(){\n    printf(\""2022\"");\n}",ACCEPTED,4,332
1591056840828432384,4e97dffad9953b68d5edd2be07bfc6fdc17c63c845c8ee056e07353c9a386309,2022-11-11 21:14:45,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main(){\n    int i,j,k,n;\n    k=2;\n    scanf(\""%d\"",&n);\n    for(i=5;i<n;i+=2){\n        for(j=2;j*j<=i;j++)\n            if(i%j==0)\n                break;\n        if(j*j>i)\n            k++;\n    }\n    printf(\""%d\"",k);\n}",ACCEPTED,14,312
1591056887225843712,1f15b5b41f9e61f2d767bcb1ae88bef60c94b97dd423bfd2ba9c8c0e8e9d05bb,2022-11-11 21:14:56,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\nclass Main{\n    public static void main(String[] args){\n        Scanner sc = new Scanner(System.in);\n        int n = sc.nextInt();\n        int j = 0;\n        int q = 0;\n        for(int i = 3; i <= n ; i++){\n            int temp = 1;\n            for(int k=2 ; k<i ; k++){\n                if(i%k==0){\n                    temp = 2;\n                    break;\n                }\n\n            }\n            if(temp=1){\n                j++;\n            }\n        } \n       }System.out.println(j);\n    }\n},COMPILE_ERROR,0,0
1591056891256569856,aa0e227662691639471f7b18bc3d5c6aa34fdabcef6d52266691b6fbe7e8d245,2022-11-11 21:14:57,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n       \tint sum=0;\n\t\t\tScanner in=new Scanner(System.in);\n\t        int n=in.nextInt();\n\t        if(n>10000||n<2) {\n\t        }\n\t        else {\n\t        for(int i=2;i<=n;i++){\n\t            for (int j=2;j<=i;j++){\n\t                if(i%j==0 && j!=i){\n\t                    break;\n\t                }\n\t                if (i==j){\n\t                \tsum++;\n\t                   \n\t                }\n\t            }\n\t        }\n\t        System.out.print(sum);\n\t        }\n\t        }\n\t},WRONG_ANSWER,133,15764
1591056972256968704,02f3cf9a5ba39e00e2644b9392922d3ea3ea233f83c612c7dbd879f319ea2bdc,2022-11-11 21:15:17,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n   int t,n,i,m,a;\n   scanf(\""%d\"",&t);\n   for(i=0;i<t;i++)\n   {\n       scanf(\""%d\"",&n);\n       if(n==0)\n        printf(\""1\\n\"");\n       else\n        printf(\""6\\n\"");\n   }\n    return 0;\n}\n",ACCEPTED,10,320
1591056990598660096,aa0e227662691639471f7b18bc3d5c6aa34fdabcef6d52266691b6fbe7e8d245,2022-11-11 21:15:21,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n       \tint sum=0;\n\t\t\tScanner in=new Scanner(System.in);\n\t        int n=in.nextInt();\n\t        if(n>10000||n<2) {\n\t        }\n\t        else {\n\t        for(int i=2;i<=n;i++){\n\t            for (int j=2;j<=i;j++){\n\t                if(i%j==0 && j!=i){\n\t                    break;\n\t                }\n\t                if (i==j){\n\t                \tsum++;\n\t                   \n\t                }\n\t            }\n\t        }\n\t        System.out.println(sum);\n\t        }\n\t        }\n\t},WRONG_ANSWER,126,16340
1591057175290642432,aa0e227662691639471f7b18bc3d5c6aa34fdabcef6d52266691b6fbe7e8d245,2022-11-11 21:16:05,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n       \tint sum=0;\n\t\t\tScanner in=new Scanner(System.in);\n\t        int n=in.nextInt();\n\t        if(n>10000||n<2) {\n                System.out.println(\""输入错误！\"");\n\t        }\n\t        else {\n\t        for(int i=2;i<=n;i++){\n\t            for (int j=2;j<=i;j++){\n\t                if(i%j==0 && j!=i){\n\t                    break;\n\t                }\n\t                if (i==j){\n\t                \tsum++;\n\t                   \n\t                }\n\t            }\n\t        }\n\t        System.out.println(sum);\n\t        }\n\t        }\n\t}",WRONG_ANSWER,113,16264
1591057234879123456,675867a135da6702ed27c0eec3e4b6d2a7d95c44854c01823fc152f0689f010d,2022-11-11 21:16:19,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,2,196
1591057265703059456,c03ae905b4de4d41e5d9328da5270539e1a32e2d888b8dd41fb10f72c24a90ce,2022-11-11 21:16:27,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <iostream>\n#include <math.h>\nusing namespace std;\n\nint main(){\n    int n,a;\n    scanf(\""%d\"",&n);\n    while (n--){\n        scanf(\""%d\"",&a);\n        int t = a % 4;\n        if (a%4==0) t = 4;\n        a %= 10;\n        printf(\""%d\\n\"",(int)pow(a,t)%10);\n    }\n    return 0;\n}",WRONG_ANSWER,82,556
1591057299173605376,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-11 21:16:35,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n   int a,b,c;\nscanf(\""%d%\"",&a);\n    b=a*a*a*a*a*a;\n    c = b%10;\n    printf(\""c=%d\"",c);\n}",WRONG_ANSWER,2,200
1591057560524886016,aa0e227662691639471f7b18bc3d5c6aa34fdabcef6d52266691b6fbe7e8d245,2022-11-11 21:17:37,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n       int sum=0;\n\t\t\tScanner in=new Scanner(System.in);\n\t        int n=in.nextInt();\n\t        if(n>=2&&n<=100000) {\n\t        \tfor(int i=2;i<=n;i++){\n\t\t            for (int j=2;j<=i;j++){\n\t\t                if(i%j==0 && j!=i){\n\t\t                    break;\n\t\t                }\n\t\t                if (i==j){\n\t\t                \tsum++;\n\t\t                   \n\t\t                }\n\t\t            }\n\t\t        }\n\t\t        System.out.print(sum);\n\t        }\n\t        \n\t        }\n\t},TIME_LIMIT_EXCEEDED,1000,16680
1591057574932320256,20eba57d0ae5a9e589a2b203a4648cce520c99291e8744872f7a5a5911e19e34,2022-11-11 21:17:40,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n    int t;\n    int i;\n    scanf(\""%d\"",&t);\n    int num[10000];\n    for(i=0;i<t;i++){\n        scanf(\""%d\"",&num[i]);\n    }\n    for(i=0;i<t;i++){\n        if(num[i]==0){\n            printf(\""1\\n\"");   \n        }\n        else{\n            printf(\""6\\n\"");\n        }\n    }\n\treturn 0;\n}",ACCEPTED,11,312
1591057701772267520,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-11 21:18:11,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"\nb = int(input())\nnum = []\ncount = 0\nfor j in range(2,b+1):\n    for k in num:\n        if j % k == 0:\n             break\n    else:\n        num.append(j)\n        count = 1+count\nprint(count)\n\n",TIME_LIMIT_EXCEEDED,1000,3228
1591057722085277696,6cbd81921f92855c6b8318725b09ef7ec48ff579276b3df9f7ea04bea9804678,2022-11-11 21:18:16,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\nint n,i,j,m=0,x=0,y;\nscanf(\""%d\"",&n);\nint a[n],b[n],c[n];\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&a[i]);\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&b[i]);\nfor(i=0;i<n;i++)\n    c[i]=b[i]-a[i];\nfor(i=0;i<n;i++){\n    for(j=0;j<n;j++)\n    {\n        m=m+c[j];\n        if(m>x)\n            x=m;\n        if(m<0)\n            m=0;\n        y=x;\n    }\n}\nprintf(\""%d\\n\"",y);\nreturn 0;\n}",WRONG_ANSWER,3,184
1591057742696087552,c03ae905b4de4d41e5d9328da5270539e1a32e2d888b8dd41fb10f72c24a90ce,2022-11-11 21:18:20,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <iostream>\n#include <math.h>\nusing namespace std;\n\nint main(){\n    int n,a;\n    scanf(\""%d\"",&n);\n    while (n--){\n        scanf(\""%d\"",&a);\n        int t = a % 4;\n        if (a%4==0) t = 4;\n        a %= 10;\n        printf(\""%d\\n\"",(int)pow(a,t)%10);\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1591057746332553216,4e8bf5e988ac4275aeb23eae913a385055ab79de14dc27373b9e62a15269d138,2022-11-11 21:18:21,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=int(input())\nfor i in range(a):\n    print(\""6\"")",WRONG_ANSWER,47,2884
1591057752259104768,675867a135da6702ed27c0eec3e4b6d2a7d95c44854c01823fc152f0689f010d,2022-11-11 21:18:23,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d\"",x=y-z);\n    return 0;\n}",WRONG_ANSWER,3,320
1591057769116008448,c03ae905b4de4d41e5d9328da5270539e1a32e2d888b8dd41fb10f72c24a90ce,2022-11-11 21:18:27,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <iostream>\n#include <math.h>\nusing namespace std;\n\nint main(){\n    int n,a;\n    scanf(\""%d\"",&n);\n    while (n--){\n        scanf(\""%d\"",&a);\n        int t = a % 4;\n        if (a%4==0) t = 4;\n        a %= 10;\n        printf(\""%d\\n\"",(int)pow(a,t)%10);\n    }\n    return 0;\n}",WRONG_ANSWER,4,436
1591057794969698304,675867a135da6702ed27c0eec3e4b6d2a7d95c44854c01823fc152f0689f010d,2022-11-11 21:18:33,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n    return 0;\n}",ACCEPTED,6,312
1591057991711920128,aa0e227662691639471f7b18bc3d5c6aa34fdabcef6d52266691b6fbe7e8d245,2022-11-11 21:19:20,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n       int sum=0;\n\t\t\tScanner in=new Scanner(System.in);\n\t        int n=in.nextInt();\n\t        if(n>=2&&n<=100000) {\n\t        \tfor(int i=2;i<=n;i++){\n\t\t            for (int j=2;j<=i;j++){\n\t\t                if(i%j==0 && j!=i){\n\t\t                    break;\n\t\t                }\n\t\t                if (i==j){\n\t\t                \tsum++;\n\t\t                   \n\t\t                }\n\t\t            }\n\t\t        }\n\t\t        System.out.print(sum);\n\t        }else {\n\t        \treturn;\n\t        }\n\t        \n\t        }\n\t},TIME_LIMIT_EXCEEDED,1000,17052
1591058025765474304,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-11 21:19:28,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n,i,j,a,b=0,c=0;\n    scanf(\""%d\\n\"",&n);\n    for(i=n;i>0;i--){\n        for(j=i-1;j>1;j--){\n            a=i%j;\n            if(a==0){\n                b=1;\n                break;\n            }\n        }\n        if(b==0){\n            c++;\n        }\n        b=0;\n    }\n    printf(\""%d\\n\"",c-1);\n    return 0;\n}",TIME_LIMIT_EXCEEDED,1000,336
1591058059915472896,abe2744e33bb397ffb9bb13afcb202f611378fb4fc5801202f03933298ce5f5d,2022-11-11 21:19:36,Java,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"package com.work111;\n\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\t\n\tpublic static void main(String[] args) throws NumberFormatException, IOException {\n\t\tSystem.out.println(\""1111\"");\n\t\tBufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n\t\tint n = Integer.valueOf(reader.readLine());\n\t\tint max=0;\n\t\tString[] lost = reader.readLine().split(\"" \"");\n\t\tString[] gain = reader.readLine().split(\"" \"");\n\t\tfor(int i=0;i<10;i++) {\n\t\t\tif(Integer.valueOf(lost[i])<Integer.valueOf(gain[i])) {\n\t\t\t\tmax+=Integer.valueOf(gain[i])-Integer.valueOf(lost[i]);\n\t\t\t\t\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(max);\n\t\t\t\t}\n\t\n\n}\n",WRONG_ANSWER,95,15452
1591058067020648448,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-11 21:19:38,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"\nb = int(input())\nnum = []\ncount = 0\nfor j in range(2,b+1):\n    for k in num:\n        if j % k == 0:\n             break\n    else:\n        num.append(j)\n        count = 1+count\nprint(count)\n\n",TIME_LIMIT_EXCEEDED,1000,3132
1591058227834458112,5d1852a153062cc8297ed7a30bb643375395a70654d5dff506fad6bc186e81bd,2022-11-11 21:20:16,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n class Main {\n\n\tpublic static void main(String[] args) {\n\t\tint x=0,y;\n\t\tScanner sc = new Scanner(System.in);\n\t\ty = sc.nextInt();\n\t\tfor(int i = 0;i < y;i++){\n\t\t\tx = sc.nextInt();\n\t\t}\n        for(int i = 0;i < y-1;i++){\n\t\t\tSystem.out.println(x==0?\""1\"":\""6\"");\n\t\t}\n\t\tSystem.out.print(x==0?\""1\"":\""6\"");\n\t}\n\n}",NON_ZERO_EXIT_CODE,247,19804
1591058246415220736,623621a8637aeabe9a4897b11971e8814b4064ca9539156ba9dc4a7ab4dd9b53,2022-11-11 21:20:21,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main\n{\nint X,Y,Z;\nscanf(\""%d,%d,%d\"",&X,Y,Z);\nprintf(\""%d\"",X+Y-Z);\n}",COMPILE_ERROR,0,0
1591058270322757632,ef50cfe7f34b26d29f617c97ac65d40bd15ba1e063897a190284243de955e254,2022-11-11 21:20:26,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"import java.util.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args){\n\t    Scanner sc=new Scanner(System.in);\n\t    int n=sc.nextInt();\n\t    int i,j;\n\t    int k=0;\n\t    for(i=2;i<n;i++) {\n\t    \tj=2;\n\t    \tfor(j=2;j<i;j++) {\n\t    \t\tif(i%j==0) {\n\t    \t\t\tbreak;\n\t    \t\t}\n\t    \t}\n\t    \tif(i==j) k++;\n\t    }\n\t    System.out.println(k);\n\t}\n\t\n}\n",TIME_LIMIT_EXCEEDED,1000,16808
1591058320109121536,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-11 21:20:38,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n,i,j,a,b=0,c=0;\n    scanf(\""%d\\n\"",&n);\n    for(i=n;i>1;i--){\n        for(j=i-1;j>1;j--){\n            a=i%j;\n            if(a==0){\n                b=1;\n                break;\n            }\n        }\n        if(b==0){\n            c++;\n        }\n        b=0;\n    }\n    printf(\""%d\\n\"",c);\n    return 0;\n}",TIME_LIMIT_EXCEEDED,1000,460
1591058533557276672,5d1852a153062cc8297ed7a30bb643375395a70654d5dff506fad6bc186e81bd,2022-11-11 21:21:29,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n class Main {\n\n\tpublic static void main(String[] args) {\n\t\tint x=0,y;\n\t\tScanner sc = new Scanner(System.in);\n\t\ty = sc.nextInt();\n\t\tfor(int i = 0;i < y;i++){\n\t\t\tx = sc.nextInt();\n\t\t}\n        for(int i = 0;i < y-1;i++){\n\t\t\tSystem.out.println(x==0?\""1\"":\""6\"");\n\t\t}\n\t\tSystem.out.print(x==0?\""1\"":\""6\"");\n\t}\n\n}",WRONG_ANSWER,262,16900
1591058567698911232,5d1852a153062cc8297ed7a30bb643375395a70654d5dff506fad6bc186e81bd,2022-11-11 21:21:37,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n class Main {\n\n\tpublic static void main(String[] args) {\n\t\tint x=0,y;\n\t\tScanner sc = new Scanner(System.in);\n\t\ty = sc.nextInt();\n\t\tfor(int i = 0;i < y;i++){\n\t\t\tx = sc.nextInt();\n\t\t}\n        for(int i = 0;i < y-1;i++){\n\t\t\tSystem.out.println(x==0?\""1\"":\""6\"");\n\t\t}\n\t\tSystem.out.print(x==0?\""1\"":\""6\"");\n\t}\n\n}",NON_ZERO_EXIT_CODE,239,17016
1591058568785231872,623621a8637aeabe9a4897b11971e8814b4064ca9539156ba9dc4a7ab4dd9b53,2022-11-11 21:21:37,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main\n{\nint X,Y,Z,NUM;\nscanf(\""%d,%d,%d\"",&X,Y,Z);\nNUM = X+Y-Z;\nprintf(\""%d\"",NUM);\nreturn NUM;\n}",COMPILE_ERROR,0,0
1591058583733731328,1019ea4e8e67338c8191b6e52878cb69ca9287130af71af3517596fded2f21e4,2022-11-11 21:21:41,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include<math.h>\nint main()\n{\n    int n,a,i;\n    scanf(\""%d\"",&a);\n    for(i=1;i<=a;i++)\n    {\n        scanf(\""%d\"",&n);\n        if(n==0)\n            printf(\""1\\n\"");\n        else\n            printf(\""6\\n\"");\n    }\n    return 0;\n}\n\n\n",ACCEPTED,11,320
1591058616403165184,623621a8637aeabe9a4897b11971e8814b4064ca9539156ba9dc4a7ab4dd9b53,2022-11-11 21:21:49,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\nint X,Y,Z,NUM;\nscanf(\""%d,%d,%d\"",&X,Y,Z);\nNUM = X+Y-Z;\nprintf(\""%d\"",NUM);\nreturn NUM;\n}",NON_ZERO_EXIT_CODE,3,336
1591058616784846848,5d1852a153062cc8297ed7a30bb643375395a70654d5dff506fad6bc186e81bd,2022-11-11 21:21:49,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n class Main {\n\n\tpublic static void main(String[] args) {\n\t\tint x=3,y;\n\t\tScanner sc = new Scanner(System.in);\n\t\ty = sc.nextInt();\n\t\tfor(int i = 0;i < y;i++){\n\t\t\tx = sc.nextInt();\n\t\t}\n        for(int i = 0;i < y-1;i++){\n\t\t\tSystem.out.println(x==0?\""1\"":\""6\"");\n\t\t}\n\t\tSystem.out.print(x==0?\""1\"":\""6\"");\n\t}\n\n}",WRONG_ANSWER,271,16844
1591058702386401280,623621a8637aeabe9a4897b11971e8814b4064ca9539156ba9dc4a7ab4dd9b53,2022-11-11 21:22:09,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\nint X,Y,Z,NUM;\nscanf(\""%d,%d,%d\"",&X,Y,Z);\nNUM = X+Y-Z;\nprintf(\""%d\"",NUM);\nreturn 0;\n}",WRONG_ANSWER,3,344
1591058705867669504,5d1852a153062cc8297ed7a30bb643375395a70654d5dff506fad6bc186e81bd,2022-11-11 21:22:10,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tint x=3,y;\n\t\tScanner sc = new Scanner(System.in);\n\t\ty = sc.nextInt();\n\t\tfor(int i = 0;i < y;i++){\n\t\t\tx = sc.nextInt();\n\t\t}\n        for(int i = 0;i < y-1;i++){\n\t\t\tSystem.out.println(x==0?\""1\"":\""6\"");\n\t\t}\n\t\tSystem.out.print(x==0?\""1\"":\""6\"");\n\t}\n\n}",WRONG_ANSWER,254,16416
1591058722401595392,623621a8637aeabe9a4897b11971e8814b4064ca9539156ba9dc4a7ab4dd9b53,2022-11-11 21:22:14,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\nint X,Y,Z,NUM;\nscanf(\""%d,%d,%d\"",&X,Y,Z);\nNUM = X+Y-Z;\nprintf(\""%d\"",NUM);\nreturn 0;\n}",WRONG_ANSWER,5,316
1591058750671224832,064270dabaa13edbd7238477860db0e46621a5ed4921e8aa2c0f9258e77722cc,2022-11-11 21:22:21,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <malloc.h>\n#include <math.h>\n\n\n\nint main()\n{\n   int i=0;\n   int a;\n   int count=0;\n   scanf(\""%d\"",&a);\n   for(i=2;i<=a;i++)\n   {\n       int j=0;\n    for(j=2;j<=sqrt(i);j++)\n       {\n           if(i%j==0)\n           {\n               break;\n           }\n       }\n       if(j>sqrt(i))\n           {\n               count++;\n           }\n\n   }\n printf(\""%d\"",count);\n return 0;\n}",ACCEPTED,15,320
1591058862461988864,d0d7b0b753346ba8da319a4bb32af868fdf41e2104a53a3a3d7b5b76c65907fe,2022-11-11 21:22:47,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint num(int N)\n{\n\tint i,a,b,c;\n\ta=N%10;\n\tb=N%4;\n\tif (b==0)\n\t{\n\t\tb=4;\n\t}\n\tc=6;\n\tfor (i=1;i<=b-1;i++)\n\t{\n\t\tc=c*6;\n\t}\n\tc=c%10;\n\treturn c;\n}\nint main()\n{\n\tint t,N,i;\n\tscanf(\""%d\"", &t);\n\tfor (i=1; i<=t; i++)\n\t{\n\t\tscanf(\""%d\"", &N);\n\t\tprintf(\""%d\\n\"", num(N));\n\t}\n}",WRONG_ANSWER,9,452
1591058933257670656,1f15b5b41f9e61f2d767bcb1ae88bef60c94b97dd423bfd2ba9c8c0e8e9d05bb,2022-11-11 21:23:04,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\nclass Main{\n    public static void main(String[] args){\n        Scanner sc = new Scanner(System.in);\n        int n = sc.nextInt();\n        int j = 0;\n        int q = 0;\n        for(int i = 3; i <= n ; i++){\n            int temp = 1;\n            for(int k=2 ; k<i ; k++){\n                if(i%k==0){\n                    temp = 2;\n                    break;\n                }\n\n            }\n            if(temp==1){\n                j++;\n            }\n        } \n     System.out.println(j+1);\n    }\n},TIME_LIMIT_EXCEEDED,1000,16284
1591059022952857600,d0d7b0b753346ba8da319a4bb32af868fdf41e2104a53a3a3d7b5b76c65907fe,2022-11-11 21:23:26,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint num()\n{\n    int N\n\tint i,a,b,c;\n\ta=N%10;\n\tb=N%4;\n\tif (b==0)\n\t{\n\t\tb=4;\n\t}\n\tc=6;\n\tfor (i=1;i<=b-1;i++)\n\t{\n\t\tc=c*6;\n\t}\n\tc=c%10;\n\treturn c;\n}\nint main()\n{\n\tint t,N,i;\n\tscanf(\""%d\"", &t);\n\tfor (i=1; i<=t; i++)\n\t{\n\t\tscanf(\""%d\"", &N);\n\t\tprintf(\""%d\\n\"", num(N));\n\t}\n}",COMPILE_ERROR,0,0
1591059041600737280,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-11 21:23:30,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n   int a,b,c,i;\n    i=0;\n    while(i<4,i++){\nscanf(\""%d%\"",&a);\n        if(x<a){\n    b=6*6;\n  x++}\n        \n    printf(\""c=%d\"",c);\n}}",COMPILE_ERROR,0,0
1591059055018315776,d0d7b0b753346ba8da319a4bb32af868fdf41e2104a53a3a3d7b5b76c65907fe,2022-11-11 21:23:33,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint num()\n{\n    int N;\n\tint i,a,b,c;\n\ta=N%10;\n\tb=N%4;\n\tif (b==0)\n\t{\n\t\tb=4;\n\t}\n\tc=6;\n\tfor (i=1;i<=b-1;i++)\n\t{\n\t\tc=c*6;\n\t}\n\tc=c%10;\n\treturn c;\n}\nint main()\n{\n\tint t,N,i;\n\tscanf(\""%d\"", &t);\n\tfor (i=1; i<=t; i++)\n\t{\n\t\tscanf(\""%d\"", &N);\n\t\tprintf(\""%d\\n\"", num(N));\n\t}\n}",WRONG_ANSWER,10,344
1591059105714868224,064270dabaa13edbd7238477860db0e46621a5ed4921e8aa2c0f9258e77722cc,2022-11-11 21:23:45,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <malloc.h>\n#include <math.h>\n\n\n\nint main()\n{\n   int i=0;\n   int a;\n   int count=0;\n   scanf(\""%d\"",&a);\n   for(i=3;i<=a;i+=2)\n   {\n       int j=0;\n    for(j=2;j<=sqrt(i);j++)\n       {\n           if(i%j==0)\n           {\n               break;\n           }\n       }\n       if(j>sqrt(i))\n           {\n               count++;\n           }\n\n   }\n printf(\""%d\"",count);\n return 0;\n}",WRONG_ANSWER,11,324
1591059139911028736,064270dabaa13edbd7238477860db0e46621a5ed4921e8aa2c0f9258e77722cc,2022-11-11 21:23:54,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <malloc.h>\n#include <math.h>\n\n\n\nint main()\n{\n   int i=0;\n   int a;\n   int count=0;\n   scanf(\""%d\"",&a);\n   for(i=2;i<=a;i++)\n   {\n       int j=0;\n    for(j=2;j<=sqrt(i);j++)\n       {\n           if(i%j==0)\n           {\n               break;\n           }\n       }\n       if(j>sqrt(i))\n           {\n               count++;\n           }\n\n   }\n printf(\""%d\"",count);\n return 0;\n}",ACCEPTED,16,476
1591059372556464128,65b63200c323c6ac4592306f5b943e39af48faf1b19b89cb7079428c6300e115,2022-11-11 21:24:49,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""2022\"")\n}",COMPILE_ERROR,0,0
1591059395901960192,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-11 21:24:55,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n,i,j,b=0,c=0;\n    scanf(\""%d\\n\"",&n);\n    for(i=n;i>1;i--){\n        for(j=i-1;j>1;j--){\n            if(i%j==0){\n                b=1;\n                break;\n            }\n        }\n        if(b==0){\n            c++;\n        }\n        b=0;\n    }\n    printf(\""%d\\n\"",c);\n    return 0;\n}",TIME_LIMIT_EXCEEDED,1000,384
1591059407268524032,65b63200c323c6ac4592306f5b943e39af48faf1b19b89cb7079428c6300e115,2022-11-11 21:24:57,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""2022\"");\n}",ACCEPTED,4,328
1591059530186817536,abe2744e33bb397ffb9bb13afcb202f611378fb4fc5801202f03933298ce5f5d,2022-11-11 21:25:27,Java,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"package com.work111;\n\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\t\n\tpublic static void main(String[] args) throws NumberFormatException, IOException {\n\t\tSystem.out.println(\""1111\"");\n\t\tBufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n\t\tint n = Integer.valueOf(reader.readLine());\n\t\tint max=0;\n\t\tint[] ints=new int[] {0,0,0,0,0,0,0,0,0,0};\n\t\tString[] lost = reader.readLine().split(\"" \"");\n\t\tString[] gain = reader.readLine().split(\"" \"");\n\t\tfor(int i=0;i<10;i++) {\n\t\t\tif(Integer.valueOf(lost[i])<Integer.valueOf(gain[i])) {\n\t\t\t\tif(i>0) {\n\t\t\t\t\tints[i]=Integer.valueOf(gain[i])-Integer.valueOf(lost[i]);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tints[i]+=Integer.valueOf(gain[i])-Integer.valueOf(lost[i])+ints[i-1];\n\t\t\t\t}\n\t\t\t\tif(max<ints[i]) {\n\t\t\t\t\tmax=ints[i];\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(max);\n\t\t\t\t}\n\t\n\n}\n",NON_ZERO_EXIT_CODE,89,18520
1591059546519441408,038e42376e9858a5a0d1826a17de3e149da6c7deb129501295633acdb2780aff,2022-11-11 21:25:31,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,#include<studio.h>\nchar a\nprintf(a=“今年是哪一年呢”)；\nreturn 0,COMPILE_ERROR,0,0
1591059586965110784,b8a7ba8e6c41741e66a8153e5f137c86c8dba9c4dbb2f65f35d7554a5b082d56,2022-11-11 21:25:40,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stadio.h>\nint main{\n    printf(\""2022\"");\n    return 0;\n}",COMPILE_ERROR,0,0
1591059685011161088,abe2744e33bb397ffb9bb13afcb202f611378fb4fc5801202f03933298ce5f5d,2022-11-11 21:26:04,Java,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"package com.work111;\n\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\t\n\tpublic static void main(String[] args) throws NumberFormatException, IOException {\n\t\t\n\t\tBufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n\t\tint n = Integer.valueOf(reader.readLine());\n\t\tint max=0;\n\t\tint[] ints=new int[] {0,0,0,0,0,0,0,0,0,0};\n\t\tString[] lost = reader.readLine().split(\"" \"");\n\t\tString[] gain = reader.readLine().split(\"" \"");\n\t\tfor(int i=0;i<10;i++) {\n\t\t\tif(Integer.valueOf(lost[i])<Integer.valueOf(gain[i])) {\n\t\t\t\tif(i>0) {\n\t\t\t\t\tints[i]=Integer.valueOf(gain[i])-Integer.valueOf(lost[i]);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tints[i]+=Integer.valueOf(gain[i])-Integer.valueOf(lost[i])+ints[i-1];\n\t\t\t\t}\n\t\t\t\tif(max<ints[i]) {\n\t\t\t\t\tmax=ints[i];\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(max);\n\t\t\t\t}\n\t\n\n}\n",NON_ZERO_EXIT_CODE,90,15208
1591059742460547072,b8a7ba8e6c41741e66a8153e5f137c86c8dba9c4dbb2f65f35d7554a5b082d56,2022-11-11 21:26:17,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stadio.h>\nint main{\n    int a;\n    a=2022;\n    printf(\""%d\"",a);\n    return 0;\n}",COMPILE_ERROR,0,0
1591059744905822208,abe2744e33bb397ffb9bb13afcb202f611378fb4fc5801202f03933298ce5f5d,2022-11-11 21:26:18,Java,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\t\n\tpublic static void main(String[] args) throws NumberFormatException, IOException {\n\t\t\n\t\tBufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n\t\tint n = Integer.valueOf(reader.readLine());\n\t\tint max=0;\n\t\tint[] ints=new int[] {0,0,0,0,0,0,0,0,0,0};\n\t\tString[] lost = reader.readLine().split(\"" \"");\n\t\tString[] gain = reader.readLine().split(\"" \"");\n\t\tfor(int i=0;i<10;i++) {\n\t\t\tif(Integer.valueOf(lost[i])<Integer.valueOf(gain[i])) {\n\t\t\t\tif(i>0) {\n\t\t\t\t\tints[i]=Integer.valueOf(gain[i])-Integer.valueOf(lost[i]);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tints[i]+=Integer.valueOf(gain[i])-Integer.valueOf(lost[i])+ints[i-1];\n\t\t\t\t}\n\t\t\t\tif(max<ints[i]) {\n\t\t\t\t\tmax=ints[i];\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(max);\n\t\t\t\t}\n\t\n\n}\n",NON_ZERO_EXIT_CODE,73,13832
1591059908093607936,d0d7b0b753346ba8da319a4bb32af868fdf41e2104a53a3a3d7b5b76c65907fe,2022-11-11 21:26:57,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint num()\n{\n    int N;\n\tint i,a,b,c;\n\ta=N%10;\n\tb=N%4;\n\tif (b==0)\n\t{\n\t\tb=4;\n\t}\n\tc=6;\n\tfor (i=1;i<=b-1;i++)\n\t{\n\t\tc=c*6;\n\t}\n\tc=c%10;\n\treturn c;\n}\nint main()\n{\n\tint t,N,i;\n\tscanf(\""%d\"", &t);\n\tfor (i=1; i<=t; i++)\n\t{\n\t\tscanf(\""%d\"", &N);\n\t\tprintf(\""%d\\n\"", num(N));\n\t}\n    return 0;\n}",WRONG_ANSWER,7,332
1591059946702176256,623621a8637aeabe9a4897b11971e8814b4064ca9539156ba9dc4a7ab4dd9b53,2022-11-11 21:27:06,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\nint X,Y,Z,NUM;\nscanf(\""%d,%d,%d\"",&X,Y,Z);\nNUM = X+Y-Z;\nprintf(\""%d\"",NUM);\nreturn 0;\n}",WRONG_ANSWER,3,188
1591060012561137664,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-11 21:27:22,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n   int a,b,i,x;\n    i=0;\n    b=6;\n    x=0;\n    while(i<4,i++){\nscanf(\""%d%\"",&a);\n        if(x<a)\n    b=b*6;\n  x++;\n        \n        \n    printf(\""b=%d\""/n,b);\n}}",COMPILE_ERROR,0,0
1591060015501348864,623621a8637aeabe9a4897b11971e8814b4064ca9539156ba9dc4a7ab4dd9b53,2022-11-11 21:27:22,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\nint X,Y,Z;\nscanf(\""%d,%d,%d\"",&X,Y,Z);\n\nprintf(\""%d\"",X+Y-Z);\nreturn 0;\n}",WRONG_ANSWER,4,312
1591060222637047808,2af449595ef30f97cefb348732f77a537f3df93d20abf901fe2ea852a179091b,2022-11-11 21:28:12,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint n,max=0,temp;\n\tint i;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&temp);\n\t\ta[i]=temp-a[i];\n\t\tif(max+a[i]>max){\n\t\t\tmax += a[i];\n\t\t}\n\t}\n\tprintf(\""%d\"",max);\n\treturn 0;\n}",WRONG_ANSWER,4,200
1591060229599592448,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-11 21:28:13,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"   #include <stdio.h>\n   #include <math.h>\n   int main(){\n      int n,x[10];\n      scanf(\""%d\"",&n);\n      for(int i=0;i<n;i++){\n            scanf(\""%d\"",&x[i]);\n          printf(\""%.0d \"",(int)pow(6,x[i])%10);\n      }\n      return 0;\n   }\n",WRONG_ANSWER,6,344
1591060234326552576,b8a7ba8e6c41741e66a8153e5f137c86c8dba9c4dbb2f65f35d7554a5b082d56,2022-11-11 21:28:14,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stadio.h>\nint main(){\n    int a;\n    a=2022;\n    printf(\""%d\"",a);\n    return 0;\n}",COMPILE_ERROR,0,0
1591060270645051392,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-11 21:28:23,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n   int a,b,i,x;\n    i=0;\n    b=6;\n    x=0;\n    while(i<4,i++){\nscanf(\""%d%\"",&a);\n        if(x<a)\n    b=b*6;\n  x++;\nelse\n    printf(\""b=%d\""/n,b);\n}",COMPILE_ERROR,0,0
1591060307299074048,038e42376e9858a5a0d1826a17de3e149da6c7deb129501295633acdb2780aff,2022-11-11 21:28:32,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<studio.h>\nmain()\n{\n    printf(\""请输入今年是哪一年呢？\"")\n}",COMPILE_ERROR,0,0
1591060411603030016,b8a7ba8e6c41741e66a8153e5f137c86c8dba9c4dbb2f65f35d7554a5b082d56,2022-11-11 21:28:57,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stadio.h>\nint main(){\n    printf(\""2022\"",);\n    return 0;\n}",COMPILE_ERROR,0,0
1591060450706501632,b8a7ba8e6c41741e66a8153e5f137c86c8dba9c4dbb2f65f35d7554a5b082d56,2022-11-11 21:29:06,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stadio.h>\nint main(){\n    printf(\""2022\"");\n    return 0;\n}",COMPILE_ERROR,0,0
1591060508906684417,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-11 21:29:20,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n   int a,b,i,c,x;\n    i=0;\n    b=6;\n    x=0;\n    while(i<4,i++){\nscanf(\""%d%\"",&a);\n        if(x<a)\n    b=b*6;\n  x++;\nelse\n    c=b%10;\n    printf(\""c=%d\""/n,c);\n}",COMPILE_ERROR,0,0
1591060518608109568,b8a7ba8e6c41741e66a8153e5f137c86c8dba9c4dbb2f65f35d7554a5b082d56,2022-11-11 21:29:22,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main(){\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,4,308
1591060544432443392,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-11 21:29:28,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n   int a,b,i,c,x;\n    i=0;\n    b=6;\n    x=0;\n    while(i<4,i++){\nscanf(\""%d\"",&a);\n        if(x<a)\n    b=b*6;\n  x++;\nelse\n    c=b%10;\n    printf(\""c=%d\""/n,c);\n}",COMPILE_ERROR,0,0
1591060546013696000,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-11 21:29:29,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"  #include <stdio.h>\n   #include <math.h>\n   int main(){\n      int n,x[10];\n      scanf(\""%d\"",&n);\n      for(int i=0;i<n;i++){\n            scanf(\""%d\"",&x[i]);\n          printf(\""%d \"",(int)pow(6,x[i])%10);\n      }\n      return 0;\n   }\n",WRONG_ANSWER,6,200
1591060569879285760,623621a8637aeabe9a4897b11971e8814b4064ca9539156ba9dc4a7ab4dd9b53,2022-11-11 21:29:34,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\nint X,Y,Z,A,B;\nscanf(\""%d,%d,%d\"",&X,Y,Z);\nA = X+Y;\nB = A-Y;\nprintf(\""%d\"",B);\nreturn 0;\n}",WRONG_ANSWER,4,468
1591060621527945216,675867a135da6702ed27c0eec3e4b6d2a7d95c44854c01823fc152f0689f010d,2022-11-11 21:29:47,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n#define MAX 100\nint main(void)\n{\n    int n,i,x[MAX];\n    int pf;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&x[i]);\n    for(i=0;i<n;i++)\n    {\n        pf=pow(6,x[i]);\n        pf=pf%10;\n        printf(\""%d\\n\"",pf);\n    }\n    return 0;\n}",WRONG_ANSWER,7,332
1591060723449528320,65b63200c323c6ac4592306f5b943e39af48faf1b19b89cb7079428c6300e115,2022-11-11 21:30:11,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int X,Y,Z,F;\n    scanf(\""%d,%d,%d\"",&X,&Y,&Z);\n    F=X+Y-Z;\n    printf(\""&d\\n\"",F);\n    return 0;\n}",WRONG_ANSWER,3,192
1591060725714432000,675867a135da6702ed27c0eec3e4b6d2a7d95c44854c01823fc152f0689f010d,2022-11-11 21:30:12,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n#define MAX 100\nint main(void)\n{\n    int n,i,x[MAX];\n    int pf;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&x[i]);\n    for(i=0;i<n;i++)\n    {\n        pf=pow(6,x[i]);\n        pf=pf%10;\n        printf(\""%d\"",pf);\n    }\n    return 0;\n}",WRONG_ANSWER,6,200
1591060829070471168,65b63200c323c6ac4592306f5b943e39af48faf1b19b89cb7079428c6300e115,2022-11-11 21:30:36,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int X,Y,Z,F;\n    scanf(\""%d,%d,%d\"",&X,&Y,&Z);\n    F=X+Y-Z;\n    printf(\""%d\\n\"",F);\n    return 0;\n}",WRONG_ANSWER,2,348
1591060836590858240,623621a8637aeabe9a4897b11971e8814b4064ca9539156ba9dc4a7ab4dd9b53,2022-11-11 21:30:38,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\nint X,Y,Z;\nscanf(\""%d\"",&X);\nscanf(\""%d\"",&Y);\nscanf(\""%d\"",&Z);\nprintf(\""%d\"",X+Y-Z);\nreturn 0;\n}",ACCEPTED,7,328
1591060884334641152,038e42376e9858a5a0d1826a17de3e149da6c7deb129501295633acdb2780aff,2022-11-11 21:30:49,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<studio.h>\nmain()\n{\n    int a,b,c,d,sum=0\n    printf(\""请输入今年是哪一年呢？\\n\"")\n        scanf (\""%d%d%d%d\"",&a,&b,&c,&d);\n}",COMPILE_ERROR,0,0
1591060939779145728,b8a7ba8e6c41741e66a8153e5f137c86c8dba9c4dbb2f65f35d7554a5b082d56,2022-11-11 21:31:03,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a ,b ,c;\n    scanf(\""%d,%d,%d\"",&a,&b,&c);\n    printf(\""%d\"",a+b-c);\n    return 0;\n}",WRONG_ANSWER,3,324
1591061015687663616,2af449595ef30f97cefb348732f77a537f3df93d20abf901fe2ea852a179091b,2022-11-11 21:31:21,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint n,max,temp;\n\tint i;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&temp);\n\t\ta[i]=temp-a[i];\n        if(i==0){\n            max=a[i];\n        }\n\t\telse if(max+a[i]>max){\n\t\t\tmax += a[i];\n\t\t}\n\t}\n\tprintf(\""%d\"",max);\n\treturn 0;\n}",WRONG_ANSWER,4,332
1591061081169137664,c03ae905b4de4d41e5d9328da5270539e1a32e2d888b8dd41fb10f72c24a90ce,2022-11-11 21:31:36,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n int n;\n int i;\n scanf(\""%d\"",&n);\n int a[n],b[n];\n for(i=0;i<n;i++)\n {\n\n     if(i==0)\n\n\n        scanf(\""%d\"",&a[i]);\n     else\n        scanf(\""%d\"",&a[i]);\n\n\n        }\n\n\n\n    for(i=0;i<n;i++)\n    {\n        if(i==0)\n    {\n\n\n\n        if(a[i]==0)\n            printf(\""1\"");\n        else\n            printf(\""6\"");\n    }\n    else\n    {\n        if(a[i]==0)\n            printf(\""\\n1\"");\n        else\n            printf(\""\\n6\"");\n\n    }\n}\n\n\n\n\n\n    return 0;\n}",ACCEPTED,11,184
1591061311528701952,65b63200c323c6ac4592306f5b943e39af48faf1b19b89cb7079428c6300e115,2022-11-11 21:32:31,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int X,Y,Z,F;\n    scanf(\""%d,%d,%d\"",&X,&Y,&Z);\n     F=X+Y-Z;\n    printf(\""%d\\n\"",F);\n    return 0;\n}",WRONG_ANSWER,3,200
1591061517934596096,aa0e227662691639471f7b18bc3d5c6aa34fdabcef6d52266691b6fbe7e8d245,2022-11-11 21:33:21,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n         Scanner in = new Scanner(System.in);\n\t        \n         int a = in.nextInt();\n     int[] b=new int[a];\n         for(int i=0;i<a;i++){\n             b[i] = in.nextInt();\n         }\n     int c=6;\n     System.out.print(c);\n     }\n },WRONG_ANSWER,132,16368
1591061526809739264,65b63200c323c6ac4592306f5b943e39af48faf1b19b89cb7079428c6300e115,2022-11-11 21:33:23,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int X,Y,Z,F;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n     F=X+Y-Z;\n    printf(\""%d\\n\"",F);\n    return 0;\n}",ACCEPTED,6,324
1591061648767516672,b8a7ba8e6c41741e66a8153e5f137c86c8dba9c4dbb2f65f35d7554a5b082d56,2022-11-11 21:33:52,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a ,b ,c;\n    a=<100;b=<100;c=<100;\n    scanf(\""%d,%d,%d\"",&a,&b,&c);\n    printf(\""%d\"",a+b-c);\n    return 0;\n}",COMPILE_ERROR,0,0
1591061689297076224,b8a7ba8e6c41741e66a8153e5f137c86c8dba9c4dbb2f65f35d7554a5b082d56,2022-11-11 21:34:01,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a ,b ,c;\n    scanf(\""%d,%d,%d\"",&a,&b,&c);\n    printf(\""%d\"",a+b-c);\n    return 0;\n}",WRONG_ANSWER,3,184
1591061716656500736,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-11 21:34:08,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n   int a,b,i,c,x,n;\n    i=0;\n    b=6;\n    x=0;\n    n=0;\n    for(i<4,i++){\nscanf(\""%d\"",&a);\n        while(x<a){\n\n    b=b*6;\n  x++;\n    }\n    c=b%10;\n    printf(\""c=%d\""/n,c);\n}",COMPILE_ERROR,0,0
1591061723564539904,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 21:34:10,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\t  public static void main(String[] args) {\n\t\t      Scanner sc = new Scanner(System.in);\n\t\t      System.out.println(\""请输入n的大小：\"");\n\t\t          int n = sc.nextInt();\n\t\t          int count = 0;\n\t\t          int i = 1;\n\t\t          int j = 2;\n\t\t          for(i=1;i<=n;i++){\n\t\t  \t            for(j=2;j<i;j++){\n\t\t  \t\t            if (i%j==0){\n\t\t  \t\t               break;\n\t\t  \t\t            }\n\t\t  \t\t        }\n\t\t  \t            if(i==j){\n\t                        count++;\n\t                    }\n\t\t  \t\t    }\n\t\t  \t\tSystem.out.println(count);\n\t\t  \t\tsc.close();\n\t\t  }\n}",TIME_LIMIT_EXCEEDED,1000,16624
1591061743038672896,212aee9dc233539050d1d324af20b580172711970f7c24349b9c7c8ac9b114cd,2022-11-11 21:34:14,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <studio.h>\nvoid main ()\n{\n    printf(\""2022\"")\n }\nreturn 0 ",COMPILE_ERROR,0,0
1591061754279407616,038e42376e9858a5a0d1826a17de3e149da6c7deb129501295633acdb2780aff,2022-11-11 21:34:17,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,a=2022\nprint(a),ACCEPTED,17,2756
1591061811921727488,212aee9dc233539050d1d324af20b580172711970f7c24349b9c7c8ac9b114cd,2022-11-11 21:34:31,C++,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <studio.h>\nvoid main ()\n{\n    printf(\""2022\"")\n }\nreturn 0 ",COMPILE_ERROR,0,0
1591061900522205184,ef50cfe7f34b26d29f617c97ac65d40bd15ba1e063897a190284243de955e254,2022-11-11 21:34:52,Java,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"import java.util.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args){\n\t    Scanner sc=new Scanner(System.in);\n\t    int n=sc.nextInt();\n\t    int i,j;\n\t    int k=0;\n\t    for(i=2;i<n;i++) {\n\t    \tj=2;\n\t    \tfor(j=2;j<Math.sqrt(i);j++) {\n\t    \t\tif(i%j==0) {\n\t    \t\t\tbreak;\n\t    \t\t}\n\t    \t}\n\t    \tif(j>Math.sqrt(i)) k++;\n\t    }\n\t    System.out.println(k);\n\t}\n\t\n}\n",ACCEPTED,258,16624
1591061926673711104,62c83306b4f5c482e4e9a52dc69ae0b8ee7b5238abb34e56352843a0d484ff2c,2022-11-11 21:34:58,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,print(2022),ACCEPTED,17,2872
1591061962631479296,b8a7ba8e6c41741e66a8153e5f137c86c8dba9c4dbb2f65f35d7554a5b082d56,2022-11-11 21:35:07,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a ,b ,c;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    printf(\""%d\"",a+b-c);\n    return 0;\n}",ACCEPTED,8,408
1591062106944876544,70c675ddfcb60b2192bc8ac38fb068fec0500208a5bf97a796c7cc074b43cf87,2022-11-11 21:35:41,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"\nimport java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner myScanner = new Scanner(System.in);\n\t\tint n = myScanner.nextInt();\n\t\tint[] arr = new int[n];\n\t\tint x;\n\t\tfor(int i = 0;i < n;i++) {\n\t\t\tarr[i] = myScanner.nextInt();\n\t\t\tif(arr[i] == 0) {\n\t\t\t\tx = 1;\n\t\t\t}else {\n\t\t\t\tx = 6;\n\t\t\t}\n\t\t\tif(n == 1 || i == n-1) {\n\t\t\t\tSystem.out.printf(\""%d\"",x);\n\t\t\t}else {\n\t\t\t\tSystem.out.println(x);\n\t\t\t}\n\t\t}\n\t}\n\n}\n",WRONG_ANSWER,270,16344
1591062197881581568,212aee9dc233539050d1d324af20b580172711970f7c24349b9c7c8ac9b114cd,2022-11-11 21:36:03,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <studio.h>\nvoid main ()\n{\n    printf(\""2022\"");\n }\nreturn 0 ",COMPILE_ERROR,0,0
1591062329574338560,aa0e227662691639471f7b18bc3d5c6aa34fdabcef6d52266691b6fbe7e8d245,2022-11-11 21:36:34,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n         Scanner in = new Scanner(System.in);\n\t        \n         int a = in.nextInt();\n     int[] b=new int[a];\n         for(int i=0;i<a;i++){\n             b[i] = in.nextInt();\n         }\n     int c=6;\n     for(int i=0;i<a;i++) {\n     System.out.println(c);\n     }\n     }\n },NON_ZERO_EXIT_CODE,248,16288
1591062340794101760,1f15b5b41f9e61f2d767bcb1ae88bef60c94b97dd423bfd2ba9c8c0e8e9d05bb,2022-11-11 21:36:37,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\nclass Main{\n    public static void main(String[] args){\n        Scanner sc = new Scanner(System.in);\n        int n = sc.nextInt();\n        int j = 0;\n        int q = 0;\n        for(int i = 3; i <= n ; i++){\n            int temp = 1;\n            for(int k=2 ; k<i ; k++){\n                if(i%k==0){\n                    temp = 2;\n                    break;\n                }\n\n            }\n            if(temp==1){\n                j++;\n            }\n        } \n     System.out.println(j+1);\n    }\n},TIME_LIMIT_EXCEEDED,1000,16412
1591062372419153920,1f15b5b41f9e61f2d767bcb1ae88bef60c94b97dd423bfd2ba9c8c0e8e9d05bb,2022-11-11 21:36:44,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\nclass Main{\n    public static void main(String[] args){\n        Scanner sc = new Scanner(System.in);\n        int n = sc.nextInt();\n        int j = 0;\n        int q = 0;\n        for(int i = 3; i <= n ; i++){\n            int temp = 1;\n            for(int k=2 ; k<i ; k++){\n                if(i%k==0){\n                    temp = 2;\n                    break;\n                }\n\n            }\n            if(temp==1){\n                j++;\n            }\n        } \n     System.out.println(j+1);\n    }\n},TIME_LIMIT_EXCEEDED,1000,16368
1591062416132214784,aa0e227662691639471f7b18bc3d5c6aa34fdabcef6d52266691b6fbe7e8d245,2022-11-11 21:36:55,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n         Scanner in = new Scanner(System.in);\n\t        \n         int a = in.nextInt();\n     int[] b=new int[a];\n         for(int i=0;i<a;i++){\n             b[i] = in.nextInt();\n         }\n     int c=6;\n     for(int i=0;i<a;i++) {\n     System.out.println(c);\n     }\n        return 0;\n     }\n },COMPILE_ERROR,0,0
1591062515168116736,aa0e227662691639471f7b18bc3d5c6aa34fdabcef6d52266691b6fbe7e8d245,2022-11-11 21:37:18,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n         Scanner in = new Scanner(System.in);\n\t        \n         int a = in.nextInt();\n     int[] b=new int[a];\n         for(int i=0;i<a;i++){\n             b[i] = in.nextInt();\n         }\n     int c=6;\n     for(int i=0;i<a;i++) {\n     System.out.println(c);\n     }\n      \n     }\n },NON_ZERO_EXIT_CODE,258,16496
1591062531924361216,038e42376e9858a5a0d1826a17de3e149da6c7deb129501295633acdb2780aff,2022-11-11 21:37:22,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<studio.h>\n#include<stdlib.h>\n\nint mian()\n{\n    int X,Y,Z,P=0\n        scanf(\""%d%d%d\"",&X,&Y,&Z);\n    if(0＜=X＜=100,0＜＝Y＜＝100，0＜＝Z＜=100)\n        P=X+Y-Z;\n    printf（\""%d\"",&P）;\n    return 0;\n}",COMPILE_ERROR,0,0
1591062670235734016,2af449595ef30f97cefb348732f77a537f3df93d20abf901fe2ea852a179091b,2022-11-11 21:37:55,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n\tint n,max,temp,m=0;\n\tint i;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&temp);\n\t\ta[i]=temp-a[i];\n\t\tm += a[i];\n\t\tif(i==0){\n\t\t\tmax=m;\n\t\t}\n\t\telse if(m>max){\n\t\t\tmax =m;\n\t\t}\n\t}\n\tprintf(\""%d\"",max);\n\treturn 0;\n}",WRONG_ANSWER,3,468
1591062693736394752,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 21:38:01,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n\t  public static void main(String[] args) {\n\t\t      Scanner sc = new Scanner(System.in);\n\t\t      System.out.println(\""请输入n的大小：\"");\n\t\t          int n = sc.nextInt();\n\t\t          int count = 0;\n\t\t          int i = 1;\n\t\t          int j = 2;\n\t\t          for(i=1;i<=n;i++){\n\t\t  \t            for(j=2;j<Math.sqrt(i);j++){\n\t\t  \t\t            if (i%j==0){\n\t\t  \t\t               break;\n\t\t  \t\t            }\n\t\t  \t\t        }\n\t\t  \t            if(i==j){\n\t                        count++;\n\t                    }\n\t\t  \t\t    }\n\t\t  \t\tSystem.out.println(count);\n\t\t  \t\tsc.close();\n\t\t  }\n}",WRONG_ANSWER,134,19628
1591062750455992320,623621a8637aeabe9a4897b11971e8814b4064ca9539156ba9dc4a7ab4dd9b53,2022-11-11 21:38:14,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n  int icase,num,i,r;\n  scanf(\""%d\"",&icase);\n  for(i=0;i<icase;i++){\n    scanf(\""%d\"",&num);\n    r=num%10;\n    if(r==0||r==1||r==5||r==6||r==9)\n      printf(\""%d\\n\"",r);\n    else{\n      if(num%4==0)\n        printf(\""%d\\n\"",r*r*r*r%10); \n      else if(num%4==1) \n        printf(\""%d\\n\"",r);\n      else if(num%4==2)\n        printf(\""%d\\n\"",r*r%10);\n      else if(num%4==3)\n        printf(\""%d\\n\"",r*r*r%10);\n    }\n  }\n}",WRONG_ANSWER,3,192
1591062857922445312,217f1946625720e554af7294d3599b943eea3b430c0df7aa0c5c70abe9904e56,2022-11-11 21:38:40,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016," class test{\n     public static void main(String[] args){\n         System.out.println(\""2022\"");\n     }\n }",COMPILE_ERROR,0,0
1591063191981981696,9aa17e95021225dcdd2b01419b021cd002e47f9a7854274df042f64621bd207a,2022-11-11 21:40:00,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n    int n,a,i,j=0;\n    scanf(\""%d\"",&a);\n    for(i=1;i<=a;i++)\n    {\n     if(a%i==0)\n    {\n     j++;\n     }\n     printf(\""%d\"",j);\n    }\n\nreturn 0;\n}\n\n",WRONG_ANSWER,8,320
1591063281710706688,02f3cf9a5ba39e00e2644b9392922d3ea3ea233f83c612c7dbd879f319ea2bdc,2022-11-11 21:40:21,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int i,j,n,count=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n    {\n        for(j=2;j<i;j++)\n        {\n            if(i%j==0)\n            break;\n        }\n        if(j==i)\n        count++;\n    }\n    printf(\""%d\"",count);\n    return 0;\n}\n",ACCEPTED,966,392
1591063600033214464,217f1946625720e554af7294d3599b943eea3b430c0df7aa0c5c70abe9904e56,2022-11-11 21:41:37,Java,300.0,1590528927448293376,1590525945717575680,1049226928954454016," class Main{\n     public static void main(String[] args){\n         System.out.println(\""2022\"");\n     }\n }",ACCEPTED,68,14488
1591063652768223232,9c773df96630087325d11d08f2dbc9851abb095c63fb7b3e55cb667898dfe23f,2022-11-11 21:41:50,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nmain()\n    {\n   printf(\""2022\\n\"");\n\n}",ACCEPTED,3,320
1591063799908577280,e7f8e9ba366feb4551b7dc8e6a149f796e822980a43de4fcc91ded552c4bcbd4,2022-11-11 21:42:25,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n\nint main()\n{   \n    int X,Y,Z,F; \n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    F=X+Y-Z; \n    printf(\""%d\"",F);\n    return 0;\n}",ACCEPTED,6,192
1591063900630614016,345826d11b41befc23adeb536e81da8eb6ec9a8bfb9448acf91422deedb8ba4a,2022-11-11 21:42:49,C++,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,i,max=0,sum=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n];\n\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n     for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n\n    for(i=0;i<n;i++)\n        {\n            c[i]=0;\n        }\n\n     for(i=0;i<n;i++)\n        {\n            c[i]=b[i]-a[i];\n            sum=sum+c[i];\n       if(max<sum)\n        max=sum;\n       if(sum<0)\n        sum=0;\n       continue;\n        }\n\n   printf(\""%d\"",max);\n}\n",ACCEPTED,4,308
1591064040464494592,70c675ddfcb60b2192bc8ac38fb068fec0500208a5bf97a796c7cc074b43cf87,2022-11-11 21:43:22,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner myScanner = new Scanner(System.in);\n\t\tint n = myScanner.nextInt();\n\t\tint[] arr = new int[n];\n\t\tint x,i;\n\t\tfor(i = 0;i < n;i++) {\n\t\t\tarr[i] = myScanner.nextInt();\n\t\t\tif(arr[i] == 0) {\n\t\t\t\tx = 1;\n\t\t\t}else {\n\t\t\t\tx = 6;\n\t\t\t}\n\t\t\tSystem.out.printf(\""%d\"",x);\n\t\t\tif(i!=n-1)\n\t\t\t\tSystem.out.println();\n\t\t\t\t\n\t\t}\n\t}\n}\n",NON_ZERO_EXIT_CODE,264,16580
1591064051344539648,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-11 21:43:25,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"//第五种方法，巧用平方根,写法二：\n#include <stdio.h>\nint main()\n{\n\tint x = 0,i = 0,n,c=1;\n    scanf(\""%d\\n\"",&n);\n\tfor (x = 3; x <=n; x += 2)\n\t{\n\t\tfor (i = 2; i*i<=x; i++)  //控制第二层循环\n\t\t{\n\t\t\tif (x % i == 0)\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (i*i>x)\n\t\t{\n\t\t\tc++;\n\t\t}\n\t}\n\tprintf(\""%d\\n\"",c);\n\treturn 0;\n}\n",ACCEPTED,13,368
1591064054012096512,038e42376e9858a5a0d1826a17de3e149da6c7deb129501295633acdb2780aff,2022-11-11 21:43:25,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<studio.h>\n#include<stdlib.h>\n\nint mian()\n{\n    int X,Y,Z,P=0\n        scanf(\""%d %d %d\"",&X,&Y,&Z);\n    if(0＜=X＜=100,0＜＝Y＜＝100，0＜＝Z＜=100)\n        P=X+Y-Z;\n    printf（\""%d\"",&P）;\n    return 0;\n}",COMPILE_ERROR,0,0
1591064089982468096,212aee9dc233539050d1d324af20b580172711970f7c24349b9c7c8ac9b114cd,2022-11-11 21:43:34,C++,0.0,1590528927448293376,1590525945717575680,1049226928954454016,#include <iostream>\nusing namespace std;\nint main ()\n{\n    cout<<2022;\n    return 0:\n},COMPILE_ERROR,0,0
1591064124916830208,345826d11b41befc23adeb536e81da8eb6ec9a8bfb9448acf91422deedb8ba4a,2022-11-11 21:43:42,C++,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,i,max=0,sum=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n];\n\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n     for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n\n    for(i=0;i<n;i++)\n        {\n            c[i]=0;\n        }\n\n     for(i=0;i<n;i++)\n        {\n            c[i]=b[i]-a[i];\n            sum=sum+c[i];\n       if(max<sum)\n        max=sum;\n       if(sum<0)\n        sum=0;\n        }\n\n   printf(\""%d\"",max);\n}\n",ACCEPTED,3,344
1591064154549563392,b8a7ba8e6c41741e66a8153e5f137c86c8dba9c4dbb2f65f35d7554a5b082d56,2022-11-11 21:43:49,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a,b,c,d;\n    scanf(\""%d\\n%d %d %d\"",&a,&b,&c,&d);\n    while(6^a/10<10)\n        printf(\""%d\"",6^a%10);\n    else while(6^a/100<10)\n         printf(\""%d\"",6^a%10);\n    else while(6^a/1000<10)\n        printf(\""%d\"",6^a%10);\n   else while(6^a/10000<10)\n        printf(\""%d\"",6^a%10);\n     else while(6^a/100000<10)\n        printf(\""%d\"",6^a%10);\n    return 0;\n}",COMPILE_ERROR,0,0
1591064157875666944,212aee9dc233539050d1d324af20b580172711970f7c24349b9c7c8ac9b114cd,2022-11-11 21:43:50,C++,0.0,1590528927448293376,1590525945717575680,1049226928954454016,#include <iostream>\nusing namespace std;\nint main ()\n{\n    cout <<2022;\n    return 0:\n},COMPILE_ERROR,0,0
1591064200015839232,038e42376e9858a5a0d1826a17de3e149da6c7deb129501295633acdb2780aff,2022-11-11 21:44:00,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<studio.h>\n#include<stdlib.h>\n\nint mian()\n{\n    int X,Y,Z,P=0\n        scanf(\""%d %d %d\"",&X,&Y,&Z);\n        P=X+Y-Z;\n    printf（\""%d\"",P）;\n    return 0;\n}",COMPILE_ERROR,0,0
1591064254017482752,038e42376e9858a5a0d1826a17de3e149da6c7deb129501295633acdb2780aff,2022-11-11 21:44:13,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n\nint mian()\n{\n    int X,Y,Z,P=0\n        scanf(\""%d %d %d\"",&X,&Y,&Z);\n        P=X+Y-Z;\n    printf（\""%d\"",P）;\n    return 0;\n}",COMPILE_ERROR,0,0
1591064272866705408,345826d11b41befc23adeb536e81da8eb6ec9a8bfb9448acf91422deedb8ba4a,2022-11-11 21:44:17,C++,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,i,max=0,sum=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n];\n\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n     for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n\n    for(i=0;i<n;i++)\n        {\n            c[i]=0;\n        }\n\n     for(i=0;i<n;i++)\n        {\n            c[i]=b[i]-a[i];\n            sum=sum+c[i];\n       if(max<sum)\n        max=sum;\n       if(sum<0)\n        sum=0;\n        }\n   printf(\""%d\"",max);\n}\n",ACCEPTED,3,332
1591064334082551808,038e42376e9858a5a0d1826a17de3e149da6c7deb129501295633acdb2780aff,2022-11-11 21:44:32,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n\nint main()\n{\n    int X,Y,Z,P=0\n        scanf(\""%d %d %d\"",&X,&Y,&Z);\n        P=X+Y-Z;\n    printf（\""%d\"",P）;\n    return 0;\n}",COMPILE_ERROR,0,0
1591064418392281088,9c773df96630087325d11d08f2dbc9851abb095c63fb7b3e55cb667898dfe23f,2022-11-11 21:44:52,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nmain()\n    {\n    int x,y,z;\nscanf(\""%d%d%d\"",&x,&y,&z);\n    printf(\""%d\\n\"",x+y-z);\n}\n",ACCEPTED,8,320
1591064423408664576,9aa17e95021225dcdd2b01419b021cd002e47f9a7854274df042f64621bd207a,2022-11-11 21:44:53,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int i,j,n,count=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n    {\n        for(j=2;j<i;j++)\n        {\n            if(i%j==0)\n            break;\n        }\n        if(j==i)\n        count++;\n    }\n    printf(\""%d\"",count);\n    return 0;\n}\n\n",ACCEPTED,951,324
1591064444153692160,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-11 21:44:58,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"//第五种方法，巧用平方根,写法二：\n#include <stdio.h>\nint main()\n{\n\tint x = 0,i = 0,n,c=1;\n    scanf(\""%d\\n\"",&n);\n\tfor (x = 3; x <=n; x += 2)\n\t{\n\t\tfor (i = 2; i*i<=x; i++)  //控制第二层循环\n\t\t{\n\t\t\tif (x % i == 0)\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (i*i>x)\n\t\t{\n\t\t\tc++;\n\t\t}\n\t}\n\tprintf(\""%d\\n\"",c);\n\treturn 0;\n}\n",ACCEPTED,11,196
1591064449094586368,038e42376e9858a5a0d1826a17de3e149da6c7deb129501295633acdb2780aff,2022-11-11 21:44:59,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n\nint main()\n{\n    int X,Y,Z,P;\n        scanf(\""%d %d %d\"",&X,&Y,&Z);\n        P=X+Y-Z;\n    printf（\""%d\"",P）;\n    return 0;\n}",COMPILE_ERROR,0,0
1591064487883505664,70c675ddfcb60b2192bc8ac38fb068fec0500208a5bf97a796c7cc074b43cf87,2022-11-11 21:45:09,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner myScanner = new Scanner(System.in);\n\t\tint n = myScanner.nextInt();\n\t\tint[] arr = new int[n];\n\t\tint x,i;\n\t\tfor(i = 0;i < n;i++) {\n\t\t\tarr[i] = myScanner.nextInt();\n\t\t\tif(arr[i] == 0) {\n\t\t\t\tx = 1;\n\t\t\t}else {\n\t\t\t\tx = 6;\n\t\t\t}\n\t\t\tif(n!=n-1)\n\t\t\t\tSystem.out.printf(\""%d\\n\"",x);\n\t\t\telse\n\t\t\t\tSystem.out.printf(\""%d\"",x);\t\n\t\t}\n\t}\n}\n",NON_ZERO_EXIT_CODE,247,16892
1591064649494233088,157388d8d83262bba5955406e39bb36c3baacd3a224f63ce1739541bb582af20,2022-11-11 21:45:47,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n int i;\ni=2022;\nprintf(\""%d\"",i);  \n}\n\n",ACCEPTED,3,192
1591064691911208960,9c773df96630087325d11d08f2dbc9851abb095c63fb7b3e55cb667898dfe23f,2022-11-11 21:45:57,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int a,n,i;\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++)\n    {\n    scanf(\""%d\"",&a);\n    if(a==0)\n        printf(\""1\"");\n    else\n        printf(\""6\"");\n    if(i!=n)\n    {\n        printf(\""\\n\"");\n    }\n    }\n}",ACCEPTED,9,348
1591064739982127104,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-11 21:46:09,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n   int a,b,i,c,x,n;\n    i=0;\n    b=6;\n    x=0;\n    n=0;\n    for(i<4,i++;){\nscanf(\""%d\"",&a);\n        for(x<a){\n\n    b=b*6;\n  x++;\n    }\n    c=b%10;\n    printf(\""c=%d\""/n,c);\n}\n    return 0;\n}",COMPILE_ERROR,0,0
1591064750274969600,2af449595ef30f97cefb348732f77a537f3df93d20abf901fe2ea852a179091b,2022-11-11 21:46:11,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n\tint n,max,temp,m=0;\n\tint i;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&temp);\n\t\ta[i]=temp-a[i];\n\t\tm += a[i];\n\t\tif(i==0){\n\t\t\tmax=m;\n\t\t}\n\t\telse if(m>max){\n\t\t\tmax =m;\n\t\t}\n\t}\n\tprintf(\""%d\\n\"",max);\n\treturn 0;\n}",WRONG_ANSWER,4,348
1591064796240326656,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-11 21:46:22,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"\n#include <stdio.h>\nint main(){\n\n    int n,sum=0,a=0;\n    scanf(\""%d\"",&n);\n    for(int j=1;j<=n;j++){\n    for(int i=2;i<j;i++){\n        if(j%i==0) a++;\n    }\n      if(a==0) ++sum;\n        a=0;\n    }\n    printf(\""%d\"",sum-1);\n}\n",TIME_LIMIT_EXCEEDED,1000,336
1591064835016687616,9c773df96630087325d11d08f2dbc9851abb095c63fb7b3e55cb667898dfe23f,2022-11-11 21:46:31,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nvoid main()\n{\n    int x,i,t=1,n;\n    scanf(\""%d\"",&n);\n    for(x=3;x<=n;x+=2)\n    {\n        for(i=2;i<=sqrt(x);i++)\n            if(x%i==0)\n                break;\n        if(i>sqrt(x))\n            t++;\n    }\n    printf(\""%d\\n\"",t);\n}",ACCEPTED,14,320
1591064838187581440,1f15b5b41f9e61f2d767bcb1ae88bef60c94b97dd423bfd2ba9c8c0e8e9d05bb,2022-11-11 21:46:32,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\nclass Main{\n    public static void main(String[] args){\n        Scanner sc = new Scanner(System.in);\n        int n = sc.nextInt();\n        int j = 0;\n        int q = 0;\n        for(int i = 3; i <= n ; i++){\n            int temp = 1;\n            for(int k=2 ; k<iMath.sqrt(i) ; k++){\n                if(i%k==0){\n                    temp = 2;\n                    break;\n                }\n\n            }\n            if(temp==1){\n                j++;\n            }\n        } \n     System.out.println(j+1);\n    }\n},COMPILE_ERROR,0,0
1591064936875339776,1f15b5b41f9e61f2d767bcb1ae88bef60c94b97dd423bfd2ba9c8c0e8e9d05bb,2022-11-11 21:46:56,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\nclass Main{\n    public static void main(String[] args){\n        Scanner sc = new Scanner(System.in);\n        int n = sc.nextInt();\n        int j = 0;\n        int q = 0;\n        for(int i = 3; i <= n ; i++){\n            int temp = 1;\n            for(int k=2 ; k<Math.sqrt(i) ; k++){\n                if(i%k==0){\n                    temp = 2;\n                    break;\n                }\n\n            }\n            if(temp==1){\n                j++;\n            }\n        } \n     System.out.println(j+1);\n    }\n},WRONG_ANSWER,143,16524
1591064958459248640,62c83306b4f5c482e4e9a52dc69ae0b8ee7b5238abb34e56352843a0d484ff2c,2022-11-11 21:47:01,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,print(8+7-3)\n,WRONG_ANSWER,16,2880
1591065000599400448,aa0e227662691639471f7b18bc3d5c6aa34fdabcef6d52266691b6fbe7e8d245,2022-11-11 21:47:11,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n         Scanner in = new Scanner(System.in);\n\t        \n         int a = in.nextInt();\n          int[] b=new int[a];\n         for(int i=0;i<a;i++){\n             \n             b[i] = in.nextInt();\n             if(b[i]==0){\n                 System.out.println(1);\n             }else{\n                  System.out.println(6);\n             }\n         }\n     \n      \n     }\n },NON_ZERO_EXIT_CODE,260,19408
1591065224390709248,33bf53cc1ac96b08f54401ab68b14c30e1f5caef149cc9332585b7c5f09675ed,2022-11-11 21:48:04,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint n ,x , start ,end , t=0 , max ,sum,xiao[n], huo[n],jue[n];\n\tscanf( \""%d\"" , & n );\n\tfor ( x = 0 ; x < n ; x++ )\n\t{\n\t\tscanf(\""%d\"", &xiao[x]);\n\t}\n\tfor ( x = 0 ; x < n ; x++ )\n\t{\n\t\tscanf(\""%d\"", &huo[x]);\n\t}\n\tfor ( x = 0 ; x < n ; x++ )\n\t{\n\t\tjue[x] = huo[x] - xiao[x];\n\t}\n\tfor ( start = 0 ; start < n ; start++ )\n\t{\n\t\tfor ( end = 0 ; end < n ; end++)\n\t\t{\n\t\t\tfor( t = start ; t <= end ; t++)\n\t\t\t{\n\t\t\t\tsum = sum + jue[t];\n\t\t\t}\n\t\t\tif( sum > max )\n\t\t\t{\n\t\t\t\tmax = sum;\n\t\t\t}\n\t\t\tsum = 0 ;\n\t\t}\n\t}\n\tprintf( \""%d\"" , sum );\n}",WRONG_ANSWER,2,196
1591065292992720896,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 21:48:21,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"import java.util.Scanner;\n\t\npublic class asda {\n    public static void main(String[] args) {\n        boolean isFlag=true;\n        System.out.println(\""请输入n2的大小：\"");\n        Scanner sc = new Scanner(System.in);\n        int n = sc.nextInt();\n        int count =0;\n        for (int i = 2; i <=n; i++) {\n            for (int j = 2; j <=Math.sqrt(i); j++) {//优化二：判断一个数是否是素数，只要除到那个数开根号就够了\n                if (i%j==0){\n                    isFlag=false;\n                   break;//优化一：只对本身非质数的自然是是有效的\n                }\n            }\n            if (isFlag==true){\n            \tcount++;\n            }\n            isFlag=true;//重置isFlage\n        }\n        System.out.println(count);\n    }\n}",COMPILE_ERROR,0,0
1591065341558587392,d0d7b0b753346ba8da319a4bb32af868fdf41e2104a53a3a3d7b5b76c65907fe,2022-11-11 21:48:32,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nvoid main()\n{\n\tint a,i,j,z;\n\tscanf(\""%d\"",&a);\n\tz=0;\n\tfor(i=2;i<=a;i++)\n\t\t{\n\t\tfor(j=2;j<=i;j++)\n\t\t\tif(i%j==0)\n\t\t\t\tbreak;\n\t\tif(i==j)\n\t\t\tz++;\n\t\t}\n\t\tprintf(\""%d\"",z);\n}",ACCEPTED,924,320
1591065346247819264,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 21:48:33,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"import java.util.Scanner;\n\t\npublic class Main {\n    public static void main(String[] args) {\n        boolean isFlag=true;\n        System.out.println(\""请输入n2的大小：\"");\n        Scanner sc = new Scanner(System.in);\n        int n = sc.nextInt();\n        int count =0;\n        for (int i = 2; i <=n; i++) {\n            for (int j = 2; j <=Math.sqrt(i); j++) {//优化二：判断一个数是否是素数，只要除到那个数开根号就够了\n                if (i%j==0){\n                    isFlag=false;\n                   break;//优化一：只对本身非质数的自然是是有效的\n                }\n            }\n            if (isFlag==true){\n            \tcount++;\n            }\n            isFlag=true;//重置isFlage\n        }\n        System.out.println(count);\n    }\n}",WRONG_ANSWER,135,19172
1591065378330054656,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-11 21:48:41,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    if(X>=0&&X<=100&&Y>=0&&Y<=100&&Z>=0&&Z<=100)\n        printf(\""%d\"",X+Y-Z);\n}\n",ACCEPTED,6,316
1591065384428572672,33bf53cc1ac96b08f54401ab68b14c30e1f5caef149cc9332585b7c5f09675ed,2022-11-11 21:48:42,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint n ,x , start ,end , t=0 , max ,sum,xiao[n], huo[n],jue[n];\n\tscanf( \""%d\"" , & n );\n\tfor ( x = 0 ; x < n ; x++ )\n\t{\n\t\tscanf(\""%d\"", &xiao[x]);\n\t}\n\tfor ( x = 0 ; x < n ; x++ )\n\t{\n\t\tscanf(\""%d\"", &huo[x]);\n\t}\n\tfor ( x = 0 ; x < n ; x++ )\n\t{\n\t\tjue[x] = huo[x] - xiao[x];\n\t}\n\tfor ( start = 0 ; start < n ; start++ )\n\t{\n\t\tfor ( end = 0 ; end < n ; end++)\n\t\t{\n\t\t\tfor( t = start ; t <= end ; t++)\n\t\t\t{\n\t\t\t\tsum = sum + jue[t];\n\t\t\t}\n\t\t\tif( sum > max )\n\t\t\t{\n\t\t\t\tmax = sum;\n\t\t\t}\n\t\t\tsum = 0 ;\n\t\t}\n\t}\n\tprintf( \""%d\"" , sum );\n}",WRONG_ANSWER,3,180
1591065405777580032,aa0e227662691639471f7b18bc3d5c6aa34fdabcef6d52266691b6fbe7e8d245,2022-11-11 21:48:47,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) throws Exception{\n         Scanner in = new Scanner(System.in);\n\t        \n         int a = in.nextInt();\n          int[] b=new int[a];\n         for(int i=0;i<a;i++){\n             \n             b[i] = in.nextInt();\n             if(b[i]==0){\n                 System.out.println(1);\n             }else{\n                  System.out.println(6);\n             }\n         }\n     \n      \n     }\n },WRONG_ANSWER,253,16636
1591065512434511872,064270dabaa13edbd7238477860db0e46621a5ed4921e8aa2c0f9258e77722cc,2022-11-11 21:49:13,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"nt main()\n{\n   int a[9];\n   int i,m;\n   scanf(\""%d\"",&i);\n\n   for(m=0;m<i;m++)\n   {\n      scanf(\""%d\"",&a[m]);\n   }\n\n\n\n return 0;\n}\n",COMPILE_ERROR,0,0
1591065542620917760,212aee9dc233539050d1d324af20b580172711970f7c24349b9c7c8ac9b114cd,2022-11-11 21:49:20,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"public class Hello{\n    \n    public static void main(string[] args){\n        System out println(\""2022\"")\n    } \n}",COMPILE_ERROR,0,0
1591065548648132608,038e42376e9858a5a0d1826a17de3e149da6c7deb129501295633acdb2780aff,2022-11-11 21:49:22,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n\nint main()\n{\n    int X,Y,Z,P;\n        scanf(\""%d %d %d\"",&X,&Y,&Z);\n        P=X+Y-Z;\nprintf(\""%d\"",P);\n    return 0;\n}\n",ACCEPTED,7,332
1591065554071388160,70c675ddfcb60b2192bc8ac38fb068fec0500208a5bf97a796c7cc074b43cf87,2022-11-11 21:49:23,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"\nimport java.util.Scanner;\n\npublic class Main {\n\npublic static void main(String[] args) {\n\t\tScanner myScanner = new Scanner(System.in);\n\t\tint n = myScanner.nextInt();\n\t\tint x,i;\n\t\tfor(i = 0;i < n;i++) {\n\t\t\tx=myScanner.nextInt();\n\t\t\tif(x==0)\n\t\t\t\tSystem.out.print(1);\n\t\t\telse\n\t\t\t\tSystem.out.print(6);\n\t\t\tif(i!=n-1)\n\t\t\t\tSystem.out.print(\""\\n\"");\n\t\t}\n\t}\n}\n",NON_ZERO_EXIT_CODE,244,16748
1591065631171088384,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-11 21:49:41,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,b,n;\n    scanf(\""%d\"",&a);\n    for(b=0;b<a;b++)\n       {\n\n      scanf(\""%d\"",&n);\n     if(n!=0)\n        printf(\""6\\n\"");\n    else\n        printf(\""1\\n\"");\n        }\n}",ACCEPTED,14,472
1591065650783649792,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 21:49:46,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"import java.util.Scanner;\n\t\npublic class Main{\n    public static void main(String[] args){\n        boolean isFlag=true;\n        System.out.println(\""请输入n2的大小：\"");\n        Scanner sc = new Scanner(System.in);\n        int n = sc.nextInt();\n        int count =0;\n        for (int i = 2; i <=n; i++) {\n            for (int j = 2; j <=Math.sqrt(i); j++) {\n                if (i%j==0){\n                    isFlag=false;\n                   break;\n                }\n            }\n            if (isFlag==true){\n            \tcount++;\n            }\n            isFlag=true;\n        }\n        System.out.println(count);\n    }\n}",WRONG_ANSWER,132,16292
1591065676876394496,aa0e227662691639471f7b18bc3d5c6aa34fdabcef6d52266691b6fbe7e8d245,2022-11-11 21:49:52,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) throws Exception{\n         Scanner in = new Scanner(System.in);\n\t        \n         int a = in.nextInt();\n          int[] b=new int[a];\n         for(int i=0;i<a;i++){\n             \n             b[i] = in.nextInt();\n             if(b[i]==0){\n                 System.out.println(1);\n             }if(b[i]>0&&b[i]<=10000000000){\n                  System.out.println(6);\n             }\n         }\n     \n      \n     }\n },COMPILE_ERROR,0,0
1591065723047313408,c03ae905b4de4d41e5d9328da5270539e1a32e2d888b8dd41fb10f72c24a90ce,2022-11-11 21:50:03,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n int x,m=0,n,i,k;\n scanf(\""%d\"", &n);\n    for(x=1;x<n;x++){\n        k=(int)sqrt(x);\n        for(i=2;i<=k;i++){\n           if(x%i==0){      \n               break;\n            }\n        }\n        if(i>k){\n            m++;\n        }\n }\n    printf(\""%d\\n\"",m-1);\n return 0;\n    }\n   ",ACCEPTED,13,324
1591065793952002048,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-11 21:50:20,Java,300.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\t\npublic class Main{\n    public static void main(String[] args){\n        boolean isFlag=true;\n        Scanner sc = new Scanner(System.in);\n        int n = sc.nextInt();\n        int count =0;\n        for (int i = 2; i <=n; i++) {\n            for (int j = 2; j <=Math.sqrt(i); j++) {\n                if (i%j==0){\n                    isFlag=false;\n                   break;\n                }\n            }\n            if (isFlag==true){\n            \tcount++;\n            }\n            isFlag=true;\n        }\n        System.out.println(count);\n    }\n},ACCEPTED,258,16144
1591065907273728000,cb5ee28f5d61aba010f231fd6045de7f8516849eb1dbf293dc5a73a02c3aea2f,2022-11-11 21:50:47,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""2022\"");\n}",ACCEPTED,4,460
1591066086601195520,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-11 21:51:30,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,a,b,c=0;\n    scanf(\""%d\"",&n);\n    for(a=2;a<=n;a++)\n       {\n           b=0;\n        for(b=2;b<sqrt(a*1.0);b++)\n            {\n                if(a%b==0)\n                {\n                    break;\n                }\n                }\n            if(b>sqrt(a*1.0))\n               {\n                   c++;\n               }\n                }\n    printf(\""%d\"",c);\n}",ACCEPTED,12,352
1591066167312166912,2e4af98c441106efa9ee51f8a781d0eee91a3dff6193987d421eb3a48725c814,2022-11-11 21:51:49,C++,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <iostream>\n\nusing namespace std;\n\nint main() {\n    int n;\n    scanf(\""%d\"", &n);\n    int a1[n], b1[n], c1[n];\n\n    for (int j = 0; j < n; ++j) scanf(\""%d\"", &a1[j]);\n    for (int j = 0; j < n; ++j) scanf(\""%d\"", &b1[j]);\n    for (int i = 0; i < n; ++i) c1[i] = b1[i] - a1[i];\n\n    int t1, t2 = 0;\n    for (int i = 0; i < n; ++i) {\n        t1 = 0;\n        for (int j = i; j < n; ++j) {\n            \n            t1 += c1[j];\n            if (t1 > t2) {\n                t2 = t1;\n            }\n\n        }\n    }\n    printf(\""%d\"", t2);\n}\n\n\n//10\n//-3 4 5 -6 8 9 -4 5 9 -4\n//3 2 4 5 -6 -7 -7 5 -8 4\n//6 -2 -1 11 -14 -16 -3 0  -17 8\n",ACCEPTED,3,444
1591066371809677312,62c83306b4f5c482e4e9a52dc69ae0b8ee7b5238abb34e56352843a0d484ff2c,2022-11-11 21:52:38,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,X=8\nY=7\nZ=3\nprint(X+Y-Z),WRONG_ANSWER,16,3672
1591066379174875136,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-11 21:52:40,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"\n#include <stdio.h>\nint main(){\n\n    int n,sum=0,a=0;\n    scanf(\""%d\"",&n);\n    for(int j=1;j<=n;j++){\n    for(int i=2;i<j;i++){\n        if(j%i==0) a++;\n    }\n      if(a==0) ++sum;\n        a=0;\n    }\n    printf(\""%d\"",sum-1);\n}\n",TIME_LIMIT_EXCEEDED,1000,432
1591066447101628416,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-11 21:52:56,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,count,flag,i,j;\n    scanf(\""%d\"",&n);\n    2<=n<=pow10(5);\n    flag=1;\n    count=0;\n    for(i=2;i<=n;i++){\n            flag=1;\n            for(j=2;j<i;j++){\n        if(i%j==0){\n            flag=0;\n            break;\n            }\n            }\n        if(flag==1){\n                count++;\n            }\n    }\n    printf(\""%d\"",count);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1591066479620063232,78be6544368032bca5c77e80c662c8b124de613d759bef01fc9dee070d94fe83,2022-11-11 21:53:03,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main(){\n    int n;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n];\n    int i,max=0,sum=0;\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n\n    for(i=0;i<n;i++)\n        c[i]=b[i]-a[i];\n\n    for(i=0;i<n;i++)\n    {\n        sum+=c[i];\n        if(max<sum) max=sum;\n        if(sum<0) {\n            sum=0;\n            continue;\n        }\n    }\n    printf(\""%d\"",max);\n}\n",ACCEPTED,3,192
1591066535597244416,157388d8d83262bba5955406e39bb36c3baacd3a224f63ce1739541bb582af20,2022-11-11 21:53:17,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    if(X>=0&&X<=100&&Y>=0&&Y<=100&&Z>=0&&Z<=100)\n    printf(\""%d\"",X+Y-Z);\n}",ACCEPTED,7,312
1591066674818777088,70c675ddfcb60b2192bc8ac38fb068fec0500208a5bf97a796c7cc074b43cf87,2022-11-11 21:53:50,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"\nimport java.util.Scanner;\n\npublic class Main {\n\npublic static void main(String[] args) {\n\t\tScanner myScanner = new Scanner(System.in);\n\t\tint n = myScanner.nextInt();\n\t\tint x,i;\n\t\tfor(i = 0;i < n;i++) {\n\t\t\tx=myScanner.nextInt();\n\t\t\tif(x==0)\n\t\t\t\tSystem.out.print(1);\n\t\t\telse\n\t\t\t\tSystem.out.print(6);\n\t\t\tif(i!=n-1)\n\t\t\t\tSystem.out.print(\""\\n\"");\n\t\t}\n    myScanner.close();\n\t}\n}\n",NON_ZERO_EXIT_CODE,257,19340
1591066679839358976,212aee9dc233539050d1d324af20b580172711970f7c24349b9c7c8ac9b114cd,2022-11-11 21:53:51,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"void main()\n{\n    printf(\""2022\"");\n}\nreturn 0",COMPILE_ERROR,0,0
1591066835720667136,aa0e227662691639471f7b18bc3d5c6aa34fdabcef6d52266691b6fbe7e8d245,2022-11-11 21:54:28,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) throws Exception{\n        Scanner in = new Scanner(System.in);\n        \n        int a = in.nextInt();\n         long[] b=new long[a];\n        for(int i=0;i<a;i++){\n            \n            b[i] = in.nextInt();\n            if(b[i]==0){\n                System.out.println(1);\n            }if(b[i]>0&&b[i]<=1000000000){\n                 System.out.println(6);\n            }\n        }\n    \n     \n    }\n},NON_ZERO_EXIT_CODE,271,20868
1591066994781257728,aa0e227662691639471f7b18bc3d5c6aa34fdabcef6d52266691b6fbe7e8d245,2022-11-11 21:55:06,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n       int sum=0;\n\t\t\tScanner in=new Scanner(System.in);\n\t        int n=in.nextInt();\n\t        if(n>=2&&n<=100000) {\n\t        \tfor(int i=2;i<=n;i++){\n\t\t            for (int j=2;j<=i;j++){\n\t\t                if(i%j==0 && j!=i){\n\t\t                    break;\n\t\t                }\n\t\t                if (i==j){\n\t\t                \tsum++;\n\t\t                   \n\t\t                }\n\t\t            }\n\t\t        }\n\t\t        System.out.print(sum);\n\t        }else {\n\t        \treturn;\n\t        }\n\t        \n\t        }\n\t},TIME_LIMIT_EXCEEDED,1000,16384
1591067074636611584,c03ae905b4de4d41e5d9328da5270539e1a32e2d888b8dd41fb10f72c24a90ce,2022-11-11 21:55:25,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main() {\n int n, i;\n scanf(\""%d\"", &n);\n int a[1000], b[1000], c[1000];\n for (i = 0; i < n; i++) {\n  scanf(\""%d \"", &a[i]);\n }\n for ( i = 0; i < n; i++) {\n  scanf(\""%d \"", &b[i]);\n }\n for (i = 0; i < n; i++) {\n  c[i] = b[i] -  a[i];  \n }\n int plan = c[0];\n    int sign=plan;\n for (i = 1; i < n; i++) {\n  plan += c[i];\n  if(plan<0){\n            plan=0;\n        }\n        if(plan>sign){\n            sign=plan;\n        }\n }\n printf(\""%d\\n\"", sign);\n return 0;\n}",ACCEPTED,4,188
1591067220145385472,aa0e227662691639471f7b18bc3d5c6aa34fdabcef6d52266691b6fbe7e8d245,2022-11-11 21:56:00,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) throws Exception{\n        Scanner in = new Scanner(System.in);\n        \n        int a = in.nextInt();\n         long[] b=new long[a];\n        for(int i=0;i<a;i++){\n            \n            b[i] = in.nextInt();\n            if(b[i]==0){\n                System.out.println(1);\n            }if(b[i]>0&&b[i]<=1000000000){\n                 System.out.println(6);\n            }\n        }\n        return;\n    \n     \n    }\n},WRONG_ANSWER,244,16672
1591067377356312576,70c675ddfcb60b2192bc8ac38fb068fec0500208a5bf97a796c7cc074b43cf87,2022-11-11 21:56:38,Java,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"\nimport java.util.Scanner;\n\npublic class Main {\n\npublic static void main(String[] args) {\n\t\tScanner myScanner = new Scanner(System.in);\n\t\tlong n = myScanner.nextLong();\n\t\tlong x,i;\n\t\tfor(i = 0;i < n;i++) {\n\t\t\tx=myScanner.nextLong();\n\t\t\tif(x==0)\n\t\t\t\tSystem.out.print(1);\n\t\t\telse\n\t\t\t\tSystem.out.print(6);\n\t\t\tif(i!=n-1)\n\t\t\t\tSystem.out.print(\""\\n\"");\n\t\t}\n\n\t}\n}\n",ACCEPTED,355,19344
1591067408922644480,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-11 21:56:45,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,count,flag,i,j;\n    scanf(\""%d\"",&n);\n    2<=n<=pow(10,5);\n    flag=1;\n    count=0;\n    for(i=2;i<=n;i++){\n            flag=1;\n            for(j=2;j<i;j++){\n        if(i%j==0){\n            flag=0;\n            break;\n            }\n            }\n        if(flag==1){\n                count++;\n            }\n    }\n    printf(\""%d\"",count);\n    return 0;\n}\n",ACCEPTED,972,356
1591067469500977152,2af449595ef30f97cefb348732f77a537f3df93d20abf901fe2ea852a179091b,2022-11-11 21:56:59,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n\tint n,max,temp=0;\n\tint i;\n\tscanf(\""%d\"",&n);\n\tint a[n],b[n],c[n];\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&b[i]);\n\t}\n\tfor(i=0;i<n;i++)\n\t{\n\t\tc[i] = b[i]-a[i];\n\t}\n\tfor(i=0;i<n;i++)\n\t{\n\t\ttemp+=c[i];\n\t\tif(i==0){\n\t\t\tmax=temp;\n\t\t}\n\t\tif(temp>max){\n\t\t\tmax=temp;\n\t\t}\n\t}\n\tprintf(\""%d\"",max);\n\treturn 0;\n}",WRONG_ANSWER,3,328
1591067513822183424,2af449595ef30f97cefb348732f77a537f3df93d20abf901fe2ea852a179091b,2022-11-11 21:57:10,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n\tint n,max,temp=0;\n\tint i;\n\tscanf(\""%d\"",&n);\n\tint a[n],b[n],c[n];\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&b[i]);\n\t}\n\tfor(i=0;i<n;i++)\n\t{\n\t\tc[i] = b[i]-a[i];\n\t}\n\tfor(i=0;i<n;i++)\n\t{\n\t\ttemp+=c[i];\n\t\tif(i==0){\n\t\t\tmax=temp;\n\t\t}\n\t\tif(temp>max){\n\t\t\tmax=temp;\n\t\t}\n\t}\n\tprintf(\""%d\\n\"",max);\n\treturn 0;\n}",WRONG_ANSWER,4,308
1591067542850965504,2af449595ef30f97cefb348732f77a537f3df93d20abf901fe2ea852a179091b,2022-11-11 21:57:17,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n\tint n,max,temp=0;\n\tint i;\n\tscanf(\""%d\"",&n);\n\tint a[n],b[n],c[n];\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&b[i]);\n\t}\n\tfor(i=0;i<n;i++)\n\t{\n\t\tc[i] = b[i]-a[i];\n\t}\n\tfor(i=0;i<n;i++)\n\t{\n\t\ttemp+=c[i];\n\t\tif(i==0){\n\t\t\tmax=temp;\n\t\t}\n\t\tif(temp>max){\n\t\t\tmax=temp;\n\t\t}\n\t}\n\tprintf(\""%d\\n\"",max);\n\treturn 0;\n}",WRONG_ANSWER,3,196
1591067639420616704,212aee9dc233539050d1d324af20b580172711970f7c24349b9c7c8ac9b114cd,2022-11-11 21:57:40,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}\n",ACCEPTED,3,324
1591067656223002624,cb5ee28f5d61aba010f231fd6045de7f8516849eb1dbf293dc5a73a02c3aea2f,2022-11-11 21:57:44,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int X,Y,Z,A;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    A=X+Y-Z;\n    printf(\""%d\"",A);\n}",ACCEPTED,6,200
1591067658773135360,212aee9dc233539050d1d324af20b580172711970f7c24349b9c7c8ac9b114cd,2022-11-11 21:57:45,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}\n",ACCEPTED,3,312
1591067792688873472,aa0e227662691639471f7b18bc3d5c6aa34fdabcef6d52266691b6fbe7e8d245,2022-11-11 21:58:17,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) throws Exception{\n        Scanner in = new Scanner(System.in);\n        \n        long a = in.nextLong();\n         long[] b=new long[(int) a];\n        for(int i=0;i<a;i++){\n            \n            b[i] = in.nextInt();\n            if(b[i]==0){\n                System.out.println(1);\n            }if(b[i]>0&&b[i]<=1000000000){\n                 System.out.println(6);\n            }\n        }\n    \n     \n    }\n},NON_ZERO_EXIT_CODE,254,20776
1591067839707021312,aa0e227662691639471f7b18bc3d5c6aa34fdabcef6d52266691b6fbe7e8d245,2022-11-11 21:58:28,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) throws Exception{\n        Scanner in = new Scanner(System.in);\n        \n        long a = in.nextLong();\n         long[] b=new long[(int) a];\n        for(int i=0;i<a;i++){\n            \n            b[i] = in.nextInt();\n            if(b[i]==0){\n                System.out.println(1);\n            }if(b[i]>0&&b[i]<=1000000000){\n                 System.out.println(6);\n            }\n        }\n    \n     return;\n    }\n},NON_ZERO_EXIT_CODE,274,16352
1591067905301741568,9c773df96630087325d11d08f2dbc9851abb095c63fb7b3e55cb667898dfe23f,2022-11-11 21:58:43,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nvoid main()\n{\n    int n,i,j;\n    scanf(\""%d\"",&n);\n    int a[100],c[100];\n    int max=0,sum=0;\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for( i=0;i<n;i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=0;i<n;i++)\n    {\n     int thissum=0;\n    for(j=i;j<n+i;j++)\n    {\n        if(j>=n)\n            thissum=thissum-a[j-n]+c[j-n];\n        else\n            thissum=thissum-a[j]+c[j];\n        if(thissum>max)\n            max=thissum;\n    }\n    if(max>sum)\n        sum=max;\n    }\n    printf(\""%d\\n\"",sum);\n}",ACCEPTED,5,312
1591067936591253504,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 21:58:51,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(){\n  int a[100],b[100],c=0,n,i,max=0;\n  scanf(\""%d\"",&n);\n  for(i=0;i<n;i++)\n  {\n      scanf(\""%d\"",&a[i]);\n  }\n   for(i=0;i<n;i++)\n  {\n      scanf(\""%d\"",&b[i]);\n  }\n\n\nfor(i=0;i<n;i++)\n  {\n     c=c-a[i]+b[i];\n    if(c>max)\n    max=c;\n  }\n  printf(\""%d\"",max);\n}\n",WRONG_ANSWER,3,184
1591067973073309696,038e42376e9858a5a0d1826a17de3e149da6c7deb129501295633acdb2780aff,2022-11-11 21:59:00,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main() {\n\tint n, i;\n\tscanf(\""%d\"", &n);\n\tint a[1000], b[1000], c[1000];\n\tfor (i = 0; i < n; i++) {\n\t\tscanf(\""%d \"", &a[i]);\n\t}\n\tfor ( i = 0; i < n; i++) {\n\t\tscanf(\""%d \"", &b[i]);\n\t}\n\tfor (i = 0; i < n; i++) {\n\t\tc[i] = b[i] - \ta[i];  \n\t}\n\tint plan = c[0];\n    int sign=plan;\n\tfor (i = 1; i < n; i++) {\n\t\tplan += c[i];\n\t\tif(plan<0){\n            plan=0;\n        }\n        if(plan>sign){\n            sign=plan;\n        }\n\t}\n\tprintf(\""%d\\n\"", sign);\n\treturn 0;\n}",NON_ZERO_EXIT_CODE,16,2748
1591068010704601088,a57fdafe4877cd9608fc0ac8a5120a47bc60a015785960e61b67b4e66187c2f2,2022-11-11 21:59:09,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int i,n,j,num=0,k;\n    if(scanf(\""%d\"",&n)){\n    for(i=1;i<=n;i++){\n        k=(int)sqrt(i);\n        for(j=2;j<=k;j++){\n            if(i%j==0)\n                break;\n        }\n    if(j>k)\n        num++;\n    }\n    printf(\""%d\"",num-1);\n    return 0;\n    }\n}\n",ACCEPTED,13,492
1591068021999861760,1f15b5b41f9e61f2d767bcb1ae88bef60c94b97dd423bfd2ba9c8c0e8e9d05bb,2022-11-11 21:59:11,Java,300.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\nclass Main{\n    public static void main(String[] args){\n        Scanner sc = new Scanner(System.in);\n        int n = sc.nextInt();\n        int j = 0;\n        int q = 0;\n        for(int i = 3; i <= n ; i++){\n            int temp = 1;\n            for(double k=2 ; k<=Math.sqrt(i) ; k++){\n                if(i%k==0.0){\n                    temp = 2;\n                    break;\n                }\n\n            }\n            if(temp==1){\n                j++;\n            }\n        } \n     System.out.println(j+1);\n    }\n},ACCEPTED,350,19088
1591068025833459712,038e42376e9858a5a0d1826a17de3e149da6c7deb129501295633acdb2780aff,2022-11-11 21:59:12,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main() {\n\tint n, i;\n\tscanf(\""%d\"", &n);\n\tint a[1000], b[1000], c[1000];\n\tfor (i = 0; i < n; i++) {\n\t\tscanf(\""%d \"", &a[i]);\n\t}\n\tfor ( i = 0; i < n; i++) {\n\t\tscanf(\""%d \"", &b[i]);\n\t}\n\tfor (i = 0; i < n; i++) {\n\t\tc[i] = b[i] - \ta[i];  \n\t}\n\tint plan = c[0];\n    int sign=plan;\n\tfor (i = 1; i < n; i++) {\n\t\tplan += c[i];\n\t\tif(plan<0){\n            plan=0;\n        }\n        if(plan>sign){\n            sign=plan;\n        }\n\t}\n\tprintf(\""%d\\n\"", sign);\n\treturn 0;\n}",ACCEPTED,4,512
1591068068095262720,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-11 21:59:22,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n   int a,b,i,c,x,n,m,q,w,e,r;\n    scanf(\""%d\"" ,&n);\n    scanf(\""%d%d%d\"",&a,&b,&c);\n    i=pow(6,a);\n    r=pow(6,b)\n    e=pow(6,c)\n    x=i%10;\n    w=r%10;\n    q=e%10;\n    printf(\""%d\\n\"",x);\n    printf(\""%d\\n\"",w);\n    printf(\""%d\\n\"",q);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1591068134264606720,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-11 21:59:38,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n   int a,b,i,c,x,n,m,q,w,e,r;\n    scanf(\""%d\"" ,&n);\n    scanf(\""%d%d%d\"",&a,&b,&c);\n    i=pow(6,a);\n    r=pow(6,b);\n    e=pow(6,c);\n    x=i%10;\n    w=r%10;\n    q=e%10;\n    printf(\""%d\\n\"",x);\n    printf(\""%d\\n\"",w);\n    printf(\""%d\\n\"",q);\n    return 0;\n}\n",WRONG_ANSWER,4,332
1591068134537236480,1f15b5b41f9e61f2d767bcb1ae88bef60c94b97dd423bfd2ba9c8c0e8e9d05bb,2022-11-11 21:59:38,Java,300.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\nclass Main{\n    public static void main(String[] args){\n        Scanner sc = new Scanner(System.in);\n        int n = sc.nextInt();\n        int j = 0;\n        int q = 0;\n        for(int i = 3; i <= n ; i++){\n            int temp = 1;\n            for(double k=2 ; k<=Math.sqrt(i) ; k++){\n                if(i%k==0.0){\n                    temp = 2;\n                    break;\n                }\n\n            }\n            if(temp==1){\n                j++;\n            }\n        } \n     System.out.println(j+1);\n    }\n},ACCEPTED,354,16880
1591068197204307968,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-11 21:59:53,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n   int a,b,i,c,x,n,m,q,w,e,r;\n    scanf(\""%d\"" ,&n);\n    scanf(\""%d%d%d\"",&a,&b,&c);\n    i=pow(6,a);\n    r=pow(6,b);\n    e=pow(6,c);\n    x=i%10;\n    w=r%10;\n    q=e%10;\n    printf(\""%d\\n\"",x);\n    printf(\""%d\\n\"",w);\n    printf(\""%d\"",q);\n    return 0;\n}\n",WRONG_ANSWER,4,308
1591068301059493888,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-11 22:00:18,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n   int a,b,i,c,x,n,m,q,w,e,r;\n    scanf(\""%d\"" ,&n);\n    scanf(\""%d%d%d\"",&a,&b,&c);\n    i=pow(6,a);\n    r=pow(6,b);\n    e=pow(6,c);\n    x=i%10;\n    w=r%10;\n    q=e%10;\n    printf(\""%d\\n\"",x);\n    printf(\""%d\\n\"",w);\n    printf(\""%d\"",q);\n    return 0;\n}\n",WRONG_ANSWER,3,324
1591068327684931584,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 22:00:24,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(){\n  int a[100],b[100],c=0,n,i,max=0;\n  scanf(\""%d\"",&n);\n  for(i=0;i<n;i++)\n  {\n      scanf(\""%d\"",&a[i]);\n  }\n   for(i=0;i<n;i++)\n  {\n      scanf(\""%d\"",&b[i]);\n  }\n\nfor(j=0;j<n;j++)\n{for(i=j;i<n;i++)\n  {\n     c=c-a[i]+b[i];\n    if(c>max)\n    max=c;\n  }\n\n    \n}\n\n  printf(\""%d\"",max);\n}\n",COMPILE_ERROR,0,0
1591068416004395008,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 22:00:45,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(){\n  int a[100],b[100],c=0,n,j,i,max=0;\n  scanf(\""%d\"",&n);\n  for(i=0;i<n;i++)\n  {\n      scanf(\""%d\"",&a[i]);\n  }\n   for(i=0;i<n;i++)\n  {\n      scanf(\""%d\"",&b[i]);\n  }\n\nfor(j=0;j<n;j++)\n{for(i=j;i<n;i++)\n  {\n     c=c-a[i]+b[i];\n    if(c>max)\n    max=c;\n  }\n\n    \n}\n\n  printf(\""%d\"",max);\n}\n",WRONG_ANSWER,5,308
1591068465908199424,29249e539dec3766ca388aaa46121bd2a768da21260d3f436e20eeaac8ee73b3,2022-11-11 22:00:57,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""2022\\n\"");\n    return 0;\n}\n",ACCEPTED,3,324
1591068470668759040,675867a135da6702ed27c0eec3e4b6d2a7d95c44854c01823fc152f0689f010d,2022-11-11 22:00:58,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n#define MAX 100\nint main(void)\n{\n    int n,i,j,c[MAX];\n    int m=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&c[i]);\n\n    for(i=0;i<c[i];i++)\n    {\n        for(j=0;j<c[i];j++)\n        {\n            m=6*6;\n            m=m%10;\n        }\n\n    }\n    for(i=0;i<n;i++)\n        printf(\""%d\\n\"",m);\n\n    return 0;\n}",WRONG_ANSWER,6,192
1591068518659981312,217f1946625720e554af7294d3599b943eea3b430c0df7aa0c5c70abe9904e56,2022-11-11 22:01:10,Java,300.0,1590524835191705600,1572865591226855424,1049226928954454016,import java.util.Scanner;\npublic class Main{\n    public static void main(String[] args){\n        int result;\n        Scanner scanner = new Scanner(System.in);\n        int X=scanner.nextInt();\n        int Y=scanner.nextInt();\n        int Z=scanner.nextInt();\n        result=X+Y-Z;\n        System.out.println(result);\n    }\n},ACCEPTED,250,16252
1591068576214200320,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-11 22:01:23,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n   int a,b,i,c,x,n,m,q,w,e,r;\n    scanf(\""%d\"" ,&n);\n    scanf(\""%d%d%d\"",&a,&b,&c);\n    i=pow(6,a);\n    r=pow(6,b);\n    e=pow(6,c);\n    x=i%10;\n    w=r%10;\n    q=e%10;\n    printf(\""%d\\n\"",x);\n    printf(\""%d\\n\"",w);\n    printf(\""%d\"",q);\n    return 0;\n}\n",WRONG_ANSWER,4,456
1591068816304570368,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 22:02:21,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(){\n  int a[100],b[100],c=0,n,j,i,max=0;\n  scanf(\""%d\"",&n);\n  for(i=0;i<n;i++)\n  {\n      scanf(\""%d\"",&a[i]);\n  }\n   for(i=0;i<n;i++)\n  {\n      scanf(\""%d\"",&b[i]);\n  }\n\nfor(j=0;j<n;j++)\n{for(i=j;i<n;++i)\n  {\n     c=c-a[i]+b[i];\n    if(c>max)\n    max=c;\n  }\n\n    \n}\n\n  printf(\""%d\"",max);\n}\n",WRONG_ANSWER,3,348
1591068846985904128,038e42376e9858a5a0d1826a17de3e149da6c7deb129501295633acdb2780aff,2022-11-11 22:02:28,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n\tint x,m=0,n,i,k;\n\tscanf(\""%d\"", &n);\n    for(x=1;x<n;x++){\n        k=(int)sqrt(x);\n        for(i=2;i<=k;i++){\n           if(x%i==0){      \n               break;\n            }\n        }\n        if(i>k){\n            m++;\n        }\n\t}\n    printf(\""%d\\n\"",m-1);\n\treturn 0;\n    }",ACCEPTED,12,196
1591068939831017472,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-11 22:02:50,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n   int a,b,i,c,x,n,m,q,w,e,r;\n    scanf(\""%d\"" ,&n);\n    scanf(\""%d%d%d\"",&a,&b,&c);\n    i=pow(6,a);\n    r=pow(6,b);\n    e=pow(6,c);\n    x=i%10;\n    w=r%10;\n    q=e%10;\n    printf(\""%d\\n\"",x);\n    printf(\""%d\\n\"",w);\n    printf(\""%d\"",q);\n    return 0;\n}\n",WRONG_ANSWER,6,212
1591069136954920960,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-11 22:03:37,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int i,t,n,a,b;\n    0<=n<=pow10(9);\n    scanf(\""%d\\n\"",&t);\n    scanf(\""%d\"",&n);\n    for(i=0;i<t;i++){\n    a=pow(6,n);\n    b=a%10;\n    printf(\""%d\\n\"",b);}\n    return 0;\n}\n",COMPILE_ERROR,0,0
1591069211428958208,675867a135da6702ed27c0eec3e4b6d2a7d95c44854c01823fc152f0689f010d,2022-11-11 22:03:55,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#define MAX 1000\nint main(void)\n{\n    int n,i,j,c[MAX];\n    int m=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&c[i]);\n    for(i=0;i<n;i++)\n        printf(\""%d\\n\"",6);\n\n    return 0;\n}",WRONG_ANSWER,10,344
1591069331440578560,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 22:04:23,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(){\n  int a[n],b[n],c=0,n,i,j,max=0;\n  scanf(\""%d\"",&n);\n  for(i=0;i<n;i++)\n  {\n      scanf(\""%d\"",&a[i]);\n  }\n   for(i=0;i<n;i++)\n  {\n      scanf(\""%d\"",&b[i]);\n  }\n\nfor(j=0;j<n;j++)\n{for(i=j;i<n;++i)\n  {\n     c=c-a[i]+b[i];\n    if(c>max)\n    max=c;\n  }\n\n\n}\n\n  printf(\""%d\"",max);\n}\n",COMPILE_ERROR,0,0
1591069440941293568,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-11 22:04:50,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int i,t,n,a,b;\n    0<=n<=pow10(9);\n    scanf(\""%d\\n\"",&t);\n    scanf(\""%d\"",&n);\n    for(i=0;i<t;i++){\n    a=pow(6,n);\n    b=a%10;\n    printf(\""%d\\n\"",b);\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1591069450235871232,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-11 22:04:52,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int i,t,n,a,b;\n    0<=n<=pow10(9);\n    scanf(\""%d\\n\"",&t);\n    scanf(\""%d\"",&n);\n    for(i=0;i<t;i++){\n    a=pow(6,n);\n    b=a%10;\n    printf(\""%d\\n\"",b);\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1591069473178718208,20033d4bfe54ea16777c218f33d3af83aed121eb1b058daa8e84687ea80be80b,2022-11-11 22:04:57,Python,300.0,1590524835191705600,1572865591226855424,1049226928954454016,list=input().split()\nnum=int(list[0])+int(list[1])-int(list[2])\nprint(num),ACCEPTED,31,2892
1591069479415648256,65b63200c323c6ac4592306f5b943e39af48faf1b19b89cb7079428c6300e115,2022-11-11 22:04:59,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,t,a,b,i;\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++){\n        scanf(\""%d\"",&n);\n        a=pow(6,n);\n        b=a%10;\n        printf(\""%d\"",b);\n    }\n    return 0;\n    \n}",WRONG_ANSWER,6,196
1591069491172278272,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 22:05:01,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(){\n  int c=0,n,i,j,max=0;\n  scanf(\""%d\"",&n);\n  int a[n],b[n];\n  for(i=0;i<n;i++)\n  {\n      scanf(\""%d\"",&a[i]);\n  }\n   for(i=0;i<n;i++)\n  {\n      scanf(\""%d\"",&b[i]);\n  }\n\nfor(j=0;j<n;j++)\n{for(i=j;i<n;++i)\n  {\n     c=c-a[i]+b[i];\n    if(c>max)\n    max=c;\n  }\n\n\n}\n\n  printf(\""%d\"",max);\n}\n",WRONG_ANSWER,4,324
1591069518678503424,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 22:05:08,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main() {\n\tint i,j,num;\n\tscanf(\""%d\"", &num);\n\tint arr1[num];\n\tfor(i = 0; i < num; ++i) \n\t\tscanf(\""%d\"", &arr1[i]);\n\tint arr2[num];\n\tfor(i = 0; i < num; ++i) \n\t\tscanf(\""%d\"", &arr2[i]);\n\tint max = 0;\n\tfor(j =0; j < num; j++) {\n\t\tint t = 0;\n\t\tfor(i = j; i < num; ++i) {\n\t\t\tt = t - arr1[i] + arr2[i];\n\t\t\tif(t > max) {\n\t\t\t\tmax = t;\n\t\t\t}\n\t\t}\n\t} \n\tprintf(\""%d\"", max);\t\n}",ACCEPTED,4,324
1591069611242598400,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 22:05:30,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t,i;\n    scanf(\""%d\"",&t);\n    int a[t];\n    if(n<=1000000000)\n    {for(i=0;i<t;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<t;i++)\n    {if(a[i]<1)\n    printf(\""1\\n\"");\n    else   \n    printf(\""6\\n\"");\n   }}\n    return 0;\n}",COMPILE_ERROR,0,0
1591069638606262272,cf568c7ddc8b221335f880bfbaac4634294e65481e738a2e032c1ab9a84d576f,2022-11-11 22:05:37,Java,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"import java.io.*;  //引入java的IO包\nimport java.util.Scanner;\nclass Main{\n    public static void main(String[] args){\n        int n,i,j;\n        int y=0;\n        Scanner sc=new Scanner(System.in);\n        n=sc.nextInt();\n        int[]a=new int[n];\n        int[]b=new int[n];\n        int[]c=new int[n];\n        for(i=0;i<n;i++){\n            a[i]=sc.nextInt();\n        }\n        for(i=0;i<n;i++){\n            b[i]=sc.nextInt();\n        }\n        for(i=0;i<n;i++){\n            c[i]=a[i]-b[i];\n        }\n        for(i=0;i<n;i++){\n            for(j=0;j<n;j++){\n                y+=c[j];\n                if(y<0){\n                    y=0;\n                }\n\n            }\n        }\n        System.out.println(y);\n    }\n}",WRONG_ANSWER,122,19188
1591069651835097088,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-11 22:05:40,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int i,t,n,a,b;\n    0<=n<=pow(10,9);\n    scanf(\""%d\\n\"",&t);\n    scanf(\""%d\"",&n);\n    for(i=0;i<t;i++){\n    a=pow(6,n);\n    b=a%10;\n    printf(\""%d\\n\"",b);\n    }\n    return 0;\n}\n",WRONG_ANSWER,7,312
1591069661360361472,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-11 22:05:42,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"int main()\n\nint t,n, i,m,a;\n\nscanf (\""%d\"", &t) ;\n\nfor (i=0;i<t;i++){\n\nscanf (\""%d\"", &n) ;m=pow(6,n) ;\n\na=m10;\n\nprintf (\""d\\n\"",a) ;}\n\nreturn 0;",COMPILE_ERROR,0,0
1591069676656963584,a57fdafe4877cd9608fc0ac8a5120a47bc60a015785960e61b67b4e66187c2f2,2022-11-11 22:05:46,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int n,b,i=0,c;\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++){\n        scanf(\""%d\"",&b);\n        c=pow(6,b);\n        printf(\""%d\"",c%10);\n       if(n-i!=0)\n           printf(\""\\n\"");\n    }\n    return 0;\n}\n",WRONG_ANSWER,8,316
1591069745279995904,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 22:06:02,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t,i;\n    scanf(\""%d\"",&t);\n    int a[t];\n    if(t<=1000000000)\n    {for(i=0;i<t;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<t;i++)\n    {if(a[i]<1)\n    printf(\""1\\n\"");\n    else   \n    printf(\""6\\n\"");\n   }}\n    return 0;\n}",WRONG_ANSWER,6,348
1591069920870334464,65b63200c323c6ac4592306f5b943e39af48faf1b19b89cb7079428c6300e115,2022-11-11 22:06:44,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,t,a,b,i;\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++){\n        scanf(\""%d\"",&n);\n        a=pow(6,n);\n        b=a%10;\n        printf(\""%d\\n\"",b);\n    }\n    return 0;\n    \n}",WRONG_ANSWER,6,344
1591070043302068224,cf568c7ddc8b221335f880bfbaac4634294e65481e738a2e032c1ab9a84d576f,2022-11-11 22:07:13,Java,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"import java.io.*;  //引入java的IO包\nimport java.util.Scanner;\nclass Main{\n    public static void main(String[] args){\n        int n,i,j;\n        int y=0;\n        Scanner sc=new Scanner(System.in);\n        n=sc.nextInt();\n        int[]a=new int[n];\n        int[]b=new int[n];\n        int[]c=new int[n];\n        for(i=0;i<n;i++){\n            a[i]=sc.nextInt();\n        }\n        for(i=0;i<n;i++){\n            b[i]=sc.nextInt();\n        }\n        for(i=0;i<n;i++){\n            c[i]=a[i]-b[i];\n        }\n        for(i=0;i<n;i++){\n            for(j=0;j<n;j++){\n                y+=c[j];\n                if(y<=0){\n                    y=0;\n                }\n            }\n        }\n        System.out.println(y);\n    }\n}",WRONG_ANSWER,121,16568
1591070101414129664,675867a135da6702ed27c0eec3e4b6d2a7d95c44854c01823fc152f0689f010d,2022-11-11 22:07:27,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    int n,i,j;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&j);\n    for(i=0;i<n;i++)\n        printf(\""%d\\n\"",6);\n\n    return 0;\n}",WRONG_ANSWER,9,364
1591070160146993152,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 22:07:41,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t,i;\n    scanf(\""%d\"",&t);\n    int a[t];\n    if(t<=10000000)\n    {for(i=0;i<t;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<t;i++)\n    {if(a[i]<1)\n    printf(\""1\\n\"");\n    else   \n    printf(\""6\\n\"");\n   }}\n    return 0;\n}",WRONG_ANSWER,6,356
1591070469674020864,038e42376e9858a5a0d1826a17de3e149da6c7deb129501295633acdb2780aff,2022-11-11 22:08:55,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n int n;\n int i;\n scanf(\""%d\"",&n);\n int a[n],b[n];\n for(i=0;i<n;i++)\n {\n\n     if(i==0)\n\n\n        scanf(\""%d\"",&a[i]);\n     else\n        scanf(\""%d\"",&a[i]);\n\n\n        }\n\n\n\n    for(i=0;i<n;i++)\n    {\n        if(i==0)\n    {\n\n\n\n        if(a[i]==0)\n            printf(\""1\"");\n        else\n            printf(\""6\"");\n    }\n    else\n    {\n        if(a[i]==0)\n            printf(\""\\n1\"");\n        else\n            printf(\""\\n6\"");\n\n    }\n}\n\n\n\n\n\n    return 0;\n}",ACCEPTED,13,344
1591070487441092608,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-11 22:08:59,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int i,t,n,a,b;\n    0<n<=pow(10,9);\n    scanf(\""%d\\n\"",&t);\n    scanf(\""%d\"",&n);\n    for(i=0;i<t;i++){\n    a=pow(6,n);\n    b=a%10;\n    printf(\""%d\\n\"",b);\n    }\n    return 0;\n}\n",WRONG_ANSWER,8,356
1591070500594429952,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-11 22:09:02,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"int main()\nint t,n, i,m,a;\nscanf (\""%d\"", &t) ;\nfor (i=0;i<t;i++){\nscanf (\""%d\"", &n) ;\n    m=pow(6,n) ;\na=m10;\nprintf (\""d\\n\"",a);}\nreturn 0;",COMPILE_ERROR,0,0
1591070556332535808,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-11 22:09:15,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n   int a,b,i,c,x,n,m,q,w,e,r;\n    scanf(\""%d\"" ,&n);\n    scanf(\""%d%d%d\"",&a,&b,&c);\n    i=pow(6,a);\n    r=pow(6,b);\n    e=pow(6,c);\n    x=i%10;\n    w=r%10;\n    q=e%10;\n    printf(\""%d\\n\"",x);\n    printf(\""%d\\n\"",w);\n    printf(\""%d\"",q);\n    return 0;\n}\n",WRONG_ANSWER,4,564
1591070598195904512,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-11 22:09:25,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"   #include <stdio.h>\n   #include <math.h>\n   int main(){\n      int n,x;\n      scanf(\""%d\"",&n);\n      while(n--){\n            scanf(\""%d\"",&x);\n            int t=x%4;\n            if(x%4==0) t=4;\n            x%=10;\n          printf(\""%d \"",(int)pow(6,t)%10);\n      }\n      return 0;\n   }\n",WRONG_ANSWER,8,356
1591070647550283776,62c83306b4f5c482e4e9a52dc69ae0b8ee7b5238abb34e56352843a0d484ff2c,2022-11-11 22:09:37,Python,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"X,Y,Z=map(int,input().split())\nprint(X+Y-Z)",ACCEPTED,33,2892
1591070823509700608,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-11 22:10:19,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int i,t,n,a,b;\n    0<=n<=pow(10,9);\n    scanf(\""%d\\n\"",&t);\n    scanf(\""%d\"",&n);\n    for(i=0;i<t;i++){\n    a=pow(6,n);\n    b=a%10;\n    printf(\""%d\\n\"",b);\n    }\n    return 0;\n}\n",WRONG_ANSWER,7,324
1591070902786265088,a57fdafe4877cd9608fc0ac8a5120a47bc60a015785960e61b67b4e66187c2f2,2022-11-11 22:10:38,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int n,b,i=0,;\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++){\n        scanf(\""%d\"",&b);\n        printf(\""6\"");\n       if(n-i!=0)\n           printf(\""\\n\"");\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1591070903952277504,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-11 22:10:38,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int i,t,n,a,b;\n    0<=n<=pow(10,9);\n    scanf(\""%d\"",&t);\n    scanf(\""%d\"",&n);\n    for(i=0;i<t;i++){\n    a=pow(6,n);\n    b=a%10;\n    printf(\""%d\\n\"",b);\n    }\n    return 0;\n}\n",WRONG_ANSWER,6,328
1591071032558030848,4e97dffad9953b68d5edd2be07bfc6fdc17c63c845c8ee056e07353c9a386309,2022-11-11 22:11:09,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main(){\n    int n,i,j;\n    int x=0,y=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n        c[i]=b[i]-a[i];\n    for(i=0;i<n;i++){\n        for(j=i;j<n;j++){\n            y+=c[j];\n            if(y>x)\n                x=y;\n        }\n    }\n    printf(\""%d\"",x);\n}\n",WRONG_ANSWER,2,188
1591071164833792000,f55f4c0e0e3367434e26a462e3665271f5b4141ea3de4f34d96fdb21d67e2a7c,2022-11-11 22:11:41,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,w,m;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d \"",&i);\n        w=pow(6,i);\n        m=w%10;\n    };\n\n    for(i=0;i<n;i++)\n\n    printf(\""%d\\n\"",m);\n\n\n    return 0;\n}\n",WRONG_ANSWER,6,352
1591071195955507200,abe2744e33bb397ffb9bb13afcb202f611378fb4fc5801202f03933298ce5f5d,2022-11-11 22:11:48,Java,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n    public static void main(String[] args) throws IOException {\n\n        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n        int n = Integer.valueOf(reader.readLine());\n        int max=0;\n        int now=0;\n\n        String[] lost = reader.readLine().split(\"" \"");\n\n        String[] gain = reader.readLine().split(\"" \"");\n\n        int los=0;\n        int gai=0;\n        for(int i=0;i<n;i++) {\n\n            los=Integer.valueOf(lost[i]);\n            gai=Integer.valueOf(gain[i]);\n\n            if((now+gai-los)>=max) {\n                now+=gai-los;\n                max+=gai-los;\n            }\n            else {\n                now=0;\n            }\n\n\n\n        }\n        System.out.println(max);\n    }\n\n\n}\n",WRONG_ANSWER,76,13704
1591071232114601984,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-11 22:11:57,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int i,t,n,a,b;\n    0<=n<=pow(10,9);\n    scanf(\""%d\"",&t);\n    scanf(\""%d\"",&n);\n    for(i=0;i<t;i++){\n    a=pow(6,n);\n    b=a%10;\n    printf(\""%d\\n\"",b);\n    }\n    return 0;\n}\n",WRONG_ANSWER,6,204
1591071274674225152,aa0e227662691639471f7b18bc3d5c6aa34fdabcef6d52266691b6fbe7e8d245,2022-11-11 22:12:07,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n       int sum=0;\n\t\t\tScanner in=new Scanner(System.in);\n\t        int n=in.nextInt();\n\t        if(n>=2&&n<=100000) {\n\t        \tfor(int i=2;i<=n;i++){\n\t\t            for (int j=2;j<=i;j++){\n\t\t                if(i%j==0 && j!=i){\n\t\t                    break;\n\t\t                }\n\t\t                if (i==j){\n\t\t                \tsum++;\n\t\t                   \n\t\t                }\n\t\t            }\n\t\t        }\n\t\t        System.out.print(sum);\n\t        }else {\n\t        \treturn;\n\t        }\n\t        \n\t        }\n\t},TIME_LIMIT_EXCEEDED,1000,16820
1591071352038162432,aa0e227662691639471f7b18bc3d5c6aa34fdabcef6d52266691b6fbe7e8d245,2022-11-11 22:12:25,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n       int sum=0;\n\t\t\tScanner in=new Scanner(System.in);\n\t        int n=in.nextInt();\n\t        if(n>=2&&n<=10000) {\n\t        \tfor(int i=2;i<=n;i++){\n\t\t            for (int j=2;j<=i;j++){\n\t\t                if(i%j==0 && j!=i){\n\t\t                    break;\n\t\t                }\n\t\t                if (i==j){\n\t\t                \tsum++;\n\t\t                   \n\t\t                }\n\t\t            }\n\t\t        }\n\t\t        System.out.print(sum);\n\t        }else {\n\t        \treturn;\n\t        }\n\t        \n\t        }\n\t},WRONG_ANSWER,133,16392
1591071358925213696,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-11 22:12:27,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n#define MAX 100\nint main(void){\n\tint t,n[MAX],i,sum;\n\tscanf(\""%d\\n\"",&t);\n    for(i=0;i<t;i++){\n        scanf(\""%d\"",&n[i]);\n    }\n\tfor(i=0;i<t;i++){\n\t\tsum=pow(6,n[i]);\n        sum=sum%10;\n\t\tprintf(\""%d\\n\"",sum);\n\t}\n    return 0;\n}",WRONG_ANSWER,8,448
1591071438013005824,aa0e227662691639471f7b18bc3d5c6aa34fdabcef6d52266691b6fbe7e8d245,2022-11-11 22:12:46,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n       int sum=0;\n\t\t\tScanner in=new Scanner(System.in);\n\t        int n=in.nextInt();\n\t        if(n>=2&&n<=100000) {\n\t        \tfor(int i=2;i<=n;i++){\n\t\t            for (int j=2;j<=i;j++){\n\t\t                if(i%j==0 && j!=i){\n\t\t                    break;\n\t\t                }\n\t\t                if (i==j){\n\t\t                \tsum++;\n\t\t                   \n\t\t                }\n\t\t            }\n\t\t        }\n\t\t        System.out.print(sum);\n\t        }else {\n\t        \treturn;\n\t        }\n\t        \n\t        }\n\t},TIME_LIMIT_EXCEEDED,1000,20448
1591071486012624896,f55f4c0e0e3367434e26a462e3665271f5b4141ea3de4f34d96fdb21d67e2a7c,2022-11-11 22:12:57,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,w,m;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d \"",&i);\n        w=pow(6,i);\n        m=w%10;\n    };\n\n    for(i=0;i<n;i++)\n\n    printf(\""%d\\n\"",m);\n\n\n    return 0;\n}\n",WRONG_ANSWER,7,376
1591071530359001088,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-11 22:13:08,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int i,t,n,a,b;\n    0<=n<=pow10(9);\n    scanf(\""%d\"",&t);\n    scanf(\""%d\"",&n);\n    for(i=0;i<t;i++){\n    a=pow(6,n);\n    b=a%10;\n    printf(\""%d\\n\"",b);\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1591071543898210304,a57fdafe4877cd9608fc0ac8a5120a47bc60a015785960e61b67b4e66187c2f2,2022-11-11 22:13:11,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int n,b,i=0;\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++){\n        scanf(\""%d\"",&b);\n\n        if(b)\n            printf(\""6\"");\n        else\n            printf(\""1\"");\n       if(n-i!=0)\n           printf(\""\\n\"");\n    }\n    return 0;\n}\n",ACCEPTED,10,364
1591071625448042496,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-11 22:13:30,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int i,t,n,a,b;\n    0<=n<=pow10(9);\n    scanf(\""%d\"",&t);\n    scanf(\""%d \"",&n);\n    for(i=0;i<t;i++){\n    a=pow(6,n);\n    b=a%10;\n    printf(\""%d\\n\"",b);\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1591071799171944448,f55f4c0e0e3367434e26a462e3665271f5b4141ea3de4f34d96fdb21d67e2a7c,2022-11-11 22:14:12,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,w,m;\n    if(i!=0){\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d \"",&i);\n        w=pow(6,i);\n        m=w%10;\n    };\n\n    for(i=0;i<n;i++)\n\n    printf(\""%d\\n\"",m);\n\n    };\n    return 0;\n}\n",WRONG_ANSWER,7,308
1591071854645809152,675867a135da6702ed27c0eec3e4b6d2a7d95c44854c01823fc152f0689f010d,2022-11-11 22:14:25,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#define MAX 100\nint main(void)\n{\n    int n,i,j,c[MAX];\n    int m=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&c[i]);\n\n    for(i=0;i<n;i++)\n    {\n        if(c[i]==0) {\n            printf(\""%d\\n\"", 1);\n            i++;\n        }\n        printf(\""%d\\n\"",6);\n\n    }\n\n\n    return 0;\n}",ACCEPTED,9,196
1591072026104758272,aa0e227662691639471f7b18bc3d5c6aa34fdabcef6d52266691b6fbe7e8d245,2022-11-11 22:15:06,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,package hello;\n\nimport java.util.Scanner;\n\npublic class one {\n\tpublic static void main(String[] args) throws Exception{\n\t\tScanner in = new Scanner(System.in);\n        \n        long a = in.nextLong();\n         long[] b=new long[(int) a];\n        for(int i=0;i<a;i++){\n            \n            b[i] = in.nextInt();\n            if(b[i]==0){\n                System.out.println(1);\n            }if(b[i]>0&&b[i]<=100000){\n                 System.out.println(6);\n            }\n        }\n    \n     \n    }\n}\n\t\n,COMPILE_ERROR,0,0
1591072114176757760,aa0e227662691639471f7b18bc3d5c6aa34fdabcef6d52266691b6fbe7e8d245,2022-11-11 22:15:27,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main{\n\tpublic static void main(String[] args) throws Exception{\n\t\tScanner in = new Scanner(System.in);\n        \n        long a = in.nextLong();\n         long[] b=new long[(int) a];\n        for(int i=0;i<a;i++){\n            \n            b[i] = in.nextInt();\n            if(b[i]==0){\n                System.out.println(1);\n            }if(b[i]>0&&b[i]<=100000){\n                 System.out.println(6);\n            }\n        }\n    \n     \n    }\n}\n\t\n,NON_ZERO_EXIT_CODE,257,16680
1591072162436415488,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 22:15:38,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n \nint main()\n{\n\tint  b, n, i, k = 0, f;\n\tscanf(\""%d\"",&b);\n\tfor (n = 2; n <= b; n++) \n{\n\t\tf = 1;\n\t\tfor (i = 2; i <= n; i++)\n\t    if (n % i == 0) {\n\t\t\t\tf = 0;\n\t\t\t\tbreak;\n\t\t                }\n\t\tif (f == 1)\n\t\t\tk++;\n\t\tif (n == b)\n\t\t\tprintf(\""%d\"", k);\n \n}\n \n}\n",WRONG_ANSWER,928,196
1591072208896724992,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 22:15:49,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n \nint main()\n{\n\tint  b, n, i, k = 0, f;\n\tscanf(\""%d\"",&b);\n\tfor (n = 2; n <= b; n++) \n{\n\t\tf = 1;\n\t\tfor (i = 2; i <= sqrt(n); i++)\n\t    if (n % i == 0) {\n\t\t\t\tf = 0;\n\t\t\t\tbreak;\n\t\t                }\n\t\tif (f == 1)\n\t\t\tk++;\n\t\tif (n == b)\n\t\t\tprintf(\""%d\"", k);\n \n}\n \n}\n",ACCEPTED,15,328
1591072259861712896,20033d4bfe54ea16777c218f33d3af83aed121eb1b058daa8e84687ea80be80b,2022-11-11 22:16:02,Python,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"n=int(input())\nlist=input().split()\nfor i in list :\n    if i==\""0\"" :\n        print(\""1\"")\n    else :\n        print(\""6\"")",ACCEPTED,48,2872
1591072344632786944,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-11 22:16:22,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int i,t,n,a,b;\n    scanf(\""%d\"",&t);\n    scanf(\""%d \"",&n);\n    if( 0<=n<=pow10(9)){\n    for(i=0;i<t;i++){\n    a=pow(6,n);\n    b=a%10;\n    printf(\""%d\\n\"",b);\n    }\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1591072419211706368,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-11 22:16:40,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main(){\n    int i,j,k,n;\n    k=2;\n    scanf(\""%d\"",&n);\n    for(i=5;i<n;i+=2){\n        for(j=2;j*j<=i;j++)\n            if(i%j==0)\n                break;\n        if(j*j>i)\n            k++;\n    }\n    printf(\""%d\"",k);\n}",ACCEPTED,15,348
1591072468255707136,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-11 22:16:51,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"   #include <stdio.h>\n   #include <math.h>\n   int main(){\n      int n,x;\n      scanf(\""%d\"",&n);\n      while(n--){\n            scanf(\""%d\"",&x);\n            int t=x%4;\n            if(x%4==0) t=4;\n            x%=10;\n          printf(\""%d\\n\"",(int)pow(6,t)%10);\n      }\n      return 0;\n   }\n",WRONG_ANSWER,7,312
1591072484483465216,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-11 22:16:55,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main(){\n    int i,j,k,n;\n    k=2;\n    scanf(\""%d\"",&n);\n    for(i=5;i<n;i+=2){\n        for(j=2;j*j<=i;j++)\n            if(i%j==0)\n                break;\n        if(j*j>i)\n            k++;\n    }\n    printf(\""%d\"",k);\n}",WRONG_ANSWER,4,180
1591072516238520320,33bf53cc1ac96b08f54401ab68b14c30e1f5caef149cc9332585b7c5f09675ed,2022-11-11 22:17:03,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint n ,x , start ,end , t=0 , max=0 ,sum=0;\nint main()\n{\n\tint xiao[100000], huo[100000],jue[100000];\n\tscanf( \""%d\"" , & n );\n\tfor ( x = 0 ; x < n ; x++ )\n\t{\n\t\tscanf(\""%d\"", &xiao[x]);\n\t\tprintf(\""%d\\n\"",xiao[x]);\n\t}\n\tfor ( x = 0 ; x < n ; x++ )\n\t{\n\t\tscanf(\""%d\"", &huo[x]);\n\t\tprintf(\""%d\\n\"",huo[x]);\n\t}\n\tfor ( x = 0 ; x < n ; x++ )\n\t{\n\t\tjue[x] = huo[x] - xiao[x];\n\t\tprintf(\""%d\\n\"",jue[x]);\n\t}\n\tfor ( start = 0 ; start < n ; start++ )\n\t{\n\t\tfor ( end = 0 ; end < n ; end++)\n\t\t{\n\t\t\tfor( t = start ; t <= end ; t++)\n\t\t\t{\n\t\t\t\tsum = sum + jue[t];\n\t\t\t}\n\t\t\tif( sum > max )\n\t\t\t{\n\t\t\t\tmax = sum;\n\t\t\t}\n\t\t\tsum = 0 ;\n\t\t}\n\t}\n\tprintf( \""%d\"" , max );\n}",WRONG_ANSWER,3,192
1591072542008344576,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-11 22:17:09,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n,i,j;\n    int x=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n        c[i]=b[i]-a[i];\n    for(i=0;i<n;i++){\n        int y=0;\n        for(j=i;j<n;j++){\n            y+=c[j];\n            if(y>x)\n                x=y;\n        }\n    }\n    printf(\""%d\\n\"",x);\n}",ACCEPTED,3,312
1591072615777763328,f55f4c0e0e3367434e26a462e3665271f5b4141ea3de4f34d96fdb21d67e2a7c,2022-11-11 22:17:26,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,w,m;\n    if(i!=0){\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d \"",&i);\n        w=pow(6,i);\n        m=w%10;\n    };\n\n    for(i=0;i<n;i++)\n\n    printf(\""%d\\n\"",m);\n\n    };\n    return 0;\n}\n",WRONG_ANSWER,8,480
1591072706618003456,aa0e227662691639471f7b18bc3d5c6aa34fdabcef6d52266691b6fbe7e8d245,2022-11-11 22:17:48,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main{\n\tpublic static void main(String[] args) throws Exception{\n\t\tScanner in = new Scanner(System.in);\n        \n        long a = in.nextLong();\n         long[] b=new long[(int) a];\n        for(int i=0;i<a;i++){\n            \n            b[i] = in.nextLong();\n            if(b[i]==0){\n                System.out.println(1);\n            }if(b[i]>0&&b[i]<=100000){\n                 System.out.println(6);\n            }\n        }\n    \n     \n    }\n}\n\t\n\t\n,WRONG_ANSWER,253,18796
1591072713001730048,c39a4349139942a7aa7456b2c4609f8d0f9d0d3465be213d33870ec87eab1e58,2022-11-11 22:17:50,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    int a=2022;\n    printf(\""%d\"",a);\n    return 0;\n}",ACCEPTED,4,192
1591072737114783744,33bf53cc1ac96b08f54401ab68b14c30e1f5caef149cc9332585b7c5f09675ed,2022-11-11 22:17:55,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint n ,x , start ,end , t=0 , max=0 ,sum=0;\nint main()\n{\n\tint xiao[100000], huo[100000],jue[100000];\n\tscanf( \""%d\"" , & n );\n\tfor ( x = 0 ; x < n ; x++ )\n\t{\n\t\tscanf(\""%d\"", &xiao[x]);\n\t\t//printf(\""%d\\n\"",xiao[x]);\n\t}\n\tfor ( x = 0 ; x < n ; x++ )\n\t{\n\t\tscanf(\""%d\"", &huo[x]);\n\t\t//printf(\""%d\\n\"",huo[x]);\n\t}\n\tfor ( x = 0 ; x < n ; x++ )\n\t{\n\t\tjue[x] = huo[x] - xiao[x];\n\t\t//printf(\""%d\\n\"",jue[x]);\n\t}\n\tfor ( start = 0 ; start < n ; start++ )\n\t{\n\t\tfor ( end = 0 ; end < n ; end++)\n\t\t{\n\t\t\tfor( t = start ; t <= end ; t++)\n\t\t\t{\n\t\t\t\tsum = sum + jue[t];\n\t\t\t}\n\t\t\tif( sum > max )\n\t\t\t{\n\t\t\t\tmax = sum;\n\t\t\t}\n\t\t\tsum = 0 ;\n\t\t}\n\t}\n\tprintf( \""%d\"" , max );\n}",ACCEPTED,4,348
1591072827028082688,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-11 22:18:17,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int i,t,n,a,b;\n    scanf(\""%d\"",&t);\n    scanf(\""%d \"",&n);\n    if( 0<=n<=pow(10,9)){\n    for(i=0;i<t;i++){\n    a=pow(6,n);\n    b=a%10;\n    printf(\""%d\\n\"",b);\n    }\n    }\n    return 0;\n}\n",WRONG_ANSWER,7,192
1591072827665612800,f55f4c0e0e3367434e26a462e3665271f5b4141ea3de4f34d96fdb21d67e2a7c,2022-11-11 22:18:17,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,w,m;\n    if(i!=0){\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d \"",&i);\n        w=pow(6,i);\n        m=w%10;\n    };\n\n    for(i=0;i<n;i++)\n\n    printf(\""%d\\n\"",m);\n\n    };\n    return 0;\n}\n",WRONG_ANSWER,5,188
1591072833759936512,65b63200c323c6ac4592306f5b943e39af48faf1b19b89cb7079428c6300e115,2022-11-11 22:18:18,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,t,i;\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++){\n        scanf(\""%d\"",&n);\n        if(n!=0)\n            printf(\""6\"");\n        else\n            printf(\""1\"");\n        if(i<t-1);\n        printf(\""\\n\"");\n    }\n    return 0;\n    \n}",ACCEPTED,10,324
1591072897718857728,aa0e227662691639471f7b18bc3d5c6aa34fdabcef6d52266691b6fbe7e8d245,2022-11-11 22:18:34,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main{\n\tpublic static void main(String[] args) throws Exception{\n\t\tScanner in = new Scanner(System.in);\n        \n        long a = in.nextLong();\n         long[] b=new long[(int) a];\n        for(int i=0;i<a;i++){\n            \n            b[i] = in.nextLong();\n            if(b[i]==0){\n                System.out.println(1);\n            }if(b[i]>0&&b[i]<=1000000000){\n                 System.out.println(6);\n            }\n        }\n    \n     \n    }\n}\n\t\n\t\n,WRONG_ANSWER,253,16616
1591073026253324288,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-11 22:19:04,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"\n   #include <stdio.h>\n   #include <math.h>\n   int main(){\n      int n,x[10];\n      scanf(\""%d\"",&n);\n      for(int i=0;i<n;i++){\n            scanf(\""%d\"",&x[i]);\n          printf(\""%d \"",(int)pow(6,x[i])%10);\n      }\n      return 0;\n   }\n",WRONG_ANSWER,8,324
1591073102962950144,1f29a576db974352c60cbe8aafdc4e5328b24d800890ab1c712d8c9fa85d72cc,2022-11-11 22:19:23,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tint i;\n\tfor(i=0;i<n;i++)\n\t{\n\tscanf(\""%d\"",&a[i]);\n\tif(a[i]==0) printf(\""1\"");\n\telse if(a[i]>0) printf(\""6\\n\"");\n    }\n\treturn 0;\n}\n",WRONG_ANSWER,6,196
1591073143555424256,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-11-11 22:19:32,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h> \n#include<math.h>\nint main(){\nint n;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(int i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n    \n    for(int i=0;i<n-1;i++){\n       if(a[i]==0&&i<(n-1)) printf(\""1\\n\"");\n       else printf(\""6\\n\"");\n    }\n    if(a[n-1]==0) printf(\""1\"");\n    else printf(\""6\"");\n\t\n}\n",ACCEPTED,18,324
1591073201214521344,4e97dffad9953b68d5edd2be07bfc6fdc17c63c845c8ee056e07353c9a386309,2022-11-11 22:19:46,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint i,j,a,b;\n\tscanf(\""%d\"",&i);\n\twhile(i>0){\n\t\tscanf(\""%d\"",&a);\n\t\tif(a==0)\n        printf(\""1\\n\"");\n        else\n        printf(\""6\\n\"");\n\t\ti--;\n\t} \n    return 0;\n}\n",ACCEPTED,9,328
1591073228527808512,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-11 22:19:53,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"\n   #include <stdio.h>\n   #include <math.h>\n   int main(){\n      int n,x[10];\n      scanf(\""%d\"",&n);\n      for(int i=0;i<n;i++){\n            scanf(\""%d\"",&x[i]);\n          printf(\""%d\\n\"",(int)pow(6,x[i])%10);\n      }\n      return 0;\n   }\n",WRONG_ANSWER,6,348
1591073244189339648,f82deaa53e46d9c7d5d5356ccc521eebc53bb96810af77c6a4f43c3a56690222,2022-11-11 22:19:56,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint i,j,a,b;\n\tscanf(\""%d\"",&i);\n\twhile(i>0){\n\t\tscanf(\""%d\"",&a);\n\t\tif(a==0)\n        printf(\""1\\n\"");\n        else\n        printf(\""6\\n\"");\n\t\ti--;\n\t} \n    return 0;\n}",ACCEPTED,11,336
1591073319246409728,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-11-11 22:20:14,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\nint n,i,j,m=0,x=0,y;\nscanf(\""%d\"",&n);\nint a[n],b[n],c[n];\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&a[i]);\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&b[i]);\nfor(i=0;i<n;i++)\n    c[i]=b[i]-a[i];\nfor(i=0;i<n;i++){\n    for(j=0;j<n;j++)\n    {\n        m=m+c[j];\n        if(m>x)\n            x=m;\n        if(m<0)\n            m=0;\n        y=x;\n    }\n}\nprintf(\""%d\\n\"",y);\nreturn 0;\n}\n",WRONG_ANSWER,3,184
1591073423214837760,42cfad7191c5e6c0eee156c4369182744d6c5db3bc2a5dc87f9f1be6ee4bbcfe,2022-11-11 22:20:39,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n\tint t;\n\tint n;\n\tscanf(\""%d\"",&t);\n\tint i;\n\tfor(i=0;i<t;i++){\n\t\tscanf(\""%d\"",&n);\n       if(n==0)\n           printf(\""%d\\n\"",1);\n           else printf(\""%d\\n\"",6);\n}\t\n    return 0;\n}",ACCEPTED,9,348
1591073535425052672,cf568c7ddc8b221335f880bfbaac4634294e65481e738a2e032c1ab9a84d576f,2022-11-11 22:21:06,Java,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"import java.io.*;  //引入java的IO包\nimport java.util.Scanner;\nclass Main{\n    public static void main(String[] args){\n        int n,i;\n        Scanner sc=new Scanner(System.in);\n        n=sc.nextInt();\n        int[]a=new int[n];\n        int[]b=new int[n];\n        int[]c=new int[n];\n        for(i=0;i<n;i++){\n            a[i]=sc.nextInt();\n        }\n        for(i=0;i<n;i++){\n            b[i]=sc.nextInt();\n        }\n        for(i=0;i<n;i++){\n            c[i]=a[i]-b[i];\n        }\n      int temp=c[0];\n        int ma=c[0];\n        for( i=1;i<n;i++) {\n            if(c[i]>=0) {\n                \n                if(temp<0) \n                {\n                    temp=c[i];\n                    ma=temp;\n                }\n                else {\n                    temp+=c[i];\n                    ma=temp;\n                }\n            }\n            else {\n                temp+=c[i];\n            }\n        }\n        System.out.print(ma);\n    }\n}",WRONG_ANSWER,122,19068
1591073622276509696,aa0e227662691639471f7b18bc3d5c6aa34fdabcef6d52266691b6fbe7e8d245,2022-11-11 22:21:26,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n       int sum=0;\n\t\t\tScanner in=new Scanner(System.in);\n\t        int n=in.nextInt();\n\t        if(n>=2&&n<=99999) {\n\t        \tfor(int i=2;i<=n;i++){\n\t\t            for (int j=2;j<=i;j++){\n\t\t                if(i%j==0 && j!=i){\n\t\t                    break;\n\t\t                }\n\t\t                if (i==j){\n\t\t                \tsum++;\n\t\t                   \n\t\t                }\n\t\t            }\n\t\t        }\n\t\t        System.out.print(sum);\n\t        }else {\n\t        \treturn;\n\t        }\n\t        \n\t        }\n\t},TIME_LIMIT_EXCEEDED,1000,16040
1591073627309670400,f55f4c0e0e3367434e26a462e3665271f5b4141ea3de4f34d96fdb21d67e2a7c,2022-11-11 22:21:28,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,w,m;\n    0<=n<=pow(10,9);\n    if(i!=0){\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d \"",&i);\n        w=pow(6,i);\n        m=w%10;\n    };\n\n    for(i=0;i<n;i++)\n    {\n    printf(\""%d\\n\"",m);\n\n    };\n    return 0;\n}}\n",WRONG_ANSWER,6,352
1591073679709114368,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-11-11 22:21:40,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n    int i,j,n;\n    int a=0,b=0;\n    scanf(\""%d\"",&n);\n    if(n==2)\n        printf(\""1\\n\"");\n    else if(n>2)\n    {\n        for(i=2;i<=n;i++)\n        {\n            for(j=2;j<=i;j++)\n            {\n                if(i%j==0)\n                    a++;\n            }\n            if(a==1)\n            {\n                b++;\n                a=0;\n            }\n            else\n                a=0;\n        }\n    }\n    printf(\""%d\\n\"",b);\n    return 0;\n}",TIME_LIMIT_EXCEEDED,1000,320
1591073726869868544,1f29a576db974352c60cbe8aafdc4e5328b24d800890ab1c712d8c9fa85d72cc,2022-11-11 22:21:51,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tint i;\n\tfor(i=0;i<n;i++)\n\t{\n\tscanf(\""%d\"",&a[i]);\n\tif(a[i]==0) printf(\""1\"");\n\telse if(a[i]>0) printf(\""6\\n\"");\n    }\n\treturn 0;\n}\n",WRONG_ANSWER,6,344
1591073743340900352,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 22:21:55,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int n,i,j,k,c=0;\n    scanf(\""%d\"",&n);\n    if(n<=100000)\n    {for(i=2;i<=n;i++)\n    { k=0;\n        for(j=2;j<=n;j++)\n            \n        if(i%j==0)\n        {k++;\n        if(k>1)break;}\n        if(k<2&&k>0)\n            c++;}\n    printf(\""%d\"",c);}\n    return 0;\n    \n}\n",TIME_LIMIT_EXCEEDED,1000,432
1591073778749210624,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-11-11 22:22:04,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n    int i,j,n;\n    int a=0,b=0;\n    scanf(\""%d\"",&n);\n        for(i=2;i<=n;i++)\n        {\n            for(j=2;j<=i;j++)\n            {\n                if(i%j==0)\n                    a++;\n            }\n            if(a==1)\n            {\n                b++;\n                a=0;\n            }\n            else\n                a=0;\n        }\n    printf(\""%d\\n\"",b);\n    return 0;\n}",TIME_LIMIT_EXCEEDED,1000,412
1591073797267062784,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 22:22:08,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int n,i,j,k,c=0;\n    scanf(\""%d\"",&n);\n    if(n<=1000)\n    {for(i=2;i<=n;i++)\n    { k=0;\n        for(j=2;j<=n;j++)\n            \n        if(i%j==0)\n        {k++;\n        if(k>1)break;}\n        if(k<2&&k>0)\n            c++;}\n    printf(\""%d\"",c);}\n    return 0;\n    \n}\n",WRONG_ANSWER,3,308
1591073797451616256,fbea21dbaf89f1b064feaa20227f21c5e1c4888fdc371cf5e43f70615906e52a,2022-11-11 22:22:08,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"n=int(input())\nnum=list(map(int,input().split()))\nprint(6)",WRONG_ANSWER,17,3036
1591073808868507648,c39a4349139942a7aa7456b2c4609f8d0f9d0d3465be213d33870ec87eab1e58,2022-11-11 22:22:11,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n     int X,Y,Z;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    printf(\""%d\"",X+Y-Z);\n}\n   ",ACCEPTED,8,468
1591073860458446848,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 22:22:23,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int n,i,j,k,c=0;\n    scanf(\""%d\"",&n);\n    if(n<=10000)\n    {for(i=2;i<=n;i++)\n    { k=0;\n        for(j=2;j<=n;j++)\n            \n        if(i%j==0)\n        {k++;\n        if(k>1)break;}\n        if(k<2&&k>0)\n            c++;}\n    printf(\""%d\"",c);}\n    return 0;\n    \n}\n",WRONG_ANSWER,3,188
1591073908013465600,aa0e227662691639471f7b18bc3d5c6aa34fdabcef6d52266691b6fbe7e8d245,2022-11-11 22:22:35,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n       int sum=0;\n\t\t\tScanner in=new Scanner(System.in);\n\t        int n=in.nextInt();\n\t        if(n>=2&&n<=100000) {\n\t        \tfor(int i=2;i<=n;i++){\n\t\t            for (int j=2;j<=i;j++){\n\t\t                if(i%j==0 && j!=i){\n\t\t                    break;\n\t\t                }\n\t\t                if (i==j){\n\t\t                \tsum++;\n\t\t                   \n\t\t                }\n\t\t            }\n\t\t        }\n\t\t        System.out.println(sum);\n\t        }else {\n\t        \treturn;\n\t        }\n\t        \n\t        }\n\t},TIME_LIMIT_EXCEEDED,1000,18704
1591073961738309632,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 22:22:47,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int n,i,j,k,c=0;\n    scanf(\""%d\"",&n);\n    if(n<100000)\n    {for(i=2;i<=n;i++)\n    { k=0;\n        for(j=2;j<=n;j++)\n            \n        if(i%j==0)\n        {k++;\n        if(k>1)break;}\n        if(k<2&&k>0)\n            c++;}\n    printf(\""%d\"",c);}\n    return 0;\n    \n}\n",TIME_LIMIT_EXCEEDED,1000,440
1591073970655399936,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-11 22:22:49,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"\n   #include <stdio.h>\n   #include <math.h>\n   int main(){\n      int n,x[10000000000];\n      scanf(\""%d\"",&n);\n      for(int i=0;i<n;i++){\n            scanf(\""%d\"",&x[i]);\n          printf(\""%d\\n\"",(int)pow(6,x[i])%10);\n      }\n      return 0;\n   }\n",TIME_LIMIT_EXCEEDED,3,452
1591074018675986432,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-11 22:23:01,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"\n   #include <stdio.h>\n   #include <math.h>\n   int main(){\n      int n,x[100];\n      scanf(\""%d\"",&n);\n      for(int i=0;i<n;i++){\n            scanf(\""%d\"",&x[i]);\n          printf(\""%d\\n\"",(int)pow(6,x[i])%10);\n      }\n      return 0;\n   }\n",WRONG_ANSWER,10,476
1591074079447232512,fbea21dbaf89f1b064feaa20227f21c5e1c4888fdc371cf5e43f70615906e52a,2022-11-11 22:23:15,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,print(6),WRONG_ANSWER,16,2748
1591074124083036160,e7f8e9ba366feb4551b7dc8e6a149f796e822980a43de4fcc91ded552c4bcbd4,2022-11-11 22:23:26,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n \nint main ( )\n{\n    int n,i=2,j,S=0;\n    scanf(\""%d\"",&n);\n    if(n<=1){\n        printf(\""%d\"",S);\n        return 0;\n    }\n    int m;\n    for( i=2;i<=n;i++){\n        m=i;\n        for (j = 2;j*1.0 < m*1.0/2;j++){\n            if(m%j == 0){\n                break;\n            }\n        }\n        \n        if(j*1.0>m*1.0/2){ \n            S++;\n            if(S%10==0){\n                printf(\""\\n\"");\n            }\n        }\n    }\n    if(S%10!=0)\n    printf(\""%d\"",S);\n    \n    return 0;\n}",ACCEPTED,477,484
1591074130391273472,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-11 22:23:28,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"//第五种方法，巧用平方根,写法二：\n#include <stdio.h>\nint main()\n{\n\tint x = 0,i = 0,n,c=1;\n    scanf(\""%d\\n\"",&n);\n\tfor (x = 3; x <=n; x += 2)\n\t{\n\t\tfor (i = 2; i*i<=x; i++)  //控制第二层循环\n\t\t{\n\t\t\tif (x % i == 0)\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (i*i>x)\n\t\t{\n\t\t\tc++;\n\t\t}\n\t}\n\tprintf(\""%d\\n\"",c);\n\treturn 0;\n}\n",ACCEPTED,14,356
1591074146048610304,9aa17e95021225dcdd2b01419b021cd002e47f9a7854274df042f64621bd207a,2022-11-11 22:23:31,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int i,j,n;\n    int x=0,y=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=0;j<n;j++)\n    {\n        scanf(\""%d\"",&b[j]);\n    }\n    for(i=0;i<n;i++)\n    {\n        c[i]=b[i]-a[i];\n    }\n    for(i=0;i<n;i++)\n    {\n        for(j=i;j<n;j++)\n        {\n            y+=c[j];\n            if(y>x)\n            x=y;\n        }\n\n    }\n printf(\""%d\"",x);\n\n\n    return 0;\n}\n",WRONG_ANSWER,4,180
1591074210972217344,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 22:23:47,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int n,i,j,k,c=0;\n    scanf(\""%d\"",&n);\n    if(n<=10000)\n    {for(i=2;i<=n;i++)\n    { k=0;\n        for(j=2;j<=n;j++)\n            \n        if(i%j==0)\n        {k++;\n        if(k>1)break;}\n        if(k<2&&k>0)\n            c++;}\n    printf(\""%d\"",c);}\n    return 0;\n    \n}\n",WRONG_ANSWER,4,308
1591074249035526144,a27ecb139a3fa065feadb903517977dc609a6d218c4e082e7ec449c78806823c,2022-11-11 22:23:56,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\tint  t,i,n;\n\tscanf(\""%d\"",&t);\n\tint a[t];\n\tfor(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<t;i++)\n    {\n    if(a[i]<1)\n        printf(\""1\\n\"");\n    else\n        printf(\""6\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,8,320
1591074308334620672,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 22:24:10,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int n,i,j,k,c=0;\n    scanf(\""%d\"",&n);\n    if(n<=9999)\n    {for(i=2;i<=n;i++)\n    { k=0;\n        for(j=2;j<=n;j++)\n            \n        if(i%j==0)\n        {k++;\n        if(k>1)break;}\n        if(k<2&&k>0)\n            c++;}\n    printf(\""%d\"",c);}\n    return 0;\n    \n}\n",WRONG_ANSWER,3,348
1591074356292268032,9d0546dac18a9dc678295254e547925db086add5f872ef42d8015d525afeaf65,2022-11-11 22:24:21,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#define N 10000\nint main()\n{\n    int num[N],nums[N],t,i,n;\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++){\n        scanf(\""%d\"",&num[i]);\n    }\n    for(i=0;i<t;i++){\n        if(num[i]!=0){\n            printf(\""6\\n\"");\n        }else{\n            return 0;\n        }\n\n    }\n    return 0;\n}\n",WRONG_ANSWER,11,344
1591074477985824768,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 22:24:50,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n \nint main()\n{\n\tint  b, n, i, k = 0, f;\n\tscanf(\""%d\"",&b);\n\tfor (n = 2; n <= b; n++) \n{\n\t\tf = 1;\n\t\tfor (i = 2; i <= sqrt(n); i++)\n\t    if (n % i == 0) {\n\t\t\t\tf = 0;\n\t\t\t\tbreak;\n\t\t                }\n\t\tif (f == 1)\n\t\t\tk++;\n\t\tif (n == b)\n\t\t\tprintf(\""%d\"", k);\n \n}\n \n}\n",ACCEPTED,12,496
1591074619589722112,b8a7ba8e6c41741e66a8153e5f137c86c8dba9c4dbb2f65f35d7554a5b082d56,2022-11-11 22:25:24,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main(){\n    int a,b,c,d;\n    scanf(\""%d\"",&a);\n    for(int i=0;i<a;i++)\n    {\n        scanf(\""%d\"",&b);\n        c=pow(6,b);\n        d=c%10;\n    printf(\""%d\\n\"",d);\n    }\n    return 0;\n}",WRONG_ANSWER,6,332
1591074996385026048,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-11 22:26:54,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"\n#include <stdio.h>\nint main(){\n\n    int n,sum=0,a=0;\n    scanf(\""%d\"",&n);\n   \n    printf(\""168\"");\n}\n",WRONG_ANSWER,3,324
1591075204577669120,02f3cf9a5ba39e00e2644b9392922d3ea3ea233f83c612c7dbd879f319ea2bdc,2022-11-11 22:27:44,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int i,n,a[100],b[100],m,sum=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if(i<5)\n        {\n          m=(b[i]-a[i]);\n          sum=sum+m;\n        }\n    }\n     printf(\""%d\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,4,320
1591075224471273472,9aa17e95021225dcdd2b01419b021cd002e47f9a7854274df042f64621bd207a,2022-11-11 22:27:48,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int i,j,n;\n    int x=0,y=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=0;j<n;j++)\n    {\n        scanf(\""%d\"",&b[j]);\n    }\n    for(i=0;i<n;i++)\n    {\n        c[i]=b[i]-a[i];\n    }\n    for(i=0,y=0;i<n;i++)\n    {\n        for(j=i;j<n;j++)\n        {\n            y+=c[j];\n            if(y>x)\n            x=y;\n        }\n\n    }\n printf(\""%d\"",x);\n\n\n    return 0;\n}\n",WRONG_ANSWER,3,188
1591075282415583232,1f29a576db974352c60cbe8aafdc4e5328b24d800890ab1c712d8c9fa85d72cc,2022-11-11 22:28:02,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint n,m;\n\tscanf(\""%d\"",&n);\n\tint i;\n\tfor(i=0;i<n;i++)\n\t{\n\tscanf(\""%d\"",&m);\n\tif(m==0) printf(\""%d\\n\"",1);\n\telse printf(\""%d\\n\"",6);\n    }\n\treturn 0;\n}\n",ACCEPTED,10,344
1591075302292369408,02f3cf9a5ba39e00e2644b9392922d3ea3ea233f83c612c7dbd879f319ea2bdc,2022-11-11 22:28:07,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int i,n,a[100],b[100],m,sum=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if(i<5)\n        {\n          m=(b[i]-a[i]);\n          sum=sum+m;\n        }\n    }\n     printf(\""%d\\n\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,3,348
1591075412317376512,d5db2853d0fce01dd43b2b6adf379841403b78fda0e6cb22c82f6f2b59da60dc,2022-11-11 22:28:33,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nmain(){\n\tint year;\n\tprintf(\""%d\"",2022);\n\treturn 0;\n} ",ACCEPTED,3,192
1591075441237102592,02f3cf9a5ba39e00e2644b9392922d3ea3ea233f83c612c7dbd879f319ea2bdc,2022-11-11 22:28:40,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int i,n,a[100],b[100],m,sum=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if(b[i]>a[i])\n        {\n          m=(b[i]-a[i]);\n          sum=sum+m;\n        }\n    }\n     printf(\""%d\\n\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,3,320
1591075540189122560,9aa17e95021225dcdd2b01419b021cd002e47f9a7854274df042f64621bd207a,2022-11-11 22:29:04,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int i,j,n;\n    int x=0,y=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=0;j<n;j++)\n    {\n        scanf(\""%d\"",&b[j]);\n    }\n    for(i=0;i<n;i++)\n    {\n        c[i]=b[i]-a[i];\n    }\n    for(i=0;i<n;i++)\n    {\n        for(j=i,y=0;j<n;j++)\n        {\n            y+=c[j];\n            if(y>x)\n            x=y;\n        }\n\n    }\n printf(\""%d\"",x);\n\n\n    return 0;\n}\n",ACCEPTED,3,192
1591075825175302144,65b63200c323c6ac4592306f5b943e39af48faf1b19b89cb7079428c6300e115,2022-11-11 22:30:12,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main(){\n    int i,j,k,n;\n    k=2;\n    scanf(\""%d\"",&n);\n    for(i=5;i<n;i+=2){\n        for(j=2;j*j<=i;j++)\n            if(i%j==0)\n                break;\n        if(j*j>i)\n            k++;\n    }\n    printf(\""%d\"",k);\n}",ACCEPTED,12,316
1591075900534362112,65b63200c323c6ac4592306f5b943e39af48faf1b19b89cb7079428c6300e115,2022-11-11 22:30:30,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n,i,j;\n    int x=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n        c[i]=b[i]-a[i];\n    for(i=0;i<n;i++){\n        int y=0;\n        for(j=i;j<n;j++){\n            y+=c[j];\n            if(y>x)\n                x=y;\n        }\n    }\n    printf(\""%d\\n\"",x);\n}",ACCEPTED,3,380
1591076042247311360,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-11-11 22:31:03,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"\n#include<stdio.h>\n\nint main()\n{\n    int n,i,a;\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++)\n    {\n        scanf(\""%d\"",&a);\n        if(a==0)\n            printf(\""0\\n\"");\n        else\n            printf(\""6\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,11,344
1591076114133463040,a27ecb139a3fa065feadb903517977dc609a6d218c4e082e7ec449c78806823c,2022-11-11 22:31:21,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(int i=0;i<n;i++)\n\t\tscanf(\""%d\"",&a[i]);\n\tif(a[0]==0)\n\t\tprintf(\""1\"");\n\telse printf(\""6\"");\t\n\tfor(int j=1;j<n;j++)\n\t{\n\t\tputchar('\\n');\n\t\tif(a[j]==0)\n\t\tprintf(\""1\"");\n\t\telse printf(\""6\"");\n\t} \t\n\treturn 0;\n}\n",ACCEPTED,9,324
1591076145309724672,99481c5a0804ff1b45cf32a79326675aa759c0780ab1ad0d29f845666cb83208,2022-11-11 22:31:28,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}\n",ACCEPTED,3,312
1591076357034020864,d5db2853d0fce01dd43b2b6adf379841403b78fda0e6cb22c82f6f2b59da60dc,2022-11-11 22:32:18,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nmain(){\n\tint X,Y,Z,s;\n\tprintf(\""输入三个整数X,Y,Z：\"");\n\tscanf(\""%d %d %d\"",X,Y,Z);\n\ts=X+Y-Z;\n\tprintf(\""%d\"",s);\n\treturn 0;\n} ",SEGMENTATION_FAULT,4,444
1591076508431593472,f55f4c0e0e3367434e26a462e3665271f5b4141ea3de4f34d96fdb21d67e2a7c,2022-11-11 22:32:55,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,w,m,j;\n    0<=n<=pow(10,9);\n    if(i!=0){\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d \"",&i);\n        for(j=0;j<n;j++){\n        w=pow(6,i);\n        m=w%10;\n         printf(\""%d\\n\"",m);\n        }\n\n    }\n\n\n\n\n    return 0;\n}}\n",WRONG_ANSWER,3,348
1591076598470742016,02f3cf9a5ba39e00e2644b9392922d3ea3ea233f83c612c7dbd879f319ea2bdc,2022-11-11 22:33:16,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int i,n,a[100],b[100],m,sum=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if(i<5)\n        {\n          m=(b[i]-a[i]);\n          sum=sum+m;\n          m=0;\n        }\n    }\n     printf(\""%d\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,3,192
1591076667269885952,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-11 22:33:32,C++,0.0,1590528927448293376,1590525945717575680,1049226928954454016,#include<bits/stdc++.h>\nusing namespce std;\ntypedef long long ll;\nint main(){\n    cout<<2022<<endl;\nreturn 0;\n},COMPILE_ERROR,0,0
1591076684881793024,d5db2853d0fce01dd43b2b6adf379841403b78fda0e6cb22c82f6f2b59da60dc,2022-11-11 22:33:37,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nmain(){\n\tint X,Y,Z,s;\n\tprintf(\""输入三个整数X,Y,Z：\"");\n\tscanf(\""%d %d %d\"",X,Y,Z);\n\tif(X>=0&&X<=100&&Y>=0&&Y<=100&&Z>=0&&Z<=100){\n\ts=X+Y-Z;\n\tprintf(\""%d\"",s);\n\t}\n\treturn 0;\n} ",SEGMENTATION_FAULT,3,444
1591076725801418752,d5db2853d0fce01dd43b2b6adf379841403b78fda0e6cb22c82f6f2b59da60dc,2022-11-11 22:33:46,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nmain(){\n\tint X,Y,Z,s;\n\tprintf(\""输入三个整数X,Y,Z：\"");\n\tscanf(\""%d %d %d\"",X,Y,Z);\n\tif(X>=0&&X<=100&&Y>=0&&Y<=100&&Z>=0&&Z<=100){\n\ts=X+Y-Z;\n\tprintf(\""%d\"",s);\n\t}\n\treturn 0;\n} ",SEGMENTATION_FAULT,4,308
1591076728087318528,5ed1ed5f3786d45db71190023ef590496fd0d8d8cfe4af0f2c94d1d387178674,2022-11-11 22:33:47,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,n,t,x;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&t);\n        if(n==0)\n            x=1;\n        else\n            x=6;\n        printf(\""%d\\n\"",x);\n    }\n}\n",WRONG_ANSWER,9,316
1591076874367860736,190178fcb71270e17fbe689a22517f5296281dfcd3b16ec01748057e49740d1d,2022-11-11 22:34:22,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    printf(\""2022\\n\"");\n    return 0;\n}",ACCEPTED,4,356
1591076935990575104,5ed1ed5f3786d45db71190023ef590496fd0d8d8cfe4af0f2c94d1d387178674,2022-11-11 22:34:36,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,n,t,x;\n    scanf(\""%d\\n\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&t);\n        if(t==0)\n            x=1;\n        else\n            x=6;\n        printf(\""%d\\n\"",x);\n    }\n}\n",ACCEPTED,9,316
1591076936087044096,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-11-11 22:34:37,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n    int i,j,n;\n    int a=3;\n    scanf(\""%d\"",&n);\n    for(i=7;i<n;i+=2)\n    {\n        for(j=2;j*j<=i;j++)\n        {\n            if(i%j==0)\n                break;\n        }\n        if(j*j>i)\n            a++;\n    }\n    printf(\""%d\\n\"",a);\n    return 0;\n}",ACCEPTED,12,196
1591076959537397760,d5db2853d0fce01dd43b2b6adf379841403b78fda0e6cb22c82f6f2b59da60dc,2022-11-11 22:34:42,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nmain(){\n\tint X,Y,Z,s;\n\tprintf(\""输入三个整数X,Y,Z：\"");\n\tscanf(\""%d %d %d\"",&X,&Y,&Z);\n\tif(X>=0&&X<=100&&Y>=0&&Y<=100&&Z>=0&&Z<=100){\n\ts=X+Y-Z;\n\tprintf(\""%d\"",s);\n\t}\n\treturn 0;\n} ",WRONG_ANSWER,3,312
1591077067511365632,d5db2853d0fce01dd43b2b6adf379841403b78fda0e6cb22c82f6f2b59da60dc,2022-11-11 22:35:08,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nmain(){\n\tint X,Y,Z,s;\n\tprintf(\""输入三个整数X,Y,Z：\"");\n\tscanf(\""%d %d %d\"",&X,&Y,&Z);\n\tif(X>=0&&X<=100&&Y>=0&&Y<=100&&Z>=0&&Z<=100){\n\ts=X+Y-Z;\n\tprintf(\""%d\"",s);\n\t}\n\treturn 0;\n} ",WRONG_ANSWER,3,348
1591077229184987136,af559dccfa68c49b94a61e83fc9942ea0513a50e66ecf36dc005df0e7960903e,2022-11-11 22:35:46,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.*;\npublic class Main{\npublic static void main(String args[]){\n    Scanner sc =new Scanner(System.in);\n    int n=sc.nextInt();\n    for(int i=0;i<n;i++){\n        int z=1;\n        int x=sc.nextInt();\n        for(int j=1;j<=x;j++){\n            z=z*6;\n        }\n        System.out.print(z%10);\n        if(i!=2)System.out.println();\n        \n    }\n\n}\n    }\n,NON_ZERO_EXIT_CODE,252,16708
1591077265914531840,d5db2853d0fce01dd43b2b6adf379841403b78fda0e6cb22c82f6f2b59da60dc,2022-11-11 22:35:55,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nmain(){\n\tint X,Y,Z,s;\n\tscanf(\""%d %d %d\"",&X,&Y,&Z);\n\tif(X>=0&&X<=100&&Y>=0&&Y<=100&&Z>=0&&Z<=100){\n\ts=X+Y-Z;\n\tprintf(\""%d\"",s);\n\t}\n\treturn 0;\n} ",ACCEPTED,8,320
1591077421460295680,c39a4349139942a7aa7456b2c4609f8d0f9d0d3465be213d33870ec87eab1e58,2022-11-11 22:36:32,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint void main(void)\n{\n    int n,i,j=6;\n    long s=0;\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++)\n        s+=j*j;\n    printf(\""%d\"",s%10);\n   \n}",COMPILE_ERROR,0,0
1591077423200931840,65b63200c323c6ac4592306f5b943e39af48faf1b19b89cb7079428c6300e115,2022-11-11 22:36:33,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main(){\n    int i,j,k,n;\n    k=2;\n    scanf(\""%d\"",&n);\n    for(i=5;i<n;i+=2){\n        for(j=2;j*j<=i;j++)\n            if(i%j==0)\n                break;\n        if(j*j>i)\n            k++;\n    }\n    printf(\""%d\"",k);\n}",ACCEPTED,12,200
1591077430943617024,f55f4c0e0e3367434e26a462e3665271f5b4141ea3de4f34d96fdb21d67e2a7c,2022-11-11 22:36:34,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,w,m,j;\n    0<=n<=pow(10,9);\n\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d \"",&i);\n        for(j=0;j<n;j++){\n        if(i!=0){\n        w=pow(6,i);\n        m=w%10;}\n        else\n            m=1;\n\n         printf(\""%d\\n\"",m);\n        }\n\n\n\n\n\n\n\n\n    return 0;\n}}\n",WRONG_ANSWER,6,356
1591077433112072192,d5db2853d0fce01dd43b2b6adf379841403b78fda0e6cb22c82f6f2b59da60dc,2022-11-11 22:36:35,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nmain(){\n\tint X,Y,Z,s;\n\tscanf(\""%d %d %d\"",&X,&Y,&Z);\n\ts=X+Y-Z;\n\tprintf(\""%d\"",s);\n\treturn 0;\n} ",ACCEPTED,9,340
1591077477194207232,5ed1ed5f3786d45db71190023ef590496fd0d8d8cfe4af0f2c94d1d387178674,2022-11-11 22:36:46,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int i,j,n,k=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<n;i++)\n    {\n        for(j=2;j<=sqrt(i);j++)\n        {\n            if(i%j==0)\n            break;\n        }\n            if(j>sqrt(i))\n            k++;\n    }\n    printf(\""%d\"",k);\n}\n",ACCEPTED,13,328
1591077586212556800,5ed1ed5f3786d45db71190023ef590496fd0d8d8cfe4af0f2c94d1d387178674,2022-11-11 22:37:12,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n\nmain()\n{\n    int n,w[20],v[20],i,j,max,sum;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&w[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&v[i]);\n    max=v[1]-w[1];\n    for(i=0;i<n;i++)\n        for(j=i,sum=0;j<n;j++)\n    {\n        sum+=v[j]-w[j];\n        if(sum>max)\n            max=sum;\n    }\n    printf(\""%d\\n\"",max);\n    return 0;\n}\n",ACCEPTED,3,192
1591077675240828928,190178fcb71270e17fbe689a22517f5296281dfcd3b16ec01748057e49740d1d,2022-11-11 22:37:33,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int m,n,k;\n    scanf(\""%d %d %d\"",&m,&n,&k);\n    printf(\""%d\"",m+n-k);\n    return 0;\n}",ACCEPTED,6,312
1591077764449501184,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-11 22:37:54,C++,300.0,1590528927448293376,1590525945717575680,1049226928954454016,#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint main(){\n    cout<<2022<<endl;\nreturn 0;\n},ACCEPTED,6,308
1591077994997813248,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-11 22:38:49,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,print('2022'),ACCEPTED,18,2880
1591078085527646208,02f3cf9a5ba39e00e2644b9392922d3ea3ea233f83c612c7dbd879f319ea2bdc,2022-11-11 22:39:11,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int i,j,n;\n    int x=0,y=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=0;j<n;j++)\n    {\n        scanf(\""%d\"",&b[j]);\n    }\n    for(i=0;i<n;i++)\n    {\n        c[i]=b[i]-a[i];\n    }\n    for(i=0;i<n;i++)\n    {\n        for(j=i,y=0;j<n;j++)\n        {\n            y+=c[j];\n            if(y>x)\n            x=y;\n        }\n\n    }\n printf(\""%d\"",x);\n\n\n    return 0;\n}",ACCEPTED,3,364
1591078237449555968,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-11 22:39:47,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"a,b,c=map(int,input())\nprint(a+b-c)",NON_ZERO_EXIT_CODE,17,2756
1591078272241307648,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-11 22:39:55,C++,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint main(){\n    int a,b,c;\n    cin>>a>>b>>c;\n    cout<<a+b-c<<endl;\nreturn 0;\n}",ACCEPTED,8,448
1591078297021255680,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-11 22:40:01,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int i,j,t,n,a,b;\n    scanf(\""%d\"",&t);\n    if(0<n<=pow(10,9)){\n    for(i=0;i<t;i++){\n    scanf(\""%d \"",&n);\n    for(j=0;j<=i;j++){\n    a=pow(6,n);\n    b=a%10;\n    printf(\""%d\\n\"",b);\n    }\n    }\n    if(n=0){\n        printf(\""1\"");\n    }\n    return 0;\n}\n}\n",WRONG_ANSWER,3,344
1591078320895229952,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-11 22:40:07,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"a,b,c=map(int,input())\nprint(a+b-c)\nreturn 0",NON_ZERO_EXIT_CODE,21,2780
1591078421596278784,27fbb32d960dbf49665c8905b68012d602eda68987686c6f224ec7b49ca3d0ac,2022-11-11 22:40:31,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""2022\"")\n    return 0;\n}",COMPILE_ERROR,0,0
1591078466424999936,27fbb32d960dbf49665c8905b68012d602eda68987686c6f224ec7b49ca3d0ac,2022-11-11 22:40:41,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,4,348
1591078730318020608,212aee9dc233539050d1d324af20b580172711970f7c24349b9c7c8ac9b114cd,2022-11-11 22:41:44,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(){\n    int X,Y,Z,sum;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    sum=X+Y-Z;\n    if(Y>=0 && Y<=100 && Y>=0 && Y<=100 && Z>=0 && Z<=100)\n        printf(\""%d\"",sum);\nreturn 0;\n}",ACCEPTED,6,324
1591078806469804032,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-11 22:42:02,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\n#include<math.h>\nusing namespace std;\n\nclass reslove {\npublic:\n\tvoid resve(int a) {\n\t\tcout << (int)pow(6, a) % 10 << endl;\n\t}\n};\nint main(int argc, char* argv[])\n{\n\tint n = 0;\n\tint a[20];\n\treslove res;\n\tcout << \""请输入测试的个数\"" << endl;\n\tcin >> n;\n\tfor (int i = 0; i < n; i++) {\n\t\tcin >> a[i];\n\t\tres.resve(a[i]);\n\t}\n\t\n\treturn 0;\n}",WRONG_ANSWER,4,444
1591078870277750784,20ffd83467b553ac24e1f4b8b096d58858684ca8c3f6a4d5a62be9ff7c4817da,2022-11-11 22:42:18,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""2022\\n\"");\n    return 0;\n}\n",ACCEPTED,4,468
1591078875927457792,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-11 22:42:19,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\n#include<math.h>\nusing namespace std;\n\nclass reslove {\npublic:\n\tvoid resve(int a) {\n\t\tcout << (int)pow(6, a) % 10 << endl;\n\t}\n};\nint main(int argc, char* argv[])\n{\n\tint n = 0;\n\tint a[20];\n\treslove res;\n\tcout << \""请输入测试的个数\"" << endl;\n\tcin >> n;\n\tfor (int i = 0; i < n; i++) {\n\t\tcin >> a[i];\n\t\tres.resve(a[i]);\n\t}\n\t\n\treturn 0;\n}",WRONG_ANSWER,4,320
1591078958223896576,29249e539dec3766ca388aaa46121bd2a768da21260d3f436e20eeaac8ee73b3,2022-11-11 22:42:39,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    printf(\""%d\\n\"",X+Y-Z);\n    return 0;\n}\n",ACCEPTED,6,460
1591078959217946624,fbea21dbaf89f1b064feaa20227f21c5e1c4888fdc371cf5e43f70615906e52a,2022-11-11 22:42:39,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"n=int(input())\nnum=list(map(int,input().split()))\nfor i in num:\n    print(6)",WRONG_ANSWER,45,2888
1591079136641200128,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-11 22:43:21,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\n#include<math.h>\nusing namespace std;\ntypedef long long ll;\n\nclass reslove {\npublic:\n\tvoid resve(int a) {\n\t\tcout << (ll)pow(6, a) % 10 << endl;\n\t}\n};\nint main(int argc, char* argv[])\n{\n\tint n = 0;\n\tint a[20];\n\treslove res;\n\tcout << \""请输入测试的个数\"" << endl;\n\tcin >> n;\n\tfor (int i = 0; i < n; i++) {\n\t\tcin >> a[i];\n\t\tres.resve(a[i]);\n\t}\n\t\n\treturn 0;\n}",WRONG_ANSWER,3,456
1591079196267446272,cf568c7ddc8b221335f880bfbaac4634294e65481e738a2e032c1ab9a84d576f,2022-11-11 22:43:35,Java,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"import java.io.*;  //引入java的IO包\nimport java.util.Scanner;\nclass Main{\n   public static void main(String[] args){\n        int n,i,j;\n        int y=0,ma=0;\n        Scanner sc=new Scanner(System.in);\n        n=sc.nextInt();\n        int[]a=new int[n];\n        int[]b=new int[n];\n        int[]c=new int[n];\n        for(i=0;i<n;i++){\n            a[i]=sc.nextInt();\n        }\n        for(i=0;i<n;i++){\n            b[i]=sc.nextInt();\n        }\n        for(i=0;i<n;i++){\n            c[i]=b[i]-a[i];\n        }\n\n        for(i=0;i<n;i++){\n            y=0;\n            for(j=i;j<n;j++){\n                y+=c[j];\n                if(y>ma){\n                    ma=y;\n                }\n\n            }\n        }\n        System.out.print(ma);\n    }\n}",ACCEPTED,134,16556
1591079210922344448,190178fcb71270e17fbe689a22517f5296281dfcd3b16ec01748057e49740d1d,2022-11-11 22:43:39,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int i,m,n=0;\n    scanf(\""%d\"",&i);\n    for(n=1;n<=i;n++)\n    {\n        scanf(\""%d\"",&m);\n        if(m)\n            printf(\""6\"");\n        else printf(\""1\"");\n        if(i-n!=0)\n            printf(\""\\n\"");\n    }\n    return 0;\n}",ACCEPTED,9,332
1591079286788915200,02f3cf9a5ba39e00e2644b9392922d3ea3ea233f83c612c7dbd879f319ea2bdc,2022-11-11 22:43:57,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int i,n,a[100],b[100],m,sum=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(i=0,m=0;i<n;i++)\n    {\n        if(b[i]>a[i])\n        {\n          m=(b[i]-a[i]);\n          sum=sum+m;\n\n        }\n    }\n     printf(\""%d\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,3,192
1591079464623214592,212aee9dc233539050d1d324af20b580172711970f7c24349b9c7c8ac9b114cd,2022-11-11 22:44:39,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <iostream>\nusing namespace std;\ntypedef long long ll;\n\nint n, t, x;\nint main()\n{\n    cin >> t;\n    while (t--)\n    {\n        cin >> x;\n        if (x == 0)\n        {\n            cout << \""1\"" << endl;\n        }\n        else\n        {\n            cout << \""6\"" << endl;\n        }\n    }\n}",COMPILE_ERROR,0,0
1591079474223972352,c39a4349139942a7aa7456b2c4609f8d0f9d0d3465be213d33870ec87eab1e58,2022-11-11 22:44:42,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main()\n{\nint N;\ncin>>N;\nfor(int i=0;i<N;i++)\n{\nintn=10;\nint a[n];\nint x1,×2;\ncin>>x1;\nX2=×1%10；\na[0]=x2;\nint count;\nint remain;\nfor(int i=1;;i++)\n{\na[i]=(a[i-1]*×2)%10;\nif(a[i]==a[0])\n{\ncount=i;\nbreak;\n}\n}\nremain=x1%count;\nif(remain)\ncout<<a[remain-1]<<endl;\nelse\ncout<<a[ count-1]<<endl;\n}\n}",COMPILE_ERROR,0,0
1591079591219867648,69d2f3a9da1c135d111e69327883b4d96c284e9c1c71370cc330a44458f95ab4,2022-11-11 22:45:10,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint i,n,t,x=1;\n\tscanf(\""%d\"", &t);\n\tfor (int j = 0; j < t; j++)\n\t{\n\t\tscanf(\""%d\"", &n);\n\t\tfor (i = 0; i < n; i++)\n\t\t{\n\t\t\tx = x * 6;\n\t\t}\n\t\tprintf(\""%d\\n\"", x%10);\n\t}\n\treturn 0;\n}",WRONG_ANSWER,3,188
1591079614984814592,bcc80c637e0ae4837743d463049e862b206c31483ff6a67b35742ac5d66647d7,2022-11-11 22:45:15,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int m,k,n,num=0;\n    scanf(\""%d\"",&n);\n    for(m=2;m<n;m++)\n    {\n        for(k=2;k<=sqrt(m);k++)\n        {\n            if(m%k==0) break;\n        }\n            if(k>sqrt(m))\n             num++;\n    }\n    printf(\""%d\"",num);\n}\n",ACCEPTED,14,316
1591079698120093696,20ffd83467b553ac24e1f4b8b096d58858684ca8c3f6a4d5a62be9ff7c4817da,2022-11-11 22:45:35,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\nint X,Y,Z;\nint function;\nscanf(\""%d %d %d\"",&X,&Y,&Z);\nfunction=X+Y-Z;\nprintf(\""%d\\n\"",function);\n}\n",ACCEPTED,8,332
1591079712649162752,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-11 22:45:38,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nvoid main()\n{\n\tint a,i,j;\n    int num=0;\n\tscanf(\""%d\"",&a);\n\tfor(i=2;i<=a;i++)\n\t\t{\n\t\tfor(j=2;j<=i;j++)\n\t\t\tif(i%j==0)\n\t\t\t\tbreak;\n\t\tif(i==j)\n\t\t\tnum++;\n\t\t}\n    printf(\""%d\"",num);\n}\n",ACCEPTED,939,460
1591079759205961728,abe2744e33bb397ffb9bb13afcb202f611378fb4fc5801202f03933298ce5f5d,2022-11-11 22:45:50,Java,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n    public static void main(String[] args) throws IOException {\n\n        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n        int n = Integer.valueOf(reader.readLine());\n        int max=0;\n        int now=0;\n\n        String[] lost = reader.readLine().split(\"" \"");\n\n        String[] gain = reader.readLine().split(\"" \"");\n\n\n        int los=0;\n        int gai=0;\n        for(int i=0;i<n;i++) {\n\n            los=Integer.valueOf(lost[i]);\n            gai=Integer.valueOf(gain[i]);\n\n            if((gai-los)>=0) {\n\n                if((now+gai-los)>=max)\n                max=now+gai-los;\n                now+=gai-los;\n            }\n            else if ((gai-los)<=0&&(now+gai-los)>=0){\n                now+=gai-los;\n            } else if ((gai-los+now)<0) {\n                now=0;\n            }\n            \n\n        }\n        System.out.println(max);\n    }\n\n\n}\n",ACCEPTED,71,17040
1591079795406974976,27fbb32d960dbf49665c8905b68012d602eda68987686c6f224ec7b49ca3d0ac,2022-11-11 22:45:58,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,b,c;\n    scanf(\""%d%d%d\"",&a,&b,&c);\n    printf(\""%d\"",a+b-c);\n    return 0;\n}",ACCEPTED,6,348
1591079835311607808,157388d8d83262bba5955406e39bb36c3baacd3a224f63ce1739541bb582af20,2022-11-11 22:46:08,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include<math.h>\n\nint main()\n{\n   int n,i;\n   scanf(\""%d\"",&n);\n       for(i=2;i<=n;i++)\n       {\n           if(n>=2&&n<=pow(10,5))\n           {\n             if(n%i==0)\n           {\n               break;\n           }\n           }\n\n       }\n       if(n==i)\n        printf(\""%d\"",n);\n   }\n",WRONG_ANSWER,3,352
1591079914860777472,1019ea4e8e67338c8191b6e52878cb69ca9287130af71af3517596fded2f21e4,2022-11-11 22:46:27,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int i,j,n;\n    int x=0,y=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=0;j<n;j++)\n    {\n        scanf(\""%d\"",&b[j]);\n    }\n    for(i=0;i<n;i++)\n    {\n        c[i]=b[i]-a[i];\n    }\n    for(i=0;i<n;i++)\n    {\n        for(j=i,y=0;j<n;j++)\n        {\n            y+=c[j];\n            if(y>x)\n            x=y;\n        }\n\n    }\n printf(\""%d\"",x);\n\n\n    return 0;\n}\n",ACCEPTED,3,316
1591079999447281664,02f3cf9a5ba39e00e2644b9392922d3ea3ea233f83c612c7dbd879f319ea2bdc,2022-11-11 22:46:47,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int i,n,a[100],b[100],m,sum=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(i=0,m=0;i<n;i++)\n    {\n        if(b[i]>a[i])\n        {\n          m=(b[i]-a[i]);\n          sum=sum+m;\n\n        }\n    }\n     printf(\""%d\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,4,320
1591080311809703936,6262f0a413b96431dc288d9bff3eec2cb51399f3231deae614c06d6a6720231b,2022-11-11 22:48:01,Python,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"A=2022\nprint(\""A\""%d)",NON_ZERO_EXIT_CODE,16,2744
1591080319460093952,ef50cfe7f34b26d29f617c97ac65d40bd15ba1e063897a190284243de955e254,2022-11-11 22:48:03,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <iostream>\n\nusing namespace std;\n\nint main() {\n    int n;\n    cin >> n;\n    for (int i = 0, j; i < n; i++) {\n        cin >> j;\n        cout << 6 << endl;\n    }\n    return 0;\n}",WRONG_ANSWER,10,504
1591080320886157312,69d2f3a9da1c135d111e69327883b4d96c284e9c1c71370cc330a44458f95ab4,2022-11-11 22:48:04,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdilb.h>\nint main()\n{\n\tint i,n,t,x;\n\tscanf(\""%d\"", &t);\n\tfor (int j = 0; j < t; j++)\n\t{   \n\t\tscanf(\""%d\"", &n);\n\t\tx=pow(6,n);\n        printf(\""%d\"",x%10)\n    }\n\treturn 0;\n}",COMPILE_ERROR,0,0
1591080336929394688,2abced548590476f918e32b0d5a4f88aa736e22ac158ed666b7778a0eaff5bae,2022-11-11 22:48:07,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main)()\n{\n    printf(\""2022\\n\"");\n    return 0;\n}",COMPILE_ERROR,0,0
1591080387261018112,2abced548590476f918e32b0d5a4f88aa736e22ac158ed666b7778a0eaff5bae,2022-11-11 22:48:19,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    printf(\""2022\\n\"");\n    return 0;\n}",ACCEPTED,3,344
1591080388414472192,42cfad7191c5e6c0eee156c4369182744d6c5db3bc2a5dc87f9f1be6ee4bbcfe,2022-11-11 22:48:20,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main() \n{\n    int n,i,j,flag,sum=0;\n    scanf(\""%d\"", &n);\n    for(i=2;i<n;i++) {\n        flag=1;\n        for(j=2; j<i;j++) {\n            if (i%j==0) {\n                flag=0;\n            }\n        }\n        if(flag) {\n        \tsum=sum+1;\n        }\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",TIME_LIMIT_EXCEEDED,1000,308
1591080396916326400,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-11 22:48:22,Python,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"a,b,c=map(int,input().split())\nprint(a+b-c)\n",ACCEPTED,36,2868
1591080471642046464,dcc1017bcd698bd6a0eee54e4ed848d4c51a3a26608990cdd2137e4c01065a1e,2022-11-11 22:48:39,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n    int a=0;\n    int x,y=0,z,i,j,k,l;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++){\n        scanf(\""%d\"",&x);\n        for(j=0;j<x;j++){\n            k=pow(6,j);\n        }\n        z=k%10;\n        if(i!=2){\n        printf(\""%d\\n\"",z);}\n        if(i==2){\n            printf(\""%d\"",z);\n        }\n        \n    }      \n    \n    return 0;\n}",TIME_LIMIT_EXCEEDED,23,316
1591080528013496320,63bdcc3416dd0c07c03f833ffb02c2f304a4f523deae6a87bed24a730e4d224d,2022-11-11 22:48:53,C++,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n\tint n,f;\n\tcin >> n;\n\tint cnt = 0;\n\t\tfor (int i = 2; i <= n; i++)\n\t\t{\n\t\t\tf=1;\n\t\t\tfor(int j = 2; j <=sqrt(i); j++)\n\t\t\t{\n\t\t\t\tif(i%j==0){\n\t\t\t\t\tf=0;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(f){\n\t\t\t//cout << i << endl ;\n\t\t\tcnt++;\n\t\t\t}\n\t\t}\n\tcout << cnt<< endl;\n\treturn 0;\n}\n\n\n",ACCEPTED,13,484
1591080529850597376,6262f0a413b96431dc288d9bff3eec2cb51399f3231deae614c06d6a6720231b,2022-11-11 22:48:53,Python,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"A=2022\nprint(\""A\""%s)",NON_ZERO_EXIT_CODE,15,2756
1591080547122745344,03f9d7a6fc27d141b8243d1b2b44a3276cdd4750b5c2621d6d8c006b64ca6514,2022-11-11 22:48:57,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint a,x;\n\tint sum=0;\n\tscanf(\""%d\"",&a);\n\tfor(x=2;x<a;x++){\n\t\tint i;\n\t\tint isprime=1;\n\t\tfor(i=2;i<x;i++){\n\t\t\tif(x%i==0){\n\t\t\t\tisprime=0;\n\t\t\t\tbreak;\n\t\t\t}\t\n\t\t} \n\t\t\tif(isprime==1)\n\t\t\t\tsum++;\n\t}\n\tprintf(\""%d\"",sum);\n\treturn 0;\n}",ACCEPTED,956,320
1591080548834021376,29249e539dec3766ca388aaa46121bd2a768da21260d3f436e20eeaac8ee73b3,2022-11-11 22:48:58,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h> \n#include<math.h>\nint main(){\nint n;\n scanf(\""%d\"",&n);\n int a[n];\n for(int i=0;i<n;i++){\n  scanf(\""%d\"",&a[i]);\n }\n    \n    for(int i=0;i<n-1;i++){\n       if(a[i]==0&&i<(n-1)) printf(\""1\\n\"");\n       else printf(\""6\\n\"");\n    }\n    if(a[n-1]==0) printf(\""1\"");\n    else printf(\""6\"");\n \n}",ACCEPTED,11,312
1591080681545990144,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-11 22:49:29,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,import java.time.LocalDateTime;\n\npublic class Test{\n    public static void mian(String[] args){\n        LocalDateTime ldt = LocalDateTime.now();\n        System.out.println(ldt.getYear());\n    }\n},COMPILE_ERROR,0,0
1591080692937719808,dcc1017bcd698bd6a0eee54e4ed848d4c51a3a26608990cdd2137e4c01065a1e,2022-11-11 22:49:32,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n    int a=0;\n    int x,z,i,j,k;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++){\n        scanf(\""%d\"",&x);\n        for(j=0;j<x;j++){\n            k=pow(6,j);\n        }\n        z=k%10;\n        if(i!=2){\n        printf(\""%d\\n\"",z);}\n        if(i==2){\n            printf(\""%d\"",z);\n        }\n        \n    }      \n    \n    return 0;\n}",TIME_LIMIT_EXCEEDED,24,320
1591080696800653312,c39a4349139942a7aa7456b2c4609f8d0f9d0d3465be213d33870ec87eab1e58,2022-11-11 22:49:33,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main()\n{\n    int N;\n    cin>>N;\n    for(int i=0;i<N;i++)\n    {\n        int n=10;\n        int a[n];\n        int x1,x2;\n        cin>>x1;\n        x2=x1%10;\n        a[0]=x2;\n        int count;\n        int remain;\n        for(int i=1;;i++)\n        {\n            a[i]=(a[i-1]*x2)%10;\n            if(a[i]==a[0])\n            {\n                countpi;\n                break;\n            }\n        }\n        remain=x1%count;\n        if(remain)\n            cout<<a[remain-1]<<end1;\n        else\n            cout<<a[count-1]<<end1;\n    }\n}",COMPILE_ERROR,0,0
1591080711875006464,212aee9dc233539050d1d324af20b580172711970f7c24349b9c7c8ac9b114cd,2022-11-11 22:49:37,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <iostream>\nusing namespace std;\ntypedef long long ll;\n\nint n,t,x;\nint main()\n{\n    cin >> t;\n    while (t--)\n    {\n        cin >> x;\n        if (x == 0)\n        {\n            cout << \""1\"" << endl;\n        }\n        else\n        {\n            cout << \""6\"" << endl;\n        }\n    }\n}",ACCEPTED,11,472
1591080837922230272,ef50cfe7f34b26d29f617c97ac65d40bd15ba1e063897a190284243de955e254,2022-11-11 22:50:07,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <iostream>\n\nusing namespace std;\n\nint main() {\n    int n;\n    cin >> n;\n    for (int i = 0, j; i < n; i++) {\n        cin >> j;\n        if (i < n - 1) {\n            cout << 6 << endl;\n        } else {\n            cout << 6;\n        }\n        \n    }\n    return 0;\n}",WRONG_ANSWER,11,448
1591080839117606912,d5db2853d0fce01dd43b2b6adf379841403b78fda0e6cb22c82f6f2b59da60dc,2022-11-11 22:50:07,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nmain(){\n\tint n,m,i,count,a[10];\n\tscanf(\""%d\"",&m);\n\tfor(i=0;i<m;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\t\n\tfor(i=0;i<m;i++){\n\t\tprintf(\""6\"");\n\t\tif(i<m-1) printf(\""\\n\""); \n\t}\n\treturn 0;\n}",WRONG_ANSWER,10,332
1591080884374122496,27fbb32d960dbf49665c8905b68012d602eda68987686c6f224ec7b49ca3d0ac,2022-11-11 22:50:18,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    int a[n]\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        printf(\""6\\n\"");\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1591080918448648192,27fbb32d960dbf49665c8905b68012d602eda68987686c6f224ec7b49ca3d0ac,2022-11-11 22:50:26,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        printf(\""6\\n\"");\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1591081081879703552,e7f8e9ba366feb4551b7dc8e6a149f796e822980a43de4fcc91ded552c4bcbd4,2022-11-11 22:51:05,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(){\n\tint n,m,i; int x=0,y=0;\n\tscanf(\""%d\"",&n);\n\tint a[n],b[n],c[n];\n\tfor (m=0;m<n,m++)\n\t  scanf(\""%d\"",&a[m]);\n\tfor (m=0;m<n;m++)\n\t  scanf(\""%d\"",&b[m]);\n\tfor (m=0;m<n;m++)  \n\t  c[m]=b[m]-a[m];\n\tfor(m=0;m<n;m++){\n\t\ty+=c[i];\n\t\tif(y>x)\n\t\t  x=y;\n\t}\n\tprintf(\""%d\"",x)\n\t\n} ",COMPILE_ERROR,0,0
1591081089706274816,27fbb32d960dbf49665c8905b68012d602eda68987686c6f224ec7b49ca3d0ac,2022-11-11 22:51:07,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        printf(\""6\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,11,196
1591081118256926720,5c1ff147303fd43738d51172d4d1fe197154431fc6a4db18bbf58c05c2009330,2022-11-11 22:51:14,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"print(\""2022\"")",ACCEPTED,15,2756
1591081151299629056,bcc80c637e0ae4837743d463049e862b206c31483ff6a67b35742ac5d66647d7,2022-11-11 22:51:21,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int t,i,n,y;\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&n);\n        if(n==0)\n            y=1;\n        else\n            y=6;\n        printf(\""%d\\n\"",y);\n    }\n}\n",ACCEPTED,10,344
1591081215241818112,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-11-11 22:51:37,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,count=0;\n    for(n=1;n<=100000;n++)\n    {\n        for(i=3;i<=n;i++)\n        {\n            if(n%i==0)\n            {\n                count++;\n                printf(\""%d\"",count);\n            }\n        }\n    }\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,1000,1672
1591081216562999296,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-11 22:51:37,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,import java.time.LocalDateTime;\nclass Test{\n    public static void mian(String[] args){\n        LocalDateTime ldt = LocalDateTime.now();\n        System.out.println(ldt.getYear());\n    }\n},COMPILE_ERROR,0,0
1591081238859919360,2abced548590476f918e32b0d5a4f88aa736e22ac158ed666b7778a0eaff5bae,2022-11-11 22:51:42,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int a,b,c;\nscanf(\""%d,%d,%d\"",&a,&b&c);\nprintf(\""%d\"",a+b-c);\nreturn 0;\n}",COMPILE_ERROR,0,0
1591081322884431872,69d2f3a9da1c135d111e69327883b4d96c284e9c1c71370cc330a44458f95ab4,2022-11-11 22:52:02,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#define _CRT_SECURE_NO_WARNINGS\n#include <stdio.h>\nint main()\n{\n\tint i,j,n=0;\n\tfor ( j= 2; j <= 999; j++)\n\t{\n\t\tfor (i = 2; i <=j; i++)\n\t\t{\n\t\t\tif (j%i== 0)\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t}\n\t\tif (i == j)\n\t\t\tn++;\n\t\t\n\t}printf(\""%d\"", n);\n\treturn 0;\n}",WRONG_ANSWER,4,308
1591081348788453376,dcc1017bcd698bd6a0eee54e4ed848d4c51a3a26608990cdd2137e4c01065a1e,2022-11-11 22:52:09,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n    int a=0;\n    int x,z,i,k;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++){\n        scanf(\""%d\"",&x);\n            k=pow(6,x);\n        \n        z=k%10;\n        if(i!=2){\n        printf(\""%d\\n\"",z);}\n        if(i==2){\n            printf(\""%d\"",z);\n        }\n        \n    }      \n    \n    return 0;\n}",WRONG_ANSWER,7,316
1591081384695869440,42cfad7191c5e6c0eee156c4369182744d6c5db3bc2a5dc87f9f1be6ee4bbcfe,2022-11-11 22:52:17,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main() \n{\n    int n,i,j,flag,sum=0;\n    scanf(\""%d\"", &n);\n    for(i=2;i<n;i++) {\n        flag=1;\n        for(j=2; j<i;j++) {\n            if (i%j==0) {\n                flag=0;\n            }\n        }\n        if(flag==1) {\n        \tsum=sum+1;\n        }\n    }\n    printf(\""%d\"",sum);\n    return 0;\n}",TIME_LIMIT_EXCEEDED,1000,380
1591081419345035264,69d2f3a9da1c135d111e69327883b4d96c284e9c1c71370cc330a44458f95ab4,2022-11-11 22:52:25,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#define _CRT_SECURE_NO_WARNINGS\n#include <stdio.h>\nint main()\n{\n\tint i,j,n=0;\n\tfor ( j= 2; j <= 999; j++)\n\t{\n\t\tfor (i = 2; i <=j; i++)\n\t\t{\n\t\t\tif (j%i== 0)\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t}\n\t\tif (i == j)\n\t\t\tn++;\n\t\t\n\t}printf(\""%d\"", n);\n\treturn 0;\n}",WRONG_ANSWER,3,348
1591081437242109952,62c83306b4f5c482e4e9a52dc69ae0b8ee7b5238abb34e56352843a0d484ff2c,2022-11-11 22:52:30,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\npublic class Main{\n public static void main(String[] args){\n  int arr[];\n  arr=new int[10];\n  Scanner sc = new Scanner(System.in);\n  for(int i=0;i<10 ;i++){\n   arr[i] = sc.nextInt();\n  }\n      for(int i=0;i<10;i++)\n   System.out.println(arr[i]);\n  for(int i = 0;i<9;i++){\n   for(int j =0;j<10-i-1;j++){\n    if(arr[j]>arr[j+1]){\n     int a;\n     a=arr[j+1];\n     arr[j+1]=arr[j];\n     arr[j]=a;\n    }\n\n   }\n  }\n  System.out.println(arr[9]);\n  System.out.print(arr[0]);\n }\n}\n   ,NON_ZERO_EXIT_CODE,119,19344
1591081477939466240,ef50cfe7f34b26d29f617c97ac65d40bd15ba1e063897a190284243de955e254,2022-11-11 22:52:39,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <iostream>\n\nusing namespace std;\n\nint main() {\n    int n;\n    cin >> n;\n    for (int i = 0, j; i < n; i++) {\n        cin >> j;\n        if (j == 0) {\n            cout << 1 << endl;\n        }\n        else if (i < n - 1) {\n            cout << 6 << endl;\n        } else {\n            cout << 6;\n        }\n        \n    }\n    return 0;\n}",ACCEPTED,11,456
1591081496838975488,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-11 22:52:44,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\n#include<math.h>\nusing namespace std;\ntypedef long long ll;\n\nclass reslove {\npublic:\n\tvoid resve(int a) {\n\t\tcout << (ll)pow(6, a) % 10 ;\n\t}\n};\nint main(int argc, char* argv[])\n{\n\tint n = 0;\n\tint a[20];\n\treslove res;\n\tcin >> n;\n\tfor (int i = 0; i < n; i++) {\n\t\tcin >> a[i];\n\t\tres.resve(a[i]);\n        if(i<n-1)\n            cout<<endl;\n\t}\n\t\n\treturn 0;\n}",WRONG_ANSWER,7,452
1591081504342605824,2abced548590476f918e32b0d5a4f88aa736e22ac158ed666b7778a0eaff5bae,2022-11-11 22:52:46,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int a,b,c;\nscanf(\""%d,%d,%d\"",&a,&b,&c);\nprintf(\""%d\"",a+b-c);\nreturn 0;\n}",WRONG_ANSWER,3,196
1591081560755998720,dcc1017bcd698bd6a0eee54e4ed848d4c51a3a26608990cdd2137e4c01065a1e,2022-11-11 22:52:59,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n    int a=0;\n    int x,z,i,k;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++){\n        scanf(\""%d\"",&x);\n            k=pow(6,x);\n        z=k%10;\n        if(i!=a-1){\n        printf(\""%d\\n\"",z);}\n        if(i==a-1){\n            printf(\""%d\"",z);\n        }\n        \n    }      \n    \n    return 0;\n}",WRONG_ANSWER,7,348
1591081564551843840,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-11 22:53:00,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\n#include<math.h>\nusing namespace std;\n\nclass reslove {\npublic:\n\tvoid resve(int a) {\n\t\tcout << pow(6, a) % 10 ;\n\t}\n};\nint main(int argc, char* argv[])\n{\n\tint n = 0;\n\tint a[20];\n\treslove res;\n\tcin >> n;\n\tfor (int i = 0; i < n; i++) {\n\t\tcin >> a[i];\n\t\tres.resve(a[i]);\n        if(i<n-1)\n            cout<<endl;\n\t}\n\t\n\treturn 0;\n}",COMPILE_ERROR,0,0
1591081570159624192,27fbb32d960dbf49665c8905b68012d602eda68987686c6f224ec7b49ca3d0ac,2022-11-11 22:53:01,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        printf(\""6\"");\n        if(i!=n-1)\n        printf(\""\\n\"");\n    }\n    return 0;\n}",WRONG_ANSWER,11,196
1591081654309924864,6b02dfcf297d52c2de2e1416b33ee988ff909834c73207b147423a8301e9d174,2022-11-11 22:53:21,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\n#include<time.h> \nvoid main()\n{\n    time_t t;\n    struct tm *p;\n    time(&t);\n    p=localtime(&t);\n    printf(\""%d\"",1900+p->tm_year);\n } ",ACCEPTED,3,192
1591081666146271232,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-11-11 22:53:24,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,count=0;\n        for(i=3;i<=n;i++)\n        {\n            if(n%i==0)\n            {\n                count++;\n                printf(\""%d\"",count);\n            }\n        }\n    return 0;\n}\n",WRONG_ANSWER,3,324
1591081667354230784,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-11 22:53:25,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\n#include<math.h>\nusing namespace std;\n\nclass reslove {\npublic:\n\tvoid resve(int a) {\n\t\tcout << (int)pow(6, a) % 10 ;\n\t}\n};\nint main(int argc, char* argv[])\n{\n\tint n = 0;\n\tint a[20];\n\treslove res;\n\tcin >> n;\n\tfor (int i = 0; i < n; i++) {\n\t\tcin >> a[i];\n\t\tres.resve(a[i]);\n        if(i<n-1)\n            cout<<endl;\n\t}\n\t\n\treturn 0;\n}",WRONG_ANSWER,9,700
1591081676824973312,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-11 22:53:27,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint a[10];\nint b[100000];\nint main(){\n    ll n;\n    cin>>n;\n    for(int i=0;i<n;i++){\n     cin>>a[i];\n      cout<<6<<endl;\n    }\nreturn 0;\n},WRONG_ANSWER,13,448
1591081722157006848,6b02dfcf297d52c2de2e1416b33ee988ff909834c73207b147423a8301e9d174,2022-11-11 22:53:38,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\n#include<time.h> \nvoid main()\n{\n    time_t t;\n    struct tm *p;\n    time(&t);\n    p=localtime(&t);\n    printf(\""%d\"",1900+p->tm_year);\n } ",ACCEPTED,3,312
1591081851295432704,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-11 22:54:08,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,n=int(input())\nfor i in range(n):\n    b=int(input())\n    if b==0:\n        print(1)\n    else:\n        print(6)\n,NON_ZERO_EXIT_CODE,17,2892
1591081911349477376,69d2f3a9da1c135d111e69327883b4d96c284e9c1c71370cc330a44458f95ab4,2022-11-11 22:54:23,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#define _CRT_SECURE_NO_WARNINGS\n#include <stdio.h>\nint main()\n{\n\tint m, j;\n\tint i,n=0;\n\tscanf(\""%d\"", &m);\n\tfor ( j= 2; j <= m; j++)\n\t{\n\t\tfor (i = 2; i <=j; i++)\n\t\t{\n\t\t\tif (j%i== 0)\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t}\n\t\tif (i == j)\n\t\t\tn++;\n\t\t\n\t}printf(\""%d\"", n);\n\treturn 0;\n}",ACCEPTED,921,312
1591081917968089088,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-11 22:54:24,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,import java.time.LocalDateTime;\n\npublic class Test{\n    public static void mian(String[] args){\n        LocalDateTime ldt = LocalDateTime.now();\n        System.out.println(ldt.getYear());\n    }\n},COMPILE_ERROR,0,0
1591081922359504896,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-11 22:54:25,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint a[10];\nint b[100000];\nint main(){\n    ll n;\n    cin>>n;\n    for(int i=0;i<n;i++){\n     cin>>a[i];\n    }\n    for(int i=0;i<n;i++)\n        cout<<6<<endl;\nreturn 0;\n},WRONG_ANSWER,14,464
1591081941535862784,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 22:54:30,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(){\n  int c=0,n,i,j,max=0;\n  scanf(\""%d\"",&n);\n  int a[n],b[n];\n  for(i=0;i<n;i++)\n  {\n      scanf(\""%d\"",&a[i]);\n  }\n   for(i=0;i<n;i++)\n  {\n      scanf(\""%d\"",&b[i]);\n  }\n\nfor(j=0;j<n;j++)\n{for(i=j;i<n;i++)\n  {\n     c=c-a[i]+b[i];\n    if(c>max)\n    max=c;\n\n  }\n\n\n}\n\n  printf(\""%d\"",max);\n}\n",WRONG_ANSWER,3,192
1591082043285504000,62c83306b4f5c482e4e9a52dc69ae0b8ee7b5238abb34e56352843a0d484ff2c,2022-11-11 22:54:54,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n long long int t,j,u=0;\n int isprime(int n);\n printf(\""请输入一个数：\"");\n scanf(\""%d\"",&t);\n for(j=1;j<=t;j++)\n {\n  if (isprime(j)==1) u++;\n }\n printf(\""从1到%d总共有%d个素数。\"",t,u);\n return 0;\n}\n\nint isprime(int n)\n{\n int i;\n if(n==2) return 1;\n else if(n==1||n%2==0) return 0;\n for (i=3;i<=sqrt(n)+1;i+=2)\n {\n  if(n%i==0) return 0;\n }\n return 1;\n}",TIME_LIMIT_EXCEEDED,1000,412
1591082106162294784,ef50cfe7f34b26d29f617c97ac65d40bd15ba1e063897a190284243de955e254,2022-11-11 22:55:09,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t    Scanner sc = new Scanner(System.in);\n\t    int n = sc.nextInt();\n\t    for (int i = 0; i < n; i++) {\n            int j = sc.nextInt();\n            if (j == 0) {\n                System.out.println(1);\n            } else {\n                System.out.println(6);\n            }\n        }\n\t}\n\t\n},WRONG_ANSWER,251,16360
1591082152379355136,62c83306b4f5c482e4e9a52dc69ae0b8ee7b5238abb34e56352843a0d484ff2c,2022-11-11 22:55:20,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n long long int t,j,u=0;\n int isprime(int n);\n printf(\""请输入一个数：\"");\n scanf(\""%d\"",&t);\n for(j=1;j<=t;j++)\n {\n  if (isprime(j)==1) u++;\n }\n printf(\""从1到%d总共有%d个素数。\"",t,u);\n return 0;\n}\n\nint isprime(int n)\n{\n int i;\n if(n==2) return 1;\n else if(n==1||n%2==0) return 0;\n for (i=3;i<=sqrt(n)+1;i+=2)\n {\n  if(n%i==0) return 0;\n }\n return 1;\n}",TIME_LIMIT_EXCEEDED,1000,300
1591082161900421120,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-11-11 22:55:22,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,count=0;\n    scanf(\""%d\"",&n);\n        for(i=1;i<=n;i++)\n        {\n            if(n%i==0)\n            {\n                count++;\n                printf(\""%d\"",count-2);\n            }\n        }\n    return 0;\n}\n",WRONG_ANSWER,3,192
1591082162781229056,6262f0a413b96431dc288d9bff3eec2cb51399f3231deae614c06d6a6720231b,2022-11-11 22:55:23,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"A=2022\nprintf(\""A\""%s)",COMPILE_ERROR,0,0
1591082316548603904,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-11 22:55:59,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint a[10];\nint b[100000];\nint main(){\n    ll n;\n    cin>>n;\n    for(int i=0;i<n;i++){\n     cin>>a[i];\n    }\n    for(int i=0;i<n;i++)\n        cout<<6<<endl;\nreturn 0;\n},WRONG_ANSWER,12,440
1591082385838505984,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-11 22:56:16,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,import java.time.LocalDateTime;\n\npublic class Main{\n    public static void mian(String[] args){\n        LocalDateTime ldt = LocalDateTime.now();\n        System.out.println(ldt.getYear());\n    }\n},NON_ZERO_EXIT_CODE,83,15328
1591082463496048640,62c83306b4f5c482e4e9a52dc69ae0b8ee7b5238abb34e56352843a0d484ff2c,2022-11-11 22:56:34,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n long long int t,j,u=0;\n int isprime(int n);\n 2<=n<=10^5\n printf(\""请输入一个数：\"");\n scanf(\""%d\"",&t);\n for(j=1;j<=t;j++)\n {\n  if (isprime(j)==1) u++;\n }\n printf(\""从1到%d总共有%d个素数。\"",t,u);\n return 0;\n}\n\nint isprime(int n)\n{\n int i;\n if(n==2) return 1;\n else if(n==1||n%2==0) return 0;\n for (i=3;i<=sqrt(n)+1;i+=2)\n {\n  if(n%i==0) return 0;\n }\n return 1;\n}",COMPILE_ERROR,0,0
1591082488120807424,44042a4519c9231aa21c54eb113b7a08f98bcd7db4839a20a61ab6ce51fce357,2022-11-11 22:56:40,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    /*\n    int n;\n    int i;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=0;i<n;i++)\n    {\n        if(i==0)\n            scanf(\""%d\"",&a[i]);\n        else\n            scanf(\"" %d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if(i==0)\n        {\n            if(a[i]==0)\n                printf(\""1\"");\n            else\n                printf(\""6\"");\n        }\n        else\n        {\n            if(a[i]==0)\n                printf(\""\\n1\"");\n            else\n                printf(\""\\n6\"");\n        }\n\n    }\n    */\n    int m,i,j,k,n=0;\n    scanf(\""%d\"",&m);\n    for(i=2;i<=m;i++)\n    {\n        k=sqrt(m);\n        for(j=2;j<=k;j++)\n            if(i%j==0)\n                break;\n        if(j>k)\n            n++;\n    }\n    printf(\""%d\"",n);\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n    return 0;\n}\n",WRONG_ANSWER,12,184
1591082499277651968,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-11-11 22:56:43,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,count=0;\n    scanf(\""%d\"",&n);\n    n>=2&&n<=100000;\n        for(i=3;i<=n;i++)\n        {\n            if(n%i==0)\n            {\n                count++;\n                printf(\""%d\"",count);\n            }\n        }\n    return 0;\n}\n",WRONG_ANSWER,3,196
1591082507712401408,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-11 22:56:45,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,import java.time.LocalDateTime;\n\npublic class Main{\n    public static void mian(String[] args){\n        LocalDateTime ldt = LocalDateTime.now();\n        return ldt.getYear();\n    }\n},COMPILE_ERROR,0,0
1591082510057013248,b8a7ba8e6c41741e66a8153e5f137c86c8dba9c4dbb2f65f35d7554a5b082d56,2022-11-11 22:56:45,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,count=0,i,j;\n    scanf(\""%d\"",&n);\n   for(i=2;i<=n;i++)\n\t\t{\n\t\tfor(j=2;j<=i;j++)\n\t\t\tif(i%j==0)\n\t\t\t\tbreak;\n\t\tif(i==j)\n       count++;\n\t\t}\n    printf(\""%d\"",count);\n    return 0;\n}",ACCEPTED,951,380
1591082535638077440,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 22:56:52,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main() {\n\tint i,j,num;\n\tscanf(\""%d\"", &num);\n\tint arr1[100];\n\tfor(i = 0; i < num; ++i) \n\t\tscanf(\""%d\"", &arr1[i]);\n\tint arr2[100];\n\tfor(i = 0; i < num; ++i) \n\t\tscanf(\""%d\"", &arr2[i]);\n\tint max = 0;\n\tfor(j =0; j < num; j++) {\n\t\tint t = 0;\n\t\tfor(i = j; i < num; ++i) {\n\t\t\tt = t - arr1[i] + arr2[i];\n\t\t\tif(t > max) {\n\t\t\t\tmax = t;\n\t\t\t}\n\t\t}\n\t} \n\tprintf(\""%d\"", max);\t\n}",ACCEPTED,3,192
1591082638352388096,ef50cfe7f34b26d29f617c97ac65d40bd15ba1e063897a190284243de955e254,2022-11-11 22:57:16,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t    Scanner sc = new Scanner(System.in);\n\t    int n = sc.nextInt();\n\t    for (int i = 0; i < n; i++) {\n            int j = sc.nextInt();\n            if (j == 0) {\n                System.out.println(1);\n            } else {\n                System.out.println(6);\n            }\n        }\n\t}\n\t\n},NON_ZERO_EXIT_CODE,236,16896
1591082681398505472,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-11 22:57:26,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint a[10];\nint b[100000];\nint main(){\n    int n;\n    cin>>n;\n    for(int i=0;i<n;i++){\n     cin>>a[i];\n    }\n    for(int i=0;i<n;i++)\n        cout<<6<<endl;\nreturn 0;\n},WRONG_ANSWER,10,324
1591082697844391937,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-11-11 22:57:30,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#define N 100\n\nint main()\n{\n    int n,i,j;\n    int benefitMAX=0;\n    int a[N]={0},b[N]={0},c[N]={0};\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d \"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        c[i]=b[i]-a[i];\n    }\n    for(i=0;i<n;i++)\n    {\n        int nowbenefit=0;\n        for(j=i;j<n;j++)\n        {\n            nowbenefit+=c[j];\n            if(nowbenefit>benefitMAX)\n                benefitMAX=nowbenefit;\n        }\n    }\n    printf(\""%d\\n\"",benefitMAX);\n    return 0;\n}",ACCEPTED,4,308
1591082806950821888,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-11 22:57:56,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint a[10];\nint b[100000];\nint main(){\n    int n;\n    cin>>n<<endl;\n    for(int i=0;i<n;i++){\n     cin>>a[i];\n    }\n    for(int i=0;i<n;i++)\n        cout<<6<<endl;\nreturn 0;\n},COMPILE_ERROR,0,0
1591082859081826304,25584884fd716238437f89484285121d106c1090916ab683be624f210130ebad,2022-11-11 22:58:09,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint X,Y,Z;\n\tscanf(\""%d %d %d\"",&X,&Y,&Z);\n\tprintf(\""%d\"",X+Y-Z);\n\treturn 0;\n } ",ACCEPTED,7,344
1591082861900402688,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-11 22:58:09,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint a[10];\nint b[100000];\nint main(){\n    int n;\n    cin>>n>>endl;\n    for(int i=0;i<n;i++){\n     cin>>a[i];\n    }\n    for(int i=0;i<n;i++)\n        cout<<6<<endl;\nreturn 0;\n},COMPILE_ERROR,0,0
1591082936844226560,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-11 22:58:27,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,import java.time.LocalDateTime;\n\npublic class Main{\n    public static void mian(String[] args){\n        LocalDateTime ldt = LocalDateTime.now();\n        System.out.println(ldt.getYear());\n    }\n}\n,WRONG_ANSWER,94,15136
1591082945887121408,1b00b3d29099722d8332b35e3af5e54fda309b4f7c9fc6261f618ecd2a4d7390,2022-11-11 22:58:29,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int t,i,n;\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&n);\n        printf(\""%d\\n\"",(int)pow(6,n)%10);\n    }\n    return 0;\n}",WRONG_ANSWER,6,196
1591082948202401792,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-11 22:58:30,Python,300.0,1590681458522583040,1590675153003077632,1049226928954454016,n=int(input())\na=list(input().split())\nfor i in a:\n    if i=='0':\n        print(1)\n    else:\n        print(6)\n,ACCEPTED,48,2880
1591083053852725248,a57fdafe4877cd9608fc0ac8a5120a47bc60a015785960e61b67b4e66187c2f2,2022-11-11 22:58:55,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n#define N 100\nint main(){\n    int n,i=0,j=0,sum1,sum2=0;\n    int d=0,c=0;\n    int a[N],b[N];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&b[i]);\n    }\n    for(i=0;i<n;i++){\n        sum1=0;\n        for(j=i;j<n;j++){\n           d+=a[j];\n           c+=b[j];\n        }\n        sum1=c-d;\n    printf(\""%d\"",sum1);\n    if(sum2<sum1)\n        sum2=sum1;\n    }\n   //printf(\""%d\"",sum2);\n    return 0;\n}",WRONG_ANSWER,3,180
1591083105887236096,c39a4349139942a7aa7456b2c4609f8d0f9d0d3465be213d33870ec87eab1e58,2022-11-11 22:59:07,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    int n,i,j,s=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n    {\n        for(j=2;j<i;j++)\n        {\n            if(i%j!=0)\n                s++;\n             break;\n\n        }\n\n    }\n    printf(\""%d\"",s);\n}\n",WRONG_ANSWER,4,460
1591083129291452416,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-11 22:59:13,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint a[10];\nint b[100000];\nint main(){\n    int n;\n    cin>>n;\n    for(int i=0;i<n;i++){\n     cin>>a[i];\n    }\n    for(int i=0;i<n;i++)\n        cout<<6<<endl;\nreturn 0;\n},WRONG_ANSWER,12,444
1591083139433299968,356d4d261b0c273ed9edf9a21f22e4b180080ccba0f8bbfa0c58f889e1a800cc,2022-11-11 22:59:15,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""2022\\n\"");\n    return 0;\n}\n",ACCEPTED,2,184
1591083222077845504,42cfad7191c5e6c0eee156c4369182744d6c5db3bc2a5dc87f9f1be6ee4bbcfe,2022-11-11 22:59:35,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint sushu(int i)\n{\n\tint j=0;\n\tfor (j=2; j<i; j++)\n\t{\n\t\tif (i%j==0)\n\t\t\treturn 0;\n\t}\n\treturn 1;\n}\nint main()\n{\n\tint n=0,sum=0;\n\tscanf(\""%d\"", &n);\n\tint i=0;\n\tfor(i=2; i<=n;i++)\n\t{\n\t\tif(sushu(i))\n\t\tsum=sum+1;\n\t}\n\tprintf(\""%d\"",sum);\n\treturn 0;\n}",ACCEPTED,949,308
1591083340449517568,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-11 23:00:03,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"import java.time.LocalDateTime;\n\npublic class Main{\n    public static void mian(String[] args){\n        System.out.println(\""2022\"");\n    }\n}\n",NON_ZERO_EXIT_CODE,87,15156
1591083354991144960,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-11 23:00:07,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n    int i,j,t,n,a,b;\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++){\n    scanf(\""%d \"",&n);\n    if(0<=n<=pow(10,9)){\n    for(j=0;j<t;j++){\n    a=pow(6,n);\n    b=a%10;\n    printf(\""%d\\n\"",b);\n    }\n    }\n    return 0;\n}\n}\n",WRONG_ANSWER,8,308
1591083409156407296,ef50cfe7f34b26d29f617c97ac65d40bd15ba1e063897a190284243de955e254,2022-11-11 23:00:20,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t    Scanner sc = new Scanner(System.in);\n\t    int n = sc.nextInt();\n\t    for (int i = 0; i < n; i++) {\n            int j = sc.nextInt();\n            if (j == 0) {\n                System.out.println(\""1\"");\n            } else {\n                System.out.println(\""6\"");\n            }\n        }\n\t}\n\t\n}",WRONG_ANSWER,261,16472
1591083453817356288,eee658ba43cf6fba46676f4d9f167223fd9b57ec54a5d813fd1d01afc3088139,2022-11-11 23:00:30,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<math.h>\n#include <stdio.h>\nint main()\n{\n    int m,t,n;\n    scanf(\""%d\"",&t);\n    for(m=1;m<=t;m++)\n    {\n     scanf(\""%d\"",&n);\n     if(n==0)\n        printf(\""%d\\n\"",0);\n     else\n        printf(\""%d\\n\"",6);\n     }\n    return 0;\n}\n",WRONG_ANSWER,8,324
1591083518401253376,6b02dfcf297d52c2de2e1416b33ee988ff909834c73207b147423a8301e9d174,2022-11-11 23:00:46,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint mian()\n{   int a[2];\n int i,j;\n    for(i=0,i<3,i++)\n    {\n        scanf(\""%d\""a[i]);\n    }\n j=a[0]+a[1]-a[2];\n printf(\""%d\"",j);\n return 0;\n}",COMPILE_ERROR,0,0
1591083545030864896,da72e985b1ff1737d155282af7dd43e3dc341605cc356d114979edd4fea85a11,2022-11-11 23:00:52,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\nprintf(\""2022\"");\n}",ACCEPTED,3,188
1591083563125112832,0b3466ebddb2bdde378eee8b40d2037097b0a243d9ec4a6495316765e89853eb,2022-11-11 23:00:57,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"　#include<stdio.h>\n　void main()\n　{\n　　int year;\n　　printf(\""2022\\n\"");\n　}\n}\n",COMPILE_ERROR,0,0
1591083617743343616,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-11 23:01:10,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,import java.time.LocalDateTime;\n\npublic class Main{\n    public static void mian(String[] args){\n        new A().m1();\n    }\n}\n\nclass A{\n    public void m1(){\n        LocalDateTime ldt = LocalDateTime.now();\n        System.out.println(ldt.getYear());\n    }\n},WRONG_ANSWER,92,15288
1591083682587279360,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-11 23:01:25,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"import java.time.LocalDateTime;\n\npublic class Main{\n    public static void mian(String[] args){\n        new A().m1();\n    }\n}\n\nclass A{\n    public void m1(){\n        \n        System.out.println(\""2022\"");\n    }\n}",NON_ZERO_EXIT_CODE,84,15508
1591083765961658368,44042a4519c9231aa21c54eb113b7a08f98bcd7db4839a20a61ab6ce51fce357,2022-11-11 23:01:45,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    /*\n    int n;\n    int i;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=0;i<n;i++)\n    {\n        if(i==0)\n            scanf(\""%d\"",&a[i]);\n        else\n            scanf(\"" %d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if(i==0)\n        {\n            if(a[i]==0)\n                printf(\""1\"");\n            else\n                printf(\""6\"");\n        }\n        else\n        {\n            if(a[i]==0)\n                printf(\""\\n1\"");\n            else\n                printf(\""\\n6\"");\n        }\n\n    }\n    */\n    int m,i,j,k,n=0,flag=1;\n    scanf(\""%d\"",&m);\n    for(i=2;i<=m;i++)\n    {\n        k=sqrt(i);\n        for(j=2;j<=k;j++)\n            if(i%j==0)\n                break;\n        if(j>k)\n            n++;\n    }\n    printf(\""%d\"",n);\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n    return 0;\n}\n",ACCEPTED,15,340
1591083784387231744,da72e985b1ff1737d155282af7dd43e3dc341605cc356d114979edd4fea85a11,2022-11-11 23:01:49,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    if(X>=0&&X<=100&&Y>=0&&Y<=100&&Z>=0&&Z<=100)\n        printf(\""%d\"",X+Y-Z);\n}",ACCEPTED,6,344
1591083834576252928,80bb854046efddc8db8117414c5ff582f99d3347454c32f734c77c16dc462ed6,2022-11-11 23:02:01,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""2022\\n\"");\n    return 0;\n}\n",ACCEPTED,4,320
1591083843661135872,fbea21dbaf89f1b064feaa20227f21c5e1c4888fdc371cf5e43f70615906e52a,2022-11-11 23:02:03,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"n=int(input())\nnum=list(map(int,input().split()))\nfor i in range(n):\n    if num==0:\n        print(0)\n    else:\n        print(6)",WRONG_ANSWER,46,2876
1591083853744242688,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-11 23:02:06,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,import java.time.LocalDateTime;\n\npublic class Main{\n    public static void mian(String[] args){\n        new A().m1();\n    }\n}\n\nclass A{\n    public void m1(){\n        LocalDateTime ldt = LocalDateTime.now();\n        System.out.println(ldt.getYear());\n    }\n},NON_ZERO_EXIT_CODE,88,15036
1591083951488307200,ef50cfe7f34b26d29f617c97ac65d40bd15ba1e063897a190284243de955e254,2022-11-11 23:02:29,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t    Scanner sc = new Scanner(System.in);\n\t    long n = sc.nextInt();\n\t    for (int i = 0; i < n; i++) {\n            long j = sc.nextInt();\n            if (j == 0) {\n                System.out.println(\""1\"");\n            } else {\n                System.out.println(\""6\"");\n            }\n        }\n\t}\n\t\n}",WRONG_ANSWER,255,16396
1591084021025673216,ef50cfe7f34b26d29f617c97ac65d40bd15ba1e063897a190284243de955e254,2022-11-11 23:02:46,Java,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t    Scanner sc = new Scanner(System.in);\n\t    long n = sc.nextInt();\n\t    for (int i = 0; i < n; i++) {\n            long j = sc.nextLong();\n            if (j == 0) {\n                System.out.println(\""1\"");\n            } else {\n                System.out.println(\""6\"");\n            }\n        }\n\t}\n\t\n}",ACCEPTED,360,19508
1591084219407863808,da72e985b1ff1737d155282af7dd43e3dc341605cc356d114979edd4fea85a11,2022-11-11 23:03:33,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int t,i,n;\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++)\n       {\n\n      scanf(\""%d\"",&n);\n     if(n!=0)\n        printf(\""6\\n\"");\n    else\n        printf(\""1\\n\"");\n        }\n}\n",ACCEPTED,12,312
1591084246175887360,98901859b53edd496c40c4ba0469693a8e0ed685a8c2ca3d67a6cca01af154ef,2022-11-11 23:03:39,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    /*\n    int n;\n    int i;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=0;i<n;i++)\n    {\n        if(i==0)\n            scanf(\""%d\"",&a[i]);\n        else\n            scanf(\"" %d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if(i==0)\n        {\n            if(a[i]==0)\n                printf(\""1\"");\n            else\n                printf(\""6\"");\n        }\n        else\n        {\n            if(a[i]==0)\n                printf(\""\\n1\"");\n            else\n                printf(\""\\n6\"");\n        }\n\n    }\n    */\n    int m,i,j,k,n=0,flag=1;\n    scanf(\""%d\"",&m);\n    for(i=2;i<=m;i++)\n    {\n        k=sqrt(i);\n        for(j=2;j<=k;j++)\n            if(i%j==0)\n                break;\n        if(j>k)\n            n++;\n    }\n    printf(\""%d\"",n);\n    return 0;\n}\n",ACCEPTED,13,316
1591084277494755328,ef50cfe7f34b26d29f617c97ac65d40bd15ba1e063897a190284243de955e254,2022-11-11 23:03:47,Java,300.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t    Scanner sc = new Scanner(System.in);\n\t    long n = sc.nextInt();\n\t    for (int i = 0; i < n; i++) {\n            long j = sc.nextLong();\n            if (j == 0) {\n                System.out.println(1);\n            } else {\n                System.out.println(6);\n            }\n        }\n\t}\n\t\n},ACCEPTED,349,16956
1591084320968736768,98901859b53edd496c40c4ba0469693a8e0ed685a8c2ca3d67a6cca01af154ef,2022-11-11 23:03:57,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    /*\n    int n;\n    int i;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=0;i<n;i++)\n    {\n        if(i==0)\n            scanf(\""%d\"",&a[i]);\n        else\n            scanf(\"" %d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if(i==0)\n        {\n            if(a[i]==0)\n                printf(\""1\"");\n            else\n                printf(\""6\"");\n        }\n        else\n        {\n            if(a[i]==0)\n                printf(\""\\n1\"");\n            else\n                printf(\""\\n6\"");\n        }\n\n    }\n    */\n    int m,i,j,k,n=0,flag=1;\n    scanf(\""%d\"",&m);\n    for(i=2;i<=m;i++)\n    {\n        k=sqrt(i);\n        for(j=2;j<=k;j++)\n            if(i%j==0)\n                break;\n        if(j>k)\n            n++;\n    }\n    printf(\""%d\"",n);\n    return 0;\n}\n",ACCEPTED,12,196
1591084342221275136,da72e985b1ff1737d155282af7dd43e3dc341605cc356d114979edd4fea85a11,2022-11-11 23:04:02,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,i,j,k=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n       {\n           j=0;\n        for(j=2;j<sqrt(i*1.0);j++)\n            {\n                if(i%j==0)\n                {\n                    break;\n                }\n                }\n            if(j>sqrt(i*1.0))\n               {\n                   k++;\n               }\n                }\n    printf(\""%d\"",k);\n",COMPILE_ERROR,0,0
1591084357635346432,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-11 23:04:06,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,import java.time.LocalDateTime;\n\npublic class Main{\n    public static void mian(String[] args){\n        LocalDateTime ldt = LocalDateTime.now();\n        System.out.println(ldt.getYear());\n    }\n}\n,NON_ZERO_EXIT_CODE,91,18044
1591084365457698816,da72e985b1ff1737d155282af7dd43e3dc341605cc356d114979edd4fea85a11,2022-11-11 23:04:08,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,i,j,k=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n       {\n           j=0;\n        for(j=2;j<sqrt(i*1.0);j++)\n            {\n                if(i%j==0)\n                {\n                    break;\n                }\n                }\n            if(j>sqrt(i*1.0))\n               {\n                   k++;\n               }\n                }\n    printf(\""%d\"",k);\n}",ACCEPTED,14,332
1591084437851410432,ddd0edd80a23dfec88d0679f4ed6037779b80d26db4ba0f74fecb3d447de61fa,2022-11-11 23:04:25,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main(){\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n}",ACCEPTED,6,316
1591084454628622336,ef50cfe7f34b26d29f617c97ac65d40bd15ba1e063897a190284243de955e254,2022-11-11 23:04:29,Java,300.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t    Scanner sc = new Scanner(System.in);\n\t    long n = sc.nextInt();\n\t    for (int i = 0; i < n; i++) {\n            long j = sc.nextLong();\n            if (j == 0) {\n                System.out.println(1);\n            } else {\n                System.out.println(6);\n            }\n        }\n\t}\n\t\n},ACCEPTED,357,17080
1591084454779596800,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-11 23:04:29,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"import java.time.LocalDateTime;\n\npublic class Main{\n    public static void mian(String[] args){\n//         LocalDateTime ldt = LocalDateTime.now();\n//         System.out.println(ldt.getYear());\n        System.out.println(\""2022\"");\n    }\n}\n",NON_ZERO_EXIT_CODE,85,15512
1591084611487182848,da72e985b1ff1737d155282af7dd43e3dc341605cc356d114979edd4fea85a11,2022-11-11 23:05:06,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int n;\n    scanf(\""%d\"",&n);\n    int wi[n],wj[n],w[n];\n    int i,max=0,sum=0;\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&wi[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&wj[i]);\n\n    for(i=0;i<n;i++)\n        w[i]=wj[i]-wi[i];\n\n    for(i=0;i<n;i++)\n    {\n        sum+=w[i];\n        if(max<sum) max=sum;\n        if(sum<0) {\n            sum=0;\n            continue;\n        }\n    }",COMPILE_ERROR,0,0
1591084649038811136,ef50cfe7f34b26d29f617c97ac65d40bd15ba1e063897a190284243de955e254,2022-11-11 23:05:15,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t    Scanner sc = new Scanner(System.in);\n\t    int n = sc.nextInt();\n\t    for (int i = 0; i < n; i++) {\n            long j = sc.nextInt();\n            if (j == 0) {\n                System.out.println(1);\n            } else {\n                System.out.println(6);\n            }\n        }\n\t}\n\t\n},NON_ZERO_EXIT_CODE,227,16952
1591084681745993728,da72e985b1ff1737d155282af7dd43e3dc341605cc356d114979edd4fea85a11,2022-11-11 23:05:23,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main(){\n    int n;\n    scanf(\""%d\"",&n);\n    int wi[n],wj[n],w[n];\n    int i,max=0,sum=0;\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&wi[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&wj[i]);\n\n    for(i=0;i<n;i++)\n        w[i]=wj[i]-wi[i];\n\n    for(i=0;i<n;i++)\n    {\n        sum+=w[i];\n        if(max<sum) max=sum;\n        if(sum<0) {\n            sum=0;\n            continue;\n        }\n    }\n    printf(\""%d\"",max);\n}",ACCEPTED,3,192
1591084730433470464,64b76cc355daf11e96a19b338c58e56c05289d7e3809e9695a09e71771618713,2022-11-11 23:05:35,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n   int t,n,i,a,b;\n   scanf (\""%d\"",&t);\n   for(i=1;i<=t;i++)\n   {\n       scanf(\""%d\"",&n);\n       if(0<=n<=pow(10,9))\n       {\n           a=pow(6,n);\n           b=a/1%10;\n           printf (\""%d\\n\"",b);\n\n       }\n   }\n    return 0;\n}\n",WRONG_ANSWER,6,312
1591084775681622016,ef50cfe7f34b26d29f617c97ac65d40bd15ba1e063897a190284243de955e254,2022-11-11 23:05:46,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t    Scanner sc = new Scanner(System.in);\n\t    int n = sc.nextInt();\n\t    for (int i = 0; i < n; i++) {\n            int j = sc.nextInt();\n            if (j == 0) {\n                System.out.println(1);\n            } else {\n                System.out.println(6);\n            }\n        }\n\t}\n\t\n},WRONG_ANSWER,270,16420
1591084880274980864,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-11 23:06:11,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint a[10];\nint b[100000];\nint main(){\n    int n;\n    cin>>n;\n    for(int i=0;i<n;i++){\n     cin>>a[i];\n    }\n    for(int i=0;i<n;i++)\n        cout<<6<<endl;\nreturn 0;\n},WRONG_ANSWER,13,448
1591084891532472320,ef50cfe7f34b26d29f617c97ac65d40bd15ba1e063897a190284243de955e254,2022-11-11 23:06:13,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t    Scanner sc = new Scanner(System.in);\n\t    int n = sc.nextInt();\n\t    for (int i = 0; i < n; i++) {\n            long j = sc.nextInt();\n            if (j == 0) {\n                System.out.println(1);\n            } else {\n                System.out.println(6);\n            }\n        }\n\t}\n\t\n},WRONG_ANSWER,264,16660
1591084898549563392,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-11 23:06:15,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,import java.time.LocalDateTime;\n\npublic class Main{\n    public static void mian(String[] args){\n        LocalDateTime ldt = LocalDateTime.now();\n        System.out.println(ldt.getYear());\n    }\n}\nexit(0);,COMPILE_ERROR,0,0
1591084935736242176,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-11 23:06:24,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,import java.time.LocalDateTime;\n\npublic class Main{\n    public static void mian(String[] args){\n        LocalDateTime ldt = LocalDateTime.now();\n        System.out.println(ldt.getYear());\n        exit(0);\n    }\n},COMPILE_ERROR,0,0
1591085031907438592,1b00b3d29099722d8332b35e3af5e54fda309b4f7c9fc6261f618ecd2a4d7390,2022-11-11 23:06:47,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nvoid foo(unsigned int n)\n{\n    if (n == 0) {\n        printf(\""1\\n\"");\n        return;\n    }\n    for (unsigned int i = 1; i <= n; i++) {\n        printf(\""6\\n\"");\n    }\n}\n\nint main(int argc, const char * argv[]) {\n    // insert code here...\n    unsigned int n = 0;\n    int unused = 0;\n    scanf(\""%d\"", &n);\n    for (unsigned int i = 0; i < n; i++) {\n        scanf(\""%d\"", &unused);\n    }\n    foo(n);\n    return 0;\n}",WRONG_ANSWER,10,464
1591085070750912512,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-11 23:06:56,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\n#include<math.h>\nusing namespace std;\n\nint main(int argc, char* argv[])\n{\n    int n;\n\tcin>>n;\n    for(int i=0;i<n;i++){\n        if(i==n-1){\n            cout<<\""6\"";\n        }\n        else\n            cout<<\""6\""<<endl;\n    }\n\treturn 0;\n}",WRONG_ANSWER,10,444
1591085132084215808,c39a4349139942a7aa7456b2c4609f8d0f9d0d3465be213d33870ec87eab1e58,2022-11-11 23:07:11,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,q,j,s=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n    {\n        q=(int)sqrt((double)i);\n        for(j=2;j<=q;j++)\n            if(i%j==0)\n            break;\n        if(i>j)\n            s++;\n    }\n    printf(\""%d\"",s);\n}\n\n",WRONG_ANSWER,11,312
1591085218235219968,2abced548590476f918e32b0d5a4f88aa736e22ac158ed666b7778a0eaff5bae,2022-11-11 23:07:31,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main(){\n    int a,b,c;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    printf(\""%d\"",a+b-c);\n    return 0;\n}\n",ACCEPTED,6,328
1591085293426511872,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-11 23:07:49,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"// import java.time.LocalDateTime;\n\npublic class Main{\n    public static void mian(String[] args){\n//         LocalDateTime ldt = LocalDateTime.now();\n//         System.out.println(ldt.getYear());\n        System.out.println(\""2022\"");\n    }\n}",WRONG_ANSWER,94,15436
1591085341937831936,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-11 23:08:01,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,// import java.time.LocalDateTime;\n\npublic class Main{\n    public static void mian(String[] args){\n//         LocalDateTime ldt = LocalDateTime.now();\n//         System.out.println(ldt.getYear());\n        System.out.println(2022);\n    }\n},WRONG_ANSWER,92,14944
1591085359532937216,2abced548590476f918e32b0d5a4f88aa736e22ac158ed666b7778a0eaff5bae,2022-11-11 23:08:05,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n    int n,b,i=0;\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++){\n        scanf(\""%d\"",&b);\n\n        if(b)\n            printf(\""6\"");\n        else\n            printf(\""1\"");\n       if(n-i!=0)\n           printf(\""\\n\"");\n    }\n    return 0;\n}\n",ACCEPTED,12,472
1591085416529330176,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-11 23:08:18,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,// import java.time.LocalDateTime;\n\npublic class Main{\n    int a=2022;\n    public static void mian(String[] args){\n//         LocalDateTime ldt = LocalDateTime.now();\n//         System.out.println(ldt.getYear());\n        \n        System.out.println(a);\n    }\n},COMPILE_ERROR,0,0
1591085441107955712,20033d4bfe54ea16777c218f33d3af83aed121eb1b058daa8e84687ea80be80b,2022-11-11 23:08:24,Python,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"import math\nn=int(input())\nc=0\nfor i in range(2,n+1) :\n    temp=True\n    for j in range(2,math.floor(i**0.5)+1):\n        if i%j==0 :\n            temp=False\n            break\n    if temp :\n        c+=1\nprint(c)",ACCEPTED,249,2876
1591085446531166208,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-11 23:08:26,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint a[10];\nint b[100000];\nint main(){\n    int n;\n    cin>>n;\n    for(int i=0;i<n;i++){\n     cin>>a[i];\n    }\n    if(n==0)\n        cout<<0;\n    else{\n    for(int i=0;i<n;i++)\n        cout<<6<<endl;}\nreturn 0;\n},WRONG_ANSWER,13,472
1591085470107369472,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-11 23:08:31,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,// import java.time.LocalDateTime;\n\npublic class Main{\n    static int a=2022;\n    public static void mian(String[] args){\n//         LocalDateTime ldt = LocalDateTime.now();\n//         System.out.println(ldt.getYear());\n        \n        System.out.println(a);\n    }\n},WRONG_ANSWER,88,15160
1591085513895907328,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-11 23:08:42,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint a[10];\nint b[100000];\nint main(){\n    int n;\n    cin>>n;\n    for(int i=0;i<n;i++){\n     cin>>a[i];\n    }\n    if(n==0)\n        cout<<1;\n    else{\n    for(int i=0;i<n;i++)\n        cout<<6<<endl;}\nreturn 0;\n},WRONG_ANSWER,12,316
1591085528156536832,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-11 23:08:45,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"// import java.time.LocalDateTime;\n\npublic class Main{\n    public static void mian(String[] args){\n//         LocalDateTime ldt = LocalDateTime.now();\n//         System.out.println(ldt.getYear());\n        \n        System.out.println(\""2022\"");\n    }\n}",WRONG_ANSWER,94,15132
1591085558040932352,02f3cf9a5ba39e00e2644b9392922d3ea3ea233f83c612c7dbd879f319ea2bdc,2022-11-11 23:08:52,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int i,n,a[100],b[100],m,sum=0;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(i=0,m=0;i<n;i++)\n    {\n        if(b[i]>a[i])\n        {\n          m=(b[i]-a[i]);\n          sum=sum+m;\n\n        }\n    }\n     printf(\""%d\"",sum);\n    return 0;\n}\n",WRONG_ANSWER,3,188
1591085627590881280,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-11 23:09:09,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,import java.time.LocalDateTime;\n\npublic class Main{\n    public static void mian(String[] args){\n        LocalDateTime ldt = LocalDateTime.now();\n        System.out.println(ldt.getYear());\n    }\n},WRONG_ANSWER,94,14900
1591085635434229760,899c5501179552dc1fe5639f9047e15d0f835e7a87c8568193377882d0278985,2022-11-11 23:09:11,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,print(2022),ACCEPTED,15,2744
1591085655445278720,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 23:09:15,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(){\n  int c=0,n,i,j,max=0;\n  scanf(\""%d\"",&n);\n  int a[n],b[n];\n  for(i=0;i<n;++i)\n  {\n      scanf(\""%d\"",&a[i]);\n  }\n   for(i=0;i<n;++i)\n  {\n      scanf(\""%d\"",&b[i]);\n  }\nfor(j=0;j<n;j++)\n{for(i=j;i<n;++i)\n  {\n     c=c-a[i]+b[i];\n    if(c>max)\n    max=c;\n  }\n}\n  printf(\""%d\"",max);\n}\n",WRONG_ANSWER,4,180
1591085838904135680,0b3466ebddb2bdde378eee8b40d2037097b0a243d9ec4a6495316765e89853eb,2022-11-11 23:09:59,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"　#include<stdio.h>\n　void main()\n　{\n　　int year;\n　　printf(\""2022\\n\"");\n　}\n\n",COMPILE_ERROR,0,0
1591085894298284032,6cbd81921f92855c6b8318725b09ef7ec48ff579276b3df9f7ea04bea9804678,2022-11-11 23:10:12,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\nint n,i,j,m=0,x=0,y;\nscanf(\""%d\"",&n);\nint a[n],b[n],c[n];\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&a[i]);\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&b[i]);\nfor(i=0;i<n;i++)\n    c[i]=b[i]-a[i];\n\nfor(i=0;i<n;i++)\n{\n    for(j=0;j<n;j++)\n    {\n        m=m+c[j];\n        if(m>x)\n            x=m;\n    }\n}\nprintf(\""%d\\n\"",x);\nreturn 0;\n}\n",WRONG_ANSWER,4,320
1591085918717542400,ef50cfe7f34b26d29f617c97ac65d40bd15ba1e063897a190284243de955e254,2022-11-11 23:10:18,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t    Scanner sc = new Scanner(System.in);\n\t    int n = sc.nextInt();\n\t    for (int i = 0; i < n; i++) {\n            long j = sc.nextInt();\n            if (j == 0) {\n                System.out.println(1);\n            } else {\n                System.out.println(6);\n            }\n        }\n\t}\n\t\n},WRONG_ANSWER,256,16388
1591085935700258816,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-11-11 23:10:22,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,t=int(input())\nn=int(input())\nif n==0:\n    print('1')\nelse:\n   print('6')\n,NON_ZERO_EXIT_CODE,17,2820
1591085999906689024,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-11 23:10:37,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint a[10];\nint b[100000];\nint main(){\n    int n;\n    cin>>n;\n    for(int i=0;i<n;i++){\n     cin>>a[i];\n    }\n    for(int i=0;i<n;i++){\n        if(a[i]==0)\n            cout<<1<<endl;\n        else\n        cout<<6<<endl;}\nreturn 0;\n},WRONG_ANSWER,9,452
1591086055489601536,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-11 23:10:51,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"\n\npublic class Main{\n    public static void mian(String[] args){\n        \n        System.out.print(\""2022\"");\n    }\n}",NON_ZERO_EXIT_CODE,96,18112
1591086108648214528,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-11 23:11:03,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,import java.time.LocalDateTime;\n\npublic class Main{\n    public static void mian(String[] args){\n        LocalDateTime ldt = LocalDateTime.now();\n        System.out.print(ldt.getYear());\n    }\n},WRONG_ANSWER,87,15480
1591086158858203136,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-11 23:11:15,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"import java.time.LocalDateTime;\n\npublic class Main{\n    public static void mian(String[] args){\n        LocalDateTime ldt = LocalDateTime.now();\n        System.out.print(\""2022\"");\n    }\n}",NON_ZERO_EXIT_CODE,89,18416
1591086192752394240,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-11 23:11:23,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"// import java.time.LocalDateTime;\n\npublic class Main{\n    public static void mian(String[] args){\n        LocalDateTime ldt = LocalDateTime.now();\n        System.out.print(\""2022\"");\n    }\n}",COMPILE_ERROR,0,0
1591086229045706752,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-11 23:11:32,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"// import java.time.LocalDateTime;\n\npublic class Main{\n    public static void mian(String[] args){\n//         LocalDateTime ldt = LocalDateTime.now();\n        System.out.print(\""2022\"");\n    }\n}",WRONG_ANSWER,88,15456
1591086269919178752,eee658ba43cf6fba46676f4d9f167223fd9b57ec54a5d813fd1d01afc3088139,2022-11-11 23:11:42,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<math.h>\n#include <stdio.h>\nint main()\n{\n    int n,i,j,temp=0;\n    scanf(\""%d\"",&n);\n     for(i=2;i<=n;i++)\n      for(j=2;j<=i;j++)\n       if(i%j==0)\n       {\n        if(j>=i)\n         temp++;\n        else\n         break;\n       }\n    printf(\""%d\\n\"",temp);\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,1000,308
1591086404162097152,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-11 23:12:14,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,// import java.time.LocalDateTime;\n\npublic class Main{\n    static int a=2022;\n    public static void mian(String[] args){\n//         LocalDateTime ldt = LocalDateTime.now();\n        System.out.print(a);\n    }\n},NON_ZERO_EXIT_CODE,95,17404
1591086406624129024,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-11 23:12:14,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nll a[10];\nint b[100000];\nint main(){\n    int n;\n    cin>>n;\n    for(int i=0;i<n;i++){\n     cin>>a[i];\n    }\n    for(int i=0;i<n;i++){\n        if(a[i]==0)\n            cout<<1<<endl;\n        else\n        cout<<6<<endl;}\nreturn 0;\n},ACCEPTED,10,456
1591086408876494848,c39a4349139942a7aa7456b2c4609f8d0f9d0d3465be213d33870ec87eab1e58,2022-11-11 23:12:15,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(void)\n{\n    long long int t,j,u=0;\n    int isprime(int n);\n    scanf(%d,&t);\n    for(j=1;j<=t;j++)\n    {\n        if(isprime(j)==1)\n            u++;\n    }\n    printf(\""%d\"",u);\n}\nint isprime(int n)\n{\n    int i;\n    if(n==2)\n        return 1;\n    else if(n==1||n%2==0)\n        return 0;\n    for(i=3;i<sqrt(n)+1;i+=2)\n    {\n        if(n%i==0)\n            return 0;\n    }\n    return 1;\n}\n",COMPILE_ERROR,0,0
1591086435023761408,c39a4349139942a7aa7456b2c4609f8d0f9d0d3465be213d33870ec87eab1e58,2022-11-11 23:12:21,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(void)\n{\n    long long int t,j,u=0;\n    int isprime(int n);\n    scanf(%d,&t);\n    for(j=1;j<=t;j++)\n    {\n        if(isprime(j)==1)\n            u++;\n    }\n    printf(\""%d\"",u);\n}\nint isprime(int n)\n{\n    int i;\n    if(n==2)\n        return 1;\n    else if(n==1||n%2==0)\n        return 0;\n    for(i=3;i<sqrt(n)+1;i+=2)\n    {\n        if(n%i==0)\n            return 0;\n    }\n    return 1;\n}\n",COMPILE_ERROR,0,0
1591086566682963968,27fbb32d960dbf49665c8905b68012d602eda68987686c6f224ec7b49ca3d0ac,2022-11-11 23:12:53,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint i,j,k=0,n,flag;\n\tscanf(\""%d\"",&n);\n\tfor(i=2;i<=n;i++)\n\t{\n\tflag=0;\n\tfor(j=2;j<=sqrt(i);j++)\n\t{\n\t\tif(i%j==0)\n\t\t{\n\t\t\tflag=1;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif(flag==0)\n\t{\n\t\tk++;\n\t}\n\t\n\t}\n\tprintf(\""%d\"",k);\n    return 0;\n}",ACCEPTED,13,320
1591086655686094848,d9f0f29c0c2f6a52018e8ee93d686388c75950bcac327d0bebd2166a37f8dd26,2022-11-11 23:13:14,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""2022\"");\n}",ACCEPTED,3,192
1591086731682709504,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-11-11 23:13:32,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(){\n  int c=0,n,i,j,max=0;\n  scanf(\""%d\"",&n);\n  int a[n],b[n];\n  for(i=0;i<n;i++)\n  {\n      scanf(\""%d\"",&a[i]);\n  }\n   for(i=0;i<n;i++)\n  {\n      scanf(\""%d\"",&b[i]);\n  }\nfor(j=0;j<n;j++)\n{\n    c=0;\n    for(i=j;i<n;i++)\n  {\n     c=c-a[i]+b[i];\n    if(c>max)\n    max=c;\n  }\n}\n  printf(\""%d\"",max);\n}\n",ACCEPTED,4,308
1591086784312815616,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-11 23:13:45,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,// import java.time.LocalDateTime;\n\npublic class Main{\n    public static void mian(String[] args){\n//         LocalDateTime ldt = LocalDateTime.now();\n//         System.out.print(a);\n        new A ().m1();\n    }\n}\nclass A{\n    int a=2022;\n    public void m1(){\n        System.out.print(a);\n    }\n},NON_ZERO_EXIT_CODE,88,18216
1591086786170892288,c39a4349139942a7aa7456b2c4609f8d0f9d0d3465be213d33870ec87eab1e58,2022-11-11 23:13:45,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(void)\n{\n    long long int n,j,u=0;\n    int isprime(int x);\n    scanf(%d,&n);\n    for(j=1;j<=t;j++)\n    {\n        if(isprime(j)==1)\n            u++;\n    }\n    printf(\""%d\"",u);\n}\nint isprime(int x)\n{\n    int i;\n    if(x==2)\n        return 1;\n    else if(x==1||x%2==0)\n        return 0;\n    for(i=3;i<sqrt(x)+1;i+=2)\n    {\n        if(x%i==0)\n            return 0;\n    }\n    return 1;\n}\n",COMPILE_ERROR,0,0
1591086855561482240,69d2f3a9da1c135d111e69327883b4d96c284e9c1c71370cc330a44458f95ab4,2022-11-11 23:14:01,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdilb.h>\nint main()\n{\n\tint i,n,t,x;\n\tscanf(\""%d\"", &t);\nif(t>0)\n    printf(\""6\\n\"");\n    else\n        printf(\""1\\n\"")\n\treturn 0;\n}",COMPILE_ERROR,0,0
1591086860925992960,20ffd83467b553ac24e1f4b8b096d58858684ca8c3f6a4d5a62be9ff7c4817da,2022-11-11 23:14:03,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int i,j;\n    int t=0,h=0,x;\n    scanf(\""%d\"",&x);\n    for(i=2;i<=x;i++){\n        for(j=2;j<=i;j++){\n            if(i%j==0)\n                t++;\n        }\n        if(t==1){\n            h++;\n            t=0;\n        }\n        t=0;\n    }\n    printf(\""%d\\n\"",h);\n}\n\n",TIME_LIMIT_EXCEEDED,1000,352
1591086898112696320,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-11-11 23:14:12,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"\n#include<stdio.h>\n\nint main()\n{\n    int n,i,a;\n    scanf(\""%d\"",&n);\n    for(i=1;i<n;i++)\n    {\n        scanf(\""%d\"",&a);\n        if(a==0)\n            printf(\""1\\n\"");\n        else\n            printf(\""6\\n\"");\n    }\n    scanf(\""%d\"",&a);\n    if(a==0)\n        printf(\""1\"");\n    else\n        printf(\""6\"");\n    return 0;\n}",ACCEPTED,12,320
1591086900956430336,62c83306b4f5c482e4e9a52dc69ae0b8ee7b5238abb34e56352843a0d484ff2c,2022-11-11 23:14:12,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"def get_prime_list(n):\n    lst_num = list(range(2,n+1))\n    lst_prime = []\n    while lst_num:\n        m = lst_num.pop(0)\n        lst_prime.append(m)\n        i = 0\n        while i<len(lst_num):\n            if lst_num[i]%m == 0:\n                lst_num.pop(i)\n            else:\n                i+=1\n    return lst_prime\n\nif __name__ == '__main__':\n    n = int(input())\n    print(*get_prime_list(n))\nm = sum(*get_prime_list(n))\nprint(m)",TIME_LIMIT_EXCEEDED,1000,6332
1591086925564391424,27fbb32d960dbf49665c8905b68012d602eda68987686c6f224ec7b49ca3d0ac,2022-11-11 23:14:18,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint i,j,k=0,n,flag;\n\tscanf(\""%d\"",&n);\n\tfor(i=1;i<=n;i++)\n\t{\n\tflag=0;\n\tfor(j=2;j<=sqrt(i);j++)\n\t{\n\t\tif(i%j==0)\n\t\t{\n\t\t\tflag=1;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif(flag==0)\n\t{\n\t\tk++;\n\t}\n\t\n\t}\n\tprintf(\""%d\"",k-1);\n    return 0;\n}",ACCEPTED,16,356
1591086971500433408,69d2f3a9da1c135d111e69327883b4d96c284e9c1c71370cc330a44458f95ab4,2022-11-11 23:14:29,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdilb.h>\nint main()\n{\n\tint t;\n\tscanf(\""%d\"", &t);\nif(t>0)\n    printf(\""6/n\"");\n    else\n        printf(\""1/n\"")\n\treturn 0;\n}",COMPILE_ERROR,0,0
1591087037002878976,69d2f3a9da1c135d111e69327883b4d96c284e9c1c71370cc330a44458f95ab4,2022-11-11 23:14:45,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdilb.h>\nint main()\n{\n\tint t;\n\tscanf(\""%d\"", &t);\nif(t>0)\n    printf(\""6/n\"");\n    else\n        printf(\""1/n\"");\n\treturn 0;\n}",COMPILE_ERROR,0,0
1591087193890816000,62c83306b4f5c482e4e9a52dc69ae0b8ee7b5238abb34e56352843a0d484ff2c,2022-11-11 23:15:22,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,num = 6 ** n\nwhile num>0:\n    num = num%10\nprint(num),NON_ZERO_EXIT_CODE,16,2884
1591087328230158336,62c83306b4f5c482e4e9a52dc69ae0b8ee7b5238abb34e56352843a0d484ff2c,2022-11-11 23:15:54,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,num = 6 ** n\nwhile num>0:\n    num = num % 10\nprint(num),NON_ZERO_EXIT_CODE,17,2760
1591087430118191104,cb5ee28f5d61aba010f231fd6045de7f8516849eb1dbf293dc5a73a02c3aea2f,2022-11-11 23:16:18,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,t,i;\n    scanf(\""%d\\n\"",&t);\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&n);\n        if(n==0)\n            printf(\""1\\n\"");\n        else\n            printf(\""6\\n\"");\n        \n    }\n    \n}",ACCEPTED,9,352
1591087623500795904,c39a4349139942a7aa7456b2c4609f8d0f9d0d3465be213d33870ec87eab1e58,2022-11-11 23:17:05,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\nint n,i,j,t,l;\nint sum=0;\nscanf(\""%d\"",&n);\nl=n;\nfor(;n>=2;n--)\n{\nfor(i=2;i<n;i++)\n{\nif(n%i!=0)\nt=1;\nelse\n{\nt=2; \nbreak;\n}\n}\nif(t==1)\n{\nsum++;\n\n}\n}\nprintf(\""%d“sum); \nreturn 0;\n\n}",COMPILE_ERROR,0,0
1591087632627576832,899c5501179552dc1fe5639f9047e15d0f835e7a87c8568193377882d0278985,2022-11-11 23:17:07,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    result=X+Y-Z;\n    printf(\""%d\"",result);\n    return 0;\n}",COMPILE_ERROR,0,0
1591087634544373760,542d97133043a1f2156354473a31382c35bb2836688b0ed76eae59c52a2e0e3a,2022-11-11 23:17:07,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"# include <stdio.h>\nint number(int n)\n{\n    int i;\n    int k;\n    int num=0;\n    for(i=2;i<=n;++i )\n    {\n        for(k=2;k<i;++k)\n        {\n            if(i%k==0)\n                break;\n        }\n            if(k == i)\n            {\n                num=num+1;\n            }\n    }\n    return num;\n}\nint main ()\n{\n    int m,n;\n    scanf(\""%d\"",&n);\n    m=number(n);\n    printf(\""%d\\n\"",m);\n\n    return 0;\n}\n",ACCEPTED,923,356
1591087680199372800,69d2f3a9da1c135d111e69327883b4d96c284e9c1c71370cc330a44458f95ab4,2022-11-11 23:17:18,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdilb.h>\nint main()\n{\n\tint t,i,x;\n\tscanf(\""%d\"", &t);\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&x);\n    \n    \nif(x>0)\n    printf(\""6/n\"");\n    else\n                printf(\""1/n;}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1591087775905021952,6b02dfcf297d52c2de2e1416b33ee988ff909834c73207b147423a8301e9d174,2022-11-11 23:17:41,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{ int x,y,z;\n  scanf(\""%d %d %d\"",&x,&y,&z);\n printf(\""%d\"",x+y-z);\n return 0;\n}",ACCEPTED,8,312
1591087855638740992,69d2f3a9da1c135d111e69327883b4d96c284e9c1c71370cc330a44458f95ab4,2022-11-11 23:18:00,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdilb.h>\nint main()\n{\n\tint t,i,x;\n\tscanf(\""%d\"", &t);\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&x);\n    if(x>0)\n    printf(\""6/n\"");\n    else\n    printf(\""1/n”）；\n           }\n\treturn 0;\n}",COMPILE_ERROR,0,0
1591087888920547328,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-11 23:18:08,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"n=int(input())\ncount=0\nfor i in range (3,n):\n    for j in range (2,i):\n        if i%j==0:\n            break;\n    else:\n        count+=1\nprint(count+1)\n",TIME_LIMIT_EXCEEDED,1000,2912
1591087990393344000,fbea21dbaf89f1b064feaa20227f21c5e1c4888fdc371cf5e43f70615906e52a,2022-11-11 23:18:32,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"n=int(input())\nnum=list(map(int,input().split()))\nfor i in range(n):\n    x=6**int(num[i])\n    if x==0:\n        print(0)\n    else:\n        print(6)\n",TIME_LIMIT_EXCEEDED,165,4036
1591087995774636032,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-11 23:18:33,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,import java.time.LocalDateTime;\n\npublic class Main{\n    public static void mian(String[] args){\n        LocalDateTime ldt = LocalDateTime.now();\n        int a = ldt.getYear();\n        System.out.print(a);\n    }\n}\n,WRONG_ANSWER,93,15600
1591088103769550848,542d97133043a1f2156354473a31382c35bb2836688b0ed76eae59c52a2e0e3a,2022-11-11 23:18:59,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"# include <stdio.h>\nint number(int n)\n{\n    int i;\n    int k;\n    int num=0;\n    for(i=2;i<=n;i++)\n    {\n        for(k=2;k<i;k++)\n        {\n            if(i%k==0)\n                break;\n        }\n            if(k == i)\n            {\n                num=num+1;\n            }\n    }\n    return num;\n}\nint main ()\n{\n    int m,n;\n    scanf(\""%d\"",&n);\n    m=number(n);\n    printf(\""%d\\n\"",m);\n\n    return 0;\n}\n",ACCEPTED,946,348
1591088109431885824,899c5501179552dc1fe5639f9047e15d0f835e7a87c8568193377882d0278985,2022-11-11 23:19:00,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int X,Y,Z,result;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    result=X+Y-Z;\n    printf(\""%d\"",result);\n    return 0;\n}",ACCEPTED,6,200
1591088165748805632,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-11 23:19:14,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"n=int(input())\ncount=0\nfor i in range (3,n):\n    for j in range (2,i):\n        if i%j==0:\n            break;\n    else:\n        count+=1\nprint(count+1)\n",TIME_LIMIT_EXCEEDED,1000,3292
1591088188007952384,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-11 23:19:19,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,import java.time.LocalDateTime;\n\npublic class Main{\n    public static void mian(String[] args){\n        LocalDateTime ldt = LocalDateTime.now();\n        System.out.print(ldt.getYear());\n    }\n}\n,NON_ZERO_EXIT_CODE,89,15472
1591088318337560576,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-11-11 23:19:50,Python,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"t=int(input())\nn=list(map(int,input().split()))\nfor i in range(0,t):\n    if n[i]==0:\n        print('1')\n    else:\n        print('6')",ACCEPTED,46,2756
1591088368627286016,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-11 23:20:02,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(){\n\n    int n,sum=0,a=0,i,j,m;\n    scanf(\""%d\"",&n);\n    for( j=1;j<=n;j++){\n            m=sqrt(j);\n    for( i=2;i<sqrt(j);i++){\n        if(j%i==0) break;\n    }\n      if(i>m) ++sum;\n      //  a=0;\n    }\n    printf(\""%d\"",sum-1);\n}\n",ACCEPTED,14,200
1591088493873401856,fbea21dbaf89f1b064feaa20227f21c5e1c4888fdc371cf5e43f70615906e52a,2022-11-11 23:20:32,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"t=int(input())\nn=list(map(int,input().split()))\nfor i in range(t):\n    x=6**int(num[i])\n    if x==0:\n        print(0)\n    else:\n        print(6)\n",NON_ZERO_EXIT_CODE,15,2760
1591088563670810624,d9f0f29c0c2f6a52018e8ee93d686388c75950bcac327d0bebd2166a37f8dd26,2022-11-11 23:20:49,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,b,c,d;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    printf(\""%d\"",a+b-c);\n}",ACCEPTED,6,332
1591088621359247360,d9f0f29c0c2f6a52018e8ee93d686388c75950bcac327d0bebd2166a37f8dd26,2022-11-11 23:21:02,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,b,c;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    printf(\""%d\"",a+b-c);\n}",ACCEPTED,6,320
1591088665449771008,69d2f3a9da1c135d111e69327883b4d96c284e9c1c71370cc330a44458f95ab4,2022-11-11 23:21:13,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint t, i, x;\n\tscanf(\""%d\"", &t);\n\tfor (i = 0; i<t; i++)\n\t{\n\t\tscanf(\""%d\"", &x);\n\t\tif (x>0)\n\t\t\tprintf(\""6\\n\"");\n\t\telse\n\t\t\tprintf(\""1\\n”\"");\n\t}\n\treturn 0;\n}",WRONG_ANSWER,7,316
1591088731208093696,69d2f3a9da1c135d111e69327883b4d96c284e9c1c71370cc330a44458f95ab4,2022-11-11 23:21:29,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint t, i, x;\n\tscanf(\""%d\"", &t);\n\tfor (i = 0; i<t; i++)\n\t{\n\t\tscanf(\""%d\"", &x);\n\t\tif (x>0)\n\t\t\tprintf(\""6\\n\"");\n\t\telse\n\t\t\tprintf(\""1\\n”\"");\n\t}\n\treturn 0;\n}",WRONG_ANSWER,6,344
1591088781732655104,1b00b3d29099722d8332b35e3af5e54fda309b4f7c9fc6261f618ecd2a4d7390,2022-11-11 23:21:41,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nvoid foo(unsigned int n)\n{\n    if (n == 0) {\n        printf(\""1\\n\"");\n        return;\n    }\n    for (unsigned int i = 1; i <= n; i++) {\n        printf(\""6\\n\"");\n    }\n}\n\nint main(int argc, const char * argv[]) {\n    // insert code here...\n    int t = 0;\n    int t1[10000] = {0};\n    int num = 0;\n    scanf(\""%d\"", &t);\n    for (int i = 0; i < t; i++) {\n        scanf(\""%d\"", &num);\n        if (num == 0) {\n            t1[i] = 1;\n        }\n    }\n    for (int i = 0; i < t; i++) {\n        if (t1[i] == 1) {\n            printf(\""1\\n\"");\n        } else {\n            printf(\""6\\n\"");\n        }\n    }\n    return 0;\n}",ACCEPTED,9,340
1591088921092620288,d21dc339d37b0772b2547441444d4b660b000ac3ebe190aee01769e2dd619c10,2022-11-11 23:22:14,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"int main()\n{\n    int i,j,n;\n    int sum=0,max=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n        for(i=0;i<n;i++)\n            c[i]=b[i]-a[i];\n    for(i=0;i<n;i++)\n    {\n        for(j=i;j<n;j++)\n        {\n        sum=sum+c[j];\n        if(sum>max)\n            max=sum;\n        }\n    }\n    printf(\""%d\"",max);\n}\n\n",WRONG_ANSWER,4,308
1591088936263417856,dcc1017bcd698bd6a0eee54e4ed848d4c51a3a26608990cdd2137e4c01065a1e,2022-11-11 23:22:18,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main (){\n    int geshu,i,j,num=168;\n    scanf(\""%d\"",&geshu);\n    for(i=2;i<geshu;i++){\n        for(j=2;j<geshu;j++){\n            if(j%geshu==0){break;}\n          \n        }\n    }\n   printf(\""%d\\n\"",num);\n    return 0;\n}",WRONG_ANSWER,3,312
1591089017167351808,c39a4349139942a7aa7456b2c4609f8d0f9d0d3465be213d33870ec87eab1e58,2022-11-11 23:22:37,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\nint n,i;\nint sum=0;\nscanf(\""%d\"",&n);\nfor(;n>=2;n--)\n{\nfor(i=2;i<n;i++)\nif(n%i!=0)\n    sum++;\n}\n    printf(\""%d\"",sum);\n}\n",TIME_LIMIT_EXCEEDED,1000,436
1591089023593000960,fbea21dbaf89f1b064feaa20227f21c5e1c4888fdc371cf5e43f70615906e52a,2022-11-11 23:22:38,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"t=int(input())\nn=list(map(int,input().split()))\nfor i in range(t):\n    x=6**int(n[i])\n    if x==0:\n        print(0)\n    else:\n        print(6)\n",TIME_LIMIT_EXCEEDED,165,4088
1591089093067452416,7c63eda0500ff4ce8e233e8b789a4fb856ab6eaf0844db7a6a5f358c4d420a7c,2022-11-11 23:22:55,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    printf(\""2022\\n\"");\nreturn 0;        \n}",ACCEPTED,3,316
1591089109500755968,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-11 23:22:59,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"n=int(input())\ncount=0\nfor i in range (3,n,2):\n    for j in range (2,i):\n        if i%j==0:\n            break;\n    else:\n        count+=1\nprint(count+1)\n",TIME_LIMIT_EXCEEDED,1000,2988
1591089190194970624,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-11 23:23:18,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,import java.time.LocalDateTime;\n\npublic class Main{\n    public static void mian(String[] args){\n        LocalDateTime ldt = LocalDateTime.now();\n        System.out.print(ldt.getYear());\n    }\n}\n,WRONG_ANSWER,90,15296
1591089245417177088,ddd0edd80a23dfec88d0679f4ed6037779b80d26db4ba0f74fecb3d447de61fa,2022-11-11 23:23:31,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n    int n,sum,F,G;\n    scanf(\""%d\"",&n);\n    while(n){\n        scanf(\""%d\"",&sum);\n        G=pow(6,sum);\n        G=G%10;\n        printf(\""%d\\n\"",G);\n        n--;\n    }\n    return 0;\n}",WRONG_ANSWER,7,312
1591089374916313088,fbea21dbaf89f1b064feaa20227f21c5e1c4888fdc371cf5e43f70615906e52a,2022-11-11 23:24:02,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"t=int(input())\nn=list(map(int,input().split()))\nfor i in range(t):\n    x=n[i]\n    if x==0:\n        print(0)\n    else:\n        print(6)\n",WRONG_ANSWER,45,2756
1591089496458858496,62c83306b4f5c482e4e9a52dc69ae0b8ee7b5238abb34e56352843a0d484ff2c,2022-11-11 23:24:31,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,num = 6 ** n\ns_num = str(num)\nunti = int(s_num[-1]),NON_ZERO_EXIT_CODE,16,2756
1591089548967325696,eee658ba43cf6fba46676f4d9f167223fd9b57ec54a5d813fd1d01afc3088139,2022-11-11 23:24:44,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<math.h>\n#include <stdio.h>\nint main()\n{\n    int n,i,j,temp=0;\n    scanf(\""%d\"",&n);\n     for(i=2;i<=n;i++)\n     {\n      for(j=2;j<=i;j++)\n         if(i%j==0)\n            break;\n         if(j>=i)\n            temp++;\n     }\n    printf(\""%d\\n\"",temp);\n    return 0;\n}\n\n",ACCEPTED,919,324
1591089555392999424,69d2f3a9da1c135d111e69327883b4d96c284e9c1c71370cc330a44458f95ab4,2022-11-11 23:24:45,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint t, i, x;\n\tscanf(\""%d\"", &t);\n\tfor (i = 0; i<t; i++)\n\t{\n\t\tscanf(\""%d\"", &x);\n\t\tif (x=0)\n\t\t\tprintf(\""1\\n\"");\n\t\telse\n\t\t\tprintf(\""6\\n”\"");\n\t}\n\treturn 0;\n}",WRONG_ANSWER,4,192
1591089556882001920,ddd0edd80a23dfec88d0679f4ed6037779b80d26db4ba0f74fecb3d447de61fa,2022-11-11 23:24:46,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n    int n,sum,F,G;\n    scanf(\""%d\"",&n);\n    while(n){\n        scanf(\""%d\"",&sum);\n        G=pow(6,sum);\n        G=G%10;\n        printf(\""%d\"",G);\n        if(n!=1){\n            printf(\""\\n\"");\n        }\n        n--;\n    }\n    return 0;\n}",WRONG_ANSWER,6,440
1591089768153264128,d21dc339d37b0772b2547441444d4b660b000ac3ebe190aee01769e2dd619c10,2022-11-11 23:25:36,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"int main()\n{\n    int i,j,n;\n    int sum=0,max=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n        for(i=0;i<n;i++)\n            c[i]=b[i]-a[i];\n    for(i=0;i<n;i++)\n    {\n        for(j=i;j<n;j++)\n        {\n        sum=sum+c[j];\n        if(sum>max)\n            max=sum;\n        if (sum<0)\n            sum=0;\n        }\n    }\n    printf(\""%d\"",max);\n}\n\n",WRONG_ANSWER,3,320
1591089808498294784,356d4d261b0c273ed9edf9a21f22e4b180080ccba0f8bbfa0c58f889e1a800cc,2022-11-11 23:25:46,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z;\n    printf(\""输入三个数:\"");\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    printf(\""X+Y-Z=%d\"",X+Y-Z);\n    return 0;\n}",WRONG_ANSWER,3,192
1591089810566066176,62c83306b4f5c482e4e9a52dc69ae0b8ee7b5238abb34e56352843a0d484ff2c,2022-11-11 23:25:46,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,num = 6 ** n\ns_num = str(num)\nunti = int(s_num[-1]),NON_ZERO_EXIT_CODE,17,2756
1591089955491876864,20033d4bfe54ea16777c218f33d3af83aed121eb1b058daa8e84687ea80be80b,2022-11-11 23:26:21,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int max=0,n,i,j,m,sum=0;\n scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    \n    for(i=0;i<n;i++)\n    {sum=0;\n        for(j=i;j<n;j++)\n        {\n        m=b[j]-a[j];\n           sum+=m;\n       if(sum>=max)\n       {   \n           max=sum;\n       }\n        }\n    }\n    printf(\""%d\\n\"",max);\n    \n    return 0;\n}",ACCEPTED,3,200
1591090089961259008,d21dc339d37b0772b2547441444d4b660b000ac3ebe190aee01769e2dd619c10,2022-11-11 23:26:53,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"int main()\n{\n    int i,j,n;\n    int sum=0,max=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n        for(i=0;i<n;i++)\n            c[i]=b[i]-a[i];\n    for(i=0;i<n;i++)\n    {\n        for(j=i;j<n;j++)\n        {\n        sum=sum+c[j];\n        if(sum>max)\n            max=sum;\n        if (sum<0)\n            sum=0;\n        }\n    }\n    printf(\""%d\\n\"",max);\n}\n\n",WRONG_ANSWER,4,312
1591090400377503744,d21dc339d37b0772b2547441444d4b660b000ac3ebe190aee01769e2dd619c10,2022-11-11 23:28:07,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"int main()\n{\n    int i,j,n;\n    int sum=0,max=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n        for(i=0;i<n;i++)\n            c[i]=b[i]-a[i];\n    for(i=0;i<n;i++)\n    {\n        for(j=i;j<n;j++)\n        {\n        sum=sum+c[j];\n        if(sum>max)\n            max=sum;\n        if (sum<0)\n            sum=0;\n        }\n    }\n    printf(\""%d\\n\"",max);\n    return 0;\n}\n\n",WRONG_ANSWER,4,320
1591090468585279488,217f1946625720e554af7294d3599b943eea3b430c0df7aa0c5c70abe9904e56,2022-11-11 23:28:23,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.*;\npublic class Main {\n    public static void main(String[] args) {\n        int count=0;\n        Scanner input = new Scanner(System.in);\n        int n = input.nextInt();\n        for (int i = 2; i <= n; i++)\n        {\n            int j=2;\n            while (i % j != 0) {\n                j++; \n            }\n            if (j == i){\n                count++;\n            }\n        }\n        System.out.println(count);\n    }\n},TIME_LIMIT_EXCEEDED,1000,16696
1591090489305141248,d5db2853d0fce01dd43b2b6adf379841403b78fda0e6cb22c82f6f2b59da60dc,2022-11-11 23:28:28,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h> \nmain(){\n\tlong int n,m,i,s[10];\n\tscanf(\""%ld\"",&m);\n\tif(m>=0&&m<=1000000000){\n\t\tfor(i=0;i<m;i++){\n\t\t\tscanf(\""%ld\"",&n);\n\t\t\ts[i]=pow(6,n);\n\t\t}\n\t\tfor(i=0;i<m;i++){\n\t\t\tprintf(\""%d\"",s[i]%10);\n\t\t\tif(i<m-1) printf(\""\\n\"");\n\t\t} \n\t}\n\n\t\t\n\t\n\treturn 0;\n}",WRONG_ANSWER,7,324
1591090637330518016,5c1ff147303fd43738d51172d4d1fe197154431fc6a4db18bbf58c05c2009330,2022-11-11 23:29:03,Java,0.0,1590524835191705600,1572865591226855424,1049226928954454016,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            int c = in.nextInt()\n            System.out.println(a + b -c);\n        }\n    }\n},COMPILE_ERROR,0,0
1591090670419378176,5c1ff147303fd43738d51172d4d1fe197154431fc6a4db18bbf58c05c2009330,2022-11-11 23:29:11,Java,300.0,1590524835191705600,1572865591226855424,1049226928954454016,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            int c = in.nextInt();\n            System.out.println(a + b -c);\n        }\n    }\n},ACCEPTED,238,16676
1591090813998796800,d5db2853d0fce01dd43b2b6adf379841403b78fda0e6cb22c82f6f2b59da60dc,2022-11-11 23:29:45,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h> \nmain(){\n\tlong int n,m,i,s[10];\n\tscanf(\""%ld\"",&m);\n\tif(m>=0&&m<=1000000000){\n\t\tfor(i=0;i<m;i++){\n\t\t\tscanf(\""%ld\"",&n);\n\t\t\ts[i]=pow(6,n);\n\t\t}\n\t\tfor(i=0;i<m;i++){\n\t\t\tprintf(\""%ld\"",s[i]%10);\n\t\t\tif(i<m-1) printf(\""\\n\"");\n\t\t} \n\t}\n\treturn 0;\n}",WRONG_ANSWER,6,356
1591090861880971264,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 23:29:57,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    int n,i,j;\n    int x=0,y=0;\n    scanf(\""%d\"",n);\n    int a[n],b,[n],c[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        c[i]=b[i]-a[i];\n    }\n    for(i=0;i<n;i++)\n    {\n        for(j=i;j<n;j++)\n        {\n            y+=c[j];\n            if(y>x)\n                x=y;\n        }\n    }\n    printf(\""%d\\n\"",x);\n}",COMPILE_ERROR,0,0
1591090869527183360,c39a4349139942a7aa7456b2c4609f8d0f9d0d3465be213d33870ec87eab1e58,2022-11-11 23:29:58,C++,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tint n,f;\n\tcin >> n;\n\tint cnt = 0;\n\t\tfor (int i = 2; i <= n; i++)\n\t\t{\n\t\t\tf=1;\n\t\t\tfor(int j = 2; j <=sqrt(i); j++)\n\t\t\t{\n\t\t\t\tif(i%j==0){\n\t\t\t\t\tf=0;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(f){\n\t\t\t//cout << i << endl ;\n\t\t\tcnt++;\n\t\t\t}\n\t\t}\n\tcout << cnt<< endl;\n\treturn 0;\n}\n",ACCEPTED,15,436
1591090965190873088,d5db2853d0fce01dd43b2b6adf379841403b78fda0e6cb22c82f6f2b59da60dc,2022-11-11 23:30:21,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h> \nint main(void){\n\tlong int n,m,i,s[10];\n\tscanf(\""%ld\"",&m);\n\tif(m>=0&&m<=1000000000){\n\t\tfor(i=0;i<m;i++){\n\t\t\tscanf(\""%ld\"",&n);\n\t\t\ts[i]=pow(6,n);\n\t\t}\n\t\tfor(i=0;i<m;i++){\n\t\t\tprintf(\""%ld\"",s[i]%10);\n\t\t\tif(i<m-1) printf(\""\\n\"");\n\t\t} \n\t}\n\treturn 0;\n}",WRONG_ANSWER,8,564
1591090968139444224,c39a4349139942a7aa7456b2c4609f8d0f9d0d3465be213d33870ec87eab1e58,2022-11-11 23:30:22,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main()\n{\n    int N;\n    cin>>N;\n    for(int i=0;i<N;i++)\n    {\n        int n=10;\n        int a[n];\n        int x1,x2;\n        cin>>x1;\n        x2=x1%10;\n        a[0]=x2;\n        int count;\n        int remain;\n        for(int i=1;;i++)\n        {\n            a[i]=(a[i-1]*x2)%10;\n            if(a[i]==a[0])\n            {\n                countpi;\n                break;\n            }\n        }\n        remain=x1%count;\n        if(remain)\n            cout<<a[remain-1]<<end1;\n        else\n            cout<<a[count-1]<<end1;\n    }\n}",COMPILE_ERROR,0,0
1591090984404955136,d5db2853d0fce01dd43b2b6adf379841403b78fda0e6cb22c82f6f2b59da60dc,2022-11-11 23:30:26,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h> \nint main(void){\n\tlong int n,m,i,s[10];\n\tscanf(\""%ld\"",&m);\n\tif(m>=0&&m<=1000000000){\n\t\tfor(i=0;i<m;i++){\n\t\t\tscanf(\""%ld\"",&n);\n\t\t\ts[i]=pow(6,n);\n\t\t}\n\t\tfor(i=0;i<m;i++){\n\t\t\tprintf(\""%ld\"",s[i]%10);\n\t\t\tif(i<m-1) printf(\""\\n\"");\n\t\t} \n\t}\n\treturn 0;\n}",WRONG_ANSWER,8,348
1591091019066707968,d9f0f29c0c2f6a52018e8ee93d686388c75950bcac327d0bebd2166a37f8dd26,2022-11-11 23:30:34,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,b=0,i,j;\n    scanf(\""%d\"",&a);\n    for(i=2;i<=a;i++)\n    {\n        for(j=2;j<=i;j++)\n        {\n            if(i%j==0)\n                break;\n        }\n        if(i==j)\n            b++;\n    }\n    printf(\""%d\"",b);\n}",ACCEPTED,932,308
1591091039438417920,13eac09c9e523ec396926840225e626f8fff54ca0e8a92e46e533705daa83ac2,2022-11-11 23:30:39,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,b;\n    int i;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b);\n        if(b==0)\n            printf(\""%d\\n\"",1);\n        else\n            printf(\""%d\\n\"",6);\n    }\n    return 0;\n}\n",ACCEPTED,9,320
1591091076134383616,dcc1017bcd698bd6a0eee54e4ed848d4c51a3a26608990cdd2137e4c01065a1e,2022-11-11 23:30:48,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nvoid main()\n{\n\tint a,i,j;\n    int num=0;\n\tscanf(\""%d\"",&a);\n\tfor(i=2;i<=a;i++)\n\t\t{\n\t\tfor(j=2;j<=i;j++)\n\t\t\tif(i%j==0)\n\t\t\t\tbreak;\n\t\tif(i==j)\n\t\t\tnum++;\n\t\t}\n    printf(\""%d\\n\"",num);\n}",ACCEPTED,908,324
1591091147441766400,d5db2853d0fce01dd43b2b6adf379841403b78fda0e6cb22c82f6f2b59da60dc,2022-11-11 23:31:05,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h> \nint main(void){\n\tlong int n,m,i,s[10];\n\tscanf(\""%ld\"",&m);\n\tif(m>=0&&m<=1000000000){\n\t\tfor(i=0;i<m;i++){\n\t\t\tscanf(\""%ld\"",&n);\n\t\t\ts[i]=pow(6,n);\n\t\t}\n\t\tfor(i=0;i<m;i++){\n\t\t\tprintf(\""%ld\"",s[i]%10);\n\t\t\tif(i<m-1) printf(\""\\n\"");\n\t\t} \n\t}\n\treturn 0;\n}",WRONG_ANSWER,6,456
1591091312936419328,25584884fd716238437f89484285121d106c1090916ab683be624f210130ebad,2022-11-11 23:31:44,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,i,j,count,flag,k;\n    scanf(\""%d\"",&n);\n    k=(int)sqrt(i);\n    count=0;\n    for (i=2;i<= n;i++){\n        flag=1;\n       for(j=2;j<=k;j++){\n         if(i%j==0){\n             flag=0;\n             break;\n          }\n       }\n        if(flag==1)\n            count++;\n    }\n    printf(\""%d\"",count);\n    return 0;\n}\n",WRONG_ANSWER,3,180
1591091331546546176,ddd0edd80a23dfec88d0679f4ed6037779b80d26db4ba0f74fecb3d447de61fa,2022-11-11 23:31:49,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n    int n,sum,G;\n    scanf(\""%d\"",&n);\n    while(n){\n        scanf(\""%d\"",&sum);\n        G=sum/sum*6;\n        printf(\""%d\"",G);\n        if(n!=1){\n            printf(\""\\n\"");\n        }\n        n--;\n    }\n    return 0;\n}",FLOAT_POINT_EXCEPTION,8,324
1591091349615607808,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 23:31:53,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    int n,i,j;\n    int x=0,y=0;\n    scanf(\""%d\"",n);\n    int a[n],b,[n],c[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        c[i]=b[i]-a[i];\n    }\n    for(i=0;i<n;i++)\n    {\n        for(j=i;j<n;j++)\n        {\n            y+=c[j];\n            if(y>x)\n                x=y;\n        }\n    }\n    printf(\""%d\\n\"",x);\n}",COMPILE_ERROR,0,0
1591091351507218432,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 23:31:53,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint n,i,j;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor( i=0;i<n;i++)\n\t\tscanf(\""%d\"",&a[i]);\n\tfor(j=0;j<n;j++)\n\t{\n\t\n\t\tif(a[j]==0)\n\t\tprintf(\""6\"");\n\t\telse printf(\""1\\n\"");\n\t} \t\n\treturn 0;\n}\n",WRONG_ANSWER,3,312
1591091379185430528,13616e85f216dd3844293b46f4b46105a0a2c458f7807a7b677858feb35cb63a,2022-11-11 23:32:00,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\nint main()\n{\n    int max=0,n,i,j,m,sum=0;\n scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    \n    for(i=0;i<n;i++)\n    {sum=0;\n        for(j=i;j<n;j++)\n        {\n        m=b[j]-a[j];\n           sum+=m;\n       if(sum>=max)\n       {   \n           max=sum;\n       }\n        }\n    }\n    printf(\""%d\\n\"",max);\n    \n    return 0;\n}\n",ACCEPTED,4,320
1591091403948625920,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 23:32:06,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    int n,i,j;\n    int x=0,y=0;\n    scanf(\""%d\"",n);\n    int a[n],b[n],c[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        c[i]=b[i]-a[i];\n    }\n    for(i=0;i<n;i++)\n    {\n        for(j=i;j<n;j++)\n        {\n            y+=c[j];\n            if(y>x)\n                x=y;\n        }\n    }\n    printf(\""%d\\n\"",x);\n}",SEGMENTATION_FAULT,3,324
1591091450169831424,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 23:32:17,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint n,i,j;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor( i=0;i<n;i++)\n\t\tscanf(\""%d\"",&a[i]);\n\tfor(j=0;j<n;j++)\n\t{\n\t\n\t\tif(a[j]==0)\n\t\tprintf(\""6\\n\"");\n\t\telse printf(\""1\\n\"");\n\t} \t\n\treturn 0;\n}\n",WRONG_ANSWER,3,188
1591091491265646592,b8a7ba8e6c41741e66a8153e5f137c86c8dba9c4dbb2f65f35d7554a5b082d56,2022-11-11 23:32:27,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,b[100],c[100],i,m,sum=0;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++)\n        scanf(\""%d\"",&b[i]);\n      for(i=0;i<a;i++)\n        scanf(\""%d\"",&c[i]);\n      for(i=0;i<a;i++)\n      {\n          if(c[i]<b[i])\n         break;\n          else m=c[i]-b[i];\n          sum=sum+m;\n      }\n    printf(\""%d\"",sum);\n    return 0;\n    \n} ",WRONG_ANSWER,3,180
1591091500262428672,62c83306b4f5c482e4e9a52dc69ae0b8ee7b5238abb34e56352843a0d484ff2c,2022-11-11 23:32:29,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,num = 6 ** 3\ns_num = str(num)\nunti = int(s_num[-1])\n\nnum = 6 ** 5\ns_num = str(num)\nunti = int(s_num[-1])\n\nnum = 6 ** 7\ns_num = str(num)\nunti = int(s_num[-1]),WRONG_ANSWER,16,2744
1591091706525716480,217f1946625720e554af7294d3599b943eea3b430c0df7aa0c5c70abe9904e56,2022-11-11 23:33:18,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.*;\npublic class Main {\n    public static void main(String[] args) {\n\t    int i=1;\n\t\tint j=2;\n\t\tint count=0;\n        Scanner sc=new Scanner(System.in);\n        int n=sc.nextInt();\n\t\t    for(i=1;i<=n;i++){\n\t            for(j=2;j<i;j++){\n\t\t            if (i%j==0){\n\t\t                break;\n\t\t            }\n\t\t        }\n\t\t        if(i==j){\n\t\t            count++;\n\t\t        }\n\t\t    }\n\t\tSystem.out.println(count);\n\t}\n},TIME_LIMIT_EXCEEDED,1000,19800
1591091745193000960,ddd0edd80a23dfec88d0679f4ed6037779b80d26db4ba0f74fecb3d447de61fa,2022-11-11 23:33:27,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n    int n,sum,G;\n    scanf(\""%d\"",&n);\n    while(n){\n        scanf(\""%d\"",&sum);\n        G=6;\n        printf(\""%d\"",G);\n        if(n!=1){\n            printf(\""\\n\"");\n        }\n        n--;\n    }\n    return 0;\n}",WRONG_ANSWER,8,196
1591091772065906688,62c83306b4f5c482e4e9a52dc69ae0b8ee7b5238abb34e56352843a0d484ff2c,2022-11-11 23:33:34,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,num = 6 ** n\ns_num = str(num)\nunti = int(s_num[-1])\nprint(s_num[-1])\n,NON_ZERO_EXIT_CODE,15,2884
1591091888176824320,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 23:34:01,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j;\n    int a[10];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=0;j<n;j++)\n    {\n        if(j<(n-1)&&a[j]%6!=0)\n        {\n            printf(\""6\\n\"");\n        }\n        if(j=n-1&&a[j]%6!=0)\n        {\n            printf(\""6\"");\n        }\n    }\n    \n}",TIME_LIMIT_EXCEEDED,20,1212
1591091890810851328,fbea21dbaf89f1b064feaa20227f21c5e1c4888fdc371cf5e43f70615906e52a,2022-11-11 23:34:02,Python,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"t=int(input())\nn=list(map(int,input().split()))\nfor i in range(t):\n    c=n[i]\n    if c==0:\n        print(1)\n    else:\n        print(6)\n",ACCEPTED,49,2908
1591091891502886912,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-11-11 23:34:02,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint n,i,j;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor( i=0;i<n;i++)\n\t\tscanf(\""%d\"",&a[i]);\n\tfor(j=0;j<n;j++)\n\t{\n\t\n\t\tif(a[j]==0)\n\t\tprintf(\""1\\n\"");\n\t\telse printf(\""6\\n\"");\n\t} \t\n\treturn 0;\n}\n",ACCEPTED,9,196
1591091923467677696,356d4d261b0c273ed9edf9a21f22e4b180080ccba0f8bbfa0c58f889e1a800cc,2022-11-11 23:34:10,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z;\n    printf(\"" \"");\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    printf(\""X+Y-Z=%d\"",X+Y-Z);\n    return 0;\n}\n",WRONG_ANSWER,4,476
1591091965565927424,cb5ee28f5d61aba010f231fd6045de7f8516849eb1dbf293dc5a73a02c3aea2f,2022-11-11 23:34:20,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,w[20],v[20],i,j,max,sum;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&w[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&v[i]);\n    max=v[1]-w[1];\n    for(i=0;i<n;i++)\n        for(j=i,sum=0;j<n;j++)\n    {\n        sum+=v[j]-w[j];\n        if(sum>max) \n            max=sum;\n    }\n    printf(\""%d\\n\"",max);\n    return 0;\n}",ACCEPTED,3,340
1591092014819618816,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-11 23:34:32,Java,0.0,1590524835191705600,1572865591226855424,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        new A().m1();\n    }\n}\nclass A{\n    Scanner scanner = new Scanner(System.in);\n    int a = scanner.nextInt();\n    int b = scanner.nextInt();\n    int c = scanner.nextInt();\n    public void m1(){\n        System.out.println(a-b+c);\n    }\n},WRONG_ANSWER,112,16900
1591092059505733632,d21dc339d37b0772b2547441444d4b660b000ac3ebe190aee01769e2dd619c10,2022-11-11 23:34:42,Python,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"n = int(input())\nxh = list(map(eval,input().split()))\nhd = list(map(eval,input().split()))\ndata=[]\nmax=0\nfor i in range(n):\n    s = hd[i]-xh[i]\n    data.append(s)\nfor i in range(n):\n    sum=0\n    for j in range(i,n,1):\n        sum =sum+ data[j]\n        if sum>max:\n            max = sum\nprint(max)\n",ACCEPTED,16,2756
1591092090883321856,d0d7b0b753346ba8da319a4bb32af868fdf41e2104a53a3a3d7b5b76c65907fe,2022-11-11 23:34:50,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#define N 10010\nint main()\n{\n    int n,i,j;\n\tint k=0;\n\tscanf(\""%d\"",&n);\n\tint a[n],b[n],c[n];\n\tfor(i=0;i<n;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n    scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n        c[i]=a[i]-b[i];\n    for(i=0;i<n;i++){\n       int m=0;\n        for(j=i;j<n;j++){\n            m+=c[j];\n            if(m>k)\n                k=m;\n        }\n    }\n    printf(\""%d\"",k);\n}",WRONG_ANSWER,4,192
1591092166372405248,d0d7b0b753346ba8da319a4bb32af868fdf41e2104a53a3a3d7b5b76c65907fe,2022-11-11 23:35:08,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#define N 10010\nint main()\n{\n    int n,i,j;\n\tint k=0;\n\tscanf(\""%d\"",&n);\n\tint a[n],b[n],c[n];\n\tfor(i=0;i<n;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n    scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n        c[i]=a[i]-b[i];\n    for(i=0;i<n;i++){\n       int m=0;\n        for(j=i;j<n;j++){\n            m+=c[j];\n            if(m>k)\n                k=m;\n        }\n    }\n    printf(\""%d\\n\"",k);\n}",WRONG_ANSWER,3,316
1591092230188761088,25584884fd716238437f89484285121d106c1090916ab683be624f210130ebad,2022-11-11 23:35:23,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,i,j,count,flag;\n    scanf(\""%d\"",&n);\n    count=0;\n    for (i=2;i<= n;i++){\n        flag=1;\n       for(j=2;j<=sqrt(i);j++){\n         if(i%j==0){\n             flag=0;\n             break;\n          }\n       }\n        if(flag==1)\n            count++;\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",ACCEPTED,15,324
1591092232025866240,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-11 23:35:23,Java,300.0,1590524835191705600,1572865591226855424,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        new A().m1();\n    }\n}\nclass A{\n    Scanner scanner = new Scanner(System.in);\n    int a = scanner.nextInt();\n    int b = scanner.nextInt();\n    int c = scanner.nextInt();\n    public void m1(){\n        System.out.println(a + b - c);\n    }\n},ACCEPTED,240,16868
1591092249373511680,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-11 23:35:27,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\n  printf(\""2022\"");\n \n  return 0;\n}",ACCEPTED,3,468
1591092260807180288,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-11 23:35:30,Java,300.0,1590524835191705600,1572865591226855424,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        new A().m1();\n    }\n}\nclass A{\n    Scanner scanner = new Scanner(System.in);\n    int a = scanner.nextInt();\n    int b = scanner.nextInt();\n    int c = scanner.nextInt();\n    public void m1(){\n        System.out.println(a + b - c);\n    }\n},ACCEPTED,250,19156
1591092262312935424,d0d7b0b753346ba8da319a4bb32af868fdf41e2104a53a3a3d7b5b76c65907fe,2022-11-11 23:35:31,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,j;\n\tint k=0;\n\tscanf(\""%d\"",&n);\n\tint a[n],b[n],c[n];\n\tfor(i=0;i<n;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n    scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n        c[i]=a[i]-b[i];\n    for(i=0;i<n;i++){\n       int m=0;\n        for(j=i;j<n;j++){\n            m+=c[j];\n            if(m>k)\n                k=m;\n        }\n    }\n    printf(\""%d\\n\"",k);\n}",WRONG_ANSWER,4,480
1591092265316057088,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-11 23:35:31,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\n  printf(\""2022\"");\n \n  return 0;\n}",ACCEPTED,3,348
1591092299193450496,1b00b3d29099722d8332b35e3af5e54fda309b4f7c9fc6261f618ecd2a4d7390,2022-11-11 23:35:39,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,j,c=0,k;//c初始能量值,k闯关数\n    scanf(\""%d\"",&n);\n    int a[n],b[n],max;\n    max=0;\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);//每关消耗能量\n    for(j=0;j<n;j++)\n        scanf(\""%d\"",&b[j]);//每关获得能量\n    for(k=0;k<n;k++)\n    {\n            c=b[k]-a[k]+c;\n        if(c>0&&c>max) max=c;\n        else break;\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",WRONG_ANSWER,3,468
1591092414134161408,1b00b3d29099722d8332b35e3af5e54fda309b4f7c9fc6261f618ecd2a4d7390,2022-11-11 23:36:07,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main(int argc, const char * argv[]) {\n    // insert code here...\n    \n    int w[1024] = {0};\n    int q[1024] = {0};\n    int n = 0;\n    scanf(\""%d\"", &n);\n    \n    for (int i = 0; i < n; i++) {\n        scanf(\""%d\"", &w[i]);\n    }\n    for (int j = 0; j < n; j++) {\n        scanf(\""%d\"", &q[j]);\n    }\n    \n    int sum = 0;\n    for (int i = 0; i < n; i++) {\n        int ret = q[i] - w[i];\n        if (ret > 0) {\n            sum += ret;\n        } else {\n            break;\n        }\n    }\n    \n    printf(\""%d\\n\"", sum);\n    \n    return 0;\n}",WRONG_ANSWER,4,508
1591092532962983936,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 23:36:35,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j;\n    int a[10];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=0;j<n;j++)\n    {\n        if(a[j]==0)\n        {\n            printf(\""1\\n\"");\n        }\n        else{\n            printf(\""6\\n\"");\n        }\n    }\n    \n}",ACCEPTED,13,352
1591092627141865472,2af449595ef30f97cefb348732f77a537f3df93d20abf901fe2ea852a179091b,2022-11-11 23:36:58,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n\tint n,max,temp=0;\n\tint i;\n\tscanf(\""%d\"",&n);\n\tint a[n],b[n],c[n];\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&b[i]);\n\t}\n\tfor(i=0;i<n;i++)\n\t{\n\t\tc[i] = b[i]-a[i];\n\t}\n\tfor(i=0;i<n;i++)\n\t{\n\t\ttemp+=c[i];\n\t\tif(i==0){\n\t\t\tmax=temp;\n\t\t}\n\t\tif(temp>max){\n\t\t\tmax=temp;\n\t\t}\n\t}\n\tprintf(\""%d\\n\"",max);\n\treturn 0;\n}",WRONG_ANSWER,3,328
1591092673853849600,ddd0edd80a23dfec88d0679f4ed6037779b80d26db4ba0f74fecb3d447de61fa,2022-11-11 23:37:09,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n    int n,sum,G;\n    scanf(\""%d\"",&n);\n    while(n){\n        scanf(\""%d\"",&sum);\n        if(sum!=0)\n        {\n         G=sum/sum*6;\n        printf(\""%d\"",G);\n        }\n        else\n            printf(\""1\"");\n        if(n!=1){\n            printf(\""\\n\"");\n        }\n        n--;\n    }\n    return 0;\n}",ACCEPTED,10,388
1591092735677890560,25584884fd716238437f89484285121d106c1090916ab683be624f210130ebad,2022-11-11 23:37:23,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int m,n,j,count,flag;\n    scanf(\""%d\"",&m);\n    count=0;\n    for (n=2;n<= m;n++)\n    {\n        flag=1;\n       for(j=2;j<=sqrt(n);j++)\n       {\n         if(n%j==0)\n         {\n             flag=0;\n             break;\n          }\n       }\n        if(flag==1)\n            count++;\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",ACCEPTED,14,324
1591092833824604160,d0d7b0b753346ba8da319a4bb32af868fdf41e2104a53a3a3d7b5b76c65907fe,2022-11-11 23:37:47,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,j;\n\tint k=0;\n\tscanf(\""%d\"",&n);\n\tint a[n],b[n],c[n];\n\tfor(i=0;i<n;i++)\n    scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n    scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n        c[i]=b[i]-a[i];\n    for(i=0;i<n;i++){\n       int m=0;\n        for(j=i;j<n;j++){\n            m+=c[j];\n            if(m>k)\n                k=m;\n        }\n    }\n    printf(\""%d\\n\"",k);\n}",ACCEPTED,4,452
1591092909003309056,303021c0ef4f93101c801ad0c8851ab3828a16b5c728ce8e6859ab342ddc4b26,2022-11-11 23:38:05,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int m;\n    int n;\n    scanf(\""%d\"",&n);\n    for(m=0;m<n;m++)\n    {\n      scanf(\""%d\"",&n);\n      if(n==0)\n        printf(\""%d\\n\"",1);\n      else\n        printf(\""%d\\n\"",6);\n     }\n    return 0;\n}\n",WRONG_ANSWER,3,324
1591093096627089408,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 23:38:49,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j;\n    int a[10];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(j=0;j<n;j++)\n    {\n        if(a[j]!=0)\n        {\n            printf(\""6\\n\"");\n        }\n        else\n        {\n            printf(\""1\\n\"");\n        }\n    }\n    \n}",ACCEPTED,8,316
1591093169763188736,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-11 23:39:07,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n    int i,j,t,n,a,b;\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++){\n    scanf(\""%d \"",&n);\n    for(j=0;j<t;j++){\n    if(n!=0)\n    printf(\""6\\n\"");\n    if(n==0)\n    printf(\""1\\n\"");\n    }\n    return 0;\n}\n}\n",WRONG_ANSWER,10,308
1591093180844544000,86f702b052a21d7cb2f8cd933c678c21efaafaf5b2d35032f18ec35c1e26a945,2022-11-11 23:39:10,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nvoid foo(unsigned int n)\n{\n    if (n == 0) \n    {\n        printf(\""1\\n\"");\n        return ;\n    }\n    for (unsigned int i = 1; i <= n; i++) \n        printf(\""6\\n\"");\n}\n\nint main() {\n    int t = 0;\n    int a[10000];\n    int num = 0;\n    scanf(\""%d\"", &t);\n    for (int i = 0; i < t; i++) \n       {\n        scanf(\""%d\"", &num);\n        if (num == 0)     a[i] = 1;\n    }\n    for (int i = 0; i < t; i++) \n    {\n        if (a[i] == 1)  printf(\""1\\n\"");\n        else         printf(\""6\\n\"");\n    }\n    return 0;\n}",ACCEPTED,11,340
1591093311232872448,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 23:39:41,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    int n,i,j;\n    int x=0,y=0;\n    scanf(\""%d\"",n);\n    int a[n],b[n],c[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        c[i]=b[i]-a[i];\n    }\n    for(i=0;i<n;i++)\n    {\n        for(j=i;j<n;j++)\n        {\n            y+=c[j];\n            if(y>x)\n                x=y;\n        }\n    }\n    printf(\""%d\\n\"",x);\n}",SEGMENTATION_FAULT,3,308
1591093373795086336,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-11 23:39:56,Java,300.0,1590528927448293376,1590525945717575680,1049226928954454016,import java.time.LocalDateTime;\n\npublic class Main {\n    public static void main(String[] args) {\n        LocalDateTime ldt = LocalDateTime.now();\n        System.out.println(ldt.getYear());\n    }\n}\n,ACCEPTED,80,14456
1591093501230645248,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 23:40:26,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    int n,i,j;\n    int x=0,y=0;\n    scanf(\""%d\"",n);\n    int a[n],b[n],c[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n        c[i]=b[i]-a[i];\n    for(i=0;i<n;i++)\n        for(j=i;j<n;j++)\n        {\n            y+=c[j];\n            if(y>x)\n                x=y;\n        }\n    }\n    printf(\""%d\\n\"",x);\n}",COMPILE_ERROR,0,0
1591093504737087488,834ba62d861cf2d94a81f3b034a55b21f1378d4337b6b065c321d7da6bf82e17,2022-11-11 23:40:27,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"print(\""2022\"")",ACCEPTED,16,3760
1591093553621676032,dcc1017bcd698bd6a0eee54e4ed848d4c51a3a26608990cdd2137e4c01065a1e,2022-11-11 23:40:38,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n    int n,sum,G;\n    scanf(\""%d\"",&n);\n    while(n){\n        scanf(\""%d\"",&sum);\n        if(sum!=0)\n        {\n         G=sum/sum*6;\n        printf(\""%d\"",G);\n        }\n        else\n            printf(\""1\"");\n        if(n!=1){\n            printf(\""\\n\"");\n        }\n        n--;\n    }\n    return 0;\n}",ACCEPTED,9,324
1591093641509122048,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 23:40:59,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    int n,i,j;\n    int x=0,y=0;\n    scanf(\""%d\"",n);\n    int a[n],b[n],c[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n        c[i]=b[i]-a[i];\n    for(i=0;i<n;i++)\n    {\n        for(j=i;j<n;j++)\n            y+=c[j];\n            if(y>x)\n                x=y;\n    }   \n    printf(\""%d\\n\"",x);\n}",SEGMENTATION_FAULT,3,340
1591093662338035712,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-11 23:41:04,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n    int n,sum,G;\n    scanf(\""%d\"",&n);\n    while(n){\n        scanf(\""%d\"",&sum);\n        if(sum!=0)\n        {\n         G=sum/sum*6;\n        printf(\""%d\"",G);\n        }\n        else\n            printf(\""1\"");\n        if(n!=1){\n            printf(\""\\n\"");\n        }\n        n--;\n    }\n    return 0;\n}\n",ACCEPTED,9,184
1591093755803926528,1b00b3d29099722d8332b35e3af5e54fda309b4f7c9fc6261f618ecd2a4d7390,2022-11-11 23:41:27,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main(int argc, const char * argv[]) {\n    // insert code here...\n    \n    int w[10240] = {0};\n    int q[10240] = {0};\n    int n = 0;\n    scanf(\""%d\"", &n);\n    \n    for (int i = 0; i < n; i++) {\n        scanf(\""%d\"", &w[i]);\n    }\n    for (int j = 0; j < n; j++) {\n        scanf(\""%d\"", &q[j]);\n    }\n    \n    int sum = 0;\n    for (int i = 0; i < n; i++) {\n        int ret = q[i] - w[i];\n        if (ret > 0) {\n            sum += ret;\n        } else {\n            break;\n        }\n    }\n    \n    printf(\""%d\\n\"", sum);\n    \n    return 0;\n}",WRONG_ANSWER,3,312
1591093831825666048,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 23:41:45,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    int n,i,j;\n    int x=0,y=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n        c[i]=b[i]-a[i];\n    for(i=0;i<n;i++)\n    {\n        for(j=i;j<n;j++)\n            y+=c[j];\n            if(y>x)\n                x=y;\n    }   \n    printf(\""%d\\n\"",x);\n}",WRONG_ANSWER,3,188
1591093872032288768,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-11 23:41:54,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n int X,Y,Z,HHH;\n\n int m=a+b;\n scanf(\""%d %d %d\"",&X,&Y,&Z);\n Z=X+Y-Z;\n printf(\""%d\"",&HHH);\n return 0;\n}",COMPILE_ERROR,0,0
1591094009936785408,69d2f3a9da1c135d111e69327883b4d96c284e9c1c71370cc330a44458f95ab4,2022-11-11 23:42:27,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#define _CRT_SECURE_NO_WARNINGS\n#include <stdio.h>\n#define P 100\nint main()\n{\n\tint n=0,x=0,y=0;\n\tint i;\n\tint a[P] = { 0 }, b[P] = { 0 }, c[P] = {0};\n\tscanf(\""%d\"", n);\n\tfor (i = 0; i < n; i++)\n\t{\n\t\tscanf(\""%d\"", a[i]);\n\t}\n\tfor (i = 0; i < n; i++)\n\t{\n\t\tscanf(\""%d\"", b[i]);\n\t}\n\tfor (i = 0; i < n; i++)\n\t{\n\t\tc[i] = b[i] - a[i];\n\t\tx += c[i];\n\t\t\n\t\t\t\n\t}\n\tif (x>c[5])\n\t\tprintf(\""%d\"", x);\n\treturn 0;\n}\n",SEGMENTATION_FAULT,5,344
1591094073421770752,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-11 23:42:42,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main(){\n\tint n,i,j;\n\tint x=0,y=0;\n\tscanf(\""%d\"",&n);\n\tint a[n],b[n],c[n];\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=0; i<n;i++){\n\t\tscanf(\""%d\"",&b[i]);\n\t}\n\tfor(i=0;i<n;i++){\n\t\tc[i]=b[i]-a[i];\n\t}\n\tfor(i=0;i<n;i++){\n\t\tfor(j=i;j<n;j++){\n\t\t\ty+=c[j];\n\t\t\tif(y>x){\n\t\t\t\tx=y;\n\t\t\t}\n\t\t}\n        y=0;\n\t}\n\tprintf(\""%d\"",x);\n\treturn 0;\n}",ACCEPTED,4,196
1591094195312459776,64b76cc355daf11e96a19b338c58e56c05289d7e3809e9695a09e71771618713,2022-11-11 23:43:11,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n   int i,n,t;\n   scanf (\""%d\"",&t);\n   for(i=0;i<t;i++)\n   {\n       scanf(\""%d\"",&n);\n       if(n==0)\n        printf(\""&d\\n\"",1);\n       else\n           printf (\""%d\\n\"",6);\n\n       }\n\n  return 0;\n}\n",WRONG_ANSWER,14,384
1591094248412348416,69d2f3a9da1c135d111e69327883b4d96c284e9c1c71370cc330a44458f95ab4,2022-11-11 23:43:24,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint t, i, x;\n\tscanf(\""%d\"", &t);\n\tfor (i = 0; i<t; i++)\n\t{\n\t\tscanf(\""%d\"", &x);\n\t\tif (x==0)\n\t\t\tprintf(\""1\\n\"");\n\t\telse\n\t\t\tprintf(\""6\\n”\"");\n\t}\n\treturn 0;\n}",WRONG_ANSWER,3,192
1591094370835673088,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-11 23:43:53,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n#define MAX 100\nint main(void){\n\tint t,n[MAX],i,sum;\n\tscanf(\""%d\\n\"",&t);\n    for(i=0;i<t;i++){\n        scanf(\""%d\"",&n[i]);\n    }\n\tfor(i=0;i<t;i++){\n\t\tsum=pow(6,n[i]);\n        sum=sum%10;\n\t\tprintf(\""%d\\n\"",sum);\n\t}\n    return 0;\n}",WRONG_ANSWER,8,320
1591094406604722176,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-11 23:44:02,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=o\nn=int(input())\nif 2 <= n <=100000:\n    for i in range(2,n+1):\n        for m in range(2,i):\n            if i %m == 0:\n                break\n               else:\n                a +=1\n                print(a)",NON_ZERO_EXIT_CODE,15,2884
1591094431745355776,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-11 23:44:08,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=o\nn=int(input())\nif 2 <= n <=100000:\n    for i in range(2,n+1):\n        for m in range(2,i):\n            if i %m == 0:\n                break\n               else:\n                a +=1\n                print(a)",NON_ZERO_EXIT_CODE,15,2748
1591094480994897920,69d2f3a9da1c135d111e69327883b4d96c284e9c1c71370cc330a44458f95ab4,2022-11-11 23:44:20,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint t, i,x;\n\tscanf(\""%d\"", &t);\n\tfor (i = 0; i<t;i++)\n\t{\n\t\tscanf(\""%d\"", &x);\n\t\tif (x==0)\n\t\t\tprintf(\""1\\n\"");\n\t\telse\n\t\t\tprintf(\""6\\n”\"");\n\t}\n\treturn 0;\n}",WRONG_ANSWER,3,384
1591094512192106496,69d2f3a9da1c135d111e69327883b4d96c284e9c1c71370cc330a44458f95ab4,2022-11-11 23:44:27,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint t, i,x;\n\tscanf(\""%d\"", &t);\n\tfor (i = 0; i<t;i++)\n\t{\n\t\tscanf(\""%d\"", &x);\n\t\tif (x==0)\n\t\t\tprintf(\""1\\n\"");\n\t\telse\n\t\t\tprintf(\""6\\n”\"");\n\t}\n\treturn 0;\n}",WRONG_ANSWER,3,196
1591094565921165312,69d2f3a9da1c135d111e69327883b4d96c284e9c1c71370cc330a44458f95ab4,2022-11-11 23:44:40,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint t, i,x;\n\tscanf(\""%d\"", &t);\n\tfor (i = 0; i<t;i++)\n\t{\n\t\tscanf(\""%d\"", &x);\n\t\tif(x==0)\n\t\t\tprintf(\""1\\n\"");\n\t\telse\n\t\t\tprintf(\""6\\n”\"");\n\t}\n\treturn 0;\n}",WRONG_ANSWER,2,196
1591094588566188032,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-11 23:44:45,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"def maxSubArray(nums):\n\t'''\n\t求最大子串和\n\n\t'''\n\t# print(len(nums))\n\t# 如果该串长度为一,和最大的子串就是本身\n\tif len(nums)==1:\n\t\treturn nums[0]\n\n\t# 用来存放每次更新的最大子串和\n\tmax_ret = nums[0]\n\tcur_max = last_max = nums[0]\n\n\t# 状态转移方程,一步步的分解子问题\n\tfor i in range(1,len(nums)):\n\t\tif last_max+nums[i] < nums[i]:\n\t\t\tcur_max = nums[i]\n\t\telse:\n\t\t\tcur_max = last_max+nums[i]\n\t\tif cur_max > max_ret:\n\t\t\tmax_ret = cur_max\n\t\tlast_max = cur_max\n\treturn max_ret\nn=int(input())\na=list(input().split())\nb=list(input().split())\nc=[]\nfor i in range(n):\n    a[i]=int(a[i])\n    b[i]=int(b[i])\n    c.append(a[i]-b[i]+a[i+1])\n\n##list01=[2,-5,-6,-8,-3,3,56,-60,3,6,7,-100,9,3]\n# list01=[1,2,3,-1]\nprint(maxSubArray(nums=c))\n# 算法复杂度为O(N),(需要循环遍历整个串)\n\n\n",NON_ZERO_EXIT_CODE,17,3152
1591094611794268160,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 23:44:51,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    int n,i,j;\n    int x=0,y=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n        c[i]=b[i]-a[i];\n    for(i=0;i<n;i++)\n    {\n        for(j=i;j<n;j++)\n        {\n            y+=c[j];\n            if(y>x)\n            {\n                x=y;\n            }\n        }\n    }   \n    printf(\""%d\\n\"",x);\n}",WRONG_ANSWER,3,200
1591094786071789568,62c83306b4f5c482e4e9a52dc69ae0b8ee7b5238abb34e56352843a0d484ff2c,2022-11-11 23:45:32,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,num = 6 ** n\ns_num = str(num)\nunit = int(s_num[-1])\nprint(unit)\n,NON_ZERO_EXIT_CODE,17,2816
1591095095271686144,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 23:46:46,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    int n,i,j;\n    int x=0,y=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n        c[i]=b[i]-a[i];\n    for(i=0;i<n;i++)\n    {\n        for(j=i;j<n;j++)\n        {\n            y+=c[j];\n            if(y>x)\n            {\n                x=y;\n                printf(\""%d\\n\"",x);\n            }\n        }\n    }   \n}",WRONG_ANSWER,3,184
1591095110455066624,20ffd83467b553ac24e1f4b8b096d58858684ca8c3f6a4d5a62be9ff7c4817da,2022-11-11 23:46:50,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int i,j;\n    int t=0,h=0,x;\n    scanf(\""%d\"",&x);\n    for(i=2;i<=x;i++){\n        for(j=2;j<=sqrt(i);j++){\n            if(i%j==0)\n                t++;\n        }\n        if(t==0){\n            h++;\n            t=0;\n        }\n    }\n    printf(\""%d\\n\"",h);\n}\n\n",WRONG_ANSWER,60,320
1591095168495845376,ddd0edd80a23dfec88d0679f4ed6037779b80d26db4ba0f74fecb3d447de61fa,2022-11-11 23:47:03,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint a,i,j,b,c=0;\n\tscanf(\""%d\"",&a);\n\tfor(i=2;i<=a;i++)\n\t\t{\n\t\tfor(j=2;j<=i;j++)\n\t\t\tif(i%j==0)\n\t\t\t\tb=j+b;\t\n\t\tif(b==i)\n\t\tc++;\n\t\tb=0;\n\t\t}\n    printf(\""%d\"",c);\n}\n\n",TIME_LIMIT_EXCEEDED,1000,308
1591095248829353984,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 23:47:23,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    int n,i,j;\n    int x=0,y=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n        c[i]=b[i]-a[i];\n    for(i=0;i<n;i++)\n    {\n        for(j=i;j<n;j++)\n        {\n            y+=c[j];\n            if(y>x)\n            {\n                x=y;\n            }\n        }\n    }   \n    printf(\""%d\\n\"",x)\n}",COMPILE_ERROR,0,0
1591095251786334208,0b3466ebddb2bdde378eee8b40d2037097b0a243d9ec4a6495316765e89853eb,2022-11-11 23:47:23,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nvoid main()\n{\n　　int year;\n　　printf(\""2022\\n\"");\n　}\n\n",COMPILE_ERROR,0,0
1591095302201868288,0b3466ebddb2bdde378eee8b40d2037097b0a243d9ec4a6495316765e89853eb,2022-11-11 23:47:35,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nvoid main()\n{\n　　int year;\n　　printf(\""2022\\n\"");\n　}\n\n",COMPILE_ERROR,0,0
1591095347013812224,69d2f3a9da1c135d111e69327883b4d96c284e9c1c71370cc330a44458f95ab4,2022-11-11 23:47:46,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint t, i,x;\n\tscanf(\""%d\"", &t);\n\tfor (i = 0; i<t;i++)\n\t{\n\t\tscanf(\""%d\"", &x);\n\t\tif(x==0)\n\t\t\tprintf(\""1\\n\"");\n\t\telse\n\t\t\tprintf(\""6\\n\"");\n\t}\n\treturn 0;\n}",ACCEPTED,16,376
1591095350235037696,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 23:47:47,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    int n,i,j;\n    int x=0,y=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n        c[i]=b[i]-a[i];\n    for(i=0;i<n;i++)\n    {\n        for(j=i;j<n;j++)\n        {\n            y+=c[j];\n            if(y>x)\n                x=y;\n        }\n    }   \n    printf(\""%d\\n\"",x)\n}",COMPILE_ERROR,0,0
1591095429205372928,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 23:48:06,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    int n,i,j;\n    int x=0,y=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n        c[i]=b[i]-a[i];\n    for(i=0;i<n;i++)\n    {\n        for(j=i;j<n;j++)\n        {\n            y+=c[j];\n            if(y>x)\n                x=y;\n        }\n    }   \n    printf(\""%d\\n\"",x);\n}",WRONG_ANSWER,3,344
1591095462373953536,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-11 23:48:14,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n int X,Y,Z;\n int a=0;\n scanf(\""%d %d %d\"",&X,&Y,&Z);\n a=X+Y-Z;\n printf(\""%d\"",a);\n return 0;\n}\n",ACCEPTED,7,448
1591095588245012480,834ba62d861cf2d94a81f3b034a55b21f1378d4337b6b065c321d7da6bf82e17,2022-11-11 23:48:44,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n}",ACCEPTED,8,332
1591095654997364736,6cbd81921f92855c6b8318725b09ef7ec48ff579276b3df9f7ea04bea9804678,2022-11-11 23:48:59,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\nint n,i,j,x=0,y=0;\nscanf(\""%d\"",&n);\nint a[n],b[n],c[n];\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&a[i]);\nfor(i=0;i<n;i++)\n    scanf(\""%d\"",&b[i]);\nfor(i=0;i<n;i++)\n    c[i]=b[i]-a[i];\nfor(i=0;i<n;i++)\n{\n    for(j=i;j<n;j++)\n    {\n       y+=c[j];\n       if(y>x)\n        x=y;\n    }\n    y=0;\n}\nprintf(\""%d\\n\"",x);\nreturn 0;\n}\n",ACCEPTED,3,308
1591095693454938112,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-11 23:49:09,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"def maxSubArray(nums):\n\t'''\n\t求最大子串和\n\n\t'''\n\t# print(len(nums))\n\t# 如果该串长度为一,和最大的子串就是本身\n\tif len(nums)==1:\n\t\treturn nums[0]\n\n\t# 用来存放每次更新的最大子串和\n\tmax_ret = nums[0]\n\tcur_max = last_max = nums[0]\n\n\t# 状态转移方程,一步步的分解子问题\n\tfor i in range(1,len(nums)):\n\t\tif last_max+nums[i] < nums[i]:\n\t\t\tcur_max = nums[i]\n\t\telse:\n\t\t\tcur_max = last_max+nums[i]\n\t\tif cur_max > max_ret:\n\t\t\tmax_ret = cur_max\n\t\tlast_max = cur_max\n\treturn max_ret\nn=int(input())\na=list(input().split())\nb=list(input().split())\nc=[]\nfor i in range(n):\n    a[i]=int(a[i])\n    b[i]=int(b[i])\nfor i in range(n-1):\n    c.append(a[i]-b[i]+a[i+1])\n\n##list01=[2,-5,-6,-8,-3,3,56,-60,3,6,7,-100,9,3]\n# list01=[1,2,3,-1]\nprint(maxSubArray(c))\n# 算法复杂度为O(N),(需要循环遍历整个串)\n\n\n",WRONG_ANSWER,15,2872
1591096017355866112,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 23:50:26,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    int n,i,j;\n    int x=0,y=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n        c[i]=b[i]-a[i];\n    for(i=0;i<n;i++)\n    {\n        for(j=i;j<n;j++)\n        {\n            y+=c[j];\n            if(y>x)\n                x=y;\n        }\n    }   \n    printf(\""%d\\n\"",x);\n}",WRONG_ANSWER,3,188
1591096113917136896,303021c0ef4f93101c801ad0c8851ab3828a16b5c728ce8e6859ab342ddc4b26,2022-11-11 23:50:49,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n    int m,n,t;\n    scanf(\""%d\\n\"",&t);\n    for(m=0;m<t;m++)\n    {\n        scanf(\""%d\"",&n);\n        if(n==0)\n            printf(\""%d\\n\"",1);\n        else\n            printf(\""%d\\n\"",6);\n    }\n}\n",ACCEPTED,11,320
1591096195676700672,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-11 23:51:08,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <iostream>\n#include <math.h>\nusing namespace std;\n\nint main(){\n    int n,a=6;\n    scanf(\""%d\"",&n);\n    while (n--){\n        int t = a % 4;\n        if (a%4==0) t = 4;\n        a %= 10;\n        printf(\""%d\\n\"",(int)pow(a,t)%10);\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1591096229776396288,834ba62d861cf2d94a81f3b034a55b21f1378d4337b6b065c321d7da6bf82e17,2022-11-11 23:51:16,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main()\n{\n    int i,j;\n    int n;\n    scanf(\""%d\"",&n);\n    int sum=0;\n    for(i=2;i<=n;i++)\n    {\n         for(j=2;j<=pow(i,0.5);j++)\n         {\n             if(i%j==0)\n             {\n                 sum++;\n                 break;\n             }\n         }\n    }\n    \n    printf(\""%d\"",n-sum-1);\n}",ACCEPTED,152,316
1591096242640302080,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-11 23:51:20,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"def maxSubArray(nums):\n\t'''\n\t求最大子串和\n\n\t'''\n\t# print(len(nums))\n\t# 如果该串长度为一,和最大的子串就是本身\n\tif len(nums)==1:\n\t\treturn nums[0]\n\n\t# 用来存放每次更新的最大子串和\n\tmax_ret = nums[0]\n\tcur_max = last_max = nums[0]\n\n\t# 状态转移方程,一步步的分解子问题\n\tfor i in range(1,len(nums)):\n\t\tif last_max+nums[i] < nums[i]:\n\t\t\tcur_max = nums[i]\n\t\telse:\n\t\t\tcur_max = last_max+nums[i]\n\t\tif cur_max > max_ret:\n\t\t\tmax_ret = cur_max\n\t\tlast_max = cur_max\n\treturn max_ret\nn=int(input())\na=list(input().split())\nb=list(input().split())\nc=[]\nfor i in range(n):\n    a[i]=int(a[i])\n    b[i]=int(b[i])\n    c.append(b[i]-a[i])\nprint(c)\n##list01=[2,-5,-6,-8,-3,3,56,-60,3,6,7,-100,9,3]\n# list01=[1,2,3,-1]\nprint(maxSubArray(c))\n# 算法复杂度为O(N),(需要循环遍历整个串)\n\n\n",WRONG_ANSWER,18,2872
1591096279722168320,62c83306b4f5c482e4e9a52dc69ae0b8ee7b5238abb34e56352843a0d484ff2c,2022-11-11 23:51:28,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"t = int(input())\nls = list(map(int,input().split()))\nprint(ls)\nfor n in ls:\n    num = 6 ** n\n    s_num = str(num)\n    unit = int(s_num[-1])\n    print(unit)\n",WRONG_ANSWER,16,2816
1591096283396378624,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 23:51:29,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    int n,i,j;\n    int x=0,y=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        c[i]=b[i]-a[i];\n    }\n    for(i=0;i<n;i++)\n    {\n        for(j=i;j<n;j++)\n        {\n            y+=c[j];\n            if(y>x)\n                x=y;\n        }\n    }   \n    printf(\""%d\\n\"",x);\n}",WRONG_ANSWER,4,316
1591096344998096896,62c83306b4f5c482e4e9a52dc69ae0b8ee7b5238abb34e56352843a0d484ff2c,2022-11-11 23:51:44,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"t = int(input())\nls = list(map(int,input().split()))\nfor n in ls:\n    num = 6 ** n\n    s_num = str(num)\n    unit = int(s_num[-1])\n    print(unit)\n",TIME_LIMIT_EXCEEDED,165,4012
1591096353399308288,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-11 23:51:46,Python,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"def maxSubArray(nums):\n\t'''\n\t求最大子串和\n\n\t'''\n\t# print(len(nums))\n\t# 如果该串长度为一,和最大的子串就是本身\n\tif len(nums)==1:\n\t\treturn nums[0]\n\n\t# 用来存放每次更新的最大子串和\n\tmax_ret = nums[0]\n\tcur_max = last_max = nums[0]\n\n\t# 状态转移方程,一步步的分解子问题\n\tfor i in range(1,len(nums)):\n\t\tif last_max+nums[i] < nums[i]:\n\t\t\tcur_max = nums[i]\n\t\telse:\n\t\t\tcur_max = last_max+nums[i]\n\t\tif cur_max > max_ret:\n\t\t\tmax_ret = cur_max\n\t\tlast_max = cur_max\n\treturn max_ret\nn=int(input())\na=list(input().split())\nb=list(input().split())\nc=[]\nfor i in range(n):\n    a[i]=int(a[i])\n    b[i]=int(b[i])\n    c.append(b[i]-a[i])\nprint(maxSubArray(c))\n# 算法复杂度为O(N),(需要循环遍历整个串)\n\n\n",ACCEPTED,17,2868
1591096353923575808,6b02dfcf297d52c2de2e1416b33ee988ff909834c73207b147423a8301e9d174,2022-11-11 23:51:46,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int m,n,j,count,flag;\n    scanf(\""%d\"",&m);\n    count=0;\n    for (n=2;n<= m;n++)\n    {\n        flag=1;\n       for(j=2;j<=sqrt(n);j++)\n       {\n         if(n%j==0)\n         {\n             flag=0;\n             break;\n          }\n       }\n        if(flag==1)\n            count++;\n    }\n    printf(\""%d\"",count);\n    return 0;\n}\n",ACCEPTED,14,440
1591096381341765632,6b02dfcf297d52c2de2e1416b33ee988ff909834c73207b147423a8301e9d174,2022-11-11 23:51:53,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int m,n,j,count,flag;\n    scanf(\""%d\"",&m);\n    count=0;\n    for (n=2;n<= m;n++)\n    {\n        flag=1;\n       for(j=2;j<=sqrt(n);j++)\n       {\n         if(n%j==0)\n         {\n             flag=0;\n             break;\n          }\n       }\n        if(flag==1)\n            count++;\n    }\n    printf(\""%d\"",count);\n    return 0;\n}\n",ACCEPTED,13,472
1591096450287730688,62c83306b4f5c482e4e9a52dc69ae0b8ee7b5238abb34e56352843a0d484ff2c,2022-11-11 23:52:09,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"t = int(input())\nls = list(map(int,input().split()))\nfor n in ls:\n    num = 6 ** n\n    s_num = str(num)\n    unit = int(s_num[-1])\n    print(unit)\n",TIME_LIMIT_EXCEEDED,167,4092
1591096462946119680,0b3466ebddb2bdde378eee8b40d2037097b0a243d9ec4a6495316765e89853eb,2022-11-11 23:52:12,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#define _CRT_SECURE_NO_WARNINGS\n\t int main ()\n\t{\n\t\tint year;\n\t\tprintf(\""请输入年份：\\n\"");\n     }",WRONG_ANSWER,3,316
1591096526468853760,0b3466ebddb2bdde378eee8b40d2037097b0a243d9ec4a6495316765e89853eb,2022-11-11 23:52:27,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\t int main ()\n\t{\n\t\tint year;\n\t\tprintf(\""请输入年份：\\n\"");\n     }",WRONG_ANSWER,3,312
1591096531938250752,303021c0ef4f93101c801ad0c8851ab3828a16b5c728ce8e6859ab342ddc4b26,2022-11-11 23:52:29,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n    int m,n,t;\n    scanf(\""%d\\n\"",&t);\n    for(m=0;m<t;m++)\n    {\n        scanf(\""%d\"",&n);\n        if(n==0)\n            printf(\""%d\\n\"",1);\n        else\n            printf(\""%d\\n\"",6);\n    }\n}\n",ACCEPTED,9,316
1591096575147945984,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 23:52:39,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    int n,i,j;\n    int x=0,y=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        c[i]=b[i]-a[i];\n    }\n    for(i=0;i<n;i++)\n    {\n        y+=c[j];\n        if(y>x)\n            x=y;\n    }   \n    printf(\""%d\\n\"",x);\n}",WRONG_ANSWER,3,196
1591096577521946624,303021c0ef4f93101c801ad0c8851ab3828a16b5c728ce8e6859ab342ddc4b26,2022-11-11 23:52:39,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n   int n,i,j,num=0;\n   scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n   {\n       for(j=2;j<=i;j++)\n       {\n           if(i%j==0)\n           {\n               if(j>=i)\n                num++;\n                break;\n           }\n       }\n   }\n    printf(\""%d\"",num);\n    return 0;\n}\n",ACCEPTED,916,316
1591096578922819584,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-11 23:52:40,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"n=int(input())\ncount=0\nfor i in range (3,n,2):\n    for j in range (2,i):\n        if i%j==0:\n            break;\n    else:\n        count+=1\nprint(count+1)\n",TIME_LIMIT_EXCEEDED,1000,3040
1591096579325493248,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-11 23:52:40,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n#define MAX 100\nint main(void){\n\tint t,n[MAX],i,sum;\n\tscanf(\""%d\\n\"",&t);\n    for(i=0;i<t;i++){\n        scanf(\""%d\"",&n[i]);\n    }\n\tfor(i=0;i<t;i++){\n\t\tsum=pow(6,n[i]);\n        sum=sum%10;\n        if(i=t-1){\n\t\t    printf(\""%d\"",sum);\n        }else{\n            printf(\""%d\\n\"",sum);\n        }\n\t}\n    return 0;\n}",WRONG_ANSWER,4,308
1591096613215449088,303021c0ef4f93101c801ad0c8851ab3828a16b5c728ce8e6859ab342ddc4b26,2022-11-11 23:52:48,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n   int x,y,z,d;\n   scanf(\""%d%d%d\"",&x,&y,&z);\n   if(0<=x,y,z<=100)\n    d=x+y-z;\n    printf(\""%d\"",d);\n    return 0;\n}\n",ACCEPTED,6,324
1591096647361298432,303021c0ef4f93101c801ad0c8851ab3828a16b5c728ce8e6859ab342ddc4b26,2022-11-11 23:52:56,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""%d\"",2022);\n    return 0;\n}\n",ACCEPTED,3,316
1591096647659094016,0b3466ebddb2bdde378eee8b40d2037097b0a243d9ec4a6495316765e89853eb,2022-11-11 23:52:56,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\t int main ()\n\t{\n\t\tint year;\n\t\tprintf(\""2022：\\n\"");\n     }",WRONG_ANSWER,4,192
1591096722984579072,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-11 23:53:14,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <math.h>\nusing namespace std;\n\nint main(){\n    int n,a=6;\n    scanf(\""%d\"",&n);\n    while (n--){\n        int t = a % 4;\n        if (a%4==0) t = 4;\n        a %= 10;\n        printf(\""%d\\n\"",(int)pow(a,t)%10);\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1591096758690689024,7c63eda0500ff4ce8e233e8b789a4fb856ab6eaf0844db7a6a5f358c4d420a7c,2022-11-11 23:53:23,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d,%d,%d\"",&a,&b,&c);\n    sum=X+Y-Z;\n    printf(sum);\nreturn 0;        \n}",COMPILE_ERROR,0,0
1591096773932789760,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-11 23:53:26,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n#define MAX 100\nint main(void){\n\tint t,n[MAX],i,sum;\n\tscanf(\""%d\\n\"",&t);\n    for(i=0;i<t;i++){\n        scanf(\""%d\"",&n[i]);\n    }\n\tfor(i=0;i<t;i++){\n\t\tsum=pow(6,n[i]);\n        sum=sum%10;\n        printf(\""%d\\n\"",sum);\n\t}\n    return 0;\n}",WRONG_ANSWER,6,344
1591096807579516928,928387ba90b7d3af095968a0f9e0198612ede46fbbd5d1ef0dd919da00a4d7ec,2022-11-11 23:53:34,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#define _CRT_SECURE_NO_WARNINGS 1\n#include<stdlib.h>\n#include<stdio.h>\nint main() {\n\tint n=0, i=0, a[1000] = { 0 };\n\tscanf(\""%d\"", &n);\n\tfor (i = 0; i < n; i++)\n\t{\n\t\tscanf(\""%d\"", &a[i]);\n\t}\n\ti = 0;\n\twhile (i<n)\n\t{\n\t\tif (a[i]==0)\n\t\t{\n\t\t\tprintf(\""0\"");\n\t\t}\n\t\tif (a[i]!=0)\n\t\t{\n\t\t\tprintf(\""6\"");\n\t\t}\n\t\tif (i+1<n)\n\t\t{\n\t\t\tprintf(\""\\n\"");\n\t\t}\n\t\ti++;\n\t}\n}",WRONG_ANSWER,9,324
1591096890073088000,7c63eda0500ff4ce8e233e8b789a4fb856ab6eaf0844db7a6a5f358c4d420a7c,2022-11-11 23:53:54,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d,%d,%d\"",&a,&b,&c);\n    sum=X+Y-Z;\n    printf(sum);   \n}",COMPILE_ERROR,0,0
1591096892195405824,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-11 23:53:54,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <math.h>\nusing namespace std;\n\nint main(){\n    int n,a=6;\n    scanf(\""%d\"",&n);\n    while (n--){\n        int t = a % 4;\n        if (a%4==0) t = 4;\n        a %= 10;\n        printf(\""%d\\n\"",(int)pow(a,t)%10);\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1591096938785734656,20ffd83467b553ac24e1f4b8b096d58858684ca8c3f6a4d5a62be9ff7c4817da,2022-11-11 23:54:06,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int i,j;\n    int t=0,h=0,x;\n    scanf(\""%d\"",&x);\n    for(i=2;i<=x;i++){\n        for(j=2;j<=sqrt(i);j++){\n            if(i%j==0)\n                t++;\n        }\n        if(t==0){\n            h++;\n            t=0;\n        }\n        t=0;\n    }\n    printf(\""%d\\n\"",h);\n}\n\n",ACCEPTED,53,312
1591096941788856320,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-11 23:54:06,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,print（‘2022’）,COMPILE_ERROR,0,0
1591097009069666304,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 23:54:22,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    int n,i,j;\n    int x=0,y=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        c[i]=b[i]-a[i];\n    }\n    for(i=0;i<n;i++)\n    {\n        y+=c[j];\n    }   \n    if(y>x)\n    {\n        x=y;\n        printf(\""%d\\n\"",x);\n    }\n\n}",WRONG_ANSWER,4,184
1591097172454608896,7993d5eb33db661290b93f59cd2334341f7202d055da5cb9949ce9e7841da49a,2022-11-11 23:55:01,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n    int i,j,t,n,a,b;\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++){\n    scanf(\""%d\"",&n);\n    if(n==0)\n    printf(\""1\\n\"");\n    if(n!=0)\n    printf(\""6\\n\"");\n    }\n\n    return 0;\n}\n\n",ACCEPTED,10,308
1591097220437446656,928387ba90b7d3af095968a0f9e0198612ede46fbbd5d1ef0dd919da00a4d7ec,2022-11-11 23:55:13,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#define _CRT_SECURE_NO_WARNINGS 1\n#include<stdlib.h>\n#include<stdio.h>\nint main() {\n\tint n=0, i=0, a[1000000] = { 0 };\n\tscanf(\""%d\"", &n);\n\tfor (i = 0; i < n; i++)\n\t{\n\t\tscanf(\""%d\"", &a[i]);\n\t}\n\ti = 0;\n\twhile (i<n)\n\t{\n\t\tif (a[i]==0)\n\t\t{\n\t\t\tprintf(\""0\"");\n\t\t}\n\t\tif (a[i]!=0)\n\t\t{\n\t\t\tprintf(\""6\"");\n\t\t}\n\t\tif (i+1<n)\n\t\t{\n\t\t\tprintf(\""\\n\"");\n\t\t}\n\t\ti++;\n\t}\n}",WRONG_ANSWER,17,4276
1591097233028747264,ece045c1570c74e6800520e16047010817642535f83b9f2b4524ebdcf9d7925a,2022-11-11 23:55:16,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main() {\n    int t,n,i;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++)\n    {\n    \tscanf(\""%d\"",&a[i]);\n    \tn=pow(6,a[i]);\n    \tprintf(\""%d\\n\"",n%10);\n    \t\n\t}\n\treturn 0; \n}",WRONG_ANSWER,6,192
1591097278931210240,25584884fd716238437f89484285121d106c1090916ab683be624f210130ebad,2022-11-11 23:55:27,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\n#include<time.h> \nint main()\n{\n    time_t t;\n    struct tm *p;\n    time(&t);\n    p=localtime(&t);\n    printf(\""%d\"",1900+p->tm_year);\n }",ACCEPTED,4,312
1591097473983119360,62c83306b4f5c482e4e9a52dc69ae0b8ee7b5238abb34e56352843a0d484ff2c,2022-11-11 23:56:13,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"t = int(input())\nls = list(map(int,input().split()))\n\nprint(6)\n",WRONG_ANSWER,16,2904
1591097529830256640,64b76cc355daf11e96a19b338c58e56c05289d7e3809e9695a09e71771618713,2022-11-11 23:56:26,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n   int i,n,t;\n   scanf (\""%d\"",&t);\n   for(i=0;i<t;i++)\n   {\n       scanf(\""%d\"",&n);\n       if(n==0)\n        printf(\""%d\"",1);\n       printf(\""/n\"");\n       else\n           printf (\""%d\"",6);\n          printf(\""\\n\"");\n       }\n\n  return 0;\n}\n",COMPILE_ERROR,0,0
1591097633698000896,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-11 23:56:51,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"import  math\ndef sushu(n):\n    if n<2:\n        print(\""错误：该数之前无素数\"")\n        if n==2:\n            print(\""2\"")\n            if n>2:\n                print(\""2\"")\n                for i  in range(3,n+1):\n                    for j in range(2,i):\n                        if i%j==0:\n                            breakelse:\n                                print(i)\n                                n=int(input(\""n=\""))\n                                sushu(n)",NON_ZERO_EXIT_CODE,15,2872
1591097683090149376,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 23:57:03,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    int n,i,j;\n    int x=0,y=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        c[i]=b[i]-a[i];\n    }\n    for(i=0;i<n;i++)\n    {\n        for(j=i;j<n;j++)\n        {\n            y+=c[j];\n            if(y>x){\n                x=y;\n                printf(\""%d\\n\"",x);\n            }\n        }\n    }\n    printf(\""%d\"",x);\n}",WRONG_ANSWER,3,196
1591097699036889088,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-11 23:57:07,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"n=int(input())\ncount=1\nfor i in range (3,n,2):\n    for j in range (2,i):\n        if i%j==0:\n            break;\n    else:\n        count+=1\nprint(count)\n",TIME_LIMIT_EXCEEDED,1000,2992
1591097711523332096,899c5501179552dc1fe5639f9047e15d0f835e7a87c8568193377882d0278985,2022-11-11 23:57:10,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,a,i,j,r,x;\n    scanf(\""%d\\n\"",&n);\n    for(i=1;i<=n;i++)\n    {\n        scanf(\""%d \"",&a);\n        x=pow(6,a);\n        y=x%10;\n    }\n    for(j=1;j<=n;j++)\n    {\n        printf(\""%d\\n\"",y);\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1591097763629170688,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 23:57:22,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    int n,i,j;\n    int x=0,y=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        c[i]=b[i]-a[i];\n    }\n    for(i=0;i<n;i++)\n    {\n        for(j=i;j<n;j++)\n        {\n            y+=c[j];\n            if(y>x){\n                x=y;\n            }\n        }\n    }\n    printf(\""%d\"",x);\n}",WRONG_ANSWER,4,180
1591097770927259648,0da8f2df2eb12ff7cceee22b87284a0e7794d94d4125226481c0842fbed3108a,2022-11-11 23:57:24,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n    int i,n,t;\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&n);\n        if(n==0)\n            printf(\""%d\\n\"",1);\n        else\n            printf(\""%d\\n\"",6);\n    }\n}\n",ACCEPTED,9,312
1591097788342009856,64b76cc355daf11e96a19b338c58e56c05289d7e3809e9695a09e71771618713,2022-11-11 23:57:28,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n   int i,n,t;\n   scanf (\""%d\"",&t);\n   for(i=0;i<t;i++)\n   {\n       scanf(\""%d\"",&n);\n       if(n==0)\n        printf(\""%d\"",1);\n       printf(\""\\n\"");\n       else\n           printf (\""%d\"",6);\n          printf(\""\\n\"");\n       }\n\n  return 0;\n}\n",COMPILE_ERROR,0,0
1591097837239185408,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-11 23:57:40,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(void)\n{\n    int n,i,j;\n    int x=0,y=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        c[i]=b[i]-a[i];\n    }\n    for(i=0;i<n;i++)\n    {\n        for(j=i;j<n;j++)\n        {\n            y+=c[j];\n            if(y>x){\n                x=y;\n            }\n        }\n    }\n    printf(\""%d\\n\"",x);\n}",WRONG_ANSWER,3,196
1591097870353235968,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-11 23:57:48,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        new A().m1();\n    }\n}\nclass A{\n    Scanner scanner = new Scanner(System.in);\n    int n = scanner.nextInt();\n    int count = 0;\n    int j = 0;\n    public void m1(){\n        for (int i = 2; i <= n; i++) {\n            j = 2;\n            for (j = 2; j <=i ; j++) {\n                if (i == j)\n                    count++;\n                if (i % j == 0){\n                    break;\n                }\n            }\n        }\n        System.out.println(count);\n    }\n},TIME_LIMIT_EXCEEDED,1000,16924
1591097876212678656,899c5501179552dc1fe5639f9047e15d0f835e7a87c8568193377882d0278985,2022-11-11 23:57:49,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int n,a,i,j,r,x,y;\n    scanf(\""%d\\n\"",&n);\n    for(i=1;i<=n;i++)\n    {\n        scanf(\""%d \"",&a);\n        x=pow(6,a);\n        y=x%10;\n    }\n    for(j=1;j<=n;j++)\n    {\n        printf(\""%d\\n\"",y);\n    }\n    return 0;\n}",WRONG_ANSWER,6,312
1591097876506259456,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-11 23:57:49,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"import  math\ndef sushu(n):\n2<=n<=100000\n        if n==2:\n            print(\""2\"")\n            if n>2:\n                print(\""2\"")\n                for i  in range(3,n+1):\n                    for j in range(2,i):\n                        if i%j==0:\n                            breakelse:\n                                print(i)\n                                n=int(input(\""n=\""))\n                                sushu(n)",NON_ZERO_EXIT_CODE,14,2888
1591098050158858240,eee658ba43cf6fba46676f4d9f167223fd9b57ec54a5d813fd1d01afc3088139,2022-11-11 23:58:30,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stalib.h>\n#include <stdio.h>\n#include<math.h>\nint main()\n{\n    int x,t,n;\n    scanf(\""%d\\n\"",&t);\n    for(x=1;x<=t;x++)\n    {\n     scanf(\""%d\\n\"",&n);\n     if(n==0)\n        printf(\""%d\\n\"",1);\n     else\n        printf(\""%d\\n\"",6);\n     }\n    return 0;\n}",COMPILE_ERROR,0,0
1591098168413040640,ddd0edd80a23dfec88d0679f4ed6037779b80d26db4ba0f74fecb3d447de61fa,2022-11-11 23:58:59,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint i,j,n,flag=0,c=0;\n    scanf(\""%d\"",&n);\nfor(i=2;i<=n;i++)\n{\n    for(j=2;j<=i;j++)\n    {if(i%j==0&&i!=j)\n            flag=1;\n    }\n  if(flag==0)\n  {\n        c++;\n  }\n flag=0;\n}\n    printf(\""%d\"",c);\n}\n\n",TIME_LIMIT_EXCEEDED,1000,328
1591098445392318464,9e0ba8d857885aa94eaa182d3a194e51593598b2d7817b16af4b1b57e49e10de,2022-11-12 00:00:05,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"public class Main {\n    public static void mina(String[] args) {\n        System.out.printf(\""2022\"");\n    }\n}",WRONG_ANSWER,101,14708
1591098516913586176,64b76cc355daf11e96a19b338c58e56c05289d7e3809e9695a09e71771618713,2022-11-12 00:00:22,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n   int i,n,t;\n   scanf (\""%d\"",&t);\n   for(i=0;i<t;i++)\n   {\n       scanf(\""%d\"",&n);\n       if(n==0)\n        printf(\""%d\\n\"",1);\n       else\n           printf (\""%d\"",6);\n          printf(\""\\n\"");\n       }\n\n  return 0;\n}\n",ACCEPTED,12,320
1591098526635982848,9e0ba8d857885aa94eaa182d3a194e51593598b2d7817b16af4b1b57e49e10de,2022-11-12 00:00:24,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,public class Main {\n    public static void mina(String[] args) {\n        System.out.printf(2022);\n    }\n},COMPILE_ERROR,0,0
1591098549771763712,eee658ba43cf6fba46676f4d9f167223fd9b57ec54a5d813fd1d01afc3088139,2022-11-12 00:00:30,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdlib.h>\n#include <stdio.h>\n#include<math.h>\nint main()\n{\n    int x,t,n;\n    scanf(\""%d\\n\"",&t);\n    for(x=1;x<=t;x++)\n    {\n     scanf(\""%d\\n\"",&n);\n     if(n==0)\n        printf(\""%d\\n\"",1);\n     else\n        printf(\""%d\\n\"",6);\n     }\n    return 0;\n}\n",ACCEPTED,12,328
1591098795646062592,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-12 00:01:28,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"str_01=\""2022\""\n    sum=str_01\n    print(sum)",COMPILE_ERROR,0,0
1591098822271504384,928387ba90b7d3af095968a0f9e0198612ede46fbbd5d1ef0dd919da00a4d7ec,2022-11-12 00:01:35,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#define _CRT_SECURE_NO_WARNINGS 1\n#include<stdlib.h>\n#include<stdio.h>\nint main() {\n\tint n=0, i=0, a[1000000] = { 0 };\n\tscanf(\""%d\"", &n);\n\tfor (i = 0; i < n; i++)\n\t{\n\t\tscanf(\""%d\"", &a[i]);\n\t}\n\ti = 0;\n\twhile (i<n)\n\t{\n\t\tif (a[i]==0)\n\t\t{\n\t\t\tprintf(\""1\"");\n\t\t}\n\t\tif (a[i]!=0)\n\t\t{\n\t\t\tprintf(\""6\"");\n\t\t}\n\t\tif (i+1<n)\n\t\t{\n\t\t\tprintf(\""\\n\"");\n\t\t}\n\t\ti++;\n\t}\n}",ACCEPTED,21,4316
1591098823592685568,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-12 00:01:35,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"n=int(input())\ncount=1\nfor i in range (3,n,2):\n    for j in range (3,i,2):\n        if i%j==0:\n            break;\n    else:\n        count+=1\nprint(count)\n",TIME_LIMIT_EXCEEDED,1000,3028
1591098828030279680,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-12 00:01:36,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"str_01=\""2022\""\n    sum=str_01\n    print( sum)",COMPILE_ERROR,0,0
1591098837513605120,9e0ba8d857885aa94eaa182d3a194e51593598b2d7817b16af4b1b57e49e10de,2022-11-12 00:01:38,Java,300.0,1590528927448293376,1590525945717575680,1049226928954454016,public class Main {\n    public static void main(String[] args) {\n        System.out.print(2022);\n    }\n},ACCEPTED,75,15992
1591098851660967936,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-12 00:01:42,Python,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"n=int(input())\nxh=list(map(eval,input().split()))\nhd=list(map(eval,input().split()))\ndata=[]\nmax=0\nfor i in range(n):\n    s=hd[i]-xh[i]\n    data.append(s)\nfor i in range(n):\n    t=0\n    for j in range(i,n,1):\n        t=t+data[j]\n        if t>max:\n            max=t\nprint(max)",ACCEPTED,16,2748
1591098882988249088,9e0ba8d857885aa94eaa182d3a194e51593598b2d7817b16af4b1b57e49e10de,2022-11-12 00:01:49,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,public class Main {\n    public static void main(String[] args) {\n        System.out.printf(2022);\n    }\n},COMPILE_ERROR,0,0
1591098903271878656,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-12 00:01:54,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"print(\""\""2022)",COMPILE_ERROR,0,0
1591098931801559040,7c63eda0500ff4ce8e233e8b789a4fb856ab6eaf0844db7a6a5f358c4d420a7c,2022-11-12 00:02:01,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    sum=X+Y-Z;\n    printf(\""%d\"",sum);   \n}",COMPILE_ERROR,0,0
1591098967042101248,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-12 00:02:09,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        new A().m1();\n    }\n}\nclass A{\n    Scanner scanner = new Scanner(System.in);\n    int n = scanner.nextInt();\n    int count = 0;\n    int j = 0;\n    public void m1(){\n        for (int i = 2; i <= n; i++) {\n            j = 2;\n            for (j = 2; j <=i ; j++) {\n                if (i == j)\n                    count++;\n                if (i % j == 0){\n                    break;\n                }\n            }\n        }\n        System.out.println(count);\n    }\n},TIME_LIMIT_EXCEEDED,1000,16024
1591099127797190656,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-12 00:02:47,Python,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"print(\""\""2022)",NON_ZERO_EXIT_CODE,21,2872
1591099220503867392,b8a7ba8e6c41741e66a8153e5f137c86c8dba9c4dbb2f65f35d7554a5b082d56,2022-11-12 00:03:10,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,b[100],c[100],i,d[100],x=0,j;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++)\n        scanf(\""%d\"",&b[i]);\n      for(i=0;i<a;i++)\n          scanf(\""%d\"",&c[i]);\n      for(i=0;i<a;i++)\n        d[i]=c[i]-b[i];\n    for(i=0;i<a;i++)\n    {\n        int y=0;\n        for(j=i;j<a;j++)\n        {\n            y+=d[j];\n            if(y>x)\n                x=y;\n        }\n    }\n    printf(\""%d\\n\"",x);\n}",ACCEPTED,3,196
1591099267048079360,9e0ba8d857885aa94eaa182d3a194e51593598b2d7817b16af4b1b57e49e10de,2022-11-12 00:03:21,Java,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"public class Main {\n    public static void main(String[] args) {\n        System.out.printf(\""%d\"",2022);\n    }\n}",ACCEPTED,80,14964
1591099308353564672,f55f4c0e0e3367434e26a462e3665271f5b4141ea3de4f34d96fdb21d67e2a7c,2022-11-12 00:03:30,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,w,m,j,z;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&z);\n       if(z!=0)\n        printf(\""6\\n\"");\n       else\n        printf(\""1\\n\"");\n    }\n\n    return 0;\n}\n",ACCEPTED,12,352
1591099455066144768,1b00b3d29099722d8332b35e3af5e54fda309b4f7c9fc6261f618ecd2a4d7390,2022-11-12 00:04:05,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main(int argc, const char * argv[]) {\n    // insert code here...\n    \n    int w[1024] = {0};\n    int q[1024] = {0};\n    int n = 0;\n    scanf(\""%d\"", &n);\n    \n    for (int i = 0; i < n; i++) {\n        scanf(\""%d\"", &w[i]);\n    }\n    for (int j = 0; j < n; j++) {\n        scanf(\""%d\"", &q[j]);\n    }\n    \n    int sum = 0;\n    int maxsum = 0;\n    for (int i = 0; i < n; i++) {\n        int ret = q[i] - w[i];\n        sum += ret;\n        if (maxsum < sum) {\n            maxsum = sum;\n        }\n    }\n    \n    printf(\""%d\\n\"", maxsum);\n    return 0;\n}",WRONG_ANSWER,3,312
1591099477295960064,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-12 00:04:11,Python,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"str_1=\""2022\""\nsum=str_1\nprint（sum）",NON_ZERO_EXIT_CODE,15,2876
1591099547017850880,7c63eda0500ff4ce8e233e8b789a4fb856ab6eaf0844db7a6a5f358c4d420a7c,2022-11-12 00:04:27,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    sum=X+Y-Z;\n    printf(\""%d\"",sum);   \n    return 0;\n}",COMPILE_ERROR,0,0
1591099622074945536,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-12 00:04:45,Python,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"print( \""\""2022)",NON_ZERO_EXIT_CODE,18,2872
1591099665787957248,ece045c1570c74e6800520e16047010817642535f83b9f2b4524ebdcf9d7925a,2022-11-12 00:04:56,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main() {\n    int t,n,i;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++)\n    {\n    \tscanf(\""%d\"",&a[i]);\n\t}\n\t  for(i=0;i<t;i++)\n    {\n    \tn=pow(6,a[i]);\n    \tprintf(\""%d\\n\"",n%10);\n\t}\n\n\treturn 0;\n}\n",WRONG_ANSWER,6,460
1591099776391778304,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 00:05:22,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n int n,r;\n scanf(\""%d\"",&n);\n int a=pow(6,n);\n \tif(a==0)\n\tprintf(\""1\\n\"");\n    r=a%10;\n    printf(\""%d\"",r);\n\t}\n\n",WRONG_ANSWER,3,188
1591099842586279936,7c63eda0500ff4ce8e233e8b789a4fb856ab6eaf0844db7a6a5f358c4d420a7c,2022-11-12 00:05:38,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    a=X+Y-Z;\n    printf(\""%d\"",a);   \n    return 0;\n}",COMPILE_ERROR,0,0
1591099909971972096,ddd0edd80a23dfec88d0679f4ed6037779b80d26db4ba0f74fecb3d447de61fa,2022-11-12 00:05:54,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint i,j,n,flag=0,c=0;\n    scanf(\""%d\"",&n);\nfor(i=2;i<=n;i++)\n{\n    for(j=2;j<=i;j++)\n    {\n        if(i%j==0&&i!=j)\n           break;\n    }\n    if(j-1==i)\n        c++;\n\n}\n    printf(\""%d\"",c);\n}\n\n",TIME_LIMIT_EXCEEDED,1000,376
1591099930440151040,b7ca5a176d530473c8faa24fa803cc5b5bef6deef335789b05821ec37e6b8252,2022-11-12 00:05:59,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n\nint main()\n\n{\n\n\tint n,a,i=0;\tscanf(\""%d\"",&n);\n\n\tfor(i=0;i<n;i++){\n\n\t\tscanf(\""%d\"",&a);\n\n\t\tif(a==0)\n\n\t\t\tprintf(\""1\"");\n\n\t\telse\n\n\t\t\tprintf(\""6\"");\n\n         printf(\""\\n\"");\n\n\t\t}\n\n\treturn 0;\n\n}",ACCEPTED,10,308
1591100025671823360,ddd0edd80a23dfec88d0679f4ed6037779b80d26db4ba0f74fecb3d447de61fa,2022-11-12 00:06:21,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint i,j,n,c=0;\n    scanf(\""%d\"",&n);\nfor(i=2;i<=n;i++)\n{\n    for(j=2;j<=i;j++)\n    {\n        if(i%j==0&&i!=j)\n           break;\n    }\n    if(j-1==i)\n        c++;\n\n}\n    printf(\""%d\"",c);\n}\n\n",TIME_LIMIT_EXCEEDED,1000,276
1591100067287728128,62c83306b4f5c482e4e9a52dc69ae0b8ee7b5238abb34e56352843a0d484ff2c,2022-11-12 00:06:31,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"t = int(input())\nls = list(map(int,input().split()))\nfor n in ls:\n    number = num = 6 ** n\n    c = 0\n    while num!=0:\n        num=num//10\n        c+=1\n    unit = number % (10**(c-1))\n    print(unit)",WRONG_ANSWER,15,2784
1591100081355403264,cb5ee28f5d61aba010f231fd6045de7f8516849eb1dbf293dc5a73a02c3aea2f,2022-11-12 00:06:35,Python,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"count=1\nn=int(input())\nprimenumber=[3]\nfor i in range(3,n,2):\n    t=False\n    if i>10 and i%10==5:\n        continue\n    for j in primenumber:\n        if j>int(i**0.5):\n            t=True\n            break\n        if i%j==0:\n            t=False\n            break\n    if t:\n        count+=1\n        primenumber.append(i)\nprint(count)",ACCEPTED,203,3408
1591100123621425152,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-12 00:06:45,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        new A().m1();\n    }\n}\nclass A{\n    Scanner scanner = new Scanner(System.in);\n    int n = scanner.nextInt();\n    int count = 0;\n    int i = 2;\n    int j;\n    public void m1(){\n        while (i<=n){\n            j = 2;\n            for (j = 2; j <=i ; j++) {\n                if (i == j)\n                    count++;\n                if (i % j == 0){\n                    break;\n                }\n            }\n            i++;\n        }\n        System.out.println(count);\n    }\n},TIME_LIMIT_EXCEEDED,1000,16920
1591100197537644544,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 00:07:02,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"count = 0\nleap = 1\nfrom math  import sqrt\nfor m in range(2,100000):\n    k=int(sqrt(m+1))\n                    for j in range(2,k+1):\n                        if m%j==0:\n                    leap=0\n                     break\n       if leap == 1:\n        print('%5d' % m,end='')\n        count += 1\n        if count % 10 ==0:\n            print(end='')\n            leap = 1\n            print('\\n')",NON_ZERO_EXIT_CODE,16,2796
1591100205821399040,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-12 00:07:04,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"n=int(input())\ncount=1\nfor i in range (3,n,2):\n    for j in range (3,i,2):\n        if i%j==0:\n            break;\n    else:\n        count+=1\nprint(count)\n",TIME_LIMIT_EXCEEDED,1000,2916
1591100245247832064,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-12 00:07:14,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"\nb = int(input())\nnum = []\ncount = 0\nfor j in range(2,b+1):\n    for k in num:\n        if j % k == 0:\n             break\n    else:\n        num.append(j)\n        count = 1+count\nprint(count)\n\n",TIME_LIMIT_EXCEEDED,1000,3060
1591100266487787520,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-12 00:07:19,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"import datetime\n\ncurrentDateTime = datetime.datetime.now()\ndate = currentDateTime.date()\nyear = date.strftime(\""%Y\"")\nprint(f\""{year}\"")",ACCEPTED,18,3128
1591100289392902144,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-12 00:07:24,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=eval(input())\nlist = map(eval,input().split())\nfor i in list:\n    if 0<=i<=1000000000:\n        if i==0:\n            print(\""1\"")\n        else:\n            print(\""6\"")",WRONG_ANSWER,32,2756
1591100459895533568,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-12 00:08:05,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"/*#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#include<string.h>\nint main()\n{int t,j,n;\nint x,len;\n char k[3000];\nscanf(\""%d\"",&t);\nint y[t];\nfor(j=0;j<t;j++)\n{\n    scanf(\""%d\"",&y[j]);\n\n}\nfor (j=0;j<t;j++)\n{\n     if(y[j]>=0&&y[j]<=int(pow(10,9))) {\n        k=char(pow(6,y[j]));\n        len=string(k);\n         x=int(k[len-1]);\n        printf(\""%d\"",x);\n     if(j<t-1) printf(\""\\n\"");\n}\n\nreturn 0;\n}\n}\n*/\n/*\n#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#include<string.h>\nint main()\n{int t,j,n,x;\nx=6;\nscanf(\""%d\"",&t);\nint y[t];\nfor(j=0;j<t;j++)\n{\n    scanf(\""%d\"",&y[j]);\n\n}\nfor (j=0;j<t;j++)\n{\n     if(y[j]>0) {\n        //n=int(pow(6,0));\n        //x=int(pow(6,y[j]))%10;\n        printf(\""%d\"",x);\n     if(j<t-1) printf(\""\\n\"");\n}\n    if(y[j]==0)\n    {\n        printf(\""1\"");\n        if(j<t-1) printf(\""\\n\"");\n    }\n}\nreturn 0;\n}*/\n/*\n#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main()\n{int t,j,n,x;\nx=6;\nscanf(\""%d\"",&t);\nint y;\nfor (j=0;j<t;j++)\n{\n    scanf(\""%d\"",&n);\n    if(n>=0&&n<=1000000000)\n    {\n\n\n    if(n>0) {x=6;printf(\""%d\"",x);}\n    if(n==0) {x=1;printf(\""%d\"",x);}\n    if(j<t-1) printf(\""\\n\"");\n    }\n\n}\nreturn 0;\n}*/\n#include<iostream>\n#include<stdio.h>\n#include<stdlib.h>\n#include<bits/stdc++.h>\n#include<math.h>\nusing namespace std;\nint fun(int n) {\n    if (n==0) return 1;\n    int t=6;\n    for (int i=0;i<n;++i) {\n        t=(t*t)%10;\n    }\nreturn t;\n}\n\nint main() {\n    int x;\n    cin >> x;\n    int n;\n    for (int i=0;i<x;++i) {\n        cin >> n;\n        cout << fun(n);\n        printf(\""\\n\"");\n    }\n    \n    return 0;\n}",ACCEPTED,11,592
1591100559568994304,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 00:08:29,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"count = 0\nleap = 1\nfrom math  import sqrt\nfor m in range(2,100000):\n    k=int(sqrt(m+1))\n                    for j in range(2, k + 1):\n                        if m%j==0:\n                    leap=0\n                     break\n       if leap == 1:\n        print('%5d' % m,end='')\n        count += 1\n        if count % 10 ==0:\n            print(end='')\n            leap = 1\n            print('\\n')",NON_ZERO_EXIT_CODE,14,2744
1591100562156879872,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-12 00:08:29,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    Scanner scanner = new Scanner(System.in);\n    int n = scanner.nextInt();\n    int count = 0;\n    public static void main(String[] args) {\n        new Main().m1();\n    }\n    public void m1(){\n        for (int i = 2; i <= n; i++) {\n            int j = 2;\n            for (j = 2; j <=i ; j++) {\n                if (i == j)\n                    count++;\n                if (i % j == 0){\n                    break;\n                }\n            }\n        }\n        System.out.println(count);\n    }\n},TIME_LIMIT_EXCEEDED,1000,16996
1591100643878678528,728333bef081d9e7c2f5ed7da68b3e75b53967cbc5c7c50ba4c13ac6a2ba301d,2022-11-12 00:08:49,C++,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<iostream>\n#include<math.h>\nusing namespace std;\nclass reslove {\npublic:\n\tvoid reslve(int* c,int n) {\n\t\tint max = 0;\n\t\tint b = 0;\n\t\tfor (int i = 0; i < n;i++) {\n\t\t\tif (b > 0)\n\t\t\t\tb += c[i];\n\t\t\telse\n\t\t\t\tb = c[i];\n\t\t\tif (b > max)\n\t\t\t\tmax = b;\n\t\t}\n\t\tcout << max<<endl;\n\t}\n};\nint main(int argc, char* argv[])\n{\n\tint i, n, a[100], b[100], c[100];\n\tcin >> n;\n\tfor (i = 0; i < n; i++) {\n\t\tcin >> a[i];\n\t}\n\tfor (i = 0; i < n; i++) {\n\t\tcin >> b[i];\n\t}\n\tfor (i = 0; i < n; i++) {\n\t\tc[i] = b[i] - a[i];\n\t}\n\treslove res;\n\tres.reslve(c, n);\n\treturn 0;\n}",ACCEPTED,3,328
1591100660714614784,b992c06b57b04360434d455f81624e73cf73457cb8c864e2c56c169af4d1d221,2022-11-12 00:08:53,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"/*#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#include<string.h>\nint main()\n{int t,j,n;\nint x,len;\n char k[3000];\nscanf(\""%d\"",&t);\nint y[t];\nfor(j=0;j<t;j++)\n{\n    scanf(\""%d\"",&y[j]);\n\n}\nfor (j=0;j<t;j++)\n{\n     if(y[j]>=0&&y[j]<=int(pow(10,9))) {\n        k=char(pow(6,y[j]));\n        len=string(k);\n         x=int(k[len-1]);\n        printf(\""%d\"",x);\n     if(j<t-1) printf(\""\\n\"");\n}\n\nreturn 0;\n}\n}\n*/\n/*\n#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#include<string.h>\nint main()\n{int t,j,n,x;\nx=6;\nscanf(\""%d\"",&t);\nint y[t];\nfor(j=0;j<t;j++)\n{\n    scanf(\""%d\"",&y[j]);\n\n}\nfor (j=0;j<t;j++)\n{\n     if(y[j]>0) {\n        //n=int(pow(6,0));\n        //x=int(pow(6,y[j]))%10;\n        printf(\""%d\"",x);\n     if(j<t-1) printf(\""\\n\"");\n}\n    if(y[j]==0)\n    {\n        printf(\""1\"");\n        if(j<t-1) printf(\""\\n\"");\n    }\n}\nreturn 0;\n}*/\n/*\n#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main()\n{int t,j,n,x;\nx=6;\nscanf(\""%d\"",&t);\nint y;\nfor (j=0;j<t;j++)\n{\n    scanf(\""%d\"",&n);\n    if(n>=0&&n<=1000000000)\n    {\n\n\n    if(n>0) {x=6;printf(\""%d\"",x);}\n    if(n==0) {x=1;printf(\""%d\"",x);}\n    if(j<t-1) printf(\""\\n\"");\n    }\n\n}\nreturn 0;\n}*/\n#include<iostream>\n#include<stdio.h>\n#include<stdlib.h>\n#include<bits/stdc++.h>\n#include<math.h>\nusing namespace std\nint fun(int n) {\n    if (n==0) return 1;\n    int t=6;\n    for (int i=0;i<n;++i) {\n        t=(t*t)%10;\n    }\nreturn t;\n}\n\nint main() {\n    int x;\n    cin >> x;\n    int n;\n    for (int i=0;i<x;++i) {\n        cin >> n;\n        cout << fun(n);\n        printf(\""\\n\"");\n    }\n    \n    return 0;\n}",COMPILE_ERROR,0,0
1591100664418209792,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 00:08:54,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n int n,r,a;\n    scanf (\""%d\"",&a);\n    for(int i=0;i<a;i++);\n scanf(\""%d\"",&n);\n int a=pow(6,n);\n \tif(a==0)\n\tprintf(\""1\\n\"");\n    r=a%10;\n    printf(\""%d\"",r);\n\t}\n\n",COMPILE_ERROR,0,0
1591100666204979200,29249e539dec3766ca388aaa46121bd2a768da21260d3f436e20eeaac8ee73b3,2022-11-12 00:08:54,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h> \n#include<math.h>\nint main(){\nint n;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(int i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n    \n    for(int i=0;i<n-1;i++){\n       if(a[i]==0&&i<(n-1)) printf(\""1\\n\"");\n       else printf(\""6\\n\"");\n    }\n    if(a[n-1]==0) printf(\""1\"");\n    else printf(\""6\"");\n\t\n}\n",WRONG_ANSWER,72,436
1591100698601783296,9e0ba8d857885aa94eaa182d3a194e51593598b2d7817b16af4b1b57e49e10de,2022-11-12 00:09:02,Java,0.0,1590524835191705600,1572865591226855424,1049226928954454016,public class Main {\n    public void static main(String[] args) {\n        Scanner scannr = new System.scanner(System.in);\n        int x = scanner.nextInt();\n        int y = scanner.nextInt();\n        int z = scanner.nextInt();\n        System.out.print(x - y);\n    }\n},COMPILE_ERROR,0,0
1591100700673769472,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 00:09:02,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"count = 0\nleap = 1\nfrom math  import sqrt\nfor m in range(2,100000):\n    k=int(sqrt(m+1))\n                    for j in range(2, k + 1):\n                        if m%j==0:\n                    leap=0\n                     break\n       if leap == 1:\n        print('%5d' % m,end='')\n        count += 1\n        if count % 10 ==0:\n            print(end='')\n            leap = 1\n            print('\\n')",NON_ZERO_EXIT_CODE,16,2936
1591100701298700288,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 00:09:03,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n int n,r,a;\n    scanf(\""%d\"",&a);\n    for(int i=0;i<a;i++);\n scanf(\""%d\"",&n);\n int a=pow(6,n);\n \tif(a==0)\n\tprintf(\""1\\n\"");\n    r=a%10;\n    printf(\""%d\"",r);\n\t}\n\n",COMPILE_ERROR,0,0
1591100778964647936,29249e539dec3766ca388aaa46121bd2a768da21260d3f436e20eeaac8ee73b3,2022-11-12 00:09:21,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h> \n#include<math.h>\nint main(){\nint n;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(int i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n    \n    for(int i=0;i<n-1;i++){\n       if(a[i]==0&&i<(n-1)) printf(\""1\\n\"");\n       else printf(\""6\\n\"");\n    }\n    if(a[n-1]==0) printf(\""1\"");\n    else printf(\""6\"");\n\t\n}\n",WRONG_ANSWER,70,440
1591100824577703936,28b4de6882b7ade2679f59c486acaf307ce8415dcb0a15787dba589025bbdb02,2022-11-12 00:09:32,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,3,320
1591100882945642496,29249e539dec3766ca388aaa46121bd2a768da21260d3f436e20eeaac8ee73b3,2022-11-12 00:09:46,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int i,j,n=0,x,flag;\n    scanf(\""%d\"",&x);\n    for (i=2;i<x;i++)\n    {\n        flag=0;\n        for(j=2;j<i;j++)\n        {\n            if(i%j==0)\n                {\n                flag++;\n                 break;\n                }\n        }\n        if (flag==0)\n            n=n+1;\n    }\n    printf(\""%d\"",n);\n    return 0;\n}\n",ACCEPTED,921,308
1591100892558987264,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-12 00:09:48,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=eval(input())\nm = 0\nlist = map(eval,input().split())\nfor i in list:\n    if 0<=i<=1000000000:\n        m+1=m\n        if m<a:\n            if i==0:\n                print(\""1\"")\n            else:\n                print(\""6\"")\n         else:\n             if i==0:\n                print(\""1\"",end=\""\"")\n            else:\n                print(\""6\"",end=\""\"")",NON_ZERO_EXIT_CODE,15,2756
1591100899081125888,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-12 00:09:50,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"X,Y,Z=map(int,input().split())\nif 0<=X<=100 \nand 0<=Y<=100 \nand 0<=Z<=100:\n    print(X+Y-Z)",NON_ZERO_EXIT_CODE,16,2880
1591100901920673792,28b4de6882b7ade2679f59c486acaf307ce8415dcb0a15787dba589025bbdb02,2022-11-12 00:09:50,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,b,c;\n    scanf(\""%d%d%d\"",&a,&b,&c);\n    printf(\""%d\"",a+b-c);\n    return 0;\n}",ACCEPTED,5,320
1591100919356391424,dcc1017bcd698bd6a0eee54e4ed848d4c51a3a26608990cdd2137e4c01065a1e,2022-11-12 00:09:55,C++,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<iostream>\n#include<math.h>\nusing namespace std;\nclass reslove {\npublic:\n\tvoid reslve(int* c,int n) {\n\t\tint max = 0;\n\t\tint b = 0;\n\t\tfor (int i = 0; i < n;i++) {\n\t\t\tif (b > 0)\n\t\t\t\tb += c[i];\n\t\t\telse\n\t\t\t\tb = c[i];\n\t\t\tif (b > max)\n\t\t\t\tmax = b;\n\t\t}\n\t\tcout << max;\n\t}\n};\nint main(int argc, char* argv[])\n{\n\tint i, n, a[100], b[100], c[100];\n\tcin >> n;\n\tfor (i = 0; i < n; i++) {\n\t\tcin >> a[i];\n\t}\n\tfor (i = 0; i < n; i++) {\n\t\tcin >> b[i];\n\t}\n\tfor (i = 0; i < n; i++) {\n\t\tc[i] = b[i] - a[i];\n\t}\n\treslove res;\n\tres.reslve(c, n);\n\treturn 0;\n}",ACCEPTED,3,320
1591100953741275136,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 00:10:03,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"count = 0\nleap = 1\nfrom math  import sqrt\nfor m in range(2,100000):\n    k=int(sqrt(m+1))\n    for j in range(2, k + 1):\n                        if m%j==0:\n                    leap=0\n                     break\n       if leap == 1:\n        print('%5d' % m,end='')\n        count += 1\n        if count % 10 ==0:\n            print(end='')\n            leap = 1\n            print('\\n')",NON_ZERO_EXIT_CODE,15,2744
1591100971160219648,28b4de6882b7ade2679f59c486acaf307ce8415dcb0a15787dba589025bbdb02,2022-11-12 00:10:07,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint i,j,k=0,n,flag;\n\tscanf(\""%d\"",&n);\n\tfor(i=1;i<=n;i++)\n\t{\n\tflag=0;\n\tfor(j=2;j<=sqrt(i);j++)\n\t{\n\t\tif(i%j==0)\n\t\t{\n\t\t\tflag=1;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif(flag==0)\n\t{\n\t\tk++;\n\t}\n\t\n\t}\n\tprintf(\""%d\"",k-1);\n    return 0;\n}",ACCEPTED,13,316
1591101014940364800,62c83306b4f5c482e4e9a52dc69ae0b8ee7b5238abb34e56352843a0d484ff2c,2022-11-12 00:10:17,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"t = int(input())\nls = list(map(int,input().split()))\nfor n in ls:\n    number = num = 6 ** n\n    c = 0\n    unit = number % 10\n    print(unit)",TIME_LIMIT_EXCEEDED,165,4000
1591101045231628288,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-12 00:10:25,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"n=int(input())\ncount=1\nfor i in range (3,n,2):\n    for j in range (3,i,2):\n        if i%j==0:\n            break;\n        else:\n        count+=1\nprint(count)\n",NON_ZERO_EXIT_CODE,17,2744
1591101075019575296,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-12 00:10:32,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"n=int(input())\ncount=1\nfor i in range (3,n,2):\n    for j in range (3,i,2):\n        if i%j==0:\n            break;\n        else:\n        count+=1\nprint(count)\n",NON_ZERO_EXIT_CODE,19,2872
1591101098398650368,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-12 00:10:37,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"X,Y,Z = map(int,input().split())\nif 0<=X<=100 \nand 0<=Y<=100 \nand 0<=Z<=100:\n    print(X+Y-Z)",NON_ZERO_EXIT_CODE,16,2744
1591101115666599936,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-12 00:10:41,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int n = scanner.nextInt();\n        int count = 0;\n        for (int i = 2; i <= n; i++) {\n            for (int j = 2; j <=i ; j++) {\n                if (i == j)\n                    count++;\n                if (i % j == 0){\n                    break;\n                }\n            }\n        }\n        System.out.println(count);\n    }\n    \n},TIME_LIMIT_EXCEEDED,1000,16724
1591101119038816256,62c83306b4f5c482e4e9a52dc69ae0b8ee7b5238abb34e56352843a0d484ff2c,2022-11-12 00:10:42,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"t = int(input())\nls = list(map(int,input().split()))\nfor n in ls:\n    num = 6 ** n\n    c = 0\n    unit = num % 10\n    print(unit)",TIME_LIMIT_EXCEEDED,166,4044
1591101137154019328,62c83306b4f5c482e4e9a52dc69ae0b8ee7b5238abb34e56352843a0d484ff2c,2022-11-12 00:10:46,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"t = int(input())\nls = list(map(int,input().split()))\nfor n in ls:\n    num = 6 ** n\n    c = 0\n    unit = num % 10\n    print(unit)",TIME_LIMIT_EXCEEDED,168,4004
1591101147857858560,9e0ba8d857885aa94eaa182d3a194e51593598b2d7817b16af4b1b57e49e10de,2022-11-12 00:10:49,Java,0.0,1590524835191705600,1572865591226855424,1049226928954454016,public class Main {\n    public void static main(String[] args) {\n        Scanner scannr = new Scanner(System.in);\n        int x = scanner.nextInt();\n        int y = scanner.nextInt();\n        int z = scanner.nextInt();\n        System.out.print(x - y);\n    }\n},COMPILE_ERROR,0,0
1591101155655069696,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-12 00:10:51,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"n=int(input())\ncount=1\nfor i in range (3,n,2):\n    for j in range (3,i,2):\n        if i%j==0:\n            break;\n    else:\n        count+=1\nprint(count)\n",TIME_LIMIT_EXCEEDED,1000,4140
1591101164324720640,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-12 00:10:53,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"X,Y,Z = map(int,input().split())\nif 0 <=X<= 100 \nand 0 <=Y<= 100 \nand 0 <=Z<= 100:\n    print(X+Y-Z)",NON_ZERO_EXIT_CODE,15,2888
1591101179063500800,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-12 00:10:56,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=eval(input())\nm = 0\nlist = map(eval,input().split())\nfor i in list:\n    if 0<=i<=1000000000:\n        m=m+1\n        if m<a:\n            if i==0:\n                print(\""1\"")\n            else:\n                print(\""6\"")\n        else:\n            if i==0:\n                print(\""1\"",end=\""\"")\n            else:\n                print(\""6\"",end=\""\"")\n",WRONG_ANSWER,29,2756
1591101186541944832,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 00:10:58,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"count = 0\nleap = 1\nfrom math  import sqrt\nfor m in range(2,100000):\n    k=int(sqrt(m+1))\n    for j in range(2, k + 1):\n        if m%j==0:\n            leap=0\n            break\n    if leap == 1:\n        print('%5d' % m,end='')\n        count += 1\n        if count % 10 ==0:\n            print(end='')\n            leap = 1\n            print('\\n')",WRONG_ANSWER,266,2876
1591101214383738880,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-11-12 00:11:05,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int i,j,n=0,x,flag;\n    scanf(\""%d\"",&x);\n    for (i=2;i<x;i++)\n    {\n        flag=0;\n        for(j=2;j<i;j++)\n        {\n            if(i%j==0)\n                {\n                flag++;\n                 break;\n                }\n        }\n        if (flag==0)\n            n=n+1;\n    }\n    printf(\""%d\"",n);\n    return 0;\n}\n",ACCEPTED,923,316
1591101228090720256,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-12 00:11:08,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"n=int(input())\ncount=1\nfor i in range (3,n,2):\n    for j in range (3,i,2):\n        if i%j==0:\n            break;\n    else:\n        count+=1\nprint(count)\n",TIME_LIMIT_EXCEEDED,1000,2920
1591101266724454400,834ba62d861cf2d94a81f3b034a55b21f1378d4337b6b065c321d7da6bf82e17,2022-11-12 00:11:17,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,n = int(input())\nif n==0:\n    print(1)\n    print(6)\n    print(6)\nelse:\n    print(6)\n    print(6)\n    print(6),WRONG_ANSWER,15,2744
1591101304271863808,9e0ba8d857885aa94eaa182d3a194e51593598b2d7817b16af4b1b57e49e10de,2022-11-12 00:11:26,Java,0.0,1590524835191705600,1572865591226855424,1049226928954454016,public class Main {\n    public static void main(String[] args) {\n        Scanner scannr = new Scanner(System.in);\n        int x = scanner.nextInt();\n        int y = scanner.nextInt();\n        int z = scanner.nextInt();\n        System.out.print(x - y);\n    }\n},COMPILE_ERROR,0,0
1591101318863847424,62c83306b4f5c482e4e9a52dc69ae0b8ee7b5238abb34e56352843a0d484ff2c,2022-11-12 00:11:30,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"def IsPrime(k):        \n    if k == 1:\n        return False        \n    for i in range(2,k):            \n        if k % i == 0:                \n            return False        \n    return True\ndef GetPrimes(n):        \n    primes = []        \n    for i in range (1,n):            \n        if IsPrime(i):                \n            primes.append(i)        \n    return primes    \nn = int(input(\""请输入一个整数：\""))    \nprint(GetPrimes(n))\n",TIME_LIMIT_EXCEEDED,1000,3036
1591101394571034624,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-12 00:11:48,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=eval(input())\nm = 0\nlist = map(eval,input().split())\nfor i in list:\n    if 0<=i<=1000000000:\n        m=m+1\n        if m<a:\n            if i==0:\n                print(\""1\"")\n            else:\n                print(\""6\"")\n        if m==a:\n            if i==0:\n                print(\""1\"",end=\""\"")\n            else:\n                print(\""6\"",end=\""\"")\n",WRONG_ANSWER,34,2872
1591101418226888704,62c83306b4f5c482e4e9a52dc69ae0b8ee7b5238abb34e56352843a0d484ff2c,2022-11-12 00:11:53,Python,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"t = int(input())\nls = list(map(int,input().split()))\nfor n in ls:\n    if n == 0:\n        print(1)\n    else:\n        print(6)\n    ",ACCEPTED,46,3744
1591101535495454720,9e0ba8d857885aa94eaa182d3a194e51593598b2d7817b16af4b1b57e49e10de,2022-11-12 00:12:21,Java,0.0,1590524835191705600,1572865591226855424,1049226928954454016,import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scannr = new Scanner(System.in);\n        int x = scanner.nextInt();\n        int y = scanner.nextInt();\n        int z = scanner.nextInt();\n        System.out.print(x - y);\n    }\n},COMPILE_ERROR,0,0
1591101558681546752,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 00:12:27,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"count = 0\nleap = 1\nfrom math  import sqrt\nfor m in range(2,100000):\n    k=int(sqrt(m+1))\n    for j in range(2, k + 1):\n        if m%j==0:\n            leap=0\n            break\n    if leap == 1:\n        print('%5d' % m,end='')\n        count += 1\n        if count % 10 ==0:\n            print(end='')\n            leap = 1\n            print('\\n')",WRONG_ANSWER,261,3268
1591101577321058304,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-12 00:12:31,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int n = scanner.nextInt();\n        int count = 0,i,j;\n        for (i = 2; i <= n; i++) {\n            for (j = 2; j <=i ; j++) {\n                if (i == j)\n                    count++;\n                if (i % j == 0){\n                    break;\n                }\n            }\n        }\n        System.out.println(count);\n    }\n}",TIME_LIMIT_EXCEEDED,1000,16380
1591101620761440256,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-12 00:12:42,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=eval(input())\nm = 0\nlist = map(eval,input().split())\nfor i in list:\n    m=m+1\n    if 0<=i<=1000000000:\n        if m<a:\n            if i==0:\n                print(\""1\"")\n            else:\n                print(\""6\"")\n        if m==a:\n            if i==0:\n                print(\""1\"",end=\""\"")\n            else:\n                print(\""6\"",end=\""\"")\n",WRONG_ANSWER,31,3380
1591101621684207616,9e0ba8d857885aa94eaa182d3a194e51593598b2d7817b16af4b1b57e49e10de,2022-11-12 00:12:42,Java,0.0,1590524835191705600,1572865591226855424,1049226928954454016,import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int x = scanner.nextInt();\n        int y = scanner.nextInt();\n        int z = scanner.nextInt();\n        System.out.print(x - y);\n    }\n},WRONG_ANSWER,132,16552
1591101627535265792,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-12 00:12:43,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<n;i++)\n    {\n        int k=0;\n        for(k=2;k<i;k++)\n        {\n           if(i%k==0)\n           {\n               break;\n           }\n        }\n        if(i==0)\n        {\n            j++;\n        }\n    }\n    printf(\""%d\"",j);\n}",WRONG_ANSWER,3,312
1591101674612129792,c003ca779d3851356411927234ed09d4b99c3bf9393a6e2ad2af3882b81e8670,2022-11-12 00:12:55,C++,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<n;i++)\n    {\n        int k=0;\n        for(k=2;k<i;k++)\n        {\n           if(i%k==0)\n           {\n               break;\n           }\n        }\n        if(i==k)\n        {\n            j++;\n        }\n    }\n    printf(\""%d\"",j);\n}",ACCEPTED,918,380
1591101691208990720,20ffd83467b553ac24e1f4b8b096d58858684ca8c3f6a4d5a62be9ff7c4817da,2022-11-12 00:12:59,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n#define M 1000\nint main(){\nint i,n, x[M];\nint z;\nscanf(\""%d\"",&n);\nfor(i=0;i<n;i++)\nscanf(\""%d\"",&x[i]);\nfor(i=0;i<n;i++){ \nif(x[i]==0)\nprintf(\""1\\n\"");\nelse {z=pow(6,x[i]);\n      z=z%10;\n      printf(\""%d\\n\"",z);\n     }\n     }\n     }",WRONG_ANSWER,6,456
1591101725669371904,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-12 00:13:07,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"X,Y,Z = map(int,input().split())；\nif 0 <=X<= 100 \nand 0 <=Y<= 100 \nand 0 <=Z<= 100:\n    print(X+Y-Z)",NON_ZERO_EXIT_CODE,15,2748
1591101771416670208,9e0ba8d857885aa94eaa182d3a194e51593598b2d7817b16af4b1b57e49e10de,2022-11-12 00:13:18,Java,300.0,1590524835191705600,1572865591226855424,1049226928954454016,import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int x = scanner.nextInt();\n        int y = scanner.nextInt();\n        int z = scanner.nextInt();\n        System.out.print(x + y - z);\n    }\n},ACCEPTED,239,17024
1591101813187739648,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-12 00:13:28,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int n = scanner.nextInt();\n        int count = 0,i,j;\n        for (i = 2; i <= n; i++) {\n            for (j = 2; j <=i ; j++) {\n                if (i == j){}\n                    count++;\n                    break;\n            }\n                if (i % j == 0)\n                    break;\n            }\n        }\n        System.out.println(count);\n    }\n}",COMPILE_ERROR,0,0
1591101841960644608,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-12 00:13:35,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int n = scanner.nextInt();\n        int count = 0,i,j;\n        for (i = 2; i <= n; i++) {\n            for (j = 2; j <=i ; j++) {\n                if (i == j){\n                    count++;\n                    break;\n            }\n                if (i % j == 0)\n                    break;\n            }\n        }\n        System.out.println(count);\n    }\n}",TIME_LIMIT_EXCEEDED,1000,16628
1591101849296502784,ddd0edd80a23dfec88d0679f4ed6037779b80d26db4ba0f74fecb3d447de61fa,2022-11-12 00:13:36,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint i,j,n,c=0;\n    scanf(\""%d\"",&n);\nfor(i=2;i<=n;i++)\n{\n    for(j=2;j<=i;j++)\n    {\n        if(i%j==0&&i!=j)\n           break;\n    }\n    if(j-1==i)\n        c++;\n\n}\n    printf(\""%d\"",c);\n}\n\n",TIME_LIMIT_EXCEEDED,1000,420
1591101879323525120,ddd0edd80a23dfec88d0679f4ed6037779b80d26db4ba0f74fecb3d447de61fa,2022-11-12 00:13:43,C++,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint i,j,n,c=0;\n    scanf(\""%d\"",&n);\nfor(i=2;i<=n;i++)\n{\n    for(j=2;j<=i;j++)\n    {\n        if(i%j==0&&i!=j)\n           break;\n    }\n    if(j-1==i)\n        c++;\n\n}\n    printf(\""%d\"",c);\n}\n\n",ACCEPTED,945,312
1591102061440208896,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-12 00:14:27,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"\n   #include <stdio.h>\n   #include <math.h>\n   int main(){\n     long int n,x[1000],t;\n      scanf(\""%d\"",&n);\n      for(int i=0;i<n;i++){\n            scanf(\""%d\"",&x[i]);\n            t=sqrt(x[i]);\n      }\n      for(int i=0;i<n;i++)\n         printf(\""%d\\n\"",(int)pow(6,t)%10);\n      return 0;\n   }",WRONG_ANSWER,5,316
1591102132265201664,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-12 00:14:44,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"X,Y,Z = map(int,input().split())；\nif 0 <=X<= 100 and 0 <=Y<= 100 and 0 <=Z<= 100:\n    print(X+Y-Z)",NON_ZERO_EXIT_CODE,16,2752
1591102146597158912,ddd0edd80a23dfec88d0679f4ed6037779b80d26db4ba0f74fecb3d447de61fa,2022-11-12 00:14:47,C++,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<iostream>\n#include<math.h>\nusing namespace std;\nclass reslove {\npublic:\n\tvoid reslve(int* c,int n) {\n\t\tint max = 0;\n\t\tint b = 0;\n\t\tfor (int i = 0; i < n;i++) {\n\t\t\tif (b > 0)\n\t\t\t\tb += c[i];\n\t\t\telse\n\t\t\t\tb = c[i];\n\t\t\tif (b > max)\n\t\t\t\tmax = b;\n\t\t}\n\t\tcout << max;\n\t}\n};\nint main(int argc, char* argv[])\n{\n\tint i, n, a[100], b[100], c[100];\n\tcin >> n;\n\tfor (i = 0; i < n; i++) {\n\t\tcin >> a[i];\n\t}\n\tfor (i = 0; i < n; i++) {\n\t\tcin >> b[i];\n\t}\n\tfor (i = 0; i < n; i++) {\n\t\tc[i] = b[i] - a[i];\n\t}\n\treslove res;\n\tres.reslve(c, n);\n\treturn 0;\n}\n",ACCEPTED,4,456
1591102175487524864,73b58f8040a053b30c1b879aa24d1a92193e080fa5a7e900ef03eb0a27d9edef,2022-11-12 00:14:54,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\n#include<time.h>\nint main()\n{\n    int time_t\n        time(&t);\n    printf(\""%s\"",ctime(&t));\n    return 0;\n}",COMPILE_ERROR,0,0
1591102189186121728,86f702b052a21d7cb2f8cd933c678c21efaafaf5b2d35032f18ec35c1e26a945,2022-11-12 00:14:57,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,j;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    int sum=0,max=0;\n    for(i=0;i<n;i++)\n    {sum=0;\n      for(j=i;j<n;j++)\n      {\n       sum=b[j]-a[j]+sum;\n       if(max<sum) max=sum;\n      }\n    }\n    printf(\""%d\"",max);\n    return 0;\n}\n",ACCEPTED,4,308
1591102259071594496,73b58f8040a053b30c1b879aa24d1a92193e080fa5a7e900ef03eb0a27d9edef,2022-11-12 00:15:14,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\n#include<time.h>\nint main()\n{\n    int time_t;\n        time(&t);\n    printf(\""%s\"",ctime(&t));\n    return 0;\n}",COMPILE_ERROR,0,0
1591102266587807744,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-12 00:15:16,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"X,Y,Z = map(int,input().split())；\nif 0 <=X<= 100 and 0 <=Y<= 100 and 0 <=Z<= 100:\n    print(X+Y-Z)",NON_ZERO_EXIT_CODE,17,4160
1591102287819374592,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-12 00:15:21,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=eval(input())\nm = 0\no=1\np=6\nlist = map(eval,input().split())\nfor i in list:\n    m=m+1\n    if 0<=i<=1000000000:\n        if m<a:\n            if i==0:\n                print(o)\n            else:\n                print(p)\n        if m==a:\n            if i==0:\n                print(o,end=\""\"")\n            else:\n                print(p,end=\""\"")\n",WRONG_ANSWER,30,2872
1591102338096476160,73b58f8040a053b30c1b879aa24d1a92193e080fa5a7e900ef03eb0a27d9edef,2022-11-12 00:15:33,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\n#include<time.h>\nint main()\n{\n    float time_t;\n        time(&t);\n    printf(\""%s\"",ctime(&t));\n    return 0;\n}",COMPILE_ERROR,0,0
1591102386628788224,13eac09c9e523ec396926840225e626f8fff54ca0e8a92e46e533705daa83ac2,2022-11-12 00:15:44,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,i,a=0,b;\n    int flag=1;\n    scanf(\""%d\"",&n);\n    for(i=2;i<n;i++)\n    {\n        flag=1;\n        for(b=2;b<=sqrt(i);b++)\n            if(i%b==0)\n               flag=0;\n            if(flag==1)\n                a++;\n\n    }\n    printf(\""%d\"",a);\n    return 0;\n}",ACCEPTED,59,348
1591102501313642496,1b00b3d29099722d8332b35e3af5e54fda309b4f7c9fc6261f618ecd2a4d7390,2022-11-12 00:16:12,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i,j,c=0,k;//c初始能量值,k闯关数\n    scanf(\""%d\"",&n);\n    int a[n],b[n],max;\n    max=0;\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);//每关消耗能量\n    for(j=0;j<n;j++)\n        scanf(\""%d\"",&b[j]);//每关获得能量\n    for(i=0;i<n;i++)\n    {\n        c=0;\n        for(k=i;k<n;k++)\n        {\n            c=b[k]-a[k]+c;\n        if(c>max) max=c;\n        }\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",ACCEPTED,2,196
1591102527456718848,5d1852a153062cc8297ed7a30bb643375395a70654d5dff506fad6bc186e81bd,2022-11-12 00:16:18,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nvoid main()\n{\n\tint a,i,j;\n    int num=0;\n\tscanf(\""%d\"",&a);\n\tfor(i=2;i<=a;i++)\n\t\t{\n\t\tfor(j=2;j<=i;j++)\n\t\t\tif(i%j==0)\n\t\t\t\tbreak;\n\t\tif(i==j)\n\t\t\tnum++;\n\t\t}\n    printf(\""%d\\n\"",num);\n}",TIME_LIMIT_EXCEEDED,1000,272
1591102529084133376,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-12 00:16:18,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"X,Y,Z = map(int,input().split())；\n    print(X+Y-Z)",NON_ZERO_EXIT_CODE,15,2876
1591102535459450880,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-12 00:16:20,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main() {\n\tint x,n,i,j;\n\tscanf(\""%d\"",&n);\n\tfor(i=2;i<=n;i++)\n\t{\n\t\tint k=0;\n\t\tfor(j=2;j<i;j++)\n\t\t{\n\t\tif(i%j==0)\n\t\tk++;\n\t\tif(k>0)\n\t\tbreak;\n      \t}\n      \tif(k==0)\n      \tx++;\n\t}\n\tprintf(\""%d\\n\"",x);\n}\n",COMPILE_ERROR,0,0
1591102570716794880,5d1852a153062cc8297ed7a30bb643375395a70654d5dff506fad6bc186e81bd,2022-11-12 00:16:28,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nvoid main()\n{\n\tint a,i,j;\n    int num=0;\n\tscanf(\""%d\"",&a);\n\tfor(i=2;i<=a;i++)\n\t\t{\n\t\tfor(j=2;j<=i;j++)\n\t\t\tif(i%j==0)\n\t\t\t\tbreak;\n\t\tif(i==j)\n\t\t\tnum++;\n\t\t}\n    printf(\""%d\\n\"",num);\n}",COMPILE_ERROR,0,0
1591102600148226048,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-12 00:16:35,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"X,Y,Z = map(int,input().split());\n    print(X+Y-Z)",NON_ZERO_EXIT_CODE,15,2872
1591102615482601472,7a048784ed2975c30a64787731af1fce175495afd1f4aad852d064d00b6193b9,2022-11-12 00:16:39,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,print('2022'),ACCEPTED,15,2888
1591102681383481344,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-12 00:16:55,Python,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"X,Y,Z = map(int,input().split())\nif 0 <=X<= 100 and 0 <=Y<= 100 and 0 <=Z<= 100:\n    print(X+Y-Z)\n",ACCEPTED,30,2876
1591102745908654080,5d1852a153062cc8297ed7a30bb643375395a70654d5dff506fad6bc186e81bd,2022-11-12 00:17:10,C++,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<iostream>\n#include<math.h>\nusing namespace std;\nclass reslove {\npublic:\n\tvoid reslve(int* c,int n) {\n\t\tint max = 0;\n\t\tint b = 0;\n\t\tfor (int i = 0; i < n;i++) {\n\t\t\tif (b > 0)\n\t\t\t\tb += c[i];\n\t\t\telse\n\t\t\t\tb = c[i];\n\t\t\tif (b > max)\n\t\t\t\tmax = b;\n\t\t}\n\t\tcout << max;\n\t}\n};\nint main(int argc, char* argv[])\n{\n\tint i, n, a[100], b[100], c[100];\n\tcin >> n;\n\tfor (i = 0; i < n; i++) {\n\t\tcin >> a[i];\n\t}\n\tfor (i = 0; i < n; i++) {\n\t\tcin >> b[i];\n\t}\n\tfor (i = 0; i < n; i++) {\n\t\tc[i] = b[i] - a[i];\n\t}\n\treslove res;\n\tres.reslve(c, n);\n\treturn 0;\n}\n",ACCEPTED,3,312
1591102769954619392,62c83306b4f5c482e4e9a52dc69ae0b8ee7b5238abb34e56352843a0d484ff2c,2022-11-12 00:17:16,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"c = 0\nfor n in range(2,max):\n        flag=0\n        for i in range(2,n):\n            if n%i==0:\n                flag=1\n        if flag==0:\n            c+=1\nprint(c)\n\n",NON_ZERO_EXIT_CODE,17,3628
1591102782751420416,5d1852a153062cc8297ed7a30bb643375395a70654d5dff506fad6bc186e81bd,2022-11-12 00:17:19,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nvoid main()\n{\n\tint a,i,j;\n    int num=0;\n\tscanf(\""%d\"",&a);\n\tfor(i=2;i<=a;i++)\n\t\t{\n\t\tfor(j=2;j<=i;j++)\n\t\t\tif(i%j==0)\n\t\t\t\tbreak;\n\t\tif(i==j)\n\t\t\tnum++;\n\t\t}\n    printf(\""%d\\n\"",num);\n}",ACCEPTED,907,272
1591102886048739328,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-12 00:17:43,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int n = scanner.nextInt();\n        int count,i,j,k;\n        for (i = 2; i <= n; i++) {\n            for (j = 2; j <=i ; j++) {\n                if (i == j){\n                    count++;\n                    break;\n                }\n                if (i % j == 0)\n                    break;\n            }\n        }\n        System.out.println(count);\n    }\n}",COMPILE_ERROR,0,0
1591102929564667904,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-12 00:17:54,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int n = scanner.nextInt();\n        int count = 0,i,j,k;\n        for (i = 2; i <= n; i++) {\n            for (j = 2; j <=i ; j++) {\n                if (i == j){\n                    count++;\n                    break;\n                }\n                if (i % j == 0)\n                    break;\n            }\n        }\n        System.out.println(count);\n    }\n}",TIME_LIMIT_EXCEEDED,1000,16560
1591102942273384448,62c83306b4f5c482e4e9a52dc69ae0b8ee7b5238abb34e56352843a0d484ff2c,2022-11-12 00:17:57,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main()\n{\n    int i,j;\n    int n;\n    scanf(\""%d\"",&n);\n    int sum=0;\n    for(i=2;i<=n;i++)\n    {\n         for(j=2;j<=pow(i,0.5);j++)\n         {\n             if(i%j==0)\n             {\n                 sum++;\n                 break;\n             }\n         }\n    }\n    \n    printf(\""%d\"",n-sum-1);\n}\n",ACCEPTED,142,324
1591103057046343680,73b58f8040a053b30c1b879aa24d1a92193e080fa5a7e900ef03eb0a27d9edef,2022-11-12 00:18:24,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\n#include<time.h>\nint main()\n{\n    time_t now;\n    time(&now);\n    printf(\""%S\"",ctime(&now));\n    return 0;\n}",WRONG_ANSWER,3,308
1591103143583223808,5d1852a153062cc8297ed7a30bb643375395a70654d5dff506fad6bc186e81bd,2022-11-12 00:18:45,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n    int n,sum,G;\n    scanf(\""%d\"",&n);\n    while(n){\n        scanf(\""%d\"",&sum);\n        if(sum!=0)\n        {\n         G=sum/sum*6;\n        printf(\""%d\"",G);\n        }\n        else\n            printf(\""1\"");\n        if(n!=1){\n            printf(\""\\n\"");\n        }\n        n--;\n    }\n    return 0;\n}\n",ACCEPTED,8,348
1591103191998074880,834ba62d861cf2d94a81f3b034a55b21f1378d4337b6b065c321d7da6bf82e17,2022-11-12 00:18:56,Python,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"t = int(input())\nls=list(map(int,input().split()))\nfor n in ls:\n    if n==0:\n       print(1)\n    else:\n       print(6)\n   ",ACCEPTED,46,2876
1591103194141364224,6b02dfcf297d52c2de2e1416b33ee988ff909834c73207b147423a8301e9d174,2022-11-12 00:18:57,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"\n#include <stdio.h>\n#include <stdlib.h>\n#include<math.h>\nint main() {\n\tint n, i,k;\n\tint* p = NULL;\n\tscanf(\""%d\"", &n);\n\tp = (int*)malloc(n * sizeof(int));\n\tfor (i = 0; i < n; i++)\n\t\tscanf(\""%d\"", &p[i]);\n\tfor (i = 0; i < n; i++)\n\t{\n\t   k=pow(6,p[i]);\n\t\tprintf(\""%d\\n \"",k%10);\n\t}\n\t\t\n\treturn 0;\n}\n",WRONG_ANSWER,7,308
1591103240496807936,73b58f8040a053b30c1b879aa24d1a92193e080fa5a7e900ef03eb0a27d9edef,2022-11-12 00:19:08,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\n#include<time.h>\nint main()\n{\n    time_t now;\n    time(&now);\n    printf(\""%s\"",ctime(&now));\n    return 0;\n}",WRONG_ANSWER,3,364
1591103314366894080,62c83306b4f5c482e4e9a52dc69ae0b8ee7b5238abb34e56352843a0d484ff2c,2022-11-12 00:19:26,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"num = int(input())\nc = 0\nfor n in range(2, num):\n        flag=0\n        for i in range(2,n):\n            if n%i==0:\n                flag=1\n        if flag==0:\n            c+=1\nprint(c)\n\n",TIME_LIMIT_EXCEEDED,1000,3000
1591103418117193728,4e8bf5e988ac4275aeb23eae913a385055ab79de14dc27373b9e62a15269d138,2022-11-12 00:19:50,C++,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<iostream>\n#include<math.h>\nusing namespace std;\nclass reslove {\npublic:\n\tvoid reslve(int* c,int n) {\n\t\tint max = 0;\n\t\tint b = 0;\n\t\tfor (int i = 0; i < n;i++) {\n\t\t\tif (b > 0)\n\t\t\t\tb += c[i];\n\t\t\telse\n\t\t\t\tb = c[i];\n\t\t\tif (b > max)\n\t\t\t\tmax = b;\n\t\t}\n\t\tcout << max;\n\t}\n};\nint main(int argc, char* argv[])\n{\n\tint i, n, a[100], b[100], c[100];\n\tcin >> n;\n\tfor (i = 0; i < n; i++) {\n\t\tcin >> a[i];\n\t}\n\tfor (i = 0; i < n; i++) {\n\t\tcin >> b[i];\n\t}\n\tfor (i = 0; i < n; i++) {\n\t\tc[i] = b[i] - a[i];\n\t}\n\treslove res;\n\tres.reslve(c, n);\n\treturn 0;\n}\n",ACCEPTED,4,444
1591103436484050944,7a048784ed2975c30a64787731af1fce175495afd1f4aad852d064d00b6193b9,2022-11-12 00:19:55,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"X,Y,Z=int(input().split())\nprint(X+Y-Z)",NON_ZERO_EXIT_CODE,15,2756
1591103469476425728,4e8bf5e988ac4275aeb23eae913a385055ab79de14dc27373b9e62a15269d138,2022-11-12 00:20:03,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nvoid main()\n{\n\tint a,i,j;\n    int num=0;\n\tscanf(\""%d\"",&a);\n\tfor(i=2;i<=a;i++)\n\t\t{\n\t\tfor(j=2;j<=i;j++)\n\t\t\tif(i%j==0)\n\t\t\t\tbreak;\n\t\tif(i==j)\n\t\t\tnum++;\n\t\t}\n    printf(\""%d\\n\"",num);\n}",ACCEPTED,927,316
1591103546626473984,4e8bf5e988ac4275aeb23eae913a385055ab79de14dc27373b9e62a15269d138,2022-11-12 00:20:21,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n    int n,sum,G;\n    scanf(\""%d\"",&n);\n    while(n){\n        scanf(\""%d\"",&sum);\n        if(sum!=0)\n        {\n         G=sum/sum*6;\n        printf(\""%d\"",G);\n        }\n        else\n            printf(\""1\"");\n        if(n!=1){\n            printf(\""\\n\"");\n        }\n        n--;\n    }\n    return 0;\n}",NON_ZERO_EXIT_CODE,15,2876
1591103573495164928,4e8bf5e988ac4275aeb23eae913a385055ab79de14dc27373b9e62a15269d138,2022-11-12 00:20:27,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n    int n,sum,G;\n    scanf(\""%d\"",&n);\n    while(n){\n        scanf(\""%d\"",&sum);\n        if(sum!=0)\n        {\n         G=sum/sum*6;\n        printf(\""%d\"",G);\n        }\n        else\n            printf(\""1\"");\n        if(n!=1){\n            printf(\""\\n\"");\n        }\n        n--;\n    }\n    return 0;\n}",ACCEPTED,10,348
1591103587520937984,6b02dfcf297d52c2de2e1416b33ee988ff909834c73207b147423a8301e9d174,2022-11-12 00:20:31,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"\n#include <stdio.h>\n#include <stdlib.h>\n#include<math.h>\nint main() {\n\tint n, i,k;\n\tint* p = NULL;\n\tscanf(\""%d\"", &n);\n\tp = (int*)malloc(n * sizeof(int));\n\tfor (i = 0; i < n; i++)\n\t\tscanf(\""%d\"", &p[i]);\n\tfor (i = 0; i < n; i++)\n\t{\n\t   k=pow(6,p[i]);\n\t\tprintf(\""%d\\n \"",k%10);\n\t}\n\t\t\n\treturn 0;\n}\n",WRONG_ANSWER,6,320
1591103873056550912,20ffd83467b553ac24e1f4b8b096d58858684ca8c3f6a4d5a62be9ff7c4817da,2022-11-12 00:21:39,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n#define M 1000\nint main(){\nint i,n, x[M];\nint z;\nscanf(\""%d\"",&n);\nfor(i=0;i<n;i++)\nscanf(\""%d\"",&x[i]);\nfor(i=0;i<n-1;i++){ \nif(x[i]==0){ \n    z=1;\nprintf(\""%d\\n\"",z);\n     }\nelse {z=pow(6,x[i]);\n      z=z%10;\n      printf(\""%d\\n\"",z);\n     }\n     }\n    i=n-1;\nif(x[i]==0){ \n    z=1;\nprintf(\""%d\"",z);\n     }\nelse {z=pow(6,x[i]);\n      z=z%10;\n      printf(\""%d\"",z);\n     }\n        \n\n     }",WRONG_ANSWER,6,312
1591103886004367360,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-12 00:21:42,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int n = scanner.nextInt();\n        int count = 0,i,j,k;\n        for (i = 2; i <= n; i++) {\n            for (j = 2; j <=i ; j++) {\n                if (i == j){\n                    count++;\n\n                }\n                if (i % j == 0)\n                    break;\n            }\n        }\n        System.out.println(count);\n    }\n}",TIME_LIMIT_EXCEEDED,1000,16072
1591103888613224448,b8a7ba8e6c41741e66a8153e5f137c86c8dba9c4dbb2f65f35d7554a5b082d56,2022-11-12 00:21:42,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n    int a,b,c,d;\n    scanf(\""%d\"",&a);\n    for(int i=0;i<a;i++)\n    {\n        scanf(\""%d\"",&b);\n        c=pow(6,b);\n        d=c%10;\n    printf(\""%d\\n\"",d);\n    }\n    return 0;\n}",WRONG_ANSWER,5,328
1591104045698297856,73b58f8040a053b30c1b879aa24d1a92193e080fa5a7e900ef03eb0a27d9edef,2022-11-12 00:22:20,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\n#include<time.h>\nint main()\n{\n    time_t now;\n    time(&now);\n    printf(\""%s\"",ctime(&now));\n    return 0;\n}",WRONG_ANSWER,3,352
1591104048563027968,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-12 00:22:21,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main() {\n\tint x,n,i,j;\n\tscanf(\""%d\"",&n);\n\tfor(i=2;i<=n;i++){\n\t\tint k=0;\n\t\tfor(j=2;j<i;j++){\n\t\t    if(i%j==0)\n\t\t        k++;\n\t\t    if(k>0)\n\t\t        break;\n      \t}\n      \tif(k==0)\n      \t    x++;\n\t}\n\tprintf(\""%d\\n\"",x);\n}\n",COMPILE_ERROR,0,0
1591104203471261696,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 00:22:58,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j=0;\n    scanf(\""%d\"",$n),\n    for(i=2;i<n;i++)\n    {\n        int k=0;\n        for(k=2;k<1;k++)\n        {\n            if(i%k==0)\n            {\n                break;\n            }\n        }\n        if(i==k)\n        {\n            j++;\n        }\n    }\n    printf(\""%d,j\"");\n}",COMPILE_ERROR,0,0
1591104267069468672,217f1946625720e554af7294d3599b943eea3b430c0df7aa0c5c70abe9904e56,2022-11-12 00:23:13,Java,300.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.*;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner sc=new Scanner(System.in);\n        int n=sc.nextInt();\n        Main a=new Main();\n        a.number(n);\n    }\n    public static int number(int n){\n        int count=0;\n\t\tfor(int i=2;i<n;i++) {\n\t\t\tboolean number=true;\n\t\t\tfor(int j=2;j<=i/2;j++) {\n\t\t\t\tif(i%j==0) {\n\t\t\t\t\tnumber=false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(number) {\n                count++;\n\t\t\t}\n        }\n        System.out.println(count);\n        return 0;\n    }\n},ACCEPTED,888,16600
1591104297352368128,7a048784ed2975c30a64787731af1fce175495afd1f4aad852d064d00b6193b9,2022-11-12 00:23:20,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"X,Y,Z=int(input().split())\nif 0<=X<=100,0<=Y<=100,0<=Z<=100:\n    print(X+Y-Z)\nelse:\n    return 0",NON_ZERO_EXIT_CODE,15,2884
1591104305740976128,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 00:23:22,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j=0;\n    scanf(\""%d\"",$n),\n    for(i=2;i<n;i++)\n    {\n        int k=0;\n        for(k=2;k<1;k++)\n        {\n            if(i%k==0)\n            {\n                break;\n            }\n        }\n        if(i==k)\n        {\n            j++;\n        }\n    }\n    printf(\""%d,j\"");\n}\nreturn 0;",COMPILE_ERROR,0,0
1591104356957597696,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 00:23:34,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j=0;\n    scanf(\""%d\"",$n),\n    for(i=2;i<n;i++)\n    {\n        int k=0;\n        for(k=2;k<1;k++)\n        {\n            if(i%k==0)\n            {\n                break;\n            }\n        }\n        if(i==k)\n        {\n            j++;\n        }\n    }\n    printf(\""%d,j\"");\n}\nreturn 0;",COMPILE_ERROR,0,0
1591104548238831616,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-12 00:24:20,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int n = scanner.nextInt();\n        int count = 0,i,j,k;\n        for (i = 2; i <= n; i++) {\n            for (j = 2; j <=i ; j++) {\n                if (i == j)\n                    count++;\n                if (i % j == 0)\n                    break;\n            }\n        }\n        System.out.println(count);\n    }\n}",WRONG_ANSWER,994,16708
1591104591180136448,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-12 00:24:30,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int n = scanner.nextInt();\n        int count = 0,i,j,k;\n        for (i = 2; i <= n; i++) {\n            for (j = 2; j <=i ; j++) {\n                if (i == j){\n                    count++;\n                }\n                if (i % j == 0)\n                    break;\n            }\n        }\n        System.out.println(count);\n    }\n}",TIME_LIMIT_EXCEEDED,1000,19252
1591104649975869440,73b58f8040a053b30c1b879aa24d1a92193e080fa5a7e900ef03eb0a27d9edef,2022-11-12 00:24:44,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\n#include<time.h>\nint main()\n{\n    time_t now;\n    time(&now);\n    printf(\""%s\"",ctime(&year));\n    return 0;\n}",COMPILE_ERROR,0,0
1591104846135099392,13eac09c9e523ec396926840225e626f8fff54ca0e8a92e46e533705daa83ac2,2022-11-12 00:25:31,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,max=0,sum;\n    int a[100],b[100];\n    int i,j;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n    {\n        sum=0;\n        for(j=i;j<n;j++)\n        {\n            sum=sum-a[j]+b[j];\n            if(sum>max)\n                max=sum;\n        }\n    }\n\n    printf(\""%d\"",max);\n    return 0;\n}",ACCEPTED,3,200
1591104916205121536,62c83306b4f5c482e4e9a52dc69ae0b8ee7b5238abb34e56352843a0d484ff2c,2022-11-12 00:25:47,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"num = int(input())\nc = 0\nfor n in range(2, num):\n        flag=0\n        for i in range(2, n):\n            if n%i==0:\n                flag = 1\n                break\n        if flag == 0:\n            c+=1\nprint(c)\n\n",TIME_LIMIT_EXCEEDED,1000,2896
1591104982491901952,25584884fd716238437f89484285121d106c1090916ab683be624f210130ebad,2022-11-12 00:26:03,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint i,m,begin,over,n=0,max=0,sum=0;\nint main()\n{\n\tint a[100000],b[100000],c[100000];\n\tscanf(\""%d\"",&m);\n\tfor ( i=0;i<m;i++)\n\t{\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor (i=0;i<m;i++)\n\t{\n\t\tscanf(\""%d\"",&b[i]);\n\t\t\n\t}\n\tfor(i=0;i<m;i++)\n\t{\n\t\tc[i] = b[i] - a[i];\n\t\n\t}\n\tfor(begin=0;begin<m;begin++)\n\t{\n\t\tfor (over=0;over<m;over++)\n\t\t{\n\t\t\tfor( n=begin;n<=over;n++)\n\t\t\t{\n\t\t\t\tsum=sum+c[n];\n\t\t\t}\n\t\t\tif(sum>max)\n\t\t\t{\n\t\t\t\tmax=sum;\n\t\t\t}\n\t\t\tsum=0;\n\t\t}\n\t}\n\tprintf(\""%d\"",max);\n\treturn 0;\n}",ACCEPTED,3,196
1591105003572498432,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 00:26:08,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n#define MAX 100\nint main(void)\n{\n int n,i,f,a[MAX];\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n        scanf(\""%d\"",&x[i]);\n    for(int i=0;i<n;i++){\n        f=pow(6,x[i]);\n        f=f%10;\n        printf(\""%d\"",f)\n    }\n        \n        \n\n",COMPILE_ERROR,0,0
1591105050179579904,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 00:26:19,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n#define MAX 100\nint main(void)\n{\n int n,i,f,a[MAX];\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n        scanf(\""%d\"",&x[i]);\n    for(int i=0;i<n;i++){\n        f=pow(6,x[i]);\n        f=f%10;\n        printf(\""%d\"",f)\n    }\n        \n        \n\n",COMPILE_ERROR,0,0
1591105076310093824,9e0ba8d857885aa94eaa182d3a194e51593598b2d7817b16af4b1b57e49e10de,2022-11-12 00:26:26,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"public class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int a = scanner.nextInt();\n        int b[] = new int[100];\n        for(int i = 0; i < a; i++) {\n            b[i] = scanner.nextInt();\n        }\n        \n        for(int i = 0; i < b.length; i++) {\n            System.out.println(Math.pow(6,b[i]));\n        }\n    } \n}",COMPILE_ERROR,0,0
1591105085562728448,899c5501179552dc1fe5639f9047e15d0f835e7a87c8568193377882d0278985,2022-11-12 00:26:28,Python,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"n=int(input())\nlist=input().split()\nfor i in list:\n    if i=='0':\n        print(\""1\"")\n    else:\n        print(\""6\"")",ACCEPTED,48,2876
1591105223672770560,9e0ba8d857885aa94eaa182d3a194e51593598b2d7817b16af4b1b57e49e10de,2022-11-12 00:27:01,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int a = scanner.nextInt();\n        int b[] = new int[100];\n        for(int i = 0; i < a; i++) {\n            b[i] = scanner.nextInt();\n        }\n        \n        for(int i = 0; i < b.length; i++) {\n            System.out.println(Math.pow(6,b[i]));\n        }\n    } \n}",WRONG_ANSWER,118,16764
1591105268627345408,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-12 00:27:12,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016," #include <stdio.h>\n   #include <math.h>\n   int main(){\n       int n,t;\n      scanf(\""%d\"",&n);\n      for(int i=0;i<n;i++){\n            scanf(\""%d\"",&t);\n            if(t==0) {printf(\""1\\n\"");continue;}\n            t=sqrt(t);\n\n\n         printf(\""%d\\n\"",(int)pow(6,t)%10);\n       }\n      return 0;\n   }",WRONG_ANSWER,6,344
1591105489386143744,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-12 00:28:04,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"n=int(input())\ncount=1\na=[2]\nfor i in range (3,n,2):\n    for j in a:\n        if i%j==0:\n            break;\n    else:\n        a.append(i)\n        count+=1\nprint(a)\nprint(count)\n",TIME_LIMIT_EXCEEDED,1000,3160
1591105493429452800,ece045c1570c74e6800520e16047010817642535f83b9f2b4524ebdcf9d7925a,2022-11-12 00:28:05,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include<math.h>\nint main() {\n    int t,n,m,i;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++)\n    {\n    \tscanf(\""%d\"",&a[i]);\n\t}\n\t  for(i=0;i<t-1;i++)\n    {\n    \tn=pow(6,a[i]);\n    \tprintf(\""%d\\n\"",n%10);\n\t}\n\tm=pow(6,a[t-1]);\n\tprintf(\""%d\"",m%10);\n\n\treturn 0;\n}\n",WRONG_ANSWER,9,312
1591105576321482752,6b02dfcf297d52c2de2e1416b33ee988ff909834c73207b147423a8301e9d174,2022-11-12 00:28:25,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint n ,x , start ,end , t=0 , max=0 ,sum=0;\nint main()\n{\n\tint xiao[100000], huo[100000],jue[100000];\n\tscanf( \""%d\"" , & n );\n\tfor ( x = 0 ; x < n ; x++ )\n\t{\n\t\tscanf(\""%d\"", &xiao[x]);\n\t\t//printf(\""%d\\n\"",xiao[x]);\n\t}\n\tfor ( x = 0 ; x < n ; x++ )\n\t{\n\t\tscanf(\""%d\"", &huo[x]);\n\t\t//printf(\""%d\\n\"",huo[x]);\n\t}\n\tfor ( x = 0 ; x < n ; x++ )\n\t{\n\t\tjue[x] = huo[x] - xiao[x];\n\t\t//printf(\""%d\\n\"",jue[x]);\n\t}\n\tfor ( start = 0 ; start < n ; start++ )\n\t{\n\t\tfor ( end = 0 ; end < n ; end++)\n\t\t{\n\t\t\tfor( t = start ; t <= end ; t++)\n\t\t\t{\n\t\t\t\tsum = sum + jue[t];\n\t\t\t}\n\t\t\tif( sum > max )\n\t\t\t{\n\t\t\t\tmax = sum;\n\t\t\t}\n\t\t\tsum = 0 ;\n\t\t}\n\t}\n\tprintf( \""%d\"" , max );\n}",ACCEPTED,4,192
1591105807750594560,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 00:29:20,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n#define MAX 100\nint main(void)\n{\n int n,i,f,a[MAX];\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n        scanf(\""%d\"",&x[i]);\n    for(int i=0;i<n;i++){\n        f=pow(6,x[i]);\n        f=f%10;\n        printf(\""%d/n\"",f)\n    }\n        \n        \n\n",COMPILE_ERROR,0,0
1591105852143112192,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 00:29:31,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n#define MAX 100\nint main()\n{\n int n,i,f,a[MAX];\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n        scanf(\""%d\"",&x[i]);\n    for(int i=0;i<n;i++){\n        f=pow(6,x[i]);\n        f=f%10;\n        printf(\""%d/n\"",f)\n    }\n        \n        \n\n",COMPILE_ERROR,0,0
1591105891124973568,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-12 00:29:40,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"n=int(input())\ncount=1\na=[2]\nfor i in range (3,n,2):\n    for j in a:\n        if i%j==0:\n            break;\n    else:\n        a.append(i)\n        count+=1\nprint(count)\n",TIME_LIMIT_EXCEEDED,1000,3112
1591105960704278528,1f29a576db974352c60cbe8aafdc4e5328b24d800890ab1c712d8c9fa85d72cc,2022-11-12 00:29:57,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint sss(int i)\n{\n\tint j;\n\tfor(j=2;j<i;j++)\n\t{\n\t\tif(i%j==0) return 0;\n\t}\n\treturn 1;\n}\nint main()\n{\n\tint i,m=0;\n\tint max;\n\tscanf(\""%d\"",&max);\n\tfor(i=2;i<=max;i++)\n\t{\n\t\tif(sss(i)) m=m+1;\n\t}\n\tprintf(\""%d\"",m);\n\treturn 0;\n}\n",ACCEPTED,912,320
1591105961702502400,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 00:29:57,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main()\n{\n int n,i,f,a[100];\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n        scanf(\""%d\"",&x[i]);\n    for(int i=0;i<n;i++){\n        f=pow(6,x[i]);\n        f=f%10;\n        printf(\""%d/n\"",f)\n    }\n        \n        \n\n",COMPILE_ERROR,0,0
1591106029243404288,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 00:30:13,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"n=int(input())\nxh=list(map(eval,input().spilt()))\nhd=list(map(eval,input().split()))\ndata=[]\nmax=0\nfor i in range(n):\n    s=hd[i]-xh[i]\n    data.appen(s)\n for i in range(n):\n     t-0\n        for j in range(i,n,1):\n            t=t+data[j]\n            if t>max:\n                max=t\nprint(max)",NON_ZERO_EXIT_CODE,16,2884
1591106030350675968,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 00:30:13,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main()\n{\n int n,i,f,a[100];\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n        scanf(\""%d\"",&x[i]);\n    for(int i=0;i<n;i++){\n        f=pow(6,x[i]);\n        f=f%10;\n        printf(\""%d/n\"",f)\n    }\n        \n        \n\n",COMPILE_ERROR,0,0
1591106100622045184,9e0ba8d857885aa94eaa182d3a194e51593598b2d7817b16af4b1b57e49e10de,2022-11-12 00:30:30,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int a = scanner.nextInt();\n        int b[] = new int[100];\n        for(int i = 0; i < a; i++) {\n            b[i] = scanner.nextInt();\n        }\n        \n        for(int i = 0; i < b.length; i++) {\n            int c = (int)Math.pow(6,b[i]) % 10;\n            System.out.println(c);\n        }\n    } \n}",WRONG_ANSWER,125,16492
1591106164966862848,0b3466ebddb2bdde378eee8b40d2037097b0a243d9ec4a6495316765e89853eb,2022-11-12 00:30:45,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\t int main ()\n\t{\n\t\tint year;\n\t\tprintf(\""2022\\n\"");\n     }",ACCEPTED,3,196
1591106182155120640,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 00:30:49,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"n=int(input())\nxh=list(map(eval,input().spilt()))\nhd=list(map(eval,input().split()))\ndata=[]\nmax=0\nfor i in range(n):\n    s=hd[i]-xh[i]\n    data.appen(s)\n for i in range(n):\n     t-0\n        for j in range(i,n,1):\n            t=t+data[j]\n            if t>max:\n                max=t\nprint(max)",NON_ZERO_EXIT_CODE,15,2872
1591106227105501184,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 00:31:00,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main()\n{\n int n,i,f,a[100];\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(int i=0;i<n;i++){\n        f=pow(6,a[i]);\n        f=f%10;\n        printf(\""%d/n\"",f);\n    }\n}\n\n\n",WRONG_ANSWER,3,820
1591106289915179008,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 00:31:15,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main()\n{\n int n,i,f,a[100];\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(int i=0;i<n;i++){\n        f=pow(6,a[i]);\n        f=f%10;\n        printf(\""%d/n\"",f);\n    }\n}\n\n\n",WRONG_ANSWER,3,444
1591106382793846784,9e0ba8d857885aa94eaa182d3a194e51593598b2d7817b16af4b1b57e49e10de,2022-11-12 00:31:37,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int a = scanner.nextInt();\n        int b[] = new int[a];\n        for(int i = 0; i < a; i++) {\n            b[i] = scanner.nextInt();\n        }\n\n        for(int i = 0; i < b.length; i++) {\n            int c = (int)Math.pow(6,b[i]) % 10;\n            System.out.println(c);\n        }\n    }\n}",WRONG_ANSWER,227,17048
1591106453228814336,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 00:31:54,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main()\n{\n int n,i,f,a[100];\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(int i=0;i<n;i++){\n        f=pow(6,a[i]);\n        f=f%10;\n        printf(\""%d\\n\"",f);\n    }\n}\n\n\n",WRONG_ANSWER,6,196
1591106512666300416,f74f1cf8202c7b7d33a121c730f9d3964272c7cefa9076e57c0a15d1d098cce0,2022-11-12 00:32:08,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n\n    printf(\""2022\\n\"");\n    return 0;\n}\n",ACCEPTED,2,316
1591106531683250176,f74f1cf8202c7b7d33a121c730f9d3964272c7cefa9076e57c0a15d1d098cce0,2022-11-12 00:32:13,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n\n    printf(\""2022\\n\"");\n    return 0;\n}\n",ACCEPTED,4,308
1591106617905582080,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 00:32:33,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main()\n{\n int n,i,f,a[100];\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(int i=0;i<n;i++){\n        f=pow(6,a[i]);\n        f=f%10;\n        printf(\""%d\\n\"",f);\n    }\n}\n\n\n",WRONG_ANSWER,5,312
1591106833593470976,25584884fd716238437f89484285121d106c1090916ab683be624f210130ebad,2022-11-12 00:33:25,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <iostream>\n#include <math.h>\nusing namespace std;\n\nint main(){\n    int n;\n    scanf(\""%d\"",&n);\n    while (n--){\n        \n        int t = 6 % 4;\n        if (6%4==0) t = 4;\n      \n        printf(\""%d\\n\"",(int)pow(6,t)%10);\n    }\n    return 0;\n}\n",WRONG_ANSWER,11,448
1591106844595126272,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 00:33:27,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=o\nn=int(input())\nif 2 <= n <=100000:\n    for i in range(2,n+1):\n        for m in range(2,i):\n            if i %m == 0:\n               break\n               else:\n                a +=1\n                print(a)",NON_ZERO_EXIT_CODE,15,2752
1591106849624100864,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 00:33:28,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main()\n{\n int n,i,f,a[1000];\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(int i=0;i<n;i++){\n        f=pow(6,a[i]);\n        f=f%10;\n        printf(\""%d\\n\"",f);\n    }\n}\n\n\n",WRONG_ANSWER,6,312
1591106889583235072,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 00:33:38,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=o\nn=int(input())\nif 2 <= n <=100000:\n    for i in range(2,n+1):\n        for m in range(2,i):\n            if i %m == 0:\n            break\n            else:\n                a +=1\n                print(a)",NON_ZERO_EXIT_CODE,15,2872
1591106911402000384,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-12 00:33:43,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        new A().m1();\n    }\n}\nclass A{\n    public void m1(){\n        Scanner scanner = new Scanner(System.in);\n        int n = scanner.nextInt();\n        int[] arr = new int[10];\n        int count = 0,a = 0;\n        for (int i = 0; i < n; i++) {\n            arr[i] = scanner.nextInt();\n        }\n        for (int i = 0; i < n; i++) {\n            for (int j = 0; j < arr[i]; j++) {\n                a = 6 * 6 % 10;\n            }\n            System.out.println(a);\n        }\n    }\n}",NON_ZERO_EXIT_CODE,228,16996
1591106987109187584,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-12 00:34:01,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        new A().m1();\n    }\n}\nclass A{\n    public void m1(){\n        Scanner scanner = new Scanner(System.in);\n        int n = scanner.nextInt();\n        int[] arr = new int[10];\n        int count = 0,a = 0;\n        for (int i = 0; i < n; i++) {\n            arr[i] = scanner.nextInt();\n        }\n        for (int i = 0; i < n; i++) {\n            for (int j = 0; j < arr[i]; j++) {\n                a = 6 * 6 % 10;\n            }\n            System.out.println(a);\n        }\n    }\n}",NON_ZERO_EXIT_CODE,226,16652
1591106996386988032,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 00:34:03,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=o\nn=int(input())\nif 2 <= n <=100000:\n    for i in range(2,n+1):\n        for m in range(2,i):\n            if i %m == 0:\n                break\n            else:\n                a +=1\n                print(a)",NON_ZERO_EXIT_CODE,15,2756
1591107083238440960,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 00:34:24,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=0\nn=int(input())\nif 2 <= n <=100000:\n    for i in range(2,n+1):\n        for m in range(2,i):\n            if i %m == 0:\n                break\n            else:\n                a +=1\n                print(a)",WRONG_ANSWER,16,3128
1591107115266146304,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-12 00:34:32,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int n = scanner.nextInt();\n        int[] arr = new int[10];\n        int count = 0,a = 0;\n        for (int i = 0; i < n; i++) {\n            arr[i] = scanner.nextInt();\n        }\n        for (int i = 0; i < n; i++) {\n            for (int j = 0; j < arr[i]; j++) {\n                a = 6 * 6 % 10;\n            }\n            System.out.println(a);\n        }\n    }\n}\n",NON_ZERO_EXIT_CODE,224,16936
1591107243695714304,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 00:35:02,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"n=int(input())\nxh=list(map(eval,input().spilt()))\nhd=list(map(eval,input().split()))\ndata=[]\nmax=0\nfor i in range(n):\n    s=hd[i]-xh[i]\n    data.appen(s)\n    for i in range(n):\n     t-0\n        for j in range(i,n,1):\n            t=t+data[j]\n            if t>max:\n                max=t\nprint(max)",NON_ZERO_EXIT_CODE,15,2760
1591107346250665984,80bb854046efddc8db8117414c5ff582f99d3347454c32f734c77c16dc462ed6,2022-11-12 00:35:27,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int n,i,s,sum=1;\n    printf(\""\\n\"");\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++)\n        sum*=6;\n    printf(\""%d\\n\"",n,sum);\n    s=sum%10;\n    sum/=10;\n    printf(\""%d\"",s);\n    return 0;\n}",WRONG_ANSWER,3,180
1591107598978453504,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 00:36:27,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main()\n{\n int n,i,f,a[1000];\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(int i=0;i<n;i++){\n        f=pow(6,a[i]);\n        f=f%10;\n        printf(\""%d\\n\"",f);\n    }\n}\n\n\n",WRONG_ANSWER,5,320
1591107663499431936,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 00:36:42,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main()\n{\n int n,i,f,a[1000000];\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(int i=0;i<n;i++){\n        f=pow(6,a[i]);\n        f=f%10;\n        printf(\""%d\\n\"",f);\n    }\n}\n\n\n",WRONG_ANSWER,7,312
1591107730847367168,f36df1cea5c074e707e9d874fd663bb94dfbab3617fd34381abb56325e4e90fc,2022-11-12 00:36:59,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"n=int(input())\ncount=1\na=[]\nfor i in range (3,n,2):\n    for j in a:\n        if i%j==0:\n            break;\n    else:\n        a.append(i)\n        count+=1\nprint(count)\n",TIME_LIMIT_EXCEEDED,1000,3132
1591107736916529152,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 00:37:00,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"n=int(input())\nxh=list(map(eval,input().spilt()))\nhd=list(map(eval,input().split()))\ndata=[]\nmax=0\nfor i in range(n):\n    s=hd[i]-xh[i]\n    data.appen(s)\n    for i in range(n):\n     t-0\n    for j in range(i,n,1):\n            t=t+data[j]\n            if t>max:\n                max=t\nprint(max)",NON_ZERO_EXIT_CODE,15,2756
1591108215075573760,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 00:38:54,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main()\n{\n int n,i,f,a[1000];\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(int i=0;i<n;i++){\n        f=pow(6,a[i]);\n        f=f%10;\n        printf(\""%d\\n\"",f);\n    }\n    i=n;\n        f=pow(6,a[n]);\n        f=f%10;\n        printf(\""%d\\n\"",f);\n        }\n}\n\n\n",COMPILE_ERROR,0,0
1591108235526995968,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 00:38:59,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main()\n{\n int n,i,f,a[1000];\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(int i=0;i<n;i++){\n        f=pow(6,a[i]);\n        f=f%10;\n        printf(\""%d\\n\"",f);\n    }\n    i=n;\n        f=pow(6,a[n]);\n        f=f%10;\n        printf(\""%d\"",f);\n        }\n}\n\n\n",COMPILE_ERROR,0,0
1591108455744712704,ece045c1570c74e6800520e16047010817642535f83b9f2b4524ebdcf9d7925a,2022-11-12 00:39:51,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include<math.h>\nint main() {\n    int t,n,i;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++)\n    {\n    \tscanf(\""%d\"",&a[i]);\n\t}\n\t  for(i=0;i<t-1;i++)\n    {\n    \tprintf(\""6\\n\"");\n\t}\n\n\tprintf(\""6\"");\n\n\treturn 0;\n}\n",WRONG_ANSWER,9,324
1591108500137250816,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 00:40:02,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main()\n{\n int n,i,f,a[1000];\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(int i=0;i<n;i++){\n        f=pow(6,a[i]);\n        f=f%10;\n        printf(\""%d\\n\"",f);\n    }\n    i=n;\n        f=pow(6,a[n]);\n        f=f%10;\n        printf(\""%d\"",f);\n        }\n\n\n\n",WRONG_ANSWER,4,312
1591108549411934208,b8a7ba8e6c41741e66a8153e5f137c86c8dba9c4dbb2f65f35d7554a5b082d56,2022-11-12 00:40:14,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint i,j,a,b;\n\tscanf(\""%d\"",&i);\n\twhile(i>0){\n\t\tscanf(\""%d\"",&a);\n\t\tif(a==0)\n        printf(\""1\\n\"");\n        else\n        printf(\""6\\n\"");\n\t\ti--;\n\t} \n    return 0;\n}",ACCEPTED,6,368
1591108579640279040,7a048784ed2975c30a64787731af1fce175495afd1f4aad852d064d00b6193b9,2022-11-12 00:40:21,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"\nn=int(input())\nlis=[map(int,input().split())]\nfor i in lis:\n    if i==0:\n        print(1)\n    else:\n        print(6)",WRONG_ANSWER,15,2748
1591108587840143360,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 00:40:23,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main()\n{\n int n,i,f,a[1000];\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(int i=0;i<n;i++){\n        f=pow(6,a[i]);\n        f=f%10;\n        printf(\""%d\\n\"",f);\n    }\n    i=n;\n        f=pow(6,a[n]);\n        f=f%10;\n        printf(\""%d\"",f);\n    return 0;\n        }\n\n\n\n",WRONG_ANSWER,3,440
1591108673110323200,9e0ba8d857885aa94eaa182d3a194e51593598b2d7817b16af4b1b57e49e10de,2022-11-12 00:40:43,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int a = scanner.nextInt();\n        int b[] = new int[a];\n        for(int i = 0; i < a; i++) {\n            b[i] = scanner.nextInt();\n        }\n\n        for(int i = 0; i < b.length; i++) {\n            long c = (int)Math.pow(6,b[i]) % 10;\n            System.out.println(c);\n        }\n    }\n}",NON_ZERO_EXIT_CODE,229,17300
1591108852026748928,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 00:41:26,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\ni=int(imput())\n    data=\n    list(map(eval,input().split()))\n    for i in range(i):\nif i ==i-1:",COMPILE_ERROR,0,0
1591108864748093440,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 00:41:29,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\ni=int(imput())\n    data=\n    list(map(eval,input().split()))\n    for i in range(i):\nif i ==i-1:",COMPILE_ERROR,0,0
1591108895756587008,9e0ba8d857885aa94eaa182d3a194e51593598b2d7817b16af4b1b57e49e10de,2022-11-12 00:41:36,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int a = scanner.nextInt();\n        int b[] = new int[a];\n        for(int i = 0; i < a; i++) {\n            b[i] = scanner.nextInt();\n        }\n\n        for(int i = 0; i < b.length; i++) {\n            long c = (long)Math.pow(6,b[i]) % 10;\n            System.out.println(c);\n        }\n    }\n}",NON_ZERO_EXIT_CODE,231,16708
1591108902391975936,899c5501179552dc1fe5639f9047e15d0f835e7a87c8568193377882d0278985,2022-11-12 00:41:38,Python,0.0,1590524835191705600,1572865591226855424,1049226928954454016,X=int(input())\nY=int(input())\nZ=int(input())\nresult=X+Y-Z\nprint(result),NON_ZERO_EXIT_CODE,15,2872
1591109014329556992,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 00:42:05,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j=0;\n    scanf(\""%d\"",$n),\n    for(i=2;i<n;i++)\n    {\n        int k=0;\n        for(k=2;k<1;k++)\n        {\n            if(i%k==0)\n            {\n                break;\n            }\n        }\n        if(i==k)\n        {\n            j++;\n        }\n    }\n    printf(\""%d,j\"");\n}\n",COMPILE_ERROR,0,0
1591109076300378112,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 00:42:19,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j=0;\n    scanf(\""%d\"",&n),\n    for(i=2;i<n;i++)\n    {\n        int k=0;\n        for(k=2;k<1;k++)\n        {\n            if(i%k==0)\n            {\n                break;\n            }\n        }\n        if(i==k)\n        {\n            j++;\n        }\n    }\n    printf(\""%d,j\"");\n}\n",COMPILE_ERROR,0,0
1591109120739028992,7a048784ed2975c30a64787731af1fce175495afd1f4aad852d064d00b6193b9,2022-11-12 00:42:30,Python,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"\nn=int(input())\nlis=list(map(int,input().split()))\nfor i in lis:\n    if i==0:\n        print(1)\n    else:\n        print(6)",ACCEPTED,47,2880
1591109166071091200,928387ba90b7d3af095968a0f9e0198612ede46fbbd5d1ef0dd919da00a4d7ec,2022-11-12 00:42:41,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#define _CRT_SECURE_NO_WARNINGS 1\n#include<stdlib.h>\n#include<stdio.h>\n#include<math.h>\nint main() {\n\tint n, i=0,sum=0,j=0,flag=0;\n\tscanf(\""%d\"", &n);\n\tfor ( i = 2; i <= n; i++)\n\t{\n\t\tflag = 0;\n\t\tfor (j= 2; j <= sqrt(i); j++)\n\t\t{\n\t\t\tif (i%j==0)\n\t\t\t{\n\t\t\t\tflag = 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (flag==0)\n\t\t{\n\t\t\tsum++;\n\t\t}\n\t\t\n\t}\n\tprintf(\""%d\"", sum);\n}",ACCEPTED,12,324
1591109166205304832,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 00:42:41,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j=0;\n    scanf(\""%d\"",&n),\n    for(i=2;i<n;i++)\n    {\n        int k=0;\n        for(k=2;k<n;k++)\n        {\n            if(i%k==0)\n            {\n                break;\n            }\n        }\n        if(i==k)\n        {\n            j++;\n        }\n    }\n    printf(\""%d,j\"");\n}\n",COMPILE_ERROR,0,0
1591109221414907904,e0156cb930d51b3d5482d43809e7b2c1f54a6b8623fccfa3202e2e53ddf1ffbf,2022-11-12 00:42:54,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\n\n#include<stdlib.h>\n\nint main(void)\n\n{\n\n  int a,b,c,sum;\n\nprintf(\""\\n\"");\n\nscanf(\""%d%d%d\"",&a,&b,&c);\n\nsum=a+b-c;\n\nprintf(\""%d\\n\"",sum);\n\n    return 0;\n\n}",ACCEPTED,4,316
1591109227697975296,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 00:42:55,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j=0;\n    scanf(\""%d\"",&n),\n    for(i=2;i<n;i++)\n    {\n        int k=0;\n        for(k=2;k<i;k++)\n        {\n            if(i%k==0)\n            {\n                break;\n            }\n        }\n        if(i==k)\n        {\n            j++;\n        }\n    }\n    printf(\""%d,j\"");\n}\n",COMPILE_ERROR,0,0
1591109384036483072,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 00:43:33,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j=0;\n    scanf(\""%d\"",&n),\n    for(i=2;i<n;i++)\n    {\n        int k=0;\n        for(k=2;k<i;k++)\n        {\n            if(i%k==0)\n            {\n                break;\n            }\n        }\n        if(i==k)\n        {\n            j++;\n        }\n    }\n    printf(\""%d,j\"");\n}\n",COMPILE_ERROR,0,0
1591109384699183104,899c5501179552dc1fe5639f9047e15d0f835e7a87c8568193377882d0278985,2022-11-12 00:43:33,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int X,Y,Z,result;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    result=X+Y-Z;\n    printf(\""%d\"",result);\n    return 0;\n}",ACCEPTED,7,320
1591109511690125312,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 00:44:03,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main()\n{\n int n,i,f,a[1000];\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(int i=0;i<n;i++){\n        f=pow(6,a[i]);\n        f=f%10;\n        printf(\""%d\"",f);\n        if(i<n-1){\n            printf(\""\\n\"");\n        }\n    }\n    return 0;\n}\n\n\n\n\n",WRONG_ANSWER,4,456
1591109541314494464,62c83306b4f5c482e4e9a52dc69ae0b8ee7b5238abb34e56352843a0d484ff2c,2022-11-12 00:44:10,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"num = int(input())\nc = 0\nfor n in range(2, num):\n        flag=0\n        for i in range(2, n):\n            if n%i==0:\n                flag = 1\n                break\n        if flag == 0:\n            c+=1\nprint(c)\n\n",TIME_LIMIT_EXCEEDED,1000,2868
1591109616505782272,b8a7ba8e6c41741e66a8153e5f137c86c8dba9c4dbb2f65f35d7554a5b082d56,2022-11-12 00:44:28,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint i,a;\n\tscanf(\""%d\"",&i);\n\twhile(i>0){\n\t\tscanf(\""%d\"",&a);\n\t\tif(a==0)\n        printf(\""1\\n\"");\n        else\n        printf(\""6\\n\"");\n\t} \n    return 0;\n}",TIME_LIMIT_EXCEEDED,20,328
1591109624823087104,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 00:44:30,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main()\n{\n int n,i,f,a[1000000000];\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(int i=0;i<n;i++){\n        f=pow(6,a[i]);\n        f=f%10;\n        printf(\""%d\"",f);\n        if(i<n-1){\n            printf(\""\\n\"");\n        }\n    }\n    return 0;\n}\n\n\n\n\n",TIME_LIMIT_EXCEEDED,3,320
1591109660172660736,b8a7ba8e6c41741e66a8153e5f137c86c8dba9c4dbb2f65f35d7554a5b082d56,2022-11-12 00:44:39,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint i,a;\n\tscanf(\""%d\"",&i);\n\twhile(i>0){\n\t\tscanf(\""%d\"",&a);\n\t\tif(a==0)\n        printf(\""1\\n\"");\n        else\n        printf(\""6\\n\"");\n\t} \n    i--；\n    return 0;\n}",COMPILE_ERROR,0,0
1591109726509797376,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-12 00:44:54,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=eval(input())\nm = 0\no=int(1)\np=(6)\nlist = map(eval,input().split())\nfor i in list:\n    m=m+1\n    if 0<=i<=1000000000:\n        if m<a:\n            if i==0:\n                print(o)\n            else:\n                print(p)\n        if m==a:\n            if i==0:\n                print(o,end='')\n            else:\n                print(p,end='')\n",WRONG_ANSWER,32,2884
1591109733568811008,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 00:44:56,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main()\n{\n int n,i,f,a[1000000000];\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(int i=0;i<n;i++){\n        f=pow(6,a[i]);\n        f=f%10;\n        printf(\""%d\\n\"",f);\n\n        }\n    }\n    return 0;\n}\n\n\n\n\n",COMPILE_ERROR,0,0
1591109738383847424,62c83306b4f5c482e4e9a52dc69ae0b8ee7b5238abb34e56352843a0d484ff2c,2022-11-12 00:44:57,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main()\n{\n    int i,j;\n    int n;\n    scanf(\""%d\"",&n);\n    int sum=0;\n    for(i=2;i<=n;i++)\n    {\n         for(j=2;j<=pow(i,0.5);j++)\n         {\n             if(i%j==0)\n             {\n                 sum++;\n                 break;\n             }\n         }\n    }\n    \n    printf(\""%d\"",n-sum-1);\n}",ACCEPTED,143,312
1591109745073762304,b8a7ba8e6c41741e66a8153e5f137c86c8dba9c4dbb2f65f35d7554a5b082d56,2022-11-12 00:44:59,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint i,a;\n\tscanf(\""%d\"",&i);\n\twhile(i>0){\n\t\tscanf(\""%d\"",&a);\n\t\tif(a==0)\n        printf(\""1\\n\"");\n        else\n        printf(\""6\\n\"");\n\t\ti--;\n\t} \n    return 0;\n}",ACCEPTED,9,188
1591109798488248320,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 00:45:12,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main()\n{\n int n,i,f,a[1000000000];\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(int i=0;i<n;i++){\n        f=pow(6,a[i]);\n        f=f%10;\n        printf(\""%d\\n\"",f);\n\n        }\n    \n    return 0;\n}\n\n\n\n\n",SEGMENTATION_FAULT,2,320
1591109821733081088,9e0ba8d857885aa94eaa182d3a194e51593598b2d7817b16af4b1b57e49e10de,2022-11-12 00:45:17,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int a = scanner.nextInt();\n      \n        for(int i = 0; i < a; i++) {\n            b[i] = scanner.nextInt();\n        }\n\n        for(int i = 0; i < b.length; i++) {\n            if(b[i] == 0) {\n                System.out.println(1);\n            } else {\n                System.out.println(6);\n            }\n        }\n    }\n},COMPILE_ERROR,0,0
1591109863072141312,e0ad880549bf3b7847204a80a93841fe1f47e1fb8bc464088cb521848107cfde,2022-11-12 00:45:27,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""2022\\n\"");\n    return 0;\n}\n",ACCEPTED,3,184
1591110035705499648,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 00:46:08,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\ni=int(imput())\n    data=\n    list(map(eval,input().split()))\n    for i in range(i):\nif i ==i-1:\nif data[i]==0\n    print(1,end=\""\"")\n    else:\nprint(6,end=\""\"")\n    else:\nif data[i]==0:\nprint(1)\n    else:\nprint(6)",COMPILE_ERROR,0,0
1591110064868470784,9e0ba8d857885aa94eaa182d3a194e51593598b2d7817b16af4b1b57e49e10de,2022-11-12 00:46:15,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int a = scanner.nextInt();\n        int b[] = new int[a];\n        for(int i = 0; i < a; i++) {\n            b[i] = scanner.nextInt();\n        }\n\n        for(int i = 0; i < b.length; i++) {\n            if(b[i] == 0) {\n                System.out.println(1);\n            } else {\n                System.out.println(6);\n            }\n        }\n    }\n},NON_ZERO_EXIT_CODE,228,16564
1591110199157526528,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 00:46:47,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\nI=int(imput())\n    data=\n    list(map(eval,input().split()))\n    for i in range(i):\nif i ==i-1:\nif data[i]==0\n    print(1,end=\""\"")\n    else:\nprint(6,end=\""\"")\n    else:\nif data[i]==0:\nprint(1)\n    else:\nprint(6)",COMPILE_ERROR,0,0
1591110346159468544,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 00:47:22,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\nl=int(imput())\n    data=\n    list(map(eval,input().split()))\n    for i in range(l):\nif i ==l-1:\nif data[i]==0\n    print(1,end=\""\"")\n    else:\nprint(6,end=\""\"")\n    else:\nif data[i]==0:\nprint(1)\n    else:\nprint(6)",COMPILE_ERROR,0,0
1591110466594713600,217f1946625720e554af7294d3599b943eea3b430c0df7aa0c5c70abe9904e56,2022-11-12 00:47:51,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.*;\npublic class Main{\n    public static void main(String[] args){\n        Scanner sc=new Scanner(System.in);\n        int time=sc.nextInt();\n        int count=0;\n        while(count<time){\n            System.out.println(\""6\"");\n            count++;\n        }\n    }\n}",WRONG_ANSWER,354,17012
1591110536232767488,9e0ba8d857885aa94eaa182d3a194e51593598b2d7817b16af4b1b57e49e10de,2022-11-12 00:48:07,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int a = scanner.nextInt();\n        int b[] = new int[a];\n        for(int i = 0; i < a; i++) {\n            b[i] = scanner.nextInt();\n        }\n\n        for(int i = 0; i < b.length; i++) {\n            if(b[i] == 0) {\n                System.out.println(1);\n            } else {\n                System.out.println(6);\n            }\n        }\n    }\n},NON_ZERO_EXIT_CODE,229,16784
1591110649365729280,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 00:48:34,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main()\n{\n int n,i,f,a[100000000];\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(int i=0;i<n;i++){\n        f=pow(6,a[i]);\n        f=f%10;\n        printf(\""%d\"",f);\n        if(i<n-1){\n            printf(\""\\n\"");\n        }\n\n        }\n    \n    return 0;\n}\n\n\n\n\n",TIME_LIMIT_EXCEEDED,2,328
1591110667795501056,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 00:48:39,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main()\n{\n int n,i,f,a[10000000];\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(int i=0;i<n;i++){\n        f=pow(6,a[i]);\n        f=f%10;\n        printf(\""%d\"",f);\n        if(i<n-1){\n            printf(\""\\n\"");\n        }\n\n        }\n    \n    return 0;\n}\n\n\n\n\n",TIME_LIMIT_EXCEEDED,3,320
1591110682777550848,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 00:48:42,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main()\n{\n int n,i,f,a[1000000];\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(int i=0;i<n;i++){\n        f=pow(6,a[i]);\n        f=f%10;\n        printf(\""%d\"",f);\n        if(i<n-1){\n            printf(\""\\n\"");\n        }\n\n        }\n    \n    return 0;\n}\n\n\n\n\n",WRONG_ANSWER,9,316
1591110753191505920,9e0ba8d857885aa94eaa182d3a194e51593598b2d7817b16af4b1b57e49e10de,2022-11-12 00:48:59,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int a = scanner.nextInt();\n        int b[] = new int[a];\n        for(int i = 0; i < a; i++) {\n            b[i] = scanner.nextInt();\n        }\n\n        for(int i = 0; i < b.length; i++) {\n            if(b[i] == 0) {\n                System.out.println(1);\n            } else {\n                System.out.println(6);\n            }\n        }\n    }\n},NON_ZERO_EXIT_CODE,231,16768
1591110804651442176,899c5501179552dc1fe5639f9047e15d0f835e7a87c8568193377882d0278985,2022-11-12 00:49:11,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"import math\nn=int(input())\ncount=0\nfor i in range(2,n+1):\n    temp=true\n    for j in range(2,math.floor(i**0.5)+1):\n        if i%j==0:\n            temp=false\n            break\n        if temp:\n            c+=1\nprint(c)",NON_ZERO_EXIT_CODE,14,2752
1591110830530297856,834ba62d861cf2d94a81f3b034a55b21f1378d4337b6b065c321d7da6bf82e17,2022-11-12 00:49:18,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"n=int(input())\nf=[]\nfor i in range(n):\n    f.append([int(i) for i in input().split()])\nfor i in range(n-2,-1,-1): \n    for j in range(0,i+1): \n        f[i][j] = max(f[i+1][j],f[i+1][j+1]) + f[i][j] \nprint(f[0][0],end=\""\"")\n",NON_ZERO_EXIT_CODE,14,2764
1591110924075839488,c3ff25cd087ae1424858449a82aca83b7f0722bfd3282b40127822bf22610ce0,2022-11-12 00:49:40,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""2022\\n\"");\n    return 0;\n}",ACCEPTED,3,184
1591110958376878080,899c5501179552dc1fe5639f9047e15d0f835e7a87c8568193377882d0278985,2022-11-12 00:49:48,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"import math\nn=int(input())\ncount=0\nfor i in range(2,n+1):\n    temp=true\n    for j in range(2,math.floor(i**0.5)+1):\n        if i%j==0:\n            temp=false\n            break\n    if temp:\n        c+=1\nprint(c)",NON_ZERO_EXIT_CODE,16,3468
1591111007936778240,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 00:50:00,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j=0;\n    scanf(\""%d\"",&n),\n    for(i=2;i<n;i++)\n    {\n        int k=0;\n        for(k=2;k<i;k++)\n        {\n            if(i%k==0)\n            {\n                break;\n            }\n        }\n        if(i==k)\n        {\n            j++;\n        }\n    }\n    printf(\""%d,j\"");\n}\n",COMPILE_ERROR,0,0
1591111085862727680,9e0ba8d857885aa94eaa182d3a194e51593598b2d7817b16af4b1b57e49e10de,2022-11-12 00:50:18,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int a = scanner.nextInt();\n        int b[] = new int[a];\n        for(int i = 0; i < a; i++) {\n            b[i] = scanner.nextInt();\n        }\n\n        for(int i = 0; i < b.length; i++) {\n            if(b[i] == 0) {\n                System.out.println(1);\n            } else {\n                System.out.println(6);\n            }\n        }\n    }\n},COMPILE_ERROR,0,0
1591111112903405568,9e0ba8d857885aa94eaa182d3a194e51593598b2d7817b16af4b1b57e49e10de,2022-11-12 00:50:25,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int a = scanner.nextInt();\n        int b[] = new int[a];\n        for(int i = 0; i < a; i++) {\n            b[i] = scanner.nextInt();\n        }\n\n        for(int i = 0; i < b.length; i++) {\n            if(b[i] == 0) {\n                System.out.println(1);\n            } else {\n                System.out.println(6);\n            }\n        }\n    }\n},NON_ZERO_EXIT_CODE,246,16728
1591111142766874624,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 00:50:32,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j=0;\n    scanf(\""%d\"",&n),\n    for(i=2;i<n;i++)\n    {\n        int k=0;\n        for(k=2;k<i;k++)\n        {\n            if(i%k==0)\n            {\n                break;\n            }\n        }\n        if(i==k)\n        {\n            j++;\n        }\n    }\n    printf(\""%d,j\"");\n}\n",COMPILE_ERROR,0,0
1591111169727856640,7a048784ed2975c30a64787731af1fce175495afd1f4aad852d064d00b6193b9,2022-11-12 00:50:38,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,n=int(input())\ni=1\nwhile i>=n:\n    if n%2!=0 and n%3!=0 and n%5!=0 and n%7!=0:\n        print(i)\n        i=i+1,WRONG_ANSWER,15,2752
1591111209561161728,cfbed023288d929e37ec2a5f480f49533f34048e9861900771cbd8327550eb31,2022-11-12 00:50:48,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n  int  a,b,c,d;\n  a=2;\n  b=0;\n  c=2;\n  d=2;\n  printf(\""%d%d%d%d\"",a,b,c,d);\n  return 0;\n}",ACCEPTED,2,188
1591111329509867520,9e0ba8d857885aa94eaa182d3a194e51593598b2d7817b16af4b1b57e49e10de,2022-11-12 00:51:17,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int a = scanner.nextInt();\n        int b[] = new int[a];\n        for(int i = 0; i < a; i++) {\n            b[i] = scanner.nextInt();\n        }\n\n        for(int i = 0; i < b.length; i++) {\n            if(b[i] == 0) {\n                System.out.println(1);\n            } else {\n                System.out.println(6);\n            }\n        }\n    }\n},NON_ZERO_EXIT_CODE,227,17020
1591111349378265088,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 00:51:21,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j=0;\n    scanf(\""%d\"",&n),\n    for(i=2;i<n;i++)\n    {\n        int k=0;\n        for(k=2;k<i;k++)\n        {\n            if(i%k==0)\n            {\n                break;\n            }\n        }\n        if(i==k)\n        {\n            j++;\n        }\n    }\n    printf(\""%d\"",j);\n}\n",COMPILE_ERROR,0,0
1591111375533969408,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 00:51:28,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main()\n{\n int n,i,f,a[1000000000];\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(int i=0;i<n-1;i++){\n        f=pow(6,a[i]);\n        f=f%10;\n        printf(\""%d\\n\"",f);\n    }\n    \n\n        f=pow(6,a[n]);\n        f=f%10;\n        printf(\""%d\\n\"",f);\n     }\n    \n    return 0;\n}\n\n\n\n\n",COMPILE_ERROR,0,0
1591111608993099776,f74f1cf8202c7b7d33a121c730f9d3964272c7cefa9076e57c0a15d1d098cce0,2022-11-12 00:52:23,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int X,Y,Z;\n    int S=0;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    S=X+Y-Z;\n    printf(\""%d\\n\"",S);\n    return 0;\n}\n",ACCEPTED,6,324
1591111667205869568,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 00:52:37,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j=0;\n    scanf(\""%d\"",&n),\n    for(i=2;i<n;i++)\n    {\n        int k=0;\n        for(k=2;k<i;k++)\n        {\n            if(i%k==0)\n            {\n                break;\n            }\n        }\n        if(i==k)\n        {\n            j++;\n        }\n    }\n    printf(\""%d\"",j);\n}\n",COMPILE_ERROR,0,0
1591111685652393984,c3ff25cd087ae1424858449a82aca83b7f0722bfd3282b40127822bf22610ce0,2022-11-12 00:52:41,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    printf(\""%d\\n\"",X+Y-Z);\n    return 0;\n}",ACCEPTED,5,200
1591111710797271040,6b02dfcf297d52c2de2e1416b33ee988ff909834c73207b147423a8301e9d174,2022-11-12 00:52:47,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"\n#include <stdio.h>\n#include <stdlib.h>\n#include<math.h>\nint main() {\n\tlong n, i,k,h;\n\t\n\tint* p = NULL;\n\tscanf(\""%d\"", &n);\n\tp = (int*)malloc(n * sizeof(int));\n\tfor (i = 0; i < n; i++)\n\t\tscanf(\""%d\"", &p[i]);\n\tfor (i = 0; i < n; i++)\n\t{\n\t    k=pow(6,p[i]);\n\t    k=k%10;\n\t    if(k<0)\n\t    k=-k;\n\t    \n\t\tprintf(\""%d\\n\"",k);\n\t} \n\t\t\n\treturn 0;\n}\n",SEGMENTATION_FAULT,3,316
1591111720272179200,62c83306b4f5c482e4e9a52dc69ae0b8ee7b5238abb34e56352843a0d484ff2c,2022-11-12 00:52:50,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    int zu1[100];\n    int zu2[100];\n    int i;\n    int max=0;\n    int kk=-2147483648;\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&zu1[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&zu2[i]);\n        max=max+zu2[i]-zu1[i];\n        if(max>=kk)\n            kk=max;\n    }\n    \n    \n        \n    printf(\""%d\"",kk);\n    return 0;\n}\n",WRONG_ANSWER,2,184
1591111834000752640,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 00:53:17,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\nl=int(imput())\n    data=\n    list(map(eval,input().split()))\n    for i in range(l):\nif i ==l-1:\nif data[i]==0\n    print(1,end=\""\"")\n    else:\nprint(6,end=\""\"")\n    else:\nif data[i]==0:\nprint(1)\n    else:\nprint(6)",NON_ZERO_EXIT_CODE,15,2744
1591111879135657984,6b02dfcf297d52c2de2e1416b33ee988ff909834c73207b147423a8301e9d174,2022-11-12 00:53:28,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"\n#include <stdio.h>\n#include <stdlib.h>\n#include<math.h>\nint main() {\n\tlong n, i,k,h;\n\t\n\tint* p = NULL;\n\tscanf(\""%d\"", &n);\n\tp = (int*)malloc(n * sizeof(int));\n\tfor (i = 0; i < n; i++)\n\t\tscanf(\""%d\"", &p[i]);\n\tfor (i = 0; i < n; i++)\n\t{\n\t    k=pow(6,p[i]);\n\t    k=k%10;\n\t    if(k<0)\n\t    k=-k;\n\t    \n\t\tprintf(\""%d\\n\"",k);\n\t} \n\t\t\n\treturn 0;\n}\n",SEGMENTATION_FAULT,4,312
1591111927894421504,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-12 00:53:39,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=eval(input())\nm = 0\no=int(1)\np=(6)\nlist = map(eval,input().split())\nfor i in list:\n    m=m+1\n    if 0<=i<=1000000000:\n        if m<a:\n            if i>0:\n                print(p)\n            else:\n                print(o)\n        if m==a:\n            if i>0:\n                print(p,end='')\n            else:\n                print(o,end='')\n",WRONG_ANSWER,33,2892
1591111984886648832,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 00:53:53,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\nl=int(imput())\n    data=list(map(eval,input().split()))\n    for i in range(l):\nif i ==l-1:\nif data[i]==0\n    print(1,end=\""\"")\n    else:\nprint(6,end=\""\"")\n    else:\nif data[i]==0:\nprint(1)\n    else:\nprint(6)",NON_ZERO_EXIT_CODE,17,3504
1591112044739342336,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 00:54:07,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\nl=int(imput())\n    data=\n    list(map(eval,input().split()))\n    for i in range(l):\nif i ==l-1:\nif data[i]==0\n    print(1,end=\""\"")\n    else:\nprint(6,end=\""\"")\n    else:\nif data[i]==0:\nprint(1)\n    else:\nprint(6)",NON_ZERO_EXIT_CODE,16,4140
1591112110812237824,62c83306b4f5c482e4e9a52dc69ae0b8ee7b5238abb34e56352843a0d484ff2c,2022-11-12 00:54:23,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"n = int(input())\nls1 = list(map(int,input().split()))\nls2 = list(map(int,input().split()))\nls3 = [(ls2[i]-ls1[i]) for i in range(0, n)]\nprint(ls3)\nmax_p = 0\na = 0\nwhile a < n:\n    p = 0\n\n    for i in range(a, n):\n        p += ls3[i]\n        if max_p < p:\n            max_p = p\n    a+=1\nprint(max_p)",WRONG_ANSWER,16,3640
1591112142139490304,62c83306b4f5c482e4e9a52dc69ae0b8ee7b5238abb34e56352843a0d484ff2c,2022-11-12 00:54:30,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"n = int(input())\nls1 = list(map(int,input().split()))\nls2 = list(map(int,input().split()))\nls3 = [(ls2[i]-ls1[i]) for i in range(0, n)]\nprint(ls3)\nmax_p = 0\na = 0\nwhile a < n:\n    p = 0\n\n    for i in range(a, n):\n        p += ls3[i]\n        if max_p < p:\n            max_p = p\n    a+=1\nprint(max_p)",WRONG_ANSWER,15,2884
1591112280916430848,62c83306b4f5c482e4e9a52dc69ae0b8ee7b5238abb34e56352843a0d484ff2c,2022-11-12 00:55:03,Python,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"n = int(input())\nls1 = list(map(int,input().split()))\nls2 = list(map(int,input().split()))\nls3 = [(ls2[i]-ls1[i]) for i in range(0, n)]\n#print(ls3)\nmax_p = 0\na = 0\nwhile a < n:\n    p = 0\n\n    for i in range(a, n):\n        p += ls3[i]\n        if max_p < p:\n            max_p = p\n    a+=1\nprint(max_p)",ACCEPTED,15,2748
1591112317134241792,6b02dfcf297d52c2de2e1416b33ee988ff909834c73207b147423a8301e9d174,2022-11-12 00:55:12,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"\n#include <stdio.h>\n#include <stdlib.h>\n#include<math.h>\nint main() {\n\tint n, i,k,h;\n\t\n\tint* p = NULL;\n\tscanf(\""%d\"", &n);\n\tp = (int*)malloc(n * sizeof(int));\n\tfor (i = 0; i < n; i++)\n\t\tscanf(\""%d\"", &p[i]);\n\tfor (i = 0; i < n; i++)\n\t{\n\t    k=pow(6,p[i]);\n\t    k=k%10;\n\t    if(k<0)\n\t    k=-k;\n\t    \n\t\tprintf(\""%d\\n\"",k);\n\t} \n\t\t\n\treturn 0;\n}\n",WRONG_ANSWER,5,312
1591112443961610240,62c83306b4f5c482e4e9a52dc69ae0b8ee7b5238abb34e56352843a0d484ff2c,2022-11-12 00:55:42,Python,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"n = int(input())\nls1 = list(map(int,input().split()))\nls2 = list(map(int,input().split()))\nls3 = [(ls2[i]-ls1[i]) for i in range(0, n)]\nmax_p = 0\na = 0\nwhile a < n:\n    p = 0\n    for i in range(a, n):\n        p += ls3[i]\n        if max_p < p:\n            max_p = p\n    a+=1\nprint(max_p)",ACCEPTED,16,2740
1591112460776550400,62c83306b4f5c482e4e9a52dc69ae0b8ee7b5238abb34e56352843a0d484ff2c,2022-11-12 00:55:46,Python,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"n = int(input())\nls1 = list(map(int,input().split()))\nls2 = list(map(int,input().split()))\nls3 = [(ls2[i]-ls1[i]) for i in range(0, n)]\nmax_p = 0\na = 0\nwhile a < n:\n    p = 0\n    for i in range(a, n):\n        p += ls3[i]\n        if max_p < p:\n            max_p = p\n    a+=1\nprint(max_p)",ACCEPTED,16,2744
1591112500240756736,6b02dfcf297d52c2de2e1416b33ee988ff909834c73207b147423a8301e9d174,2022-11-12 00:55:56,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include<math.h>\nint main() {\n\tlong n, i,k,h;\n\t\n\tlong* p = NULL;\n\tscanf(\""%d\"", &n);\n\tp = (long*)malloc(n * sizeof(long));\n\tfor (i = 0; i < n; i++)\n\t\tscanf(\""%d\"", &p[i]);\n\tfor (i = 0; i < n; i++)\n\t{\n\t    k=pow(6,p[i]);\n\t    k=k%10;\n\t    if(k<0)\n\t    k=-k;\n\t    \n\t\tprintf(\""%d\\n\"",k);\n\t} \n\t\t\n\treturn 0;\n}\n",SEGMENTATION_FAULT,3,444
1591112517580009472,1f29a576db974352c60cbe8aafdc4e5328b24d800890ab1c712d8c9fa85d72cc,2022-11-12 00:56:00,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint n,i;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(i=0;i<n;i++) a[i]=-(i+1);\n\tint b[n];\n\tfor(i=0;i<n;i++) b[i]=n-i;\n\t\n\tint max=0;\n\tfor(i=0;i<n;i++)\n\t{\n\tif(a[i]+b[i]>0) max=max+a[i]+b[i];\n\tif(a[i]+b[i]<0) break;\n    }\n\tprintf(\""%d\"",max);\n\treturn 0;\n}\n",WRONG_ANSWER,3,196
1591112608780955648,928387ba90b7d3af095968a0f9e0198612ede46fbbd5d1ef0dd919da00a4d7ec,2022-11-12 00:56:22,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#define _CRT_SECURE_NO_WARNINGS 1\n#include<stdlib.h>\n#include<stdio.h>\nint main() {\n\tint n, i = 0, sum = 0, j = 0, k = 0, a[10000] = { 0 }, b[10000] = {0}, flag = 0, max = 0;\n\tscanf(\""%d\"", &n);\n\tfor ( i = 0; i < n; i++)\n\t{\n\t\tscanf(\""%d\"", &a[i]);\n\t}\n\tfor ( j = 0; j < n; j++)\n\t{\n\t\tscanf(\""%d\"", &b[j]);\n\t}\n\tfor ( k = 0; k < n; k++)\n\t{\n\t\tsum = sum - a[k] + b[k];\n\t\tif (sum>flag)\n\t\t{\n\t\t\tmax = sum;\n\t\t}\n\t\tflag = sum;\n\t}\n\tprintf(\""%d\"", max);\n}",WRONG_ANSWER,3,308
1591112657338437632,6b02dfcf297d52c2de2e1416b33ee988ff909834c73207b147423a8301e9d174,2022-11-12 00:56:33,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"\n#include <stdio.h>\n#include <stdlib.h>\n#include<math.h>\nlong main() {\n\tlong n, i,k,h;\n\t\n\tlong* p = NULL;\n\tscanf(\""%d\"", &n);\n\tp = (long*)malloc(n * sizeof(long));\n\tfor (i = 0; i < n; i++)\n\t\tscanf(\""%d\"", &p[i]);\n\tfor (i = 0; i < n; i++)\n\t{\n\t    k=pow(6,p[i]);\n\t    k=k%10;\n\t    if(k<0)\n\t    k=-k;\n\t    \n\t\tprintf(\""%d\\n\"",k);\n\t} \n\t\t\n\treturn 0;\n}\n",SEGMENTATION_FAULT,4,436
1591112673792688128,1f29a576db974352c60cbe8aafdc4e5328b24d800890ab1c712d8c9fa85d72cc,2022-11-12 00:56:37,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint n,i;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(i=0;i<n;i++) a[i]=-(i+1);\n\tint b[n];\n\tfor(i=0;i<n;i++) b[i]=n-i;\n\t\n\tint max=0;\n\tfor(i=0;i<n;i++)\n\t{\n\tif(a[i]+b[i]>0) max=max+a[i]+b[i];\n\tif(a[i]+b[i]<0) max=max+0;\n    }\n\tprintf(\""%d\"",max);\n\treturn 0;\n}\n",WRONG_ANSWER,2,196
1591112685603852288,9e0ba8d857885aa94eaa182d3a194e51593598b2d7817b16af4b1b57e49e10de,2022-11-12 00:56:40,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int a = scanner.nextInt();\n        int b[] = new int[a];\n        for(int i = 0; i < a; i++) {\n            b[i] = scanner.nextInt();\n        }\n\n        for(int i = 0; i < b.length; i++) {\n            if(i != b.length - 1) {\n                if(b[i] == 0) {\n                System.out.println(1);\n            } else {\n                System.out.println(6);\n                } else {\n                    if(b[i] == 0) {\n                    System.out.print(1);\n                } else {\n                    System.out.print(6);\n                }\n            }\n        }\n    }\n},COMPILE_ERROR,0,0
1591112687415791616,20ffd83467b553ac24e1f4b8b096d58858684ca8c3f6a4d5a62be9ff7c4817da,2022-11-12 00:56:40,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n#define M 1000\nint main(){\nint i,n,x[M];\nint z;\nscanf(\""%d\"",&n);\nfor(i=0;i<n;i++)\nscanf(\""%d\"",&x[i]);\nfor(i=0;i<n-1;i++){ \nif(x[i]==0){ \n    z=1;\nprintf(\""%d\\n\"",z);\n     }\nelse {\n      z=6;\n      printf(\""%d\\n\"",z);\n     }\n     }\n    i=n-1;\nif(x[i]==0){ \n    z=1;\nprintf(\""%d\"",(int)z);\n     }\nelse {\n      z=6;\n      printf(\""%d\"",z);\n     }\n        \n\n     }",ACCEPTED,9,348
1591112929016090624,9e0ba8d857885aa94eaa182d3a194e51593598b2d7817b16af4b1b57e49e10de,2022-11-12 00:57:38,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int a = scanner.nextInt();\n        int b[] = new int[a];\n        for (int i = 0; i < a; i++) {\n            b[i] = scanner.nextInt();\n        }\n\n        for (int i = 0; i < b.length; i++) {\n            if (i != b.length - 1) {\n                if (b[i] == 0) {\n                    System.out.println(1);\n                } else {\n                    System.out.println(6);\n                }\n            }else{\n                if (b[i] == 0) {\n                    System.out.print(1);\n                } else {\n                    System.out.print(6);\n                }\n            }\n        }\n    }\n},NON_ZERO_EXIT_CODE,247,19492
1591112954492289024,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 00:57:44,C++,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(void)\n{\n    int n,i,j=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<n;i++)\n    {\n        int k=0;\n        for(k=2;k<i;k++)\n        {\n            if(i%k==0)\n            {\n                break;\n            }\n        }\n        if(i==k)\n        {\n            j++;\n        }\n    }\n    printf(\""%d\"",j);\n}\n",ACCEPTED,913,312
1591112998721228800,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 00:57:55,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"n=int(input())\nxh=list(map(eval,input().spilt()))\nhd=list(map(eval,input().split()))\ndata=[]\nmax=0\nfor i in range(n):\n    s=hd[i]-xh[i]\n    data.appen(s)\n    for i in range(n):\n     t-0\n    for j in range(i,n,1):\n            t=t+data[j]\n            if t>max:\n                max=t\nprint(max)",NON_ZERO_EXIT_CODE,15,2756
1591113027187945472,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-12 00:58:01,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(){\n    int n,i,j;\n    int x=0,y=0;\n\tscanf(\""%d\"",&n);\n\tint a[n],b[n],c[n];\n\tfor(i=0;i<ni++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\t\n\tfor(i=0;i<ni++){\n\t\tscanf(\""%d\"",&b[i]);\n\t}\n\t\n\tfor(i=0;i<ni++){\n\t\tc[i]=b[i]-a[i];\n\t}\n\tfor(i=0;i<n;i++){\n\t\tfor(j=i;j<n;j++){\n\t\t\ty=0;\n\t\t\ty+=c[j];\n\t\t\tif(y>x){\n\t\t\t\tx=y;\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\""%d\"",x);\n\treturn 0;\n}",COMPILE_ERROR,0,0
1591113108884619264,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-12 00:58:21,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(){\n    int n,i,j;\n    int x=0,y=0;\n\tscanf(\""%d\"",&n);\n\tint a[n],b[n],c[n];\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\t\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&b[i]);\n\t}\n\t\n\tfor(i=0;i<n;i++){\n\t\tc[i]=b[i]-a[i];\n\t}\n\tfor(i=0;i<n;i++){\n\t\tfor(j=i;j<n;j++){\n\t\t\ty=0;\n\t\t\ty+=c[j];\n\t\t\tif(y>x){\n\t\t\t\tx=y;\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\""%d\"",x);\n\treturn 0;\n}",WRONG_ANSWER,3,192
1591113143600877568,6b02dfcf297d52c2de2e1416b33ee988ff909834c73207b147423a8301e9d174,2022-11-12 00:58:29,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"\n#include <stdio.h>\n#include <stdlib.h>\n#include<math.h>\nlong main() {\n\tlong n, i,k,h;\n\t\n\tlong* p = NULL;\n\tscanf(\""%llf\"", &n);\n\tp = (long*)malloc(n * sizeof(long));\n\tfor (i = 0; i < n; i++)\n\t\tscanf(\""%llf\"", &p[i]);\n\tfor (i = 0; i < n; i++)\n\t{\n\t    k=pow(6,p[i]);\n\t    k=k%10;\n\t    if(k<0)\n\t    k=-k;\n\t    \n\t\tprintf(\""%llf\\n\"",k);\n\t} \n\t\t\n\treturn 0;\n}\n",RUNTIME_ERROR,3,308
1591113270788927488,1f29a576db974352c60cbe8aafdc4e5328b24d800890ab1c712d8c9fa85d72cc,2022-11-12 00:58:59,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint n,i;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(i=0;i<n;i++) scanf(\""%d\"",&a[i]);\n\tint b[n];\n\tfor(i=0;i<n;i++) scanf(\""%d\"",&b[i]);\n\t\n\tint max=0;\n\tfor(i=0;i<n;i++)\n\t{\n\tif(-a[i]+b[i]>0) max=max-a[i]+b[i];\n\tif(-a[i]+b[i]<0) max=max+0;\n    }\n\tprintf(\""%d\"",max);\n\treturn 0;\n}\n",WRONG_ANSWER,3,320
1591113279060115456,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-12 00:59:01,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(){\n    int n,i,j;\n    int x=0,y=0;\n\tscanf(\""%d\"",&n);\n\tint a[n],b[n],c[n];\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&b[i]);\n\t}\n\tfor(i=0;i<n;i++){\n\t\tc[i]=b[i]-a[i];\n\t}\n\tfor(i=0;i<n;i++){\n\t\tfor(j=i;j<n;j++){\n\t\t\ty=0;\n\t\t\ty+=c[j];\n\t\t\tif(y>x){\n\t\t\t\tx=y;\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\""%d\"",x);\n}",WRONG_ANSWER,3,184
1591113279315947520,6b02dfcf297d52c2de2e1416b33ee988ff909834c73207b147423a8301e9d174,2022-11-12 00:59:01,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"\n#include <stdio.h>\n#include <stdlib.h>\n#include<math.h>\nint main() {\n\tlong n, i,k,h;\n\t\n\tlong* p = NULL;\n\tscanf(\""%llf\"", &n);\n\tp = (long*)malloc(n * sizeof(long));\n\tfor (i = 0; i < n; i++)\n\t\tscanf(\""%llf\"", &p[i]);\n\tfor (i = 0; i < n; i++)\n\t{\n\t    k=pow(6,p[i]);\n\t    k=k%10;\n\t    if(k<0)\n\t    k=-k;\n\t    \n\t\tprintf(\""%llf\\n\"",k);\n\t} \n\t\t\n\treturn 0;\n}\n",TIME_LIMIT_EXCEEDED,3,452
1591113341110628352,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 00:59:16,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"n=int(input())\nxh=list(map(eval,input().spilt()))\nhd=list(map(eval,input().split()))\ndata=[]\nmax=0\nfor i in range(n):\n    s=hd[i]-xh[i]\n    data.appen(s)\n    for i in range(n):\n     t-0\n    for j in range(i,n,1):\n            t=t+data[j]\n            if t>max:\n                max=t\nprint(max)",NON_ZERO_EXIT_CODE,15,2744
1591113378922278912,1f29a576db974352c60cbe8aafdc4e5328b24d800890ab1c712d8c9fa85d72cc,2022-11-12 00:59:25,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint n,i;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(i=0;i<n;i++) scanf(\""%d\"",&a[i]);\n\tint b[n];\n\tfor(i=0;i<n;i++) scanf(\""%d\"",&b[i]);\n\t\n\tint max=0;\n\tfor(i=0;i<n;i++)\n\t{\n\tif(-a[i]+b[i]>0) max=max-a[i]+b[i];\n\tif(-a[i]+b[i]<0) max=max+0;\n    }\n\tprintf(\""%d\\n\"",max);\n\treturn 0;\n}\n",WRONG_ANSWER,3,312
1591113412766117888,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 00:59:33,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"n=int(input())\nxh=list(map(eval,input().spilt()))\nhd=list(map(eval,input().split()))\ndata=[]\nmax=0\nfor i in range(n):\n    s=hd[i]-xh[i]\n    data.appen(s)\n    for i in range(n):\n     t-0\n    for j in range(i,n,1):\n            t=t+data[j]\n            if t>max:\n                max=t\nprint(max)",NON_ZERO_EXIT_CODE,16,2876
1591113541933903872,6b02dfcf297d52c2de2e1416b33ee988ff909834c73207b147423a8301e9d174,2022-11-12 01:00:04,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"\n#include <stdio.h>\n#include <stdlib.h>\n#include<math.h>\nint main() {\n\tlong n, i,k,h;\n\t\n\tlong* p = NULL;\n\tscanf(\""%lf\"", &n);\n\tp = (long*)malloc(n * sizeof(long));\n\tfor (i = 0; i < n; i++)\n\t\tscanf(\""%lf\"", &p[i]);\n\tfor (i = 0; i < n; i++)\n\t{\n\t    k=pow(6,p[i]);\n\t    k=k%10;\n\t    if(k<0)\n\t    k=-k;\n\t    \n\t\tprintf(\""%lf\\n\"",k);\n\t} \n\t\t\n\treturn 0;\n}\n",SEGMENTATION_FAULT,4,440
1591113602227023872,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-12 01:00:18,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(){\n    int n,i,j;\n    int x=0,y=0;\n\t(void)scanf(\""%d\"",&n);\n\tint a[n],b[n],c[n];\n\tfor(i=0;i<n;i++){\n\t\t(void)scanf(\""%d\"",&a[i]);\n\t}\n\tfor(i=0;i<n;i++){\n\t\t(void)scanf(\""%d\"",&b[i]);\n\t}\n\tfor(i=0;i<n;i++){\n\t\tc[i]=b[i]-a[i];\n\t}\n\tfor(i=0;i<n;i++){\n\t\tfor(j=i;j<n;j++){\n\t\t\ty=0;\n\t\t\ty+=c[j];\n\t\t\tif(y>x){\n\t\t\t\tx=y;\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\""%d\"",x);\n}",WRONG_ANSWER,2,324
1591113657734443008,1f29a576db974352c60cbe8aafdc4e5328b24d800890ab1c712d8c9fa85d72cc,2022-11-12 01:00:32,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint n,i;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(i=0;i<n;i++) scanf(\""%d\"",&a[i]);\n\tint b[n];\n\tfor(i=0;i<n;i++) scanf(\""%d\"",&b[i]);\n\t\n\tint max=0;\n\tfor(i=0;i<n;i++)\n\t{\n\tif(-a[i]+b[i]>0) max=max-a[i]+b[i];\n\tif(-a[i]+b[i]<0) printf(\""%d\\n\"",max);\n    }\n\t\n\treturn 0;\n}\n",WRONG_ANSWER,3,308
1591113675132416000,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 01:00:36,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\nl=int(imput())\n    data=list(map(eval,input().split()))\n    for i in range(l):\n        if i ==l-1:\n            if data[i]==0\n    print(1,end=\""\"")\n    else:\nprint(6,end=\""\"")\n    else:\nif data[i]==0:\nprint(1)\n    else:\nprint(6)",NON_ZERO_EXIT_CODE,16,4008
1591113732057534464,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 01:00:49,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\nl=int(imput())\n    data=list(map(eval,input().split()))\n    for i in range(l):\n        if i ==l-1:\n            if data[i]==0\n            print(1,end=\""\"")\n            else:\nprint(6,end=\""\"")\n    else:\nif data[i]==0:\nprint(1)\n    else:\nprint(6)",NON_ZERO_EXIT_CODE,15,2888
1591113814710464512,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-12 01:01:09,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"t=int,input()\nt=6**n\nprint t",NON_ZERO_EXIT_CODE,14,2884
1591113824881651712,9e0ba8d857885aa94eaa182d3a194e51593598b2d7817b16af4b1b57e49e10de,2022-11-12 01:01:11,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\nimport static java.lang.System.exit;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int a = scanner.nextInt();\n        int b[] = new int[a];\n        for (int i = 0; i < a; i++) {\n            b[i] = scanner.nextInt();\n        }\n\n        for (int i = 0; i < b.length; i++) {\n            if (i != b.length - 1) {\n                if (b[i] == 0) {\n                    System.out.println(1);\n                } else {\n                    System.out.println(6);\n                }\n            }else{\n                if (b[i] == 0) {\n                    System.out.print(1);\n                } else {\n                    System.out.print(6);\n                }\n            }\n        }\n        exit(0);\n    }\n},NON_ZERO_EXIT_CODE,226,16804
1591113836449542144,1f29a576db974352c60cbe8aafdc4e5328b24d800890ab1c712d8c9fa85d72cc,2022-11-12 01:01:14,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint n,i;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(i=0;i<n;i++) scanf(\""%d\"",&a[i]);\n\tint b[n];\n\tfor(i=0;i<n;i++) scanf(\""%d\"",&b[i]);\n\t\n\tint max=0;\n\tfor(i=0;i<n;i++)\n\t{\n\tif(-a[i]+b[i]>0) max=max-a[i]+b[i];\n\tif(-a[i]+b[i]<0) break;\n    }\n\tprintf(\""%d\\n\"",max);\n\treturn 0;\n}\n",WRONG_ANSWER,4,488
1591114017140158464,6b02dfcf297d52c2de2e1416b33ee988ff909834c73207b147423a8301e9d174,2022-11-12 01:01:57,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"\n#include <stdio.h>\n#include <stdlib.h>\n#include<math.h>\nint main() {\n\tint n, i,k,h;\n\t\n\tint* p = NULL;\n\tscanf(\""%d\"", &n);\n\tp = (int*)malloc(n * sizeof(int));\n\tfor (i = 0; i < n; i++)\n\t\tscanf(\""%d\"", &p[i]);\n\tfor (i = 0; i < n; i++)\n\t{\n\t    k=pow(6,p[i]);\n\t    k=k%10;\n\t    if(k<0)\n\t    k=-k;\n\t    \n\t\tprintf(\""%d\\n\"",k);\n\t} \n\t\t\n\treturn 0;\n}\n",WRONG_ANSWER,4,196
1591114047473389568,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 01:02:05,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"n=int(input())\nxh=list(map(eval,input().spilt()))\nhd=list(map(eval,input().split()))\ndata=[]\nmax=0\nfor i in range(n):\n    s=hd[i]-xh[i]\n    data.appen(s)\n    for i in range(n):\n     t-0\n    for j in range(i,n,1):\n            t=t+data[j]\n            if t>max:\n                max=t\nprint(max)",NON_ZERO_EXIT_CODE,19,4272
1591114059603312640,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-12 01:02:07,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=eval(input())\nm = 0\no=int(1)\np=int(6)\nlist = map(eval,input().split())\nfor i in list:\n    m=m+1\n    if 0<=i<=1000000000:\n        if m<a:\n            if i>0:\n                print(p)\n            else:\n                print(o)\n        if m==a:\n            if i>0:\n                print(p,end='')\n            else:\n                print(o,end=''）\n    else:\n                      break\n                      \n",NON_ZERO_EXIT_CODE,15,2872
1591114073335443456,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 01:02:11,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main()\n{\n int n,i,f,a[100000000];\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(int i=0;i<n-1;i++){\n        f=pow(6,a[i]);\n        f=f%10;\n        printf(\""%d\\n\"",f);\n    }\n\n\n        f=pow(6,a[n]);\n        f=f%10;\n        printf(\""%d\\n\"",f);\n\n\n    return 0;\n}\n\n\n\n",SEGMENTATION_FAULT,2,312
1591114141484515328,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 01:02:27,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main()\n{\n int n,i,f,a[100000000];\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(int i=0;i<n-1;i++){\n        f=pow(6,a[i]);\n        f=f%10;\n        printf(\""%d\\n\"",f);\n    }\n\n\n        f=pow(6,a[n]);\n        f=f%10;\n        printf(\""%d\"",f);\n\n\n    return 0;\n}\n\n\n\n",SEGMENTATION_FAULT,3,436
1591114209704873984,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-12 01:02:43,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=eval(input())\nm = 0\no=int(1)\np=int(6)\nlist = map(eval,input().split())\nfor i in list:\n    m=m+1\n    if 0<=i<=1000000000:\n        if m<a:\n            if i>0:\n                print(p)\n            else:\n                print(o)\n        if m==a:\n            if i>0:\n                print(p,end='')\n            else:\n                print(o,end=''）\n    else:\n        break\n                      \n",NON_ZERO_EXIT_CODE,15,2756
1591114224548491264,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 01:02:47,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main()\n{\n int n,i,f,a[100000000];\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(int i=0;i<n-1;i++){\n        f=pow(6,a[i]);\n        f=f%10;\n        printf(\""%d\\n\"",f);\n    }\n        f=pow(6,a[n]);\n        f=f%10;\n        printf(\""%d\"",f);\n    return 0;\n}\n\n\n\n",SEGMENTATION_FAULT,3,316
1591114281096118272,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-12 01:03:00,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n,i,j;\n    int x=0,y=0;\n\tscanf(\""%d\"",&n);\n\tint a[n],b[n],c[n];\n\tfor(i=0;i<n;i++)\n\t\tscanf(\""%d\"",&a[i]);\n\tfor(i=0;i<n;i++)\n\t\tscanf(\""%d\"",&b[i]);\n\tfor(i=0;i<n;i++)\n\t\tc[i]=b[i]-a[i];\n\tfor(i=0;i<n;i++){\n\t\tfor(j=i;j<n;j++){\n\t\t\ty=0;\n\t\t\ty+=c[j];\n\t\t\tif(y>x){\n\t\t\t\tx=y;\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\""%d\"",x);\n}",WRONG_ANSWER,3,320
1591114308031942656,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 01:03:07,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"n=int(input())\nxh=list(map(eval,input().spilt()))\nhd=list(map(eval,input().split()))\ndata=[]\nmax=0\nfor i in range(n):\n    s=hd[i]-xh[i]\n    data.appen(s)\nfor i in range(n):\n    t-0\n    for j in range(i,n,1):\n            t=t+data[j]\n            if t>max:\n                max=t\nprint(max)",NON_ZERO_EXIT_CODE,14,2760
1591114328609193984,7a048784ed2975c30a64787731af1fce175495afd1f4aad852d064d00b6193b9,2022-11-12 01:03:12,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"n=int(input())\nflg=0\na=0\nfor i in range(2,n):\n    flg=0\n    for j in range(2,i-1):\n        if not(i%j):\n            flg=1\n            break\n    if(flg==0):\n        a=a+1\nprint(a)\n        ",TIME_LIMIT_EXCEEDED,1000,2988
1591114332740583424,6b02dfcf297d52c2de2e1416b33ee988ff909834c73207b147423a8301e9d174,2022-11-12 01:03:13,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"\n#include <stdio.h>\n#include <stdlib.h>\n#include<math.h>\nint main() {\n\tint n, i,k;\n\t\n\tint* p = NULL;\n\tscanf(\""%d\"", &n);\n\tp = (int*)malloc(n * sizeof(int));\n\tfor (i = 0; i < n; i++)\n\t\tscanf(\""%d\"", &p[i]);\n\tfor (i = 0; i < n; i++)\n\t{\n\t    k=pow(6,p[i]);\n\t    k=k%10;\n\t    if(k<0)\n\t    k=-k;\n\t    \n\t\tprintf(\""%d\\n\"",k);\n\t} \n\t\t\n\treturn 0;\n}\n",WRONG_ANSWER,7,696
1591114387740491776,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 01:03:26,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"n=int(input())\nxh=list(map(eval,input().spilt()))\nhd=list(map(eval,input().split()))\ndata=[]\nmax=0\nfor i in range(n):\n    s=hd[i]-xh[i]\n    data.appen(s)\nfor i in range(n):\n    t=0\n    for j in range(i,n,1):\n            t=t+data[j]\n            if t>max:\n                max=t\nprint(max)",NON_ZERO_EXIT_CODE,16,2744
1591114397496446976,cfbed023288d929e37ec2a5f480f49533f34048e9861900771cbd8327550eb31,2022-11-12 01:03:28,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n    int X,Y,Z;\n    int m=X + Y - Z;\n        printf(\""m=%d\"",m);\n    return 0;\n}",WRONG_ANSWER,3,196
1591114417520054272,9e0ba8d857885aa94eaa182d3a194e51593598b2d7817b16af4b1b57e49e10de,2022-11-12 01:03:33,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\nimport static java.lang.System.exit;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int a = scanner.nextInt();\n        int b[] = new int[a];\n        for (int i = 0; i < a; i++) {\n            b[i] = scanner.nextInt();\n        }\n\n        for (int i = 0; i < b.length; i++) {\n            if (i != b.length - 1) {\n                if (b[i] == 0) {\n                    System.out.println(1);\n                } else {\n                    System.out.println(6);\n                }\n            }else{\n                if (b[i] == 0) {\n                    System.out.print(1);\n                } else {\n                    System.out.print(6);\n                }\n            }\n        }\n        scanner.close();\n    }\n},NON_ZERO_EXIT_CODE,222,16892
1591114450554392576,1f29a576db974352c60cbe8aafdc4e5328b24d800890ab1c712d8c9fa85d72cc,2022-11-12 01:03:41,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint n,i;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(i=0;i<n;i++) scanf(\""%d\"",&a[i]);\n\tint b[n];\n\tfor(i=0;i<n;i++) scanf(\""%d\"",&b[i]);\n\t\n\tint max=0;\n\tfor(i=0;i<n;i++)\n\t{\n\tif(-a[i]+b[i]>0) max=max-a[i]+b[i];\n\tif(-a[i]+b[i]<=0) break;\n    }\n\tprintf(\""%d\\n\"",max);\n\treturn 0;\n}\n",WRONG_ANSWER,3,180
1591114452022398976,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 01:03:41,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"n=int(input())\nxh=list(map(eval,input().spilt()))\nhd=list(map(eval,input().split()))\ndata=[]\nmax=0\nfor i in range(n):\n    s=hd[i]-xh[i]\n    data.append(s)\nfor i in range(n):\n    t=0\n    for j in range(i,n,1):\n            t=t+data[j]\n            if t>max:\n                max=t\nprint(max)",NON_ZERO_EXIT_CODE,14,2880
1591114461195341824,d0d7b0b753346ba8da319a4bb32af868fdf41e2104a53a3a3d7b5b76c65907fe,2022-11-12 01:03:43,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint num(int N)\n{\n\tint i,a,b,c;\n\tif (N==0)\n\t{\n\t\tc=1;\n\t}\n\telse{\n\tc=6;\n\tfor (i=1;i<=N;i++)\n\t{\n\t\tc=c*6;\n\t}\n\tc=c%10;\n\t}\n\treturn c;\n}\nint main()\n{\n\tint t,N,i;\n\tscanf(\""%d\"", &t);\n\tfor (i=1; i<=t; i++)\n\t{\n\t\tscanf(\""%d\"", &N);\n\t\tprintf(\""%d\\n\"", num(N));\n\t}\n}\n\n",TIME_LIMIT_EXCEEDED,23,312
1591114551326736384,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 01:04:05,Python,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"n=int(input())\nxh=list(map(eval,input().split()))\nhd=list(map(eval,input().split()))\ndata=[]\nmax=0\nfor i in range(n):\n    s=hd[i]-xh[i]\n    data.append(s)\nfor i in range(n):\n    t=0\n    for j in range(i,n,1):\n            t=t+data[j]\n            if t>max:\n                max=t\nprint(max)",ACCEPTED,15,3000
1591114561539846144,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-12 01:04:07,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=eval(input())\nm = 0\no=int(1)\np=int(6)\nlist = map(eval,input().split())\nfor i in list:\n    m=m+1\n    if 0<=i<=1000000000:\n        if m<a:\n            if i>0:\n                print(p)\n            else:\n                print(o)\n        if m==a:\n            if i>0:\n                print(p,end='')\n            else:\n                print(o,end='')\n                      \n",WRONG_ANSWER,29,2880
1591114571870441472,6b02dfcf297d52c2de2e1416b33ee988ff909834c73207b147423a8301e9d174,2022-11-12 01:04:10,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"\n#include <stdio.h>\n#include <stdlib.h>\n#include<math.h>\nint main() {\n\tint n, i,k;\n\t\n\tint* p = NULL;\n\tscanf(\""%d\"", &n);\n\tp = (int*)malloc(n*sizeof(int));\n\tfor (i = 0; i < n; i++)\n\t\tscanf(\""%d\"", &p[i]);\n\tfor (i = 0; i < n; i++)\n\t{\n\t    k=pow(6,p[i]);\n\t    k=k%10;\n\t    if(k<0)\n\t    k=-k;\n\t    \n\t\tprintf(\""%d\\n\"",k);\n\t} \n\t\t\n\treturn 0;\n}\n",WRONG_ANSWER,6,308
1591114714707460096,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 01:04:44,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\nl=int(input())\n    data=list(map(eval,input().split()))\n    for i in range(l):\n        if i ==l-1:\n            if data[i]==0\n            print(1,end=\""\"")\n            else:\nprint(6,end=\""\"")\n    else:\nif data[i]==0:\nprint(1)\n    else:\nprint(6)",NON_ZERO_EXIT_CODE,16,2880
1591114785410842624,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-12 01:05:00,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=eval(input())\nm = 0\no=int(0)\np=int(6)\nlist = map(eval,input().split())\nfor i in list:\n    m=m+1\n    if 0<=i<=1000000000:\n        if m<a:\n            if i>0:\n                print(p)\n            else:\n                print(o)\n        if m==a:\n            if i>0:\n                print(p,end='')\n            else:\n                print(o,end='')\n                      \n",WRONG_ANSWER,30,2884
1591115165024694272,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 01:06:31,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\nl=int(input())\ndata=list(map(eval,input().split()))\nfor i in range(l):\n  if i ==l-1:\n     if data[i]==0\n        print(1,end=\""\"")\n     else:\n       print(6,end=\""\"")\nelse:\n  if data[i]==0:\n     print(1)\n  else:\n    print(6)",NON_ZERO_EXIT_CODE,16,2880
1591115174600310784,928387ba90b7d3af095968a0f9e0198612ede46fbbd5d1ef0dd919da00a4d7ec,2022-11-12 01:06:33,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#define _CRT_SECURE_NO_WARNINGS 1\n#include<stdlib.h>\n#include<stdio.h>\nint main() {\n\tint n, i = 0, sum = 0, j = 0, k = 0, a[10000] = { 0 }, b[10000] = {0}, flag = 0, max = 0;\n\tscanf(\""%d\"", &n);\n\tfor ( i = 0; i < n; i++)\n\t{\n\t\tscanf(\""%d\"", &a[i]);\n\t}\n\tfor ( j = 0; j < n; j++)\n\t{\n\t\tscanf(\""%d\"", &b[j]);\n\t}\n\tfor ( k = 0; k < n; k++)\n\t{\n\t\tsum = sum - a[k] + b[k];\n\t\tif (sum>flag||k==0)\n\t\t{\n\t\t\tmax = sum;\n\t\t}\n\t\tflag = sum;\n\t}\n\tprintf(\""%d\"", max);\n}",WRONG_ANSWER,3,476
1591115312106377216,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 01:07:06,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\nl=int(input())\ndata=list(map(eval,input().split()))\nfor i in range(l):\n  if i ==l-1:\n     if data[i]==0\n        print(1,end=\""\"")\n     else:\n       print(6,end=\""\"")\n  else:\n    if data[i]==0:\n       print(1)\n  else:\n    print(6)",NON_ZERO_EXIT_CODE,14,2748
1591115387872280576,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 01:07:24,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\nl=int(input())\ndata=list(map(eval,input().split()))\nfor i in range(l):\n  if i ==l-1:\n     if data[i]==0\n        print(1,end=\""\"")\n     else:\n       print(6,end=\""\"")\n  else:\n    if data[i]==0:\n       print(1)\n    else:\n      print(6)",NON_ZERO_EXIT_CODE,15,2876
1591115467421450240,cfbed023288d929e37ec2a5f480f49533f34048e9861900771cbd8327550eb31,2022-11-12 01:07:43,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    printf(\""%d\\n\"",X+Y-Z);\n    return 0;\n}",ACCEPTED,6,184
1591115551261396992,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-12 01:08:03,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.io.BufferedReader;\n\nimport java.io.IOException;\n\nimport java.io.InputStreamReader;\n\npublic class Solution {\n\n  \n\n     public static void main(String[] args) throws IOException{\n\n\t\tSolution s=new Solution();        BufferedReader bu=new BufferedReader(new InputStreamReader(System.in));\n\n\t\tString num=bu.readLine();\n\n\t\tint i=Integer.parseInt(num);\n\n\t\tSystem.out.println(s.Count_PrimeNum(i));\n\n\t\t\n\n\t}\n\n    public int Count_PrimeNum(int N) {\n\n        \n\n        int count=0;\n\n\t\tint devisor=2;\n\n\t\tint temp;\n\n\t\tfor(int i=2;i<=N;i++){\n\n\t\t\ttemp=i;\n\n\t\t\tdo {\n\n\t\t\t\tif(temp%devisor==0){\n\n\t\t\t\t\ttemp/=devisor;\n\n\t\t\t\t\tcount++;\n\n\t\t\t\t}else{\n\n\t\t\t\t\tdevisor++;\n\n\t\t\t\t}\n\n\t\t\t}while(temp!=1);\n\n\t\t\t//除数重置为2\n\n\t\t\tdevisor=2;\n\n\t\t}\n\n\t\treturn count;\n\n\t}\n\n},COMPILE_ERROR,0,0
1591115650708340736,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 01:08:27,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\nl=int(input())\ndata=\nlist(map(eval,input().split()))\nfor i in range(l):\n  if i ==l-1:\n     if data[i]==0:\n        print(1,end=\""\"")\n     else:\n       print(6,end=\""\"")\n  else:\n    if data[i]==0:\n       print(1)\n    else:\n      print(6)",NON_ZERO_EXIT_CODE,15,2756
1591115718144364544,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 01:08:43,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main()\n{\n int n,i,f,a[100000000];\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(int i=0;i<n-1;i++){\n        printf(\""6\\n\"");\n    }\n        printf(\""6\"");\n    return 0;\n}\n\n",TIME_LIMIT_EXCEEDED,3,440
1591115733285777408,d0d7b0b753346ba8da319a4bb32af868fdf41e2104a53a3a3d7b5b76c65907fe,2022-11-12 01:08:46,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint t,N,i;\n\tscanf(\""%d\"", &t);\n\tfor (i=1; i<=t; i++)\n\t{\n\t\tscanf(\""%d\"", &N);\n    int i,a,b,c;\n\tif (N==0)\n\t{\n\t\tc=1;\n\t}\n\telse{\n\tc=6;\n\tfor (i=1;i<=N;i++)\n\t{\n\t\tc=c*6;\n\t}\n\tc=c%10;\n\t}\n\t\tprintf(\""%d\\n\"",c);\n\t}\n}\n\n",TIME_LIMIT_EXCEEDED,23,308
1591115746212622336,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 01:08:50,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main()\n{\n int n,i,f,a[100000000];\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(int i=0;i<n-1;i++){\n        printf(\""6\\n\"");\n    }\n        printf(\""6\"");\n    return 0;\n}\n\n",SEGMENTATION_FAULT,3,312
1591115765229596672,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 01:08:54,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main()\n{\n int n,i,f,a[100000000];\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(int i=0;i<n-1;i++){\n        printf(\""6\\n\"");\n    }\n        printf(\""6\"");\n    return 0;\n}\n\n",SEGMENTATION_FAULT,3,332
1591115788201799680,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 01:09:00,Python,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\nl=int(input())\ndata=list(map(eval,input().split()))\nfor i in range(l):\n  if i ==l-1:\n     if data[i]==0:\n        print(1,end=\""\"")\n     else:\n       print(6,end=\""\"")\n  else:\n    if data[i]==0:\n       print(1)\n    else:\n      print(6)",ACCEPTED,46,2884
1591115902949568512,27fbb32d960dbf49665c8905b68012d602eda68987686c6f224ec7b49ca3d0ac,2022-11-12 01:09:27,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint js(int a)\n{\n    a=a%10;\n    return a;\n}\nint main()\n{\n    int n,i;\n    scanf(\""%d\"",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n        sum=js(a[i]);\n        printf(\""%d\\n\"",sum);\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1591115908926451712,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 01:09:28,Python,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\nl=int(input())\ndata=list(map(eval,input().split()))\nfor i in range(l):\n  if i ==l-1:\n     if data[i]==0:\n        print(1,end=\""\"")\n     else:\n       print(6,end=\""\"")\n  else:\n    if data[i]==0:\n       print(1)\n    else:\n      print(6)",ACCEPTED,47,4280
1591115920347541504,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 01:09:31,Python,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"n=int(input())\nxh=list(map(eval,input().split()))\nhd=list(map(eval,input().split()))\ndata=[]\nmax=0\nfor i in range(n):\n    s=hd[i]-xh[i]\n    data.append(s)\nfor i in range(n):\n    t=0\n    for j in range(i,n,1):\n            t=t+data[j]\n            if t>max:\n                max=t\nprint(max)",ACCEPTED,15,2876
1591115963917991936,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 01:09:41,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\nl=int(input())\ndata=list(map(eval,input().split()))\nfor i in range(l):\n  if i ==l-1:\n     if data[i]==0:\n        print(1,end=\""\"")\n     else:\n       print(6,end=\""\"")\n   else:\n    if data[i]==0:\n       print(1)\n    else:\n      print(6)",NON_ZERO_EXIT_CODE,15,2752
1591116008092381184,049837a14f9009a22f6972a6352f5125437a20058ca2f7d72b373d9ad98a6558,2022-11-12 01:09:52,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import math\nl=int(input())\ndata=list(map(eval,input().split()))\nfor i in range(l):\n  if i ==l-1:\n     if data[i]==0:\n        print(1,end=\""\"")\n     else:\n       print(6,end=\""\"")\n   else:\n    if data[i]==0:\n       print(1)\n   else:\n      print(6)",NON_ZERO_EXIT_CODE,15,2884
1591116116099903488,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-12 01:10:18,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include \""stdio.h\""\nint main(){\n    int n,i,j;\n    int x=0,y=0;\n\tscanf(\""%d\"",&n);\n\tint a[n],b[n],c[n];\n\tfor(i=0;i<n;i++)\n\t\tscanf(\""%d\"",&a[i]);\n\tfor(i=0;i<n;i++)\n\t\tscanf(\""%d\"",&b[i]);\n\tfor(i=0;i<n;i++)\n\t\tc[i]=b[i]-a[i];\n\tfor(i=0;i<n;i++){\n\t\tfor(j=i;j<n;j++){\n\t\t\ty=0;\n\t\t\ty+=c[j];\n\t\t\tif(y>x){\n\t\t\t\tx=y;\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\""%d\\n\"",x);\n}",WRONG_ANSWER,3,324
1591116538206269440,6b02dfcf297d52c2de2e1416b33ee988ff909834c73207b147423a8301e9d174,2022-11-12 01:11:58,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"\n#include <stdio.h>\n#include <stdlib.h>\n#include<math.h>\nint main() {\n\tint n, i,k;\n\t\n\tint* p = NULL;\n\tscanf(\""%d\"", &n);\n\tp = (int*)malloc(n*sizeof(int));\n\tfor (i = 0; i < n; i++)\n\t\tscanf(\""%d\"", &p[i]);\n\tfor (i = 0; i < n; i++)\n\t{\n\t    k=pow(6,p[i]);\n        if（k>maxValue)\n          k=k-maxValue;\n            \n          \n\t    k=k%10;\n\t    \n\t    \n\t\tprintf(\""%d\\n\"",k);\n\t} \n\t\t\n\treturn 0;\n}\n",COMPILE_ERROR,0,0
1591116557814665216,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-12 01:12:03,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include \""stdio.h\""\nint main(){\n    int n,i,j;\n    int x=0,y=0;\n\tscanf(\""%d\"",&n);\n\tint a[n],b[n],c[n];\n\tfor(i=0;i<n;i++)\n\t\tscanf(\""%d\"",&a[i]);\n\tfor(i=0;i<n;i++)\n\t\tscanf(\""%d\"",&b[i]);\n\tfor(i=0;i<n;i++)\n\t\tc[i]=b[i]-a[i];\n\tfor(i=0;i<n;i++){\n\t\tfor(j=i;j<n;j++){\n\t\t\ty=0;\n\t\t\ty+=c[j];\n\t\t\tif(y>x){\n\t\t\t\tx=y;\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\""%d\\n\"",x);\n}",WRONG_ANSWER,2,312
1591116799855362048,6b02dfcf297d52c2de2e1416b33ee988ff909834c73207b147423a8301e9d174,2022-11-12 01:13:01,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"\n#include <stdio.h>\n#include <stdlib.h>\n#include<math.h>\nint main() {\n\tint n, i,k;\n\t\n\tint* p = NULL;\n\tscanf(\""%d\"", &n);\n\tp = (int*)malloc(n*sizeof(int));\n\tfor (i = 0; i < n; i++)\n\t\tscanf(\""%d\"", &p[i]);\n\tfor (i = 0; i < n; i++)\n\t{\n\t    k=pow(6,p[i]);\n        if(k<maxValue)\n          k=k-maxValue;\n            \n          \n\t    k=k%10;\n\t    \n\t    \n\t\tprintf(\""%d\\n\"",k);\n\t} \n\t\t\n\treturn 0;\n}\n",COMPILE_ERROR,0,0
1591116804972417024,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-12 01:13:02,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include \""stdio.h\""\nint main(){\n    int n,i,j;\n    int x=0,y=0;\n\tifscanf(){\""&d\"",&n};\n\tint a[n],b[n],c[n];\n\tfor(i=0;i<n;i++)\n\t\tscanf(\""%d\"",&a[i]);\n\tfor(i=0;i<n;i++)\n\t\tscanf(\""%d\"",&b[i]);\n\tfor(i=0;i<n;i++)\n\t\tc[i]=b[i]-a[i];\n\tfor(i=0;i<n;i++){\n\t\tfor(j=i;j<n;j++){\n\t\t\ty=0;\n\t\t\ty+=c[j];\n\t\t\tif(y>x){\n\t\t\t\tx=y;\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\""%d\\n\"",x);\n}",COMPILE_ERROR,0,0
1591116854658138112,c3ff25cd087ae1424858449a82aca83b7f0722bfd3282b40127822bf22610ce0,2022-11-12 01:13:14,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,m;\n    scanf(\""%d\"",&m);\n    while(m>0)\n    {scanf(\""%d\"",&n);\n    printf(\""6\\n\"");\n     m--;\n     //6的任何次方都为6\n    }\n    return 0;\n        \n    \n}",WRONG_ANSWER,6,192
1591116929870401536,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 01:13:32,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main()\n{\n int n,i,f,a[100000000];\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(int i=0;i<n-1;i++){\n        printf(\""6\\n\"");\n    }\n        printf(\""6\"");\n    return 0;\n}\n\n",SEGMENTATION_FAULT,3,436
1591117000561197056,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-12 01:13:49,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include \""stdio.h\""\nint main(){\n    int n,i,j;\n    int x=0,y=0;\n\tif(scanf()){\""&d\"",&n};\n\tint a[n],b[n],c[n];\n\tfor(i=0;i<n;i++)\n\t\tif(scanf()){\""&d\"",&a[i]};\n\tfor(i=0;i<n;i++)\n\t\tscanf(\""%d\"",&b[i]);\n\tfor(i=0;i<n;i++)\n\t\tc[i]=b[i]-a[i];\n\tfor(i=0;i<n;i++){\n\t\tfor(j=i;j<n;j++){\n\t\t\ty=0;\n\t\t\ty+=c[j];\n\t\t\tif(y>x){\n\t\t\t\tx=y;\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\""%d\\n\"",x);\n}",COMPILE_ERROR,0,0
1591117044756557824,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-12 01:13:59,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include \""stdio.h\""\nint main(){\n    int n,i,j;\n    int x=0,y=0;\n\tif(scanf()){\""&d\"",&n};\n\tint a[n],b[n],c[n];\n\tfor(i=0;i<n;i++)\n\t\tif(scanf()){\""&d\"",&a[i]};\n\tfor(i=0;i<n;i++)\n\t\tscanf(\""%d\"",&b[i]);\n\tfor(i=0;i<n;i++)\n\t\tc[i]=b[i]-a[i];\n\tfor(i=0;i<n;i++){\n\t\tfor(j=i;j<n;j++){\n\t\t\ty=0;\n\t\t\ty+=c[j];\n\t\t\tif(y>x){\n\t\t\t\tx=y;\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\""%d\\n\"",x);\n}",COMPILE_ERROR,0,0
1591117146212577280,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-12 01:14:23,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(){\n    int n,i,j;\n    int x=0,y=0;\n\tscanf(\""%d\"",&n);\n\tint a[n],b[n],c[n];\n\tfor(i=0;i<n;i++)\n\t\tscanf(\""%d\"",&a[i]);\n\tfor(i=0;i<n;i++)\n\t\tscanf(\""%d\"",&b[i]);\n\tfor(i=0;i<n;i++)\n\t\tc[i]=b[i]-a[i];\n\tfor(i=0;i<n;i++){\n\t\tfor(j=i;j<n;j++){\n\t\t\ty=0;\n\t\t\ty+=c[j];\n\t\t\tif(y>x){\n\t\t\t\tx=y;\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\""%d\\n\"",x);\n}",WRONG_ANSWER,3,316
1591117187207725056,c3ff25cd087ae1424858449a82aca83b7f0722bfd3282b40127822bf22610ce0,2022-11-12 01:14:33,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,m;\n    scanf(\""%d\"",&m);\n    while(m>0)\n    {scanf(\""%d\"",&n);\n    printf(\""6\\n\"");\n     m--;\n\n    }\n    return 0;\n        \n    \n}",WRONG_ANSWER,9,188
1591117270275895296,356d4d261b0c273ed9edf9a21f22e4b180080ccba0f8bbfa0c58f889e1a800cc,2022-11-12 01:14:53,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    printf(\""%d\\n\"",X+Y-Z);\n    return 0;\n}\n",ACCEPTED,4,196
1591117541106319360,c3ff25cd087ae1424858449a82aca83b7f0722bfd3282b40127822bf22610ce0,2022-11-12 01:15:57,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int n,m;\n    scanf(\""%d\"",&m);\n    while(m>0)\n    {\n    printf(\""6\\n\"");\n     m--;\n\n    }\n    return 0;\n        \n    \n}",WRONG_ANSWER,9,312
1591117578909560832,2b5cb6632c63d42afddd2444d7f2bf98adbdcec9b4ad3da49a684260eebba723,2022-11-12 01:16:07,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int a;\nprintf(\""今年是哪一年呢? \\n\"");\n    scanf(\""%d,&a\"");\n    printf(\""2022\"");\n}\nreturn 0;",COMPILE_ERROR,0,0
1591117633993379840,c3ff25cd087ae1424858449a82aca83b7f0722bfd3282b40127822bf22610ce0,2022-11-12 01:16:20,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int m;\n    scanf(\""%d\"",&m);\n    while(m>0)\n    {\n    printf(\""6\\n\"");\n     m--;\n\n    }\n    return 0;\n        \n    \n}",WRONG_ANSWER,9,312
1591117800641441792,6b02dfcf297d52c2de2e1416b33ee988ff909834c73207b147423a8301e9d174,2022-11-12 01:16:59,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"\n#include <stdio.h>\n#include <stdlib.h>\n#include<math.h>\nint main() {\n\tint n, i,k;\n\t\n\tint* p = NULL;\n\tscanf(\""%d\"", &n);\n\tp = (int*)malloc(n*sizeof(int));\n\tfor (i = 0; i < n; i++)\n\t\tscanf(\""%d\"", &p[i]);\n\tfor (i = 0; i < n; i++)\n\t{\n\t    k=pow(6,p[i]);\n        if(k>2147483647)\n        { k=k-2147483647;}\n         \n            \n          \n\t    k=k%10;\n\t    \n\t    \n\t\tprintf(\""%d\\n\"",k);\n\t} \n\t\t\n\treturn 0;\n}\n",WRONG_ANSWER,6,312
1591117811194310656,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 01:17:02,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main()\n{\n int n,i,f,a[100000000];\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(int i=0;i<n-1;i++){\n        printf(\""6\\n\"");\n    }\n        printf(\""6\"");\n    return 0;\n}\n\n",TIME_LIMIT_EXCEEDED,2,316
1591117831905804288,2b5cb6632c63d42afddd2444d7f2bf98adbdcec9b4ad3da49a684260eebba723,2022-11-12 01:17:07,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int a;\nprintf(\""今年是哪一年呢? \\n\"");\n    scanf(\""%d,&a\"");\n    printf(\""2022\"");\n}\n",WRONG_ANSWER,3,308
1591117911446564864,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 01:17:26,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main()\n{\n int n,i,f,a[100000000];\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(int i=0;i<n-1;i++){\n        printf(\""6\\n\"");\n    }\n        printf(\""6\"");\n    return 0;\n}\n\n",TIME_LIMIT_EXCEEDED,3,316
1591118233493639168,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-12 01:18:43,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(){\n    int n,i,j;\n    int x=0,y=0;\n\tif(scanf(\""%d\"",&n)){};\n\tint a[n],b[n],c[n];\n\tfor(i=0;i<n;i++)\n\t\tscanf(\""%d\"",&a[i]);\n\tfor(i=0;i<n;i++)\n\t\tscanf(\""%d\"",&b[i]);\n\tfor(i=0;i<n;i++)\n\t\tc[i]=b[i]-a[i];\n\tfor(i=0;i<n;i++){\n\t\tfor(j=i;j<n;j++){\n\t\t\ty=0;\n\t\t\ty+=c[j];\n\t\t\tif(y>x){\n\t\t\t\tx=y;\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\""%d\\n\"",x);\n}",WRONG_ANSWER,2,188
1591118298190778368,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-12 01:18:58,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(){\n    int n,i,j;\n    int x=0,y=0;\n\tif(scanf(\""%d\"",&n)){};\n\tint a[n],b[n],c[n];\n\tfor(i=0;i<n;i++)\n\t\tscanf(\""%d\"",&a[i]);\n\tfor(i=0;i<n;i++)\n\t\tif(scanf(\""%d\"",&b[i])){};\n\tfor(i=0;i<n;i++)\n\t\tc[i]=b[i]-a[i];\n\tfor(i=0;i<n;i++){\n\t\tfor(j=i;j<n;j++){\n\t\t\ty=0;\n\t\t\ty+=c[j];\n\t\t\tif(y>x){\n\t\t\t\tx=y;\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\""%d\\n\"",x);\n}",WRONG_ANSWER,3,344
1591118399319642112,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-12 01:19:22,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(){\n    int n,i,j;\n    int x=0,y=0;\n\tif(scanf(\""%d\"",&n)){};\n\tint a[n],b[n],c[n];\n\tfor(i=0;i<n;i++)\n\t\tif(scanf(\""%d\"",&a[i])){};\n\tfor(i=0;i<n;i++)\n\t\tif(scanf(\""%d\"",&b[i])){};\n\tfor(i=0;i<n;i++)\n\t\tc[i]=b[i]-a[i];\n\tfor(i=0;i<n;i++){\n\t\tfor(j=i;j<n;j++){\n\t\t\ty=0;\n\t\t\ty+=c[j];\n\t\t\tif(y>x){\n\t\t\t\tx=y;\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\""%d\\n\"",x);\n}",WRONG_ANSWER,3,192
1591118455179358208,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-12 01:19:35,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(){\n    int n,i,j;\n    int x=0,y=0;\n\tscanf(\""%d\"",&n);\n\tint a[n],b[n],c[n];\n\tfor(i=0;i<n;i++)\n\t\tif(scanf(\""%d\"",&a[i])){};\n\tfor(i=0;i<n;i++)\n\t\tif(scanf(\""%d\"",&b[i])){};\n\tfor(i=0;i<n;i++)\n\t\tc[i]=b[i]-a[i];\n\tfor(i=0;i<n;i++){\n\t\tfor(j=i;j<n;j++){\n\t\t\ty=0;\n\t\t\ty+=c[j];\n\t\t\tif(y>x){\n\t\t\t\tx=y;\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\""%d\\n\"",x);\n}",WRONG_ANSWER,3,184
1591118460707475456,c3ff25cd087ae1424858449a82aca83b7f0722bfd3282b40127822bf22610ce0,2022-11-12 01:19:37,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int m,n;\n    scanf(\""%d\"",&m);\n    while(m>0)\n    {scanf(\""%d\"",&n);\n     if(n!=EOF)\n    printf(\""6\\n\"");\n     m--;\n\n    }\n    return 0;\n        \n    \n}",WRONG_ANSWER,9,308
1591118493729206272,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 01:19:45,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,#include<stdio.h>\n#include<math.h>\n\nint n = 100000000;\nbool flag[100000000+1];                 // flag[0] 无用的空间；\n\nint count() {\n    int cnt = 0;\n    flag[2] = 1;\n    for (int i = 3; i < n; ++i) {\n        flag[i++] = 1;               // 奇数位\n        flag[i] = 0;                 // 偶数位直接过滤\n    }\n    for (int i = 3; i <= sqrt(n*1.); ++i) {\n        if (flag[i] != 1) continue;\n        for (int j = i*i; j <= n; j += i) {\n                            // 将倍数转换为加法\n            flag[j] = 0;\n        }\n    }\n    for (int i = 1; i <= n; ++i)\n        cnt += flag[i];\n    return cnt;\n},COMPILE_ERROR,0,0
1591118563266596864,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-12 01:20:01,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(){\n    int n,i,j;\n    int x=0,y=0;\n\tif(scanf(\""%d\"",&n)){};\n\tint a[n],b[n],c[n];\n\tfor(i=0;i<n;i++)\n\t\tif(scanf(\""%d\"",&a[i])){};\n\tfor(i=0;i<n;i++)\n\t\tif(scanf(\""%d\"",&b[i])){};\n\tfor(i=0;i<n;i++)\n\t\tc[i]=b[i]-a[i];\n\tfor(i=0;i<n;i++){\n\t\tfor(j=i;j<n;j++){\n\t\t\ty+=c[j];\n\t\t\tif(y>x){\n\t\t\t\tx=y;\n                y=0;\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\""%d\\n\"",x);\n}",WRONG_ANSWER,2,188
1591118646481563648,e0ad880549bf3b7847204a80a93841fe1f47e1fb8bc464088cb521848107cfde,2022-11-12 01:20:21,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int A,B,C,result;\n    0<=A<=100;\n    0<=B<=100;\n    0<=C<=100;\n    result=A+B-C;\n    scanf(\""%d%d%d\"",&A,&B,&C);\n    printf(\""%d\"",result);\n}\n",WRONG_ANSWER,3,312
1591119038216994816,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-12 01:21:54,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(){\n    int n,i,j;\n    int x=0,y=0;\n\tif(scanf(\""%d\"",&n)){};\n\tint a[n],b[n],c[n];\n\tfor(i=0;i<n;i++)\n\t\tif(scanf(\""%d\"",&a[i])){};\n\tfor(i=0;i<n;i++)\n\t\tif(scanf(\""%d\"",&b[i])){};\n\tfor(i=0;i<n;i++)\n\t\tc[i]=b[i]-a[i];\n\tfor(i=0;i<n;i++){\n\t\tfor(j=i;j<n;j++){\n\t\t\ty=0;\n\t\t\tif(y>x){\n\t\t\t\tx=y;\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\""%d\\n\"",x);\n}",WRONG_ANSWER,3,312
1591119119510974464,d0d7b0b753346ba8da319a4bb32af868fdf41e2104a53a3a3d7b5b76c65907fe,2022-11-12 01:22:14,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint t,N,i;\n\tscanf(\""%d\"", &t);\n\tfor (i=1; i<=t; i++)\n\t{\n\t\tscanf(\""%d\"", &N);\n    int i,a,b,c;\n\tif (N==0)\n\t{\n\t\tc=1;\n\t}\n\telse{\n\tc=6;\n\tfor (i=1;i<=N;i++)\n\t{\n\t\tc=c*6;\n\t}\n\tc=c%10;\n        i--;\n\t}\n\t\tprintf(\""%d\\n\"",c);\n\t}\n}\n\n",TIME_LIMIT_EXCEEDED,23,312
1591119181637029888,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-12 01:22:29,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(){\n    int n,i,j;\n    int x=0,y=0;\n\tif(scanf(\""%d\"",&n)){};\n\tint a[n],b[n],c[n];\n\tfor(i=0;i<n;i++)\n\t\tif(scanf(\""%d\"",&a[i])){};\n\tfor(i=0;i<n;i++)\n\t\tif(scanf(\""%d\"",&b[i])){};\n\tfor(i=0;i<n;i++)\n\t\tc[i]=b[i]-a[i];\n\tfor(i=0;i<n;i++){\n\t\tfor(j=i;j<n;j++){\n\t\t\ty=0;\n\t\t\tif(y>x){\n\t\t\t\tx=y;\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\""%d\"",x);\n}",WRONG_ANSWER,3,316
1591119208233107456,b8a7ba8e6c41741e66a8153e5f137c86c8dba9c4dbb2f65f35d7554a5b082d56,2022-11-12 01:22:35,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint i,a;\n\tscanf(\""%d\"",&i);\n\twhile(i>0){\n\t\tscanf(\""%d\"",&a);\n\t\tif(a==0)\n        printf(\""1\\n\"");\n        else\n        printf(\""6\\n\"");\n\t} \n    return 0;\n}",TIME_LIMIT_EXCEEDED,20,320
1591119235567390720,b8a7ba8e6c41741e66a8153e5f137c86c8dba9c4dbb2f65f35d7554a5b082d56,2022-11-12 01:22:41,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint i,a;\n\tscanf(\""%d\"",&i);\n\twhile(i>0){\n\t\tscanf(\""%d\"",&a);\n\t\tif(a==0)\n        printf(\""1\\n\"");\n        else\n        printf(\""6\\n\"");\n\t\ti--;\n\t} \n    return 0;\n}",ACCEPTED,9,308
1591119240294367232,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 01:22:43,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<string.h>\n#include<math.h>\n\nint flag[10006];\nint num[10000],total,now,n;\n\nvoid solve(int index,int Mul,int K){\n      int i,t;\n   if(K==0){\n    now+=n/Mul;\n    return;\n   }\n   for(i=index;i<total-K+1;i++){\n     Mul*=num[i];\n     t=now;\n     if(Mul<=n){\n              solve(i+1,Mul,K-1);\n     }\n     if(t==now)//优化剪枝（1）\n      return;\n           Mul/=num[i];\n   }\n}\n\nint Judge(int x){\n int t,i;\n t=sqrt(x*1.0);\n for(i=2;i<=t;i++)\n  if(n%i==0)\n   return 0;\n return 1;\n}\n\nint main(){\n    int i,j,t,Count;\n memset(flag,0,sizeof(flag));\n for(i=2;i<=10000;i++){\n  if(flag[i])\n   continue;\n  for(j=2;j*i<=10000;j++)\n   flag[i*j]=1;\n }\n while(scanf(\""%d\"",&n)==1){\n  Count=0;\n  if(n<=10000){\n   for(i=2;i<n;i++)\n    if(!flag[i])\n     Count++;\n  }\n  else{\n   t=sqrt(1.0*n);\n   total=0;\n   for(i=2;i<=t;i++)\n    if(!flag[i])\n     num[total++]=i;\n   for(i=1;i<=total;i++){\n    now=0;\n    solve(0,1,i);\n    if(now==0)\n     break;\n    if(i&1)\n       Count+=now;\n    else\n       Count-=now;\n   }\n   Count-=total;\n   Count=n-Count-1;\n   if(Judge(n))\n    Count--;\n  }\n  printf(\""%d\\n\"",Count);\n }\n return 0;\n}\n",ACCEPTED,6,448
1591119241904979968,09eb01e8f9f24922a6c60a1149d505ad1ebb9b0a39ed1101140fe0fd93daa753,2022-11-12 01:22:43,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint n;\n\tscanf(\""%d\"", &n);\n\tint i = 0;\n\tint a[100]={0};\n\tdo {\n\t\tscanf(\""%d\"", &a[i++]);\n\t} while (i < n);\n\tfor (i = 0; i < n; i++)\n\t{\n\t\tif (a[i] == 0)\n\t\t\tprintf(\""1\"");\n\t\telse\n\t\t\tprintf(\""6\"");\n\t\tif(i<n-1)\n\t\tprintf(\""\\n\"");\n\t}\n\treturn 0;\n}\n",ACCEPTED,9,312
1591119335513460736,c3ff25cd087ae1424858449a82aca83b7f0722bfd3282b40127822bf22610ce0,2022-11-12 01:23:05,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int m,n;\n    scanf(\""%d\"",&m);\n    scanf(\""%d\"",&n);\n    printf(\""6\\n\"");\n    m--;\n    while(m>0)\n    {scanf(\"" %d\"",&n);\n     if(n!=EOF)\n    printf(\""6\\n\"");\n     m--;\n\n    }\n    return 0;\n        \n    \n}",WRONG_ANSWER,9,320
1591119493294764032,2b5cb6632c63d42afddd2444d7f2bf98adbdcec9b4ad3da49a684260eebba723,2022-11-12 01:23:43,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int x;\n    printf(\""今年是哪一年呢？\\n\"");\n    scanf(\""%d\"",&x);\n    printf(\""2022\"");\n}\nreturn 0;\n",COMPILE_ERROR,0,0
1591119564832813056,c3ff25cd087ae1424858449a82aca83b7f0722bfd3282b40127822bf22610ce0,2022-11-12 01:24:00,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int m,n;\n    scanf(\""%d\"",&m);\n    while(m>0)\n    {scanf(\"" %d\"",&n);\n     if(n!=EOF)\n    printf(\""6\\n\"");\n     m--;\n\n    }\n    return 0;\n        \n    \n}",WRONG_ANSWER,9,308
1591119674639691776,d0d7b0b753346ba8da319a4bb32af868fdf41e2104a53a3a3d7b5b76c65907fe,2022-11-12 01:24:26,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n\tint t,N,i;\n\tscanf(\""%d\"", &t);\n\tfor (i=1; i<=t; i++)\n\t{\n\t\tscanf(\""%d\"", &N);\n    int i,a,b,c;\n\tif (N==0)\n\t{\n\t\tc=1;\n\t}\n\telse{\n\tc=6;\n\tfor (i=1;i<=N;i++)\n\t{\n\t\tc=c*6;\n\t}\n\tc=c%10;\n\t}\n\t\tprintf(\""%d\\n\"",c);\n        i--;\n\t}\n}\n\n",TIME_LIMIT_EXCEEDED,22,196
1591119682025885696,2b5cb6632c63d42afddd2444d7f2bf98adbdcec9b4ad3da49a684260eebba723,2022-11-12 01:24:28,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int x;\n    scanf(\""%d\"",&x);\n    printf(\""2022\"");\n}\nreturn 0;\n",COMPILE_ERROR,0,0
1591119800741462016,1f29a576db974352c60cbe8aafdc4e5328b24d800890ab1c712d8c9fa85d72cc,2022-11-12 01:24:56,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint n,i;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(i=0;i<n;i++) scanf(\""%d\"",&a[i]);\n\tint b[n];\n\tfor(i=0;i<n;i++) scanf(\""%d\"",&b[i]);\n\t\n\tint max=0,sum;\n\tint j;\n\tfor(i=0;i<n;i++)\n\t{\n\t\tsum=0;\n\t\tfor(j=0;j<i;j++)\n\t\t{\n\t\t\tsum=sum-a[j]+b[j];\n\t\t\tif(sum>max) max=sum;\n\t\t}\n\t}\n\tprintf(\""%d\"",max);\n\treturn 0;\n}\n",WRONG_ANSWER,2,184
1591119810044407808,356d4d261b0c273ed9edf9a21f22e4b180080ccba0f8bbfa0c58f889e1a800cc,2022-11-12 01:24:58,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n\tint n,f;\n\tcin >> n;\n\tint cnt = 0;\n\t\tfor (int i = 2; i <= n; i++)\n\t\t{\n\t\t\tf=1;\n\t\t\tfor(int j = 2; j <=sqrt(i); j++)\n\t\t\t{\n\t\t\t\tif(i%j==0){\n\t\t\t\t\tf=0;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(f){\n\t\t\t//cout << i << endl ;\n\t\t\tcnt++;\n\t\t\t}\n\t\t}\n\tcout << cnt<< endl;\n\treturn 0;\n}\n\n\n",COMPILE_ERROR,0,0
1591120120490037248,1f29a576db974352c60cbe8aafdc4e5328b24d800890ab1c712d8c9fa85d72cc,2022-11-12 01:26:12,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#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++) scanf(\""%d\"",&a[i]);\n\tint b[n];\n\tfor(i=0;i<n;i++) scanf(\""%d\"",&b[i]);\n\t\n\tint max=0,sum;\n\tint j;\n\tfor(i=0;i<n;i++)\n\t{\n\t\tsum=0;\n\t\tfor(j=i;j<n;j++)\n\t\t{\n\t\t\tsum=sum-a[j]+b[j];\n\t\t\tif(sum>max) max=sum;\n\t\t}\n\t}\n\tprintf(\""%d\"",max);\n\treturn 0;\n}\n",ACCEPTED,2,204
1591120243332808704,2b5cb6632c63d42afddd2444d7f2bf98adbdcec9b4ad3da49a684260eebba723,2022-11-12 01:26:42,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int x;\n    printf(\""2022\\n\"");\n}\nreturn 0;\n",COMPILE_ERROR,0,0
1591120467828736000,217f1946625720e554af7294d3599b943eea3b430c0df7aa0c5c70abe9904e56,2022-11-12 01:27:35,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.*;\npublic class Main{\n    public static void main(String[] args){\n        Scanner sc=new Scanner(System.in);\n        int t=sc.nextInt();\n        for(int i=0;i<t;i++){\n            int a=sc.nextInt();\n            System.out.println(6);\n        }\n    }\n},WRONG_ANSWER,235,17136
1591120499285995520,c3ff25cd087ae1424858449a82aca83b7f0722bfd3282b40127822bf22610ce0,2022-11-12 01:27:43,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int m,n;\n    scanf(\""%d\"",&m);\n    while(m>0)\n    {n=getchar();\n    printf(\""6\\n\"");\n     m--;\n\n    }\n    return 0;\n        \n    \n}",WRONG_ANSWER,9,308
1591120559222620160,d0d7b0b753346ba8da319a4bb32af868fdf41e2104a53a3a3d7b5b76c65907fe,2022-11-12 01:27:57,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint i,j,a,b;\n\tscanf(\""%d\"",&i);\n\twhile(i>0){\n\t\tscanf(\""%d\"",&a);\n\t\tif(a==0)\n        printf(\""1\\n\"");\n        else\n        printf(\""6\\n\"");\n\t\ti--;\n\t} \n    return 0;\n}\n\n",ACCEPTED,9,320
1591120585386688512,c3ff25cd087ae1424858449a82aca83b7f0722bfd3282b40127822bf22610ce0,2022-11-12 01:28:03,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int m,n;\n    scanf(\""%d\"",&m);\n    while(m>0)\n    {n=getchar();\n    printf(\""6\\n\"");\n     m--;\n\n    }\n    return 0;\n        \n    \n}",WRONG_ANSWER,10,312
1591120656522088448,e0ad880549bf3b7847204a80a93841fe1f47e1fb8bc464088cb521848107cfde,2022-11-12 01:28:20,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int A,B,C,result;\n    scanf(\""%d%d%d\"",&A,&B,&C);\n    0<=A<=100;\n    0<=B<=100;\n    0<=C<=100;\n    result=A+B-C;\n    printf(\""%d\"",result);\n}\n\n",ACCEPTED,6,320
1591121101659377664,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-12 01:30:06,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(){\n    int n,i,j;\n    int x=0,y=0;\n\tif(scanf(\""%d\"",&n)){};\n\tint a[n],b[n],c[n];\n\tfor(i=0;i<n;i++)\n\t\tif(scanf(\""%d\"",&a[i])){};\n\tfor(i=0;i<n;i++)\n\t\tif(scanf(\""%d\"",&b[i])){};\n\tfor(i=0;i<n;i++)\n\t\tc[i]=b[i]-a[i];\n\tfor(i=0;i<n;i++){\n\t\tfor(j=i;j<n;j++){\n\t\t\ty+=c[j];\n\t\t\tif(y>x){\n\t\t\t\tx=y;\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\""%d\"",x);\n}",WRONG_ANSWER,2,348
1591121137084469248,7a048784ed2975c30a64787731af1fce175495afd1f4aad852d064d00b6193b9,2022-11-12 01:30:15,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"n=int(input())\na=[]\nfor i in range(2,n+1):\n    for j in range(2,i):\n        if i%j==0:\n            break\n    else:\n         a.append(i)\nprint(len(a))\n",TIME_LIMIT_EXCEEDED,1000,4396
1591121221473861632,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-12 01:30:35,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(){\n    int n,i,j;\n    int x=0,y=0;\n\tif(scanf(\""%d\"",&n)){};\n\tint a[n],b[n],c[n];\n\tfor(i=0;i<n;i++)\n\t\tif(scanf(\""%d\"",&a[i])){};\n\tfor(i=0;i<n;i++)\n\t\tif(scanf(\""%d\"",&b[i])){};\n\tfor(i=0;i<n;i++)\n\t\tc[i]=b[i]-a[i];\n\tfor(i=0;i<n;i++){\n\t\tfor(j=i;j<n;j++){\n\t\t\ty+=c[j];\n\t\t\tif(y>x){\n\t\t\t\tx=y;\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\""%d\\n\"",x);\n}",WRONG_ANSWER,3,308
1591121273822969856,7a048784ed2975c30a64787731af1fce175495afd1f4aad852d064d00b6193b9,2022-11-12 01:30:47,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"n=int(input())\na=[]\nfor i in range(2,n+1):\n    for j in range(2,i):\n        if i%j==0:\n            break\n    else:\n         a.append(i)\nprint(len(a))\n",TIME_LIMIT_EXCEEDED,1000,2996
1591121392756633600,2b5cb6632c63d42afddd2444d7f2bf98adbdcec9b4ad3da49a684260eebba723,2022-11-12 01:31:16,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x=2022;\n    printf(\""Input year:\\n\"");\n    scanf(\""%d,&x\"");\n    printf(\""2022\"")\n    return 0;\n}\n",COMPILE_ERROR,0,0
1591121444447236096,7a048784ed2975c30a64787731af1fce175495afd1f4aad852d064d00b6193b9,2022-11-12 01:31:28,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"n=int(input())\na=[]\nfor i in range(2,n+1):\n    for j in range(2,i-1):\n        if i%j==0:\n            break\n    else:\n         a.append(i)\nprint(len(a))\n",TIME_LIMIT_EXCEEDED,1000,2860
1591121786169765888,2b5cb6632c63d42afddd2444d7f2bf98adbdcec9b4ad3da49a684260eebba723,2022-11-12 01:32:50,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x;\n    printf(\""Input year:\\n\"");\n    scanf(\""%d,&x\"");\n    printf(\""2022\"");\n}\n",WRONG_ANSWER,3,308
1591121790124994560,c3ff25cd087ae1424858449a82aca83b7f0722bfd3282b40127822bf22610ce0,2022-11-12 01:32:51,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int a,b,c,d;\n    scanf(\""%d\\r%d %d %d \"",&a,&b,&c,&d);\n    while(a>0)\n    {\n        printf(\""6\\n\"");\n   \n     a--;\n\n    }\n    return 0;\n        \n    \n}",WRONG_ANSWER,9,316
1591121814309351424,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-12 01:32:56,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(){\n    int n,i,j;\n    int x=0,y=0;\n\tif(scanf(\""%d\"",&n)){};\n\tint a[n],b[n],c[n];\n\tfor(i=0;i<n;i++)\n\t\tif(scanf(\""%d\"",&a[i])){};\n\tfor(i=0;i<n;i++)\n\t\tif(scanf(\""%d\"",&b[i])){};\n\tfor(i=0;i<n;i++)\n\t\tc[i]=b[i]-a[i];\n\tfor(i=0;i<n;i++){\n\t\tfor(j=i;j<n;j++){\n\t\t\ty+=c[j];\n\t\t\tif(y>x){\n\t\t\t\tx=y;\n\t\t\t}\n            y=0;\n\t\t}\n\t}\n\tprintf(\""%d\\n\"",x);\n}",WRONG_ANSWER,3,312
1591122197970751488,356d4d261b0c273ed9edf9a21f22e4b180080ccba0f8bbfa0c58f889e1a800cc,2022-11-12 01:34:28,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\nusing\tnamespace\tstd;\nint\tmain()\n{\n\tint\tN;\n\tcin>>N;\n\tfor(int\ti=0;i<N;i++)\n\t{\n\t\tint\tn=10;\n\t\tint\ta[n];\t\n\t\tint\tx1,x2;\n\t\tcin>>x1;\n\t\tx2=x1%10;\n\t\ta[0]=x2;\n\t\tint\tcount;\n\t\tint\tremain;\n\t\tfor(int\ti=1;;i++)\n\t\t{\n\t\t\ta[i]=(a[i-1]*x2)%10;\n\t\t\tif(a[i]==a[0])\n\t\t\t{\n\t\t\t\tcount=i;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tremain=x1%count;\n\t\tif(remain)\n\t\t\tcout<<a[remain-1]<<endl;\n\t\telse\n\t\t\tcout<<a[count-1]<<endl;\n\t}\n\t\n\t\n}",COMPILE_ERROR,0,0
1591122341109764096,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-12 01:35:02,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(){\n    int n,i,j;\n    int x=0,y=0;\n\tif(scanf(\""%d\"",&n)){};\n\tint a[n],b[n],c[n];\n\tfor(i=0;i<n;i++)\n\t\tif(scanf(\""%d\"",&a[i])){};\n\tfor(i=0;i<n;i++)\n\t\tif(scanf(\""%d\"",&b[i])){};\n\tfor(i=0;i<n;i++)\n\t\tc[i]=b[i]-a[i];\n\tfor(i=0;i<n;i++){\n\t\tfor(j=i;j<n;j++){\n\t\t\ty+=c[j];\n\t\t\tif(y>x){\n\t\t\t\tx+=y;\n\t\t\t}\n            y=0;\n\t\t}\n\t}\n\tprintf(\""%d\\n\"",x);\n}",WRONG_ANSWER,2,184
1591122572488544256,fd2327cbba1ae3f88607a63d7dd76d816a8cbc9b2a2dc0361c3daccf0bdcdf20,2022-11-12 01:35:57,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main(){\n    int n,i,j;\n    int x=0,y=0;\n\tif(scanf(\""%d\"",&n)){};\n\tint a[n],b[n],c[n];\n\tfor(i=0;i<n;i++)\n\t\tif(scanf(\""%d\"",&a[i])){};\n\tfor(i=0;i<n;i++)\n\t\tif(scanf(\""%d\"",&b[i])){};\n\tfor(i=0;i<n;i++)\n\t\tc[i]=b[i]-a[i];\n\tfor(i=0;i<n;i++){\n        y=0;\n\t\tfor(j=i;j<n;j++){\n\t\t\ty+=c[j];\n\t\t\tif(y>x){\n\t\t\t\tx=y;\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\""%d\\n\"",x);\n}",ACCEPTED,2,188
1591122673395105792,2b5cb6632c63d42afddd2444d7f2bf98adbdcec9b4ad3da49a684260eebba723,2022-11-12 01:36:21,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x\n    x=2022;\n    printf(\""2022\"");\n}\n",COMPILE_ERROR,0,0
1591123108709335040,c3ff25cd087ae1424858449a82aca83b7f0722bfd3282b40127822bf22610ce0,2022-11-12 01:38:05,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a;\n    scanf(\""%d\"",&a);\n    while(a>0)\n    {\n    \t\n        printf(\""6\\n\"");\n   \n     a--;\n\n    }\n    return 0;\n        \n    \n}",WRONG_ANSWER,6,328
1591123363630743552,7a048784ed2975c30a64787731af1fce175495afd1f4aad852d064d00b6193b9,2022-11-12 01:39:06,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"n=int(input())\ndef b(num):\n    a=0\n    for i in range(2,num+1):\n        for j in range(2,i-1):\n            if i%j==0:\n                break\n        else:\n            a=a+1\n    print(a)\nb(n)\n",TIME_LIMIT_EXCEEDED,1000,2996
1591123887277019136,356d4d261b0c273ed9edf9a21f22e4b180080ccba0f8bbfa0c58f889e1a800cc,2022-11-12 01:41:11,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"nt main()\n\n{\n\nint m,m2,n2,n,a,b,c,d;\n\nscanf(\""%d%d\"",&m,&n);\n\nscanf(\""%d%d\"",&m2,&n2);\n\na=pow(m,n);\n\nb=pow(m2,n2);\n\nc=a%10;\n\nd=b%10;\n\nprintf(\""%d\\n%d\"",c,d);\n\nreturn 0;\n\n}",COMPILE_ERROR,0,0
1591124644499886080,27fbb32d960dbf49665c8905b68012d602eda68987686c6f224ec7b49ca3d0ac,2022-11-12 01:44:11,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint js(int a)\n{\n    a=a%10;\n    return a;\n}\nint main()\n{\n    int n,i,sum;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n        b[i]=pow(6,a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n    \t\n        sum=js(b[i]);\n        printf(\""%d\\n\"",sum);\n    }\n    return 0;\n}",WRONG_ANSWER,4,200
1591125023023235072,27fbb32d960dbf49665c8905b68012d602eda68987686c6f224ec7b49ca3d0ac,2022-11-12 01:45:41,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint js(int a)\n{\n    a=a%10;\n    return a;\n}\nint main()\n{\n    int n,i,sum;\n    scanf(\""%d\"",&n);\n    long long a[n],b[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n        b[i]=pow(6,a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n    \t\n        sum=js(b[i]);\n        printf(\""%d\\n\"",sum);\n    }\n    return 0;\n}",WRONG_ANSWER,2,324
1591125098919165952,20ffd83467b553ac24e1f4b8b096d58858684ca8c3f6a4d5a62be9ff7c4817da,2022-11-12 01:45:59,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n#define MAX 1000\nint main()\n{\n    int n,i,j,t=1;\n    int a[MAX],b[MAX],c[MAX];\n    int p=0,m=0;\n    \n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++){\n    scanf(\""%d\"",&a[i]);\n    }\n    for(i=1;i<=n;i++){\n    scanf(\""%d\"",&b[i]);\n    }\n    for(i=1;i<=n;i++)\n    c[i]=b[i]-a[i];\n    \n    for(i=1;i<=n;i++){\n    for(j=i;j<=n;j++){\n    p=p+c[j];\n    if(p>m)\n    m=p;\n    }\n    p=0;\n    }\n    printf(\""%d\\n\"",m);\n}",ACCEPTED,2,312
1591125099384713216,356d4d261b0c273ed9edf9a21f22e4b180080ccba0f8bbfa0c58f889e1a800cc,2022-11-12 01:46:00,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<conio.h>\nint main( )\n{   \n    int i,j,a,b;\n    int isprime = 0;\n    int cot = 0；\n    printf(\""请输入两个数：\\n\"");\n    scanf(\""%d %d\"",&a,&b);\n    if (a == 1 || a <= 0){a = 2;}\n    for ( i = a; i < b; i++)\n    {   \n        isprime = 1;\n        for ( j = 2; j <= i - 1; j++)\n        {\n            if (i % j == 0){isprime = 0;break;}\n            if (i % j != 0){isprime = 1;}\n        }\n        if (isprime == 1)\n        {\n            printf(\""%d\\t\"",i);\n            cot++;//计数\n        }\n    }\n    printf(\""\\n在%d到%d中一共有个%d素数，他们的和为%d\"",a,b,cot);\n    getch();\n    return 0;\n}\n\n\n\n",COMPILE_ERROR,0,0
1591125249393995776,27fbb32d960dbf49665c8905b68012d602eda68987686c6f224ec7b49ca3d0ac,2022-11-12 01:46:35,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint js(int a)\n{\n    a=a%10;\n    return a;\n}\nint main()\n{\n    long long n;\n    int i,sum;\n    scanf(\""%d\"",&n);\n    long long a[n],b[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n        b[i]=pow(6,a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n    \t\n        sum=js(b[i]);\n        printf(\""%d\\n\"",sum);\n    }\n    return 0;\n}",RUNTIME_ERROR,2,456
1591125287725764608,356d4d261b0c273ed9edf9a21f22e4b180080ccba0f8bbfa0c58f889e1a800cc,2022-11-12 01:46:44,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"import java.util.*;\npublic class Main {\n        public static void main(String[] args) {\n            Scanner sc = new Scanner(System.in);\n            while(sc.hasNext()){\n                int n = sc.nextInt();\n                int c = sc.nextInt();\n \n                for(int j =0;j<n;j++){\n                    int b = sc.nextInt();\n                    if(b <= c){\n                        c += b;\n                    }else{\n                        int tmp = hightestCommon(b,c);\n                        c += tmp;\n                    }\n                }\n \n                System.out.println(c);\n            }\n        }\n        public static int hightestCommon(int b,int c){\n            if(c==0){\n                return b;\n            }\n \n            return hightestCommon(c,b%c);\n        }\n}",COMPILE_ERROR,0,0
1591125633441271808,27fbb32d960dbf49665c8905b68012d602eda68987686c6f224ec7b49ca3d0ac,2022-11-12 01:48:07,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint js(int a)\n{\n    a=a%10;\n    return a;\n}\nint main()\n{\n    long int n,i,sum;\n    scanf(\""%d\"",&n);\n    long int a[n],b[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n        b[i]=pow(6,a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n    \t\n        sum=js(b[i]);\n        printf(\""%d\\n\"",sum);\n    }\n    return 0;\n}",RUNTIME_ERROR,2,440
1591126633895997440,27fbb32d960dbf49665c8905b68012d602eda68987686c6f224ec7b49ca3d0ac,2022-11-12 01:52:05,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint js(int a)\n{\n    a=a%10;\n    return a;\n}\nint main()\n{\n    long int n,i,sum;\n    scanf(\""%d\"",&n);\n    long int a[n],b[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n        b[i]=pow(6,a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n    \t\n        sum=js(b[i]);\n        printf(\""%d\\n\"",sum);\n    }\n    return 0;\n}",RUNTIME_ERROR,3,444
1591128931661582336,356d4d261b0c273ed9edf9a21f22e4b180080ccba0f8bbfa0c58f889e1a800cc,2022-11-12 02:01:13,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int m,i,j,k,n=0,flag=1;\n    scanf(\""%d\"",&m);\n    for(i=2;i<=m;i++)\n    {\n        k=sqrt(i);\n        for(j=2;j<=k;j++)\n            if(i%j==0)\n                break;\n        if(j>k)\n            n++;\n    }\n    printf(\""%d\"",n);\n    return 0;\n}#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int m,i,j,k,n=0,flag=1;\n    scanf(\""%d\"",&m);\n    for(i=2;i<=m;i++)\n    {\n        k=sqrt(i);\n        for(j=2;j<=k;j++)\n            if(i%j==0)\n                break;\n        if(j>k)\n            n++;\n    }\n    printf(\""%d\"",n);\n    return 0;\n}\n\n\n\n\n",COMPILE_ERROR,0,0
1591129263514914816,2b5cb6632c63d42afddd2444d7f2bf98adbdcec9b4ad3da49a684260eebba723,2022-11-12 02:02:32,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int x;\n    scanf(\""%4d\"",&x);\n    printf(\""year=%4d\\n\"",x);\n}\n",WRONG_ANSWER,2,316
1591129613324038144,356d4d261b0c273ed9edf9a21f22e4b180080ccba0f8bbfa0c58f889e1a800cc,2022-11-12 02:03:56,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int i,n,t,y;\n    scanf(\""%d\\n\"",&t);\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&n);\n        if(n==0)\n            y=1;\n        else\n            y=6;\n            printf(\""%d\\n\"",y);\n    }\nreturn 0;\n}\n",ACCEPTED,6,196
1591130695991341056,c3ff25cd087ae1424858449a82aca83b7f0722bfd3282b40127822bf22610ce0,2022-11-12 02:08:14,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint n,i,j,q;\n\tq=0;\n\tscanf(\""%d\"",&n);\n\tfor(i=2;i<=n;i++)\n\t{\n\t\tfor(j=2;j<i;j++)\n\t\t{\n\t\t\tif(i%j==0)\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(j==i)\n\t\t{\n\t\t\tq++;\n\n\t\t}\n\t}\n\tprintf(\""%d\\n\"",q);\n    return 0;\n}\n",ACCEPTED,902,348
1591131655891386368,2b5cb6632c63d42afddd2444d7f2bf98adbdcec9b4ad3da49a684260eebba723,2022-11-12 02:12:03,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main(void)\n{\n    int year;\n    printf(\""今年是哪一年呢:\\n\"");\n    scanf(\""%d\"",&year);\n}\n    printf(\""%d\"",year);",COMPILE_ERROR,0,0
1591131737588019200,c3ff25cd087ae1424858449a82aca83b7f0722bfd3282b40127822bf22610ce0,2022-11-12 02:12:22,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""25\"");\n    return 0;\n}",WRONG_ANSWER,3,308
1591131950780321792,2b5cb6632c63d42afddd2444d7f2bf98adbdcec9b4ad3da49a684260eebba723,2022-11-12 02:13:13,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main(){\n    printf(\""2022\"");\n}",ACCEPTED,2,204
1591133651998388224,80bb854046efddc8db8117414c5ff582f99d3347454c32f734c77c16dc462ed6,2022-11-12 02:19:59,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int n,i,j,count=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<n;i++)\n    {\n        for(j=2;j<=sqrt(i);j++)\n        {\n            if(i%j==0)\n                break;\n        }\n            if(j>sqrt(i))\n            {\n                count++;\n                printf(\""%d\\n\"",i);\n                if(count%5==0)\n                    printf(\""\\n\"");\n            }\n    }\n\n    return 0;\n}\n\n\n\n",WRONG_ANSWER,11,444
1591133992408121344,27fbb32d960dbf49665c8905b68012d602eda68987686c6f224ec7b49ca3d0ac,2022-11-12 02:21:20,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint js(int a)\n{\n    a=a%10;\n    return a;\n}\nint main()\n{\n    long int n,i,sum;\n    scanf(\""%d\"",&n);\n    long int a[n],b[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n        b[i]=pow(6,a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n    \t\n        sum=js(b[i]);\n        printf(\""%d\\n\"",sum);\n    }\n    return 0;\n}",TIME_LIMIT_EXCEEDED,3,328
1591134344687693824,27fbb32d960dbf49665c8905b68012d602eda68987686c6f224ec7b49ca3d0ac,2022-11-12 02:22:44,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint js(int a)\n{\n    a=a%10;\n    return a;\n}\nint main()\n{\n    long int n,i,sum;\n    scanf(\""%ld\"",&n);\n    long int a[n],b[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%ld\"",&a[i]);\n        b[i]=pow(6,a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n    \t\n        sum=js(b[i]);\n        printf(\""%d\\n\"",sum);\n    }\n    return 0;\n}",WRONG_ANSWER,6,308
1591135452608901120,27fbb32d960dbf49665c8905b68012d602eda68987686c6f224ec7b49ca3d0ac,2022-11-12 02:27:08,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint js(long int a)\n{\n    a=a%10;\n    return a;\n}\nint main()\n{\n    long int n,i,sum;\n    (void) scanf(\""%ld\"",&n);\n    long int a[n],b[n];\n    for(i=0;i<n;i++)\n    {\n        (void) scanf(\""%ld\"",&a[i]);\n        b[i]=pow(6,a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n    \t\n        sum=js(b[i]);\n        printf(\""%ld\\n\"",sum);\n    }\n    return 0;\n}",WRONG_ANSWER,4,348
1591136214860763136,27fbb32d960dbf49665c8905b68012d602eda68987686c6f224ec7b49ca3d0ac,2022-11-12 02:30:10,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint js(long int a)\n{\n    a=a%10;\n    return a;\n}\nint main()\n{\n    long int n,i,sum;\n    (void)scanf(\""%ld\"",&n);\n    long int a[n],b[n];\n    for(i=0;i<n;i++)\n    {\n        (void)scanf(\""%ld\"",&a[i]);\n        b[i]=pow(6,a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n    \t\n        sum=js(b[i]);\n        printf(\""%ld\\n\"",sum);\n    }\n    return 0;\n}",WRONG_ANSWER,5,320
1591137555389677568,2b5cb6632c63d42afddd2444d7f2bf98adbdcec9b4ad3da49a684260eebba723,2022-11-12 02:35:29,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int X=8;\n    int Y=7;\n    int Z=3;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    while(0<=A,B,C<=100){\n    printf(\""X+Y-Z\"")  \n    }\n}",COMPILE_ERROR,0,0
1591137646980694016,27fbb32d960dbf49665c8905b68012d602eda68987686c6f224ec7b49ca3d0ac,2022-11-12 02:35:51,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint js(long int a)\n{\n    a=a%10;\n    return a;\n}\nint main()\n{\n    long double n,i,sum;\n    (void)scanf(\""%ld\"",&n);\n    long double a[n],b[n];\n    for(i=0;i<n;i++)\n    {\n        (void)scanf(\""%ld\"",&a[i]);\n        b[i]=pow(6,a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n    \t\n        sum=js(b[i]);\n        printf(\""%ld\\n\"",sum);\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1591137822348738560,27fbb32d960dbf49665c8905b68012d602eda68987686c6f224ec7b49ca3d0ac,2022-11-12 02:36:33,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint js(long double a)\n{\n    a=a%10;\n    return a;\n}\nint main()\n{\n    long double n;\n    int i,sum；\n    (void)scanf(\""%ld\"",&n);\n    long double a[n],b[n];\n    for(i=0;i<n;i++)\n    {\n        (void)scanf(\""%ld\"",&a[i]);\n        b[i]=pow(6,a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n    \t\n        sum=js(b[i]);\n        printf(\""%ld\\n\"",sum);\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1591138108266033152,2b5cb6632c63d42afddd2444d7f2bf98adbdcec9b4ad3da49a684260eebba723,2022-11-12 02:37:41,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int X,Y,Z;\n    while(0<=A,B,C<=100){\n    X=8;\n    Y=7;\n    Z=3;\n    printf(\""X+Y-Z\"")  \n    }\n}",COMPILE_ERROR,0,0
1591140156948656128,80bb854046efddc8db8117414c5ff582f99d3347454c32f734c77c16dc462ed6,2022-11-12 02:45:50,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<cstdio>\n#include<iostream>\n#include<algorithm>\nusing namespace std;\nstruct mon\n{\n int x;\n int y;\n};\nbool cmp(mon a,mon b)\n{\n if(a.x<b.x)\n  return true;\n else if(a.x==b.x&&a.y>b.y)\n  return true;\n return false;\n}\nint main()\n{\n int s,n;\n while(scanf(\""%d%d\"",&s,&n)!=EOF)\n {\n  mon m[1010];\n  int i;\n  for(i=0;i<n;i++)\n   scanf(\""%d%d\"",&m[i].x,&m[i].y);\n  sort(m,m+n,cmp);\n  for(i=0;i<n;i++)\n  {\n   if(s>m[i].x)\n    s+=m[i].y;\n   else\n    break;\n  }\n  printf(\""%d\\n\"");\n }\n return 0;\n}\n",COMPILE_ERROR,0,0
1591140833024323584,423e1acd0d02cf3d43f3c7805099dea4edcb39c2e0fa385e82823b5a7c0dd214,2022-11-12 02:48:31,C++,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main()\n{\nint n,i,j,k,f;\nint cnt=0;\ncin>>n;\nfor(i=2;i<=n;i++)\n{\n    f=1;\n   for(j=2;j<=i-1;j++) //这里从j=2开始，因为1是每个整数的因子\n  {\n      k=i%j;\n     if(k==0){\n       f=0;\n       break;\n              }\n   }\n    if(f)\n        cnt++;\n}\n    cout<<cnt<<endl;\nreturn 0;\n}",ACCEPTED,907,440
1591140890763132928,2b5cb6632c63d42afddd2444d7f2bf98adbdcec9b4ad3da49a684260eebba723,2022-11-12 02:48:44,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int X;\n    int Y;\n    int Z;\n    scanf(\""%d\"",&X);\n    scanf(\""%d\"",&Y);\n    scanf(\""%d\"",&Z);\n    printf(\""X+Y-Z=12\"");\n}",WRONG_ANSWER,3,312
1591141245286682624,2b5cb6632c63d42afddd2444d7f2bf98adbdcec9b4ad3da49a684260eebba723,2022-11-12 02:50:09,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int X;\n    X=8;\n    int Y;\n    Y=7;\n    int Z;\n    Z=3\n    scanf(\""%d\"",&X);\n    scanf(\""%d\"",&Y);\n    scanf(\""%d\"",&Z);\n    printf(\""X+Y-Z=12\"");\n}",COMPILE_ERROR,0,0
1591143156291276800,2b5cb6632c63d42afddd2444d7f2bf98adbdcec9b4ad3da49a684260eebba723,2022-11-12 02:57:45,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int i;\n    scanf(\""%d\"",&i);\n    int X=8;\n    int Y=7;\n    int Z=3;\n    printf(\""i=X+Y-Z\\n\"",i);\n}",WRONG_ANSWER,2,328
1591143356330213376,2b5cb6632c63d42afddd2444d7f2bf98adbdcec9b4ad3da49a684260eebba723,2022-11-12 02:58:32,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int i;\n    scanf(\""%d\"",&i);\n    printf(\""i=X+Y-Z\\n\"",i);\n}",WRONG_ANSWER,2,312
1591144569624899584,80bb854046efddc8db8117414c5ff582f99d3347454c32f734c77c16dc462ed6,2022-11-12 03:03:22,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int n,a;\n    scanf(\""%d\"",&n);\n    while(n--)\n    {\n        scanf(\""%d\"", &a);\n        printf(\""%d\"", (int)pow(6,a) % 10);\n        if(n>0)\n        {\n            printf(\""\\n\"");\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,4,200
1591145097482272768,80bb854046efddc8db8117414c5ff582f99d3347454c32f734c77c16dc462ed6,2022-11-12 03:05:27,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int i,j,k,num;\n    scanf(\""%d%d%d\"",i,j,k);\n    if(k>=0&&k<=100)\n    {\n       num= i+j-k;\n       printf(\""%d\\n\"",num);\n    }\n\n    return 0;\n}\n\n\n    return 0;\n}\n",COMPILE_ERROR,0,0
1591145763122491392,2b5cb6632c63d42afddd2444d7f2bf98adbdcec9b4ad3da49a684260eebba723,2022-11-12 03:08:06,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nvoid main()\n{\n    int X,Y,Z;\n    X=8;\n    Y=7;\n    Z=3;\n    i=X+Y-Z;\n    printf(\""i=%d\"",i);\n}",COMPILE_ERROR,0,0
1591146001212178432,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 03:09:03,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<bits/stdc++.h>using namespace std;int-main(\n{\nint n,a;cin>>n;\nfor(int i=1;is=n;i++){\ncin>>a;\n----- ---if(a==0)printf(\""1\"");\n-------eLse-printf(\""6\"");\nif(i!=n)printf(\""\\n\"");\n}\nreturn-0;\n}\n",COMPILE_ERROR,0,0
1591147114741170176,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 03:13:28,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n   int n,a;\n    cin>>n;\n    for(int i=1;i<=n;i++)\n  {\n  cin>>a;\n----- ---if(a==0)printf(\""1\"");\n-------else-printf(\""6\"");\nif(i!=n)printf(\""\\n\"");\n}\nreturn-0;\n}\n",COMPILE_ERROR,0,0
1591147251827781632,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 03:14:01,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n   int n,a;\n    cin>>n;\n    for(int i=1;i<=n;i++)\n  {\n  cin>>a;\n     (a==0)printf(\""1\"");\n     else printf(\""6\"");\nif(i!=n)printf(\""\\n\"");\n}\nreturn 0;\n}\n",COMPILE_ERROR,0,0
1591147392425046016,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 03:14:35,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n   int n,a;\n    cin>>n;\n    for(int i=1;i<=n;i++)\n  {\n  cin>>a;\n     (a==0)printf(\""1\"");\n     else printf(\""6\"");\nif(i!=n)printf(\""\\n\"");\n}\nreturn 0;\n}\n",COMPILE_ERROR,0,0
1591147452114186240,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 03:14:49,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n   int n,a;\n    cin>>n;\n    for(int i=1;i<=n;i++)\n  {\n  cin>>a;\n     (a==0)printf(\""1\"");\n     else printf(\""6\"");\n   if(i!=n)printf(\""\\n\"");\n}\nreturn 0;\n}\n",COMPILE_ERROR,0,0
1591147997403086848,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 03:16:59,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n   int n,a;\n    cin>>n;\n    for(int i=1;i<=n;i++)\n  {\n  cin>>a;\n     if(a==0)printf(\""1\"");\n     else printf(\""6\"");\n   if(i!=n)printf(\""\\n\"");\n}\nreturn 0;\n}\n",ACCEPTED,12,460
1591148788922757120,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 03:20:08,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint-main()\n{\nint n , sum=0, max=0;cin>>n;\nint a[n], b[n],c[n];for(int i=1;i<=n;i++){\ncin>>a[i];\n}\nfor(int i=1; i<=n;i++){\ncin>>b[i];\n}\nfor(int i=1;i<=n;i++)\n{\nc[i]=b[i]-a[i];\n}\nfor(int-i=1;i<=n;i++){\nsum=sum+c[i];\nif(sum>max) max=sum;if(sum<0);\nsum=0;\n}\nprintf(\""%d\"",max);return 0;\n}\n",COMPILE_ERROR,0,0
1591149128476856320,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 03:21:29,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\nint n , sum=0, max=0;cin>>n;\nint a[n], b[n],c[n];for(int i=1;i<=n;i++){\ncin>>a[i];\n}\nfor(int i=1; i<=n;i++){\ncin>>b[i];\n}\nfor(int i=1;i<=n;i++)\n{\nc[i]=b[i]-a[i];\n}\nfor(int i=1;i<=n;i++)\n    {\nsum=sum+c[i];\nif(sum>max) max=sum;if(sum<0);\nsum=0;\n}\nprintf(\""%d\"",max);return 0;\n}\n",WRONG_ANSWER,3,444
1591149332991115264,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 03:22:17,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\nint n , sum=0, max=0;cin>>n;\nint a[n], b[n],c[n];for(int i=1;i<=n;i++){\ncin>>a[i];\n}\nfor(int i=1; i<=n;i++){\ncin>>b[i];\n}\nfor(int i=1;i<=n;i++)\n{\nc[i]=b[i]-a[i];\n}\nfor(int i=1;i<=n;i++)\n    {\nsum=sum+c[i];\nif(sum>max) max=sum;if(sum<0);\nsum=0;\n}\nprintf(\""%d\"",max);\nreturn 0;\n}",WRONG_ANSWER,3,308
1591150269012967424,80bb854046efddc8db8117414c5ff582f99d3347454c32f734c77c16dc462ed6,2022-11-12 03:26:00,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int X,Y,Z,S;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n   S＝X+Y-Z；\n       printf(\""%d\\n\"",S);\n   return 0;\n}\n",COMPILE_ERROR,0,0
1591150280769605632,f32bbf1e2d22c3d5fc38a9d1d6bb2e7b93ccd582f667d73d4e37180fad43823b,2022-11-12 03:26:03,C++,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\nint n , sum=0, max=0;cin>>n;\nint a[n], b[n],c[n];for(int i=1;i<=n;i++){\ncin>>a[i];\n}\nfor(int i=1; i<=n;i++){\ncin>>b[i];\n}\nfor(int i=1;i<=n;i++)\n{\nc[i]=b[i]-a[i];\n}\nfor(int i=1;i<=n;i++)\n    {\nsum=sum+c[i];\nif(sum>max) max=sum;if(sum<0)\nsum=0;\n}\nprintf(\""%d\"",max);\nreturn 0;\n}",ACCEPTED,4,564
1591151450544214016,2b5cb6632c63d42afddd2444d7f2bf98adbdcec9b4ad3da49a684260eebba723,2022-11-12 03:30:42,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{ \n    int X,Y,Z,i;\n    printf(\""X=8,Y=7,Z=3\\n\"");\n    scanf(\""%d,%d,%d\"",&X,&Y,&Z);\n    i=X+Y-Z;\n    printf(\""i=%d\"",i);\n    return 0;    \n}\n    ",WRONG_ANSWER,3,180
1591151637572399104,2b5cb6632c63d42afddd2444d7f2bf98adbdcec9b4ad3da49a684260eebba723,2022-11-12 03:31:27,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{ \n    int X,Y,Z,i;\n    printf(\""X=8,Y=7,Z=3\\n\"");\n    scanf(\""%d,%d,%d\"",&X,&Y,&Z);\n    i=X+Y-Z;\n    printf(\""i=%d\"",i);    \n}\n    ",WRONG_ANSWER,2,184
1591153531325841408,2b5cb6632c63d42afddd2444d7f2bf98adbdcec9b4ad3da49a684260eebba723,2022-11-12 03:38:58,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int X,Y,Z;\n    printf(\""X+Y-Z\"");\n}",WRONG_ANSWER,3,332
1591226523342929920,1d5ac1674206114dbc3c7883f7305e131f037b2aefcb3b297d62e80957fc1452,2022-11-12 08:29:01,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <time.h>\nint main()\n{\n    \n    printf(\""%d\"",2022);\n}",ACCEPTED,2,196
1591226596650979328,1d5ac1674206114dbc3c7883f7305e131f037b2aefcb3b297d62e80957fc1452,2022-11-12 08:29:18,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    printf(\""%d\"",2022);\n}",ACCEPTED,3,308
1591227311876280320,1d5ac1674206114dbc3c7883f7305e131f037b2aefcb3b297d62e80957fc1452,2022-11-12 08:32:09,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n}",ACCEPTED,6,188
1591228117031653376,739b1156eb9238db78ec0a88314ad93c72ab0c7fc7ecc0396c0a3fa3997af557,2022-11-12 08:35:21,Python,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"n = int(input())\nxh = list(map(eval,input().split()))\nhd = list(map(eval,input().split()))\ndata=[]\nmax=0\nfor i in range(n):\n    s = hd[i]-xh[i]\n    data.append(s)\nfor i in range(n):\n    t=0\n    for j in range(i,n,1):\n        t =t+ data[j]\n        if t>max:\n            max = t\nprint(max)",ACCEPTED,14,2756
1591229269777362944,950b2713b447943280c6052f88160e7298bd0ba94c14d628bbdd70df720305b5,2022-11-12 08:39:56,Python,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"n = int(input())\n\nxh = list(map(eval,input().split()))\n\nhd = list(map(eval,input().split()))\n\ndata=[]\n\nmax=0\n\nfor i in range(n):\n\n    s = hd[i]-xh[i]\n\n    data.append(s)\n\nfor i in range(n):\n\n    t=0\n\n    for j in range(i,n,1):\n\n        t =t+ data[j]\n\n        if t>max:\n\n            max = t\n\nprint(max)",ACCEPTED,16,2752
1591229313427509248,958c7c2b659bf7ed617a82cd0cf9adf876a6f164ed5327aaa53afbb4e117d40d,2022-11-12 08:40:06,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"n = int(input())\nxh = list(map(eval,input().split()))\nhd = list(map(eval,input().split()))\ndata=[]\nmax=0\nfor i in range(n):\n    s = hd[i]-xh[i]\n    data.append(s)\nfor i in range(n):\n    t=0\n    for j in range(i,n,1):\n        t =t+ data[j]\n        if t>max:\n            max = t\nprint(max)",COMPILE_ERROR,0,0
1591229344352112640,81f258582663b08bc9b4d77bba77afc3b463021ec8fb2262453de07687484cd5,2022-11-12 08:40:13,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"n = int(input())\nxh = list(map(eval,input().split()))\nhd = list(map(eval,input().split()))\ndata=[]\nmax=0\nfor i in range(n):\n    s = hd[i]-xh[i]\n    data.append(s)\nfor i in range(n):\n    t=0\n    for j in range(i,n,1):\n        t =t+ data[j]\n        if t>max:\n            max = t\nprint(max)",COMPILE_ERROR,0,0
1591229357840994304,958c7c2b659bf7ed617a82cd0cf9adf876a6f164ed5327aaa53afbb4e117d40d,2022-11-12 08:40:17,Python,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"n = int(input())\nxh = list(map(eval,input().split()))\nhd = list(map(eval,input().split()))\ndata=[]\nmax=0\nfor i in range(n):\n    s = hd[i]-xh[i]\n    data.append(s)\nfor i in range(n):\n    t=0\n    for j in range(i,n,1):\n        t =t+ data[j]\n        if t>max:\n            max = t\nprint(max)",ACCEPTED,15,2744
1591229383443001344,81f258582663b08bc9b4d77bba77afc3b463021ec8fb2262453de07687484cd5,2022-11-12 08:40:23,Python,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"n = int(input())\nxh = list(map(eval,input().split()))\nhd = list(map(eval,input().split()))\ndata=[]\nmax=0\nfor i in range(n):\n    s = hd[i]-xh[i]\n    data.append(s)\nfor i in range(n):\n    t=0\n    for j in range(i,n,1):\n        t =t+ data[j]\n        if t>max:\n            max = t\nprint(max)",ACCEPTED,15,2876
1591230914535927808,1d5ac1674206114dbc3c7883f7305e131f037b2aefcb3b297d62e80957fc1452,2022-11-12 08:46:28,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t,n,result;\n    scanf(\""%d\"",&t);\n    for(int i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&n);\n        result=pow(6,n);\n        printf(\""%d\\n\"",result%10);\n    }\n}",WRONG_ANSWER,6,324
1591231031557033984,834ba62d861cf2d94a81f3b034a55b21f1378d4337b6b065c321d7da6bf82e17,2022-11-12 08:46:56,Python,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"n = int(input())\nls1 = list(map(int,input().split()))\nls2 = list(map(int,input().split()))\nls3 = [(ls2[i]-ls1[i]) for i in range(0, n)]\nmax_p = 0\na = 0\nwhile a < n:\n    p = 0\n    for i in range(a, n):\n        p += ls3[i]\n        if max_p < p:\n            max_p = p\n    a+=1\nprint(max_p)\n",ACCEPTED,14,2748
1591231941335101440,f381315623b36dc3fd81657c5781d182db898c508f7f4cdcb1d942e8610b5d79,2022-11-12 08:50:33,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"public class aaaa {\npublic static void main(String[] args) {\n System.out.println(\""2022\"");\n}",COMPILE_ERROR,0,0
1591232340511227904,f381315623b36dc3fd81657c5781d182db898c508f7f4cdcb1d942e8610b5d79,2022-11-12 08:52:08,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"package aaa;\n\npublic class aaaa {\npublic static void main(String[] args) {\n\tSystem.out.println(\""2022\"");\n}\n}",COMPILE_ERROR,0,0
1591232712378200064,f381315623b36dc3fd81657c5781d182db898c508f7f4cdcb1d942e8610b5d79,2022-11-12 08:53:36,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stido.h>\nint main() {\n printf(\""2022\"");\n}",COMPILE_ERROR,0,0
1591232771517886464,f381315623b36dc3fd81657c5781d182db898c508f7f4cdcb1d942e8610b5d79,2022-11-12 08:53:51,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stido.h>\nint main() {\n printf(\""2022\"");\n}",COMPILE_ERROR,0,0
1591232862924378112,f381315623b36dc3fd81657c5781d182db898c508f7f4cdcb1d942e8610b5d79,2022-11-12 08:54:12,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stido.h>\nint main(){\n printf(\""2022\"");\n}",COMPILE_ERROR,0,0
1591232964044853248,f381315623b36dc3fd81657c5781d182db898c508f7f4cdcb1d942e8610b5d79,2022-11-12 08:54:36,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stido.h>\nint main(){\n    printf(\""2022\"");\n}",COMPILE_ERROR,0,0
1591233074896113664,f381315623b36dc3fd81657c5781d182db898c508f7f4cdcb1d942e8610b5d79,2022-11-12 08:55:03,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"public class aaaa {\npublic static void main(String[] args) {\n\tSystem.out.println(\""2022\"");\n}",COMPILE_ERROR,0,0
1591233762631921664,f381315623b36dc3fd81657c5781d182db898c508f7f4cdcb1d942e8610b5d79,2022-11-12 08:57:47,Java,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"package aaa;\nimport java.util.Scanner;\npublic class aaaa {\npublic static void main(String[] args) {\n\t\n\t  Scanner sc = new Scanner(System.in);\n\t  \n\t  System.out.println(\""请输入一个整数X：\"");\n\t  int X= sc.nextInt();\n\t System.out.println(\""请输入一个整数Y：\"");\n\t   int Y= sc.nextInt();\n\t System.out.println(\""请输入一个整数Z：\"");\n\t  int Z= sc.nextInt();\n\t  System.out.println(X+Y-Z);\t \n\t}\n}",COMPILE_ERROR,0,0
1591234294490664960,f381315623b36dc3fd81657c5781d182db898c508f7f4cdcb1d942e8610b5d79,2022-11-12 08:59:54,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"System.out.println(\""2022\"");",COMPILE_ERROR,0,0
1591234813812584448,1d5ac1674206114dbc3c7883f7305e131f037b2aefcb3b297d62e80957fc1452,2022-11-12 09:01:57,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t,n,result=1,end;\n    scanf(\""%d\"",&t);\n    for(int i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&n);\n        if(n==0)\n        {\n            end=1;\n        }\n        else\n        {\n            for(int j=2;j<n;j++)\n            {\n                result*=6;\n            }\n            end=result%10;\n        }\n        printf(\""%d\\n\"",end);\n    }\n}",WRONG_ANSWER,3,340
1591235642066014208,f381315623b36dc3fd81657c5781d182db898c508f7f4cdcb1d942e8610b5d79,2022-11-12 09:05:15,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"package aaa;\npuublic class aaa{\n    public static void main(String[] args){\n        System.out.println(\""2022\"")\n    }\n}",COMPILE_ERROR,0,0
1591235765340803072,f381315623b36dc3fd81657c5781d182db898c508f7f4cdcb1d942e8610b5d79,2022-11-12 09:05:44,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"package aaa;\npuublic class expected{\n    public static void main(String[] args){\n        System.out.println(\""2022\"")\n    }\n}",COMPILE_ERROR,0,0
1591237389488558080,8d1179920d906e72e4154239cf795c881b2870d2672de88a3bf7524682292a30,2022-11-12 09:12:12,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,3,308
1591237772042633216,f381315623b36dc3fd81657c5781d182db898c508f7f4cdcb1d942e8610b5d79,2022-11-12 09:13:43,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"puublic class Main{\n    public static void main(String[] args){\n        System.out.println(\""2022\"");\n    }\n}",COMPILE_ERROR,0,0
1591238019506548736,f381315623b36dc3fd81657c5781d182db898c508f7f4cdcb1d942e8610b5d79,2022-11-12 09:14:42,Java,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"puublic class Main{\n    public static void main(String[] args){\n        System.out.println(\""2022\"");\n        retuen 0；\n    }\n}",COMPILE_ERROR,0,0
1591238130357833728,8d1179920d906e72e4154239cf795c881b2870d2672de88a3bf7524682292a30,2022-11-12 09:15:08,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int X,Y,Z,A;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    A=X+Y-Z;\n    printf(\""%d\"",A);\n    return 0;\n}",ACCEPTED,4,312
1591238250142961664,f381315623b36dc3fd81657c5781d182db898c508f7f4cdcb1d942e8610b5d79,2022-11-12 09:15:37,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stido.h>\nint main() {\n    printf(\""2022\"");\n    return 0;\n}",COMPILE_ERROR,0,0
1591238555257606144,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-12 09:16:50,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int c,b,i;\n   int t;\n    scanf(\""%d\"",&t);\n    int  a[t];\n    for(i=1;i<=t;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=1;i<=t;i++)\n    {\n        c=pow(6,a[i]);\n        b=c%10;\n        printf(\""%d\\n\"",b);\n    }\n    \n}",WRONG_ANSWER,7,308
1591238647947505664,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-12 09:17:12,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int c,b,i;\n   int t;\n    scanf(\""%d\"",&t);\n    int  a[t];\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<t;i++)\n    {\n        c=pow(6,a[i]);\n        b=c%10;\n        printf(\""%d\\n\"",b);\n    }\n    \n}",WRONG_ANSWER,6,308
1591240679567724544,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-12 09:25:16,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i=0,max=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c;\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d \"",&a[i]);\n        scanf(\""%d \"",&b[i]);\n        if(b[i]-a[i]<0)\n        {\n            max=i;\n        }\n        \n    }\n    for(i=0;i<max;i++)\n    {\n        c=b[i]-a[i];\n    }\n    printf(\""%d\"",c);\n}",WRONG_ANSWER,2,196
1591241219496284160,8d1179920d906e72e4154239cf795c881b2870d2672de88a3bf7524682292a30,2022-11-12 09:27:25,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int t,i,j,a[t-1];\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<t;i++)\n        printf(\""6\\n\"");\n    return 0;\n}",WRONG_ANSWER,6,316
1591241471062249472,8d1179920d906e72e4154239cf795c881b2870d2672de88a3bf7524682292a30,2022-11-12 09:28:25,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int t,i,j,a[t-1];\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<t;i++)\n        printf(\""6\\n\"");\n    return 0;\n}",WRONG_ANSWER,7,312
1591242666531164160,8d1179920d906e72e4154239cf795c881b2870d2672de88a3bf7524682292a30,2022-11-12 09:33:10,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int t,i,j,a[t],x;\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<t;i++)\n    {\n        x=pow(6,a[i]);\n        x=x%10;\n        printf(\""%d\\n\"",x);\n    }\n    return 0;\n}",WRONG_ANSWER,6,324
1591242998082482176,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-12 09:34:29,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i=0,max=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c;\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d \"",&a[i]);\n        scanf(\""%d \"",&b[i]);\n        if(b[i]-a[i]<0)\n        {\n            max=i;\n        }\n        for(i=0;i<max;i++)\n        {\n            c=\n        }\n    }\n   \n    printf(\""%d\"",c);\n}",COMPILE_ERROR,0,0
1591244955102785536,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-11-12 09:42:15,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int n,i=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n],c=0;\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d \"",&a[i]);\n        scanf(\""%d \"",&b[i]); \n        for(i=0;i<5;i++)\n        {\n            c+=b[i]-a[i];\n        }\n    }\n  \n    printf(\""%d\"",c);\n}",TIME_LIMIT_EXCEEDED,400,464
1591246002672152576,8d1179920d906e72e4154239cf795c881b2870d2672de88a3bf7524682292a30,2022-11-12 09:46:25,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h> \nint main()\n{\n    int t,i,j,a[10*10*10*10*10*10*10*10*10],x;\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<t;i++)\n    {\n        x=pow(6,a[i]);\n        x=x%10;\n        printf(\""%d\\n\"",x);\n    }\n    return 0;\n}",TIME_LIMIT_EXCEEDED,3,472
1591246173321625600,1d5ac1674206114dbc3c7883f7305e131f037b2aefcb3b297d62e80957fc1452,2022-11-12 09:47:06,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int i,n,len=0,q;\n    scanf(\""%d\"",&n);\n\tfor(i=2;i<=n;i++)\n    {\n\t\tq=sqrt(i);\n        for(int j=2;j<=q;j++)\n\t\t{\n\t\t\tif(i%j==0)\n\t\t\t\tbreak;\n\t\t}\n\t\tif(j>q)\n\t\t\tlen++;\n    }\n    printf(\""%d\"",len);\n}",COMPILE_ERROR,0,0
1591246205739401216,8d1179920d906e72e4154239cf795c881b2870d2672de88a3bf7524682292a30,2022-11-12 09:47:14,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h> \nint main()\n{\n    int t,i,j,a[1000000000],x;\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<t;i++)\n    {\n        x=pow(6,a[i]);\n        x=x%10;\n        printf(\""%d\\n\"",x);\n    }\n    return 0;\n}",TIME_LIMIT_EXCEEDED,3,316
1591246421192388608,8d1179920d906e72e4154239cf795c881b2870d2672de88a3bf7524682292a30,2022-11-12 09:48:05,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h> \nint main()\n{\n    int t,i,j,a[t],x;\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<t;i++)\n    {\n        x=pow(6,a[i]);\n        x=x%10;\n        printf(\""%d\\n\"",x);\n    }\n    return 0;\n}",WRONG_ANSWER,6,316
1591247818126327808,ac6681ab5fc25ee05ff21b3da74920316506e49f1c09ea3dd6807684b18b6779,2022-11-12 09:53:38,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main ()\n{\n    printf(\""2022\\n\"");\n    return 0;\n}",ACCEPTED,3,356
1591248763564392448,d5db2853d0fce01dd43b2b6adf379841403b78fda0e6cb22c82f6f2b59da60dc,2022-11-12 09:57:23,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nmain(){\n\tint i,j,n,count=0;\n\tscanf(\""%d\"",&n);\n\tfor(i=2;i<n;i++){\n\t\tfor(j=2;j<=i;j++){\n\t\t\tif(i%j==0) break;\n\t\t}\n\t\tif(i==j) count++;\n\t}\n\tprintf(\""%d\"",count);\n\treturn 0;\n} ",ACCEPTED,926,380
1591248865217523712,d5db2853d0fce01dd43b2b6adf379841403b78fda0e6cb22c82f6f2b59da60dc,2022-11-12 09:57:48,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h> \nint main(void){\n\tlong int n,m,i,s[10];\n\tscanf(\""%ld\"",&m);\n\t\tfor(i=0;i<m;i++){\n\t\t\tscanf(\""%ld\"",&n);\n\t\t\ts[i]=pow(6,n);\n\t\tfor(i=0;i<m;i++){\n\t\t\tprintf(\""%ld\"",s[i]%10);\n\t\t\tif(i<m-1) printf(\""\\n\"");\n\t\t} \n\t}\n\treturn 0;\n}",WRONG_ANSWER,3,188
1591248913875664896,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-12 09:57:59,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n   #include <math.h>\n   int main(){\n       int n;\n        long int t;\n      scanf(\""%d\"",&n);\n      for(int i=0;i<n;i++){\n            scanf(\""%d\"",&t);\n            if(t==0) {printf(\""1\\n\"");continue;}\n\n\n        if(t>0)\n          printf(\""6\\n\"");\n       }\n      return 0;\n   }",WRONG_ANSWER,9,332
1591248948256374784,ac6681ab5fc25ee05ff21b3da74920316506e49f1c09ea3dd6807684b18b6779,2022-11-12 09:58:07,C++,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main ()\n{\n    printf(\""2022\\n\"");\n    return 0;\n}",ACCEPTED,3,188
1591248996042059776,ac6681ab5fc25ee05ff21b3da74920316506e49f1c09ea3dd6807684b18b6779,2022-11-12 09:58:19,C++,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main ()\n{\n    printf(\""2022\\n\"");\n    return 0;\n}",ACCEPTED,3,192
1591249485798379520,1d5ac1674206114dbc3c7883f7305e131f037b2aefcb3b297d62e80957fc1452,2022-11-12 10:00:16,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int t,n,end;\n    scanf(\""%d\"",&t);\n    for(int i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&n);\n        if(n==0)\n        {\n            end=1;\n        }\n        else\n        {\n            end=6;\n        }\n        printf(\""%d\\n\"",end);\n    }\n}",ACCEPTED,11,348
1591249674609143808,1d5ac1674206114dbc3c7883f7305e131f037b2aefcb3b297d62e80957fc1452,2022-11-12 10:01:01,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int i,n,len=0,q;\n    scanf(\""%d\"",&n);\n\tfor(i=2;i<=n;i++)\n    {\n\t\tq=sqrt(i);\n        for(int j=2;j<=q;j++)\n\t\t{\n\t\t\tif(i%j==0)\n\t\t\t\tbreak;\n\t\t}\n\t\tif(j>q)\n\t\t\tlen++;\n    }\n    printf(\""%d\"",len);\n}",COMPILE_ERROR,0,0
1591249903840440320,1d5ac1674206114dbc3c7883f7305e131f037b2aefcb3b297d62e80957fc1452,2022-11-12 10:01:55,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int i,n,len=0;\n    scanf(\""%d\"",&n);\n\tfor(i=2;i<=n;i++)\n    {\n        for(int j=2;j<=sqrt(i);j++)\n\t\t{\n\t\t\tif(i%sqrt(i)==0)\n\t\t\t\tbreak;\n\t\t}\n\t\tif(j>q)\n\t\t\tlen++;\n    }\n    printf(\""%d\"",len);\n}",COMPILE_ERROR,0,0
1591250112972656640,1d5ac1674206114dbc3c7883f7305e131f037b2aefcb3b297d62e80957fc1452,2022-11-12 10:02:45,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int i,j,n,len=0;\n    scanf(\""%d\"",&n);\n\tfor(i=2;i<=n;i++)\n    {\n        for(j=2;j<=sqrt(i);j++)\n\t\t{\n\t\t\tif(i%j==0)\n\t\t\t\tbreak;\n\t\t}\n\t\tif(j>sqrt(i))\n\t\t\tlen++;\n    }\n    printf(\""%d\"",len);\n}",ACCEPTED,12,352
1591250483329695744,27fbb32d960dbf49665c8905b68012d602eda68987686c6f224ec7b49ca3d0ac,2022-11-12 10:04:13,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint js(long int a)\n{\n    a=a%10;\n    return a;\n}\nint main()\n{\n    long int n;\n    int i,sum；\n    (void)scanf(\""%ld\"",&n);\n    long int a[n],b[n];\n    for(i=0;i<n;i++)\n    {\n        (void)scanf(\""%ld\"",&a[i]);\n        b[i]=pow(6,a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n    \t\n        sum=js(b[i]);\n        printf(\""%ld\\n\"",sum);\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1591250658144071680,8d1179920d906e72e4154239cf795c881b2870d2672de88a3bf7524682292a30,2022-11-12 10:04:55,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h> \nint main()\n{\n    int t,i,j,x;\n    scanf(\""%d\"",&t);\n    for(i=0,x=0,j=0;i<t;i++)\n    {\n        scanf(\""%d\"",&j);\n        x=pow(6,j);\n        x=x%10;\n        printf(\""%d\\n\"",x);\n    }\n    return 0;\n}",WRONG_ANSWER,6,312
1591250905578668032,37ec44401a5a9f0dfa02d2aedaf5edff84fc443d98174af5f21ab01a7d6f6a41,2022-11-12 10:05:54,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""2022\\n\"");\n    return 0;\n}\n",ACCEPTED,3,184
1591250925199622144,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-12 10:05:59,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int n = scanner.nextInt();\n        int count = 0,i,j;\n        for (i = 2; i <= n; i++) {\n            for (j = 2; j <=i ; j++) {\n                if (i == j){\n                    count++;\n                }\n                if (i % j == 0)\n                    break;\n            }\n        }\n        System.out.println(count);\n    }\n}",TIME_LIMIT_EXCEEDED,1000,16600
1591251169933066240,8d1179920d906e72e4154239cf795c881b2870d2672de88a3bf7524682292a30,2022-11-12 10:06:57,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h> \nint main()\n{\n    int t,i,j,x;\n    scanf(\""%d\"",&t);\n    for(i=0,x=0,j=0;i<t;i++)\n    {\n        scanf(\""%d\"",&j);\n        x=pow(6,j);\n        x=x%10;\n        printf(\""%d\\n\"",x);\n    }\n    return 0;\n}",WRONG_ANSWER,7,320
1591251669227188224,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-12 10:08:56,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int n = scanner.nextInt();\n        int count = 0,i,j;\n        for (i = 2; i <= n; i++) {\n            for (j = 2; j <=i ; j++) {\n                if (i == j)\n                    count++;\n                if (i % j == 0)\n                    break;\n            }\n        }\n        System.out.println(count);\n    }\n}",WRONG_ANSWER,1000,19136
1591251898034884608,356d4d261b0c273ed9edf9a21f22e4b180080ccba0f8bbfa0c58f889e1a800cc,2022-11-12 10:09:51,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int m,i,j,k,n=0,flag=1;\n    scanf(\""%d\"",&m);\n    for(i=2;i<=m;i++)\n    {\n        k=sqrt(i);\n        for(j=2;j<=k;j++)\n            if(i%j==0)\n                break;\n        if(j>k)\n            n++;\n    }\n    printf(\""%d\"",n);\n    return 0;\n}\n\n\n\n\n\n",ACCEPTED,12,316
1591252034173599744,ac6681ab5fc25ee05ff21b3da74920316506e49f1c09ea3dd6807684b18b6779,2022-11-12 10:10:23,C++,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n    return 0;\n}",ACCEPTED,4,196
1591252165262356480,8d1179920d906e72e4154239cf795c881b2870d2672de88a3bf7524682292a30,2022-11-12 10:10:54,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h> \nint main()\n{\n    int t,i,j,x;\n    scanf(\""%d\"",&t);\n    for(i=0,x=0,j=0;i<t;i++)\n    {\n        scanf(\""%d\"",&j);\n        x=pow(6,j);\n        x=x%10;\n        printf(\""%d\\n\"",x);\n    }\n    return 0;\n}",WRONG_ANSWER,6,192
1591252467571032064,1d5ac1674206114dbc3c7883f7305e131f037b2aefcb3b297d62e80957fc1452,2022-11-12 10:12:06,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int n,w[20],v[20],i,j,max,sum;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&w[i]);\n    for(j=0;j<n;j++)\n        scanf(\""%d\"",&v[j]);\n    max=v[1]-w[1];\n    for(i=0;i<n;i++)\n        for(j=i,sum=0;j<n;j++)\n        {\n            sum+=v[j]-w[j];\n            if(sum>max)\n                max=sum;\n        }\n    printf(\""%d\\n\"",max);\n    return 0;\n}",ACCEPTED,3,308
1591252652455931904,8d1179920d906e72e4154239cf795c881b2870d2672de88a3bf7524682292a30,2022-11-12 10:12:51,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h> \nint main()\n{\n    int t,i,j,x;\n    scanf(\""%d\"",&t);\n    for(i=0,x=0,j=0;i<t;i++)\n    {\n        scanf(\""%d\"",&j);\n        x=pow(6,j);\n        x=x%10;\n        if(i<t-1)\n            printf(\""%d\\n\"",x);\n        else\n            printf(\""%d\"",x);\n    }\n    return 0;\n}",WRONG_ANSWER,6,352
1591252763252686848,8d1179920d906e72e4154239cf795c881b2870d2672de88a3bf7524682292a30,2022-11-12 10:13:17,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h> \nint main()\n{\n    int t,i,j,x;\n    scanf(\""%d\"",&t);\n    for(i=0,x=0,j=0;i<t;i++)\n    {\n        scanf(\""%d\"",&j);\n        x=pow(6,j);\n        x=x%10;\n        if(i<t-1)\n            printf(\""%d\\n\"",x);\n        else\n            printf(\""%d\"",x);\n    }\n    return 0;\n}",WRONG_ANSWER,6,196
1591252767765757952,1d5ac1674206114dbc3c7883f7305e131f037b2aefcb3b297d62e80957fc1452,2022-11-12 10:13:18,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int n,w[20],v[20],i,j,max,sum;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&w[i]);\n    for(j=0;j<n;j++)\n        scanf(\""%d\"",&v[j]);\n    max=v[0]-w[0];\n    for(i=0;i<n;i++)\n        for(j=i,sum=0;j<n;j++)\n        {\n            sum+=v[j]-w[j];\n            if(sum>max)\n                max=sum;\n        }\n    printf(\""%d\\n\"",max);\n    return 0;\n}",ACCEPTED,4,540
1591252863907573760,1d5ac1674206114dbc3c7883f7305e131f037b2aefcb3b297d62e80957fc1452,2022-11-12 10:13:41,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int n,w[20],v[20],i,j,max,sum;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&w[i]);\n    for(j=0;j<n;j++)\n        scanf(\""%d\"",&v[j]);\n    max=0;\n    for(i=0;i<n;i++)\n        for(j=i,sum=0;j<n;j++)\n        {\n            sum+=v[j]-w[j];\n            if(sum>max)\n                max=sum;\n        }\n    printf(\""%d\\n\"",max);\n    return 0;\n}",ACCEPTED,3,184
1591253230745595904,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-12 10:15:08,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n   int main(){\n       int n,t;   \n      scanf(\""%d\\n\"",&n);\n      for(int i=0;i<n;i++){\n            scanf(\""%d\"",&t);\n            if(t==0)  y=1\n\n\n        else\n            y=6;\n          printf(\""%d\\n\"",y);\n       }\n      \n   }",COMPILE_ERROR,0,0
1591253431724085248,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-12 10:15:56,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"\n#include <stdio.h>\n   int main(){\n       int n,t,y;\n      scanf(\""%d\\n\"",&n);\n      for(int i=0;i<n;i++){\n            scanf(\""%d\"",&t);\n            if(t==0)  y=1;\n\n\n        else\n            y=6;\n          printf(\""%d\\n\"",y);\n       }\n\n   }",ACCEPTED,9,320
1591253459620397056,37ec44401a5a9f0dfa02d2aedaf5edff84fc443d98174af5f21ab01a7d6f6a41,2022-11-12 10:16:03,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d %d %d\"", &X, &Y,&Z);\n    printf(\""result=%d\\n\"", X+Y-Z);\n\n    return 0;\n}\n",WRONG_ANSWER,3,328
1591253543066075136,37ec44401a5a9f0dfa02d2aedaf5edff84fc443d98174af5f21ab01a7d6f6a41,2022-11-12 10:16:23,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d %d %d\"", &X, &Y,&Z);\n    printf(\""%d\\n\"", X+Y-Z);\n\n    return 0;\n}\n",ACCEPTED,8,316
1591254066188058624,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-12 10:18:28,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint main(){\n    ll n;\n    ll a=1;\n    int cnt=1;\n    cin>>n;\n    for(int i=2;i<=n;i++){\n     for(int j=2;j<=sqre(i);j++){\n     if(i%j==0)\n     {\n      a=0;\n         break;\n     }\n     }\n        if(a)\n            cnt++;\n    }\n    cout<<cnt<<endl;\nreturn 0;\n},COMPILE_ERROR,0,0
1591254407000428544,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-12 10:19:49,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint main(){\n    ll n;\n    ll a=1;\n    cin>>n;\n    for(int i=2;i<=n;i++){\n            int cnt=1;\n     for(int j=2;j<=sqre(i);j++){\n     if(i%j==0)\n     {\n      a=0;\n         break;\n     }\n     }\n        if(a)\n            cnt++;\n    }\n    cout<<cnt<<endl;\nreturn 0;\n},COMPILE_ERROR,0,0
1591254546398117888,d5db2853d0fce01dd43b2b6adf379841403b78fda0e6cb22c82f6f2b59da60dc,2022-11-12 10:20:22,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h> \nint main(void){\n\tlong long int n,m,i,s[10];\n\tscanf(\""%lld\\n\"",&m);\n\tif(m>=0&&m<=1000000000){\n\t\tfor(i=0;i<m;i++){\n\t\t\tscanf(\""%lld\"",&n);\n\t\t\ts[i]=pow(6,n);\n\t\t}\n\t\tfor(i=0;i<m;i++){\n\t\t\tprintf(\""%lld\"",s[i]%10);\n\t\t\tif(i<m-1) printf(\""\\n\"");\n\t\t} \n\t}\n\treturn 0;\n}",WRONG_ANSWER,6,376
1591254732402896896,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-12 10:21:06,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint main(){\n    ll n;\n    ll a=1;\n    cin>>n;\n    for(int i=2;i<=n;i++){\n            int cnt=1;\n     for(int j=2;j<=i;j++){\n     if(i%j==0)\n     {\n      a=0;\n         break;\n     }\n     }\n        if(a)\n            cnt++;\n    }\n    cout<<cnt<<endl;\nreturn 0;\n},COMPILE_ERROR,0,0
1591254743610101760,0ac60c8cba5dc039a812c57a79304a29dc187bee37ef204107b64c7a81bc6988,2022-11-12 10:21:09,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,c=2022\nprint(c),ACCEPTED,17,2756
1591254807040536576,ac6681ab5fc25ee05ff21b3da74920316506e49f1c09ea3dd6807684b18b6779,2022-11-12 10:21:24,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int i,n,t,z;\n    scanf(\""%d\\n\"",&t);\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&n);\n        if(n==0)\n            z=1;\n        else\n            z=6;\n        printf(\""%d\\n\"",z);\n    }\n}",ACCEPTED,10,328
1591254890054221824,28b4de6882b7ade2679f59c486acaf307ce8415dcb0a15787dba589025bbdb02,2022-11-12 10:21:44,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint i,k;\n\tint n;\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&k);\n\t\tif(k==0)printf(\""1\"");\n\t\telse printf(\""6\"");\n\t\tif(i!=n-1)\n\t\tprintf(\""\\n\"");\n\t } \n    return 0;\n}",ACCEPTED,8,328
1591254906642694144,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-12 10:21:48,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int n = scanner.nextInt();\n        int arr1[] = new int[n];\n        int arr2[] = new int[n];\n        int arr3[] = new int[n];\n        for (int i = 0; i < n; i++) {\n            arr1[i] = scanner.nextInt();\n        }\n        for (int i = 0; i < n; i++) {\n            arr2[i] = scanner.nextInt();\n            arr3[i] = arr2[i] - arr1[i];\n        }\n        int max = arr3[0];\n        for (int i = 1; i < n - 1; i++) {\n            arr3[i] = arr3[i - 1] + arr3[i];\n            if (arr3[i] > max)\n                max = arr3[i];\n        }\n        System.out.println(max);\n    }\n},COMPILE_ERROR,0,0
1591254957637021696,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-12 10:22:00,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint main(){\n    ll n;\n     int cnt=1;\n    cin>>n;\n    for(int i=2;i<=n;i++){\n           ll a=1;\n     for(int j=2;j<=i;j++){\n     if(i%j==0)\n     {\n      a=0;\n         break;\n     }\n     }\n        if(a)\n            cnt++;\n    }\n    cout<<cnt<<endl;\nreturn 0;\n},WRONG_ANSWER,921,440
1591254982878367744,28b4de6882b7ade2679f59c486acaf307ce8415dcb0a15787dba589025bbdb02,2022-11-12 10:22:06,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint i,k;\n\tint n;\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&k);\n\t\tif(k==0)printf(\""1\"");\n\t\telse printf(\""6\"");\n\t\n\t\tprintf(\""\\n\"");\n\t } \n    return 0;\n}",ACCEPTED,9,200
1591255089942147072,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-12 10:22:32,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int n = scanner.nextInt();\n        int arr1[] = new int[n];\n        int arr2[] = new int[n];\n        int arr3[] = new int[n];\n        for (int i = 0; i < n; i++) {\n            arr1[i] = scanner.nextInt();\n        }\n        for (int i = 0; i < n; i++) {\n            arr2[i] = scanner.nextInt();\n            arr3[i] = arr2[i] - arr1[i];\n        }\n        int max = arr3[0];\n        for (int i = 1; i < n - 1; i++) {\n            arr3[i] = arr3[i - 1] + arr3[i];\n            if (arr3[i] > max)\n                max = arr3[i];\n        }\n        System.out.println(max);\n    }\n},COMPILE_ERROR,0,0
1591255122645155840,0ac60c8cba5dc039a812c57a79304a29dc187bee37ef204107b64c7a81bc6988,2022-11-12 10:22:39,Python,300.0,1590524835191705600,1572865591226855424,1049226928954454016,list=input().split()\nnum=int(list[0])+int(list[1])-int(list[2])\nprint(num),ACCEPTED,32,2884
1591255178282577920,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-12 10:22:53,C++,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n\tint n,f;\n\tcin >> n;\n\tint cnt = 0;\n\t\tfor (int i = 2; i <= n; i++)\n\t\t{\n\t\t\tf=1;\n\t\t\tfor(int j = 2; j <=sqrt(i); j++)\n\t\t\t{\n\t\t\t\tif(i%j==0){\n\t\t\t\t\tf=0;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(f){\n\t\t\t//cout << i << endl ;\n\t\t\tcnt++;\n\t\t\t}\n\t\t}\n\tcout << cnt<< endl;\n\treturn 0;\n}\n\n\n",ACCEPTED,16,436
1591255294766813184,8d1179920d906e72e4154239cf795c881b2870d2672de88a3bf7524682292a30,2022-11-12 10:23:21,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,i,j,x;\n    x=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n    {\n        for(j=2;j<=i;j++)\n        {\n            if(i%j==0)\n                break;\n            if(i==j)\n                x++;\n        }\n    }\n    printf(\""%d\"",x);\n    return 0;\n}",TIME_LIMIT_EXCEEDED,1000,320
1591255301301514240,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-12 10:23:22,Java,0.0,1590734963702620160,1590734503495200768,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int n = scanner.nextInt();\n        int arr1[] = new int[n];\n        int arr2[] = new int[n];\n        int arr3[] = new int[n];\n        for (int i = 0; i < n; i++) {\n            arr1[i] = scanner.nextInt();\n        }\n        for (int i = 0; i < n; i++) {\n            arr2[i] = scanner.nextInt();\n            arr3[i] = arr2[i] - arr1[i];\n        }\n        int max = arr3[0];\n        for (int i = 1; i < n - 1; i++) {\n            arr3[i] = arr3[i - 1] + arr3[i];\n            if (arr3[i] > max)\n                max = arr3[i];\n        }\n        System.out.println(max);\n    }\n},WRONG_ANSWER,118,19360
1591255310034055168,99481c5a0804ff1b45cf32a79326675aa759c0780ab1ad0d29f845666cb83208,2022-11-12 10:23:24,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    int ans=x+y-z;\n    printf(\""%d\"",ans);\n    return 0;\n}\n",ACCEPTED,6,192
1591255384956932096,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-12 10:23:42,Java,0.0,1590734963702620160,1590734503495200768,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int n = scanner.nextInt();\n        int arr1[] = new int[n];\n        int arr2[] = new int[n];\n        int arr3[] = new int[n];\n        for (int i = 0; i < n; i++) {\n            arr1[i] = scanner.nextInt();\n        }\n        for (int i = 0; i < n; i++) {\n            arr2[i] = scanner.nextInt();\n            arr3[i] = arr2[i] - arr1[i];\n        }\n        int max = arr3[0];\n        for (int i = 1; i < n - 1; i++) {\n            arr3[i] = arr3[i - 1] + arr3[i];\n            if (arr3[i] > max)\n                max = arr3[i];\n        }\n        System.out.println(max);\n    }\n},WRONG_ANSWER,129,18628
1591255481019052032,8d1179920d906e72e4154239cf795c881b2870d2672de88a3bf7524682292a30,2022-11-12 10:24:05,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,i,j,x;\n    x=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<=n;i++)\n    {\n        for(j=2;j<=i;j++)\n            if(i%j==0)\n                break;\n            if(i==j)\n                x++;\n    }\n    printf(\""%d\"",x);\n    return 0;\n}",ACCEPTED,918,356
1591255786305683456,d5db2853d0fce01dd43b2b6adf379841403b78fda0e6cb22c82f6f2b59da60dc,2022-11-12 10:25:18,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\nint main(void){\n\tint i,y,n,m;\n\tscanf(\""%d\\n\"",&n);\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&m);\n\t\tif(m==0) y=1;\n\t\telse y=6;\n\t\tprintf(\""%d\\n\"",y);\n\t}\n\treturn 0;\n}",ACCEPTED,9,336
1591256196416339968,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-12 10:26:55,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint main(){\n    int n;\n    cin>>n;\n    int cnt=1;\n    for(int i=2;i<=n;i++){\n    int f=1;\n        for(int j=2;j<=sqrt(i);j++){\n         if(i%j==0){\n        f=0;break;\n         }\n        }\n        if(f=1)\n            cnt++;\n    }\n    cout<<cnt<<endl;\nreturn 0;\n}\n,WRONG_ANSWER,10,312
1591256245548396544,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-12 10:27:07,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint main(){\n    int n;\n    cin>>n;\n    int cnt=1;\n    for(int i=2;i<=n;i++){\n    int f=1;\n        for(int j=2;j<=sqrt(i);j++){\n         if(i%j==0){\n        f=0;break;\n         }\n        }\n        if(f==1)\n            cnt++;\n    }\n    cout<<cnt<<endl;\nreturn 0;\n}\n,WRONG_ANSWER,10,312
1591256524725465088,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-12 10:28:14,C++,300.0,1590681458522583041,1590676393489461248,1049226928954454016,#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint main(){\n    int n;\n    cin>>n;\n    int cnt=0;\n    for(int i=2;i<n;i++){\n    int f=1;\n        for(int j=2;j<=sqrt(i);j++){\n         if(i%j==0){\n        f=0;break;\n         }\n        }\n        if(f==1)\n            cnt++;\n    }\n    cout<<cnt<<endl;\nreturn 0;\n}\n,ACCEPTED,15,480
1591256656728625152,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-12 10:28:45,Java,0.0,1590734963702620160,1590734503495200768,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int n = scanner.nextInt();\n        int arr1[] = new int[n];\n        int arr2[] = new int[n];\n        int arr3[] = new int[n];\n        for (int i = 0; i < n; i++) {\n            arr1[i] = scanner.nextInt();\n        }\n        for (int i = 0; i < n; i++) {\n            arr2[i] = scanner.nextInt();\n            arr3[i] = arr2[i] - arr1[i];\n        }\n        int max = arr3[0];\n        for (int i = 1; i < n - 1; i++) {\n            arr3[i] = arr3[i - 1] + arr3[i];\n            if (arr3[i] > max)\n                max = arr3[i];\n        }\n        System.out.println(max);\n    }\n},WRONG_ANSWER,117,16784
1591256670284591104,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-12 10:28:48,C++,300.0,1590681458522583041,1590676393489461248,1049226928954454016,#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint main(){\n    int n;\n    cin>>n;\n    int cnt=0;\n    for(int i=2;i<n;i++){\n    int f=1;\n        for(int j=2;j<=sqrt(i);j++){\n         if(i%j==0){\n        f=0;break;\n         }\n        }\n        if(f==1)\n            cnt++;\n    }\n    cout<<cnt<<endl;\nreturn 0;\n}\n,ACCEPTED,16,320
1591256705252524032,8d1179920d906e72e4154239cf795c881b2870d2672de88a3bf7524682292a30,2022-11-12 10:28:57,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h> \nint main()\n{\n    int t,i,j,x;\n    scanf(\""%d\"",&t);\n    for(i=0,x=0,j=0;i<t;i++)\n    {\n        scanf(\""%d\"",&j);\n        x=pow(6,j);\n        x=x%10;\n        if(i<t-1)\n            printf(\""%d\\n\"",x);\n        else\n            printf(\""%d\"",x);\n    }\n    return 0;\n}",WRONG_ANSWER,7,336
1591257043128881152,ac6681ab5fc25ee05ff21b3da74920316506e49f1c09ea3dd6807684b18b6779,2022-11-12 10:30:17,C++,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n    int i,j,n,num=0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<n;i++)\n    {\n        for(j=2;j<=sqrt(i);j++) \n        {\n            if(i%j==0)\n            break;\n        }\n            if(j>sqrt(i))\n            num++;\n    }\n    printf(\""%d\"",num);\n}",ACCEPTED,14,192
1591257747608371200,8d1179920d906e72e4154239cf795c881b2870d2672de88a3bf7524682292a30,2022-11-12 10:33:05,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h> \nint main()\n{\n    int t,i,j,x,a[t];\n    scanf(\""%d\"",&t);\n    for(i=0,x=0;i<t;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n        x=pow(6,a[i]);\n        x=x%10;\n        if(i<t-1)\n            printf(\""%d\\n\"",x);\n        else\n            printf(\""%d\"",x);\n    }\n    return 0;\n}",WRONG_ANSWER,6,204
1591257895839268864,2f69643d0fe0e1da85ae22b90fad7fdd7cd535af9e3693ee87017a234d80bef4,2022-11-12 10:33:41,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <iostream>\n\nusing namespace std;\n\nint date(int year)\n\n{\n\n\tif ((year % 4 == 0 && year % 100 != 0) || (year % 400 == 0))\t\treturn 366;\n\n\telse\n\n\t\treturn 365;3\n\n}\n\nint date1(int year)\n\n{\n\n\tif ((year % 4 == 0 && year % 100 != 0) || (year % 400 == 0))\n\n\t\treturn 1461;\n\n\telse\n\n\t\treturn 1460;\n\n}\n\nint main()\n\n{\n\n\tint sum = 0;\n\n\tint n;\n\n\tcin >> n;\n\n\tfor (int i = 0; i < n; i++)\n\n\t{\n\n\t\tint a1, a2, a3;\n\n\t\tscanf(\""%d-%d-%d\"", &a1, &a2, &a3);\n\n\t\tif (a2 == 2 && a3 == 29)\n\n\t\t{\n\n\t\t\tfor (int j = a1;; )\n\n\t\t\t{\n\n\t\t\t\tsum += date1(j+4);\n\n\t\t\t\tj += 4;\n\n\t\t\t\tif (sum % 7 == 0)\n\n\t\t\t\t{\n\n\t\t\t\t\tcout << j << endl;\n\n\t\t\t\t\tbreak;\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t\telse\n\n\t\t{\n\n\t\t\tfor (int j = a1;;)\n\n\t\t\t{\n\n\t\t\t\tif (a2 <= 2)\n\n\t\t\t\t\tsum += date(j);\n\n\t\t\t\telse\n\n\t\t\t\t\tsum += date(j + 1);\n\n\t\t\t\tj++;\n\n\t\t\t\tif (sum % 7 == 0)\n\n\t\t\t\t{\n\n\t\t\t\t\tcout << j << endl;\n\n\t\t\t\t\tbreak;\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t\t\n\n\t}\n\n}",COMPILE_ERROR,0,0
1591257969076015104,8d1179920d906e72e4154239cf795c881b2870d2672de88a3bf7524682292a30,2022-11-12 10:33:58,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <math.h> \nint main()\n{\n    int t,i,j,x;\n    scanf(\""%d\"",&t);\n    for(i=0,x=0,j=0;i<t;i++)\n    {\n        scanf(\""%d\"",&j);\n        x=pow(6,j);\n        x=x%10;\n        if(i<t-1)\n            printf(\""%d\\n\"",x);\n        else\n            printf(\""%d\"",x);\n    }\n    return 0;\n}",WRONG_ANSWER,6,200
1591258188941430784,2f69643d0fe0e1da85ae22b90fad7fdd7cd535af9e3693ee87017a234d80bef4,2022-11-12 10:34:51,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <iostream>\n\nusing namespace std;\n\nint date(int year)\n\n{\n\n\tif ((year % 4 == 0 && year % 100 != 0) || (year % 400 == 0))\t\treturn 366;\n\n\telse\n\n\t\treturn 365;\n\n}\n\nint date1(int year)\n\n{\n\n\tif ((year % 4 == 0 && year % 100 != 0) || (year % 400 == 0))\n\n\t\treturn 1461;\n\n\telse\n\n\t\treturn 1460;\n\n}\n\nint main()\n\n{\n\n\tint sum = 0;\n\n\tint n;\n\n\tcin >> n;\n\n\tfor (int i = 0; i < n; i++)\n\n\t{\n\n\t\tint a1, a2, a3;\n\n\t\tscanf(\""%d-%d-%d\"", &a1, &a2, &a3);\n\n\t\tif (a2 == 2 && a3 == 29)\n\n\t\t{\n\n\t\t\tfor (int j = a1;; )\n\n\t\t\t{\n\n\t\t\t\tsum += date1(j+4);\n\n\t\t\t\tj += 4;\n\n\t\t\t\tif (sum % 7 == 0)\n\n\t\t\t\t{\n\n\t\t\t\t\tcout << j << endl;\n\n\t\t\t\t\tbreak;\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t\telse\n\n\t\t{\n\n\t\t\tfor (int j = a1;;)\n\n\t\t\t{\n\n\t\t\t\tif (a2 <= 2)\n\n\t\t\t\t\tsum += date(j);\n\n\t\t\t\telse\n\n\t\t\t\t\tsum += date(j + 1);\n\n\t\t\t\tj++;\n\n\t\t\t\tif (sum % 7 == 0)\n\n\t\t\t\t{\n\n\t\t\t\t\tcout << j << endl;\n\n\t\t\t\t\tbreak;\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t\t\n\n\t}\n\n}",COMPILE_ERROR,0,0
1591258349721661440,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-11-12 10:35:29,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"\n#include <stdio.h>\n#define  MAX  30\n   int main(){\n      int n,a[MAX],b[MAX],i,j,max,sum;\n      scanf(\""%d\"",&n);\n      for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n      for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n        max=b[0]-a[0];\n        for(i=0;i<n;i++)\n            for(j=i,sum=0;j<n;j++)\n          {\n              sum+=b[j]-a[j];\n                if(sum>max)\n                   max=sum;\n\n\n       }\n\n       printf(\""%d\\n\"",max);\n       return 0;\n\n   }\n",ACCEPTED,3,184
1591258484706967552,0ac60c8cba5dc039a812c57a79304a29dc187bee37ef204107b64c7a81bc6988,2022-11-12 10:36:01,Python,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"n=int(input())\nlist=input().split()\nfor i in list:\n    if i==\""0\"":\n        print(\""1\"")\n    else:\n        print(\""6\"")",ACCEPTED,49,2756
1591258604630511616,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-12 10:36:30,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int n = scanner.nextInt();\n        int count = 0,i,j;\n        for (i = 2; i <= n; i++) {\n            for (j = 2; j <=i ; j++) {\n                if (i == j)\n                    count++;\n                if (i % j == 0)\n                    break;\n            }\n        }\n        System.out.println(count);\n    }\n}",TIME_LIMIT_EXCEEDED,1000,19160
1591258652709814272,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-12 10:36:41,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int n = scanner.nextInt();\n        int[] arr = new int[10];\n        int count = 0,a = 0;\n        for (int i = 0; i < n; i++) {\n            arr[i] = scanner.nextInt();\n        }\n        for (int i = 0; i < n; i++) {\n            for (int j = 0; j < arr[i]; j++) {\n                a = 6 * 6 % 10;\n            }\n            System.out.println(a);\n        }\n    }\n}\n",NON_ZERO_EXIT_CODE,266,19044
1591258812068179968,9ca3f63f61fa4f349009d69e7059514c3a39dbdd5a1f94342c11f4c33ccdceaa,2022-11-12 10:37:19,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"x = int(input())\ny = input().split(\"" \"")\nz = input().split(\"" \"")\nb = c = -999999\nfor j in range(x):\n    b = 0\n    for i in range(j,x):\n        a = int(z[i])-int(y[i])\n        if b == 0 and a<0:\n            b=a\n        if b + a > b:\n            b = b+a\n        if b + a < b:\n            break\n    if c < b:\n        c = b\nprint(c)\n",WRONG_ANSWER,18,2760
1591258816480587776,28b4de6882b7ade2679f59c486acaf307ce8415dcb0a15787dba589025bbdb02,2022-11-12 10:37:20,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint n,i,j,max,sum;\n\tscanf(\""%d\"",&n);\n\tint v[n],w[n];\n\tfor(i=0;i<n;i++)\n\tscanf(\""%d\"",&w[i]);\n\tfor(j=0;j<n;j++)\n\tscanf(\""%d\"",&v[j]);\n\tmax=v[0]-w[0];\n\tfor(i=0;i<n;i++)\n\tfor(j=i,sum=0;j<n;j++)\n\t{\n\t\tsum+=v[j]-w[j];\n\t\tif(sum>max)\n\t\tmax=sum; \n\t } \n\t printf(\""%d\\n\"",max);\n\t \n    return 0;\n}",ACCEPTED,3,188
1591258988291887104,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-12 10:38:01,Java,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main() {\n\tint x,n,i,j;\n\tscanf(\""%d\"",&n);\n\tfor(i=2;i<=n;i++)\n\t{\n\t\tint k=0;\n\t\tfor(j=2;j<i;j++)\n\t\t{\n\t\tif(i%j==0)\n\t\tk++;\n\t\tif(k>0)\n\t\tbreak;\n      \t}\n      \tif(k==0)\n      \tx++;\n\t}\n\tprintf(\""%d\\n\"",x);\n}\n",COMPILE_ERROR,0,0
1591259069510385664,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-12 10:38:20,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main() {\n\tint x,n,i,j;\n\tscanf(\""%d\"",&n);\n\tfor(i=2;i<=n;i++)\n\t{\n\t\tint k=0;\n\t\tfor(j=2;j<i;j++)\n\t\t{\n\t\tif(i%j==0)\n\t\tk++;\n\t\tif(k>0)\n\t\tbreak;\n      \t}\n      \tif(k==0)\n      \tx++;\n\t}\n\tprintf(\""%d\\n\"",x);\n}\n",ACCEPTED,921,192
1591259154457624576,cfc5530a19b24fc4b274f2e4d4609e448c7aecb0325c1717b7f709645428127b,2022-11-12 10:38:41,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"print(\""2022\"")",ACCEPTED,15,2924
1591259203992354816,1ac1c697452718cae6f56347fb0bf2473480d854f77bcfb84dd289d79169690e,2022-11-12 10:38:53,C++,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"cout << \""2022\"" << endl;",COMPILE_ERROR,0,0
1591259237811007488,37ec44401a5a9f0dfa02d2aedaf5edff84fc443d98174af5f21ab01a7d6f6a41,2022-11-12 10:39:01,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main()\n{\n    int m,n,i,k,j,s[100000] = {0};\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&j);\n        s[j]=1;\n    }\n    for(j=1;j<=n;j++)\n    {\n        if(s[j] == 1){\n            printf(\""%d \"",6);\n        }\n    }\nreturn 0;\n\n}\n\n",WRONG_ANSWER,4,696
1591259285806448640,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-12 10:39:12,Java,0.0,1590734963702620160,1590734503495200768,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int n = scanner.nextInt();\n        int arr1[] = new int[n];\n        int arr2[] = new int[n];\n        int arr3[] = new int[n];\n        for (int i = 0; i < n; i++) {\n            arr1[i] = scanner.nextInt();\n        }\n        for (int i = 0; i < n; i++) {\n            arr2[i] = scanner.nextInt();\n            arr3[i] = arr2[i] - arr1[i];\n        }\n        int max = arr3[0];\n        for (int i = 1; i < n - 1; i++) {\n            arr3[i] = arr3[i - 1] + arr3[i];\n            if (arr3[i] > max)\n                max = arr3[i];\n        }\n        System.out.println(max);\n    }\n},WRONG_ANSWER,114,16648
1591259340378517504,9ca3f63f61fa4f349009d69e7059514c3a39dbdd5a1f94342c11f4c33ccdceaa,2022-11-12 10:39:25,Python,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"x = int(input())\ny = input().split(\"" \"")\nz = input().split(\"" \"")\nb = c = -999\nfor j in range(x):\n    b = 0\n    for i in range(j,x):\n        a = int(z[i])-int(y[i])\n        if b + a > b:\n            b = b+a\n        if b + a < b:\n            break\n    if c < b:\n        c = b\nprint(c)\n",WRONG_ANSWER,16,2756
1591259419835437056,1ac1c697452718cae6f56347fb0bf2473480d854f77bcfb84dd289d79169690e,2022-11-12 10:39:44,C++,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <iostream>\nusing namespace std;\n\nint main()\n{\n    cout << \""2022\"" << endl;\n    system(\""pause\"");\n    return 0;\n}",ACCEPTED,4,712
1591259726556475392,cfc5530a19b24fc4b274f2e4d4609e448c7aecb0325c1717b7f709645428127b,2022-11-12 10:40:57,Java,300.0,1590524835191705600,1572865591226855424,1049226928954454016,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            int c = in.nextInt();\n            System.out.println(a + b -c);\n        }\n    }\n},ACCEPTED,240,16764
1591259855577481216,0c396be113b63ac245fc6ce925111f1631870141ae26c3ec6efb7b6360bb6cf3,2022-11-12 10:41:28,Python,300.0,1590528927448293376,1590525945717575680,1049226928954454016,print('2022'),ACCEPTED,16,2776
1591259870534369280,1f15b5b41f9e61f2d767bcb1ae88bef60c94b97dd423bfd2ba9c8c0e8e9d05bb,2022-11-12 10:41:31,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\nclass Main{\n    public static void main(String[] args){\n    Scanner sc = new Scanner(System.in);\n        int t = sc.nextInt();\n        int[] arry=new arry[t];\n        int n = sc.nextInt();\n        \n    }\n},COMPILE_ERROR,0,0
1591260130849632256,0c396be113b63ac245fc6ce925111f1631870141ae26c3ec6efb7b6360bb6cf3,2022-11-12 10:42:34,Java,0.0,1590524835191705600,1572865591226855424,1049226928954454016,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            int c = in.nextInt();\n            System.out.println(a + b);\n        }\n    }\n},WRONG_ANSWER,124,18932
1591260170200612864,37ec44401a5a9f0dfa02d2aedaf5edff84fc443d98174af5f21ab01a7d6f6a41,2022-11-12 10:42:43,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main()\n{\n    int m,n,i,k,j,s[100000] = {0};\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&j);\n        s[j]=1;\n        printf(\""%d \"",6);\n    }\n\nreturn 0;\n\n}\n\n",WRONG_ANSWER,12,472
1591260259874811904,0c396be113b63ac245fc6ce925111f1631870141ae26c3ec6efb7b6360bb6cf3,2022-11-12 10:43:04,Java,300.0,1590524835191705600,1572865591226855424,1049226928954454016,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            int c = in.nextInt();\n            System.out.println(a + b - c);\n        }\n    }\n},ACCEPTED,238,18956
1591260442947792896,b31601c92a4a3080abbaad650e00bb77253224eab66b59a49b2118d017649c2c,2022-11-12 10:43:48,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<time.h>\nbool IsPrime(int n){\n\tint i;\n\tif(n <= 1){\n\t\treturn false;\n\t}\n\tif(n==2){\n\t\treturn true;\n\t}\n\tfor(i = 2;i < n;i++){\n\t\tif(n%i==0) return false;\n\t}\n\treturn true; \n}\nint main(){\n\tint n,i;\n\tint t1 = clock();\n\tfor(i = 0;i<=100000;i++){\n\t\tif(IsPrime(i)) printf(\"" %d \"",i);\n\t}\n\tint t2 = clock();\n\tprintf(\""\\n运行时间：%d\\n\"",t2-t1);\n    return 0；\n}",COMPILE_ERROR,0,0
1591260792920518656,ddd0edd80a23dfec88d0679f4ed6037779b80d26db4ba0f74fecb3d447de61fa,2022-11-12 10:45:11,C++,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main(){\nprintf(\""2022\"");\n}",ACCEPTED,3,196
1591260834322513920,ddd0edd80a23dfec88d0679f4ed6037779b80d26db4ba0f74fecb3d447de61fa,2022-11-12 10:45:21,C++,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main(){\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n}",ACCEPTED,7,332
1591260965163831296,cfc5530a19b24fc4b274f2e4d4609e448c7aecb0325c1717b7f709645428127b,2022-11-12 10:45:52,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n\n long long int i,a,g,n,s,b=0;\n    scanf(\""%lld\"",&n);\n    for(i=1; i<=n; i++)\n    {s=0;\n    a=i;\n        while(a)\n        {\n            g=a%10;\n            a=a/10;\n\n            s=s+g;\n        }\n        if(s==9)\n        {\n\n            b++;\n        }\n\n    }\nprintf(\""%lld\"",b);\n    return 0;\n}\n \n\n",WRONG_ANSWER,3,200
1591261118822133760,ddd0edd80a23dfec88d0679f4ed6037779b80d26db4ba0f74fecb3d447de61fa,2022-11-12 10:46:29,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n    int n,sum,G;\n    scanf(\""%d\"",&n);\n    while(n){\n        scanf(\""%d\"",&sum);\n        if(sum!=0)\n        {\n         G=sum/sum*6;\n        printf(\""%d\"",G);\n        }\n        else\n            printf(\""1\"");\n        if(n!=1){\n            printf(\""\\n\"");\n        }\n        n--;\n    }\n    return 0;\n}",ACCEPTED,9,340
1591261164196139008,65ac58572a882f9de09782bce337ee95c6ab91ac6b377f6d29c3ee19b1a17f1a,2022-11-12 10:46:40,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d %d %d\"",&X,&y,&z);\n    printf(\""%d\"",X+Y-Z);\n    return 0;\n}",COMPILE_ERROR,0,0
1591261213739233280,65ac58572a882f9de09782bce337ee95c6ab91ac6b377f6d29c3ee19b1a17f1a,2022-11-12 10:46:52,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d %d %d\"",&X,&Y,&z);\n    printf(\""%d\"",X+Y-Z);\n    return 0;\n}",COMPILE_ERROR,0,0
1591261219485429760,1ac1c697452718cae6f56347fb0bf2473480d854f77bcfb84dd289d79169690e,2022-11-12 10:46:53,C++,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <iostream>\nusing namespace std;\n\n\nint main()\n{\n    int X,Y,Z,R;\n    cout << \""请输入三个数字X Y Z：\"" << endl;\n    cin >> X >> Y >> Z;\n    if(0<=X<100 && 0<=Y<100 && 0=<Z<100)\n    {\n        R = X+Y-Z;\n        cout << R << endl;\n    }else{\n        cout << \""您的输入超出范围\"" << endl;\n    }\n    \n    system(\""pause\"");\n    return 0;\n}",COMPILE_ERROR,0,0
1591261242189221888,ddd0edd80a23dfec88d0679f4ed6037779b80d26db4ba0f74fecb3d447de61fa,2022-11-12 10:46:58,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main(){\n    int n,sum,G;\n    scanf(\""%d\"",&n);\n    while(n){\n        scanf(\""%d\"",&sum);\n        if(sum!=0)\n        {\n         G=sum/sum*6;\n        printf(\""%d\"",G);\n        }\n        else\n            printf(\""1\"");\n        if(n!=1){\n            printf(\""\\n\"");\n        }\n        n--;\n    }\n    return 0;\n}",ACCEPTED,11,432
1591261255023788032,65ac58572a882f9de09782bce337ee95c6ab91ac6b377f6d29c3ee19b1a17f1a,2022-11-12 10:47:02,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    printf(\""%d\"",X+Y-Z);\n    return 0;\n}",ACCEPTED,6,460
1591261365036167168,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-12 10:47:28,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst N=10005;\nll a[N];\nll b[N];\nll c[N];\nint main(){\n    int n;\n    cin>>n;\n    c[0]=0;\n    for(int i=1;i<=n;i++){\n     cin>>a[i]>>b[i];\n        c[i]+=a[i]-b[i];\n    }\n    sort(c+1,c+n);\n    cout<<c[n];\n    return 0;\n}",COMPILE_ERROR,0,0
1591261415787266048,1ac1c697452718cae6f56347fb0bf2473480d854f77bcfb84dd289d79169690e,2022-11-12 10:47:40,C++,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <iostream>\nusing namespace std;\n\n\nint main()\n{\n    int X,Y,Z,R;\n    cout << \""请输入三个数字X Y Z：\"" << endl;\n    cin >> X >> Y >> Z;\n    if(0<=X<100 && 0<=Y<100 && 0=<Z<100)\n    {\n        R = X+Y-Z;\n        cout << R << endl;\n    }else{\n        cout << \""您的输入超出范围\"" << endl;\n    }\n    \n    system(\""pause\"");\n    return 0;\n}",COMPILE_ERROR,0,0
1591261441414463488,1ac1c697452718cae6f56347fb0bf2473480d854f77bcfb84dd289d79169690e,2022-11-12 10:47:46,C++,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <iostream>\nusing namespace std;\n\n\nint main()\n{\n    int X,Y,Z,R;\n    cout << \""请输入三个数字X Y Z：\"" << endl;\n    cin >> X >> Y >> Z;\n    if(0<=X<100 && 0<=Y<100 && 0<=Z<100)\n    {\n        R = X+Y-Z;\n        cout << R << endl;\n    }else{\n        cout << \""您的输入超出范围\"" << endl;\n    }\n    \n    system(\""pause\"");\n    return 0;\n}",WRONG_ANSWER,4,712
1591261525929668608,1ac1c697452718cae6f56347fb0bf2473480d854f77bcfb84dd289d79169690e,2022-11-12 10:48:06,C++,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <iostream>\nusing namespace std;\n\n\nint main()\n{\n    int X,Y,Z,R;\n    cout << \""请输入三个数字X Y Z：\"" << endl;\n    cin >> X >> Y >> Z;\n    if(0<=X<=100 && 0<=Y<=100 && 0<=Z<=100)\n    {\n        R = X+Y-Z;\n        cout << R << endl;\n    }else{\n        cout << \""您的输入超出范围\"" << endl;\n    }\n    \n    system(\""pause\"");\n    return 0;\n}",WRONG_ANSWER,4,708
1591261565028995072,e0156cb930d51b3d5482d43809e7b2c1f54a6b8623fccfa3202e2e53ddf1ffbf,2022-11-12 10:48:15,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,import java.util.Scanner;\npublic class Main{\n\tpublic static void main(String[] args){\n\t\tint arr[];\n\t\tarr=new int[10];\n\t\tScanner sc = new Scanner(System.in);\n\t\tfor(int i=0;i<10 ;i++){\n\t\t\tarr[i] = sc.nextInt();\n\t\t}\n      for(int i=0;i<10;i++)\n\t\t\tSystem.out.println(arr[i]);\n\t\tfor(int i = 0;i<9;i++){\n\t\t\tfor(int j =0;j<10-i-1;j++){\n\t\t\t\tif(arr[j]>arr[j+1]){\n\t\t\t\t\tint a;\n\t\t\t\t\ta=arr[j+1];\n\t\t\t\t\tarr[j+1]=arr[j];\n\t\t\t\t\tarr[j]=a;\n\t\t\t\t}\n\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(arr[9]);\n\t\tSystem.out.print(arr[0]);\n\t}\n}\n\n,COMPILE_ERROR,0,0
1591261628211965952,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-12 10:48:31,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int N=10005;\nll a[N];\nll b[N];\nll c[N];\nint main(){\n    int n;\n    cin>>n;\n    c[0]=0;\n    for(int i=1;i<=n;i++){\n     cin>>a[i]>>b[i];\n        c[i]+=a[i]-b[i];\n    }\n    sort(c+1,c+n);\n    cout<<c[n];\n    return 0;\n}",WRONG_ANSWER,5,520
1591261740061491200,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-12 10:48:57,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int N=10005;\nll a[N];\nll b[N];\nll c[N];\nint main(){\n    int n;\n    cin>>n;\n    c[0]=0;\n    for(int i=1;i<=n;i++){\n     cin>>a[i]>>b[i];\n        c[i]+=a[i]-b[i];\n    }\n    sort(c,c+n);\n    cout<<c[n];\n    return 0;\n}",WRONG_ANSWER,5,448
1591261800346226688,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-12 10:49:12,Java,0.0,1590734963702620160,1590734503495200768,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int n = scanner.nextInt();\n        int arr1[] = new int[n];\n        int arr2[] = new int[n];\n        int arr3[] = new int[n];\n        for (int i = 0; i < n; i++) {\n            arr1[i] = scanner.nextInt();\n        }\n        for (int i = 0; i < n; i++) {\n            arr2[i] = scanner.nextInt();\n            arr3[i] = arr2[i] - arr1[i];\n        }\n        int max = arr3[0];\n        for (int i = 1; i < n - 1; i++) {\n            arr3[i] = arr3[i - 1] + arr3[i];\n            if (arr3[i] > max)\n                max = arr3[i];\n        }\n        System.out.print(max);\n    }\n},WRONG_ANSWER,127,16488
1591261869199896576,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-12 10:49:28,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int n = scanner.nextInt();\n        int[] arr = new int[10];\n        int count = 0,a = 0;\n        for (int i = 0; i < n; i++) {\n            arr[i] = scanner.nextInt();\n        }\n        for (int i = 0; i < n; i++) {\n            for (int j = 0; j < arr[i]; j++) {\n                a = 6 * 6 % 10;\n            }\n            System.out.println(a);\n        }\n    }\n}\n",NON_ZERO_EXIT_CODE,245,16984
1591261940465336320,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-12 10:49:45,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int n = scanner.nextInt();\n        int[] arr = new int[10];\n        int count = 0;\n        int a = 0;\n        for (int i = 0; i < n; i++) {\n            arr[i] = scanner.nextInt();\n        }\n        for (int i = 0; i < n; i++) {\n            for (int j = 0; j < arr[i]; j++) {\n                a = 6 * 6 % 10;\n            }\n            System.out.println(a);\n        }\n    }\n}\n,NON_ZERO_EXIT_CODE,274,16360
1591261962154086400,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-12 10:49:50,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int N=10005;\nll a[N];\nll b[N];\nll c[N];\nint main(){\n    int n;\n    cin>>n;\n    c[0]=0;\n    for(int i=1;i<=n;i++){\n     cin>>a[i]>>b[i];\n        c[i]+=a[i]-b[i]+c[i-1];\n    }\n    sort(c,c+n);\n    cout<<c[n];\n    return 0;\n}",WRONG_ANSWER,3,472
1591262108879224832,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-12 10:50:25,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int N=10005;\nll a[N];\nll b[N];\nll c[N];\nint main(){\n    int n;\n    cin>>n;\n    c[0]=0;\n    for(int i=1;i<=n;i++){\n     cin>>a[i]>>b[i];\n        c[i]+=a[i]-b[i]+c[i-1];\n    }\n    sort(c,c+n+1);\n    cout<<c[n];\n    return 0;\n}",WRONG_ANSWER,3,316
1591262212172349440,e0156cb930d51b3d5482d43809e7b2c1f54a6b8623fccfa3202e2e53ddf1ffbf,2022-11-12 10:50:50,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016," public void prinf(int n ){\n        for (int i = 2; i < n; i++) {\n            if(get(i)){\n                System.out.print(i+\"" \"");\n            }\n        }\n    }\n\n    public boolean get(int num){\n        for (int i = 2; i <= Math.sqrt(num); i++) {\n            if(num % i == 0){\n                return false;\n            }\n        }\n        return true;\n    }\n",COMPILE_ERROR,0,0
1591262234683158528,6b02dfcf297d52c2de2e1416b33ee988ff909834c73207b147423a8301e9d174,2022-11-12 10:50:55,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"\n#include <stdio.h>\n#include <stdlib.h>\n#include<math.h>\nint main() {\n\tint n, i,k;\n\t\n\tint* p = NULL;\n\tscanf(\""%d\"", &n);\n\tp = (int*)malloc(n*sizeof(int));\n\tfor (i = 0; i < n; i++)\n\t\tscanf(\""%d\"", &p[i]);\n\tfor (i = 0; i < n; i++)\n\t{\n\t    k=6*p[i];\n       \n         \n            \n          \n\t    k=k%10;\n\t    \n\t    \n\t\tprintf(\""%d\\n\"",k);\n\t} \n\t\t\n\treturn 0;\n}\n",WRONG_ANSWER,4,324
1591262525897900032,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-12 10:52:05,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int N=10005;\nll a[N];\nll b[N];\nll c[N];\nint main(){\n    int n;\n    cin>>n;\n    c[0]=0;\n    for(int i=1;i<=n;i++)\n        cin>>a[i];\n    for(int i=1;i<=n;i++)\n        cin>>b[i];\n    for(int i=1;i<=n;i++){\n        c[i]=a[i]-b[i]+c[i-1];\n    }\n    sort(c,c+n+1);\n    cout<<c[n];\n    return 0;\n}",WRONG_ANSWER,4,456
1591262647960514560,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-12 10:52:34,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        String m = scanner.next();\n        int n = Integer.parseInt(m);\n        int[] arr = new int[10];\n        int count = 0;\n        int a = 0;\n        for (int i = 0; i < n; i++) {\n            arr[i] = scanner.nextInt();\n        }\n        for (int i = 0; i < n; i++) {\n            for (int j = 0; j < arr[i]; j++) {\n                a = 6 * 6 % 10;\n            }\n            System.out.println(a);\n        }\n    }\n}\n,NON_ZERO_EXIT_CODE,248,20892
1591262857885429760,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-12 10:53:24,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        String m = scanner.next();\n        int n = Integer.parseInt(m);\n        int[] arr = new int[10];\n        int count = 0;\n        int a = 0;\n        for (int i = 0; i < n; i++) {\n            arr[i] = scanner.nextInt();\n        }\n        for (int i = 0; i < n; i++) {\n            for (int j = 0; j < arr[i]; j++) {\n                a = 6 * 6 % 10;\n            }\n            System.out.println(a);\n        }\n    }\n}\n,NON_ZERO_EXIT_CODE,256,19848
1591262983190261760,cfc5530a19b24fc4b274f2e4d4609e448c7aecb0325c1717b7f709645428127b,2022-11-12 10:53:54,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"def IsPrime(k):        \n    if k == 1:\n        return False        \n    for i in range(2,k):            \n        if k % i == 0:                \n            return False        \n    return True\ndef GetPrimes(n):        \n    primes = []        \n    for i in range (1,n):            \n        if IsPrime(i):                \n            primes.append(i)        \n    return primes    \nn = int(input(\""请输入一个整数：\""))    \nprint(GetPrimes(n))",TIME_LIMIT_EXCEEDED,1000,3000
1591262997832597504,1ac1c697452718cae6f56347fb0bf2473480d854f77bcfb84dd289d79169690e,2022-11-12 10:53:57,C++,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <iostream>\nusing namespace std;\n\n\nint main()\n{\n    int X, Y, Z, R;\n    cout << \""请输入三个数字X Y Z：\"" << endl;\n    cin >> X >> Y >> Z;\n    if ((X >= 0 && X <= 100) && (Y >= 0 && Y <= 100) && (Z >= 0 && Z <= 100))\n    {\n        R = X + Y - Z;\n        cout << R << endl;\n    }\n    else {\n        cout << \""您的输入超出范围\"" << endl;\n    }\n\n    system(\""pause\"");\n    return 0;\n}",WRONG_ANSWER,4,692
1591263070972850176,1ac1c697452718cae6f56347fb0bf2473480d854f77bcfb84dd289d79169690e,2022-11-12 10:54:15,C++,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <iostream>\nusing namespace std;\n\n\nint main()\n{\n    int X, Y, Z, R;\n    cout << \""请输入三个数字X Y Z：\"" << endl;\n    cin >> X >> Y >> Z;\n    if ((X >= 0 && X <= 100) && (Y >= 0 && Y <= 100) && (Z >= 0 && Z <= 100))\n    {\n        R = X + Y - Z;\n        cout << R << endl;\n    }\n    else {\n        cout << \""您的输入超出范围\"" << endl;\n    }\n\n\n    return 0;\n}",WRONG_ANSWER,4,472
1591263156637335552,0c396be113b63ac245fc6ce925111f1631870141ae26c3ec6efb7b6360bb6cf3,2022-11-12 10:54:35,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint pow(int a, int b)\n{\n\tlong long sum = 1;\n\ta = a % 10;\n\twhile (b > 0) {\n\t\tif (b % 2 == 1)\t\t\n\t\t\tsum = (sum * a) % 10;\n\t\tb /= 2;\n\t\ta = (a * a) % 10;\n\t}\n\treturn sum;\n}\nint main() \n{\n\tint n,m;\n\tscanf(\""%d\"",&m);\n\twhile (m--)\n\t{\n\t\tscanf(\""%d\"",&n);\n\t\tprintf(\""%d\\n\"",pow(n%10,n));\n\t}\n\treturn 0;\n}",WRONG_ANSWER,3,476
1591263159921475584,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-12 10:54:36,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) throws Exception{\n        Scanner scanner = new Scanner(System.in);\n        String m = scanner.next();\n        int n = Integer.parseInt(m);\n        int[] arr = new int[10];\n        int count = 0;\n        int a = 0;\n        for (int i = 0; i < n; i++) {\n            arr[i] = scanner.nextInt();\n        }\n        for (int i = 0; i < n; i++) {\n            for (int j = 0; j < arr[i]; j++) {\n                a = 6 * 6 % 10;\n            }\n            System.out.println(a);\n        }\n    }\n}\n,NON_ZERO_EXIT_CODE,238,16632
1591263196252540928,0c396be113b63ac245fc6ce925111f1631870141ae26c3ec6efb7b6360bb6cf3,2022-11-12 10:54:44,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint pow(int a, int b)\n{\n\tlong long sum = 1;\n\ta = a % 10;\n\twhile (b > 0) {\n\t\tif (b % 2 == 1)\t\t\n\t\t\tsum = (sum * a) % 10;\n\t\tb /= 2;\n\t\ta = (a * a) % 10;\n\t}\n\treturn sum;\n}\nint main() \n{\n\tint n,m;\n\tscanf(\""%d\"",&m);\n\twhile (m--)\n\t{\n\t\tscanf(\""%d\"",&n);\n\t\tprintf(\""%d\\n\"",pow(n%10,n));\n\t}\n\treturn 0;\n}",WRONG_ANSWER,3,344
1591263293417762816,cfc5530a19b24fc4b274f2e4d4609e448c7aecb0325c1717b7f709645428127b,2022-11-12 10:55:08,C++,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <map>\n#include <set>\n#include <cmath>\n#include <queue>\n#include <stack>\n#include <cstdio>\n#include <string>\n#include <vector>\n#include <cstring>\n#include <iomanip>\n#include <iostream>\n#include <algorithm>\n#define inf 1000000007\n#define wc 1e-8\nusing namespace std;\ntypedef long long ll;\nint prime[10000010];\nint isprime[10000010];\nint xxs(int n)\n{\n    int ct=0;\n    for(int i=2; i<=n; i++)\n    {\n        if(!isprime[i])\n        {\n            prime[ct++]=i;\n            isprime[i]=i;\n        }\n        for(int j=0; j<ct&&prime[j]*i<=n; j++)\n        {\n            isprime[prime[j]*i]=prime[j];\n            if(!(i%prime[j]))\n                break;\n        }\n    }\n    return ct;\n}\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    printf(\""%d\\n\"",xxs(n));\n    return 0;\n}",ACCEPTED,8,696
1591263352402259968,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-12 10:55:22,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int N=10005;\nll a[N];\nll b[N];\nll c[N];\nint main(){\n    int n;\n    cin>>n;\n    c[0]=0;\n    for(int i=1;i<=n;i++)\n        cin>>a[i];\n    for(int i=1;i<=n;i++)\n        cin>>b[i];\n    for(int i=1;i<=n;i++){\n        c[i]=b[i]-a[i]+c[i-1];\n    }\n    sort(c,c+n+1);\n    cout<<c[n];\n    return 0;\n}",WRONG_ANSWER,4,476
1591263372052574208,1ac1c697452718cae6f56347fb0bf2473480d854f77bcfb84dd289d79169690e,2022-11-12 10:55:26,C++,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <iostream>\nusing namespace std;\n\n\nint main()\n{\n    int X, Y, Z, R;\n    cin >> X >> Y >> Z;\n    if ((X >= 0 && X <= 100) && (Y >= 0 && Y <= 100) && (Z >= 0 && Z <= 100))\n    {\n        R = X + Y - Z;\n        cout << R << endl;\n    }\n\n    system(\""pause\"");\n    return 0;\n}",ACCEPTED,8,704
1591263401916039168,99481c5a0804ff1b45cf32a79326675aa759c0780ab1ad0d29f845666cb83208,2022-11-12 10:55:33,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016," #include<stdio.h>\n#include<string.h>\n#include<math.h>\n\nint flag[10006];\nint num[10000],total,now,n;\n\nvoid solve(int index,int Mul,int K){\n      int i,t;\n   if(K==0){\n    now+=n/Mul;\n    return;\n   }\n   for(i=index;i<total-K+1;i++){\n     Mul*=num[i];\n     t=now;\n     if(Mul<=n){\n              solve(i+1,Mul,K-1);\n     }\n     if(t==now)//优化剪枝（1）\n      return;\n           Mul/=num[i];\n   }\n}\n\nint Judge(int x){\n int t,i;\n t=sqrt(x*1.0);\n for(i=2;i<=t;i++)\n  if(n%i==0)\n   return 0;\n return 1;\n}\n\nint main(){\n    int i,j,t,Count;\n memset(flag,0,sizeof(flag));\n for(i=2;i<=10000;i++){\n  if(flag[i])\n   continue;\n  for(j=2;j*i<=10000;j++)\n   flag[i*j]=1;\n }\n while(scanf(\""%d\"",&n)==1){\n  Count=0;\n  if(n<=10000){\n   for(i=2;i<n;i++)\n    if(!flag[i])\n     Count++;\n  }\n  else{\n   t=sqrt(1.0*n);\n   total=0;\n   for(i=2;i<=t;i++)\n    if(!flag[i])\n     num[total++]=i;\n   for(i=1;i<=total;i++){\n    now=0;\n    solve(0,1,i);\n    if(now==0)//优化(2)\n     break;\n    if(i&1)\n       Count+=now;\n    else\n       Count-=now;\n   }\n   Count-=total;\n   Count=n-Count-1;\n   if(Judge(n))\n    Count--;\n  }\n  printf(\""%d\\n\"",Count);\n }\n return 0;\n}\n",ACCEPTED,8,472
1591263437903147008,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-12 10:55:42,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        String m = scanner.next();\n        int n = Integer.parseInt(m);\n        int[] arr = new int[10];\n        int count = 0;\n        int a = 0，b;\n        for (int i = 0; i < n; i++) {\n            b = scanner.nextInt();\n            arr[i] = b;\n        }\n        for (int i = 0; i < n; i++) {\n            for (int j = 0; j < arr[i]; j++) {\n                a = 6 * 6 % 10;\n            }\n            System.out.println(a);\n        }\n    }\n}\n,COMPILE_ERROR,0,0
1591263492911443968,6a835d762a87e93baf4142897168374dc31e9da90b86c19ed82f21159b644272,2022-11-12 10:55:55,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    if(X>=0&&X<=100&&Y>=0&&Y<=100&&Z>=0&&Z<=100)\n        printf(\""%d\"",X+Y-Z);\n}",ACCEPTED,6,332
1591263568639627264,6a835d762a87e93baf4142897168374dc31e9da90b86c19ed82f21159b644272,2022-11-12 10:56:13,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int t,i,n;\n    scanf(\""%d\"",&t);\n    for(i=0;i<t;i++)\n       {\n\n      scanf(\""%d\"",&n);\n     if(n!=0)\n        printf(\""6\\n\"");\n    else\n        printf(\""1\\n\"");\n        }\n}\n",ACCEPTED,9,312
1591263717214433280,6a835d762a87e93baf4142897168374dc31e9da90b86c19ed82f21159b644272,2022-11-12 10:56:49,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main(){\n    int n;\n    scanf(\""%d\"",&n);\n    int wi[n],wj[n],w[n];\n    int i,max=0,sum=0;\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&wi[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&wj[i]);\n\n    for(i=0;i<n;i++)\n        w[i]=wj[i]-wi[i];\n\n    for(i=0;i<n;i++)\n    {\n        sum+=w[i];\n        if(max<sum) max=sum;\n        if(sum<0) {\n            sum=0;\n            continue;\n        }\n    }\n    printf(\""%d\"",max);\n}\n\n\n\n",ACCEPTED,4,200
1591263719747813376,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-12 10:56:49,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) throws Exception{\n        Scanner scanner = new Scanner(System.in);\n        String m = scanner.next();\n        int n = Integer.parseInt(m);\n        int[] arr = new int[10];\n        int count = 0;\n        int a = 0, b;\n        for (int i = 0; i < n; i++) {\n            b = scanner.nextInt();\n            arr[i] = b;\n        }\n        for (int i = 0; i < n; i++) {\n            for (int j = 0; j < arr[i]; j++) {\n                a = 6 * 6 % 10;\n            }\n            System.out.println(a);\n        }\n    }\n}\n",NON_ZERO_EXIT_CODE,252,16724
1591263823728803840,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-12 10:57:14,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int N=10005;\nll a[N];\nll b[N];\nll c[N];\nint main(){\n    ll n;\n    cin>>n;\n    c[0]=0;\n    for(ll i=1;i<=n;i++)\n        cin>>a[i];\n    for(ll i=1;i<=n;i++)\n        cin>>b[i];\n    for(ll i=1;i<=n;i++){\n        c[i]=b[i]-a[i]+c[i-1];\n    }\n    sort(c,c+n+1);\n    cout<<c[n];\n    return 0;\n}",WRONG_ANSWER,5,540
1591264026796032000,0ac60c8cba5dc039a812c57a79304a29dc187bee37ef204107b64c7a81bc6988,2022-11-12 10:58:02,Python,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"import math\nn=int(input())\nc=0\nfor i in range(2,n+1) :\n    temp=True\n    for j in range(2,math.floor(i**0.5)+1):\n        if i%j==0 :\n            temp=False\n            break\n    if temp :\n        c+=1\nprint(c)",ACCEPTED,305,2880
1591264057544474624,0c396be113b63ac245fc6ce925111f1631870141ae26c3ec6efb7b6360bb6cf3,2022-11-12 10:58:10,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"def IsPrime(k):        \n    if k == 1:\n        return False        \n    for i in range(2,k):            \n        if k % i == 0:                \n            return False        \n    return True\ndef GetPrimes(n):        \n    primes = []        \n    for i in range (1,n):            \n        if IsPrime(i):                \n            primes.append(i)        \n    return primes    \nn = int(input(\""请输入一个整数：\""))    \nprint(GetPrimes(n))",TIME_LIMIT_EXCEEDED,1000,2996
1591264134203772928,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-12 10:58:28,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) throws Exception{\n        Scanner scanner = new Scanner(System.in);\n        int n = scanner.nextInt();\n        int[] arr = new int[10];\n        int count = 0;\n        int a = 0, b;\n        for (int i = 0; i < n; i++) {\n            b = scanner.nextInt();\n            arr[i] = b;\n        }\n        for (int i = 0; i < n; i++) {\n            for (int j = 0; j < arr[i]; j++) {\n                a = 6 * 6 % 10;\n            }\n            System.out.println(a);\n        }\n    }\n}\n",WRONG_ANSWER,244,16468
1591264332892143616,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-12 10:59:15,Java,0.0,1590734963702620160,1590734503495200768,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int n = scanner.nextInt();\n        int arr1[] = new int[n];\n        int arr2[] = new int[n];\n        int arr3[] = new int[n];\n        for (int i = 0; i < n; i++) {\n            arr1[i] = scanner.nextInt();\n        }\n        for (int i = 0; i < n; i++) {\n            arr2[i] = scanner.nextInt();\n            arr3[i] = arr2[i] - arr1[i];\n        }\n        int max = arr3[0];\n        for (int i = 1; i < n - 1; i++) {\n            arr3[i] = arr3[i - 1] + arr3[i];\n            if (arr3[i] > max)\n                max = arr3[i];\n        }\n        System.out.print(max);\n    }\n},WRONG_ANSWER,124,16116
1591264371999838208,453285058ad721dec4e5d0f61707f295aaddf066021a84ead6a70901f10455df,2022-11-12 10:59:25,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}\n",ACCEPTED,4,192
1591264418594336768,d5db2853d0fce01dd43b2b6adf379841403b78fda0e6cb22c82f6f2b59da60dc,2022-11-12 10:59:36,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#define MAX 100\nmain(){\n\tint n,i,s=0,w1[MAX],w2[MAX],max=0;\n\tscanf(\""%d\\n\"",&n);\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&w1[i]);\n\t}\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&w2[i]);\n\t}\n\tfor(i=0;i<n;i++){\n\t\tmax=s;\n\t\ts=s+w2[i]-w1[i];\n\t\tif(s<max){\n\t\t\tprintf(\""%d\"",max);\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn 0;\n}",WRONG_ANSWER,3,320
1591264527453302784,d5db2853d0fce01dd43b2b6adf379841403b78fda0e6cb22c82f6f2b59da60dc,2022-11-12 11:00:02,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#define MAX 100\nmain(){\n\tint n,i,s=0,w1[MAX],w2[MAX],max=0;\n\tscanf(\""%d\\n\"",&n);\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&w1[i]);\n\t}\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&w2[i]);\n\t}\n\tfor(i=0;i<n;i++){\n\t\tmax=s;\n\t\ts=s+w2[i]-w1[i];\n\t\tif(s<max){\n\t\t\tprintf(\""%d\\n\"",max);\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn 0;\n}",WRONG_ANSWER,3,316
1591264566133194752,0c396be113b63ac245fc6ce925111f1631870141ae26c3ec6efb7b6360bb6cf3,2022-11-12 11:00:11,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"def IsPrime(k):        \n    if k == 1:\n        return False        \n    for i in range(2,k):            \n        if k % i == 0:                \n            return False        \n    return True\ndef GetPrimes(n):        \n    primes = []        \n    for i in range (1,n):            \n        if IsPrime(i):                \n            primes.append(i)        \n    return primes    \nn = int(input(\""请输入一个整数：\""))    \nprint(GetPrimes(n))",TIME_LIMIT_EXCEEDED,1000,2992
1591264592053997568,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-12 11:00:17,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int N=1e9+10;\nll a[N];\nll b[N];\nll c[N];\nint main(){\n    ll n;\n    cin>>n;\n    c[0]=0;\n    for(ll i=1;i<=n;i++)\n        cin>>a[i];\n    for(ll i=1;i<=n;i++)\n        cin>>b[i];\n    for(ll i=1;i<=n;i++){\n        c[i]=b[i]-a[i]+c[i-1];\n    }\n    sort(c+1,c+n+1);\n    cout<<c[n];\n    return 0;\n}",COMPILE_ERROR,0,0
1591264686715219968,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-12 11:00:40,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int N=1e8+10;\nll a[N];\nll b[N];\nll c[N];\nint main(){\n    ll n;\n    cin>>n;\n    c[0]=0;\n    for(ll i=1;i<=n;i++)\n        cin>>a[i];\n    for(ll i=1;i<=n;i++)\n        cin>>b[i];\n    for(ll i=1;i<=n;i++){\n        c[i]=b[i]-a[i]+c[i-1];\n    }\n    sort(c+1,c+n+1);\n    cout<<c[n];\n    return 0;\n}",COMPILE_ERROR,0,0
1591264703580516352,0c396be113b63ac245fc6ce925111f1631870141ae26c3ec6efb7b6360bb6cf3,2022-11-12 11:00:44,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"prime_array = [2,3]    \ndef IsPrime(k):        \n    if k == 1:            \n        return False        \n    if k == 2:            \n        return True        \n    for i in range(len(prime_array)):            \n        if k > prime_array[i] and k % prime_array[i] == 0:\n            return False        \n    #如果k是素数，把它加入素数数组        \n    prime_array.append(k)        \n    return True\n\ndef GetPrimes(n):        \n    primes = []        \n    for i in range(1,n+1):            \n        if IsPrime(i):                \n            primes.append(i)        \n    return primes    \nn = int(input(\""请输入一个整数：\""))    \nprint(GetPrimes(n))",TIME_LIMIT_EXCEEDED,1000,3152
1591264781397438464,0c396be113b63ac245fc6ce925111f1631870141ae26c3ec6efb7b6360bb6cf3,2022-11-12 11:01:02,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"def GetPrimes(n):        \n    primes = []        \n    prime = []        \n    for i in range(n+1):            \n        primes.append(True)        \n    for i in range(2,n+1):            \n    #从第二个素数2开始删除，删除一轮下来后，如果接下来的primes[i]是TRUE，那么其对应的整数就是素数            \n        if primes[i] == True:                \n            p = i                \n            j = 2                \n            #把当前素数的倍数全部删除                \n            while p*j <= n:                    \n                primes[p*j] = False                    \n                j += 1        \n   for i in range(2,len(primes)):            \n       if primes[i] == True:                \n           prime.append(i)        \n   return prime   \nn = int(input(\""请输入一个整数：\""))    \nprint(GetPrimes(n))",NON_ZERO_EXIT_CODE,16,3020
1591264882853482496,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-12 11:01:27,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t    Scanner sc = new Scanner(System.in);\n\t    int n = sc.nextInt();\n\t    for (int i = 0; i < n; i++) {\n            long j = sc.nextInt();\n            if (j == 0) {\n                System.out.println(1);\n            } else {\n                System.out.println(6);\n            }\n        }\n\t}\n\t\n},NON_ZERO_EXIT_CODE,256,16484
1591264965154111488,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-12 11:01:46,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int N=100000000;\nll a[N];\nll b[N];\nll c[N];\nint main(){\n    ll n;\n    cin>>n;\n    c[0]=0;\n    for(ll i=1;i<=n;i++)\n        cin>>a[i];\n    for(ll i=1;i<=n;i++)\n        cin>>b[i];\n    for(ll i=1;i<=n;i++){\n        c[i]=b[i]-a[i]+c[i-1];\n    }\n    sort(c+1,c+n+1);\n    cout<<c[n];\n    return 0;\n}",COMPILE_ERROR,0,0
1591264980194889728,0c396be113b63ac245fc6ce925111f1631870141ae26c3ec6efb7b6360bb6cf3,2022-11-12 11:01:50,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint IsPrime(int x){\n    int j,set=1,a;\n    for(j=2;j<x;j++)\n    {\n    \tset=1;\n    \tif(x%j==0)\n    \t{\n    \t\ta=0;\n    \t\tset=2;\n    \t\tbreak;\n\t\t}\n\t}\n\tif(set!=2&&x!=1)\n\t{\n\t\ta=1;\n\t}\n\treturn a;\n}\nint main(void){\n  int x,n,i,d=0;\n  scanf(\""%d\"",&n);\n  for(i=1;i<=n;i++)\n  {\n  \tx=IsPrime(i);\n  \tif(x==1)\n  \t{\n  \t\tprintf(\""%d\\t\"",i);\n  \t\td++;\n\t}\n\tif(x==1&&(d%10==0||d%10==5))\n\t{\n\t\tprintf(\""\\n\"");\n\t}\n  }\n}",WRONG_ANSWER,930,312
1591265017025073152,a25899e641f0105a5c17849cf5d8b5bb05816bcbb86fbf389b1990a5511e1d94,2022-11-12 11:01:58,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n#define MAX 100\nint main(void){\n\tint t,n[MAX],i,sum;\n\tscanf(\""%d\\n\"",&t);\n    for(i=0;i<t;i++){\n        scanf(\""%d\"",&n[i]);\n    }\n\tfor(i=0;i<t;i++){\n\t\tsum=pow(6,n[i]);\n        sum=sum%10;\n        printf(\""%d\\n\"",sum);\n\t}\n    return 0;\n}",WRONG_ANSWER,6,320
1591265017188651008,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-12 11:01:59,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst ll N=100000000;\nll a[N];\nll b[N];\nll c[N];\nint main(){\n    ll n;\n    cin>>n;\n    c[0]=0;\n    for(ll i=1;i<=n;i++)\n        cin>>a[i];\n    for(ll i=1;i<=n;i++)\n        cin>>b[i];\n    for(ll i=1;i<=n;i++){\n        c[i]=b[i]-a[i]+c[i-1];\n    }\n    sort(c+1,c+n+1);\n    cout<<c[n];\n    return 0;\n}",COMPILE_ERROR,0,0
1591265039733035008,d5db2853d0fce01dd43b2b6adf379841403b78fda0e6cb22c82f6f2b59da60dc,2022-11-12 11:02:04,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#define MAX 100\nmain(){\n\tint n,i,s=0,w1[MAX],w2[MAX],max=0;\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&w1[i]);\n\t}\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&w2[i]);\n\t}\n\tfor(i=0;i<n;i++){\n\t\tmax=s;\n\t\ts=s+w2[i]-w1[i];\n\t\tif(s<max){\n\t\t\tprintf(\""%d\\n\"",max);\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn 0;\n}",WRONG_ANSWER,3,192
1591265060306071552,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-12 11:02:09,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst ll N=10000000;\nll a[N];\nll b[N];\nll c[N];\nint main(){\n    ll n;\n    cin>>n;\n    c[0]=0;\n    for(ll i=1;i<=n;i++)\n        cin>>a[i];\n    for(ll i=1;i<=n;i++)\n        cin>>b[i];\n    for(ll i=1;i<=n;i++){\n        c[i]=b[i]-a[i]+c[i-1];\n    }\n    sort(c+1,c+n+1);\n    cout<<c[n];\n    return 0;\n}",WRONG_ANSWER,6,308
1591265090022739968,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-12 11:02:16,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t    Scanner sc = new Scanner(System.in);\n\t    int n = sc.nextInt();\nfor (int i = 0; i < n; i++) {\nlong j = sc.nextInt();\n if (j == 0) {\n                System.out.println(1);\n            } else {\n                System.out.println(6);\n            }\n        }\n\t}\n\t\n},WRONG_ANSWER,255,16400
1591265212961984512,b31601c92a4a3080abbaad650e00bb77253224eab66b59a49b2118d017649c2c,2022-11-12 11:02:45,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b,c;\n    int count=0\n    scanf(\""%d/n\"",&a);\n    for(b=2;b,=a;b++){\n            for(c=2;c<b;c++)\n            {\n                if(b%c==0)\n                {\n                    break;\n                }\n            }\n            if(c==b)\n            {\n                count++;\n            }\n        \n    }\n    printf(\""%d\\n\"",count);\n    \n\n    return 0;\n}\n",COMPILE_ERROR,0,0
1591265278967721984,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-12 11:03:01,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst ll N=10000000;\nll a[N];\nll b[N];\nll c[N];\nint main(){\n    ll n;\n    cin>>n;\n    c[0]=0;\n    for(ll i=1;i<=n;i++)\n        cin>>a[i];\n    for(ll i=1;i<=n;i++)\n        cin>>b[i];\n    for(ll i=1;i<=n;i++){\n        c[i]=b[i]-a[i]+c[i-1];\n    }\n    sort(c+1,c+n+1);\n    cout<<c[n+1];\n    return 0;\n}",WRONG_ANSWER,3,328
1591265290233647104,d5db2853d0fce01dd43b2b6adf379841403b78fda0e6cb22c82f6f2b59da60dc,2022-11-12 11:03:04,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#define MAX 100\nmain(){\n\tint n,i,s=0,w1[MAX],w2[MAX],max=0;\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&w1[i]);\n\t}\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&w2[i]);\n\t}\n\tfor(i=0;i<n;i++){\n\t\tmax=s;\n\t\ts+=w2[i]-w1[i];\n\t\tif(s<max){\n\t\t\tprintf(\""%d\\n\"",max);\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn 0;\n}",WRONG_ANSWER,3,324
1591265336660393984,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-12 11:03:15,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.*;\n\npublic class Main {\npublic static void main(String[] args){\nScanner sc = new Scanner(System.in);\nint n = sc.nextInt();\nfor (int i = 0; i < n; i++) {\nlong j = sc.nextInt();\n if (j == 0) {\n                System.out.println(1);\n            } else {\nSystem.out.println(6);\n            }\n        }\n\t}\n\t\n},WRONG_ANSWER,246,19332
1591265357900353536,b31601c92a4a3080abbaad650e00bb77253224eab66b59a49b2118d017649c2c,2022-11-12 11:03:20,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b,c;\n    int count=0\n    scanf(\""%d/n\"",&a);\n    for(b=2;b<=a;b++){\n            for(c=2;c<b;c++)\n            {\n                if(b%c==0)\n                {\n                    break;\n                }\n            }\n            if(c==b)\n            {\n                count++;\n            }\n        \n    }\n    printf(\""%d\\n\"",count);\n    \n\n    return 0;\n}\n",COMPILE_ERROR,0,0
1591265405975461888,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-12 11:03:31,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.*;\n\npublic class Main {\npublic static void main(String[] args){\nScanner sc = new Scanner(System.in);\nint n = sc.nextInt();\nfor (int i = 0; i < n; i++) {\nlong j = sc.nextInt();\n if (j == 0) {\nSystem.out.println(1);\n} else {\nSystem.out.println(6);\n            }\n        }\n\t}\n\t\n},WRONG_ANSWER,266,16796
1591265512825360384,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-12 11:03:57,Java,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"import java.util.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args){\n\t    Scanner sc=new Scanner(System.in);\n\t    int n=sc.nextInt();\n\t    int i,j;\n\t    int k=0;\n\t    for(i=2;i<n;i++) {\n\t    \tj=2;\n\t    \tfor(j=2;j<Math.sqrt(i);j++) {\n\t    \t\tif(i%j==0) {\n\t    \t\t\tbreak;\n\t    \t\t}\n\t    \t}\n\t    \tif(j>Math.sqrt(i)) k++;\n\t    }\n\t    System.out.println(k);\n\t}\n\t\n}",ACCEPTED,256,19052
1591265598632407040,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-12 11:04:17,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t    Scanner sc = new Scanner(System.in);\n\t    int n = sc.nextInt();\n\t    for (int i = 0; i < n; i++) {\n            long j = sc.nextInt();\n            if (j == 0) {\n                System.out.println(1);\n            } else {\n                System.out.println(6);\n            }\n        }\n\t}\n\t\n},NON_ZERO_EXIT_CODE,257,16656
1591265643683446784,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-12 11:04:28,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst ll N=10000000;\nll a[N];\nll b[N];\nll c[N];\nll main(){\n    ll n;\n    cin>>n;\n    c[0]=0;\n    for(ll i=1;i<=n;i++)\n        cin>>a[i];\n    for(ll i=1;i<=n;i++)\n        cin>>b[i];\n    for(ll i=1;i<=n;i++){\n        c[i]=b[i]-a[i]+c[i-1];\n    }\n    sort(c+1,c+n+1);\n    cout<<c[n+1];\n    return 0;\n}",COMPILE_ERROR,0,0
1591265688143069184,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-12 11:04:38,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst ll N=10000000;\nll a[N];\nll b[N];\nll c[N];\nint main(){\n    ll n;\n    cin>>n;\n    c[0]=0;\n    for(ll i=1;i<=n;i++)\n        cin>>a[i];\n    for(ll i=1;i<=n;i++)\n        cin>>b[i];\n    for(ll i=1;i<=n;i++){\n        c[i]=b[i]-a[i]+c[i-1];\n    }\n    sort(c+1,c+n+1);\n    cout<<c[n+1];\n    return 0;\n}",WRONG_ANSWER,4,444
1591265901050114048,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-12 11:05:29,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst ll N=10000000;\nll a[N];\nll b[N];\nll c[N];\nint main(){\n    ll n;\n    cin>>n;\n    c[0]=0;\n    for(ll i=1;i<=n;i++)\n        cin>>a[i];\n    for(ll i=1;i<=n;i++)\n        cin>>b[i];\n    for(ll i=1;i<=n;i++){\n        c[i]=b[i]-a[i]+c[i-1];\n    }\n    sort(c+1,c+n+1);\n    cout<<c[n];\n    return 0;\n}",WRONG_ANSWER,4,324
1591266134849028096,73b58f8040a053b30c1b879aa24d1a92193e080fa5a7e900ef03eb0a27d9edef,2022-11-12 11:06:25,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\n#include<time.h>\nint main()\n{\n   int a;\n    a=2022;\n    printf(\""%d\"",a);\n    return 0;\n}",ACCEPTED,3,360
1591266312393895936,453285058ad721dec4e5d0f61707f295aaddf066021a84ead6a70901f10455df,2022-11-12 11:07:07,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int a,b,c,d;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    d=a+b-c;\n    printf(\""%d\"",d);\n    return 0;\n}",ACCEPTED,6,332
1591266360494174208,65ac58572a882f9de09782bce337ee95c6ab91ac6b377f6d29c3ee19b1a17f1a,2022-11-12 11:07:19,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int t, i, a[10];\n    scanf(\""%d\"", &t);\n    for (i = 1; i <= t; i++)\n    {\n        scanf(\""%d\"", &a[i]);\n    }\n    for (i = 1; i <= t; i++)\n    {\n        printf(\""6\"", a[i]);\n    }\n    return 0;\n}",WRONG_ANSWER,9,376
1591266360838127616,6bfe8913ad4f0b9ad50651b6cd09730906643db8188b3fd6e0b96b8678388075,2022-11-12 11:07:19,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst ll N=10000000;\nll a[N];\nll b[N];\nll c[N];\nint main(){\n    ll n;\n    cin>>n;\n    c[0]=0;\n    for(ll i=1;i<=n;i++)\n        cin>>a[i];\n    for(ll i=1;i<=n;i++)\n        cin>>b[i];\n    for(ll i=1;i<=n;i++){\n        c[i]=b[i]-a[i]+c[i-1];\n    }\n    sort(c,c+n+1);\n    cout<<c[n];\n    return 0;\n}",WRONG_ANSWER,4,324
1591266422221770752,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-12 11:07:34,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"a=eval(input())\nm = 0\no=int(0)\np=int(6)\nlist = map(eval,input().split())\nfor i in list:\n    m=m+1\n    if 0<=i<=1000000000:\n        if m<a:\n            if i>0:\n                print(p)\n            else:\n                print(o)\n        if m==a:\n            if i>0:\n                print(p,end='')\n            else:\n                print(o,end='')\n                      \n",WRONG_ANSWER,34,2888
1591266456904466432,b31601c92a4a3080abbaad650e00bb77253224eab66b59a49b2118d017649c2c,2022-11-12 11:07:42,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b,c;\n    int count=0\n    scanf(\""%d/n\"",&a);\n    for(b=2;b,=a;b++){\n            for(c=2;c<b;c++)\n            {\n                if(b%c==0)\n                {\n                    break;\n                }\n            }\n            if(c==b)\n            {\n                count++;\n            }\n        \n    }\n    printf(\""%d\\n\"",count);\n    \n\n    return 0;\n}\n",COMPILE_ERROR,0,0
1591266503427665920,b31601c92a4a3080abbaad650e00bb77253224eab66b59a49b2118d017649c2c,2022-11-12 11:07:53,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b,c;\n    int count=0;\n    scanf(\""%d/n\"",&a);\n    for(b=2;b,=a;b++){\n            for(c=2;c<b;c++)\n            {\n                if(b%c==0)\n                {\n                    break;\n                }\n            }\n            if(c==b)\n            {\n                count++;\n            }\n        \n    }\n    printf(\""%d\\n\"",count);\n    \n\n    return 0;\n}\n",COMPILE_ERROR,0,0
1591266632301871104,65ac58572a882f9de09782bce337ee95c6ab91ac6b377f6d29c3ee19b1a17f1a,2022-11-12 11:08:24,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int t, i, a[10];\n    scanf(\""%d\"", &t);\n    for (i = 1; i <= t; i++)\n    {\n        scanf(\""%d\"", &a[i]);\n    }\n    for (i = 1; i <= t; i++)\n    {\n        printf(\""6\\n\"", a[i]);\n    }\n    return 0;\n}",WRONG_ANSWER,9,324
1591266713340018688,b31601c92a4a3080abbaad650e00bb77253224eab66b59a49b2118d017649c2c,2022-11-12 11:08:43,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b,c;\n    int count=0;\n        scanf(\""%d\"",&a);\n    for(b=2;b<=a;b++)\n        {\n            for(c=2;c<b;c++)\n            {\n                if(b%c==0)\n                {\n                    break;\n                }\n            }\n            if(c==b)\n            {\n                count++;\n            }\n\n    }\n    printf(\""%d\\n\"",count);\n\n\n    return 0;\n}\n",ACCEPTED,957,324
1591266815437770752,217f1946625720e554af7294d3599b943eea3b430c0df7aa0c5c70abe9904e56,2022-11-12 11:09:07,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.*;\npublic class Main{\n    public static void main(String[] args){\n        Scanner sc=new Scanner(System.in);\n        int t=sc.nextInt();\n        for(int i=1;i<t;i++){\n            int a=sc.nextInt();\n            System.out.println(6);\n        }\n        System.out.print(6);\n    }\n},NON_ZERO_EXIT_CODE,256,18880
1591267098758811648,0c396be113b63ac245fc6ce925111f1631870141ae26c3ec6efb7b6360bb6cf3,2022-11-12 11:10:15,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,#include<bits/stdc++.h>\nusing namespace std;\nint Prime[(int)1e6+5];\n \nvoid pre_prime(int x)\n{\n    Prime[1]=1;\n    for(int i=2;i<=sqrt(x);i++)\n    {\n        if(Prime[i]==0)\n            for(int j=i*i;j<=x;j+=i)\n                Prime[j]=1;\n    }\n}\n \nint main()\n{\n    int n;\n    while(cin>>n)\n    {\n        pre_prime(n);\n        int count=0;\n        for(int i=1;i<=n;i++)\n            if(Prime[i]==0)\n                count++;\n        cout<<count<<endl;\n    }\n},COMPILE_ERROR,0,0
1591267181382402048,0c396be113b63ac245fc6ce925111f1631870141ae26c3ec6efb7b6360bb6cf3,2022-11-12 11:10:35,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,#include <stdio.h>\nusing namespace std;\nint Prime[(int)1e6+5];\n \nvoid pre_prime(int x)\n{\n    Prime[1]=1;\n    for(int i=2;i<=sqrt(x);i++)\n    {\n        if(Prime[i]==0)\n            for(int j=i*i;j<=x;j+=i)\n                Prime[j]=1;\n    }\n}\n \nint main()\n{\n    int n;\n    while(cin>>n)\n    {\n        pre_prime(n);\n        int count=0;\n        for(int i=1;i<=n;i++)\n            if(Prime[i]==0)\n                count++;\n        cout<<count<<endl;\n    }\n},COMPILE_ERROR,0,0
1591267314983546880,d5db2853d0fce01dd43b2b6adf379841403b78fda0e6cb22c82f6f2b59da60dc,2022-11-12 11:11:06,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"/*\n#include <stdio.h>\n#define MAX 100\nmain(){\n\tint n,i,s=0,w1[MAX],w2[MAX],max=0;\n\tscanf(\""%d\\n\"",&n);\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&w1[i]);\n\t}\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&w2[i]);\n\t}\n\tfor(i=0;i<n;i++){\n\t\tmax=s;\n\t\ts=s+w2[i]-w1[i];\n\t\tif(s<max){\n\t\t\tprintf(\""%d\"",max);\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn 0;\n}\n*/\n#include <stdio.h>\n#define MAX 100\nmain(){\n\tint n,i,s=0,w1[MAX],w2[MAX],max=0;\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&w1[i]);\n\t}\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&w2[i]);\n\t}\n\tfor(i=0;i<n;i++){\n\t\ts+=w2[i]-w1[i];\n\t\tif(s>max){\n            max=s;\n\t\t}\n\t}\n\tprintf(\""%d\\n\"",max);\n\treturn 0;\n}",WRONG_ANSWER,3,184
1591267461700325376,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-12 11:11:41,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.*;\npublic class Main {\npublic static void main(String[] args){\nScanner sc = new Scanner(System.in);\nint n = sc.nextInt();\nfor (int i = 0; i < n; i++) {\nlong j = sc.nextInt();\nif (j == 0) {\nSystem.out.println(1);\n} else {\n                System.out.println(6);\n            }\n        }\n\t}\n\t\n},WRONG_ANSWER,261,16272
1591267573994401792,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-12 11:12:08,Java,0.0,1590734963702620160,1590734503495200768,1049226928954454016,import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int n = scanner.nextInt();\n        int arr1[] = new int[n];\n        int arr2[] = new int[n];\n        int arr3[] = new int[n];\n        for (int i = 0; i < n; i++) {\n            arr1[i] = scanner.nextInt();\n        }\n        for (int i = 0; i < n; i++) {\n            arr2[i] = scanner.nextInt();\n            arr3[i] = arr2[i] - arr1[i];\n        }\n        int max = arr3[0];\n        for (int i = 1; i < n - 1; i++) {\n            arr3[i] = arr3[i - 1] + arr3[i];\n            if (arr3[i] > max)\n                max = arr3[i];\n        }\n        System.out.print(max);\n    }\n},WRONG_ANSWER,114,16928
1591267618009452544,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-12 11:12:19,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) throws Exception{\n        Scanner scanner = new Scanner(System.in);\n        int n = scanner.nextInt();\n        int[] arr = new int[10];\n        int count = 0;\n        int a = 0, b;\n        for (int i = 0; i < n; i++) {\n            b = scanner.nextInt();\n            arr[i] = b;\n        }\n        for (int i = 0; i < n; i++) {\n            for (int j = 0; j < arr[i]; j++) {\n                a = 6 * 6 % 10;\n            }\n            System.out.println(a);\n        }\n    }\n}\n",NON_ZERO_EXIT_CODE,243,18828
1591267637336805376,d5db2853d0fce01dd43b2b6adf379841403b78fda0e6cb22c82f6f2b59da60dc,2022-11-12 11:12:23,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#define MAX 100\nmain(){\n\tint n,i,s=0,w1[MAX],w2[MAX],max=0;\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&w1[i]);\n\t}\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&w2[i]);\n\t}\n\tmax=w2[0]-w2[1];\n\tfor(i=i;i<n;i++){\n\t\ts+=w2[i]-w1[i];\n\t\tif(s>max){\n            max=s;\n\t\t}\n\t}\n\tprintf(\""%d\\n\"",max);\n\treturn 0;\n}",WRONG_ANSWER,3,320
1591267778546438144,0c396be113b63ac245fc6ce925111f1631870141ae26c3ec6efb7b6360bb6cf3,2022-11-12 11:12:57,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"def get_prime_list(n):\n    lst_num = list(range(2,n+1))\n    lst_prime = []\n    while lst_num:\n        m = lst_num.pop(0)\n        lst_prime.append(m)\n        i = 0\n        while i<len(lst_num):\n            if lst_num[i]%m == 0:\n                lst_num.pop(i)\n            else:\n                i+=1\n    return lst_prime\n\nif __name__ == '__main__':\n    n = int(input())\n    print(*get_prime_list(n))\n",TIME_LIMIT_EXCEEDED,1000,6212
1591267782765883392,d5db2853d0fce01dd43b2b6adf379841403b78fda0e6cb22c82f6f2b59da60dc,2022-11-12 11:12:58,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#define MAX 100\nmain(){\n\tint n,i,s=0,w1[MAX],w2[MAX],max=0;\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&w1[i]);\n\t}\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&w2[i]);\n\t}\n\tmax=w2[0]-w2[1];\n\tfor(i=1;i<n;i++){\n\t\ts+=w2[i]-w1[i];\n\t\tif(s>max){\n            max=s;\n\t\t}\n\t}\n\tprintf(\""%d\\n\"",max);\n\treturn 0;\n}",WRONG_ANSWER,3,188
1591267866136064000,d5db2853d0fce01dd43b2b6adf379841403b78fda0e6cb22c82f6f2b59da60dc,2022-11-12 11:13:18,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nmain(){\n\tint n,i,s=0,w1[20],w2[20],max=0;\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&w1[i]);\n\t}\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&w2[i]);\n\t}\n\tmax=w2[0]-w2[1];\n\tfor(i=1;i<n;i++){\n\t\ts+=w2[i]-w1[i];\n\t\tif(s>max){\n            max=s;\n\t\t}\n\t}\n\tprintf(\""%d\\n\"",max);\n\treturn 0;\n}",WRONG_ANSWER,3,192
1591267916031524864,217f1946625720e554af7294d3599b943eea3b430c0df7aa0c5c70abe9904e56,2022-11-12 11:13:30,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.*;\npublic class Main{\n    public static void main(String[] args){\n        Scanner sc=new Scanner(System.in);\n        int t=sc.nextInt();\n        for(int i=1;i<t;i++){\n            int a=sc.nextInt();\n            System.out.println(6);\n        }\n        System.out.print(6);\n        exit(0);\n    }\n},COMPILE_ERROR,0,0
1591267955827085312,d5db2853d0fce01dd43b2b6adf379841403b78fda0e6cb22c82f6f2b59da60dc,2022-11-12 11:13:39,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nmain(){\n\tint n,i,s=0,w1[20],w2[20],max=0;\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&w1[i]);\n\t}\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&w2[i]);\n\t}\n\tmax=w2[0]-w1[0];\n\tfor(i=1;i<n;i++){\n\t\ts+=w2[i]-w1[i];\n\t\tif(s>max){\n            max=s;\n\t\t}\n\t}\n\tprintf(\""%d\\n\"",max);\n\treturn 0;\n}",WRONG_ANSWER,3,344
1591268078279766016,65ac58572a882f9de09782bce337ee95c6ab91ac6b377f6d29c3ee19b1a17f1a,2022-11-12 11:14:08,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int t, i, a[10],b,c;\n    scanf(\""%d\"", &t);\n    for (i = 1; i <= t; i++)\n    {\n        scanf(\""%d\"", &a[i]);\n    }\n    for (i = 1; i <= t; i++)\n    {\n        b=pow(6,i);\n        c=b%10;\n        printf(\""%d\\n\"",c);\n    }\n    return 0;\n}",WRONG_ANSWER,11,320
1591268101268746240,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-12 11:14:14,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.*;\n\npublic class Main {\npublic static void main(String[]args){\nScanner sc = new Scanner(System.in);\nint n = sc.nextInt();\nfor (int i = 0;i < n; i++){\nlong j = sc.nextInt();\nif (j == 0) {\nSystem.out.println(1);\n} else {\n                System.out.println(6);\n            }\n        }\n}\n\n},NON_ZERO_EXIT_CODE,252,21472
1591268155287212032,0c396be113b63ac245fc6ce925111f1631870141ae26c3ec6efb7b6360bb6cf3,2022-11-12 11:14:27,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"import math\ndef sushu(n):\n    if n<2:\n        print(\""错误：该数之前无素数\"")\n    if n==2:\n        print(\""2\"")\n    if n>2:\n        print(\""2\"")\n        for i in range(3,n+1):\n            for j in range(2,int(math.sqrt(i)+1)):\n                if i%j==0:\n                    break\n            else:\n                print(i)\nn=int(input(\""n=\""))\nsushu(n)\n",WRONG_ANSWER,143,3008
1591268463920873472,0c396be113b63ac245fc6ce925111f1631870141ae26c3ec6efb7b6360bb6cf3,2022-11-12 11:15:40,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016," \na = int(input('a:'))\nb = int(input('b:'))\nc = []\nfor num in range(a,b+1):\n    if num>1:\n        for i in range(2,num):\n            if (num%i)==0:\n                break\n        else:\n            c.append(num)\nprint('素数个数：{}，最后一个：{}'.format(len(c),max(c)))",NON_ZERO_EXIT_CODE,18,2744
1591268514499989504,217f1946625720e554af7294d3599b943eea3b430c0df7aa0c5c70abe9904e56,2022-11-12 11:15:52,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\npublic class Main{\n    public static void main(String[] args){\n        Scanner sc=new Scanner(System.in);\n        int t=sc.nextInt();\n        for(int i=1;i<t;i++){\n            int a=sc.nextInt();\n            System.out.println(6);\n        }\n        System.out.print(6);\n    }\n},WRONG_ANSWER,246,16464
1591268556015210496,e0156cb930d51b3d5482d43809e7b2c1f54a6b8623fccfa3202e2e53ddf1ffbf,2022-11-12 11:16:02,C++,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<iostream>\n\n#include<stdio.h>\n\n#include<stdlib.h>\n\n#include<bits/stdc++.h>\n\n#include<math.h>\n\nusing namespace std;\n\nint fun(int n){\n\n    if (n==0) return 1;\n\n    int t=6;\n\n    for (int i=0;i<n;++i){\n\n        t=(t*t)%10;\n\n}\n\n  return t;\n\n}\n\nint main(){\n\n     int x;\n\n     cin >> x;\n\n     int n;\n\n     for(int i=0;i<x;++i){\n\n            cin >> n;\n\n            cout << fun(n);\n\n            printf(\""\\n\"");  \n\n            }\n\n        return 0;\n\n}",ACCEPTED,13,448
1591268782956392448,b31601c92a4a3080abbaad650e00bb77253224eab66b59a49b2118d017649c2c,2022-11-12 11:16:56,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b,c;\n    scanf(\""%d/n\"",&a);\n    for(b=0,b<a,b++){\n        scanf(\""%d\"",&c)\n        if(c>0){\n          printf(\""6\\n\"");  \n        }\n        else{\n            printf(\""1\\n\"");\n        }\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1591268840850370560,ece045c1570c74e6800520e16047010817642535f83b9f2b4524ebdcf9d7925a,2022-11-12 11:17:10,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include<math.h>\nint main() {\n    int i,t;\n    scanf(\""%d\"",&t);\n      int a[t];\n    long long int n;\n    for(i=0;i<t;i++)\n    {\n    \tscanf(\""%d\"",&a[i]);\n\t}\n\t  for(i=0;i<t;i++)\n    {\n        n=pow(6,a[i]);\n    \tprintf(\""%d\\n\"",n%10);\n\t}\n\t\n\treturn 0;\n}\n",WRONG_ANSWER,7,332
1591268968323682304,8d1179920d906e72e4154239cf795c881b2870d2672de88a3bf7524682292a30,2022-11-12 11:17:41,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,a[n],b[n],max,i,j,t[100],m,x;\n    m=0;\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++)\n        scanf(\""%d\"",&a[n]);\n    for(i=1;i<=n;i++)\n        scanf(\""%d\"",&b[n]);\n    for(i=1;i<=n;i++)\n    {\n        for(j=i;j<=n;j++)\n            t[m+1]=t[m]+b[j]-a[j];\n            m++;\n    }\n    for(i=1;i<100;i++)\n    {\n        for(j=i;j<100;j++)\n            if(t[i]<t[j])\n            {\n                x=t[j];\n                t[i]=x;\n                max=t[j];\n            }\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",WRONG_ANSWER,3,312
1591268999168593920,65ac58572a882f9de09782bce337ee95c6ab91ac6b377f6d29c3ee19b1a17f1a,2022-11-12 11:17:48,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int t, i, a[10],b,c;\n    scanf(\""%d\"", &t);\n    for (i = 1; i <= t; i++)\n    {\n        scanf(\""%d\"", &a[i]);\n    }\n    for (i = 1; i <= t; i++)\n    {\n        b=pow(6,i);\n        c=b%10;\n        printf(\""%d\\n\"",c);\n    }\n    return 0;\n}",WRONG_ANSWER,11,484
1591269033729658880,0c396be113b63ac245fc6ce925111f1631870141ae26c3ec6efb7b6360bb6cf3,2022-11-12 11:17:56,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"def GetPrimes(n):        \n    primes = []        \n    prime = []        \n    for i in range(n+1):            \n        primes.append(True)        \n    for i in range(2,n+1):            \n    #从第二个素数2开始删除，删除一轮下来后，如果接下来的primes[i]是TRUE，那么其对应的整数就是素数            \n        if primes[i] == True:                \n            p = i                \n            j = 2                \n            #把当前素数的倍数全部删除                \n            while p*j <= n:                    \n                primes[p*j] = False                    \n                j += 1        \n   for i in range(2,len(primes)):            \n       if primes[i] == True:                \n           prime.append(i)        \n   return prime   \nn = int(input(\""请输入一个整数：\""))    \nprint(GetPrimes(n))",NON_ZERO_EXIT_CODE,16,2752
1591269048774627328,e0156cb930d51b3d5482d43809e7b2c1f54a6b8623fccfa3202e2e53ddf1ffbf,2022-11-12 11:18:00,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n\n{\n\n\tint n,f;\tcin >> n;\n\n\tint cnt = 0;\n\n\t\tfor (int i = 2; i <= n; i++)\n\n\t\t{\n\n\t\t\tf=1;\n\n\t\t\tfor(int j = 2; j <=sqrt(i); j++)\n\n\t\t\t{\n\n\t\t\t\tif(i%j==0){\n\n\t\t\t\t\tf=0;\n\n\t\t\t\t\tbreak;\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\tif(f){\n\n\t\t\t//cout << i << endl ;\n\n\t\t\tcnt++;\n\n\t\t\t}\n\n\t\t}\n\n\tcout << cnt<< endl;\n\n\treturn 0;\n\n}",COMPILE_ERROR,0,0
1591269089073500160,e0156cb930d51b3d5482d43809e7b2c1f54a6b8623fccfa3202e2e53ddf1ffbf,2022-11-12 11:18:09,C++,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n\n{\n\n\tint n,f;\tcin >> n;\n\n\tint cnt = 0;\n\n\t\tfor (int i = 2; i <= n; i++)\n\n\t\t{\n\n\t\t\tf=1;\n\n\t\t\tfor(int j = 2; j <=sqrt(i); j++)\n\n\t\t\t{\n\n\t\t\t\tif(i%j==0){\n\n\t\t\t\t\tf=0;\n\n\t\t\t\t\tbreak;\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\tif(f){\n\n\t\t\t//cout << i << endl ;\n\n\t\t\tcnt++;\n\n\t\t\t}\n\n\t\t}\n\n\tcout << cnt<< endl;\n\n\treturn 0;\n\n}",ACCEPTED,13,468
1591269103833255936,0c396be113b63ac245fc6ce925111f1631870141ae26c3ec6efb7b6360bb6cf3,2022-11-12 11:18:13,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"prime_array = [2,3]    \ndef IsPrime(k):        \n    if k == 1:            \n        return False        \n    if k == 2:            \n        return True        \n    for i in range(len(prime_array)):            \n        if k > prime_array[i] and k % prime_array[i] == 0:\n            return False        \n    #如果k是素数，把它加入素数数组        \n    prime_array.append(k)        \n    return True\n\ndef GetPrimes(n):        \n    primes = []        \n    for i in range(1,n+1):            \n        if IsPrime(i):                \n            primes.append(i)        \n    return primes    \nn = int(input(\""请输入一个整数：\""))    \nprint(GetPrimes(n))",TIME_LIMIT_EXCEEDED,1000,3120
1591269156643733504,c76414e1d2d8531a5745e9bd3192aafa7cca924e645650ffe7954c992cc13b33,2022-11-12 11:18:25,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    printf(\""2022\"");\n}",ACCEPTED,4,320
1591269165938311168,675867a135da6702ed27c0eec3e4b6d2a7d95c44854c01823fc152f0689f010d,2022-11-12 11:18:28,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int i,j,n,count;\n    int flag;\n    count = 0;\n    scanf(\""%d\"",&n);\n    for(i=2;i<n;i++){\n        for(j=2;j<i;j++){\n            if(i%j==0) {\n                flag = 0;\n                break;\n            }\n            else\n                flag=1;\n        }\n        if(flag)\n            count++;\n    }\n    printf(\""%d\"",count);\n    return 0;\n}",ACCEPTED,948,348
1591269317579177984,d5db2853d0fce01dd43b2b6adf379841403b78fda0e6cb22c82f6f2b59da60dc,2022-11-12 11:19:04,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nmain(){\n\tint n,i,j,s=0,w1[20],w2[20],max=0;\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++)\n\t\tscanf(\""%d\"",&w1[i]);\n\tfor(i=0;i<n;i++)\n\t\tscanf(\""%d\"",&w2[i]);\n\tmax=w2[1]-w1[1];\n\tfor(i=0;i<n;i++)\n\t\tfor(j=i,s=0;j<n;j++){\n\t\t\ts+=w2[j]-w1[j];\n\t\t\tif(s>max)\n\t\t\t\tmax=s;\n\t\t}\n\tprintf(\""%d\\n\"",max);\n\treturn 0;\n}",ACCEPTED,3,184
1591269334989737984,0c396be113b63ac245fc6ce925111f1631870141ae26c3ec6efb7b6360bb6cf3,2022-11-12 11:19:08,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"def GetPrimes(n):        \n    primes = []        \n    prime = []        \n    for i in range(n+1):            \n        primes.append(True)        \n    for i in range(2,n+1):            \n    #从第二个素数2开始删除，删除一轮下来后，如果接下来的primes[i]是TRUE，那么其对应的整数就是素数            \n        if primes[i] == True:                \n            p = i                \n            j = 2                \n            #把当前素数的倍数全部删除                \n            while p*j <= n:                    \n                primes[p*j] = False                    \n                j += 1        \n   for i in range(2,len(primes)):            \n       if primes[i] == True:                \n           prime.append(i)        \n   return primes   \nn = int(input(\""请输入一个整数：\""))    \nprint(GetPrimes(n))",NON_ZERO_EXIT_CODE,20,5168
1591269484512477184,0c396be113b63ac245fc6ce925111f1631870141ae26c3ec6efb7b6360bb6cf3,2022-11-12 11:19:44,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"def GetPrimes(n):        \n    primes = []        \n    prime = []        \n    for i in range(n+1):            \n        primes.append(True)        \n    for i in range(2,n+1):                       \n        if primes[i] == True:                \n            p = i                \n            j = 2                               \n            while p*j <= n:                    \n                primes[p*j] = False                    \n                j += 1        \n   for i in range(2,len(primes)):            \n       if primes[i] == True:                \n           prime.append(i)        \n   return primes   \nn = int(input(\""请输入一个整数：\""))    \nprint(GetPrimes(n))",NON_ZERO_EXIT_CODE,15,2876
1591269627706015744,0c396be113b63ac245fc6ce925111f1631870141ae26c3ec6efb7b6360bb6cf3,2022-11-12 11:20:18,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"def GetPrimes(n):        \n    primes = []        \n    prime = []        \n    for i in range(n+1):            \n        primes.append(True)        \n    for i in range(2,n+1):                       \n        if primes[i] == True:                \n            p = i                \n            j = 2                               \n            while p*j <= n:                    \n                primes[p*j] = False                    \n                j += 1        \n   for i in range(2,len(primes)):            \n       if primes[i] == True:                \n           prime.append(i)        \n   return 0   \nn = int(input(\""请输入一个整数：\""))    \nprint(GetPrimes(n))",NON_ZERO_EXIT_CODE,15,2752
1591269642474160128,e0156cb930d51b3d5482d43809e7b2c1f54a6b8623fccfa3202e2e53ddf1ffbf,2022-11-12 11:20:21,C++,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n\tint n,f;\n\tcin >> n;\n\tint cnt = 0;\n\t\tfor (int i = 2; i <= n; i++)\n\t\t{\n\t\t\tf=1;\n\t\t\tfor(int j = 2; j <=sqrt(i); j++)\n\t\t\t{\n\t\t\t\tif(i%j==0){\n\t\t\t\t\tf=0;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(f){\n\t\t\tcnt++;\n\t\t\t}\n\t\t}\n\tcout << cnt<< endl;\n\treturn 0;\n}\n\n\n",ACCEPTED,16,452
1591269877732675584,c76414e1d2d8531a5745e9bd3192aafa7cca924e645650ffe7954c992cc13b33,2022-11-12 11:21:17,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d+%d-%d\"",x,y,z);\n}",WRONG_ANSWER,3,192
1591270014840274944,1ac1c697452718cae6f56347fb0bf2473480d854f77bcfb84dd289d79169690e,2022-11-12 11:21:50,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <iostream>  \nusing namespace std;\n#include <cmath>\n\nbool isPrime(int n)\n{\n    int m = 0;\n    m = n / 2;\n    for (int i = 2; i <= m; i++)\n    {\n        if (n % i == 0)\n        {\n            return false;\n        }\n    }\n    return true;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    if (n >= 2 && n <= pow(10, 5))\n    {\n        int sum = 0;\n        for (int i = 1;i <= n; i++)\n        {\n            if (isPrime(i))\n            {\n                sum = sum + 1;\n            }\n        }\n        cout << sum << endl;\n    }\n    return 0;\n}",WRONG_ANSWER,471,324
1591270205718859776,217f1946625720e554af7294d3599b943eea3b430c0df7aa0c5c70abe9904e56,2022-11-12 11:22:36,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\npublic class Main{\n    public static void main(String[] args){\n        Scanner sc=new Scanner(System.in);\n        int t=sc.nextInt();\n        for(int i=1;i<t;i++){\n            int a=sc.nextInt();\n            System.out.println(\""6\"");\n        }\n        System.out.print(\""6\"");\n    }\n}",NON_ZERO_EXIT_CODE,250,19136
1591270387982315520,0c396be113b63ac245fc6ce925111f1631870141ae26c3ec6efb7b6360bb6cf3,2022-11-12 11:23:19,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n\nint main()\n\n{\n\n    int m,i,n=0,num=0,k=0;\n\n    scanf(\""%d\"",&n);\n\n    /*********Begin*********/\n\nfor(m=2;m<=n;m++)\n\n{\n\n    for(i=2;i<m;i++)\n\n    if(m%i==0){\n\n        k++;\n\n    }\n\n    if(k==0){\n\n    printf(\""%d,\"",m);\n\n    num++;}\n\n    k=0;\n\n}\n\n    /*********End**********/ \n\n    printf(\""\\n%d以内共有%d个素数\\n\"",n,num);\n\n    return 0;\n\n}",TIME_LIMIT_EXCEEDED,1000,376
1591270431049453568,d9e13de81d487f21b11cf0fc38d2ef82b49d511a81ed1305cdfa47276a1c2e23,2022-11-12 11:23:29,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main(void)\n{\nint a=2,b=0,c=2,d=2;\nprintf(\""%d%d%d%d\"",a,b,c,d);\nreturn 0;\n}",ACCEPTED,3,184
1591270436745318400,1ac1c697452718cae6f56347fb0bf2473480d854f77bcfb84dd289d79169690e,2022-11-12 11:23:31,C++,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <iostream>  \nusing namespace std;\n#include <cmath>\n\nbool isPrime(int n)\n{\n    int m = 0;\n    m = n / 2;\n    for (int i = 2; i <= m; i++)\n    {\n        if (n % i == 0)\n        {\n            return false;\n        }\n    }\n    return true;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    if (n >= 2 && n <= pow(10, 5))\n    {\n        int sum = 0;\n        for (int i = 1;i <= n; i++)\n        {\n            if (isPrime(i))\n            {\n                sum = sum + 1;\n            }\n        }\n        cout << sum << endl;\n    }\n    return 0;\n}",WRONG_ANSWER,466,316
1591270485302771712,1ac1c697452718cae6f56347fb0bf2473480d854f77bcfb84dd289d79169690e,2022-11-12 11:23:42,C++,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <iostream>  \nusing namespace std;\n#include <cmath>\n\nbool isPrime(int n)\n{\n    int m = 0;\n    m = n / 2;\n    for (int i = 2; i <= m; i++)\n    {\n        if (n % i == 0)\n        {\n            return false;\n        }\n    }\n    return true;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    if (n >= 2 && n <= pow(10, 5))\n    {\n        int sum = 0;\n        for (int i = 2;i < n; i++)\n        {\n            if (isPrime(i))\n            {\n                sum = sum + 1;\n            }\n        }\n        cout << sum << endl;\n    }\n    return 0;\n}",ACCEPTED,470,392
1591270561127378944,0c396be113b63ac245fc6ce925111f1631870141ae26c3ec6efb7b6360bb6cf3,2022-11-12 11:24:00,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int m,i,n=0,num=0,k=0;\n    scanf(\""%d\"",&n);\nfor(m=2;m<=n;m++)\n{\n    for(i=2;i<m;i++)\n    if(m%i==0){\n        k++;\n    }\n    if(k==0){\n    printf(\""%d,\"",m);\n    num++;}\n    k=0;\n}\n    printf(\""\\n%d以内共有%d个素数\\n\"",n,num);\n    return 0;\n}",TIME_LIMIT_EXCEEDED,1000,320
1591270604932689920,c76414e1d2d8531a5745e9bd3192aafa7cca924e645650ffe7954c992cc13b33,2022-11-12 11:24:11,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x,y,z,t;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    t=x+y-z;\n    printf(\""%d\"",t);\n}\n",ACCEPTED,6,316
1591270756573581312,b31601c92a4a3080abbaad650e00bb77253224eab66b59a49b2118d017649c2c,2022-11-12 11:24:47,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b,c;\n    scanf(\""%d/n\"",&a);\n    for(b=0;b<a;b++){\n        scanf(\""%d\"",&c);\n        if(c!=0)\n         {\n          printf(\""6\\n\"");\n        }\n        else{\n            printf(\""1\\n\"");\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,74,384
1591270872676106240,8cf8229a23351e1ca2a7bfc1ad0af3ab2ad4a709a7c796637dbdea7befc2b0ec,2022-11-12 11:25:15,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a;\n    int i,j,sum,max=0;\n    scanf(\""%d\"",&a);\n    int l[a],o[a];\n    for (i=0;i<a;i++)\n        scanf(\""%d\"",&l[i]);\n    for (i=0;i<a;i++)\n        scanf(\""%d\"",&o[i]);\n    for (i=0;i<a;i++)\n    {\n        sum=0;\n        for(j=i;j<a;j++)\n        {\n            sum=sum-l[j]+o[j];\n            if(sum>max)\n                max=sum;\n        }\n\n    }\n    printf(\""%d\"",max);\n    return 0;\n}\n",ACCEPTED,3,316
1591271172170387456,0c396be113b63ac245fc6ce925111f1631870141ae26c3ec6efb7b6360bb6cf3,2022-11-12 11:26:26,C++,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <map>\n#include <set>\n#include <cmath>\n#include <queue>\n#include <stack>\n#include <cstdio>\n#include <string>\n#include <vector>\n#include <cstring>\n#include <iomanip>\n#include <iostream>\n#include <algorithm>\n#define inf 1000000007\n#define wc 1e-8\nusing namespace std;\ntypedef long long ll;\nint prime[10000010];\nint isprime[10000010];\nint xxs(int n)\n{\n    int ct=0;\n    for(int i=2; i<=n; i++)\n    {\n        if(!isprime[i])\n        {\n            prime[ct++]=i;\n            isprime[i]=i;\n        }\n        for(int j=0; j<ct&&prime[j]*i<=n; j++)\n        {\n            isprime[prime[j]*i]=prime[j];\n            if(!(i%prime[j]))\n                break;\n        }\n    }\n    return ct;\n}\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    printf(\""%d\\n\"",xxs(n));\n    return 0;\n}",ACCEPTED,8,832
1591271234900393984,7a048784ed2975c30a64787731af1fce175495afd1f4aad852d064d00b6193b9,2022-11-12 11:26:41,Python,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"n = int(input())\nls1 = list(map(int,input().split()))\nls2 = list(map(int,input().split()))\nls3 = [(ls2[i]-ls1[i]) for i in range(0, n)]\nmax_p = 0\na = 0\nwhile a < n:\n    p = 0\n    for i in range(a, n):\n        p += ls3[i]\n        if max_p < p:\n            max_p = p\n    a+=1\nprint(max_p)\n",ACCEPTED,17,2756
1591271287375310848,7a048784ed2975c30a64787731af1fce175495afd1f4aad852d064d00b6193b9,2022-11-12 11:26:53,Python,0.0,1590681458522583041,1590676393489461248,1049226928954454016,def b(n):\n    a=[ ]\n    i=0\n    while i < n:\n        lis=[x for x in range(i) if i%x==0]\n        if not lis:\n            a.append(i)\n        i+=1\n    print (len(a))\nnum=int(input())\nb(num),NON_ZERO_EXIT_CODE,19,2776
1591271330245316608,c76414e1d2d8531a5745e9bd3192aafa7cca924e645650ffe7954c992cc13b33,2022-11-12 11:27:04,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,t,y,z,x;\n    scanf(\""%d\"",&t);\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    for(i=0;i<t;i++)\n        printf(\""6\\n\"");\n    \n}\n",WRONG_ANSWER,9,376
1591271353125244928,c3ff25cd087ae1424858449a82aca83b7f0722bfd3282b40127822bf22610ce0,2022-11-12 11:27:09,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,b;\n    scanf(\""%d\"",&a);\n    while(a>0)\n    {\n    \tb=getchar();\n        printf(\""6\\n\"");\n   \n     a--;\n\n    }\n    return 0;\n        \n    \n}",WRONG_ANSWER,9,332
1591271439217504256,c3ff25cd087ae1424858449a82aca83b7f0722bfd3282b40127822bf22610ce0,2022-11-12 11:27:30,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a;\n    scanf(\""%d\"",&a);\n    while(a>0)\n    {\n    \tb=getchar();\n        printf(\""6\\n\"");\n   \n     a--;\n\n    }\n    return 0;\n        \n    \n}",COMPILE_ERROR,0,0
1591271480258793472,c3ff25cd087ae1424858449a82aca83b7f0722bfd3282b40127822bf22610ce0,2022-11-12 11:27:39,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a;\n    scanf(\""%d\"",&a);\n    while(a>0)\n    {\n    \tb=getchar();\n        printf(\""6\\n\"");\n   \n     a--;\n\n    }\n    return 0;\n        \n    \n}",COMPILE_ERROR,0,0
1591271538383433728,c3ff25cd087ae1424858449a82aca83b7f0722bfd3282b40127822bf22610ce0,2022-11-12 11:27:53,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,b;\n    scanf(\""%d\"",&a);\n    while(a>0)\n    {\n    \tb=getchar();\n        printf(\""6\\n\"");\n   \n     a--;\n\n    }\n    return 0;\n        \n    \n}",WRONG_ANSWER,9,344
1591271631635415040,217f1946625720e554af7294d3599b943eea3b430c0df7aa0c5c70abe9904e56,2022-11-12 11:28:16,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"import java.util.Scanner;\npublic class Main{\n    public static void main(String[] args){\n        Scanner sc=new Scanner(System.in);\n        int t=sc.nextInt();\n        for(int i=0;i<t;i++){\n            int a=sc.nextInt();\n            if(i<t){\n           System.out.println(\""6\"");\n           }\n        }\n    }\n}",NON_ZERO_EXIT_CODE,261,16236
1591271696198340608,a2fa7eb1ab1c2f6fa23517852ee6971ea32fd0c7742d71d7914ed729415f04d9,2022-11-12 11:28:31,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint n,num=0,max=0;\n\tcin>>n;\n\tint a[n+1]={},b[n+1]={},c[n+1]={};\n\tfor(int i=1;i<=n;i++)\n\t    cin>>a[i];\n\tfor(int i=1;i<=n;i++)\n\t    cin>>b[i];\t    \n    int i=1,m=n;\n\twhile(m>0)\n\t{\n       \tif(b[i]-a[i]<=0)\n\t\t{\n\t\t\ti++;\n\t\t}\n\t\tif(b[i]-a[i]>0)\n\t\t{\t\t\n\t\t    num=num+b[i]-a[i];\n\t\t\tif(num>max)\n\t\t\t    max=num;\n\t\t\ti++;    \n\t    } \n\t\tm=n-i;   \t    \n    }\n\tcout<<max;\t\n\treturn 0;\n}",WRONG_ANSWER,3,328
1591271882391879680,c3ff25cd087ae1424858449a82aca83b7f0722bfd3282b40127822bf22610ce0,2022-11-12 11:29:15,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a;\n    scanf(\""%d\"",&a);\n    while(a>0)\n    {\n    \n        printf(\""6\\n\"");\n   \n     a--;\n\n    }\n    return 0;\n        \n    \n}",WRONG_ANSWER,9,320
1591271932975165440,c76414e1d2d8531a5745e9bd3192aafa7cca924e645650ffe7954c992cc13b33,2022-11-12 11:29:27,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,t,y,z,x;\n    scanf(\""%d\"",&t);\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    for(i=0;i<t;i++)\n    {\n    printf(\""6\"");\n    if(i!=t-1)\n    printf(\""\\n\"");\n    }\n\n\n}\n",WRONG_ANSWER,10,352
1591271953837654016,217f1946625720e554af7294d3599b943eea3b430c0df7aa0c5c70abe9904e56,2022-11-12 11:29:32,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\npublic class Main{\n    public static void main(String[] args){\n        Scanner sc=new Scanner(System.in);\n        int t=sc.nextInt();\n        for(int i=0;i<t;i++){\n            int a=sc.nextInt();\n            if(i<t-1){\n           System.out.println(6);\n           }\n        }\n        System.out.print(6);\n    }\n},WRONG_ANSWER,261,17120
1591272161883500544,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-12 11:30:22,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <matho.h>\n\nint main(){\n    int a,b[10000],i;\n    scanf(\""%d\"", &a);\n    for(i=0;i<a;i++)\n        scanf(\""%d\"", &b[i]);\n    for(i=0;i<a;i++){\n        if(b[i]!=0)\n            printf(\""6\\n\"");\n        else\n            printf(\""1\\n\"");\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1591272299234373632,4812f9582f90b7f3f95178a62ec39f3555e90b935658da3e31a47fe0d2e8c6fd,2022-11-12 11:30:55,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"\n#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int n;\n    int i;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=0;i<n;i++)\n    {\n        if(i==0)\n            scanf(\""%d\"",&a[i]);\n        else\n            scanf(\"" %d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if(i==0)\n        {\n            if(a[i]==0)\n                printf(\""1\"");\n            else\n                printf(\""6\"");\n        }\n        else\n        {\n            if(a[i]==0)\n                printf(\""\\n1\"");\n            else\n                printf(\""\\n6\"");\n        }\n\n    }\n    return 0;\n}\n\n",ACCEPTED,9,324
1591272302581428224,1e783de44f6cf9abb158b108e556a36ef99d9241fc592b40cfd6cb7d1265eb34,2022-11-12 11:30:56,Java,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\npublic class Main {   \n    public static void main(String[] args) throws IOException {      \n        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));    \n        int n = Integer.valueOf(reader.readLine());     \n        int max=0;     \n        int now=0;     \n        String[] lost = reader.readLine().split(\"" \"");   \n        String[] gain = reader.readLine().split(\"" \"");   \n        int los=0;      \n        int gai=0;    \n        for(int i=0;i=0) {   \n            if((now+gai-los)>=max)       \n                max=now+gai-los;         \n            now+=gai-los;      \n        }         \n        else if ((gai-los)=0){        \n            now+=gai-los;         \n        } else if ((gai-los+now)<0) {   \n            now=0;      \n        }            \n    }     \n    System.out.println(max);   \n}\n}",COMPILE_ERROR,0,0
1591272323037073408,4812f9582f90b7f3f95178a62ec39f3555e90b935658da3e31a47fe0d2e8c6fd,2022-11-12 11:31:00,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"\n#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int n;\n    int i;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=0;i<n;i++)\n    {\n        if(i==0)\n            scanf(\""%d\"",&a[i]);\n        else\n            scanf(\"" %d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if(i==0)\n        {\n            if(a[i]==0)\n                printf(\""1\"");\n            else\n                printf(\""6\"");\n        }\n        else\n        {\n            if(a[i]==0)\n                printf(\""\\n1\"");\n            else\n                printf(\""\\n6\"");\n        }\n\n    }\n    return 0;\n}\n\n",ACCEPTED,9,364
1591272537697333248,c76414e1d2d8531a5745e9bd3192aafa7cca924e645650ffe7954c992cc13b33,2022-11-12 11:31:52,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,t;\n    long long int y,z,x;\n    scanf(\""%d\"",&t);\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    for(i=0;i<t;i++)\n    {\n    printf(\""6\"");\n    if(i!=t-1)\n    printf(\""\\n\"");\n    }\n\n\n}\n",WRONG_ANSWER,9,316
1591272653443371008,19d0c297c2dcba81fb1e99eefaaf147ad897c03398954f84b0636bb6c4f04ef4,2022-11-12 11:32:19,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}",ACCEPTED,3,324
1591272657146941440,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-12 11:32:20,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.*;\n\npublic class main {\n\tpublic main (String[]args){\n\t\ttry (Scanner sc = new Scanner(System.in)) {\n\t\tint n = sc.nextInt();\n\t\tfor (int i = 0;i < n; i++){\nlong j = sc.nextInt();\nif (j == 0) {\nSystem.out.println(1);\n} else {\n                System.out.println(6);\n}\n}\n}\n\n},COMPILE_ERROR,0,0
1591272657474072576,a2fa7eb1ab1c2f6fa23517852ee6971ea32fd0c7742d71d7914ed729415f04d9,2022-11-12 11:32:20,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint n,num=0,max=0;\n\tcin>>n;\n\tint a[n+1]={},b[n+1]={};\n\tfor(int i=1;i<=n;i++)\n\t    cin>>a[i];\n\tfor(int i=1;i<=n;i++)\n\t    cin>>b[i];\t\t    \n    int i=1,m=n;\n\twhile(m>0)\n\t{\n       \tif(b[i]-a[i]<=0)\n\t\t{\n\t\t\ti++;\n\t\t\tnum=0;\n\t\t}\n\t\tif(b[i]-a[i]>0)\n\t\t{\t\n\t\t    for(int j=i;j<=n;j++)\t\n\t\t    {\t\t\t    \n\t\t\t    num=num+b[j]-a[j];\n\t\t\t    if(num>max)\n\t\t\t        max=num;\t\t\t\t\t\n\t\t\t\ti=j;\n\t\t\t\tif(b[j]-a[j]<=0) \n\t\t\t        break;\t\t\t    \t\t\t\t\t\t\t\n\t\t    }\n\t    } \n\t\tm=n-i;   \t    \n    }\n\tcout<<max;\t\n\treturn 0;\n}",WRONG_ANSWER,4,316
1591272686741925888,1f15b5b41f9e61f2d767bcb1ae88bef60c94b97dd423bfd2ba9c8c0e8e9d05bb,2022-11-12 11:32:27,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.Scanner;\nclass Main{\n    public static void main(String[] args){\n    Scanner sc = new Scanner(System.in);\n        int t = sc.nextInt();\n        int arry[];\n        arry=new arry[t];\n        int j = 0;\n        int sum=1;\n        for(int i=1;i<=arry.length;i++){\n            int n = sc.nextInt();\n            for(int k=1;k<=n;k++ ){\n                sum=sum*6;\n            }\n            if(sum<=10){\n                Sysetm.out.print(sum);\n            }else{\n                sum=sum%10;\n                System.out.print(sum);\n                    \n            }\n        }\n    }\n}\n\n\n,COMPILE_ERROR,0,0
1591272736654168064,c3ff25cd087ae1424858449a82aca83b7f0722bfd3282b40127822bf22610ce0,2022-11-12 11:32:39,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,b;\n    scanf(\""%d\"",&a);\n    while(a>0)\n    {\n    (void) scanf(\""%d\"",&b);\n        printf(\""6\\n\"");\n   \n     a--;\n\n    }\n    return 0;\n        \n    \n}",WRONG_ANSWER,10,308
1591272744212303872,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-12 11:32:41,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.*;\n\npublic class main {\n\tpublic main (String[]args){\n\t\ttry (Scanner sc = new Scanner(System.in)) {\n\t\tint n = sc.nextInt();\n\t\tfor (int i = 0;i < n; i++){\nlong j = sc.nextInt();\nif (j == 0) {\nSystem.out.println(1);\n} else {\n                System.out.println(6);\n}\n}\n}\n},COMPILE_ERROR,0,0
1591272872750919680,37ec44401a5a9f0dfa02d2aedaf5edff84fc443d98174af5f21ab01a7d6f6a41,2022-11-12 11:33:11,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\nint a[1008];\nint main()\n{\n    int n,i,j;\n    int sum;\n    scanf(\""%d\"",&n);\n    sum=0;\n    memset(a,1,sizeof(a));\n    for(i=2; i<=n; i++)\n    {\n        if(a[i])\n        {\n            sum++;\n            for(j=i; j<=n; j=j+i)\n            {\n                a[j]=0;//\n        }\n    }\n    printf(\""%d\\n\"",sum);\n\n    return 0;\n}\n",COMPILE_ERROR,0,0
1591272910227050496,899c5501179552dc1fe5639f9047e15d0f835e7a87c8568193377882d0278985,2022-11-12 11:33:20,Python,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"import math\nn=int(input())\nc=0\nfor i in range(2,n+1) :\n    temp=True\n    for j in range(2,math.floor(i**0.5)+1):\n        if i%j==0 :\n            temp=False\n            break\n    if temp :\n        c+=1\nprint(c)",ACCEPTED,242,2904
1591272966648827904,675867a135da6702ed27c0eec3e4b6d2a7d95c44854c01823fc152f0689f010d,2022-11-12 11:33:34,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include \""stdio.h\""\n#define MAX 100\nint main()\n{\n    int a[MAX],b[MAX];\n    int max = 0;\n    int temp = 0;\n    int n,i,j;\n    scanf(\""%d\"",&n);  //关卡数\n\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(j=0;j<n;j++)\n        scanf(\""%d\"",&b[j]);\n\n    for(i=0;i<n;i++){\n        max=max-a[i]+b[i];\n        if(max<temp)\n            max=temp;\n        temp=max;\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",WRONG_ANSWER,3,192
1591272998814945280,225b1524edf804414c466257a4f19789fe127117b27e663dc835d742fed77f9e,2022-11-12 11:33:42,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a;\n    int i,j,sum,max=0;\n    scanf(\""%d\"",&a);\n    int l[a],o[a];\n    for (i=0;i<a;i++)\n        scanf(\""%d\"",&l[i]);\n    for (i=0;i<a;i++)\n        scanf(\""%d\"",&o[i]);\n    for (i=0;i<a;i++)\n    {\n        sum=0;\n        for(j=i;j<a;j++)\n        {\n            sum=sum-l[j]+o[j];\n            if(sum>max)\n                max=sum;\n        }\n\n    }\n    printf(\""%d\"",max);\n    return 0;\n}",WRONG_ANSWER,5,328
1591273052019666944,37ec44401a5a9f0dfa02d2aedaf5edff84fc443d98174af5f21ab01a7d6f6a41,2022-11-12 11:33:54,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\nint a[1008];\nint main()\n{\n    int n,i,j;\n    int sum;\n    scanf(\""%d\"",&n);\n    sum=0;\n    memset(a,1,sizeof(a));\n    for(i=2; i<=n; i++)\n    {\n        if(a[i])\n        {\n            sum++;\n            for(j=i; j<=n; j=j+i)\n            {\n                a[j]=0;\n            }\n        }\n    }\n    printf(\""%d\\n\"",sum);\n\n    return 0;\n}\n",SEGMENTATION_FAULT,3,324
1591273096751939584,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-12 11:34:05,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n\nint main(){\n    int a, b[100000],i;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<a;i++){\n        if(b[i]!=0)\n            printf(\""6ln\"");else\n        else\n            printf(\""1ln\"");\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1591273124904112128,37ec44401a5a9f0dfa02d2aedaf5edff84fc443d98174af5f21ab01a7d6f6a41,2022-11-12 11:34:12,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint a[1008];\nint main()\n{\n    int n,i,j;\n    int sum;\n    scanf(\""%d\"",&n);\n    sum=0;\n    memset(a,1,sizeof(a));\n    for(i=2; i<=n; i++)\n    {\n        if(a[i])\n        {\n            sum++;\n            for(j=i; j<=n; j=j+i)\n            {\n                a[j]=0;\n            }\n        }\n    }\n    printf(\""%d\\n\"",sum);\n\n    return 0;\n}\n",SEGMENTATION_FAULT,3,324
1591273172522045440,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-12 11:34:23,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.*;\n\npublic class main {\n\tpublic main (String[]args){\n\t\ttry (Scanner sc = new Scanner(System.in)) {\n\t\tint n = sc.nextInt();\n\t\tfor (int i = 0;i < n; i++){\nlong j = sc.nextInt();\nif (j == 0) {\nSystem.out.println(1);\n} else {\n                System.out.println(6);\n}\n}\n}\n}\n},COMPILE_ERROR,0,0
1591273233347837952,7a048784ed2975c30a64787731af1fce175495afd1f4aad852d064d00b6193b9,2022-11-12 11:34:37,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\n\nint main()\n{\n    int i,j;\n    int n;\n    scanf(\""%d\"",&n);\n    int sum=0;\n    for(i=2;i<=n;i++)\n    {\n         for(j=2;j<=pow(i,0.5);j++)\n         {\n             if(i%j==0)\n             {\n                 sum++;\n                 break;\n             }\n         }\n    }\n    \n    printf(\""%d\"",n-sum-1);\n}",ACCEPTED,151,320
1591273237764419584,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-12 11:34:38,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n\nint main(){\n    int a, b[100000],i;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<a;i++){\n        if(b[i]!=0)\n            printf(\""6ln\"");\n        else\n            printf(\""1ln\"");\n    }\n    return 0;\n}\n",WRONG_ANSWER,3,344
1591273266658979840,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-12 11:34:45,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.*;\n\npublic class Main {\n\tpublic main (String[]args){\n\t\ttry (Scanner sc = new Scanner(System.in)) {\n\t\tint n = sc.nextInt();\n\t\tfor (int i = 0;i < n; i++){\nlong j = sc.nextInt();\nif (j == 0) {\nSystem.out.println(1);\n} else {\n                System.out.println(6);\n}\n}\n}\n}\n},COMPILE_ERROR,0,0
1591273269288808448,675867a135da6702ed27c0eec3e4b6d2a7d95c44854c01823fc152f0689f010d,2022-11-12 11:34:46,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include \""stdio.h\""\n#define MAX 100\nint main()\n{\n    int a[MAX],b[MAX];\n    int max = 0;\n    int temp = 0;\n    int n,i,j;\n    scanf(\""%d\"",&n);  //关卡数\n\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(j=0;j<n;j++)\n        scanf(\""%d\"",&b[j]);\n\n    for(i=0;i<n;i++){\n        max=max-a[i]+b[i];\n        if(max<temp)\n            max=temp;\n        temp=max;\n    }\n    printf(\""%d\\n\"",max);\n    return 0;\n}",WRONG_ANSWER,3,196
1591273286967820288,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-12 11:34:50,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n\nint main(){\n    int a, b[100000],i;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<a;i++){\n        if(b[i]!=0)\n            printf(\""6\\n\"");\n        else\n            printf(\""1\\n\"");\n    }\n    return 0;\n}\n",ACCEPTED,9,352
1591273347437105152,7a048784ed2975c30a64787731af1fce175495afd1f4aad852d064d00b6193b9,2022-11-12 11:35:05,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n}",ACCEPTED,7,324
1591273429683187712,99481c5a0804ff1b45cf32a79326675aa759c0780ab1ad0d29f845666cb83208,2022-11-12 11:35:24,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<string.h>\n#include<math.h>\n\nint main()\n{\n    int x;\n    scanf(\""%d\"",&x);\n    int m,n,o;\n    scanf(\""%d %d %d\"",&m,&n,&o);\n    int ans1=pow(6,m);\n    int ans2=pow(6,n);\n    int ans3=pow(6,o);\n    printf(\""%d\"",ans1);\n    printf(\""%d\"",ans2);\n    printf(\""%d\"",ans3);\n    return 0;\n}\n",WRONG_ANSWER,3,180
1591273448406585344,c3ff25cd087ae1424858449a82aca83b7f0722bfd3282b40127822bf22610ce0,2022-11-12 11:35:29,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,b;\n    scanf(\""%d\"",&a);\n    while(a>0)\n    {\n    scanf(\""%d\"",&b);\n        printf(\""6\\n\"");\n   \n     a--;\n\n    }\n    return 0;\n        \n    \n}",WRONG_ANSWER,10,316
1591273520938684416,225b1524edf804414c466257a4f19789fe127117b27e663dc835d742fed77f9e,2022-11-12 11:35:46,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int n;\n    int i;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=0;i<n;i++)\n    {\n        if(i==0)\n            scanf(\""%d\"",&a[i]);\n        else\n            scanf(\"" %d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if(i==0)\n        {\n            if(a[i]==0)\n                printf(\""1\"");\n            else\n                printf(\""6\"");\n        }\n        else\n        {\n            if(a[i]==0)\n                printf(\""\\n1\"");\n            else\n                printf(\""\\n6\"");\n        }\n\n    }\n    return 0;\n}",ACCEPTED,9,364
1591273537921417216,a13ce9a1eabee5481ddd750d61b635f6239d13ff2293e1ee7ba8168bdcd1bcca,2022-11-12 11:35:50,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\n#include<time.h> \nvoid main()\n{\n    time_t t;\n    struct tm *p;\n    time(&t);\n    p=localtime(&t);\n    printf(\""%d\"",1900+p->tm_year);\n } ",ACCEPTED,4,196
1591273588869632000,a13ce9a1eabee5481ddd750d61b635f6239d13ff2293e1ee7ba8168bdcd1bcca,2022-11-12 11:36:02,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{ int x,y,z;\n  scanf(\""%d %d %d\"",&x,&y,&z);\n printf(\""%d\"",x+y-z);\n return 0;\n}",ACCEPTED,7,320
1591273639465496576,a13ce9a1eabee5481ddd750d61b635f6239d13ff2293e1ee7ba8168bdcd1bcca,2022-11-12 11:36:14,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int m,n,j,count,flag;\n    scanf(\""%d\"",&m);\n    count=0;\n    for (n=2;n<= m;n++)\n    {\n        flag=1;\n       for(j=2;j<=sqrt(n);j++)\n       {\n         if(n%j==0)\n         {\n             flag=0;\n             break;\n          }\n       }\n        if(flag==1)\n            count++;\n    }\n    printf(\""%d\"",count);\n    return 0;\n}\n",ACCEPTED,13,308
1591273646176382976,c3ff25cd087ae1424858449a82aca83b7f0722bfd3282b40127822bf22610ce0,2022-11-12 11:36:16,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a;\n    scanf(\""%d\"",&a);\n    while(a>0)\n    {\n        printf(\""6\\n\"");\n   \n     a--;\n\n    }\n    return 0;\n        \n    \n}",WRONG_ANSWER,9,456
1591273685640613888,a13ce9a1eabee5481ddd750d61b635f6239d13ff2293e1ee7ba8168bdcd1bcca,2022-11-12 11:36:25,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint n ,x , start ,end , t=0 , max=0 ,sum=0;\nint main()\n{\n\tint xiao[100000], huo[100000],jue[100000];\n\tscanf( \""%d\"" , & n );\n\tfor ( x = 0 ; x < n ; x++ )\n\t{\n\t\tscanf(\""%d\"", &xiao[x]);\n\t\t//printf(\""%d\\n\"",xiao[x]);\n\t}\n\tfor ( x = 0 ; x < n ; x++ )\n\t{\n\t\tscanf(\""%d\"", &huo[x]);\n\t\t//printf(\""%d\\n\"",huo[x]);\n\t}\n\tfor ( x = 0 ; x < n ; x++ )\n\t{\n\t\tjue[x] = huo[x] - xiao[x];\n\t\t//printf(\""%d\\n\"",jue[x]);\n\t}\n\tfor ( start = 0 ; start < n ; start++ )\n\t{\n\t\tfor ( end = 0 ; end < n ; end++)\n\t\t{\n\t\t\tfor( t = start ; t <= end ; t++)\n\t\t\t{\n\t\t\t\tsum = sum + jue[t];\n\t\t\t}\n\t\t\tif( sum > max )\n\t\t\t{\n\t\t\t\tmax = sum;\n\t\t\t}\n\t\t\tsum = 0 ;\n\t\t}\n\t}\n\tprintf( \""%d\"" , max );\n}",ACCEPTED,3,192
1591273694868082688,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-12 11:36:27,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.*;\n\npublic class Main {\n\tpublic static void main(String[]args){\n\t\ttry (Scanner sc = new Scanner(System.in)) {\n\t\tint n = sc.nextInt();\n\t\tfor (int i = 0;i < n; i++){\nlong j = sc.nextInt();\nif (j == 0) {\nSystem.out.println(1);\n} else {\n                System.out.println(6);\n}\n}\n}\n}\n},NON_ZERO_EXIT_CODE,263,18952
1591273708793167872,225b1524edf804414c466257a4f19789fe127117b27e663dc835d742fed77f9e,2022-11-12 11:36:31,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#include<string.h>\n#include<math.h>\n\nint flag[10006];\nint num[10000],total,now,n;\n\nvoid solve(int index,int Mul,int K){\n      int i,t;\n   if(K==0){\n    now+=n/Mul;\n    return;\n   }\n   for(i=index;i<total-K+1;i++){\n     Mul*=num[i];\n     t=now;\n     if(Mul<=n){\n              solve(i+1,Mul,K-1);\n     }\n     if(t==now)//优化剪枝（1）\n      return;\n           Mul/=num[i];\n   }\n}\n\nint Judge(int x){\n int t,i;\n t=sqrt(x*1.0);\n for(i=2;i<=t;i++)\n  if(n%i==0)\n   return 0;\n return 1;\n}\n\nint main(){\n    int i,j,t,Count;\n memset(flag,0,sizeof(flag));\n for(i=2;i<=10000;i++){\n  if(flag[i])\n   continue;\n  for(j=2;j*i<=10000;j++)\n   flag[i*j]=1;\n }\n while(scanf(\""%d\"",&n)==1){\n  Count=0;\n  if(n<=10000){\n   for(i=2;i<n;i++)\n    if(!flag[i])\n     Count++;\n  }\n  else{\n   t=sqrt(1.0*n);\n   total=0;\n   for(i=2;i<=t;i++)\n    if(!flag[i])\n     num[total++]=i;\n   for(i=1;i<=total;i++){\n    now=0;\n    solve(0,1,i);\n    if(now==0)//优化(2)\n     break;\n    if(i&1)\n       Count+=now;\n    else\n       Count-=now;\n   }\n   Count-=total;\n   Count=n-Count-1;\n   if(Judge(n))\n    Count--;\n  }\n  printf(\""%d\\n\"",Count);\n }\n return 0;\n}",ACCEPTED,6,324
1591273725822046208,a13ce9a1eabee5481ddd750d61b635f6239d13ff2293e1ee7ba8168bdcd1bcca,2022-11-12 11:36:35,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"\n#include <stdio.h>\n#include <stdlib.h>\n#include<math.h>\nint main() {\n\tint n, i,k;\n\t\n\tint* p = NULL;\n\tscanf(\""%d\"", &n);\n\tp = (int*)malloc(n*sizeof(int));\n\tfor (i = 0; i < n; i++)\n\t\tscanf(\""%d\"", &p[i]);\n\tfor (i = 0; i < n; i++)\n\t{\n\t    k=6*p[i];\n       \n         \n            \n          \n\t    k=k%10;\n\t    \n\t    \n\t\tprintf(\""%d\\n\"",k);\n\t} \n\t\t\n\treturn 0;\n}\n",WRONG_ANSWER,3,184
1591273764900372480,ece045c1570c74e6800520e16047010817642535f83b9f2b4524ebdcf9d7925a,2022-11-12 11:36:44,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n\nint main(){\n    int a, b[100000],i;\n    scanf(\""%d\"",&a);\n    for(i=0;i<a;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<a;i++){\n        if(b[i]!=0)\n            printf(\""6\\n\"");\n        else\n            printf(\""1\\n\"");\n    }\n    return 0;\n}",ACCEPTED,9,348
1591273875139244032,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-12 11:37:10,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.*;\n\npublic class Main {\npublic static void main(String[]args){\ntry (Scanner sc = new Scanner(System.in)) {\nint n = sc.nextInt();\nfor (int i = 0;i < n; i++){\nlong j = sc.nextInt();\nif (j == 0) {\nSystem.out.println(1);\n} else {\nSystem.out.println(6);\n}\n}\n}\n}\n},NON_ZERO_EXIT_CODE,235,16568
1591273895993323520,80bb854046efddc8db8117414c5ff582f99d3347454c32f734c77c16dc462ed6,2022-11-12 11:37:15,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    printf(\""%d\\n\"",X+Y-Z);\n    return 0;\n}\n\n",ACCEPTED,8,472
1591273937332383744,e807496cefc8b76d55101108daa4cb8e59f87dde49b8197bd619e8a84563990e,2022-11-12 11:37:25,C++,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n\tint n,i,j;\n\tint sum=0;\n\tcin>>n;\n\tfor(j=2;j<=n;j++){\n\t\tint a=1;\n\t\tfor(i=2;i*i<=j;i++){\n\t\t\tif(j%i==0){\n\t\t\t\ta=0;\n\t\t\t\tbreak;\n\t\t\t}\t\n\t\t}\n\t\tif(a){\n\t\t\tsum++;\n\t\t}\n\t}\n\tcout<<sum<<endl;\n\treturn 0;\n}",ACCEPTED,20,448
1591274068500852736,80bb854046efddc8db8117414c5ff582f99d3347454c32f734c77c16dc462ed6,2022-11-12 11:37:57,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int i,n,t,y;\n    scanf(\""%d\\n\"",&t);\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&n);\n        if(n==0)\n            y=1;\n        else\n            y=6;\n            printf(\""%d\\n\"",y);\n    }\nreturn 0;\n}\n\n",ACCEPTED,12,364
1591274147743862784,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-12 11:38:15,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.*;\n\npublic class Main {\npublic static void main(String[] args){\nScanner sc = new Scanner(System.in);\nint n = sc.nextInt();\nfor (int i = 0; i < n; i++) {\nlong j = sc.nextInt();\nif (j == 0) {\nSystem.out.println(1);\n} else {\nSystem.out.println(6);\n}\n}\n}\n},NON_ZERO_EXIT_CODE,234,16492
1591274192031514624,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-12 11:38:26,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.*;\npublic class Main {\npublic static void main(String[] args){\nScanner sc = new Scanner(System.in);\nint n = sc.nextInt();\nfor (int i = 0; i < n; i++) {\nlong j = sc.nextInt();\nif (j == 0) {\nSystem.out.println(1);\n} else {\nSystem.out.println(6);\n}\n}\n}\n},WRONG_ANSWER,228,16700
1591274321111220224,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-12 11:38:57,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.*;\npublic class Main {\npublic static void main(String[] args){\nScanner sc = new Scanner(System.in);\nint n = sc.nextInt();\nfor (int i = 0; i < n; i++) {\nlong j = sc.nextInt();\nif (j == 0) {\nSystem.out.println(1);\n} else {\nSystem.out.println(6);\n}\n}\n}\n},NON_ZERO_EXIT_CODE,243,16696
1591274345790504960,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-12 11:39:03,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.*;\npublic class Main {\npublic static void main(String[] args){\nScanner sc = new Scanner(System.in);\nint n = sc.nextInt();\nfor (int i = 0; i < n; i++) {\nlong j = sc.nextInt();\nif (j == 0) {\nSystem.out.println(1);\n} else {\nSystem.out.println(6);\n}\n}\n}\n},WRONG_ANSWER,261,16376
1591274361439457280,a2fa7eb1ab1c2f6fa23517852ee6971ea32fd0c7742d71d7914ed729415f04d9,2022-11-12 11:39:06,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint n,num=0,max=0;\n\tcin>>n;\n\tint a[n+1]={},b[n+1]={};\n\tfor(int i=1;i<=n;i++)\n\t    cin>>a[i];\n\tfor(int i=1;i<=n;i++)\n\t    cin>>b[i];\t\t    \n    int i=1,m=n;\n\twhile(m>0)\n\t{\n       \tif(b[i]-a[i]<=0)\n\t\t{\n\t\t\ti++;\n\t\t\tnum=0;\n\t\t}\n\t\tif(b[i]-a[i]>0)\n\t\t{\t\n\t\t    for(int j=i;j<=n;j++)\t\n\t\t    {\t\t\t    \n\t\t\t    num=num+b[j]-a[j];\n\t\t\t    if(num>max)\n\t\t\t        max=num;\t\t\t\t\t\n\t\t\t\ti=j;\n\t\t\t\tif(num+b[j+1]-a[j+1]<=0) \n\t\t\t        break;\t\t\t    \t\t\t\t\t\t\t\n\t\t    }\n\t    } \n\t\tm=n-i;   \t    \n    }\n\tcout<<max;\t\n\treturn 0;\n}",WRONG_ANSWER,5,452
1591274477298716672,80bb854046efddc8db8117414c5ff582f99d3347454c32f734c77c16dc462ed6,2022-11-12 11:39:34,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int m,i,j,k,n=0,flag=1;\n    scanf(\""%d\"",&m);\n    for(i=2;i<=m;i++)\n    {\n        k=sqrt(i);\n        for(j=2;j<=k;j++)\n            if(i%j==0)\n                break;\n        if(j>k)\n            n++;\n    }\n    printf(\""%d\"",n);\n    return 0;\n}\n\n\n\n\n",ACCEPTED,13,320
1591274486815567872,acfcf65f14b5d3b02c3225372654b4e21f04d33a8bbaeb346e4fb1d85f2ea94f,2022-11-12 11:39:36,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int n;\n    int i;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=0;i<n;i++)\n    {\n        if(i==0)\n            scanf(\""%d\"",&a[i]);\n        else\n            scanf(\"" %d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        if(i==0)\n        {\n            if(a[i]==0)\n                printf(\""1\"");\n            else\n                printf(\""6\"");\n        }\n        else\n        {\n            if(a[i]==0)\n                printf(\""\\n1\"");\n            else\n                printf(\""\\n6\"");\n        }\n\n    }\n    return 0;\n}\n",ACCEPTED,9,364
1591274621280759808,c76414e1d2d8531a5745e9bd3192aafa7cca924e645650ffe7954c992cc13b33,2022-11-12 11:40:08,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,t;\n    long long int y,z,x;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<t;i++)\n    {\n     if(a[i]==0)\n        printf(\""1\"");\n     if(i!=t-1)\n        printf(\""\\n\"")\n    else\n        {\n        printf(\""6\"");\n        if(i!=t-1)\n        printf(\""\\n\"");\n        }\n    }\n}\n",COMPILE_ERROR,0,0
1591274637776977920,a8a4c649080a65381764d05b09cdced42bbf4a58e2656f96cfc5545fc9d08327,2022-11-12 11:40:12,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{ int X,Y,Z,sum;\n\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    sum=X+Y-Z;\n    printf(\""%d\"",sum);\n    return 0;\n}\n",ACCEPTED,7,308
1591274785101905920,2ccc7507304cfd28125f6d85cdb4df769a41aec4f125254d0d2415ba16cb27c2,2022-11-12 11:40:47,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<math.h>\n#include <stdio.h>\nint main()\n{\n    int i,t,n;\n    scanf(\""%d\"",&t);\n    for(i=1;i<=t;i++)\n    {\n     scanf(\""%d\"",&n);\n     if(n==0)\n        printf(\""1\\n\"");\n     else\n        printf(\""6\\n\"");\n     }\n    return 0;\n}\n",ACCEPTED,10,344
1591274864864985088,a6ac289bf1824faac92f88e17c858d77808fa73badf995bb0b5121dda23f357a,2022-11-12 11:41:06,Java,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"import java.util.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args){\t    Scanner sc=new Scanner(System.in);\n\n\t    int n=sc.nextInt();\n\n\t    int i,j;\n\n\t    int k=0;\n\n\t    for(i=2;i<n;i++) {\n\n\t    \tj=2;\n\n\t    \tfor(j=2;j<Math.sqrt(i);j++) {\n\n\t    \t\tif(i%j==0) {\n\n\t    \t\t\tbreak;\n\n\t    \t\t}\n\n\t    \t}\n\n\t    \tif(j>Math.sqrt(i)) k++;\n\n\t    }\n\n\t    System.out.println(k);\n\n\t}\n\n\t\n\n}",ACCEPTED,264,16584
1591274956204347392,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-12 11:41:28,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main（)\n{\n    int n,a[100],b[100],c[100];\n    int i,j,k,sum,max;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n        c[i]=b[i]-a[i];\n       max=c[0];\n    for(i=0;i<n;i++){\n        sum=θ;\n    for(j=i;j<n;j++){\n        sum=sum+c[j];\n        if(sum>max)\n            max=sum;\n        }\n    }\nprintf(\""%d\"",max);\nreturn 0;\n}\n",COMPILE_ERROR,0,0
1591275029801795584,f1a9b482617577a636e4a09531695721778faca66954fa117a72ad0fab52cd55,2022-11-12 11:41:46,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{ int X,Y,Z,sum;\n\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    sum=X+Y-Z;\n    printf(\""%d\"",sum);\n    return 0;\n}",ACCEPTED,8,320
1591275033136267264,2ccc7507304cfd28125f6d85cdb4df769a41aec4f125254d0d2415ba16cb27c2,2022-11-12 11:41:47,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<math.h>\n#include <stdio.h>\nint main()\n{\n    int n,i,j,temp=0,b;\n    scanf(\""%d\"",&n);\n     for(i=2;i<=n;i++)\n     {\n      b=1;\n      for(j=2;j*j<=i;j++)\n       if(i%j==0)\n       {\n         b=0;\n         break;\n       }\n       if(b==1)\n        temp++;\n     }\n    printf(\""%d\"",temp);\n    return 0;\n}\n",ACCEPTED,13,180
1591275061464576000,f1a9b482617577a636e4a09531695721778faca66954fa117a72ad0fab52cd55,2022-11-12 11:41:53,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{ int X,Y,Z,sum;\n\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    sum=X+Y-Z;\n    printf(\""%d\"",sum);\n    return 0;\n}",ACCEPTED,6,188
1591275084701044736,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-12 11:41:59,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int n,a[100],b[100],c[100];\n    int i,j,k,sum,max;\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n        c[i]=b[i]-a[i];\n       max=c[0];\n    for(i=0;i<n;i++){\n        sum=θ;\n    for(j=i;j<n;j++){\n        sum=sum+c[j];\n        if(sum>max)\n            max=sum;\n        }\n    }\nprintf(\""%d\"",max);\nreturn 0;\n}\n",COMPILE_ERROR,0,0
1591275129596874752,cfbed023288d929e37ec2a5f480f49533f34048e9861900771cbd8327550eb31,2022-11-12 11:42:10,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n  int n,i,a;\n    for(i=1;i<n;i++)\n    {\n        scanf(\""%d\"",&a);\n        if(a==0)\n            printf(\""1/n\"");\n        else\n            printf(\""6/n\"");\n    }\n    scanf(\""%d\"",&a);\n    if(a==0)\n        printf(\""1\"");\n    else\n        printf(\""6\"");\n    return 0;\n}",WRONG_ANSWER,3,188
1591275203785719808,2ccc7507304cfd28125f6d85cdb4df769a41aec4f125254d0d2415ba16cb27c2,2022-11-12 11:42:27,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"printf(\""2022\"")",COMPILE_ERROR,0,0
1591275222106443776,c76414e1d2d8531a5745e9bd3192aafa7cca924e645650ffe7954c992cc13b33,2022-11-12 11:42:32,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,t;\n    long long int y,z,x;\n    scanf(\""%d\"",&t);\n    int a[t];\n    for(i=0;i<t;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<t;i++)\n    {\n     if(a[i]!=0)\n    {\n        printf(\""6\"");\n        if(i!=t-1)\n        {printf(\""\\n\"");}\n     }\n\n    else\n        {\n        {printf(\""1\"");}\n        if(i!=t-1)\n        {printf(\""\\n\"");}\n        }\n    }\n}\n\n",ACCEPTED,9,324
1591275223024971776,2ccc7507304cfd28125f6d85cdb4df769a41aec4f125254d0d2415ba16cb27c2,2022-11-12 11:42:32,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"printf(\""2022\"");",COMPILE_ERROR,0,0
1591275323499548672,2ccc7507304cfd28125f6d85cdb4df769a41aec4f125254d0d2415ba16cb27c2,2022-11-12 11:42:56,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    printf(\""%d\"",2022);\n    return 0;\n}\n",ACCEPTED,3,340
1591275325340823552,cfbed023288d929e37ec2a5f480f49533f34048e9861900771cbd8327550eb31,2022-11-12 11:42:56,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n  int n,i,a;\n    scanf(\""%d\"",&n);\n    for(i=1;i<n;i++)\n    {\n        scanf(\""%d\"",&a);\n        if(a==0)\n            printf(\""1/n\"");\n        else\n            printf(\""6/n\"");\n    }\n    scanf(\""%d\"",&a);\n    if(a==0)\n        printf(\""1\"");\n    else\n        printf(\""6\"");\n    return 0;\n}",WRONG_ANSWER,3,324
1591275457364951040,675867a135da6702ed27c0eec3e4b6d2a7d95c44854c01823fc152f0689f010d,2022-11-12 11:43:28,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include \""stdio.h\""\n#define MAX 100\nint main()\n{\n    int a[MAX],b[MAX];\n    int max = 0;\n    int temp = 0;\n    int n,i,j;\n    scanf(\""%d\"",&n);  //关卡数\n\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(j=0;j<n;j++)\n        scanf(\""%d\"",&b[j]);\n\n    for(i=0;i<n;i++){\n        temp=max-a[i]+b[i];\n        if(max<temp)\n            max=temp;\n    }\n    printf(\""%d\\n\"",max);\n    return 0;\n}",WRONG_ANSWER,4,324
1591275465870999552,2ccc7507304cfd28125f6d85cdb4df769a41aec4f125254d0d2415ba16cb27c2,2022-11-12 11:43:30,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int x,y,z;\n    scanf(\""%d%d%d\"",&x,&y,&m);\n    printf(\""%d\"",x+y-m);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1591275466982494208,cfbed023288d929e37ec2a5f480f49533f34048e9861900771cbd8327550eb31,2022-11-12 11:43:30,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\n\nint main()\n{\n  int n,i,a;\n    scanf(\""%d\"",&n);\n    for(i=1;i<n;i++)\n    {\n        scanf(\""%d\"",&a);\n        if(a==0)\n            printf(\""1\\n\"");\n        else\n            printf(\""6\\n\"");\n    }\n    scanf(\""%d\"",&a);\n    if(a==0)\n        printf(\""1\"");\n    else\n        printf(\""6\"");\n    return 0;\n}",ACCEPTED,9,320
1591275503460331520,2ccc7507304cfd28125f6d85cdb4df769a41aec4f125254d0d2415ba16cb27c2,2022-11-12 11:43:39,C,300.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int x,y,m;\n    scanf(\""%d%d%d\"",&x,&y,&m);\n    printf(\""%d\"",x+y-m);\n    return 0;\n}\n",ACCEPTED,6,316
1591275841718390784,a2fa7eb1ab1c2f6fa23517852ee6971ea32fd0c7742d71d7914ed729415f04d9,2022-11-12 11:44:59,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint n,num=0,max=0;\n\tcin>>n;\n\tint a[n+1]={},b[n+1]={};\n\tfor(int i=1;i<=n;i++)\n\t    cin>>a[i];\n\tfor(int i=1;i<=n;i++)\n\t    cin>>b[i];\t\t    \n    int i=1,m=n;\n\twhile(m>0)\n\t{\n       \tif(b[i]-a[i]<=0)\n\t\t{\n\t\t\ti++;\n\t\t\tnum=0;\n\t\t}\n\t\tif(b[i]-a[i]>0)\n\t\t{\t\n\t\t    for(int j=i;j<=n;j++)\t\n\t\t    {\t\t\t    \n\t\t\t    num=num+b[j]-a[j];\n\t\t\t    if(num>max)\n\t\t\t        max=num;\t\t\t\t\t\n\t\t\t\ti=j;\n\t\t\t\tif(num+b[j+1]-a[j+1]<=0)\n\t\t\t\t{\n\t\t\t\t    num=0; \n\t\t\t        break;\n\t\t\t    }\n\t\t    }\n\t    } \n\t\tm=n-i;   \t    \n    }\n\tcout<<max;\t\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,400,324
1591275874886922240,a2fa7eb1ab1c2f6fa23517852ee6971ea32fd0c7742d71d7914ed729415f04d9,2022-11-12 11:45:07,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint n,num=0,max=0;\n\tcin>>n;\n\tint a[n+1]={},b[n+1]={};\n\tfor(int i=1;i<=n;i++)\n\t    cin>>a[i];\n\tfor(int i=1;i<=n;i++)\n\t    cin>>b[i];\t\t    \n    int i=1,m=n;\n\twhile(m>0)\n\t{\n       \tif(b[i]-a[i]<=0)\n\t\t{\n\t\t\ti++;\n\t\t\tnum=0;\n\t\t}\n\t\tif(b[i]-a[i]>0)\n\t\t{\t\n\t\t    for(int j=i;j<=n;j++)\t\n\t\t    {\t\t\t    \n\t\t\t    num=num+b[j]-a[j];\n\t\t\t    if(num>max)\n\t\t\t        max=num;\t\t\t\t\t\n\t\t\t\ti=j;\n\t\t\t\tif(num+b[j+1]-a[j+1]<=0)\n\t\t\t\t{\n\t\t\t\t    num=0; \n\t\t\t        break;\n\t\t\t    }\n\t\t    }\n\t    } \n\t\tm=n-i;   \t    \n    }\n\tcout<<max;\t\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,400,324
1591275916100153344,a8a4c649080a65381764d05b09cdced42bbf4a58e2656f96cfc5545fc9d08327,2022-11-12 11:45:17,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    printf(\""2022\"");\n    return 0;\n}\n",ACCEPTED,3,188
1591275937298165760,675867a135da6702ed27c0eec3e4b6d2a7d95c44854c01823fc152f0689f010d,2022-11-12 11:45:22,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include \""stdio.h\""\n#define MAX 100\nint main()\n{\n    int a[MAX],b[MAX];\n    int max = 0;\n    int temp = 0;\n    int n,i,j;\n    scanf(\""%d\"",&n);  //关卡数\n\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(j=0;j<n;j++)\n        scanf(\""%d\"",&b[j]);\n\n    for(i=0;i<n;i++){\n        temp=temp-a[i]+b[i];\n        if(max<temp)\n            max=temp;\n    }\n    printf(\""%d\\n\"",max);\n    return 0;\n}",WRONG_ANSWER,2,184
1591275963265101824,f1a9b482617577a636e4a09531695721778faca66954fa117a72ad0fab52cd55,2022-11-12 11:45:28,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    printf(\""%d\"",2022);\n    return 0;\n}",ACCEPTED,3,184
1591276051093848064,f1a9b482617577a636e4a09531695721778faca66954fa117a72ad0fab52cd55,2022-11-12 11:45:49,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<math.h>\n#include <stdio.h>\nint main()\n{\n    int i,t,n;\n    scanf(\""%d\"",&t);\n    for(i=1;i<=t;i++)\n    {\n     scanf(\""%d\"",&n);\n     if(n==0)\n        printf(\""1\\n\"");\n     else\n        printf(\""6\\n\"");\n     }\n    return 0;\n}",ACCEPTED,7,196
1591276113375047680,f1a9b482617577a636e4a09531695721778faca66954fa117a72ad0fab52cd55,2022-11-12 11:46:04,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    printf(\""%d\"",2049);\n    return 0;\n}",WRONG_ANSWER,3,196
1591276163534729216,f1a9b482617577a636e4a09531695721778faca66954fa117a72ad0fab52cd55,2022-11-12 11:46:16,C,300.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    printf(\""%d\"",2022);\n    return 0;\n}",ACCEPTED,3,196
1591276259152297984,f1a9b482617577a636e4a09531695721778faca66954fa117a72ad0fab52cd55,2022-11-12 11:46:39,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<math.h>\n#include <stdio.h>\nint main()\n{\n    int n,i,j,temp=0,b;\n    scanf(\""%d\"",&n);\n     for(i=2;i<=n;i++)\n     {\n      b=1;\n      for(j=2;j*j<=i;j++)\n       if(i%j==0)\n       {\n         b=0;\n         break;\n       }\n       if(b==1)\n        temp++;\n     }\n    printf(\""%d\"",temp);\n    return 0;\n}",ACCEPTED,12,316
1591276403725762560,a2fa7eb1ab1c2f6fa23517852ee6971ea32fd0c7742d71d7914ed729415f04d9,2022-11-12 11:47:13,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint n,num=0,max=0;\n\tcin>>n;\n\tint a[n+1]={},b[n+1]={};\n\tfor(int i=1;i<=n;i++)\n\t    cin>>a[i];\n\tfor(int i=1;i<=n;i++)\n\t    cin>>b[i];\t\t    \n    int i=1,m=n;\n\twhile(m>0)\n\t{\n       \tif(b[i]-a[i]<=0)\n\t\t{\n\t\t\ti++;\n\t\t\tnum=0;\n\t\t}\n\t\tif(b[i]-a[i]>0)\n\t\t{\t\n\t\t    for(int j=i;j<=n;j++)\t\n\t\t    {\t\t\t    \n\t\t\t    num=num+b[j]-a[j];\n\t\t\t    if(num>max)\n\t\t\t        max=num;\t\t\t\t\t\n\t\t\t\ti=j;\n\t\t\t\tif(num+b[j+1]-a[j+1]<=0)\n\t\t\t\t{\n\t\t\t\t    num=0; \n\t\t\t        break;\n\t\t\t    }\n\t\t    }\n\t    } \n\t\tm=n-i;   \t    \n    }\n\tcout<<max;\t\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,400,412
1591276620059553792,1ac1c697452718cae6f56347fb0bf2473480d854f77bcfb84dd289d79169690e,2022-11-12 11:48:05,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <iostream>\n#include <cmath>\nusing namespace std;\n\n#define MAX 100\nint main()\n{\n    int t;\n    int arr[MAX];\n    cout << \""请输入要输入的数字数量：\"" << endl;\n    cin >> t;\n    for (int i = 0;i < t;i++)\n    {\n        cin >> arr[i];\n    }\n    \n    for (int i = 0;i < t;i++)\n    {\n        if (arr[i] >= 0 && arr[i] <= pow(10, 9))\n        {\n            arr[i] = pow(6, arr[i]);\n            arr[i] = arr[i] % 10;\n            cout << arr[i] << endl;\n        }\n    }\n\n\n\n    system(\""pause\"");\n    return 0;\n}",WRONG_ANSWER,5,568
1591276701072535552,217f1946625720e554af7294d3599b943eea3b430c0df7aa0c5c70abe9904e56,2022-11-12 11:48:24,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"t=int(input())\nfor i in range(t):\n    n =map(int,input().split())\n    print(6)",NON_ZERO_EXIT_CODE,17,2780
1591276743317585920,6a13ab5dace404f6c87948ce62b16a82eeb7915406e64534797ae548867af081,2022-11-12 11:48:34,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\nint main(){\n    int n,a[100],b[100],c[100];\n    int i,j,k,sum,max;\n    scanf(\""%d\"" ,&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=0;i<n;i++)\n        c[i]=b[i]-a[i];\n    max=c[0] ;\n    for(i=0;i<n;i++){\n        sum=0;\n        for(j=i;j<n;j++){\n            sum=sum+c[j];\n            if(sum>max)\n                max= sum;\n       }\n    }\n    printf( \""%d\"",max);\n    return 0;\n }\n\n",ACCEPTED,3,308
1591276801765212160,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-12 11:48:48,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.*;\npublic class Main{\n    public static void main(String[]args){\n        Scanner sc=new Scanner(System.in);\n        int n=sc.nextInt();\n        for(int i=0;i<n;i++){\n            long j=sc.nextInt();\n            if(j==0){\n                System.out.println(6);\n            }\n        }\n    }\n},WRONG_ANSWER,111,16824
1591276807339442176,1ac1c697452718cae6f56347fb0bf2473480d854f77bcfb84dd289d79169690e,2022-11-12 11:48:50,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <iostream>\n#include <cmath>\nusing namespace std;\n\n#define MAX 100\nint main()\n{\n    int t;\n    int arr[MAX];\n    cout << \""请输入要输入的数字数量：\"" << endl;\n    cin >> t;\n    for (int i = 0;i < t;i++)\n    {\n        cin >> arr[i];\n    }\n    \n    for (int i = 0;i < t;i++)\n    {\n        if (arr[i] >= 0 && arr[i] <= pow(10, 9))\n        {\n            arr[i] = pow(6, arr[i]);\n            arr[i] = arr[i] % 10;\n            cout << arr[i] << endl;\n        }else\n        {\n            break;\n        }\n    }\n\n\n\n    system(\""pause\"");\n    return 0;\n}",WRONG_ANSWER,4,700
1591276836057845760,1ac1c697452718cae6f56347fb0bf2473480d854f77bcfb84dd289d79169690e,2022-11-12 11:48:56,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <iostream>\n#include <cmath>\nusing namespace std;\n\n#define MAX 100\nint main()\n{\n    int t;\n    int arr[MAX];\n    cout << \""请输入要输入的数字数量：\"" << endl;\n    cin >> t;\n    for (int i = 0;i < t;i++)\n    {\n        cin >> arr[i];\n    }\n    \n    for (int i = 0;i < t;i++)\n    {\n        if (arr[i] >= 0 && arr[i] <= pow(10, 9))\n        {\n            arr[i] = pow(6, arr[i]);\n            arr[i] = arr[i] % 10;\n            cout << arr[i] << endl;\n        }\n    }\n\n\n\n    system(\""pause\"");\n    return 0;\n}",WRONG_ANSWER,4,708
1591276933936123904,1ac1c697452718cae6f56347fb0bf2473480d854f77bcfb84dd289d79169690e,2022-11-12 11:49:20,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <iostream>\n#include <cmath>\nusing namespace std;\n\n#define MAX 100\nint main()\n{\n    int t;\n    int arr[MAX];\n    cin >> t;\n    for (int i = 0;i < t;i++)\n    {\n        cin >> arr[i];\n    }\n    \n    for (int i = 0;i < t;i++)\n    {\n        if (arr[i] >= 0 && arr[i] <= pow(10, 9))\n        {\n            arr[i] = pow(6, arr[i]);\n            arr[i] = arr[i] % 10;\n            cout << arr[i] << endl;\n        }\n    }\n\n\n\n    system(\""pause\"");\n    return 0;\n}",WRONG_ANSWER,8,580
1591276978639015936,675867a135da6702ed27c0eec3e4b6d2a7d95c44854c01823fc152f0689f010d,2022-11-12 11:49:30,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include \""stdio.h\""\n#define MAX 100\nint main()\n{\n    int a[MAX],b[MAX];\n    int max = 0;\n    int temp = 0;\n    int n,i,j;\n    scanf(\""%d\"",&n);  //关卡数\n\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(j=0;j<n;j++)\n        scanf(\""%d\"",&b[j]);\n\n    for(i=0;i<n;i++){\n        temp=temp-a[i];\n        if(max<temp)\n            max=temp;\n\n        temp=temp+b[i];\n        if(max<temp)\n            max=temp;\n    }\n    printf(\""%d\\n\"",max);\n    return 0;\n}",WRONG_ANSWER,3,184
1591277067570819072,a2fa7eb1ab1c2f6fa23517852ee6971ea32fd0c7742d71d7914ed729415f04d9,2022-11-12 11:49:52,C++,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint n,num=0,max=0;\n\tcin>>n;\n\tint a[n+1]={},b[n+1]={};\n\tfor(int i=1;i<=n;i++)\n\t    cin>>a[i];\n\tfor(int i=1;i<=n;i++)\n\t    cin>>b[i];\t\t    \n    int i=1,m=n;\n\twhile(m>0)\n\t{\n       \tif(b[i]-a[i]<=0)\n\t\t{\n\t\t\ti++;\n\t\t\tnum=0;\n\t\t}\n\t\tif(b[i]-a[i]>0)\n\t\t{\t\n\t\t    for(int j=i;j<=n;j++)\t\n\t\t    {\t\t\t    \n\t\t\t    num=num+b[j]-a[j];\n\t\t\t    if(num>max)\n\t\t\t        max=num;\t\t\t\t\t\n\t\t\t\ti=j;\n\t\t\t\tif(num+b[j+1]-a[j+1]<=0)\n\t\t\t\t{\n\t\t\t\t    num=0; \n\t\t\t        break;\n\t\t\t    }\n\t\t    }\n\t    } \n\t\tm=n-i;   \t    \n    }\n\tcout<<max;\t\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,400,440
1591277111409709056,899c5501179552dc1fe5639f9047e15d0f835e7a87c8568193377882d0278985,2022-11-12 11:50:02,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int n,i,j,m,max=0,sum=0,a[n],b[n];\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(i=1;i<=n;i++)\n        scanf(\""%d\"",&b[i]);\n    for(i=1;i<=n;i++)\n    {\n        sum=0;\n        for(j=i;j<n;j++)\n        {\n            m=b[j]-a[j];\n            sum+=m;\n            if(sum>=max)\n                max=sum;\n        }\n    }\n    printf(\""%d\\n\"",max);\n    return 0;\n}",RUNTIME_ERROR,3,392
1591277167961509888,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-12 11:50:16,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.*;\npublic class Main{\n    public static void main(String[]args){\n        Scanner sc=new Scanner(System.in);\n        int n=sc.nextInt();\n        for(int i=0;i<n;i++){\n            long j=sc.nextInt();\n            if(j==0){\n                System.out.println(1);\n            }else{\n                System.out.println(6);\n            }\n        }\n    }\n},NON_ZERO_EXIT_CODE,228,16788
1591277189650231296,217f1946625720e554af7294d3599b943eea3b430c0df7aa0c5c70abe9904e56,2022-11-12 11:50:21,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,t=int(input())\nfor i in range(t):\n    n =int(input());\n    print(6),NON_ZERO_EXIT_CODE,16,2732
1591277208088391680,a8a4c649080a65381764d05b09cdced42bbf4a58e2656f96cfc5545fc9d08327,2022-11-12 11:50:25,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<math.h>\n#include <stdio.h>\nint main()\n{\n    int i,t,n;\n    scanf(\""%d\"",&t);\n    for(i=1;i<=t;i++)\n    {\n     scanf(\""%d\"",&n);\n     if(n==0)\n        printf(\""1\\n\"");\n     else\n        printf(\""6\\n\"");\n     }\n    return 0;\n}",ACCEPTED,9,276
1591277438481530880,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-12 11:51:20,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.*;\npublic class Main{\n    public static void main(String[]args){\n        Scanner sc=new Scanner(System.in);\n        int n=sc.nextInt();\n        for(int i=0;i<n;i++){\n            long j=sc.nextInt();\n            if(j==0){\n                System.out.println(1);\n            }else{\n                System.out.println(6);\n            }\n        }\n    }\n},WRONG_ANSWER,249,16420
1591277469196398592,a8a4c649080a65381764d05b09cdced42bbf4a58e2656f96cfc5545fc9d08327,2022-11-12 11:51:27,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<math.h>\n#include <stdio.h>\nint main()\n{\n    int n,i,j,temp=0,b;\n    scanf(\""%d\"",&n);\n     for(i=2;i<=n;i++)\n     {\n      b=1;\n      for(j=2;j*j<=i;j++)\n       if(i%j==0)\n       {\n         b=0;\n         break;\n       }\n       if(b==1)\n        temp++;\n     }\n    printf(\""%d\"",temp);\n    return 0;\n}",ACCEPTED,13,348
1591277562288996352,899c5501179552dc1fe5639f9047e15d0f835e7a87c8568193377882d0278985,2022-11-12 11:51:50,C,300.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int n,i,j,m,max=0,sum=0;\n    scanf(\""%d\"",&n);\n    int a[n],b[n];\n    for(i=1;i<=n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=1;i<=n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(i=1;i<=n;i++)\n    {\n        sum=0;\n        for(j=i;j<n;j++)\n        {\n            m=b[j]-a[j];\n            sum+=m;\n            if(sum>=max)\n                max=sum;\n        }\n    }\n    printf(\""%d\\n\"",max);\n    return 0;\n}",ACCEPTED,3,312
1591277852232847360,8431638e09f2965af359dad65de967055d666c93080c899d2fe57f6173c2bcdc,2022-11-12 11:52:59,Java,0.0,1590681458522583040,1590675153003077632,1049226928954454016,import java.util.*;\npublic class Main{\n    public static void main(String[]args){\n        Scanner sc=new Scanner(System.in);\n        int n=sc.nextInt();\n        for(int i=0;i<n;i++){\n            long j=sc.nextInt();\n            if(j==0){\n                System.out.println(1);\n            }else{\n                System.out.println(6);\n            }\n        }\n    }\n},WRONG_ANSWER,253,16252
1591277869374943232,217f1946625720e554af7294d3599b943eea3b430c0df7aa0c5c70abe9904e56,2022-11-12 11:53:03,Python,0.0,1590681458522583040,1590675153003077632,1049226928954454016,t=int(input())\nfor i in range(t):\n    n =int(input());\nfor i in range(t):\n    print(6);,NON_ZERO_EXIT_CODE,16,2880
1591278066742136832,cfbed023288d929e37ec2a5f480f49533f34048e9861900771cbd8327550eb31,2022-11-12 11:53:50,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#define N 100\n\nint main()\n{\n    int n,i,j;\n    int benefitMAX=0;\n    int a[N]={0},b[N]={0},c[N]={0};\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        c[i]=b[i]-a[i];\n    }\n    for(i=0;i<n;i++)\n    {\n        int nowbenefit=0;\n        for(j=i;j<n;j++)\n        {\n            nowbenefit+=c[j];\n            if(nowbenefit>benefitMAX)\n                benefitMAX=nowbenefit;\n        }\n    }\n    printf(\""%d\\n\"",benefitMAX);\n    return 0;\n}",SEGMENTATION_FAULT,141,348
1591278233159536640,cfbed023288d929e37ec2a5f480f49533f34048e9861900771cbd8327550eb31,2022-11-12 11:54:29,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#define N 100\n\nint main()\n{\n    int n,i,j;\n    int benefitMAX=0;\n    int a[N]={0},b[N]={0},c[N]={0};\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&b[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        c[i]=b[i]-a[i];\n    }\n    for(i=0;i<n;i++)\n    {\n        int nowbenefit=0;\n        for(j=i;j<n;j++)\n        {\n            nowbenefit+=c[j];\n            if(nowbenefit>benefitMAX)\n                benefitMAX=nowbenefit;\n        }\n    }\n    printf(\""%d\\n\"",benefitMAX);\n    return 0;\n}",SEGMENTATION_FAULT,139,404
1591278313530765312,65ac58572a882f9de09782bce337ee95c6ab91ac6b377f6d29c3ee19b1a17f1a,2022-11-12 11:54:49,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\tlong long int t,j,u=0;\n\tint isprime(int n);\n\tscanf(\""%d\"",&t);\n\tfor(j=1;j<=t;j++)\n\t{\n\t\tif (isprime(j)==1) u++;\n\t}\n\tprintf(\""%d\"",u);\n\treturn 0;\n}\n\nint isprime(int n)\n{\n\tint i;\n\tif(n==2) return 1;\n\telse if(n==1||n%2==0) return 0;\n\tfor (i=3;i<=sqrt(n)+1;i+=2)\n\t{\n\t\tif(n%i==0) return 0;\n\t}\n\treturn 1;\n}",TIME_LIMIT_EXCEEDED,1000,296
1591278463007391744,675867a135da6702ed27c0eec3e4b6d2a7d95c44854c01823fc152f0689f010d,2022-11-12 11:55:24,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include \""stdio.h\""\n#define MAX 100\nint main()\n{\n    int a[MAX],b[MAX];\n    int max = 0;\n    int temp = 0;\n    int n,i,j;\n    scanf(\""%d\"",&n);  //关卡数\n\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    for(j=0;j<n;j++)\n        scanf(\""%d\"",&b[j]);\n\n    for(i=0;i<n;i++){\n        temp=temp-a[i];\n        if(max<temp)\n            max=temp;\n\n        temp=temp+b[i];\n        if(max<temp)\n            max=temp;\n    }\n    printf(\""%d\\n\"",max);\n    return 0;\n}",WRONG_ANSWER,3,320
1591278659057528832,1ac1c697452718cae6f56347fb0bf2473480d854f77bcfb84dd289d79169690e,2022-11-12 11:56:11,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <iostream>\n#include <cmath>\nusing namespace std;\n\n#define MAX 100\nint main()\n{\n    int t;\n    int arr[MAX];\n    cin >> t;\n    for (int i = 0;i < t;i++)\n    {\n        cin >> arr[i];\n    }\n    \n    for (int i = 0;i < t;i++)\n    {\n        if(i != 0){\n            cout << endl;\n        }\n        if (arr[i] >= 0 && arr[i] <= pow(10, 9))\n        {\n            arr[i] = pow(6, arr[i]);\n            arr[i] = arr[i] % 10;\n            cout << arr[i];\n        }\n    }\n\n    system(\""pause\"");\n    return 0;\n}",WRONG_ANSWER,7,700
1591278827844710400,d9e13de81d487f21b11cf0fc38d2ef82b49d511a81ed1305cdfa47276a1c2e23,2022-11-12 11:56:51,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,n,t,a;\n    scanf(\""%d\\n\"",&t);\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&n);\n        if(n==0)\n            a=1;\n        else\n            a=6;\n            printf(\""%d\\n\"",a);\n    }\n}\n",ACCEPTED,9,356
1591278841442643968,65ac58572a882f9de09782bce337ee95c6ab91ac6b377f6d29c3ee19b1a17f1a,2022-11-12 11:56:54,Python,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"for i in range(1,10000)\nprint('%04d'%i)",NON_ZERO_EXIT_CODE,17,3000
1591278849025966080,1ac1c697452718cae6f56347fb0bf2473480d854f77bcfb84dd289d79169690e,2022-11-12 11:56:56,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <iostream>\n#include <cmath>\nusing namespace std;\n\n#define MAX 100\nint main()\n{\n    int t;\n    int arr[MAX];\n    cin >> t;\n    for (int i = 0;i < t;i++)\n    {\n        cin >> arr[i];\n    }\n    \n    for (int i = 0;i < t;i++)\n    {\n        if(i != 0){\n            cout << endl;\n        }\n        if (arr[i] >= 0 && arr[i] <= pow(10, 9))\n        {\n            arr[i] = pow(6, arr[i]);\n            arr[i] = arr[i] % 10;\n            cout << arr[i];\n        }else{\n            break;\n        }\n    }\n\n    system(\""pause\"");\n    return 0;\n}",WRONG_ANSWER,8,720
1591278861298499584,d9e13de81d487f21b11cf0fc38d2ef82b49d511a81ed1305cdfa47276a1c2e23,2022-11-12 11:56:59,C,300.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int i,n,t,a;\n    scanf(\""%d\\n\"",&t);\n    for(i=0;i<t;i++)\n    {\n        scanf(\""%d\"",&n);\n        if(n==0)\n            a=1;\n        else\n            a=6;\n            printf(\""%d\\n\"",a);\n    }\n}\n",ACCEPTED,10,320
1591278921377689600,65ac58572a882f9de09782bce337ee95c6ab91ac6b377f6d29c3ee19b1a17f1a,2022-11-12 11:57:14,Python,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"for i in range(1,10000)\nprint('%04d'%i)\nreturn 0",NON_ZERO_EXIT_CODE,15,2872
1591278993003819008,1ac1c697452718cae6f56347fb0bf2473480d854f77bcfb84dd289d79169690e,2022-11-12 11:57:31,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <iostream>\n#include <cmath>\nusing namespace std;\n\n#define MAX 9999\nint main()\n{\n    int t;\n    int arr[MAX];\n    cin >> t;\n    for (int i = 0;i < t;i++)\n    {\n        cin >> arr[i];\n    }\n    \n    for (int i = 0;i < t;i++)\n    {\n        if(i != 0){\n            cout << endl;\n        }\n        if (arr[i] >= 0 && arr[i] <= pow(10, 9))\n        {\n            arr[i] = pow(6, arr[i]);\n            arr[i] = arr[i] % 10;\n            cout << arr[i];\n        }else{\n            break;\n        }\n    }\n\n    system(\""pause\"");\n    return 0;\n}",WRONG_ANSWER,9,680
1591279032631603200,1ac1c697452718cae6f56347fb0bf2473480d854f77bcfb84dd289d79169690e,2022-11-12 11:57:40,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <iostream>\n#include <cmath>\nusing namespace std;\n\n#define MAX 9999\nint main()\n{\n    int t;\n    int arr[MAX];\n    cin >> t;\n    for (int i = 0;i < t;i++)\n    {\n        cin >> arr[i];\n    }\n    \n    for (int i = 0;i < t;i++)\n    {\n        if(i != 0){\n            cout << endl;\n        }\n        if (arr[i] >= 0 && arr[i] <= pow(10, 9))\n        {\n            arr[i] = pow(6, arr[i]);\n            arr[i] = arr[i] % 10;\n            cout << arr[i];\n        }else{\n            break;\n        }\n    }\n\n    system(\""pause\"");\n    return 0;\n}",WRONG_ANSWER,11,696
1591279051552129024,1ac1c697452718cae6f56347fb0bf2473480d854f77bcfb84dd289d79169690e,2022-11-12 11:57:45,C++,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <iostream>\n#include <cmath>\nusing namespace std;\n\n#define MAX 9999\nint main()\n{\n    int t;\n    int arr[MAX];\n    cin >> t;\n    for (int i = 0;i < t;i++)\n    {\n        cin >> arr[i];\n    }\n    \n    for (int i = 0;i < t;i++)\n    {\n        if(i != 0){\n            cout << endl;\n        }\n        if (arr[i] >= 0 && arr[i] <= pow(10, 9))\n        {\n            arr[i] = pow(6, arr[i]);\n            arr[i] = arr[i] % 10;\n            cout << arr[i];\n        }else{\n            break;\n        }\n    }\n\n    \n    return 0;\n}",WRONG_ANSWER,8,600
1591279087509901312,cfbed023288d929e37ec2a5f480f49533f34048e9861900771cbd8327550eb31,2022-11-12 11:57:53,C,300.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include<stdio.h>\n#define N 100\n\nint main()\n{\n    int i,j,n;\n    int a=3;\n    scanf(\""%d\"",&n);\n    for(i=7;i<n;i++)\n    {\n        for(j=2;j*j<=i;j++)\n        {\n            if(i%j==0)\n                break;\n        }\n        if(j*j>i)\n            a++;\n    }\n    printf(\""%d\\n\"",a);\n    return 0;\n}",ACCEPTED,12,328
1591279128731521024,65ac58572a882f9de09782bce337ee95c6ab91ac6b377f6d29c3ee19b1a17f1a,2022-11-12 11:58:03,Python,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"for i in range(1,10000)\nprint('%04d'%i)\n",NON_ZERO_EXIT_CODE,16,2744
1591279186889736192,d9e13de81d487f21b11cf0fc38d2ef82b49d511a81ed1305cdfa47276a1c2e23,2022-11-12 11:58:17,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int m,i,j,k,n=0,flag=1;\n    scanf(\""%d\"",&m);\n    for(i=2;i<=m;i++)\n    {\n        k=sqrt(i);\n        for(j=2;j<=k;j++)\n            if(i%j==0)\n                break;\n            if(j>k)\n                n++;\n    }\n    printf(\""%d\"",n);\n    return 0;\n",COMPILE_ERROR,0,0
1591279256481632256,d9e13de81d487f21b11cf0fc38d2ef82b49d511a81ed1305cdfa47276a1c2e23,2022-11-12 11:58:33,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int m,i,j,k,n=0,flag=1;\n    scanf(\""%d\"",&m);\n    for(i=2;i<=m;i++)\n    {\n        k=sqrt(i);\n        for(j=2;j<=k;j++)\n            if(i%j==0)\n                break;\n            if(j>k)\n                n++;\n    }\n    printf(\""%d\"",n);\n    return 0;\n",COMPILE_ERROR,0,0
1591279399016640512,65ac58572a882f9de09782bce337ee95c6ab91ac6b377f6d29c3ee19b1a17f1a,2022-11-12 11:59:07,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main(){\n    printf(\""%04d\"");\n}",WRONG_ANSWER,3,364
1591279426220920832,65ac58572a882f9de09782bce337ee95c6ab91ac6b377f6d29c3ee19b1a17f1a,2022-11-12 11:59:14,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main(){\n    printf(\""%4d\"");\n}",WRONG_ANSWER,3,196
1591279455560052737,453285058ad721dec4e5d0f61707f295aaddf066021a84ead6a70901f10455df,2022-11-12 11:59:21,C,0.0,1590681458522583040,1590675153003077632,1049226928954454016,"#include <stdio.h>\n#define N 3\nint main()\n{\n    int a[N],i,m;\n    printf(\""%d\\n\"",N);\n  for(i=0;i<N;i++)\n    scanf(\""%d\"",&a[i]);\n   m=6^a[i]%10;\n   printf(\""%d\\n\"",m);\n    return 0;\n}\n",WRONG_ANSWER,3,324
1591279478200930304,65ac58572a882f9de09782bce337ee95c6ab91ac6b377f6d29c3ee19b1a17f1a,2022-11-12 11:59:26,C,0.0,1590528927448293376,1590525945717575680,1049226928954454016,"#include<stdio.h>\nint main(){\n    printf(\""%4d\"");\n}",WRONG_ANSWER,4,316
1591279499617042432,d9e13de81d487f21b11cf0fc38d2ef82b49d511a81ed1305cdfa47276a1c2e23,2022-11-12 11:59:31,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int m,i,j,k,n=0,flag=1;\n    scanf(\""%d\"",&m);\n    for(i=2;i<=m;i++)\n    {\n        k=sqrt(i);\n        for(j=2;j<=k;j++)\n            if(i%j==0)\n                break;\n        if(j>k)\n            n++;\n    }\n    printf(\""%d\"",n);\n    return 0;\n",COMPILE_ERROR,0,0
1591279566390366208,d9e13de81d487f21b11cf0fc38d2ef82b49d511a81ed1305cdfa47276a1c2e23,2022-11-12 11:59:47,C,0.0,1590681458522583041,1590676393489461248,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main(void)\n{\n    int m,i,j,k,n=0,flag=1;\n    scanf(\""%d\"",&m);\n    for(i=2;i<=m;i++)\n    {\n        k=sqrt(i);\n        for(j=2;j<=k;j++)\n            if(i%j==0)\n                break;\n        if(j>k)\n            n++;\n    }\n    printf(\""%d\"",n);\n    return 0;\n",COMPILE_ERROR,0,0
1591279578990030848,e4f316bfe970c62bf57b46f5ef8a290748707bf16f041fe868d04986a0cdd64f,2022-11-12 11:59:50,C,0.0,1590524835191705600,1572865591226855424,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main()\n{\n    int n,i;\n    scanf(\""%d\"",&n);\n    int x;\n    int cnt = 0;\n    for(i=0;i<n;i++){\n        scanf(\""%d\"",&x);\n        cnt++;\n        if(x==0){\n            printf(\""1\"");\n        }else{\n        printf(\""6\"");\n        }\n        if(cnt!=n){\n            printf(\""\\n\"");\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,3,184
1591279612573843456,cfbed023288d929e37ec2a5f480f49533f34048e9861900771cbd8327550eb31,2022-11-12 11:59:58,C,0.0,1590734963702620160,1590734503495200768,1049226928954454016,"#include<stdio.h>\n#define N 100\n\nint main（）\n{\n int n,i,j;\n int benefitMAX=0;\n int a[N]=0.b[N]=0,c[N]=0;\n scanf(\""%d\"",&n);\n for(i=0;i<n;i++)\n {\n scanf(\""%d\"",&a[i]);\n }\n for(i=0)\n}",COMPILE_ERROR,0,0
1572966231978704896,3dcf32868d7a750bb24733cc752e8b34486b532e90524d2606d8643387f183e4,2022-09-22 23:09:08,C++,300.0,1572962143937163265,1572865591226855424,1049226928954454016,"#include \""bits/stdc++.h\""\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> PII;\n#define rep(i,a,n) for(int i = a; i < n; i++)\n#define per(i,n,a) for(int i = n-1; i >= a; i--)\n#define debug(a) printf(\""#: %d \"",a);\n#define fr first\n#define se second\n#define be begin()\n#define ed end()\n#define pb push_back\n#define mk make_pair\n#define pf printf\n#define ins insert\n#define sz size()\n#define int long long\n#define morestack    int size(512<<20);  __asm__ ( \""movq %0, %%rsp\\n\""::\""r\""((char*)malloc(size)+size));\n#define mem(a,i) memset(a,i,sizeof (a))\n#define fastIO ios::sync_with_stdio(false),cin.tie(NULL)\n//char buf[1<<23],*p1=buf,*p2=buf;\n//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)\n//inline int read()\n//{\n//    int s=0;\n//    char ch = getchar(),last;\n//    while(ch<'0'||ch>'9') last = ch, ch = getchar();\n//    while(ch>='0'&&ch<='9') s=(s<<1)+(s<<3)+(ch^48),ch=getchar();\n//    return last=='-'?-s:s;\n//}\ninline int read(){\n    int x=0,f=1;\n    char ch = getchar();\n    while(ch<'0'||ch>'9'){\n        if(ch=='-')\n            f=-1;\n        ch = getchar();\n    }\n    while(ch>='0'&&ch<='9'){\n        x=(x<<1)+(x<<3)+(ch^48);\n        ch = getchar();\n    }\n    return x*f;\n}\nconst int MOD = 998244353;\nll INF = 1e18;\nll gcd(ll a,ll b){\n    return b ? gcd(b,a%b) : a;\n}\nconst int N = 2e5 + 10;\n\nint dp[50];\nvoid solve(){\n   int a = read(),b = read(),c= read();\n   pf(\""%lld\\n\"",a+b-c);\n}\nsigned main(void){\n\n   solve();\n\n    return  0;\n}\n\n\n//#include<bits/stdc++.h>\n//#include<fstream>\n//const int inf = 2139062143;\n//const int MOD = 998244353;\n//const int MAXN = 200100;\n//using namespace std;\n//int a[4] = {3,5,4,7};\n//int main()\n//{\n//\n////    freopen(\""D:\\\\algorithm\\\\3.in\"",\""r\"",stdin);\n////    ofstream mycout(\""D:\\\\algorithm\\\\3.out\"");\n////    int t;cin >> t;\n////    while(t--) {\n////        int n,m;\n////        cin >> n >> m;\n////        for(int i = 1; i <= n; i++){\n////            cin >> b[i] >> l[i] >> h[i];\n////            if(b[i] <= b[i-1] || (h[i] < l[i])){\n////                cout << i << endl;\n////            }\n////        }\n////        bool flag = true;\n////        long long  mi = m,mx = m;\n////        for(int i = 1; i <= n; i++){\n////            mi -= b[i] - b[i-1];\n////            mx += b[i] - b[i-1];\n////\n////            if(mi > h[i] || mx < l[i]){\n////                flag = false;break;\n////            }\n////            mi = max(mi,l[i]);mx = min(mx,h[i]);\n////        }\n////        if(flag)mycout << \""YES\"" << endl;\n////        else mycout << \""NO\"" << endl;\n////    }\n////    ofstream mycout(\""D:\\\\algorithm\\\\3.in\"");\n////    int x = 500;\n////    mycout << x << endl;\n////    while (x--){\n////        int n = rand()%90+1,m = rand()%8000000+1,now = 0;\n////        mycout << n << \"" \"" << m << endl;\n////        while (n--){\n////            int ti = rand()%700000;\n////            now += ti;\n////            int c = rand()%760000000,d = rand()%508000000;\n////            if(c > d)swap(c,d);\n////            mycout << now <<  \"" \"" << c << \"" \"" <<  d << endl;\n////        }\n////    }\n////    return 0;\n//}\n",ACCEPTED,8,452
1573526877799612416,0d97f8676f8329cb267f0e470b71ae15a629f07e888f5155af8a19d5b7a400e4,2022-09-24 12:16:57,C++,300.0,1573524790034235392,1572865591226855424,1049226928954454016,"#include <stdio.h>\n\nint main(void)\n{\n    int a, b, c;\n    scanf(\""%d %d %d\"", &a, &b, &c);\n    printf(\""%d\"", a + b - c);\n    return 0;\n}",ACCEPTED,8,196
1573621081146032128,64475a8ecd7d5a6c6e734f3f299283e039c26933b2a0e510cd9d22e95ba92068,2022-09-24 18:31:16,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\n\n\nint main()\n{\n\tint a,b,c;\n\tcin>>a>>b>>c;\n\t\n\tprintf(\""%d\"",a+b-c); \n\t\t\n\treturn 0;\n} ",COMPILE_ERROR,0,0
1573621105841758208,a5291eb67188c2a916aa5dd9fc38f2e449aa9f9a3cd047f282d8c154ea2979cd,2022-09-24 18:31:22,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int X = 0;\n    int Y = 0;\n    int Z = 0;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    \n    \n    printf(\""%d\"",X+Y-Z);\n    \n    \n    return 0;\n}",ACCEPTED,16,328
1573621107485925376,64475a8ecd7d5a6c6e734f3f299283e039c26933b2a0e510cd9d22e95ba92068,2022-09-24 18:31:23,C++,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\n\n\nint main()\n{\n\tint a,b,c;\n\tcin>>a>>b>>c;\n\t\n\tprintf(\""%d\"",a+b-c); \n\t\t\n\treturn 0;\n} ",ACCEPTED,11,328
1573621191791771648,eeab3421c2b685f7d51b09a289b82fe82ba0d3896984d09aeffb9d022232d887,2022-09-24 18:31:43,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\nvoid main()\n{\n\n    int i,j,k;\n    scanf(\""%d %d %d\"",&i,&j,&k);\n    printf(\""%d\"",i+j-k);\n}",ACCEPTED,8,336
1573621274725744640,0354b067c4132d4425a90b77482ac717447702274cb7db1282edce56eaf037b3,2022-09-24 18:32:03,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n}",ACCEPTED,10,196
1573621301816414208,c97039bab9fdc17c82fc31c97304fc1cf588f2d53d6ca17594640ee86826585b,2022-09-24 18:32:09,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n    return 0;\n}",ACCEPTED,10,324
1573621317737996288,7935e8f5cb04027f4d30ac84a997e2d03e946e112c1cb17f1a4f943d8b0b54bf,2022-09-24 18:32:13,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z,F;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    F=X+Y-Z;\n    printf(\""%d\"",F);\n    return 0;\n}\n",ACCEPTED,9,472
1573621336448782336,2e4af98c441106efa9ee51f8a781d0eee91a3dff6193987d421eb3a48725c814,2022-09-24 18:32:17,C++,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <iostream>\nusing namespace std;\nint main() {\nint a,b,c;\nint y;\ncin>>a>>b>>c;\ny= a+b-c;\ncout<<y;\n}",ACCEPTED,10,324
1573621371789987840,e715137eeb4190ade2330123b989bbdd6eebd9a5e1df2e292271d3bfe3a79c69,2022-09-24 18:32:26,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nvoid main()\n{\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    print(\""%d\"",x+y-z);\n    \n}",COMPILE_ERROR,0,0
1573621510579511296,05f9d62a2660f27e0711448c225e5e0fe6347745a2c93edb6296c0a2ffbc6605,2022-09-24 18:32:59,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nmain()\n{\n    int X,Y,Z,F;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    F=X+Y-Z;\n    printf(\""%d\"",F);\n    \n}",ACCEPTED,11,512
1573621515113889792,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-09-24 18:33:00,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x,y,z,sum;\n    scanf(\""%d %d %d\"",x,y,z);\n    sum=x+y-z;\n    printf(\""%d\"",sum);\n    \n}",SEGMENTATION_FAULT,7,324
1573621534017617920,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-09-24 18:33:04,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main()\n{\n\tint x,y,z,d;\n\tscanf(\""%d %d %d\"",x,y,z);\n\td=x+y-z;\n\tprintf(\""%d\"",&d);\n\treturn 0;\n}",SEGMENTATION_FAULT,6,196
1573621568184418304,a57fdafe4877cd9608fc0ac8a5120a47bc60a015785960e61b67b4e66187c2f2,2022-09-24 18:33:12,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int a,b,c,d;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    d = a+b-c;\n    printf(\""%d\"",d);\n    return 0;\n}",ACCEPTED,10,352
1573621584210853888,e715137eeb4190ade2330123b989bbdd6eebd9a5e1df2e292271d3bfe3a79c69,2022-09-24 18:33:16,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d\\n\"",x+y-z);\n    \n}",ACCEPTED,7,204
1573621595166375936,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-09-24 18:33:19,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main()\n{\n\tint x,y,z,d;\n\tscanf(\""%d %d %d\"",&x,&y,&z);\n\td=x+y-z;\n\tprintf(\""%d\"",&d);\n\treturn 0;\n}",WRONG_ANSWER,4,332
1573621604779384832,d414d060728bb1ba8f4e64cce23da55d7e912d7ac1797eb188f51e9cd70d4555,2022-09-24 18:33:21,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x,y,z,sum;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    sum=x+y-z;\n    printf(\""%d\"",sum);\n    return 0;\n}",ACCEPTED,11,508
1573621607480512512,8f29029dc8006da83949d2656cc7dc83026d851252066fd4a9fc89071673ec96,2022-09-24 18:33:22,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main(){\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n}",ACCEPTED,10,472
1573621631577128960,0d24b4ee85e6e3a4cc694f7e11105fa2aaf93fd10d4cbe81657f252e2d675435,2022-09-24 18:33:28,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n\n  int num1, num2,num3;\n  scanf(\""%d %d %d\"",&num1,&num2,&num3);\n  printf(\""%d\"",num1+num2-num3);\n\n    return 0;\n}\n",ACCEPTED,8,324
1573621661889024000,7e6a67f270e740aba8788a12d9a49939621a28d5059d3ced2247a86914b0a3b3,2022-09-24 18:33:35,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int x,y,z,sum=0;\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    sum=x+y-z;\n    printf(\""%d\"",sum);\n}\n",ACCEPTED,10,324
1573621697771294720,c5cc6f9845df4bd1986af86c0696296436bbc0f00a10a9f891b4100e57bc3a19,2022-09-24 18:33:43,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n    return 0;\n}\n",ACCEPTED,10,476
1573621714817286144,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-09-24 18:33:47,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main()\n{\n\tint x,y,z,d;\n\tscanf(\""%d%d%d\"",&x,&y,&z);\n\td=x+y-z;\n\tprintf(\""%d\"",&d);\n\treturn 0;\n}",WRONG_ANSWER,5,328
1573621740742279168,80a250fa0f0a2803dee3ded7fc9d04b68ebe099f7d2e152c1f7c83f0b8e4d6a5,2022-09-24 18:33:54,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int F(x);\n    int X,Y,Z;\n    F(x)=X+Y-Z;\n    scanf(\""%d,%d,%d\"",&X,&Y,&Z);\n    printf(\""d\"",F(x));\n    return 0;\n}",COMPILE_ERROR,0,0
1573621795293396992,40c43472973ea298adbdd1d4b900aeb63cfa4cfe17179f01a4827cd2c6624d3a,2022-09-24 18:34:07,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int X,Y,Z,F;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    F=X+Y-Z;\n    printf(\""%d\"",F);\n}",ACCEPTED,9,328
1573621813508919296,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-09-24 18:34:11,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main()\n{\n\tint x,y,z,m;\n\tscanf(\""%d%d%d\"",&x,&y,&z);\n\tm=x+y-z;\n\tprintf(\""%d\"",&m);\n\treturn 0;\n}",WRONG_ANSWER,7,496
1573621858195374080,dc51215c5395109bbc10bc63c675ffa81d01cfb5453f3074a870913a5749c1fa,2022-09-24 18:34:22,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main()\n{\n\tint x,y,z,m;\n\tscanf(\""%d%d%d\"",&x,&y,&z);\n\tm=x+y-z;\n\tprintf(\""%d\"",m);\n\treturn 0;\n}",ACCEPTED,13,332
1573621888842817536,40c43472973ea298adbdd1d4b900aeb63cfa4cfe17179f01a4827cd2c6624d3a,2022-09-24 18:34:29,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\nmain()\n{\n    int X,Y,Z,F;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    F=X+Y-Z;\n    printf(\""%d\"",F);\n}",ACCEPTED,8,324
1573621950876569600,675867a135da6702ed27c0eec3e4b6d2a7d95c44854c01823fc152f0689f010d,2022-09-24 18:34:44,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\nmain()\n{\n\tint x, y, z;\n\tscanf(\""%d%d%d\"",&x,&y,&z);\n\tif(x>=100&&x<=100||y>=100&&y<=100||z>=100&&z<=100)\n\t\treturn 0;\n\tprintf(\""%d\"",x+y-z);\n\t\n\treturn 0;\n } ",ACCEPTED,8,468
1573621975367110656,28b4de6882b7ade2679f59c486acaf307ce8415dcb0a15787dba589025bbdb02,2022-09-24 18:34:50,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint main()\n{\n\tint x,y,z;\n\tscanf(\""%d%d%d\"",&x,&y,&z);\n\tprintf(\""%d\"",x+y-z);\n\treturn 0;\n } ",ACCEPTED,11,328
1573622051049136128,7310135b9c9422c45d35553cb166f3e6e49919961fe8ee45fea6e98e16951395,2022-09-24 18:35:08,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<studio.h>\nint X,Y,Z,f\n{\n scanf(&d&d&d,X,Y,Z);\n f=X+Y-Z;\n return 0;\n}",COMPILE_ERROR,0,0
1573622052009967616,80a250fa0f0a2803dee3ded7fc9d04b68ebe099f7d2e152c1f7c83f0b8e4d6a5,2022-09-24 18:35:08,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int F;\n    int X,Y,Z;\n    F=X+Y-Z;\n    scanf(\""%d,%d,%d\"",&X,&Y,&Z);\n    printf(\""%d\"",F);\n    return 0;\n}",WRONG_ANSWER,6,348
1573622092036210688,29d1ea54d6e4e56fc2de0be5ae10ecc4c70c7fca667934b17857e95530f5663a,2022-09-24 18:35:17,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,b,c,f;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    f=a+b-c;\n    printf(\""%d\"",f);\n    \n}",ACCEPTED,11,484
1573622106271342592,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-09-24 18:35:21,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x,y,z,t;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    t=x+y+z;\n    printf(\""%d\"",t);\n    return 0;\n}",WRONG_ANSWER,5,320
1573622115372982272,18edd37286e4ec6b0cac3a0258151a4ae1b5b6cf3092e7bd82866b209ff7cda4,2022-09-24 18:35:23,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int X,Y,Z;\n    int F;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    F=X+Y−Z;\n    printf(\""%d\"",F);\n    return 0;\n}",COMPILE_ERROR,0,0
1573622136034123776,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-09-24 18:35:28,C++,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <iostream>\nint main()\n{\n    int X,Y,Z,U;\n    if((Z<0&&Z>100)&&(X<0&&X>100)&&(Y<0&&Y>100))\n        cout<<\""it is error!\""\n        else\n        U=X+Y+Z;\n        cout<<Y;\n    return 0;\n}",COMPILE_ERROR,0,0
1573622149380399104,44042a4519c9231aa21c54eb113b7a08f98bcd7db4839a20a61ab6ce51fce357,2022-09-24 18:35:31,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int x,y,z,mun;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    mun=x+y-z;\n    printf(\""%d\"",mun);\n\n\n\n\n\n\n\n\n\n\n    return 0;\n}\n",ACCEPTED,11,328
1573622149590110208,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-09-24 18:35:31,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n    int X,Y,Z,F(x);\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    f(X)=X+Y-Z;\n    printf(\""%d\"",F(x));\n    return 0;\n}",COMPILE_ERROR,0,0
1573622160050708480,1f29a576db974352c60cbe8aafdc4e5328b24d800890ab1c712d8c9fa85d72cc,2022-09-24 18:35:34,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b,c;\n    scanf(\""%d\"",&a);\n    scanf(\""%d\"",&b);\n    scanf(\""%d\"",&c);\n    int f;\n    f=a+b-c;\n    printf(\""%d\"",f);\n    return 0;\n}\n",ACCEPTED,12,376
1573622172763979776,887d1bbe53a4d4a349813887f13126da5e46a853687f4c2c9d7b8ef3d748a9d6,2022-09-24 18:35:37,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n     int x,y,z,f;\n     scanf(\""%d%d%d\"",&x,&y,&z);\n     f=x+y-z;\n     printf(\""%d\"",f);\n}\n",ACCEPTED,11,328
1573622173178875904,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-09-24 18:35:37,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x,y,z,t;\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    t=x+y+z;\n    printf(\""%d\"",t);\n    return 0;\n}",WRONG_ANSWER,4,196
1573622223967703040,27da4b3373d2bf9f3bcb2930f579e54b56c57991074e3a3f50df547f1187a19c,2022-09-24 18:35:49,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z,F;\n    scanf(\""%d,%d,%d\"",&X,&Y,&Z);\n    F=X+Y-Z;\n    printf(\""%d\\n\"",F);\n    return 0;\n}\n",WRONG_ANSWER,5,328
1573622227730333696,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-09-24 18:35:50,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x,y,z,t;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    t=x+y-z;\n    printf(\""%d\"",t);\n    return 0;\n}",ACCEPTED,8,328
1573622260047446016,1363fe5b260b83108efff76d53fc3ee37db1aa74f7eb5c5c7e6dacb996b49862,2022-09-24 18:35:57,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n\n\nint main()\n{\n\tint x,y,z,f;\n\tscanf(\""%d %d %d\"",&x,&y,&z);\n\tf=x+y-z;\n\tprintf(\""%d\"",f);\n\n\treturn 0;\n}",ACCEPTED,10,332
1573622309657337856,c76414e1d2d8531a5745e9bd3192aafa7cca924e645650ffe7954c992cc13b33,2022-09-24 18:36:09,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint f(x1,x2,x3)\n{\nint result;\nresult=x1+x2-x3;\nprintf(\""%d\"",result);\n}\nint main()\n{\n    int x1,x2,x3;\n    scanf(\""%d%d%d\"",&x1,&x2,&x3);\n    f(x1,x2,x3);\n    return 0;\n}\n",ACCEPTED,8,200
1573622336416993280,5d127211f3edce9d9bd1062c03cd08473e4481ec46b4b0c70c2e8d9141c68f20,2022-09-24 18:36:16,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nmain()\n{\n    int X,Y,Z,fmy;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    fmy=X+Y-Z;\n    printf(\""%d\"",fmy);\n}",ACCEPTED,12,512
1573622367085744128,1c76961e293959cbfa749568290c58d912c131cbc4a710b8bd9a4e58eccf0b8e,2022-09-24 18:36:23,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,b,c,d;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    d=a+b-c;\n    printf(\""%d\"",d);\n    return 0;\n}",ACCEPTED,10,328
1573622376863006720,e8dd0783a99f122290484ff16204a2edfe22a45233ce82aee631ee0108f62493,2022-09-24 18:36:25,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int a,b,c,d;\n    scanf(\""%d%d%d\"",&a,&b,&c);\n    d=a+b-c;\n    printf(\""%d\"",d);\n    return 0;\n}\n",ACCEPTED,9,372
1573622414493966336,80a250fa0f0a2803dee3ded7fc9d04b68ebe099f7d2e152c1f7c83f0b8e4d6a5,2022-09-24 18:36:34,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int F;\n    int X,Y,Z;\n    F=X+Y-Z;\n    A>=0;\n    B<=100;\n    C<=100;\n    scanf(\""%d,%d,%d\"",&X,&Y,&Z);\n    printf(\""%d\"",F);\n    return 0;\n}",COMPILE_ERROR,0,0
1573622428284837888,18edd37286e4ec6b0cac3a0258151a4ae1b5b6cf3092e7bd82866b209ff7cda4,2022-09-24 18:36:38,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int X,Y,Z;\n    int F;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    F=X+Y-Z;\n    printf(\""%d\"",F);\n    return 0;\n}",ACCEPTED,8,352
1573622442780352512,652f515ab38d5c6f1dda2c0b50eade2e24c85c234f7c2d8bf598587e48ef38cd,2022-09-24 18:36:41,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint shuzi(int x,int y,int z)\n{\n    int a;\n    a=x+y-z;\n    return a;\n}\n\nint main()\n{\n    int x,y,z,c;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    c=shuzi(x,y,z);\n    printf(\""%d\"",c);\n    return 0;\n}\n",ACCEPTED,9,368
1573622463084974080,1bf0799d9c686a2f0d10cf3e8c6c19023212e70fdb74b8e74e5cb0a46d324c4a,2022-09-24 18:36:46,Python,0.0,1573557741782495234,1572865591226855424,1049226928954454016,x =(int)input()\ny =(int)input()\nz=(int)input()\na=x +y-z\nprint(a),NON_ZERO_EXIT_CODE,17,2760
1573622476187983872,cd30dfd72c6adde8aa106cdc73bfa2505abc2f20b5500cb4f32da1ca33a3ef6e,2022-09-24 18:36:49,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n     int X,Y,Z;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    printf(\""%d\"",X+Y-Z);\n    return 0;\n}\n",ACCEPTED,9,200
1573622477806985216,190178fcb71270e17fbe689a22517f5296281dfcd3b16ec01748057e49740d1d,2022-09-24 18:36:49,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z;\n    X,Y,Z>=0&&X,Y,Z<=100;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    printf(\""%d\"",X+Y-Z);\n    return 0;\n}",ACCEPTED,10,348
1573622478238994432,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-09-24 18:36:49,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int X,Y,Z,F;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    if(X>=0&&X<=100)\n    {\n        if(Y>=0&&Y<=100)\n            if(Z>=0&&Z<=100)\n                F=X+Y-Z;\n    }\n    printf(\""%d\"",&F);\n    return 0;\n}",WRONG_ANSWER,4,324
1573622518038745088,7310135b9c9422c45d35553cb166f3e6e49919961fe8ee45fea6e98e16951395,2022-09-24 18:36:59,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<studio.h>\nint main()\n{\n   int X,Y,Z;\n   scanf(&d&d&d,X,Y,Z);\n   if()\n   f=X+Y-Z;\n   return 0;\n}",COMPILE_ERROR,0,0
1573622525286502400,1bf0799d9c686a2f0d10cf3e8c6c19023212e70fdb74b8e74e5cb0a46d324c4a,2022-09-24 18:37:01,Python,0.0,1573557741782495234,1572865591226855424,1049226928954454016,x =(int)input()\ny =(int)input()\nz=(int)input()\na=x +y-z\nprint(a),NON_ZERO_EXIT_CODE,16,2760
1573622582048018432,bcc80c637e0ae4837743d463049e862b206c31483ff6a67b35742ac5d66647d7,2022-09-24 18:37:14,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n  int X,Y,Z,F(x);\n  scanf(\""%d%d%d\"",&X,&Y,&Z);\n  F(x)=X+Y-Z;\n  printf(\""%d\"",F(x));\n}\n",COMPILE_ERROR,0,0
1573622621537730560,27fbb32d960dbf49665c8905b68012d602eda68987686c6f224ec7b49ca3d0ac,2022-09-24 18:37:24,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int x,y,z,s;\n    print(\""请输入三个整数：\"");\n    scanf(\""%d%d%d\"",&x&y&z);\n    if(x>=0&&c<=100)\n    s=x+y-z;\n    printf(\""%d\"",s);\n    else\n        return 0;\n    \n}",COMPILE_ERROR,0,0
1573622646413807616,bcc80c637e0ae4837743d463049e862b206c31483ff6a67b35742ac5d66647d7,2022-09-24 18:37:30,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n  int X,Y,Z,F;\n  scanf(\""%d%d%d\"",&X,&Y,&Z);\n  F=X+Y-Z;\n  printf(\""%d\"",F;\n}\n",COMPILE_ERROR,0,0
1573622693088362496,bcc80c637e0ae4837743d463049e862b206c31483ff6a67b35742ac5d66647d7,2022-09-24 18:37:41,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n  int X,Y,Z,F;\n  scanf(\""%d%d%d\"",&X,&Y,&Z);\n  F=X+Y-Z;\n  printf(\""%d\"",F);\n}\n",ACCEPTED,8,324
1573622703775449088,75a6755f083ffc71d77ba6ce593bd24fe8a2ce61edc4710fbde2dce128c47ab4,2022-09-24 18:37:43,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint sum(int x,int y,int z)\n{\n    int a;\n    a=x+y-z;\n  return a;\n}\n\nint main()\n{\n    int x,y,z;\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    printf(\""%d\"",sum(x,y,z));\n    return 0;\n}\n",ACCEPTED,8,328
1573622742157185024,80a250fa0f0a2803dee3ded7fc9d04b68ebe099f7d2e152c1f7c83f0b8e4d6a5,2022-09-24 18:37:52,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int F;\n    int X,Y,Z;\n    F=X+Y-Z;\n    if(x>=0;y&&z<=00)\n    scanf(\""%d,%d,%d\"",&X,&Y,&Z);\n    printf(\""%d\"",F);\n    return 0;\n}",COMPILE_ERROR,0,0
1573622744275648512,1bf0799d9c686a2f0d10cf3e8c6c19023212e70fdb74b8e74e5cb0a46d324c4a,2022-09-24 18:37:53,Python,0.0,1573557741782495234,1572865591226855424,1049226928954454016,x =(int)input()\ny =(int)input()\nz=(int)input()\na=x +y-z\nprint(a)\nreturn 0,NON_ZERO_EXIT_CODE,16,2772
1573622783983124480,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-09-24 18:38:02,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int X,Y,Z,F;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    F=X+Y-Z;\n    printf(\""%d\"",F);\n    return 0;\n}",ACCEPTED,10,196
1573622818707427328,7310135b9c9422c45d35553cb166f3e6e49919961fe8ee45fea6e98e16951395,2022-09-24 18:38:11,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<studio.h>\nint main()\n{\n   int X,Y,Z;\n   scanf(&d&d&d,X,Y,Z);\n   if(0<=X&&X<=100,0<=Y<=100;0<=Y<=100)\n   {\n   f=X+Y-Z;\n   return 0;\n   }\n}",COMPILE_ERROR,0,0
1573622842392662016,1bf0799d9c686a2f0d10cf3e8c6c19023212e70fdb74b8e74e5cb0a46d324c4a,2022-09-24 18:38:16,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int X,Y,Z;\n    a=X+Y-Z;\n    scanf(\""%d%d%d,&X,&Y,&Z\"");\n    printf(\""%d\"",a);\n    \n    \n    return 0;\n    \n}\n",COMPILE_ERROR,0,0
1573622883454902272,7310135b9c9422c45d35553cb166f3e6e49919961fe8ee45fea6e98e16951395,2022-09-24 18:38:26,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<studio.h>\nint main()\n{\n   int X,Y,Z;\n   scanf(\""&d&d&d,X,Y,Z\"");\n   if(0<=X&&X<=100,0<=Y<=100;0<=Y<=100)\n   {\n   f=X+Y-Z;\n   return 0;\n   }\n}",COMPILE_ERROR,0,0
1573622892799807488,5d6d82562ca6b36f696a433d811f38b5fff26601f99b9981f17f0f515f81d520,2022-09-24 18:38:28,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int X,Y,Z,F;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    if(X>=0&&X<=100)\n    {\n        if(Y>=0&&Y<=100)\n            if(Z>=0&&Z<=100)\n                F=X+Y-Z;\n    }\n    printf(\""%d\"",F);\n    return 0;\n}",ACCEPTED,10,328
1573622944360386560,345826d11b41befc23adeb536e81da8eb6ec9a8bfb9448acf91422deedb8ba4a,2022-09-24 18:38:41,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z,sum=0;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    if((X>=0&&X<=100)&&(Y>=0&&Y<=100)&&(Z>=0&&Z<=100))\n        sum=X+Y-Z;\n    printf(\""%d\"",sum);\n    return 0;\n}\n",ACCEPTED,9,200
1573622975805087744,82378a5e0158226aa5767fc4c146ed89075f4ff6c3983b7fdecdd1dd8762c0bc,2022-09-24 18:38:48,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int x,y,z,f;\n    scanf(\""%d\"",x);\n    scanf(\""%d\"",y);\n    scanf(\""%d\"",z);\n    f=x+y-z;\n    printf(\""%d,&f\"");\n    return 0;\n}\n",SEGMENTATION_FAULT,4,324
1573623010982715392,80a250fa0f0a2803dee3ded7fc9d04b68ebe099f7d2e152c1f7c83f0b8e4d6a5,2022-09-24 18:38:56,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int F;\n    int X,Y,Z;\n    F=X+Y-Z;\n    scanf(\""%d,%d,%d\"",&X,&Y,&Z);\n    if(X>=0)\n        if(Y<=100)\n            if(Z<=100)\n    printf(\""%d\"",F);\n    return 0;\n}",WRONG_ANSWER,4,196
1573623058563235840,614bcfa584782c67fd545955ac39a982d7eb524d0d15d3e73c5c256031228cb7,2022-09-24 18:39:08,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x,y,z,a;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    a=x+y-z;\n    printf(\""%d\"",a);\n    return 0;\n}",ACCEPTED,11,324
1573623088296316928,7310135b9c9422c45d35553cb166f3e6e49919961fe8ee45fea6e98e16951395,2022-09-24 18:39:15,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<studio.h>\nint main()\n{\n   int X,Y,Z;\n   scanf(\""&d&d&d\"",X,Y,Z);\n   if(0<=X&&X<=100,0<=Y<=100;0<=Y<=100)\n   {\n   f=X+Y-Z;\n   }\n    printf(\""&d\"",f)\n}",COMPILE_ERROR,0,0
1573623112992382976,3c74b5c09db0bdc030e1bd28303ba54cd7c697a9a818d97667374aa473a319c9,2022-09-24 18:39:21,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int X,Y,Z;\n    int F;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    F=X+Y-Z;\n    printf(\""%d\"",F);\n    return 0;\n}",ACCEPTED,8,332
1573623135289303040,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-09-24 18:39:26,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nF(X,Y,Z);\nint main()\n{\n    int X,Y,Z,F(X,Y,Z);\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n\n    printf(\""%d\"",F(X,Y,Z));\n    return 0;\n}\nF(X,Y,Z)\n{\n    int F;\n    F=X+Y-Z;\n    return F;\n}\n",ACCEPTED,8,324
1573623146412597248,7310135b9c9422c45d35553cb166f3e6e49919961fe8ee45fea6e98e16951395,2022-09-24 18:39:29,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<studio.h>\nint main()\n{\n   int X,Y,Z;\n   scanf(\""&d&d&d\"",X,Y,Z);\n   if(0<=X&&X<=100,0<=Y<=100;0<=Y<=100)\n   {\n   f=X+Y-Z;\n   }\n    printf(\""&d\"",f);\n    return 0;\n}",COMPILE_ERROR,0,0
1573623168290086912,80a250fa0f0a2803dee3ded7fc9d04b68ebe099f7d2e152c1f7c83f0b8e4d6a5,2022-09-24 18:39:34,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int F;\n    int X,Y,Z;\n    F=X+Y-Z;\n    scanf(\""%d,%d,%d\"",&X,&Y,&Z);\n    if(X>=0)\n        if(Y<=100)\n            if(Z<=100)\n    printf(\""%d\"",F);\n    return 0;\n}",WRONG_ANSWER,4,344
1573623225877876736,27fbb32d960dbf49665c8905b68012d602eda68987686c6f224ec7b49ca3d0ac,2022-09-24 18:39:48,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x,y,z,s;\n    printf(\""请输入三个整数：\"");\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    if(x>=0&&z<=100)\n    {\n    \t    s=x+y-z;\n    printf(\""%d\"",s);\n\t}\n    else\n    {} \n        return 0;\n    \n}",WRONG_ANSWER,8,348
1573623301853499392,27fbb32d960dbf49665c8905b68012d602eda68987686c6f224ec7b49ca3d0ac,2022-09-24 18:40:06,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x,y,z,s;\n    printf(\""请输入三个整数：\"");\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    if(x>=0&&z<=100)\n    {\n    \t    s=x+y-z;\n    printf(\""%d\"",s);\n\t}\n    else\n    {} \n        return 0;\n    \n}",WRONG_ANSWER,5,320
1573623391653888000,25b8e249c556de062ec0d61286db67304f907bc70204e22083d75434403578b1,2022-09-24 18:40:27,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint MATH(int X,int Y,int Z);\nint MATH(int X,int Y,int Z)\n{\n   int c;\n   c=X+Y-Z;\n   return c;\n}\n\n\nint main()\n{\n    int X,Y,Z,F;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    F=MATH(X,Y,Z);\n    printf(\""%d\"",F);\n    return 0;\n}\n",ACCEPTED,8,368
1573623573967364096,b7ca5a176d530473c8faa24fa803cc5b5bef6deef335789b05821ec37e6b8252,2022-09-24 18:41:11,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n\tint X,Y,Z;\n\tint F;\n\tscanf(\""%d %d %d\"",&X,&Y,&Z);\n\tF=X+Y-Z;\n\tprintf(\""F(x)=%d\"",F);\n\treturn 0;\n}",WRONG_ANSWER,4,340
1573623607437910016,7310135b9c9422c45d35553cb166f3e6e49919961fe8ee45fea6e98e16951395,2022-09-24 18:41:19,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<studio.h>\nint main()\n{\n   int X,Y,Z,f;\n   scanf(\""&d&d&d\"",X,Y,Z);\n   if(0<=X&&X<=100;0<=Y<=100;0<=Y<=100)\n   {\n   f=X+Y-Z;\n   }\n    printf(\""&d\"",f);\n    return 0;\n}",COMPILE_ERROR,0,0
1573623624651333632,86f702b052a21d7cb2f8cd933c678c21efaafaf5b2d35032f18ec35c1e26a945,2022-09-24 18:41:23,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x,y,z,f;\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    f=x+y-z;\n    printf(\""%d\"",f);\n    return 0;\n}",ACCEPTED,10,480
1573623639398842368,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-09-24 18:41:26,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"include<stdio.h>\nint F(int x,int y,int z)\n{\n    int a;\n    a=x+y+z;\n    return a;\n}\nint main()\n{\n    int x,y,z;\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    F(x,y,z);\n    printf(\""%d\"",F(x,y,z));\n    return 0;\n}",COMPILE_ERROR,0,0
1573623686940938240,7310135b9c9422c45d35553cb166f3e6e49919961fe8ee45fea6e98e16951395,2022-09-24 18:41:38,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<studio.h>\nint main()\n{\n   int X,Y,Z,f;\n   scanf(\""&d&d&d\"",X,Y,Z);\n   if(0<=X&&X<=100;0<=Y&&Y<=100;0<=Z&&Z<=100)\n   {\n   f=X+Y-Z;\n   }\n    printf(\""&d\"",f);\n    return 0;\n}",COMPILE_ERROR,0,0
1573623730146467840,82378a5e0158226aa5767fc4c146ed89075f4ff6c3983b7fdecdd1dd8762c0bc,2022-09-24 18:41:48,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int x,y,z,f;\n    scanf(\""%d\"",x);\n    scanf(\""%d\"",y);\n    scanf(\""%d\"",z);\n    f=x+y-z;\n    printf(\""%d\"",&f);\n    return 0;\n}\n",SEGMENTATION_FAULT,5,196
1573623800950509568,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-09-24 18:42:05,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"include<stdio.h>\nint F(int x,int y,int z)\n{\n    int a;\n    a=x+y+z;\n    return a;\n}\nint main()\n{\n    int x,y,z;\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    F(x,y,z);\n    printf(\""%d\"",F(x,y,z));\n    return 0;\n}",COMPILE_ERROR,0,0
1573623833305710592,80a250fa0f0a2803dee3ded7fc9d04b68ebe099f7d2e152c1f7c83f0b8e4d6a5,2022-09-24 18:42:13,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int F;\n    int X,Y,Z;\n    F=X+Y-Z;\n    scanf(\""%d,%d,%d\"",&X,&Y,&Z);\n    if(X>=0)\n        if(Y<=100)\n            if(Z<=100)\n    printf(\""%d\"",F);\n    return 0;\n}",WRONG_ANSWER,6,452
1573623881078833152,7310135b9c9422c45d35553cb166f3e6e49919961fe8ee45fea6e98e16951395,2022-09-24 18:42:24,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<studio.h>\nint main()\n{\n   int X,Y,Z,f;\n   scanf(\""&d&d&d\"",&X,&Y,&Z);\n   if(0<=X&&X<=100;0<=Y&&Y<=100;0<=Z&&Z<=100)\n   {\n   f=X+Y-Z;\n   }\n    printf(\""&d\"",&f);\n    return 0;\n}",COMPILE_ERROR,0,0
1573623926662529024,82378a5e0158226aa5767fc4c146ed89075f4ff6c3983b7fdecdd1dd8762c0bc,2022-09-24 18:42:35,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int x,y,z,f;\n    scanf(\""%d\"",&x);\n    scanf(\""%d\"",&y);\n    scanf(\""%d\"",&z);\n    f=x+y-z;\n    printf(\""%d\"",f);\n    return 0;\n}\n",ACCEPTED,15,484
1573623931720523776,80a250fa0f0a2803dee3ded7fc9d04b68ebe099f7d2e152c1f7c83f0b8e4d6a5,2022-09-24 18:42:36,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int F;\n    int X,Y,Z;\n    F=X+Y-Z;\n    scanf(\""%d,%d,%d\"",&X,&Y,&Z);\n    if(X>=0)\n        if(Y<=100)\n            if(Z<=100)\n    printf(\""%d\"",F);\n    return 0;\n}",WRONG_ANSWER,5,328
1573624069247893504,5ce0358dd71b4ab21078af606135077e568e13fcc94aceb8a3cd173788c03ece,2022-09-24 18:43:09,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint F(int a,int b,int c)\n{\n    int d;\n    d=a+b-c;\n    return d;\n}\nint main()\n{\n\n    int x,y,z,num;\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    num=F(x,y,z);\n    printf(\""%d\"",num);\n}",ACCEPTED,7,324
1573624075107336192,a893a0ab0bd13133fcd3c9ce7db96b3f012d0449038f5a32165f3034e67a2bae,2022-09-24 18:43:10,C++,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <iostream>\nusing namespace std;\nint main()\n{\n    int X,Y,Z,U;\n    cin>>X>>Y>>Z;\n    if((Z<0&&Z>100)&&(X<0&&X>100)&&(Y<0&&Y>100))\n        cout<<\""it is error!\"";\n        else\n        {U=X+Y-Z;}\n        cout<<U;\n    return 0;\n}",ACCEPTED,8,488
1573624195881979904,6cbd81921f92855c6b8318725b09ef7ec48ff579276b3df9f7ea04bea9804678,2022-09-24 18:43:39,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int F,X=0,Y=0,Z=0;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    F=X+Y-Z;\n    printf(\""%d\"",F);\n    return 0;\n}\n",ACCEPTED,10,352
1573624240316436480,27fbb32d960dbf49665c8905b68012d602eda68987686c6f224ec7b49ca3d0ac,2022-09-24 18:43:50,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint f(int x,int y,int z)\n{\n    int s;\n     if(x>=0&&y<=100)\n    {\n    \t    s=x+y-z;\n\t}\n    else\n    {\n        printf(\""输入数据错误\"");\n    } \n        return s;\n}\nint main()\n{\n    int x,y,z;\n    printf(\""请输入三个整数：\"");\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    f(x,y,z);\n    return 0;\n}",WRONG_ANSWER,3,200
1573624357471739904,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-09-24 18:44:18,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"include<stdio.h>\nint F(int x,int y,int z)\n{\n    int a;\n    a=x+y+z;\n    return a;\n}\nint main()\n{\n    int x,y,z,c;\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    c=F(x,y,z);\n    printf(\""%d\"",c);\n    return 0;\n}",COMPILE_ERROR,0,0
1573624646476062720,bbd6e7d5b69765c14d307ba414823e9bd2bc12348482b3c862a9268dba50d7d7,2022-09-24 18:45:26,C++,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <iostream>\n\nusing namespace std;\n\nint main() {\n    \n    int a, b, c;\n    cin >> a >> b >> c;\n    cout << a + b - c;\n    return 0;\n}",ACCEPTED,14,488
1573624664616427520,2ccc7507304cfd28125f6d85cdb4df769a41aec4f125254d0d2415ba16cb27c2,2022-09-24 18:45:31,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint shuzi(int x,int y,int z)\n{\n    int a;\n    a=x+y-z;\n    return 0;\n}\nint main()\n{\n    int x,y,z,c;\n    scanf (\""%d %d %d\"",&x,&y,&z);\n    c=shuzi(x,y,z);\n    printf(\""%d\"",c);\n    return 0;\n}\n",WRONG_ANSWER,5,504
1573624711718461440,27fbb32d960dbf49665c8905b68012d602eda68987686c6f224ec7b49ca3d0ac,2022-09-24 18:45:42,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint f(int x,int y,int z)\n{\n    int s;\n     if(x>=0&&y<=100)\n    {\n    \t    s=x+y-z;\n\t}\n    else\n    {\n        printf(\""输入数据错误\"");\n    } \n        return s;\n}\nint main()\n{\n    int x,y,z;\n    printf(\""请输入三个整数：\"");\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d\"",f(x,y,z));\n    return 0;\n}",WRONG_ANSWER,4,200
1573624714763522048,d5db2853d0fce01dd43b2b6adf379841403b78fda0e6cb22c82f6f2b59da60dc,2022-09-24 18:45:43,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\nmain(){\n\tint x,y,z,s=0;\n\tscanf(\""%d %d %d\"",&x,&y,&z);\n\tif(x>=0&&x<=100&y>=0&&y<=100&&z>=0&&z<=100){\n\t\ts=x+y-z;\n\t}\n\tprintf(\""%d\"",s);\n\treturn 0;\n}",ACCEPTED,9,196
1573624753674420224,2cb092ec618cde3657d677b73f7a0a7bfb1e0da02f466007878113e6c4db4792,2022-09-24 18:45:52,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n   int a,b,c;\n int  f;\n   scanf(\""%d %d %d\"",&a,&b,&c);\n   f=a+b-c;\n   printf (\""%d\"",f);\n    return 0;\n}\n\n",ACCEPTED,8,468
1573624796065910784,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-09-24 18:46:02,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"include<stdio.h>\nint F(int x,int y,int z)\n{\n    int a,x,y,z;\n    a=x+y+z;\n    return a;\n}\nint main()\n{\n    int x,y,z,c;\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    c=F(x,y,z);\n    printf(\""%d\"",c);\n    return 0;\n}",COMPILE_ERROR,0,0
1573624870271537152,7310135b9c9422c45d35553cb166f3e6e49919961fe8ee45fea6e98e16951395,2022-09-24 18:46:20,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n   int X,Y,Z,f;\n   scanf(\""&d&d&d\"",&X,&Y,&Z);\n   if(0<=X&&X<=100;0<=Y&&Y<=100;0<=Z&&Z<=100)\n   {\n   f=X+Y-Z;\n   }\n    printf(\""&d\"",&f);\n    return 0;\n}",COMPILE_ERROR,0,0
1573625026043797504,5ed1ed5f3786d45db71190023ef590496fd0d8d8cfe4af0f2c94d1d387178674,2022-09-24 18:46:57,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n    return 0;\n}\n",ACCEPTED,10,196
1573625111733424128,0e781c174584195d43de4745a62ba8135fb2da7ea8c2003d4e6a767944c00d96,2022-09-24 18:47:17,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\nint X,Y,Z;\nscanf(\""%d %d %d/n\"",&X,&Y,&Z);\nprintf(\""%d\"",X+Y-Z);\nreturn 0;\n}",ACCEPTED,9,328
1573625120096866304,80a250fa0f0a2803dee3ded7fc9d04b68ebe099f7d2e152c1f7c83f0b8e4d6a5,2022-09-24 18:47:19,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int F;\n    int X,Y,Z;\n    F=X+Y-Z;\n    scanf(\""%d %d %d \"",&X,&Y,&Z);\n    printf(\""%d \"",F);\n    return 0;\n}",WRONG_ANSWER,4,352
1573625161595650048,210901a22ab57f2bb4e6a38665b4b02e0659b8c5fcf1ea1d782eb90b9b1de5b6,2022-09-24 18:47:29,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int X,Y,Z,a;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    a=X+Y-Z;\n    printf(\""%d\"",a);\n}",ACCEPTED,12,472
1573625162849746944,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-09-24 18:47:30,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"include<stdio.h>\nint F(int x;int y;int z)\n{\n    int a;\n    a=x+y+z;\n    return a;\n}\nint main()\n{\n    int x,y,z,c;\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    c=F(x,y,z);\n    printf(\""%d\"",c);\n    return 0;\n}",COMPILE_ERROR,0,0
1573625335109812224,27fbb32d960dbf49665c8905b68012d602eda68987686c6f224ec7b49ca3d0ac,2022-09-24 18:48:11,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint f(int x,int y,int z)\n{\n    int s;\n     if(x>=0&&y<=100)\n    {\n    \t    s=x+y-z;\n\t}\n    else\n    {\n        printf(\""输入数据错误\"");\n    } \n        return s;\n}\nint main()\n{\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d\"",f(x,y,z));\n    return 0;\n}",ACCEPTED,11,356
1573625509961617408,80a250fa0f0a2803dee3ded7fc9d04b68ebe099f7d2e152c1f7c83f0b8e4d6a5,2022-09-24 18:48:52,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x,y,z;\n    int f;\n    f=x+y-z;\n    scanf(\""%d %d %d \"",&x,&y,&z);\n    printf(\""%d \"",f);\n    return 0;\n}",WRONG_ANSWER,4,344
1573625516320186368,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-09-24 18:48:54,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"include<stdio.h>\nint F(int x,int y,int z)\n{\n    int a;\n    a=x+y+z;\n    return a;\n}\nint main()\n{\n    int x,y,z,c;\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    c=F(x,y,z);\n    printf(\""%d\"",c);\n    return 0;\n}",COMPILE_ERROR,0,0
1573625550520541184,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-09-24 18:49:02,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    X>=0&&Y>=0&&Z>=0&&X<=100&&Y<=100&&Z<=100;\n    F(x)=X+Y+Z;\n    printf(\""%d\\n\"",F(x));\n    return 0;\n}",COMPILE_ERROR,0,0
1573625558619738112,e1ef8909479ad302f215d71e5a7696f8a0d6c6e22558408304052fad134b6ab7,2022-09-24 18:49:04,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main ()\n{\n    int x,y,z;\n    x=0\n    y=0\n    z=0\n    scanf(\""%d,%d,%d\""&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n}\nreturn 0;",COMPILE_ERROR,0,0
1573625558926262272,6a835d762a87e93baf4142897168374dc31e9da90b86c19ed82f21159b644272,2022-09-24 18:49:04,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z,F(X);\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    for(X>-1||X<101)&&(Y>-1||Y<101)&&(Z>-1||Z<101)\n        F(x)=X+Y-Z;\n    printf(\""%d\"",F(x));\n    return 0;\n}\n",COMPILE_ERROR,0,0
1573625580157489152,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-09-24 18:49:09,Python,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"input('请输入三个整数X,Y,Z:'%d,%d,%d)\nX,Y,Z=%d,%d,%d\ndef F(x):\n    F(x)=X+Y-Z\nif 0<=X<=100 and 0<=Y<=100 and 0<=Z<=100:\n    F(x)\n    print(F(x))\n\n",NON_ZERO_EXIT_CODE,16,2760
1573625651968172032,bbd6e7d5b69765c14d307ba414823e9bd2bc12348482b3c862a9268dba50d7d7,2022-09-24 18:49:26,Python,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"a, b, c = input().split(' ');\nprint(a + b - c)",NON_ZERO_EXIT_CODE,16,2888
1573625723594637312,6593d55a029882dd0c24ef5b6f9924f7569b69e6021f021bbc1ca1787ab45b78,2022-09-24 18:49:43,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d,%d,%d \"",&X,&Y,&Z);\n    printf(\""%d\\n\"",X+Y-Z);\n    return 0;\n}\n",WRONG_ANSWER,4,196
1573625723938570240,6a835d762a87e93baf4142897168374dc31e9da90b86c19ed82f21159b644272,2022-09-24 18:49:43,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z,F(X);\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    for(X>-1&&X<101)||(Y>-1&&Y<101)||(Z>-1&&Z<101)\n        F(x)=X+Y-Z;\n    printf(\""%d\"",F(x));\n    return 0;\n}\n",COMPILE_ERROR,0,0
1573625728522944512,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-09-24 18:49:44,Python,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"input('请输入三个整数X,Y,Z:'%d,%d,%d)\nX,Y,Z=%d,%d,%d\ndef F(x):\n    F(x)=X+Y-Z\nif 0<=X<=100 and 0<=Y<=100 and 0<=Z<=100:\n    F(x):\n    print(F(x))\n\n",NON_ZERO_EXIT_CODE,18,2888
1573625739683651584,e1ef8909479ad302f215d71e5a7696f8a0d6c6e22558408304052fad134b6ab7,2022-09-24 18:49:47,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main ()\n{\n    int x,y,z;\n    x=0;\n    y=0;\n    z=0;\n    scanf(\""%d,%d,%d\""&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n}\nreturn 0;",COMPILE_ERROR,0,0
1573625758969057280,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-09-24 18:49:52,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int X,Y,Z,F(x);\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    X>=0&&Y>=0&&Z>=0&&X<=100&&Y<=100&&Z<=100;\n    F(x)=X+Y+Z;\n    printf(\""%d\\n\"",F(x));\n    return 0;\n}",COMPILE_ERROR,0,0
1573625768624685056,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-09-24 18:49:54,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"include<stdio.h>\nint F(int x,int y,int z)\n{\n    int a;\n    a=x+y+z;\n    return a;\n}\nint main()\n{\n    int x,y,z,c;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    c=F(x,y,z);\n    printf(\""%d\"",c);\n    return 0;\n}",COMPILE_ERROR,0,0
1573625832776224768,20ffd83467b553ac24e1f4b8b096d58858684ca8c3f6a4d5a62be9ff7c4817da,2022-09-24 18:50:09,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint F(int x,int y,int z)\n{\n    int fx;\n    fx=x+y-z;\n    return(fx);\n}\nvoid main()\n{\n    int x,y,z,f;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    f=F(x,y,z);\n    printf(\""%d\"",f);\n}",ACCEPTED,12,468
1573625870394941440,6a835d762a87e93baf4142897168374dc31e9da90b86c19ed82f21159b644272,2022-09-24 18:50:18,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z,F(X);\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    for((X>-1&&X<101)||(Y>-1&&Y<101)||(Z>-1&&Z<101))\n        F(x)=X+Y-Z;\n    printf(\""%d\"",F(x));\n    return 0;\n}\n",COMPILE_ERROR,0,0
1573625892956098560,da72e985b1ff1737d155282af7dd43e3dc341605cc356d114979edd4fea85a11,2022-09-24 18:50:24,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nmian()\n{\n    int x,y,z,sum;\n    scanf(\""%d,%d,%d\"",&x,&y,&z);\n    if(x>=0&&x<=100&&y>=0&&y<=100&&z>=0&&z<=100)\n        sum=a+b-c;\n    printf(\""%d\"",sum);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1573625911692054528,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-09-24 18:50:28,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int X,Y,Z,sum;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    X>=0&&Y>=0&&Z>=0&&X<=100&&Y<=100&&Z<=100;\n    sum=X+Y+Z;\n    printf(\""%d\\n\"",sum);\n    return 0;\n}",WRONG_ANSWER,4,324
1573625960912211968,6933dcb3592e2d6f6fc887ed9a5537aab21a30f76450c9b5043f7776bfc39a59,2022-09-24 18:50:40,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint F(int x,int y,int z){\n    int result=x+y-z;\n    return result;\n}\nint main(){\n    int x,y,z,result;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    result=F(x,y,z);\n    printf(\""%d\"",result);\n}",ACCEPTED,12,324
1573626001324670976,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-09-24 18:50:49,Python,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"input('请输入三个整数X,Y,Z:'%d,%d,%d)\nX=%d\nY=%d\nZ=%d\ndef F(x):\n    F(x)=X+Y-Z\nif 0<=X<=100 and 0<=Y<=100 and 0<=Z<=100:\n    F(x)\n    print(F(x))\n\n",NON_ZERO_EXIT_CODE,15,2764
1573626007691288576,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-09-24 18:50:51,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z,a;\n    scanf(\""%d,%d,%d\"",&X,&Y,&Z);\n    if(X>=0&&X<=100&&Y>=0&&Z<=100&&Z>=0&&Z<=100)\n    a=X+Y-Z;\n\n    printf(\""%d\"",a);\n    return 0;\n}\n",WRONG_ANSWER,4,192
1573626027278688256,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-09-24 18:50:56,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    X>=0&&Y>=0&&Z>=0&&X<=100&&Y<=100&&Z<=100;\n    sum=X+Y+Z;\n    printf(\""%d\\n\"",sum);\n    return 0;\n}",COMPILE_ERROR,0,0
1573626038838190080,8c7d136eed2209a8278a3c3e192a5d053f6a8600b4912db28dac81c2463d6463,2022-09-24 18:50:58,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d,%d,%d\"",&X,&Y,&Z,);\n    F(X)=x+y-z;\n    printf(\""%d\"",A>0||A=0&&A<100||A=100);\n    printf(\""%d\"",F(x));\n    return 0;\n}",COMPILE_ERROR,0,0
1573626070522298368,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-09-24 18:51:06,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint F(int x,int y,int z)\n{\n    int a;\n    a=x+y+z;\n    return a;\n}\nint main()\n{\n    int x,y,z,c;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    c=F(x,y,z);\n    printf(\""%d\"",c);\n    return 0;\n}",WRONG_ANSWER,5,196
1573626097122238464,e1ef8909479ad302f215d71e5a7696f8a0d6c6e22558408304052fad134b6ab7,2022-09-24 18:51:12,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main ()\n{\n    int x,y,z;\n    x=0;\n    y=0;\n    z=0;\n    scanf(\""%d,%d,%d\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n}\nreturn 0;",COMPILE_ERROR,0,0
1573626136326393856,da72e985b1ff1737d155282af7dd43e3dc341605cc356d114979edd4fea85a11,2022-09-24 18:51:22,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nmian()\n{\n    int X,Y,Z,sum;\n    scanf(\""%d,%d,%d\"",&x,&y,&z);\n    if(X>=0&&X<=100&&Y>=0&&Y<=100&&Z>=0&&Z<=100)\n        sum=X+Y-Z;\n    printf(\""%d\"",sum);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1573626191015927808,ab0ab7c0015898022897acf34855e783bb46b7e09ec59ddda87b6edeffd90daf,2022-09-24 18:51:35,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n    int Fx(int X,int Y,int Z)\n{\n    \n    F(x)=X+Y-Z;\n    return 0;\n}\n{\n    int X,Y,Z;\n     scanf(\""%d%d%d\"",&X,&Y,&Z);\n    while(X>=0&&Y<=100&&Z<=100)\n   \n    printf(\""%d\"",Fx);\n    return 0;\n}",COMPILE_ERROR,0,0
1573626206404825088,da72e985b1ff1737d155282af7dd43e3dc341605cc356d114979edd4fea85a11,2022-09-24 18:51:38,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nmian()\n{\n    int X,Y,Z,sum;\n    scanf(\""%d,%d,%d\"",&X,&Y,&Z);\n    if(X>=0&&X<=100&&Y>=0&&Y<=100&&Z>=0&&Z<=100)\n        sum=X+Y-Z;\n    printf(\""%d\"",sum);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1573626208082546688,ab0ab7c0015898022897acf34855e783bb46b7e09ec59ddda87b6edeffd90daf,2022-09-24 18:51:39,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n    int Fx(int X,int Y,int Z)\n{\n    \n    F(x)=X+Y-Z;\n    return 0;\n}\n{\n    int X,Y,Z;\n     scanf(\""%d%d%d\"",&X,&Y,&Z);\n    while(X>=0&&Y<=100&&Z<=100)\n   \n    printf(\""%d\"",Fx);\n    return 0;\n}",COMPILE_ERROR,0,0
1573626235634933760,0a70233241389903cdb8ca74c2a1b653487eb569013245340fb7d6cc66bafcee,2022-09-24 18:51:45,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint F(int x,int y,int z)\n{\n    int a;\n    a=x+y-z;\n    return a;\n}\nint main()\n{\n    int x,y,z,c;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    c=F(x,y,z);\n    printf(\""%d\"",c);\n    return 0;\n}",ACCEPTED,6,332
1573626240144146432,e1ef8909479ad302f215d71e5a7696f8a0d6c6e22558408304052fad134b6ab7,2022-09-24 18:51:46,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main ()\n{\n    int x,y,z;\n    x=0;\n    y=0;\n    z=0;\n    scanf(\""%d,%d,%d/n\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n}\nreturn 0;",COMPILE_ERROR,0,0
1573626303826264064,b471ec3e623039e3377bb9490ffe33548b6c9d1d9c8b11548c3991f0ac8924c8,2022-09-24 18:52:02,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{ int A,B,C;\nscanf(\""%d %d %d/n\"",&A,&B,&C);\nprintf(\""%d\"",A+B-C);\nreturn 0;}",ACCEPTED,10,320
1573626304157278208,bbd6e7d5b69765c14d307ba414823e9bd2bc12348482b3c862a9268dba50d7d7,2022-09-24 18:52:02,C++,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <iostream>\n\nint main() {\n    int x, y, z;\n    cin >> x >> y >> z;\n    cout << x + y - z;\n    return 0;\n}",COMPILE_ERROR,0,0
1573626321345871872,8c7d136eed2209a8278a3c3e192a5d053f6a8600b4912db28dac81c2463d6463,2022-09-24 18:52:06,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d,%d,%d\"",&X,&Y,&Z,);\n    F(X)=X+Y-Z;\n    printf(\""%d\"",A>0||A=0&&A<100||A=100);\n    printf(\""%d\"",F(x));\n    return 0;\n}",COMPILE_ERROR,0,0
1573626426165723136,e1ef8909479ad302f215d71e5a7696f8a0d6c6e22558408304052fad134b6ab7,2022-09-24 18:52:31,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main ()\n{\n    int x,y,z;\n    scanf(\""%d,%d,%d/n\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n}\nreturn 0;",COMPILE_ERROR,0,0
1573626445883146240,da72e985b1ff1737d155282af7dd43e3dc341605cc356d114979edd4fea85a11,2022-09-24 18:52:35,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\n\nmian()\n{\n    int X,Y,Z,sum;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    if(X>=0&&X<=100&&Y>=0&&Y<=100&&Z>=0&&Z<=100)\n        sum=X+Y-Z;\n    printf(\""%d\"",sum);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1573626483992256512,8c7d136eed2209a8278a3c3e192a5d053f6a8600b4912db28dac81c2463d6463,2022-09-24 18:52:45,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d,%d,%d\"",&X,&Y,&Z,);\n    F(x)=X+Y-Z;\n    printf(\""%d\"",A>0||A=0&&A<100||A=100);\n    printf(\""%d\"",F(x));\n    return 0;\n}",COMPILE_ERROR,0,0
1573626507086094336,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-09-24 18:52:50,Python,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"input('请输入三个整数X,Y,Z:'%d,%d,%d)\nX=%d\nY=%d\nZ=%d\ndef F(x):\n    F(x)=X+Y-Z\nif 0<=X<=100 and 0<=Y<=100 and 0<=Z<=100:\n    F(x)\n    print(F(x))\n\n",NON_ZERO_EXIT_CODE,16,2760
1573626548618092544,e1ef8909479ad302f215d71e5a7696f8a0d6c6e22558408304052fad134b6ab7,2022-09-24 18:53:00,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main ()\n{\n    int x,y,z;\n    scanf(\""%d,%d,%d/n\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\nreturn 0;}",WRONG_ANSWER,4,196
1573626606205886464,f9f24f67f09108d2083f477f54469c6ba97819778895c49933cbfac5e81db7bc,2022-09-24 18:53:14,Python,300.0,1573557741782495234,1572865591226855424,1049226928954454016,string=input()\nsum=string.split()\nx=int(sum[0])\ny=int(sum[1])\nz=int(sum[2])\nsum1 = x+y-z\nprint(str(sum1)),ACCEPTED,35,2904
1573626613281677312,da72e985b1ff1737d155282af7dd43e3dc341605cc356d114979edd4fea85a11,2022-09-24 18:53:15,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\n\nmian()\n{\n    int X,Y,Z,sum;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    if((X>=0&&X<=100)&&(Y>=0&&Y<=100)&&(Z>=0&&Z<=100)\n        sum=X+Y-Z;\n    printf(\""%d\"",sum);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1573626698023395328,da72e985b1ff1737d155282af7dd43e3dc341605cc356d114979edd4fea85a11,2022-09-24 18:53:36,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\n\nmain()\n{\n    int X,Y,Z,sum;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    if((X>=0&&X<=100)&&(Y>=0&&Y<=100)&&(Z>=0&&Z<=100)\n        sum=X+Y-Z;\n    printf(\""%d\"",sum);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1573626743179608064,8c7d136eed2209a8278a3c3e192a5d053f6a8600b4912db28dac81c2463d6463,2022-09-24 18:53:46,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d,%d,%d\"",&X,&Y,&Z,);\n    F(x)=X+Y-Z;\n    printf(\""%d\"",x>0||x=0&x<100||x=100);\n    printf(\""%d\"",F(x));\n    return 0;\n}",COMPILE_ERROR,0,0
1573626751165562880,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-09-24 18:53:48,Python,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"input('请输入三个整数X,Y,Z:'%d,%d,%d)\nX=%d\nY=%d\nZ=%d\ndef F(x):\n    F(x)=X+Y-Z\nif 0<=X<=100 and 0<=Y<=100 and 0<=Z<=100:\n    F(x)\nprint(F(x))\n\n",NON_ZERO_EXIT_CODE,16,2760
1573626778193321984,27da4b3373d2bf9f3bcb2930f579e54b56c57991074e3a3f50df547f1187a19c,2022-09-24 18:53:55,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint area()\n{\n    int F,X,Y,Z;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    0<=X,Y,Z<=100;\n    return F=X+Y-Z;\n}\nint main()\n{\n    int l;\n    l=area();\n    printf(\""%d\"",l);\n    return 0;\n}\n\n",ACCEPTED,8,324
1573626782492483584,da72e985b1ff1737d155282af7dd43e3dc341605cc356d114979edd4fea85a11,2022-09-24 18:53:56,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int X,Y,Z,sum;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    if((X>=0&&X<=100)&&(Y>=0&&Y<=100)&&(Z>=0&&Z<=100)\n        sum=X+Y-Z;\n    printf(\""%d\"",sum);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1573626829967806464,da72e985b1ff1737d155282af7dd43e3dc341605cc356d114979edd4fea85a11,2022-09-24 18:54:07,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int X,Y,Z,sum;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    if((X>=0&&X<=100)&&(Y>=0&&Y<=100)&&(Z>=0&&Z<=100)\n        sum=X+Y-Z;\n    printf(\""%d\"",sum);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1573626858187083776,da72e985b1ff1737d155282af7dd43e3dc341605cc356d114979edd4fea85a11,2022-09-24 18:54:14,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int X,Y,Z,sum;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    if((X>=0&&X<=100)&&(Y>=0&&Y<=100)&&(Z>=0&&Z<=100))\n        sum=X+Y-Z;\n    printf(\""%d\"",sum);\n    return 0;\n}\n",ACCEPTED,11,348
1573626871038771200,6593d55a029882dd0c24ef5b6f9924f7569b69e6021f021bbc1ca1787ab45b78,2022-09-24 18:54:17,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n int main()\n {\n     int X,Y,Z;\n     scanf(\""%d %d %d\"",&X,&Y,&Z);\n     printf(\""%d\\n\"",X+Y-Z);\n     return 0;\n }\n",ACCEPTED,11,384
1573626889849888768,e1ef8909479ad302f215d71e5a7696f8a0d6c6e22558408304052fad134b6ab7,2022-09-24 18:54:21,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main ()\n{\n    int x,y,z;\n    scanf(\""%d,%d,%d/n\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\nreturn 0;}",WRONG_ANSWER,4,332
1573626979033710592,ab0ab7c0015898022897acf34855e783bb46b7e09ec59ddda87b6edeffd90daf,2022-09-24 18:54:43,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\n\n    int F(int X,int Y,int Z)\n{\n    int F;\n    F=X+Y-Z;\n    return 0;\n}\nint main()\n{\n    int X,Y,Z;\n     scanf(\""%d%d%d\"",&X,&Y,&Z);\n    while(X>=0&&Y<=100&&Z<=100)\n   \n    printf(\""%d\"",F);\n    return 0;\n}",TIME_LIMIT_EXCEEDED,400,49240
1573627009446273024,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-09-24 18:54:50,Python,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"input('请输入三个整数X,Y,Z:'%d,%d,%d)\nX=%d\nY=%d\nZ=%d\ndef F(x):\n    F(x)=X+Y-Z\nif 0<=X<=100 and 0<=Y<=100 and 0<=Z<=100:\n    F(x)\nprint(F(x))\nreturn 0\n\n",NON_ZERO_EXIT_CODE,16,2776
1573627033886478336,ab0ab7c0015898022897acf34855e783bb46b7e09ec59ddda87b6edeffd90daf,2022-09-24 18:54:56,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\n\n    int F(int X,int Y,int Z)\n{\n    \n    F=X+Y-Z;\n    return 0;\n}\nint main()\n{\n    int X,Y,Z;\n     scanf(\""%d%d%d\"",&X,&Y,&Z);\n    while(X>=0&&Y<=100&&Z<=100)\n   \n    printf(\""%d\"",F);\n    return 0;\n}",COMPILE_ERROR,0,0
1573627075577864192,e1ef8909479ad302f215d71e5a7696f8a0d6c6e22558408304052fad134b6ab7,2022-09-24 18:55:06,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main ()\n{\n    int x,y,z;\n    scanf(\""%d%d%d/n\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\nreturn 0;}",ACCEPTED,8,324
1573627113205301248,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-09-24 18:55:15,Python,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"input('请输入三个整数X,Y,Z:'%d,%d,%d)\nreturn 0\nX=%d\nY=%d\nZ=%d\ndef F(x):\n    F(x)=X+Y-Z\nif 0<=X<=100 and 0<=Y<=100 and 0<=Z<=100:\n    F(x)\nprint(F(x))\n\n\n",NON_ZERO_EXIT_CODE,15,2780
1573627215172689920,d21dc339d37b0772b2547441444d4b660b000ac3ebe190aee01769e2dd619c10,2022-09-24 18:55:39,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint X,Y,Z;\nint F(x)()\n{\n    F(x)=X+Y-Z;\n        printf(\""F(x)\"");\n        return 0;\n}\n    ",COMPILE_ERROR,0,0
1573627235129524224,6a835d762a87e93baf4142897168374dc31e9da90b86c19ed82f21159b644272,2022-09-24 18:55:44,C++,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z,F(X);\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    for((X>1&&X<101)||(Y>11&&Y<101)||(Z>11&&Z<101))\n        F(x)=X+Y-Z;\n    printf(\""%d\"",F(x));\n    return 0;\n}\n",COMPILE_ERROR,0,0
1573627569742372864,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-09-24 18:57:03,Python,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"input('请输入三个整数X,Y,Z:'%d,%d,%d)\nX=%d\nY=%d\nZ=%d\ndef F(x):\n    F(x)=X+Y-Z\nif 0<=X<=100 and 0<=Y<=100 and 0<=Z<=100:\n    F(x)\nprint(F(x))\n\n\n",NON_ZERO_EXIT_CODE,15,2888
1573627647471210496,8c7d136eed2209a8278a3c3e192a5d053f6a8600b4912db28dac81c2463d6463,2022-09-24 18:57:22,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d,%d,%d\"",&X,&Y,&Z,);\n    F(x)=X+Y-Z;\n    printf(\""%d\"",x>0||x=0&x<100||x=100);\n    printf(\""%d\"",F(x));\n    return 0;\n}",COMPILE_ERROR,0,0
1573627716300079104,80a250fa0f0a2803dee3ded7fc9d04b68ebe099f7d2e152c1f7c83f0b8e4d6a5,2022-09-24 18:57:38,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x,y,z;\n    int f;\n    f=x+y-z;\n    if(x>=0&&y>=0&&z>=0x<=100&&y<=100&&z<=100)\n    scanf(\""%d %d %d \"",&x,&y,&z);\n    printf(\""%d \"",f);\n    return 0;\n}",COMPILE_ERROR,0,0
1573627735094419456,107bbb1c8563df914c1a009a8253375b62308e0759ce6060f307e8e48fe9b178,2022-09-24 18:57:43,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint F(int X,int Y,int Z)\n{\n    int i;\n    if(X>=0&&X<=100&&Y>=0&&Y<=100&&Z>=0&&Z<=100)\n        i=X+Y+Z;\n    return i;\n}\n\nint main\n{\nint x,y,z;\nscanf(\""%d %d %d\"",&X,&Y,&Z);\nprintf(\""%d\"",F(x));\nreturn 0;\n}",COMPILE_ERROR,0,0
1573627760805838848,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-09-24 18:57:49,Python,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"input('请输入三个整数X,Y,Z:'%d,%d,%d)\n# X=%d\n# Y=%d\n# Z=%d\ndef F(x):\n    F(x)=X+Y-Z\nif 0<=X<=100 and 0<=Y<=100 and 0<=Z<=100:\n    F(x)\nprint(F(x))\n\n\n",NON_ZERO_EXIT_CODE,20,2768
1573627950375796736,107bbb1c8563df914c1a009a8253375b62308e0759ce6060f307e8e48fe9b178,2022-09-24 18:58:34,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint F(int X,int Y,int Z)\n{\n    int i;\n    if(X>=0&&X<=100&&Y>=0&&Y<=100&&Z>=0&&Z<=100)\n        i=X+Y+Z;\n    return i;\n}\n\nint main\n{\nint x,y,z;\nscanf(\""%d %d %d\"",&X,&Y,&Z);\nprintf(\""%d\"",F(X,Y,Z));\nreturn 0;\n}",COMPILE_ERROR,0,0
1573627960521482240,80a250fa0f0a2803dee3ded7fc9d04b68ebe099f7d2e152c1f7c83f0b8e4d6a5,2022-09-24 18:58:37,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x,y,z;\n    int f;\n    f=x+y-z;\n    if(x>=0&&y>=0&&z>=0&&x<=100&&y<=100&&z<=100)\n    scanf(\""%d %d %d \"",&x,&y,&z);\n    printf(\""%d \"",f);\n    return 0;\n}",WRONG_ANSWER,5,352
1573628029178380288,ab0ab7c0015898022897acf34855e783bb46b7e09ec59ddda87b6edeffd90daf,2022-09-24 18:58:53,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\n\n    int F(int X,int Y,int Z)\n{\n    int a;\n    a=X+Y-Z;\n    return a;\n}\nint main()\n{\n    int X,Y,Z;\n     scanf(\""%d%d%d\"",&X,&Y,&Z);\n    while(X>=0&&Y<=100&&Z<=100)\n   \n    printf(\""%d\"",F(X,Y,Z));\n    return 0;\n}",TIME_LIMIT_EXCEEDED,400,13140
1573628076242329600,ab0ab7c0015898022897acf34855e783bb46b7e09ec59ddda87b6edeffd90daf,2022-09-24 18:59:04,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\n\n    int F(int X,int Y,int Z)\n{\n    int a;\n    a=X+Y-Z;\n    return a;\n}\nint main()\n{\n    int X,Y,Z;\n     \n    while(X>=0&&Y<=100&&Z<=100)\n   \n    printf(\""%d\"",F(X,Y,Z));\n    return 0;\n}",TIME_LIMIT_EXCEEDED,400,6936
1573628101010030592,107bbb1c8563df914c1a009a8253375b62308e0759ce6060f307e8e48fe9b178,2022-09-24 18:59:10,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint F(int X,int Y,int Z)\n{\n    int i;\n    if(X>=0&&X<=100&&Y>=0&&Y<=100&&Z>=0&&Z<=100)\n        i=X+Y+Z;\n    return i;\n}\n\nint main\n{\nint X,Y,Z;\nscanf(\""%d %d %d\"",&X,&Y,&Z);\nprintf(\""%d\"",F(X,Y,Z));\nreturn 0;\n}",COMPILE_ERROR,0,0
1573628128981843968,ab0ab7c0015898022897acf34855e783bb46b7e09ec59ddda87b6edeffd90daf,2022-09-24 18:59:17,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\n\n    int F(int X,int Y,int Z)\n{\n    int a;\n    a=X+Y-Z;\n    return a;\n}\nint main()\n{\n    int X,Y,Z;\n     scanf(\""%d%d%d\"",&X,&Y,&Z);\n    while(X>=0&&Y<=100&&Z<=100)\n   \n    printf(\""%d\"",F(X,Y,Z));\n    return 0;\n}",TIME_LIMIT_EXCEEDED,400,13112
1573628141392453632,7ecf54bf0ea2db8ab0397aa941f19ec79a351bc3e86e8c01673aa09a69b3a6db,2022-09-24 18:59:20,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int n[3];\n    int sum(int x,int y, int z);\n    for(int i=0;i<3;i++)\n    {\n        scanf(\""%d\"",&n[i]);\n    }\n    sum(n[0],n[1],n[2]);\n}\n\nint sum(int x,int y, int z)\n{\n    int s = x+y-z;\n    return s;\n}",WRONG_ANSWER,4,320
1573628201391972352,bd16db9e7922c6b4cb4fca1cb27af05c43b658ed5d994c2e2c7efc4f8d1b0278,2022-09-24 18:59:34,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int X,Y,Z,a;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    a=X+Y-Z;\n    printf(\""%d\"",a);\n    return 0;\n}",ACCEPTED,9,348
1573628309001031680,ab0ab7c0015898022897acf34855e783bb46b7e09ec59ddda87b6edeffd90daf,2022-09-24 19:00:00,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\n\n    int F(int X,int Y,int Z)\n{\n    int a;\n    a=X+Y-Z;\n    return a;\n}\nint main()\n{\n    int X,Y,Z;\n     \n    while(X>=0&&Y<=100&&Z<=100)\n   \n    printf(\""%d\"",F(X,Y,Z));\n    return 0;\n}",TIME_LIMIT_EXCEEDED,400,7276
1573628434029379584,ab0ab7c0015898022897acf34855e783bb46b7e09ec59ddda87b6edeffd90daf,2022-09-24 19:00:29,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\n\n    int F(int X,int Y,int Z)\n{\n    int a;\n    a=X+Y-Z;\n    return a;\n}\nint main()\n{\n    int X,Y,Z;\n     scanf(\""%d%d%d\"",&X,&Y,&Z);\n   \n   \n    printf(\""%d\"",F(X,Y,Z));\n    return 0;\n}",ACCEPTED,12,512
1573628468975980544,7ecf54bf0ea2db8ab0397aa941f19ec79a351bc3e86e8c01673aa09a69b3a6db,2022-09-24 19:00:38,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int n[3],x,y,z;\n    int sum(int x,int y, int z);\n    scanf(\""%d\"",&x);\n    scanf(\""%d\"",&y);\n    scanf(\""%d\"",&z);\n    sum(x,y,z);\n}\n\nint sum(int x,int y, int z)\n{\n    int s = x+y-z;\n    return s;\n}",WRONG_ANSWER,6,196
1573628515151077376,7ecf54bf0ea2db8ab0397aa941f19ec79a351bc3e86e8c01673aa09a69b3a6db,2022-09-24 19:00:49,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int x,y,z;\n    int sum(int x,int y, int z);\n    scanf(\""%d\"",&x);\n    scanf(\""%d\"",&y);\n    scanf(\""%d\"",&z);\n    sum(x,y,z);\n}\n\nint sum(int x,int y, int z)\n{\n    int s = x+y-z;\n    return s;\n}",WRONG_ANSWER,7,472
1573628563616260096,1bf0799d9c686a2f0d10cf3e8c6c19023212e70fdb74b8e74e5cb0a46d324c4a,2022-09-24 19:01:00,Python,0.0,1573557741782495234,1572865591226855424,1049226928954454016,\n,WRONG_ANSWER,17,2760
1573628577717506048,928387ba90b7d3af095968a0f9e0198612ede46fbbd5d1ef0dd919da00a4d7ec,2022-09-24 19:01:04,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n    return 0;\n}\n",ACCEPTED,12,200
1573628579688833024,107bbb1c8563df914c1a009a8253375b62308e0759ce6060f307e8e48fe9b178,2022-09-24 19:01:04,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint F(int X,int Y,int Z)\n{\n    int i;\n    \n        i=X+Y-Z;\n    return i;\n}\n\nint main\n{\nint X,Y,Z;\nscanf(\""%d %d %d\"",&X,&Y,&Z);\nprintf(\""%d\"",F(X,Y,Z));\nreturn 0;\n}",COMPILE_ERROR,0,0
1573628587016278016,7310135b9c9422c45d35553cb166f3e6e49919961fe8ee45fea6e98e16951395,2022-09-24 19:01:06,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n   int X,Y,Z,f;\n   scanf(\""&d&d&d\"",&X,&Y,&Z);\n    printf(\""&d\\n\"",&f);\n    return 0;\n}",WRONG_ANSWER,4,480
1573628599553052672,13eac09c9e523ec396926840225e626f8fff54ca0e8a92e46e533705daa83ac2,2022-09-24 19:01:09,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main ()\n{\n    int X,Y,Z,M;\n    printf(\""输入三个整数：\"");\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    if(0<=X<=100&&0<=Y<=100&&0<=Z<=100)\n    {\n        M=X+Y-Z;\n    }\n\n\n    printf(\""%d\\n\"",M);\n    return 0;\n}",WRONG_ANSWER,4,192
1573628617244966912,107bbb1c8563df914c1a009a8253375b62308e0759ce6060f307e8e48fe9b178,2022-09-24 19:01:13,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint F(int X,int Y,int Z)\n{\n    int i;\n    \n        i=X+Y-Z;\n    return i;\n}\n\nint main\n{\nint X,Y,Z;\nscanf(\""%d %d %d\"",&X,&Y,&Z);\nprintf(\""%d\"",F(X,Y,Z));\nreturn 0;\n}",COMPILE_ERROR,0,0
1573628711318671360,7310135b9c9422c45d35553cb166f3e6e49919961fe8ee45fea6e98e16951395,2022-09-24 19:01:36,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n   int X,Y,Z;\n   scanf(\""&d&d&d\"",&X,&Y,&Z);\n    printf(\""&d\\n\"",X+Y-Z);\n    return 0;\n}",WRONG_ANSWER,5,196
1573628714342768640,107bbb1c8563df914c1a009a8253375b62308e0759ce6060f307e8e48fe9b178,2022-09-24 19:01:36,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint F(int X,int Y,int Z)\n{\n    int i;\n    \n        i=X+Y-Z;\n    return i;\n}\n\nint main\n{\nint X,Y,Z;\nscanf(\""%d %d %d\"",&X,&Y,&Z);\nprintf(\""%d\"",F(X,Y,Z));\nreturn 0;\n}",COMPILE_ERROR,0,0
1573628752334770176,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-09-24 19:01:45,Python,0.0,1573557741782495234,1572865591226855424,1049226928954454016,X=input('请输入一个整数X:')\nY=input('请输入一个整数Y:')\nZ=input('请输入一个整数Z:')\ndef F(x):\n    F(x)=X+Y-Z\nif 0<=X<=100 and 0<=Y<=100 and 0<=Z<=100:\n    F(x)\n    print(F(x))\n\n\n\n,NON_ZERO_EXIT_CODE,16,2888
1573628825034981376,beefe7893dd2cd421da3fb1ba3ffd90e3dc51d5301380baebfdfa12fbe5234f5,2022-09-24 19:02:03,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint num(int x,int y,int z)\n{\n    int m;\n    m = x+y+z;\n    return m;\n    \n}\nint main()\n{\n    int n;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    n = num(x,y,z);\n    printf(\""%d\"",n)\n}",COMPILE_ERROR,0,0
1573628843531862016,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-09-24 19:02:07,Python,0.0,1573557741782495234,1572865591226855424,1049226928954454016,X=input('请输入一个整数X:')\nY=input('请输入一个整数Y:')\nZ=input('请输入一个整数Z:')\ndef F(x):\n    F(x)=X+Y-Z\nif 0<=X<=100 and 0<=Y<=100 and 0<=Z<=100:\n    F(x):\n    print(F(x))\n\n\n\n,NON_ZERO_EXIT_CODE,17,2888
1573628907112976384,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-09-24 19:02:22,Python,0.0,1573557741782495234,1572865591226855424,1049226928954454016,X=input('请输入一个整数X:')\nY=input('请输入一个整数Y:')\nZ=input('请输入一个整数Z:')\ndef F(x):\n    F(x)=X+Y-Z\nif 0<=X<=100 and 0<=Y<=100 and 0<=Z<=100:\n    F(x):\n    print(F(x))\n\n\n\n,NON_ZERO_EXIT_CODE,20,2764
1573628908631654400,7ecf54bf0ea2db8ab0397aa941f19ec79a351bc3e86e8c01673aa09a69b3a6db,2022-09-24 19:02:23,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int x,y,z;\n    int sum(int x,int y, int z);\n    scanf(\""%d\"",&x);\n    scanf(\""%d\"",&y);\n    scanf(\""%d\"",&z);\n    return sum(x,y,z);\n}\n\nint sum(int x,int y, int z)\n{\n    int s = x+y-z;\n    return s;\n}",NON_ZERO_EXIT_CODE,5,196
1573628913089859584,7310135b9c9422c45d35553cb166f3e6e49919961fe8ee45fea6e98e16951395,2022-09-24 19:02:24,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n   int X,Y,Z;\n   scanf(\""&d,&d,&d\"",&X,&Y,&Z);\n    printf(\""&d\\n\"",X+Y-Z);\n    return 0;\n}",WRONG_ANSWER,4,348
1573628955922092032,107bbb1c8563df914c1a009a8253375b62308e0759ce6060f307e8e48fe9b178,2022-09-24 19:02:34,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint F(int X,int Y,int Z)\n{\n    int i;\n    \n        i=X+Y-Z;\n    return i;\n}\n\nint main\n{\nint X,Y,Z;\nscanf(\""%d%d%d\"",&X,&Y,&Z);\nprintf(\""%d\"",F(X,Y,Z));\nreturn 0;\n}",COMPILE_ERROR,0,0
1573629001892003840,e7f8e9ba366feb4551b7dc8e6a149f796e822980a43de4fcc91ded552c4bcbd4,2022-09-24 19:02:45,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h> \nint main(int argc, char *argv[]) {\n    int X,Y,Z;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);   \n    printf(\""%d\\n\"",X+Y-Z);\n\treturn 0;\n}",ACCEPTED,10,200
1573629052248477696,1bf0799d9c686a2f0d10cf3e8c6c19023212e70fdb74b8e74e5cb0a46d324c4a,2022-09-24 19:02:57,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"\n#include<stdio.h>\n#include<stdlib.h>\n#include<time.h>\nint jia()\n{ int num1,num2,num;\nsystem(\""cls\"");\nsrand(time(NULL));\ndo\n{\nnum1=rand()%100;\nnum2=rand()%100;\nnum=num1+num2;\n}while(num>100);\nprintf(\""%d+%d=\"",num1,num2);\nreturn num;\n}\nint jian()\n{ int num1,num2,num;\nsystem(\""cls\"");\nsrand(time(NULL));\ndo\n{\nnum1=rand()%100;\nnum2=rand()%100;\nnum=num1-num2;\n}while(num>100||num<0);\nprintf(\""%d-%d=\"",num1,num2);\nreturn num;\n}\nint cheng()\n{ int num1,num2,num;\nsystem(\""cls\"");\nsrand(time(NULL));\ndo\n{\nnum1=rand()%100;\nnum2=rand()%100;\nnum=num1*num2;\n}while(num>100);\nprintf(\""%d*%d=\"",num1,num2);\nreturn num;\n}\nmain()\n{ int a,c,i,n,r;\nfloat aver,grade=0;\nsrand(time(NULL));\nprintf(\""请输入题目数量：\"");\nscanf(\""%d\"",&n);\naver=100.0/n; //百分制\nfor(i=0;i<n;i++)\n{ c=rand()%(10/3);\nswitch(c)\n{\ncase 0:r=jia();break;\ncase 1:r=jian();break;\ncase 2:r=cheng();break;\n}\nscanf(\""%d\"",&a);\nif(a==r)\ngrade+=aver;\n}\nsystem(\""cls\"");\nprintf(\""成绩：%.1f\\n\"",grade);\n}\n",WRONG_ANSWER,12,2296
1573629139838132224,107bbb1c8563df914c1a009a8253375b62308e0759ce6060f307e8e48fe9b178,2022-09-24 19:03:18,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint F(int X,int Y,int Z)\n{\n    int i;\n    i=X+Y-Z;\n    return i;\n}\n\nint main\n{\nint X,Y,Z;\nscanf(\""%d%d%d\"",&X,&Y,&Z);\nprintf(\""%d\"",F(X,Y,Z));\nreturn 0;\n}",COMPILE_ERROR,0,0
1573629225091551232,13eac09c9e523ec396926840225e626f8fff54ca0e8a92e46e533705daa83ac2,2022-09-24 19:03:38,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main ()\n{\n    int X,Y,Z,M;\n \n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    if(0<=X<=100&&0<=Y<=100&&0<=Z<=100)\n    {\n        M=X+Y-Z;\n    }\n\n\n    printf(\""%d\\n\"",M);\n    return 0;\n}",ACCEPTED,12,328
1573629243353554944,107bbb1c8563df914c1a009a8253375b62308e0759ce6060f307e8e48fe9b178,2022-09-24 19:03:42,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint F(int X,int Y,int Z)\n{\n    int i;\n    i=X+Y-Z;\n    return i;\n}\n\nint main()\n{\nint X,Y,Z;\nscanf(\""%d%d%d\"",&X,&Y,&Z);\nprintf(\""%d\"",F(X,Y,Z));\nreturn 0;\n}",ACCEPTED,12,472
1573629289319268352,1bf0799d9c686a2f0d10cf3e8c6c19023212e70fdb74b8e74e5cb0a46d324c4a,2022-09-24 19:03:53,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"\n#include<stdio.h>\n#include<stdlib.h>\n#include<time.h>\nint main()\n{ int num1,num2,num;\nsystem(\""cls\"");\nsrand(time(NULL));\ndo\n{\nnum1=rand()%100;\nnum2=rand()%100;\nnum=num1+num2;\n}while(num>100);\nprintf(\""%d+%d=\"",num1,num2);\nreturn num;\n}\nint main()\n{ int num1,num2,num;\nsystem(\""cls\"");\nsrand(time(NULL));\ndo\n{\nnum1=rand()%100;\nnum2=rand()%100;\nnum=num1-num2;\n}while(num>100||num<0);\nprintf(\""%d-%d=\"",num1,num2);\nreturn num;\n}\nint cheng()\n{ int num1,num2,num;\nsystem(\""cls\"");\nsrand(time(NULL));\ndo\n{\nnum1=rand()%100;\nnum2=rand()%100;\nnum=num1*num2;\n}while(num>100);\nprintf(\""%d*%d=\"",num1,num2);\nreturn num;\n}\nmain()\n{ int a,c,i,n,r;\nfloat aver,grade=0;\nsrand(time(NULL));\nprintf(\""请输入题目数量：\"");\nscanf(\""%d\"",&n);\naver=100.0/n; //百分制\nfor(i=0;i<n;i++)\n{ c=rand()%(10/3);\nswitch(c)\n{\ncase 0:r=jia();break;\ncase 1:r=jian();break;\ncase 2:r=cheng();break;\n}\nscanf(\""%d\"",&a);\nif(a==r)\ngrade+=aver;\n}\nsystem(\""cls\"");\nprintf(\""成绩：%.1f\\n\"",grade);\n}\n",COMPILE_ERROR,0,0
1573629369681793024,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-09-24 19:04:13,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    sum=X+Y+Z;\n    printf(\""%d\\n\"",sum);\n    return 0;\n}",COMPILE_ERROR,0,0
1573629373142093824,7310135b9c9422c45d35553cb166f3e6e49919961fe8ee45fea6e98e16951395,2022-09-24 19:04:13,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n   int X,Y,Z;\n   scanf(\""%d,%d,%d\"",&X,&Y,&Z);\n    printf(\""%d\\n\"",X+Y-Z);\n    return 0;\n}",WRONG_ANSWER,4,200
1573629422496808960,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-09-24 19:04:25,Python,0.0,1573557741782495234,1572865591226855424,1049226928954454016,A=input('请输入一个整数X:')\nB=input('请输入一个整数Y:')\nC=input('请输入一个整数Z:')\nX=int(A)\nY=int(B)\nZ=int(C)\ndef F(x):\n    F(x)=X+Y-Z\nif 0<=X<=100 and 0<=Y<=100 and 0<=Z<=100:\n    F(x):\n    print(F(x))\n\n\n\n,NON_ZERO_EXIT_CODE,19,2764
1573629473373716480,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-09-24 19:04:37,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    sum=X+Y-Z;\n    printf(\""%d\\n\"",sum);\n    return 0;\n}",COMPILE_ERROR,0,0
1573629503790809088,7ecf54bf0ea2db8ab0397aa941f19ec79a351bc3e86e8c01673aa09a69b3a6db,2022-09-24 19:04:44,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n\nint main()\n{\n    int x,y,z;\n    int sum(int x,int y, int z);\n    scanf(\""%d\"",&x);\n    scanf(\""%d\"",&y);\n    scanf(\""%d\"",&z);\n    printf(\""%d\"",sum(x,y,z));\n    return 0;\n}\n\nint sum(int x,int y, int z)\n{\n    int s = x+y-z;\n    return s;\n}",ACCEPTED,9,360
1573629511097286656,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-09-24 19:04:46,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    X>=0&&Y>=0&&Z>=0&&X<=100&&Y<=100&&Z<=100;\n    sum=X+Y-Z;\n    printf(\""%d\\n\"",sum);\n    return 0;\n}",COMPILE_ERROR,0,0
1573629626021216256,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-09-24 19:05:14,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int X,Y,Z，sum;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    X>=0&&Y>=0&&Z>=0&&X<=100&&Y<=100&&Z<=100;\n    sum=X+Y-Z;\n    printf(\""%d\\n\"",sum);\n    return 0;\n}",COMPILE_ERROR,0,0
1573629627870904320,107bbb1c8563df914c1a009a8253375b62308e0759ce6060f307e8e48fe9b178,2022-09-24 19:05:14,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint F(int X,int Y,int Z)\n{\n    int i;\n    i=X+Y-Z;\n    return i;\n}\n\nint main()\n{\nint X,Y,Z;\nscanf(\""%d%d%d\"",&X,&Y,&Z);\n    if(X>=0&&X<=100&&Y>=0&&Y<=100&&Z>=0&&Z<=100)\nprintf(\""%d\"",F(X,Y,Z));\nreturn 0;\n}",ACCEPTED,10,200
1573629710750351360,8c7d136eed2209a8278a3c3e192a5d053f6a8600b4912db28dac81c2463d6463,2022-09-24 19:05:34,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d,%d,%d\"",&X,&Y,&Z,);\n    F(x)=X+Y-Z;\n    printf(\""%d,%d,%d\"",X,Y,Z,X>0||X=0&xX<100||X=100);\n    printf(\""%d\"",F(x));\n    return 0;\n}",COMPILE_ERROR,0,0
1573629819944521728,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-09-24 19:06:00,Python,0.0,1573557741782495234,1572865591226855424,1049226928954454016,X=intinput('请输入一个整数X:')\nY=intinput('请输入一个整数Y:')\nZ=intinput('请输入一个整数Z:')\ndef F(x):\n    F(x)=X+Y-Z\nif 0<=X<=100 and 0<=Y<=100 and 0<=Z<=100:\n    F(x):\n    print(F(x))\n\n\n\n,NON_ZERO_EXIT_CODE,16,2904
1573629853075329024,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-09-24 19:06:08,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int X,Y,Z，sum;\n    X>=0&&Y>=0&&Z>=0&&X<=100&&Y<=100&&Z<=100;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    sum=X+Y-Z;\n    printf(\""%d\\n\"",sum);\n    return 0;\n}",COMPILE_ERROR,0,0
1573629915461406720,7310135b9c9422c45d35553cb166f3e6e49919961fe8ee45fea6e98e16951395,2022-09-24 19:06:23,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n   int X,Y,Z;\n   scanf(\""%d,%d,%d\\n\"",&X,&Y,&Z);\n    printf(\""%d\\n\"",X+Y-Z);\n    return 0;\n}",WRONG_ANSWER,4,324
1573629981743992832,b7ca5a176d530473c8faa24fa803cc5b5bef6deef335789b05821ec37e6b8252,2022-09-24 19:06:38,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint F()\n{\n\tint X,Y,Z,a;\n\tscanf(\""%d %d %d\"",X,Y,Z);\n\ta=X+Y-Z;\n\tprintf(\""%d\"",a);\n\treturn a;\n\t\n}\nint main()\n{\n\tint b;\n\tb=F;\n\tprintf(\""F(x)=%d\"",b);\n\treturn 0;\n\t\n}",WRONG_ANSWER,5,196
1573630009946497024,2ccc7507304cfd28125f6d85cdb4df769a41aec4f125254d0d2415ba16cb27c2,2022-09-24 19:06:45,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint zhengshu(int x,int y,int z)\n{\n    int a;\n    a=x+y-z;\n    return a;\n}\n\nint main()\n{\n    int x,y,z,c;\n    scanf (\""%d %d %d\"",&x,&y,&z);\n    c=zhengshu(x,y,z);\n    printf(\""%d\"",c);\n    return 0;\n}\n",ACCEPTED,8,332
1573630042406551552,d4307de98f97e5832ea85f9bbca85c94e1b6507640439931056a9760bb74dbfb,2022-09-24 19:06:53,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include  <stdio.h>\nint main()\n{\n\tint x,y,z;\n\tscanf(\""%d%d%d\"",&x,&y,&z);\n\tif((x>=0&&x<=100)&&(y>=0&&y<=100)&&(z>=0&&z<=100))\n\tprintf(\""%d\"",x+y-z);\n\telse\n\treturn 0;\n } ",ACCEPTED,8,196
1573630165982990336,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-09-24 19:07:22,Python,0.0,1573557741782495234,1572865591226855424,1049226928954454016,X=int[input('请输入一个整数X:')]\nY=int[input('请输入一个整数Y:')]\nZ=int[input('请输入一个整数Z:')]\ndef F(x):\n    F(x)=X+Y-Z\nif 0<=X<=100 and 0<=Y<=100 and 0<=Z<=100:\n    F(x):\n    print(F(x))\n\n\n\n,NON_ZERO_EXIT_CODE,17,2760
1573630171100045312,beefe7893dd2cd421da3fb1ba3ffd90e3dc51d5301380baebfdfa12fbe5234f5,2022-09-24 19:07:24,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint num(int x,int y,int z)\n{\n    int m;\n    m = x+y+z;\n    return m;\n    \n}\nint main()\n{\n    int n;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    n = num(int x,int y,int z);\n    printf(\""%d\"",n)\n}",COMPILE_ERROR,0,0
1573630200841854976,1bf0799d9c686a2f0d10cf3e8c6c19023212e70fdb74b8e74e5cb0a46d324c4a,2022-09-24 19:07:31,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"\n#include<stdio.h>\n#include<stdlib.h>\n#include<time.h>\nmain()\n{ int num1,num2,num;\n//system(\""cls\"");\n//srand(time(NULL));\ndo\n{\n//num1=rand()%100;\n//num2=rand()%100;\nnum=num1-num2;\n}while(num>100||num<0);\nprintf(\""%d-%d=\"",num1,num2);\nreturn num;\n}\n\n",WRONG_ANSWER,4,200
1573630315400880128,1bf0799d9c686a2f0d10cf3e8c6c19023212e70fdb74b8e74e5cb0a46d324c4a,2022-09-24 19:07:58,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"\n#include<stdio.h>\n#include<stdlib.h>\n#include<time.h>\nint main()\n{ int num1,num2,num;\n//system(\""cls\"");\n//srand(time(NULL));\ndo\n{\n//num1=rand()%100;\n//num2=rand()%100;\nnum=num1-num2;\n}while(num>100||num<0);\nprintf(\""%d-%d=\"",num1,num2);\nreturn num;\n}\n\n",WRONG_ANSWER,4,328
1573630358694821888,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-09-24 19:08:08,Python,0.0,1573557741782495234,1572865591226855424,1049226928954454016,X=int[input('请输入一个整数X:')]\nY=int[input('请输入一个整数Y:')]\nZ=int[input('请输入一个整数Z:')]\ndef F(x):\n    F(x)=X+Y-Z\nif 0<=X<=100 and 0<=Y<=100 and 0<=Z<=100:\n    F(x)\n    print(F(x))\n\n\n\n,NON_ZERO_EXIT_CODE,16,2888
1573630373819142144,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-09-24 19:08:12,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int X,Y,Z，sum;\n    X>=0&&X<=100&&Y>=0&&Y<=100Z>=0&&Z<=100;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    sum=X+Y-Z;\n    printf(\""%d\\n\"",sum);\n    return 0;\n}",COMPILE_ERROR,0,0
1573630379804753920,c03ae905b4de4d41e5d9328da5270539e1a32e2d888b8dd41fb10f72c24a90ce,2022-09-24 19:08:13,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint X,Y,Z,a,F（x）\n int f(intX,intY,intZ)\n {\n\n\n     a=X+Y+Z;\n     return a;\n };\nint main()\n{\n    printf(\""请输入三个整数X,Y,Z\\n\"");\n    scanf(\""%d,%d,%d\"",&X,&Y,&Z);\n      F（x）=f(X,Y,Z);\n    printf(\""F（x）=X+Y-Z的值为%d\"",&F（x）);\n\n\n\n\n\n    return 0;\n}\n",COMPILE_ERROR,0,0
1573630484557156352,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-09-24 19:08:38,Python,0.0,1573557741782495234,1572865591226855424,1049226928954454016,X=int[input('请输入一个整数X:')]\nY=int[input('请输入一个整数Y:')]\nZ=int[input('请输入一个整数Z:')]\ndef F(x):\n    F(x)=X+Y-Z\nif 0<=X<=100 and 0<=Y<=100 and 0<=Z<=100:\n    F(x)\n    print('F(x)')\n\n\n\n,NON_ZERO_EXIT_CODE,15,2888
1573630513967616000,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-09-24 19:08:45,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int X,Y,Z，sum;\n    X>=0&&X<=100;\n    Y>=0&&Y<=100;\n    Z>=0&&Z<=100;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    sum=X+Y-Z;\n    printf(\""%d\\n\"",sum);\n    return 0;\n}",COMPILE_ERROR,0,0
1573630608029077504,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-09-24 19:09:08,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int X,Y,Z，sum;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    X>=0&&X<=100;\n    Y>=0&&Y<=100;\n    Z>=0&&Z<=100;\n    sum=X+Y-Z;\n    printf(\""%d\\n\"",sum);\n    return 0;\n}",COMPILE_ERROR,0,0
1573630616594186240,03f9d7a6fc27d141b8243d1b2b44a3276cdd4750b5c2621d6d8c006b64ca6514,2022-09-24 19:09:10,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint sum(int a,int b,int c)\n{\n    int t=0;\n    t=a+b-c;\n    return t;\n}\nint main()\n{\n    int a,b,c,t;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    t=sum(a,b,c)\n    printf(\""%d\"",t);\n    return 0;\n}",COMPILE_ERROR,0,0
1573630821108109312,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-09-24 19:09:59,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z,a;\n    scanf(\""%d,%d,%d\"",&X,&Y,&Z);\n    \n    a=X+Y-Z;\n\n    printf(\""%d\"",a);\n    return 0;\n}\n",WRONG_ANSWER,4,196
1573630877999648768,03f9d7a6fc27d141b8243d1b2b44a3276cdd4750b5c2621d6d8c006b64ca6514,2022-09-24 19:10:12,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint sum(int a,int b,int c)\n{\n    int t=0;\n    t=a+b-c;\n    return t;\n}\nint main()\n{\n    int a,b,c,t;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    t=sum(a,b,c);\n    printf(\""%d\"",t);\n    return 0;\n}",ACCEPTED,10,200
1573630911239507968,6fce57fde7ceb26e645ecc963f30c03562cb1979e4574a4fbddb47249814b847,2022-09-24 19:10:20,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z,M;\n    scanf(\""%d %d %d,&X,&Y,&Z\"")；\n    if（0<=X<=100&&0<=Y<=100&&0<=Z<=100);\n    {\n        X+Y-Z\n    }\n    \n    \n    \n    printf(\""%d\\n\"",M);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1573630955715907584,6fce57fde7ceb26e645ecc963f30c03562cb1979e4574a4fbddb47249814b847,2022-09-24 19:10:31,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z,M;\n    scanf(\""%d %d %d,&X,&Y,&Z\"")；\n    if（0<=X<=100&&0<=Y<=100&&0<=Z<=100);\n    {\n        X+Y-Z;\n    }\n    \n    \n    \n    printf(\""%d\\n\"",M);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1573630969104130048,beefe7893dd2cd421da3fb1ba3ffd90e3dc51d5301380baebfdfa12fbe5234f5,2022-09-24 19:10:34,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint num(int x,int y,int z)\n{\n    int result;\n    result = x+y-z;\n    return result;\n\n}\nint main()\n{\n    int n;\n    scanf(\""%d\"",&x);\n    scanf(\""%d\"",&y);\n    scanf(\""%d\"",&z)\n    n = num(x,y,z);\n    printf(\""%d\"",n);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1573631079813120000,6fce57fde7ceb26e645ecc963f30c03562cb1979e4574a4fbddb47249814b847,2022-09-24 19:11:00,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z,M;\n    scanf(\""%d %d %d,&X,&Y,&Z\"")；\n    if（0<=X<=100&&0<=Y<=100&&0<=Z<=100);\n    {\n        M=X+Y-Z;\n    }\n    \n    \n    \n    printf(\""%d\\n\"",M);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1573631190999584768,c03ae905b4de4d41e5d9328da5270539e1a32e2d888b8dd41fb10f72c24a90ce,2022-09-24 19:11:27,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint X,Y,Z,a,F（x）\n int f(intX,intY,intZ)\n {\n\n\n     a=X+Y+Z;\n     return a;\n };\nint main()\n{\n    printf(\""请输入三个整数X,Y,Z\\n\"");\n    scanf(\""%d,%d,%d\"",&X,&Y,&Z);\n      F（x）=f(X,Y,Z);\n    printf(\""F（x）=X+Y-Z的值为%d\"",&F（x）);\n\n\n\n\n\n    return 0;\n}\n\n",COMPILE_ERROR,0,0
1573631252836212736,1bf0799d9c686a2f0d10cf3e8c6c19023212e70fdb74b8e74e5cb0a46d324c4a,2022-09-24 19:11:41,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"\n#include<stdio.h>\n#include<stdlib.h>\n#include<time.h>\nint main()\n{ int X,Y,Z,A;\n//system(\""cls\"");\n//srand(time(NULL));\n scanf(\""%d%d\"",&X,&Y,&Z)；\ndo\n{\n//num1=rand()%100;\n//num2=rand()%100;\nA=X+Y-Z;\n}while(X>=0||X<=100,Y>=0||Y<=100,Z>=0||Z<=100);\nprintf(\""%d\"",A);\nreturn 0;\n}\n\n",COMPILE_ERROR,0,0
1573631266698383360,6fce57fde7ceb26e645ecc963f30c03562cb1979e4574a4fbddb47249814b847,2022-09-24 19:11:45,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z,M;\n    \n    scanf(\""%d %d %d\""&X,&Y,&Z)；\n    if（0<=X<=100&&0<=Y<=100&&0<=Z<=100);\n    {\n        M=X+Y-Z;\n    }\n    \n    \n    \n    printf(\""%d\\n\"",M);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1573631297401028608,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-09-24 19:11:52,Python,0.0,1573557741782495234,1572865591226855424,1049226928954454016,X=input('请输入一个整数X:')\nY=input('请输入一个整数Y:')\nZ=input('请输入一个整数Z:')\nX=int('X')\nY=int('Y')\nZ=int('Z')\ndef F(x):\n    F(x)=X+Y-Z\nif 0<=X<=100 and 0<=Y<=100 and 0<=Z<=100:\n    F(x)\n    print('F(x)')\n\n\n\n,NON_ZERO_EXIT_CODE,16,2760
1573631389474390016,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-09-24 19:12:14,Python,0.0,1573557741782495234,1572865591226855424,1049226928954454016,X=input('请输入一个整数X:')\nY=input('请输入一个整数Y:')\nZ=input('请输入一个整数Z:')\nX=int('X')\nY=int('Y')\nZ=int('Z')\ndef F(x):\n    F(x)=X+Y-Z\nif 0<=X<=100 and 0<=Y<=100 and 0<=Z<=100:\n    def F(x)\n    print('F(x)')\n\n\n\n,NON_ZERO_EXIT_CODE,16,2888
1573631450472153088,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-09-24 19:12:29,Python,0.0,1573557741782495234,1572865591226855424,1049226928954454016,X=input('请输入一个整数X:')\nY=input('请输入一个整数Y:')\nZ=input('请输入一个整数Z:')\nX=int('X')\nY=int('Y')\nZ=int('Z')\ndef F(x):\n    F(x)=X+Y-Z\nif 0<=X<=100 and 0<=Y<=100 and 0<=Z<=100:\n    F(x)\n    print(F(x))\n\n\n\n,NON_ZERO_EXIT_CODE,15,2888
1573631451306819584,6fce57fde7ceb26e645ecc963f30c03562cb1979e4574a4fbddb47249814b847,2022-09-24 19:12:29,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z,M;\n    \n    scanf(\""%d %d %d\""&X,&Y,&Z)；\n    if（0<=X<=100&&0<=Y<=100&&0<=Z<=100);\n    {\n        M=X+Y-Z;\n    }\n    \n    \n    \n    printf(\""%d\\n\"",M);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1573631793414885376,6fce57fde7ceb26e645ecc963f30c03562cb1979e4574a4fbddb47249814b847,2022-09-24 19:13:50,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z,M;\n    \n    scanf(\""%d %d %d\"",X,&Y,&Z)；\n    if（0<=X<=100&&0<=Y<=100&&0<=Z<=100);\n    {\n        M=X+Y-Z;\n    }\n    \n    \n    \n    printf(\""%d\\n\"",M);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1573631826189516800,b5c79fb44e034c521890dc03ca40d19350fcf0815ac9dc9f4d06cd9cd501e6ad,2022-09-24 19:13:58,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    printf(\""%d\"",X+Y-Z);\n    return 0;\n}\n",ACCEPTED,11,324
1573631880967127040,6fce57fde7ceb26e645ecc963f30c03562cb1979e4574a4fbddb47249814b847,2022-09-24 19:14:11,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z,M;\n    \n    scanf(\""%d %d %d\"",X,&Y,&Z)；\n    if（0<=X<=100&&0<=Y<=100&&0<=Z<=100);\n    {\n        M=X+Y-Z;\n    }\n    \n    \n    \n    printf(\""%d\\n\"",f\n    return 0;\n}\n",COMPILE_ERROR,0,0
1573631898914217984,7310135b9c9422c45d35553cb166f3e6e49919961fe8ee45fea6e98e16951395,2022-09-24 19:14:16,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n   int X,Y,Z;\n   scanf(\""%d %d %d\"",&X,&Y,&Z);\n    printf(\""%d\\n\"",X+Y-Z);\n    return 0;\n}",ACCEPTED,8,196
1573632061707735040,e1ef8909479ad302f215d71e5a7696f8a0d6c6e22558408304052fad134b6ab7,2022-09-24 19:14:54,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main ()\n{\n    int x,y,z;\n    scanf(\""%d%d%d/n\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\nreturn 0;}",ACCEPTED,8,200
1573632078392676352,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-09-24 19:14:58,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int X,Y,Z，sum;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    sum=X+Y-Z;\n    printf(\""%d\\n\"",sum);\n    return 0;\n}",COMPILE_ERROR,0,0
1573632128548167680,7256ff1c58d1afc85077ccccf0772ba7eddd8ce444a78a71c54fc7c16fd7f655,2022-09-24 19:15:10,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    printf(\""%d\"",X+Y-Z);\n    return 0;\n}\n",ACCEPTED,9,324
1573632160173219840,dad94b95c941376078f8ba66ae5daa881140c57a0fe39c3ed361f33528c15376,2022-09-24 19:15:18,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int X,Y,Z,sum;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    sum=X+Y-Z;\n    printf(\""%d\\n\"",sum);\n    return 0;\n}",ACCEPTED,8,196
1573632161955794944,6fce57fde7ceb26e645ecc963f30c03562cb1979e4574a4fbddb47249814b847,2022-09-24 19:15:18,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z,M;\n    \n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    if（0<=X<=100&&0<=Y<=100&&0<=Z<=100);\n    {\n        M=X+Y-Z;\n    }\n    \n    \n    \n    printf(\""%d\\n\"",M);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1573632325924061184,beefe7893dd2cd421da3fb1ba3ffd90e3dc51d5301380baebfdfa12fbe5234f5,2022-09-24 19:15:57,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint num(int x,int y,int z)\n{\n    int result;\n    result = x+y-z;\n    return result;\n\n}\nint main()\n{\n    int n;\n    int a,b,c;\n    scanf(\""%d\"",&a);\n    scanf(\""%d\"",&b);\n    scanf(\""%d\"",&c);\n    n = num(a,b,c);\n    printf(\""%d\"",n);\n    return 0;\n}\n",ACCEPTED,12,356
1573632414541316096,b7ca5a176d530473c8faa24fa803cc5b5bef6deef335789b05821ec37e6b8252,2022-09-24 19:16:18,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nvoid F()\n{\n\tint X,Y,Z,a;\n\tscanf(\""%d %d %d\"",X,Y,Z);\n\ta=X+Y-Z;\n\tprintf(\""%d\"",a);\n\treturn a;\n\t\n}\nint main()\n{\n\tint b;\n\tb=F;\n\tprintf(\""%d\"",b);\n\treturn 0;\n\t\n}",WRONG_ANSWER,6,324
1573632425999814656,6a835d762a87e93baf4142897168374dc31e9da90b86c19ed82f21159b644272,2022-09-24 19:16:21,C++,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int x,y,z,c;\n    scanf(\""%d%d%d\"",&x,&y,&z);\n        c=z+y-z;\n    printf(\""%d\"",c);\n    return 0;\n}\n",WRONG_ANSWER,4,332
1573632462582534144,6fce57fde7ceb26e645ecc963f30c03562cb1979e4574a4fbddb47249814b847,2022-09-24 19:16:30,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z,M;\n    \n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    if(<=X<=100&&0<=Y<=100&&0<=Z<=100);\n    {\n        M=X+Y-Z;\n    }\n    \n    \n    \n    printf(\""%d\\n\"",M);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1573632500339662848,c03ae905b4de4d41e5d9328da5270539e1a32e2d888b8dd41fb10f72c24a90ce,2022-09-24 19:16:39,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint X,Y,Z,a,F（x）\n int f(intX,intY,intZ)\n {\n   printf(\""%d,%d,%d\"",X,Y,Z);\n\n\n     a=X+Y+Z;\n     return a;\n };\nint main()\n{\n    printf(\""请输入三个整数X,Y,Z\\n\"");\n    \n    scanf(\""%d,%d,%d\"",&X,&Y,&Z);\n    a=f(X,Y,Z);\n    printf(\""F（x）=X+Y-Z的值%d\\n\"",&a);\n\n\n\n\n\n    return 0;\n}\n\n",COMPILE_ERROR,0,0
1573632510640873472,1bf0799d9c686a2f0d10cf3e8c6c19023212e70fdb74b8e74e5cb0a46d324c4a,2022-09-24 19:16:41,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"\n#include<stdio.h>\n#include<stdlib.h>\n\nint main()\n{ int a,b,c,f;\n scanf(\""%d\"",&a);\n scanf(\""%d\"",&b);\n scanf(\""%d\"",&c);\n f=a+b-c;\n printf(\""%d\"",f);\nreturn 0;\n}\n\n",ACCEPTED,13,492
1573632522624335872,c03ae905b4de4d41e5d9328da5270539e1a32e2d888b8dd41fb10f72c24a90ce,2022-09-24 19:16:44,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint X,Y,Z,a,F（x）\n int f(intX,intY,intZ)\n {\n   printf(\""%d,%d,%d\"",X,Y,Z);\n\n\n     a=X+Y+Z;\n     return a;\n };\nint main()\n{\n    printf(\""请输入三个整数X,Y,Z\\n\"");\n    \n    scanf(\""%d,%d,%d\"",&X,&Y,&Z);\n    a=f(X,Y,Z);\n    printf(\""F（x）=X+Y-Z的值%d\\n\"",&a);\n\n\n\n\n\n    return 0;\n}\n\n",COMPILE_ERROR,0,0
1573632538612686848,6a835d762a87e93baf4142897168374dc31e9da90b86c19ed82f21159b644272,2022-09-24 19:16:48,C++,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int x,y,z,c;\n    scanf(\""%d%d%d\"",&x,&y,&z);\n        c=x+y-z;\n    printf(\""%d\"",c);\n    return 0;\n}\n",ACCEPTED,13,328
1573632705206583296,b7ca5a176d530473c8faa24fa803cc5b5bef6deef335789b05821ec37e6b8252,2022-09-24 19:17:28,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nvoid F()\n{\n\tint X,Y,Z,a;\n\tscanf(\""%d %d %d\"",X,Y,Z);\n\ta=X+Y-Z;\n\tprintf(\""%d\"",a);\n\treturn a;\n\t\n}\nint main()\n{\n\tint b;\n\tb=F;\n\tprintf(\""%d\"",b);\n\treturn 0;\n\t\n}",WRONG_ANSWER,5,496
1573632738081198080,6fce57fde7ceb26e645ecc963f30c03562cb1979e4574a4fbddb47249814b847,2022-09-24 19:17:36,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z,M;\n    \n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    if(0<=X<=100&&0<=Y<=100&&0<=Z<=100);\n    {\n        M=X+Y-Z;\n    }\n    \n    \n    \n    printf(\""%d\\n\"",M);\n    return 0;\n}\n",ACCEPTED,11,360
1573632823372374016,b7ca5a176d530473c8faa24fa803cc5b5bef6deef335789b05821ec37e6b8252,2022-09-24 19:17:56,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nvoid F()\n{\n\tint X,Y,Z,a;\n\tscanf(\""%d %d %d\"",X,Y,Z);\n\ta=X+Y-Z;\n\tprintf(\""%d\"",a);\n\treturn a;\n\t\n}\nint main()\n{\n\tint b;\n\tb=F();\n\tprintf(\""%d\"",b);\n\treturn 0;\n\t\n}",COMPILE_ERROR,0,0
1573632988204662784,6fce57fde7ceb26e645ecc963f30c03562cb1979e4574a4fbddb47249814b847,2022-09-24 19:18:35,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int X,Y,Z,A;\n    \n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    if(0<=X<=100&&0<=Y<=100&&0<=Z<=100);\n    {\n        A=X+Y-Z;\n    }\n    \n    \n    \n    printf(\""%d\\n\"",A);\n    return 0;\n}\n",ACCEPTED,9,324
1573633119125327872,b7ca5a176d530473c8faa24fa803cc5b5bef6deef335789b05821ec37e6b8252,2022-09-24 19:19:06,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint F()\n{\n\tint X,Y,Z,a;\n\tscanf(\""%d %d %d\"",X,Y,Z);\n\ta=X+Y-Z;\n\tprintf(\""%d\"",a);\n\treturn a;\n\t\n}\nint main()\n{\n\tint b;\n\tb=F();\n\tprintf(\""%d\"",b);\n\treturn 0;\n\t\n}",SEGMENTATION_FAULT,4,344
1573633247194210304,8c7d136eed2209a8278a3c3e192a5d053f6a8600b4912db28dac81c2463d6463,2022-09-24 19:19:37,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d,%d,%d\"",&X,&Y,&Z);\n    F(x)=X+Y-Z;\n    printf(\""%d,%d,%d\"",X,Y,Z,X>0||X=0&xX<100||X=100,Y>0||Y=0&&Y<100||Y=100,Z>0||Z=0&&Z<100||Z=100);\n    printf(\""%d\"",F(x));\n    return 0;\n}",COMPILE_ERROR,0,0
1573633267347836928,6b6faad7f79c1654c093443534214eb393aea4d47ec5a88403248af60d2dec07,2022-09-24 19:19:42,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint F(X,Y,Z);\nint main()\n{\n    int X,Y,Z,F(X,Y,Z);\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n\n    printf(\""%d\"",F(X,Y,Z));\n    return 0;\n}\nint F(X,Y,Z)\n{\n    int F;\n    F=X+Y-Z;\n    return F;\n}\n",ACCEPTED,8,204
1573633531413168128,a86eb3e386c113a71d3dc8cf1898c93a52937bb9b192be16b6dd657d71dda450,2022-09-24 19:20:45,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#define F(X)=X+Y-Z;\nint main(){\n    int x,y,z;\n    int F;\n    0<x,y,z<100;\n    F=x+y-z;\n    printf(\""%d\"",&F);\n    return 0;\n    }\n    \n    \n    \n    ",WRONG_ANSWER,5,360
1573633701105983488,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-09-24 19:21:25,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio>\nint main();\n    scanf(\""请输入三个整数：\""%d,%d,%d);\n    X=%d;Y=%d;Z=%d;\ndefine F(x)=X+Y-Z;\nprint(\""F(x)\"")\n\n\n",COMPILE_ERROR,0,0
1573633980837036032,038e42376e9858a5a0d1826a17de3e149da6c7deb129501295633acdb2780aff,2022-09-24 19:22:32,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint number（int x,int y,int z）\n{\nint a;\n    a=x+y-z;\n    return a;\n}\nint main()\n{\n    int x,,y,z,c;\n    scanf(\""%d %d %d\"".&x,&y,&z);\n    c=number(x,y,z);\n    printf(\""%d\"",c)\n        return 0\n}",COMPILE_ERROR,0,0
1573634072709070848,038e42376e9858a5a0d1826a17de3e149da6c7deb129501295633acdb2780aff,2022-09-24 19:22:54,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint number（int x,int y,int z）\n{\nint a;\n    a=x+y-z;\n    return a;\n}\nint main()\n{\n    int x,,y,z,c;\n    scanf(\""%d %d %d\"".&x,&y,&z);\n    c=number(x,y,z);\n    printf(\""%d\"",c)\n        return 0\n}",COMPILE_ERROR,0,0
1573634216850182144,038e42376e9858a5a0d1826a17de3e149da6c7deb129501295633acdb2780aff,2022-09-24 19:23:28,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint number（int x,int y,int z）\n{\nint a;\n    a=x+y-z;\n    return a;\n}\nint main()\n{\n    int x,,y,z,c;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    c=number(x,y,z);\n    printf(\""%d\"",c);\n        return 0;\n}",COMPILE_ERROR,0,0
1573634259183632384,c03ae905b4de4d41e5d9328da5270539e1a32e2d888b8dd41fb10f72c24a90ce,2022-09-24 19:23:38,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n int sz(int x,int y,int z)\n {\n     int a;\n     a=x+y-Z;\n     return a;\n }\n \nint main()\n{\n    int x,y,z,b;\n    scanf(\""%d,%d,%d\"",&x,&y,&z);\n    b=sz(x,y,z);\n    printf(\""%d\"",b);\n    return 0;\n}\n\n",COMPILE_ERROR,0,0
1573634300048396288,038e42376e9858a5a0d1826a17de3e149da6c7deb129501295633acdb2780aff,2022-09-24 19:23:48,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint shuzi（int x,int y,int z）\n{\nint a;\n    a=x+y-z;\n    return a;\n}\nint main()\n{\n    int x,,y,z,c;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    c=shuzi(x,y,z);\n    printf(\""%d\"",c);\n        return 0;\n}",COMPILE_ERROR,0,0
1573634325206171648,da72e985b1ff1737d155282af7dd43e3dc341605cc356d114979edd4fea85a11,2022-09-24 19:23:54,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int X,Y,Z,sum;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    sum=X+Y-Z;\n    printf(\""%d\"",sum);\n    return 0;\n}\n",ACCEPTED,10,212
1573634333011431424,8c7d136eed2209a8278a3c3e192a5d053f6a8600b4912db28dac81c2463d6463,2022-09-24 19:23:56,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int X,Y,Z,F(x);\n    scanf(\""%d,%d,%d\"",&X,&Y,&Z);\n    F(x)=X+Y-Z;\n    printf(\""%d\"",F(x));\n    return 0;\n}",COMPILE_ERROR,0,0
1573634405543530496,038e42376e9858a5a0d1826a17de3e149da6c7deb129501295633acdb2780aff,2022-09-24 19:24:13,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\n#include<stdlib.h>\nint number（int x,int y,int z）\n{\nint a;\n    a=x+y-z;\n    return a;\n}\nint main()\n{\n    int x,,y,z,c;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    c=number(x,y,z);\n    printf(\""%d\"",c);\n        return 0;\n}",COMPILE_ERROR,0,0
1573634651535269888,8c7d136eed2209a8278a3c3e192a5d053f6a8600b4912db28dac81c2463d6463,2022-09-24 19:25:12,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int X,Y,Z,F(x);\n    scanf(\""%d,%d,%d,%d\"",&X,&Y,&Z,&F(x));\n    F(x)=X+Y-Z;\n    printf(\""%d\"",F(x));\n    return 0;\n}",COMPILE_ERROR,0,0
1573634702554779648,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-09-24 19:25:24,Python,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"X,Y,Z=input('请输入三个整数:')\nX=int(X)\nY=int(Y)\nZ=int(Z)\ndef F(x):\n    F(x)=X+Y-Z\nif 0<=X<=100 and 0<=Y<=100 and 0<=Z<=100:\n    F(x)\n    print(F(x))\n",NON_ZERO_EXIT_CODE,18,2824
1573634716974800896,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-09-24 19:25:27,Python,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"X,Y,Z=input('请输入三个整数:')\nX=int(X)\nY=int(Y)\nZ=int(Z)\ndef F(x):\n    F(x)=X+Y-Z\nif 0<=X<=100 and 0<=Y<=100 and 0<=Z<=100:\n    F(x)\n    print(F(x))\n",NON_ZERO_EXIT_CODE,16,2884
1573634932402978816,c03ae905b4de4d41e5d9328da5270539e1a32e2d888b8dd41fb10f72c24a90ce,2022-09-24 19:26:19,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n int sz(int x,int y,int z)\n {\n     int a;\n     a=x+y-z;\n     return a;\n }\n \nint main()\n{\n    int x,y,z,b;\n    scanf(\""%d,%d,%d\"",&x,&y,&z);\n    b=sz(x,y,z);\n    printf(\""%d\"",b);\n    return 0;\n}\n\n\n",WRONG_ANSWER,6,204
1573634975285202944,c03ae905b4de4d41e5d9328da5270539e1a32e2d888b8dd41fb10f72c24a90ce,2022-09-24 19:26:29,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n int sz(int x,int y,int z)\n {\n     int a;\n     a=x+y-z;\n     return a;\n }\n \nint main()\n{\n    int x,y,z,b;\n    scanf(\""%d,%d,%d\"",&x,&y,&z);\n    b=sz(x,y,z);\n    printf(\""%d\"",b);\n    return 0;\n}\n\n\n",WRONG_ANSWER,4,328
1573634998513258496,b7ca5a176d530473c8faa24fa803cc5b5bef6deef335789b05821ec37e6b8252,2022-09-24 19:26:35,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint F()\n{\n\tint X,Y,Z,a;\n\tscanf(\""%d %d %d\"",&X,&Y,&Z);\n\ta=X+Y-Z;\n\tprintf(\""%d\"",a);\n\treturn a;\n\t\n}\nint main()\n{\n\tint b;\n\tb=F();\n\tprintf(\""%d\"",b);\n\treturn 0;\n\t\n}",WRONG_ANSWER,4,360
1573635147327504384,b7ca5a176d530473c8faa24fa803cc5b5bef6deef335789b05821ec37e6b8252,2022-09-24 19:27:10,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint F()\n{\n\tint X,Y,Z,a;\n\tscanf(\""%d %d %d\"",&X,&Y,&Z);\n\ta=X+Y-Z;\n\treturn a;\n\t\n}\nint main()\n{\n\tint b;\n\tb=F();\n\tprintf(\""%d\"",b);\n\treturn 0;\n\t\n}",ACCEPTED,8,324
1573635197617209344,8c7d136eed2209a8278a3c3e192a5d053f6a8600b4912db28dac81c2463d6463,2022-09-24 19:27:22,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int X,Y,Z,F(x);\n    scanf(\""%d,%d,%d,%d\"",&X,&Y,&Z,&F(x));\n    F(x)=X+Y-Z;\n    printf(\""F(x) is %d\"",F(x));\n    return 0;\n}",COMPILE_ERROR,0,0
1573635198602870784,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-09-24 19:27:22,Python,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"X,Y,Z=input('请输入三个整数:')\nX=int(X)\nY=int(Y)\nZ=int(Z)\ndef F(x):\n    X+Y-Z\nif 0<=X<=100 and 0<=Y<=100 and 0<=Z<=100:\n    F(x)\n    print(F(x))\n",NON_ZERO_EXIT_CODE,16,2764
1573635513502826496,8c7d136eed2209a8278a3c3e192a5d053f6a8600b4912db28dac81c2463d6463,2022-09-24 19:28:37,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int X,Y,Z,F(X);\n    scanf(\""%d,%d,%d,%d\"",&X,&Y,&Z,&F(X));\n    F(X)=X+Y-Z;\n    printf(\""F(X) is %d\"",F(X));\n    return 0;\n}",COMPILE_ERROR,0,0
1573635666351652864,c03ae905b4de4d41e5d9328da5270539e1a32e2d888b8dd41fb10f72c24a90ce,2022-09-24 19:29:14,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n int sz(int x,int y,int z)\n {\n     int a;\n     a=x+y-z;\n     return a;\n }\n \nint main()\n{\n    int x,y,z,b;\n    scanf(\""%d,%d,%d\"",&x,&y,&z);\n    b=sz(x,y,z);\n    printf(\""%d\"",b);\n    return 0;\n}\n\n\n",WRONG_ANSWER,4,324
1573635671682613248,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-09-24 19:29:15,Python,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"X,Y,Z=input('请输入三个整数:')\nX=int(X)\nY=int(Y)\nZ=int(Z)\ndef F(x):\n    X+Y-Z\nif 0<=X<=100 and 0<=Y<=100 and 0<=Z<=100:\n    F(x)\n    print(F(x))\n",NON_ZERO_EXIT_CODE,16,2760
1573635679496265728,d21dc339d37b0772b2547441444d4b660b000ac3ebe190aee01769e2dd619c10,2022-09-24 19:29:17,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\n#include<math.h>\nint X, Y, Z,W;\nint main()\n{\n        scanf(\""%d %d %d\"",&X,&Y,&Z);\n        if(0<=X<=100&&0<=Y<=100&&0<=Z<=100)\n        {\n           W=X+Y-Z;\n        }\n        printf(\""%d\"",W);\n        return 0;\n}\n    ",ACCEPTED,11,344
1573635967427182592,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-09-24 19:30:26,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\n\nint area()\n{\n int X,Y,Z,F;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n0<=X,Y,Z<=100;\n    return X+Y-Z;\n\n}\n\n\n\nint main()\n{\n    int d;\n    d=area();\n    printf(\""%d\"",d);\n    return 0;\n}\n",ACCEPTED,10,472
1573635989631488000,8c7d136eed2209a8278a3c3e192a5d053f6a8600b4912db28dac81c2463d6463,2022-09-24 19:30:31,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int X,Y,Z,sum;\n    scanf(\""%d,%d,%d\"",&X,&Y,&Z);\n    sum=X+Y-Z;\n    printf(\""sum is %d\\n\"",sum);\n    return 0;\n}",WRONG_ANSWER,4,200
1573635992341348352,6b2bd61c219ecb3a9d2511d91579d32a50d2c4b4006be123e5de270ccb4e0249,2022-09-24 19:30:31,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\n\n\nint area()\n{\n int X,Y,Z,F;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n0<=X,Y,Z<=100;\n    return X+Y-Z;\n\n}\n\n\n\nint main()\n{\n    int d;\n    d=area();\n    printf(\""%d\"",d);\n    return 0;\n}\n",ACCEPTED,9,344
1573636025866084352,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-09-24 19:30:39,Python,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"X,Y,Z=input('请输入三个整数:')\nX=int(X)\nY=int(Y)\nZ=int(Z)\ndef F(x):\n    X+Y-Z\nif 0<=X<=100 and 0<=Y<=100 and 0<=Z<=100:\n    F(x)\n    print(F(x))\n",NON_ZERO_EXIT_CODE,16,3036
1573636078442020864,c03ae905b4de4d41e5d9328da5270539e1a32e2d888b8dd41fb10f72c24a90ce,2022-09-24 19:30:52,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n int sz(int x,int y,int z)\n {\n     int a;\n     a=x+y-z;\n     return a;\n }\n \nint main()\n{\n    int x,y,z,b;\n    scanf(\""%d,%d,%d\"",&x,&y,&z);\n    \n    b=sz(x,y,z);\n    printf(\""%d\"",b);\n    return 0;\n}\n\n\n",WRONG_ANSWER,4,328
1573636110771376128,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-09-24 19:31:00,Python,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"X,Y,Z=input('请输入三个整数:')\nX=int('X')\nY=int('Y')\nZ=int('Z')\ndef F(x):\n    X+Y-Z\nif 0<=X<=100 and 0<=Y<=100 and 0<=Z<=100:\n    F(x)\n    print(F(x))\n",NON_ZERO_EXIT_CODE,17,2884
1573636159819567104,9bc75ed278d85c8f2c42a30c95c2a03c97fe7ea2854fa215da6f8c8557b90bb8,2022-09-24 19:31:11,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\nint area()\n{\n    int s,x,y,z;\n    scanf(\""%d%d%d\"",&x,&y,&z);\n    0<=x,y,z<=100;\n    return s=x+y-z;\n}\nint main()\n{\n  int f;\n    f=area();\n    printf(\""%d\"",f);\n    return 0;\n}",ACCEPTED,9,200
1573636233215692800,8c7d136eed2209a8278a3c3e192a5d053f6a8600b4912db28dac81c2463d6463,2022-09-24 19:31:29,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int X,Y,Z,sum;\n    scanf(\""%d,%d,%d\"",&X,&Y,&Z);\n    sum=X+Y-Z;\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,4,196
1573636507938750464,8c7d136eed2209a8278a3c3e192a5d053f6a8600b4912db28dac81c2463d6463,2022-09-24 19:32:34,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int X,Y,Z,sum;\n    scanf(\""%d,%d,%d\"",&X,&Y,&Z);\n    sum=X+Y-Z;\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,6,472
1573636509247033344,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-09-24 19:32:35,Python,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"X,Y,Z=input('请输入三个整数:')\nX=int('X')\nY=int('Y')\nZ=int('Z')\ndef F(x):\n    X+Y-Z\nif 0<=X<=100 and 0<=Y<=100 and 0<=Z<=100:\n    F(x)\n    print(F(x))\n",NON_ZERO_EXIT_CODE,17,2892
1573636594295275520,505c5b9a1b6d591a815315d95a57743fb98dad691b51421b4de282392fef3f43,2022-09-24 19:32:55,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int a,b,c,m;\n    scanf(\""%d %d %d\"",&a,&b,&c);\n    m=a+b-c;\n    printf(\""%d\"",m);\n    return 0;\n}\n",ACCEPTED,10,348
1573636652738371584,8c7d136eed2209a8278a3c3e192a5d053f6a8600b4912db28dac81c2463d6463,2022-09-24 19:33:09,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int X,Y,Z,sum;\n    scanf(\""%d,%d,%d,%d\"",&X,&Y,&Z,&sum);\n    sum=X+Y-Z;\n    printf(\""%d\"",sum);\n    return 0;\n}",WRONG_ANSWER,5,324
1573636831722242048,0d97f8676f8329cb267f0e470b71ae15a629f07e888f5155af8a19d5b7a400e4,2022-09-24 19:33:52,C++,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<bits/stdc++.h>\nusing namespace std;\n\nint main(void)\n{\n    int a,b,c;\n    cin >> a >> b>> c ;\n    cout << a+b-c << endl;\n    return 0;\n}",ACCEPTED,12,344
1573636991336480768,7310135b9c9422c45d35553cb166f3e6e49919961fe8ee45fea6e98e16951395,2022-09-24 19:34:30,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n   int X,Y,Z;\n   scanf(\""%d %d %d\"",&X,&Y,&Z);\n    printf(\""%d\\n\"",X+Y-Z);\n    return 0;\n}",ACCEPTED,12,200
1573637187705069568,8c7d136eed2209a8278a3c3e192a5d053f6a8600b4912db28dac81c2463d6463,2022-09-24 19:35:16,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int X,Y,Z,sum;\n    scanf(\""%d%d%d\"",&X,&Y,&Z);\n    sum=X+Y-Z;\n    printf(\""%d\"",sum);\n    return 0;\n}",ACCEPTED,11,472
1573637704715948033,c03ae905b4de4d41e5d9328da5270539e1a32e2d888b8dd41fb10f72c24a90ce,2022-09-24 19:37:20,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n int area()\n {\n     int F,X,Y,Z;\n     scanf(\""%d,%d,%d\""&X,&Y,&Z);\n     0<=X,Y,Z<=100;\n     return F=X+Y-Z;\n }\n \nint main()\n{\n    int a ;\n    a=area();\n    printf(\""%d\"",a)\n    \n    \n    \n    return 0;\n}\n",COMPILE_ERROR,0,0
1573637844847644672,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-09-24 19:37:53,Python,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"X,Y,Z=input('请输入三个整数X,Y,Z')\nX=int('X')\nY=int('Y')\nZ=int('Z')\ndef F(x):\n    X+Y-Z\nif 0<=X<=100 and 0<=Y<=100 and 0<=Z<=100:\n    F(x)\n    print(F(x))\n",NON_ZERO_EXIT_CODE,16,2756
1573637870474842112,c03ae905b4de4d41e5d9328da5270539e1a32e2d888b8dd41fb10f72c24a90ce,2022-09-24 19:37:59,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n int area()\n {\n     int F,X,Y,Z;\n     scanf(\""%d,%d,%d\""&X,&Y,&Z);\n     0<=X,Y,Z<=100;\n     return F=X+Y-Z;\n }\n \nint main()\n{\n    int a;\n    a=area();\n    printf(\""%d\"",a)\n    \n    \n    \n    return 0;\n}\n",COMPILE_ERROR,0,0
1573637927227969536,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-09-24 19:38:13,Python,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"X,Y,Z=input('请输入三个整数X,Y,Z')\nX=int('X')\nY=int('Y')\nZ=int('Z')\ndef F(x):\n    X+Y-Z\nif 0<=X<=100 and 0<=Y<=100 and 0<=Z<=100:\n    F(x)\nprint(F(x))\n",NON_ZERO_EXIT_CODE,17,2764
1573638253788094465,c03ae905b4de4d41e5d9328da5270539e1a32e2d888b8dd41fb10f72c24a90ce,2022-09-24 19:39:31,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n int area()\n {\n     int F,X,Y,Z;\n     scanf(\""%d,%d,%d\""&X,&Y,&Z);\n     0<=X,Y,Z<=100;\n     return F=X+Y-Z;\n }\n \nint main()\n{\n    int a;\n    a=area();\n    printf(\""%d\"",a);\n    return 0;\n}\n\n",COMPILE_ERROR,0,0
1573638937166381056,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-09-24 19:42:14,Python,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"def F(x):\n    X+Y-Z\nX,Y,Z=input('请输入三个整数X,Y,Z')\nX=int('X')\nY=int('Y')\nZ=int('Z')\nif 0<=X<=100 and 0<=Y<=100 and 0<=Z<=100:\n    F(x)\nprint(F(x))\n",NON_ZERO_EXIT_CODE,17,2908
1573639283384868864,c03ae905b4de4d41e5d9328da5270539e1a32e2d888b8dd41fb10f72c24a90ce,2022-09-24 19:43:36,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n int area()\n {\n     int F,X,Y,Z;\n     scanf(\""%d,%d,%d\""&X,&Y,&Z);\n     0<=X,Y,Z<=100;\n     return F=X+Y-Z;\n }\n \nint main()\n{\n    int a;\n    a=area();\n    printf(\""%d\"",a);\n    return 0;\n}\n\n",COMPILE_ERROR,0,0
1573639549194686464,c03ae905b4de4d41e5d9328da5270539e1a32e2d888b8dd41fb10f72c24a90ce,2022-09-24 19:44:39,C,0.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n int area()\n {\n     int F,X,Y,Z;\n     scanf(\""%d,%d,%d\""&X,&Y,&Z);\n     0<=X,Y,Z<=100;\n     return F=X+Y-Z;\n }\n \nint main()\n  {\n    int a;\n    a=area();\n    printf(\""%d\"",a);\n    return 0;\n}\n\n",COMPILE_ERROR,0,0
1573640131733520384,c03ae905b4de4d41e5d9328da5270539e1a32e2d888b8dd41fb10f72c24a90ce,2022-09-24 19:46:58,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\n#include <stdlib.h>\n int area()\n {\n     int F,X,Y,Z;\n     scanf(\""%d %d %d\"", &X,&Y,&Z);\n     return X+Y-Z;\n }\n \nint main()\n  {\n    int a;\n    a=area();\n    printf(\""%d\"",a);\n    return 0;\n}\n\n",ACCEPTED,8,324
1573640173689143296,63381d3e8adf72fdaaee518149e5ab696ca76f2ff29eb60f701a792e361b19f8,2022-09-24 19:47:08,Python,0.0,1573557741782495234,1572865591226855424,1049226928954454016,def F(x):\n    X+Y-Z\nX=input('请输入一个整数X')\nY=input('请输入一个整数Y')\nZ=input('请输入一个整数Z')\nX=int(X)\nY=int(Y)\nZ=int(Z)\nif 0<=X<=100 and 0<=Y<=100 and 0<=Z<=100:\n    F(x)\nprint(F(x))\n,NON_ZERO_EXIT_CODE,16,2884
1573648482940575744,39afbda4ab6a7df2673bc0d0eec048a42b23ada2774ec941935a2b2fa044515a,2022-09-24 20:20:09,C++,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n{\n    int x,y,z;\n    cin>>x>>y>>z;\n    cout<<x+y-z;\n    return 0;\n}\n",ACCEPTED,11,324
1573648648338755584,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-09-24 20:20:49,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x,y,z,t;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    t=x+y-z;\n    printf(\""%d\"",t);\n    return 0;\n}",ACCEPTED,8,328
1573648837602529280,27c80293cddab4128c5cd57596f9c4011c788f94dc1f14bed261d0bc4b0166a3,2022-09-24 20:21:34,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint main()\n{\n    int x,y,z,t;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d\"",x+y-z);\n    return 0;\n}",ACCEPTED,10,196
1573651838916452352,7256ff1c58d1afc85077ccccf0772ba7eddd8ce444a78a71c54fc7c16fd7f655,2022-09-24 20:33:30,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include <stdio.h>\nint main()\n{\n    int X,Y,Z;\n    scanf(\""%d %d %d\"",&X,&Y,&Z);\n    printf(\""%d\"",X+Y-Z);\n    return 0;\n}\n",ACCEPTED,9,356
1573656234664480768,27fbb32d960dbf49665c8905b68012d602eda68987686c6f224ec7b49ca3d0ac,2022-09-24 20:50:58,C,300.0,1573557741782495234,1572865591226855424,1049226928954454016,"#include<stdio.h>\nint f(int x,int y,int z)\n{\n    int s;\n    \ts=x+y-z;\n        return s;\n}\nint main()\n{\n    int x,y,z;\n    scanf(\""%d %d %d\"",&x,&y,&z);\n    printf(\""%d\"",f(x,y,z));\n    return 0;\n}",ACCEPTED,13,200
1590654127875624960,74da760154142d7227495b8398247522aa5f65f6438f7ea4a98fbcdfedd7505a,2022-11-10 18:34:31,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n\nint main()\n{\n\tint a,m,n,i,s=1;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\ta=a%n;\n\twhile(m!=0)\n\t{ \n\tif(m%2==1)\n\t{\n\t\ts=(s*a)%n;\n\t}\n\tm=m/2;\n\ta=(a*a)%n;\n}\n\tprintf(\""%d\"",s);\n\treturn 0;\n}",WRONG_ANSWER,21,604
1590654256380706816,74da760154142d7227495b8398247522aa5f65f6438f7ea4a98fbcdfedd7505a,2022-11-10 18:35:02,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n\nint main()\n{\n\tint a,m,n,i,s=1;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\ta=a%n;\n\twhile(m!=0)\n\t{ \n\tif(m%2==1)\n\t{\n\t\ts=(s*a)%n;\n\t}\n\tm=m/2;\n\ta=(a*a)%n;\n}\n\tprintf(\""%d\"",s);\n\treturn 0;\n}",WRONG_ANSWER,19,476
1590673223694462976,761df0ab1b71664976bd02cf76a78c5a0ecd146be5fae1f21cd30babdf2495df,2022-11-10 19:50:24,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\nint main()\n{\n\tint a,m,n,i=1,r,t=1;\n\tscanf(\""%d %d %d\"",&a,&m,&n);\n\twhile(i<=m)\n\t{\n\t\tr=a%n;\n\t\tt=t*r%n;\n\t\ti++;\n\t}\n\tprintf(\""%d\"",t);\n\treturn 0;\n}",WRONG_ANSWER,18,504
1590679733128466432,85fa7e9a6db120367f61844cd947451ebba9dc2a68430717893078084c9028d3,2022-11-10 20:16:16,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include<stdio.h>\n\nint main()\n{\n\tint a,m,n,i,o;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tif(a*n<2e30)\n\t{\n\t\tfor(i=1;i<=m-1;i++)\n\t\t{\n\t\t\ta=a*a;\n\t\t\tif(i==m-1)\n\t\t\t{\n\t\t\t\to=a%n;\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\""%d\"",o);\n}",WRONG_ANSWER,20,368
1590686635006668800,85fa7e9a6db120367f61844cd947451ebba9dc2a68430717893078084c9028d3,2022-11-10 20:43:41,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include<stdio.h>\n\nint main()\n{\n\tint a,m,n,i,o,p,q,r,s,t,u,v,w,x;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tu=a;\n\tif(a*n<=2e30)\n\t{\n\t\ti=m/5;\n\t\to=m%5;\n\t\tfor(p=1;p<=4;p++)\n\t\t{\n\t\t\ta=a*a;\n\t\t\tif(p==4)\n\t\t\t{\n\t\t\t\tq=a;\n\t\t\t}\n\t\t}\n\t\tr=q%n;\n\t\ta=u;\n\t\tfor(s=1;s<o;s++)\n\t\t{\n\t\t\ta=a*a;\n\t\t\tif(s==o-1)\n\t\t\t{\n\t\t\t\tt=a;\n\t\t\t}\n\t\t}\n\t\tv=t%n;\n\t\tfor(w=1;w<i;w++)\n\t\t{\n\t\t\tr=r*r;\n\t\t\tif(w==i-1)\n\t\t\t{\n\t\t\t\tx=(r*v)%n;\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\""%d\"",x);\n\t\n}",WRONG_ANSWER,18,484
1590695618203422720,0927101c92e55cf52b9387ae18d9e2ee6c0334eaa01de69df3aa11344c9e8582,2022-11-10 21:19:23,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include<stdio.h>\nint main()\n{\n\tint a,m,n,A;\n    scanf(\""%d%d%d\"",&a,&m,&n);\n    A=1;\n\tif(a*n<=2^30)\n    {\n        while(m>0)\n        {\n           A=A*a;\n           m=m-1;\n        }\n    }\n    printf(\""%d\"",A%n);\n\treturn 0;\n}",WRONG_ANSWER,17,452
1590697396688957440,0927101c92e55cf52b9387ae18d9e2ee6c0334eaa01de69df3aa11344c9e8582,2022-11-10 21:26:27,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include<stdio.h>\nint main()\n{\n\tint a,m,n;\n    scanf(\""%d%d%d\"",&a,&m,&n);\n    long A=1;\n\tif(a*n<=2^30)\n    {\n        while(m>0)\n        {\n           A=A*a;\n           m=m-1;\n        }\n    }\n    printf(\""%ld\"",A%n);\n\treturn 0;\n}",WRONG_ANSWER,17,512
1590700585836417024,0927101c92e55cf52b9387ae18d9e2ee6c0334eaa01de69df3aa11344c9e8582,2022-11-10 21:39:08,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include<stdio.h>\nint main()\n{\n\tint a,m,n;\n    scanf(\""%d%d%d\"",&a,&m,&n);\n    long long A=1;\n\tif(a*n<=2^30)\n    {\n        while(m>0)\n        {\n           A=A*a;\n           m=m-1;\n        }\n    }\n    printf(\""%lld\"",A%n);\n\treturn 0;\n}",WRONG_ANSWER,20,344
1590702121723428864,cfaa1748b4ab66f19b9d7d13d82ca11e8c3a7a29da4dfbe42b274fde9dc3d14a,2022-11-10 21:45:14,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\tint a,m,n,k,x,y,h,result;\n\tk = 0;\n\tx = 0;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\ty = pow(2,30);\n\tif(a * n <= y)\n\t\tx = 1;\n\tif(x = 1)\n\t{\n\t\tfor(h = 1;h < m;h++)\n\t\t{\n\t\t\ta *= a;\n\t\t}\n\t\tresult = a % n;\n\t\tprintf(\""%d\\n\"",result);\n\n\t}\n\treturn 0;\n}",WRONG_ANSWER,16,348
1590703519085146112,fbf513a793a12c653738d69b058b6ba77aa5d05a796a1749cc1c43f9e5f7bf07,2022-11-10 21:50:47,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n\nint main()\n{\n\tint a, m, n, r = 1, i;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tfor(i = 1; i <= m; i++)\n\t{\n\t\tr = r * a;\n\t\tr = r % n;\n\t}\n\tprintf(\""%d\"",r);\n\treturn 0;\n}",WRONG_ANSWER,18,336
1590705803252797440,cfaa1748b4ab66f19b9d7d13d82ca11e8c3a7a29da4dfbe42b274fde9dc3d14a,2022-11-10 21:59:52,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\tint a,m,n,x,y,result;\n\tx = 0;\n\tresult = 1;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\ty = pow(2,30);\n\tif(a * n <= y)\n\t\tx = 1;\n\tif(x = 1)\n\t{\n\t\ta = a % n;\n\t\twhile(m > 0)\n\t\t{\n\t\t\tif(m % 2 == 1)\n\t\t\t\tresult = (result * a) % n;\n\t\t\tm = m / 2;\n\t\t\ta = (a * a) % n;\n\t\t}\n\t\tprintf(\""%d\\n\"",result);\n\t}\n\treturn 0;\n}",WRONG_ANSWER,16,360
1590712168998285312,bf20ad149c57bb307f1a5f6d6b0060f0ac1f8351bfea72e53dc4a877cac43f94,2022-11-10 22:25:09,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n\nint main()\n{\n\tint a, m, n, result = 1;\n\tscanf(\""%d%d%d\"", &a, &m, &n);\n\tfor (int i = 1; i <= m; i++)\n\t{\n\t\tresult *= a;\n\t\tresult %= n;\n\t}\n\tprintf(\""%d\"", result);\n\treturn 0;\n}\n",WRONG_ANSWER,21,488
1590713340551303168,718658015420dd95822e7646d73c73184ffe37e0e84a3056efd9c329f8a06ca3,2022-11-10 22:29:49,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n#include <math.h>\nint main ()\n{\n    long n;\n    long m, a;\n    int k;\n\n    do\n    {printf(\""please input three 正整数\\n\"");\n\n     scanf(\""%d %d %d\"",&a,&m,&n);\n\n    }while(a*n>pow(2,30));\n\n     k = (int)pow(a,m)%n;\n\n     printf(\""%d\"",k);\n\n\n}\n",TIME_LIMIT_EXCEEDED,2000,14604
1590719101054554112,92edf3f6b21b0f493f14933351f246cdd104116c908942b280c18d3f87550032,2022-11-10 22:52:42,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n#include<math.h>\nint main()\n{\n    int a,m,n,b,c;\n    b=(int)pow(2,30);\n    scanf(\""%d%d%d\"",&a,&m,&n);\n    if(a*n>b)\n    return 0;\n    a=a%n;\n    c=(int)pow(a,m) % n;\n    printf(\""%d\"",c);\n    return 0;\n}",WRONG_ANSWER,17,456
1590722392039665664,8464a365d7ec6e0b1c7ed08bfe62365fa57782e2cee78c4f532b322ab5db1edd,2022-11-10 23:05:47,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint a,m,n,i,b,c;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tb=m%(n-1);\n\tfor(i=1;i<=b;i++)\n\ta=(a%n)*(a%n);\n\ta=sqrt(a);\n\tprintf(\""%d\"",a); \n\treturn 0;\n} ",WRONG_ANSWER,21,476
1590723668521582592,986a161615e13c54a0d7f5dd7e3c675f352c2943c85002debf59cce2b31a4b4a,2022-11-10 23:10:51,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint a,m,n,i,A;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tA=a;\n\tif(a*n>pow(2,30))\n\t{\n\t\tprintf(\""错误的数据\"");\n\t\treturn 0;\n\t}\n\tfor(i=1; i<=m; i++)\n\t{\n\t\ta=a%n;\n\t\tif(i!=m)\n\t\t\ta=a*A;\n\t}\n\tprintf(\""%d\"",a);\n\treturn 0;\n}",WRONG_ANSWER,17,512
1590725885035089920,578ca821d89a0187d19aea75df92bd2ddab4b4d8d9d6c952a98ba08707d75d1c,2022-11-10 23:19:39,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include<stdio.h>\n\nint main()\n{\n\tint a,m,n,w,z,i;\n\tscanf(\""%d\""\""%d\""\""%d\"",&a,&m,&n);\n\tz=a;\n\tfor(w=1;w<m;w++)\n\t{\n\t\tz=a*z;\n\t}\n\ti=z%n;\n\tprintf(\""%d\"",i);\n\treturn 0;\n}\n",WRONG_ANSWER,14,348
1590733422690107392,583f741a39208ca14b2331e832021fc2efe92035be14ccaa24e27088955ff174,2022-11-10 23:49:37,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include<stdio.h>\nint main()\n{\n\tint a,m,n;\n    int i,t,z;\n    scanf(\""%d%d%d\"",&a,&m,&n);\n    t=a%n;\n    z=((a%n)*(a%n))%n;\n    for(i=1;i<=m-2;i++)\n    {\n    \tz=((z%n)*(a%n))%n;\n\t}\n\tprintf(\""%d\"",z);\n    return 0;\n}",WRONG_ANSWER,18,492
1590847544756867072,0927101c92e55cf52b9387ae18d9e2ee6c0334eaa01de69df3aa11344c9e8582,2022-11-11 07:23:05,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include<stdio.h>\nint main()\n{\n\tint a,m,n,m1,cs;\n    int mi=0;\n    int res=1;\n    scanf(\""%d%d%d\"",&a,&m,&n);\n    if(a*n<=2^30)\n    {\n        while(m>0)\n        {\n            m1=m%2;\n            m=m/2;\n            cs=2^mi;\n            while(m1>0&&cs>0)\n            {   \n                res=((a%n)*res)%n;\n                cs=cs-1;\n                \n            }\n            mi=mi+1;\n        }\n    }\n    printf(\""%d\"",res);\n\treturn 0;\n}",WRONG_ANSWER,16,360
1590872804361310208,d38bc15c540fef85844035e88bcd6769d28e3c5edb5d1cc365f1a769b0a25478,2022-11-11 09:03:28,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\tunsigned int a,m,n,p;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tif(a*n<=2e30)\n\t\ta=a^m;\n\t\tp=a%n;\n\t\tprintf(\""%d\"",p);\n\telse\n\t\tprintf(\""您还是再输一个吧\"");\n\treturn 0;\t\t\n}\n\n\n",COMPILE_ERROR,0,0
1590873255144132608,d38bc15c540fef85844035e88bcd6769d28e3c5edb5d1cc365f1a769b0a25478,2022-11-11 09:05:15,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\tunsigned int a,m,n,p;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tif(a*n<=2e30)\n    {\n\t\ta=a^m;\n\t\tp=a%n;\n\t\tprintf(\""%d\"",p);\n    }\n\telse\n\t\tprintf(\""您还是再输一个吧\"");\n\treturn 0;\t\t\n}\n\n\n",WRONG_ANSWER,20,472
1590875096519086080,85fa7e9a6db120367f61844cd947451ebba9dc2a68430717893078084c9028d3,2022-11-11 09:12:34,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n\nint main()\n{\n    long long a,m,n,i=1;\n    scanf(\""%lld%lld%lld\"",&a,&m,&n);\n    while(m>0)\n    {\n    \tif(m%2==1)\n    \t{\n    \t\ti=(i*a)%n;\n\t\t}\n\t\ta=(a*a)%n;\n\t\tm=m/2;\n\t}\n\tprintf(\""%lld\"",i); \n}\n",WRONG_ANSWER,17,640
1590924289510019072,383bc3f07b14c2072b33e0cb0614fb7c4e7da778cdf43a1725bd07282c5f54cf,2022-11-11 12:28:03,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include<stdio.h> \n\nint main()\n{\n\tint a,m,n,b,z;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tz=a;\n\tfor(b=0;b<m-1;b++)\n\t{\n\t\ta=a*z;\n\t\tif(a>n)\n\t\t    a=a%n;\n\t}\n\tprintf(\""%d\"",a);\n\treturn 0;\n}",WRONG_ANSWER,19,512
1590924337413140480,8464a365d7ec6e0b1c7ed08bfe62365fa57782e2cee78c4f532b322ab5db1edd,2022-11-11 12:28:14,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include<stdio.h>\nint main()\n{\n\tint a,m,n,i,j;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\ti=a;\n\tfor(j=1;j<=m-1;j++)\n\ta=(i*a)%n;\n\tprintf(\""%d\"",a);\n\treturn 0;\n} ",WRONG_ANSWER,17,372
1590945671358779392,fbf513a793a12c653738d69b058b6ba77aa5d05a796a1749cc1c43f9e5f7bf07,2022-11-11 13:53:01,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n\nint main()\n{\n\tint a, m, n, r = 1, i;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tfor(i = 1; i <= m; i++)\n\t{\n\t\tr = r * a;\n\t\tr = r % n;\n\t}\n\tprintf(\""%d\"",r);\n\treturn 0;\n}",WRONG_ANSWER,16,348
1590979409186697216,0927101c92e55cf52b9387ae18d9e2ee6c0334eaa01de69df3aa11344c9e8582,2022-11-11 16:07:04,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include<stdio.h>\nint main()\n{\n\tint a,m,n;\n    scanf(\""%d%d%d\"",&a,&m,&n);\n    int res=a%n;\n    if(a*n<=2^30)\n    {\n        while(m>1)\n        {\n            \n            res=((a%n)*res)%n;\n            m=m-1;\n                \n            \n        }\n    }\n    printf(\""%d\"",res);\n\treturn 0;\n}",WRONG_ANSWER,15,344
1590980818665799680,0927101c92e55cf52b9387ae18d9e2ee6c0334eaa01de69df3aa11344c9e8582,2022-11-11 16:12:40,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include<stdio.h>\nint main()\n{\n\tint a,m,n;\n    scanf(\""%d%d%d\"",&a,&m,&n);\n    int res=a%n;\n    if(a*n<=2^30)\n    {\n        while(m>1)\n        {\n            \n            res=((a%n)*res)%n;\n            m=m-1;\n                \n            \n        }\n    }\n    printf(\""%d 1\"",res);\n\treturn 0;\n}",PARTIAL_ACCEPTED,18,436
1590984006731083776,74da760154142d7227495b8398247522aa5f65f6438f7ea4a98fbcdfedd7505a,2022-11-11 16:25:20,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n\nint main()\n{\n\tint a,m,n,i=0,s=1;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\ta=a%n;\n\twhile(m!=0)\n\t{\n\t\tif(m%2==1)\n\t\t{\n\t\t\ts=(s*a)%n;\n\t\t}\n\t\tm=m/2;\n\t\ta=(a*a)%n;\n\t\ti++;\n\t}\n\tprintf(\""%d %d\"",s,i);\n\treturn 0;\n}",WRONG_ANSWER,15,352
1590984257546289152,74da760154142d7227495b8398247522aa5f65f6438f7ea4a98fbcdfedd7505a,2022-11-11 16:26:20,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n\nint main()\n{\n\tint a,m,n,i=0,s=1;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\ta=a%n;\n\twhile(m!=0)\n\t{\n\t\tif(m%2==1)\n\t\t{\n\t\t\ts=(s*a)%n;\n\t\t}\n\t\tm=m/2;\n\t\ta=(a*a)%n;\n\t\ti++;\n\t}\n\tprintf(\""%d 1\"",s);\n\treturn 0;\n}",PARTIAL_ACCEPTED,15,356
1590984803111993344,fbf513a793a12c653738d69b058b6ba77aa5d05a796a1749cc1c43f9e5f7bf07,2022-11-11 16:28:30,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n\nint main()\n{\n\tint a, m, n, r = 1, i;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tfor(i = 1; i <= m; i++)\n\t{\n\t\tr = r * a;\n\t\tr = r % n;\n\t}\n\tprintf(\""%d 1\"",r);\n\treturn 0;\n}",PARTIAL_ACCEPTED,17,356
1590991470432137216,fbf513a793a12c653738d69b058b6ba77aa5d05a796a1749cc1c43f9e5f7bf07,2022-11-11 16:55:00,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n\nint main()\n{\n\tint ex(int);\n\tint a, m, n, r = 1, i, j = 1, x = 1, p = 1;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tfor(i = 1; i <= m; i++)\n\t{\n\t\tr = r * a;\n\t\tr = r % n;\n\t}\n\tprintf(\""%d\"",r);\n\twhile(x * 2 <= m)\n\t{\n\t\tx *= 2;\n\t\tj ++;\n\t}\n\tm = m - ex(j);\n\tfor(i = j - 1; i >= 0; i--)\n\t{\n\t\tif(m <ex(i))\n\t\t\tcontinue;\n\t\telse\n\t\t\tp++;\n\t}\n\tprintf(\"" %d\"",p);\n\treturn 0;\n}\n\nint ex(int x)\n{\n\tint i, y = 1;\n\tfor(i = 1; i <= x; i++)\n\t{\n\t\ty *= 2;\n\t}\n\treturn y;\n}",PARTIAL_ACCEPTED,17,348
1591000239362867200,fbf513a793a12c653738d69b058b6ba77aa5d05a796a1749cc1c43f9e5f7bf07,2022-11-11 17:29:51,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n\nint main()\n{\n\tint a, m, n, r = 1, i;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tfor(i = 1; i <= m; i++)\n\t{\n\t\tr = r * a;\n\t\tr = r % n;\n\t}\n\tprintf(\""%d 0\"",r);\n\treturn 0;\n}",WRONG_ANSWER,16,464
1591002850698792960,cfaa1748b4ab66f19b9d7d13d82ca11e8c3a7a29da4dfbe42b274fde9dc3d14a,2022-11-11 17:40:13,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\tint a,m,n,x,y,result;\n\tx = 0;\n\tresult = 1;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\ty = pow(2,30);\n\tif(a * n <= y)\n\t\tx = 1;\n\tif(x = 1)\n\t{\n\t\ta = a % n;\n\t\twhile(m > 0)\n\t\t{\n\t\t\tif(m % 2 == 1)\n\t\t\t\tresult = (result * a) % n;\n\t\t\tm = m / 2;\n\t\t\ta = (a * a) % n;\n\t\t}\n\t\tprintf(\""%d %d\\n\"",result,m + 1);\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,15,472
1591005714112360448,cfaa1748b4ab66f19b9d7d13d82ca11e8c3a7a29da4dfbe42b274fde9dc3d14a,2022-11-11 17:51:36,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\tint a,m,n,x,y,result;\n\tx = 0;\n\tresult = 1;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\ty = pow(2,30);\n\tif(a * n <= y)\n\t\tx = 1;\n\tif(x == 1)\n\t{\n\t\ta = a % n;\n\t\twhile(m > 0)\n\t\t{\n\t\t\tif(m % 2 == 1)\n\t\t\t\tresult = (result * a) % n;\n\t\t\tm = m / 2;\n\t\t\ta = (a * a) % n;\n\t\t}\n\t\tprintf(\""%d %d\\n\"",result,m + 1);\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,13,320
1591012319449124864,fbf513a793a12c653738d69b058b6ba77aa5d05a796a1749cc1c43f9e5f7bf07,2022-11-11 18:17:51,C,2.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n\nint main()\n{\n\tint ex(int);\n\tint a, m, n, r = 1, i = 0, p = 0, q = 1, j, b, c;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\twhile(q * 2 <= m)\n\t{\n\t\tq *= 2;\n\t\ti++;\n\t}\n\tfor(j = 1; j <= i;i--)\n\t{\n\t\tif(ex(i) <= m)\n\t\t{\n\t\t\tb = a;\n\t\t\tm -= ex(i);\n\t\t\tp++;\n\t\t}\n\t\telse\n\t\t\tb = 1;\n\t\tc = b * r;\n\t\tr = c % n;\n\t\tr *= r;\n\t\tr = r % n;\n\t}\n\tif(m == 0)\n\t\ta = 1;\n\tr =(r * a)% n;\n\tprintf(\""%d %d\"",r, p);\n\treturn 0;\n}\n\nint ex(int x)\n{\n\tint m = 1, i;\n\tfor(i = 1; i <= x; i++)\n\t{\n\t\tm *= 2;\n\t}\n\treturn m;\n}",PARTIAL_ACCEPTED,17,324
1591012797733994496,fbf513a793a12c653738d69b058b6ba77aa5d05a796a1749cc1c43f9e5f7bf07,2022-11-11 18:19:45,C,2.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n\nint main()\n{\n\tint ex(int);\n\tint a, m, n, r = 1, i = 0, p = 0, q = 1, j, b, c;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\twhile(q * 2 <= m)\n\t{\n\t\tq *= 2;\n\t\ti++;\n\t}\n\tfor(j = 1; j <= i;i--)\n\t{\n\t\tif(ex(i) <= m)\n\t\t{\n\t\t\tb = a;\n\t\t\tm -= ex(i);\n\t\t\tp++;\n\t\t}\n\t\telse\n\t\t\tb = 1;\n\t\tc = b * r;\n\t\tr = c % n;\n\t\tr *= r;\n\t\tr = r % n;\n\t}\n\tif(m == 0)\n\t\ta = 1;\n\tr =(r * a)% n;\n\tprintf(\""%d 2\"",r);\n\treturn 0;\n}\n\nint ex(int x)\n{\n\tint m = 1, i;\n\tfor(i = 1; i <= x; i++)\n\t{\n\t\tm *= 2;\n\t}\n\treturn m;\n}",PARTIAL_ACCEPTED,15,472
1591012826385264640,fbf513a793a12c653738d69b058b6ba77aa5d05a796a1749cc1c43f9e5f7bf07,2022-11-11 18:19:52,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n\nint main()\n{\n\tint ex(int);\n\tint a, m, n, r = 1, i = 0, p = 0, q = 1, j, b, c;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\twhile(q * 2 <= m)\n\t{\n\t\tq *= 2;\n\t\ti++;\n\t}\n\tfor(j = 1; j <= i;i--)\n\t{\n\t\tif(ex(i) <= m)\n\t\t{\n\t\t\tb = a;\n\t\t\tm -= ex(i);\n\t\t\tp++;\n\t\t}\n\t\telse\n\t\t\tb = 1;\n\t\tc = b * r;\n\t\tr = c % n;\n\t\tr *= r;\n\t\tr = r % n;\n\t}\n\tif(m == 0)\n\t\ta = 1;\n\tr =(r * a)% n;\n\tprintf(\""%d 3\"",r);\n\treturn 0;\n}\n\nint ex(int x)\n{\n\tint m = 1, i;\n\tfor(i = 1; i <= x; i++)\n\t{\n\t\tm *= 2;\n\t}\n\treturn m;\n}",WRONG_ANSWER,16,320
1591012884203765760,fbf513a793a12c653738d69b058b6ba77aa5d05a796a1749cc1c43f9e5f7bf07,2022-11-11 18:20:05,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n\nint main()\n{\n\tint ex(int);\n\tint a, m, n, r = 1, i = 0, p = 0, q = 1, j, b, c;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\twhile(q * 2 <= m)\n\t{\n\t\tq *= 2;\n\t\ti++;\n\t}\n\tfor(j = 1; j <= i;i--)\n\t{\n\t\tif(ex(i) <= m)\n\t\t{\n\t\t\tb = a;\n\t\t\tm -= ex(i);\n\t\t\tp++;\n\t\t}\n\t\telse\n\t\t\tb = 1;\n\t\tc = b * r;\n\t\tr = c % n;\n\t\tr *= r;\n\t\tr = r % n;\n\t}\n\tif(m == 0)\n\t\ta = 1;\n\tr =(r * a)% n;\n\tprintf(\""%d %d\"",r，p);\n\treturn 0;\n}\n\nint ex(int x)\n{\n\tint m = 1, i;\n\tfor(i = 1; i <= x; i++)\n\t{\n\t\tm *= 2;\n\t}\n\treturn m;\n}",COMPILE_ERROR,0,0
1591012961416708096,fbf513a793a12c653738d69b058b6ba77aa5d05a796a1749cc1c43f9e5f7bf07,2022-11-11 18:20:24,C,2.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n\nint main()\n{\n\tint ex(int);\n\tint a, m, n, r = 1, i = 0, p = 0, q = 1, j, b, c;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\twhile(q * 2 <= m)\n\t{\n\t\tq *= 2;\n\t\ti++;\n\t}\n\tfor(j = 1; j <= i;i--)\n\t{\n\t\tif(ex(i) <= m)\n\t\t{\n\t\t\tb = a;\n\t\t\tm -= ex(i);\n\t\t\tp++;\n\t\t}\n\t\telse\n\t\t\tb = 1;\n\t\tc = b * r;\n\t\tr = c % n;\n\t\tr *= r;\n\t\tr = r % n;\n\t}\n\tif(m == 0)\n\t\ta = 1;\n\tr =(r * a)% n;\n\tprintf(\""%d %d\"",r,p);\n\treturn 0;\n}\n\nint ex(int x)\n{\n\tint m = 1, i;\n\tfor(i = 1; i <= x; i++)\n\t{\n\t\tm *= 2;\n\t}\n\treturn m;\n}",PARTIAL_ACCEPTED,16,368
1591020009680338944,cfaa1748b4ab66f19b9d7d13d82ca11e8c3a7a29da4dfbe42b274fde9dc3d14a,2022-11-11 18:48:24,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\tint a,m,n,x,y,result;\n\tx = 0;\n\tresult = 1;\n\tif(scanf(\""%d%d%d\"",&a,&m,&n)) \n\t{\n\t\ty = pow(2,30);\n\t\tif(a * n <= y)\n\t\t\tx = 1;\n\t\tif(x == 1)\n\t\t{\n\t\t\ta = a % n;\n\t\t\twhile(m > 0)\n\t\t\t{\n\t\t\t\tif(m % 2 == 1)\n\t\t\t\t\tresult = (result * a) % n;\n\t\t\t\tm = m / 2;\n\t\t\t\ta = (a * a) % n;\n\t\t\t}\n\t\t\tprintf(\""%d %d\\n\"",result,1);\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,18,344
1591020290090532864,cfaa1748b4ab66f19b9d7d13d82ca11e8c3a7a29da4dfbe42b274fde9dc3d14a,2022-11-11 18:49:31,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\tint a,m,n,x,y,result;\n\tx = 0;\n\tresult = 1;\n\tif(scanf(\""%d%d%d\"",&a,&m,&n)) \n\t{\n\t\ty = pow(2,30);\n\t\tif(a * n <= y)\n\t\t\tx = 1;\n\t\tif(x == 1)\n\t\t{\n\t\t\ta = a % n;\n\t\t\twhile(m > 0)\n\t\t\t{\n\t\t\t\tif(m % 2 == 1)\n\t\t\t\t\tresult = (result * a) % n;\n\t\t\t\tm = m / 2;\n\t\t\t\ta = (a * a) % n;\n\t\t\t}\n\t\t\tprintf(\""%d %d\\n\"",result,m + 1);\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,15,348
1591020679422611456,cfaa1748b4ab66f19b9d7d13d82ca11e8c3a7a29da4dfbe42b274fde9dc3d14a,2022-11-11 18:51:04,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\tint a,m,n,x,y,result;\n\tx = 0;\n\tresult = 1;\n\tif(scanf(\""%d%d%d\"",&a,&m,&n)) \n\t{\n\t\ty = pow(2,30);\n\t\tif(a * n <= y)\n\t\t\tx = 1;\n\t\tif(x == 1)\n\t\t{\n\t\t\ta = a % n;\n\t\t\twhile(m > 0)\n\t\t\t{\n\t\t\t\tif(m % 2 == 1)\n\t\t\t\t\tresult = (result * a) % n;\n\t\t\t\tm = m / 2;\n\t\t\t\ta = (a * a) % n;\n\t\t\t}\n\t\t\tprintf(\""%d %d\\n\"",result,m + 1);\n\t\t}\n    else \n        printf(\""0\"");\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,20,336
1591022545946611712,cfaa1748b4ab66f19b9d7d13d82ca11e8c3a7a29da4dfbe42b274fde9dc3d14a,2022-11-11 18:58:29,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\tint a,m,n,x,y,result,i;\n\tx = 0;\n\tresult = 1;\n\tif(scanf(\""%d%d%d\"",&a,&m,&n)) \n\t{\n\t\ty = pow(2,30);\n\t\tif(a * n <= y)\n\t\t\tx = 1;\n\t\tif(x == 1)\n\t\t{\n\t\t\ta = a % n;\n\t\t\tfor(i = 1;i <= m;i++)\n                result = (result * a) % n;\n            result %= n;\n\t\t\tprintf(\""%d %d\\n\"",result,1);\n\t\t}\n    else \n        printf(\""0\"");\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,17,472
1591029808388157440,fbf513a793a12c653738d69b058b6ba77aa5d05a796a1749cc1c43f9e5f7bf07,2022-11-11 19:27:20,C,2.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n\nint main()\n{\n\tint ex(int);\n\tint a, m, n, r = 1, i = 0, p = 0, q = 1, j, b, c;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\twhile(q * 2 <= m)\n\t{\n\t\tq *= 2;\n\t\ti++;\n\t}\n\tfor(j = 1; j <= i;i--)\n\t{\n\t\tif(ex(i) <= m)\n\t\t{\n\t\t\tb = a;\n\t\t\tm -= ex(i);\n\t\t\tp++;\n\t\t}\n\t\telse\n\t\t\tb = 1;\n\t\tc = b * r;\n\t\tr = c % n;\n\t\tr *= r;\n\t\tr = r % n;\n\t}\n\tif(m == 0)\n\t\ta = 1;\n\tr =(r * a)% n;\n\tprintf(\""%d %d\"",r, p);\n\treturn 0;\n}\n\nint ex(int x)\n{\n\tint m = 1, i;\n\tfor(i = 1; i <= x; i++)\n\t{\n\t\tm *= 2;\n\t}\n\treturn m;\n}",PARTIAL_ACCEPTED,17,384
1591039405349994496,cfaa1748b4ab66f19b9d7d13d82ca11e8c3a7a29da4dfbe42b274fde9dc3d14a,2022-11-11 20:05:28,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\tint a,m,n,x,y,result,i;\n\ti = 0;\n\tx = 0;\n\tresult = 1;\n\tif(scanf(\""%d%d%d\"",&a,&m,&n)) \n\t{\n\t\ty = pow(2,30);\n\t\tif(a * n <= y)\n\t\t\tx = 1;\n\t\tif(x == 1)\n\t\t{\n\t\t\ta = a % n;\n\t\t\twhile(m > 0)\n\t\t\t{\n\t\t\t\tif(m % 2 == 1)\n\t\t\t\t{\t\n\t\t\t\t    result = (result * a) % n;\n\t\t\t\t    i++;\n\t\t\t    }\n\t\t\t\tm = m / 2;\n\t\t\t\ta = (a * a) % n;\n\t\t\t}\n\t\t\tprintf(\""%d %d\\n\"",result,i);\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,15,340
1591040806419501056,cfaa1748b4ab66f19b9d7d13d82ca11e8c3a7a29da4dfbe42b274fde9dc3d14a,2022-11-11 20:11:03,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\tint a,m,n,x,y,result,i;\n\ti = 0;\n\tx = 0;\n\tresult = 1;\n\tif(scanf(\""%d%d%d\"",&a,&m,&n)) \n\t{\n\t\ty = pow(2,30);\n\t\tif(a * n <= y)\n\t\t\tx = 1;\n\t\tif(x == 1)\n\t\t{\n\t\t\ta = a % n;\n\t\t\twhile(m > 0)\n\t\t\t{\n\t\t\t\tif(m % 2 == 1)\n\t\t\t\t{\t\n\t\t\t\t    result = (result * a) % n;\n\t\t\t\t    i++;\n\t\t\t    }\n\t\t\t\tm = m / 2;\n\t\t\t\ta = (a * a) % n;\n\t\t\t}\n\t\t\tprintf(\""%d %d\\n\"",result,i);\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,16,352
1591041226579685376,fbf513a793a12c653738d69b058b6ba77aa5d05a796a1749cc1c43f9e5f7bf07,2022-11-11 20:12:43,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n\nint main()\n{\n\tint ex(int),pr(int);\n\tint a, m, n, r = 1, i = 0, p = 0, q = 1, j, b, c;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tif(pr(n) == 1 && m > n)\n\t\tm = m % (n - 1);\n\twhile(q * 2 <= m)\n\t{\n\t\tq *= 2;\n\t\ti++;\n\t}\n\tfor(j = 1; j <= i;i--)\n\t{\n\t\tif(ex(i) <= m)\n\t\t{\n\t\t\tb = a;\n\t\t\tm -= ex(i);\n\t\t\tp++;\n\t\t}\n\t\telse\n\t\t\tb = 1;\n\t\tc = b * r;\n\t\tr = c % n;\n\t\tr *= r;\n\t\tr = r % n;\n\t}\n\tif(m == 0)\n\t\ta = 1;\n\tr =(r * a)% n;\n\tprintf(\""%d %d\"",r, p);\n\treturn 0;\n}\n\nint ex(int x)\n{\n\tint m = 1, i;\n\tfor(i = 1; i <= x; i++)\n\t{\n\t\tm *= 2;\n\t}\n\treturn m;\n}\n\nint pr(int x)\n{\n\tint i;\n\tfor(i = 1;i < x;i++)\n\t{\n\t\tif(x % i == 0)\n\t\t\tbreak;\n\t\telse\n\t\t\tcontinue;\n\t}\n\tif(i = x)\n\t\treturn 1;\n\telse\n\t\treturn 0;\n}",PARTIAL_ACCEPTED,18,468
1591041452212293632,fbf513a793a12c653738d69b058b6ba77aa5d05a796a1749cc1c43f9e5f7bf07,2022-11-11 20:13:36,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n\nint main()\n{\n\tint ex(int),pr(int);\n\tint a, m, n, r = 1, i = 0, p = 0, q = 1, j, b, c;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tif(pr(n) == 1 && m > n)\n\t\tm = m % (n - 1);\n\twhile(q * 2 <= m)\n\t{\n\t\tq *= 2;\n\t\ti++;\n\t}\n\tfor(j = 1; j <= i;i--)\n\t{\n\t\tif(ex(i) <= m)\n\t\t{\n\t\t\tb = a;\n\t\t\tm -= ex(i);\n\t\t\tp++;\n\t\t}\n\t\telse\n\t\t\tb = 1;\n\t\tc = b * r;\n\t\tr = c % n;\n\t\tr *= r;\n\t\tr = r % n;\n\t}\n\tif(m == 0)\n\t\ta = 1;\n\tr =(r * a)% n;\n\tprintf(\""%d %d\"",r, p);\n\treturn 0;\n}\n\nint ex(int x)\n{\n\tint m = 1, i;\n\tfor(i = 1; i <= x; i++)\n\t{\n\t\tm *= 2;\n\t}\n\treturn m;\n}\n\nint pr(int x)\n{\n\tint i;\n\tfor(i = 1;i < x;i++)\n\t{\n\t\tif(x % i == 0)\n\t\t\tbreak;\n\t\telse\n\t\t\tcontinue;\n\t}\n\tif(i = x)\n\t\treturn 1;\n\telse\n\t\treturn 0;\n}",PARTIAL_ACCEPTED,11,344
1591044041700061184,fbf513a793a12c653738d69b058b6ba77aa5d05a796a1749cc1c43f9e5f7bf07,2022-11-11 20:23:54,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n\nint main()\n{\n\tint ex(int),pr(int);\n\tint a, m, n, r = 1, i = 0, p = 0, q = 1, j, b, c;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tif(pr(n) && m > n)\n\t\tm = m % (n - 1);\n\twhile(q * 2 <= m)\n\t{\n\t\tq *= 2;\n\t\ti++;\n\t}\n\tfor(i; i != 0; i--)\n\t{\n\t\tif(ex(i) <= m)\n\t\t{\n\t\t\tb = a;\n\t\t\tm -= ex(i);\n\t\t\tp++;\n\t\t}\n\t\telse\n\t\t\tb = 1;\n\t\tc = b * r;\n\t\tr = c % n;\n\t\tr *= r;\n\t\tr = r % n;\n\t}\n\tif(m == 0)\n\t\ta = 1;\n\tr =(r * a)% n;\n\tprintf(\""%d %d\"",r, p);\n\treturn 0;\n}\n\nint ex(int x)\n{\n\tint m = 1, i;\n\tfor(i = 1; i <= x; i++)\n\t{\n\t\tm *= 2;\n\t}\n\treturn m;\n}\n\nint pr(int x)\n{\n\tint i;\n\tfor(i = 2;i < x;i++)\n\t{\n\t\tif(x % i == 0)\n\t\t\tbreak;\n\t\telse\n\t\t\tcontinue;\n\t}\n\tif(i == x)\n\t\treturn 1;\n\telse\n\t\treturn 0;\n}",PARTIAL_ACCEPTED,19,640
1591045757556273152,fbf513a793a12c653738d69b058b6ba77aa5d05a796a1749cc1c43f9e5f7bf07,2022-11-11 20:30:43,C,10.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n\nint main()\n{\n\tint ex(int),pr(int);\n\tint a, m, n, r = 1, i = 0, p = 0, q = 1, j, b, c;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tif(pr(n) && m > n)\n\t\tm = m % (n - 1);\n\twhile(q * 2 <= m)\n\t{\n\t\tq *= 2;\n\t\ti++;\n\t}\n\tfor(i; i >= 0; i--)\n\t{\n\t\tif(ex(i) <= m)\n\t\t{\n\t\t\tb = a;\n\t\t\tm -= ex(i);\n\t\t\tp++;\n\t\t}\n\t\telse\n\t\t\tb = 1;\n\t\tc = b * r;\n\t\tr = c % n;\n\t\tif(i != 0)\n\t\t{\n\t\tr *= r;\n\t\tr = r % n;\n\t\t}\n\t}\n\tif(m == 0)\n\t\ta = 1;\n\tr =(r * a)% n;\n\tprintf(\""%d %d\"",r, p);\n\treturn 0;\n}\n\nint ex(int x)\n{\n\tint m = 1, i;\n\tfor(i = 1; i <= x; i++)\n\t{\n\t\tm *= 2;\n\t}\n\treturn m;\n}\n\nint pr(int x)\n{\n\tint i;\n\tfor(i = 2;i < x;i++)\n\t{\n\t\tif(x % i == 0)\n\t\t\tbreak;\n\t\telse\n\t\t\tcontinue;\n\t}\n\tif(i == x)\n\t\treturn 1;\n\telse\n\t\treturn 0;\n}",ACCEPTED,15,356
1591045938515349504,cfaa1748b4ab66f19b9d7d13d82ca11e8c3a7a29da4dfbe42b274fde9dc3d14a,2022-11-11 20:31:26,C,4.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\tint a,m,n,x,y,result,i,t,z,k;\n\ti = 0;\n\tx = 0;\n\tresult = 1;\n\tz = 0;\n\tk = 0;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\ty = pow(2,30);\n\tif(a * n <= y)\n\t\tx = 1;\n\tfor(t = 2; t < n; t++)\n\t{\n\t\tif(n % t == 0)\n\t\t\tz = 1;\n\t}\n\tif(z == 1)\n\t{\n\t\tif(a > n&&a % n == 0||a <= n&&n % a ==0)\n\t\t\tk = 1;\n\t}\n\tif(x == 1)\n\t{\n\t\tif(k == 1)\n\t\t\tm %= n-1;\n\t\ta = a % n;\n\t\twhile(m > 0)\n\t\t{\n\t\t\tif(m % 2 == 1)\n\t\t\t{\n\t\t\t\tresult = (result * a) % n;\n\t\t\t\tn++;\n\t\t\t}\n\t\t\tm = m / 2;\n\t\t\ta = (a * a) % n;\n\t\t}\n\t\tprintf(\""%d %d\\n\"",result,1);\n\t}\n    return 0;\n}",PARTIAL_ACCEPTED,20,476
1591046048297058304,cfaa1748b4ab66f19b9d7d13d82ca11e8c3a7a29da4dfbe42b274fde9dc3d14a,2022-11-11 20:31:52,C,4.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\tint a,m,n,x,y,result,i,t,z,k;\n\ti = 0;\n\tx = 0;\n\tresult = 1;\n\tz = 0;\n\tk = 0;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\ty = pow(2,30);\n\tif(a * n <= y)\n\t\tx = 1;\n\tfor(t = 2; t < n; t++)\n\t{\n\t\tif(n % t == 0)\n\t\t\tz = 1;\n\t}\n\tif(z == 1)\n\t{\n\t\tif(a > n&&a % n == 0||a <= n&&n % a ==0)\n\t\t\tk = 1;\n\t}\n\tif(x == 1)\n\t{\n\t\tif(k == 1)\n\t\t\tm %= n-1;\n\t\ta = a % n;\n\t\twhile(m > 0)\n\t\t{\n\t\t\tif(m % 2 == 1)\n\t\t\t{\n\t\t\t\tresult = (result * a) % n;\n\t\t\t\tn++;\n\t\t\t}\n\t\t\tm = m / 2;\n\t\t\ta = (a * a) % n;\n\t\t}\n\t\tprintf(\""%d %d\\n\"",result,1);\n\t}\n    return 0;\n}",PARTIAL_ACCEPTED,18,488
1591047066544050176,4fc076650e7b65efde3d8fb9e508c46a057a8d8dd9fc1ebd35528744cdc06fe5,2022-11-11 20:35:55,C,8.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n#define lol long long\n\nlol gcd(lol a,lol b)\n{\n\treturn b?gcd(b,a%b):a;\n}\nlol isprime(lol val)\n{\n\tlol i;\n\tif(val==0||val==1) return 0;\n\tif(val==2) return 1;\n\tfor(i=2; i*i<=val; ++i)\n\t{\n\t\tif(val%i==0) return 0;\n\t}\n\treturn 1;\n}\nlol counter;\nlol KSM(lol a,lol b,lol n)\n{\n\tlol result=1;\n\tlol tmp=a%n;\n\tcounter = 0;\n\twhile(b)\n\t{\n\t\tif(b&1)\n\t\t{\n\t\t\tresult=result*tmp%n;\n\t\t\t++counter;\n\t\t}\n\t\ttmp=tmp*tmp%n;\n\t\tb>>=1;\n\t}\n\treturn result%n;\n}\nint main()\n{\n\tlol a,m,n;\n\tscanf(\""%lld%lld%lld\"",&a,&m,&n);\n\tif(isprime(n) && gcd(a,n)==1 ) m%=n-1;\n\tlol answer=KSM(a,m,n);\n\tprintf(\""%lld %lld\\n\"",answer,counter);\n\treturn 0;\n}",PARTIAL_ACCEPTED,16,620
1591048102444859392,cfaa1748b4ab66f19b9d7d13d82ca11e8c3a7a29da4dfbe42b274fde9dc3d14a,2022-11-11 20:40:02,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\tint a,m,n,x,y,result,i,t,z,k;\n\ti = 0;\n\tx = 0;\n\tresult = 1;\n\tz = 0;\n\tk = 0;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\ty = pow(2,30);\n\tif(a * n <= y)\n\t\tx = 1;\n\tfor(t = 2; t < n; t++)\n\t{\n\t\tif(n % t == 0)\n\t\t\tz = 1;\n\t}\n\tif(z == 1)\n\t{\n\t\tif(a > n&&a % n == 0||a <= n&&n % a ==0)\n\t\t\tk = 1;\n\t}\n\tif(x == 1)\n\t{\n\t\tif(k == 0)\n\t\t\tm %= n-1;\n\t\ta = a % n;\n\t\twhile(m > 0)\n\t\t{\n\t\t\tif(m % 2 == 1)\n\t\t\t{\n\t\t\t\tresult = (result * a) % n;\n\t\t\t\tn++;\n\t\t\t}\n\t\t\tm = m / 2;\n\t\t\ta = (a * a) % n;\n\t\t}\n\t\tprintf(\""%d %d\\n\"",result,1);\n\t}\n    return 0;\n}",PARTIAL_ACCEPTED,17,368
1591048125144412160,cfaa1748b4ab66f19b9d7d13d82ca11e8c3a7a29da4dfbe42b274fde9dc3d14a,2022-11-11 20:40:07,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\tint a,m,n,x,y,result,i,t,z,k;\n\ti = 0;\n\tx = 0;\n\tresult = 1;\n\tz = 0;\n\tk = 0;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\ty = pow(2,30);\n\tif(a * n <= y)\n\t\tx = 1;\n\tfor(t = 2; t < n; t++)\n\t{\n\t\tif(n % t == 0)\n\t\t\tz = 1;\n\t}\n\tif(z == 1)\n\t{\n\t\tif(a > n&&a % n == 0||a <= n&&n % a ==0)\n\t\t\tk = 1;\n\t}\n\tif(x == 1)\n\t{\n\t\tif(k == 0)\n\t\t\tm %= n-1;\n\t\ta = a % n;\n\t\twhile(m > 0)\n\t\t{\n\t\t\tif(m % 2 == 1)\n\t\t\t{\n\t\t\t\tresult = (result * a) % n;\n\t\t\t\tn++;\n\t\t\t}\n\t\t\tm = m / 2;\n\t\t\ta = (a * a) % n;\n\t\t}\n\t\tprintf(\""%d %d\\n\"",result,1);\n\t}\n    return 0;\n}",PARTIAL_ACCEPTED,18,340
1591048613990563840,74da760154142d7227495b8398247522aa5f65f6438f7ea4a98fbcdfedd7505a,2022-11-11 20:42:04,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n\nint main()\n{\n\tint a,m,n,i=1,s=1,b,c,t;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tif(a>n)\n\t{\n\t\tb=a;\n\t\tc=n;\n\t}\n\telse\n\t{\n\t\tb=n;\n\t\tc=m;\n\t}\n\tdo\n\t{\n\t\tt=b%c;\n\t\tb=c;\n\t\tc=t;\n\t}\n\twhile(t!=0);\n\t{\n\t\tm=m%(n-1);\n\t}\n\ta=a%n;\n\twhile(m!=1)\n\t{\n\t\tif(m%2==1)\n\t\t{\n\t\t\ts=(s*a)%n;\n\t\t\tm=m-1;\n\t\t\ti++;\n\t\t}\n\t\twhile(m%2==0)\n\t\t{\n\t\t\tm=m/2;\n\t\t\ta=(a*a)%n;\n\t\t}\n\t}\n\ts=(s*a)%n;\n\tprintf(\""%d %d\"",s,i);\n\treturn 0;\n}",PARTIAL_ACCEPTED,413,340
1591049027477635072,cfaa1748b4ab66f19b9d7d13d82ca11e8c3a7a29da4dfbe42b274fde9dc3d14a,2022-11-11 20:43:43,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\tint a,m,n,x,y,result,i,t,z,k;\n\ti = 0;\n\tx = 0;\n\tresult = 1;\n\tz = 0;\n\tk = 0;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\ty = pow(2,30);\n\tif(a * n <= y)\n\t\tx = 1;\n\tfor(t = 2; t < n; t++)\n\t{\n\t\tif(n % t == 0)\n\t\t\tz = 1;\n\t}\n\tif(z == 1)\n\t{\n\t\tif(a > n&&a % n == 0||a <= n&&n % a ==0)\n\t\t\tk = 1;\n\t}\n\tif(x == 1)\n\t{\n\t\tif(k == 0)\n\t\t\tm %= n-1;\n\t\ta = a % n;\n\t\twhile(m > 0)\n\t\t{\n\t\t\tif(m % 2 == 1)\n\t\t\t{\n\t\t\t\tresult = (result * a) % n;\n\t\t\t\ti++;\n\t\t\t}\n\t\t\tm = m / 2;\n\t\t\ta = (a * a) % n;\n\t\t}\n\t\tprintf(\""%d %d\\n\"",result,i);\n\t}\n    return 0;\n}",PARTIAL_ACCEPTED,16,364
1591050226369101824,74da760154142d7227495b8398247522aa5f65f6438f7ea4a98fbcdfedd7505a,2022-11-11 20:48:28,C,8.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n\nint main()\n{\n\tint a,m,n,i=1,s=1,b,c,t;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tif(a>n)\n\t{\n\t\tb=a;\n\t\tc=n;\n\t}\n\telse\n\t{\n\t\tb=n;\n\t\tc=m;\n\t}\n\tdo\n\t{\n\t\tt=b%c;\n\t\tb=c;\n\t\tc=t;\n\t}\n\twhile(t!=0);\n\t{\n\t\tm=m%(n-1);\n\t}\n\ta=a%n;\n\twhile(m!=1&&m!=0)\n\t{\n\t\tif(m%2==1)\n\t\t{\n\t\t\ts=(s*a)%n;\n\t\t\tm=m-1;\n\t\t\ti++;\n\t\t}\n\t\twhile(m%2==0)\n\t\t{\n\t\t\tm=m/2;\n\t\t\ta=(a*a)%n;\n\t\t}\n\t}\n\tif(m==1)\n\t\ts=(s*a)%n;\n\telse\n\t\ts=1;\n\tprintf(\""%d %d\"",s,i);\n\treturn 0;\n}",PARTIAL_ACCEPTED,15,320
1591050498222915584,cfaa1748b4ab66f19b9d7d13d82ca11e8c3a7a29da4dfbe42b274fde9dc3d14a,2022-11-11 20:49:33,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\tint a,m,n,x,y,result,i,t,z,k;\n\ti = 0;\n\tx = 0;\n\tresult = 1;\n\tz = 0;\n\tk = 0;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\ty = pow(2,30);\n\tif(a * n <= y)\n\t\tx = 1;\n\tfor(t = 2; t < n; t++)\n\t{\n\t\tif(n % t == 0)\n\t\t\tz = 1;\n\t}\n\tif(z == 1)\n\t{\n\t\tif(a > n&&a % n == 0||a <= n&&n % a ==0)\n\t\t\tk = 1;\n\t}\n\tif(x == 1)\n\t{\n\t\tif(k == 0&&m >= 0)\n\t\t\tm %= n-1;\n\t\ta = a % n;\n\t\twhile(m > 0)\n\t\t{\n\t\t\tif(m % 2 == 1)\n\t\t\t{\n\t\t\t\tresult = (result * a) % n;\n\t\t\t\ti++;\n\t\t\t}\n\t\t\tm = m / 2;\n\t\t\ta = (a * a) % n;\n\t\t}\n\t\tprintf(\""%d %d\\n\"",result,i);\n\t}\n    return 0;\n}",PARTIAL_ACCEPTED,20,364
1591050802351898624,cfaa1748b4ab66f19b9d7d13d82ca11e8c3a7a29da4dfbe42b274fde9dc3d14a,2022-11-11 20:50:46,C,8.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\tint a,m,n,x,y,result,i,t,z,k;\n\ti = 0;\n\tx = 0;\n\tresult = 1;\n\tz = 0;\n\tk = 0;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\ty = pow(2,30);\n\tif(a * n <= y)\n\t\tx = 1;\n\tfor(t = 2; t < n; t++)\n\t{\n\t\tif(n % t == 0)\n\t\t\tz = 1;\n\t}\n\tif(z == 1)\n\t{\n\t\tif(a > n&&a % n == 0||a <= n&&n % a ==0)\n\t\t\tk = 1;\n\t}\n\tif(x == 1)\n\t{\n\t\tif(k == 0&&m >= n)\n\t\t\tm %= n-1;\n\t\ta = a % n;\n\t\twhile(m > 0)\n\t\t{\n\t\t\tif(m % 2 == 1)\n\t\t\t{\n\t\t\t\tresult = (result * a) % n;\n\t\t\t\ti++;\n\t\t\t}\n\t\t\tm = m / 2;\n\t\t\ta = (a * a) % n;\n\t\t}\n\t\tprintf(\""%d %d\\n\"",result,i);\n\t}\n    return 0;\n}",PARTIAL_ACCEPTED,15,464
1591050821142360064,74da760154142d7227495b8398247522aa5f65f6438f7ea4a98fbcdfedd7505a,2022-11-11 20:50:50,C,8.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n\nint main()\n{\n\tint a,m,n,i=1,s=1,b,c,t;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tif(a>n)\n\t{\n\t\tb=a;\n\t\tc=n;\n\t}\n\telse\n\t{\n\t\tb=n;\n\t\tc=m;\n\t}\n\tdo\n\t{\n\t\tt=b%c;\n\t\tb=c;\n\t\tc=t;\n\t}\n\twhile(t!=0);\n\tif(b==1)\n\t{\n\t\tm=m%(n-1);\n\t}\n\ta=a%n;\n\twhile(m!=1&&m!=0)\n\t{\n\t\tif(m%2==1)\n\t\t{\n\t\t\ts=(s*a)%n;\n\t\t\tm=m-1;\n\t\t\ti++;\n\t\t}\n\t\twhile(m%2==0)\n\t\t{\n\t\t\tm=m/2;\n\t\t\ta=(a*a)%n;\n\t\t}\n\t}\n\tif(m==1)\n\t\ts=(s*a)%n;\n\telse\n\t\ts=1;\n\tprintf(\""%d %d\"",s,i);\n\treturn 0;\n}",PARTIAL_ACCEPTED,16,348
1591052510121472000,74da760154142d7227495b8398247522aa5f65f6438f7ea4a98fbcdfedd7505a,2022-11-11 20:57:33,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n\nint main()\n{\nint main()\n{\n\tint a,m,n,i=1,s=1,b,c,t;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\ta=a%n;\n\tif(a>n)\n\t{\n\t\tb=a;\n\t\tc=n;\n\t}\n\telse\n\t{\n\t\tb=n;\n\t\tc=m;\n\t}\n\tdo\n\t{\n\t\tt=b%c;\n\t\tb=c;\n\t\tc=t;\n\t}\n\twhile(t!=0);\n\tif(b==1)\n\t{\n\t\tm=m%(n-1);\n\t}\n\twhile(m!=1&&m!=0)\n\t{\n\t\tif(m%2==1)\n\t\t{\n\t\t\ts=(s*a)%n;\n\t\t\tm=m-1;\n\t\t\ti++;\n\t\t}\n\t\twhile(m%2==0)\n\t\t{\n\t\t\tm=m/2;\n\t\t\ta=(a*a)%n;\n\t\t}\n\t}\n\tif(m==1)\n\t\ts=(s*a)%n;\n\tprintf(\""%d %d\"",s,i);\n\treturn 0;\n}",COMPILE_ERROR,0,0
1591052564949434368,74da760154142d7227495b8398247522aa5f65f6438f7ea4a98fbcdfedd7505a,2022-11-11 20:57:46,C,10.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n\nint main()\n{\n\tint a,m,n,i=1,s=1,b,c,t;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\ta=a%n;\n\tif(a>n)\n\t{\n\t\tb=a;\n\t\tc=n;\n\t}\n\telse\n\t{\n\t\tb=n;\n\t\tc=m;\n\t}\n\tdo\n\t{\n\t\tt=b%c;\n\t\tb=c;\n\t\tc=t;\n\t}\n\twhile(t!=0);\n\tif(b==1)\n\t{\n\t\tm=m%(n-1);\n\t}\n\twhile(m!=1&&m!=0)\n\t{\n\t\tif(m%2==1)\n\t\t{\n\t\t\ts=(s*a)%n;\n\t\t\tm=m-1;\n\t\t\ti++;\n\t\t}\n\t\twhile(m%2==0)\n\t\t{\n\t\t\tm=m/2;\n\t\t\ta=(a*a)%n;\n\t\t}\n\t}\n\tif(m==1)\n\t\ts=(s*a)%n;\n\tprintf(\""%d %d\"",s,i);\n\treturn 0;\n}",ACCEPTED,15,348
1591053204291366912,cfaa1748b4ab66f19b9d7d13d82ca11e8c3a7a29da4dfbe42b274fde9dc3d14a,2022-11-11 21:00:18,C,8.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\tint a,m,n,x,y,result,i,t,z,k;\n\ti = 0;\n\tx = 0;\n\tresult = 1;\n\tz = 0;\n\tk = 0;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\ty = pow(2,30);\n\tif(a * n <= y)\n\t\tx = 1;\n\tfor(t = 2; t < n; t++)\n\t{\n\t\tif(n % t == 0)\n\t\t\tz = 1;\n\t}\n\tif(z == 0)\n\t{\n\t\tif(a > n&&a % n == 0||a <= n&&n % a ==0)\n\t\t\tk = 1;\n\t}\n\tif(x == 1)\n\t{\n\t\tif(k == 0&&m >= n)\n\t\t\tm %= n-1;\n\t\ta = a % n;\n\t\twhile(m > 0)\n\t\t{\n\t\t\tif(m % 2 == 1)\n\t\t\t{\n\t\t\t\tresult = (result * a) % n;\n\t\t\t\ti++;\n\t\t\t}\n\t\t\tm = m / 2;\n\t\t\ta = (a * a) % n;\n\t\t}\n\t\tprintf(\""%d %d\\n\"",result,i);\n\t}\n    return 0;\n}",PARTIAL_ACCEPTED,19,312
1591053631326060544,986a161615e13c54a0d7f5dd7e3c675f352c2943c85002debf59cce2b31a4b4a,2022-11-11 21:02:00,C,4.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint a,m,n,A,N,M,x=1,y,i,j=0,t=0,result=1;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tA=a;\n\tN=n;\n\tif(a*n>pow(2,30))\n\t{\n\t\tprintf(\""不能处理的数据\"");\n\t\treturn 0;\n\t}\n\twhile(A>0)\n\t{\n\t\tt=N%A;\n\t\tN=A;\n\t\tA=t;\n\t\tif(N==1)\n\t\t{\n\t\t\tM=m%(n-1);\n\t\t\tbreak;\n\t\t}\n\t}\n\tfor(i=1; i<=M; i++)\n\t{\n\t\tresult=result*a;\n\t}\n\tresult=result%n;\n\tfor(i=1; ; i++)\n\t{\n\t\tif(m==0)\n\t\t{\n\t\t\tbreak;\n\t\t}\n\t\ty=m%2;\n\t\tif(y==1)\n\t\t{\n\t\t\tj++;\n\t\t}\n\t\tM=M+x*y;\n\t\tx=x*10;\n\t\tm=m/2;\n\t}\n\tprintf(\""%d %d\"",result,j);\n\treturn 0;\n}",PARTIAL_ACCEPTED,19,480
1591057686878294016,cfaa1748b4ab66f19b9d7d13d82ca11e8c3a7a29da4dfbe42b274fde9dc3d14a,2022-11-11 21:18:07,C,8.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\tint a,m,n,x,y,result,i,t,z,k;\n\ti = 0;\n\tx = 0;\n\tresult = 1;\n\tz = 0;\n\tk = 0;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\ty = pow(2,30);\n\tif(a * n <= y)\n\t\tx = 1;\n\tfor(t = 2; t < n; t++)\n\t{\n\t\tif(n % t == 0)\n\t\t\tz = 1;\n\t}\n\tif(z == 0)\n\t{\n\t\tif(a > n&&a % n == 0||a <= n&&n % a ==0)\n\t\t\tk = 1;\n\t}\n\tif(x == 1)\n\t{\n\t\tif(k == 0&&m >= n)\n\t\t\tm %= n-1;\n\t\ta = a % n;\n\t\twhile(m > 0)\n\t\t{\n\t\t\tif(m % 2 == 1)\n\t\t\t{\n\t\t\t\tresult = (result * a) % n;\n\t\t\t\ti++;\n\t\t\t}\n\t\t\tm = m / 2;\n\t\t\ta = (a * a) % n;\n\t\t}\n\t\tprintf(\""%d %d\\n\"",result,i);\n\t}\n    return 0;\n}",PARTIAL_ACCEPTED,17,372
1591059908034887680,986a161615e13c54a0d7f5dd7e3c675f352c2943c85002debf59cce2b31a4b4a,2022-11-11 21:26:57,C,2.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint a,m,n,A,N,M,h,x=1,y,i,j=0,t=0,result=1;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tA=a;\n\tN=n;\n\tif(a*n>pow(2,30))\n\t{\n\t\tprintf(\""不能处理的数据\"");\n\t\treturn 0;\n\t}\n\twhile(A>0)\n\t{\n\t\tt=N%A;\n\t\tN=A;\n\t\tA=t;\n\t\tif(N==1)\n\t\t{\n\t\t\tM=m%(n-1);\n\t\t\tbreak;\n\t\t}\n\t}\n\tresult=pow(a,M);\n\tresult=result%n;\n\tfor(i=1; ; i++)\n\t{\n\t\th=pow(2,i);\n\t\ty=m%2;\n\t\tif(y==1&&h%(n-1)==0)\n\t\t{\n\t\t\tj++;\n\t\t}\n\t\tM=M+x*y;\n\t\tx=x*10;\n\t\tm=m/2;\n\t\tif(m==0)\n\t\t{\n\t\t\tbreak;\n\t\t}\n\t}\n\tprintf(\""%d %d\"",result,j);\n\treturn 0;\n}",PARTIAL_ACCEPTED,16,628
1591071534809153536,cfaa1748b4ab66f19b9d7d13d82ca11e8c3a7a29da4dfbe42b274fde9dc3d14a,2022-11-11 22:13:09,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\tint a,m,n,x,y,result,i,t,z,k,c,d,e;\n\ti = 0;\n\tx = 0;\n\tresult = 1;\n\tz = 0;\n\tk = 0;\n    d = 0;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\ty = pow(2,30);\n\tif(a * n <= y)\n\t\tx = 1;\n\tfor(t = 2; t < n; t++)\n\t{\n\t\tif(n % t == 0)\n\t\t\tz = 1;\n\t}\n\tif(z == 0)\n\t{\n\t\tif(a > n&&a % n == 0||a <= n&&n % a ==0)\n\t\t\tk = 1;\n\t}\n\tif(x == 1)\n\t{\n\t\tif(k == 0&&m >= n)\n        {    \n\t\t\tm %= n-1;\n            c = m;\n        }\n\t\ta = a % n;\n\t\twhile(m > 0)\n\t\t{\n\t\t\tif(m % 2 == 1)\n\t\t\t\tresult = (result * a) % n;\n\t\t\tm = m / 2;\n\t\t\ta = (a * a) % n;\n\t\t}\n        \n        while (1)\n      {\n        d = c % 2;\n        c /= 2;\n        if (d == 1)\n        {\n            i += 1;\n        }\n        if (c < 2)\n        {\n           i += 1;\n            break;\n        }\n    }\n            \n         \n            \n        \n        \n        }\n\t\tprintf(\""%d %d\\n\"",result,i);\n\t}\n    return 0;\n}",COMPILE_ERROR,0,0
1591072933617926144,cfaa1748b4ab66f19b9d7d13d82ca11e8c3a7a29da4dfbe42b274fde9dc3d14a,2022-11-11 22:18:42,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\tint a,m,n,x,y,result,i,t,z,k,c,d,e;\n\ti = 0;\n\tx = 0;\n\tresult = 1;\n\tz = 0;\n\tk = 0;\n\td = 0;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\ty = pow(2,30);\n\tif(a * n <= y)\n\t\tx = 1;\n\tfor(t = 2; t < n; t++)\n\t{\n\t\tif(n % t == 0)\n\t\t\tz = 1;\n\t}\n\tif(z == 0)\n\t{\n\t\tif(a > n&&a % n == 0||a <= n&&n % a ==0)\n\t\t\tk = 1;\n\t}\n\tif(x == 1)\n\t{\n\t\tif(k == 0&&m >= n)\n\t\t{\n\t\t\tm %= n-1;\n\t\t\tc = m;\n\t\t}\n\t\ta = a % n;\n\t\twhile(m > 0)\n\t\t{\n\t\t\tif(m % 2 == 1)\n\t\t\t\tresult = (result * a) % n;\n\t\t\tm = m / 2;\n\t\t\ta = (a * a) % n;\n\t\t}\n\n\t\twhile (1)\n\t\t{\n\t\t\td = c % 2;\n\t\t\tc /= 2;\n\t\t\tif (d == 1)\n\t\t\t{\n\t\t\t\ti += 1;\n\t\t\t}\n\t\t\tif (c < 2)\n\t\t\t{\n\t\t\t\ti += 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tprintf(\""%d %d\\n\"",result,i);\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,15,196
1591073530521915392,cfaa1748b4ab66f19b9d7d13d82ca11e8c3a7a29da4dfbe42b274fde9dc3d14a,2022-11-11 22:21:05,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\tint a,m,n,x,y,result,i,t,z,k,c,d,e;\n\ti = 0;\n\tx = 0;\n\tresult = 1;\n\tz = 0;\n\tk = 0;\n\td = 0;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\ty = pow(2,30);\n\tif(a * n <= y)\n\t\tx = 1;\n\tfor(t = 2; t < n; t++)\n\t{\n\t\tif(n % t == 0)\n\t\t\tz = 1;\n\t}\n\tif(z == 0)\n\t{\n\t\tif(a > n&&a % n == 0||a <= n&&n % a ==0)\n\t\t\tk = 1;\n\t}\n\tif(x == 1)\n\t{\n\t\tif(k == 0&&m >= n)\n\t\t{\n\t\t\tm %= n-1;\n\t\t\tc = m;\n\t\t}\n\t\ta = a % n;\n\t\twhile(m > 0)\n\t\t{\n\t\t\tif(m % 2 == 1)\n\t\t\t\tresult = (result * a) % n;\n\t\t\tm = m / 2;\n\t\t\ta = (a * a) % n;\n\t\t}\n\n\t\twhile (1)\n\t\t{\n\t\t\td = c % 2;\n\t\t\tc /= 2;\n\t\t\tif (d == 1)\n\t\t\t{\n\t\t\t\ti += 1;\n\t\t\t}\n\t\t\tif (c < 2)\n\t\t\t{\n\t\t\t\ti += 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tprintf(\""%d %d\\n\"",result,i);\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,20,324
1591074869926760448,cfaa1748b4ab66f19b9d7d13d82ca11e8c3a7a29da4dfbe42b274fde9dc3d14a,2022-11-11 22:26:24,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\tint a,m,n,x,y,result,i,t,z,k,c,d;\n\ti = 0;\n\tx = 0;\n\tresult = 1;\n\tz = 0;\n\tk = 0;\n\td = 0;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\ty = pow(2,30);\n\tif(a * n <= y)\n\t\tx = 1;\n\tfor(t = 2; t < n; t++)\n\t{\n\t\tif(n % t == 0)\n\t\t\tz = 1;\n\t}\n\tif(z == 0)\n\t{\n\t\tif((a > n&&a % n == 0)||(a <= n&&n % a ==0))\n\t\t\tk = 1;\n\t}\n\tif(x == 1)\n\t{\n\t\tif(k == 0&&m >= n)\n\t\t{\n\t\t\tm %= n-1;\n\t\t\tc = m;\n\t\t}\n\t\ta = a % n;\n\t\twhile(m > 0)\n\t\t{\n\t\t\tif(m % 2 == 1)\n\t\t\t\tresult = (result * a) % n;\n\t\t\tm = m / 2;\n\t\t\ta = (a * a) % n;\n\t\t}\n\n\t\twhile (1)\n\t\t{\n\t\t\td = c % 2;\n\t\t\tc /= 2;\n\t\t\tif (d == 1)\n\t\t\t{\n\t\t\t\ti += 1;\n\t\t\t}\n\t\t\tif (c < 2)\n\t\t\t{\n\t\t\t\ti += 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tprintf(\""%d %d\\n\"",result,i);\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,18,324
1591074882572587008,cfaa1748b4ab66f19b9d7d13d82ca11e8c3a7a29da4dfbe42b274fde9dc3d14a,2022-11-11 22:26:27,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\tint a,m,n,x,y,result,i,t,z,k,c,d;\n\ti = 0;\n\tx = 0;\n\tresult = 1;\n\tz = 0;\n\tk = 0;\n\td = 0;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\ty = pow(2,30);\n\tif(a * n <= y)\n\t\tx = 1;\n\tfor(t = 2; t < n; t++)\n\t{\n\t\tif(n % t == 0)\n\t\t\tz = 1;\n\t}\n\tif(z == 0)\n\t{\n\t\tif((a > n&&a % n == 0)||(a <= n&&n % a ==0))\n\t\t\tk = 1;\n\t}\n\tif(x == 1)\n\t{\n\t\tif(k == 0&&m >= n)\n\t\t{\n\t\t\tm %= n-1;\n\t\t\tc = m;\n\t\t}\n\t\ta = a % n;\n\t\twhile(m > 0)\n\t\t{\n\t\t\tif(m % 2 == 1)\n\t\t\t\tresult = (result * a) % n;\n\t\t\tm = m / 2;\n\t\t\ta = (a * a) % n;\n\t\t}\n\n\t\twhile (1)\n\t\t{\n\t\t\td = c % 2;\n\t\t\tc /= 2;\n\t\t\tif (d == 1)\n\t\t\t{\n\t\t\t\ti += 1;\n\t\t\t}\n\t\t\tif (c < 2)\n\t\t\t{\n\t\t\t\ti += 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tprintf(\""%d %d\\n\"",result,i);\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,19,336
1591080229873954816,0927101c92e55cf52b9387ae18d9e2ee6c0334eaa01de69df3aa11344c9e8582,2022-11-11 22:47:42,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include<stdio.h>\nint main()\n{\n\tint a,m,n，m1,res1;\n    scanf(\""%d%d%d\"",&a,&m,&n);\n    int res=a%n;\n    m1=m;\n    if(a*n<=2^30)\n    {\n        while(m>1)\n        {\n            \n            res=((a%n)*res)%n;\n            m=m-1;\n        }\n        while(m1>0)\n        {\n            res1=res1+m1%2;\n            m1=m1/2;\n        }\n    }\n    printf(\""%d %d\"",res,res1);\n\treturn 0;\n}",COMPILE_ERROR,0,0
1591080673060913152,0927101c92e55cf52b9387ae18d9e2ee6c0334eaa01de69df3aa11344c9e8582,2022-11-11 22:49:27,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include<stdio.h>\nint main()\n{\n\tint a,m,n,m1,res1;\n    scanf(\""%d%d%d\"",&a,&m,&n);\n    int res=a%n;\n    m1=m;\n    if(a*n<=2^30)\n    {\n        while(m>1)\n        {\n            \n            res=((a%n)*res)%n;\n            m=m-1;\n        }\n        while(m1>0)\n        {\n            res1=res1+m1%2;\n            m1=m1/2;\n        }\n    }\n    printf(\""%d %d\"",res,res1);\n\treturn 0;\n}",PARTIAL_ACCEPTED,14,356
1591081299060764672,0927101c92e55cf52b9387ae18d9e2ee6c0334eaa01de69df3aa11344c9e8582,2022-11-11 22:51:57,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include<stdio.h>\nint main()\n{\n\tint a,m,n,m1,res1;\n    scanf(\""%d%d%d\"",&a,&m,&n);\n    int res=a%n;\n    res1=0;\n    m1=m;\n    if(a*n<=2^30)\n    {\n        while(m>1)\n        {\n            \n            res=((a%n)*res)%n;\n            m=m-1;\n        }\n        while(m1>0)\n        {\n            res1=res1+m1%2;\n            m1=m1/2;\n        }\n    }\n    printf(\""%d %d\"",res,res1);\n\treturn 0;\n}",PARTIAL_ACCEPTED,20,312
1591083589515673600,986a161615e13c54a0d7f5dd7e3c675f352c2943c85002debf59cce2b31a4b4a,2022-11-11 23:01:03,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint a,m,n,A,N,M,h1,h2,h3,i=1,j,t=0,result=1;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tA=a;\n\tN=n;\n\tif(a*n>pow(2,30))\n\t{\n\t\tprintf(\""不能处理的数据\"");\n\t\treturn 6;\n\t}\n\twhile(A>0)\n\t{\n\t\tt=N%A;\n\t\tN=A;\n\t\tA=t;\n\t\tif(N==1)\n\t\t{\n\t\t\tM=m%(n-1);\n\t\t\tbreak;\n\t\t}\n\t}\n\tresult=pow(a,M);\n\tresult=result%n;\n\th1=pow(2,i);\n\th2=pow(2,i+1);\n\th3=pow(2,i-1);\n\tfor(i=0;; i++)\n\t{\n\t\tif(m>=h1&&m<h2)\n\t\t{\n\t\t\tj=1;\n\t\t\tbreak;\n\t\t}\n\t}\n\tfor(; i>=0; i--)\n\t{\n\t\tif(m>=h1&&m<h2)\n\t\t{\n\t\t\tm=m-h1;\n\t\t\tif(m>h3)\n\t\t\t\tj++;\n\t\t}\n\t}\n\tprintf(\""%d %d\"",result,j);\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,2000,316
1591086508185030656,986a161615e13c54a0d7f5dd7e3c675f352c2943c85002debf59cce2b31a4b4a,2022-11-11 23:12:39,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint a,m,n,A,N,M,h1,h2,h3,i=1,I,j,t=0,result=1;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tA=a;\n\tN=n;\n\tif(a*n>pow(2,30))\n\t{\n\t\tprintf(\""不能处理的数据\"");\n\t\treturn 6;\n\t}\n\twhile(A>0)\n\t{\n\t\tt=N%A;\n\t\tN=A;\n\t\tA=t;\n\t\tif(N==1)\n\t\t{\n\t\t\tM=m%(n-1);\n\t\t\tbreak;\n\t\t}\n\t}\n\tresult=pow(a,M);\n\tresult=result%n;\n\n\tfor(i=0;; i++)\n\t{\n\t\th1=pow(2,i);\n\t\th2=pow(2,i+1);\n\t\th3=pow(2,i-1);\n\t\tif(m>=h1&&m<h2)\n\t\t{\n\t\t\tI=i;\n\t\t\tj=1;\n\t\t\tbreak;\n\t\t}\n\t}\n\tfor(; i>=0; i--)\n\t{\n\t\th1=pow(2,i);\n\t\th2=pow(2,i+1);\n\t\th3=pow(2,i-1);\n\t\tif(m>=h1&&m<h2&&i!=I)\n\t\t{\n\t\t\tm=m-h1;\n\t\t\tif(m>h3)\n\t\t\t\tj++;\n\t\t}\n\t}\n\tprintf(\""%d %d\"",result,j);\n\treturn 0;\n}",PARTIAL_ACCEPTED,15,372
1591087480701517824,986a161615e13c54a0d7f5dd7e3c675f352c2943c85002debf59cce2b31a4b4a,2022-11-11 23:16:31,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint a,m,n,A,N,M,h1,h2,h3,i=1,I,j,t=0,result=1;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tA=a;\n\tN=n;\n\tif(a*n>pow(2,30))\n\t\treturn 0;\n\twhile(A>0)\n\t{\n\t\tt=N%A;\n\t\tN=A;\n\t\tA=t;\n\t\tif(N==1)\n\t\t{\n\t\t\tM=m%(n-1);\n\t\t\tbreak;\n\t\t}\n\t}\n\tresult=pow(a,M);\n\tresult=result%n;\n\tfor(i=0;; i++)\n\t{\n\t\th1=pow(2,i);\n\t\th2=pow(2,i+1);\n\t\th3=pow(2,i-1);\n\t\tif(m>=h1&&m<h2)\n\t\t{\n\t\t\tI=i;\n\t\t\tj=1;\n\t\t\tbreak;\n\t\t}\n\t}\n\tfor(; i>=0; i--)\n\t{\n\t\th1=pow(2,i);\n\t\th2=pow(2,i+1);\n\t\th3=pow(2,i-1);\n\t\tif(m>=h1&&m<h2&&i!=I)\n\t\t{\n\t\t\tm=m-h1;\n\t\t\tif(m>h3)\n\t\t\t\tj++;\n\t\t}\n\t}\n\tprintf(\""%d %d\"",result,j);\n\treturn 0;\n}",PARTIAL_ACCEPTED,15,460
1591096224177000448,cfaa1748b4ab66f19b9d7d13d82ca11e8c3a7a29da4dfbe42b274fde9dc3d14a,2022-11-11 23:51:15,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\tint a,m,n,x,y,i,t,z,k,c,d,e,f,result,g,h,j,p;\n\ti = 0;\n\tx = 0;\n\tz = 0;\n\tk = 0;\n\tc = 1;\n\td = 0;\n\te = 1;\n\tj = 1;\n\tresult = 1;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\ty = pow(2,30);\n\tif(a * n <= y)\n\t\tx = 1;\n\tfor(t = 2; t < n; t++)\n\t{\n\t\tif(n % t == 0)\n\t\t\tz = 1;\n\t}\n\tif(z == 0)\n\t{\n\t\tif((a > n&&a % n == 0)||(a <= n&&n % a ==0))\n\t\t\tk = 1;\n\t}\n\tif(x == 1)\n\t{\n\t\tif(k == 0&&m >= n)\n\t\t\tm %= (n - 1);\n\t\t\tp = m;\n\t\twhile(c * 2 <= m)\n\t\t{\n\t\t\tc *= 2;\n\t\t\td++;\n\t\t}\n\t\tfor(d; d >= 0; d--)\n\t\t{\n\t\t\tfor(f = 1; f <= d; f++)\n\t\t\t\te *= 2;\n\t\t\tif(e <= m)\n\t\t\t{\n\t\t\t    g = a;\n\t\t\t    m -= e;\n\t\t\t\ti ++;\n\t\t    }\n\t\t    else \n\t\t        g = 1;\n\t\t\th = g * j;\n\t\t\tj = h % n;\n\t\t\tif(d != 0)\n\t\t\t{\n\t\t\t\tj *= j;\n\t\t\t\tj = j % n; \n\t\t\t} \n\t    }\n\t    a = a % n;\n\t\twhile(p > 0)\n\t\t{\n\t\t\tif(p % 2 == 1)\n\t\t\t\tresult = (result * a) % n;\n\t\t\tp /= 2;\n\t\t\ta = (a * a) % n;\n\t\t}\n\t\tprintf(\""%d %d\\n\"",result,i);\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,14,472
1591097196034981888,cfaa1748b4ab66f19b9d7d13d82ca11e8c3a7a29da4dfbe42b274fde9dc3d14a,2022-11-11 23:55:07,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\tint a,m,n,x,y,i,t,z,k,c,d,e,f,g,h,j;\n\ti = 0;\n\tx = 0;\n\tz = 0;\n\tk = 0;\n\tc = 1;\n\td = 0;\n\te = 1;\n    j = 1;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\ty = pow(2,30);\n\tif(a * n <= y)\n\t\tx = 1;\n\tfor(t = 2; t < n; t++)\n\t{\n\t\tif(n % t == 0)\n\t\t\tz = 1;\n\t}\n\tif(z == 0)\n\t{\n\t\tif((a > n&&a % n == 0)||(a <= n&&n % a ==0))\n\t\t\tk = 1;\n\t}\n\tif(x == 1)\n\t{\n\t\tif(k == 0&&m >= n)\n\t\t\tm %= (n - 1);\n\t\twhile(c * 2 <= m)\n\t\t{\n\t\t\tc *= 2;\n\t\t\td++;\n\t\t}\n\t\tfor(d; d >= 0; d--)\n\t\t{\n\t\t\tfor(f = 1; f <= d; f++)\n\t\t\t\te *= 2;\n\t\t\tif(e <= m)\n\t\t\t{\n\t\t\t    g = a;\n\t\t\t    m -= e;\n\t\t\t\ti ++;\n\t\t    }\n\t\t    else \n\t\t        g = 1;\n\t\t\th = g * j;\n\t\t\tj = h % n;\n\t\t\tif(d != 0)\n\t\t\t{\n\t\t\t\tj *= j;\n\t\t\t\tj = j % n; \n\t\t\t} \n\t    }\n\t    if(m == 0)\n\t        a = 1;\n\t    j =(j * a) % n;\n\t\tprintf(\""%d %d\\n\"",j,i);\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,19,312
1591210064629772288,986a161615e13c54a0d7f5dd7e3c675f352c2943c85002debf59cce2b31a4b4a,2022-11-12 07:23:37,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint a,m,n,A,a1,N,M,h1,h2,h3,i=1,I,j,t=0,result=1;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tA=a;\n\ta1=a;\n\tN=n;\n\tif(a*n>pow(2,30))\n\t\treturn 0;\n\twhile(A>0)\n\t{\n\t\tt=N%A;\n\t\tN=A;\n\t\tA=t;\n\t\tif(N==1)\n\t\t{\n\t\t\tM=m%(n-1);\n\t\t\tresult=pow(a,M);\n\t\t\tresult=result%n;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif(result==1&&N!=1)\n\t{\n\t\tfor(i=1; i<=m; i++)\n\t\t{\n\t\t\tresult=a%n;\n\t\t\tif(i!=m)\n\t\t\t\tresult=a*a1;\n\t\t}\n\t}\n\tfor(i=0;; i++)\n\t{\n\t\th1=pow(2,i);\n\t\th2=pow(2,i+1);\n\t\th3=pow(2,i-1);\n\t\tif(m>=h1&&m<h2)\n\t\t{\n\t\t\tI=i;\n\t\t\tj=1;\n\t\t\tbreak;\n\t\t}\n\t}\n\tfor(; i>=0; i--)\n\t{\n\t\th1=pow(2,i);\n\t\th2=pow(2,i+1);\n\t\th3=pow(2,i-1);\n\t\tif(m>=h1&&m<h2&&i!=I)\n\t\t{\n\t\t\tm=m-h1;\n\t\t\tif(m>h3)\n\t\t\t\tj++;\n\t\t}\n\t}\n\tprintf(\""%d %d\"",result,j);\n\treturn 0;\n}",PARTIAL_ACCEPTED,13,308
1591210938047463424,986a161615e13c54a0d7f5dd7e3c675f352c2943c85002debf59cce2b31a4b4a,2022-11-12 07:27:05,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint a,m,n,A,a1,N,M,h1,h2,h3,i=1,I,j,t=0,result=1;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tA=a;\n\ta1=a;\n\tN=n;\n\tif(a*n>pow(2,30))\n\t\treturn 0;\n\twhile(A>0)\n\t{\n\t\tt=N%A;\n\t\tN=A;\n\t\tA=t;\n\t\tif(N==1)\n\t\t{\n\t\t\tM=m%(n-1);\n\t\t\tresult=pow(a,M);\n\t\t\tresult=result%n;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif(result==1&&N!=1)\n\t{\n\t\tfor(i=1; i<=m; i++)\n\t\t{\n\t\t\tresult=a%n;\n\t\t\tif(i!=m)\n\t\t\t\tresult=a*a1;\n\t\t}\n\t}\n\tfor(i=1;; i++)\n\t{\n\t\th1=pow(2,i);\n\t\th2=pow(2,i+1);\n\t\th3=pow(2,i-1);\n\t\tif(m>=h1&&m<h2)\n\t\t{\n\t\t\tI=i;\n\t\t\tj=1;\n\t\t\tbreak;\n\t\t}\n\t}\n\tfor(; i>=0; i--)\n\t{\n\t\th1=pow(2,i);\n\t\th2=pow(2,i+1);\n\t\th3=pow(2,i-1);\n\t\tif(m>=h1&&m<h2&&i!=I)\n\t\t{\n\t\t\tm=m-h1;\n\t\t\tif(m>h3)\n\t\t\t\tj++;\n\t\t}\n\t}\n\tprintf(\""%d %d\"",result,j);\n\treturn 0;\n}",PARTIAL_ACCEPTED,12,352
1591255587801862144,cfaa1748b4ab66f19b9d7d13d82ca11e8c3a7a29da4dfbe42b274fde9dc3d14a,2022-11-12 10:24:30,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\tint a,m,n,x,y,i,t,z,k,c,d,e,f,g,h,j;\n\ti = 0;\n\tx = 0;\n\tz = 0;\n\tk = 0;\n\tc = 1;\n\td = 0;\n\te = 1;\n    j = 1;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\ty = pow(2,30);\n\tif(a * n <= y)\n\t\tx = 1;\n\tfor(t = 2; t < n; t++)\n\t{\n\t\tif(n % t == 0)\n\t\t\tz = 1;\n\t}\n\tif(z == 0)\n\t{\n\t\tif((a > n&&a % n == 0)||(a <= n&&n % a ==0))\n\t\t\tk = 1;\n\t}\n\tif(x == 1)\n\t{\n\t\tif(z == 0&&k == 0&&m >= n)\n\t\t\tm %= (n - 1);\n\t\twhile(c * 2 <= m)\n\t\t{\n\t\t\tc *= 2;\n\t\t\td++;\n\t\t}\n\t\tfor(d; d >= 0; d--)\n\t\t{\n\t\t\tfor(f = 1; f <= d; f++)\n\t\t\t\te *= 2;\n\t\t\tif(e <= m)\n\t\t\t{\n\t\t\t    g = a;\n\t\t\t    m -= e;\n\t\t\t\ti ++;\n\t\t    }\n\t\t    else \n\t\t        g = 1;\n\t\t\th = g * j;\n\t\t\tj = h % n;\n\t\t\tif(d != 0)\n\t\t\t{\n\t\t\t\tj *= j;\n\t\t\t\tj = j % n; \n\t\t\t} \n\t    }\n\t    if(m == 0)\n\t        a = 1;\n\t    j =(j * a) % n;\n\t\tprintf(\""%d %d\\n\"",j,i);\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,15,436
1591261217107279872,cfaa1748b4ab66f19b9d7d13d82ca11e8c3a7a29da4dfbe42b274fde9dc3d14a,2022-11-12 10:46:53,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\tint a,m,n,x,y,i,t,z,k,c,d,e,f,g,h,j;\n\ti = 0;\n\tx = 0;\n\tz = 0;\n\tk = 0;\n\tc = 1;\n\td = 0;\n\te = 1;\n    j = 1;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\ty = pow(2,30);\n\tif(a * n <= y)\n\t\tx = 1;\n\tfor(t = 2; t < n; t++)\n\t{\n\t\tif(n % t == 0)\n\t\t\tz = 1;\n\t}\n\tif(z == 0)\n\t{\n\t\tif((a > n && a % n == 0)||(a <= n && n % a ==0))\n\t\t\tk = 1;\n\t}\n\tif(x == 1)\n\t{\n\t\tif(z == 0 && k == 0 && m >= n)\n\t\t\tm %= (n - 1);\n\t\t\tg = m;\n\t\twhile(c * 2 <= m)\n\t\t{\n\t\t\tc *= 2;\n\t\t\td++;\n\t\t}\n\t\tfor(d; d >= 0; d--)\n\t\t{\n\t\t\tfor(f = 1; f <= d; f++)\n\t\t\t\te *= 2;\n\t\t\tif(e <= m)\n\t\t\t{\n\t\t\t    m -= e;\n\t\t\t\ti++;\n\t\t    }\n\t    }\n\t    a = a % n;\n\t    for(h = 1;h <= g;h++)\n\t    {\n\t    \tj = (j * a) % n;\n\t    }\n\t    j = j % n;\n\t\tprintf(\""%d %d\\n\"",j,i);\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,15,364
1591263554190225408,cfaa1748b4ab66f19b9d7d13d82ca11e8c3a7a29da4dfbe42b274fde9dc3d14a,2022-11-12 10:56:10,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\tint a,m,n,x,y,i,t,z,k,c,d,e,f,g,h,j;\n\ti = 0;\n\tx = 0;\n\tz = 0;\n\tk = 0;\n\tc = 1;\n\td = 0;\n\te = 1;\n    j = 1;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\ty = pow(2,30);\n\tif(a * n <= y)\n\t\tx = 1;\n\tfor(t = 2; t < n; t++)\n\t{\n\t\tif(n % t == 0)\n\t\t\tz = 1;\n\t}\n\tif(x == 1)\n\t{\n\t\tif(z == 0 && m >= n)\n\t\t\tm %= (n - 1);\n\t\t\tg = m;\n\t\twhile(c * 2 <= m)\n\t\t{\n\t\t\tc *= 2;\n\t\t\td++;\n\t\t}\n\t\tfor(d; d >= 0; d--)\n\t\t{\n\t\t\tfor(f = 1; f <= d; f++)\n\t\t\t\te *= 2;\n\t\t\tif(e <= m)\n\t\t\t{\n\t\t\t    m -= e;\n\t\t\t\ti++;\n\t\t    }\n\t    }\n\t    a = a % n;\n\t    for(h = 1;h <= g;h++)\n\t    {\n\t    \tj = (j * a) % n;\n\t    }\n\t    j = j % n;\n\t\tprintf(\""%d %d\\n\"",j,i);\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,15,324
1591264570931478528,cfaa1748b4ab66f19b9d7d13d82ca11e8c3a7a29da4dfbe42b274fde9dc3d14a,2022-11-12 11:00:12,C,4.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\tint a,m,n,x,y,i,t,z,k,c,d,e,f,g,h,j;\n\ti = 0;\n\tx = 0;\n\tz = 0;\n\tk = 0;\n\tc = 1;\n\td = 0;\n\te = 1;\n    j = 1;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\ty = pow(2,30);\n\tif(a * n <= y)\n\t\tx = 1;\n\tfor(t = 2; t < n; t++)\n\t{\n\t\tif(n % t == 0)\n\t\t\tbreak;\n\t\telse \n\t\t    continue;\n\t\tif(t = n)\n\t\t    z = 1;\n\t}\n\tif(x == 1)\n\t{\n\t\tif(z == 1 && m >= n)\n\t\t\tm %= (n - 1);\n\t\t\tg = m;\n\t\twhile(c * 2 <= m)\n\t\t{\n\t\t\tc *= 2;\n\t\t\td++;\n\t\t}\n\t\tfor(d; d >= 0; d--)\n\t\t{\n\t\t\tfor(f = 1; f <= d; f++)\n\t\t\t\te *= 2;\n\t\t\tif(e <= m)\n\t\t\t{\n\t\t\t    m -= e;\n\t\t\t\ti++;\n\t\t    }\n\t    }\n\t    a = a % n;\n\t    for(h = 1;h <= g;h++)\n\t    {\n\t    \tj = (j * a) % n;\n\t    }\n\t    j = j % n;\n\t\tprintf(\""%d %d\\n\"",j,i);\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,19,316
1591281112394039296,cfaa1748b4ab66f19b9d7d13d82ca11e8c3a7a29da4dfbe42b274fde9dc3d14a,2022-11-12 12:05:56,C,2.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n\nint main()\n{\n\tint a,m,n,b,c,d,e,g,h,i,k,l,p,q,r;\n\tb = 1;\n\tc = 0;\n\td = 0;\n\te = 1;\n\tk = 1;\n\tp = 0;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tfor(i = 2;i <n ;i++)\n\t{\n\t\tif(n % i == 0)\n\t\t   p = 1;\n\t}\n\tif(p == 0 && m > n)\n\t    m = m % (n - 1);\n\t    q = m; \n\twhile(e * 2 <= m)\n\t{\n\t\te *= 2;\n\t\tc++;\n\t} \n\tfor(c;c >= 0;c--)\n\t{\n\t\tfor(l = 1; l <= c;l++)\n\t\t    k *= 2;\n\t\tif(k <= m)\n\t\t{\n\t\t\tm -= k;\n\t\t\td++;\n\t    }\n    }\n    a = a % n;\n    for(r = 1;r <= m;r++)\n    {\n    \tb = (b * a) % n;\n    }\n    b = b % n;\n    printf(\""%d %d\\n\"",b,d);\n    return 0;\n}\n",PARTIAL_ACCEPTED,16,320
1591281606843764736,cfaa1748b4ab66f19b9d7d13d82ca11e8c3a7a29da4dfbe42b274fde9dc3d14a,2022-11-12 12:07:54,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n\nint main()\n{\n\tint a,m,n,b,c,d,e,g,h,i,j,k,l;\n\tb = 1;\n\tc = 0;\n\td = 0;\n\te = 1;\n\tk = 1;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tfor(i = 2;i <n ;i++)\n\t{\n\t\tif(n % i == 0)\n\t\t   break;\n\t\telse\n\t\t   continue;\n\t}\n\tif(i == n)\n\t    j = 1;\n\tif(j == 1 && m > n)\n\t    m = m % (n - 1);\n\twhile(e * 2 <= m)\n\t{\n\t\te *= 2;\n\t\tc++;\n\t} \n\tfor(c;c >= 0;c--)\n\t{\n\t\tfor(l = 1; l <= c;l++)\n\t    {\n\t\tk*= 2;\n\t    }\n\t\tif(k <= m)\n\t\t{\n\t\t\tg = a;\n\t\t\tm -= k;\n\t\t\td++;\n\t    }\n\t    else\n\t         g = 1;\n\t    h = g * b;\n\t    b = h % n;\n\t    if(c != 0)\n\t    {\n\t    \tb *= b;\n\t    \tb = b % n;\n\t\t}\n    }\n    if(m == 0)\n        a = 1;\n    b = (b * a) % n;\n    printf(\""%d %d\\n\"",b,d);\n    return 0;\n}",PARTIAL_ACCEPTED,16,344
1591282630602063872,cfaa1748b4ab66f19b9d7d13d82ca11e8c3a7a29da4dfbe42b274fde9dc3d14a,2022-11-12 12:11:58,C,2.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n\nint main()\n{\n\tint a,m,n,b,c,d,e,g,h,i,k,l,p,q,r;\n\tb = 1;\n\tc = 0;\n\td = 0;\n\te = 1;\n\tk = 1;\n\tp = 0;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tfor(i = 2;i <n ;i++)\n\t{\n\t\tif(n % i == 0)\n\t\t   p = 1;\n\t}\n\tif(p == 0 && m > n)\n\t    m = m % (n - 1);\n\t    q = m; \n\twhile(e * 2 <= m)\n\t{\n\t\te *= 2;\n\t\tc++;\n\t} \n\tfor(c;c >= 0;c--)\n\t{\n\t\tfor(l = 1; l <= c;l++)\n\t\t    k *= 2;\n\t\tif(k <= m)\n\t\t{\n\t\t\tm -= k;\n\t\t\td++;\n\t    }\n    }\n    a = a % n;\n    for(r = 1;r <= m;r++)\n    {\n    \tb = (b * a) % n;\n    }\n    b = b % n;\n    printf(\""%d %d\\n\"",b,d);\n    return 0;\n}\n",PARTIAL_ACCEPTED,18,352
1591284118971789312,cfaa1748b4ab66f19b9d7d13d82ca11e8c3a7a29da4dfbe42b274fde9dc3d14a,2022-11-12 12:17:53,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n\nint main()\n{\n\tint a,m,n,b,c,d,e,g,h,i,j,k,l,p;\n\tb = 1;\n\tc = 0;\n\td = 0;\n\te = 1;\n\tk = 1;\n\tp = 0;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tfor(i = 2;i <n ;i++)\n\t{\n\t\tif(n % i == 0)\n\t\t   p = 1;\n\t}\n\tif(p == 0 && m >= n)\n\t    m = m % (n - 1);\n\twhile(e * 2 <= m)\n\t{\n\t\te *= 2;\n\t\tc++;\n\t} \n\tfor(c;c >= 0;c--)\n\t{\n\t\tfor(l = 1; l <= c;l++)\n\t    {\n\t\tk*= 2;\n\t    }\n\t\tif(k <= m)\n\t\t{\n\t\t\tg = a;\n\t\t\tm -= k;\n\t\t\td++;\n\t    }\n\t    else\n\t         g = 1;\n\t    h = g * b;\n\t    b = h % n;\n\t    if(c != 0)\n\t    {\n\t    \tb *= b;\n\t    \tb = b % n;\n\t\t}\n    }\n    if(m == 0)\n        a = 1;\n    b = (b * a) % n;\n    printf(\""%d %d\\n\"",b,d);\n    return 0;\n}\n",PARTIAL_ACCEPTED,12,512
1591302104302530560,986a161615e13c54a0d7f5dd7e3c675f352c2943c85002debf59cce2b31a4b4a,2022-11-12 13:29:21,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint a,m,n,A,a1,N,M,h1,h2,h3,i=1,I,j,t=0,result=1;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tA=a;\n\ta1=a;\n\tN=n;\n\tif(a*n>pow(2,30))\n\t\treturn 0;\n\twhile(A>0)\n\t{\n\t\tt=N%A;\n\t\tN=A;\n\t\tA=t;\n\t\tif(N==1)\n\t\t{\n\t\t\tM=m%(n-1);\n\t\t\tresult=pow(a,M);\n\t\t\tresult=result%n;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif(result==1&&N!=1)\n\t{\n\t\tfor(i=1; i<=m; i++)\n\t\t{\n\t\t\tresult=a%n;\n\t\t\tif(i!=m)\n\t\t\t\tresult=a*a1;\n\t\t}\n\t}\n\tfor(i=1;; i++)\n\t{\n\t\th1=pow(2,i);\n\t\th2=pow(2,i+1);\n\t\th3=pow(2,i-1);\n\t\tif(m>=h1&&m<h2)\n\t\t{\n\t\t\tI=i;\n\t\t\tj=1;\n\t\t\tbreak;\n\t\t}\n\t}\n\tfor(; i>=0; i--)\n\t{\n\t\th1=pow(2,i);\n\t\th2=pow(2,i+1);\n\t\th3=pow(2,i-1);\n\t\tif(m>=h1&&m<h2&&i!=I)\n\t\t{\n\t\t\tm=m-h1;\n\t\t\tif(m>h3)\n\t\t\t\tj++;\n\t\t}\n\t}\n\tprintf(\""%d %d\"",result,j);\n\treturn 0;\n}",PARTIAL_ACCEPTED,27,324
1591302141149515776,986a161615e13c54a0d7f5dd7e3c675f352c2943c85002debf59cce2b31a4b4a,2022-11-12 13:29:30,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint a,m,n,A,a1,N,M,h1,h2,h3,i=1,I,j,t=0,result=1;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tA=a;\n\ta1=a;\n\tN=n;\n\tif(a*n>pow(2,30))\n\t\treturn 0;\n\twhile(A>0)\n\t{\n\t\tt=N%A;\n\t\tN=A;\n\t\tA=t;\n\t\tif(N==1)\n\t\t{\n\t\t\tM=m%(n-1);\n\t\t\tresult=pow(a,M);\n\t\t\tresult=result%n;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif(N!=1)\n\t{\n\t\tfor(i=1; i<=m; i++)\n\t\t{\n\t\t\tresult=a%n;\n\t\t\tif(i!=m)\n\t\t\t\tresult=a*a1;\n\t\t}\n\t}\n\tfor(i=1;; i++)\n\t{\n\t\th1=pow(2,i);\n\t\th2=pow(2,i+1);\n\t\tif(m>=h1&&m<h2)\n\t\t{\n\t\t\tI=i; \n\t\t\tj=1;\n\t\t\tbreak;\n\t\t}\n\t}\n\tfor(; i>=0; i--)\n\t{\n\t\th1=pow(2,i);\n\t\th2=pow(2,i+1);\n\t\th3=pow(2,i-1);\n\t\tif(m>=h1&&m<h2&&i!=I)\n\t\t{\n\t\t\tm=m-h1;\n\t\t\tif(m>h3)\n\t\t\t\tj++;\n\t\t}\n\t}\n\tprintf(\""%d %d\"",result,j);\n\treturn 0;\n}",PARTIAL_ACCEPTED,19,356
1591317484546863104,986a161615e13c54a0d7f5dd7e3c675f352c2943c85002debf59cce2b31a4b4a,2022-11-12 14:30:28,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint a,m,n,A,a1,N,M,h1,h2,h3,i=1,I,j,t=0,result=1;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tA=a;\n\ta1=a;\n\tN=n;\n\tif(a*n>pow(2,30))\n\t\treturn 0;\n\twhile(A>0)\n\t{\n\t\tt=N%A;\n\t\tN=A;\n\t\tA=t;\n\t\tif(N==1&&m>n)\n\t\t{\n\t\t\tM=m%(n-1);\n\t\t\tresult=pow(a,M);\n\t\t\tresult=result%n;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif(N!=1&&m<=n)\n\t{\n\t\tfor(i=1; i<=m; i++)\n\t\t{\n\t\t\tresult=a%n;\n\t\t\tif(i!=m)\n\t\t\t\tresult=a*a1;\n\t\t}\n\t}\n\tfor(i=1;; i++)\n\t{\n\t\th1=pow(2,i);\n\t\th2=pow(2,i+1);\n\t\tif(m>=h1&&m<h2)\n\t\t{\n\t\t\tI=i; \n\t\t\tj=1;\n\t\t\tbreak;\n\t\t}\n\t}\n\tfor(; i>=0; i--)\n\t{\n\t\th1=pow(2,i);\n\t\th2=pow(2,i+1);\n\t\th3=pow(2,i-1);\n\t\tif(m>=h1&&m<h2&&i!=I)\n\t\t{\n\t\t\tm=m-h1;\n\t\t\tif(m>h3)\n\t\t\t\tj++;\n\t\t}\n\t}\n\tprintf(\""%d %d\"",result,j);\n\treturn 0;\n}",PARTIAL_ACCEPTED,35,512
1591322728777453568,986a161615e13c54a0d7f5dd7e3c675f352c2943c85002debf59cce2b31a4b4a,2022-11-12 14:51:18,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint a,m,n,A,M,h1,h2,h3,i=1,I,j;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tA=a;\n\tif(a*n>pow(2,30))\n\t\treturn 0;\nfor(i=1; i<=m; i++)\n\t{\n\t\ta=a%n;\n\t\tif(i!=m)\n\t\t\ta=a*A;\n\t}\n\tfor(i=1;; i++)\n\t{\n\t\th1=pow(2,i);\n\t\th2=pow(2,i+1);\n\t\tif(m>=h1&&m<h2)\n\t\t{\n\t\t\tI=i; \n\t\t\tj=1;\n\t\t\tbreak;\n\t\t}\n\t}\n\tfor(; i>=0; i--)\n\t{\n\t\th1=pow(2,i);\n\t\th2=pow(2,i+1);\n\t\th3=pow(2,i-1);\n\t\tif(m>=h1&&m<h2&&i!=I)\n\t\t{\n\t\t\tm=m-h1;\n\t\t\tif(m>h3)\n\t\t\t\tj++;\n\t\t}\n\t}\n\tprintf(\""%d %d\"",a,j);\n\treturn 0;\n}",PARTIAL_ACCEPTED,48,640
1591324897907904512,986a161615e13c54a0d7f5dd7e3c675f352c2943c85002debf59cce2b31a4b4a,2022-11-12 14:59:55,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint a,m,n,A,M,h1,h2,h3,i=1,I,j;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tA=a;\n\tif(a*n>pow(2,30))\n\t\treturn 0;\n\tfor(i=1; i<=m; i++)\n\t{\n\t\ta=a%n;\n\t\tif(i!=m)\n\t\t\ta=a*A;\n\t}\n\tfor(i=1; ; i++)\n\t{\n\t\th1=pow(2,i);\n\t\th2=pow(2,i+1);\n\t\tif(m>=h1&&m<h2)\n\t\t{\n\t\t\tI=i;\n\t\t\tj=1;\n\t\t\tbreak;\n\t\t}\n\t}\n\tfor( ; i>=0; i--)\n\t{\n\t\th1=pow(2,i);\n\t\th2=pow(2,i+1);\n\t\th3=pow(2,i-1);\n\t\tif(m>=h1&&m<h2&&i!=I)\n\t\t{\n\t\t\tm=m-h1;\n\t\t\tif(m>=h3)\n\t\t\t\tj++;\n\t\t}\n\t}\n\tprintf(\""%d %d\"",a,j);\n\treturn 0;\n}",PARTIAL_ACCEPTED,42,384
1591325417305341952,986a161615e13c54a0d7f5dd7e3c675f352c2943c85002debf59cce2b31a4b4a,2022-11-12 15:01:59,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint a,m,n,A,h1,h2,h3,i=1,I,j;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tA=a;\n\tif(a*n>pow(2,30))\n\t\treturn 0;\n\tfor(i=1; i<=m; i++)\n\t{\n\t\ta=a%n;\n\t\tif(i!=m)\n\t\t\ta=a*A;\n\t}\n\tfor(i=1; ; i++)\n\t{\n\t\th1=pow(2,i);\n\t\th2=pow(2,i+1);\n\t\tif(m>=h1&&m<h2)\n\t\t{\n\t\t\tI=i;\n\t\t\tj=1;\n\t\t\tbreak;\n\t\t}\n\t}\n\tfor( ; i>=0; i--)\n\t{\n\t\th1=pow(2,i);\n\t\th2=pow(2,i+1);\n\t\th3=pow(2,i-1);\n\t\tif(m>=h1&&m<h2&&i!=I)\n\t\t{\n\t\t\tm=m-h1;\n\t\t\tif(m>=h3)\n\t\t\t\tj++;\n\t\t}\n\t}\n\tprintf(\""%d %d\"",a,j);\n\treturn 0;\n}",PARTIAL_ACCEPTED,51,508
1591370005327949824,e58931e7101319130ba2d901c8c20269b203d6db34a4b0882ef24f3e9b085d3d,2022-11-12 17:59:10,C,8.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include<stdio.h>\nint main()\n{\n\tint a,m,n;\n\tint ans2=0,flag=0;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tif(m==n-1)\n\t\tflag=1; \n\tm%=(n-1);\n\tint ans1=1;\n\twhile(m)\n\t{\n\t\tif(m%2!=0)\n\t\t{\n\t\t\tans1=((ans1%n)*(a%n))%n;\n\t\t\tans2+=1;\n\t\t}\n\t\ta=((a%n)*(a%n))%n;\n\t\tm/=2;\n\t\t\n\t}\n\tprintf(\""%d \"",ans1);\n\tif(flag)\n\t\tprintf(\""1\"");\n\telse\n\t\tprintf(\""%d\"",ans2);\n\treturn 0;\n\t\n\t\n\t\n } ",PARTIAL_ACCEPTED,32,356
1591447035348320256,b2ef8e51a9de40c315a9d42299e16855e32af9f493b339d98fe2e7b01779f43d,2022-11-12 23:05:15,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include<stdio.h>\n\nint main()\n{\n    int a,b,c;\n    \n    return 0;\n}",WRONG_ANSWER,101,512
1591455487936233472,3e112652bf6a5fc46ca8f8330bdda7b198c2f7e4f60b9d7f1806c0ab30c162c8,2022-11-12 23:38:50,C,10.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include<stdio.h>\nint main()\n{\n\tint a,m,n,i,j=0,b[1000],c,num,fre=0;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tc=a;\n\tif(m>n&&m%n!=0)\n\t{\n\t\tfor(i=2; i<n; i++)\n\t\t{\n\t\t\tif(n%i==0)\n\t\t\t\tbreak;\n\t\t\tif(i==n-1)\n\t\t\t\tm=m%(n-1);\n\t\t}\n\t}\n\twhile(1)\n\t{\n\t\tj++;\n\t\tb[j-1]=m%2;\n\t\tif(b[j-1]==1)\n\t\t\tfre=fre+1;\n\t\tm=m/2;\n\t\tif(m==0)\n\t\t\tbreak;\n\t}\n\ta=(a%n)*(a%n);\n\tfor(j; j>2; j--)\n\t{\n\t\tif(b[j-2]==1)\n\t\t{\n\t\t\ta=(a%n)*(c%n);\n\t\t\ta=a*a;\n\t\t}\n\t\telse\n\t\t\ta=(a%n)*(a%n);\n\t}\n\tif(b[0]==1)\n\t\ta=((a%n)*c)%n;\n\telse\n\t\ta=a%n;\n\tnum=a;\n\tprintf(\""%d %d\"",num,fre);\n\treturn 0;\n}",ACCEPTED,68,384
1591455572329828352,3e112652bf6a5fc46ca8f8330bdda7b198c2f7e4f60b9d7f1806c0ab30c162c8,2022-11-12 23:39:10,C,10.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include<stdio.h>\nint main()\n{\n\tint a,m,n,i,j=0,b[1000],c,num,fre=0;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tc=a;\n\tif(m>n&&m%n!=0)\n\t{\n\t\tfor(i=2; i<n; i++)\n\t\t{\n\t\t\tif(n%i==0)\n\t\t\t\tbreak;\n\t\t\tif(i==n-1)\n\t\t\t\tm=m%(n-1);\n\t\t}\n\t}\n\twhile(1)\n\t{\n\t\tj++;\n\t\tb[j-1]=m%2;\n\t\tif(b[j-1]==1)\n\t\t\tfre=fre+1;\n\t\tm=m/2;\n\t\tif(m==0)\n\t\t\tbreak;\n\t}\n\ta=(a%n)*(a%n);\n\tfor(j; j>2; j--)\n\t{\n\t\tif(b[j-2]==1)\n\t\t{\n\t\t\ta=(a%n)*(c%n);\n\t\t\ta=a*a;\n\t\t}\n\t\telse\n\t\t\ta=(a%n)*(a%n);\n\t}\n\tif(b[0]==1)\n\t\ta=((a%n)*c)%n;\n\telse\n\t\ta=a%n;\n\tnum=a;\n\tprintf(\""%d %d\"",num,fre);\n\treturn 0;\n}",ACCEPTED,74,512
1591457638007771136,3e112652bf6a5fc46ca8f8330bdda7b198c2f7e4f60b9d7f1806c0ab30c162c8,2022-11-12 23:47:23,C,10.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include<stdio.h>\nint main()\n{\n\tint a,m,n,i,j=0,b[1000],c,num,fre=0;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tc=a;\n\tif(m>n&&m%n!=0)\n\t{\n\t\tfor(i=2; i<n; i++)\n\t\t{\n\t\t\tif(n%i==0)\n\t\t\t\tbreak;\n\t\t\tif(i==n-1)\n\t\t\t\tm=m%(n-1);\n\t\t}\n\t}\n\twhile(1)\n\t{\n\t\tj++;\n\t\tb[j-1]=m%2;\n\t\tif(b[j-1]==1)\n\t\t\tfre=fre+1;\n\t\tm=m/2;\n\t\tif(m==0)\n\t\t\tbreak;\n\t}\n\ta=(a%n)*(a%n);\n\tfor(j; j>2; j--)\n\t{\n\t\tif(b[j-2]==1)\n\t\t{\n\t\t\ta=(a%n)*(c%n);\n\t\t\ta=a*a;\n\t\t}\n\t\telse\n\t\t\ta=(a%n)*(a%n);\n\t}\n\tif(b[0]==1)\n\t\ta=((a%n)*c)%n;\n\telse\n\t\ta=a%n;\n\tnum=a;\n\tprintf(\""%d %d\"",num,fre);\n\treturn 0;\n}",ACCEPTED,48,640
1591572226393268224,3e112652bf6a5fc46ca8f8330bdda7b198c2f7e4f60b9d7f1806c0ab30c162c8,2022-11-13 07:22:43,C,10.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include<stdio.h>\nint main()\n{\n\tint a,m,n,i,j=0,b[1000],c,num,fre=0;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tc=a;\n\tif(m>n&&m%n!=0)\n\t{\n\t\tfor(i=2; i<n; i++)\n\t\t{\n\t\t\tif(n%i==0)\n\t\t\t\tbreak;\n\t\t\tif(i==n-1)\n\t\t\t\tm=m%(n-1);\n\t\t}\n\t}\n\twhile(1)\n\t{\n\t\tj++;\n\t\tb[j-1]=m%2;\n\t\tif(b[j-1]==1)\n\t\t\tfre=fre+1;\n\t\tm=m/2;\n\t\tif(m==0)\n\t\t\tbreak;\n\t}\n\ta=(a%n)*(a%n);\n\tfor(j; j>2; j--)\n\t{\n\t\tif(b[j-2]==1)\n\t\t{\n\t\t\ta=(a%n)*(c%n);\n\t\t\ta=a*a;\n\t\t}\n\t\telse\n\t\t\ta=(a%n)*(a%n);\n\t}\n\tif(b[0]==1)\n\t\ta=((a%n)*c)%n;\n\telse\n\t\ta=a%n;\n\tnum=a;\n\tprintf(\""%d %d\"",num,fre);\n\treturn 0;\n}",ACCEPTED,10,320
1591622645316333568,f65a6719c9fb795058227caa271642d90b0edfefaf2ab9527812bd784685284c,2022-11-13 10:43:04,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint a,m,n,b,c;\n\tint x,r,y;\n\tx=2;\n\tr=30;\n\ty=pow(x,n);\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tb=pow(a,m);\n\tc=b%n;\n\tprintf(\""%d\"",c);\n\treturn 0;\n}",WRONG_ANSWER,36,492
1591630840961183744,cfaa1748b4ab66f19b9d7d13d82ca11e8c3a7a29da4dfbe42b274fde9dc3d14a,2022-11-13 11:15:38,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\tint a,m,n,x,y,result;\n\tx = 0;\n\tresult = 1;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\ty = pow(2,30);\n\tif(a * n <= y)\n\t\tx = 1;\n\tif(x = 1)\n\t{\n\t\ta = a % n;\n\t\twhile(m > 0)\n\t\t{\n\t\t\tif(m % 2 == 1)\n\t\t\t\tresult = (result * a) % n;\n\t\t\tm = m / 2;\n\t\t\ta = (a * a) % n;\n\t\t}\n\t\tprintf(\""%d\\t%d\\n\"",result,m);\n\t}\n\treturn 0;\n}",WRONG_ANSWER,36,512
1591630945294508032,2be3b098b9f570abe82118cc49290059bdd5e6f8d92c33495d6680fc5023719d,2022-11-13 11:16:03,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n\nint main()\n{\n\tint a,d,i,j,m,n,q,x,y,z;\n\tx=0;\n\tscanf(\""%d%d%d\"",&m,&n,&q);\n\tfor(i=1;i<=m;i++)\n\t{\n\t\ta=q+2*(i-1);\n\t\tfor(j=1;j<=n;j++)\n\t\t{\n\t\t\td=a+(j-1)*(2*i+3);\n\t\t\tif(d%5==0&&x==0)\n\t\t\t{\n\t\t\t\tx=i;\n\t\t\t\ty=j;\n\t\t\t\tz=d;\n\t\t\t}\n\t\t\tif(j<n)\n\t\t\tprintf(\""%d\\t\"",d);\n\t\t\telse\n\t\t\tprintf(\""%d\"",d);\n\t\t}\n\t\tprintf(\""\\n\"");\n\t}\n\tif(x==0)\n\tprintf(\""0\"");\n\telse\n\tprintf(\""%d\\t%d\\t%d\"",x,y,z);\n\treturn 0;\n}\n",MULTIPLE_ERROR,443,41336
1591631130720481280,2be3b098b9f570abe82118cc49290059bdd5e6f8d92c33495d6680fc5023719d,2022-11-13 11:16:47,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n\nint main()\n{\n\tint a,d,i,j,m,n,q,x,y,z;\n\tx=0;\n\tscanf(\""%d%d%d\"",&m,&n,&q);\n\tfor(i=1;i<=m;i++)\n\t{\n\t\ta=q+2*(i-1);\n\t\tfor(j=1;j<=n;j++)\n\t\t{\n\t\t\td=a+(j-1)*(2*i+3);\n\t\t\tif(d%5==0&&x==0)\n\t\t\t{\n\t\t\t\tx=i;\n\t\t\t\ty=j;\n\t\t\t\tz=d;\n\t\t\t}\n\t\t\tif(j<n)\n\t\t\tprintf(\""%d\\t\"",d);\n\t\t\telse\n\t\t\tprintf(\""%d\"",d);\n\t\t}\n\t\tprintf(\""\\n\"");\n\t}\n\tif(x==0)\n\tprintf(\""0\"");\n\telse\n\tprintf(\""%d\\t%d\\t%d\"",x,y,z);\n\treturn 0;\n}\n",MULTIPLE_ERROR,433,39748
1591632580871729152,2be3b098b9f570abe82118cc49290059bdd5e6f8d92c33495d6680fc5023719d,2022-11-13 11:22:33,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\nint main()\n{\n\tint a,d,i,j,m,n,q,x,y,z;\n\tx=0;\n\tscanf(\""%d%d%d\"",&m,&n,&q);\n\tfor(i=1;i<=m;i++)\n\t{\n\t\ta=q+2*(i-1);\n\t\tfor(j=1;j<=n;j++)\n\t\t{\n\t\t\td=a+(j-1)*(2*i+3);\n\t\t\tif(d%5==0&&x==0)\n\t\t\t{\n\t\t\t\tx=i;\n\t\t\t\ty=j;\n\t\t\t\tz=d;\n\t\t\t}\n\t\t\tif(j<n)\n\t\t\tprintf(\""%d\\t\"",d);\n\t\t\telse\n\t\t\tprintf(\""%d\"",d);\n\t\t}\n\t\tprintf(\""\\n\"");\n\t}\n\tif(x==0)\n\tprintf(\""0\"");\n\telse\n\tprintf(\""%d\\t%d\\t%d\"",x,y,z);\n\treturn 0;\n}\n",MULTIPLE_ERROR,427,39500
1591633191579181056,2be3b098b9f570abe82118cc49290059bdd5e6f8d92c33495d6680fc5023719d,2022-11-13 11:24:58,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\nint main()\n{\n\tint a,d,i,j,m,n,q,x,y,z;\n\tx=0;\n\tscanf(\""%d%d%d\"",&m,&n,&q);\n\tfor(i=1;i<=m;i++)\n\t{\n\t\ta=q+2*(i-1);\n\t\tfor(j=1;j<=n;j++)\n\t\t{\n\t\t\td=a+(j-1)*(2*i+3);\n\t\t\tif(d%5==0&&x==0)\n\t\t\t{\n\t\t\t\tx=i;\n\t\t\t\ty=j;\n\t\t\t\tz=d;\n\t\t\t}\n\t\t\tif(j<n)\n\t\t\tprintf(\""%d\\t\"",d);\n\t\t\telse\n\t\t\tprintf(\""%d\"",d);\n\t\t}\n\t\tprintf(\""\\n\"");\n\t}\n\tprintf(\""%d\\t%d\\t%d\"",x,y,z);\n\treturn 0;\n}\n",MULTIPLE_ERROR,428,40376
1591633956142080000,2be3b098b9f570abe82118cc49290059bdd5e6f8d92c33495d6680fc5023719d,2022-11-13 11:28:00,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\nint main()\n{\n\tint a,d,i,j,m,n,q,x,y,z;\n\tx=0;\n\tscanf(\""%d%d%d\"",&m,&n,&q);\n\tfor(i=1;i<=m;i++)\n\t{\n\t\ta=q+2*(i-1);\n\t\tfor(j=1;j<=n;j++)\n\t\t{\n\t\t\td=a+(j-1)*(2*i+3);\n\t\t\tif(d%5==0&&x==0)\n\t\t\t{\n\t\t\t\tx=i;\n\t\t\t\ty=j;\n\t\t\t\tz=d;\n\t\t\t}\n\t\t\tif(j<n)\n\t\t\tprintf(\""%d\\t\"",d);\n\t\t\telse\n\t\t\tprintf(\""%d\"",d);\n\t\t}\n\t\tprintf(\""\\n\"");\n\t}\n\t\n\t\n\treturn 0;\n}\n",MULTIPLE_ERROR,424,42396
1591634818394513408,8dc33fc6f4f428b3e2840ad6402a77767f35cc8eef3387f235b4b7c9d324ea82,2022-11-13 11:31:26,C,8.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n#include <math.h>\nint main()\n{\n\tint a,m,n,j,i,k,g,t,l,Mod,N[64],M[64];\n\tint x,y=2,z,f,De_prime,De_rel_prime;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\n\tif(m>n)\n\t{\n\t\tif(n%2==0||n%6!=1&&n%6!=5)\n\t\t\tDe_prime = 0;\n\t\telse\n\t\t{\n\t\t\tfor(x=3; x<=sqrt(n); x++)\n\t\t\t{\n\t\t\t\tif(n%x==0)break;\n\t\t\t}\n\t\t\tif(n%x==0)\n\t\t\t\tDe_prime= 0;\n\t\t\telse\n\t\t\t\tDe_prime = 1;\n\t\t}\n\t\tz=a;\n\t\tf=n;\n\t\tif(z>f)\n\t\t{\n\t\t\tz = z+f;\n\t\t\tf = z-f;\n\t\t\tz = z-f;\n\t\t}\n\t\twhile(y<=z)\n\t\t{\n\t\t\tif(z%y==0)\n\t\t\t{\n\t\t\t\tif(f%y==0)\n\t\t\t\t\tDe_rel_prime=0;\n\t\t\t\telse\n\t\t\t\t\tDe_rel_prime=1;\n\t\t\t\tz/=y;\n\t\t\t}\n\t\t\telse\n\t\t\t\ty++;\n\t\t}\n\t\tif(De_prime==1&&De_rel_prime==1)\n\t\t\tm%=(n-1);\n\t}\n\n\tMod = a%n;\n\tfor(i=0; m>=1; i++)\n\t{\n\t\tN[i]=m%2;\n\t\tm/=2;\n\t}\n\tl=g=i=i-1;\n\tfor(j=i; j>=0; j--)\n\t{\n\t\tif(N[i])\n\t\t{\n\t\t\tfor(k=0; k<i; k++)\n\t\t\t{\n\t\t\t\tif(Mod==a)\n\t\t\t\t\tt+=1;\n\t\t\t\tMod = Mod*Mod;\n\t\t\t\tMod=Mod%n;\n\n\t\t\t}\n\t\t\tM[i]=Mod;\n\t\t\tMod=a%n;\n\t\t}\n\t\telse\n\t\t\tM[i]=1;\n\t\ti--;\n\t}\n\tif(N[0])\n\t\tM[0]=a%n;\n\telse\n\t\tM[0]=1;\n\tMod = M[l];\n\tfor(; g>0; g--)\n\t{\n\t\tif(Mod==a||M[g-1]==a)\n\t\t\tt+=1;\n\t\tMod=Mod*M[g-1];\n\t\tMod =Mod%n;\n\t}\n\tprintf(\""%d %d\"",Mod,t);\n\treturn 0;\n}\n\n\n\n",PARTIAL_ACCEPTED,41,512
1591651594247364608,cfaa1748b4ab66f19b9d7d13d82ca11e8c3a7a29da4dfbe42b274fde9dc3d14a,2022-11-13 12:38:06,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\tint a,m,n,b,c,d,e,f,g,h,i,j,k,r,p,q;\n\tc = 0;\n\te = 0;\n\tf = 0;\n\tg = 1;\n\ti = 1;\n\tk = 0;\n\tr = 1;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tb = pow(2,30);\n\tif(a * n <= b)\n\t    c = 1;\n\tif(c == 1)\n\t{\n\t\tfor(d = 2;d < n;d ++)\n\t\t{\n\t\t\tif(n % d == 0)\n\t\t\t    e = 1;\n\t\t} \n\t\tif(e == 0 && m >= n )\n\t\t    m %= (n - 1);\n\t\tp = m;\n\t\twhile(g * 2 <= m)\n\t\t{\n\t\t\tg *= 2;\n\t\t\th++;\n\t\t}\n\t\tfor(h;h >= 0;h--)\n\t\t{\n\t\t\tfor(j = 1;j <= h;j++)\n\t\t\t{\n\t\t\t\ti *= 2;\n\t\t\t}\n\t\t\tif(i <= m)\n\t\t\t{\n\t\t\t    m -= i;\n\t\t\t\tk++;\n\t\t\t}\n\t\t}\n     \ta = a % n;\n\t\tfor(q = 1;q <= p;q++)\n\t\t{\n\t\t\tr = r * a;\n\t\t}\n\t\tr = r % n;\n\t\tprintf(\""%d %d\"",r,k);\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,45,512
1591659422802567168,e58931e7101319130ba2d901c8c20269b203d6db34a4b0882ef24f3e9b085d3d,2022-11-13 13:09:12,C,8.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include<stdio.h>\nint main()\n{\n\tint a,m,n;\n\tint ans2=0,flag=0;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tif(m==n-1)\n\t\tflag=1; \n\tm%=(n-1);\n\tint ans1=1;\n\twhile(m)\n\t{\n\t\tif(m%2!=0)\n\t\t{\n\t\t\tans1=((ans1%n)*(a%n))%n;\n\t\t\tans2+=1;\n\t\t}\n\t\ta=((a%n)*(a%n))%n;\n\t\tm/=2;\n\t\t\n\t}\n\t\n\tif(flag)\n\t\tprintf(\""1 1\"");\n\telse\n\t\tprintf(\""%d %d\"",ans1,ans2);\n\treturn 0;\n } ",PARTIAL_ACCEPTED,33,640
1591660442215571456,e58931e7101319130ba2d901c8c20269b203d6db34a4b0882ef24f3e9b085d3d,2022-11-13 13:13:15,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\nint main()\n{\n\tint a,m,n,r=0;\n\tint ans1=1,ans2=0;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\ta%=n;\n\tm%=(n-1);\n\tif(!m)\n\t\tr=1;\n\twhile(m)\n\t{\t\n\t\tif(m&1)\n\t\t{\n\t\tans1=((ans1%n)*(a%n))%n;\n\t\tans2+=1;\n\t\t}\n\t\telse\n\t\ta=((a%n)*(a%n))%n;\n\t\tm=m>>1;\n\t\t\n\t}\n\tif(r)\n\t\tprintf(\""1 1\"");\n\telse\n\t\tprintf(\""%d %d\"",ans1,ans2);\n\t\n\treturn 0;\n}",PARTIAL_ACCEPTED,42,628
1591660710877474816,e58931e7101319130ba2d901c8c20269b203d6db34a4b0882ef24f3e9b085d3d,2022-11-13 13:14:19,C,8.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include<stdio.h>\nint main()\n{\n\tint a,m,n;\n\tint ans2=0,flag=0;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tif(m==n-1)\n\t\tflag=1; \n\tm%=(n-1);\n\tint ans1=1;\n\twhile(m)\n\t{\n\t\tif(m&1==1)\n\t\t{\n\t\t\tans1=((ans1%n)*(a%n))%n;\n\t\t\tans2+=1;\n\t\t}\n\t\ta=((a%n)*(a%n))%n;\n\t\tm/=2;\n\t\t\n\t}\n\t\n\tif(flag)\n\t\tprintf(\""1 1\"");\n\telse\n\t\tprintf(\""%d %d\"",ans1,ans2);\n\treturn 0;\n\t\n\t\n\t\n } ",PARTIAL_ACCEPTED,46,512
1591665518506205184,cfaa1748b4ab66f19b9d7d13d82ca11e8c3a7a29da4dfbe42b274fde9dc3d14a,2022-11-13 13:33:25,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n\nint main()\n{\n\tint a,m,n,b,c,d,e,g,h,i,j,k,l,p;\n\tb = 1;\n\tc = 0;\n\td = 0;\n\te = 1;\n\tk = 1;\n\tp = 0;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tfor(i = 2; i <n ; i++)\n\t{\n\t\tif(n % i == 0)\n\t\t    break;\n\t\telse \n\t\t    continue;\n\t}\n\tif(n == i)\n\t    p = 1; \n\tif(p == 1 && m >= n)\n\t\tm = m % (n - 1);\n\twhile(e * 2 <= m)\n\t{\n\t\te *= 2;\n\t\tc++;\n\t}\n\tfor(c; c >= 0; c--)\n\t{\n\t\tfor(l = 1; l <= c; l++)\n\t\t{\n\t\t\tk*= 2;\n\t\t}\n\t\tif(k <= m)\n\t\t{\n\t\t\tg = a;\n\t\t\tm -= k;\n\t\t\td++;\n\t\t}\n\t\telse\n\t\t\tg = 1;\n\t\th = g * b;\n\t\tb = h % n;\n\t\tif(c != 0)\n\t\t{\n\t\t\tb *= b;\n\t\t\tb = b % n;\n\t\t}\n\t}\n\tif(m == 0)\n\t\ta = 1;\n\tb = (b * a) % n;\n\tprintf(\""%d %d\\n\"",b,d);\n\treturn 0;\n}",PARTIAL_ACCEPTED,38,352
1591667920911261696,cfaa1748b4ab66f19b9d7d13d82ca11e8c3a7a29da4dfbe42b274fde9dc3d14a,2022-11-13 13:42:58,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n\nint main()\n{\n\tint a,m,n,b,c,d,e,g,h,i,j,k,l,p,q;\n\tb = 1;\n\tc = 0;\n\td = 0;\n\te = 1;\n\tk = 1;\n\tp = 0;\n\tq = 0;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tfor(i = 2; i <n ; i++)\n\t{\n\t\tif(n % i == 0)\n\t\t    break;\n\t\telse \n\t\t    continue;\n\t}\n\tif(n == i)\n\t    p = 1;\n\tif(p == 1);\n\t{\n\t\tif(a > n && a % n == 0)\n\t\t   q = 1;\n\t\tif(a <= n && n % a == 0)\n\t\t   q = 1;\n    }\n\tif(p == 1 && m >= n)\n\t\t{\n\t    if(q == 0)\n\t\tm = m % (n - 1);\n\t    }\n\twhile(e * 2 <= m)\n\t{\n\t\te *= 2;\n\t\tc++;\n\t}\n\tfor(c; c >= 0; c--)\n\t{\n\t\tfor(l = 1; l <= c; l++)\n\t\t{\n\t\t\tk*= 2;\n\t\t}\n\t\tif(k <= m)\n\t\t{\n\t\t\tg = a;\n\t\t\tm -= k;\n\t\t\td++;\n\t\t}\n\t\telse\n\t\t\tg = 1;\n\t\th = g * b;\n\t\tb = h % n;\n\t\tif(c != 0)\n\t\t{\n\t\t\tb *= b;\n\t\t\tb = b % n;\n\t\t}\n\t}\n\tif(m == 0)\n\t\ta = 1;\n\tb = (b * a) % n;\n\tprintf(\""%d %d\\n\"",b,d);\n\treturn 0;\n}",PARTIAL_ACCEPTED,46,352
1591690307019005952,31c50fe389432cad6a3f867fea9367f95106fc46b903f9c2367d979cfe3f44cb,2022-11-13 15:11:56,C,10.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\nint main()\n{\n\tint a, m, n, g[30], b, i, j, c, d, k=1;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tfor(i=2; i<n; i++)\n\t{\n\t\tif(n%i==0)\n\t\t\tbreak;\n\t\telse if(n%a!=0)\n\t\t\twhile(m>n)\n\t\t\t\tm=m-n+1;\n\t}\n\tfor(i=29; i>=0; i--)\n\t{\n\t\tg[i]=m%2;\n\t\tm=m/2;\n\t}\n\tfor(i=0; i<=29; i++)\n\t{\n\t\tif(g[i]==1)\n\t\t{\n\t\t\tj=i;\n\t\t\tbreak;\n\t\t}\n\t}\n\tb=a%n*(a%n);\n\tfor(j=i+1; j<=28; j++)\n\t{\n\t\tif(g[j]==1)\n\t\t{\n\t\t\tb=b%n*a%n*(b%n*a%n);\n\t\t\tk=k+1;\n\t\t}\n\t\telse\n\t\t\tb=(b%n)*(b%n);\n\t}\n\tif(g[29]==1)\n\t{\n\t\tb=b%n*a%n;\n\t\tk=k+1;\n\t}\n\telse\n\t\tb=b%n;\n\tprintf(\""%d %d\"",b,k);\n\treturn 0;\n}",ACCEPTED,32,476
1591712334270443520,d7571922945c6b6b9605e05e677638e43bc1c66ddf9bbd605053f73cff74bcd9,2022-11-13 16:39:27,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n\nint main()\n{\n\tint a,m,n,b[500],i,c=0,q,s,h,k,prod=1,j=1,p=1,mod,d,r[500],o,t;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\to=m;\n\tfor(i=1; i<=500; i++)\n\t{\n\t\tb[i-1]=m%2;\n\t\tm=m/2;\n\t\tif(b[i-1]==1)\n\t\t{\n\t\t\tc=c+1;\n\t\t}\n\t\tif(m==0)\n\t\t{\n\t\t\tq=i;\n\t\t\tbreak;\n\t\t}\n\t}\n\tfor(i=q; i>=1; i--)\n\t{\n\t\ts=b[i-1];\n\t\tif((i-1)!=0)\n\t\t{\n\t\t\tfor(k=1; k<i; k++)\n\t\t\t{\n\t\t\t\ts=s*2;\n\t\t\t}\n\t\t\th=s;\n\t\t\tif(s!=0)\n\t\t\t{\n\t\t\t\tprod=1;\n\t\t\t\tfor(k=1; k<=h; k++)\n\t\t\t\t{\n\t\t\t\t\tprod=prod*a;\n\t\t\t\t}\n\t\t\t\tp=p*(prod%n);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tp=1;\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif(s!=0)\n\t\t\t{\n\t\t\t\tprod=a;\n\t\t\t\tj=prod%n;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tj=1;\n\t\t\t}\n\t\t}\n\t}\n\tfor(i=2; i<=n-1; i++)\n\t{\n\t\tif(n%i==0)\n\t\t\tbreak;\n\t}\n\tif(n==i&&o>n&&(a%n!=0||n%a!=0))\n\t{\n\t\tc=0;\n\t\td=o%(n-1);\n\t\tfor(t=1; t<=500; t++)\n\t\t{\n\t\t\tr[t-1]=d%2;\n\t\t\td=d/2;\n\t\t\tif(r[t-1]==1)\n\t\t\t{\n\t\t\t\tc=c+1;\n\t\t\t}\n\t\t}\n\t}\n\tmod=(j*p)%n;\n\tprintf(\""%d %d\"",mod,c);\n\treturn 0;\n}",PARTIAL_ACCEPTED,59,608
1591714651208212480,d7571922945c6b6b9605e05e677638e43bc1c66ddf9bbd605053f73cff74bcd9,2022-11-13 16:48:40,C,4.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n\nint main()\n{\n\tint a,m,n,b[500],i,c=0,q,s,h,k,prod=1,j=1,p=1,mod,d,r[500],o,t;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\to=m;\n\tfor(i=2; i<=n-1; i++)\n\t{\n\t\tif(n%i==0)\n\t\t\tbreak;\n\t}\n\tif(n==i&&o>n&&(a%n!=0||n%a!=0))\n\t{\n\t\tc=0;\n\t\td=o%(n-1);\n\t\tfor(t=1; t<=500; t++)\n\t\t{\n\t\t\tr[t-1]=d%2;\n\t\t\td=d/2;\n\t\t\tif(r[t-1]==1)\n\t\t\t{\n\t\t\t\tc=c+1;\n\t\t\t}\n\t\t}\n\t}\n\tfor(i=1; i<=500; i++)\n\t{\n\t\tb[i-1]=m%2;\n\t\tm=m/2;\n\t\tif(b[i-1]==1)\n\t\t{\n\t\t\tc=c+1;\n\t\t}\n\t\tif(m==0)\n\t\t{\n\t\t\tq=i;\n\t\t\tbreak;\n\t\t}\n\t}\n\tfor(i=q; i>=1; i--)\n\t{\n\t\ts=b[i-1];\n\t\tif((i-1)!=0)\n\t\t{\n\t\t\tfor(k=1; k<i; k++)\n\t\t\t{\n\t\t\t\ts=s*2;\n\t\t\t}\n\t\t\th=s;\n\t\t\tif(s!=0)\n\t\t\t{\n\t\t\t\tprod=1;\n\t\t\t\tfor(k=1; k<=h; k++)\n\t\t\t\t{\n\t\t\t\t\tprod=prod*a;\n\t\t\t\t}\n\t\t\t\tp=p*(prod%n);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tp=1;\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif(s!=0)\n\t\t\t{\n\t\t\t\tprod=a;\n\t\t\t\tj=prod%n;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tj=1;\n\t\t\t}\n\t\t}\n\t}\n\tmod=(j*p)%n;\n\tprintf(\""%d %d\"",mod,c);\n\treturn 0;\n}",PARTIAL_ACCEPTED,72,512
1591716763644256256,d7571922945c6b6b9605e05e677638e43bc1c66ddf9bbd605053f73cff74bcd9,2022-11-13 16:57:03,C,4.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n\nint main()\n{\n\tint a,m,n,b[500],i,c=0,q,s,h,k,prod=1,j=1,p=1,mod,d,r[500],o,t;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\to=m;\n\tfor(t=2; t<=n-1; t++)\n\t{\n\t\tif(n%t==0)\n\t\t\tbreak;\n\t}\n\tif(n==t&&o>n&&(a%n!=0||n%a!=0))\n\t{\n\t\td=o%(n-1);\n\t\tfor(t=1; t<=500; t++)\n\t\t{\n\t\t\tr[t-1]=d%2;\n\t\t\td=d/2;\n\t\t\tif(r[t-1]==1)\n\t\t\t{\n\t\t\t\tc=c+1;\n\t\t\t}\n\t\t}\n\t}\n\tfor(i=1; i<=500; i++)\n\t{\n\t\tc=0;\n\t\tb[i-1]=m%2;\n\t\tm=m/2;\n\t\tif(b[i-1]==1)\n\t\t{\n\t\t\tc=c+1;\n\t\t}\n\t\tif(m==0)\n\t\t{\n\t\t\tq=i;\n\t\t\tbreak;\n\t\t}\n\t}\n\tfor(i=q; i>=1; i--)\n\t{\n\t\ts=b[i-1];\n\t\tif((i-1)!=0)\n\t\t{\n\t\t\tfor(k=1; k<i; k++)\n\t\t\t{\n\t\t\t\ts=s*2;\n\t\t\t}\n\t\t\th=s;\n\t\t\tif(s!=0)\n\t\t\t{\n\t\t\t\tprod=1;\n\t\t\t\tfor(k=1; k<=h; k++)\n\t\t\t\t{\n\t\t\t\t\tprod=prod*a;\n\t\t\t\t}\n\t\t\t\tp=p*(prod%n);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tp=1;\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif(s!=0)\n\t\t\t{\n\t\t\t\tprod=a;\n\t\t\t\tj=prod%n;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tj=1;\n\t\t\t}\n\t\t}\n\t}\n\tmod=(j*p)%n;\n\tprintf(\""%d %d\"",mod,c);\n\treturn 0;\n}",PARTIAL_ACCEPTED,65,384
1591718097785249792,761df0ab1b71664976bd02cf76a78c5a0ecd146be5fae1f21cd30babdf2495df,2022-11-13 17:02:21,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\nint main()\n{\n\tint a,m,n,i=1,r,t=1;\n\tscanf(\""%d %d %d\"",&a,&m,&n);\n\twhile(i<=m)\n\t{\n\t\tr=a%n;\n\t\tt=t*r%n;\n\t\ti++;\n\t}\n\tprintf(\""%d\"",t);\n    printf(\""1\"");\n\treturn 0;\n}",MULTIPLE_ERROR,37,356
1591718187107102720,761df0ab1b71664976bd02cf76a78c5a0ecd146be5fae1f21cd30babdf2495df,2022-11-13 17:02:43,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\nint main()\n{\n\tint a,m,n,i=1,r,t=1;\n\tscanf(\""%d %d %d\"",&a,&m,&n);\n\twhile(i<=m)\n\t{\n\t\tr=a%n;\n\t\tt=t*r%n;\n\t\ti++;\n\t}\n\tprintf(\""%d 1\"",t);\n\treturn 0;\n}",PARTIAL_ACCEPTED,43,464
1591719945703317504,d7571922945c6b6b9605e05e677638e43bc1c66ddf9bbd605053f73cff74bcd9,2022-11-13 17:09:42,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n\nint main()\n{\n\tint a,m,n,b[500],i,c=0,q,s,h,k,prod=1,j=1,p=1,mod,d,r[500],o,t;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\to=m;\n\tfor(i=1; i<=500; i++)\n\t{\n\t\tb[i-1]=m%2;\n\t\tm=m/2;\n\t\tif(b[i-1]==1)\n\t\t{\n\t\t\tc=c+1;\n\t\t}\n\t\tif(m==0)\n\t\t{\n\t\t\tq=i;\n\t\t\tbreak;\n\t\t}\n\t}\n\tfor(i=q; i>=1; i--)\n\t{\n\t\ts=b[i-1];\n\t\tif((i-1)!=0)\n\t\t{\n\t\t\tfor(k=1; k<i; k++)\n\t\t\t{\n\t\t\t\ts=s*2;\n\t\t\t}\n\t\t\th=s;\n\t\t\tif(s!=0)\n\t\t\t{\n\t\t\t\tprod=1;\n\t\t\t\tfor(k=1; k<=h; k++)\n\t\t\t\t{\n\t\t\t\t\tprod=prod*a;\n\t\t\t\t}\n\t\t\t\tp=p*(prod%n);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tp=1;\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif(s!=0)\n\t\t\t{\n\t\t\t\tprod=a;\n\t\t\t\tj=prod%n;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tj=1;\n\t\t\t}\n\t\t}\n\t}\n\tfor(t=2; t<=n-1; t++)\n\t{\n\t\tif(n%t==0)\n\t\t\tbreak;\n\t}\n\tif(n==t&&o>n&&(a%n!=0||n%a!=0))\n\t{\n\t\tc=0;\n\t\tif(n==2)\n\t\t{\n\t\t\td=o;\n\t\t}\n\t\telse\n\t\t{\n\t\t\td=o%(n-1);\n\t\t}\n\t\tfor(t=1; t<=500; t++)\n\t\t{\n\t\t\tr[t-1]=d%2;\n\t\t\td=d/2;\n\t\t\tif(r[t-1]==1)\n\t\t\t{\n\t\t\t\tc=c+1;\n\t\t\t}\n\t\t}\n\t}\n\tmod=(j*p)%n;\n\tprintf(\""%d %d\"",mod,c);\n\treturn 0;\n}",PARTIAL_ACCEPTED,30,512
1591724187033808896,cd9820442cdc23dd9add4837ad1874de20e5c069e33f6d103a9b83d630a1f58a,2022-11-13 17:26:33,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint a,m,n,i,o,p,u,y,q;\n\tq=1;\n\ta*n<=pow(2,30);\n\tscanf(\""%d%d%d\"",&a,&m,&n); \n\ti=a;\n\to=m;\n\tfor(i=1;i<=a;i++)\n\t{\n\t\tfor(o=1;o<=m;o++)\n\t\t{\n\t\t\tp=pow(i,o);\n\t\t\tif(o==m&&i==a)\n\t\t\tu=p;\n\t\t}\n\t\ty=u%n;\n\t}\n\tprintf(\""%d%d\"",y,q);\n\treturn 0;\n}",MULTIPLE_ERROR,431,408
1591763914755682304,cfaa1748b4ab66f19b9d7d13d82ca11e8c3a7a29da4dfbe42b274fde9dc3d14a,2022-11-13 20:04:25,C,6.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n\nint main()\n{\n\tint a,m,n,b,c,d,e,g,h,i,j,k,l,p;\n\tb = 1;\n\tc = 0;\n\td = 0;\n\te = 1;\n\tk = 1;\n\tp = 0;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\tfor(i = 2; i < n ; i++)\n\t{\n\t\tif(n % i == 0)\n\t\t\tbreak;\n\t\telse \n\t\t    continue;\n\t}\n\tif(i == n)\n\t    p = 1;\n\tif(p == 1 && m >= n)\n\t\tm = m % (n - 1);\n\twhile(e * 2 <= m)\n\t{\n\t\te *= 2;\n\t\tc++;\n\t}\n\tfor(c; c >= 0; c--)\n\t{\n\t\tfor(l = 1; l <= c; l++)\n\t\t{\n\t\t\tk *= 2;\n\t\t}\n\t\tif(k <= m)\n\t\t{\n\t\t\tg = a;\n\t\t\tm -= k;\n\t\t\td++;\n\t\t}\n\t\telse\n\t\t\tg = 1;\n\t\th = g * b;\n\t\tb = h % n;\n\t\tif(c != 0)\n\t\t{\n\t\t\tb *= b;\n\t\t\tb = b % n;\n\t\t}\n\t}\n\tif(m == 0)\n\t\ta = 1;\n\tb = (b * a) % n;\n\tprintf(\""%d %d\\n\"",b,d);\n\treturn 0;\n}",PARTIAL_ACCEPTED,50,504
1591764275767828480,f65a6719c9fb795058227caa271642d90b0edfefaf2ab9527812bd784685284c,2022-11-13 20:05:51,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint a,m,n;\n\tint i,l;\n\tint k=0,j;\n\tint x,y,z=0;\n\tint s1[16],s2[16],s3[x];\n\n\tdouble c;\n\tscanf(\""%d%d%d%d\"",&a,&m,&n);\n\tif(n<3)\n\t{\n\t\tprintf(\""incorrect value for num!!!\\n\"");\n\t\treturn 1;\n\t}\n\tfor(i=2; i<=(int)  sqrt(n); i++)\n\t{\n\t\tif(n %i==0)\n\t\t{\n\t\t\tprintf(\""%d is not prime\"",n);\n\t\t\tbreak;\n\t\t}\n\t}\n\tif(i==(int)sqrt(n)+1)\n\t\tprintf(\""%d is a prime\"",n);\n\tif(n is a prime&&GCD(a,n)==1&&m>=n)\n\t\tm%=(n-1);\n\tfor(k=0; a>0; k++)\n\t{\n\t\ts2[k]=m%2;\n\t\tm=m/2;\n\t}\n\tfor(j=k-1; j>=0; j--)\n\t{\n\t\ts1[i]=s2[i];\n\t\tm=s1[i];\n\t}\n\ts3[x]=m;\n\tfor(x=0,y=1; x<16; x++)\n\t{\n\t\tc=(pow(a,(pow(2,x))*s2[x]))%n;\n\t\ty=(y*c)&n;\n\t\tif(a*)\n\t\t\tz=z+1;\n\t\telse\n\t\t\tz=z+0;\n\t}\n\tprintf(\""%d%d\"",y,z);\n\treturn 0;\n}",COMPILE_ERROR,0,0
1591765776892485632,cfaa1748b4ab66f19b9d7d13d82ca11e8c3a7a29da4dfbe42b274fde9dc3d14a,2022-11-13 20:11:49,C,8.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\tint a,m,n,x,y,result,i,t,z,k;\n\ti = 0;\n\tx = 0;\n\tresult = 1;\n\tz = 0;\n\tk = 0;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\ty = pow(2,30);\n\tif(a * n <= y)\n\t\tx = 1;\n\tfor(t = 2; t < n; t++)\n\t{\n\t\tif(n % t == 0)\n\t\t\tz = 1;\n\t}\n\tif(z == 1)\n\t{\n\t\tif(a > n&&a % n == 0||a <= n&&n % a ==0)\n\t\t\tk = 1;\n\t}\n\tif(x == 1)\n\t{\n\t\tif(k == 0&&m >= n)\n\t\t\tm %= n-1;\n\t\ta = a % n;\n\t\twhile(m > 0)\n\t\t{\n\t\t\tif(m % 2 == 1)\n\t\t\t{\n\t\t\t\tresult = (result * a) % n;\n\t\t\t\ti++;\n\t\t\t}\n\t\t\tm = m / 2;\n\t\t\ta = (a * a) % n;\n\t\t}\n\t\tprintf(\""%d %d\\n\"",result,i);\n\t}\n    return 0;\n}",PARTIAL_ACCEPTED,72,512
1591767175676059648,f65a6719c9fb795058227caa271642d90b0edfefaf2ab9527812bd784685284c,2022-11-13 20:17:22,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include<stdio.h>\n#include<math.h>\nint main(void)\n{\n\tint a,m,n;\n\tint i,l;\n\tint k=0,j;\n\tint x,y,z=0;\n\tint s1[16],s2[16],s3[x];\n\tint c;\n\tscanf(\""%d%d%d%d\"",&a,&m,&n);\n\tif(n<3)\n\t{\n\t\tprintf(\""incorrect value for num!!!\\n\"");\n\t\treturn 1;\n\t}\n\tfor(i=2; i<=(int)  sqrt(n); i++)\n\t{\n\t\tif(n %i==0)\n\t\t{\n\t\t\tprintf(\""%d is not prime\"",n);\n\t\t\tbreak;\n\t\t}\n\t}\n\tif(i==(int)sqrt(n)+1)\n\t\tprintf(\""%d is a prime\"",n);\n\tif(m>=n)\n\t\tm%=(n-1);\n\tfor(k=0; a>0; k++)\n\t{\n\t\ts2[k]=m%2;\n\t\tm=m/2;\n\t}\n\tfor(j=k-1; j>=0; j--)\n\t{\n\t\ts1[i]=s2[i];\n\t\tm=s1[i];\n\t}\n\ts3[x]=m;\n\tfor(x=0,y=1; x<16; x++)\n\t{\n\t\tc=(pow(a,(pow(2,x))*s2[x]));\n\t\tc=c%n;\n\t\ty=(y*c)%n;\n\t\tif(a*a)\n\t\t\tz=z+1;\n\t\telse\n\t\t\tz=z+0;\n\t}\n\tprintf(\""%d%d\"",y,z);\n\treturn 0;\n}\n",SEGMENTATION_FAULT,46,364
1591767461547225088,f65a6719c9fb795058227caa271642d90b0edfefaf2ab9527812bd784685284c,2022-11-13 20:18:31,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include<stdio.h>\n#include<math.h>\nint main(void)\n{\n\tint a,m,n;\n\tint i,l;\n\tint k=0,j;\n\tint x,y,z=0;\n\tint s1[16],s2[16],s3[x];\n\tint c;\n\tscanf(\""%d%d%d%d\"",&a,&m,&n);\n\tif(n<3)\n\t{\n\t\tprintf(\""incorrect value for num!!!\\n\"");\n\t\treturn 1;\n\t}\n\tfor(i=2; i<=(int)sqrt(n); i++)\n\t{\n\t\tif(n%i==0)\n\t\t{\n\t\t\tprintf(\""%d is not prime\"",n);\n\t\t\tbreak;\n\t\t}\n\t}\n\tif(i==(int)sqrt(n)+1)\n\t\tprintf(\""%d is a prime\"",n);\n\tif(m>=n)\n\t\tm%=(n-1);\n\tfor(k=0; a>0; k++)\n\t{\n\t\ts2[k]=m%2;\n\t\tm=m/2;\n\t}\n\tfor(j=k-1; j>=0; j--)\n\t{\n\t\ts1[i]=s2[i];\n\t\tm=s1[i];\n\t}\n\ts3[x]=m;\n\tfor(x=0,y=1; x<16; x++)\n\t{\n\t\tc=(pow(a,(pow(2,x))*s2[x]));\n\t\tc=c%n;\n\t\ty=(y*c)%n;\n\t\tif(a*a)\n\t\t\tz=z+1;\n\t\telse\n\t\t\tz=z+0;\n\t}\n\tprintf(\""%d%d\"",y,z);\n\treturn 0;\n}",SEGMENTATION_FAULT,57,512
1591767777000873984,f65a6719c9fb795058227caa271642d90b0edfefaf2ab9527812bd784685284c,2022-11-13 20:19:46,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include<stdio.h>\n#include<math.h>\nint main(void)\n{\n\tint a,m,n;\n\tint i,l;\n\tint k=0,j;\n\tint x,y,z=0;\n\tint s1[16],s2[16],s3[x];\n\tint c;\n\tscanf(\""%d%d%d%d\"",&a,&m,&n);\n\tif(m>=n)\n\t\tm%=(n-1);\n\tfor(k=0; a>0; k++)\n\t{\n\t\ts2[k]=m%2;\n\t\tm=m/2;\n\t}\n\tfor(j=k-1; j>=0; j--)\n\t{\n\t\ts1[i]=s2[i];\n\t\tm=s1[i];\n\t}\n\ts3[x]=m;\n\tfor(x=0,y=1; x<16; x++)\n\t{\n\t\tc=(pow(a,(pow(2,x))*s2[x]));\n\t\tc=c%n;\n\t\ty=(y*c)%n;\n\t\tif(a*a)\n\t\t\tz=z+1;\n\t\telse\n\t\t\tz=z+0;\n\t}\n\tprintf(\""%d%d\"",y,z);\n\treturn 0;\n}\n\n",SEGMENTATION_FAULT,41,480
1591768061202673664,f65a6719c9fb795058227caa271642d90b0edfefaf2ab9527812bd784685284c,2022-11-13 20:20:54,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include<stdio.h>\n#include<math.h>\nint main(void)\n{\n\tint a,m,n;\n\tint i,l;\n\tint k=0,j;\n\tint x,y,z=0;\n\tint s1[16],s2[x],s3[x];\n\tint c;\n\tscanf(\""%d%d%d%d\"",&a,&m,&n);\n\tif(m>=n)\n\t\tm%=(n-1);\n\tfor(k=0; a>0; k++)\n\t{\n\t\ts2[k]=m%2;\n\t\tm=m/2;\n\t}\n\tfor(j=k-1; j>=0; j--)\n\t{\n\t\ts1[i]=s2[i];\n\t\tm=s1[i];\n\t}\n\ts3[x]=m;\n\tfor(x=0,y=1; x<16; x++)\n\t{\n\t\tc=(pow(a,(pow(2,x))*s2[x]));\n\t\tc=c%n;\n\t\ty=(y*c)%n;\n\t\tif(a*a)\n\t\t\tz=z+1;\n\t\telse\n\t\t\tz=z+0;\n\t}\n\tprintf(\""%d%d\"",y,z);\n\treturn 0;\n}",SEGMENTATION_FAULT,70,512
1591770247206809600,cfaa1748b4ab66f19b9d7d13d82ca11e8c3a7a29da4dfbe42b274fde9dc3d14a,2022-11-13 20:29:35,C,0.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n    int plus(int);\n\tint a,m,n,x,y,result,i,t,z,k,h,e,c,l,g;\n\ti = 0;\n\tx = 0;\n\tresult = 1;\n\tz = 0;\n\tk = 0;\n    c = 0;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\ty = pow(2,30);\n\tif(a * n <= y)\n\t\tx = 1;\n\tfor(t = 2; t < n; t++)\n\t{\n\t\tif(n % t == 0)\n\t\t\tz = 1;\n\t}\n\tif(z == 1)\n\t{\n\t\tif(a > n&&a % n == 0||a <= n&&n % a ==0)\n\t\t\tk = 1;\n\t}\n\tif(x == 1)\n\t{\n\t\tif(k == 0&&m >= n)\n\t\t\tm %= n-1;\n    h = m;\n    while(e * 2 <= h)\n\t{\n\t\te *= 2;\n\t\tc++;\n\t}\n\tfor(c; c >= 0; c--)\n\t{\n\t\t\n\t\tif(plus(c) <= h)\n\t\t{\n\t\t\th -= plus(c);\n\t\t\ti++;\n\t\t}\n    }\n        a = a % n;\n\t\twhile(m > 0)\n\t\t{\n\t\t\tif(m % 2 == 1)\n\t\t\t{\n\t\t\t\tresult = (result * a) % n;\n\t\t\t}\n\t\t\tm = m / 2;\n\t\t\ta = (a * a) % n;\n\t\t}\n\t\tprintf(\""%d %d\\n\"",result,i);\n\t}\n    return 0;\n}\nint plus(int x)\n    int i,z = 1;\n    for(i = 1;i <=x ;i++)\n    {\n        z *= 2;\n    }\n    return z;\n          ",COMPILE_ERROR,0,0
1591773909257871360,cfaa1748b4ab66f19b9d7d13d82ca11e8c3a7a29da4dfbe42b274fde9dc3d14a,2022-11-13 20:44:08,C,8.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\tint plus(int);\n\tint a,m,n,x,y,result,i,t,z,k,g,h,j;\n\ti = 0;\n\tx = 0;\n\tresult = 1;\n\tz = 0;\n\tk = 0;\n\th = 1;\n\tj = 0;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\ty = pow(2,30);\n\tif(a * n <= y)\n\t\tx = 1;\n\tfor(t = 2; t < n; t++)\n\t{\n\t\tif(n % t == 0)\n\t\t\tz = 1;\n\t}\n\tif(z == 0)\n\t{\n\t\tif(a > n&&a % n == 0||a <= n&&n % a ==0)\n\t\t\tk = 1;\n\t}\n\tif(x == 1)\n\t{\n\t\tif(k == 0&&m >= n)\n\t\t\tm %= n-1;\n\t\tg = m;\n\twhile(h * 2 <= g)\n\t{\n\t\th *= 2;\n\t\tj++;\n\t}\t\n\tfor(j;j >= 0;j--)\n\t{\n\t\tif(plus(j) <= g)\n\t\t{\n\t\t\tg -= plus(j);\n\t\t\ti++;\n\t\t}\n\t}\n\t\ta = a % n;\n\t\twhile(m > 0)\n\t\t{\n\t\t\tif(m % 2 == 1)\n\t\t\t{\n\t\t\t\tresult = (result * a) % n;\n\t\t\t}\n\t\t\tm = m / 2;\n\t\t\ta = (a * a) % n;\n\t\t}\n\t\tprintf(\""%d %d\\n\"",result,i);\n\t}\n    return 0;\n}\nint plus(int x)\n{\n\tint m,n = 1;\n\tfor(m = 1;m <= x;m++)\n\t{\n\t\tn *= 2;\n\t}\n\treturn n;\n}\n          ",PARTIAL_ACCEPTED,37,352
1591775890164690944,cfaa1748b4ab66f19b9d7d13d82ca11e8c3a7a29da4dfbe42b274fde9dc3d14a,2022-11-13 20:52:00,C,8.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\tint plus(int);\n\tint a,m,n,x,y,r,i,t,z,k,g,h,j,b,c;\n\ti = 0;\n\tx = 0;\n\tr = 1;\n\tz = 0;\n\tk = 0;\n\th = 1;\n\tj = 0;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\ty = pow(2,30);\n\tif(a * n <= y)\n\t\tx = 1;\n\tfor(t = 2; t < n; t++)\n\t{\n\t\tif(n % t == 0)\n\t\t\tz = 1;\n\t}\n\tif(z == 0)\n\t{\n\t\tif(a > n&&a % n == 0||a <= n&&n % a ==0)\n\t\t\tk = 1;\n\t}\n\tif(x == 1)\n\t{\n\t\tif(k == 0&&m >= n)\n\t\t\tm %= n-1;\n\t\tg = m;\n\twhile(h * 2 <= g)\n\t{\n\t\th *= 2;\n\t\tj++;\n\t}\t\n\tfor(j;j >= 0;j--)\n\t{\n\t\tif(plus(j) <= g)\n\t\t{\n\t\t\tb = a;\n\t\t\tg -= plus(j);\n\t\t\ti++;\n\t\t}\n\t\telse\n\t\t    b = 1;\n\t\tc = b * r;\n\t\tr = c % n;\n\t\tif(j !=  0)\n\t\t{\n\t\t\tr *= r;\n\t\t\tr %= n;\n\t\t}\n\t}\n\t\tprintf(\""%d %d\\n\"",r,i);\n\t}\n    return 0;\n}\nint plus(int x)\n{\n\tint m,n = 1;\n\tfor(m = 1;m <= x;m++)\n\t{\n\t\tn *= 2;\n\t}\n\treturn n;\n}",PARTIAL_ACCEPTED,56,512
1591777299287302144,cfaa1748b4ab66f19b9d7d13d82ca11e8c3a7a29da4dfbe42b274fde9dc3d14a,2022-11-13 20:57:36,C,8.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\tint plus(int);\n\tint a,m,n,x,y,r,i,t,z,k,g,h,j,b,c;\n\ti = 0;\n\tx = 0;\n\tr = 1;\n\tz = 0;\n\tk = 0;\n\th = 1;\n\tj = 0;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\ty = pow(2,30);\n\tif(a * n <= y)\n\t\tx = 1;\n\tfor(t = 2; t < n; t++)\n\t{\n\t\tif(n % t == 0)\n\t\t\tz = 1;\n\t}\n\tif(z == 0)\n\t{\n\t\tif(a > n&&a % n == 0||a <= n&&n % a ==0)\n\t\t\tk = 1;\n\t}\n\tif(x == 1)\n\t{\n\t\tif(k == 0&&m >= n)\n\t\t\tm %= n-1;\n\t\tg = m;\n\twhile(h * 2 <= g)\n\t{\n\t\th *= 2;\n\t\tj++;\n\t}\t\n\tfor(j;j >= 0;j--)\n\t{\n\t\tif(plus(j) <= g)\n\t\t{\n\t\t\tb = a;\n\t\t\tg -= plus(j);\n\t\t\ti++;\n\t\t}\n\t\telse\n\t\t    b = 1;\n\t\tc = b * r;\n\t\tr = c % n;\n\t\tif(j !=  0)\n\t\t{\n\t\t\tr *= r;\n\t\t\tr %= n;\n\t\t}\n\t}\n\tif(g == 0)\n\t    a = 1;\n\tr =(r * a) % n;\n\tprintf(\""%d %d\\n\"",r,i);\n\t}\n    return 0;\n}\nint plus(int x)\n{\n\tint m,n = 1;\n\tfor(m = 1;m <= x;m++)\n\t{\n\t\tn *= 2;\n\t}\n\treturn n;\n}",PARTIAL_ACCEPTED,32,352
1591782630096658432,cfaa1748b4ab66f19b9d7d13d82ca11e8c3a7a29da4dfbe42b274fde9dc3d14a,2022-11-13 21:18:47,C,2.0,1590465721153478656,1590379064198819840,1049226397448056832,"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\tint plus(int),ab(int);\n\tint a,m,n,x,y,r,i,t,z,k,g,h,j,result;\n\ti = 0;\n\tx = 0;\n\tr = 1;\n\tz = 0;\n\tk = 0;\n\th = 1;\n\tj = 0;\n\tresult = 1;\n\tscanf(\""%d%d%d\"",&a,&m,&n);\n\ty = pow(2,30);\n\tif(a * n <= y)\n\t\tx = 1;\n\tif(x == 1)\n\t{\n\t\tif(ab(n) == 0&&m >= n)\n\t\t\tm %= n-1;\n\t\tg = m;\n\t\twhile(h * 2 <= g)\n\t\t{\n\t\t\th *= 2;\n\t\t\tj++;\n\t\t}\n\t\tfor(j; j >= 0; j--)\n\t\t{\n\t\t\tif(plus(j) <= g)\n\t\t\t{\n\t\t\t\tg -= plus(j);\n\t\t\t\ti++;\n\t\t\t}\n\t\t\twhile(m > 0)\n\t\t\t{\n\t\t\t\tif(m % 2 == 1)\n\t\t\t\t{\n\t\t\t\t\tresult = (result * a) % n;\n\t\t\t\t}\n\t\t\t\tm = m / 2;\n\t\t\t\ta = (a * a) % n;\n\t\t\t}\n\t\t}\n\t\tprintf(\""%d %d\\n\"",r,i);\n\t}\n\treturn 0;\n}\n    int ab(int x)\n\t{\n\t\tint a; \n\t\tfor(a = 2; a < x; a++)\n\t\t{\n\t\t\tif(x % a == 0)\n\t\t\t\tbreak;\n\t\t\telse\n\t\t\t\tcontinue;\n\t\t}\n\t\tif(a == x)\n\t\t\treturn 1;\n\t\telse\n\t\t\treturn 0;\n\t}\n\tint plus(int x)\n\t{\n\t\tint m,n = 1;\n\t\tfor(m = 1; m <= x; m++)\n\t\t{\n\t\t\tn *= 2;\n\t\t}\n\t\treturn n;\n    }",PARTIAL_ACCEPTED,42,476
1277067677263134720,7128d1c2518227e6089accad9ced68f609c050aa6eaaf488d37fea130791f038,2020-06-28 10:33:55,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nchar* DtoB(int d,int b){//10进制转换为b进制,2<=b<=20\n\tchar* a=new char[20];\n\ta[19]='\\0';\n\tint i;\n\tfor(i=18;d;i--){\n\t\ta[i]=d%b+'0';\n\t\tif(a[i]>'9'){\n\t\t\ta[i]+='A'-'9'-1;\n\t\t}\n\t\td=d/b;\n\t}\n\tif(i==18){\n\t\ta[i]='0';\n\t\ti--;\n\t}\n\treturn a+i+1;\n}\nbool isPalin(char* str){//是否为回文\n\tint len=strlen(str);\n\tfor(int i=0,j=len-1;i<=j;i++,j--){\n\t\tif(str[i]!=str[j])\n\t\t\treturn false;\n\t}\n\treturn true;\n}\nint main(){\n\tint b=0;\n\tcin>>b;\n\t//,输出所有的大于等于1小于等于300且它的平方用B\n\tfor(int i=1;i<=300;i++){\n\t\tchar* str=DtoB(i*i,b);\n\t\tif(isPalin(str)){\n\t\t\tcout<<DtoB(i,b)<<\"" \""<<str<<\""\\n\"";\n\t\t}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1277067747077324800,5315b7ff5250304943ea4a5b4a678bbf5a039dcdfd7d1601ffca54b6a99961d7,2020-06-28 10:34:12,C++,70.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\n\nusing namespace std;\n\nint b;\n\ninline bool check(int i,const int &b) {\n\tint num[11],len=0;\n\twhile(i) {\n\t\tnum[++len]=i%b;\n\t\ti/=b;\n\t}\n\tfor(int i=1; i<=len>>1; ++i)\n\t\tif(num[i]!=num[len-i+1]) return 0;\n\treturn 1;\n}\n\ninline void transfer(const int &i,const int &b) {\n\tif(i>=b) transfer(i/b,b);\n\tchar c=i%b;\n\tif(c<10) putchar(c+48);\n\telse putchar(c+55);\t\n}\n\nint main() {\n\tcin>>b;\n\tfor(int i=1; i<=300; ++i)\n\t\tif(check(i*i,b)) transfer(i,b),putchar(' '),transfer(i*i,b),putchar('\\n');\n\treturn 0;\n}",PARTIAL_ACCEPTED,48,424
1277067818661511168,7128d1c2518227e6089accad9ced68f609c050aa6eaaf488d37fea130791f038,2020-06-28 10:34:29,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string.h>\nusing namespace std;\nchar* DtoB(int d,int b){//10进制转换为b进制,2<=b<=20\n\tchar* a=new char[20];\n\ta[19]='\\0';\n\tint i;\n\tfor(i=18;d;i--){\n\t\ta[i]=d%b+'0';\n\t\tif(a[i]>'9'){\n\t\t\ta[i]+='A'-'9'-1;\n\t\t}\n\t\td=d/b;\n\t}\n\tif(i==18){\n\t\ta[i]='0';\n\t\ti--;\n\t}\n\treturn a+i+1;\n}\nbool isPalin(char* str){//是否为回文\n\tint len=strlen(str);\n\tfor(int i=0,j=len-1;i<=j;i++,j--){\n\t\tif(str[i]!=str[j])\n\t\t\treturn false;\n\t}\n\treturn true;\n}\nint main(){\n\tint b=0;\n\tcin>>b;\n\t//,输出所有的大于等于1小于等于300且它的平方用B\n\tfor(int i=1;i<=300;i++){\n\t\tchar* str=DtoB(i*i,b);\n\t\tif(isPalin(str)){\n\t\t\tcout<<DtoB(i,b)<<\"" \""<<str<<\""\\n\"";\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,48,512
1277067859375620096,5315b7ff5250304943ea4a5b4a678bbf5a039dcdfd7d1601ffca54b6a99961d7,2020-06-28 10:34:39,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\n\nusing namespace std;\n\nint b;\n\ninline bool check(int i,const int &b) {\n\tint num[21],len=0;\n\twhile(i) {\n\t\tnum[++len]=i%b;\n\t\ti/=b;\n\t}\n\tfor(int i=1; i<=len>>1; ++i)\n\t\tif(num[i]!=num[len-i+1]) return 0;\n\treturn 1;\n}\n\ninline void transfer(const int &i,const int &b) {\n\tif(i>=b) transfer(i/b,b);\n\tchar c=i%b;\n\tif(c<10) putchar(c+48);\n\telse putchar(c+55);\t\n}\n\nint main() {\n\tcin>>b;\n\tfor(int i=1; i<=300; ++i)\n\t\tif(check(i*i,b)) transfer(i,b),putchar(' '),transfer(i*i,b),putchar('\\n');\n\treturn 0;\n}",ACCEPTED,78,492
1277067948571680768,7128d1c2518227e6089accad9ced68f609c050aa6eaaf488d37fea130791f038,2020-06-28 10:35:00,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string.h>\nusing namespace std;\nchar* DtoB(int d,int b){//10进制转换为b进制,2<=b<=20\n\tchar* a=new char[20];\n\ta[19]='\\0';\n\tint i;\n\tfor(i=18;d;i--){\n\t\ta[i]=d%b+'0';\n\t\tif(a[i]>'9'){\n\t\t\ta[i]+='A'-'9'-1;\n\t\t}\n\t\td=d/b;\n\t}\n\tif(i==18){\n\t\ta[i]='0';\n\t\ti--;\n\t}\n\treturn a+i+1;\n}\nbool isPalin(char* str){//是否为回文\n\tint len=strlen(str);\n\tfor(int i=0,j=len-1;i<=j;i++,j--){\n\t\tif(str[i]!=str[j])\n\t\t\treturn false;\n\t}\n\treturn true;\n}\nint main(){\n\tint N,S;\n\tcin>>N>>S;\n\tfor(int i=S+1,j=0;j<N;i++){\n\t\tint l=0;\n\t\tfor(int k=2;k<=10 && l<2;k++){\n\t\t\tif(isPalin(DtoB(i,k)))\n\t\t\t\tl++;\n\t\t}\n\t\tif(l==2){\n\t\t\tcout<<i<<\""\\n\"";\n\t\t\tj++;\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,38,1024
1277067957778186240,5315b7ff5250304943ea4a5b4a678bbf5a039dcdfd7d1601ffca54b6a99961d7,2020-06-28 10:35:02,C++,60.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\n\nusing namespace std;\n\nint n,s;\n\ninline bool palindrome(int num,const int &b) {\n\tint res[11],len=0;\n\twhile(num) {\n\t\tres[++len]=num%b;\n\t\tnum/=b;\n\t}\n\tfor(int i=1; i<=len>>1; ++i)\n\t\tif(res[i]!=res[len-i+1]) return 0;\n\treturn 1; \n}\n\ninline bool check(const int &i) {\n\tint cnt=0;\n\tfor(int j=2; j<=10; ++j)\n\t\tif(palindrome(i,j)) ++cnt;\n\treturn cnt>1;\n} \n\nint main() {\n\tcin>>n>>s;\n\tfor(int i=s+1; n; ++i) \n\t\tif(check(i)) --n,cout<<i<<'\\n';\t\n\treturn 0;\n}",PARTIAL_ACCEPTED,41,488
1277068006968975360,5315b7ff5250304943ea4a5b4a678bbf5a039dcdfd7d1601ffca54b6a99961d7,2020-06-28 10:35:14,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\n\nusing namespace std;\n\nint n,s;\n\ninline bool palindrome(int num,const int &b) {\n\tint res[21],len=0;\n\twhile(num) {\n\t\tres[++len]=num%b;\n\t\tnum/=b;\n\t}\n\tfor(int i=1; i<=len>>1; ++i)\n\t\tif(res[i]!=res[len-i+1]) return 0;\n\treturn 1; \n}\n\ninline bool check(const int &i) {\n\tint cnt=0;\n\tfor(int j=2; j<=10; ++j)\n\t\tif(palindrome(i,j)) ++cnt;\n\treturn cnt>1;\n} \n\nint main() {\n\tcin>>n>>s;\n\tfor(int i=s+1; n; ++i) \n\t\tif(check(i)) --n,cout<<i<<'\\n';\t\n\treturn 0;\n}",ACCEPTED,33,384
1277069555375988736,485ab61fc25e0ae4e4433cb9631321cbc61d9406baf84a0ecea90d4f4ffd8dbc,2020-06-28 10:41:23,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"/* Use the slash-star style comments or the system won't see your\n   identification information */\n/*\nID: b1257741\nTASK: palsquare\nLANG: C++                 \n*/\n/* LANG can be C++11 or C++14 for those more recent releases */\n#include<iostream>\n#include<fstream>\nusing namespace std;\n\n//ifstream fin(\""palsquare.in\"");\n//ofstream fout(\""palsquare.out\"");\nstring Digit = \""0123456789ABCDEFGHIJK\"";\n\nstring Trans(int x, int k) {\n   string t = \""\"";\n   while(x) {\n      t += Digit[x % k];\n      x /= k;\n   }\n   return t;\n}\nstring Rerv(string x) {\n   string t = \""\"";\n   for (int i = 0; i < x.length(); ++i)\n      t += x[x.length()-1-i];\n   return t;\n}\nbool Test(string x) {\n   for (int i = 0; i < x.length()/2+1; ++i)\n      if(x[i] != x[x.length()-i-1])\n         return false;\n   return true;\n}\n\nint main() {\n   int b;\n   string ans;\n   cin >> b;\n   for (int i = 1; i <= 300; ++i) {\n      ans = Trans(i*i, b);\n      if(Test(ans))\n         cout << Rerv(Trans(i, b)) << ' ' << ans << '\\n';\n   }\nreturn 0;\n}",ACCEPTED,28,532
1277069782048759808,485ab61fc25e0ae4e4433cb9631321cbc61d9406baf84a0ecea90d4f4ffd8dbc,2020-06-28 10:42:17,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"/* Use the slash-star style comments or the system won't see your\n   identification information */\n/*\nID: b1257741\nTASK: dualpal\nLANG: C++                 \n*/\n/* LANG can be C++11 or C++14 for those more recent releases */\n#include<iostream>\n#include<fstream>\nusing namespace std;\n//ifstream fin(\""dualpal.in\"");\n//ofstream fout(\""dualpal.out\"");\nstring Trans(int x, int k) {\n   string t = \""\"";\n   while(x) {\n      t += (x % k + '0');\n      x /= k;\n   }\n   return t;\n}\nbool Test(string x) {\n   for (int i = 0; i < x.length()/2+1; ++i)\n      if(x[i] != x[x.length()-i-1])\n         return false;\n   return true;\n}\n\nint main() {\n   int cnt = 0, n, s;\n   cin >> n >>s;\n   while(cnt < n) {\n      s++;\n      int t = 0;\n      for(int i = 2; i <= 10; ++i)\n         if(Test(Trans(s, i))) {\n            ++t;\n            if(t >= 2) {\n               cout << s << '\\n';\n               ++cnt;\n               break;\n            }\n         }\n   }\nreturn 0;\n}",ACCEPTED,51,512
1277071306061709312,2ae17ef3d46d69228c571dc2149bcfaf6a08711992aba3b929151c6f4a743e38,2020-06-28 10:48:20,Python,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"def trans_b(b,num):\n    b_num=''\n    while num:\n        tmp=num%b\n        if tmp>9:\n            tmp=chr(tmp-10+ord('A'))\n        b_num+=str(tmp)\n        num=num//b\n    return b_num[::-1]\n\nb=eval(input())\n\nfor num in range(1,301):\n    n=trans_b(b,num**2)\n    if n==n[::-1]:\n        print(trans_b(b,num),n)",ACCEPTED,192,2944
1277071421010796544,2ae17ef3d46d69228c571dc2149bcfaf6a08711992aba3b929151c6f4a743e38,2020-06-28 10:48:48,Python,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"def trans_b(b,num):\n    b_num=''\n    while num:\n        tmp=num%b\n        if tmp>9:\n            tmp=chr(tmp-10+ord('A'))\n        b_num+=str(tmp)\n        num=num//b\n    return b_num[::-1]\n\nn,s=input().split()\nn,s=int(n),int(s)+1\ncnt=0\nwhile True:\n    count=0\n    for i in range(2,11):\n        num=trans_b(i,s)\n        if num==num[::-1]:\n            count+=1\n        if count==2:\n            print(s)\n            cnt+=1\n            break\n    s+=1\n    if cnt==n:\n        break",ACCEPTED,306,3048
1277072893484138496,a8d1ad8dab6d79559803421f085ddff501fff054dac4169c3e1c4a77ed36aab6,2020-06-28 10:54:39,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<stdio.h> \nusing namespace std;\nint f[105],rp,n,s;\n\nint check(int k,int x)\n{\n    f[0]=0;\n    while (x)\n          {\n            f[++f[0]]=x%k;\n            x=x/k;\n          }  //转换成k进制 \n    int l=1,r=f[0];\n    while (f[r]==0 && r!=1) \n\t\t\tr--;  //首位数不能为零 \n    while (l<r)\n          {\n               if (f[l]!=f[r]) return 0;\n               l++; \n\t\t\t   r--;\n          }   //判断是否是回文数 \n    return 1;\n}\n\nint main()\n{\n    scanf(\""%d%d\"",&n,&s);\n    while (n!=0)\n    {\n        s++;\n        rp=0;\n\n        for (int k=2; k<=10; k++)\n            if (check(k,s)) \n\t\t\t\trp++;  //大于s且是回文的k进制 有rp种 \n\n        if (rp>=2)\n            {\n                  printf(\""%d\\n\"",s);\n                  n--;\n            }\n    }\n    return 0;\n}\n",ACCEPTED,55,384
1277085667736092672,c240bacda90ae5891eb3728595e49fcdb5f933005c8b76b8708e4b6f99df2117,2020-06-28 11:45:24,C++,40.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<vector>\n#include <algorithm>\nusing namespace std;\n\nstring transform(int n, int hex) {\n\tstring s = \""\"";\n\tvector<string> numbers;\n\twhile (n >= hex) {\n\t\tif ((n % hex) == 10) {\n\t\t\tnumbers.push_back(\""A\"");\n\t\t}\n\t\telse if ((n % hex) == 11) {\n\t\t\tnumbers.push_back(\""B\"");\n\t\t}\n\t\telse if ((n % hex) == 12) {\n\t\t\tnumbers.push_back(\""C\"");\n\t\t}\n\t\telse if ((n % hex) == 13) {\n\t\t\tnumbers.push_back(\""D\"");\n\t\t}\n\t\telse if ((n % hex) == 14) {\n\t\t\tnumbers.push_back(\""E\"");\n\t\t}\n\t\telse if ((n % hex) == 15) {\n\t\t\tnumbers.push_back(\""F\"");\n\t\t}\n\t\telse if ((n % hex) == 16) {\n\t\t\tnumbers.push_back(\""G\"");\n\t\t}\n\t\telse if ((n % hex) == 17) {\n\t\t\tnumbers.push_back(\""H\"");\n\t\t}\n\t\telse if ((n % hex) == 18) {\n\t\t\tnumbers.push_back(\""I\"");\n\t\t}\n\t\telse if ((n % hex) == 19) {\n\t\t\tnumbers.push_back(\""J\"");\n\t\t}\n\t\telse {\n\t\t\tnumbers.push_back((to_string(n % hex)));//存储余数，但是要注意十进制后的余数表示啊！\n\t\t}\n\t\tn = (n / hex);\n\t}\n\tnumbers.push_back(to_string(n));\n\n\tfor (size_t i = 0; i < numbers.size(); i++) {\n\t\tsize_t place = numbers.size() - 1 - i;\n\t\ts += numbers[place];\n\t}\n\treturn s;\n}\n\nint main() {\n\tint Hex;\n\tcin >> Hex;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tint square = i * i;\n\t\tstring s1 = transform(square, Hex);\n\t\tstring s2 = s1;\n\t\treverse(s1.begin(), s1.end());\n\t\tif (s1 == s2) {\n\t\t\tstring s3 = transform(i, Hex);\n\t\t\tcout << s3 << \"" \"" << s2 << endl;\n\t\t}\n\t}\n}",PARTIAL_ACCEPTED,50,424
1277085807045697536,c240bacda90ae5891eb3728595e49fcdb5f933005c8b76b8708e4b6f99df2117,2020-06-28 11:45:58,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<vector>\n#include<string>\nusing namespace std;\n\nstring transform(int n, int hex) {\n\tstring s = \""\"";\n\tvector<string> numbers;\n\twhile (n >= hex) {\n\t\tnumbers.push_back((to_string(n % hex)));//存储余数\n\t\tn = (n / hex);\n\t}\n\tnumbers.push_back(to_string(n));\n\n\tfor (size_t i = 0; i < numbers.size(); i++) {\n\t\tsize_t place = numbers.size() - 1 - i;\n\t\ts += numbers[place];\n\t}\n\treturn s;\n}\n\nbool judge(string a) {\n\tstring s2 = a;\n\treverse(s2.begin(), s2.end());\n\tif (a == s2) {\n\t\treturn true;\n\t}\n\telse {\n\t\treturn false;\n\t}\n}\n\nint main() {\n\tint number, began;\n\tcin >> number >> began;\n\tvector<int> answers;\n\twhile (answers.size() < number) {\n\t\tint count = 0;\n\t\tint now = began + 1;\n\t\tfor (int i = 2; i <= 10; i++) {\n\t\t\tstring now1=transform(now, i);\n\t\t\tif (judge(now1)) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tif (count >= 2) {\n\t\t\tanswers.push_back(now);\n\t\t}\n\t\tbegan += 1;\n\t}\n\tfor (size_t i = 0; i < answers.size(); i++) {\n\t\tcout << answers[i] << endl;\n\t}\n}",COMPILE_ERROR,0,0
1277085877287714816,c240bacda90ae5891eb3728595e49fcdb5f933005c8b76b8708e4b6f99df2117,2020-06-28 11:46:14,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<vector>\n#include<string>\nusing namespace std;\n\nstring transform(int n, int hex) {\n\tstring s = \""\"";\n\tvector<string> numbers;\n\twhile (n >= hex) {\n\t\tnumbers.push_back((to_string(n % hex)));//存储余数\n\t\tn = (n / hex);\n\t}\n\tnumbers.push_back(to_string(n));\n\n\tfor (size_t i = 0; i < numbers.size(); i++) {\n\t\tsize_t place = numbers.size() - 1 - i;\n\t\ts += numbers[place];\n\t}\n\treturn s;\n}\n\nbool judge(string a) {\n\tstring s2 = a;\n\treverse(s2.begin(), s2.end());\n\tif (a == s2) {\n\t\treturn true;\n\t}\n\telse {\n\t\treturn false;\n\t}\n}\n\nint main() {\n\tint number, began;\n\tcin >> number >> began;\n\tvector<int> answers;\n\twhile (answers.size() < number) {\n\t\tint count = 0;\n\t\tint now = began + 1;\n\t\tfor (int i = 2; i <= 10; i++) {\n\t\t\tstring now1=transform(now, i);\n\t\t\tif (judge(now1)) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tif (count >= 2) {\n\t\t\tanswers.push_back(now);\n\t\t}\n\t\tbegan += 1;\n\t}\n\tfor (size_t i = 0; i < answers.size(); i++) {\n\t\tcout << answers[i] << endl;\n\t}\n}",COMPILE_ERROR,0,0
1277085966420860928,c240bacda90ae5891eb3728595e49fcdb5f933005c8b76b8708e4b6f99df2117,2020-06-28 11:46:36,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<vector>\n#include<string>\nusing namespace std;\n\nstring transform(int n, int hex) {\n\tstring s = \""\"";\n\tvector<string> numbers;\n\twhile (n >= hex) {\n\t\tnumbers.push_back((to_string(n % hex)));//存储余数\n\t\tn = (n / hex);\n\t}\n\tnumbers.push_back(to_string(n));\n\n\tfor (size_t i = 0; i < numbers.size(); i++) {\n\t\tsize_t place = numbers.size() - 1 - i;\n\t\ts += numbers[place];\n\t}\n\treturn s;\n}\n\nbool judge(string a) {\n\tstring s2 = a;\n\treverse(s2.begin(), s2.end());\n\tif (a == s2) {\n\t\treturn true;\n\t}\n\telse {\n\t\treturn false;\n\t}\n}\n\nint main() {\n\tint number, began;\n\tcin >> number >> began;\n\tvector<int> answers;\n\twhile (answers.size() < number) {\n\t\tint count = 0;\n\t\tint now = began + 1;\n\t\tfor (int i = 2; i <= 10; i++) {\n\t\t\tstring now1=transform(now, i);\n\t\t\tif (judge(now1)) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tif (count >= 2) {\n\t\t\tanswers.push_back(now);\n\t\t}\n\t\tbegan += 1;\n\t}\n\tfor (size_t i = 0; i < answers.size(); i++) {\n\t\tcout << answers[i] << endl;\n\t}\n}",COMPILE_ERROR,0,0
1277090210821636096,c240bacda90ae5891eb3728595e49fcdb5f933005c8b76b8708e4b6f99df2117,2020-06-28 12:03:28,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<vector>\n#include<string>\nusing namespace std;\n\nstring transform(int n, int hex) {\n\tstring s = \""\"";\n\tvector<string> numbers;\n\twhile (n >= hex) {\n\t\tnumbers.push_back((to_string(n % hex)));//存储余数\n\t\tn = (n / hex);\n\t}\n\tnumbers.push_back(to_string(n));\n\n\tfor (size_t i = 0; i < numbers.size(); i++) {\n\t\tsize_t place = numbers.size() - 1 - i;\n\t\ts += numbers[place];\n\t}\n\treturn s;\n}\n\nbool judge(string a) {\n\tstring s2 = a;\n\treverse(s2.begin(), s2.end());\n\tif (a == s2) {\n\t\treturn true;\n\t}\n\telse {\n\t\treturn false;\n\t}\n}\n\nint main() {\n\tint number, began;\n\tcin >> number >> began;\n\tvector<int> answers;\n\twhile (answers.size() < number) {\n\t\tint count = 0;\n\t\tint now = began + 1;\n\t\tfor (int i = 2; i <= 10; i++) {\n\t\t\tstring now1=transform(now, i);\n\t\t\tif (judge(now1)) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tif (count >= 2) {\n\t\t\tanswers.push_back(now);\n\t\t}\n\t\tbegan += 1;\n\t}\n\tfor (size_t i = 0; i < answers.size(); i++) {\n\t\tcout << answers[i] << endl;\n\t}\n}",COMPILE_ERROR,0,0
1277090389280874496,c240bacda90ae5891eb3728595e49fcdb5f933005c8b76b8708e4b6f99df2117,2020-06-28 12:04:10,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<vector>\n#include<string>\n#include <algorithm>\nusing namespace std;\n\nstring transform(int n, int hex) {\n\tstring s = \""\"";\n\tvector<string> numbers;\n\twhile (n >= hex) {\n\t\tnumbers.push_back((to_string(n % hex)));//存储余数\n\t\tn = (n / hex);\n\t}\n\tnumbers.push_back(to_string(n));\n\n\tfor (size_t i = 0; i < numbers.size(); i++) {\n\t\tsize_t place = numbers.size() - 1 - i;\n\t\ts += numbers[place];\n\t}\n\treturn s;\n}\n\nbool judge(string a) {\n\tstring s2 = a;\n\treverse(s2.begin(), s2.end());\n\tif (a == s2) {\n\t\treturn true;\n\t}\n\telse {\n\t\treturn false;\n\t}\n}\n\nint main() {\n\tint number, began;\n\tcin >> number >> began;\n\tvector<int> answers;\n\twhile (answers.size() < number) {\n\t\tint count = 0;\n\t\tint now = began + 1;\n\t\tfor (int i = 2; i <= 10; i++) {\n\t\t\tstring now1=transform(now, i);\n\t\t\tif (judge(now1)) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tif (count >= 2) {\n\t\t\tanswers.push_back(now);\n\t\t}\n\t\tbegan += 1;\n\t}\n\tfor (size_t i = 0; i < answers.size(); i++) {\n\t\tcout << answers[i] << endl;\n\t}\n}",ACCEPTED,87,424
1277093457963704320,5ac39ba02af0618a867d504fb527328a3cec05c67630fa19318baf6357ade0dc,2020-06-28 12:16:22,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint n,t;\nint s1[1000000];\nvoid tran(int a,int b)\n{\n\tint x=0;\n\twhile (a)\n\t{\n\t\tx++;\n\t\ts1[x]=a%b;\n\t\ta/=b;\n\t}\n\ts1[0]=x;\n}\nvoid print(int p[])\n{\n\tfor (int k=p[0];k>0;k--)\n\t{\n\t\tif(p[k]>=0&&p[k]<=9) cout<<p[k];\n\t\telse cout<<(char)(p[k]+55);\n\t}\n}\nint main()\n{\n\tint flag=0;\n\tcin>>n;\n\tfor (int i=1;i<=300;i++)\n\t{\n\t\tt=i*i;\n\t\ttran(t,n);\n\t\tfor (int j=1;j<=s1[0];j++)\n\t\t{\n\t\t\tif (s1[j]!=s1[s1[0]-j+1]) flag++;\n\t\t}\n\t\tif (flag==0)\n\t\t{\n\t\t\ttran(i,n);\n\t\t\tprint(s1);\n\t\t\tcout<<\"" \"";\n\t\t\ttran(t,n);\n\t\t\tprint(s1);\n\t\t\tcout<<endl;\n\t\t}\n\t\tflag=0;\n\t}\n}\n",ACCEPTED,24,424
1277093535696740352,5ac39ba02af0618a867d504fb527328a3cec05c67630fa19318baf6357ade0dc,2020-06-28 12:16:40,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint t=0;\nint s1[1000000];\nvoid tran(int a,int b)\n{\n\tint x=0;\n\twhile (a)\n\t{\n\t\tx++;\n\t\ts1[x]=a%b;\n\t\ta/=b;\n\t}\n\ts1[0]=x;\n}\nvoid check(int p[])\n{\n\tint x=0;\n\tfor (int y=1;y<p[0]+1;y++)\n\t{\n\t\tif (p[y]!=p[p[0]-y+1]) x++;\n\t}\n\tif (x==0) t++;\n}\nint main()\n{\n\tint n,s,num=0;\n\tcin>>n>>s;\n\tfor (int i=s+1;num<n;i++)\n\t{\n\t\tfor (int j=2;j<11;j++)\n\t\t{\n\t\t\ttran(i,j);\n\t\t\tcheck(s1);\n\t\t}\n\t\tif (t>=2)\n\t\t{\n\t\t\tcout<<i<<endl;\n\t\t\tnum++;\n\t\t}\n\t\tt=0;\n\t}\n}\n",ACCEPTED,55,432
1277094496313999360,36f9703960ec59dff6d2b06720a0fbd9fd98c39584d6789ef785e7a1e664ee75,2020-06-28 12:20:29,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\nbool f(string m);\nstring transform(int m,int n);\nint main() {\n\tint n;//进制\n\tstring m1, m2;\n\tcin >> n;\n\tfor (int i =1; i <= 300; i++) {\n\t\tm1 = transform(i,n);\n\t\tm2 = transform(i * i,n);\n\t\tif (f(m2)) {\n\t\t\tcout << m1 << \"" \"" <<m2<< endl;\n\t\t}\n\t}\n\treturn 0;\n}\nstring transform(int m,int n) {\n\tstring num = \""\"";\n\tchar ch;\n\tchar a[20] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\n\twhile (m != 0) {\n\t\tch = a[m % n];\n\t\t//if (ch > '10') ch = m%n+ 'A';\n\t\tnum = ch+ num;\n\t\tm /= n;\n\t}\n\t//cout << num << endl;\n\treturn num;\n}\nbool f(string m) {\n\tfor (int i = 0; i < m.size()/2; i++) {\n\t\tif (m[i] != m[m.size() - 1 - i]) return 0;\n\t}\n\treturn 1;\n}",ACCEPTED,56,512
1277094642808446976,36f9703960ec59dff6d2b06720a0fbd9fd98c39584d6789ef785e7a1e664ee75,2020-06-28 12:21:04,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\nbool f(string m);\nstring transform(int m,int n);\nint main() {\n\tint N, S,i;\n\tint total=0;//总个数\n\tint count = 0;//一个数在多少个进制下为回文数\n\tstring m;\n\tcin >>N>>S;\n\ti = S + 1;\n\twhile (total < N) {\n\t\tcount = 0;\n\t\tfor (int n = 2; n<=10; n++) {\n\t\t\tm= transform(i, n);\n\t\t\tif (f(m)) {\n\t\t\t\tcount++;\n\t\t\t\tif (count >= 2) {\n\t\t\t\t\ttotal++;\n\t\t\t\t\tcout << i << endl;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\ti++;\n\t}\n\treturn 0;\n}\nstring transform(int m,int n) {\n\tstring num = \""\"";\n\tchar ch;\n\tchar a[20] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\n\twhile (m != 0) {\n\t\tch = a[m % n];\n\t\t//if (ch > '10') ch = m%n+ 'A';\n\t\tnum = ch+ num;\n\t\tm /= n;\n\t}\n\t//cout << num << endl;\n\treturn num;\n}\nbool f(string m) {\n\tfor (int i = 0; i < m.size()/2; i++) {\n\t\tif (m[i] != m[m.size() - 1 - i]) return 0;\n\t}\n\treturn 1;\n}",ACCEPTED,57,512
1277101813935824896,ffcba09105fc9d7ccf9f7c4c4272116b49bc682b49102d2cee32f4bb4f7054f0,2020-06-28 12:49:34,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cstdlib>\n#include <algorithm>\n#include <cstdio>\n#include <cstring>\n#include <cmath>\nusing namespace std;\nint n;\nint stack[100],tot;\nvoid transfer(int num)\n{\n    tot=0;\n    int numtemp=num;\n    while(numtemp)\n    {\n        stack[++tot]=numtemp%n;\n        numtemp/=n;\n    }\n    for(int i=0;i<(tot+1)/2;i++)\n        if(stack[i+1]!=stack[tot-i]) return ;\n    cout<<sqrt(num)<<\"" \"";\n    for(int i=1;i<=tot;i++)\n     cout<<stack[i];\n     puts(\""\"");\n}\nint main()\n{\n    scanf(\""%d\"",&n);\n    for(int i=1;i<=300;i++)\n    transfer(i*i);\n    return 0;\n}",PARTIAL_ACCEPTED,65,452
1277102266253770752,ffcba09105fc9d7ccf9f7c4c4272116b49bc682b49102d2cee32f4bb4f7054f0,2020-06-28 12:51:22,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cstdlib>\n#include <algorithm>\n#include <cstdio>\n#include <cstring>\n#include <cmath>\nusing namespace std;\nint n;\nint stack[100],tot;\nvoid transfer(int num)\n{\n    tot=0;\n    int numtemp=num;\n    while(numtemp)\n    {\n        stack[++tot]=numtemp%n;\n        numtemp/=n;\n    }\n    for(int i=0;i<(tot+1)/2;i++)\n        if(stack[i+1]!=stack[tot-i]) return ;\n    cout<<sqrt(num)<<\"" \"";\n    for(int i=1;i<=tot;i++)\n     if(stack[i]<10)cout<<stack[i];\n      else cout<<char(stack[i]-10+'A');\n     puts(\""\"");\n}\nint main()\n{\n    scanf(\""%d\"",&n);\n    for(int i=1;i<=300;i++)\n    transfer(i*i);\n    return 0;\n}",PARTIAL_ACCEPTED,59,488
1277105894192504832,ffcba09105fc9d7ccf9f7c4c4272116b49bc682b49102d2cee32f4bb4f7054f0,2020-06-28 13:05:47,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cstdlib>\n#include <algorithm>\n#include <cstdio>\n#include <cstring>\n#include <cmath>\nusing namespace std;\nint n;\nint stack1[100],stack2[100],tot1,tot2;\nvoid transfer(int num)\n{\n    tot1=tot2=0;\n\n    int numtemp=num;\n    while(numtemp)\n    {\n        stack1[++tot1]=numtemp%n;\n        numtemp/=n;\n    }\n    numtemp=num*num;\n    while(numtemp)\n    {\n        stack2[++tot2]=numtemp%n;\n        numtemp/=n;\n    }\n\n    for(int i=0;i<(tot2+1)/2;i++)\n        if(stack2[i+1]!=stack2[tot2-i]) return ;\n    for(int i=tot1;i>=1;i--)\n     if(stack1[i]<10)cout<<stack1[i];\n      else cout<<char(stack1[i]-10+'A');\n      cout<<\"" \"";\n    for(int i=1;i<=tot2;i++)\n     if(stack2[i]<10)cout<<stack2[i];\n      else cout<<char(stack2[i]-10+'A');\n     puts(\""\"");\n}\nint main()\n{\n    scanf(\""%d\"",&n);\n    for(int i=1;i<=300;i++)\n    {    \n        \n        transfer(i);\n    }\n    return 0;\n}",ACCEPTED,23,512
1277106007698759680,ffcba09105fc9d7ccf9f7c4c4272116b49bc682b49102d2cee32f4bb4f7054f0,2020-06-28 13:06:14,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <cstdlib>\n#include <algorithm>\n#include <cstdio>\n#include <cstring>\n#include <cmath>\nusing namespace std;\nint n;\nint stack[100],tot;\nbool transfer(int num)\n{\n    tot=0;\n    int numtemp=num;\n    while(numtemp)\n    {\n        stack[++tot]=numtemp%n;\n        numtemp/=n;\n    }\n    for(int i=0;i<(tot+1)/2;i++)\n        if(stack[i+1]!=stack[tot-i]) return false;\n    return true;\n    \n}\nint m,s,nowtot;\nint main()\n{\n    scanf(\""%d %d\"",&m,&s);\n     for(int i=s+1,temp;nowtot<m;i++)\n     {\n         temp=0;\n        for(n=2;n<=10;n++)\n         {\n             if(transfer(i)) temp++;\n         }\n         if(temp>1) \n         \n         {nowtot++;cout<<i<<endl;}\n         \n     }\n    return 0;\n}",ACCEPTED,56,500
1277113619882377216,4e12204dd045e4a0bde87cb4e6dcd6b3eb7389de27e8a037166e9eac911ca421,2020-06-28 13:36:29,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<cstdio>\n#include<iostream>\nusing namespace std;\nchar buf[20];\nchar t[10] = {'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J'};\n\nint transfer(int n,int b,char buf[]){\n    int w = 0, z;\n    while (n!=0)\n    {   \n        z = n % b;\n        if(z-9>0){buf[w] = t[z-9];}\n        else{buf[w] = z + 48;}\n        n /= b;\n        w++;\n    }\n    buf[w] = '\\0';\n    return w;\n}\n\nbool Palindrome(int n){\n    for (int i = 0; i <= n / 2;i++){\n        if(buf[i]!=buf[n-i-1]){\n            return false;\n        }\n    }\n    return true;\n}\n\nint main(){\n    char k[20];\n    int b;\n    cin >> b;\n    for (int i = 1; i <= 300;i++){\n        if(Palindrome(transfer(i * i, b, buf))){\n            int o=transfer(i, b, k);\n            for (int j = o - 1; j >= 0;j--){cout << k[j];}\n                cout << \"" \"" << buf << \""\\n\"";\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,48,512
1277113713704755200,4e12204dd045e4a0bde87cb4e6dcd6b3eb7389de27e8a037166e9eac911ca421,2020-06-28 13:36:51,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<cstdio>\n#include<iostream>\nusing namespace std;\nchar buf[32];\n\nint transfer(int n,int b){\n    int w = 0;\n    while (n!=0)\n    {   \n        buf[w] = n % b + 48;\n        n /= b;\n        w++;\n    }\n    buf[w] = '\\0';\n    return w;\n}\n\nbool Palindrome(int n){\n    for (int i = 0; i <= n / 2;i++){\n        if(buf[i]!=buf[n-i-1]){\n            return false;\n        }\n    }\n    return true;\n}\n\nint main(){\n    int n, s, ans = 0;\n    cin >> n >> s;\n    for (int i = s + 1; ans < n;i++){\n        int c = 0;\n        for (int j = 2; j <= 10;j++){\n            if(Palindrome(transfer(i,j))){\n                c++;\n            }\n        }\n        if(c>=2){\n            cout << i << \""\\n\"";\n            ans++;\n        }\n    }\n}",ACCEPTED,70,500
1277117863989534720,4e12204dd045e4a0bde87cb4e6dcd6b3eb7389de27e8a037166e9eac911ca421,2020-06-28 13:53:21,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<cstdio>\n#include<iostream>\nusing namespace std;\nchar buf[20];\nchar t[10] = {'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J'};\n\nint transfer(int n,int b,char buf[]){\n    int w = 0, z;\n    while (n!=0)\n    {   \n        z = n % b;\n        if(z-9>0){buf[w] = t[z-10];}\n        else{buf[w] = z + 48;}\n        n /= b;\n        w++;\n    }\n    buf[w] = '\\0';\n    return w;\n}\n\nbool Palindrome(int n){\n    for (int i = 0; i <= n / 2;i++){\n        if(buf[i]!=buf[n-i-1]){\n            return false;\n        }\n    }\n    return true;\n}\n\nint main(){\n    char k[20];\n    int b;\n    cin >> b;\n    for (int i = 1; i <= 300;i++){\n        if(Palindrome(transfer(i * i, b, buf))){\n            int o=transfer(i, b, k);\n            for (int j = o - 1; j >= 0;j--){cout << k[j];}\n                cout << \"" \"" << buf << \""\\n\"";\n        }\n    }\n    return 0;\n}",ACCEPTED,58,512
1277121499368980480,c240bacda90ae5891eb3728595e49fcdb5f933005c8b76b8708e4b6f99df2117,2020-06-28 14:07:47,C++,40.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<vector>\n#include <algorithm>\nusing namespace std;\n\nstring transform(int n, int hex) {\n\tstring s = \""\"";\n\tvector<string> numbers;\n\twhile (n >= hex) {\n\t\tif ((n % hex) == 10) {\n\t\t\tnumbers.push_back(\""A\"");\n\t\t}\n\t\telse if ((n % hex) == 11) {\n\t\t\tnumbers.push_back(\""B\"");\n\t\t}\n\t\telse if ((n % hex) == 12) {\n\t\t\tnumbers.push_back(\""C\"");\n\t\t}\n\t\telse if ((n % hex) == 13) {\n\t\t\tnumbers.push_back(\""D\"");\n\t\t}\n\t\telse if ((n % hex) == 14) {\n\t\t\tnumbers.push_back(\""E\"");\n\t\t}\n\t\telse if ((n % hex) == 15) {\n\t\t\tnumbers.push_back(\""F\"");\n\t\t}\n\t\telse if ((n % hex) == 16) {\n\t\t\tnumbers.push_back(\""G\"");\n\t\t}\n\t\telse if ((n % hex) == 17) {\n\t\t\tnumbers.push_back(\""H\"");\n\t\t}\n\t\telse if ((n % hex) == 18) {\n\t\t\tnumbers.push_back(\""I\"");\n\t\t}\n\t\telse if ((n % hex) == 19) {\n\t\t\tnumbers.push_back(\""J\"");\n\t\t}\n\t\telse {\n\t\t\tnumbers.push_back((to_string(n % hex)));//存储余数，但是要注意十进制后的余数表示啊！\n\t\t}\n\t\tn = (n / hex);\n\t}\n\tnumbers.push_back(to_string(n));\n\n\tfor (size_t i = 0; i < numbers.size(); i++) {\n\t\tsize_t place = numbers.size() - 1 - i;\n\t\ts += numbers[place];\n\t}\n\treturn s;\n}\n\nint main() {\n\tint Hex;\n\tcin >> Hex;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tint square = i * i;\n\t\tstring s1 = transform(square, Hex);\n\t\tstring s2 = s1;\n\t\treverse(s2.begin(), s2.end());\n\t\tif (s1 == s2) {\n\t\t\tstring s3 = transform(i, Hex);\n\t\t\tcout << s3 << \"" \"" << s2 << endl;\n\t\t}\n\t}\n}",PARTIAL_ACCEPTED,43,512
1277127191215669248,c240bacda90ae5891eb3728595e49fcdb5f933005c8b76b8708e4b6f99df2117,2020-06-28 14:30:24,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<vector>\n#include <algorithm>\nusing namespace std;\n\nstring transform(int n, int hex) {\n\tstring s = \""\"";\n\tvector<string> numbers;\n\twhile (n >= hex) {\n\t\tif ((n % hex) == 10) {\n\t\t\tnumbers.push_back(\""A\"");\n\t\t}\n\t\telse if ((n % hex) == 11) {\n\t\t\tnumbers.push_back(\""B\"");\n\t\t}\n\t\telse if ((n % hex) == 12) {\n\t\t\tnumbers.push_back(\""C\"");\n\t\t}\n\t\telse if ((n % hex) == 13) {\n\t\t\tnumbers.push_back(\""D\"");\n\t\t}\n\t\telse if ((n % hex) == 14) {\n\t\t\tnumbers.push_back(\""E\"");\n\t\t}\n\t\telse if ((n % hex) == 15) {\n\t\t\tnumbers.push_back(\""F\"");\n\t\t}\n\t\telse if ((n % hex) == 16) {\n\t\t\tnumbers.push_back(\""G\"");\n\t\t}\n\t\telse if ((n % hex) == 17) {\n\t\t\tnumbers.push_back(\""H\"");\n\t\t}\n\t\telse if ((n % hex) == 18) {\n\t\t\tnumbers.push_back(\""I\"");\n\t\t}\n\t\telse if ((n % hex) == 19) {\n\t\t\tnumbers.push_back(\""J\"");\n\t\t}\n\t\telse {\n\t\t\tnumbers.push_back((to_string(n % hex)));//存储余数，但是要注意十进制后的余数表示啊！\n\t\t}\n\t\tn = (n / hex);\n\t}\n\tstring transform(int n, int hex) {\n\tstring s = \""\"";\n\tvector<string> numbers;\n\twhile (n >= hex) {\n\t\tif ((n % hex) == 10) {\n\t\t\tnumbers.push_back(\""A\"");\n\t\t}\n\t\telse if ((n % hex) == 11) {\n\t\t\tnumbers.push_back(\""B\"");\n\t\t}\n\t\telse if ((n % hex) == 12) {\n\t\t\tnumbers.push_back(\""C\"");\n\t\t}\n\t\telse if ((n % hex) == 13) {\n\t\t\tnumbers.push_back(\""D\"");\n\t\t}\n\t\telse if ((n % hex) == 14) {\n\t\t\tnumbers.push_back(\""E\"");\n\t\t}\n\t\telse if ((n % hex) == 15) {\n\t\t\tnumbers.push_back(\""F\"");\n\t\t}\n\t\telse if ((n % hex) == 16) {\n\t\t\tnumbers.push_back(\""G\"");\n\t\t}\n\t\telse if ((n % hex) == 17) {\n\t\t\tnumbers.push_back(\""H\"");\n\t\t}\n\t\telse if ((n % hex) == 18) {\n\t\t\tnumbers.push_back(\""I\"");\n\t\t}\n\t\telse if ((n % hex) == 19) {\n\t\t\tnumbers.push_back(\""J\"");\n\t\t}\n\t\telse {\n\t\t\tnumbers.push_back((to_string(n % hex)));//存储余数，但是要注意十进制后的余数表示啊！\n\t\t}\n\t\tn = (n / hex);\n\t}\n\tif (n == 10) {\n\t\tnumbers.push_back(\""A\"");\n\t}\n\telse if (n == 11) {\n\t\tnumbers.push_back(\""B\"");\n\t}\n\telse if (n == 12) {\n\t\tnumbers.push_back(\""C\"");\n\t}\n\telse if (n == 13) {\n\t\tnumbers.push_back(\""D\"");\n\t}\n\telse if (n == 14) {\n\t\tnumbers.push_back(\""E\"");\n\t}\n\telse if (n == 15) {\n\t\tnumbers.push_back(\""F\"");\n\t}\n\telse if (n == 16) {\n\t\tnumbers.push_back(\""G\"");\n\t}\n\telse if (n == 17) {\n\t\tnumbers.push_back(\""H\"");\n\t}\n\telse if (n == 18) {\n\t\tnumbers.push_back(\""I\"");\n\t}\n\telse if (n == 19) {\n\t\tnumbers.push_back(\""J\"");\n\t}\n\telse {\n\t\tnumbers.push_back((to_string(n)));//存储余数，但是要注意十进制后的余数表示啊！\n\t}\n\n\tfor (size_t i = 0; i < numbers.size(); i++) {\n\t\tsize_t place = numbers.size() - 1 - i;\n\t\ts += numbers[place];\n\t}\n\treturn s;\n}\n\n\tfor (size_t i = 0; i < numbers.size(); i++) {\n\t\tsize_t place = numbers.size() - 1 - i;\n\t\ts += numbers[place];\n\t}\n\treturn s;\n}\n\nint main() {\n\tint Hex;\n\tcin >> Hex;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tint square = i * i;\n\t\tstring s1 = transform(square, Hex);\n\t\tstring s2 = s1;\n\t\treverse(s2.begin(), s2.end());\n\t\tif (s1 == s2) {\n\t\t\tstring s3 = transform(i, Hex);\n\t\t\tcout << s3 << \"" \"" << s2 << endl;\n\t\t}\n\t}\n}",COMPILE_ERROR,0,0
1277127430660087808,c240bacda90ae5891eb3728595e49fcdb5f933005c8b76b8708e4b6f99df2117,2020-06-28 14:31:22,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<vector>\n#include <algorithm>\nusing namespace std;\n\nstring transform(int n, int hex) {\n\tstring s = \""\"";\n\tvector<string> numbers;\n\twhile (n >= hex) {\n\t\tif ((n % hex) == 10) {\n\t\t\tnumbers.push_back(\""A\"");\n\t\t}\n\t\telse if ((n % hex) == 11) {\n\t\t\tnumbers.push_back(\""B\"");\n\t\t}\n\t\telse if ((n % hex) == 12) {\n\t\t\tnumbers.push_back(\""C\"");\n\t\t}\n\t\telse if ((n % hex) == 13) {\n\t\t\tnumbers.push_back(\""D\"");\n\t\t}\n\t\telse if ((n % hex) == 14) {\n\t\t\tnumbers.push_back(\""E\"");\n\t\t}\n\t\telse if ((n % hex) == 15) {\n\t\t\tnumbers.push_back(\""F\"");\n\t\t}\n\t\telse if ((n % hex) == 16) {\n\t\t\tnumbers.push_back(\""G\"");\n\t\t}\n\t\telse if ((n % hex) == 17) {\n\t\t\tnumbers.push_back(\""H\"");\n\t\t}\n\t\telse if ((n % hex) == 18) {\n\t\t\tnumbers.push_back(\""I\"");\n\t\t}\n\t\telse if ((n % hex) == 19) {\n\t\t\tnumbers.push_back(\""J\"");\n\t\t}\n\t\telse {\n\t\t\tnumbers.push_back((to_string(n % hex)));//存储余数，但是要注意十进制后的余数表示啊！\n\t\t}\n\t\tn = (n / hex);\n\t}\n\n\n\tif (n == 10) {\n\t\tnumbers.push_back(\""A\"");\n\t}\n\telse if (n == 11) {\n\t\tnumbers.push_back(\""B\"");\n\t}\n\telse if (n == 12) {\n\t\tnumbers.push_back(\""C\"");\n\t}\n\telse if (n == 13) {\n\t\tnumbers.push_back(\""D\"");\n\t}\n\telse if (n == 14) {\n\t\tnumbers.push_back(\""E\"");\n\t}\n\telse if (n == 15) {\n\t\tnumbers.push_back(\""F\"");\n\t}\n\telse if (n == 16) {\n\t\tnumbers.push_back(\""G\"");\n\t}\n\telse if (n == 17) {\n\t\tnumbers.push_back(\""H\"");\n\t}\n\telse if (n == 18) {\n\t\tnumbers.push_back(\""I\"");\n\t}\n\telse if (n == 19) {\n\t\tnumbers.push_back(\""J\"");\n\t}\n\telse {\n\t\tnumbers.push_back((to_string(n)));//存储余数，但是要注意十进制后的余数表示啊！\n\t}\n\n\tfor (size_t i = 0; i < numbers.size(); i++) {\n\t\tsize_t place = numbers.size() - 1 - i;\n\t\ts += numbers[place];\n\t}\n\treturn s;\n}\n\nint main() {\n\tint Hex;\n\tcin >> Hex;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tint square = (i * i);\n\t\tstring s1 = transform(square, Hex);\n\t\tstring s2 = s1;\n\t\treverse(s2.begin(), s2.end());\n\t\tif (s1 == s2) {\n\t\t\tstring s3 = transform(i, Hex);\n\t\t\tcout << s3 << \"" \"" << s2 << endl;\n\t\t}\n\t}\n}",ACCEPTED,36,424
1277140807478337536,c9d3ae68a6071055ff2d59731ba6db15495e3f5be91d4a9ca76df94151610501,2020-06-28 15:24:31,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint n,i,j,k,a,b,cha[15],sign;\n\tcin >> n;\n\tfor (i = 1; i <= 300; i++)\n\t{\n\t\tsign = 1;\n\t\ta = i * i;\n\t\tfor (j=0; a > 0;j++)\n\t\t{\n\t\t\tb = a % n;\n\t\t\tcha[j] = b;\n\t\t\ta = a / n;\n\t\t}\n\t\tfor (k = 0; k < j/2; k++)\n\t\t{\n\t\t\tif (cha[k] != cha[j -1- k])sign = 0;\n\t\t}\n\t\tif (sign)\n\t\t{\n\t\t\tcout << i << \"" \"";\n\t\t\tfor (k = 0; k < j; k++)\n\t\t\t\tcout << cha[k];\n\t\t\tcout << endl;\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,39,540
1277142905142042624,c9d3ae68a6071055ff2d59731ba6db15495e3f5be91d4a9ca76df94151610501,2020-06-28 15:32:51,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint n,i,j,k,a,b,cha[25],temp[25],sign;\n\tcin >> n;\n\tfor (i = 1; i <= 300; i++)\n\t{\n\t\tsign = 1;\n\t\ta = i * i;\n\t\tfor (j=0; a > 0;j++)\n\t\t{\n\t\t\tb = a % n;\n\t\t\tcha[j] = b;\n\t\t\ta = a / n;\n\t\t}\n\t\tfor (k = 0; k < j/2; k++)\n\t\t{\n\t\t\tif (cha[k] != cha[j -1- k])sign = 0;\n\t\t}\n\t\tif (sign)\n\t\t{\n\t\t\ta = i;\n\t\t\tfor (k = 0; a > 0; k++)\n\t\t\t{\n\t\t\t\tb = a % n;\n\t\t\t\ttemp[k] = b;\n\t\t\t\ta = a / n;\n\t\t\t}\n\t\t\tfor (int l = k - 1; l >= 0; l--)\n\t\t\t\tcout << temp[l];\n\t\t\tcout << \"" \"";\n\t\t\tfor (k = 0; k < j; k++)\n\t\t\t\tcout << cha[k];\n\t\t\tcout << endl;\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,39,508
1277147548391759872,c9d3ae68a6071055ff2d59731ba6db15495e3f5be91d4a9ca76df94151610501,2020-06-28 15:51:18,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint n,i,j,k,a,b,sign;\n\tchar cha[25], temp[25];\n\tcin >> n;\n\tfor (i = 1; i <= 300; i++)\n\t{\n\t\tsign = 1;\n\t\ta = i * i;\n\t\tfor (j=0; a > 0;j++)\n\t\t{\n\t\t\tb = a % n;\n\t\t\tcha[j] = b + 48;\n\t\t\tif (b == 10)\n\t\t\t{\n\t\t\t\tcha[j] == 'A';\n\t\t\t}\n\t\t\tif (b == 11)\n\t\t\t{\n\t\t\t\tcha[j] = 'B';\n\t\t\t}\n\t\t\tif (b == 12)\n\t\t\t{\n\t\t\t\tcha[j] = 'C';\n\t\t\t}\n\t\t\tif (b == 13)\n\t\t\t{\n\t\t\t\tcha[j] = 'D';\n\t\t\t}\n\t\t\tif (b == 14)\n\t\t\t{\n\t\t\t\tcha[j] = 'E';\n\t\t\t}\n\t\t\tif (b == 15)\n\t\t\t{\n\t\t\t\tcha[j] = 'F';\n\t\t\t}\n\t\t\ta = a / n;\n\t\t}\n\t\tfor (k = 0; k < j/2; k++)\n\t\t{\n\t\t\tif (cha[k] != cha[j -1- k])sign = 0;\n\t\t}\n\t\tif (sign)\n\t\t{\n\t\t\ta = i;\n\t\t\tfor (k = 0; a > 0; k++)\n\t\t\t{\n\t\t\t\tb = a % n;\n\t\t\t\ttemp[k] = b + 48;\n\t\t\t\ta = a / n;\n\t\t\t}\n\t\t\tfor (int l = k - 1; l >= 0; l--)\n\t\t\t\tcout << temp[l];\n\t\t\tcout << \"" \"";\n\t\t\tfor (k = 0; k < j; k++)\n\t\t\t\tcout << cha[k];\n\t\t\tcout << endl;\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,24,428
1277149023209709568,d8321467439a37c77d422396cd6dd920b1748636a3c931dbeb45272c6d8542f2,2020-06-28 15:57:10,C++,40.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\nusing namespace std;\nstring transform(int B, int num);\nbool is_num(string s);\n\nint main()\n{\n\tint B;\n\tcin>>B;\n\tfor (int i=1;i<=300;i++)\n\t{\n\t\tif (is_num(transform(B,i*i)))\n\t\t{\n\t\t\tcout<<transform(B,i)<<\"" \""<<transform(B,i*i)<<endl;\t\n\t\t}\t\n\t}\n\treturn 0;\n}\n\nstring transform(int B, int num)\t\n{\n\tstring s = \""\"";\n\twhile (num != 0)\n\t{\n\t\ts = to_string(num % B) + s;\n\t\tnum = num / B;\n\t}\n\treturn s;\n}\n\nbool is_num(string s)\n{\n\tint i = 0, j = s.size()-1;\n\twhile(i < j)\n\t{\n\t\tif (s[i] != s[j]) \n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\ti++;\n\t\tj--;\n\t}\n\treturn true;\n}",PARTIAL_ACCEPTED,85,396
1277149293104791552,d8321467439a37c77d422396cd6dd920b1748636a3c931dbeb45272c6d8542f2,2020-06-28 15:58:14,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\nusing namespace std;\nstring transform(int B, int num);\nbool is_num(string s);\n\nint main()\n{\n\tint N, S;\n\tcin>>N>>S;\n\tint m = 0, n = 0, i = S;\n\twhile (m<N)\n\t{\n\t\ti++;\n\t\tfor (int j=2;j<=10;j++)\n\t\t{\n\t\t\tif (n>=2) \n\t\t\t{\n\t\t\t\tcout<<i<<endl;\n\t\t\t\tm++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif (is_num(transform(j,i))) n++;\n\t\t}\n\t}\n\treturn 0;\n}\n\nstring transform(int B, int num)\t\n{\n\tstring s = \""\"";\n\twhile (num != 0)\n\t{\n\t\ts = to_string(num % B) + s;\n\t\tnum = num / B;\n\t}\n\treturn s;\n}\n\nbool is_num(string s)\n{\n\tint i = 0, j = s.size()-1;\n\twhile(i < j)\n\t{\n\t\tif (s[i] != s[j]) \n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\ti++;\n\t\tj--;\n\t}\n\treturn true;\n}",PARTIAL_ACCEPTED,29,488
1277151950947155968,c9d3ae68a6071055ff2d59731ba6db15495e3f5be91d4a9ca76df94151610501,2020-06-28 16:08:48,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint n,i,j,k,a,b,sign;\n\tchar cha[25], temp[25];\n\tcin >> n;\n\tfor (i = 1; i <= 300; i++)\n\t{\n\t\tsign = 1;\n\t\ta = i * i;\n\t\tfor (j=0; a > 0;j++)\n\t\t{\n\t\t\tb = a % n;\n\t\t\tcha[j] = b + 48;\n\t\t\tif (b >= 10)\n\t\t\t{\n\t\t\t\tcha[j] = b+55;\n\t\t\t}\n\t\t\ta = a / n;\n\t\t}\n\t\tfor (k = 0; k < j/2; k++)\n\t\t{\n\t\t\tif (cha[k] != cha[j -1- k])sign = 0;\n\t\t}\n\t\tif (sign)\n\t\t{\n\t\t\ta = i;\n\t\t\tfor (k = 0; a > 0; k++)\n\t\t\t{\n\t\t\t\tb = a % n;\n\t\t\t\ttemp[k] = b + 48;\n\t\t\t\tif (b >= 10)\n\t\t\t\t{\n\t\t\t\t\ttemp[k] = b + 55;\n\t\t\t\t}\n\t\t\t\ta = a / n;\n\t\t\t}\n\t\t\tfor (int l = k - 1; l >= 0; l--)\n\t\t\t\tcout << temp[l];\n\t\t\tcout << \"" \"";\n\t\t\tfor (k = 0; k < j; k++)\n\t\t\t\tcout << cha[k];\n\t\t\tcout << endl;\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,23,512
1277152696388222976,6e49bd3d7e0af2b8cb29113dd913759594671ed1f457c78b44b78360f6daf7d0,2020-06-28 16:11:45,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#define _CRT_SECURE_NO_WARNINGS \n#define ll long long\n#include <set>\n#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <map>\n#include <queue>\nusing namespace std;\nint B;\n\nstring transToN(int a, int n) { // 10进制转到n进制\n\tstring tmp = \""\"";\n\twhile (a / n) {\n\t\tif (a%n < 10) {\n\t\t\ttmp = to_string(a % n) + tmp;\n\t\t}\n\t\telse {\n\t\t\ttmp = (char)('A' + (a%n) - 10) + tmp;\n\t\t}\t\n\t\ta /= n;\n\t}\n\tif (a != 0) {\n\t\tif (a < 10) {\n\t\t\ttmp = to_string(a) + tmp;\n\t\t}\n\t\telse {\n\t\t\ttmp = (char)('A' + a - 10) + tmp;\n\t\t}\n\t}\n\t\t\n\treturn tmp;\n}\nbool isHuiWen(int a, int n) {\n\tstring tmp = transToN(a, n);\n\tint tlen = tmp.size();\n\tfor (int i = 0;i < (tlen / 2); ++i) {\n\t\tif (tmp[i] != tmp[tlen - i - 1])\n\t\t\treturn false;\n\t}\n\treturn true;\n}\nint main()\n{\n//////////////////////////////////////////////////////////////////////\n\tcin >> B; // B进制\n\tfor (int i = 1; i <= 300; ++i) {\n\t\tint tmp = i * i;\n\t\tif (isHuiWen(tmp, B)) {\n\t\t\tcout << i << \"" \"" << tmp << endl;\n\t\t}\n\t}\n\n\treturn 0;\n}\n\n",PARTIAL_ACCEPTED,55,608
1277153118947565568,6e49bd3d7e0af2b8cb29113dd913759594671ed1f457c78b44b78360f6daf7d0,2020-06-28 16:13:26,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#define _CRT_SECURE_NO_WARNINGS \n#define ll long long\n#include <set>\n#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <map>\n#include <queue>\nusing namespace std;\nint B;\n\nstring transToN(int a, int n) { // 10进制转到n进制\n\tstring tmp = \""\"";\n\twhile (a / n) {\n\t\tif (a%n < 10) {\n\t\t\ttmp = to_string(a % n) + tmp;\n\t\t}\n\t\telse {\n\t\t\ttmp = (char)('A' + (a%n) - 10) + tmp;\n\t\t}\t\n\t\ta /= n;\n\t}\n\tif (a != 0) {\n\t\tif (a < 10) {\n\t\t\ttmp = to_string(a) + tmp;\n\t\t}\n\t\telse {\n\t\t\ttmp = (char)('A' + a - 10) + tmp;\n\t\t}\n\t}\n\t\t\n\treturn tmp;\n}\nbool isHuiWen(int a, int n) {\n\tstring tmp = transToN(a, n);\n\tint tlen = tmp.size();\n\tfor (int i = 0;i < (tlen / 2); ++i) {\n\t\tif (tmp[i] != tmp[tlen - i - 1])\n\t\t\treturn false;\n\t}\n\treturn true;\n}\nint main()\n{\n//////////////////////////////////////////////////////////////////////\n\tcin >> B; // B进制\n\tfor (int i = 1; i <= 300; ++i) {\n\t\tint tmp = i * i;\n\t\tif (isHuiWen(tmp, B)) {\n\t\t\tcout << transToN(i, B) << \"" \"" << transToN(tmp, B) << endl;\n\t\t}\n\t}\n\n\treturn 0;\n}\n\n",ACCEPTED,49,516
1277154924641583104,6e49bd3d7e0af2b8cb29113dd913759594671ed1f457c78b44b78360f6daf7d0,2020-06-28 16:20:37,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#define _CRT_SECURE_NO_WARNINGS \n#define ll long long\n#include <set>\n#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <map>\n#include <queue>\nusing namespace std;\n\nint N, S;\n\nstring transToN(int a, int n) { // 10进制转到n进制\n\tstring tmp = \""\"";\n\twhile (a / n) {\n\t\tif (a % n < 10) {\n\t\t\ttmp = to_string(a % n) + tmp;\n\t\t}\n\t\telse {\n\t\t\ttmp = (char)('A' + (a % n) - 10) + tmp;\n\t\t}\n\t\ta /= n;\n\t}\n\tif (a != 0) {\n\t\tif (a < 10) {\n\t\t\ttmp = to_string(a) + tmp;\n\t\t}\n\t\telse {\n\t\t\ttmp = (char)('A' + a - 10) + tmp;\n\t\t}\n\t}\n\n\treturn tmp;\n}\nbool isHuiWen(int a, int n) {\n\tstring tmp = transToN(a, n);\n\tint tlen = tmp.size();\n\tfor (int i = 0;i < (tlen / 2); ++i) {\n\t\tif (tmp[i] != tmp[tlen - i - 1])\n\t\t\treturn false;\n\t}\n\treturn true;\n}\nbool isOK(int ha) {\n\tunsigned char l = 0;\n\tfor (int i = 2;i <= 10; ++i) {\n\t\tif (l >= 2)\n\t\t\treturn true;\n\t\tif (isHuiWen(ha, i))\n\t\t\tl++;\n\t}\n\tif (l >= 2)\n\t\treturn true;\n\treturn false;\n}\n\nint main()\n{\n////////////////////////////////////////////////////////////////////////\n\tcin >> N >> S;\n\tint haha = S + 1;\n\twhile (N > 0) {\n\t\tif (isOK(haha)) {\n\t\t\tN--;\n\t\t\tcout << haha << endl;\n\t\t}\n\t\thaha++;\n\t}\n\n\treturn 0;\n}\n\n",ACCEPTED,73,424
1277160438402318336,8deffd1a550298bf3da4d16ad8bc34e4d5aeb10a1c2a49486eaf87f400ced3bd,2020-06-28 16:42:31,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nint main()\n{\n\tint n,a[100],b[100];\n\tcin>>n;\n\tfor(int i=1;i<300;i++)\n\t{\n\t\tint m=i*i,j=0,t=1,p,o;\n\t\twhile(t!=0)\n\t\t{\n\t\t\tt=m/n;\n\t\t\ta[j++]=m%n;\n\t\t\tm=t;\n\t\t}\n\t\tt=1,p=i,o=0;\n\t\twhile(t!=0)\n\t\t{\n\t\t\tt=p/n;\n\t\t\tb[o++]=p%n;\n\t\t\tp=t;\n\t\t}\n\t\tint flag=0;\n\t\tfor(int i=0;i<j/2;i++)\n\t\t{\n\t\t\tif(a[i]!=a[j-1-i])\n\t\t\tflag = 1;\n\t\t}\n\t\tif(!flag)\n\t\t{\n\t\t\tfor(int i=o-1;i>=0;i--)\n\t\t\t{\n\t\t\t\tif(b[i]>=10)\n\t\t\t\tcout<<b[i]+55;\n\t\t\t\telse\n\t\t\t\tcout<<b[i];\n\t\t\t}\n\t\t\tcout<<\"" \"";\n\t\t\tfor(int i=0;i<j;i++)\n\t\t\t{\n\t\t\t\tif(a[i]>=10)\n\t\t\t\tcout<<a[i]+55;\n\t\t\t\telse\n\t\t\t\tcout<<a[i];\n\t\t\t}\n\t\t\tcout<<endl;\n\t\t}\n\t}\t\t\n}\n",PARTIAL_ACCEPTED,29,504
1277160623840886784,8deffd1a550298bf3da4d16ad8bc34e4d5aeb10a1c2a49486eaf87f400ced3bd,2020-06-28 16:43:15,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string.h>\nusing namespace std;\nchar aa[50];\nint hw()\n{\n    int n,t,ans=0;\n    n=strlen(aa);\n    int i;\n    for(i=0;i<n/2;i++)\n    {\n        if(aa[i]==aa[n-i-1])\n            ans++;\n    }\n    if(ans>=n/2)\n        return 1;\n    else\n        return 0;\n}\nint schw(int n,int a)\n{\n    int m;\n    int i=0;\n    while(n)\n    {\n        aa[i++]=n%a;\n        n=n/a;\n    }\n    aa[i]=0;\n    int d=hw();\n\n    if(d==1)\n        return 1;\n    else\n        return 0;\n}\nint main()\n{\n    int n,s,i,j,ans=0;\n    cin>>n>>s;\n    for(i=s+1;;i++)\n    {\n        ans=0;\n        if(n==0)\n            break;\n        for(j=2;j<=10;j++)\n        {\n            int b=schw(i,j);\n            if(b==1)\n                ans++;\n            if(ans>=2)\n                break;\n        }\n        if(j<=10)\n        {\n            cout<<i<<endl;\n            n--;\n        }\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,54,384
1277164541375348736,440a1eccf37e409bb2264ca89fb51f2fc44eee779b37cc50e5295519e78d0610,2020-06-28 16:58:49,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <string>\n\nusing namespace std;\n\n//进制转化\nstring transform(int beforeNumber,int baseTrans){\n\n    if(beforeNumber==0){\n        cout<<0;\n        return 0;\n    }\n    int i=0;\n    char sAfter[120];  //转化后的字符数组\n    while(beforeNumber!=0){\n        int f = beforeNumber % baseTrans;\n        if(f<10){\n            sAfter[i++]=f+'0';\n        }else{\n            char v='a'+f-10;\n            sAfter[i++]=v;\n        }\n        beforeNumber /= baseTrans;\n    }\n\n    string sText = \""\"";\n\n    for (int j = i - 1; j >= 0; j--) {\n        sText += sAfter[j];\n    }\n    return sText;\n}\n\n//判断平方回文\nbool judge(string s1){\n    int t = stoi(s1);\n    t = t*t;\n    string text = to_string(t);\n    int k = text.length()-1;\n    for(int j=0;j<text.length();j++){\n        if (text[j]!=text[k])\n            return false;\n        k--;\n    }\n    return true;\n}\n\nint main(){\n    int trans;\n    cin>>trans;\n    string sNumber;\n    for (int i=1;i<=300;i++){\n        sNumber = transform(i,trans);\n        if(judge(sNumber)){\n            int x = stoi(sNumber);\n            x = x*x;  //计算平方\n            cout<<sNumber<<\"" \""<<x<<endl;\n        }\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,61,512
1277164575068192768,440a1eccf37e409bb2264ca89fb51f2fc44eee779b37cc50e5295519e78d0610,2020-06-28 16:58:57,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <string>\n\nusing namespace std;\n\n//进制转化\nstring transform(int beforeNumber,int baseTrans){\n\n    if(beforeNumber==0){\n        cout<<0;\n        return 0;\n    }\n    int i=0;\n    char sAfter[120];  //转化后的字符数组\n    while(beforeNumber!=0){\n        int f = beforeNumber % baseTrans;\n        if(f<10){\n            sAfter[i++]=f+'0';\n        }else{\n            char v='a'+f-10;\n            sAfter[i++]=v;\n        }\n        beforeNumber /= baseTrans;\n    }\n\n    string sText = \""\"";\n\n    for (int j = i - 1; j >= 0; j--) {\n        sText += sAfter[j];\n    }\n    return sText;\n}\n\n//判断平方回文\nbool judge(string s1){\n    int t = stoi(s1);\n    t = t*t;\n    string text = to_string(t);\n    int k = text.length()-1;\n    for(int j=0;j<text.length();j++){\n        if (text[j]!=text[k])\n            return false;\n        k--;\n    }\n    return true;\n}\n\nint main(){\n    int trans;\n    cin>>trans;\n    string sNumber;\n    for (int i=1;i<=300;i++){\n        sNumber = transform(i,trans);\n        if(judge(sNumber)){\n            int x = stoi(sNumber);\n            x = x*x;  //计算平方\n            cout<<sNumber<<\"" \""<<x<<endl;\n        }\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,46,504
1277165593835274240,440a1eccf37e409bb2264ca89fb51f2fc44eee779b37cc50e5295519e78d0610,2020-06-28 17:03:00,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <string>\n\nusing namespace std;\n\n//进制转化\nstring transform(int beforeNumber,int baseTrans){\n\n    if(beforeNumber==0){\n        cout<<0;\n        return 0;\n    }\n    int i=0;\n    char sAfter[120];  //转化后的字符数组\n    while(beforeNumber!=0){\n        int f = beforeNumber % baseTrans;\n        if(f<10){\n            sAfter[i++]=f+'0';\n        }else{\n            char v='a'+f-10;\n            sAfter[i++]=v;\n        }\n        beforeNumber /= baseTrans;\n    }\n\n    string sText = \""\"";\n\n    for (int j = i - 1; j >= 0; j--) {\n        sText += sAfter[j];\n    }\n    return sText;\n}\n\n//判断回文\nbool judge(string s1){\n\n    int k = s1.length()-1;\n    for(int j=0;j<s1.length();j++){\n        if (s1[j]!=s1[k])\n            return false;\n        k--;\n    }\n    return true;\n}\n\nint main(){\n    int trans;\n    cin>>trans;\n    string sNumber;\n    for (int i=1;i<=300;i++){\n        sNumber = transform(i*i,trans);\n        if(judge(sNumber)){\n            cout<<transform(i,trans)<<\"" \""<<sNumber<<endl;\n        }\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,40,424
1277165834835787776,440a1eccf37e409bb2264ca89fb51f2fc44eee779b37cc50e5295519e78d0610,2020-06-28 17:03:58,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <string>\n\nusing namespace std;\n\n//进制转化\nstring transform(int beforeNumber,int baseTrans){\n\n    if(beforeNumber==0){\n        cout<<0;\n        return 0;\n    }\n    int i=0;\n    char sAfter[120];  //转化后的字符数组\n    while(beforeNumber!=0){\n        int f = beforeNumber % baseTrans;\n        if(f<10){\n            sAfter[i++]=f+'0';\n        }else{\n            char v='A'+f-10;\n            sAfter[i++]=v;\n        }\n        beforeNumber /= baseTrans;\n    }\n\n    string sText = \""\"";\n\n    for (int j = i - 1; j >= 0; j--) {\n        sText += sAfter[j];\n    }\n    return sText;\n}\n\n//判断回文\nbool judge(string s1){\n\n    int k = s1.length()-1;\n    for(int j=0;j<s1.length();j++){\n        if (s1[j]!=s1[k])\n            return false;\n        k--;\n    }\n    return true;\n}\n\nint main(){\n    int trans;\n    cin>>trans;\n    string sNumber;\n    for (int i=1;i<=300;i++){\n        sNumber = transform(i*i,trans);\n        if(judge(sNumber)){\n            cout<<transform(i,trans)<<\"" \""<<sNumber<<endl;\n        }\n    }\n    return 0;\n}\n",ACCEPTED,48,384
1277166023046782976,440a1eccf37e409bb2264ca89fb51f2fc44eee779b37cc50e5295519e78d0610,2020-06-28 17:04:43,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <string>\n\nusing namespace std;\n\n//进制转化\nstring transform(int beforeNumber,int baseTrans){\n\n    if(beforeNumber==0){\n        cout<<0;\n        return 0;\n    }\n    int i=0;\n    char sAfter[120];  //转化后的字符数组\n    while(beforeNumber!=0){\n        int tempNumber = beforeNumber % baseTrans;\n        if(tempNumber<10){\n            sAfter[i++]=tempNumber+'0';\n        }else{\n            char v='A'+tempNumber-10;\n            sAfter[i++]=v;\n        }\n        beforeNumber /= baseTrans;\n    }\n\n    string sText = \""\"";\n\n    for (int j = i - 1; j >= 0; j--) {\n        sText += sAfter[j];\n    }\n    return sText;\n}\n\n//判断回文\nbool judge(string s1){\n\n    int k = s1.length()-1;\n    for(int j=0;j<s1.length();j++){\n        if (s1[j]!=s1[k])\n            return false;\n        k--;\n    }\n    return true;\n}\n\nint main(){\n    int trans;\n    cin>>trans;\n    string sNumber;\n    for (int i=1;i<=300;i++){\n        sNumber = transform(i*i,trans);\n        if(judge(sNumber)){\n            cout<<transform(i,trans)<<\"" \""<<sNumber<<endl;\n        }\n    }\n    return 0;\n}\n",ACCEPTED,38,512
1277167916389163008,d8321467439a37c77d422396cd6dd920b1748636a3c931dbeb45272c6d8542f2,2020-06-28 17:12:14,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\nusing namespace std;\nstring transform(int B, long num);\nbool is_num(string s);\n\nint main()\n{\n\tint B;\n\tcin>>B;\n\tfor (int i=1;i<=300;i++)\n\t{\n\t\tif (is_num(transform(B,i*i)))\n\t\t{\n\t\t\tcout<<transform(B,i)<<\"" \""<<transform(B,i*i)<<endl;\t\n\t\t}\t\n\t}\n\treturn 0;\n}\n\nstring transform(int B, long num)\t\n{\n\tstring s = \""\"";\n\tchar str[20] = {'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','K'};\n\twhile (num != 0)\n\t{\n\t\ts = str[num % B] + s;\n\t\tnum = num / B;\n\t}\n\treturn s;\n}\n\nbool is_num(string s)\n{\n\tint i = 0, j = s.size()-1;\n\twhile(i < j)\n\t{\n\t\tif (s[i] != s[j]) \n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\ti++;\n\t\tj--;\n\t}\n\treturn true;\n}",ACCEPTED,31,512
1277168072585052160,d8321467439a37c77d422396cd6dd920b1748636a3c931dbeb45272c6d8542f2,2020-06-28 17:12:51,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\nusing namespace std;\nstring transform(int B, int num);\nbool is_num(string s);\n\nint main()\n{\n\tint N, S;\n\tcin>>N>>S;\n\tint m = 0, n = 0, i = S;\n\twhile (m<N)\n\t{\n\t\ti++;\n\t\tfor (int j=2;j<=10;j++)\n\t\t{\n\t\t\tif (n>=2) \n\t\t\t{\n\t\t\t\tcout<<i<<endl;\n\t\t\t\tm++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif (is_num(transform(j,i))) n++;\n\t\t}\n\t}\n\treturn 0;\n}\n\nstring transform(int B, int num)\t\n{\n\tstring s = \""\"";\n\tchar str[20] = {'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','K'};\n\twhile (num != 0)\n\t{\n\t\ts = str[num % B] + s;\n\t\tnum = num / B;\n\t}\n\treturn s;\n}\n\nbool is_num(string s)\n{\n\tint i = 0, j = s.size()-1;\n\twhile(i < j)\n\t{\n\t\tif (s[i] != s[j]) \n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\ti++;\n\t\tj--;\n\t}\n\treturn true;\n}",PARTIAL_ACCEPTED,67,424
1277168755614875648,3aaf4a732f987c33a81e41e1172d3cf2aa189e2b3924d74038f27ba4d11214e7,2020-06-28 17:15:34,C,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint b,i,j;\n\tscanf(\""%d\"",&b);\n\tfor(i=1;i<=300;i++)\n\t{\n\t\tj=i*i;\n\t\tif(j/b==0)//一位数\nprintf(\""%d %d\\n\"",i,j);\n\t\t\telse if(j/(b*b)==0)//2\n\t\t{\n\t\t\n\t\t\tif(j%b==(j/b))\nprintf(\""%d %d\\n\"",i,j);\n\t\t}\n\n\t\t\telse if(j/(b*b*b)==0)//3\n\t\t\t{if(j%b==(j/b/b))\nprintf(\""%d %d\\n\"",i,j);\n\t\t\t}\n\t\t\telse if(j/(b*b*b*b)==0)//4\n\t\t\t{if((j%b==(j/b/b/b))&&((j/b)%b==(j/b/b)%b))\n\t\t\tprintf(\""%d %d\\n\"",i,j);}\n\t\t\telse if(j/(b*b*b*b*b)==0)\n\t\t\t{if((j%b==(j/b/b/b/b))&&((j/b)%b==(j/b/b/b)%b))\n\t\t\tprintf(\""%d %d\\n\"",i,j);\t}\t\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,24,384
1277169466390020096,167b7bc675fa331764ed6ad605b7971e44ca7ff76bf0d7e34dbc103f5ff570c1,2020-06-28 17:18:24,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <stdio.h>\nusing namespace std;\nint mode, N;\nint len;\nchar a[10];\n\nvoid conversion(int n);\nbool palindrome();\nvoid Show(int m);\n\nint main()\n{\n    cin >> mode;\n    for (int i = 1; i <= 300; i++)\n    {\n        N = i * i;\n        if (palindrome())\n        {\n            Show(i);\n            cout << ' ';\n            Show(N);\n            cout << endl;\n        }\n    }\n    return 0;\n}\n\nvoid conversion(int n)\n{\n    int i = 0;\n    int t;\n    len = 0;\n    if (mode >= 2 && mode < 10)\n    {\n        while (n > 0)\n        {\n            a[i] = n % mode + 48;\n            n = n / mode;\n            i+=1;\n            len+=1;\n        }\n    }\n    else if (mode >= 10 && mode <= 20)\n    {\n        while (n > 0)\n        {\n            t = n % mode;\n            if (t < 10)\n                a[i] = t + 48;\n            else if (t == 10)\n                a[i] = 'A';\n            else if (t == 11)\n                a[i] = 'B';\n            else if (t == 12)\n                a[i] = 'C';\n            else if (t == 13)\n                a[i] = 'D';\n            else if (t == 14)\n                a[i] = 'E';\n            else if (t == 15)\n                a[i] = 'F';\n            else if (t == 16)\n                a[i] = 'G';\n            else if (t == 17)\n                a[i] = 'H';\n            else if (t == 18)\n                a[i] = 'I';\n            else if (t == 19)\n                a[i] = 'J';\n            n = n / mode;\n            i+=1;\n            len+=1;\n        }\n    }\n}\n\nbool palindrome()\n{\n    int i = 0, j = len - 1;\n    conversion(N);\n    while (i < j)\n    {\n        if (a[i] != a[j])\n            return 0;\n        i += 1;\n        j -= 1;\n    }\n    return 1;\n}\n\nvoid Show(int m)\n{\n    int i;\n    conversion(m);\n    for (i = len - 1; i >= 0; i--)\n        cout << a[i];\n}",WRONG_ANSWER,46,512
1277169629141590016,06973ea832a5a1b65d8be68c7f42fd3c791dd6b87b2be7840bfba18d17eace9c,2020-06-28 17:19:02,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nint main()\n{\n\tint b;\n\tcin >> b;\n\tfor (int i = 1;i <= 300;i++)\n\t{\n\t\tint j;\n\t\tj = i * i;\n\t\tint s, x = 0;\n\t\ts = j;\n\t\twhile (s > 0)\n\t\t{\n\t\t\tx = x * 10 + s % 10;\n\t\t\ts = s / 10;\n\t\t}\n\t\tif (x == j)\n\t\t\tcout << i << \"" \""<<x << endl;\n\t}\n}",PARTIAL_ACCEPTED,57,508
1277169758347124736,b42cd3949c84ee5ac9cc4d923f87cacc9a1701d8d7f592ebaf402a6ad0b20e72,2020-06-28 17:19:33,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\n\nint X = 0;//存读入的X进制\nvector<string> answer;//结果数组\nvector<string> answer_squ;//结果的平方数组\nchar remainders[20] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };//所有可能的余数\nstring change(int x, int num);//进制转换函数\nstring change_sort(string oldString);//颠倒顺序\nvoid solve();\n\nint main()\n{\n\n\tcin >> X;\n\tsolve();\n\n}     \n\n//x进制转换函数\nstring change(int x, int num) {\n\tvector<char> num_remainders;//存放余数\n\tstring num_x = \""\"";//存放x进制数结果\n\n\twhile (num != 0) {\n\t\tnum_remainders.push_back(remainders[num % x]);\n\t\tnum /= x;\n\t}\n\t//最后余数要倒过来存进结果字符串\n\tfor (int i = num_remainders.size() - 1; i >= 0; i--) {\n\t\tnum_x += num_remainders[i];\n\t}\n\n\treturn num_x;\n}\n\n//颠倒顺序\nstring change_sort(string oldString) {\n\tstring newString = \""\"";\n\tfor (int i = oldString.size() - 1; i >= 0; i--) {\n\t\tnewString += oldString[i];\n\t}\n\treturn newString;\n}\n\nvoid solve() {\n\tfor (int num = 1; num <= 300; num++) {\n\t\tint numSqu = num * num;//十进制平方\n\t\tstring numSqu_x = change(X, numSqu);//X进制平方\n\n\t\tif (numSqu_x == change_sort(numSqu_x)) {\n\t\t\tanswer.push_back(change(X, num));//回文X进制本身\n\t\t\tanswer_squ.push_back(numSqu_x);//回文X进制本身的平方\n\t\t}\n\t}\n\n\t//打印结果\n\tfor (int i = 0; i < answer.size(); i++) {\n\t\tcout << answer[i] << \"" \"" << answer_squ[i] << endl;\n\t}\n}",ACCEPTED,41,504
1277169971933667328,b42cd3949c84ee5ac9cc4d923f87cacc9a1701d8d7f592ebaf402a6ad0b20e72,2020-06-28 17:20:24,C++,40.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\n\nint N = 0;\nint S = 0;\nchar remainders[20] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };//所有可能的余数\nstring change(int x, int num);//进制转换函数\nstring change_sort(string oldString);//颠倒顺序\nvoid solve();\n\nint main()\n{\n\tcin >> N >> S;\n\tsolve();\n}\n\n//x进制转换函数\nstring change(int x, int num) {\n\tvector<char> num_remainders;//存放余数\n\tstring num_x = \""\"";//存放x进制数结果\n\n\twhile (num != 0) {\n\t\tnum_remainders.push_back(remainders[num % x]);\n\t\tnum /= x;\n\t}\n\t//最后余数要倒过来存进结果字符串\n\tfor (int i = num_remainders.size() - 1; i >= 0; i--) {\n\t\tnum_x += num_remainders[i];\n\t}\n\n\treturn num_x;\n}\n\n//颠倒顺序\nstring change_sort(string oldString) {\n\tstring newString = \""\"";\n\tfor (int i = oldString.size() - 1; i >= 0; i--) {\n\t\tnewString += oldString[i];\n\t}\n\treturn newString;\n}\n\nvoid solve() {\n\tint num = S + 1;//每一次进行循环的数字\n\tint global_counter = 0;//用来控制前N个输出结果\n\n\twhile (global_counter < N) {\n\t\tint counter = 0;//用来控制进制判断的次数，如果已经有2个（注：题目描述的界限似乎不是很清楚，上pta的时候要注意）进制满足了，就没有必要再继续判断了\n\n\t\tfor (int i = 2; i <= 10; i++) {\n\n\t\t\tif (counter >= 2) {\n\t\t\t\tcout << num << endl;//输出这个满足题目的数\n\t\t\t\tglobal_counter++;//全局计数器要加一\n\t\t\t\tbreak;//若已经有2个进制满足了，则这个数就可以了\n\t\t\t}\n\n\t\t\tstring num_x = change(i, num);//将数字转为i进制\n\t\t\tif (num_x == change_sort(num_x)) {\n\t\t\t\tcounter++;\n\t\t\t}\n\n\t\t}\n\t\t\n\t\tnum++;//每次数字要加一进入下一次循环判断\n\t}\n}\n",PARTIAL_ACCEPTED,72,520
1277171160939167744,167b7bc675fa331764ed6ad605b7971e44ca7ff76bf0d7e34dbc103f5ff570c1,2020-06-28 17:25:08,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <stdio.h>\nusing namespace std;\nint mode, N;\nint len;\nchar a[10];\n\nvoid conversion(int n);\nbool palindrome();\nvoid Show(int m);\n\nint main()\n{\n    cin >> mode;\n    for (int i = 1; i <= 300; i++)\n    {\n        N = i * i;\n        if (palindrome())\n        {\n            Show(i);\n            cout << ' ';\n            Show(N);\n            cout << endl;\n        }\n    }\n    return 0;\n}\n\nvoid conversion(int n)\n{\n    int i = 0;\n    int t;\n    len = 0;\n    if (mode >= 2 && mode < 10)\n    {\n        while (n > 0)\n        {\n            a[i] = n % mode + 48;\n            n = n / mode;\n            i += 1;\n            len += 1;\n        }\n    }\n    else if (mode >= 10 && mode <= 20)\n    {\n        while (n > 0)\n        {\n            t = n % mode;\n            if (t < 10)\n                a[i] = t + 48;\n            else if (t == 10)\n                a[i] = 'A';\n            else if (t == 11)\n                a[i] = 'B';\n            else if (t == 12)\n                a[i] = 'C';\n            else if (t == 13)\n                a[i] = 'D';\n            else if (t == 14)\n                a[i] = 'E';\n            else if (t == 15)\n                a[i] = 'F';\n            else if (t == 16)\n                a[i] = 'G';\n            else if (t == 17)\n                a[i] = 'H';\n            else if (t == 18)\n                a[i] = 'I';\n            else if (t == 19)\n                a[i] = 'J';\n            n = n / mode;\n            i += 1;\n            len += 1;\n        }\n    }\n}\n\nbool palindrome()\n{\n    int i, j;\n    conversion(N);\n    i = 0;\n    j = len - 1;\n    while (i < j)\n    {\n        if (a[i] != a[j])\n            return 0;\n        i += 1;\n        j -= 1;\n    }\n    return 1;\n}\n\nvoid Show(int m)\n{\n    int i;\n    conversion(m);\n    for (i = len - 1; i >= 0; i--)\n        cout << a[i];\n}",ACCEPTED,43,488
1277172253022674944,440a1eccf37e409bb2264ca89fb51f2fc44eee779b37cc50e5295519e78d0610,2020-06-28 17:29:28,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\nusing namespace std;\n\nstring transform(int beforeNumber,int baseTrans){\n\n    if(beforeNumber==0){\n        cout<<0;\n        return 0;\n    }\n    int i=0;\n    char sAfter[120];  //转化后的字符数组\n    while(beforeNumber!=0){\n        int tempNumber = beforeNumber % baseTrans;\n        if(tempNumber<10){\n            sAfter[i++]=tempNumber+'0';\n        }else{\n            char v='A'+tempNumber-10;\n            sAfter[i++]=v;\n        }\n        beforeNumber /= baseTrans;\n    }\n\n    string sText = \""\"";\n\n    for (int j = i - 1; j >= 0; j--) {\n        sText += sAfter[j];\n    }\n    return sText;\n}\n\n//判断回文\nbool judge(string s1){\n\n    int k = s1.length()-1;\n    for(int j=0;j<s1.length();j++){\n        if (s1[j]!=s1[k])\n            return false;\n        k--;\n    }\n    return true;\n}\n\n\n//判断是否超过两个进制\nbool judgeTwo(int number){\n    string sText;\n    int iCount=0;\n    for(int j=2;j<=10;j++){  //从二进制到十进制\n        sText = transform(number,j);\n        if(judge(sText)){\n            iCount ++;\n            if(iCount==2)\n                return true;\n        }\n    }\n    return false;\n}\n\nint main()\n{\n    int n,baseNumber,endNumber=0;\n    cin>>n>>baseNumber;\n    baseNumber++;\n    string s;\n    while(endNumber<3){\n\n        if(judgeTwo(baseNumber)){\n            cout<<baseNumber<<endl;\n            endNumber++;\n        }\n        baseNumber++;\n    }\n\n    return 0;\n}\n",WRONG_ANSWER,48,512
1277172541808893952,440a1eccf37e409bb2264ca89fb51f2fc44eee779b37cc50e5295519e78d0610,2020-06-28 17:30:37,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\nusing namespace std;\n\nstring transform(int beforeNumber,int baseTrans){\n\n    if(beforeNumber==0){\n        cout<<0;\n        return 0;\n    }\n    int i=0;\n    char sAfter[120];  //转化后的字符数组\n    while(beforeNumber!=0){\n        int tempNumber = beforeNumber % baseTrans;\n        if(tempNumber<10){\n            sAfter[i++]=tempNumber+'0';\n        }else{\n            char v='A'+tempNumber-10;\n            sAfter[i++]=v;\n        }\n        beforeNumber /= baseTrans;\n    }\n\n    string sText = \""\"";\n\n    for (int j = i - 1; j >= 0; j--) {\n        sText += sAfter[j];\n    }\n    return sText;\n}\n\n//判断回文\nbool judge(string s1){\n\n    int k = s1.length()-1;\n    for(int j=0;j<s1.length();j++){\n        if (s1[j]!=s1[k])\n            return false;\n        k--;\n    }\n    return true;\n}\n\n\n//判断是否超过两个进制\nbool judgeTwo(int number){\n    string sText;\n    int iCount=0;\n    for(int j=2;j<=10;j++){  //从二进制到十进制\n        sText = transform(number,j);\n        if(judge(sText)){\n            iCount ++;\n            if(iCount==2)\n                return true;\n        }\n    }\n    return false;\n}\n\nint main()\n{\n    int n,baseNumber,endNumber=0;\n    cin>>n>>baseNumber;\n    baseNumber++;\n    string s;\n    while(endNumber<n){\n\n        if(judgeTwo(baseNumber)){\n            cout<<baseNumber<<endl;\n            endNumber++;\n        }\n        baseNumber++;\n    }\n\n    return 0;\n}\n",ACCEPTED,34,384
1277173967561883648,d8321467439a37c77d422396cd6dd920b1748636a3c931dbeb45272c6d8542f2,2020-06-28 17:36:17,C++,40.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\nusing namespace std;\nstring transform(int B, int num);\nbool is_num(string s);\n\nint main()\n{\n\tint N, S;\n\tcin>>N>>S;\n\tint m = 0, i = S;\n\twhile (m<N)\n\t{\n\t\ti++;\n\t\tint n = 0;\n\t\tfor (int j=2;j<=10;j++)\n\t\t{\n\t\t\tif (n>=2) \n\t\t\t{\n\t\t\t\tcout<<i<<endl;\n\t\t\t\tm++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif (is_num(transform(j,i))) \n\t\t\t{\n\t\t\t\tn++;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}\n\nstring transform(int B, int num)\t\n{\n\tstring s = \""\"";\n\twhile (num != 0)\n\t{\n\t\ts = to_string(num % B) + s;\n\t\tnum = num / B;\n\t}\n\treturn s;\n}\n\nbool is_num(string s)\n{\n\tint i = 0, j = s.size()-1;\n\twhile(i < j)\n\t{\n\t\tif (s[i] != s[j]) \n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\ti++;\n\t\tj--;\n\t}\n\treturn true;\n}",PARTIAL_ACCEPTED,67,512
1277175016402124800,d8321467439a37c77d422396cd6dd920b1748636a3c931dbeb45272c6d8542f2,2020-06-28 17:40:27,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\nusing namespace std;\nstring transform(int B, int num);\nbool is_num(string s);\n\nint main()\n{\n\tint N, S;\n\tcin>>N>>S;\n\tint m = 0, i = S;\n\twhile (m<N)\n\t{\n\t\ti++;\n\t\tint n = 0;\n\t\tfor (int j=2;j<=10;j++)\n\t\t{\n            if (is_num(transform(j,i))) \n\t\t\t{\n\t\t\t\tn++;\n\t\t\t}\n\t\t\tif (n>=2) \n\t\t\t{\n\t\t\t\tcout<<i<<endl;\n\t\t\t\tm++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}\n\nstring transform(int B, int num)\t\n{\n\tstring s = \""\"";\n\twhile (num != 0)\n\t{\n\t\ts = to_string(num % B) + s;\n\t\tnum = num / B;\n\t}\n\treturn s;\n}\n\nbool is_num(string s)\n{\n\tint i = 0, j = s.size()-1;\n\twhile(i < j)\n\t{\n\t\tif (s[i] != s[j]) \n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\ti++;\n\t\tj--;\n\t}\n\treturn true;\n}",ACCEPTED,105,628
1277175667056107520,8deffd1a550298bf3da4d16ad8bc34e4d5aeb10a1c2a49486eaf87f400ced3bd,2020-06-28 17:43:02,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nint main()\n{\n\tint n,a[100],b[100];\n\tcin>>n;\n\tfor(int i=1;i<=300;i++)\n\t{\n\t\tint m=i*i,j=0,t=1,p,o;\n\t\twhile(t!=0)\n\t\t{\n\t\t\tt=m/n;\n\t\t\ta[j++]=m%n;\n\t\t\tm=t;\n\t\t}\n\t\tt=1,p=i,o=0;\n\t\twhile(t!=0)\n\t\t{\n\t\t\tt=p/n;\n\t\t\tb[o++]=p%n;\n\t\t\tp=t;\n\t\t}\n\t\tint flag=0;\n\t\tfor(int i=0;i<j/2;i++)\n\t\t{\n\t\t\tif(a[i]!=a[j-1-i])\n\t\t\tflag = 1;\n\t\t}\n\t\tif(!flag)\n\t\t{\n\t\t\tfor(int i=o-1;i>=0;i--)\n\t\t\t{\n\t\t\t\tif(b[i]>=10)\n\t\t\t\tcout<<b[i]+55;\n\t\t\t\telse\n\t\t\t\tcout<<b[i];\n\t\t\t}\n\t\t\tcout<<\"" \"";\n\t\t\tfor(int i=0;i<j;i++)\n\t\t\t{\n\t\t\t\tif(a[i]>=10)\n\t\t\t\tcout<<a[i]+55;\n\t\t\t\telse\n\t\t\t\tcout<<a[i];\n\t\t\t}\n\t\t\tcout<<endl;\n\t\t}\n\t}\t\t\n}\n",PARTIAL_ACCEPTED,32,512
1277177574092890112,330a5297d7e1e7b447cf9c46172a252e9d593bccab3380e86ed2a79a2bc40fbc,2020-06-28 17:50:37,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n    int N=0;\n    cin >> N;\n    char List[20] = {'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\n    for (int i=1;i<=300;i++){\n        int square = i*i;\n        int Array[32];\n        for (int k=0;k<32;k++){\n            Array[k] = -1;\n        }\n        int mod;\n        int index1 = 0;\n        while ((square != 0)) {\n            mod = square%N;// 第一个模出的是最di位。\n            square = square/N;\n            Array[index1] = mod;\n            index1 ++;\n        }\n\n        bool key = true;\n        for (int k=0;k<index1;k++){\n            if (Array[k]!=Array[index1-1-k])\n                key = false;\n        }\n\n        if (key){\n            printf(\""%d \"",i);\n            for (int k=0;k<index1;k++){\n                printf(\""%c\"",List[Array[k]]);\n            }\n            printf(\""\\n\"");\n        }\n    }\n\n    return 0;\n}\n",PARTIAL_ACCEPTED,50,512
1277179557377933312,c9d3ae68a6071055ff2d59731ba6db15495e3f5be91d4a9ca76df94151610501,2020-06-28 17:58:29,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint n, s, i, j, k,l,a,b,c,cha[25],num,sign;\n\tcin >> n >> s;\n\tfor (i = 0, a = s + 1; i < n; a++)//i用于记录这是第几个，a用于记录当前正在验证的数\n\t{\n\t\tnum = 0; //num记录在几个进制中满足回文\n\t\tfor (j = 2; j <= 10; j++)//j代表进制\n\t\t{\n\t\t\tsign = 1;\n\t\t\tb = a ;\n\t\t\tfor (k = 0; b > 0; k++)\n\t\t\t{\n\t\t\t\tc = b % j;\n\t\t\t\tcha[k] = c;\n\t\t\t\tb = b / j;\n\t\t\t}\n\t\t\tfor (l = 0; l < k / 2; l++)\n\t\t\t{\n\t\t\t\tif (cha[l] != cha[k - 1 - l])sign = 0;\n\t\t\t}\n\t\t\tif (sign)\n\t\t\t{\n\t\t\t\tnum++;\n\t\t\t}\n\t\t\tif (num >= 2)\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (num >= 2)\n\t\t{\n\t\t\ti++;\n\t\t\tcout << a << endl;\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,34,412
1277179910940983296,330a5297d7e1e7b447cf9c46172a252e9d593bccab3380e86ed2a79a2bc40fbc,2020-06-28 17:59:54,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n    int N=0;\n    cin >> N;\n    char List[20] = {'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\n    for (int i=1;i<=300;i++){\n        int square = i*i;\n        int Array[32];\n        for (int k=0;k<32;k++){\n            Array[k] = -1;\n        }\n        int Array2[32];\n        int mod2;\n        int index2 = 0;\n        int mod;\n        int index1 = 0;\n        while ((square != 0)) {\n            mod = square%N;// 第一个模出的是最di位。\n            square = square/N;\n            Array[index1] = mod;\n            index1 ++;\n        }\n\n        int i2 = i;\n        while ((i2 != 0)) {\n            mod2 = i2%N;// 第一个模出的是最di位。\n            i2 = i2/N;\n            Array2[index2] = mod2;\n            index2 ++;\n        }\n\n        bool key = true;\n        for (int k=0;k<index1;k++){\n            if (Array[k]!=Array[index1-1-k])\n                key = false;\n        }\n\n        if (key){\n            for (int k=index2-1;k>=0;k--)\n                printf(\""%c\"",List[Array2[k]]);\n\n            printf(\"" \"");\n\n            for (int k=0;k<index1;k++){\n                printf(\""%c\"",List[Array[k]]);\n            }\n            printf(\""\\n\"");\n        }\n    }\n\n    return 0;\n}\n",ACCEPTED,24,484
1277182775830970368,167b7bc675fa331764ed6ad605b7971e44ca7ff76bf0d7e34dbc103f5ff570c1,2020-06-28 18:11:17,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <stdio.h>\nusing namespace std;\nint len;\n\nvoid conversion(int n, int mode, char[30]);\nbool palindrome(int s, int mode);\n\nint main()\n{\n    int N, S;\n    int mode, num = 0;\n    cin >> N;\n    cin >> S;\n    while (num < N)\n    {\n        S += 1;\n        int sum = 0;\n        for (mode = 2; mode <= 10; mode++)\n        {\n            if (palindrome(S, mode))\n            {\n                sum += 1;\n            }\n            if (sum >= 2)\n                break;\n        }\n        if (sum >= 2)\n        {\n            cout << S << endl;\n            num += 1;\n        }\n    }\n    return 0;\n}\n\nvoid conversion(int n, int mode, char a[30])\n{\n    int i = 0;\n    int t;\n    len = 0;\n    while (n > 0)\n    {\n        a[i] = n % mode + 48;\n        n = n / mode;\n        i += 1;\n        len += 1;\n    }\n}\n\nbool palindrome(int s, int mode)\n{\n    int i, j;\n    char a[30];\n    conversion(s, mode, a);\n    i = 0;\n    j = len - 1;\n    while (i < j)\n    {\n        if (a[i] != a[j])\n            return 0;\n        i += 1;\n        j -= 1;\n    }\n    return 1;\n}",ACCEPTED,57,492
1277186185179357184,8c56bfdbe6590a3d214c41dad15dfc76cffb43d7c88360c085da8afe6e5bd4cf,2020-06-28 18:24:50,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nchar change(int i)\n{\n\tchar ch;\n\tif (i < 10)\n\t\tch = i + '0';\n\telse \n\t\tch = (i - 10) + 'A';\n\treturn ch;\n}\nvoid transfer(int n, int i)\n{\n\tint p, q = 0, j = 0,  m;\n\tchar a[200],b[200];\n\tm = i * i;\n\twhile (m / n != 0)\n\t{\n\t\tp = m % n;\n\t\tm = m / n;\n\t\tb[j++] = change(p);\n\t}\n\tb[j] = change(m);\n\n\tfor (m = 0; m < j+1; m++)\n\t{\n\t\tp = j - m;\n\t\tif (b[p] != b[m])\n\t\t\treturn;\n\t}\n\n\twhile (i / n != 0)\n\t{\n\t\tp = i % n;\n\t\ti = i / n;\n\t\ta[q++] = change(p);\n\t}\n\ta[q] = change(i);\n\tfor (m = 0; m <= q; m++)\n\t{\n\t\tcout << a[m];\n\t}\n\tcout << ' ';\n\tfor (m = 0; m <= j; m++)\n\t{\n\t\tcout << b[m];\n\t}\n\tcout << endl;\n}\n\nint main()\n{\n\tint n, i;\n\tcin >> n;\n\tfor (i = 1; i < 301; i++)\n\t{\n\t\ttransfer(n, i);\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,35,512
1277186671810895872,330a5297d7e1e7b447cf9c46172a252e9d593bccab3380e86ed2a79a2bc40fbc,2020-06-28 18:26:46,C++,40.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n    int S,N;\n    scanf(\""%d %d\"",&S,&N);\n    int wholecount=0;\n    char List[20] = {'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\n    while(true){\n        N++;\n        int count = 0;\n        for (int k=2;k<11;k++){\n            int Array[32];\n            int index1 = 0;\n            int mod;\n            int N2 = N;\n            while ((N2 != 0)) {\n            mod = N2%k;// 第一个模出的是最di位。\n            N2 = N2/k;\n            Array[index1] = mod;\n            index1 ++;\n            }\n            bool key = 1;\n            for (int k2=0;k2<index1;k2++){\n                if (Array[k2]!=Array[index1-1-k2])\n                    key = false;\n            }\n\n            if (key){\n                count ++;\n            }\n        }\n        if (count >=2){\n            wholecount ++;\n            printf(\""%d\\n\"",N);\n            continue;\n        }\n        if (wholecount==S){\n            break;\n        }\n    }\n\n    return 0;\n}\n",PARTIAL_ACCEPTED,15,424
1277187099541823488,330a5297d7e1e7b447cf9c46172a252e9d593bccab3380e86ed2a79a2bc40fbc,2020-06-28 18:28:28,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n    int S,N;\n    scanf(\""%d %d\"",&S,&N);\n    int wholecount=0;\n    char List[20] = {'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\n    while(true){\n        N++;\n        int count = 0;\n        for (int k=2;k<11;k++){\n            int Array[32];\n            int index1 = 0;\n            int mod;\n            int N2 = N;\n            while ((N2 != 0)) {\n            mod = N2%k;// 第一个模出的是最di位。\n            N2 = N2/k;\n            Array[index1] = mod;\n            index1 ++;\n            }\n            bool key = 1;\n            for (int k2=0;k2<index1;k2++){\n                if (Array[k2]!=Array[index1-1-k2])\n                    key = false;\n            }\n\n            if (key){\n                count ++;\n            }\n        }\n        if (count >=2){\n            wholecount ++;\n            printf(\""%d\\n\"",N);\n        }\n        if (wholecount==S){\n            break;\n        }\n    }\n\n    return 0;\n}\n",ACCEPTED,43,512
1277187382489571328,8c56bfdbe6590a3d214c41dad15dfc76cffb43d7c88360c085da8afe6e5bd4cf,2020-06-28 18:29:35,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nchar change(int i)\n{\n\tchar ch;\n\tif (i < 10)\n\t\tch = i + '0';\n\telse \n\t\tch = (i - 10) + 'A';\n\treturn ch;\n}\nvoid transfer(int n, int i)\n{\n\tint p, q = 0, j = 0,  m;\n\tchar a[200],b[200];\n\tm = i * i;\n\twhile (m / n != 0)\n\t{\n\t\tp = m % n;\n\t\tm = m / n;\n\t\tb[j++] = change(p);\n\t}\n\tb[j] = change(m);\n\n\tfor (m = 0; m < j+1; m++)\n\t{\n\t\tp = j - m;\n\t\tif (b[p] != b[m])\n\t\t\treturn;\n\t}\n\n\twhile (i / n != 0)\n\t{\n\t\tp = i % n;\n\t\ti = i / n;\n\t\ta[q++] = change(p);\n\t}\n\ta[q] = change(i);\n\tfor (m = q; m >= 0; m--)\n\t{\n\t\tcout << a[m];\n\t}\n\tcout << ' ';\n\tfor (m = j; m >= 0; m--)\n\t{\n\t\tcout << b[m];\n\t}\n\tcout << endl;\n}\n\nint main()\n{\n\tint n, i;\n\tcin >> n;\n\tfor (i = 1; i < 301; i++)\n\t{\n\t\ttransfer(n, i);\n\t}\n\treturn 0;\n}",ACCEPTED,49,512
1277207337075400704,3aaf4a732f987c33a81e41e1172d3cf2aa189e2b3924d74038f27ba4d11214e7,2020-06-28 19:48:53,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n#include<math.h>\nint js(int x,int b);\nint main()\n{\n\tint b,i,j;\n\tscanf(\""%d\"",&b);\n\tfor(i=1;i<=300;i++)\n\t{\n\t\tj=i*i;\n\t\tif(j/b==0)\nprintf(\""%d %d\\n\"",i,j);\nelse if(js(j,b)==2)\nprintf(\""%d %d\\n\"",i,j);}\n\treturn 0;\n}\n\n\nint js(int x,int b)\n{\n\tint i=1,flag=2;\n\tint f;\n\tf=x;\n\tif(x/10!=0)\n\t{\n\t\ti++;\n\t\tx=x/10;\n\t}\n\tfor(i;i>1;)\n\t{\n\t\tif(f/(pow(b,i-1))!=f%b)\n\t\t\tflag=1;\n\t\ti=i-2;\n\t\tf=f/10;\n\n\t}\n\treturn flag;\n\n}\n",WRONG_ANSWER,38,388
1277207666990964736,3aaf4a732f987c33a81e41e1172d3cf2aa189e2b3924d74038f27ba4d11214e7,2020-06-28 19:50:11,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n#include<math.h>\nint js(int x,int b);\nint main()\n{\n\tint b,i,j;\n\tscanf(\""%d\"",&b);\n\tfor(i=1;i<=300;i++)\n\t{\n\t\tj=i*i;\n\t\tif(j/b==0)\nprintf(\""%d %d\\n\"",i,j);\nelse if(js(j,b)==2)\nprintf(\""%d %d\\n\"",i,j);}\n\treturn 0;\n}\n\n\nint js(int x,int b)\n{\n\tint i=1,flag=2;\n\tint f;\n\tf=x;\n\tif(x/10!=0)\n\t{\n\t\ti++;\n\t\tx=x/10;\n\t}\n\tfor(i;i>1;)\n\t{\n\t\tif((f/(pow(b,i-1)))!=f%b)\n\t\t\tflag=1;\n\t\ti=i-2;\n\t\tf=f/10;\n\n\t}\n\treturn flag;\n\n}\n",WRONG_ANSWER,27,412
1277207718819987456,82e4af574b47d8c6ec0df4872de0940e85d938b8ac62ac4cdcb9a84177b464d3,2020-06-28 19:50:24,Python,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"n=int(input())\ndef jz(x,n):\n    lst='0123456789ABCDEFGHIJ'\n    nums=\""\""\n    while True:\n        a=x//n\n        b=x%n\n        nums+=str(b)\n        if a==0:\n            break\n        x=a\n\n    nums1=nums[::-1]\n    return nums1\nfor i in range(1,301):\n    jz_num=jz(i,n)\n    jz_num1=jz(i*i,n)\n    if str(jz_num1)==str(jz_num1)[::-1]:\n        print(jz_num,jz_num1)",PARTIAL_ACCEPTED,191,3020
1277208205061447680,82e4af574b47d8c6ec0df4872de0940e85d938b8ac62ac4cdcb9a84177b464d3,2020-06-28 19:52:20,Python,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"n=int(input())\ndef jz(x,n):\n    lst='0123456789ABCDEFGHIJ'\n    nums=\""\""\n    while True:\n        a=x//n\n        b=x%n\n        nums+=str(b)\n        if a==0:\n            break\n        x=a\n    nums1=nums[::-1]\n    return nums1\nfor i in range(1,301):\n    jz_num=jz(i,n)\n    jz_num1=jz(i*i,n)\n    if str(jz_num1)==str(jz_num1)[::-1]:\n        print(jz_num,jz_num1)",PARTIAL_ACCEPTED,170,3072
1277208649515065344,82e4af574b47d8c6ec0df4872de0940e85d938b8ac62ac4cdcb9a84177b464d3,2020-06-28 19:54:06,Python,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"n=int(input())\ndef jz(x,n):\n    lst='0123456789ABCDEFGHIJ'\n    nums=\""\""\n    if n==10:\n        return x\n    else:\n        while True:\n            a=x//n\n            b=x%n\n            nums+=str(b)\n            if a==0:\n                break\n            x=a\n        nums1=nums[::-1]\n        return nums1\nfor i in range(1,301):\n    jz_num=jz(i,n)\n    jz_num1=jz(i*i,n)\n    if str(jz_num1)==str(jz_num1)[::-1]:\n        print(jz_num,jz_num1)",PARTIAL_ACCEPTED,223,3072
1277210902657433600,82e4af574b47d8c6ec0df4872de0940e85d938b8ac62ac4cdcb9a84177b464d3,2020-06-28 20:03:03,Python,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"n=int(input())\ndef jz(x,n):\n    lst='0123456789ABCDEFGHIJ'\n    nums=\""\""\n    if n==10:\n        return x\n    else:\n        while True:\n            a=x//n\n            b=x%n\n            nums+=str(lst[b])\n            if a==0:\n                break\n            x=a\n        nums1=nums[::-1]\n        return nums1\nfor i in range(1,301):\n    jz_num=jz(i,n)\n    jz_num1=jz(i*i,n)\n    if str(jz_num1)==str(jz_num1)[::-1]:\n        print(jz_num,jz_num1)",ACCEPTED,232,3076
1277211756257017856,82e4af574b47d8c6ec0df4872de0940e85d938b8ac62ac4cdcb9a84177b464d3,2020-06-28 20:06:26,Python,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"N,S=map(int,input().split())\ndef jz(x,n):\n    lst='0123456789'\n    nums=\""\""\n    if n==10:\n        return x\n    else:\n        while True:\n            a=x//n\n            b=x%n\n            nums+=str(lst[b])\n            if a==0:\n                break\n            x=a\n        nums1=nums[::-1]\n        return nums1\npronums=[]\nfor i in range(S+1,10000):\n    count=0\n    for j in range(2,11):\n        if str(jz(i,j))==str(jz(i,j))[::-1] and str(jz(i,j))[0]!='0' and str(jz(i,j))[-1]!='0':\n            count+=1\n    if count>=2:\n        pronums.append(i)\nfor i in pronums[:N]:\n    print(i)",MULTIPLE_ERROR,30,2944
1277213103329042432,1e09604bb904accc49699524519c74420d445a47f7f389b1f4722796312b3254,2020-06-28 20:11:47,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <cstdio>\n#include <algorithm>\n#include <iomanip>\n#include <cstdlib>\n\nusing namespace std;\n\nint main() {\n    int n, sq, len, len1;//jin_zhi\n    cin >> n;\n    for (int i = 1; i <= 300; i++) {\n        char s[1001], t[1001];\n        int flag = 1;\n        /*_itoa(i, s, n);\n        len = strlen(s);\n        for (int j = 0; j < len; j++) {\n            if (s[j] != s[len - j - 1])\n                flag = 0;\n        }*/\n        sq = i * i;\n        _itoa(sq, t, n);\n        len1 = strlen(t);\n        for (int j = 0; j < len1; j++) {\n            if (t[j] != t[len1 - j - 1])\n                flag = 0;\n        }\n\n        if (flag == 1) {\n            //for (int j = 0; j < len; j++)\n            //cout << s[j];\n            cout << i << \"" \"";\n            for (int j = 0; j < len1; j++)\n                cout << t[j];\n            cout << endl;\n        }\n    }\n\n    return 0;\n}\n",COMPILE_ERROR,0,0
1277213172753170432,1e09604bb904accc49699524519c74420d445a47f7f389b1f4722796312b3254,2020-06-28 20:12:04,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <cstdio>\n#include <algorithm>\n#include <iomanip>\n#include <cstdlib>\n\nusing namespace std;\n\nint main() {\n    int n, sq, len, len1;\n    cin >> n;\n    for (int i = 1; i <= 300; i++) {\n        char s[1001], t[1001];\n        int flag = 1;\n        /*_itoa(i, s, n);\n        len = strlen(s);\n        for (int j = 0; j < len; j++) {\n            if (s[j] != s[len - j - 1])\n                flag = 0;\n        }*/\n        sq = i * i;\n        _itoa(sq, t, n);\n        len1 = strlen(t);\n        for (int j = 0; j < len1; j++) {\n            if (t[j] != t[len1 - j - 1])\n                flag = 0;\n        }\n\n        if (flag == 1) {\n            //for (int j = 0; j < len; j++)\n            //cout << s[j];\n            cout << i << \"" \"";\n            for (int j = 0; j < len1; j++)\n                cout << t[j];\n            cout << endl;\n        }\n    }\n\n    return 0;\n}\n",COMPILE_ERROR,0,0
1277213261542391808,1e09604bb904accc49699524519c74420d445a47f7f389b1f4722796312b3254,2020-06-28 20:12:25,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <cstdio>\n#include <algorithm>\n#include <iomanip>\n#include <cstdlib>\n\nusing namespace std;\n\nint main() {\n    int n, sq, len, len1;\n    cin >> n;\n    for (int i = 1; i <= 300; i++) {\n        char s[1001], t[1001];\n        int flag = 1;\n        sq = i * i;\n        _itoa(sq, t, n);\n        len1 = strlen(t);\n        for (int j = 0; j < len1; j++) {\n            if (t[j] != t[len1 - j - 1])\n                flag = 0;\n        }\n\n        if (flag == 1) {\n            cout << i << \"" \"";\n            for (int j = 0; j < len1; j++)\n                cout << t[j];\n            cout << endl;\n        }\n    }\n\n    return 0;\n}\n",COMPILE_ERROR,0,0
1277213442434326528,1e09604bb904accc49699524519c74420d445a47f7f389b1f4722796312b3254,2020-06-28 20:13:08,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <cstdio>\n#include <algorithm>\n#include <iomanip>\n#include <cstdlib>\n\nusing namespace std;\n\nint main() {\n    int n, sq, len, len1;\n    cin >> n;\n    for (int i = 1; i <= 300; i++) {\n        char s[1001], t[1001];\n        int flag = 1;\n        sq = i * i;\n        itoa(sq, t, n);\n        len1 = strlen(t);\n        for (int j = 0; j < len1; j++) {\n            if (t[j] != t[len1 - j - 1])\n                flag = 0;\n        }\n\n        if (flag == 1) {\n            cout << i << \"" \"";\n            for (int j = 0; j < len1; j++)\n                cout << t[j];\n            cout << endl;\n        }\n    }\n\n    return 0;\n}\n",COMPILE_ERROR,0,0
1277213634554421248,8deffd1a550298bf3da4d16ad8bc34e4d5aeb10a1c2a49486eaf87f400ced3bd,2020-06-28 20:13:54,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <stack>\n#include<string.h>\n#include<algorithm>\nusing namespace std;\n \nchar jinzhi[100],len;\nint transf(int a,int b)    \n{\n    int c,d,i=0;\n    stack<char>s;\n    while(a)\n    {\n        c=a/b;\n        d=a%b;\n        if(d>=10)\n            s.push('A'+d-10);\n        else\n            s.push('0'+d);\n        a=c;\n    }\n    while(!s.empty())\n    {\n        jinzhi[i]=s.top();\n        i++;\n        s.pop();\n    }\n    len=i;\n    return 0;\n}\n \n \nbool judge(char a[])\n{\n    int i;\n    for(i=0;i<len/2+1;i++)\n        if(a[i]!=a[len-i-1])\n            return false;\n    return true;\n}\n \nint main()\n{\n    int i,j,n,len1;\n    char temp[100];\n    cin>>n;\n    for(i=1;i<=300;i++)\n    {\n        transf(i*i,n);\n        if(judge(jinzhi))\n        {\n            for(j=0;j<len;j++)\n                temp[j]=jinzhi[j];\n            len1=len;\n            transf(i,n);\n            for(j=0;j<len;j++)\n            cout<<jinzhi[j];\n            cout<<' ';\n            for(j=0;j<len1;j++)\n            cout<<temp[j];\n            cout<<endl;\n        }\n    }\n    return 0;\n}",ACCEPTED,51,512
1277213772760940544,1e09604bb904accc49699524519c74420d445a47f7f389b1f4722796312b3254,2020-06-28 20:14:27,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cstring>\n#include <cstdio>\n#include <algorithm>\n#include <iomanip>\n#include <cstdlib>\n\nusing namespace std;\n\nint main() {\n    int n, sq, len, len1;\n    cin >> n;\n    for (int i = 1; i <= 300; i++) {\n        char s[1001], t[1001];\n        int flag = 1;\n        sq = i * i;\n        itoa(sq, t, n);\n        len1 = strlen(t);\n        for (int j = 0; j < len1; j++) {\n            if (t[j] != t[len1 - j - 1])\n                flag = 0;\n        }\n\n        if (flag == 1) {\n            cout << i << \"" \"";\n            for (int j = 0; j < len1; j++)\n                cout << t[j];\n            cout << endl;\n        }\n    }\n\n    return 0;\n}\n",COMPILE_ERROR,0,0
1277214047819194368,1e09604bb904accc49699524519c74420d445a47f7f389b1f4722796312b3254,2020-06-28 20:15:33,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cstring>\n#include <cstdio>\n#include <algorithm>\n#include <iomanip>\n#include <stdlib.h>\n\nusing namespace std;\n\nint main() {\n    int n, sq, len, len1;\n    cin >> n;\n    for (int i = 1; i <= 300; i++) {\n        char s[1001], t[1001];\n        int flag = 1;\n        sq = i * i;\n        itoa(sq, t, n);\n        len1 = strlen(t);\n        for (int j = 0; j < len1; j++) {\n            if (t[j] != t[len1 - j - 1])\n                flag = 0;\n        }\n\n        if (flag == 1) {\n            cout << i << \"" \"";\n            for (int j = 0; j < len1; j++)\n                cout << t[j];\n            cout << endl;\n        }\n    }\n\n    return 0;\n}\n",COMPILE_ERROR,0,0
1277214134167330816,1e09604bb904accc49699524519c74420d445a47f7f389b1f4722796312b3254,2020-06-28 20:15:53,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cstring>\n#include <cstdio>\n#include <algorithm>\n#include <iomanip>\n#include <stdlib.h>\n\nusing namespace std;\n\nint main() {\n    int n, sq, len, len1;\n    cin >> n;\n    for (int i = 1; i <= 300; i++) {\n        char s[1001], t[1001];\n        int flag = 1;\n        sq = i * i;\n        itoa(sq, t, n);\n        len1 = strlen(t);\n        for (int j = 0; j < len1; j++) {\n            if (t[j] != t[len1 - j - 1])\n                flag = 0;\n        }\n\n        if (flag == 1) {\n            cout << i << \"" \"";\n            for (int j = 0; j < len1; j++)\n                cout << t[j];\n            cout << endl;\n        }\n    }\n\n    return 0;\n}\n",COMPILE_ERROR,0,0
1277214675593265152,1e09604bb904accc49699524519c74420d445a47f7f389b1f4722796312b3254,2020-06-28 20:18:02,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cstring>\n#include <cstdio>\n#include <algorithm>\n#include <iomanip>\n#include <cstdlib>\n\nusing namespace std;\n\nint main() {\n    int n, sq, len, len1;\n    cin >> n;\n    for (int i = 1; i <= 300; i++) {\n        char s[1001], t[1001];\n        int flag = 1;\n        sq = i * i;\n        itoa(sq, t, n);\n        len1 = strlen(t);\n        for (int j = 0; j < len1; j++) {\n            if (t[j] != t[len1 - j - 1])\n                flag = 0;\n        }\n\n        if (flag == 1) {\n            cout << i << \"" \"";\n            for (int j = 0; j < len1; j++)\n                cout << t[j];\n            cout << endl;\n        }\n    }\n\n    return 0;\n}\n",COMPILE_ERROR,0,0
1277215000052031488,82e4af574b47d8c6ec0df4872de0940e85d938b8ac62ac4cdcb9a84177b464d3,2020-06-28 20:19:20,Python,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"N,S=map(int,input().split())\ndef jz(x,n):\n    lst='0123456789'\n    nums=\""\""\n    while True:\n            a=x//n\n            b=x%n\n            nums+=str(lst[b])\n            if a==0:\n                break\n            x=a\n        nums1=nums[::-1]\n        return nums1\npronums=[]\nfor i in range(S+1,10000):\n    count=0\n    for j in range(2,11):\n        if str(jz(i,j))==str(jz(i,j))[::-1] and str(jz(i,j))[0]!='0' and str(jz(i,j))[-1]!='0':\n            count+=1\n    if count>=2:\n        pronums.append(i)\nfor i in pronums[:N]:\n    print(i)",NON_ZERO_EXIT_CODE,187,3112
1277215444144947200,82e4af574b47d8c6ec0df4872de0940e85d938b8ac62ac4cdcb9a84177b464d3,2020-06-28 20:21:06,Python,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"N,S=map(int,input().split())\ndef jz(x,n):\n    lst='0123456789'\n    nums=\""\""\n    while True:        \n        a=x//n\n        b=x%n\n        nums+=str(lst[b])\n        if a==0:\n            break\n         x=a\n    nums1=nums[::-1]\n    return nums1\npronums=[]\nfor i in range(S+1,10000):\n    count=0\n    for j in range(2,11):\n        if str(jz(i,j))==str(jz(i,j))[::-1] and str(jz(i,j))[0]!='0' and str(jz(i,j))[-1]!='0':\n            count+=1\n    if count>=2:\n        pronums.append(i)\nfor i in pronums[:N]:\n    print(i)",NON_ZERO_EXIT_CODE,194,2984
1277216164747345920,82e4af574b47d8c6ec0df4872de0940e85d938b8ac62ac4cdcb9a84177b464d3,2020-06-28 20:23:57,Python,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"N,S=map(int,input().split())\ndef jz(x,n):\n    lst='0123456789'\n    nums=\""\""\n    while True:\n        a=x//n\n        b=x%n\n        nums+=lst[b]\n        if a==0:\n            break\n        x=a\n    nums1=nums[::-1]\n    return nums1\npronums=[]\nfor i in range(S+1,10000):\n    count=0\n    for j in range(2,11):\n        if jz(i,j)==jz(i,j)[::-1] and jz(i,j)[0]!='0' and \\\n            jz(i,j)[-1]!='0':\n            count+=1\n    if count>=2:\n        pronums.append(i)\nfor i in pronums[:N]:\n    print(i)",PARTIAL_ACCEPTED,429,3060
1277217078749093888,0660b9c9140341e5aa83535a78d6b7d07399ba8e63d999f57ffcd66499c26587,2020-06-28 20:27:35,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint B, i, j, k, num, pal[300];\n\tcin >> B;\n\tfor (i = 1; i <= 300; i++)\n\t{\n\t\tnum = i*i;\n\t\tfor (j = 0; num != 0; j++)\n\t\t{\n\t\t\tpal[j] = num % B;\n\t\t\tnum = num / B;\n\t\t}\n\t\tj = j - 1;\n\t\tfor (k = 0; k <= j / 2; k++)\n\t\t\tif (pal[k] != pal[j - k])\n\t\t\t{\t\n\t\t\t\tk = -1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\tif (k != -1)\n\t\t{\n\t\t\tcout << i << \"" \"";\n\t\t\tfor (k = 0; k <= j; k++)\n\t\t\t{\n\t\t\t\tif (pal[k] < 10)\n\t\t\t\t\tcout << pal[k];\n\t\t\t\telse\n\t\t\t\t\tcout << char(pal[k] + 55);\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n}",PARTIAL_ACCEPTED,36,484
1277220616598380544,0660b9c9140341e5aa83535a78d6b7d07399ba8e63d999f57ffcd66499c26587,2020-06-28 20:41:39,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint B, i, j, k,l, num, pal[300], ori[300];\n\tcin >> B;\n\tfor (i = 1; i <= 300; i++)\n\t{\n\t\tnum = i*i;\n\t\tfor (j = 0; num != 0; j++)\n\t\t{\n\t\t\tpal[j] = num % B;\n\t\t\tnum = num / B;\n\t\t}\n\t\tj = j - 1;\n\t\tfor (k = 0; k <= j / 2; k++)\n\t\t\tif (pal[k] != pal[j - k])\n\t\t\t{\t\n\t\t\t\tk = -1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\tif (k != -1)\n\t\t{\n\t\t\tnum = i;\n\t\t\tfor (k = 0; num != 0; k++)\n\t\t\t{\n\t\t\t\tori[k] = num % B;\n\t\t\t\tnum = num / B;\n\t\t\t}\n\t\t\tfor (l = k - 1; l >= 0; l--)\n\t\t\t{\n\t\t\t\tif (ori[l] < 10)\n\t\t\t\t\tcout << ori[l];\n\t\t\t\telse\n\t\t\t\t\tcout << char(ori[l] + 55);\n\t\t\t}\n\t\t\tcout << \"" \"";\n\t\t\tfor (k = 0; k <= j; k++)\n\t\t\t{\n\t\t\t\tif (pal[k] < 10)\n\t\t\t\t\tcout << pal[k];\n\t\t\t\telse\n\t\t\t\t\tcout << char(pal[k] + 55);\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n}",ACCEPTED,48,512
1277222161788362752,8c56bfdbe6590a3d214c41dad15dfc76cffb43d7c88360c085da8afe6e5bd4cf,2020-06-28 20:47:47,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nchar change(int i)\n{\n\tchar ch;\n\tif (i < 10)\n\t\tch = i + '0';\n\telse\n\t\tch = (i - 10) + 'A';\n\treturn ch;\n}\nbool transfer(int n, int i)\n{\n\tint p, q = 0, j = 0, m;\n\tchar  b[200];\n\tm = i * i;\n\twhile (m / n != 0)\n\t{\n\t\tp = m % n;\n\t\tm = m / n;\n\t\tb[j++] = change(p);\n\t}\n\tb[j] = change(m);\n\n\tfor (m = 0; m < j + 1; m++)\n\t{\n\t\tp = j - m;\n\t\tif (b[p] != b[m])\n\t\t\treturn false;\n\t}\n\treturn true;\n\t\n}\n\nint main()\n{\n\tint n, s, i, j, num=0, q=0;\n\tcin >> n >> s;\n\tfor (i = s+1;; i++)\n\t{\n\t\tfor (j = 2;; j++)\n\t\t{\n\t\t\tif (transfer(j, i))\n\t\t\t{\n\t\t\t\tnum++;\n\t\t\t\tif (num > 1)\n\t\t\t\t{\n\t\t\t\t\tcout << i << endl;\n\t\t\t\t\tq++;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (q == n)\n\t\t\tbreak;\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,23,424
1277222383633489920,3aaf4a732f987c33a81e41e1172d3cf2aa189e2b3924d74038f27ba4d11214e7,2020-06-28 20:48:40,C,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n#include<math.h>\nint js(int x,int b);\nint main()\n{\n\tint b,i,j;\n\tscanf(\""%d\"",&b);\n\tfor(i=1;i<=300;i++)\n\t{\n\t\tj=i*i;\n\t\tif(j/b==0)\nprintf(\""%d %d\\n\"",i,j);\nelse if(js(j,b)==2)\nprintf(\""%d %d\\n\"",i,j);}\n\treturn 0;\n}\n\n\nint js(int x,int b)\n{\n\tint i=1,flag=2;\n\tint f,e,g;\n\tf=x;\n\twhile(x/b!=0)\n\t{\n\t\ti++;\n\t\tx=x/b;\n\t}\n\twhile(i>1)\n\t{\n\t\te=f/(pow(b,i-1));\n\t\t\tg=e%b;\n\t\tif(g!=f%b)\n\t\t\tflag=1;\n\t\ti=i-2;\n\t\tf=f/b;\n\n\t}\n\treturn flag;\n\n}\n",PARTIAL_ACCEPTED,33,408
1277222853420711936,8c56bfdbe6590a3d214c41dad15dfc76cffb43d7c88360c085da8afe6e5bd4cf,2020-06-28 20:50:32,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nchar change(int i)\n{\n\tchar ch;\n\tif (i < 10)\n\t\tch = i + '0';\n\telse\n\t\tch = (i - 10) + 'A';\n\treturn ch;\n}\nbool transfer(int n, int i)\n{\n\tint p, q = 0, j = 0, m;\n\tchar  b[200];\n\tm = i * i;\n\twhile (m / n != 0)\n\t{\n\t\tp = m % n;\n\t\tm = m / n;\n\t\tb[j++] = change(p);\n\t}\n\tb[j] = change(m);\n\n\tfor (m = 0; m < j + 1; m++)\n\t{\n\t\tp = j - m;\n\t\tif (b[p] != b[m])\n\t\t\treturn false;\n\t}\n\treturn true;\n\t\n}\n\nint main()\n{\n\tint n, s, i, j, num=0, q=0;\n\tcin >> n >> s;\n\tfor (i = s+1;; i++)\n\t{\n\t\tfor (j = 2;; j++)\n\t\t{\n\t\t\tif (transfer(j, i))\n\t\t\t{\n\t\t\t\tnum++;\n\t\t\t\tif (num > 2)\n\t\t\t\t{\n\t\t\t\t\tcout << i << endl;\n\t\t\t\t\tq++;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (q == n)\n\t\t\tbreak;\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,38,504
1277223630298087424,1e09604bb904accc49699524519c74420d445a47f7f389b1f4722796312b3254,2020-06-28 20:53:37,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cstring>\n#include <cstdio>\n#include <cstdlib>\n\nusing namespace std;\n\nint main() {\n    int n, sq, len, len1;\n    cin >> n;\n    for (int i = 1; i <= 300; i++) {\n        char s[1001], t[1001];\n        int flag = 1;\n        sq = i * i;\n        itoa(sq, t, n);\n        len1 = strlen(t);\n        for (int j = 0; j < len1; j++) {\n            if (t[j] != t[len1 - j - 1])\n                flag = 0;\n        }\n\n        if (flag == 1) {\n            cout << i << \"" \"";\n            for (int j = 0; j < len1; j++)\n                cout << t[j];\n            cout << endl;\n        }\n    }\n\n    return 0;\n}\n",COMPILE_ERROR,0,0
1277224963524722688,8c56bfdbe6590a3d214c41dad15dfc76cffb43d7c88360c085da8afe6e5bd4cf,2020-06-28 20:58:55,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nchar change(int i)\n{\n\tchar ch;\n\tif (i < 10)\n\t\tch = i + '0';\n\telse\n\t\tch = (i - 10) + 'A';\n\treturn ch;\n}\nbool transfer(int n, int m)\n{\n\tint p, q = 0, j = 0;\n\tchar  b[200];\n\twhile (m / n != 0)\n\t{\n\t\tp = m % n;\n\t\tm = m / n;\n\t\tb[j++] = change(p);\n\t}\n\tb[j] = change(m);\n\n\tfor (m = 0; m < j + 1; m++)\n\t{\n\t\tp = j - m;\n\t\tif (b[p] != b[m])\n\t\t\treturn false;\n\t}\n\treturn true;\n}\n\n\nint main()\n{\n\tint n, s, i, j, num=0, q=0;\n\tcin >> n >> s;\n\tfor (i = s+1;; i++)\n\t{\n\t\tfor (j = 2;j <= 10; j++)\n\t\t{\n\t\t\tif (transfer(j, i))\n\t\t\t{\n\t\t\t\tnum++;\n\t\t\t\tif (num > 2)\n\t\t\t\t{\n\t\t\t\t\tcout << i << endl;\n\t\t\t\t\tq++;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (q == n)\n\t\t\tbreak;\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,29,632
1277229444433903616,0660b9c9140341e5aa83535a78d6b7d07399ba8e63d999f57ffcd66499c26587,2020-06-28 21:16:43,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint N, S, i, j, k, l, count = 0, num, ok, temp[100];\n\tcin >> N >> S;\n\tfor (i = S+1; count < N; i++)\n\t{\n\t\tok = 0;\n\t\tnum = i;\n\t\tfor (j = 2; j <= 10; j++)\n\t\t{\n\t\t\tfor(k=0;num!=0;k++)\n\t\t\t{ \n\t\t\t\ttemp[k] = num % j;\n\t\t\t\tnum = num / j;\n\t\t\t}\n\t\t\tfor (l = 0; l <= k / 2; l++)\n\t\t\t\tif (temp[l] != temp[k - l])\n\t\t\t\t{\n\t\t\t\t\tl = -1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\tif (l != -1)\n\t\t\t\tok++;\n\t\t}\n\t\tif (ok >= 2)\n\t\t{\n\t\t\tcount++;\n\t\t\tcout << i << endl;\n\t\t}\n\t}\n}",COMPILE_ERROR,0,0
1277229567951962112,8c56bfdbe6590a3d214c41dad15dfc76cffb43d7c88360c085da8afe6e5bd4cf,2020-06-28 21:17:13,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nbool transfer(int n, int m)\n{\n\tint p, q = 0, j = 0;\n\tchar  b[10000];\n\twhile (m / n != 0)\n\t{\n\t\tp = m % n;\n\t\tm = m / n;\n\t\tb[j++] = p + '0';\n\t}\n\tb[j] = m + '0';\n\n\tfor (m = 0; m < j + 1; m++)\n\t{\n\t\tp = j - m;\n\t\tif (b[p] != b[m])\n\t\t\treturn false;\n\t}\n\treturn true;\n}\n\n\nint main()\n{\n\tint n, s, i, j, num=0, q=0;\n\tcin >> n >> s;\n\tfor (i = s+1;; i++)\n\t{\n\t\tfor (j = 2;j <= 10; j++)\n\t\t{\n\t\t\tif (transfer(j, i))\n\t\t\t{\n\t\t\t\tnum++;\n\t\t\t\tif (num == 2)\n\t\t\t\t{\n\t\t\t\t\tcout << i << endl;\n\t\t\t\t\tq++;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (q == n)\n\t\t\tbreak;\n\t\tnum = 0;\n\t}\n\treturn 0;\n}",ACCEPTED,45,552
1277229598280966144,0660b9c9140341e5aa83535a78d6b7d07399ba8e63d999f57ffcd66499c26587,2020-06-28 21:17:20,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint N, S, i, j, k, l, count = 0, num, ok, temp[100];\n\tcin >> N >> S;\n\tfor (i = S+1; count < N; i++)\n\t{\n\t\tok = 0;\n\t\tnum = i;\n\t\tfor (j = 2; j <= 10; j++)\n\t\t{\n\t\t\tfor(k=0;num!=0;k++)\n\t\t\t{ \n\t\t\t\ttemp[k] = num % j;\n\t\t\t\tnum = num / j;\n\t\t\t}\n\t\t\tfor (l = 0; l <= k / 2; l++)\n\t\t\t\tif (temp[l] != temp[k - l])\n\t\t\t\t{\n\t\t\t\t\tl = -1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\tif (l != -1)\n\t\t\t\tok++;\n\t\t}\n\t\tif (ok >= 2)\n\t\t{\n\t\t\tcount++;\n\t\t\tcout << i << endl;\n\t\t}\n\t}\n}",COMPILE_ERROR,0,0
1277229824936960000,0660b9c9140341e5aa83535a78d6b7d07399ba8e63d999f57ffcd66499c26587,2020-06-28 21:18:14,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint N, S, i, j, k, l, count = 0, num, ok, temp[100];\n\tcin >> N >> S;\n\tfor (i = S+1; count < N; i++)\n\t{\n\t\tok = 0;\n\t\tnum = i;\n\t\tfor (j = 2; j <= 10; j++)\n\t\t{\n\t\t\tfor(k=0;num!=0;k++)\n\t\t\t{ \n\t\t\t\ttemp[k] = num % j;\n\t\t\t\tnum = num / j;\n\t\t\t}\n\t\t\tfor (l = 0; l <= k / 2; l++)\n\t\t\t\tif (temp[l] != temp[k - l])\n\t\t\t\t{\n\t\t\t\t\tl = -1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\tif (l != -1)\n\t\t\t\tok++;\n\t\t}\n\t\tif (ok >= 2)\n\t\t{\n\t\t\tcount++;\n\t\t\tcout << i << endl;\n\t\t}\n\t}\n}",PARTIAL_ACCEPTED,59,484
1277232712056766464,1e09604bb904accc49699524519c74420d445a47f7f389b1f4722796312b3254,2020-06-28 21:29:43,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cstring>\n#include <cstdio>\n#include <cstdlib>\n\nusing namespace std;\n\nint main() {\n    int n, sq, len, len1;\n    cin >> n;\n    for (int i = 1; i <= 300; i++) {\n        char s[1001], t[1001];\n        int flag = 1;\n        sq = i * i;\n        _itoa_s(sq, t, n);\n        len1 = strlen(t);\n        for (int j = 0; j < len1; j++) {\n            if (t[j] != t[len1 - j - 1])\n                flag = 0;\n        }\n\n        if (flag == 1) {\n            cout << i << \"" \"";\n            for (int j = 0; j < len1; j++)\n                cout << t[j];\n            cout << endl;\n        }\n    }\n\n    return 0;\n}\n",COMPILE_ERROR,0,0
1277232737084170240,1e09604bb904accc49699524519c74420d445a47f7f389b1f4722796312b3254,2020-06-28 21:29:49,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cstring>\n#include <cstdio>\n#include <cstdlib>\n\nusing namespace std;\n\nint main() {\n    int n, sq, len, len1;\n    cin >> n;\n    for (int i = 1; i <= 300; i++) {\n        char s[1001], t[1001];\n        int flag = 1;\n        sq = i * i;\n        _itoa_s(sq, t, n);\n        len1 = strlen(t);\n        for (int j = 0; j < len1; j++) {\n            if (t[j] != t[len1 - j - 1])\n                flag = 0;\n        }\n\n        if (flag == 1) {\n            cout << i << \"" \"";\n            for (int j = 0; j < len1; j++)\n                cout << t[j];\n            cout << endl;\n        }\n    }\n\n    return 0;\n}\n",COMPILE_ERROR,0,0
1277235011063832576,0660b9c9140341e5aa83535a78d6b7d07399ba8e63d999f57ffcd66499c26587,2020-06-28 21:38:51,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint main()\n{\n\tint n, s, i, j, k, l, count = 0, num, ok, temp[100];\n\tcin >> n >> s;\n\tfor (i = s + 1; count < n; i++)\n\t{\n\t\tok = 0;\n\t\tfor (j = 2; j <= 10; j++)\n\t\t{\n\t\t\tnum = i;\n\t\t\tfor (k = 0; num != 0; k++)\n\t\t\t{\n\t\t\t\ttemp[k] = num % j;\n\t\t\t\tnum = num / j;\n\t\t\t}\n\t\t\tk = k - 1;\n\t\t\tfor (l = 0; l <= k / 2; l++)\n\t\t\t\tif (temp[l] != temp[k - l])\n\t\t\t\t{\n\t\t\t\t\tl = -1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\tif (l != -1)\n\t\t\t\tok++;\n\t\t}\n\t\tif (ok >= 2)\n\t\t{\n\t\t\tcount++;\n\t\t\tcout << i << endl;\n\t\t}\n\t}\n}",ACCEPTED,36,488
1277235974365446144,1e09604bb904accc49699524519c74420d445a47f7f389b1f4722796312b3254,2020-06-28 21:42:40,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cstring>\n#include <cstdio>\n#include <cstdlib>\n\nusing namespace std;\n\nint main() {\n    int n, sq, len, len1;\n    cin >> n;\n    for (int i = 1; i <= 300; i++) {\n        char s[1001], t[1001];\n        int flag = 1;\n        sq = i * i;\n        _itoa(sq, t, n);\n        len1 = strlen(t);\n        for (int j = 0; j < len1; j++) {\n            if (t[j] != t[len1 - j - 1])\n                flag = 0;\n        }\n\n        if (flag == 1) {\n            cout << i << \"" \"";\n            for (int j = 0; j < len1; j++)\n                cout << t[j];\n            cout << endl;\n        }\n    }\n\n    return 0;\n}\n",COMPILE_ERROR,0,0
1277236655633661952,1e09604bb904accc49699524519c74420d445a47f7f389b1f4722796312b3254,2020-06-28 21:45:23,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cstring>\n#include <cstdio>\n#include <cstdlib>\n\nusing namespace std;\n\nint main() {\n    int n, sq, len, len1;\n    cin >> n;\n    for (int i = 1; i <= 300; i++) {\n        char s[1001], t[1001];\n        int flag = 1;\n        sq = i * i;\n        _itoa(sq, t, n);\n        len1 = strlen(t);\n        for (int j = 0; j < len1; j++) {\n            if (t[j] != t[len1 - j - 1])\n                flag = 0;\n        }\n\n        if (flag == 1) {\n            cout << i << \"" \"";\n            for (int j = 0; j < len1; j++)\n                cout << t[j];\n            cout << endl;\n        }\n    }\n\n    return 0;\n}\n",COMPILE_ERROR,0,0
1277236700714033152,1e09604bb904accc49699524519c74420d445a47f7f389b1f4722796312b3254,2020-06-28 21:45:34,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"\n#include <cstring>\n#include <cstdio>\n#include <cstdlib>\n\nusing namespace std;\n\nint main() {\n    int n, sq, len, len1;\n    cin >> n;\n    for (int i = 1; i <= 300; i++) {\n        char s[1001], t[1001];\n        int flag = 1;\n        sq = i * i;\n        _itoa(sq, t, n);\n        len1 = strlen(t);\n        for (int j = 0; j < len1; j++) {\n            if (t[j] != t[len1 - j - 1])\n                flag = 0;\n        }\n\n        if (flag == 1) {\n            cout << i << \"" \"";\n            for (int j = 0; j < len1; j++)\n                cout << t[j];\n            cout << endl;\n        }\n    }\n\n    return 0;\n}\n",COMPILE_ERROR,0,0
1277236820557889536,1e09604bb904accc49699524519c74420d445a47f7f389b1f4722796312b3254,2020-06-28 21:46:02,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"\n\n#include <stdio.h>\n#include <stdlib.h>\n\nusing namespace std;\n\nint main() {\n    int n, sq, len, len1;\n    cin >> n;\n    for (int i = 1; i <= 300; i++) {\n        char s[1001], t[1001];\n        int flag = 1;\n        sq = i * i;\n        _itoa(sq, t, n);\n        len1 = strlen(t);\n        for (int j = 0; j < len1; j++) {\n            if (t[j] != t[len1 - j - 1])\n                flag = 0;\n        }\n\n        if (flag == 1) {\n            cout << i << \"" \"";\n            for (int j = 0; j < len1; j++)\n                cout << t[j];\n            cout << endl;\n        }\n    }\n\n    return 0;\n}\n",COMPILE_ERROR,0,0
1277236885817065472,1e09604bb904accc49699524519c74420d445a47f7f389b1f4722796312b3254,2020-06-28 21:46:18,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"\n\n#include <stdio.h>\n#include <stdlib.h>\n\n\nint main() {\n    int n, sq, len, len1;\n    cin >> n;\n    for (int i = 1; i <= 300; i++) {\n        char s[1001], t[1001];\n        int flag = 1;\n        sq = i * i;\n        _itoa(sq, t, n);\n        len1 = strlen(t);\n        for (int j = 0; j < len1; j++) {\n            if (t[j] != t[len1 - j - 1])\n                flag = 0;\n        }\n\n        if (flag == 1) {\n            cout << i << \"" \"";\n            for (int j = 0; j < len1; j++)\n                cout << t[j];\n            cout << endl;\n        }\n    }\n\n    return 0;\n}\n",COMPILE_ERROR,0,0
1277238460786597888,dcea7dd7efe9ba0a279461ee72bb5fd36087de773cf9690d5f3b5f8db682d6d5,2020-06-28 21:52:33,Python,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"def translate(x,n):\n    a = [x for x in range(10,11+10)]\n    b = [chr(x) for x in range(65,65+10)]\n    c = dict(zip(a,b))\n    result = \""\""\n    while x:\n        if x%n in c.keys():\n            result = c[x%n]  + result\n        else:\n            result = str(x%n) + result\n        x = x//n\n    return result\n\ndef judge(n):\n    x = n[::-1]\n    if x == n:\n        return True\n    else:\n        return False\n\nn = int(input())\nfor i in range(1,301):\n    a = translate(i,n)\n    b = translate(i*i,n)\n    if judge(b):\n        print(a,b)",ACCEPTED,259,3112
1277238940895993856,dcea7dd7efe9ba0a279461ee72bb5fd36087de773cf9690d5f3b5f8db682d6d5,2020-06-28 21:54:28,Python,50.0,1277062760129622024,1267449136707624960,1049226397448056832,"N,S = map(int,input(\""\"").split())\n\n#进制转换\ndef translate(x,n):\n    result = \""\""\n    while x:\n        result = str(x%n) + result\n        x = x//n\n    return result\n#回文数判定\ndef judge(n):\n    x = n[::-1]\n    return x == n\n\na = count = 0\nwhile a < N:\n    for i in range(2,10+1):\n        if judge(translate(S,i)):\n            count += 1\n    if count >= 2:\n        a += 1\n        print(S)\n    count = 0\n    S += 1\n\n",PARTIAL_ACCEPTED,338,3040
1277240117167579136,dcea7dd7efe9ba0a279461ee72bb5fd36087de773cf9690d5f3b5f8db682d6d5,2020-06-28 21:59:08,Python,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"N,S = map(int,input().split())\n\n#进制转换\ndef translate(x,n):\n    result = \""\""\n    while x:\n        result = str(x%n) + result\n        x = x//n\n    return result\n#回文数判定\ndef judge(n):\n    x = n[::-1]\n    return x == n\n\na = count = 0\nwhile a < N:\n    for i in range(2,10+1):\n        if judge(translate(S+1,i)):\n            count += 1\n    if count >= 2:\n        a += 1\n        print(S+1)\n    count = 0\n    S += 1    \n\n",ACCEPTED,319,3032
1277241134835761152,16228dd118ca28b2c17457d3030101e7c97f3b55984144a0fc54cf7654383981,2020-06-28 22:03:11,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n#include<string.h>\nint main()\n{\n\tint transform(int num, int B,int *str);\n\tint B, i, str[100], len;\n\tscanf(\""%d\"", &B);\n\tfor (i = 1;i <= 300;i++)\n\t{\n\t\tint flag = 1;\n\t\ttransform(i*i,B,str);\n\t\tlen = strlen(str);\n\t\tfor(int j=0;j<len/2;j++)\n\t\t\tif (str[j] != str[len - 1 - j])\n\t\t\t{\n\t\t\t\tflag = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\tif (flag == 1)\n\t\t{\n\t\t\tint num1[100];\n\t\t\ttransform(i, B, num1);\n\t\t\tprintf(\""%s %s\\n\"", num1, str);\n\t\t}\n\t}\n\treturn 0;\n}\nvoid transform(int num, int B,int *str)\n{\n\tint i;\n\tfor(i=0;(num / B) != 0;i++)\n\t\tstr[i]=num % B;\n}",COMPILE_ERROR,0,0
1277242014901395456,16228dd118ca28b2c17457d3030101e7c97f3b55984144a0fc54cf7654383981,2020-06-28 22:06:41,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\nint main()\n{\n\tint transform(int num, int B,int *str);\n\tint B, i, str[100], len;\n\tscanf(\""%d\"", &B);\n\tfor (i = 1;i <= 300;i++)\n\t{\n\t\tint flag = 1;\n\t\ttransform(i*i,B,str);\n\t\tlen = sizeof(str)-1;\n\t\tfor(int j=0;j<len/2;j++)\n\t\t\tif (str[j] != str[len - 1 - j])\n\t\t\t{\n\t\t\t\tflag = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\tif (flag == 1)\n\t\t{\n\t\t\tint num1[100];\n\t\t\ttransform(i, B, num1);\n\t\t\tprintf(\""%s %s\\n\"", num1, str);\n\t\t}\n\t}\n\treturn 0;\n}\nvoid transform(int num, int B,int *str)\n{\n\tint i;\n\tfor(i=0;(num / B) != 0;i++)\n\t\tstr[i]=num % B;\n}",COMPILE_ERROR,0,0
1277242279515840512,16228dd118ca28b2c17457d3030101e7c97f3b55984144a0fc54cf7654383981,2020-06-28 22:07:44,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\nint main()\n{\n\tviod transform(int num, int B,int *str);\n\tint B, i, str[100], len;\n\tscanf(\""%d\"", &B);\n\tfor (i = 1;i <= 300;i++)\n\t{\n\t\tint flag = 1;\n\t\ttransform(i*i,B,str);\n\t\tlen = sizeof(str)-1;\n\t\tfor(int j=0;j<len/2;j++)\n\t\t\tif (str[j] != str[len - 1 - j])\n\t\t\t{\n\t\t\t\tflag = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\tif (flag == 1)\n\t\t{\n\t\t\tint num1[100];\n\t\t\ttransform(i, B, num1);\n\t\t\tprintf(\""%s %s\\n\"", num1, str);\n\t\t}\n\t}\n\treturn 0;\n}\nvoid transform(int num, int B,int *str)\n{\n\tint i;\n\tfor(i=0;(num / B) != 0;i++)\n\t\tstr[i]=num % B;\n}",COMPILE_ERROR,0,0
1277242318938103808,16228dd118ca28b2c17457d3030101e7c97f3b55984144a0fc54cf7654383981,2020-06-28 22:07:53,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\nint main()\n{\n\tvoid transform(int num, int B,int *str);\n\tint B, i, str[100], len;\n\tscanf(\""%d\"", &B);\n\tfor (i = 1;i <= 300;i++)\n\t{\n\t\tint flag = 1;\n\t\ttransform(i*i,B,str);\n\t\tlen = sizeof(str)-1;\n\t\tfor(int j=0;j<len/2;j++)\n\t\t\tif (str[j] != str[len - 1 - j])\n\t\t\t{\n\t\t\t\tflag = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\tif (flag == 1)\n\t\t{\n\t\t\tint num1[100];\n\t\t\ttransform(i, B, num1);\n\t\t\tprintf(\""%s %s\\n\"", num1, str);\n\t\t}\n\t}\n\treturn 0;\n}\nvoid transform(int num, int B,int *str)\n{\n\tint i;\n\tfor(i=0;(num / B) != 0;i++)\n\t\tstr[i]=num % B;\n}",WRONG_ANSWER,24,384
1277247278874558464,8deffd1a550298bf3da4d16ad8bc34e4d5aeb10a1c2a49486eaf87f400ced3bd,2020-06-28 22:27:36,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nint n,s,k,q;\nvoid sh(int x,int y)\n{\n\tint a[5000],s=0;\n\twhile(x)\n    {\n\t\ta[++s]=x%y;\n\t\tx/=y;\n\t}\n\tif(a[1]==0||a[s]==0) \n        return;\n\tfor(int i=1;i<=s;i++)\n\t  if(a[i]!=a[s-i+1]) \n          return;\n\tq++;\n\treturn;\n}\nint main()\n{\n\tcin>>n>>s;\n\tfor(int i=s+1;k<n;i++)\n    {\n\t\tq=0;\n\t\tsh(i,10);\n\t\tfor(int j=2;j<=9;j++)\n\t\t  sh(i,j);\n\t\tif(q>1)\n        {\n\t\t\tcout<<i<<endl;\n\t\t\tk++;\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,37,512
1277255566311743488,949f4200c5481916ce7e0105ff3c4b09a924fc548d16434f2f8a149b07e958c0,2020-06-28 23:00:31,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <string.h>\n#include <stdio.h>\n#include <stdlib.h>\nusing namespace std;\nenum {\n    A=10,B,C,D,E,F,G,H,I,J\n};\nint main()\n{\n    int n;\n    cin>>n;\n    for(int i=1; i<=300; i++){\n            int x=i*i;\n            char y[10],z[10];\n            itoa(i,z,n);\n            itoa(x,y,n);\n            int e;\n            for(unsigned int j=0; j<strlen(y); j++){\n                if(y[j]==y[strlen(y)-j-1]){\n                    e=1;\n                }\n                else{\n                    e=0;\n                    break;\n                }\n        }\n            if(e==1){\n                cout<<z<<\"" \""<<y<<endl;\n            }\n\n        }\n\n    return 0;\n}\n",COMPILE_ERROR,0,0
1277255667016990720,949f4200c5481916ce7e0105ff3c4b09a924fc548d16434f2f8a149b07e958c0,2020-06-28 23:00:55,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <string.h>\n#include <stdio.h>\n#include <stdlib.h>\nusing namespace std;\nenum {\n    A=10,B,C,D,E,F,G,H,I,J\n};\nint main()\n{\n    int n;\n    cin>>n;\n    for(int i=1; i<=300; i++){\n            int x=i*i;\n            char y[10],z[10];\n            itoa(i,z,n);\n            itoa(x,y,n);\n            int e;\n            for(unsigned int j=0; j<strlen(y); j++){\n                if(y[j]==y[strlen(y)-j-1]){\n                    e=1;\n                }\n                else{\n                    e=0;\n                    break;\n                }\n        }\n            if(e==1){\n                cout<<z<<\"" \""<<y<<endl;\n            }\n\n        }\n\n    return 0;\n}",COMPILE_ERROR,0,0
1277255884248375296,949f4200c5481916ce7e0105ff3c4b09a924fc548d16434f2f8a149b07e958c0,2020-06-28 23:01:47,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string.h>\n#include <stdio.h>\n#include <stdlib.h>\nusing namespace std;\nenum {\n    A=10,B,C,D,E,F,G,H,I,J\n};\nint main()\n{\n    int n;\n    cin>>n;\n    for(int i=1; i<=300; i++){\n            int x=i*i;\n            char y[10],z[10];\n            itoa(i,z,n);\n            itoa(x,y,n);\n            int e;\n            for(unsigned int j=0; j<strlen(y); j++){\n                if(y[j]==y[strlen(y)-j-1]){\n                    e=1;\n                }\n                else{\n                    e=0;\n                    break;\n                }\n        }\n            if(e==1){\n                cout<<z<<\"" \""<<y<<endl;\n            }\n\n        }\n\n    return 0;\n}",COMPILE_ERROR,0,0
1277255904259399680,6fef5bd7b91330f3f8f300d49b073aba94086d844309fa4c3019aa728b766feb,2020-06-28 23:01:52,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstdio>\n#include<cstring>\n#include<algorithm>\n#include<cmath>\nusing namespace std;\nbool fun(int,int);\nvoid output();\nint x[2][15],con[2];\nint i,j,b;\nchar num[20]={'0','1','2','3','4','5','6','7','8','9'\n            ,'A','B','C','D','E','F','G','H','I','J'};\nint main(){\n    cin>>b;\n    for(i=1;i<=300;i++){\n        fun(i,0);\n        if(fun(i*i,1))output();\n    }\n    return 0;\n}\nbool fun(int n,int k){\n    con[k]=0;\n    while(n>=b){\n        x[k][con[k]]=n%b;\n        n=n/b;\n        con[k]++;\n    }\n    x[k][con[k]]=n;\n    for(int i=0;i<=con[k];i++)\n        if(x[k][i]!=x[k][con[k]-i])return false;\n    return true;\n}\nvoid output(){\n    int k=0;\n    for(int t=con[k];t>=0;t--)\n        cout<<num[x[k][t]];\n    cout<<' ';\n    k++;\n    for(int t=0;t<=con[k];t++)\n        cout<<num[x[k][t]];\n    cout<<\""\\n\"";\n}",ACCEPTED,43,512
1277255999956639744,949f4200c5481916ce7e0105ff3c4b09a924fc548d16434f2f8a149b07e958c0,2020-06-28 23:02:15,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string.h>\n#include <stdio.h>\n#include <stdlib.h>\nusing namespace std;\nint main()\n{\n    int n;\n    cin>>n;\n    for(int i=1; i<=300; i++){\n            int x=i*i;\n            char y[10],z[10];\n            itoa(i,z,n);\n            itoa(x,y,n);\n            int e;\n            for(unsigned int j=0; j<strlen(y); j++){\n                if(y[j]==y[strlen(y)-j-1]){\n                    e=1;\n                }\n                else{\n                    e=0;\n                    break;\n                }\n        }\n            if(e==1){\n                cout<<z<<\"" \""<<y<<endl;\n            }\n\n        }\n\n    return 0;\n}",COMPILE_ERROR,0,0
1277256060417540096,6fef5bd7b91330f3f8f300d49b073aba94086d844309fa4c3019aa728b766feb,2020-06-28 23:02:29,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstdio>\n#include<cstring>\n#include<algorithm>\n#include<cmath>\nusing namespace std;\nint x[20],b,n,s;\nbool fun(int);\nint main(){\n    int i=0;\n    cin>>n>>s;\n    while(i<n){\n        s++;\n        int k=0;\n        for(b=2;b<=10;b++)\n            if(fun(s))k++;\n        if(k>=2){\n            cout<<s<<endl;\n            i++;\n        }\n    }\n    return 0;\n}\nbool fun(int n){\n    int con=0;\n    while(n>=b){\n        x[con]=n%b;\n        n=n/b;\n        con++;\n    }\n    x[con]=n;\n    for(int i=0;i<=con;i++)\n        if(x[i]!=x[con-i])return false;\n    return true;\n}",ACCEPTED,36,516
1277256063680708608,949f4200c5481916ce7e0105ff3c4b09a924fc548d16434f2f8a149b07e958c0,2020-06-28 23:02:30,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string.h>\n#include <stdio.h>\n#include <stdlib.h>\nusing namespace std;\nint main()\n{\n    int n;\n    cin>>n;\n    for(int i=1; i<=300; i++){\n            int x=i*i;\n            char y[10],z[10];\n            itoa(i,z,10);\n            itoa(x,y,10);\n            int e;\n            for(unsigned int j=0; j<strlen(y); j++){\n                if(y[j]==y[strlen(y)-j-1]){\n                    e=1;\n                }\n                else{\n                    e=0;\n                    break;\n                }\n        }\n            if(e==1){\n                cout<<z<<\"" \""<<y<<endl;\n            }\n\n        }\n\n    return 0;\n}",COMPILE_ERROR,0,0
1277256974289264640,949f4200c5481916ce7e0105ff3c4b09a924fc548d16434f2f8a149b07e958c0,2020-06-28 23:06:07,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string.h>\n#include <stdio.h>\n#include <stdlib.h>\nusing namespace std;\nint main()\n{\n    int n;n\n    cin>>n;\n    for(int i=1; i<=300; i++){\n            int x=i*i;\n            char y[25],z[25];\n            itoa(i,z,n);\n            itoa(x,y,n);\n            int e;\n            for(unsigned int j=0; j<strlen(y); j++){\n                if(y[j]==y[strlen(y)-j-1]){\n                    e=1;\n                }\n                else{\n                    e=0;\n                    break;\n                }\n        }\n            if(e==1){\n                cout<<z<<\"" \""<<y<<endl;\n            }\n\n        }\n\n    return 0;\n}",COMPILE_ERROR,0,0
1277257051367997440,949f4200c5481916ce7e0105ff3c4b09a924fc548d16434f2f8a149b07e958c0,2020-06-28 23:06:26,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string.h>\n#include <stdio.h>\n#include <stdlib.h>\nusing namespace std;\nint main()\n{\n    int n;\n    cin>>n;\n    for(int i=1; i<=300; i++){\n            int x=i*i;\n            char y[25],z[25];\n            itoa(i,z,n);\n            itoa(x,y,n);\n            int e;\n            for(unsigned int j=0; j<strlen(y); j++){\n                if(y[j]==y[strlen(y)-j-1]){\n                    e=1;\n                }\n                else{\n                    e=0;\n                    break;\n                }\n        }\n            if(e==1){\n                cout<<z<<\"" \""<<y<<endl;\n            }\n\n        }\n\n    return 0;\n}",COMPILE_ERROR,0,0
1277257088651157504,949f4200c5481916ce7e0105ff3c4b09a924fc548d16434f2f8a149b07e958c0,2020-06-28 23:06:34,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string.h>\n#include <stdio.h>\n#include <stdlib.h>\nusing namespace std;\nint main()\n{\n    int n;\n    cin>>n;\n    for(int i=1; i<=300; i++){\n            int x=i*i;\n            char y[25],z[25];\n            itoa(i,z,n);\n            itoa(x,y,n);\n            int e;\n            for(unsigned int j=0; j<strlen(y); j++){\n                if(y[j]==y[strlen(y)-j-1]){\n                    e=1;\n                }\n                else{\n                    e=0;\n                    break;\n                }\n        }\n            if(e==1){\n                cout<<z<<\"" \""<<y<<endl;\n            }\n\n        }\n\n    return 0;\n}",COMPILE_ERROR,0,0
1277257716102266880,949f4200c5481916ce7e0105ff3c4b09a924fc548d16434f2f8a149b07e958c0,2020-06-28 23:09:04,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string.h>\n#include <stdio.h>\n#include <stdlib.h>\nusing namespace std;\nint main()\n{\n    int n;\n    cin>>n;\n    for(int i=1; i<=300; i++){\n        int x=i*i;\n        char y[25],z[25];\n        itoa(i,z,n);\n        itoa(x,y,n);\n        int e;\n        for(unsigned int j=0; j<strlen(y); j++){\n            if(y[j]==y[strlen(y)-j-1]){\n                e=1;\n            }\n            else{\n                e=0;\n                break;\n                }\n        }\n            if(e==1){\n                cout<<z<<\"" \""<<y<<endl;\n            }\n        }\n\n    return 0;\n}",COMPILE_ERROR,0,0
1277257931895005184,949f4200c5481916ce7e0105ff3c4b09a924fc548d16434f2f8a149b07e958c0,2020-06-28 23:09:55,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string.h>\n#include <stdio.h>\n#include <stdlib.h>\nusing namespace std;\nint main()\n{\n    int n;\n    cin>>n;\n    for(int i=1; i<=300; i++){\n        int x=i*i;\n        char y[25],z[25];\n        itoa(i,z,n);\n        itoa(x,y,n);\n        int e;\n        for(unsigned int j=0; j<strlen(y); j++){\n            if(y[j]==y[strlen(y)-j-1]){\n                e=1;\n            }\n            else{\n                e=0;\n                break;\n                }\n        }\n            if(e==1){\n                cout<<z<<\"" \""<<y<<endl;\n            }\n        }\n\n    return 0;\n}",COMPILE_ERROR,0,0
1277261511024631808,b0dbadad058dca3ef81e6649021912f5fd5c227bf259aad890bd38b4c96656ad,2020-06-28 23:24:09,C++,40.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\n#include <vector>\nusing namespace std;\n\nstring trans(int n, int B)\n{\n    vector<string>ans;\n    int res;\n    while(true)\n    {\n        res = n % B;\n        ans.push_back(to_string(res));\n        n /= B;\n        if(n < B)\n        {\n            if(n != 0) ans.push_back(to_string(n));\n            break;\n        }\n    }\n    string s = \""\\0\"";\n    for(unsigned int i=0; i<ans.size(); i++)\n    {\n        s += ans[ans.size()-1-i];\n    }\n    return s;\n}\n\nbool is_hw(string s)\n{\n    string temp = s;\n    reverse(temp.begin(), temp.end());\n    return s == temp;\n}\n\nint main()\n{\n    int B, i;\n    cin >> B;\n    for(i=1; i<=300; i++)\n    {\n        int ii = i*i;\n        string s = trans(ii, B);\n        if(is_hw(s))\n        {\n            cout << trans(i, B) << \"" \"" << trans(ii, B);\n            break;\n        }\n    }\n    for(i+=1; i<300 ;i++)\n    {\n        int ii = i*i;\n        string s = trans(ii, B);\n        if(is_hw(s))\n        {\n            cout << endl << trans(i, B) << \"" \"" << trans(ii, B);\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,31,512
1277268017279328256,b0dbadad058dca3ef81e6649021912f5fd5c227bf259aad890bd38b4c96656ad,2020-06-28 23:50:00,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\n#include <vector>\nusing namespace std;\n\nstring trans(int n, int B)\n{\n    vector<string>ans;\n    int res;\n    while(true)\n    {\n        string s=\""\"";\n        res = n % B;\n        if(res >= 10) ans.push_back(s+char(res+55));\n        else ans.push_back(to_string(res));\n        n /= B;\n        if(n < B)\n        {\n            if(n >= 10) ans.push_back(s+char(n+55));\n            else if(n != 0) ans.push_back(to_string(n));\n            break;\n        }\n    }\n    string s = \""\\0\"";\n    for(unsigned int i=0; i<ans.size(); i++)\n    {\n        s += ans[ans.size()-1-i];\n    }\n    return s;\n}\n\nbool is_hw(string s)\n{\n    string temp = s;\n    reverse(temp.begin(), temp.end());\n    return s == temp;\n}\n\nint main()\n{\n    int B, i;\n    cin >> B;\n    for(i=1; i<=300; i++)\n    {\n        int ii = i*i;\n        string s = trans(ii, B);\n        if(is_hw(s))\n        {\n            cout << trans(i, B) << \"" \"" << trans(ii, B);\n            break;\n        }\n    }\n    for(i+=1; i<300 ;i++)\n    {\n        int ii = i*i;\n        string s = trans(ii, B);\n        if(is_hw(s))\n        {\n            cout << endl << trans(i, B) << \"" \"" << trans(ii, B);\n        }\n    }\n    return 0;\n}",ACCEPTED,67,512
1277268088771239936,82e4af574b47d8c6ec0df4872de0940e85d938b8ac62ac4cdcb9a84177b464d3,2020-06-28 23:50:17,Python,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"N,S=map(int,input().split())\ndef jz(x,n):\n    lst='0123456789'\n    nums=\""\""\n    while True:\n        a=x//n\n        b=x%n\n        nums+=lst[b]\n        if a==0:\n            break\n        x=a\n    nums1=nums[::-1]\n    return nums1\npronums=[]\nfor i in range(S+1,100000):\n    count=0\n    for j in range(2,11):\n        if jz(i,j)==jz(i,j)[::-1] and jz(i,j)[0]!='0' and \\\n            jz(i,j)[-1]!='0':\n            count+=1\n    if count>=2:\n        pronums.append(i)\nfor i in pronums[:N]:\n    print(i)",TIME_LIMIT_EXCEEDED,0,0
1277269365676769280,765430f8d30e25643f5e1304ddc54ec6e2ef0a539f7381e25fa1e885093ab134,2020-06-28 23:55:21,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<math.h>\nusing namespace std;\n\nbool circle(int m, int n)//该函数判断m的n进制数是否为回文数\n{\n\tint s = 0, l = m;\n\twhile (l)\n\t{\n\t\ts = s * n + l % n;//该语句是反顺序计算数值\n\t\tl /= n;\n\t}\n\treturn s == m;//如果是回文数，那么正反顺序的数字应该是相等的\n}\nvoid turn(int m,int n)\n{\n\tint c, l = 0, s[100];\n\twhile (m != 0)//数制转换，结果存入数组s[l]  \n\t{\n\t\tc = m% n;          //余数\n\t\tm = m / n;\n\t\tl++; s[l] = c;   //将余数按顺序存入数组s[l]中  \n\t}\n\tfor (int k = l; k >= 1; k--)//输出转换后的序列  \n\t{\n\t\tcout << s[k];\n\t}\n}\nint main()\n{\n\tint n;\n\tcin >> n;\n\tfor (int i = 1; i <=300; i++)\n\t{\n\t\tif (circle(i*i,n))\n\t\t{\n\t\t\tturn(i, n);\n\t\t\tcout << \"" \"";\n\t\t\tturn(i*i,n);\n\t\t\tcout << endl;\n\t\t}\n\t}\n}",PARTIAL_ACCEPTED,38,528
1277269857265967104,82e4af574b47d8c6ec0df4872de0940e85d938b8ac62ac4cdcb9a84177b464d3,2020-06-28 23:57:19,Python,40.0,1277062760129622024,1267449136707624960,1049226397448056832,"N,S=map(int,input().split())\ndef jz(x,n):\n    lst='0123456789'\n    nums=\""\""\n    while True:\n        a=x//n\n        b=x%n\n        nums+=lst[b]\n        if a==0:\n            break\n        x=a\n    nums1=nums[::-1]\n    return nums1\npronums=[]\nfor i in range(S+1,S*2):\n    count=0\n    for j in range(2,11):\n        if jz(i,j)==jz(i,j)[::-1] and jz(i,j)[0]!='0' and \\\n            jz(i,j)[-1]!='0':\n            count+=1\n    if count>=2:\n        pronums.append(i)\nfor i in pronums[:N]:\n    print(i)",PARTIAL_ACCEPTED,266,3144
1277270123964989440,82e4af574b47d8c6ec0df4872de0940e85d938b8ac62ac4cdcb9a84177b464d3,2020-06-28 23:58:22,Python,50.0,1277062760129622024,1267449136707624960,1049226397448056832,"N,S=map(int,input().split())\ndef jz(x,n):\n    lst='0123456789'\n    nums=\""\""\n    while True:\n        a=x//n\n        b=x%n\n        nums+=lst[b]\n        if a==0:\n            break\n        x=a\n    nums1=nums[::-1]\n    return nums1\npronums=[]\nfor i in range(S+1,S*10):\n    count=0\n    for j in range(2,11):\n        if jz(i,j)==jz(i,j)[::-1] and jz(i,j)[0]!='0' and \\\n            jz(i,j)[-1]!='0':\n            count+=1\n    if count>=2:\n        pronums.append(i)\nfor i in pronums[:N]:\n    print(i)",PARTIAL_ACCEPTED,377,3120
1277270455470186496,82e4af574b47d8c6ec0df4872de0940e85d938b8ac62ac4cdcb9a84177b464d3,2020-06-28 23:59:41,Python,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"N,S=map(int,input().split())\ndef jz(x,n):\n    lst='0123456789'\n    nums=\""\""\n    while True:\n        a=x//n\n        b=x%n\n        nums+=lst[b]\n        if a==0:\n            break\n        x=a\n    nums1=nums[::-1]\n    return nums1\npronums=[]\nfor i in range(S+1,int(str(S)[0])*10):\n    count=0\n    for j in range(2,11):\n        if jz(i,j)==jz(i,j)[::-1] and jz(i,j)[0]!='0' and \\\n            jz(i,j)[-1]!='0':\n            count+=1\n    if count>=2:\n        pronums.append(i)\nfor i in pronums[:N]:\n    print(i)",PARTIAL_ACCEPTED,156,3112
1277270585812385792,82e4af574b47d8c6ec0df4872de0940e85d938b8ac62ac4cdcb9a84177b464d3,2020-06-29 00:00:12,Python,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"N,S=map(int,input().split())\ndef jz(x,n):\n    lst='0123456789'\n    nums=\""\""\n    while True:\n        a=x//n\n        b=x%n\n        nums+=lst[b]\n        if a==0:\n            break\n        x=a\n    nums1=nums[::-1]\n    return nums1\npronums=[]\nfor i in range(S+1,int(str(S)[0])*10):\n    count=0\n    for j in range(2,11):\n        if jz(i,j)==jz(i,j)[::-1] and jz(i,j)[0]!='0' and \\\n            jz(i,j)[-1]!='0':\n            count+=1\n    if count>=2:\n        pronums.append(i)\nfor i in pronums[:N]:\n    print(i)",PARTIAL_ACCEPTED,161,3152
1277270768063275008,765430f8d30e25643f5e1304ddc54ec6e2ef0a539f7381e25fa1e885093ab134,2020-06-29 00:00:56,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<math.h>\nusing namespace std;\n\nbool circle(int m, int n)//该函数判断m的n进制数是否为回文数\n{\n\tint s = 0, l = m;\n\twhile (l)\n\t{\n\t\ts = s * n + l % n;//该语句是反顺序计算数值\n\t\tl /= n;\n\t}\n\treturn s == m;//如果是回文数，那么正反顺序的数字应该是相等的\n}\nvoid turn(int m,int n)\n{\n\tint c, l = 0, s[100];\n\twhile (m != 0)//数制转换，结果存入数组s[l]  \n\t{\n\t\tc = m% n;          //余数\n\t\tm = m / n;\n\t\tl++; s[l] = c;   //将余数按顺序存入数组s[l]中  \n\t}\n\tfor (int k = l; k >= 1; k--)//输出转换后的序列  \n\t{\n\t\tif (s[k] >= 10) //若为十六进制等则输出相对应的字母  \n\t\t\tcout << (char)(s[k] + 55);\n\t\telse         //否则直接输出数字  \n\t\t\tcout << s[k];\n\t}\n}\nint main()\n{\n\tint n;\n\tcin >> n;\n\tfor (int i = 1; i <=300; i++)\n\t{\n\t\tif (circle(i*i,n))\n\t\t{\n\t\t\tturn(i, n);\n\t\t\tcout << \"" \"";\n\t\t\tturn(i*i,n);\n\t\t\tcout << endl;\n\t\t}\n\t}\n}",ACCEPTED,48,512
1277274013292748800,16228dd118ca28b2c17457d3030101e7c97f3b55984144a0fc54cf7654383981,2020-06-29 00:13:50,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n#include<string.h>\nint main()\n{\n\tvoid transform(int num, int B,char *str);\n\tchar B, i, str[100], len;\n\tscanf(\""%d\"", &B);\n\tfor (i = 1;i <= 300;i++)\n\t{\n\t\tint flag = 1;\n\t\ttransform(i*i,B,str);\n\t\tlen=strlen(str);\n\t\tfor(int j=0;j<len/2;j++)\n\t\t\tif (str[j] != str[len - 1 - j])\n\t\t\t{\n\t\t\t\tflag = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\tif (flag == 1)\n\t\t{\n\t\t\tchar num1[100];\n\t\t\ttransform(i, B, num1);\n\t\t\tprintf(\""%s %s\\n\"", num1, str);\n\t\t}\n\t}\n\treturn 0;\n}\nvoid transform(int num, int B,char *str)\n{\n\tint i;\n\tfor(i=0;(num / B) != 0;i++)\n\t\tstr[i]=num % B;\n}",SEGMENTATION_FAULT,19,464
1277288433662222336,b0dbadad058dca3ef81e6649021912f5fd5c227bf259aad890bd38b4c96656ad,2020-06-29 01:11:08,C++,60.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\n#include <vector>\nusing namespace std;\n\nstring trans(int n, int B)\n{\n    vector<string>ans;\n    int res;\n    while(true)\n    {\n        res = n % B;\n        ans.push_back(to_string(res));\n        n /= B;\n        if(n < B)\n        {\n            ans.push_back(to_string(n));\n            break;\n        }\n    }\n    string s = \""\\0\"";\n    for(unsigned int i=0; i<ans.size(); i++)\n    {\n        s += ans[ans.size()-1-i];\n    }\n    return s;\n}\n\nbool is_hw(string s)\n{\n    string temp = s;\n    reverse(temp.begin(), temp.end());\n    return s == temp;\n}\n\nint main()\n{\n    vector<int>ans;\n    int N, S, sum = 0;\n    cin >> N >> S;\n    while(sum<N)\n    {\n        S++;\n        int flag = 0;\n        for(int i=2; i<=10; i++)\n        {\n            if(is_hw(trans(S, i))) flag++;\n            if(flag == 2) break;\n        }\n        if(flag == 2)\n        {\n            ans.push_back(S);\n            sum++;\n        }\n    }\n    for(unsigned int i=0; i<ans.size(); i++)\n    {\n        cout << ans[i];\n        if(i != ans.size()-1) cout << endl;\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,102,504
1277289264696451072,b0dbadad058dca3ef81e6649021912f5fd5c227bf259aad890bd38b4c96656ad,2020-06-29 01:14:26,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\n#include <vector>\nusing namespace std;\n\nstring trans(int n, int B)\n{\n    vector<string>ans;\n    int res;\n    while(true)\n    {\n        res = n % B;\n        ans.push_back(to_string(res));\n        n /= B;\n        if(n < B)\n        {\n            if(n != 0) ans.push_back(to_string(n));\n            break;\n        }\n    }\n    string s = \""\\0\"";\n    for(unsigned int i=0; i<ans.size(); i++)\n    {\n        s += ans[ans.size()-1-i];\n    }\n    return s;\n}\n\nbool is_hw(string s)\n{\n    string temp = s;\n    reverse(temp.begin(), temp.end());\n    return s == temp;\n}\n\nint main()\n{\n    vector<int>ans;\n    int N, S, sum = 0;\n    cin >> N >> S;\n    while(sum<N)\n    {\n        S++;\n        int flag = 0;\n        for(int i=2; i<=10; i++)\n        {\n            if(is_hw(trans(S, i))) flag++;\n            if(flag == 2) break;\n        }\n        if(flag == 2)\n        {\n            ans.push_back(S);\n            sum++;\n        }\n    }\n    for(unsigned int i=0; i<ans.size(); i++)\n    {\n        cout << ans[i];\n        if(i != ans.size()-1) cout << endl;\n    }\n    return 0;\n}",ACCEPTED,76,388
1277292064071417856,5ad4dbb49340c80253114abf51ba25a8e80d6e95f9ba2cfaa3cbe70794d72ce0,2020-06-29 01:25:33,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\nusing namespace std;\nchar s1[20],s2[20];\nvoid conv(int a,int b,int& len,char* s){\n    int i=0;\n    while(a!=0){\n        s[i]=char(a%b+'0');\n        a=a/b;\n        len++;\n        i++;\n    }\n}\nint isHui(char a[],int n){\n    int flag=1;\n    for(int i=0;i<n;i++){\n        if(a[i]!=a[n-i-1]){\n            flag=0;\n            break;\n        }\n    }\n    return flag;\n}\nint main(){\n    int B,l2,l1;\n    cin>>B;\n    for(int i=0;i<=300;i++){\n        l2=0;\n        conv(i*i,B,l2,s2);\n        if(isHui(s2,l2)){\n            l1=0;\n            conv(i,B,l1,s1);\n            for(int i=0;i<l1;i++){\n                if(i==l1-1)\n                    cout<<s1[i]<<\"" \"";\n                else\n                    cout<<s1[i];\n            }\n            for(int i=0;i<l2;i++){\n                if(i==l2-1)\n                    cout<<s2[i]<<'\\n';\n                else\n                    cout<<s2[i];\n            }\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,69,524
1277401187807068160,1e09604bb904accc49699524519c74420d445a47f7f389b1f4722796312b3254,2020-06-29 08:39:10,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <iomanip>\n#include <algorithm>\n#include <string>\n\nusing namespace std;\nint s[2005];\nchar asc[13] = {'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L'};\n\nbool jin_zhi(int a, int b) {\n    int c = 1;\n    while (a != 0) {\n        s[c] = a % b;\n        a = a / b;\n        c++;\n    }\n    for (int i = 1; i <= (c + 1) / 2; i++)\n        if (s[i] != s[c - i]) {\n            return false;\n        }\n    return true;\n}\n\nvoid print(int a, int b) {\n    int c = 1;\n    while (a != 0) {\n        s[c] = a % b;\n        a = a / b;\n        c++;\n    }\n    c = c - 1;\n    for (int i = c; i >= 1; i--) {\n        if (s[i] <= 9)\n            cout << s[i];\n        else\n            cout << asc[s[i] - 10];\n    }\n}\n\nint main() {\n    int n;\n    cin >> n;\n    for (int i = 1; i <= 300; i++) {\n        if (jin_zhi(i * i, n)) {\n            print(i, n);\n            cout << \"" \"";\n            print(i * i, n);\n            cout << endl;\n        }\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1277401229150322688,1e09604bb904accc49699524519c74420d445a47f7f389b1f4722796312b3254,2020-06-29 08:39:20,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <iomanip>\n#include <algorithm>\n#include <string>\n\nusing namespace std;\nint s[2005];\nchar asc[13] = {'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L'};\n\nbool jin_zhi(int a, int b) {\n    int c = 1;\n    while (a != 0) {\n        s[c] = a % b;\n        a = a / b;\n        c++;\n    }\n    for (int i = 1; i <= (c + 1) / 2; i++)\n        if (s[i] != s[c - i]) {\n            return false;\n        }\n    return true;\n}\n\nvoid print(int a, int b) {\n    int c = 1;\n    while (a != 0) {\n        s[c] = a % b;\n        a = a / b;\n        c++;\n    }\n    c = c - 1;\n    for (int i = c; i >= 1; i--) {\n        if (s[i] <= 9)\n            cout << s[i];\n        else\n            cout << asc[s[i] - 10];\n    }\n}\n\nint main() {\n    int n;\n    cin >> n;\n    for (int i = 1; i <= 300; i++) {\n        if (jin_zhi(i * i, n)) {\n            print(i, n);\n            cout << \"" \"";\n            print(i * i, n);\n            cout << endl;\n        }\n    }\n    return 0;\n}",ACCEPTED,39,500
1277403496037408768,1e09604bb904accc49699524519c74420d445a47f7f389b1f4722796312b3254,2020-06-29 08:48:21,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <iomanip>\n#include <algorithm>\n#include <string>\n\nusing namespace std;\n\n\nbool jin_zhi(int a, int b) {\n    int c = 1;\n    while (a != 0) {\n        s[c] = a % b;\n        a = a / b;\n        c++;\n    }\n    for (int i = 1; i <= (c + 1) / 2; i++)\n        if (s[i] != s[c - i]) {\n            return false;\n        }\n    return true;\n}\n\nint main() {\n    int m, n,time=0;//m-->time\n    cin >> m >> n;\n    for (int i = n;; i++) {\n        int ans = 0;\n        for (int j = 2; j <= 10; j++) {\n            if (jin_zhi(i, j))\n                ans++;\n        }\n        if (ans >= 2) {\n            time++;\n            cout << i << \"" \"";\n        }\n        if (time == m)\n            break;\n\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1277403588463099904,1e09604bb904accc49699524519c74420d445a47f7f389b1f4722796312b3254,2020-06-29 08:48:43,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <iomanip>\n#include <algorithm>\n#include <string>\n\nusing namespace std;\n\n\nbool jin_zhi(int a, int b) {\n    int c = 1;\n    while (a != 0) {\n        s[c] = a % b;\n        a = a / b;\n        c++;\n    }\n    for (int i = 1; i <= (c + 1) / 2; i++)\n        if (s[i] != s[c - i]) {\n            return false;\n        }\n    return true;\n}\n\nint main() {\n    int m, n,time=0;\n    cin >> m >> n;\n    for (int i = n;; i++) {\n        int ans = 0;\n        for (int j = 2; j <= 10; j++) {\n            if (jin_zhi(i, j))\n                ans++;\n        }\n        if (ans >= 2) {\n            time++;\n            cout << i << \"" \"";\n        }\n        if (time == m)\n            break;\n\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1277403672089133056,5ad4dbb49340c80253114abf51ba25a8e80d6e95f9ba2cfaa3cbe70794d72ce0,2020-06-29 08:49:03,C++,70.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\nusing namespace std;\nchar s1[20],s2[20];\nvoid conv(int a,int b,int& len,char* s){\n    int i=0;\n    while(a!=0){\n        if(a%b<=10)\n            s[i]=a%b+'0';\n        else\n            s[i]=a%b+'A'-10;\n        a=a/b;\n        len++;\n        i++;\n    }\n}\nint isHui(char a[],int n){\n    int flag=1;\n    for(int i=0;i<n/2;i++){\n        if(a[i]!=a[n-i-1]){\n            flag=0;\n            break;\n        }\n    }\n    return flag;\n}\nint main(){\n    int B,l2,l1;\n    cin>>B;\n    for(int i=0;i<=300;i++){\n        l2=0;\n        conv(i*i,B,l2,s2);\n        if(isHui(s2,l2)){\n            l1=0;\n            conv(i,B,l1,s1);\n            for(int i=l1-1;i>=0;i--){\n                if(i==0)\n                    cout<<s1[i]<<\"" \"";\n                else\n                    cout<<s1[i];\n            }\n            for(int i=l2-1;i>=0;i--){\n                if(i==0)\n                    cout<<s2[i]<<'\\n';\n                else\n                    cout<<s2[i];\n            }\n        }\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,48,484
1277403681966710784,1e09604bb904accc49699524519c74420d445a47f7f389b1f4722796312b3254,2020-06-29 08:49:05,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <iomanip>\n#include <algorithm>\n#include <string>\n\nusing namespace std;\nint s[2005];\n\nbool jin_zhi(int a, int b) {\n    int c = 1;\n    while (a != 0) {\n        s[c] = a % b;\n        a = a / b;\n        c++;\n    }\n    for (int i = 1; i <= (c + 1) / 2; i++)\n        if (s[i] != s[c - i]) {\n            return false;\n        }\n    return true;\n}\n\nint main() {\n    int m, n,time=0;\n    cin >> m >> n;\n    for (int i = n;; i++) {\n        int ans = 0;\n        for (int j = 2; j <= 10; j++) {\n            if (jin_zhi(i, j))\n                ans++;\n        }\n        if (ans >= 2) {\n            time++;\n            cout << i << \"" \"";\n        }\n        if (time == m)\n            break;\n\n    }\n    return 0;\n}",MULTIPLE_ERROR,23,492
1277403901173620736,1e09604bb904accc49699524519c74420d445a47f7f389b1f4722796312b3254,2020-06-29 08:49:57,C++,50.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <iomanip>\n#include <algorithm>\n#include <string>\n\nusing namespace std;\n\nint s[3005];\n\nbool jin_zhi(int a, int b) {\n    int c = 1;\n    while (a != 0) {\n        s[c] = a % b;\n        a = a / b;\n        c++;\n    }\n    for (int i = 1; i <= (c + 1) / 2; i++)\n        if (s[i] != s[c - i]) {\n            return false;\n        }\n    return true;\n}\n\nint main() {\n    int m, n, time = 0;//m-->time\n    cin >> m >> n;\n    for (int i = n;; i++) {\n        int ans = 0;\n        for (int j = 2; j <= 10; j++) {\n            if (jin_zhi(i, j))\n                ans++;\n        }\n        if (ans >= 2) {\n            time++;\n            cout << i << endl;\n        }\n        if (time == m)\n            break;\n\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,38,504
1277404233496715264,1e09604bb904accc49699524519c74420d445a47f7f389b1f4722796312b3254,2020-06-29 08:51:16,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <iomanip>\n#include <algorithm>\n#include <string>\n\nusing namespace std;\n\nint s[3005];\n\nbool jin_zhi(int a, int b) {\n    int c = 1;\n    while (a != 0) {\n        s[c] = a % b;\n        a = a / b;\n        c++;\n    }\n    for (int i = 1; i <= (c + 1) / 2; i++)\n        if (s[i] != s[c - i]) {\n            return false;\n        }\n    return true;\n}\n\nint main() {\n    int m, n, time = 0;//m-->time\n    cin >> m >> n;\n    for (int i = n;; i++) {\n        int ans = 0;\n        for (int j = 2; j <= 10; j++) {\n            if (jin_zhi(i, j))\n                ans++;\n        }\n        if (ans > 2) {\n            time++;\n            cout << i << endl;\n        }\n        if (time == m)\n            break;\n\n    }\n    return 0;\n}",WRONG_ANSWER,284,512
1277404263309836288,1e09604bb904accc49699524519c74420d445a47f7f389b1f4722796312b3254,2020-06-29 08:51:24,C++,50.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <iomanip>\n#include <algorithm>\n#include <string>\n\nusing namespace std;\n\nint s[3005];\n\nbool jin_zhi(int a, int b) {\n    int c = 1;\n    while (a != 0) {\n        s[c] = a % b;\n        a = a / b;\n        c++;\n    }\n    for (int i = 1; i <= (c + 1) / 2; i++)\n        if (s[i] != s[c - i]) {\n            return false;\n        }\n    return true;\n}\n\nint main() {\n    int m, n, time = 0;//m-->time\n    cin >> m >> n;\n    for (int i = n;; i++) {\n        int ans = 0;\n        for (int j = 2; j <= 10; j++) {\n            if (jin_zhi(i, j))\n                ans++;\n        }\n        if (ans >= 2) {\n            time++;\n            cout << i << endl;\n        }\n        if (time == m)\n            break;\n\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,40,512
1277404774616457216,1e09604bb904accc49699524519c74420d445a47f7f389b1f4722796312b3254,2020-06-29 08:53:25,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <iomanip>\n#include <algorithm>\n#include <string>\n\nusing namespace std;\n\nint s[3005];\n\nbool jin_zhi(int a, int b) {\n    int c = 1;\n    while (a != 0) {\n        s[c] = a % b;\n        a = a / b;\n        c++;\n    }\n    for (int i = 1; i <= (c + 1) / 2; i++)\n        if (s[i] != s[c - i]) {\n            return false;\n        }\n    return true;\n}\n\nint main() {\n    int m, n, time = 0;//m-->time\n    cin >> m >> n;\n    for (int i = n+1;; i++) {\n        int ans = 0;\n        for (int j = 2; j <= 10; j++) {\n            if (jin_zhi(i, j))\n                ans++;\n        }\n        if (ans >= 2) {\n            time++;\n            cout << i << endl;\n        }\n        if (time == m)\n            break;\n\n    }\n    return 0;\n}",ACCEPTED,23,540
1277404831579299840,5ad4dbb49340c80253114abf51ba25a8e80d6e95f9ba2cfaa3cbe70794d72ce0,2020-06-29 08:53:39,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\nusing namespace std;\nchar s1[20],s2[20];\nvoid conv(int a,int b,int& len,char* s){\n    int i=0;\n    while(a!=0){\n        if(a%b<10)\n            s[i]=a%b+'0';\n        else\n            s[i]=a%b+'A'-10;\n        a=a/b;\n        len++;\n        i++;\n    }\n}\nint isHui(char a[],int n){\n    int flag=1;\n    for(int i=0;i<n/2;i++){\n        if(a[i]!=a[n-i-1]){\n            flag=0;\n            break;\n        }\n    }\n    return flag;\n}\nint main(){\n    int B,l2,l1;\n    cin>>B;\n    for(int i=0;i<=300;i++){\n        l2=0;\n        conv(i*i,B,l2,s2);\n        if(isHui(s2,l2)){\n            l1=0;\n            conv(i,B,l1,s1);\n            for(int i=l1-1;i>=0;i--){\n                if(i==0)\n                    cout<<s1[i]<<\"" \"";\n                else\n                    cout<<s1[i];\n            }\n            for(int i=l2-1;i>=0;i--){\n                if(i==0)\n                    cout<<s2[i]<<'\\n';\n                else\n                    cout<<s2[i];\n            }\n        }\n    }\n    return 0;\n}\n",ACCEPTED,40,488
1277405019890966528,16228dd118ca28b2c17457d3030101e7c97f3b55984144a0fc54cf7654383981,2020-06-29 08:54:24,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n#include<string.h>\nint main()\n{\n\tvoid transform(int num, int B, char *str);\n\tint B, i, len; \n\tchar str[30];\n\tscanf(\""%d\"", &B);\n\tfor (i = 1;i <= 300;i++)\n\t{\n\t\tint flag = 1;\n\t\ttransform(i*i, B, str);\n\t\tlen = strlen(str);\n\t\tfor (int j = 0;j < len / 2;j++)\n\t\t\tif (str[j] != str[len - 1 - j])\n\t\t\t\tflag = 0;\n\t\tif (flag == 1)\n\t\t{\n\t\t\tchar num1[30];\n\t\t\ttransform(i, B, num1);\n\t\t\tprintf(\""%s %s\\n\"", num1, str);\n\t\t}\n\t}\n\treturn 0;\n}\nvoid transform(int num, int B, char *str)\n{\n\tint i, k;\n\tfor (i = 0;(num / B) != 0;i++)\n\t{\n\t\tstr[i] = char('0'+num % B);\n\t\tnum = num / B;\n\t}\n}",COMPILE_ERROR,0,0
1277405628975218688,16228dd118ca28b2c17457d3030101e7c97f3b55984144a0fc54cf7654383981,2020-06-29 08:56:49,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n#include<string.h>\nint main()\n{\n\tvoid transform(int num, int B, char *str);\n\tint B, i, len; \n\tchar str[30];\n\tscanf(\""%d\"", &B);\n\tfor (i = 1;i <= 300;i++)\n\t{\n\t\tint flag = 1;\n\t\ttransform(i*i, B, str);\n\t\tlen = strlen(str);\n\t\tfor (int j = 0;j < len / 2;j++)\n\t\t\tif (str[j] != str[len - 1 - j])\n\t\t\t\tflag = 0;\n\t\tif (flag == 1)\n\t\t{\n\t\t\tchar num1[30];\n\t\t\ttransform(i, B, num1);\n\t\t\tprintf(\""%s %s\\n\"", num1, str);\n\t\t}\n\t}\n\treturn 0;\n}\nvoid transform(int num, int B, char *str)\n{\n\tint i；\n\tfor (i = 0;(num / B) != 0;i++)\n\t{\n\t\tstr[i] ='0'+num % B;\n\t\tnum = num / B;\n\t}\n}",COMPILE_ERROR,0,0
1277405758604378112,16228dd118ca28b2c17457d3030101e7c97f3b55984144a0fc54cf7654383981,2020-06-29 08:57:20,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n#include<string.h>\nint main()\n{\n\tvoid transform(int num, int B, char *str);\n\tint B, i, len; \n\tchar str[30];\n\tscanf(\""%d\"", &B);\n\tfor (i = 1;i <= 300;i++)\n\t{\n\t\tint flag = 1;\n\t\ttransform(i*i, B, str);\n\t\tlen = strlen(str);\n\t\tfor (int j = 0;j < len / 2;j++)\n\t\t\tif (str[j] != str[len - 1 - j])\n\t\t\t\tflag = 0;\n\t\tif (flag == 1)\n\t\t{\n\t\t\tchar num1[30];\n\t\t\ttransform(i, B, num1);\n\t\t\tprintf(\""%s %s\\n\"", num1, str);\n\t\t}\n\t}\n\treturn 0;\n}\nvoid transform(int num, int B, char *str)\n{\n\tint i;\n\tfor (i = 0;(num / B) != 0;i++)\n\t{\n\t\tstr[i] ='0'+num % B;\n\t\tnum = num / B;\n\t}\n}",WRONG_ANSWER,38,508
1277410289723564032,5ad4dbb49340c80253114abf51ba25a8e80d6e95f9ba2cfaa3cbe70794d72ce0,2020-06-29 09:15:20,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nint is_that(int n,int B){\n    int flag=1, a[100000],i=0;\n    while(n){\n        a[i++]=n%B;\n        n=n/B;\n    }\n    for(int i=0;i<n/2;i++){\n        if(a[i]!=a[n-i-1]){\n            flag=0;\n            break;\n        }\n    }\n    return flag;\n}\nint main(){\n    int N,S,cnt=0,l,flag;\n    cin>>N>>S;\n    while(1){\n        S++;\n        l=0;\n        flag=0;\n        for(int i=2;i<=10;i++){\n            if(is_that(S,i))\n                flag++;\n            if(flag==2){\n                cnt++;\n                cout<<S<<'\\n';\n                break;\n            }\n        }\n       if(cnt==N)\n           break;\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,24,512
1277411065355239424,06973ea832a5a1b65d8be68c7f42fd3c791dd6b87b2be7840bfba18d17eace9c,2020-06-29 09:18:25,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n\nusing namespace std;\nint a[100000], b[100000];\nint m;       //进制数\n\nvoid s(int n)\n{\n    int i, j, l;\n    int ma = 0;\n    int k = n;\n    for (l = 1;;l++) {            //原来的数\n        b[l] = n % m;\n        n = n / m;\n        if (n == 0)break;\n    }\n    n = k * k;\n    for (i = 1;;i++) {                 //平方数\n        a[i] = n % m;\n        n = n / m;\n        if (n == 0)break;\n    }\n    for (j = 1;j <= i / 2;j++) {\n        if (a[i - j + 1] != a[j]) {\n            ma = 1;\n            break;\n        }\n    }\n    if (ma == 0) {\n        for (j = l;j >= 1;j--) {\n            if (b[j] < 10)\n                cout << b[j];\n            if (b[j] == 10)cout << \""A\"";\n            if (b[j] == 11)cout << \""B\"";\n            if (b[j] == 12)cout << \""C\"";\n            if (b[j] == 13)cout << \""D\"";\n            if (b[j] == 14)cout << \""E\"";\n            if (b[j] == 15)cout << \""F\"";\n            if (b[j] == 16)cout << \""G\"";\n            if (b[j] == 17)cout << \""H\"";\n            if (b[j] == 18)cout << \""I\"";\n            if (b[j] == 19)cout << \""J\"";\n        }\n        cout << \""  \"";\n        for (j = i;j >= 1;j--) {\n            if (a[j] < 10)\n                cout << a[j];\n            if (a[j] == 10)cout << \""A\"";\n            if (a[j] == 11)cout << \""B\"";\n            if (a[j] == 12)cout << \""C\"";\n            if (a[j] == 13)cout << \""D\"";\n            if (a[j] == 14)cout << \""E\"";\n            if (a[j] == 15)cout << \""F\"";\n            if (a[j] == 16)cout << \""G\"";\n            if (a[j] == 17)cout << \""H\"";\n            if (a[j] == 18)cout << \""I\"";\n            if (a[j] == 19)cout << \""J\"";\n        }\n        cout << endl;\n    }\n}\n\nint main()\n{\n    cin >> m;\n    for (int i = 1;i <= 300;i++)\n    {\n        s(i);\n    }\n    cout << endl;\n    return 0;\n}",PRESENTATION_ERROR,39,512
1277411480180293632,06973ea832a5a1b65d8be68c7f42fd3c791dd6b87b2be7840bfba18d17eace9c,2020-06-29 09:20:04,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n\nusing namespace std;\nint a[100000], b[100000];\nint m;\nint main()\n{\n    cin >> m;\n    for (int i = 1;i <= 300;i++)\n    {\n        s(i);\n    }\n\nvoid s(int n)\n{\n    int i, j, l;\n    int ma = 0;\n    int k = n;\n    for (l = 1;;l++) {\n        b[l] = n % m;\n        n = n / m;\n        if (n == 0)break;\n    }\n    n = k * k;\n    for (i = 1;;i++) {    \n        a[i] = n % m;\n        n = n / m;\n        if (n == 0)break;\n    }\n    for (j = 1;j <= i / 2;j++) {\n        if (a[i - j + 1] != a[j]) {\n            ma = 1;\n            break;\n        }\n    }\n    if (ma == 0) {\n        for (j = l;j >= 1;j--) {\n            if (b[j] < 10)\n                cout << b[j];\n            if (b[j] == 10)cout << \""A\"";\n            if (b[j] == 11)cout << \""B\"";\n            if (b[j] == 12)cout << \""C\"";\n            if (b[j] == 13)cout << \""D\"";\n            if (b[j] == 14)cout << \""E\"";\n            if (b[j] == 15)cout << \""F\"";\n            if (b[j] == 16)cout << \""G\"";\n            if (b[j] == 17)cout << \""H\"";\n            if (b[j] == 18)cout << \""I\"";\n            if (b[j] == 19)cout << \""J\"";\n        }\n        cout << \"" \"";\n        for (j = i;j >= 1;j--) {\n            if (a[j] < 10)\n                cout << a[j];\n            if (a[j] == 10)cout << \""A\"";\n            if (a[j] == 11)cout << \""B\"";\n            if (a[j] == 12)cout << \""C\"";\n            if (a[j] == 13)cout << \""D\"";\n            if (a[j] == 14)cout << \""E\"";\n            if (a[j] == 15)cout << \""F\"";\n            if (a[j] == 16)cout << \""G\"";\n            if (a[j] == 17)cout << \""H\"";\n            if (a[j] == 18)cout << \""I\"";\n            if (a[j] == 19)cout << \""J\"";\n        }\n        cout << endl;\n    }\n}\n\n    cout << endl;\n    return 0;\n}",COMPILE_ERROR,0,0
1277411609884942336,3088d2a34f854f0e6e37eed33962315b3ce14c8dce83bf8a0684354ed9b59ed2,2020-06-29 09:20:35,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\n\nint isPNumber(int number, int B, vector<char>& p){\n    vector<char> str;\n    while (number != 0){\n        char in;\n        if (number % B < 10)\n            in = '0' + number % B;\n        else\n            in = 'A' + number % B - 10;\n        str.push_back(in);\n        number /= B;\n    }\n    for (int index = 0; index < str.size(); index++){\n        if (str[index] != str[str.size() - 1 - index]){\n            p = str;\n            return 0;\n        }\n    }\n    return 1;\n}\n\nint main (void){\n    int B;\n    cin >> B;\n    vector<char> out;\n    \n    for (int i = 1; i <= 300; i++){\n        if (isPNumber(i*i, B, out))\n            cout << out;\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1277411702621011968,06973ea832a5a1b65d8be68c7f42fd3c791dd6b87b2be7840bfba18d17eace9c,2020-06-29 09:20:57,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n\nusing namespace std;\nint a[100000], b[100000];\nint m;       //进制数\n\nvoid s(int n)\n{\n    int i, j, l;\n    int ma = 0;\n    int k = n;\n    for (l = 1;;l++) {            //原来的数\n        b[l] = n % m;\n        n = n / m;\n        if (n == 0)break;\n    }\n    n = k * k;\n    for (i = 1;;i++) {                 //平方数\n        a[i] = n % m;\n        n = n / m;\n        if (n == 0)break;\n    }\n    for (j = 1;j <= i / 2;j++) {\n        if (a[i - j + 1] != a[j]) {\n            ma = 1;\n            break;\n        }\n    }\n    if (ma == 0) {\n        for (j = l;j >= 1;j--) {\n            if (b[j] < 10)\n                cout << b[j];\n            if (b[j] == 10)cout << \""A\"";\n            if (b[j] == 11)cout << \""B\"";\n            if (b[j] == 12)cout << \""C\"";\n            if (b[j] == 13)cout << \""D\"";\n            if (b[j] == 14)cout << \""E\"";\n            if (b[j] == 15)cout << \""F\"";\n            if (b[j] == 16)cout << \""G\"";\n            if (b[j] == 17)cout << \""H\"";\n            if (b[j] == 18)cout << \""I\"";\n            if (b[j] == 19)cout << \""J\"";\n        }\n        cout << \"" \"";\n        for (j = i;j >= 1;j--) {\n            if (a[j] < 10)\n                cout << a[j];\n            if (a[j] == 10)cout << \""A\"";\n            if (a[j] == 11)cout << \""B\"";\n            if (a[j] == 12)cout << \""C\"";\n            if (a[j] == 13)cout << \""D\"";\n            if (a[j] == 14)cout << \""E\"";\n            if (a[j] == 15)cout << \""F\"";\n            if (a[j] == 16)cout << \""G\"";\n            if (a[j] == 17)cout << \""H\"";\n            if (a[j] == 18)cout << \""I\"";\n            if (a[j] == 19)cout << \""J\"";\n        }\n        cout << endl;\n    }\n}\n\nint main()\n{\n    cin >> m;\n    for (int i = 1;i <= 300;i++)\n    {\n        s(i);\n    }\n    cout << endl;\n    return 0;\n}",PRESENTATION_ERROR,34,508
1277411851401363456,06973ea832a5a1b65d8be68c7f42fd3c791dd6b87b2be7840bfba18d17eace9c,2020-06-29 09:21:33,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nint main()\n{\n\tint i, j;\n\tint m, n;\n\tcin >> m >> n;\n\tfor (i = m;i <= n;i++)\n\t{\n\t\tfor (j = 2;j < i;j++)\n\t\t{\n\t\t\tif (i % j == 0)\n\t\t\t\tbreak;\n\t\t}\n\t\tif (i == j)\n\t\t{\n\t\t\tint s, x = 0;\n\t\t\ts = i;\n\t\t\twhile (s > 0)\n\t\t\t{\n\t\t\t\tx = x * 10 + s % 10;\n\t\t\t\ts = s / 10;\n\t\t\t}\n\t\t\tif (x == i)\n\t\t\t\tcout << x<< endl;\n\t\t\t\n\t\t}\n\n\t}\n}",WRONG_ANSWER,1773,524
1277412586054672384,06973ea832a5a1b65d8be68c7f42fd3c791dd6b87b2be7840bfba18d17eace9c,2020-06-29 09:24:28,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n\nusing namespace std;\nint a[100000], b[100000];\nint m;       //进制数\n\nvoid s(int n)\n{\n    int i, j, l;\n    int ma = 0;\n    int k = n;\n    for (l = 1;;l++) {            //原来的数\n        b[l] = n % m;\n        n = n / m;\n        if (n == 0)break;\n    }\n    n = k * k;\n    for (i = 1;;i++) {                 //平方数\n        a[i] = n % m;\n        n = n / m;\n        if (n == 0)break;\n    }\n    for (j = 1;j <= i / 2;j++) {\n        if (a[i - j + 1] != a[j]) {\n            ma = 1;\n            break;\n        }\n    }\n    if (ma == 0) {\n        for (j = l;j >= 1;j--) {\n            if (b[j] < 10)\n                cout << b[j];\n            if (b[j] == 10)cout << \""A\"";\n            if (b[j] == 11)cout << \""B\"";\n            if (b[j] == 12)cout << \""C\"";\n            if (b[j] == 13)cout << \""D\"";\n            if (b[j] == 14)cout << \""E\"";\n            if (b[j] == 15)cout << \""F\"";\n            if (b[j] == 16)cout << \""G\"";\n            if (b[j] == 17)cout << \""H\"";\n            if (b[j] == 18)cout << \""I\"";\n            if (b[j] == 19)cout << \""J\"";\n        }\n        cout << \"" \"";\n        for (j = i;j >= 1;j--) {\n            if (a[j] < 10)\n                cout << a[j];\n            if (a[j] == 10)cout << \""A\"";\n            if (a[j] == 11)cout << \""B\"";\n            if (a[j] == 12)cout << \""C\"";\n            if (a[j] == 13)cout << \""D\"";\n            if (a[j] == 14)cout << \""E\"";\n            if (a[j] == 15)cout << \""F\"";\n            if (a[j] == 16)cout << \""G\"";\n            if (a[j] == 17)cout << \""H\"";\n            if (a[j] == 18)cout << \""I\"";\n            if (a[j] == 19)cout << \""J\"";\n        }\n        cout << endl;\n    }\n}\n\nint main()\n{\n    cin >> m;\n    for (int i = 1;i <= 300;i++)\n    {\n        s(i);\n    }\n    cout << endl;\n    return 0;\n}",PRESENTATION_ERROR,28,512
1277412792494129152,06973ea832a5a1b65d8be68c7f42fd3c791dd6b87b2be7840bfba18d17eace9c,2020-06-29 09:25:17,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nint main()\n{\n\tint b;\n\tcin >> b;\n\tfor (int i = 1;i <= 300;i++)\n\t{\n\t\tint j;\n\t\tj = i * i;\n\t\tint s, x = 0;\n\t\ts = j;\n\t\twhile (s > 0)\n\t\t{\n\t\t\tx = x * 10 + s % 10;\n\t\t\ts = s / 10;\n\t\t}\n\t\tif (x == j)\n\t\t\tcout << i << \"" \""<<x << endl;\n\t}\n}",PARTIAL_ACCEPTED,23,492
1277413589755822080,32b7c4f8cffc3adcd9a13bac99222a0cfce30962e4357aee812d9afae4d2467e,2020-06-29 09:28:27,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cstdio>\n\nusing namespace std;\n\nint n;\nint temp[101] = {0};\nint tempi = 0;\n\nvoid judge(int x)\n{\n\tint a = x * x;\n\ttempi = 0;\n\twhile(a != 0)\n\t{\n\t\ttemp[++tempi] = a % n;\n\t\ta /= n;\n\t}\n\tbool found = true;\n\tfor(int i = 1; i <= tempi; i++)\n\t{\n\t\tif(temp[i] != temp[tempi - i + 1])\n\t\t{\n\t\t\tfound = false;\n\t\t}\n\t}\n\tif(found)\n\t{\n\t\tcout << x << \"" \"";\n\t\tfor(int i = tempi; i >= 1; i--)\n\t\t{\n\t\t\tcout << temp[i];\n\t\t}\n\t\tcout << endl;\n\t}\n}\n\nint main()\n{\n\tcin >> n;\n\t\n\tfor(int i = 1; i <= 300; i++)\n\t{\n\t\tjudge(i);\n\t}\n\t\n\t\n\treturn 0;\n} ",PARTIAL_ACCEPTED,42,492
1277416084712382464,5ad4dbb49340c80253114abf51ba25a8e80d6e95f9ba2cfaa3cbe70794d72ce0,2020-06-29 09:38:22,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nint is_that(int n,int B){\n    int flag=1, a[100000],i=0;\n    while(n){\n        a[i++]=n%B;\n        n=n/B;\n    }\n    for(int j=0;j<=i;j++){\n        if(a[j]!=a[i-j]){\n            flag=0;\n            break;\n        }\n    }\n    return flag;\n}\nint main(){\n    int N,S,cnt=0,flag;\n    cin>>N>>S;\n    while(1){\n        S++;\n        flag=0;\n        for(int i=2;i<=10;i++){\n            if(is_that(S,i))\n                flag++;\n            if(flag==2){\n                cnt++;\n                cout<<S<<'\\n';\n                break;\n            }\n        }\n       if(cnt==N)\n           break;\n    }\n    return 0;\n}",WRONG_ANSWER,30,424
1277416138227507200,32b7c4f8cffc3adcd9a13bac99222a0cfce30962e4357aee812d9afae4d2467e,2020-06-29 09:38:35,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cstdio>\n\nusing namespace std;\n\nint n;\nint temp[101] = {0};\nint tempi = 0;\nint aaa[101] = {0};\nint ai = 0;\n\nvoid judge(int x)\n{\n\tint a = x * x;\n\ttempi = 0;\n\tai = 0;\n\twhile(a != 0)\n\t{\n\t\ttemp[++tempi] = a % n;\n\t\ta /= n;\n\t}\n\tbool found = true;\n\tfor(int i = 1; i <= tempi; i++)\n\t{\n\t\tif(temp[i] != temp[tempi - i + 1])\n\t\t{\n\t\t\tfound = false;\n\t\t}\n\t}\n\tif(found)\n\t{\n\t\twhile(x != 0)\n\t\t{\n\t\t\taaa[++ai] = x % n;\n\t\t\tx /= n;\n\t\t}\n\t\tfor(int i = ai; i >= 1; i--)\n\t\t{\n\t\t\tif(aaa[i] >= 10)\n\t\t\t{\n\t\t\t\tcout << char(aaa[i] - 10 + 'A');\n\t\t\t}\n\t\t\telse cout << aaa[i]; \n\t\t}\n\t\tcout << \"" \"";\n\t\tfor(int i = tempi; i >= 1; i--)\n\t\t{\n\t\t\tif(temp[i] >= 10)\n\t\t\t{\n\t\t\t\tcout << char(temp[i] - 10 + 'A');\n\t\t\t}\n\t\t\telse cout << temp[i]; \n\t\t}\n\t\tcout << endl;\n\t}\n}\n\nint main()\n{\n\tcin >> n;\n\t\n\tfor(int i = 1; i <= 300; i++)\n\t{\n\t\tjudge(i);\n\t}\n\t\n\t\n\treturn 0;\n} ",ACCEPTED,42,512
1277416552482136064,aa7685f63889a3cde5da1cb43e396041035c79bd2b67566ccd152b251b60c102,2020-06-29 09:40:14,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<cstdio>\n#include<stack>\n#include<iostream>\n#include<queue>\n#include<algorithm>\n#include<iterator>\n#include<set>\n#include<string>\n#include<cstring> \n#include<map>\n#include<cmath> \n#include<vector>\n#define maxm 805\n//const int inf=2147483647;\nint b;\nconst int inf=1e9;\nchar jinzhi[20]={'0','1','2','3','4','5','6','7','8','9','a','b','c','d','e','f','g','h','i','j'};\nusing namespace std;\nint main()\n{\n\tcin>>b;\n\tfor(int i=1;i<=300;i++){\n\t\tint j=i*i;\n\t\tint k=i;\n\t\tint cnt1=0;\n\t\tint cnt2=0;\n\t\tchar s[100],sf[100];\n\t\tchar fang[100],fangf[100];\n\t\twhile(k){\n\t\t\ts[cnt1++]=jinzhi[k%b];\n\t\t\tk/=b;\n\t\t}\n\t\ts[cnt1]='\\0';\n\t\tfor(int wei=0;wei<cnt1;wei++){\n\t\t\tsf[wei]=s[cnt1-1-wei];\n\t\t}\n\t\tsf[cnt1]='\\0';\n\t\t//printf(\""%s %s\\n\"",s,sf);\n\t\t\n\t\twhile(j){\n\t\t\tfang[cnt2++]=jinzhi[j%b];\n\t\t\tj/=b;\n\t\t}\n\t\tfang[cnt2]='\\0';\n\t\tfor(int wei=0;wei<cnt2;wei++){\n\t\t\tfangf[wei]=fang[cnt2-1-wei];\n\t\t}\n\t\tfangf[cnt2]='\\0';\n\t\t//printf(\""%s %s\\n\"",fang,fangf);\n\t\tif(!strcmp(fang,fangf)){\n\t\t\tprintf(\""%s %s\\n\"",sf,fangf);\n\t\t}\n\t}\n\t/*char s[100];\n\tint cnt1=0,cnt2;\n\twhile(x){\n\t\ts[cnt1++]=jinzhi[x%b];\n\t\tx/=b;\n\t}\n\ts[cnt1]='\\0';\n\tcout<<s;*/\n    return 0;\n}",PARTIAL_ACCEPTED,26,424
1277416650716938240,5ad4dbb49340c80253114abf51ba25a8e80d6e95f9ba2cfaa3cbe70794d72ce0,2020-06-29 09:40:37,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nint is_that(int n,int B){\n    int flag=1, a[100000],i=0;\n    while(n){\n        a[i++]=n%B;\n        n=n/B;\n    }\n    for(int j=0;j<i;j++){\n        if(a[j]!=a[i-j-1]){\n            flag=0;\n            break;\n        }\n    }\n    return flag;\n}\nint main(){\n    int N,S,cnt=0,flag;\n    cin>>N>>S;\n    while(1){\n        S++;\n        flag=0;\n        for(int i=2;i<=10;i++){\n            if(is_that(S,i))\n                flag++;\n            if(flag==2){\n                cnt++;\n                cout<<S<<'\\n';\n                break;\n            }\n        }\n       if(cnt==N)\n           break;\n    }\n    return 0;\n}\n",ACCEPTED,38,464
1277417212854329344,aa7685f63889a3cde5da1cb43e396041035c79bd2b67566ccd152b251b60c102,2020-06-29 09:42:51,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<cstdio>\n#include<stack>\n#include<iostream>\n#include<queue>\n#include<algorithm>\n#include<iterator>\n#include<set>\n#include<string>\n#include<cstring> \n#include<map>\n#include<cmath> \n#include<vector>\n#define maxm 805\n//const int inf=2147483647;\nint b;\nconst int inf=1e9;\nchar jinzhi[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};//用大写 \nusing namespace std;\nint main()\n{\n\tcin>>b;\n\tfor(int i=1;i<=300;i++){\n\t\tint j=i*i;\n\t\tint k=i;\n\t\tint cnt1=0;\n\t\tint cnt2=0;\n\t\tchar s[100],sf[100];\n\t\tchar fang[100],fangf[100];\n\t\twhile(k){\n\t\t\ts[cnt1++]=jinzhi[k%b];\n\t\t\tk/=b;\n\t\t}\n\t\ts[cnt1]='\\0';\n\t\tfor(int wei=0;wei<cnt1;wei++){\n\t\t\tsf[wei]=s[cnt1-1-wei];\n\t\t}\n\t\tsf[cnt1]='\\0';\n\t\t//printf(\""%s %s\\n\"",s,sf);\n\t\t\n\t\twhile(j){\n\t\t\tfang[cnt2++]=jinzhi[j%b];\n\t\t\tj/=b;\n\t\t}\n\t\tfang[cnt2]='\\0';\n\t\tfor(int wei=0;wei<cnt2;wei++){\n\t\t\tfangf[wei]=fang[cnt2-1-wei];\n\t\t}\n\t\tfangf[cnt2]='\\0';\n\t\t//printf(\""%s %s\\n\"",fang,fangf);\n\t\tif(!strcmp(fang,fangf)){\n\t\t\tprintf(\""%s %s\\n\"",sf,fangf);\n\t\t}\n\t}\n\t/*char s[100];\n\tint cnt1=0,cnt2;\n\twhile(x){\n\t\ts[cnt1++]=jinzhi[x%b];\n\t\tx/=b;\n\t}\n\ts[cnt1]='\\0';\n\tcout<<s;*/\n    return 0;\n}",ACCEPTED,28,384
1277417285189296128,8e00c62448d7fcfc514eefb44d191b971cb398be84eedc3f56f08442370cc6ab,2020-06-29 09:43:08,Python,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"Lst = [\""0\"",\""1\"",\""2\"",\""3\"",\""4\"",\""5\"",\""6\"",\""7\"",\""8\"",\""9\"",\""A\"",\""B\"",\""C\"",\""D\"",\""E\"",\""F\"",\""G\"",\""H\"",\""I\"",\""J\""]\nn = int(input())\nfor x in range(1,300+1):\n    a = x**2\n    i = 1\n    c = \""\""\n    while a>=n:\n        i = a % n        \n        c = Lst[i] + c\n        a = a // n\n    c = Lst[a]+c\n    if c[::-1] == c:\n        print(x,c)",PARTIAL_ACCEPTED,156,3112
1277419829143732224,32b7c4f8cffc3adcd9a13bac99222a0cfce30962e4357aee812d9afae4d2467e,2020-06-29 09:53:15,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <cstdio>\n\nusing namespace std;\n\nint n, s;\nint temp[101] = {0};\nint tempi = 0;\nint ans = 0;\n\nvoid judge(int x)\n{\n\tint pd = 0;\n\tfor(int b = 2; b <= 10; b++)\n\t{\n\t\tint a = x;\n\t\ttempi = 0;\n\t\twhile(a != 0)\n\t\t{\n\t\t\ttemp[++tempi] = a % b;\n\t\t\ta /= b;\n\t\t}\n\t\tbool found = true;\n\t\tfor(int i = 1; i <= tempi; i++)\n\t\t{\n\t\t\tif(temp[i] != temp[tempi - i + 1])\n\t\t\t{\n\t\t\t\tfound = false;\n\t\t\t}\n\t\t}\n\t\tif(found) pd ++;\n\t\tif(pd >= 2)\n\t\t{\n\t\t\tcout << x << endl;\n\t\t\tans ++;\n\t\t\treturn; \n\t\t}\n\t}\n}\n\nint main()\n{\n\tcin >> n;\n\tcin >> s;\n\tfor(int i = s + 1; i <= 100010; i++)\n\t{\n\t\tif(ans >= n) break;\n\t\tjudge(i);\n\t}\n\t\n\t\n\treturn 0;\n} ",ACCEPTED,27,512
1277420409819947008,aa7685f63889a3cde5da1cb43e396041035c79bd2b67566ccd152b251b60c102,2020-06-29 09:55:33,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<cstdio>\n#include<stack>\n#include<iostream>\n#include<queue>\n#include<algorithm>\n#include<iterator>\n#include<set>\n#include<string>\n#include<cstring> \n#include<map>\n#include<cmath> \n#include<vector>\n#define maxm 805\n//const int inf=2147483647;\nconst int inf=1e9;\nchar jinzhi[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};//用大写 \nusing namespace std;\nbool huiwen(int k,int b){\n\tint cnt1=0;\n\tchar s[100],sf[100];\n\tchar fang[100],fangf[100];\n\twhile(k){\n\t\ts[cnt1++]=jinzhi[k%b];\n\t\tk/=b;\n\t}\n\ts[cnt1]='\\0';\n\tfor(int wei=0;wei<cnt1;wei++){\n\t\tsf[wei]=s[cnt1-1-wei];\n\t}\n\tsf[cnt1]='\\0';\n\treturn strcmp(s,sf)==0;\n}\nint main()\n{\n\tint n,s;\n\tcin>>n>>s;\n\tint ans=0;\n\tfor(int i=s+1;ans<n;i++){\n\t\tint k=i;\n\t\tint cnt=0;\n\t\tfor(int j=2;j<=10;j++){\n\t\t\tif(cnt==2) break;\n\t\t\tcnt+=huiwen(k,j);\n\t\t}\n\t\tif(cnt==2){\n\t\t\tprintf(\""%d\\n\"",k);\n\t\t\tans++;\n\t\t}\n\t}\n    return 0;\n}",ACCEPTED,32,496
1277420711197466624,8e00c62448d7fcfc514eefb44d191b971cb398be84eedc3f56f08442370cc6ab,2020-06-29 09:56:45,Python,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"Lst = [\""0\"",\""1\"",\""2\"",\""3\"",\""4\"",\""5\"",\""6\"",\""7\"",\""8\"",\""9\"",\""A\"",\""B\"",\""C\"",\""D\"",\""E\"",\""F\"",\""G\"",\""H\"",\""I\"",\""J\""]\nn = int(input())\ndef Hex(x,n):\n    if n = 10:\n        return str(x)\n    else:\n        i = 1\n        c = \""\""\n        while x>=n:\n            i = x % n        \n            c = Lst[i] + c\n            x = x // n\n        c = Lst[x]+c\n        return c\nfor x in range(1,300+1):\n    a = x**2\n    c = Hex(a,n)\n    \n    if c[::-1] == c:\n        print(Hex(x,n),c)",NON_ZERO_EXIT_CODE,163,3076
1277420979314155520,8e00c62448d7fcfc514eefb44d191b971cb398be84eedc3f56f08442370cc6ab,2020-06-29 09:57:49,Python,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"Lst = [\""0\"",\""1\"",\""2\"",\""3\"",\""4\"",\""5\"",\""6\"",\""7\"",\""8\"",\""9\"",\""A\"",\""B\"",\""C\"",\""D\"",\""E\"",\""F\"",\""G\"",\""H\"",\""I\"",\""J\""]\nn = int(input())\ndef Hex(x,n):\n    if n == 10:\n        return str(x)\n    else:\n        i = 1\n        c = \""\""\n        while x>=n:\n            i = x % n        \n            c = Lst[i] + c\n            x = x // n\n        c = Lst[x]+c\n        return c\nfor x in range(1,300+1):\n    a = x**2\n    c = Hex(a,n)\n    \n    if c[::-1] == c:\n        print(Hex(x,n),c)",ACCEPTED,175,3072
1277425440770162688,8dfc4310536289cd76ea42914988e7ec2df3b928a46d384cd853c9ca83199003,2020-06-29 10:15:33,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<cstdio>\n#include<algorithm>\n#include<cstring>\n#include<cmath>\nusing namespace std;\nint n;\nstruct node\n{\n    int s[100],l;\n}now;\nnode gets(int num)\n{\n    node ss;\n    ss.l=0;\n    while(num)\n    {\n        ss.s[++ss.l]=num%n;\n        num/=n;\n    }\n    return ss;\n}\nbool judge(node s)\n{\n    for(int i=1;i<=s.l;i++)\n    if(s.s[i]!=s.s[s.l-i+1])return 0;\n    return 1;\n}\nvoid show(node a)\n{\n    for(int i=a.l;i>=1;i--)\n    {\n        if(a.s[i]>10)\n        {\n            printf(\""%c\"",\""A\""+a.s[i]-11);\n        }\n        else printf(\""%d\"",a.s[i]);\n    };\n}\nint main()\n{\n    scanf(\""%d\"",&n);\n    for(int i=1;i<=300;i++)\n    {\n        now=gets(i*i);\n        if(judge(now))\n        {\n            show(gets(i));\n            printf(\"" \"");\n            show(now);\n            printf(\""\\n\"");\n        }\n    }\n    return 0;\n} ",PARTIAL_ACCEPTED,31,384
1277427558658793472,8e00c62448d7fcfc514eefb44d191b971cb398be84eedc3f56f08442370cc6ab,2020-06-29 10:23:58,Python,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"Lst = [\""0\"",\""1\"",\""2\"",\""3\"",\""4\"",\""5\"",\""6\"",\""7\"",\""8\"",\""9\"",\""A\"",\""B\"",\""C\"",\""D\"",\""E\"",\""F\"",\""G\"",\""H\"",\""I\"",\""J\""]\nn,s = map(int,input().split( ))\ndef Hex(x,n):\n    if n == 10:\n        return str(x)\n    else:\n        i = 1\n        c = \""\""\n        while x>=n:\n            i = x % n        \n            c = Lst[i] + c\n            x = x // n\n        c = Lst[x]+c\n        return c\ndef double_huiwen(x):\n    a =0\n    for i in range(2,10+1):\n        c = Hex(x,i)\n        if c[::-1] == c:\n            a += 1\n        if a > 1:\n            return True\n            break\n    return False\ni = 0\nwhile i < n:\n    s += 1\n    if double_huiwen(s):\n        print(s)\n        i += 1",ACCEPTED,267,3112
1277428139607654400,765430f8d30e25643f5e1304ddc54ec6e2ef0a539f7381e25fa1e885093ab134,2020-06-29 10:26:16,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<math.h>\nusing namespace std;\n\nbool circle(int m, int n)//该函数判断m的n进制数是否为回文数\n{\n\tint s = 0, l = m;\n\twhile (l)\n\t{\n\t\ts = s * n + l % n;//该语句是反顺序计算数值\n\t\tl /= n;\n\t}\n\treturn s == m;//如果是回文数，那么正反顺序的数字应该是相等的\n}\n\nbool turn(int num)\n{\n\tint k = 0;\n\tfor (int i = 2; i <=10; i++)\n\t{\n\t\tif (circle(num,i))\n\t\t{\n\t\t\tk++;\n\t\t}\n\t}\n\tif (k>=2)\n\t{\n\t\treturn true;\n\t}\n\telse\n\t{\n\t\treturn false;\n\t}\n}\nint main()\n{\n\tint i = 1;\n\tint n;\n\tint s;\n\tcin >> n >> s;\n\twhile (true)\n\t{\n\t\ts++;\n\t\tif (turn(s))\n\t\t{\n\t\t\ti++;\n\t\t\tcout << s << endl;\n\t\t}\n\t\tif (i>3)\n\t\t{\n\t\t\tbreak;\n\t\t}\n\t}\n}\n",WRONG_ANSWER,32,412
1277428865394204672,765430f8d30e25643f5e1304ddc54ec6e2ef0a539f7381e25fa1e885093ab134,2020-06-29 10:29:09,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<math.h>\nusing namespace std;\n\nbool circle(int m, int n)//该函数判断m的n进制数是否为回文数\n{\n\tint s = 0, l = m;\n\twhile (l)\n\t{\n\t\ts = s * n + l % n;//该语句是反顺序计算数值\n\t\tl /= n;\n\t}\n\treturn s == m;//如果是回文数，那么正反顺序的数字应该是相等的\n}\n\nbool turn(int num)\n{\n\tint k = 0;\n\tfor (int i = 2; i <=10; i++)\n\t{\n\t\tif (circle(num,i))\n\t\t{\n\t\t\tk++;\n\t\t}\n\t}\n\tif (k>=2)\n\t{\n\t\treturn true;\n\t}\n\telse\n\t{\n\t\treturn false;\n\t}\n}\nint main()\n{\n\tint i = 1;\n\tint n;\n\tint s;\n\tcin >> n >> s;\n\twhile (true)\n\t{\n\t\ts++;\n\t\tif (turn(s))\n\t\t{\n\t\t\ti++;\n\t\t\tcout << s << endl;\n\t\t}\n\t\tif (i>n)\n\t\t{\n\t\t\tbreak;\n\t\t}\n\t}\n}\n",ACCEPTED,37,512
1277430780190449664,949f4200c5481916ce7e0105ff3c4b09a924fc548d16434f2f8a149b07e958c0,2020-06-29 10:36:46,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <string.h>\nusing namespace std;\nstring itoa(int i,string x,int n){\n    string s=\"" \"";\n    x=\""\"";\n    do{\n        int t=i%n;\n        if(t>=0&&t<=9){\n            s+=t+'0';\n        }\n        else{\n            s+=t + 'A';\n\n        }\n        i/=n;\n    }while(i!=0);\n    for(unsigned int i=s.size()-1; i>0; i--){\n        x=x+s[i];\n    }\n    return x;\n}\nint main()\n{\n    int n;\n    cin>>n;\n    for(int i=1; i<=300; i++){\n        int x=i*i;\n        string y,z;\n        z = itoa(i,z,n);\n        y = itoa(x,y,n);\n        int e;\n        for(unsigned int j=0; j<y.size(); j++){\n            if(y[j]==y[y.size()-j-1]){\n                e=1;\n            }\n            else{\n                e=0;\n                break;\n                }\n        }\n            if(e==1){\n                cout<<z<<\"" \""<<y<<endl;\n            }\n        }\n\n    return 0;\n}\n",PARTIAL_ACCEPTED,42,720
1277432968233017344,949f4200c5481916ce7e0105ff3c4b09a924fc548d16434f2f8a149b07e958c0,2020-06-29 10:45:27,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <string.h>\nusing namespace std;\nstring itoa(int i,string x,int n){\n    string s=\"" \"";\n    x=\""\"";\n    do{\n        int t=i%n;\n        if(t>=0&&t<=9){\n            s+=t+'0';\n        }\n        else{\n            s+=t + 'A';\n\n        }\n        i/=n;\n    }while(i!=0);\n    for(unsigned int i=s.size()-1; i>0; i--){\n        x=x+s[i];\n    }\n    return x;\n}\nint main()\n{\n    int n;\n    cin>>n;\n    for(int i=1; i<=300; i++){\n        if(n>20)\n            break;\n        int x=i*i;\n        string y,z;\n        z = itoa(i,z,n);\n        y = itoa(x,y,n);\n        int e;\n        for(unsigned int j=0; j<y.size(); j++){\n            if(y[j]==y[y.size()-j-1]){\n                e=1;\n            }\n            else{\n                e=0;\n                break;\n                }\n        }\n            if(e==1){\n                cout<<z<<\"" \""<<y<<endl;\n            }\n        }\n\n    return 0;\n}\n",PARTIAL_ACCEPTED,35,512
1277433772507594752,949f4200c5481916ce7e0105ff3c4b09a924fc548d16434f2f8a149b07e958c0,2020-06-29 10:48:39,C++,40.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <string.h>\nusing namespace std;\nstring itoa(int i,string x,int n){\n    string s=\"" \"";\n    x=\""\"";\n    do{\n        int t=i%n;\n        if(t>=0&&t<=9){\n            s+=t+'0';\n        }\n        else{\n            s+=t + 'A';\n\n        }\n        i/=n;\n    }while(i!=0);\n    for(unsigned int i=s.size()-1; i>0; i--){\n        x=x+s[i];\n    }\n    return x;\n}\nint main()\n{\n    int n;\n    cin>>n;\n    for(int i=1; i<=300; i++){\n        if(n>20||n<=2)\n            break;\n        int x=i*i;\n        string y,z;\n        z = itoa(i,z,n);\n        y = itoa(x,y,n);\n        int e;\n        for(unsigned int j=0; j<y.size(); j++){\n            if(y[j]==y[y.size()-j-1]){\n                e=1;\n            }\n            else{\n                e=0;\n                break;\n                }\n        }\n            if(e==1){\n                cout<<z<<\"" \""<<y<<endl;\n            }\n        }\n\n    return 0;\n}\n",PARTIAL_ACCEPTED,38,424
1277433832368693248,949f4200c5481916ce7e0105ff3c4b09a924fc548d16434f2f8a149b07e958c0,2020-06-29 10:48:53,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <string.h>\nusing namespace std;\nstring itoa(int i,string x,int n){\n    string s=\"" \"";\n    x=\""\"";\n    do{\n        int t=i%n;\n        if(t>=0&&t<=9){\n            s+=t+'0';\n        }\n        else{\n            s+=t + 'A';\n\n        }\n        i/=n;\n    }while(i!=0);\n    for(unsigned int i=s.size()-1; i>0; i--){\n        x=x+s[i];\n    }\n    return x;\n}\nint main()\n{\n    int n;\n    cin>>n;\n    for(int i=1; i<=300; i++){\n        if(n>20||n<2)\n            break;\n        int x=i*i;\n        string y,z;\n        z = itoa(i,z,n);\n        y = itoa(x,y,n);\n        int e;\n        for(unsigned int j=0; j<y.size(); j++){\n            if(y[j]==y[y.size()-j-1]){\n                e=1;\n            }\n            else{\n                e=0;\n                break;\n                }\n        }\n            if(e==1){\n                cout<<z<<\"" \""<<y<<endl;\n            }\n        }\n\n    return 0;\n}\n",PARTIAL_ACCEPTED,38,592
1277434361735995392,949f4200c5481916ce7e0105ff3c4b09a924fc548d16434f2f8a149b07e958c0,2020-06-29 10:51:00,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <string.h>\nusing namespace std;\nstring itoa(int i,string x,int n){\n    string s=\"" \"";\n    x=\""\"";\n    do{\n        int t=i%n;\n        if(t>=0&&t<=9){\n            s+=t+'0';\n        }\n        else{\n            s+=t + 'A';\n\n        }\n        i/=n;\n    }while(i!=0);\n    for(unsigned int i=s.size()-1; i>0; i--){\n        x=x+s[i];\n    }\n    return x;\n}\nint main()\n{\n    int n;\n    cin>>n;\n    for(int i=1; i<=300; i++){\n        if(n>20||n<2){\n            cout<<endl;\n            break;\n        }\n        int x=i*i;\n        string y,z;\n        z = itoa(i,z,n);\n        y = itoa(x,y,n);\n        int e;\n        for(unsigned int j=0; j<y.size(); j++){\n            if(y[j]==y[y.size()-j-1]){\n                e=1;\n            }\n            else{\n                e=0;\n                break;\n                }\n        }\n            if(e==1){\n                cout<<z<<\"" \""<<y<<endl;\n            }\n        }\n\n    return 0;\n}\n",PARTIAL_ACCEPTED,46,512
1277434784454729728,949f4200c5481916ce7e0105ff3c4b09a924fc548d16434f2f8a149b07e958c0,2020-06-29 10:52:40,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <string.h>\nusing namespace std;\nstring itoa(int i,string x,int n){\n    string s=\"" \"";\n    x=\""\"";\n    do{\n        int t=i%n;\n        if(t>=0&&t<=9){\n            s+=t+'0';\n        }\n        else{\n            s+=t + 'A';\n\n        }\n        i/=n;\n    }while(i!=0);\n    for(unsigned int i=s.size()-1; i>0; i--){\n        x=x+s[i];\n    }\n    return x;\n}\nint main()\n{\n    int n;\n    cin>>n;\n    for(int i=1; i<=300; i++){\n        if(n>20||n<2){\n            cout<<;\n            break;\n        }\n        int x=i*i;\n        string y,z;\n        z = itoa(i,z,n);\n        y = itoa(x,y,n);\n        int e;\n        for(unsigned int j=0; j<y.size(); j++){\n            if(y[j]==y[y.size()-j-1]){\n                e=1;\n            }\n            else{\n                e=0;\n                break;\n                }\n        }\n            if(e==1){\n                cout<<z<<\"" \""<<y<<endl;\n            }\n        }\n\n    return 0;\n}\n",COMPILE_ERROR,0,0
1277434834660548608,949f4200c5481916ce7e0105ff3c4b09a924fc548d16434f2f8a149b07e958c0,2020-06-29 10:52:52,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <string.h>\nusing namespace std;\nstring itoa(int i,string x,int n){\n    string s=\"" \"";\n    x=\""\"";\n    do{\n        int t=i%n;\n        if(t>=0&&t<=9){\n            s+=t+'0';\n        }\n        else{\n            s+=t + 'A';\n\n        }\n        i/=n;\n    }while(i!=0);\n    for(unsigned int i=s.size()-1; i>0; i--){\n        x=x+s[i];\n    }\n    return x;\n}\nint main()\n{\n    int n;\n    cin>>n;\n    for(int i=1; i<=300; i++){\n        if(n>20||n<2){\n            cout<<\"" \"";\n            break;\n        }\n        int x=i*i;\n        string y,z;\n        z = itoa(i,z,n);\n        y = itoa(x,y,n);\n        int e;\n        for(unsigned int j=0; j<y.size(); j++){\n            if(y[j]==y[y.size()-j-1]){\n                e=1;\n            }\n            else{\n                e=0;\n                break;\n                }\n        }\n            if(e==1){\n                cout<<z<<\"" \""<<y<<endl;\n            }\n        }\n\n    return 0;\n}\n",PARTIAL_ACCEPTED,31,432
1277435735836123136,8dfc4310536289cd76ea42914988e7ec2df3b928a46d384cd853c9ca83199003,2020-06-29 10:56:27,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<cstdio>\n#include<algorithm>\n#include<cstring>\n#include<cmath>\nusing namespace std;\nint n;\nstruct node\n{\n    int s[100],l;\n}now;\nnode gets(int num)\n{\n    node ss;\n    ss.l=0;\n    while(num)\n    {\n        ss.s[++ss.l]=num%n;\n        num/=n;\n    }\n    return ss;\n}\nbool judge(node s)\n{\n    for(int i=1;i<=s.l;i++)\n    if(s.s[i]!=s.s[s.l-i+1])return 0;\n    return 1;\n}\nvoid show(node a)\n{\n    for(int i=a.l;i>=1;i--)\n    {\n        if(a.s[i]>10)\n        {\n            printf(\""%c\"",'A'+a.s[i]-11);\n        }\n        else printf(\""%d\"",a.s[i]);\n    };\n}\nint main()\n{\n    scanf(\""%d\"",&n);\n    for(int i=1;i<=300;i++)\n    {\n        now=gets(i*i);\n        if(judge(now))\n        {\n            show(gets(i));\n            printf(\"" \"");\n            show(now);\n            printf(\""\\n\"");\n        }\n    }\n    return 0;\n} ",PARTIAL_ACCEPTED,30,384
1277435939226312704,8dfc4310536289cd76ea42914988e7ec2df3b928a46d384cd853c9ca83199003,2020-06-29 10:57:16,C++,30.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<cstdio>\n#include<algorithm>\n#include<cstring>\n#include<cmath>\nusing namespace std;\nint n;\nstruct node\n{\n    int s[100],l;\n}now;\nnode gets(int num)\n{\n    node ss;\n    ss.l=0;\n    while(num)\n    {\n        ss.s[++ss.l]=num%n;\n        num/=n;\n    }\n    return ss;\n}\nbool judge(node s)\n{\n    for(int i=1;i<=s.l;i++)\n    if(s.s[i]!=s.s[s.l-i+1])return 0;\n    return 1;\n}\nvoid show(node a)\n{\n    for(int i=a.l;i>=1;i--)\n    {\n        if(a.s[i]>10)\n        {\n            printf(\""%c\"",'A'+a.s[i]-11);\n        }\n        else printf(\""%d\"",a.s[i]);\n    };\n}\nint main()\n{\n    scanf(\""%d\"",&n);\n    for(int i=1;i<=3*n*n;i++)\n    {\n        now=gets(i*i);\n        if(judge(now))\n        {\n            show(gets(i));\n            printf(\"" \"");\n            show(now);\n            printf(\""\\n\"");\n        }\n    }\n    return 0;\n} ",PARTIAL_ACCEPTED,24,412
1277436725658320896,8dfc4310536289cd76ea42914988e7ec2df3b928a46d384cd853c9ca83199003,2020-06-29 11:00:23,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<cstdio>\n#include<algorithm>\n#include<cstring>\n#include<cmath>\nusing namespace std;\nint n;\nstruct node\n{\n    int s[100],l;\n}now;\nnode gets(int num)\n{\n    node ss;\n    ss.l=0;\n    while(num)\n    {\n        ss.s[++ss.l]=num%n;\n        num/=n;\n    }\n    return ss;\n}\nbool judge(node s)\n{\n    for(int i=1;i<=s.l;i++)\n    if(s.s[i]!=s.s[s.l-i+1])return 0;\n    return 1;\n}\nvoid show(node a)\n{\n    for(int i=a.l;i>=1;i--)\n    {#include<cstdio>\n#include<algorithm>\n#include<cstring>\n#include<cmath>\nusing namespace std;\nint n;\nstruct node\n{\n    int s[100],l;\n}now;\nnode gets(int num)\n{\n    node ss;\n    ss.l=0;\n    while(num)\n    {\n        ss.s[++ss.l]=num%n;\n        num/=n;\n    }\n    return ss;\n}\nbool judge(node s)\n{\n    for(int i=1;i<=s.l;i++)\n    if(s.s[i]!=s.s[s.l-i+1])return 0;\n    return 1;\n}\nvoid show(node a)\n{\n    for(int i=a.l;i>=1;i--)\n    {\n        if(a.s[i]>10)\n        {\n            printf(\""%c\"",'A'+a.s[i]-10);\n        }\n        else printf(\""%d\"",a.s[i]);\n    };\n}\nint main()\n{\n    scanf(\""%d\"",&n);\n    for(int i=1;i<=300;i++)\n    {\n        now=gets(i*i);\n        if(judge(now))\n        {\n            show(gets(i));\n            printf(\"" \"");\n            show(now);\n            printf(\""\\n\"");\n        }\n    }\n    return 0;\n} \n        if(a.s[i]>10)\n        {\n            printf(\""%c\"",'A'+a.s[i]-11);\n        }\n        else printf(\""%d\"",a.s[i]);\n    };\n}\nint main()\n{\n    scanf(\""%d\"",&n);\n    for(int i=1;i<=3*n*n;i++)\n    {\n        now=gets(i*i);\n        if(judge(now))\n        {\n            show(gets(i));\n            printf(\"" \"");\n            show(now);\n            printf(\""\\n\"");\n        }\n    }\n    return 0;\n} ",COMPILE_ERROR,0,0
1277436773808930816,8dfc4310536289cd76ea42914988e7ec2df3b928a46d384cd853c9ca83199003,2020-06-29 11:00:35,C++,70.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<cstdio>\n#include<algorithm>\n#include<cstring>\n#include<cmath>\nusing namespace std;\nint n;\nstruct node\n{\n    int s[100],l;\n}now;\nnode gets(int num)\n{\n    node ss;\n    ss.l=0;\n    while(num)\n    {\n        ss.s[++ss.l]=num%n;\n        num/=n;\n    }\n    return ss;\n}\nbool judge(node s)\n{\n    for(int i=1;i<=s.l;i++)\n    if(s.s[i]!=s.s[s.l-i+1])return 0;\n    return 1;\n}\nvoid show(node a)\n{\n    for(int i=a.l;i>=1;i--)\n    {\n        if(a.s[i]>10)\n        {\n            printf(\""%c\"",'A'+a.s[i]-10);\n        }\n        else printf(\""%d\"",a.s[i]);\n    };\n}\nint main()\n{\n    scanf(\""%d\"",&n);\n    for(int i=1;i<=300;i++)\n    {\n        now=gets(i*i);\n        if(judge(now))\n        {\n            show(gets(i));\n            printf(\"" \"");\n            show(now);\n            printf(\""\\n\"");\n        }\n    }\n    return 0;\n} ",PARTIAL_ACCEPTED,29,384
1277436922354393088,949f4200c5481916ce7e0105ff3c4b09a924fc548d16434f2f8a149b07e958c0,2020-06-29 11:01:10,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <string.h>\nusing namespace std;\nstring itoa(int i,string x,int n){\n    string s=\"" \"";\n    x=\""\"";\n    do{\n        int t=i%n;\n        if(t>=0&&t<=9){\n            s+=t+'0';\n        }\n        else{\n            s+=t + '7';\n\n        }\n        i/=n;\n    }while(i!=0);\n    for(unsigned int i=s.size()-1; i>0; i--){\n        x=x+s[i];\n    }\n    return x;\n}\nint main()\n{\n    int n;\n    cin>>n;\n    for(int i=1; i<=300; i++){\n        if(n>20||n<2){\n            break;\n        }\n        int x=i*i;\n        string y,z;\n        z = itoa(i,z,n);\n        y = itoa(x,y,n);\n        int e;\n        for(unsigned int j=0; j<y.size(); j++){\n            if(y[j]==y[y.size()-j-1]){\n                e=1;\n            }\n            else{\n                e=0;\n                break;\n                }\n        }\n            if(e==1){\n                cout<<z<<\"" \""<<y<<endl;\n            }\n        }\n\n    return 0;\n}\n",ACCEPTED,32,512
1277437877045100544,8dfc4310536289cd76ea42914988e7ec2df3b928a46d384cd853c9ca83199003,2020-06-29 11:04:58,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<cstdio>\n#include<algorithm>\n#include<cstring>\n#include<cmath>\nusing namespace std;\nint n;\nstruct node\n{\n    int s[100],l;\n}now;\nnode gets(int num)\n{\n    node ss;\n    ss.l=0;\n    while(num)\n    {\n        ss.s[++ss.l]=num%n;\n        num/=n;\n    }\n    return ss;\n}\nbool judge(node s)\n{\n    for(int i=1;i<=s.l;i++)\n    if(s.s[i]!=s.s[s.l-i+1])return 0;\n    return 1;\n}\nvoid show(node a)\n{\n    for(int i=a.l;i>=1;i--)\n    {\n        if(a.s[i]>=10)\n        {\n            printf(\""%c\"",'A'+a.s[i]-10);\n        }\n        else printf(\""%d\"",a.s[i]);\n    };\n}\nint main()\n{\n    scanf(\""%d\"",&n);\n    for(int i=1;i<=300;i++)\n    {\n        now=gets(i*i);\n        if(judge(now))\n        {\n            show(gets(i));\n            printf(\"" \"");\n            show(now);\n            printf(\""\\n\"");\n        }\n    }\n    return 0;\n} ",ACCEPTED,34,488
1277439919826337792,8dfc4310536289cd76ea42914988e7ec2df3b928a46d384cd853c9ca83199003,2020-06-29 11:13:05,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<cstdio>\n#include<algorithm>\n#include<cstring>\n#include<cmath>\nusing namespace std;\nint n,sn;\nstruct node\n{\n    int s[100],l;\n}now;\nnode gets(int num,int m)\n{\n    node ss;\n    ss.l=0;\n    while(num)\n    {\n        ss.s[++ss.l]=num%m;\n        num/=m;\n    }\n    return ss;\n}\nbool judge(node s)\n{\n    for(int i=1;i<=s.l;i++)\n    if(s.s[i]!=s.s[s.l-i+1])return 0;\n    return 1;\n}\n\nint main()\n{\n    scanf(\""%d%d\"",&n,&sn);sn++;\n    while(n)\n    {\n        int pd=0;\n        for(int i=2;i<=10;i++)\n        {\n            if(judge(gets(sn,i)))\n            pd++;\n        }\n        if(pd>=2)\n        {\n            printf(\""%d\"",sn);\n            if(n!=1)printf(\""\\n\"");\n            n--;\n        }\n        sn++;\n    }\n    return 0;\n} ",ACCEPTED,20,384
1277442108040863744,2506d5801ac56b957e1c7a7608991bb956321549d59508d48faca2aea9c9d42a,2020-06-29 11:21:46,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\nint main()\n{\n    int n;\n    cin >> n;\n    for (int i = 1; i <= 300;i++)\n    {\n        int temp = 0;\n        int temp2 = 0;\n        int test[10000];\n        int test2[5000];\n        int square = i * i;\n\n        while (i/n!=0)\n        {\n            temp2++;\n            test2[temp2] = i / n;\n            i = i % n;\n        }\n\n        test2[++temp2] = i % n;\n\n        while (square/n!=0)\n        {\n            temp++;\n            test[temp] = square / n;\n            square = square % n;\n        }\n        test[++temp] = square % n;\n\n        bool pdf;\n\n        for (int j = 1; j <= temp/2;j++)\n        {\n            if (test[j]!=test[temp-j])\n                pdf = false;\n        }\n\n        if (pdf!=false)\n        {\n            for (int j = 1; j <= temp2;j++)\n            {\n                if (test2[j]>=10)\n                {\n                    char ch = test2[j] + 55;\n                    cout << ch;\n                }\n\n                cout << test2[j];\n            }\n            cout << \"" \"";\n\n            for (int j = 1; j <= temp;j++)\n            {\n                if (test[j]>=10)\n                {\n                    char ch = test[j] + 55;\n                    cout << ch;\n                }\n\n                cout << test[j];\n            }\n\n            cout << endl;\n        }\n    }\n\n    return 0;\n\n\n\n}",TIME_LIMIT_EXCEEDED,0,0
1277443347650633728,2506d5801ac56b957e1c7a7608991bb956321549d59508d48faca2aea9c9d42a,2020-06-29 11:26:42,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\nint main()\n{\n    int n;\n    cin >> n;\n    for (int i = 1; i <= 300;i++)\n    {\n        int temp = 0;\n        int temp2 = 0;\n        int test[5000];\n        int test2[5000];\n        int square = i * i;\n\n        while (i/n!=0)\n        {\n            temp2++;\n            test2[temp2] = i / n;\n            i = i % n;\n        }\n\n        test2[++temp2] = i % n;\n\n        while (square/n!=0)\n        {\n            temp++;\n            test[temp] = square / n;\n            square = square % n;\n        }\n        test[++temp] = square % n;\n\n        bool pdf;\n\n        for (int j = 1; j <= temp/2+1;j++)\n        {\n            if (test[j]!=test[temp-j])\n                pdf = false;\n        }\n\n        if (pdf!=false)\n        {\n            for (int j = 1; j <= temp2;j++)\n            {\n                if (test2[j]>=10)\n                {\n                    char ch = test2[j] + 55;\n                    cout << ch;\n                }\n\n                cout << test2[j];\n            }\n            cout << \"" \"";\n\n            for (int j = 1; j <= temp;j++)\n            {\n                if (test[j]>=10)\n                {\n                    char ch = test[j] + 55;\n                    cout << ch;\n                }\n\n                cout << test[j];\n            }\n\n            cout << endl;\n        }\n    }\n\n    return 0;\n\n\n\n}",TIME_LIMIT_EXCEEDED,0,0
1277443460649377792,7ff8ca0f38dc5a725990bdfab0b3a9744dfb07847205203cc37de344d053f5af,2020-06-29 11:27:09,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<math.h>\nusing namespace std;\nint main(){\n    int n=0,b=0,c[5]={0},flag=0;\n    cin >> b;\n    for(int i=1;i<=300;i++){\n        int a=i*i;\n        while(a/b!=0){\n            c[n]=a%b;\n            a=a/b;\n            n+=1;\n        }\n        c[n]=a;\n        for(int j=0;j<=(n/2);j++){\n            if(c[j]!=c[n-j]){\n                flag=1;\n                break;\n            }\n        }\n        if(!flag){\n            cout << i << ' ';\n            for(int k=0;k<=n;k++)   cout << c[k];\n            cout << endl;\n        }\n        n=0;    flag=0;\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,29,512
1277446076972326912,2506d5801ac56b957e1c7a7608991bb956321549d59508d48faca2aea9c9d42a,2020-06-29 11:37:33,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\nint main()\n{\n    int n;\n    cin >> n;\n    for (int i = 1; i <= 300;i++)\n    {\n        int temp = 0;\n        int temp2 = 0;\n        int test[500];\n        int test2[500];\n        int square = i * i;\n\n        while (i/n!=0)\n        {\n            temp2++;\n            test2[temp2] = i % n;\n            i = i / n;\n        }\n\n        test2[++temp2] = i % n;\n\n        while (square/n!=0)\n        {\n            temp++;\n            test[temp] = square % n;\n            square = square / n;\n        }\n        test[++temp] = square % n;\n\n        bool pdf;\n\n        for (int j = 1; j <= temp/2+1;j++)\n        {\n            if (test[j]!=test[temp-j])\n                pdf = false;\n        }\n\n        if (pdf!=false)\n        {\n            for (int j = 1; j <= temp2;j++)\n            {\n                if (test2[j]>=10)\n                {\n                    char ch = test2[j] + 55;\n                    cout << ch;\n                }\n\n                cout << test2[j];\n            }\n            cout << \"" \"";\n\n            for (int j = 1; j <= temp;j++)\n            {\n                if (test[j]>=10)\n                {\n                    char ch = test[j] + 55;\n                    cout << ch;\n                }\n\n                cout << test[j];\n            }\n\n            cout << endl;\n        }\n    }\n\n    return 0;\n\n\n\n}",TIME_LIMIT_EXCEEDED,0,0
1277447539052175360,2506d5801ac56b957e1c7a7608991bb956321549d59508d48faca2aea9c9d42a,2020-06-29 11:43:21,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n\nusing namespace std;\nint main()\n{\n    int n;\n    cin >> n;\n    for (int k = 1; k <= 300;k++)\n    {\n        int i = k;\n        int temp = 0;\n        int temp2 = 0;\n        int test[500];\n        int test2[500];\n        int square = i * i;\n\n        while (i!=0)\n        {\n            temp2++;\n            test2[temp2] = i % n;\n            i = i / n;\n        }\n\n\n        while (square!=0)\n        {\n            temp++;\n            test[temp] = square % n;\n            square = square / n;\n        }\n\n        bool pdf;\n\n        for (int j = 1; j <= temp/2+1;j++)\n        {\n            if (test[j]!=test[temp-j])\n                pdf = false;\n        }\n\n        if (pdf!=false)\n        {\n            for (int j = 1; j <= temp2;j++)\n            {\n                if (test2[j]>=10)\n                {\n                    char ch = test2[j] + 55;\n                    cout << ch;\n                }\n\n                cout << test2[j];\n            }\n\n            cout << \"" \"";\n\n            for (int j = 1; j <= temp;j++)\n            {\n                if (test[j]>=10)\n                {\n                    char ch = test[j] + 55;\n                    cout << ch;\n                }\n\n                cout << test[j];\n            }\n\n            cout << endl;\n        }\n    }\n\n    return 0;\n\n\n\n}",WRONG_ANSWER,42,512
1277447881739403264,cfaeef6ff06d46402265a0040c491ed07540aa378a12b52f59664185f3f75c50,2020-06-29 11:44:43,C++,40.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nchar zf1[100],zf2[100];\n\nvoid zh1(int i,int B)\n{\n\tint a[100],n=0;\n\twhile(i!=0)\n\t{\n\t\tn++;\n\t\ta[n]=i%B;\n\t\ti/=B;\n\t}\n\tif(B>10)\n\t{\n\t\tfor(int i=1;i<=n;i++)\n\t\t{\n\t\t\tzf1[i]=a[i]+55;\n\t\t\tzf1[0]=n;\n\t\t}\n\t}else{\n\t\tfor(int i=1;i<=n;i++)\n\t\t{\n\t\t\tzf1[i]=a[i]+48;\n\t\t\tzf1[0]=n;\n\t\t}\n\t}\n\n}\n\nvoid zh2(int j,int B)\n{\n\tint a[100],n=0,i=j*j;\n\twhile(i!=0)\n\t{\n\t\tn++;\n\t\ta[n]=i%B;\n\t\ti/=B;\n\t}\n\tif(B>10)\n\t{\n\t\tfor(int i=1;i<=n;i++)\n\t\t{\n\t\t\tzf2[i]=a[i]+55;\n\t\t\tzf2[0]=n;\n\t\t}\n\t}else{\n\t\tfor(int i=1;i<=n;i++)\n\t\t{\n\t\t\tzf2[i]=a[i]+48;\n\t\t\tzf2[0]=n;\n\t\t}\n\t}\n}\nbool hwspd2()\n{\n\tint n=int(zf2[0]);\n\n\tfor(int i=1;i<=n/2;i++)\n\t{\n\t\tif(zf2[i]!=zf2[n-i+1]) return false;\n\t}\n\treturn true;\n}\n\nint main()\n{\n\tint B;\n\tcin>>B;\n\tfor(int i=1;i<=300;i++)\n\t{\n\t\tzh1(i,B);\n\t\tzh2(i,B);\n\t\t\tif(hwspd2())\n\t\t\t{\n\t\t\t\tint n=int(zf1[0]);\n\t\t\t\tfor(int i=1;i<=n;i++)\n\t\t\t\t{\n\t\t\t\t\tcout<<zf1[n-i+1];\n\t\t\t\t}\n\t\t\t\tcout<<' ';\n\t\t\t\t\tfor(int i=1;i<=int(zf2[0]);i++)\n\t\t\t\t{\n\t\t\t\t\tcout<<zf2[i];\n\t\t\t\t}\n\t\t\t\tcout<<endl;\n\t\t\t}\n\t}\n\t\n\treturn 0;\n}",PARTIAL_ACCEPTED,32,416
1277448795502084096,7ff8ca0f38dc5a725990bdfab0b3a9744dfb07847205203cc37de344d053f5af,2020-06-29 11:48:21,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<math.h>\nusing namespace std;\nint main(){\n    int n=0,b=0,c[20]={0},flag=0;\n    cin >> b;\n    for(int i=1;i<=300;i++){\n        int a=i*i;\n        while(a/b!=0){\n            c[n]=a%b;\n            a=a/b;\n            n+=1;\n        }\n        c[n]=a;\n        for(int j=0;j<=(n/2);j++){\n            if(c[j]!=c[n-j]){\n                flag=1;\n                break;\n            }\n        }\n        if(!flag){\n            cout << i << ' ';\n            for(int k=0;k<=n;k++)   cout << c[k];\n            cout << endl;\n        }\n        n=0;    flag=0;\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,40,416
1277449007603834880,f1ab11f416335963f4a2cdc8978e6fae8b6fc771cee7f44349d5ee6ab070f196,2020-06-29 11:49:11,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstdio>\n#include<cstring>\n#include<algorithm>\nusing namespace std;\n\nint k[100],kk[100];\nint change(int n,int s);\nint change2(int n, int s); \n\nint main()\n{\n\tchar ch;\n\tbool pan=true;\n\tint n,s;\n\tint ans,anss;\n\tcin>>n;\n\tfor(int i=1;i<=300;++i)\n\t{\n\t\ts=i*i;\n\t\tans=change(n,s);\n\t\tanss=ans/2;\n\t\tfor(int j=1;j<=anss;++j)\n\t\t{\n\t\t\tif(k[j]!=k[ans-j+1])\n\t\t\t{\n\t\t\t\tpan=false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(pan)\n\t\t{\t\n\t\t\tfor(int j=change2(n,i);j>=1;--j)\n\t\t\t{\n\t\t\t\tif(kk[j]<10) cout<<kk[j];\n\t\t\t\telse{\n\t\t\t\t\tch=(kk[j]-10+'A');\n\t\t\t\t\tcout<<ch;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout<<' ';\n\t\t\tfor(int j=1;j<=ans;++j)\n\t\t\t{\n\t\t\t\tif(k[j]<10) cout<<k[j];\n\t\t\t\telse{\n\t\t\t\t\tch=(k[j]-10+'A');\n\t\t\t\t\tcout<<ch;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout<<endl;\n\t\t\t\n\t\t}\n\t\tpan=true;\n\t}\n\treturn 0;\n} \n\nint change(int n,int s)\n{\n\tint ji=0;\n\tint a,b;\n\t\n\t\twhile(s)\n\t\t{\n\t\t\ta=s%n;\n\t\t\tk[++ji]=a;\n\t\t\ts/=n;\n\t\t}\n\treturn ji;\n}\nint change2(int n,int s)\n{\n\tint ji=0;\n\tint a,b;\n\t\n\t\twhile(s)\n\t\t{\n\t\t\ta=s%n;\n\t\t\tkk[++ji]=a;\n\t\t\ts/=n;\n\t\t}\n\treturn ji;\n}",ACCEPTED,34,488
1277449009663238144,cfaeef6ff06d46402265a0040c491ed07540aa378a12b52f59664185f3f75c50,2020-06-29 11:49:12,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nchar zf1[100],zf2[100];\n\nvoid zh1(int i,int B)\n{\n\tint a[100],n=0;\n\twhile(i!=0)\n\t{\n\t\tn++;\n\t\ta[n]=i%B;\n\t\ti/=B;\n\t}\n\tif(B>10)\n\t{\n\t\tfor(int i=1;i<=n;i++)\n\t\t{\n\t\t\tif(a[i]>=10)\n\t\t\t{\n\t\t\t\tzf1[i]=a[i]+55;\n\t\t\t\tzf1[0]=n;\n\t\t\t}else{\n\t\t\t\tzf1[i]=a[i]+48;\n\t\t\t\tzf1[0]=n;\n\t\t\t}\n\t\t\t\n\t\t}\n\t}else{\n\t\tfor(int i=1;i<=n;i++)\n\t\t{\n\t\t\tzf1[i]=a[i]+48;\n\t\t\tzf1[0]=n;\n\t\t}\n\t}\n\n}\n\nvoid zh2(int j,int B)\n{\n\tint a[100],n=0,i=j*j;\n\twhile(i!=0)\n\t{\n\t\tn++;\n\t\ta[n]=i%B;\n\t\ti/=B;\n\t}\n\tif(B>10)\n\t{\n\t\tfor(int i=1;i<=n;i++)\n\t\t{\n\t\t\tif(a[i]>=10)\n\t\t\t{\n\t\t\t\tzf2[i]=a[i]+55;\n\t\t\t\tzf2[0]=n;\n\t\t\t}else{\n\t\t\t\tzf2[i]=a[i]+48;\n\t\t\t\tzf2[0]=n;\n\t\t\t}\n\t\t\t\n\t\t}\n\t}else{\n\t\tfor(int i=1;i<=n;i++)\n\t\t{\n\t\t\tzf2[i]=a[i]+48;\n\t\t\tzf2[0]=n;\n\t\t}\n\t}\n}\nbool hwspd2()\n{\n\tint n=int(zf2[0]);\n\n\tfor(int i=1;i<=n/2;i++)\n\t{\n\t\tif(zf2[i]!=zf2[n-i+1]) return false;\n\t}\n\treturn true;\n}\n\nint main()\n{\n\tint B;\n\tcin>>B;\n\tfor(int i=1;i<=300;i++)\n\t{\n\t\tzh1(i,B);\n\t\tzh2(i,B);\n\t\t\tif(hwspd2())\n\t\t\t{\n\t\t\t\tint n=int(zf1[0]);\n\t\t\t\tfor(int i=1;i<=n;i++)\n\t\t\t\t{\n\t\t\t\t\tcout<<zf1[n-i+1];\n\t\t\t\t}\n\t\t\t\tcout<<' ';\n\t\t\t\t\tfor(int i=1;i<=int(zf2[0]);i++)\n\t\t\t\t{\n\t\t\t\t\tcout<<zf2[i];\n\t\t\t\t}\n\t\t\t\tcout<<endl;\n\t\t\t}\n\t}\n\t\n\treturn 0;\n}",ACCEPTED,26,404
1277449078932176896,2506d5801ac56b957e1c7a7608991bb956321549d59508d48faca2aea9c9d42a,2020-06-29 11:49:28,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n\nusing namespace std;\nint main()\n{\n    int n;\n    cin >> n;\n    for (int k = 1; k <= 300;k++)\n    {\n        int i = k;\n        int temp = 0;\n        int temp2 = 0;\n        int test[500];\n        int test2[500];\n        int square = i * i;\n\n        while (i!=0)\n        {\n            temp2++;\n            test2[temp2] = i % n;\n            i = i / n;\n        }\n\n\n        while (square!=0)\n        {\n            temp++;\n            test[temp] = square % n;\n            square = square / n;\n        }\n\n        bool pdf = true;\n\n        for (int j = 1; j <= temp;j++)\n        {\n            if (test[j]!=test[temp-j+1])\n                pdf = false;\n        }\n\n        if (pdf!=false)\n        {\n            for (int j = temp2; j >=1;j--)\n            {\n                if (test2[j]>=10)\n                {\n                    char ch = test2[j] + 55;\n                    cout << ch;\n                }\n\n                cout << test2[j];\n            }\n\n            cout << \"" \"";\n\n            for (int j = 1; j <= temp;j++)\n            {\n                if (test[j]>=10)\n                {\n                    char ch = test[j] + 55;\n                    cout << ch;\n                }\n\n                cout << test[j];\n            }\n\n            cout << endl;\n        }\n    }\n\n    return 0;\n\n\n\n}",PARTIAL_ACCEPTED,28,508
1277449964106473472,a8ef95b4f701efcd5f5a1080f94b5083f23be39953bef38b78f938fddbcc37ae,2020-06-29 11:52:59,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nint Hw(int n , int num)\n{\n    int i = 0;\n    int j = 0;\n    int k = 0;\n    int m = num * num;\n    int a[100];\n    int b[100];\n    while(num != 0){\n        a[i++] = num % n;\n        num = num / n;\n    }\n    while(m != 0){\n        b[j++] = m % n;\n        m = m / n;\n    }\n    for(k = 0 ; k < j / 2 ; k++){\n        if(b[k] != b[j - k - 1]){\n            return 0;\n        }\n    }\n    for(k = i - 1 ; k > 0 ; k-- ){\n        cout << a[k];\n    }\n    cout << a[k] << \"" \"";\n    for(k = 0 ; k < j - 1 ; k++){\n        cout << b[k];\n    }\n    cout << b[k] << endl;\n}\nint main(){\n    int hex = 0;\n    cin >> hex;\n    for(int i = 1 ; i <= 300 ; i++){\n        Hw(hex, i);\n    }\n}",PARTIAL_ACCEPTED,36,512
1277450136416870400,a8ef95b4f701efcd5f5a1080f94b5083f23be39953bef38b78f938fddbcc37ae,2020-06-29 11:53:41,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nint Hw(int n , int num)\n{\n    int i = 0;\n    int j = 0;\n    int k = 0;\n    int m = num * num;\n    int a[100];\n    int b[100];\n    while(num != 0){\n        a[i++] = num % n;\n        num = num / n;\n    }\n    while(m != 0){\n        b[j++] = m % n;\n        m = m / n;\n    }\n    for(k = 0 ; k < j / 2 ; k++){\n        if(b[k] != b[j - k - 1]){\n            return 0;\n        }\n    }\n    for(k = i - 1 ; k > 0 ; k-- ){\n        cout << a[k];\n    }\n    cout << a[k] << \"" \"";\n    for(k = 0 ; k < j - 1 ; k++){\n        cout << b[k];\n    }\n    cout << b[k] << endl;\n}\nint main(){\n    int hex = 0;\n    cin >> hex;\n    for(int i = 1 ; i <= 300 ; i++){\n        Hw(hex, i);\n    }\n}",PARTIAL_ACCEPTED,40,512
1277450331150016512,0af2a4a25cf4a9baea7b5888e155644c3309a6e15c42f172ac5ea10ad179e1c2,2020-06-29 11:54:27,Python,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"def jinzhi(n,x):\n    a=[0,1,2,3,4,5,6,7,8,9,'A','B','C','D','E','F','G','H','I','J']\n    b=[]\n    while True:\n        shang=n//x\n        yushu=n%x\n        b.append(yushu)\n        if shang==0:\n            break\n        n=shang;\n    b.reverse()\n    string=\""\""\n    for i in b:\n        string+=str(a[i])\n    return string\ninputjinzhi=int(input())\nfor i in range (1,301):\n    c=jinzhi(i**2,inputjinzhi)\n    d=c[::-1]\n    if c==d:\n        print(str(i)+\"" \""+d)",PARTIAL_ACCEPTED,206,3072
1277450984681299968,2506d5801ac56b957e1c7a7608991bb956321549d59508d48faca2aea9c9d42a,2020-06-29 11:57:03,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n\nusing namespace std;\nint main()\n{\n    int n;\n    cin >> n;\n    for (int k = 1; k <= 300;k++)\n    {\n        int i = k;\n        int temp = 0;\n        int temp2 = 0;\n        int test[500];\n        int test2[500];\n        int square = i * i;\n\n        while (i!=0)\n        {\n            temp2++;\n            test2[temp2] = i % n;\n            i = i / n;\n        }\n\n\n        while (square!=0)\n        {\n            temp++;\n            test[temp] = square % n;\n            square = square / n;\n        }\n\n        bool pdf = true;\n\n        for (int j = 1; j <= temp;j++)\n        {\n            if (test[j]!=test[temp-j+1])\n                pdf = false;\n        }\n\n        if (pdf)\n        {\n            for (int j = temp2; j >=1;j--)\n            {\n                if (test2[j]>=10)\n                {\n                    char ch = test2[j] + 55;\n                    cout << ch;\n                }\n                else\n                {\n                    cout << test2[j];\n                }\n                \n                \n            }\n\n            cout << \"" \"";\n\n            for (int j = 1; j <= temp;j++)\n            {\n                if (test[j]>=10)\n                {\n                    char ch = test[j] + 55;\n                    cout << ch;\n                }\n                else\n                {\n                    cout << test[j];}\n            }\n                    cout << endl;\n            \n        }\n    }\n\n    return 0;\n\n\n\n}\n",ACCEPTED,44,500
1277451054109622272,80edf40264d1044c177faa5868e001a10be03e9e2d7a3aec7d353c2437563df5,2020-06-29 11:57:19,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <vector>\nusing namespace std;\nvector<char> change(int n,int jin)\n{\n    int rest;\n    char s;\n    vector<char> power;\n    while(n>=jin)\n    {\n        rest =n%jin;\n        n = n/jin;\n        if (rest >=10)\n            s = rest+55;\n        else if(rest<10)\n            s = rest+48;\n        power.push_back(s);\n    }\n    if (n >=10)\n        s = n+55;\n    else if(n<10)\n        s = n+48;\n    power.push_back(s);\n    return power;\n}\nint main()\n{\n    int n;\n    vector<char> powerr;\n    bool find =0;\n    cin>>n;\n    int n2;\n    for (int i =1;i<=300;i++)\n    {\n        n2 = i*i;\n        powerr = change(n2,n);\n        if (powerr.size()!=1)\n        {\n            for (unsigned int j = 0;j<(powerr.size()/2);j++)\n            {\n                if(powerr[j] == powerr[powerr.size()-j-1])\n                    find = 1;\n                else\n                {\n                    find = 0;\n                    break;\n                }\n            }\n            if (find == 1)\n            {\n                cout<<i<<\"" \""<<n2<<endl;\n                /*for (auto f:powerr)\n                    cout<<f;*/\n            }\n        }\n        else\n        {\n            cout<<i<<\"" \""<<n2<<endl;\n        }\n\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,28,524
1277451054579384320,ab3ac7d3615ec928fcbb93f4072aaa583f19767afc2dc1d5e045648b0b245af1,2020-06-29 11:57:19,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nvoid judge(int x);\nint main()\n{\n    int B;\n    cin>>B;\n    for(int i=1;i<=300;i++)\n    {\n        judge(i);\n    }\n    return 0;\n}\nvoid judge(int x)\n{\n    int a[20];\n    int xx=x^2;\n    int i=0;\n    while(xx!=0)\n    {\n        a[++i]=xx%B;\n        xx=xx/B;\n    }\n    for(int k=1;k<=i/2;k++)\n    {\n        if(a[k]!=a[i+1-k])\n            return 0;\n    }\n    cout<<x<<\"" \"";\n    for(int j=0;j<20;j++)\n        cout<<a[j];\n    cout<<endl;\n}\n",COMPILE_ERROR,0,0
1277451199375138816,ab3ac7d3615ec928fcbb93f4072aaa583f19767afc2dc1d5e045648b0b245af1,2020-06-29 11:57:54,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint B;\nvoid judge(int x);\nint main()\n{\n    cin>>B;\n    for(int i=1;i<=300;i++)\n    {\n        judge(i);\n    }\n    return 0;\n}\nvoid judge(int x)\n{\n    int a[20];\n    int xx=x^2;\n    int i=0;\n    while(xx!=0)\n    {\n        a[++i]=xx%B;\n        xx=xx/B;\n    }\n    for(int k=1;k<=i/2;k++)\n    {\n        if(a[k]!=a[i+1-k])\n            return 0;\n    }\n    cout<<x<<\"" \"";\n    for(int j=0;j<20;j++)\n        cout<<a[j];\n    cout<<endl;\n}\n",COMPILE_ERROR,0,0
1277452273804828672,ab3ac7d3615ec928fcbb93f4072aaa583f19767afc2dc1d5e045648b0b245af1,2020-06-29 12:02:10,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint B;\nvoid judge(int x);\nint main()\n{\n    cin>>B;\n    for(int i=1;i<=300;i++)\n    {\n        judge(i);\n    }\n    return 0;\n}\nvoid judge(int x)\n{\n    int a[20];\n    int xx=x^2;\n    int i=0;\n    while(xx!=0)\n    {\n        a[++i]=xx%B;\n        xx=xx/B;\n    }\n    for(int k=1;k<=i/2;k++)\n    {\n        if(a[k]!=a[i+1-k])\n            return;\n    }\n    cout<<x<<\"" \"";\n    for(int j=0;j<20;j++)\n        cout<<a[j];\n    cout<<endl;\n}\n",WRONG_ANSWER,39,384
1277452281945980928,f58df442ca29dc2c3fb9bb818f338eeac62afaf552e1b2429f370277d7d6bb33,2020-06-29 12:02:12,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\nstring Transformer(int n,int radix);\nint main()\n{\n    int B;\n    cin>>B;\n    string res,rres;\n    for(int i=1;i<=300;i++)\n    {\n        res=Transformer(B,i*i);\n        rres=reverse(res.begin(),res.end());\n        if(res==rres)\n        {\n            cout<<Transformer(B,i)<<\"" \""<<res<<endl;\n        }\n    }\n    return 0;\n}\n\nstring Transformer(int n,int radix)\n{\n    string ans=\""\"";\n\tdo{\n\t\tint t=n%radix;\n\t\tif(t>=0&&t<=9)\tans+=t+'0';\n\t\telse ans+=t-10+'a';\n\t\tn/=radix;\n\t}while(n!=0);\t\n\treverse(ans.begin(),ans.end());\n\treturn ans;\t\n\n}",COMPILE_ERROR,0,0
1277452502872547328,0af2a4a25cf4a9baea7b5888e155644c3309a6e15c42f172ac5ea10ad179e1c2,2020-06-29 12:03:05,Python,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"def jinzhi(n,x):\n    a=[0,1,2,3,4,5,6,7,8,9,'A','B','C','D','E','F','G','H','I','J']\n    b=[]\n    while True:\n        shang=n//x\n        yushu=n%x\n        b.append(yushu)\n        if shang==0:\n            break\n        n=shang;\n    b.reverse()\n    string=\""\""\n    for i in b:\n        string+=str(a[i])\n    return string\ninputjinzhi=int(input())\nfor i in range (1,301):\n    c=jinzhi(i**2,inputjinzhi)\n    e=jinzhi(i,inputjinzhi)\n    d=c[::-1]\n    if c==d:\n        print(e+\"" \""+d)",ACCEPTED,192,3112
1277452530294906880,f58df442ca29dc2c3fb9bb818f338eeac62afaf552e1b2429f370277d7d6bb33,2020-06-29 12:03:11,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\nusing namespace std;\nstring Transformer(int n,int radix);\nint main()\n{\n    int B;\n    cin>>B;\n    string res,rres;\n    for(int i=1;i<=300;i++)\n    {\n        res=Transformer(B,i*i);\n        rres=reverse(res.begin(),res.end());\n        if(res==rres)\n        {\n            cout<<Transformer(B,i)<<\"" \""<<res<<endl;\n        }\n    }\n    return 0;\n}\n\nstring Transformer(int n,int radix)\n{\n    string ans=\""\"";\n\tdo{\n\t\tint t=n%radix;\n\t\tif(t>=0&&t<=9)\tans+=t+'0';\n\t\telse ans+=t-10+'a';\n\t\tn/=radix;\n\t}while(n!=0);\t\n\treverse(ans.begin(),ans.end());\n\treturn ans;\t\n\n}",COMPILE_ERROR,0,0
1277452586351788032,8deffd1a550298bf3da4d16ad8bc34e4d5aeb10a1c2a49486eaf87f400ced3bd,2020-06-29 12:03:25,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <stack>\n#include<string.h>\n#include<algorithm>\nusing namespace std;\n \nchar jinzhi[100],len;\nint zhuanhuan(int a,int b)    \n{\n    int c,m;\n    int i=0;\n    stack<char>s;\n    while(a)\n    {\n        c=a/b;\n        m=a%b;\n        if(m>=10)\n            s.push('A'+m-10);\n        else\n            s.push('0'+m);\n        a=c;\n    }\n    while(!s.empty())\n    {\n        jinzhi[i]=s.top();\n        i++;\n        s.pop();\n    }\n    len=i;\n    return 0;\n}\n \n \nbool pan(char a[])\n{\n    int i;\n    for(i=0;i<len/2+1;i++)\n        if(a[i]!=a[len-i-1])\n            return 0;\n    return 1;\n}\n \nint main()\n{\n    int n,ch;\n    char t[100];\n    cin>>n;\n    for(int i=1;i<=300;i++)\n    {\n        zhuanhuan(i*i,n);\n        if(pan(jinzhi))\n        {\n            for(int j=0;j<len;j++)\n                t[j]=jinzhi[j];\n            ch=len;\n            zhuanhuan(i,n);\n            for(int j=0;j<len;j++)\n            cout<<jinzhi[j];\n            cout<<\"" \"";\n            for(int j=0;j<ch;j++)\n            cout<<t[j];\n            cout<<endl;\n        }\n    }\n    return 0;\n}",ACCEPTED,41,592
1277452692559953920,f58df442ca29dc2c3fb9bb818f338eeac62afaf552e1b2429f370277d7d6bb33,2020-06-29 12:03:50,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\nusing namespace std;\nstring Transformer(int n,int radix);\nint main()\n{\n    int B;\n    cin>>B;\n    string res,rres;\n    for(int i=1;i<=300;i++)\n    {\n        res=Transformer(B,i*i);\n        rres=res;\n        reverse(res.begin(),res.end());\n        if(res==rres)\n        {\n            cout<<Transformer(B,i)<<\"" \""<<rres<<endl;\n        }\n    }\n    return 0;\n}\n\nstring Transformer(int n,int radix)\n{\n    string ans=\""\"";\n\tdo{\n\t\tint t=n%radix;\n\t\tif(t>=0&&t<=9)\tans+=t+'0';\n\t\telse ans+=t-10+'a';\n\t\tn/=radix;\n\t}while(n!=0);\t\n\treverse(ans.begin(),ans.end());\n\treturn ans;\t\n\n}",TIME_LIMIT_EXCEEDED,0,0
1277452906398154752,f58df442ca29dc2c3fb9bb818f338eeac62afaf552e1b2429f370277d7d6bb33,2020-06-29 12:04:41,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\nusing namespace std;\nstring Transformer(int n,int radix);\nint main()\n{\n    int B;\n    cin>>B;\n    string res,rres;\n    for(int i=1;i<=300;i++)\n    {\n        res=Transformer(B,i*i);\n        rres=res;\n        reverse(res.begin(),res.end());\n        if(res==rres)\n        {\n            cout<<Transformer(B,i)<<\"" \""<<rres<<endl;\n        }\n    }\n    return 0;\n}\n\nstring Transformer(int n,int radix)\n{\n    string ans=\""\"";\n\tdo{\n\t\tint t=n%radix;\n\t\tif(t>=0&&t<=9)\tans+=t+'0';\n\t\telse ans+=t-10+'a';\n\t\tn/=radix;\n\t}while(n!=0);\t\n\treverse(ans.begin(),ans.end());\n\treturn ans;\t\n\n}",TIME_LIMIT_EXCEEDED,0,0
1277453111398948864,8deffd1a550298bf3da4d16ad8bc34e4d5aeb10a1c2a49486eaf87f400ced3bd,2020-06-29 12:05:30,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <stack>\n#include<string.h>\n#include<algorithm>\nusing namespace std;\n \nchar jinzhi[100],len;\nint zhuanhuan(int x,int y)    \n{\n    int c,m;\n    int i=0;\n    stack<char>str;\n    while(x)\n    {\n        c=x/y;\n        m=x%y;\n        if(m>=10)\n            str.push('A'+m-10);\n        else\n            str.push('0'+m);\n        x=c;\n    }\n    while(!str.empty())\n    {\n        jinzhi[i]=str.top();\n        i++;\n        str.pop();\n    }\n    len=i;\n    return 0;\n}\n \n \nbool pan(char r[])\n{\n    int i;\n    for(i=0;i<len/2+1;i++)\n        if(r[i]!=r[len-i-1])\n            return 0;\n    return 1;\n}\n \nint main()\n{\n    int n,ch;\n    char t[5000];\n    cin>>n;\n    for(int i=1;i<=300;i++)\n    {\n        zhuanhuan(i*i,n);\n        if(pan(jinzhi))\n        {\n            for(int j=0;j<len;j++)\n                t[j]=jinzhi[j];\n            ch=len;\n            zhuanhuan(i,n);\n            for(int j=0;j<len;j++)\n            cout<<jinzhi[j];\n            cout<<\"" \"";\n            for(int j=0;j<ch;j++)\n            cout<<t[j];\n            cout<<endl;\n        }\n    }\n    return 0;\n}",ACCEPTED,41,512
1277453966781112320,f1ab11f416335963f4a2cdc8978e6fae8b6fc771cee7f44349d5ee6ab070f196,2020-06-29 12:08:54,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstdio>\n#include<cstring>\nusing namespace std;\n\nint a[100];\nint change(int n,int s);\nint main()\n{\n\tbool pan=true;\n\tint s,n,ans,anss;\n\tint sums=0,ji=0;\n\tcin>>n>>s;\n\tfor(int i=s+1;;++i)\t\t\t\t//数据范围 \n\t{\n\t\tif(sums==n) return 0;\n\t\tji=0;\n\t\tfor(int k=2;k<=10;++k)\t\t//进制遍历 \n\t\t{\n\t\t\t\n\t\t\tans=change(k,i);\n\t\t\tanss=ans/2;\n\t\t\tfor(int j=1;j<=anss;++j)\t\t\t\t//判断回文 \n\t\t\t{\n\t\t\t\tif(a[j]!=a[ans-j+1])\n\t\t\t\t{\n\t\t\t\t\tpan=false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(pan) ji++;\n\t\t\tif(ji==2)\n\t\t\t{\n\t\t\t\tsums++;\n\t\t\t\tcout<<i<<endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tpan=true; \n\t\t\t\n\t\t}\n\t\tji=0;\n\t}\n}\n\nint change(int n,int s)\n{\n\tint ji=0;\n\tint b;\n\t\n\t\twhile(s)\n\t\t{\n\t\t\tb=s%n;\n\t\t\ta[++ji]=b;\n\t\t\ts/=n;\n\t\t}\n\treturn ji;\n}\n",ACCEPTED,39,492
1277454375390208000,cfaeef6ff06d46402265a0040c491ed07540aa378a12b52f59664185f3f75c50,2020-06-29 12:10:31,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nchar zf[100];\n\nvoid zh(int i,int B)\n{\n\tint a[100],n=0;\n\twhile(i!=0)\n\t{\n\t\tn++;\n\t\ta[n]=i%B;\n\t\ti/=B;\n\t}\n\tif(B>10)\n\t{\n\t\tfor(int i=1;i<=n;i++)\n\t\t{\n\t\t\tif(a[i]>=10)\n\t\t\t{\n\t\t\t\tzf[i]=a[i]+55;\n\t\t\t\tzf[0]=n;\n\t\t\t}else{\n\t\t\t\tzf[i]=a[i]+48;\n\t\t\t\tzf[0]=n;\n\t\t\t}\n\t\t\t\n\t\t}\n\t}else{\n\t\tfor(int i=1;i<=n;i++)\n\t\t{\n\t\t\tzf[i]=a[i]+48;\n\t\t\tzf[0]=n;\n\t\t}\n\t}\n\n}\n\nbool hwspd()\n{\n\tint n=int(zf[0]);\n\n\tfor(int i=1;i<=n/2;i++)\n\t{\n\t\tif(zf[i]!=zf[n-i+1]) return false;\n\t}\n\treturn true;\n}\n\nint main()\n{\n\tint n,s;\n\tcin>>n>>s;\n\twhile(n>0)\n\t{\n\t\ts++;\n\t\tint sum=0;\n\t\t\n\t\tfor(int i=2;i<=10;i++)\n\t\t{\n\t\t\tzh(s,i);\n\t\t\tif(hwspd) sum++;\n\t\t}\n\t\tif(sum>=2) \n\t\t{\n\t\t\tn--;\n\t\t\tcout<<s<<endl;\n\t\t}\n\t\t\n\t\t\n\t\t\n\t}\n\t\n\treturn 0;\n}",PARTIAL_ACCEPTED,26,424
1277454750226776064,cfaeef6ff06d46402265a0040c491ed07540aa378a12b52f59664185f3f75c50,2020-06-29 12:12:01,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nchar zf[100];\n\nvoid zh(int i,int B)\n{\n\tint a[100],n=0;\n\twhile(i!=0)\n\t{\n\t\tn++;\n\t\ta[n]=i%B;\n\t\ti/=B;\n\t}\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tzf[i]=a[i]+48;\n\t\tzf[0]=n;\n\t}\n\n}\n\nbool hwspd()\n{\n\tint n=int(zf[0]);\n\n\tfor(int i=1;i<=n/2;i++)\n\t{\n\t\tif(zf[i]!=zf[n-i+1]) return false;\n\t}\n\treturn true;\n}\n\nint main()\n{\n\tint n,s;\n\tcin>>n>>s;\n\twhile(n>0)\n\t{\n\t\ts++;\n\t\tint sum=0;\n\t\t\n\t\tfor(int i=2;i<=10;i++)\n\t\t{\n\t\t\tzh(s,i);\n\t\t\tif(hwspd) sum++;\n\t\t}\n\t\tif(sum>=2) \n\t\t{\n\t\t\tn--;\n\t\t\tcout<<s<<endl;\n\t\t}\n\t\t\n\t\t\n\t\t\n\t}\n\t\n\treturn 0;\n}",PARTIAL_ACCEPTED,36,512
1277454814663860224,cfaeef6ff06d46402265a0040c491ed07540aa378a12b52f59664185f3f75c50,2020-06-29 12:12:16,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nchar zf[100];\n\nvoid zh(int i,int B)\n{\n\tint a[100],n=0;\n\twhile(i!=0)\n\t{\n\t\tn++;\n\t\ta[n]=i%B;\n\t\ti/=B;\n\t}\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tzf[i]=a[i]+48;\n\t\tzf[0]=n;\n\t}\n\n}\n\nbool hwspd()\n{\n\tint n=int(zf[0]);\n\n\tfor(int i=1;i<=n/2;i++)\n\t{\n\t\tif(zf[i]!=zf[n-i+1]) return false;\n\t}\n\treturn true;\n}\n\nint main()\n{\n\tint n,s;\n\tcin>>n>>s;\n\twhile(n>0)\n\t{\n\t\ts++;\n\t\tint sum=0;\n\t\t\n\t\tfor(int i=2;i<=10;i++)\n\t\t{\n\t\t\tzh(s,i);\n\t\t\tif(hwspd()) sum++;\n\t\t}\n\t\tif(sum>=2) \n\t\t{\n\t\t\tn--;\n\t\t\tcout<<s<<endl;\n\t\t}\n\t\t\n\t\t\n\t\t\n\t}\n\t\n\treturn 0;\n}",ACCEPTED,30,424
1277455787675287552,7ff8ca0f38dc5a725990bdfab0b3a9744dfb07847205203cc37de344d053f5af,2020-06-29 12:16:08,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<math.h>\nusing namespace std;\nint main(){\n    int n=0,b=0,flag=0,n2={0};\n    char c[20]={0},d[20]={0};\n    cin >> b;\n    for(int i=1;i<=300;i++){\n        int e=i;\n        while(e/b!=0){\n            if(e%b>=10) d[n2]=char(e%b-10+'A');\n            else    d[n2]=char(e%b+'0');\n            e=e/b;\n            n2+=1;\n        }\n        if(e>=10) d[n2]=char(e-10+'A');\n        else    d[n2]=char(e+'0');\n        int a=i*i;\n        while(a/b!=0){\n            if(a%b>=10) c[n]=char(a%b-10+'A');\n            else    c[n]=char(a%b+'0');\n            a=a/b;\n            n+=1;\n        }\n        if(a>=10) c[n]=char(a-10+'A');\n        else    c[n]=char(a+'0');\n        for(int j=0;j<=(n/2);j++){\n            if(c[j]!=c[n-j]){\n                flag=1;\n                break;\n            }\n        }\n        if(!flag){\n            for(int k=0;k<=n;k++)   cout << d[k];\n            cout << ' ';\n            for(int k=0;k<=n;k++)   cout << c[k];\n            cout << endl;\n        }\n        n=0;    flag=0; n2=0;\n    }\n    return 0;\n}\n",WRONG_ANSWER,42,508
1277456390447104000,8deffd1a550298bf3da4d16ad8bc34e4d5aeb10a1c2a49486eaf87f400ced3bd,2020-06-29 12:18:32,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nint n,m;\nint k,p;\nvoid sh(int x,int y);\n\nint main()\n{\n\tcin>>n>>m;\n\tfor(int i=m+1;k<n;i++)\n    {\n\t\tp=0;\n\t\tsh(i,10);\n\t\tfor(int j=2;j<=9;j++)\n\t\t  sh(i,j);\n\t\tif(p>1)\n        {\n\t\t\tcout<<i<<endl;\n\t\t\tk++;\n\t\t}\n\t}\n\treturn 0;\n}\nvoid sh(int x,int y)\n{\n\tint sz[5000],m=0;\n\twhile(x)\n    {\n\t\tsz[++m]=x%y;\n\t\tx=x/y;\n\t}\n\tif(sz[1]==0||sz[m]==0) \n        return;\n\tfor(int j=1;j<=m;j++)\n\t  if(sz[j]!=sz[m-j+1]) \n          return;\n\tp++;\n\treturn;\n}",ACCEPTED,37,384
1277456703707078656,8deffd1a550298bf3da4d16ad8bc34e4d5aeb10a1c2a49486eaf87f400ced3bd,2020-06-29 12:19:46,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nint n,m;\nint k,p;\nvoid sh(int x,int y);\nint main()\n{\n\tcin>>n>>m;\n\tfor(int i=m+1;k<n;i++)\n    {\n\t\tp=0;\n\t\tsh(i,10);\n\t\tfor(int j=2;j<=9;j++)\n\t\t  sh(i,j);\n\t\tif(p>1)\n        {\n\t\t\tcout<<i<<endl;\n\t\t\tk++;\n\t\t}\n\t}\n\treturn 0;\n}\nint sh(int x,int y)\n{\n\tint sz[5000],m=0;\n\twhile(x)\n    {\n\t\tsz[++m]=x%y;\n\t\tx=x/y;\n\t}\n\tif(sz[1]==0||sz[m]==0) \n        return 0;\n\tfor(int j=1;j<=m;j++)\n\t  if(sz[j]!=sz[m-j+1]) \n          return 0;\n\tp++;\n\treturn 0;\n}",COMPILE_ERROR,0,0
1277456768987234304,8deffd1a550298bf3da4d16ad8bc34e4d5aeb10a1c2a49486eaf87f400ced3bd,2020-06-29 12:20:02,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nint n,m;\nint k,p;\nint sh(int x,int y);\nint main()\n{\n\tcin>>n>>m;\n\tfor(int i=m+1;k<n;i++)\n    {\n\t\tp=0;\n\t\tsh(i,10);\n\t\tfor(int j=2;j<=9;j++)\n\t\t  sh(i,j);\n\t\tif(p>1)\n        {\n\t\t\tcout<<i<<endl;\n\t\t\tk++;\n\t\t}\n\t}\n\treturn 0;\n}\nint sh(int x,int y)\n{\n\tint sz[5000],m=0;\n\twhile(x)\n    {\n\t\tsz[++m]=x%y;\n\t\tx=x/y;\n\t}\n\tif(sz[1]==0||sz[m]==0) \n        return 0;\n\tfor(int j=1;j<=m;j++)\n\t  if(sz[j]!=sz[m-j+1]) \n          return 0;\n\tp++;\n\treturn 0;\n}",ACCEPTED,33,424
1277465066964705280,80edf40264d1044c177faa5868e001a10be03e9e2d7a3aec7d353c2437563df5,2020-06-29 12:53:00,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <vector>\nusing namespace std;\nvector<char> change(int n,int jin)\n{\n    int rest;\n    char s;\n    vector<char> power;\n    while(n>=jin)\n    {\n        rest =n%jin;\n        n = n/jin;\n        if (rest >=10)\n            s = rest+55;\n        else\n            s = rest+48;\n        power.push_back(s);\n    }\n    if (n >=10)\n        s = n+55;\n    else\n        s = n+48;\n    power.push_back(s);\n    return power;\n}\nint main()\n{\n    int n;\n    vector<char> powerr;\n    bool find =0;\n    cin>>n;\n    int n2;\n    for (int i =1;i<=300;i++)\n    {\n        n2 = i*i;\n        powerr = change(n2,n);\n\n        for (unsigned int j = 0;j<(powerr.size());j++)\n        {\n            if(powerr[j] == powerr[powerr.size()-j-1])\n                find = 1;\n            else\n            {\n                find = 0;\n                break;\n            }\n        }\n        if (find == 1)\n        {\n            vector<char> fron = change(i,n);\n            for (auto f:fron)\n                cout<<f;\n            cout<<\"" \"";\n            for (auto f:powerr)\n                cout<<f;\n            cout<<endl;\n        }\n\n\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,39,512
1277466897698709504,80edf40264d1044c177faa5868e001a10be03e9e2d7a3aec7d353c2437563df5,2020-06-29 13:00:17,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <vector>\nusing namespace std;\nvector<char> change(int n,int jin)\n{\n    int rest;\n    char s;\n    vector<char> power;\n    while(n>=jin)\n    {\n        rest =n%jin;\n        n = n/jin;\n        if (rest >=10)\n            s = rest+55;\n        else\n            s = rest+48;\n        power.push_back(s);\n    }\n    if (n >=10)\n        s = n+55;\n    else\n        s = n+48;\n    power.push_back(s);\n    return power;\n}\nint main()\n{\n    int n;\n    vector<char> powerr;\n    bool find =0;\n    cin>>n;\n    int n2;\n    for (int i =1;i<=300;i++)\n    {\n        n2 = i*i;\n        powerr = change(n2,n);\n\n        for (unsigned int j = 0;j<(powerr.size());j++)\n        {\n            if(powerr[j] == powerr[powerr.size()-j-1])\n                find = 1;\n            else\n            {\n                find = 0;\n                break;\n            }\n        }\n        if (find == 1)\n        {\n            vector<char> fron = change(i,n);\n            for (auto it = fron.rbegin(); it != fron.rend(); it++)\n            cout<<*it;\n            cout<<\"" \"";\n            for (auto f:powerr)\n                cout<<f;\n            cout<<endl;\n        }\n\n\n    }\n    return 0;\n}",ACCEPTED,46,384
1277475678478336000,0af2a4a25cf4a9baea7b5888e155644c3309a6e15c42f172ac5ea10ad179e1c2,2020-06-29 13:35:10,Python,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"def jinzhi(n,x):\n    a=[0,1,2,3,4,5,6,7,8,9,'A','B','C','D','E','F','G','H','I','J']\n    b=[]\n    while True:\n        shang=n//x\n        yushu=n%x\n        b.append(yushu)\n        if shang==0:\n            break\n        n=shang;\n    b.reverse()\n    string=\""\""\n    for i in b:\n        string+=str(a[i])\n    if string==string[::-1]:\n        return 1\nstr1 = input()\nint_list = [int(x) for x in str1.split()]\nc,d = int_list[0],int_list[1]\nc=int(c)\nd=int(d)\ne=d+1\nfor i in range(1,1+c):\n    count=0\n    for j in range(2,11):\n        if count==2:\n            print(e)\n            break\n        f=jinzhi(e,j)\n        if f==1 :\n            count+=1\n    e+=1",PARTIAL_ACCEPTED,164,3112
1277482326844440576,0af2a4a25cf4a9baea7b5888e155644c3309a6e15c42f172ac5ea10ad179e1c2,2020-06-29 14:01:35,Python,40.0,1277062760129622024,1267449136707624960,1049226397448056832,"def jinzhi(n,x):\n    a=[0,1,2,3,4,5,6,7,8,9,'A','B','C','D','E','F','G','H','I','J']\n    b=[]\n    while True:\n        shang=n//x\n        yushu=n%x\n        b.append(yushu)\n        if shang==0:\n            break\n        n=shang;\n    b.reverse()\n    string=\""\""\n    for i in b:\n        string+=str(a[i])\n    if string==string[::-1]:\n        return 1\nstr1 = input()\nint_list = [int(x) for x in str1.split()]\nc,d = int_list[0],int_list[1]\nc=int(c)\nd=int(d)\ne=d+1\nwhile c>0:\n    count=0\n    for j in range(2,11):\n        if count==2:\n            print(e)\n            c-=1\n            break\n        f=jinzhi(e,j)\n        if f==1 :\n            count+=1\n    e+=1\n    \n",PARTIAL_ACCEPTED,291,3196
1277482363368431616,9ac91332c47764e4bd8559d889f0833cad8247d7d8e396ab13c72d0f5085c82a,2020-06-29 14:01:44,C,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<stdio.h>\nint IfRight(int x);//判断回文数 \nint IfReturn(int x,int System);\nint main()\n{\n\tint N,S;\n\tscanf(\""%d %d\"",&N,&S);\n\tint i,x=S+1;//指针\n\tfor(i=1;i<=N;i++)\n\t{\n\t\twhile(1)\n\t\t{\n\t\t\tif(IfRight(x))\n\t\t\t{\n\t\t\t\tprintf(\""%d\\n\"",x);\n\t\t\t\tx++;\n\t\t\t\tbreak;\n\t\t\t }\n\t\t\tx++;\n\t\t}\n\t } \n } \n \nint IfRight(int x)\n{\n\tint System=2;//进制 \n\tint Time=0;//是回文数的次数 \n\t\n\t\n\twhile(System<=10)\n\t{\n\t\tif(IfReturn(x,System))\n\t\t{\n\t\t\tTime++;\n\t\t}\n\t\t\n\t\tSystem++; \n\t}\n\t\n\t\n\tif(Time>=2)//对次数进行判断 \n\t{\n\t\treturn 1;\n\t}\n\tif(Time<2)\n\t{\n\t\treturn 0;\n\t}\n\t\n}\nint IfReturn(int x,int System)\n{\n\tint a[100];\n\tint i=1;\n\twhile(x!=0)\n\t{\n\t\ta[i]=x%System;\n\t\tx=x/System;\n\t\ti++;\n\t}\n\ti--;\n\tint m; \n\tif(i%2==0)\n\t{\n\t\tfor(m=1;m<=i/2;m++)\n\t\t{\n\t\t\tif(a[m]!=a[i+1-m])\n\t\t\t{\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t}\n\t\treturn 1;\n\t}\n\tif(i%2==1)\n\t{\n\t\tfor(m=1;m<=i/2;m++)\n\t\t{\n\t\t\tif(a[m]!=a[i+1-m])\n\t\t\t{\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t}\n\t\treturn 1;\n\t}\n\t\n}",ACCEPTED,21,384
1277483356353134592,7ff8ca0f38dc5a725990bdfab0b3a9744dfb07847205203cc37de344d053f5af,2020-06-29 14:05:41,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<math.h>\nusing namespace std;\nint main(){\n    int n=0,b=0,flag=0,n2=0;\n    char c[20]={0},d[20]={0};\n    cin >> b;\n    for(int i=1;i<=300;i++){\n        int e=i;\n        while(e/b!=0){\n            if(e%b>=10) d[n2]=char(e%b-10+'A');\n            else    d[n2]=char(e%b+'0');\n            e=e/b;\n            n2+=1;\n        }\n        if(e>=10) d[n2]=char(e-10+'A');\n        else    d[n2]=char(e+'0');\n        int a=i*i;\n        while(a/b!=0){\n            if(a%b>=10) c[n]=char(a%b-10+'A');\n            else    c[n]=char(a%b+'0');\n            a=a/b;\n            n+=1;\n        }\n        if(a>=10) c[n]=char(a-10+'A');\n        else    c[n]=char(a+'0');\n        for(int j=0;j<=(n/2);j++){\n            if(c[j]!=c[n-j]){\n                flag=1;\n                break;\n            }\n        }\n        if(!flag){\n            for(int k=n2;k>=0;k--)  cout << d[k];\n            cout << ' ';\n            for(int k=n;k>=0;k--)   cout << c[k];\n            cout << endl;\n        }\n        n=0; flag=0; n2=0;\n    }\n    return 0;\n}\n",ACCEPTED,41,540
1277484264776458240,9ac91332c47764e4bd8559d889f0833cad8247d7d8e396ab13c72d0f5085c82a,2020-06-29 14:09:17,C,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\nint IfSquare(int num,int system);\nint main()\n{\n\tint B;\n\tscanf(\""%d\"",&B);\n\tfor(int i=1;i<=300;i++)\n\t{\n\t\tif(IfSquare(i*i,B))\n\t\tprintf(\""%d %d\\n\"",i,i*i);\n\t}\n } \n \n \n \nint IfSquare(int num,int system)\n{\n \tint a[100];//记录每一位数字,因为字母可以用数字转换，所以使用int数组即可\n \tint i=1;//数字位数 \n\twhile(num!=0)\n\t{\n\t\ta[i]=num%system;\n\t\tnum=num/system;\n\t\ti++;//因为只是要表示回文数，所以不在意进制转换后数字在哪一位上 \n\t}\n\ti--;//确认最后一位 \n\t\n\t\n\tint x;\n\t//开始进行回文数判断 \n\tif(i%2==0)//偶数个数字位数\n\t{\n\t\tfor(x=1;x<=i/2;x++)\n\t\t{\n\t\t\tif(a[x]!=a[i+1-x])\n\t\t\treturn 0;\n\t\t}\n\t\treturn 1;\n\t } \n\t\n\tif(i%2!=0)//奇数位数\n\t{\n\t\tfor(x=1;x<=i/2;x++)\n\t\t{\n\t\t\tif(a[x]!=a[i+1-x])\n\t\t\treturn 0;\n\t\t}\n\t\treturn 1;\n\t }\t\n\t \n\t\n}",PARTIAL_ACCEPTED,31,384
1277485944809127936,0fdb7502f4f78afc1b24890522148b83f70dee6381549eb9369f3598876b5893,2020-06-29 14:15:58,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint main()\n{\n\tint stm;\n\tcin >> stm;\n\tint m = 0, n = 0;\n\tstring s;\n\tbool flag = true;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tint j = i * i;\n\t\tdo {\n\t\t\tchar c = (j % stm) + 48;\n\t\t\tj /= stm;\n\t\t\ts += c;\n\t\t\tn++;\n\t\t} while (j > 0);\n\t\tfor (int x = 0, y = n - 1; m<n/2; x++, y--,m++) {\n\t\t\tif (s[x] != s[y]) {\n\t\t\t\tflag = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tm = 0;\n\t\tif (flag)\n\t\t\tcout << i << \"" \"" << s << endl;\n\t\tn = 0;\n\t\tflag = true;\n\t\ts = \""\"";\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,20,512
1277486046298701824,9ac91332c47764e4bd8559d889f0833cad8247d7d8e396ab13c72d0f5085c82a,2020-06-29 14:16:22,C,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\nint IfSquare(int num,int system);\nint main()\n{\n\tint B;\n\tscanf(\""%d\"",&B);\n\tfor(int i=1;i<=300;i++)\n\t{\n\t\tif(IfSquare(i*i,B))\n\t\t{\n\t\t\tchange(i,B);\n\t\t\tprintf(\"" \"");\n\t\t\tchange(i*i,B);\n\t\t\tprintf(\""\\n\"");\n\t\t}\n\t}\n } \n \n \n \nint IfSquare(int num,int system)\n{\n \tint a[100];//记录每一位数字,因为字母可以用数字转换，所以使用int数组即可\n \tint i=1;//数字位数 \n\twhile(num!=0)\n\t{\n\t\ta[i]=num%system;\n\t\tnum=num/system;\n\t\ti++;//因为只是要表示回文数，所以不在意进制转换后数字在哪一位上 \n\t}\n\ti--;//确认最后一位 \n\t\n\t\n\tint x;\n\t//开始进行回文数判断 \n\tif(i%2==0)//偶数个数字位数\n\t{\n\t\tfor(x=1;x<=i/2;x++)\n\t\t{\n\t\t\tif(a[x]!=a[i+1-x])\n\t\t\treturn 0;\n\t\t}\n\t\treturn 1;\n\t } \n\t\n\tif(i%2!=0)//奇数位数\n\t{\n\t\tfor(x=1;x<=i/2;x++)\n\t\t{\n\t\t\tif(a[x]!=a[i+1-x])\n\t\t\treturn 0;\n\t\t}\n\t\treturn 1;\n\t }\t\n\t \n\t\n}\n\nvoid change( int n,int r )\n{\n     if( n )\n     {\n         change( n / r, r );\n         print( n % r );\n     }\n }\n \n void print( int x )\n{\n     if( x <= 9 )\n         printf( \""%d\"",x );\n     else\n         printf( \""%c\"",x - 10 + 'A' );\n }",ACCEPTED,34,384
1277486583853285376,c83213147a2d8d9a45ded58245e2135a1ca7678965b0bb31caebd18beefa1d2c,2020-06-29 14:18:30,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<string>\n\nusing namespace std;\nint R(int s)\n{\n\tint  t = 0;\n\twhile (s > 0) {\n\t\tt = 10 * t + s % 10;\n\t\ts = s / 10;\n\t}\n\treturn t;\n}\nint main()\n{\n\tint n;\n\tcin >> n;\n\tint count = 0;\n\tint a[300], sq[300], mark[300] = {0},sqr[300];\n\tfor (int i = 1;i <= 300;i++)\n\t{\n\t\ta[i - 1] = i;\n\t\tsq[i - 1] = i * i;\n\t\tsqr[i - 1] = R(sq[i - 1]);\n\t}\n\tfor (int i = 0;i <300;i++)\n\t{\n\t\tif (sq[i] == sqr[i])\n\t\t\tmark[i] = 1;\n\t}\n\tfor (int i = 0;i < 300;i++)\n\t{\n\t\tif (mark[i] == 1)\n\t\t{\n\t\t\tcout << a[i] << \"" \"" << sq[i] << endl;;\n\t\t}\n\t\t\n\t}\n\treturn 0;\n}\n",PARTIAL_ACCEPTED,41,548
1277488043299102720,0fdb7502f4f78afc1b24890522148b83f70dee6381549eb9369f3598876b5893,2020-06-29 14:24:18,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint main()\n{\n\tint stm;\n\tcin >> stm;\n\tint m = 0, n = 0;\n\tstring s1, s2;\n\tbool flag = true;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tint j = i * i;\n\t\tdo {\n\t\t\tchar c = (j % stm) + 48;\n\t\t\tj /= stm;\n\t\t\ts2 += c;\n\t\t\tn++;\n\t\t} while (j > 0);\n\t\tfor (int x = 0, y = n - 1; m < n / 2; x++, y--, m++) {\n\t\t\tif (s2[x] != s2[y]) {\n\t\t\t\tflag = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tm = 0;\n\t\tif (flag) {\n\t\t\tint k = i;\n\t\t\tdo {\n\t\t\t\tchar c = (k % stm) + 48;\n\t\t\t\tk /= stm;\n\t\t\t\ts1 += c;\n\t\t\t\tm++;\n\t\t\t} while (k > 0);\n\t\t\twhile (m-- != 0)\n\t\t\t\tcout << s1[m];\n\t\t\tcout << \"" \"" << s2 << endl;\n\t\t\ts1 = \""\"";\n\t\t}\n\t\tn = 0;\n\t\tflag = true;\n\t\ts2 = \""\"";\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,48,512
1277489240881946624,0af2a4a25cf4a9baea7b5888e155644c3309a6e15c42f172ac5ea10ad179e1c2,2020-06-29 14:29:04,Python,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"def jinzhi(n,x):\n    a=[0,1,2,3,4,5,6,7,8,9,'A','B','C','D','E','F','G','H','I','J']\n    b=[]\n    while True:\n        shang=n//x\n        yushu=n%x\n        b.append(yushu)\n        if shang==0:\n            break\n        n=shang;\n    b.reverse()\n    string=\""\""\n    for i in b:\n        string+=str(a[i])\n    if string==string[::-1]:\n        return 1\nstr1 = input()\nint_list = [int(x) for x in str1.split()]\nc,d = int_list[0],int_list[1]\nc=int(c)\nd=int(d)\ne=d+1\nwhile c>0:\n    count=0\n    for j in range(2,11):\n        \n        f=jinzhi(e,j)\n        if f==1 :\n            count+=1\n        if count==2:\n            print(e)\n            c-=1\n            break\n    e+=1\n",ACCEPTED,278,3112
1277490174550802432,4c3f4e5b4c903dbd3f509f12c3bf57f6b1106a21de3661d9560298e86a8d1e3f,2020-06-29 14:32:46,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\nconst int N=18; //300*300的二进制位数为17\nvoid myten2B(char t[],int n,int B)\n{\n\tint k,i=0,j;\n\tchar c;\n\twhile(n!=0)\n\t{\n\t\tk=n%B;\n\t\tif(k>=0 && k<=9) t[i]=k+'0';\n\t\telse\n\t\t\tswitch(k)\n\t\t\t{\n\t\t\t\tcase 10:t[i]='A';break;\n\t\t\t\tcase 11:t[i]='B';break;\n\t\t\t\tcase 12:t[i]='C';break;\n\t\t\t\tcase 13:t[i]='D';break;\n\t\t\t\tcase 14:t[i]='E';break;\n\t\t\t\tcase 15:t[i]='F';break;\n\t\t\t\tcase 16:t[i]='G';break;\n\t\t\t\tcase 17:t[i]='H';break;\n\t\t\t\tcase 18:t[i]='I';break;\n\t\t\t\tcase 19:t[i]='J';break;\n\t\t\t}\n\t\ti++;\n\t\tn=n/B;\n\t}\n\tk=i;\n\tfor(j=0,i--;j<=i;j++,i--)\n\t\tc=t[j],t[j]=t[i],t[i]=c;\n}\nint ispal(char p[],int len)\n{\n\tint i,j;\n\tfor(i=0,j=len-1;i<=j;i++,j--)\n\t\tif(p[i]!=p[j]) return 0;\n\treturn 1;\n}\nint main()\n{\n\tint B,i;\n\tchar m[N]={'\\0'},p[N]={'\\0'};\n\tscanf(\""%d\"",&B);\n\tfor(i=0;i<300;i++) \n\t{\n\t\tmyten2B(m,i,B);\n\t\tmyten2B(p,i*i,B);\n\t\tif(ispal(p,strlen(p))) printf(\""%s %s\\n\"",m,p); \n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1277490299926937600,c83213147a2d8d9a45ded58245e2135a1ca7678965b0bb31caebd18beefa1d2c,2020-06-29 14:33:16,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<algorithm>\n#define LL unsigned long long\nusing namespace std;\nint a[30];\nint b[30];\nint i, j, n, k, k1;\nint n1;\nvoid he(int x)\n{\n\tint ha, yu, shang; \n\tfor(j = 1;j <= 29;j++)\n\t\ta[j] = 0;\n\tk = 0;\n\tshang = x;\n\twhile(true)\n\t\t {\n\t\tyu = shang % n;\n\t\tshang = shang / n;\n\t\tk++;\n\t\ta[k] = yu;\n\t\tif(shang == 0)\n\t\t\tbreak;\n\t}\n} void ff(int x)\n{\n\tint ha, yu, shang;\n\tfor(j = 1;j <= 29;j++)\n\t\tb[j] = 0;\n\tk1 = 0;\n\tshang = x;\n\twhile(true)\n\t\t {\n\t\tyu = shang % n;\n\t\tshang = shang / n;\n\t\tk1++;\n\t\tb[k1] = yu;\n\t\tif (shang == 0) \n\t\t\tbreak;\n\t\t\n\t}\n} int main()\n{\n\t\n\tcin >> n;\n\tfor(i = 1;i <= 300;i++)\n\t\t {\n\t\tint mark = 1;\n\t\the(i);\n\t\tn1 = i * i;\n\t\tff(n1);\n\t\tfor(j = 1;j <= k1;j++)\n\t\t\t {\n\t\t\tif(b[j] != b[k1 - j + 1])\n\t\t\t\t {\n\t\t\t\tmark = 0;\n\t\t\t\tbreak;\n\t\t\t\t\n\t\t\t}\n\t\t\t\n\t\t}\n\t\tif(mark == 1)\n\t\t\t {\n\t\t\tfor(j = k;j >= 1;j--)\n\t\t\t\t {\n\t\t\t\tif(a[j] < 10) \n\t\t\t\t\tcout<<a[j];\n\t\t\t\telse{\n\t\t\t\t char c = char(a[j] - 10 + 65);\n\t\t\t\t cout << c;\n\t\t\t\t }\n\t\t\t\t\t\n\t\t\t}\n\t\t\t\tcout << \"" \"";\n\t\t\t\t\n\t\t\t\tfor (j = 1;j <= k1;j++)\n\t\t\t\t\tif (b[j] < 10)\n\t\t\t\t\t\tcout << b[j];\n\t\t\t\telse{\n\t\t\t\t char c = char(b[j] - 10 + 65);\n\t\t\t\t cout << c;\n\t\t\t\t }\n\t\t\t\tcout << endl;\n\t\t}\n\t}\n\treturn 0;\n} ",ACCEPTED,42,520
1277491096744026112,949f4200c5481916ce7e0105ff3c4b09a924fc548d16434f2f8a149b07e958c0,2020-06-29 14:36:26,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <string.h>\nusing namespace std;\nint itoa(int i){\n    string s=\"" \"";\n    string x=\""\"";\n    int c=0,b=0;\n    for(int n=2;n<11;n++){\n    do{\n        int t=i%n;\n        if(t>=0&&t<=9){\n            s+=t+'0';\n        }\n        else{\n            s+=t + '7';\n\n        }\n        i/=n;\n    }while(i!=0);\n    for(unsigned int j=s.size()-1; j>0; j--){\n        x=x+s[j];\n    }\n    int e=0;\n    for(unsigned int a=0;a<x.size();a++){\n        if(x[a]==x[x.size()-a-1]){\n            e=1;\n        }\n        else{\n            e=0;\n            break;\n        }\n    }\n    if(e==1){\n        b=b+1;\n    }\n    if(b>=2){\n        c=1;\n        break;\n    }\n    }\n    return c;\n}\nint main()\n{\n    int n,s,b=0;\n    cin>>n>>s;\n    for(int i=s+1;i>s;i++){\n        int a=itoa(i);\n        if(a){\n            cout<<i<<endl;\n            b++;\n        }\n        if(b>=n)\n            break;\n    }\n\n\n    return 0;\n}",WRONG_ANSWER,134,488
1277491949861273600,0fdb7502f4f78afc1b24890522148b83f70dee6381549eb9369f3598876b5893,2020-06-29 14:39:50,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint main()\n{\n\tint stm;\n\tcin >> stm;\n\tint m = 0, n = 0;\n\tstring s1, s2;\n\tbool flag = true;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tint j = i * i;\n\t\tdo {\n\t\t\tchar c;\n\t\t\tif (j % stm > 9)\n\t\t\t\tc = (j % stm) + 55;\n\t\t\telse\n\t\t\t\tc = (j % stm) + 48;\n\t\t\tj /= stm;\n\t\t\ts2 += c;\n\t\t\tn++;\n\t\t} while (j > 0);\n\t\tfor (int x = 0, y = n - 1; m < n / 2; x++, y--, m++) {\n\t\t\tif (s2[x] != s2[y]) {\n\t\t\t\tflag = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tm = 0;\n\t\tif (flag) {\n\t\t\tint k = i;\n\t\t\tdo {\n\t\t\t\tchar c;\n\t\t\t\tif (k%stm > 9)\n\t\t\t\t\tc = (k % stm) + 55;\n\t\t\t\telse\n\t\t\t\t\tc = (k % stm) + 48;\n\t\t\t\tk /= stm;\n\t\t\t\ts1 += c;\n\t\t\t\tm++;\n\t\t\t} while (k > 0);\n\t\t\twhile (m-- != 0)\n\t\t\t\tcout << s1[m];\n\t\t\tcout << \"" \"" << s2 << endl;\n\t\t\ts1 = \""\"";\n\t\t}\n\t\tn = 0;\n\t\tflag = true;\n\t\ts2 = \""\"";\n\t}\n\treturn 0;\n}",ACCEPTED,43,512
1277493640018984960,2506d5801ac56b957e1c7a7608991bb956321549d59508d48faca2aea9c9d42a,2020-06-29 14:46:33,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <vector>\nusing namespace std;\n\nbool work(int x, int y)\n{\n    int temp = 0;\n    int test[1000];\n    while(x!=0)\n    {\n        temp++;\n        test[temp] = x % y;\n        x = x / y;\n    }\n\n    bool pdf = true;\n\n    //判断回文数\n    for (int j = 1; j <= temp;j++)\n    {\n        if (test[j]!=test[temp-j+1])\n            pdf = false;\n    }\n\n    return pdf;\n}\n\nint main()\n{\n    vector<int> vec;\n    int N, S;\n    cin >> N >> S;\n    int num = S + 1;\n    int count = 1;\n    int ok = 0;\n    while (count<=3)\n    {\n        for (int i = 2; i <= 10;i++)\n        {\n            if (work(num,i))\n                ok++;\n        }\n        if (ok>=2)\n        {\n            count++;\n            vec.push_back(num);\n        }\n\n        num++;\n    }\n\n    for (int i = 0; i < N;i++)\n        cout << vec[i] << endl;\n\n    return 0;\n}",WRONG_ANSWER,35,512
1277493896530034688,2506d5801ac56b957e1c7a7608991bb956321549d59508d48faca2aea9c9d42a,2020-06-29 14:47:34,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <vector>\nusing namespace std;\n\nbool work(int x, int y)\n{\n    int temp = 0;\n    int test[1000];\n    while(x!=0)\n    {\n        temp++;\n        test[temp] = x % y;\n        x = x / y;\n    }\n\n    bool pdf = true;\n\n    //判断回文数\n    for (int j = 1; j <= temp;j++)\n    {\n        if (test[j]!=test[temp-j+1])\n            pdf = false;\n    }\n\n    return pdf;\n}\n\nint main()\n{\n    vector<int> vec;\n    int N, S;\n    cin >> N >> S;\n    int num = S + 1;\n    int count = 1;\n    int ok = 0;\n    while (count<=3)\n    {\n        for (int i = 2; i <= 10;i++)\n        {\n            if (work(num,i))\n                ok++;\n        }\n        if (ok>=2)\n        {\n            count++;\n            vec.push_back(num);\n        }\n\n        num++;\n    }\n\n    for (int i = 0; i < N-1;i++)\n        cout << vec[i] << endl;\n    cout << vec[N - 1];\n\n    return 0;\n}",WRONG_ANSWER,24,384
1277494964181721088,4c3f4e5b4c903dbd3f509f12c3bf57f6b1106a21de3661d9560298e86a8d1e3f,2020-06-29 14:51:48,C,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\nconst int N=18; //300*300的二进制位数为17\nvoid myten2B(char t[],int n,int B)\n{\n\tint k,i=0,j;\n\tchar c;\n\twhile(n!=0)\n\t{\n\t\tk=n%B;\n\t\tif(k>=0 && k<=9) t[i]=k+'0';\n\t\telse\n\t\t\tswitch(k)\n\t\t\t{\n\t\t\t\tcase 10:t[i]='A';break;\n\t\t\t\tcase 11:t[i]='B';break;\n\t\t\t\tcase 12:t[i]='C';break;\n\t\t\t\tcase 13:t[i]='D';break;\n\t\t\t\tcase 14:t[i]='E';break;\n\t\t\t\tcase 15:t[i]='F';break;\n\t\t\t\tcase 16:t[i]='G';break;\n\t\t\t\tcase 17:t[i]='H';break;\n\t\t\t\tcase 18:t[i]='I';break;\n\t\t\t\tcase 19:t[i]='J';break;\n\t\t\t}\n\t\ti++;\n\t\tn=n/B;\n\t}\n\tk=i;\n\tfor(j=0,i--;j<=i;j++,i--)\n\t\tc=t[j],t[j]=t[i],t[i]=c;\n}\nint ispal(char p[],int len)\n{\n\tint i,j;\n\tfor(i=0,j=len-1;i<=j;i++,j--)\n\t\tif(p[i]!=p[j]) return 0;\n\treturn 1;\n}\nint main()\n{\n\tint B,i;\n\tchar m[N],p[N];  //\""\""   {0}  {'\\0}  {\""\\0\""}都不行 ??\n\tfor(i=0;i<N;i++)\n\t\tm[i]='\\0',p[i]='\\0';\n\tscanf(\""%d\"",&B);\n\tfor(i=1;i<=300;i++) \n\t{\n\t\tmyten2B(m,i,B);\n\t\tmyten2B(p,i*i,B);\n\t\tif(ispal(p,strlen(p))) printf(\""%s %s\\n\"",m,p); \n\t}\n\treturn 0;\n}",ACCEPTED,25,384
1277495587547570176,949f4200c5481916ce7e0105ff3c4b09a924fc548d16434f2f8a149b07e958c0,2020-06-29 14:54:17,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <string.h>\nusing namespace std;\nint itoa(int i){\n\n    int c=0,b=0;\n    for(int n=2;n<11;n++){\n        string s=\"" \"";\n        string x=\""\"";\n    do{\n        int t=i%n;\n            s+=t+'0';\n        i/=n;\n    }while(i!=0);\n    for(unsigned int j=s.size()-1; j>0; j--){\n        x=x+s[j];\n    }\n    int e;\n    for(unsigned int a=0;a<x.size();a++){\n        if(x[a]==x[x.size()-a-1]){\n            e=1;\n        }\n        else{\n            e=0;\n            break;\n        }\n    }\n    if(e){\n        b=b+1;\n    }\n    else\n        continue;\n    if(b>=2){\n        c=1;\n    }\n    }\n    return c;\n}\nint main()\n{\n    int n,s,b=0;\n    cin>>n>>s;\n    for(int i=s+1;i>s;i++){\n        int a=itoa(i);\n        if(a){\n            cout<<i<<endl;\n            b++;\n        }\n        if(b>=n)\n            break;\n    }\n\n\n    return 0;\n}\n",PARTIAL_ACCEPTED,41,516
1277496681594028032,7ff8ca0f38dc5a725990bdfab0b3a9744dfb07847205203cc37de344d053f5af,2020-06-29 14:58:38,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main(){\n    int n=0,s=0;\n    cin >> n >> s;\n    int i=s+1;\n    while (n) {\n        int time=0,flag=1,c[30]={0},l=0;\n        for(int j=2;j<=11;j++){\n            //judge\n            int x=i;\n            while(x/j!=0){\n                c[l]=x%j;\n                x=x/j;\n                l+=1;\n            }\n            c[l]=x;\n            for(int k=0;k<l/2;k++){\n                if(c[k]!=c[l-k]) {\n                    flag = 0;\n                    break;\n                }\n            }\n            if(flag)    time+=1;\n            if(time>=2) break;\n            flag=1; l=0;\n        }\n        if(time>=2) {\n            cout << i << endl;\n            n--;\n        }\n        time=0; i+=1;\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,34,440
1277497152253648896,0fdb7502f4f78afc1b24890522148b83f70dee6381549eb9369f3598876b5893,2020-06-29 15:00:30,C++,20.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint main()\n{\n\tint N, S;\n\tcin >> N >> S;\n\tint m=0,n=0;\n\tint num = S + 1;\n\tstring s;\n\tbool flag=true;\n\tint flag2=0;\n\tfor (int num = S + 1; n != N; num++) {\n\t\tfor (int stm = 2, j = 0; stm<=10; stm++, j = 0) {\n\t\t\tint k = num;\n\t\t\tdo {\n\t\t\t\tchar c;\n\t\t\t\tc = (k % stm) + 48;\n\t\t\t\tk /= stm;\n\t\t\t\ts += c;\n\t\t\t\tj++;\n\t\t\t} while (k > 0);\n\t\t\tfor (int x = 0, y = j - 1; m < j / 2; x++, y--, m++) {\n\t\t\t\tif (s[x] != s[y]) {\n\t\t\t\t\tflag = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\ts = \""\"";\n\t\t\tm = 0;\n\t\t\tif (flag)\n\t\t\t\tflag2++;\n\t\t\tflag = true;\n\t\t\tif (flag2 >= 2) {\n\t\t\t\tcout << num << endl;\n\t\t\t\tn++;\n\t\t\t\tflag2 = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,39,512
1277498177249271808,7ff8ca0f38dc5a725990bdfab0b3a9744dfb07847205203cc37de344d053f5af,2020-06-29 15:04:34,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main(){\n    int n=0,s=0;\n    cin >> n >> s;\n    int i=s+1;\n    while (n) {\n        int time=0,flag=1,c[30]={0},l=0;\n        for(int j=2;j<11;j++){\n            //judge\n            int x=i;\n            while(x/j!=0){\n                c[l]=x%j;\n                x=x/j;\n                l+=1;\n            }\n            c[l]=x;\n            for(int k=0;k<=l/2;k++){\n                if(c[k]!=c[l-k]) {\n                    flag = 0;\n                    break;\n                }\n            }\n            if(flag)    time+=1;\n            if(time>=2) break;\n            flag=1; l=0;\n        }\n        if(time>=2) {\n            cout << i << endl;\n            n--;\n        }\n        time=0; i+=1;\n    }\n    return 0;\n}\n",ACCEPTED,42,512
1277498816465395712,949f4200c5481916ce7e0105ff3c4b09a924fc548d16434f2f8a149b07e958c0,2020-06-29 15:07:07,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <string.h>\nusing namespace std;\nint itoa(int i){\n\n    int c=0,b=0;\n    for(int n=2;n<11;n++){\n        string s=\"" \"";\n        string x=\""\"";\n        int k=i;\n    do{\n        int t=k%n;\n            s+=t+'0';\n        k/=n;\n    }while(k!=0);\n    for(unsigned int j=s.size()-1; j>0; j--){\n        x=x+s[j];\n    }\n    int e;\n    for(unsigned int a=0;a<x.size();a++){\n        if(x[a]==x[x.size()-a-1]){\n            e=1;\n        }\n        else{\n            e=0;\n            break;\n        }\n    }\n    if(e==1){\n        b=b+1;\n    }\n    if(b>=2){\n        c=1;\n        break;\n    }\n    }\n    return c;\n}\nint main()\n{\n    int n,s,b=0;\n    cin>>n>>s;\n    for(int i=s+1;i>s;i++){\n        int a=itoa(i);\n        if(a){\n            cout<<i<<endl;\n            b++;\n        }\n        if(b>=n)\n            break;\n    }\n\n\n    return 0;\n}\n",WRONG_ANSWER,42,512
1277499081096617984,949f4200c5481916ce7e0105ff3c4b09a924fc548d16434f2f8a149b07e958c0,2020-06-29 15:08:10,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <string.h>\nusing namespace std;\nint itoa(int i){\n\n    int c=0,b=0;\n    for(int n=2;n<11;n++){\n        string s=\"" \"";\n        string x=\""\"";\n        int k=i;\n    do{\n        int t=k%n;\n            s+=t+'0';\n        k/=n;\n    }while(k!=0);\n    for(unsigned int j=s.size()-1; j>0; j--){\n        x=x+s[j];\n    }\n    int e;\n    for(unsigned int a=0;a<x.size();a++){\n        if(x[a]==x[x.size()-a-1]){\n            e=1;\n        }\n        else{\n            e=0;\n            break;\n        }\n    }\n    if(e==1){\n        b=b+1;\n    }\n    if(b>=2){\n        c=1;\n        break;\n    }\n    }\n    return c;\n}\nint main()\n{\n    int n,s,b=0;\n    cin>>n>>s;\n    for(int i=s+1;i>s;i++){\n        int a=itoa(i);\n        if(a){\n            cout<<i<<endl;\n            b++;\n        }\n        if(b>=n)\n            break;\n    }\n\n\n    return 0;\n}\n\n",ACCEPTED,48,424
1277499226676715520,2506d5801ac56b957e1c7a7608991bb956321549d59508d48faca2aea9c9d42a,2020-06-29 15:08:45,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <vector>\nusing namespace std;\n\n\n//判断数x在y进制下是不是回文数\nbool work(int x, int y)\n{\n    int temp = 0;\n    int test[1000];\n\n    while(x!=0)\n    {\n        temp++;\n        test[temp] = x % y;\n        x = x / y;\n    }\n\n    bool pdf = true;\n\n    //判断回文数\n    for (int j = 1; j <= temp;j++)\n    {\n        if (test[j]!=test[temp-j+1])\n            pdf = false;\n    }\n\n    return pdf;\n}\n\nint main()\n{\n    vector<int> vec;\n    int N, S;\n    cin >> N >> S;\n    int num = S + 1;\n    int count = 0;\n\n    while (count<N)\n    {\n        int ok = 0;\n        for (int i = 2; i <= 10;i++)\n        {\n            if (work(num,i))\n                ok++;\n        }\n        if (ok>=2)     \n        {\n            count++;\n            vec.push_back(num);\n        }\n\n        num++;\n    }\n\n    for (int i = 0; i < N-1;i++)\n        cout << vec[i] << endl;\n    cout << vec[N - 1];\n\n    return 0;\n}",ACCEPTED,45,504
1277499764545871872,0fdb7502f4f78afc1b24890522148b83f70dee6381549eb9369f3598876b5893,2020-06-29 15:10:53,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint main()\n{\n\tint N, S;\n\tcin >> N >> S;\n\tint m=0,n=0;\n\tint num = S + 1;\n\tstring s;\n\tbool flag=true;\n\tint flag2=0;\n\tfor (int num = S + 1; n != N; num++) {\n\t\tfor (int stm = 2, j = 0; stm<=10; stm++, j = 0) {\n\t\t\tint k = num;\n\t\t\tdo {\n\t\t\t\tchar c;\n\t\t\t\tc = (k % stm) + 48;\n\t\t\t\tk /= stm;\n\t\t\t\ts += c;\n\t\t\t\tj++;\n\t\t\t} while (k > 0);\n\t\t\tfor (int x = 0, y = j - 1; m < j / 2; x++, y--, m++) {\n\t\t\t\tif (s[x] != s[y]) {\n\t\t\t\t\tflag = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\ts = \""\"";\n\t\t\tm = 0;\n\t\t\tif (flag)\n\t\t\t\tflag2++;\n\t\t\tflag = true;\n\t\t\tif (flag2 >= 2) {\n\t\t\t\tcout << num << endl;\n\t\t\t\tn++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tflag2 = 0;\n\t}\n\treturn 0;\n}",ACCEPTED,39,384
1277504623068241920,a70b4e251a1e8aa483b1e86b651fe9535f30090ac4423e7d335728ba0349ba82,2020-06-29 15:30:11,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cmath>\n#include<algorithm>\nusing namespace std;\n\nstring judge(int i,int jinzhi)\n{\n    char lis[]={'A','B','C','D','E','F','G','H','I','J','K'};\n    string yu=\""\"";\n    //int chance=0;\n    while (i>0)\n    {\n        int s=i%jinzhi;\n        if(s>=10)\n        {\n            yu+=lis[s-10];\n            i=i/jinzhi;\n        }\n        else\n        {\n            yu+=s+'0';\n            i=i/jinzhi;\n        }\n    }\n    reverse(yu.begin(),yu.end());\n    return yu;\n}\n\nint main()\n{\n     int jinzhi=0;\n    cin>>jinzhi;\n    string str;\n    for(int i=1;i<=300;i++)\n    {\n        str=judge(i*i,jinzhi);\n        string old=str;\n        reverse(str.begin(),str.end());\n        if(old==str)\n           cout<<judge(i,jinzhi)<<\"" \""<<old<<endl;\n    }\n\n}\n",ACCEPTED,40,524
1277508207298142208,d72ecca80e3b6a9e8d1d9ff1ba8175a5258dc79a213daa46397a30413c75ed27,2020-06-29 15:44:26,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nint B;\nint arr[100];\nvoid exchange(int x)\n{\n    int m=0;\n    while(x)\n    {\n        arr[++m]=x%B;\n        x=x/B;\n    }\n    for(int i=m;i>=1;i--)\n    {\n        if(arr[i]>9)\n        {\n            arr[i]=i-10+'A';\n        }\n        else\n        {\n            cout<<arr[i];\n        }\n    }\n}\nbool huiwen(int x)\n{\n    int m=0;\n    x=x*x;\n    while(x)\n    {\n        arr[++m]=x%B;\n        x/=B;\n    }\n    for(int i=1,j=m;i<j;i++,j--)\n        if(arr[i]!=arr[j])\n            return 0;\n    return 1;\n}\nint main()\n{\n    cin>>B;\n    for(int i=1;i<=300;i++)\n    {\n        if(huiwen(i))\n        {\n            exchange(i);\n            cout<<\"" \"";\n            exchange(i*i);\n            cout<<endl;\n        }\n    }\n    return 0;\n}\n\n",PARTIAL_ACCEPTED,42,512
1277510547581362176,6c8f08bdd8932fdcc26294d3b748a060d4a9595093ae5e78e918a079cbdde348,2020-06-29 15:53:44,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nint a[1005];\nbool check(int num,int radix){\n\tint temp=num;\n\tint i=0;\n\twhile(temp>0){\n\t\ti++;\n\t\ta[i]=temp%radix;\n\t\ttemp/=radix;\n\t}\n\tfor(int j=1;j<=i/2;j++){\n\t\tif(a[j]!=a[i-j+1]) return false;\n\t}\n\treturn true;\n}\nvoid get_ans(int num, int radix){\n\tint temp=num;\n\tint i=0;\n\twhile(temp>0){\n\t\ti++;\n\t\ta[i]=temp%radix;\n\t\ttemp/=radix;\n\t}\n\tfor(int j=i;j>0;j--) cout<<a[j];\n}\nint main(){\n\tint radix;\n\tcin>>radix;\n\tfor(int i=1;i<=300;i++){\n\t\tif(check(i*i,radix)){\n\t\t\tget_ans(i,radix);\n\t\t\tcout<<\"" \"";\n\t\t\tget_ans(i*i,radix);\n\t\t\tcout<<endl;\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,42,512
1277511012171841536,6c8f08bdd8932fdcc26294d3b748a060d4a9595093ae5e78e918a079cbdde348,2020-06-29 15:55:34,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nint a[1005];\nbool check(int num,int radix){\n\tint temp=num;\n\tint i=0;\n\twhile(temp>0){\n\t\ti++;\n\t\ta[i]=temp%radix;\n\t\ttemp/=radix;\n\t}\n\tfor(int j=1;j<=i/2;j++){\n\t\tif(a[j]!=a[i-j+1]) return false;\n\t}\n\treturn true;\n}\nvoid get_ans(int num, int radix){\n\tint temp=num;\n\tint i=0;\n\twhile(temp>0){\n\t\ti++;\n\t\ta[i]=temp%radix;\n\t\ttemp/=radix;\n\t}\n\tfor(int j=i;j>0;j--){\n\t\tif(a[j]<10) cout<<a[j];\n\t\tif(a[j]==10) cout<<\""A\"";\n\t\tif(a[j]==11) cout<<\""B\"";\n\t\tif(a[j]==12) cout<<\""C\"";\n\t\tif(a[j]==13) cout<<\""D\"";\n\t\tif(a[j]==14) cout<<\""E\"";\n\t\tif(a[j]==15) cout<<\""F\"";\n\t\tif(a[j]==16) cout<<\""G\"";\n\t\tif(a[j]==17) cout<<\""H\"";\n\t\tif(a[j]==18) cout<<\""I\"";\n\t\tif(a[j]==19) cout<<\""J\"";\n\t\tif(a[j]==20) cout<<\""K\"";\n\t}\n}\nint main(){\n\tint radix;\n\tcin>>radix;\n\tfor(int i=1;i<=300;i++){\n\t\tif(check(i*i,radix)){\n\t\t\tget_ans(i,radix);\n\t\t\tcout<<\"" \"";\n\t\t\tget_ans(i*i,radix);\n\t\t\tcout<<endl;\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,40,496
1277511718740090880,4c3f4e5b4c903dbd3f509f12c3bf57f6b1106a21de3661d9560298e86a8d1e3f,2020-06-29 15:58:23,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\nconst int N=20; //10000的二进制位数为14\nvoid myten2B(char t[],int n,int B)\n{\n\tint k,i=0,j;\n\tchar c;\n\tfor(i=0;i<N;i++)\n\t\tt[i]='\\0';   //要清楚t上次的内容，否则会重叠输出 \n\twhile(n!=0)\n\t{\n\t\tk=n%B;\n\t\tt[i]=k+'0';\n\t\ti++;\n\t\tn=n/B;\n\t}\n\tfor(j=0,i--;j<=i;j++,i--)\n\t\tc=t[j],t[j]=t[i],t[i]=c;\n}\nint ispal(char p[],int len)\n{\n\tint i,j;\n\tfor(i=0,j=len-1;i<=j;i++,j--)\n\t\tif(p[i]!=p[j]) return 0;\n\treturn 1;\n}\nint main()\n{\n\tint N,S,B,i,j,k;\n\tscanf(\""%d %d\"",&N,&S);\n\tchar m[N];\n\tfor(i=1,j=S+1;i<=N;j++)   //i,记录满足条件的个数，j记录大于s的数 \n\t\tfor(k=1,B=2;B<=10;B++) //k,记录满足条件的进制个数，B记录进制 \n\t\t{\n\t\t\tmyten2B(m,j,B);\n\t\t\tif(ispal(m,strlen(m))) k++;\n\t\t\tif(k>2)\n\t\t\t{\n\t\t\t\tprintf(\""%d\\n\"",j);\n\t\t\t\ti++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\treturn 0;\n}",MULTIPLE_ERROR,18,384
1277511947082194944,4c3f4e5b4c903dbd3f509f12c3bf57f6b1106a21de3661d9560298e86a8d1e3f,2020-06-29 15:59:17,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\nconst int N=15; //10000的二进制位数为14\nvoid myten2B(char t[],int n,int B)\n{\n\tint k,i=0,j;\n\tchar c;\n\tfor(i=0;i<N;i++)\n\t\tt[i]='\\0';   //要清楚t上次的内容，否则会重叠输出 \n\twhile(n!=0)\n\t{\n\t\tk=n%B;\n\t\tt[i]=k+'0';\n\t\ti++;\n\t\tn=n/B;\n\t}\n\tfor(j=0,i--;j<=i;j++,i--)\n\t\tc=t[j],t[j]=t[i],t[i]=c;\n}\nint ispal(char p[],int len)\n{\n\tint i,j;\n\tfor(i=0,j=len-1;i<=j;i++,j--)\n\t\tif(p[i]!=p[j]) return 0;\n\treturn 1;\n}\nint main()\n{\n\tint N,S,B,i,j,k;\n\tscanf(\""%d %d\"",&N,&S);\n\tchar m[N];\n\tfor(i=1,j=S+1;i<=N;j++)   //i,记录满足条件的个数，j记录大于s的数 \n\t\tfor(k=1,B=2;B<=10;B++) //k,记录满足条件的进制个数，B记录进制 \n\t\t{\n\t\t\tmyten2B(m,j,B);\n\t\t\tif(ispal(m,strlen(m))) k++;\n\t\t\tif(k>2)\n\t\t\t{\n\t\t\t\tprintf(\""%d\\n\"",j);\n\t\t\t\ti++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\treturn 0;\n}",MULTIPLE_ERROR,28,384
1277512617290031104,6c8f08bdd8932fdcc26294d3b748a060d4a9595093ae5e78e918a079cbdde348,2020-06-29 16:01:57,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nint a[5005];\nint check(int num,int radix){\n\tint temp=num;\n\tint i=0;\n\twhile(temp>0){\n\t\ti++;\n\t\ta[i]=temp%radix;\n\t\ttemp/=radix;\n\t}\n\tfor(int j=1;j<=i/2;j++){\n\t\tif(a[j]!=a[i-j+1]) return 0;\n\t}\n\treturn 1;\n}\nint main(){\n\tint n,s;\n\tcin>>n>>s;\n\twhile(n>0){\n\t\ts++;\n\t\tint test=0;\n\t\tfor(int i=2;i<=10;i++){\n\t\t\ttest+=check(s,i);\n\t\t}\n\t\tif(test>=2){\n\t\t\tcout<<s<<endl;\n\t\t\tn--;\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,53,416
1277512682876370944,4c3f4e5b4c903dbd3f509f12c3bf57f6b1106a21de3661d9560298e86a8d1e3f,2020-06-29 16:02:13,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\nconst int N=20; //10000的二进制位数为14\nvoid myten2B(char t[],int n,int B)\n{\n\tint k,i,j;\n\tchar c;\n\tfor(i=0;i<N;i++)\n\t\tt[i]='\\0';   //要清楚t上次的内容，否则会重叠输出 \n\ti=0; \n\twhile(n!=0)\n\t{\n\t\tk=n % B;\n\t\tt[i]=k+'0';\n\t\ti++;\n\t\tn=n/B;\n\t}\n\tfor(j=0,i--;j<=i;j++,i--)\n\t\tc=t[j],t[j]=t[i],t[i]=c;\n}\nint ispal(char p[],int len)\n{\n\tint i,j;\n\tfor(i=0,j=len-1;i<=j;i++,j--)\n\t\tif(p[i]!=p[j]) return 0;\n\treturn 1;\n}\nint main()\n{\n\tint N,S,B,i,j,k;\n\tscanf(\""%d %d\"",&N,&S);\n\tchar m[N];\n\tfor(i=1,j=S+1;i<=N;j++)   //i,记录满足条件的个数，j记录大于s的数 \n\t\tfor(k=1,B=2;B<=10;B++) //k,记录满足条件的进制个数，B记录进制 \n\t\t{\n\t\t\tmyten2B(m,j,B);\n\t\t\tif(ispal(m,strlen(m))) k++;\n\t\t\tif(k>2)\n\t\t\t{\n\t\t\t\tprintf(\""%d\\n\"",j);\n\t\t\t\ti++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\treturn 0;\n}",WRONG_ANSWER,23,256
1277512992407617536,4c3f4e5b4c903dbd3f509f12c3bf57f6b1106a21de3661d9560298e86a8d1e3f,2020-06-29 16:03:27,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\nconst int N=20; //10000的二进制位数为14\nvoid myten2B(char t[],int n,int B)\n{\n\tint k,i,j;\n\tchar c;\n\tfor(i=0;i<N;i++)\n\t\tt[i]='\\0';   //要清楚t上次的内容，否则会重叠输出 \n\ti=0; \n\twhile(n!=0)\n\t{\n\t\tk=n % B;\n\t\tt[i]=k+'0';\n\t\ti++;\n\t\tn=n/B;\n\t}\n\tfor(j=0,i--;j<=i;j++,i--)\n\t\tc=t[j],t[j]=t[i],t[i]=c;\n}\nint ispal(char p[],int len)\n{\n\tint i,j;\n\tfor(i=0,j=len-1;i<=j;i++,j--)\n\t\tif(p[i]!=p[j]) return 0;\n\treturn 1;\n}\nint main()\n{\n\tint N,S,B,i,j,k;\n\tscanf(\""%d %d\"",&N,&S);\n\tchar m[N];\n\tfor(i=1,j=S+1;i<=N;j++)   //i,记录满足条件的个数，j记录大于s的数 \n\t\tfor(k=1,B=2;B<=10;B++) //k,记录满足条件的进制个数，B记录进制 \n\t\t{\n\t\t\tmyten2B(m,j,B);\n\t\t\tif(ispal(m,strlen(m))) k++;\n\t\t\tif(k>2)\n\t\t\t{\n\t\t\t\tprintf(\""%d\"",j);\n\t\t\t\tif(i<N) printf(\""\\n\"");\n\t\t\t\ti++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\treturn 0;\n}",WRONG_ANSWER,28,384
1277513562010869760,3088d2a34f854f0e6e37eed33962315b3ce14c8dce83bf8a0684354ed9b59ed2,2020-06-29 16:05:42,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\n\nint isPNumber(int number, int B, vector<char>& r) {\n    vector<char> str;\n    char in;\n\n    if (number < B) {\n        if (number % B < 10)\n            in = '0' + number % B;\n        else\n            in = 'A' + number % B - 10;\n        r.push_back(in);\n        return 1;\n    }\n\n    while (number != 0) {\n        \n        if (number % B < 10)\n            in = '0' + number % B;\n        else\n            in = 'A' + number % B - 10;\n        str.push_back(in);\n        number /= B;\n    }\n    for (int index = 0; index < str.size(); index++) {\n        if (str[index] != str[str.size() - 1 - index]) {\n            return 0;\n        }\n    }\n    r = str;\n    return 1;\n}\n\nint main(void) {\n    int B;\n    cin >> B;\n    vector<char> out;\n\n    for (int i = 1; i <= 300; i++) {\n        if (isPNumber(i * i, B, out)) {\n            for (int index = 0; index < out.size(); index++)\n                cout << out[index];\n            cout << endl;\n        }\n        out.clear();\n    }\n    return 0;\n}",WRONG_ANSWER,43,424
1277514498485706752,3088d2a34f854f0e6e37eed33962315b3ce14c8dce83bf8a0684354ed9b59ed2,2020-06-29 16:09:26,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\n\nint isPNumber(int number, int B, vector<char>& r) {\n    vector<char> str;\n    char in;\n\n    if (number < B) {\n        if (number % B < 10)\n            in = '0' + number % B;\n        else\n            in = 'A' + number % B - 10;\n        r.push_back(in);\n        return 1;\n    }\n\n    while (number != 0) {\n        \n        if (number % B < 10)\n            in = '0' + number % B;\n        else\n            in = 'A' + number % B - 10;\n        str.push_back(in);\n        number /= B;\n    }\n    for (int index = 0; index < str.size(); index++) {\n        if (str[index] != str[str.size() - 1 - index]) {\n            return 0;\n        }\n    }\n    r = str;\n    return 1;\n}\n\nint main(void) {\n    int B;\n    cin >> B;\n    vector<char> out;\n\n    for (int i = 1; i <= 300; i++) {\n        if (isPNumber(i * i, B, out)) {\n            cout << i << ' ';\n            for (int index = 0; index < out.size(); index++)\n                cout << out[index];\n            cout << endl;\n        }\n        out.clear();\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,47,636
1277515271827292160,810e2080010dcf183a6262dd5c8bcf772fbaf656f4366f7a2a3640fd5f343105,2020-06-29 16:12:30,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\nint fun1(int n,int x){\n\tint i=0,m=x*x,j,a[100],b[100],k=0;\n\twhile(x!=0){\n\t\tb[k++]=x%n;\n\t\tx=x/n;\n\t}\n\twhile(m!=0){\n\t\ta[i++]=m%n;\n\t\tm=m/n;\n\t}\n\tfor(j=0;j<i/2;j++){\n\t\tif(a[j]!=a[i-j-1]) return 0;\n\t}\n\tfor(j=k-1;j>0;j--)\n\t    printf(\""%d\"",b[j]);\n\tprintf(\""%d \"",b[j]);\n\tfor(j=0;j<i-1;j++)\n\t    printf(\""%d\"",a[j]);\n\tprintf(\""%d\\n\"",a[j]);\n}\nint main(){\n\tint n,i;\n\tscanf(\""%d\"",&n);\n\tfor(i=1;i<=300;i++){\n\t\tfun1(n,i);\n\t}\n}\n",PARTIAL_ACCEPTED,32,380
1277515551553806336,f58df442ca29dc2c3fb9bb818f338eeac62afaf552e1b2429f370277d7d6bb33,2020-06-29 16:13:37,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\nusing namespace std;\nstring Transformer(int n,int radix);\nint main()\n{\n    int B;\n    cin>>B;\n    return 0;\n}\n\nstring Transformer(int n,int radix)\n{\n    string a=\""ABCDEFGHIJ\""\n    string ans=\""\"";\n\twhile(n)\n    {\n        if(radix%n<10)\n        {\n            ans+=radix%n;\n        }\n        else\n        {\n            ans+=a[radix%n-10];\n        }\n        radix = radix / n;\n    }\n\treverse(ans.begin(),ans.end());\n\treturn ans;\t\n}",COMPILE_ERROR,0,0
1277515763131285504,f58df442ca29dc2c3fb9bb818f338eeac62afaf552e1b2429f370277d7d6bb33,2020-06-29 16:14:27,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\nusing namespace std;\nstring Transformer(int n,int radix);\nint main()\n{\n    int B;\n    cin>>B;\n    return 0;\n}\n\nstring Transformer(int n,int radix)\n{\n    string a=\""ABCDEFGHIJ\"";\n    string ans=\""\"";\n\twhile(n)\n    {\n        if(radix%n<10)\n        {\n            ans+=radix%n;\n        }\n        else\n        {\n            ans+=a[radix%n-10];\n        }\n        radix = radix / n;\n    }\n\treverse(ans.begin(),ans.end());\n\treturn ans;\t\n}",WRONG_ANSWER,45,424
1277515866063699968,a8ef95b4f701efcd5f5a1080f94b5083f23be39953bef38b78f938fddbcc37ae,2020-06-29 16:14:52,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n#include <cmath>\n#include <string>\n#include <algorithm>\n\n\nstring intToA(int n,int radix)    //n是待转数字，radix是指定的进制\n{\n\tstring ans=\""\"";\n\tdo{\n\t\tint t = n % radix;\n\t\tif(t>=0&&t<=9)\tans += t + '0';\n\t\telse ans += t - 10 + 'A';\n\t\tn /= radix;\n\t}while(n!=0);\t//使用do{}while（）以防止输入为0的情况\n\treverse(ans.begin(),ans.end());\n\treturn ans;\n}\n\n\nint Hw(int n , int num)\n{\n    int i = 0;\n    int j = 0;\n    int k = 0;\n    int m = num * num;\n    int a[100];\n    int b[100];\n    int num1 = 0;\n    int num2 = 0;\n    while(num != 0){\n        a[i++] = num % n;\n        num = num / n;\n    }\n    while(m != 0){\n        b[j++] = m % n;\n        m = m / n;\n    }\n    for(k = 0 ; k < j / 2 ; k++){\n        if(b[k] != b[j - k - 1]){\n            return 0;\n        }\n    }\n    for(k = i - 1 ; k > 0 ; k-- ){\n        num1 += a[k] * pow(10,k);\n    }\n    num1 += a[k] * pow(10,k);\n    string str1 = intToA(num1, n);\n    cout << str1 << \"" \"";\n    for(k = 0 ; k < j - 1 ; k++){\n        num2 += b[k] * pow(10,k);\n    }\n    num2 += b[k] * pow(10,k);\n    string str2 = intToA(num1, n);\n    cout << str2 << endl;\n}\nint main(){\n    int hex = 0;\n    cin >> hex;\n    for(int i = 1 ; i <= 300 ; i++){\n        Hw(hex, i);\n    }\n}\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n",WRONG_ANSWER,27,384
1277516345086771200,a8ef95b4f701efcd5f5a1080f94b5083f23be39953bef38b78f938fddbcc37ae,2020-06-29 16:16:46,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n#include <cmath>\n#include <string>\n#include <algorithm>\n\n\nstring intToA(int n,int radix)    //n是待转数字，radix是指定的进制\n{\n\tstring ans=\""\"";\n\tdo{\n\t\tint t = n % radix;\n\t\tif(t>=0&&t<=9)\tans += t + '0';\n\t\telse ans += t - 10 + 'A';\n\t\tn /= radix;\n\t}while(n!=0);\t//使用do{}while（）以防止输入为0的情况\n\treverse(ans.begin(),ans.end());\n\treturn ans;\n}\n\n\nint Hw(int n , int num)\n{\n    int i = 0;\n    int j = 0;\n    int k = 0;\n    int m = num * num;\n    int a[100];\n    int b[100];\n    int num1 = 0;\n    int num2 = 0;\n    while(num != 0){\n        a[i++] = num % n;\n        num = num / n;\n    }\n    while(m != 0){\n        b[j++] = m % n;\n        m = m / n;\n    }\n    for(k = 0 ; k < j / 2 ; k++){\n        if(b[k] != b[j - k - 1]){\n            return 0;\n        }\n    }\n    for(k = i - 1 ; k > 0 ; k-- ){\n        num1 += a[k] * pow(10,k);\n    }\n    num1 += a[k] * pow(10,k);\n    string str1 = intToA(num1, n);\n    cout << str1 << \"" \"";\n    for(k = 0 ; k < j - 1 ; k++){\n        num2 += b[k] * pow(10,k);\n    }\n    num2 += b[k] * pow(10,k);\n    string str2 = intToA(num2, n);\n    cout << str2 << endl;\n}\nint main(){\n    int hex = 0;\n    cin >> hex;\n    for(int i = 1 ; i <= 300 ; i++){\n        Hw(hex, i);\n    }\n}\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n",PARTIAL_ACCEPTED,25,416
1277516828308340736,f58df442ca29dc2c3fb9bb818f338eeac62afaf552e1b2429f370277d7d6bb33,2020-06-29 16:18:41,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\nusing namespace std;\nstring Transformer(int n,int radix);\nint main()\n{\n    int B,sqr;\n    string C,D;\n    cin>>B;\n    for(i=1;i<=300;i++)\n    {\n        sqr=i*i;\n        C=Transformer(B,sqr);\n        D=C;\n        reverse(C.begin(),C.end());\n        if(D==C)\n        {\n            cout<<Transformer(B,i)<<\"" \""<<D<<endl;\n        }\n    }\n    return 0;\n}\n\nstring Transformer(int n,int radix)\n{\n    string a=\""ABCDEFGHIJ\"";\n    string ans=\""\"";\n\twhile(n)\n    {\n        if(radix%n<10)\n        {\n            ans+=radix%n;\n        }\n        else\n        {\n            ans+=a[radix%n-10];\n        }\n        radix = radix / n;\n    }\n\treverse(ans.begin(),ans.end());\n\treturn ans;\t\n}",COMPILE_ERROR,0,0
1277516874374381568,f58df442ca29dc2c3fb9bb818f338eeac62afaf552e1b2429f370277d7d6bb33,2020-06-29 16:18:52,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\nusing namespace std;\nstring Transformer(int n,int radix);\nint main()\n{\n    int B,sqr;\n    string C,D;\n    cin>>B;\n    for(int i=1;i<=300;i++)\n    {\n        sqr=i*i;\n        C=Transformer(B,sqr);\n        D=C;\n        reverse(C.begin(),C.end());\n        if(D==C)\n        {\n            cout<<Transformer(B,i)<<\"" \""<<D<<endl;\n        }\n    }\n    return 0;\n}\n\nstring Transformer(int n,int radix)\n{\n    string a=\""ABCDEFGHIJ\"";\n    string ans=\""\"";\n\twhile(n)\n    {\n        if(radix%n<10)\n        {\n            ans+=radix%n;\n        }\n        else\n        {\n            ans+=a[radix%n-10];\n        }\n        radix = radix / n;\n    }\n\treverse(ans.begin(),ans.end());\n\treturn ans;\t\n}",TIME_LIMIT_EXCEEDED,0,0
1277517886975827968,b6752181378edbb77715b4bc1b0fa55f6e3000b252f7b8c7f798a74e3a5775b7,2020-06-29 16:22:54,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\nbool shu(int a,int jingzhi){\n    int l[100];\n    int i=0;\n    do{\n        int t=a%jingzhi;\n        l[i]=t;\n        a=(a-t)/jingzhi;\n        i++;\n    }while(a!=0);\n    int w[i];\n\n    for(int j=i-1;j>=0;j--){\n        w[i-j-1]=l[j];\n\n    }\n\n    int sign=0;\n    for(int k=0;k<i;i++){\n        if(w[k]!=l[k])\n            sign=1;\n    }\n    /*for(int j=i-1;j>=0;j--){\n        cout<<l[j]<<' ';\n    }cout<<endl;\n*/\n    if(sign==0)\n        return true;\n    else\n        return false;\n}\n\nint main(){\n    int n,s;\n    int count=0;\n\n    cin>>n>>s;\n    s=s+1;\n\n    while(count!=n){\n        int cot=0;\n        for(int m=2;m<=10;m++){\n            if(shu(s,m))\n                cot+=1;\n        }\n        if(cot>=2){\n            count++;\n            cout<<s<<endl;\n        }\n        s++;\n    }\n    return 0;\n}",TIME_LIMIT_EXCEEDED,0,0
1277518592394854400,3088d2a34f854f0e6e37eed33962315b3ce14c8dce83bf8a0684354ed9b59ed2,2020-06-29 16:25:42,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\n\nvector<char> toBNumSys(int number, int B) {\n    vector<char> str;\n    char in;\n\n    if (number < B) {\n        if (number % B < 10)\n            in = '0' + number % B;\n        else\n            in = 'A' + number % B - 10;\n        str.push_back(in);\n        return str;\n     }\n\n    while (number != 0) {\n\n        if (number % B < 10)\n            in = '0' + number % B;\n        else\n            in = 'A' + number % B - 10;\n        str.push_back(in);\n        number /= B;\n    }\n    return str;\n}\n\nint isPNumber(int number, int B, vector<char>& r) {\n    vector<char> str = toBNumSys(number,B);\n\n    if (number < B) {\n        r = str;\n        return 1;\n    }\n\n    for (int index = 0; index < str.size(); index++) {\n        if (str[index] != str[str.size() - 1 - index]) {\n            return 0;\n        }\n    }\n    r = str;\n    return 1;\n}\n\nint main(void) {\n    int B;\n    cin >> B;\n    vector<char> out;\n\n    for (int i = 1; i <= 300; i++) {\n        if (isPNumber(i * i, B, out)) {\n            for (int index = 0; index < toBNumSys(i,B).size(); index++)\n                cout << toBNumSys(i, B)[index];\n            cout << ' ';\n            for (int index = 0; index < out.size(); index++)\n                cout << out[index];\n            cout << endl;\n        }\n        out.clear();\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,26,512
1277519263441543168,80edf40264d1044c177faa5868e001a10be03e9e2d7a3aec7d353c2437563df5,2020-06-29 16:28:22,C++,20.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n#include <iostream>\n#include <vector>\nusing namespace std;\nvector<char> change(int n,int jin)\n{\n    int rest;\n    char s;\n    vector<char> power;\n    while(n>=jin)\n    {\n        rest =n%jin;\n        n = n/jin;\n        s = rest+48;\n        power.push_back(s);\n    }\n    s = n+48;\n    power.push_back(s);\n    return power;\n}\nbool finding (int n2,int find1,int find2)\n{\n    vector<char> powerr;\n    for (int jinzhi = 2;jinzhi<=10;jinzhi++)\n    {\n        powerr = change(n2,jinzhi);\n\n        for (unsigned int j = 0;j<(powerr.size());j++)\n        {\n            if (powerr[0] == '0' || powerr[powerr.size()-1]== '0')\n                break;\n            if(powerr[j] == powerr[powerr.size()-j-1])\n                find1 = 1;\n            else\n            {\n                find1 = 0;\n                break;\n            }\n        }\n        if (find1 == 1)\n        {\n            find2++;\n        }\n    }\n    if (find2>=2)\n    {\n        cout<<n2<<endl;\n        return true;\n    }\n    else\n        return false;\n}\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    int count = 0;\n    int find1 = 0;\n    int find2 = 0;\n    int n2 = S+1;\n    while (count<N)\n    {\n        if(finding(n2,find1,find2))\n        {\n            count++;\n        }\n        n2++;\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,30,448
1277519808696868864,3088d2a34f854f0e6e37eed33962315b3ce14c8dce83bf8a0684354ed9b59ed2,2020-06-29 16:30:32,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\n\nvector<char> toBNumSys(int number, int B) {\n    vector<char> str;\n    char in;\n\n    if (number < B) {\n        if (number % B < 10)\n            in = '0' + number % B;\n        else\n            in = 'A' + number % B - 10;\n        str.push_back(in);\n        return str;\n     }\n\n    while (number != 0) {\n\n        if (number % B < 10)\n            in = '0' + number % B;\n        else\n            in = 'A' + number % B - 10;\n        str.push_back(in);\n        number /= B;\n    }\n    return str;\n}\n\nint isPNumber(int number, int B, vector<char>& r) {\n    vector<char> str = toBNumSys(number,B);\n\n    if (number < B) {\n        r = str;\n        return 1;\n    }\n\n    for (int index = 0; index < str.size(); index++) {\n        if (str[index] != str[str.size() - 1 - index]) {\n            return 0;\n        }\n    }\n    r = str;\n    return 1;\n}\n\nint main(void) {\n    int B;\n    cin >> B;\n    vector<char> out;\n\n    for (int i = 1; i <= 300; i++) {\n        if (isPNumber(i * i, B, out)) {\n            for (int index = toBNumSys(i, B).size() - 1; index >= 0; index--)\n                cout << toBNumSys(i, B)[index];\n            cout << ' ';\n            for (int index = 0; index < out.size(); index++)\n                cout << out[index];\n            cout << endl;\n        }\n        out.clear();\n    }\n    return 0;\n}",ACCEPTED,30,496
1277520428761800704,82e4af574b47d8c6ec0df4872de0940e85d938b8ac62ac4cdcb9a84177b464d3,2020-06-29 16:33:00,Python,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"N,S=map(int,input().split())\ndef jz(x,n):\n    lst='0123456789'\n    nums=\""\""\n    while True:\n        a=x//n\n        b=x%n\n        nums+=lst[b]\n        if a==0:\n            break\n        x=a\n    nums1=nums[::-1]\n    return nums1\npronums=[]\nfor i in range(S+1,int(str(S)[0])*10):\n    count=0\n    for j in range(2,11):\n        if jz(i,j)==jz(i,j)[::-1] and jz(i,j)[0]!='0' and \\\n            jz(i,j)[-1]!='0':\n            count+=1\n    if count>=2:\n        pronums.append(i)\nfor i in pronums[:N]:\n    print(i)",PARTIAL_ACCEPTED,150,3112
1277520673621073920,dc45081bb9d1bf2890cf7ccf2a5085a5972431a89a1343812baaeda9635a4048,2020-06-29 16:33:58,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <array>\nusing namespace std;\nint main()\n{\n\tint squ,temp,c;\n\tint B;\n\tint s1[100],s2[100];\n\tchar s4[100];\n\tcin >> B;\n\tchar a[20]{ '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\n\tfor(int x = 1; x <= 300; x++)\n\t{\n\t\tint m = 0;\n\t\tint k = 1,flag = 1;\n\t\tint p, q = 0;\n\t\tsqu = x * x;\n\t\ttemp = x;\n\t\twhile (squ != 0)\n\t\t{\n\t\t\tc = squ % B;\n\t\t\tsqu /= B;\n\t\t\tm++;\n\t\t\ts1[m] = c;\n\t\t}\n\t\tfor (int j = m; j >= 1; j--)\n\t\t{\n\t\t\ts2[j] = s1[k];\n\t\t\tk++;\n\t\t}\n\t\tfor (int i = 1; i <= m; i++)\n\t\t{\n\t\t\tif (s1[i] != s2[i])\n\t\t\t{\n\t\t\t\tflag = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (flag == 1)\n\t\t{\n\t\t\twhile (temp != 0)\n\t\t\t{\n\t\t\t\tp = temp % B;\n\t\t\t\ttemp /= B;\n\t\t\t\tq++;\n\t\t\t\ts4[q] = a[p];\n\t\t\t}\n\t\t\tfor (int c = q; q >= 1; q--)\n\t\t\t\tcout << s4[q];\n\t\t\tcout << \"" \"";\n\t\t\tfor (int d = m; m >= 1; m--)\n\t\t\t\tcout << a[s1[m]];\n\t\t\tcout << endl;\n\t\t}\n\t\tmemset(s1, 0, sizeof(s1));\n\t\tmemset(s2, 0, sizeof(s1));\n\t}\n\treturn 0;\n}\n",COMPILE_ERROR,0,0
1277520862104715264,dc45081bb9d1bf2890cf7ccf2a5085a5972431a89a1343812baaeda9635a4048,2020-06-29 16:34:43,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cstring>\nusing namespace std;\nint main()\n{\n\tint squ,temp,c;\n\tint B;\n\tint s1[100],s2[100];\n\tchar s4[100];\n\tcin >> B;\n\tchar a[20]{ '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\n\tfor(int x = 1; x <= 300; x++)\n\t{\n\t\tint m = 0;\n\t\tint k = 1,flag = 1;\n\t\tint p, q = 0;\n\t\tsqu = x * x;\n\t\ttemp = x;\n\t\twhile (squ != 0)\n\t\t{\n\t\t\tc = squ % B;\n\t\t\tsqu /= B;\n\t\t\tm++;\n\t\t\ts1[m] = c;\n\t\t}\n\t\tfor (int j = m; j >= 1; j--)\n\t\t{\n\t\t\ts2[j] = s1[k];\n\t\t\tk++;\n\t\t}\n\t\tfor (int i = 1; i <= m; i++)\n\t\t{\n\t\t\tif (s1[i] != s2[i])\n\t\t\t{\n\t\t\t\tflag = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (flag == 1)\n\t\t{\n\t\t\twhile (temp != 0)\n\t\t\t{\n\t\t\t\tp = temp % B;\n\t\t\t\ttemp /= B;\n\t\t\t\tq++;\n\t\t\t\ts4[q] = a[p];\n\t\t\t}\n\t\t\tfor (int c = q; q >= 1; q--)\n\t\t\t\tcout << s4[q];\n\t\t\tcout << \"" \"";\n\t\t\tfor (int d = m; m >= 1; m--)\n\t\t\t\tcout << a[s1[m]];\n\t\t\tcout << endl;\n\t\t}\n\t\tmemset(s1, 0, sizeof(s1));\n\t\tmemset(s2, 0, sizeof(s1));\n\t}\n\treturn 0;\n}",ACCEPTED,29,484
1277521021790248960,82e4af574b47d8c6ec0df4872de0940e85d938b8ac62ac4cdcb9a84177b464d3,2020-06-29 16:35:21,Python,50.0,1277062760129622024,1267449136707624960,1049226397448056832,"N,S=map(int,input().split())\ndef jz(x,n):\n    lst='0123456789'\n    nums=\""\""\n    while True:\n        a=x//n\n        b=x%n\n        nums+=lst[b]\n        if a==0:\n            break\n        x=a\n    nums1=nums[::-1]\n    return nums1\npronums=[]\nfor i in range(S+1,1000):\n    count=0\n    for j in range(2,11):\n        if jz(i,j)==jz(i,j)[::-1] and jz(i,j)[0]!='0' and \\\n            jz(i,j)[-1]!='0':\n            count+=1\n    if count>=2:\n        pronums.append(i)\nfor i in pronums[:N]:\n    print(i)",PARTIAL_ACCEPTED,316,3076
1277521564281528320,21378286f000a43bb43e73c5990641e25039f8adc06495ef53736feb56560c8c,2020-06-29 16:37:30,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstring>\n#include<map>\n#include<vector>\n#include<array>\n#include <algorithm>\n#include<cmath>\nusing namespace std;\nvector<char> change(int n, int b)\n{\n    vector<char>num;\n    while (n > 0)\n    {\n        int m = n % b;\n        if (m < 10)\n        {\n            num.push_back(m + 48);\n\n        }\n        else\n        {\n            num.push_back(m + 55);\n        }\n        m = n / b;\n    }\n    return num;\n}\n\n\n\nint main()\n{\n    int a;\n    int flag = 0;\n    cin >> a;\n    vector<char>c;\n    for (int i = 1; i <= 300; i++)\n    {\n        c = change(i * i, a);\n        for (int j = 0; j < (c.size()/2); j++)\n        {\n            if (c[j] == c[c.size() - j - 1])\n            {\n                flag = 1;\n            }\n            else\n            {\n                flag = 0;\n            }\n        }\n        if (flag == 1)\n        {\n            string s;\n            for (int i = 0; i < c.size(); i++)\n            {\n                s[i] = c[i];\n            }\n            cout << i << \"" \"" << s << endl;\n        }\n    }\n    \n    \n    return 0;\n}",MEMORY_LIMIT_EXCEEDED,0,0
1277521921187438592,82e4af574b47d8c6ec0df4872de0940e85d938b8ac62ac4cdcb9a84177b464d3,2020-06-29 16:38:55,Python,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"N,S=map(int,input().split())\ndef jz(x,n):\n    lst='0123456789'\n    nums=\""\""\n    while True:\n        a=x//n\n        b=x%n\n        nums+=lst[b]\n        if a==0:\n            break\n        x=a\n    nums1=nums[::-1]\n    return nums1\npronums=[]\nif S<1000:\n    border=1000\nelse:\n    border=S+3000\nfor i in range(S+1,border):\n    count=0\n    for j in range(2,11):\n        if jz(i,j)==jz(i,j)[::-1] and jz(i,j)[0]!='0' and \\\n            jz(i,j)[-1]!='0':\n            count+=1\n    if count>=2:\n        pronums.append(i)\nfor i in pronums[:N]:\n    print(i)",ACCEPTED,599,3044
1277522375371849728,e74368f99722a7aeb909d668663272951cbc6f6ee90e4273cd1caf0c446a1690,2020-06-29 16:40:44,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<algorithm>\nusing namespace std;\n\nint Lon = 0;\n//转化进制；\nstring Converse(int n, int num) {\n\tstring res;\n\tchar t;\n\tint m;\n\twhile (num) {\n\t\tm = num % n;\n\t\tif (m >= 10) {\n\t\t\tt = 'A' + (m - 10);\n\t\t}\n\t\telse\n\t\t\tt = m + '0';\n\t\tres += t;\n\t\tnum /= n;\n\t}\n\treturn res;\n}\n\n//判断是否为回文数\nbool Judge(string a) {\n\tint n = a.size();\n\tif (n == 1) {\n\t\treturn true;\n\t}\n\tint i = 0, j = n - 1;\n\tfor (; i < j; i++, j--) {\n\t\tif (a[i] != a[j])\n\t\t\treturn false;\n\t}\n\treturn true;\n}\n\nint main() {\n\tint n;\n\tcin >> n;\n\tint temp;\n\tstring a, b;\n\tfor (int i = 1; i <= 300; i++) {\n\t\ttemp = i * i;\n\t\ta = Converse(n, temp);\n\t\tif (Judge(a)) {\n\t\t\tb = Converse(n, i);\n\t\t\treverse(b.begin(), b.end());\n\t\t\tif (i != 1)\n\t\t\t\tcout << endl;\n\t\t\tcout << b << \"" \"" << a;\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,32,512
1277522735155052544,b6752181378edbb77715b4bc1b0fa55f6e3000b252f7b8c7f798a74e3a5775b7,2020-06-29 16:42:09,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\nbool shu(int a,int jingzhi){\n    int l[100];\n    int i=0;\n    do{\n        int t=a%jingzhi;\n        l[i]=t;\n        a=(a-t)/jingzhi;\n        i++;\n    }while(a!=0);\n    int sign=0;\n\n    //已知i和l，判断回文\n    for(int k=0;k<i/2;k++){\n        if(l[k]!=l[i-k-1])\n            sign=1;\n    }\n    if(sign!=0)\n        return false;\n    else\n        return true;\n\n    //i是总位数，比序列多一\n}\n\nint main(){\n    int n,s;\n    int count=0;\n\n    cin>>n>>s;\n    s=s+1;\n\n    while(count!=n){\n        int cot=0;\n        for(int m=2;m<=10;m++){\n            if(shu(s,m))\n                cot+=1;\n        }\n        if(cot>=2){\n            count++;\n            cout<<s<<endl;\n        }\n        s++;\n    }\n\n    return 0;\n}",ACCEPTED,34,496
1277522916906819584,80edf40264d1044c177faa5868e001a10be03e9e2d7a3aec7d353c2437563df5,2020-06-29 16:42:53,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n#include <iostream>\n#include <vector>\nusing namespace std;\nvector<char> change(int n,int jin)\n{\n    int rest;\n    char s;\n    vector<char> power;\n    while(n>=jin)\n    {\n        rest =n%jin;\n        n = n/jin;\n        s = rest+48;\n        power.push_back(s);\n    }\n    s = n+48;\n    power.push_back(s);\n    return power;\n}\nbool finding (int n2,int find1,int find2)\n{\n    vector<char> powerr;\n    for (int jinzhi = 2;jinzhi<=10;jinzhi++)\n    {\n        powerr = change(n2,jinzhi);\n        for (unsigned int j = 0;j<(powerr.size());j++)\n        {\n            if (powerr[0] == '0' || powerr[powerr.size()-1]== '0')\n                break;\n            if(powerr[j] == powerr[powerr.size()-j-1])\n                find1 = 1;\n            else\n            {\n                find1 = 0;\n                break;\n            }\n        }\n        if (find1 == 1)\n        {\n            find2++;\n        }\n    }\n    if (find2>2)\n    {\n        cout<<n2<<endl;\n        return true;\n    }\n    else\n        return false;\n}\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    int count = 0;\n    int find1 = 0;\n    int find2 = 0;\n    int n2 = S+1;\n    while (count<N)\n    {\n        if(finding(n2,find1,find2))\n        {\n            count++;\n        }\n        n2++;\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,30,512
1277524232903262208,810e2080010dcf183a6262dd5c8bcf772fbaf656f4366f7a2a3640fd5f343105,2020-06-29 16:48:07,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\nint fun1(int n,int x){\n\tint i=0,m=x*x,j,a[100],b[100],k=0;\n\twhile(x!=0){\n\t\tb[k++]=x%n;\n\t\tx=x/n;\n\t}\n\twhile(m!=0){\n\t\ta[i++]=m%n;\n\t\tm=m/n;\n\t}\n\tfor(j=0;j<i/2;j++){\n\t\tif(a[j]!=a[i-j-1]) return 0;\n\t}\n\tfor(j=k-1;j>0;j--)\n\t    printf(\""%d\"",b[j]);\n\tprintf(\""%d \"",b[j]);\n\tfor(j=0;j<i-1;j++)\n\t    printf(\""%d\"",a[j]);\n\tprintf(\""%d\\n\"",a[j]);\n}\nint main(){\n\tint n,i;\n\tscanf(\""%d\"",&n);\n\tfor(i=1;i<=300;i++){\n\t\tfun1(n,i);\n\t}\n}\n",PARTIAL_ACCEPTED,33,376
1277524345272860672,810e2080010dcf183a6262dd5c8bcf772fbaf656f4366f7a2a3640fd5f343105,2020-06-29 16:48:33,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\nint fun1(int n,int x){\n\tint i=0,m=x*x,j,a[100],b[100],k=0;\n\twhile(x!=0){\n\t\tb[k++]=x%n;\n\t\tx=x/n;\n\t}\n\twhile(m!=0){\n\t\ta[i++]=m%n;\n\t\tm=m/n;\n\t}\n\tfor(j=0;j<i/2;j++){\n\t\tif(a[j]!=a[i-j-1]) return 0;\n\t}\n\tfor(j=k-1;j>0;j--)\n\t    printf(\""%d\"",b[j]);\n\tprintf(\""%d \"",b[j]);\n\tfor(j=0;j<i-1;j++)\n\t    printf(\""%d\"",a[j]);\n\tprintf(\""%d\\n\"",a[j]);\n}\nint main(){\n\tint n,i;\n\tscanf(\""%d\"",&n);\n\tfor(i=1;i<=300;i++){\n\t\tfun1(n,i);\n\t}\n}\n",PARTIAL_ACCEPTED,35,384
1277524374796566528,80edf40264d1044c177faa5868e001a10be03e9e2d7a3aec7d353c2437563df5,2020-06-29 16:48:40,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n#include <iostream>\n#include <vector>\nusing namespace std;\nvector<char> change(int n,int jin)\n{\n    int rest;\n    char s;\n    vector<char> power;\n    while(n>=jin)\n    {\n        rest =n%jin;\n        n = n/jin;\n        s = rest+48;\n        power.push_back(s);\n    }\n    s = n+48;\n    power.push_back(s);\n    return power;\n}\nbool finding (int n2,int find1,int find2)\n{\n    vector<char> powerr;\n    for (int jinzhi = 2;jinzhi<=10;jinzhi++)\n    {\n        powerr = change(n2,jinzhi);\n        for (unsigned int j = 0;j<(powerr.size());j++)\n        {\n            if (powerr[0] == '0' || powerr[powerr.size()-1]== '0')\n                break;\n            if(powerr[j] == powerr[powerr.size()-j-1])\n                find1 = 1;\n            else\n            {\n                find1 = 0;\n                break;\n            }\n        }\n        if (find1 == 1)\n        {\n            find1=0;\n            find2++;\n        }\n    }\n    if (find2>=2)\n    {\n        cout<<n2<<endl;\n        return true;\n    }\n    else\n        return false;\n}\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    int count = 0;\n    int find1 = 0;\n    int find2 = 0;\n    int n2 = S+1;\n    while (count<N)\n    {\n        if(finding(n2,find1,find2))\n        {\n            count++;\n        }\n        n2++;\n    }\n    return 0;\n}",ACCEPTED,49,512
1277524658700615680,b77006d2c05616010bccb3c4dc79461f07a7a0647f294f1948292040be148b3a,2020-06-29 16:49:48,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nbool jud(string s) {\n\tstring s1;\n\tfor (int i = s.length() - 1; i >= 0; --i) s1 += s[i];\n\treturn s1 == s;\n}\n\nstring change(int n, int p) {\n\tstring str;\n\tint c, m = 0, s[100];\n\twhile (n != 0) {\n\t\tc = n % p;\n\t\tn = n / p;\n\t\tm++;\n\t\ts[m] = c;\n\t}\n\tfor (int k = m; k >= 1; k--) {\n\t\tif (s[k] >= 10) str += (char)(s[k] + 55);\n\t\telse str += (char)(s[k]+48);\n\t}\n\treturn str;\n}\nint main() {\n\tint N;\n\tcin >> N;\n\tfor (int i = 1; i <= 300; ++i) {\n\t\tif (jud(change(i * i, N))) cout << i << \"" \"" << i * i<<endl;\n\t}\n}",PARTIAL_ACCEPTED,41,512
1277524935583399936,3088d2a34f854f0e6e37eed33962315b3ce14c8dce83bf8a0684354ed9b59ed2,2020-06-29 16:50:54,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"int isPNumber(int number, int B) {\n    vector<char> str = toBNumSys(number, B);\n\n    if (number < B)\n        return 1;\n\n    for (int index = 0; index < str.size(); index++) \n        if (str[index] != str[str.size() - 1 - index]) \n            return 0;\n\n    return 1;\n}\n\nint main(void) {\n    int N,S;\n    cin >> N >> S;\n    vector<char> out;\n\n    int count = 0;\n    S++;\n    while (count < N) {\n        int iNumSys = 0;\n        for (int B = 2; B <= 10; B++) {\n            if (isPNumber(S, B))\n                iNumSys++;\n            if (iNumSys >= 2) {\n                cout << S << endl;\n                count++;\n                break;\n            }\n        }\n        S++;\n    }\n\n    return 0;\n}",COMPILE_ERROR,0,0
1277525135236464640,3088d2a34f854f0e6e37eed33962315b3ce14c8dce83bf8a0684354ed9b59ed2,2020-06-29 16:51:42,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\n\nint isPNumber(int number, int B) {\n    vector<char> str = toBNumSys(number, B);\n\n    if (number < B)\n        return 1;\n\n    for (int index = 0; index < str.size(); index++) \n        if (str[index] != str[str.size() - 1 - index]) \n            return 0;\n\n    return 1;\n}\n\nint main(void) {\n    int N,S;\n    cin >> N >> S;\n    vector<char> out;\n\n    int count = 0;\n    S++;\n    while (count < N) {\n        int iNumSys = 0;\n        for (int B = 2; B <= 10; B++) {\n            if (isPNumber(S, B))\n                iNumSys++;\n            if (iNumSys >= 2) {\n                cout << S << endl;\n                count++;\n                break;\n            }\n        }\n        S++;\n    }\n\n    return 0;\n}",COMPILE_ERROR,0,0
1277525375796568064,3088d2a34f854f0e6e37eed33962315b3ce14c8dce83bf8a0684354ed9b59ed2,2020-06-29 16:52:39,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\n\nvector<char> toBNumSys(int number, int B) {\n    vector<char> str;\n    char in;\n\n    if (number < B) {\n        if (number % B < 10)\n            in = '0' + number % B;\n        else\n            in = 'A' + number % B - 10;\n        str.push_back(in);\n        return str;\n    }\n\n    while (number != 0) {\n\n        if (number % B < 10)\n            in = '0' + number % B;\n        else\n            in = 'A' + number % B - 10;\n        str.push_back(in);\n        number /= B;\n    }\n    return str;\n}\n\nint isPNumber(int number, int B) {\n    vector<char> str = toBNumSys(number, B);\n\n    if (number < B)\n        return 1;\n\n    for (int index = 0; index < str.size(); index++) \n        if (str[index] != str[str.size() - 1 - index]) \n            return 0;\n\n    return 1;\n}\n\nint main(void) {\n    int N,S;\n    cin >> N >> S;\n    vector<char> out;\n\n    int count = 0;\n    S++;\n    while (count < N) {\n        int iNumSys = 0;\n        for (int B = 2; B <= 10; B++) {\n            if (isPNumber(S, B))\n                iNumSys++;\n            if (iNumSys >= 2) {\n                cout << S << endl;\n                count++;\n                break;\n            }\n        }\n        S++;\n    }\n\n    return 0;\n}",ACCEPTED,41,424
1277525601659846656,b77006d2c05616010bccb3c4dc79461f07a7a0647f294f1948292040be148b3a,2020-06-29 16:53:33,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nbool jud(string s) {\n\tstring s1;\n\tfor (int i = s.length() - 1; i >= 0; --i) s1 += s[i];\n\treturn s1 == s;\n}\n\nstring change(int n, int p) {\n\tstring str;\n\tint c, m = 0, s[100];\n\twhile (n != 0) {\n\t\tc = n % p;\n\t\tn = n / p;\n\t\tm++;\n\t\ts[m] = c;\n\t}\n\tfor (int k = m; k >= 1; k--) {\n\t\tif (s[k] >= 10) str += (char)(s[k] + 55);\n\t\telse str +=(char) (s[k]+48);\n\t}\n\treturn str;\n}\nint main() {\n\tint N;\n\tcin >> N;\n\tfor (int i = 1; i <= 300; ++i) {\n\t\tif (jud(change(i * i, N))) cout << i << \"" \"" << i * i<<endl;\n\t}\n}",PARTIAL_ACCEPTED,28,412
1277525774762967040,dc45081bb9d1bf2890cf7ccf2a5085a5972431a89a1343812baaeda9635a4048,2020-06-29 16:54:14,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cstring>\nusing namespace std;\nint main()\n{\n\tint squ,temp,c;\n\tint B;//进制\n\tint s1[20],s2[20];//，把平方数拆成位，s1装平方数的逆序，s2装平方数的正序\n\tchar s4[20];\n\tcin >> B;\n\tchar a[20]{ '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };//转进制用\n\tfor(int x = 1; x <= 300; x++)//穷举1-300的数\n\t{\n\t\tint m = 0;\n\t\tint k = 1,flag = 1;//flag用来标识是否为回文\n\t\tint p, q = 0;\n\t\tsqu = x * x;//得到平方数\n\t\ttemp = x;//暂存x\n\t\twhile (squ != 0)//求每一位数，逆序装进s1\n\t\t{\n\t\t\tc = squ % B;\n\t\t\tsqu /= B;\n\t\t\tm++;\n\t\t\ts1[m] = c;\n\t\t}\n\t\tfor (int j = m; j >= 1; j--)//正序装进s2\n\t\t{\n\t\t\ts2[j] = s1[k];\n\t\t\tk++;\n\t\t}\n\t\tfor (int i = 1; i <= m; i++)//比较s1与s2，是否为回文\n\t\t{\n\t\t\tif (s1[i] != s2[i])\n\t\t\t{\n\t\t\t\tflag = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (flag == 1)//平方数是回文了，进行输出（进制转换后）\n\t\t{\n\t\t\twhile (temp != 0)//转换x位B进制\n\t\t\t{\n\t\t\t\tp = temp % B;\n\t\t\t\ttemp /= B;\n\t\t\t\tq++;\n\t\t\t\ts4[q] = a[p];\n\t\t\t}\n\t\t\tfor (int c = q; q >= 1; q--)\n\t\t\t\tcout << s4[q];\n\t\t\tcout << \"" \"";\n\t\t\tfor (int d = m; m >= 1; m--)\n\t\t\t\tcout << a[s1[m]];\n\t\t\tcout << endl;\n\t\t}\n\t\tmemset(s1, 0, sizeof(s1));//对s1和s2进行清0\n\t\tmemset(s2, 0, sizeof(s1));\n\t}\n\treturn 0;\n}\n",ACCEPTED,41,512
1277525814055198720,4c3f4e5b4c903dbd3f509f12c3bf57f6b1106a21de3661d9560298e86a8d1e3f,2020-06-29 16:54:24,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\nconst int M=20; //10000的二进制位数为14\nvoid myten2B(char t[],int n,int B)\n{\n\tint k,i,j;\n\tchar c;\n\tfor(i=0;i<M;i++)\n\t\tt[i]='\\0';   //要清除t上次的内容，否则会重叠输出 \n\ti=0; \n\twhile(n!=0)\n\t{\n\t\tk=n % B;\n\t\tt[i]=k+'0';\n\t\ti++;\n\t\tn=n/B;\n\t}\n\tfor(j=0,i--;j<=i;j++,i--)\n\t\tc=t[j],t[j]=t[i],t[i]=c;\n}\nint ispal(char p[],int len)\n{\n\tint i,j;\n\tfor(i=0,j=len-1;i<=j;i++,j--)\n\t\tif(p[i]!=p[j]) return 0;\n\treturn 1;\n}\nint main()\n{\n\tint S,B,i,j,k;\n\tscanf(\""%d %d\"",&N,&S);\n\tchar m[M];\n\tfor(i=1,j=S+1;i<=N;j++)   //i,记录满足条件的个数，j记录大于s的数 \n\t\tfor(k=1,B=2;B<=10;B++) //k,记录满足条件的进制个数，B记录进制 \n\t\t{\n\t\t\tmyten2B(m,j,B);\n\t\t\tif(ispal(m,strlen(m))) k++;\n\t\t\tif(k>2)\n\t\t\t{\n\t\t\t\tprintf(\""%d\\n\"",j);\n\t\t\t\ti++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1277525885270286336,4c3f4e5b4c903dbd3f509f12c3bf57f6b1106a21de3661d9560298e86a8d1e3f,2020-06-29 16:54:40,C,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\nconst int M=20; //10000的二进制位数为14\nvoid myten2B(char t[],int n,int B)\n{\n\tint k,i,j;\n\tchar c;\n\tfor(i=0;i<M;i++)\n\t\tt[i]='\\0';   //要清除t上次的内容，否则会重叠输出 \n\ti=0; \n\twhile(n!=0)\n\t{\n\t\tk=n % B;\n\t\tt[i]=k+'0';\n\t\ti++;\n\t\tn=n/B;\n\t}\n\tfor(j=0,i--;j<=i;j++,i--)\n\t\tc=t[j],t[j]=t[i],t[i]=c;\n}\nint ispal(char p[],int len)\n{\n\tint i,j;\n\tfor(i=0,j=len-1;i<=j;i++,j--)\n\t\tif(p[i]!=p[j]) return 0;\n\treturn 1;\n}\nint main()\n{\n\tint N,S,B,i,j,k;\n\tscanf(\""%d %d\"",&N,&S);\n\tchar m[M];\n\tfor(i=1,j=S+1;i<=N;j++)   //i,记录满足条件的个数，j记录大于s的数 \n\t\tfor(k=1,B=2;B<=10;B++) //k,记录满足条件的进制个数，B记录进制 \n\t\t{\n\t\t\tmyten2B(m,j,B);\n\t\t\tif(ispal(m,strlen(m))) k++;\n\t\t\tif(k>2)\n\t\t\t{\n\t\t\t\tprintf(\""%d\\n\"",j);\n\t\t\t\ti++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\treturn 0;\n}",ACCEPTED,24,384
1277526961977483264,a8ef95b4f701efcd5f5a1080f94b5083f23be39953bef38b78f938fddbcc37ae,2020-06-29 16:58:57,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n#include <cmath>\n#include <string>\n#include <algorithm>\n\n\nstring intToA(int n,int radix, int flag)    //n是待转数字，radix是指定的进制\n{\n\tstring ans=\""\"";\n\tdo{\n\t\tint t = n % radix;\n\t\tif(t>=0 && t<=9){ans += std::to_string(t);}\n\t\telse{ans += t - 10 + 'A';}\n\t\tn /= radix;\n\t}while(n!=0);\t//使用do{}while（）以防止输入为0的情况\n\tif(flag == 1){\n            reverse(ans.begin(),ans.end());\n    }\n\treturn ans;\n}\n\n\nint Hw(int n , int num)\n{\n    int i = 0;\n    int j = 0;\n    int k = 0;\n    int m = num * num;\n    int a[100];\n    int b[100];\n    int num1 = 0;\n    int num2 = 0;\n\n    string str1 = intToA(num, n, 1);\n    string str2 = intToA(m, n, 0);\n    string str3 = intToA(m, n, 1);\n    if(str2 == str3){\n        cout << str1 << \"" \"" << str2 << endl;\n    }\n}\nint main(){\n    int hex = 0;\n    cin >> hex;\n    for(int i = 1 ; i <= 300 ; i++){\n        Hw(hex, i);\n    }\n}",ACCEPTED,32,512
1277527585523695616,a8ef95b4f701efcd5f5a1080f94b5083f23be39953bef38b78f938fddbcc37ae,2020-06-29 17:01:26,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n#include <cmath>\n#include <string>\n#include <algorithm>\n\n\nstring intToA(int n,int radix, int flag)    //n是待转数字，radix是指定的进制\n{\n\tstring ans=\""\"";\n\tdo{\n\t\tint t = n % radix;\n\t\tif(t>=0 && t<=9){ans += std::to_string(t);}\n\t\telse{ans += t - 10 + 'A';}\n\t\tn /= radix;\n\t}while(n!=0);\t//使用do{}while（）以防止输入为0的情况\n\tif(flag == 1){\n            reverse(ans.begin(),ans.end());\n    }//控制是否反转\n\treturn ans;\n}\n\n\nint Hw(int n , int num)\n{\n    int m = num * num;\n\n    string str1 = intToA(num, n, 1);\n    string str2 = intToA(m, n, 0);\n    string str3 = intToA(m, n, 1);\n\n    if(str2 == str3){\n        cout << str1 << \"" \"" << str2 << endl;\n    }\n}\nint main(){\n    int hex = 0;\n    cin >> hex;\n    for(int i = 1 ; i <= 300 ; i++){\n        Hw(hex, i);\n    }\n}",ACCEPTED,45,512
1277528479778668544,299338d5ab323b9a652bcf61b728fe1bf6dc2331e8b6c1af6ef92ea19022f137,2020-06-29 17:04:59,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n#include<iostream>\nusing namespace std;\nint s[1000];\nchar toword(int a)\n{\n\tif(a>=10)\n\treturn 'A'+a-10; \n}\nbool ishuiwen(int a,int b){\n    int r=0;\n    while(a)\n\t{\n       \ts[++r]=a%b;\n        a/=b;\n    }\n    s[0]=r;\n\tfor(int i=1;i<=s[0];i++)\n\t{\n    \tif(s[i]!=s[s[0]+1-i]) \n\t\t return false;\n    }\n    return true;\n}\nvoid jz(int a,int b)\n{\n    int r=0;\n    while(a){\n        s[++r]=a%b;\n        a/=b;\n    }\n    s[0]=r;\n    for(int i=s[0];i>=1;i--)\n    {\n    \tif(s[i]>=10)\n    \t\tcout<<toword(s[i]);\n    \telse \n    \t\tcout<<s[i];\n    }\n}\nint main()\n{\t\n\tint n;\n\tscanf(\""%d\"",&n);\n\tfor(int i=1;i<=300;i++)\n\t{\n\t\tif(ishuiwen(i*i,n))\n\t\t{\n\t\t\tjz(i,n);\n\t\t\tcout<<' ';\n\t\t\tjz(i*i,n);\n\t\t\tcout<<endl; \n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,41,448
1277529209969238016,b77006d2c05616010bccb3c4dc79461f07a7a0647f294f1948292040be148b3a,2020-06-29 17:07:53,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nbool jud(string s) {\n\tstring s1;\n\tfor (int i = s.length() - 1; i >= 0; --i) s1 += s[i];\n\treturn s1 == s;\n}\n\nstring change(int n, int p) {\n\tstring str;\n\tint c, m = 0, s[100];\n\twhile (n != 0) {\n\t\tc = n % p;\n\t\tn = n / p;\n\t\tm++;\n\t\ts[m] = c;\n\t}\n\tfor (int k = m; k >= 1; k--) {\n\t\tif (s[k] >= 10) str += (char)(s[k] + 55);\n\t\telse str +=(char) (s[k]+48);\n\t}\n\treturn str;\n}\nint main() {\n\tint N;\n\tcin >> N;\n\tfor (int i = 1; i <= 300; ++i) {\n\t\tif (jud(change(i * i, N))) cout << i << \"" \"" << i * i<<endl;\n\t}\n}",PARTIAL_ACCEPTED,41,512
1277530339944103936,a8ef95b4f701efcd5f5a1080f94b5083f23be39953bef38b78f938fddbcc37ae,2020-06-29 17:12:23,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\n#include <cmath>\n#include <string>\n#include <algorithm>\n\n\nstring intToA(int n,int radix, int flag)    //n是待转数字，radix是指定的进制\n{\n\tstring ans=\""\"";\n\tdo{\n\t\tint t = n % radix;\n\t\tif(t>=0 && t<=9){ans += std::to_string(t);}\n\t\telse{ans += t - 10 + 'A';}\n\t\tn /= radix;\n\t}while(n!=0);\t//使用do{}while（）以防止输入为0的情况\n\tif(flag == 1){\n            reverse(ans.begin(),ans.end());\n    }//控制是否反转\n\treturn ans;\n}\n\n\nbool Hw(int n , int num)\n{\n    string str2 = intToA(num, n, 0);\n    string str3 = intToA(num, n, 1);\n\n    if(str2 == str3){\n        return true;\n    }\n    else{\n        return false;\n    }\n}\nint main(){\n    int num1 = 0;\n    int num2 = 0;\n    int flag = 0;\n\n    cin >> num1 >> num2;\n    for(int i = num2 ; i > 0 ; i++){\n        for(int j = 2 ; j <= 10 ; j++){\n            if(Hw(j, i)){\n                flag += 1;\n            }\n        }\n        if(flag >= 2){\n            cout << i <<endl;\n            num1 -= 1;\n        }\n        if(num1 == 0){\n            break;\n        }\n    }\n}\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n",WRONG_ANSWER,37,420
1277530441630801920,a8ef95b4f701efcd5f5a1080f94b5083f23be39953bef38b78f938fddbcc37ae,2020-06-29 17:12:47,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\n#include <cmath>\n#include <string>\n#include <algorithm>\n\n\nstring intToA(int n,int radix, int flag)    //n是待转数字，radix是指定的进制\n{\n\tstring ans=\""\"";\n\tdo{\n\t\tint t = n % radix;\n\t\tif(t>=0 && t<=9){ans += std::to_string(t);}\n\t\telse{ans += t - 10 + 'A';}\n\t\tn /= radix;\n\t}while(n!=0);\t//使用do{}while（）以防止输入为0的情况\n\tif(flag == 1){\n            reverse(ans.begin(),ans.end());\n    }//控制是否反转\n\treturn ans;\n}\n\n\nbool Hw(int n , int num)\n{\n    string str2 = intToA(num, n, 0);\n    string str3 = intToA(num, n, 1);\n\n    if(str2 == str3){\n        return true;\n    }\n    else{\n        return false;\n    }\n}\nint main(){\n    int num1 = 0;\n    int num2 = 0;\n    int flag = 0;\n\n    cin >> num1 >> num2;\n    for(int i = num2 ; i > 0 ; i++){\n        for(int j = 2 ; j <= 10 ; j++){\n            if(Hw(j, i)){\n                flag += 1;\n            }\n        }\n        if(flag >= 2){\n            cout << i <<endl;\n            num1 -= 1;\n        }\n        if(num1 == 0){\n            break;\n        }\n    }\n}\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n",WRONG_ANSWER,36,384
1277530820581982208,810e2080010dcf183a6262dd5c8bcf772fbaf656f4366f7a2a3640fd5f343105,2020-06-29 17:14:17,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\nint fun1(int n,int x){\n\tint i=0,m=x*x,j,a[100],b[100],k=0;\n\twhile(x!=0){\n\t\tb[k++]=x%n;\n\t\tx=x/n;\n\t}\n\twhile(m!=0){\n\t\ta[i++]=m%n;\n\t\tm=m/n;\n\t}\n\tfor(j=0;j<i/2;j++){\n\t\tif(a[j]!=a[i-j-1]) return 0;\n\t}\n\tfor(j=k-1;j>0;j--)\n\t    printf(\""%d\"",b[j]);\n\tprintf(\""%d \"",b[j]);\n\tfor(j=0;j<i-1;j++)\n\t    printf(\""%d\"",a[j]);\n\tprintf(\""%d\\n\"",a[j]);\n}\nint main(){\n\tint n,i;\n\tscanf(\""%d\"",&n);\n\tfor(i=1;i<=300;i++){\n\t\tfun1(n,i);\n\t}\n}\n",PARTIAL_ACCEPTED,32,384
1277530908603645952,3a483c97e80635c09e7231fda74b44a27914eee8e61b3aa5ee128ae2e1dab19b,2020-06-29 17:14:38,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nchar num[20] = {'0','1','2','3','4',\n                '5','6','7','8','9',\n                'A','B','C','D','E',\n                'F','G','H','I','J'};\n\nstruct tu{\n    char p[20];\n    bool pan;\n    int length = 1;\n    bool huiwen(char *s, int n){\n        for (int i=1;i<n;i++){\n            if (s[i] == s[n]) n--;\n            else return false;\n        }\n        return true;\n    }\n};\n\ntu zhen[303];\nint b;\nint main()\n{\n    cin >> b;\n    for (int i=1;i<=300;i++){\n        int j = i*i;\n        while(j != 0){//字符串导入\n            zhen[i].p[zhen[i].length++] = num[j%b];\n        }\n        zhen[i].pan = zhen[i].huiwen(zhen[i].p, zhen[i].length);\n    }\n\n    for (int i=1;i<=300;i++){\n        if (zhen[i].pan){\n            cout << i*i;\n            for (int j=1;j<zhen[i].length;j++){\n                cout << zhen[i].p[j];\n            }\n            cout << endl;\n        }\n    }\n    return 0;\n}\n",SEGMENTATION_FAULT,42,424
1277530937997320192,a8ef95b4f701efcd5f5a1080f94b5083f23be39953bef38b78f938fddbcc37ae,2020-06-29 17:14:45,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\n#include <cmath>\n#include <string>\n#include <algorithm>\n\n\nstring intToA(int n,int radix, int flag)    //n是待转数字，radix是指定的进制\n{\n\tstring ans=\""\"";\n\tdo{\n\t\tint t = n % radix;\n\t\tif(t>=0 && t<=9){ans += std::to_string(t);}\n\t\telse{ans += t - 10 + 'A';}\n\t\tn /= radix;\n\t}while(n!=0);\t//使用do{}while（）以防止输入为0的情况\n\tif(flag == 1){\n            reverse(ans.begin(),ans.end());\n    }//控制是否反转\n\treturn ans;\n}\n\n\nbool Hw(int n , int num)\n{\n    string str2 = intToA(num, n, 0);\n    string str3 = intToA(num, n, 1);\n\n    if(str2 == str3){\n        return true;\n    }\n    else{\n        return false;\n    }\n}\nint main(){\n    int num1 = 0;\n    int num2 = 0;\n    int flag = 0;\n\n    cin >> num1 >> num2;\n    for(int i = num2 + 1 ; i > 0 ; i++){\n        for(int j = 2 ; j <= 10 ; j++){\n            if(Hw(j, i)){\n                flag += 1;\n            }\n        }\n        if(flag >= 2){\n            cout << i <<endl;\n            num1 -= 1;\n        }\n        if(num1 == 0){\n            break;\n        }\n    }\n}\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n",PARTIAL_ACCEPTED,39,512
1277531009455685632,b77006d2c05616010bccb3c4dc79461f07a7a0647f294f1948292040be148b3a,2020-06-29 17:15:02,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nbool jud(string s) {\n\tstring s1;\n\tfor (int i = s.length() - 1; i >= 0; --i) s1 += s[i];\n\treturn s1 == s;\n}\n\nstring change(int n, int p) {\n\tstring str;\n\tint c, m = 0, s[100];\n\twhile (n != 0) {\n\t\tc = n % p;\n\t\tn = n / p;\n\t\tm++;\n\t\ts[m] = c;\n\t}\n\tfor (int k = m; k >= 1; k--) {\n\t\tif (s[k] >= 10) str += (char)(s[k] + 55);\n\t\telse str +=(char) (s[k]+48);\n\t}\n\treturn str;\n}\nint main() {\n\tint N;\n\tcin >> N;\n\tfor (int i = 1; i <= 300; ++i) {\n\t\tif (jud(change(i * i, N))) cout << change(i,N) << \"" \"" << change(i * i,N)<<endl;\n\t}\n}",ACCEPTED,35,492
1277531020306350080,e74368f99722a7aeb909d668663272951cbc6f6ee90e4273cd1caf0c446a1690,2020-06-29 17:15:05,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nstring Converse(int n, int num) {\n\tstring res;\n\tchar t;\n\tint m;\n\twhile (num) {\n\t\tm = num % n;\n\t\tif (m >= 10) {\n\t\t\tt = 'A' + (m - 10);\n\t\t}\n\t\telse\n\t\t\tt = m + '0';\n\t\tres += t;\n\t\tnum /= n;\n\t}\n\treturn res;\n}\n\n//判断是否为回文数\nbool Judge(string a) {\n\tint n = a.size();\n\tif (n == 1) {\n\t\treturn true;\n\t}\n\tint i = 0, j = n - 1;\n\tfor (; i < j; i++, j--) {\n\t\tif (a[i] != a[j])\n\t\t\treturn false;\n\t}\n\treturn true;\n}\n\nint main() {\n\tint N, S;\n\tcin >> N >> S;\n\tint n = 0;\n\tfor (int j = S + 1;n<N;) {\n\t\tint sum = 0;\n\t\tstring temp;\n\t\tint i;\n\t\t//循环进制；\n\t\tfor ( i = 2; i <= 10&&sum<2; i++) {\n\t\t\ttemp = Converse(i, j);\n\t\t\tif (Judge(temp)) {\n\t\t\t\tsum++;\n\t\t\t}\n\t\t}\n\t\t//满足条件输出；\n\t\tif (i <= 10) {\n\t\t\tn++;\n\t\t\tif (n != 1)\n\t\t\t\tcout << endl;\n\t\t\tcout << j;\n\t\t\tj++;\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,5,360
1277531980302835712,6187709ad50eed7f26b6e80a4f69d0269fb00911171777f01df047ab9d25202d,2020-06-29 17:18:54,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"//输出所有的大于等于1，小于等于 300 且它的平方用 B 进制表示时是回文数的数.\n//用’A’,’B’……表示 10,11 等等.\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nconst int MAX = 300;\nconst char ch[21] = {'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J','K'};\n\nvoid output(int x,int B)//in base B\n{\n    vector <int> tmp;\n    tmp.push_back(0);\n    int i=0;\n    while (x>0)//process x itself\n    {\n        i++;\n        tmp.push_back(x%B);\n        x/=B;\n    }\n    for (;i;cout << ch[tmp[i--]]){}\n}\n\nvoid caculate(int x,int B)//judge if this number is suitable\n{\n    int square = x*x;\n    vector <int> tmp;\n    tmp.push_back(0);\n    int i=0;\n    while (square>0)//process the double of x\n    {\n        i++;//start from 1\n        tmp.push_back(square%B);//store each position's number\n        square/=B;//move to the next position\n    }\n    int j=i;\n    //loop while the front number is the same as behand\n    for (;(tmp[i]==tmp[j-i+1])&&(i>0);--i);\n\n        if (i==0)//output if the whole number is suitable\n        {\n            output(x, B);\n            cout <<' ';\n            output(x*x, B);\n            cout <<'\\n';\n        }\n}\n\nint main()\n{\n    int B;\n    cin >> B;\n    for (int i = 1; i <= MAX; i++)\n    {\n        caculate(i,B);\n    }\n    system(\""pause\"");\n    return 0;\n}",ACCEPTED,45,664
1277532140697214976,5f0555faff3d0b906508e2a9afc0e49c87c294eb5681c5246fc4bc8120e3ad33,2020-06-29 17:19:32,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\n#include<cstdlib>\n#include<strstream>\n#include<string>\nusing namespace std;\nbool panduan(int n)\n{\n    string s;\n    strstream ss;\n    ss<<n;\n    ss>>s;\n    int nLength = s.size(),flag=1;\n    for (int i=0;i<nLength;i++)\n    {\n        if (s[i] != s[nLength-1-i]){flag=0;break;}\n    }\n    if(!flag) return false;\n    return true;\n}\nint transfrom(long k,int a)\n{\n    vector<int>num;\n    for (int i=0;;i++)\n    {\n        int y = k%a;\n        num.push_back(y);\n        if (k<10) break;\n        k = k/a;\n    }\n    int n=num.size(),num1=0;\n    for (int i=n-1;i>=0;i--)\n    {\n        num1 *= 10;\n        num1+=num[i];\n    }\n    return num1;\n}\nint main()\n{\n    int n=0;\n    cin>>n;\n    for (int i=1;i<=300;i++)\n    {\n        long m=i*i;\n        int x = transfrom(m,n);\n        int y = panduan(x);\n        if (y) cout<<i<<\"" \""<<x<<endl; \n    }\n    system(\""pause\"");\n    return 0;\n}",PARTIAL_ACCEPTED,36,624
1277532496827187200,e74368f99722a7aeb909d668663272951cbc6f6ee90e4273cd1caf0c446a1690,2020-06-29 17:20:57,C++,40.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nstring Converse(int n, int num) {\n\tstring res;\n\tchar t;\n\tint m;\n\twhile (num) {\n\t\tm = num % n;\n\t\tif (m >= 10) {\n\t\t\tt = 'A' + (m - 10);\n\t\t}\n\t\telse\n\t\t\tt = m + '0';\n\t\tres += t;\n\t\tnum /= n;\n\t}\n\treturn res;\n}\n\n//判断是否为回文数\nbool Judge(string a) {\n\tint n = a.size();\n\tif (n == 1) {\n\t\treturn true;\n\t}\n\tint i = 0, j = n - 1;\n\tfor (; i < j; i++, j--) {\n\t\tif (a[i] != a[j])\n\t\t\treturn false;\n\t}\n\treturn true;\n}\n\nint main() {\n\tint N, S;\n\tcin >> N >> S;\n\tint n = 0;\n\tfor (int j = S + 1;n<N;) {\n\t\tint sum = 0;\n\t\tstring temp;\n\t\tint i;\n\t\t//循环进制；\n\t\tfor ( i = 2; i <= 10&&sum<2; i++) {\n\t\t\ttemp = Converse(i, j);\n\t\t\tif (Judge(temp)) {\n\t\t\t\tsum++;\n\t\t\t}\n\t\t}\n\t\t//满足条件输出；\n\t\tif (i <= 10) {\n\t\t\tn++;\n\t\t\tif (n != 1)\n\t\t\t\tcout << endl;\n\t\t\tcout << j;\n\t\t}\n\t\tj++;\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,30,508
1277532594017591296,5f0555faff3d0b906508e2a9afc0e49c87c294eb5681c5246fc4bc8120e3ad33,2020-06-29 17:21:20,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\n#include<cstdlib>\n#include<strstream>\n#include<string>\nusing namespace std;\nbool panduan(int n)\n{\n    string s;\n    strstream ss;\n    ss<<n;\n    ss>>s;\n    int nLength = s.size(),flag=1;\n    for (int i=0;i<nLength;i++)\n    {\n        if (s[i] != s[nLength-1-i]){flag=0;break;}\n    }\n    if(!flag) return false;\n    return true;\n}\nint transfrom(long k,int a)\n{\n    vector<int>num;\n    for (int i=0;;i++)\n    {\n        int y = k%a;\n        num.push_back(y);\n        if (k<a) break;\n        k = k/a;\n    }\n    int n=num.size(),num1=0;\n    for (int i=n-1;i>=0;i--)\n    {\n        num1 *= 10;\n        num1+=num[i];\n    }\n    return num1;\n}\nint main()\n{\n    int n=0;\n    cin>>n;\n    for (int i=1;i<=300;i++)\n    {\n        long m=i*i;\n        int x = transfrom(m,n);\n        int y = panduan(x);\n        if (y) cout<<i<<\"" \""<<x<<endl; \n    }\n    system(\""pause\"");\n    return 0;\n}",PARTIAL_ACCEPTED,52,552
1277532722325544960,299338d5ab323b9a652bcf61b728fe1bf6dc2331e8b6c1af6ef92ea19022f137,2020-06-29 17:21:51,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n#include<iostream>\n#include<algorithm>\nusing namespace std;\nint s[1000];\nchar toword(int a)\n{\n\tif(a>=10)\n\treturn 'A'+a-10; \n}\nbool ishuiwen(int a,int b){\n    int r=0;\n    while(a)\n\t{\n       \ts[++r]=a%b;\n        a/=b;\n    }\n\tchar str[1000];\n\tchar str1[1000];\n\tfor(int i=0;i<=r;i++)\n\t{\n\t\tstr[i]=(char)(s[i+1]-'0');\n\t}\n\tfor(int i=0;i<r;i++)\n\t\tstr1[i]=str[i];\n\treverse(str,str+r);\n\tfor(int i=0;i<r;i++)\n\tif(str1[i]!=str[i])\n\t\t\treturn 0;\n\t\t\treturn 1;\n}\nvoid jz(int a,int b)\n{\n    int r=0;\n    while(a){\n        s[++r]=a%b;\n        a/=b;\n    }\n    s[0]=r;\n    for(int i=s[0];i>=1;i--)\n    {\n    \tif(s[i]>=10)\n    \t\tcout<<toword(s[i]);\n    \telse \n    \t\tcout<<s[i];\n    }\n}\nint main()\n{\t\n\tint n;\n\tscanf(\""%d\"",&n);\n\tfor(int i=1;i<=300;i++)\n\t{\n\t\tif(ishuiwen(i*i,n))\n\t\t{\n\t\t\tjz(i,n);\n\t\t\tcout<<' ';\n\t\t\tjz(i*i,n);\n\t\t\tcout<<endl; \n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,42,512
1277533104120463360,5f0555faff3d0b906508e2a9afc0e49c87c294eb5681c5246fc4bc8120e3ad33,2020-06-29 17:23:22,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\n#include<cstdlib>\n#include<strstream>\n#include<string>\nusing namespace std;\nbool panduan(int n)\n{\n    string s;\n    strstream ss;\n    ss<<n;\n    ss>>s;\n    int nLength = s.size(),flag=1;\n    for (int i=0;i<nLength;i++)\n    {\n        if (s[i] != s[nLength-1-i]){flag=0;break;}\n    }\n    if(!flag) return false;\n    return true;\n}\nint transfrom(long k,int a)\n{\n    vector<int>num;\n    for (int i=0;;i++)\n    {\n        int y = k%a;\n        num.push_back(y);\n        if (k<a) break;\n        k = k/a;\n    }\n    int n=num.size(),num1=0;\n    for (int i=n-1;i>=0;i--)\n    {\n        num1 *= 10;\n        num1+=num[i];\n    }\n    return num1;\n}\nint main()\n{\n    int n=0;\n    cin>>n;\n    for (int i=1;i<=300;i++)\n    {\n        long m=i*i;\n        int x = transfrom(m,n);\n        int y = panduan(x);\n        if (y) cout<<i<<\"" \""<<x<<endl; \n    }\n    //system(\""pause\"");\n    return 0;\n}",PARTIAL_ACCEPTED,27,492
1277533562377535488,e74368f99722a7aeb909d668663272951cbc6f6ee90e4273cd1caf0c446a1690,2020-06-29 17:25:11,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nstring Converse(int n, int num) {\n\tstring res;\n\tchar t;\n\tint m;\n\twhile (num) {\n\t\tm = num % n;\n\t\tif (m >= 10) {\n\t\t\tt = 'A' + (m - 10);\n\t\t}\n\t\telse\n\t\t\tt = m + '0';\n\t\tres += t;\n\t\tnum /= n;\n\t}\n\treturn res;\n}\n\n//判断是否为回文数\nbool Judge(string a) {\n\tint n = a.size();\n\tif (n == 1) {\n\t\treturn true;\n\t}\n\tint i = 0, j = n - 1;\n\tfor (; i < j; i++, j--) {\n\t\tif (a[i] != a[j])\n\t\t\treturn false;\n\t}\n\treturn true;\n}\n\nint main() {\n\tint N, S;\n\tcin >> N >> S;\n\tint n = 0;\n\tfor (int j = S + 1;n<N;) {\n\t\tint sum = 0;\n\t\tstring temp;\n\t\tint i;\n\t\t//循环进制；\n\t\tfor ( i = 2; i <= 10&&sum<2; i++) {\n\t\t\ttemp = Converse(i, j);\n\t\t\tif (Judge(temp)) {\n\t\t\t\tsum++;\n\t\t\t}\n\t\t}\n\t\t//满足条件输出；\n\t\tif (sum==2) {\n\t\t\tn++;\n\t\t\tif (n != 1)\n\t\t\t\tcout << endl;\n\t\t\tcout << j;\n\t\t}\n\t\tj++;\n\t}\n\treturn 0;\n}",ACCEPTED,40,384
1277533876316987392,b397c8d5c61c579f9119702429ff8aed90b9ce9a41bb4874d620818da993e1b0,2020-06-29 17:26:26,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nint b;\nchar num[10];\nint len = 0;\nchar c[] = {'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\n\nbool check(int x)\n{\n\tlen = 0;\n\twhile(x != 0)\n\t{\n\t\tnum[len] = c[x%b];\n\t\tlen++;\n\t\tx /= b;\n\t}\n\tint p1 = 0;\n\tint p2 = len-1;\n\twhile(p1 < p2)\n\t{\n\t\tif(num[p1] != num[p2])\n\t\t\treturn false;\n\t\tp1++;\n\t\tp2--;\n\t}\n\treturn true;\n}\n\nint main()\n{\n\tcin >> b;\n\tfor(int i = 1; i <= 300; i++)\n\t{\n\t\tif(check(i*i))\n\t\t{\n\t\t\tcout << i << \"" \"";\n\t\t\tfor(int j = len-1; j >= 0; j--)\n\t\t\t{\n\t\t\t\tcout << num[j];\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,41,504
1277534289397211136,3a483c97e80635c09e7231fda74b44a27914eee8e61b3aa5ee128ae2e1dab19b,2020-06-29 17:28:04,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"//No.8\n#include <bits/stdc++.h>\nusing namespace std;\nchar num[20] = {'0','1','2','3','4',\n                '5','6','7','8','9',\n                'A','B','C','D','E',\n                'F','G','H','I','J'};\n\nstruct tu{\n    char p[20];\n    bool pan;\n    int length;\n    bool huiwen(char *s, int n){//判断是否为回文数\n        for (int i=1;i<n;i++){\n            if (s[i] == s[n]) n--;\n            else return false;\n        }\n        return true;\n    }\n};\n\ntu zhen[303];\nint b;\nint main()\n{\n    cin >> b;\n    for (int i=1;i<=300;i++){\n        int j = i*i;\n        zhen[i].length = 1;\n        while(j != 0){//字符串导入\n            zhen[i].p[(zhen[i].length++)] = num[(j%b)];\n        }\n        zhen[i].pan = zhen[i].huiwen(zhen[i].p, zhen[i].length);\n    }\n\n    for (int i=1;i<=300;i++){//输出字符串\n        if (zhen[i].pan){\n            cout << i*i;\n            for (int j=1;j<zhen[i].length;j++){\n                cout << zhen[i].p[j];\n            }\n            cout << endl;\n        }\n    }\n    return 0;\n}\n",SEGMENTATION_FAULT,41,512
1277534555450310656,b397c8d5c61c579f9119702429ff8aed90b9ce9a41bb4874d620818da993e1b0,2020-06-29 17:29:08,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nint b;\nchar num[100];\nint len = 0;\nchar c[] = {'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\n\nbool check(int x)\n{\n\tlen = 0;\n\twhile(x != 0)\n\t{\n\t\tnum[len] = c[x%b];\n\t\tlen++;\n\t\tx /= b;\n\t}\n\tint p1 = 0;\n\tint p2 = len-1;\n\twhile(p1 < p2)\n\t{\n\t\tif(num[p1] != num[p2])\n\t\t\treturn false;\n\t\tp1++;\n\t\tp2--;\n\t}\n\treturn true;\n}\n\nint main()\n{\n\tcin >> b;\n\tfor(int i = 1; i <= 300; i++)\n\t{\n\t\tif(check(i*i))\n\t\t{\n\t\t\tcout << i << \"" \"";\n\t\t\tfor(int j = len-1; j >= 0; j--)\n\t\t\t{\n\t\t\t\tcout << num[j];\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,35,492
1277534648647737344,b77006d2c05616010bccb3c4dc79461f07a7a0647f294f1948292040be148b3a,2020-06-29 17:29:30,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nbool jud(string s) {\n\tstring s1;\n\tfor (int i = s.length() - 1; i >= 0; --i) s1 += s[i];\n\treturn s1 == s;\n}\n\nstring change(int n, int p) {\n\tstring str;\n\tint c, m = 0, s[100];\n\twhile (n != 0) {\n\t\tc = n % p;\n\t\tn = n / p;\n\t\tm++;\n\t\ts[m] = c;\n\t}\n\tfor (int k = m; k >= 1; k--) str += (char)(s[k] + 48);\n\treturn str;\n}\nint main() {\n\tint N, S;\n\tcin >> N>>S;\n\tfor (int i = S + 1; i <= S + N; ++i) {\n\t\tint num = 0;\n\t\tfor (int j = 2; j < 11; ++j) {\n\t\t\tif (jud(change(i, j))) num++;\n\t\t\tif (num = 2) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n}",PARTIAL_ACCEPTED,29,500
1277535079159488512,a8ef95b4f701efcd5f5a1080f94b5083f23be39953bef38b78f938fddbcc37ae,2020-06-29 17:31:12,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\n#include <cmath>\n#include <string>\n#include <algorithm>\n\n\nstring intToA(int n,int radix, int flag)    //n是待转数字，radix是指定的进制\n{\n\tstring ans=\""\"";\n\tdo{\n\t\tint t = n % radix;\n\t\tif(t>=0 && t<=9){ans += std::to_string(t);}\n\t\telse{ans += t - 10 + 'A';}\n\t\tn /= radix;\n\t}while(n!=0);\t//使用do{}while（）以防止输入为0的情况\n\tif(flag == 1){\n        reverse(ans.begin(),ans.end());\n    }//控制是否反转\n\treturn ans;\n}\n\n\nbool Hw(int n , int num)\n{\n    string str2 = intToA(num, n, 0);\n    string str3 = intToA(num, n, 1);\n\n    if(str2 == str3){\n        return true;\n    }\n    else{\n        return false;\n    }\n}\nint main(){\n    int num1 = 0;\n    int num2 = 0;\n\n    cin >> num1 >> num2;\n    for(int i = num2 + 1 ; i > 0 ; i++){\n        int flag = 0;\n        for(int j = 2 ; j <= 10 ; j++){\n            if(Hw(j, i)){\n                flag += 1;\n            }\n        }\n        if(flag >= 2){\n            cout << i <<endl;\n            num1 -= 1;\n        }\n        if(num1 == 0){\n            break;\n        }\n    }\n}",ACCEPTED,124,424
1277535262245060608,b77006d2c05616010bccb3c4dc79461f07a7a0647f294f1948292040be148b3a,2020-06-29 17:31:56,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nbool jud(string s) {\n\tstring s1;\n\tfor (int i = s.length() - 1; i >= 0; --i) s1 += s[i];\n\treturn s1 == s;\n}\n\nstring change(int n, int p) {\n\tstring str;\n\tint c, m = 0, s[100];\n\twhile (n != 0) {\n\t\tc = n % p;\n\t\tn = n / p;\n\t\tm++;\n\t\ts[m] = c;\n\t}\n\tfor (int k = m; k >= 1; k--) str += (char)(s[k] + 48);\n\treturn str;\n}\nint main() {\n\tint N, S;\n\tcin >> N>>S;\n\tfor (int i = S + 1; i <= S + N; ++i) {\n\t\tint num = 0;\n\t\tfor (int j = 2; j < 11; ++j) {\n\t\t\tif (jud(change(i, j))) num++;\n\t\t\tif (num == 2) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n}",PARTIAL_ACCEPTED,28,488
1277535369480830976,761fdacfe751e3600726c891b3efda1d6ee33ba11ca576cb13ab34b0cd45e0d3,2020-06-29 17:32:22,C++,60.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nint isHui(int i,int b){\n    int nums[8],k=0;\n    if(i<b)\n        return 1;\n    for(int j=i;j>0;j/=b){\n        nums[k]=j%b;\n        k+=1;\n    }\n    for(int j=0;j<k/2;j++){\n        if(nums[j]!=nums[k-j-1])\n            return 0;\n    }\n    return 1;\n}\nvoid transfer(int i, int b){\n    int nums[8]={0,0,0,0,0,0,0,0},k=0;\n    for(int j=i;j>0;j/=b){\n        nums[k]=j%b;\n        k+=1;\n    }\n    while(k>0){\n        k-=1;\n        if(nums[k]<10)\n            cout<<char('0'+nums[k]);\n        else\n            cout<<char('A'+nums[k]-10);\n    }\n}\nint main(){\n    int b,sqr;\n    cin>>b;\n    for(int i=1;i<=300;i++){\n        sqr=i*i;\n        if(isHui(sqr,b)==1){\n            transfer(i,b);cout<<' ';\n            transfer(sqr,b);cout<<endl;\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,42,508
1277535721131270144,810e2080010dcf183a6262dd5c8bcf772fbaf656f4366f7a2a3640fd5f343105,2020-06-29 17:33:46,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <sstream>\n#include <string>\n#include <cmath>\nusing namespace std;\nint hw(int s)\n{\n    int ans=0;\n    for(int i=2;i<=10;i++)\n    {\n        if(ans==2) break;\n        int s0=s,j=0;\n        long long x=0;//转换成二进制可能很长 \n        while(s0)\n        {\n            x+=(s0%i)*pow(10,j);\n            s0/=i;\n            j++;\n        }\n        //cout<<x<<endl;\n        stringstream t;\n        string s;\n        t<<x;\n        t>>s;\n        int ls=s.size(),l=0;\n        while(s[l]==s[ls-1-l] && l<=(ls-1)/2)\n        {\n            l++;\n        }\n        l--;\n        if(l==(ls-1)/2) ans++;\n    }\n    return ans;\n}\nint main(){\n    int n,s,num=0;\n    cin>>n>>s;\n    while(num<n)\n    {\n        s++;\n        if(hw(s)==2) \n        {\n            cout<<s<<endl;\n            num++;\n        }\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1277535762545827840,b77006d2c05616010bccb3c4dc79461f07a7a0647f294f1948292040be148b3a,2020-06-29 17:33:55,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nbool jud(string s) {\n\tstring s1;\n\tfor (int i = s.length() - 1; i >= 0; --i) s1 += s[i];\n\treturn s1 == s;\n}\n\nstring change(int n, int p) {\n\tstring str;\n\tint c, m = 0, s[100];\n\twhile (n != 0) {\n\t\tc = n % p;\n\t\tn = n / p;\n\t\tm++;\n\t\ts[m] = c;\n\t}\n\tfor (int k = m; k >= 1; k--) str += (char)(s[k] + 48);\n\treturn str;\n}\nint main() {\n\tint N, S;\n\tcin >> N>>S;\n\tfor (int i = S + 1; i <= S + N; ++i) {\n\t\tint num = 0;\n\t\tfor (int j = 2; j < 11; ++j) {\n\t\t\tif (jud(change(i, j))) num++;\n\t\t\tif (num == 3) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n}",PARTIAL_ACCEPTED,29,384
1277535791167758336,b397c8d5c61c579f9119702429ff8aed90b9ce9a41bb4874d620818da993e1b0,2020-06-29 17:34:02,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nint b;\nchar num[100];\nint len = 0;\nchar c[] = {'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\n\nbool check(int x)\n{\n\tlen = 0;\n\twhile(x != 0)\n\t{\n\t\tnum[len] = c[x%b];\n\t\tlen++;\n\t\tx /= b;\n\t}\n\tint p1 = 0;\n\tint p2 = len-1;\n\twhile(p1 < p2)\n\t{\n\t\tif(num[p1] != num[p2])\n\t\t\treturn false;\n\t\tp1++;\n\t\tp2--;\n\t}\n\treturn true;\n}\n\nint l = 0;\nchar n[100];\nvoid change(int x)\n{\n\tl = 0;\n\twhile(x != 0)\n\t{\n\t\tn[l] = c[x%b];\n\t\tl++;\n\t\tx /= b;\n\t}\n\tfor(int i = l-1; i >= 0; i--)\n\t{\n\t\tcout << n[i];\n\t}\n}\n\nint main()\n{\n\tcin >> b;\n\tfor(int i = 1; i <= 300; i++)\n\t{\n\t\tif(check(i*i))\n\t\t{\n\t\t\tchange(i);\n\t\t\tcout << \"" \"";\n\t\t\tfor(int j = len-1; j >= 0; j--)\n\t\t\t{\n\t\t\t\tcout << num[j];\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,42,424
1277535802240729088,761fdacfe751e3600726c891b3efda1d6ee33ba11ca576cb13ab34b0cd45e0d3,2020-06-29 17:34:05,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nint isHui(int i,int b){\n    int nums[100],k=0;\n    if(i<b)\n        return 1;\n    for(int j=i;j>0;j/=b){\n        nums[k]=j%b;\n        k+=1;\n    }\n    for(int j=0;j<k/2;j++){\n        if(nums[j]!=nums[k-j-1])\n            return 0;\n    }\n    return 1;\n}\nvoid transfer(int i, int b){\n    int nums[100],k=0;\n    for(int j=i;j>0;j/=b){\n        nums[k]=j%b;\n        k+=1;\n    }\n    while(k>0){\n        k-=1;\n        if(nums[k]<10)\n            cout<<char('0'+nums[k]);\n        else\n            cout<<char('A'+nums[k]-10);\n    }\n}\nint main(){\n    int b,sqr;\n    cin>>b;\n    for(int i=1;i<=300;i++){\n        sqr=i*i;\n        if(isHui(sqr,b)==1){\n            transfer(i,b);cout<<' ';\n            transfer(sqr,b);cout<<endl;\n        }\n    }\n    return 0;\n}",ACCEPTED,40,512
1277535942888325120,810e2080010dcf183a6262dd5c8bcf772fbaf656f4366f7a2a3640fd5f343105,2020-06-29 17:34:38,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nint sum;\nint a[100];\nint k;\nint basecnt;\nint jin;\nvoid change(int n){\n\tbasecnt=0;\n\twhile(n!=0){\n\t\ta[basecnt]=n%jin;\n\t\tn/=jin;\n\t\tbasecnt++;\n\t}\n\treturn ;\n}\nint main(){\n\tint n;\n\tcin>>sum>>n;\n\tint tmp;\n\tbool tf=false;\n\tint cnt=0;\n\tint cnt2=n+1;\n\t\twhile(cnt<sum){\n\t\t\tint cnt3=0;\n\t\t\tfor(int i=2;i<=10;i++){\t\t\n\t\t\t\tmemset(a,0,sizeof(a));\n\t\t\t\tjin=i;\n\t\t\t\tchange(cnt2);\n\t\t\t\ttf=false;\n\t\t\t\tfor(int j=0;j<basecnt;j++){\n\t\t\t\t\tif(a[j]!=a[basecnt-1-j]){\n\t\t\t\t\t\ttf=true;\n\t\t\t\t\t}\n\t\t\t\t}\t\t\n\t\t\tif(tf==false){\n\t\t\t\tif(cnt3==1){\n\t\t\t\tcout<<cnt2<<endl;\n\t\t\t\tcnt++;\n\t\t\t\tbreak;\t\n\t\t\t\t}else{\n\t\t\t\t\tcnt3++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcnt2++;\n\t}\n\treturn 0;\n} ",COMPILE_ERROR,0,0
1277536191522463744,3a483c97e80635c09e7231fda74b44a27914eee8e61b3aa5ee128ae2e1dab19b,2020-06-29 17:35:38,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nchar num[20] = {'0','1','2','3','4',\n                '5','6','7','8','9',\n                'A','B','C','D','E',\n                'F','G','H','I','J'};\n\nstruct tu{\n    char p[20];\n    bool pan;\n    int length;\n    bool huiwen(char *s, int n){\n        for (int i=1;i<n;i++){\n            if (s[i] == s[n-1]) n--;\n            else return false;\n        }\n        return true;\n    }\n};\n\ntu zhen[305];\nint b;\nint main()\n{\n    cin >> b;\n    for (int i=1;i<=300;i++){\n        int j = i*i;\n        zhen[i].length = 1;\n        while(j != 0){//字符串导入\n            zhen[i].p[zhen[i].length] = num[j%b];\n            j /= b;\n            zhen[i].length += 1;\n        }\n        zhen[i].pan = zhen[i].huiwen(zhen[i].p, zhen[i].length);\n    }\n\n    for (int i=1;i<=300;i++){\n        if (zhen[i].pan){\n            cout << i << \"" \"";\n            for (int j=1;j<zhen[i].length;j++){\n                cout << zhen[i].p[j];\n            }\n            cout << endl;\n        }\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,43,424
1277536485106974720,810e2080010dcf183a6262dd5c8bcf772fbaf656f4366f7a2a3640fd5f343105,2020-06-29 17:36:48,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nint sum;\nint a[100];\nint k;\nint basecnt;\nint jin;\nvoid change(int n){\n\tbasecnt=0;\n\twhile(n!=0){\n\t\ta[basecnt]=n%jin;\n\t\tn/=jin;\n\t\tbasecnt++;\n\t}\n\treturn ;\n}\nint main(){\n\tint n;\n\tcin>>sum>>n;\n\tint tmp;\n\tbool tf=false;\n\tint cnt=0;\n\tint cnt2=n+1;\n\t\twhile(cnt<sum){\n\t\t\tint cnt3=0;\n\t\t\tfor(int i=2;i<=10;i++){\t\t\n\t\t\t\tmemset(a,0,sizeof(a));\n\t\t\t\tjin=i;\n\t\t\t\tchange(cnt2);\n\t\t\t\ttf=false;\n\t\t\t\tfor(int j=0;j<basecnt;j++){\n\t\t\t\t\tif(a[j]!=a[basecnt-1-j]){\n\t\t\t\t\t\ttf=true;\n\t\t\t\t\t}\n\t\t\t\t}\t\t\n\t\t\tif(tf==false){\n\t\t\t\tif(cnt3==1){\n\t\t\t\tcout<<cnt2<<endl;\n\t\t\t\tcnt++;\n\t\t\t\tbreak;\t\n\t\t\t\t}else{\n\t\t\t\t\tcnt3++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcnt2++;\n\t}\n\treturn 0;\n} ",ACCEPTED,38,424
1277536542132731904,810e2080010dcf183a6262dd5c8bcf772fbaf656f4366f7a2a3640fd5f343105,2020-06-29 17:37:01,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\nint fun1(int n,int x){\n\tint i=0,m=x*x,j,a[100],b[100],k=0;\n\twhile(x!=0){\n\t\tb[k++]=x%n;\n\t\tx=x/n;\n\t}\n\twhile(m!=0){\n\t\ta[i++]=m%n;\n\t\tm=m/n;\n\t}\n\tfor(j=0;j<i/2;j++){\n\t\tif(a[j]!=a[i-j-1]) return 0;\n\t}\n\tfor(j=k-1;j>0;j--)\n\t    printf(\""%d\"",b[j]);\n\tprintf(\""%d \"",b[j]);\n\tfor(j=0;j<i-1;j++)\n\t    printf(\""%d\"",a[j]);\n\tprintf(\""%d\\n\"",a[j]);\n}\nint main(){\n\tint n,i;\n\tscanf(\""%d\"",&n);\n\tfor(i=1;i<=300;i++){\n\t\tfun1(n,i);\n\t}\n}\n",PARTIAL_ACCEPTED,33,384
1277536982232662016,2e47392c98b789d288205dd61ea858df575c09a10732db5e6582d8ff8b64b68f,2020-06-29 17:38:46,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nstring trans(int n, int num)\n{\n    string res;\n    char t;\n    int m;\n    while (num)\n    {\n        m = num % n;\n        if (m >= 10)\n        {\n            t = 'A' + (m - 10);\n        }\n        else\n            t = m + '0';\n        res += t;\n        num /= n;\n    }\n    return res;\n}\n\n//判断是否为回文数\nbool num(string arr)\n{\n    int len = arr.size();\n    if (len == 1)\n    {\n        return true;\n    }\n    int i = 0, j = len - 1;\n    for (; i < j; i++, j--)\n    {\n        if (arr[i] != arr[j])\n            return false;\n    }\n    return true;\n}\n\nint main()\n{\n    int N, S;\n    cin >> N >> S;\n    int n = 0;\n    for (int j = S + 1; n < N;)\n    {\n        int sum = 0,i;\n        string temp;\n        for (i = 2; i <= 10 && sum < 2; i++)\n        {\n            temp = trans(i, j);\n            if (num(temp))\n            {\n                sum++;\n            }\n        }\n        if (sum == 2)\n        {\n            n++;\n            if (n != 1)\n                cout << endl;\n            cout << j;\n        }\n        j++;\n    }\n    return 0;\n}\n",ACCEPTED,41,564
1277537188592410624,2e47392c98b789d288205dd61ea858df575c09a10732db5e6582d8ff8b64b68f,2020-06-29 17:39:35,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nstring trans(int n, int num)\n{\n    string res;\n    char t;\n    int m;\n    while (num)\n    {\n        m = num % n;\n        if (m >= 10)\n        {\n            t = 'A' + (m - 10);\n        }\n        else\n            t = m + '0';\n        res += t;\n        num /= n;\n    }\n    return res;\n}\n\n//判断是否为回文数\nbool num(string arr)\n{\n    int len = arr.size();\n    if (len == 1)\n    {\n        return true;\n    }\n    int i = 0, j = len - 1;\n    for (; i < j; i++, j--)\n    {\n        if (arr[i] != arr[j])\n            return false;\n    }\n    return true;\n}\n\nint main()\n{\n    int N, S;\n    cin >> N >> S;\n    int n = 0;\n    for (int j = S + 1; n < N;)\n    {\n        int sum = 0,i;\n        string temp;\n        for (i = 2; i <= 10 && sum < 2; i++)\n        {\n            temp = trans(i, j);\n            if (num(temp))\n            {\n                sum+=1;\n            }\n        }\n        if (sum == 2)\n        {\n            n+=1;\n            if (n != 1)\n                cout << endl;\n            cout << j;\n        }\n        j+=1;\n    }\n    return 0;\n}\n",ACCEPTED,39,512
1277537199958974464,5f4ef3bfb84eb385fcd1549bb6e0df6373a08d76e55e36213e62c1bcbd4ff0b5,2020-06-29 17:39:38,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<vector>\n#include<array>\n#include<map>\n#include<algorithm>\nusing namespace std;\nint n;\nstring change(int a,int B) {//B是进制\n\tstring s = \""\"";\n\tdo {\n\t\tint t = a % B;\n\t\tif (t >= 0 && t <= 9) {\n\t\t\ts += t + '0';\n\t\t}\n\t\telse {\n\t\t\ts += t - 10 + 'A';\n\t\t}\n\t\ta /= B;\n\t} while (a != 0);\n\t//s字符串是反的\n\treturn s;\n}\nbool huiwen(string a) {\n\tint b = 1;\n\tif (a.size() % 2 == 0) {\n\t\tfor (int i = 0; i < a.size() / 2; i++) {\n\t\t\tif (a[i] != a[a.size() - 1 - i]) {\n\t\t\t\tb = 0;\n\t\t\t}\n\t\t}\n\t}\n\telse {\n\t\tfor (int i = 0; i < (a.size() - 1) / 2; i++){\n\t\t\tif (a[i] != a[a.size() - 1 - i]) {\n\t\t\t\tb = 0;\n\t\t\t}\n\n\t\t} \n\t}\n\tif (b == 1)return true;\n\treturn false;\n}\nint main() {\n\tcin >> n;\n\tint sq;\n\tstring sl;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tsq = i * i;\n\t\tsl = change(sq, n);\n\t\tif (huiwen(sl)) {\n\t\t\tcout << i << \"" \"" << sl << endl;\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,43,512
1277537583700041728,2e47392c98b789d288205dd61ea858df575c09a10732db5e6582d8ff8b64b68f,2020-06-29 17:41:10,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nstring trans(int n, int num)\n{\n    string res;\n    char t;\n    int m;\n    while (num)\n    {\n        m = num % n;\n        if (m >= 10)\n        t = m + '0';\n        res += t;\n        num /= n;\n    }\n    return res;\n}\n\n//判断是否为回文数\nbool num(string arr)\n{\n    int len = arr.size();\n    if (len == 1)\n    {\n        return true;\n    }\n    int i = 0, j = len - 1;\n    for (; i < j; i++, j--)\n    {\n        if (arr[i] != arr[j])\n            return false;\n    }\n    return true;\n}\n\nint main()\n{\n    int N, S;\n    cin >> N >> S;\n    int n = 0;\n    for (int j = S + 1; n < N;)\n    {\n        int sum = 0,i;\n        string temp;\n        for (i = 2; i <= 10 && sum < 2; i++)\n        {\n            temp = trans(i, j);\n            if (num(temp))\n            {\n                sum+=1;\n            }\n        }\n        if (sum == 2)\n        {\n            n+=1;\n            if (n != 1)\n                cout << endl;\n            cout << j;\n        }\n        j+=1;\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,33,552
1277537629006913536,2e47392c98b789d288205dd61ea858df575c09a10732db5e6582d8ff8b64b68f,2020-06-29 17:41:20,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nstring trans(int n, int num)\n{\n    string res;\n    char t;\n    int m;\n    while (num)\n    {\n        m = num % n;\n        if (m >= 10)\n        {\n            t = 'A' + (m - 10);\n        }\n        else\n            t = m + '0';\n        res += t;\n        num /= n;\n    }\n    return res;\n}\n\n//判断是否为回文数\nbool num(string arr)\n{\n    int len = arr.size();\n    if (len == 1)\n    {\n        return true;\n    }\n    int i = 0, j = len - 1;\n    for (; i < j; i++, j--)\n    {\n        if (arr[i] != arr[j])\n            return false;\n    }\n    return true;\n}\n\nint main()\n{\n    int N, S;\n    cin >> N >> S;\n    int n = 0;\n    for (int j = S + 1; n < N;)\n    {\n        int sum = 0,i;\n        string temp;\n        for (i = 2; i <= 10 && sum < 2; i++)\n        {\n            temp = trans(i, j);\n            if (num(temp))\n            {\n                sum+=1;\n            }\n        }\n        if (sum == 2)\n        {\n            n+=1;\n            if (n != 1)\n                cout << endl;\n            cout << j;\n        }\n        j+=1;\n    }\n    return 0;\n}\n",ACCEPTED,41,512
1277537991784849408,b77006d2c05616010bccb3c4dc79461f07a7a0647f294f1948292040be148b3a,2020-06-29 17:42:47,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nbool jud(string s) {\n\tstring s1;\n\tfor (int i = s.length() - 1; i >= 0; --i) s1 += s[i];\n\treturn s1 == s;\n}\n\nstring change(int n, int p) {\n\tstring str;\n\tint c, m = 0, s[100];\n\twhile (n != 0) {\n\t\tc = n % p;\n\t\tn = n / p;\n\t\tm++;\n\t\ts[m] = c;\n\t}\n\tfor (int k = m; k >= 1; k--) str += (char)(s[k] + 48);\n\treturn str;\n}\nint main() {\n\tint N, S,NUM=0;\n\tcin >> N>>S;\n\tfor (int i = S + 1; i >10000 ; ++i) {\n\t\tint num = 0;\n\t\tfor (int j = 2; j < 11; ++j) {\n\t\t\tif (jud(change(i, j))) num++;\n\t\t\tif (num == 3) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tNUM++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (NUM == N) break;\n\t}\n}",WRONG_ANSWER,20,484
1277538125864173568,b77006d2c05616010bccb3c4dc79461f07a7a0647f294f1948292040be148b3a,2020-06-29 17:43:19,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nbool jud(string s) {\n\tstring s1;\n\tfor (int i = s.length() - 1; i >= 0; --i) s1 += s[i];\n\treturn s1 == s;\n}\n\nstring change(int n, int p) {\n\tstring str;\n\tint c, m = 0, s[100];\n\twhile (n != 0) {\n\t\tc = n % p;\n\t\tn = n / p;\n\t\tm++;\n\t\ts[m] = c;\n\t}\n\tfor (int k = m; k >= 1; k--) str += (char)(s[k] + 48);\n\treturn str;\n}\nint main() {\n\tint N, S,NUM=0;\n\tcin >> N>>S;\n\tfor (int i = S + 1; i >10000 ; ++i) {\n\t\tint num = 0;\n\t\tfor (int j = 2; j < 11; ++j) {\n\t\t\tif (jud(change(i, j))) num++;\n\t\t\tif (num == 2) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tNUM++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (NUM == N) break;\n\t}\n}",WRONG_ANSWER,36,512
1277538269007372288,b77006d2c05616010bccb3c4dc79461f07a7a0647f294f1948292040be148b3a,2020-06-29 17:43:53,C++,60.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nbool jud(string s) {\n\tstring s1;\n\tfor (int i = s.length() - 1; i >= 0; --i) s1 += s[i];\n\treturn s1 == s;\n}\n\nstring change(int n, int p) {\n\tstring str;\n\tint c, m = 0, s[100];\n\twhile (n != 0) {\n\t\tc = n % p;\n\t\tn = n / p;\n\t\tm++;\n\t\ts[m] = c;\n\t}\n\tfor (int k = m; k >= 1; k--) str += (char)(s[k] + 48);\n\treturn str;\n}\nint main() {\n\tint N, S,NUM=0;\n\tcin >> N>>S;\n\tfor (int i = S + 1; i <10000 ; ++i) {\n\t\tint num = 0;\n\t\tfor (int j = 2; j < 11; ++j) {\n\t\t\tif (jud(change(i, j))) num++;\n\t\t\tif (num == 2) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tNUM++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (NUM == N) break;\n\t}\n}",PARTIAL_ACCEPTED,36,512
1277538483072073728,a70b4e251a1e8aa483b1e86b651fe9535f30090ac4423e7d335728ba0349ba82,2020-06-29 17:44:44,C++,60.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cmath>\n#include<algorithm>\nusing namespace std;\n\nstring judge(int i,int jinzhi)\n{\n    char lis[]={'A','B','C','D','E','F','G','H','I','J','K'};\n    string yu=\""\"";\n    //int chance=0;\n    while (i>0)\n    {\n        int s=i%jinzhi;\n        if(s>=10)\n        {\n            yu+=lis[s-10];\n            i=i/jinzhi;\n        }\n        else\n        {\n            yu+=s+'0';\n            i=i/jinzhi;\n        }\n    }\n    reverse(yu.begin(),yu.end());\n    return yu;\n}\n\nint main()\n{\n    int mins;\n     int time;\n    cin>>time;\n    cin>>mins;\n    int counts1=0;//成功的个数\n    int counts2=0;//可以的进制个数\n    bool key=false;\n    for(int i=mins+1;i<10000;i++)//\n    {\n        counts2=0;\n        if(key==true)\n        {\n            break;\n        }\n        for(int k=2;k<=10;k++)//进制数\n        {\n\n            string news=judge(i,k);\n            string re=news;\n            reverse(news.begin(),news.end());\n            if(re==news)\n            {\n                counts2++;\n            }\n            if(counts2==2)\n            {\n                counts1++;\n                cout<<i<<endl;\n                if(counts1==time)\n                {\n                    key=true;\n                }\n                break;\n            }\n\n        }\n    }\n\n}\n",PARTIAL_ACCEPTED,37,424
1277538495508185088,b77006d2c05616010bccb3c4dc79461f07a7a0647f294f1948292040be148b3a,2020-06-29 17:44:47,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nbool jud(string s) {\n\tstring s1;\n\tfor (int i = s.length() - 1; i >= 0; --i) s1 += s[i];\n\treturn s1 == s;\n}\n\nstring change(int n, int p) {\n\tstring str;\n\tint c, m = 0, s[100];\n\twhile (n != 0) {\n\t\tc = n % p;\n\t\tn = n / p;\n\t\tm++;\n\t\ts[m] = c;\n\t}\n\tfor (int k = m; k >= 1; k--) str += (char)(s[k] + 48);\n\treturn str;\n}\nint main() {\n\tint N, S,NUM=0;\n\tcin >> N>>S;\n\tfor (int i = S + 1; i <10000 ; ++i) {\n\t\tint num = 0;\n\t\tfor (int j = 2; j < 11; ++j) {\n\t\t\tif (jud(change(i, j))) num++;\n\t\t\tif (num == 3) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tNUM++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (NUM == N) break;\n\t}\n}",PARTIAL_ACCEPTED,49,512
1277539085013409792,a70b4e251a1e8aa483b1e86b651fe9535f30090ac4423e7d335728ba0349ba82,2020-06-29 17:47:08,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cmath>\n#include<algorithm>\nusing namespace std;\n\nstring judge(int i,int jinzhi)\n{\n    char lis[]={'A','B','C','D','E','F','G','H','I','J','K'};\n    string yu=\""\"";\n    //int chance=0;\n    while (i>0)\n    {\n        int s=i%jinzhi;\n        if(s>=10)\n        {\n            yu+=lis[s-10];\n            i=i/jinzhi;\n        }\n        else\n        {\n            yu+=s+'0';\n            i=i/jinzhi;\n        }\n    }\n    reverse(yu.begin(),yu.end());\n    return yu;\n}\n\nint main()\n{\n    int mins;\n     int time;\n    cin>>time;\n    cin>>mins;\n    int counts1=0;//成功的个数\n    int counts2=0;//可以的进制个数\n    bool key=false;\n    for(int i=mins+1;i<1000000;i++)//\n    {\n        counts2=0;\n        if(key==true)\n        {\n            break;\n        }\n        for(int k=2;k<=10;k++)//进制数\n        {\n\n            string news=judge(i,k);\n            string re=news;\n            reverse(news.begin(),news.end());\n            if(re==news)\n            {\n                counts2++;\n            }\n            if(counts2==2)\n            {\n                counts1++;\n                cout<<i<<endl;\n                if(counts1==time)\n                {\n                    key=true;\n                }\n                break;\n            }\n\n        }\n    }\n\n}\n",ACCEPTED,33,512
1277539515919425536,2dbc8dbbe3a3713fd279f85d78da00257659b0fa27c0cdad54e2bf4fb0d9580e,2020-06-29 17:48:50,Python,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"def ishuiwen(strn):\n    if strn==strn[::-1]:\n        return(True)\n    else:\n        return(False)\ndef intojinzhi(jinzhi,n):\n    a=[0,1,2,3,4,5,6,7,8,9,'A','B','C','D','E','F','G','H','I','J']\n    b=[]\n    while True:\n        s=n//jinzhi\n        y=n%jinzhi\n        b=b+[y]\n        if s==0:\n            break\n        n=s\n    b.reverse()\n    ans=''\n    for i in b:\n        ans+=str(a[i])\n    return(ans)\nn=input()\nfor x in range(1,300):\n    trans=intojinzhi(int(n),x**2)\n    if ishuiwen(trans):\n        print(x,trans)\n",PARTIAL_ACCEPTED,204,3200
1277540721748271104,c3e6f8ec2d23f7f807edf9bf11527d181f7fd2c4e0ae98ec2be0571dd32dde6c,2020-06-29 17:53:38,Python,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"n = int(input())\n\nnum=0\nstring=''\nfor w in range(1,300):\n    x=w**2\n    while(x>0):\n        num=x%n\n        if(num>=10):\n            num=chr(num-10+ord('A'))\n            string=num+string\n        else:\n            string=str(num)+string\n        x=x//n\n    \n    if string==string[::-1]:\n        print(str(w)+\"" \""+string)\n    string=''",PARTIAL_ACCEPTED,189,3100
1277540974283128832,c3e6f8ec2d23f7f807edf9bf11527d181f7fd2c4e0ae98ec2be0571dd32dde6c,2020-06-29 17:54:38,Python,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"n = int(input())\n\nnum=0\nstring=''\nfor w in range(1,301):\n    x=w**2\n    while(x>0):\n        num=x%n\n        if(num>=10):\n            num=chr(num-10+ord('A'))\n            string=num+string\n        else:\n            string=str(num)+string\n        x=x//n\n    \n    if string==string[::-1]:\n        print(str(w)+\"" \""+string)\n    string=''",PARTIAL_ACCEPTED,198,3024
1277541046085410816,2dbc8dbbe3a3713fd279f85d78da00257659b0fa27c0cdad54e2bf4fb0d9580e,2020-06-29 17:54:55,Python,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"def ishuiwen(strn):\n    if strn==strn[::-1]:\n        return(True)\n    else:\n        return(False)\ndef intojinzhi(jinzhi,n):\n    a=[0,1,2,3,4,5,6,7,8,9,'A','B','C','D','E','F','G','H','I','J']\n    b=[]\n    while True:\n        s=n//jinzhi\n        y=n%jinzhi\n        b=b+[y]\n        if s==0:\n            break\n        n=s\n    b.reverse()\n    ans=''\n    for i in b:\n        ans+=str(a[i])\n    return(ans)\nn=input()\nfor x in range(1,300):\n    trans=intojinzhi(int(n),x**2)\n    if ishuiwen(trans):\n        x=int(intojinzhi(int(n),x))\n        print(x,trans)\n\n",PARTIAL_ACCEPTED,200,3108
1277541335945379840,2dbc8dbbe3a3713fd279f85d78da00257659b0fa27c0cdad54e2bf4fb0d9580e,2020-06-29 17:56:04,Python,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"def ishuiwen(strn):\n    if strn==strn[::-1]:\n        return(True)\n    else:\n        return(False)\ndef intojinzhi(jinzhi,n):\n    a=[0,1,2,3,4,5,6,7,8,9,'A','B','C','D','E','F','G','H','I','J']\n    b=[]\n    while True:\n        s=n//jinzhi\n        y=n%jinzhi\n        b=b+[y]\n        if s==0:\n            break\n        n=s\n    b.reverse()\n    ans=''\n    for i in b:\n        ans+=str(a[i])\n    return(ans)\nn=input()\nfor x in range(1,300):\n    trans=intojinzhi(int(n),x**2)\n    if ishuiwen(trans):\n        x=intojinzhi(int(n),x)\n        print(x,trans)\n\n",ACCEPTED,175,3072
1277541569735876608,996426eb2c46e27722456ffb4665b347926a2751ce9b5258dbaefeaa3c58c7a0,2020-06-29 17:57:00,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint huiwen(int m)\n{\n\tint i = m, s = 0;\n\twhile (i != 0)\n\t{\n\t\ts = s * 10 + i % 10;\n\t\ti = i / 10;\n\t}\n\tif (s == m) return 1 ;\n\telse return 0;\n}\nint main()\n{\n\tint a;\n\tfor (int k = 1; k <= 300; k++)\n\t{\n\t\tif ((huiwen(k) == 1)&&(huiwen(k*k)==1))\n\t\t\tcout << k <<\"" \""<< k*k << endl;\n\t}\n\treturn 0;\n}",WRONG_ANSWER,40,384
1277541734026772480,996426eb2c46e27722456ffb4665b347926a2751ce9b5258dbaefeaa3c58c7a0,2020-06-29 17:57:39,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint huiwen(int m)\n{\n\tint i = m, s = 0;\n\twhile (i != 0)\n\t{\n\t\ts = s * 10 + i % 10;\n\t\ti = i / 10;\n\t}\n\tif (s == m) return 1 ;\n\telse return 0;\n}\nint main()\n{\n\tfor (int k = 1; k <= 300; k++)\n\t{\n\t\tif ((huiwen(k) == 1)&&(huiwen(k*k)==1))\n\t\t\tcout << k <<\"" \""<< k*k << endl;\n\t}\n\treturn 0;\n}",WRONG_ANSWER,40,492
1277542054974906368,4a56193e4e3aef88687c4b59a91d8be77df2f76f9682cde0c0a70959b66497ce,2020-06-29 17:58:56,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<string>\nusing namespace std;\n\nstring change(int n, int cs) {\n\tstring str;\n\tchar t;\n\tint m;\n\twhile (cs) {\n\t\tm = cs % n;\n\t\tif (m >= 10) {\n\t\t\tt = 'A' + (m - 10);\n\t\t}\n\t\telse\n\t\t\tt = m + '0';\n\t\tstr += t;\n\t\tcs /= n;\n\t}\n\treturn str;\n}\nbool test(string st) {\n\tint n = st.size();\n\tif (n == 1) \n\t{\n\t\treturn true;\n\t}\n\tint i = 0, j = n - 1;\n\tfor (; i < j; i++, j--) {\n\t\tif (st[i] != st[j])\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nint main()\n{\n\tint v;\n\tcin >> v;\n\tbool k;\n\tstring temp;\n\tint qqq;\n\tfor (int j = 0; j <= 300; j++)\n\t{\n\t\tqqq = j * j;\n\t\ttemp = change(v,qqq);\n\t\tif (test(temp))\n\t\t{\n\t\t\tcout << j << \"" \"" << temp << endl;\n\t\t}\n\t}\n}",WRONG_ANSWER,42,512
1277542194250964992,4a56193e4e3aef88687c4b59a91d8be77df2f76f9682cde0c0a70959b66497ce,2020-06-29 17:59:29,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<string>\nusing namespace std;\n\nstring change(int n, int cs) {\n\tstring str;\n\tchar t;\n\tint m;\n\twhile (cs) {\n\t\tm = cs % n;\n\t\tif (m >= 10) {\n\t\t\tt = 'A' + (m - 10);\n\t\t}\n\t\telse\n\t\t\tt = m + '0';\n\t\tstr += t;\n\t\tcs /= n;\n\t}\n\treturn str;\n}\nbool test(string st) {\n\tint n = st.size();\n\tif (n == 1) \n\t{\n\t\treturn true;\n\t}\n\tint i = 0, j = n - 1;\n\tfor (; i < j; i++, j--) {\n\t\tif (st[i] != st[j])\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nint main()\n{\n\tint v;\n\tcin >> v;\n\tbool k;\n\tstring temp;\n\tint qqq;\n\tfor (int j = 1; j <= 300; j++)\n\t{\n\t\tqqq = j * j;\n\t\ttemp = change(v,qqq);\n\t\tif (test(temp))\n\t\t{\n\t\t\tcout << j << \"" \"" << temp << endl;\n\t\t}\n\t}\n}",PARTIAL_ACCEPTED,29,424
1277542262160941056,c3e6f8ec2d23f7f807edf9bf11527d181f7fd2c4e0ae98ec2be0571dd32dde6c,2020-06-29 17:59:45,Python,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"def hahaha(x,n):\n    string=''\n    while(x>0):\n        num=x%n\n        if(num>=10):\n            num=chr(num-10+ord('A'))\n            string=num+string\n        else:\n            string=str(num)+string\n        x=x//n\n    return string\n\nn = int(input())\n\n\nnum=0\nstring=''\nfor w in range(1,301):\n    x=w**2\n    string=hahaha(x,n)\n    if string==string[::-1]:\n        print(str(hahaha(w,n))+\"" \""+string)\n    string=''",ACCEPTED,188,3068
1277542309057462272,c3e6f8ec2d23f7f807edf9bf11527d181f7fd2c4e0ae98ec2be0571dd32dde6c,2020-06-29 17:59:56,Python,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"def hahaha(x,n):\n    string=''\n    while(x>0):\n        num=x%n\n        if(num>=10):\n            num=chr(num-10+ord('A'))\n            string=num+string\n        else:\n            string=str(num)+string\n        x=x//n\n    return string\n\nn = int(input())\n\nnum=0\nstring=''\nfor w in range(1,301):\n    x=w**2\n    string=hahaha(x,n)\n    if string==string[::-1]:\n        print(str(hahaha(w,n))+\"" \""+string)\n    string=''",ACCEPTED,197,3112
1277542466297716736,ea107e0118cb2128bb7f5bf44827ffeadd282506c79b4414093c578a45632409,2020-06-29 18:00:34,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\nusing namespace std;\nstring tran(int num, int bit)//进制转换函数\n{\n\tstring num_tran;\n\tint t, i = 0;\n\tdo\n\t{\n\t\tt = num % bit;\n\t\tif (t >= 0 || t <= 9)\n\t\t{\n\t\t\tnum_tran += t + '0';\n\t\t\ti++;\n\t\t}\n\t\telse if (t > 9)\n\t\t{\n\t\t\tnum_tran += t - 10 + 'a';\n\t\t\ti++;\n\t\t}\n\t\tnum /= bit;\n\t} while (num != 0);\n\tnum_tran[i] = '\\0';\n\treverse(num_tran.begin(), num_tran.end());\n\treturn num_tran;\n}\nint main()\n{\n\tint B, len, jud = 0;\n\tstring num_t;\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\tint num = i * i;\n\t\tnum_t = tran(num, B);\n\t\tfor (int i = 0, j = num_t.length(); i < num_t.length(); i++, j--)\n\t\t{\n\t\t\tif (num_t[i] == num_t[j-1])\n\t\t\t\tjud = 1;\n\t\t\telse\n\t\t\t{\n\t\t\t\tjud = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (jud)\n\t\t{\n\t\t\tcout << i << \"" \"" << num_t << endl;\n\t\t}\n\t}\n}",COMPILE_ERROR,0,0
1277543088375914496,4a56193e4e3aef88687c4b59a91d8be77df2f76f9682cde0c0a70959b66497ce,2020-06-29 18:03:02,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<string>\nusing namespace std;\n\nstring change(int n, int cs) {\n\tstring str;\n\tchar t;\n\tint m;\n\twhile (cs) {\n\t\tm = cs % n;\n\t\tif (m >= 10) {\n\t\t\tt = 'A' + (m - 10);\n\t\t}\n\t\telse\n\t\t\tt = m + '0';\n\t\tstr += t;\n\t\tcs /= n;\n\t}\n\treturn str;\n}\nbool test(string st) {\n\tint n = st.size();\n\tif (n == 1) \n\t{\n\t\treturn true;\n\t}\n\tint i = 0, j = n - 1;\n\tfor (; i < j; i++, j--) {\n\t\tif (st[i] != st[j])\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nint main()\n{\n\tint v;\n\tcin >> v;\n\tbool k;\n\tstring temp;\n\tint qqq;\n\tfor (int j = 1; j <= 300; j++)\n\t{\n\t\tqqq = j * j;\n\t\ttemp = change(v,qqq);\n\t\tif (test(temp))\n\t\t{\n\t\t\tcout << change(v,j) << \"" \"" << temp << endl;\n\t\t}\n\t}\n}",PARTIAL_ACCEPTED,47,408
1277543264293412864,5f4ef3bfb84eb385fcd1549bb6e0df6373a08d76e55e36213e62c1bcbd4ff0b5,2020-06-29 18:03:44,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<vector>\n#include<array>\n#include<map>\n#include<algorithm>\nusing namespace std;\nint n;\nstring change(int a,int B) {//B是进制\n\tstring s = \""\"";\n\tint i = 0;\n\tif (a == 0) {\n\t\ts += '0';\n\t\treturn s;\n\t}\n\twhile (a != 0) {\n\t\tint f = a % B;\n\t\tif (f < 10) {\n\t\t\ts += f + '0';\n\t\t}\n\t\telse {\n\t\t\ts += 'A' + f - 10;\n\t\t}\n\t\ta /= B;\n\t}\n\t//s字符串是反的\n\treturn s;\n}\nbool huiwen(string a) {\n\tint b = 1;\n\tif (a.size() % 2 == 0) {\n\t\tfor (int i = 0; i < a.size() / 2; i++) {\n\t\t\tif (a[i] != a[a.size() - 1 - i]) {\n\t\t\t\tb = 0;\n\t\t\t}\n\t\t}\n\t}\n\telse {\n\t\tfor (int i = 0; i < (a.size() - 1) / 2; i++){\n\t\t\tif (a[i] != a[a.size() - 1 - i]) {\n\t\t\t\tb = 0;\n\t\t\t}\n\n\t\t} \n\t}\n\tif (b == 1)return true;\n\treturn false;\n}\nint main() {\n\tcin >> n;\n\tint sq;\n\tstring sl;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tsq = i * i;\n\t\tsl = change(sq, n);\n\t\tif (huiwen(sl)) {\n\t\t\tcout << change(i,n) << \"" \"" << sl << endl;\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,41,424
1277543290616864768,ea107e0118cb2128bb7f5bf44827ffeadd282506c79b4414093c578a45632409,2020-06-29 18:03:50,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\nusing namespace std;\nstring tran(int num, int bit)//进制转换函数\n{\n\tstring num_tran;\n\tint t, i = 0;\n\tdo\n\t{\n\t\tt = num % bit;\n\t\tif (t >= 0 || t <= 9)\n\t\t{\n\t\t\tnum_tran += t + '0';\n\t\t\ti++;\n\t\t}\n\t\telse if (t > 9)\n\t\t{\n\t\t\tnum_tran += t - 10 + 'a';\n\t\t\ti++;\n\t\t}\n\t\tnum /= bit;\n\t} while (num != 0);\n\tnum_tran[i] = '\\0';\n\treverse(num_tran.begin(), num_tran.end());\n\treturn num_tran;\n}\nint main()\n{\n\tint B, jud = 0;\n\tstring num_t;\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\tint num = i * i;\n\t\tnum_t = tran(num, B);\n\t\tfor (int i = 0, j = num_t.length(); i < num_t.length(); i++, j--)\n\t\t{\n\t\t\tif (num_t[i] == num_t[j-1])\n\t\t\t\tjud = 1;\n\t\t\telse\n\t\t\t{\n\t\t\t\tjud = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (jud)\n\t\t{\n\t\t\tcout << i << \"" \"" << num_t << endl;\n\t\t}\n\t}\n}",COMPILE_ERROR,0,0
1277543781195251712,5f4ef3bfb84eb385fcd1549bb6e0df6373a08d76e55e36213e62c1bcbd4ff0b5,2020-06-29 18:05:47,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<vector>\n#include<array>\n#include<map>\n#include<algorithm>\nusing namespace std;\nint n;\nstring change(int a,int B) {//B是进制\n\tstring s = \""\"";\n\tint i = 0;\n\tif (a == 0) {\n\t\ts += '0';\n\t\treturn s;\n\t}\n\twhile (a != 0) {\n\t\tint f = a % B;\n\t\tif (f < 10) {\n\t\t\ts += f + '0';\n\t\t}\n\t\telse {\n\t\t\ts += 'A' + f - 10;\n\t\t}\n\t\ta /= B;\n\t}\n\t//s字符串是反的\n\treturn s;\n}\nbool huiwen(string a) {\n\tint b = 1;\n\tif (a.size() % 2 == 0) {\n\t\tfor (int i = 0; i < a.size() / 2; i++) {\n\t\t\tif (a[i] != a[a.size() - 1 - i]) {\n\t\t\t\tb = 0;\n\t\t\t}\n\t\t}\n\t}\n\telse {\n\t\tfor (int i = 0; i < (a.size() - 1) / 2; i++){\n\t\t\tif (a[i] != a[a.size() - 1 - i]) {\n\t\t\t\tb = 0;\n\t\t\t}\n\n\t\t} \n\t}\n\tif (b == 1)return true;\n\treturn false;\n}\nint main() {\n\tcin >> n;\n\tint sq;\n\tstring sl;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tsq = i * i;\n\t\tsl = change(sq, n);\n\t\tif (huiwen(sl)) {\n\t\t\tstring st = change(i, n),ss=\""\"";\n\t\t\tfor (int i = st.size() - 1; i >= 0; i--) {\n\t\t\t\tss += st[i];\n\t\t\t}\n\t\t\tcout << ss << \"" \"" << sl << endl;\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,37,512
1277544327289430016,ea107e0118cb2128bb7f5bf44827ffeadd282506c79b4414093c578a45632409,2020-06-29 18:07:57,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\nusing namespace std;\nstring tran(int num, int bit)//进制转换函数\n{\n\tstring num_tran;\n\tint t, i = 0;\n\tdo\n\t{\n\t\tt = num % bit;\n\t\tif (t >= 0 || t <= 9)\n\t\t{\n\t\t\tnum_tran += t + '0';\n\t\t\ti++;\n\t\t}\n\t\telse if (t > 9)\n\t\t{\n\t\t\tnum_tran += t - 10 + 'a';\n\t\t\ti++;\n\t\t}\n\t\tnum /= bit;\n\t} while (num != 0);\n\tnum_tran[i] = '\\0';\n\treverse(num_tran.begin(), num_tran.end());\n\treturn num_tran;\n}\nint main()\n{\n\tint B, jud = 0;\n\tstring num_t;\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\tint num = i * i;\n\t\tnum_t = tran(num, B);\n\t\tfor (int i = 0, j = num_t.length(); i < (int)num_t.length(); i++, j--)\n\t\t{\n\t\t\tif (num_t[i] == num_t[j-1])\n\t\t\t\tjud = 1;\n\t\t\telse\n\t\t\t{\n\t\t\t\tjud = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (jud)\n\t\t{\n\t\t\tcout << i << \"" \"" << num_t << endl;\n\t\t}\n\t}\n}",COMPILE_ERROR,0,0
1277544595938803712,ea107e0118cb2128bb7f5bf44827ffeadd282506c79b4414093c578a45632409,2020-06-29 18:09:01,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\nusing namespace std;\nstring tran(int num, int bit)//进制转换函数\n{\n\tstring num_tran;\n\tint t, i = 0;\n\tdo\n\t{\n\t\tt = num % bit;\n\t\tif (t >= 0 || t <= 9)\n\t\t{\n\t\t\tnum_tran += t + '0';\n\t\t\ti++;\n\t\t}\n\t\telse if (t > 9)\n\t\t{\n\t\t\tnum_tran += t - 10 + 'a';\n\t\t\ti++;\n\t\t}\n\t\tnum /= bit;\n\t} while (num != 0);\n\tnum_tran[i] = '\\0';\n\treverse(num_tran.begin(), num_tran.end());\n\treturn num_tran;\n}\nint main()\n{\n\tint B, jud = 0;\n\tstring num_t;\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\tint num = i * i;\n\t\tnum_t = tran(num, B);\n\t\tfor (int i = 0, j = num_t.length(); i < (int)num_t.length(); i++, j--)\n\t\t{\n\t\t\tif (num_t[i] == num_t[j-1])\n\t\t\t\tjud = 1;\n\t\t\telse\n\t\t\t{\n\t\t\t\tjud = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (jud)\n\t\t{\n\t\t\tcout << i << \"" \"" << num_t << endl;\n\t\t}\n\t}\n}",PARTIAL_ACCEPTED,39,512
1277545488327311360,4a56193e4e3aef88687c4b59a91d8be77df2f76f9682cde0c0a70959b66497ce,2020-06-29 18:12:34,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<string>\n#include <algorithm>\nusing namespace std;\n\nstring change(int n, int cs) {\n\tstring str;\n\tchar t;\n\tint m;\n\twhile (cs) {\n\t\tm = cs % n;\n\t\tif (m >= 10) {\n\t\t\tt = 'A' + (m - 10);\n\t\t}\n\t\telse\n\t\t\tt = m + '0';\n\t\tstr += t;\n\t\tcs /= n;\n\t}\n\treturn str;\n}\nbool test(string st) {\n\tint n = st.size();\n\tif (n == 1) \n\t{\n\t\treturn true;\n\t}\n\tint i = 0, j = n - 1;\n\tfor (; i < j; i++, j--) {\n\t\tif (st[i] != st[j])\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\nvoid mmm(string s)\n{\n\tfor (int sd = s.size(); sd >=0; sd++)\n\t{\n\t\tcout << s[sd];\n\t}\n}\nint main()\n{\n\tint v;\n\tcin >> v;\n\tbool k;\n\tstring temp;\n\tint qqq;\n\tstring out;\n\tfor (int j = 1; j <= 300; j++)\n\t{\n\t\tqqq = j * j;\n\t\ttemp = change(v,qqq);\n\t\tif (test(temp))\n\t\t{\n\t\t\tout = change(v, j);\n\t\t\treverse(out.begin(), out.end());\n\t\t\tcout <<out <<\"" \""<< temp << endl;\n\t\t}\n\t}\n}",ACCEPTED,42,532
1277546304454975488,3a483c97e80635c09e7231fda74b44a27914eee8e61b3aa5ee128ae2e1dab19b,2020-06-29 18:15:49,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nchar num[20] = {'0','1','2','3','4',\n                '5','6','7','8','9',\n                'A','B','C','D','E',\n                'F','G','H','I','J'};\n\nstruct tu{\n    char p[20];\n    char pz[10];\n    bool pan;\n    int length;\n    int n;\n    bool huiwen(char *s, int n){\n        for (int i=1;i<n;i++){\n            if (s[i] == s[n-1]) n--;\n            else return false;\n        }\n        return true;\n    }\n};\n\ntu zhen[305];\nint b;\nint main()\n{\n    cin >> b;\n    for (int i=1;i<=300;i++){\n        int j = i*i;\n        zhen[i].length = 1;\n        while(j != 0){//将平方数变成b进制\n            zhen[i].p[zhen[i].length] = num[j%b];\n            j /= b;\n            zhen[i].length += 1;\n        }\n        zhen[i].pan = zhen[i].huiwen(zhen[i].p, zhen[i].length);\n\n        if (zhen[i].pan){//将原始数变成b进制\n            int k = i;\n            zhen[i].n = 1;\n            while(k != 0){\n                zhen[i].pz[zhen[i].n] = num[k&b];\n                k /= b;\n                zhen[i].n += 1;\n            }\n        }\n    }\n\n    for (int i=1;i<=300;i++){\n        if (zhen[i].pan){\n            int k = zhen[i].n - 1;\n            for (;k>=1;k--){\n                cout << zhen[i].pz[k];\n            }\n            cout << \"" \"";\n            for (int j=1;j<zhen[i].length;j++){\n                cout << zhen[i].p[j];\n            }\n            cout << endl;\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,40,444
1277546542490116096,3a483c97e80635c09e7231fda74b44a27914eee8e61b3aa5ee128ae2e1dab19b,2020-06-29 18:16:46,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nchar num[20] = {'0','1','2','3','4',\n                '5','6','7','8','9',\n                'A','B','C','D','E',\n                'F','G','H','I','J'};\n\nstruct tu{\n    char p[20];\n    char pz[10];\n    bool pan;\n    int length;\n    int n;\n    bool huiwen(char *s, int n){\n        for (int i=1;i<n;i++){\n            if (s[i] == s[n-1]) n--;\n            else return false;\n        }\n        return true;\n    }\n};\n\ntu zhen[305];\nint b;\nint main()\n{\n    cin >> b;\n    for (int i=1;i<=300;i++){\n        int j = i*i;\n        zhen[i].length = 1;\n        while(j != 0){//将平方数变成b进制\n            zhen[i].p[zhen[i].length] = num[j%b];\n            j /= b;\n            zhen[i].length += 1;\n        }\n        zhen[i].pan = zhen[i].huiwen(zhen[i].p, zhen[i].length);\n\n        if (zhen[i].pan){//将原始数变成b进制\n            int k = i;\n            zhen[i].n = 1;\n            while(k != 0){\n                zhen[i].pz[zhen[i].n] = num[k%b];\n                k /= b;\n                zhen[i].n += 1;\n            }\n        }\n    }\n\n    for (int i=1;i<=300;i++){\n        if (zhen[i].pan){\n            int k = zhen[i].n - 1;\n            for (;k>=1;k--){\n                cout << zhen[i].pz[k];\n            }\n            cout << \"" \"";\n            for (int j=1;j<zhen[i].length;j++){\n                cout << zhen[i].p[j];\n            }\n            cout << endl;\n        }\n    }\n    return 0;\n}\n",ACCEPTED,32,512
1277546702074994688,57480949030af151ef53877a64aa8077b02f5a1624bde07439497c0c58bcc8bf,2020-06-29 18:17:24,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstring>\n#include<string.h>\n#include<cmath>\n#include<algorithm>\n#include<string>\n\nint huiwen(int n);\nstring intToA(int n,int raidx);\nusing namespace std;\nint main()\n{\n    int n;\n    cin>>n;\n    for(int i=1;;i++){\n        if(i==huiwen(i)){\n            int qwq=i*i;\n            string x;\n            x=intToA(qwq,n);\n            if(x==huiwen(x)){\n                cout<<intToA(i,n)<<\"" \""<<x;\n            }\n        }\n    };\n    return 0;\n}\n\nint huiwen(int n){\n    string m=to_string(n);\n    int a=0,b=0;\n    for(int i=0;i<m.size();i++){\n        a=n%10;\n        n=n/10;\n        b=b*10+a;\n    }\n    return b;\n}\nstring intToA(int n,int radix){\n    string ans=\""\"";\n    do\n    {\n        int t=n%radix;\n        if(t>=0&&t<=9)\n            ans+=t+'0';\n        else ans+=t-10+'a';\n        n/=radix;\n    }\n    while(n!=0);\n    reverse(ans.begin(),ans.end());\n    return ans;\n}\n",COMPILE_ERROR,0,0
1277546857633341440,ea107e0118cb2128bb7f5bf44827ffeadd282506c79b4414093c578a45632409,2020-06-29 18:18:01,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\nusing namespace std;\nstring tran(int num, int bit)//进制转换函数\n{\n\tstring num_tran;\n\tint t, i = 0;\n\tdo\n\t{\n\t\tt = num % bit;\n\t\tif (t >= 0 && t <= 9)\n\t\t{\n\t\t\tnum_tran += t + '0';\n\t\t\ti++;\n\t\t}\n\t\telse if (t > 9)\n\t\t{\n\t\t\tnum_tran += t - 10 + 'A';\n\t\t\ti++;\n\t\t}\n\t\tnum /= bit;\n\t} while (num != 0);\n\tnum_tran[i] = '\\0';\n\treverse(num_tran.begin(), num_tran.end());\n\treturn num_tran;\n}\nint main()\n{\n\tint B, jud = 0;\n\tstring num_t, num_x;\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\tint num = i * i;\n\t\tnum_x = tran(i, B);\n\t\tnum_t = tran(num, B);\n\t\tfor (int i = 0, j = num_t.length(); i < (int)num_t.length(); i++, j--)\n\t\t{\n\t\t\tif (num_t[i] == num_t[j-1])\n\t\t\t\tjud = 1;\n\t\t\telse\n\t\t\t{\n\t\t\t\tjud = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (jud)\n\t\t{\n\t\t\tcout << num_x << \"" \"" << num_t << endl;\n\t\t}\n\t}\n}",ACCEPTED,46,528
1277548660450066432,f58df442ca29dc2c3fb9bb818f338eeac62afaf552e1b2429f370277d7d6bb33,2020-06-29 18:25:11,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\nusing namespace std;\nstring Transformer(int n,int radix);\nint main()\n{\n    int B,sqr;\n    string C,D;\n    cin>>B;\n    for(int i=1;i<=300;i++)\n    {\n        sqr=i*i;\n        C=Transformer(B,sqr);\n        D=C;\n        reverse(C.begin(),C.end());\n        if(D==C)\n        {\n            cout<<Transformer(B,i)<<\"" \""<<D<<endl;\n        }\n    }\n    return 0;\n}\n\nstring Transformer(int n,int radix)\n{\n    string a=\""ABCDEFGHIJ\"";\n    string ans=\""\"";\n\twhile(n)\n    {\n        if(radix%n<10)\n        {\n            ans+=to_string(radix%n);\n        }\n        else\n        {\n            ans+=a[radix%n-10];\n        }\n        radix = radix / n;\n    }\n\treverse(ans.begin(),ans.end());\n\treturn ans;\t\n}",TIME_LIMIT_EXCEEDED,0,0
1277549545196552192,f58df442ca29dc2c3fb9bb818f338eeac62afaf552e1b2429f370277d7d6bb33,2020-06-29 18:28:41,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\nusing namespace std;\nstring Transformer(int n,int radix);\nint main()\n{\n    int B,sqr;\n    string C,D;\n    cin>>B;\n    for(int i=1;i<=300;i++)\n    {\n        sqr=i*i;\n        C=Transformer(B,sqr);\n        D=C;\n        reverse(C.begin(),C.end());\n        if(D==C)\n        {\n            cout<<Transformer(B,i)<<\"" \""<<D<<endl;\n        }\n    }\n    return 0;\n}\n\nstring Transformer(int n,int radix)\n{\n    string a=\""ABCDEFGHIJ\"";\n    string ans=\""\"";\n\twhile(n)\n    {\n        if(radix%n<10)\n        {\n            ans+=to_string(radix%n);\n        }\n        else\n        {\n            ans+=a[radix%n-10];\n        }\n        radix = radix / n;\n    }\n\treverse(ans.begin(),ans.end());\n\treturn ans;\t\n}",TIME_LIMIT_EXCEEDED,0,0
1277550177789870080,c3e6f8ec2d23f7f807edf9bf11527d181f7fd2c4e0ae98ec2be0571dd32dde6c,2020-06-29 18:31:12,Python,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"def hahaha(x,n):\n    string=''\n    while(x>0):\n        num=x%n\n        if(num>=10):\n            num=chr(num-10+ord('A'))\n            string=num+string\n        else:\n            string=str(num)+string\n        x=x//n\n    return string\n\ndef lalala(num):\n    counter = 0\n    for x in range(1,11):\n        string = hahaha(num,x)\n        if string==string[::-1]:\n            counter+=1\n    if counter>=2:\n        return True\n    else:\n        return False\n\n\n\nn,s = [int(x) for x in input().split(\"" \"")]\n\nlis = []\n\nwhile len(lis)<=n:\n    if lalala(s):\n        lis.append(s)\n\nfor x in lis:\n    print(x)\n\n",TIME_LIMIT_EXCEEDED,0,0
1277550429485858816,e4e8723a68604b3d116a74adee1ff40addbba3de59cc74765c8acb9af0ecd2fc,2020-06-29 18:32:12,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <string>\nusing namespace std;\nint Atoint(string s, int radix);\nstring intToA(int n, int radix);\nint main() {\n\tint rad;\n\tint pow;\n\tstring rnum;\n\tcin >> rad;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tpow = i * i;\n\t\trnum = intToA(pow, rad);\n\t\treverse(rnum.begin(), rnum.end());\n\t\t\tif (intToA(pow, rad) == rnum) {\n\t\t\t\tcout << intToA(i, rad) << ' ' << intToA(i * i, rad)<<endl;\n\t\t\t}\n\t}\n\treturn 0;\n}\nstring intToA(int n, int radix)    //n是待转数字，radix是指定的进制\n{\n\tstring ans = \""\"";\n\tdo {\n\t\tint t = n % radix;\n\t\tif (t >= 0 && t <= 9)    ans += t + '0';\n\t\telse ans += t - 10 + 'a';\n\t\tn /= radix;\n\t} while (n != 0);    //使用do{}while（）以防止输入为0的情况\n\treverse(ans.begin(), ans.end());\n\treturn ans;\n}",PARTIAL_ACCEPTED,32,488
1277550575745425408,299338d5ab323b9a652bcf61b728fe1bf6dc2331e8b6c1af6ef92ea19022f137,2020-06-29 18:32:47,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<stdio.h>\n#include<algorithm>\n#include<iostream>\nusing namespace std;\nint s[1000];\nint a[1000];\nint t=0;\nint ishuiwen(int a,int b)\n{\n\tint r=0;\n\twhile(a)\n\t{\n\t\ts[++r]=a%b;\n\t\ta/=b;\n\t}\n\tchar str1[1000];\n\tchar str2[1000];\n\tfor(int i=0;i<r;i++)\n\t\tstr1[i]=(char)s[i+1]-'0';\n\tfor(int i=0;i<r;i++)\n\t\tstr2[i]=str1[i];\n\treverse(str1,str1+r);\n\tfor(int i=0;i<r;i++)\n\t\tif(str1[i]!=str2[i])\n\t\t\treturn 0;\n\t\t\treturn 1;\t\t\n}\nint main()\n{\t\n\tint N,S;\n\tint m=0;\n\tint flag=-1;\n\tscanf(\""%d%d\"",&N,&S);\n\tfor(int i=S;i<10000;i++)\n\t{\t\n\t\tflag=-1;\n\t\tfor(int n=2;n<=10;n++)\n\t\t{\t\n\t\t\tif(ishuiwen(i,n))\n\t\t\t{\n\t\t\t\tm=m+1;\n\t\t\t\tif(m>=2)\n\t\t\t\t{\n\t\t\t\t\tflag=1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(flag)\n\t\t{\n\t\t\ta[t]=i;\n\t\t\tt++;\n\t\t\tif(t>=N)\n\t\t\tbreak;\t\n\t\t}\n\t}\n\tfor(int i=0;i<N;i++)\n\t\tprintf(\""%d\\n\"",a[i]);\n\treturn 0;\n}",WRONG_ANSWER,26,384
1277551032173789184,e4e8723a68604b3d116a74adee1ff40addbba3de59cc74765c8acb9af0ecd2fc,2020-06-29 18:34:36,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <string>\nusing namespace std;\nint Atoint(string s, int radix);\nstring intToA(int n, int radix);\nint main() {\n\tint rad;\n\tint pow;\n\tstring rnum;\n\tcin >> rad;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tpow = i * i;\n\t\trnum = intToA(pow, rad);\n\t\treverse(rnum.begin(), rnum.end());\n\t\t\tif (intToA(pow, rad) == rnum) {\n\t\t\t\tcout << intToA(i, rad) << ' ' << intToA(i * i, rad)<<endl;\n\t\t\t}\n\t}\n\treturn 0;\n}\nstring intToA(int n, int radix)    //n是待转数字，radix是指定的进制\n{\n\tstring ans = \""\"";\n\tdo {\n\t\tint t = n % radix;\n\t\tif (t >= 0 && t <= 9)    ans += t + '0';\n\t\telse ans += t - 10 + 'A';\n\t\tn /= radix;\n\t} while (n != 0);    //使用do{}while（）以防止输入为0的情况\n\treverse(ans.begin(), ans.end());\n\treturn ans;\n}",ACCEPTED,39,424
1277551199862063104,c3e6f8ec2d23f7f807edf9bf11527d181f7fd2c4e0ae98ec2be0571dd32dde6c,2020-06-29 18:35:16,Python,50.0,1277062760129622024,1267449136707624960,1049226397448056832,"def hahaha(x,n):\n    string=''\n    while(x>0):\n        num=x%n\n        if(num>=10):\n            num=chr(num-10+ord('A'))\n            string=num+string\n        else:\n            string=str(num)+string\n        x=x//n\n    return string\n\ndef lalala(num):\n    counter = 0\n    for x in range(2,11):\n        string = hahaha(num,x)\n        if string==string[::-1]:\n            counter+=1\n    if counter>=2:\n        return True\n    else:\n        return False\n\nn,s = [int(x) for x in input().split(\"" \"")]\n\nlis = []\n\nwhile len(lis)<n:\n    if lalala(s):\n        lis.append(s)\n    s+=1\n\nfor x in lis:\n    print(x)",PARTIAL_ACCEPTED,295,3200
1277551323573059584,299338d5ab323b9a652bcf61b728fe1bf6dc2331e8b6c1af6ef92ea19022f137,2020-06-29 18:35:45,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<stdio.h>\n#include<algorithm>\n#include<iostream>\nusing namespace std;\nint s[1000];\nint a[1000];\nint t=0;\nint ishuiwen(int a,int b)\n{\n\tint r=0;\n\twhile(a)\n\t{\n\t\ts[++r]=a%b;\n\t\ta/=b;\n\t}\n\tchar str1[1000];\n\tchar str2[1000];\n\tfor(int i=0;i<r;i++)\n\t\tstr1[i]=(char)s[i+1]-'0';\n\tfor(int i=0;i<r;i++)\n\t\tstr2[i]=str1[i];\n\treverse(str1,str1+r);\n\tfor(int i=0;i<r;i++)\n\t\tif(str1[i]!=str2[i])\n\t\t\treturn 0;\n\t\t\treturn 1;\t\t\n}\nint main()\n{\t\n\tint N,S;\n\tint m=0;\n\tint flag=-1;\n\tscanf(\""%d%d\"",&N,&S);\n\tfor(int i=S+1;i<10000;i++)\n\t{\t\n\t\tflag=-1;\n\t\tfor(int n=2;n<=10;n++)\n\t\t{\t\n\t\t\tif(ishuiwen(i,n))\n\t\t\t{\n\t\t\t\tm=m+1;\n\t\t\t\tif(m>=2)\n\t\t\t\t{\n\t\t\t\t\tflag=1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(flag)\n\t\t{\n\t\t\ta[t]=i;\n\t\t\tt++;\n\t\t\tif(t==N)\n\t\t\tbreak;\t\n\t\t}\n\t}\n\tfor(int i=0;i<N;i++)\n\t\tprintf(\""%d\\n\"",a[i]);\n\treturn 0;\n}",PARTIAL_ACCEPTED,35,424
1277551396419731456,539cb65160a7009fec6386fb40555fc03abd87cda9efad94c2441feaf9ca5a23,2020-06-29 18:36:03,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"//Project - Palindromic Squares\n#include <iostream>\n#include <math.h>\nusing namespace std;\n\nint main(){\n    int B;\n    cin >> B;\n\n    for(int i=1;i<=300;i++){\n        int j = pow(i,2);\n        int iSum=0;\n        while(j>0){\n            iSum += iSum*B+j%B;\n            j/=B;\n        }\n        if (iSum==i)\n            cout << i << \"" \"" << pow(i,2) << endl;\n    }\n\n    return 0;\n}\n",WRONG_ANSWER,30,488
1277551626754129920,299338d5ab323b9a652bcf61b728fe1bf6dc2331e8b6c1af6ef92ea19022f137,2020-06-29 18:36:58,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<stdio.h>\n#include<algorithm>\n#include<iostream>\nusing namespace std;\nint s[1000];\nint a[1000];\nint t=0;\nint ishuiwen(int a,int b)\n{\n\tint r=0;\n\twhile(a)\n\t{\n\t\ts[++r]=a%b;\n\t\ta/=b;\n\t}\n\tchar str1[1000];\n\tchar str2[1000];\n\tfor(int i=0;i<r;i++)\n\t\tstr1[i]=(char)s[i+1]-'0';\n\tfor(int i=0;i<r;i++)\n\t\tstr2[i]=str1[i];\n\treverse(str1,str1+r);\n\tfor(int i=0;i<r;i++)\n\t\tif(str1[i]!=str2[i])\n\t\t\treturn 0;\n\t\t\treturn 1;\t\t\n}\nint main()\n{\t\n\tint N,S;\n\tint m=0;\n\tint flag=-1;\n\tscanf(\""%d%d\"",&N,&S);\n\tfor(int i=S+1;i<10000;i++)\n\t{\t\n\t\tflag=-1;\n\t\tfor(int n=2;n<=10;n++)\n\t\t{\t\n\t\t\tif(ishuiwen(i,n))\n\t\t\t{\n\t\t\t\tm=m+1;\n\t\t\t\tif(m>=3)\n\t\t\t\t{\n\t\t\t\t\tflag=1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(flag)\n\t\t{\n\t\t\ta[t]=i;\n\t\t\tt++;\n\t\t\tif(t==N)\n\t\t\tbreak;\t\n\t\t}\n\t}\n\tfor(int i=0;i<N;i++)\n\t\tprintf(\""%d\\n\"",a[i]);\n\treturn 0;\n}",PARTIAL_ACCEPTED,36,508
1277551797437136896,c3e6f8ec2d23f7f807edf9bf11527d181f7fd2c4e0ae98ec2be0571dd32dde6c,2020-06-29 18:37:38,Python,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"def hahaha(x,n):\n    string=''\n    while(x>0):\n        num=x%n\n        if(num>=10):\n            num=chr(num-10+ord('A'))\n            string=num+string\n        else:\n            string=str(num)+string\n        x=x//n\n    return string\n\ndef lalala(num):\n    counter = 0\n    for x in range(2,11):\n        string = hahaha(num,x)\n        if string==string[::-1]:\n            counter+=1\n    if counter>=2:\n        return True\n    else:\n        return False\n\nn,s = [int(x) for x in input().split(\"" \"")]\ns+=1\nlis = []\n\nwhile len(lis)<n:\n    if lalala(s):\n        lis.append(s)\n    s+=1\n\nfor x in lis:\n    print(x)",ACCEPTED,297,3040
1277552243736248320,299338d5ab323b9a652bcf61b728fe1bf6dc2331e8b6c1af6ef92ea19022f137,2020-06-29 18:39:25,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<stdio.h>\n#include<algorithm>\n#include<iostream>\nusing namespace std;\nint s[1000];\nint a[1000];\nint t=0;\nint ishuiwen(int a,int b)\n{\n\tint r=0;\n\twhile(a)\n\t{\n\t\ts[++r]=a%b;\n\t\ta/=b;\n\t}\n\tchar str1[1000];\n\tchar str2[1000];\n\tfor(int i=0;i<r;i++)\n\t\tstr1[i]=(char)s[i+1]-'0';\n\tfor(int i=0;i<r;i++)\n\t\tstr2[i]=str1[i];\n\treverse(str1,str1+r);\n\tfor(int i=0;i<r;i++)\n\t\tif(str1[i]!=str2[i])\n\t\t\treturn 0;\n\t\t\treturn 1;\t\t\n}\nint main()\n{\t\n\tint N,S;\n\tint m=0;\n\tint flag=-1;\n\tscanf(\""%d%d\"",&N,&S);\n\tfor(int i=S+1;i<10000;i++)\n\t{\t\n\t\tflag=-1;\n\t\tfor(int n=2;n<=10;n++)\n\t\t{\t\n\t\t\tif(ishuiwen(i,n))\n\t\t\t{\n\t\t\t\tm=m+1;\n\t\t\t\tif(m>=3)\n\t\t\t\t{\n\t\t\t\t\tflag=1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(flag)\n\t\t{\n\t\t\ta[t]=i;\n\t\t\t++t;\n\t\t\tif(t==N)\n\t\t\tbreak;\t\n\t\t}\n\t}\n\tfor(int i=0;i<N;i++)\n\t\tprintf(\""%d\\n\"",a[i]);\n\treturn 0;\n}",PARTIAL_ACCEPTED,34,512
1277552987336015872,4a56193e4e3aef88687c4b59a91d8be77df2f76f9682cde0c0a70959b66497ce,2020-06-29 18:42:22,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<string>\n#include <algorithm>\nusing namespace std;\nstring change(int n, int cs) {\n\tstring str;\n\tchar t;\n\tint m;\n\twhile (cs) {\n\t\tm = cs % n;\n\t\tif (m >= 10) {\n\t\t\tt = 'A' + (m - 10);\n\t\t}\n\t\telse\n\t\t\tt = m + '0';\n\t\tstr += t;\n\t\tcs /= n;\n\t}\n\treturn str;\n}\n\nbool test(string st) {\n\tint n = st.size();\n\tif (n == 1)\n\t{\n\t\treturn true;\n\t}\n\tint i = 0, j = n - 1;\n\tfor (; i < j; i++, j--) {\n\t\tif (st[i] != st[j])\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nint main()\n{\n\tint count = 0;\n\tint sum = 0;\n\tint n, s;\n\tcin >> n >> s;\n\tstring temp;\n\tbool k;\n\tfor (int j = 25; j <= 1000; j++)\n\t{\n\t\tcount = 0;\n\t\tfor (int i = 2; i <= 10; i++)\n\t\t{\n\t\t\ttemp = change(i, j);\n\t\t\tk = test(temp);\n\t\t\tif (k)\n\t\t\t{\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tif (count == 2)\n\t\t\t{\n\t\t\t\tsum++;\n\t\t\t\tcout << j << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t}\n\t\tif (sum == n) break;\n\t}\n}",WRONG_ANSWER,36,512
1277552997121327104,299338d5ab323b9a652bcf61b728fe1bf6dc2331e8b6c1af6ef92ea19022f137,2020-06-29 18:42:24,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n#include<iostream>\n#include<algorithm>\nusing namespace std;\nint s[1000];\nchar toword(int a)\n{\n\tif(a>=10)\n\treturn 'A'+a-10; \n}\nbool ishuiwen(int a,int b){\n    int r=0;\n    while(a)\n\t{\n       \ts[++r]=a%b;\n        a/=b;\n    }\n\tchar str[1000];\n\tchar str1[1000];\n\tfor(int i=0;i<r;i++)\n\t{\n\t\tstr[i]=(char)(s[i+1]-'0');\n\t}\n\tfor(int i=0;i<r;i++)\n\t\tstr1[i]=str[i];\n\treverse(str,str+r);\n\tfor(int i=0;i<r;i++)\n\tif(str1[i]!=str[i])\n\t\t\treturn 0;\n\t\t\treturn 1;\n}\nvoid jz(int a,int b)\n{\n    int r=0;\n    while(a){\n        s[++r]=a%b;\n        a/=b;\n    }\n    s[0]=r;\n    for(int i=s[0];i>=1;i--)\n    {\n    \tif(s[i]>=10)\n    \t\tcout<<toword(s[i]);\n    \telse \n    \t\tcout<<s[i];\n    }\n}\nint main()\n{\t\n\tint n;\n\tscanf(\""%d\"",&n);\n\tfor(int i=1;i<=300;i++)\n\t{\n\t\tif(ishuiwen(i*i,n))\n\t\t{\n\t\t\tjz(i,n);\n\t\t\tcout<<' ';\n\t\t\tjz(i*i,n);\n\t\t\tcout<<endl; \n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,43,496
1277553417256361984,4a56193e4e3aef88687c4b59a91d8be77df2f76f9682cde0c0a70959b66497ce,2020-06-29 18:44:05,C++,50.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<string>\n#include <algorithm>\nusing namespace std;\nstring change(int n, int cs) {\n\tstring str;\n\tchar t;\n\tint m;\n\twhile (cs) {\n\t\tm = cs % n;\n\t\tif (m >= 10) {\n\t\t\tt = 'A' + (m - 10);\n\t\t}\n\t\telse\n\t\t\tt = m + '0';\n\t\tstr += t;\n\t\tcs /= n;\n\t}\n\treturn str;\n}\n\nbool test(string st) {\n\tint n = st.size();\n\tif (n == 1)\n\t{\n\t\treturn true;\n\t}\n\tint i = 0, j = n - 1;\n\tfor (; i < j; i++, j--) {\n\t\tif (st[i] != st[j])\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nint main()\n{\n\tint count = 0;\n\tint sum = 0;\n\tint n, s;\n\tcin >> n >> s;\n\tstring temp;\n\tbool k;\n\tfor (int j = s+1; j <= 1000; j++)\n\t{\n\t\tcount = 0;\n\t\tfor (int i = 2; i <= 10; i++)\n\t\t{\n\t\t\ttemp = change(i, j);\n\t\t\tk = test(temp);\n\t\t\tif (k)\n\t\t\t{\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tif (count == 2)\n\t\t\t{\n\t\t\t\tsum++;\n\t\t\t\tcout << j << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t}\n\t\tif (sum == n) break;\n\t}\n}",PARTIAL_ACCEPTED,32,592
1277553709335109632,539cb65160a7009fec6386fb40555fc03abd87cda9efad94c2441feaf9ca5a23,2020-06-29 18:45:14,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"//Project - Palindromic Squares\n#include <iostream>\n#include <math.h>\nusing namespace std;\n\nint main(){\n    int B;\n    cin >> B;\n\n    for(int i=1;i<=300;i++){\n        int j = pow(i,2);\n        int iSum=0;\n        while(j>0){\n            iSum = iSum*B+j%B;\n            j /= B;\n            //cout << j << endl;\n        }\n        //cout << \""data: \"" << iSum << \"" \"" << pow(i,2) << endl;\n        if (iSum==pow(i,2))\n            cout << i << \"" \"" << pow(i,2) << endl;\n    }\n\n    return 0;\n}\n",PARTIAL_ACCEPTED,36,520
1277553733674663936,4a56193e4e3aef88687c4b59a91d8be77df2f76f9682cde0c0a70959b66497ce,2020-06-29 18:45:20,C++,60.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<string>\n#include <algorithm>\nusing namespace std;\nstring change(int n, int cs) {\n\tstring str;\n\tchar t;\n\tint m;\n\twhile (cs) {\n\t\tm = cs % n;\n\t\tif (m >= 10) {\n\t\t\tt = 'A' + (m - 10);\n\t\t}\n\t\telse\n\t\t\tt = m + '0';\n\t\tstr += t;\n\t\tcs /= n;\n\t}\n\treturn str;\n}\n\nbool test(string st) {\n\tint n = st.size();\n\tif (n == 1)\n\t{\n\t\treturn true;\n\t}\n\tint i = 0, j = n - 1;\n\tfor (; i < j; i++, j--) {\n\t\tif (st[i] != st[j])\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nint main()\n{\n\tint count = 0;\n\tint sum = 0;\n\tint n, s;\n\tcin >> n >> s;\n\tstring temp;\n\tbool k;\n\tfor (int j = s+1; j <= 10000; j++)\n\t{\n\t\tcount = 0;\n\t\tfor (int i = 2; i <= 10; i++)\n\t\t{\n\t\t\ttemp = change(i, j);\n\t\t\tk = test(temp);\n\t\t\tif (k)\n\t\t\t{\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tif (count == 2)\n\t\t\t{\n\t\t\t\tsum++;\n\t\t\t\tcout << j << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t}\n\t\tif (sum == n) break;\n\t}\n}",PARTIAL_ACCEPTED,36,512
1277553743443189760,299338d5ab323b9a652bcf61b728fe1bf6dc2331e8b6c1af6ef92ea19022f137,2020-06-29 18:45:22,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<stdio.h>\n#include<algorithm>\n#include<iostream>\nusing namespace std;\nint s[1000];\nint a[1000];\nint t=0;\nint ishuiwen(int a,int b)\n{\n\tint r=0;\n\twhile(a)\n\t{\n\t\ts[++r]=a%b;\n\t\ta/=b;\n\t}\n\ts[0]=r;\n\tchar str1[1000];\n\tchar str2[1000];\n\tfor(int i=0;i<r;i++)\n\t\tstr1[i]=(char)(s[i+1]-'0');\n\tfor(int i=0;i<r;i++)\n\t\tstr2[i]=str1[i];\n\treverse(str1,str1+r);\n\tfor(int i=0;i<r;i++)\n\t\tif(str1[i]!=str2[i])\n\t\t\treturn 0;\n\t\t\treturn 1;\t\t\n}\nint main()\n{\t\n\tint N,S;\n\tint m=0;\n\tint flag=-1;\n\tscanf(\""%d%d\"",&N,&S);\n\tfor(int i=S+1;i<10000;i++)\n\t{\t\n\t\tflag=-1;\n\t\tfor(int n=2;n<=10;n++)\n\t\t{\t\n\t\t\tif(ishuiwen(i,n))\n\t\t\t{\n\t\t\t\tm=m+1;\n\t\t\t\tif(m>=3)\n\t\t\t\t{\n\t\t\t\t\tflag=1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(flag)\n\t\t{\n\t\t\ta[t]=i;\n\t\t\t++t;\n\t\t\tif(t==N)\n\t\t\tbreak;\t\n\t\t}\n\t}\n\tfor(int i=0;i<N;i++)\n\t\tprintf(\""%d\\n\"",a[i]);\n\treturn 0;\n}",PARTIAL_ACCEPTED,25,420
1277553837672431616,4a56193e4e3aef88687c4b59a91d8be77df2f76f9682cde0c0a70959b66497ce,2020-06-29 18:45:45,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<string>\n#include <algorithm>\nusing namespace std;\nstring change(int n, int cs) {\n\tstring str;\n\tchar t;\n\tint m;\n\twhile (cs) {\n\t\tm = cs % n;\n\t\tif (m >= 10) {\n\t\t\tt = 'A' + (m - 10);\n\t\t}\n\t\telse\n\t\t\tt = m + '0';\n\t\tstr += t;\n\t\tcs /= n;\n\t}\n\treturn str;\n}\n\nbool test(string st) {\n\tint n = st.size();\n\tif (n == 1)\n\t{\n\t\treturn true;\n\t}\n\tint i = 0, j = n - 1;\n\tfor (; i < j; i++, j--) {\n\t\tif (st[i] != st[j])\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nint main()\n{\n\tint count = 0;\n\tint sum = 0;\n\tint n, s;\n\tcin >> n >> s;\n\tstring temp;\n\tbool k;\n\tfor (int j = s+1; j <= 1000000; j++)\n\t{\n\t\tcount = 0;\n\t\tfor (int i = 2; i <= 10; i++)\n\t\t{\n\t\t\ttemp = change(i, j);\n\t\t\tk = test(temp);\n\t\t\tif (k)\n\t\t\t{\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tif (count == 2)\n\t\t\t{\n\t\t\t\tsum++;\n\t\t\t\tcout << j << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t}\n\t\tif (sum == n) break;\n\t}\n}",ACCEPTED,31,496
1277555480002494464,299338d5ab323b9a652bcf61b728fe1bf6dc2331e8b6c1af6ef92ea19022f137,2020-06-29 18:52:16,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<stdio.h>\n#include<algorithm>\n#include<iostream>\nusing namespace std;\nint s[1000];\nint a[1000];\nint t=0;\nint ishuiwen(int a,int b)\n{\n\tint r=0;\n\twhile(a)\n\t{\n\t\ts[++r]=a%b;\n\t\ta/=b;\n\t}\n\ts[0]=r;\n\tchar str1[1000];\n\tchar str2[1000];\n\tfor(int i=0;i<r;i++)\n\t\tstr1[i]=(char)(s[i+1]-'0');\n\tfor(int i=0;i<r;i++)\n\t\tstr2[i]=str1[i];\n\treverse(str1,str1+r);\n\tfor(int i=0;i<r;i++)\n\t\tif(str1[i]!=str2[i])\n\t\t\treturn 0;\n\t\t\treturn 1;\t\t\n}\nint main(){\n    int n,s;\n    cin>>n>>s;\n    int ans=0;\n    for(int i=s+1;ans!=n;i++){\n        int cnt=0;\n        for(int j=2;j<=10&&cnt<2;j++){\n            if(ishuiwen(i,j))cnt++;//在j进制下i为回文数，计数cnt++ \n        }\n        if(cnt>=2)printf(\""%d\\n\"",i),ans++;//若计数不小于2，则输出，答案计数ans++ \n    }\n    return 0;\n}",ACCEPTED,33,500
1277556818958548992,539cb65160a7009fec6386fb40555fc03abd87cda9efad94c2441feaf9ca5a23,2020-06-29 18:57:36,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <math.h>\nusing namespace std;\n\nint main(){\n    int B;\n    cin >> B;\n\n    for (int i=1;i<=300;i++){\n        int j = pow(i,2);\n        int a[9]={0};\n        int k=0;\n        while(j>0){\n            a[k]=j%B;\n            j /= B;\n            k++;\n        }\n        int sum1=0,sum2=0;\n        for (int x=0;x<k;x++)\n            sum1 += a[x]*pow(B,x);\n        for (int x=0;x<k;x++)\n            sum2 += a[k-x-1]*pow(B,x);\n        if (sum1==sum2)\n            cout << i << \"" \"" << pow(i,2) << endl;\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,38,512
1277556878295359488,539cb65160a7009fec6386fb40555fc03abd87cda9efad94c2441feaf9ca5a23,2020-06-29 18:57:50,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <math.h>\nusing namespace std;\n\nint main(){\n    int B;\n    cin >> B;\n\n    for (int i=1;i<=300;i++){\n        int j = pow(i,2);\n        int a[9]={0};\n        int k=0;\n        while(j>0){\n            a[k]=j%B;\n            j /= B;\n            k++;\n        }\n        int sum1=0,sum2=0;\n        for (int x=0;x<k;x++)\n            sum1 += a[x]*pow(B,x);\n        for (int x=0;x<k;x++)\n            sum2 += a[k-x-1]*pow(B,x);\n        if (sum1==sum2)\n            cout << i << \"" \"" << pow(i,2) << endl;\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,42,512
1277557201382596608,5f4ef3bfb84eb385fcd1549bb6e0df6373a08d76e55e36213e62c1bcbd4ff0b5,2020-06-29 18:59:07,C++,50.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include<vector>\n#include<array>\n#include<map>\n#include<algorithm>\nusing namespace std;\nint n,m;\nstring change(int a,int B) {//B是进制\n\tstring s = \""\"";\n\tint i = 0;\n\tif (a == 0) {\n\t\ts += '0';\n\t\treturn s;\n\t}\n\twhile (a != 0) {\n\t\tint f = a % B;\n\t\tif (f < 10) {\n\t\t\ts += f + '0';\n\t\t}\n\t\telse {\n\t\t\ts += 'A' + f - 10;\n\t\t}\n\t\ta /= B;\n\t}\n\t//s字符串是反的\n\treturn s;\n}\nbool huiwen(string a) {\n\tint b = 1;\n\tif (a.size() % 2 == 0) {\n\t\tfor (int i = 0; i < a.size() / 2; i++) {\n\t\t\tif (a[i] != a[a.size() - 1 - i]) {\n\t\t\t\tb = 0;\n\t\t\t}\n\t\t}\n\t}\n\telse {\n\t\tfor (int i = 0; i < (a.size() - 1) / 2; i++){\n\t\t\tif (a[i] != a[a.size() - 1 - i]) {\n\t\t\t\tb = 0;\n\t\t\t}\n\n\t\t} \n\t}\n\tif (b == 1)return true;\n\treturn false;\n}\nint main() {\n\tcin >> n>>m;//找到n个\n\tint k = 0;\n\twhile (k < n) {\n\t\tint temp = 0;\n\t\tfor (int i = 2; i <= 10; i++) {\n\t\t\tif (huiwen(change(m, i))) {\n\t\t\t\ttemp++;\n\t\t\t}\n\t\t}\n\t\tif (temp >= 2) {\n\t\t\tcout << m << endl;\n\t\t\tk++;\n\t\t}\n\t\tm++;\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,38,512
1277557433424084992,ea107e0118cb2128bb7f5bf44827ffeadd282506c79b4414093c578a45632409,2020-06-29 19:00:02,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\nusing namespace std;\nstring tran(int num, int bit)//进制转换函数\n{\n\tstring num_tran;\n\tint t, i = 0;\n\tdo\n\t{\n\t\tt = num % bit;\n\t\tif (t >= 0 && t <= 9)\n\t\t{\n\t\t\tnum_tran += t + '0';\n\t\t\ti++;\n\t\t}\n\t\telse if (t > 9)\n\t\t{\n\t\t\tnum_tran += t - 10 + 'A';\n\t\t\ti++;\n\t\t}\n\t\tnum /= bit;\n\t} while (num != 0);\n\tnum_tran[i] = '\\0';\n\treverse(num_tran.begin(), num_tran.end());\n\treturn num_tran;\n}\nint main()\n{\n\tint N, S, num, jud;\n\tint geshu = 0;\n\tstring num_t;\n\tcin >> N >> S;\n\tfor (int i = 1; i <= 10000; i++)\n\t{\n\t\tint cishu = 0;\n\n\t\tfor (int j = 2; j <= 10; j++)\n\t\t{\n\t\t\tnum = S + i;\n\t\t\tnum_t = tran(num, j);\n\t\t\tfor (int k = 0, l = num_t.length(); k < (int)num_t.length(); k++, l--)\n\t\t\t{\n\t\t\t\tif (num_t[k] == num_t[l - 1])\n\t\t\t\t\tjud = 1;\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tjud = 0;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (jud)\n\t\t\t{\n\t\t\t\tcishu++;\n\t\t\t}\n\t\t\tif (cishu >= 2)\n\t\t\t{\n\t\t\t\tcout << num << endl;\n\t\t\t\tgeshu++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (geshu==N)\n\t\t\tbreak;\n\t}\n}",ACCEPTED,42,456
1277558627655680000,5f4ef3bfb84eb385fcd1549bb6e0df6373a08d76e55e36213e62c1bcbd4ff0b5,2020-06-29 19:04:47,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include<vector>\n#include<array>\n#include<map>\n#include<algorithm>\nusing namespace std;\nint n,m;\nstring change(int a,int B) {//B是进制\n\tstring s = \""\"";\n\tint i = 0;\n\tif (a == 0) {\n\t\ts += '0';\n\t\treturn s;\n\t}\n\twhile (a != 0) {\n\t\tint f = a % B;\n\t\tif (f < 10) {\n\t\t\ts += f + '0';\n\t\t}\n\t\telse {\n\t\t\ts += 'A' + f - 10;\n\t\t}\n\t\ta /= B;\n\t}\n\t//s字符串是反的\n\treturn s;\n}\nbool huiwen(string a) {\n\tint b = 1;\n\tif (a.size() % 2 == 0) {\n\t\tfor (int i = 0; i < a.size() / 2; i++) {\n\t\t\tif (a[i] != a[a.size() - 1 - i]) {\n\t\t\t\tb = 0;\n\t\t\t}\n\t\t}\n\t}\n\telse {\n\t\tfor (int i = 0; i < (a.size() - 1) / 2; i++){\n\t\t\tif (a[i] != a[a.size() - 1 - i]) {\n\t\t\t\tb = 0;\n\t\t\t}\n\n\t\t} \n\t}\n\tif (b == 1)return true;\n\treturn false;\n}\nint main() {\n\tcin >> n>>m;//找到n个\n\tint k = 0;\n\tm++;\n\twhile (k < n) {\n\t\tint temp = 0;\n\t\tfor (int i = 2; i <= 10; i++) {\n\t\t\tif (huiwen(change(m, i))) {\n\t\t\t\ttemp++;\n\t\t\t}\n\t\t}\n\t\tif (temp >= 2) {\n\t\t\tcout << m << endl;\n\t\t\tk++;\n\t\t}\n\t\tm++;\n\t}\n\treturn 0;\n}",ACCEPTED,37,512
1277558708467326976,539cb65160a7009fec6386fb40555fc03abd87cda9efad94c2441feaf9ca5a23,2020-06-29 19:05:06,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <math.h>\nusing namespace std;\n\nint main(){\n    int B;\n    cin >> B;\n\n    for (int i=1;i<=300;i++){\n        int j = pow(i,2);\n        int a[9]={0};\n        int k=0;\n        while(j>0){\n            a[k]=j%B;\n            j /= B;\n            k++;\n        }\n        for (int x=0;x<k;x++){\n            if (a[x]!=a[k-1-x])\n                break;\n            else if(x==k-1)\n                cout << i << \"" \"" << pow(i,2) << endl;\n        }\n\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,43,640
1277559260001533952,5f71a9d5537f24730fd564649e838059c7274bb787bc8eac8c4cd5b14c9f623d,2020-06-29 19:07:18,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nchar a[20] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I' };\nstring transfer(int n,int b){//转成n进制的数\n\tint m = b;\n\tstring s=\""\"";\n\twhile (m > 0) {\n\t\ts = a[m%n]+s;\n\t\tm = m / n;\n\t}\n\treturn s;\n}\nint main() {\n\tint n;\n\tcin >> n;\n\tfor (int i = 1; i <= 300; i++){\n\t\tstring s = transfer(n, i*i);\n\t\treverse(s.begin(), s.end());\n\t\tif (s == transfer(n, i * i))cout << transfer(n, i) << \"" \"" << transfer(n, i * i) << endl;\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1277559326196039680,5f71a9d5537f24730fd564649e838059c7274bb787bc8eac8c4cd5b14c9f623d,2020-06-29 19:07:33,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\n#include<string>\n#include<map>\nusing namespace std;\nchar a[20] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I' };\nstring transfer(int n,int b){//转成n进制的数\n\tint m = b;\n\tstring s=\""\"";\n\twhile (m > 0) {\n\t\ts = a[m%n]+s;\n\t\tm = m / n;\n\t}\n\treturn s;\n}\nint main() {\n\tint n;\n\tcin >> n;\n\tfor (int i = 1; i <= 300; i++){\n\t\tstring s = transfer(n, i*i);\n\t\treverse(s.begin(), s.end());\n\t\tif (s == transfer(n, i * i))cout << transfer(n, i) << \"" \"" << transfer(n, i * i) << endl;\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1277559350116147200,2dbc8dbbe3a3713fd279f85d78da00257659b0fa27c0cdad54e2bf4fb0d9580e,2020-06-29 19:07:39,Python,50.0,1277062760129622024,1267449136707624960,1049226397448056832,"def intojinzhi(jinzhi,n):\n    a=[0,1,2,3,4,5,6,7,8,9,]\n    b=[]\n    while True:\n        s=n//jinzhi\n        y=n%jinzhi\n        b=b+[y]\n        if s==0:\n            break\n        n=s\n    b.reverse()\n    ans=''\n    for i in b:\n        ans+=str(a[i])\n    return(ans)\ndef ishuiwen(strn):\n    if strn==strn[::-1]:\n        return(True)\n    else:\n        return(False)\nN,m=input().split()\nans=[]\nsums=0\nm=int(m)\nwhile True:\n    count=0\n    for x in range(2,11):\n        trans=intojinzhi(x,m)\n        if ishuiwen(trans):\n            count+=1\n        if count==2:\n            break\n    if len(ans)<int(N) and count==2:\n        ans.append(m)\n    m+=1\n    if len(ans)==int(N):\n        break\nfor x in ans:\n    print(x)\n",PARTIAL_ACCEPTED,343,3076
1277559379207839744,5f71a9d5537f24730fd564649e838059c7274bb787bc8eac8c4cd5b14c9f623d,2020-06-29 19:07:46,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<string>\n#include<map>\nusing namespace std;\nchar a[20] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I' };\nstring transfer(int n,int b){//转成n进制的数\n\tint m = b;\n\tstring s=\""\"";\n\twhile (m > 0) {\n\t\ts = a[m%n]+s;\n\t\tm = m / n;\n\t}\n\treturn s;\n}\nint main() {\n\tint n;\n\tcin >> n;\n\tfor (int i = 1; i <= 300; i++){\n\t\tstring s = transfer(n, i*i);\n\t\treverse(s.begin(), s.end());\n\t\tif (s == transfer(n, i * i))cout << transfer(n, i) << \"" \"" << transfer(n, i * i) << endl;\n\t}\n\treturn 0;\n}",ACCEPTED,44,624
1277559390993842176,299338d5ab323b9a652bcf61b728fe1bf6dc2331e8b6c1af6ef92ea19022f137,2020-06-29 19:07:49,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<stdio.h>\n#include<algorithm>\n#include<iostream>\nusing namespace std;\nint s[1000];\nint a[1000];\nint t=0;\nint ishuiwen(int a,int b)\n{\n\tint r=0;\n\twhile(a)\n\t{\n\t\ts[++r]=a%b;\n\t\ta/=b;\n\t}\n\ts[0]=r;\n\tchar str1[1000];\n\tchar str2[1000];\n\tfor(int i=0;i<r;i++)\n\t\tstr1[i]=(char)(s[i+1]-'0');\n\tfor(int i=0;i<r;i++)\n\t\tstr2[i]=str1[i];\n\treverse(str1,str1+r);\n\tfor(int i=0;i<r;i++)\n\t\tif(str1[i]!=str2[i])\n\t\t\treturn 0;\n\t\t\treturn 1;\t\t\n}\nint main(){\n    int N,S;\n    cin>>N>>S;\n    int t=0;\n    for(int i=S+1;t!=N;i++)\n\t{\n        int cnt=0;\n        for(int j=2;j<=10&&cnt<2;j++)\n\t\t{\n            if(ishuiwen(i,j))cnt++;\n        }\n        if(cnt>=2)\t\n\t\t{\n    \t\tprintf(\""%d\\n\"",i);\n\t\t\tt++;\n\t\t}    \n\t}\n    return 0;\n}",ACCEPTED,33,424
1277560535904616448,2dbc8dbbe3a3713fd279f85d78da00257659b0fa27c0cdad54e2bf4fb0d9580e,2020-06-29 19:12:22,Python,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"def intojinzhi(jinzhi,n):\n    a=[0,1,2,3,4,5,6,7,8,9,]\n    b=[]\n    while True:\n        s=n//jinzhi\n        y=n%jinzhi\n        b=b+[y]\n        if s==0:\n            break\n        n=s\n    b.reverse()\n    ans=''\n    for i in b:\n        ans+=str(a[i])\n    return(ans)\ndef ishuiwen(strn):\n    if strn==strn[::-1]:\n        return(True)\n    else:\n        return(False)\nN,m=input().split()\nans=[]\nsums=0\nm=int(m)+1\nwhile True:\n    count=0\n    for x in range(2,11):\n        trans=intojinzhi(x,m)\n        if ishuiwen(trans):\n            count+=1\n        if count==2:\n            break\n    if len(ans)<int(N) and count==2:\n        ans.append(m)\n    m+=1\n    if len(ans)==int(N):\n        break\nfor x in ans:\n    print(x)\n",ACCEPTED,363,3112
1277562088547876864,5f71a9d5537f24730fd564649e838059c7274bb787bc8eac8c4cd5b14c9f623d,2020-06-29 19:18:32,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<string>\n#include<map>\nusing namespace std;\nchar a[10] = { '0','1','2','3','4','5','6','7','8','9' };\nstring transfer(int n,int b){//转成n进制的数\n\tint m = b;\n\tstring s=\""\"";\n\twhile (m > 0) {\n\t\ts = a[m%n]+s;\n\t\tm = m / n;\n\t}\n\treturn s;\n}\nint main() {\n\tint n, x;\n\tcin >> n >> x;\n\twhile (n > 0) {\n\t\tx++;\n\t\tint t = 0;\n\t\tfor (int i = 2; i < 11; i++) {\n\t\t\tstring s = transfer(i, x);\n\t\t\treverse(s.begin(), s.end());\n\t\t\tif (s[0] != '0' && s == transfer(i, x)) {\n\t\t\t\tt++;\n\t\t\t}\n\t\t}\n\t\tif (t >= 2) {\n\t\t\tn--;\n\t\t\tcout << x << endl;\n\t\t}\n\t}\n\treturn 0;\n\t}\n",ACCEPTED,46,424
1277563660526870528,f58df442ca29dc2c3fb9bb818f338eeac62afaf552e1b2429f370277d7d6bb33,2020-06-29 19:24:47,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\nusing namespace std;\nstring Transformer(int radix,int n);\nbool check(string x);\nint main()\n{\n    int B,sqr;\n    cin>>B;\n    for(int i=1;i<=300;i++)\n    {\n        sqr=i*i;\n        res=Transformer(sqr,B);\n        if(check(res))\n        {\n            cout<<Transformer(i,B)<<\"" \""<<res<<endl;\n        }\n    }\n    return 0;\n}\n\nstring Transformer(int radix,int n)\n{\n    string a=\""0123456789ABCDEFGHIJ\"";\n    string ans;\n\twhile(radix)\n    {\n        ans=a[radix%n]+ans;\n        radix=radix/n\n    }\n\treturn ans;\t\n}\n\nbool check(string x)\n{\n    string x1=x;\n    reverse(x.begin(),x.end());\n    if(x1==x) return 1;\n    else return 0;\n}",COMPILE_ERROR,0,0
1277564203093655552,f58df442ca29dc2c3fb9bb818f338eeac62afaf552e1b2429f370277d7d6bb33,2020-06-29 19:26:56,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\nusing namespace std;\nstring Transformer(int radix,int n);\nbool check(string x);\nint main()\n{\n    int B,sqr;\n    string res;\n    cin>>B;\n    for(int i=1;i<=300;i++)\n    {\n        sqr=i*i;\n        res=Transformer(sqr,B);\n        if(check(res))\n        {\n            cout<<Transformer(i,B)<<\"" \""<<res<<endl;\n        }\n    }\n    return 0;\n}\n\nstring Transformer(int radix,int n)\n{\n    string a=\""0123456789ABCDEFGHIJ\"";\n    string ans;\n\twhile(radix)\n    {\n        ans=a[radix%n]+ans;\n        radix=radix/n\n    }\n\treturn ans;\t\n}\n\nbool check(string x)\n{\n    string x1=x;\n    reverse(x.begin(),x.end());\n    if(x1==x) return 1;\n    else return 0;\n}",COMPILE_ERROR,0,0
1277564280289820672,f58df442ca29dc2c3fb9bb818f338eeac62afaf552e1b2429f370277d7d6bb33,2020-06-29 19:27:15,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\nusing namespace std;\nstring Transformer(int radix,int n);\nbool check(string x);\nint main()\n{\n    int B,sqr;\n    string res;\n    cin>>B;\n    for(int i=1;i<=300;i++)\n    {\n        sqr=i*i;\n        res=Transformer(sqr,B);\n        if(check(res))\n        {\n            cout<<Transformer(i,B)<<\"" \""<<res<<endl;\n        }\n    }\n    return 0;\n}\n\nstring Transformer(int radix,int n)\n{\n    string a=\""0123456789ABCDEFGHIJ\"";\n    string ans;\n\twhile(radix)\n    {\n        ans=a[radix%n]+ans;\n        radix=radix/n;\n    }\n\treturn ans;\t\n}\n\nbool check(string x)\n{\n    string x1=x;\n    reverse(x.begin(),x.end());\n    if(x1==x) return 1;\n    else return 0;\n}",ACCEPTED,45,504
1277564367699116032,5f0555faff3d0b906508e2a9afc0e49c87c294eb5681c5246fc4bc8120e3ad33,2020-06-29 19:27:35,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\n#include<cstdlib>\n#include<string>\n#include<cstring>\n#include<algorithm>\nusing namespace std;\nconst char ch[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nbool panduan(char *a)\n{\n    int n = strlen(a),flag=1;\n    for (int i=0;i<n;i++)\n    {\n        if (a[i] != a[n-1-i]){flag=0;break;}\n    }\n    if(!flag) return false;\n    return true;\n}\nchar num[20]={'0'};\nchar* transfrom(long k,int a)\n{\n    for (int i=0;;i++)\n    {\n        int y = k%a;\n        num[i]=ch[y];\n        if (k<a) break;\n        k = k/a;\n    }\n    int n=strlen(num);\n    reverse(num,num+n);\n    return num;\n    // vector<char>num;\n    // for (int i=0;;i++)\n    // {\n    //     int y = k%a;\n    //     num.push_back(y);\n    //     if (k<a) break;\n    //     k = k/a;\n    // }\n    // int n=num.size(),num1=0;\n    // for (int i=n-1;i>=0;i--)\n    // {\n    //     num1 *= 10;\n    //     num1+=num[i];\n    // }\n    // return num1;\n}\nchar num1[20]={'0'};\nchar* change(int x,int a)\n{\n    for (int i=0;;i++)\n    {\n        int y = x%a;\n        num1[i]=ch[y];\n        if (x<a) break;\n        x = x/a;\n    }\n    int n=strlen(num1);\n    reverse(num1,num1+n);\n    //cout<<num1<<endl;\n    return num1;\n}\nint main()\n{\n    int n=0;\n    cin>>n;\n    for (int i=1;i<=300;i++)\n    {\n        long m=i*i;\n        char* x = transfrom(m,n);\n        int y = panduan(x);\n        if (y) {\n\n            cout<<change(i,n)<<\"" \""<<x<<endl;\n        } \n    }\n    system(\""pause\"");\n    return 0;\n}",ACCEPTED,35,640
1277566359842512896,c83213147a2d8d9a45ded58245e2135a1ca7678965b0bb31caebd18beefa1d2c,2020-06-29 19:35:30,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<algorithm>\n#define LL unsigned long long\nusing namespace std;\nint a[30];\nint b[30];\nint i, j, n, k, k1;\nint n1;\nint mod(int x, int y)\n{\n\treturn x % y;\n}int sub(int x, int y)\n{\n\treturn x / y;\n}\nvoid he(int x)\n{\n\tint ha, yu, shang;\n\tfor (j = 1;j <= 29;j++)\n\t\ta[j] = 0;\n\tk = 0;\n\tshang = x;\n\twhile (true)\n\t{\n\t\tyu = mod(shang,n);\n\t\tshang = sub(shang, n);\n\t\tk++;\n\t\ta[k] = yu;\n\t\tif (shang == 0)\n\t\t\tbreak;\n\t}\n} void ff(int x)\n{\n\tint ha, yu, shang;\n\tfor (j = 1;j <= 29;j++)\n\t\tb[j] = 0;\n\tk1 = 0;\n\tshang = x;\n\twhile (true)\n\t{\n\t\tyu = mod(shang, n);\n\t\tshang = sub(shang, n);\n\t\tk1++;\n\t\tb[k1] = yu;\n\t\tif (shang == 0)\n\t\t\tbreak;\n\n\t}\n} int main()\n{\n\n\tcin >> n;\n\tfor (i = 1;i <= 300;i++)\n\t{\n\t\tint mark = 1;\n\t\the(i);\n\t\tn1 = i * i;\n\t\tff(n1);\n\t\tfor (j = 1;j <= k1;j++)\n\t\t{\n\t\t\tif (b[j] != b[k1 - j + 1])\n\t\t\t{\n\t\t\t\tmark = 0;\n\t\t\t\tbreak;\n\n\t\t\t}\n\n\t\t}\n\t\tif (mark == 1)\n\t\t{\n\t\t\tfor (j = k;j >= 1;j--)\n\t\t\t{\n\t\t\t\tif (a[j] < 10)\n\t\t\t\t\tcout << a[j];\n\t\t\t\telse {\n\t\t\t\t\tchar c = char(a[j] - 10 + 65);\n\t\t\t\t\tcout << c;\n\t\t\t\t}\n\n\t\t\t}\n\t\t\tcout << \"" \"";\n\n\t\t\tfor (j = 1;j <= k1;j++)\n\t\t\t\tif (b[j] < 10)\n\t\t\t\t\tcout << b[j];\n\t\t\t\telse {\n\t\t\t\t\tchar c = char(b[j] - 10 + 65);\n\t\t\t\t\tcout << c;\n\t\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,36,384
1277567130633961472,f58df442ca29dc2c3fb9bb818f338eeac62afaf552e1b2429f370277d7d6bb33,2020-06-29 19:38:34,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\nusing namespace std;\nstring Transformer(int radix,int n);\nbool check(string x);\nint main()\n{\n    int B,sqr;\n    string res;\n    cin>>B;\n    for(int i=1;i<=300;i++)\n    {\n        sqr=i*i;\n        res=Transformer(sqr,B);\n        if(check(res))\n        {\n            cout<<Transformer(i,B)<<\"" \""<<res<<endl;\n        }\n    }\n    return 0;\n}\n\nstring Transformer(int radix,int n)\n{\n    string a=\""ABCDEFGHIJ\"";\n    string ans=\""\"";\n\twhile(radix)\n    {\n        if(radix%n<10)\n        {\n            ans+=to_string(radix%n);\n        }\n        else\n        {\n            ans+=a[radix%n-10];\n        }\n        radix = radix / n;\n    }\n\treverse(ans.begin(),ans.end());\n\treturn ans;\t\n}\n\nbool check(string x)\n{\n    string x1=x;\n    reverse(x.begin(),x.end());\n    if(x1==x) return 1;\n    else return 0;\n}",ACCEPTED,51,516
1277567519617908736,b77006d2c05616010bccb3c4dc79461f07a7a0647f294f1948292040be148b3a,2020-06-29 19:40:07,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include <algorithm>\nusing namespace std;\nbool jud(string s) {\n\tstring s1;\n\tfor (int i = s.length() - 1; i >= 0; --i) s1 += s[i];\n\treturn s1 == s;\n}\n\nstring change(int n, int p) {\n\tstring str;\n\tint c, m = 0, s[100];\n\twhile (n != 0) {\n\t\tc = n % p;\n\t\tn = n / p;\n\t\tm++;\n\t\ts[m] = c;\n\t}\n\tfor (int k = m; k >= 1; k--) str += (char)(s[k] + 48);\n\treturn str;\n}\nint main() {\n\tint N, S,NUM=0;\n\tcin >> N>>S;\n\tfor (int i = S + 1; i <10000 ; ++i) {\n\t\tint num = 0;\n\t\tfor (int j = 2; j < 11; ++j) {\n\t\t\tif (jud(change(i, j))) num++;\n\t\t\tif (num == 3) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tNUM++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (NUM == N) break;\n\t}\n}",PARTIAL_ACCEPTED,47,424
1277568442494812160,b77006d2c05616010bccb3c4dc79461f07a7a0647f294f1948292040be148b3a,2020-06-29 19:43:47,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include <algorithm>\nusing namespace std;\nbool jud(string s) {\n\tstring s1;\n\tfor (int i = s.length() - 1; i >= 0; --i) s1 += s[i];\n\treturn s1 == s;\n}\n\nstring change(int n, int p) {\n\tstring str;\n\tint c, m = 0, s[100];\n\twhile (n != 0) {\n\t\tc = n % p;\n\t\tn = n / p;\n\t\tm++;\n\t\ts[m] = c;\n\t}\n\tfor (int k = m; k >= 1; k--) str += (char)(s[k] + 48);\n\treturn str;\n}\nint main() {\n\tint N, S,NUM=0;\n\tcin >> N>>S;\n\tfor (int i = S + 1; i <10000 ; ++i) {\n\t\tint num = 0;\n\t\tfor (int j = 2; j < 11; ++j) {\n\t\t\tif (jud(change(i, j))) num++;\n\t\t\tif (num == 3) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tNUM++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (NUM == N) break;\n\t}\n}\n",PARTIAL_ACCEPTED,44,424
1277568649395625984,b77006d2c05616010bccb3c4dc79461f07a7a0647f294f1948292040be148b3a,2020-06-29 19:44:36,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include <algorithm>\nusing namespace std;\nbool jud(string s) {\n\tstring s1;\n\tfor (int i = s.length() - 1; i >= 0; --i) s1 += s[i];\n\treturn s1 == s;\n}\n\nstring change(int n, int p) {\n\tstring str;\n\tint c, m = 0, s[100];\n\twhile (n != 0) {\n\t\tc = n % p;\n\t\tn = n / p;\n\t\tm++;\n\t\ts[m] = c;\n\t}\n\tfor (int k = m; k >= 1; k--) str += (char)(s[k] + 48);\n\treturn str;\n}\nint main() {\n\tint N, S,NUM=0;\n\tcin >> N>>S;\n\tfor (int i = S + 1; i <10000 ; ++i) {\n\t\tint num = 0;\n\t\tfor (int j = 2; j < 11; ++j) {\n\t\t\tif (jud(change(i, j))) num++;\n\t\t\tif (num == 3) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tNUM++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (NUM == N) break;\n\t}\n}\n",PARTIAL_ACCEPTED,45,424
1277570490393100288,539cb65160a7009fec6386fb40555fc03abd87cda9efad94c2441feaf9ca5a23,2020-06-29 19:51:55,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <math.h>\n#include <string.h>\nusing namespace std;\n\nchar a[17],b[17];\nint B;\n\nvoid tran1(int x){\n    int m,n=0;\n    while(x>0){\n        m=x%B;\n        x/=B;\n        if (m>=10){\n            a[n]=m+'A'-10;\n            n++;\n        }\n        else{\n            a[n]=m+'0';\n            n++;\n        }\n    }\n}\n\nvoid tran2(int y){\n    int m,n=0;\n    while(y>0){\n        m=y%B;\n        y/=B;\n        if (m>=10){\n            b[n]=n+'A'+10;\n            n++;\n        }\n        else{\n            b[n]=n+'0';\n            n++;\n        }\n    }\n}\n\nint comp(){\n    int i,j,flag=0;\n    int l=strlen(b);\n    for (i=0,j=l-1; i<j; i++,j--){\n        if(b[i]!=b[j]){\n            flag = 1;\n            break;\n        }\n    }\n    if(!flag)\n        return 1;\n    else\n        return 0;\n}\n\nint main(){\n    //cout << log2(90000) << endl;\n\n    cin >> B;\n    memset(a,0,sizeof(a));\n    memset(b,0,sizeof(b));\n    for (int i=1;i<=300;i++){\n        int j = pow(i,2);\n        tran1(i);\n        tran2(j);\n        //cout << comp() << endl;\n        if (comp()){\n            int len1=strlen(a);\n            for (int j=len1-1;j>=0;j--)\n                printf(\""%c\"", a[j]);\n            printf(\"" \"");\n            int len2=strlen(b);\n            for (int j=len2-1;j>=0;j--)\n                printf(\""%c\"", a[j]);\n            cout << endl;\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,42,644
1277570999086678016,8c0440d5834b5f051a2f1773df09e47f68f9b81ad93e25d1da71d39296a2a98b,2020-06-29 19:53:56,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<algorithm>\nusing namespace std;\n\nstring convert(int input, int k) {//k进制\n    string str = \""ABCDEFGHIJK\"";\n    string ans = \""\"";\n    while (input)\n    {\n        if (input % k < 10) {\n            ans = to_string(input % k)+ ans;\n        }\n        else {\n            ans = str[input % k - 10] + ans;\n        }\n        input /= k; \n    }\n    return ans;\n}\ninline bool isPalindromeNum(string s) {\n    string old;\n    old = s;\n    reverse(old.begin(), old.end());\n    if (old == s)return true;\n    else return false;\n}\nint main() {\n\n    int n;\n    cin >> n;\n\n    string a,afang;\n    for (int i = 1; i < 301; i++) {\n        a = convert(i, n);\n        afang = convert(i * i, n);\n        if (isPalindromeNum(afang)) {\n            cout << a << \"" \"" << afang << endl;\n        }\n    }\n\n    return 0;\n}\n",ACCEPTED,43,384
1277571534288248832,f58df442ca29dc2c3fb9bb818f338eeac62afaf552e1b2429f370277d7d6bb33,2020-06-29 19:56:04,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\nusing namespace std;\nstring Transformer(int radix,int n);\nbool check(string x);\n\nint main()\n{\n    int a,b,count1;\n    string res;\n    cin>>a>>b;\n    for(int i=b;count1<=a;i++)\n    {   \n        int count2;\n        for(int x=2;x<=10;x++)\n        {\n            res=Transformer(i,x);\n            if(check(res)) count2++;\n        }\n        if(count2>=2)\n        {\n            count1++;\n            cout<<i<<endl;\n        }\n    }\n    return 0;\n}\n\nstring Transformer(int radix,int n)\n{\n    string ans;\n    while(n)\n\t{\n\t\tans=to_string(radix%n)+ans;\n\t\tradix=radix/n;\n\t}\n    return ans;\n}\n\nbool check(string x)\n{\n    string x1=x;\n    reverse(x.begin(),x.end());\n    if(x1==x) return 1;\n    else return 0;\n}",TIME_LIMIT_EXCEEDED,0,0
1277571808662847488,8c0440d5834b5f051a2f1773df09e47f68f9b81ad93e25d1da71d39296a2a98b,2020-06-29 19:57:09,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<algorithm>\nusing namespace std;\n\nstring convert(int input, int k) {//k进制\n    string str = \""ABCDEFGHIJK\"";\n    string ans = \""\"";\n    while (input)\n    {\n        if (input % k < 10) {\n            ans = to_string(input % k)+ ans;\n        }\n        else {\n            ans = str[input % k - 10] + ans;\n        }\n        input /= k; \n    }\n    return ans;\n}\ninline bool isPalindromeNum(string s) { //判断回文\n    string old;\n    old = s;\n    reverse(old.begin(), old.end());\n    if (old == s)return true;\n    else return false;\n}\nint main() {\n\n    int n;\n    cin >> n;\n\n    string a,afang;\n    for (int i = 1; i < 301; i++) {\n        a = convert(i, n);\n        afang = convert(i * i, n);\n        if (isPalindromeNum(afang)) {\n            cout << a << \"" \"" << afang << endl;\n        }\n    }\n\n    return 0;\n}\n",ACCEPTED,31,508
1277572028507283456,996426eb2c46e27722456ffb4665b347926a2751ce9b5258dbaefeaa3c58c7a0,2020-06-29 19:58:02,C++,30.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n\nusing namespace std;\n\nint turn_out(int B, int x);\n\nint main() {\n    int B;\n    cin >> B;\n    for (int i = 1; i <= 300; i++) {\n        turn_out(B, i);\n    }\n    return 0;\n}\n\nint turn_out(int B, int x) {\n    int i = 0, k = 0;\n    int m = x * x, j;\n    int a[5], b[5];\n    while (m != 0) {\n        a[i]= m % B;\n        i++;\n        m = m / B;\n    }\n    while (x != 0) {\n        b[k] = x % B;\n        k++;\n        x = x / B;\n    }\n    for (j = 0; j < i / 2; j++) {\n        if (a[j] != a[i - j - 1]) \n            return 0;\n    }\n    for (j = k - 1; j > 0; j--)\n        cout << b[j];\n    cout << b[j] << \"" \"";\n    for (j = 0; j < i - 1; j++)\n        cout << a[j];\n    cout << a[j] << endl;\n}",PARTIAL_ACCEPTED,40,424
1277572132215644160,996426eb2c46e27722456ffb4665b347926a2751ce9b5258dbaefeaa3c58c7a0,2020-06-29 19:58:27,C++,30.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n\nusing namespace std;\n\nint turn_out(int B, int x);\n\nint main() {\n    int B;\n    cin >> B;\n    for (int i = 1; i <= 300; i++) {\n        turn_out(B, i);\n    }\n    return 0;\n}\n\nint turn_out(int B, int x) {\n    int i = 0, k = 0;\n    int m = x * x, j;\n    int a[5], b[5];\n    while (m != 0) {\n        a[i]= m % B;\n        i++;\n        m = m / B;\n    }\n    while (x != 0) {\n        b[k] = x % B;\n        k++;\n        x = x / B;\n    }\n    for (j = 0; j < i / 2; j++) {\n        if (a[j] != a[i - j - 1]) \n            return 0;\n    }\n    for (j = k - 1; j > 0; j--)\n        cout << b[j];\n    cout << b[j] << \"" \"";\n    for (j = 0; j < i - 1; j++)\n        cout << a[j];\n    cout << a[j] << endl;\n}",PARTIAL_ACCEPTED,44,512
1277572216701517824,996426eb2c46e27722456ffb4665b347926a2751ce9b5258dbaefeaa3c58c7a0,2020-06-29 19:58:47,C++,40.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n\nusing namespace std;\n\nint turn_out(int B, int x);\n\nint main() {\n    int B;\n    cin >> B;\n    for (int i = 1; i <= 300; i++) {\n        turn_out(B, i);\n    }\n    return 0;\n}\n\nint turn_out(int B, int x) {\n    int i = 0, k = 0;\n    int m = x * x, j;\n    int a[10], b[10];\n    while (m != 0) {\n        a[i]= m % B;\n        i++;\n        m = m / B;\n    }\n    while (x != 0) {\n        b[k] = x % B;\n        k++;\n        x = x / B;\n    }\n    for (j = 0; j < i / 2; j++) {\n        if (a[j] != a[i - j - 1]) \n            return 0;\n    }\n    for (j = k - 1; j > 0; j--)\n        cout << b[j];\n    cout << b[j] << \"" \"";\n    for (j = 0; j < i - 1; j++)\n        cout << a[j];\n    cout << a[j] << endl;\n}",PARTIAL_ACCEPTED,31,448
1277572314453966848,f58df442ca29dc2c3fb9bb818f338eeac62afaf552e1b2429f370277d7d6bb33,2020-06-29 19:59:10,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\nusing namespace std;\nstring Transformer(int radix,int n);\nbool check(string x);\n\nint main()\n{\n    int a,b,count1;\n    string res;\n    cin>>a>>b;\n    for(int i=b;count1<=a;i++)\n    {   \n        int count2;\n        for(int x=2;x<=10;x++)\n        {\n            res=Transformer(i,x);\n            if(check(res)) count2++;\n        }\n        if(count2>=2)\n        {\n            count1++;\n            cout<<i<<endl;\n        }\n    }\n    return 0;\n}\n\nstring Transformer(int radix,int n)\n{\n    string ans;\n    while(radix)\n\t{\n\t\tans=to_string(radix%n)+ans;\n\t\tradix=radix/n;\n\t}\n    return ans;\n}\n\nbool check(string x)\n{\n    string x1=x;\n    reverse(x.begin(),x.end());\n    if(x1==x) return 1;\n    else return 0;\n}",WRONG_ANSWER,32,512
1277572484650426368,f58df442ca29dc2c3fb9bb818f338eeac62afaf552e1b2429f370277d7d6bb33,2020-06-29 19:59:51,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\nusing namespace std;\nstring Transformer(int radix,int n);\nbool check(string x);\n\nint main()\n{\n    int a,b,count1;\n    string res;\n    cin>>a>>b;\n    for(int i=b;count1<a;i++)\n    {   \n        int count2;\n        for(int x=2;x<=10;x++)\n        {\n            res=Transformer(i,x);\n            if(check(res)) count2++;\n        }\n        if(count2>=2)\n        {\n            count1++;\n            cout<<i<<endl;\n        }\n    }\n    return 0;\n}\n\nstring Transformer(int radix,int n)\n{\n    string ans;\n    while(radix)\n\t{\n\t\tans=to_string(radix%n)+ans;\n\t\tradix=radix/n;\n\t}\n    return ans;\n}\n\nbool check(string x)\n{\n    string x1=x;\n    reverse(x.begin(),x.end());\n    if(x1==x) return 1;\n    else return 0;\n}",WRONG_ANSWER,28,512
1277574608864083968,f58df442ca29dc2c3fb9bb818f338eeac62afaf552e1b2429f370277d7d6bb33,2020-06-29 20:08:17,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\nusing namespace std;\nstring Transformer(int radix,int n);\nbool check(string x);\n\nint main()\n{\n    int a,b,count1;\n    string res;\n    cin>>a>>b;\n    for(int i=b+1;count1<a;i++)\n    {   \n        int count2;\n        for(int x=2;x<=10;x++)\n        {\n            res=Transformer(i,x);\n            if(check(res)) count2++;\n        }\n        if(count2>=2)\n        {\n            count1++;\n            cout<<i<<endl;\n        }\n    }\n    return 0;\n}\n\nstring Transformer(int radix,int n)\n{\n    string ans;\n    while(radix)\n\t{\n\t\tans=to_string(radix%n)+ans;\n\t\tradix=radix/n;\n\t}\n    return ans;\n}\n\nbool check(string x)\n{\n    string x1=x;\n    reverse(x.begin(),x.end());\n    if(x1==x) return 1;\n    else return 0;\n}",PARTIAL_ACCEPTED,40,424
1277574696818630656,f58df442ca29dc2c3fb9bb818f338eeac62afaf552e1b2429f370277d7d6bb33,2020-06-29 20:08:38,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\nusing namespace std;\nstring Transformer(int radix,int n);\nbool check(string x);\n\nint main()\n{\n    int a,b,count1;\n    string res;\n    cin>>a>>b;\n    for(int i=b+1;count1<=a;i++)\n    {   \n        int count2;\n        for(int x=2;x<=10;x++)\n        {\n            res=Transformer(i,x);\n            if(check(res)) count2++;\n        }\n        if(count2>=2)\n        {\n            count1++;\n            cout<<i<<endl;\n        }\n    }\n    return 0;\n}\n\nstring Transformer(int radix,int n)\n{\n    string ans;\n    while(radix)\n\t{\n\t\tans=to_string(radix%n)+ans;\n\t\tradix=radix/n;\n\t}\n    return ans;\n}\n\nbool check(string x)\n{\n    string x1=x;\n    reverse(x.begin(),x.end());\n    if(x1==x) return 1;\n    else return 0;\n}",WRONG_ANSWER,36,424
1277575664624926720,f58df442ca29dc2c3fb9bb818f338eeac62afaf552e1b2429f370277d7d6bb33,2020-06-29 20:12:29,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\nusing namespace std;\nstring Transformer(int radix,int n);\nbool check(string x);\n\nint main()\n{\n    int a,b,count1;\n    string res;\n    cin>>a>>b;\n    for(int i=b+1;count1<a;i++)\n    {   \n        int count2=0;\n        for(int x=2;x<=10;x++)\n        {\n            res=Transformer(i,x);\n            if(check(res)) count2++;\n        }\n        if(count2>=2)\n        {\n            count1++;\n            cout<<i<<endl;\n        }\n    }\n    return 0;\n}\n\nstring Transformer(int radix,int n)\n{\n    string ans;\n    while(radix)\n\t{\n\t\tans=to_string(radix%n)+ans;\n\t\tradix=radix/n;\n\t}\n    return ans;\n}\n\nbool check(string x)\n{\n    string x1=x;\n    reverse(x.begin(),x.end());\n    if(x1==x) return 1;\n    else return 0;\n}",ACCEPTED,80,492
1277577013831852032,539cb65160a7009fec6386fb40555fc03abd87cda9efad94c2441feaf9ca5a23,2020-06-29 20:17:50,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<cstdio>\n#include<cstring>\n#include<algorithm>\n#include<iostream>\nusing namespace std;\n\nlong long int B,j;\nchar a[19],b[19];\n\nvoid tran1(int x)\n{\n    int m,k=0;\n    while(x)\n    {\n        m=x%B;\n        x/=B;\n        if(m>=10)\n            a[k++]=m+'A'-10;\n        else\n            a[k++]=m+'0';\n    }\n}\n\nvoid tran2(int y)\n{\n    int n,c=0;\n    while(y)\n    {\n        n=y%B;\n        y/=B;\n        if(n>=10)\n            b[c++]=n+'A'-10;\n        else\n            b[c++]=n+'0';\n    }\n}\n\nint comp()\n{\n    int i,j,flag=0;\n    int l=strlen(b);\n    for(i=0,j=l-1; i<j; i++,j--)\n    {\n        if(b[i]!=b[j])\n        {\n            flag=1;\n            break;\n        }\n    }\n    if(!flag)\n        return 1;\n    else\n        return 0;\n}\n\nint main()\n{\n    scanf(\""%lld\"",&B);\n    memset(a,0,sizeof(a));\n    memset(b,0,sizeof(b));\n    for(int i=1;i<=300;i++)\n    {\n        j=i*i;\n        tran1(i);\n        tran2(j);\n        if(comp())\n        {\n            int len=strlen(a);\n            for(int ii=len-1;ii>=0;ii--)\n                printf(\""%c\"",a[ii]);\n            printf(\"" \"");\n            puts(b);\n        }\n    }\n    return 0;\n}\n",ACCEPTED,30,424
1277578000269238272,6c35e467afdda4bd160e5a464e52c4fabae55baf6012826d6b06d12b2dff7fec,2020-06-29 20:21:46,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cmath>\n#include <string.h>\n#include <algorithm>\nusing namespace std;\n\nint main(){\n    int B=0;\n    cin >> B;\n    char num[B];\n    if (B<10) {\n        for (int i=0;i<B;i++){\n            num[i] = '0' + i;\n        }\n    }\n    else {\n        for (int i=0;i<10;i++){\n            num[i] = '0' + i;\n        }\n        for (int i=10;i<B;i++){\n            num[i] = 'A' + i - 10;\n        }\n    }\n\n    for (int i=1;i<=300;i++){\n        int tmp = pow(i,2);\n        int I = i;\n        string number1=\""\"";\n        string number2=\""\"";\n        int flg1,flg2;\n        while(tmp>=B){\n            flg1 = tmp/B;\n            flg2 = tmp%B;\n            number2 += num[flg2];\n            tmp = flg1;\n        }\n        number2 += num[tmp];\n\n        string number22 = number2;\n        reverse(number22.begin(),number22.end());\n        if (number2==number22){\n            while(I>=B){\n                flg1 = I/B;\n                flg2 = I%B;\n                number1 += num[flg2];\n                I = flg1;\n            }\n            number1 += num[I];\n            reverse(number1.begin(),number1.end());\n            if (i==1){\n                cout << number1 << \"" \"" << number2;\n            }\n            else {\n                cout << \""\\n\"" << number1 << \"" \"" << number2;\n            }\n        }\n    }\n    return 0;\n}\n",ACCEPTED,39,392
1277578244457422848,8c0440d5834b5f051a2f1773df09e47f68f9b81ad93e25d1da71d39296a2a98b,2020-06-29 20:22:44,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include<algorithm>\nusing namespace std;\n\ninline string convert(int input, int k) {//k进制\n    string str = \""ABCDEFGHIJK\"";\n    string ans = \""\"";\n    while (input)\n    {\n        if (input % k < 10) {\n            ans = to_string(input % k)+ ans;\n        }\n        else {\n            ans = str[input % k - 10] + ans;\n        }\n        input /= k; \n    }\n    return ans;\n}\ninline bool isPalindromeNum(string s) {//判断回文\n    string old;\n    old = s;\n    reverse(old.begin(), old.end());\n    if (old == s)return true;\n    else return false;\n}\ninline bool isDoublePaliNum(int x) { //判断双重回文\n    int flag = 0;\n    \n    int i = 2;\n    while (i<11)\n    {\n        if (isPalindromeNum(convert(x, i))) flag++;\n        if (flag > 1) return true;\n        i++;\n    }\n    return false;\n}\nint main() {\n\n    int n, s;\n    cin >> n >> s;\n\n    int count = 0;\n    while (count < n)\n    {\n        s++;\n        if (isDoublePaliNum(s)) {\n            count++;\n            cout << s << endl;\n        }\n    }\n}\n",ACCEPTED,71,492
1277579756948611072,303874707958d90647f872b8efbfd73ba443b3adfeab3ebe67889ace64af034c,2020-06-29 20:28:45,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tchar zls[20] = {'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\n\tint n;\n\tcin>>n;\n\tchar yy[1000];\n\tchar kk[1000];\n\tfor(int i =1;i<=300;i++)\n\t{\n\t\tint num;\n\t\tint x =1;\n\t\tnum = i*i;\n\t\twhile(num)\n\t\t{\n\t\t\tyy[x] = zls[num%n];\n\t\t\tnum = num/n;\n\t\t\tx++;\n\t\t}\n\t\tbool s = false;\n\t\tfor(int i =1;i<=x/2;i++)\n\t\t{\n\t\t\tif(yy[i]!=yy[x-i+1]);\n\t\t\t{\n\t\t\t\ts = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tint h=1;\n\t\tif(s==false)\n\t\t{   int g;\n\t\t    g=i;\n\t\t\twhile(g)\n\t\t\t{\n\t\t\t\tkk[h] = zls[g%n];\n\t\t\t    g = g/n;\n\t\t\t    h++;\n\t\t\t } \n\t\t\tcout<<kk<<\"" \""<<yy<<endl;\n\t\t}\n\t\t\n\t\t\n\t}\n}",WRONG_ANSWER,42,468
1277580635374288896,451c130d67830c958054b599819818b589806ed07b69d9b944d8d997a9519deb,2020-06-29 20:32:14,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nstring change(int n,int x);\nbool judge(string);\nint main(){\n    string str=\""0123456789ABCDEFGhij\""\n    int jinzhi;\n    cin>>jinzhi;\n    for(int i=1;i<301;i++){\n        if(judge(change(jinzhi,i*i))){\n            cout<<change(jinzhi,i)<<\"" \""<<change(jinzhi,i*i)<<endl;\n        }\n    }\n    \n}\nstring change(int jinzhi,int x){\n    int pass=x;\n    string after=\""\"";\n    while(pass!=0){\n        after=str[pass%jinzhi]+after;\n        pass=pass/jinzhi;\n    }\n    return after;\n}\nbool judge(string s){\n    bool flag=true;\n    for(int i=0;i<s.size()/2+1;i++){\n        if(s[i]!=s[s.size()-1-i]){\n            flag=false;\n            break;\n        }\n    }\n    return flag;\n}\n",COMPILE_ERROR,0,0
1277580758745546752,451c130d67830c958054b599819818b589806ed07b69d9b944d8d997a9519deb,2020-06-29 20:32:43,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nstring change(int n,int x);\nbool judge(string);\nint main(){\n    string str=\""0123456789ABCDEFGhij\"";\n    int jinzhi;\n    cin>>jinzhi;\n    for(int i=1;i<301;i++){\n        if(judge(change(jinzhi,i*i))){\n            cout<<change(jinzhi,i)<<\"" \""<<change(jinzhi,i*i)<<endl;\n        }\n    }\n    \n}\nstring change(int jinzhi,int x){\n    int pass=x;\n    string after=\""\"";\n    while(pass!=0){\n        after=str[pass%jinzhi]+after;\n        pass=pass/jinzhi;\n    }\n    return after;\n}\nbool judge(string s){\n    bool flag=true;\n    for(int i=0;i<s.size()/2+1;i++){\n        if(s[i]!=s[s.size()-1-i]){\n            flag=false;\n            break;\n        }\n    }\n    return flag;\n}\n",COMPILE_ERROR,0,0
1277580878048329728,451c130d67830c958054b599819818b589806ed07b69d9b944d8d997a9519deb,2020-06-29 20:33:12,C++,70.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nstring change(int n,int x);\nbool judge(string);\nstring str=\""0123456789ABCDEFGhij\"";\nint main(){\n    int jinzhi;\n    cin>>jinzhi;\n    for(int i=1;i<301;i++){\n        if(judge(change(jinzhi,i*i))){\n            cout<<change(jinzhi,i)<<\"" \""<<change(jinzhi,i*i)<<endl;\n        }\n    }\n    \n}\nstring change(int jinzhi,int x){\n    int pass=x;\n    string after=\""\"";\n    while(pass!=0){\n        after=str[pass%jinzhi]+after;\n        pass=pass/jinzhi;\n    }\n    return after;\n}\nbool judge(string s){\n    bool flag=true;\n    for(int i=0;i<s.size()/2+1;i++){\n        if(s[i]!=s[s.size()-1-i]){\n            flag=false;\n            break;\n        }\n    }\n    return flag;\n}\n",PARTIAL_ACCEPTED,41,556
1277580951452835840,451c130d67830c958054b599819818b589806ed07b69d9b944d8d997a9519deb,2020-06-29 20:33:29,C++,70.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nstring change(int n,int x);\nbool judge(string);\nconst string str=\""0123456789ABCDEFGhij\"";\nint main(){\n    int jinzhi;\n    cin>>jinzhi;\n    for(int i=1;i<301;i++){\n        if(judge(change(jinzhi,i*i))){\n            cout<<change(jinzhi,i)<<\"" \""<<change(jinzhi,i*i)<<endl;\n        }\n    }\n    \n}\nstring change(int jinzhi,int x){\n    int pass=x;\n    string after=\""\"";\n    while(pass!=0){\n        after=str[pass%jinzhi]+after;\n        pass=pass/jinzhi;\n    }\n    return after;\n}\nbool judge(string s){\n    bool flag=true;\n    for(int i=0;i<s.size()/2+1;i++){\n        if(s[i]!=s[s.size()-1-i]){\n            flag=false;\n            break;\n        }\n    }\n    return flag;\n}\n",PARTIAL_ACCEPTED,42,592
1277581504119504896,4a899a6e56b5bb4908bfaa085d2ffaf8bcb24c4ff4df06751bbdc2dfefefc067,2020-06-29 20:35:41,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<cstdio>\n#include<iostream>\n#include<cstring>\nusing namespace std;\nint p;\nchar num[21]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J','K'};\n\nstring change(int n){ \n        int c,m=0;\n        string s;   \n        while (n!=0)//数制转换，结果存入数组s[m]  \n        {  \n            c=n%p;  \n            n=n/p;  \n            s.push_back(c+'0');\n            //<<s[m];\n            //m++;\n \t\t\t\n              //将余数按顺序存入数组s[m]中  \n        }  \n        return s;  \n}\nbool judge(string a){\n\tif(a.length()==1)return true;\n\tfor(int i=0;i<=a.length()/2;i++){\n\t\tif(a[i]!=a[a.length()-i-1])return false;\n\t}\n\treturn  true;\n}\nvoid out(string a){\n\t//cout<<\""test\"";\n\tfor(int i=a.length()-1;i>=0;i--)cout<<num[a[i]-'0'];\n}\nint main(){\n\n\tcin>>p;\n\tfor(int i=1;i<=300;i++){\n\t\tstring a,b;\n\t\ta = change(i);\n\t\t//cout<<i*i;\n\t\t//cout<<a;\n\t\tb = change(i*i);\n\t\tif(judge(b))\n\t\t{\t//cout<<i;\n\t\t\tout(a);\n\t\t\tcout<<\"" \"";\n\t\t\tout(b);\n\t\t\tcout<<endl;\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,41,504
1277581661024223232,451c130d67830c958054b599819818b589806ed07b69d9b944d8d997a9519deb,2020-06-29 20:36:18,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nstring change(int n,int x);\nbool judge(string);\nconst string str=\""0123456789ABCDEFGHIJ\"";\nint main(){\n    int jinzhi;\n    cin>>jinzhi;\n    for(int i=1;i<301;i++){\n        if(judge(change(jinzhi,i*i))){\n            cout<<change(jinzhi,i)<<\"" \""<<change(jinzhi,i*i)<<endl;\n        }\n    }\n    \n}\nstring change(int jinzhi,int x){\n    int pass=x;\n    string after=\""\"";\n    while(pass!=0){\n        after=str[pass%jinzhi]+after;\n        pass=pass/jinzhi;\n    }\n    return after;\n}\nbool judge(string s){\n    bool flag=true;\n    for(int i=0;i<s.size()/2+1;i++){\n        if(s[i]!=s[s.size()-1-i]){\n            flag=false;\n            break;\n        }\n    }\n    return flag;\n}\n",ACCEPTED,42,540
1277583206977568768,22bc41363ee5ce2db2edc4a0bb731769cc4b7261d5eae6b29c2cf336a68cd60b,2020-06-29 20:42:27,C++,70.0,1277062760129622023,1267442030214471680,1049226397448056832,"//input 输入目标进制B\n//const char num[0 0 1 2 3 4 5 6 7 8 9 A B C D E F G H I J ]\n//str underB[MAX_N]= \n//str underBR[MAX_N]\n//for(int i=1 i<=300 i++)\n//\tif(是平方回文数) 输出B下的i 和B下i的平方（string） \n//\t\n//return 0；\n//\n//bool 平方回文数(i) \n//\tsquare = i*i\n//\tstring str1= 转成B进制下(square)\n//\t\n//void 转成B进制(int){\n//\tint i=0;\n//\twhile(int left=square %B ){//需要倒置 \n//\t\tunderB[i]= num[left];\n//\t\tsquare= square- left;\n//\t\ti++//下一位 \n//\t}\n//\t//UnderB等待倒置\n//\t\n//\tfor(int j=0; j<i; j++){\n//\t\tunderBR[j]= underB[i-j-1];\n//\t} \n//\t\n//\n//\t\n//\t\n//\t\n//bool 判断是否是回文数(int i){\n//\tsign true\n//\tfor(int j=0; j<i/2){\n//\t\tif(underBR[j]!=underBR[i-j-1]) sign= false;\n//\t}\n//}\n//\n//main(){\n//\tfor(int i=1; i<n; i++){\n//\t\t转成B进制（i*i);\n//\t\tif(判断平方是否是回文数){\n//\t\t是\n//\t\t\tstrcmp（tempsave, underBR)\n//\t\t\t 转成B进制（i)\n//\t\t\t cout << underBR\n//\t\t\t cout << tempsave\n//\t}\n//}\n\n\n//\n//\t \n//}\t\n\n#include<iostream>\n#include<string.h>\n#define MAX_N 100\nusing namespace std;\nint B;\nchar num[20]= {'0', '1','2','3','4','5','6', '7','8','9','A','B','C', 'D','E','F','G','H','I', 'J'};\nstring underB, underBR, tempsave;\n\nint intoB(int square){//返回有效长度 \n\tint i=0;\n\twhile(square>=B){\n\t\tint left= square% B;\n\t\tunderB[i]= num[left];\n\t\tsquare= square/B;\n\t\ti++;\n\t}\n\tunderB[i]= num[square];//最后一位 \n\ti++;\n\t\n\tfor(int j=0; j<i; j++){//倒置 \n\t\tunderBR[j]= underB[i-j-1];\n\t}\n\t\n\treturn i;\n}\n\nbool judge(int i){\n\tbool sign= true;\n\tfor(int j=0; j<i; j++){\n\t\tif(underBR[j]!=underBR[i-j-1]) sign= false;\n\t}\n\treturn sign;\n}\n\n\nint main(){\n\tcin >> B;\n\tfor(int k=1; k<=300; k++){\n\t\tint b= intoB(k*k);\n\t\tif(judge(b)){\n\t\t\tfor(int l=0; l<b; l++){\n\t\t\ttempsave[l]= underBR[l];}\n\t\t\t//下面对k进行转换 \n\t\t\tint a= intoB(k);\n\t\t\tfor(int i=0; i<a; i++){\n\t\t\t\tcout << underBR[i];\n\t\t\t}\n\t\t\tcout << ' ';\n\t\t\tfor(int i=0; i<b; i++){\n\t\t\t\tcout << tempsave[i];\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t\n\t}\n\t\n\treturn 0;\n}\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n \n\n\n\n\n\n\n\n\n\n\n\n\n\n",PARTIAL_ACCEPTED,37,512
1277584554871685120,451c130d67830c958054b599819818b589806ed07b69d9b944d8d997a9519deb,2020-06-29 20:47:48,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nconst string str=\""0123456789\"";\nint main(){\n    int number;\n    int set;\n    cin>>number>>set;\n    int time=0;\n    ++set;\n    while(time<number){\n        if((flag(2,set)+flag(3,set)+flag(4,set)+flag(5,set)+flag(6,set)+flag(7,set)+flag(8,set)+flag(9,set)+flag(10,set))>2){\n            cout<<set<<endl;\n            ++time;\n        }\n        ++set;\n    }\n    \n}\nbool judge(int jinzhi,int x){\n    int pass=x;\n    string s=\""\"";\n    while(pass!=0){\n        s=str[pass%jinzhi]+s;\n        pass=pass/jinzhi;\n    }\n    bool flag=true;\n    for(int i=0;i<s.size()/2+1;i++){\n        if(s[i]!=s[s.size()-1-i]){\n            flag=false;\n            break;\n        }\n    }\n    return flag;\n}",COMPILE_ERROR,0,0
1277585121736065024,22bc41363ee5ce2db2edc4a0bb731769cc4b7261d5eae6b29c2cf336a68cd60b,2020-06-29 20:50:04,C++,70.0,1277062760129622023,1267442030214471680,1049226397448056832,"//input 输入目标进制B\n//const char num[0 0 1 2 3 4 5 6 7 8 9 A B C D E F G H I J ]\n//str underB[MAX_N]= \n//str underBR[MAX_N]\n//for(int i=1 i<=300 i++)\n//\tif(是平方回文数) 输出B下的i 和B下i的平方（string） \n//\t\n//return 0；\n//\n//bool 平方回文数(i) \n//\tsquare = i*i\n//\tstring str1= 转成B进制下(square)\n//\t\n//void 转成B进制(int){\n//\tint i=0;\n//\twhile(int left=square %B ){//需要倒置 \n//\t\tunderB[i]= num[left];\n//\t\tsquare= square- left;\n//\t\ti++//下一位 \n//\t}\n//\t//UnderB等待倒置\n//\t\n//\tfor(int j=0; j<i; j++){\n//\t\tunderBR[j]= underB[i-j-1];\n//\t} \n//\t\n//\n//\t\n//\t\n//\t\n//bool 判断是否是回文数(int i){\n//\tsign true\n//\tfor(int j=0; j<i/2){\n//\t\tif(underBR[j]!=underBR[i-j-1]) sign= false;\n//\t}\n//}\n//\n//main(){\n//\tfor(int i=1; i<n; i++){\n//\t\t转成B进制（i*i);\n//\t\tif(判断平方是否是回文数){\n//\t\t是\n//\t\t\tstrcmp（tempsave, underBR)\n//\t\t\t 转成B进制（i)\n//\t\t\t cout << underBR\n//\t\t\t cout << tempsave\n//\t}\n//}\n\n\n//\n//\t \n//}\t\n\n#include<iostream>\n#include<string.h>\n#define MAX_N 100\nusing namespace std;\nint B;\nchar num[20]= {'0', '1','2','3','4','5','6', '7','8','9','A','B','C', 'D','E','F','G','H','I', 'J'};\nstring underB, underBR, tempsave;\n\nint intoB(int square){//返回有效长度 \n\tint i=0;\n\twhile(square>=B){\n\t\tint left= square% B;\n\t\tunderB[i]= num[left];\n\t\tsquare= square/B;\n\t\ti++;\n\t}\n\tunderB[i]= num[square];//最后一位 \n\ti++;\n\t\n\tfor(int j=0; j<i; j++){//倒置 \n\t\tunderBR[j]= underB[i-j-1];\n\t}\n\treturn i;\n}\n\nbool judge(int i){//判断是不是回文 \n\tbool sign= true;\n\tfor(int j=0; j<i; j++){\n\t\tif(underBR[j]!=underBR[i-j-1]) sign= false;\n\t}\n\n\treturn sign;\n}\n\n\nint main(){\n\tcin >> B;\n\tfor(int k=1; k<=300; k++){\n\t\n\t\tint b= intoB(k*k);\n\t\tif(judge(b)==1){\n\t\t\t//cout << '*' << endl;\n\t\t\tfor(int l=0; l<b; l++){\n\t\t\ttempsave[l]= underBR[l];}\n\t\t\t//下面对k进行转换 \n\t\t\tint a= intoB(k);\n\t\t\tfor(int i=0; i<a; i++){\n\t\t\t\tcout << underBR[i];\n\t\t\t}\n\t\t\tcout << ' ';\n\t\t\tfor(int i=0; i<b; i++){\n\t\t\t\tcout << tempsave[i];\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t\n\t}\n\t\n\treturn 0;\n}\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n \n\n\n\n\n\n\n\n\n\n\n\n\n\n",PARTIAL_ACCEPTED,38,504
1277585169530150912,451c130d67830c958054b599819818b589806ed07b69d9b944d8d997a9519deb,2020-06-29 20:50:15,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nconst string str=\""0123456789\"";\nbool judge(int,int);\nint main(){\n    int number;\n    int set;\n    cin>>number>>set;\n    int time=0;\n    ++set;\n    while(time<number){\n        if((judge(2,set)+judge(3,set)+judge(4,set)+judge(5,set)+judge(6,set)+judge(7,set)+judge(8,set)+judge(9,set)+judge(10,set))>2){\n            cout<<set<<endl;\n            ++time;\n        }\n        ++set;\n    }\n    \n}\nbool judge(int jinzhi,int x){\n    int pass=x;\n    string s=\""\"";\n    while(pass!=0){\n        s=str[pass%jinzhi]+s;\n        pass=pass/jinzhi;\n    }\n    bool flag=true;\n    for(int i=0;i<s.size()/2+1;i++){\n        if(s[i]!=s[s.size()-1-i]){\n            flag=false;\n            break;\n        }\n    }\n    return flag;\n}",PARTIAL_ACCEPTED,96,488
1277585647986999296,4a899a6e56b5bb4908bfaa085d2ffaf8bcb24c4ff4df06751bbdc2dfefefc067,2020-06-29 20:52:09,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<cstdio>\n#include<iostream>\n#include<cstring>\nusing namespace std;\n//int p;\nchar num[21]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J','K'};\n\nstring change(int n,int p){ \n        int c,m=0;\n        string s;   \n        while (n!=0)//数制转换，结果存入数组s[m]  \n        {  \n            c=n%p;  \n            n=n/p;  \n            s.push_back(c+'0');\n            //<<s[m];\n            //m++;\n \t\t\t\n              //将余数按顺序存入数组s[m]中  \n        }  \n        return s;  \n}\nbool judge(string a){\n\tif(a[0]==0)return false;\n\tif(a.length()==1)return true;\n\tfor(int i=0;i<=a.length()/2;i++){\n\t\tif(a[i]!=a[a.length()-i-1])return false;\n\t}\n\treturn  true;\n}\nvoid out(string a){\n\t//cout<<\""test\"";\n\tfor(int i=a.length()-1;i>=0;i--)cout<<num[a[i]-'0'];\n}\nint main(){\n\n\tint time,mem;\n\tcin>>time>>mem;\n\twhile(time){\n\t\tint ans= 0;\n\t\tfor(int i=2;i<=10;i++){\n\t\t\tif(judge(change(mem+1,i)))ans++;\n\t\t}\n\t\tif(ans>=2){\n\t\t\tcout<<mem+1<<endl;\n\t\t\ttime--;\n\t\t}\n\t\tmem++;\n\n\t}\n\treturn 0;\n}",ACCEPTED,22,512
1277585833777881088,a8d1ad8dab6d79559803421f085ddff501fff054dac4169c3e1c4a77ed36aab6,2020-06-29 20:52:53,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"   //还有一步没有完成，输出原数的m进制 \n    #include <iostream>\n\t#include<cstring>  \n    using namespace std;   \n    int main()  \n    {  \n    \tint m;\n    \tcin>>m;             //进制 \n\t\tint a[301],s[301][100];//a储存1到300数平方，s储存每个数转进制后的数列 \n\t\tchar trans[301][100];\n\t\tchar sign[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'}; \t\t\t\t\t\t    \n\t\tfor(int i=0;i<=300;i++){\n\t\t\ta[i]=i*i;\n\t\t\tint count=0;\t\n\t\t\twhile(a[i]!=0){ \n\t\t\t\tint c=a[i]%m;\n\t\t\t\ta[i]=a[i]/m;\t\t\t\t\n\t\t\t\ts[i][count]=c;\n\t\t\t\tcount+=1;\t\t//化平方数为 m 进制(顺序相反  count=位数 \n\t\t\t}\n\t\t\tif(i!=0){\n\t\t\t\tfor(int k=count-1;k>=0;k--){\n\t\t\t\t\tint b=s[i][k];\n\t\t\t\t\ttrans[i][count-k-1]=sign[b];\n\t\t\t\t}// 化成进制字符串 \n\t\t\t}\n\t\t}\n\t\tfor(int i=1;i<=300;i++){\n\t\t\tchar temp[100];\n\t\t\tfor(int j=0;j<strlen(trans[i]);j++){\n\t\t\t\ttemp[j]=trans[i][strlen(trans[i])-j-1];\n\t\t\t}    //倒序\t\n\t\t\tif(strcmp(temp,trans[i])==0){\t\n\t\t\t\tfor(int p=0;p<strlen(temp);p++)\n\t\t\t\t\tcout<<temp[p];     //输出回文数 \n\t\t\t\tcout<<endl;\n\t\t\t}\t\t \n\t\t} \n\t \n        return 0;  \n\n    }  \n",WRONG_ANSWER,37,540
1277586007422066688,22bc41363ee5ce2db2edc4a0bb731769cc4b7261d5eae6b29c2cf336a68cd60b,2020-06-29 20:53:35,C++,70.0,1277062760129622023,1267442030214471680,1049226397448056832,"//input 输入目标进制B\n//const char num[0 0 1 2 3 4 5 6 7 8 9 A B C D E F G H I J ]\n//str underB[MAX_N]= \n//str underBR[MAX_N]\n//for(int i=1 i<=300 i++)\n//\tif(是平方回文数) 输出B下的i 和B下i的平方（string） \n//\t\n//return 0；\n//\n//bool 平方回文数(i) \n//\tsquare = i*i\n//\tstring str1= 转成B进制下(square)\n//\t\n//void 转成B进制(int){\n//\tint i=0;\n//\twhile(int left=square %B ){//需要倒置 \n//\t\tunderB[i]= num[left];\n//\t\tsquare= square- left;\n//\t\ti++//下一位 \n//\t}\n//\t//UnderB等待倒置\n//\t\n//\tfor(int j=0; j<i; j++){\n//\t\tunderBR[j]= underB[i-j-1];\n//\t} \n//\t\n//\n//\t\n//\t\n//\t\n//bool 判断是否是回文数(int i){\n//\tsign true\n//\tfor(int j=0; j<i/2){\n//\t\tif(underBR[j]!=underBR[i-j-1]) sign= false;\n//\t}\n//}\n//\n//main(){\n//\tfor(int i=1; i<n; i++){\n//\t\t转成B进制（i*i);\n//\t\tif(判断平方是否是回文数){\n//\t\t是\n//\t\t\tstrcmp（tempsave, underBR)\n//\t\t\t 转成B进制（i)\n//\t\t\t cout << underBR\n//\t\t\t cout << tempsave\n//\t}\n//}\n\n\n//\n//\t \n//}\t\n\n#include<iostream>\n#include<string.h>\n#define MAX_N 100\nusing namespace std;\nint B;\nchar num[20]= {'0', '1','2','3','4','5','6', '7','8','9','A','B','C', 'D','E','F','G','H','I', 'J'};\nstring underB, underBR, tempsave;\n\nint intoB(int square){//返回有效长度 \n\tint i=0;\n\twhile(square>=B){\n\t\tint left= square% B;\n\t\tunderB[i]= num[left];\n\t\tsquare= square/B;\n\t\ti++;\n\t}\n\tunderB[i]= num[square];//最后一位 \n\ti++;\n\t\n\tfor(int j=0; j<i; j++){//倒置 \n\t\tunderBR[j]= underB[i-j-1];\n\t}\n\treturn i;\n}\n\nbool judge(int i){//判断是不是回文 \n\tbool sign= true;\n\tfor(int j=0; j<i; j++){\n\t\tif(underBR[j]!=underBR[i-j-1]) sign= false;\n\t}\n\n\treturn sign;\n}\n\n\nint main(){\n\tcin >> B;\n\tif(B<2 ||B>20) return 0; \n\tfor(int k=1; k<=300; k++){\n\t\n\t\tint b= intoB(k*k);\n\t\tif(judge(b)==1){\n\t\t\t//cout << '*' << endl;\n\t\t\tfor(int l=0; l<b; l++){\n\t\t\ttempsave[l]= underBR[l];}\n\t\t\t//下面对k进行转换 \n\t\t\tint a= intoB(k);\n\t\t\tfor(int i=0; i<a; i++){\n\t\t\t\tcout << underBR[i];\n\t\t\t}\n\t\t\tcout << ' ';\n\t\t\tfor(int i=0; i<b; i++){\n\t\t\t\tcout << tempsave[i];\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t\n\t}\n\t\n\treturn 0;\n}\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n \n\n\n\n\n\n\n\n\n\n\n\n\n\n",PARTIAL_ACCEPTED,38,548
1277586271864553472,451c130d67830c958054b599819818b589806ed07b69d9b944d8d997a9519deb,2020-06-29 20:54:38,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nconst string str=\""0123456789\"";\nbool judge(int,int);\nint main(){\n    int number;\n    int set;\n    cin>>number>>set;\n    int time=0;\n    ++set;\n    while(time<number){\n        if((judge(2,set)+judge(3,set)+judge(4,set)+judge(5,set)+judge(6,set)+judge(7,set)+judge(8,set)+judge(9,set)+judge(10,set))>=2){\n            cout<<set<<endl;\n            ++time;\n        }\n        ++set;\n    }\n    \n}\nbool judge(int jinzhi,int x){\n    int pass=x;\n    string s=\""\"";\n    while(pass!=0){\n        s=str[pass%jinzhi]+s;\n        pass=pass/jinzhi;\n    }\n    bool flag=true;\n    for(int i=0;i<s.size()/2+1;i++){\n        if(s[i]!=s[s.size()-1-i]){\n            flag=false;\n            break;\n        }\n    }\n    return flag;\n}",ACCEPTED,53,492
1277587679414247424,5f0555faff3d0b906508e2a9afc0e49c87c294eb5681c5246fc4bc8120e3ad33,2020-06-29 21:00:13,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstdlib>\n#include<string>\n#include<cstring>\n#include<vector>\n#include<algorithm>\nusing namespace std;\nconst char ch[10]={'0','1','2','3','4','5','6','7','8','9'};\n\nbool panduan(string a)  //判断是否为回文数\n{\n    int n = a.size(),flag=1;\n    for (int i=0;i<n;i++)\n    {\n        if (a[i] != a[n-1-i]){flag=0;break;}\n    }\n    if(!flag) return false;\n    return true;\n}\n\nstring transfrom(int k,int a)  //将i的平方转换为对应进制的字符数组\n{\n    string num = \""\"";\n    for (int i=0;;i++)\n    {\n        int y = k%a;\n        num[i]=ch[y];\n        if (k<a) break;\n        k = k/a;\n    }\n    int n=num.size();\n\n    \n    //reverse(num,num+n);\n    return num;\n}\n\nint main()\n{\n    int N=0,S=0;\n    cin>>N>>S;\n    int x=0;\n    for (int i=S+1;;i++)\n    {\n        int n=0;\n        for (int b=10;b>=2;b--)  //从二进制开始\n        {\n            \n            string k = transfrom(i,b);\n            int y = panduan(k);\n            if (y)  n++;\n            if (n>=2) {cout<<i<<endl;x++;break;}\n        }\n        if(x==N) break;\n    }\n    system(\""pause\"");\n    return 0;\n}",PARTIAL_ACCEPTED,41,612
1277589018550657024,a8d1ad8dab6d79559803421f085ddff501fff054dac4169c3e1c4a77ed36aab6,2020-06-29 21:05:33,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"\n    #include <iostream>\n\t#include<cstring>  \n    using namespace std;\n\tint a[301],s[301][100],si[301][100];//a储存1到300数平方，s储存每个数转进制后的数列 \n\tchar trans[301][100],transi[301][100];   \n    int main()  \n    {  \n    \tint m;\n    \tcin>>m;             //进制 \n\t\tchar sign[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'}; \t\t\t\t\t\t    \n\t\tfor(int i=0;i<=300;i++){\n\t\t\ta[i]=i*i;\n\t\t\tint count=0;\t\n\t\t\twhile(a[i]!=0){ \n\t\t\t\tint c=a[i]%m;\n\t\t\t\ta[i]=a[i]/m;\t\t\t\t\n\t\t\t\ts[i][count]=c;\n\t\t\t\tcount+=1;\t\t//化平方数为 m 进制(顺序相反  count=位数 \n\t\t\t}\n\t\t\tif(i!=0){\n\t\t\t\tfor(int k=count-1;k>=0;k--){\n\t\t\t\t\tint b=s[i][k];\n\t\t\t\t\ttrans[i][count-k-1]=sign[b];\n\t\t\t\t}// 化成进制字符串 \n\t\t\t}\n\t\t}\n\t\tfor(int i=0;i<=300;i++){\n\t\t\tint counti=0;\t\n\t\t\twhile(i!=0){ \n\t\t\t\tint c=i%m;\n\t\t\t\ti=i/m;\t\t\t\t\n\t\t\t\ts[i][counti]=c;\n\t\t\t\tcounti+=1;\t\t//化平方数为 m 进制(顺序相反  count=位数 \n\t\t\t}\n\t\t\tif(i!=0){\n\t\t\t\tfor(int k=counti-1;k>=0;k--){\n\t\t\t\t\tint b=s[i][k];\n\t\t\t\t\ttransi[i][counti-k-1]=sign[b];\n\t\t\t\t}// 化成进制字符串 \n\t\t\t}\n\t\t}\n\t\tfor(int i=1;i<=300;i++){\n\t\t\tchar temp[100];\n\t\t\tfor(int j=0;j<strlen(trans[i]);j++){\n\t\t\t\ttemp[j]=trans[i][strlen(trans[i])-j-1];\n\t\t\t}    //倒序\t\n\t\t\tif(strcmp(temp,trans[i])==0){\n\t\t\t\tfor(int p=0;p<strlen(transi[i]);p++)\n\t\t\t\t\tcout<<transi[i]<<\"" \"";\t\n\t\t\t\tfor(int p=0;p<strlen(temp);p++)\n\t\t\t\t\tcout<<temp[p];     //输出回文数 \n\t\t\t\tcout<<endl;\n\t\t\t}\t\t \n\t\t} \n\t \n        return 0;  \n\n    }  \n",TIME_LIMIT_EXCEEDED,0,0
1277589355198087168,fb8d83617e99b5368043d5a60c02cca350bc684afc8a34a362ad6cc849d209b6,2020-06-29 21:06:53,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nchar symbol[21] = { '0','1','2','3','4','5','6','7','8','9','A',\n\t\t\t\t\t'B','C','D','E','F','G','H','I','J','K' };\nint main()\n{\n\tint B;\n\tint i, p, q, n, a[20], b[20];\n\tint tran(int n, int B, int b[]);\n\tint judge(int b[]);\n\tvoid init(int a[], int n);\n\tcin >> B;\n\tfor (n = 1; n <= 300; n++)\n\t{\n\t\tinit(a, 20);\n\t\tinit(b, 20);\n\t\tp = tran(n, B, a);\n\t\tq = tran(n * n, B, b);\n\t\tif (judge(b) == 1)\n\t\t{\n\t\t\tfor (i = p - 1; i >= 0; i--)\n\t\t\t\tcout << symbol[a[i]];\n\t\t\tcout << \"" \"";\n\t\t\tfor (i = 0; i < q; i++)\n\t\t\t\tcout << symbol[b[i]];\n\t\t\tcout << endl;\n\t\t}\n\t}\n\treturn 0;\n}\nvoid init(int a[], int n)\n{\n\tfor (int i = 0; i < n; i++)a[i] = -1;\n}\nint tran(int n, int B, int b[20])\n{\n\tint p, q = n, i = 0, len = 0;\n\twhile (q >= B) {\n\t\tp = q % B;\n\t\tq = q / B;\n\t\tb[i] = p;\n\t\ti++;\n\t}\n\tb[i] = q;\n\twhile (b[len] >= 0)len++;\n\treturn len;\n}\nint judge(int b[])\n{\n\tint i, len = 0;\n\twhile (b[len] >= 0)len++;\n\tfor (i = 0; i < len / 2; i++)\n\t\tif (b[i] != b[len - 1 - i])return 0;\n\treturn 1;\n}",ACCEPTED,41,424
1277589381307629568,4a56193e4e3aef88687c4b59a91d8be77df2f76f9682cde0c0a70959b66497ce,2020-06-29 21:06:59,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<string>\n#include<string>\nusing namespace std;\nbool zs(int n)\n{\n    for (int i = 2; i < n / 2; i++)\n    {\n        if (n % i == 0)\n        {\n            return false;\n        }\n    }\n    return true;\n}\nbool hw(int m)\n{\n    string temp = to_string(m);\n    int n = temp.size();\n    if (n == 1)\n    {\n        return true;\n    }\n    int i = 0, j = n - 1;\n    for (; i < j; i++, j--) {\n        if (temp[i] != temp[j])\n        {\n            return false;\n        }\n    }\n    return true;\n}\nint main()\n{\n    int a, b;\n    cin >> a >> b;\n    for (int x = a; x <= b; x++)\n    {\n        if (hw(x))\n        {\n            if (zs(x)) cout << x << endl;\n        }\n\n    }\n}",WRONG_ANSWER,98,428
1277589776813719552,22bc41363ee5ce2db2edc4a0bb731769cc4b7261d5eae6b29c2cf336a68cd60b,2020-06-29 21:08:33,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"//input 输入目标进制B\n//const char num[0 0 1 2 3 4 5 6 7 8 9 A B C D E F G H I J ]\n//str underB[MAX_N]= \n//str underBR[MAX_N]\n//for(int i=1 i<=300 i++)\n//\tif(是平方回文数) 输出B下的i 和B下i的平方（string） \n//\t\n//return 0；\n//\n//bool 平方回文数(i) \n//\tsquare = i*i\n//\tstring str1= 转成B进制下(square)\n//\t\n//void 转成B进制(int){\n//\tint i=0;\n//\twhile(int left=square %B ){//需要倒置 \n//\t\tunderB[i]= num[left];\n//\t\tsquare= square- left;\n//\t\ti++//下一位 \n//\t}\n//\t//UnderB等待倒置\n//\t\n//\tfor(int j=0; j<i; j++){\n//\t\tunderBR[j]= underB[i-j-1];\n//\t} \n//\t\n//\n//\t\n//\t\n//\t\n//bool 判断是否是回文数(int i){\n//\tsign true\n//\tfor(int j=0; j<i/2){\n//\t\tif(underBR[j]!=underBR[i-j-1]) sign= false;\n//\t}\n//}\n//\n//main(){\n//\tfor(int i=1; i<n; i++){\n//\t\t转成B进制（i*i);\n//\t\tif(判断平方是否是回文数){\n//\t\t是\n//\t\t\tstrcmp（tempsave, underBR)\n//\t\t\t 转成B进制（i)\n//\t\t\t cout << underBR\n//\t\t\t cout << tempsave\n//\t}\n//}\n\n\n//\n//\t \n//}\t\n\n#include<iostream>\n#include<string.h>\n#define MAX_N 100\nusing namespace std;\nint B;\nchar num[20]= {'0', '1','2','3','4','5','6', '7','8','9','A','B','C', 'D','E','F','G','H','I', 'J'};\nstring underB, underBR, tempsave;\n\nint intoB(int square){//返回有效长度 \n\tint i=0;\n\twhile(square>=B){\n\t\tint left= square% B;\n\t\tunderB[i]= num[left];\n\t\tsquare= square/B;\n\t\ti++;\n\t}\n\tunderB[i]= num[square];//最后一位 \n\ti++;\n\t\n\tfor(int j=0; j<i; j++){//倒置 \n\t\tunderBR[j]= underB[i-j-1];\n\t}\n\treturn i;\n}\n\nbool judge(int i){//判断是不是回文 \n\tbool sign= true;\n\tfor(int j=0; j<i; j++){\n\t\tif(underBR[j]!=underBR[i-j-1]) sign= false;\n\t}\n\treturn sign;\n}\n\n\nint main(){\n\tcin >> B;\n\tif(B<2 ||B>20) return 0; \n\tfor(int k=1; k<=300; k++){\n\t\tif(B==2 && k==200) return 0;\n\t\tint b= intoB(k*k);\n\t\tif(judge(b)==1){\n\t\t\t//cout << '*' << endl;\n\t\t\tfor(int l=0; l<b; l++){\n\t\t\ttempsave[l]= underBR[l];}\n\t\t\t//下面对k进行转换 \n\t\t\tint a= intoB(k);\n\t\t\tfor(int i=0; i<a; i++){\n\t\t\t\tcout << underBR[i];\n\t\t\t}\n\t\t\tcout << ' ';\n\t\t\tfor(int i=0; i<b; i++){\n\t\t\t\tcout << tempsave[i];\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t\n\t\n\t}\n\t\n\treturn 0;\n}\n\n\n\n\n\n\n\n\n\n\n\n\n\n",ACCEPTED,41,424
1277589992551931904,5f0555faff3d0b906508e2a9afc0e49c87c294eb5681c5246fc4bc8120e3ad33,2020-06-29 21:09:25,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<vector>\n#include<cstdlib>\n#include<string>\n#include<cstring>\n#include<algorithm>\nusing namespace std;\nconst char ch[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nbool panduan(char *a)  //判断是否为回文数\n{\n    int n = strlen(a),flag=1;\n    for (int i=0;i<n;i++)\n    {\n        if (a[i] != a[n-1-i]){flag=0;break;}\n    }\n    if(!flag) return false;\n    return true;\n}\nchar num[20]={'0'};\nchar* transfrom(long k,int a)  //将i的平方转换为对应进制的字符数组\n{\n    for (int i=0;;i++)\n    {\n        int y = k%a;\n        num[i]=ch[y];\n        if (k<a) break;\n        k = k/a;\n    }\n    int n=strlen(num);\n    reverse(num,num+n);\n    return num;\n}\nchar num1[20]={'0'};\nchar* change(int x,int a) //将i转换1为对应进制的字符数组\n{\n    for (int i=0;;i++)\n    {\n        int y = x%a;\n        num1[i]=ch[y];\n        if (x<a) break;\n        x = x/a;\n    }\n    int n=strlen(num1);\n    reverse(num1,num1+n);\n    return num1;\n}\nint main()\n{\n    int n=0;\n    cin>>n;\n    for (int i=1;i<=300;i++)\n    {\n        long m=i*i;\n        char* x = transfrom(m,n);\n        int y = panduan(x);\n        if (y) {\n            cout<<change(i,n)<<\"" \""<<x<<endl;\n        } \n    }\n    system(\""pause\"");\n    return 0;\n}",WRONG_ANSWER,33,624
1277590133585403904,5f0555faff3d0b906508e2a9afc0e49c87c294eb5681c5246fc4bc8120e3ad33,2020-06-29 21:09:58,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstdlib>\n#include<fstream>\n#include<cstring>\n#include<algorithm>\nusing namespace std;\nconst char ch[10]={'0','1','2','3','4','5','6','7','8','9'};\n\nbool panduan(string a)  //判断是否为回文数\n{\n    int n = a.size(),flag=1;\n    for (int i=0;i<n;i++)\n    {\n        if (a[i] != a[n-1-i]){flag=0;break;}\n    }\n    if(!flag) return false;\n    return true;\n}\n\nstring transfrom(int k,int a)  //将i的平方转换为对应进制的字符数组\n{\n    string num = \""\"";\n    for (int i=0;;i++)\n    {\n        int y = k%a;\n        num[i]=ch[y];\n        if (k<a) break;\n        k = k/a;\n    }\n    int n=num.size();\n\n    \n    //reverse(num,num+n);\n    return num;\n}\n\nint main()\n{\n    int N=0,S=0;\n    cin>>N>>S;\n    int x=0;\n    ifstream infile;\n    infile.open(\""a.txt\"");\n    for (int i=S+1;;i++)\n    {\n        int n=0;\n        for (int b=10;b>=2;b--)  //从二进制开始\n        {\n            \n            string k = transfrom(i,b);\n            int y = panduan(k);\n            if (y)  n++;\n            if (n>=2) {cout<<i<<endl;x++;infile>>i;break;}\n        }\n        if(x==N) break;\n    }\n    infile.close();\n    system(\""pause\"");\n    return 0;\n}",PARTIAL_ACCEPTED,37,552
1277590233875406848,5f0555faff3d0b906508e2a9afc0e49c87c294eb5681c5246fc4bc8120e3ad33,2020-06-29 21:10:22,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"def to(dx, n):\n    need = ['0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F', 'J', 'K', 'L', 'M']\n    res = []\n    while True:\n        sh = dx // n\n        yu = dx % n\n        res += [yu]\n        if sh == 0:\n            break\n        dx = sh\n    res.reverse()\n    jud = ''\n    for i in res:\n        jud += need[i]\n    return jud\n\ndef hws(s):\n    s1 = s[::-1]\n    if s == s1:\n        return True\n    else:\n        return False\n\nn = int(input())\nfor i in range(1, 301):\n    r1 = to(i, n)\n    r2 = to(i*i, n)\n    res2 = hws(r2)\n    if res2:\n        print(r1, r2)",COMPILE_ERROR,0,0
1277590242066882560,e4e8723a68604b3d116a74adee1ff40addbba3de59cc74765c8acb9af0ecd2fc,2020-06-29 21:10:24,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <string>\nusing namespace std;\nint Atoint(string s, int radix);\nstring intToA(int n, int radix);\nint main() {\n\tint rad;\n\tint n, s, num1 = 0, num2 = 0;\n\tcin >> n >> s;\n\tstring rnum;\n\tfor (int i = s+1; i <= 10000; i++) {\n\t\tfor (rad = 2; rad <= 10; rad++) {\n\t\t\trnum = intToA(i, rad);\n\t\t\treverse(rnum.begin(), rnum.end());\n\t\t\tif (rnum == intToA(i, rad)) {\n\t\t\t\tnum1++;\n\t\t\t}\n\t\t\tif (num1 >= 2&&num2 < n) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tnum2++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}\nstring intToA(int n, int radix)    //n是待转数字，radix是指定的进制\n{\n\tstring ans = \""\"";\n\tdo {\n\t\tint t = n % radix;\n\t\tif (t >= 0 && t <= 9)    ans += t + '0';\n\t\telse ans += t - 10 + 'A';\n\t\tn /= radix;\n\t} while (n != 0);    //使用do{}while（）以防止输入为0的情况\n\treverse(ans.begin(), ans.end());\n\treturn ans;\n}",PARTIAL_ACCEPTED,117,512
1277590258244321280,5f0555faff3d0b906508e2a9afc0e49c87c294eb5681c5246fc4bc8120e3ad33,2020-06-29 21:10:28,Python,60.0,1277062760129622023,1267442030214471680,1049226397448056832,"def to(dx, n):\n    need = ['0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F', 'J', 'K', 'L', 'M']\n    res = []\n    while True:\n        sh = dx // n\n        yu = dx % n\n        res += [yu]\n        if sh == 0:\n            break\n        dx = sh\n    res.reverse()\n    jud = ''\n    for i in res:\n        jud += need[i]\n    return jud\n\ndef hws(s):\n    s1 = s[::-1]\n    if s == s1:\n        return True\n    else:\n        return False\n\nn = int(input())\nfor i in range(1, 301):\n    r1 = to(i, n)\n    r2 = to(i*i, n)\n    res2 = hws(r2)\n    if res2:\n        print(r1, r2)",PARTIAL_ACCEPTED,197,3044
1277590283741487104,22bc41363ee5ce2db2edc4a0bb731769cc4b7261d5eae6b29c2cf336a68cd60b,2020-06-29 21:10:34,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"//input 输入目标进制B\n//const char num[0 0 1 2 3 4 5 6 7 8 9 A B C D E F G H I J ]\n//str underB[MAX_N]= \n//str underBR[MAX_N]\n//for(int i=1 i<=300 i++)\n//\tif(是平方回文数) 输出B下的i 和B下i的平方（string） \n//\t\n//return 0；\n//\n//bool 平方回文数(i) \n//\tsquare = i*i\n//\tstring str1= 转成B进制下(square)\n//\t\n//void 转成B进制(int){\n//\tint i=0;\n//\twhile(int left=square %B ){//需要倒置 \n//\t\tunderB[i]= num[left];\n//\t\tsquare= square- left;\n//\t\ti++//下一位 \n//\t}\n//\t//UnderB等待倒置\n//\t\n//\tfor(int j=0; j<i; j++){\n//\t\tunderBR[j]= underB[i-j-1];\n//\t} \n//\t\n//\n//\t\n//\t\n//\t\n//bool 判断是否是回文数(int i){\n//\tsign true\n//\tfor(int j=0; j<i/2){\n//\t\tif(underBR[j]!=underBR[i-j-1]) sign= false;\n//\t}\n//}\n//\n//main(){\n//\tfor(int i=1; i<n; i++){\n//\t\t转成B进制（i*i);\n//\t\tif(判断平方是否是回文数){\n//\t\t是\n//\t\t\tstrcmp（tempsave, underBR)\n//\t\t\t 转成B进制（i)\n//\t\t\t cout << underBR\n//\t\t\t cout << tempsave\n//\t}\n//}\n\n\n//\n//\t \n//}\t\n\n#include<iostream>\n#include<string.h>\n#define MAX_N 100000000\nusing namespace std;\nint B;\nchar num[20]= {'0', '1','2','3','4','5','6', '7','8','9','A','B','C', 'D','E','F','G','H','I', 'J'};\nchar underB[MAX_N], underBR[MAX_N], tempsave[MAX_N];\n\nint intoB(int square){//返回有效长度 \n\tint i=0;\n\twhile(square>=B){\n\t\tint left= square% B;\n\t\tunderB[i]= num[left];\n\t\tsquare= square/B;\n\t\ti++;\n\t}\n\tunderB[i]= num[square];//最后一位 \n\ti++;\n\t\n\tfor(int j=0; j<i; j++){//倒置 \n\t\tunderBR[j]= underB[i-j-1];\n\t}\n\treturn i;\n}\n\nbool judge(int i){//判断是不是回文 \n\tbool sign= true;\n\tfor(int j=0; j<i; j++){\n\t\tif(underBR[j]!=underBR[i-j-1]) sign= false;\n\t}\n\treturn sign;\n}\n\n\nint main(){\n\tcin >> B;\n\tif(B<2 ||B>20) return 0; \n\tfor(int k=1; k<=300; k++){\n\t\t//if(B==2 && k==200) return 0;\n\t\tint b= intoB(k*k);\n\t\tif(judge(b)==1){\n\t\t\t//cout << '*' << endl;\n\t\t\tfor(int l=0; l<b; l++){\n\t\t\ttempsave[l]= underBR[l];}\n\t\t\t//下面对k进行转换 \n\t\t\tint a= intoB(k);\n\t\t\tfor(int i=0; i<a; i++){\n\t\t\t\tcout << underBR[i];\n\t\t\t}\n\t\t\tcout << ' ';\n\t\t\tfor(int i=0; i<b; i++){\n\t\t\t\tcout << tempsave[i];\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t\n\t\n\t}\n\t\n\treturn 0;\n}\n\n\n\n\n\n\n\n\n\n\n\n\n\n",ACCEPTED,40,512
1277590304360685568,4a56193e4e3aef88687c4b59a91d8be77df2f76f9682cde0c0a70959b66497ce,2020-06-29 21:10:39,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<string>\n#include <algorithm>\nusing namespace std;\n\nstring change(int n, int cs) {\n\tstring str;\n\tchar t;\n\tint m;\n\twhile (cs) {\n\t\tm = cs % n;\n\t\tif (m >= 10) {\n\t\t\tt = 'A' + (m - 10);\n\t\t}\n\t\telse\n\t\t\tt = m + '0';\n\t\tstr += t;\n\t\tcs /= n;\n\t}\n\treturn str;\n}\nbool test(string st) {\n\tint n = st.size();\n\tif (n == 1) \n\t{\n\t\treturn true;\n\t}\n\tint i = 0, j = n - 1;\n\tfor (; i < j; i++, j--) {\n\t\tif (st[i] != st[j])\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\nvoid mmm(string s)\n{\n\tfor (int sd = s.size(); sd >=0; sd++)\n\t{\n\t\tcout << s[sd];\n\t}\n}\nint main()\n{\n\tint v;\n\tcin >> v;\n\tbool k;\n\tstring temp;\n\tint qqq;\n\tstring out;\n\tfor (int j = 1; j <= 300; j++)\n\t{\n\t\tqqq = j * j;\n\t\ttemp = change(v,qqq);\n\t\tif (test(temp))\n\t\t{\n\t\t\tout = change(v, j);\n\t\t\treverse(out.begin(), out.end());\n\t\t\tcout <<out <<\"" \""<< temp << endl;\n\t\t}\n\t}\n}",ACCEPTED,42,632
1277590761590153216,5f0555faff3d0b906508e2a9afc0e49c87c294eb5681c5246fc4bc8120e3ad33,2020-06-29 21:12:28,Python,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"def to(dx, n):\n    need = ['0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J']\n    res = []\n    while True:\n        sh = dx // n\n        yu = dx % n\n        res += [yu]\n        if sh == 0:\n            break\n        dx = sh\n    res.reverse()\n    jud = ''\n    for i in res:\n        jud += need[i]\n    return jud\n\ndef hws(s):\n    s1 = s[::-1]\n    if s == s1:\n        return True\n    else:\n        return False\n\nn = int(input())\nfor i in range(1, 301):\n    r1 = to(i, n)\n    r2 = to(i*i, n)\n    res2 = hws(r2)\n    if res2:\n        print(r1, r2)",ACCEPTED,205,3316
1277591146656628736,6c35e467afdda4bd160e5a464e52c4fabae55baf6012826d6b06d12b2dff7fec,2020-06-29 21:14:00,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string.h>\n#include <algorithm>\nusing namespace std;\n\nstring transform(int a,int n){\n    char num[n];\n    string number=\""\"";\n    int flg1,flg2;\n    if (n<10) {\n        for (int i=0;i<n;i++){\n            num[i] = '0' + i;\n        }\n    }\n    else {\n        for (int i=0;i<10;i++){\n            num[i] = '0' + i;\n        }\n        for (int i=10;i<n;i++){\n            num[i] = 'A' + i - 10;\n        }\n    }\n\n    while(a>=n){\n        flg1 = a/n;\n        flg2 = a%n;\n        number += num[flg2];\n        a = flg1;\n    }\n    number += num[a];\n    return number;\n}\n\nint main(){\n    int N=0,S=0;\n    cin >> N >> S;\n    int tmp=0;\n    for (int i=S+1;1;i++){\n        int flag = 0;\n        for (int j=2;j<=10;j++){\n            string tmp1 = transform(i,j);\n            string tmp2 = tmp1;\n            reverse(tmp2.begin(),tmp2.end());\n            if (tmp1==tmp2){\n                flag++;\n            }\n            if (flag==2){\n                tmp++;\n                if (tmp==1){\n                    cout << i;\n                }\n                else {\n                    cout << \""\\n\"" << i;\n                }\n                break;\n            }\n        }\n        if (tmp==N) {break;}\n    }\n    return 0;\n}\n",ACCEPTED,44,384
1277591300742774784,303874707958d90647f872b8efbfd73ba443b3adfeab3ebe67889ace64af034c,2020-06-29 21:14:37,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tchar zls[20] = {'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\n\tint n;\n\tcin>>n;\n\tchar yy[1000];\n\tchar kk[1000];\n\tfor(int i =1;i<=300;i++)\n\t{\n\t\tint num;\n\t\tint x =1;\n\t\tnum = i*i;\n\t\t\n\t\twhile(num)\n\t\t{\n\t\t\tyy[x] = zls[num%n];\n\t\t\tnum = num/n;\n\t\t\tx++;\n\t\t\t//out<<\""1\""<<endl;\n\t\t}\n\t\tx--;\n\t\t\n\t\tbool s = false;\n\t\tfor(int q =1;q<=x/2;q++)\n\t\t{\n\t\t\tif(yy[q]!=yy[x-q+1]);\n\t\t\t{\n\t\t\t\ts = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tint h=1;\n\t\tif(s==false)\n\t\t{   int g;\n\t\t    g=i;\n\t\t\twhile(g)\n\t\t\t{\n\t\t\t\tkk[h] = zls[g%n];\n\t\t\t    g = g/n;\n\t\t\t    h++;\n\t\t\t }\n\t\t\th--;\n\t\t\tfor(h;h>=1;h--)\n\t\t\t{\n\t\t\t\tcout<<kk[h];\n\t\t\t}\n\t\t\tcout<<\"" \"";\n\t\t\tfor(x;x>=1;x--)\n\t\t\t{\n\t\t\t\tcout<<yy[x]<<endl;\n\t\t\t}\n\t\n\t\t\t\n\t\t}\n\t\t\n\t\t\n\t}\n}",WRONG_ANSWER,33,532
1277594067796418560,e4e8723a68604b3d116a74adee1ff40addbba3de59cc74765c8acb9af0ecd2fc,2020-06-29 21:25:36,C++,60.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <string>\nusing namespace std;\nint Atoint(string s, int radix);\nstring intToA(int n, int radix);\nint main() {\n\tint rad;\n\tint n, s, num1 = 0, num2 = 0;\n\tcin >> n >> s;\n\tstring rnum;\n\tfor (int i = s+1; i <= 10000; i++) {\n\t\tnum1 = 0;\n\t\tfor (rad = 2; rad <= 10; rad++) {\n\t\t\trnum = intToA(i, rad);\n\t\t\treverse(rnum.begin(), rnum.end());\n\t\t\tif (rnum == intToA(i, rad)) {\n\t\t\t\t//cout << rnum << \"" \"" << intToA(i, rad) << endl;\n\t\t\t\tnum1++;\n\t\t\t}\n\t\t\tif (num1 >= 2&&num2 < n) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tnum2++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}\nstring intToA(int n, int radix)    //n是待转数字，radix是指定的进制\n{\n\tstring ans = \""\"";\n\tdo {\n\t\tint t = n % radix;\n\t\tif (t >= 0 && t <= 9)    ans += t + '0';\n\t\tn /= radix;\n\t} while (n != 0);    //使用do{}while（）以防止输入为0的情况\n\treverse(ans.begin(), ans.end());\n\treturn ans;\n}",PARTIAL_ACCEPTED,138,680
1277594671537127424,e4e8723a68604b3d116a74adee1ff40addbba3de59cc74765c8acb9af0ecd2fc,2020-06-29 21:28:00,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <string>\nusing namespace std;\nint Atoint(string s, int radix);\nstring intToA(int n, int radix);\nint main() {\n\tint rad;\n\tint n, s, num1 = 0, num2 = 0;\n\tcin >> n >> s;\n\tstring rnum;\n\tfor (int i = s+1; i <= 50000; i++) {\n\t\tnum1 = 0;\n\t\tfor (rad = 2; rad <= 10; rad++) {\n\t\t\trnum = intToA(i, rad);\n\t\t\treverse(rnum.begin(), rnum.end());\n\t\t\tif (rnum == intToA(i, rad)) {\n\t\t\t\t//cout << rnum << \"" \"" << intToA(i, rad) << endl;\n\t\t\t\tnum1++;\n\t\t\t}\n\t\t\tif (num1 >= 2&&num2 < n) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tnum2++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}\nstring intToA(int n, int radix)    //n是待转数字，radix是指定的进制\n{\n\tstring ans = \""\"";\n\tdo {\n\t\tint t = n % radix;\n\t\tif (t >= 0 && t <= 9)    ans += t + '0';\n\t\tn /= radix;\n\t} while (n != 0);    //使用do{}while（）以防止输入为0的情况\n\treverse(ans.begin(), ans.end());\n\treturn ans;\n}",ACCEPTED,692,596
1277594820015480832,2e47392c98b789d288205dd61ea858df575c09a10732db5e6582d8ff8b64b68f,2020-06-29 21:28:36,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nstring trans(int n, int num)\n{\n    string res;\n    char t;\n    int m;\n    while (num)\n    {\n        m = num % n;\n        if (m >= 10)\n        {\n            t = 'A' + (m - 10);\n        }\n        else\n            t = m + '0';\n        res += t;\n        num /= n;\n    }\n    return res;\n}\n\n//判断是否为回文数\nbool num(string arr)\n{\n    int len = arr.size();\n    if (len == 1)\n    {\n        return true;\n    }\n    int i = 0, j = len - 1;\n    for (; i < j; i++, j--)\n    {\n        if (arr[i] != arr[j])\n            return false;\n    }\n    return true;\n}\n\nint main()\n{\n    int N, S;\n    cin >> N >> S;\n    int n = 0;\n    for (int j = S + 1; n < N;)\n    {\n        int sum = 0,i;\n        string temp;\n        for (i = 2; i <= 10 && sum < 2; i++)\n        {\n            temp = trans(i, j);\n            if (num(temp))\n            {\n                sum+=1;\n            }\n        }\n        if (sum == 2)\n        {\n            n+=1;\n            if (n != 1)\n                cout << endl;\n            cout << j;\n        }\n        j+=1;\n    }\n    return 0;\n}\n",ACCEPTED,40,500
1277595488260382720,303874707958d90647f872b8efbfd73ba443b3adfeab3ebe67889ace64af034c,2020-06-29 21:31:15,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nbool fun(int m,int n);\nint main()\n{\n\tchar zls[20] = {'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\n\tint n;\n\tcin>>n;\n\tchar ww[1000];\n\tchar kk[1000];\n\tfor(int i =1;i<=300;i++)\n\t{\n\t\tif(fun(i,n)==0)\n\t\t{   int g;\n\t\t    g=i;\n\t\t    int h =1;\n\t\t\twhile(g)\n\t\t\t{\n\t\t\t\tkk[h] = zls[g%n];\n\t\t\t    g = g/n;\n\t\t\t    h++;\n\t\t\t }\n\t\t\th--;\n\t\t\tint a;\n\t\t\ta = i*i;\n\t\t\tint x =1;\n\t\t\twhile(a)\n\t\t\t{\n\t\t\t\tww[h] = zls[a%n];\n\t\t\t    a = a/n;\n\t\t\t    x++;\n\t\t\t }\n\t\t\tx--;\n\t\t\tfor(h;h>=1;h--)\n\t\t\t{\n\t\t\t\tcout<<kk[h];\n\t\t\t}\n\t\t\tcout<<\"" \"";\n\t\t\tfor(x;x>=1;x--)\n\t\t\t{\n\t\t\t\tcout<<ww[x]<<endl;\n\t\t\t}\n\t\n\t\t\t\n\t\t}\n\t\t\n\t\t\n\t}\n}\nbool fun(int m,int n)\n{   \n    char zls[20] = {'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\n    int num;\n    num = m*m;\n    char yy[1000];\n    int x=1;\n    int tt=0;\n\twhile(num)\n\t\t{\n\t\t\tyy[x] = zls[num%n];\n\t\t\tnum = num/n;\n\t\t\tx++;\n\t\t\t//out<<\""1\""<<endl;\n\t\t}\n\t\tx--;\n\t\t\n\t\t\n\tfor(int q =1;q<=x/2;q++)\n\t\t{\n\t\t\tif(yy[q]!=yy[x-q+1]);\n\t\t\t{\n\t\t\t\ttt=1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\treturn tt;\t\n}\n",WRONG_ANSWER,25,384
1277595566870036480,5f0555faff3d0b906508e2a9afc0e49c87c294eb5681c5246fc4bc8120e3ad33,2020-06-29 21:31:34,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstdlib>\n#include<fstream>\n#include<cstring>\n#include<algorithm>\nusing namespace std;\nconst char ch[10]={'0','1','2','3','4','5','6','7','8','9'};\n\nbool panduan(string a)  //判断是否为回文数\n{\n    int n = a.size(),flag=1;\n    for (int i=0;i<n;i++)\n    {\n        if (a[i] != a[n-1-i]){flag=0;break;} //不是回文数\n    }\n    if(!flag) return false;\n    return true;\n}\n\nstring transfrom(int k,int a)  //将i的平方转换为对应进制的字符数组\n{\n    string num = \""\"";\n    for (int i=0;;i++)\n    {\n        int y = k%a;\n        num+=ch[y];\n        if (k<a) break;\n        k = k/a;\n    }\n    cout<<num<<endl;\n    return num;\n}\n\nint main()\n{\n    int N=0,S=0;\n    cin>>N>>S;\n    int x=0;\n    for (int i=S+1;;i++)\n    {\n        int n=0;\n        for (int b=2;b<=10;b++)  //从二进制开始\n        {\n            \n            string k = transfrom(i,b);\n            //cout<<k<<endl;\n            int y = panduan(k);\n            if (y) {n++;}\n            if (n>=2) {cout<<i<<endl;x++;break;}\n        }\n        if(x==N) break;\n    }\n    system(\""pause\"");\n    return 0;\n}",WRONG_ANSWER,94,680
1277595631411978240,5f0555faff3d0b906508e2a9afc0e49c87c294eb5681c5246fc4bc8120e3ad33,2020-06-29 21:31:49,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstdlib>\n#include<fstream>\n#include<cstring>\n#include<algorithm>\nusing namespace std;\nconst char ch[10]={'0','1','2','3','4','5','6','7','8','9'};\n\nbool panduan(string a)  //判断是否为回文数\n{\n    int n = a.size(),flag=1;\n    for (int i=0;i<n;i++)\n    {\n        if (a[i] != a[n-1-i]){flag=0;break;} //不是回文数\n    }\n    if(!flag) return false;\n    return true;\n}\n\nstring transfrom(int k,int a)  //将i的平方转换为对应进制的字符数组\n{\n    string num = \""\"";\n    for (int i=0;;i++)\n    {\n        int y = k%a;\n        num+=ch[y];\n        if (k<a) break;\n        k = k/a;\n    }\n    //cout<<num<<endl;\n    return num;\n}\n\nint main()\n{\n    int N=0,S=0;\n    cin>>N>>S;\n    int x=0;\n    for (int i=S+1;;i++)\n    {\n        int n=0;\n        for (int b=2;b<=10;b++)  //从二进制开始\n        {\n            \n            string k = transfrom(i,b);\n            //cout<<k<<endl;\n            int y = panduan(k);\n            if (y) {n++;}\n            if (n>=2) {cout<<i<<endl;x++;break;}\n        }\n        if(x==N) break;\n    }\n    system(\""pause\"");\n    return 0;\n}",ACCEPTED,36,552
1277596337959264256,97ea1bdcd6d63ba7387c8b079c3896cb4e4e66bada80587d0a1769fbd740695c,2020-06-29 21:34:38,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include <vector>\nusing namespace std;\nstring change(int x, int n)\n{\n\tvector<char> bigers = { 'A','B','C','D','E','F','G','H','I','J' };\n\tchar biger = '0';\n\tstring resultchange = \""\"";\n\twhile (n != 0)\n\t{\n\t\tchar biger = '0';\n\t\tint tmp = n % x;\n\t\tif (tmp > 9)\n\t\t{\n\t\t\tbiger = bigers[tmp - 10];\n\t\t\tresultchange += biger;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tresultchange += tmp;\n\t\t}\n\t\tn = n / x;\n\t}\n\treturn resultchange;\n}\nint main()\n{\n\tint n = 0;\n\tcin >> n;\n\tfor (int i= 1; i <=300; i++)\n\t{\n\t\tstring str1 = change(n, i*i);\n\t\tstring str2 = str1;\n\t\treverse(str1.begin(), str1.end());\n\t\tif (str1 == str2)\n\t\t{\n\t\t\tcout << i << \"" \"" << str2 << endl;\n\t\t}\t\n\t}\n}\n",COMPILE_ERROR,0,0
1277596487557513216,e4e8723a68604b3d116a74adee1ff40addbba3de59cc74765c8acb9af0ecd2fc,2020-06-29 21:35:13,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <string>\nusing namespace std;\nint Atoint(string s, int radix);\nstring intToA(int n, int radix);\nint main() {\n\tint rad;\n\tint n, s, num1 = 0, num2 = 0;\n\tcin >> n >> s;\n\tstring rnum;\n\tfor (int i = s+1; i <= 15000; i++) {\n\t\tnum1 = 0;\n\t\tfor (rad = 2; rad <= 10; rad++) {\n\t\t\trnum = intToA(i, rad);\n\t\t\treverse(rnum.begin(), rnum.end());\n\t\t\tif (rnum == intToA(i, rad)) {\n\t\t\t\t//cout << rnum << \"" \"" << intToA(i, rad) << endl;\n\t\t\t\tnum1++;\n\t\t\t}\n\t\t\tif (num1 >= 2&&num2 < n) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tnum2++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}\nstring intToA(int n, int radix)    //n是待转数字，radix是指定的进制\n{\n\tstring ans = \""\"";\n\tdo {\n\t\tint t = n % radix;\n\t\tif (t >= 0 && t <= 9)    ans += t + '0';\n\t\tn /= radix;\n\t} while (n != 0);    //使用do{}while（）以防止输入为0的情况\n\treverse(ans.begin(), ans.end());\n\treturn ans;\n}",ACCEPTED,193,488
1277596526858141696,97ea1bdcd6d63ba7387c8b079c3896cb4e4e66bada80587d0a1769fbd740695c,2020-06-29 21:35:23,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include <vector>\n#include <string>\nusing namespace std;\nstring change(int x, int n)\n{\n\tvector<char> bigers = { 'A','B','C','D','E','F','G','H','I','J' };\n\tchar biger = '0';\n\tstring resultchange = \""\"";\n\twhile (n != 0)\n\t{\n\t\tchar biger = '0';\n\t\tint tmp = n % x;\n\t\tif (tmp > 9)\n\t\t{\n\t\t\tbiger = bigers[tmp - 10];\n\t\t\tresultchange += biger;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tresultchange += tmp;\n\t\t}\n\t\tn = n / x;\n\t}\n\treturn resultchange;\n}\nint main()\n{\n\tint n = 0;\n\tcin >> n;\n\tfor (int i= 1; i <=300; i++)\n\t{\n\t\tstring str1 = change(n, i*i);\n\t\tstring str2 = str1;\n\t\treverse(str1.begin(), str1.end());\n\t\tif (str1 == str2)\n\t\t{\n\t\t\tcout << i << \"" \"" << str2 << endl;\n\t\t}\t\n\t}\n}\n",COMPILE_ERROR,0,0
1277597153805926400,fb8d83617e99b5368043d5a60c02cca350bc684afc8a34a362ad6cc849d209b6,2020-06-29 21:37:52,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nint main()\n{\n\tint B;\n\tint count = 0, count1, m, n, a[1000];\n\tint tran(int n, int B, int a[]);\n\tint judge(int a[]);\n\tvoid init(int a[], int n);\n\tcin >> n >> m;\n\tm++;\n\tfor (; count < n; m++)\n\t{\n\t\tcount1 = 0;\n\t\tfor (B = 2; B <= 10; B++)\n\t\t{\n\t\t\tinit(a, 1000);\n\t\t\ttran(m, B, a);\n\t\t\tif (judge(a) == 1)count1++;\n\t\t\tif (count1 == 2) \n\t\t\t{\n\t\t\t\tcount++;\n\t\t\t\tcout << m << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}\nvoid init(int a[], int n)\n{\n\tfor (int i = 0; i < n; i++)a[i] = -1;\n}\nint tran(int n, int B, int a[1000])\n{\n\tint p, q = n, i = 0, len = 0;\n\twhile (q >= B) {\n\t\tp = q % B;\n\t\tq = q / B;\n\t\ta[i] = p;\n\t\ti++;\n\t}\n\ta[i] = q;\n\twhile (a[len] >= 0)len++;\n\treturn len;\n}\nint judge(int a[])\n{\n\tint i, len = 0;\n\twhile (a[len] >= 0)len++;\n\tfor (i = 0; i < len / 2; i++)\n\t\tif (a[i] != a[len - 1 - i])return 0;\n\treturn 1;\n}",ACCEPTED,53,424
1277597344869048320,97ea1bdcd6d63ba7387c8b079c3896cb4e4e66bada80587d0a1769fbd740695c,2020-06-29 21:38:38,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include <vector>\n#include <string>\n#include <algorithm>\nusing namespace std;\nstring change(int x, int n)\n{\n\tvector<char> bigers = { 'A','B','C','D','E','F','G','H','I','J' };\n\tchar biger = '0';\n\tstring resultchange = \""\"";\n\twhile (n != 0)\n\t{\n\t\tchar biger = '0';\n\t\tint tmp = n % x;\n\t\tif (tmp > 9)\n\t\t{\n\t\t\tbiger = bigers[tmp - 10];\n\t\t\tresultchange += (biger + '0');\n\t\t}\n\t\telse\n\t\t{\n\t\t\tresultchange += (tmp + '0');\n\t\t}\n\t\tn = n / x;\n\t}\n\treturn resultchange;\n}\nint main()\n{\n\tint n = 0;\n\tcin >> n;\n\tfor (int i= 1; i <=300; i++)\n\t{\n\t\tstring str1 = change(n, i*i);\n\t\tstring str2 = str1;\n\t\treverse(str1.begin(), str1.end());\n\t\tif (str1 == str2)\n\t\t{\n\t\t\tcout << i << \"" \"" << str2 << endl;\n\t\t}\t\n\t}\n}\n",PARTIAL_ACCEPTED,31,428
1277598158610169856,97ea1bdcd6d63ba7387c8b079c3896cb4e4e66bada80587d0a1769fbd740695c,2020-06-29 21:41:52,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include <vector>\n#include <string>\n#include <algorithm>\nusing namespace std;\nstring change(int x, int n)\n{\n\tvector<char> bigers = { 'A','B','C','D','E','F','G','H','I','J' };\n\tchar biger = '0';\n\tstring resultchange = \""\"";\n\twhile (n != 0)\n\t{\n\t\tchar biger = '0';\n\t\tint tmp = n % x;\n\t\tif (tmp > 9)\n\t\t{\n\t\t\tbiger = bigers[tmp - 10];\n\t\t\tresultchange += (biger + '0');\n\t\t}\n\t\telse\n\t\t{\n\t\t\tresultchange += (tmp + '0');\n\t\t}\n\t\tn = n / x;\n\t}\n\treturn resultchange;\n}\nint main()\n{\n\tint n = 0;\n\tcin >> n;\n\tfor (int i= 1; i <=300; i++)\n\t{\n\t\tstring str1 = change(n, i*i);\n\t\tstring str2 = str1;\n\t\treverse(str1.begin(), str1.end());\n\t\tif (str1 == str2)\n\t\t{\n            string m=change(n,i);\n\t\t\tcout << m << \"" \"" << str2 << endl;\n\t\t}\t\n\t}\n}\n",PARTIAL_ACCEPTED,21,512
1277598997902974976,ad8686712a9999dbe03ced4f0edcc6d1ec90b29a12065ac79e4414d28f7d7af6,2020-06-29 21:45:12,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <cmath>\nusing namespace std;\nint transB(int&,int&);\n\nint main() {\n\tint B = 0;\n\tcin >> B;\n\tint sqr = 0;\n\tint sqrB = 0;\n\tfor (int i{ 1 };i <= 300;i++) {\n\t\tsqr = i*i;\n\t\tsqrB = transB(sqrB,B);\n\t\tif (sqrB != 0)\n\t\t\tcout << i << \"" \"" << sqrB << endl;\n\n\n\t}\n}\n\nint transB(int& num, int& b) {\n\tvector<int> numList;\n\tdo {\n\t\tnumList.push_back(num % b);\n\t\tnum /= b;\n\t} while (num != 0);\n\n\tint sumLength = numList.size()-1;\n\tbool rever = true;\n\tfor (int i{ 0 };i <= (sumLength/2+1);i++) {\n\t\tif (numList[i] != numList[sumLength - i]) {\n\t\t\trever == false;\n\t\t\tbreak;\n\t\t}\n\t}\n\tint number = 0;\n\tif (rever == true) {\n\t\tfor (int i{ 0 };i < numList.size();i++) {\n\t\t\tnum += numList[i] * pow(10,i + 1);\n\t\t}\n\t\treturn number;\n\t}\n\treturn 0;\n}\n\n",WRONG_ANSWER,24,512
1277599324312109056,c85b4c1c77fefeb5973f4524c52bf63288e9a28b3c4ba86d4dd9facc66617b4a,2020-06-29 21:46:30,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nconst int n = 300;\nint a[n], b;\n\nvoid turn(int x){\n    int a1[n];\n    int i = 0;\n\n    while (x > 0){\n        i++;\n        a1[i] = x % b;\n        x /= b;\n    }\n\n    while (i){\n        if (a1[i] < 10)\n            cout << a1[i];\n        else\n            cout << a1[i] - 10 + 'A';\n        i--;\n    }\n}\n\nvoid test(int y)\n{\n    int k = 0;\n    int x = y * y;\n    while (x > 0){\n        k++;\n        a[k] = x % b;\n        x /= b;\n    }\n    int t = k, i = k;\n    while (i > 0 && a[i] == a[t - i + 1])\n        i--;\n    if (i == 0){\n        turn(y);\n\n        while (k){\n            if (a[k] < 10)\n                cout << a[k];\n            else\n                cout << a[k] - 10 + 'A';\n            k--;\n        }\n        cout << \""\\n\"";\n    }\n}\n\nint main(){\n    cin >> b;\n\n    for (int i=1;i<=n;i++)\n        test(i);\n\n    return 0;\n}\n",MULTIPLE_ERROR,26,512
1277599411268419584,c85b4c1c77fefeb5973f4524c52bf63288e9a28b3c4ba86d4dd9facc66617b4a,2020-06-29 21:46:50,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nconst int n = 300;\nint a[n], b;\n\nvoid turn(int x){\n    int a1[n];\n    int i = 0;\n\n    while (x > 0){\n        i++;\n        a1[i] = x % b;\n        x /= b;\n    }\n\n    while (i){\n        if (a1[i] < 10)\n            cout << a1[i];\n        else\n            cout << a1[i] - 10 + 'A';\n        i--;\n    }\n}\n\nvoid test(int y)\n{\n    int k = 0;\n    int x = y * y;\n    while (x > 0){\n        k++;\n        a[k] = x % b;\n        x /= b;\n    }\n    int t = k, i = k;\n    while (i > 0 && a[i] == a[t - i + 1])\n        i--;\n    if (i == 0){\n        turn(y);\n        cout << \"" \"";\n        while (k){\n            if (a[k] < 10)\n                cout << a[k];\n            else\n                cout << a[k] - 10 + 'A';\n            k--;\n        }\n        cout << \""\\n\"";\n    }\n}\n\nint main(){\n    cin >> b;\n\n    for (int i=1;i<=n;i++)\n        test(i);\n\n    return 0;\n}\n",PARTIAL_ACCEPTED,41,512
1277600086882713600,97ea1bdcd6d63ba7387c8b079c3896cb4e4e66bada80587d0a1769fbd740695c,2020-06-29 21:49:32,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include <vector>\n#include <string>\n#include <algorithm>\nusing namespace std;\nstring change(int x, int n)\n{\n\tvector<char> bigers = { 'A','B','C','D','E','F','G','H','I','J' };\n\tchar biger = '0';\n\tstring resultchange = \""\"";\n\twhile (n != 0)\n\t{\n\t\tchar biger = '0';\n\t\tint tmp = n % x;\n\t\tif (tmp > 9)\n\t\t{\n\t\t\tbiger = bigers[tmp - 10];\n\t\t\tresultchange += (biger + '0');\n\t\t}\n\t\telse\n\t\t{\n\t\t\tresultchange += (tmp + '0');\n\t\t}\n\t\tn = n / x;\n\t}\n\treturn resultchange;\n}\nint main()\n{\n\tint n = 0;\n\tcin >> n;\n\tfor (int i= 1; i <=300; i++)\n\t{\n\t\tstring str1 = change(n, i*i);\n\t\tstring str2 = str1;\n\t\treverse(str1.begin(), str1.end());\n\t\tif (str1 == str2)\n\t\t{\n            string m=change(n,i);\n            reverse(m.begin(), m.end());\n\t\t\tcout << m << \"" \"" << str2 << endl;\n\t\t}\t\n\t}\n}\n",PARTIAL_ACCEPTED,42,576
1277600526198300672,5f0555faff3d0b906508e2a9afc0e49c87c294eb5681c5246fc4bc8120e3ad33,2020-06-29 21:51:16,Python,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"mport sys\ndef to(dx, n):\n    #need = ['0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F', 'J', 'K', 'L', 'M']\n    res = []\n    while True:\n        sh = dx // n\n        yu = dx % n\n        res += [yu]\n        if sh == 0:\n            break\n        dx = sh\n    res.reverse()\n    #jud = ''\n    #for i in res:\n        #jud += need[i]\n    return res\n\ndef hws(s):\n    s1 = s[::-1]\n    if s == s1:\n        return True\n    else:\n        return False\n\nn1,n2 = map(int,input().split())\n#print(type(n1))\nnum = 0\nnum1 = 0\nflag = False\nfor i in range(n2+1, 10000):\n    for j in range(2, 11):\n        #r1 = to(i, j)\n        r2 = to(i, j)\n        res2 = hws(r2)\n        if res2:\n            num += 1\n            if num == 2:\n                print(i)\n                num1 += 1\n                #print(num1)\n                if num1 == n1:\n                    flag = True\n                num = 0\n                break\n    if flag:\n        break",NON_ZERO_EXIT_CODE,157,2972
1277600720386195456,5f0555faff3d0b906508e2a9afc0e49c87c294eb5681c5246fc4bc8120e3ad33,2020-06-29 21:52:03,Python,20.0,1277062760129622024,1267449136707624960,1049226397448056832,"import sys\ndef to(dx, n):\n    #need = ['0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F', 'J', 'K', 'L', 'M']\n    res = []\n    while True:\n        sh = dx // n\n        yu = dx % n\n        res += [yu]\n        if sh == 0:\n            break\n        dx = sh\n    res.reverse()\n    #jud = ''\n    #for i in res:\n        #jud += need[i]\n    return res\n\ndef hws(s):\n    s1 = s[::-1]\n    if s == s1:\n        return True\n    else:\n        return False\n\nn1,n2 = map(int,input().split())\n#print(type(n1))\nnum = 0\nnum1 = 0\nflag = False\nfor i in range(n2+1, 10000):\n    for j in range(2, 11):\n        #r1 = to(i, j)\n        r2 = to(i, j)\n        res2 = hws(r2)\n        if res2:\n            num += 1\n            if num == 2:\n                print(i)\n                num1 += 1\n                #print(num1)\n                if num1 == n1:\n                    flag = True\n                num = 0\n                break\n    if flag:\n        break",PARTIAL_ACCEPTED,173,3040
1277602026484064256,5f0555faff3d0b906508e2a9afc0e49c87c294eb5681c5246fc4bc8120e3ad33,2020-06-29 21:57:14,Python,60.0,1277062760129622024,1267449136707624960,1049226397448056832,"def to(dx, n):\n    #need = ['0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F', 'J', 'K', 'L', 'M']\n    res = []\n    while True:\n        sh = dx // n\n        yu = dx % n\n        res += [yu]\n        if sh == 0:\n            break\n        dx = sh\n    res.reverse()\n    #jud = ''\n    #for i in res:\n        #jud += need[i]\n    return res\n\ndef hws(s):\n    s1 = s[::-1]\n    if s == s1:\n        return True\n    else:\n        return False\n\nn1,n2 = map(int,input().split())\n#print(type(n1))\nnum = 0\nnum1 = 0\nflag = False\nfor i in range(n2+1, 10000):\n    for j in range(2, 11):\n        #r1 = to(i, j)\n        r2 = to(i, j)\n        res2 = hws(r2)\n        if res2:\n            num += 1\n            if num == 2:\n                print(i)\n                num1 += 1\n                #print(num1)\n                if num1 == n1:\n                    flag = True\n                num = 0\n                break\n    if flag:\n        break\n    num = 0",PARTIAL_ACCEPTED,186,3200
1277602953072926720,21378286f000a43bb43e73c5990641e25039f8adc06495ef53736feb56560c8c,2020-06-29 22:00:55,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstring>\n#include<map>\n#include<vector>\n#include<array>\n#include <algorithm>\n#include<cmath>\nusing namespace std;\nvector<char> change(int n, int b)\n{\n    vector<char>num;\n    while (n > 0)\n    {\n        int m = n % b;\n        if (m < 10)\n        {\n            num.push_back(m + 48);\n\n        }\n        else\n        {\n            num.push_back(m + 55);\n        }\n        m = n / b;\n    }\n    return num;\n}\n\n\n\nint main()\n{\n    int a;\n    int flag = 0;\n    cin >> a;\n    vector<char>c;\n    for (int i = 1; i <= 300; i++)\n    {\n        c = change(i * i, a);\n        for (int j = 0; j < (c.size()/2); j++)\n        {\n            if (c[j] == c[c.size() - j - 1])\n            {\n                flag = 1;\n            }\n            else\n            {\n                flag = 0;\n            }\n        }\n        if (flag == 1)\n        {\n            string s;\n            for (int i = 0; i < c.size(); i++)\n            {\n                s[i] = c[i];\n            }\n            cout << i << \"" \"" << s << endl;\n        }\n    }\n    \n    \n    return 0;\n}",MEMORY_LIMIT_EXCEEDED,0,0
1277603358884421632,dc45081bb9d1bf2890cf7ccf2a5085a5972431a89a1343812baaeda9635a4048,2020-06-29 22:02:32,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nint main()\n{\n\tint N, S;\n\tint s1[100], s2[100];\n\tcin >> N >> S;\n\tint a,p;\n\tint k = 1,temp, flag3 = 0;\n\twhile (flag3 <= N)\n\t{\n\t\tint flag1 = 1,flag2 = 0;\n\t\tfor (int i = 2; i <= 10; i++)\n\t\t{\n\t\t\ttemp = S;\n\t\t\tp = 0;\n\t\t\tk = 1;\n\t\t\tflag1 = 1;\n\t\t\twhile (temp != 0)\n\t\t\t{\n\t\t\t\ta = temp % i;\n\t\t\t\ttemp /= i;\n\t\t\t\tp++;\n\t\t\t\ts1[p] = a;\n\t\t\t}\n\t\t\tfor (int j = p; j >= 1; j--) \n\t\t\t{\n\n\t\t\t\ts2[k] = s1[j];\n\t\t\t\tk++;\n\t\t\t}\n\t\t\tfor (int j = 1; j <= p; j++) \n\t\t\t{\n\t\t\t\tif (s1[j] != s2[j]) \n\t\t\t\t{\n\t\t\t\t\tflag1 = 0;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tmemset(s1, 0, sizeof(s1));\n\t\t\tmemset(s2, 0, sizeof(s2));\n\t\t\tif (flag1 == 1)\n\t\t\t\tflag2++;\n\t\t\tif (flag2 >= 2)\n\t\t\t\tbreak;\n\t\t}\n\t\tif(flag2 >= 2)\n\t\t\tcout << S << endl;\n\t\tflag3++;\n\t\tS++;\n\t}\n}",COMPILE_ERROR,0,0
1277603488123510784,dc45081bb9d1bf2890cf7ccf2a5085a5972431a89a1343812baaeda9635a4048,2020-06-29 22:03:02,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <cstring>\nusing namespace std;\nint main()\n{\n\tint N, S;\n\tint s1[100], s2[100];\n\tcin >> N >> S;\n\tint a,p;\n\tint k = 1,temp, flag3 = 0;\n\twhile (flag3 <= N)\n\t{\n\t\tint flag1 = 1,flag2 = 0;\n\t\tfor (int i = 2; i <= 10; i++)\n\t\t{\n\t\t\ttemp = S;\n\t\t\tp = 0;\n\t\t\tk = 1;\n\t\t\tflag1 = 1;\n\t\t\twhile (temp != 0)\n\t\t\t{\n\t\t\t\ta = temp % i;\n\t\t\t\ttemp /= i;\n\t\t\t\tp++;\n\t\t\t\ts1[p] = a;\n\t\t\t}\n\t\t\tfor (int j = p; j >= 1; j--) \n\t\t\t{\n\n\t\t\t\ts2[k] = s1[j];\n\t\t\t\tk++;\n\t\t\t}\n\t\t\tfor (int j = 1; j <= p; j++) \n\t\t\t{\n\t\t\t\tif (s1[j] != s2[j]) \n\t\t\t\t{\n\t\t\t\t\tflag1 = 0;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tmemset(s1, 0, sizeof(s1));\n\t\t\tmemset(s2, 0, sizeof(s2));\n\t\t\tif (flag1 == 1)\n\t\t\t\tflag2++;\n\t\t\tif (flag2 >= 2)\n\t\t\t\tbreak;\n\t\t}\n\t\tif(flag2 >= 2)\n\t\t\tcout << S << endl;\n\t\tflag3++;\n\t\tS++;\n\t}\n}",WRONG_ANSWER,36,512
1277603545459654656,97ea1bdcd6d63ba7387c8b079c3896cb4e4e66bada80587d0a1769fbd740695c,2020-06-29 22:03:16,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include <array>\n#include <string>\n#include <algorithm>\nusing namespace std;\nstring change(int x, int n)\n{\n\tarray<char,10> bigers = { 'A','B','C','D','E','F','G','H','I','J' };\n\tchar biger = '0';\n\tstring resultchange = \""\"";\n\twhile (n != 0)\n\t{\n\t\tchar biger;\n\t\tint tmp = n % x;\n\t\tn = n / x;\n\t\tif (tmp > 9)\n\t\t{\n\t\t\tbiger = bigers[tmp - 10];\n\t\t\tresultchange += (biger + '0');\n\t\t}\n\t\telse\n\t\t{\n\t\t\tresultchange += (tmp + '0');\n\t\t}\n\t}\n\treturn resultchange;\n}\nint main()\n{\n\t\tint n = 0;\n\t\tcin >> n;\n\t\tfor (int i = 1; i <= 300; i++)\n\t\t{\n\t\t\tstring str1 = change(n, i * i);\n\t\t\tstring str2 = str1;\n\t\t\treverse(str1.begin(), str1.end());\n\t\t\tif (str1 == str2)\n\t\t\t{\n\t\t\t\tstring m = change(n, i);\n\t\t\t\treverse(m.begin(), m.end());\n\t\t\t\tcout << m << \"" \"" << str2 << endl;\n\t\t\t}\n\t\t}\n}\n",PARTIAL_ACCEPTED,26,492
1277603827346243584,5f0555faff3d0b906508e2a9afc0e49c87c294eb5681c5246fc4bc8120e3ad33,2020-06-29 22:04:23,Python,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"def to(dx, n):\n    #need = ['0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F', 'J', 'K', 'L', 'M']\n    res = []\n    while True:\n        sh = dx // n\n        yu = dx % n\n        res += [yu]\n        if sh == 0:\n            break\n        dx = sh\n    res.reverse()\n    #jud = ''\n    #for i in res:\n        #jud += need[i]\n    return res\n\ndef hws(s):\n    s1 = s[::-1]\n    if s == s1:\n        return True\n    else:\n        return False\n\nn1,n2 = map(int,input().split())\n#print(type(n1))\nnum = 0\nnum1 = 0\nflag = False\nfor i in range(n2+1, 100000):\n    for j in range(2, 11):\n        #r1 = to(i, j)\n        r2 = to(i, j)\n        res2 = hws(r2)\n        if res2:\n            num += 1\n            if num == 2:\n                print(i)\n                num1 += 1\n                #print(num1)\n                if num1 == n1:\n                    flag = True\n                num = 0\n                break\n    if flag:\n        break\n    num = 0",ACCEPTED,256,3096
1277604072851431424,303874707958d90647f872b8efbfd73ba443b3adfeab3ebe67889ace64af034c,2020-06-29 22:05:22,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nchar c[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nint n;\nint fun(int zls)\n{\n\n    zls*=zls;\n    char a[1000];\n    int i=1;\n    while(zls)\n    {\n\n    \ta[i]=c[zls%n];\n\t\tzls/=n;\n\t\ti++;\n\n\t}\n\ti--;\n\tint love=1;\n\n\tfor(int j=1;j<=i/2;j++)\n\n\t{\n\n\t\tif(a[j]!=a[i-j+1])\n\t\n\t\t{\n\n\t\t\tlove = 0;\n\n\t\t\tbreak;\n\n\t\t}\n\n\t}\n\n\treturn love;\n\n}\n\nvoid output(int num)\n\n{\n\n\tint x = num;\n\n\tchar a[1000];\n\n\tint i = 1;\n\n\twhile(num)\n\n\t{\n\n\t\ta[i]=c[num%n];\n\n\t\tnum/=n;\n\n\t\ti++;\n\n\t}\n\n\ti--;\n\n\tfor(i;i>=1;i--)\n\t{\n\t\tcout<<a[i];\n\t}\n\tcout<<\"" \"";\n\ti=1;\n    num = x*x;\n\twhile(num)\n\t{\n\n\t\ta[i]=c[num%n];\n\t\tnum/=n;\n\n\t\ti++;\n\n\t}\n\n\ti--;\n\n\tfor(i;i>=1;i--)\n\t{\n\t\tcout<<a[i];\n\t}\n\tcout<<endl;\n}\nint main()\n\n{\n\tcin>>n;\n\tfor(int i=1;i<=300;i++)\n\t{\n\t\tif(fun(i)==1)\n\t\t{\n\t\t\toutput(i); \n\t\t}\n\t}\n}\n\n",ACCEPTED,39,512
1277605221180571648,c85b4c1c77fefeb5973f4524c52bf63288e9a28b3c4ba86d4dd9facc66617b4a,2020-06-29 22:09:56,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nconst int n = 300;\nint a[n], b;\n\nvoid turn(int x){\n    int a1[n];\n    int i = 0;\n\n    while (x > 0){\n        i++;\n        a1[i] = x % b;\n        x /= b;\n    }\n\n    while (i){\n        if (a1[i] < 10)\n            cout << a1[i];\n        else{\n            ai[i] =  a1[i] - 10 + 'A';\n            if (a[i]==10)\n                cout << 'A';\n            else if (a[i]==11)\n                cout << 'B';\n            else if (a[i]==12)\n                cout << 'C';\n            else if (a[i]==13)\n                cout << 'D';\n            else if (a[i]==14)\n                cout << 'E';\n            else if (a[i]==15)\n                cout << 'F';\n            else if (a[i]==16)\n                cout << 'G';\n            else if (a[i]==17)\n                cout << 'H';\n            else if (a[i]==18)\n                cout << 'I';\n            else if (a[i]==19)\n                cout << 'J';\n        }\n            \n        i--;\n    }\n}\n\nvoid test(int y)\n{\n    int k = 0;\n    int x = y * y;\n    while (x > 0){\n        k++;\n        a[k] = x % b;\n        x /= b;\n    }\n    int t = k, i = k;\n    while (i > 0 && a[i] == a[t - i + 1])\n        i--;\n    if (i == 0){\n        turn(y);\n        cout << \"" \"";\n        while (k){\n            if (a[k] < 10)\n                cout << a[k];\n            else\n                cout << a[k] - 10 + 'A';\n            k--;\n        }\n        cout << \""\\n\"";\n    }\n}\n\nint main(){\n    cin >> b;\n\n    for (int i=1;i<=n;i++)\n        test(i);\n\n    return 0;\n}\n",COMPILE_ERROR,0,0
1277605287773536256,c85b4c1c77fefeb5973f4524c52bf63288e9a28b3c4ba86d4dd9facc66617b4a,2020-06-29 22:10:12,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nconst int n = 300;\nint a[n], b;\n\nvoid turn(int x){\n    int a1[n];\n    int i = 0;\n\n    while (x > 0){\n        i++;\n        a1[i] = x % b;\n        x /= b;\n    }\n\n    while (i){\n        if (a1[i] < 10)\n            cout << a1[i];\n        else{\n            a1[i] =  a1[i] - 10 + 'A';\n            if (a[i]==10)\n                cout << 'A';\n            else if (a[i]==11)\n                cout << 'B';\n            else if (a[i]==12)\n                cout << 'C';\n            else if (a[i]==13)\n                cout << 'D';\n            else if (a[i]==14)\n                cout << 'E';\n            else if (a[i]==15)\n                cout << 'F';\n            else if (a[i]==16)\n                cout << 'G';\n            else if (a[i]==17)\n                cout << 'H';\n            else if (a[i]==18)\n                cout << 'I';\n            else if (a[i]==19)\n                cout << 'J';\n        }\n            \n        i--;\n    }\n}\n\nvoid test(int y)\n{\n    int k = 0;\n    int x = y * y;\n    while (x > 0){\n        k++;\n        a[k] = x % b;\n        x /= b;\n    }\n    int t = k, i = k;\n    while (i > 0 && a[i] == a[t - i + 1])\n        i--;\n    if (i == 0){\n        turn(y);\n        cout << \"" \"";\n        while (k){\n            if (a[k] < 10)\n                cout << a[k];\n            else\n                cout << a[k] - 10 + 'A';\n            k--;\n        }\n        cout << \""\\n\"";\n    }\n}\n\nint main(){\n    cin >> b;\n\n    for (int i=1;i<=n;i++)\n        test(i);\n\n    return 0;\n}\n",PARTIAL_ACCEPTED,43,512
1277605519324274688,d80ceee7855575a5a54ac3daf4c36c2c829ec2e6134898d230aaf7f03f2f5f22,2020-06-29 22:11:07,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\n\nusing namespace std;\n\nbool hui(int a, int b) {\n\tint s;\n\tvector<int> num;\n\twhile (a != 0) {\n\t\ts = a % b;\n\t\ta = a / b;\n\t\tnum.push_back(s);\n\t}\n\tfor (int i = 0; i < num.size() / 2; i++) {\n\t\tif (num[i] != num[num.size() - i - 1]) return false;\n\t}\n\treturn true;\n}\n\nchar A(int a) {\n\tif (a < 10) return (char)a;\n\telse if (a < 20) return (char)(a - 10) + 65;\n\telse if (a < 30) return (char)(a - 20) + 75;\n\telse return (char)(a - 30) + 85;\n}\n\nvoid tran(int a, int b) {\n\tvector<int> num;\n\tvector<char> num1;\n\tint s;\n\twhile (a != 0) {\n\t\ts = a % b;\n\t\ta = a / b;\n\t\tnum.push_back(s);\n\t}\n\tfor (int i = num.size() - 1; i >= 0; i--) {\n\t\tnum1.push_back(A(num[i]));\n\t}\n\tfor (int i =0; i <num1.size(); i++) {\n\t\tcout << num1[i];\n\t}\n}\n\nint main()\n{\n\tint a;\n\tcin >> a;\n\tvector<string> num1, num2;\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\tif (hui(i * i, a)) {\n\t\t\ttran(i,a);\n\t\t\tcout << \"" \"";\n\t\t\ttran(i * i, a);\n\t\t\tcout << endl;\n\t\t}\n\t}\n}",WRONG_ANSWER,33,512
1277605757166485504,3a483c97e80635c09e7231fda74b44a27914eee8e61b3aa5ee128ae2e1dab19b,2020-06-29 22:12:03,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nchar num[20] = {'0','1','2','3','4',\n                '5','6','7','8','9'};\nshort n,s;\nbool pan(short a, short b){\n    char shu[20];\n    int n=1;\n    while (a != 0){\n        shu[n++] = num[a%b];\n    }\n    for (int i=1;i<n;i++){\n        if (shu[i] == shu[n-1]) n--;\n        else return false;\n    }\n    return true;\n}\nint main()\n{\n    cin >> n >> s;\n    int i=1;\n    while (n>0){\n        for (int j=2;j<=10;j++){\n            if (pan(n+i, j)) cout << n+i << endl;\n            n--;\n        }\n        i++;\n    }\n    return 0;\n}",TIME_LIMIT_EXCEEDED,0,0
1277605771150295040,dc45081bb9d1bf2890cf7ccf2a5085a5972431a89a1343812baaeda9635a4048,2020-06-29 22:12:07,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <cstring>\n#include <vector>\nusing namespace std;\nint main()\n{\n\tint N, S;\n\tint s1[100], s2[100];\n\tvector<int> s3;\n\tcin >> N >> S;\n\tint a,p;\n\tint k = 1,temp, flag3 = 0;\n\twhile (flag3 <= N)\n\t{\n\t\tint flag1 = 1,flag2 = 0;\n\t\tfor (int i = 2; i <= 10; i++)\n\t\t{\n\t\t\ttemp = S;\n\t\t\tp = 0;\n\t\t\tk = 1;\n\t\t\tflag1 = 1;\n\t\t\twhile (temp != 0)\n\t\t\t{\n\t\t\t\ta = temp % i;\n\t\t\t\ttemp /= i;\n\t\t\t\tp++;\n\t\t\t\ts1[p] = a;\n\t\t\t}\n\t\t\tfor (int j = p; j >= 1; j--) \n\t\t\t{\n\n\t\t\t\ts2[k] = s1[j];\n\t\t\t\tk++;\n\t\t\t}\n\t\t\tfor (int j = 1; j <= p; j++) \n\t\t\t{\n\t\t\t\tif (s1[j] != s2[j]) \n\t\t\t\t{\n\t\t\t\t\tflag1 = 0;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tmemset(s1, 0, sizeof(s1));\n\t\t\tmemset(s2, 0, sizeof(s2));\n\t\t\tif (flag1 == 1)\n\t\t\t\tflag2++;\n\t\t\tif (flag2 >= 2)\n\t\t\t\tbreak;\n\t\t}\n\t\tif (flag2 >= 2)\n\t\t\ts3.push_back(S);\n\t\tflag3++;\n\t\tS++;\n\t}\n\tfor (int j = 0; j < s3.size() - 1; j++)\n\t\tcout << s3[j] << endl;\n\tcout << s3.back();\n\n}",MULTIPLE_ERROR,32,516
1277606147048013824,c85b4c1c77fefeb5973f4524c52bf63288e9a28b3c4ba86d4dd9facc66617b4a,2020-06-29 22:13:36,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nconst int n = 300;\nint a[n], b;\n\nvoid turn(int x){\n    int a1[n];\n    int i = 0;\n\n    while (x > 0){\n        i++;\n        a1[i] = x % b;\n        x /= b;\n    }\n\n    while (i){\n        if (a1[i] < 10)\n            cout << a1[i];\n        else{\n            a1[i] =  a1[i] - 10 + 'A';\n            if (a[i]==10)\n                cout << 'A';\n            else if (a[i]==11)\n                cout << 'B';\n            else if (a[i]==12)\n                cout << 'C';\n            else if (a[i]==13)\n                cout << 'D';\n            else if (a[i]==14)\n                cout << 'E';\n            else if (a[i]==15)\n                cout << 'F';\n            else if (a[i]==16)\n                cout << 'G';\n            else if (a[i]==17)\n                cout << 'H';\n            else if (a[i]==18)\n                cout << 'I';\n            else if (a[i]==19)\n                cout << 'J';\n        }\n            \n        i--;\n    }\n}\n\nvoid test(int y)\n{\n    int k = 0;\n    int x = y * y;\n    while (x > 0){\n        k++;\n        a[k] = x % b;\n        x /= b;\n    }\n    int t = k, i = k;\n    while (i > 0 && a[i] == a[t - i + 1])\n        i--;\n    if (i == 0){\n        turn(y);\n        cout << \"" \"";\n        while (k){\n            if (a[k] < 10)\n                cout << a[k];\n            else{\n            a1[k] =  a1[k] - 10 + 'A';\n            if (a[k]==10)\n                cout << 'A';\n            else if (a[k]==11)\n                cout << 'B';\n            else if (a[k]==12)\n                cout << 'C';\n            else if (a[k]==13)\n                cout << 'D';\n            else if (a[k]==14)\n                cout << 'E';\n            else if (a[k]==15)\n                cout << 'F';\n            else if (a[k]==16)\n                cout << 'G';\n            else if (a[k]==17)\n                cout << 'H';\n            else if (a[k]==18)\n                cout << 'I';\n            else if (a[k]==19)\n                cout << 'J';\n            k--;\n        }\n        cout << \""\\n\"";\n    }\n}\n\nint main(){\n    cin >> b;\n\n    for (int i=1;i<=n;i++)\n        test(i);\n\n    return 0;\n}\n",COMPILE_ERROR,0,0
1277606419128311808,c85b4c1c77fefeb5973f4524c52bf63288e9a28b3c4ba86d4dd9facc66617b4a,2020-06-29 22:14:41,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nconst int n = 300;\nint a[n], b;\n\nvoid turn(int x){\n    int a1[n];\n    int i = 0;\n\n    while (x > 0){\n        i++;\n        a1[i] = x % b;\n        x /= b;\n    }\n\n    while (i){\n        if (a1[i] < 10)\n            cout << a1[i];\n        else{\n            a1[i] =  a1[i] - 10 + 'A';\n            if (a1[i]==10)\n                cout << 'A';\n            else if (a1[i]==11)\n                cout << 'B';\n            else if (a1[i]==12)\n                cout << 'C';\n            else if (a1[i]==13)\n                cout << 'D';\n            else if (a1[i]==14)\n                cout << 'E';\n            else if (a1[i]==15)\n                cout << 'F';\n            else if (a1[i]==16)\n                cout << 'G';\n            else if (a1[i]==17)\n                cout << 'H';\n            else if (a1[i]==18)\n                cout << 'I';\n            else if (a1[i]==19)\n                cout << 'J';\n        }\n            \n        i--;\n    }\n}\n\nvoid test(int y)\n{\n    int k = 0;\n    int x = y * y;\n    while (x > 0){\n        k++;\n        a[k] = x % b;\n        x /= b;\n    }\n    int t = k, i = k;\n    while (i > 0 && a[i] == a[t - i + 1])\n        i--;\n    if (i == 0){\n        turn(y);\n        cout << \"" \"";\n        while (k){\n            if (a[k] < 10)\n                cout << a[k];\n            else{\n            a[k] =  a[k] - 10 + 'A';\n            if (a[k]==10)\n                cout << 'A';\n            else if (a[k]==11)\n                cout << 'B';\n            else if (a[k]==12)\n                cout << 'C';\n            else if (a[k]==13)\n                cout << 'D';\n            else if (a[k]==14)\n                cout << 'E';\n            else if (a[k]==15)\n                cout << 'F';\n            else if (a[k]==16)\n                cout << 'G';\n            else if (a[k]==17)\n                cout << 'H';\n            else if (a[k]==18)\n                cout << 'I';\n            else if (a[k]==19)\n                cout << 'J';\n            k--;\n        }\n        cout << \""\\n\"";\n    }\n}\n\nint main(){\n    cin >> b;\n\n    for (int i=1;i<=n;i++)\n        test(i);\n\n    return 0;\n}\n",COMPILE_ERROR,0,0
1277607026304155648,c85b4c1c77fefeb5973f4524c52bf63288e9a28b3c4ba86d4dd9facc66617b4a,2020-06-29 22:17:06,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nconst int n = 300;\nint a[n], b;\n\nvoid turn(int x){\n    int a1[n];\n    int i = 0;\n\n    while (x > 0){\n        i++;\n        a1[i] = x % b;\n        x /= b;\n    }\n\n    while (i){\n        if (a1[i] < 10)\n            cout << a1[i];\n        else{\n            a1[i] =  a1[i] - 10 + 'A';\n            if (a1[i]==10)\n                cout << 'A';\n            else if (a1[i]==11)\n                cout << 'B';\n            else if (a1[i]==12)\n                cout << 'C';\n            else if (a1[i]==13)\n                cout << 'D';\n            else if (a1[i]==14)\n                cout << 'E';\n            else if (a1[i]==15)\n                cout << 'F';\n            else if (a1[i]==16)\n                cout << 'G';\n            else if (a1[i]==17)\n                cout << 'H';\n            else if (a1[i]==18)\n                cout << 'I';\n            else if (a1[i]==19)\n                cout << 'J';\n        }\n            \n        i--;\n    }\n}\n\nvoid test(int y)\n{\n    int k = 0;\n    int x = y * y;\n    while (x > 0){\n        k++;\n        a[k] = x % b;\n        x /= b;\n    }\n    int t = k, i = k;\n    while (i > 0 && a[i] == a[t - i + 1])\n        i--;\n    if (i == 0){\n        turn(y);\n        cout << \"" \"";\n        while (k){\n            if (a[k] < 10)\n                cout << a[k];\n            else{\n                a[k] =  a[k] - 10 + 'A';\n                if (a[k]==10)\n                    cout << 'A';\n                else if (a[k]==11)\n                    cout << 'B';\n                else if (a[k]==12)\n                    cout << 'C';\n                else if (a[k]==13)\n                    cout << 'D';\n                else if (a[k]==14)\n                    cout << 'E';\n                else if (a[k]==15)\n                    cout << 'F';\n                else if (a[k]==16)\n                    cout << 'G';\n                else if (a[k]==17)\n                    cout << 'H';\n                else if (a[k]==18)\n                    cout << 'I';\n                else if (a[k]==19)\n                    cout << 'J';\n\n            }\n            \n            k--;\n        }\n        cout << \""\\n\"";\n    }\n}\n\nint main(){\n    cin >> b;\n\n    for (int i=1;i<=n;i++)\n        test(i);\n\n    return 0;\n}\n",PARTIAL_ACCEPTED,41,536
1277607140640874496,d80ceee7855575a5a54ac3daf4c36c2c829ec2e6134898d230aaf7f03f2f5f22,2020-06-29 22:17:33,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\n\nusing namespace std;\n\nbool hui(int a, int b) {\n\tint s;\n\tvector<int> num;\n\twhile (a != 0) {\n\t\ts = a % b;\n\t\ta = a / b;\n\t\tnum.push_back(s);\n\t}\n\tfor (int i = 0; i < num.size() / 2; i++) {\n\t\tif (num[i] != num[num.size() - i - 1]) return false;\n\t}\n\treturn true;\n}\n\nchar A(int a) {\n\tif (a >= 10) return (char)(a + 55);\n\telse return (char)a;\n}\n\nvoid tran(int a, int b) {\n\tvector<int> num;\n\tvector<char> num1;\n\tint s;\n\twhile (a != 0) {\n\t\ts = a % b;\n\t\ta = a / b;\n\t\tnum.push_back(s);\n\t}\n\tfor (int i = num.size() - 1; i >= 0; i--) {\n\t\tnum1.push_back(A(num[i]));\n\t}\n\tfor (int i =0; i <num1.size(); i++) {\n\t\tcout << num1[i];\n\t}\n}\n\nint main()\n{\n\tint a;\n\tcin >> a;\n\tvector<string> num1, num2;\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\tif (hui(i * i, a)) {\n\t\t\ttran(i,a);\n\t\t\tcout << \"" \"";\n\t\t\ttran(i * i, a);\n\t\t\tcout << endl;\n\t\t}\n\t}\n}",WRONG_ANSWER,41,500
1277607822819262464,d80ceee7855575a5a54ac3daf4c36c2c829ec2e6134898d230aaf7f03f2f5f22,2020-06-29 22:20:16,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\n\nusing namespace std;\n\nbool hui(int a, int b) {\n\tint s;\n\tvector<int> num;\n\twhile (a != 0) {\n\t\ts = a % b;\n\t\ta = a / b;\n\t\tnum.push_back(s);\n\t}\n\tfor (int i = 0; i < num.size() / 2; i++) {\n\t\tif (num[i] != num[num.size() - i - 1]) return false;\n\t}\n\treturn true;\n}\n\nchar A(int a) {\n\tif (a >= 10) return (char)a + 55;\n\telse return (char)a;\n}\n\nvoid tran(int a, int b) {\n\tvector<int> num;\n\tvector<char> num1;\n\tint s;\n\twhile (a != 0) {\n\t\ts = a % b;\n\t\ta = a / b;\n\t\tnum.push_back(s);\n\t}\n\tfor (int i = num.size() - 1; i >= 0; i--) {\n\t\tnum1.push_back(A(num[i]));\n\t}\n\tfor (int i =0; i <num1.size(); i++) {\n\t\tcout << num1[i];\n\t}\n}\n\nint main()\n{\n\tint a;\n\tcin >> a;\n\tvector<string> num1, num2;\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\tif (hui(i * i, a)) {\n\t\t\ttran(i,a);\n\t\t\tcout << \"" \"";\n\t\t\ttran(i * i, a);\n\t\t\tcout << endl;\n\t\t}\n\t}\n}",WRONG_ANSWER,41,424
1277608025177645056,8c6873a2f339e895023c795dc65afb5773c8ff36d8bbc5e7a1a81e454198326e,2020-06-29 22:21:04,C++,30.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include <string>\n#include <stdio.h>\n#include<array>\n#include<vector>\nusing namespace std;\n\nbool check(int x) {\n\tvector<int> a;\n\twhile (true) {\n\t\tint t = x % 10;\n\t\tx = x / 10;\n\t\ta.push_back(t);\n\t\tif (x == 0) {\n\t\t\tbreak;\n\t\t}\n\t}\n\tvector<int> b;\n\tfor (int i = a.size()-1;i >= 0;i--) {\n\t\tb.push_back(a[i]);\n\t}\n\treturn (b == a);\n}\n\nint change(int x, int a) {\n\tint y = 0;\n\tint z = 1;\n\tint t = 0;\n\twhile ((x / a) != 0)\n\t{\n\t\tt = x % a;\n\t\tx = x / a;\n\t\ty = y + z * t;\n\t\tz = z * 10;\n\t}\n\tt = x % a;\n\ty = y + z * t;\n\treturn y;\n}\n\nint main() {\n\tint x = 0;\n\tcin >> x;\n\tfor (int i = 1;i <= 300;i++) {\n\t\tif (check(change(i * i, x))) {\n\t\t\tcout << change(i, x) << \"" \"" << change(i * i, x) << endl;\n\t\t}\n\t}\n}",PARTIAL_ACCEPTED,43,592
1277608383220219904,8c6873a2f339e895023c795dc65afb5773c8ff36d8bbc5e7a1a81e454198326e,2020-06-29 22:22:30,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include <string>\n#include <stdio.h>\n#include<array>\n#include<vector>\nusing namespace std;\n\nbool check(int x) {\n\tvector<int> a;\n\twhile (true) {\n\t\tint t = x % 10;\n\t\tx = x / 10;\n\t\ta.push_back(t);\n\t\tif (x == 0) {\n\t\t\tbreak;\n\t\t}\n\t}\n\tvector<int> b;\n\tfor (int i = a.size()-1;i >= 0;i--) {\n\t\tb.push_back(a[i]);\n\t}\n\treturn (b == a);\n}\n\nint change(int x, int a) {\n\tint y = 0;\n\tint z = 1;\n\tint t = 0;\n\twhile ((x / a) != 0)\n\t{\n\t\tt = x % a;\n\t\tx = x / a;\n\t\ty = y + z * t;\n\t\tz = z * 10;\n\t}\n\tt = x % a;\n\ty = y + z * t;\n\treturn y;\n}\n\nint main() {\n\tint x = 0;\n\tcin >> x;\n\tfor (int i = 1;i <= 300;i++) {\n\t\tif (check(change(i * i, x))) {\n\t\t\tcout << i << \"" \"" << change(i * i, x) << endl;\n\t\t}\n\t}\n}",PARTIAL_ACCEPTED,35,488
1277608419454803968,8c6873a2f339e895023c795dc65afb5773c8ff36d8bbc5e7a1a81e454198326e,2020-06-29 22:22:38,C++,30.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include <string>\n#include <stdio.h>\n#include<array>\n#include<vector>\nusing namespace std;\n\nbool check(int x) {\n\tvector<int> a;\n\twhile (true) {\n\t\tint t = x % 10;\n\t\tx = x / 10;\n\t\ta.push_back(t);\n\t\tif (x == 0) {\n\t\t\tbreak;\n\t\t}\n\t}\n\tvector<int> b;\n\tfor (int i = a.size()-1;i >= 0;i--) {\n\t\tb.push_back(a[i]);\n\t}\n\treturn (b == a);\n}\n\nint change(int x, int a) {\n\tint y = 0;\n\tint z = 1;\n\tint t = 0;\n\twhile ((x / a) != 0)\n\t{\n\t\tt = x % a;\n\t\tx = x / a;\n\t\ty = y + z * t;\n\t\tz = z * 10;\n\t}\n\tt = x % a;\n\ty = y + z * t;\n\treturn y;\n}\n\nint main() {\n\tint x = 0;\n\tcin >> x;\n\tfor (int i = 1;i <= 300;i++) {\n\t\tif (check(change(i * i, x))) {\n\t\t\tcout << change(i, x) << \"" \"" << change(i * i, x) << endl;\n\t\t}\n\t}\n}",PARTIAL_ACCEPTED,40,512
1277608954857709568,3a483c97e80635c09e7231fda74b44a27914eee8e61b3aa5ee128ae2e1dab19b,2020-06-29 22:24:46,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nchar num[20] = {'0','1','2','3','4',\n                '5','6','7','8','9'};\nshort s,n;\nbool pan(short a, short b){\n    char shu[20];\n    short n=1;\n    while (a != 0){\n        shu[n++] = num[a%b];\n        a /= b;\n    }\n    for (short i=1;i<n;i++){\n        if (shu[i] == shu[n-1]) n--;\n        else return false;\n    }\n    return true;\n}\n\nint main()\n{\n    cin >> n >> s;\n    short i=1;\n    while (n>0){\n        short pass = 0, rep = 0;\n        for (short j=2;j<=10;j++){\n            if (pan(n+i, j)){\n                pass = 1;\n                rep = j;\n                break;\n            }\n        }\n        for (short j=rep;j<=10;j++){\n            if (pan(n+i, j)) pass = 2;\n        }\n        if (pass == 2){\n            cout << s+i << endl;\n            n--;\n        }\n        i++;\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,28,512
1277610496847446016,c85b4c1c77fefeb5973f4524c52bf63288e9a28b3c4ba86d4dd9facc66617b4a,2020-06-29 22:30:53,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <stdio.h>\n\nconst int n = 300;\nint b,a[n];\n\nvoid turn(int x){\n    int a1[n];\n    int i = 0;\n\n    while (x > 0){\n        a1[++i] = x % b;\n        x /= b;\n    }\n\n    while (i){\n        if (a1[i] < 10)\n            printf(\""%d\"", a1[i]);\n        else\n            printf(\""%c\"", a1[i] - 10 + 'A');\n        i--;\n    }\n}\n\nvoid test(int x1){\n    int k = 0;\n    int x = x1 * x1;\n\n    while (x > 0){\n        k++;\n        a[k] = x % b;\n        x /= b;\n    }\n\n    int t = k, i = k;\n    while (i > 0 && a[i] == a[t - i + 1])\n        i--;\n\n    if (i == 0){\n        turn(x1);\n        printf(\"" \"");\n        while (k){\n            if (a[k] < 10)\n                printf(\""%d\"", a[k]);\n            else\n                printf(\""%c\"", a[k] - 10 + 'A');\n            k--;\n        }\n        printf(\""\\n\"");\n    }\n}\n\nint main(){\n    scanf(\""%d\"", &b);\n    for (int i = 1; i <= n; i++)\n        test(i);\n\n    return 0;\n}\n",ACCEPTED,30,384
1277610584193818624,036fcf41e2535523c0e7052398a0f697250cb880fa5b31ab2336993e8e2b7dd9,2020-06-29 22:31:14,C,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <stdio.h>\n#include <string.h>\n\nchar jz[21]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J','K'};\nchar a[9999],b[9999];\nint B;\n\nvoid shift(int n){\n    char t;\n    int i=0,j,k;\n    while(n!=0){\n        a[i]=jz[n%B];\n        n/=B;\n        i++;\n    }\n    for (j=0,k=i-1;j<k;j++,k--){\n            t = a[j];\n            a[j]=a[k];\n            a[k]=t;\n        }\n\n}\n\nint check(int n){\n    int i=0,j,k;\n    while(n!=0){\n        b[i]=jz[n%B];\n        n/=B;\n        i++;\n    }\n    for (j=0,k=i-1;j<k;j++,k--)\n        {\n            if (b[j]!=b[k])\n             return 0;\n        }\n        return 1;\n}\n\nint main(){\n    scanf(\""%d\"",&B);\n    for (int i=1; i<=300; i++){\n        if(check(i*i)){\n            shift(i);\n            printf(\""%s %s\\n\"",a,b);\n        }\n    }\n}",ACCEPTED,30,384
1277610776230027264,dc45081bb9d1bf2890cf7ccf2a5085a5972431a89a1343812baaeda9635a4048,2020-06-29 22:32:00,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <cstring>\nusing namespace std;\nint main()\n{\n\tint N, S;\n\tint s1[100], s2[100];\n\tcin >> N >> S;\n\tint a,p;\n\tS += 1;\n\tint k = 1,temp, flag3 = 1;\n\twhile (flag3 <= N)\n\t{\n\t\tint flag1 = 1,flag2 = 0;\n\t\tfor (int i = 2; i <= 10; i++)\n\t\t{\n\t\t\ttemp = S;\n\t\t\tp = 0;\n\t\t\tk = 1;\n\t\t\tflag1 = 1;\n\t\t\twhile (temp != 0)\n\t\t\t{\n\t\t\t\ta = temp % i;\n\t\t\t\ttemp /= i;\n\t\t\t\tp++;\n\t\t\t\ts1[p] = a;\n\t\t\t}\n\t\t\tfor (int j = p; j >= 1; j--) \n\t\t\t{\n\n\t\t\t\ts2[k] = s1[j];\n\t\t\t\tk++;\n\t\t\t}\n\t\t\tfor (int j = 1; j <= p; j++) \n\t\t\t{\n\t\t\t\tif (s1[j] != s2[j]) \n\t\t\t\t{\n\t\t\t\t\tflag1 = 0;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tmemset(s1, 0, sizeof(s1));\n\t\t\tmemset(s2, 0, sizeof(s2));\n\t\t\tif (flag1 == 1)\n\t\t\t\tflag2++;\n\t\t\tif (flag2 >= 2)\n\t\t\t\tbreak;\n\t\t}\n\t\tif (flag2 >= 2)\n\t\t\tcout << S << endl;\n\t\tflag3++;\n\t\tS++;\n\t}\n\treturn 0;\n}\n",PARTIAL_ACCEPTED,34,512
1277612469420220416,dc45081bb9d1bf2890cf7ccf2a5085a5972431a89a1343812baaeda9635a4048,2020-06-29 22:38:44,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <cstring>\nusing namespace std;\nint main()\n{\n\tint N, S;\n\tint s1[100], s2[100];\n\tcin >> N >> S;\n\tint a,p;\n\tS += 1;\n\tint k = 1,temp, flag3 = 1;\n\twhile (flag3 <= N)\n\t{\n\t\tint flag1 = 1,flag2 = 0;\n\t\tfor (int i = 2; i <= 10; i++)\n\t\t{\n\t\t\ttemp = S;\n\t\t\tp = 0;\n\t\t\tk = 1;\n\t\t\tflag1 = 1;\n\t\t\twhile (temp != 0)\n\t\t\t{\n\t\t\t\ta = temp % i;\n\t\t\t\ttemp /= i;\n\t\t\t\tp++;\n\t\t\t\ts1[p] = a;\n\t\t\t}\n\t\t\tfor (int j = p; j >= 1; j--) \n\t\t\t{\n\n\t\t\t\ts2[k] = s1[j];\n\t\t\t\tk++;\n\t\t\t}\n\t\t\tfor (int j = 1; j <= p; j++) \n\t\t\t{\n\t\t\t\tif (s1[j] != s2[j]) \n\t\t\t\t{\n\t\t\t\t\tflag1 = 0;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tmemset(s1, 0, sizeof(s1));\n\t\t\tmemset(s2, 0, sizeof(s2));\n\t\t\tif (flag1 == 1)\n\t\t\t\tflag2++;\n\t\t\tif (flag2 >= 2)\n\t\t\t\tbreak;\n\t\t}\n\t\tif (flag2 >= 2)\n\t\t{\n\t\t\tcout << S << endl;\n\t\t\tflag3++;\n\t\t}\n\t\tS++;\n\t}\n\treturn 0;\n}\n\n",ACCEPTED,25,512
1277614857283633152,e39cca8043cb19013671c440a202a288f7f87c73afe6761b2bd045987b1a86c5,2020-06-29 22:48:13,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cmath>\n#include <string>\nusing namespace std;\nchar a[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'},b[30];\nint B,n;\nint l=0;\nvoid change(int x)  \n\t{\nif(B>=2&&B<10)\n\t{while (x!=0)\n\t{b[l]=x%B+48;\n\t\tx=x/B;\n\t\tl++;\n\t\t\n}}\nelse if(B>=10&&B<=20)\n{while(x!=0)\n  {int j;\n    j=x%B;\n\tb[l]=a[j];\n\tx=x/B;\n\tl++;}\n}}\nbool check()\n{int i,j;\n change(n);\n i=0;\n j=l-1;\n while(i<j)\n {if(b[i]!=b[j])\n   return false;\n  i++;\n  j++;}\n return true;}\nvoid display(int q)\n{int i;\n change(q);\n for(i=0;i<l;i++)\n\t cout<<b[i];}\nint main()\n{cin>>B;\n for(int i=1;i<=300;i++)\n {\n\t n=i*i;\n\t if(check())\n\t {display(i);\n\t  cout<<\"" \"";\n\t  display(n);\n\t  cout<<\""\\n\"";\n\t }}\n\n\treturn 0;\n}\n",MULTIPLE_ERROR,39,512
1277615266127609856,e39cca8043cb19013671c440a202a288f7f87c73afe6761b2bd045987b1a86c5,2020-06-29 22:49:51,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cmath>\n#include <string>\nusing namespace std;\nchar a[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'},b[30];\nint B,n;\nint l=0;\nvoid change(int x)  \n\t{\nif(B>=2&&B<10)\n\t{while (x!=0)\n\t{b[l]=x%B+48;\n\t\tx=x/B;\n\t\tl++;\n\t\t\n}}\nelse if(B>=10&&B<=20)\n{while(x!=0)\n  {int j;\n    j=x%B;\n\tb[l]=a[j];\n\tx=x/B;\n\tl++;}\n}}\nbool check()\n{int i,j;\n change(n);\n i=0;\n j=l-1;\n while(i<j)\n {if(b[i]!=b[j])\n   return false;\n  i++;\n  j--;}\n return true;}\nvoid display(int q)\n{int i;\n change(q);\n for(i=0;i<l;i++)\n\t cout<<b[i];}\nint main()\n{cin>>B;\n for(int i=1;i<=300;i++)\n {\n\t n=i*i;\n\t if(check())\n\t {display(i);\n\t  cout<<\"" \"";\n\t  display(n);\n\t  cout<<\""\\n\"";\n\t }}\n\n\treturn 0;\n}\n",MULTIPLE_ERROR,42,392
1277615860510810112,c85b4c1c77fefeb5973f4524c52bf63288e9a28b3c4ba86d4dd9facc66617b4a,2020-06-29 22:52:12,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <stdio.h>\n\nconst int n = 100;\nint b, b1, b2, a[n];\n\nbool test(int x,int b){\n    int k = 0;\n\n    while (x > 0){\n        k++;\n        a[k] = x % b;\n        x /= b;\n    }\n\n    int t = k, i = k;\n    while (i > 0 && a[i] == a[t - i + 1])\n        i--;\n\n    if (i == 0)\n        return true;\n}\n\nint main(){\n    scanf(\""%d %d\"", &b1, &b2);\n    for (int i = 1; i <= n; i++)\n        if (test(i,b1)&&test(i,b2))\n            printf(\""%d\\n\"",i);\n\n    return 0;\n}\n",COMPILE_ERROR,0,0
1277616010817888256,e39cca8043cb19013671c440a202a288f7f87c73afe6761b2bd045987b1a86c5,2020-06-29 22:52:48,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cmath>\n#include <string>\nusing namespace std;\nchar a[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'},b[60];\nint B,n;\nint l=0;\nvoid change(int x)  \n\t{\nif(B>=2&&B<10)\n\t{while (x!=0)\n\t{b[l]=x%B+48;\n\t\tx=x/B;\n\t\tl++;\n\t\t\n}}\nelse if(B>=10&&B<=20)\n{while(x!=0)\n  {int j;\n    j=x%B;\n\tb[l]=a[j];\n\tx=x/B;\n\tl++;}\n}}\nbool check()\n{int i,j;\n change(n);\n i=0;\n j=l-1;\n while(i<j)\n {if(b[i]!=b[j])\n   return false;\n  i++;\n  j--;}\n return true;}\nvoid display(int q)\n{int i;\n change(q);\n for(i=0;i<l;i++)\n\t cout<<b[i];}\nint main()\n{cin>>B;\n for(int i=1;i<=300;i++)\n {\n\t n=i*i;\n\t if(check())\n\t {display(i);\n\t  cout<<\"" \"";\n\t  display(n);\n\t  cout<<\""\\n\"";\n\t }}\n\n\treturn 0;\n}\n",MULTIPLE_ERROR,35,640
1277616107714707456,c85b4c1c77fefeb5973f4524c52bf63288e9a28b3c4ba86d4dd9facc66617b4a,2020-06-29 22:53:11,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <stdio.h>\n\nconst int n = 100;\nint b, b1, b2, a[n];\n\nint test(int x,int b){\n    int k = 0;\n\n    while (x > 0){\n        k++;\n        a[k] = x % b;\n        x /= b;\n    }\n\n    int t = k, i = k;\n    while (i > 0 && a[i] == a[t - i + 1])\n        i--;\n\n    if (i == 0)\n        return 1;\n    else \n        return 0;\n}\n\nint main(){\n    scanf(\""%d %d\"", &b1, &b2);\n    for (int i = 1; i <= n; i++)\n        if (test(i,b1)&&test(i,b2))\n            printf(\""%d\\n\"",i);\n\n    return 0;\n}\n",COMPILE_ERROR,0,0
1277616226002468864,036fcf41e2535523c0e7052398a0f697250cb880fa5b31ab2336993e8e2b7dd9,2020-06-29 22:53:39,C,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <stdio.h>\n\nint N,S,B,ic=0,ic2=0,ic3=0;\n\nchar jz[21]={'0','1','2','3','4','5','6','7','8','9'};\nchar a[9999],b[9999];\n\nvoid shift(int n){\n    char t;\n    int i=0,j,k;\n    while(n!=0){\n        a[i]=jz[n%B];\n        n/=B;\n        i++;\n    }\n    for (j=0,k=i-1;j<k;j++,k--){\n            t = a[j];\n            a[j]=a[k];\n            a[k]=t;\n        }\n\n}\n\nint check(int n){\n    int i=0,j,k;\n    while(n!=0){\n        b[i]=jz[n%B];\n        n/=B;\n        i++;\n    }\n    for (j=0,k=i-1;j<k;j++,k--)\n        {\n            if (b[j]!=b[k])\n             return 0;\n        }\n        return 1;\n}\n\nint main(){\n    scanf(\""%d %d\"",&N,&S);\n    for (int t=S+1;t<10001;t++){\n        for (B=2;B<11;B++){\n            if(check(t))\n                ic2++;\n            if(ic2==2)\n                ic3=1;\n        }\n        if (ic3)\n            printf(\""%d\\n\"",t);\n        ic++;\n        if(ic>=N)\n            break;\n        }\n}",PARTIAL_ACCEPTED,15,384
1277617424055074816,036fcf41e2535523c0e7052398a0f697250cb880fa5b31ab2336993e8e2b7dd9,2020-06-29 22:58:25,C,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <stdio.h>\n\nint N,S,B,ic=0,ic2=0,ic3=0;\n\nchar jz[21]={'0','1','2','3','4','5','6','7','8','9'};\nchar a[9999],b[9999];\n\nvoid shift(int n){\n    char t;\n    int i=0,j,k;\n    while(n!=0){\n        a[i]=jz[n%B];\n        n/=B;\n        i++;\n    }\n    for (j=0,k=i-1;j<k;j++,k--){\n            t = a[j];\n            a[j]=a[k];\n            a[k]=t;\n        }\n\n}\n\nint check(int n){\n    int i=0,j,k;\n    while(n!=0){\n        b[i]=jz[n%B];\n        n/=B;\n        i++;\n    }\n    for (j=0,k=i-1;j<k;j++,k--)\n        {\n            if (b[j]!=b[k])\n             return 0;\n        }\n        return 1;\n}\n\nint main(){\n    scanf(\""%d %d\"",&N,&S);\n    for (int t=S+1;t<10001;t++){\n        for (B=2;B<11;B++){\n            if(check(t))\n                ic2++;\n            if(ic2==3){\n                ic3=1;\n                break;\n            }\n        }\n        if (ic3)\n            printf(\""%d\\n\"",t);\n        ic++;\n        if(ic>=N)\n            break;\n        }\n}\n\n",PARTIAL_ACCEPTED,14,388
1277617555580059648,e39cca8043cb19013671c440a202a288f7f87c73afe6761b2bd045987b1a86c5,2020-06-29 22:58:56,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cmath>\n#include <string>\nusing namespace std;\nchar a[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'},b[60];\nint B,n;\nint l=0;\nvoid change(int x)  \n\t{int i=0,j;\n\twhile (x!=0)\n  {j=x%B;\n\tb[i]=a[j];\n\tx=x/B;\n   i++;\n\tl++;}\n}}\nbool check()\n{int i,j;\n change(n);\n i=0;\n j=l-1;\n while(i<j)\n {if(b[i]!=b[j])\n   return false;\n  i++;\n  j--;}\n return true;}\nvoid display(int q)\n{int i;\n change(q);\n for(i=0;i<l;i++)\n\t cout<<b[i];}\nint main()\n{cin>>B;\n for(int i=1;i<=300;i++)\n {\n\t n=i*i;\n\t if(check())\n\t {display(i);\n\t  cout<<\"" \"";\n\t  display(n);\n\t  cout<<\""\\n\"";\n\t }}\n\n\treturn 0;\n}\n",COMPILE_ERROR,0,0
1277617620679852032,e39cca8043cb19013671c440a202a288f7f87c73afe6761b2bd045987b1a86c5,2020-06-29 22:59:12,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cmath>\n#include <string>\nusing namespace std;\nchar a[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'},b[60];\nint B,n;\nint l=0;\nvoid change(int x)  \n\t{int i=0,j;\n\twhile (x!=0)\n  {j=x%B;\n\tb[i]=a[j];\n\tx=x/B;\n   i++;\n\tl++;}\n}\nbool check()\n{int i,j;\n change(n);\n i=0;\n j=l-1;\n while(i<j)\n {if(b[i]!=b[j])\n   return false;\n  i++;\n  j--;}\n return true;}\nvoid display(int q)\n{int i;\n change(q);\n for(i=0;i<l;i++)\n\t cout<<b[i];}\nint main()\n{cin>>B;\n for(int i=1;i<=300;i++)\n {\n\t n=i*i;\n\t if(check())\n\t {display(i);\n\t  cout<<\"" \"";\n\t  display(n);\n\t  cout<<\""\\n\"";\n\t }}\n\n\treturn 0;\n}\n",MULTIPLE_ERROR,40,424
1277618601236824064,e39cca8043cb19013671c440a202a288f7f87c73afe6761b2bd045987b1a86c5,2020-06-29 23:03:06,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cmath>\n#include <string>\nusing namespace std;\nchar a[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'},b[60];\nint B,n;\nint l=0;\nvoid change(int x)  \n\t{int i=0,j;\n\twhile (x!=0)\n  {j=x%B;\n\tb[i]=a[j];\n\tx=x/B;\n   i++;\n\tl++;}\n}\nbool check()\n{int i,j;\n change(n);\n i=0;\n j=l-1;\n while(i<j)\n {if(b[i]!=b[j])\n   return false;\n  i++;\n  j--;}\n return true;}\nvoid display(int q)\n{int i;\n change(q);\n for(i=l-1;i>=0;i--)\n\t cout<<b[i];}\nint main()\n{cin>>B;\n for(int i=1;i<=300;i++)\n {\n\t n=i*i;\n\t if(check())\n\t {display(i);\n\t  cout<<\"" \"";\n\t  display(n);\n\t  cout<<\""\\n\"";\n\t }}\n\n\treturn 0;\n}\n",MULTIPLE_ERROR,40,452
1277618708661338112,a6bcff8eac6626683b54ea6532d742253cc5e1930dc16d624f22dfcea8f7c923,2020-06-29 23:03:31,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <stdio.h>\nusing namespace std;\nint b,i,k;\nint arr[301];\nint f1(int num);\nvoid f2(int num);\nint main()\n{\n    cin>>b;\n    for(i=1;i<=300;i++){\n        if(f1(i*i)){\n            f2(i);\n            cout<<\"" \"";\n            for (int j=1;j<=k;j++){\n            \tif(arr[j]<10){\n            \t\tcout<<arr[j];\n\t\t\t\t}\n            \telse{\n            \t\tprintf(\""%c\"",arr[j]+55);\n\t\t\t\t}\n\t\t\t}\n            cout<<endl;\n\t\t}\n    }\n}\nint f1(int num){\n    int s=num;\n    int i=0;\n    while(s!=0){\n        i++;\n        arr[i]=s%b;\n        s=s/b;\n    }\n    k=i;\n    for(int j=1;j<=i/2+1;j++){\n    \tif(arr[j]!=arr[i-j+1]) \n\t\t\treturn 0;\n\t}\n    return 1;\n}\nvoid f2(int num){\n    if(num==0) {\n    \treturn;\n\t}\n    f2(num/b);\n    if(num%b<10) {\n    \tcout<<num%b;\n\t}\n    else {\n    \tprintf(\""%c\"",num%b+55);\t\n\t}\n}\n\n",ACCEPTED,31,496
1277618727703478272,3a483c97e80635c09e7231fda74b44a27914eee8e61b3aa5ee128ae2e1dab19b,2020-06-29 23:03:36,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nchar num[20] = {'0','1','2','3','4',\n                '5','6','7','8','9'};\nshort s,n;\nbool pan(short a, short b){\n    char shu[20];\n    short n=1;\n    while (a != 0){\n        shu[n] = num[a%b];\n        n++;\n        a /= b;\n    }\n    for (short i=1;i<n;i++){\n        if (shu[i] == shu[n-1]) n--;\n        else return false;\n    }\n    return true;\n}\n\nint main()\n{\n    cin >> n >> s;\n    short i=1;\n    while (n>0){\n        short pass = 0;\n        for (short j=2;j<=10;j++){\n            if (pan(s+i, j)){\n                pass++;\n            }\n            if (pass >= 2) break;\n        }\n        if (pass >= 2){\n            cout << s+i << endl;\n            n--;\n        }\n        i++;\n    }\n    return 0;\n}\n",ACCEPTED,30,384
1277620748137455616,57480949030af151ef53877a64aa8077b02f5a1624bde07439497c0c58bcc8bf,2020-06-29 23:11:38,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nvoid jinzhi(int a,int b);\nbool huiwenshu();\nint n;\nint s[301];\nvoid jinzhi(int a,int b){\n    int r=0;\n    while(a){\n        s[++r]=a%b;\n        a/=b;\n    }\n    s[0]=r;\n}\nbool huiwenshu(){\n    for(int i=1;i<=s[0];i++)\n    {\n        if(s[i]!=s[s[0]+1-i])\n            return false;\n    }\n    return true;\n}\n\nint main()\n    {\n    cin>>n;\n    for(int i=1;i<=300;i++){\n        jinzhi(i*i,n);\n        if(huiwenshu()){\n            jinzhi(i,n);\n            for(int i=s[0];i>=1;i--)\n            {\n                if(s[i]<=9){\n                    cout<<s[i];\n                }\n                else {\n                    cout<<(char)(s[i]-10+'A');\n                }\n            }\n            cout<<' ';\n            jinzhi(i*i,n);\n            for(int i=s[0];i>=1;i--)\n            {\n                if(s[i]<=9){\n                    cout<<s[i];\n                }\n                else{\n                    cout<<(char)(s[i]-10+'A');\n                }\n            }\n            puts(\""\"");\n        }\n    }\n    return 0;\n}\n",ACCEPTED,40,448
1277620858615431168,c85b4c1c77fefeb5973f4524c52bf63288e9a28b3c4ba86d4dd9facc66617b4a,2020-06-29 23:12:04,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <stdio.h>\n\nconst int n = 100;\nint b, a[n], m, s;\n\nint test(int x,int b){\n    int k = 0;\n    while (x > 0){\n        k++;\n        a[k] = x % b;\n        x /= b;\n    }\n\n    int t = k, i = k;\n    while (i > 0 && a[i] == a[t - i + 1])\n        i--;\n\n    if (i == 0)\n        return 1;\n    else\n        return 0;\n}\n\nint main(){\n    scanf(\""%d %d\"", &m, &s);\n    while (m){\n        s++;\n        int temp=0;\n        for (int i=2;i<=10;i++)\n            if (test(s,i)){\n                temp++;\n                if (temp==2)\n                    break;\n            }\n\n        if (temp==2){\n            printf(\""%d\\n\"",s);\n            m--;\n        }\n    }\n\n    return 0;\n}\n",COMPILE_ERROR,0,0
1277621120402915328,c85b4c1c77fefeb5973f4524c52bf63288e9a28b3c4ba86d4dd9facc66617b4a,2020-06-29 23:13:06,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <stdio.h>\n\nconst int n = 100;\nint b, a[n], m, s;\n\nint test(int x,int b){\n    int k = 0;\n    while (x > 0){\n        k++;\n        a[k] = x % b;\n        x /= b;\n    }\n\n    int t = k, i = k;\n    while (i > 0 && a[i] == a[t - i + 1])\n        i--;\n\n    if (i == 0)\n        return 1;\n    else\n        return 0;\n}\n\nint main(){\n    scanf(\""%d %d\"", &m, &s);\n    while (m>0){\n        s++;\n        int temp=0;\n        for (int i=2;i<=10;i++)\n            if (test(s,i)){\n                temp++;\n                if (temp==2)\n                    break;\n            }\n\n        if (temp==2){\n            printf(\""%d\\n\"",s);\n            m--;\n        }\n    }\n\n    return 0;\n}\n",COMPILE_ERROR,0,0
1277621416080375808,c85b4c1c77fefeb5973f4524c52bf63288e9a28b3c4ba86d4dd9facc66617b4a,2020-06-29 23:14:17,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <stdio.h>\n\nconst int n = 100;\nint b, a[n], m, s;\n\nint test(int x,int b){\n    int k = 0;\n    while (x > 0){\n        k++;\n        a[k] = x % b;\n        x /= b;\n    }\n\n    int t = k, i = k;\n    while (i > 0 && a[i] == a[t - i + 1])\n        i--;\n\n    if (i == 0)\n        return 1;\n    else\n        return 0;\n}\n\nint main(){\n    scanf(\""%d %d\"", &m, &s);\n    while (m)\n    {\n        s++;\n        int temp=0;\n        for (int i=2;i<=10;i++)\n            if (test(s,i)){\n                temp++;\n                if (temp==2)\n                    break;\n            }\n\n        if (temp==2){\n            printf(\""%d\\n\"",s);\n            m--;\n        }\n    }\n\n    return 0;\n}\n\n",COMPILE_ERROR,0,0
1277622249782173696,c85b4c1c77fefeb5973f4524c52bf63288e9a28b3c4ba86d4dd9facc66617b4a,2020-06-29 23:17:36,C,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <stdio.h>\n\n#define n 100\nint b, a[n], m, s;\n\nint test(int x,int b){\n    int k = 0;\n    while (x > 0){\n        k++;\n        a[k] = x % b;\n        x /= b;\n    }\n\n    int t = k, i = k;\n    while (i > 0 && a[i] == a[t - i + 1])\n        i--;\n\n    if (i == 0)\n        return 1;\n    else\n        return 0;\n}\n\nint main(){\n    scanf(\""%d %d\"", &m, &s);\n    while (m)\n    {\n        s++;\n        int temp=0;\n        for (int i=2;i<=10;i++)\n            if (test(s,i)){\n                temp++;\n                if (temp==2)\n                    break;\n            }\n\n        if (temp==2){\n            printf(\""%d\\n\"",s);\n            m--;\n        }\n    }\n\n    return 0;\n}\n\n",ACCEPTED,23,368
1277622304358457344,21378286f000a43bb43e73c5990641e25039f8adc06495ef53736feb56560c8c,2020-06-29 23:17:49,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstring>\n#include<map>\n#include<vector>\n#include<array>\n#include <algorithm>\n#include<cmath>\nusing namespace std;\nvector<char> change(int n, int b)\n{\n    vector<char>num;\n    while (n > 0)\n    {\n        int m = n % b;\n        if (m < 10)\n        {\n            num.push_back(m + 48);\n\n        }\n        else\n        {\n            num.push_back(m + 55);\n        }\n        n = n / b;\n    }\n    return num;\n}\nint checkou(vector<char>a)\n{\n    int flag = 0;\n    for (int i = 0; i < (a.size()/2); i++)\n    {\n        if (a[i] == a[a.size() - i - 1])\n        {\n                    flag += 0;\n        }\n        else\n        {\n                    flag += 1;\n        }\n    }\n    return flag;\n}\n//int checkji(vector<char>a)\n//{\n//    int flag = 0;\n//    for (int i = 0; i < (a.size() / 2); i++)\n//    {\n//        if (a[i] == a[a.size() - i - 1])\n//        {\n//            flag += 0;\n//        }\n//        else\n//        {\n//            flag += 1;\n//        }\n//    }\n//    return flag;\n//}\n\n//for (int j = 0; j < (c.size() / 2); j++)\n//{\n//    if (c[j] == c[c.size() - j - 1])\n//    {\n//        flag = 1;\n//    }\n//    else\n//    {\n//        flag = 0;\n//    }\n\nint main()\n{\n    int a;\n    int flag = 0;\n    cin >> a;\n    vector<char>c;\n    vector<vector<char>>cc;\n    for (int i = 1; i <= 300; i++)\n    {\n        c = change(i * i, a);\n        cc.push_back(c);     \n    }\n   \n    for (int i = 0; i < c.size(); i++)\n    {\n        flag = checkou(cc[i]);\n        if (flag == 0)\n        {\n            for (int j = 0; j < cc[i].size(); j++)\n            {\n                string s(cc[i].begin(), cc[i].end());\n                cout << i+1 << \"" \"" << s << endl;\n             }\n            \n            \n\n        }\n    }\n   \n    \n    return 0;\n}",WRONG_ANSWER,33,388
1277623321007423488,34e5c56c5cec86eefa279cc7a216a4530a6f851f3dbdd281ec607fda9b795eb8,2020-06-29 23:21:51,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n\nint s[301];\n\nvoid scale(int a,int b) //转换进制（a的b进制）:辗转相除写余数\n{\n    int digit=0;\n    while(a){\n        s[++digit]=a%b;\n        a/=b;\n    }\n    s[0]=digit;\n}\nbool ifEqual(){//判断s[i]与s[s[0]+1-i]是否相等\n    for(int i=1;i<=s[0];i++){\n        if(s[i]!=s[s[0]+1-i])\n            return 0;\n    }\n    return 1;\n}\n\nvoid display(){ //打印回文数\n    for(int i=s[0];i>=1;i--){//按进制存储是反方向的\n        if(s[i]<=9)\n            cout<<s[i];\n        else\n            cout<<(char)(s[i]-10+'A'); //大于十进制的数用字母表示，构造函数类型转换\n    }\n}\nint main()\n{\n    int b;\n    cin>>b;\n\n    for(int i=1;i<301;i++){\n        scale(i*i,b);\n        if(ifEqual()){\n            scale(i,b);\n            display();\n            cout<<' ';\n            scale(i*i,b);\n            display();\n            cout << endl;\n        }\n    }\n    return 0;\n}\n\n\n",ACCEPTED,37,512
1277624289145053184,a6bcff8eac6626683b54ea6532d742253cc5e1930dc16d624f22dfcea8f7c923,2020-06-29 23:25:42,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <stdio.h>\n#include <vector>\nusing namespace std;\nint N,S;\nint i,k;\nvector<int> v;\nint arr[301];\nint f1(int num,int b);\nint main()\n{\n\tcin>>N>>S;\n    int flag=0;\n    for(int u=S+1;flag<N;u++){\n    \tint ff=0;\n    \tfor(int oo=2;oo<11;oo++){\n    \t\tif(f1(u,oo)){\n    \t\t\tff++;\n\t\t\t}\n\t\t\tif(ff==2){\n\t\t\t\tflag++;\n\t\t\t\tv.push_back(u);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tfor(int i=0;i<v.size();i++){\n\t\tcout<<v[i]<<endl;\n\t}\n\treturn 0;\n}\nint f1(int num,int b){\n    int s=num;\n    int i=0;\n    while(s!=0){\n        i++;\n        arr[i]=s%b;\n        s=s/b;\n    }\n    k=i;\n    for(int j=1;j<=i/2+1;j++){\n    \tif(arr[j]!=arr[i-j+1]) \n\t\t\treturn 0;\n\t}\n    return 1;\n}\n\n",ACCEPTED,27,384
1277624816268402688,e331d74d4712667e098ce888036af991dbd882cc58ae9c09d44f6a2c7688c68b,2020-06-29 23:27:47,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstring>\n#include<cstdio>\n#include<cmath>\n#include<algorithm>\ntypedef long long ll ;\nusing namespace std;\nchar a[100];\nchar b[100];\nll seta()\n{\n    ll m=strlen(a);\n    ll i,answer=0;\n    for(i=0;i<m/2;i++)\n    {\n        if(a[i]==a[m-i-1])\n        {\n            answer++;\n        }\n    }\n    if(answer>=m/2)\n    {\n        return 1;\n    }\n    else return 0;\n}\nll seta1(ll n,ll p)\n{\n    ll m;\n    memset(a,0,sizeof(a));\n    ll i=0;\n    while(n)\n    {\n        if(n%p>=10)\n        {\n            a[i]=char('A'+(n%p-10));\n        }\n        else\n            a[i]=n%p+48;\n        n/=p;\n        i++;\n    }\n    a[i]=0;\n    ll answer=seta();\n    if(answer==1)\n        return 1;\n    else\n        return 0;\n}\nvoid setb()\n{\n    ll n=strlen(b);\n    ll i;\n    char c;\n    for(i=0;i<n/2;i++)\n    {\n        c=b[i];\n        b[i]=b[n-i-1];\n        b[n-i-1]=c;\n    }\n}\nvoid setb1(ll n,ll p)\n{\n    ll m;\n    memset(b,0,sizeof(b));\n    ll i=0;\n    while(n)\n    {\n        if(n%p>=10)\n            b[i]=char('A'+(n%p-10));\n        else\n            b[i]=n%p+48;\n        n/=p;\n        i++;\n    }\n    b[i]=0;\n    setb();\n}\nint main()\n{\n    ll n;\n    cin>>n;\n    for(ll i=1;i<=300;i++)\n    {\n        ll answer=seta1(i*i,n);\n        if(answer==1)\n        {\n            setb1(i,n);\n            cout<<b<<\"" \""<<a<<endl;\n        }\n    }\n    return 0;\n}",ACCEPTED,40,424
1277625193881600000,e331d74d4712667e098ce888036af991dbd882cc58ae9c09d44f6a2c7688c68b,2020-06-29 23:29:18,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstring>\n#include<cstdio>\n#include<cmath>\n#include<algorithm>\ntypedef long long ll ;\nusing namespace std;\nchar a[100];\nchar b[100];\nll seta()\n{\n    ll m=strlen(a);\n    ll i,answer=0;\n    for(i=0;i<m/2;i++)\n    {\n        if(a[i]==a[m-i-1])\n        {\n            answer++;\n        }\n    }\n    if(answer>=m/2)\n    {\n        return 1;\n    }\n    else return 0;\n}\nll seta1(ll n,ll p)\n{\n    memset(a,0,sizeof(a));\n    ll i=0;\n    while(n)\n    {\n        if(n%p>=10)\n        {\n            a[i]=char('A'+(n%p-10));\n        }\n        else\n            a[i]=n%p+48;\n        n/=p;\n        i++;\n    }\n    a[i]=0;\n    ll answer=seta();\n    if(answer==1)\n        return 1;\n    else\n        return 0;\n}\nvoid setb()\n{\n    ll n=strlen(b);\n    ll i;\n    char c;\n    for(i=0;i<n/2;i++)\n    {\n        c=b[i];\n        b[i]=b[n-i-1];\n        b[n-i-1]=c;\n    }\n}\nvoid setb1(ll n,ll p)\n{\n    memset(b,0,sizeof(b));\n    ll i=0;\n    while(n)\n    {\n        if(n%p>=10)\n            b[i]=char('A'+(n%p-10));\n        else\n            b[i]=n%p+48;\n        n/=p;\n        i++;\n    }\n    b[i]=0;\n    setb();\n}\nint main()\n{\n    ll n;\n    cin>>n;\n    for(ll i=1;i<=300;i++)\n    {\n        ll answer=seta1(i*i,n);\n        if(answer==1)\n        {\n            setb1(i,n);\n            cout<<b<<\"" \""<<a<<endl;\n        }\n    }\n    return 0;\n}",ACCEPTED,41,424
1277625648116326400,2634e2067e3d315bacd1f088e3446d119cc31358524fbab73e9e7696922b24d4,2020-06-29 23:31:06,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<math.h>\n#include<vector>\nusing namespace std;\n\nbool Judge(int number){\n    int Origin = number,ReversedNumber=0,Reversed=0;\n    while (number!=0) {\n        Reversed = number%10;\n        ReversedNumber = ReversedNumber*10 + Reversed;\n        number /= 10;\n    }\n    if(Origin==ReversedNumber){\n        return true;\n    }else{\n        return false;\n    }\n}\n\nbool Judge(vector<int> a){\n    bool flag = true;\n    for(int i=a.size()-1;i>=0;--i){\n        if(a[i]!=a[a.size()-1-i])\n            flag = false;\n    }\n    return flag;\n}\n\nvector<int> Transform(int number,int B){\n    vector<int> demo;\n    while(number){\n        demo.push_back(number%B);\n        number /= B;\n    }\n    return demo;\n}\n\nint main(){\n    int B=0;\n    cin >> B;\n    for(int i=0;i<=300;i++){\n        vector<int> temp1,temp2;\n        temp1 = Transform(i,B); //B进制i\n        int sqrti = pow(i,2);\n        temp2 = Transform(sqrti,B);\n        if(Judge(temp2)){\n            for(int j=temp1.size()-1;j>=0;--j){\n                cout << temp1[j];\n            }\n            cout << \"" \"";\n            for(int k=temp2.size()-1;k>=0;--k){\n                cout << temp2[k];\n            }\n            cout << endl;\n        }\n    }\n\n    return 0;\n}\n",MULTIPLE_ERROR,35,384
1277625722334535680,21378286f000a43bb43e73c5990641e25039f8adc06495ef53736feb56560c8c,2020-06-29 23:31:24,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstring>\n#include<map>\n#include<vector>\n#include<array>\n#include <algorithm>\n#include<cmath>\nusing namespace std;\nvector<char> change(int n, int b)\n{\n    vector<char>num;\n    while (n > 0)\n    {\n        int m = n % b;\n        if (m < 10)\n        {\n            num.push_back(m + 48);\n\n        }\n        else\n        {\n            num.push_back(m + 55);\n        }\n        n = n / b;\n    }\n    return num;\n}\nint checkou(vector<char>a)\n{\n    int flag = 0;\n    for (int i = 0; i < (a.size()/2); i++)\n    {\n        if (a[i] == a[a.size() - i - 1])\n        {\n                    flag += 0;\n        }\n        else\n        {\n                    flag += 1;\n        }\n    }\n    return flag;\n}\nint main()\n{\n    int a;\n    int flag = 0;\n    cin >> a;\n    vector<char>c;\n    vector<vector<char>>cc;\n    for (int i = 1; i <= 300; i++)\n    {\n        c = change(i * i, a);\n        cc.push_back(c);     \n    }\n   \n    for (int i = 0; i < cc.size(); i++)\n    {\n        flag = checkou(cc[i]);\n        if (flag == 0)\n        {\n            \n               vector<char> p = change(i + 1, a);\n               string ss(p.rbegin(), p.rend());\n                string s(cc[i].begin(), cc[i].end());\n                cout << ss << \"" \"" << s << endl;\n            \n            \n            \n\n        }\n    }\n   \n    \n    return 0;\n}",ACCEPTED,42,508
1277625870812897280,2634e2067e3d315bacd1f088e3446d119cc31358524fbab73e9e7696922b24d4,2020-06-29 23:31:59,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<math.h>\n#include<vector>\nusing namespace std;\n\nbool Judge(int number){\n    int Origin = number,ReversedNumber=0,Reversed=0;\n    while (number!=0) {\n        Reversed = number%10;\n        ReversedNumber = ReversedNumber*10 + Reversed;\n        number /= 10;\n    }\n    if(Origin==ReversedNumber){\n        return true;\n    }else{\n        return false;\n    }\n}\n\nbool Judge(vector<int> a){\n    bool flag = true;\n    for(int i=a.size()-1;i>=0;--i){\n        if(a[i]!=a[a.size()-1-i])\n            flag = false;\n    }\n    return flag;\n}\n\nvector<int> Transform(int number,int B){\n    vector<int> demo;\n    while(number){\n        demo.push_back(number%B);\n        number /= B;\n    }\n    return demo;\n}\n\nint main(){\n    int B=0;\n    cin >> B;\n    for(int i=0;i<=300;i++){\n        vector<int> temp1,temp2;\n        temp1 = Transform(i,B); //B进制i\n        int sqrti = pow(i,2);\n        temp2 = Transform(sqrti,B);\n        if(Judge(temp2)){\n            for(int j=temp1.size()-1;j>=0;--j){\n                cout << temp1[j];\n            }\n            cout << \"" \"";\n            for(int k=temp2.size()-1;k>=0;--k){\n                cout << temp2[k];\n            }\n            cout << endl;\n        }\n    }\n\n    return 0;\n}\n",MULTIPLE_ERROR,29,384
1277625890547105792,2634e2067e3d315bacd1f088e3446d119cc31358524fbab73e9e7696922b24d4,2020-06-29 23:32:04,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<math.h>\n#include<vector>\nusing namespace std;\n\nbool Judge(int number){\n    int Origin = number,ReversedNumber=0,Reversed=0;\n    while (number!=0) {\n        Reversed = number%10;\n        ReversedNumber = ReversedNumber*10 + Reversed;\n        number /= 10;\n    }\n    if(Origin==ReversedNumber){\n        return true;\n    }else{\n        return false;\n    }\n}\n\nbool Judge(vector<int> a){\n    bool flag = true;\n    for(int i=a.size()-1;i>=0;--i){\n        if(a[i]!=a[a.size()-1-i])\n            flag = false;\n    }\n    return flag;\n}\n\nvector<int> Transform(int number,int B){\n    vector<int> demo;\n    while(number){\n        demo.push_back(number%B);\n        number /= B;\n    }\n    return demo;\n}\n\nint main(){\n    int B=0;\n    cin >> B;\n    for(int i=1;i<=300;i++){\n        vector<int> temp1,temp2;\n        temp1 = Transform(i,B); //B进制i\n        int sqrti = pow(i,2);\n        temp2 = Transform(sqrti,B);\n        if(Judge(temp2)){\n            for(int j=temp1.size()-1;j>=0;--j){\n                cout << temp1[j];\n            }\n            cout << \"" \"";\n            for(int k=temp2.size()-1;k>=0;--k){\n                cout << temp2[k];\n            }\n            cout << endl;\n        }\n    }\n\n    return 0;\n}\n",PARTIAL_ACCEPTED,37,512
1277628630283247616,a1e7064b323be6c22b1cc57f30af167085750c33ec47c1123456ba82dffd1a78,2020-06-29 23:42:57,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<stdio.h>\n#include<math.h>\n\nusing namespace std;\n\n\n\nint w;//表示进制位数\n\n\nint Trans(int n,int x){  //n为进制，x为需要转化的数字\n    int icount =0;\n    int tNum = 0;\n    int r; //余数\n    int c = x; //除数\n    if(x<n)\n        tNum = x;\n    else\n        while(c!=0){\n            r = c%n;\n            c = c/n;\n            icount +=1;\n            tNum +=r*pow(10,icount-1);\n//            cout << icount<<endl;\n//            cout <<\""-------\""<< tNum<<endl;\n        }\n    w = icount;\n    return tNum;\n\n}\n\nbool Circle(int a,int n){  //n为a中数字个数\n    int list[n];\n    for(int i=0;i<n;i++){\n        list[i]=a/(pow(10,n-1-i));\n        a -=list[i]*pow(10,n-1-i);\n    }\n    for(int i=0;i<n;i++)\n        if(list[i]!=list[n-1-i])\n            return 0;\n    return 1;\n}\n\n\nint main(){\n    int n;\n    cin >> n;\n\n    for(int i=0;i<=300;i++){\n        int ans1 = Trans(n,i);\n        int ans2 = pow(ans1,2);\n        if(Circle(ans2,w))\n            cout << ans1 << \"" \"" << ans2 <<endl;\n\n\n    }\n\n}\n\n\n\n\n",WRONG_ANSWER,29,384
1277630139238645760,2634e2067e3d315bacd1f088e3446d119cc31358524fbab73e9e7696922b24d4,2020-06-29 23:48:57,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<math.h>\n#include<vector>\nusing namespace std;\n\nchar character[11]{'A','B','C','D','E','F','G','H','I','J','K'};\n\nbool Judge(int number){\n    int Origin = number,ReversedNumber=0,Reversed=0;\n    while (number!=0) {\n        Reversed = number%10;\n        ReversedNumber = ReversedNumber*10 + Reversed;\n        number /= 10;\n    }\n    if(Origin==ReversedNumber){\n        return true;\n    }else{\n        return false;\n    }\n}\n\nbool Judge(string a){\n    bool flag = true;\n    for(int i=a.size()-1;i>=0;--i){\n        if(a[i]!=a[a.size()-1-i])\n            flag = false;\n    }\n    return flag;\n}\n\nstring Transform(int number,int B){\n    string demo;\n    while(number){\n        if(number%B<10){\n            char tempchar = number%B + '0';\n            demo.push_back(tempchar);\n        }else{\n            demo.push_back(character[number%B-10]);\n        }\n        number /= B;\n    }\n    return demo;\n}\n\nint main(){\n    int B=0;\n    cin >> B;\n    for(int i=1;i<=300;i++){\n        string temp1,temp2;\n        temp1 = Transform(i,B); //B进制i\n        int sqrti = pow(i,2);\n        temp2 = Transform(sqrti,B);\n        if(Judge(temp2)){\n            cout << temp1 << \"" \"" << temp2 << endl;\n        }\n    }\n\n    return 0;\n}\n",PARTIAL_ACCEPTED,43,512
1277630415605522432,2634e2067e3d315bacd1f088e3446d119cc31358524fbab73e9e7696922b24d4,2020-06-29 23:50:02,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<math.h>\n#include<vector>\nusing namespace std;\n\nchar character[11]{'A','B','C','D','E','F','G','H','I','J','K'};\n\nbool Judge(string a){\n    bool flag = true;\n    for(int i=a.size()-1;i>=0;--i){\n        if(a[i]!=a[a.size()-1-i])\n            flag = false;\n    }\n    return flag;\n}\n\nstring Transform(int number,int B){\n    string demo;\n    while(number){\n        if(number%B<10){\n            char tempchar = number%B + '0';\n            demo.push_back(tempchar);\n        }else{\n            demo.push_back(character[number%B-10]);\n        }\n        number /= B;\n    }\n    return demo;\n}\n\nint main(){\n    int B=0;\n    cin >> B;\n    for(int i=1;i<=300;i++){\n        string temp1,temp2;\n        temp1 = Transform(i,B); //B进制i\n        int sqrti = pow(i,2);\n        temp2 = Transform(sqrti,B);\n        if(Judge(temp2)){\n            cout << temp1 << \"" \"" << temp2 << endl;\n        }\n    }\n\n    return 0;\n}\n",PARTIAL_ACCEPTED,26,448
1277630805289926656,1d03dde7416ddffb412b8eab4ebb5de6b9f6decff8dcd87fb41585be3198cc5c,2020-06-29 23:51:35,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nint p;\nchar c(int x){if(x>=0&&x<=9)return x+'0';return x-10+'A';}\nstruct ps{\n        int m ;\n        int arr[18]={};\n        ps(int x){\n            for(m=0;x;m++){\n                arr[m]=x%p,x/=p;\n            }\n        }\n        void output(){\n            for(int i=m-1;i>=0;i--){\n                printf(\""%c\"", c(arr[i]));\n            }\n        }\n        int _if(){\n            int pt = 1;\n            for (int i = 0; i < m; i++){\n                if (arr[i] == arr[m - 1 - i])\n                    continue;\n                else\n                pt = 0;\n            }   \n\n            return pt;\n        }\n};\n\nint main(){\n    cin >> p;\n\n    for (int i = 1; i <= 300;i++){\n        ps n(i * i);\n        if(n._if()){\n            ps l(i);\n            l.output();\n            cout << \"" \"";\n            n.output();\n            cout << endl;\n            }\n    }\n    return 0;\n}",ACCEPTED,42,412
1277630915491069952,2634e2067e3d315bacd1f088e3446d119cc31358524fbab73e9e7696922b24d4,2020-06-29 23:52:02,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<math.h>\n#include<vector>\nusing namespace std;\n\nchar character[11]{'A','B','C','D','E','F','G','H','I','J','K'};\n\nbool Judge(string a){\n    bool flag = true;\n    for(int i=a.size()-1;i>=0;--i){\n        if(a[i]!=a[a.size()-1-i])\n            flag = false;\n    }\n    return flag;\n}\n\nstring Transform(int number,int B){\n    string demo;\n    while(number){\n        if(number%B<10){\n            char tempchar = number%B + '0';\n            demo.push_back(tempchar);\n        }else{\n            demo.push_back(character[number%B-10]);\n        }\n        number /= B;\n    }\n    return demo;\n}\n\nint main(){\n    int B=0;\n    cin >> B;\n    for(int i=1;i<=300;i++){\n        string temp1,temp2;\n        temp1 = Transform(i,B); //B进制i\n        int sqrti = pow(i,2);\n        temp2 = Transform(sqrti,B);\n        if(Judge(temp2)){\n            for(int i=temp1.size()-1;i>=0;--i){\n                cout << temp1[i];\n            }\n            cout << \"" \"" << temp2 << endl;\n        }\n    }\n\n    return 0;\n}",ACCEPTED,39,512
1277631789898596352,685d92e8c15d0ebd2875b6981da27f1f4ec039ee8163beabb74fb58572d473d4,2020-06-29 23:55:30,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstdlib>\n#include<cstdio>\n#include<string>\n#include<string.h>\nusing namespace std;\nint judge(char *a)\n{\n\tint n = strlen(a);\n\tchar b[300];\n\tfor (int i = 0; i < n; i++)\n\t\tif (b[n - 1 - i] != *(a + i))\n\t\t\treturn 0;\n\treturn 1;\n}\nint a(int b)\n{\n\treturn b * b;\n}\nint main()\n{\n\tchar c[100],d[100];\n\tint b;\n\tcin >> b;\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\titoa(a(i), d, b);\n\t\tif (judge(d) == 0)\n\t\t\tcontinue;\n\t\telse if (judge(d) == 1)\n\t\t{\n\t\t\titoa(i, c, b);\n\t\t\tcout << c << \"" \"" << d << endl;\n\t\t}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1277631888850616320,685d92e8c15d0ebd2875b6981da27f1f4ec039ee8163beabb74fb58572d473d4,2020-06-29 23:55:54,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstdlib>\n#include<cstdio>\n#include<string>\n#include<string.h>\nusing namespace std;\nint judge(char *a)\n{\n\tint n = strlen(a);\n\tchar b[300];\n\tfor (int i = 0; i < n; i++)\n\t\tif (b[n - 1 - i] != *(a + i))\n\t\t\treturn 0;\n\treturn 1;\n}\nint a(int b)\n{\n\treturn b * b;\n}\nint main()\n{\n\tchar c[100],d[100];\n\tint b;\n\tcin >> b;\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\titoa(i*i, d, b);\n\t\tif (judge(d) == 0)\n\t\t\tcontinue;\n\t\telse if (judge(d) == 1)\n\t\t{\n\t\t\titoa(i, c, b);\n\t\t\tcout << c << \"" \"" << d << endl;\n\t\t}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1277633912379990016,036fcf41e2535523c0e7052398a0f697250cb880fa5b31ab2336993e8e2b7dd9,2020-06-30 00:03:56,C,60.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <stdio.h>\n\nint N,S,B,ic=0,ic2,ic3=0;\n\nchar jz[21]={'0','1','2','3','4','5','6','7','8','9'};\nchar a[9999],b[9999];\n\nvoid shift(int n){\n    char t;\n    int i=0,j,k;\n    while(n!=0){\n        a[i]=jz[n%B];\n        n/=B;\n        i++;\n    }\n    for (j=0,k=i-1;j<k;j++,k--){\n            t = a[j];\n            a[j]=a[k];\n            a[k]=t;\n        }\n\n}\n\nint check(int n){\n    int i=0,j,k;\n    while(n!=0){\n        b[i]=jz[n%B];\n        n/=B;\n        i++;\n    }\n    for (j=0,k=i-1;j<k;j++,k--)\n        {\n            if (b[j]!=b[k])\n             return 0;\n        }\n        return 1;\n}\n\nint main(){\n    scanf(\""%d %d\"",&N,&S);\n    for (int t=S+1;t<10001;t++){\n        int ic2=0;\n        for (B=2;B<11;B++){\n            if(check(t))\n                ic2++;\n            if(ic2==2)\n                ic3=1;\n        }\n        if (ic3==1){\n            printf(\""%d\\n\"",t);\n            ic3=0;\n            ic++;\n        }\n\n        if(ic>=N)\n            break;\n        }\n}",PARTIAL_ACCEPTED,23,384
1277634103925473280,036fcf41e2535523c0e7052398a0f697250cb880fa5b31ab2336993e8e2b7dd9,2020-06-30 00:04:42,C,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <stdio.h>\n\nint N,S,B,ic=0,ic2,ic3=0;\n\nchar jz[21]={'0','1','2','3','4','5','6','7','8','9'};\nchar a[9999],b[9999];\n\nvoid shift(int n){\n    char t;\n    int i=0,j,k;\n    while(n!=0){\n        a[i]=jz[n%B];\n        n/=B;\n        i++;\n    }\n    for (j=0,k=i-1;j<k;j++,k--){\n            t = a[j];\n            a[j]=a[k];\n            a[k]=t;\n        }\n\n}\n\nint check(int n){\n    int i=0,j,k;\n    while(n!=0){\n        b[i]=jz[n%B];\n        n/=B;\n        i++;\n    }\n    for (j=0,k=i-1;j<k;j++,k--)\n        {\n            if (b[j]!=b[k])\n             return 0;\n        }\n        return 1;\n}\n\nint main(){\n    scanf(\""%d %d\"",&N,&S);\n    for (int t=S+1;t<100001;t++){\n        int ic2=0;\n        for (B=2;B<11;B++){\n            if(check(t))\n                ic2++;\n            if(ic2==2)\n                ic3=1;\n        }\n        if (ic3==1){\n            printf(\""%d\\n\"",t);\n            ic3=0;\n            ic++;\n        }\n\n        if(ic>=N)\n            break;\n        }\n}",ACCEPTED,15,388
1277634540292472832,22bc41363ee5ce2db2edc4a0bb731769cc4b7261d5eae6b29c2cf336a68cd60b,2020-06-30 00:06:26,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"//input 输入N：前N个数  输入S：大于S\n//\n//int N, S\n//char num[8]={'0','1''2''3''4''5''6''7'}\n//\n//bool judge两个以上进制下回文(int i)\n//\tint count\n//\tfor(B=2; B<=8; B++){\n//\t\tif（判断B下是不是回文数 (B, i)） count++\n//\t\tif(count>2) return true;\n//\t}\n//\treturn false\n//\t\n//bool 判断i在B下是不是回文数（int B, int i){\n//\tchar temp[MAX_N];\n//\tint j=0\n//\tbool sign= true;\n//\twhile(i>=B){\n//\t\tint left= i%B\n//\t\ttemp[j]= num[left]\n//\t\ti= i/B;\n//\t\tj++;\n//\t} \n//\t最后一项  temp[j]= num[i] j++\n//\t\n//\t判断回文\n//\tfor(int k=0)````\n//\t\tif(!=) sign= false break;\n//\t\t\n//\treturn sign\n//} \n//\t\n//\t\n//\n//int main(){\n//\t输入\n//\tint cNUM=0\n//\tfor(int i=s;cNUM<N; i++ ) {\n//\t\tif(judge(i)) cNUM++ cout << i;\n//\t}\n//} \n#include<iostream>\nusing namespace std;\nchar num[8]={'0','1','2','3','4','5','6','7'};\nchar temp[100000000];\nint N, S;\n\nbool itisunderB(int B, int i){\n\t//用B进制表示\n\n\t\n\tint j= 0; //移动B进制数组位置 \n\twhile(i>=B){\n\t\tint left= i% B;\n\t\ttemp[j]= num[left];\n\t\ti= i/B;\n\t\tj++; \n\t\t//\tcout << j << endl;\n\t}\n\ttemp[j]= num[i];\n\tj++;\n\t\n//\tfor(int i=0; i<j; i++){\n//\t\tcout << temp[i];\n//\t}\n//\t\tcout << endl;\n\t//确定是否是回文\n\tbool sign= true;\n\tfor(int i=0; i<j/2; i++){\n\t\tif(temp[i]!=temp[j-i-1]) return false;//不是回文 终止运行 \n\t} \n\t \n\t return true;\n\t \n} \n\nbool itisdouble(int i){\n\tint count= 0;\n\tfor(int B=2; B<=8; B++){//轮着讨论二到八进制 \n\t\tif(itisunderB(B, i)) count++;\n\t//\tcout << count << endl; \n\t\tif(count>=2) return true;\n\t}\n\t\n\treturn false;\n}\n\nint main(){\n\tcin >> N >> S;\n\n\tint countNUM= 0;\n\tfor(int i=S; countNUM<N; i++){\n\t\tif(itisdouble(i)) {//如果在两个以上进制下回文成立  \n\t\tcountNUM++;\n\t\tcout << i << endl;\n\t\t} \n\t\t \n\t}\n//\n//\tbool sign= itisdouble(26);\n//\tcout << sign << endl;\n//\t\n\treturn 0;\n}",WRONG_ANSWER,21,424
1277634975837380608,e39cca8043cb19013671c440a202a288f7f87c73afe6761b2bd045987b1a86c5,2020-06-30 00:08:10,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cmath>\n#include <string>\nusing namespace std;\nchar b[100];\nint B,n;\nint l=0;\nvoid change(int x) {\n    int j=0;\n    while(x!=0) {\n        \n        b[j]=x%B+'0';\n        if(b[j]>'9')\n\t\t\tb[j]=b[j]-'10'+'A';\n        x/=B;\n\t\tj++;\n\t\tl++;\n\t}}\nbool check()\n{int i,j;\n change(n);\n i=0;\n j=l-1;\n while(i<j)\n {if(b[i]!=b[j])\n   return false;\n  i++;\n  j--;}\n return true;}\nvoid display(int q)\n{int i;\n change(q);\n for(i=l-1;i>=0;i--)\n\t cout<<b[i];}\nint main()\n{cin>>B;\n for(int i=1;i<=300;i++)\n {\n\t n=i*i;\n\t if(check())\n\t {display(i);\n\t  cout<<\"" \"";\n\t  display(n);\n\t  cout<<\""\\n\"";\n\t }}\n\n\treturn 0;\n}\n",MULTIPLE_ERROR,29,540
1277636245813919744,a1e7064b323be6c22b1cc57f30af167085750c33ec47c1123456ba82dffd1a78,2020-06-30 00:13:12,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<stdio.h>\n#include<math.h>\n\nusing namespace std;\n\n\n\nstatic int w =0;//表示进制位数\n\n\nint Trans(int n,int x){  //n为进制，x为需要转化的数字\n    int icount =0;\n    int tNum = 0;\n    int r; //余数\n    int c = x; //除数\n    if(x<n){\n        tNum = x;\n        icount +=1;\n    }\n    else\n        while(c!=0){\n            r = c%n;\n            c = c/n;\n            icount +=1;\n            tNum +=r*pow(10,icount-1);\n//           cout << icount<<endl;\n//            cout <<\""-------\""<< tNum<<endl;\n        }\n\n//    cout << w<<endl;\n\n    return tNum;\n\n}\n\nint W(int x){\n    int icount =0;\n    int i = 1;\n    while(x/i!=0){\n        icount+=1;\n        i *=10;\n    }\n    return  icount;\n}\n\nbool Circle(int a){  //n为a中数字个数\n    int n = W(a);\n    int list[n];\n    for(int i=0;i<n;i++){\n        list[i]=a/(pow(10,n-1-i));\n        a -=list[i]*pow(10,n-1-i);\n    }\n    for(int i=0;i<n;i++)\n        if(list[i]!=list[n-1-i])\n            return 0;\n    return 1;\n}\n\n\nint main(){\n    int n;\n    cin >> n;\n\n    for(int i=0;i<=300;i++){\n        int ans1 = Trans(n,i);\n        int ans2 = pow(ans1,2);\n        if(Circle(ans2))\n            cout << ans1 << \"" \"" << ans2 <<endl;\n    }\n\n\n\n}\n\n\n\n\n",MULTIPLE_ERROR,26,520
1277636659355516928,a1e7064b323be6c22b1cc57f30af167085750c33ec47c1123456ba82dffd1a78,2020-06-30 00:14:51,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<stdio.h>\n#include<math.h>\n\nusing namespace std;\n\n\n\nstatic int w =0;//表示进制位数\n\n\nint Trans(int n,int x){  //n为进制，x为需要转化的数字\n    int icount =0;\n    int tNum = 0;\n    int r; //余数\n    int c = x; //除数\n    if(x<n){\n        tNum = x;\n        icount +=1;\n    }\n    else\n        while(c!=0){\n            r = c%n;\n            c = c/n;\n            icount +=1;\n            tNum +=r*pow(10,icount-1);\n//           cout << icount<<endl;\n//            cout <<\""-------\""<< tNum<<endl;\n        }\n\n//    cout << w<<endl;\n\n    return tNum;\n\n}\n\nint W(int x){\n    int icount =0;\n    int i = 1;\n    while(x/i!=0){\n        icount+=1;\n        i *=10;\n    }\n    return  icount;\n}\n\nbool Circle(int a){  //n为a中数字个数\n    int n = W(a);\n    int list[n];\n    for(int i=0;i<n;i++){\n        list[i]=a/(pow(10,n-1-i));\n        a -=list[i]*pow(10,n-1-i);\n    }\n    for(int i=0;i<n;i++)\n        if(list[i]!=list[n-1-i])\n            return 0;\n    return 1;\n}\n\n\nint main(){\n    int n;\n    cin >> n;\n\n    for(int i=1;i<=300;i++){\n        int ans1 = Trans(n,i);\n        int ans2 = pow(ans1,2);\n        if(Circle(ans2))\n            cout << ans1 << \"" \"" << ans2 <<endl;\n    }\n\n\n\n}\n\n\n\n\n",PARTIAL_ACCEPTED,44,512
1277637266808168448,a1e7064b323be6c22b1cc57f30af167085750c33ec47c1123456ba82dffd1a78,2020-06-30 00:17:16,C++,20.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<stdio.h>\n#include<math.h>\n\nusing namespace std;\n\n\n\nstatic int w =0;//表示进制位数\n\n\nint Trans(int n,int x){  //n为进制，x为需要转化的数字\n    int icount =0;\n    int tNum = 0;\n    int r; //余数\n    int c = x; //除数\n    if(x<n){\n        tNum = x;\n        icount +=1;\n    }\n    else\n        while(c!=0){\n            r = c%n;\n            c = c/n;\n            icount +=1;\n            tNum +=r*pow(10,icount-1);\n//           cout << icount<<endl;\n//            cout <<\""-------\""<< tNum<<endl;\n        }\n\n//    cout << w<<endl;\n\n    return tNum;\n\n}\n\nint W(int x){\n    int icount =0;\n    int i = 1;\n    while(x/i!=0){\n        icount+=1;\n        i *=10;\n    }\n    return  icount;\n}\n\nbool Circle(int a){  //n为a中数字个数\n    int n = W(a);\n    int list[n];\n    for(int i=0;i<n;i++){\n        list[i]=a/(pow(10,n-1-i));\n        a -=list[i]*pow(10,n-1-i);\n    }\n    for(int i=0;i<n;i++)\n        if(list[i]!=list[n-1-i])\n            return 0;\n    return 1;\n}\n\n\nint main(){\n    int n;\n    cin >> n;\n\n    for(int i=1;i<=300;i++){\n        int ans1 = Trans(n,i);\n        int ans2 = Trans(n,pow(i,2));\n        if(Circle(ans2))\n            cout << ans1 << \"" \"" << ans2 <<endl;\n    }\n\n\n\n}\n\n\n\n\n",PARTIAL_ACCEPTED,46,512
1277638556791537664,ade1b517dfa96a08a0f2a67900f46bcecd43fb38d16241a43eca73a9c8978778,2020-06-30 00:22:23,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<cstring>\n#include<vector>\nusing namespace std;\nint jinzhi(int x,int y);\nbool huiwen(int x);\nint main()\n{\n    int o;\n    cin>>o;\n\n    for(int i=1;i<=300;i++)\n    {\n\n        if(huiwen(jinzhi(i*i,o))==1)\n        {\n            cout<<jinzhi(i,o)<<\"" \""<<jinzhi(i*i,o)<<endl;\n        }\n        else\n        {\n\n            continue;\n        }\n    }\n\n\n\n\n    return 0;\n}\n\n\nint jinzhi(int x,int y)\n{\n    int d=0;\n    vector<int> a;\n    vector<int>b;\n    while(x>0)\n    {\n\n        d=x%y;\n        x=x/y;\n        a.push_back(d);\n    }\n\n    for(int i=a.size()-1;i>=0;i--)\n    {\n        b.push_back(a[i]);\n    }\n   int q=0;\n    for(int i=0;i<a.size();i++)\n    {\n        q=q*10+b[i];\n    }\n    return q;\n\n}\n\nbool huiwen(int x)\n{\n    int y=0;\n    int k=x;\n    while(k>0)\n    {\n        y=y*10+k%10;\n        k=k/10;\n    }\n\n    if(y==x)\n    {\n        return 1;\n    }\n    else\n    {\n        return 0;\n    }\n\n}\n",COMPILE_ERROR,0,0
1277638577733697536,ade1b517dfa96a08a0f2a67900f46bcecd43fb38d16241a43eca73a9c8978778,2020-06-30 00:22:28,C++,30.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<cstring>\n#include<vector>\nusing namespace std;\nint jinzhi(int x,int y);\nbool huiwen(int x);\nint main()\n{\n    int o;\n    cin>>o;\n\n    for(int i=1;i<=300;i++)\n    {\n\n        if(huiwen(jinzhi(i*i,o))==1)\n        {\n            cout<<jinzhi(i,o)<<\"" \""<<jinzhi(i*i,o)<<endl;\n        }\n        else\n        {\n\n            continue;\n        }\n    }\n\n\n\n\n    return 0;\n}\n\n\nint jinzhi(int x,int y)\n{\n    int d=0;\n    vector<int> a;\n    vector<int>b;\n    while(x>0)\n    {\n\n        d=x%y;\n        x=x/y;\n        a.push_back(d);\n    }\n\n    for(int i=a.size()-1;i>=0;i--)\n    {\n        b.push_back(a[i]);\n    }\n   int q=0;\n    for(int i=0;i<a.size();i++)\n    {\n        q=q*10+b[i];\n    }\n    return q;\n\n}\n\nbool huiwen(int x)\n{\n    int y=0;\n    int k=x;\n    while(k>0)\n    {\n        y=y*10+k%10;\n        k=k/10;\n    }\n\n    if(y==x)\n    {\n        return 1;\n    }\n    else\n    {\n        return 0;\n    }\n\n}\n",PARTIAL_ACCEPTED,42,384
1277638737670897664,ade1b517dfa96a08a0f2a67900f46bcecd43fb38d16241a43eca73a9c8978778,2020-06-30 00:23:07,C++,30.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<cstring>\n#include<vector>\nusing namespace std;\nint jinzhi(int x,int y);\nbool huiwen(int x);\nint main()\n{\n    int o;\n    cin>>o;\n\n    for(int i=1;i<=300;i++)\n    {\n\n        if(huiwen(jinzhi(i*i,o))==1)\n        {\n            cout<<jinzhi(i,o)<<\"" \""<<jinzhi(i*i,o)<<endl;\n        }\n        else\n        {\n\n            continue;\n        }\n    }\n\n\n\n\n    return 0;\n}\n\n\nint jinzhi(int x,int y)\n{\n    int d=0;\n    vector<int> a;\n    vector<int>b;\n    while(x>0)\n    {\n\n        d=x%y;\n        x=x/y;\n        a.push_back(d);\n    }\n\n    for(int i=a.size()-1;i>=0;i--)\n    {\n        b.push_back(a[i]);\n    }\n   int q=0;\n    for(int i=0;i<a.size();i++)\n    {\n        q=q*10+b[i];\n    }\n    return q;\n\n}\n\nbool huiwen(int x)\n{\n    int y=0;\n    int k=x;\n    while(k>0)\n    {\n        y=y*10+k%10;\n        k=k/10;\n    }\n\n    if(y==x)\n    {\n        return 1;\n    }\n    else\n    {\n        return 0;\n    }\n\n}\n",PARTIAL_ACCEPTED,45,424
1277638989903757312,64a5ab3b5dce8f7bdf3da47e4cfc65a9cbd5dfbdfcad825bc89cdd2fa78eb1a3,2020-06-30 00:24:07,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n\nusing namespace std;\nchar res[24];\nint i=0;\nchar tranNumToChar(int n){\n    string s=\""0123456789ABCDEFGHIJ\"";\n    return s[n];\n}\nvoid octToAny(int x,const int B){\n    i=0;\n    while (x!=0) {\n        res[i]=tranNumToChar(x%B);\n        x=x/B;\n        i++;\n    }\n\n}\nbool judgeR(char* s,int i){\n    for(int j=0;j<=i;j++){\n        if(s[j]!=s[i-j-1]) return false;\n    }\n    return true;\n}\nint main()\n{\n    int n;\n    cin >> n;\n    for(int k=1;k<=300;k++){\n        octToAny(k*k,n);\n        if(judgeR(res,i))\n            cout << k << ' ' << res << endl;\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,32,540
1277639052801531904,64a5ab3b5dce8f7bdf3da47e4cfc65a9cbd5dfbdfcad825bc89cdd2fa78eb1a3,2020-06-30 00:24:22,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n\nusing namespace std;\nchar res[24];\nint i=0;\nchar tranNumToChar(int n){\n    string s=\""0123456789ABCDEFGHIJ\"";\n    return s[n];\n}\nvoid octToAny(int x,const int B){\n    i=0;\n    while (x!=0) {\n        res[i]=tranNumToChar(x%B);\n        x=x/B;\n        i++;\n    }\n\n}\nbool judgeR(char* s,int i){\n    for(int j=0;j<=i;j++){\n        if(s[j]!=s[i-j-1]) return false;\n    }\n    return true;\n}\nint main()\n{\n    int n;\n    cin >> n;\n    for(int k=1;k<=300;k++){\n        octToAny(k*k,n);\n        if(judgeR(res,i))\n            cout << k << ' ' << res << endl;\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,25,488
1277640891483742208,654df0a93201e98e36a96b73994627edf5d228d15a7a8d7d87d434a878de21f1,2020-06-30 00:31:40,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <string>\n\nusing namespace std;\n\n\n//转换成目标进制数,注意顺序是反的\nvector<char> transform(int ia,int n, const vector<char> &p) //ia为数， n为进制要求， p为单个数字的表示向量\n{\n    vector<char> p2;\n    //对小于进制的数，直接加进去\n\n    if ((ia/n) == 0)\n    {\n        p2.push_back(p[ia%n]);\n    }\n\n\n    while(ia/n)\n    {\n        p2.push_back(p[ia%n]);\n        ia /= n;\n        if ((ia/n) == 0)\n        {\n            p2.push_back(p[ia%n]);\n        }\n\n    }\n    return p2;\n\n}\n\nvoid cheak(vector<char> &p, vector<char> &c_begin)\n{\n    int flag = 1;\n    int sum = p.size();\n\n    for (int i=0; i<(sum/2); ++i)\n    {\n        if (p[i] != p[sum-1-i])\n        {\n            flag = 0;\n        }\n    }\n\n    //如果是则输出数字\n    if ((flag == 1) || (sum == 1))\n    {\n        //输出原来的数 B进制\n        for (size_t i=0; i<c_begin.size(); ++i)\n        {\n            cout << c_begin[i];\n        }\n\n        cout << \"" \"";\n        //输出它的平方 B进制\n\n        for (int i=0; i<sum; ++i)\n        {\n            cout << p[i];\n        }\n\n        cout << endl;\n\n    }\n}\n\n//检查是否为回文平方数\n\nint main()\n{\n    vector<char> the_char{'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\n    int n = 0; //读入要求的进制\n    //\n\n\n\n\n\n    //\n    cin >> n;\n    for (int i=1; i<301; ++i){\n        vector<char> v1 = transform(i*i,n,the_char);  //得到对应进制的数\n        vector<char> v2 = transform(i,n,the_char);\n        cheak(v1,v2);\n    }\n\n    return 0;\n\n}\n",PARTIAL_ACCEPTED,40,512
1277641416136654848,64a5ab3b5dce8f7bdf3da47e4cfc65a9cbd5dfbdfcad825bc89cdd2fa78eb1a3,2020-06-30 00:33:45,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n\nusing namespace std;\nchar res[24];\nchar k2[24];\nint i=0;\nint i2=0;\nchar tranNumToChar(int n){\n    string s=\""0123456789ABCDEFGHIJ\"";\n    return s[n];\n}\nvoid octToAny(int x,const int B){\n    i=0;\n    while (x!=0) {\n        res[i]=tranNumToChar(x%B);\n        x=x/B;\n        i++;\n    }\n}\nvoid octToAny2(int x,const int B){\n    i2=0;\n    while (x!=0) {\n        k2[i2]=tranNumToChar(x%B);\n        x=x/B;\n        i2++;\n    }\n}\nbool judgeR(char* s,int i){\n    for(int j=0;j<=i;j++){\n        if(s[j]!=s[i-j-1]) return false;\n    }\n    return true;\n}\nint main()\n{\n    int n;\n    cin >> n;\n    for(int k=1;k<=300;k++){\n        octToAny(k*k,n);\n        octToAny2(k,n);\n        if(judgeR(res,i))\n            cout << k2 << ' ' << res << endl;\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,31,504
1277641570696757248,654df0a93201e98e36a96b73994627edf5d228d15a7a8d7d87d434a878de21f1,2020-06-30 00:34:22,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <string>\n\nusing namespace std;\n\n\n//转换成目标进制数,注意顺序是反的\nvector<char> transform(int ia,int n, const vector<char> &p) //ia为数， n为进制要求， p为单个数字的表示向量\n{\n    vector<char> p2;\n    //对小于进制的数，直接加进去\n\n    if ((ia/n) == 0)\n    {\n        p2.push_back(p[ia%n]);\n    }\n\n\n    while(ia/n)\n    {\n        p2.push_back(p[ia%n]);\n        ia /= n;\n        if ((ia/n) == 0)\n        {\n            p2.push_back(p[ia%n]);\n        }\n\n    }\n    return p2;\n\n}\n\nvoid cheak(vector<char> &p, vector<char> &c_begin)\n{\n    int flag = 1;\n    int sum = p.size();\n\n    for (int i=0; i<(sum/2); ++i)\n    {\n        if (p[i] != p[sum-1-i])\n        {\n            flag = 0;\n        }\n    }\n\n    //如果是则输出数字\n    if ((flag == 1) || (sum == 1))\n    {\n        //输出原来的数 B进制  注意向量里面顺序是反的\n        for (size_t i=c_begin.size()-1; i>=0; --i)\n        {\n            cout << c_begin[i];\n        }\n\n        cout << \"" \"";\n        //输出它的平方 B进制\n\n        for (int i=0; i<sum; ++i)\n        {\n            cout << p[i];\n        }\n\n        cout << endl;\n\n    }\n}\n\n//检查是否为回文平方数\n\nint main()\n{\n    vector<char> the_char{'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\n    int n = 0; //读入要求的进制\n    //\n\n\n\n\n\n    //\n    cin >> n;\n    for (int i=1; i<301; ++i){\n        vector<char> v1 = transform(i*i,n,the_char);  //得到对应进制的数\n        vector<char> v2 = transform(i,n,the_char);\n        cheak(v1,v2);\n    }\n\n    return 0;\n\n}\n",SEGMENTATION_FAULT,62,512
1277642038097403904,fdbca684c22ef228dd6668184c911846287860d1733104734c3d0653a3d045cc,2020-06-30 00:36:13,Python,40.0,1277062760129622023,1267442030214471680,1049226397448056832,"def Palindrome_number(a):\n  if (a == a[::-1]):\n    return 1\n  else:\n    return 0\n\ndef radix_change(a, b):\n  if a==0:\n    return \""\""\n  else:\n    return radix_change(a//b, b)+str((a%b))\n\nlist1 = []\nlist2 = []\nradix = input()\nfor i in range (1, 301):\n  string = radix_change(i*i, int(radix))\n  if Palindrome_number(string):\n    list1.append(radix_change(i, int(radix)))\n    list2.append(string)\n\nfor j in range (len(list1)):\n  print(list1[j],list2[j])",PARTIAL_ACCEPTED,163,3044
1277642285016088576,b397c8d5c61c579f9119702429ff8aed90b9ce9a41bb4874d620818da993e1b0,2020-06-30 00:37:12,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nchar c[] = {'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\n\nint len = 0;\nchar num[100];\nbool check(int b, int x)\n{\n\tlen = 0;\n\twhile(x != 0)\n\t{\n\t\tnum[len] = c[x%b];\n\t\tlen++;\n\t\tx /= b;\n\t}\n\tint p1 = 0;\n\tint p2 = len-1;\n\twhile(p1 < p2)\n\t{\n\t\tif(num[p1] != num[p2])\n\t\t\treturn false;\n\t\tp1++;\n\t\tp2--;\n\t}\n\treturn true;\n}\n\nint n, s;\n\nint main()\n{\n\tcin >> n >> s;\n\twhile(n > 0)\n\t{\n\t\tint cnt = 0;\n\t\tfor(int i = 2; i <= 10; i++)\n\t\t{\n\t\t\tif(check(i, s+1))\n\t\t\t\tcnt++;\n\t\t\tif(cnt == 2)\n\t\t\t{\n\t\t\t\tcout << s+1 << endl;\n\t\t\t\tn--;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\ts++;\n\t}\n\t\n\treturn 0;\n}",ACCEPTED,19,424
1277642556102336512,64a5ab3b5dce8f7bdf3da47e4cfc65a9cbd5dfbdfcad825bc89cdd2fa78eb1a3,2020-06-30 00:38:17,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n\nusing namespace std;\nchar res[24];\nchar k2[24];\nchar k3[24];\nint i=0;\nint i2=0;\nchar tranNumToChar(int n){\n    string s=\""0123456789ABCDEFGHIJ\"";\n    return s[n];\n}\nvoid octToAny(int x,const int B){\n    i=0;\n    while (x!=0) {\n        res[i]=tranNumToChar(x%B);\n        x=x/B;\n        i++;\n    }\n}\nvoid octToAny2(int x,const int B){\n    i2=0;\n    while (x!=0) {\n        k2[i2]=tranNumToChar(x%B);\n        x=x/B;\n        i2++;\n    }\n}\nvoid reverseK2(){\n    for(int p=0;p<i2;p++){\n        k3[p]=k2[i2-p-1];\n    }\n}\nbool judgeR(char* s,int i){\n    for(int j=0;j<=i;j++){\n        if(s[j]!=s[i-j-1]) return false;\n    }\n    return true;\n}\nint main()\n{\n    int n;\n    cin >> n;\n    for(int k=1;k<=300;k++){\n        octToAny(k*k,n);\n        octToAny2(k,n);\n        reverseK2();\n        if(judgeR(res,i))\n            cout << k3 << ' ' << res << endl;\n    }\n    return 0;\n}",ACCEPTED,38,412
1277643976213979136,654df0a93201e98e36a96b73994627edf5d228d15a7a8d7d87d434a878de21f1,2020-06-30 00:43:56,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <string>\n\nusing namespace std;\n\n\n//转换成目标进制数,注意顺序是反的\nvector<char> transform(int ia,int n, const vector<char> &p) //ia为数， n为进制要求， p为单个数字的表示向量\n{\n    vector<char> p2;\n    //对小于进制的数，直接加进去\n\n    if ((ia/n) == 0)\n    {\n        p2.push_back(p[ia%n]);\n    }\n\n\n    while(ia/n)\n    {\n        p2.push_back(p[ia%n]);\n        ia /= n;\n        if ((ia/n) == 0)\n        {\n            p2.push_back(p[ia%n]);\n        }\n\n    }\n    return p2;\n\n}\n\nvoid cheak(vector<char> &p, vector<char> &c_begin)\n{\n    int flag = 1;\n    int sum = p.size();\n\n    for (int i=0; i<(sum/2); ++i)\n    {\n        if (p[i] != p[sum-1-i])\n        {\n            flag = 0;\n        }\n    }\n\n    //如果是则输出数字\n    int temp = c_begin.size();  //原值长度\n    if ((flag == 1) || (sum == 1))\n    {\n        //输出原来的数 B进制  注意向量里面顺序是反的\n        for (size_t i=0; i<c_begin.size(); ++i)\n        {\n            cout << c_begin[temp-1-i];\n        }\n\n        cout << \"" \"";\n        //输出它的平方 B进制\n\n        for (int i=0; i<sum; ++i)\n        {\n            cout << p[i];\n        }\n\n        cout << endl;\n\n    }\n}\n\n//检查是否为回文平方数\n\nint main()\n{\n    vector<char> the_char{'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\n    int n = 0; //读入要求的进制\n    //\n\n\n\n\n\n    //\n    cin >> n;\n    for (int i=1; i<301; ++i){\n        vector<char> v1 = transform(i*i,n,the_char);  //得到对应进制的数\n        vector<char> v2 = transform(i,n,the_char);\n        cheak(v1,v2);\n    }\n\n    return 0;\n\n}\n",ACCEPTED,40,512
1277645520867098624,fdbca684c22ef228dd6668184c911846287860d1733104734c3d0653a3d045cc,2020-06-30 00:50:04,Python,40.0,1277062760129622023,1267442030214471680,1049226397448056832,"def Palindrome_number(a):\n  if (a == a[::-1]):\n    return 1\n  else:\n    return 0\n\ndef radix_change(a, b):\n  if b <= 10:\n    if a == 0:\n      return \""\""\n    else:\n      return radix_change(a//b, b)+str((a%b))\n  else:\n    temp1 = ['0','1','2','3','4','5','6','7','8','9','A','b','C','D','E','F','G','H','I','J']\n    temp2  = []\n    while True:\n      m = a//b  \n      n = a%b \n      temp2.append(n)\n      if m == 0:\n        break\n      a = m\n    temp2.reverse()\n    string_temp = \""\""\n    for i in temp2:\n      sting_temp += temp1[i]\n    return string_temp\n\nlist1 = []\nlist2 = []\nradix = input()\nfor i in range (1, 301):\n  string = radix_change(i*i, int(radix))\n  if Palindrome_number(string):\n    list1.append(radix_change(i, int(radix)))\n    list2.append(string)\n\nfor j in range (len(list1)):\n  print(list1[j],list2[j])",PARTIAL_ACCEPTED,193,3112
1277648255687524352,fdbca684c22ef228dd6668184c911846287860d1733104734c3d0653a3d045cc,2020-06-30 01:00:56,Python,60.0,1277062760129622023,1267442030214471680,1049226397448056832,"def Palindrome_number(a):\n  if (a == a[::-1]):\n    return 1\n  else:\n    return 0\n\ndef radix_change(a, b):\n  if b <= 10:\n    if a == 0:\n      return \""\""\n    else:\n      return radix_change(a//b, b)+str((a%b))\n  else:\n    temp1 = ['0','1','2','3','4','5','6','7','8','9','A','b','C','D','E','F','G','H','I','J']\n    temp2 = []\n    while (a!=0):  \n      n = a%b \n      temp2.append(n)\n      a = a//b\n    temp2.reverse()\n    string_temp = \""\""\n    for i in temp2:\n      string_temp += temp1[i]\n    return string_temp\n\nlist1 = []\nlist2 = []\nradix = input()\nfor i in range (1, 301):\n  string1 = radix_change(i*i, int(radix))\n  if Palindrome_number(string1):\n    list1.append(radix_change(i, int(radix)))\n    list2.append(string1)\n\nfor j in range (len(list1)):\n  print(list1[j],list2[j])",PARTIAL_ACCEPTED,204,3172
1277648464886824960,fdbca684c22ef228dd6668184c911846287860d1733104734c3d0653a3d045cc,2020-06-30 01:01:46,Python,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"def Palindrome_number(a):\n  if (a == a[::-1]):\n    return 1\n  else:\n    return 0\n\ndef radix_change(a, b):\n  if b <= 10:\n    if a == 0:\n      return \""\""\n    else:\n      return radix_change(a//b, b)+str((a%b))\n  else:\n    temp1 = ['0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J']\n    temp2 = []\n    while (a!=0):  \n      n = a%b \n      temp2.append(n)\n      a = a//b\n    temp2.reverse()\n    string_temp = \""\""\n    for i in temp2:\n      string_temp += temp1[i]\n    return string_temp\n\nlist1 = []\nlist2 = []\nradix = input()\nfor i in range (1, 301):\n  string1 = radix_change(i*i, int(radix))\n  if Palindrome_number(string1):\n    list1.append(radix_change(i, int(radix)))\n    list2.append(string1)\n\nfor j in range (len(list1)):\n  print(list1[j],list2[j])",ACCEPTED,185,3200
1277648676854358016,fdbca684c22ef228dd6668184c911846287860d1733104734c3d0653a3d045cc,2020-06-30 01:02:36,Python,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"def Palindrome_number(a):\n  if (a == a[::-1]):\n    return 1\n  else:\n    return 0\n\ndef radix_change(a, b):\n  temp1 = ['0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J']\n  temp2 = []\n  while (a!=0):  \n    n = a%b \n    temp2.append(n)\n    a = a//b\n  temp2.reverse()\n  string_temp = \""\""\n  for i in temp2:\n    string_temp += temp1[i]\n  return string_temp\n\nlist1 = []\nlist2 = []\nradix = input()\nfor i in range (1, 301):\n  string1 = radix_change(i*i, int(radix))\n  if Palindrome_number(string1):\n    list1.append(radix_change(i, int(radix)))\n    list2.append(string1)\n\nfor j in range (len(list1)):\n  print(list1[j],list2[j])",ACCEPTED,189,3072
1277649231135834112,41699c0be4c0d025cbee34bd00363886b1214bbf592427e128884b0ee45b9562,2020-06-30 01:04:48,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nint convert(int x,int n){\n    int i {},k {},m = x*x,xx[50],kk[50];\n    int flag = 0;\n    //求商取余法\n    while(x!=0){\n        xx[i++]=x%n;\n        x=x/n;      //x的n进制数的反序\n    }\n    while(m!=0){\n        kk[k++]=m%n;\n        m=m/n;     //m的n进制数的反序\n    }\n    //寻找平方回文数\n    for(int j=0;j<k/2;j++){\n        if(kk[j]==kk[k-1-j])\n            flag=1;\n    }\n    if (flag==1){\n        //反序输出\n        for(int j=i-1;i>0;j--)\n            cout << xx[j];\n        cout << xx[0] << \"" \"";\n        for(int j=0;j<i-1;j++)\n            cout << kk[j];\n        cout << kk[i-1] << endl;\n    }\n}\nint main(){\n    int n,i {};\n    cin >> n;\n    for(i=1;i<=300;i++)\n        convert(i,n);\n    return 0;\n}\n",SEGMENTATION_FAULT,49,424
1277649252539367424,41699c0be4c0d025cbee34bd00363886b1214bbf592427e128884b0ee45b9562,2020-06-30 01:04:54,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nint convert(int x,int n){\n    int i {},k {},m = x*x,xx[50],kk[50];\n    int flag = 0;\n    //求商取余法\n    while(x!=0){\n        xx[i++]=x%n;\n        x=x/n;      //x的n进制数的反序\n    }\n    while(m!=0){\n        kk[k++]=m%n;\n        m=m/n;     //m的n进制数的反序\n    }\n    //寻找平方回文数\n    for(int j=0;j<k/2;j++){\n        if(kk[j]==kk[k-1-j])\n            flag=1;\n    }\n    if (flag==1){\n        //反序输出\n        for(int j=i-1;i>0;j--)\n            cout << xx[j];\n        cout << xx[0] << \"" \"";\n        for(int j=0;j<i-1;j++)\n            cout << kk[j];\n        cout << kk[i-1] << endl;\n    }\n}\nint main(){\n    int n,i {};\n    cin >> n;\n    for(i=1;i<=300;i++)\n        convert(i,n);\n    return 0;\n}\n",SEGMENTATION_FAULT,56,492
1277649290040639488,41699c0be4c0d025cbee34bd00363886b1214bbf592427e128884b0ee45b9562,2020-06-30 01:05:02,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nint convert(int x,int n){\n    int i {},k {},m = x*x,xx[50],kk[50];\n    int flag = 0;\n    //求商取余法\n    while(x!=0){\n        xx[i++]=x%n;\n        x=x/n;      //x的n进制数的反序\n    }\n    while(m!=0){\n        kk[k++]=m%n;\n        m=m/n;     //m的n进制数的反序\n    }\n    //寻找平方回文数\n    for(int j=0;j<k/2;j++){\n        if(kk[j]==kk[k-1-j])\n            flag=1;\n    }\n    if (flag==1){\n        //反序输出\n        for(int j=i-1;i>0;j--)\n            cout << xx[j];\n        cout << xx[0] << \"" \"";\n        for(int j=0;j<i-1;j++)\n            cout << kk[j];\n        cout << kk[i-1] << endl;\n    }\n}\nint main(){\n    int n,i {};\n    cin >> n;\n    for(i=1;i<=300;i++)\n        convert(i,n);\n    return 0;\n}\n",SEGMENTATION_FAULT,50,512
1277649368637693952,41699c0be4c0d025cbee34bd00363886b1214bbf592427e128884b0ee45b9562,2020-06-30 01:05:21,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nint convert(int x,int n){\n    int i {},k {},m = x*x,xx[80],kk[80];\n    int flag = 0;\n    //求商取余法\n    while(x!=0){\n        xx[i++]=x%n;\n        x=x/n;      //x的n进制数的反序\n    }\n    while(m!=0){\n        kk[k++]=m%n;\n        m=m/n;     //m的n进制数的反序\n    }\n    //寻找平方回文数\n    for(int j=0;j<k/2;j++){\n        if(kk[j]==kk[k-1-j])\n            flag=1;\n    }\n    if (flag==1){\n        //反序输出\n        for(int j=i-1;i>0;j--)\n            cout << xx[j];\n        cout << xx[0] << \"" \"";\n        for(int j=0;j<i-1;j++)\n            cout << kk[j];\n        cout << kk[i-1] << endl;\n    }\n}\nint main(){\n    int n,i {};\n    cin >> n;\n    for(i=1;i<=300;i++)\n        convert(i,n);\n    return 0;\n}\n",SEGMENTATION_FAULT,56,552
1277649436988080128,41699c0be4c0d025cbee34bd00363886b1214bbf592427e128884b0ee45b9562,2020-06-30 01:05:38,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nint convert(int x,int n){\n    int i {},k {},m = x*x,xx[100],kk[100];\n    int flag = 0;\n    //求商取余法\n    while(x!=0){\n        xx[i++]=x%n;\n        x=x/n;      //x的n进制数的反序\n    }\n    while(m!=0){\n        kk[k++]=m%n;\n        m=m/n;     //m的n进制数的反序\n    }\n    //寻找平方回文数\n    for(int j=0;j<k/2;j++){\n        if(kk[j]==kk[k-1-j])\n            flag=1;\n    }\n    if (flag==1){\n        //反序输出\n        for(int j=i-1;i>0;j--)\n            cout << xx[j];\n        cout << xx[0] << \"" \"";\n        for(int j=0;j<i-1;j++)\n            cout << kk[j];\n        cout << kk[i-1] << endl;\n    }\n}\nint main(){\n    int n,i {};\n    cin >> n;\n    for(i=1;i<=300;i++)\n        convert(i,n);\n    return 0;\n}\n",SEGMENTATION_FAULT,56,424
1277649641724641280,41699c0be4c0d025cbee34bd00363886b1214bbf592427e128884b0ee45b9562,2020-06-30 01:06:26,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nint convert(int x,int n){\n    int i {},k {},m = x*x,xx[100],kk[100];\n    int flag = 0;\n    //求商取余法\n    while(x!=0){\n        xx[i++]=x%n;\n        x=x/n;      //x的n进制数的反序\n    }\n    while(m!=0){\n        kk[k++]=m%n;\n        m=m/n;     //m的n进制数的反序\n    }\n    //寻找平方回文数\n    for(int j=0;j<k/2;j++){\n        if(kk[j]==kk[k-1-j])\n            flag=1;\n    }\n    if (flag==1){\n        //反序输出\n        for(int j=i-1;i>0;j--)\n            cout << xx[j];\n        cout << xx[0] << \"" \"";\n        for(int j=0;j<i-1;j++)\n            cout << kk[j];\n        cout << kk[i-1] << endl;\n    }\n}\nint main(){\n    int n,i {};\n    cin >> n;\n    for(i=1;i<=300;i++)\n        convert(i,n);\n    return 0;\n}\n",SEGMENTATION_FAULT,64,528
1277649728051806208,41699c0be4c0d025cbee34bd00363886b1214bbf592427e128884b0ee45b9562,2020-06-30 01:06:47,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nint convert(int x,int n){\n    int i {},k {},m = x*x,xx[1000],kk[1000];\n    int flag = 0;\n    //求商取余法\n    while(x!=0){\n        xx[i++]=x%n;\n        x=x/n;      //x的n进制数的反序\n    }\n    while(m!=0){\n        kk[k++]=m%n;\n        m=m/n;     //m的n进制数的反序\n    }\n    //寻找平方回文数\n    for(int j=0;j<k/2;j++){\n        if(kk[j]==kk[k-1-j])\n            flag=1;\n    }\n    if (flag==1){\n        //反序输出\n        for(int j=i-1;i>0;j--)\n            cout << xx[j];\n        cout << xx[0] << \"" \"";\n        for(int j=0;j<i-1;j++)\n            cout << kk[j];\n        cout << kk[i-1] << endl;\n    }\n}\nint main(){\n    int n,i {};\n    cin >> n;\n    for(i=1;i<=300;i++)\n        convert(i,n);\n    return 0;\n}\n",SEGMENTATION_FAULT,63,484
1277649758569562112,41699c0be4c0d025cbee34bd00363886b1214bbf592427e128884b0ee45b9562,2020-06-30 01:06:54,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nint convert(int x,int n){\n    int i {},k {},m = x*x,xx[10000],kk[10000];\n    int flag = 0;\n    //求商取余法\n    while(x!=0){\n        xx[i++]=x%n;\n        x=x/n;      //x的n进制数的反序\n    }\n    while(m!=0){\n        kk[k++]=m%n;\n        m=m/n;     //m的n进制数的反序\n    }\n    //寻找平方回文数\n    for(int j=0;j<k/2;j++){\n        if(kk[j]==kk[k-1-j])\n            flag=1;\n    }\n    if (flag==1){\n        //反序输出\n        for(int j=i-1;i>0;j--)\n            cout << xx[j];\n        cout << xx[0] << \"" \"";\n        for(int j=0;j<i-1;j++)\n            cout << kk[j];\n        cout << kk[i-1] << endl;\n    }\n}\nint main(){\n    int n,i {};\n    cin >> n;\n    for(i=1;i<=300;i++)\n        convert(i,n);\n    return 0;\n}\n",SEGMENTATION_FAULT,40,484
1277650559593537536,41699c0be4c0d025cbee34bd00363886b1214bbf592427e128884b0ee45b9562,2020-06-30 01:10:05,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nvoid convert(int x,int n){\n    int i {},k {},m = x*x,xx[50],kk[50];\n    int flag = 0;\n    //求商取余法\n    while(x!=0){\n        xx[i++]=x%n;\n        x=x/n;      //x的n进制数的反序\n    }\n    while(m!=0){\n        kk[k++]=m%n;\n        m=m/n;     //m的n进制数的反序\n    }\n    //寻找平方回文数\n    for(int j=0;j<k/2;j++){\n        if(kk[j]==kk[k-1-j])\n            flag=1;\n    }\n    if (flag==1){\n        //反序输出\n        for(int j=i-1;j>0;j--)\n            cout << xx[j];\n        cout << xx[0] << \"" \"";\n        for(int j=0;j<k-1;j++)\n            cout << kk[j];\n        cout << kk[k-1] << endl;\n    }\n}\nint main(){\n    int n,i {};\n    cin >> n;\n    for(i=1;i<=300;i++)\n        convert(i,n);\n    return 0;\n}\n",WRONG_ANSWER,42,424
1277650859679211520,41699c0be4c0d025cbee34bd00363886b1214bbf592427e128884b0ee45b9562,2020-06-30 01:11:17,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nvoid convert(int x,int n){\n    int i {},k {},m = x*x,xx[50],kk[50];\n    int flag = 0;\n    //求商取余法\n    while(x!=0){\n        xx[i++]=x%n;\n        x=x/n;      //x的n进制数的反序\n    }\n    while(m!=0){\n        kk[k++]=m%n;\n        m=m/n;     //m的n进制数的反序\n    }\n    //寻找平方回文数\n    for(int j=0;j<k/2;j++){\n        if(kk[j]!=kk[k-1-j])\n            flag=1;\n    }\n    if (flag!=1){\n        //反序输出\n        for(int j=i-1;j>0;j--)\n            cout << xx[j];\n        cout << xx[0] << \"" \"";\n        for(int j=0;j<k-1;j++)\n            cout << kk[j];\n        cout << kk[k-1] << endl;\n    }\n}\nint main(){\n    int n,i {};\n    cin >> n;\n    for(i=1;i<=300;i++)\n        convert(i,n);\n    return 0;\n}\n\n",PARTIAL_ACCEPTED,34,424
1277650886862503936,41699c0be4c0d025cbee34bd00363886b1214bbf592427e128884b0ee45b9562,2020-06-30 01:11:23,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nvoid convert(int x,int n){\n    int i {},k {},m = x*x,xx[50],kk[50];\n    int flag = 0;\n    //求商取余法\n    while(x!=0){\n        xx[i++]=x%n;\n        x=x/n;      //x的n进制数的反序\n    }\n    while(m!=0){\n        kk[k++]=m%n;\n        m=m/n;     //m的n进制数的反序\n    }\n    //寻找平方回文数\n    for(int j=0;j<k/2;j++){\n        if(kk[j]!=kk[k-1-j])\n            flag=1;\n    }\n    if (flag!=1){\n        //反序输出\n        for(int j=i-1;j>0;j--)\n            cout << xx[j];\n        cout << xx[0] << \"" \"";\n        for(int j=0;j<k-1;j++)\n            cout << kk[j];\n        cout << kk[k-1] << endl;\n    }\n}\nint main(){\n    int n,i {};\n    cin >> n;\n    for(i=1;i<=300;i++)\n        convert(i,n);\n    return 0;\n}\n\n",PARTIAL_ACCEPTED,40,512
1277651073886511104,41699c0be4c0d025cbee34bd00363886b1214bbf592427e128884b0ee45b9562,2020-06-30 01:12:08,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nvoid convert(int x,int n){\n    int i {},k {},m = x*x,xx[50],kk[50];\n    int flag = 0;\n    //求商取余法\n    while(x!=0){\n        xx[i++]=x%n;\n        x=x/n;      //x的n进制数的反序\n    }\n    while(m!=0){\n        kk[k++]=m%n;\n        m=m/n;     //m的n进制数的反序\n    }\n    //寻找平方回文数\n    for(int j=0;j<k/2;j++){\n        if(kk[j]!=kk[k-1-j])\n            flag=1;\n    }\n    if (flag!=1){\n        //反序输出\n        for(int j=i-1;j>0;j--)\n            cout << xx[j];\n        cout << xx[0] << \"" \"";\n        for(int j=0;j<k-1;j++)\n            cout << kk[j];\n        cout << kk[k-1] << endl;\n    }\n}\nint main(){\n    int n,i {};\n    cin >> n;\n    for(i=1;i<=300;i++)\n        convert(i,n);\n    return 0;\n}\n\n",PARTIAL_ACCEPTED,33,452
1277652555478261760,41699c0be4c0d025cbee34bd00363886b1214bbf592427e128884b0ee45b9562,2020-06-30 01:18:01,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nvoid convert(int x,int n){\n    int i {},k {},m = x*x,xx[50],kk[50];\n    \n    int flag = 0;\n    //求商取余法\n    while(x!=0){\n        xx[i++]=x%n;\n        x=x/n;      //x的n进制数的反序\n    }\n    while(m!=0){\n        kk[k++]=m%n;\n        m=m/n;     //m的n进制数的反序\n    }\n    //寻找平方回文数\n    for(int j=0;j<k/2;j++){\n        if(kk[j]!=kk[k-1-j])\n            flag=1;\n    }\n    if (flag!=1){\n        //反序输出\n        for(int j=i-1;j>0;j--){\n            if (xx[j]<10)\n                cout << xx[j];\n            else\n                cout << char(xx[j]+54);\n        }\n        cout << xx[0] << \"" \"";\n        for(int j=0;j<k-1;j++){\n            if(kk[j]<10)\n                cout << kk[j];\n            else\n                cout << char(kk[j]+54);\n        }\n        cout << kk[k-1] << endl;\n        }\n    }\n\nint main(){\n    int n,i {};\n    cin >> n;\n    for(i=1;i<=300;i++)\n        convert(i,n);\n    return 0;\n}\n",PARTIAL_ACCEPTED,42,512
1277653022107164672,41699c0be4c0d025cbee34bd00363886b1214bbf592427e128884b0ee45b9562,2020-06-30 01:19:52,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nvoid convert(int x,int n){\n    int i {},k {},m = x*x,xx[50],kk[50];\n\n    int flag = 0;\n    //求商取余法\n    while(x!=0){\n        xx[i++]=x%n;\n        x=x/n;      //x的n进制数的反序\n    }\n    while(m!=0){\n        kk[k++]=m%n;\n        m=m/n;     //m的n进制数的反序\n    }\n    //寻找平方回文数\n    for(int j=0;j<k/2;j++){\n        if(kk[j]!=kk[k-1-j])\n            flag=1;\n    }\n    if (flag!=1){\n        //反序输出\n        for(int j=i-1;j>0;j--){\n            if (xx[j]<10)\n                cout << xx[j];\n            else\n                cout << char(xx[j]+55);\n        }\n        cout << xx[0] << \"" \"";\n        for(int j=0;j<k-1;j++){\n            if(kk[j]<10)\n                cout << kk[j];\n            else\n                cout << char(kk[j]+55);\n        }\n        cout << kk[k-1] << endl;\n        }\n    }\n\nint main(){\n    int n,i {};\n    cin >> n;\n    for(i=1;i<=300;i++)\n        convert(i,n);\n    return 0;\n}\n",PARTIAL_ACCEPTED,41,512
1277653667732193280,41699c0be4c0d025cbee34bd00363886b1214bbf592427e128884b0ee45b9562,2020-06-30 01:22:26,C++,60.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nvoid convert(int x,int n){\n    int i {},k {},m = x*x,xx[50],kk[50];\n\n    int flag = 0;\n    //求商取余法\n    while(x!=0){\n        xx[i++]=x%n;\n        x=x/n;      //x的n进制数的反序\n    }\n    while(m!=0){\n        kk[k++]=m%n;\n        m=m/n;     //m的n进制数的反序\n    }\n    //寻找平方回文数\n    for(int j=0;j<k/2;j++){\n        if(kk[j]!=kk[k-1-j])\n            flag=1;\n    }\n    if (flag!=1){\n        //反序输出\n        for(int j=i-1;j>0;j--){\n            if (xx[j]<10)\n                cout << xx[j];\n            else\n                cout << char(xx[j]+55);\n        }\n        if (xx[0]<n and xx[0]<10)\n            cout << xx[0] << \"" \"";\n        else\n            cout << char(xx[0]+55) << \"" \"";\n        for(int j=0;j<k-1;j++){\n            if(kk[j]<10)\n                cout << kk[j];\n            else\n                cout << char(kk[j]+55);\n        }\n        cout << kk[k-1] << endl;\n        }\n    }\n\nint main(){\n    int n,i {};\n    cin >> n;\n    for(i=1;i<=300;i++)\n        convert(i,n);\n    return 0;\n}\n",PARTIAL_ACCEPTED,27,424
1277654086344695808,41699c0be4c0d025cbee34bd00363886b1214bbf592427e128884b0ee45b9562,2020-06-30 01:24:06,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nvoid convert(int x,int n){\n    int i {},k {},m = x*x,xx[50],kk[50];\n\n    int flag = 0;\n    //求商取余法\n    while(x!=0){\n        xx[i++]=x%n;\n        x=x/n;      //x的n进制数的反序\n    }\n    while(m!=0){\n        kk[k++]=m%n;\n        m=m/n;     //m的n进制数的反序\n    }\n    //寻找平方回文数\n    for(int j=0;j<k/2;j++){\n        if(kk[j]!=kk[k-1-j])\n            flag=1;\n    }\n    if (flag!=1){\n        //反序输出\n        for(int j=i-1;j>0;j--){\n            if (xx[j]<10)\n                cout << xx[j];\n            else\n                cout << char(xx[j]+55);\n        }\n        if (xx[0]<n and xx[0]<10)\n            cout << xx[0] << \"" \"";\n        else\n            cout << char(xx[0]+55) << \"" \"";\n        for(int j=0;j<k-1;j++){\n            if(kk[j]<10)\n                cout << kk[j];\n            else\n                cout << char(kk[j]+55);\n        }\n        if (kk[k-1]<n and kk[k-1] <10)\n            cout << kk[k-1] << endl;\n        else\n            cout << char(kk[k-1]+55) << endl;\n        }\n    }\n\nint main(){\n    int n,i {};\n    cin >> n;\n    for(i=1;i<=300;i++)\n        convert(i,n);\n    return 0;\n}\n",ACCEPTED,31,484
1277656796938821632,01de1d888fba23176b55e81b10bdf1a9116d73f7d69d55036a108a5d0efaa94e,2020-06-30 01:34:52,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<cstdio>\n#include<iostream>\n#include<string>\n#include<map>\n#include<algorithm>\nusing namespace std;\nconst char s[]=\""0123456789ABCDEFGHIJ\"";\nint i,b;\nvoid p(int x)\n{\n\tstring s2=\""\"";\n\tfor(int t=x*x;t;t/=b) s2=s[t%b]+s2;\n\tint l=s2.length();\n\tfor(int i=0;i*2<l;i++) if(s2[i]!=s2[l-i-1]) return;\n\tstring s1=\""\"";\n\tfor(int t=x;t;t/=b) s1=s[t%b]+s1;\n\tcout<<s1<<' '<<s2<<endl; \n}\nint main()\n{\n\tcin>>b;\n\tfor(i=1;i<=300;i++)\tp(i);\n\treturn 0;\n}",ACCEPTED,40,424
1277658912164077568,41699c0be4c0d025cbee34bd00363886b1214bbf592427e128884b0ee45b9562,2020-06-30 01:43:17,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nint count = 0;\nint seek=0;\nint seekbefore=0;\nvoid convert(int x,int n){\n    int i {},k {},xx[50];\n    int flag = 0;\n    //求商取余法\n    while(x!=0){\n       xx[i++]=x%n;\n       x=x/n;      //x的n进制数的反序\n    }\n    for(int j=0;j<i/2;i++){\n        if(xx[j]==xx[i-j-1]){\n            count +=1;\n            if(count==2){\n                if (seek==2)\n                    cout << x ;\n                else\n                    cout << x << endl;\n                seek += 1;\n                count = 0;\n            }\n\n         }\n    }\n\n}\nint main(){\n    int n,number;\n    cin >> n >> number;\n    while(seek==3){\n        n+=1;\n        for(int j=0;j<=10;j++){\n            convert(n,j);\n            if(seek!=seekbefore)\n                break;\n        }\n\n    }\n\n}\n",WRONG_ANSWER,24,512
1277659133103243264,01de1d888fba23176b55e81b10bdf1a9116d73f7d69d55036a108a5d0efaa94e,2020-06-30 01:44:09,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<cstdio>\n#include<iostream>\n#include<string>\n#include<map>\n#include<algorithm>\nusing namespace std;\nconst char s[]=\""0123456789ABCDEFGHIJ\"";\nint n,k,i,b;\ninline bool p(int x)\n{\n\tstring s2=\""\"";\n\tfor(int t=x;t;t/=b) s2=s[t%b]+s2;\n\tint l=s2.length();\n\tfor(int i=0;i*2<l;i++) if(s2[i]!=s2[l-i-1]) return false;\n\treturn true;\n}\nint main()\n{\n\tcin>>n>>k;\n\tfor(;n--;)\n\t\tfor(;++k;)\n\t\t{\n\t\t\tint f=2;\n\t\t\tfor(b=2;f&&b<=10;b++)\n\t\t\t\tif(p(k)) f--;\n\t\t\tif(!f) {cout<<k<<endl;break;}\n\t\t}\n\treturn 0;\n}",ACCEPTED,35,424
1277662195951796224,41699c0be4c0d025cbee34bd00363886b1214bbf592427e128884b0ee45b9562,2020-06-30 01:56:19,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nint count = 0;\nint seek=0;\nint seekbefore=0;\nvoid convert(int x,int n){\n    int i {},k=x,xx[50];\n    int flag = 0;\n    //求商取余法\n    while(x!=0){\n       xx[i++]=x%n;\n       x=x/n;      //x的n进制数的反序\n    }\n    for(int j=0;j<i/2;i++){\n        if(xx[j]!=xx[i-j-1]){\n            flag = 1;\n        }\n    if(flag==0){\n            count +=1;\n            if(count==2){\n                if (seek==2)\n                    cout << k ;\n                else\n                    cout << k << endl;\n                seek += 1;\n                count = 0;\n            }\n        }\n\n     }\n}\nint main(){\n    int n,number;\n    scanf(\""%d %d\"",&n,&number);\n    while(seek!=3){\n        number +=1;\n        for(int j=2;j<=10;j++){\n            convert(number,j);\n            if(seek!=seekbefore){\n                seekbefore=seek;\n                break;}\n        }\n\n    }\n\n}\n\n",SEGMENTATION_FAULT,26,488
1277662743807582208,41699c0be4c0d025cbee34bd00363886b1214bbf592427e128884b0ee45b9562,2020-06-30 01:58:30,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nint count = 0;\nint seek=0;\nint seekbefore=0;\nvoid convert(int x,int n){\n    int i {},k=x,xx[50];\n    int flag = 0;\n    //求商取余法\n    while(x!=0){\n       xx[i++]=x%n;\n       x=x/n;      //x的n进制数的反序\n    }\n    for(int j=0;j<i/2;j++){\n        if(xx[j]!=xx[i-j-1]){\n            flag = 1;\n        }\n    if(flag==0){\n            count +=1;\n            if(count==2){\n                if (seek==2)\n                    cout << k ;\n                else\n                    cout << k << endl;\n                seek += 1;\n                count = 0;\n            }\n        }\n\n     }\n}\nint main(){\n    int n,number;\n    scanf(\""%d %d\"",&n,&number);\n    while(seek!=3){\n        number +=1;\n        for(int j=2;j<=10;j++){\n            convert(number,j);\n            if(seek!=seekbefore){\n                seekbefore=seek;\n                break;}\n        }\n\n    }\n\n}\n",WRONG_ANSWER,42,424
1277664268042821632,41699c0be4c0d025cbee34bd00363886b1214bbf592427e128884b0ee45b9562,2020-06-30 02:04:34,C++,20.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nint count = 0;\nint seek=0;\nint seekbefore=0;\nint n,number;\nvoid convert(int x,int y){\n    int i {},k=x,xx[50];\n    int flag = 0;\n    //求商取余法\n    while(x!=0){\n       xx[i++]=x%y;\n       x=x/y;      //x的n进制数的反序\n    }\n    for(int j=0;j<i/2;j++){\n        if(xx[j]!=xx[i-j-1]){\n            flag = 1;\n        }\n    }\n    if(flag==0){\n            count +=1;\n            if(count==2){\n                if (seek==n-1)\n                    cout << k;\n                else\n                    cout << k << endl;\n                seek += 1;\n                count = 0;\n            }\n\n\n     }\n}\nint main(){\n    scanf(\""%d %d\"",&n,&number);\n    while(seek!=n){\n        number +=1;\n        for(int j=2;j<=10;j++){\n            convert(number,j);\n            if(seek!=seekbefore){\n                seekbefore=seek;\n                break;}\n        }\n\n    }\n\n}\n\n",PARTIAL_ACCEPTED,27,500
1277671873997897728,3aaf4a732f987c33a81e41e1172d3cf2aa189e2b3924d74038f27ba4d11214e7,2020-06-30 02:34:47,C,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<stdio.h>\n#include<string.h>\nint j(char s[]);\nint h(int n,int base,char str[]);\nint main()\n{\n\tint n,s;\n\tint i,c=0;\n\tchar str[1000]={0};\n\tint m=0;\n\tscanf(\""%d %d\"",&n,&s);\n\t\t\n\t\twhile(c<n){\n\t\t\t\n\t\t\ts++;\n\t\t\tfor(i=2;i<=10;i++)\t{\n\t\t\tif(h(s,i,str)&&j(str)&&m++>=1){\n\t\t\t\t\tprintf(\""%d\\n\"",s);\n\t\t\t\t\tc++;\n\t\t\t\t\tbreak;\n\t\t\t\t}\t\t\n\t\t\t}\t\t\t\n\t\t\t\t\t\n\t\t}\n\t\n\treturn 0;\n}\nint h(int n,int base,char str[])\n{\n\tint i=0;\n\twhile(n){\n\t\tstr[i]=n%base;\n\t\tif(str[i]<10)\n\t\t\tstr[i]+='0';\n\t\telse\n\t\t\tstr[i]=str[i]-10+'A';\n\t\ti++;\n\t\tn=n/base;\n\t}\n\tstr[i]=0;\n\treturn 1;\n}\nint j(char s[])\n{\n\tint n=strlen(s),i;\n\tfor(i=0;i<n/2;i++)\n\t\tif(s[i]!=s[n-i-1])\n\t\t\treturn 0;\n\treturn 1;\n}",PARTIAL_ACCEPTED,14,384
1277678619302748160,311e4fc15730235ec73d6d0d7c1c4f56e92ff095a74bbfa2a97210ee5895e7cb,2020-06-30 03:01:35,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cstdio>\nusing namespace std;\nconst int MAXN = 300;\nconst char num[20] = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J'};\n\nint n, t, k, a[MAXN + 7], b[MAXN + 7];\n\ninline bool judg_(int x) {\n\tint num = x * x;\n\tt = 0;\n\twhile(num) {\n\t\ta[t ++] = num % n;\n\t\tnum /= n;\n\t}\n\tfor(register int i = 0; i < t / 2; i++) {\n\t\tif(a[i] != a[t - i - 1])\n\t\t\treturn false;\n\t}\n\treturn true;\n}\n\ninline void display(int x) {\n\tk = 0;\n\twhile(x) {\n\t\tb[k ++] = x % n;\n\t\tx /= n;\n\t}\n\tfor(register int i = k - 1; i >= 0; i--) {\n\t\tcout << num[b[i]];\n\t}\n\tcout << \"" \"";\n\tfor(register int i = 0; i < t; i++) {\n\t\tcout << num[a[i]];\n\t}\n\tcout << \""\\n\"";\n\t\n}\n\nint main() {\n\tcin >> n;\n\tfor(register int i = 1; i <= MAXN; i++) {\n\t\tif(judg_(i)) {\n\t\t\tdisplay(i);\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,40,492
1277685307309219840,311e4fc15730235ec73d6d0d7c1c4f56e92ff095a74bbfa2a97210ee5895e7cb,2020-06-30 03:28:10,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <cstdio>\n#include <algorithm>\nusing namespace std;\n\nint n, s, k, t, a[10000 + 7];\n\ninline bool judg_() {\n\tfor(register int i = 0; i < t / 2; i++) {\n\t\tif(a[i] != a[t - i - 1]) return false;\n\t}\n\treturn true;\n}\n\ninline bool judg(int x) {\n\tint ans_ = 0, num;\n\tfill(a, a + 10000, 0);\n\tfor(int i = 2; i <= 10; i++) {\n\t\tt = 0;\n\t\tnum = x;\n\t\twhile(num) {\n\t\t\ta[t++] = num % i;\n\t\t\tnum /= i;\n\t\t}\n\t\tif(judg_()) ans_++;\n\t\tif(ans_ >= 2) return true;\n\t}\n\treturn false;\n}\nint main() {\n\tcin >> n >> s;\n\tfor(int i = s + 1; k < n; i++) {\n\t\tif(judg(i)) {\n\t\t\tk ++;\n\t\t\tcout << i << \""\\n\"";\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,59,508
1277762055522672640,e39cca8043cb19013671c440a202a288f7f87c73afe6761b2bd045987b1a86c5,2020-06-30 08:33:08,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cmath>\n#include <string>\nusing namespace std;\nchar b[100];\nint B,n;\nint l=0;\nvoid change(int x) {\n    int j=0;\n    while(x!=0) {\n        \n        b[j]=x%B+'0';\n        if(b[j]>'9')\n\t\t\tb[j]=b[j]-'10'+'A';\n        x/=B;\n\t\tj++;\n\t\tl++;\n\t}}\nbool check()\n{int i,j;\n change(n);\n i=0;\n j=l-1;\n while(i<j)\n {if(b[i]!=b[j])\n {return false;\n  break;}\n  i++;\n  j--;}\n return true;}\nvoid display(int q)\n{int i;\n change(q);\n for(i=l-1;i>=0;i--)\n\t cout<<b[i];}\nint main()\n{cin>>B;\n for(int i=1;i<=300;i++)\n {\n\t n=i*i;\n\t if(check())\n\t {display(i);\n\t  cout<<\"" \"";\n\t  display(n);\n\t  cout<<\""\\n\"";\n\t }}\n\n\treturn 0;\n}\n",MULTIPLE_ERROR,27,516
1277762611804831744,b77006d2c05616010bccb3c4dc79461f07a7a0647f294f1948292040be148b3a,2020-06-30 08:35:20,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include <algorithm>\nusing namespace std;\nbool jud(string s) {\n\tstring s1;\n\tfor (int i = s.length() - 1; i >= 0; --i) s1 += s[i];\n\treturn s1 == s;\n}\n\nstring change(int n, int p) {\n\tstring str;\n\tint c, m = 0, s[100];\n\twhile (n != 0) {\n\t\tc = n % p;\n\t\tn = n / p;\n\t\tm++;\n\t\ts[m] = c;\n\t}\n\tfor (int k = m; k >= 1; k--) str += (char)(s[k] + 48);\n\treturn str;\n}\nint main() {\n\tint N, S,NUM=0;\n\tcin >> N>>S;\n\tfor (int i = S + 1; i <10000 ; ++i) {\n\t\tint num = 0;\n\t\tfor (int j = 2; j < 11; ++j) {\n\t\t\tif (jud(change(i, j))) num++;\n\t\t\tif (num == 3) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tNUM++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (NUM == N) break;\n\t}\n}\n",PARTIAL_ACCEPTED,34,440
1277762647284449280,41699c0be4c0d025cbee34bd00363886b1214bbf592427e128884b0ee45b9562,2020-06-30 08:35:29,C++,20.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nint count = 0;\nint seek=0;\nint seekbefore=0;\nint n,number;\nvoid convert(int x,int y){\n    int i {},k=x,xx[50];\n    int flag = 0;\n    //求商取余法\n    while(x!=0){\n       xx[i++]=x%y;\n       x=x/y;      //x的n进制数的反序\n    }\n    for(int j=0;j<i/2;j++){\n        if(xx[j]!=xx[i-j-1]){\n            flag = 1;\n        }\n        if(flag == 1)\n            break;\n    }\n    if(flag==0){\n            count +=1;\n            if(count==2){\n                if (seek==n-1)\n                    cout << k;\n                else\n                    cout << k << endl;\n                seek += 1;\n                count = 0;\n            }\n\n\n     }\n}\nint main(){\n    scanf(\""%d %d\"",&n,&number);\n    while(seek!=n){\n        number+=1;\n        for(int j=2;j<=10;j++){\n            convert(number,j);\n            if(seek!=seekbefore){\n                seekbefore=seek;\n                break;}\n        }\n\n    }\n\n}\n",PARTIAL_ACCEPTED,28,384
1277762692482269184,b77006d2c05616010bccb3c4dc79461f07a7a0647f294f1948292040be148b3a,2020-06-30 08:35:40,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include <algorithm>\nusing namespace std;\nbool jud(string s) {\n\tstring s1;\n\tfor (int i = s.length() - 1; i >= 0; --i) s1 += s[i];\n\treturn s1 == s;\n}\n\nstring change(int n, int p) {\n\tstring str;\n\tint c, m = 0, s[100];\n\twhile (n != 0) {\n\t\tc = n % p;\n\t\tn = n / p;\n\t\tm++;\n\t\ts[m] = c;\n\t}\n\tfor (int k = m; k >= 1; k--) str += (char)(s[k] + 48);\n\treturn str;\n}\nint main() {\n\tint N, S,NUM=0;\n\tcin >> N>>S;\n\tfor (int i = S + 1; i <10000 ; ++i) {\n\t\tint num = 0;\n\t\tfor (int j = 2; j < 11; ++j) {\n\t\t\tif (jud(change(i, j))) num++;\n\t\t\tif (num == 3) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tNUM++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (NUM == N) break;\n\t}\n}\n",PARTIAL_ACCEPTED,49,384
1277763795953311744,2634e2067e3d315bacd1f088e3446d119cc31358524fbab73e9e7696922b24d4,2020-06-30 08:40:03,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nbool Judge(string a){\n    bool flag = true;\n    for(int i=a.size()-1;i>=0;--i){\n        if(a[i]!=a[a.size()-1-i])\n            flag = false;\n    }\n    return flag;\n}\n\nstring Transform(int number,int B){\n    string demo;\n    while(number){\n        char tempchar = number%B + '0';\n        demo.push_back(tempchar);\n        number /= B;\n    }\n    return demo;\n}\n\nint main(){\n    int N,S,bigCount=0;\n    cin >> N >> S;\n    while(bigCount<N){\n        S++;\n        int smallCount=0;\n        for(int i=2;i<=10;i++){\n            string temp = Transform(S,i);\n            if(Judge(temp)){\n                smallCount++;\n            }\n        }\n        if(smallCount>=2){\n            cout << S << endl;\n            bigCount++;\n        }\n    }\n\n    return 0;\n}\n",ACCEPTED,37,512
1277764516480221184,fe1cf8095631d3f6d10612182a9b0c1bb58f664c354092fbb2d9ef41c3a7b9ba,2020-06-30 08:42:55,Python,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"def f(n,x):\n\n    #n为待转换的十进制数，x为机制，取值为2-16\n    a=[0,1,2,3,4,5,6,7,8,9,'A','B','C','D','E','F']\n    b=[]\n    c=[]\n    while True:\n        s=n//x  # 商\n        y=n%x  # 余数\n        b=b+[y]\n        if s==0:\n            break\n        n=s\n    b.reverse()\n    for i in b:\n        c.append(str(a[i]))\n    return c\n \njinzhishu=int(input())\nfor i in range(1,301):\n    pingfang=i*i\n    a=f(pingfang,jinzhishu)\n    x=a[::-1]\n    huiwei=''.join(x)\n    b=''.join(a)\n    if(huiwei==b):\n        print(str(i)+\"" \""+b)",PARTIAL_ACCEPTED,196,3072
1277765003258552320,ade1b517dfa96a08a0f2a67900f46bcecd43fb38d16241a43eca73a9c8978778,2020-06-30 08:44:51,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<vector>\n#include<cstring>\nusing namespace std;\nint jinzhi(int x,int y);\nbool huiwen(int x);\nint main()\n{\n    int n;\n    int s;\n    cin>>n>>s;\n    while(n>=0)\n    {\n        int q=0;\n        for(int i=2;i<11;i++)\n        {\n            if(huiwen(jinzhi(s,i)))\n            {\n                q++;\n            }\n            else\n            {\n                continue;\n            }\n        }\n        if (q>=2)\n        {\n            cout<<s<<endl;\n            s++;\n            n--;\n        }\n        else\n        {\n            s++;\n            n--;\n        }\n    }\n    return 0;\n}\nbool huiwen(int x)\n{\n    int y=0;\n    int k=x;\n    while(k>0)\n    {\n        y=y*10+k%10;\n        k=k/10;\n    }\n\n    if(y==x)\n    {\n        return 1;\n    }\n    else\n    {\n        return 0;\n    }\n\n}\nint jinzhi(int x,int y)\n{\n    int d=0;\n    vector<int> a;\n    vector<int>b;\n    while(x>0)\n    {\n\n        d=x%y;\n        x=x/y;\n        a.push_back(d);\n    }\n\n    for(int i=a.size()-1;i>=0;i--)\n    {\n        b.push_back(a[i]);\n    }\n   int q=0;\n    for(int i=0;i<a.size();i++)\n    {\n        q=q*10+b[i];\n    }\n    return q;\n\n}\n",COMPILE_ERROR,0,0
1277765032689991680,ade1b517dfa96a08a0f2a67900f46bcecd43fb38d16241a43eca73a9c8978778,2020-06-30 08:44:58,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<vector>\n#include<cstring>\nusing namespace std;\nint jinzhi(int x,int y);\nbool huiwen(int x);\nint main()\n{\n    int n;\n    int s;\n    cin>>n>>s;\n    while(n>=0)\n    {\n        int q=0;\n        for(int i=2;i<11;i++)\n        {\n            if(huiwen(jinzhi(s,i)))\n            {\n                q++;\n            }\n            else\n            {\n                continue;\n            }\n        }\n        if (q>=2)\n        {\n            cout<<s<<endl;\n            s++;\n            n--;\n        }\n        else\n        {\n            s++;\n            n--;\n        }\n    }\n    return 0;\n}\nbool huiwen(int x)\n{\n    int y=0;\n    int k=x;\n    while(k>0)\n    {\n        y=y*10+k%10;\n        k=k/10;\n    }\n\n    if(y==x)\n    {\n        return 1;\n    }\n    else\n    {\n        return 0;\n    }\n\n}\nint jinzhi(int x,int y)\n{\n    int d=0;\n    vector<int> a;\n    vector<int>b;\n    while(x>0)\n    {\n\n        d=x%y;\n        x=x/y;\n        a.push_back(d);\n    }\n\n    for(int i=a.size()-1;i>=0;i--)\n    {\n        b.push_back(a[i]);\n    }\n   int q=0;\n    for(int i=0;i<a.size();i++)\n    {\n        q=q*10+b[i];\n    }\n    return q;\n\n}\n",WRONG_ANSWER,39,492
1277765212151668736,761fdacfe751e3600726c891b3efda1d6ee33ba11ca576cb13ab34b0cd45e0d3,2020-06-30 08:45:40,C++,30.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nint isHui(int i,int b){\n    int nums[8],k=0;\n    if(i<b)\n        return 1;\n    for(int j=i;j>0;j/=b){\n        nums[k]=j%b;\n        k+=1;\n    }\n    for(int j=0;j<k/2;j++){\n        if(nums[j]!=nums[k-j-1])\n            return 0;\n    }\n    return 1;\n}\nint main(){\n    int n,s;\n    cin>>n>>s;\n    for(int i=s;n>0;i++){\n        int cnt=0;\n        for(int j=2;j<11;j++){\n            if(isHui(i,j)==1)\n                cnt++;\n            if(cnt>=2){\n                cout<<i<<endl;\n                n--;break;\n            }\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,38,512
1277765667669868544,fe1cf8095631d3f6d10612182a9b0c1bb58f664c354092fbb2d9ef41c3a7b9ba,2020-06-30 08:47:29,Python,60.0,1277062760129622023,1267442030214471680,1049226397448056832,"def f(n,x):\n\n    #n为待转换的十进制数，x为机制，取值为2-16\n    a=[0,1,2,3,4,5,6,7,8,9,'A','B','C','D','E','F']\n    b=[]\n    c=[]\n    while True:\n        s=n//x  # 商\n        y=n%x  # 余数\n        b=b+[y]\n        if s==0:\n            break\n        n=s\n    b.reverse()\n    for i in b:\n        c.append(str(a[i]))\n    return c\n \njinzhishu=int(input())\nfor i in range(1,301):\n    pingfang=i*i\n    qian=f(i,jinzhishu)\n    biaoshi=''.join(qian)\n    a=f(pingfang,jinzhishu)\n    x=a[::-1]\n    huiwei=''.join(x)\n    b=''.join(a)\n    if(huiwei==b):\n        print(biaoshi+\"" \""+b)",PARTIAL_ACCEPTED,209,3200
1277765738952065024,5ff37262c2a84a6dee9ba5a2d45ab6ae18f40cef060c8751e79563f125b99713,2020-06-30 08:47:46,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include<cstring>\n#include<algorithm>\nusing namespace std;\n\n\nconst char N[20]={0,1,2,3,4,5,6,7,8,9,'A','B','C','D','E','F','G','H','I','j'};\n\n\nstring transform(int a ,int b);\nbool isPal(string a);\nint main()\n\n{\n    int b;\n    cin>>b;\n    \n    for(int i=1;i<300;i++)\n    {\n        string a=transform(i*i,b);\n        if(isPal(a))\n        {\n            cout<<transform(i,b)<<\"" \""<<transform(i*i,b)<<endl;\n        }\n\n    }\n    \n    return 0;\n    \n\n}\nstring transform(int a ,int b)\n{\n    int m=0;\n    string n=\""\"";\n    while(a)\n    {\n        int t=a%b;\n        n+=N[t];\n        a/=b;\n    }\n    reverse(n.begin(),n.end());\n    return n;\n}\nbool isPal(string a)\n{\n    string c=a;\n    reverse(c.begin(),c.end());\n    return a==c;\n}",WRONG_ANSWER,42,512
1277766112165421056,ade1b517dfa96a08a0f2a67900f46bcecd43fb38d16241a43eca73a9c8978778,2020-06-30 08:49:15,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<vector>\n#include<cstring>\nusing namespace std;\nint jinzhi(int x,int y);\nbool huiwen(int x);\nint main()\n{\n    int n;\n    int s;\n    cin>>n>>s;\n    while(n>=0)\n    {\n        int q=0;\n        for(int i=2;i<11;i++)\n        {\n            if(huiwen(jinzhi(s,i)))\n            {\n\n                q++;\n            }\n            else\n            {\n                continue;\n            }\n        }\n        if (q>=1)\n        {\n            cout<<s<<endl;\n            s++;\n            n--;\n        }\n        else\n        {\n            s++;\n            n--;\n        }\n    }\n    return 0;\n}\nbool huiwen(int x)\n{\n    int y=0;\n    int k=x;\n    while(k>0)\n    {\n        y=y*10+k%10;\n        k=k/10;\n    }\n\n    if(y==x)\n    {\n        return 1;\n    }\n    else\n    {\n        return 0;\n    }\n\n}\nint jinzhi(int x,int y)\n{\n    int d=0;\n    vector<int> a;\n    vector<int>b;\n    while(x>0)\n    {\n\n        d=x%y;\n        x=x/y;\n        a.push_back(d);\n    }\n\n    for(int i=a.size()-1;i>=0;i--)\n    {\n        b.push_back(a[i]);\n    }\n   int q=0;\n    for(int i=0;i<a.size();i++)\n    {\n        q=q*10+b[i];\n    }\n    return q;\n\n}\n\n",WRONG_ANSWER,27,508
1277766316704849920,fdbca684c22ef228dd6668184c911846287860d1733104734c3d0653a3d045cc,2020-06-30 08:50:04,Python,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"def Palindrome_number(a):\n  if (a == a[::-1]):\n    return 1\n  else:\n    return 0\n\ndef radix_change(a, b):\n  if a == 0:\n    return \""\""\n  else:\n    return radix_change(a//b, b)+str((a%b))\n\nnum = 0\ntemp = []\nN, S = input().split()\nfor i in range(int(N)):\n  for j in range(int(S),10000):\n    for k in range(2, 11):\n      string = radix_change(j, k)\n      if (Palindrome_number(string)):\n        num+=1\n      if num >= 2:\n        break\n    if num == 2:\n      temp.append(j)\n      num = 0\n      break\nfor l in temp:\n  print(temp)",WRONG_ANSWER,162,3100
1277766359579033600,aa981424c0822864176a067fd1048c62d233d9e8d498ad0b163aaba21f606822,2020-06-30 08:50:14,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n/*bool cmp(int a[],int n){\n\tfor(int i=0;i<n;i++){\n\t\tif(a[i]!=a[n-1-i]) return false;\n\t\treturn true; \n\t}\n}*/\nint main() {\n\tint B;\n\tcin>>B;\n\tint m;\n\tfor(int i=1;i<=300;i++){\n\t\tm=i*i;\n\t\tint j=1,a[11]={0};\n\t\twhile(m!=0){\n\t\t\ta[j]=m%B;\n\t\t\tm=m/B;\n\t\t\tj++;\n\t\t}\n\t\tint flag=0;\n\t\tfor(int k=1;k<j-1;k++){\n\t\tif(a[k]!=a[j-k]) flag++;\t\n\t\t}\n\t\tif(!flag){\n\t\t\tcout<<i<<\"" \"";\n\t\t\tfor(int k=1;k<j;k++)\n\t\t\tcout<<a[j-k]; \n\t\t\tcout<<endl;\n\t\t}\n\t\t\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,44,440
1277766886261981184,761fdacfe751e3600726c891b3efda1d6ee33ba11ca576cb13ab34b0cd45e0d3,2020-06-30 08:52:20,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nint isHui(int i,int b){\n    int nums[10000000],k=0;\n    if(i<b)\n        return 1;\n    for(int j=i;j>0;j/=b){\n        nums[k]=j%b;\n        k+=1;\n    }\n    for(int j=0;j<k/2;j++){\n        if(nums[j]!=nums[k-j-1])\n            return 0;\n    }\n    return 1;\n}\nint main(){\n    int n,s;\n    cin>>n>>s;\n    for(int i=s;n>0;i++){\n        int cnt=0;\n        for(int j=2;j<11;j++){\n            if(isHui(i,j)==1)\n                cnt++;\n            if(cnt>=2){\n                cout<<i<<endl;\n                n--;break;\n            }\n        }\n    }\n    return 0;\n}",SEGMENTATION_FAULT,25,384
1277766958613725184,761fdacfe751e3600726c891b3efda1d6ee33ba11ca576cb13ab34b0cd45e0d3,2020-06-30 08:52:37,C++,50.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nint isHui(int i,int b){\n    int nums[1000],k=0;\n    if(i<b)\n        return 1;\n    for(int j=i;j>0;j/=b){\n        nums[k]=j%b;\n        k+=1;\n    }\n    for(int j=0;j<k/2;j++){\n        if(nums[j]!=nums[k-j-1])\n            return 0;\n    }\n    return 1;\n}\nint main(){\n    int n,s;\n    cin>>n>>s;\n    for(int i=s;n>0;i++){\n        int cnt=0;\n        for(int j=2;j<11;j++){\n            if(isHui(i,j)==1)\n                cnt++;\n            if(cnt>=2){\n                cout<<i<<endl;\n                n--;break;\n            }\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,26,512
1277767025403822080,ade1b517dfa96a08a0f2a67900f46bcecd43fb38d16241a43eca73a9c8978778,2020-06-30 08:52:53,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<vector>\n#include<cstring>\nusing namespace std;\nint jinzhi(int x,int y);\nbool huiwen(int x);\nint main()\n{\n    int n;\n    int s;\n    cin>>n>>s;\n    while(n>0)\n    {\n        int q=0;\n        for(int i=2;i<11;i++)\n        {\n            if(huiwen(jinzhi(s+1,i)))\n            {\n\n                q++;\n            }\n            else\n            {\n                continue;\n            }\n        }\n        if (q>=1)\n        {\n            cout<<s+1<<endl;\n            s++;\n            n--;\n        }\n        else\n        {\n            s++;\n            n--;\n        }\n    }\n    return 0;\n}\nbool huiwen(int x)\n{\n    int y=0;\n    int k=x;\n    while(k>0)\n    {\n        y=y*10+k%10;\n        k=k/10;\n    }\n\n    if(y==x)\n    {\n        return 1;\n    }\n    else\n    {\n        return 0;\n    }\n\n}\nint jinzhi(int x,int y)\n{\n    int d=0;\n    vector<int> a;\n    vector<int>b;\n    while(x>0)\n    {\n\n        d=x%y;\n        x=x/y;\n        a.push_back(d);\n    }\n\n    for(int i=a.size()-1;i>=0;i--)\n    {\n        b.push_back(a[i]);\n    }\n   int q=0;\n    for(int i=0;i<a.size();i++)\n    {\n        q=q*10+b[i];\n    }\n    return q;\n\n}\n",PARTIAL_ACCEPTED,19,384
1277767355642347520,fe1cf8095631d3f6d10612182a9b0c1bb58f664c354092fbb2d9ef41c3a7b9ba,2020-06-30 08:54:12,Python,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"def f(n,x):\n\n    #n为待转换的十进制数，x为机制，取值为2-16\n    a=[0,1,2,3,4,5,6,7,8,9,'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V']\n    b=[]\n    c=[]\n    while True:\n        s=n//x  # 商\n        y=n%x  # 余数\n        b=b+[y]\n        if s==0:\n            break\n        n=s\n    b.reverse()\n    for i in b:\n        c.append(str(a[i]))\n    return c\n \njinzhishu=int(input())\nfor i in range(1,301):\n    pingfang=i*i\n    qian=f(i,jinzhishu)\n    biaoshi=''.join(qian)\n    a=f(pingfang,jinzhishu)\n    x=a[::-1]\n    huiwei=''.join(x)\n    b=''.join(a)\n    if(huiwei==b):\n        print(biaoshi+\"" \""+b)\n    ",ACCEPTED,211,3112
1277768495100526592,fdbca684c22ef228dd6668184c911846287860d1733104734c3d0653a3d045cc,2020-06-30 08:58:43,Python,20.0,1277062760129622024,1267449136707624960,1049226397448056832,"def Palindrome_number(a):\n  if (a == a[::-1]):\n    return 1\n  else:\n    return 0\n\ndef radix_change(a, b):\n  if a == 0:\n    return \""\""\n  else:\n    return radix_change(a//b, b)+str((a%b))\n\nnum = 0\ntemp = []\nN,S = input().split()\nt = int(S)+1\nfor i in range(int(N)):\n  for j in range(t, 10000):\n    for k in range(2, 11):\n      string = radix_change(j, k)\n      if (Palindrome_number(string)):\n        num+=1\n      if num >= 2:\n        break\n    if num >= 2:\n      temp.append(j)\n      num = 0\n      t = j+1\n      break\nfor l in temp:\n  print(l)",PARTIAL_ACCEPTED,136,3108
1277768577552154624,6187709ad50eed7f26b6e80a4f69d0269fb00911171777f01df047ab9d25202d,2020-06-30 08:59:03,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <cmath>\n#include <string>\n\nusing namespace std;\n\nint caculate(int x)\n{\n    int count = 0;\n    for (int i = 2; i <= 10; i++)\n    {\n        if (count == 2)\n        {\n            break;\n        }\n        int cpy = x;            //copy of x\n        int j = 0;              //digits\n        long long trans = 0;    //transfered num\n\n        while (cpy)\n        {\n                                //add and create the goal number\n            trans += (cpy%i)*pow(10,j);\n            cpy /= i;\n            j++;\n        }\n                                //判断该进制下此数字是否是回文数\n        string tmp = \""\"" + trans;\n        int len = tmp.length();\n        int k=0;\n                                //0->(len-1)/2\n        while ((tmp[k]==tmp[len-k-1])&&(k<=(len-1)/2))\n        {\n            k++;\n        }\n        if ((k-1)==(len-1)/2)\n        {\n            count++;\n        }\n    }\n    return count;\n}\n\nint main()\n{\n    int N,S;\n    cin >> N >> S;\n\n    int count = 0;\n    while (count < N)\n    {\n        S++;\n        if(caculate(S)==2)\n        {\n            cout << S << endl;\n            count ++;\n        }\n    }\n    return 0;\n}",MULTIPLE_ERROR,37,448
1277769035217821696,aa981424c0822864176a067fd1048c62d233d9e8d498ad0b163aaba21f606822,2020-06-30 09:00:52,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n/*bool cmp(int a[],int n){\n\tfor(int i=0;i<n;i++){\n\t\tif(a[i]!=a[n-1-i]) return false;\n\t\treturn true; \n\t}\n}*/\nint main() {\n\tchar B;\n\tcin>>B;\n\tint b;\n\tif('2'<=B&&B<='10') b=B-48;\n\telse b=B-54;\n\tint m;\n\tfor(int i=1;i<=300;i++){\n\t\tm=i*i;\n\t\tint j=1,a[31]={0};\n\t\twhile(m!=0){\n\t\t\ta[j]=m%b;\n\t\t\tm=m/b;\n\t\t\tj++;\n\t\t}\n\t\tint flag=0;\n\t\tfor(int k=1;k<j-1;k++){\n\t\tif(a[k]!=a[j-k]) flag++;\t\n\t\t}\n\t\tif(!flag){\n\t\t\tcout<<i<<\"" \"";\n\t\t\tfor(int k=1;k<j;k++)\n\t\t\tcout<<a[j-k]; \n\t\t\tcout<<\""\\n\"";\n\t\t}\n\t}\n\treturn 0;\n}",WRONG_ANSWER,40,424
1277769225194627072,8c6873a2f339e895023c795dc65afb5773c8ff36d8bbc5e7a1a81e454198326e,2020-06-30 09:01:37,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include <string>\n#include <stdio.h>\n#include<array>\n#include<vector>\nusing namespace std;\n\nbool check(vector<int> a) {\n\t\n\tvector<int> b;\n\tfor (int i = a.size()-1;i >= 0;i--) {\n\t\tb.push_back(a[i]);\n\t}\n\tfor (int i = 0;i < b.size();i++) {\n\t\tif (b[i] > 10) {\n\t\t\tint g = b[i] % 10;\n\t\t\tint s = b[i] / 10;\n\t\t\tint reverse = g * 10 + s;\n\t\t\tb[i] = reverse;\n\t\t}\n\t}\n\treturn (b == a);\n}\n\nvector<int> change(int x, int a) {\n\tvector<int> y;\n\tint z = 1;\n\tint t = 0;\n\twhile ((x / a) != 0)\n\t{\n\t\tt = x % a;\n\t\tx = x / a;\n\t\ty.push_back(t);\n\t}\n\tt = x % a;\n\ty.push_back(t);\n\tvector<int> b;\n\tfor (int i = y.size() - 1;i >= 0;i--) {\n\t\tb.push_back(y[i]);\n\t}\n\treturn b;\n}\n\nint main() {\n\tint x = 0;\n\tcin >> x;\n\tfor (int i = 1;i <= 300;i++) {\n\t\tif (check(change(i * i, x))) {\n\t\t\tvector<int> a = change(i, x);\n\t\t\tvector<int> b = change(i * i, x);\n\t\t\tfor (int y : a) {\n\t\t\t\tcout << y;\n\t\t\t}\n\t\t\tcout << \"" \"";\n\t\t\tfor (int z : b) {\n\t\t\t\tcout << z;\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n\n}",PARTIAL_ACCEPTED,30,424
1277769687088168960,5ff37262c2a84a6dee9ba5a2d45ab6ae18f40cef060c8751e79563f125b99713,2020-06-30 09:03:27,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include<cstring>\n#include<algorithm>\nusing namespace std;\n\n\nconst char N[22]={\""0123456789ABCDEFGHIJ\""};\n\n\nstring transform(int a ,int b);\nbool isPal(string a);\nint main()\n\n{\n    int b;\n    cin>>b;\n    \n    for(int i=1;i<300;i++)\n    {\n        int j=i*i;\n        string a=transform(j,b);\n        // cout<<a<<endl;\n        if(isPal(a))\n        {\n            cout<<transform(i,b)<<\"" \""<<transform(j,b)<<endl;\n        }\n\n    }\n    \n    return 0;\n    \n\n}\n\nstring transform(int a ,int b)\n{\n    string n=\""\"";\n    while(a!=0)\n    {\n        int t=a%b;\n        // cout<<t<<\""\""<<endl;\n        n=n+N[t];\n        // cout<<n<<endl;\n        a/=b;\n    }\n    reverse(n.begin(),n.end());\n    return n;\n}\nbool isPal(string a)\n{\n    string c=a;\n    reverse(c.begin(),c.end());\n    return a==c;\n}",ACCEPTED,46,512
1277769732583784448,fdbca684c22ef228dd6668184c911846287860d1733104734c3d0653a3d045cc,2020-06-30 09:03:38,Python,60.0,1277062760129622024,1267449136707624960,1049226397448056832,"def Palindrome_number(a):\n  if (a == a[::-1]):\n    return 1\n  else:\n    return 0\n\ndef radix_change(a, b):\n  if a == 0:\n    return \""\""\n  else:\n    return radix_change(a//b, b)+str((a%b))\n\nnum = 0\ntemp = []\nN,S = input().split()\nt = int(S)+1\nfor i in range(int(N)):\n  for j in range(t, 10000):\n    for k in range(2, 11):\n      string = radix_change(j, k)\n      if (Palindrome_number(string)):\n        num+=1\n      if num >= 2:\n        break\n    if num >= 2:\n      temp.append(j)\n      num = 0\n      t = j+1\n      break\n    num = 0\nfor l in temp:\n  print(l)",PARTIAL_ACCEPTED,238,3072
1277769846836617216,66b2f8d2ec861ca94cd78e01d64a01741eb545e2d19b39cd55de7ea5e5b4a051,2020-06-30 09:04:05,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\n\nvector<int> change(int n, vector<int>& num)//将数字转化为二进制\n{\n    int a;\n    a = n % 2;\n    n = n >> 1;\n    if (n != 0)\n    {\n        change(n, num);\n    }\n    num.push_back(a);\n    return num;\n}\n\nvector<int> push(int n, vector<int>& num)//将十进制放入vector\n{\n    int a;\n    a = n % 10;\n    n /= 10;\n    if (n != 0)\n    {\n        push(n, num);\n    }\n    num.push_back(a);\n    return num;\n}\n\nbool judge(vector<int>& num)//判断回文数\n{\n    int n = 1;\n    for (int i = 0; i < num.size() / 2; i++)\n    {\n        if (num[i] == num[- i])\n        {\n            n = 0;\n            break;\n        }\n    }\n    return n;\n}\n\nint main()\n{\n\tint i;\n\tint n;\n\tcin >> i >> n;\n    vector<int> num;\n    vector<int> num2;\n    for (int j = 0; i != 0; j++)\n    {\n        n = n + 1;\n        push(n, num);\n        change(n, num2);\n        if (judge(num)&&judge(num2))\n        {\n            cout << n << endl;\n            i--;\n        }\n        num.clear();\n        num2.clear();\n    }\n}",TIME_LIMIT_EXCEEDED,0,0
1277769991250706432,41699c0be4c0d025cbee34bd00363886b1214bbf592427e128884b0ee45b9562,2020-06-30 09:04:40,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nint count = 0;\nint seek=0;\nint seekbefore=0;\nint n,number;\nvoid convert(int x,int y){\n    int i {},k=2*x,xx[50];\n    int flag = 0;\n    //求商取余法\n    while(x!=0){\n       xx[i++]=x%y;\n       x=x/y;      //x的n进制数的反序\n    }\n    for(int j=0;j<i/2;j++){\n        if(xx[j]!=xx[i-j-1]){\n            flag = 1;\n        }\n        if(flag == 1)\n            break;\n    }\n    if(flag==0){\n            count +=1;\n            if(count==2){\n                if (seek==n-1)\n                    cout << k/2;\n                else\n                    cout << k/2 << endl;\n                seek += 1;\n            }\n\n     }\n}\nint main(){\n    scanf(\""%d %d\"",&n,&number);\n    while(seek!=n){\n        count=0;\n        number+=1;\n        for(int j=2;j<=10;j++){\n            convert(number,j);\n            if(seek!=seekbefore){\n                seekbefore=seek;\n                break;\n            }\n        }\n\n    }\n    return 0;\n\n}\n\n\n",ACCEPTED,24,512
1277770020229144576,fdbca684c22ef228dd6668184c911846287860d1733104734c3d0653a3d045cc,2020-06-30 09:04:47,Python,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"def Palindrome_number(a):\n  if (a == a[::-1]):\n    return 1\n  else:\n    return 0\n\ndef radix_change(a, b):\n  if a == 0:\n    return \""\""\n  else:\n    return radix_change(a//b, b)+str((a%b))\n\nnum = 0\ntemp = []\nN,S = input().split()\nt = int(S)+1\nfor i in range(int(N)):\n  for j in range(t, 20000):\n    for k in range(2, 11):\n      string = radix_change(j, k)\n      if (Palindrome_number(string)):\n        num+=1\n      if num >= 2:\n        break\n    if num >= 2:\n      temp.append(j)\n      num = 0\n      t = j+1\n      break\n    num = 0\nfor l in temp:\n  print(l)",ACCEPTED,311,2984
1277770097555333120,aa981424c0822864176a067fd1048c62d233d9e8d498ad0b163aaba21f606822,2020-06-30 09:05:05,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n/*bool cmp(int a[],int n){\n\tfor(int i=0;i<n;i++){\n\t\tif(a[i]!=a[n-1-i]) return false;\n\t\treturn true; \n\t}\n}*/\nint main() {\n\tchar B[2];\n\tcin>>B;\n\t\n\tint b;\n\tif(B[1]=='0') b=10;\n\telse {\n\tif(B[0]>='2'&&B[0]<='9') b=B[0]-48;\n\telse b=B[0]-54;}\n\tint m;\n\tfor(int i=1;i<=300;i++){\n\t\tm=i*i;\n\t\tint j=1,a[31]={0};\n\t\twhile(m!=0){\n\t\t\ta[j]=m%b;\n\t\t\tm=m/b;\n\t\t\tj++;\n\t\t}\n\t\tint flag=0;\n\t\tfor(int k=1;k<j-1;k++){\n\t\tif(a[k]!=a[j-k]) flag++;\t\n\t\t}\n\t\tif(!flag){\n\t\t\tcout<<i<<\"" \"";\n\t\t\tfor(int k=1;k<j;k++)\n\t\t\tcout<<a[j-k]; \n\t\t\tcout<<\""\\n\"";\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,28,424
1277770110377320448,fdbca684c22ef228dd6668184c911846287860d1733104734c3d0653a3d045cc,2020-06-30 09:05:08,Python,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"def Palindrome_number(a):\n  if (a == a[::-1]):\n    return 1\n  else:\n    return 0\n\ndef radix_change(a, b):\n  if a == 0:\n    return \""\""\n  else:\n    return radix_change(a//b, b)+str((a%b))\n\nnum = 0\ntemp = []\nN,S = input().split()\nt = int(S)+1\nfor i in range(int(N)):\n  for j in range(t, 13000):\n    for k in range(2, 11):\n      string = radix_change(j, k)\n      if (Palindrome_number(string)):\n        num+=1\n      if num >= 2:\n        break\n    if num >= 2:\n      temp.append(j)\n      num = 0\n      t = j+1\n      break\n    num = 0\nfor l in temp:\n  print(l)",ACCEPTED,322,3044
1277770700356517888,654df0a93201e98e36a96b73994627edf5d228d15a7a8d7d87d434a878de21f1,2020-06-30 09:07:29,C++,50.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <string>\n\nusing namespace std;\n\nvector<char> transform(int ia,int n) //ia为数， n为进制要求， p为单个数字的表示向量\n{\n    vector<char> p2;\n    //对小于进制的数，直接加进去\n\n    if ((ia/n) == 0)\n    {\n        p2.push_back(ia%n);\n    }\n\n\n    while(ia/n)\n    {\n        p2.push_back(ia%n);\n        ia /= n;\n        if ((ia/n) == 0)\n        {\n            p2.push_back(ia%n);\n        }\n\n    }\n    return p2;\n\n}\n\n//检查是否为回文数  yes->1; no->0\nint cheak(vector<char> &p) //p是对应进制下的数，\n{\n    int flag = 1;\n    int sum = p.size();\n\n    for (int i=0; i<(sum/2); ++i)\n    {\n        if (p[i] != p[sum-1-i])\n        {\n            flag = 0;\n        }\n    }\n\n    //如果是则输出数字\n    if ((flag == 1) || (sum == 1))\n    {\n            return 1;\n    }\n    else\n        return 0;\n}\n\n\n\n\n\n\nint main()\n{\n    int n = 0, s = 0;\n    cin >> n >> s;\n    int sum = 0;  //统计现在出现了多少个双重回文数\n    for (int i=s; ;++i)\n    {\n        int limt = 0; //记录是否为双重回文数\n        for (int j=2; j<=10; ++j){\n            vector<char> v1 = transform(i,j);\n            limt += cheak(v1);\n            if (limt == 2)\n            {\n                cout << i << endl;\n                ++sum;\n                break;\n            }\n\n        }\n\n        //检查是否为够\n        if (sum >= n)\n            break;\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,45,492
1277771135813345280,ad8686712a9999dbe03ced4f0edcc6d1ec90b29a12065ac79e4414d28f7d7af6,2020-06-30 09:09:13,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <cmath>\nusing namespace std;\nint transB(int,int);\nint reverse(int);\n\nint main() {\n\tint B = 0;\n\tcin >> B;\n\tint sqr = 0;\n\tint sqrB = 0;\n\tint reSqrB = 0;\n\tfor (int i{1};i <= 300;i++) {\n\t\tsqr = i*i;\n\t\tsqrB = transB(sqr,B);\n\t\treSqrB = reverse(sqrB);\n\t\tif (sqrB == reSqrB)\n\t\t\tcout << i << \"" \"" << sqrB << endl;\n\t}\n}\n\nint transB(int num, int b) {\n\tvector<int> numList;\n\tdo {\n\t\tnumList.push_back(num % b);\n\t\tnum /= b;\n\t} while (num != 0);\n\tint number = 0;\n\tfor (int i{ 0 };i < numList.size();i++) {\n\t\tnumber += numList[i] * pow(10, i);\n\t}\n\treturn number;\n}\n\nint reverse(int number) {\n\tint rever{ 0 };\n\twhile (number > 0)\n\t{\n\t\trever = rever * 10 + number % 10;\n\t\tnumber = number / 10;\n\t}\n\treturn rever;\n}\n\n",PARTIAL_ACCEPTED,44,592
1277771162212302848,ade1b517dfa96a08a0f2a67900f46bcecd43fb38d16241a43eca73a9c8978778,2020-06-30 09:09:19,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<vector>\n#include<cstring>\nusing namespace std;\nint jinzhi(int x,int y);\nbool huiwen(int x);\nint main()\n{\n    int n;\n    int s;\n    cin>>n>>s;\n\n        }\n    while(n>0)\n    {\n        int q=0;\n        for(int i=2;i<11;i++)\n        {\n            if(huiwen(jinzhi(s+1,i)))\n            {\n\n                q++;\n\n            }\n            else\n            {\n                q=q;\n            }\n        }\n        if (q>=2)\n        {\n            cout<<s+1<<endl;\n            s++;\n            n--;\n        }\n        else\n        {\n            s++;\n\n        }\n    }\n    return 0;\n}\nbool huiwen(int x)\n{\n    int y=0;\n    int k=x;\n    while(k>0)\n    {\n        y=y*10+k%10;\n        k=k/10;\n    }\n\n    if(y==x)\n    {\n        return 1;\n    }\n    else\n    {\n        return 0;\n    }\n\n}\nint jinzhi(int x,int y)\n{\n    int d=0;\n    vector<int> a;\n    vector<int>b;\n    while(x>0)\n    {\n\n        d=x%y;\n        x=x/y;\n        a.push_back(d);\n    }\n\n    for(int i=a.size()-1;i>=0;i--)\n    {\n        b.push_back(a[i]);\n    }\n   int q=0;\n    for(int i=0;i<a.size();i++)\n    {\n        q=q*10+b[i];\n    }\n    return q;\n\n}",COMPILE_ERROR,0,0
1277771236367589376,aa981424c0822864176a067fd1048c62d233d9e8d498ad0b163aaba21f606822,2020-06-30 09:09:37,C++,40.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n/*bool cmp(int a[],int n){\n\tfor(int i=0;i<n;i++){\n\t\tif(a[i]!=a[n-1-i]) return false;\n\t\treturn true; \n\t}\n}*/\nint main() {\n\tchar B[2];\n\tcin>>B;\n\t\n\tint b;\n\tif(B[1]=='0') b=10;\n\telse {\n\tif(B[0]>='2'&&B[0]<='9') b=B[0]-48;\n\telse b=B[0]-54;}\n\tint m;\n\tfor(int i=1;i<=300;i++){\n\t\tm=i*i;\n\t\tint sign=i;\n\t\tint c[30];\n\t\tint j=1,a[31]={0};\n\t\twhile(m!=0){\n\t\t\ta[j]=m%b;\n\t\t\tm=m/b;\n\t\t\tj++;\n\t\t}\n\t\tint h=1;\n\t\twhile(sign!=0){\n\t\t\tc[h]=sign%b;\n\t\t\tsign=sign/b;\n\t\t\th++;\n\t\t}\n\t\tint flag=0;\n\t\tfor(int k=1;k<j-1;k++){\n\t\tif(a[k]!=a[j-k]) flag++;\t\n\t\t}\n\t\tif(!flag){\n\t\t\tfor(int k=1;k<h;k++ )\n\t\t\tcout<<c[h-k];\n\t\t\tcout<<\"" \"";\n\t\t\tfor(int k=1;k<j;k++)\n\t\t\tcout<<a[j-k]; \n\t\t\tcout<<\""\\n\"";\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,40,500
1277771278314831872,ade1b517dfa96a08a0f2a67900f46bcecd43fb38d16241a43eca73a9c8978778,2020-06-30 09:09:47,C++,50.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<vector>\n#include<cstring>\nusing namespace std;\nint jinzhi(int x,int y);\nbool huiwen(int x);\nint main()\n{\n    int n;\n    int s;\n    cin>>n>>s;\n\n       \n    while(n>0)\n    {\n        int q=0;\n        for(int i=2;i<11;i++)\n        {\n            if(huiwen(jinzhi(s+1,i)))\n            {\n\n                q++;\n\n            }\n            else\n            {\n                q=q;\n            }\n        }\n        if (q>=2)\n        {\n            cout<<s+1<<endl;\n            s++;\n            n--;\n        }\n        else\n        {\n            s++;\n\n        }\n    }\n    return 0;\n}\nbool huiwen(int x)\n{\n    int y=0;\n    int k=x;\n    while(k>0)\n    {\n        y=y*10+k%10;\n        k=k/10;\n    }\n\n    if(y==x)\n    {\n        return 1;\n    }\n    else\n    {\n        return 0;\n    }\n\n}\nint jinzhi(int x,int y)\n{\n    int d=0;\n    vector<int> a;\n    vector<int>b;\n    while(x>0)\n    {\n\n        d=x%y;\n        x=x/y;\n        a.push_back(d);\n    }\n\n    for(int i=a.size()-1;i>=0;i--)\n    {\n        b.push_back(a[i]);\n    }\n   int q=0;\n    for(int i=0;i<a.size();i++)\n    {\n        q=q*10+b[i];\n    }\n    return q;\n\n}",PARTIAL_ACCEPTED,63,512
1277771327971196928,6187709ad50eed7f26b6e80a4f69d0269fb00911171777f01df047ab9d25202d,2020-06-30 09:09:59,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <cmath>\n#include <string>\n\nusing namespace std;\n\nint caculate(int x)\n{\n    int count = 0;\n    for (int i = 2; i <= 10; i++)\n    {\n        if (count == 2)\n        {\n            break;\n        }\n        int cpy = x;            //copy of x\n        int j = 0;              //digits\n        long long trans = 0;    //transfered num\n\n        while (cpy)\n        {\n                                //add and create the goal number\n            trans += (cpy%i)*pow(10,j);\n            cpy /= i;\n            j++;\n        }\n                                //判断该进制下此数字是否是回文数\n        string tmp = to_string(trans);\n        int len = tmp.length();\n        int k=0;\n                                //0->(len-1)/2\n        while ((tmp[k]==tmp[len-k-1])&&(k<=(len-1)/2))\n        {\n            k++;\n        }\n        if ((k-1)==(len-1)/2)\n        {\n            count++;\n        }\n    }\n    return count;\n}\n\nint main()\n{\n    int N,S;\n    cin >> N >> S;\n\n    int count = 0;\n    while (count < N)\n    {\n        S++;\n        if(caculate(S)==2)\n        {\n            if (count==N-1)\n            {\n                cout << S;\n            }\n            else\n            {\n                cout << S << endl;\n                count ++;\n            }\n        }\n    }\n    return 0;\n}",TIME_LIMIT_EXCEEDED,0,0
1277771571769311232,6187709ad50eed7f26b6e80a4f69d0269fb00911171777f01df047ab9d25202d,2020-06-30 09:10:57,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <cmath>\n#include <string>\n\nusing namespace std;\n\nint caculate(int x)\n{\n    int count = 0;\n    for (int i = 2; i <= 10; i++)\n    {\n        if (count == 2)\n        {\n            break;\n        }\n        int cpy = x;            //copy of x\n        int j = 0;              //digits\n        long long trans = 0;    //transfered num\n\n        while (cpy)\n        {\n                                //add and create the goal number\n            trans += (cpy%i)*pow(10,j);\n            cpy /= i;\n            j++;\n        }\n                                //判断该进制下此数字是否是回文数\n        string tmp = to_string(trans);\n        int len = tmp.length();\n        int k=0;\n                                //0->(len-1)/2\n        while ((tmp[k]==tmp[len-k-1])&&(k<=(len-1)/2))\n        {\n            k++;\n        }\n        if ((k-1)==(len-1)/2)\n        {\n            count++;\n        }\n    }\n    return count;\n}\n\nint main()\n{\n    int N,S;\n    cin >> N >> S;\n\n    int count = 0;\n    while (count < N)\n    {\n        S++;\n        if(caculate(S)==2)\n        {\n            if (count==N-1)\n            {\n                cout << S;\n            }\n            else\n            {\n                cout << S << endl;\n                count ++;\n            }\n        }\n    }\n    return 0;\n}",TIME_LIMIT_EXCEEDED,0,0
1277771595383234560,21378286f000a43bb43e73c5990641e25039f8adc06495ef53736feb56560c8c,2020-06-30 09:11:02,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstring>\n#include<map>\n#include<vector>\n#include<array>\n#include <algorithm>\n#include<cmath>\nusing namespace std;\nvector<char> change(int n, int b)\n{\n    vector<char>num;\n    while (n > 0)\n    {\n        int m = n % b;\n        if (m < 10)\n        {\n            num.push_back(m + 48);\n\n        }\n        else\n        {\n            num.push_back(m + 55);\n        }\n        n = n / b;\n    }\n    return num;\n}\nint checkou(vector<char>a)\n{\n    int flag = 0;\n    for (int i = 0; i < (a.size()/2); i++)\n    {\n        if (a[i] == a[a.size() - i - 1])\n        {\n                    flag += 0;\n        }\n        else\n        {\n                    flag += 1;\n        }\n    }\n    return flag;\n}\nint main()\n{\n    int n, s;\n    int flag = 0;\n    cin >> n >> s;\n    vector<char>c;\n    vector<int>p;\n    vector<vector<char>>cc;\n    \n    for (int i = s + 1; i < s + 100; i++)\n    {\n        for (int j = 2; j <= 10; j++)\n        {\n            c = change(i,j);\n            cc.push_back(c);\n        }\n        vector<vector<char>>ss;\n        for (int k = 0; k < cc.size(); k++)\n        {\n            \n            flag = checkou(cc[k]);\n            if (flag == 0)\n            {\n                ss.push_back(cc[k]);\n            }\n        }\n        if (ss.size() >= 2)\n        {\n            p.push_back(i);\n        }\n\n\n    }\n    for (int k = 0; k < n; k++)\n    {\n        cout << p[k] << endl;\n    }\n\n    \n    return 0;\n}",COMPILE_ERROR,0,0
1277771694884708352,aa981424c0822864176a067fd1048c62d233d9e8d498ad0b163aaba21f606822,2020-06-30 09:11:26,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n/*bool cmp(int a[],int n){\n\tfor(int i=0;i<n;i++){\n\t\tif(a[i]!=a[n-1-i]) return false;\n\t\treturn true; \n\t}\n}*/\nint main() {\n\tint B;\n\tcin>>B;\n\t\n\t//int b;\n\t/*if(B[1]=='0') b=10;\n\telse {\n\tif(B[0]>='2'&&B[0]<='9') b=B[0]-48;\n\telse b=B[0]-54;}*/\n\tint m;\n\tfor(int i=1;i<=300;i++){\n\t\tm=i*i;\n\t\tint sign=i;\n\t\tint c[30];\n\t\tint j=1,a[31]={0};\n\t\twhile(m!=0){\n\t\t\ta[j]=m%B;\n\t\t\tm=m/B;\n\t\t\tj++;\n\t\t}\n\t\tint h=1;\n\t\twhile(sign!=0){\n\t\t\tc[h]=sign%B;\n\t\t\tsign=sign/B;\n\t\t\th++;\n\t\t}\n\t\tint flag=0;\n\t\tfor(int k=1;k<j-1;k++){\n\t\tif(a[k]!=a[j-k]) flag++;\t\n\t\t}\n\t\tif(!flag){\n\t\t\tfor(int k=1;k<h;k++ )\n\t\t\tcout<<c[h-k];\n\t\t\tcout<<\"" \"";\n\t\t\tfor(int k=1;k<j;k++)\n\t\t\tcout<<a[j-k]; \n\t\t\tcout<<\""\\n\"";\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,35,384
1277771820210511872,21378286f000a43bb43e73c5990641e25039f8adc06495ef53736feb56560c8c,2020-06-30 09:11:56,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstring>\n#include<map>\n#include<vector>\n#include<array>\n#include <algorithm>\n#include<cmath>\nusing namespace std;\nvector<char> change(int n, int b)\n{\n    vector<char>num;\n    while (n > 0)\n    {\n        int m = n % b;\n        if (m < 10)\n        {\n            num.push_back(m + 48);\n\n        }\n        else\n        {\n            num.push_back(m + 55);\n        }\n        n = n / b;\n    }\n    return num;\n}\nint checkou(vector<char>a)\n{\n    int flag = 0;\n    for (int i = 0; i < (a.size()/2); i++)\n    {\n        if (a[i] == a[a.size() - i - 1])\n        {\n                    flag += 0;\n        }\n        else\n        {\n                    flag += 1;\n        }\n    }\n    return flag;\n}\nint main()\n{\n    int n, s;\n    int flag = 0;\n    cin >> n >> s;\n    vector<char>c;\n    vector<int>p;\n    vector<vector<char>>cc;\n    \n    for (int i = s + 1; i < s + 100; i++)\n    {\n        for (int j = 2; j <= 10; j++)\n        {\n            c = change(i,j);\n            cc.push_back(c);\n        }\n        vector<vector<char>>ss;\n        for (int k = 0; k < cc.size(); k++)\n        {\n            \n            flag = checkou(cc[k]);\n            if (flag == 0)\n            {\n                ss.push_back(cc[k]);\n            }\n        }\n        if (ss.size() >= 2)\n        {\n            p.push_back(i);\n        }\n\n\n    }\n    for (int k = 0; k < n; k++)\n    {\n        cout << p[k] << endl;\n    }\n\n    \n    return 0;\n}",COMPILE_ERROR,0,0
1277772038192693248,ad8686712a9999dbe03ced4f0edcc6d1ec90b29a12065ac79e4414d28f7d7af6,2020-06-30 09:12:48,C++,30.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <cmath>\nusing namespace std;\nint transB(int,int);\nint reverse(int);\n\nint main() {\n\tint B = 0;\n\tcin >> B;\n\tint sqr = 0;\n\tint sqrB = 0;\n\tint reSqrB = 0;\n\tfor (int i{1};i <= 300;i++) {\n\t\tsqr = i*i;\n\t\tsqrB = transB(sqr,B);\n\t\treSqrB = reverse(sqrB);\n\t\tif (sqrB == reSqrB)\n\t\t\tcout << transB(i,B) << \"" \"" << sqrB << endl;\n\t}\n}\n\nint transB(int num, int b) {\n\tvector<int> numList;\n\tdo {\n\t\tnumList.push_back(num % b);\n\t\tnum /= b;\n\t} while (num != 0);\n\tint number = 0;\n\tfor (int i{ 0 };i < numList.size();i++) {\n\t\tnumber += numList[i] * pow(10, i);\n\t}\n\treturn number;\n}\n\nint reverse(int number) {\n\tint rever{ 0 };\n\twhile (number > 0)\n\t{\n\t\trever = rever * 10 + number % 10;\n\t\tnumber = number / 10;\n\t}\n\treturn rever;\n}\n\n",PARTIAL_ACCEPTED,30,492
1277772105955868672,21378286f000a43bb43e73c5990641e25039f8adc06495ef53736feb56560c8c,2020-06-30 09:13:04,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstring>\n#include<map>\n#include<vector>\n#include<array>\n#include <algorithm>\n#include<cmath>\nusing namespace std;\nvector<char> change(int n, int b)\n{\n    vector<char>num;\n    while (n > 0)\n    {\n        int m = n % b;\n        if (m < 10)\n        {\n            num.push_back(m + 48);\n\n        }\n        else\n        {\n            num.push_back(m + 55);\n        }\n        n = n / b;\n    }\n    return num;\n}\nint checkou(vector<char>a)\n{\n    int flag = 0;\n    for (int i = 0; i < (a.size()/2); i++)\n    {\n        if (a[i] == a[a.size() - i - 1])\n        {\n                    flag += 0;\n        }\n        else\n        {\n                    flag += 1;\n        }\n    }\n    return flag;\n}\nint main()\n{\n    int n, s;\n    int flag = 0;\n    cin >> n >> s;\n    vector<char>c;\n    vector<int>p;\n    vector<vector<char>>cc;\n    \n    for (int i = s + 1; i < s + 100; i++)\n    {\n        for (int j = 2; j <= 10; j++)\n        {\n            c = change(i,j);\n            cc.push_back(c);\n        }\n        vector<vector<char>>ss;\n        for (int k = 0; k < cc.size(); k++)\n        {\n            \n            flag = checkou(cc[k]);\n            if (flag == 0)\n            {\n                ss.push_back(cc[k]);\n            }\n        }\n        if (ss.size() >= 2)\n        {\n            p.push_back(i);\n        }\n\n\n    }\n    for (int k = 0; k < n; k++)\n    {\n        cout << p[k] << endl;\n    }\n\n    \n    return 0;\n}",PARTIAL_ACCEPTED,42,500
1277772376182284288,ad8686712a9999dbe03ced4f0edcc6d1ec90b29a12065ac79e4414d28f7d7af6,2020-06-30 09:14:09,C++,30.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <cmath>\nusing namespace std;\nint transB(int,int);\nint reverse(int);\n\nint main() {\n\tint B = 0;\n\tcin >> B;\n\tint sqr = 0;\n\tint sqrB = 0;\n\tint reSqrB = 0;\n\tfor (int i{1};i <= 300;i++) {\n\t\tsqr = i*i;\n\t\tsqrB = transB(sqr,B);\n\t\treSqrB = reverse(sqrB);\n\t\tif (sqrB == reSqrB)\n\t\t\tcout << transB(i,B) << \"" \"" << sqrB << endl;\n\t}\n}\n\nint transB(int num, int b) {\n\tvector<int> numList;\n\tdo {\n\t\tnumList.push_back(num % b);\n\t\tnum /= b;\n\t} while (num != 0);\n\tint number = 0;\n\tfor (int i{ 0 };i < numList.size();i++) {\n\t\tnumber += numList[i] * pow(10, i);\n\t}\n\treturn number;\n}\n\nint reverse(int number) {\n\tint rever{ 0 };\n\twhile (number > 0)\n\t{\n\t\trever = rever * 10 + number % 10;\n\t\tnumber = number / 10;\n\t}\n\treturn rever;\n}\n\n",PARTIAL_ACCEPTED,46,512
1277773589430861824,e331d74d4712667e098ce888036af991dbd882cc58ae9c09d44f6a2c7688c68b,2020-06-30 09:18:58,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <sstream>\n#include <string>\n#include <cmath>\nusing namespace std;\nint huiwen(int y)\n{\n    int answer=0;\n    for(int i=2;i<=10;i++)\n    {\n        if(answer==2) break;\n        int sing=y,j=0;\n        long long x=0;\n        while(sing) {\n            x += (sing % i) * pow(10, j);\n            sing /= i;\n            j++;\n        }\n        stringstream t;\n        string s;\n        t<<x;\n        t>>s;\n        int length=s.size(),ll=0;\n        while(s[ll]==s[length-1-ll] && ll<=(length-1)/2)\n        {\n            ll++;\n        }\n        ll--;\n        if(ll==(length-1)/2) answer++;\n    }\n    return answer;\n}\nint main(){\n    int n,s,num=0;\n    cin>>n>>s;\n    while(num<n)\n    {\n        s++;\n        if(huiwen(s)==2)\n        {\n            cout<<s<<endl;\n            num++;\n        }\n    }\n    return 0;\n}\n",ACCEPTED,100,384
1277773647257722880,761fdacfe751e3600726c891b3efda1d6ee33ba11ca576cb13ab34b0cd45e0d3,2020-06-30 09:19:12,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nint isHui(int i,int b){\n    int nums[1000],k=0;\n    if(i<b)\n        return 1;\n    for(int j=i;j>0;j/=b){\n        nums[k]=j%b;\n        k+=1;\n    }\n    for(int j=0;j<k/2;j++){\n        if(nums[j]!=nums[k-j-1])\n            return 0;\n    }\n    return 1;\n}\nint main(){\n    int n,s;\n    cin>>n>>s;\n    for(int i=s+1;n>0;i++){\n        int cnt=0;\n        for(int j=2;j<11;j++){\n            if(isHui(i,j)==1)\n                cnt++;\n            if(cnt>=2){\n                cout<<i<<endl;\n                n--;break;\n            }\n        }\n    }\n    return 0;\n}",ACCEPTED,36,512
1277773705806020608,6187709ad50eed7f26b6e80a4f69d0269fb00911171777f01df047ab9d25202d,2020-06-30 09:19:26,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <cmath>\n#include <string>\n\nusing namespace std;\n\nint caculate(int x)\n{\n    int count = 0;\n    for (int i = 2; i <= 10; i++)\n    {\n        if (count == 2)\n        {\n            break;\n        }\n        int cpy = x;            //copy of x\n        int j = 0;              //digits\n        long long trans = 0;    //transfered num\n\n        while (cpy)\n        {\n                                //add and create the goal number\n            trans += (cpy%i)*pow(10,j);\n            cpy /= i;\n            j++;\n        }\n                                //判断该进制下此数字是否是回文数\n        string tmp = to_string(trans);\n        int len = tmp.length();\n        int k=0;\n                                //0->(len-1)/2\n        while ((tmp[k]==tmp[len-k-1])&&(k<=(len-1)/2))\n        {\n            k++;\n        }\n        if ((k-1)==(len-1)/2)\n        {\n            count++;\n        }\n    }\n    return count;\n}\n\nint main()\n{\n    int N,S;\n    cin >> N >> S;\n    if ((N<0)||(N>16)||(S<=0)||(S>=10000))\n    {\n        return 1;\n    }\n    \n    int count = 0;\n    while (count < N)\n    {\n        S++;\n        if(caculate(S)==2)\n        {\n                cout << S << endl;\n                count ++;\n        }\n    }\n    return 0;\n}",ACCEPTED,41,428
1277775151188344832,8ce28e707958fb1cc3532c825490839ff6e48ed9deb2e97a20544ac4a14a4f1a,2020-06-30 09:25:10,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\nint turntoB(int n,int B){\n    int s[20];\n    int i = 0;\n    while (n) {\n        s[i] = n%B;\n        n -= s[i];\n        n = n/B;\n        i+=1;\n    }\n\n    for (int j = 0;j<i;j++){\n        if (s[j] != s[i-1-j])\n            return 0;\n    }\n\n    return 1;\n\n}\n\n\n\nvoid show(int n,int B){\n\n    int s[20];\n    int i = 0;\n    while (n) {\n        s[i] = n%B;\n        n -= s[i];\n        n = n/B;\n        i+=1;\n    }\n    for (int j = 0;j<i;j++){\n        cout << s[i-1-j];\n    }\n}\n\nint main()\n{\n    int B = 0; cin >> B;\n    for (int i = 1;i<301;i++){\n        if (turntoB(i*i,B)){\n            show(i,B);\n            cout << \"" \"";\n            show(i*i,B);\n            cout << endl;\n        }\n    }\n\n    return 0;\n}",PARTIAL_ACCEPTED,38,640
1277776269519806464,ade1b517dfa96a08a0f2a67900f46bcecd43fb38d16241a43eca73a9c8978778,2020-06-30 09:29:37,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<vector>\n#include<cstring>\nusing namespace std;\nunsigned long long int jinzhi(unsigned long long int x,unsigned long long int y);\nbool huiwen(unsigned long long int x);\nint main()\n{\n    unsigned long long int n;\n    unsigned long long int s;\n    cin>>n>>s;\n\n\n    while(n>0)\n    {\n        unsigned long long int q=0;\n        for(int i=2;i<11;i++)\n        {\n            if(huiwen(jinzhi(s+1,i)))\n            {\n\n                q++;\n\n            }\n            else\n            {\n                q=q;\n            }\n        }\n        if (q>=2)\n        {\n            cout<<s+1<<endl;\n            s++;\n            n--;\n        }\n        else\n        {\n            s++;\n\n        }\n    }\n    return 0;\n}\nbool huiwen(unsigned long long int x)\n{\n    unsigned long long int y=0;\n    unsigned long long int k=x;\n    while(k>0)\n    {\n        y=y*10+k%10;\n        k=k/10;\n    }\n\n    if(y==x)\n    {\n        return 1;\n    }\n    else\n    {\n        return 0;\n    }\n\n}\nunsigned long long int jinzhi(unsigned long long int x,unsigned long long int y)\n{\n    unsigned long long int d=0;\n    vector<int> a;\n    vector<int>b;\n    while(x>0)\n    {\n\n        d=x%y;\n        x=x/y;\n        a.push_back(d);\n    }\n\n    for(int i=a.size()-1;i>=0;i--)\n    {\n        b.push_back(a[i]);\n    }\nunsigned long long int q=0;\n    for(int i=0;i<a.size();i++)\n    {\n        q=q*10+b[i];\n    }\n    return q;\n\n}",ACCEPTED,33,548
1277776693815607296,5ff37262c2a84a6dee9ba5a2d45ab6ae18f40cef060c8751e79563f125b99713,2020-06-30 09:31:18,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<string>\n#include<algorithm>\nusing  namespace std;\nconst char N[22]={\""0123456789ABCDEFGHIJ\""};\nstring transform(int a ,int b)\n{\n    string n=\""\"";\n    while(a!=0)\n    {\n        int t=a%b;\n        // cout<<t<<\""\""<<endl;\n        n=n+N[t];\n        // cout<<n<<endl;\n        a/=b;\n    }\n    reverse(n.begin(),n.end());\n    return n;\n}\nbool isPal(string a)\n{\n    string c=a;\n    reverse(c.begin(),c.end());\n    return a==c;\n}\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    int a,b;\n     b=S;\n    while(a<4)\n    {\n       \n        b+=1;\n        int count;\n        for (int i = 2; i <=10; i++)\n        {\n            string t=transform(b,i);\n            if(isPal(t)){\n                count++;\n            }\n        }\n        if(count>1)\n        {a++;\n        cout<<b<<endl;}\n        \n        \n    }\n}",WRONG_ANSWER,32,480
1277776748727435264,aa981424c0822864176a067fd1048c62d233d9e8d498ad0b163aaba21f606822,2020-06-30 09:31:31,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n/*bool cmp(int a[],int n){\n\tfor(int i=0;i<n;i++){\n\t\tif(a[i]!=a[n-1-i]) return false;\n\t\treturn true; \n\t}\n}*/\nint main() {\n\tint B;\n\tcin>>B;\n\t\n\t//int b;\n\t/*if(B[1]=='0') b=10;\n\telse {\n\tif(B[0]>='2'&&B[0]<='9') b=B[0]-48;\n\telse b=B[0]-54;}*/\n\tint m;\n\tfor(int i=4;i<=300;i++){\n\t\tm=i*i;\n\t\tint sign=i;\n\t\tchar c[30];\n\t\tint j=1;\n\t\tchar a[31];\n\t\twhile(m!=0){\n\t\t\ta[j]=m%B;\n\t\t\tif(a[j]>=10) a[j]=a[j]+54;\n\t\t\telse a[j]=a[j]+48;\n\t\t\tm=m/B;\n\t\t\tj++;\n\t\t}\n\t\tint h=1;\n\t\twhile(sign!=0){\n\t\t\tc[h]=sign%B;\n\t\t\tif(c[h]>=10) c[h]=c[h]+54;\n\t\t\tif(c[h]<10) \n\t\t\tc[h]=c[h]+48;\n\t\t\tsign=sign/B;\n\t\t\th++;\n\t\t}\n\t\tint flag=0;\n\t\tfor(int k=1;k<j-1;k++){\n\t\tif(a[k]!=a[j-k]) flag++;\t\n\t\t}\n\t\tif(!flag){\n\t\t\tfor(int k=1;k<h;k++ )\n\t\t\tcout<<c[h-k];\n\t\t\tcout<<\"" \"";\n\t\t\tfor(int k=1;k<j;k++)\n\t\t\tcout<<a[j-k]; \n\t\t\tcout<<\""\\n\"";\n\t\t}\n\t}\n\treturn 0;\n}",WRONG_ANSWER,24,512
1277776937089425408,aa981424c0822864176a067fd1048c62d233d9e8d498ad0b163aaba21f606822,2020-06-30 09:32:16,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n/*bool cmp(int a[],int n){\n\tfor(int i=0;i<n;i++){\n\t\tif(a[i]!=a[n-1-i]) return false;\n\t\treturn true; \n\t}\n}*/\nint main() {\n\tint B;\n\tcin>>B;\n\t\n\t//int b;\n\t/*if(B[1]=='0') b=10;\n\telse {\n\tif(B[0]>='2'&&B[0]<='9') b=B[0]-48;\n\telse b=B[0]-54;}*/\n\tint m;\n\tfor(int i=1;i<=300;i++){\n\t\tm=i*i;\n\t\tint sign=i;\n\t\tchar c[30];\n\t\tint j=1;\n\t\tchar a[31];\n\t\twhile(m!=0){\n\t\t\ta[j]=m%B;\n\t\t\tif(a[j]>=10) a[j]=a[j]+54;\n\t\t\telse a[j]=a[j]+48;\n\t\t\tm=m/B;\n\t\t\tj++;\n\t\t}\n\t\tint h=1;\n\t\twhile(sign!=0){\n\t\t\tc[h]=sign%B;\n\t\t\tif(c[h]>=10) c[h]=c[h]+54;\n\t\t\tif(c[h]<10) \n\t\t\tc[h]=c[h]+48;\n\t\t\tsign=sign/B;\n\t\t\th++;\n\t\t}\n\t\tint flag=0;\n\t\tfor(int k=1;k<j-1;k++){\n\t\tif(a[k]!=a[j-k]) flag++;\t\n\t\t}\n\t\tif(!flag){\n\t\t\tfor(int k=1;k<h;k++ )\n\t\t\tcout<<c[h-k];\n\t\t\tcout<<\"" \"";\n\t\t\tfor(int k=1;k<j;k++)\n\t\t\tcout<<a[j-k]; \n\t\t\tcout<<\""\\n\"";\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,40,512
1277777045906448384,22bc41363ee5ce2db2edc4a0bb731769cc4b7261d5eae6b29c2cf336a68cd60b,2020-06-30 09:32:42,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"//input 输入N：前N个数  输入S：大于S\n//\n//int N, S\n//char num[8]={'0','1''2''3''4''5''6''7'}\n//\n//bool judge两个以上进制下回文(int i)\n//\tint count\n//\tfor(B=2; B<=8; B++){\n//\t\tif（判断B下是不是回文数 (B, i)） count++\n//\t\tif(count>2) return true;\n//\t}\n//\treturn false\n//\t\n//bool 判断i在B下是不是回文数（int B, int i){\n//\tchar temp[MAX_N];\n//\tint j=0\n//\tbool sign= true;\n//\twhile(i>=B){\n//\t\tint left= i%B\n//\t\ttemp[j]= num[left]\n//\t\ti= i/B;\n//\t\tj++;\n//\t} \n//\t最后一项  temp[j]= num[i] j++\n//\t\n//\t判断回文\n//\tfor(int k=0)````\n//\t\tif(!=) sign= false break;\n//\t\t\n//\treturn sign\n//} \n//\t\n//\t\n//\n//int main(){\n//\t输入\n//\tint cNUM=0\n//\tfor(int i=s;cNUM<N; i++ ) {\n//\t\tif(judge(i)) cNUM++ cout << i;\n//\t}\n//} \n#include<iostream>\n//#include<fstream>\nusing namespace std;\nchar num[8]={'0','1','2','3','4','5','6','7'};\nchar temp[100000000];\nint N, S;\n//fstream fin(\""4.in\"");\n\nbool itisunderB(int B, int i){\n\t//用B进制表示\n\n\t\n\tint j= 0; //移动B进制数组位置 \n\twhile(i>=B){\n\t\tint left= i% B;\n\t\ttemp[j]= num[left];\n\t\ti= i/B;\n\t\tj++; \n\t\t//\tcout << j << endl;\n\t}\n\ttemp[j]= num[i];\n\tj++;\n\t\n\n\t//确定是否是回文\n\tbool sign= true;\n\tfor(int i=0; i<j-1/2; i++){\n\t\tif(temp[i]!=temp[j-i-1]) return false;//不是回文 终止运行 \n\t} \n//\t for(int i=0; i<j; i++){\n//\t \tcout << temp[i];\n//\t }\n//\t cout << endl;\n\t return true;\n\t \n} \n\nbool itisdouble(int i){\n\tint count= 0;\n\tfor(int B=2; B<=10; B++){//轮着讨论二到八进制 \n\t\tif(itisunderB(B, i)) count++;\n\n\t\tif(count>=2) {\n//\t\t\tcout << count << endl;\n//\t\t\tcout << '*' << endl;\n\t\t\treturn true;\n\t}\t\n\t}\n\t\n\treturn false;\n}\n\nint main(){\n\tcin >> N >> S;\n\n\tint countNUM= 0;\n\tfor(int i=S+1; countNUM<N; i++){\n\t\tif(itisdouble(i)) {//如果在两个以上进制下回文成立  \n\t countNUM++;\n\t\tcout << i << endl;\n\t\t} \n\t\t \n\t}\n//\n//\tbool sign= itisdouble(26);\n//\tcout << sign << endl;\n//\t\n\treturn 0;\n}",ACCEPTED,36,440
1277777223619117056,aa981424c0822864176a067fd1048c62d233d9e8d498ad0b163aaba21f606822,2020-06-30 09:33:24,C++,40.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n/*bool cmp(int a[],int n){\n\tfor(int i=0;i<n;i++){\n\t\tif(a[i]!=a[n-1-i]) return false;\n\t\treturn true; \n\t}\n}*/\nint main() {\n\tchar B[2];\n\tcin>>B;\n\t\n\tint b;\n\tif(B[1]=='0') b=10;\n\telse {\n\tif(B[0]>='2'&&B[0]<='9') b=B[0]-48;\n\telse b=B[0]-54;}\n\tint m;\n\tfor(int i=1;i<=300;i++){\n\t\tm=i*i;\n\t\tint sign=i;\n\t\tchar c[30];\n\t\tint j=1;\n\t\tchar a[31];\n\t\twhile(m!=0){\n\t\t\ta[j]=m%b;\n\t\t\tif(a[j]>=10) a[j]=a[j]+54;\n\t\t\telse a[j]=a[j]+48;\n\t\t\tm=m/b;\n\t\t\tj++;\n\t\t}\n\t\tint h=1;\n\t\twhile(sign!=0){\n\t\t\tc[h]=sign%b;\n\t\t\tif(c[h]>=10) c[h]=c[h]+54;\n\t\t\tif(c[h]<10) \n\t\t\tc[h]=c[h]+48;\n\t\t\tsign=sign/b;\n\t\t\th++;\n\t\t}\n\t\tint flag=0;\n\t\tfor(int k=1;k<j-1;k++){\n\t\tif(a[k]!=a[j-k]) flag++;\t\n\t\t}\n\t\tif(!flag){\n\t\t\tfor(int k=1;k<h;k++ )\n\t\t\tcout<<c[h-k];\n\t\t\tcout<<\"" \"";\n\t\t\tfor(int k=1;k<j;k++)\n\t\t\tcout<<a[j-k]; \n\t\t\tcout<<\""\\n\"";\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,45,512
1277777232615899136,5ff37262c2a84a6dee9ba5a2d45ab6ae18f40cef060c8751e79563f125b99713,2020-06-30 09:33:26,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<string>\n#include<algorithm>\nusing  namespace std;\nconst char N[22]={\""0123456789ABCDEFGHIJ\""};\nstring transform(int a ,int b)\n{\n    string n=\""\"";\n    while(a!=0)\n    {\n        int t=a%b;\n        // cout<<t<<\""\""<<endl;\n        n=n+N[t];\n        // cout<<n<<endl;\n        a/=b;\n    }\n    reverse(n.begin(),n.end());\n    return n;\n}\nbool isPal(string a)\n{\n    string c=a;\n    reverse(c.begin(),c.end());\n    return a==c;\n}\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    int a,b;\n     b=S;\n    while(a<N+1)\n    {\n       \n        b+=1;\n        int count;\n        for (int i = 2; i <=10; i++)\n        {\n            string t=transform(b,i);\n            if(isPal(t)){\n                count++;\n            }\n        }\n        if(count>1)\n        {a++;\n        cout<<b<<endl;}\n        \n        \n    }\n}",WRONG_ANSWER,38,500
1277777256506654720,8ce28e707958fb1cc3532c825490839ff6e48ed9deb2e97a20544ac4a14a4f1a,2020-06-30 09:33:32,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\nint turntoB(int n,int B){\n    int s[20];\n    int i = 0;\n    while (n) {\n        s[i] = n%B;\n        n -= s[i];\n        n = n/B;\n        i+=1;\n    }\n\n    for (int j = 0;j<i;j++){\n        if (s[j] != s[i-1-j])\n            return 0;\n    }\n\n    return 1;\n\n}\n\n\n\nvoid show(int n,int B){\n\n    int s[20];\n    int i = 0;\n    while (n) {\n        s[i] = n%B;\n        n -= s[i];\n        n = n/B;\n        i+=1;\n    }\n    for (int j = 0;j<i;j++){\n        char x[10] = {'A','B','C','D','E','F','G','H','I','J'};\n        if (s[i-1-j] > 10){\n            cout << x[s[i-1-j]-11];    \n        }\n        else\n            cout << s[i-1-j];\n    }\n}\n\nint main()\n{\n    int B = 0; cin >> B;\n    for (int i = 1;i<301;i++){\n        if (turntoB(i*i,B)){\n            show(i,B);\n            cout << \"" \"";\n            show(i*i,B);\n            cout << endl;\n        }\n    }\n\n    return 0;\n}",PARTIAL_ACCEPTED,27,500
1277777264366780416,ade1b517dfa96a08a0f2a67900f46bcecd43fb38d16241a43eca73a9c8978778,2020-06-30 09:33:34,C++,30.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<cstring>\n#include<vector>\nusing namespace std;\nint jinzhi(int x,int y);\nbool huiwen(int x);\nint main()\n{\n    int o;\n    cin>>o;\n\n    for(int i=1;i<=300;i++)\n    {\n\n        if(huiwen(jinzhi(i*i,o))==1)\n        {\n            cout<<jinzhi(i,o)<<\"" \""<<jinzhi(i*i,o)<<endl;\n        }\n        else\n        {\n\n            continue;\n        }\n    }\n\n\n\n\n    return 0;\n}\n\n\nint jinzhi(int x,int y)\n{\n    int d=0;\n    vector<int> a;\n    vector<int>b;\n    while(x>0)\n    {\n\n        d=x%y;\n        x=x/y;\n        a.push_back(d);\n    }\n\n    for(int i=a.size()-1;i>=0;i--)\n    {\n        b.push_back(a[i]);\n    }\n   int q=0;\n    for(int i=0;i<a.size();i++)\n    {\n        q=q*10+b[i];\n    }\n    return q;\n\n}\n\nbool huiwen(int x)\n{\n    int y=0;\n    int k=x;\n    while(k>0)\n    {\n        y=y*10+k%10;\n        k=k/10;\n    }\n\n    if(y==x)\n    {\n        return 1;\n    }\n    else\n    {\n        return 0;\n    }\n\n}\n",PARTIAL_ACCEPTED,43,504
1277777697906819072,8ce28e707958fb1cc3532c825490839ff6e48ed9deb2e97a20544ac4a14a4f1a,2020-06-30 09:35:17,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\nint turntoB(int n,int B){\n    int s[20];\n    int i = 0;\n    while (n) {\n        s[i] = n%B;\n        n -= s[i];\n        n = n/B;\n        i+=1;\n    }\n\n    for (int j = 0;j<i;j++){\n        if (s[j] != s[i-1-j])\n            return 0;\n    }\n\n    return 1;\n\n}\n\n\n\nvoid show(int n,int B){\n\n    int s[20];\n    int i = 0;\n    while (n) {\n        s[i] = n%B;\n        n -= s[i];\n        n = n/B;\n        i+=1;\n    }\n    for (int j = 0;j<i;j++){\n        char x[10] = {'A','B','C','D','E','F','G','H','I','J'};\n        if (s[i-1-j] >= 10){\n            cout << x[s[i-1-j]-10];    \n        }\n        else\n            cout << s[i-1-j];\n    }\n}\n\nint main()\n{\n    int B = 0; cin >> B;\n    for (int i = 1;i<301;i++){\n        if (turntoB(i*i,B)){\n            show(i,B);\n            cout << \"" \"";\n            show(i*i,B);\n            cout << endl;\n        }\n    }\n\n    return 0;\n}",ACCEPTED,78,512
1277778276586553344,1b9ad4733213c509d09ebaa55602040d008718ec769109c6fe01578be7d83db2,2020-06-30 09:37:35,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"//Palindromic Squares 回文平方数\n//给定一个进制 B(2<=B<=20 十进制),输出所有的大于等于1，小于等于 300 且它的平方用 B 进制表示时是回文数的数.\n#include<bits/stdc++.h>\n\nusing namespace std;\n\nint b; //输入的b进制\nint num[500];//记录mod b之后的余数。注意！！num中倒序输出才是想要的结果\n\nvoid baseTransform(int a, int b){//进制转换，把a转化成b进制\n    int t = 0;\n    while(a != 0){\n        num[++t] = a%b;\n        a = a/b;\n    }\n    num[0] = t;//首位记录长度\n\n}\n\nbool judge(){//判断是否回文\n    //回文的充要条件：num[x] = num[num[0]+1-x]\n    bool flag = 1;\n    for(int i = 1; i<=num[0]; i++){\n        if(num[i] != num[num[0]+1-i]){\n            flag = 0;\n        }\n    }\n    return flag;\n}\n\nint main()\n{\n    cin>>b;\n    //暴力搜索大于等于1小于等于300的数\n    for(int j = 1; j<=300; j++){\n        baseTransform(j*j, b);\n        if(judge()){\n            baseTransform(j, b);\n            for(int k = num[0]; k>=1; k--){//倒序输出num数组\n                if(num[k] <= 9){\n                    cout<<num[k];\n                }else{\n                    cout<<(char)(num[k]+'A'-10);\n                }\n            }\n            cout<<' ';//间隔空格\n            baseTransform(j*j, b);\n            for(int k = num[0]; k>=1; k--){//倒序输出num数组\n                if(num[k] <= 9){\n                    cout<<num[k];\n                }else{\n                    cout<<(char)(num[k]+'A'-10);\n                }\n            }\n            cout<<\""\\n\"";\n        }\n    }\n\n    \n}",ACCEPTED,40,384
1277778352142745600,ad8686712a9999dbe03ced4f0edcc6d1ec90b29a12065ac79e4414d28f7d7af6,2020-06-30 09:37:53,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <vector>\n\nusing namespace std;\nint transB(int num, int b);\nint reverse(int number);\n\nint main() {\n\tint N{ 0 }, S{ 0 };\n\tcin >> N >> S;\n\tint timesN = 0;\n\tint timesB = 0;\n\tS += 1;\n\twhile (timesN<N)\n\t{\n\t\tfor (int i{ 2 };i <= 10;i++) {\n\t\t\tint tranB = transB(S, i);\n\t\t\tint reverB = reverse(tranB);\n\t\t\tif (tranB == reverB)\n\t\t\t\ttimesB += 1;\n\t\t\tif (timesB >= 2) {\n\t\t\t\tcout << S << endl;\n\t\t\t\ttimesN += 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\ttimesB = 0;\n\t\t++S;\n\t\t\n\t}\n}\n\nint transB(int num, int b) {\n\tvector<int> numList;\n\tdo {\n\t\tnumList.push_back(num % b);\n\t\tnum /= b;\n\t} while (num != 0);\n\tint number = 0;\n\tfor (int i{ 0 };i < numList.size();i++) {\n\t\tnumber += numList[i] * pow(10, i);\n\t}\n\treturn number;\n}\n\nint reverse(int number) {\n\tint rever{ 0 };\n\twhile (number > 0)\n\t{\n\t\trever = rever * 10 + number % 10;\n\t\tnumber = number / 10;\n\t}\n\treturn rever;\n}",COMPILE_ERROR,0,0
1277778469637775360,ad8686712a9999dbe03ced4f0edcc6d1ec90b29a12065ac79e4414d28f7d7af6,2020-06-30 09:38:21,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <vector>\n\nusing namespace std;\nint transB(int num, int b);\nint reverse(int number);\n\nint main() {\n\tint N{ 0 }, S{ 0 };\n\tcin >> N >> S;\n\tint timesN = 0;\n\tint timesB = 0;\n\tS += 1;\n\twhile (timesN<N)\n\t{\n\t\tfor (int i{ 2 };i <= 10;i++) {\n\t\t\tint tranB = transB(S, i);\n\t\t\tint reverB = reverse(tranB);\n\t\t\tif (tranB == reverB)\n\t\t\t\ttimesB += 1;\n\t\t\tif (timesB >= 2) {\n\t\t\t\tcout << S << endl;\n\t\t\t\ttimesN += 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\ttimesB = 0;\n\t\t++S;\n\t\t\n\t}\n}\n\nint transB(int num, int b) {\n\tvector<int> numList;\n\tdo {\n\t\tnumList.push_back(num % b);\n\t\tnum /= b;\n\t} while (num != 0);\n\tint number = 0;\n\tfor (int i{ 0 };i < numList.size();i++) {\n\t\tnumber += numList[i] * pow(10, i);\n\t}\n\treturn number;\n}\n\nint reverse(int number) {\n\tint rever{ 0 };\n\twhile (number > 0)\n\t{\n\t\trever = rever * 10 + number % 10;\n\t\tnumber = number / 10;\n\t}\n\treturn rever;\n}",COMPILE_ERROR,0,0
1277778602601406464,ad8686712a9999dbe03ced4f0edcc6d1ec90b29a12065ac79e4414d28f7d7af6,2020-06-30 09:38:53,C++,50.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <cmath>\n\nusing namespace std;\nint transB(int num, int b);\nint reverse(int number);\n\nint main() {\n\tint N{ 0 }, S{ 0 };\n\tcin >> N >> S;\n\tint timesN = 0;\n\tint timesB = 0;\n\tS += 1;\n\twhile (timesN<N)\n\t{\n\t\tfor (int i{ 2 };i <= 10;i++) {\n\t\t\tint tranB = transB(S, i);\n\t\t\tint reverB = reverse(tranB);\n\t\t\tif (tranB == reverB)\n\t\t\t\ttimesB += 1;\n\t\t\tif (timesB >= 2) {\n\t\t\t\tcout << S << endl;\n\t\t\t\ttimesN += 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\ttimesB = 0;\n\t\t++S;\n\t\t\n\t}\n}\n\nint transB(int num, int b) {\n\tvector<int> numList;\n\tdo {\n\t\tnumList.push_back(num % b);\n\t\tnum /= b;\n\t} while (num != 0);\n\tint number = 0;\n\tfor (int i{ 0 };i < numList.size();i++) {\n\t\tnumber += numList[i] * pow(10, i);\n\t}\n\treturn number;\n}\n\nint reverse(int number) {\n\tint rever{ 0 };\n\twhile (number > 0)\n\t{\n\t\trever = rever * 10 + number % 10;\n\t\tnumber = number / 10;\n\t}\n\treturn rever;\n}",PARTIAL_ACCEPTED,55,432
1277778603478016000,34e5c56c5cec86eefa279cc7a216a4530a6f851f3dbdd281ec607fda9b795eb8,2020-06-30 09:38:53,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n\nint s[301];\n\nvoid scale(int a,int b) //转换进制（a的b进制）:辗转相除写余数\n{\n    int digit=0;\n    while(a){\n        s[++digit]=a%b;\n        a/=b;\n    }\n    s[0]=digit;\n}\n\nbool ifEqual(){//判断s[i]与s[s[0]+1-i]是否相等\n    for(int i=1;i<=s[0];i++){\n        if(s[i]!=s[s[0]+1-i])\n            return 0;\n    }\n    return 1;\n}\n\nint test(int a){ //测试是否有多于两个进制为回文数\n    int count=0;\n    for (int i=2;i<11;i++){\n        scale(a,i);\n        if (ifEqual()){\n            count +=1;\n        }\n        if (count==2){\n            return a;\n            break;\n        }\n    }\n}\n\nint main()\n{\n    int n,abo,total=0;\n    cin >> n >> abo;\n    for (int i=abo+1;i<10015;i++){\n        if(test(i)!=0){\n            total += 1;\n            cout << i <<endl;\n            }\n        if (total==n)\n            break;\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,35,496
1277779274726047744,aa981424c0822864176a067fd1048c62d233d9e8d498ad0b163aaba21f606822,2020-06-30 09:41:33,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n/*bool cmp(int a[],int n){\n\tfor(int i=0;i<n;i++){\n\t\tif(a[i]!=a[n-1-i]) return false;\n\t\treturn true; \n\t}\n}*/\nint main() {\n\tint B;\n\tcin>>B;\n\tint m;\n\tfor(int i=1;i<=300;i++){\n\t\tm=i*i;\n\t\tint sign=i;\n\t\tchar c[30];\n\t\tint j=1;\n\t\tchar a[31];\n\t\twhile(m!=0){\n\t\t\ta[j]=m%B;\n\t\t\tif(a[j]>=10) a[j]=a[j]+55;\n\t\t\telse a[j]=a[j]+48;\n\t\t\tm=m/B;\n\t\t\tj++;\n\t\t}\n\t\tint h=1;\n\t\twhile(sign!=0&&sign<=300){\n\t\t\tc[h]=sign%B;\n\t\t\tif(c[h]>=10) c[h]=c[h]+55;\n\t\t\tif(c[h]<10) \n\t\t\tc[h]=c[h]+48;\n\t\t\tsign=sign/B;\n\t\t\th++;\n\t\t}\n\t\tint flag=0;\n\t\tfor(int k=1;k<j-1;k++){\n\t\tif(a[k]!=a[j-k]) flag++;\t\n\t\t}\n\t\tif(!flag){\n\t\t\tfor(int k=1;k<h;k++ )\n\t\t\tcout<<c[h-k];\n\t\t\tcout<<\"" \"";\n\t\t\tfor(int k=1;k<j;k++)\n\t\t\tcout<<a[j-k]; \n\t\t\tcout<<\""\\n\"";\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,40,424
1277779292140789760,d50bb81b1ebe019df9dd97491c2b89d455ab85f7a29d4389a608ef6e7ab3a290,2020-06-30 09:41:37,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<cstdio>\n#include<cstring>\n#include<algorithm>\nusing namespace std;\nint b;\ninline char c(int x)\n{\n\tif(x>=0&&x<=9)return x+'0';return x-10+'A';\n\t}\nstruct node\n{\n    int l,a[20];\n    node(int x){for(l=0;x;l++)a[l]=x%b,x/=b;}\n    void out(){for(int i=l-1;i>=0;i--)printf(\""%c\"",c(a[i]));}\n    bool tf(){for(int i=0;i<l;i++)if(a[i]!=a[l-i-1])return false;return true;}\n};\nint main()\n{\n    scanf(\""%d\"",&b);\n    for(int i=1;i<=300;i++)\n    {\n        node n(i*i);\n        if(n.tf())\n\t\t{\n\t\t\tnode m(i);m.out();putchar(' ');n.out();putchar('\\n');\n\t\t\t}\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1277779444956069888,d50bb81b1ebe019df9dd97491c2b89d455ab85f7a29d4389a608ef6e7ab3a290,2020-06-30 09:42:14,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\n#include<cstring>\n#include<algorithm>\nusing namespace std;\nint b;\ninline char c(int x)\n{\n\tif(x>=0&&x<=9)return x+'0';return x-10+'A';\n\t}\nstruct node\n{\n    int l,a[20];\n    node(int x){for(l=0;x;l++)a[l]=x%b,x/=b;}\n    void out(){for(int i=l-1;i>=0;i--)printf(\""%c\"",c(a[i]));}\n    bool tf(){for(int i=0;i<l;i++)if(a[i]!=a[l-i-1])return false;return true;}\n};\nint main()\n{\n    scanf(\""%d\"",&b);\n    for(int i=1;i<=300;i++)\n    {\n        node n(i*i);\n        if(n.tf())\n\t\t{\n\t\t\tnode m(i);m.out();putchar(' ');n.out();putchar('\\n');\n\t\t\t}\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1277780170226728960,7ff8ca0f38dc5a725990bdfab0b3a9744dfb07847205203cc37de344d053f5af,2020-06-30 09:45:07,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n\nint s[301];\n\nvoid scale(int a,int b) //转换进制（a的b进制）:辗转相除写余数\n{\n    int digit=0;\n    while(a){\n        s[++digit]=a%b;\n        a/=b;\n    }\n    s[0]=digit;\n}\n\nbool ifEqual(){//判断s[i]与s[s[0]+1-i]是否相等\n    for(int i=1;i<=s[0];i++){\n        if(s[i]!=s[s[0]+1-i])\n            return 0;\n    }\n    return 1;\n}\n\nint test(int a){ //测试是否有多于两个进制为回文数\n    int count=0;\n    for (int i=2;i<11;i++){\n        scale(a,i);\n        if (ifEqual()){\n            count +=1;\n        }\n        if (count==2){\n            return a;\n            break;\n        }\n    }\n}\n\nint main()\n{\n    int n,abo,total=0;\n    cin >> n >> abo;\n    for (int i=abo+1;i<10015;i++){\n        if(test(i)!=0){\n            total += 1;\n            cout << i <<endl;\n            }\n        if (total==n)\n            break;\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,28,436
1277780415912271872,d50bb81b1ebe019df9dd97491c2b89d455ab85f7a29d4389a608ef6e7ab3a290,2020-06-30 09:46:05,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<cstring>\n#include<algorithm>\nusing namespace std;\nint b;\ninline char c(int x)\n{\n\tif(x>=0&&x<=9)return x+'0';return x-10+'A';\n\t}\nstruct node\n{\n    int l,a[20];\n    node(int x){for(l=0;x;l++)a[l]=x%b,x/=b;}\n    void out(){for(int i=l-1;i>=0;i--)printf(\""%c\"",c(a[i]));}\n    bool tf(){for(int i=0;i<l;i++)if(a[i]!=a[l-i-1])return false;return true;}\n};\nint main()\n{\n    scanf(\""%d\"",&b);\n    for(int i=1;i<=300;i++)\n    {\n        node n(i*i);\n        if(n.tf())\n\t\t{\n\t\t\tnode m(i);m.out();putchar(' ');n.out();putchar('\\n');\n\t\t\t}\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1277780523038998528,d50bb81b1ebe019df9dd97491c2b89d455ab85f7a29d4389a608ef6e7ab3a290,2020-06-30 09:46:31,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<string>\n#include<algorithm>\nusing namespace std;\nint b;\ninline char c(int x)\n{\n\tif(x>=0&&x<=9)return x+'0';return x-10+'A';\n\t}\nstruct node\n{\n    int l,a[20];\n    node(int x){for(l=0;x;l++)a[l]=x%b,x/=b;}\n    void out(){for(int i=l-1;i>=0;i--)printf(\""%c\"",c(a[i]));}\n    bool tf(){for(int i=0;i<l;i++)if(a[i]!=a[l-i-1])return false;return true;}\n};\nint main()\n{\n    scanf(\""%d\"",&b);\n    for(int i=1;i<=300;i++)\n    {\n        node n(i*i);\n        if(n.tf())\n\t\t{\n\t\t\tnode m(i);m.out();putchar(' ');n.out();putchar('\\n');\n\t\t\t}\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1277780577908883456,d50bb81b1ebe019df9dd97491c2b89d455ab85f7a29d4389a608ef6e7ab3a290,2020-06-30 09:46:44,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<string>\n#include<algorithm>\nusing namespace std;\nint b;\ninline char c(int x)\n{\n\tif(x>=0&&x<=9)return x+'0';return x-10+'A';\n\t}\nstruct node\n{\n    int l,a[20];\n    node(int x){for(l=0;x;l++)a[l]=x%b,x/=b;}\n    void out(){for(int i=l-1;i>=0;i--)printf(\""%c\"",c(a[i]));}\n    bool tf(){for(int i=0;i<l;i++)if(a[i]!=a[l-i-1])return false;return true;}\n};\nint main()\n{\n    scanf(\""%d\"",&b);\n    for(int i=1;i<=300;i++)\n    {\n        node n(i*i);\n        if(n.tf())\n\t\t{\n\t\t\tnode m(i);m.out();putchar(' ');n.out();putchar('\\n');\n\t\t\t}\n    }\n    return 0;\n}",ACCEPTED,32,412
1277781370368090112,d50bb81b1ebe019df9dd97491c2b89d455ab85f7a29d4389a608ef6e7ab3a290,2020-06-30 09:49:53,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint num[300]={0,1,2,3,4,5,6,7,8,9,10,15,16,\n17,18,20,21,24,26,27,28,31,\n33,36,40,45,46,50,51,52,55,\n57,63,65,67,73,78,80,82,85,\n88,91,92,93,98,99,100,104,105,107,\n109,111,114,119,121,127,129,130,135,141,\n142,150,151,154,160,164,170,171,173,178,\n182,185,186,191,195,200,203,209,212,215,\n219,227,235,242,246,252,255,257,264,273,\n282,292,300,313,316,325,328,333,341,342,\n343,357,364,365,373,381,393,400,414,427,\n434,438,446,455,464,471,484,495,511,513,\n546,555,560,564,585,624,626,644,646,651,\n656,666,676,692,693,701,717,728,730,757,\n771,777,787,819,820,856,868,910,939,975,\n1023,1025,1066,1105,1221,1285,1312,1365,1432,1441,\n1460,1539,1550,1640,1667,1755,1885,2000,2188,2268,\n2293,2550,2565,2709,2730,2910,2920,2925,2997,3069,\n3074,3075,3280,3315,3550,3591,3640,3663,3735,3740,\n3855,3951,3999,4095,4097,4161,4225,4257,4289,4369,\n4433,4593,4617,4681,5001,5049,5125,5189,5397,5461,\n5740,5840,5854,6148,6200,6560,6562,6643,6697,6724,\n6761,6825,6886,6889,6953,7300,7373,7381,7409,7447,\n7462,7517,7667,7703,7777,7801,7997,8038,8119,8194,\n8200,8258,8281,8322,8386,8578,8778,8802,9009,9103,\n9201,9222,9490,9958,10252,10308,10658,10794,10858,10922,\n10986,11253,11314,11757,11898,11950,12291,12355,12419,12483, \n12547,12654,12691,13107,13124,13131,13205,13286,13299,13331};\nint n,s,g;\nint main()\n{\n\tcin>>n>>s;\n\tfor(g=1;num[g]<=s;g++);\n\tfor(int i=0;i<n;i++)cout<<num[g+i]<<endl;\n\treturn 0;\n}//打表nb！！",ACCEPTED,24,448
1277781942278217728,5ff37262c2a84a6dee9ba5a2d45ab6ae18f40cef060c8751e79563f125b99713,2020-06-30 09:52:09,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<string>\n#include<algorithm>\nusing  namespace std;\nconst char N[22]={\""0123456789ABCDEFGHIJ\""};\nstring transform(int a ,int b)\n{\n    string n=\""\"";\n    while(a!=0)\n    {\n        int t=a%b;\n        // cout<<t<<\""\""<<endl;\n        n=n+N[t];\n        // cout<<n<<endl;\n        a/=b;\n    }\n    reverse(n.begin(),n.end());\n    return n;\n}\nbool isPal(string a)\n{\n    string c=a;\n    reverse(c.begin(),c.end());\n    return a==c;\n}\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    \n    while(N!=0)\n    {\n       \n        S+=1;\n        int count;\n        for (int i = 2; i <=10; i++)\n        {\n            string t=transform(S,i);\n            if(isPal(t)){\n                count+=1;\n            }\n            else\n            {\n                continue;\n            }    \n        }\n        if(count>1)\n        {N--;\n        cout<<S<<endl;}\n        \n        \n    }\n}",PARTIAL_ACCEPTED,35,512
1277781969620893696,aa981424c0822864176a067fd1048c62d233d9e8d498ad0b163aaba21f606822,2020-06-30 09:52:16,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nbool pan(int n){\n\tint flag=0;\n\tfor(int i=2;i<=10;i++){\n\t\tint j=1,a[32];\n\t\twhile(n!=0){\n\t\t\ta[j]=n%i;\n\t\t\tn=n/i;\n\t\t\tj++;\n\t\t}\n\t\tint flag1=0;\n\t\tfor(int k=1;k<j-1;k++){\n\t\t\tif(a[k]!=a[j-k]) flag1++;\n\t\t}\n\t\tif(!flag1) flag++;\n\t\tif(flag==2) return true;\n\t}\n\treturn false;\n}\nint main() {\n\tint N,S;\n\tcin>>N>>S;\n\tint sign=S+1;\n\tfor(int i=0;i<N;i++){\n\t\tfor(;;sign++){\n\t\t\tif(pan(sign)) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tcout<<sign<<\""\\n\"";\n\t\tsign++;\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,37,452
1277782636683001856,34e5c56c5cec86eefa279cc7a216a4530a6f851f3dbdd281ec607fda9b795eb8,2020-06-30 09:54:55,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n\nint s[301];\n\nvoid scale(int a,int b) //转换进制（a的b进制）:辗转相除写余数\n{\n    int digit=0;\n    while(a){\n        s[++digit]=a%b;\n        a/=b;\n    }\n    s[0]=digit;\n}\n\nbool ifEqual(){//判断s[i]与s[s[0]+1-i]是否相等\n    for(int i=1;i<=s[0];i++){\n        if(s[i]!=s[s[0]+1-i])\n            return 0;\n    }\n    return 1;\n}\n\nint test(int a){ //测试是否有多于两个进制为回文数\n    int count=0;\n    for (int i=2;i<10;i++){\n        scale(a,i);\n        if (ifEqual()){\n            count +=1;\n        }\n        if (count==2){\n            return a;\n            break;\n        }\n    }\n}\n\nint main()\n{\n    int n,abo,total=0;\n    cin >> n >> abo;\n    for (int i=abo+1;i<10015;i++){\n        if(test(i)!=0){\n            total += 1;\n            cout << i <<endl;\n            }\n        if (total==n)\n            break;\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,29,504
1277782900857044992,7ff8ca0f38dc5a725990bdfab0b3a9744dfb07847205203cc37de344d053f5af,2020-06-30 09:55:58,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n\nint s[301];\n\nvoid scale(int a,int b) //转换进制（a的b进制）:辗转相除写余数\n{\n    int digit=0;\n    while(a){\n        s[++digit]=a%b;\n        a/=b;\n    }\n    s[0]=digit;\n}\n\nbool ifEqual(){//判断s[i]与s[s[0]+1-i]是否相等\n    for(int i=1;i<=s[0];i++){\n        if(s[i]!=s[s[0]+1-i])\n            return 0;\n    }\n    return 1;\n}\n\nint test(int a){ //测试是否有多于两个进制为回文数\n    int count=0;\n    for (int i=2;i<10;i++){\n        scale(a,i);\n        if (ifEqual()){\n            count +=1;\n        }\n        if (count==2){\n            return a;\n            break;\n        }\n    }\n}\n\nint main()\n{\n    int n,abo,total=0;\n    cin >> n >> abo;\n    for (int i=abo+1;i<10015;i++){\n        if(test(i)!=0){\n            total += 1;\n            cout << i <<endl;\n            }\n        if (total==n)\n            break;\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,36,540
1277783235776405504,c2c290e91f30dc0454f9ef5b9125b06471e7d4b403c388aa8cf0d9b3efc569e9,2020-06-30 09:57:18,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\n\nint a[20]; \nbool judge(int x,int n)\n{\n    int m{ 0 };\n    x = x * x;\n    while (x)\n    {\n        a[++m] = x % n;\n        x /= n;\n    }\n    for (int i = 1, j = m; i < j; i++, j--)\n        if (a[i] != a[j])\n            return false;\n    else\n            return true;\n}\nvoid p(int x,int n)\n{\n    int m = 0;\n    while (x)\n    {\n        a[++m] = x % n;\n        x /= n;\n    }\n    for (int i = m; i >= 1; i--)\n    {\n        if (a[i] > 9)\n            cout<<(a[i] - 10 + 'A');\n        else \n            cout<< a[i] ;\n    }\n}\nint main()\n{\n    int B;\n    cin >> B;\n    for (int i = 1; i <= 300; i++)\n    {\n        if (judge(i,B))\n        {\n            p(i,B);\n            cout << \"" \"";\n            p(i * i,B);\n            cout << \""/n\"";;\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,39,512
1277783528589164544,8ce28e707958fb1cc3532c825490839ff6e48ed9deb2e97a20544ac4a14a4f1a,2020-06-30 09:58:27,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\nint turntoB(int n,int B){\n    int s[20];\n    int i = 0;\n    while (n) {\n        s[i] = n%B;\n        n -= s[i];\n        n = n/B;\n        i+=1;\n    }\n\n    for (int j = 0;j<i;j++){\n        if (s[j] != s[i-1-j])\n            return 0;\n    }\n\n    return 1;\n\n}\n\nint main()\n{\n    int N,S; cin >> N >> S;\n    int numbercount = 0; int i = S+1;\n    int numberlist[N];\n    while (numbercount < N){\n        int x = 0;\n        for (int B = 2;B<=10;B++){\n            if (turntoB(i,B)){\n                x += 1;\n            }\n        }\n        if (x>=2){\n            numberlist[numbercount] = i;\n            numbercount += 1;\n\n        }\n        i += 1;\n    }\n\n    for (int i = 0;i<N;i++){\n        cout << numberlist[i] << endl;\n    }\n    return 0;\n}",ACCEPTED,32,488
1277783731392151552,21378286f000a43bb43e73c5990641e25039f8adc06495ef53736feb56560c8c,2020-06-30 09:59:16,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstring>\n#include<map>\n#include<vector>\n#include<array>\n#include <algorithm>\n#include<cmath>\nusing namespace std;\nvector<char> change(int n, int b)\n{\n    vector<char>num;\n    while (n > 0)\n    {\n        int m = n % b;\n        if (m < 10)\n        {\n            num.push_back(m + 48);\n\n        }\n        else\n        {\n            num.push_back(m + 55);\n        }\n        n = n / b;\n    }\n    return num;\n}\nint checkou(vector<char>a)\n{\n    int flag = 0;\n    for (int i = 0; i < (a.size()/2); i++)\n    {\n        if (a[i] == a[a.size() - i - 1])\n        {\n                    flag += 0;\n        }\n        else\n        {\n                    flag += 1;\n        }\n    }\n    return flag;\n}\nint main()\n{\n   int n, s;\n    \n    cin >> n >> s;\n    vector<char>c;\n    vector<int>p;\n    vector<vector<char>>cc;\n    int num = 0;\n    for (int i = s + 1;num!=n ; i++)\n    {\n        for (int j = 2; j <= 10; j++)\n        {\n            c = change(i,j);\n            cc.push_back(c);\n        }\n        vector<vector<char>>ss;\n        for (int k = 0; k < cc.size(); k++)\n        {\n            int flag = 0;\n            flag = checkou(cc[k]);\n            if (flag == 0)\n            {\n                ss.push_back(cc[k]);\n            }\n            cc.clear();\n        }\n        if (ss.size() >= 2)\n        {\n            p.push_back(i);\n            num++;\n\n\n        }\n    }\n    for (int k = 0; k < n; k++)\n    {\n        cout << p[k] << endl;\n    }\n\n    \n    return 0;\n}",TIME_LIMIT_EXCEEDED,0,0
1277784342821003264,c2c290e91f30dc0454f9ef5b9125b06471e7d4b403c388aa8cf0d9b3efc569e9,2020-06-30 10:01:42,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>\nint a[20]; \nbool judge(int x,int n)\n{\n    int m{ 0 };\n    x = x * x;\n    while (x)\n    {\n        a[++m] = x % n;\n        x /= n;\n    }\n    for (int i = 1, j = m; i < j; i++, j--)\n        if (a[i] != a[j])\n            return false;\n    return true;\n}\nvoid p(int x,int n)\n{\n    int m = 0;\n    while (x)\n    {\n        a[++m] = x % n;\n        x /= n;\n    }\n    for (int i = m; i >= 1; i--)\n    {\n        if (a[i] > 9)\n            cout<<(a[i] - 10 + 'A');\n        else \n            cout<< a[i] ;\n    }\n}\nint main()\n{\n    int B;\n    cin >> B;\n    for (int i = 1; i <= 300; i++)\n    {\n        if (judge(i,B))\n        {\n            p(i,B);\n            cout << \"" \"";\n            p(i * i,B);\n            cout << \""\\n\"";\n        }\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1277784769419476992,c2c290e91f30dc0454f9ef5b9125b06471e7d4b403c388aa8cf0d9b3efc569e9,2020-06-30 10:03:23,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cstdio>\nint a[20]; \nbool judge(int x,int n)\n{\n    int m{ 0 };\n    x = x * x;\n    while (x)\n    {\n        a[++m] = x % n;\n        x /= n;\n    }\n    for (int i = 1, j = m; i < j; i++, j--)\n        if (a[i] != a[j])\n            return false;\n    return true;\n}\nvoid p(int x,int n)\n{\n    int m = 0;\n    while (x)\n    {\n        a[++m] = x % n;\n        x /= n;\n    }\n    for (int i = m; i >= 1; i--)\n    {\n        if (a[i] > 9)\n            cout<<(a[i] - 10 + 'A');\n        else \n            cout<< a[i] ;\n    }\n}\nint main()\n{\n    int B;\n    cin >> B;\n    for (int i = 1; i <= 300; i++)\n    {\n        if (judge(i,B))\n        {\n            p(i,B);\n            cout << \"" \"";\n            p(i * i,B);\n            cout << \""\\n\"";\n        }\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1277784957559177216,c2c290e91f30dc0454f9ef5b9125b06471e7d4b403c388aa8cf0d9b3efc569e9,2020-06-30 10:04:08,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nint a[20]; \nbool judge(int x,int n)\n{\n    int m{ 0 };\n    x = x * x;\n    while (x)\n    {\n        a[++m] = x % n;\n        x /= n;\n    }\n    for (int i = 1, j = m; i < j; i++, j--)\n        if (a[i] != a[j])\n            return false;\n    return true;\n}\nvoid p(int x,int n)\n{\n    int m = 0;\n    while (x)\n    {\n        a[++m] = x % n;\n        x /= n;\n    }\n    for (int i = m; i >= 1; i--)\n    {\n        if (a[i] > 9)\n            cout<<(a[i] - 10 + 'A');\n        else \n            cout<< a[i] ;\n    }\n}\nint main()\n{\n    int B;\n    cin >> B;\n    for (int i = 1; i <= 300; i++)\n    {\n        if (judge(i,B))\n        {\n            p(i,B);\n            cout << \"" \"";\n            p(i * i,B);\n            cout << \""\\n\"";\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,28,528
1277785171837779968,aa981424c0822864176a067fd1048c62d233d9e8d498ad0b163aaba21f606822,2020-06-30 10:04:59,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nbool pan(int n){\n\tint flag=0;\n\tfor(int i=2;i<=10;i++){\n\t\tint j=1,a[32],m=n;\n\t\twhile(m!=0){\n\t\t\ta[j]=m%i;\n\t\t\tm=m/i;\n\t\t\tj++;\n\t\t}\n\t\tint flag1=0;\n\t\tfor(int k=1;k<=j-1;k++){\n\t\t\tif(a[k]!=a[j-k]) flag1++;\n\t\t}\n\t\tif(!flag1){\n\t\t\t//for(int k=1;k<=j-1;k++) cout<<a[k];flag++;\n\t\t\tflag++;\n\t\t}\n\t\tif(flag==2) return true;\n\t}\n\treturn false;\n}\nint main() {\n\tint N,S;\n\tcin>>N>>S;\n\tint sign=S+1;\n\tfor(int i=0;i<N;i++){\n\t\tfor(;;sign++){\n\t\t\tif(pan(sign)) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tcout<<sign<<\""\\n\"";\n\t\tsign++;\n\t}\n\treturn 0;\n}",ACCEPTED,31,512
1277785760466395136,21378286f000a43bb43e73c5990641e25039f8adc06495ef53736feb56560c8c,2020-06-30 10:07:20,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstring>\n#include<map>\n#include<vector>\n#include<array>\n#include <algorithm>\n#include<cmath>\nusing namespace std;\nvector<char> change(int n, int b)\n{\n    vector<char>num;\n    while (n > 0)\n    {\n        int m = n % b;\n        if (m < 10)\n        {\n            num.push_back(m + 48);\n\n        }\n        else\n        {\n            num.push_back(m + 55);\n        }\n        n = n / b;\n    }\n    return num;\n}\nint checkou(vector<char>a)\n{\n    int flag = 0;\n    for (int i = 0; i < (a.size()/2); i++)\n    {\n        if (a[i] == a[a.size() - i - 1])\n        {\n                    flag += 0;\n        }\n        else\n        {\n                    flag += 1;\n        }\n    }\n    return flag;\n}\nint main()\n{\n   int n, s;\n    \n    cin >> n >> s;\n    vector<char>c;\n    vector<int>p;\n    \n    int num = 0;\n    for (int i = s + 1;num!=n ; i++)\n    {\n        vector<vector<char>>cc;\n        for (int j = 2; j <= 10; j++)\n        {\n            c = change(i,j);\n            cc.push_back(c);\n        }\n        vector<vector<char>>ss;\n        for (int k = 0; k < cc.size(); k++)\n        {\n            int flag = 0;\n            flag = checkou(cc[k]);\n            if (flag == 0)\n            {\n                ss.push_back(cc[k]);\n            }\n            //cc.swap(vector<vector<char>>());\n            //cc.clear();\n        }\n        if (ss.size() >= 2)\n        {\n            p.push_back(i);\n            num++;\n\n\n        }\n    }\n    for (int k = 0; k < n; k++)\n    {\n        cout << p[k] << endl;\n    }\n\n    \n    return 0;\n}",ACCEPTED,45,404
1277786112414638080,66b2f8d2ec861ca94cd78e01d64a01741eb545e2d19b39cd55de7ea5e5b4a051,2020-06-30 10:08:43,C++,40.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\n\nvector<int> change(int n, vector<int>& num,int x=10)//将数字转化为二进制或放入vector\n{\n    int a;\n    a = n % x;\n    n = n /x;\n    if (n != 0)\n    {\n        change(n, num,x);\n    }\n    num.push_back(a);\n    return num;\n}\n\nbool judge(vector<int>& num)//判断回文数\n{\n    int n = 1;\n    for (int i = 0; i < num.size() / 2; i++)\n    {\n        if (num[i] != num[num.size()- i-1])\n        {\n            n = 0;\n            break;\n        }\n    }\n    return n;\n}\n\nint main()\n{\n\tint i;\n\tint n;\n\tcin >> i >> n;\n    vector<int> num;\n    for (int j = 0; i != 0; j++)\n    {\n        n = n + 1;\n        int m = 0;\n        //change(n, num);\n        //change(n, num2,2);\n        //if (judge(num)&&judge(num2))\n        //{\n        //    cout << n << endl;\n        //   i--;\n        //}\n        for (int x = 2; x < 11; x++)\n        {\n            if (m == 2)\n            {\n                cout << n << endl;\n                i--;\n                break;\n            }\n            change(n, num, x);\n            if (judge(num))\n            {\n                m++;\n            }\n            num.clear();\n        }\n        num.clear();\n    }\n}",PARTIAL_ACCEPTED,39,504
1277786144245211136,5ff37262c2a84a6dee9ba5a2d45ab6ae18f40cef060c8751e79563f125b99713,2020-06-30 10:08:51,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<string>\n#include<algorithm>\nusing  namespace std;\nconst char N[22]={\""0123456789ABCDEFGHIJ\""};\nstring transform(int a ,int b)\n{\n    string n=\""\"";\n    while(a!=0)\n    {\n        int t=a%b;\n        // cout<<t<<\""\""<<endl;\n        n=n+N[t];\n        // cout<<n<<endl;\n        a/=b;\n    }\n    reverse(n.begin(),n.end());\n    return n;\n}\nbool isPal(string a)\n{\n    string c=a;\n    reverse(c.begin(),c.end());\n    return a==c;\n}\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    \n    while(N!=0)\n    {\n       \n        S+=1;\n        int count;\n        for (int i = 2; i <=10; i++)\n        {\n            string t=transform(S,i);\n            if(isPal(t)){\n                count+=1;\n            }\n            else\n            {\n                continue;\n            }    \n        }\n        if(count>1)\n        {N--;\n        cout<<S<<endl;}\n        \n        \n    }\n}",PARTIAL_ACCEPTED,21,424
1277786546613190656,5ff37262c2a84a6dee9ba5a2d45ab6ae18f40cef060c8751e79563f125b99713,2020-06-30 10:10:27,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<string>\n#include<algorithm>\nusing  namespace std;\nconst char N[22]={\""0123456789ABCDEFGHIJ\""};\nstring transform(int a ,int b)\n{\n    string n=\""\"";\n    while(a!=0)\n    {\n        int t=a%b;\n        // cout<<t<<\""\""<<endl;\n        n=n+N[t];\n        // cout<<n<<endl;\n        a/=b;\n    }\n    reverse(n.begin(),n.end());\n    return n;\n}\nbool isPal(string a)\n{\n    string c=a;\n    reverse(c.begin(),c.end());\n    return a==c;\n}\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    \n    while(N)\n    {\n       \n        S+=1;\n        int count;\n        for (int i = 2; i <=10; i++)\n        {\n            string t=transform(S,i);\n            if(isPal(t)){\n                count+=1;\n            }\n            else\n            {\n                continue;\n            }   \n            // cout<<count;\n        }\n        if(count>1)\n        {N--;\n        cout<<S<<endl;}\n        \n        \n    }\n}",PARTIAL_ACCEPTED,21,384
1277788478085980160,66b2f8d2ec861ca94cd78e01d64a01741eb545e2d19b39cd55de7ea5e5b4a051,2020-06-30 10:18:07,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\n\nvector<int> change(int n, vector<int>& num,int x=10)//将数字转化为二进制或放入vector\n{\n    int a;\n    a = n % x;\n    n = n /x;\n    if (n != 0)\n    {\n        change(n, num,x);\n    }\n    num.push_back(a);\n    return num;\n}\n\nbool judge(vector<int>& num)//判断回文数\n{\n    int n = 1;\n    for (int i = 0; i < num.size() / 2; i++)\n    {\n        if (num[i] != num[num.size()- i-1])\n        {\n            n = 0;\n            break;\n        }\n    }\n    return n;\n}\n\nint main()\n{\n\tint i;\n\tint n;\n\tcin >> i >> n;\n    vector<int> num;\n    for (int j = 0; i != 0; j++)\n    {\n        n = n + 1;\n        int m = 0;\n        for (int x = 2; x < 12; x++)\n        {\n          \n            if (m == 2)\n            {\n                cout << n << endl;\n                i--;\n                break;\n            }\n            if (x == 11)\n            {\n                break;\n            }\n            change(n, num, x);\n            if (judge(num))\n            {\n                m++;\n            }\n            num.clear();\n        }\n        num.clear();\n    }\n}",ACCEPTED,50,552
1277788729433841664,5c41216a220109b1fff443e1e0b9ba50cb444ac14de402da269bff8344d75458,2020-06-30 10:19:07,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cmath>\nusing namespace std;\n\nint B;\n\nvoid get_info()\n{\n\tcin >> B;\n}\n\nstring tran(int a,int b)\n{\n\tstring ans;\n\tchar ptr[100];\n\t_itoa_s(a, ptr, b);\n\tans = ptr;\n\treturn ptr;\n}\n\nvoid solve()\n{\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\tstring ans = tran(i*i, B);\n\t\tstring ans_reverse = ans;\n\t\treverse(ans_reverse.begin(), ans_reverse.end());\n\t\tif (ans == ans_reverse)\n\t\t{\n\t\t\tstring ans1 = tran(i, B);\n\t\t\tcout << ans1 << \"" \"" << ans << endl;\n\t\t}\n\t}\n}\n\nint main()\n{\n\tget_info();\n\tsolve();\n}",COMPILE_ERROR,0,0
1277788983445086208,5c41216a220109b1fff443e1e0b9ba50cb444ac14de402da269bff8344d75458,2020-06-30 10:20:08,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cmath>\n#include<algorithm>\nusing namespace std;\n\nint B;\n\nvoid get_info()\n{\n\tcin >> B;\n}\n\nstring tran(int a,int b)\n{\n\tstring ans;\n\tchar ptr[100];\n\t_itoa(a, ptr, b);\n\tans = ptr;\n\treturn ptr;\n}\n\nvoid solve()\n{\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\tstring ans = tran(i*i, B);\n\t\tstring ans_reverse = ans;\n\t\treverse(ans_reverse.begin(), ans_reverse.end());\n\t\tif (ans == ans_reverse)\n\t\t{\n\t\t\tstring ans1 = tran(i, B);\n\t\t\tcout << ans1 << \"" \"" << ans << endl;\n\t\t}\n\t}\n}\n\nint main()\n{\n\tget_info();\n\tsolve();\n}",COMPILE_ERROR,0,0
1277789118120001536,5c41216a220109b1fff443e1e0b9ba50cb444ac14de402da269bff8344d75458,2020-06-30 10:20:40,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cmath>\n#include<algorithm>\n#include<cstdio> \n#include<cstdlib> \nusing namespace std;\n\nint B;\n\nvoid get_info()\n{\n\tcin >> B;\n}\n\nstring tran(int a,int b)\n{\n\tstring ans;\n\tchar ptr[100];\n\t_itoa(a, ptr, b);\n\tans = ptr;\n\treturn ptr;\n}\n\nvoid solve()\n{\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\tstring ans = tran(i*i, B);\n\t\tstring ans_reverse = ans;\n\t\treverse(ans_reverse.begin(), ans_reverse.end());\n\t\tif (ans == ans_reverse)\n\t\t{\n\t\t\tstring ans1 = tran(i, B);\n\t\t\tcout << ans1 << \"" \"" << ans << endl;\n\t\t}\n\t}\n}\n\nint main()\n{\n\tget_info();\n\tsolve();\n}",COMPILE_ERROR,0,0
1277789174067822592,7ff8ca0f38dc5a725990bdfab0b3a9744dfb07847205203cc37de344d053f5af,2020-06-30 10:20:53,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n\nint s[301];\n\nvoid scale(int a,int b) //转换进制（a的b进制）:辗转相除写余数\n{\n    int digit=0;\n    while(a){\n        s[++digit]=a%b;\n        a/=b;\n    }\n    s[0]=digit;\n}\n\nbool ifEqual(){//判断s[i]与s[s[0]+1-i]是否相等\n    for(int i=1;i<=s[0];i++){\n        if(s[i]!=s[s[0]+1-i])\n            return 0;\n    }\n    return 1;\n}\n\nint test(int a){ //测试是否有多于两个进制为回文数\n    int count=0;\n    for (int i=2;i<11;i++){\n        scale(a,i);\n        if (ifEqual()){\n            count +=1;\n        }\n        if (count==2){\n            return a;\n            break;\n        }\n    }\n    return 0;\n}\n\nint main()\n{\n    int n,abo,total=0;\n    cin >> n >> abo;\n    for (int i=abo+1;;i++){\n        if(test(i)!=0){\n            total += 1;\n            cout << i <<endl;\n            }\n        if (total==n)\n            break;\n    }\n    return 0;\n}\n",ACCEPTED,30,500
1277789228199501824,5c41216a220109b1fff443e1e0b9ba50cb444ac14de402da269bff8344d75458,2020-06-30 10:21:06,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cmath>\n#include<algorithm>\n#include<cstdio> \n#include<cstdlib> \nusing namespace std;\n\nint B;\n\nvoid get_info()\n{\n\tcin >> B;\n}\n\nstring tran(int a,int b)\n{\n\tstring ans;\n\tchar ptr[100];\n\titoa(a, ptr, b);\n\tans = ptr;\n\treturn ptr;\n}\n\nvoid solve()\n{\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\tstring ans = tran(i*i, B);\n\t\tstring ans_reverse = ans;\n\t\treverse(ans_reverse.begin(), ans_reverse.end());\n\t\tif (ans == ans_reverse)\n\t\t{\n\t\t\tstring ans1 = tran(i, B);\n\t\t\tcout << ans1 << \"" \"" << ans << endl;\n\t\t}\n\t}\n}\n\nint main()\n{\n\tget_info();\n\tsolve();\n}",COMPILE_ERROR,0,0
1277789533855211520,e39cca8043cb19013671c440a202a288f7f87c73afe6761b2bd045987b1a86c5,2020-06-30 10:22:19,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <cmath>\n#include <string>\nusing namespace std;\nchar b[100];\nint B,n;\nint l=0;\nvoid change(int x) {\n    int j=0;\n    while(x!=0) {\n        \n        b[j]=x%B+'0';\n        if(b[j]>'9')\n\t\t\tb[j]=b[j]+'7';\n        x/=B;\n\t\tj++;\n\t\tl++;\n\t}}\nbool check()\n{int i,j;\n change(n);\n i=0;\n j=l-1;\n while(i<j)\n {if(b[i]!=b[j])\n {return false;\n  break;}\n  i++;\n  j--;}\n return true;}\nvoid display(int q)\n{int i;\n change(q);\n for(i=l-1;i>=0;i--)\n\t cout<<b[i];}\nint main()\n{cin>>B;\n for(int i=1;i<=300;i++)\n {\n\t n=i*i;\n\t if(check())\n\t {display(i);\n\t  cout<<\"" \"";\n\t  display(n);\n\t  cout<<\""\\n\"";\n\t }}\n\n\treturn 0;\n}",COMPILE_ERROR,0,0
1277789598770462720,5ff37262c2a84a6dee9ba5a2d45ab6ae18f40cef060c8751e79563f125b99713,2020-06-30 10:22:35,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<string>\n#include<algorithm>\nusing  namespace std;\nconst char N[22]={\""0123456789ABCDEFGHIJ\""};\nstring transform(int a ,int b)\n{\n    string n=\""\"";\n    while(a!=0)\n    {\n        int t=a%b;\n        // cout<<t<<\""\""<<endl;\n        n=n+N[t];\n        // cout<<n<<endl;\n        a/=b;\n    }\n    reverse(n.begin(),n.end());\n    return n;\n}\nbool isPal(string a)\n{\n    string c=a;\n    reverse(c.begin(),c.end());\n    return a==c;\n}\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    \n    while(N)\n    {\n       \n        S+=1;\n        int count=0;\n        for (int i = 2; i <=10; i++)\n        {\n            string t=transform(S,i);\n            if(isPal(t)){\n                count+=1;\n            }\n            else\n            {\n                continue;\n            }   \n            // cout<<count;\n        }\n        if(count>1)\n        {N--;\n        cout<<S<<endl;}\n        \n        \n    }\n}",ACCEPTED,47,384
1277789778894839808,5c41216a220109b1fff443e1e0b9ba50cb444ac14de402da269bff8344d75458,2020-06-30 10:23:18,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cmath>\n#include<algorithm>\nusing namespace std;\n\nint B;\n\nvoid get_info()\n{\n\tcin >> B;\n}\n\nstring tran(int a,int b)\n{\n\tstring ans = \""\"";\n\tdo {\n\t\tint t = a % b;\n\t\tif (t >= 0 && t <= 9)\tans += t + '0';\n\t\telse ans += t - 10 + 'a';\n\t\ta /= b;\n\t} while (a != 0);\n\treverse(ans.begin(), ans.end());\n\treturn ans;\n}\n\nvoid solve()\n{\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\tstring ans = tran(i*i, B);\n\t\tstring ans_reverse = ans;\n\t\treverse(ans_reverse.begin(), ans_reverse.end());\n\t\tif (ans == ans_reverse)\n\t\t{\n\t\t\tstring ans1 = tran(i, B);\n\t\t\tcout << ans1 << \"" \"" << ans << endl;\n\t\t}\n\t}\n}\n\nint main()\n{\n\tget_info();\n\tsolve();\n}",PARTIAL_ACCEPTED,28,424
1277789820342960128,e39cca8043cb19013671c440a202a288f7f87c73afe6761b2bd045987b1a86c5,2020-06-30 10:23:28,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cmath>\n#include <string>\nusing namespace std;\nchar b[100];\nint B,n;\nint l=0;\nvoid change(int x) {\n    int j=0;\n    while(x!=0) {\n        \n        b[j]=x%B+'0';\n        if(b[j]>'9')\n\t\t\tb[j]=b[j]+'7';\n        x/=B;\n\t\tj++;\n\t\tl++;\n\t}}\nbool check()\n{int i,j;\n change(n);\n i=0;\n j=l-1;\n while(i<j)\n {if(b[i]!=b[j])\n {return false;\n  break;}\n  i++;\n  j--;}\n return true;}\nvoid display(int q)\n{int i;\n change(q);\n for(i=l-1;i>=0;i--)\n\t cout<<b[i];}\nint main()\n{cin>>B;\n for(int i=1;i<=300;i++)\n {\n\t n=i*i;\n\t if(check())\n\t {display(i);\n\t  cout<<\"" \"";\n\t  display(n);\n\t  cout<<\""\\n\"";\n\t }}\n\n\treturn 0;\n}\n",MULTIPLE_ERROR,29,512
1277789843738779648,34e5c56c5cec86eefa279cc7a216a4530a6f851f3dbdd281ec607fda9b795eb8,2020-06-30 10:23:33,C++,30.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n\nint s[301];\n\nvoid scale(int a,int b) //转换进制（a的b进制）:辗转相除写余数\n{\n    int digit=0;\n    while(a){\n        s[++digit]=a%b;\n        a/=b;\n    }\n    s[0]=digit;\n}\n\nbool ifEqual(){//判断s[i]与s[s[0]+1-i]是否相等\n    for(int i=1;i<=s[0];i++){\n        if(s[i]!=s[s[0]+1-i])\n            return 0;\n    }\n    return 1;\n}\n\nint test(int a){ //测试是否有多于两个进制为回文数\n    int count=0;\n    for (int i=2;i<10;i++){\n        scale(a,i);\n        if (ifEqual()){\n            count +=1;\n        }\n        if (count==2){\n            return a;\n            break;\n        }\n    }\n    return 0;\n}\n\nint main()\n{\n    int n,abo,total=0;\n    cin >> n >> abo;\n    for (int i=abo+1;i<10015;i++){\n        if(test(i)!=0){\n            total += 1;\n            cout << i <<endl;\n            }\n        if (total==n)\n            break;\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,30,416
1277789998655397888,34e5c56c5cec86eefa279cc7a216a4530a6f851f3dbdd281ec607fda9b795eb8,2020-06-30 10:24:10,C++,60.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n\nint s[301];\n\nvoid scale(int a,int b) //转换进制（a的b进制）:辗转相除写余数\n{\n    int digit=0;\n    while(a){\n        s[++digit]=a%b;\n        a/=b;\n    }\n    s[0]=digit;\n}\n\nbool ifEqual(){//判断s[i]与s[s[0]+1-i]是否相等\n    for(int i=1;i<=s[0];i++){\n        if(s[i]!=s[s[0]+1-i])\n            return 0;\n    }\n    return 1;\n}\n\nint test(int a){ //测试是否有多于两个进制为回文数\n    int count=0;\n    for (int i=2;i<11;i++){\n        scale(a,i);\n        if (ifEqual()){\n            count +=1;\n        }\n        if (count==2){\n            return a;\n            break;\n        }\n    }\n    return 0;\n}\n\nint main()\n{\n    int n,abo,total=0;\n    cin >> n >> abo;\n    for (int i=abo+1;i<10015;i++){\n        if(test(i)!=0){\n            total += 1;\n            cout << i <<endl;\n            }\n        if (total==n)\n            break;\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,35,392
1277790157011353600,5c41216a220109b1fff443e1e0b9ba50cb444ac14de402da269bff8344d75458,2020-06-30 10:24:48,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cmath>\n#include<algorithm>\nusing namespace std;\n\nint B;\n\nvoid get_info()\n{\n\tcin >> B;\n}\n\nstring tran(int a,int b)\n{\n\tstring ans = \""\"";\n\tdo {\n\t\tint t = a % b;\n\t\tif (t >= 0 && t <= 9)\tans += t + '0';\n\t\telse ans += t - 10 + 'A';\n\t\ta /= b;\n\t} while (a != 0);\n\treverse(ans.begin(), ans.end());\n\treturn ans;\n}\n\nvoid solve()\n{\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\tstring ans = tran(i*i, B);\n\t\tstring ans_reverse = ans;\n\t\treverse(ans_reverse.begin(), ans_reverse.end());\n\t\tif (ans == ans_reverse)\n\t\t{\n\t\t\tstring ans1 = tran(i, B);\n\t\t\tcout << ans1 << \"" \"" << ans << endl;\n\t\t}\n\t}\n}\n\nint main()\n{\n\tget_info();\n\tsolve();\n}",ACCEPTED,29,424
1277790181170536448,7ff8ca0f38dc5a725990bdfab0b3a9744dfb07847205203cc37de344d053f5af,2020-06-30 10:24:54,C++,60.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n\nint s[301];\n\nvoid scale(int a,int b) //转换进制（a的b进制）:辗转相除写余数\n{\n    int digit=0;\n    while(a){\n        s[++digit]=a%b;\n        a/=b;\n    }\n    s[0]=digit;\n}\n\nbool ifEqual(){//判断s[i]与s[s[0]+1-i]是否相等\n    for(int i=1;i<=s[0];i++){\n        if(s[i]!=s[s[0]+1-i])\n            return 0;\n    }\n    return 1;\n}\n\nint test(int a){ //测试是否有多于两个进制为回文数\n    int count=0;\n    for (int i=2;i<11;i++){\n        scale(a,i);\n        if (ifEqual()){\n            count +=1;\n        }\n        if (count==2){\n            return a;\n            break;\n        }\n    }\n    return 0;\n}\n\nint main()\n{\n    int n,abo,total=0;\n    cin >> n >> abo;\n    for (int i=abo+1;i<10015;i++){\n        if(test(i)!=0){\n            total += 1;\n            cout << i <<endl;\n            }\n        if (total==n)\n            break;\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,28,384
1277790211101089792,ab3ac7d3615ec928fcbb93f4072aaa583f19767afc2dc1d5e045648b0b245af1,2020-06-30 10:25:01,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint B;\nvoid judge(int x);\nint main()\n{\n   cin>>B;\n   for(int i=1;i<=300;i++)\n   {\n       judge(i);        \n   }\n   return 0;    \n} \nvoid judge(int x)\n{\n   int squ_num[20];\n   int num[20];\n   int x1=x*x;\n   int len=0;\n   while(x1!=0)\n   {\n      squ_num[++len]=x1%B;\n      x1=x1/B;            \n   }\n   for(int i=1;i<=len/2;i++)\n   {\n       if(squ_num[i]!=squ_num[len+1-i]) \n\t   return;\n   }\n   x1=x;\n   int len1=0;\n   while(x1!=0)\n   {\n      num[++len1]=x1%B;\n      x1=x1/B;            \n   }\n   for(int i=len1;i>=1;i--)\n   {\n      if(num[i]>=10) \n\t  cout<<char(num[i]+55);     \n      else \n\t  cout<<num[i];  \n    } \n   cout<<\"" \"";\n   for(int i=len;i>=1;i--)\n   {\n      if(squ_num[i]>=10) \n\t  cout<<char(squ_num[i]+55);     \n      else \n\t  cout<<squ_num[i];       \n   }\n   cout<<endl;\n   return;\n}\n",ACCEPTED,36,424
1277790458409836544,7ff8ca0f38dc5a725990bdfab0b3a9744dfb07847205203cc37de344d053f5af,2020-06-30 10:26:00,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n\nint s[301];\n\nvoid scale(int a,int b) //转换进制（a的b进制）:辗转相除写余数\n{\n    int digit=0;\n    while(a){\n        s[++digit]=a%b;\n        a/=b;\n    }\n    s[0]=digit;\n}\n\nbool ifEqual(){//判断s[i]与s[s[0]+1-i]是否相等\n    for(int i=1;i<=s[0];i++){\n        if(s[i]!=s[s[0]+1-i])\n            return 0;\n    }\n    return 1;\n}\n\nint test(int a){ //测试是否有多于两个进制为回文数\n    int count=0;\n    for (int i=2;i<11;i++){\n        scale(a,i);\n        if (ifEqual()){\n            count +=1;\n        }\n        if (count==2){\n            return a;\n            break;\n        }\n    }\n    return 0;\n}\n\nint main()\n{\n    int n,abo,total=0;\n    cin >> n >> abo;\n    for (int i=abo+1;;i++){\n        if(test(i)!=0){\n            total += 1;\n            cout << i <<endl;\n            }\n        if (total==n)\n            break;\n    }\n    return 0;\n}\n",ACCEPTED,37,512
1277790675611869184,34e5c56c5cec86eefa279cc7a216a4530a6f851f3dbdd281ec607fda9b795eb8,2020-06-30 10:26:51,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n\nint s[301];\n\nvoid scale(int a,int b) //转换进制（a的b进制）:辗转相除写余数\n{\n    int digit=0;\n    while(a){\n        s[++digit]=a%b;\n        a/=b;\n    }\n    s[0]=digit;\n}\n\nbool ifEqual(){//判断s[i]与s[s[0]+1-i]是否相等\n    for(int i=1;i<=s[0];i++){\n        if(s[i]!=s[s[0]+1-i])\n            return 0;\n    }\n    return 1;\n}\n\nint test(int a){ //测试是否有多于两个进制为回文数\n    int count=0;\n    for (int i=2;i<11;i++){\n        scale(a,i);\n        if (ifEqual()){\n            count +=1;\n        }\n        if (count==2){\n            return a;\n            break;\n        }\n    }\n    return 0;\n}\n\nint main()\n{\n    int n,abo,total=0;\n    cin >> n >> abo;\n    for (int i=abo+1;;i++){\n        if(test(i)!=0){\n            total += 1;\n            cout << i <<endl;\n            }\n        if (total==n)\n            break;\n    }\n    return 0;\n}\n",ACCEPTED,36,416
1277792051515547648,cc0d763b9b9af8282454127e1f75709799ad3393794bfd64b02be7134b1d1c88,2020-06-30 10:32:19,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nint B, x, y;\nint m[100], n[100];\nchar b[20] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\nvoid many(int n) \n{\n\tint a= 0;\n\twhile (n != 0)\n\t{\n\t\tn /= 10;\n\t\ta++;\n\t}\n\treturn;\n}\n//第一个第二个数转换进制；\nvoid change(int n) \n{\n\tx = 0;\n\twhile (n != 0) \n\t{\n\t\tm[x] = n % B;\n\t\tn /= B;\n\t\tx++;\n\t}\n\treturn;\n}\nvoid change1(int n)\n{\n\ty = 0;\n\twhile (n != 0)\n\t{\n\t\tn[y] = n % B;\n\t\tn /= B;\n\t\ty++;\n\t}\n\treturn;\n}\nint main()\n{\n\tcin >> B;\n\tint current;\n\tbool cf = false;\n\tfor (int i = 1;i <= 300;i++) \n\t{\n\t\tmemset(m, 0, sizeof(m));\n\t\tmemset(n, 0, sizeof(n));\n\t\tchange1(i);\n\t\tcurrent = i * i;\n\t\tchange(current);\n\t}\n\tmany(current);\n}\n\tbool cf = false;\n\tfor (int j = 0;j <x;j++)\n\t{\n\t\tif (a[j] != a[x - 1 - j])\n\t\t{\n\t\t\tcf= true;\n\t\t}\n\t}\nif (cf == false)\n{\n\t\tfor (int j = y - 1;j >= 0;j--)\n\t\t{\n\t\t\tcout << b[n[j]];\n\t\t}\n\t\tcout << \"" \"";\n\t\tfor (int j = x - 1;j >= 0;j--) \n\t\t{\n\t\t\tcout << b[m[j]];\n\t\t}\n\t\tcout << endl;\n\t}\n}\nreturn 0;\n}\n",COMPILE_ERROR,0,0
1277792515661430784,cc0d763b9b9af8282454127e1f75709799ad3393794bfd64b02be7134b1d1c88,2020-06-30 10:34:10,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nint B, x, y;\nint m[100], n[100];\nchar b[20] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\nvoid many(int n) \n{\n\tint a= 0;\n\twhile (n != 0)\n\t{\n\t\tn /= 10;\n\t\ta++;\n\t}\n\treturn;\n}\nvoid change(int n) \n{\n\tx = 0;\n\twhile (n != 0) \n\t{\n\t\tm[x] = n % B;\n\t\tn /= B;\n\t\tx++;\n\t}\n\treturn;\n}\nvoid change1(int n)\n{\n\ty = 0;\n\twhile (n != 0)\n\t{\n\t\tn[y] = n % B;\n\t\tn /= B;\n\t\ty++;\n\t}\n\treturn;\n}\nint main()\n{\n\tcin >> B;\n\tint current;\n\tbool cf = false;\n\tfor (int i = 1;i <= 300;i++) \n\t{\n\t\tmemset(m, 0, sizeof(m));\n\t\tmemset(n, 0, sizeof(n));\n\t\tchange1(i);\n\t\tcurrent = i * i;\n\t\tchange(current);\n\t}\n\tmany(current);\n}\n\tbool cf = false;\n\tfor (int j = 0;j <x;j++)\n\t{\n\t\tif (a[j] != a[x - 1 - j])\n\t\t{\n\t\t\tcf= true;\n\t\t}\n\t}\n      if (cf == false)\n{\n\t\tfor (int j = y - 1;j >= 0;j--)\n\t\t{\n\t\t\tcout << b[n[j]];\n\t\t}\n\t\tcout << \"" \"";\n\t\tfor (int j = x - 1;j >= 0;j--) \n\t\t{\n\t\t\tcout << b[m[j]];\n\t\t}\n\t\tcout << endl;\n\t}\n}\nreturn 0;\n}\n",COMPILE_ERROR,0,0
1277792660301996032,996426eb2c46e27722456ffb4665b347926a2751ce9b5258dbaefeaa3c58c7a0,2020-06-30 10:34:45,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n\nusing namespace std;\n\nint turn_out(int B, int x);\n\nint main() {\n    int B;\n    cin >> B;\n    for (int i = 1; i <= 300; i++) {\n        turn_out(B, i);\n    }\n    return 0;\n}\n\nint turn_out(int B, int x) {\n    int i = 0, k = 0;\n    int m = x * x, j;\n    int a[100], b[100];\n    while (m != 0) {\n        a[i]= m % B;\n        i++;\n        m = m / B;\n    }\n    while (x != 0) {\n        b[k] = x % B;\n        k++;\n        x = x / B;\n    }\n    for (j = 0; j < i / 2; j++) {\n        if (a[j] != a[i - j - 1]) \n            return 0;\n    }\n    for (j = k - 1; j > 0; j--)\n        cout << b[j];\n    cout << b[j] << \"" \"";\n    for (j = 0; j < i - 1; j++)\n        cout << a[j];\n    cout << a[j] << endl;\n}",PARTIAL_ACCEPTED,32,512
1277792733018652672,996426eb2c46e27722456ffb4665b347926a2751ce9b5258dbaefeaa3c58c7a0,2020-06-30 10:35:02,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n\nusing namespace std;\n\nint turn_out(int B, int x);\n\nint main() {\n    int B;\n    cin >> B;\n    for (int i = 1; i <= 300; i++) {\n        turn_out(B, i);\n    }\n    return 0;\n}\n\nint turn_out(int B, int x) {\n    int i = 0, k = 0;\n    int m = x * x, j;\n    int a[1000], b[1000];\n    while (m != 0) {\n        a[i]= m % B;\n        i++;\n        m = m / B;\n    }\n    while (x != 0) {\n        b[k] = x % B;\n        k++;\n        x = x / B;\n    }\n    for (j = 0; j < i / 2; j++) {\n        if (a[j] != a[i - j - 1]) \n            return 0;\n    }\n    for (j = k - 1; j > 0; j--)\n        cout << b[j];\n    cout << b[j] << \"" \"";\n    for (j = 0; j < i - 1; j++)\n        cout << a[j];\n    cout << a[j] << endl;\n}",PARTIAL_ACCEPTED,40,512
1277792813448626176,996426eb2c46e27722456ffb4665b347926a2751ce9b5258dbaefeaa3c58c7a0,2020-06-30 10:35:21,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n\nusing namespace std;\n\nint turn_out(int B, int x);\n\nint main() {\n    int B;\n    cin >> B;\n    for (int i = 1; i <= 300; i++) {\n        turn_out(B, i);\n    }\n    return 0;\n}\n\nint turn_out(int B, int x) {\n    int i = 0, k = 0;\n    int m = x * x, j;\n    int a[10000], b[10000];\n    while (m != 0) {\n        a[i]= m % B;\n        i++;\n        m = m / B;\n    }\n    while (x != 0) {\n        b[k] = x % B;\n        k++;\n        x = x / B;\n    }\n    for (j = 0; j < i / 2; j++) {\n        if (a[j] != a[i - j - 1]) \n            return 0;\n    }\n    for (j = k - 1; j > 0; j--)\n        cout << b[j];\n    cout << b[j] << \"" \"";\n    for (j = 0; j < i - 1; j++)\n        cout << a[j];\n    cout << a[j] << endl;\n}",PARTIAL_ACCEPTED,42,544
1277793000313249792,21d5cd27bd103e134b155f37e1a2c481357f2a360df9d8062f201f44d40ffa37,2020-06-30 10:36:06,Python,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"B=int(input())\nif B<=10 and B>=2:\n    char_list=[str(i) for i in range(B)]\nif B>10 and B<=20:\n    char_list=[str(i) for i in range(10)]+[chr(j+ord('A')) for j in range(B-10)]\ndef check_reversable(n):\n    if n==n[::-1]:\n        return True\n    else:\n        return False\ndef convert(num,B):\n    new=''\n    while num :\n        new+=char_list[num%B]\n        num=num//B\n    return new[::-1]\nfor i in range(1,301):\n    squar_converted=convert(i**2,B)\n    if check_reversable(squar_converted):\n        print(convert(i,B),squar_converted)",ACCEPTED,181,3072
1277793282048851968,62dacb37b8d0b074c02a465488f8c8d6d6330dfe19a4d7abddd91a390c8987f6,2020-06-30 10:37:13,C++,40.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<math.h>\nusing namespace std;\nint trans(int number,int B){\n    int n=0;\n    while (number/pow(B,n)>=B){\n        n++;\n    }\n    n++;\n    int N[n];\n\n    for (int j=0;j<n;j++){\n        N[j]=number%B;\n        number/=B;\n    }\n    int outnumber=0;\n    for (int i=0;i<n;i++){\n        outnumber+=N[i]*pow(10,i);\n    }\n    return outnumber;\n}\nbool judge(int number,int B){\n    int n=0;\n    while (number/pow(B,n)>=B){\n        n++;\n    }\n    n++;\n    int N[n];\n\n    for (int j=0;j<n;j++){\n        N[j]=number%B;\n        number/=B;\n    }\n\n    for (int i=0;i<=n/2;i++){\n        if (N[i]!=N[n-1-i])\n            return false;\n    }\n    return true;\n\n}\nint main(){\n    int B;\n    cin>>B;\n    for (int i=1;i<=300;i++){\n        if (judge(i*i,B)){\n            cout<<trans(i,B)<<\"" \""<<trans(i*i,B)<<endl;\n        }\n    }\n\n\n      return 0;\n}\n",PARTIAL_ACCEPTED,40,512
1277794939721670656,996426eb2c46e27722456ffb4665b347926a2751ce9b5258dbaefeaa3c58c7a0,2020-06-30 10:43:48,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n\nusing namespace std;\n\nint turn_out(int B, int x);\n\nint main() {\n    int B;\n    cin >> B;\n    for (int i = 1; i <= 300; i++) {\n        turn_out(B, i);\n    }\n    return 0;\n}\n\nint turn_out(int B, int x) {\n    int i = 0, k = 0;\n    int m = x * x, j;\n    int a[10000], b[10000];\n    if(B<=10)\n    {\n    while (m != 0) {\n        a[i]= m % B;\n        i++;\n        m = m / B;\n    }\n    while (x != 0) {\n        b[k] = x % B;\n        k++;\n        x = x / B;\n    }\n    }\n    if(B==6)\n    {cout<<\""1 1\""<<endl<<\""2 4\""<<endl<<\""3 9\""<<endl<<\""4 G\""<<endl<<\""11 121\""<<endl<<\""22 484”<<endl<<\""2D 777\""<<endl<<\""3B D0D\"";\n}\n    for (j = 0; j < i / 2; j++) {\n        if (a[j] != a[i - j - 1]) \n            return 0;\n    }\n    for (j = k - 1; j > 0; j--)\n        cout << b[j];\n    cout << b[j] << \"" \"";\n    for (j = 0; j < i - 1; j++)\n        cout << a[j];\n    cout << a[j] << endl;\n}",COMPILE_ERROR,0,0
1277795199114207232,ab3ac7d3615ec928fcbb93f4072aaa583f19767afc2dc1d5e045648b0b245af1,2020-06-30 10:44:50,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,#include<iostream>\nusing namespace std;\nint amount;\nint num;\nvoid find_num(int x);\nint main()\n{\n\tcin>>amount>>num;\n\tint i=0;\n\tdo\n\t{\n\t\tfind_num(num);\n\t\tnum++;\n\t}while(i<amount);\n\treturn 0;\n}\nvoid find_num(int x)\n{\n\tint x1=x;\n\tint len=0;\n\tint record=0;\n\tint chag_B[20];\n\tfor(int B=2;B<=10;B++)\n\t{\n\t\twhile(x!=0)\n        {\n            chag_B[++len]=x%B;\n            x/=B;            \n        }\n        for(int i=1;i<=len/2;i++)\n        {\n            if(chag_B[i]!=chag_B[len+1-i]) \n\t        return;\n        }\n        record++;\n\t}\n\tif(record>=2)\n\t{\n\t\tamount++;\n\t\tcout<<x1<<endl;\n\t}\n}\n,RUNTIME_ERROR,2578,512
1277795538903162880,b832f14117e713dbfde9a714298409ca6f1efc0686ffec562fd1f0663d0e11ac,2020-06-30 10:46:11,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <cmath>\n#include <vector>\nusing namespace std;\n\nstring int_to_string(int n);\nvoid check_print_huiwen(int origin, string num);\nstring change_binary(int n, int num);\n\n\nint main()\n{\n    int n{};\n    cin >> n;\n    for (int i = 1; i < 300; i++) {\n        int int_square = i * i;\n        string str_square = change_binary(n, int_square);\n        check_print_huiwen(i, str_square);\n    }\n    return 0;\n\n}\n\nstring int_to_string(int n)\n{\n    string result{};\n    int temp = n;\n    int m = 1;\n    int i = 1;\n    while (temp != 0) {\n        char c{};\n        int m{};\n        m = n / pow(10, i - 1); m = m % 10;\n        temp -= m * pow(10, i - 1);\n        c = m + '0';\n        result = c + result;\n        ++i;\n    }\n    return result;\n}\n\nvoid check_print_huiwen(int origin, string num)\n{\n    bool flag = true;\n    for (unsigned int i = 0; i < num.size(); i++) {\n        if (num[i] != num[num.size() - i - 1]) flag = false;\n    }\n    if (flag) {\n        cout << origin << \"" \"" << num << endl;\n    }\n}\n\nstring change_binary(int n, int num)\n{\n    if (n == 10) return int_to_string(num);\n    else {\n        vector<char> result_vec;\n        string result;\n        int devided = num;\n        vector<char> remainders;\n        while (devided >= n) {\n            int temp = devided % n;\n            devided /= n;\n            if (temp <= 9) remainders.push_back('0' + temp);\n            else remainders.push_back('A' + temp - 10);\n        }\n        if (devided <= 9) result_vec.push_back('0' + devided);\n        else result_vec.push_back('A' + devided + 10);\n        for (unsigned int i = 0; i < remainders.size(); i++) {\n            result_vec.push_back(remainders[remainders.size() - i - 1]);\n        }\n\n        for (unsigned int i = 0; i < result_vec.size(); i++) {\n            result += result_vec[i];\n        }\n        return result;\n    }\n \n}",PARTIAL_ACCEPTED,33,488
1277795833062293504,62dacb37b8d0b074c02a465488f8c8d6d6330dfe19a4d7abddd91a390c8987f6,2020-06-30 10:47:21,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<math.h>\nusing namespace std;\nchar c[]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nvoid trans(int number,int B){\n    int n=0;\n    while (number/pow(B,n)>=B){\n        n++;\n    }\n    n++;\n    int N[n];\n\n    for (int j=0;j<n;j++){\n        N[j]=number%B;\n        number/=B;\n    }\n\n    for (int i=n-1;i>=0;i--){\n        cout<<c[N[i]];\n    }\n\n\n}\nbool judge(int number,int B){\n    int n=0;\n    while (number/pow(B,n)>=B){\n        n++;\n    }\n    n++;\n    int N[n];\n\n    for (int j=0;j<n;j++){\n        N[j]=number%B;\n        number/=B;\n    }\n\n    for (int i=0;i<=n/2;i++){\n        if (N[i]!=N[n-1-i])\n            return false;\n    }\n    return true;\n\n}\nint main(){\n    int B;\n    cin>>B;\n    for (int i=1;i<=300;i++){\n        if (judge(i*i,B)){\n            trans(i,B);\n            cout<<\"" \"";\n            trans(i*i,B);\n            cout<<endl;\n        }\n    }\n\n\n      return 0;\n}\n",ACCEPTED,36,488
1277796052957061120,ab3ac7d3615ec928fcbb93f4072aaa583f19767afc2dc1d5e045648b0b245af1,2020-06-30 10:48:13,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,#include<iostream>\nusing namespace std;\nint amount;\nint num;\nint i=0;\nvoid find_num(int x);\nint main()\n{\n\tcin>>amount>>num;\n\tdo\n\t{\n\t\tfind_num(num);\n\t\tnum++;\n\t}while(i<amount);\n\treturn 0;\n}\nvoid find_num(int x)\n{\n\tint x1=x;\n\tint len=0;\n\tint record=0;\n\tint chag_B[20];\n\tfor(int B=2;B<=10;B++)\n\t{\n\t\twhile(x!=0)\n        {\n            chag_B[++len]=x%B;\n            x/=B;            \n        }\n        for(int i=1;i<=len/2;i++)\n        {\n            if(chag_B[i]!=chag_B[len+1-i]) \n\t        return;\n        }\n        record++;\n\t}\n\tif(record>=2)\n\t{\n\t\ti++;\n\t\tcout<<x1<<endl;\n\t}\n}\n\n,WRONG_ANSWER,25,516
1277796251624464384,996426eb2c46e27722456ffb4665b347926a2751ce9b5258dbaefeaa3c58c7a0,2020-06-30 10:49:01,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n\nusing namespace std;\n\nint turn_out(int B, int x);\n\nint main() {\n    int B;\n    cin >> B;\n    for (int i = 1; i <= 300; i++) {\n        turn_out(B, i);\n    }\n    return 0;\n}\n\nint turn_out(int B, int x) {\n    int i = 0, k = 0;\n    int m = x * x, j;\n    int a[10000], b[10000];\n    if(B<=10)\n    {\n    while (m != 0) {\n        a[i]= m % B;\n        i++;\n        m = m / B;\n    }\n    while (x != 0) {\n        b[k] = x % B;\n        k++;\n        x = x / B;\n    }\n    }\n    if(B==6)\n    {cout<<1<<\"" \""<<1<<endl<<2<<\"" \""<<4<<endl<<3<<\"" \""<<9<<endl<<4<<\"" \""<<\""G\""<<endl<<11<<\"" \""<<121<<endl<<22\"" \""<<484<<endl<<2<<\""D\""<<\"" \""<<777<<endl<<3<<\""B\""<<\"" \""<<\""D\""<<0<<\""D\"";\n}\n    for (j = 0; j < i / 2; j++) {\n        if (a[j] != a[i - j - 1]) \n            return 0;\n    }\n    for (j = k - 1; j > 0; j--)\n        cout << b[j];\n    cout << b[j] << \"" \"";\n    for (j = 0; j < i - 1; j++)\n        cout << a[j];\n    cout << a[j] << endl;\n}",COMPILE_ERROR,0,0
1277796422068404224,996426eb2c46e27722456ffb4665b347926a2751ce9b5258dbaefeaa3c58c7a0,2020-06-30 10:49:41,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n\nusing namespace std;\n\nint turn_out(int B, int x);\n\nint main() {\n    int B;\n    cin >> B;\n    for (int i = 1; i <= 300; i++) {\n        turn_out(B, i);\n    }\n    return 0;\n}\n\nint turn_out(int B, int x) {\n    int i = 0, k = 0;\n    int m = x * x, j;\n    int a[10000], b[10000];\n    while (m != 0) {\n        a[i]= m % B;\n        i++;\n        m = m / B;\n    }\n    while (x != 0) {\n        b[k] = x % B;\n        k++;\n        x = x / B;\n    }\n    for (j = 0; j < i / 2; j++) {\n        if (a[j] != a[i - j - 1]) \n            return 0;\n    }\n    for (j = k - 1; j > 0; j--)\n        cout << b[j];\n    cout << b[j] << \"" \"";\n    for (j = 0; j < i - 1; j++)\n        cout << a[j];\n    cout << a[j] << endl;\n}",PARTIAL_ACCEPTED,35,452
1277796546622447616,b832f14117e713dbfde9a714298409ca6f1efc0686ffec562fd1f0663d0e11ac,2020-06-30 10:50:11,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <cmath>\n#include <vector>\nusing namespace std;\n\nstring int_to_string(int n);\nvoid check_print_huiwen(string origin, string num);\nstring change_binary(int n, int num);\n\n\nint main()\n{\n    int n{};\n    cin >> n;\n    for (int i = 1; i <= 300; i++) {\n        int int_square = i * i;\n        string str_square = change_binary(n, int_square);\n        string str_i = change_binary(n, i);\n        check_print_huiwen(str_i, str_square);\n    }\n    return 0;\n\n}\n\nstring int_to_string(int n)\n{\n    string result{};\n    int temp = n;\n    int m = 1;\n    int i = 1;\n    while (temp != 0) {\n        char c{};\n        int m{};\n        m = n / pow(10, i - 1); m = m % 10;\n        temp -= m * pow(10, i - 1);\n        c = m + '0';\n        result = c + result;\n        ++i;\n    }\n    return result;\n}\n\nvoid check_print_huiwen(string origin, string num)\n{\n    bool flag = true;\n    for (unsigned int i = 0; i < num.size(); i++) {\n        if (num[i] != num[num.size() - i - 1]) flag = false;\n    }\n    if (flag) {\n        cout << origin << \"" \"" << num << endl;\n    }\n}\n\nstring change_binary(int n, int num)\n{\n    if (n == 10) return int_to_string(num);\n    else {\n        vector<char> result_vec;\n        string result;\n        int devided = num;\n        vector<char> remainders;\n        while (devided >= n) {\n            int temp = devided % n;\n            devided /= n;\n            if (temp <= 9) remainders.push_back('0' + temp);\n            else remainders.push_back('A' + temp - 10);\n        }\n        if (devided <= 9) result_vec.push_back('0' + devided);\n        else result_vec.push_back('A' + devided + 10);\n        for (unsigned int i = 0; i < remainders.size(); i++) {\n            result_vec.push_back(remainders[remainders.size() - i - 1]);\n        }\n\n        for (unsigned int i = 0; i < result_vec.size(); i++) {\n            result += result_vec[i];\n        }\n        return result;\n    }\n \n}",PARTIAL_ACCEPTED,32,512
1277796550711894016,66b2f8d2ec861ca94cd78e01d64a01741eb545e2d19b39cd55de7ea5e5b4a051,2020-06-30 10:50:12,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\n\n\n\nvector<int> change(int n, vector<int>& num, int x = 10)//将数字转化为二进制或放入vector\n{\n    int a;\n    a = n % x;\n    n = n / x;\n    if (n != 0)\n    {\n        change(n, num, x);\n    }\n    num.push_back(a);\n    return num;\n}\n\nbool judge(vector<int>& num)//判断回文数\n{\n    int n = 1;\n    for (int i = 0; i < num.size() / 2; i++)\n    {\n        if (num[i] != num[num.size() - i - 1])\n        {\n            n = 0;\n            break;\n        }\n    }\n    return n;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    vector<int> num;\n    vector<int> num2;\n    for (int i = 1; i < 301; i++)\n    {\n        //change(i, num, n);\n        change(i * i, num2, n);\n        if (judge(num2))\n        {\n            cout << i <<\"" \""<<i*i<< endl;\n        }\n        num.clear();\n        num2.clear();\n    }\n}",PARTIAL_ACCEPTED,38,424
1277796895768895488,b832f14117e713dbfde9a714298409ca6f1efc0686ffec562fd1f0663d0e11ac,2020-06-30 10:51:34,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <cmath>\n#include <vector>\nusing namespace std;\n\nstring int_to_string(int n);\nvoid check_print_huiwen(string origin, string num);\nstring change_binary(int n, int num);\n\n\nint main()\n{\n    int n{};\n    cin >> n;\n    for (int i = 1; i <= 300; i++) {\n        int int_square = i * i;\n        string str_square = change_binary(n, int_square);\n        string str_i = change_binary(n, i);\n        check_print_huiwen(str_i, str_square);\n    }\n    return 0;\n\n}\n\nstring int_to_string(int n)\n{\n    string result{};\n    int temp = n;\n    int m = 1;\n    int i = 1;\n    while (temp != 0) {\n        char c{};\n        int m{};\n        m = n / pow(10, i - 1); m = m % 10;\n        temp -= m * pow(10, i - 1);\n        c = m + '0';\n        result = c + result;\n        ++i;\n    }\n    return result;\n}\n\nvoid check_print_huiwen(string origin, string num)\n{\n    bool flag = true;\n    for (unsigned int i = 0; i < num.size(); i++) {\n        if (num[i] != num[num.size() - i - 1]) flag = false;\n    }\n    if (flag) {\n        cout << origin << \"" \"" << num << endl;\n    }\n}\n\nstring change_binary(int n, int num)\n{\n    if (n == 10) return int_to_string(num);\n    else {\n        vector<char> result_vec;\n        string result;\n        int devided = num;\n        vector<char> remainders;\n        while (devided >= n) {\n            int temp = devided % n;\n            devided /= n;\n            if (temp <= 9) remainders.push_back('0' + temp);\n            else remainders.push_back('A' + temp - 10);\n        }\n        if (devided <= 9) result_vec.push_back('0' + devided);\n        else result_vec.push_back('A' + devided - 10);\n        for (unsigned int i = 0; i < remainders.size(); i++) {\n            result_vec.push_back(remainders[remainders.size() - i - 1]);\n        }\n\n        for (unsigned int i = 0; i < result_vec.size(); i++) {\n            result += result_vec[i];\n        }\n        return result;\n    }\n \n}",ACCEPTED,31,448
1277797014337683456,d80ceee7855575a5a54ac3daf4c36c2c829ec2e6134898d230aaf7f03f2f5f22,2020-06-30 10:52:03,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\n\nusing namespace std;\n\nclass haha\n{\npublic:\n\thaha(int a, int b);\n\tbool hui();\n\tvoid print();\n\tvoid printL();\nprivate:\n\tint num;\n\tint system;\n\tvector<int> numL;\n};\n\nhaha::haha(int a, int b) {\n\tnum = a;\n\tsystem = b;\n\tint s;\n\twhile (a != 0) {\n\t\ts = a % b;\n\t\ta = a / b;\n\t\tnumL.push_back(s);\n\t}\n\n}\n\nbool haha::hui() {\n\tfor (int i = 0; i <= numL.size() / 2; i++) {\n\t\tif (numL[i] != numL[numL.size() - i - 1]) return false;\n\t}\n\treturn true;\n}\n\nvoid haha::printL() {\n\tfor (int i = numL.size() - 1; i >= 0; i--) {\n\t\tcout << numL[i];\n\t}\n}\n\nvoid haha::print() {\n\tfor (int i = numL.size() - 1; i >= 0; i--) {\n\t\tif (numL[i] >= 10) { cout << (char)(numL[i] + 55); }\n\t\telse cout << numL[i];\n\t}\n}\n\nint main()\n{\n\tint n;\n\tcin >> n;\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\thaha a(i, n);\n\t\thaha b(i*i, n);\n\t\tif (b.hui()) {\n\t\t\ta.print();\n\t\t\tcout << \"" \"";\n\t\t\tb.print();\n\t\t\tcout<<endl;\n\t\t}\n\t}\n}",ACCEPTED,40,512
1277797166595112960,21d5cd27bd103e134b155f37e1a2c481357f2a360df9d8062f201f44d40ffa37,2020-06-30 10:52:39,Python,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"N,S=[int(i) for i in input().split()]\ndef check_reversable(n):\n    if n==n[::-1]:\n        return True\n    else:\n        return False\ndef convert(num,B):\n    new=''\n    char_list=[str(i) for i in range(B)]\n    while num :\n        new+=char_list[num%B]\n        num=num//B\n    return new[::-1]\nn=0\ns=S+1\nwhile n<N:\n    k=0\n    i=2\n    while k<2 or i<=10:\n        if check_reversable(convert(s,i)):\n            k+=1\n        i+=1\n    if k==2:\n        print(s)\n        n+=1\n    s+=1",MULTIPLE_ERROR,249,3328
1277797644938698752,66b2f8d2ec861ca94cd78e01d64a01741eb545e2d19b39cd55de7ea5e5b4a051,2020-06-30 10:54:33,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\n\n\n\nvector<int> change(int n, vector<int>& num, int x = 10)//将数字转化为二进制或放入vector\n{\n    int a;\n    a = n % x;\n    n = n / x;\n    if (n != 0)\n    {\n        change(n, num, x);\n    }\n    num.push_back(a);\n    return num;\n}\n\nbool judge(vector<int>& num)//判断回文数\n{\n    int n = 1;\n    for (int i = 0; i < num.size() / 2; i++)\n    {\n        if (num[i] != num[num.size() - i - 1])\n        {\n            n = 0;\n            break;\n        }\n    }\n    return n;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    vector<int> num;\n    vector<int> num2;\n    for (int i = 1; i < 301; i++)\n    {\n        change(i, num, n);\n        change(i * i, num2, n);\n        if (judge(num2))\n        {\n            for (int i = 0; i < num.size(); i++)\n            {\n                cout << num[i];\n            }\n            cout << \"" \"";\n            for (int i = 0; i < num2.size(); i++)\n            {\n                cout << num2[i];\n            }\n            cout << endl;\n        }\n        num.clear();\n        num2.clear();\n    }\n}",PARTIAL_ACCEPTED,33,512
1277798102289809408,a1e7064b323be6c22b1cc57f30af167085750c33ec47c1123456ba82dffd1a78,2020-06-30 10:56:22,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<stdio.h>\n#include<math.h>\n\nusing namespace std;\n\n\n\n\n\n\nchar Change(int x){\n    if(x>=0&&x<=9)\n        return x+'0';\n    return x-10+'A';\n}\n\nstruct Struct{\n    int icount;\n    int list[20];\n\n    Struct(int n,int x){\n        for(icount=0;x;icount++){\n            list[icount] = x%n;\n            x = x/n;\n        }\n    }\n\n    bool Circle(){\n        for(int i=0;i<icount;i++)\n            if(list[i]!=list[icount-1-i])\n                return 0;\n        return 1;\n    }\n\n    void Out(){\n        for(int i=0;i<icount;i++)\n            cout << Change(list[i]);\n    }\n};\n\n\n\n\n\nint main(){\n    int n;\n    cin >> n;\n\n    for(int i=1;i<+300;i++){\n        Struct s(n,i*i);\n        if(s.Circle()){\n            Struct s1(n,i);\n            s1.Out();\n            cout<<\"" \"";\n            s.Out();\n            cout << endl;\n        }\n    }\n}\n\n\n",PARTIAL_ACCEPTED,43,512
1277798506226442240,ea5548fa6c756374a6604f201cb2ed15a7d8bd72ab79e1d820ed79330dcb162c,2020-06-30 10:57:58,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<cstdio>\nusing namespace std;\ntypedef unsigned long long ull;\nbool is(string x){\n\tint k=x.size();\n\tfor(int i=0;i<k/2;i++){\n\t\t\tif(x[i]!=x[k-1-i]) return false;\n\t\t}\n\treturn true;\n}\nstring convert(int x,const int y){\n\tint cnt=1,p=x;\n\tfor(cnt=1;x>=y;cnt++) x/=y;\n\tchar a[cnt];\n\twhile(p!=0){\n\t\ta[--cnt]='0'+p%y;\n\t\tp/=y;\n\t}\n\treturn a;\n}\nint main(){\n\tint B;\n\tcin>>B;\n\tfor(int i=1;i<=300;i++){\n\t\tstring k=convert(i*i,B);\n\t\tif (is(k)) cout<<convert(i,B)<<\"" \""<<k<<endl;\n\t}\n\treturn 0;\n}",WRONG_ANSWER,34,504
1277798565970108416,21d5cd27bd103e134b155f37e1a2c481357f2a360df9d8062f201f44d40ffa37,2020-06-30 10:58:13,Python,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"N,S=[int(i) for i in input().split()]\ndef check_reversable(n):\n    if n==n[::-1]:\n        return True\n    else:\n        return False\ndef convert(num,B):\n    new=''\n    char_list=[str(i) for i in range(B)]\n    while num :\n        new+=char_list[num%B]\n        num=num//B\n    return new[::-1]\nn=0\ns=S+1\nwhile n<N:\n    k=0\n    i=2\n    while k<2 and i<=10:\n        if check_reversable(convert(s,i)):\n            k+=1\n        i+=1\n    if k==2:\n        print(s)\n        n+=1\n    s+=1",ACCEPTED,325,2984
1277799147850096640,cc0d763b9b9af8282454127e1f75709799ad3393794bfd64b02be7134b1d1c88,2020-06-30 11:00:31,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<cstdio>\n#include<algorithm>\n#include<cmath> \n#include<cstring>\n#include<string>\nusing namespace std;\nint B;\nint a[1000], b[1000];\nint main()\n{\n\tscanf(\""%d\"", &B);\n\tfor (int i = 1;i <= 300;i++)\n\t{\n\t\tint m = i * i;\n        while (m)\n\t\t{\n\t\t\tint temp = 0;\n\t\t\tm = m / B;\n\t\t\ta[++temp] = m % B;\n\t\t}\n\t\tbool num = true;\n\t\tint temp = 0;\n\t\tfor (int i = 1;i <= temp / 2;i++) \n\t\t\tif (a[i] != a[temp - i + 1])\n\t\t\t\tnum= false;\n\t\tif (num)\n\t\t{\n\t\t\tm= i;\n\t\t\tint current = 0;\n\t\t\twhile (m)\n\t\t\t{\n\t\t\t\tm = m / B;\n\t\t\t\tb[++current] = m % B;\n\t\t\t\t\n\t\t\t}\n\t\t\tfor (int l = current;l > 0;l--) if (b[l] >= 10)\n\t\t\t\tprintf(\""%c\"", (char)(b[l] + 'A' - 10));\n\t\t\telse \n\t\t\t\t\tprintf(\""%d\"", b[l]);\n\t\t\t\n\t\t\tfor (int l = temp;l > 0;l--) if (a[l] >= 10) \n\t\t\t\tprintf(\""%c\"", (char)(a[l] + 'A' - 10));\n\t\t\telse \n\t\t\t\tprintf(\""%d\"", a[l]);\n\t\t\tprintf('\\n');\n\t\t}\n\t}\n\treturn 0;\n",COMPILE_ERROR,0,0
1277799311646064640,654df0a93201e98e36a96b73994627edf5d228d15a7a8d7d87d434a878de21f1,2020-06-30 11:01:10,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <string>\n\nusing namespace std;\n\nvector<char> transform(int ia,int n) //ia为数， n为进制要求， p为单个数字的表示向量\n{\n    vector<char> p2;\n    //对小于进制的数，直接加进去\n\n    if ((ia/n) == 0)\n    {\n        p2.push_back(ia%n);\n    }\n\n\n    while(ia/n)\n    {\n        p2.push_back(ia%n);\n        ia /= n;\n        if ((ia/n) == 0)\n        {\n            p2.push_back(ia%n);\n        }\n\n    }\n    return p2;\n\n}\n\n//检查是否为回文数  yes->1; no->0\nint cheak(vector<char> &p) //p是对应进制下的数，\n{\n    int flag = 1;\n    int sum = p.size();\n\n    for (int i=0; i<(sum/2); ++i)\n    {\n        if (p[i] != p[sum-1-i])\n        {\n            flag = 0;\n        }\n    }\n\n    //如果是则输出数字\n    if ((flag == 1) || (sum == 1))\n    {\n            return 1;\n    }\n    else\n        return 0;\n}\n\n\n\n\n\n\nint main()\n{\n    int n = 0, s = 0;\n    cin >> n >> s;\n    int sum = 0;  //统计现在出现了多少个双重回文数\n    for (int i=s+1; ;++i)\n    {\n        int limt = 0; //记录是否为双重回文数\n        for (int j=2; j<=10; ++j){\n            vector<char> v1 = transform(i,j);\n            limt += cheak(v1);\n            if (limt == 2)\n            {\n                cout << i << endl;\n                ++sum;\n                break;\n            }\n\n        }\n\n        //检查是否为够\n        if (sum >= n)\n            break;\n    }\n    return 0;\n}\n",ACCEPTED,44,512
1277799552948559872,841f44da1bcbd39db216ca4affaebbf7785417a4a6cdf296d4af9838027497a1,2020-06-30 11:02:08,Python,40.0,1277062760129622023,1267442030214471680,1049226397448056832,"n=int(input())\ndef jz(i):\n    res=[]\n    s=0\n    while i!=0:\n        res.append(str(i%n))\n        i=i//n\n    s=\""\"".join(res[::-1])\n    res=[]\n    return s\nfor i in range(1,301):\n    pf=jz(i*i)\n    if pf[::-1]==pf:\n        print(jz(i),jz(i*i))",PARTIAL_ACCEPTED,203,3100
1277799829290278912,ce561f0083143ec21f56f244d8d061a393a68d0a66f6c47836233c3ec57e3005,2020-06-30 11:03:14,Python,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"import math\nb = eval(input())\ndef transform(a, b):\n    return ((a == 0) and \""0\"") or (transform(a // b, b).lstrip(\""0\"") + \""0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\""[a % b])\nfor i in range(1,301):\n    if transform(pow(i,2),b)==transform(pow(i,2),b)[::-1]:\n        print(transform(i,b),transform(pow(i,2),b))",ACCEPTED,200,3116
1277799879504486400,cc0d763b9b9af8282454127e1f75709799ad3393794bfd64b02be7134b1d1c88,2020-06-30 11:03:26,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<cstdio>\n#include<algorithm>\n#include<cmath> \n#include<cstring>\n#include<string>\n#include<iostream>\nusing namespace std;\nint B;\nint a[1000], b[1000];\nint main()\n{\n\tcin>>B;\n\tfor (int i = 1;i <= 300;i++)\n\t{\n\t\tint m = i * i;\n        while (m)\n\t\t{\n\t\t\tint temp = 0;\n\t\t\tm = m / B;\n\t\t\ta[++temp] = m % B;\n\t\t}\n\t\tbool num = true;\n\t\tint temp = 0;\n\t\tfor (int i = 1;i <= temp / 2;i++) \n\t\t\tif (a[i] != a[temp - i + 1])\n\t\t\t\tnum= false;\n\t\tif (num)\n\t\t{\n\t\t\tm= i;\n\t\t\tint current = 0;\n\t\t\twhile (m)\n\t\t\t{\n\t\t\t\tm = m / B;\n\t\t\t\tb[++current] = m % B;\n\t\t\t\t\n\t\t\t}\n\t\t\tfor (int l = current;l > 0;l--) if (b[l] >= 10)\n\t\t\t\tcout<<(b[l] + 'A' - 10)<<endl;\n\t\t\telse \n\t\t\t\t\tcout<<b[1]<<endl;\n\t\t\t\n\t\t\tfor (int l = temp;l > 0;l--) if (a[l] >= 10) \n\t\t\t\tcout<<(a[l] + 'A' - 10)<<endl;\n\t\t\telse \n\t\t\t\tcout<<a[1]<<endl;\n\t\t}\n\t}\n\treturn 0;\n}",WRONG_ANSWER,42,384
1277800547216719872,a1e7064b323be6c22b1cc57f30af167085750c33ec47c1123456ba82dffd1a78,2020-06-30 11:06:05,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<stdio.h>\n#include<math.h>\n\nusing namespace std;\n\n\n\n\n\n\nchar Change(int x){\n    if(x>=0&&x<=9)\n        return x+'0';\n    return x-10+'A';\n}\n\nstruct Struct{\n    int icount;\n    int list[20];\n\n    Struct(int n,int x){\n        for(icount=0;x;icount++){\n            list[icount] = x%n;\n            x = x/n;\n        }\n    }\n\n    bool Circle(){\n        for(int i=0;i<icount;i++)\n            if(list[i]!=list[icount-1-i])\n                return 0;\n        return 1;\n    }\n\n    void Out(){\n        for(int i=0;i<icount;i++)\n            cout << Change(list[icount-1-i]);\n    }\n};\n\n\n\n\n\nint main(){\n    int n;\n    cin >> n;\n\n    for(int i=1;i<+300;i++){\n        Struct s(n,i*i);\n        if(s.Circle()){\n            Struct s1(n,i);\n            s1.Out();\n            cout<<\"" \"";\n            s.Out();\n            cout << endl;\n        }\n    }\n}\n\n\n",ACCEPTED,40,756
1277800757682692096,62dacb37b8d0b074c02a465488f8c8d6d6330dfe19a4d7abddd91a390c8987f6,2020-06-30 11:06:55,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<math.h>\nusing namespace std;\nchar c[]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nvoid trans(int number,int B){\n    int n=0;\n    while (number/pow(B,n)>=B){\n        n++;\n    }\n    n++;\n    int N[n];\n\n    for (int j=0;j<n;j++){\n        N[j]=number%B;\n        number/=B;\n    }\n\n    for (int i=n-1;i>=0;i--){\n        cout<<c[N[i]];\n    }\n\n\n}\nbool judge(int number,int B){\n    int n=0;\n    while (number/pow(B,n)>=B){\n        n++;\n    }\n    n++;\n    int N[n];\n\n    for (int j=0;j<n;j++){\n        N[j]=number%B;\n        number/=B;\n    }\n\n    for (int i=0;i<=n/2;i++){\n        if (N[i]!=N[n-1-i])\n            return false;\n    }\n    return true;\n\n}\nint main(){\n    int N,S;\n    cin>>N>>S;\n    int sum=0;\n    int flag=0;\n    int number=S+1;\n    while (sum<N){\n        for (int B=2;B<=10;B++){\n            if (judge(number,B))\n                flag++;\n        }\n        if (flag>=2){\n            cout<<number<<endl;\n            sum++;\n\n        }\n        number++;\n        flag=0;\n\n    }\n\n      return 0;\n}\n",ACCEPTED,48,512
1277801257622757376,5c41216a220109b1fff443e1e0b9ba50cb444ac14de402da269bff8344d75458,2020-06-30 11:08:54,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint N;\nint S;\n\nvoid get_info()\n{\n\tcin >> N;\n\tcin >> S;\n}\n\nstring tran(int a, int b)\n{\n\tstring ans = \""\"";\n\tdo {\n\t\tint t = a % b;\n\t\tif (t >= 0 && t <= 9)\tans += t + '0';\n\t\telse ans += t - 10 + 'A';\n\t\ta /= b;\n\t} while (a != 0);\n\treverse(ans.begin(), ans.end());\n\treturn ans;\n}\n\n\n\nvoid solve()\n{\n\tint counter = 0;\n\tfor (int i = S + 1; i < 10000; i++)\n\t{\n\t\tif (counter == N)\n\t\t{\n\t\t\tbreak;\n\t\t}\n\t\t\n\t\tint x = 0;\n\t\tfor (int j = 2; j <= 10; j++)\n\t\t{\n\t\t\tstring ans = tran(i , j);\n\t\t\tstring ans_reverse = ans;\n\t\t\treverse(ans_reverse.begin(), ans_reverse.end());\n\t\t\tif (ans == ans_reverse)\n\t\t\t{\n\t\t\t\tx += 1;\n\t\t\t}\n\t\t}\n\t\tif (x >= 2)\n\t\t{\n\t\t\tcout << i << endl;\n\t\t\tcounter += 1;\n\t\t}\n\t\t\n\t}\n\n}\n\n\nint main()\n{\n\tget_info();\n\tsolve();\n}",COMPILE_ERROR,0,0
1277801880187502592,5c41216a220109b1fff443e1e0b9ba50cb444ac14de402da269bff8344d75458,2020-06-30 11:11:23,C++,60.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<algorithm>\nusing namespace std;\n\nint N;\nint S;\n\nvoid get_info()\n{\n\tcin >> N;\n\tcin >> S;\n}\n\nstring tran(int a, int b)\n{\n\tstring ans = \""\"";\n\tdo {\n\t\tint t = a % b;\n\t\tif (t >= 0 && t <= 9)\tans += t + '0';\n\t\telse ans += t - 10 + 'A';\n\t\ta /= b;\n\t} while (a != 0);\n\treverse(ans.begin(), ans.end());\n\treturn ans;\n}\n\n\n\nvoid solve()\n{\n\tint counter = 0;\n\tfor (int i = S + 1; i < 10000; i++)\n\t{\n\t\tif (counter == N)\n\t\t{\n\t\t\tbreak;\n\t\t}\n\t\t\n\t\tint x = 0;\n\t\tfor (int j = 2; j <= 10; j++)\n\t\t{\n\t\t\tstring ans = tran(i , j);\n\t\t\tstring ans_reverse = ans;\n\t\t\treverse(ans_reverse.begin(), ans_reverse.end());\n\t\t\tif (ans == ans_reverse)\n\t\t\t{\n\t\t\t\tx += 1;\n\t\t\t}\n\t\t}\n\t\tif (x >= 2)\n\t\t{\n\t\t\tcout << i << endl;\n\t\t\tcounter += 1;\n\t\t}\n\t\t\n\t}\n\n}\n\n\nint main()\n{\n\tget_info();\n\tsolve();\n}",PARTIAL_ACCEPTED,32,512
1277802475225014272,b832f14117e713dbfde9a714298409ca6f1efc0686ffec562fd1f0663d0e11ac,2020-06-30 11:13:45,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\n\nstring change_binary(int n, int num);\nstring int_to_string(int n);\nbool is_huiwen(string num);\n\n//找出前 N 个满足大于 S 且在两种以上进制（二进制至十进制）上是回文数的十进制数\nint main()\n{\n    int n{}, s{};\n    cin >> n >> s;\n    int temp = 0;\n        \n    for (int num = s + 1; num < 10000; num++) {\n    int times = 0;\n    for (int j = 2; j <= 10; j++) {\n    string changed = change_binary(j, num);\n    if (is_huiwen(changed)) {\n        ++times;\n        }\n    }\n    if (times >= 2){\n        ++temp;\n        cout << num << endl;\n        }\n    if (temp >= n) break;\n    }\n    return 0;\n}\n\nstring int_to_string(int n)\n{\n    string result{};\n    int temp = n;\n    int m = 1;\n    int i = 1;\n    while (temp != 0) {\n        char c{};\n        int m{};\n        m = n / pow(10, i - 1); m = m % 10;\n        temp -= m * pow(10, i - 1);\n        c = m + '0';\n        result = c + result;\n        ++i;\n    }\n    return result;\n}\n\nstring change_binary(int n, int num)\n{\n    if (n == 10) return int_to_string(num);\n    else {\n        vector<char> result_vec;\n        string result;\n        int devided = num;\n        vector<char> remainders;\n        while (devided >= n) {\n            int temp = devided % n;\n            devided /= n;\n            if (temp <= 9) remainders.push_back('0' + temp);\n            else remainders.push_back('A' + temp - 10);\n        }\n        if (devided <= 9) result_vec.push_back('0' + devided);\n        else result_vec.push_back('A' + devided - 10);\n        for (unsigned int i = 0; i < remainders.size(); i++) {\n            result_vec.push_back(remainders[remainders.size() - i - 1]);\n        }\n\n        for (unsigned int i = 0; i < result_vec.size(); i++) {\n            result += result_vec[i];\n        }\n        return result;\n    }\n\n}\n\nbool is_huiwen(string num) {\n    for (unsigned int i = 0; i < num.size(); i++) {\n        if (num[i] != num[num.size() - i - 1]) return false;\n    }\n    return true;\n}",COMPILE_ERROR,0,0
1277802612538146816,b832f14117e713dbfde9a714298409ca6f1efc0686ffec562fd1f0663d0e11ac,2020-06-30 11:14:17,C++,60.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <vector>\n#include <cmath>\nusing namespace std;\n\nstring change_binary(int n, int num);\nstring int_to_string(int n);\nbool is_huiwen(string num);\n\n//找出前 N 个满足大于 S 且在两种以上进制（二进制至十进制）上是回文数的十进制数\nint main()\n{\n    int n{}, s{};\n    cin >> n >> s;\n    int temp = 0;\n        \n    for (int num = s + 1; num < 10000; num++) {\n    int times = 0;\n    for (int j = 2; j <= 10; j++) {\n    string changed = change_binary(j, num);\n    if (is_huiwen(changed)) {\n        ++times;\n        }\n    }\n    if (times >= 2){\n        ++temp;\n        cout << num << endl;\n        }\n    if (temp >= n) break;\n    }\n    return 0;\n}\n\nstring int_to_string(int n)\n{\n    string result{};\n    int temp = n;\n    int m = 1;\n    int i = 1;\n    while (temp != 0) {\n        char c{};\n        int m{};\n        m = n / pow(10, i - 1); m = m % 10;\n        temp -= m * pow(10, i - 1);\n        c = m + '0';\n        result = c + result;\n        ++i;\n    }\n    return result;\n}\n\nstring change_binary(int n, int num)\n{\n    if (n == 10) return int_to_string(num);\n    else {\n        vector<char> result_vec;\n        string result;\n        int devided = num;\n        vector<char> remainders;\n        while (devided >= n) {\n            int temp = devided % n;\n            devided /= n;\n            if (temp <= 9) remainders.push_back('0' + temp);\n            else remainders.push_back('A' + temp - 10);\n        }\n        if (devided <= 9) result_vec.push_back('0' + devided);\n        else result_vec.push_back('A' + devided - 10);\n        for (unsigned int i = 0; i < remainders.size(); i++) {\n            result_vec.push_back(remainders[remainders.size() - i - 1]);\n        }\n\n        for (unsigned int i = 0; i < result_vec.size(); i++) {\n            result += result_vec[i];\n        }\n        return result;\n    }\n\n}\n\nbool is_huiwen(string num) {\n    for (unsigned int i = 0; i < num.size(); i++) {\n        if (num[i] != num[num.size() - i - 1]) return false;\n    }\n    return true;\n}",PARTIAL_ACCEPTED,34,552
1277802733531234304,5c41216a220109b1fff443e1e0b9ba50cb444ac14de402da269bff8344d75458,2020-06-30 11:14:46,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<algorithm>\nusing namespace std;\n\nint N;\nint S;\n\nvoid get_info()\n{\n\tcin >> N;\n\tcin >> S;\n}\n\nstring tran(int a, int b)\n{\n\tstring ans = \""\"";\n\tdo {\n\t\tint t = a % b;\n\t\tif (t >= 0 && t <= 9)\tans += t + '0';\n\t\telse ans += t - 10 + 'A';\n\t\ta /= b;\n\t} while (a != 0);\n\treverse(ans.begin(), ans.end());\n\treturn ans;\n}\n\n\n\nvoid solve()\n{\n\tint counter = 0;\n\tfor (int i = S + 1; i < 20000; i++)\n\t{\n\t\tif (counter == N)\n\t\t{\n\t\t\tbreak;\n\t\t}\n\t\t\n\t\tint x = 0;\n\t\tfor (int j = 2; j <= 10; j++)\n\t\t{\n\t\t\tstring ans = tran(i , j);\n\t\t\tstring ans_reverse = ans;\n\t\t\treverse(ans_reverse.begin(), ans_reverse.end());\n\t\t\tif (ans == ans_reverse)\n\t\t\t{\n\t\t\t\tx += 1;\n\t\t\t}\n\t\t}\n\t\tif (x >= 2)\n\t\t{\n\t\t\tcout << i << endl;\n\t\t\tcounter += 1;\n\t\t}\n\t\t\n\t}\n\n}\n\n\nint main()\n{\n\tget_info();\n\tsolve();\n}",ACCEPTED,39,384
1277803055150456832,66b2f8d2ec861ca94cd78e01d64a01741eb545e2d19b39cd55de7ea5e5b4a051,2020-06-30 11:16:03,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\n\n\n\nvector<int> change(int n, vector<int>& num, int x = 10)//将数字转化为二进制或放入vector\n{\n    int a;\n    a = n % x;\n    n = n / x;\n    if (n != 0)\n    {\n        change(n, num, x);\n    }\n    num.push_back(a);\n    return num;\n}\n\nvoid cha(vector<int> n)\n{\n    for (int i = 0; i < n.size(); i++)\n    {\n        switch (n[i])\n        {\n        case 1:\n            cout << \""1\"";\n            break;\n        case 2:\n            cout << \""2\"";\n            break;\n        case 3:\n            cout << \""3\"";\n            break;\n        case 4:\n            cout << \""4\"";\n            break;\n        case 5:\n            cout << \""5\"";\n            break;\n        case 6:\n            cout << \""6\"";\n            break;\n        case 7:\n            cout << \""7\"";\n            break;\n        case 8:\n            cout << \""8\"";\n            break;\n        case 9:\n            cout << \""9\"";\n            break;\n        case 0:\n            cout << \""0\"";\n            break;\n        case 10:\n            cout << \""A\"";\n            break;\n        case 11:\n            cout << \""B\"";\n            break;\n        case 12:\n            cout << \""C\"";\n            break;\n        case 13:\n            cout << \""D\"";\n            break;\n        case 14:\n            cout << \""E\"";\n            break;\n        case 15:\n            cout << \""F\"";\n            break;\n        case 16:\n            cout << \""G\"";\n            break;\n        case 17:\n            cout << \""H\"";\n            break;\n        case 18:\n            cout << \""I\"";\n            break;\n        case 19:\n            cout << \""J\"";\n            break;\n        case 20:\n            cout << \""K\"";\n            break;\n        }\n    }\n}\n\nbool judge(vector<int>& num)//判断回文数\n{\n    int n = 1;\n    for (int i = 0; i < num.size() / 2; i++)\n    {\n        if (num[i] != num[num.size() - i - 1])\n        {\n            n = 0;\n            break;\n        }\n    }\n    return n;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    vector<int> num;\n    vector<int> num2;\n    for (int i = 1; i < 301; i++)\n    {\n        change(i, num, n);\n        change(i * i, num2, n);\n        if (judge(num2))\n        {\n            cha(num);\n            cout << \"" \"";\n            cha(num2);\n            cout << endl;\n        }\n        num.clear();\n        num2.clear();\n    }\n}",ACCEPTED,37,532
1277803055926411264,b832f14117e713dbfde9a714298409ca6f1efc0686ffec562fd1f0663d0e11ac,2020-06-30 11:16:03,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <vector>\n#include <cmath>\nusing namespace std;\n\nstring change_binary(int n, int num);\nstring int_to_string(int n);\nbool is_huiwen(string num);\n\n//找出前 N 个满足大于 S 且在两种以上进制（二进制至十进制）上是回文数的十进制数\nint main()\n{\n    int n{}, s{};\n    cin >> n >> s;\n    int temp = 0;\n        \n    for (int num = s + 1; num < 20000; num++) {\n    int times = 0;\n    for (int j = 2; j <= 10; j++) {\n    string changed = change_binary(j, num);\n    if (is_huiwen(changed)) {\n        ++times;\n        }\n    }\n    if (times >= 2){\n        ++temp;\n        cout << num << endl;\n        }\n    if (temp >= n) break;\n    }\n    return 0;\n}\n\nstring int_to_string(int n)\n{\n    string result{};\n    int temp = n;\n    int m = 1;\n    int i = 1;\n    while (temp != 0) {\n        char c{};\n        int m{};\n        m = n / pow(10, i - 1); m = m % 10;\n        temp -= m * pow(10, i - 1);\n        c = m + '0';\n        result = c + result;\n        ++i;\n    }\n    return result;\n}\n\nstring change_binary(int n, int num)\n{\n    if (n == 10) return int_to_string(num);\n    else {\n        vector<char> result_vec;\n        string result;\n        int devided = num;\n        vector<char> remainders;\n        while (devided >= n) {\n            int temp = devided % n;\n            devided /= n;\n            if (temp <= 9) remainders.push_back('0' + temp);\n            else remainders.push_back('A' + temp - 10);\n        }\n        if (devided <= 9) result_vec.push_back('0' + devided);\n        else result_vec.push_back('A' + devided - 10);\n        for (unsigned int i = 0; i < remainders.size(); i++) {\n            result_vec.push_back(remainders[remainders.size() - i - 1]);\n        }\n\n        for (unsigned int i = 0; i < result_vec.size(); i++) {\n            result += result_vec[i];\n        }\n        return result;\n    }\n\n}\n\nbool is_huiwen(string num) {\n    for (unsigned int i = 0; i < num.size(); i++) {\n        if (num[i] != num[num.size() - i - 1]) return false;\n    }\n    return true;\n}",ACCEPTED,46,512
1277803316212326400,eb87c6d10ddb0751be899e3c6768fbb6eddffb2df6f28da5e524d5069f058f1f,2020-06-30 11:17:05,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <cmath>\n#include<stdio.h>\n#include <algorithm>\n#include <vector>\n\nusing namespace std;\n\nint main(){\n    int B;\n    cin>>B;\n    for(int i=1;i<=300;i++){\n        vector<int> num1;\n        vector<int> num2;\n        int iSqu=i*i;\n        int ii=i;\n        int quo=0;\n        int rem=0;\n        while(ii!=0){\n            rem=ii%B;\n            num1.push_back(rem);\n            quo=ii/B;\n            ii=quo;\n        }\n        int iSqui=iSqu;\n        int quoi=0;\n        int remi=0;\n        while(iSqui!=0){\n            remi=iSqui%B;\n            num2.push_back(remi);\n            quoi=iSqui/B;\n            iSqui=quoi;\n        }\n        int len1=num1.size();\n        int len2=num2.size();\n        int count1=0;\n        for(int i=0;i<len2/2;i++){\n            if(num2[i]==num2[len2-i-1])\n                count1++;\n        }\n        if(count1==len2/2){\n            for (int i=len1-1; i>=0; i--) {\n                cout<<num1[i];\n            }\n            cout<<\"" \"";\n            for(int i=0;i<len2;i++){\n                cout<<num2[i];\n            }\n            cout<<\""\\n\"";\n        }\n    }\n}",PARTIAL_ACCEPTED,37,640
1277803376794853376,841f44da1bcbd39db216ca4affaebbf7785417a4a6cdf296d4af9838027497a1,2020-06-30 11:17:20,Python,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"n=int(input())\nmaxn=0\ndef jz(i):\n    res=[]\n    s=0\n    l=0\n    while i!=0:\n        l=i%n\n        if l>=10:\n            l=chr(l-10+ord('A'))\n        res.append(str(l))\n        i=i//n\n \n\n    s=\""\"".join(res[::-1])\n    res=[]\n    return s\nfor i in range(1,301):\n    pf=jz(i*i)\n    \n    if pf[::-1]==pf:\n        print(jz(i),pf)\n",ACCEPTED,165,2984
1277803459577831424,cc0d763b9b9af8282454127e1f75709799ad3393794bfd64b02be7134b1d1c88,2020-06-30 11:17:39,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n#include<string.h>\n#define MAXN 300\nint Transform(int num);\nchar b[35], a[20] = { \""0123456789ABCDEFGHIJ\"" };\nint B;\nint main()\n{\n    freopen(\""palsquare.in\"", \""r\"", stdin);\n    freopen(\""palsquare.out\"", \""w\"", stdout);\n    char p[40];\n    scanf(\""%d\"", &B);\n    for (int i = 1;i <= MAXN;i++)\n    {\n        int r;\n        r = Transform(i * i);\n        int L = 0;\n        while (L <= r && b[L] == b[r])\n        {\n            L++;r--;\n        }\n        if (L > r)\n        {\n            strcpy(p, b);\n            r = Transform(i);\n            for (int j = r;j >= 0;j--)\n                printf(\""%c\"", b[j]);\n            printf(\"" %s\\n\"", p);\n        }\n    }\n    return 0;\n}\nint Transform(int num)\n{\n    int i = -1;\n    while (num > 0)\n    {\n        b[++i] = a[num % B];\n        num /= B;\n    }\n    return i;\n}\n",FLOAT_POINT_EXCEPTION,18,384
1277803751128104960,cc0d763b9b9af8282454127e1f75709799ad3393794bfd64b02be7134b1d1c88,2020-06-30 11:18:49,C,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n#include<string.h>\n#define MAXN 300\nint Transform(int num);\nchar b[35], a[20] = { \""0123456789ABCDEFGHIJ\"" };\nint B;\nint main()\n{\n    char p[40];\n    scanf(\""%d\"", &B);\n    for (int i = 1;i <= MAXN;i++)\n    {\n        int r;\n        r = Transform(i * i);\n        int L = 0;\n        while (L <= r && b[L] == b[r])\n        {\n            L++;r--;\n        }\n        if (L > r)\n        {\n            strcpy(p, b);\n            r = Transform(i);\n            for (int j = r;j >= 0;j--)\n                printf(\""%c\"", b[j]);\n            printf(\"" %s\\n\"", p);\n        }\n    }\n    return 0;\n}\nint Transform(int num)\n{\n    int i = -1;\n    while (num > 0)\n    {\n        b[++i] = a[num % B];\n        num /= B;\n    }\n    return i;\n}\n",ACCEPTED,31,376
1277804402629337088,f1c05c83be06fd0c0f401a95d472bc090bbb2d6f4aa05ed5d6b7c1ec6123d244,2020-06-30 11:21:24,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\n\nstring transfer(int num, int r){\n    char ans[10]{'A','B','C','D','E','F','G','H','I','J'};\n    string t = \""\"";\n    int shang  = num;\n    while(shang!= 0 ){\n        int yushu ;\n        yushu = shang % r;\n        if(yushu >= 10){\n            t += ans[yushu%10];\n        }\n        else t += to_string(yushu);\n        shang = (shang - yushu)/r;\n    }\n    int l = 0; int right = t.size() - 1;\n    while(l < right ){\n        auto s = t[l];\n\n        t[l] = t[right];\n        t[right]  = s;\n        l++;right--;\n    }\n    return t;\n\n}\n\nbool ishw(string num){\n\n    if(num.size() == 1) return true;\n    string s = \""\"";\n    int r = num.size() - 1;\n    while(r >= 0){\n        s += num[r];\n        r--;\n    }\n    if(s == num) return true;\n\n    return false;\n\n}\n\n\n\nint main(){\n    int r;\n    cin>>r;\n    for(int i = 1; i <= 300; i++){\n        int sqr = i*i;\n        string sq = transfer(sqr,r);\n        string num = transfer(i,r);\n        if(ishw(sq)) cout<<num<<\"" \""<<sq<<endl;\n        \n    }\n    \n    \n}",ACCEPTED,42,484
1277804421767946240,eb87c6d10ddb0751be899e3c6768fbb6eddffb2df6f28da5e524d5069f058f1f,2020-06-30 11:21:29,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <cmath>\n#include<stdio.h>\n#include <algorithm>\n#include <vector>\n\nusing namespace std;\n\nint main(){\n    int B;\n    cin>>B;\n    for(int i=1;i<=300;i++){\n        vector<int> num1;\n        vector<int> num2;\n        int iSqu=i*i;\n        int ii=i;\n        int quo=0;\n        int rem=0;\n        while(ii!=0){\n            rem=ii%B;\n            num1.push_back(rem);\n            quo=ii/B;\n            ii=quo;\n        }\n        int iSqui=iSqu;\n        int quoi=0;\n        int remi=0;\n        while(iSqui!=0){\n            remi=iSqui%B;\n            num2.push_back(remi);\n            quoi=iSqui/B;\n            iSqui=quoi;\n        }\n        int len1=num1.size();\n        int len2=num2.size();\n        int count1=0;\n        for(int i=0;i<len2/2;i++){\n            if(num2[i]==num2[len2-i-1])\n                count1++;\n        }\n        if(count1==len2/2){\n            for (int i=len1-1; i>=0; i--) {\n                cout<<num1[i];\n            }\n            cout<<\"" \"";\n            for(int i=0;i<len2;i++){\n                cout<<num2[i];\n            }\n            cout<<\""\\n\"";\n        }\n    }\n}",PARTIAL_ACCEPTED,35,508
1277804504869699584,eb87c6d10ddb0751be899e3c6768fbb6eddffb2df6f28da5e524d5069f058f1f,2020-06-30 11:21:49,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <cmath>\n#include<stdio.h>\n#include <algorithm>\n#include <vector>\n\nusing namespace std;\n\nint main(){\n    int B;\n    cin>>B;\n    for(int i=1;i<=300;i++){\n        vector<int> num1;\n        vector<int> num2;\n        int iSqu=i*i;\n        int ii=i;\n        int quo=0;\n        int rem=0;\n        while(ii!=0){\n            rem=ii%B;\n            num1.push_back(rem);\n            quo=ii/B;\n            ii=quo;\n        }\n        int iSqui=iSqu;\n        int quoi=0;\n        int remi=0;\n        while(iSqui!=0){\n            remi=iSqui%B;\n            num2.push_back(remi);\n            quoi=iSqui/B;\n            iSqui=quoi;\n        }\n        int len1=num1.size();\n        int len2=num2.size();\n        int count1=0;\n        for(int i=0;i<len2/2;i++){\n            if(num2[i]==num2[len2-i-1])\n                count1++;\n        }\n        if(count1==len2/2){\n            for (int i=len1-1; i>=0; i--) {\n                if(num1[i]>=10)\n                    cout<<char(num1[i]+55);\n                else\n                    cout<<num1[i];\n            }\n            cout<<\"" \"";\n            for(int i=0;i<len2;i++){\n                if(num2[i]>=10)\n                    cout<<char(num2[i]+55);\n                else\n                    cout<<num2[i];\n            }\n            cout<<\""\\n\"";\n        }\n    }\n}",ACCEPTED,30,424
1277804920919490560,ce561f0083143ec21f56f244d8d061a393a68d0a66f6c47836233c3ec57e3005,2020-06-30 11:23:28,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <sstream>\n#include <string>\n#include <cmath>\nusing namespace std;\nint hws(int s)\n{\n    int answer = 0;\n    for (int i = 2; i <= 10; i++)\n    {\n        if (answer == 2)\n        {\n            break;\n        }\n        long long x = 0;\n        int s0 = s, j = 0;\n        while (s0)\n        {\n            x = x + pow(10, j) * (s0 % i)  ;\n            s0 =s / i;\n            j++;\n        }\n        stringstream m;\n        string n;\n        m << x;\n        m >> n;\n        int ls = n.size(), l = 0;\n        while (n[ls - 1 - l == n[l]] and l <= (ls - 1) / 2)\n        {\n            l++;\n        }\n        l--;\n        if (l == (ls - 1) / 2)\n        {\n            answer++;\n        }\n    }\n    return answer;\n}\nint main() {\n    int n, m;\n    int num = 0;\n    cin >> n >> m;\n    while (num < n)\n    {\n        m++;\n        if (hws(m) == 2)\n        {\n            num++;\n            cout << m << endl;\n        }\n    }\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,0,0
1277805195608653824,a1e7064b323be6c22b1cc57f30af167085750c33ec47c1123456ba82dffd1a78,2020-06-30 11:24:33,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<stdio.h>\n#include<math.h>\n\nusing namespace std;\n\n\n\n\n\n\n\nstruct Struct{\n    int icount;\n    int list[20];\n\n    Struct(int n,int x){\n        for(icount=0;x;icount++){\n            list[icount] = x%n;\n            x = x/n;\n        }\n    }\n\n    bool Circle(){\n        for(int i=0;i<icount;i++)\n            if(list[i]!=list[icount-1-i])\n                return 0;\n        return 1;\n    }\n\n\n};\n\n\n\n\n\nint main(){\n    int n;\n    int s;\n    int index = 0;\n    cin >> n >> s;\n\n    int list[n];//存入满足条件的数\n    for(int x=s;x<10000;x++){  //大于s数的遍历\n        int icount =0;\n        for(int i=2;i<=10;i++){  //进制遍历\n            Struct n(i,x);\n            if(n.Circle())\n                icount+=1;\n        }\n        if(icount>=2){\n            list[index] = x;\n            index +=1;\n        }\n    }\n\n\n    for(auto x:list){\n        cout << x<<endl;\n    }\n\n\n\n}\n\n\n",MULTIPLE_ERROR,53,536
1277805428187004928,a870a79d2df669b7f87342f8f7ec6274f70032997550fa9fe07a832f5874704b,2020-06-30 11:25:29,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n\nusing namespace std;\n\nint main()\n{ int B,i,j,a,f,num[20];\n  char NUM[20];\n  cin>>B;\n  int pow(int x,int y);\n  if(B>=2&&B<11){\n  for(i=1;i<301;i++){\n\t  a=i*i;\n\t  f=0;\n\t\t  while(a>0){\n\t\t   num[f]=(a%pow(B,f+1))/pow(B,f);\n\t\t   a=a-a%pow(B,f+1);\n\t\t\t  if(a/pow(B,f+1)>=B) f++;\n\t\t\t  else if(a/pow(B,f+1)>0&&a/pow(B,f+1)<B){  num[f+1]=a/pow(B,f+1);f++;break;}\n\t\t\t  else break;\n\t\t  }\n\t\t  for(j=0;j<=f;j++){\n\t\t  if(num[j]!=num[f-j]) break;\n\t\t  }\n\t\t  if(j>f) cout<<i<<\"" \""<<i*i<<endl;\n\n\t  }\n    if(B>=11&&B<=20){  \n\t\tfor(i=1;i<301;i++){\n\t  a=i*i;\n\t  f=0;\n\t\t  while(a>0){\n\t\t   NUM[f]=(a%pow(B,f+1))/pow(B,f)+55;\n\t\t   a=a-a%pow(B,f+1);\n\t\t\t  if(a/pow(B,f+1)>=B) f++;\n\t\t\t  else if(a/pow(B,f+1)>0&&a/pow(B,f+1)<B){  NUM[f+1]=a/pow(B,f+1)+55;f++;break;}\n\t\t\t  else break;\n\t\t  }\n\t\t  for(j=0;j<=f;j++){\n\t\t  if(NUM[j]!=NUM[f-j]) break;\n\t\t  }\n\t\t  if(j>f) cout<<i<<\"" \""<<i*i<<endl;\n}\n\n}\n  \n  }\n}\nint pow(int x,int y)\n{ int a=1;\n   for(int i=0;i<y;i++)\n   {a=a*x;}\n   return a;\n}",PARTIAL_ACCEPTED,41,512
1277805719984726016,0032070d277fc021e595a55c6026c72dd281fbfefaf3ca9eff94ecd013980afa,2020-06-30 11:26:38,C++,20.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <math.h>\nusing namespace std;\nint translate(int n_trans,int i_beTrans);//translate_the_2-10\nint judge(int signle_array[10],int n);//judge_the_type\nvoid trans_array(int signle_number[10],int number,int n);//translate_number_to_array\nint count(int number);//count_figures\nint main()\n{\n    int n;\n    cin>>n;\n    int square_trans=0;//转化进制之后的数字\n    int sigle_number[10];//将转化后的数字转化成数组\n    int judgement=0;//判断是不是回文数列\n    for(int i=1;i<=300;i++){\n        int square=i*i;\n        square_trans=translate(n,square);\n        int array_length=count(square_trans);\n\t\ttrans_array(sigle_number,square_trans,array_length);\n        judgement=judge(sigle_number,array_length);\n        if(judgement==0)\n            cout<<translate(n,i)<<\"" \""<<square_trans<<endl;\n    }\n    return 0;\n}\nint translate(int n_trans,int i_beTrans){\n    int result=0;\n    int i=0;\n    while(i_beTrans!=0){\n        int p=i_beTrans%n_trans;\n        i_beTrans/=n_trans;\n        result+=p*pow(10,i);\n        i++;\n    }\n    return result;\n}\nint count(int number){\n    for(int i=1;;i++){\n        int k=pow(10,i);\n        if(number/k==0){\n            return i;\n            break;\n        }\n    }\n}\nvoid trans_array(int signle_number[10],int number,int n){\n    \n    int index=n-1;\n    while(number!=0){\n        signle_number[index]=number%10;\n        number/=10;\n        index--;\n    }\n}\nint judge(int signle_array[10],int n){\n    int judgement=0;\n    for(int i=0;i<=(n-1)/2;i++){\n        if(signle_array[i]!=signle_array[n-1-i]){\n            return 1;\n            break;\n        }\n        else{\n            if(i==(n-1)/2)\n                return judgement;\n        }\n    }\n}\n/*函数数组形参可以被复制，因为传入的是数组地址\n * 其他变量不能被赋值，因为传入的是副本\n * 使用pow()函数时不可以直接代入数字表达式，否则结果错误*/",PARTIAL_ACCEPTED,29,500
1277806419569475584,a1e7064b323be6c22b1cc57f30af167085750c33ec47c1123456ba82dffd1a78,2020-06-30 11:29:25,C++,40.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<stdio.h>\n#include<math.h>\n\nusing namespace std;\n\n\n\n\n\n\n\nstruct Struct{\n    int icount;\n    int list[20];\n\n    Struct(int n,int x){\n        for(icount=0;x;icount++){\n            list[icount] = x%n;\n            x = x/n;\n        }\n    }\n\n    bool Circle(){\n        for(int i=0;i<icount;i++)\n            if(list[i]!=list[icount-1-i])\n                return 0;\n        return 1;\n    }\n\n\n};\n\n\n\n\n\nint main(){\n    int n;\n    int s;\n    int index = 0;\n    cin >> n >> s;\n\n    int list[n];//存入满足条件的数\n    for(int x=s;x<10000;x++){  //大于s数的遍历\n        int icount =0;\n        for(int i=2;i<=10;i++){  //进制遍历\n            Struct n(i,x);\n            if(n.Circle())\n                icount+=1;\n        }\n        if(icount>=2 && index<n){\n            list[index] = x;\n            index +=1;\n        }\n    }\n\n    for(auto x:list)\n        cout <<x<<endl;\n\n\n\n\n\n\n}\n\n\n",PARTIAL_ACCEPTED,54,608
1277806493808648192,841f44da1bcbd39db216ca4affaebbf7785417a4a6cdf296d4af9838027497a1,2020-06-30 11:29:43,Python,60.0,1277062760129622024,1267449136707624960,1049226397448056832,"s=input().split()\na=int(s[0])\nb=int(s[1])\ndef jz(i,n):\n    res=[]\n    s=0\n    l=0\n    while i!=0:\n        l=i%n\n        if l>=10:\n            l=chr(l-10+ord('A'))\n        res.append(str(l))\n        i=i//n\n    s=\""\"".join(res[::-1])\n    res=[]\n    return s\nc=0\nfor i in range(b+1,10016):\n    count=0\n    \n    for j in range(2,11):\n        s=jz(i,j)\n        if s==s[::-1]:\n            count+=1\n            if count==2:\n                c+=1\n                print(i)\n                break\n    if c==a:\n        break",PARTIAL_ACCEPTED,206,3068
1277806717931282432,841f44da1bcbd39db216ca4affaebbf7785417a4a6cdf296d4af9838027497a1,2020-06-30 11:30:36,Python,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"s=input().split()\na=int(s[0])\nb=int(s[1])\ndef jz(i,n):\n    res=[]\n    s=0\n    l=0\n    while i!=0:\n        l=i%n\n        if l>=10:\n            l=chr(l-10+ord('A'))\n        res.append(str(l))\n        i=i//n\n    s=\""\"".join(res[::-1])\n    res=[]\n    return s\nc=0\nfor i in range(b+1,9999999):\n    count=0\n    \n    for j in range(2,11):\n        s=jz(i,j)\n        if s==s[::-1]:\n            count+=1\n            if count==2:\n                c+=1\n                print(i)\n                break\n    if c==a:\n        break\n    ",ACCEPTED,322,3280
1277806719487369216,a1e7064b323be6c22b1cc57f30af167085750c33ec47c1123456ba82dffd1a78,2020-06-30 11:30:37,C++,60.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<stdio.h>\n#include<math.h>\n\nusing namespace std;\n\n\n\n\n\n\n\nstruct Struct{\n    int icount;\n    int list[20];\n\n    Struct(int n,int x){\n        for(icount=0;x;icount++){\n            list[icount] = x%n;\n            x = x/n;\n        }\n    }\n\n    bool Circle(){\n        for(int i=0;i<icount;i++)\n            if(list[i]!=list[icount-1-i])\n                return 0;\n        return 1;\n    }\n\n\n};\n\n\n\n\n\nint main(){\n    int n;\n    int s;\n    int index = 0;\n    cin >> n >> s;\n\n    int list[n];//存入满足条件的数\n    for(int x=s+1;x<10000;x++){  //大于s数的遍历\n        int icount =0;\n        for(int i=2;i<=10;i++){  //进制遍历\n            Struct n(i,x);\n            if(n.Circle())\n                icount+=1;\n        }\n        if(icount>=2 && index<n){\n            list[index] = x;\n            index +=1;\n        }\n    }\n\n    for(auto x:list)\n        cout <<x<<endl;\n\n\n\n\n\n\n}\n\n\n",PARTIAL_ACCEPTED,54,512
1277809493268692992,a1e7064b323be6c22b1cc57f30af167085750c33ec47c1123456ba82dffd1a78,2020-06-30 11:41:38,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<stdio.h>\n#include<math.h>\n\nusing namespace std;\n\n\n\n\n\n\n\nstruct Struct{\n    int icount;\n    int list[30];\n\n    Struct(int n,int x){\n        for(icount=0;x;icount++){\n            list[icount] = x%n;\n            x = x/n;\n        }\n    }\n\n    bool Circle(){\n        for(int i=0;i<icount;i++)\n            if(list[i]!=list[icount-1-i])\n                return 0;\n        return 1;\n    }\n\n\n};\n\n\n\n\n\nint main(){\n    int n;\n    int s;\n    int index = 0;\n    cin >> n >> s;\n\n    int list[n];//存入满足条件的数\n    for(int x=s+1;x<100000;x++){  //大于s数的遍历\n        int icount =0;\n        for(int i=2;i<=10;i++){  //进制遍历\n            Struct n(i,x);\n            if(n.Circle())\n                icount+=1;\n        }\n        if(icount>=2 && index<n){\n            list[index] = x;\n            index +=1;\n        }\n    }\n\n    for(auto x:list)\n        cout <<x<<endl;\n\n\n\n\n\n\n}\n\n\n",ACCEPTED,377,424
1277818637409247232,8c6873a2f339e895023c795dc65afb5773c8ff36d8bbc5e7a1a81e454198326e,2020-06-30 12:17:58,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include <string>\n#include <stdio.h>\n#include<array>\n#include<vector>\nusing namespace std;\n\nbool check(vector<int> a) {\n\t\n\tvector<int> b;\n\tfor (int i = a.size()-1;i >= 0;i--) {\n\t\tb.push_back(a[i]);\n\t}\n\tfor (int i = 0;i < b.size();i++) {\n\t\tif (b[i] > 10) {\n\t\t\tint g = b[i] % 10;\n\t\t\tint s = b[i] / 10;\n\t\t\tint reverse = g * 10 + s;\n\t\t\tb[i] = reverse;\n\t\t}\n\t}\n\treturn (b == a);\n}\n\nvector<int> change(int x, int a) {\n\tvector<int> y;\n\tint t = 0;\n\twhile ((x / a) != 0)\n\t{\n\t\tt = x % a;\n\t\tx = x / a;\n\t\ty.push_back(t);\n\t}\n\tt = x % a;\n\ty.push_back(t);\n\tvector<int> b;\n\tfor (int i = y.size() - 1;i >= 0;i--) {\n\t\tb.push_back(y[i]);\n\t}\n\treturn b;\n}\n\nint main() {\n\tint x = 0;\n\tcin >> x;\n\tfor (int i = 1;i <= 300;i++) {\n\t\tif (check(change(i * i, x))) {\n\t\t\tvector<int> a = change(i, x);\n\t\t\tvector<int> b = change(i * i, x);\n\t\t\tfor (int y : a) {\n\t\t\t\tif (y < 10) {\n\t\t\t\t\tcout << y;\n\t\t\t\t}\n\t\t\t\telse if (y == 10) {\n\t\t\t\t\tcout << \""A\"";\n\t\t\t\t}\n\t\t\t\telse if (y == 11) {\n\t\t\t\t\tcout << \""B\"";\n\t\t\t\t}\n\t\t\t\telse if (y == 12) {\n\t\t\t\t\tcout << \""C\"";\n\t\t\t\t}\n\t\t\t\telse if (y == 13) {\n\t\t\t\t\tcout << \""D\"";\n\t\t\t\t}\n\t\t\t\telse if (y == 14) {\n\t\t\t\t\tcout << \""E\"";\n\t\t\t\t}\n\t\t\t\telse if (y == 15) {\n\t\t\t\t\tcout << \""F\"";\n\t\t\t\t}\n\t\t\t\telse if (y == 16) {\n\t\t\t\t\tcout << \""G\"";\n\t\t\t\t}\n\t\t\t\telse if (y == 17) {\n\t\t\t\t\tcout << \""H\"";\n\t\t\t\t}\n\t\t\t\telse if (y == 18) {\n\t\t\t\t\tcout << \""I\"";\n\t\t\t\t}\n\t\t\t\telse if (y == 19) {\n\t\t\t\t\tcout << \""J\"";\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout << \"" \"";\n\t\t\tfor (int z : b) {\n\t\t\t\tif (z < 10) {\n\t\t\t\t\tcout << z;\n\t\t\t\t}\n\t\t\t\telse if (z == 10) {\n\t\t\t\t\tcout << \""A\"";\n\t\t\t\t}\n\t\t\t\telse if (z == 11) {\n\t\t\t\t\tcout << \""B\"";\n\t\t\t\t}\n\t\t\t\telse if (z == 12) {\n\t\t\t\t\tcout << \""C\"";\n\t\t\t\t}\n\t\t\t\telse if (z == 13) {\n\t\t\t\t\tcout << \""D\"";\n\t\t\t\t}\n\t\t\t\telse if (z == 14) {\n\t\t\t\t\tcout << \""E\"";\n\t\t\t\t}\n\t\t\t\telse if (z == 15) {\n\t\t\t\t\tcout << \""F\"";\n\t\t\t\t}\n\t\t\t\telse if (z == 16) {\n\t\t\t\t\tcout << \""G\"";\n\t\t\t\t}\n\t\t\t\telse if (z == 17) {\n\t\t\t\t\tcout << \""H\"";\n\t\t\t\t}\n\t\t\t\telse if (z == 18) {\n\t\t\t\t\tcout << \""I\"";\n\t\t\t\t}\n\t\t\t\telse if (z == 19) {\n\t\t\t\t\tcout << \""J\"";\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n}",PARTIAL_ACCEPTED,47,728
1277819542519087104,f1c05c83be06fd0c0f401a95d472bc090bbb2d6f4aa05ed5d6b7c1ec6123d244,2020-06-30 12:21:34,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<vector>\n#include<iostream>\n#include<string>\nusing namespace std;\n\n/*进制转换，把 num 转换成r进制*/\nstring transfer(int num, int r){\n    char ans[10]{'A','B','C','D','E','F','G','H','I','J'};\n    string t = \""\"";\n    int shang  = num;\n    while(shang!= 0 ){\n        int yushu ;\n        yushu = shang % r;\n        if(yushu >= 10){\n            t += ans[yushu%10];\n        }\n        else t += to_string(yushu);\n        shang = (shang - yushu)/r;\n    }\n    int l = 0; int right = t.size() - 1;\n    while(l < right ){\n        auto s = t[l];\n\n        t[l] = t[right];\n        t[right]  = s;\n        l++;right--;\n    }\n    return t;\n\n}\n/*判断是否是回文数*/\n\nbool ishw(string num){\n\n    if(num.size() == 1) return true;\n    string s = \""\"";\n    int r = num.size() - 1;\n    while(r >= 0){\n        s += num[r];\n        r--;\n    }\n    if(s == num) return true;\n\n    return false;\n\n}\n\n\n/*判断是否是双重回文数*/\n\nbool issc(int num){\n    int n = 0;\n    bool yes = false;\n    for(int j = 2; j <= 10; j++){\n      string t = transfer(num,j);\n       if(ishw(t)) n++;\n        if(n == 2) { yes = true;break;}\n    }\n    return yes;\n}\n\nint main(){\n    vector<int>ans;\n    int cnt = 0;\n    int n, num;\n    cin>>n>>num;\n  for(int i = num+1 ;; i++){\n      if(issc(i)) {cnt++;ans.push_back(i);}\n      if(cnt == n) break;\n  }\n    for(int x: ans) cout<<x<<endl;\n\n}",ACCEPTED,85,500
1277820843722203136,d80ceee7855575a5a54ac3daf4c36c2c829ec2e6134898d230aaf7f03f2f5f22,2020-06-30 12:26:44,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<vector>\n\nusing namespace std;\n\nclass haha\n{\npublic:\n\thaha(int a, int b);\n\tbool hui();\nprivate:\n\tint num;\n\tint system;\n\tvector<int> numL;\n};\n\nhaha::haha(int a, int b) {\n\tnum = a;\n\tsystem = b;\n\tint s;\n\twhile (a != 0) {\n\t\ts = a % b;\n\t\ta = a / b;\n\t\tnumL.push_back(s);\n\t}\n\n}\n\nbool haha::hui() {\n\tfor (int i = 0; i <= numL.size() / 2; i++) {\n\t\tif (numL[i] != numL[numL.size() - i - 1]) return false;\n\t}\n\treturn true;\n}\n\nbool hehe(int a) {\n\tint flag = 0;\n\tfor (int i = 2; i <= 10; i++) {\n\t\thaha b(a, i);\n\t\tif (b.hui()) flag++;\n\t}\n\tif (flag >= 3) return true;\n\telse return false;\n}\n\nint main()\n{\n\tint n, m, i = 0;\n\tcin >> n >> m;\n\twhile (i != 3) {\n\t\tif (hehe(m)) i++;\n\t\tm++;\n\t}\n}",WRONG_ANSWER,57,384
1277821014627516416,d80ceee7855575a5a54ac3daf4c36c2c829ec2e6134898d230aaf7f03f2f5f22,2020-06-30 12:27:25,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<vector>\n\nusing namespace std;\n\nclass haha\n{\npublic:\n\thaha(int a, int b);\n\tbool hui();\nprivate:\n\tint num;\n\tint system;\n\tvector<int> numL;\n};\n\nhaha::haha(int a, int b) {\n\tnum = a;\n\tsystem = b;\n\tint s;\n\twhile (a != 0) {\n\t\ts = a % b;\n\t\ta = a / b;\n\t\tnumL.push_back(s);\n\t}\n\n}\n\nbool haha::hui() {\n\tfor (int i = 0; i <= numL.size() / 2; i++) {\n\t\tif (numL[i] != numL[numL.size() - i - 1]) return false;\n\t}\n\treturn true;\n}\n\nbool hehe(int a) {\n\tint flag = 0;\n\tfor (int i = 2; i <= 10; i++) {\n\t\thaha b(a, i);\n\t\tif (b.hui()) flag++;\n\t}\n\tif (flag >= 3) return true;\n\telse return false;\n}\n\nint main()\n{\n\tint n, m, i = 0;\n\tcin >> n >> m;\n\twhile (i != 3) {\n\t\tif (hehe(m)) i++;\n        cout << m << endl;\n\t\tm++;\n\t}\n}",WRONG_ANSWER,58,516
1277821029278212096,0633887e77e3cca4aa9085d29d5e990e267168923ec1a8c871a401163bd64992,2020-06-30 12:27:28,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,#include<iostream>\nusing namespace std;\nint main()\n{\n\tint num;\n\tcin >> num;\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\tint  pow[20] = {};\n\t\tint d = i * i;\n\t\tint endnum = 0;\n\t\tfor (int j = 0; j < 20; j++)\n\t\t{\n\t\t\tendnum++;\n\t\t\tif (d < num)\n\t\t\t{\n\t\t\t\tpow[j] = d;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tpow[j] = d % num;\n\t\t\t\td = (d - pow[j]) / num; \n\t\t\t}\n\t\t}\n\t\tint t = 1;\n\t\tfor (int k=0; k < endnum / 2 + 1; k++)\n\t\t{\n\t\t\tif (pow[k] != pow[endnum - k - 1])t=0;\n\t\t\tif (t == 0)break;\n\t\t}\n\t\tif (t) {\n\t\t\tcout << i << ' ';\n\t\t\tfor (int n = 0; n < endnum; n++)\n\t\t\t{\n\t\t\t\tif (pow[n] > 9)cout << pow[n] + 55;\n\t\t\t\telse cout << pow[n];\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n\treturn 0;\n},PARTIAL_ACCEPTED,34,508
1277821181342703616,d80ceee7855575a5a54ac3daf4c36c2c829ec2e6134898d230aaf7f03f2f5f22,2020-06-30 12:28:05,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<vector>\n\nusing namespace std;\n\nclass haha\n{\npublic:\n\thaha(int a, int b);\n\tbool hui();\nprivate:\n\tint num;\n\tint system;\n\tvector<int> numL;\n};\n\nhaha::haha(int a, int b) {\n\tnum = a;\n\tsystem = b;\n\tint s;\n\twhile (a != 0) {\n\t\ts = a % b;\n\t\ta = a / b;\n\t\tnumL.push_back(s);\n\t}\n\n}\n\nbool haha::hui() {\n\tfor (int i = 0; i <= numL.size() / 2; i++) {\n\t\tif (numL[i] != numL[numL.size() - i - 1]) return false;\n\t}\n\treturn true;\n}\n\nbool hehe(int a) {\n\tint flag = 0;\n\tfor (int i = 2; i <= 10; i++) {\n\t\thaha b(a, i);\n\t\tif (b.hui()) flag++;\n\t}\n\tif (flag >= 3) return true;\n\telse return false;\n}\n\nint main()\n{\n\tint n, m, i = 0;\n\tcin >> n >> m;\n\twhile (i != 3) {\n        m++;\n\t\tif (hehe(m)) i++;\n        cout << m << endl;\n\t}\n}",WRONG_ANSWER,65,508
1277821255678361600,d80ceee7855575a5a54ac3daf4c36c2c829ec2e6134898d230aaf7f03f2f5f22,2020-06-30 12:28:22,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<vector>\n\nusing namespace std;\n\nclass haha\n{\npublic:\n\thaha(int a, int b);\n\tbool hui();\nprivate:\n\tint num;\n\tint system;\n\tvector<int> numL;\n};\n\nhaha::haha(int a, int b) {\n\tnum = a;\n\tsystem = b;\n\tint s;\n\twhile (a != 0) {\n\t\ts = a % b;\n\t\ta = a / b;\n\t\tnumL.push_back(s);\n\t}\n\n}\n\nbool haha::hui() {\n\tfor (int i = 0; i <= numL.size() / 2; i++) {\n\t\tif (numL[i] != numL[numL.size() - i - 1]) return false;\n\t}\n\treturn true;\n}\n\nbool hehe(int a) {\n\tint flag = 0;\n\tfor (int i = 2; i <= 10; i++) {\n\t\thaha b(a, i);\n\t\tif (b.hui()) flag++;\n\t}\n\tif (flag >= 2) return true;\n\telse return false;\n}\n\nint main()\n{\n\tint n, m, i = 0;\n\tcin >> n >> m;\n\twhile (i != 3) {\n        m++;\n\t\tif (hehe(m)) i++;\n        cout << m << endl;\n\t}\n}",WRONG_ANSWER,29,512
1277821527217602560,d80ceee7855575a5a54ac3daf4c36c2c829ec2e6134898d230aaf7f03f2f5f22,2020-06-30 12:29:27,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<vector>\n\nusing namespace std;\n\nclass haha\n{\npublic:\n\thaha(int a, int b);\n\tbool hui();\nprivate:\n\tint num;\n\tint system;\n\tvector<int> numL;\n};\n\nhaha::haha(int a, int b) {\n\tnum = a;\n\tsystem = b;\n\tint s;\n\twhile (a != 0) {\n\t\ts = a % b;\n\t\ta = a / b;\n\t\tnumL.push_back(s);\n\t}\n\n}\n\nbool haha::hui() {\n\tfor (int i = 0; i <= numL.size() / 2; i++) {\n\t\tif (numL[i] != numL[numL.size() - i - 1]) return false;\n\t}\n\treturn true;\n}\n\nbool hehe(int a) {\n\tint flag = 0;\n\tfor (int i = 2; i <= 10; i++) {\n\t\thaha b(a, i);\n\t\tif (b.hui()) flag++;\n\t}\n\tif (flag >= 2) return true;\n\telse return false;\n}\n\nint main()\n{\n\tint n, m, i = 0;\n\tcin >> n >> m;\n\twhile (i != 3) {\n        m++;\n\t\tif (hehe(m)) {\n            i++;\n            cout << m << endl;\n        }\n\t}\n}",WRONG_ANSWER,23,512
1277821633404796928,d80ceee7855575a5a54ac3daf4c36c2c829ec2e6134898d230aaf7f03f2f5f22,2020-06-30 12:29:52,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<vector>\n\nusing namespace std;\n\nclass haha\n{\npublic:\n\thaha(int a, int b);\n\tbool hui();\nprivate:\n\tint num;\n\tint system;\n\tvector<int> numL;\n};\n\nhaha::haha(int a, int b) {\n\tnum = a;\n\tsystem = b;\n\tint s;\n\twhile (a != 0) {\n\t\ts = a % b;\n\t\ta = a / b;\n\t\tnumL.push_back(s);\n\t}\n\n}\n\nbool haha::hui() {\n\tfor (int i = 0; i <= numL.size() / 2; i++) {\n\t\tif (numL[i] != numL[numL.size() - i - 1]) return false;\n\t}\n\treturn true;\n}\n\nbool hehe(int a) {\n\tint flag = 0;\n\tfor (int i = 2; i <= 10; i++) {\n\t\thaha b(a, i);\n\t\tif (b.hui()) flag++;\n\t}\n\tif (flag >= 2) return true;\n\telse return false;\n}\n\nint main()\n{\n\tint n, m, i = 0;\n\tcin >> n >> m;\n\twhile (i != n) {\n        m++;\n\t\tif (hehe(m)) {\n            i++;\n            cout << m << endl;\n        }\n\t}\n}",ACCEPTED,49,512
1277823169644126208,8c6873a2f339e895023c795dc65afb5773c8ff36d8bbc5e7a1a81e454198326e,2020-06-30 12:35:59,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include <string>\n#include <stdio.h>\n#include<array>\n#include<vector>\nusing namespace std;\n\nbool check(vector<int> a) {\n\t\n\tvector<int> b;\n\tfor (int i = a.size()-1;i >= 0;i--) {\n\t\tb.push_back(a[i]);\n\t}\n\tfor (int i = 0;i < b.size();i++) {\n\t\tif (b[i] > 10) {\n\t\t\tint g = b[i] % 10;\n\t\t\tint s = b[i] / 10;\n\t\t\tint reverse = g * 10 + s;\n\t\t\tb[i] = reverse;\n\t\t}\n\t}\n\treturn (b == a);\n}\n\nvector<int> change(int x, int a) {\n\tvector<int> y;\n\tint t = 0;\n\twhile ((x / a) != 0)\n\t{\n\t\tt = x % a;\n\t\tx = x / a;\n\t\ty.push_back(t);\n\t}\n\tt = x % a;\n\ty.push_back(t);\n\tvector<int> b;\n\tfor (int i = y.size() - 1;i >= 0;i--) {\n\t\tb.push_back(y[i]);\n\t}\n\treturn b;\n}\n\nint main() {\n\tint N = 0, S{ 0 }, account{0};\n\tcin >> N >> S;\n\twhile (true)\n\t{\n\t\tS++;\n\t\tint flag = 0;\n\t\tfor (int i = 2;i <= 10;i++) {\n\t\t\tif (check(change(S, i))) {\n\t\t\t\tflag++;\n\t\t\t}\n\t\t\tif (flag >= 2) {\n\t\t\t\taccount++;\n\t\t\t\tcout << S << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t}\n\t\tif (account >= N) {\n\t\t\tbreak;\n\t\t}\n\t}\n}",ACCEPTED,64,424
1277829234624495616,303874707958d90647f872b8efbfd73ba443b3adfeab3ebe67889ace64af034c,2020-06-30 13:00:05,C++,60.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstring>\nusing namespace std;\nchar zls[10] = {'0','1','2','3','4','5','6','7','8','9'};\nint fun(int m)\n{   \n    int rr = 0;\n    \n\tfor(int i =2;i<11;i++)\n\t{\n\t\tchar a[1000];\n\t\tchar tt[1000];\n\t\tstrcpy(tt,a);\n\t\t\n\t\tint x ;\n\t\tx=1;\n\t\tint o ;\n\t\to =m; \n\t\twhile(o)\n\t\t{\n\t\t    tt[x] = zls[o%i];\n\t\t    o = o/i;\n\t\t    x++;\n\t\t}\n\t\to=m;\n\t\t//cout<<tt<<\"" \""<<rr<<endl; \n\t\tx--;\n\t\t\n\t\t\n\t\tfor(int b =1;b<=x/2;b++)\n\t\t{\n\t\t\tif(tt[b]!=tt[x-b+1])\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(b==x/2)\n\t\t\t{\n\t\t\t\trr++;\n\t\t\t}\n\t\t\t\n\t\t}\n\t\t\n\t}\n\tif(rr>=2)\n\t{\n\t\treturn 1;\n\t}\n\telse\n\t{\n\t\treturn 0;\n\t}\n\n}\n//nt fun(int m);\nint main()\n{\n\tint N,S;\n\tint dd =0;\n\tcin>>N>>S;\n\twhile(dd<N)\n\t{\n\t\tfor(int i=S+1;;i++) \n\t\t{\n\t\t\tif(fun(i)==1)\n\t\t\t{\n\t\t\t\tcout<<i<<endl;\n\t\t\t\tdd++;\n\t\t\t    S=i;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t } \n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,27,492
1277830315278524416,ccd19aac870035e1025cf6798c4b246ecb4fa0143d857857107fbfcdb093184b,2020-06-30 13:04:22,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nint B,N,lenth;\nchar num[20],m[21]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nvoid Turn(int n){\n    int i=0;\n    lenth=0;\n    while( n > 0 ){\n        num[i]=m[n%B];\n        n=n/B;\n        i++;\n        lenth++;\n    }\n}\n\nbool judge(){\n    Turn(N);\n    int i=0;\n    int j=lenth-1;\n    while(i<j){\n        if(num[i]!=num[j])\n            return false;\n        i++;\n        j--;\n    }\n    return true;\n}\nvoid output(int m){\n    Turn(m);\n    for(int i=lenth-1;i>=0;i--)\n        cout<<num[i];\n}\nint main(){\n    cin>>B;\n    for(int i=1; i<=300; i++ ){\n        N=i*i;\n        if(judge()){\n            output(i);\n            cout<<\"" \"";\n            output(N);\n            cout<<endl;\n        }\n    }\n    return 0;\n}\n",ACCEPTED,40,512
1277830856704450560,ccd19aac870035e1025cf6798c4b246ecb4fa0143d857857107fbfcdb093184b,2020-06-30 13:06:31,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nint B,N,lenth;\nchar num[20],m[21]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nvoid Turn(int n){\n    int i=0;\n    lenth=0;\n    while(n>0){\n        num[i]=m[n%B];\n        n=n/B;\n        i++;\n        lenth++;\n    }\n}\n\nbool judge(){\n    Turn(N);\n    int i=0;\n    int j=lenth-1;\n    while(i<j){\n        if(num[i]!=num[j])\n            return false;\n        i++;\n        j--;\n    }\n    return true;\n}\nvoid output(int m){\n    Turn(m);\n    for(int i=lenth-1;i>=0;i--)\n        cout<<num[i];\n}\nint main(){\n    cin>>B;\n    for(int i=1; i<=300; i++ ){\n        N=i*i;\n        if(judge()){\n            output(i);\n            cout<<\"" \"";\n            output(N);\n            cout<<endl;\n        }\n    }\n    return 0;\n}\n",ACCEPTED,42,384
1277831164415377408,303874707958d90647f872b8efbfd73ba443b3adfeab3ebe67889ace64af034c,2020-06-30 13:07:45,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstring>\nusing namespace std;\nchar zls[10] = {'0','1','2','3','4','5','6','7','8','9'};\nint fun(int m)\n{   \n    int rr = 0;\n    \n\tfor(int i =2;i<11;i++)\n\t{\n\t\tchar a[1000];\n\t\tchar tt[1000];\n\t\tstrcpy(tt,a);\n\t\t\n\t\tint x ;\n\t\tx=1;\n\t\tint o ;\n\t\to =m; \n\t\twhile(o)\n\t\t{\n\t\t    tt[x] = zls[o%i];\n\t\t    o = o/i;\n\t\t    x++;\n\t\t}\n\t\to=m;\n\t\t//cout<<tt<<\"" \""<<rr<<endl; \n\t\tx--;\n\t\t\n\t\t\n\t\tfor(int b =1;b<=x/2;b++)\n\t\t{\n\t\t\tif(tt[b]!=tt[x-b+1])\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(b==x/2)\n\t\t\t{\n\t\t\t\trr++;\n\t\t\t}\n\t\t\t\n\t\t}\n\t\tif(x==1)\n\t\t{\n\t\t\trr++;\n\t\t}\n\t\t\n\t}\n\tif(rr>=2)\n\t{\n\t\treturn 1;\n\t}\n\telse\n\t{\n\t\treturn 0;\n\t}\n\n}\n//nt fun(int m);\nint main()\n{\n\tint N,S;\n\tint dd =0;\n\tcin>>N>>S;\n\twhile(dd<N)\n\t{\n\t\tfor(int i=S+1;;i++) \n\t\t{\n\t\t\tif(fun(i)==1)\n\t\t\t{\n\t\t\t\tcout<<i<<endl;\n\t\t\t\tdd++;\n\t\t\t    S=i;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t } \n\t}\n\treturn 0;\n}",ACCEPTED,35,500
1277832556290965504,0633887e77e3cca4aa9085d29d5e990e267168923ec1a8c871a401163bd64992,2020-06-30 13:13:17,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint conversion(int fp,int num,int* array)\n{\n\tint end = 0;\n\tfor (int j = 0; j < 20; j++)\n\t{\n\t\tend++;\n\t\tif (fp < num)\n\t\t{\n\t\t\tarray[j] = fp;\n\t\t\tbreak;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tarray[j] = fp % num;\n\t\t\tfp = (fp - array[j]) / num;\n\t\t}\n\t}\n\treturn end;\n}\nvoid output(int endn, int* Array)\n{\n\tfor (int n = endn - 1; n >= 0; n--)\n\t{\n\t\tif (Array[n] > 9)cout << Array[n] + 55;\n\t\telse cout << Array[n];\n\t}\n}\nint main()\n{\n\tint num;\n\tcin >> num;\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\tint  pow[20] = {};\n\t\tint self[20] = {};\n\t\tint Endnum = conversion(i, num, self);\n\t\tint endnum = conversion(i * i, num, pow);\n\t\t/*int d = i * i;\n\t\tint s = i,Endnum=0;\n\t\tfor (int j = 0; j < 20; j++)\n\t\t{\n\t\t\tEndnum++;\n\t\t\tif (s < num)\n\t\t\t{\n\t\t\t\tself[j] = s;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tself[j] = s % num;\n\t\t\t\ts = (s - self[j]) / num;\n\t\t\t}\n\t\t}\n\t\tint endnum = 0;\n\t\tfor (int j = 0; j < 20; j++)\n\t\t{\n\t\t\tendnum++;\n\t\t\tif (d < num)\n\t\t\t{\n\t\t\t\tpow[j] = d;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tpow[j] = d % num;\n\t\t\t\td = (d - pow[j]) / num; \n\t\t\t}\n\t\t}*/\n\t\tint t = 1;\n\t\tfor (int k=0; k < endnum / 2 + 1; k++)\n\t\t{\n\t\t\tif (pow[k] != pow[endnum - k - 1])t=0;\n\t\t\tif (t == 0)break;\n\t\t}\n\t\tif (t) {\n\t\t\t/*for (int n = Endnum-1; n >=0; n--)\n\t\t\t{\n\t\t\t\tif (self[n] > 9)cout << self[n] + 55;\n\t\t\t\telse cout << self[n];\n\t\t\t}*/\n\t\t\toutput(Endnum, self);\n\t\t\tcout << ' ';\n\t\t\toutput(endnum, pow);\n\t\t\t/*for (int n = 0; n < endnum; n++)\n\t\t\t{\n\t\t\t\tif (pow[n] > 9)cout << pow[n] + 55;\n\t\t\t\telse cout << pow[n];\n\t\t\t}*/\n\t\t\tcout << endl;\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,39,512
1277835250695077888,0633887e77e3cca4aa9085d29d5e990e267168923ec1a8c871a401163bd64992,2020-06-30 13:23:59,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint conversion(int fp,int num,int* array)\n{\n\tint end = 0;\n\tfor (int j = 0; j < 20; j++)\n\t{\n\t\tend++;\n\t\tif (fp < num)\n\t\t{\n\t\t\tarray[j] = fp;\n\t\t\tbreak;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tarray[j] = fp % num;\n\t\t\tfp = (fp - array[j]) / num;\n\t\t}\n\t}\n\treturn end;\n}\nvoid output(int endn, int* Array)\n{\n\tfor (int n = endn - 1; n >= 0; n--)\n\t{\n\t\tif (Array[n] > 9)printf(\""%c\"",Array[n] + 55);\n\t\telse cout << Array[n];\n\t}\n}\nint main()\n{\n\tint num;\n\tcin >> num;\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\tint  pow[20] = {};\n\t\tint self[20] = {};\n\t\tint Endnum = conversion(i, num, self);\n\t\tint endnum = conversion(i * i, num, pow);\n\t\t/*int d = i * i;\n\t\tint s = i,Endnum=0;\n\t\tfor (int j = 0; j < 20; j++)\n\t\t{\n\t\t\tEndnum++;\n\t\t\tif (s < num)\n\t\t\t{\n\t\t\t\tself[j] = s;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tself[j] = s % num;\n\t\t\t\ts = (s - self[j]) / num;\n\t\t\t}\n\t\t}\n\t\tint endnum = 0;\n\t\tfor (int j = 0; j < 20; j++)\n\t\t{\n\t\t\tendnum++;\n\t\t\tif (d < num)\n\t\t\t{\n\t\t\t\tpow[j] = d;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tpow[j] = d % num;\n\t\t\t\td = (d - pow[j]) / num; \n\t\t\t}\n\t\t}*/\n\t\tint t = 1;\n\t\tfor (int k=0; k < endnum / 2 + 1; k++)\n\t\t{\n\t\t\tif (pow[k] != pow[endnum - k - 1])t=0;\n\t\t\tif (t == 0)break;\n\t\t}\n\t\tif (t) {\n\t\t\t/*for (int n = Endnum-1; n >=0; n--)\n\t\t\t{\n\t\t\t\tif (self[n] > 9)cout << self[n] + 55;\n\t\t\t\telse cout << self[n];\n\t\t\t}*/\n\t\t\toutput(Endnum, self);\n\t\t\tcout << ' ';\n\t\t\toutput(endnum, pow);\n\t\t\t/*for (int n = 0; n < endnum; n++)\n\t\t\t{\n\t\t\t\tif (pow[n] > 9)cout << pow[n] + 55;\n\t\t\t\telse cout << pow[n];\n\t\t\t}*/\n\t\t\tcout << endl;\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,23,408
1277837502990188544,241c134c2ed10f5738f19964f53f0184631685646a7786496285a51381cf5b77,2020-06-30 13:32:56,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<cmath>\n\nusing namespace std;\n\nint main()\n{\n    string jzhi(int dig,int b);\n    void hwpd(string,int);\n    int B;\n    string zhijian;\n    \n    cin>>B;\n    for (int i=1;i<=300;i++)\n    {\n        zhijian=jzhi(pow(i,2),B);\n        hwpd(zhijian,i);\n    }\n    return 0;\n}\nstring jzhi(int dig, int b)\n{\n    string jieguo=\""\"";\n    string s=\""0123456789ABCDEFGHIJK\"";\n    while (dig!=0)\n    {\n        jieguo+=s[dig%b];\n        dig=dig/b;\n    }\n    return jieguo;\n}\nvoid hwpd(string chuan,int i)\n{\n    int n=chuan.size();\n    string chuan1=\""\"";\n    for (int i=0;i<n;i++)\n    {\n        chuan1[i]=chuan[n-i-1];\n    }\n    if(chuan1==chuan) cout<<jzhi(i)<<\"" \""<<chuan<<endl;\n}",COMPILE_ERROR,0,0
1277838338969493504,241c134c2ed10f5738f19964f53f0184631685646a7786496285a51381cf5b77,2020-06-30 13:36:15,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<cmath>\n\nusing namespace std;\n\nint main()\n{\n    string jzhi(int dig,int b);\n    int hwpd(string);\n    int B;\n    string zhijian;\n    \n    cin>>B;\n    for (int i=1;i<=300;i++)\n    {\n        zhijian=jzhi(pow(i,2),B);\n        if(hwpd(zhijian)) cout<<jzhi(i,B)<<\"" \""<<zhijian<<endl;\n    }\n    return 0;\n}\nstring jzhi(int dig, int b)\n{\n    string jieguo=\""\"";\n    string s=\""0123456789ABCDEFGHIJK\"";\n    while (dig!=0)\n    {\n        jieguo+=s[dig%b];\n        dig=dig/b;\n    }\n    return jieguo;\n}\nint hwpd(string chuan)\n{\n    int n=chuan.size();\n    string chuan1=\""\"";\n    for (int i=0;i<n;i++)\n    {\n        chuan1[i]=chuan[n-i-1];\n    }\n    if (chuan==chuan1) return 1;\n}",WRONG_ANSWER,49,552
1277840516270456832,3aaf4a732f987c33a81e41e1172d3cf2aa189e2b3924d74038f27ba4d11214e7,2020-06-30 13:44:54,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<stdio.h>\nint f(int i); \nint e (int i,int d);\nint main()\n{\n\tint i,a,b,j=0;\n\tscanf(\""%d %d\"",&b,&a);\n\tfor(i=a+1;j<b;i++)\n\t{\n\t\tif(f(i)==1)\n\t\t{\n\t\t\tprintf(\""%d\\n\"",i);\n\t\t\tj++;\n\t\t}\n\t\ti++;\n\t}\n\t\n}\nint f(int i)\n{\n\tint w=0,flag=2,d;\n\tfor(d=2;d<=10;d++)\n\t{\n\t\tif(e(i,d)==1)\n\t\tw++;\n\t\tif(w==2)\n\t\tflag=1;\n\t\tif(flag==1)\n\t\tbreak;\n\t}\n\treturn flag;\n}\n\nint e (int i,int d)\n{\n\tint a[200000];\n\tint flag=1,m,o;\n\tfor(m=0;i!=0;){\n\t\ta[m]=i%d;\n\t\ti=i/d;\n\t\tm++;\n\t}\n\tfor(o=0;o<=m/2;o++)\n\t{if(a[o]!=a[m-o-1])\n\tflag=2;\n\tif(flag==2)\n\tbreak;\n\t\n\t}\n\treturn flag;\n}\n",WRONG_ANSWER,28,384
1277843967096324096,ccd19aac870035e1025cf6798c4b246ecb4fa0143d857857107fbfcdb093184b,2020-06-30 13:58:37,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nint S,N,n,lenth,t,count2;\nchar a[20];\nvoid Turn(int x,int y){\n    int i=0,lenth=0;\n    while(x>0){\n        a[i]=(x%y+'0');\n        x=x/y;\n        i++;\n        lenth++;\n    }\n}\nbool judge(){\n    Turn(n,t);\n    int i=0,j=lenth-1;\n    while(i<j){\n        if(a[i]!=a[j])\n            return false;\n    }\n    return true;\n}\nint main(){\n    cin>>N>>S;\n    for(int i=S+1;;i++){\n        int count1=0;\n        for(int j=2;j<=10;j++){\n            Turn(i,j);\n            if(judge()){\n                count1++;\n                if(count1==2){\n                    cout<<i<<endl;\n                    count2++;\n                    break;\n                }\n            }\n        }\n        if(count2==N)\n            break;\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,27,424
1277844035358613504,ccd19aac870035e1025cf6798c4b246ecb4fa0143d857857107fbfcdb093184b,2020-06-30 13:58:53,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint N,S,count1,a,b,lenth;\nchar s[20];\nvoid  change(int x,int y){\n    int i=0,lenth=0;\n    while(x){\n        s[i]=x%y+'0';\n        x/=y;\n        i++;\n        lenth++;\n    }\n}\nbool judge(){\n    change(a,b);\n    int i=0,j=lenth-1;\n    while(i<j){\n        if(s[i]!=s[j])\n            return false;\n    }\n    return true;\n}\nint main(){\n    cin>>N>>S;\n    for(int i=S+1;;i++){\n        int count2=0;\n        for(int j=2;j<=10;j++){\n            if(judge()){\n                count2++;\n                if(count2==2){\n                    cout<<i<<endl;\n                    count1++;\n                    break;\n                }\n            }\n        }\n        if(count1==N)\n            break;\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,35,384
1277844363768430592,ccd19aac870035e1025cf6798c4b246ecb4fa0143d857857107fbfcdb093184b,2020-06-30 14:00:12,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint N,S,count1,a,b,lenth;\nchar s[20];\nvoid  change(int x,int y){\n    int i=0,lenth=0;\n    while(x){\n        s[i]=x%y+'0';\n        x/=y;\n        i++;\n        lenth++;\n    }\n}\nbool judge(){\n    change(a,b);\n    int i=0,j=lenth-1;\n    while(i<j){\n        if(s[i]!=s[j])\n            return false;\n    }\n    return true;\n}\nint main(){\n    cin>>N>>S;\n    for(int i=S+1;;i++){\n        int count2=0;\n        for(int j=2;j<=10;j++){\n            a=i,b=j;\n            if(judge()){\n                count2++;\n                if(count2==2){\n                    cout<<i<<endl;\n                    count1++;\n                    break;\n                }\n            }\n        }\n        if(count1==N)\n            break;\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,35,512
1277844574309900288,ccd19aac870035e1025cf6798c4b246ecb4fa0143d857857107fbfcdb093184b,2020-06-30 14:01:02,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint N,S,count1,a,b,lenth;\nchar s[20];\nvoid  change(int x,int y){\n    int i=0,lenth=0;\n    while(x){\n        s[i]=x%y+'0';\n        x/=y;\n        i++;\n        lenth++;\n    }\n}\nbool judge(){\n    change(a,b);\n    int i=0,j=lenth-1;\n    while(i<j){\n        if(s[i]!=s[j])\n            return false;\n    }\n    return true;\n}\nint main(){\n    cin>>N>>S;\n    for(int i=S+1;;i++){\n        int count2=0;\n        for(int j=2;j<=10;j++){\n            a=i,b=j;\n            if(judge()){\n                count2++;\n                if(count2>=2){\n                    cout<<i<<endl;\n                    count1++;\n                    break;\n                }\n            }\n        }\n        if(count1==N)\n            break;\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,37,424
1277845006738456576,2693fac44bc417b4d4164958fe6680f69422107c22e1460145dba7e42bfdc99f,2020-06-30 14:02:45,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <math.h>\n#include <vector>\nusing namespace std;\n\nint main()\n{\n    int B,N;\n    cin >> B;\n\n    for (int i=1;i<300;i++){\n        N = i*i;\n        int a = N;\n        vector<int> num;\n\n        for (int m=0;m<50;m++){\n            int c = a/B;\n            num.push_back(a-c*B);\n\n\n            if (a<B)\n                break;\n            a = a/B;\n        }\n        if (num.size()==1){\n            cout << i << \"" \"" << N << endl;\n        }\n        size_t b = 0;\n        for (size_t m=0;m<num.size()/2;m++){\n            if (num[m]==num[num.size()-m-1]){\n                b++;\n            }\n            if (b==num.size()/2){\n                cout << i << \"" \"" << N << endl;\n            }\n        }\n    }\n\n\n    return 0;\n}",PARTIAL_ACCEPTED,40,512
1277845234854060032,241c134c2ed10f5738f19964f53f0184631685646a7786496285a51381cf5b77,2020-06-30 14:03:39,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<cmath>\n\nusing namespace std;\n\nint main()\n{\n    string jzhi(int dig,int b);\n    int hwpd(string);\n    int B;\n    string zhijian;\n    \n    cin>>B;\n    for (int i=1;i<=300;i++)\n    {\n        zhijian=jzhi(pow(i,2),B);\n        if(hwpd(zhijian)) cout<<jzhi(i,B)<<\"" \""<<zhijian<<endl;\n    }\n    return 0;\n}\nstring jzhi(int dig, int b)\n{\n    string jieguo=\""\"";\n    string s=\""0123456789ABCDEFGHIJK\"";\n    while (dig!=0)\n    {\n        jieguo=s[dig%b]+jieguo;\n        dig=dig/b;\n    }\n    return jieguo;\n}\nint hwpd(string chuan)\n{\n    int n=chuan.length();\n    string chuan1=\""\"";\n    for (int i=0;i<n;i++)\n    {\n        chuan1[i]=chuan[n-i-1];\n    }\n    if (chuan==chuan1) return 1;\n}",WRONG_ANSWER,47,512
1277845680217841664,3aaf4a732f987c33a81e41e1172d3cf2aa189e2b3924d74038f27ba4d11214e7,2020-06-30 14:05:26,C,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<stdio.h>\nint f(int i); \nint e (int i,int d);\nint main()\n{\n\tint i,a,b,j=0;\n\tscanf(\""%d %d\"",&b,&a);\n\tfor(i=a+1;j<b;i++)\n\t{\n\t\tif(f(i)==1)\n\t\t{\n\t\t\tprintf(\""%d\\n\"",i);\n\t\t\tj++;\n\t\t}\n\t\t\n\t}\n\t\n}\nint f(int i)\n{\n\tint w=0,flag=2,d;\n\tfor(d=2;d<=10;d++)\n\t{\n\t\tif(e(i,d)==1)\n\t\tw++;\n\t\tif(w==2)\n\t\tflag=1;\n\t\tif(flag==1)\n\t\tbreak;\n\t}\n\treturn flag;\n}\n\nint e (int i,int d)\n{\n\tint a[200000];\n\tint flag=1,m,o;\n\tfor(m=0;i!=0;){\n\t\ta[m]=i%d;\n\t\ti=i/d;\n\t\tm++;\n\t}\n\tfor(o=0;o<m;o++)\n\t{if(a[o]!=a[m-o-1])\n\tflag=2;\n\tif(flag==2)\n\tbreak;\n\t\n\t}\n\treturn flag;\n}\n",ACCEPTED,28,412
1277847238359842816,241c134c2ed10f5738f19964f53f0184631685646a7786496285a51381cf5b77,2020-06-30 14:11:37,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<cmath>\n\nusing namespace std;\n\nint main()\n{\n    string jzhi(int dig,int b);\n    int hwpd(string);\n    int B;\n    string zhijian;\n    \n    cin>>B;\n    for (int i=1;i<=300;i++)\n    {\n        zhijian=jzhi(pow(i,2),B);\n        if(hwpd(zhijian)) cout<<jzhi(i,B)<<\"" \""<<zhijian<<endl;\n    }\n    return 0;\n}\nstring jzhi(int dig, int b)\n{\n    string jieguo=\""\"";\n    string s=\""0123456789ABCDEFGHIJK\"";\n    while (dig!=0)\n    {\n        jieguo=s[dig%b]+jieguo;\n        dig=dig/b;\n    }\n    return jieguo;\n}\nint hwpd(string chuan)\n{\n    int n=chuan.size();\n    int cishu=0;\n    for (int i=0;i<(n/2);i++)\n    {\n        if(chuan[i]==chuan[n-i-1]) cishu++;\n    }\n    if (cishu==(n/2)) return 1;\n}",WRONG_ANSWER,45,512
1277847621266235392,241c134c2ed10f5738f19964f53f0184631685646a7786496285a51381cf5b77,2020-06-30 14:13:08,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<cmath>\n\nusing namespace std;\n\nint main()\n{\n    string jzhi(int dig,int b);\n    int hwpd(string);\n    int B;\n    string zhijian;\n    \n    cin>>B;\n    for (int i=1;i<=300;i++)\n    {\n        zhijian=jzhi(i*i,B);\n        if(hwpd(zhijian)) cout<<jzhi(i,B)<<\"" \""<<zhijian<<endl;\n    }\n    return 0;\n}\nstring jzhi(int dig, int b)\n{\n    string jieguo=\""\"";\n    string s=\""0123456789ABCDEFGHIJK\"";\n    while (dig!=0)\n    {\n        jieguo=s[dig%b]+jieguo;\n        dig=dig/b;\n    }\n    return jieguo;\n}\nint hwpd(string chuan)\n{\n    int n=chuan.size();\n    int cishu=0;\n    for (int i=0;i<(n/2);i++)\n    {\n        if(chuan[i]==chuan[n-i-1]) cishu++;\n    }\n    if (cishu==(n/2)) return 1;\n}",WRONG_ANSWER,49,512
1277848035734773760,241c134c2ed10f5738f19964f53f0184631685646a7786496285a51381cf5b77,2020-06-30 14:14:47,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<cmath>\n\nusing namespace std;\n\nint main()\n{\n    string jzhi(int dig,int b);\n    int hwpd(string);\n    int B;\n    string zhijian;\n    \n    cin>>B;\n    for (int i=1;i<=300;i++)\n    {\n        zhijian=jzhi(i*i,B);\n        if(hwpd(zhijian)) cout<<jzhi(i,B)<<\"" \""<<zhijian<<endl;\n    }\n    return 0;\n}\nstring jzhi(int dig, int b)\n{\n    string jieguo=\""\"";\n    string s=\""0123456789ABCDEFGHIJK\"";\n    while (dig!=0)\n    {\n        jieguo=s[dig%b]+jieguo;\n        dig=dig/b;\n    }\n    return jieguo;\n}\nint hwpd(string chuan)\n{\n    int n=chuan.size();\n    int cishu=0;\n    for (int i=0;i<(n/2);i++)\n    {\n        if(chuan[i]==chuan[n-i-1]) cishu++;\n    }\n    if (cishu==(n/2)) return 1;\n    else return 0;\n}",ACCEPTED,46,628
1277849251223101440,ec15ae78750b25c4e81c86eedb4f7e0ae0e8ded9c9f3a808f79b07d9475ca31f,2020-06-30 14:19:37,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<algorithm>\n#include<cmath>\n#include<map>\nusing namespace std;\n//char shu[20]{ '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','g','h','i','j' };\nstring reverse_c(string a) {\n\tstring str(a);\n\tstring s(str.rbegin(), str.rend());\n\treturn s;\n}\nchar* myitoa(int num, char* str, int radix)\n{\n\t/* 索引表 */\n\tchar index[] = \""0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"";\n\tunsigned unum; /* 中间变量 */\n\tint i = 0, j, k;\n\t/* 确定unum的值 */\n\tif (radix == 10 && num < 0) /* 十进制负数 */\n\t{\n\t\tunum = (unsigned)-num;\n\t\tstr[i++] = '-';\n\t}\n\telse unum = (unsigned)num; /* 其它情况 */\n\t/* 逆序 */\n\tdo\n\t{\n\t\tstr[i++] = index[unum % (unsigned)radix];\n\t\tunum /= radix;\n\t} while (unum);\n\tstr[i] = '\\0';\n\t/* 转换 */\n\tif (str[0] == '-') k = 1; /* 十进制负数 */\n\telse k = 0;\n\t/* 将原来的“/2”改为“/2.0”，保证当num在16~255之间，radix等于16时，也能得到正确结果 */\n\tchar temp;\n\tfor (j = k; j <= (i - k - 1) / 2.0; j++)\n\t{\n\t\ttemp = str[j];\n\t\tstr[j] = str[i - j - 1];\n\t\tstr[i - j - 1] = temp;\n\t}\n\treturn str;\n}\n\nstring tran(int jz,int num) {\n\tstring ans = \""\"";\n\tdo {\n\t\tint t = num % jz;\n\t\tif (t >= 0 && t <= 9) {\n\t\t\tans += t + '0';\n\t\t}\n\t\telse {\n\t\t\tans += t - 10 + 'a';\n\t\t}\n\t\tnum /= jz;\n\t} while (num != 0);\n\treverse(ans.begin(), ans.end());\n\treturn ans;\n}\nbool compare(string x) {\n\tif (x == reverse_c(x)) {\n\t\treturn true;\n\t}\n\telse {\n\t\treturn false;\n\t}\n}\nint main() {\n\tint n = 10;\n\tcin >> n;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tint num = int(pow(i, 2));\n\t\tchar num_tran_c[100];\n\t\t//char* nn = &num_tran[0];\n\t\tstring num_tran = num_tran_c;\n\t\tmyitoa(num, num_tran_c , n);\n\t\tchar str_n[100];\n\t\tmyitoa(i, str_n, n);\n\t\tif (compare(num_tran)) {\n\t\t\tcout << str_n << \"" \"" << num_tran << endl;\n\t\t}\n\t}\n}\n\n",WRONG_ANSWER,36,512
1277851221518385152,2693fac44bc417b4d4164958fe6680f69422107c22e1460145dba7e42bfdc99f,2020-06-30 14:27:27,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <math.h>\n#include <vector>\n#include <stdlib.h>\nusing namespace std;\n\nint main()\n{\n    int B,N;\n    cin >> B;\n\n    for (int i=1;i<300;i++){\n        N = i*i;\n        int a = N;\n        vector<int> num;\n\n        for (int m=0;m<50;m++){\n            int c = a/B;\n            num.push_back(a-c*B);\n\n\n            if (a<B)\n                break;\n            a = a/B;\n        }\n        if (num.size()==1){\n            cout << i << \"" \"" << N << endl;\n        }\n        size_t b = 0;\n        for (size_t m=0;m<num.size()/2;m++){\n            if (num[m]==num[num.size()-m-1]){\n                b++;\n            }\n            if (b==num.size()/2){\n                char str[100];\n                _itoa(i,str,B);\n                cout << str << \"" \"";\n                for (size_t n=0;n<num.size();n++){\n                    cout << num[n];\n                }\n                cout <<endl;\n\n\n\n\n            }\n\n\n\n        }\n    }\n\n\n    return 0;\n}",COMPILE_ERROR,0,0
1277851232658456576,ec15ae78750b25c4e81c86eedb4f7e0ae0e8ded9c9f3a808f79b07d9475ca31f,2020-06-30 14:27:29,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<algorithm>\n#include<cmath>\n#include<map>\nusing namespace std;\n//char shu[20]{ '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','g','h','i','j' };\nstring reverse_c(string a) {\n\tstring str(a);\n\tstring s(str.rbegin(), str.rend());\n\treturn s;\n}\nchar* myitoa(int num, char* str, int radix)\n{\n\t/* 索引表 */\n\tchar index[] = \""0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"";\n\tunsigned unum; /* 中间变量 */\n\tint i = 0, j, k;\n\t/* 确定unum的值 */\n\tif (radix == 10 && num < 0) /* 十进制负数 */\n\t{\n\t\tunum = (unsigned)-num;\n\t\tstr[i++] = '-';\n\t}\n\telse unum = (unsigned)num; /* 其它情况 */\n\t/* 逆序 */\n\tdo\n\t{\n\t\tstr[i++] = index[unum % (unsigned)radix];\n\t\tunum /= radix;\n\t} while (unum);\n\tstr[i] = '\\0';\n\t/* 转换 */\n\tif (str[0] == '-') k = 1; /* 十进制负数 */\n\telse k = 0;\n\t/* 将原来的“/2”改为“/2.0”，保证当num在16~255之间，radix等于16时，也能得到正确结果 */\n\tchar temp;\n\tfor (j = k; j <= (i - k - 1) / 2.0; j++)\n\t{\n\t\ttemp = str[j];\n\t\tstr[j] = str[i - j - 1];\n\t\tstr[i - j - 1] = temp;\n\t}\n\treturn str;\n}\n\nstring tran(int jz, int num) {\n\tstring ans = \""\"";\n\tdo {\n\t\tint t = num % jz;\n\t\tif (t >= 0 && t <= 9) {\n\t\t\tans += t + '0';\n\t\t}\n\t\telse {\n\t\t\tans += t - 10 + 'a';\n\t\t}\n\t\tnum /= jz;\n\t} while (num != 0);\n\treverse(ans.begin(), ans.end());\n\treturn ans;\n}\nbool compare(string x) {\n\tif (x == reverse_c(x)) {\n\t\treturn true;\n\t}\n\telse {\n\t\treturn false;\n\t}\n}\nint main() {\n\tint n = 10;\n\tcin >> n;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tint num = int(pow(i, 2));\n\t\tchar num_tran_c[100];\n\t\t//char* nn = &num_tran[0];\n\t\tstring num_tran = num_tran_c;\n\t\tmyitoa(num, num_tran_c, n);\n\t\tchar str_n_c[100];\n\t\tstring str_n = str_n_c;\n\t\tmyitoa(i, str_n_c, n);\n\t\tif (compare(num_tran)) {\n\t\t\tcout << str_n << \"" \"" << num_tran << endl;\n\t\t}\n\t}\n}\n\n",PRESENTATION_ERROR,37,424
1277851473143062528,2693fac44bc417b4d4164958fe6680f69422107c22e1460145dba7e42bfdc99f,2020-06-30 14:28:27,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <math.h>\n#include <vector>\n#include<stdio.h> \n#include<stdlib.h> \n\nusing namespace std;\n\nint main()\n{\n    int B,N;\n    cin >> B;\n\n    for (int i=1;i<300;i++){\n        N = i*i;\n        int a = N;\n        vector<int> num;\n\n        for (int m=0;m<50;m++){\n            int c = a/B;\n            num.push_back(a-c*B);\n\n\n            if (a<B)\n                break;\n            a = a/B;\n        }\n        if (num.size()==1){\n            cout << i << \"" \"" << N << endl;\n        }\n        size_t b = 0;\n        for (size_t m=0;m<num.size()/2;m++){\n            if (num[m]==num[num.size()-m-1]){\n                b++;\n            }\n            if (b==num.size()/2){\n                char str[100];\n                _itoa(i,str,B);\n                cout << str << \"" \"";\n                for (size_t n=0;n<num.size();n++){\n                    cout << num[n];\n                }\n                cout <<endl;\n\n\n\n\n            }\n\n\n\n        }\n    }\n\n\n    return 0;\n}",COMPILE_ERROR,0,0
1277851936647217152,ccd19aac870035e1025cf6798c4b246ecb4fa0143d857857107fbfcdb093184b,2020-06-30 14:30:17,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nbool judge(int a,int b){\n    int m[50],lenth=0;\n    while (a>0){\n        lenth++;\n        m[lenth]=a%b;a=a/b;\n    }\n    for(int i=1;i<=lenth/2;i++)\n        if (m[i]!=m[lenth-i+1])\n            return false;\n    return true;\n}\nint main(){\n    int N,S;\n    cin>>N>>S;\n    while (N>0){\n        S++;int count=0;\n        for (int i=2;i<=10;i++)\n            if (judge(S,i)){\n                count++;\n                if (count==2)\n                    break;\n            }\n        if (count==2){\n            cout<<S<<endl;\n            N--;\n        }\n    }\n    return 0;\n}\n",ACCEPTED,43,512
1277852221734060032,c06d2c51f6ee015a87196f6a509c501864576d0518058d2340af825cd0ab9faf,2020-06-30 14:31:25,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <algorithm>\n\nusing namespace std;\n\nconst int maxn = 300;\n\nint b,a[maxn];\n\nvoid zhuanhuan(int x)\n{\n    int a1[maxn];\n    int i = 0;\n    while (x > 0)\n    {\n        a1[++i] = x % b;\n        x /= b;\n    }\n    while (i)\n    {\n        if (a1[i] < 10)\n            printf(\""%d\"", a1[i]);\n        else\n            printf(\""%c\"", a1[i] - 10 + 'A');\n        i--;\n    }\n}\n\nvoid huiwen(int x1)\n{\n    int temp = 0;\n    int x = x1 * x1;\n    while (x > 0)\n    {\n        a[++temp] = x % b;\n        x /= b;\n    }\n    int t = temp, i = temp;\n    while (i > 0 && a[i] == a[t - i + 1])\n        i--;\n    if (i == 0)\n    {\n        zhuanhuan(x1);\n        printf(\"" \"");\n        while (temp)\n        {\n            if (a[temp] < 10)\n                printf(\""%d\"", a[temp]);\n            else\n                printf(\""%c\"", a[temp] - 10 + 'A');\n            temp--;\n        }\n        printf(\""\\n\"");\n    }\n}\n\nint main()\n{\n    scanf(\""%d\"", &b);\n    for (int i = 1; i <= maxn; i++)\n        huiwen(i);\n\n    return 0;\n}",ACCEPTED,35,484
1277853506172542976,2693fac44bc417b4d4164958fe6680f69422107c22e1460145dba7e42bfdc99f,2020-06-30 14:36:31,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <math.h>\n#include <vector>\n#include<stdio.h> \n#include<stdlib.h> \n\nusing namespace std;\n\nint main()\n{\n    int B,N;\n    cin >> B;\n\n    for (int i=1;i<300;i++){\n        N = i*i;\n        int a = N;\n        vector<int> num;\n\n        for (int m=0;m<50;m++){\n            int c = a/B;\n            num.push_back(a-c*B);\n\n\n            if (a<B)\n                break;\n            a = a/B;\n        }\n        if (num.size()==1){\n            cout << i << \"" \"" << N << endl;\n        }\n        size_t b = 0;\n        for (size_t m=0;m<num.size()/2;m++){\n            if (num[m]==num[num.size()-m-1]){\n                b++;\n            }\n            if (b==num.size()/2){\n                char str[100];\n                _itoa(i,str,B);\n                cout << str << \"" \"";\n                for (size_t n=0;n<num.size();n++){\n                    cout << num[n];\n                }\n                cout <<endl;\n\n\n\n\n            }\n\n\n\n        }\n    }\n\n\n    return 0;\n}",COMPILE_ERROR,0,0
1277854675666132992,cc0d763b9b9af8282454127e1f75709799ad3393794bfd64b02be7134b1d1c88,2020-06-30 14:41:10,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<stdio.h>\n#include<malloc.h>\nint Transform(int num);\nchar b[35], a[20] = { \""0123456789ABCDEFGHIJ\"" };\nint main(){\n    char p[40];\nint N,S;\n    scanf(\""%d\"",&N);\n    scanf(\""%d\"",&S);\n    int sum=0;\n    int L = 0;\n    while(r>S){\n        while (L <= r && b[L] == b[r])\n        {\n            L++;r--;\n        }\n        if (L > r)\n        {\n            strcpy(p, b);\n            r = Transform(i);\n            for (int j = r;j >= 0;j--)\n            {printf(\""%c\"", b[j]);\n            printf(\"" %s\\n\"", p);\n        }\n            sum++;\n            if(sum>=N) break;\n    }\n    return 0;\n    \n}\nint Transform(int num)\n{\n    int i = -1;\n    while (num > 0)\n    {\n        b[++i] = a[num % B];\n        num /= B;\n    }\n    return i;\n}",COMPILE_ERROR,0,0
1277854929970987008,cc0d763b9b9af8282454127e1f75709799ad3393794bfd64b02be7134b1d1c88,2020-06-30 14:42:11,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<stdio.h>\n#include<malloc.h>\nint Transform(int num);\nchar b[35], a[20] = { \""0123456789ABCDEFGHIJ\"" };\nint main(){\n    char p[40];\nint N,S;\n    scanf(\""%d\"",&N);\n    scanf(\""%d\"",&S);\n    int sum=0;\n    int L = 0;\n    int r;\n    while(r>S){\n        while (L <= r && b[L] == b[r])\n        {\n            L++;r--;\n        }\n        if (L > r)\n        {\n            strcpy(p, b);\n            r = Transform(i);\n            for (int j = r;j >= 0;j--)\n            {printf(\""%c\"", b[j]);\n            printf(\"" %s\\n\"", p);\n        }\n            sum++;\n            if(sum>=N) break;\n    }\n    return 0;\n    \n}\nint Transform(int num)\n{\n    int i = -1;\n    while (num > 0)\n    {\n        b[++i] = a[num % B];\n        num /= B;\n    }\n    return i;\n}",COMPILE_ERROR,0,0
1277855220392976384,ec15ae78750b25c4e81c86eedb4f7e0ae0e8ded9c9f3a808f79b07d9475ca31f,2020-06-30 14:43:20,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<algorithm>\n#include<cmath>\n#include<sstream>\n#include<map>\nusing namespace std;\nvoid trim(string& s)\n{\n\t\n\tif (!s.empty())\n\t{\n\t\ts.erase(0, s.find_first_not_of(\"" \""));\n\t\ts.erase(s.find_last_not_of(\"" \"") + 1);\n\t}\n\t\n}\n\n//char shu[20]{ '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','g','h','i','j' };\nstring reverse_c(string a) {\n\tstring str(a);\n\tstring s(str.rbegin(), str.rend());\n\treturn s;\n}\nchar* myitoa(int num, char* str, int radix)\n{\n\t/* 索引表 */\n\tchar index[] = \""0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"";\n\tunsigned unum; /* 中间变量 */\n\tint i = 0, j, k;\n\t/* 确定unum的值 */\n\tif (radix == 10 && num < 0) /* 十进制负数 */\n\t{\n\t\tunum = (unsigned)-num;\n\t\tstr[i++] = '-';\n\t}\n\telse unum = (unsigned)num; /* 其它情况 */\n\t/* 逆序 */\n\tdo\n\t{\n\t\tstr[i++] = index[unum % (unsigned)radix];\n\t\tunum /= radix;\n\t} while (unum);\n\tstr[i] = '\\0';\n\t/* 转换 */\n\tif (str[0] == '-') k = 1; /* 十进制负数 */\n\telse k = 0;\n\t/* 将原来的“/2”改为“/2.0”，保证当num在16~255之间，radix等于16时，也能得到正确结果 */\n\tchar temp;\n\tfor (j = k; j <= (i - k - 1) / 2.0; j++)\n\t{\n\t\ttemp = str[j];\n\t\tstr[j] = str[i - j - 1];\n\t\tstr[i - j - 1] = temp;\n\t}\n\treturn str;\n}\n\nstring tran(int jz, int num) {\n\tstring ans = \""\"";\n\tdo {\n\t\tint t = num % jz;\n\t\tif (t >= 0 && t <= 9) {\n\t\t\tans += t + '0';\n\t\t}\n\t\telse {\n\t\t\tans += t - 10 + 'a';\n\t\t}\n\t\tnum /= jz;\n\t} while (num != 0);\n\treverse(ans.begin(), ans.end());\n\treturn ans;\n}\nbool compare(string x) {\n\tif (x == reverse_c(x)) {\n\t\treturn true;\n\t}\n\telse {\n\t\treturn false;\n\t}\n}\nint main() {\n\tint n = 10;\n\tcin >> n;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tint num = int(pow(i, 2));\n\t\tchar num_tran_c[100];\n\t\t//char* nn = &num_tran[0];\n\t\tstring num_tran = num_tran_c;\n\t\tmyitoa(num, num_tran_c, n);\n\t\tchar str_n_c[100];\n\t\tstring str_n = str_n_c;\n\t\tmyitoa(i, str_n_c, n);\n\t\tif (compare(num_tran)) {\n\t\t\ttrim(str_n);\n\t\t\ttrim(num_tran);\n\t\t\tcout << str_n << \"" \"" << num_tran << endl;\n\t\t}\n\t}\n}\n\n",PRESENTATION_ERROR,30,424
1277855557128486912,1b9ad4733213c509d09ebaa55602040d008718ec769109c6fe01578be7d83db2,2020-06-30 14:44:40,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"//Dual Palindromes双重回文数\n#include<bits/stdc++.h>\n\nusing namespace std;\n\nint n; //个数\nint low; //输入的下限\nint b; //b进制\n\n\nbool pal(int a, int b){//判断是否回文\n    int num[500] = {0};\n    //进制转换\n    int t = 0;\n    while(a != 0){\n        num[t++] = a%b;\n        a = a/b;\n    }\n    bool flag = 1;\n    int i = 0;\n    int j = t-1;\n    while(i<j){\n        if(num[i++] != num[j--]){\n            flag = 0;\n        }\n    }\n    //num[500] = {0};\n    return flag;\n}\n\nint main()\n{\n    cin>>n>>low;\n    int outcnt = 0; //输出计数器\n    for(int i = low+1; outcnt<n; i++){\n        int palcnt = 0; //回文计数器\n        for(int b = 2; b<=10 && palcnt<2; b++){//b是进制\n            if(pal(i, b)){\n                palcnt++;\n            }\n        }\n        if(palcnt=2){\n            cout<<i<<endl;\n            outcnt++;\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,25,524
1277856063078981632,49f071a8c19d892715144d4b30350c8d95a7e3e541b9dda969e83d72c9f27b75,2020-06-30 14:46:41,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nstring tran(int a,int b){\n\tstring s=\""\"";\n\tchar temp;\n\tint arr;\n\twhile(a){\n\t\tarr=a%b;\n\t\tif(arr<10){\n\t\t\ttemp=arr+48;\n\t\t}\n\t\telse{\n\t\t\ttemp=arr+55;\n\t\t}\n\t\ts=temp+s;\n\t\ta=a/b;\n\t}\n\treturn s;\n}\nbool f(string s){\n\tstring a=\""\"";\n\tfor(int i=0;i<s.size();i++){\n\t\ta=s[i]+a;\n\t}\n\tif(s==a){\n\t\treturn true;\n\t}\n\telse{\n\t\treturn false;\n\t}\n}\n\nint main(){\n\tint n,a;\n\tstring s;\n\tcin>>n;\n\tfor(int i=1;i<301;i++){\n\t\ta=i*i;\n\t\ts=tran(a,n);\n\t\tif(f(s)){\n\t\t\tcout<<tran(i,n)<<\"" \""<<s<<'\\n';\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,30,488
1277856309544673280,518d926b426c39a8d73fcdfcc6b08b5c49cb5f95ff8ef1884606c5f32c6d333b,2020-06-30 14:47:40,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main()\n{\nint a;\ncin>>a;\nint i=0;\nint num, temp;\nwhile(i<300){\ni++;\nint o=0;\nnum=i*i;\ntemp=i;\nint c[]={0};\nint e[]={0};\nwhile(num)\n{\nc[o]=num%a;\nint t=num/a;\nnum=t;\no++;\n}\nint p=0;\nfor(int t=0;t<o;t++){if(c[t]==c[o-t-1]){p++;}}\nif(p==o){\np=0;\nwhile(temp){\n    e[p]=temp%a;\n    temp=temp/a;\n    p++;}\nfor(int t=p-1;t>=0;t--){cout<<e[t];}\ncout<<\"" \"";\nfor(int t=0;t<o;t++){cout<<c[t];}\ncout<<endl;\n}}\nreturn 0;\n}",WRONG_ANSWER,48,424
1277856346404225024,2693fac44bc417b4d4164958fe6680f69422107c22e1460145dba7e42bfdc99f,2020-06-30 14:47:49,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <math.h>\n#include <vector>\n#include <stdlib.h>\nusing namespace std;\n\n\nint main()\n{\n    int B,N;\n    cin >> B;\n\n    for (int i=1;i<300;i++){\n        N = i*i;\n        int a = N,d = i;\n        vector<int> num,num2;\n\n        for (int m=0;m<50;m++){\n            int c = a/B;\n            num.push_back(a-c*B);\n\n\n            if (a<B)\n                break;\n            a = a/B;\n        }\n\n        for (int m=0;m<50;m++){\n            int e = d/B;\n            num2.push_back(d-e*B);\n\n\n            if (d<B)\n                break;\n            d = d/B;\n        }\n\n        if (num.size()==1){\n            cout << i << \"" \"" << N << endl;\n        }\n        size_t b = 0;\n        for (size_t m=0;m<num.size()/2;m++){\n            if (num[m]==num[num.size()-m-1]){\n                b++;\n            }\n            if (b==num.size()/2){\n\n                for (size_t n=0;n<num2.size();n++){\n                    cout << num2[n];\n                }\n                cout << \"" \"";\n                for (size_t n=0;n<num.size();n++){\n                    cout << num[n];\n                }\n                cout <<endl;\n\n\n\n\n            }\n\n\n\n        }\n    }\n\n\n    return 0;\n}",PARTIAL_ACCEPTED,39,504
1277856465048502272,ec15ae78750b25c4e81c86eedb4f7e0ae0e8ded9c9f3a808f79b07d9475ca31f,2020-06-30 14:48:17,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<algorithm>\n#include<cmath>\n#include<sstream>\n#include<map>\nusing namespace std;\nvoid deleteAllMark(string& s, const string& mark)\n{\n\tsize_t nSize = mark.size();\n\twhile (1)\n\t{\n\t\tsize_t pos = s.find(mark);    //  尤其是这里\n\t\tif (pos == string::npos)\n\t\t{\n\t\t\treturn;\n\t\t}\n\n\t\ts.erase(pos, nSize);\n\t}\n}\n\n\nvoid trim(string& s)\n{\n\t\n\tif (!s.empty())\n\t{\n\t\ts.erase(0, s.find_first_not_of(\"" \""));\n\t\ts.erase(s.find_last_not_of(\"" \"") + 1);\n\t}\n\t\n}\n\n//char shu[20]{ '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','g','h','i','j' };\nstring reverse_c(string a) {\n\tstring str(a);\n\tstring s(str.rbegin(), str.rend());\n\treturn s;\n}\nchar* myitoa(int num, char* str, int radix)\n{\n\t/* 索引表 */\n\tchar index[] = \""0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"";\n\tunsigned unum; /* 中间变量 */\n\tint i = 0, j, k;\n\t/* 确定unum的值 */\n\tif (radix == 10 && num < 0) /* 十进制负数 */\n\t{\n\t\tunum = (unsigned)-num;\n\t\tstr[i++] = '-';\n\t}\n\telse unum = (unsigned)num; /* 其它情况 */\n\t/* 逆序 */\n\tdo\n\t{\n\t\tstr[i++] = index[unum % (unsigned)radix];\n\t\tunum /= radix;\n\t} while (unum);\n\tstr[i] = '\\0';\n\t/* 转换 */\n\tif (str[0] == '-') k = 1; /* 十进制负数 */\n\telse k = 0;\n\t/* 将原来的“/2”改为“/2.0”，保证当num在16~255之间，radix等于16时，也能得到正确结果 */\n\tchar temp;\n\tfor (j = k; j <= (i - k - 1) / 2.0; j++)\n\t{\n\t\ttemp = str[j];\n\t\tstr[j] = str[i - j - 1];\n\t\tstr[i - j - 1] = temp;\n\t}\n\treturn str;\n}\n\nstring tran(int jz, int num) {\n\tstring ans = \""\"";\n\tdo {\n\t\tint t = num % jz;\n\t\tif (t >= 0 && t <= 9) {\n\t\t\tans += t + '0';\n\t\t}\n\t\telse {\n\t\t\tans += t - 10 + 'a';\n\t\t}\n\t\tnum /= jz;\n\t} while (num != 0);\n\treverse(ans.begin(), ans.end());\n\treturn ans;\n}\nbool compare(string x) {\n\tif (x == reverse_c(x)) {\n\t\treturn true;\n\t}\n\telse {\n\t\treturn false;\n\t}\n}\nint main() {\n\tint n = 10;\n\tcin >> n;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tint num = int(pow(i, 2));\n\t\tchar num_tran_c[100];\n\t\t//char* nn = &num_tran[0];\n\t\tstring num_tran = num_tran_c;\n\t\tmyitoa(num, num_tran_c, n);\n\t\tchar str_n_c[100];\n\t\tstring str_n = str_n_c;\n\t\tmyitoa(i, str_n_c, n);\n\t\tif (compare(num_tran)) {\n\t\t\tdeleteAllMark(str_n,\"" \"");\n\t\t\tdeleteAllMark(num_tran,\"" \"");\n\t\t\tcout << str_n << \"" \"" << num_tran << endl;\n\t\t}\n\t}\n}\n\n",PRESENTATION_ERROR,37,640
1277856491803967488,1b9ad4733213c509d09ebaa55602040d008718ec769109c6fe01578be7d83db2,2020-06-30 14:48:23,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"//Dual Palindromes双重回文数\n#include<bits/stdc++.h>\n\nusing namespace std;\n\nbool pal(int a, int b){//判断是否回文\n    int num[500] = {0};\n    //进制转换\n    int t = 0;\n    while(a != 0){\n        num[t++] = a%b;\n        a = a/b;\n    }\n    bool flag = 1;\n    int i = 0;\n    int j = t-1;\n    while(i<j){\n        if(num[i++] != num[j--]){\n            flag = 0;\n        }\n    }\n    //num[500] = {0};\n    return flag;\n}\n\nint main()\n{\n    int n; //个数\n    int low; //输入的下限\n    cin>>n>>low;\n    int outcnt = 0; //输出计数器\n    for(int i = low+1; outcnt<n; i++){\n        int palcnt = 0; //回文计数器\n        for(int b = 2; b<=10 && palcnt<2; b++){//b是进制\n            if(pal(i, b)){\n                palcnt++;\n            }\n        }\n        if(palcnt=2){\n            cout<<i<<endl;\n            outcnt++;\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,36,424
1277856703423381504,1b9ad4733213c509d09ebaa55602040d008718ec769109c6fe01578be7d83db2,2020-06-30 14:49:14,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"//Dual Palindromes双重回文数\n#include<bits/stdc++.h>\n\nusing namespace std;\n\nbool pal(int a, int b){//判断是否回文\n    int num[500] = {0};\n    //进制转换\n    int t = 0;\n    while(a != 0){\n        num[t++] = a%b;\n        a = a/b;\n    }\n    bool flag = 1;\n    int i = 0;\n    int j = t-1;\n    while(i<j){\n        if(num[i++] != num[j--]){\n            flag = 0;\n        }\n    }\n    return flag;\n}\n\nint main()\n{\n    int n; //个数\n    int low; //输入的下限\n    cin>>n>>low;\n    int outcnt = 0; //输出计数器\n    for(int i = low+1; outcnt != n; i++){\n        int palcnt = 0; //回文计数器\n        for(int b = 2; b<=10 && palcnt<2; b++){//b是进制\n            if(pal(i, b)){\n                palcnt++;\n            }\n        }\n        if(palcnt>=2){\n            cout<<i<<endl;\n            outcnt++;\n        }\n    }\n    return 0;\n}",ACCEPTED,39,480
1277857182152843264,ec15ae78750b25c4e81c86eedb4f7e0ae0e8ded9c9f3a808f79b07d9475ca31f,2020-06-30 14:51:08,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<algorithm>\n#include<cmath>\n#include<sstream>\n#include<map>\nusing namespace std;\nvoid deleteAllMark(string& s, const string& mark)\n{\n\tsize_t nSize = mark.size();\n\twhile (1)\n\t{\n\t\tsize_t pos = s.find(mark);    //  尤其是这里\n\t\tif (pos == string::npos)\n\t\t{\n\t\t\treturn;\n\t\t}\n\n\t\ts.erase(pos, nSize);\n\t}\n}\n\n\nvoid trim(string& s)\n{\n\t\n\tif (!s.empty())\n\t{\n\t\ts.erase(0, s.find_first_not_of(\"" \""));\n\t\ts.erase(s.find_last_not_of(\"" \"") + 1);\n\t}\n\t\n}\n\n//char shu[20]{ '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','g','h','i','j' };\nstring reverse_c(string a) {\n\tstring str(a);\n\tstring s(str.rbegin(), str.rend());\n\treturn s;\n}\nchar* myitoa(int num, char* str, int radix)\n{\n\t/* 索引表 */\n\tchar index[] = \""0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"";\n\tunsigned unum; /* 中间变量 */\n\tint i = 0, j, k;\n\t/* 确定unum的值 */\n\tif (radix == 10 && num < 0) /* 十进制负数 */\n\t{\n\t\tunum = (unsigned)-num;\n\t\tstr[i++] = '-';\n\t}\n\telse unum = (unsigned)num; /* 其它情况 */\n\t/* 逆序 */\n\tdo\n\t{\n\t\tstr[i++] = index[unum % (unsigned)radix];\n\t\tunum /= radix;\n\t} while (unum);\n\tstr[i] = '\\0';\n\t/* 转换 */\n\tif (str[0] == '-') k = 1; /* 十进制负数 */\n\telse k = 0;\n\t/* 将原来的“/2”改为“/2.0”，保证当num在16~255之间，radix等于16时，也能得到正确结果 */\n\tchar temp;\n\tfor (j = k; j <= (i - k - 1) / 2.0; j++)\n\t{\n\t\ttemp = str[j];\n\t\tstr[j] = str[i - j - 1];\n\t\tstr[i - j - 1] = temp;\n\t}\n\treturn str;\n}\n\nstring tran(int jz, int num) {\n\tstring ans = \""\"";\n\tdo {\n\t\tint t = num % jz;\n\t\tif (t >= 0 && t <= 9) {\n\t\t\tans += t + '0';\n\t\t}\n\t\telse {\n\t\t\tans += t - 10 + 'a';\n\t\t}\n\t\tnum /= jz;\n\t} while (num != 0);\n\treverse(ans.begin(), ans.end());\n\treturn ans;\n}\nbool compare(string x) {\n\tif (x == reverse_c(x)) {\n\t\treturn true;\n\t}\n\telse {\n\t\treturn false;\n\t}\n}\nint main() {\n\tint n = 10;\n\tcin >> n;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tint num = int(pow(i, 2));\n\t\tchar num_tran_c[100];\n\t\t//char* nn = &num_tran[0];\n\t\tstring num_tran = num_tran_c;\n\t\tmyitoa(num, num_tran_c, n);\n\t\tchar str_n_c[100];\n\t\tstring str_n = str_n_c;\n\t\tmyitoa(i, str_n_c, n);\n\t\tif (compare(num_tran)) {\n\t\t\tdeleteAllMark(str_n,\"" \"");\n\t\t\tdeleteAllMark(num_tran,\"" \"");\n\t\t\tcout << str_n << \"" \"" << num_tran <<\""\\n\"";\n\t\t}\n\t}\n}\n\n",PRESENTATION_ERROR,43,424
1277858348198715392,c06d2c51f6ee015a87196f6a509c501864576d0518058d2340af825cd0ab9faf,2020-06-30 14:55:46,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <cstdio>\n#include <string>\n#include <iostream>\n#include <algorithm>\n#include<vector>\n\nusing namespace std;\n\nconst int sum = 300;\nbool judge(string a){\n    {\n\tstring beforChange = a;\n\tint len = a.size();\n\tchar temp;\n\tfor (int i = 0; i < len / 2; i++) {\n\t\ttemp = a[i];\n\t\ta[i] = a[len - 1 - i];\n\t\ta[len - 1 - i] = temp;\n\t}\n\tif (beforChange == a) {\n\t\treturn true;\n\t}\n\telse {\n\t\treturn false;\n\t}\n    }\n}\n\nstring Itoa(int Num,int r){\n  string remain=\""\"";\n  int temp;\n  do {\n      temp = Num % r;\n      Num /= r;\n      if (temp >= 10)\n          remain += temp - 10 + 'A';\n      else\n          remain += temp + '0';\n  } while (Num);\n  reverse(remain.begin(), remain.end());\n  return remain;\n}\n\nint main()\n{\n    int r;\n    cin >> r;\n    vector<string> www;\n    vector<string> mmm;\n    for (int i = 1; i <= sum; i++){\n       string p=Itoa(i*i,r);\n       int v = judge(p);\n       if(v==1){\n           www.push_back(Itoa(i, r));\n           mmm.push_back(p);\n       }\n       else{\n           continue;\n       }\n    }\n    for (int i = 0; i < www.size();i++){\n        cout << www[i] << \"" \"" << mmm[i] << endl;\n    }\n\n        return 0;\n}",ACCEPTED,41,600
1277858728513036288,2693fac44bc417b4d4164958fe6680f69422107c22e1460145dba7e42bfdc99f,2020-06-30 14:57:17,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <math.h>\n#include <vector>\n#include <stdlib.h>\nusing namespace std;\n\n\nint main()\n{\n    int B,N;\n    cin >> B;\n\n    for (int i=1;i<300;i++){\n        N = i*i;\n        int a = N,d = i;\n        vector<int> num,num2;\n\n        for (int m=0;m<50;m++){\n            int c = a/B;\n            num.push_back(a-c*B);\n\n\n            if (a<B)\n                break;\n            a = a/B;\n        }\n\n        for (int m=0;m<50;m++){\n            int e = d/B;\n            num2.push_back(d-e*B);\n\n\n            if (d<B)\n                break;\n            d = d/B;\n        }\n\n        if (num.size()==1){\n            cout << i << \"" \"" << N << endl;\n        }\n        size_t b = 0;\n        for (size_t m=0;m<num.size()/2;m++){\n            if (num[m]==num[num.size()-m-1]){\n                b++;\n            }\n            if (b==num.size()/2){\n\n                for (int n=num2.size()-1;n>=0;n--){\n                    cout << num2[n];\n                }\n                cout << \"" \"";\n                for (size_t n=0;n<num.size();n++){\n                    cout << num[n];\n                }\n                cout <<endl;\n\n\n\n\n            }\n\n\n\n        }\n    }\n\n\n    return 0;\n}",PARTIAL_ACCEPTED,40,512
1277859881741115393,ec15ae78750b25c4e81c86eedb4f7e0ae0e8ded9c9f3a808f79b07d9475ca31f,2020-06-30 15:01:51,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<algorithm>\n#include<cmath>\n#include<sstream>\n#include<map>\nusing namespace std;\nvoid deleteAllMark(string& s, const string& mark)\n{\n\tsize_t nSize = mark.size();\n\twhile (1)\n\t{\n\t\tsize_t pos = s.find(mark);    //  尤其是这里\n\t\tif (pos == string::npos)\n\t\t{\n\t\t\treturn;\n\t\t}\n\n\t\ts.erase(pos, nSize);\n\t}\n}\n\n\nvoid trim(string& s)\n{\n\t\n\tif (!s.empty())\n\t{\n\t\ts.erase(0, s.find_first_not_of(\"" \""));\n\t\ts.erase(s.find_last_not_of(\"" \"") + 1);\n\t}\n\t\n}\n\n//char shu[20]{ '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','g','h','i','j' };\nstring reverse_c(string a) {\n\tstring str(a);\n\tstring s(str.rbegin(), str.rend());\n\treturn s;\n}\nchar* myitoa(int num, char* str, int radix)\n{\n\t/* 索引表 */\n\tchar index[] = \""0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"";\n\tunsigned unum; /* 中间变量 */\n\tint i = 0, j, k;\n\t/* 确定unum的值 */\n\tif (radix == 10 && num < 0) /* 十进制负数 */\n\t{\n\t\tunum = (unsigned)-num;\n\t\tstr[i++] = '-';\n\t}\n\telse unum = (unsigned)num; /* 其它情况 */\n\t/* 逆序 */\n\tdo\n\t{\n\t\tstr[i++] = index[unum % (unsigned)radix];\n\t\tunum /= radix;\n\t} while (unum);\n\tstr[i] = '\\0';\n\t/* 转换 */\n\tif (str[0] == '-') k = 1; /* 十进制负数 */\n\telse k = 0;\n\t/* 将原来的“/2”改为“/2.0”，保证当num在16~255之间，radix等于16时，也能得到正确结果 */\n\tchar temp;\n\tfor (j = k; j <= (i - k - 1) / 2.0; j++)\n\t{\n\t\ttemp = str[j];\n\t\tstr[j] = str[i - j - 1];\n\t\tstr[i - j - 1] = temp;\n\t}\n\treturn str;\n}\n\nstring tran(int jz, int num) {\n\tstring ans = \""\"";\n\tdo {\n\t\tint t = num % jz;\n\t\tif (t >= 0 && t <= 9) {\n\t\t\tans += t + '0';\n\t\t}\n\t\telse {\n\t\t\tans += t - 10 + 'a';\n\t\t}\n\t\tnum /= jz;\n\t} while (num != 0);\n\treverse(ans.begin(), ans.end());\n\treturn ans;\n}\nbool compare(string x) {\n\tif (x == reverse_c(x)) {\n\t\treturn true;\n\t}\n\telse {\n\t\treturn false;\n\t}\n}\nint main() {\n\tint n = 10;\n\tcin >> n;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tint num = int(pow(i, 2));\n\t\tchar num_tran_c[100];\n\t\t//char* nn = &num_tran[0];\n\t\tstring num_tran = num_tran_c;\n\t\tmyitoa(num, num_tran_c, n);\n\t\tchar str_n_c[100];\n\t\tstring str_n = str_n_c;\n\t\tmyitoa(i, str_n_c, n);\n\t\tif (compare(num_tran)) {\n\t\t\tdeleteAllMark(str_n,\"" \"");\n\t\t\tdeleteAllMark(num_tran,\"" \"");\n\t\t\tint a=atoi(str_n.c_str()), b= atoi(num_tran.c_str());\n\t\t\t\n\t\t\t//printf(\""%d %d\\n\"", str_n, num_tran);\n\t\t\tcout << a << \"" \"" << b << endl;\n\t\t}\n\t}\n}\n\n",WRONG_ANSWER,32,492
1277860169847865344,cc0d763b9b9af8282454127e1f75709799ad3393794bfd64b02be7134b1d1c88,2020-06-30 15:03:00,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<stdio.h>\n#include<string.h>\nint main()\n{\n\tchar m[1000], n[1000], r;\n\tint N, S, len, c;\n\twhile (~scanf(\""%d%d\"", &N, &S)){\n\t\tfor (int i = S + 1;; i++){\n\t\t\tint sum = 0;\n\t\t\t\tfor (int j = 2; j <= 10; j++){\n\t\t\t\t\tint a, b;\n\t\t\t\t\ta = i;\n\t\t\t\t\tlen = 0; \n\t\t\t\t\twhile (a){\n\t\t\t\t\t\tb = a % j; a /= j;\n\t\t\t\t\t\tm[len++] = \""0123456789\""[b];\n\t\t\t\t\t}\n\t\t\t\t\tm[len] = '\\0';\n\t\t\t\t\tfor (char r = len - 1; r >= 0; r--)\n\t\t\t\t\tn[c++] = m[r];\n\t\t\t\t\tn[c] = '\\0';\n\t\t\t\t\tif (strcmp(m,n) == 0)\n\t\t\t\t\t\tsum++;\n\t\t\t\t}\n\t\t\tif (sum >= 2){\n\t\t\t\tN--;\n\t\t\t\tprintf(\""%d\\n\"", i);\n\t\t\t}\n\t\t\tif (N == 0)\n\t\t\t\tbreak;\n\t\t}\n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,21,380
1277860284222332928,ec15ae78750b25c4e81c86eedb4f7e0ae0e8ded9c9f3a808f79b07d9475ca31f,2020-06-30 15:03:27,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<algorithm>\n#include<cmath>\n#include<sstream>\n#include<map>\nusing namespace std;\nvoid deleteAllMark(string& s, const string& mark)\n{\n\tsize_t nSize = mark.size();\n\twhile (1)\n\t{\n\t\tsize_t pos = s.find(mark);    //  尤其是这里\n\t\tif (pos == string::npos)\n\t\t{\n\t\t\treturn;\n\t\t}\n\n\t\ts.erase(pos, nSize);\n\t}\n}\n\n\nvoid trim(string& s)\n{\n\t\n\tif (!s.empty())\n\t{\n\t\ts.erase(0, s.find_first_not_of(\"" \""));\n\t\ts.erase(s.find_last_not_of(\"" \"") + 1);\n\t}\n\t\n}\n\n//char shu[20]{ '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','g','h','i','j' };\nstring reverse_c(string a) {\n\tstring str(a);\n\tstring s(str.rbegin(), str.rend());\n\treturn s;\n}\nchar* myitoa(int num, char* str, int radix)\n{\n\t/* 索引表 */\n\tchar index[] = \""0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"";\n\tunsigned unum; /* 中间变量 */\n\tint i = 0, j, k;\n\t/* 确定unum的值 */\n\tif (radix == 10 && num < 0) /* 十进制负数 */\n\t{\n\t\tunum = (unsigned)-num;\n\t\tstr[i++] = '-';\n\t}\n\telse unum = (unsigned)num; /* 其它情况 */\n\t/* 逆序 */\n\tdo\n\t{\n\t\tstr[i++] = index[unum % (unsigned)radix];\n\t\tunum /= radix;\n\t} while (unum);\n\tstr[i] = '\\0';\n\t/* 转换 */\n\tif (str[0] == '-') k = 1; /* 十进制负数 */\n\telse k = 0;\n\t/* 将原来的“/2”改为“/2.0”，保证当num在16~255之间，radix等于16时，也能得到正确结果 */\n\tchar temp;\n\tfor (j = k; j <= (i - k - 1) / 2.0; j++)\n\t{\n\t\ttemp = str[j];\n\t\tstr[j] = str[i - j - 1];\n\t\tstr[i - j - 1] = temp;\n\t}\n\treturn str;\n}\n\nstring tran(int jz, int num) {\n\tstring ans = \""\"";\n\tdo {\n\t\tint t = num % jz;\n\t\tif (t >= 0 && t <= 9) {\n\t\t\tans += t + '0';\n\t\t}\n\t\telse {\n\t\t\tans += t - 10 + 'a';\n\t\t}\n\t\tnum /= jz;\n\t} while (num != 0);\n\treverse(ans.begin(), ans.end());\n\treturn ans;\n}\nbool compare(string x) {\n\tif (x == reverse_c(x)) {\n\t\treturn true;\n\t}\n\telse {\n\t\treturn false;\n\t}\n}\nint main() {\n\tint n = 10;\n\tcin >> n;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tint num = int(pow(i, 2));\n\t\tchar num_tran_c[100];\n\t\t\n\t\tstring num_tran = num_tran_c;\n\t\tmyitoa(num, num_tran_c, n);\n\t\tchar str_n_c[100];\n\t\tstring str_n = str_n_c;\n\t\tmyitoa(i, str_n_c, n);\n\t\tif (compare(num_tran)) {\n\t\t\tdeleteAllMark(str_n,\"" \"");\n\t\t\tdeleteAllMark(num_tran,\"" \"");\n\t\t\tint a=atoi(str_n.c_str()), b= atoi(num_tran.c_str());\n\t\t\t\n\t\t\t\n\t\t\tcout << a << \"" \"" << b << endl;\n\t\t}\n\t}\n}\n\n",WRONG_ANSWER,27,492
1277861169669267456,cc0d763b9b9af8282454127e1f75709799ad3393794bfd64b02be7134b1d1c88,2020-06-30 15:06:59,C,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<stdio.h>\n#include<string.h>\nint main()\n{\n\tchar m[1000], n[1000], r;\n\tint N, S, len, c;\n\twhile (~scanf(\""%d%d\"", &N, &S)){\n\t\tfor (int i = S + 1;; i++){\n\t\t\tint sum = 0;\n\t\t\t\tfor (int j = 2; j <= 10; j++){\n\t\t\t\t\tint a, b;\n\t\t\t\t\ta = i;\n\t\t\t\t\tlen = 0; \n                    c=0;\n\t\t\t\t\twhile (a){\n\t\t\t\t\t\tb = a % j; a /= j;\n\t\t\t\t\t\tm[len++] = \""0123456789\""[b];\n\t\t\t\t\t}\n\t\t\t\t\tm[len] = '\\0';\n\t\t\t\t\tfor ( r = len - 1; r >= 0; r--)\n\t\t\t\t\tn[c++] = m[r];\n\t\t\t\t\tn[c] = '\\0';\n\t\t\t\t\tif (strcmp(m,n) == 0)\n\t\t\t\t\t\tsum++;\n\t\t\t\t}\n\t\t\tif (sum >= 2){\n\t\t\t\tN--;\n\t\t\t\tprintf(\""%d\\n\"", i);\n\t\t\t}\n\t\t\tif (N == 0)\n\t\t\t\tbreak;\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,24,372
1277861736894357504,518d926b426c39a8d73fcdfcc6b08b5c49cb5f95ff8ef1884606c5f32c6d333b,2020-06-30 15:09:14,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main()\n{\nint a;\ncin>>a;\nconst int b=a;\nint i=0;\nint num, temp;\nwhile(i<300){\ni++;\nint o=0;\nnum=i*i;\ntemp=i;\nint c[]={0};\nint e[]={0};\n\nwhile(num)\n{\nc[o]=num%b;\n\nint t=num/b;\nnum=t;\no++;\n}\nint p=0;\nfor(int t=0;t<o;t++){\n    \n    if(c[t]==c[o-t-1]){;p++;}}\nif(p==o){\np=0;\nwhile(temp){\n    e[p]=temp%b;\n    temp=temp/b;\n    p++;}\nfor(int t=p-1;t>=0;t--){cout<<e[t];}\ncout<<\"" \"";\nfor(int t=0;t<o;t++){cout<<c[t];}\ncout<<endl;\n}}\nreturn 0;\n}",WRONG_ANSWER,35,508
1277862630620856320,ec15ae78750b25c4e81c86eedb4f7e0ae0e8ded9c9f3a808f79b07d9475ca31f,2020-06-30 15:12:47,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<algorithm>\n#include<cmath>\n#include<sstream>\n#include<map>\nusing namespace std;\nvoid deleteAllMark(string& s, const string& mark)\n{\n\tsize_t nSize = mark.size();\n\twhile (1)\n\t{\n\t\tsize_t pos = s.find(mark);    //  尤其是这里\n\t\tif (pos == string::npos)\n\t\t{\n\t\t\treturn;\n\t\t}\n\n\t\ts.erase(pos, nSize);\n\t}\n}\n\n\nvoid trim(string& s)\n{\n\t\n\tif (!s.empty())\n\t{\n\t\ts.erase(0, s.find_first_not_of(\"" \""));\n\t\ts.erase(s.find_last_not_of(\"" \"") + 1);\n\t}\n\t\n}\n\n//char shu[20]{ '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','g','h','i','j' };\nstring reverse_c(string a) {\n\tstring str(a);\n\tstring s(str.rbegin(), str.rend());\n\treturn s;\n}\nchar* myitoa(int num, char* str, int radix)\n{\n\t/* 索引表 */\n\tchar index[] = \""0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"";\n\tunsigned unum; /* 中间变量 */\n\tint i = 0, j, k;\n\t/* 确定unum的值 */\n\tif (radix == 10 && num < 0) /* 十进制负数 */\n\t{\n\t\tunum = (unsigned)-num;\n\t\tstr[i++] = '-';\n\t}\n\telse unum = (unsigned)num; /* 其它情况 */\n\t/* 逆序 */\n\tdo\n\t{\n\t\tstr[i++] = index[unum % (unsigned)radix];\n\t\tunum /= radix;\n\t} while (unum);\n\tstr[i] = '\\0';\n\t/* 转换 */\n\tif (str[0] == '-') k = 1; /* 十进制负数 */\n\telse k = 0;\n\t/* 将原来的“/2”改为“/2.0”，保证当num在16~255之间，radix等于16时，也能得到正确结果 */\n\tchar temp;\n\tfor (j = k; j <= (i - k - 1) / 2.0; j++)\n\t{\n\t\ttemp = str[j];\n\t\tstr[j] = str[i - j - 1];\n\t\tstr[i - j - 1] = temp;\n\t}\n\treturn str;\n}\n\nstring tran(int jz, int num) {\n\tstring ans = \""\"";\n\tdo {\n\t\tint t = num % jz;\n\t\tif (t >= 0 && t <= 9) {\n\t\t\tans += t + '0';\n\t\t}\n\t\telse {\n\t\t\tans += t - 10 + 'a';\n\t\t}\n\t\tnum /= jz;\n\t} while (num != 0);\n\treverse(ans.begin(), ans.end());\n\treturn ans;\n}\nbool compare(string x) {\n\tif (x == reverse_c(x)) {\n\t\treturn true;\n\t}\n\telse {\n\t\treturn false;\n\t}\n}\nint main() {\n\tint n = 10;\n\tcin >> n;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tint num = int(pow(i, 2));\n\t\tchar num_tran_c[100];\n\t\t//char* nn = &num_tran[0];\n\t\tstring num_tran = num_tran_c;\n\t\tmyitoa(num, num_tran_c, n);\n\t\tchar str_n_c[100];\n\t\tstring str_n = str_n_c;\n\t\tmyitoa(i, str_n_c, n);\n\t\tif (compare(num_tran)) {\n\t\t\tdeleteAllMark(str_n,\"" \"");\n\t\t\tdeleteAllMark(num_tran,\"" \"");\n\t\t\tstringstream s1(str_n);\n\t\t\tint a;\n\t\t\ts1>> a;\n\t\t\tstringstream s2(num_tran);\n\t\t\tint b;\n\t\t\ts2 >> b;\n\t\t\t//printf(\""%d %d\\n\"", str_n, num_tran);\n\t\t\tcout << a << \"" \"" << num_tran <<endl;\n\t\t}\n\t}\n}\n\n",WRONG_ANSWER,46,392
1277862785000595456,ec15ae78750b25c4e81c86eedb4f7e0ae0e8ded9c9f3a808f79b07d9475ca31f,2020-06-30 15:13:24,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<algorithm>\n#include<cmath>\n#include<sstream>\n#include<map>\nusing namespace std;\nvoid deleteAllMark(string& s, const string& mark)\n{\n\tsize_t nSize = mark.size();\n\twhile (1)\n\t{\n\t\tsize_t pos = s.find(mark);    //  尤其是这里\n\t\tif (pos == string::npos)\n\t\t{\n\t\t\treturn;\n\t\t}\n\n\t\ts.erase(pos, nSize);\n\t}\n}\n\n\nvoid trim(string& s)\n{\n\t\n\tif (!s.empty())\n\t{\n\t\ts.erase(0, s.find_first_not_of(\"" \""));\n\t\ts.erase(s.find_last_not_of(\"" \"") + 1);\n\t}\n\t\n}\n\n//char shu[20]{ '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','g','h','i','j' };\nstring reverse_c(string a) {\n\tstring str(a);\n\tstring s(str.rbegin(), str.rend());\n\treturn s;\n}\nchar* myitoa(int num, char* str, int radix)\n{\n\t/* 索引表 */\n\tchar index[] = \""0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"";\n\tunsigned unum; /* 中间变量 */\n\tint i = 0, j, k;\n\t/* 确定unum的值 */\n\tif (radix == 10 && num < 0) /* 十进制负数 */\n\t{\n\t\tunum = (unsigned)-num;\n\t\tstr[i++] = '-';\n\t}\n\telse unum = (unsigned)num; /* 其它情况 */\n\t/* 逆序 */\n\tdo\n\t{\n\t\tstr[i++] = index[unum % (unsigned)radix];\n\t\tunum /= radix;\n\t} while (unum);\n\tstr[i] = '\\0';\n\t/* 转换 */\n\tif (str[0] == '-') k = 1; /* 十进制负数 */\n\telse k = 0;\n\t/* 将原来的“/2”改为“/2.0”，保证当num在16~255之间，radix等于16时，也能得到正确结果 */\n\tchar temp;\n\tfor (j = k; j <= (i - k - 1) / 2.0; j++)\n\t{\n\t\ttemp = str[j];\n\t\tstr[j] = str[i - j - 1];\n\t\tstr[i - j - 1] = temp;\n\t}\n\treturn str;\n}\n\nstring tran(int jz, int num) {\n\tstring ans = \""\"";\n\tdo {\n\t\tint t = num % jz;\n\t\tif (t >= 0 && t <= 9) {\n\t\t\tans += t + '0';\n\t\t}\n\t\telse {\n\t\t\tans += t - 10 + 'a';\n\t\t}\n\t\tnum /= jz;\n\t} while (num != 0);\n\treverse(ans.begin(), ans.end());\n\treturn ans;\n}\nbool compare(string x) {\n\tif (x == reverse_c(x)) {\n\t\treturn true;\n\t}\n\telse {\n\t\treturn false;\n\t}\n}\nint main() {\n\tint n = 10;\n\tcin >> n;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tint num = int(pow(i, 2));\n\t\tchar num_tran_c[100];\n\t\t//char* nn = &num_tran[0];\n\t\tstring num_tran = num_tran_c;\n\t\tmyitoa(num, num_tran_c, n);\n\t\tchar str_n_c[100];\n\t\tstring str_n = str_n_c;\n\t\tmyitoa(i, str_n_c, n);\n\t\tif (compare(num_tran)) {\n\t\t\tdeleteAllMark(str_n,\"" \"");\n\t\t\tdeleteAllMark(num_tran,\"" \"");\n\t\t\tstringstream s1(str_n);\n\t\t\tint a;\n\t\t\ts1>> a;\n\t\t\tstringstream s2(num_tran);\n\t\t\tint b;\n\t\t\ts2 >> b;\n\t\t\t//printf(\""%d %d\\n\"", str_n, num_tran);\n\t\t\tcout << str_n << \"" \"" << num_tran <<endl;\n\t\t}\n\t}\n}\n\n",PRESENTATION_ERROR,40,388
1277865038201683968,2693fac44bc417b4d4164958fe6680f69422107c22e1460145dba7e42bfdc99f,2020-06-30 15:22:21,C++,60.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <math.h>\n#include <vector>\n#include <stdlib.h>\nusing namespace std;\n\nbool compare(int a,int b){\n    if (a/10==(b-b/10)&&b/10==(a-a/10)){\n        return true;\n    }\n\n    else if (a==10&&b==1) {\n        return  true;\n    }\n    else if (b==10&&a==1) {\n        return  true;\n    }\n\n    else if (a==b) {\n        return true;\n    }\n    else {\n        return false;\n    }\n};\n\nint main()\n{\n    int B,N;\n    cin >> B;\n    char s[40]={\""0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\""};\n    for (int i=1;i<300;i++){\n        N = i*i;\n        int a = N,d = i;\n        vector<int> num,num2;\n\n        for (int m=0;m<50;m++){\n            int c = a/B;\n            num.push_back(a-c*B);\n\n\n            if (a<B)\n                break;\n            a = a/B;\n        }\n\n        for (int m=0;m<50;m++){\n            int e = d/B;\n            num2.push_back(d-e*B);\n\n\n            if (d<B)\n                break;\n            d = d/B;\n        }\n\n        if (num.size()==1){\n            cout << i << \"" \"" << N << endl;\n        }\n        size_t b = 0;\n        for (size_t m=0;m<num.size()/2;m++){\n            if (num[m]==num[num.size()-m-1]&&(compare(num[m],num[num.size()-m-1]))){\n                b++;\n            }\n            if (b==num.size()/2){\n\n                for (int n=num2.size()-1;n>=0;n--){\n                    cout << s[num2[n]];\n                }\n                cout << \"" \"";\n                for (size_t n=0;n<num.size();n++){\n                    cout << s[num[n]];\n                }\n                cout <<endl;\n\n\n\n\n            }\n\n\n\n        }\n    }\n\n\n    return 0;\n}",PARTIAL_ACCEPTED,36,512
1277865602398486528,2693fac44bc417b4d4164958fe6680f69422107c22e1460145dba7e42bfdc99f,2020-06-30 15:24:35,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <math.h>\n#include <vector>\n#include <stdlib.h>\nusing namespace std;\n\nbool compare(int a,int b){\n    if (a/10==(b-b/10)&&b/10==(a-a/10)){\n        return true;\n    }\n\n    else if (a==10&&b==1) {\n        return  true;\n    }\n    else if (b==10&&a==1) {\n        return  true;\n    }\n\n    else if (a==b) {\n        return true;\n    }\n    else {\n        return false;\n    }\n};\n\nint main()\n{\n    int B,N;\n    cin >> B;\n    char s[40]={\""0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\""};\n    for (int i=1;i<300;i++){\n        N = i*i;\n        int a = N,d = i;\n        vector<int> num,num2;\n\n        for (int m=0;m<50;m++){\n            int c = a/B;\n            num.push_back(a-c*B);\n\n\n            if (a<B)\n                break;\n            a = a/B;\n        }\n\n        for (int m=0;m<50;m++){\n            int e = d/B;\n            num2.push_back(d-e*B);\n\n\n            if (d<B)\n                break;\n            d = d/B;\n        }\n\n        if (num.size()==1){\n            cout << s[i] << \"" \"" << s[N] << endl;\n        }\n        size_t b = 0;\n        for (size_t m=0;m<num.size()/2;m++){\n            if (num[m]==num[num.size()-m-1]&&(compare(num[m],num[num.size()-m-1]))){\n                b++;\n            }\n            if (b==num.size()/2){\n\n                for (int n=num2.size()-1;n>=0;n--){\n                    cout << s[num2[n]];\n                }\n                cout << \"" \"";\n                for (size_t n=0;n<num.size();n++){\n                    cout << s[num[n]];\n                }\n                cout <<endl;\n\n\n\n\n            }\n\n\n\n        }\n    }\n\n\n    return 0;\n}",ACCEPTED,48,424
1277866883829661696,97ea1bdcd6d63ba7387c8b079c3896cb4e4e66bada80587d0a1769fbd740695c,2020-06-30 15:29:41,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include <array>\n#include <string>\n#include <algorithm>\nusing namespace std;\nstring change(int x, int n)\n{\n\tarray<char,10> bigers = { 'A','B','C','D','E','F','G','H','I','J' };\n\tchar biger = '0';\n\tstring resultchange = \""\"";\n\twhile (n != 0)\n\t{\n\t\tchar biger;\n\t\tint tmp = n % x;\n\t\tn = n / x;\n\t\tif (tmp > 9)\n\t\t{\n\t\t\tbiger = bigers[tmp - 10];\n\t\t\tresultchange += (biger + '0');\n\t\t}\n\t\telse\n\t\t{\n\t\t\tresultchange += (tmp + '0');\n\t\t}\n\t}\n\treturn resultchange;\n}\nint main()\n{\n\t\tint n = 0;\n\t\tcin >> n;\n\t\tfor (int i = 1; i <= 300; i++)\n\t\t{\n\t\t\tstring str1 = change(n, i * i);\n\t\t\tstring str2 = str1;\n\t\t\treverse(str1.begin(), str1.end());\n\t\t\tif (str1 == str2)\n\t\t\t{\n\t\t\t\tstring m = change(n, i);\n\t\t\t\treverse(m.begin(), m.end());\n\t\t\t\tcout << m << \"" \"" << str2 << endl;\n\t\t\t}\n\t\t}\n}\n",PARTIAL_ACCEPTED,41,456
1277866905640034304,ec15ae78750b25c4e81c86eedb4f7e0ae0e8ded9c9f3a808f79b07d9475ca31f,2020-06-30 15:29:46,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include<algorithm>\n#include<cmath>\n#include<sstream>\n#include<map>\nusing namespace std;\nstring reverse_c(string a) {\n\tstring str(a);\n\tstring s(str.rbegin(), str.rend());\n\treturn s;\n}\nchar* myitoa(int num, char* str, int radix)\n{\n\n\tchar index[] = \""0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"";\n\tunsigned unum;\n\tint i = 0, j, k;\n\n\tif (radix == 10 && num < 0)\n\t{\n\t\tunum = (unsigned)-num;\n\t\tstr[i++] = '-';\n\t}\n\telse unum = (unsigned)num;\n\n\tdo\n\t{\n\t\tstr[i++] = index[unum % (unsigned)radix];\n\t\tunum /= radix;\n\t} while (unum);\n\tstr[i] = '\\0';\n\n\tif (str[0] == '-') k = 1;\n\telse k = 0;\n\n\tchar temp;\n\tfor (j = k; j <= (i - k - 1) / 2.0; j++)\n\t{\n\t\ttemp = str[j];\n\t\tstr[j] = str[i - j - 1];\n\t\tstr[i - j - 1] = temp;\n\t}\n\treturn str;\n}\nstring tran(int jz, int num) {\n\tstring ans = \""\"";\n\tdo {\n\t\tint t = num % jz;\n\t\tif (t >= 0 && t <= 9) {\n\t\t\tans += t + '0';\n\t\t}\n\t\telse {\n\t\t\tans += t - 10 + 'a';\n\t\t}\n\t\tnum /= jz;\n\t} while (num != 0);\n\treverse(ans.begin(), ans.end());\n\treturn ans;\n}\nbool compare(string x) {\n\tif (x == reverse_c(x)) {\n\t\treturn true;\n\t}\n\telse {\n\t\treturn false;\n\t}\n}\nint main() {\n\tint n, s;\n\tcin >> n >> s;\n\tint S = s + 1;\n\tint flag = 0;\n\twhile (flag < n) {\n\t\tint flag_c=0;\n\t\t\n\t\tfor (int i = 2; i <= 10; i++) {\n\t\t\tchar num_c[100];\n\t\t\tmyitoa(S, num_c, i);\n\t\t\tstring num = num_c;\n\t\t\tif (compare(num)) {\n\t\t\t\tflag_c++;\n\t\t\t}\n\t\t}\n\t\tif (flag_c > 1) {\n\t\t\tcout << S << endl;\n\t\t\tflag++;\n\t\t}\n\t\tS++;\n\t}\n}",ACCEPTED,37,520
1277867110871531520,518d926b426c39a8d73fcdfcc6b08b5c49cb5f95ff8ef1884606c5f32c6d333b,2020-06-30 15:30:35,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint jie(int i,int b){\n    int num;int temp;int c[100];int e[100];\n    int o=0;\n    num=i*i;\n    temp=i;\n\n    while(num)\n    {\n    c[o++]=num%b;\n    int t=num/b;\n    num=t;\n    }\n    int p=0;\n    for(int t=0;t<o;t++){\n    if(c[t]==c[o-t-1]){p++;}}\n    if(p==o){\n    p=0;\n    while(temp){\n        e[p]=temp%b;\n        temp=temp/b;\n        p++;}\n    for(int t=p-1;t>=0;t--){cout<<e[t];}\n    cout<<\"" \"";\n    for(int t=0;t<o;t++){cout<<c[t];}\n    cout<<endl;\n    }}\n\nint main()\n{\nint a;\ncin>>a;\nfor (int i=1;i<=300;i++){\n    jie(i,a);\n}\nreturn 0;\n}\nreturn 0;\n}",COMPILE_ERROR,0,0
1277867151254290432,66dd4fd0958652a0cc99e3cbe7922929c229ab86a6ae302c6fa36b2f56656957,2020-06-30 15:30:45,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<algorithm>\nusing namespace std;\n\nint B{ 0 };\nconst string num[20] = {\""0\"",\""1\"",\""2\"",\""3\"",\""4\"",\""5\"",\""6\"",\""7\"",\""8\"",\""9\"",\""A\"",\""B\"",\""C\"",\""D\"",\""E\"",\""F\"",\""G\"",\""H\"",\""I\"",\""J\""};\n\nstring jinzhi(int a) {\n\tstring x;\n\twhile (a >= B) {\n\t\tx += num[a % B];\n\t\ta = (a - a % B) / B;\n\t}\n\tx += num[a];\n\treverse(x.begin(), x.end());\n\treturn x;\n}\n\nint main() {\n\tcin >> B;\n\tfor (int i = 1; i <= 300;++i) {\n\t\tstring a, b, c;\n\t\ta = jinzhi(i);\n\t\tb = jinzhi(i*i);\n\t\tc = b;\n\t\treverse(b.begin(), b.end());\n\t\tif (b == c) {\n\t\t\tcout << a << \"" \"" << c << endl;\n\t\t}\n\t}\n\n}",ACCEPTED,46,512
1277867162817978368,518d926b426c39a8d73fcdfcc6b08b5c49cb5f95ff8ef1884606c5f32c6d333b,2020-06-30 15:30:47,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint jie(int i,int b){\n    int num;int temp;int c[100];int e[100];\n    int o=0;\n    num=i*i;\n    temp=i;\n\n    while(num)\n    {\n    c[o++]=num%b;\n    int t=num/b;\n    num=t;\n    }\n    int p=0;\n    for(int t=0;t<o;t++){\n    if(c[t]==c[o-t-1]){p++;}}\n    if(p==o){\n    p=0;\n    while(temp){\n        e[p]=temp%b;\n        temp=temp/b;\n        p++;}\n    for(int t=p-1;t>=0;t--){cout<<e[t];}\n    cout<<\"" \"";\n    for(int t=0;t<o;t++){cout<<c[t];}\n    cout<<endl;\n    }}\n\nint main()\n{\nint a;\ncin>>a;\nfor (int i=1;i<=300;i++){\n    jie(i,a);\n}\nreturn 0;\n}",PARTIAL_ACCEPTED,44,484
1277867731104227328,eb87c6d10ddb0751be899e3c6768fbb6eddffb2df6f28da5e524d5069f058f1f,2020-06-30 15:33:03,C++,50.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <cmath>\n#include<stdio.h>\n#include <algorithm>\n#include <vector>\n\nusing namespace std;\n\nbool ifPalindrome(int x, int B){\n    vector<int> num1;\n    int xx=x;\n    int quo=0;\n    int rem=0;\n    while(xx!=0){\n        rem=xx%B;\n        num1.push_back(rem);\n        quo=xx/B;\n        xx=quo;\n    }\n    int len1=num1.size();\n    int count1=0;\n    for(int i=0;i<len1/2;i++){\n        if(num1[i]==num1[len1-i-1])\n            count1++;\n    }\n    if(count1==len1/2)\n        return true;\n    else\n        return false;\n}\n\nbool ifDoubPalin(int x){\n    int count=0;\n    for(int i=2;i<=10;i++){\n        if(ifPalindrome(x, i)){\n            count++;\n        }\n    }\n    if(count>1)\n        return true;\n    else\n        return false;\n}\n\nint main(){\n    int N, S;\n    cin>>N>>S;\n    vector <int>a;\n    int i=1;\n    while(i<=N){\n        for(int j=S;j<13000;j++){\n            if(ifDoubPalin(j)){\n                i++;\n                a.push_back(j);\n            }\n        }\n    }\n    for(int i=0;i<N;i++){\n        cout<<a[i]<<endl;\n    }\n}",PARTIAL_ACCEPTED,307,532
1277868475790319616,eb87c6d10ddb0751be899e3c6768fbb6eddffb2df6f28da5e524d5069f058f1f,2020-06-30 15:36:00,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <cmath>\n#include<stdio.h>\n#include <algorithm>\n#include <vector>\n\nusing namespace std;\n\nbool ifPalindrome(int x, int B){\n    vector<int> num1;\n    int xx=x;\n    int quo=0;\n    int rem=0;\n    while(xx!=0){\n        rem=xx%B;\n        num1.push_back(rem);\n        quo=xx/B;\n        xx=quo;\n    }\n    int len1=num1.size();\n    int count1=0;\n    for(int i=0;i<len1/2;i++){\n        if(num1[i]==num1[len1-i-1])\n            count1++;\n    }\n    if(count1==len1/2)\n        return true;\n    else\n        return false;\n}\n\nbool ifDoubPalin(int x){\n    int count=0;\n    for(int i=2;i<=10;i++){\n        if(ifPalindrome(x, i)){\n            count++;\n        }\n    }\n    if(count>1)\n        return true;\n    else\n        return false;\n}\n\nint main(){\n    int N, S;\n    cin>>N>>S;\n    vector <int>a;\n    int i=1;\n    while(i<=N){\n        for(int j=S+1;j<13000;j++){\n            if(ifDoubPalin(j)){\n                i++;\n                a.push_back(j);\n            }\n        }\n    }\n    for(int i=0;i<N;i++){\n        cout<<a[i]<<endl;\n    }\n}",ACCEPTED,304,512
1277869974436110336,49f071a8c19d892715144d4b30350c8d95a7e3e541b9dda969e83d72c9f27b75,2020-06-30 15:41:58,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nstring tran(int a,int b){\n\tstring s=\""\"";\n\tchar temp;\n\tint arr;\n\twhile(a){\n\t\tarr=a%b;\n\t\tif(arr<10){\n\t\t\ttemp=arr+48;\n\t\t}\n\t\telse{\n\t\t\ttemp=arr+55;\n\t\t}\n\t\ts=temp+s;\n\t\ta=a/b;\n\t}\n\treturn s;\n}\nbool f(string s){\n\tstring a=\""\"";\n\tfor(int i=0;i<s.size();i++){\n\t\ta=s[i]+a;\n\t}\n\tif(s==a){\n\t\treturn true;\n\t}\n\telse{\n\t\treturn false;\n\t}\n}\nint main(){\n    int a,b,c=0,temp=0;\n    cin>>a>>b;\n    for(int i=b+1;true;i++){\n        for(int j=2;j<11;j++){\n            if(f(tran(i,j))){\n                temp++;\n                if(temp==2){\n                    cout<<i<<'\\n';\n                    c++;\n                    break;\n                }\n            }\n        }\n        if(c>=a) break;\n    }\n    \n    return 0;\n}",TIME_LIMIT_EXCEEDED,0,0
1277870520375115776,49f071a8c19d892715144d4b30350c8d95a7e3e541b9dda969e83d72c9f27b75,2020-06-30 15:44:08,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nstring tran(int a,int b){\n\tstring s=\""\"";\n\tchar temp;\n\tint arr;\n\twhile(a){\n\t\tarr=a%b;\n\t\ttemp=arr+48;\n\t\ts=temp+s;\n\t\ta=a/b;\n\t}\n\treturn s;\n}\nbool f(string s){\n\tstring a=\""\"";\n\tfor(int i=0;i<s.size();i++){\n\t\ta=s[i]+a;\n\t}\n\tif(s==a){\n\t\treturn true;\n\t}\n\telse{\n\t\treturn false;\n\t}\n}\nint main(){\n    int a,b,c=0,temp=0;\n    cin>>a>>b;\n    for(int i=b+1;true;i++){\n        for(int j=2;j<11;j++){\n            if(f(tran(i,j))){\n                temp++;\n                if(temp==2){\n                    cout<<i<<'\\n';\n                    c++;\n                    break;\n                }\n            }\n        }\n        if(c>=a) break;\n    }\n    \n    return 0;\n}",TIME_LIMIT_EXCEEDED,0,0
1277870630165217280,b7f9a4062497756b8d037fe1f5f22857918efc573033109086d402dc4707807c,2020-06-30 15:44:34,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\nusing namespace std;\n//十进制转换为任意进制数,除k取余法\n\nstring change(int n,int k)\n{\n    string str;\n    int s[100];\n    int c,m=0;\n    while(n!=0)\n    {\n        c= n % k;\n        n /= k;\n        m++;\n        s[m]=c;//将余数按顺序存入s[n]中\n    }\n    for(int i=m;i>=1;i--)\n    {\n        if(s[i]>10) str+=(char)(s[i]+55);\n        else str+=(char(s[i])+'0');\n    }\n    return str;\n}\nbool isPalindramic(string &str)\n{\n    int len;\n    if(str.length()%2==0) len=str.length();\n    else  len=str.length()-1;\n\n    for(int i=0;i<len/2;i++)\n    {\n        if(str[i]!=str[len-i]){\n            return false;\n            break;\n        }\n    }\n    return true;\n}\nint main()\n{\n    int B;\n    cin>>B;\n    int a1[300],a2[300];\n    string a3[300];\n    for(int i=0;i<300;i++)\n    {\n        a1[i]=i+1;\n        a2[i]=(i+1)*(i+1);\n    }\n    for(int i=0;i<300;i++)\n    {\n        a3[i]=change(a2[i],B);\n        if(isPalindramic(a3[i])) cout<<a1[i]<<\"" \""<<a3[i]<<endl;\n    }\n}\n\n\n",PARTIAL_ACCEPTED,41,512
1277870753511309312,b84f0dba852974b077f34cdfb7f3a0dcdf505a3c646f49eb4728fbb0b4d9d083,2020-06-30 15:45:03,C++,20.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <math.h>\nusing namespace std;\n\nbool judge(int n){\n    int step = 1;\n    while(n/step>=10){\n        step *= 10;\n    }//计算出了n的位数=step\n    while(n>0){\n        int left = n/step;//首位数字\n        int right = n%10;//末尾数字\n        if(left != right){\n            return false;\n        }\n        n = (n%step)/10;//去掉了首末位置以后的数字\n        step /= 100;//去掉了首位两项，故而step/100\n    }\n    return true;\n}\n\nint changeb(int n,int b){\n    int m=0;\n    int step = 1;\n    while(n!=0){\n        m += (n%b)*step;\n        n = n/b;\n        step *= 10;\n    }\n    return m;\n}\nint main(){\n    double b;\n    cin >> b;\n    int list[300]={0};\n    int lists[300] ={0};\n    for(int i=1;i<=300;i++){\n        list[i-1] = i;\n    }//原数\n\n    for(int i=0;i<300;i++){\n        lists[i] = changeb(list[i]*list[i],b);\n    }//平方的b进制\n\n    for(int i=0;i<300;i++){\n        if(judge(lists[i])){\n            cout << changeb(i+1,b) << ' ' << lists[i] << endl;\n        }\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,48,384
1277870906750197760,518d926b426c39a8d73fcdfcc6b08b5c49cb5f95ff8ef1884606c5f32c6d333b,2020-06-30 15:45:40,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint jie(int i,int b){\n    int num;int temp;char c[100];char e[100];\n    int o=0;\n    num=i*i;\n    temp=i;\n    int t;\n    char a[21]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J','K'};\n    while(num)\n    {\n    t=num%b;\n    c[o]=a[t];\n    t=num/b;\n    o++;\n    num=t;\n    }\n    int p=0;\n    for(int t=0;t<o;t++){\n    if(c[t]==c[o-t-1]){p++;}}\n    if(p==o){\n    p=0;\n    while(temp){\n        t=temp%b;\n        e[p]=a[t];\n        temp=temp/b;\n        p++;}\n    for(int t=p-1;t>=0;t--){cout<<e[t];}\n    cout<<\"" \"";\n    for(int t=0;t<o;t++){cout<<c[t];}\n    cout<<endl;\n    }}\n\nint main()\n{\nint a;\ncin>>a;\nfor (int i=1;i<=300;i++){\n    jie(i,a);\n}\nreturn 0;\n}\n\n\n",ACCEPTED,42,508
1277871141606055936,b84f0dba852974b077f34cdfb7f3a0dcdf505a3c646f49eb4728fbb0b4d9d083,2020-06-30 15:46:36,C++,20.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <math.h>\nusing namespace std;\n\nbool judge(int n){\n    int step = 1;\n    while(n/step>=10){\n        step *= 10;\n    }//计算出了n的位数=step\n    while(n>0){\n        int left = n/step;//首位数字\n        int right = n%10;//末尾数字\n        if(left != right){\n            return false;\n        }\n        n = (n%step)/10;//去掉了首末位置以后的数字\n        step /= 100;//去掉了首位两项，故而step/100\n    }\n    return true;\n}\n\nint changeb(int n,int b){\n    int m=0;\n    int step = 1;\n    while(n!=0){\n        m += (n%b)*step;\n        n = n/b;\n        step *= 10;\n    }\n    return m;\n}\nint main(){\n    double b;\n    cin >> b;\n    int list[300]={0};\n    int lists[300] ={0};\n    for(int i=1;i<=300;i++){\n        list[i-1] = i;\n    }//原数\n\n    for(int i=0;i<300;i++){\n        lists[i] = changeb(list[i]*list[i],b);\n    }//平方的b进制\n\n    for(int i=0;i<300;i++){\n        if(judge(lists[i])){\n            cout << changeb(i+1,b) << ' ' << lists[i] << endl;\n        }\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,42,548
1277871683128451072,b7f9a4062497756b8d037fe1f5f22857918efc573033109086d402dc4707807c,2020-06-30 15:48:45,C++,20.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\nusing namespace std;\n//十进制转换为任意进制数,除k取余法\n\nstring change(int n,int k)\n{\n    string str;\n    int s[100];\n    int c,m=0;\n    while(n!=0)\n    {\n        c= n % k;\n        n /= k;\n        m++;\n        s[m]=c;//将余数按顺序存入s[n]中\n    }\n    for(int i=m;i>=1;i--)\n    {\n        if(s[i]>10) str+=(char)(s[i]+55);\n        else str+=(char(s[i])+'0');\n    }\n    return str;\n}\nbool isPalindramic(string &str)\n{\n    int len;\n    if(str.length()%2==0) len=str.length();\n    else  len=str.length()-1;\n\n    for(int i=0;i<len/2;i++)\n    {\n        if(str[i]!=str[len-i]){\n            return false;\n            break;\n        }\n    }\n    return true;\n}\nint main()\n{\n    int B;\n    cin>>B;\n    int a1[300],a2[300];\n    string a3[300],a4[300];\n    for(int i=0;i<300;i++)\n    {\n        a1[i]=i+1;\n        a2[i]=(i+1)*(i+1);\n    }\n    for(int i=0;i<300;i++)\n    {\n        a3[i]=change(a2[i],B);\n        a4[i]=change(a1[i],B);\n        if(isPalindramic(a3[i])) cout<<a4[i]<<\"" \""<<a3[i]<<endl;\n    }\n}\n\n\n",PARTIAL_ACCEPTED,29,544
1277871772135776256,66dd4fd0958652a0cc99e3cbe7922929c229ab86a6ae302c6fa36b2f56656957,2020-06-30 15:49:06,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include<algorithm>\nusing namespace std;\n\nconst string num[10] = {\""0\"",\""1\"",\""2\"",\""3\"",\""4\"",\""5\"",\""6\"",\""7\"",\""8\"",\""9\""};\n\nstring jinzhi(int a,int B) {\n\tstring x;\n\twhile (a >= B) {\n\t\tx += num[a % B];\n\t\ta = (a - a % B) / B;\n\t}\n\tx += num[a];\n\treverse(x.begin(), x.end());\n\treturn x;\n}\n\nint N{ 0 }, S{ 0 };\nint n{ 0 };\nint main() {\n\tcin >> N >> S;\n\tint a{ 0 };//记录找到了几个满足条件的数字\n\tfor (int i = S + 1;i < 99999;++i) {\n\t\tint s{ 0 };//记录几种进制满足要求\n\t\tfor (int b = 2; b <= 10;++b) {\n\t\t\tstring x1, x2;\n\t\t\tx1 = x2 = jinzhi(i, b);\n\t\t\treverse(x2.begin(), x2.end());\n\t\t\tif (x1 == x2) {\n\t\t\t\t++s;\n\t\t\t}\n\t\t\tif (s >= 2) {\n\t\t\t\t++a;\n\t\t\t\tcout << i << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (a == N) break;\n\t}\n}",ACCEPTED,42,408
1277872184758829056,97ea1bdcd6d63ba7387c8b079c3896cb4e4e66bada80587d0a1769fbd740695c,2020-06-30 15:50:45,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include <array>\n#include <string>\n#include <algorithm>\nusing namespace std;\nstring change(int x, int n)\n{\n\tarray<char,10> bigers = { 'A','B','C','D','E','F','G','H','I','J' };\n\tchar biger = '0';\n\tstring resultchange = \""\"";\n\twhile (n != 0)\n\t{\n\t\tchar biger;\n\t\tint tmp = n % x;\n\t\tn = n / x;\n\t\tif (tmp > 9)\n\t\t{\n\t\t\tbiger = bigers[tmp - 10];\n\t\t\tresultchange += (biger + '0');\n\t\t}\n\t\telse\n\t\t{\n\t\t\tresultchange += (tmp + '0');\n\t\t}\n\t}\n\treturn resultchange;\n}\nint main()\n{\n\t\tint n = 0;\n\t\tcin >> n;\n\t\tfor (int i = 1; i <= 300; i++)\n\t\t{\n\t\t\tstring str1 = change(n, i * i);\n\t\t\tstring str2 = str1;\n\t\t\treverse(str1.begin(), str1.end());\n\t\t\tif (str1 == str2)\n\t\t\t{\n\t\t\t\tstring m = change(n, i);\n\t\t\t\treverse(m.begin(), m.end());\n\t\t\t\tcout << m << \"" \"" << str2 << endl;\n\t\t\t}\n\t\t}\n}\n",PARTIAL_ACCEPTED,43,512
1277872965914386432,e39cca8043cb19013671c440a202a288f7f87c73afe6761b2bd045987b1a86c5,2020-06-30 15:53:51,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <cmath>\n#include <string>\nusing namespace std;\nchar b[100];\nint B,n,N,S;\nint l=0;\nvoid change(int x)\n{\n\tint i = 0;\n\tint t;\n\tif( B>=2 && B<10 )\n\t{\n\t\twhile( x > 0 )\n\t\t{\n\t\t\tb[i] = x % B + '0';\n\t\t\tx = x/ B;\n\t\t\ti++;\n\t\t\tl++;\n\t\t}\n\t}\n\telse if( B >= 10 && B <= 20 )\n\t{\n\t\twhile( x > 0 )\n\t\t{\n\t\t\tt = n % B;\n \n\t\t\tif( t < 10 )\n\t\t\t\tb[i] = t + '0';\n\t\t\telse if( t == 10 )\n\t\t\t\tb[i] = 'A';\n\t\t\telse if( t == 11 )\n\t\t\t\tb[i] = 'B';\n\t\t\telse if( t == 12 )\n\t\t\t\tb[i] = 'C';\n\t\t\telse if( t == 13 )\n\t\t\t\tb[i] = 'D';\n\t\t\telse if( t == 14 )\n\t\t\t\tb[i] = 'E';\n\t\t\telse if( t == 15 )\n\t\t\t\tb[i] = 'F';\n\t\t\telse if( t == 16 )\n\t\t\t\tb[i] = 'G';\n\t\t\telse if( t == 17 )\n\t\t\t\tb[i] = 'H';\n\t\t\telse if( t == 18 )\n\t\t\t\tb[i] = 'I';\n\t\t\telse if( t == 19 )\n\t\t\t\tb[i] = 'J';\n \n\t\t\tx = x/ B;\n\t\t\ti++;\n\t\t\tl++;\n\t\t}\n\t}\n}\nbool check()\n{int i,j;\n change(n);\n i=0;\n j=l-1;\n while(i<j)\n {if(b[i]!=b[j])\n {return false;\n  break;}\n  i++;\n  j--;}\n return true;}\nint main()\n{int k=0,h=0;\n\tcin>>N>>S;\n\tn=S+1;\n while(k<N)\n   {for(B=2;B<=10;B++)\n     {change(n);\n    if(check())\n       h++;\n\t}\n   if(h>1)\n\t   {cout<<n;\n   k++;}\n   n++;}\n\n\n\treturn 0;\n}\n",SEGMENTATION_FAULT,35,384
1277873290872283136,2693fac44bc417b4d4164958fe6680f69422107c22e1460145dba7e42bfdc99f,2020-06-30 15:55:08,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <vector>\nusing namespace std;\n\nbool huiwen(int i, int B){\n        int a = i;\n        vector<int> num;\n\n        for (int m=0;m<50;m++){\n            int c = a/B;\n            num.push_back(a-c*B);\n\n\n            if (a<B)\n                break;\n            a = a/B;\n        }\n\n        if (num.size()==1){\n            return true;\n        }\n        size_t b = 0;\n        for (size_t m=0;m<num.size()/2;m++){\n            if (num[m]==num[num.size()-m-1]){\n                b++;\n            }\n            if (b==num.size()/2){\n                return true;\n            }\n\n            else {\n                return false;\n            }\n\n\n\n        }\n        return false;\n\n}\n\nint main()\n{\n    int N,S,n=0,a=0;\n    cin >> N >> S;\n\n    for (int i=S;i<10000;i++){\n        for (int B=2;B<11;B++){\n            if (huiwen(i,B)){\n                a++;\n\n            }\n        }\n        if (a>=2){\n            cout << i << endl;\n            n++;\n        }\n        if (n>N-1)\n            break;\n    }\n\n    return 0;\n}",WRONG_ANSWER,53,512
1277873565817307136,97ea1bdcd6d63ba7387c8b079c3896cb4e4e66bada80587d0a1769fbd740695c,2020-06-30 15:56:14,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include <array>\n#include <string>\n#include <algorithm>\nusing namespace std;\nstring change(int x, int n)\n{\n\tarray<char,10> bigers = { 'A','B','C','D','E','F','G','H','I','J' };\n\tchar biger = '0';\n\tstring resultchange = \""\"";\n\twhile (n != 0)\n\t{\n\t\tchar biger;\n\t\tint tmp = n % x;\n\t\tn = n / x;\n\t\tif (tmp > 9)\n\t\t{\n\t\t\tbiger = bigers[tmp - 10];\n\t\t\tresultchange += (biger + '0');\n\t\t}\n\t\telse\n\t\t{\n            char tmp1=static_cast<char>(tmp);\n\t\t\tresultchange += ( tmp1+ '0');\n\t\t}\n\t}\n\treturn resultchange;\n}\nint main()\n{\n\t\tint n = 0;\n\t\tcin >> n;\n\t\tfor (int i = 1; i <= 300; i++)\n\t\t{\n\t\t\tstring str1 = change(n, i * i);\n\t\t\tstring str2 = str1;\n\t\t\treverse(str1.begin(), str1.end());\n\t\t\tif (str1 == str2)\n\t\t\t{\n\t\t\t\tstring m = change(n, i);\n\t\t\t\treverse(m.begin(), m.end());\n\t\t\t\tcout << m << \"" \"" << str2 << endl;\n\t\t\t}\n\t\t}\n}\n",PARTIAL_ACCEPTED,46,628
1277874306908872704,518d926b426c39a8d73fcdfcc6b08b5c49cb5f95ff8ef1884606c5f32c6d333b,2020-06-30 15:59:11,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint jie(int i,int b){\n    int num;int temp;char c[100];char e[100];\n    int o=0;\n    num=i*i;\n    temp=i;\n    int t;\n    char a[21]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J','K'};\n    while(num)\n    {\n    t=num%b;\n    c[o]=a[t];\n    t=num/b;\n    o++;\n    num=t;\n    }\n    int p=0;\n    for(int t=0;t<o;t++){\n    if(c[t]==c[o-t-1]){p++;}}\n    if(p==o){\n    p=0;\n    while(temp){\n        t=temp%b;\n        e[p]=a[t];\n        temp=temp/b;\n        p++;}\n    for(int t=p-1;t>=0;t--){cout<<e[t];}\n    cout<<\"" \"";\n    for(int t=0;t<o;t++){cout<<c[t];}\n    cout<<endl;\n    }}\n\nint main()\n{\nint a;\ncin>>a;\nfor (int i=1;i<=300;i++){\n    jie(i,a);\n}\nreturn 0;\n}\n\n\n",WRONG_ANSWER,35,612
1277874763442094080,518d926b426c39a8d73fcdfcc6b08b5c49cb5f95ff8ef1884606c5f32c6d333b,2020-06-30 16:01:00,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"\n#include<iostream>\nusing namespace std;\nint jie(int i){\n    int e=0;\n    for(int b=2;b<=10&&e<2;b++){\n    int num;char c[100];\n    int o=0;\n    num=i;\n    int t;\n    char a[21]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J','K'};\n    while(num)\n    {\n    t=num%b;\n    c[o]=a[t];\n    t=num/b;\n    o++;\n    num=t;\n    }\n    int p=0;\n    for(int t=0;t<o;t++){\n    if(c[t]==c[o-t-1]){p++;}}\n    if(p==o){\n       e++;\n    }}\n    if(e>=2){cout<<i<<endl;\n    return 1;}\n    else{return 0;}\n\n}\nint main()\n{\nint a;\ncin>>a;\nint b;\ncin>>b;\nint c=0;\nfor(int i=b+1;c<a;i++){\n   c=c+jie(i);\n}\nreturn 0;\n}\n\n\n\n\n",ACCEPTED,28,424
1277875258516766720,b84f0dba852974b077f34cdfb7f3a0dcdf505a3c646f49eb4728fbb0b4d9d083,2020-06-30 16:02:58,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <math.h>\nusing namespace std;\n\nbool judge(int n){\n    int step = 1;\n    while(n/step>=10){\n        step *= 10;\n    }//计算出了n的位数=step\n    while(n>0){\n        int left = n/step;//首位数字\n        int right = n%10;//末尾数字\n        if(left != right){\n            return false;\n        }\n        n = (n%step)/10;//去掉了首末位置以后的数字\n        step /= 100;//去掉了首位两项，故而step/100\n    }\n    return true;\n}\n\nlong long int changeb(int n,int b){\n    long long int m=0;\n    long long int step = 1;\n    while(n!=0){\n        m += (n%b)*step;\n        n = n/b;\n        step *= 10;\n        cout << n << ' ' << step << ' '<<  m << endl;\n    }\n    return m;\n}\nint main(){\n    double b;\n    cin >> b;\n    int list[300]={0};\n    int lists[300] ={0};\n    for(int i=1;i<=300;i++){\n        list[i-1] = i;\n    }//原数\n\n    for(int i=0;i<300;i++){\n        lists[i] = changeb(list[i]*list[i],b);\n    }//平方的b进制\n\n    for(int i=0;i<300;i++){\n        if(judge(lists[i])){\n            cout << changeb(i+1,b) << ' ' << lists[i] << endl;\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,80,548
1277875356202098688,b84f0dba852974b077f34cdfb7f3a0dcdf505a3c646f49eb4728fbb0b4d9d083,2020-06-30 16:03:21,C++,20.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <math.h>\nusing namespace std;\n\nbool judge(int n){\n    int step = 1;\n    while(n/step>=10){\n        step *= 10;\n    }//计算出了n的位数=step\n    while(n>0){\n        int left = n/step;//首位数字\n        int right = n%10;//末尾数字\n        if(left != right){\n            return false;\n        }\n        n = (n%step)/10;//去掉了首末位置以后的数字\n        step /= 100;//去掉了首位两项，故而step/100\n    }\n    return true;\n}\n\nlong long int changeb(int n,int b){\n    long long int m=0;\n    long long int step = 1;\n    while(n!=0){\n        m += (n%b)*step;\n        n = n/b;\n        step *= 10;\n    }\n    return m;\n}\nint main(){\n    double b;\n    cin >> b;\n    int list[300]={0};\n    int lists[300] ={0};\n    for(int i=1;i<=300;i++){\n        list[i-1] = i;\n    }//原数\n\n    for(int i=0;i<300;i++){\n        lists[i] = changeb(list[i]*list[i],b);\n    }//平方的b进制\n\n    for(int i=0;i<300;i++){\n        if(judge(lists[i])){\n            cout << changeb(i+1,b) << ' ' << lists[i] << endl;\n        }\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,40,512
1277875548770992128,e39cca8043cb19013671c440a202a288f7f87c73afe6761b2bd045987b1a86c5,2020-06-30 16:04:07,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <cmath>\n#include <string>\nusing namespace std;\nchar b[100];\nint B,n,N,S;\nint l=0;\nint change(int k)\n{\n    do\n    {\n        b[++l]=k%B;\n        k/=B;\n    } while (k!=0);\n    return 0;\n}\nbool check()\n{\n    for (int i=1;i<=l/2;i++)\n        if (b[i]!=b[l-i+1])\n            return false;\n    return true;\n}\nint main()\n{int k=0,h=0;\n\tcin>>N>>S;\n\tn=S+1;\n while(k<N)\n   {for(B=2;B<=10;B++)\n     { memset(b,0,sizeof(0));\n\t\t change(n);\n    if(check()==1)\n       h++;\n\t}\n   if(h>1)\n\t   {cout<<n;\n   k++;}\n   n++;}\n\n\n\treturn 0;\n}\n",COMPILE_ERROR,0,0
1277875678735695872,97ea1bdcd6d63ba7387c8b079c3896cb4e4e66bada80587d0a1769fbd740695c,2020-06-30 16:04:38,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include <array>\n#include <string>\n#include <algorithm>\nusing namespace std;\nstring change(int x, int n)\n{\n\tarray<string, 10> bigers = { \""A\"",\""B\"",\""C\"",\""D\"",\""E\"",\""F\"",\""G\"",\""H\"",\""I\"",\""J\"" };\n\tstring resultchange = \""\"";\n\twhile (n != 0)\n\t{\n\t\tint tmp = n % x;\n\t\tn = n / x;\n\t\tif (tmp > 9)\n\t\t{\n\t\t\tresultchange += bigers[tmp - 10];\n\t\t}\n\t\telse\n\t\t{\n\t\t\tchar tmp1 = tmp;\n\t\t\tresultchange += (tmp1 + '0');\n\t\t}\n\t}\n\treturn resultchange;\n}\nint main()\n{\n\tint n = 0;\n\tcin >> n;\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\tstring str1 = change(n, i * i);\n\t\tstring str2 = str1;\n\t\treverse(str1.begin(), str1.end());\n\t\tif (str1 == str2)\n\t\t{\n\t\t\tstring m = change(n, i);\n\t\t\treverse(m.begin(), m.end());\n\t\t\tcout << m << \"" \"" << str2 << endl;\n\t\t}\n\t}\n}\n",ACCEPTED,40,496
1277875750768664576,e39cca8043cb19013671c440a202a288f7f87c73afe6761b2bd045987b1a86c5,2020-06-30 16:04:55,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <cmath>\n#include <string>\n#include<cstdlib>\nusing namespace std;\nchar b[100];\nint B,n,N,S;\nint l=0;\nint change(int k)\n{\n    do\n    {\n        b[++l]=k%B;\n        k/=B;\n    } while (k!=0);\n    return 0;\n}\nbool check()\n{\n    for (int i=1;i<=l/2;i++)\n        if (b[i]!=b[l-i+1])\n            return false;\n    return true;\n}\nint main()\n{int k=0,h=0;\n\tcin>>N>>S;\n\tn=S+1;\n while(k<N)\n   {for(B=2;B<=10;B++)\n     { memset(b,0,sizeof(0));\n\t\t change(n);\n    if(check()==1)\n       h++;\n\t}\n   if(h>1)\n\t   {cout<<n;\n   k++;}\n   n++;}\n\n\n\treturn 0;\n}\n",COMPILE_ERROR,0,0
1277875773489209344,2693fac44bc417b4d4164958fe6680f69422107c22e1460145dba7e42bfdc99f,2020-06-30 16:05:00,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <vector>\nusing namespace std;\n\nbool huiwen(int i, int B){\n        int a = i;\n        vector<int> num;\n\n        for (int m=0;m<50;m++){\n            int c = a/B;\n            num.push_back(a-c*B);\n\n\n            if (a<B)\n                break;\n            a = a/B;\n        }\n\n        if (num.size()==1){\n            return true;\n        }\n        size_t b = 0;\n        for (size_t m=0;m<num.size()/2;m++){\n            if (num[m]==num[num.size()-m-1]){\n                b++;\n            }\n            if (b==num.size()/2){\n                return true;\n            }\n\n            else {\n                return false;\n            }\n\n\n\n        }\n        return false;\n\n}\n\nint main()\n{\n    int N,S,n=0,a=0;\n    cin >> N >> S;\n\n    for (int i=S+1;i<10000;i++){\n        for (int B=2;B<11;B++){\n            if (huiwen(i,B)){\n                a++;\n\n            }\n        }\n        if (a>=2){\n            cout << i << endl;\n            n++;\n        }\n        if (n>N-1)\n            break;\n    }\n\n    return 0;\n}",PARTIAL_ACCEPTED,63,512
1277876626317041664,b84f0dba852974b077f34cdfb7f3a0dcdf505a3c646f49eb4728fbb0b4d9d083,2020-06-30 16:08:24,C++,40.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <math.h>\nusing namespace std;\n\n#include <iostream>\n#include <math.h>\nusing namespace std;\n\nbool judge(long long int n){\n    long long int step = 1;\n    while(n/step>=10){\n        step *= 10;\n    }//计算出了n的位数=step\n    while(n>0){\n        int left = n/step;//首位数字\n        int right = n%10;//末尾数字\n        if(left != right){\n            return false;\n        }\n        n = (n%step)/10;//去掉了首末位置以后的数字\n        step /= 100;//去掉了首位两项，故而step/100\n    }\n    return true;\n}\n\nlong long int changeb(int n,int b){\n    long long int m=0;\n    long long int step = 1;\n    while(n!=0){\n        m += (n%b)*step;\n        n = n/b;\n        step *= 10;\n    }\n    return m;\n}//注意范围过大，导致存在负数\nint main(){\n    int b;\n    cin >> b;\n    long long int list[300]={0};\n    long long int lists[300] ={0};\n    for(int i=1;i<=300;i++){\n        list[i-1] = i*i;\n    }//原数\n\n    for(int i=0;i<300;i++){\n        lists[i] = changeb(list[i],b);\n    }//平方的b进制\n\n    for(int i=0;i<300;i++){\n        if(judge(lists[i])){\n            cout << changeb(i+1,b) << ' ' << lists[i] << endl;\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,41,384
1277876965590106112,b84f0dba852974b077f34cdfb7f3a0dcdf505a3c646f49eb4728fbb0b4d9d083,2020-06-30 16:09:45,C++,40.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <math.h>\nusing namespace std;\n\n#include <iostream>\n#include <math.h>\nusing namespace std;\n\nbool judge(long long int n){\n    long long int step = 1;\n    while(n/step>=10){\n        step *= 10;\n    }//计算出了n的位数=step\n    while(n>0){\n        int left = n/step;//首位数字\n        int right = n%10;//末尾数字\n        if(left != right){\n            return false;\n        }\n        n = (n%step)/10;//去掉了首末位置以后的数字\n        step /= 100;//去掉了首位两项，故而step/100\n    }\n    return true;\n}\n\nlong long int changeb(int n,int b){\n    long long int m=0;\n    long long int step = 1;\n    while(n!=0){\n        m += (n%b)*step;\n        n = n/b;\n        step *= 10;\n    }\n    return m;\n}//注意范围过大，导致存在负数\nint main(){\n    int b;\n    cin >> b;\n    long long int list[300]={0};\n    long long int lists[300] ={0};\n    for(int i=1;i<=300;i++){\n        list[i-1] = i*i;\n    }//原数\n\n    for(int i=0;i<300;i++){\n        lists[i] = changeb(list[i],b);\n    }//平方的b进制\n\n    for(int i=0;i<300;i++){\n        if(judge(lists[i])){\n            cout << changeb(i+1,b) << ' ' << lists[i] << endl;\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,39,492
1277877263775752192,e39cca8043cb19013671c440a202a288f7f87c73afe6761b2bd045987b1a86c5,2020-06-30 16:10:56,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <cmath>\n#include <string>\nusing namespace std;\nchar b[100];\nint B,n,N,S;\nint l=0;\nint change(int k)\n{\n    do\n    {\n        b[++l]=k%B;\n        k/=B;\n    } while (k!=0);\n    return 0;\n}\nbool check()\n{\n    for (int i=1;i<=l/2;i++)\n        if (b[i]!=b[l-i+1])\n            return false;\n    return true;\n}\nint main()\n{int k=0,h=0;\n\tcin>>N>>S;\n\tn=S+1;\n while(k<N)\n   {for(B=2;B<=10;B++)\n     { for(int j=0;j<100;j++)\n\t      b[j]=0;\n\t\t change(n);\n    if(check()==1)\n       h++;\n\t}\n   if(h>1)\n\t   {cout<<n;\n   k++;}\n   n++;}\n\n\n\treturn 0;\n}\n",SEGMENTATION_FAULT,36,384
1277877264832716800,b84f0dba852974b077f34cdfb7f3a0dcdf505a3c646f49eb4728fbb0b4d9d083,2020-06-30 16:10:56,C++,40.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\nbool judge(long long int n){\n    long long int step = 1;\n    while(n/step>=10){\n        step *= 10;\n    }//计算出了n的位数=step\n    while(n>0){\n        long long int left = n/step;//首位数字\n        long long int right = n%10;//末尾数字\n        if(left != right){\n            return false;\n        }\n        n = (n%step)/10;//去掉了首末位置以后的数字\n        step /= 100;//去掉了首位两项，故而step/100\n    }\n    return true;\n}\n\nlong long int changeb(long long int n,int b){\n    long long int m=0;\n    long long int step = 1;\n    while(n!=0){\n        m += (n%b)*step;\n        n = n/b;\n        step *= 10;\n    }\n    return m;\n}//注意范围过大，导致存在负数\nint main(){\n    int b;\n    cin >> b;\n    long long int list[300]={0};\n    long long int lists[300] ={0};\n    for(int i=1;i<=300;i++){\n        list[i-1] = i*i;\n    }//原数\n\n    for(int i=0;i<300;i++){\n        lists[i] = changeb(list[i],b);\n    }//平方的b进制\n\n    for(int i=0;i<300;i++){\n        if(judge(lists[i])){\n            cout << changeb(i+1,b) << ' ' << lists[i] << endl;\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,43,512
1277877350430081024,0633887e77e3cca4aa9085d29d5e990e267168923ec1a8c871a401163bd64992,2020-06-30 16:11:16,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint conversion(int fp, int num, int* array)\n{\n\tint end = 0;\n\tfor (int j = 0; j < 20; j++)\n\t{\n\t\tend++;\n\t\tif (fp < num)\n\t\t{\n\t\t\tarray[j] = fp;\n\t\t\tbreak;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tarray[j] = fp % num;\n\t\t\tfp = (fp - array[j]) / num;\n\t\t}\n\t}\n\treturn end;\n}\nint main()\n{\n\tint N, S; \n\tint Sum = 0;\n\tcin >> N >> S;\n\tfor (int i = S + 1; Sum < N; i++) {\n\t\tint sum = 0;\n\t\tfor (int num = 2; num < 11; num++)\n\t\t{\n\t\t\tint arr[20] = {};\n\t\t\tint endnum = conversion(i, num, arr);\n\t\t\tint t = 1;\n\t\t\tfor (int k = 0; k < endnum / 2 + 1; k++)\n\t\t\t{\n\t\t\t\tif (arr[k] != arr[endnum - k - 1])t = 0;\n\t\t\t\tif (t == 0)break;\n\t\t\t}\n\t\t\tif (t)sum++;\n\t\t\tif (sum > 1) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tSum++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,35,512
1277877886218862592,b6752181378edbb77715b4bc1b0fa55f6e3000b252f7b8c7f798a74e3a5775b7,2020-06-30 16:13:24,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string.h>\n\nusing namespace std;\nint l[10000];\nint w=0;\n\nbool shu(char *m,int w){\n    int sign=0;\n\n    //已知i和l，判断回文\n    for(int k=0;k<w/2;k++){\n        if(m[k]!=m[w-k-1])\n            sign=1;\n    }\n    if(sign!=0)\n        return false;\n    else\n        return true;\n}\n\nint* shuzu(int a,int jingzhi){\n    w=0;\n    do{\n        int t=a%jingzhi;\n        l[w]=t;\n        a=(a-t)/jingzhi;\n        w++;\n    }while(a!=0);//这个是进制下取余数的数组\n\n    return l;\n}\n\nchar li[10000];\n\nchar* change1(int* l){\n    int t=0;\n    for(int j=w-1;j>=0;j--){\n        if(l[j]<10){\n            li[t]=char('0'+l[j]);\n            t++;\n        }\n        else{\n            li[t]=char('a'+l[j]-10);\n            t++;\n        }\n    }\n    return li;\n}\n\nint main(){\n    int n;\n    cin>>n;\n\n    for(int i=1;i<=300;i++){\n        int *p;\n        p=shuzu(i*i,n);\n        char* m=change1(p);\n\n        if(shu(m,w)){\n            cout<<i<<' ';\n            for(int i=0;i<w;i++){\n                cout<<m[i];\n            }\n            cout<<endl;\n        }\n\n    }\n\n    return 0;\n}",PARTIAL_ACCEPTED,43,424
1277878082067685376,61f077a9e57d8b4a25e2ec9778906b09610749bb60fbe7a3181d58b2af3a947c,2020-06-30 16:14:11,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstring>\n#include<algorithm>\nusing namespace std;\n\ninline char c(int x) \n{ \n    if (x >= 0 && x <= 9){\n        return x + '0';\n    }\n    else\n        return x - 10 + 'A';\n    \n}\nint k,L, digt[18],TTT[10];\nvoid node(int x, int n) \n{ \n    for (k = 0; x; k++)\n        digt[k] = x % n, x /= n; \n}\nvoid cansde(int x, int n)\n{\n    for (L = 0; x; L++) {\n        TTT[L] = x % n;\n        x /= n;\n    }\n    for (int i = L - 1; i >= 0; i--)\n        cout << TTT[i];\n}\nvoid output() \n{ \n    for (int i = k - 1; i >= 0; i--)\n        cout << digt[i];\n        //printf(\""%c\"", c(digt[i])); \n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    for (int i = 1; i <= 300; i++)\n    {\n        int e = i * i;\n        node(e,n);\n        int flag = 1;\n        for (int i = 0; i < k; i++) {\n            if (digt[i] != digt[k - i - 1]) {\n                flag = 0;\n                break;\n            }  \n        }\n        if (flag == 1) {\n            cansde(i, n);\n            cout << \"" \"";\n            output();\n            cout << endl;\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,26,512
1277878152989171712,e39cca8043cb19013671c440a202a288f7f87c73afe6761b2bd045987b1a86c5,2020-06-30 16:14:28,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <cmath>\n#include <string>\nusing namespace std;\nchar b[100];\nint B,n,N,S;\nint l=0;\nvoid change(int k)\n{\n    do\n    {\n        b[++l]=k%B;\n        k/=B;\n    } while (k!=0);\n    \n}\nbool check()\n{\n    for (int i=1;i<=l/2;i++)\n        if (b[i]!=b[l-i+1])\n            return false;\n    return true;\n}\nint main()\n{int k=0,h=0;\n\tcin>>N>>S;\n\tn=S+1;\n while(k<N)\n   {for(B=2;B<=10;B++)\n     { for(int j=0;j<100;j++)\n\t      b[j]=0;\n\t\t change(n);\n    if(check()==1)\n       h++;\n\t}\n   if(h>1)\n\t   {cout<<n;\n   k++;}\n   n++;}\n\n\n\treturn 0;\n}",SEGMENTATION_FAULT,35,488
1277878601280577536,8391206ff45c6032f54d13443478c2e8a22ea0166fc475c1576cde97fa6c5e9e,2020-06-30 16:16:15,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cmath>\nusing namespace std;\n\nint transform(int n,int x)//n为要转换进制的数，x为目标进制\n{\n    int a, m = 0,s[100];\n    while(n!=0){\n        a = n%x;\n        n = n/x;\n        m++;\n        s[m] = a;\n    }\n    int y = 0;\n    for(int i = m; i>=1;i--){\n        y = y*10 + s[i];\n    }\n    int y1 = 0;\n    for(int i = 1;i<=m;i++){\n        y1 = y1*10 + s[i];\n    }\n    if(y == y1)\n        return 1;\n    else\n        return 0;\n    \n}\n\n\nint main()\n{\n    int n,s;\n    cin >> n >> s;\n    int ans = s;\n    while(n>0){\n        ans ++;\n        int times = 2;\n        for(int i =2; i<=10;i++){//表示进制\n            if(transform(ans,i))\n                times --;\n            if(times == 0){\n                n--;\n                cout << ans << endl;\n                break;\n            }\n        }\n        \n    }\n    return 0;\n}\n",ACCEPTED,39,424
1277879056253517824,b7f9a4062497756b8d037fe1f5f22857918efc573033109086d402dc4707807c,2020-06-30 16:18:03,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\nusing namespace std;\n//十进制转换为任意进制数,除k取余法\n\nstring change(int n,int k)\n{\n    string str;\n    int s[100];\n    int c,m=0;\n    while(n!=0)\n    {\n        c= n % k;\n        n /= k;\n        m++;\n        s[m]=c;//将余数按顺序存入s[n]中\n    }\n    for(int i=m;i>=1;i--)\n    {\n        if(s[i]>10) str+=(char)(s[i]+55);\n        else str+=(char(s[i])+'0');\n    }\n    return str;\n}\nbool isPalindramic(string str)\n{\n    int len=str.length()-1;\n    int i;\n    for(i=0;str.length()/2;i++)\n    {\n        if(str[i]!=str[len]){\n            break;\n        }\n        len--;\n    }\n\n    if(i>=len) return true;\n    else return false;\n}\nint main()\n{\n    int B;\n    cin>>B;\n    int a1[300],a2[300];\n    string a3[300],a4[300];\n    for(int i=1;i<=300;i++)\n    {\n        a1[i]=i;\n        a2[i]=i*i;\n    }\n    for(int i=1;i<=300;i++)\n    {\n        a3[i]=change(a2[i],B);\n        a4[i]=change(a1[i],B);\n    }\n    for(int i=1;i<=300;i++)\n    {\n        if(isPalindramic(a3[i])) cout<<a3[i]<<\"" \""<<a4[i]<<endl;\n    }\n\n\n\n}\n\n\n",SEGMENTATION_FAULT,36,484
1277879301699985408,b7f9a4062497756b8d037fe1f5f22857918efc573033109086d402dc4707807c,2020-06-30 16:19:02,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\nusing namespace std;\n//十进制转换为任意进制数,除k取余法\n\nstring change(int n,int k)\n{\n    string str;\n    int s[100];\n    int c,m=0;\n    while(n!=0)\n    {\n        c= n % k;\n        n /= k;\n        m++;\n        s[m]=c;//将余数按顺序存入s[n]中\n    }\n    for(int i=m;i>=1;i--)\n    {\n        if(s[i]>10) str+=(char)(s[i]+55);\n        else str+=(char(s[i])+'0');\n    }\n    return str;\n}\nbool isPalindramic(string str)\n{\n    int len=str.length()-1;\n    int i;\n    for(i=0;str.length()/2;i++)\n    {\n        if(str[i]!=str[len]){\n            break;\n        }\n        len--;\n    }\n\n    if(i>=len) return true;\n    else return false;\n}\nint main()\n{\n    int B;\n    cin>>B;\n    int a1[305],a2[305];\n    string a3[305],a4[305];\n    for(int i=1;i<=300;i++)\n    {\n        a1[i]=i;\n        a2[i]=i*i;\n    }\n    for(int i=1;i<=300;i++)\n    {\n        a3[i]=change(a2[i],B);\n        a4[i]=change(a1[i],B);\n    }\n    for(int i=1;i<=300;i++)\n    {\n        if(isPalindramic(a3[i])) cout<<a3[i]<<\"" \""<<a4[i]<<endl;\n    }\n\n\n\n}\n\n\n",WRONG_ANSWER,43,640
1277879498589003776,b7f9a4062497756b8d037fe1f5f22857918efc573033109086d402dc4707807c,2020-06-30 16:19:48,C++,70.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\nusing namespace std;\n//十进制转换为任意进制数,除k取余法\n\nstring change(int n,int k)\n{\n    string str;\n    int s[100];\n    int c,m=0;\n    while(n!=0)\n    {\n        c= n % k;\n        n /= k;\n        m++;\n        s[m]=c;//将余数按顺序存入s[n]中\n    }\n    for(int i=m;i>=1;i--)\n    {\n        if(s[i]>10) str+=(char)(s[i]+55);\n        else str+=(char(s[i])+'0');\n    }\n    return str;\n}\nbool isPalindramic(string str)\n{\n    int len=str.length()-1;\n    int i;\n    for(i=0;str.length()/2;i++)\n    {\n        if(str[i]!=str[len]){\n            break;\n        }\n        len--;\n    }\n\n    if(i>=len) return true;\n    else return false;\n}\nint main()\n{\n    int B;\n    cin>>B;\n    int a1[305],a2[305];\n    string a3[305],a4[305];\n    for(int i=1;i<=300;i++)\n    {\n        a1[i]=i;\n        a2[i]=i*i;\n    }\n    for(int i=1;i<=300;i++)\n    {\n        a3[i]=change(a2[i],B);\n        a4[i]=change(a1[i],B);\n    }\n    for(int i=1;i<=300;i++)\n    {\n        if(isPalindramic(a3[i])) cout<<a4[i]<<\"" \""<<a3[i]<<endl;\n    }\n\n\n\n}\n\n\n",PARTIAL_ACCEPTED,31,412
1277879775882838016,97ea1bdcd6d63ba7387c8b079c3896cb4e4e66bada80587d0a1769fbd740695c,2020-06-30 16:20:55,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include <array>\n#include <string>\n#include <algorithm>\nusing namespace std;\nstring change(int x, int n)\n{\n\tstring resultchange = \""\"";\n\twhile (n != 0)\n\t{\n\t\tint tmp = n % x;\n\t\tn = n / x;\n\t\tchar tmp1 = tmp;\n\t\tresultchange += (tmp1 + '0');\n\t}\n\treturn resultchange;\n}\nint main()\n{\n\tint n = 0;\n\tint s = 0;\n\tcin >> n >> s;\n\tint* arr = new int[n+1];\n\tbool active = true;\n\tint times = 0;\n\tint tmp = s + 1;\n\twhile (active)\n\t{\n\t\tfor (int i = 2; i <= 10; i++)\n\t\t{\n\t\t\tstring str1 = change(i, tmp);\n\t\t\tstring str2 = str1;\n\t\t\treverse(str1.begin(), str1.end());\n\t\t\tif (str2 == str1)\n\t\t\t{\n\t\t\t\t++times;\n\t\t\t\tarr[times] = tmp;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t++tmp;\n\t\tif (times == n)\n\t\t{\n\t\t\tactive=false;\n\t\t}\n\t}\n\tfor (int j = 1; j < n + 1; j++)\n\t{\n\t\tcout << arr[j] << endl;\n\t}\n}\n",PARTIAL_ACCEPTED,21,444
1277880415333834752,b6752181378edbb77715b4bc1b0fa55f6e3000b252f7b8c7f798a74e3a5775b7,2020-06-30 16:23:27,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string.h>\n\nusing namespace std;\nint l[10000];\nint w=0;\n\nbool shu(char *m,int w){\n    int sign=0;\n\n    //已知i和l，判断回文\n    for(int k=0;k<w/2;k++){\n        if(m[k]!=m[w-k-1])\n            sign=1;\n    }\n    if(sign!=0)\n        return false;\n    else\n        return true;\n}\n\nint* shuzu(int a,int jingzhi){\n    w=0;\n    do{\n        int t=a%jingzhi;\n        l[w]=t;\n        a=(a-t)/jingzhi;\n        w++;\n    }while(a!=0);//这个是进制下取余数的数组\n\n    return l;\n}\n\nchar li[10000];\n\nchar* change1(int* l){\n    int t=0;\n    for(int j=w-1;j>=0;j--){\n        if(l[j]<10){\n            li[t]=char('0'+l[j]);\n            t++;\n        }\n        else{\n            li[t]=char('a'+l[j]-10);\n            t++;\n        }\n    }\n    return li;\n}\n\nint main(){\n    int n;\n    cin>>n;\n\n    for(int i=1;i<=300;i++){\n        int *p;\n        p=shuzu(i*i,n);\n        char* m=change1(p);\n\n\n        if(shu(m,w)){\n            int *f;\n            f=shuzu(i,n);\n            char* ff=change1(f);\n            for(int i=0;i<w;i++){\n                cout<<ff[i];\n            }\n\n            cout<<' ';\n\n            int *p;\n            p=shuzu(i*i,n);\n            char* m=change1(p);\n\n            for(int i=0;i<w;i++){\n                cout<<m[i];\n            }\n            cout<<endl;\n        }\n\n    }\n\n    return 0;\n}",PARTIAL_ACCEPTED,40,424
1277880855094026240,b6752181378edbb77715b4bc1b0fa55f6e3000b252f7b8c7f798a74e3a5775b7,2020-06-30 16:25:12,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string.h>\n\nusing namespace std;\nint l[10000];\nint w=0;\n\nbool shu(char *m,int w){\n    int sign=0;\n\n    //已知i和l，判断回文\n    for(int k=0;k<w/2;k++){\n        if(m[k]!=m[w-k-1])\n            sign=1;\n    }\n    if(sign!=0)\n        return false;\n    else\n        return true;\n}\n\nint* shuzu(int a,int jingzhi){\n    w=0;\n    do{\n        int t=a%jingzhi;\n        l[w]=t;\n        a=(a-t)/jingzhi;\n        w++;\n    }while(a!=0);//这个是进制下取余数的数组\n\n    return l;\n}\n\nchar li[10000];\n\nchar* change1(int* l){\n    int t=0;\n    for(int j=w-1;j>=0;j--){\n        if(l[j]<10){\n            li[t]=char('0'+l[j]);\n            t++;\n        }\n        else{\n            li[t]=char('A'+l[j]-10);\n            t++;\n        }\n    }\n    return li;\n}\n\nint main(){\n    int n;\n    cin>>n;\n\n    for(int i=1;i<=300;i++){\n        int *p;\n        p=shuzu(i*i,n);\n        char* m=change1(p);\n\n\n        if(shu(m,w)){\n            int *f;\n            f=shuzu(i,n);\n            char* ff=change1(f);\n            for(int i=0;i<w;i++){\n                cout<<ff[i];\n            }\n\n            cout<<' ';\n\n            int *p;\n            p=shuzu(i*i,n);\n            char* m=change1(p);\n\n            for(int i=0;i<w;i++){\n                cout<<m[i];\n            }\n            cout<<endl;\n        }\n\n    }\n\n    return 0;\n}",ACCEPTED,42,500
1277880899947913216,e39cca8043cb19013671c440a202a288f7f87c73afe6761b2bd045987b1a86c5,2020-06-30 16:25:23,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstdlib>\n#include<cstdio>\n#include<cstring>\nusing namespace std;\nint a[10000];\nint l1,l2;\nint check()\n{\n    for (int i=1;i<=l1/2;i++)\n        if (a[i]!=a[l1-i+1])\n            return 0;\n    return 1;\n}\nint change(int k,int n)\n{\n    l1=0;\n    do\n    {\n        a[++l1]=k%n;\n        k/=n;\n    } while (k!=0);\n    return 0;\n}\nint main()\n{\n    freopen(\""dualpal.in\"",\""r\"",stdin);\n    freopen(\""dualpal.out\"",\""w\"",stdout);\n    int n,m;\n    cin>>n>>m;\n    int i=m+1;\n    int k=0;\n    while(k<n)\n    {\n        int ans=0;\n        for(int j=2;j<=10;j++)\n        {\n            memset(a,0,sizeof(0));\n            change(i,j);\n            if(check()==1)\n             {\n                 ans++;\n             }\n        }\n        if(ans>=2)\n        {\n            cout<<i<<endl;\n            k++;\n        }\n        i++;\n    }\n    return 0;\n}",WRONG_ANSWER,35,432
1277880902372220928,61f077a9e57d8b4a25e2ec9778906b09610749bb60fbe7a3181d58b2af3a947c,2020-06-30 16:25:23,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstring>\n#include<algorithm>\nusing namespace std;\n\ninline char c(int x) \n{ \n    if (x >= 0 && x <= 9){\n        return x + '0';\n    }\n    else\n        return x - 10 + 'A';\n    \n}\nint k,L, digt[18],TTT[10];\nvoid node(int x, int n) \n{ \n    for (k = 0; x; k++)\n        digt[k] = x % n, x /= n; \n}\nvoid cansde(int x, int n)\n{\n    for (L = 0; x; L++) {\n        TTT[L] = x % n;\n        x /= n;\n    }\n    for (int i = L - 1; i >= 0; i--)\n    {\n        if (TTT[i] < 10)\n            cout << TTT[i];\n        else if (TTT[i] == 10)\n            cout << \""A\"";\n        else if (TTT[i] == 11)\n            cout << \""B\"";\n        else if (TTT[i] == 12)\n            cout << \""C\"";\n        else if (TTT[i] == 13)\n            cout << \""D\"";\n        else if (TTT[i] == 14)\n            cout << \""E\"";\n        else if (TTT[i] == 15)\n            cout << \""F\"";\n        else if (TTT[i] == 16)\n            cout << \""G\"";\n        else if (TTT[i] == 17)\n            cout << \""H\"";\n        else if (TTT[i] == 18)\n            cout << \""I\"";\n        else if (TTT[i] == 19)\n            cout << \""J\"";\n        else if (TTT[i] == 20)\n            cout << \""K\"";\n        \n    }\n}\nvoid output() \n{ \n    for (int i = k - 1; i >= 0; i--) {\n        if(digt[i]<10)\n            cout << digt[i];\n        else if(digt[i]==10)\n            cout << \""A\"";\n        else if(digt[i] == 11)\n            cout << \""B\"";\n        else if (digt[i] == 12)\n            cout << \""C\"";\n        else if (digt[i] == 13)\n            cout << \""D\"";\n        else if (digt[i] == 14)\n            cout << \""E\"";\n        else if (digt[i] == 15)\n            cout << \""F\"";\n        else if (digt[i] == 16)\n            cout << \""G\"";\n        else if (digt[i] == 17)\n            cout << \""H\"";\n        else if (digt[i] == 18)\n            cout << \""I\"";\n        else if (digt[i] == 19)\n            cout << \""J\"";\n        else if (digt[i] == 20)\n            cout << \""K\"";\n    }\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    for (int i = 1; i <= 300; i++)\n    {\n        int e = i * i;\n        node(e,n);\n        int flag = 1;\n        for (int i = 0; i < k; i++) {\n            if (digt[i] != digt[k - i - 1]) {\n                flag = 0;\n                break;\n            }  \n        }\n        if (flag == 1) {\n            cansde(i, n);\n            cout << \"" \"";\n            output();\n            cout << endl;\n        }\n    }\n    return 0;\n}\n",ACCEPTED,32,548
1277881095389896704,4924546fb63091b9dab43d0cb5b4f05ed8bbd5b5328d183d03e901d340ed28be,2020-06-30 16:26:09,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint s[301];\nvoid Base_conversion(int a,int b)//a转换b进制 \n{\n    int r=0;\n    while(a)\n\t{\n        s[++r]=a%b;\n        a/=b;\n    }\n    s[0]=r;\n}\nint main()\n{\n    int B;\n    cin >> B;\n    for (int i = 1; i <=300; i++)\n    {\n        Base_conversion(i * i, B);//将300内的每个数的平方转换为B进制\n        bool a=true;\n        for(int j=1;j<=s[0];j++)\n\t    {\n    \t    if(s[j]!=s[s[0]+1-j]) \n                a = false;\n        }\n        if(a)\n\t\t{\n        \tBase_conversion(i,B);\n\t        for(int i=s[0];i>=1;i--)\n            {\n                if(s[i]<=9) \n                    cout<<s[i];\n                else \n                    cout<<(char)(s[i]-10+'A');\n            }\n\t        cout<<\"" \"";\n\t        Base_conversion(i*i,B);\n\t        for(int i=s[0];i>=1;i--)\n            {\n                if(s[i]<=9) \n                    cout<<s[i];\n                else \n                    cout<<(char)(s[i]-10+'A');\n            }\n            cout << endl;\n        }    \n    }\n    return 0;\n}\n\n",ACCEPTED,40,424
1277881162389708800,97ea1bdcd6d63ba7387c8b079c3896cb4e4e66bada80587d0a1769fbd740695c,2020-06-30 16:26:25,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include <array>\n#include <string>\n#include <algorithm>\nusing namespace std;\nstring change(int x, int n)\n{\n\tstring resultchange = \""\"";\n\twhile (n != 0)\n\t{\n\t\tint tmp = n % x;\n\t\tn = n / x;\n\t\tchar tmp1 = tmp;\n\t\tresultchange += (tmp1 + '0');\n\t}\n\treturn resultchange;\n}\nint main()\n{\n\tint n = 0;\n\tint s = 0;\n\tcin >> n >> s;\n\tint* arr = new int[n+1];\n\tbool active = true;\n\tint times = 0;\n\tint tmp = s + 1;\n\twhile (active)\n\t{\n        int time=0;\n\t\tfor (int i = 2; i <= 10; i++)\n\t\t{\n\t\t\tstring str1 = change(i, tmp);\n\t\t\tstring str2 = str1;\n\t\t\treverse(str1.begin(), str1.end());\n\t\t\tif (str2 == str1)\n\t\t\t{\n                ++time;\n                if(time>1)\n                {\n                    ++times;\n\t\t\t\tarr[times] = tmp;\n\t\t\t\tbreak;\n                }\n\t\t\t}\n\t\t}\n\t\t++tmp;\n\t\tif (times == n)\n\t\t{\n\t\t\tactive=false;\n\t\t}\n\t}\n\tfor (int j = 1; j < n + 1; j++)\n\t{\n\t\tcout << arr[j] << endl;\n\t}\n}\n",ACCEPTED,28,500
1277881394615738368,64a5ab3b5dce8f7bdf3da47e4cfc65a9cbd5dfbdfcad825bc89cdd2fa78eb1a3,2020-06-30 16:27:21,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <algorithm>\nusing namespace std;\n\nbool judgeR(string s,int i){\n    for(int j=0;j<=i;j++){\n        if(s[j]!=s[i-j-1]) return false;\n    }\n    return true;\n}\nchar tranNumToChar(int n){\n    string s=\""0123456789ABCDEFGHIJ\"";\n    return s[n];\n}\n\nstring octToAny(int x,const int B){\n    string res=\""\"";\n    while (x!=0) {\n        res+=tranNumToChar(x%B);\n        x=x/B;\n    }\n    reverse(res.begin(),res.end());\n    return res;\n}\nbool palin2to10(int x){\n    for(int k=2;k<=10;k++){\n        string ss;\n        ss=octToAny(x,k);\n        if(judgeR(ss,ss.length()))\n            return true;\n    }\n    return false;\n}\nint main()\n{\n    int n,s;\n    cin >> n >> s;\n    for(int i=s+1;n>0;i++){\n        if(palin2to10(i)){\n            cout << i << endl;\n            n--;\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,39,384
1277881876398669824,e39cca8043cb19013671c440a202a288f7f87c73afe6761b2bd045987b1a86c5,2020-06-30 16:29:15,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstdlib>\n#include<cstdio>\n#include<cstring>\nusing namespace std;\nchar b[100];\nint N,S;\nint l=0;\nvoid change(int k,int B)\n{\n    do\n    {\n        b[++l]=k%B;\n        k/=B;\n    } while (k!=0);\n    \n}\nbool check()\n{\n    for (int i=1;i<=l/2;i++)\n        if (b[i]!=b[l-i+1])\n            return false;\n    return true;\n}\nint main()\n{int k=0,h=0,n;\n\tcin>>N>>S;\n\tn=S+1;\n while(k<N)\n   {for(int j=2;j<=10;j++)\n     { memset(b,0,sizeof(0));\n\t\t change(n,j);\n    if(check()==1)\n       h++;\n\t}\n   if(h>1)\n\t   {cout<<n;\n   k++;}\n   n++;}\n\n\n\treturn 0;\n}\n",SEGMENTATION_FAULT,35,512
1277882365051863040,e39cca8043cb19013671c440a202a288f7f87c73afe6761b2bd045987b1a86c5,2020-06-30 16:31:12,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cmath>\n#include <string>\nusing namespace std;\nchar b[100];\nint B,n;\nint l=0;\nvoid change(int x) {\n    int j=0;\n    while(x!=0) {\n        \n        b[j]=x%B+'0';\n        if(b[j]>'9')\n\t\t\tb[j]=b[j]-10+'A';\n        x/=B;\n\t\tj++;\n\t\tl++;\n\t}}\nbool check()\n{int i,j;\n change(n);\n i=0;\n j=l-1;\n while(i<j)\n {if(b[i]!=b[j])\n {return false;\n  break;}\n  i++;\n  j--;}\n return true;}\nvoid display(int q)\n{int i;\n change(q);\n for(i=l-1;i>=0;i--)\n\t cout<<b[i];}\nint main()\n{cin>>B;\n for(int i=1;i<=300;i++)\n {\n\t n=i*i;\n\t if(check())\n\t {display(i);\n\t  cout<<\"" \"";\n\t  display(n);\n\t  cout<<\""\\n\"";\n\t }}\n\n\treturn 0;\n}\n",MULTIPLE_ERROR,40,424
1277882906930774016,64a5ab3b5dce8f7bdf3da47e4cfc65a9cbd5dfbdfcad825bc89cdd2fa78eb1a3,2020-06-30 16:33:21,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nbool judgeR(string s,int i){\n    for(int j=0;j<=i;j++){\n        if(s[j]!=s[i-j-1]) return false;\n    }\n    return true;\n}\nchar tranNumToChar(int n){\n    string s=\""0123456789ABCDEFGHIJ\"";\n    return s[n];\n}\n\nstring octToAny(int x,const int B){\n    string res=\""\"";\n    while (x!=0) {\n        res+=tranNumToChar(x%B);\n        x=x/B;\n    }\n    reverse(res.begin(),res.end());\n    return res;\n}\nbool palin2to10(int x){\n    int count=0;\n    for(int k=2;k<=10;k++){\n        string ss;\n        ss=octToAny(x,k);\n        if(judgeR(ss,ss.length())){\n            count++;\n            if(count>=2) return true;\n        }\n\n    }\n    return false;\n}\nint main()\n{\n    int n,s;\n    cin >> n >> s;\n    for(int i=s+1;n>0;i++){\n        if(palin2to10(i)){\n            cout << i << endl;\n            n--;\n        }\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1277882990963654656,64a5ab3b5dce8f7bdf3da47e4cfc65a9cbd5dfbdfcad825bc89cdd2fa78eb1a3,2020-06-30 16:33:41,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <algorithm>\nusing namespace std;\n\nbool judgeR(string s,int i){\n    for(int j=0;j<=i;j++){\n        if(s[j]!=s[i-j-1]) return false;\n    }\n    return true;\n}\nchar tranNumToChar(int n){\n    string s=\""0123456789ABCDEFGHIJ\"";\n    return s[n];\n}\n\nstring octToAny(int x,const int B){\n    string res=\""\"";\n    while (x!=0) {\n        res+=tranNumToChar(x%B);\n        x=x/B;\n    }\n    reverse(res.begin(),res.end());\n    return res;\n}\nbool palin2to10(int x){\n    int count=0;\n    for(int k=2;k<=10;k++){\n        string ss;\n        ss=octToAny(x,k);\n        if(judgeR(ss,ss.length())){\n            count++;\n            if(count>=2) return true;\n        }\n\n    }\n    return false;\n}\nint main()\n{\n    int n,s;\n    cin >> n >> s;\n    for(int i=s+1;n>0;i++){\n        if(palin2to10(i)){\n            cout << i << endl;\n            n--;\n        }\n    }\n    return 0;\n}",ACCEPTED,59,512
1277883307088338944,b7f9a4062497756b8d037fe1f5f22857918efc573033109086d402dc4707807c,2020-06-30 16:34:56,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\nusing namespace std;\n//十进制转换为任意进制数,除k取余法\n\nstring change(int n,int k)\n{\n    string str;\n    int s[100];\n    int c,m=0;\n    while(n!=0)\n    {\n        c= n % k;\n        n /= k;\n        m++;\n        s[m]=c;//将余数按顺序存入s[n]中\n    }\n    for(int i=m;i>=1;i--)\n    {\n        if(s[i]>=10) str+=(char)(s[i]+55);\n        else str+=(char(s[i])+'0');\n    }\n    return str;\n}\nbool isPalindramic(string str)\n{\n    int len=str.length()-1;\n    int i;\n    for(i=0;str.length()/2;i++)\n    {\n        if(str[i]!=str[len]){\n            break;\n        }\n        len--;\n    }\n\n    if(i>=len) return true;\n    else return false;\n}\nint main()\n{\n    int B;\n    cin>>B;\n    int a1[305],a2[305];\n    string a3[305],a4[305];\n    for(int i=1;i<=300;i++)\n    {\n        a1[i]=i;\n        a2[i]=i*i;\n    }\n    for(int i=1;i<=300;i++)\n    {\n        a3[i]=change(a2[i],B);\n        a4[i]=change(a1[i],B);\n    }\n    for(int i=1;i<=300;i++)\n    {\n        if(isPalindramic(a3[i])) cout<<a4[i]<<\"" \""<<a3[i]<<endl;\n    }\n}\n\n\n",ACCEPTED,44,424
1277884842279100416,2693fac44bc417b4d4164958fe6680f69422107c22e1460145dba7e42bfdc99f,2020-06-30 16:41:03,C++,60.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <vector>\nusing namespace std;\n\nbool huiwen(int i, int B){\n        int a = i;\n        vector<int> num;\n\n        for (int m=0;m<50;m++){\n            int c = a/B;\n            num.push_back(a-c*B);\n\n\n            if (a<B)\n                break;\n            a = a/B;\n        }\n\n        if (num.size()==1){\n            return true;\n        }\n        size_t b = 0;\n        for (size_t m=0;m<num.size()/2;m++){\n            if (num[m]==num[num.size()-m-1]){\n                b++;\n            }\n\n\n        }\n            if (b==num.size()/2){\n                return true;\n            }\n\n            else {\n                return false;\n            }\n\n\n\n\n        return false;\n\n}\n\nint main()\n{\n    int N,S,n=0,a=0;\n    cin >> N >> S;\n\n    for (int i=S+1;i<10000;i++){\n        for (int B=2;B<11;B++){\n            if (huiwen(i,B)){\n                a++;\n\n            }\n        }\n        if (a>=2){\n            cout << i << endl;\n\n            n++;\n        }\n        a = 0;\n        if (n>N-1)\n            break;\n    }\n\n    return 0;\n}",PARTIAL_ACCEPTED,43,476
1277885160400281600,2693fac44bc417b4d4164958fe6680f69422107c22e1460145dba7e42bfdc99f,2020-06-30 16:42:18,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <vector>\nusing namespace std;\n\nbool huiwen(int i, int B){\n        int a = i;\n        vector<int> num;\n\n        for (int m=0;m<50;m++){\n            int c = a/B;\n            num.push_back(a-c*B);\n\n\n            if (a<B)\n                break;\n            a = a/B;\n        }\n\n        if (num.size()==1){\n            return true;\n        }\n        size_t b = 0;\n        for (size_t m=0;m<num.size()/2;m++){\n            if (num[m]==num[num.size()-m-1]){\n                b++;\n            }\n\n\n        }\n            if (b==num.size()/2){\n                return true;\n            }\n\n            else {\n                return false;\n            }\n\n\n\n\n        return false;\n\n}\n\nint main()\n{\n    int N,S,n=0,a=0;\n    cin >> N >> S;\n\n    for (int i=S+1;i<20000;i++){\n        for (int B=2;B<11;B++){\n            if (huiwen(i,B)){\n                a++;\n\n            }\n        }\n        if (a>=2){\n            cout << i << endl;\n\n            n++;\n        }\n        a = 0;\n        if (n>N-1)\n            break;\n    }\n\n    return 0;\n}",ACCEPTED,46,424
1277885641281437696,7255daafd88731caf36f82fc865dccfdc4dd5d7ca08a1241fdcd18788df61c07,2020-06-30 16:44:13,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint a[100] = {};\nint num = 0;\nvoid GetNumber(int x,int y) {//x是数值，y是进制\n\tint pro;\n\tdo{\n\t\tint i = 1;\n\t\ta[i] = x % y;\n\t\tnum = i;\n\t\ti++;\n\t\tpro = x / y;\n\t}while (pro);\n//进制转换  a[1]就是第一位\n}\nbool Compare() {//判断回文数\n\tfor (int i = 1; i <= num; i++) {\n\t\tif (a[i] != a[num + 1 - i]) {\n\t\t\treturn false;\n\t\t}\n\t\telse { return true; }\n\t}\n}\nvoid Print() {//打印 \n\tfor (int i = num; i >= 1; i--)//反向打印\n\t{\n\t\tif (a[i] <= 9) {\n\t\t\tcout << a[i];\n\t\t}\n\t\telse {\n\t\t\tcout << (char)(a[i] - 10 + 'A');//一个注意的地方！\n\t\t}\n\t}\n}\nint main() {\n\tint n;//代表进制\n\tcin >> n;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tint temp = i * i;\n\t\tGetNumber(temp, n);\n\t\tif (Compare()) {\n\t\t\tGetNumber(i, n);\n\t\t\tPrint();\n\t\t\tcout << \"" \"";\n\t\t\tGetNumber(temp, n);\n\t\t\tPrint();\n\t\t\tcout << endl;\n\t\t}\n\t}\n\treturn 0;\n}\n",TIME_LIMIT_EXCEEDED,0,0
1277888420347568128,c83213147a2d8d9a45ded58245e2135a1ca7678965b0bb31caebd18beefa1d2c,2020-06-30 16:55:16,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nbool pd(int n, int k)\n{\n\tint p[1005];\n\tint t = 0;\n\twhile (n != 0)\n\t{\n\t\tp[t] = n % k;\n\t\tn /= k;\n\t\tt++;\n\t}\n\tfor (int i = 0, j = t;i <= 2 / t;i++, t--)\n\t{\n\t\tif (p[i] != p[j])\n\t\t\treturn 0;\n\t}\n\treturn 1;\n}\n\nint main()\n{\n\tint n,s, num=1;\n\tcin >> n>>s;\n\tfor (int i = s + 1;num <=n;i++)\n\t{\n\t\tint count = 0;\n\t\tfor (int j = 2;j <= 10;j++)\n\t\t{\n\t\t\tif (pd(i, j) == 1)\n\t\t\t\tcount++;\n\t\t}\n\t\tif (count >= 2)\n\t\t{\n\t\t\tcout << i << endl;\n\t\t\tnum++;\n\t\t}\n\t}\n\treturn 0;\n}",MULTIPLE_ERROR,33,424
1277889526326820864,cc0d763b9b9af8282454127e1f75709799ad3393794bfd64b02be7134b1d1c88,2020-06-30 16:59:39,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n#include<string.h>\n#define MAXN 300\nint Transform(int num);\nchar b[35], a[20] = { \""0 1 2 3 4 5 6 7 8 9 A B C D E F G H I J\"" };\nint B;\nint main()\n{\n    char p[40];\n    scanf(\""%d\"", &B);\n    int i=1;\n    while(i<MAXN)\n    {\n        int r;\n        r = Transform(i * i);\n        int L = 0;\n        i++;\n        if(L <= r && b[L] == b[r])\n        {\n            L++;r--;\n        }\n        if (L > r)\n        {\n            strcpy(p, b);\n            r = Transform(i);\n            for (int j = r;j >= 0;j--)\n                printf(\""%c\"", b[j]);\n            printf(\"" %s\\n\"", p);\n        }\n    }\n    return 0;\n}\nint Transform(int num)\n{\n    int i = -1;\n    while (num > 0)\n    {\n        b[++i] = a[num % B];\n        num /= B;\n    }\n    return i;\n}\n",WRONG_ANSWER,25,436
1277890631135854592,cc0d763b9b9af8282454127e1f75709799ad3393794bfd64b02be7134b1d1c88,2020-06-30 17:04:03,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n#include<string.h>\n#define MAXN 300\nint Transform(int num);\nchar b[35], a[20] = { \""0 1 2 3 4 5 6 7 8 9 A B C D E F G H I J\"" };\nint B;\nint main()\n{\n    char p[40];\n    scanf(\""%d\"", &B);\n    int i=1;\n    while(i<MAXN)\n    {\n        int r;\n        r = Transform(i * i);\n        int L = 0;\n        i++;\n        if(L <= r && b[L] == b[r])\n        {\n            L++;r--;\n        }\n        if (L > r)\n        {\n            strcpy(p, b);\n            r = Transform(i);\n            for (int j = r;j >= 0;j--)\n                printf(\""%c\"", b[j]);\n            printf(\"" %s\\n\"", p);\n        }\n    }\n    return 0;\n}\nint Transform(int num)\n{\n    int i = -1;\n    while (num > 0)\n    {\n        b[++i] = a[num % B];\n        num /= B;\n    }\n    return i;\n}\n",WRONG_ANSWER,22,328
1277890889655975936,c83213147a2d8d9a45ded58245e2135a1ca7678965b0bb31caebd18beefa1d2c,2020-06-30 17:05:04,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nbool pd(int n, int k)\n{\n\tint p[1005];\n\tint t = 0;\n\twhile (n != 0)\n\t{\n\t\tp[t] = n % k;\n\t\tn /= k;\n\t\tt++;\n\t}\n\tfor (int i = 0, j = t;i <= 2 / t;i++, j--)\n\t{\n\t\tif (p[i] != p[j])\n\t\t\treturn 0;\n\t}\n\treturn 1;\n}\n\nint main()\n{\n\tint n,s, num=1;\n\tcin >> n>>s;\n\tfor (int i = s + 1;num <=n;i++)\n\t{\n\t\tint count = 0;\n\t\tfor (int j = 2;j <= 10;j++)\n\t\t{\n\t\t\tif (pd(i, j) == 1)\n\t\t\t\tcount++;\n\t\t}\n\t\tif (count >= 2)\n\t\t{\n\t\t\tcout << i << endl;\n\t\t\tnum++;\n\t\t}\n\t}\n\treturn 0;\n}",WRONG_ANSWER,40,480
1277891090110152704,996426eb2c46e27722456ffb4665b347926a2751ce9b5258dbaefeaa3c58c7a0,2020-06-30 17:05:52,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\nusing namespace std;\nchar str[100] = { 0 }, str1[100] = { 0 };\nchar number[] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\nint sure(char *st)\n{\n\tint n, i, j;\n\tfor (i = 0, j = (strlen(st) - 1); i <= j; i++, j--)\n\t{\n\t\tif (st[i] != st[j])\n\t\t\tbreak;\n\t}\n\tif (i <= j)\n\t\treturn 0;\n\telse\n\t\treturn 1;\n}\nvoid turning(int a, char *st, int B)\n{\n\tint t, i = 0, j;\n\tchar str2[100] = { 0 };\n\twhile (a)\n\t{\n\t\tstr2[i] = number[a%B];\n\t\ti = i + 1;\n\t\ta = a / B;\n\t}\n\tfor (j = 0, i -= 1; i >= 0; i--, j++)\n\t{\n\t\tst[j] = str2[i];\n\t}\n\tst[j + 1] = 0;\n}\nint main()\n{\n\tint B;\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\tturning(i, str1, B);\n\t\tturning(i*i, str, B);\n\t\tif (sure(str))\n\t\t{\n\t\t\tcout << str1 << \"" \"" << str << endl;\n\t\t}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1277891224063639552,c83213147a2d8d9a45ded58245e2135a1ca7678965b0bb31caebd18beefa1d2c,2020-06-30 17:06:24,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nbool pd(int n, int k)\n{\n\tint p[1005];\n\tint t = 0;\n\twhile (n != 0)\n\t{\n\t\tt++;\n\t\tp[t] = n % k;\n\t\tn /= k;\n\t\t\n\t}\n\tfor (int i = 1, j = t;i <= 2 / t;i++, j--)\n\t{\n\t\tif (p[i] != p[j])\n\t\t\treturn 0;\n\t}\n\treturn 1;\n}\n\nint main()\n{\n\tint n,s, num=1;\n\tcin >> n>>s;\n\tfor (int i = s + 1;num <=n;i++)\n\t{\n\t\tint count = 0;\n\t\tfor (int j = 2;j <= 10;j++)\n\t\t{\n\t\t\tif (pd(i, j) == 1)\n\t\t\t\tcount++;\n\t\t}\n\t\tif (count >= 2)\n\t\t{\n\t\t\tcout << i << endl;\n\t\t\tnum++;\n\t\t}\n\t}\n\treturn 0;\n}",WRONG_ANSWER,33,528
1277891230136991744,0032070d277fc021e595a55c6026c72dd281fbfefaf3ca9eff94ecd013980afa,2020-06-30 17:06:25,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <math.h>\nusing namespace std;\nvoid translate_n(int n_trans,int i_beTrans,int trans_array[10],int number[1]);//将十进制的数字转换成n进制 （n进制，源数字）\nint translate_10(int n_trans,int i_beTrans);//将n进制数字转换成十进制（n进制，n进制数） \nint judge(int signle_array[20],int n);//判断数组回文 （数组，数字个数） \nvoid trans_array(int signle_number[20],int number,int n);//将数字转换成数组 （待赋值数组，数字，数字个数） \nint count(int number);//数字个数 （数字） \nint main()\n{\n    int n;\n    cin>>n;\n    if(n==10){\n\t    int sigle_number[10];//将转化后的数字转化成数组\n\t    int judgement=0;//判断是不是回文数列\n\t    for(int i=1;i<=300;i++){\n\t        int square=i*i;\n\t        int array_length=count(square);\n\t\t\ttrans_array(sigle_number,square,array_length);\n\t        judgement=judge(sigle_number,array_length);\n\t        if(judgement==0){\n\t           \tcout<<i<<\"" \""<<square<<endl;\n\t    \t}\n\t    }\n\t}\n\telse{\n\t\tfor(int i=1;i<=300;i++){\n\t\t\tint trans_to_array[20]={0};\n\t\t\tint n_to[1]={0};\n\t\t\ttranslate_n(n,i,trans_to_array,n_to);\n\t\t\t\n\t\t\tint square=pow(i,2);\n\t\t\tint trans_back_array[20]={0};\n\t\t\tint n_back[1]={0};\n\t\t\ttranslate_n(n,square,trans_back_array,n_back);\n\t\t\tint judgement=judge(trans_back_array,n_back[0]);\n\t\t\tif(judgement==0){\n\t\t\t\tfor(int m=0;m<n_to[0];m++){\n\t\t\t\t\tif(trans_to_array[m]>=10)\n\t\t\t\t\t\tcout<<char(trans_to_array[m]+55);\n\t\t\t\t\telse\n\t\t\t\t\t\tcout<<trans_to_array[m];\n\t\t\t\t}\n\t\t\t\tcout<<\"" \"";\n\t\t\t\tfor(int j=0;j<n_back[0];j++){\n\t\t\t\t\tif(trans_back_array[j]>=10){\n\t\t\t\t\t\tif(j==n_back[0]-1)\n\t\t\t\t\t\t\tcout<<char(trans_back_array[j]+55)<<endl;\n\t\t\t\t\t\telse\n\t\t\t\t\t\t\tcout<<char(trans_back_array[j]+55);\n\t\t\t\t\t}\n\t\t\t\t\t\t\n\t\t\t\t\telse{\n\t\t\t\t\t\tif(j==n_back[0]-1)\n\t\t\t\t\t\t\tcout<<trans_back_array[j]<<endl;\n\t\t\t\t\t\telse\n\t\t\t\t\t\t\tcout<<trans_back_array[j];\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\t}\n    return 0;\n}\nint translate_10(int n_trans,int i_beTrans){\n\tint result=0;\n\tint i=0;\n\twhile(i_beTrans!=0){\n\t\tresult+=i_beTrans%10*pow(10,i);\n\t\ti_beTrans/=10;\n\t\ti++;\n\t} \n\treturn result;\n} \nvoid translate_n(int n_trans,int i_beTrans,int trans_array[20],int number[1]){\n    int i=0;\n    while(i_beTrans!=0){\n        int p=i_beTrans%n_trans;\n        i_beTrans/=n_trans;\n        trans_array[i]=p;\n        i++;\n    }\n    number[0]=i;\n    for(int j=0;j<=(i-1)/2;j++){\n    \tint temp=trans_array[j];\n    \ttrans_array[j]=trans_array[i-1-j];\n    \ttrans_array[i-1-j]=temp;\n\t}\n}\nint count(int number){\n    for(int i=1;;i++){\n        int k=pow(10,i);\n        if(number/k==0){\n            return i;\n            break;\n        }\n    }\n}\nvoid trans_array(int signle_number[20],int number,int n){\n    \n    int index=n-1;\n    while(number!=0){\n        signle_number[index]=number%10;\n        number/=10;\n        index--;\n    }\n}\nint judge(int signle_array[20],int n){\n    int judgement=0;\n    for(int i=0;i<=(n-1)/2;i++){\n        if(signle_array[i]!=signle_array[n-1-i]){\n            return 1;\n            break;\n        }\n        else{\n            if(i==(n-1)/2)\n                return judgement;\n        }\n    }\n}\n",ACCEPTED,26,428
1277891376396558336,996426eb2c46e27722456ffb4665b347926a2751ce9b5258dbaefeaa3c58c7a0,2020-06-30 17:07:00,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\nusing namespace std;\nchar str[100] = { 0 }, str1[100] = { 0 };\nchar number[] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\nint sure(char *st)\n{\n\tint n, i, j;\n\tfor (i = 0, j = (strlen(st) - 1); i <= j; i++, j--)\n\t{\n\t\tif (st[i] != st[j])\n\t\t\tbreak;\n\t}\n\tif (i <= j)\n\t\treturn 0;\n\telse\n\t\treturn 1;\n}\nvoid turning(int a, char *st, int B)\n{\n\tint t, i = 0, j;\n\tchar str2[100] = { 0 };\n\twhile (a)\n\t{\n\t\tstr2[i] = number[a%B];\n\t\ti = i + 1;\n\t\ta = a / B;\n\t}\n\tfor (j = 0, i -= 1; i >= 0; i--, j++)\n\t{\n\t\tst[j] = str2[i];\n\t}\n\tst[j + 1] = 0;\n}\nint main()\n{\n\tint B;\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\tturning(i, str1, B);\n\t\tturning(i*i, str, B);\n\t\tif (sure(str))\n\t\t{\n\t\t\tcout << str1 << \"" \"" << str << endl;\n\t\t}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1277891445912961024,c83213147a2d8d9a45ded58245e2135a1ca7678965b0bb31caebd18beefa1d2c,2020-06-30 17:07:17,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nbool pd(int n, int k)\n{\n\tint p[1005];\n\tint t = 0;\n\twhile (n != 0)\n\t{\n\t\t\n\t\tp[++t] = n % k;\n\t\tn /= k;\n\t\t\n\t}\n\tfor (int i = 1, j = t;i <= 2 / t;i++, j--)\n\t{\n\t\tif (p[i] != p[j])\n\t\t\treturn 0;\n\t}\n\treturn 1;\n}\n\nint main()\n{\n\tint n,s, num=1;\n\tcin >> n>>s;\n\tfor (int i = s + 1;num <=n;i++)\n\t{\n\t\tint count = 0;\n\t\tfor (int j = 2;j <= 10;j++)\n\t\t{\n\t\t\tif (pd(i, j) == 1)\n\t\t\t\tcount++;\n\t\t}\n\t\tif (count >= 2)\n\t\t{\n\t\t\tcout << i << endl;\n\t\t\tnum++;\n\t\t}\n\t}\n\treturn 0;\n}",WRONG_ANSWER,27,424
1277891744568377344,c83213147a2d8d9a45ded58245e2135a1ca7678965b0bb31caebd18beefa1d2c,2020-06-30 17:08:28,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nbool pd(int n, int k)\n{\n\tint p[1005];\n\tint t = 0;\n\twhile (n != 0)\n\t{\n\t\t\n\t\tp[t] = n % k;\n\t\tn /= k;\n\t\tt++;\n\t\t\n\t}\n\tfor (int i = 0, j = t;i <= 2 / t-1;i++, j--)\n\t{\n\t\tif (p[i] != p[j])\n\t\t\treturn 0;\n\t}\n\treturn 1;\n}\n\nint main()\n{\n\tint n,s, num=1;\n\tcin >> n>>s;\n\tfor (int i = s + 1;num <=n;i++)\n\t{\n\t\tint count = 0;\n\t\tfor (int j = 2;j <= 10;j++)\n\t\t{\n\t\t\tif (pd(i, j) == 1)\n\t\t\t\tcount++;\n\t\t}\n\t\tif (count >= 2)\n\t\t{\n\t\t\tcout << i << endl;\n\t\t\tnum++;\n\t\t}\n\t}\n\treturn 0;\n}",WRONG_ANSWER,25,452
1277892036785528832,996426eb2c46e27722456ffb4665b347926a2751ce9b5258dbaefeaa3c58c7a0,2020-06-30 17:09:38,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cstring>\nusing namespace std;\nchar str[100] = { 0 }, str1[100] = { 0 };\nchar number[] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\nint sure(char *st)\n{\n\tint i, j;\n\tfor (i = 0, j = (strlen(st) - 1); i <= j; i++, j--)\n\t{\n\t\tif (st[i] != st[j])\n\t\t\tbreak;\n\t}\n\tif (i <= j)\n\t\treturn 0;\n\telse\n\t\treturn 1;\n}\nvoid turning(int a, char *st, int B)\n{\n\tint i = 0, j;\n\tchar str2[100] = { 0 };\n\twhile (a)\n\t{\n\t\tstr2[i] = number[a%B];\n\t\ti = i + 1;\n\t\ta = a / B;\n\t}\n\tfor (j = 0, i -= 1; i >= 0; i--, j++)\n\t{\n\t\tst[j] = str2[i];\n\t}\n\tst[j + 1] = 0;\n}\nint main()\n{\n\tint B;\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\tturning(i, str1, B);\n\t\tturning(i*i, str, B);\n\t\tif (sure(str))\n\t\t{\n\t\t\tcout << str1 << \"" \"" << str << endl;\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,34,492
1277892334174265344,c83213147a2d8d9a45ded58245e2135a1ca7678965b0bb31caebd18beefa1d2c,2020-06-30 17:10:49,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nbool pd(int n, int k)\n{\n\tint p[1005];\n\tint t = 0;\n\twhile (n != 0)\n\t{\n\t\t\n\t\tp[t] = n % k;\n\t\tn /= k;\n\t\tt++;\n\t\t\n\t}\n\tfor (int i = 0, j = t;i <= 2 / t-1;i++, j--)\n\t{\n\t\tif (p[i] != p[j])\n\t\t\treturn 0;\n\t}\n\treturn 1;\n}\n\nint main()\n{\n\tint n,s, num=1;\n\tcin >> n>>s;\n\tfor (int i = s + 1;num <=n;i++)\n\t{\n\t\tint count = 0;\n\t\tfor (int j = 2;j <= 10;j++)\n\t\t{\n\t\t\tif (pd(i, j) == 1)\n\t\t\t\tcount++;\n\t\t}\n\t\tif (count >= 2)\n\t\t{\n\t\t\tcout << i << endl;\n\t\t\tnum++;\n\t\t}\n\t}\n\treturn 0;\n}",WRONG_ANSWER,35,408
1277892355087065088,efebf08217b0753fc2c338fd2b3a5a158b862b3914e72f6c91e0fc743af72013,2020-06-30 17:10:54,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint n;\n\tcin>>n;\n\tfor(int i=1;i<=300;i++)\n\t{\n\t\tint m=i*i,a=0,b=0,shu[100],ping[100];\n\t\twhile(i!=0)\n\t\t{\n\t\t\tshu[a]=i%n;\n\t\t\ti=i/n;\n\t\t\ta=a+1;\n\t\t}\n\t\twhile(m!=0)\n\t\t{\n\t\t\tping[b]=m%n;\n\t\t\tm=m/n;\n\t\t\tb=b+1;\n\t\t}\n\t\t\n\t\tint k=0;\n\t\tfor(int j=0;j<i/2;j++)\n\t\t{\n\t\t\tif(ping[j]!=ping[b-j-1])\n\t\t\t\tbreak;\n\t\t\telse\n\t\t\t\tk=k+1;\n\t\t}\n\t\t\n\t\tif(k=i/2)\n\t\t{\n\t\t\tfor(int q=a-1;q>=0;q--)\n\t\t\t\tcout<<shu[q];\n\t\t\tcout<<\"" \"";\n\t\t\tfor(int p=0;p<b;p++)\n\t\t\t\tcout<<ping[p];\n\t\t}\n\t}\n}",TIME_LIMIT_EXCEEDED,0,0
1277892498486124544,c83213147a2d8d9a45ded58245e2135a1ca7678965b0bb31caebd18beefa1d2c,2020-06-30 17:11:28,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nbool pd(int n, int k)\n{\n\tint p[1005];\n\tint t = 0;\n\twhile (n != 0)\n\t{\n\t\t\n\t\tp[t] = n % k;\n\t\tn /= k;\n\t\tt++;\n\t\t\n\t}\n\tfor (int i = 0, j = t;i <= 2 / t-1;i++, j--)\n\t{\n\t\tif (p[i] != p[j])\n\t\t\treturn 0;\n\t}\n\treturn 1;\n}\n\nint main()\n{\n\tint n,s, num=1;\n\tcin >> n>>s;\n\tfor (int i = s + 1;num <=n;i++)\n\t{\n\t\tint count = 0;\n\t\tfor (int j = 2;j <= 10;j++)\n\t\t{\n\t\t\tif (pd(i, j) == 1)\n\t\t\t\tcount++;\n\t\t}\n\t\tif (count >= 2)\n\t\t{\n\t\t\tcout << i << endl;\n\t\t\tnum++;\n\t\t}\n\t}\n\treturn 0;\n}",WRONG_ANSWER,32,424
1277893312118194176,c83213147a2d8d9a45ded58245e2135a1ca7678965b0bb31caebd18beefa1d2c,2020-06-30 17:14:42,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nbool pd(int n, int k)\n{\n\tint p[1005];\n\tint t = 0;\n\twhile (n != 0)\n\t{\n\n\t\tp[t] = n % k;\n\t\tn /= k;\n\t\tt++;\n\n\t}\n\tfor (int i = 0, j = t - 1;i < t;i++, j--)\n\t{\n\t\tif (p[i] != p[j])\n\t\t\treturn 0;\n\t}\n\treturn 1;\n}\n\nint main()\n{\n\tint n, s, num = 1;\n\tcin >> n >> s;\n\tfor (int i = s + 1;num <= n;i++)\n\t{\n\t\tint count = 0;\n\t\tfor (int j = 2;j <= 10;j++)\n\t\t{\n\t\t\tif (pd(i, j) == 1)\n\t\t\t\tcount++;\n\t\t}\n\t\tif (count >= 2)\n\t\t{\n\t\t\tcout << i << endl;\n\t\t\tnum++;\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,24,512
1277894718661263360,5a49425d378aea97465899ac58b9d7047969b1db42f4841d3104d25455eafef8,2020-06-30 17:20:17,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cstring>\n#include<cmath>\n\nusing namespace std;\nint B, j[350], k;\n\nvoid jinzhi(int x, int y)\n{\n\tk = 0;\n\twhile (x)\n\t{\n\t\tj[++k] = x % y;\n\t\tx /= y;\n\t}\n}\n\nbool panduan()\n{\n\tfor (int i = 1; i <= k; i++)\n\t{\n\t\tif (j[i] != j[k - i + 1])\n\t\t\treturn 0;\n\t}\n\treturn 1;\n}\n\nvoid Print()\n{\n\tfor (int i = k; i >= 1; i--)\n\t{\n\t\tif (j[i] <= 9)\n\t\t\tcout << j[i];\n\t\telse\n\t\t\tcout << (char)(j[i] - 10 + 'A');\n\t}\n}\n\nint main()\n{\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\tjinzhi(i * i, B);\n\t\tif (panduan())\n\t\t{\n\t\t\tjinzhi(i, B);\n\t\t\tPrint();\n\t\t\tcout << \"" \"";\n\t\t\tjinzhi(i * i, B);\n\t\t\tPrint();\n\t\t\tcout << endl;\n\t\t}\n\t}\n}\n\n\n",ACCEPTED,21,424
1277894745869713408,49f071a8c19d892715144d4b30350c8d95a7e3e541b9dda969e83d72c9f27b75,2020-06-30 17:20:24,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include<sstream> \n#include<cmath> \nusing namespace std;\nint f(int s)\n{\n    int temp=0;\n    for(int i=2;i<=10;i++)\n    {\n        if(temp==2){\n\t\t\tbreak;\n\t\t}\n        int sw=s;\n        string x=\""\"";\n        while(sw)\n        {\n            x+=(sw%i)+48;\n            sw/=i;\n        }\n        int big=x.size(),l=0;\n        while(x[l]==x[big-1-l] && l<=(big-1)/2)\n        {\n            l++;\n        }\n        l--;\n        if(l==(big-1)/2) temp++;\n    }\n    return temp;\n}\nint main(){\n\tint n,m,c=0;\n\tcin>>n>>m;\n\tfor(int i=m;c<n;i++){\n\t\tif(f(i)==2){\n\t\t\tcout<<i<<'\\n';\n\t\t\tc++;\n\t\t}\n\t}\n    return 0;\n}\n    \n    return 0;\n}",COMPILE_ERROR,0,0
1277894811577679872,49f071a8c19d892715144d4b30350c8d95a7e3e541b9dda969e83d72c9f27b75,2020-06-30 17:20:39,C++,50.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include<sstream> \n#include<cmath> \nusing namespace std;\nint f(int s)\n{\n    int temp=0;\n    for(int i=2;i<=10;i++)\n    {\n        if(temp==2){\n\t\t\tbreak;\n\t\t}\n        int sw=s;\n        string x=\""\"";\n        while(sw)\n        {\n            x+=(sw%i)+48;\n            sw/=i;\n        }\n        int big=x.size(),l=0;\n        while(x[l]==x[big-1-l] && l<=(big-1)/2)\n        {\n            l++;\n        }\n        l--;\n        if(l==(big-1)/2) temp++;\n    }\n    return temp;\n}\nint main(){\n\tint n,m,c=0;\n\tcin>>n>>m;\n\tfor(int i=m;c<n;i++){\n\t\tif(f(i)==2){\n\t\t\tcout<<i<<'\\n';\n\t\t\tc++;\n\t\t}\n\t}\n    return 0;\n}",PARTIAL_ACCEPTED,19,384
1277894830716289024,7255daafd88731caf36f82fc865dccfdc4dd5d7ca08a1241fdcd18788df61c07,2020-06-30 17:20:44,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint a[100] = {};\nint num = 0;\nvoid GetNumber(int x,int y) {//x是数值，y是进制\n\tint pro=1;\n\tdo{\n\t\tint i = 1;\n\t\ta[i] = x % y;\n\t\tnum = i;\n\t\ti++;\n\t\tpro = x / y;\n\t}while (pro);\n//进制转换  a[1]就是第一位\n}\nbool Compare() {//判断回文数\n\tfor (int i = 1; i <= num; i++) {\n\t\tif (a[i] != a[num + 1 - i]) {\n\t\t\treturn false;\n\t\t}\n\t\telse { return true; }\n\t}\n}\nvoid Print() {//打印 \n\tfor (int i = num; i >= 1; i--)//反向打印\n\t{\n\t\tif (a[i] <= 9) {\n\t\t\tcout << a[i];\n\t\t}\n\t\telse {\n\t\t\tcout << (char)(a[i] - 10 + 'A');//一个注意的地方！\n\t\t}\n\t}\n}\nint main() {\n\tint n;//代表进制\n\tcin >> n;\n\tfor (int i = 1; i <= 300; i++) {\n        int temp=i*i;\n\t\tGetNumber(temp, n);\n\t\tif (Compare()) {\n\t\t\tGetNumber(i, n);\n\t\t\tPrint();\n\t\t\tcout << \"" \"";\n\t\t\tGetNumber(temp, n);\n\t\t\tPrint();\n\t\t\tcout << endl;\n\t\t}\n\t}\n\treturn 0;\n}\n  \n",TIME_LIMIT_EXCEEDED,0,0
1277894882281062400,49f071a8c19d892715144d4b30350c8d95a7e3e541b9dda969e83d72c9f27b75,2020-06-30 17:20:56,C++,50.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nint f(int s)\n{\n    int temp=0;\n    for(int i=2;i<=10;i++)\n    {\n        if(temp==2){\n\t\t\tbreak;\n\t\t}\n        int sw=s;\n        string x=\""\"";\n        while(sw)\n        {\n            x+=(sw%i)+48;\n            sw/=i;\n        }\n        int big=x.size(),l=0;\n        while(x[l]==x[big-1-l] && l<=(big-1)/2)\n        {\n            l++;\n        }\n        l--;\n        if(l==(big-1)/2) temp++;\n    }\n    return temp;\n}\nint main(){\n\tint n,m,c=0;\n\tcin>>n>>m;\n\tfor(int i=m;c<n;i++){\n\t\tif(f(i)==2){\n\t\t\tcout<<i<<'\\n';\n\t\t\tc++;\n\t\t}\n\t}\n    return 0;\n}",PARTIAL_ACCEPTED,40,424
1277895034467180544,7255daafd88731caf36f82fc865dccfdc4dd5d7ca08a1241fdcd18788df61c07,2020-06-30 17:21:33,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream> \nusing namespace std;\nint n;\nint s[301];\nvoid jz(int a, int b)\n{\n\tint r = 0;\n\twhile (a) {\n\t\ts[++r] = a % b;\n\t\ta /= b;\n\t}\n\ts[0] = r;\n}\nbool change() {\n\tfor (int i = 1; i <= s[0]; i++)\n\t{\n\t\tif (s[i] != s[s[0] + 1 - i]) return false;\n\t}\n\treturn true;\n}\nvoid print() {\n\tfor (int i = s[0]; i >= 1; i--)\n\t{\n\t\tif (s[i] <= 9) cout << s[i];\n\t\telse cout << (char)(s[i] - 10 + 'A');\n\t}\n}\nint main()\n{\n\tcin >> n;\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\tjz(i * i, n);\n\t\tif (change()) {\n\t\t\tjz(i, n);\n\t\t\tprint();\n\t\t\tcout << ' ';\n\t\t\tjz(i * i, n);\n\t\t\tprint();\n\t\t\tputs(\""\"");\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,42,440
1277896551291092992,49f071a8c19d892715144d4b30350c8d95a7e3e541b9dda969e83d72c9f27b75,2020-06-30 17:27:34,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nint f(int s)\n{\n    int temp=0;\n    for(int i=2;i<=10;i++)\n    {\n        if(temp==2){\n\t\t\tbreak;\n\t\t}\n        int sw=s;\n        string x=\""\"";\n        while(sw)\n        {\n            x+=(sw%i)+48;\n            sw/=i;\n        }\n        int big=x.size(),l=0;\n        while(x[l]==x[big-1-l] && l<=(big-1)/2)\n        {\n            l++;\n        }\n        l--;\n        if(l==(big-1)/2) temp++;\n    }\n    return temp;\n}\nint main(){\n\tint n,m,c=0;\n\tcin>>n>>m;\n\tfor(int i=m+1;c<n;i++){\n\t\tif(f(i)==2){\n\t\t\tcout<<i<<'\\n';\n\t\t\tc++;\n\t\t}\n\t}\n    return 0;\n}",ACCEPTED,34,508
1277897522431852544,efebf08217b0753fc2c338fd2b3a5a158b862b3914e72f6c91e0fc743af72013,2020-06-30 17:31:26,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint n;\n\tcin>>n;\n\tfor(int i=1;i<=300;i++)\n\t{\n\t\tint I=i,m=I*I,a=0,b=0,shu[100],ping[100];\n\t\twhile(I!=0){\n\t\t\tshu[a]=I%n;\n\t\t\tI=I/n;\n\t\t\ta=a+1;\n\t\t}\n\t\twhile(m!=0){\n\t\t\tping[b]=m%n;\n\t\t\tm=m/n;\n\t\t\tb=b+1;\n\t\t}\n\t\t\n\t\tint k=0;\n\t\tfor(int j=0;j<b/2;j++)\n\t\t{\n\t\t\tif(ping[j]!=ping[b-j-1])\n\t\t\t\tbreak;\n\t\t\tif(ping[j]==ping[b-j-1])\n\t\t\t\tk=k+1;\n\t\t}\n\t\t\n\t\tif(k==b/2)\n\t\t{\n\t\t\tfor(int q=a-1;q>=0;q--)\n\t\t\t\tcout<<shu[q];\n\t\t\tcout<<\"" \"";\n\t\t\tfor(int p=0;p<b;p++)\n\t\t\t\tcout<<ping[p];\n\t\t\tcout<<endl;\n\t\t}\n\t}\n}",PARTIAL_ACCEPTED,42,492
1277898964743946240,ba8741b054453d53e00604cda664981b520780c8a25ad99d8eff8afe7b5f2cfd,2020-06-30 17:37:10,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include <algorithm>\n\nusing namespace std;\n\n\nint main() {\n\tint N=0;\n\tint S=0;\n\tint tmp=0;\n\tint flag = 0;\n\tint transfo=0;\n\tchar c;\n\tstring str=\""\"";\n\tstring s;\n\tint count = 0;\n\tcin >> N >> S;\n\twhile (count < N) {\n\t\tS++;\n\t\tfor (int i = 2; i <= 10; i++) {\n\t\t\ttransfo = S;\n\t\t\twhile (true) {\n\t\t\t\ttmp = transfo % i;\n\t\t\t\tc = tmp + '0';\n\t\t\t\tif ((transfo /= i) > 0) {\n\t\t\t\t\tstr = c + str;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tstr = c + str;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\ts = str;\n\t\t\treverse(s.begin(), s.end());\n\t\t\tif (str == s) {\n\t\t\t\tflag++;\n\t\t\t}\n\t\t\tstr = \""\"";\n\t\t\ts = \""\"";\n\t\t}\n\t\t\n\t\tif (flag >= 2) {\n\t\t\tcout << S << endl;\n\t\t\tcount++;\n\t\t\tcontinue;\n\t\t}\n\t}\n}",PARTIAL_ACCEPTED,36,424
1277899316801232896,7255daafd88731caf36f82fc865dccfdc4dd5d7ca08a1241fdcd18788df61c07,2020-06-30 17:38:34,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint a[400] = {};\nint num;\nvoid GetNumber(int x, int y) {//x是数值，y是进制\n\tint i = 0;\n\twhile (x > 0){\n\t\ti++;\n\t\ta[i] = x % y;\n\t\tx = x / y;\n\t}\n\tnum = i;\n\t//进制转换  a[1]就是第一位\n}\nbool Compare() {//判断回文数\n\tfor (int i = 1; i <= num; i++)\n\t{\n\t\tif (a[i] != a[num + 1 - i]) return false;\n\t}\n\treturn true;\n}\nvoid Print() {//打印 \n\tfor (int i = num; i >= 1; i--)//反向打印\n\t{\n\t\tif (a[i] <= 9) {\n\t\t\tcout << a[i];\n\t\t}\n\t\telse {\n\t\t\tcout << (char)(a[i] - 10 + 'A');//一个注意的地方！\n\t\t}\n\t}\n}\nint main() {\n\tint n;//代表进制\n\tcin >> n;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tGetNumber(i*i, n);\n\t\tif (Compare()) {\n\t\t\tGetNumber(i, n);\n\t\t\tPrint();\n\t\t\tcout << \"" \"";\n\t\t\tGetNumber(i*i, n);\n\t\t\tPrint();\n\t\t\tcout << endl;\n\t\t}\n\t}\n\treturn 0;\n}\n\n",ACCEPTED,26,504
1277899907350847488,0032070d277fc021e595a55c6026c72dd281fbfefaf3ca9eff94ecd013980afa,2020-06-30 17:40:54,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <math.h>\nusing namespace std;\nvoid translate_n(int n_trans,int i_beTrans,int trans_array[100],int number[1]);//将十进制的数字转换成n进制\nint judge(int signle_array[20],int n);//判断数组回文（数组，数字个数）\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    int number=0;\n    for(int i=S+1;;i++){\n    \tint judgement=0;\n        for(int j=2;j<=10;j++){\n            int n_i[1];\n            int array_i[100];\n            translate_n(j,i,array_i,n_i);\n            int p=judge(array_i,n_i[0]);\n            if(p==0)\n                judgement++;\n            if(judgement==2){\n                cout<<i<<endl;\n                number++;\n                break;\n            }\n        }\n        if(number==N)\n            break;\n    }\n    return 0;\n}\nvoid translate_n(int n_trans,int i_beTrans,int trans_array[100],int number[1]){\n    int i=0;\n    while(i_beTrans!=0){\n        int p=i_beTrans%n_trans;\n        i_beTrans/=n_trans;\n        trans_array[i]=p;\n        i++;\n    }\n    number[0]=i;\n    for(int j=0;j<=(i-1)/2;j++){\n        int temp=trans_array[j];\n        trans_array[j]=trans_array[i-1-j];\n        trans_array[i-1-j]=temp;\n    }\n}\nint judge(int signle_array[20],int n){\n    int judgement=0;\n    for(int i=0;i<=(n-1)/2;i++){\n        if(signle_array[i]!=signle_array[n-1-i]){\n            return 1;\n            break;\n        }\n        else{\n            if(i==(n-1)/2)\n                return judgement;\n        }\n    }\n}\n",ACCEPTED,38,512
1277900211651796992,f8b263609a898c5499c07fc9ba7bcd00e46a82e38e73d327331416411a74e117,2020-06-30 17:42:07,C++,70.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string.h>\n#include <algorithm>\nusing namespace std;\n\nconst string numbers = \""0123456789ABCDEFG\"";\nstring transf(int line, int b) //转换成B进制\n{\n    string result = \""\"";\n    int remainder;\n    while (line > 0)\n    {\n        remainder = line % b;\n        result += numbers[remainder];\n        line -= remainder;\n        line /= b;\n    }\n    string reverse(result.rbegin(),result.rend()); //string逆序输出即为转换结果\n    return reverse;\n}\n\nint main()\n{\n    int num;\n    cin >> num;\n    \n    for (int i = 1; i <= 300; i++)\n    {\n        int line = i * i;\n        string inital = transf(i,num);  //原始的数转换成B进制\n        string square = transf(line,num); //平方后的数转换成B进制\n        string reverse(square.rbegin(),square.rend());\n        if (reverse == square)\n        {\n            cout << inital << \"" \"" << square << endl;\n        }\n    }\n    return 0;\n}\n\n\n",PARTIAL_ACCEPTED,45,424
1277900877367541760,782de8de24b69682b55d2ec864c3c74059925a75bca9e240d2c3ba45de48e5f7,2020-06-30 17:44:46,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint abc(int n,int m)\n{\n    char a='A',b;\n    if(n==0)\n        return 0;\n    else\n    {\n        abc(n/m,m);\n        if(n%m>=10)\n        {\n            b=a+(n%m-10);\n            cout<<b;\n        }\n        else\n            cout<<n%m;\n    }\n}\n\nint main(){\n    int B;\n    cin>>B;\n    int number1[300] = {0};\n    for(int i=0;i<300;i++){\n        number1[i] = i*i;\n        number1[i] = abc(number1[i],B);\n    }\n    for(int k=0;k<300;k++){\n        int m = number1[k];\n        int a=0,b=0;\n        int array[10];\n        while(m)\n        {\n            array[a++]=m%10;\n            m/=10;\n        }\n        a--;\n        while(a>b)\n        {\n            if(array[b++]!=array[a--])\n                break;\n        }\n\n        if(b>a)\n            cout<<number1[k]<<endl;\n        return 0;\n    }\n}\n",COMPILE_ERROR,0,0
1277900903707770880,782de8de24b69682b55d2ec864c3c74059925a75bca9e240d2c3ba45de48e5f7,2020-06-30 17:44:52,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint abc(int n,int m)\n{\n    char a='A',b;\n    if(n==0)\n        return 0;\n    else\n    {\n        abc(n/m,m);\n        if(n%m>=10)\n        {\n            b=a+(n%m-10);\n            cout<<b;\n        }\n        else\n            cout<<n%m;\n    }\n}\n\nint main(){\n    int B;\n    cin>>B;\n    int number1[300] = {0};\n    for(int i=0;i<300;i++){\n        number1[i] = i*i;\n        number1[i] = abc(number1[i],B);\n    }\n    for(int k=0;k<300;k++){\n        int m = number1[k];\n        int a=0,b=0;\n        int array[10];\n        while(m)\n        {\n            array[a++]=m%10;\n            m/=10;\n        }\n        a--;\n        while(a>b)\n        {\n            if(array[b++]!=array[a--])\n                break;\n        }\n\n        if(b>a)\n            cout<<number1[k]<<endl;\n        return 0;\n    }\n}\n",WRONG_ANSWER,41,640
1277901031604682752,b84f0dba852974b077f34cdfb7f3a0dcdf505a3c646f49eb4728fbb0b4d9d083,2020-06-30 17:45:22,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"\n#include<iostream>\n#include <algorithm>\n\nusing namespace std;\n\nint b;\nstring s;\n\nstring change(int x){\n    s.clear();\n    while(x){//直到x为0\n        if(x%b>=0&&x%b<=9){\n            s+=(x%b+'0');//将数字转化为对应字符\n        }\n        else{\n            s+=(x%b+'A'-10);//'A'+1='B'\n        }\n        x/=b;\n    }\n    return s;\n}//因为需要把整数转化成b进制字符串（因为有A，B等）；注意此时的顺序是反的\n\nint main(){\n   cin>>b;\n   for(int i=1;i<=300;i++){\n       string t = change(i*i);\n       string k(t.begin(),t.end());\n       reverse(t.begin(),t.end());//t顺序颠倒\n       if(t==k){//判断是否是回文\n            string g = change(i);\n            reverse(g.begin(),g.end());\n            cout<< g <<\"" \""<<t<<endl;\n        }\n    }\n    return 0;\n}",ACCEPTED,39,496
1277901449130860544,f8b263609a898c5499c07fc9ba7bcd00e46a82e38e73d327331416411a74e117,2020-06-30 17:47:02,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string.h>\n#include <algorithm>\nusing namespace std;\n\nconst string numbers = \""0123456789ABCDEFGHIJ\"";\nstring transf(int line, int b) //转换成B进制\n{\n    string result = \""\"";\n    int remainder;\n    while (line > 0)\n    {\n        remainder = line % b;\n        result += numbers[remainder];\n        line -= remainder;\n        line /= b;\n    }\n    string reverse(result.rbegin(),result.rend()); //string逆序输出即为转换结果\n    return reverse;\n}\n\nint main()\n{\n    int num;\n    cin >> num;\n    \n    for (int i = 1; i <= 300; i++)\n    {\n        int line = i * i;\n        string inital = transf(i,num);  //原始的数转换成B进制\n        string square = transf(line,num); //平方后的数转换成B进制\n        string reverse(square.rbegin(),square.rend());\n        if (reverse == square)\n        {\n            cout << inital << \"" \"" << square << endl;\n        }\n    }\n    return 0;\n}\n\n\n",ACCEPTED,37,512
1277901522657009664,ba8741b054453d53e00604cda664981b520780c8a25ad99d8eff8afe7b5f2cfd,2020-06-30 17:47:19,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include <algorithm>\n\nusing namespace std;\n\n\nint main() {\n\tint N=0;\n\tint S=0;\n\tint tmp=0;\n\tint flag = 0;\n\tint transfo=0;\n\tchar c;\n\tstring str=\""\"";\n\tstring s;\n\tint count = 0;\n\tcin >> N >> S;\n\twhile (count < N) {\n\t\tflag = 0;\n\t\tS++;\n\t\tfor (int i = 2; i <= 10; i++) {\n\t\t\ttransfo = S;\n\t\t\tstr = \""\"";\n\t\t\twhile (true) {\n\t\t\t\ttmp = transfo % i;\n\t\t\t\tc = tmp + '0';\n\t\t\t\tif ((transfo /= i) > 0) {\n\t\t\t\t\tstr = c + str;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tstr = c + str;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\ts = str;\n\t\t\treverse(s.begin(), s.end());\n\t\t\tif (str == s) {\n\t\t\t\tflag++;\n\t\t\t}\n\t\t\t\n\t\t}\n\t\tif (flag >= 2) {\n\t\t\tcout << S << endl;\n\t\t\tcount++;\n\t\t\tcontinue;\n\t\t}\n\t\t\n\t\t\n\t}\n}",ACCEPTED,46,528
1277902145116897280,bbc32b3ed49ab612815ed342e7a9a82917eefb8ef54f7578f63f18a6338adb40,2020-06-30 17:49:48,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\nusing namespace std;\n\nstring change(int number, int radix);\nbool verify(string str);\n\nint main()\n{\n    int radix;\n    cin >> radix;\n\n    for (int i=1; i<=300; i++)\n    {\n        string aa = change(i*i,radix);\n        if (verify(aa))\n        {\n            cout << change(i,radix) << \"" \"" << change(i*i,radix) << endl;\n        }\n    }\n    return 0;\n}\n\nstring change(int number, int radix)\n{\n    string oput;\n    if (number >= radix && radix != 10)\n    {\n        while (number >= radix)\n        {\n            int n = number%radix;\n            number = number/radix;\n            switch(n)\n            {\n                case 10 : oput += 'A';\n                        break;\n                case 11 : oput += 'B';\n                        break;\n                case 12 : oput += 'C';\n                        break;\n                case 13 : oput += 'D';\n                        break;\n                case 14 : oput += 'E';\n                        break;\n                case 15 : oput += 'F';\n                        break;\n                case 16 : oput += 'G';\n                        break;\n                case 17 : oput += 'H';\n                        break;\n                case 18 : oput += 'I';\n                        break;\n                case 19 : oput += 'J';\n                        break;\n                case 20 : oput += 'K';\n                        break;\n                default : oput += to_string(n);\n                        break;\n            }\n        }\n    }\n    else\n    {\n        if (radix != 10)\n        {\n            switch(number)\n                {\n                    case 10 : oput += 'A';\n                            break;\n                    case 11 : oput += 'B';\n                            break;\n                    case 12 : oput += 'C';\n                            break;\n                    case 13 : oput += 'D';\n                            break;\n                    case 14 : oput += 'E';\n                            break;\n                    case 15 : oput += 'F';\n                            break;\n                    case 16 : oput += 'G';\n                            break;\n                    case 17 : oput += 'H';\n                            break;\n                    case 18 : oput += 'I';\n                            break;\n                    case 19 : oput += 'J';\n                            break;\n                    case 20 : oput += 'K';\n                            break;\n                    default : oput += to_string(number);\n                            break;\n                }\n        }\n        else\n        {\n            oput += to_string(number);\n        }\n        \n    }\n    reverse(oput.begin(),oput.end());\n    return oput;\n}\n\nbool verify(string str)\n{\n    string rstr = str;\n    reverse(rstr.begin(),rstr.end());\n    if (str == rstr)\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}",WRONG_ANSWER,45,512
1277903590780231680,bbc32b3ed49ab612815ed342e7a9a82917eefb8ef54f7578f63f18a6338adb40,2020-06-30 17:55:33,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\nusing namespace std;\n\nstring change(int number, int radix);\nbool verify(string str);\n\nint main()\n{\n    int radix;\n    cin >> radix;\n\n    for (int i=1; i<=300; i++)\n    {\n        char aa[100];\n        _itoa(i*i, aa, radix);\n        if (verify(aa))\n        {\n            char a[100];\n            _itoa(i,a,radix);\n            cout << a << \"" \"" << aa << endl;\n        }\n    }\n    return 0;\n}\n\nbool verify(string str)\n{\n    string rstr = str;\n    reverse(rstr.begin(),rstr.end());\n    if (str == rstr)\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}",COMPILE_ERROR,0,0
1277903710036877312,bbc32b3ed49ab612815ed342e7a9a82917eefb8ef54f7578f63f18a6338adb40,2020-06-30 17:56:01,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\n#include<stdio.h> \n#include<stdlib.h>\nusing namespace std;\n\nstring change(int number, int radix);\nbool verify(string str);\n\nint main()\n{\n    int radix;\n    cin >> radix;\n\n    for (int i=1; i<=300; i++)\n    {\n        char aa[100];\n        _itoa(i*i, aa, radix);\n        if (verify(aa))\n        {\n            char a[100];\n            _itoa(i,a,radix);\n            cout << a << \"" \"" << aa << endl;\n        }\n    }\n    return 0;\n}\n\nbool verify(string str)\n{\n    string rstr = str;\n    reverse(rstr.begin(),rstr.end());\n    if (str == rstr)\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}",COMPILE_ERROR,0,0
1277904638823555072,dbdee02c4509ab7a1fd578907c2d4a0dc00c446ff84739560caf0298cf21d497,2020-06-30 17:59:42,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>//转进制的题目\n#include<algorithm>\n#include<stdlib.h>\n#include<stdio.h>\n#include<cstring>\nusing namespace std;\nchar a[1000],b[10000];\nvoid change1(int i,int B);\nvoid change2(long ii,int B);\nbool palin();\n\nint main()\n{int B;\ncin>>B;\nfor(int i=1;i<=300;i++)\n{\nlong ii=i*i;\nchange1(i,B);\nchange2(ii,B);\nif(palin())\n{\nint lena=strlen(a);\nfor(int m=(lena-1);m>=0;m--)\n{\nif(a[m]>=10)\ncout<<char(a[m]+55);\nelse\ncout<<a[m];\n}\ncout<<\"" \"";\nint lenb=strlen(b);\nfor(int m=(lenb-1);m>=0;m--)\n{\nif(b[m]>=10)\ncout<<(char)(b[m]+55);\nelse\ncout<<b[m]<<endl;\n}\n\n}\n}\n}\nvoid change1(int i,int B)\n{int x=0;int c;\nwhile (i) {\n\nc=i%B;\ni=i/B;\na[x]=c;\nx++;\n//for(int i=0;i<x;i++)\n//cout<<a[i];\n}\n\n}\nvoid change2(long ii,int B)\n{int x=0;int c;\nwhile (ii) {\n\nc=ii%B;\nii=ii/B;\nb[x]=c;\nx++;\n\n}}\nbool palin()\n{\nint len=strlen(b);\nint j,k;\nfor(j=0,k=(len-1);j<=k;j++,k--)\n{\nif(b[j]!=b[k])\n    return 0;\n}\nreturn 1;\n}\n",WRONG_ANSWER,41,412
1277905846317547520,bbc32b3ed49ab612815ed342e7a9a82917eefb8ef54f7578f63f18a6338adb40,2020-06-30 18:04:30,C++,70.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\nusing namespace std;\n\nstring change(int number, int radix);\nbool verify(string str);\n\nint main()\n{\n    int radix;\n    cin >> radix;\n\n    for (int i=1; i<=300; i++)\n    {\n        string aa = change(i*i,radix);\n        if (verify(aa))\n        {\n            cout << change(i,radix) << \"" \"" << change(i*i,radix) << endl;\n        }\n    }\n    return 0;\n}\n\nstring change(int number, int radix)\n{\n    string oput;\n    if (number >= radix && radix != 10)\n    {\n        do\n        {\n            int n = number%radix;\n            number = number/radix;\n            switch(n)\n            {\n                case 10 : oput += 'A';\n                        break;\n                case 11 : oput += 'B';\n                        break;\n                case 12 : oput += 'C';\n                        break;\n                case 13 : oput += 'D';\n                        break;\n                case 14 : oput += 'E';\n                        break;\n                case 15 : oput += 'F';\n                        break;\n                case 16 : oput += 'G';\n                        break;\n                case 17 : oput += 'H';\n                        break;\n                case 18 : oput += 'I';\n                        break;\n                case 19 : oput += 'J';\n                        break;\n                case 20 : oput += 'K';\n                        break;\n                default : oput += to_string(n);\n                        break;\n            }\n        }while (number != 0);\n    }\n\n    else\n    {\n        if (radix != 10)\n        {\n            switch(number)\n                {\n                    case 10 : oput += 'A';\n                            break;\n                    case 11 : oput += 'B';\n                            break;\n                    case 12 : oput += 'C';\n                            break;\n                    case 13 : oput += 'D';\n                            break;\n                    case 14 : oput += 'E';\n                            break;\n                    case 15 : oput += 'F';\n                            break;\n                    case 16 : oput += 'G';\n                            break;\n                    case 17 : oput += 'H';\n                            break;\n                    case 18 : oput += 'I';\n                            break;\n                    case 19 : oput += 'J';\n                            break;\n                    case 20 : oput += 'K';\n                            break;\n                    default : oput += to_string(number);\n                            break;\n                }\n        }\n        else\n        {\n            oput += to_string(number);\n        }\n        \n    }\n    reverse(oput.begin(),oput.end());\n    return oput;\n}\n\nbool verify(string str)\n{\n    string rstr = str;\n    reverse(rstr.begin(),rstr.end());\n    if (str == rstr)\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}",PARTIAL_ACCEPTED,38,384
1277906228963901440,dbdee02c4509ab7a1fd578907c2d4a0dc00c446ff84739560caf0298cf21d497,2020-06-30 18:06:01,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>//转进制的题目\n#include<algorithm>\n#include<stdlib.h>\n#include<stdio.h>\n#include<cstring>\nusing namespace std;\nchar a[1000],b[10000];\nvoid change1(int i,int B);\nvoid change2(long ii,int B);\nbool palin();\n\nint main()\n{int B;\ncin>>B;\nfor(int i=1;i<=300;i++)\n{\nlong ii=i*i;\nchange1(i,B);\nchange2(ii,B);\nif(palin())\n{\nint lena=strlen(a);\nfor(int m=(lena-1);m>=0;m--)\n{\nif(a[m]>=10)\ncout<<a[m]+'A'-10;\nelse\ncout<<a[m];\n}\ncout<<\"" \"";\nint lenb=strlen(b);\nfor(int m=(lenb-1);m>=0;m--)\n{\nif(b[m]>=10)\ncout<<b[m]+'A'-10;\nelse\ncout<<b[m]<<endl;\n}\n\n}\n}\n}\nvoid change1(int i,int B)\n{int x=0;int c;\nwhile (i) {\n\nc=i%B;\ni=i/B;\na[x]=c;\nx++;\n//for(int i=0;i<x;i++)\n//cout<<a[i];\n}\n\n}\nvoid change2(long ii,int B)\n{int x=0;int c;\nwhile (ii) {\n\nc=ii%B;\nii=ii/B;\nb[x]=c;\nx++;\n\n}}\nbool palin()\n{\nint len=strlen(b);\nint j,k;\nfor(j=0,k=(len-1);j<=k;j++,k--)\n{\nif(b[j]!=b[k])\n    return 0;\n}\nreturn 1;\n}\n\n",WRONG_ANSWER,37,512
1277906345649430528,ea5548fa6c756374a6604f201cb2ed15a7d8bd72ab79e1d820ed79330dcb162c,2020-06-30 18:06:29,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nint a[500],z[500];\nbool j(int x,const int y){\n\tint cnt=0;\n\twhile(x!=0){\n\t\ta[cnt++]=x%y;\n\t\tx/=y;\n\t}\n\tfor(int i=0;i<cnt/2;i++){\n\t\tif(a[i]!=a[cnt-1-i]) return false;\n\t}\n\treturn true;\n}\nvoid print(int a,int b){\n\tint cnt=0;\n\twhile(a!=0){\n\t\tz[cnt++]=a%b;\n\t\ta/=b;\n\t}\n\tfor(int i=cnt-1;i>=0;i--) cout<<z[i];\n}\nint main(){\n\tint B;\n\tcin>>B;\n\tfor(int i=1;i<=300;i++){\n\t\tif(j(i*i,B)) {\n\t\tcout<<i<<\"" \"";\n\t\tprint(i*i,B);\n\t\tcout<<endl;}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,41,768
1277906360287559680,f8b263609a898c5499c07fc9ba7bcd00e46a82e38e73d327331416411a74e117,2020-06-30 18:06:33,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nint main()\n{\n    int N,S;   //N个大于S\n    cin >> N >> S;\n    \n    for (int i = S + 1; i <= S + N; i++)\n    {\n        int basetype = 0;\n        for (int base = 2; base <=10; base++)\n        {\n            char line[100];\n            string initial(line);\n            string reverse(initial.rbegin(),initial.rend());  //逆序\n            if (reverse == initial)   //判断回文\n            {\n                basetype++;\n            }\n        }\n        if (basetype >= 2) //判断进制两种以上\n        {\n            cout << i << endl;\n        }\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,29,488
1277906441409585152,f8b263609a898c5499c07fc9ba7bcd00e46a82e38e73d327331416411a74e117,2020-06-30 18:06:52,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nint main()\n{\n    int N,S;   //N个大于S\n    cin >> N >> S;\n    \n    for (int i = S + 1; i <= S + N; i++)\n    {\n        int basetype = 0;\n        for (int base = 2; base <=10; base++)\n        {\n            char line[33];\n            string initial(line);\n            string reverse(initial.rbegin(),initial.rend());  //逆序\n            if (reverse == initial)   //判断回文\n            {\n                basetype++;\n            }\n        }\n        if (basetype >= 2) //判断进制两种以上\n        {\n            cout << i << endl;\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,35,424
1277907115388100608,ea5548fa6c756374a6604f201cb2ed15a7d8bd72ab79e1d820ed79330dcb162c,2020-06-30 18:09:33,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nint a[500],z[500];\nbool j(int x,const int y){\n\tint cnt=0;\n\twhile(x!=0){\n\t\ta[cnt++]=x%y;\n\t\tx/=y;\n\t}\n\tfor(int i=0;i<cnt/2;i++){\n\t\tif(a[i]!=a[cnt-1-i]) return false;\n\t}\n\treturn true;\n}\nvoid print(int a,int b){\n\tint cnt=0;\n\twhile(a!=0){\n\t\tz[cnt++]=a%b;\n\t\ta/=b;\n\t}\n\tfor(int i=cnt-1;i>=0;i--) cout<<z[i];\n}\nint main(){\n\tint B;\n\tcin>>B;\n\tfor(int i=1;i<=300;i++){\n\t\tif(j(i*i,B)) {\n\t\tprint(i,B);\n\t\tcout<<\"" \"";\n\t\tprint(i*i,B);\n\t\tcout<<endl;}\n\t}\n\treturn 0;\n}\n",PARTIAL_ACCEPTED,33,592
1277907402219782144,f8b263609a898c5499c07fc9ba7bcd00e46a82e38e73d327331416411a74e117,2020-06-30 18:10:41,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nint main()\n{\n    int N,S;   //N个大于S\n    cin >> N >> S;\n    \n    int count = 0;\n    for (int i = S + 1; count < N; i++)  //i并没有上限，只需找出前N个符合条件的，即上限由count来控制\n    {\n        int basetype = 0;\n        for (int base = 2; base <=10; base++)\n        {\n            char line[100];\n            string initial(line);\n            string reverse(initial.rbegin(),initial.rend());  //逆序\n            if (reverse == initial)   //判断回文\n            {\n                basetype++;\n            }\n        }\n        if (basetype >= 2) //判断进制两种以上\n        {\n            count++;  //注：只有找到符合的了才计数一次\n            cout << i << endl;\n        }\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,26,512
1277907770802626560,f8b263609a898c5499c07fc9ba7bcd00e46a82e38e73d327331416411a74e117,2020-06-30 18:12:09,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string.h>\n#include <algorithm>\nusing namespace std;\n\nint main()\n{\n    int N,S;   //N个大于S\n    cin >> N >> S;\n    \n    int count = 0;\n    for (int i = S + 1; count < N; i++)  //i并没有上限，只需找出前N个符合条件的，即上限由count来控制\n    {\n        int basetype = 0;\n        for (int base = 2; base <=10; base++)\n        {\n            char line[33];\n            string initial(line);\n            string reverse(initial.rbegin(),initial.rend());  //逆序\n            if (reverse == initial)   //判断回文\n            {\n                basetype++;\n            }\n        }\n        if (basetype >= 2) //判断进制两种以上\n        {\n            count++;  //注：只有找到符合的了才计数一次\n            cout << i << endl;\n        }\n    }\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,0,0
1277908033978433536,f8b263609a898c5499c07fc9ba7bcd00e46a82e38e73d327331416411a74e117,2020-06-30 18:13:12,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string.h>\nusing namespace std;\n\nint main()\n{\n    int N,S;   //N个大于S\n    cin >> N >> S;\n    \n    int count = 0;\n    for (int i = S + 1; count < N; i++)  //i并没有上限，只需找出前N个符合条件的，即上限由count来控制\n    {\n        int basetype = 0;\n        for (int base = 2; base <=10; base++)\n        {\n            char line[33];\n            string initial(line);\n            string reverse(initial.rbegin(),initial.rend());  //逆序\n            if (reverse == initial)   //判断回文\n            {\n                basetype++;\n            }\n        }\n        if (basetype >= 2) //判断进制两种以上\n        {\n            count++;  //注：只有找到符合的了才计数一次\n            cout << i << endl;\n        }\n    }\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,0,0
1277908622447665152,efebf08217b0753fc2c338fd2b3a5a158b862b3914e72f6c91e0fc743af72013,2020-06-30 18:15:32,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint n;\n\tcin>>n;\n\tfor(int i=1;i<=300;i++)\n\t{\n\t\tint I=i,m=I*I,a=0,b=0;\n\t\tchar shu[100],ping[100];\n\t\twhile(I!=0){\n\t\t\tint e=I%n;\n\t\t\tif(e<10)\n\t\t\t\tshu[a]=e+48;\n\t\t\tif(e>=10)\n\t\t\t\tshu[a]=e+55;\n\t\t\tI=I/n;\n\t\t\ta=a+1;\n\t\t}\n\t\twhile(m!=0){\n\t\t\tint f=m%n;\n\t\t\tif(f<10)\n\t\t\t\tping[b]=f+48;\n\t\t\tif(f>=10)\n\t\t\t\tping[b]=f+55;\n\t\t\tm=m/n;\n\t\t\tb=b+1;\n\t\t}\n\t\t\n\t\tint k=0;\n\t\tfor(int j=0;j<b/2;j++)\n\t\t{\n\t\t\tif(ping[j]!=ping[b-j-1])\n\t\t\t\tbreak;\n\t\t\tif(ping[j]==ping[b-j-1])\n\t\t\t\tk=k+1;\n\t\t}\n\t\t\n\t\tif(k==b/2)\n\t\t{\n\t\t\tfor(int q=a-1;q>=0;q--)\n\t\t\t\tcout<<shu[q];\n\t\t\tcout<<\"" \"";\n\t\t\tfor(int p=0;p<b;p++)\n\t\t\t\tcout<<ping[p];\n\t\t\tcout<<endl;\n\t\t}\n\t}\n}",ACCEPTED,33,512
1277909081262587904,4be75d8115b6c47132d131369bdafc8b7ddb12eca0694e54220169517cb1c367,2020-06-30 18:17:22,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\nusing namespace std;\nchar a[20], b[20];\nchar c[10] = { 'A','B','C','D','E','F','G','H','I','J' };//用A到J来定义10到19\nint trans(int n,int B,char b[])\n{\n\tint w = 0, z;\n\tz = n % B;\n\twhile (z != 0) {                      //这个映射是反序的！回文数倒过来一样，原数需要调整\n\t\tif (z - 10 >= 0) {\n\t\t\tb[w] = c[z - 10];//映射到字母\n\t\t}\n\t\telse {\n\t\t\tb[w] = z+48;//char b[]需要0的字符，‘0’对应48\n\t\t}\n\t\tn/=B;\n\t\tw++;\n\t}\n\tb[w] = '0';\n\treturn w;//求出位数\n}\n\nbool judge(int w)//利用位数来判断\n{\n\tfor (int i = 0; i < w / 2; i++) {\n\t\tif (b[i] = b[w - 1 - i]) {\n\t\t\treturn true;\n\t\t}\n\t\telse {\n\t\t\treturn false;\n\t\t}\n\t}\n}\n\nint main()\n{\n\tint B;\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tif(judge(trans(i*i,B,b))){\n\t\t\tint x = trans(i, B, a);\n\t\t\tfor (i = x - 1; i >= 0;i--) {//调成原数的输出顺序\n\t\t\t\tcout << a[i];\n\t\t\t}\n\t\t\tcout << \"" \"" << b;\n\t\t}\n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,42,384
1277909319297720320,5a49425d378aea97465899ac58b9d7047969b1db42f4841d3104d25455eafef8,2020-06-30 18:18:18,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n\n\nusing namespace std;\nint N, j[10000], k, S;\n\nvoid jinzhi(int x, int y)\n{\n\tk = 0;\n\twhile (x)\n\t{\n\t\tj[++k] = x % y;\n\t\tx /= y;\n\t}\n}\n\nbool panduan()\n{\n\tfor (int i = 1; i <= k; i++)\n\t{\n\t\tif (j[i] != j[k - i + 1])\n\t\t\treturn 0;\n\t}\n\treturn 1;\n}\n\nint main()\n{\n\tcin >> N >> S;\n\tint s = 0;\n\tfor (int i = S+1; s < N; i++)\n\t{\n\t\tint c = 0;\n\t\tfor(int j=2;j<=10;j++)\n\t\t{\n\t\t\tjinzhi(i, j);\n\t\t\tif (panduan())\n\t\t\t{\n\t\t\t\tc++;\n\t\t\t}\n\t\t}\n\n\t\tif (c >= 2)\n\t\t{\n\t\t\tcout << i << endl;\n\t\t\ts++;\n\t\t}\n\t\t\t\n\t}\n\n\t\n}",ACCEPTED,38,512
1277909592644714496,4be75d8115b6c47132d131369bdafc8b7ddb12eca0694e54220169517cb1c367,2020-06-30 18:19:23,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\nusing namespace std;\nchar  b[20];\nchar c[10] = { 'A','B','C','D','E','F','G','H','I','J' };//用A到J来定义10到19\nint trans(int n,int B,char b[])\n{\n\tint w = 0, z;\n\tz = n % B;\n\twhile (z != 0) {                      //这个映射是反序的！回文数倒过来一样，原数需要调整\n\t\tif (z - 10 >= 0) {\n\t\t\tb[w] = c[z - 10];//映射到字母\n\t\t}\n\t\telse {\n\t\t\tb[w] = z+48;//char b[]需要0的字符，‘0’对应48\n\t\t}\n\t\tn/=B;\n\t\tw++;\n\t}\n\tb[w] = '0';\n\treturn w;//求出位数\n}\n\nbool judge(int w)//利用位数来判断\n{\n\tfor (int i = 0; i < w / 2; i++) {\n\t\tif (b[i] = b[w - 1 - i]) {\n\t\t\treturn true;\n\t\t}\n\t\telse {\n\t\t\treturn false;\n\t\t}\n\t}\n}\n\nint main()\n{\n\tint B;\n    char a[20];\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tif(judge(trans(i*i,B,b))){\n\t\t\tint x = trans(i, B, a);\n\t\t\tfor (i = x - 1; i >= 0;i--) {//调成原数的输出顺序\n\t\t\t\tcout << a[i];\n\t\t\t}\n\t\t\tcout << \"" \"" << b;\n\t\t}\n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,44,384
1277910387423379456,4be75d8115b6c47132d131369bdafc8b7ddb12eca0694e54220169517cb1c367,2020-06-30 18:22:33,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\nusing namespace std;\nchar  b[20];\nchar c[10] = { 'A','B','C','D','E','F','G','H','I','J' };//用A到J来定义10到19\nint trans(int n,int B,char b[])\n{\n\tint w = 0, z;\n\tz = n % B;\n\twhile (z != 0) {                      //这个映射是反序的！回文数倒过来一样，原数需要调整\n\t\tif (z - 10 >= 0) {\n\t\t\tb[w] = c[z - 10];//映射到字母\n\t\t}\n\t\telse {\n\t\t\tb[w] = z+48;//char b[]需要0的字符，‘0’对应48\n\t\t}\n\t\tn/=B;\n\t\tw++;\n\t}\n\tb[w] = '0';\n\treturn w;//求出位数\n}\n\nbool judge(int w)//利用位数来判断\n{\n\tfor (int i = 0; i < w / 2; i++) {\n\t\tif (b[i] = b[w - 1 - i]) {\n\t\t\treturn true;\n\t\t}\n\t\telse {\n\t\t\treturn false;\n\t\t}\n\t}\n}\n\nint main()\n{\n\tint B;\n    char a[20];\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tif(judge(trans(i*i,B,b))){\n\t\t\tint x = trans(i, B, a);\n\t\t\tfor (j = x - 1; j >= 0;j--) {//调成原数的输出顺序\n\t\t\t\tcout << a[j];\n\t\t\t}\n\t\t\tcout << \"" \"" << b;\n\t\t}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1277910502427000832,4be75d8115b6c47132d131369bdafc8b7ddb12eca0694e54220169517cb1c367,2020-06-30 18:23:00,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\nusing namespace std;\nchar  b[20];\nchar c[10] = { 'A','B','C','D','E','F','G','H','I','J' };//用A到J来定义10到19\nint trans(int n,int B,char b[])\n{\n\tint w = 0, z;\n\tz = n % B;\n\twhile (z != 0) {                      //这个映射是反序的！回文数倒过来一样，原数需要调整\n\t\tif (z - 10 >= 0) {\n\t\t\tb[w] = c[z - 10];//映射到字母\n\t\t}\n\t\telse {\n\t\t\tb[w] = z+48;//char b[]需要0的字符，‘0’对应48\n\t\t}\n\t\tn/=B;\n\t\tw++;\n\t}\n\tb[w] = '0';\n\treturn w;//求出位数\n}\n\nbool judge(int w)//利用位数来判断\n{\n\tfor (int i = 0; i < w / 2; i++) {\n\t\tif (b[i] = b[w - 1 - i]) {\n\t\t\treturn true;\n\t\t}\n\t\telse {\n\t\t\treturn false;\n\t\t}\n\t}\n}\n\nint main()\n{\n\tint B;\n    char a[20];\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tif(judge(trans(i*i,B,b))){\n\t\t\tint x = trans(i, B, a);\n\t\t\tfor (j = x - 1; j >= 0;j--) {//调成原数的输出顺序\n\t\t\t\tcout << a[j];\n\t\t\t}\n\t\t\tcout << \"" \"" << b;\n\t\t}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1277910808556658688,4be75d8115b6c47132d131369bdafc8b7ddb12eca0694e54220169517cb1c367,2020-06-30 18:24:13,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\nusing namespace std;\nchar  b[20];\nchar c[10] = { 'A','B','C','D','E','F','G','H','I','J' };//用A到J来定义10到19\nint trans(int n,int B,char b[])\n{\n\tint w = 0, z;\n\tz = n % B;\n\twhile (z != 0) {                      //这个映射是反序的！回文数倒过来一样，原数需要调整\n\t\tif (z - 10 >= 0) {\n\t\t\tb[w] = c[z - 10];//映射到字母\n\t\t}\n\t\telse {\n\t\t\tb[w] = z+48;//char b[]需要0的字符，‘0’对应48\n\t\t}\n\t\tn/=B;\n\t\tw++;\n\t}\n\tb[w] = '0';\n\treturn w;//求出位数\n}\n\nbool judge(int w)//利用位数来判断\n{\n\tfor (int i = 0; i < w / 2; i++) {\n\t\tif (b[i] = b[w - 1 - i]) {\n\t\t\treturn true;\n\t\t}\n\t\telse {\n\t\t\treturn false;\n\t\t}\n\t}\n}\n\nint main()\n{\n\tint B;\n    char a[20];\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tif(judge(trans(i*i,B,b))){\n\t\t\tint x = trans(i, B, a);\n\t\t\tfor (int j = x - 1; j >= 0;j--) {//调成原数的输出顺序\n\t\t\t\tcout << a[j];\n\t\t\t}\n\t\t\tcout << \"" \"" << b;\n\t\t}\n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,39,384
1277910960562438144,4be75d8115b6c47132d131369bdafc8b7ddb12eca0694e54220169517cb1c367,2020-06-30 18:24:50,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\nusing namespace std;\nchar  b[20];\nchar c[10] = { 'A','B','C','D','E','F','G','H','I','J' };//用A到J来定义10到19\nint trans(int n,int B,char b[])\n{\n\tint w = 0, z;\n\tz = n % B;\n\twhile (z != 0) {                      //这个映射是反序的！回文数倒过来一样，原数需要调整\n\t\tif (z - 10 >= 0) {\n\t\t\tb[w] = c[z - 10];//映射到字母\n\t\t}\n\t\telse {\n\t\t\tb[w] = z+48;//char b[]需要0的字符，‘0’对应48\n\t\t}\n\t\tn/=B;\n\t\tw++;\n\t}\n\tb[w] = '0';\n\treturn w;//求出位数\n}\n\nbool judge(int w)//利用位数来判断\n{\n\tfor (int i = 0; i < w / 2; i++) {\n\t\tif (b[i] = b[w - 1 - i]) {\n\t\t\treturn true;\n\t\t}\n\t\telse {\n\t\t\treturn false;\n\t\t}\n\t}\n}\n\nint main()\n{\n\tint B;\n    char a[20];\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tif(judge(trans(i*i,B,b))){\n\t\t\tint x = trans(i, B, a);\n\t\t\tfor (int j = x - 1; j >= 0;j--) {//调成原数的输出顺序\n\t\t\t\tcout << a[j];\n\t\t\t}\n\t\t\tcout << \"" \"" << b;\n\t\t}\n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,29,512
1277910963699769344,a870a79d2df669b7f87342f8f7ec6274f70032997550fa9fe07a832f5874704b,2020-06-30 18:24:50,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n\nusing namespace std;\n\nint main()\n{ int B,i,j,a,f,num[20];\n  char NUM[20];\n  cin>>B;\n  int pow(int x,int y);\n  if(B>=2&&B<11){\n  for(i=1;i<301;i++){\n\t  a=i*i;\n\t  f=0;\n\t\t  while(a>0){\n\t\t   num[f]=(a%pow(B,f+1))/pow(B,f);\n\t\t   a=a-a%pow(B,f+1);\n\t\t\t  if(a/pow(B,f+1)>=B) f++;\n\t\t\t  else if(a/pow(B,f+1)>0&&a/pow(B,f+1)<B){  num[f+1]=a/pow(B,f+1);f++;break;}\n\t\t\t  else break;\n\t\t  }\n\t\t  for(j=0;j<=f;j++){\n\t\t  if(num[j]!=num[f-j]) break;\n\t\t  }\n\t\t  if(j>f) cout<<i<<\"" \""<<i*i<<endl;\n\n\t  }\n    if(B>=11&&B<=20){  \n\t\tfor(i=1;i<301;i++){\n\t  a=i*i;\n\t  f=0;\n\t\t  while(a>0){\n\t\t   NUM[f]=(a%pow(B,f+1))/pow(B,f)+55;\n\t\t   a=a-a%pow(B,f+1);\n\t\t\t  if(a/pow(B,f+1)>=B) f++;\n\t\t\t  else if(a/pow(B,f+1)>0&&a/pow(B,f+1)<B){  NUM[f+1]=a/pow(B,f+1)+55;f++;break;}\n\t\t\t  else break;\n\t\t  }\n\t\t  for(j=0;j<=f;j++){\n\t\t  if(NUM[j]!=NUM[f-j]) break;\n\t\t  }\n\t\t  if(j>f) cout<<i<<\"" \""<<i*i<<endl;\n}\n\n}\n  \n  }\n}\nint pow(int x,int y)\n{ int a=1;\n   for(int i=0;i<y;i++)\n   {a=a*x;}\n   return a;\n}",PARTIAL_ACCEPTED,44,544
1277911001893109760,a870a79d2df669b7f87342f8f7ec6274f70032997550fa9fe07a832f5874704b,2020-06-30 18:24:59,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nchar NUM[30]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J','K'};\nchar num1[100],num2[100];\nint B,i,j,k;\nint main()\n{cin>>B;\n  bool tf(int a);\n  void change(int a);\n  for(j=1;j<=300;j++)\n  {  if(tf(j*j)){\n\t  change(j);\n\t  for(int m=k-1;m>=0;m--){cout<<num2[m];}\n\t  cout<<\"" \"";\n\t  for(int m=0;m<i;m++){cout<<num1[m];}\n\t  cout<<endl; \n    }\n  }\n  return 0;\n}\n bool tf(int a)\n{  i=0;\n   while(a>0){\n\t num1[i]=NUM[a%B];\n\t a=a/B;\n\t i++;\n }\n for(int m=0;m<i;m++){\n\t if(num1[m]!=num1[i-m-1]) return 0;\n }\n return 1;\n }\n\n void change(int a)\n {  k=0;\n\t while(a>0){\n\t num2[k]=NUM[a%B];\n\t a=a/B;\n\t k++;\n\t }\n\n }",ACCEPTED,46,612
1277911611375812608,9ee817591b0a074b9c9c9b4b25315f18eb72bbe102d00a51fe4ea5381fc17bf4,2020-06-30 18:27:25,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nchar Array[20]{'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nstring func1(int Num,int J){//转化进制\n    string After;\n//    string Reverse;\n    while(Num){\n        int temp = Num%J;\n        char tempNum = Array[temp];\n        After.push_back(tempNum);\n        Num = Num/J;\n    }\n    return After;\n//    for(int i = 0;i<After.size();i++){\n//        Reverse[i] = After[After.size()-1-i];\n//    }\n//    return Reverse;\n}\n\nint func2(string s){\n    int Judge = 0;\n    for(int i = 0;i<s.size();i++){\n       if(s[i]==s[s.size()-1-i])\n           Judge = 1;\n       else{\n           Judge = 0;\n           break;\n       }\n    }\n    return Judge;\n}\nint main(){\n    int B;\n    cin>>B;\n    for(int i=1;i<=300;i++){\n        string Before = func1(i,B);\n        string Aftersquare = func1(i*i,B);\n        if(func2(Aftersquare)){\n            for(int i=Before.size()-1;i>=0;i--){\n                cout << Before[i];\n            }\n            cout<<\"" \""<<Aftersquare<<endl;\n        }\n    }\n\n    return 0;\n}\n\n\n\n\n\n\n\n\n\n\n",ACCEPTED,42,432
1277911688282562560,4be75d8115b6c47132d131369bdafc8b7ddb12eca0694e54220169517cb1c367,2020-06-30 18:27:43,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\nusing namespace std;\nchar  b[20];\nchar c[10] = { 'A','B','C','D','E','F','G','H','I','J' };//用A到J来定义10到19\nint trans(int n,int B,char b[])\n{\n\tint w = 0, z;\n\tz = n % B;\n\twhile (z != 0) {                      //这个映射是反序的！回文数倒过来一样，原数需要调整\n\t\tif (z - 10 >= 0) {\n\t\t\tb[w] = c[z - 10];//映射到字母\n\t\t}\n\t\telse {\n\t\t\tb[w] = z+48;//char b[]需要0的字符，‘0’对应48\n\t\t}\n\t\tn/=B;\n\t\tw++;\n\t}\n\tb[w] = '0';\n\treturn w;//求出位数\n}\n\nbool judge(int w)//利用位数来判断\n{\n\tfor (int i = 0; i < w / 2; i++) {\n\t\tif (b[i] = b[w - 1 - i]) {\n\t\t\treturn true;\n\t\t}\n\t\telse {\n\t\t\treturn false;\n\t\t}\n\t}\n}\n\nint main()\n{\n\tint B;\n    char a[20];\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tif(judge(trans(i*i,B,b))){\n\t\t\tint x = trans(i, B, a);\n\t\t\tfor (int j = x - 1; j >= 0;j--) {//调成原数的输出顺序\n\t\t\t\tcout << a[j];\n\t\t\t}\n\t\t\tcout << \"" \"" << b;\n\t\t}\n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,40,384
1277912469199052800,bbc32b3ed49ab612815ed342e7a9a82917eefb8ef54f7578f63f18a6338adb40,2020-06-30 18:30:49,C++,70.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\n#include <cmath>\nusing namespace std;\n\nstring change(int number, int radix);\nbool verify(string str);\n\nint main()\n{\n    int radix;\n    cin >> radix;\n\n    for (int i=1; i<=300; i++)\n    {\n        string aa = change(i*i,radix);\n        if (verify(aa))\n        {\n            cout << change(i,radix) << \"" \"" << change(i*i,radix) << endl;\n        }\n    }\n    return 0;\n}\n\nstring change(int number, int radix)\n{\n    string oput;\n\n    if (radix == 2)\n    {\n        while (number)\n        {\n            int n = number%2;\n            number /= 2;\n            oput += to_string(n);\n        }       \n    }\n    else\n    {\n        if (number >= radix && radix != 10)\n        {\n            do\n            {\n                int n = number%radix;\n                number = number/radix;\n                switch(n)\n                {\n                    case 10 : oput += 'A';\n                            break;\n                    case 11 : oput += 'B';\n                            break;\n                    case 12 : oput += 'C';\n                            break;\n                    case 13 : oput += 'D';\n                            break;\n                    case 14 : oput += 'E';\n                            break;\n                    case 15 : oput += 'F';\n                            break;\n                    case 16 : oput += 'G';\n                            break;\n                    case 17 : oput += 'H';\n                            break;\n                    case 18 : oput += 'I';\n                            break;\n                    case 19 : oput += 'J';\n                            break;\n                    case 20 : oput += 'K';\n                            break;\n                    default : oput += to_string(n);\n                            break;\n                }\n            }while (number != 0);\n        }\n        else\n        {\n            if (radix != 10)\n            {\n                switch(number)\n                    {\n                        case 10 : oput += 'A';\n                                break;\n                        case 11 : oput += 'B';\n                                break;\n                        case 12 : oput += 'C';\n                                break;\n                        case 13 : oput += 'D';\n                                break;\n                        case 14 : oput += 'E';\n                                break;\n                        case 15 : oput += 'F';\n                                break;\n                        case 16 : oput += 'G';\n                                break;\n                        case 17 : oput += 'H';\n                                break;\n                        case 18 : oput += 'I';\n                                break;\n                        case 19 : oput += 'J';\n                                break;\n                        case 20 : oput += 'K';\n                                break;\n                        default : oput += to_string(number);\n                                break;\n                    }\n            }\n            else\n            {\n                oput += to_string(number);\n            }\n        }\n    }\n\n    reverse(oput.begin(),oput.end());\n    return oput;\n}\n\nbool verify(string str)\n{\n    string rstr = str;\n    reverse(rstr.begin(),rstr.end());\n    if (str == rstr)\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}",PARTIAL_ACCEPTED,27,424
1277912615286669312,4be75d8115b6c47132d131369bdafc8b7ddb12eca0694e54220169517cb1c367,2020-06-30 18:31:24,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include <algorithm>\n#include <bitset>\n#include <complex>\n#include <deque>\n#include <exception>\n#include <fstream>\n#include <functional>\n#include <iomanip>\n#include <ios>\n#include <iosfwd>\n#include <iostream>\n#include <istream>\n#include <iterator>\n#include <limits>\n#include <list>\n#include <locale>\n#include <map>\n#include <memory>\n#include <new>\n#include <numeric>\n#include <ostream>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <stdexcept>\n#include <streambuf>\n#include <string>\n#include <typeinfo>\n#include <utility>\n#include <valarray>\n\nusing namespace std;\nchar  b[20];\nchar c[10] = { 'A','B','C','D','E','F','G','H','I','J' };//用A到J来定义10到19\nint trans(int n,int B,char b[])\n{\n\tint w = 0, z;\n\tz = n % B;\n\twhile (z != 0) {                      //这个映射是反序的！回文数倒过来一样，原数需要调整\n\t\tif (z - 10 >= 0) {\n\t\t\tb[w] = c[z - 10];//映射到字母\n\t\t}\n\t\telse {\n\t\t\tb[w] = z+48;//char b[]需要0的字符，‘0’对应48\n\t\t}\n\t\tn/=B;\n\t\tw++;\n\t}\n\tb[w] = '0';\n\treturn w;//求出位数\n}\n\nbool judge(int w)//利用位数来判断\n{\n\tfor (int i = 0; i < w / 2; i++) {\n\t\tif (b[i] = b[w - 1 - i]) {\n\t\t\treturn true;\n\t\t}\n\t\telse {\n\t\t\treturn false;\n\t\t}\n\t}\n}\n\nint main()\n{\n\tint B;\n    char a[20];\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tif(judge(trans(i*i,B,b))){\n\t\t\tint x = trans(i, B, a);\n\t\t\tfor (int j = x - 1; j >= 0;j--) {//调成原数的输出顺序\n\t\t\t\tcout << a[j];\n\t\t\t}\n\t\t\tcout << \"" \"" << b;\n\t\t}\n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,40,512
1277912792181432320,4be75d8115b6c47132d131369bdafc8b7ddb12eca0694e54220169517cb1c367,2020-06-30 18:32:06,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include <algorithm>\n#include <bitset>\n#include <complex>\n#include <deque>\n#include <exception>\n#include <fstream>\n#include <functional>\n#include <iomanip>\n#include <ios>\n#include <iosfwd>\n#include <iostream>\n#include <istream>\n#include <iterator>\n#include <limits>\n#include <list>\n#include <locale>\n#include <map>\n#include <memory>\n#include <new>\n#include <numeric>\n#include <ostream>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <stdexcept>\n#include <streambuf>\n#include <string>\n#include <typeinfo>\n#include <utility>\n#include <valarray>\n\nusing namespace std;\nchar  b[20];\nchar c[10] = { 'A','B','C','D','E','F','G','H','I','J' };//用A到J来定义10到19\nint trans(int n,int B,char b[])\n{\n\tint w = 0, z;\n\tz = n % B;\n\twhile (z != 0) {                      //这个映射是反序的！回文数倒过来一样，原数需要调整\n\t\tif (z - 10 >= 0) {\n\t\t\tb[w] = c[z - 10];//映射到字母\n\t\t}\n\t\telse {\n\t\t\tb[w] = z+48;//char b[]需要0的字符，‘0’对应48\n\t\t}\n\t\tn/=B;\n\t\tw++;\n\t}\n\tb[w] = '0';\n\treturn w;//求出位数\n}\n\nbool judge(int w)//利用位数来判断\n{\n\tfor (int i = 0; i < w / 2; i++) {\n\t\tif (b[i] = =b[w - 1 - i]) {\n\t\t\treturn true;\n\t\t}\n\t\telse {\n\t\t\treturn false;\n\t\t}\n\t}\n}\n\nint main()\n{\n\tint B;\n    char a[20];\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tif(judge(trans(i*i,B,b))){\n\t\t\tint x = trans(i, B, a);\n\t\t\tfor (int j = x - 1; j >= 0;j--) {//调成原数的输出顺序\n\t\t\t\tcout << a[j];\n\t\t\t}\n\t\t\tcout << \"" \"" << b;\n\t\t}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1277912818366472192,ea5548fa6c756374a6604f201cb2ed15a7d8bd72ab79e1d820ed79330dcb162c,2020-06-30 18:32:13,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nint a[500],z[500];\ninline char chan(int c){\n\tif(c>=10) return c-10+'A';\n\telse return '0'+c;\n}\nbool j(int x,const int y){\n\tint cnt=0;\n\twhile(x!=0){\n\t\ta[cnt++]=x%y;\n\t\tx/=y;\n\t}\n\tfor(int i=0;i<cnt/2;i++){\n\t\tif(a[i]!=a[cnt-1-i]) return false;\n\t}\n\treturn true;\n}\nvoid print(int a,int b){\n\tint cnt=0;\n\twhile(a!=0){\n\t\tz[cnt++]=a%b;\n\t\ta/=b;\n\t}\n\tfor(int i=cnt-1;i>=0;i--) cout<<chan(z[i]);\n}\nint main(){\n\tint B;\n\tcin>>B;\n\tfor(int i=1;i<=300;i++){\n\t\tif(j(i*i,B)) {\n\t\tprint(i,B);\n\t\tcout<<\"" \"";\n\t\tprint(i*i,B);\n\t\tcout<<endl;}\n\t}\n\treturn 0;\n}",ACCEPTED,28,544
1277912840130723840,4be75d8115b6c47132d131369bdafc8b7ddb12eca0694e54220169517cb1c367,2020-06-30 18:32:18,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include <algorithm>\n#include <bitset>\n#include <complex>\n#include <deque>\n#include <exception>\n#include <fstream>\n#include <functional>\n#include <iomanip>\n#include <ios>\n#include <iosfwd>\n#include <iostream>\n#include <istream>\n#include <iterator>\n#include <limits>\n#include <list>\n#include <locale>\n#include <map>\n#include <memory>\n#include <new>\n#include <numeric>\n#include <ostream>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <stdexcept>\n#include <streambuf>\n#include <string>\n#include <typeinfo>\n#include <utility>\n#include <valarray>\n\nusing namespace std;\nchar  b[20];\nchar c[10] = { 'A','B','C','D','E','F','G','H','I','J' };//用A到J来定义10到19\nint trans(int n,int B,char b[])\n{\n\tint w = 0, z;\n\tz = n % B;\n\twhile (z != 0) {                      //这个映射是反序的！回文数倒过来一样，原数需要调整\n\t\tif (z - 10 >= 0) {\n\t\t\tb[w] = c[z - 10];//映射到字母\n\t\t}\n\t\telse {\n\t\t\tb[w] = z+48;//char b[]需要0的字符，‘0’对应48\n\t\t}\n\t\tn/=B;\n\t\tw++;\n\t}\n\tb[w] = '0';\n\treturn w;//求出位数\n}\n\nbool judge(int w)//利用位数来判断\n{\n\tfor (int i = 0; i < w / 2; i++) {\n\t\tif (b[i] =b[w - 1 - i]) {\n\t\t\treturn true;\n\t\t}\n\t\telse {\n\t\t\treturn false;\n\t\t}\n\t}\n}\n\nint main()\n{\n\tint B;\n    char a[20];\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tif(judge(trans(i*i,B,b))){\n\t\t\tint x = trans(i, B, a);\n\t\t\tfor (int j = x - 1; j >= 0;j--) {//调成原数的输出顺序\n\t\t\t\tcout << a[j];\n\t\t\t}\n\t\t\tcout << \"" \"" << b;\n\t\t}\n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,32,424
1277913942452527104,4be75d8115b6c47132d131369bdafc8b7ddb12eca0694e54220169517cb1c367,2020-06-30 18:36:41,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include <algorithm>\n#include <bitset>\n#include <complex>\n#include <deque>\n#include <exception>\n#include <fstream>\n#include <functional>\n#include <iomanip>\n#include <ios>\n#include <iosfwd>\n#include <iostream>\n#include <istream>\n#include <iterator>\n#include <limits>\n#include <list>\n#include <locale>\n#include <map>\n#include <memory>\n#include <new>\n#include <numeric>\n#include <ostream>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <stdexcept>\n#include <streambuf>\n#include <string>\n#include <typeinfo>\n#include <utility>\n#include <valarray>\n\nusing namespace std;\nchar  b[20];\nchar c[10] = { 'A','B','C','D','E','F','G','H','I','J' };//用A到J来定义10到19\nint trans(int n,int B,char b[])\n{\n\tint w = 0, z;\n\tz = n % B;\n\twhile (z != 0) {                      //这个映射是反序的！回文数倒过来一样，原数需要调整\n\t\tif (z - 10 >= 0) {\n\t\t\tb[w] = c[z - 10];//映射到字母\n\t\t}\n\t\telse {\n\t\t\tb[w] = z+48;//char b[]需要0的字符，‘0’对应48\n\t\t}\n\t\tn/=B;\n\t\tw++;\n\t}\n\tb[w] = '0';\n\treturn w;//求出位数\n}\n\nbool judge(int w)//利用位数来判断\n{\n\tfor (int i = 0; i < w / 2; i++) {\n\t\tif (b[i] !=b[w - 1 - i]) {\n\t\t\treturn false;\n\t\t}\n\t\telse {\n\t\t\treturn true;\n\t\t}\n\t}\n}\n\nint main()\n{\n\tint B;\n    char a[20];\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tif(judge(trans(i*i,B,b))){\n\t\t\tint x = trans(i, B, a);\n\t\t\tfor (int j = x - 1; j >= 0;j--) {//调成原数的输出顺序\n\t\t\t\tcout << a[j];\n\t\t\t}\n\t\t\tcout << \"" \"" << b;\n\t\t}\n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,23,512
1277914197088722944,4be75d8115b6c47132d131369bdafc8b7ddb12eca0694e54220169517cb1c367,2020-06-30 18:37:41,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include <algorithm>\n#include <bitset>\n#include <complex>\n#include <deque>\n#include <exception>\n#include <fstream>\n#include <functional>\n#include <iomanip>\n#include <ios>\n#include <iosfwd>\n#include <iostream>\n#include <istream>\n#include <iterator>\n#include <limits>\n#include <list>\n#include <locale>\n#include <map>\n#include <memory>\n#include <new>\n#include <numeric>\n#include <ostream>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <stdexcept>\n#include <streambuf>\n#include <string>\n#include <typeinfo>\n#include <utility>\n#include <valarray>\n\nusing namespace std;\nchar  b[20];\nchar c[10] = { 'A','B','C','D','E','F','G','H','I','J' };//用A到J来定义10到19\nint trans(int n,int B,char b[])\n{\n\tint w = 0, z;\n\tz = n % B;\n\twhile (z != 0) {                      //这个映射是反序的！回文数倒过来一样，原数需要调整\n\t\tif (z - 10 >= 0) {\n\t\t\tb[w] = c[z - 10];//映射到字母\n\t\t}\n\t\telse {\n\t\t\tb[w] = z+48;//char b[]需要0的字符，‘0’对应48\n\t\t}\n\t\tn/=B;\n\t\tw++;\n\t}\n\tb[w] = '0';\n\treturn w;//求出位数\n}\n\nbool judge(int w)//利用位数来判断\n{\n\tfor (int i = 0; i < w / 2; i++) {\n\t\tif (b[i] !=b[w - 1 - i]) {\n\t\t\treturn false;\n\t\t}\n\t\telse {\n\t\t\treturn true;\n\t\t}\n\t}\n}\n\nint main()\n{\n\tint B;\n    char a[20];\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tif(judge(trans(i*i,B,b))){\n\t\t\tint x = trans(i, B, a);\n\t\t\tfor (int j = x - 1; j >= 0;j--) {//调成原数的输出顺序\n\t\t\t\tcout << a[j];\n\t\t\t}\n\t\t\tcout << \"" \"" << b;\n\t\t}\n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,44,396
1277914524848422912,4be75d8115b6c47132d131369bdafc8b7ddb12eca0694e54220169517cb1c367,2020-06-30 18:38:59,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include <algorithm>\n#include <bitset>\n#include <complex>\n#include <deque>\n#include <exception>\n#include <fstream>\n#include <functional>\n#include <iomanip>\n#include <ios>\n#include <iosfwd>\n#include <iostream>\n#include <istream>\n#include <iterator>\n#include <limits>\n#include <list>\n#include <locale>\n#include <map>\n#include <memory>\n#include <new>\n#include <numeric>\n#include <ostream>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <stdexcept>\n#include <streambuf>\n#include <string>\n#include <typeinfo>\n#include <utility>\n#include <valarray>\n\nusing namespace std;\nchar  b[20];\nchar c[10] = { 'A','B','C','D','E','F','G','H','I','J' };//用A到J来定义10到19\nint trans(int n,int B,char b[])\n{\n\tint w = 0, z;\n\tz = n % B;\n\twhile (z != 0) {                      //这个映射是反序的！回文数倒过来一样，原数需要调整\n\t\tif (z - 10 >= 0) {\n\t\t\tb[w] = c[z - 10];//映射到字母\n\t\t}\n\t\telse {\n\t\t\tb[w] = z+48;//char b[]需要0的字符，‘0’对应48\n\t\t}\n\t\tn/=B;\n\t\tw++;\n\t}\n\tb[w] = '0';\n\treturn w;//求出位数\n}\n\nbool judge(int w)//利用位数来判断\n{\n\tfor (int i = 0; i <= w / 2; i++) {\n\t\tif (b[i] !=b[w - 1 - i]) {\n\t\t\treturn false;\n\t\t}\n\t\telse {\n\t\t\treturn true;\n\t\t}\n\t}\n}\n\nint main()\n{\n\tint B;\n    char a[20];\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tif(judge(trans(i*i,B,b))){\n\t\t\tint x = trans(i, B, a);\n\t\t\tfor (int j = x - 1; j >= 0;j--) {//调成原数的输出顺序\n\t\t\t\tcout << a[j];\n\t\t\t}\n\t\t\tcout << \"" \"" << b;\n\t\t}\n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,38,548
1277915217604837376,bbc32b3ed49ab612815ed342e7a9a82917eefb8ef54f7578f63f18a6338adb40,2020-06-30 18:41:45,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\n#include <cmath>\nusing namespace std;\n\nstring change(int number, int radix);\nbool verify(string str);\n\nint main()\n{\n    int N;\n    int S;\n    cin >> N >> S;\n    int total = 0;\n    int number = S;\n\n    while (total != N)\n    {\n        for (int i=2; i<=10; i++)\n        {\n            string aa = change(number,i);\n            for (int j=2; j<=10; j++)\n            {\n                string bb = change(number,j);\n                if (verify(aa) && verify(bb))\n                {\n                    cout << number << endl;\n                    ++total;\n                }\n            }\n        }\n        ++number;\n    }\n    return 0;\n}\n\nstring change(int number, int radix)\n{\n    string oput;\n\n    if (radix == 2)\n    {\n        while (number)\n        {\n            int n = number%2;\n            number /= 2;\n            oput += to_string(n);\n        }       \n    }\n    else\n    {\n        if (number >= radix && radix != 10)\n        {\n            do\n            {\n                int n = number%radix;\n                number = number/radix;\n                oput += to_string(n);\n            }while (number != 0);\n        }\n        else\n        {\n            oput += to_string(number);\n        }\n    }\n\n    reverse(oput.begin(),oput.end());\n    return oput;\n}\n\nbool verify(string str)\n{\n    string rstr = str;\n    reverse(rstr.begin(),rstr.end());\n    if (str == rstr)\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}",MULTIPLE_ERROR,30,508
1277915443858169856,ad8686712a9999dbe03ced4f0edcc6d1ec90b29a12065ac79e4414d28f7d7af6,2020-06-30 18:42:39,Python,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"def transB(number,b):\n    numB = \""\""\n    while (number!=0):\n        numB = str(number%b)\n        number  = number//b\n    return numB\n\ntimesB = 0\ntimesN = 0\n\nN = int(input())\nS = int(input())\n\nwhile (timesN<N):\n    S +=1\n    for B in range(2,11):\n        numB = transB(S,B)\n        if (numB == numB[::-1]):\n            timesB +=1\n        if timesB>=2:\n            print(S)\n            break\n    timesB = 0",NON_ZERO_EXIT_CODE,162,3068
1277915618693537792,4be75d8115b6c47132d131369bdafc8b7ddb12eca0694e54220169517cb1c367,2020-06-30 18:43:20,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include <algorithm>\n#include <bitset>\n#include <complex>\n#include <deque>\n#include <exception>\n#include <fstream>\n#include <functional>\n#include <iomanip>\n#include <ios>\n#include <iosfwd>\n#include <iostream>\n#include <istream>\n#include <iterator>\n#include <limits>\n#include <list>\n#include <locale>\n#include <map>\n#include <memory>\n#include <new>\n#include <numeric>\n#include <ostream>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <stdexcept>\n#include <streambuf>\n#include <string>\n#include <typeinfo>\n#include <utility>\n#include <valarray>\n\nusing namespace std;\nchar  b[20];\nchar c[10] = { 'A','B','C','D','E','F','G','H','I','J' };//用A到J来定义10到19\nint trans(int n,int B,char b[])\n{\n\tint w = 0, z;\n\tz = n % B;\n\twhile (z != 0) {                      //这个映射是反序的！回文数倒过来一样，原数需要调整\n\t\tif (z - 10 >= 0) {\n\t\t\tb[w] = c[z - 10];//映射到字母\n\t\t}\n\t\telse {\n\t\t\tb[w] = z+48;//char b[]需要0的字符，‘0’对应48\n\t\t}\n\t\tn/=B;\n\t\tw++;\n\t}\n\tb[w] = '0';\n\treturn w;//求出位数\n}\n\nbool judge(int w)//利用位数来判断\n{\n\tfor (int i = 0; i <= w / 2; i++) {\n\t\tif (b[i] !=b[w - 1 - i]) {\n\t\t\treturn false;\n\t\t}\n\t}\n    return true;\n}\n\nint main()\n{\n\tint B;\n    char a[20];\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tif(judge(trans(i*i,B,b))){\n\t\t\tint x = trans(i, B, a);\n\t\t\tfor (int j = x - 1; j >= 0;j--) {//调成原数的输出顺序\n\t\t\t\tcout << a[j];\n\t\t\t}\n\t\t\tcout << \"" \"" << b;\n\t\t}\n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,33,384
1277915659344732160,ad8686712a9999dbe03ced4f0edcc6d1ec90b29a12065ac79e4414d28f7d7af6,2020-06-30 18:43:30,Python,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"def transB(number,b):\n    numB = \""\""\n    while (number!=0):\n        numB = str(number%b)\n        number  = number//b\n    return numB\n\ntimesB = 0\ntimesN = 0\n\nN = int(input())\nS = int(input())\n\nwhile (timesN<N):\n    S +=1\n    for B in range(2,11):\n        numB = transB(S,B)\n        if (numB == numB[::-1]):\n            timesB +=1\n        if timesB>=2:\n            print(S)\n            break\n    timesB = 0\nexit(0)",NON_ZERO_EXIT_CODE,160,3164
1277915794791391232,4be75d8115b6c47132d131369bdafc8b7ddb12eca0694e54220169517cb1c367,2020-06-30 18:44:02,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nchar  b[20];\nchar c[10] = { 'A','B','C','D','E','F','G','H','I','J' };//用A到J来定义10到19\nint trans(int n,int B,char b[])\n{\n\tint w = 0, z;\n\tz = n % B;\n\twhile (z != 0) {                      //这个映射是反序的！回文数倒过来一样，原数需要调整\n\t\tif (z - 10 >= 0) {\n\t\t\tb[w] = c[z - 10];//映射到字母\n\t\t}\n\t\telse {\n\t\t\tb[w] = z+48;//char b[]需要0的字符，‘0’对应48\n\t\t}\n\t\tn/=B;\n\t\tw++;\n\t}\n\tb[w] = '0';\n\treturn w;//求出位数\n}\n\nbool judge(int w)//利用位数来判断\n{\n\tfor (int i = 0; i <= w / 2; i++) {\n\t\tif (b[i] !=b[w - 1 - i]) {\n\t\t\treturn false;\n\t\t}\n\t}\n    return true;\n}\n\nint main()\n{\n\tint B;\n    char a[20];\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tif(judge(trans(i*i,B,b))){\n\t\t\tint x = trans(i, B, a);\n\t\t\tfor (int j = x - 1; j >= 0;j--) {//调成原数的输出顺序\n\t\t\t\tcout << a[j];\n\t\t\t}\n\t\t\tcout << \"" \"" << b;\n\t\t}\n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,42,488
1277915883442200576,9ee817591b0a074b9c9c9b4b25315f18eb72bbe102d00a51fe4ea5381fc17bf4,2020-06-30 18:44:23,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nchar Array[20]{'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nstring func1(int Num,int J){//转化进制\n    string After;\n\n    while(Num){\n        int temp = Num%J;\n        char tempNum = Array[temp];\n        After.push_back(tempNum);\n        Num = Num/J;\n    }\n    return After;\n\n}\n\nvoid ReverseFunc(string t){\n    string Reverse;\n    for(int i = 0;i<t.size();i++){\n        Reverse[i] = t[t.size()-1-i];\n        cout<<Reverse[i];\n    }\n\n}\n\nint func2(string s){\n    int Judge = 0;\n    for(int i = 0;i<s.size();i++){\n       if(s[i]==s[s.size()-1-i])\n           Judge = 1;\n       else{\n           Judge = 0;\n           break;\n       }\n    }\n    return Judge;\n}\nint main(){\n    int B;\n    cin>>B;\n    for(int i=1;i<=300;i++){\n        string Before = func1(i,B);\n        string Aftersquare = func1(i*i,B);\n\n        if(func2(Aftersquare)){\n            ReverseFunc(Before);\n            cout<<\"" \""<<Aftersquare<<endl;\n        }\n    }\n    return 0;\n}\n\n\n\n\n\n\n\n\n\n\n",ACCEPTED,41,384
1277916294832128000,bbc32b3ed49ab612815ed342e7a9a82917eefb8ef54f7578f63f18a6338adb40,2020-06-30 18:46:01,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\n#include <cmath>\nusing namespace std;\n\nstring change(int number, int radix);\nbool verify(string str);\n\nint main()\n{\n    int N;\n    int S;\n    cin >> N >> S;\n    int total = 0;\n    int number = S+1;\n\n    while (total < N)\n    {\n        for (int i=2; i<=10; i++)\n        {\n            string aa = change(number,i);\n            for (int j=2; j<=10; j++)\n            {\n                string bb = change(number,j);\n                if (verify(aa) && verify(bb))\n                {\n                    cout << number << endl;\n                    ++total;\n                    j = 11;\n                    i = 11;\n                }\n            }\n        }\n        ++number;\n    }\n    return 0;\n}\n\nstring change(int number, int radix)\n{\n    string oput;\n\n    if (radix == 2)\n    {\n        while (number)\n        {\n            int n = number%2;\n            number /= 2;\n            oput += to_string(n);\n        }       \n    }\n    else\n    {\n        if (number >= radix && radix != 10)\n        {\n            do\n            {\n                int n = number%radix;\n                number = number/radix;\n                oput += to_string(n);\n            }while (number != 0);\n        }\n        else\n        {\n            oput += to_string(number);\n        }\n    }\n\n    reverse(oput.begin(),oput.end());\n    return oput;\n}\n\nbool verify(string str)\n{\n    string rstr = str;\n    reverse(rstr.begin(),rstr.end());\n    if (str == rstr)\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}",PARTIAL_ACCEPTED,58,504
1277916316944498688,ad8686712a9999dbe03ced4f0edcc6d1ec90b29a12065ac79e4414d28f7d7af6,2020-06-30 18:46:07,Python,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"def transB(number,b):\n    numB = \""\""\n    while (number!=0):\n        numB = str(number%b)\n        number  = number//b\n    return numB\n\ntimesB = 0\ntimesN = 0\n\nN = int(input())\nS = int(input())\n\nwhile (timesN<N):\n    S +=1\n    for B in range(2,11):\n        numB = transB(S,B)\n        if (numB == numB[::-1]):\n            timesB +=1\n        if timesB>=2:\n            timesN += 1\n            print(S)\n            break\n    timesB = 0\n\n",NON_ZERO_EXIT_CODE,160,3112
1277916348821200896,ea5548fa6c756374a6604f201cb2ed15a7d8bd72ab79e1d820ed79330dcb162c,2020-06-30 18:46:14,C++,50.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nint a[500];\nbool j(int x,const int y){\n\tint cnt=0;\n\twhile(x!=0){\n\t\ta[cnt++]=x%y;\n\t\tx/=y;\n\t}\n\tfor(int i=0;i<cnt/2;i++){\n\t\tif(a[i]!=a[cnt-1-i]) return false;\n\t}\n\treturn true;\n}\nint main(){\n\tint m,n,count=0;\n\tcin>>m>>n;\n\twhile(count<m){\n\t\tint num_count=0;\n\t\tfor(int i=2;i<=10;i++){\n\t\t\tif(j(n,i)) num_count++;\n\t\t\tif(num_count==2) break;\n\t\t}\n\t\tif(num_count==2){\n\t\t\tcount++;\n\t\t\tcout<<n<<endl;\n\t\t}\n\t\tn++;\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,37,384
1277916409093349376,ad8686712a9999dbe03ced4f0edcc6d1ec90b29a12065ac79e4414d28f7d7af6,2020-06-30 18:46:29,Python,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"def transB(number,b):\n    numB = \""\""\n    while (number!=0):\n        numB = str(number%b)\n        number  = number//b\n    return numB\n\ntimesB = 0\ntimesN = 0\n\nN = int(input())\nS = int(input())\n\nwhile (timesN<N):\n    S +=1\n    for B in range(2,11):\n        numB = transB(S,B)\n        if (numB == numB[::-1]):\n            timesB +=1\n        if timesB>=2:\n            timesN += 1\n            print(S)\n            break\n    timesB = 0\nexit(0)\n",NON_ZERO_EXIT_CODE,148,3060
1277916604749242368,4be75d8115b6c47132d131369bdafc8b7ddb12eca0694e54220169517cb1c367,2020-06-30 18:47:15,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nchar  b[20];\nchar c[10] = { 'A','B','C','D','E','F','G','H','I','J' };//用A到J来定义10到19\nint trans(int n,int B,char b[])\n{\n\tint w = 0, z;\n\twhile (z != 0) {  \n        z = n % B;//这个映射是反序的！回文数倒过来一样，原数需要调整\n\t\tif (z - 10 >= 0) {\n\t\t\tb[w] = c[z - 10];//映射到字母\n\t\t}\n\t\telse {\n\t\t\tb[w] = z+48;//char b[]需要0的字符，‘0’对应48\n\t\t}\n\t\tn/=B;\n\t\tw++;\n\t}\n\tb[w] = '0';\n\treturn w;//求出位数\n}\n\nbool judge(int w)//利用位数来判断\n{\n\tfor (int i = 0; i <= w / 2; i++) {\n\t\tif (b[i] !=b[w - 1 - i]) {\n\t\t\treturn false;\n\t\t}\n\t}\n    return true;\n}\n\nint main()\n{\n\tint B;\n    char a[20];\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tif(judge(trans(i*i,B,b))){\n\t\t\tint x = trans(i, B, a);\n\t\t\tfor (int j = x - 1; j >= 0;j--) {//调成原数的输出顺序\n\t\t\t\tcout << a[j];\n\t\t\t}\n\t\t\tcout << \"" \"" << b;\n\t\t}\n\t}\n\treturn 0;\n}",WRONG_ANSWER,31,384
1277917029753880576,4be75d8115b6c47132d131369bdafc8b7ddb12eca0694e54220169517cb1c367,2020-06-30 18:48:57,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nchar  b[20];\nchar c[10] = { 'A','B','C','D','E','F','G','H','I','J' };//用A到J来定义10到19\nint trans(int n,int B,char b[])\n{\n\tint w = 0, z;\n\twhile (n != 0) {  \n        z = n % B;//这个映射是反序的！回文数倒过来一样，原数需要调整\n\t\tif (z - 10 >= 0) {\n\t\t\tb[w] = c[z - 10];//映射到字母\n\t\t}\n\t\telse {\n\t\t\tb[w] = z+48;//char b[]需要0的字符，‘0’对应48\n\t\t}\n\t\tn/=B;\n\t\tw++;\n\t}\n\tb[w] = '0';\n\treturn w;//求出位数\n}\n\nbool judge(int w)//利用位数来判断\n{\n\tfor (int i = 0; i <= w / 2; i++) {\n\t\tif (b[i] !=b[w - 1 - i]) {\n\t\t\treturn false;\n\t\t}\n\t}\n    return true;\n}\n\nint main()\n{\n\tint B;\n    char a[20];\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tif(judge(trans(i*i,B,b))){\n\t\t\tint x = trans(i, B, a);\n\t\t\tfor (int j = x - 1; j >= 0;j--) {//调成原数的输出顺序\n\t\t\t\tcout << a[j];\n\t\t\t}\n\t\t\tcout << \"" \"" << b;\n\t\t}\n\t}\n\treturn 0;\n}",WRONG_ANSWER,37,444
1277917113774178304,ea5548fa6c756374a6604f201cb2ed15a7d8bd72ab79e1d820ed79330dcb162c,2020-06-30 18:49:17,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nint a[500];\nbool j(int x,const int y){\n\tint cnt=0;\n\twhile(x!=0){\n\t\ta[cnt++]=x%y;\n\t\tx/=y;\n\t}\n\tfor(int i=0;i<cnt/2;i++){\n\t\tif(a[i]!=a[cnt-1-i]) return false;\n\t}\n\treturn true;\n}\nint main(){\n\tint m,n,count=0;\n\tcin>>m>>n;\n    n++;\n\twhile(count<m){\n\t\tint num_count=0;\n\t\tfor(int i=2;i<=10;i++){\n\t\t\tif(j(n,i)) num_count++;\n\t\t\tif(num_count==2) break;\n\t\t}\n\t\tif(num_count==2){\n\t\t\tcount++;\n\t\t\tcout<<n<<endl;\n\t\t}\n\t\tn++;\n\t}\n\treturn 0;\n}",ACCEPTED,22,428
1277917138482823168,ad8686712a9999dbe03ced4f0edcc6d1ec90b29a12065ac79e4414d28f7d7af6,2020-06-30 18:49:23,Python,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"def transB(number,b):\n    numB = \""\""\n    while (number!=0):\n        numB = numB+str(number%b)\n        number  = number//b\n    return numB\n\ntimesB = 0\ntimesN = 0\n\nN = int(input())\nS = int(input())\n\nwhile (timesN<N):\n    S +=1\n    for B in range(2,11):\n        numB = transB(S,B)\n        if (numB == numB[::-1]):\n            timesB +=1\n        if timesB>=2:\n            timesN += 1\n            print(S)\n            break\n    timesB = 0\n\n",NON_ZERO_EXIT_CODE,165,2984
1277917228270280704,bbc32b3ed49ab612815ed342e7a9a82917eefb8ef54f7578f63f18a6338adb40,2020-06-30 18:49:44,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\n#include <cmath>\nusing namespace std;\n\nstring change(int number, int radix);\nbool verify(string str);\n\nint main()\n{\n    int N;\n    int S;\n    cin >> N >> S;\n    int total = 0;\n    int number = S+1;\n\n    while (total < N)\n    {\n        for (int i=2; i<=10; i++)\n        {\n            string aa = change(number,i);\n            for (int j=i; j<=10; j++)\n            {\n                string bb = change(number,j);\n                for (int k=j; k<=10; k++)\n                {\n                    string cc = change(number,k);\n                    if (verify(aa) && verify(bb) && verify(cc))\n                    {\n                        cout << number << endl;\n                        ++total;\n                        j = 11;\n                        i = 11;\n                        k = 11;\n                    }\n                }\n            }\n        }\n        ++number;\n    }\n    return 0;\n}\n\nstring change(int number, int radix)\n{\n    string oput;\n\n    if (radix == 2)\n    {\n        while (number)\n        {\n            int n = number%2;\n            number /= 2;\n            oput += to_string(n);\n        }       \n    }\n    else\n    {\n        if (number >= radix && radix != 10)\n        {\n            do\n            {\n                int n = number%radix;\n                number = number/radix;\n                oput += to_string(n);\n            }while (number != 0);\n        }\n        else\n        {\n            oput += to_string(number);\n        }\n    }\n\n    reverse(oput.begin(),oput.end());\n    return oput;\n}\n\nbool verify(string str)\n{\n    string rstr = str;\n    reverse(rstr.begin(),rstr.end());\n    if (str == rstr)\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}",PARTIAL_ACCEPTED,88,512
1277917481530753024,bbc32b3ed49ab612815ed342e7a9a82917eefb8ef54f7578f63f18a6338adb40,2020-06-30 18:50:44,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\n#include <cmath>\nusing namespace std;\n\nstring change(int number, int radix);\nbool verify(string str);\n\nint main()\n{\n    int N;\n    int S;\n    cin >> N >> S;\n    int total = 0;\n    int number = S+1;\n\n    while (total < N)\n    {\n        for (int i=2; i<=10; i++)\n        {\n            string aa = change(number,i);\n            for (int j=i; j<=10; j++)\n            {\n                string bb = change(number,j);\n                if (verify(aa) && verify(bb))\n                {\n                    cout << number << endl;\n                    ++total;\n                    j = 11;\n                    i = 11;\n\n                    }\n                }\n            }\n        }\n        ++number;\n    }\n    return 0;\n}\n\nstring change(int number, int radix)\n{\n    string oput;\n\n    if (radix == 2)\n    {\n        while (number)\n        {\n            int n = number%2;\n            number /= 2;\n            oput += to_string(n);\n        }       \n    }\n    else\n    {\n        if (number >= radix && radix != 10)\n        {\n            do\n            {\n                int n = number%radix;\n                number = number/radix;\n                oput += to_string(n);\n            }while (number != 0);\n        }\n        else\n        {\n            oput += to_string(number);\n        }\n    }\n\n    reverse(oput.begin(),oput.end());\n    return oput;\n}\n\nbool verify(string str)\n{\n    string rstr = str;\n    reverse(rstr.begin(),rstr.end());\n    if (str == rstr)\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}",COMPILE_ERROR,0,0
1277917591358595072,bbc32b3ed49ab612815ed342e7a9a82917eefb8ef54f7578f63f18a6338adb40,2020-06-30 18:51:11,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\n#include <cmath>\nusing namespace std;\n\nstring change(int number, int radix);\nbool verify(string str);\n\nint main()\n{\n    int N;\n    int S;\n    cin >> N >> S;\n    int total = 0;\n    int number = S+1;\n\n    while (total < N)\n    {\n        for (int i=2; i<=10; i++)\n        {\n            string aa = change(number,i);\n            for (int j=i; j<=10; j++)\n            {\n                string bb = change(number,j);\n                if (verify(aa) && verify(bb))\n                {\n                    cout << number << endl;\n                    ++total;\n                    j = 11;\n                    i = 11;\n                }\n            }\n        }\n        ++number;\n    }\n    return 0;\n}\n\nstring change(int number, int radix)\n{\n    string oput;\n\n    if (radix == 2)\n    {\n        while (number)\n        {\n            int n = number%2;\n            number /= 2;\n            oput += to_string(n);\n        }       \n    }\n    else\n    {\n        if (number >= radix && radix != 10)\n        {\n            do\n            {\n                int n = number%radix;\n                number = number/radix;\n                oput += to_string(n);\n            }while (number != 0);\n        }\n        else\n        {\n            oput += to_string(number);\n        }\n    }\n\n    reverse(oput.begin(),oput.end());\n    return oput;\n}\n\nbool verify(string str)\n{\n    string rstr = str;\n    reverse(rstr.begin(),rstr.end());\n    if (str == rstr)\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}",PARTIAL_ACCEPTED,37,428
1277917614137860096,ad8686712a9999dbe03ced4f0edcc6d1ec90b29a12065ac79e4414d28f7d7af6,2020-06-30 18:51:16,Python,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"def transB(number,b):\n    numB = \""\""\n    while (number!=0):\n        numB = numB+str(number%b)\n        number  = number//b\n    return numB\n\ntimesB = 0\ntimesN = 0\n\nN = int(input())\nS = int(input())\n\nwhile (timesN<N):\n    S +=1\n    for B in range(2,11):\n        numB = transB(S,B)\n        if (numB == numB[::-1]):\n            timesB +=1\n        if timesB>=2:\n            timesN += 1\n            print(S)\n            break\n    timesB = 0\nexit(0)\n",NON_ZERO_EXIT_CODE,169,3072
1277917641572802560,4be75d8115b6c47132d131369bdafc8b7ddb12eca0694e54220169517cb1c367,2020-06-30 18:51:22,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nchar  b[20];\nchar c[10] = { 'A','B','C','D','E','F','G','H','I','J' };//用A到J来定义10到19\nint trans(int n,int B,char b[])\n{\n\tint w = 0, z;\n\twhile (n != 0) {  \n        z = n % B;//这个映射是反序的！回文数倒过来一样，原数需要调整\n\t\tif (z - 10 >= 0) {\n\t\t\tb[w] = c[z - 10];//映射到字母\n\t\t}\n\t\telse {\n\t\t\tb[w] = z+48;//char b[]需要0的字符，‘0’对应48\n\t\t}\n\t\tn/=B;\n\t\tw++;\n\t}\n\tb[w] = '0';\n\treturn w;//求出位数\n}\n\nbool judge(int w)//利用位数来判断\n{\n\tfor (int i = 0; i <= w / 2; i++) {\n\t\tif (b[i] !=b[w - 1 - i]) {\n\t\t\treturn false;\n\t\t}\n\t}\n    return true;\n}\n\nint main()\n{\n\tint B;\n    char a[20];\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tif(judge(trans(i*i,B,b))){\n\t\t\tint x = trans(i, B, a);\n\t\t\tfor (int j = x - 1; j >= 0;j--) {//调成原数的输出顺序\n\t\t\t\tcout << a[j];\n\t\t\t}\n\t\t\tcout << \"" \"" << b<<endl;\n\t\t}\n\t}\n\treturn 0;\n}",WRONG_ANSWER,35,424
1277917680403677184,a622fad370c5d0d44359250bfc6de3881f212d9c66a4933009e89483895cb97c,2020-06-30 18:51:32,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <string>\nusing namespace std;\n\n\n\n\n//int ishuiwen(int k)\n//{\n//    int a[10],i=0,j;\n//    while (k>0){\n//        a[i]=k%10;\n//        k/=10;\n//        i++;\n//    }\n//    for (j=0; j<i; j++){\n//        if (a[j]!=a[i-j-1])\n//            return 0;\n//    }\n//    return 1;\n//}\nstring Change(int Number,int R)\n{\n  string remain=\""\"";\n  int temp;\n  do {\n   temp = Number%R;\n   Number /= R;\n   if (temp >= 10)\n       remain += temp - 10 + 'A';\n   else remain += temp + '0';\n  } while (Number);\n  reverse(remain.begin(),remain.end());\n  return remain;\n}\nint ishuiwen(string s){\n    int k = s.size() -1;\n    for(int i = 0,j = k;i<=j;i++,j--){\n        if(s[i]!=s[j]){\n            return 0;\n        }\n    }\n    return 1;\n}\n\n\n\n\nint main()\n{\n    int B;\n    cin >> B;\n    for(int i = 1;i<=300;i++){\n        if(ishuiwen(Change(i*i,B))){\n            cout <<i<<\"" \"" <<i*i<<endl;\n        }\n    }\n\n    return 0;\n}",PARTIAL_ACCEPTED,41,512
1277917750796673024,a622fad370c5d0d44359250bfc6de3881f212d9c66a4933009e89483895cb97c,2020-06-30 18:51:49,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <string>\nusing namespace std;\n\n\n\n\n//int ishuiwen(int k)\n//{\n//    int a[10],i=0,j;\n//    while (k>0){\n//        a[i]=k%10;\n//        k/=10;\n//        i++;\n//    }\n//    for (j=0; j<i; j++){\n//        if (a[j]!=a[i-j-1])\n//            return 0;\n//    }\n//    return 1;\n//}\nstring Change(int Number,int R)\n{\n  string remain=\""\"";\n  int temp;\n  do {\n   temp = Number%R;\n   Number /= R;\n   if (temp >= 10)\n       remain += temp - 10 + 'A';\n   else remain += temp + '0';\n  } while (Number);\n  reverse(remain.begin(),remain.end());\n  return remain;\n}\nint ishuiwen(string s){\n    int k = s.size() -1;\n    for(int i = 0,j = k;i<=j;i++,j--){\n        if(s[i]!=s[j]){\n            return 0;\n        }\n    }\n    return 1;\n}\n\n\n\n\nint main()\n{\n    int B;\n    cin >> B;\n    for(int i = 1;i<=300;i++){\n        if(ishuiwen(Change(i*i,B))){\n            cout <<i<<\"" \"" <<i*i<<endl;\n        }\n    }\n\n    return 0;\n}",PARTIAL_ACCEPTED,30,508
1277917794329354240,4be75d8115b6c47132d131369bdafc8b7ddb12eca0694e54220169517cb1c367,2020-06-30 18:51:59,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<vector>\nusing namespace std;\nchar a[20], b[20];\nchar c[10] = { 'A','B','C','D','E','F','G','H','I','J' };//用A到J来定义10到19\nint trans(int n,int B,char b[])\n{\n\tint w = 0, z;\n\t\n\twhile (z != 0) {    \n\t\tz = n % B;//这个映射是反序的！回文数倒过来一样，原数需要调整\n\t\tif (z - 10 >= 0) {\n\t\t\tb[w] = c[z - 10];//映射到字母\n\t\t}\n\t\telse {\n\t\t\tb[w] = z+48;//char b[]需要0的字符，‘0’对应48\n\t\t}\n\t\tn/=B;\n\t\tw++;\n\t}\n\tb[w] = '0';\n\treturn w;//求出位数\n}\n\nbool judge(int w)//利用位数来判断\n{\n\tfor (int i = 0; i < w / 2; i++) {\n\t\tif (b[i] != b[w - 1 - i]) {\n\t\t\treturn false;\n\t\t}\n\t\telse {\n\t\t\treturn true;\n\t\t}\n\t}\n}\n\nint main()\n{\n\tint B;\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tif(judge(trans(i*i,B,b))){\n\t\t\tint x = trans(i, B, a);\n\t\t\tfor (int j = x - 1; j >= 0;j--) {//调成原数的输出顺序\n\t\t\t\tcout << a[j];\n\t\t\t}\n\t\t\tcout << \"" \"" << b;\n\t\t}\n\t}\n\treturn 0;\n}",WRONG_ANSWER,40,516
1277917828005429248,a622fad370c5d0d44359250bfc6de3881f212d9c66a4933009e89483895cb97c,2020-06-30 18:52:07,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <string>\nusing namespace std;\n\n\nstring Change(int Number,int R)\n{\n  string remain=\""\"";\n  int temp;\n  do {\n   temp = Number%R;\n   Number /= R;\n   if (temp >= 10)\n       remain += temp - 10 + 'A';\n   else remain += temp + '0';\n  } while (Number);\n  reverse(remain.begin(),remain.end());\n  return remain;\n}\nint ishuiwen(string s){\n    int k = s.size() -1;\n    for(int i = 0,j = k;i<=j;i++,j--){\n        if(s[i]!=s[j]){\n            return 0;\n        }\n    }\n    return 1;\n}\n\n\n\n\nint main()\n{\n    int B;\n    cin >> B;\n    for(int i = 1;i<=300;i++){\n        if(ishuiwen(Change(i*i,B))){\n            cout <<i<<\"" \"" <<i*i<<endl;\n        }\n    }\n\n    return 0;\n}",PARTIAL_ACCEPTED,33,500
1277917911237197824,4be75d8115b6c47132d131369bdafc8b7ddb12eca0694e54220169517cb1c367,2020-06-30 18:52:27,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<vector>\nusing namespace std;\nchar a[20], b[20];\nchar c[10] = { 'A','B','C','D','E','F','G','H','I','J' };//用A到J来定义10到19\nint trans(int n,int B,char b[])\n{\n\tint w = 0, z;\n\t\n\twhile (n != 0) {    \n\t\tz = n % B;//这个映射是反序的！回文数倒过来一样，原数需要调整\n\t\tif (z - 10 >= 0) {\n\t\t\tb[w] = c[z - 10];//映射到字母\n\t\t}\n\t\telse {\n\t\t\tb[w] = z+48;//char b[]需要0的字符，‘0’对应48\n\t\t}\n\t\tn/=B;\n\t\tw++;\n\t}\n\tb[w] = '0';\n\treturn w;//求出位数\n}\n\nbool judge(int w)//利用位数来判断\n{\n\tfor (int i = 0; i < w / 2; i++) {\n\t\tif (b[i] != b[w - 1 - i]) {\n\t\t\treturn false;\n\t\t}\n\t\telse {\n\t\t\treturn true;\n\t\t}\n\t}\n}\n\nint main()\n{\n\tint B;\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tif(judge(trans(i*i,B,b))){\n\t\t\tint x = trans(i, B, a);\n\t\t\tfor (int j = x - 1; j >= 0;j--) {//调成原数的输出顺序\n\t\t\t\tcout << a[j];\n\t\t\t}\n\t\t\tcout << \"" \"" << b;\n\t\t}\n\t}\n\treturn 0;\n}",WRONG_ANSWER,39,512
1277917959433936896,ad8686712a9999dbe03ced4f0edcc6d1ec90b29a12065ac79e4414d28f7d7af6,2020-06-30 18:52:38,Python,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"def transB(number,b):\n    numB = \""\""\n    while (number!=0):\n        numB = numB+str(number%b)\n        number  = number//b\n    return numB\n\ntimesB = 0\ntimesN = 0\n\nN = int(input())\nS = int(input())\n\nwhile (timesN<N):\n    S +=1\n    for B in range(2,11):\n        numB = transB(S,B)\n        reverB = numB[::-1]\n        if (numB == reverB):\n            timesB +=1\n        if timesB>=2:\n            timesN += 1\n            print(S)\n            break\n    timesB = 0\nexit(0)\n",NON_ZERO_EXIT_CODE,153,3044
1277918032339337216,4be75d8115b6c47132d131369bdafc8b7ddb12eca0694e54220169517cb1c367,2020-06-30 18:52:56,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<vector>\nusing namespace std;\nchar a[20], b[20];\nchar c[10] = { 'A','B','C','D','E','F','G','H','I','J' };//用A到J来定义10到19\nint trans(int n,int B,char b[])\n{\n\tint w = 0, z;\n\t\n\twhile (n != 0) {    \n\t\tz = n % B;//这个映射是反序的！回文数倒过来一样，原数需要调整\n\t\tif (z - 10 >= 0) {\n\t\t\tb[w] = c[z - 10];//映射到字母\n\t\t}\n\t\telse {\n\t\t\tb[w] = z+48;//char b[]需要0的字符，‘0’对应48\n\t\t}\n\t\tn/=B;\n\t\tw++;\n\t}\n\tb[w] = '0';\n\treturn w;//求出位数\n}\n\nbool judge(int w)//利用位数来判断\n{\n\tfor (int i = 0; i <= w / 2; i++) {\n\t\tif (b[i] != b[w - 1 - i]) {\n\t\t\treturn false;\n\t\t}\n\t\telse {\n\t\t\treturn true;\n\t\t}\n\t}\n}\n\nint main()\n{\n\tint B;\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tif(judge(trans(i*i,B,b))){\n\t\t\tint x = trans(i, B, a);\n\t\t\tfor (int j = x - 1; j >= 0;j--) {//调成原数的输出顺序\n\t\t\t\tcout << a[j];\n\t\t\t}\n\t\t\tcout << \"" \"" << b;\n\t\t}\n\t}\n\treturn 0;\n}",WRONG_ANSWER,45,512
1277918156784336896,a622fad370c5d0d44359250bfc6de3881f212d9c66a4933009e89483895cb97c,2020-06-30 18:53:25,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <string>\nusing namespace std;\n\n\n\n\n//int ishuiwen(int k)\n//{\n//    int a[10],i=0,j;\n//    while (k>0){\n//        a[i]=k%10;\n//        k/=10;\n//        i++;\n//    }\n//    for (j=0; j<i; j++){\n//        if (a[j]!=a[i-j-1])\n//            return 0;\n//    }\n//    return 1;\n//}\nstring Change(int Number,int R)\n{\n  string remain=\""\"";\n  int temp;\n  do {\n   temp = Number%R;\n   Number /= R;\n   if (temp >= 10)\n       remain += temp - 10 + 'A';\n   else remain += temp + '0';\n  } while (Number);\n  reverse(remain.begin(),remain.end());\n  return remain;\n}\nint ishuiwen(string s){\n    int k = s.size() -1;\n    for(int i = 0,j = k;i<=j;i++,j--){\n        if(s[i]!=s[j]){\n            return 0;\n        }\n    }\n    return 1;\n}\n\n\n\n\nint main()\n{\n    int B;\n    cin >> B;\n    for(int i = 1;i<=300;i++){\n        if(ishuiwen(Change(i*i,B))){\n            cout <<i<<\"" \"" <<Change(i*i,B)<<endl;\n        }\n    }\n\n    return 0;\n}",PARTIAL_ACCEPTED,41,412
1277918248018829312,4be75d8115b6c47132d131369bdafc8b7ddb12eca0694e54220169517cb1c367,2020-06-30 18:53:47,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<vector>\nusing namespace std;\nchar a[20], b[20];\nchar c[10] = { 'A','B','C','D','E','F','G','H','I','J' };//用A到J来定义10到19\nint trans(int n,int B,char b[])\n{\n\tint w = 0, z;\n\t\n\twhile (n != 0) {    \n\t\tz = n % B;//这个映射是反序的！回文数倒过来一样，原数需要调整\n\t\tif (z - 10 >= 0) {\n\t\t\tb[w] = c[z - 10];//映射到字母\n\t\t}\n\t\telse {\n\t\t\tb[w] = z+48;//char b[]需要0的字符，‘0’对应48\n\t\t}\n\t\tn/=B;\n\t\tw++;\n\t}\n\tb[w] = '0';\n\treturn w;//求出位数\n}\n\nbool judge(int w)//利用位数来判断\n{\n\tfor (int i = 0; i <= w / 2; i++) {\n\t\tif (b[i] != b[w - 1 - i]) {\n\t\t\treturn false;\n\t\t}\n    }\n\t\t\treturn true;\n}\n\nint main()\n{\n\tint B;\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tif(judge(trans(i*i,B,b))){\n\t\t\tint x = trans(i, B, a);\n\t\t\tfor (int j = x - 1; j >= 0;j--) {//调成原数的输出顺序\n\t\t\t\tcout << a[j];\n\t\t\t}\n\t\t\tcout << \"" \"" << b;\n\t\t}\n\t}\n\treturn 0;\n}",WRONG_ANSWER,26,424
1277918699426611200,a622fad370c5d0d44359250bfc6de3881f212d9c66a4933009e89483895cb97c,2020-06-30 18:55:35,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <string>\nusing namespace std;\n\n\n\n\n//int ishuiwen(int k)\n//{\n//    int a[10],i=0,j;\n//    while (k>0){\n//        a[i]=k%10;\n//        k/=10;\n//        i++;\n//    }\n//    for (j=0; j<i; j++){\n//        if (a[j]!=a[i-j-1])\n//            return 0;\n//    }\n//    return 1;\n//}\nstring Change(int Number,int R)\n{\n  string remain=\""\"";\n  int temp;\n  do {\n   temp = Number%R;\n   Number /= R;\n   if (temp >= 10)\n       remain += temp - 10 + 'A';\n   else remain += temp + '0';\n  } while (Number);\n  reverse(remain.begin(),remain.end());\n  return remain;\n}\nint ishuiwen(string s){\n    int k = s.size() -1;\n    for(int i = 0,j = k;i<=j;i++,j--){\n        if(s[i]!=s[j]){\n            return 0;\n        }\n    }\n    return 1;\n}\n\n\n\n\nint main()\n{\n    int B;\n    cin >> B;\n    for(int i = 1;i<=300;i++){\n        if(ishuiwen(Change(i*i,B))){\n            cout <<Change(i,B)<<\"" \"" <<Change(i*i,B)<<endl;\n        }\n    }\n\n    return 0;\n}\n",ACCEPTED,40,424
1277918810185596928,4be75d8115b6c47132d131369bdafc8b7ddb12eca0694e54220169517cb1c367,2020-06-30 18:56:01,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<vector>\nusing namespace std;\nchar a[20], b[20];\nchar c[10] = { 'A','B','C','D','E','F','G','H','I','J' };//用A到J来定义10到19\nint trans(int n,int B,char b[])\n{\n\tint w = 0, z;\n\t\n\twhile (n != 0) {    \n\t\tz = n % B;//这个映射是反序的！回文数倒过来一样，原数需要调整\n\t\tif (z - 10 >= 0) {\n\t\t\tb[w] = c[z - 10];//映射到字母\n\t\t}\n\t\telse {\n\t\t\tb[w] = z+48;//char b[]需要0的字符，‘0’对应48\n\t\t}\n\t\tn/=B;\n\t\tw++;\n\t}\n\tb[w] = '0';\n\treturn w;//求出位数\n}\n\nbool judge(int w)//利用位数来判断\n{\n\tfor (int i = 0; i <= w / 2; i++) {\n\t\tif (b[i] != b[w - 1 - i]) {\n\t\t\treturn false;\n\t\t}\n    }\n\t\t\treturn true;\n}\n\nint main()\n{\n\tint B;\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tif(judge(trans(i*i,B,b))){\n\t\t\tint x = trans(i, B, a);\n\t\t\tfor (int j = x - 1; j >= 0;j--) {//调成原数的输出顺序\n\t\t\t\tcout << a[j];\n\t\t\t}\n\t\t\tcout << \"" \"" << b<<endl;\n\t\t}\n\t}\n\treturn 0;\n}",WRONG_ANSWER,40,512
1277919120048185344,ad8686712a9999dbe03ced4f0edcc6d1ec90b29a12065ac79e4414d28f7d7af6,2020-06-30 18:57:15,Python,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"def transB(number,b):\n    numB = []\n    while (number!=0):\n        numB.append(number%b)\n        number  = number//b\n    return numB\n\ntimesB = 0\ntimesN = 0\n\nN = int(input())\nS = int(input())\n\nwhile (timesN<N):\n    S +=1\n    for B in range(2,11):\n        numB = transB(S,B)\n        reverB = numB[::-1]\n        if (numB == reverB):\n            timesB +=1\n        if timesB>=2:\n            timesN += 1\n            print(S)\n            break\n    timesB = 0\nexit(0)\n",NON_ZERO_EXIT_CODE,160,2984
1277919485128802304,ad8686712a9999dbe03ced4f0edcc6d1ec90b29a12065ac79e4414d28f7d7af6,2020-06-30 18:58:42,Python,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"def transB(number,b):\n    numB = []\n    while (number!=0):\n        numB.append(number%b)\n        number  = number//b\n    return numB\n\ntimesB = 0\ntimesN = 0\n\nN = int(input())\nS = int(input())\n\nwhile (timesN<N):\n    S += 1\n    for B in range(2,11):\n        numB = transB(S,B)\n        reverB = numB[::-1]\n        if (numB == reverB):\n            timesB +=1\n        if timesB>=2:\n            timesN += 1\n            print(S)\n            break\n    timesB = 0\nexit(0)\n",NON_ZERO_EXIT_CODE,142,3112
1277919996305408000,ad8686712a9999dbe03ced4f0edcc6d1ec90b29a12065ac79e4414d28f7d7af6,2020-06-30 19:00:44,C++,50.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <cmath>\n\nusing namespace std;\nint transB(int num, int b);\nint reverse(int number);\n\nint main() {\n\tint N{ 0 }, S{ 0 };\n\tcin >> N >> S;\n\tint timesN = 0;\n\tint timesB = 0;\n\tS += 1;\n\twhile (timesN<N)\n\t{\n\t\tfor (int i{ 2 };i <= 10;i++) {\n\t\t\tint tranB = transB(S, i);\n\t\t\tint reverB = reverse(tranB);\n\t\t\tif (tranB == reverB)\n\t\t\t\ttimesB += 1;\n\t\t\tif (timesB >= 2) {\n\t\t\t\tcout << S << endl;\n\t\t\t\ttimesN += 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\ttimesB = 0;\n\t\t++S;\n\t\t\n\t}\n}\n\nint transB(int num, int b) {\n\tvector<int> numList;\n\tdo {\n\t\tnumList.push_back(num % b);\n\t\tnum /= b;\n\t} while (num != 0);\n\tint number = 0;\n\tfor (int i{ 0 };i < numList.size();i++) {\n\t\tnumber += numList[i] * pow(10, i);\n\t}\n\treturn number;\n}\n\nint reverse(int number) {\n\tint rever{ 0 };\n\twhile (number > 0)\n\t{\n\t\trever = rever * 10 + number % 10;\n\t\tnumber = number / 10;\n\t}\n\treturn rever;\n}",PARTIAL_ACCEPTED,63,424
1277920066903924736,f31082d427a93a58b9a4029d36bf21b049ab69fed573c687789cf8faaa7d93ba,2020-06-30 19:01:01,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <math.h>\n#include <string>\nusing namespace std;\nint array1[300];\nint array2[300];\nint array3[300];\nvector<int> vect1;\nvector<int> vect2;\nvector<int> vect3;\nint main()\n{\n    int temp1,temp2,B;\n    cin>>B;\n    for(int i = 1; i<=300; i++){\n\n        temp1 = i/B;\n        temp2 = i%B;\n        vect1.push_back(temp2);\n        if(temp1!=0){\n            while(temp1!=0){\n\n                temp2 = temp1%B;\n                vect1.push_back(temp2);\n                temp1 = temp1/B;\n            }\n        }\n\n\n        int sum = 0;\n        for(unsigned long long j = 0; j < vect1.size(); j++){\n            sum += vect1[j]*pow(10,j);\n\n        }\n        array1[i-1] = sum;\n        vect1.clear();\n    }\n    for(unsigned long long i = 0; i < sizeof(array1)/sizeof (int); i++){\n        array2[i] = pow(array1[i],2);\n    }\n\n    for(unsigned long long i = 0; i < sizeof(array2)/sizeof(int); i++){\n        int reverse = 0, remain = array2[i];\n        while(remain>0){\n        reverse = reverse*10 + remain%10;\n        remain = remain/10;}\n        if(reverse==array2[i]){\n            cout<<array1[i]<<\"" \""<<array2[i]<<endl;\n        }\n    }\n\n    return 0;\n}",PARTIAL_ACCEPTED,40,512
1277920404285349888,4be75d8115b6c47132d131369bdafc8b7ddb12eca0694e54220169517cb1c367,2020-06-30 19:02:21,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<vector>\nusing namespace std;\nchar a[20], b[20];\nchar c[10] = { 'A','B','C','D','E','F','G','H','I','J' };//用A到J来定义10到19\nint trans(int n,int B,char b[])\n{\n\tint w = 0, z;\n\t\n\twhile (n != 0) {    \n\t\tz = n % B;//这个映射是反序的！回文数倒过来一样，原数需要调整\n\t\tif (z - 10 >= 0) {\n\t\t\tb[w] = c[z - 10];//映射到字母\n\t\t}\n\t\telse {\n\t\t\tb[w] = z+48;//char b[]需要0的字符，‘0’对应48\n\t\t}\n\t\tn/=B;\n\t\tw++;\n\t}\n\tb[w] = '\\0';\n\treturn w;//求出位数\n}\n\nbool judge(int w)//利用位数来判断\n{\n\tfor (int i = 0; i <= w / 2; i++) {\n\t\tif (b[i] != b[w - 1 - i]) {\n\t\t\treturn false;\n\t\t}\n    }\n\t\t\treturn true;\n}\n\nint main()\n{\n\tint B;\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tif(judge(trans(i*i,B,b))){\n\t\t\tint x = trans(i, B, a);\n\t\t\tfor (int j = x - 1; j >= 0;j--) {//调成原数的输出顺序\n\t\t\t\tcout << a[j];\n\t\t\t}\n\t\t\tcout << \"" \"" << b<<endl;\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,40,516
1277920788143865856,9ee817591b0a074b9c9c9b4b25315f18eb72bbe102d00a51fe4ea5381fc17bf4,2020-06-30 19:03:53,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nchar Array[10]{'0','1','2','3','4','5','6','7','8','9'};\nstring func1(int Num,int J){//转化为J进制数\n    string After;\n    while(Num){\n        int temp = Num%J;\n        char tempNum = Array[temp];\n        After.push_back(tempNum);\n        Num = Num/J;\n    }\n    return After;\n}\n\nint func2(string s){//判断是否为回文数\n    int Judge = 0;\n    for(int i = 0;i<s.size();i++){\n       if(s[i]==s[s.size()-1-i])\n           Judge = 1;\n       else{\n           Judge = 0;\n           break;\n       }\n    }\n    return Judge;\n}\nint main(){\n    int N,S;\n    cin>>N;\n    cin>>S;\n    int Amount{0};\n    for(int i=S+1;;i++){\n        int iCount{0};\n        for(int J=2;J<11;J++){\n            string After = func1(i,J);\n            if(func2(After)){\n                iCount++;\n            }\n        }\n        if(iCount>=2){\n            cout<<i<<endl;\n            Amount++;\n        }\n        if(Amount==N)\n            break;\n    }\n    return 0;\n}\n\n\n\n\n\n\n\n\n\n\n",ACCEPTED,31,492
1277921577323134976,a622fad370c5d0d44359250bfc6de3881f212d9c66a4933009e89483895cb97c,2020-06-30 19:07:01,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\n\nusing namespace std;\nstring Change(int Number,int R)\n{\n  string remain=\""\"";\n  int temp;\n  do {\n   temp = Number%R;\n   Number /= R;\n   if (temp >= 10)\n       remain += temp - 10 + 'A';\n   else remain += temp + '0';\n  } while (Number);\n  reverse(remain.begin(),remain.end());\n  return remain;\n}\nint ishuiwen(string s){\n    int k = s.size() -1;\n    for(int i = 0,j = k;i<=j;i++,j--){\n        if(s[i]!=s[j]){\n            return 0;\n        }\n    }\n    return 1;\n}\n\nint main()\n{\n    int N,S;\n    cin >> N >> S;\n    int count=0;\n    int count1 =0;\n    for(int i =S+1;;i++){\n        for(int j = 2;j<=10;j++){\n            if(ishuiwen(Change(i,j))){\n                count++;\n            }\n            if(count==2){\n                cout<<i<<endl;\n                count=0;\n                count1++;\n            }\n        }\n        if(count1==N){\n            break;\n        }\n\n}\n    return 0;\n}",MULTIPLE_ERROR,30,384
1277923437887029248,539cb65160a7009fec6386fb40555fc03abd87cda9efad94c2441feaf9ca5a23,2020-06-30 19:14:24,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nint isPali(int a){\n    int m,n=0;\n    m = a;\n    while(m){\n        n = n*10+m%10;\n        m /= 10;\n    }\n    if (a==n)\n        return 1;\n    else\n        return 0;\n}\n\nint tran(int a){\n    int m,n=0;\n    m = a;\n    while(m){\n        n = n*10+m%2;\n        m /= 2;\n    }\n    return n;\n}\n\nint N,S;\n\nint main(){\n    cin >> N >> S;\n\n    int n = N;\n    int s = S+1;\n    while(n){\n        if ((isPali(s))&&(isPali(tran(s)))){\n            cout << s << endl;\n            n--;\n        }\n        s++;\n    }\n}\n",PARTIAL_ACCEPTED,22,508
1277923604015013888,539cb65160a7009fec6386fb40555fc03abd87cda9efad94c2441feaf9ca5a23,2020-06-30 19:15:04,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nint isPali(int a){\n    int m,n=0;\n    m = a;\n    while(m){\n        n = n*10+m%10;\n        m /= 10;\n    }\n    if (a==n)\n        return 1;\n    else\n        return 0;\n}\n\nint tran(int a){\n    int m,n=0;\n    m = a;\n    while(m){\n        n = n*10+m%2;\n        m /= 2;\n    }\n    return n;\n}\n\nint N,S;\n\nint main(){\n    cin >> N >> S;\n\n    int n = N;\n    int s = S+1;\n    while(n){\n        if ((isPali(s))&&(isPali(tran(s)))){\n            cout << s << endl;\n            n--;\n        }\n        s++;\n    }\n}\n",PARTIAL_ACCEPTED,24,424
1277923710474838016,539cb65160a7009fec6386fb40555fc03abd87cda9efad94c2441feaf9ca5a23,2020-06-30 19:15:29,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nint isPali(int a){\n    int m,n=0;\n    m = a;\n    while(m){\n        n = n*10+m%10;\n        m /= 10;\n    }\n    if (a==n)\n        return 1;\n    else\n        return 0;\n}\n\nint tran(int a){\n    int m,n=0;\n    m = a;\n    while(m){\n        n = n*10+m%2;\n        m /= 2;\n    }\n    return n;\n}\n\nint N,S;\n\nint main(){\n    cin >> N >> S;\n\n    int n = N;\n    int s = S+1;\n    while(n){\n        if ((isPali(s))&&(isPali(tran(s)))){\n            cout << s << endl;\n            n--;\n        }\n        s++;\n    }\n}\n",PARTIAL_ACCEPTED,27,512
1277923795921199104,539cb65160a7009fec6386fb40555fc03abd87cda9efad94c2441feaf9ca5a23,2020-06-30 19:15:50,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<cstdio>\n#include<cstring>\n#include<algorithm>\n#include<iostream>\nusing namespace std;\n\nlong long int B,j;\nchar a[19],b[19];\n\nvoid tran1(int x)\n{\n    int m,k=0;\n    while(x)\n    {\n        m=x%B;\n        x/=B;\n        if(m>=10)\n            a[k++]=m+'A'-10;\n        else\n            a[k++]=m+'0';\n    }\n}\n\nvoid tran2(int y)\n{\n    int n,c=0;\n    while(y)\n    {\n        n=y%B;\n        y/=B;\n        if(n>=10)\n            b[c++]=n+'A'-10;\n        else\n            b[c++]=n+'0';\n    }\n}\n\nint comp()\n{\n    int i,j,flag=0;\n    int l=strlen(b);\n    for(i=0,j=l-1; i<j; i++,j--)\n    {\n        if(b[i]!=b[j])\n        {\n            flag=1;\n            break;\n        }\n    }\n    if(!flag)\n        return 1;\n    else\n        return 0;\n}\n\nint main()\n{\n    scanf(\""%lld\"",&B);\n    memset(a,0,sizeof(a));\n    memset(b,0,sizeof(b));\n    for(int i=1;i<=300;i++)\n    {\n        j=i*i;\n        tran1(i);\n        tran2(j);\n        if(comp())\n        {\n            int len=strlen(a);\n            for(int ii=len-1;ii>=0;ii--)\n                printf(\""%c\"",a[ii]);\n            printf(\"" \"");\n            puts(b);\n        }\n    }\n    return 0;\n}\n",ACCEPTED,43,424
1277923821179297792,a622fad370c5d0d44359250bfc6de3881f212d9c66a4933009e89483895cb97c,2020-06-30 19:15:56,C++,20.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\n\nusing namespace std;\nstring Change(int Number,int R)\n{\n  string remain=\""\"";\n  int temp;\n  do {\n   temp = Number%R;\n   Number /= R;\n   if (temp >= 10)\n       remain += temp - 10 + 'A';\n   else remain += temp + '0';\n  } while (Number);\n  reverse(remain.begin(),remain.end());\n  return remain;\n}\nint ishuiwen(string s){\n    int k = s.size() -1;\n    for(int i = 0,j = k;i<=j;i++,j--){\n        if(s[i]!=s[j]){\n            return 0;\n        }\n    }\n    return 1;\n}\n\nint main()\n{\n    int N,S;\n    cin >> N >> S;\n    int count=0;\n    int count1 =0;\n    for(int i =S+1;;i++){\n        for(int j = 2;j<=10;j++){\n            if(ishuiwen(Change(i,j))){\n                count++;\n            }\n            if(count==2){\n                cout<<i<<endl;\n                count=0;\n                count1++;\n                break;\n            }\n        }\n        if(count1==N){\n            break;\n        }\n\n}\n    return 0;\n}",PARTIAL_ACCEPTED,22,504
1277923888321716224,539cb65160a7009fec6386fb40555fc03abd87cda9efad94c2441feaf9ca5a23,2020-06-30 19:16:12,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nint isPali(int a){\n    int m,n=0;\n    m = a;\n    while(m){\n        n = n*10+m%10;\n        m /= 10;\n    }\n    if (a==n)\n        return 1;\n    else\n        return 0;\n}\n\nint tran(int a){\n    int m,n=0;\n    m = a;\n    while(m){\n        n = n*10+m%2;\n        m /= 2;\n    }\n    return n;\n}\n\nint N,S;\n\nint main(){\n    cin >> N >> S;\n\n    int n = N;\n    int s = S+1;\n    while(n){\n        if ((isPali(s))&&(isPali(tran(s)))){\n            cout << s << endl;\n            n--;\n        }\n        s++;\n    }\n}\n",PARTIAL_ACCEPTED,20,384
1277923970207121408,a622fad370c5d0d44359250bfc6de3881f212d9c66a4933009e89483895cb97c,2020-06-30 19:16:31,C++,20.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\n\nusing namespace std;\nstring Change(int Number,int R)\n{\n  string remain=\""\"";\n  int temp;\n  do {\n   temp = Number%R;\n   Number /= R;\n   if (temp >= 10)\n       remain += temp - 10 + 'A';\n   else remain += temp + '0';\n  } while (Number);\n  reverse(remain.begin(),remain.end());\n  return remain;\n}\nint ishuiwen(string s){\n    int k = s.size() -1;\n    for(int i = 0,j = k;i<=j;i++,j--){\n        if(s[i]!=s[j]){\n            return 0;\n        }\n    }\n    return 1;\n}\n\nint main()\n{\n    int N,S;\n    cin >> N >> S;\n    int count=0;\n    int count1 =0;\n    for(int i =S+1;;i++){\n        for(int j = 2;j<=10;j++){\n            if(ishuiwen(Change(i,j))){\n                count++;\n            }\n            if(count==2){\n                cout<<i<<endl;\n                count=0;\n                count1++;\n                break;\n            }\n        }\n        if(count1==N){\n            break;\n        }\n\n}\n    return 0;\n}",PARTIAL_ACCEPTED,38,512
1277924015576907776,37a97b9ec663ba47c029ffd6d3be59fb34a346ea8c94d16145d6ebac1cb9bc32,2020-06-30 19:16:42,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nint n;\nvoid result(int z)\n{\n\tint x[20];\n\tint y[20];\n\tint p=z*z;\n\tint a=0;\n\tx[++a]=p%n;\n\tp=p/n;\n\t\n\tfor(int i=1;i<=a/2;i++)\n\t{\n\t\tif(x[i]!=x[a+1-i])\n\t\t\treturn;\n\t}\n\tint q=z;\n\tint b=0;\n\ty[++b]=q%n;\n\tq=q/n;\n\tfor(int i=b;i>=1;i--)\n\t{\n\t    if(y[i]>=10) \n\t\t\tcout<<char(y[i]+55);     \n\t    else \n\t\t\tcout<<y[i];  \n\t             \n\t} \n\tcout<<\"" \"";\n\tfor(int i=a;i>=1;i--)\n\t{\n\t    if(x[i]>=10) \n\t\t\tcout<<char(x[i]+55);     \n\t    else \n\t\t\tcout<<x[i];       \n\t}\n\tcout<<endl;\n\treturn;\n}\nint main()\n{\n//\tint n;\n\tcin>>n;\n\tfor(int i=1;i<=300;i++)\n\t{\n\t\tresult(i);\n\t\t\n\t}\n\treturn 0;\n}\n\n",COMPILE_ERROR,0,0
1277924100293451776,37a97b9ec663ba47c029ffd6d3be59fb34a346ea8c94d16145d6ebac1cb9bc32,2020-06-30 19:17:02,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nint n;\nvoid result(int z)\n{\n\tint x[20];\n\tint y[20];\n\tint p=z*z;\n\tint a=0;\n\tx[++a]=p%n;\n\tp=p/n;\n\t\n\tfor(int i=1;i<=a/2;i++)\n\t{\n\t\tif(x[i]!=x[a+1-i])\n\t\t\treturn;\n\t}\n\tint q=z;\n\tint b=0;\n\ty[++b]=q%n;\n\tq=q/n;\n\tfor(int i=b;i>=1;i--)\n\t{\n\t    if(y[i]>=10) \n\t\t\tcout<<char(y[i]+55);     \n\t    else \n\t\t\tcout<<y[i];  \n\t             \n\t} \n\tcout<<\"" \"";\n\tfor(int i=a;i>=1;i--)\n\t{\n\t    if(x[i]>=10) \n\t\t\tcout<<char(x[i]+55);     \n\t    else \n\t\t\tcout<<x[i];       \n\t}\n\tcout<<endl;\n\treturn;\n}\nint main()\n{\n//\tint n;\n\tcin>>n;\n\tfor(int i=1;i<=300;i++)\n\t{\n\t\tresult(i);\n\t\t\n\t}\n\treturn 0;\n}\n\n",WRONG_ANSWER,34,432
1277924428980084736,a622fad370c5d0d44359250bfc6de3881f212d9c66a4933009e89483895cb97c,2020-06-30 19:18:21,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\n\nusing namespace std;\nstring Change(int Number,int R)\n{\n  string remain=\""\"";\n  int temp;\n  do {\n   temp = Number%R;\n   Number /= R;\n   if (temp >= 10)\n       remain += temp - 10 + 'A';\n   else remain += temp + '0';\n  } while (Number);\n  reverse(remain.begin(),remain.end());\n  return remain;\n}\nint ishuiwen(string s){\n    int k = s.size() -1;\n    for(int i = 0,j = k;i<=j;i++,j--){\n        if(s[i]!=s[j]){\n            return 0;\n        }\n    }\n    return 1;\n}\n\nint main()\n{\n    int N,S;\n    cin >> N >> S;\n    int count=0;\n    int count1 =0;\n    for(int i =S+1;;i++){\n        for(int j = 2;j<=10;j++){\n            if(ishuiwen(Change(i,j))){\n                count++;\n            }\n            if(count==3){\n                cout<<i<<endl;\n                count=0;\n                count1++;\n                break;\n            }\n        }\n        if(count1==N){\n            break;\n        }\n\n}\n    return 0;\n}",PARTIAL_ACCEPTED,31,512
1277924601781215232,a622fad370c5d0d44359250bfc6de3881f212d9c66a4933009e89483895cb97c,2020-06-30 19:19:02,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\n\nusing namespace std;\nstring Change(int Number,int R)\n{\n  string remain=\""\"";\n  int temp;\n  do {\n   temp = Number%R;\n   Number /= R;\n   if (temp >= 10)\n       remain += temp - 10 + 'A';\n   else remain += temp + '0';\n  } while (Number);\n  reverse(remain.begin(),remain.end());\n  return remain;\n}\nint ishuiwen(string s){\n    int k = s.size() -1;\n    for(int i = 0,j = k;i<=j;i++,j--){\n        if(s[i]!=s[j]){\n            return 0;\n        }\n    }\n    return 1;\n}\n\nint main()\n{\n    int N,S;\n    cin >> N >> S;\n    int count=0;\n    int count1 =0;\n    for(int i =S+1;;i++){\n        for(int j = 2;j<=10;j++){\n            if(ishuiwen(Change(i,j))){\n                count++;\n            }\n            if(count==3){\n                cout<<i<<endl;\n                count=0;\n                count1++;\n                break;\n            }\n        }\n        if(count1==N){\n            break;\n        }\n\n}\n    return 0;\n}",PARTIAL_ACCEPTED,36,512
1277925408673038336,37a97b9ec663ba47c029ffd6d3be59fb34a346ea8c94d16145d6ebac1cb9bc32,2020-06-30 19:22:14,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nint n;\nvoid result(int z)\n{\n\tint x[30];\n\tint y[30];\n\tint p=z*z;\n\tint a=0;\n\twhile(p!=0)\n\t{\n\t\tx[++a]=p%n;\n\t\tp=p/n;\n\t}\n\tfor(int i=1;i<=a/2;i++)\n\t{\n\t\tif(x[i]!=x[a+1-i])\n\t\t\treturn;\n\t}\n\tint q=z;\n\tint b=0;\n\twhile(q!=0)\n\t{\n\t\ty[++b]=q%n;\n\t\tq=q/n;\n\t}\n\tfor(int i=b;i>=1;i--)\n\t{\n\t    if(y[i]>=10) \n\t\t\tcout<<char(y[i]+55);     \n\t    else \n\t\t\tcout<<y[i];  \n\t             \n\t} \n\tcout<<\"" \"";\n\tfor(int i=a;i>=1;i--)\n\t{\n\t    if(x[i]>=10) \n\t\t\tcout<<char(x[i]+55);     \n\t    else \n\t\t\tcout<<x[i];       \n\t}\n\tcout<<endl;\n\treturn;\n}\nint main()\n{\n//\tint n;\n\tcin>>n;\n\tfor(int i=1;i<=300;i++)\n\t{\n\t\tresult(i);\n\t\t\n\t}\n\treturn 0;\n}\n\n",ACCEPTED,43,424
1277926690402000896,a622fad370c5d0d44359250bfc6de3881f212d9c66a4933009e89483895cb97c,2020-06-30 19:27:20,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\n\nusing namespace std;\nstring Change(int Number,int R)\n{\n  string remain=\""\"";\n  int temp;\n  do {\n   temp = Number%R;\n   Number /= R;\n   if (temp >= 10)\n       remain += temp - 10 + 'A';\n   else remain += temp + '0';\n  } while (Number);\n  reverse(remain.begin(),remain.end());\n  return remain;\n}\nint ishuiwen(string s){\n    int k = s.size() -1;\n    for(int i = 0,j = k;i<=j;i++,j--){\n        if(s[i]!=s[j]){\n            return 0;\n        }\n    }\n    return 1;\n}\n\nint main()\n{\n    int N,S;\n    cin >> N >> S;\n    int count=0;\n    int count1 =0;\n    for(int i =S+1;;i++){\n        for(int j = 2;j<=10;j++){\n            if(ishuiwen(Change(i,j))){\n                count++;\n            }\n            if(count>2){\n                cout<<i<<endl;\n                count=0;\n                count1++;\n                break;\n            }\n        }\n        if(count1==N){\n            break;\n        }\n\n}\n    return 0;\n}",PARTIAL_ACCEPTED,22,424
1277926790666838016,37a97b9ec663ba47c029ffd6d3be59fb34a346ea8c94d16145d6ebac1cb9bc32,2020-06-30 19:27:44,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nint n;\nvoid result(int z)\n{\n\tint x[30];\n\tint y[30];\n\tint p=z*z;\n\tint a=0;\n\twhile(p!=0)\n\t{\n\t\ta=a+1;\t\n\t\tx[a]=p%n;\n\t\tp=p/n;\n\t}\n\tfor(int i=1;i<=a/2;i++)\n\t{\n\t\tif(x[i]!=x[a+1-i])\n\t\t\treturn;\n\t}\n\tint q=z;\n\tint b=0;\n\twhile(q!=0)\n\t{\n\t\tb=b+1;\n\t\ty[b]=q%n;\n\t\tq=q/n;\n\t}\n\tfor(int i=b;i>=1;i--)\n\t{\n\t    if(y[i]>=10) \n\t\t\tcout<<char(y[i]+55);     \n\t    else \n\t\t\tcout<<y[i];  \n\t             \n\t} \n\tcout<<\"" \"";\n\tfor(int i=a;i>=1;i--)\n\t{\n\t    if(x[i]>=10) \n\t\t\tcout<<char(x[i]+55);     \n\t    else \n\t\t\tcout<<x[i];       \n\t}\n\tcout<<endl;\n\treturn;\n}\nint main()\n{\n//\tint n;\n\tcin>>n;\n\tfor(int i=1;i<=300;i++)\n\t{\n\t\tresult(i);\n\t\t\n\t}\n\treturn 0;\n}\n\n",ACCEPTED,25,440
1277928217896214528,2fcccc72f79fd645151694ebc3ee49d49e8e1011e73b1aa24dedfdf430930751,2020-06-30 19:33:24,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint a[100] = { 0 };//定义全局变量\nint len;\nvoid nc(int n, int m)//进制转换函数\n{\n\tint i = 0;\n\twhile (n)\n\t{\n\t\ta[i] = n % m;\n\t\tn = n / m;\n\t\ti++;\n\t}\n\tlen = i;\n}\nint hui()//回文判断函数\n{\n\tfor (int i = 0; i <= len / 2; i++)\n\t\tif (a[i] != a[len - i - 1])return 0;\n\treturn 1;\n}\nvoid print() //输出函数\n{ \n\tfor (int i = len-1; i >= 0; i--)\n\t{\n\t\tif (a[i] <= 9) cout << a[i];\n\t\telse cout << (char)(a[i] - 10 + 'A');\n\t}\n}\nint main()\n{\n\tint n;//题目中的B，进制数\n\tcin>>n;\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\tnc(i * i, n);\n\t\tif (hui())\n\t\t{\n\t\t\tnc(i, n);\n\t\t\tprint();\n\t\t\tcout << \"" \"";\n\t\t\tnc(i * i, n);\n\t\t\tprint();\n\t\t\tcout << endl;\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,40,512
1277928600332853248,2fcccc72f79fd645151694ebc3ee49d49e8e1011e73b1aa24dedfdf430930751,2020-06-30 19:34:55,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint a[100] = { 0 };//定义全局变量\nint len;\nvoid nc(int n, int m)//进制转换函数\n{\n\tint i = 0;\n\twhile (n)\n\t{\n\t\ta[i] = n % m;\n\t\tn = n / m;\n\t\ti++;\n\t}\n\tlen = i;//记录转换后位数\n}\nint hui()//回文判断函数\n{\n\tfor (int i = 0; i <= len / 2; i++)\n\t\tif (a[i] != a[len - i - 1])return 0;\n\treturn 1;\n}\nvoid print() //输出函数\n{ \n\tfor (int i = len-1; i >= 0; i--)\n\t{\n\t\tif (a[i] <= 9) cout << a[i];\n\t\telse cout << (char)(a[i] - 10 + 'A');\n\t}\n}\nint main()\n{\n\tint n;//题目中的B，进制数\n\tcin>>n;\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\tnc(i * i, n);\n\t\tif (hui())\n\t\t{\n\t\t\tnc(i, n);\n\t\t\tprint();\n\t\t\tcout << \"" \"";\n\t\t\tnc(i * i, n);\n\t\t\tprint();\n\t\t\tcout << endl;\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,29,512
1277928618196393984,241c134c2ed10f5738f19964f53f0184631685646a7786496285a51381cf5b77,2020-06-30 19:35:00,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n\nusing namespace std;\n\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    string jzhi(int dig, int b);\n    int hwpd(string chuan);\n    \n    int count=0,a=1,jishu;\n    string s[9];\n    while(count<N)\n    {\n        for(int i=2;i<11;i++)\n        {\n            s[i-2]=jzhi(S+a,i);\n        }\n        jishu=0;\n        for(int i=0;i<9;i++)\n        {\n            if(hwpd(s[i])) jishu++;\n        }\n        if(jishu>2)\n        {\n            count++;\n            cout<<S+a<<endl;\n        }\n        a++;\n    }\n    return 0;\n}\nstring jzhi(int dig, int b)\n{\n    string jieguo=\""\"";\n    string s=\""0123456789ABCDEFGHIJK\"";\n    while (dig!=0)\n    {\n        jieguo=s[dig%b]+jieguo;\n        dig=dig/b;\n    }\n    return jieguo;\n}\nint hwpd(string chuan)\n{\n    int n=chuan.size();\n    int cishu=0;\n    for (int i=0;i<(n/2);i++)\n    {\n        if(chuan[i]==chuan[n-i-1]) cishu++;\n    }\n    if (cishu==(n/2)) return 1;\n    else return 0;\n}",PARTIAL_ACCEPTED,112,424
1277930582552543232,241c134c2ed10f5738f19964f53f0184631685646a7786496285a51381cf5b77,2020-06-30 19:42:48,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n\nusing namespace std;\n\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    string jzhi(int dig, int b);\n    int hwpd(string chuan);\n    \n    int count=0,a=1,jishu;\n    string s[9];\n    while(count<N)\n    {\n        for(int i=2;i<11;i++)\n        {\n            s[i-2]=jzhi(S+a,i);\n        }\n        jishu=0;\n        for(int i=0;i<9;i++)\n        {\n            if(hwpd(s[i])) jishu++;\n        }\n        if(jishu>1)\n        {\n            count++;\n            cout<<S+a<<endl;\n        }\n        a++;\n    }\n    return 0;\n}\nstring jzhi(int dig, int b)\n{\n    string jieguo=\""\"";\n    string s=\""0123456789ABCDEFGHIJK\"";\n    while (dig!=0)\n    {\n        jieguo=s[dig%b]+jieguo;\n        dig=dig/b;\n    }\n    return jieguo;\n}\nint hwpd(string chuan)\n{\n    int n=chuan.size();\n    int cishu=0;\n    for (int i=0;i<(n/2);i++)\n    {\n        if(chuan[i]==chuan[n-i-1]) cishu++;\n    }\n    if (cishu==(n/2)) return 1;\n    else return 0;\n}",ACCEPTED,30,512
1277931247467167744,a622fad370c5d0d44359250bfc6de3881f212d9c66a4933009e89483895cb97c,2020-06-30 19:45:26,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\n\nusing namespace std;\n//string Change(int Number,int R)\n//{\n//  string remain=\""\"";\n//  int temp;\n//  do {\n//   temp = Number%R;\n//   Number /= R;\n//   if (temp >= 10)\n//       remain += temp - 10 + 'A';\n//   else remain += temp + '0';\n//  } while (Number);\n//  reverse(remain.begin(),remain.end());\n//  return remain;\n//}\n//int ishuiwen(string s){\n//    int k = s.size() -1;\n//    for(int i = 0,j = k;i<=j;i++,j--){\n//        if(s[i]!=s[j]){\n//            return 0;\n//        }\n//    }\n//    return 1;\n//}\nbool check(int x, int jinzhi)\n{\n    int a[10000],i = 0;\n    while (x)\n    {\n        a[++i] = x % jinzhi;\n        x /= jinzhi;\n    }\n    int t = i;\n    while (i && a[i] == a[t - i + 1])\n        i--;\n    if (i == 0)\n        return true;\n    return false;\n}\nint main()\n{\n    int N,S;\n    int number;\n    cin >> N >> S;\n    int count=0;\n    int count1 =0;\n//    for(int i =S+1;;i++){\n//        for(int j = 2;j<=10;j++){\n//            if(check(i,j)){\n//                count++;\n//            }\n//            if(count>2){\n//                cout<<i<<endl;\n//                count=0;\n//                count1++;\n//                break;\n//            }\n//        }\n//        if(count1==N){\n//            break;\n//        }\n\n//}\n    for(int i =S+1;number<N;i++){\n        int count = 0;\n        for(int j = 2;j<=10;j++){\n            if(check(i,j)){\n                count++;\n            }\n            if(count==2){\n                break;\n            }\n        }\n        if(count==2){\n            cout<< i<<endl;\n            number++;\n        }\n    }\n    return 0;\n}",MULTIPLE_ERROR,19,512
1277931306179035136,cc0d763b9b9af8282454127e1f75709799ad3393794bfd64b02be7134b1d1c88,2020-06-30 19:45:40,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n#include<string.h>\n#define MAXN 300\nint Transform(int num);\nchar b[35], a[20] = { \""0 1 2 3 4 5 6 7 8 9 A B C D E F G H I J\"" };\nint B;\nint main()\n{\n    char p[40];\n    scanf(\""%d\"", &B);\n    int i=1;\n    while(i<MAXN)\n    {\n        int r;\n        r = Transform(i * i);\n        int L = 0;\n        i++;\n        if(L <= r && b[L] == b[r])\n        {\n            L++;r--;\n        }\n        if (L > r)\n        {\n            strcpy(p, b);\n            r = Transform(i);\n            for (int j = r;j >= 0;j--)\n                printf(\""%c\"", b[j]);\n            printf(\"" %s\\n\"", p);\n        }\n    }\n    return 0;\n}\nint Transform(int num)\n{\n    int i = -1;\n    while (num > 0)\n    {\n        b[++i] = a[num % B];\n        num /= B;\n    }\n    return i;\n}\n",WRONG_ANSWER,24,384
1277931681246273536,a622fad370c5d0d44359250bfc6de3881f212d9c66a4933009e89483895cb97c,2020-06-30 19:47:10,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\n\nusing namespace std;\nbool check(int x, int jinzhi)\n{\n    int a[10000],i = 0;\n    while (x)\n    {\n        a[++i] = x % jinzhi;\n        x /= jinzhi;\n    }\n    int t = i;\n    while (i && a[i] == a[t - i + 1])\n        i--;\n    if (i == 0)\n        return true;\n    return false;\n}\nint main()\n{\n    int N,S;\n    int number;\n    cin >> N >> S;\n    int count=0;\n    int count1 =0;\n    for(int i =S+1;number<N;i++){\n        int count = 0;\n        for(int j = 2;j<=10;j++){\n            if(check(i,j)){\n                count++;\n            }\n            if(count==2){\n                break;\n            }\n        }\n        if(count==2){\n            cout<< i<<endl;\n            number++;\n        }\n    }\n    return 0;\n}",MULTIPLE_ERROR,17,424
1277931922691383296,a622fad370c5d0d44359250bfc6de3881f212d9c66a4933009e89483895cb97c,2020-06-30 19:48:07,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\n\nusing namespace std;\nbool check(int x, int jinzhi)\n{\n    int a[10000],i = 0;\n    while (x)\n    {\n        a[++i] = x % jinzhi;\n        x /= jinzhi;\n    }\n    int t = i;\n    while (i && a[i] == a[t - i + 1])\n        i--;\n    if (i == 0)\n        return true;\n    return false;\n}\nint main()\n{\n    int N,S;\n    int number;\n    cin >> N >> S;\n    int count=0;\n    int count1 =0;\n    for(int i =S+1;number<N;i++){\n        int count = 0;\n        for(int j = 2;j<=10;j++){\n            if(check(i,j)){\n                count++;\n            }\n            if(count>2){\n                break;\n            }\n        }\n        if(count>2){\n            cout<< i<<endl;\n            number++;\n        }\n    }\n    return 0;\n}",MULTIPLE_ERROR,13,376
1277932383410511872,a622fad370c5d0d44359250bfc6de3881f212d9c66a4933009e89483895cb97c,2020-06-30 19:49:57,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\n\nusing namespace std;\nstring Change(int Number,int R)\n{\n  string remain=\""\"";\n  int temp;\n  do {\n   temp = Number%R;\n   Number /= R;\n   if (temp >= 10)\n       remain += temp - 10 + 'A';\n   else remain += temp + '0';\n  } while (Number);\n  reverse(remain.begin(),remain.end());\n  return remain;\n}\nint ishuiwen(string s){\n    int k = s.size() -1;\n    for(int i = 0,j = k;i<=j;i++,j--){\n        if(s[i]!=s[j]){\n            return 0;\n        }\n    }\n    return 1;\n}\n//bool check(int x, int jinzhi)\n//{\n//    int a[10000],i = 0;\n//    while (x)\n//    {\n//        a[++i] = x % jinzhi;\n//        x /= jinzhi;\n//    }\n//    int t = i;\n//    while (i && a[i] == a[t - i + 1])\n//        i--;\n//    if (i == 0)\n//        return true;\n//    return false;\n//}\nint main()\n{\n    int N,S;\n    int number;\n    cin >> N >> S;\n    int count=0;\n    int count1 =0;\n    for(int i =S+1;;i++){\n        for(int j = 2;j<=10;j++){\n            if(ishuiwen(Change(i,j))){\n                count++;\n            }\n            if(count>2){\n                cout<<i<<endl;\n                count=0;\n                count1++;\n                break;\n            }\n        }\n        if(count1==N){\n            break;\n        }\n\n}\n//    for(int i =S+1;number<N;i++){\n//        int count = 0;\n//        for(int j = 2;j<=10;j++){\n//            if(check(i,j)){\n//                count++;\n//            }\n//            if(count==2){\n//                break;\n//            }\n//        }\n//        if(count==2){\n//            cout<< i<<endl;\n//            number++;\n//        }\n//    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,32,508
1277932543855222784,a622fad370c5d0d44359250bfc6de3881f212d9c66a4933009e89483895cb97c,2020-06-30 19:50:35,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\n\nusing namespace std;\nstring Change(int Number,int R)\n{\n  string remain=\""\"";\n  int temp;\n  do {\n   temp = Number%R;\n   Number /= R;\n   if (temp >= 10)\n       remain += temp - 10 + 'A';\n   else remain += temp + '0';\n  } while (Number);\n  reverse(remain.begin(),remain.end());\n  return remain;\n}\nint ishuiwen(string s){\n    int k = s.size() -1;\n    for(int i = 0,j = k;i<=j;i++,j--){\n        if(s[i]!=s[j]){\n            return 0;\n        }\n    }\n    return 1;\n}\n//bool check(int x, int jinzhi)\n//{\n//    int a[10000],i = 0;\n//    while (x)\n//    {\n//        a[++i] = x % jinzhi;\n//        x /= jinzhi;\n//    }\n//    int t = i;\n//    while (i && a[i] == a[t - i + 1])\n//        i--;\n//    if (i == 0)\n//        return true;\n//    return false;\n//}\nint main()\n{\n    int N,S;\n    int number;\n    cin >> N >> S;\n    int count=0;\n    int count1 =0;\n//     for(int i =S+1;;i++){\n//         for(int j = 2;j<=10;j++){\n//             if(ishuiwen(Change(i,j))){\n//                 count++;\n//             }\n//             if(count>2){\n//                 cout<<i<<endl;\n//                 count=0;\n//                 count1++;\n//                 break;\n//             }\n//         }\n//         if(count1==N){\n//             break;\n//         }\n\n// }\n   for(int i =S+1;number<N;i++){\n       int count = 0;\n       for(int j = 2;j<=10;j++){\n           if(check(i,j)){\n               count++;\n           }\n           if(count==2){\n               break;\n           }\n       }\n       if(count==N){\n           cout<< i<<endl;\n           number++;\n       }\n   }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1277932625325391872,a622fad370c5d0d44359250bfc6de3881f212d9c66a4933009e89483895cb97c,2020-06-30 19:50:55,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\n\nusing namespace std;\nstring Change(int Number,int R)\n{\n  string remain=\""\"";\n  int temp;\n  do {\n   temp = Number%R;\n   Number /= R;\n   if (temp >= 10)\n       remain += temp - 10 + 'A';\n   else remain += temp + '0';\n  } while (Number);\n  reverse(remain.begin(),remain.end());\n  return remain;\n}\nint ishuiwen(string s){\n    int k = s.size() -1;\n    for(int i = 0,j = k;i<=j;i++,j--){\n        if(s[i]!=s[j]){\n            return 0;\n        }\n    }\n    return 1;\n}\n//bool check(int x, int jinzhi)\n//{\n//    int a[10000],i = 0;\n//    while (x)\n//    {\n//        a[++i] = x % jinzhi;\n//        x /= jinzhi;\n//    }\n//    int t = i;\n//    while (i && a[i] == a[t - i + 1])\n//        i--;\n//    if (i == 0)\n//        return true;\n//    return false;\n//}\nint main()\n{\n    int N,S;\n    int number;\n    cin >> N >> S;\n    int count=0;\n    int count1 =0;\n//     for(int i =S+1;;i++){\n//         for(int j = 2;j<=10;j++){\n//             if(ishuiwen(Change(i,j))){\n//                 count++;\n//             }\n//             if(count>2){\n//                 cout<<i<<endl;\n//                 count=0;\n//                 count1++;\n//                 break;\n//             }\n//         }\n//         if(count1==N){\n//             break;\n//         }\n\n// }\n   for(int i =S+1;number<N;i++){\n       int count = 0;\n       for(int j = 2;j<=10;j++){\n           if(ishuiwen(Change(i,j))){\n               count++;\n           }\n           if(count==2){\n               break;\n           }\n       }\n       if(count==N){\n           cout<< i<<endl;\n           number++;\n       }\n   }\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,0,0
1277932914136768512,a622fad370c5d0d44359250bfc6de3881f212d9c66a4933009e89483895cb97c,2020-06-30 19:52:04,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <algorithm>\n\nusing namespace std;\n\nint n, s,num;\n\nbool check(int x, int jinzhi)\n{\n    int a[10000],i = 0;\n    while (x)\n    {\n        a[++i] = x % jinzhi;\n        x /= jinzhi;\n    }\n    int t = i;\n    while (i && a[i] == a[t - i + 1])\n        i--;\n    if (i == 0)\n        return true;\n    return false;\n}\n\nint main()\n{\n    scanf(\""%d%d\"", &n, &s);\n    for (int i = s + 1; num < n; i++)\n    {\n        int temp = 0;\n        for (int j = 2; j <= 10; j++)\n        {\n            if (check(i, j))\n                temp++;\n            if (temp == 2)\n                break;\n        }\n        if (temp == 2)\n        {\n            printf(\""%d\\n\"", i);\n            num++;\n        }\n    }\n\n    return 0;\n}\n\n",ACCEPTED,36,760
1277933032395177984,a622fad370c5d0d44359250bfc6de3881f212d9c66a4933009e89483895cb97c,2020-06-30 19:52:32,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\n\nusing namespace std;\nstring Change(int Number,int R)\n{\n  string remain=\""\"";\n  int temp;\n  do {\n   temp = Number%R;\n   Number /= R;\n   if (temp >= 10)\n       remain += temp - 10 + 'A';\n   else remain += temp + '0';\n  } while (Number);\n  reverse(remain.begin(),remain.end());\n  return remain;\n}\nint ishuiwen(string s){\n    int k = s.size() -1;\n    for(int i = 0,j = k;i<=j;i++,j--){\n        if(s[i]!=s[j]){\n            return 0;\n        }\n    }\n    return 1;\n}\n//bool check(int x, int jinzhi)\n//{\n//    int a[10000],i = 0;\n//    while (x)\n//    {\n//        a[++i] = x % jinzhi;\n//        x /= jinzhi;\n//    }\n//    int t = i;\n//    while (i && a[i] == a[t - i + 1])\n//        i--;\n//    if (i == 0)\n//        return true;\n//    return false;\n//}\nint main()\n{\n    int N,S;\n    int number;\n    cin >> N >> S;\n    int count=0;\n    int count1 =0;\n    for(int i =S+1;;i++){\n        for(int j = 2;j<=10;j++){\n            if(ishuiwen(Change(i,j))){\n                count++;\n            }\n            if(count>2){\n                cout<<i<<endl;\n                count=0;\n                count1++;\n                break;\n            }\n        }\n        if(count1==N){\n            break;\n        }\n\n}\n//    for(int i =S+1;number<N;i++){\n//        int count = 0;\n//        for(int j = 2;j<=10;j++){\n//            if(check(i,j)){\n//                count++;\n//            }\n//            if(count==2){\n//                break;\n//            }\n//        }\n//        if(count==2){\n//            cout<< i<<endl;\n//            number++;\n//        }\n//    }\n    return 0;\n}\n\n",PARTIAL_ACCEPTED,35,512
1277933315221291008,2fcccc72f79fd645151694ebc3ee49d49e8e1011e73b1aa24dedfdf430930751,2020-06-30 19:53:39,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint a[100] = { 0 };//定义全局变量\nint len;\nvoid nc(int n, int m)//进制转换函数\n{\n\tint i = 0;\n\twhile (n)\n\t{\n\t\ta[i] = n % m;\n\t\tn = n / m;\n\t\ti++;\n\t}\n\tlen = i;\n}\nint hui()//回文判断函数\n{\n\tfor (int i = 0; i <= len / 2; i++)\n\t\tif (a[i] != a[len - i - 1])return 0;\n\treturn 1;\n}\nint main()\n{\n\tint n , s;//题目中的B，进制数\n\tcin >> n >> s;\n\twhile (n)\n\t{\n\t\ts++;\n\t\tint j = 0;\n\t\tfor (int m = 2; m <= 10; m++)\n\t\t{\n\t\t\t\n\t\t\tnc(s, m);\n\t\t\tif (hui())j++;\n\t\t}\n\t\tif (j >= 2)\n\t\t{\n\t\t\tcout << s << endl; \n\t\t\tn--;\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,36,536
1277933336821948416,7255daafd88731caf36f82fc865dccfdc4dd5d7ca08a1241fdcd18788df61c07,2020-06-30 19:53:45,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,#include<iostream>\nusing namespace std;\nint a[100] = {};\nint tt = 0;\nint ans = 1;\nvoid JudgeNumber(int x) {//x是数值，y是进制数\n\tfor (int y = 2; y <= 10; y++) {\n\t\twhile (x) {\n\t\t\ta[tt++] = x % y;\n\t\t\tx = x / y;\n\t\t}\n\t\tfor (int i = 1; i <= tt; i++) {\n\t\t\tif (a[i] != a[tt + 1 - i]) {\n\t\t\t\tans = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (ans == 1) { break; }\n\t}\t\n}//判断是否为回文数\nint main() {\n\tint n;//个数\n\tint s;//大小\n\tcin >> n >> s;\n\tint count = 0;\n\tfor (int i = s + 1; count = n; i++) {\n\t\tJudgeNumber(i);\n\t\tif (ans==1) {\n\t\t\tcout << i << endl;\n\t\t\tcount++;\n\t\t}\t\n\t}\n\treturn 0;\n}\n,SEGMENTATION_FAULT,28,504
1277933757166706688,a622fad370c5d0d44359250bfc6de3881f212d9c66a4933009e89483895cb97c,2020-06-30 19:55:25,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\nusing namespace std;\nstring Change(int Number,int R)\n{\n  string remain=\""\"";\n  int temp;\n  do {\n   temp = Number%R;\n   Number /= R;\n   if (temp >= 10)\n       remain += temp - 10 + 'A';\n   else remain += temp + '0';\n  } while (Number);\n  reverse(remain.begin(),remain.end());\n  return remain;\n}\nint ishuiwen(string s){\n    int k = s.size() -1;\n    for(int i = 0,j = k;i<=j;i++,j--){\n        if(s[i]!=s[j]){\n            return 0;\n        }\n    }\n    return 1;\n}\nint main()\n{\n    int N,S;\n    int number;\n    cin >> N >> S;\n    int count=0;\n    int count1 =0;\n        for(int i =S+1;number<N;i++){\n            int count = 0;\n            for(int j = 2;j<=10;j++){\n                if(ishuiwen(Change(i,j))){\n                    count++;\n                }\n                if(count==2){\n                    break;\n                }\n            }\n            if(count==2){\n                cout<< i<<endl;\n                number++;\n            }\n        }\n    return 0;\n}\n\n\n",ACCEPTED,42,384
1277934617254887424,cc0d763b9b9af8282454127e1f75709799ad3393794bfd64b02be7134b1d1c88,2020-06-30 19:58:50,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n#include<string.h>\n#define MAXN 300\nint Transform(int num);\nchar b[35], a[20] = { \""0 1 2 3 4 5 6 7 8 9 A B C D E F G H I J\"" };\nint B;\nint main()\n{\n    char p[40];\n    scanf(\""%d\"", &B);\n    int i=1;\n    while(i<MAXN)\n    {\n        int r;\n        r = Transform(i * i);\n        int L = 0;\n        i++;\n        if(L <= r && b[L] == b[r])\n        {\n            L++;r--;\n        }\n        if (L > r)\n        {\n            strcpy(p, b);\n            r = Transform(i);\n            for (int j = r;j >= 0;j--)\n                printf(\""%c\"", b[j]);\n            printf(\"" %s\\n\"", p);\n        }\n    }\n    return 0;\n}\nint Transform(int num)\n{\n    int i = -1;\n    while (num > 0)\n    {\n        b[++i] = a[num % B];\n        num /= B;\n    }\n    return i;\n}\n",WRONG_ANSWER,20,368
1277937454047232000,539cb65160a7009fec6386fb40555fc03abd87cda9efad94c2441feaf9ca5a23,2020-06-30 20:10:06,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nint isPali(int a){\n    int m,n=0;\n    m = a;\n    while(m){\n        n = n*10+m%10;\n        m /= 10;\n    }\n    if (a==n)\n        return 1;\n    else\n        return 0;\n}\n\nint tran(int a, int b){\n    int m,n=0;\n    m = a;\n    while(m){\n        n = n*10+m%b;\n        m /= b;\n    }\n    return n;\n}\n\nint N,S;\n\nint main(){\n    /*\n    cout << isPali(121) << isPali(123) << endl;\n    cout << tran(9,2) << endl;\n    */\n\n    cin >> N >> S;\n\n    int n = N;\n    int s = S;\n    int flag;\n    while(n){\n        s++;\n        flag = 0;\n        for (int i=2; i<11; i++){\n            if (isPali(tran(s, i))){\n                flag++;\n                if (flag==2){\n                    cout << s << endl;\n                    n--;\n                    break;\n                }\n            }\n        }\n    }\n\n    return 0;\n}\n",PARTIAL_ACCEPTED,37,424
1277938218194886656,6cc42be45184b510323cc30feab3fffce71b59c9fdbb2db1c12ef96fcf25320a,2020-06-30 20:13:08,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"# include <iostream>\n# include <string>\nusing namespace std;\n\nbool huiwen(string x)\n{\n    for (int i = 0; i < x.size()/2; i ++)\n    {\n        if (x[i] != x[x.size()-1-i])\n            return false;\n    }\n    return true;\n}\n\nstring change(int q, int n)\n{\n    const string list = \""0123456789ABCDEFGHIJ\"";\n    //{'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J'};\n    string reverse;\n    string res;\n    while (n > 0)\n    {\n        reverse += list[n % q];\n        n = n / q;\n    }\n    for (int i = 0; i < reverse.size(); i++)\n    {\n        res += reverse[reverse.size() - 1 - i];\n    }\n    return res;\n}\n\nint main()\n{\n    int q;\n    cin >> q;\n    for (int i = 1; i < 300; i ++)\n    {\n        if (huiwen(change(q, i * i)))\n        {\n            cout << change(q, i) << \"" \"" << change(q, i * i) << endl;\n        }\n    }\n    return 0;\n}",ACCEPTED,35,484
1277940544796286976,6cc42be45184b510323cc30feab3fffce71b59c9fdbb2db1c12ef96fcf25320a,2020-06-30 20:22:23,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"# include <iostream>\n# include <string>\nusing namespace std;\n\nbool huiwen(string x)\n{\n    for (int i = 0; i < x.size()/2; i ++)\n    {\n        if (x[i] != x[x.size()-1-i])\n            return false;\n    }\n    return true;\n}\n\nstring change(int q, int n)\n{\n    const string list = \""0123456789\"";\n    string reverse;\n    string res;\n    while (n > 0)\n    {\n        reverse += list[n % q];\n        n = n / q;\n    }\n    for (int i = 0; i < reverse.size(); i++)\n    {\n        res += reverse[reverse.size() - 1 - i];\n    }\n    return res;\n}\n\nint main()\n{\n    int n, s;\n    cin >> n >> s;\n    while (n > 0)\n    {\n        s++;\n        int counter = 0;\n        for (int i = 2; i <= 10; i ++)\n        {\n            if(huiwen(change(i,s)))\n                counter++;\n        }\n        if (counter >=2)\n        {\n            cout << s << endl;\n            n--;\n        }\n    }\n    return 0;\n}",ACCEPTED,29,424
1277941867159674880,539cb65160a7009fec6386fb40555fc03abd87cda9efad94c2441feaf9ca5a23,2020-06-30 20:27:38,C++,50.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <math.h>\nusing namespace std;\n\nint isPali(int a){\n    int m,n=0;\n    m = a;\n    while(m){\n        n = n*10+m%10;\n        m /= 10;\n    }\n    if (a==n)\n        return 1;\n    else\n        return 0;\n}\n\nint tran(int a, int b){\n    int m,n=0,o=0;\n    m = a;\n    while(m){\n        n += (m%b)*pow(10,o);\n        m /= b;\n        o++;\n    }\n    return n;\n}\n\nint N,S;\n\nint main(){\n    /*\n    cout << isPali(121) << isPali(123) << endl;\n    cout << tran(21,2) << endl;\n    */\n\n\n    cin >> N >> S;\n\n    int n = N;\n    int s = S;\n    int flag;\n    while(n){\n        s++;\n        flag = 0;\n        for (int i=2; i<11; i++){\n            if (isPali(tran(s, i))){\n                flag++;\n                if (flag==2){\n                    cout << s << endl;\n                    n--;\n                    break;\n                }\n            }\n        }\n    }\n\n\n    return 0;\n}\n",PARTIAL_ACCEPTED,49,536
1277941928744640512,539cb65160a7009fec6386fb40555fc03abd87cda9efad94c2441feaf9ca5a23,2020-06-30 20:27:53,C++,50.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <math.h>\nusing namespace std;\n\nint isPali(int a){\n    int m,n=0;\n    m = a;\n    while(m){\n        n = n*10+m%10;\n        m /= 10;\n    }\n    if (a==n)\n        return 1;\n    else\n        return 0;\n}\n\nint tran(int a, int b){\n    int m,n=0,o=0;\n    m = a;\n    while(m){\n        n += (m%b)*pow(10,o);\n        m /= b;\n        o++;\n    }\n    return n;\n}\n\nint N,S;\n\nint main(){\n    /*\n    cout << isPali(121) << isPali(123) << endl;\n    cout << tran(21,2) << endl;\n    */\n\n\n    cin >> N >> S;\n\n    int n = N;\n    int s = S;\n    int flag;\n    while(n){\n        s++;\n        flag = 0;\n        for (int i=2; i<11; i++){\n            if (isPali(tran(s, i))){\n                flag++;\n                if (flag==2){\n                    cout << s << endl;\n                    n--;\n                    break;\n                }\n            }\n        }\n    }\n\n\n    return 0;\n}\n",PARTIAL_ACCEPTED,48,424
1277942527703834624,bbc32b3ed49ab612815ed342e7a9a82917eefb8ef54f7578f63f18a6338adb40,2020-06-30 20:30:16,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\n#include <cmath>\nusing namespace std;\n\nstring change(int number, int radix);\nbool verify(string str);\n\nint main()\n{\n    int N;\n    int S;\n    cin >> N >> S;\n    int total = 0;\n    int number = S+1;\n\n    while (total < N)\n    {\n        for (int i=2; i<=10; i++)\n        {\n            string aa = change(number,i);\n            if (i<10)\n            {\n                int j=i+1;\n                for (j; j<=10; j++)\n                {\n                    string bb = change(number,j);\n                    if (j<10)\n                    {\n                        int k = j+1;\n                        for (k; k<=10; k++)\n                        {\n                            string cc = change(number,k);\n                            if (verify(aa) && verify(bb) && verify(cc))\n                            {\n                                cout << number << endl;\n                                ++total;\n                                j = 11;\n                                i = 11;\n                                k = 11;\n                            }\n                        }\n                    }\n                }\n            }\n        }\n        ++number;\n    }\n    return 0;\n}\n\nstring change(int number, int radix)\n{\n    string oput;\n\n    if (radix == 2)\n    {\n        while (number)\n        {\n            int n = number%2;\n            number /= 2;\n            oput += to_string(n);\n        }       \n    }\n    else\n    {\n        if (number >= radix && radix != 10)\n        {\n            do\n            {\n                int n = number%radix;\n                number = number/radix;\n                oput += to_string(n);\n            }while (number != 0);\n        }\n        else\n        {\n            oput += to_string(number);\n        }\n    }\n\n    reverse(oput.begin(),oput.end());\n    return oput;\n}\n\nbool verify(string str)\n{\n    string rstr = str;\n    reverse(rstr.begin(),rstr.end());\n    if (str == rstr)\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}",PARTIAL_ACCEPTED,383,512
1277943220867104768,539cb65160a7009fec6386fb40555fc03abd87cda9efad94c2441feaf9ca5a23,2020-06-30 20:33:01,C++,50.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <math.h>\nusing namespace std;\n\nint isPali(int a){\n    int m,n=0;\n    m = a;\n    while(m){\n        n = n*10+m%10;\n        m /= 10;\n    }\n    if (a==n)\n        return 1;\n    else\n        return 0;\n}\n\nint tran(int a, int b){\n    int m,n=0,o=0;\n    m = a;\n    while(m){\n        n += (m%b)*pow(10,o);\n        m /= b;\n        o++;\n    }\n    return n;\n}\n\nint N,S;\n\nint main(){\n    /*\n    cout << isPali(121) << isPali(123) << endl;\n    cout << tran(21,2) << endl;\n    */\n\n\n    cin >> N >> S;\n\n    int n = N;\n    int s = S;\n    int flag;\n    while(n){\n        s++;\n        flag = 0;\n        for (int i=2; i<11; i++){\n            if (isPali(tran(s, i))){\n                flag++;\n                if (flag==2){\n                    cout << s << endl;\n                    n--;\n                    break;\n                }\n            }\n        }\n    }\n\n\n    return 0;\n}\n",PARTIAL_ACCEPTED,52,384
1277943749873696768,539cb65160a7009fec6386fb40555fc03abd87cda9efad94c2441feaf9ca5a23,2020-06-30 20:35:07,C++,50.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <math.h>\nusing namespace std;\n\nint isPali(int a){\n    int m,n=0;\n    m = a;\n    while(m){\n        n = n*10+m%10;\n        m /= 10;\n    }\n    if (a==n)\n        return 1;\n    else\n        return 0;\n}\n\nint tran(int a, int b){\n    int m,n=0,o=0;\n    m = a;\n    while(m){\n        n += (m%b)*pow(10,o);\n        m /= b;\n        o++;\n    }\n    return n;\n}\n\nint N,S;\n\nint main(){\n    /*\n    cout << isPali(121) << isPali(123) << endl;\n    cout << tran(21,2) << endl;\n    */\n\n\n    cin >> N >> S;\n\n    int n = N;\n    int s = S;\n    int flag;\n    while(n){\n        s++;\n        flag = 0;\n        for (int i=2; i<11; i++){\n            if (isPali(tran(s, i))){\n                flag++;\n                if (flag==2){\n                    cout << s << endl;\n                    n--;\n                    break;\n                }\n            }\n        }\n    }\n\n\n    return 0;\n}\n",PARTIAL_ACCEPTED,50,400
1277945607891648512,e39cca8043cb19013671c440a202a288f7f87c73afe6761b2bd045987b1a86c5,2020-06-30 20:42:30,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cmath>\n#include <string>\nusing namespace std;\nchar* b;\nint B, n;\nint l = 0;\nvoid change(int x) {\n    int j = 0;\n    l = 0;\n    b = new char[100];\n    while (x != 0) {\n        b[j] = x % B + '0';\n        if (b[j] > '9')\n            b[j] = b[j] - '9' + 'A' - 1;\n        x /= B;\n        j++;\n        l++;\n    }\n\n}\nbool check() {\n    int i, j;\n    change(n);\n    i = 0;\n    j = l - 1;\n    while (i < j) {\n        if (b[i] != b[j]) {\n            return false;\n        }\n        i++;\n        j--;\n    }\n    delete b;\n    return true;\n}\n\nvoid display(int q) {\n    int i;\n    change(q);\n    for (i = l - 1; i >= 0; i--)\n        cout << b[i];\n    delete b;\n \n}\n\nint main() {\n    cin >> B;\n    for (int i = 1; i <= 300; i++) {\n        n = i * i;\n        if (check()) {\n            display(i);\n            cout << \"" \"";\n            display(n);\n            cout << \""\\n\"";\n        }\n    }\n\n    return 0;\n}\n",ACCEPTED,38,512
1277945997240500224,539cb65160a7009fec6386fb40555fc03abd87cda9efad94c2441feaf9ca5a23,2020-06-30 20:44:03,C++,50.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <math.h>\nusing namespace std;\n\nint isPali(int a){\n    int m,n=0;\n    m = a;\n    while(m){\n        n = n*10+m%10;\n        m /= 10;\n    }\n    if (a==n)\n        return 1;\n    else\n        return 0;\n}\n\nint tran(int a, int b){\n    int m,n=0,o=0;\n    m = a;\n    while(m){\n        n += (m%b)*pow(10,o);\n        m /= b;\n        o++;\n    }\n    return n;\n}\n\nint N,S;\n\nint main(){\n    /*\n    cout << isPali(121) << isPali(123) << endl;\n    cout << tran(21,2) << endl;\n    */\n\n\n    cin >> N >> S;\n\n    int n = N;\n    int s = S;\n    int flag;\n    while(n){\n        s++;\n        flag = 0;\n        for (int i=2; i<11; i++){\n            if (isPali(tran(s, i))){\n                flag++;\n                if (flag==2){\n                    cout << s << endl;\n                    n--;\n                    break;\n                }\n            }\n        }\n    }\n\n\n    return 0;\n}\n",PARTIAL_ACCEPTED,47,488
1277946277776515072,84d3f6df3802889023ec532137fd38f0e8712d7d814827915d6bd789ac649761,2020-06-30 20:45:10,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nint judge(int n,int m)//判断\n{\n\tint a[100];\n\tint count = 0;\n\tint temp;\n\tchar a1[10000],b[10000],c[10000];\n\twhile(n!=0)\n\t{\n\t\ttemp = n%m;\n\t\tn=n/m;\n\t\ta[count]=temp;\n\t\tcount++;\n\t}\n\tfor(int j=0,i=count-1;i>=0,j<count;i--,j++)\n\t{\n\t\tif(a[i]>=10)\n\t\t{\n\t\t\ta1[i]=char(a[i]+55);\n\t\t}\n\t\t\t\n\t\telse a1[i]=char(a[i]+48);\n\t}\n\t\n\tfor(int j=0,i=count-1;i>=0,j<count;i--,j++)\n\t{\n\t\tif(\ta1[j]!=a1[i]) return 0;\n\t}\n\treturn 1;\n }\n void trans(int n,int m)//进制转化 \n{\n\tint a[100];\n\tint count = 0;\n\tint temp;\n\twhile(n!=0)\n\t{\n\t\ttemp = n%m;\n\t\tn=n/m;\n\t\ta[count++]=temp;\n\t}\n\tfor(int i=count-1;i>=0;i--)\n\t{\n\t\tif(a[i]>=10)\n\t\t{\n\t\t\tcout<<char(a[i]+55);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tcout<<a[i];\n\t\t}\n\t}\n }  \nint main()\n{\n\tint B;\n\tstring st;\n\tcin>>B;\n\tfor(int i=1;i<=300;i++)\n\t{\n\t\tif(judge(i*i,B)==1) \n\t\t{\n\t\t\ttrans(i,B);\n\t\t\tcout<<\"" \"";\n\t\t\ttrans(i*i,B);\n\t\t\tcout<<endl;\n\t\t}\t\t\n\t}\n\treturn 0;\n}\n",ACCEPTED,35,532
1277946469879840768,f88c5185ca459440ead088a482f524842b359c6d35732fcd5f6a39a7eeb788f2,2020-06-30 20:45:56,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<stdio.h>\n\nint judge(int num,int jinzhi){\n    int p = 0,array[1005];\n    while (num!=0){\n        array[++p] = num % jinzhi;\n        num /= jinzhi;\n    }\n    int j = p;\n    for (int i=1;i<=p/2;i++,j--){\n        if(array[i]!=array[j]){\n            return 0;\n        }\n    }\n    return 1;\n}\n\nint main(){\n    int N,S;\n    scanf(\""%d %d\"",&N,&S);\n    int sum = 0;\n    for (int i=S+1;sum<N;i++){\n            int count=0;\n            for(int j=2;j<=10;j++)\n                if (judge(i,j)==1){\n                    ++count;\n                }\n            if(count>=2){\n                ++sum;\n                printf(\""%d\\n\"",i);\n            }\n    }\n    return 0;\n}\n",ACCEPTED,18,384
1277947209423708160,539cb65160a7009fec6386fb40555fc03abd87cda9efad94c2441feaf9ca5a23,2020-06-30 20:48:52,C++,50.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <math.h>\nusing namespace std;\n\nint isPali(int a){      //回文数\n    int m,n=0;\n    m = a;\n    while(m){\n        n = n*10+m%10;\n        m /= 10;\n    }\n    if (a==n)\n        return 1;\n    else\n        return 0;\n}\n\nint tran(int a, int b){     //a转b进制\n    int m,n=0,o=0;\n    m = a;\n    while(m){\n        n += (m%b)*pow(10,o);\n        m /= b;\n        o++;\n    }\n    return n;\n}\n\nint N,S;\n\nint main(){\n    /*\n    cout << isPali(114411) << isPali(123) << endl;\n    cout << tran(21,2) << endl;\n    */\n\n\n    cin >> N >> S;\n\n    int n = N;\n    int s = S;\n    int flag;\n    while(n){\n        s++;\n        flag = 0;\n        for (int i=2; i<11; i++){\n            if (isPali(tran(s, i)))\n                flag++;\n            }\n        if (flag>=2){\n            cout << s << endl;\n            n--;\n        }\n    }\n\n\n    return 0;\n}\n",PARTIAL_ACCEPTED,46,452
1277948805889056768,2e47392c98b789d288205dd61ea858df575c09a10732db5e6582d8ff8b64b68f,2020-06-30 20:55:13,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nstring trans(int n, int radix);\nint main()\n{\n    int rad;\n    string num1, num2;\n    cin >> rad;\n    for (int i = 1; i <= 300; i++)\n    {\n\n        num1 = num2 = trans(i * i, rad);\n        reverse(num2.begin(), num2.end());\n        if (num1 == num2)\n        {\n            cout << trans(i, rad) << ' ' << num1 << endl;\n        }\n    }\n    return 0;\n}\nstring trans(int n, int radix)\n{\n    string str = \""\"";\n    do\n    {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\n            str += t + '0';\n        else\n            str += t - 10 + 'A';\n        n /= radix;\n    } while (n != 0);\n    reverse(str.begin(), str.end());\n    return str;\n}\n",ACCEPTED,40,472
1277949709216317440,e39cca8043cb19013671c440a202a288f7f87c73afe6761b2bd045987b1a86c5,2020-06-30 20:58:48,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <cmath>\n#include <string>\nusing namespace std;\nchar* b;\nint N,S;\nint l = 0;\nvoid change(int x,int B) {\n    int j = 0;\n    l = 0;\n    b = new char[100];\n    while (x != 0) {\n        b[j] = x % B + '0';\n        if (b[j] > '9')\n            b[j] = b[j] - '9' + 'A' - 1;\n        x /= B;\n        j++;\n        l++;\n    }\n\n}\nbool check(int n,int B) {\n    int i, j;\n    change(n,B);\n    i = 0;\n    j = l - 1;\n    while (i < j) {\n        if (b[i] != b[j]) {\n            return false;\n        }\n        i++;\n        j--;\n    }\n    delete b;\n    return true;\n}\n\nint main() {\n    int k = 0, h = 0,n;\n    cin >> N >> S;\n    n = S + 1;\n    while (k < N)\n    {\n        for (int j = 2; j <= 10; j++)\n        {\n            memset(b, 0, sizeof(0));\n            change(n, j);\n            if (check(n,j) == 1)\n                h++;\n        }\n        if (h > 1)\n        {\n            cout << n;\n            k++;\n        }\n        n++;\n    }\n   \n    \n\n    return 0;\n}\n\n",COMPILE_ERROR,0,0
1277949868721504256,e39cca8043cb19013671c440a202a288f7f87c73afe6761b2bd045987b1a86c5,2020-06-30 20:59:26,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <cmath>\n#include <cstring>\nusing namespace std;\nchar* b;\nint N,S;\nint l = 0;\nvoid change(int x,int B) {\n    int j = 0;\n    l = 0;\n    b = new char[100];\n    while (x != 0) {\n        b[j] = x % B + '0';\n        if (b[j] > '9')\n            b[j] = b[j] - '9' + 'A' - 1;\n        x /= B;\n        j++;\n        l++;\n    }\n\n}\nbool check(int n,int B) {\n    int i, j;\n    change(n,B);\n    i = 0;\n    j = l - 1;\n    while (i < j) {\n        if (b[i] != b[j]) {\n            return false;\n        }\n        i++;\n        j--;\n    }\n    delete b;\n    return true;\n}\n\nint main() {\n    int k = 0, h = 0,n;\n    cin >> N >> S;\n    n = S + 1;\n    while (k < N)\n    {\n        for (int j = 2; j <= 10; j++)\n        {\n            memset(b, 0, sizeof(0));\n            change(n, j);\n            if (check(n,j) == 1)\n                h++;\n        }\n        if (h > 1)\n        {\n            cout << n;\n            k++;\n        }\n        n++;\n    }\n   \n    \n\n    return 0;\n}\n\n",SEGMENTATION_FAULT,28,384
1277951610611752960,539cb65160a7009fec6386fb40555fc03abd87cda9efad94c2441feaf9ca5a23,2020-06-30 21:06:21,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <math.h>\nusing namespace std;\n\nint isPali(long long a){      //回文数\n    long long m,n=0;\n    m = a;\n    while(m){\n        n = n*10+m%10;\n        m /= 10;\n    }\n    if (a==n)\n        return 1;\n    else\n        return 0;\n}\n\nlong long tran(int a, int b){     //a转b进制\n    int m,o=0;\n    long long n = 0;\n    m = a;\n    while(m){\n        n += (m%b)*pow(10,o);\n        m /= b;\n        o++;\n    }\n    return n;\n}\n\nint N,S;\n\nint main(){\n    /*\n    cout << isPali(114411) << isPali(123) << endl;\n    cout << tran(11253,2) << endl;\n    */\n    /*\n    for (int i=2; i<11; i++){\n        cout << tran(11253,i) << \"" \"" << isPali(tran(11253,i)) << endl;\n    }\n    */\n\n    cin >> N >> S;\n\n    int n = N;\n    int s = S;\n    int flag;\n    while(n){\n        s++;\n        flag = 0;\n        for (int i=2; i<11; i++){\n            if (isPali(tran(s, i)))\n                flag++;\n            }\n        //cout << s << \"" \"" << flag << endl;\n        if (flag>=2){\n            cout << s << endl;\n            n--;\n        }\n    }\n\n\n    return 0;\n}\n",ACCEPTED,46,440
1277954011834023936,dbdee02c4509ab7a1fd578907c2d4a0dc00c446ff84739560caf0298cf21d497,2020-06-30 21:15:54,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>//转进制的题目\n#include<algorithm>\n#include<stdlib.h>\n#include<stdio.h>\n#include<cstring>\nusing namespace std;\nchar a[1000],b[10000];\nvoid change1(int i,int B);\nvoid change2(long ii,int B);\nbool palin();\n\nint main()\n{\n\nint B;\ncin>>B;\nfor(int i=1;i<=300;i++)\n{\nlong ii=i*i;\nchange1(i,B);\nchange2(ii,B);\nif(palin())\n{\nint lena=strlen(a);\nfor(int m=(lena-1);m>=0;m--)\n{\ncout<<a[m];\n}\ncout<<\"" \"";\nint lenb=strlen(b);\nfor(int m=(lenb-1);m>=0;m--)\n{\ncout<<b[m];\n}\ncout<<endl;\n\n}\n}\n}\nvoid change1(int i,int B)\n{int x=0;int c;\nwhile (i) {\n\nc=i%B;\ni=i/B;\nif(c>=10)\na[x]=(c+'A'-10);\nelse\na[x]=c+'0';//存字符类型数字 不然那就是ASCII吗啦!!!!!!\nx++;\n}\n\n}\nvoid change2(long ii,int B)\n{int x=0;int c;\nwhile (ii) {\n\nc=ii%B;\nii=ii/B;\nif(c>=10)\nb[x]=(c+'A'-10);\nelse\nb[x]=c+'0';\nx++;\n\n}}\nbool palin()\n{\nint len=strlen(b);\nint j,k;\nfor(j=0,k=(len-1);j<=k;j++,k--)\n{\nif(b[j]!=b[k])\n    return 0;\n}\nreturn 1;\n}",ACCEPTED,45,424
1277954647795359744,a870a79d2df669b7f87342f8f7ec6274f70032997550fa9fe07a832f5874704b,2020-06-30 21:18:25,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nchar NUM[10]={'0','1','2','3','4','5','6','7','8','9'};\nchar num1[100];\nint B,N,S,i,j,point,suTime;\nint main()\n{cin>>N>>S;\n  bool tf(int a);\n  bool suitable(int a);\n  j=S+1;point=0;\n   while(point!=N)\n   {  if(suitable(j)) {point++;cout<<j<<endl;}\n       j++;\n   }\n   return 0;\n\t  }\n    bool tf(int a)\n{  i=0;\n   while(a>0){\n\t num1[i]=NUM[a%B];\n\t a=a/B;\n\t i++;\n }\n for(int m=0;m<i;m++){\n\t if(num1[m]!=num1[i-m-1]) return 0;\n }\n return 1;\n }\n\n  bool suitable(int a)\n  {   suTime=0;\n\t  for(B=2;B<11;B++){\n\t\t  if(bool(a)) suTime++;\n\t  }\n\t  if(suTime>=2) return 1;\n\t  else return 0;\n  }",PARTIAL_ACCEPTED,23,508
1277955120044630016,a870a79d2df669b7f87342f8f7ec6274f70032997550fa9fe07a832f5874704b,2020-06-30 21:20:18,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nchar NUM[10]={'0','1','2','3','4','5','6','7','8','9'};\nchar num1[100];\nint B,N,S,i,j,point,suTime;\nint main()\n{cin>>N>>S;\n  bool tf(int a);\n  bool suitable(int a);\n  j=S+1;point=0;\n   while(point!=N)\n   {  if(suitable(j)) {point++;cout<<j<<endl;}\n       j++;\n   }\n   return 0;\n\t  }\n    bool tf(int a)\n{  i=0;\n   while(a>0){\n\t num1[i]=NUM[a%B];\n\t a=a/B;\n\t i++;\n }\n for(int m=0;m<i;m++){\n\t if(num1[m]!=num1[i-m-1]) return 0;\n }\n return 1;\n }\n\n  bool suitable(int a)\n  {   suTime=0;\n\t  for(B=2;B<11;B++){\n\t\t  if(bool(a)) suTime++;\n\t  }\n\t  if(suTime>2) return 1;\n\t  else return 0;\n  }",PARTIAL_ACCEPTED,21,496
1277956254083776512,50da7c55b44113943112c360765f2d343ea2a5045d304c0432b745d6e1c999fb,2020-06-30 21:24:48,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n\nusing namespace std;\n\nint n;\nint ch1[30],ch2[30];\nchar ch3[25]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H'};\n\nint main()\n{\n    cin>>n;\n    for(int i=1;i<=300;i++)\n    {\n        int square=i*i,x=0,y=0;\n        while(square)\n        {\n            ch1[++x]=square%n;\n            square/=n;\n        }\n        for(int j=1;j<=x/2;j++)\n        {\n            if(ch1[j]!=ch1[x-j+1])\n            {\n                y=1;\n                break;\n            }\n        }\n        if(!y)\n        {\n            int x1=0,s=i;\n            while(s)\n            {\n                ch2[++x1]=s%n;\n                s/=n;\n            }\n            for(int j=x1;j>0;j--)\n                cout<<ch3[ch2[j]];\n            cout<<\"" \"";\n            for(int j=1;j>0;j--)\n                cout<<ch3[ch1[j]];\n                cout<<\""\\n\"";\n        }\n    }\n    return 0;\n\n}",WRONG_ANSWER,43,500
1277956662776750080,84d3f6df3802889023ec532137fd38f0e8712d7d814827915d6bd789ac649761,2020-06-30 21:26:26,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <bits/stdc++.h>\nint judge(int n,int m)//判断\n{\n\tint a[100];\n\tint count = 0;\n\tint temp;\n\tchar a1[10000],b[10000],c[10000];\n\twhile(n!=0)\n\t{\n\t\ttemp = n%m;\n\t\tn=n/m;\n\t\ta[count]=temp;\n\t\tcount++;\n\t}\n\tfor(int j=0,i=count-1;i>=0,j<count;i--,j++)\n\t{\n\t\tif(a[i]>=10)\n\t\t{\n\t\t\ta1[i]=char(a[i]+55);\n\t\t}\n\t\t\t\n\t\telse a1[i]=char(a[i]+48);\n\t}\n\t\n\tfor(int j=0,i=count-1;i>=0,j<count;i--,j++)\n\t{\n\t\tif(\ta1[j]!=a1[i]) return 0;\n\t}\n\treturn 1;\n }\n\nusing namespace std;\nint main()\n{\n\tint N,S,n=0;\n\tint a[100000] = {0};\n\tcin>>N;\n\tcin>>S;\n\tfor(int i=S+1;i<S+N+1;i++)\n\t{\n\t\tfor(int j=2;j<11;j++)\n\t\t{\n\t\t\tif(judge(i,j)==1) a[i]=1;\n\t\t}\n\t\tfor(int i=0;i<100000;i++)\n\t\t{\n\t\t\tif(a[i]==1) n++;\n\t\t}\n\t\tif(n>1) cout<<i<<\"" \"";\n\t}\n\treturn 0;\n}",WRONG_ANSWER,34,896
1277957126993928192,b7f9a4062497756b8d037fe1f5f22857918efc573033109086d402dc4707807c,2020-06-30 21:28:17,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\nint isPalindramic(string str)\n{\n    int len=str.length()-1;\n    int i;\n    for(i=0;str.length()/2;i++)\n    {\n        if(str[i]!=str[len]){\n            break;\n        }\n        len--;\n    }\n\n    if(i>=len) return 1;\n    else return 0;\n}\n\nint change(int n,int k)\n{\n    string str;\n    int s[100];\n    int c,m=0;\n    while(n!=0)\n    {\n        c= n % k;\n        n /= k;\n        m++;\n        s[m]=c;\n    }\n    for(int i=m;i>=1;i--)\n    {\n        if(s[i]>=10) str+=(char)(s[i]+55);\n        else str+=(char(s[i])+'0');\n    }\n    return isPalindramic(str);\n}\n\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    int Count=0,t=0;\n    int i=S+1;\n    int k;//进制数\n    while(Count<N)\n    {\n        for(k=2;k<=10;k++)\n        {\n            if(change(i,k))\n            {\n                t++;//在k进制下回文个数加1\n            }\n            if(t==2)\n            {\n                cout<<i<<endl;\n                Count++;\n                break;\n            }\n        }\n        t=0;\n        i++;\n    }\n    return 0;\n}\n",ACCEPTED,40,488
1277957385304334336,84d3f6df3802889023ec532137fd38f0e8712d7d814827915d6bd789ac649761,2020-06-30 21:29:18,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <bits/stdc++.h>\nint judge(int n,int m)//判断\n{\n\tint a[100];\n\tint count = 0;\n\tint temp;\n\tchar a1[10000],b[10000],c[10000];\n\twhile(n!=0)\n\t{\n\t\ttemp = n%m;\n\t\tn=n/m;\n\t\ta[count]=temp;\n\t\tcount++;\n\t}\n\tfor(int j=0,i=count-1;i>=0,j<count;i--,j++)\n\t{\n\t\tif(a[i]>=10)\n\t\t{\n\t\t\ta1[i]=char(a[i]+55);\n\t\t}\n\t\t\t\n\t\telse a1[i]=char(a[i]+48);\n\t}\n\t\n\tfor(int j=0,i=count-1;i>=0,j<count;i--,j++)\n\t{\n\t\tif(\ta1[j]!=a1[i]) return 0;\n\t}\n\treturn 1;\n }\n\nusing namespace std;\nint main()\n{\n\tcout<<26<<endl<<27<<endl<<28<<endl;\n\treturn 0;\n}",WRONG_ANSWER,36,512
1277957432439922688,84d3f6df3802889023ec532137fd38f0e8712d7d814827915d6bd789ac649761,2020-06-30 21:29:29,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <bits/stdc++.h>\nint judge(int n,int m)//判断\n{\n\tint a[100];\n\tint count = 0;\n\tint temp;\n\tchar a1[10000],b[10000],c[10000];\n\twhile(n!=0)\n\t{\n\t\ttemp = n%m;\n\t\tn=n/m;\n\t\ta[count]=temp;\n\t\tcount++;\n\t}\n\tfor(int j=0,i=count-1;i>=0,j<count;i--,j++)\n\t{\n\t\tif(a[i]>=10)\n\t\t{\n\t\t\ta1[i]=char(a[i]+55);\n\t\t}\n\t\t\t\n\t\telse a1[i]=char(a[i]+48);\n\t}\n\t\n\tfor(int j=0,i=count-1;i>=0,j<count;i--,j++)\n\t{\n\t\tif(\ta1[j]!=a1[i]) return 0;\n\t}\n\treturn 1;\n }\n\nusing namespace std;\nint main()\n{\n\tint N,S,n=0;\n\tint a[100000] = {0};\n\tcin>>N;\n\tcin>>S;\n\tfor(int i=S+1;i<S+N+1;i++)\n\t{\n\t\tfor(int j=2;j<11;j++)\n\t\t{\n\t\t\tif(judge(i,j)==1) a[i]=1;\n\t\t}\n\t\tfor(int i=0;i<100000;i++)\n\t\t{\n\t\t\tif(a[i]==1) n++;\n\t\t}\n\t\tif(n>1) cout<<i<<endl;;\n\t}\n\treturn 0;\n}\t\n",WRONG_ANSWER,38,876
1277957627290509312,b3438195db15c9328b592c77d8e45a988f1211d1946f94d918b626712b5b9f58,2020-06-30 21:30:16,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cstring>\n\nusing namespace std;\nint n;\nint m[100];\n\nbool check(const int &x);\n\nvoid number(const int &x);\n\nint main() {\n    cin >> n;\n    for (int i = 1; i <= 300; ++i) {\n        if (check(i)) {\n            number(i);\n            number(i * i);\n            cout << endl;\n        }\n    }\n    return 0;\n}\n\nbool check(const int &x) {\n    int k = 0;\n    int y = x * x;\n    while (y > 0) {\n        ++k;\n        m[k] = y % n;\n        y = y / n;\n    }\n    for (int j = 1; j < k; ++j, --k) {\n        if (m[j] != m[k])\n            return false;\n    }\n    return true;\n}\n\nvoid number(const int &x) {\n    int k = 0;\n    int y = x;\n    while (y > 0) {\n        ++k;\n        m[k] = y % n;\n        y = y / n;\n    }\n    for (int j = k; j >= 1; --j) {\n        if (m[j] > 9) {\n            char ans = m[j] - 10 + 'A';\n            cout << ans;\n        } else cout << m[j];\n    }\n    cout<<\"" \"";\n}",PRESENTATION_ERROR,38,508
1277957751546773504,b3438195db15c9328b592c77d8e45a988f1211d1946f94d918b626712b5b9f58,2020-06-30 21:30:45,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cstring>\n\nusing namespace std;\nint n;\nint m[100];\n\nbool check(const int &x);\n\nvoid number(const int &x);\n\nint main() {\n    cin >> n;\n    for (int i = 1; i <= 300; ++i) {\n        if (check(i)) {\n            number(i);\n            cout << \"" \"";\n            number(i * i);\n            cout << endl;\n        }\n    }\n    return 0;\n}\n\nbool check(const int &x) {\n    int k = 0;\n    int y = x * x;\n    while (y > 0) {\n        ++k;\n        m[k] = y % n;\n        y = y / n;\n    }\n    for (int j = 1; j < k; ++j, --k) {\n        if (m[j] != m[k])\n            return false;\n    }\n    return true;\n}\n\nvoid number(const int &x) {\n    int k = 0;\n    int y = x;\n    while (y > 0) {\n        ++k;\n        m[k] = y % n;\n        y = y / n;\n    }\n    for (int j = k; j >= 1; --j) {\n        if (m[j] > 9) {\n            char ans = m[j] - 10 + 'A';\n            cout << ans;\n        } else cout << m[j];\n    }\n}",ACCEPTED,39,424
1277957838079451136,50da7c55b44113943112c360765f2d343ea2a5045d304c0432b745d6e1c999fb,2020-06-30 21:31:06,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\nusing namespace std;\nconst string s = \""0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"";\nint b;\nstruct number\n{\n    int a[20], len;\n    number(int x)\n    {\n        len = 0;\n        while (x)\n            a[++len] = x % b;\n            x /= b;\n    } \n    void output()\n    {\n        for (int i = len; i >= 1; i--)\n            cout << s[a[i]];\n    }\n    bool check()\n    {\n        for (int i = 1; i <= len; i++)\n            if (a[i] != a[len - i + 1])\n                return false;\n        return true;\n    }\n};\nint main()\n{\n    cin >> b;\n    for (int i = 1; i <= 300; i++)\n    {\n        number n(i * i);\n        if (n.check())\n        {\n            number m(i);\n            m.output();\n            cout << ' ';\n            n.output();\n            cout << '\\n';\n        }\n    }\n    return 0;\n}",TIME_LIMIT_EXCEEDED,0,0
1277958120884592640,50da7c55b44113943112c360765f2d343ea2a5045d304c0432b745d6e1c999fb,2020-06-30 21:32:13,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\nusing namespace std;\nconst string s = \""0123456789ABCDEFGH\"";\nint b;\nstruct number\n{\n    int a[20], len;\n    number(int x)\n    {\n        len = 0;\n        while (x)\n            a[++len] = x % b;\n            x /= b;\n    } \n    void output()\n    {\n        for (int i = len; i >= 1; i--)\n            cout << s[a[i]];\n    }\n    bool check()\n    {\n        for (int i = 1; i <= len; i++)\n            if (a[i] != a[len - i + 1])\n                return false;\n        return true;\n    }\n};\nint main()\n{\n    cin >> b;\n    for (int i = 1; i <= 300; i++)\n    {\n        number n(i * i);\n        if (n.check())\n        {\n            number m(i);\n            m.output();\n            cout << ' ';\n            n.output();\n            cout << '\\n';\n        }\n    }\n    return 0;\n}",TIME_LIMIT_EXCEEDED,0,0
1277958193584472064,84d3f6df3802889023ec532137fd38f0e8712d7d814827915d6bd789ac649761,2020-06-30 21:32:31,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <bits/stdc++.h>\nint judge(int n,int m)//判断\n{\n\tint a[100];\n\tint count = 0;\n\tint temp;\n\tchar a1[10000],b[10000],c[10000];\n\twhile(n!=0)\n\t{\n\t\ttemp = n%m;\n\t\tn=n/m;\n\t\ta[count]=temp;\n\t\tcount++;\n\t}\n\tfor(int j=0,i=count-1;i>=0,j<count;i--,j++)\n\t{\n\t\tif(a[i]>=10)\n\t\t{\n\t\t\ta1[i]=char(a[i]+55);\n\t\t}\n\t\t\t\n\t\telse a1[i]=char(a[i]+48);\n\t}\n\t\n\tfor(int j=0,i=count-1;i>=0,j<count;i--,j++)\n\t{\n\t\tif(\ta1[j]!=a1[i]) return 0;\n\t}\n\treturn 1;\n }\n\nusing namespace std;\nint main()\n{\n\tint N,S,n=0;\n\tint a[100000] = {0};\n\tcin>>N;\n\tcin>>S;\n\tfor(int i=S;i<S+N+1;i++)\n\t{\n\t\tfor(int j=2;j<11;j++)\n\t\t{\n\t\t\tif(judge(i,j)==1) a[i]=1;\n\t\t}\n\t\tfor(int i=0;i<100000;i++)\n\t\t{\n\t\t\tif(a[i]==1) n++;\n\t\t}\n\t\tif(n>1) cout<<i<<endl;;\n\t}\n\treturn 0;\n}\t",PARTIAL_ACCEPTED,33,784
1277958201180356608,50da7c55b44113943112c360765f2d343ea2a5045d304c0432b745d6e1c999fb,2020-06-30 21:32:33,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\nusing namespace std;\nconst string s = \""0123456789ABCDEFGH\"";\nint b;\nstruct number\n{\n    int a[20], len;\n    number(int x)\n    {\n        len = 0;\n        while (x)\n            a[++len] = x % b;\n            x /= b;\n    } \n    void output()\n    {\n        for (int i = len; i >= 1; i--)\n            cout << s[a[i]];\n    }\n    bool check()\n    {\n        for (int i = 1; i <= len; i++)\n            if (a[i] != a[len - i + 1])\n                return false;\n        return true;\n    }\n};\nint main()\n{\n    cin >> b;\n    for (int i = 1; i <= 300; i++)\n    {\n        number n(i * i);\n        if (n.check())\n        {\n            number m(i);\n            m.output();\n            cout << ' ';\n            n.output();\n            cout << '\\n';\n        }\n    }\n    return 0;\n}",TIME_LIMIT_EXCEEDED,0,0
1277958321804345344,50da7c55b44113943112c360765f2d343ea2a5045d304c0432b745d6e1c999fb,2020-06-30 21:33:01,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\nusing namespace std;\nconst string s = \""0123456789ABCDEFGH\"";\nint b;\nstruct number\n{\n    int a[20], len;\n    number(int x)\n    {\n        len = 0;\n        while (x)\n            a[++len] = x % b;\n            x /= b;\n    } \n    void output()\n    {\n        for (int i = len; i >= 1; i--)\n            cout << s[a[i]];\n    }\n    bool check()\n    {\n        for (int i = 1; i <= len; i++)\n            if (a[i] != a[len - i + 1])\n                return false;\n        return true;\n    }\n};\nint main()\n{\n    cin >> b;\n    for (int i = 1; i <= 300; i++)\n    {\n        number n(i * i);\n        if (n.check())\n        {\n            number m(i);\n            m.output();\n            cout << ' ';\n            n.output();\n            cout << '\\n';\n        }\n    }\n    return 0;\n}",TIME_LIMIT_EXCEEDED,0,0
1277959027521159168,ade1b517dfa96a08a0f2a67900f46bcecd43fb38d16241a43eca73a9c8978778,2020-06-30 21:35:50,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<cstring>\n#include<vector>\n#include<string>\n#include<string.h>\n#include <sstream>\n#include <algorithm>\nusing namespace std;\nstring jinzhi(int x,int y);\nbool huiwen(string x);\nint main()\n{\n    int o;\n    cin>>o;\n\n\n    for(int i=1;i<=300;i++)\n    {\n\n        if(huiwen(jinzhi(i*i,o))==1)\n        {\n            cout<<jinzhi(i,o)<<\"" \""<<jinzhi(i*i,o)<<endl;\n        }\n        else\n        {\n\n            continue;\n        }\n    }\n    return 0;\n}\n\n\nstring jinzhi(int x,int y)\n{\n    int d=0;\n    vector<int> a;\n    vector<int>b;\n    while(x>0)\n    {\n\n        d=x%y;\n        x=x/y;\n        a.push_back(d);\n    }\n\n    for(int i=a.size()-1;i>=0;i--)\n    {\n        b.push_back(a[i]);\n    }\n   string q;\n    for(int i=0;i<a.size();i++)\n    {\n        if(b[i]<10)\n        {\n            stringstream st;\n            st<<b[i];\n            string str= st.str();\n            q=q+str;\n        }\n        else\n        {\n            q=q+char(b[i]+55);\n        }\n    }\n    return q;\n\n}\n\nbool huiwen(string x)\n{\n\n    string y=x;\n    reverse(y.begin(),y.end());\n\n    if(y==x)\n    {\n        return 1;\n    }\n    else\n    {\n        return 0;\n    }\n\n}",ACCEPTED,43,408
1277959432758034432,ba8741b054453d53e00604cda664981b520780c8a25ad99d8eff8afe7b5f2cfd,2020-06-30 21:37:26,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include <algorithm>\n#include<math.h>\n\nusing namespace std;\n\nvoid transform(int n, int m);\n\nint main() {\n\tint B = 0;\n\tint pow = 0;\n\tint res = 0;\n\tint tmp = 0;\n\tchar c;\n\tstring str = \""\"";\n\tstring s;\n\tcin >> B;\n\tfor (int i = 1; i < 301; i++) {\n\t\tpow = i * i;\n\t\tstr = \""\"";\n\t\twhile (true) {\n\t\t\ttmp = pow % B;\n\t\t\tc = tmp + '0';\n\t\t\tif (( pow/= B) > 0) {\n\t\t\t\tstr = c + str;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tstr = c + str;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\ts = str;\n\t\treverse(s.begin(), s.end());\n\t\tif (str == s) {\n\t\t\ttransform(i, B);\n\t\t\tcout << \"" \"";\n\t\t\tcout << str << endl;\n\t\t}\n\t}\n}\nvoid transform(int n, int m)\n{\n\tif (n < m)\n\t\tcout << n;\n\telse\n\t{\n\t\ttransform(n / m, m);\n\t\tcout << n % m;\n\t}\n}",PARTIAL_ACCEPTED,40,424
1277959760081518592,ba8741b054453d53e00604cda664981b520780c8a25ad99d8eff8afe7b5f2cfd,2020-06-30 21:38:44,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include <algorithm>\n#include<math.h>\n\nusing namespace std;\n\nvoid transform(int n, int m);\n\nint main() {\n\tint B = 0;\n\tint pow = 0;\n\tint res = 0;\n\tint tmp = 0;\n\tchar c;\n\tstring str = \""\"";\n\tstring s;\n\tcin >> B;\n\tfor (int i = 1; i < 301; i++) {\n\t\tpow = i * i;\n\t\tstr = \""\"";\n\t\twhile (true) {\n\t\t\ttmp = pow % B;\n\t\t\tc = tmp + '0';\n\t\t\tif (( pow/= B) > 0) {\n\t\t\t\tstr = c + str;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tstr = c + str;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\ts = str;\n\t\treverse(s.begin(), s.end());\n\t\tif (str == s) {\n\t\t\ttransform(i, B);\n\t\t\tcout << \"" \"";\n\t\t\ttransform(i * i, B);\n\t\t\tcout << endl;\n\t\t}\n\t}\n}\nvoid transform(int n, int m)\n{\n\tif (n < m)\n\t\tcout << n;\n\telse\n\t{\n\t\ttransform(n / m, m);\n\t\tcout << n % m;\n\t}\n}",PARTIAL_ACCEPTED,28,424
1277960399972917248,50da7c55b44113943112c360765f2d343ea2a5045d304c0432b745d6e1c999fb,2020-06-30 21:41:17,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\nchar ch1[21]= {'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};/*这里是转换进制的重点*/\nint judge(long long n,char ch2[1000],long long B,long long *k)\n{\n    long long i,j;\n\n    while(n)\n    {\n        ch2[(*k)++]=ch1[n%B];\n        n=n/B;\n    }\n    ch2[*k]='\\0';\n\n    i=0;\n    j=*k-1;\n    while(i<j)\n    {\n        if(ch2[i]!=ch2[j])\n            return 0;\n        i++;\n        j--;\n    }\n\n    return 1;\n\n}\nint main()\n{\n    long long B,i,j,k,t;\n    char ch2[1000];\n    while(~scanf(\""%lld\"",&B))\n    {\n        for(i=1; i<=300; i++)\n        {\n            k=0;\n            if(judge(i*i,ch2,B,&k)==1)\n            {\n                t=i;\n                k=0;\n                while(t)\n                {\n                    ch2[k++]=ch1[t%B];\n                    t=t/B;\n                }\n                ch2[k]='\\0';\n\n                k--;\n                while(k>=0)\n                {\n                    cout<<ch2[k--];\n                }\n\n\n                k=0;\n                cout<<\"" \"";\n                judge(i*i,ch2,B,&k);\n                k--;\n                while(k>=0)\n                    cout<<ch2[k--];\n                cout<<\""\\n\"";\n            }\n        }\n    }\n\n\n}",ACCEPTED,33,464
1277960495569502208,84d3f6df3802889023ec532137fd38f0e8712d7d814827915d6bd789ac649761,2020-06-30 21:41:40,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <bits/stdc++.h>\nint judge(int n,int m)//判断  m进制转化 \n{\n\tint a[100];\n\tint count = 0;\n\tint temp;\n\tchar a1[10000],b[10000],c[10000];\n\twhile(n!=0)\n\t{\n\t\ttemp = n%m;\n\t\tn=n/m;\n\t\ta[count]=temp;\n\t\tcount++;\n\t}\n\tfor(int j=0,i=count-1;i>=0,j<count;i--,j++)\n\t{\n\t\tif(a[i]>=10)\n\t\t{\n\t\t\ta1[i]=char(a[i]+55);\n\t\t}\n\t\t\t\n\t\telse a1[i]=char(a[i]+48);\n\t}\n\t\n\tfor(int j=0,i=count-1;i>=0,j<count;i--,j++)\n\t{\n\t\tif(\ta1[j]!=a1[i]) return 0;\n\t}\n\treturn 1;\n }\n\nusing namespace std;\nint main()\n{\n\tint N,S;\n\tcin>>N;\n\tcin>>S;\n\tfor(int i=S;i<S+N+1;i++)\n\t{\n\t\tint n=0;\n\t\tint a[20] = {0};\n\t\tfor(int j=2;j<11;j++)\n\t\t{\n\t\t\tif(judge(i,j)==1) a[j]=1;\n\t\t}\n\t\tfor(int i=0;i<20;i++)\n\t\t{\n\t\t\tif(a[i]==1) n++;\n\t\t}\n\t\tif(n>1) cout<<i<<endl;\n\t}\n\treturn 0;\n}\t\n",WRONG_ANSWER,34,384
1277960763019296768,a870a79d2df669b7f87342f8f7ec6274f70032997550fa9fe07a832f5874704b,2020-06-30 21:42:43,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nchar NUM[10]={'0','1','2','3','4','5','6','7','8','9'};\nchar num1[100];\nint B,N,S,i,j,point,suTime;\nint main()\n{cin>>N>>S;\n  bool tf(int a);\n  bool suitable(int a);\n  j=S+1;point=0;\n   while(point!=N)\n   {  if(suitable(j)) {point++;cout<<j<<endl;}\n       j++;\n   }\n   return 0;\n\t  }\n    bool tf(int a)\n{  i=0;\n   while(a>0){\n\t num1[i]=NUM[a%B];\n\t a=a/B;\n\t i++;\n }\n for(int m=0;m<i;m++){\n\t if(num1[m]!=num1[i-m-1]) return 0;\n }\n return 1;\n }\n\n  bool suitable(int a)\n  {   suTime=0;\n\t  for(B=2;B<11;B++){\n\t\t  if(tf(a)) suTime++;\n\t  }\n\t  if(suTime>=2) return 1;\n\t  else return 0;\n  }\n",ACCEPTED,37,424
1277960830384013312,ba18e5a6c6a32e01f69118bebf499c8130708e5a9da14a9560f36931a7a36a7b,2020-06-30 21:42:59,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\nusing namespace std;\nint main(){\n    int R;\n    int k,j;\n    cin>>R;\n    int a[6000];\n    int b[6000];\n    int arr[6000];\n    for(int i=1;i<301;i++){\n        int N=i;\n        int e=0;\n        while (N) {\n            arr[e]=N%R;\n            e++;\n            N/=R;\n        }\n        int n=i*i;\n        int c=0;\n        while (n) {\n            a[c]=n%R;\n            c++;\n            n/=R;\n        }\n        for(k=0,j=c-1;k<c;k++,j--)\n            b[j]=a[k];\n        int p=0;\n        for (int x=0;x<c;x++){\n            if(a[x]==b[x])\n                p++;\n        }\n        if (p==c){\n            for(int v=e-1;v>=0;v--)\n                cout<<arr[v];\n            cout<<\"" \"";\n            for(int z=0;z<c;z++){\n                if(b[z]>=10)\n                    cout<<char(b[z]-10+'A');\n                else\n                    cout<<b[z];\n            }\n            cout<<endl;\n        }\n    }\n}",PARTIAL_ACCEPTED,28,448
1277961397466497024,ba18e5a6c6a32e01f69118bebf499c8130708e5a9da14a9560f36931a7a36a7b,2020-06-30 21:45:15,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\nusing namespace std;\nint main(){\n    int R;\n    int k,j;\n    cin>>R;\n    int a[6000];\n    int b[6000];\n    int arr[6000];\n    for(int i=1;i<301;i++){\n        int N=i;\n        int e=0;\n        while (N) {\n            arr[e]=N%R;\n            e++;\n            N/=R;\n        }\n        int n=i*i;\n        int c=0;\n        while (n) {\n            a[c]=n%R;\n            c++;\n            n/=R;\n        }\n        for(k=0,j=c-1;k<c;k++,j--)\n            b[j]=a[k];\n        int p=0;\n        for (int x=0;x<c;x++){\n            if(a[x]==b[x])\n                p++;\n        }\n        if (p==c){\n            for(int v=e-1;v>=0;v--){\n                if(arr[v]>=10)\n                    cout<<char(arr[v]-10+'A');\n                else\n                    cout<<arr[v];\n            }\n            cout<<\"" \"";\n            for(int z=0;z<c;z++){\n                if(b[z]>=10)\n                    cout<<char(b[z]-10+'A');\n                else\n                    cout<<b[z];\n            }\n            cout<<endl;\n        }\n    }\n}",ACCEPTED,44,492
1277963065084010496,dbdee02c4509ab7a1fd578907c2d4a0dc00c446ff84739560caf0298cf21d497,2020-06-30 21:51:52,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstring>\nusing namespace std;\nvoid mertcon(int x,int B);\nbool palin();\nint N,S;\nchar a[10000];\nint main()\n{\nint number=0;\ncin>>N>>S;\nwhile (number<N) {\nS=S+1;\nint time=0;\nfor(int B=2;B<=10;B++)\n{mertcon(S,B);\nif(palin())\ntime++;\n}\nif (time>=2)\n{cout<<S<<endl;\nnumber++;}\n}\n\n\n}\n\n\n\nvoid mertcon(int x,int B)\n{   int c;\n    int i=0;\n    while (x) {\n    c=x%B;\n    x=x/B;\n    a[i]=c+'0';\n    i++;\n    }\n}\n\nbool palin()\n{int length=strlen(a);\nint m,n;\nfor(m=0,n=(length-1);m<=n;m++,n--)\n{\nif(a[m]!=a[n])\n    return 0;\n}\nreturn 1;\n}",MULTIPLE_ERROR,4,384
1277964409337479168,afbe3dd44dd174a47bc8fc4e72e8b1c926d31aa15a5454a9bb85155d6b0804f5,2020-06-30 21:57:13,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint main()\n{\n\tint a, b, j, n=0, number[100];                  //储存进制运算余数\n\tint yep[300];                                       //储存符合条件十进制数\n\tcin >> a;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tj = i * i;                                           //进制转换\n\t\tint m = 0;\n\t\twhile (j!=0)\n\t\t{\n\t\t\tb = j % a;\n\t\t\tj = j / a;\n\t\t\tnumber[m] = b;\n\t\t\tm++;\n\t\t}                                                       //判断回文\n\t\tfor (int i = 0; i <= m / 2; i++) {\n\t\t\tif (number[i] != number[m - i - 1]) { break; }\n\t\t\telse { yep[n] = i; n++; }\n\t\t}\n\t}\n\t                                                              //输出\n\tfor (int i = 0; i < n; i++) {\n\t\tint m = 0;\n\t\twhile (yep[i] > 0) {\n\t\t\tj = yep[i];\n\t\t\tb = j % a;\n\t\t\tj = j / a;\n\t\t\tnumber[m] = b;\n\t\t\tm++;\n\t\t}\n\t\tfor (int k = m - 1; k >= 0; k--) {\n\t\t\tif (number[k] >= 10) { cout << (char)(number[k] + 55); }\n\t\t\telse { cout << number[k]; }\n\t\t}\n\t\tcout << \"" \"";\n\t\tm = 0;\n\t\twhile (yep[i] > 0) {\n\t\t\tj = yep[i]*yep[i];\n\t\t\tb = j % a;\n\t\t\tj = j / a;\n\t\t\tnumber[m] = b;\n\t\t\tm++;\n\t\t}\n\t\tfor (int k = m - 1; k >= 0; k--) {\n\t\t\tif (number[k] >= 10) { cout << (char)(number[k] + 55); }\n\t\t\telse { cout << number[k]; }\n\t\t}\n\t\tcout << endl;\n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,37,592
1277964528896106496,afbe3dd44dd174a47bc8fc4e72e8b1c926d31aa15a5454a9bb85155d6b0804f5,2020-06-30 21:57:41,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint main()\n{\n\tint a, b, j, n=0, number[1000];                  //储存进制运算余数\n\tint yep[300];                                       //储存符合条件十进制数\n\tcin >> a;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tj = i * i;                                           //进制转换\n\t\tint m = 0;\n\t\twhile (j!=0)\n\t\t{\n\t\t\tb = j % a;\n\t\t\tj = j / a;\n\t\t\tnumber[m] = b;\n\t\t\tm++;\n\t\t}                                                       //判断回文\n\t\tfor (int i = 0; i <= m / 2; i++) {\n\t\t\tif (number[i] != number[m - i - 1]) { break; }\n\t\t\telse { yep[n] = i; n++; }\n\t\t}\n\t}\n\t                                                              //输出\n\tfor (int i = 0; i < n; i++) {\n\t\tint m = 0;\n\t\twhile (yep[i] > 0) {\n\t\t\tj = yep[i];\n\t\t\tb = j % a;\n\t\t\tj = j / a;\n\t\t\tnumber[m] = b;\n\t\t\tm++;\n\t\t}\n\t\tfor (int k = m - 1; k >= 0; k--) {\n\t\t\tif (number[k] >= 10) { cout << (char)(number[k] + 55); }\n\t\t\telse { cout << number[k]; }\n\t\t}\n\t\tcout << \"" \"";\n\t\tm = 0;\n\t\twhile (yep[i] > 0) {\n\t\t\tj = yep[i]*yep[i];\n\t\t\tb = j % a;\n\t\t\tj = j / a;\n\t\t\tnumber[m] = b;\n\t\t\tm++;\n\t\t}\n\t\tfor (int k = m - 1; k >= 0; k--) {\n\t\t\tif (number[k] >= 10) { cout << (char)(number[k] + 55); }\n\t\t\telse { cout << number[k]; }\n\t\t}\n\t\tcout << endl;\n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,28,508
1277964809046261760,afbe3dd44dd174a47bc8fc4e72e8b1c926d31aa15a5454a9bb85155d6b0804f5,2020-06-30 21:58:48,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint main()\n{\n\tint a, b, j, n=0, number[300];                  //储存进制运算余数\n\tint yep[300];                                   //储存符合条件十进制数\n\tcin >> a;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tj = i * i;                                  //进制转换\n\t\tint m = 0;\n\t\twhile (j!=0)\n\t\t{\n\t\t\tb = j % a;\n\t\t\tj = j / a;\n\t\t\tnumber[m] = b;\n\t\t\tm++;\n\t\t}                                                       //判断回文\n\t\tfor (int i = 0; i <= m / 2; i++) {\n\t\t\tif (number[i] != number[m - i - 1]) { break; }\n\t\t\telse { yep[n] = i; n++; }\n\t\t}\n\t}\n\t                                                              //输出\n\tfor (int i = 0; i < n; i++) {\n\t\tint m = 0;\n\t\twhile (yep[i] > 0) {\n\t\t\tj = yep[i];\n\t\t\tb = j % a;\n\t\t\tj = j / a;\n\t\t\tnumber[m] = b;\n\t\t\tm++;\n\t\t}\n\t\tfor (int k = m - 1; k >= 0; k--) {\n\t\t\tif (number[k] >= 10) { cout << (char)(number[k] + 55); }\n\t\t\telse { cout << number[k]; }\n\t\t}\n\t\tcout << \"" \"";\n\t\tm = 0;\n\t\twhile (yep[i] > 0) {\n\t\t\tj = yep[i]*yep[i];\n\t\t\tb = j % a;\n\t\t\tj = j / a;\n\t\t\tnumber[m] = b;\n\t\t\tm++;\n\t\t}\n\t\tfor (int k = m - 1; k >= 0; k--) {\n\t\t\tif (number[k] >= 10) { cout << (char)(number[k] + 55); }\n\t\t\telse { cout << number[k]; }\n\t\t}\n\t\tcout << endl;\n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,28,508
1277965000155521024,dbdee02c4509ab7a1fd578907c2d4a0dc00c446ff84739560caf0298cf21d497,2020-06-30 21:59:34,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstring>\nusing namespace std;\nvoid mertcon(int x,int B);\nbool palin();\nint N,S;\nchar a[5];\nint main()\n{\nint number=0;\ncin>>N>>S;\nwhile (number<N) {\nS=S+1;\nint time=0;\nfor(int B=2;B<=10;B++)\n{mertcon(S,B);\nif(palin())\ntime+=1;\n}\nif (time>=2)\n{cout<<S<<endl;\nnumber++;}\n}\n\n\n}\n\n\n\nvoid mertcon(int x,int B)\n{   int c;\n    int i=0;\n    while (x) {\n    c=x%B;\n    x=x/B;\n    a[i]=c+'0';\n    i++;\n    }\n\n}\n\nbool palin()\n{int length=strlen(a);\nint m,n;\nfor(m=0,n=(length-1);m<=n;m++,n--)\n{\nif(a[m]!=a[n])\n    return 0;\n}\nreturn 1;\n\n}\n",MULTIPLE_ERROR,5,424
1277967800792973312,ba8741b054453d53e00604cda664981b520780c8a25ad99d8eff8afe7b5f2cfd,2020-06-30 22:10:41,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include <algorithm>\n#include<math.h>\n\nusing namespace std;\n\nvoid transform(int n, int m);\n\nint main() {\n\tint B = 0;\n\tint pow = 0;\n\tint res = 0;\n\tint tmp = 0;\n\tchar c;\n\tstring str = \""\"";\n\tstring s;\n\tcin >> B;\n\tfor (int i = 1; i < 301; i++) {\n\t\tpow = i * i;\n\t\tstr = \""\"";\n\t\twhile (true) {\n\t\t\ttmp = pow % B;\n\t\t\tc = tmp + '0';\n\t\t\tif (( pow/= B) > 0) {\n\t\t\t\tstr = c + str;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tstr = c + str;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\ts = str;\n\t\treverse(s.begin(), s.end());\n\t\tif (str == s) {\n\t\t\ttransform(i, B);\n\t\t\tcout << \"" \"";\n\t\t\ttransform(i * i, B);\n\t\t\tcout << endl;\n\t\t}\n\t}\n}\nvoid transform(int n, int m)\n{\n\tif (n < m) {\n\t\tif (n >= 10) cout << (char)(n + 55);\n\t\telse cout << n;\n\t}\n\telse{\n\t\ttransform(n / m, m);\n\t\tcout << n % m;\n\t}\n}",PARTIAL_ACCEPTED,38,512
1277968396178620416,dbdee02c4509ab7a1fd578907c2d4a0dc00c446ff84739560caf0298cf21d497,2020-06-30 22:13:03,C++,30.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstring>\nusing namespace std;\nvoid mertcon(int x,int B);\nbool palin();\nint N,S;\nchar a[5];\nint main()\n{\nint number=0;\ncin>>N>>S;\nwhile (number<N) {\nS=S+1;\nint time=0;\nfor(int B=10;B>=2;B--)\n{mertcon(S,B);\nif(palin())\ntime+=1;\n}\nif (time>=2)\n{cout<<S<<endl;\nnumber++;}\n}\n\n\n}\n\n\n\nvoid mertcon(int x,int B)\n{   memset(a,'\\0',5);\n    int c;\n    int i=0;\n    while (x) {\n    c=x%B;\n    x=x/B;\n    a[i]=c+'0';\n    i++;\n    }\n\n}\n\nbool palin()\n{int length=strlen(a);\nint m,n;\nfor(m=0,n=(length-1);m<=n;m++,n--)\n{\nif(a[m]!=a[n])\n    return 0;\n}\nreturn 1;\n\n}\n",PARTIAL_ACCEPTED,15,384
1277968475295776768,dbdee02c4509ab7a1fd578907c2d4a0dc00c446ff84739560caf0298cf21d497,2020-06-30 22:13:22,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstring>\nusing namespace std;\nvoid mertcon(int x,int B);\nbool palin();\nint N,S;\nchar a[4];\nint main()\n{\nint number=0;\ncin>>N>>S;\nwhile (number<N) {\nS=S+1;\nint time=0;\nfor(int B=10;B>=2;B--)\n{mertcon(S,B);\nif(palin())\ntime+=1;\n}\nif (time>=2)\n{cout<<S<<endl;\nnumber++;}\n}\n\n\n}\n\n\n\nvoid mertcon(int x,int B)\n{   memset(a,'\\0',5);\n    int c;\n    int i=0;\n    while (x) {\n    c=x%B;\n    x=x/B;\n    a[i]=c+'0';\n    i++;\n    }\n\n}\n\nbool palin()\n{int length=strlen(a);\nint m,n;\nfor(m=0,n=(length-1);m<=n;m++,n--)\n{\nif(a[m]!=a[n])\n    return 0;\n}\nreturn 1;\n\n}\n",RUNTIME_ERROR,38,424
1277968589754138624,dbdee02c4509ab7a1fd578907c2d4a0dc00c446ff84739560caf0298cf21d497,2020-06-30 22:13:49,C++,30.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstring>\nusing namespace std;\nvoid mertcon(int x,int B);\nbool palin();\nint N,S;\nchar a[5];\nint main()\n{\nint number=0;\ncin>>N>>S;\nwhile (number<N) {\nS=S+1;\nint time=0;\nfor(int B=10;B>=2;B--)\n{mertcon(S,B);\nif(palin())\ntime+=1;\n}\nif (time>=2)\n{cout<<S<<endl;\nnumber++;}\n}\n\n\n}\n\n\n\nvoid mertcon(int x,int B)\n{   memset(a,'\\0',5);\n    int c;\n    int i=0;\n    while (x) {\n    c=x%B;\n    x=x/B;\n    a[i]=c+'0';\n    i++;\n    }\n\n}\n\nbool palin()\n{int length=strlen(a);\nint m,n;\nfor(m=0,n=(length-1);m<=n;m++,n--)\n{\nif(a[m]!=a[n])\n    return 0;\n}\nreturn 1;\n\n}\n",PARTIAL_ACCEPTED,21,552
1277970881547001856,dbdee02c4509ab7a1fd578907c2d4a0dc00c446ff84739560caf0298cf21d497,2020-06-30 22:22:56,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstring>\nusing namespace std;\nvoid mertcon(int x,int B);\nbool palin();\nint N,S;\nchar a[5];\nint main()\n{\nint number=0;\ncin>>N>>S;\nwhile (number<N) {\nS=S+1;\nint time=0;\nfor(int B=2;B<=10;B++)\n{mertcon(S,B);\nif(palin())\ntime+=1;\nif(time>=2)\n{cout<<S<<endl;\n    continue;\n    number++;}\n}\n\n}\n\n\n}\n\n\n\nvoid mertcon(int x,int B)\n{   memset(a,'\\0',5);\n    int c;\n    int i=0;\n    while (x) {\n    c=x%B;\n    x=x/B;\n    a[i]=c+'0';\n    i++;\n    }\n\n}\n\nbool palin()\n{int length=strlen(a);\nint m,n;\nfor(m=0,n=(length-1);m<=n;m++,n--)\n{\nif(a[m]!=a[n])\n    return 0;\n}\nreturn 1;\n\n}\n",TIME_LIMIT_EXCEEDED,0,0
1277971075504209920,a2aa1426aec01768a802bb92f8567a460e4bf01e8123342ad6f277b04a66812b,2020-06-30 22:23:42,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\n#include<cmath>\nusing namespace std;\nvoid convertToB(vector<char>&number,int square,int n)\n{\n\tint m,value,temp;\n\tint flag=log(square)/log(n);\n\tint num=flag+1;\n\twhile(square>0)\n\t{\n\t\tm=log(square)/log(n);\n\t\tif(flag-m>1)\n\t\t\tnumber.push_back(48);\n\t\tflag=m;\n\t\ttemp=pow(n,m);\n\t\tvalue=square/temp;\n\t\tif(value<10)\n\t\t\tnumber.push_back(value+48);\n\t\telse\n\t\t\tnumber.push_back(value+55); \n\t\tsquare=square%temp;\n\t}\n\tint length=number.size();\n\tif(length<num)\n\t{\n\t\tint zero=num-length;\n\t\tfor(int i=0;i<zero;i++)\n\t\t\tnumber.push_back(48);\n\t}\n}\nbool judge(vector<char>&number)\n{\n\tint length=number.size();\n\tfor(int i=0,j=length-1;i<=j;i++,j--)\n\t{\n\t\tif(number[i]!=number[j])\n\t\t\treturn false;\n\t}\n\treturn true;\n}\nint main()\n{\n\tint n;\n\tcin>>n;\n\tint square=0;\n\tvector<char>number;\n\tvector<char>self;\n\tint length1,length2;\n\tfor(int i=1;i<=300;i++)\n\t{\n\t\tnumber.clear();\n\t\tsquare=i*i;\n\t\tconvertToB(number,square,n);\n\t\tlength1=number.size(); \n\t\t\n\t\tif(judge(number))\n\t\t{\n\t\t\tself.clear();\n\t\t\tconvertToB(self,i,n);\n\t\t\tlength2=self.size();\n\t\t\tfor(int m=0;m<length2;m++)\n\t\t\t\tcout<<self[m];\n\t\t\tcout<<\"" \"";\n\t\t\tfor(int m=0;m<length1;m++)\n\t\t\t\tcout<<number[m];\n\t\t\tcout<<endl;\t\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,34,512
1277971472348274688,dbdee02c4509ab7a1fd578907c2d4a0dc00c446ff84739560caf0298cf21d497,2020-06-30 22:25:17,C++,30.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstring>\nusing namespace std;\nvoid mertcon(int x,int B);\nbool palin();\nint N,S;\nchar a[5];\nint main()\n{\nint number=0;\ncin>>N>>S;\nwhile (number<N) {\nS=S+1;\nint time=0;\nfor(int B=2;B<=10;B++)\n{mertcon(S,B);\nif(palin())\ntime+=1;\nif(time>=2)\n{cout<<S<<endl;\n    number++;\n    break;}\n}\n\n}\n\n\n}\n\n\n\nvoid mertcon(int x,int B)\n{   memset(a,'\\0',5);\n    int c;\n    int i=0;\n    while (x) {\n    c=x%B;\n    x=x/B;\n    a[i]=c+'0';\n    i++;\n    }\n\n}\n\nbool palin()\n{int length=strlen(a);\nint m,n;\nfor(m=0,n=(length-1);m<=n;m++,n--)\n{\nif(a[m]!=a[n])\n    return 0;\n}\nreturn 1;\n\n}\n\n",PARTIAL_ACCEPTED,35,384
1277972040823267328,782de8de24b69682b55d2ec864c3c74059925a75bca9e240d2c3ba45de48e5f7,2020-06-30 22:27:32,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint abc(int n,int m)\n{\n    char a='A',b;\n    if(n==0)\n        return 0;\n    else\n    {\n        abc(n/m,m);\n        if(n%m>=10)\n        {\n            b=a+(n%m-10);\n            cout<<b;\n        }\n        else\n            cout<<n%m;\n    }\n}\n\nint main(){\n    int B;\n    cin>>B;\n    int number1[300] = {0};\n    for(int i=0;i<300;i++){\n        number1[i] = i*i;\n        number1[i] = abc(number1[i],B);\n    }\n    for(int k=0;k<300;k++){\n        int m = number1[k];\n        int a=0,b=0;\n        int array[10];\n        while(m)\n        {\n            array[a++]=m%10;\n            m/=10;\n        }\n        a--;\n        while(a>b)\n        {\n            if(array[b++]!=array[a--])\n                break;\n        }\n\n        if(b>a)\n            cout<<number1[k]<<endl;\n        return 0;\n    }\n}\n",WRONG_ANSWER,34,512
1277972288199131136,afbe3dd44dd174a47bc8fc4e72e8b1c926d31aa15a5454a9bb85155d6b0804f5,2020-06-30 22:28:31,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint main()\n{\n\tint a, b, j, n=0, number[100];                  //储存进制运算余数\n\tint yep[300] = {0};                                       //储存符合条件十进制数\n\tcin >> a;\n\tfor (int i = 1; i <= 11; i++) {\n\t\tj = i * i;                                           //进制转换\n\t\tint m = 0;\n\t\twhile (j!=0)\n\t\t{\n\t\t\tb = j % a;\n\t\t\tj = j / a;\n\t\t\tnumber[m] = b;\n\t\t\tm++;\n\t\t}                                                       //判断回文\n\t\tint flag = 1;\n\t\tfor (int k = 0; k <=(m+1) / 2; k++) {\n\t\t\tif (number[k] != number[m - k - 1]) { flag = 0; break; }\n\t\t}\n\t\tif (flag == 1) { yep[i-1] = i; }\n\t}\n\t                                                              //输出\n\tfor (int i = 0; i < n; i++) {\n\t\tint m = 0;\n\t\twhile (yep[i] > 0) {\n\t\t\tj = yep[i];\n\t\t\tb = j % a;\n\t\t\tj = j / a;\n\t\t\tnumber[m] = b;\n\t\t\tm++;\n\t\t}\n\t\tfor (int k = m - 1; k >= 0; k--) {\n\t\t\tif (number[k] >= 10) { cout << (char)(number[k] + 55); }\n\t\t\telse { cout << number[k]; }\n\t\t}\n\t\tcout << \"" \"";\n\t\tm = 0;\n\t\twhile (yep[i] > 0) {\n\t\t\tj = yep[i]*yep[i];\n\t\t\tb = j % a;\n\t\t\tj = j / a;\n\t\t\tnumber[m] = b;\n\t\t\tm++;\n\t\t}\n\t\tfor (int k = m - 1; k >= 0; k--) {\n\t\t\tif (number[k] >= 10) { cout << (char)(number[k] + 55); }\n\t\t\telse { cout << number[k]; }\n\t\t}\n\t\tcout << endl;\n\t}\n\treturn 0;\n}",WRONG_ANSWER,39,384
1277973309373734912,a2aa1426aec01768a802bb92f8567a460e4bf01e8123342ad6f277b04a66812b,2020-06-30 22:32:35,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\n#include<cmath>\nusing namespace std;\nvoid convertToB(vector<char>&number,int square,int n)\n{\n\tint m,value,temp,len;\n\tint flag=log(square)/log(n);\n\tint num=flag+1;\n\twhile(square>0)\n\t{\n\t\tm=log(square)/log(n);\n\t\tlen=flag-m;\n\t\tfor(len;len>1;len--)\n\t\t\tnumber.push_back(48);\n\t\tflag=m;\n\t\ttemp=pow(n,m);\n\t\tvalue=square/temp;\n\t\tif(value<10)\n\t\t\tnumber.push_back(value+48);\n\t\telse\n\t\t\tnumber.push_back(value+55); \n\t\tsquare=square%temp;\n\t}\n\tint length=number.size();\n\tif(length<num)\n\t{\n\t\tint zero=num-length;\n\t\tfor(int i=0;i<zero;i++)\n\t\t\tnumber.push_back(48);\n\t}\n}\nbool judge(vector<char>&number)\n{\n\tint length=number.size();\n\tfor(int i=0,j=length-1;i<=j;i++,j--)\n\t{\n\t\tif(number[i]!=number[j])\n\t\t\treturn false;\n\t}\n\treturn true;\n}\nint main()\n{\n\tint n;\n\tcin>>n;\n\tint square=0;\n\tvector<char>number;\n\tvector<char>self;\n\tint length1,length2;\n\tfor(int i=1;i<=300;i++)\n\t{\n\t\tnumber.clear();\n\t\tsquare=i*i;\n\t\tconvertToB(number,square,n);\n\t\tlength1=number.size(); \n\t\t\n\t\tif(judge(number))\n\t\t{\n\t\t\tself.clear();\n\t\t\tconvertToB(self,i,n);\n\t\t\tlength2=self.size();\n\t\t\tfor(int m=0;m<length2;m++)\n\t\t\t\tcout<<self[m];\n\t\t\tcout<<\"" \"";\n\t\t\tfor(int m=0;m<length1;m++)\n\t\t\t\tcout<<number[m];\n\t\t\tcout<<endl;\t\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,47,500
1277973782147301376,a2aa1426aec01768a802bb92f8567a460e4bf01e8123342ad6f277b04a66812b,2020-06-30 22:34:27,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\n#include<cmath>\nusing namespace std;\nvoid convertToB(vector<char>&number,int square,int n)\n{\n\tint m,value,temp,len;\n\tint flag=log(square)/log(n);\n\tint num=flag+1;\n\twhile(square>0)\n\t{\n\t\tm=log(square)/log(n);\n        //处理中间的0\n\t\tlen=flag-m;\n\t\tfor(len;len>1;len--)\n\t\t\tnumber.push_back(48);\n\t\tflag=m;\n\t\ttemp=pow(n,m);\n\t\tvalue=square/temp;\n\t\tif(value<10)\n\t\t\tnumber.push_back(value+48);\n\t\telse\n\t\t\tnumber.push_back(value+55); \n\t\tsquare=square%temp;\n\t}\n    //处理末尾的0\n\tint length=number.size();\n\tif(length<num)\n\t{\n\t\tint zero=num-length;\n\t\tfor(int i=0;i<zero;i++)\n\t\t\tnumber.push_back(48);\n\t}\n}\nbool judge(vector<char>&number)\n{\n\tint length=number.size();\n\tfor(int i=0,j=length-1;i<=j;i++,j--)\n\t{\n\t\tif(number[i]!=number[j])\n\t\t\treturn false;\n\t}\n\treturn true;\n}\nint main()\n{\n\tint n;\n\tcin>>n;\n\tint square=0;\n\tvector<char>number;\n\tvector<char>self;\n\tint length1,length2;\n\tfor(int i=1;i<=300;i++)\n\t{\n\t\tnumber.clear();\n\t\tsquare=i*i;\n\t\tconvertToB(number,square,n);\n\t\tlength1=number.size(); \n\t\t\n\t\tif(judge(number))\n\t\t{\n\t\t\tself.clear();\n\t\t\tconvertToB(self,i,n);\n\t\t\tlength2=self.size();\n\t\t\tfor(int m=0;m<length2;m++)\n\t\t\t\tcout<<self[m];\n\t\t\tcout<<\"" \"";\n\t\t\tfor(int m=0;m<length1;m++)\n\t\t\t\tcout<<number[m];\n\t\t\tcout<<endl;\t\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,32,424
1277974943122259968,ba8741b054453d53e00604cda664981b520780c8a25ad99d8eff8afe7b5f2cfd,2020-06-30 22:39:04,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include <algorithm>\n#include<math.h>\n\nusing namespace std;\n\nint main() {\n\tint B = 0;\n\tint pow = 0;\n\tint res = 0;\n\tint tmp = 0;\n\tchar c;\n\tstring str = \""\"";\n\tstring s;\n\tcin >> B;\n\tfor (int i = 1; i < 301; i++) {\n\t\tpow = i * i;\n\t\tstr = \""\"";\n\t\twhile (true) {\n\t\t\ttmp = pow % B;\n\t\t\tif(tmp > 9){\n\t\t\tc = (char)(tmp + 55);\n\t\t\t}\n\t\t\telse {\n\t\t\tc = tmp + '0';\n\t\t\t}\n\t\t\tif ((pow /= B) > 0) {\n\t\t\t\tstr = c + str;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tstr = c + str;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\ts = str;\n\t\treverse(s.begin(), s.end());\n\t\tstring ss = str;\n\t\tif (str == s) {\n\t\t\tstr = \""\"";\n\t\t\tint hahaha = i;\n\t\t\twhile (true) {\n\t\t\t\ttmp = hahaha % B;\n\t\t\t\tif (tmp > 9) {\n\t\t\t\t\tc = (char)(tmp + 55);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tc = tmp + '0';\n\t\t\t\t}\n\t\t\t\tif ((hahaha /= B) > 0) {\n\t\t\t\t\tstr = c + str;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tstr = c + str;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout << str << \"" \"" ;\n\t\t\tcout << ss << endl;\n\t\t\t\n\t\t}\n\t}\n}",ACCEPTED,36,512
1277975466554621952,84d3f6df3802889023ec532137fd38f0e8712d7d814827915d6bd789ac649761,2020-06-30 22:41:09,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <bits/stdc++.h>\nint judge(int n,int m)//判断  m进制转化 \n{\n\tint a[10000];\n\tint count = 0;\n\tint temp;\n\tchar a1[10000];\n\twhile(n!=0)\n\t{\n\t\ttemp = n%m;\n\t\tn=n/m;\n\t\ta[count]=temp;\n\t\tcount++;\n\t}\n\tfor(int j=0,i=count-1;i>=0,j<count;i--,j++)\n\t{\n\t\tif(a[i]>=10)\n\t\t{\n\t\t\ta1[i]=char(a[i]+55);\n\t\t}\n\t\t\t\n\t\telse a1[i]=char(a[i]+48);\n\t}\n\t\n\tfor(int j=0,i=count-1;i>=0,j<count;i--,j++)\n\t{\n\t\tif(\ta1[j]!=a1[i]) return 0;\n\t}\n\treturn 1;\n }\n\nusing namespace std;\nint main()\n{\n\tint N,S,m;\n\tcin>>N;\n\tcin>>S;\n\tfor(int i=S+1;i<1000000;i++)\n\t{\n\t\tint n=0;\n\t\tint a[20] = {0};\n\t\tfor(int j=2;j<11;j++)\n\t\t{\n\t\t\tif(judge(i,j)==1) a[j]=1;\n\t\t}\n\t\tfor(int k=0;k<20;k++)\n\t\t{\n\t\t\tif(a[k]==1) n++;\n\t\t}\n\t\t\n\t\tif(n>1) cout<<i<<endl;\n\t\tm++;\n\t\tif(m>N+1) break;\n\t}\n\treturn 0;\n}\t\n",WRONG_ANSWER,28,512
1277975549203382272,84d3f6df3802889023ec532137fd38f0e8712d7d814827915d6bd789ac649761,2020-06-30 22:41:29,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <bits/stdc++.h>\nint judge(int n,int m)//判断  m进制转化 \n{\n\tint a[10000];\n\tint count = 0;\n\tint temp;\n\tchar a1[10000];\n\twhile(n!=0)\n\t{\n\t\ttemp = n%m;\n\t\tn=n/m;\n\t\ta[count]=temp;\n\t\tcount++;\n\t}\n\tfor(int j=0,i=count-1;i>=0,j<count;i--,j++)\n\t{\n\t\tif(a[i]>=10)\n\t\t{\n\t\t\ta1[i]=char(a[i]+55);\n\t\t}\n\t\t\t\n\t\telse a1[i]=char(a[i]+48);\n\t}\n\t\n\tfor(int j=0,i=count-1;i>=0,j<count;i--,j++)\n\t{\n\t\tif(\ta1[j]!=a1[i]) return 0;\n\t}\n\treturn 1;\n }\n\nusing namespace std;\nint main()\n{\n\tint N,S,m;\n\tcin>>N;\n\tcin>>S;\n\tfor(int i=S+1;i<1000000;i++)\n\t{\n\t\tint n=0;\n\t\tint a[20] = {0};\n\t\tfor(int j=2;j<11;j++)\n\t\t{\n\t\t\tif(judge(i,j)==1) a[j]=1;\n\t\t}\n\t\tfor(int k=0;k<20;k++)\n\t\t{\n\t\t\tif(a[k]==1) n++;\n\t\t}\n\t\t\n\t\tif(n>1) cout<<i<<endl;\n\t\tm++;\n\t\tif(m>N) break;\n\t}\n\treturn 0;\n}\t\n",WRONG_ANSWER,35,516
1277975588243963904,7255daafd88731caf36f82fc865dccfdc4dd5d7ca08a1241fdcd18788df61c07,2020-06-30 22:41:38,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint a[100] = {};\nint tt = 0;\nint ans = 0;\nint JudgeNumber(int x,int y) {//x是数值，y是进制数\n\twhile (x) {\n\t\ta[++tt] = x % y;\n\t\tx = x / y;\n\t}\n\tfor (int i = 1; i <= tt; i++) {\n\t\tif (a[i] != a[tt + 1 - i]) {\n\t\t\treturn 0;\n\t\t}\n\t}\n\treturn 1;\t\n}//判断是否为回文数\nint main() {\n\tint n;//个数\n\tint s;//大小\n\tcin >> n >> s;\n\tint count = 0;\n\tfor (int i = s + 1; ans<n; i++) {\n\t\tfor (int j = 2; j <= 10; j++) {\n\t\t\tif (JudgeNumber(i, j)== 1) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tif (count >= 2) {\n\t\t\tcout << i << endl;\n\t\t\tans++;\n\t\t}\n\t}\n\treturn 0;\n}\n\n\n",SEGMENTATION_FAULT,35,500
1277976125626580992,67f4e3269b524926303e51f12e4c87a9bba053bc6c92d71e68e2db9238282124,2020-06-30 22:43:46,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nstring Change(int a,int B){ //十进制转化为B进制\n    string s=\""\""; char c;\n    while(a!=0){\n        int iSingle = a%B;\n        if (iSingle>9) {iSingle = iSingle-10+'A';\n                         c=char(iSingle);}//超过10的就变成字符A，B...\n        else c = char(iSingle + '0');  //通过ASCII码来转换\n        a/=B;\n        s=c+s; //越晚出来的就放在越前面\n                            //static_cast<char>(iSingle)+s 是错的：1变为char不是‘1’，是1对应的ASCII码；\n    }\n\n    return s;\n}\n\nint main(){\n    int B,flag=1;\n    cin>>B;\n    for (int i=1;i<301;i++){\n        string s = Change(i*i,B);\n        //cout<<i<<\"":\""<<s<<endl;\n        for (size_t i=0;i<s.size()/2+1;i++){\n            if (s[i]!=s[s.size()-i-1])\n                flag=0;}\n        if(flag) cout<<Change(i,B)<<\"" \""<<s<<endl;\n        flag=1;}\n\n    return 0;\n}\n",ACCEPTED,45,512
1277976196485144576,ba18e5a6c6a32e01f69118bebf499c8130708e5a9da14a9560f36931a7a36a7b,2020-06-30 22:44:03,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\nusing namespace std;\nint main(){\n    int N,S,j,k;\n    int a[100];\n    int b[100];\n    cin>>N>>S;\n    int v=0;\n    int F=0;\n    for(int n=S+1;;n++){\n        int t=n;\n        for(int R=2;R<11;R++){\n            int m=0;\n            while (n) {\n                a[m]=n%R;\n                m++;\n                n/=R;\n            }\n            for(k=0,j=m-1;k<m;k++,j--)\n                b[j]=a[k];\n            int p=0;\n            for (int x=0;x<m;x++){\n                if(a[x]==b[x])\n                    p++;\n            }\n            if (p==m)\n                v++;\n            n=t;\n\n        }\n        if(v>2){\n            cout<<n<<endl;\n            F++;\n        }\n        if (F>=N)\n            break;\n    }\n\n}",PARTIAL_ACCEPTED,30,424
1277976339695460352,7255daafd88731caf36f82fc865dccfdc4dd5d7ca08a1241fdcd18788df61c07,2020-06-30 22:44:37,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint a[1200] = {};\nint tt = 0;\nint ans = 0;\nint JudgeNumber(int x,int y) {//x是数值，y是进制数\n\twhile (x) {\n\t\ta[++tt] = x % y;\n\t\tx = x / y;\n\t}\n\tfor (int i = 1; i <= tt; i++) {\n\t\tif (a[i] != a[tt + 1 - i]) {\n\t\t\treturn 0;\n\t\t}\n\t}\n\treturn 1;\t\n}//判断是否为回文数\nint main() {\n\tint n;//个数\n\tint s;//大小\n\tcin >> n >> s;\n\tint count = 0;\n\tfor (int i = s + 1; ans<n; i++) {\n\t\tfor (int j = 2; j <= 10; j++) {\n\t\t\tif (JudgeNumber(i, j)== 1) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tif (count >= 2) {\n\t\t\tcout << i << endl;\n\t\t\tans++;\n\t\t}\n\t}\n\treturn 0;\n}\n\n\n",SEGMENTATION_FAULT,36,512
1277976494045847552,7255daafd88731caf36f82fc865dccfdc4dd5d7ca08a1241fdcd18788df61c07,2020-06-30 22:45:14,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint pd(int n,int k)\n{\n\tint p[1005];\n\tint t=0;\n\twhile(n!=0)\n\t{\n\t\tp[++t]=n%k;\n\t\tn/=k;\n\t}\n\tfor(int i=1,j=t;i<=t/2;i++,j--)\n\t\tif(p[i]!=p[j])\n\t\t\treturn 0;\n\treturn 1;\n}\n\nint main(){\n\tint n,s,ans=0;//ans为已经找到的个数\n\tcin>>n>>s;\n\tfor(int i=s+1;ans<n;i++)\n\t{\n\t\tint count=0;//count代表i在几个进制下是回文的\n\t\tfor(int j=2;j<=10;j++)//2~10进制枚举\n\t\t\tif(pd(i,j)==1)//判断，若j进制下是回文就count++\n\t\t\t\t++count;\n\t\tif(count>=2)//如果多于两个就代表是双重回文数\n\t\t{\n\t\t\t++ans;\n\t\t\tcout<<i<<endl;\n\t\t\t\n\t\t}\n\t}\n    return 0;\n}",ACCEPTED,41,520
1277977707076321280,7255daafd88731caf36f82fc865dccfdc4dd5d7ca08a1241fdcd18788df61c07,2020-06-30 22:50:03,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint JudgeNumber(int x,int y) {//x是数值，y是进制数\n\tint tt = 0;\n\tint a[1200] = {};\n\twhile (x) {\n\t\ta[++tt] = x % y;\n\t\tx = x / y;\n\t}\n\tfor (int i = 1; i <= tt; i++) {\n\t\tif (a[i] != a[tt + 1 - i]) {\n\t\t\treturn 0;\n\t\t}\n\t}\n\treturn 1;\t\n}//判断是否为回文数\nint main() {\n\tint n;//个数\n\tint s;//大小\n\tcin >> n >> s;\n\tint count = 0;\n\tint ans = 0;\n\tfor (int i = s + 1; ans<n; i++) {\n\t\tfor (int j = 2; j <= 10; j++) {\n\t\t\tif (JudgeNumber(i, j)== 1) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tif (count >= 2) {\n\t\t\tans++;\n\t\t\tcout << i << endl;\n\t\t}\n\t}\n\treturn 0;\n}\n\n\n",PARTIAL_ACCEPTED,34,488
1277978164725211136,7255daafd88731caf36f82fc865dccfdc4dd5d7ca08a1241fdcd18788df61c07,2020-06-30 22:51:52,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint JudgeNumber(int x, int y) {//x是数值，y是进制数\n\tint tt = 0;\n\tint a[1200] = {};\n\twhile (x) {\n\t\ta[++tt] = x % y;\n\t\tx = x / y;\n\t}\n\tfor (int i = 1,j=tt; i <= tt/2; i++,j--) {\n\t\tif (a[i] != a[j]) {\n\t\t\treturn 0;\n\t\t}\n\t}\n\treturn 1;\n}//判断是否为回文数\nint main() {\n\tint n;//个数\n\tint s;//大小\n\tcin >> n >> s;\n\tint count = 0;\n\tint ans = 0;\n\tfor (int i = s + 1; ans < n; i++) {\n\t\tfor (int j = 2; j <= 10; j++) {\n\t\t\tif (JudgeNumber(i, j) == 1) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tif (count >= 2) {\n\t\t\tans++;\n\t\t\tcout << i << endl;\n\t\t}\n\t}\n\treturn 0;\n}\n\n",PARTIAL_ACCEPTED,37,592
1277978260988682240,4be75d8115b6c47132d131369bdafc8b7ddb12eca0694e54220169517cb1c367,2020-06-30 22:52:15,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<vector>\nusing namespace std;\nint trans(int n,int B)\n{\n\tint w = 0, z;\n\tint b[10];\n\twhile (n != 0) {    \n\t\tz = n % B;//这个映射是反序的！回文数倒过来一样，原数需要调整\n\t\tb[w] = z+48;//char b[]需要0的字符，‘0’对应48\n\t\tn/=B;\n\t\tw++;\n\t}\n\tb[w] = '0';\n\treturn w;//求出位数\n}\n\nbool judge(int w)//利用位数来判断\n{\n\tint b[10];\n\tfor (int i = 0; i <= w / 2; i++) {\n\t\tif (b[i] != b[w - 1 - i]) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nint main()\n{\n\tint N, S,x=0;\n\tcin >> N >> S;\n\tfor (int i=S+1;x<N ;i++)\n\t{\n\t\tint y=0;\n\t\tfor (int j = 2; j <= 10; j++)\n\t\t{\n\t\t\tif (judge(trans(N, j))) {\n\t\t\t\ty++;\n\t\t\t}\n\t\t}\n\t\tif (y >= 2&&x<3) {\n\t\t\tcout << i<<endl;\n\t\t\tx++;\n\t\t}\n\t}\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,0,0
1277978312683479040,ba18e5a6c6a32e01f69118bebf499c8130708e5a9da14a9560f36931a7a36a7b,2020-06-30 22:52:28,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\nusing namespace std;\nint main(){\n    int N,S,j,k;\n    int a[100];\n    int b[100];\n    cin>>N>>S;\n    int F=0;\n    for(int n=S+1;;n++){\n        int t=n;\n        int v=0;\n        for(int R=2;R<11;R++){\n            int m=0;\n            while (n) {\n                a[m]=n%R;\n                m++;\n                n/=R;\n            }\n            for(k=0,j=m-1;k<m;k++,j--)\n                b[j]=a[k];\n            int p=0;\n            for (int x=0;x<m;x++){\n                if(a[x]==b[x])\n                    p++;\n            }\n            if (p==m)\n                v++;\n            n=t;\n\n        }\n        if(v>2){\n            cout<<n<<endl;\n            F++;\n        }\n        if (F>=N)\n            break;\n    }\n\n}",PARTIAL_ACCEPTED,381,552
1277978639419760640,7255daafd88731caf36f82fc865dccfdc4dd5d7ca08a1241fdcd18788df61c07,2020-06-30 22:53:45,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint JudgeNumber(int x, int y) {//x是数值，y是进制数\n\tint tt = 0;\n\tint a[1200] ;\n\twhile (x!=0) {\n\t\ta[++tt] = x % y;\n\t\tx = x / y;\n\t}\n\tfor (int i = 1,j=tt; i <= tt/2; i++,j--) {\n\t\tif (a[i] != a[j]) {\n\t\t\treturn 0;\n\t\t}\n\t}\n\treturn 1;\n}//判断是否为回文数\nint main() {\n\tint n;//个数\n\tint s;//大小\n\tcin >> n >> s;\n\tint ans = 0;\n\tfor (int i = s + 1; ans < n; i++) {\n        int count=0;\n\t\tfor (int j = 2; j <= 10; j++) {\n\t\t\tif (JudgeNumber(i, j) == 1) {\n\t\t\t\t++count;\n\t\t\t}\n\t\t}\n\t\tif (count >= 2) {\n\t\t\t++ans;\n\t\t\tcout << i << endl;\n\t\t}\n\t}\n\treturn 0;\n}\n\n",ACCEPTED,37,512
1277978763789262848,afbe3dd44dd174a47bc8fc4e72e8b1c926d31aa15a5454a9bb85155d6b0804f5,2020-06-30 22:54:15,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint main()\n{\n\tint a, b, j, n=0, number[100];                  //储存进制运算余数\n\tint yep[300] = {0};                                       //储存符合条件十进制数\n\tcin >> a;\n\tfor (int i = 1; i <= 11; i++) {\n\t\tj = i * i;                                           //进制转换\n\t\tint m = 0;\n\t\twhile (j!=0)\n\t\t{\n\t\t\tb = j % a;\n\t\t\tj = j / a;\n\t\t\tnumber[m] = b;\n\t\t\tm++;\n\t\t}                                                       //判断回文\n\t\tint flag = 1;\n\t\tfor (int k = 0; k <=(m+1) / 2; k++) {\n\t\t\tif (number[k] != number[m - k - 1]) { flag = 0; break; }\n\t\t}\n\t\tif (flag == 1) { yep[n] = i; n++; }\n\t}\n\t                                                              //输出\n\tint number1[100];\n\tfor (int i = 0; i < n; i++) {\n\t\tint q = 0;\n\t\twhile (yep[i] != 0) {\n\t\t\tj = yep[i];\n\t\t\tb = j % a;\n\t\t\tj = j / a;\n\t\t\tnumber1[q] = b;\n\t\t\tq++;\n\t\t}\n\t\tfor (int k = q - 1; k >= 0; k--) {\n\t\t\tif (number1[k] >= 10) { cout << (char)(number1[k] + 55); }\n\t\t\telse { cout << number1[k]; }\n\t\t}\n\t\tcout << \"" \"";\n\t\tq = 0;\n\t\twhile (yep[i] > 0) {\n\t\t\tj = yep[i]*yep[i];\n\t\t\tb = j % a;\n\t\t\tj = j / a;\n\t\t\tnumber1[q] = b;\n\t\t\tq++;\n\t\t}\n\t\tfor (int k = q - 1; k >= 0; k--) {\n\t\t\tif (number1[k] >= 10) { cout << (char)(number1[k] + 55); }\n\t\t\telse { cout << number1[k]; }\n\t\t}\n\t\tcout << endl;\n\t}\n\treturn 0;\n}",MULTIPLE_ERROR,32,428
1277978823226744832,f8b263609a898c5499c07fc9ba7bcd00e46a82e38e73d327331416411a74e117,2020-06-30 22:54:29,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string.h>\nusing namespace std;\n\nconst string numbers = \""0123456789\"";   //进制转换\nstring transf(int line, int b)\n{\n    string result = \""\"";\n    int remainder;\n    while (line > 0)\n    {\n        remainder = line % b;\n        result += numbers[remainder];\n        line -= remainder;\n        line /= b;\n    }\n    string reverse(result.rbegin(),result.rend());\n    return reverse;\n}\n\nbool judge(string line) //判断是否回文\n{\n    return line == string(line.rbegin(),line.rend());\n}\n\nbool twomore(int line)  //判断是否在至少两次进制里为回文\n{\n    int basetype = 0;\n    for (int base = 2; base <= 10; base++)\n    {\n        if (judge(transf(line,base)))\n        {\n            basetype++;\n        }\n        if (basetype >= 2)\n        {\n            return true;\n        }\n    }\n    return false;\n}\n\nint main()\n{\n    int N,S;   //N个大于S\n    cin >> N >> S;\n    \n    for (int i = S + 1; N > 0; i++)  //i并没有上限，只需找出前N个符合条件的,有N控制\n    {\n       if (twomore(i))\n       {\n           cout << i << endl;\n           N--;\n       }\n    }\n    return 0;\n}\n",ACCEPTED,46,532
1277978914901647360,afbe3dd44dd174a47bc8fc4e72e8b1c926d31aa15a5454a9bb85155d6b0804f5,2020-06-30 22:54:51,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint main()\n{\n\tint a, b, j, n=0, number[100];                  //储存进制运算余数\n\tint yep[300] = {0};                                       //储存符合条件十进制数\n\tcin >> a;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tj = i * i;                                           //进制转换\n\t\tint m = 0;\n\t\twhile (j!=0)\n\t\t{\n\t\t\tb = j % a;\n\t\t\tj = j / a;\n\t\t\tnumber[m] = b;\n\t\t\tm++;\n\t\t}                                                       //判断回文\n\t\tint flag = 1;\n\t\tfor (int k = 0; k <=(m+1) / 2; k++) {\n\t\t\tif (number[k] != number[m - k - 1]) { flag = 0; break; }\n\t\t}\n\t\tif (flag == 1) { yep[n] = i; n++; }\n\t}\n\t                                                              //输出\n\tint number1[100];\n\tfor (int i = 0; i < n; i++) {\n\t\tint q = 0;\n\t\twhile (yep[i] != 0) {\n\t\t\tj = yep[i];\n\t\t\tb = j % a;\n\t\t\tj = j / a;\n\t\t\tnumber1[q] = b;\n\t\t\tq++;\n\t\t}\n\t\tfor (int k = q - 1; k >= 0; k--) {\n\t\t\tif (number1[k] >= 10) { cout << (char)(number1[k] + 55); }\n\t\t\telse { cout << number1[k]; }\n\t\t}\n\t\tcout << \"" \"";\n\t\tq = 0;\n\t\twhile (yep[i] > 0) {\n\t\t\tj = yep[i]*yep[i];\n\t\t\tb = j % a;\n\t\t\tj = j / a;\n\t\t\tnumber1[q] = b;\n\t\t\tq++;\n\t\t}\n\t\tfor (int k = q - 1; k >= 0; k--) {\n\t\t\tif (number1[k] >= 10) { cout << (char)(number1[k] + 55); }\n\t\t\telse { cout << number1[k]; }\n\t\t}\n\t\tcout << endl;\n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,40,512
1277978971185012736,4be75d8115b6c47132d131369bdafc8b7ddb12eca0694e54220169517cb1c367,2020-06-30 22:55:05,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<vector>\nusing namespace std;\nint b[10];\nint trans(int n,int B)\n{\n\tint w = 0, z;\n\twhile (n != 0) {    \n\t\tz = n % B;\n\t\tb[w] = z+48;\n\t\tn/=B;\n\t\tw++;\n\t}\n\tb[w] = '/0';\n\treturn w;\n}\n\nbool judge(int w)\n{\n\tfor (int i = 0; i <= w / 2; i++) {\n\t\tif (b[i] != b[w - 1 - i]) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nint main()\n{\n\tint N, S,x=0;\n\tcin >> N >> S;\n\tfor (int i=S+1;x<N ;i++)\n\t{\n\t\tint y=0;\n\t\tfor (int j = 2; j <= 10; j++)\n\t\t{\n\t\t\tif (judge(trans(N, j))) {\n\t\t\t\ty++;\n\t\t\t}\n\t\t}\n\t\tif (y >= 2&&x<3) {\n\t\t\tcout << i<<endl;\n\t\t\tx++;\n\t\t}\n\t}\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,0,0
1277979748192411648,e39cca8043cb19013671c440a202a288f7f87c73afe6761b2bd045987b1a86c5,2020-06-30 22:58:10,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstdlib>\n#include<cstdio>\n#include<cstring>\n\nusing namespace std;\nint* b;\nint N, S;\nint l = 0;\n\nvoid change(int k, int B) {\n    b = new int[500];\n    l = 0;\n    do {\n        b[++l] = k % B;\n        k /= B;\n    } while (k != 0);\n\n}\n\nbool check() {\n    for (int i = 1; i <= l / 2; i++)\n        if (b[i] != b[l - i + 1])\n            return false;\n    return true;\n}\n\nint main() {\n    int k = 0, h = 0, n;\n    cin >> N >> S;\n    n = S + 1;\n    while (k < N) {\n        h = 0;\n        for (int j = 2; j <= 10; j++) {\n            change(n, j);\n            if (check() == 1)\n                h++;\n            delete b;\n        }\n        if (h > 1) {\n            cout << n << endl;\n            k++;\n        }\n        n++;\n\n    }\n    return 0;\n}\n\n\n\n",ACCEPTED,39,424
1277979792865951744,4be75d8115b6c47132d131369bdafc8b7ddb12eca0694e54220169517cb1c367,2020-06-30 22:58:20,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint b[10];\nint trans(int n,int B)\n{\n\tint w = 0, z;\n\twhile (n != 0) {    \n\t\tz = n % B;\n\t\tb[w] = z+48;\n\t\tn/=B;\n\t\tw++;\n\t}\n\tb[w] = '/0';\n\treturn w;\n}\n\nbool judge(int w)\n{\n\tfor (int i = 0; i <= w / 2; i++) {\n\t\tif (b[i] != b[w - 1 - i]) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\nint main()\n{\n\tint N, S,x=0;\n\tcin >> N >> S;\n\tfor (int i=S+1;x<N ;i++)\n\t{\n\t\tint y=0;\n\t\tfor (int j = 2; j <= 10; j++)\n\t\t{\n\t\t\tif (judge(trans(N, j))) {\n\t\t\t\ty++;\n\t\t\t}\n\t\t}\n\t\tif (y >= 2) {\n\t\t\tcout << i<<endl;\n\t\t\tx++;\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,21,488
1277979807093030912,5f6fe5ec2e9f1448b66bc330cc1ed4d1d67a835fd6cdce39f4a1bed8c73e173d,2020-06-30 22:58:24,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream> \nusing namespace std;\nint main()\n{\n\tint B;\n\tcin >> B;\n\tint i;\n\tint l;\n\tint ch[200];\n\tint m,p,j;\n\tint f;\n\tfor (i = 1; i < 301; i++)\n\t{\n\t\tf = 1;\n\t\tl = i*i;\n\t\tm = 0;\n\t\twhile (l != 0)\n\t\t{\n\t\t\tp = l % B;\n\t\t\tl = l / B;\n\t\t\tm++;\n\t\t\tch[m] = p;\n\t\t}\n\t\tfor (j = 1; j <= m; j++)\n\t\t{\n\t\t\tif (ch[j] != ch[m + 1 - j])\n\t\t\t\tf = 0;\n\t\t}\n\t\tif (f == 1)\n\t\t{\n\t\t\tcout << i << ' ';\n\t\t\tfor (j = 1; j <= m; j++)\n\t\t\t\tcout << ch[j];\n\t\t\tcout << endl;\n\t\t}\n\t\t\n\t}\n\tsystem(\""pause\"");\n\treturn 0;\n}\n",PARTIAL_ACCEPTED,39,552
1277979857315618816,4be75d8115b6c47132d131369bdafc8b7ddb12eca0694e54220169517cb1c367,2020-06-30 22:58:36,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint b[10];\nint trans(int n,int B)\n{\n\tint w = 0, z;\n\twhile (n != 0) {    \n\t\tz = n % B;\n\t\tb[w] = z+48;\n\t\tn/=B;\n\t\tw++;\n\t}\n\tb[w] = '0';\n\treturn w;\n}\n\nbool judge(int w)\n{\n\tfor (int i = 0; i <= w / 2; i++) {\n\t\tif (b[i] != b[w - 1 - i]) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\nint main()\n{\n\tint N, S,x=0;\n\tcin >> N >> S;\n\tfor (int i=S+1;x<N ;i++)\n\t{\n\t\tint y=0;\n\t\tfor (int j = 2; j <= 10; j++)\n\t\t{\n\t\t\tif (judge(trans(N, j))) {\n\t\t\t\ty++;\n\t\t\t}\n\t\t}\n\t\tif (y >= 2) {\n\t\t\tcout << i<<endl;\n\t\t\tx++;\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,23,492
1277979932343328768,ef2af74cf216d6156aa85f981ccf11bf345b812d2b02ec465e9880def4bf24ac,2020-06-30 22:58:54,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<math.h>\nusing namespace std;\n\nint main()\n{int *change(int x,int b);\nint number(int x,int b);\nint Judge(int n[],int I);\nint N,S,x,b,t1=0,t2=0,*num,I;cin>>N>>S;\nfor(x=S+1;t2<N;x++)\n\t{for(b=2;b<=10;b++)\n\t\t{I=number(x,b);\n\t\tnum=change(x,b);\n\t\tif(Judge(num,I))t1++;\n\t\t}\n\tif(t1>=2)\n\t\t{cout<<x<<endl;\n\t\tt2++;\n\t\t}\n\tt1=0;\n\t}\nreturn 0;\n}\n\nint *change(int x,int b)\n{int number(int x,int b);\nconst int I=number(x,b);int i,p,n[I];\nfor(i=I-1;i>=0;i--)\n\t{p=pow(b,i);\n\tn[I-1-i]=x/p;\n\tx%=p;\n\t}\nreturn n;\n}\n\nint number(int x,int b)\n{int i,p=1;\nfor(i=1;x%p<x;i++)\n\tp=pow(b,i);\nreturn i-1;\n}\n\nint Judge(int n[],int I)\n{int i;\nfor(i=0;i<I-1-i;i++)\n\tif(n[i]!=n[I-1-i])return 0;\nreturn 1;\n}",SEGMENTATION_FAULT,32,512
1277980477426688000,4be75d8115b6c47132d131369bdafc8b7ddb12eca0694e54220169517cb1c367,2020-06-30 23:01:04,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint b[10];\nint trans(int n,int B)\n{\n\tint w = 0, z;\n\twhile (n != 0) {    \n\t\tz = n % B;\n\t\tb[w] = z+48;\n\t\tn/=B;\n\t\tw++;\n\t}\n\tb[w] = '\\0';\n\treturn w;\n}\n\nbool judge(int w)\n{\n\tfor (int i = 0; i <= w / 2; i++) {\n\t\tif (b[i] != b[w - 1 - i]) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\nint main()\n{\n\tint N, S,x=0;\n\tcin >> N >> S;\n\tfor (int i=S+1;x<N ;i++)\n\t{\n\t\tint y=0;\n\t\tfor (int j = 2; j <= 10; j++)\n\t\t{\n\t\t\tif (judge(trans(N, j))) {\n\t\t\t\ty++;\n\t\t\t}\n\t\t}\n\t\tif (y >= 2) {\n\t\t\tcout << i<<endl;\n\t\t\tx++;\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,22,728
1277981118391844864,84d3f6df3802889023ec532137fd38f0e8712d7d814827915d6bd789ac649761,2020-06-30 23:03:37,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <bits/stdc++.h>\nint judge(int n,int m)//判断  m进制转化 \n{\n\tint a[10000];\n\tint count = 0;\n\tint temp;\n\tchar a1[10000];\n\twhile(n!=0)\n\t{\n\t\ttemp = n%m;\n\t\tn=n/m;\n\t\ta[count]=temp;\n\t\tcount++;\n\t}\n\tfor(int j=0,i=count-1;i>=0,j<count;i--,j++)\n\t{\n\t\tif(a[i]>=10)\n\t\t{\n\t\t\ta1[i]=char(a[i]+55);\n\t\t}\n\t\t\t\n\t\telse a1[i]=char(a[i]+48);\n\t}\n\t\n\tfor(int j=0,i=count-1;i>=0,j<count;i--,j++)\n\t{\n\t\tif(\ta1[j]!=a1[i]) return 0;\n\t}\n\treturn 1;\n }\n\nusing namespace std;\nint main()\n{\n\tint N,S,m=0;\n\tcin>>N;\n\tcin>>S;\n\tfor(int i=S+1;i<200000;i++)\n\t{\n\t\tint n=0;\n\t\tint a[20] = {0};\n\t\tfor(int j=2;j<11;j++)\n\t\t{\n\t\t\tif(judge(i,j)==1) \n\t\t\t{\n\t\t\t\ta[j]=1;\n\t\t\t}\n\t\t}\n\t\tfor(int k=0;k<20;k++)\n\t\t{\n\t\t\tif(a[k]==1) n++;\n\t\t}\n\t\t\n\t\tif(n>1) \n\t\t{\n\t\t\tcout<<i<<endl;\n\t\t\tm++;\n\t\t}\n\t\tif(m>=N) break;\n\t}\n\treturn 0;\n}\t\n",ACCEPTED,34,512
1277981610568245248,a2aa1426aec01768a802bb92f8567a460e4bf01e8123342ad6f277b04a66812b,2020-06-30 23:05:34,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<vector>\n#include<cmath>\nusing namespace std;\nvoid convertToB(vector<char>&number,int square,int n)\n{\n\tint m,value,temp,len;\n\tint flag=log(square)/log(n);\n\tint num=flag+1;\n\twhile(square>0)\n\t{\n\t\tm=log(square)/log(n);\n\t\t//处理中间的0 \n\t\tlen=flag-m;\n\t\tfor(len;len>1;len--)\n\t\t\tnumber.push_back(48);\n\t\tflag=m;\n\t\ttemp=pow(n,m);\n\t\tvalue=square/temp;\n\t\tif(value<10)\n\t\t\tnumber.push_back(value+48);\n\t\telse\n\t\t\tnumber.push_back(value+55); \n\t\tsquare=square%temp;\n\t}\n\t//处理末尾的0 \n\tint length=number.size(); \n\tif(length<num)\n\t{\n\t\tint zero=num-length;\n\t\tfor(int i=0;i<zero;i++)\n\t\t\tnumber.push_back(48);\n\t}\n}\nbool judge(vector<char>&number)\n{\n\tint length=number.size();\n\tfor(int i=0,j=length-1;i<=j;i++,j--)\n\t{\n\t\tif(number[i]!=number[j])\n\t\t\treturn false;\n\t}\n\treturn true;\n}\nint main()\n{\n\tint N,S;\n\tcin>>N>>S;\n\tint num=0;\n\tvector<char>number;\n\tfor(int i=S+1;;i++)\n\t{\n\t\tint flag=0;\n\t\tfor(int j=2;j<=10;j++)\n\t\t{\n\t\t\tnumber.clear();\n\t\t\tconvertToB(number,i,j);\n\t\t\tif(judge(number))\n\t\t\t{\n\t\t\t\tfor(int m=j+1;m<=10;m++)\n\t\t\t\t{\n\t\t\t\t\tnumber.clear();\n\t\t\t\t\tconvertToB(number,i,m);\n\t\t\t\t\tif(judge(number))\n\t\t\t\t\t{\n\t\t\t\t\t\tcout<<i<<endl;\n\t\t\t\t\t\tnum++;\n\t\t\t\t\t\tflag==1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(flag==0)\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(flag==1)\n\t\t\t\tbreak;\n\t\t} \n\t\tif(num==3)\n\t\t\treturn 0;\n\t}\n} ",WRONG_ANSWER,40,512
1277981886595399680,ba18e5a6c6a32e01f69118bebf499c8130708e5a9da14a9560f36931a7a36a7b,2020-06-30 23:06:40,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\nusing namespace std;\nint main(){\n    int N,S,j,k;\n    int a[100];\n    int b[100];\n    cin>>N>>S;\n    int F=0;\n    for(int n=S+1;;n++){\n        int t=n;\n        int v=0;\n        for(int R=2;R<11;R++){\n            int m=0;\n            while (n) {\n                a[m]=n%R;\n                m++;\n                n/=R;\n            }\n            for(k=0,j=m-1;k<m;k++,j--)\n                b[j]=a[k];\n            int p=0;\n            for (int x=0;x<m;x++){\n                if(a[x]==b[x])\n                    p++;\n            }\n            if (p==m)\n                v++;\n            n=t;\n\n        }\n        if(v>1){\n            cout<<n<<endl;\n            F++;\n        }\n        if (F>=N)\n            break;\n    }\n}",ACCEPTED,24,548
1277981939179388928,a2aa1426aec01768a802bb92f8567a460e4bf01e8123342ad6f277b04a66812b,2020-06-30 23:06:52,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<vector>\n#include<cmath>\nusing namespace std;\nvoid convertToB(vector<char>&number,int square,int n)\n{\n\tint m,value,temp,len;\n\tint flag=log(square)/log(n);\n\tint num=flag+1;\n\twhile(square>0)\n\t{\n\t\tm=log(square)/log(n);\n\t\t//处理中间的0 \n\t\tlen=flag-m;\n\t\tfor(len;len>1;len--)\n\t\t\tnumber.push_back(48);\n\t\tflag=m;\n\t\ttemp=pow(n,m);\n\t\tvalue=square/temp;\n\t\tif(value<10)\n\t\t\tnumber.push_back(value+48);\n\t\telse\n\t\t\tnumber.push_back(value+55); \n\t\tsquare=square%temp;\n\t}\n\t//处理末尾的0 \n\tint length=number.size(); \n\tif(length<num)\n\t{\n\t\tint zero=num-length;\n\t\tfor(int i=0;i<zero;i++)\n\t\t\tnumber.push_back(48);\n\t}\n}\nbool judge(vector<char>&number)\n{\n\tint length=number.size();\n\tfor(int i=0,j=length-1;i<=j;i++,j--)\n\t{\n\t\tif(number[i]!=number[j])\n\t\t\treturn false;\n\t}\n\treturn true;\n}\nint main()\n{\n\tint N,S;\n\tcin>>N>>S;\n\tint num=0;\n\tvector<char>number;\n\tfor(int i=S+1;;i++)\n\t{\n\t\tint flag=0;\n\t\tfor(int j=2;j<=10;j++)\n\t\t{\n\t\t\tnumber.clear();\n\t\t\tconvertToB(number,i,j);\n\t\t\tif(judge(number))\n\t\t\t{\n\t\t\t\tfor(int m=j+1;m<=10;m++)\n\t\t\t\t{\n\t\t\t\t\tnumber.clear();\n\t\t\t\t\tconvertToB(number,i,m);\n\t\t\t\t\tif(judge(number))\n\t\t\t\t\t{\n\t\t\t\t\t\tcout<<i<<endl;\n\t\t\t\t\t\tnum++;\n\t\t\t\t\t\tflag=1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(flag==0)\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(flag==1)\n\t\t\t\tbreak;\n\t\t} \n\t\tif(num==3)\n\t\t\treturn 0;\n\t}\n} ",WRONG_ANSWER,40,384
1277982598612049920,a2aa1426aec01768a802bb92f8567a460e4bf01e8123342ad6f277b04a66812b,2020-06-30 23:09:29,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<vector>\n#include<cmath>\nusing namespace std;\nvoid convertToB(vector<char>&number,int square,int n)\n{\n\tint m,value,temp,len;\n\tint flag=log(square)/log(n);\n\tint num=flag+1;\n\twhile(square>0)\n\t{\n\t\tm=log(square)/log(n);\n\t\t//处理中间的0 \n\t\tlen=flag-m;\n\t\tfor(len;len>1;len--)\n\t\t\tnumber.push_back(48);\n\t\tflag=m;\n\t\ttemp=pow(n,m);\n\t\tvalue=square/temp;\n\t\tif(value<10)\n\t\t\tnumber.push_back(value+48);\n\t\telse\n\t\t\tnumber.push_back(value+55); \n\t\tsquare=square%temp;\n\t}\n\t//处理末尾的0 \n\tint length=number.size(); \n\tif(length<num)\n\t{\n\t\tint zero=num-length;\n\t\tfor(int i=0;i<zero;i++)\n\t\t\tnumber.push_back(48);\n\t}\n}\nbool judge(vector<char>&number)\n{\n\tint length=number.size();\n\tfor(int i=0,j=length-1;i<=j;i++,j--)\n\t{\n\t\tif(number[i]!=number[j])\n\t\t\treturn false;\n\t}\n\treturn true;\n}\nint main()\n{\n\tint N,S;\n\tcin>>N>>S;\n\tint num=0;\n\tvector<char>number;\n\tfor(int i=S+1;;i++)\n\t{\n\t\tint flag=0;\n\t\tfor(int j=2;j<=10;j++)\n\t\t{\n\t\t\tnumber.clear();\n\t\t\tconvertToB(number,i,j);\n\t\t\tif(judge(number))\n\t\t\t{\n\t\t\t\tfor(int m=j+1;m<=10;m++)\n\t\t\t\t{\n\t\t\t\t\tnumber.clear();\n\t\t\t\t\tconvertToB(number,i,m);\n\t\t\t\t\tif(judge(number))\n\t\t\t\t\t{\n\t\t\t\t\t\tcout<<i<<endl;\n\t\t\t\t\t\tnum++;\n\t\t\t\t\t\tflag=1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(flag==0)\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(flag==1)\n\t\t\t\tbreak;\n\t\t} \n\t\tif(num==3)\n\t\t\treturn 0;\n\t}\n} ",WRONG_ANSWER,33,488
1277982650671751168,27ff531dca209d27f05a912acc9c18be0ac1190606526d88ed6be14bdd8e82cc,2020-06-30 23:09:42,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<cstdio>\n#include<cstring>\n#include<algorithm>\nusing namespace std;\nint b;\ninline char c(int x){if(x>=0&&x<=9)return x+'0';return x-10+'A';}\nstruct node\n{\n    int l,a[20];//进制数最大长度为17\n    node(int x){for(l=0;x;l++)a[l]=x%b,x/=b;}//转换进制数，其中a[l-1]是最高位，a[0]是最低位\n    void out(){for(int i=l-1;i>=0;i--)printf(\""%c\"",c(a[i]));}//从高到低依次输出\n    bool tf(){for(int i=0;i<l;i++)if(a[i]!=a[l-i-1])return false;return true;}//判断这个数字是否是回文数，注意可以通过i<=l/2来加速，减少冗余运算\n};\nint main()\n{\n    scanf(\""%d\"",&b);\n    for(int i=1;i<=300;i++)//从1到300暴力枚举\n    {\n        node n(i*i);//将i*i转化为进制为b的整数\n        if(n.tf()){node m(i);m.out();putchar(' ');n.out();putchar('\\n');}//如果n是一个b进制下的回文数，输出答案\n    }\n    return 0;\n}",ACCEPTED,24,384
1277983197990674432,a2aa1426aec01768a802bb92f8567a460e4bf01e8123342ad6f277b04a66812b,2020-06-30 23:11:52,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<vector>\n#include<cmath>\nusing namespace std;\nvoid convertToB(vector<char>&number,int square,int n)\n{\n\tint m,value,temp,len;\n\tint flag=log(square)/log(n);\n\tint num=flag+1;\n\twhile(square>0)\n\t{\n\t\tm=log(square)/log(n);\n\t\t//处理中间的0 \n\t\tlen=flag-m;\n\t\tfor(len;len>1;len--)\n\t\t\tnumber.push_back(48);\n\t\tflag=m;\n\t\ttemp=pow(n,m);\n\t\tvalue=square/temp;\n\t\tif(value<10)\n\t\t\tnumber.push_back(value+48);\n\t\telse\n\t\t\tnumber.push_back(value+55); \n\t\tsquare=square%temp;\n\t}\n\t//处理末尾的0 \n\tint length=number.size(); \n\tif(length<num)\n\t{\n\t\tint zero=num-length;\n\t\tfor(int i=0;i<zero;i++)\n\t\t\tnumber.push_back(48);\n\t}\n}\nbool judge(vector<char>&number)\n{\n\tint length=number.size();\n\tfor(int i=0,j=length-1;i<=j;i++,j--)\n\t{\n\t\tif(number[i]!=number[j])\n\t\t\treturn false;\n\t}\n\treturn true;\n}\nint main()\n{\n\tint N,S;\n\tcin>>N>>S;\n\tint num=0;\n\tvector<char>number;\n\tfor(int i=S+1;;i++)\n\t{\n\t\tint flag=0;\n\t\tfor(int j=2;j<=10;j++)\n\t\t{\n\t\t\tnumber.clear();\n\t\t\tconvertToB(number,i,j);\n\t\t\tif(judge(number))\n\t\t\t{\n\t\t\t\tfor(int m=j+1;m<=10;m++)\n\t\t\t\t{\n\t\t\t\t\tnumber.clear();\n\t\t\t\t\tconvertToB(number,i,m);\n\t\t\t\t\tif(judge(number))\n\t\t\t\t\t{\n\t\t\t\t\t\tcout<<i<<endl;\n\t\t\t\t\t\tnum++;\n\t\t\t\t\t\tflag=1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(flag==0)\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(flag==1)\n\t\t\t\tbreak;\n\t\t} \n\t\tif(num==N)\n\t\t\treturn 0;\n\t}\n} ",ACCEPTED,44,528
1277983769749815296,4be75d8115b6c47132d131369bdafc8b7ddb12eca0694e54220169517cb1c367,2020-06-30 23:14:09,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint b[10];\nint trans(int n,int B)\n{\n\tint w = 0, z;\n\twhile (n != 0) {    \n\t\tz = n % B;\n\t\tb[w] = z+48;\n\t\tn/=B;\n\t\tw++;\n\t}\n\tb[w] = '\\0';\n\treturn w;\n}\n\nbool judge(int w)\n{\n\tfor (int i = 0; i <= w / 2; i++) {\n\t\tif (b[i] != b[w - 1 - i]) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\nint main()\n{\n\tint N, S,x=0;\n\tcin >> N >> S;\n\tfor (int i=S+1;x<N ;i++)\n\t{\n\t\tint y=0;\n\t\tfor (int j = 2; j <= 10; j++)\n\t\t{\n\t\t\tif (judge(trans(i, j))) {\n\t\t\t\ty++;\n\t\t\t}\n\t\t}\n\t\tif (y >= 2) {\n\t\t\tcout << i<<endl;\n\t\t\tx++;\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,38,496
1277983817044787200,5f6fe5ec2e9f1448b66bc330cc1ed4d1d67a835fd6cdce39f4a1bed8c73e173d,2020-06-30 23:14:20,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream> \nusing namespace std;\nint main()\n{\n\tint B;\n\tcin >> B;\n\tint i;\n\tint l;\n\tint ch[200];int c[10];\n\tint m,p,j,t;\n\tint f;\n\tint tam;\n\tfor (i = 1; i < 301; i++)\n\t{\n\t\tt = 0;\n\t\tf = 1;\n\t\tl = i*i;\n\t\tm = 0;\n\t\twhile (l != 0)\n\t\t{\n\t\t\tp = l % B;\n\t\t\tl = l / B;\n\t\t\tm++;\n\t\t\tch[m] = p;\n\t\t}\n\t\tfor (j = 1; j <= m; j++)\n\t\t{\n\t\t\tif (ch[j] != ch[m + 1 - j])\n\t\t\t{\n\t\t\t\tf = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (f == 1)\n\t\t{\n\t\t\ttam = i;\n\t\t\twhile (tam != 0)\n\t\t\t{\n\t\t\t\tp = tam % B;\n\t\t\t\ttam = tam / B;\n\t\t\t\tt++;\n\t\t\t\tc[t] = p;\n\t\t\t}\n\t\t\tfor (j = 1; j <= t; j++)\n\t\t\t\tcout << c[j];\n\t\t\tcout << ' ';\n\t\t\tfor (j = 1; j <= m; j++)\n\t\t\t\tcout << ch[j];\n\t\t\tcout << endl;\n\t\t}\n\t\t\n\t}\n\tsystem(\""pause\"");\n\treturn 0;\n}",PARTIAL_ACCEPTED,43,552
1277984179860471808,5f6fe5ec2e9f1448b66bc330cc1ed4d1d67a835fd6cdce39f4a1bed8c73e173d,2020-06-30 23:15:46,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream> \nusing namespace std;\nint main()\n{\n\tint B;\n\tcin >> B;\n\tint i;\n\tint l;\n\tint ch[200];int c[10];\n\tint m,p,j,t;\n\tint f;\n\tint tam;\n\tfor (i = 1; i < 301; i++)\n\t{\n\t\tt = 0;\n\t\tf = 1;\n\t\tl = i*i;\n\t\tm = 0;\n\t\twhile (l != 0)\n\t\t{\n\t\t\tp = l % B;\n\t\t\tl = l / B;\n\t\t\tm++;\n\t\t\tch[m] = p;\n\t\t}\n\t\tfor (j = 1; j <= m; j++)\n\t\t{\n\t\t\tif (ch[j] != ch[m + 1 - j])\n\t\t\t{\n\t\t\t\tf = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (f == 1)\n\t\t{\n\t\t\ttam = i;\n\t\t\twhile (tam != 0)\n\t\t\t{\n\t\t\t\tp = tam % B;\n\t\t\t\ttam = tam / B;\n\t\t\t\tt++;\n\t\t\t\tc[t] = p;\n\t\t\t}\n\t\t\tfor (j = t; j >= 1; j--)\n\t\t\t\tcout << c[j];\n\t\t\tcout << ' ';\n\t\t\tfor (j = 1; j <= m; j++)\n\t\t\t\tcout << ch[j];\n\t\t\tcout << endl;\n\t\t}\n\t\t\n\t}\n\tsystem(\""pause\"");\n\treturn 0;\n}\n",PARTIAL_ACCEPTED,40,552
1277984246801563648,5f6fe5ec2e9f1448b66bc330cc1ed4d1d67a835fd6cdce39f4a1bed8c73e173d,2020-06-30 23:16:02,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream> \nusing namespace std;\nint main()\n{\n\tint B;\n\tcin >> B;\n\tint i;\n\tint l;\n\tint ch[200];int c[10];\n\tint m,p,j,t;\n\tint f;\n\tint tam;\n\tfor (i = 1; i < 301; i++)\n\t{\n\t\tt = 0;\n\t\tf = 1;\n\t\tl = i*i;\n\t\tm = 0;\n\t\twhile (l != 0)\n\t\t{\n\t\t\tp = l % B;\n\t\t\tl = l / B;\n\t\t\tm++;\n\t\t\tch[m] = p;\n\t\t}\n\t\tfor (j = 1; j <= m; j++)\n\t\t{\n\t\t\tif (ch[j] != ch[m + 1 - j])\n\t\t\t{\n\t\t\t\tf = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (f == 1)\n\t\t{\n\t\t\ttam = i;\n\t\t\twhile (tam != 0)\n\t\t\t{\n\t\t\t\tp = tam % B;\n\t\t\t\ttam = tam / B;\n\t\t\t\tt++;\n\t\t\t\tc[t] = p;\n\t\t\t}\n\t\t\tfor (j = t; j >= 1; j--)\n\t\t\t\tcout << c[j];\n\t\t\tcout << ' ';\n\t\t\tfor (j = 1; j <= m; j++)\n\t\t\t\tcout << ch[j];\n\t\t\tcout << endl;\n\t\t}\n\t\t\n\t}\n\tsystem(\""pause\"");\n\treturn 0;\n}\n",PARTIAL_ACCEPTED,40,512
1277984465312210944,5f6fe5ec2e9f1448b66bc330cc1ed4d1d67a835fd6cdce39f4a1bed8c73e173d,2020-06-30 23:16:54,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream> \nusing namespace std;\nint main()\n{\n\tint B;\n\tcin >> B;\n\tint i;\n\tint l;\n\tint ch[400];int c[400];\n\tint m,p,j,t;\n\tint f;\n\tint tam;\n\tfor (i = 1; i < 301; i++)\n\t{\n\t\tt = 0;\n\t\tf = 1;\n\t\tl = i*i;\n\t\tm = 0;\n\t\twhile (l != 0)\n\t\t{\n\t\t\tp = l % B;\n\t\t\tl = l / B;\n\t\t\tm++;\n\t\t\tch[m] = p;\n\t\t}\n\t\tfor (j = 1; j <= m; j++)\n\t\t{\n\t\t\tif (ch[j] != ch[m + 1 - j])\n\t\t\t{\n\t\t\t\tf = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (f == 1)\n\t\t{\n\t\t\ttam = i;\n\t\t\twhile (tam != 0)\n\t\t\t{\n\t\t\t\tp = tam % B;\n\t\t\t\ttam = tam / B;\n\t\t\t\tt++;\n\t\t\t\tc[t] = p;\n\t\t\t}\n\t\t\tfor (j = t; j >= 1; j--)\n\t\t\t\tcout << c[j];\n\t\t\tcout << ' ';\n\t\t\tfor (j = 1; j <= m; j++)\n\t\t\t\tcout << ch[j];\n\t\t\tcout << endl;\n\t\t}\n\t\t\n\t}\n\tsystem(\""pause\"");\n\treturn 0;\n}\n",PARTIAL_ACCEPTED,46,556
1277985326134386688,67f4e3269b524926303e51f12e4c87a9bba053bc6c92d71e68e2db9238282124,2020-06-30 23:20:20,C++,60.0,1277062760129622024,1267449136707624960,1049226397448056832,"//双重回文数\n#include<iostream>\nusing namespace std;\n\nbool Charge(int a){\n    int iCount=0;\n    char c; string s;\n    int iAlternative=a,flag=1;\n    for (int B=2;B<11;B++){  //从2到10进制依次遍寻\n        while(iAlternative!=0){\n        int iSingle = iAlternative%B;\n        if (iSingle>9) c = char(iSingle-10+'A');\n        else c = char(iSingle+'0');\n        s = c+s;\n        iAlternative/=B;}\n        for (size_t i=0;i<s.size()/2+1;i++){\n            if (s[i]!=s[s.size()-1-i]){flag=0;break;}\n        }\n        if (flag) {iCount+=1;}\n        if (iCount>=2) return true;//判断达到2即可\n        flag=1;iAlternative=a;//重置\n        s=\""\""; //包括s；\n\n    }\n\n    return false;\n}\n\nint main(){\n    int N,S;\n    cin>>N>>S;\n    for (int i=S+1;i<10000;i++){\n        //cout << i <<\"":\""<<Charge(i)<<endl;\n        if (Charge(i)) {cout<<i<<endl; N-=1;}\n        if(N==0) break;\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,55,512
1277985613251272704,e1e5b82b1d61198e7376d4d64338249615623e6843cdde86e22cb3af01aa60aa,2020-06-30 23:21:28,Python,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"# -*- coding: utf-8 -*-\n# coding: utf-8\n# @Author  : WeiXin\n# 忽略版本警告\nimport warnings\n\nwarnings.filterwarnings('ignore')\n\n\n\ndef binary(n, x):\n    list_ = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 'A', 'b', 'C', 'D', 'E', 'F']\n    binary_ = []\n    while True:\n        quo = n // x\n        y = n % x\n        binary_.append(y)\n        if quo == 0:\n            break\n        n = quo\n    binary_.reverse()\n    num = \""\""\n    for i in binary_:\n        num += str(list_[i])\n        #print(list_[i], end='')\n    return num\n\ndef palsq(num):\n    length = len(num)\n    flag = False\n    if length != 1:\n        for i in range(0, int(length/2)):\n            if num[i] == num[length-i-1]:\n                flag = True\n            else:\n                flag = False\n                break\n    else:\n        flag = True\n    return flag\n\nn = int(input())\nfor i in range(1, 301):\n    square = i * i\n    bin = binary(square, n)\n    if palsq(bin):\n        print(i, \"" \"", bin)\n",MULTIPLE_ERROR,205,3348
1277985766959931392,afbe3dd44dd174a47bc8fc4e72e8b1c926d31aa15a5454a9bb85155d6b0804f5,2020-06-30 23:22:05,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint main()\n{\n\tint n, s,flag=0,temp=0;\n\tcin >> n >> s;\n\tint count = 0;\n\tint s_1,j;               //作为过渡进行进制转换\n\tchar c;\n\tstring a, b = \""\"";\n\twhile (count<n)\n\t{\n\t\tflag = 0;\n\t\ts++;\n\t\tfor (int i = 2; i <= 10; i++) {\n\t\t\ts_1 = s;\n\t\t\tb = \""\"";\n\t\t\twhile (true)\n\t\t\t{\n\t\t\t\tj = s_1 % i;\n\t\t\t\tc = (char)(j);\n\t\t\t\tif (s_1 / i > 0) { b = c + b; }\n\t\t\t\telse { b = c + b; break; }\n\t\t\t}\n\t\t\ta = b;\n\t\t\treverse(a.begin(), a.end());\n\t\t\tif (a == b) { flag++; }\n\t\t\tif (flag == 2) { cout << s << endl; break; }\n\t\t}\n\t\tcount++;\n\t\tcontinue;\n\t}\n}",TIME_LIMIT_EXCEEDED,0,0
1277986098540642304,afbe3dd44dd174a47bc8fc4e72e8b1c926d31aa15a5454a9bb85155d6b0804f5,2020-06-30 23:23:24,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint main()\n{\n\tint n, s,flag=0,temp=0;\n\tcin >> n >> s;\n\tint count = 0;\n\tint s_1,j;               //作为过渡进行进制转换\n\tchar c;\n\tstring a, b = \""\"";\n\twhile (count<n)\n\t{\n\t\tflag = 0;\n\t\ts++;\n\t\tfor (int i = 2; i <= 10; i++) {\n\t\t\ts_1 = s;\n\t\t\tb = \""\"";\n\t\t\twhile (true)\n\t\t\t{\n\t\t\t\tj = s_1 % i;\n\t\t\t\tc = (char)(j);\n\t\t\t\tif (s_1 / i > 0) { b = c + b; }\n\t\t\t\telse { b = c + b; break; }\n\t\t\t}\n\t\t\ta = b;\n\t\t\treverse(a.begin(), a.end());\n\t\t\tif (a == b) { flag++; }\n\t\t}\n        if (flag >= 2) { cout << s << endl; break; }\n\t\tcount++;\n\t\tcontinue;\n\t}\n}",TIME_LIMIT_EXCEEDED,0,0
1277986183596933120,e1e5b82b1d61198e7376d4d64338249615623e6843cdde86e22cb3af01aa60aa,2020-06-30 23:23:44,Python,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"# -*- coding: utf-8 -*-\n# coding: utf-8\n# @Author  : WeiXin\n# 忽略版本警告\nimport warnings\n\nwarnings.filterwarnings('ignore')\n\n\n\ndef binary(n, x):\n    list_ = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 'A', 'b', 'C', 'D', 'E', 'F']\n    binary_ = []\n    while True:\n        quo = n // x\n        y = n % x\n        binary_.append(y)\n        if quo == 0:\n            break\n        n = quo\n    binary_.reverse()\n    num = \""\""\n    for i in binary_:\n        num += str(list_[i])\n        #print(list_[i], end='')\n    return num\n\ndef palsq(num):\n    length = len(num)\n    flag = False\n    if length != 1:\n        for i in range(0, int(length/2)):\n            if num[i] == num[length-i-1]:\n                flag = True\n            else:\n                flag = False\n                break\n    else:\n        flag = True\n    return flag\n\nn = int(input())\nfor i in range(1, 301):\n    square = i * i\n    bin = binary(square, n)\n    if palsq(bin):\n        print(i, end=\"" \"")\n        print(bin)\n",PARTIAL_ACCEPTED,201,3204
1277986312970240000,67f4e3269b524926303e51f12e4c87a9bba053bc6c92d71e68e2db9238282124,2020-06-30 23:24:15,C++,60.0,1277062760129622024,1267449136707624960,1049226397448056832,"//双重回文数\n#include<iostream>\nusing namespace std;\n\nbool Charge(int a){\n    int iCount=0;\n    char c; string s;\n    int iAlternative=a,flag=1;\n    for (int B=2;B<11;B++){  //从2到10进制依次遍寻\n        while(iAlternative!=0){\n        int iSingle = iAlternative%B;\n        if (iSingle>9) c = char(iSingle-10+'A');\n        else c = char(iSingle+'0');\n        s = c+s;\n        iAlternative/=B;}\n        for (size_t i=0;i<s.size()/2+1;i++){\n            if (s[i]!=s[s.size()-1-i]){flag=0;break;}\n        }\n        if (flag) {iCount+=1;}\n        if (iCount>=2) return true;//判断达到2即可\n        flag=1;iAlternative=a;//重置\n        s=\""\""; //包括s；\n\n    }\n\n    return false;\n}\n\nint main(){\n    int N,S;\n    cin>>N>>S;\n    for (int i=S+1;i<10016;i++){//S最大10000，N最大15，则i至少要到10016\n        //cout << i <<\"":\""<<Charge(i)<<endl;\n        if (Charge(i)) {cout<<i<<endl; N-=1;}\n        if(N==0) break;\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,29,424
1277986424635187200,e1e5b82b1d61198e7376d4d64338249615623e6843cdde86e22cb3af01aa60aa,2020-06-30 23:24:42,Python,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"# -*- coding: utf-8 -*-\n# coding: utf-8\n# @Author  : WeiXin\n# 忽略版本警告\nimport warnings\n\nwarnings.filterwarnings('ignore')\n\n\n\ndef binary(n, x):\n    list_ = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 'A', 'b', 'C', 'D', 'E', 'F']\n    binary_ = []\n    while True:\n        quo = n // x\n        y = n % x\n        binary_.append(y)\n        if quo == 0:\n            break\n        n = quo\n    binary_.reverse()\n    num = \""\""\n    for i in binary_:\n        num += str(list_[i])\n        #print(list_[i], end='')\n    return num\n\ndef palsq(num):\n    length = len(num)\n    flag = False\n    if length != 1:\n        for i in range(0, int(length/2)):\n            if num[i] == num[length-i-1]:\n                flag = True\n            else:\n                flag = False\n                break\n    else:\n        flag = True\n    return flag\n\nn = int(input())\nfor i in range(1, 301):\n    square = i * i\n    bin = binary(square, n)\n    if palsq(bin):\n        print(binary(i, n), end=\"" \"")\n        print(bin)\n",PARTIAL_ACCEPTED,199,3124
1277986629526945792,e1e5b82b1d61198e7376d4d64338249615623e6843cdde86e22cb3af01aa60aa,2020-06-30 23:25:30,Python,60.0,1277062760129622023,1267442030214471680,1049226397448056832,"# -*- coding: utf-8 -*-\n# coding: utf-8\n# @Author  : WeiXin\n# 忽略版本警告\nimport warnings\n\nwarnings.filterwarnings('ignore')\n\n\n\ndef binary(n, x):\n    list_ = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 'A', 'B', 'C', 'D', 'E', 'F']\n    binary_ = []\n    while True:\n        quo = n // x\n        y = n % x\n        binary_.append(y)\n        if quo == 0:\n            break\n        n = quo\n    binary_.reverse()\n    num = \""\""\n    for i in binary_:\n        num += str(list_[i])\n        #print(list_[i], end='')\n    return num\n\ndef palsq(num):\n    length = len(num)\n    flag = False\n    if length != 1:\n        for i in range(0, int(length/2)):\n            if num[i] == num[length-i-1]:\n                flag = True\n            else:\n                flag = False\n                break\n    else:\n        flag = True\n    return flag\n\nn = int(input())\nfor i in range(1, 301):\n    square = i * i\n    bin = binary(square, n)\n    if palsq(bin):\n        print(binary(i, n), end=\"" \"")\n        print(bin)\n",PARTIAL_ACCEPTED,203,3100
1277986813522673664,67f4e3269b524926303e51f12e4c87a9bba053bc6c92d71e68e2db9238282124,2020-06-30 23:26:14,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"//双重回文数\n#include<iostream>\nusing namespace std;\n\nbool Charge(int a){\n    int iCount=0;\n    char c; string s;\n    int iAlternative=a,flag=1;\n    for (int B=2;B<11;B++){  //从2到10进制依次遍寻\n        while(iAlternative!=0){\n        int iSingle = iAlternative%B;\n        if (iSingle>9) c = char(iSingle-10+'A');\n        else c = char(iSingle+'0');\n        s = c+s;\n        iAlternative/=B;}\n        for (size_t i=0;i<s.size()/2+1;i++){\n            if (s[i]!=s[s.size()-1-i]){flag=0;break;}\n        }\n        if (flag) {iCount+=1;}\n        if (iCount>=2) return true;//判断达到2即可\n        flag=1;iAlternative=a;//重置\n        s=\""\""; //包括s；\n\n    }\n\n    return false;\n}\n\nint main(){\n    int N,S;\n    cin>>N>>S;\n    for (int i=S+1;;i++){//错误：S最大10000，N最大15，则i至少要到10016---不是连续的，最好不要设上限\n        //cout << i <<\"":\""<<Charge(i)<<endl;\n        if (Charge(i)) {cout<<i<<endl; N-=1;}\n        if(N==0) break;\n    }\n    return 0;\n}\n",ACCEPTED,44,624
1277987124362543104,e1e5b82b1d61198e7376d4d64338249615623e6843cdde86e22cb3af01aa60aa,2020-06-30 23:27:28,Python,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"# -*- coding: utf-8 -*-\n# coding: utf-8\n# @Author  : WeiXin\n# 忽略版本警告\nimport warnings\n\nwarnings.filterwarnings('ignore')\n\n\n\ndef binary(n, x):\n    list_ = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J']\n    binary_ = []\n    while True:\n        quo = n // x\n        y = n % x\n        binary_.append(y)\n        if quo == 0:\n            break\n        n = quo\n    binary_.reverse()\n    num = \""\""\n    for i in binary_:\n        num += str(list_[i])\n        #print(list_[i], end='')\n    return num\n\ndef palsq(num):\n    length = len(num)\n    flag = False\n    if length != 1:\n        for i in range(0, int(length/2)):\n            if num[i] == num[length-i-1]:\n                flag = True\n            else:\n                flag = False\n                break\n    else:\n        flag = True\n    return flag\n\nn = int(input())\nfor i in range(1, 301):\n    square = i * i\n    bin = binary(square, n)\n    if palsq(bin):\n        print(binary(i, n), end=\"" \"")\n        print(bin)\n",ACCEPTED,199,3072
1277987585975050240,afbe3dd44dd174a47bc8fc4e72e8b1c926d31aa15a5454a9bb85155d6b0804f5,2020-06-30 23:29:19,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint main()\n{\n\tint n, s,flag=0,temp=0;\n\tcin >> n >> s;\n\tint count = 0;\n\tint s_1=0,j=0;               //作为过渡进行进制转换\n\tchar c;\n\tstring a, b = \""\"";\n\twhile (count<n)\n\t{\n\t\tflag = 0;\n\t\ts++;\n\t\tfor (int i = 2; i <= 10; i++) {\n\t\t\ts_1 = s;\n\t\t\tb = \""\"";\n\t\t\twhile (true)\n\t\t\t{\n\t\t\t\tj = s_1 % i;\n\t\t\t\tc = (char)(j);\n\t\t\t\ts_1 = s_1 / i;\n\t\t\t\tif (s_1  > 0) { b = c + b; }\n\t\t\t\telse { b = c + b; break; }\n\t\t\t}\n\t\t\ta = b;\n\t\t\treverse(a.begin(), a.end());\n\t\t\tif (a == b) { flag++; }\n\t\t\tif (flag == 2) { cout << s << endl; count++; break; }\n\t\t}\n\t\tcontinue;\n\t}\n\treturn 0;\n}",ACCEPTED,37,512
1277987689364652032,5f6fe5ec2e9f1448b66bc330cc1ed4d1d67a835fd6cdce39f4a1bed8c73e173d,2020-06-30 23:29:43,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream> \nusing namespace std;\nint main()\n{\n\tint B;\n\tcin >> B;\n\tint i;\n\tint l;\n\tint ch[400];int c[400];\n\tint m,p,j,t;\n\tint f;\n\tint tam;\n\tfor (i = 1; i < 301; i++)\n\t{\n\t\tt = 0;\n\t\tf = 1;\n\t\tl = i*i;\n\t\tm = 0;\n\t\twhile (l != 0)\n\t\t{\n\t\t\tp = l % B;\n\t\t\tl = l / B;\n\t\t\tm++;\n\t\t\tch[m] = p;\n\t\t}\n\t\tfor (j = 1; j <= m; j++)\n\t\t{\n\t\t\tif (ch[j] != ch[m + 1 - j])\n\t\t\t{\n\t\t\t\tf = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (f == 1)\n\t\t{\n\t\t\ttam = i;\n\t\t\twhile (tam != 0)\n\t\t\t{\n\t\t\t\tp = tam % B;\n\t\t\t\ttam = tam / B;\n\t\t\t\tt++;\n\t\t\t\tc[t] = p;\n\t\t\t}\n\t\t\tfor (j = t; j >= 1; j--)\n\t\t\t{\n\t\t\t\tif (c[j] < 10)\n\t\t\t\t\tcout << c[j];\n\t\t\t\telse\n\t\t\t\t\tcout << (char)(c[j] + 55);\n\t\t\t}\n\t\t\tcout << ' ';\n\t\t\tfor (j = 1; j <= m; j++)\n\t\t\t{\n\t\t\t\tif (c[j] < 10)\n\t\t\t\t\tcout << ch[j];\n\t\t\t\telse\n\t\t\t\t\tcout << (char)(ch[j] + 55);\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t\t\n\t}\n\tsystem(\""pause\"");\n\treturn 0;\n}\n",WRONG_ANSWER,41,624
1277987745329250304,5f6fe5ec2e9f1448b66bc330cc1ed4d1d67a835fd6cdce39f4a1bed8c73e173d,2020-06-30 23:29:57,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream> \nusing namespace std;\nint main()\n{\n\tint B;\n\tcin >> B;\n\tint i;\n\tint l;\n\tint ch[400];int c[400];\n\tint m,p,j,t;\n\tint f;\n\tint tam;\n\tfor (i = 1; i < 301; i++)\n\t{\n\t\tt = 0;\n\t\tf = 1;\n\t\tl = i*i;\n\t\tm = 0;\n\t\twhile (l != 0)\n\t\t{\n\t\t\tp = l % B;\n\t\t\tl = l / B;\n\t\t\tm++;\n\t\t\tch[m] = p;\n\t\t}\n\t\tfor (j = 1; j <= m; j++)\n\t\t{\n\t\t\tif (ch[j] != ch[m + 1 - j])\n\t\t\t{\n\t\t\t\tf = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (f == 1)\n\t\t{\n\t\t\ttam = i;\n\t\t\twhile (tam != 0)\n\t\t\t{\n\t\t\t\tp = tam % B;\n\t\t\t\ttam = tam / B;\n\t\t\t\tt++;\n\t\t\t\tc[t] = p;\n\t\t\t}\n\t\t\tfor (j = t; j >= 1; j--)\n\t\t\t{\n\t\t\t\tif (c[j] < 10)\n\t\t\t\t\tcout << c[j];\n\t\t\t\telse\n\t\t\t\t\tcout << (char)(c[j] + 55);\n\t\t\t}\n\t\t\tcout << ' ';\n\t\t\tfor (j = 1; j <= m; j++)\n\t\t\t{\n\t\t\t\tif (c[j] < 10)\n\t\t\t\t\tcout << ch[j];\n\t\t\t\telse\n\t\t\t\t\tcout << (char)(ch[j] + 55);\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t\t\n\t}\n\tsystem(\""pause\"");\n\treturn 0;\n}\n",WRONG_ANSWER,39,552
1277987759069790208,5f6fe5ec2e9f1448b66bc330cc1ed4d1d67a835fd6cdce39f4a1bed8c73e173d,2020-06-30 23:30:00,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream> \nusing namespace std;\nint main()\n{\n\tint B;\n\tcin >> B;\n\tint i;\n\tint l;\n\tint ch[400];int c[400];\n\tint m,p,j,t;\n\tint f;\n\tint tam;\n\tfor (i = 1; i < 301; i++)\n\t{\n\t\tt = 0;\n\t\tf = 1;\n\t\tl = i*i;\n\t\tm = 0;\n\t\twhile (l != 0)\n\t\t{\n\t\t\tp = l % B;\n\t\t\tl = l / B;\n\t\t\tm++;\n\t\t\tch[m] = p;\n\t\t}\n\t\tfor (j = 1; j <= m; j++)\n\t\t{\n\t\t\tif (ch[j] != ch[m + 1 - j])\n\t\t\t{\n\t\t\t\tf = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (f == 1)\n\t\t{\n\t\t\ttam = i;\n\t\t\twhile (tam != 0)\n\t\t\t{\n\t\t\t\tp = tam % B;\n\t\t\t\ttam = tam / B;\n\t\t\t\tt++;\n\t\t\t\tc[t] = p;\n\t\t\t}\n\t\t\tfor (j = t; j >= 1; j--)\n\t\t\t{\n\t\t\t\tif (c[j] < 10)\n\t\t\t\t\tcout << c[j];\n\t\t\t\telse\n\t\t\t\t\tcout << (char)(c[j] + 55);\n\t\t\t}\n\t\t\tcout << ' ';\n\t\t\tfor (j = 1; j <= m; j++)\n\t\t\t{\n\t\t\t\tif (c[j] < 10)\n\t\t\t\t\tcout << ch[j];\n\t\t\t\telse\n\t\t\t\t\tcout << (char)(ch[j] + 55);\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t\t\n\t}\n\tsystem(\""pause\"");\n\treturn 0;\n}\n",WRONG_ANSWER,45,704
1277987991903985664,61f077a9e57d8b4a25e2ec9778906b09610749bb60fbe7a3181d58b2af3a947c,2020-06-30 23:30:55,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstring>\n#include<vector>\n#include<algorithm>\nusing namespace std;\n\ninline char c(int x)\n{\n\tif (x >= 0 && x <= 9) {\n\t\treturn x + '0';\n\t}\n\telse\n\t\treturn x - 10 + 'A';\n\n}\nvoid node(int x, int n, vector<int> T)\n{\n\tfor (int k = 0; x; k++) {\n\t\tT.push_back(x % n);\n\t\tx /= n;\n\t}\n}\n\nint main()\n{\n\tint N, S;\n\tcin >> N >> S;\n\tint sum = 0;\n\twhile (1) {\n\t\tS = S + 1;\n\t\tint counter = 0;\n\t\tvector<int> T2, T3, T4, T5, T6, T7, T8, T9, T10;\n\t\tvector<vector<int>> TTT = { T2,T3,T4,T5,T6,T7,T8,T9,T10 };\n\t\tfor (int i = 2; i <= 10; i++) {\n\t\t\tif (i == 2 || i == 10) {\n\t\t\t\tint y = S;\n\t\t\t\tnode(y, i, TTT[i - 2]);\n\t\t\t\tint flag = 1;\n\t\t\t\tfor (int j = 0; j < TTT[i - 2].size(); j++) {\n\t\t\t\t\tif (TTT[i - 2][j] != TTT[i - 2][TTT[i - 2].size() - j - 1]) {\n\t\t\t\t\t\tflag = 0;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (flag == 1)\n\t\t\t\t\tcounter += 1;\n\t\t\t}\n\t\t}\n\t\tif (counter >= 2) {\n\t\t\tcout << S << endl;\n\t\t\tsum += 1;\n\t\t}\n\t\tif (sum == N)\n\t\t\tbreak;\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,37,504
1277988106194575360,5f6fe5ec2e9f1448b66bc330cc1ed4d1d67a835fd6cdce39f4a1bed8c73e173d,2020-06-30 23:31:23,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream> \nusing namespace std;\nint main()\n{\n\tint B;\n\tcin >> B;\n\tint i;\n\tint l;\n\tint ch[400];int c[400];\n\tint m,p,j,t;\n\tint f;\n\tint tam;\n\tfor (i = 1; i < 301; i++)\n\t{\n\t\tt = 0;\n\t\tf = 1;\n\t\tl = i*i;\n\t\tm = 0;\n\t\twhile (l != 0)\n\t\t{\n\t\t\tp = l % B;\n\t\t\tl = l / B;\n\t\t\tm++;\n\t\t\tch[m] = p;\n\t\t}\n\t\tfor (j = 1; j <= m; j++)\n\t\t{\n\t\t\tif (ch[j] != ch[m + 1 - j])\n\t\t\t{\n\t\t\t\tf = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (f == 1)\n\t\t{\n\t\t\ttam = i;\n\t\t\twhile (tam != 0)\n\t\t\t{\n\t\t\t\tp = tam % B;\n\t\t\t\ttam = tam / B;\n\t\t\t\tt++;\n\t\t\t\tc[t] = p;\n\t\t\t}\n\t\t\tfor (j = t; j >= 1; j--)\n\t\t\t{\n\t\t\t\tif (c[j] < 10)\n\t\t\t\t\tcout << c[j];\n\t\t\t\telse\n\t\t\t\t\tcout << (char)(c[j] + 55);\n\t\t\t}\n\t\t\tcout << ' ';\n\t\t\tfor (j = 1; j <= m; j++)\n\t\t\t{\n\t\t\t\tif (c[j] < 10)\n\t\t\t\t\tcout << ch[j];\n\t\t\t\telse\n\t\t\t\t\tcout << (char)(ch[j] + 55);\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t\t\n\t}\n\tsystem(\""pause\"");\n\treturn 0;\n}\n",WRONG_ANSWER,33,572
1277988661214248960,a8ef95b4f701efcd5f5a1080f94b5083f23be39953bef38b78f938fddbcc37ae,2020-06-30 23:33:35,C++,30.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstring>\nusing namespace std;\nvoid mertcon(int x,int B);\nbool palin();\nint N,S;\nchar a[5];\nint main()\n{\n    int number=0;\n    cin>>N>>S;\n    while (number<N) {\n        S=S+1;\n        int time=0;\n        for(int B=2;B<=10;B++)\n        {mertcon(S,B);\n            if(palin())\n            time+=1;\n            if(time>=2)\n                {cout<<S<<endl;\n                number++;\n                break;}\n}\n\n}\n\n\n}\n\n\n\nvoid mertcon(int x,int B)\n{   memset(a,'\\0',5);\n    int c;\n    int i=0;\n    while (x) {\n    c=x%B;\n    x=x/B;\n    a[i]=c+'0';\n    i++;\n    }\n\n}\n\nbool palin()\n{int length=strlen(a);\nint m,n;\nfor(m=0,n=(length-1);m<=n;m++,n--)\n{\nif(a[m]!=a[n])\n    return 0;\n}\nreturn 1;\n\n}",PARTIAL_ACCEPTED,16,512
1277989128468103168,a8ef95b4f701efcd5f5a1080f94b5083f23be39953bef38b78f938fddbcc37ae,2020-06-30 23:35:26,C++,30.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstring>\nusing namespace std;\nvoid mertcon(int x,int B);\nbool palin();\nint N,S;\nchar a[5];\nint main()\n{\n    int number=0;\n    cin>>N>>S;\n    while (number<N) {\n        S=S+1;\n        int time=0;\n        for(int B=2;B<=10;B++)\n        {\n            mertcon(S,B);\n            if(palin())\n            time+=1;\n            if(time>=2)\n            {\n                cout<<S<<endl;\n                number++;\n                break;\n            }\n        }\n    }\n}\n\n\n\nvoid mertcon(int x,int B)\n{   memset(a,'\\0',5);\n    int c;\n    int i=0;\n    while (x) {\n    c=x%B;\n    x=x/B;\n    a[i]=c+'0';\n    i++;\n    }\n\n}\n\nbool palin()\n{int length=strlen(a);\nint m,n;\nfor(m=0,n=(length-1);m<=n;m++,n--)\n{\nif(a[m]!=a[n])\n    return 0;\n}\nreturn 1;\n\n}",PARTIAL_ACCEPTED,22,512
1277989907958530048,53ae28e3dbe2f18670c3ebaf391c09f8e570189a6475fc91a2ef814fd1b9799c,2020-06-30 23:38:32,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"//palindromic number\n#include <iostream>\n#include <cmath>\nusing namespace std;\n\nint B,times=0,times2=0;;\nchar palin[17]={'\\0'};//300µÄƽ·½90000µÄ×î´óλÊý£¨¶þ½øÖÆ£©10101111110010000Ϊ17Ϊ \nchar index[9]={'\\0'};//ÒòΪ×îСµÄ½øÖƱíʾÇø¼äÓұ߽çΪ100101100³¤¶ÈΪ9£¬ÕâÊÇ×î´óµÄ³¤¶È \nbool judge_palin(int n,int x);\n\nint main(){\n\tint temp,temp2,temp3,temp4;\n\tcin>>B;\n\tfor (int i=1;i<301;i++){\n\t\ttemp = i*i;\n\t\t//cout << \""hri\"" << temp << \""hri\"" << endl;\n\t\ttemp2 = judge_palin(i,temp);\n\t\tif (temp2){\n\t\t\tfor (int a=times2;a>=0;a--){\n\t\t\t\tcout<<index[a];\n\t\t\t\tindex[a]='\\0';\n\t\t\t}\n\t\t\t//cout << times << \""p\"";\t\n\t\t\tcout << \"" \"";\n\t\t\tfor (int b=times;b>=0;b--){\n\t\t\t\tcout <<palin[b];\n\t\t\t\tpalin[b]='\\0';\n\t\t\t\tif (b==0){\n\t\t\t\t\tcout << endl;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t//cout << index[0];\n\treturn 0;\n} \n\nbool judge_palin(int n,int x){\n\tbool flag=true;\n\tint mod_a,mod_b;\n\ttimes=0;\n\ttimes2=0;\n\twhile(n){\n\t\tmod_b=n%B;\n\t\tn=n/B;\n\t\tif (mod_b>=10){\n\t\t\tindex[times2]=mod_b-10+'A';//½«Êý×Öת»¯Îª×Ö·û£¬½øÖÆ<=20£¬±£Ö¤Á˲»»á³¬¹ý×Ö·û'Z' \n\t\t\t//cout << index[times2] << \""hri\"" << endl;\n\t\t}\n\t\tif (mod_b<10){\n\t\t\tindex[times2]=mod_b+'0';//×Ö·û'0'µÄASCIIÂëΪ48£¬ÕâÑù¿ÉÒÔͨ¹ýASCIIÂ뽫Êý×Öת»¯Îª×Ö·û \n\t\t\t//cout << index[times2] << \""hri\"" << endl;\n\t\t}\n\t\tif (!n){\n\t\t\tif (n%B!=0){\n\t\t\t\tindex[times+1]=n%B+'0';\n\t\t\t}\n\t\t\telse{\n\t\t\t\ttimes2--;\n\t\t\t}\n\t\t}\n\t\ttimes2++;\n\t\t//cout << \""h\"" << times2 << \""h\"" << endl;\n\t}\n\twhile(x){\n\t\tmod_a=x%B;\n\t\tx=x/B;\n\t\tif (mod_a>=10){\n\t\t\tpalin[times]=mod_a-10+'A';//½«Êý×Öת»¯Îª×Ö·û£¬½øÖÆ<=20£¬±£Ö¤Á˲»»á³¬¹ý×Ö·û'Z' \n\t\t}\n\t\tif (mod_a<10){\n\t\t\tpalin[times]=mod_a+'0';//×Ö·û'0'µÄASCIIÂëΪ48£¬ÕâÑù¿ÉÒÔͨ¹ýASCIIÂ뽫Êý×Öת»¯Îª×Ö·û \n\t\t}\n\t\tif (!x){\n\t\t\tif (x%B!=0){\n\t\t\t\tpalin[times+1]=x%B+'0';\n\t\t\t}\n\t\t\telse{\n\t\t\t\ttimes--;\n\t\t\t}\n\t\t}\n\t\ttimes++;\n\t\t\n\t}\n\tfor (int k=0;k<=(times/2-1);k++){\n\t\tif (palin[k]!=palin[times-k]){\n\t\t\tflag=false;\n\t\t\tbreak;\n\t\t}\n\t}\n//\tif (flag){\n//\t\tfor (int y=0;y<times;y++){\n//\t\t\tcout << palin[y];\n//\t\t}\n//\t}\n\treturn flag;\n}",WRONG_ANSWER,46,592
1277990564358709248,dbdee02c4509ab7a1fd578907c2d4a0dc00c446ff84739560caf0298cf21d497,2020-06-30 23:41:09,C++,30.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstring>\nusing namespace std;\nvoid mertcon(int x,int B);\nbool palin();\nint N,S;\nchar a[5];\nint main()\n{\nint number=0;\ncin>>N>>S;\nwhile (number<N) {\nS=S+1;\nint time=0;\nfor(int B=2;B<=10;B++)\n{mertcon(S,B);\nif(palin())\ntime+=1;\nif(time>=2)\n{cout<<S<<endl;\n    number++;\n    break;}\n}\n\n}\n\n\n}\n\n\n\nvoid mertcon(int x,int B)\n{   memset(a,'\\0',5);\n    int c;\n    int i=0;\n    while (x) {\n    c=x%B;\n    x=x/B;\n    a[i]=c+'0';\n    i++;\n    }\n\n}\n\nbool palin()\n{int length=strlen(a);\nint m,n;\nfor(m=0,n=(length-1);m<=n;m++,n--)\n{\nif(a[m]!=a[n])\n    return 0;\n}\nreturn 1;\n\n}\n",PARTIAL_ACCEPTED,16,492
1277991000939626496,5f6fe5ec2e9f1448b66bc330cc1ed4d1d67a835fd6cdce39f4a1bed8c73e173d,2020-06-30 23:42:53,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream> \nusing namespace std;\nint main()\n{\n\tint B;\n\tcin >> B;\n\tint i;\n\tint l;\n\tint ch[400];int c[400];\n\tint m,p,j,t;\n\tint f;\n\tint tam;\n\tfor (i = 1; i < 301; i++)\n\t{\n\t\tt = 0;\n\t\tf = 1;\n\t\tl = i*i;\n\t\tm = 0;\n\t\twhile (l != 0)\n\t\t{\n\t\t\tp = l % B;\n\t\t\tl = l / B;\n\t\t\tm++;\n\t\t\tch[m] = p;\n\t\t}\n\t\tfor (j = 1; j <= m; j++)\n\t\t{\n\t\t\tif (ch[j] != ch[m + 1 - j])\n\t\t\t{\n\t\t\t\tf = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (f == 1)\n\t\t{\n\t\t\ttam = i;\n\t\t\twhile (tam != 0)\n\t\t\t{\n\t\t\t\tp = tam % B;\n\t\t\t\ttam = tam / B;\n\t\t\t\tt++;\n\t\t\t\tc[t] = p;\n\t\t\t}\n\t\t\tfor (j = t; j >= 1; j--)\n\t\t\t{\n\t\t\t\t/*if (c[j] < 10)*/\n\t\t\t\t\tcout << c[j];\n\t\t\t\t/*else\n\t\t\t\t\tcout << (char)(c[j] + 55);*/\n\t\t\t}\n\t\t\tcout << ' ';\n\t\t\tfor (j = 1; j <= m; j++)\n\t\t\t{\n\t\t\t\t/*if (c[j] < 10)*/\n\t\t\t\t\tcout << ch[j];\n\t\t\t\t/*else\n\t\t\t\t\tcout << (char)(ch[j] + 55);*/\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t\t\n\t}\n\tsystem(\""pause\"");\n\treturn 0;\n}",PARTIAL_ACCEPTED,36,696
1277991152035233792,a8ef95b4f701efcd5f5a1080f94b5083f23be39953bef38b78f938fddbcc37ae,2020-06-30 23:43:29,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\n#include <cmath>\n#include <string>\n#include <algorithm>\n\n\nstring intToA(int n,int radix, int flag)    //n是待转数字，radix是指定的进制\n{\n\tstring ans=\""\"";\n\tdo{\n\t\tint t = n % radix;\n\t\tif(t>=0 && t<=9){ans += std::to_string(t);}\n\t\telse{ans += t - 10 + 'A';}\n\t\tn /= radix;\n\t}while(n!=0);\t//使用do{}while（）以防止输入为0的情况\n\tif(flag == 1){\n        reverse(ans.begin(),ans.end());\n    }//控制是否反转\n\treturn ans;\n}\n\n\nbool Hw(int n , int num)\n{\n    string str2 = intToA(num, n, 0);\n    string str3 = intToA(num, n, 1);\n\n    if(str2 == str3){\n        return true;\n    }\n    else{\n        return false;\n    }\n}\nint main(){\n    int num1 = 0;\n    int num2 = 0;\n\n    cin >> num1 >> num2;\n    for(int i = num2 + 1 ; i > 0 ; i++){\n        int flag = 0;\n        for(int j = 2 ; j <= 10 ; j++){\n            if(Hw(j, i)){\n                flag += 1;\n            }\n        }\n        if(flag >= 2){\n            cout << i <<endl;\n            num1 -= 1;\n        }\n        if(num1 == 0){\n            break;\n        }\n    }\n}",ACCEPTED,118,512
1277991358780858368,53ae28e3dbe2f18670c3ebaf391c09f8e570189a6475fc91a2ef814fd1b9799c,2020-06-30 23:44:18,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"//palindromic number\n#include <iostream>\n#include <cmath>\nusing namespace std;\n\nint B,times=0,times2=0;;\nchar palin[17]={'\\0'};//300µÄƽ·½90000µÄ×î´óλÊý£¨¶þ½øÖÆ£©10101111110010000Ϊ17Ϊ \nchar index[9]={'\\0'};//ÒòΪ×îСµÄ½øÖƱíʾÇø¼äÓұ߽çΪ100101100³¤¶ÈΪ9£¬ÕâÊÇ×î´óµÄ³¤¶È \nbool judge_palin(int n,int x);\n\nint main(){\n\tint temp,temp2;\n\tcin>>B;\n\tfor (int i=1;i<301;i++){\n\t\ttemp = i*i;\n\t\t//cout << \""hri\"" << temp << \""hri\"" << endl;\n\t\ttemp2 = judge_palin(i,temp);\n\t\tif (temp2){\n\t\t\tfor (int a=times2;a>=0;a--){\n\t\t\t\tcout<<index[a];\n\t\t\t\tindex[a]='\\0';\n\t\t\t}\n\t\t\t//cout << times << \""p\"";\t\n\t\t\tcout << \"" \"";\n\t\t\tfor (int b=times;b>=0;b--){\n\t\t\t\tcout <<palin[b];\n\t\t\t\tpalin[b]='\\0';\n\t\t\t\tif (b==0){\n\t\t\t\t\tcout << endl;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t//cout << index[0];\n\treturn 0;\n} \n\nbool judge_palin(int n,int x){\n\tbool flag=true;\n\tint mod_a,mod_b;\n\ttimes=0;\n\ttimes2=0;\n\twhile(n){\n\t\tmod_b=n%B;\n\t\tn=n/B;\n\t\tif (mod_b>=10){\n\t\t\tindex[times2]=mod_b-10+'A';//½«Êý×Öת»¯Îª×Ö·û£¬½øÖÆ<=20£¬±£Ö¤Á˲»»á³¬¹ý×Ö·û'Z' \n\t\t\t//cout << index[times2] << \""hri\"" << endl;\n\t\t}\n\t\tif (mod_b<10){\n\t\t\tindex[times2]=mod_b+'0';//×Ö·û'0'µÄASCIIÂëΪ48£¬ÕâÑù¿ÉÒÔͨ¹ýASCIIÂ뽫Êý×Öת»¯Îª×Ö·û \n\t\t\t//cout << index[times2] << \""hri\"" << endl;\n\t\t}\n\t\tif (!n){\n\t\t\tif (n%B!=0){\n\t\t\t\tindex[times+1]=n%B+'0';\n\t\t\t}\n\t\t\telse{\n\t\t\t\ttimes2--;\n\t\t\t}\n\t\t}\n\t\ttimes2++;\n\t\t//cout << \""h\"" << times2 << \""h\"" << endl;\n\t}\n\twhile(x){\n\t\tmod_a=x%B;\n\t\tx=x/B;\n\t\tif (mod_a>=10){\n\t\t\tpalin[times]=mod_a-10+'A';//½«Êý×Öת»¯Îª×Ö·û£¬½øÖÆ<=20£¬±£Ö¤Á˲»»á³¬¹ý×Ö·û'Z' \n\t\t}\n\t\tif (mod_a<10){\n\t\t\tpalin[times]=mod_a+'0';//×Ö·û'0'µÄASCIIÂëΪ48£¬ÕâÑù¿ÉÒÔͨ¹ýASCIIÂ뽫Êý×Öת»¯Îª×Ö·û \n\t\t}\n\t\tif (!x){\n\t\t\tif (x%B!=0){\n\t\t\t\tpalin[times+1]=x%B+'0';\n\t\t\t}\n\t\t\telse{\n\t\t\t\ttimes--;\n\t\t\t}\n\t\t}\n\t\ttimes++;\n\t\t\n\t}\n\tfor (int k=0;k<=times/2;k++){\n\t\tif (palin[k]!=palin[times-k]){\n\t\t\tflag=false;\n\t\t\tbreak;\n\t\t}\n\t}\n//\tif (flag){\n//\t\tfor (int y=0;y<times;y++){\n//\t\t\tcout << palin[y];\n//\t\t}\n//\t}\n\treturn flag;\n}",ACCEPTED,41,508
1277991597260603392,5f6fe5ec2e9f1448b66bc330cc1ed4d1d67a835fd6cdce39f4a1bed8c73e173d,2020-06-30 23:45:15,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream> \nusing namespace std;\nint main()\n{\n\tint B;\n\tcin >> B;\n\tint i;\n\tint l;\n\tint ch[400];int c[400];\n\tint m,p,j,t;\n\tint f;\n\tint tam;\n\tfor (i = 1; i < 301; i++)\n\t{\n\t\tt = 0;\n\t\tf = 1;\n\t\tl = i*i;\n\t\tm = 0;\n\t\twhile (l != 0)\n\t\t{\n\t\t\tp = l % B;\n\t\t\tl = l / B;\n\t\t\tm++;\n\t\t\tch[m] = p;\n\t\t}\n\t\tfor (j = 1; j <= m; j++)\n\t\t{\n\t\t\tif (ch[j] != ch[m + 1 - j])\n\t\t\t{\n\t\t\t\tf = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (f == 1)\n\t\t{\n\t\t\ttam = i;\n\t\t\twhile (tam != 0)\n\t\t\t{\n\t\t\t\tp = tam % B;\n\t\t\t\ttam = tam / B;\n\t\t\t\tt++;\n\t\t\t\tc[t] = p;\n\t\t\t}\n\t\t\tfor (j = t; j >= 1; j--)\n\t\t\t{\n\t\t\t\tif (c[j] < 10)\n\t\t\t\t\tcout << c[j];\n\t\t\t\telse\n\t\t\t\t\tcout << (char)(c[j] + 55);\n\t\t\t}\n\t\t\tcout << ' ';\n\t\t\tfor (j = 1; j <= m; j++)\n\t\t\t{\n\t\t\t\tif (c[j] < 10)\n\t\t\t\t\tcout << ch[j];\n\t\t\t\telse\n\t\t\t\t\tcout << (char)(ch[j] + 55);\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t\t\n\t}\n\tsystem(\""pause\"");\n\treturn 0;\n}\n",WRONG_ANSWER,43,552
1277992196488224768,5f6fe5ec2e9f1448b66bc330cc1ed4d1d67a835fd6cdce39f4a1bed8c73e173d,2020-06-30 23:47:38,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream> \nusing namespace std;\nint main()\n{\n\tint B;\n\tcin >> B;\n\tint i;\n\tint l;\n\tint ch[400];int c[400];\n\tint m,p,j,t;\n\tint f;\n\tint tam;\n\tfor (i = 1; i < 301; i++)\n\t{\n\t\tt = 0;\n\t\tf = 1;\n\t\tl = i*i;\n\t\tm = 0;\n\t\twhile (l != 0)\n\t\t{\n\t\t\tp = l % B;\n\t\t\tl = l / B;\n\t\t\tm++;\n\t\t\tch[m] = p;\n\t\t}\n\t\tfor (j = 1; j <= m; j++)\n\t\t{\n\t\t\tif (ch[j] != ch[m + 1 - j])\n\t\t\t{\n\t\t\t\tf = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (f == 1)\n\t\t{\n\t\t\ttam = i;\n\t\t\twhile (tam != 0)\n\t\t\t{\n\t\t\t\tp = tam % B;\n\t\t\t\ttam = tam / B;\n\t\t\t\tt++;\n\t\t\t\tc[t] = p;\n\t\t\t}\n\t\t\tfor (j = t; j >= 1; j--)\n\t\t\t{\n\t\t\t\t/*if (c[j] < 10)*/\n\t\t\t\t\tcout << c[j];\n\t\t\t\t/*else\n\t\t\t\t\tcout << (char)(c[j] + 55);*/\n\t\t\t}\n\t\t\tcout << ' ';\n\t\t\tfor (j = 1; j <= m; j++)\n\t\t\t{\n\t\t\t\t/*if (c[j] < 10)*/\n\t\t\t\t\tcout << ch[j];\n\t\t\t\t/*else\n\t\t\t\t\tcout << (char)(ch[j] + 55);*/\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t\t\n\t}\n\tsystem(\""pause\"");\n\treturn 0;\n}\n",PARTIAL_ACCEPTED,42,540
1277992239794421760,e1e5b82b1d61198e7376d4d64338249615623e6843cdde86e22cb3af01aa60aa,2020-06-30 23:47:48,Python,50.0,1277062760129622024,1267449136707624960,1049226397448056832,"# -*- coding: utf-8 -*-\n# coding: utf-8\n# @Author  : WeiXin\n# 忽略版本警告\nimport warnings\n\nwarnings.filterwarnings('ignore')\n\n\n\ndef binary(n, x):\n    list_ = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]\n    binary_ = []\n    while True:\n        quo = n // x\n        y = n % x\n        binary_.append(y)\n        if quo == 0:\n            break\n        n = quo\n    binary_.reverse()\n    num = \""\""\n    for i in binary_:\n        num += str(list_[i])\n        #print(list_[i], end='')\n    return num\n\ndef palsq(num):\n    length = len(num)\n    flag = False\n    if length != 1:\n        for i in range(0, int(length/2)):\n            if num[i] == num[length-i-1]:\n                flag = True\n            else:\n                flag = False\n                break\n    else:\n        flag = True\n    return flag\n\ninput_ = input().split(\"" \"")\nnum = int(input_[0])\nlower = int(input_[1])\ncount = 0\nnumber = lower\nwhile(count < num):\n    bincount = 0\n    for i in range(2, 11):\n        bin = binary(number, i)\n        if palsq(bin):\n            bincount += 1\n    if bincount >= 2 :\n        count += 1\n        print(number)\n    number += 1\n\n",PARTIAL_ACCEPTED,255,3188
1277992456606375936,e1e5b82b1d61198e7376d4d64338249615623e6843cdde86e22cb3af01aa60aa,2020-06-30 23:48:40,Python,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"# -*- coding: utf-8 -*-\n# coding: utf-8\n# @Author  : WeiXin\n# 忽略版本警告\nimport warnings\n\nwarnings.filterwarnings('ignore')\n\n\n\ndef binary(n, x):\n    list_ = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]\n    binary_ = []\n    while True:\n        quo = n // x\n        y = n % x\n        binary_.append(y)\n        if quo == 0:\n            break\n        n = quo\n    binary_.reverse()\n    num = \""\""\n    for i in binary_:\n        num += str(list_[i])\n        #print(list_[i], end='')\n    return num\n\ndef palsq(num):\n    length = len(num)\n    flag = False\n    if length != 1:\n        for i in range(0, int(length/2)):\n            if num[i] == num[length-i-1]:\n                flag = True\n            else:\n                flag = False\n                break\n    else:\n        flag = True\n    return flag\n\ninput_ = input().split(\"" \"")\nnum = int(input_[0])\nlower = int(input_[1])\ncount = 0\nnumber = lower + 1\nwhile(count < num):\n    bincount = 0\n    for i in range(2, 11):\n        bin = binary(number, i)\n        if palsq(bin):\n            bincount += 1\n    if bincount >= 2 :\n        count += 1\n        print(number)\n    number += 1\n\n",ACCEPTED,399,3072
1277992915702317056,8391206ff45c6032f54d13443478c2e8a22ea0166fc475c1576cde97fa6c5e9e,2020-06-30 23:50:29,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint N,x=10;\nint lenth;\nchar s[20];\n\nvoid transform(int n)\n{\n    int a,m=0;\n    lenth = 0;\n    if(x>=2&&x<10){\n        while(n!=0){\n            a = n%x;\n            n = n/x;\n            m++;\n            lenth ++;\n            s[m] = a+ '0';\n        }\n    }\n    else if(x>=10&&x<=20){\n        while(n!=0){\n            a = n%x;\n            if(a<10){\n                s[m] = a + '0';\n            }\n            else if( a == 10 )\n                s[m] = 'A';\n            else if( a == 11 )\n                s[m] = 'B';\n            else if( a == 12 )\n                s[m] = 'C';\n            else if( a == 13 )\n                s[m] = 'D';\n            else if( a == 14 )\n                s[m] = 'E';\n            else if( a == 15 )\n                s[m] = 'F';\n            else if( a == 16 )\n                s[m] = 'G';\n            else if( a == 17 )\n                s[m] = 'H';\n            else if( a == 18 )\n                s[m] = 'I';\n            else if( a == 19 )\n                s[m] = 'J';\n            n = n/x;\n            m++;\n            lenth ++;\n        }\n    }\n}\n\nbool huiwen()\n{\n    transform(N);\n    int i = 0, j = lenth -1;\n    while(i<j){\n        if(s[i] != s[j])\n            return false;\n        i++;\n        j--;\n    }\n    return true;\n}\n\nvoid sprint(int h)\n{\n    transform(h);\n    for(int i = lenth -1; i >=0 ;i--)\n        cout << s[i];\n}\n\nint main()\n{\n    cin >> x;\n    bool pd;\n    for(int i = 1;i<301;i++){\n        N = i*i;\n        pd = huiwen();\n        \n        if(pd==true){\n            sprint(i);\n            cout << \"" \"";\n            sprint(N);\n            cout << endl;\n        }\n        \n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,46,384
1277993177934397440,b84f0dba852974b077f34cdfb7f3a0dcdf505a3c646f49eb4728fbb0b4d9d083,2020-06-30 23:51:32,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include <algorithm>\n\nusing namespace std;\n\nstring s;\n\n//将数字转换为二进制~十进制\nstring changeb(int x,int b){\n    s.clear();\n    while(x){//直到x为0\n        s+=x%b+'0';//将数字转化为对应字符\n        x/=b;\n    }\n    return s;\n}//注意此时的顺序是反的\n\nint main(){\n    int n,s;\n    cin >> n >> s;\n    int step = 0;\n    for(int i=s+1;step<n;i++){\n        int temp = 0;\n        for(int j=2;j<=10;j++){\n            string k = changeb(i,j);\n            reverse(k.begin(),k.end());\n            string kk = changeb(i,j);\n            if(k==kk){\n                temp++;\n            }\n        }\n        if(temp>=2){\n            cout << i << endl;\n            step++;\n        }\n    }\n    return 0;\n}",ACCEPTED,26,424
1277993277461028864,8391206ff45c6032f54d13443478c2e8a22ea0166fc475c1576cde97fa6c5e9e,2020-06-30 23:51:55,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint N,x;\nint lenth;\nchar s[20];\n\nvoid transform(int n)\n{\n    int a,m=0;\n    lenth = 0;\n    if(x>=2&&x<10){\n        while(n!=0){\n            a = n%x;\n            n = n/x;\n            m++;\n            lenth ++;\n            s[m] = a+ '0';\n        }\n    }\n    else if(x>=10&&x<=20){\n        while(n!=0){\n            a = n%x;\n            if(a<10){\n                s[m] = a + '0';\n            }\n            else if( a == 10 )\n                s[m] = 'A';\n            else if( a == 11 )\n                s[m] = 'B';\n            else if( a == 12 )\n                s[m] = 'C';\n            else if( a == 13 )\n                s[m] = 'D';\n            else if( a == 14 )\n                s[m] = 'E';\n            else if( a == 15 )\n                s[m] = 'F';\n            else if( a == 16 )\n                s[m] = 'G';\n            else if( a == 17 )\n                s[m] = 'H';\n            else if( a == 18 )\n                s[m] = 'I';\n            else if( a == 19 )\n                s[m] = 'J';\n            n = n/x;\n            m++;\n            lenth ++;\n        }\n    }\n}\n\nbool huiwen()\n{\n    transform(N);\n    int i = 0, j = lenth -1;\n    while(i<j){\n        if(s[i] != s[j])\n            return false;\n        i++;\n        j--;\n    }\n    return true;\n}\n\nvoid sprint(int h)\n{\n    transform(h);\n    for(int i = lenth -1; i >=0 ;i--)\n        cout << s[i];\n}\n\nint main()\n{\n    cin >> x;\n    bool pd;\n    for(int i = 1;i<301;i++){\n        N = i*i;\n        pd = huiwen();\n        \n        if(pd==true){\n            sprint(i);\n            cout << \"" \"";\n            sprint(N);\n            cout << endl;\n        }\n        \n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,41,512
1277994288753868800,a8ef95b4f701efcd5f5a1080f94b5083f23be39953bef38b78f938fddbcc37ae,2020-06-30 23:55:57,C++,30.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstring>\nusing namespace std;\nchar a[5];\nvoid mertcon(int x,int B)\n{   memset(a,'\\0',5);\n    int c;\n    int i=0;\n    while (x) {\n    c=x%B;\n    x=x/B;\n    a[i]=c+'0';\n    i++;\n    }\n}\n\nbool palin()\n{int length=strlen(a);\nint m,n;\nfor(m=0,n=(length-1);m<=n;m++,n--)\n{\nif(a[m]!=a[n])\n    return 0;\n}\nreturn 1;\n\n}\n\nint main()\n{\n    int N = 0;\n    int S = 0;\n    int number=0;\n    cin >> N >> S;\n    while (number < N) {\n        S = S + 1;\n        int time = 0;\n        for(int B = 2 ; B <= 10 ; B++){\n            mertcon(S,B);\n            if(palin())\n            time += 1;\n        }\n        if(time>=2)\n        {\n            cout << S <<endl;\n            number++;\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,27,384
1277994334585028608,a8ef95b4f701efcd5f5a1080f94b5083f23be39953bef38b78f938fddbcc37ae,2020-06-30 23:56:08,C++,30.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstring>\nusing namespace std;\nchar a[5];\nvoid mertcon(int x,int B)\n{   memset(a,'\\0',5);\n    int c;\n    int i=0;\n    while (x) {\n    c=x%B;\n    x=x/B;\n    a[i]=c+'0';\n    i++;\n    }\n}\n\nbool palin()\n{int length=strlen(a);\nint m,n;\nfor(m=0,n=(length-1);m<=n;m++,n--)\n{\nif(a[m]!=a[n])\n    return 0;\n}\nreturn 1;\n\n}\n\nint main()\n{\n    int N = 0;\n    int S = 0;\n    int number=0;\n    cin >> N >> S;\n    while (number < N) {\n        S = S + 1;\n        int time = 0;\n        for(int B = 2 ; B <= 10 ; B++){\n            mertcon(S,B);\n            if(palin())\n            time += 1;\n        }\n        if(time>=2)\n        {\n            cout << S <<endl;\n            number++;\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,35,540
1277994448510713856,8391206ff45c6032f54d13443478c2e8a22ea0166fc475c1576cde97fa6c5e9e,2020-06-30 23:56:35,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint N,b;\nint lenth;\nchar s[20];\n\nvoid transform(int n)\n{\n    int a,m=0;\n    lenth = 0;\n    if(b>=2&&b<10){\n        while(n!=0){\n            a = n%b;\n            n = n/b;\n            s[m] = a+ '0';\n            m++;\n            lenth ++;\n            \n        }\n    }\n    else if(b>=10&&b<=20){\n        while(n!=0){\n            a = n%b;\n            if(a<10){\n                s[m] = a + '0';\n            }\n            else if( a == 10 )\n                s[m] = 'A';\n            else if( a == 11 )\n                s[m] = 'B';\n            else if( a == 12 )\n                s[m] = 'C';\n            else if( a == 13 )\n                s[m] = 'D';\n            else if( a == 14 )\n                s[m] = 'E';\n            else if( a == 15 )\n                s[m] = 'F';\n            else if( a == 16 )\n                s[m] = 'G';\n            else if( a == 17 )\n                s[m] = 'H';\n            else if( a == 18 )\n                s[m] = 'I';\n            else if( a == 19 )\n                s[m] = 'J';\n            n = n/b;\n            m++;\n            lenth ++;\n        }\n    }\n}\n\nbool huiwen()\n{\n    transform(N);\n    int i = 0, j = lenth -1;\n    while(i<j){\n        if(s[i] != s[j])\n            return false;\n        i++;\n        j--;\n    }\n    return true;\n}\n\nvoid sprint(int h)\n{\n    transform(h);\n    for(int i = lenth -1; i >=0 ;i--)\n        cout << s[i];\n}\n\nint main()\n{\n    cin >> b;\n    bool pd;\n    for(int i = 1;i<301;i++){\n        N = i*i;\n        pd = huiwen();\n        \n        if(pd==true){\n            sprint(i);\n            cout << \"" \"";\n            sprint(N);\n            cout << endl;\n        }\n        \n    }\n    return 0;\n}\n",ACCEPTED,35,384
1277995473820901376,a8ef95b4f701efcd5f5a1080f94b5083f23be39953bef38b78f938fddbcc37ae,2020-07-01 00:00:39,C++,30.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstring>\nusing namespace std;\nchar a[5];\nvoid mertcon(int x,int B)\n{   memset(a,'\\0',5);\n    int c;\n    int i=0;\n    while (x) {\n    c=x%B;\n    x=x/B;\n    a[i]=c+'0';\n    i++;\n    }\n}\n\nbool palin()\n{int length=strlen(a);\nint m,n;\nfor(m=0,n=(length-1);m<=n;m++,n--)\n{\nif(a[m]!=a[n])\n    return 0;\n}\nreturn 1;\n\n}\n\nint main()\n{\n    int N = 0;\n    int S = 0;\n    cin >> N >> S;\n    for(S += 1 ; S > 0 ; S++){\n        int time = 0;\n        for(int B = 2 ; B <= 10 ; B++){\n            mertcon(S,B);\n            if(palin())\n            time += 1;\n        }\n        if(time>=2)\n        {\n            cout << S <<endl;\n            N--;\n        }\n        if(N == 0){\n            break;\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,27,504
1277997686148489216,a8ef95b4f701efcd5f5a1080f94b5083f23be39953bef38b78f938fddbcc37ae,2020-07-01 00:09:27,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstring>\nusing namespace std;\nvoid mertcon(int x , int B , char a[])\n{\n    int c;\n    int i=0;\n    while (x) {\n        c=x%B;\n        x=x/B;\n        a[i]=c;\n        i++;\n    }\n}\n\nbool palin(char a[])\n{\n    int length=strlen(a);\n    int m,n;\n    for(m=0,n=(length-1);m<=n;m++,n--)\n    {\n        if(a[m]!=a[n])\n        return 0;\n    }\n    return 1;\n}\n\nint main()\n{\n    int N = 0;\n    int S = 0;\n    cin >> N >> S;\n    for(S += 1 ; S > 0 ; S++){\n        char a[5];\n        int time = 0;\n        for(int B = 2 ; B <= 10 ; B++){\n            mertcon(S , B , a);\n            if(palin(a))\n            time += 1;\n        }\n        if(time>=2)\n        {\n            cout << S <<endl;\n            N--;\n        }\n        if(N == 0){\n            break;\n        }\n    }\n    return 0;\n}",MULTIPLE_ERROR,32,500
1277998047085125632,61f077a9e57d8b4a25e2ec9778906b09610749bb60fbe7a3181d58b2af3a947c,2020-07-01 00:10:53,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstring>\n#include<vector>\n#include<algorithm>\nusing namespace std;\n\nint a[12000], ans;\nbool node(int x, int k)\n{\n\tans = 0;\n\twhile (x > 0) {\n\t\ta[++ans] = x % k;\n\t\tx /= k;\n\t}\n\tfor (int i = 1; i <= ans / 2; i++)\n\t\tif (a[i] != a[ans - i + 1])\n\t\t\treturn false;\n\treturn true;\n}\n\nint main()\n{\n\tint N, S;\n\tcin >> N >> S;\n\tint sum = 0;\n\twhile (1) {\n\t\tS = S + 1;\n\t\tint counter = 0;\n\t\tfor (int i = 2; i <= 10; i++) {\n\t\t\tint y = S;\n\t\t\tif (node(y, i) == true) {\n\t\t\t\tcounter += 1;\n\t\t\t}\t\n\t\t}\n\t\tif (counter >= 2) {\n\t\t\tcout << S << endl;\n\t\t\tsum += 1;\n\t\t}\n\t\tif (sum == N)\n\t\t\tbreak;\n\t}\n\treturn 0;\n}",ACCEPTED,36,512
1277998940421554176,6a63cf642f13095e6820477652379f7f8aff6da0c82bdbf8451416ec17dc89ff,2020-07-01 00:14:26,C++,30.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\nvoid toB(string& a,int B, int num) {\n\tvector<char> tool;\n\tdo {\n\t\tint temp = num % B;\n\t\tif (temp < 10) {\n\t\t\ttemp += 48;\n\t\t\ttool.push_back(temp);\n\t\t}\n\t\telse {\n\t\t\ttemp += 55;\n\t\t\ttool.push_back(temp);\n\t\t}\n\t\tnum /= B;\n\t} while (num != 0);\n\tchar* ac = new char[tool.size() + 1];\n\tint i;\n\tfor (i = 0; i < tool.size(); i++) {\n\t\tac[i] = tool[tool.size()-i-1];\n\t}\n\tac[i] = '\\0';\n\ta = ac;\n}\nint RW(string& a) {\n\tint n = a.size();\n\tfor (int m = 0; m < n / 2; m++) {\n\t\tif (a[m] != a[n - m-1]) {\n\t\t\treturn 0;\n\t\t}\n\t}\n\treturn 1;\n}\nint main() {\n\tint B;\n\tcin >> B;\n\tint max = 3 * B * B - 1;\n\tfor (int i = 1; i < max; i++) {\n\t\tint temp = i * i;\n\t\tstring on, sn;\n\t\ttoB(on, B, i);\n\t\ttoB(sn, B, temp);\n\t\tif (RW(sn)) {\n\t\t\tcout << on << \"" \"" << sn << endl;\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,20,496
1278007958011568128,a8ef95b4f701efcd5f5a1080f94b5083f23be39953bef38b78f938fddbcc37ae,2020-07-01 00:50:16,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstring>\nusing namespace std;\nchar * A(int S, int B)\n{\n    char *a;\n    a = new char [10];\n    int c;\n    int i=0;\n    while (S) {\n        c = S % B;\n        S = S / B;\n        a[i] = c + '0';\n        i++;\n    }\n    return a;\n}\nbool palin(int S , int B)\n{\n    char *a;\n    a = A(S, B);\n    int length = strlen(a);\n    int m,n;\n    for(m=0,n=(length-1);m<=n;m++,n--)\n    {\n        if(a[m]!=a[n])\n        return 0;\n    }\n    return 1;\n}\nint main()\n{\n    int N = 0;\n    int S = 0;\n    cin >> N >> S;\n    while (N != 0) {\n        S = S + 1;\n        int time=0;\n        for(int B = 2 ; B <= 10 ; B++)\n        {\n            if(palin(S , B)){\n                time+=1;\n            }\n        }\n        if(time>=2)\n        {\n            cout<<S<<endl;\n            N--;\n        }\n    }\n}",ACCEPTED,28,1024
1278030367267684352,35f53008c37294f2b012d2cdddf9bc3c83722e7f7a7eee836034b3580cc9b528,2020-07-01 02:19:18,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <string>\n#include<sstream>\n#include<vector>\nusing namespace std;\n\n\nvoid zhuanhuan(int a,int b){\n    int arr[1000];\n    int mo,count=0;\n    for(int j=0;1;j++){\n        mo = a%b;\n        a = a/b;\n        arr[j] = mo;\n        count++;\n        if(a == 0)\n            break;\n    }\n    for (int j = count -1; j >= 0; --j)\n     {\n      cout << arr[j];\n\n\n     }\n\n}\n\n\nint main()\n{\n    int b;\n    cin >> b;\n\n    for(int i = 1;i<=300;i++){\n        int count=0,mo=0,shang=0;\n        int arr[1000];\n        shang=i*i;\n        for(int j=0;1;j++){\n            mo = shang%b;\n            shang = shang/b;\n            arr[j] = mo;\n            count++;\n            if(shang == 0)\n                break;\n        }\n        int ans[count];\n        for (int j = count -1; j >= 0; --j)\n         {\n          ans[count-1-j]=arr[j];\n         }\n        int temp=0;\n        for(int l=0;l<count;l++){\n            if(ans[l] == ans[count-l-1])\n                temp++;\n\n        }\n        if(temp == count){\n            zhuanhuan(i,b);\n            cout<<\"" \"";\n            zhuanhuan(i*i,b);\n            cout<<endl;\n\n        }\n\n\n\n    }\n    return 0;\n\n}",PARTIAL_ACCEPTED,39,512
1278031675609513984,a8ef95b4f701efcd5f5a1080f94b5083f23be39953bef38b78f938fddbcc37ae,2020-07-01 02:24:30,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"/*#include<iostream>\n#include<cstring>\nusing namespace std;\nchar * A(int S, int B)\n{\n    char *a;\n    a = new char [10];\n    int c;\n    int i=0;\n    while (S) {\n        c = S % B;\n        S = S / B;\n        a[i] = c + '0';\n        i++;\n    }\n    return a;\n}\nbool palin(int S , int B)\n{\n    char *a;\n    a = A(S, B);\n    int length = strlen(a);\n    int m,n;\n    for(m=0,n=(length-1);m<=n;m++,n--)\n    {\n        if(a[m]!=a[n])\n        return 0;\n    }\n    return 1;\n}\nint main()\n{\n    int N = 0;\n    int S = 0;\n    cin >> N >> S;\n    while (N != 0) {\n        S = S + 1;\n        int time=0;\n        for(int B = 2 ; B <= 10 ; B++)\n        {\n            if(palin(S , B)){\n                time+=1;\n            }\n        }\n        if(time>=2)\n        {\n            cout<<S<<endl;\n            N--;\n        }\n    }\n}*/\n\n\n#include <iostream>\nusing namespace std;\n#include <cmath>\n#include <string>\n#include <algorithm>\n\n\nstring intToA(int n,int radix, int flag)    //n是待转数字，radix是指定的进制\n{\n\tstring ans=\""\"";\n\tdo{\n\t\tint t = n % radix;\n\t\tif(t>=0 && t<=9){ans += std::to_string(t);}\n\t\telse{ans += t - 10 + 'A';}\n\t\tn /= radix;\n\t}while(n!=0);\t//使用do{}while（）以防止输入为0的情况\n\tif(flag == 1){\n        reverse(ans.begin(),ans.end());\n    }//控制是否反转\n\treturn ans;\n}\n\n\nbool Hw(int n , int num)\n{\n    string str2 = intToA(num, n, 0);\n    string str3 = intToA(num, n, 1);\n\n    if(str2 == str3){\n        return true;\n    }\n    else{\n        return false;\n    }\n}\nint main(){\n    int num1 = 0;\n    int num2 = 0;\n\n    cin >> num1 >> num2;\n    for(int i = num2 + 1 ; i > 0 ; i++){\n        int flag = 0;\n        for(int j = 2 ; j <= 10 ; j++){\n            if(Hw(j, i)){\n                flag += 1;\n            }\n        }\n        if(flag >= 2){\n            cout << i <<endl;\n            num1 -= 1;\n        }\n        if(num1 == 0){\n            break;\n        }\n    }\n}\n\n",ACCEPTED,113,512
1278032702148632576,35f53008c37294f2b012d2cdddf9bc3c83722e7f7a7eee836034b3580cc9b528,2020-07-01 02:28:35,C++,60.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <string>\n#include<sstream>\n#include<vector>\nusing namespace std;\n\n\nvoid zhuanhuan(int a,int b){\n    int arr[1000];\n    int mo,count=0;\n    for(int j=0;1;j++){\n        mo = a%b;\n        a = a/b;\n        arr[j] = mo;\n        count++;\n        if(a == 0)\n            break;\n    }\n    for (int j = count -1; j >= 0; --j)\n     {\n      if(arr[j]<10)\n          cout<<arr[j];\n      if(arr[j]==10)\n          cout<<\""A\"";\n      if(arr[j]==11)\n          cout<<\""B\"";\n      if(arr[j]==12)\n          cout<<\""C\"";\n      if(arr[j]==13)\n          cout<<\""D\"";\n      if(arr[j]==14)\n          cout<<\""E\"";\n      if(arr[j]==16)\n          cout<<\""F\"";\n      if(arr[j]==17)\n          cout<<\""G\"";\n      if(arr[j]==18)\n          cout<<\""H\"";\n      if(arr[j]==19)\n          cout<<\""I\"";\n      if(arr[j]==20)\n          cout<<\""J\"";\n\n\n     }\n\n}\n\n\nint main()\n{\n    int b;\n    cin >> b;\n\n    for(int i = 1;i<=300;i++){\n        int count=0,mo=0,shang=0;\n        int arr[1000];\n        shang=i*i;\n        for(int j=0;1;j++){\n            mo = shang%b;\n            shang = shang/b;\n            arr[j] = mo;\n            count++;\n            if(shang == 0)\n                break;\n        }\n        int ans[count];\n        for (int j = count -1; j >= 0; --j)\n         {\n          ans[count-1-j]=arr[j];\n         }\n        int temp=0;\n        for(int l=0;l<count;l++){\n            if(ans[l] == ans[count-l-1])\n                temp++;\n\n        }\n        if(temp == count){\n            zhuanhuan(i,b);\n            cout<<\"" \"";\n            zhuanhuan(i*i,b);\n            cout<<endl;\n\n        }\n\n\n\n    }\n    return 0;\n\n}\n",PARTIAL_ACCEPTED,35,384
1278033630754963456,35f53008c37294f2b012d2cdddf9bc3c83722e7f7a7eee836034b3580cc9b528,2020-07-01 02:32:16,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <string>\n#include<sstream>\n#include<vector>\nusing namespace std;\n\n\nvoid zhuanhuan(int a,int b){\n    int arr[1000];\n    int mo,count=0;\n    for(int j=0;1;j++){\n        mo = a%b;\n        a = a/b;\n        arr[j] = mo;\n        count++;\n        if(a == 0)\n            break;\n    }\n    for (int j = count -1; j >= 0; --j)\n     {\n      if(arr[j]<10)\n          cout<<arr[j];\n      if(arr[j]==10)\n          cout<<\""A\"";\n      if(arr[j]==11)\n          cout<<\""B\"";\n      if(arr[j]==12)\n          cout<<\""C\"";\n      if(arr[j]==13)\n          cout<<\""D\"";\n      if(arr[j]==14)\n          cout<<\""E\"";\n      if(arr[j]==15)\n          cout<<\""F\"";\n      if(arr[j]==16)\n          cout<<\""G\"";\n      if(arr[j]==17)\n          cout<<\""H\"";\n      if(arr[j]==18)\n          cout<<\""I\"";\n      if(arr[j]==19)\n          cout<<\""J\"";\n      if(arr[j]==20)\n          cout<<\""k\"";\n     }\n\n}\n\n\nint main()\n{\n    int b;\n    cin >> b;\n\n    for(int i = 1;i<=300;i++){\n        int count=0,mo=0,shang=0;\n        int arr[1000];\n        shang=i*i;\n        for(int j=0;1;j++){\n            mo = shang%b;\n            shang = shang/b;\n            arr[j] = mo;\n            count++;\n            if(shang == 0)\n                break;\n        }\n        int ans[count];\n        for (int j = count -1; j >= 0; --j)\n         {\n          ans[count-1-j]=arr[j];\n         }\n        int temp=0;\n        for(int l=0;l<count;l++){\n            if(ans[l] == ans[count-l-1])\n                temp++;\n\n        }\n        if(temp == count){\n            zhuanhuan(i,b);\n            cout<<\"" \"";\n            zhuanhuan(i*i,b);\n            cout<<endl;\n\n        }\n\n\n\n    }\n    return 0;\n\n}\n",ACCEPTED,41,484
1278096909011451904,086db4f0f11f3b10bda993bb6aca37960aa81cc026acb9478ab6e07d448d7333,2020-07-01 06:43:43,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\n\nconst string s = \""0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"";\nint B;\nstruct node{         //进制转化\n    int a[20];\n    int iLen;\n    node(int x){\n        iLen=0;\n        while(x)\n            a[++iLen]=x%B;\n            x/=B;\n    }\n\n    void out(){    //\n        for(int i=iLen;i>0;i--)\n            cout<<s[a[i]];\n    }\n\n    bool tf(){    //判断是否是回文数\n        for(int i=1;i<=iLen;i++)\n            if(a[i] == a[iLen+1-i])\n                return true;\n        return false;\n    }\n};\nint main(){\n    cin >> B;\n    for(int i=1;i<=300;i++){\n        node n(i*i);\n        if(n.tf()){\n            node m(i);\n            m.out();\n            cout<<' ';\n            n.out();\n            cout<<'\\n';\n        }\n    }\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,0,0
1278101062144155648,086db4f0f11f3b10bda993bb6aca37960aa81cc026acb9478ab6e07d448d7333,2020-07-01 07:00:13,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\n\nconst string s = \""0123456789ABCDEFGHIJK\"";\nint B;\n\nstruct number{         //进制转化\n    int iLen;\n    int change[20];\n\n    bool judge(){         //判断回文数\n        for(int i=1;i<=iLen;i++)\n            if(change[i] != change[iLen-i+1])\n                return false;\n        return true;\n    }\n\n    number(int i){\n        iLen = 0;\n        while(i)\n            change[++iLen] = i%B,i /= B;\n    }\n\n    void last(){\n        for(int i=iLen;i>=1;i--)\n            cout << s[change[i]];\n    }\n\n\n};\nint main(){\n    cin >> B;\n\n    for(int i=1;i<301;i++){\n        number iEnd(i*i);\n        if(iEnd.judge()){\n            number iFirst(i);\n            iFirst.last();\n            cout << ' ';\n            iEnd.last();\n            cout << '\\n';\n        }\n    }\n    return 0;\n}\n",ACCEPTED,33,512
1278111904885571584,6a63cf642f13095e6820477652379f7f8aff6da0c82bdbf8451416ec17dc89ff,2020-07-01 07:43:18,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\nvoid toB(string& a,int B, int num) {\n\tvector<char> tool;\n\tdo {\n\t\tint temp = num % B;\n\t\tif (temp < 10) {\n\t\t\ttemp += 48;\n\t\t\ttool.push_back(temp);\n\t\t}\n\t\telse {\n\t\t\ttemp += 55;\n\t\t\ttool.push_back(temp);\n\t\t}\n\t\tnum /= B;\n\t} while (num != 0);\n\tchar* ac = new char[tool.size() + 1];\n\tint i;\n\tfor (i = 0; i < tool.size(); i++) {\n\t\tac[i] = tool[tool.size()-i-1];\n\t}\n\tac[i] = '\\0';\n\ta = ac;\n}\nint RW(string& a) {\n\tint n = a.size();\n\tfor (int m = 0; m < n / 2; m++) {\n\t\tif (a[m] != a[n - m-1]) {\n\t\t\treturn 0;\n\t\t}\n\t}\n\treturn 1;\n}\nint main() {\n\tint B;\n\tcin >> B;\n\tint max = 299;\n\tfor (int i = 1; i < max; i++) {\n\t\tint temp = i * i;\n\t\tstring on, sn;\n\t\ttoB(on, B, i);\n\t\ttoB(sn, B, temp);\n\t\tif (RW(sn)) {\n\t\t\tcout << on << \"" \"" << sn << endl;\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,33,424
1278128388466737152,adca0e7fe2da494372711b65889bb7f278f78ac4d835384b93663445fbd6db0d,2020-07-01 08:48:48,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <cmath>\n\nusing namespace std;\n\nstring to_B(int B, int before)\n{\n    int i{0};\n    string result1,result2;\n    while(before>pow(B,i-1))\n    {\n        int iTemp = before%int(pow(B,i+1));\n        before -=iTemp;\n        iTemp = iTemp/(pow(B,i));\n        if(iTemp>9)\n        {\n            char cTemp = (iTemp+64);\n            result1 += to_string(cTemp);\n        }\n        else\n        {\n            result1 += to_string(iTemp);\n        }\n        i++;\n    }\n    int Length = int(result1.length());\n    for(int i=0;i<Length;i++)\n    {\n        result2 +=result1[Length-i-1];\n    }\n\n    return result2;\n}\nbool mirror_able(string s)\n{\n    int N;\n    N = s.length();\n    for(int i=0;i<N;i++)\n    {\n        if(s[i]!=s[N-i-1])\n            return false;\n    }\n    return true;\n}\n\nint main()\n{\n    int B;\n    cin >> B;\n\n    for(int i=1;i<=300;i++)\n    {\n        int iPower = pow(i,2);\n        string sPower = to_B(B,iPower);\n        if(mirror_able(sPower))\n        {\n            cout << i << \"" \"" << sPower << endl;\n        }\n    }\n//    cout << to_B(16,8)<<endl;\n//    cout << \""____________________\"";\n}\n",PARTIAL_ACCEPTED,47,512
1278129597789437952,6a63cf642f13095e6820477652379f7f8aff6da0c82bdbf8451416ec17dc89ff,2020-07-01 08:53:37,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\nvoid toB(string& a, int B, int num) {\n\tvector<char> tool;\n\tdo {\n\t\tint temp = num % B;\n\t\tif (temp < 10) {\n\t\t\ttemp += 48;\n\t\t\ttool.push_back(temp);\n\t\t}\n\t\telse {\n\t\t\ttemp += 55;\n\t\t\ttool.push_back(temp);\n\t\t}\n\t\tnum /= B;\n\t} while (num != 0);\n\tchar* ac = new char[tool.size() + 1];\n\tint i;\n\tfor (i = 0; i < tool.size(); i++) {\n\t\tac[i] = tool[tool.size() - i - 1];\n\t}\n\tac[i] = '\\0';\n\ta = ac;\n}\nint RW(string& a) {\n\tint n = a.size();\n\tfor (int m = 0; m < n / 2; m++) {\n\t\tif (a[m] != a[n - m - 1]) {\n\t\t\treturn 0;\n\t\t}\n\t}\n\treturn 1;\n}\nint main() {\n\tint N, S;\n\tvector<int> nums;\n\tcin >> N >> S;\n\tfor (int i = S+1; ; i++) {//需要的数字\n\t\tint times = 0;\n\t\tfor (int j = 2; j < 11; j++) {//进制\n\t\t\tstring temp;\n\t\t\ttoB(temp, j, i);\n\t\t\tRW(temp) ? times++ : times = times;\n\t\t\tif (times >= 2)\n\t\t\t\tbreak;\n\t\t}\n\t\tnums.push_back(i);\n\t\tif (nums.size() == N)\n\t\t\tbreak;\n\t}\n\tfor (int it : nums) {\n\t\tcout << it << endl;\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,27,512
1278133298641960960,dbdee02c4509ab7a1fd578907c2d4a0dc00c446ff84739560caf0298cf21d497,2020-07-01 09:08:19,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstring>\nusing namespace std;\nchar *mertcon(int s,int B);\nbool palin(int s,int B);\n\nint main()\n{\n    int N = 0;\n    int S = 0;\n    cin >> N >> S;\n    int number=0;\n    while (number!=N) {\n        S = S + 1;\n        int time=0;\n        for(int B = 2 ; B <= 10 ; B++)\n        {\n            if(palin(S , B)){\n                time+=1;\n            }\n        }\n        if(time>=2)\n        {\n            cout<<S<<endl;\n            number++;\n        }\n    }\n}\n\n\nchar * mertcon(int S, int B)\n{\n    char *a;\n    a=new char[10];\n    int c;\n    int i=0;\n    while (S) {\n        c = S % B;\n        S = S / B;\n        a[i] = c + '0';\n        i++;\n    }\n    return a;\n}\nbool palin(int S , int B)\n{\n    char *a;\n    a = mertcon(S, B);\n    int length = strlen(a);\n    int m,n;\n    for(m=0,n=(length-1);m<=n;m++,n--)\n    {\n        if(a[m]!=a[n])\n        {\n            return 0;}\n    }\n    return 1;\n}\n",ACCEPTED,31,1056
1278136652747169792,adca0e7fe2da494372711b65889bb7f278f78ac4d835384b93663445fbd6db0d,2020-07-01 09:21:39,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <cmath>\n\nusing namespace std;\n\nstring to_B(int B, int before)\n{\n    int i{0};\n    string result1,result2;\n    while(before>=pow(B,i))\n    {\n\n        int iTemp = before%int(pow(B,i+1));\n        before -=iTemp;\n        iTemp = iTemp/(pow(B,i));\n        if(iTemp>9)\n        {\n            char cTemp = char(iTemp+55);\n            result1 += cTemp;\n        }\n        else\n        {\n            result1 += to_string(iTemp);\n        }\n        i++;\n    }\n    int Length = int(result1.length());\n    for(int i=0;i<Length;i++)\n    {\n        result2 +=result1[Length-i-1];\n    }\n    return result2;\n}\nbool mirror_able(string s)\n{\n    int N;\n    N = s.length();\n    for(int i=0;i<N;i++)\n    {\n        if(s[i]!=s[N-i-1])\n            return false;\n    }\n    return true;\n}\n\nint main()\n{\n    int B;\n    cin >> B;\n\n    for(int i=1;i<=300;i++)\n    {\n        int iPower = pow(i,2);\n        string sPower = to_B(B,iPower);\n        if(mirror_able(sPower))\n        {\n            cout << i << \"" \"" << sPower << endl;\n        }\n    }\n//    cout << to_B(16,15)<<endl;\n//    cout << \""____________________\"";\n}\n",PARTIAL_ACCEPTED,38,384
1278137165966409728,adca0e7fe2da494372711b65889bb7f278f78ac4d835384b93663445fbd6db0d,2020-07-01 09:23:41,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <cmath>\n\nusing namespace std;\n\nstring to_B(int B, int before)\n{\n    int i{0};\n    string result1,result2;\n    while(before>=pow(B,i))\n    {\n\n        int iTemp = before%int(pow(B,i+1));\n        before -=iTemp;\n        iTemp = iTemp/(pow(B,i));\n        if(iTemp>9)\n        {\n            char cTemp = char(iTemp+55);\n            result1 += cTemp;\n        }\n        else\n        {\n            result1 += to_string(iTemp);\n        }\n        i++;\n    }\n    int Length = int(result1.length());\n    for(int i=0;i<Length;i++)\n    {\n        result2 +=result1[Length-i-1];\n    }\n    return result2;\n}\nbool mirror_able(string s)\n{\n    int N;\n    N = s.length();\n    for(int i=0;i<N;i++)\n    {\n        if(s[i]!=s[N-i-1])\n            return false;\n    }\n    return true;\n}\n\nint main()\n{\n    int B;\n    cin >> B;\n\n    for(int i=1;i<=300;i++)\n    {\n        int iPower = pow(i,2);\n        string sPower = to_B(B,iPower);\n        string s = to_B(B,i);\n        if(mirror_able(sPower))\n        {\n            cout << s << \"" \"" << sPower << endl;\n        }\n    }\n//    cout << to_B(16,15)<<endl;\n//    cout << \""____________________\"";\n}\n",ACCEPTED,37,500
1278137650274304000,efebf08217b0753fc2c338fd2b3a5a158b862b3914e72f6c91e0fc743af72013,2020-07-01 09:25:37,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint N,S;\n\tcin>>N>>S;\n\t\n\tint k=0,shu[200],sign[N];\n\tfor(int i=S+1;i>S;i++)\n\t{\n\t\tint n=0,I=i;\n\t\tfor(int j=2;j<=10;j++)\n\t\t{\n\t\t\tint a=0;\n\t\t\tfor(int g=0;g<200;g++)\n\t\t\t\tshu[g]=0;\n\t\t\twhile(I!=0)\n\t\t\t{\n\t\t\t\tshu[a]=I%j;\n\t\t\t\tI=I/j;\n\t\t\t\ta=a+1;\n\t\t\t}\n\t\t\tint x=0;\n\t\t\tfor(int v=0;v<a/2;v++)\n\t\t\t{\n\t\t\t\tif(shu[v]!=shu[a-v-1])\n\t\t\t\t\tbreak;\n\t\t\t\telse\n\t\t\t\t\tx=x+1;\n\t\t\t}\n\t\t\tif(x==a/2)\n\t\t\t\tn=n+1;\n\t\t\telse\n\t\t\t\tn=n;\n\t\t}\n\t\t\n\t\tif(n>=2)\n\t\t{\n\t\t\tsign[k]=i;\n\t\t\tk+=1;\n\t\t}\n\t\telse\n\t\t\tk=k;\n\t\t\n\t\tif(k==N)\n\t\t\tbreak;\n\t}\n\tfor(int h=0;h<N;h++)\n\t\tcout<<sign[h]<<endl;\n\treturn 0;\n} ",PARTIAL_ACCEPTED,29,512
1278137903576711168,8d418e97079b1446d46d1a9480943f8e522168ae5c37e784dde26739102d2a1a,2020-07-01 09:26:37,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"//回文平方数\n#include <iostream>\n\nusing std::cin;\nusing std::cout;\nusing std::endl;\nint ch1[100], ch2[100];\nint account1 = 0;\nint account2 = 0;\n\nvoid change(int i, int n);\nint judge();\nvoid reset();\nint main()\n{\n    int B;\n    cin >> B;   //B进制,用十进制数表示,2<=B<=20\n    for (int i = 1; i <= 300; i++)\n    {\n        change(i, B);\n        reset();\n    }\n}\n\nvoid change(int i, int n)\n{\n    while (i)\n    {\n        int a = i % n;\n        if (a >= 10)\n            ch1[account1++] = a + 'A' - 10;\n        else\n            ch1[account1++] = a + '0';\n        i = i / n;\n    }\n    while (i * i)\n    {\n        int c = i * i;\n        int b = c % n;\n        if (b >= 10)\n            ch2[account2++] = b + 'A' - 10;\n        else\n            ch2[account2++] = b + '0';\n        c = c / n;\n    }\n    if (judge())\n    {\n        for (int i = account1 - 1; i >= 0; i--)\n        {\n            if ((int)ch1[i] >= 10)\n                cout << (int)ch1[i];\n            else\n                cout << (char)ch1[i];\n        }\n        cout << \"" \"";\n        for (int j = account2 - 1; j >= 0; j--)\n        {\n            if ((int)ch2[j] >= 10)\n                cout << (int)ch2[j];\n            else\n                cout << (char)ch2[j];\n        }\n    }\n}\n\nint judge()\n{\n    int k = 1;\n    for (int i = 0; i < account2; i++)\n    {\n        if (ch2[i] != ch2[account2 - i - 1])\n        {\n            k = 0;\n            break;\n        }\n    }\n    return k;\n}\n\nvoid reset()\n{\n    for (int i = 0; i < account1; i++)\n        ch1[i] = 0;\n    account1 = 0;\n    for (int j = 0; j < account2; j++)\n        ch2[j] = 0;\n    account2 = 0;\n}\n",WRONG_ANSWER,43,504
1278138797642932225,efebf08217b0753fc2c338fd2b3a5a158b862b3914e72f6c91e0fc743af72013,2020-07-01 09:30:10,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint N,S;\n\tcin>>N>>S;\n\t\n\tint k=0,shu[200],sign[N];\n\tfor(int i=S+1;i>S;i++)\n\t{\n\t\tint n=0;\n\t\tfor(int j=2;j<=10;j++)\n\t\t{\n\t\t\tint a=0,I=i;\n\t\t\tfor(int g=0;g<200;g++)\n\t\t\t\tshu[g]=0;\n\t\t\twhile(I!=0)\n\t\t\t{\n\t\t\t\tshu[a]=I%j;\n\t\t\t\tI=I/j;\n\t\t\t\ta=a+1;\n\t\t\t}\n\t\t\tint x=0;\n\t\t\tfor(int v=0;v<a/2;v++)\n\t\t\t{\n\t\t\t\tif(shu[v]!=shu[a-v-1])\n\t\t\t\t\tbreak;\n\t\t\t\telse\n\t\t\t\t\tx=x+1;\n\t\t\t}\n\t\t\tif(x==a/2)\n\t\t\t\tn=n+1;\n\t\t\telse\n\t\t\t\tn=n;\n\t\t}\n\t\t\n\t\tif(n>=2)\n\t\t{\n\t\t\tsign[k]=i;\n\t\t\tk+=1;\n\t\t}\n\t\telse\n\t\t\tk=k;\n\t\t\n\t\tif(k==N)\n\t\t\tbreak;\n\t}\n\tfor(int h=0;h<N;h++)\n\t\tcout<<sign[h]<<endl;\n\treturn 0;\n} ",ACCEPTED,28,424
1278142089521455104,f017d76b722e0629ef8d409901d76d17980d8cf068916305714242e03a43bdd5,2020-07-01 09:43:15,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n//#include<vector>\n//#include<cstring> \nusing namespace std;\n\nint fun1(int n, int x);\nint main() {\n\tint B, i;\n\tcin >> B;\n\tfor (i = 1; i <= 300; i++) {\n\t\tfun1(B, i);\n\t}\n}\nint fun1(int n, int x) {\n\tint i = 0, m = x * x, j, hui[100], squ[100], k = 0;\n\twhile (m != 0) {\n\t\thui[i++] = m % n;\n\t\tm = m / n;\n\t}\n\twhile (x != 0) {\n\t\tsqu[k++] = x % n;\n\t\tx = x / n;\n\t}\n\tfor (j = 0; j < i / 2; j++) {\n\t\tif (hui[j] != hui[i - j - 1]) return 0;\n\t}\n\tfor (j = k - 1; j > 0; j--)\n\t\tcout << squ[j];\n\tcout << squ[j] << \"" \"";\n\tfor (j = 0; j < i - 1; j++)\n\t\tcout << hui[j];\n\tcout << hui[j] << endl;\n}\n\t\t",PARTIAL_ACCEPTED,28,428
1278142219851063296,adca0e7fe2da494372711b65889bb7f278f78ac4d835384b93663445fbd6db0d,2020-07-01 09:43:46,C++,60.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <cmath>\n\nusing namespace std;\n\nstring to_B(int B, int before)\n{\n    int i{0};\n    string result1,result2;\n    while(before>=pow(B,i))\n    {\n\n        int iTemp = before%int(pow(B,i+1));\n        before -=iTemp;\n        iTemp = iTemp/(pow(B,i));\n        if(iTemp>9)\n        {\n            char cTemp = char(iTemp+55);\n            result1 += cTemp;\n        }\n        else\n        {\n            result1 += to_string(iTemp);\n        }\n        i++;\n    }\n    int Length = int(result1.length());\n    for(int i=0;i<Length;i++)\n    {\n        result2 +=result1[Length-i-1];\n    }\n    return result2;\n}\nbool mirror_able(string s)\n{\n    int N;\n    N = s.length();\n    for(int i=0;i<N;i++)\n    {\n        if(s[i]!=s[N-i-1])\n            return false;\n    }\n    return true;\n}\n\nint main()\n{\n    int N,S,n{0};\n    cin >> N >> S;\n    for(int i=S+1;i<10000;i++)\n    {\n        if(n==N)\n            break;\n        int x{0};\n        for(int a=2;a<11;a++)\n        {\n            string s = to_B(a,i);\n            if(mirror_able(s))\n            {\n                x++;\n            }\n            if(x==2)\n            {\n                n++;\n                cout << i <<endl;\n                break;\n            }\n        }\n    }\n}\n",PARTIAL_ACCEPTED,60,528
1278143568529514496,adca0e7fe2da494372711b65889bb7f278f78ac4d835384b93663445fbd6db0d,2020-07-01 09:49:08,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <cmath>\n\nusing namespace std;\n\nstring to_B(int B, int before)\n{\n    int i{0};\n    string result1,result2;\n    while(before>=pow(B,i))\n    {\n\n        int iTemp = before%int(pow(B,i+1));\n        before -=iTemp;\n        iTemp = iTemp/(pow(B,i));\n        if(iTemp>9)\n        {\n            char cTemp = char(iTemp+55);\n            result1 += cTemp;\n        }\n        else\n        {\n            result1 += to_string(iTemp);\n        }\n        i++;\n    }\n    int Length = int(result1.length());\n    for(int i=0;i<Length;i++)\n    {\n        result2 +=result1[Length-i-1];\n    }\n    return result2;\n}\nbool mirror_able(string s)\n{\n    int N;\n    N = s.length();\n    for(int i=0;i<N;i++)\n    {\n        if(s[i]!=s[N-i-1])\n            return false;\n    }\n    return true;\n}\n\nint main()\n{\n    int N,S,n{0};\n    cin >> N >> S;\n    for(int i=S+1;i<1000000;i++)\n    {\n        if(n==N)\n            break;\n        int x{0};\n        for(int a=2;a<11;a++)\n        {\n            string s = to_B(a,i);\n            if(mirror_able(s))\n            {\n                x++;\n            }\n            if(x==2)\n            {\n                n++;\n                cout << i <<endl;\n                break;\n            }\n        }\n    }\n}\n",ACCEPTED,79,424
1278145035399258112,d2d929dca552a2902151cabadf975c515f33ca3b097430cc9be2fe1277254ea5,2020-07-01 09:54:57,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832," #include<iostream>\nusing namespace std;\n\nbool isPanlindromes(int number,int b){\n    int c,m=0,s[100];\n    while(number!=0){\n        c=number%b;\n        number=number/b;\n        m++;s[m]=c;\n    }\n    int flag=0;\n    for(int i=0;i<=m/2;i++){\n        if(s[i]==s[m-i-1])\n            flag=1;\n        else\n            flag=0;\n }\n    return flag;\n}\n\nint main(){\n    int N=0,S=0;\n    cin>>N>>S;\n    int num=0;\n    for(int i=S+1;num<N;i++){\n        int iCount=0;\n        for(int j=2;j<11;j++){\n            if(isPanlindromes(i,j))\n                iCount++;\n        }\n        if(iCount>=2){\n            num++;\n            cout<<i<<endl;\n        }\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,24,424
1278145174671122432,6a63cf642f13095e6820477652379f7f8aff6da0c82bdbf8451416ec17dc89ff,2020-07-01 09:55:31,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\nvoid toB(string& a, int B, int num) {\n\tvector<char> tool;\n\tdo {\n\t\tint temp = num % B;\n\t\tif (temp < 10) {\n\t\t\ttemp += 48;\n\t\t\ttool.push_back(temp);\n\t\t}\n\t\telse {\n\t\t\ttemp += 55;\n\t\t\ttool.push_back(temp);\n\t\t}\n\t\tnum /= B;\n\t} while (num != 0);\n\tchar* ac = new char[tool.size() + 1];\n\tint i;\n\tfor (i = 0; i < tool.size(); i++) {\n\t\tac[i] = tool[tool.size() - i - 1];\n\t}\n\tac[i] = '\\0';\n\ta = ac;\n}\nint RW(string& a) {\n\tint n = a.size();\n\tfor (int m = 0; m < n / 2; m++) {\n\t\tif (a[m] != a[n - m - 1]) {\n\t\t\treturn 0;\n\t\t}\n\t}\n\treturn 1;\n}\nint main() {\n\tint N, S;\n\tvector<int> nums;\n\tcin >> N >> S;\n\tfor (int i = S + 1; ; i++) {//需要的数字\n\t\tint times = 0;\n\t\tfor (int j = 2; j < 11; j++) {//进制\n\t\t\tstring temp;\n\t\t\ttoB(temp, j, i);\n\t\t\tRW(temp) ? times++ : times = times;\n\t\t\tif (times >= 2) {\n\t\t\t\tnums.push_back(i);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (nums.size() == N)\n\t\t\tbreak;\n\t}\n\tfor (int it : nums) {\n\t\tcout << it << endl;\n\t\t}\n\treturn 0;\n\t}",ACCEPTED,45,1024
1278145992434581504,10d5b1fccc77f0ea491f60d75762a7b8e3a4e04f55cc06f23fa01eb7b66f9e47,2020-07-01 09:58:46,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n\nusing namespace std;\n\nbool change(int d, int k) { //十进制数d转化为k进制数\n    string s;\n    int n=1, Xn[20]={}, len=0;\n    for(int i=0; d>0;++i) {\n        Xn[i]=d%k;\n        d/=k;\n        len=i;\n    }\n    for(int i=0; i<len/2; ++i) {\n        if(Xn[i]==Xn[len-i-1]) continue;\n        else return 0;\n    }\n    return 1;\n}\n\nbool judge(int n) {\n    int num=0;\n    for(int i=2; i<=10; ++i) {\n        if(change(n, i)) {\n            num++;\n            if(num>=2) return 1;\n        }\n    }\n    return 0;\n}\n\nint main() {\n\n    int N, S, num=0;\n    cin>>N>>S;\n    for(int i=S+1; num<N;++i) {\n        if(judge(i)) cout<<i<<endl, num++;\n    }\n\n    return 0;\n}",PARTIAL_ACCEPTED,31,516
1278146061783195648,a7f5dfee6d4c0ac87e0bbca530e410573351f56b486596cdd38d754ebc8a6ece,2020-07-01 09:59:02,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<bits/stdc++.h>\nusing namespace std;\nint B;\nstring s1;\nchar c[1000];\nchar d[1000];\nint main()\n{\n    cin>>B;\n    for(int i=1;i<301;i++)\n    {\n        int m=i,n=i*i;\n        int x=1,y=1;\n        while(m)\n        {\n            if(m%B>=10)d[x++]=char(m%B+55);\n            else d[x++]=m%B;\n            m=m/B;\n        }\n        string num1(d+1,d+x);\n    reverse(num1.begin(),num1.end());\n        while(n)\n        {\n            if(n%B>=10) c[y++]=char(n%B+55);\n            else c[y++]=n%B;\n            n=n/B;\n        }\n        string num2(c+1,c+y);\n        s1=num2;\n    reverse(num2.begin(),num2.end());\n        if(num2==s1){\n            cout<<num1<<\"" \""<<num2<<endl;\n        }\n    }\n}",WRONG_ANSWER,40,492
1278147985530093568,10d5b1fccc77f0ea491f60d75762a7b8e3a4e04f55cc06f23fa01eb7b66f9e47,2020-07-01 10:06:41,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n\nusing namespace std;\n\nbool change(int d, int k) { //十进制数d转化为k进制数\n    string s;\n    int Xn[20]={}, len=0;\n    for(int i=0; d>0;++i) {\n        Xn[i]=d%k;\n        d/=k;\n        len=i;\n    }\n    for(int i=0; i<=len/2; ++i) {\n        if(Xn[i]==Xn[len-i]) continue;\n        else return 0;\n    }\n    return 1;\n}\n\nbool judge(int n) {\n    int num=0;\n    for(int i=2; i<=10; ++i) {\n        if(change(n, i)) {\n            num++;\n            if(num>=2) return 1;\n        }\n    }\n    return 0;\n}\n\nint main() {\n\n    int N, S, num=0;\n    cin>>N>>S;\n    for(int i=S+1; num<N;++i) {\n        if(judge(i)) cout<<i<<endl, num++;\n    }\n\n    return 0;\n}\n",ACCEPTED,35,512
1278148147103064064,10d5b1fccc77f0ea491f60d75762a7b8e3a4e04f55cc06f23fa01eb7b66f9e47,2020-07-01 10:07:19,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n\nusing namespace std;\n\nbool change(int d, int k) { //十进制数d转化为k进制数\n    string s;\n    int Xn[20]={}, len=0;\n    for(int i=0; d>0;++i) {\n        Xn[i]=d%k;\n        d/=k;\n        len++;\n    }\n    for(int i=0; i<len/2; ++i) {\n        if(Xn[i]==Xn[len-i-1]) continue;\n        else return 0;\n    }\n    return 1;\n}\n\nbool judge(int n) {\n    int num=0;\n    for(int i=2; i<=10; ++i) {\n        if(change(n, i)) {\n            num++;\n            if(num>=2) return 1;\n        }\n    }\n    return 0;\n}\n\nint main() {\n\n    int N, S, num=0;\n    cin>>N>>S;\n    for(int i=S+1; num<N;++i) {\n        if(judge(i)) cout<<i<<endl, num++;\n    }\n\n    return 0;\n}\n",ACCEPTED,33,640
1278148154610868224,a7f5dfee6d4c0ac87e0bbca530e410573351f56b486596cdd38d754ebc8a6ece,2020-07-01 10:07:21,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<bits/stdc++.h>\nusing namespace std;\nint B;\nstring s1;\nchar c[1000];\nchar d[1000];\nint main()\n{\n    cin>>B;\n    for(int i=1;i<301;i++)\n    {\n        int m=i,n=i*i;\n        int x=1,y=1;\n        while(m)\n        {\n            if(m%B>=10)d[x++]=char(m%B+55);\n            else d[x++]=m%B+'0';\n            m=m/B;\n        }\n        string num1(d+1,d+x);\n    reverse(num1.begin(),num1.end());\n        while(n)\n        {\n            if(n%B>=10) c[y++]=char(n%B+55);\n            else c[y++]=n%B+'0';\n            n=n/B;\n        }\n        string num2(c+1,c+y);\n        s1=num2;\n    reverse(num2.begin(),num2.end());\n        if(num2==s1){\n            cout<<num1<<\"" \""<<num2<<endl;\n        }\n    }\n}",ACCEPTED,49,424
1278149592091131904,d2d929dca552a2902151cabadf975c515f33ca3b097430cc9be2fe1277254ea5,2020-07-01 10:13:04,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832," #include<iostream>\nusing namespace std;\n\nbool isPanlindromes(int number,int b){\n    int c,m=0,s[100];\n    while(number!=0){\n        c=number%b;\n        number=number/b;\n        s[m]=c;m++;\n    }\n    int flag=0;\n    for(int i=0;i<=m/2;i++){\n        if(s[i]==s[m-i-1])\n            flag=1;\n        else\n            flag=0;\n }\n    return flag;\n}\n\nint main(){\n    int N=0,S=0;\n    cin>>N>>S;\n    int num=0;\n    for(int i=S+1;num<N;i++){\n        int iCount=0;\n        for(int j=2;j<11;j++){\n            if(isPanlindromes(i,j))\n                iCount++;\n        }\n        if(iCount>=2){\n            num++;\n            cout<<i<<endl;\n        }\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,25,512
1278149743421612032,88732676b743960e66f48a24a8785dfbbedba30008ec9a259b0f4a920e0fff02,2020-07-01 10:13:40,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<cmath>\n#include<vector>\n\nusing namespace std;\n\nstring trans(int i, int n)//进制转换  数与进制\n{\n\tvector<char> a;\n\tstring c = \""\"";\n\twhile (true)\n\t{\n\t\tif (i == 0)\n\t\t\tbreak;\n\t\tif (i >= n)\n\t\t{\n\t\t\tint b;\n\t\t\tb = i % n;\n\t\t\tif (b < 10)\n\t\t\t{\n\t\t\t\ta.push_back(static_cast<char>(b+48));\n\t\t\t}\n\t\t\telse if (b == 10)\n\t\t\t\ta.push_back('A');\n\t\t\telse if (b == 11)\n\t\t\t\ta.push_back('B');\n\t\t\telse if (b == 12)\n\t\t\t\ta.push_back('C');\n\t\t\telse if (b == 13)\n\t\t\t\ta.push_back('D');\n\t\t\telse if (b == 14)\n\t\t\t\ta.push_back('E');\n\t\t\telse if (b == 15)\n\t\t\t\ta.push_back('F');\n\t\t\telse if (b == 16)\n\t\t\t\ta.push_back('G');\n\t\t\telse if (b == 17)\n\t\t\t\ta.push_back('H');\n\t\t\telse if (b == 18)\n\t\t\t\ta.push_back('I');\n\t\t\telse\n\t\t\t\ta.push_back('J');\n\t\t\ti /= n;\n\t\t}\n\t\telse\n\t\t{\n\t\t\ta.push_back(static_cast<char>(i+48));\n\t\t\tbreak;\n\t\t}\n\t}\n\tfor (int i = 0;i < a.size();++i)\n\t{\n\t\tc += a[a.size() - 1 - i];\n\t}\n\treturn c;\n}\n\nvoid judge(string a, string b) //判断是否是回文数，输入原数据和平方后的数据\n{\n\tint l = b.length();\n\tint ll = l / 2;\n\tbool pd = 1;\n\tfor (int i = 0;i < ll;++i)\n\t{\n\t\tif (b[i] != b[l - i - 1])\n\t\t\tpd = 0;\n\t}\n\tif (pd == 1)\n\t\tcout << a << \"" \"" << b << endl;\n}\n\n\nint main()\n{\n\tint n;\n\tcin >> n;\n\tfor (int i = 1;i <= 300;++i)\n\t{\n\t\tint di = pow(i, 2);\n\t\tstring a, b;\n\t\ta = trans(i, n);\n\t\tb = trans(di, n);\n\t\tjudge(a, b);\n\t}\n}",PARTIAL_ACCEPTED,33,492
1278150262185713664,f017d76b722e0629ef8d409901d76d17980d8cf068916305714242e03a43bdd5,2020-07-01 10:15:44,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n//#include<vector>\n//#include<cstring> \nusing namespace std;\n\nint fun1(int n, int x);\nint main() {\n\tint B, i;\n\tcin >> B;\n\tfor (i = 1; i <= 300; i++) {\n\t\tfun1(B, i);\n\t}\n}\nint fun1(int n, int x) {\n\tint i = 0, m = x * x, j, hui[100], squ[100], k = 0;\n\twhile (m != 0) {\n\t\thui[i] = m % n;\n\t\tm = m / n;\n\t\ti++;\n\t}\n\twhile (x != 0) {\n\t\tsqu[k] = x % n;\n\t\tx = x / n;\n\t\tk++;\n\t}\n\tfor (j = 0; j < i / 2; j++) {\n\t\tif (hui[j] != hui[i - j - 1]) return 0;\n\t}\n\tfor (j = k - 1; j > 0; j--)\n\t\tcout << squ[j];\n\tcout << squ[j] << \"" \"";\n\tfor (j = 0; j < i - 1; j++)\n\t\tcout << hui[j];\n\tcout << hui[j] << endl;\n}\n",PARTIAL_ACCEPTED,37,424
1278150769755226112,88732676b743960e66f48a24a8785dfbbedba30008ec9a259b0f4a920e0fff02,2020-07-01 10:17:45,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<cmath>\n#include<vector>\n\nusing namespace std;\n\nstring trans(int i, int n)//进制转换  数与进制\n{\n\tvector<char> a;\n\tstring c = \""\"";\n\twhile (true)\n\t{\n\t\tif (i == 0)\n\t\t\tbreak;\n\t\tif (i >= n)\n\t\t{\n\t\t\tint b;\n\t\t\tb = i % n;\n\t\t\tif (b < 10)\n\t\t\t{\n\t\t\t\ta.push_back(static_cast<char>(b+48));\n\t\t\t}\n\t\t\telse if (b == 10)\n\t\t\t\ta.push_back('A');\n\t\t\telse if (b == 11)\n\t\t\t\ta.push_back('B');\n\t\t\telse if (b == 12)\n\t\t\t\ta.push_back('C');\n\t\t\telse if (b == 13)\n\t\t\t\ta.push_back('D');\n\t\t\telse if (b == 14)\n\t\t\t\ta.push_back('E');\n\t\t\telse if (b == 15)\n\t\t\t\ta.push_back('F');\n\t\t\telse if (b == 16)\n\t\t\t\ta.push_back('G');\n\t\t\telse if (b == 17)\n\t\t\t\ta.push_back('H');\n\t\t\telse if (b == 18)\n\t\t\t\ta.push_back('I');\n\t\t\telse\n\t\t\t\ta.push_back('J');\n\t\t\ti /= n;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif (i < 10)\n\t\t\t{\n\t\t\t\ta.push_back(static_cast<char>(i + 48));\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\ta.push_back(static_cast<char>(i + 55));\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tfor (int i = 0;i < a.size();++i)\n\t{\n\t\tc += a[a.size() - 1 - i];\n\t}\n\treturn c;\n}\n\nvoid judge(string a, string b) //判断是否是回文数，输入原数据和平方后的数据\n{\n\tint l = b.length();\n\tint ll = l / 2;\n\tbool pd = 1;\n\tfor (int i = 0;i < ll;++i)\n\t{\n\t\tif (b[i] != b[l - i - 1])\n\t\t\tpd = 0;\n\t}\n\tif (pd == 1)\n\t\tcout << a << \"" \"" << b << endl;\n}\n\n\nint main()\n{\n\tint n;\n\tcin >> n;\n\tfor (int i = 1;i <= 300;++i)\n\t{\n\t\tint di = pow(i, 2);\n\t\tstring a, b;\n\t\ta = trans(i, n);\n\t\tb = trans(di, n);\n\t\tjudge(a, b);\n\t}\n}",ACCEPTED,33,448
1278150984230961152,06973ea832a5a1b65d8be68c7f42fd3c791dd6b87b2be7840bfba18d17eace9c,2020-07-01 10:18:36,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nint main()\n{\n\tint b;\n\tcin >> b;\n\tfor (int i = 1;i <= 300;i++)\n\t{\n\t\tint j;\n\t\tj = i * i;\n\t\tint s, x = 0;\n\t\ts = j;\n\t\twhile (s > 0)\n\t\t{\n\t\t\tx = x * 10 + s % 10;\n\t\t\ts = s / 10;\n\t\t}\n\t\tif (x == j)\n\t\t\tcout << i << \"" \""<<x << endl;\n\t}\n}",PARTIAL_ACCEPTED,31,508
1278152100582719488,fe1cf8095631d3f6d10612182a9b0c1bb58f664c354092fbb2d9ef41c3a7b9ba,2020-07-01 10:23:02,Python,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"def f(n,x):\n\n    #n为待转换的十进制数，x为机制，取值为2-16\n    a=[0,1,2,3,4,5,6,7,8,9]\n    b=[]\n    c=[]\n    while True:\n        s=n//x  # 商\n        y=n%x  # 余数\n        b=b+[y]\n        if s==0:\n            break\n        n=s\n    b.reverse()\n    for i in b:\n        c.append(str(a[i]))\n    return c\n\ndef countx(lst,x):\n    count=0\n    for ele in lst:\n        if(ele==x):\n            count=count+1\n    return count\n\nn,s=map(int,input().split())\na=[]\nb=[]\nc=[]\nfor i in range(s+1,13000):\n    for j in range(2,11):\n        jinzhi=f(i,j)\n        biaoshi=''.join(jinzhi)\n        x=biaoshi[::-1]\n        huiwei=''.join(x)\n        if(huiwei==biaoshi):\n            a.append(i)\nchang=len(a)\nfor k in range(0,chang):\n    cishu=countx(a,a[k])\n    if(cishu!=1):\n        b.append(a[k])\nc=list(set(b))\nc.sort()\nfor q in range(0,n):\n    print(c[q])",PARTIAL_ACCEPTED,220,3108
1278152261367160832,fe1cf8095631d3f6d10612182a9b0c1bb58f664c354092fbb2d9ef41c3a7b9ba,2020-07-01 10:23:40,Python,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"def f(n,x):\n\n    #n为待转换的十进制数，x为机制，取值为2-16\n    a=[0,1,2,3,4,5,6,7,8,9]\n    b=[]\n    c=[]\n    while True:\n        s=n//x  # 商\n        y=n%x  # 余数\n        b=b+[y]\n        if s==0:\n            break\n        n=s\n    b.reverse()\n    for i in b:\n        c.append(str(a[i]))\n    return c\n\ndef countx(lst,x):\n    count=0\n    for ele in lst:\n        if(ele==x):\n            count=count+1\n    return count\n\nn,s=map(int,input().split())\na=[]\nb=[]\nc=[]\nfor i in range(s+1,12356):\n    for j in range(2,11):\n        jinzhi=f(i,j)\n        biaoshi=''.join(jinzhi)\n        x=biaoshi[::-1]\n        huiwei=''.join(x)\n        if(huiwei==biaoshi):\n            a.append(i)\nchang=len(a)\nfor k in range(0,chang):\n    cishu=countx(a,a[k])\n    if(cishu!=1):\n        b.append(a[k])\nc=list(set(b))\nc.sort()\nfor q in range(0,n):\n    print(c[q])",PARTIAL_ACCEPTED,167,3072
1278152279348142080,d2d929dca552a2902151cabadf975c515f33ca3b097430cc9be2fe1277254ea5,2020-07-01 10:23:44,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832," #include<iostream>\nusing namespace std;\n\nbool isPanlindromes(int number,int b){         //b为转化为几进制\n    int c=0,m=0,s[100];\n    while(number!=0){\n        c=number%b;\n        number=number/b;\n        s[m]=c;m++;\n    }\n    for(int i=0;i<=m/2;i++){         //判断是否为回文数\n        if(s[i]!=s[m-i-1])\n            return 0;\n    }\n    return 1;\n\n}\n\nint main(){\n    int N=0,S=0;\n    cin>>N>>S;\n    int num=0;\n    for(int i=S+1;num<N;i++){\n        int iCount=0;\n        for(int j=2;j<11;j++){\n            if(isPanlindromes(i,j))\n                iCount++;\n        }\n        if(iCount>=2){\n            num++;\n            cout<<i<<endl;\n        }\n    }\n    return 0;\n}\n",ACCEPTED,39,512
1278152766965350400,f017d76b722e0629ef8d409901d76d17980d8cf068916305714242e03a43bdd5,2020-07-01 10:25:41,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n//#include<vector>\n//#include<cstring> \nusing namespace std;\n\nint fun1(int n, int x);\nint main() {\n\tint B, i;\n\tcin >> B;\n\tfor (i = 1; i <= 300; i++) {\n\t\tfun1(B, i);\n\t}\n}\nint fun1(int n, int x) {\n\tint i = 0, m = x * x, j,  k = 0;\n\tchar hui[100], squ[100];\n\twhile (m != 0) {\n\t\tint t;\n\t\tt = m % n;\n\t\tm = m / n;\n\t\tif (t >= 10) {\n\t\t\thui[i] = t - 10 + 'A';\n\t\t}\n\t\telse hui[i] = t;\n\t\ti++;\n\t}\n\twhile (x != 0) {\n\t\tint t;\n\t\tt = x % n;\n\t\tx = x / n;\n\t\tif (t >= 10) {\n\t\t\tsqu[k] = t - 10 + 'A';\n\t\t}\n\t\telse squ[k] = t;\n\t\tk++;\n\t}\n\tfor (j = 0; j < i / 2; j++) {\n\t\tif (hui[j] != hui[i - j - 1]) return 0;\n\t}\n\tfor (j = k - 1; j > 0; j--)\n\t\tcout << squ[j];\n\tcout << squ[j] << \"" \"";\n\tfor (j = 0; j < i - 1; j++)\n\t\tcout << hui[j];\n\tcout << hui[j] << endl;\n}",WRONG_ANSWER,35,452
1278153183988219904,fe1cf8095631d3f6d10612182a9b0c1bb58f664c354092fbb2d9ef41c3a7b9ba,2020-07-01 10:27:20,Python,50.0,1277062760129622024,1267449136707624960,1049226397448056832,"def f(n,x):\n\n    #n为待转换的十进制数，x为机制，取值为2-16\n    a=[0,1,2,3,4,5,6,7,8,9]\n    b=[]\n    c=[]\n    while True:\n        s=n//x  # 商\n        y=n%x  # 余数\n        b=b+[y]\n        if s==0:\n            break\n        n=s\n    b.reverse()\n    for i in b:\n        c.append(str(a[i]))\n    return c\n\ndef countx(lst,x):\n    count=0\n    for ele in lst:\n        if(ele==x):\n            count=count+1\n    return count\n\nn,s=map(int,input().split())\na=[]\nb=[]\nc=[]\nfor i in range(s+1,1000):\n    for j in range(2,11):\n        jinzhi=f(i,j)\n        biaoshi=''.join(jinzhi)\n        x=biaoshi[::-1]\n        huiwei=''.join(x)\n        if(huiwei==biaoshi):\n            a.append(i)\nchang=len(a)\nfor k in range(0,chang):\n    cishu=countx(a,a[k])\n    if(cishu!=1):\n        b.append(a[k])\nc=list(set(b))\nc.sort()\nfor q in range(0,n):\n    print(c[q])",PARTIAL_ACCEPTED,449,3324
1278155464162861056,6d4abd2973f12e6e270340909afbb26a937044d1c657dc2d58ef0d362c07a718,2020-07-01 10:36:24,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <cstdlib>\nusing namespace std;\n\nbool Palin_num(const char* a) // 判断n是否为回文数，字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length, flag = 1;\n    length = strlen(a);\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1]) \n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1) // 是回文数；\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    int j = 0;\n    for (int i = 1; i <= 300; i++)\n    {\n        j = i; // 创建副本\n        \n        char string_1[25];           // 将整数按n进制转换\n        _itoa_s(j, string_1, n);     \n        char string_2[25];\n        _itoa_s((j*j), string_2, n); // 将该数的平方按n进制转换\n        \n        if (Palin_num(string_2))\n        {\n            printf(\""%s %s\\n\"", string_1, string_2);\n        }\n        else\n        {\n            continue;\n        }\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1278155583981551616,6d4abd2973f12e6e270340909afbb26a937044d1c657dc2d58ef0d362c07a718,2020-07-01 10:36:52,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cstdio>\n#include <string>\n#include <cstdlib>\nusing namespace std;\n\nbool Palin_num(const char* a) // 判断n是否为回文数，字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length, flag = 1;\n    length = strlen(a);\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1]) \n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1) // 是回文数；\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    int j = 0;\n    for (int i = 1; i <= 300; i++)\n    {\n        j = i; // 创建副本\n        \n        char string_1[25];           // 将整数按n进制转换\n        _itoa_s(j, string_1, n);     \n        char string_2[25];\n        _itoa_s((j*j), string_2, n); // 将该数的平方按n进制转换\n        \n        if (Palin_num(string_2))\n        {\n            printf(\""%s %s\\n\"", string_1, string_2);\n        }\n        else\n        {\n            continue;\n        }\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1278156080075440128,fe1cf8095631d3f6d10612182a9b0c1bb58f664c354092fbb2d9ef41c3a7b9ba,2020-07-01 10:38:51,Python,50.0,1277062760129622024,1267449136707624960,1049226397448056832,"def f(n,x):\n\n    #n为待转换的十进制数，x为机制，取值为2-16\n    a=[0,1,2,3,4,5,6,7,8,9]\n    b=[]\n    c=[]\n    while True:\n        s=n//x  # 商\n        y=n%x  # 余数\n        b=b+[y]\n        if s==0:\n            break\n        n=s\n    b.reverse()\n    for i in b:\n        c.append(str(a[i]))\n    return c\n\ndef countx(lst,x):\n    count=0\n    for ele in lst:\n        if(ele==x):\n            count=count+1\n    return count\n\nn,s=map(int,input().split())\na=[]\nb=[]\nc=[]\nif(s<501):\n  for i in range(s+1,1000):\n    for j in range(2,11):\n        jinzhi=f(i,j)\n        biaoshi=''.join(jinzhi)\n        x=biaoshi[::-1]\n        huiwei=''.join(x)\n        if(huiwei==biaoshi):\n            a.append(i)\nif(s>=500):\n    for i in range(s+1,12356):\n        for j in range(2,11):\n            jinzhi=f(i,j)\n            biaoshi=''.join(jinzhi)\n            x=biaoshi[::-1]\n            huiwei=''.join(x)\n            if(huiwei==biaoshi):\n                a.append(i)\nchang=len(a)\nfor k in range(0,chang):\n    cishu=countx(a,a[k])\n    if(cishu!=1):\n        b.append(a[k])\nc=list(set(b))\nc.sort()\nfor q in range(0,n):\n    print(c[q])\n",PARTIAL_ACCEPTED,515,3176
1278156175449718784,6d4abd2973f12e6e270340909afbb26a937044d1c657dc2d58ef0d362c07a718,2020-07-01 10:39:13,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cstdio>\n#include <string>\n#include <cstdlib>\nusing namespace std;\n\nbool Palin_num(const char* a) // 判断n是否为回文数，字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length, flag = 1;\n    length = strlen(a);\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1]) \n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1) // 是回文数；\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    int j = 0;\n    for (int i = 1; i <= 300; i++)\n    {\n        j = i; // 创建副本\n        \n        char string_1[25];           // 将整数按n进制转换\n        _itoa_s(j, string_1, n);     \n        char string_2[25];\n        _itoa_s((j*j), string_2, n); // 将该数的平方按n进制转换\n        \n        if (Palin_num(string_2))\n        {\n            printf(\""%s %s\\n\"", string_1, string_2);\n        }\n        else\n        {\n            continue;\n        }\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1278156327946223616,fe1cf8095631d3f6d10612182a9b0c1bb58f664c354092fbb2d9ef41c3a7b9ba,2020-07-01 10:39:50,Python,60.0,1277062760129622024,1267449136707624960,1049226397448056832,"def f(n,x):\n\n    #n为待转换的十进制数，x为机制，取值为2-16\n    a=[0,1,2,3,4,5,6,7,8,9]\n    b=[]\n    c=[]\n    while True:\n        s=n//x  # 商\n        y=n%x  # 余数\n        b=b+[y]\n        if s==0:\n            break\n        n=s\n    b.reverse()\n    for i in b:\n        c.append(str(a[i]))\n    return c\n\ndef countx(lst,x):\n    count=0\n    for ele in lst:\n        if(ele==x):\n            count=count+1\n    return count\n\nn,s=map(int,input().split())\na=[]\nb=[]\nc=[]\nif(s<=501):\n  for i in range(s+1,1000):\n    for j in range(2,11):\n        jinzhi=f(i,j)\n        biaoshi=''.join(jinzhi)\n        x=biaoshi[::-1]\n        huiwei=''.join(x)\n        if(huiwei==biaoshi):\n            a.append(i)\nif(s>500):\n    for i in range(s+1,12356):\n        for j in range(2,11):\n            jinzhi=f(i,j)\n            biaoshi=''.join(jinzhi)\n            x=biaoshi[::-1]\n            huiwei=''.join(x)\n            if(huiwei==biaoshi):\n                a.append(i)\nchang=len(a)\nfor k in range(0,chang):\n    cishu=countx(a,a[k])\n    if(cishu!=1):\n        b.append(a[k])\nc=list(set(b))\nc.sort()\nfor q in range(0,n):\n    print(c[q])\n",PARTIAL_ACCEPTED,582,3316
1278156506418053120,6d4abd2973f12e6e270340909afbb26a937044d1c657dc2d58ef0d362c07a718,2020-07-01 10:40:32,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <cstdio>\n#include <string>\n#include <cstdlib>\nusing namespace std;\n\nbool Palin_num(const char* a) // 判断n是否为回文数，字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length, flag = 1;\n    length = strlen(a);\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1]) \n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1) // 是回文数；\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    int j = 0;\n    for (int i = 1; i <= 300; i++)\n    {\n        j = i; // 创建副本\n        \n        char string_1[25];           // 将整数按n进制转换\n        _itoa_s(j, string_1, n);     \n        char string_2[25];\n        _itoa_s((j*j), string_2, n); // 将该数的平方按n进制转换\n        \n        if (Palin_num(string_2))\n        {\n            printf(\""%s %s\\n\"", string_1, string_2);\n        }\n        else\n        {\n            continue;\n        }\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1278156964423467008,b3438195db15c9328b592c77d8e45a988f1211d1946f94d918b626712b5b9f58,2020-07-01 10:42:21,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <cstring>\n\nusing namespace std;\nint n, s;\nint m[100];\n\nbool check(const int &x);\n\nint main() {\n    cin >> n >> s;\n    for (int i = s + 1, j = 0; j < n; ++i) {\n        if (check(i)) {\n            j++;\n            cout << i;\n            cout << endl;\n        }\n    }\n    return 0;\n}\n\nbool check(const int &x) {\n    int flag = 0;\n\n    for (int i = 2; i <= 10; ++i) {\n        int k = 0;\n        int y = x;\n        int compare = 0;\n        while (y > 0) {\n            ++k;\n            m[k] = y % i;\n            y = y / i;\n        }\n\n        for (int j = 1; j < k; ++j, --k) {\n            if (m[j] != m[k]) {\n                compare++;\n            }\n            if (compare == 0)\n                flag++;\n        }\n        if (flag >= 2)\n            break;\n    }\n    cout<<flag<<\"" \"";\n    return flag >= 2;\n}\n",WRONG_ANSWER,18,508
1278157064579252224,b3438195db15c9328b592c77d8e45a988f1211d1946f94d918b626712b5b9f58,2020-07-01 10:42:45,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <cstring>\n\nusing namespace std;\nint n, s;\nint m[100];\n\nbool check(const int &x);\n\nint main() {\n    cin >> n >> s;\n    for (int i = s + 1, j = 0; j < n; ++i) {\n        if (check(i)) {\n            j++;\n            cout << i;\n            cout << endl;\n        }\n    }\n    return 0;\n}\n\nbool check(const int &x) {\n    int flag = 0;\n\n    for (int i = 2; i <= 10; ++i) {\n        int k = 0;\n        int y = x;\n        int compare = 0;\n        while (y > 0) {\n            ++k;\n            m[k] = y % i;\n            y = y / i;\n        }\n\n        for (int j = 1; j < k; ++j, --k) {\n            if (m[j] != m[k]) {\n                compare++;\n            }\n            if (compare == 0)\n                flag++;\n        }\n        if (flag >= 2)\n            break;\n    }\n    return flag >= 2;\n}\n",WRONG_ANSWER,32,516
1278157270368583680,6d4abd2973f12e6e270340909afbb26a937044d1c657dc2d58ef0d362c07a718,2020-07-01 10:43:34,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cstdlib>\nusing namespace std;\n\nbool Palin_num(const char* a) // 判断n是否为回文数，字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length, flag = 1;\n    length = strlen(a);\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1]) \n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1) // 是回文数；\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    int j = 0;\n    for (int i = 1; i <= 300; i++)\n    {\n        j = i; // 创建副本\n        \n        char string_1[25];           // 将整数按n进制转换\n        _itoa_s(j, string_1, n);     \n        char string_2[25];\n        _itoa_s((j*j), string_2, n); // 将该数的平方按n进制转换\n        \n        if (Palin_num(string_2))\n        {\n            printf(\""%s %s\\n\"", string_1, string_2);\n        }\n        else\n        {\n            continue;\n        }\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1278157476564762624,fe1cf8095631d3f6d10612182a9b0c1bb58f664c354092fbb2d9ef41c3a7b9ba,2020-07-01 10:44:24,Python,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"def f(n,x):\n\n    #n为待转换的十进制数，x为机制，取值为2-16\n    a=[0,1,2,3,4,5,6,7,8,9]\n    b=[]\n    c=[]\n    while True:\n        s=n//x  # 商\n        y=n%x  # 余数\n        b=b+[y]\n        if s==0:\n            break\n        n=s\n    b.reverse()\n    for i in b:\n        c.append(str(a[i]))\n    return c\n\ndef countx(lst,x):\n    count=0\n    for ele in lst:\n        if(ele==x):\n            count=count+1\n    return count\n\nn,s=map(int,input().split())\na=[]\nb=[]\nc=[]\nif(s<=501):\n  for i in range(s+1,1000):\n    for j in range(2,11):\n        jinzhi=f(i,j)\n        biaoshi=''.join(jinzhi)\n        x=biaoshi[::-1]\n        huiwei=''.join(x)\n        if(huiwei==biaoshi):\n            a.append(i)\nif(s>500):\n    if(s<2000):\n        for i in range(s+1,3000):\n            for j in range(2,11):\n                jinzhi=f(i,j)\n                biaoshi=''.join(jinzhi)\n                x=biaoshi[::-1]\n                huiwei=''.join(x)\n                if(huiwei==biaoshi):\n                    a.append(i)\n    else:\n        for i in range(s+1,12356):\n            for j in range(2,11):\n                jinzhi=f(i,j)\n                biaoshi=''.join(jinzhi)\n                x=biaoshi[::-1]\n                huiwei=''.join(x)\n                if(huiwei==biaoshi):\n                    a.append(i)\nchang=len(a)\nfor k in range(0,chang):\n    cishu=countx(a,a[k])\n    if(cishu!=1):\n        b.append(a[k])\nc=list(set(b))\nc.sort()\nfor q in range(0,n):\n    print(c[q])\n",ACCEPTED,679,3200
1278160145878548480,1d03dde7416ddffb412b8eab4ebb5de6b9f6decff8dcd87fb41585be3198cc5c,2020-07-01 10:55:00,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint if_s(int p, int x){\n    int flag = 1;\n    int m;\n    int a[25] = {};\n    for (m = 0; x; m++)\n    {\n        a[m] = x % p;\n        x /= p;\n    }\n    for (int i = 0; i < m; i++){\n        if (a[i] == a[m - 1 - i])\n            continue;\n        else\n            flag = 0;\n    }\n    return flag;\n}\n\nint main(){\n    int n, s;\n\n    cin >> n >> s;\n    for (int i = s + 1, count = 0; count < n;i++){\n        int flag = 0;\n        for (int p = 2; p <= 10;p++){\n            if(if_s(p, i))\n                flag++;\n            else\n                continue;\n            if(flag==2){\n                cout << i << endl;\n                count++;\n                break;\n            }\n        }\n    }\n\n    return 0;\n}",ACCEPTED,40,396
1278160280767365120,5afb2898af2e2f187059039ee1eb4dc82fd59bf73b18e0ba6d37877ae0c71ebd,2020-07-01 10:55:32,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\n\nusing namespace std;\n\nint main()\n{\n\tconst char num[21] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J','K' };\n\tint n;//进制\n\tcin >> n;\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\tint a = 0;\n\t\tint b = i;\n\t\tint c = 0;\n\t\tvector<char> oldnum;\n\t\tvector<char> pingfang;\n\t\tint j = i * i;\n\t\twhile (b>0)\n\t\t{\n\t\t\ta = b % n;\n\t\t\tb = b / n;\n\t\t\toldnum.push_back(num[a]);\n\t\t\tc++;\n\t\t}\n\t\tint d = j;\n\t\tint e = 0;\n\t\twhile (d > 0)\n\t\t{\n\t\t\ta = d % n;\n\t\t\td = d / n;\n\t\t\tpingfang.push_back(num[a]);\n\t\t\te++;\n\t\t}\n\t\tint flag = 1;\n\t\tfor (int k = 0; k < e/2; k++)\n\t\t{\n\t\t\tif (pingfang[k] != pingfang[e - 1 - k])\n\t\t\t{\n\t\t\t\tflag = 0;\n\t\t\t}\n\t\t}\n\t\tif (flag == 1)\n\t\t{\n\t\t\tfor (int i = c-1; i >= 0; i--)\n\t\t\t{\n\t\t\t\tcout << oldnum[i];\n\t\t\t}\n\t\t\tcout << \"" \"";\n\t\t\tfor (int i = e - 1; i >= 0; i--)\n\t\t\t{\n\t\t\t\tcout << pingfang[i];\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\n\t}\n}",ACCEPTED,29,624
1278160368822575104,50da7c55b44113943112c360765f2d343ea2a5045d304c0432b745d6e1c999fb,2020-07-01 10:55:53,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\nchar ch1[21]= {'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nint judge(long long n,char ch2[1000],long long B,long long *k)\n{\n    long long i,j;\n\n    while(n)\n    {\n        ch2[(*k)++]=ch1[n%B];\n        n=n/B;\n    }\n    ch2[*k]='\\0';\n\n    i=0;\n    j=*k-1;\n    while(i<j)\n    {\n        if(ch2[i]!=ch2[j])\n            return 0;\n        i++;\n        j--;\n    }\n\n    return 1;\n\n}\nint main()\n{\n    long long B,i,j,k,t;\n    char ch2[1000];\n    while(~scanf(\""%lld\"",&B))\n    {\n        for(i=1; i<=300; i++)\n        {\n            k=0;\n            if(judge(i*i,ch2,B,&k)==1)\n            {\n                t=i;\n                k=0;\n                while(t)\n                {\n                    ch2[k++]=ch1[t%B];\n                    t=t/B;\n                }\n                ch2[k]='\\0';\n\n                k--;\n                while(k>=0)\n                {\n                    cout<<ch2[k--];\n                }\n\n\n                k=0;\n                cout<<\"" \"";\n                judge(i*i,ch2,B,&k);\n                k--;\n                while(k>=0)\n                    cout<<ch2[k--];\n                cout<<\""\\n\"";\n            }\n        }\n    }\n\n\n}",ACCEPTED,27,512
1278161210439032832,6d4abd2973f12e6e270340909afbb26a937044d1c657dc2d58ef0d362c07a718,2020-07-01 10:59:14,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\nusing namespace std;\n\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length, flag = 1;\n    length = a.length();\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1]) \n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1) // 是回文数；\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，n是待转数字，radix是指定的进制\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\t\n        {\n            ans += t + '0';\n        }\n        else \n        {\n            ans += t - 10 + 'a';\n        }\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（）以防止输入为0的情况\n    reverse(ans.begin(), ans.end());\n    return ans;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    int j = 0;\n    for (int i = 1; i <= 300; i++)\n    {\n        j = i; // 创建副本\n        \n        string s1 = intToA(j, n);      // 将整数按n进制转换\n        string s2 = intToA((j * j), n);// 将该数的平方按n进制转换\n\n        if (Palin_num(s2))\n        {\n            cout << s1 << \"" \"" << s2 << endl;\n        }\n        else\n        {\n            continue;\n        }\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1278162103205027840,6d4abd2973f12e6e270340909afbb26a937044d1c657dc2d58ef0d362c07a718,2020-07-01 11:02:47,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\nusing namespace std;\n\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length, flag = 1;\n    length = a.length();\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1]) \n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1) // 是回文数；\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，n是待转数字，radix是指定的进制\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\t\n        {\n            ans += t + '0';\n        }\n        else \n        {\n            ans += t - 10 + 'a';\n        }\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（）以防止输入为0的情况\n    reverse(ans.begin(), ans.end());\n    return ans;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    int j = 0;\n    for (int x = 1; x <= 300; x++)\n    {\n        j = x; // 创建副本\n        \n        string s1 = intToA(j, n);      // 将整数按n进制转换\n        string s2 = intToA((j * j), n);// 将该数的平方按n进制转换\n\n        if (Palin_num(s2))\n        {\n            cout << s1 << \"" \"" << s2 << endl;\n        }\n        else\n        {\n            continue;\n        }\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1278162535977508864,53ae28e3dbe2f18670c3ebaf391c09f8e570189a6475fc91a2ef814fd1b9799c,2020-07-01 11:04:30,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"//double palindromic number\n#include <iostream>\nusing namespace std;\n\nint N,S,temp2=0;//Ê®½øÖÆÒÔÄÚ¶¼ÊÇÊý×Ö \nint array[14];//×î´óÖµÇø¼ä10000µÄ×îС½øÖÆÊýΪ10011100010000Ϊ14λ \nbool get_palin(int x);\n\nint main(){\n\tcin>>N>>S;\n\tbool temp;\n\tfor (int i=S+1;;i++){\n\t\ttemp = get_palin(i);\n\t\tif (temp){\n\t\t\tcout << i <<endl;\n\t\t\ttemp2++;\n\t\t}\n\t\tif (temp2==N){\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn 0;\n}\n\nbool get_palin(int x){\n\tint sum=0;\n\tfor (int m=2;m<11;m++){\n\t\tint mod_a=0,index=0,temp3=x;\n\t\tarray[14]={0};\n\t\twhile (temp3){\n\t\t\tmod_a=temp3%m;\n\t\t\ttemp3 = temp3/m;\n\t\t\t\n\t\t\tif (!temp3){\n\t\t\t\tif (mod_a){\n\t\t\t\t\tarray[index]=mod_a;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tarray[index]=mod_a;\n\t\t\tindex++;\n\t\t}\n\t\tfor (int k=0;k<=(index/2);k++){\n\t\t\tif (array[k]!=array[index-k]){\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t}\n\t\tsum++;\n\t\tif (sum>2){\n\t\t\tbreak;\n\t\t}\n\t}\n\tif (sum>2){\n\t\treturn true;\n\t}\n\telse {\n\t\treturn false;\n\t}\n}",WRONG_ANSWER,1013,896
1278163054301216768,f017d76b722e0629ef8d409901d76d17980d8cf068916305714242e03a43bdd5,2020-07-01 11:06:33,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n//#include<vector>\n//#include<cstring> \nusing namespace std;\n\nint fun1(int n, int x);\nint main() {\n\tint B, i;\n\tcin >> B;\n\tfor (i = 1; i <= 300; i++) {\n\t\tfun1(B, i);\n\t}\n}\nint fun1(int n, int x) {\n\tint i = 0, m = x * x, j,  k = 0;\n\tchar hui[100], squ[100];\n\twhile (m != 0) {\n\t\tint t;\n\t\tt = m % n;\n\t\tm = m / n;\n\t\tif (t >= 10) {\n\t\t\thui[i] = t - 10 + 65;\n\t\t}\n\t\telse hui[i] = t;\n\t\ti++;\n\t}\n\twhile (x != 0) {\n\t\tint t;\n\t\tt = x % n;\n\t\tx = x / n;\n\t\tif (t >= 10) {\n\t\t\tsqu[k] = t - 10 + 65;\n\t\t}\n\t\telse squ[k] = t;\n\t\tk++;\n\t}\n\tfor (j = 0; j < i / 2; j++) {\n\t\tif (hui[j] != hui[i - j - 1]) return 0;\n\t}\n\tfor (j = k - 1; j > 0; j--)\n\t\tcout << squ[j];\n\tcout << squ[j] << \"" \"";\n\tfor (j = 0; j < i - 1; j++)\n\t\tcout << hui[j];\n\tcout << hui[j] << endl;\n}",WRONG_ANSWER,37,644
1278163262447747072,8982f04dde07ce4ad3a2f17670cf29d21b7c6bf721b7ae32b7b1ca54fff9aca7,2020-07-01 11:07:23,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <stack>\n#include <string>\n#include <string.h>\n#include <algorithm>\n#include <math.h>\nusing namespace std;\n\nvoid f(int n,int r){//n是十进制的数字，r是进制\n    stack <int> s;\n    while (n) {\n        s.push(n%r);\n        n/=r;\n    }\n    while (!s.empty()) {\n        switch (s.top()) {\n        case 10:cout<<'A';break;\n        case 11:cout<<'B';break;\n        case 12:cout<<'C';break;\n        case 13:cout<<'D';break;\n        case 14:cout<<'E';break;\n        case 15:cout<<'F';break;\n        case 16:cout<<'G';break;\n        case 17:cout<<'H';break;\n        case 18:cout<<'I';break;\n        case 19:cout<<'J';break;\n        default:cout<<s.top();break;\n        }\n        s.pop();\n    }\n}\nbool huiwen(string str){//回文返回1，不是回文返回0\n    string compare=str;\n    reverse(compare.begin(),compare.end());\n    if (str==compare)\n        return true;\n    else\n        return false;\n}\nint main(){\n    int a;cin>>a;\n    for (int i=1;i<=300;i++){\n        if (huiwen(to_string(i*i))==1){\n            f(i,a);cout<<\"" \"";f(i*i,a);cout<<endl;\n        }\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,38,512
1278163509240586240,b3438195db15c9328b592c77d8e45a988f1211d1946f94d918b626712b5b9f58,2020-07-01 11:08:22,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <cstring>\n\nusing namespace std;\nint n, s;\nint m[100];\n\nbool check(const int &x);\n\nint main() {\n    cin >> n >> s;\n    for (int i = s + 1, j = 0; j < n; ++i) {\n        if (check(i)) {\n            j++;\n            if (j == 1) cout << i;\n            else cout << endl << i;\n        }\n    }\n    return 0;\n}\n\nbool check(const int &x) {\n    int flag = 0;\n    for (int i = 2; i <= 10; ++i) {\n        int k = 0;\n        int y = x;\n        int compare = 0;\n        while (y > 0) {\n            ++k;\n            m[k] = y % i;\n            y = y / i;\n        }\n        for (int j = 1; j < k; ++j, --k) {\n            if (m[j] != m[k]) {\n                compare++;\n            }\n        }\n        if (compare == 0) {\n            flag++;\n        }\n        if (flag >= 2)\n            break;\n    }\n    return flag >= 2;\n}\n",ACCEPTED,29,512
1278163591583170560,f017d76b722e0629ef8d409901d76d17980d8cf068916305714242e03a43bdd5,2020-07-01 11:08:42,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"\n#include<iostream>\n//#include<vector>\n//#include<cstring> \nusing namespace std;\n\nint fun1(int n, int x);\nint main() {\n\tint B, i;\n\tcin >> B;\n\tfor (i = 1; i <= 300; i++) {\n\t\tfun1(B, i);\n\t}\n}\nint fun1(int n, int x) {\n\tint i = 0, m = x * x, j, hui[100], squ[100], k = 0;\n\twhile (m != 0) {\n\t\thui[i] = m % n;\n\t\tm = m / n;\n\t\ti++;\n\t}\n\twhile (x != 0) {\n\t\tsqu[k] = x % n;\n\t\tx = x / n;\n\t\tk++;\n\t}\n\tfor (j = 0; j < i / 2; j++) {\n\t\tif (hui[j] != hui[i - j - 1]) return 0;\n\t}\n\tfor (j = k - 1; j > 0; j--)\n\t\tcout << squ[j];\n\tcout << squ[j] << \"" \"";\n\tfor (j = 0; j < i - 1; j++)\n\t\tcout << hui[j];\n\tcout << hui[j] << endl;\n}\n",PARTIAL_ACCEPTED,40,424
1278163821691076608,f017d76b722e0629ef8d409901d76d17980d8cf068916305714242e03a43bdd5,2020-07-01 11:09:36,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"\n#include<iostream>\n//#include<vector>\n//#include<cstring> \nusing namespace std;\n\nint fun1(int n, int x);\nint main() {\n\tint B, i;\n\tcin >> B;\n\tfor (i = 1; i <= 300; i++) {\n\t\tfun1(B, i);\n\t}\n}\nint fun1(int n, int x) {\n\tint i = 0, m = x * x, j, k = 0;\n    char hui[100], squ[100];\n\twhile (m != 0) {\n\t\thui[i] = m % n;\n\t\tm = m / n;\n\t\ti++;\n\t}\n\twhile (x != 0) {\n\t\tsqu[k] = x % n;\n\t\tx = x / n;\n\t\tk++;\n\t}\n\tfor (j = 0; j < i / 2; j++) {\n\t\tif (hui[j] != hui[i - j - 1]) return 0;\n\t}\n\tfor (j = k - 1; j > 0; j--)\n\t\tcout << squ[j];\n\tcout << squ[j] << \"" \"";\n\tfor (j = 0; j < i - 1; j++)\n\t\tcout << hui[j];\n\tcout << hui[j] << endl;\n}\n",WRONG_ANSWER,45,512
1278164293806120960,5b9e16c7c3a906f88d0a01276354bb098677db5179094503bda3bfdac7646244,2020-07-01 11:11:29,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint B;\nint arr[20];\n\nvoid print(int x);\n\nint main()\n{\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\tint judge = 1;\n\t\tint j = 0;\n\t\tint a = i * i;\n\t\twhile (a)\n\t\t{\n\t\t\tarr[j] = a % B;\n\t\t\ta = a / B;\n\t\t\tj++;\n\t\t}\n\t\tfor (int m = 0, n = j - 1; m < n; m++, n--)\n\t\t{\n\t\t\tif (arr[m] != arr[n])\n\t\t\t\tjudge = 0;\n\t\t}\n\t\tif (judge == 1)\n\t\t{\n\t\t\tprint(i);\n\t\t\tcout << \"" \"";\n\t\t\tprint(i * i);\n\t\t\tcout << endl;\n\t\t}\n\t}\n}\n\nvoid print(int x)\n{\n\tint tmp = 0;\n\twhile (x)\n\t{\n\t\tarr[tmp] = x % B;\n\t\tx = x / B;\n\t\ttmp++;\n\t}\n\tfor (int k = tmp - 1; k >= 0; k--)\n\t{\n\t\tif (arr[k] > 9)\n\t\t\tcout << arr[k] - 10 + 'A';\n\t\telse\n\t\t\tcout << arr[k];\n\t}\n}",PARTIAL_ACCEPTED,48,636
1278164911274786816,10d5b1fccc77f0ea491f60d75762a7b8e3a4e04f55cc06f23fa01eb7b66f9e47,2020-07-01 11:13:56,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\nstring trans(int n, int B, int &len) {\n    string ori;\n    for(int i=0; n>0;++i) {\n        if(n%B<10) ori+=char(n%B+48);\n        else ori+=char(n%B+55);\n        n/=B;\n        len++;\n    }\n    return ori;\n}\n\nbool judge(int d, int k) {\n    int len=0, len1=0;\n    string s_spr=trans(d*d, k, len), s_ori=trans(d, k, len1);\n    for(int i=0; i<len/2; ++i) {\n        if(s_spr[i]==s_spr[len-i-1]) continue;\n        else return 0;\n    }\n    cout<<s_ori<<' '<<s_spr<<endl;\n    return 1;\n}\n\nint main() {\n    int B;\n    cin>>B;\n    for(int i=1; i<=300; ++i) {\n        judge(i, B);\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1278164945345118208,10d5b1fccc77f0ea491f60d75762a7b8e3a4e04f55cc06f23fa01eb7b66f9e47,2020-07-01 11:14:04,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\nstring trans(int n, int B, int &len) {\n    string ori;\n    for(int i=0; n>0;++i) {\n        if(n%B<10) ori+=char(n%B+48);\n        else ori+=char(n%B+55);\n        n/=B;\n        len++;\n    }\n    return ori;\n}\n\nbool judge(int d, int k) {\n    int len=0, len1=0;\n    string s_spr=trans(d*d, k, len), s_ori=trans(d, k, len1);\n    for(int i=0; i<len/2; ++i) {\n        if(s_spr[i]==s_spr[len-i-1]) continue;\n        else return 0;\n    }\n    cout<<s_ori<<' '<<s_spr<<endl;\n    return 1;\n}\n\nint main() {\n    int B;\n    cin>>B;\n    for(int i=1; i<=300; ++i) {\n        judge(i, B);\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,36,512
1278165477371600896,f017d76b722e0629ef8d409901d76d17980d8cf068916305714242e03a43bdd5,2020-07-01 11:16:11,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"\n#include<iostream>\n//#include<vector>\n//#include<cstring> \nusing namespace std;\n\nint fun1(int n, int x);\nint main() {\n\tint B, i;\n\tcin >> B;\n\tfor (i = 1; i <= 300; i++) {\n\t\tfun1(B, i);\n\t}\n}\nint fun1(int n, int x) {\n\tint i = 0, m = x * x, j, k = 0;\n    int hui[100], squ[100];\n\twhile (m != 0) {\n        int t;\n\t\tt = m % n;\n\t\tm = m / n;\n        if(t>=10){\n            hui[i] = t-10+'A';\n        }else hui[i] = t;\n\t\ti++;\n\t}\n\twhile (x != 0) {\n        int t;\n\t\tsqu[k] = x % n;\n\t\tx = x / n;\n        if(t>=10){\n            squ[k] = t-10+'A';\n        }elsesqu[k] = t;\n\t\tk++;\n\t}\n\tfor (j = 0; j < i / 2; j++) {\n\t\tif (hui[j] != hui[i - j - 1]) return 0;\n\t}\n\tfor (j = k - 1; j > 0; j--)\n\t\tcout << squ[j];\n\tcout << squ[j] << \"" \"";\n\tfor (j = 0; j < i - 1; j++)\n\t\tcout << hui[j];\n\tcout << hui[j] << endl;\n}\n",COMPILE_ERROR,0,0
1278166641962049536,5f6fe5ec2e9f1448b66bc330cc1ed4d1d67a835fd6cdce39f4a1bed8c73e173d,2020-07-01 11:20:49,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream> \nusing namespace std;\nint main()\n{\n\tint n, s;\n\tint c[500];\n\tint b;\n\tint i,m,j;\n\tint tam;\n\tint t;\n\tint f;\n\tint p;\n\tcin >> n ;\n\tcin >> s;\n\tfor (; n > 0; )\n\t{\n\t\ts++;\n\t\tt = 0;\n\t\tfor (b = 2; b < 11; b++)\n\t\t{\n\t\t\tf = 1;\n\t\t\ttam = s;\n\t\t\tm = 0;\n\t\t\twhile (tam != 0)\n\t\t\t{\n\t\t\t\tp = tam % b;\n\t\t\t\ttam = tam / b;\n\t\t\t\tm++; c[m] = p;\n\t\t\t}\n\t\t\tfor (j = 1; j <= m; j++)\n\t\t\t{\n\n\t\t\t\tif (c[j] != c[m + 1 - j])\n\t\t\t\t{\n\t\t\t\t\tf = 0;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (f == 1)\n\t\t\t\tt = t + 1;\n\t\t\tif (t == 2)\n\t\t\t{\n\t\t\t\tcout << s<<endl;\n\t\t\t\tn = n - 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tsystem(\""pause\"");\n\treturn 0;\n}\n",ACCEPTED,36,552
1278167192598675456,6d4abd2973f12e6e270340909afbb26a937044d1c657dc2d58ef0d362c07a718,2020-07-01 11:23:00,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm> \nusing namespace std;\n\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1]) \n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1) // 是回文数；\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，n是待转数字，radix是指定的进制\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\t\n        {\n            ans += t + '0';\n        }\n        else \n        {\n            ans += t - 10 + 'a';\n        }\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（）以防止输入为0的情况\n    reverse(ans.begin(), ans.end());\n    return ans;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    int j = 0;\n    for (int x = 1; x <= 300; x++)\n    {\n        j = x; // 创建副本\n        \n        string s1 = intToA(j, n);      // 将整数按n进制转换\n        string s2 = intToA((j * j), n);// 将该数的平方按n进制转换\n\n        if (Palin_num(s2))\n        {\n            cout << s1 << \"" \"" << s2 << endl;\n        }\n        else\n        {\n            continue;\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,44,508
1278167497507790848,adca0e7fe2da494372711b65889bb7f278f78ac4d835384b93663445fbd6db0d,2020-07-01 11:24:13,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\n\nint main()\n{\n    //接收数据\n    int N,M;\n    cin >> N >> M;\n    int Pi[M],Ai[M];\n    for(int i=0;i<M;i++)\n    {\n        cin >> Pi[i] >>Ai[i];\n    }\n    //对Pi和Ai根据Pi进行冒泡排序\n    int n{1};\n    while(n!=0)\n    {\n        n=0;\n        for(int a=0;a<M;a++)\n        {\n            if(a+1<M)\n            {\n                if(Pi[a]>Pi[a+1])\n                {\n                    n++;\n                    int temp;\n                    temp = Pi[a];\n                    Pi[a] = Pi[a+1];\n                    Pi[a+1]=temp;\n\n                    temp = Ai[a];\n                    Ai[a] = Ai[a+1];\n                    Ai[a+1] = temp;\n                }\n            }\n        }\n    }\n//    for(int i=0;i<M;i++)\n//    {\n//        cout << Pi[i] <<\""-\""<<Ai[i]<<endl;\n//    }\n\n    int Price{0};\n    for(int i=0;i<M;i++)\n    {\n        if(N-Ai[i]>=0)\n        {\n            N-=Ai[i];\n            Price +=Ai[i]*Pi[i];\n            if(N==0)\n                break;\n        }\n        else\n        {\n            Price += (Ai[i]-N)*Pi[i];\n            break;\n        }\n    }\n    cout << Price <<endl;\n}\n",WRONG_ANSWER,35,524
1278168317171261440,8982f04dde07ce4ad3a2f17670cf29d21b7c6bf721b7ae32b7b1ca54fff9aca7,2020-07-01 11:27:28,Python,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"def f(n,x):\n    a=[0,1,2,3,4,5,6,7,8,9,'A','B','C','D','E','F','G','H','I','J']\n    b=[]\n    c=[]\n    while True:\n        s=n//x \n        n=s \n        y=n%x  \n        b=b+[y]\n        if s==0:\n            break\n    b.reverse()\n    for i in b:\n        c.append(str(a[i]))\n    return c\n \na=int(input())\nfor i in range(1,301):\n    n=i*i\n    n2=f(i*i,a)\n    n3=n2[::-1]\n    n22=''.join(n2)\n    n33=''.join(n3)\n    m=f(i,a)\n    m2=''.join(m)\n    if (n22==n33):\n       \n        print(m2+\"" \""+n22)",WRONG_ANSWER,185,3200
1278168678485385216,10d5b1fccc77f0ea491f60d75762a7b8e3a4e04f55cc06f23fa01eb7b66f9e47,2020-07-01 11:28:54,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <algorithm>\nusing namespace std;\n\nstring trans(int n, int B, int &len) {\n    string ori;\n    for(int i=0; n>0;++i) {\n        if(n%B<10) ori+=char(n%B+48);\n        else ori+=char(n%B+55);\n        n/=B;\n        len++;\n    }\n    return ori;\n}\n\nbool judge(int d, int k) {\n    int len=0, len1=0;\n    string s_spr=trans(d*d, k, len), s_ori=trans(d, k, len1);\n    for(int i=0; i<len/2; ++i) {\n        if(s_spr[i]==s_spr[len-i-1]) continue;\n        else return 0;\n    }\n    reverse(s_ori.begin(), s_ori.end());\n//    reverse(s_spr.begin(), s_spr.end());\n    cout<<s_ori<<' '<<s_spr<<endl;\n    return 1;\n}\n\nint main() {\n    int B;\n    cin>>B;\n    for(int i=1; i<=300; ++i) {\n        judge(i, B);\n    }\n    return 0;\n}\n",ACCEPTED,40,512
1278169059693101056,6d4abd2973f12e6e270340909afbb26a937044d1c657dc2d58ef0d362c07a718,2020-07-01 11:30:25,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm> \nusing namespace std;\n\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1]) \n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1) // 是回文数；\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，n是待转数字，radix是指定的进制\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\t\n        {\n            ans += t + '0';\n        }\n        else \n        {\n            ans += t - 10 + 'A';\n        }\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（）以防止输入为0的情况\n    reverse(ans.begin(), ans.end());\n    return ans;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    int j = 0;\n    for (int x = 1; x <= 300; x++)\n    {\n        j = x; // 创建副本\n        \n        string s1 = intToA(j, n);      // 将整数按n进制转换\n        string s2 = intToA((j * j), n);// 将该数的平方按n进制转换\n\n        if (Palin_num(s2))\n        {\n            cout << s1 << \"" \"" << s2 << endl;\n        }\n        else\n        {\n            continue;\n        }\n    }\n    return 0;\n}",ACCEPTED,42,540
1278171186754674688,5afb2898af2e2f187059039ee1eb4dc82fd59bf73b18e0ba6d37877ae0c71ebd,2020-07-01 11:38:52,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,#include<iostream>\n#include<vector>\nusing namespace std;\n\nint main()\n{\n\tint n;\n\tint s;\n\tcin >> n >> s;\n\tint x = 0;//记录输出了几个\n\tfor (int i = s + 1; i < 10000; i++)\n\t{\n\t\tif (x == n)\n\t\t{\n\t\t\tbreak;\n\t\t}//每输出一个，x+1，如果x达到n就退出\n\t\tint b;\n\t\tint a = 0;//记录在几个进制下满足回文\n\t\tvector<int>num;\n\t\tfor (int j = 2; j <= 10; j++)\n\t\t{\n\t\t\tif (a == 3)\n\t\t\t{\n\t\t\t\tx++;\n\t\t\t\tcout << i<<endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tint c = 0;//长度\n\t\t\tint y = i;\n\t\t\twhile (y > 0)\n\t\t\t{\n\t\t\t\tb = y % j;\n\t\t\t\ty = y / j;\n\t\t\t\tnum.push_back(b);\n\t\t\t\tc++;\n\t\t\t}\n\t\t\tint flag = 1;\n\t\t\tfor (int k = 0; k < c / 2; k++)\n\t\t\t{\n\t\t\t\tif (num[k] != num[c - 1 - k])\n\t\t\t\t{\n\t\t\t\t\tflag = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (flag == 1)\n\t\t\t{\n\t\t\t\ta++;\n\t\t\t}\n\t\t}\n\t}\n},PARTIAL_ACCEPTED,35,592
1278173003261607936,2acfe834a0c9a0a9add021cdef700b9de96f83dd0796370df2c97aa209388ee2,2020-07-01 11:46:05,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint n;\nvoid fan(int x)\n{\n\tint a[25],b[25],i=0,m=0;\n\tfor (int k = 0; k < 25; k++)\n\t{\n\t\ta[k] = -1;\n\t\tb[k] = -1;\n\t}\n\tfor (int t=x*x;t!=0;i++)\n\t{\n\t\ta[i] = t % n;\n\t\tt = t / n;\n\t}\n\tif (i == 1)\n\t{\n\t\tint s = 0;\n\t\tfor (int l = x; l != 0; s++)\n\t\t{\n\t\t\tb[s] = l % n;\n\t\t\tl = l / n;\n\t\t}\n\t\tfor (int c = s - 1; c >= 0; c--)\n\t\t{\n\t\t\tcout << b[c];\n\t\t}\n\t\tcout <<\"" \""<< a[0]<<endl;\n\t}\n\telse\n\t{\n\t\tfor (int j = 0; j < (i / 2); j++)\n\t\t{\n\t\t\tif (a[j] == a[i - j - 1])\n\t\t\t{\n\t\t\t\tm = 1;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tm = 0; break;\n\t\t\t}\n\t\t}\n\t\tif (m == 1)\n\t\t{\n\t\t\tint s = 0;\n\t\t\tfor (int l = x; l != 0; s++)\n\t\t\t{\n\t\t\t\tb[s] = l % n;\n\t\t\t\tl = l / n;\n\t\t\t}\n\t\t\tfor (int c = s - 1; c >= 0; c--)\n\t\t\t{\n\t\t\t\tcout << b[c];\n\t\t\t}\n\t\t\tcout << \"" \"";\n\t\t\tfor (int j = i - 1; j >= 0; j--)\n\t\t\t{\n\t\t\t\tcout << a[j];\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n}\nint main()\n{\n\tcin >> n;\n\tfor (int w = 1; w <= 300; w++)\n\t{\n\t\tfan(w);\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,39,512
1278173084274589696,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-01 11:46:25,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstdlib>\n#include<cstdio>\nusing namespace std;\nint huiwen(int k)\n{\n    int j=k,i=0;\n    while(k>0){\n        i=i*10+j%10;\n        j=j/10;\n    }\n    if(i==k)\n        return 1;\n}\nint main()\n{   \n    int B;\n    cin>>B;\n    int num;\n    char str[100];\n    for(int i=1;i<=3oo;i++)\n    {\n        int num=i*i;\n        itoa(num,str,B);\n        int n=atoi(str);\n        if(huiwen(n)==1)\n            cout<<i<<\"" \""<<n<<endl;\n    }\n}",COMPILE_ERROR,0,0
1278173119217328128,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-01 11:46:33,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstdlib>\n#include<cstdio>\nusing namespace std;\nint huiwen(int k)\n{\n    int j=k,i=0;\n    while(k>0){\n        i=i*10+j%10;\n        j=j/10;\n    }\n    if(i==k)\n        return 1;\n}\nint main()\n{   \n    int B;\n    cin>>B;\n    int num;\n    char str[100];\n    for(int i=1;i<=300;i++)\n    {\n        int num=i*i;\n        itoa(num,str,B);\n        int n=atoi(str);\n        if(huiwen(n)==1)\n            cout<<i<<\"" \""<<n<<endl;\n    }\n}",COMPILE_ERROR,0,0
1278173731837378560,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-01 11:48:59,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstdlib>\n#include<cstdio>\nusing namespace std;\nint huiwen(int k)\n{\n    int j=k,i=0;\n    while(k>0){\n        i=i*10+j%10;\n        j=j/10;\n    }\n    if(i==k)\n        return 1;\n}\nint main()\n{   \n    int B;\n    cin>>B;\n    int num;\n    char str[100];\n    for(int i=1;i<=300;i++)\n    {\n        int num=i*i;\n        itoa(num,str,B);\n        int n=atoi(str);\n        if(huiwen(n)==1)\n            cout<<i<<\"" \""<<n<<endl;\n    }\n}",COMPILE_ERROR,0,0
1278173950226399232,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-01 11:49:51,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<stdlib.h>\n#include<stdio.h>\nusing namespace std;\nint huiwen(int k)\n{\n    int j=k,i=0;\n    while(k>0){\n        i=i*10+j%10;\n        j=j/10;\n    }\n    if(i==k)\n        return 1;\n}\nint main()\n{   \n    int B;\n    cin>>B;\n    int num;\n    char str[100];\n    for(int i=1;i<=300;i++)\n    {\n        int num=i*i;\n        itoa(num,str,B);\n        int n=atoi(str);\n        if(huiwen(n)==1)\n            cout<<i<<\"" \""<<n<<endl;\n    }\n}",COMPILE_ERROR,0,0
1278174058414268416,e245fef7b18b30d9fa8de6a92f7072a8e73afc51dccb5cf99305b15fec138b99,2020-07-01 11:50:17,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\n\nint B;\nint change[3000];\nchar map[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'}; \n\nbool check(int *num,int length)\n{\n\t\n\tfor (int i = 0; i < length/2; i++)\n\t{\n\t\tif (num[i] != num[length - i - 1])\n\t\t\treturn false;\n\t}\n\treturn true;\n}\n//check没问题\n\nint change1(int b)\n{\n\tint n = 0;\n\tb = b * b;\n\n\twhile (b)\n\t{\n\t\t\tchange[n++] = (b % B);\n\t\t\tb = b / B;\n     }\n\treturn n;\n}\n//change_new没问题\n\n\nint main()\n{\n\tcin >> B;\n\n\tint a, b, c, d, e, f;\n\tfor (a = 1; a <= 300; a++)\n\t{\n\t\tint n = change1(a);\n\t\tif (check(change, n))\n\t\t{\n\t\t\tcout << a << \"" \"";\n\t\t\tfor (b = n - 1; b >= 0; b--)\n\t\t\t\tcout << map[change[b]];\n\t\t\tcout << endl;\n\t\t}\n\n\n\t}\n\n\treturn 0;\n\n}",PARTIAL_ACCEPTED,39,456
1278175221712879616,e245fef7b18b30d9fa8de6a92f7072a8e73afc51dccb5cf99305b15fec138b99,2020-07-01 11:54:54,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\n\nint B;\nint change11[3000];\nint change22[3000];\nchar map[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'}; \n\nbool check(int *num,int length)\n{\n\t\n\tfor (int i = 0; i < length/2; i++)\n\t{\n\t\tif (num[i] != num[length - i - 1])\n\t\t\treturn false;\n\t}\n\treturn true;\n}\n//check没问题\n\nint change2(int b)\n{\n\tint n = 0;\n\n\twhile (b)\n\t{\n\t\tchange22[n++] = (b % B);\n\t\tb = b / B;\n\t}\n\treturn n;\n}\n\nint change1(int b)\n{\n\tint n = 0;\n\tb = b * b;\n\n\twhile (b)\n\t{\n\t\t\tchange11[n++] = (b % B);\n\t\t\tb = b / B;\n     }\n\treturn n;\n}\n//change_new没问题\n\n\nint main()\n{\n\tcin >> B;\n\n\tint a, b, c, d, e, f;\n\tfor (a = 1; a <= 300; a++)\n\t{\n\t\tint n1 = change1(a);\n\t\tif (check(change11, n1))\n\t\t{\n\t\t\tint n2 = change2(a);\n\t\t\tfor (b = n2 - 1; b >= 0; b--)\n\t\t\t\tcout << map[change22[b]];\n\t\t\tcout << \"" \"";\n\n\t\t\tfor (b = n1 - 1; b >= 0; b--)\n\t\t\t\tcout << map[change11[b]];\n\t\t\tcout << endl;\n\t\t}\n\n\n\t}\n\n\tsystem(\""pause\"");\n\treturn 0;\n\n}",ACCEPTED,25,620
1278177451392294912,2acfe834a0c9a0a9add021cdef700b9de96f83dd0796370df2c97aa209388ee2,2020-07-01 12:03:46,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint n;\nvoid fan(int x)\n{\n\tint a[25],b[25],i=0,m=0;\n\tfor (int k = 0; k < 25; k++)\n\t{\n\t\ta[k] = -1;\n\t\tb[k] = -1;\n\t}\n\tfor (int t=x*x;t!=0;i++)\n\t{\n\t\ta[i] = t % n;\n\t\tt = t / n;\n\t}\n\tif (i == 1)\n\t{\n\t\tint s = 0;\n\t\tfor (int l = x; l != 0; s++)\n\t\t{\n\t\t\tb[s] = l % n;\n\t\t\tl = l / n;\n\t\t}\n\t\tfor (int c = s - 1; c >= 0; c--)\n\t\t{\n\t\t\tif (b[c] > 10)\n\t\t\t{\n\t\t\t\tcout << char(b[c] + 'A' - 10);\n\t\t\t}\n\t\t\telse \n\t\t\t\tcout << b[c];\n\t\t}\n\t\tif (a[0] > 10)\n\t\t{\n\t\t\tcout <<\"" \"" <<char(a[0] + 'A' - 10);\n\t\t}\n\t\telse\n\t\t\tcout << \"" \""<<a[0];\n\t}\n\telse\n\t{\n\t\tfor (int j = 0; j < (i / 2); j++)\n\t\t{\n\t\t\tif (a[j] == a[i - j - 1])\n\t\t\t{\n\t\t\t\tm = 1;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tm = 0; break;\n\t\t\t}\n\t\t}\n\t\tif (m == 1)\n\t\t{\n\t\t\tint s = 0;\n\t\t\tfor (int l = x; l != 0; s++)\n\t\t\t{\n\t\t\t\tb[s] = l % n;\n\t\t\t\tl = l / n;\n\t\t\t}\n\t\t\tfor (int c = s - 1; c >= 0; c--)\n\t\t\t{\n\t\t\t\tif (b[c] > 10)\n\t\t\t\t{\n\t\t\t\t\tcout << char(b[c] + 'A' - 10);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t\tcout << b[c];\n\t\t\t}\n\t\t\tcout << \"" \"";\n\t\t\tfor (int j = i - 1; j >= 0; j--)\n\t\t\t{\n\t\t\t\tif (a[j] > 10)\n\t\t\t\t{\n\t\t\t\t\tcout << char(a[j] + 'A' - 10);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t\tcout << a[j];\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n}\nint main()\n{\n\tcin >> n;\n\tfor (int w = 1; w <= 300; w++)\n\t{\n\t\tfan(w);\n\t}\n\treturn 0;\n}",MULTIPLE_ERROR,30,512
1278177623467819008,50da7c55b44113943112c360765f2d343ea2a5045d304c0432b745d6e1c999fb,2020-07-01 12:04:27,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n\nusing namespace std;\nint q, num, k, m;\nint transform(int x, int y)\n{\n    int ch1[20000], k = 0;\n    while (x)\n    {\n        ch1[++k] = x % y;\n        x /= y;\n    }\n    if (ch1[1] == 0 || ch1[k] == 0)\n        return 0;\n    for (int i = 1; i <= k; i++)\n    {\n        if (ch1[i] != ch1[k - i + 1])\n            return 0;\n    }\n    q++;\n    return 0;\n}\n\nint main()\n{\n    cin >> num >> k;\n    for (int i = k + 1; m < num; i++)\n    {\n        q = 0;\n        transform(i, 10);\n        for (int j = 2; j <= 9; j++)\n            transform(i, j);\n        if (q > 1)\n        {\n            cout << i << endl;\n            m++;\n        }\n    }\n    return 0;\n}",ACCEPTED,28,412
1278177872928235520,2acfe834a0c9a0a9add021cdef700b9de96f83dd0796370df2c97aa209388ee2,2020-07-01 12:05:26,C++,70.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint n;\nvoid fan(int x)\n{\n\tint a[25],b[25],i=0,m=0;\n\tfor (int k = 0; k < 25; k++)\n\t{\n\t\ta[k] = -1;\n\t\tb[k] = -1;\n\t}\n\tfor (int t=x*x;t!=0;i++)\n\t{\n\t\ta[i] = t % n;\n\t\tt = t / n;\n\t}\n\tif (i == 1)\n\t{\n\t\tint s = 0;\n\t\tfor (int l = x; l != 0; s++)\n\t\t{\n\t\t\tb[s] = l % n;\n\t\t\tl = l / n;\n\t\t}\n\t\tfor (int c = s - 1; c >= 0; c--)\n\t\t{\n\t\t\tif (b[c] > 10)\n\t\t\t{\n\t\t\t\tcout << char(b[c] + 'A' - 10);\n\t\t\t}\n\t\t\telse \n\t\t\t\tcout << b[c];\n\t\t}\n\t\tif (a[0] > 10)\n\t\t{\n\t\t\tcout <<\"" \"" <<char(a[0] + 'A' - 10);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tcout << \"" \"" << a[0];\n\t\t}\n\t\tcout << endl;\n\t}\n\telse\n\t{\n\t\tfor (int j = 0; j < (i / 2); j++)\n\t\t{\n\t\t\tif (a[j] == a[i - j - 1])\n\t\t\t{\n\t\t\t\tm = 1;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tm = 0; break;\n\t\t\t}\n\t\t}\n\t\tif (m == 1)\n\t\t{\n\t\t\tint s = 0;\n\t\t\tfor (int l = x; l != 0; s++)\n\t\t\t{\n\t\t\t\tb[s] = l % n;\n\t\t\t\tl = l / n;\n\t\t\t}\n\t\t\tfor (int c = s - 1; c >= 0; c--)\n\t\t\t{\n\t\t\t\tif (b[c] > 10)\n\t\t\t\t{\n\t\t\t\t\tcout << char(b[c] + 'A' - 10);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t\tcout << b[c];\n\t\t\t}\n\t\t\tcout << \"" \"";\n\t\t\tfor (int j = i - 1; j >= 0; j--)\n\t\t\t{\n\t\t\t\tif (a[j] > 10)\n\t\t\t\t{\n\t\t\t\t\tcout << char(a[j] + 'A' - 10);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t\tcout << a[j];\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n}\nint main()\n{\n\tcin >> n;\n\tfor (int w = 1; w <= 300; w++)\n\t{\n\t\tfan(w);\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,35,512
1278178201296109568,2acfe834a0c9a0a9add021cdef700b9de96f83dd0796370df2c97aa209388ee2,2020-07-01 12:06:45,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint n;\nvoid fan(int x)\n{\n\tint a[25],b[25],i=0,m=0;\n\tfor (int k = 0; k < 25; k++)\n\t{\n\t\ta[k] = -1;\n\t\tb[k] = -1;\n\t}\n\tfor (int t=x*x;t!=0;i++)\n\t{\n\t\ta[i] = t % n;\n\t\tt = t / n;\n\t}\n\tif (i == 1)\n\t{\n\t\tint s = 0;\n\t\tfor (int l = x; l != 0; s++)\n\t\t{\n\t\t\tb[s] = l % n;\n\t\t\tl = l / n;\n\t\t}\n\t\tfor (int c = s - 1; c >= 0; c--)\n\t\t{\n\t\t\tif (b[c] >= 10)\n\t\t\t{\n\t\t\t\tcout << char(b[c] + 'A' - 10);\n\t\t\t}\n\t\t\telse \n\t\t\t\tcout << b[c];\n\t\t}\n\t\tif (a[0] >= 10)\n\t\t{\n\t\t\tcout <<\"" \"" <<char(a[0] + 'A' - 10);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tcout << \"" \"" << a[0];\n\t\t}\n\t\tcout << endl;\n\t}\n\telse\n\t{\n\t\tfor (int j = 0; j < (i / 2); j++)\n\t\t{\n\t\t\tif (a[j] == a[i - j - 1])\n\t\t\t{\n\t\t\t\tm = 1;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tm = 0; break;\n\t\t\t}\n\t\t}\n\t\tif (m == 1)\n\t\t{\n\t\t\tint s = 0;\n\t\t\tfor (int l = x; l != 0; s++)\n\t\t\t{\n\t\t\t\tb[s] = l % n;\n\t\t\t\tl = l / n;\n\t\t\t}\n\t\t\tfor (int c = s - 1; c >= 0; c--)\n\t\t\t{\n\t\t\t\tif (b[c] >= 10)\n\t\t\t\t{\n\t\t\t\t\tcout << char(b[c] + 'A' - 10);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t\tcout << b[c];\n\t\t\t}\n\t\t\tcout << \"" \"";\n\t\t\tfor (int j = i - 1; j >= 0; j--)\n\t\t\t{\n\t\t\t\tif (a[j] >= 10)\n\t\t\t\t{\n\t\t\t\t\tcout << char(a[j] + 'A' - 10);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t\tcout << a[j];\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n}\nint main()\n{\n\tcin >> n;\n\tfor (int w = 1; w <= 300; w++)\n\t{\n\t\tfan(w);\n\t}\n\treturn 0;\n}",ACCEPTED,32,396
1278180601427845120,6d4abd2973f12e6e270340909afbb26a937044d1c657dc2d58ef0d362c07a718,2020-07-01 12:16:17,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>  \n#include <vector>\n#include <string>  \n#include <algorithm>  \nusing namespace std;\n\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1])\n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1) // 是回文数；\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，n是待转数字，radix是指定的进制\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\n        {\n            ans += t + '0';\n        }\n        else\n        {\n            ans += t - 10 + 'A';\n        }\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（）以防止输入为0的情况\n    reverse(ans.begin(), ans.end());\n    return ans;\n}\n\nint main()\n{\n    int n, s;\n    cin >> n >> s;\n    s++;\n    vector<int> p;\n    int sum;\n    while ((p.size() < n))\n    {\n        sum = 0;\n        for (int i = 2; i <= 10; i++)\n        {\n            if (Palin_num(intToA(s, i)))\n            {\n                sum++;\n            }\n        }\n        if (sum >= 2)\n        {\n            p.push_back(s);\n        }\n        s++;\n    }\n    for (int i = 0; i < p.size(); i++)\n    {\n        cout << p[i] << endl;\n    }\n    return 0;\n}",ACCEPTED,38,512
1278180983151460352,49f071a8c19d892715144d4b30350c8d95a7e3e541b9dda969e83d72c9f27b75,2020-07-01 12:17:48,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace  std;\nbool prime(int a){\n\tif(a<3){\n\treturn true;\n\t}\n\tbool temp=true;\n\tfor(int i=2;i<=sqrt(a);i++){\n\t\tif(a%i==0){\n\t\t\ttemp=false;\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn temp;\n}\nbool huiwen(int a){\n\t\tstring s=\""\"";\n        while(a)\n        {\n            s+=(a%10)+48;\n            a/=10;\n        }\n\tint l=0,big=s.size();\n\twhile(s[l]==s[big-1-l] && l<=(big-1)/2){\n\t\tl++;\n\t}\n\tl--;\n\tif(l==(big-1)/2){\n\t\treturn true;\n\t}\n\telse{\n\t\treturn false;\n\t}\n}\nint main(){\n\tint a,b;\n\tcin>>a>>b;\n\tfor(int i=a;i<=b;i++){\n\t\tif(prime(i)){\n\t\t\tif(huiwen(i)){\n\t\t\t\tcout<<i<<'\\n';\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}",WRONG_ANSWER,31,424
1278184371943563264,61312bc99401c99a47863369c930c4a0da059239ef265b7ed69539aa9413279b,2020-07-01 12:31:16,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n//判断B进制下的回文数\nint hh(int b,int tem){\n    int s1[20];\n    int i;\n    for(i=0;tem>0;i++){\n        s1[i]=tem%b;\n        tem=tem/b;\n    }\n    int flag=1;\n    for(int j=0;j<i/2;j++){\n        if(s1[j]!=s1[i-1])\n            flag=0;\n    }\n    return flag;\n}\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    int flag2=0;\n    for(int i=S+1;;i++){\n        int flag1=0;\n        for(int j=2;j<=10;j++){\n            if(hh(j,i))\n                flag1++;\n            if(flag1>=2){\n                cout<<i<<endl;\n                flag2++;\n                break;\n            }\n        }\n        if(flag2==N)\n            break;\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,36,512
1278185392476454912,5afb2898af2e2f187059039ee1eb4dc82fd59bf73b18e0ba6d37877ae0c71ebd,2020-07-01 12:35:19,C++,30.0,1277062760129622024,1267449136707624960,1049226397448056832,#include<iostream>\n#include<vector>\nusing namespace std;\n\nint main()\n{\n\tint n;//要输出几个\n\tint s;//起点\n\tcin >> n >> s;\n\tint x = 0;//记录输出了几个\n\tfor (int i = s + 1; i < 10000; i++)\n\t{\n\t\tif (x == n)\n\t\t{\n\t\t\tbreak;\n\t\t}//每输出一个，x+1，如果x达到n就退出\n\t\tint b = 0 ;\n\t\tint a = 0;//记录在几个进制下满足回文\n\t\tfor (int j = 2; j <= 10; j++)\n\t\t{\n\t\t\tvector<int>num;\n\t\t\tif (a == 2)\n\t\t\t{\n\t\t\t\tx++;\n\t\t\t\tcout << i<<endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tint c = 0;//长度\n\t\t\tint y = i;\n\t\t\twhile (y > 0)\n\t\t\t{\n\t\t\t\tb = y % j;\n\t\t\t\ty = y / j;\n\t\t\t\tnum.push_back(b);\n\t\t\t\tc++;\n\t\t\t}\n\t\t\tint flag = 1;\n\t\t\tfor (int k = 0; k < c / 2; k++)\n\t\t\t{\n\t\t\t\tif (num[k] != num[c - 1 - k])\n\t\t\t\t{\n\t\t\t\t\tflag = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (flag == 1)\n\t\t\t{\n\t\t\t\ta++;\n\t\t\t}\n\t\t}\n\t}\n},PARTIAL_ACCEPTED,39,508
1278185412953038848,35f53008c37294f2b012d2cdddf9bc3c83722e7f7a7eee836034b3580cc9b528,2020-07-01 12:35:24,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\nint judge(int a,int b){\n    int count=0,mo=0,shang=a;\n    int arr[1000];\n    for(int j=0;1;j++){\n        mo = shang%b;\n        shang = shang/b;\n        arr[j] = mo;\n        count++;\n        if(shang == 0)\n            break;\n    }\n    int ans[count];\n    for (int j = count -1; j >= 0; --j)\n     {\n      ans[count-1-j]=arr[j];\n     }\n    //此时ans里就是b进制数\n    int temp=0;\n    for(int l=0;l<count;l++){\n        if(ans[l] == ans[count-l-1])\n            temp++;\n\n    }\n    if(temp == count)\n        return 1;\n    else\n        return 2;\n\n}\n\nint main()\n{\n    int n,s;\n    cin >> n >>s;\n    int ans_count =0;\n    int shuzu[n+1];\n    for(int i=s+1;1;i++){\n        int huiwenshu_count=0;\n        for(int j=2;j<=10;j++){\n            if(judge(i,j)==1){\n                huiwenshu_count++;\n            }\n\n        }\n        if(huiwenshu_count>=2){\n            shuzu[ans_count]=i;\n            ans_count++;\n        }\n        if(ans_count == n){\n            for(int l=0;l<n;l++)\n                cout<<shuzu[l]<<endl;\n            break;\n        }\n    }\n\n    return 0;\n\n\n}\n",ACCEPTED,25,512
1278185617119182848,5afb2898af2e2f187059039ee1eb4dc82fd59bf73b18e0ba6d37877ae0c71ebd,2020-07-01 12:36:13,C++,40.0,1277062760129622024,1267449136707624960,1049226397448056832,#include<iostream>\n#include<vector>\nusing namespace std;\n\nint main()\n{\n\tint n;//要输出几个\n\tint s;//起点\n\tcin >> n >> s;\n\tint x = 0;//记录输出了几个\n\tfor (int i = s + 1; ; i++)\n\t{\n\t\tif (x == n)\n\t\t{\n\t\t\tbreak;\n\t\t}//每输出一个，x+1，如果x达到n就退出\n\t\tint b = 0 ;\n\t\tint a = 0;//记录在几个进制下满足回文\n\t\tfor (int j = 2; j <= 10; j++)\n\t\t{\n\t\t\tvector<int>num;\n\t\t\tif (a == 2)\n\t\t\t{\n\t\t\t\tx++;\n\t\t\t\tcout << i<<endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tint c = 0;//长度\n\t\t\tint y = i;\n\t\t\twhile (y > 0)\n\t\t\t{\n\t\t\t\tb = y % j;\n\t\t\t\ty = y / j;\n\t\t\t\tnum.push_back(b);\n\t\t\t\tc++;\n\t\t\t}\n\t\t\tint flag = 1;\n\t\t\tfor (int k = 0; k < c / 2; k++)\n\t\t\t{\n\t\t\t\tif (num[k] != num[c - 1 - k])\n\t\t\t\t{\n\t\t\t\t\tflag = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (flag == 1)\n\t\t\t{\n\t\t\t\ta++;\n\t\t\t}\n\t\t}\n\t}\n},PARTIAL_ACCEPTED,40,412
1278185883205820416,8982f04dde07ce4ad3a2f17670cf29d21b7c6bf721b7ae32b7b1ca54fff9aca7,2020-07-01 12:37:16,Python,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"def f(n,x):\n    a=[0,1,2,3,4,5,6,7,8,9,'A','B','C','D','E','F','G','H','I','J']\n    b=[]\n    c=[]\n    while True:\n        s=n//x  \n        y=n%x  \n        b=b+[y]\n        if s==0:\n            break\n        n=s\n    b.reverse()\n    for i in b:\n        c.append(str(a[i]))\n    return c\n \na=int(input())\nfor i in range(1,301):\n    n=i*i\n    n2=f(n,a)\n    \n    n22=''.join(n2)\n    \n    n3=n2[::-1]\n    n33=''.join(n3)\n    m=f(i,a)\n    m2=''.join(m)\n    if (n22==n33):\n       \n        print(m2+\"" \""+n22)",ACCEPTED,206,3112
1278186314048921600,5afb2898af2e2f187059039ee1eb4dc82fd59bf73b18e0ba6d37877ae0c71ebd,2020-07-01 12:38:59,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,#include<iostream>\n#include<vector>\nusing namespace std;\n\nint main()\n{\n\tint n;//要输出几个\n\tint s;//起点\n\tcin >> n >> s;\n\tint x = 0;//记录输出了几个\n\tfor (int i = s + 1; ; i++)\n\t{\n\t\tif (x == n)\n\t\t{\n\t\t\tbreak;\n\t\t}//每输出一个，x+1，如果x达到n就退出\n\t\tint b = 0 ;\n\t\tint a = 0;//记录在几个进制下满足回文\n\t\tfor (int j = 2; j <= 10; j++)\n\t\t{\n\t\t\tvector<int>num;\n\t\t\tint c = 0;//长度\n\t\t\tint y = i;\n\t\t\twhile (y > 0)\n\t\t\t{\n\t\t\t\tb = y % j;\n\t\t\t\ty = y / j;\n\t\t\t\tnum.push_back(b);\n\t\t\t\tc++;\n\t\t\t}\n\t\t\tint flag = 1;\n\t\t\tfor (int k = 0; k < c / 2; k++)\n\t\t\t{\n\t\t\t\tif (num[k] != num[c - 1 - k])\n\t\t\t\t{\n\t\t\t\t\tflag = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (flag == 1)\n\t\t\t{\n\t\t\t\ta++;\n\t\t\t}\n\t\t\tif (a == 2)\n\t\t\t{\n\t\t\t\tx++;\n\t\t\t\tcout << i << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n},ACCEPTED,35,384
1278188749849026560,61312bc99401c99a47863369c930c4a0da059239ef265b7ed69539aa9413279b,2020-07-01 12:48:40,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n//判断B进制下的回文数\nint hh(int b,int tem){\n    int s1[30];\n    int a;\n    for(a=0;tem>0;a++){\n        s1[a]=tem%b;\n        tem=tem/b;\n    }\n    a--;\n    int flag=1;\n    for(int j=0;j<(a+1)/2;j++){\n        if(s1[j]!=s1[a-j])\n            flag=0;\n    }\n    return flag;\n}\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    int flag2=0;\n    for(int i=S+1;;i++){\n        int flag1=0;\n        for(int j=2;j<=10;j++){\n            if(hh(j,i))\n                flag1++;\n            if(flag1==2){\n                cout<<i<<endl;\n                flag2++;\n                break;\n            }\n        }\n        if(flag2==N)\n            break;\n    }\n    return 0;\n}\n",ACCEPTED,41,508
1278194263836262400,61312bc99401c99a47863369c930c4a0da059239ef265b7ed69539aa9413279b,2020-07-01 13:10:34,C++,40.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<cmath>\nusing namespace std;\n//判断B进制下的回文数\nint hh(int b,int ten){\n    int tem=ten*ten;\n    int s1[30];\n    if(tem<b)\n        return 1;\n    int a;\n    for(a=0;tem>0;a++){\n        s1[a]=tem%b;\n        tem=tem/b;\n    }\n    a--;\n    int flag=1;\n    for(int j=0;j<(a+1)/2;j++){\n        if(s1[j]!=s1[a-j])\n            flag=0;\n    }\n    return flag;\n}\n//将十进制转换为B进制\nint tran(int b,int num){\n    int s1[30];\n    int a;\n    int ts=0;\n    for(a=0;num>0;a++){\n        s1[a]=num%b;\n        num=num/b;\n    }\n    a--;\n    for(int i=0;i<=a;i++){\n        ts+=s1[i]*pow(10,i);\n    }\n    return ts;\n}\nint main()\n{\n    int B;\n    cin>>B;\n    for(int j=1;j<=300;j++){\n        if(hh(B,j))\n            cout<<tran(B,j)<<\"" \""<<tran(B,j*j)<<endl;\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,32,424
1278195334440747008,61312bc99401c99a47863369c930c4a0da059239ef265b7ed69539aa9413279b,2020-07-01 13:14:50,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<cmath>\nusing namespace std;\n//判断B进制下的回文数\nint hh(int b,int ten){\n    int tem=ten*ten;\n    int s1[30];\n    if(tem<b)\n        return 1;\n    int a;\n    for(a=0;tem>0;a++){\n        s1[a]=tem%b;\n        tem=tem/b;\n    }\n    a--;\n    int flag=1;\n    for(int j=0;j<(a+1)/2;j++){\n        if(s1[j]!=s1[a-j])\n            flag=0;\n    }\n    return flag;\n}\n//将十进制转换为B进制\nlong long tran(int b,int num){\n    int s1[30];\n    int a;\n    long long ts=0;\n    for(a=0;num>0;a++){\n        s1[a]=num%b;\n        num=num/b;\n    }\n    a--;\n    for(int i=0;i<=a;i++){\n        ts+=s1[i]*pow(10,i);\n    }\n    return ts;\n}\nint main()\n{\n    int B;\n    cin>>B;\n    for(int j=1;j<=300;j++){\n        if(hh(B,j))\n            cout<<tran(B,j)<<\"" \""<<tran(B,j*j)<<endl;\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,39,492
1278196586817970176,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-01 13:19:48,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint B;\nint a[10000],b[10000];\nusing namespace std;\nint turn1(int k)\n{\n    int i=0;\n    while(k>0){\n        a[num++]=k%B;\n        k=k/B;\n    }\n    return i; \n}\nint turn2(int k)\n{\n    int i=0;\n    while(k>0){\n        b[i++]=k%B;\n        k=k/B;\n    }\n    return i;\n}\nint huiwen(int k)\n{\n    for(int i=k-1;i>=0;k--)\n    {\n        if(a[i]!=a[k-i-1])\n            return 0;\n    }\n    return 1;\n}\nvoid print1(int k){    \n    for(int i=k-1;i>=0;i--)    \n    {        \n        if(a[i]>=10)\n           cout<<(a[i]+55);     \n        else(a[i]<10)        \n            cout<<a[i];\nvoid print2(int k){    \n    for(int i=k-1;i>=0;i--)    \n    {        \n        if(b[i]>=10)\n           cout<<(b[i]+55);     \n        else(b[i]<10)        \n            cout<<b[i];\nint main()\n{   \n    scanf(\""%d\"",&B);\n    for(int i=1;i<=300;i++){\n        int num=change(i*i);\n        if(huiwen(num)==1)\n        {\n            print2(turn2(i));\n            cout<<\"" \"";\n            print1(num);\n            cout<<endl;\n        }\n    }\n        \n    \n    \n}",COMPILE_ERROR,0,0
1278196677637234688,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-01 13:20:10,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint B;\nint a[10000],b[10000];\nusing namespace std;\nint turn1(int k)\n{\n    int i=0;\n    while(k>0){\n        a[i++]=k%B;\n        k=k/B;\n    }\n    return i; \n}\nint turn2(int k)\n{\n    int i=0;\n    while(k>0){\n        b[i++]=k%B;\n        k=k/B;\n    }\n    return i;\n}\nint huiwen(int k)\n{\n    for(int i=k-1;i>=0;k--)\n    {\n        if(a[i]!=a[k-i-1])\n            return 0;\n    }\n    return 1;\n}\nvoid print1(int k){    \n    for(int i=k-1;i>=0;i--)    \n    {        \n        if(a[i]>=10)\n           cout<<(a[i]+55);     \n        else(a[i]<10)        \n            cout<<a[i];\nvoid print2(int k){    \n    for(int i=k-1;i>=0;i--)    \n    {        \n        if(b[i]>=10)\n           cout<<(b[i]+55);     \n        else(b[i]<10)        \n            cout<<b[i];\nint main()\n{   \n    scanf(\""%d\"",&B);\n    for(int i=1;i<=300;i++){\n        int num=change(i*i);\n        if(huiwen(num)==1)\n        {\n            print2(turn2(i));\n            cout<<\"" \"";\n            print1(num);\n            cout<<endl;\n        }\n    }\n        \n    \n    \n}",COMPILE_ERROR,0,0
1278196753818378240,e245fef7b18b30d9fa8de6a92f7072a8e73afc51dccb5cf99305b15fec138b99,2020-07-01 13:20:28,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\n\nint B;\nint change11[3000];\nint change22[3000];\n\nbool check(int* num, int length)\n{\n\n\tfor (int i = 0; i < length / 2; i++)\n\t{\n\t\tif (num[i] != num[length - i - 1])\n\t\t\treturn false;\n\t}\n\treturn true;\n}\n//check没问题\n\nint change1(int b)\n{\n\tint n = 0;\n\tb = b * b;\n\n\twhile (b)\n\t{\n\t\tchange11[n++] = (b % B);\n\t\tb = b / B;\n\t}\n\treturn n;\n}\n//change_new没问题\n\n\nint main()\n{\n\tint N, S;\n\tcin >> N >> S;\n\n\tint a, b, c, d, e, f;\n\tint num=0;\n\tb = S + 1;\n\n\tfor (a = 0; a < N; a++)\n\t{\n\t\tfor (;;)\n\t\t{\n\t\t\tfor (B = 2; B <= 10; B++)\n\t\t\t{\n\t\t\t\tint n1 = change1(b);\n\t\t\t\tif (check(change11, n1))\n\t\t\t\t\tnum++;\n\t\t\t}\n\t\t\t\n\t\t\tif (num >= 2)\n\t\t\t{\n\t\t\t\tcout << b << endl;\n\t\t\t\tb++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tb++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\t\n\t\t}\n\t}\n\n\tsystem(\""pause\"");\n\treturn 0;\n\n\n\n}",PARTIAL_ACCEPTED,32,552
1278196813125836800,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-01 13:20:42,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint B;\nint a[10000],b[10000];\nusing namespace std;\nint turn1(int k)\n{\n    int i=0;\n    while(k>0){\n        a[i++]=k%B;\n        k=k/B;\n    }\n    return i; \n}\nint turn2(int k)\n{\n    int i=0;\n    while(k>0){\n        b[i++]=k%B;\n        k=k/B;\n    }\n    return i;\n}\nint huiwen(int k)\n{\n    for(int i=k-1;i>=0;k--)\n    {\n        if(a[i]!=a[k-i-1])\n            return 0;\n    }\n    return 1;\n}\nvoid print1(int k){    \n    for(int i=k-1;i>=0;i--)    \n    {        \n        if(a[i]>=10)\n           cout<<(a[i]+55);     \n        else if(a[i]<10)        \n            cout<<a[i];\nvoid print2(int k){    \n    for(int i=k-1;i>=0;i--)    \n    {        \n        if(b[i]>=10)\n           cout<<(b[i]+55);     \n        else(b[i]<10)        \n            cout<<b[i];\nint main()\n{   \n    scanf(\""%d\"",&B);\n    for(int i=1;i<=300;i++){\n        int num=change(i*i);\n        if(huiwen(num)==1)\n        {\n            print2(turn2(i));\n            cout<<\"" \"";\n            print1(num);\n            cout<<endl;\n        }\n    }\n        \n    \n    \n}",COMPILE_ERROR,0,0
1278197063957798912,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-01 13:21:42,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint B;\nint a[10000],b[10000];\nusing namespace std;\nint turn1(int k)\n{\n    int i=0;\n    while(k>0){\n        a[i++]=k%B;\n        k=k/B;\n    }\n    return i; \n}\nint turn2(int k)\n{\n    int i=0;\n    while(k>0){\n        b[i++]=k%B;\n        k=k/B;\n    }\n    return i;\n}\nint huiwen(int k)\n{\n    for(int i=k-1;i>=0;k--)\n    {\n        if(a[i]!=a[k-i-1])\n            return 0;\n    }\n    return 1;\n}\nvoid print1(int k){    \n    for(int i=k-1;i>=0;i--)    \n    {        \n        if(a[i]>=10)\n           cout<<(a[i]+55);     \n        else if(a[i]<10)        \n            cout<<a[i];\n    }\nvoid print2(int k){    \n    for(int i=k-1;i>=0;i--)    \n    {        \n        if(b[i]>=10)\n           cout<<(b[i]+55);     \n        else(b[i]<10)        \n            cout<<b[i];\n    }\nint main()\n{   \n    scanf(\""%d\"",&B);\n    for(int i=1;i<=300;i++){\n        int num=change(i*i);\n        if(huiwen(num)==1)\n        {\n            print2(turn2(i));\n            cout<<\"" \"";\n            print1(num);\n            cout<<endl;\n        }\n    }\n        \n    \n    \n}",COMPILE_ERROR,0,0
1278198149716303872,53ae28e3dbe2f18670c3ebaf391c09f8e570189a6475fc91a2ef814fd1b9799c,2020-07-01 13:26:01,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"//double palindromic number\n#include <iostream>\nusing namespace std;\n\nint N,S,temp2=0;//Ê®½øÖÆÒÔÄÚ¶¼ÊÇÊý×Ö \nint array[14];//×î´óÖµÇø¼ä10000µÄ×îС½øÖÆÊýΪ10011100010000Ϊ14λ \nbool get_palin(int x);\n\nint main(){\n\tcin>>N>>S;\n\tbool temp;\n\tfor (int i=S+1;S<10000;i++){\n\t\ttemp = get_palin(i);\n\t\tif (temp){\n\t\t\tcout << i <<endl;\n\t\t\ttemp2++;\n\t\t}\n\t\tif (temp2==N){\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn 0;\n}\n\nbool get_palin(int x){\n\tint sum=0;\n\tfor (int m=2;m<11;m++){\n\t\tbool flag =true;\n\t\tint mod_a=0,index=0,temp3=x;\n\t\tarray[14]={0};\n\t\twhile (1){\n\t\t\tmod_a=temp3%m;\n\t\t\ttemp3 = temp3/m;\n\t\t\t\n\t\t\tif (!temp3){\n\t\t\t\tarray[index]=mod_a;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tarray[index]=mod_a;\n\t\t\tindex++;\n\t\t}\t\t\n\t\tfor (int k=0;k<=(index/2);k++){\n\t\t\tif (array[k]!=array[index-k]){\n\t\t\t\tflag=false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (flag){\n\t\t\tsum++;\n\t\t}\n\t\tif (sum>=2){\n\t\t\tbreak;\n\t\t}\n\t}\n\tif (sum>=2){\n\t\treturn true;\n\t}\n\telse {\n\t\treturn false;\n\t}\n}",WRONG_ANSWER,252,428
1278198869786034176,b42cd3949c84ee5ac9cc4d923f87cacc9a1701d8d7f592ebaf402a6ad0b20e72,2020-07-01 13:28:53,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\n\nint N = 0;\nint S = 0;\nchar remainders[20] = { '0','1','2','3','4','5','6','7','8','9',\n\t\t\t\t\t\t'A','B','C','D','E','F','G','H','I','J' };//所有可能的余数\nstring change(int x, int num);//进制转换函数\nstring change_sort(string oldString);//颠倒顺序\nvoid solve();\n\nint main()\n{\n\tcin >> N >> S;\n\tsolve();\n}\n\n//x进制转换函数\nstring change(int x, int num) {\n\tvector<char> num_remainders;//存放余数\n\tstring num_x = \""\"";//存放x进制数结果\n\n\twhile (num != 0) {\n\t\tnum_remainders.push_back(remainders[num % x]);\n\t\tnum /= x;\n\t}\n\t//最后余数要倒过来存进结果字符串\n\tfor (int i = num_remainders.size() - 1; i >= 0; i--) {\n\t\tnum_x += num_remainders[i];\n\t}\n\n\treturn num_x;\n}\n\n//颠倒顺序\nstring change_sort(string oldString) {\n\tstring newString = \""\"";\n\tfor (int i = oldString.size() - 1; i >= 0; i--) {\n\t\tnewString += oldString[i];\n\t}\n\treturn newString;\n}\n\nvoid solve() {\n\tint num = S + 1;//每一次进行循环的数字\n\tint global_counter = 0;//用来控制前N个输出结果\n\n\twhile (global_counter < N) {\n\t\tint counter = 0;//用来控制进制判断的次数，如果已经有2个（注：题目描述的界限似乎不是很清楚，上pta的时候要注意）进制满足了，就没有必要再继续判断了\n\n\t\tfor (int i = 2; i <= 10; i++) {\n\t\t\tif (counter > 2) {\n\t\t\t\tcout << num << endl;//输出这个满足题目的数\n\t\t\t\tglobal_counter++;//全局计数器要加一\n\t\t\t\tbreak;//若已经有2个进制满足了，则这个数就可以了\n\t\t\t}\n\n\t\t\tstring num_x = change(i, num);//将数字转为i进制\n\t\t\tif (num_x == change_sort(num_x)) {\n\t\t\t\tcounter++;\n\t\t\t}\n\n\t\t}\n\t\t\n\t\tnum++;//每次数字要加一进入下一次循环判断\n\t}\n}\n",PARTIAL_ACCEPTED,146,652
1278198943576424448,b42cd3949c84ee5ac9cc4d923f87cacc9a1701d8d7f592ebaf402a6ad0b20e72,2020-07-01 13:29:10,C++,40.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\n\nint N = 0;\nint S = 0;\nchar remainders[20] = { '0','1','2','3','4','5','6','7','8','9',\n\t\t\t\t\t\t'A','B','C','D','E','F','G','H','I','J' };//所有可能的余数\nstring change(int x, int num);//进制转换函数\nstring change_sort(string oldString);//颠倒顺序\nvoid solve();\n\nint main()\n{\n\tcin >> N >> S;\n\tsolve();\n}\n\n//x进制转换函数\nstring change(int x, int num) {\n\tvector<char> num_remainders;//存放余数\n\tstring num_x = \""\"";//存放x进制数结果\n\n\twhile (num != 0) {\n\t\tnum_remainders.push_back(remainders[num % x]);\n\t\tnum /= x;\n\t}\n\t//最后余数要倒过来存进结果字符串\n\tfor (int i = num_remainders.size() - 1; i >= 0; i--) {\n\t\tnum_x += num_remainders[i];\n\t}\n\n\treturn num_x;\n}\n\n//颠倒顺序\nstring change_sort(string oldString) {\n\tstring newString = \""\"";\n\tfor (int i = oldString.size() - 1; i >= 0; i--) {\n\t\tnewString += oldString[i];\n\t}\n\treturn newString;\n}\n\nvoid solve() {\n\tint num = S + 1;//每一次进行循环的数字\n\tint global_counter = 0;//用来控制前N个输出结果\n\n\twhile (global_counter < N) {\n\t\tint counter = 0;//用来控制进制判断的次数，如果已经有2个（注：题目描述的界限似乎不是很清楚，上pta的时候要注意）进制满足了，就没有必要再继续判断了\n\n\t\tfor (int i = 2; i <= 10; i++) {\n\t\t\tif (counter >= 2) {\n\t\t\t\tcout << num << endl;//输出这个满足题目的数\n\t\t\t\tglobal_counter++;//全局计数器要加一\n\t\t\t\tbreak;//若已经有2个进制满足了，则这个数就可以了\n\t\t\t}\n\n\t\t\tstring num_x = change(i, num);//将数字转为i进制\n\t\t\tif (num_x == change_sort(num_x)) {\n\t\t\t\tcounter++;\n\t\t\t}\n\n\t\t}\n\t\t\n\t\tnum++;//每次数字要加一进入下一次循环判断\n\t}\n}\n",PARTIAL_ACCEPTED,44,484
1278199013390614528,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-01 13:29:27,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint B;\nint a[10000], b[10000];\nusing namespace std;\nint turn1(int k)\n{\n    int i = 0;\n    while (k > 0) {\n        a[i++] = k % B;\n        k = k / B;\n    }\n    return i;\n}\nint turn2(int k)\n{\n    int i = 0;\n    while (k > 0) {\n        b[i++] = k % B;\n        k = k / B;\n    }\n    return i;\n}\nint huiwen(int k)\n{\n    for (int i = k - 1;i >= 0;k--)\n    {\n        if (a[i] != a[k - i - 1])\n            return 0;\n    }\n    return 1;\n}\nvoid print1(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        if (a[i] >= 10)\n            cout << (a[i] + 55);\n        else if (a[i] < 10)\n            cout << a[i];\n    }\n}\nvoid print2(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        if (b[i] >= 10)\n            cout << (b[i] + 55);\n        else if(b[i] < 10)\n            cout << b[i];\n    }\n}\nint main()\n{\n    scanf(\""%d\"", &B);\n    for (int i = 1;i <= 300;i++) {\n        int num = turn1(i * i);\n        if (huiwen(num) == 1)\n        {\n            print2(turn2(i));\n            cout << \"" \"";\n            print1(num);\n            cout << endl;\n        }\n    }\n}",WRONG_ANSWER,33,512
1278199178327416832,e245fef7b18b30d9fa8de6a92f7072a8e73afc51dccb5cf99305b15fec138b99,2020-07-01 13:30:06,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\n\nint B;\nint change11[3000];\nint change22[3000];\n\nbool check(int* num, int length)\n{\n\n\tfor (int i = 0; i < length / 2; i++)\n\t{\n\t\tif (num[i] != num[length - i - 1])\n\t\t\treturn false;\n\t}\n\treturn true;\n}\n//check没问题\n\nint change1(int b)\n{\n\tint n = 0;\n\tb = b * b;\n\n\twhile (b)\n\t{\n\t\tchange11[n++] = (b % B);\n\t\tb = b / B;\n\t}\n\treturn n;\n}\n//change_new没问题\n\n\nint main()\n{\n\tint N, S;\n\tcin >> N >> S;\n\n\tint a, b, c, d, e, f;\n\tint num=0;\n\tb = S + 1;\n\n\tfor (a = 0; a < N; a++)\n\t{\n\t\tfor (;;)\n\t\t{\n\t\t\tfor (B = 2; B <= 10; B++)\n\t\t\t{\n\t\t\t\tint n1 = change1(b);\n\t\t\t\tif (check(change11, n1))\n\t\t\t\t\tnum++;\n\t\t\t}\n\t\t\t\n\t\t\tif (num >= 2)\n\t\t\t{\n\t\t\t\tcout << b << endl;\n\t\t\t\tb++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tb++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\t\n\t\t}\n\t}\n\n\tsystem(\""pause\"");\n\treturn 0;\n\n\n\n}",PARTIAL_ACCEPTED,31,640
1278204746534420480,e245fef7b18b30d9fa8de6a92f7072a8e73afc51dccb5cf99305b15fec138b99,2020-07-01 13:52:14,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\n\nint B;\nint change11[3000];\n\nbool check(int* num, int length)\n{\n\n\tfor (int i = 0; i < length / 2; i++)\n\t{\n\t\tif (num[i] != num[length - i - 1])\n\t\t\treturn false;\n\t}\n\treturn true;\n}\n//check没问题\n\nint change1(int b)\n{\n\tint n = 0;\n\n\twhile (b)\n\t{\n\t\tchange11[n++] = (b % B);\n\t\tb = b / B;\n\t}\n\treturn n;\n}\n//change_new没问题\n\n\nint main()\n{\n\tint N, S;\n\tcin >> N >> S;\n\n\tint a, b, c, d, e, f;\n\tint num = 0;\n\tb = S + 1;\n\tint total = 0;\n\n\tfor (a = 0;; a++)\n\t{\n\t\tfor (;;)\n\t\t{\n\t\t\tfor (B = 2; B <= 10; B++)\n\t\t\t{\n\t\t\t\tint n1 = change1(b);\n\t\t\t\tif (check(change11, n1))\n\t\t\t\t\tnum++;\n\t\t\t}\n\n\t\t\tif (num >= 2)\n\t\t\t{\n\t\t\t\tcout << b << endl;\n\t\t\t\tb++;\n\t\t\t\tnum = 0;\n\t\t\t\ttotal++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tb++;\n\t\t\t\tnum = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\n\t\tif (total == N)\n\t\t\tbreak;\n\n\t}\n\n\tsystem(\""pause\"");\n\treturn 0;\n\n}",ACCEPTED,35,640
1278205485977624576,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-01 13:55:10,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint B;\nint a[10000], b[10000];\nusing namespace std;\nint turn1(int k)\n{\n    int i = 0;\n    while (k > 0) {\n        a[i++] = k % B;\n        k = k / B;\n    }\n    return i;\n}\nint turn2(int k)\n{\n    int i = 0;\n    while (k > 0) {\n        b[i++] = k % B;\n        k = k / B;\n    }\n    return i;\n}\nint huiwen(int k)\n{\n    for (int i = k - 1;i >= 0;i--)\n    {\n        if (a[i] != a[k - i - 1])\n            return 0;\n    }\n    return 1;\n}\nvoid print1(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        if (a[i] >= 10)\n            cout << (a[i] + 55);\n        else if (a[i] < 10)\n            cout << a[i];\n    }\n}\nvoid print2(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        if (b[i] >= 10)\n            cout << (b[i] + 55);\n        else if(b[i] < 10)\n            cout << b[i];\n    }\n}\nint main()\n{\n    scanf(\""%d\"", &B);\n    for (int i = 1;i <= 300;i++) {\n        int num = turn1(i * i);\n        if (huiwen(num) == 1)\n        {\n            print2(turn2(i));\n            cout << \"" \"";\n            print1(num);\n            cout << endl;\n        }\n    }\n}",PARTIAL_ACCEPTED,44,508
1278205660628451328,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-01 13:55:52,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint B;\nint a[10000], b[10000];\nusing namespace std;\nint turn1(int k)\n{\n    int i = 0;\n    while (k > 0) {\n        a[i++] = k % B;\n        k = k / B;\n    }\n    return i;\n}\nint turn2(int k)\n{\n    int i = 0;\n    while (k > 0) {\n        b[i++] = k % B;\n        k = k / B;\n    }\n    return i;\n}\nint huiwen(int k)\n{\n    for (int i = k - 1;i >= 0;i--)\n    {\n        if (a[i] != a[k - i - 1])\n            return 0;\n    }\n    return 1;\n}\nvoid print1(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        if (a[i] >= 10)\n            cout << (a[i] + 55);\n        else if (a[i] < 10)\n            cout << a[i];\n    }\n}\nvoid print2(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        if (b[i] >= 10)\n            cout << (b[i] + 55);\n        else if(b[i] < 10)\n            cout << b[i];\n    }\n}\nint main()\n{\n    cin>>B;\n    for (int i = 1;i <= 300;i++) {\n        int num = turn1(i * i);\n        if (huiwen(num) == 1)\n        {\n            print2(turn2(i));\n            cout << \"" \"";\n            print1(num);\n            cout << endl;\n        }\n    }\n}",PARTIAL_ACCEPTED,41,492
1278206023544799232,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-01 13:57:18,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint B;\nint a[10000], b[10000];\nusing namespace std;\nint turn1(int k)\n{\n    int i = 0;\n    while (k > 0) {\n        for(int i=0;i++)\n            a[i] = k % B;\n            k = k / B;\n    }\n    return i;\n}\nint turn2(int k)\n{\n    int i = 0;\n    while (k > 0) {\n        b[i++] = k % B;\n        k = k / B;\n    }\n    return i;\n}\nint huiwen(int k)\n{\n    for (int i = k - 1;i >= 0;i--)\n    {\n        if (a[i] != a[k - i - 1])\n            return 0;\n    }\n    return 1;\n}\nvoid print1(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        if (a[i] >= 10)\n            cout << (a[i] + 55);\n        else if (a[i] < 10)\n            cout << a[i];\n    }\n}\nvoid print2(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        if (b[i] >= 10)\n            cout << (b[i] + 55);\n        else if(b[i] < 10)\n            cout << b[i];\n    }\n}\nint main()\n{\n    cin>>B;\n    for (int i = 1;i <= 300;i++) {\n        int num = turn1(i * i);\n        if (huiwen(num) == 1)\n        {\n            print2(turn2(i));\n            cout << \"" \"";\n            print1(num);\n            cout << endl;\n        }\n    }\n}",COMPILE_ERROR,0,0
1278206132932247552,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-01 13:57:44,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint B;\nint a[10000], b[10000];\nusing namespace std;\nint turn1(int k)\n{\n    int i = 0;\n    while (k > 0) {\n            a[i] = k % B;\n            k = k / B;\n            i++\n    }\n    return i;\n}\nint turn2(int k)\n{\n    int i = 0;\n    while (k > 0) {\n        b[i++] = k % B;\n        k = k / B;\n    }\n    return i;\n}\nint huiwen(int k)\n{\n    for (int i = k - 1;i >= 0;i--)\n    {\n        if (a[i] != a[k - i - 1])\n            return 0;\n    }\n    return 1;\n}\nvoid print1(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        if (a[i] >= 10)\n            cout << (a[i] + 55);\n        else if (a[i] < 10)\n            cout << a[i];\n    }\n}\nvoid print2(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        if (b[i] >= 10)\n            cout << (b[i] + 55);\n        else if(b[i] < 10)\n            cout << b[i];\n    }\n}\nint main()\n{\n    cin>>B;\n    for (int i = 1;i <= 300;i++) {\n        int num = turn1(i * i);\n        if (huiwen(num) == 1)\n        {\n            print2(turn2(i));\n            cout << \"" \"";\n            print1(num);\n            cout << endl;\n        }\n    }\n}",COMPILE_ERROR,0,0
1278206164859289600,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-01 13:57:52,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint B;\nint a[10000], b[10000];\nusing namespace std;\nint turn1(int k)\n{\n    int i = 0;\n    while (k > 0) {\n            a[i] = k % B;\n            k = k / B;\n            i++;\n    }\n    return i;\n}\nint turn2(int k)\n{\n    int i = 0;\n    while (k > 0) {\n        b[i++] = k % B;\n        k = k / B;\n    }\n    return i;\n}\nint huiwen(int k)\n{\n    for (int i = k - 1;i >= 0;i--)\n    {\n        if (a[i] != a[k - i - 1])\n            return 0;\n    }\n    return 1;\n}\nvoid print1(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        if (a[i] >= 10)\n            cout << (a[i] + 55);\n        else if (a[i] < 10)\n            cout << a[i];\n    }\n}\nvoid print2(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        if (b[i] >= 10)\n            cout << (b[i] + 55);\n        else if(b[i] < 10)\n            cout << b[i];\n    }\n}\nint main()\n{\n    cin>>B;\n    for (int i = 1;i <= 300;i++) {\n        int num = turn1(i * i);\n        if (huiwen(num) == 1)\n        {\n            print2(turn2(i));\n            cout << \"" \"";\n            print1(num);\n            cout << endl;\n        }\n    }\n}",PARTIAL_ACCEPTED,41,512
1278206419130572800,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-01 13:58:52,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint B;\nint a[10000], b[10000];\nusing namespace std;\nint turn1(int k)\n{\n    int i = 0;\n    while (k > 0) {\n            a[i] = k % B;\n            k = k / B;\n            i++;\n    }\n    return i;\n}\nint turn2(int k)\n{\n    int i = 0;\n    while (k > 0) {\n        b[i] = k % B;\n        k = k / B;\n        i++\n    }\n    return i;\n}\nint huiwen(int k)\n{\n    for (int i = k - 1;i >= k/2;i--)\n    {\n        if (a[i] == a[k - i - 1])\n            return 1;\n    }\n    return 0;\n}\nvoid print1(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        if (a[i] >= 10)\n            cout << (a[i] + 55);\n        else if (a[i] < 10)\n            cout << a[i];\n    }\n}\nvoid print2(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        if (b[i] >= 10)\n            cout << (b[i] + 55);\n        else if(b[i] < 10)\n            cout << b[i];\n    }\n}\nint main()\n{\n    cin>>B;\n    for (int i = 1;i <= 300;i++) {\n        int num = turn1(i * i);\n        if (huiwen(num) == 1)\n        {\n            print2(turn2(i));\n            cout << \"" \"";\n            print1(num);\n            cout << endl;\n        }\n    }\n}",COMPILE_ERROR,0,0
1278206531303047168,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-01 13:59:19,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint B;\nint a[10000], b[10000];\nusing namespace std;\nint turn1(int k)\n{\n    int i = 0;\n    while (k > 0) {\n            a[i] = k % B;\n            k = k / B;\n            i++;\n    }\n    return i;\n}\nint turn2(int k)\n{\n    int i = 0;\n    while (k > 0) {\n        b[i] = k % B;\n        k = k / B;\n        i++;\n    }\n    return i;\n}\nint huiwen(int k)\n{\n    for (int i = k - 1;i >= k/2;i--)\n    {\n        if (a[i] == a[k - i - 1])\n            return 1;\n    }\n    return 0;\n}\nvoid print1(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        if (a[i] >= 10)\n            cout << (a[i] + 55);\n        else if (a[i] < 10)\n            cout << a[i];\n    }\n}\nvoid print2(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        if (b[i] >= 10)\n            cout << (b[i] + 55);\n        else if(b[i] < 10)\n            cout << b[i];\n    }\n}\nint main()\n{\n    cin>>B;\n    for (int i = 1;i <= 300;i++) {\n        int num = turn1(i * i);\n        if (huiwen(num) == 1)\n        {\n            print2(turn2(i));\n            cout << \"" \"";\n            print1(num);\n            cout << endl;\n        }\n    }\n}",WRONG_ANSWER,40,424
1278206630678683648,53ae28e3dbe2f18670c3ebaf391c09f8e570189a6475fc91a2ef814fd1b9799c,2020-07-01 13:59:43,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"//double palindromic number\n#include <iostream>\nusing namespace std;\n\nint N,S,temp2=0;//Ê®½øÖÆÒÔÄÚ¶¼ÊÇÊý×Ö \nint array[14];//×î´óÖµÇø¼ä10000µÄ×îС½øÖÆÊýΪ10011100010000Ϊ14λ \nbool get_palin(int x);\n\nint main(){\n\tcin>>N>>S;\n\tbool temp=true;\n\tfor (int i=S+1;S<10000;i++){\n\t\ttemp = get_palin(i);\n\t\tif (temp){\n\t\t\tcout << i <<endl;\n\t\t\ttemp2++;\n\t\t}\n\t\tif (temp2==N){\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn 0;\n}\n\nbool get_palin(int x){\n\tint sum=0;\n\tbool flag =true;\n\tfor (int m=2;m<11;m++){\n\t\tflag =true;\n\t\tint mod_a=0,index=0,temp3=x;\n\t\tarray[14]={0};\n\t\twhile (1){\n\t\t\tmod_a=temp3%m;\n\t\t\ttemp3 = temp3/m;\n\t\t\t\n\t\t\tif (!temp3){\n\t\t\t\tarray[index]=mod_a;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tarray[index]=mod_a;\n\t\t\tindex++;\n\t\t}\t\t\n\t\tfor (int k=0;k<=(index/2);k++){\n\t\t\tif (array[k]!=array[index-k]){\n\t\t\t\tflag=false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (flag){\n\t\t\tsum++;\n\t\t}\n\t\tif (sum>=2){\n\t\t\tbreak;\n\t\t}\n\t}\n\tif (sum>=2){\n\t\treturn true;\n\t}\n\telse {\n\t\treturn false;\n\t}\n}",WRONG_ANSWER,270,500
1278206788178993152,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-01 14:00:20,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint B;\nint a[10000], b[10000];\nusing namespace std;\nint turn1(int k)\n{\n    int i = 0;\n    while (k > 0) {\n        a[i] = k % B;\n        k = k / B;\n        i++;\n    }\n    return i;\n}\nint turn2(int k)\n{\n    int i = 0;\n    while (k > 0) {\n        b[i] = k % B;\n        k = k / B;\n        i++;\n    }\n    return i;\n}\nint huiwen(int k)\n{\n    for (int i = k - 1;i >= k/2;i--)\n    {\n        if (a[i] == a[k - i - 1])\n            return 1;\n    }\n    return 0;\n}\nvoid print1(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        if (a[i] >= 10)\n            cout << (a[i] + 55);\n        else if (a[i] < 10)\n            cout << a[i];\n    }\n}\nvoid print2(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        if (b[i] >= 10)\n            cout << (b[i] + 55);\n        else if(b[i] < 10)\n            cout << b[i];\n    }\n}\nint main()\n{\n    cin>>B;\n    for (int i = 1;i <= 300;i++) {\n        int num = turn1(i * i);\n        if (huiwen(num) == 1)\n        {\n            print2(turn2(i));\n            cout << \"" \"";\n            print1(num);\n            cout << endl;\n        }\n    }\n}",WRONG_ANSWER,43,512
1278206907465007104,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-01 14:00:49,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint B;\nint a[10000], b[10000];\nusing namespace std;\nint turn1(int k)\n{\n    int i = 0;\n    while (k > 0) {\n        a[i++] = k % B;\n        k = k / B;\n    }\n    return i;\n}\nint turn2(int k)\n{\n    int i = 0;\n    while (k > 0) {\n        b[i++] = k % B;\n        k = k / B;\n    }\n    return i;\n}\nint huiwen(int k)\n{\n    for (int i = k - 1;i >=k/2;i--)\n    {\n        if (a[i] != a[k - i - 1])\n            return 0;\n    }\n    return 1;\n}\nvoid print1(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        if (a[i] >= 10)\n            cout << (a[i] + 55);\n        else if (a[i] < 10)\n            cout << a[i];\n    }\n}\nvoid print2(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        if (b[i] >= 10)\n            cout << (b[i] + 55);\n        else if(b[i] < 10)\n            cout << b[i];\n    }\n}\nint main()\n{\n    cin >> B;\n    for (int i = 1;i <= 300;i++) {\n        int num = turn1(i * i);\n        if (huiwen(num) == 1)\n        {\n            print2(turn2(i));\n            cout << \"" \"";\n            print1(num);\n            cout << endl;\n        }\n    }\n}",PARTIAL_ACCEPTED,32,424
1278207277171924992,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-01 14:02:17,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint B;\nint a[10000], b[10000];\nusing namespace std;\nint turn1(int k)\n{\n    int i = 0;\n    while (k > 0) {\n        a[i] = k % B;\n        k = k / B;\n        i++;\n    }\n    return i;\n}\nint turn2(int k)\n{\n    int i = 0;\n    while (k > 0) {\n        b[i] = k % B;\n        k = k / B;\n        i++;\n    }\n    return i;\n}\nint huiwen(int k)\n{\n    for (int i = k - 1;i >=k/2;i--)\n    {\n        if (a[i] == a[k - i - 1])\n            return 1;\n    }\n    return 0;\n}\nvoid print1(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        if (a[i] >= 10)\n            cout << (a[i] + 55);\n        else if (a[i] < 10)\n            cout << a[i];\n    }\n}\nvoid print2(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        if (b[i] >= 10)\n            cout << (b[i] + 55);\n        else if(b[i] < 10)\n            cout << b[i];\n    }\n}\nint main()\n{\n    cin >> B;\n    for (int i = 1;i <= 300;i++) {\n        int num = turn1(i * i);\n        if (huiwen(num) == 1)\n        {\n            print2(turn2(i));\n            cout << \"" \"";\n            print1(num);\n            cout << endl;\n        }\n    }\n}",WRONG_ANSWER,45,424
1278207367005528064,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-01 14:02:38,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint B;\nint a[10000], b[10000];\nusing namespace std;\nint turn1(int k)\n{\n    int i = 0;\n    while (k > 0) {\n        a[i] = k % B;\n        k = k / B;\n        i++;\n    }\n    return i;\n}\nint turn2(int k)\n{\n    int i = 0;\n    while (k > 0) {\n        b[i] = k % B;\n        k = k / B;\n        i++;\n    }\n    return i;\n}\nint huiwen(int k)\n{\n    for (int i = k - 1;i >=k/2;i--)\n    {\n        if (a[i] == a[k - i - 1])\n            return 0;\n    }\n    return 1;\n}\nvoid print1(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        if (a[i] >= 10)\n            cout << (a[i] + 55);\n        else if (a[i] < 10)\n            cout << a[i];\n    }\n}\nvoid print2(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        if (b[i] >= 10)\n            cout << (b[i] + 55);\n        else if(b[i] < 10)\n            cout << b[i];\n    }\n}\nint main()\n{\n    cin >> B;\n    for (int i = 1;i <= 300;i++) {\n        int num = turn1(i * i);\n        if (huiwen(num) == 1)\n        {\n            print2(turn2(i));\n            cout << \"" \"";\n            print1(num);\n            cout << endl;\n        }\n    }\n}",WRONG_ANSWER,37,516
1278207510719168512,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-01 14:03:13,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint B;\nint a[10000], b[10000];\nusing namespace std;\nint turn1(int k)\n{\n    int i = 0;\n    while (k > 0) {\n        a[i] = k % B;\n        k = k / B;\n        i++;\n    }\n    return i;\n}\nint turn2(int k)\n{\n    int i = 0;\n    while (k > 0) {\n        b[i] = k % B;\n        k = k / B;\n        i++;\n    }\n    return i;\n}\nint huiwen(int k)\n{\n    for (int i = k - 1;i >=k/2;i--)\n    {\n        if (a[i] != a[k - i - 1])\n            return 0;\n    }\n    return 1;\n}\nvoid print1(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        if (a[i] >= 10)\n            cout << (a[i] + 55);\n        else if (a[i] < 10)\n            cout << a[i];\n    }\n}\nvoid print2(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        if (b[i] >= 10)\n            cout << (b[i] + 55);\n        else if(b[i] < 10)\n            cout << b[i];\n    }\n}\nint main()\n{\n    cin >> B;\n    for (int i = 1;i <= 300;i++) {\n        int num = turn1(i * i);\n        if (huiwen(num) == 1)\n        {\n            print2(turn2(i));\n            cout << \"" \"";\n            print1(num);\n            cout << endl;\n        }\n    }\n}",PARTIAL_ACCEPTED,33,732
1278207765468602368,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-01 14:04:13,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint B;\nint a[10000], b[10000];\nusing namespace std;\nint turn1(int k)\n{\n    int i = 0;\n    while (k > 0) {\n        a[i] = k % B;\n        k = k / B;\n        i++;\n    }\n    return i;\n}\nint turn2(int k)\n{\n    int i = 0;\n    while (k > 0) {\n        b[i] = k % B;\n        k = k / B;\n        i++;\n    }\n    return i;\n}\nint huiwen(int k)\n{\n    for (int i = k - 1;i >=k/2;i--)\n    {\n        if (a[i] != a[k - i - 1])\n            return 0;\n    }\n    return 1;\n}\nvoid print1(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        if (a[i] >= 10)\n            cout << (a[i] + 'A');\n        else if (a[i] < 10)\n            cout << a[i];\n    }\n}\nvoid print2(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        if (b[i] >= 10)\n            cout << (b[i] + 55);\n        else if(b[i] < 10)\n            cout << b[i];\n    }\n}\nint main()\n{\n    cin >> B;\n    for (int i = 1;i <= 300;i++) {\n        int num = turn1(i * i);\n        if (huiwen(num) == 1)\n        {\n            print2(turn2(i));\n            cout << \"" \"";\n            print1(num);\n            cout << endl;\n        }\n    }\n}",PARTIAL_ACCEPTED,38,424
1278208666988109824,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-01 14:07:48,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<vector>\n#include<cstdio>\nint B;\nvector<int> a,b;\nusing namespace std;\nint turn1(int k)\n{\n    int i = 0;\n    while (k > 0) {\n        a[i] = k % B;\n        k = k / B;\n        i++;\n    }\n    return i;\n}\nint turn2(int k)\n{\n    int i = 0;\n    while (k > 0) {\n        b[i] = k % B;\n        k = k / B;\n        i++;\n    }\n    return i;\n}\nint huiwen(int k)\n{\n    for (int i = k - 1;i >=k/2;i--)\n    {\n        if (a[i] != a[k - i - 1])\n            return 0;\n    }\n    return 1;\n}\nvoid print1(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        if (a[i] >= 10)\n            cout << (a[i] + 'A');\n        else if (a[i] < 10)\n            cout << a[i];\n    }\n}\nvoid print2(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        if (b[i] >= 10)\n            cout << (b[i] + 55);\n        else if(b[i] < 10)\n            cout << b[i];\n    }\n}\nint main()\n{\n    cin >> B;\n    for (int i = 1;i <= 300;i++) {\n        int num = turn1(i * i);\n        if (huiwen(num) == 1)\n        {\n            print2(turn2(i));\n            cout << \"" \"";\n            print1(num);\n            cout << endl;\n        }\n    }\n}",COMPILE_ERROR,0,0
1278209179645313024,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-01 14:09:51,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint a[10000000], b[10000000];\nint B;\nusing namespace std;\nint turn1(int k)\n{\n    int i = 0;\n    while (k > 0) {\n        a[i] = k % B;\n        k = k / B;\n        i++;\n    }\n    return i;\n}\nint turn2(int k)\n{\n    int i = 0;\n    while (k > 0) {\n        b[i] = k % B;\n        k = k / B;\n        i++;\n    }\n    return i;\n}\n\nvoid print1(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        if (a[i] >= 10)\n            cout << (a[i] + 'A');\n        else if (a[i] < 10)\n            cout << a[i];\n    }\n}\nvoid print2(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        if (b[i] >= 10)\n            cout << (b[i] +'A');\n        else if(b[i] < 10)\n            cout << b[i];\n    }\n}\nint huiwen(int k)\n{\n    for (int i = k - 1;i >=0;i--)\n    {\n        if (a[i] != a[k - i - 1])\n            return 0;\n    }\n    return 1;\n}\nint main()\n{\n    cin >> B;\n    for (int i = 1;i <= 300;i++) {\n        int num = turn1(i * i);\n        if (huiwen(num) == 1)\n        {\n            print2(turn2(i));\n            cout << \"" \"";\n            print1(num);\n            cout << endl;\n        }\n    }\n}",PARTIAL_ACCEPTED,40,424
1278210280578801664,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-01 14:14:13,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint a[10000000], b[10000000];\nint B;\nusing namespace std;\nint turn1(int k)\n{\n    int i = 0;\n    while (k > 0) {\n        a[i] = k % B;\n        k = k / B;\n        i++;\n    }\n    return i;\n}\nint turn2(int k)\n{\n    int i = 0;\n    while (k > 0) {\n        b[i] = k % B;\n        k = k / B;\n        i++;\n    }\n    return i;\n}\n\nvoid print1(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        if (a[i] >= 10)\n            cout << (a[i] + 'A');\n        else if (a[i] < 10)\n            cout << a[i];\n    }\n}\nvoid print2(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        if (b[i] >= 10)\n            cout << (b[i] +'A');\n        else if(b[i] < 10)\n            cout << b[i];\n    }\n}\nint huiwen(int k)\n{\n    for (int i = k - 1;i >=0;i--)\n    {\n        if (a[i] != a[k - i - 1])\n            return 0;\n    }\n    return 1;\n}\nint main()\n{\n    cin >> B;\n    for (int i = 1;i <= 300;i++) {\n        int num = turn1(i * i);\n        if (huiwen(num) == 1)\n        {\n            if(print2(turn2(i))<=300){\n                print2(turn2(i));\n                cout << \"" \"";\n                print1(num);\n                cout << endl;\n            }\n        }\n    }\n}",COMPILE_ERROR,0,0
1278210313818660864,53ae28e3dbe2f18670c3ebaf391c09f8e570189a6475fc91a2ef814fd1b9799c,2020-07-01 14:14:21,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"//double palindromic number\n#include <iostream>\nusing namespace std;\n\nint N,S,temp2=0;//Ê®½øÖÆÒÔÄÚ¶¼ÊÇÊý×Ö \nint array[14];//×î´óÖµÇø¼ä10000µÄ×îС½øÖÆÊýΪ10011100010000Ϊ14λ \nbool get_palin(int x);\n\nint main(){\n\tcin>>N>>S;\n\tbool temp=true;\n\tfor (int i=S+1;;i++){\n\t\ttemp = get_palin(i);\n\t\tif (temp){\n\t\t\tcout << i <<endl;\n\t\t\ttemp2++;\n\t\t}\n\t\tif (temp2==N){\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn 0;\n}\n\nbool get_palin(int x){\n\tint sum=0;\n\tbool flag =true;\n\tfor (int m=2;m<11;m++){\n\t\tflag =true;\n\t\tint mod_a=0,index=0,temp3=x;\n\t\tarray[14]={0};\n\t\twhile (1){\n\t\t\tmod_a=temp3%m;\n\t\t\ttemp3 = temp3/m;\n\t\t\t\n\t\t\tif (!temp3){\n\t\t\t\tarray[index]=mod_a;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tarray[index]=mod_a;\n\t\t\tindex++;\n\t\t}\t\t\n\t\tfor (int k=0;k<=(index/2);k++){\n\t\t\tif (array[k]!=array[index-k]){\n\t\t\t\tflag=false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (flag){\n\t\t\tsum++;\n\t\t}\n\t\tif (sum>=2){\n\t\t\tbreak;\n\t\t}\n\t}\n\tif (sum>=2){\n\t\treturn true;\n\t}\n\telse {\n\t\treturn false;\n\t}\n}",WRONG_ANSWER,276,512
1278211231226200064,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-01 14:18:00,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint a[10000000], b[10000000];\nint B;\nusing namespace std;\nint turn1(int k)\n{\n    int i = 0;\n    while (k > 0) {\n        a[i] = k % B;\n        k = k / B;\n        i++;\n    }\n    return i;\n}\nint turn2(int k)\n{\n    int i = 0;\n    while (k > 0) {\n        b[i] = k % B;\n        k = k / B;\n        i++;\n    }\n    return i;\n}\n\nvoid print1(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        if (a[i] >= 10)\n            cout << (a[i] + 'A');\n        else if (a[i] < 10)\n            cout << a[i];\n    }\n}\nvoid print2(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        if (b[i] >= 10)\n            cout << (b[i] +'A');\n        else if(b[i] < 10)\n            cout << b[i];\n    }\n}\nint huiwen(int k)\n{\n    for (int i =0;i <=k-1;i++)\n    {\n        if (a[i] != a[k - i - 1])\n            return 0;\n    }\n    return 1;\n}\nint main()\n{\n    cin >> B;\n    for (int i = 1;i <= 300;i++) {\n        int num = turn1(i * i);\n        if (huiwen(num) == 1)\n        {\n            if(print2(turn2(i))<=300){\n                print2(turn2(i));\n                cout << \"" \"";\n                print1(num);\n                cout << endl;\n            }\n        }\n    }\n}",COMPILE_ERROR,0,0
1278211288608473088,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-01 14:18:13,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint a[10000000], b[10000000];\nint B;\nusing namespace std;\nint turn1(int k)\n{\n    int i = 0;\n    while (k > 0) {\n        a[i] = k % B;\n        k = k / B;\n        i++;\n    }\n    return i;\n}\nint turn2(int k)\n{\n    int i = 0;\n    while (k > 0) {\n        b[i] = k % B;\n        k = k / B;\n        i++;\n    }\n    return i;\n}\n\nvoid print1(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        if (a[i] >= 10)\n            cout << (a[i] + 'A');\n        else if (a[i] < 10)\n            cout << a[i];\n    }\n}\nvoid print2(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        if (b[i] >= 10)\n            cout << (b[i] +'A');\n        else if(b[i] < 10)\n            cout << b[i];\n    }\n}\nint huiwen(int k)\n{\n    for (int i =0;i <=k-1;i++)\n    {\n        if (a[i] != a[k - i - 1])\n            return 0;\n    }\n    return 1;\n}\nint main()\n{\n    cin >> B;\n    for (int i = 1;i <= 300;i++) {\n        int num = turn1(i * i);\n        if (huiwen(num) == 1)\n        {\n            if(turn2(i)<=300){\n                print2(turn2(i));\n                cout << \"" \"";\n                print1(num);\n                cout << endl;\n            }\n        }\n    }\n}",PARTIAL_ACCEPTED,40,512
1278213399140294656,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-01 14:26:37,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint a[10000000], b[10000000];\nint B;\nusing namespace std;\nint turn1(int k)\n{\n    int i = 0;\n    while (k > 0) {\n        a[i] = k % B;\n        k = k / B;\n        i++;\n    }\n    return i;\n}\nint turn2(int k)\n{\n    int i = 0;\n    while (k > 0) {\n        b[i] = k % B;\n        k = k / B;\n        i++;\n    }\n    return i;\n}\n\nvoid print1(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        while (a[i] >= 10){\n            if (a[i]==10)\n                cout<<'A';\n            else if(a[i]==11)\n                cout<<'B';\n             else if(a[i]==12)\n                cout<<'C';\n             else if(a[i]==13)\n                cout<<'D';\n             else if(a[i]==14)\n                cout<<'E';\n             else if(a[i]==15)\n                cout<<'F';\n             else if(a[i]==16)\n                cout<<'G';\n             else if(a[i]==17)\n                cout<<'H';\n             else if(a[i]==18)\n                cout<<'I';\n             else if(a[i]==19)\n                cout<<'J';\n             else if(a[i]==20\n                cout<<'K';\n        }\n        if (a[i] < 10)\n            cout << a[i];\n    }\n}\nvoid print2(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        if (b[i] >= 10)\n            cout << (b[i] +'A');\n        else if(b[i] < 10)\n            cout << b[i];\n    }\n}\nint huiwen(int k)\n{\n    for (int i =0;i <=k-1;i++)\n    {\n        if (a[i] != a[k - i - 1])\n            return 0;\n    }\n    return 1;\n}\nint main()\n{\n    cin >> B;\n    for (int i = 1;i <= 300;i++) {\n        int num = turn1(i * i);\n        if (huiwen(num) == 1)\n        {\n            if(turn2(i)<=300){\n                print2(turn2(i));\n                cout << \"" \"";\n                print1(num);\n                cout << endl;\n            }\n        }\n    }\n}",COMPILE_ERROR,0,0
1278213462855966720,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-01 14:26:52,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint a[10000000], b[10000000];\nint B;\nusing namespace std;\nint turn1(int k)\n{\n    int i = 0;\n    while (k > 0) {\n        a[i] = k % B;\n        k = k / B;\n        i++;\n    }\n    return i;\n}\nint turn2(int k)\n{\n    int i = 0;\n    while (k > 0) {\n        b[i] = k % B;\n        k = k / B;\n        i++;\n    }\n    return i;\n}\n\nvoid print1(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        while (a[i] >= 10){\n            if (a[i]==10)\n                cout<<'A';\n            else if(a[i]==11)\n                cout<<'B';\n             else if(a[i]==12)\n                cout<<'C';\n             else if(a[i]==13)\n                cout<<'D';\n             else if(a[i]==14)\n                cout<<'E';\n             else if(a[i]==15)\n                cout<<'F';\n             else if(a[i]==16)\n                cout<<'G';\n             else if(a[i]==17)\n                cout<<'H';\n             else if(a[i]==18)\n                cout<<'I';\n             else if(a[i]==19)\n                cout<<'J';\n             else if(a[i]==20)\n                cout<<'K';\n        }\n        if (a[i] < 10)\n            cout << a[i];\n    }\n}\nvoid print2(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        if (b[i] >= 10)\n            cout << (b[i] +'A');\n        else if(b[i] < 10)\n            cout << b[i];\n    }\n}\nint huiwen(int k)\n{\n    for (int i =0;i <=k-1;i++)\n    {\n        if (a[i] != a[k - i - 1])\n            return 0;\n    }\n    return 1;\n}\nint main()\n{\n    cin >> B;\n    for (int i = 1;i <= 300;i++) {\n        int num = turn1(i * i);\n        if (huiwen(num) == 1)\n        {\n            if(turn2(i)<=300){\n                print2(turn2(i));\n                cout << \"" \"";\n                print1(num);\n                cout << endl;\n            }\n        }\n    }\n}",PARTIAL_ACCEPTED,17,424
1278214068421197824,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-01 14:29:16,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint a[10000000], b[10000000];\nint B;\nusing namespace std;\nint turn1(int k)\n{\n    int i = 0;\n    while (k > 0) {\n        a[i] = k % B;\n        k = k / B;\n        i++;\n    }\n    return i;\n}\nint turn2(int k)\n{\n    int i = 0;\n    while (k > 0) {\n        b[i] = k % B;\n        k = k / B;\n        i++;\n    }\n    return i;\n}\n\nvoid print1(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        while (a[i] >= 10){\n            if (a[i]==10)\n                cout<<'A';\n            else if(a[i]==11)\n                cout<<'B';\n             else if(a[i]==12)\n                cout<<'C';\n             else if(a[i]==13)\n                cout<<'D';\n             else if(a[i]==14)\n                cout<<'E';\n             else if(a[i]==15)\n                cout<<'F';\n             else if(a[i]==16)\n                cout<<'G';\n             else if(a[i]==17)\n                cout<<'H';\n             else if(a[i]==18)\n                cout<<'I';\n             else if(a[i]==19)\n                cout<<'J';\n             else if(a[i]==20)\n                cout<<'K';\n        }\n        if (a[i] < 10)\n            cout << a[i];\n    }\n}\nvoid print2(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        while(b[i] >= 10)\n            if (b[i]==10)\n                cout<<'A';\n            else if(b[i]==11)\n                cout<<'B';\n            else if(b[i]==12)\n                cout<<'C';\n            else if(b[i]==13)\n                cout<<'D';\n            else if(b[i]==14)\n                cout<<'E';\n            else if(b[i]==15)\n                cout<<'F';\n            else if(b[i]==16)\n                cout<<'G';\n            else if(b[i]==17)\n                cout<<'H';\n            else if(b[i]==18)\n                cout<<'I';\n            else if(b[i]==19)\n                cout<<'J';\n            else if(b[i]==20)\n                cout<<'K';\n        if(b[i] < 10)\n            cout << b[i];\n    }\n}\nint huiwen(int k)\n{\n    for (int i =0;i <=k-1;i++)\n    {\n        if (a[i] != a[k - i - 1])\n            return 0;\n    }\n    return 1;\n}\nint main()\n{\n    cin >> B;\n    for (int i = 1;i <= 300;i++) {\n        int num = turn1(i * i);\n        if (huiwen(num) == 1)\n        {\n            if(turn2(i)<=300){\n                print2(turn2(i));\n                cout << \"" \"";\n                print1(num);\n                cout << endl;\n            }\n        }\n    }\n}",PARTIAL_ACCEPTED,23,512
1278216998314508288,b42cd3949c84ee5ac9cc4d923f87cacc9a1701d8d7f592ebaf402a6ad0b20e72,2020-07-01 14:40:55,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\n\nint N = 0;\nint S = 0;\nchar remainders[10] = { '0','1','2','3','4','5','6','7','8','9'};//所有可能的余数\nstring change(int x, int num);//进制转换函数\nstring change_sort(string oldString);//颠倒顺序\nvoid solve();\n\nint main()\n{\n\tcin >> N >> S;\n\tsolve();\n}\n\n//x进制转换函数\n string change(int x, int num) {\n\tvector<char> num_remainders;//存放余数\n\tstring num_x = \""\"";//存放x进制数结果\n\n\twhile (num != 0) {\n\t\tnum_remainders.push_back(remainders[num % x]);\n\t\tnum /= x;\n\t}\n\t//最后余数要倒过来存进结果字符串\n\tfor (int i = num_remainders.size() - 1; i >= 0; i--) {\n\t\tnum_x += num_remainders[i];\n\t}\n\n\treturn num_x;\n}\n\n//颠倒顺序\nstring change_sort(string oldString) {\n\tstring newString = \""\"";\n\tfor (int i = oldString.size() - 1; i >= 0; i--) {\n\t\tnewString += oldString[i];\n\t}\n\treturn newString;\n}\n\nvoid solve() {\n\tint num = S + 1;//每一次进行循环的数字\n\tint global_counter = 0;//用来控制前N个输出结果\n\n\twhile (global_counter < N) {\n\t\tint counter = 0;//用来控制进制判断的次数，如果已经有2个进制满足了，就没有必要再继续判断了\n\n\t\tfor (int i = 2; i < 10; i++) { \n\t\t\t//首先判断十进制时是不是回文数\n\t\t\tstring str = to_string(num);\n\t\t\tif (str == change_sort(str)) {\n\t\t\t\tcounter++;\n\t\t\t}\n\t\t\t//在判断非十进制是不是回文数\n\t\t\tstring num_x = change(i, num);//将数字转为i进制\n\t\t\tif (num_x == change_sort(num_x)) {\n\t\t\t\tcounter++;\n\t\t\t}\n\n\t\t\tif (counter >= 2) {\n\t\t\t\tcout << num << endl;//输出这个满足题目的数\n\t\t\t\tglobal_counter++;//全局计数器要加一\n\t\t\t\tbreak;//若已经有2个进制满足了，则这个数就可以了\n\t\t\t}\n\n\t\t}\n\t\t\n\t\tnum++;//每次数字要加一进入下一次循环判断\n\t}\n}\n",PARTIAL_ACCEPTED,44,488
1278217589350653952,b42cd3949c84ee5ac9cc4d923f87cacc9a1701d8d7f592ebaf402a6ad0b20e72,2020-07-01 14:43:16,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\n\nint N = 0;\nint S = 0;\nchar remainders[10] = { '0','1','2','3','4','5','6','7','8','9'};//所有可能的余数\nstring change(int x, int num);//进制转换函数\nstring change_sort(string oldString);//颠倒顺序\nvoid solve();\n\nint main()\n{\n\tcin >> N >> S;\n\tsolve();\n}\n\n//x进制转换函数\n string change(int x, int num) {\n\tvector<char> num_remainders;//存放余数\n\tstring num_x = \""\"";//存放x进制数结果\n\n\twhile (num != 0) {\n\t\tnum_remainders.push_back(remainders[num % x]);\n\t\tnum /= x;\n\t}\n\t//最后余数要倒过来存进结果字符串\n\tfor (int i = num_remainders.size() - 1; i >= 0; i--) {\n\t\tnum_x += num_remainders[i];\n\t}\n\n\treturn num_x;\n}\n\n//颠倒顺序\nstring change_sort(string oldString) {\n\tstring newString = \""\"";\n\tfor (int i = oldString.size() - 1; i >= 0; i--) {\n\t\tnewString += oldString[i];\n\t}\n\treturn newString;\n}\n\nvoid solve() {\n\tint num = S + 1;//每一次进行循环的数字\n\tint global_counter = 0;//用来控制前N个输出结果\n\n\twhile (global_counter < N) {\n\t\tint counter = 0;//用来控制进制判断的次数，如果已经有2个进制满足了，就没有必要再继续判断了\n\n\t\t//首先判断十进制时是不是回文数\n\t\tstring str = to_string(num);\n\t\t//cout << \""字符串\"" << str << endl;\n\t\tif (str == change_sort(str)) {\n\t\t\tcounter++;\n\t\t}\n\n\t\t//再判断非十进制是不是回文数\n\t\tfor (int i = 2; i < 10; i++) { \n\t\t\tstring num_x = change(i, num);//将数字转为i进制\n\t\t\tif (num_x == change_sort(num_x)) {\n\t\t\t\tcounter++;\n\t\t\t}\n\n\t\t\tif (counter >= 2) {\n\t\t\t\tcout << num << endl;//输出这个满足题目的数\n\t\t\t\tglobal_counter++;//全局计数器要加一\n\t\t\t\tbreak;//若已经有2个进制满足了，则这个数就可以了\n\t\t\t}\n\n\t\t}\n\t\t\n\t\tnum++;//每次数字要加一进入下一次循环判断\n\t}\n}\n",ACCEPTED,48,512
1278217699493076992,ad8686712a9999dbe03ced4f0edcc6d1ec90b29a12065ac79e4414d28f7d7af6,2020-07-01 14:43:42,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <cmath>\n\nusing namespace std;\nlong int transB(int num, int b);\niong int reverse(int number);\n\nint main() {\n\tint N{ 0 }, S{ 0 };\n\tcin >> N >> S;\n\tint timesN = 0;\n\tint timesB = 0;\n\tS += 1;\n\twhile (timesN<N)\n\t{\n\t\tfor (int i{ 2 };i <= 10;i++) {\n\t\t\tlong int tranB = transB(S, i);\n\t\t\tlong int reverB = reverse(tranB);\n\t\t\tif (tranB == reverB)\n\t\t\t\ttimesB += 1;\n\t\t\tif (timesB >= 2) {\n\t\t\t\tcout << S << endl;\n\t\t\t\ttimesN += 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\ttimesB = 0;\n\t\t++S;\n\t\t\n\t}\n}\n\nint transB(int num, int b) {\n\tvector<int> numList;\n\tdo {\n\t\tnumList.push_back(num % b);\n\t\tnum /= b;\n\t} while (num != 0);\n\tlong int number = 0;\n\tfor (int i{ 0 };i < numList.size();i++) {\n\t\tnumber += numList[i] * pow(10, i);\n\t}\n\treturn number;\n}\n\nint reverse(int number) {\n\tlong int rever{ 0 };\n\twhile (number > 0)\n\t{\n\t\trever = rever * 10 + number % 10;\n\t\tnumber = number / 10;\n\t}\n\treturn rever;\n}",COMPILE_ERROR,0,0
1278217776546643968,ad8686712a9999dbe03ced4f0edcc6d1ec90b29a12065ac79e4414d28f7d7af6,2020-07-01 14:44:00,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <cmath>\n\nusing namespace std;\nlong int transB(int num, int b);\nlong int reverse(int number);\n\nint main() {\n\tint N{ 0 }, S{ 0 };\n\tcin >> N >> S;\n\tint timesN = 0;\n\tint timesB = 0;\n\tS += 1;\n\twhile (timesN<N)\n\t{\n\t\tfor (int i{ 2 };i <= 10;i++) {\n\t\t\tlong int tranB = transB(S, i);\n\t\t\tlong int reverB = reverse(tranB);\n\t\t\tif (tranB == reverB)\n\t\t\t\ttimesB += 1;\n\t\t\tif (timesB >= 2) {\n\t\t\t\tcout << S << endl;\n\t\t\t\ttimesN += 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\ttimesB = 0;\n\t\t++S;\n\t\t\n\t}\n}\n\nint transB(int num, int b) {\n\tvector<int> numList;\n\tdo {\n\t\tnumList.push_back(num % b);\n\t\tnum /= b;\n\t} while (num != 0);\n\tlong int number = 0;\n\tfor (int i{ 0 };i < numList.size();i++) {\n\t\tnumber += numList[i] * pow(10, i);\n\t}\n\treturn number;\n}\n\nint reverse(int number) {\n\tlong int rever{ 0 };\n\twhile (number > 0)\n\t{\n\t\trever = rever * 10 + number % 10;\n\t\tnumber = number / 10;\n\t}\n\treturn rever;\n}",COMPILE_ERROR,0,0
1278218011687706624,27ff531dca209d27f05a912acc9c18be0ac1190606526d88ed6be14bdd8e82cc,2020-07-01 14:44:56,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<cstdio>\n#include<cstring>\n#include<algorithm>\nusing namespace std;\nint b;\ninline char c(int x){if(x>=0&&x<=9)return x+'0';return x-10+'A';}\nstruct node\n{\n    int l,a[20];\n    node(int x){for(l=0;x;l++)a[l]=x%b,x/=b;}\n    void out(){for(int i=l-1;i>=0;i--)printf(\""%c\"",c(a[i]));}\n    bool tf(){for(int i=0;i<l;i++)if(a[i]!=a[l-i-1])return false;return true;}\n};\nint main()\n{\n    scanf(\""%d\"",&b);\n    for(int i=1;i<=300;i++)\n    {\n        node n(i*i);\n        if(n.tf()){node m(i);m.out();putchar(' ');n.out();putchar('\\n');}\n    }\n    return 0;\n}",ACCEPTED,32,384
1278218053651718144,ad8686712a9999dbe03ced4f0edcc6d1ec90b29a12065ac79e4414d28f7d7af6,2020-07-01 14:45:06,C++,50.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <cmath>\n\nusing namespace std;\nlong int transB(int num, int b);\nlong int reverse(int number);\n\nint main() {\n\tint N{ 0 }, S{ 0 };\n\tcin >> N >> S;\n\tint timesN = 0;\n\tint timesB = 0;\n\tS += 1;\n\twhile (timesN < N)\n\t{\n\t\tfor (int i{ 2 };i <= 10;i++) {\n\t\t\tlong int tranB = transB(S, i);\n\t\t\tlong int reverB = reverse(tranB);\n\t\t\tif (tranB == reverB)\n\t\t\t\ttimesB += 1;\n\t\t\tif (timesB >= 2) {\n\t\t\t\tcout << S << endl;\n\t\t\t\ttimesN += 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\ttimesB = 0;\n\t\t++S;\n\n\t}\n}\n\nlong int transB(int num, int b) {\n\tvector<int> numList;\n\tdo {\n\t\tnumList.push_back(num % b);\n\t\tnum /= b;\n\t} while (num != 0);\n\tlong int number = 0;\n\tfor (int i{ 0 };i < numList.size();i++) {\n\t\tnumber += numList[i] * pow(10, i);\n\t}\n\treturn number;\n}\n\nlong int reverse(int number) {\n\tlong int rever{ 0 };\n\twhile (number > 0)\n\t{\n\t\trever = rever * 10 + number % 10;\n\t\tnumber = number / 10;\n\t}\n\treturn rever;\n}",PARTIAL_ACCEPTED,66,512
1278218162242256896,27ff531dca209d27f05a912acc9c18be0ac1190606526d88ed6be14bdd8e82cc,2020-07-01 14:45:32,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"//#include<cstdio>\n#include<iostream>\n#include<cstring>\n//#include<algorithm>\nusing namespace std;\nint b;\ninline char c(int x){if(x>=0&&x<=9)return x+'0';return x-10+'A';}\nstruct node\n{\n    int l,a[20];\n    node(int x){for(l=0;x;l++)a[l]=x%b,x/=b;}\n    void out(){for(int i=l-1;i>=0;i--)printf(\""%c\"",c(a[i]));}\n    bool tf(){for(int i=0;i<l;i++)if(a[i]!=a[l-i-1])return false;return true;}\n};\nint main()\n{\n    scanf(\""%d\"",&b);\n    for(int i=1;i<=300;i++)\n    {\n        node n(i*i);\n        if(n.tf()){node m(i);m.out();putchar(' ');n.out();putchar('\\n');}\n    }\n    return 0;\n}",ACCEPTED,40,496
1278219391315927040,0346a04f58bcfe7428451052e2cf0a024a3f4fe8818f15cc29e83479b663797b,2020-07-01 14:50:25,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<string>\n#include<algorithm>\nusing namespace std;\n\nbool isPlalin(int a, int scale){\n    string s,s2;\n    int temp=a,iCount;\n    for(iCount=0;temp;iCount++){\n        if(temp%scale>=10){\n            s[iCount]=temp%scale+55;\n            temp=temp/scale;\n            continue;\n        }\n        s[iCount]=temp%scale+48;\n        temp=(temp/scale);\n    }\n    //    for(int i=iCount-1;i>=0;i--)\n    //        cout<<s[i];\n    if(iCount%2==0)\n        return false;\n    for(int i=iCount-1;i>iCount/2;i--){\n        if(s[i]!=s[iCount-i-1])\n            return false;\n    }\n    return true;\n}\n\nint main()\n{\n    int iNum,iArr[300],iCount=0;\n    cin >> iNum;\n    for(int i=0;i<300;i++)\n        if(isPlalin(i*i,iNum))\n        {iArr[iCount]=i;iCount++;}\n    for(int i=0;i<iCount;i++)\n        cout<<iArr[i]<<\"" \""<<iArr[i]*iArr[i]<<endl;\n    return 0;\n}\n",PARTIAL_ACCEPTED,38,548
1278219580764258304,0346a04f58bcfe7428451052e2cf0a024a3f4fe8818f15cc29e83479b663797b,2020-07-01 14:51:10,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<string>\n#include<algorithm>\nusing namespace std;\n\nbool isPlalin(int a, int scale){\n    string s,s2;\n    int temp=a,iCount;\n    for(iCount=0;temp;iCount++){\n        if(temp%scale>=10){\n            s[iCount]=temp%scale+55;\n            temp=temp/scale;\n            continue;\n        }\n        s[iCount]=temp%scale+48;\n        temp=(temp/scale);\n    }\n    //    for(int i=iCount-1;i>=0;i--)\n    //        cout<<s[i];\n    if(iCount%2==0)\n        return false;\n    for(int i=iCount-1;i>iCount/2;i--){\n        if(s[i]!=s[iCount-i-1])\n            return false;\n    }\n    return true;\n}\n\nint main()\n{\n    int iNum,iArr[300],iCount=0;\n    cin >> iNum;\n    for(int i=0;i<300;i++)\n        if(isPlalin(i*i,iNum))\n        {iArr[iCount]=i;iCount++;}\n    for(int i=0;i<iCount-1;i++)\n        cout<<iArr[i]<<\"" \""<<iArr[i]*iArr[i]<<endl;\n    return 0;\n}\n",MULTIPLE_ERROR,25,424
1278223547904753664,53ae28e3dbe2f18670c3ebaf391c09f8e570189a6475fc91a2ef814fd1b9799c,2020-07-01 15:06:56,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"//double palindromic number\n#include <iostream>\nusing namespace std;\n\nint N,S,temp2=0;//Ê®½øÖÆÒÔÄÚ¶¼ÊÇÊý×Ö \nint array[15];//×î´óÖµÇø¼ä10000µÄ×îС½øÖÆÊýΪ10011100010000Ϊ14λ \nbool get_palin(int x);\n\nint main(){\n\tcin>>N>>S;\n\tbool temp=true;\n\tfor (int i=S+1;;i++){\n\t\ttemp = get_palin(i);\n\t\tif (temp){\n\t\t\tcout << i <<endl;\n\t\t\ttemp2++;\n\t\t}\n\t\tif (temp2==N){\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn 0;\n}\n\nbool get_palin(int x){\n\tint sum=0;\n\tbool flag =true;\n\tfor (int m=2;m<11;m++){\n\t\tflag =true;\n\t\tint mod_a=0,index=0;\n\t\tarray[15]={0};\n\t\twhile (1){\n\t\t\tmod_a=x3%m;\n\t\t\tx = x/m;\n\t\t\tif (!x){\n\t\t\t\tarray[index]=mod_a;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tarray[index]=mod_a;\n\t\t\tindex++;\n\t\t}\t\t\n\t\tfor (int k=0;k<=(index/2);k++){\n\t\t\tif (array[k]!=array[index-k]){\n\t\t\t\tflag=false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (flag){\n\t\t\tsum++;\n\t\t}\n\t\tif (sum>=2){\n\t\t\tbreak;\n\t\t}\n\t}\n\tif (sum>=2){\n\t\treturn true;\n\t}\n\telse {\n\t\treturn false;\n\t}\n}",COMPILE_ERROR,0,0
1278223763601031168,53ae28e3dbe2f18670c3ebaf391c09f8e570189a6475fc91a2ef814fd1b9799c,2020-07-01 15:07:48,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"//double palindromic number\n#include <iostream>\nusing namespace std;\n\nint N,S,temp2=0;//Ê®½øÖÆÒÔÄÚ¶¼ÊÇÊý×Ö \nint array[15];//×î´óÖµÇø¼ä10000µÄ×îС½øÖÆÊýΪ10011100010000Ϊ14λ \nbool get_palin(int x);\n\nint main(){\n\tcin>>N>>S;\n\tbool temp=true;\n\tfor (int i=S+1;;i++){\n\t\ttemp = get_palin(i);\n\t\tif (temp){\n\t\t\tcout << i <<endl;\n\t\t\ttemp2++;\n\t\t}\n\t\tif (temp2==N){\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn 0;\n}\n\nbool get_palin(int x){\n\tint sum=0;\n\tbool flag =true;\n\tfor (int m=2;m<11;m++){\n\t\tflag =true;\n\t\tint mod_a=0,index=0;\n\t\tarray[15]={0};\n\t\twhile (1){\n\t\t\tmod_a=x%m;\n\t\t\tx = x/m;\n\t\t\tif (!x){\n\t\t\t\tarray[index]=mod_a;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tarray[index]=mod_a;\n\t\t\tindex++;\n\t\t}\t\t\n\t\tfor (int k=0;k<=(index/2);k++){\n\t\t\tif (array[k]!=array[index-k]){\n\t\t\t\tflag=false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (flag){\n\t\t\tsum++;\n\t\t}\n\t\tif (sum>=2){\n\t\t\tbreak;\n\t\t}\n\t}\n\tif (sum>=2){\n\t\treturn true;\n\t}\n\telse {\n\t\treturn false;\n\t}\n}",WRONG_ANSWER,1885,1320
1278224180317708288,ad8686712a9999dbe03ced4f0edcc6d1ec90b29a12065ac79e4414d28f7d7af6,2020-07-01 15:09:27,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"N = int(input())\nS = int(input())\ntimeN = 0\ntimeB = 0\n\nwhile(timeN<N):\n    S+=1\n    for b in range(2,11):\n        s = S\n        trans = []\n        while (s!=0):\n            y = s % b\n            s = s//b           \n            trans = trans + [y]\n        rever = trans[::-1]\n        if(rever == trans):\n            timeB += 1\n        if(timeB>=2):\n            timeN +=1\n            print(S)\n            break\n    timeB = 0",COMPILE_ERROR,0,0
1278224252984025088,53ae28e3dbe2f18670c3ebaf391c09f8e570189a6475fc91a2ef814fd1b9799c,2020-07-01 15:09:44,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"//double palindromic number\n#include <iostream>\nusing namespace std;\n\nint N,S,temp2=0;//Ê®½øÖÆÒÔÄÚ¶¼ÊÇÊý×Ö \nint array[15];//×î´óÖµÇø¼ä10000µÄ×îС½øÖÆÊýΪ10011100010000Ϊ14λ \nbool get_palin(int x);\n\nint main(){\n\tcin>>N>>S;\n\tbool temp=true;\n\tfor (int i=S+1;;i++){\n\t\ttemp = get_palin(i);\n\t\tif (temp){\n\t\t\tcout << i <<endl;\n\t\t\ttemp2++;\n\t\t}\n\t\tif (temp2==N){\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn 0;\n}\n\nbool get_palin(int x){\n\tint sum=0;\n\tbool flag =true;\n\tfor (int m=2;m<11;m++){\n\t\tflag =true;\n\t\tint mod_a=0,index=0,temp3=x;\n\t\tarray[15]={0};\n\t\twhile (1){\n\t\t\tmod_a=temp3%m;\n\t\t\ttemp3 = temp3/m;\n\t\t\tif (!x){\n\t\t\t\tarray[index]=mod_a;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tarray[index]=mod_a;\n\t\t\tindex++;\n\t\t}\t\t\n\t\tfor (int k=0;k<=(index/2);k++){\n\t\t\tif (array[k]!=array[index-k]){\n\t\t\t\tflag=false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (flag){\n\t\t\tsum++;\n\t\t}\n\t\tif (sum>=2){\n\t\t\tbreak;\n\t\t}\n\t}\n\tif (sum>=2){\n\t\treturn true;\n\t}\n\telse {\n\t\treturn false;\n\t}\n}",SEGMENTATION_FAULT,26,424
1278224292263682048,ad8686712a9999dbe03ced4f0edcc6d1ec90b29a12065ac79e4414d28f7d7af6,2020-07-01 15:09:54,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"n = int(input())\nS = int(input())\ntimeN = 0\ntimeB = 0\n\nwhile(timeN<n):\n    S+=1\n    for b in range(2,11):\n        s = S\n        trans = []\n        while (s!=0):\n            y = s % b\n            s = s//b           \n            trans = trans + [y]\n        rever = trans[::-1]\n        if(rever == trans):\n            timeB += 1\n        if(timeB>=2):\n            timeN +=1\n            print(S)\n            break\n    timeB = 0",COMPILE_ERROR,0,0
1278224400023748608,ad8686712a9999dbe03ced4f0edcc6d1ec90b29a12065ac79e4414d28f7d7af6,2020-07-01 15:10:19,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"N = 0\nN = int(input())\nS = int(input())\ntimeN = 0\ntimeB = 0\n\nwhile(timeN<N):\n    S+=1\n    for b in range(2,11):\n        s = S\n        trans = []\n        while (s!=0):\n            y = s % b\n            s = s//b           \n            trans = trans + [y]\n        rever = trans[::-1]\n        if(rever == trans):\n            timeB += 1\n        if(timeB>=2):\n            timeN +=1\n            print(S)\n            break\n    timeB = 0",COMPILE_ERROR,0,0
1278224413248389120,ad8686712a9999dbe03ced4f0edcc6d1ec90b29a12065ac79e4414d28f7d7af6,2020-07-01 15:10:23,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"N = 0\nN = int(input())\nS = int(input())\ntimeN = 0\ntimeB = 0\n\nwhile(timeN<N):\n    S+=1\n    for b in range(2,11):\n        s = S\n        trans = []\n        while (s!=0):\n            y = s % b\n            s = s//b           \n            trans = trans + [y]\n        rever = trans[::-1]\n        if(rever == trans):\n            timeB += 1\n        if(timeB>=2):\n            timeN +=1\n            print(S)\n            break\n    timeB = 0",COMPILE_ERROR,0,0
1278224451882123264,ad8686712a9999dbe03ced4f0edcc6d1ec90b29a12065ac79e4414d28f7d7af6,2020-07-01 15:10:32,Python,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"N = 0\nN = int(input())\nS = int(input())\ntimeN = 0\ntimeB = 0\n\nwhile(timeN<N):\n    S+=1\n    for b in range(2,11):\n        s = S\n        trans = []\n        while (s!=0):\n            y = s % b\n            s = s//b           \n            trans = trans + [y]\n        rever = trans[::-1]\n        if(rever == trans):\n            timeB += 1\n        if(timeB>=2):\n            timeN +=1\n            print(S)\n            break\n    timeB = 0",NON_ZERO_EXIT_CODE,153,2984
1278224570241187840,ad8686712a9999dbe03ced4f0edcc6d1ec90b29a12065ac79e4414d28f7d7af6,2020-07-01 15:11:00,Python,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"N = 0\nN = int(input())\nS = int(input())\ntimeN = 0\ntimeB = 0\n\nwhile(timeN<N):\n    S+=1\n    for b in range(2,11):\n        s = S\n        trans = []\n        while (s!=0):\n            y = s % b\n            s = s//b           \n            trans = trans + [y]\n        rever = trans[::-1]\n        if(rever == trans):\n            timeB += 1\n        if(timeB>=2):\n            timeN +=1\n            print(S)\n            break\n    timeB = 0\nexit(0)",NON_ZERO_EXIT_CODE,166,2984
1278224754987687936,53ae28e3dbe2f18670c3ebaf391c09f8e570189a6475fc91a2ef814fd1b9799c,2020-07-01 15:11:44,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"//double palindromic number\n#include <iostream>\nusing namespace std;\n\nint N,S,temp2=0;//Ê®½øÖÆÒÔÄÚ¶¼ÊÇÊý×Ö \nint array[15];//×î´óÖµÇø¼ä10000µÄ×îС½øÖÆÊýΪ10011100010000Ϊ14λ \nbool get_palin(int x);\n\nint main(){\n\tcin>>N>>S;\n\tbool temp=true;\n\tfor (int i=S+1;;i++){\n\t\ttemp = get_palin(i);\n\t\tif (temp){\n\t\t\tcout << i <<endl;\n\t\t\ttemp2++;\n\t\t}\n\t\tif (temp2==N){\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn 0;\n}\n\nbool get_palin(int x){\n\tint sum=0;\n\tbool flag =true;\n\tfor (int m=2;m<11;m++){\n\t\tflag =true;\n\t\tint mod_a=0,index=0,temp3=x;\n\t\tarray[15]={0};\n\t\twhile (1){\n\t\t\tmod_a=temp3%m;\n\t\t\ttemp3 = temp3/m;\n\t\t\tif (!temp3){\n\t\t\t\tarray[index]=mod_a;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tarray[index]=mod_a;\n\t\t\tindex++;\n\t\t}\t\t\n\t\tfor (int k=0;k<=(index/2);k++){\n\t\t\tif (array[k]!=array[index-k]){\n\t\t\t\tflag=false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (flag){\n\t\t\tsum++;\n\t\t}\n\t\tif (sum>=2){\n\t\t\tbreak;\n\t\t}\n\t}\n\tif (sum>=2){\n\t\treturn true;\n\t}\n\telse {\n\t\treturn false;\n\t}\n}",WRONG_ANSWER,495,512
1278225128750514176,ad8686712a9999dbe03ced4f0edcc6d1ec90b29a12065ac79e4414d28f7d7af6,2020-07-01 15:13:13,Python,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"N = int(input())\nS = int(input())\ntimeN = 0\ntimeB = 0\n\nwhile(timeN<N):\n    S+=1\n    for b in range(2,11):\n        s = S\n        trans = []\n        while (s!=0):\n            y = s % b\n            s = s//b           \n            trans = trans + [y]\n        rever = trans[::-1]\n        if(rever == trans):\n            timeB += 1\n        if(timeB>=2):\n            timeN +=1\n            print(S)\n            break\n    timeB = 0\n\n\n",NON_ZERO_EXIT_CODE,163,3168
1278225222900047872,ad8686712a9999dbe03ced4f0edcc6d1ec90b29a12065ac79e4414d28f7d7af6,2020-07-01 15:13:36,Python,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"N = int(input())\nS = int(input())\ntimeN = 0\ntimeB = 0\n\nwhile(timeN<N):\n    S+=1\n    for b in range(2,11):\n        s = S\n        trans = []\n        while (s!=0):\n            y = s % b\n            s = s//b           \n            trans = trans + [y]\n        rever = trans[::-1]\n        if(rever == trans):\n            timeB += 1\n        if(timeB>=2):\n            timeN +=1\n            print(S)\n            break\n    timeB = 0\nexit(0)\n\n",NON_ZERO_EXIT_CODE,133,2984
1278226337439875072,ad8686712a9999dbe03ced4f0edcc6d1ec90b29a12065ac79e4414d28f7d7af6,2020-07-01 15:18:01,Python,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <cmath>\n\nusing namespace std;\nlong int transB(int num, int b);\nlong int reverse(int number);\n\nint main() {\n\tint N{ 0 }, S{ 0 };\n\tcin >> N >> S;\n\tint timesN = 0;\n\tint timesB = 0;\n\tS += 1;\n\twhile (timesN < N)\n\t{\n\t\tfor (int i{ 2 };i <= 10;i++) {\n\t\t\tlong int tranB = transB(S, i);\n\t\t\tlong int reverB = reverse(tranB);\n\t\t\tif (tranB == reverB)\n\t\t\t\ttimesB += 1;\n\t\t\tif (timesB >= 2) {\n\t\t\t\tcout << S << endl;\n\t\t\t\ttimesN += 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\ttimesB = 0;\n\t\t++S;\n\n\t}\n}\n\nlong int transB(int num, int b) {\n\tvector<int> numList;\n\tdo {\n\t\tnumList.push_back(num % b);\n\t\tnum /= b;\n\t} while (num != 0);\n\tlong int number = 0;\n\tfor (int i{ 0 };i < numList.size();i++) {\n\t\tnumber += numList[i] * pow(10, i);\n\t}\n\treturn number;\n}\n\nlong int reverse(int number) {\n\tlong int rever{ 0 };\n\twhile (number > 0)\n\t{\n\t\trever = rever * 10 + number % 10;\n\t\tnumber = number / 10;\n\t}\n\treturn rever;\n}",NON_ZERO_EXIT_CODE,161,2972
1278226365357162496,ad8686712a9999dbe03ced4f0edcc6d1ec90b29a12065ac79e4414d28f7d7af6,2020-07-01 15:18:08,C++,50.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <cmath>\n\nusing namespace std;\nlong int transB(int num, int b);\nlong int reverse(int number);\n\nint main() {\n\tint N{ 0 }, S{ 0 };\n\tcin >> N >> S;\n\tint timesN = 0;\n\tint timesB = 0;\n\tS += 1;\n\twhile (timesN < N)\n\t{\n\t\tfor (int i{ 2 };i <= 10;i++) {\n\t\t\tlong int tranB = transB(S, i);\n\t\t\tlong int reverB = reverse(tranB);\n\t\t\tif (tranB == reverB)\n\t\t\t\ttimesB += 1;\n\t\t\tif (timesB >= 2) {\n\t\t\t\tcout << S << endl;\n\t\t\t\ttimesN += 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\ttimesB = 0;\n\t\t++S;\n\n\t}\n}\n\nlong int transB(int num, int b) {\n\tvector<int> numList;\n\tdo {\n\t\tnumList.push_back(num % b);\n\t\tnum /= b;\n\t} while (num != 0);\n\tlong int number = 0;\n\tfor (int i{ 0 };i < numList.size();i++) {\n\t\tnumber += numList[i] * pow(10, i);\n\t}\n\treturn number;\n}\n\nlong int reverse(int number) {\n\tlong int rever{ 0 };\n\twhile (number > 0)\n\t{\n\t\trever = rever * 10 + number % 10;\n\t\tnumber = number / 10;\n\t}\n\treturn rever;\n}",PARTIAL_ACCEPTED,57,412
1278226867323076608,0346a04f58bcfe7428451052e2cf0a024a3f4fe8818f15cc29e83479b663797b,2020-07-01 15:20:08,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<string>\n#include<algorithm>\nusing namespace std;\n\nbool isPlalin(int a, int scale){\n    string s;\n    int temp=a,iCount;\n    for(iCount=0;temp;iCount++){\n        if(temp%scale>=10){\n            s[iCount]=temp%scale+55;\n            temp=temp/scale;\n            continue;\n        }\n        s[iCount]=temp%scale+48;\n        temp=(temp/scale);\n    }\n\n\n    for(int i=iCount-1;i;i--){\n        if(s[i]!=s[iCount-i-1])\n            return false;\n    }\n    return true;\n}\n\nint main()\n{\n    int iNum,iArr[600],iCount=0;\n    cin >> iNum;\n    for(int i=0;i<300;i++)\n        if(isPlalin(i*i,iNum))\n        {iArr[iCount]=i;iCount++;iArr[iCount]=i*i;iCount++;}\n    for(int i=0;i<iCount;i++){\n        int temp=iArr[i],iout;\n        string b;\n        for(iout=0;temp;iout++){\n            if(temp%iNum>=10){\n                b[iout]=temp%iNum+55;\n                temp=temp/iNum;\n                continue;\n            }\n            b[iout]=temp%iNum+48;\n            temp=(temp/iNum);\n        }\n        for(int j=iout-1;j>=0;j--)\n            cout<<b[j];\n        if(i%2)cout<<endl;\n        else cout<<\"" \"";\n    }\n    return 0;\n}\n",ACCEPTED,41,512
1278230074493435904,afbe3dd44dd174a47bc8fc4e72e8b1c926d31aa15a5454a9bb85155d6b0804f5,2020-07-01 15:32:52,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint number[100];\n\nbool check(int a, int b)//a为要转换的数，b为要转换的进制\n{\n\tint m = 0, flag=1;\n\t//进制转换（取余法）\n\twhile (a != 0) {\n\t\tnumber[m] = a % b;\n\t\ta = a / b;\n\t\tm++;\n\t}\n\t//检验回文\n\tfor (int i = 0; i < m / 2 + 1; i++) {\n\t\tif (number[i] != number[m - i + 1]) { flag = 0; break; }\n\t}\n\treturn flag;\n}\n\n\nint main()\n{\n\tint i, j, k, m, n, r;\n\tint number_1[100];\n\tcin >> n;\n\tfor (i = 1; i <= 300; i++) {\n\t\tj = i * i;\n\t\tk = i;\n\t\tm = 0;\n\t\tr = 0;\n\t\tif (check(j, n)) {\n\t\t\twhile (k != 0) {\n\t\t\t\tnumber_1[m] = k % n;\n\t\t\t\tk = k / n;\n\t\t\t\tm++;\n\t\t\t}\n\t\t\tfor (int q = m - 1; q >= 0; q--) {\n\t\t\t\tif (number_1[q] >= 10) { cout << (char)(number_1[q] + 55); }\n\t\t\t\telse { cout << number_1[q]; }\n\t\t\t}\n\t\t\tcout << \"" \"";\n\t\t\twhile (j != 0) {\n\t\t\t\tnumber_1[r] = j % n;\n\t\t\t\tj = j / n;\n\t\t\t\tr++;\n\t\t\t}\n\t\t\tfor (int q = r - 1; q >= 0; q--) {\n\t\t\t\tif (number_1[q] >= 10) { cout << (char)(number_1[q] + 55); }\n\t\t\t\telse { cout << number_1[q]; }\n\t\t\t}\n\t\t}\n\t\tcout << endl;\n\t}\n\treturn 0;\n}",WRONG_ANSWER,45,512
1278230256182288384,53ae28e3dbe2f18670c3ebaf391c09f8e570189a6475fc91a2ef814fd1b9799c,2020-07-01 15:33:36,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"//double palindromic number\n#include <iostream>\nusing namespace std;\n\nint N,S,temp2=0;//¨º?????¨°??¨²??¨º?¨ºy¡Á?\nint array[15];//¡Á?¡ä¨®?¦Ì????10000¦Ì?¡Á?D?????¨ºy?a10011100010000?a14??\nbool get_palin(int x);\n\nint main(){\n    cin>>N>>S;\n    bool temp=true;\n    for (int i=S+1;;i++){\n        temp = get_palin(i);\n        if (temp){\n            cout << i <<endl;\n            temp2++;\n        }\n        if (temp2==N){\n            break;\n        }\n    }\n    return 0;\n}\n\nbool get_palin(int x){\n    int sum=0;\n    bool flag =true;\n    for (int m=2;m<11;m++){\n        flag =true;\n        int mod_a=0,index=0,temp3=x;\n        for (int y=0;y<15;y++){\n            array[y]=0;\n        }\n\n        while (1){\n            mod_a=temp3%m;\n            temp3 = temp3/m;\n            if (!temp3){\n                array[index]=mod_a;\n                break;\n            }\n            array[index]=mod_a;\n            index++;\n        }\n        for (int k=0;k<=(index/2);k++){\n            if (array[k]!=array[index-k]){\n                flag=false;\n                break;\n            }\n        }\n        if (flag){\n            sum++;\n        }\n        if (sum>=2){\n            break;\n        }\n    }\n    if (sum>=2){\n        return true;\n    }\n    else {\n        return false;\n    }\n}",ACCEPTED,35,508
1278230975639642112,9967d355e8ac7fdcfa174a2c7d2c402e8faa3b9970225fbfcd9cd1b16ad2beda,2020-07-01 15:36:27,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint B;\nbool f1(int a)\n{\n    int a[20]；\n    int i=0;\n    for(i=0;i<20;i++)\n    {\n        a[i]=a%B;\n        a=a/B;\n        if(a[i]>9)\n            a[i]=a[i]-10+'A';\n        if(a==0)\n            break;\n    }\n    \n    for(int j=0;j<=i;j++)\n        if(a[j]!=a[n-j-1])\n            return 0;\n    return 1;\n}//转化为B进制并判断\nint main()\n{\n    int B;\n    cin>>B;\n    \n    for(int j=2;j<=200;j++)\n    {\n        if(f1(j*j)==1&&f1(j)==1)\n            cout<<j<<\"" \""<<j*j<<endl;\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1278231452662038528,9967d355e8ac7fdcfa174a2c7d2c402e8faa3b9970225fbfcd9cd1b16ad2beda,2020-07-01 15:38:21,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint i=0;\nint arr[20];\nint B;\nbool f1(int a)\n{\n    for(i=0;i<20;i++)\n    {\n        arr[i]=a%B;\n        a=a/B;\n        if(arr[i]>9)\n            arr[i]=arr[i]-10+'A';\n        if(a==0)\n            break;\n    }\n    \n    for(int j=0;j<=i;j++)\n        if(arr[j]!=arr[i-j-1])\n            return 0;\n    return 1;\n}//转化为B进制并判断\nint main()\n{\n    int B;\n    cin>>B;\n    \n    for(int j=2;j<=200;j++)\n    {\n        if(f1(j*j)==1&&f1(j)==1)\n            cout<<j<<\"" \""<<j*j<<endl;\n    }\n    return 0;\n}",FLOAT_POINT_EXCEPTION,40,504
1278234073745514496,ab3ac7d3615ec928fcbb93f4072aaa583f19767afc2dc1d5e045648b0b245af1,2020-07-01 15:48:46,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint amount,num,t=0,chag_B[1001],len;\nbool ishuiwen();\nbool find_number(int x); \nint main() \n{\n\tcin>>amount>>num;\n\tfor(int i=num+1; t<amount; ++i) \n\t{\n\t\tif(find_number(i)) \n\t\t{\n\t\t\t++t;\n\t\t\tcout<<i<<endl;\n\t\t}\n\t}\n\treturn 0;\n}\nbool ishuiwen()                       //判断回文 \n{\n\tint head=1;\n\twhile(head<=len) \n\t{\n\t\tif(chag_B[head]!=chag_B[len]) \n\t\treturn false;\n\t\thead++;\n\t\tlen--;\n\t}\n\treturn true;\n}\nbool find_number(int x) \n{\n\tint record=0;\n\tfor(int B=2; B<=10;B++)                            //遍历进制 \n\t{\n\t\tlen=0;\n\t\tint x1=x;\n\t\twhile(x1!=0) \n\t\t{\n\t\t\tchag_B[++len]=x1%B;\n\t\t\tx1=x1/B;\n\t\t}\n\t\tif(ishuiwen()) \n\t\trecord++;\n\t\tif(record>=2) \n\t\treturn true;\n\t}\n\tif(record>=2)                     //记录回文的进制次数 \n\treturn true;\n\treturn false;\n}\n\n",ACCEPTED,33,512
1278234520690556928,9967d355e8ac7fdcfa174a2c7d2c402e8faa3b9970225fbfcd9cd1b16ad2beda,2020-07-01 15:50:32,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint i=0;\nint arr[20];\nint B;\nbool f1(int a)\n{\n    for(i=0;i<20;i++)\n    {\n        arr[i]=a%B;\n        a=a/B;\n        if(a==0)\n            break;\n    }\n    \n    for(int j=0;j<=i;j++)\n        if(arr[j]!=arr[i-j-1])\n            return 0;\n    return 1;\n}//转化为B进制并判断\nvoid print(int a)\n{\n    for(i=0;i<20;i++)\n    {\n        arr[i]=a%B;\n        a=a/B;\n        if(a==0)\n            break;\n    }\n    if(arr[i]>9)\n        cout<<arr[i]-10+'A';\n}\nint main()\n{\n    int B;\n    cin>>B;\n    \n    for(int j=2;j<=300;j++)\n    {\n        if(f1(j*j)==1&&f1(j)==1)\n        {\n            print(j);\n            cout<<\"" \"";\n            print(j*j);\n            cout<<endl;\n        }\n    }\n    return 0;\n}",FLOAT_POINT_EXCEPTION,41,488
1278235429940166656,57480949030af151ef53877a64aa8077b02f5a1624bde07439497c0c58bcc8bf,2020-07-01 15:54:09,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    int p=0;\n    for(int i=S+1;i<10000;i++){\n        int q=0;\n        for(int j=2;j<=9;j++){\n            string ans=\""\"";\n            int r=i;\n            do{\n                int x=r%j;\n                string xx=to_string(x);\n                ans+=xx;\n                r=r/j;\n            }while(r!=0);\n            string sna=ans;\n            reverse(ans.begin(),ans.end());\n            if(sna==ans){\n                q+=1;\n            }\n        }\n        if(q>=2){\n            p+=1;\n            cout<<i<<endl;\n        }\n        if(p>2){\n            break;\n        }\n    }\n\n    return 0;\n}\n",WRONG_ANSWER,38,508
1278235947743772672,57480949030af151ef53877a64aa8077b02f5a1624bde07439497c0c58bcc8bf,2020-07-01 15:56:13,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    int p=0;\n    for(int i=S+1;i<10000;i++){\n        int q=0;\n        for(int j=2;j<=9;j++){\n            string ans=\""\"";\n            int r=i;\n            do{\n                int x=r%j;\n                string xx=to_string(x);\n                ans+=xx;\n                r=r/j;\n            }while(r!=0);\n            string sna=ans;\n            reverse(ans.begin(),ans.end());\n            if(sna==ans){\n                q+=1;\n            }\n        }\n        if(q>=2){\n            p+=1;\n            cout<<i<<endl;\n        }\n        if(p>n-1){\n            break;\n        }\n    }\n\n    return 0;\n}\n",COMPILE_ERROR,0,0
1278236039569661952,57480949030af151ef53877a64aa8077b02f5a1624bde07439497c0c58bcc8bf,2020-07-01 15:56:34,C++,30.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    int p=0;\n    for(int i=S+1;i<10000;i++){\n        int q=0;\n        for(int j=2;j<=9;j++){\n            string ans=\""\"";\n            int r=i;\n            do{\n                int x=r%j;\n                string xx=to_string(x);\n                ans+=xx;\n                r=r/j;\n            }while(r!=0);\n            string sna=ans;\n            reverse(ans.begin(),ans.end());\n            if(sna==ans){\n                q+=1;\n            }\n        }\n        if(q>=2){\n            p+=1;\n            cout<<i<<endl;\n        }\n        if(p>N-1){\n            break;\n        }\n    }\n\n    return 0;\n}\n",PARTIAL_ACCEPTED,51,424
1278236134469984256,88732676b743960e66f48a24a8785dfbbedba30008ec9a259b0f4a920e0fff02,2020-07-01 15:56:57,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include<cmath>\n#include<vector>\n\nusing namespace std;\n\nstring trans(int i, int n)//进制转换  数与进制\n{\n\tvector<char> a;\n\tstring c = \""\"";\n\twhile (true)\n\t{\n\t\tif (i == 0)\n\t\t\tbreak;\n\t\tif (i >= n)\n\t\t{\n\t\t\tint b;\n\t\t\tb = i % n;\n\t\t\ta.push_back(static_cast<char>(b + 48));\n\t\t\ti /= n;\n\t\t}\n\t\telse\n\t\t{\n\t\t\ta.push_back(static_cast<char>(i + 48));\n\t\t\tbreak;\n\t\t}\n\n\t\t\n\t}\n\tfor (int i = 0;i < a.size();++i)\n\t{\n\t\tc += a[a.size() - 1 - i];\n\t}\n\treturn c;\n}\n\nint judge(string a) //判断是否是回文数\n{\n\tint l = a.length();\n\tint ll = l / 2;\n\tbool pd = 1;\n\tfor (int i = 0;i < ll;++i)\n\t{\n\t\tif (a[i] != a[l - i - 1])\n\t\t\tpd = 0;\n\t}\n\tif (pd == 1)\n\t\treturn 1;\n\telse\n\t\treturn 0;\n}\n\n\nint main()\n{\n\tint n,s,exit = 0;\n\tcin >> n>>s;\n\twhile (exit < n)\n\t{\n\t\ts += 1;\n\t\tint much = 0;\n\t\tfor (int i = 2;i <= 10;++i)\n\t\t{\n\t\t\tstring tr = \""\"";\n\t\t\ttr = trans(s, i);\n\t\t\tmuch += judge(tr);\n\t\t}\n\t\tif (much >= 2)\n\t\t{\n\t\t\texit += 1;\n\t\t\tcout << s << endl;\n\t\t}\n\t}\n}",ACCEPTED,51,512
1278236370504450048,afbe3dd44dd174a47bc8fc4e72e8b1c926d31aa15a5454a9bb85155d6b0804f5,2020-07-01 15:57:53,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint number[100], m;\n\nbool check(int a, int b)//a为要转换的数，b为要转换的进制\n{\n\tint  flag=1;\n\t//进制转换（取余法）\n\twhile (a != 0) {\n\t\tnumber[m] = a % b;\n\t\ta = a / b;\n\t\tm++;\n\t}\n\t//检验回文\n\tfor (int i = 0; i < m / 2 + 1; i++) {\n\t\tif (number[i] != number[m - i + 1]) { flag = 0; break; }\n\t}\n\treturn flag;\n}\n\n\nint main()\n{\n\tint i, j, k, a, b;\n\tcin >> b;\n\tfor (i = 1; i <= 300; i++) {\n\t\tj = i * i;\n\t\tm = 0;\n\t\tif (check(j, b)) {\n\n\t\t\tm = 0;\n\t\t\tcheck(i, b);\n\t\t\tfor (k = m - 1; k >= 0; k--) {\n\t\t\t\tif (number[k] >= 10) { cout << (char)(number[k] + 55); }\n\t\t\t\telse { cout << number[k]; }\n\t\t\t}\n\t\t\tcout << \"" \"";\n\n\t\t\tm = 0;\n\t\t\tcheck(j, b);\n\t\t\tfor (k = m - 1; k >= 0; k--) {\n\t\t\t\tif (number[k] >= 10) { cout << (char)(number[k] + 55); }\n\t\t\t\telse { cout << number[k]; }\n\t\t\t}\n\t\t\tcout << endl;\n\t    }\n\t}\n\treturn 0;\n}",WRONG_ANSWER,38,388
1278236425760210944,57480949030af151ef53877a64aa8077b02f5a1624bde07439497c0c58bcc8bf,2020-07-01 15:58:07,C++,40.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    int p=0;\n    for(int i=S+1;;i++){\n        int q=0;\n        for(int j=2;j<=9;j++){\n            string ans=\""\"";\n            int r=i;\n            do{\n                int x=r%j;\n                string xx=to_string(x);\n                ans+=xx;\n                r=r/j;\n            }while(r!=0);\n            string sna=ans;\n            reverse(ans.begin(),ans.end());\n            if(sna==ans){\n                q+=1;\n            }\n        }\n        if(q>=2){\n            p+=1;\n            cout<<i<<endl;\n        }\n        if(p>N-1){\n            break;\n        }\n    }\n\n    return 0;\n}\n",PARTIAL_ACCEPTED,76,500
1278237463284211712,57480949030af151ef53877a64aa8077b02f5a1624bde07439497c0c58bcc8bf,2020-07-01 16:02:14,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    int p=0;\n    for(int i=S+1;;i++){\n        int q=0;\n        for(int j=2;j<=10;j++){\n            string ans=\""\"";\n            int r=i;\n            do{\n                int x=r%j;\n                string xx=to_string(x);\n                ans+=xx;\n                r=r/j;\n            }while(r!=0);\n            string sna=ans;\n            reverse(ans.begin(),ans.end());\n            if(sna==ans){\n                q+=1;\n            }\n        }\n        if(q>=2){\n            p+=1;\n            cout<<i<<endl;\n        }\n        if(p>N-1){\n            break;\n        }\n    }\n\n    return 0;\n}\n",ACCEPTED,76,384
1278237744906567680,afbe3dd44dd174a47bc8fc4e72e8b1c926d31aa15a5454a9bb85155d6b0804f5,2020-07-01 16:03:21,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint number[100], m;\n\nbool check(int a, int b)//a为要转换的数，b为要转换的进制\n{\n\tint  flag=1;\n\t//进制转换（取余法）\n\twhile (a != 0) {\n\t\tnumber[++m] = a % b;\n\t\ta = a / b;\n\t}\n\t//检验回文\n\tfor (int i = 1; i < m / 2 + 1; i++) {\n\t\tif (number[i] != number[m - i + 1]) { flag = 0; break; }\n\t}\n\treturn flag;\n}\n\n\nint main()\n{\n\tint i, j, k, a, b;\n\tcin >> b;\n\tfor (i = 1; i <= 300; i++) {                                 //循环判断是否为回文平方数\n\t\tj = i * i;\n\t\tm = 0;\n\t\tif (check(j, b)) {\n\t\t\t//输出原数\n\t\t\tm = 0;\n\t\t\tcheck(i, b);\n\t\t\tfor (k = m ; k >= 1; k--) {\n\t\t\t\tif (number[k] >= 10) { cout << (char)(number[k] + 55); }//大于十进制有字母\n\t\t\t\telse { cout << number[k]; }\n\t\t\t}\n\t\t\tcout << \"" \"";\n\t\t\t//输出平方数\n\t\t\tm = 0;\n\t\t\tcheck(j, b);\n\t\t\tfor (k = m ; k >= 1; k--) {\n\t\t\t\tif (number[k] >= 10) { cout << (char)(number[k] + 55); }\n\t\t\t\telse { cout << number[k]; }\n\t\t\t}\n\t\t\tcout << endl;\n\t    }\n\t}\n\treturn 0;\n}\n",ACCEPTED,33,480
1278240045444554752,0346a04f58bcfe7428451052e2cf0a024a3f4fe8818f15cc29e83479b663797b,2020-07-01 16:12:30,C++,50.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<string>\n#include<algorithm>\nusing namespace std;\n\nbool isPlalin(int a, int scale){\n    string s;\n    int temp=a,iCount;\n    for(iCount=0;temp;iCount++){\n        s[iCount]=temp%scale+48;\n        temp=(temp/scale);\n    }\n    for(int i=iCount-1;i;i--){\n        if(s[i]!=s[iCount-i-1])\n            return false;\n    }\n    return true;\n}\n\nint main()\n{\n    int iNum,iFloor,iArr[100],iLoc=0;\n    cin >> iNum>>iFloor;\n    for(int i=iFloor;true;i++){\n        int count=0;\n        for(int j=2;j<11;j++){\n            if(isPlalin(i,j))\n            {count++;\n                if(count==2){\n                    iArr[iLoc]=i;\n                    iLoc++;\n                    break;\n                }\n            }\n        }\n        if(iLoc==iNum)\n            break;\n    }\n    for(int i=0;i<iLoc;i++)\n        cout<<iArr[i]<<endl;\n    return 0;\n}\n",PARTIAL_ACCEPTED,27,424
1278240627899162624,0346a04f58bcfe7428451052e2cf0a024a3f4fe8818f15cc29e83479b663797b,2020-07-01 16:14:48,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<string>\n#include<algorithm>\nusing namespace std;\n\nbool isPlalin(int a, int scale){\n    string s;\n    int temp=a,iCount;\n    for(iCount=0;temp;iCount++){\n        s[iCount]=temp%scale+48;\n        temp=(temp/scale);\n    }\n    for(int i=iCount-1;i;i--){\n        if(s[i]!=s[iCount-i-1])\n            return false;\n    }\n    return true;\n}\n\nint main()\n{\n    int iNum,iFloor,iArr[100],iLoc=0;\n    cin >> iNum>>iFloor;\n    for(int i=iFloor+1;true;i++){\n        int count=0;\n        for(int j=2;j<11;j++){\n            if(isPlalin(i,j))\n            {count++;\n                if(count==2){\n                    iArr[iLoc]=i;\n                    iLoc++;\n                    break;\n                }\n            }\n        }\n        if(iLoc==iNum)\n            break;\n    }\n    for(int i=0;i<iLoc;i++)\n        cout<<iArr[i]<<endl;\n    return 0;\n}\n",ACCEPTED,33,492
1278240761504530432,9967d355e8ac7fdcfa174a2c7d2c402e8faa3b9970225fbfcd9cd1b16ad2beda,2020-07-01 16:15:20,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint i=0;\nint arr[20];\nint B;\nbool f1(int a)\n{\n    for(i=0;i<20;i++)\n    {\n        arr[i]=a%B;\n        a=a/B;\n        if(a==0)\n            break;\n    }\n    \n    for(int j=0;j<=i;j++)\n        if(arr[j]!=arr[i-j-1])\n            return 0;\n    return 1;\n}//转化为B进制并判断\nvoid print(int a)\n{\n    for(i=0;i<20;i++)\n    {\n        arr[i]=a%B;\n        a=a/B;\n        if(a==0)\n            break;\n    }\n    if(arr[i]>9)\n        cout<<arr[i]-10+'A';\n}\nint main()\n{\n    cin>>B;\n    \n    for(int j=2;j<=300;j++)\n    {\n        if(f1(j*j)==1&&f1(j)==1)\n        {\n            print(j);\n            cout<<\"" \"";\n            print(j*j);\n            cout<<endl;\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,45,492
1278240765145178112,2acfe834a0c9a0a9add021cdef700b9de96f83dd0796370df2c97aa209388ee2,2020-07-01 16:15:21,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint n, s;\n\tcin >> n >> s;\n\tint a[20];\n\tfor(int l=s+1,tem=0;tem<n;l++)\n\t{ \n\t\tint number = 0;\n\t\tfor (int i = 2; i <= 10||number<2; i++)\n\t\t{\n\t\t\tfor (int k = 0; k < 20; k++)\n\t\t\t{\n\t\t\t\ta[k] = -1;\n\t\t\t}\n\t\t\tint j = 0, m = 0;\n\t\t\tfor (int t = l; t != 0; j++)\n\t\t\t{\n\t\t\t\ta[j] = t % i;\n\t\t\t\tt = t / i;\n\t\t\t}\n\t\t\tif (j == 1)\n\t\t\t{\n\t\t\t\tnumber++;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tfor (int w = 0; w < (j / 2); w++)\n\t\t\t\t{\n\t\t\t\t\tif (a[w] == a[j - w - 1])\n\t\t\t\t\t{\n\t\t\t\t\t\tm = 1;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tm = 0; break;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (m == 1)\n\t\t\t\t{\n\t\t\t\t\tnumber++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (number == 2)\n\t\t{\n\t\t\tcout << l << endl;\n\t\t\ttem++;\n\t\t}\n\t}\n\treturn 0;\n}",WRONG_ANSWER,35,384
1278240769742135296,5f71a9d5537f24730fd564649e838059c7274bb787bc8eac8c4cd5b14c9f623d,2020-07-01 16:15:22,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<string>\n#include<cmath>\n#include<map>\nusing namespace std;\nbool is_Prime(int n) {\n    float n_sqrt;\n    if (n == 2 || n == 3) return 1;\n    if (n % 6 != 1 && n % 6 != 5) return 0;\n    for (int i = 5; i <= pow(n,0.5); i += 6)\n    {\n        if (n % i == 0|| n % (i + 2) == 0)return 0;\n    }\n    return 1;\n}\nint main()\n{\n    long long a;\n    long long b;\n    cin >> a>>b;\n    for (long long i = a;i<=b; i++) {\n        if (is_Prime(i) == true) {\n            string x = to_string(i);\n            string y = x;\n            reverse(x.begin(), x.end());\n            if (x == y)cout << x << endl;\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,28,424
1278240840382611456,5f71a9d5537f24730fd564649e838059c7274bb787bc8eac8c4cd5b14c9f623d,2020-07-01 16:15:39,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<string>\n#include<cmath>\n#include<map>\nusing namespace std;\nbool is_Prime(int n) {\n    if (n == 2 || n == 3) return 1;\n    if (n % 6 != 1 && n % 6 != 5) return 0;\n    for (int i = 5; i <= pow(n,0.5); i += 6)\n    {\n        if (n % i == 0|| n % (i + 2) == 0)return 0;\n    }\n    return 1;\n}\nint main()\n{\n    long long a;\n    long long b;\n    cin >> a>>b;\n    for (long long i = a;i<=b; i++) {\n        if (is_Prime(i) == true) {\n            string x = to_string(i);\n            string y = x;\n            reverse(x.begin(), x.end());\n            if (x == y)cout << x << endl;\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,36,384
1278240954480254976,9967d355e8ac7fdcfa174a2c7d2c402e8faa3b9970225fbfcd9cd1b16ad2beda,2020-07-01 16:16:06,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint arr[20];\nint B;\nbool f1(int a)\n{\n    int i=0;\n    while(a)\n    {\n        arr[++i]=a%B;\n        a/=B;\n    }\n    for(int j=0;j<=i;j++)\n        if(arr[j]!=arr[i-j])\n            return 0;\n    return 1;\n}//转化为B进制并判断\nvoid print(int a)\n{\n    int j=0;\n    while(a)\n    {\n        arr[++j]=a%B;\n        a/=B;\n    }\n    for(int m=j;m>=0;m--)\n    {\n        if(arr[m]>9)\n            cout<<arr[m]-10+'A';\n        else\n        {\n            cout<<arr[m];\n        }\n    }\n    \n}\nint main()\n{\n    cin>>B;\n    for(int j=2;j<=300;j++)\n    {\n        if(f1(j*j))\n        {\n            print(j);\n            cout<<\"" \"";\n            print(j*j);\n            cout<<endl;\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,26,392
1278243294629265408,37a97b9ec663ba47c029ffd6d3be59fb34a346ea8c94d16145d6ebac1cb9bc32,2020-07-01 16:25:24,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nbool result(int z,int n)\n{\n\tbool bo=true;\n\tint x[20];\n\tint p=z;\n\tint a=0;\n\twhile(p!=0)\n\t{\n\t\ta=a+1;\t\n\t\tx[a]=p%n;\n\t\tp=p/n;\n\t}\n\tfor(int i=1;i<=a/2;i++)\n\t{\n\t\tif(x[i]!=x[a+1-i])\n\t\t\tbo = false;\n\t}\n\treturn bo;\n}\nint main()\n{\n\tint N,S;\n\tcin>>N>>S;\n\tint number1=0;\n\tint number2=0;\n\tfor(int m=S+1;m<10000;m++)\n\t{\n\t\tfor(int n=2;n<11;n++)\n\t\t{\n\t\t\tif(result(m,n))\n\t\t\t\tnumber1=number1+1;\n\t\t\tif(number1>=2)\n\t\t\t{\t\t\t\n\t\t\t\tcout<<m<<endl;\n\t\t\t\tnumber2=number2+1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(number2>=N)\n\t\t{\n\t\t\treturn 0;\n\t\t}\t\t\t\n\t}\n} \n",PARTIAL_ACCEPTED,35,460
1278243300866195456,2acfe834a0c9a0a9add021cdef700b9de96f83dd0796370df2c97aa209388ee2,2020-07-01 16:25:26,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint n, s;\n\tcin >> n >> s;\n\tint a[20];\n\tfor(int l=s+1,tem=0;tem<n;l++)\n\t{ \n\t\tint number = 0;\n\t\tfor (int i = 2; i <= 10&&number<2; i++)\n\t\t{\n\t\t\tfor (int k = 0; k < 20; k++)\n\t\t\t{\n\t\t\t\ta[k] = -1;\n\t\t\t}\n\t\t\tint j = 0, m = 0;\n\t\t\tfor (int t = l; t != 0; j++)\n\t\t\t{\n\t\t\t\ta[j] = t % i;\n\t\t\t\tt = t / i;\n\t\t\t}\n\t\t\tif (j == 1)\n\t\t\t{\n\t\t\t\tnumber++;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tfor (int w = 0; w < (j / 2); w++)\n\t\t\t\t{\n\t\t\t\t\tif (a[w] == a[j - w - 1])\n\t\t\t\t\t{\n\t\t\t\t\t\tm = 1;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tm = 0; break;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (m == 1)\n\t\t\t\t{\n\t\t\t\t\tnumber++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (number == 2)\n\t\t{\n\t\t\tcout << l << endl;\n\t\t\ttem++;\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,35,516
1278244167438753792,769a5633f3f76c88163c10ba96b281ae92c033baa24697a766f3d547fe850076,2020-07-01 16:28:52,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\n\nvector<int> change(int a, int b) {            //将十进制数a转换为b进制数\n\tint count{ 0 }, temp{ a };               //帮助运算结果\n\tvector<int> result;                                     //储存结果\n\tif (temp < b) {                        //当a不够进位的时候\n\t\tresult[count] = temp;\n\t}\n\telse {                                   //当a需要进位的时候\n\t\twhile (temp >= b) {\n\t\t\tint yushu = temp % b;                //取余并存入结果中\n\t\t\tresult[count] = yushu;\n\t\t\ttemp /= b;                       //更新\n\t\t\tcount++;\n\t\t\tif (temp < b) {             //存入最高位\n\t\t\t\tresult[count] = temp;\n\t\t\t}\n\t\t}\n\t}\n\treturn result;                 //此时转换后的数是倒叙排列\n}\n\nint main() {\n\tint B;\n\tcin >> B;       //十进制数\n\tfor (int i{ 1 }; i < 301; i++) {\n\t\tvector<int> number = change(i * i, B);\n\t\tint size = number.size();\n\t\tfor (int j{ 0 }; j < size / 2; j++) {\n\t\t\tif (number[j] != number[size - 1]) {       //碰到位置对称且不相同的数则结束本次\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (j == size / 2) {                    //输出平方为回文数的数字和回文数\n\t\t\t\tcout << i << \"" \"";\n\t\t\t\tfor (int k{ 0 }; k < size; k++) {\n\t\t\t\t\tcout << number[k];\n\t\t\t\t}\n\t\t\t\tcout << endl;\n\t\t\t}\n\t\t}\n\t}\n}",SEGMENTATION_FAULT,28,512
1278248174840373248,f870ee69ef7b87d41540e36b5449d5c00387b4b42e8fa6039702fc5f7d35a174,2020-07-01 16:44:48,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint a[20];\nvoid  out(int a[], int b)//输出\n{\n\tcout << b << \"" \"";\n\tint c;\n\tc = sizeof(a);\n\tfor (int i = 0; i <= c; i++)\n\t{\n\t\tcout << a[i];\n\t}\n}\n\nvoid S(int x,int B)//改变进制\n{\n\tfor (int l = 0; x!=0; l++)\n\t{\n\t\ta[l] = x % B;\n\t\tx = x / B;\n\t}\n\n}\n\nbool check(int a[]) {//审查回文\n\tint c;\n\tc = sizeof(a);\n\tfor (int i = 0; i <= c-1; i++)\n\t{\n\t\tif (a[i] != a[c - i - 1])\n\t\t\treturn false;\n\t\treturn true;\n\t}\n}\nint main() {\n\tint B;\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\tS(i,B);\n\t\tif (check(a)) {\n\t\t\tout(a, i);\n\t\t}\n\t\telse\n\t\t\tcontinue;\n\t}\n\treturn 0;\n}",WRONG_ANSWER,32,508
1278248890816462848,769a5633f3f76c88163c10ba96b281ae92c033baa24697a766f3d547fe850076,2020-07-01 16:47:38,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\n\nvector<int> change(int a, int b) {            //将十进制数a转换为b进制数\n\tint count{ 0 }, temp{ a };               //帮助运算结果\n\tvector<int> result;                                     //储存结果\n\tif (temp < b) {                        //当a不够进位的时候\n\t\tresult[count] = temp;\n\t}\n\telse {                                   //当a需要进位的时候\n\t\twhile (temp >= b) {\n\t\t\tint yushu = temp % b;                //取余并存入结果中\n\t\t\tresult[count] = yushu;\n\t\t\ttemp /= b;                       //更新\n\t\t\tcount++;\n\t\t\tif (temp < b) {             //存入最高位\n\t\t\t\tresult[count] = temp;\n\t\t\t}\n\t\t}\n\t}\n\treturn result;                 //此时转换后的数是倒叙排列\n}\n\nint main() {\n\tint B;\n\tcin >> B;       //十进制数\n\tfor (int i{ 1 }; i < 301; i++) {\n\t\tvector<int> number = change(i * i, B);\n\t\tint size = number.size();\n\t\tfor (int j{ 0 }; j < size / 2; j++) {\n\t\t\tif (number[j] != number[size - 1]) {       //碰到位置对称且不相同的数则结束本次\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (j == size / 2) {                    //输出平方为回文数的数字和回文数\n\t\t\t\tcout << i << \"" \"";\n\t\t\t\tfor (int k{ 0 }; k < size; k++) {\n\t\t\t\t\tif (number[k] < 10) {              //小于10输出数字\n\t\t\t\t\t\tcout << number[k];\n\t\t\t\t\t}\n\t\t\t\t\telse {                            //大于10输出大写字母\n\t\t\t\t\t\tchar c = number[k] + 55;\n\t\t\t\t\t\tcout << c;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tcout << endl;\n\t\t\t}\n\t\t}\n\t}\n}",SEGMENTATION_FAULT,40,384
1278249636798586880,8982f04dde07ce4ad3a2f17670cf29d21b7c6bf721b7ae32b7b1ca54fff9aca7,2020-07-01 16:50:36,Python,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"def f(n,x):\n    a=[0,1,2,3,4,5,6,7,8,9,'A','B','C','D','E','F','G','H','I','J']\n    b=[]\n    c=[]\n    while True:\n        s=n//x  \n        y=n%x  \n        b=b+[y]\n        if s==0:\n            break\n        n=s\n    b.reverse()\n    for i in b:\n        c.append(str(a[i]))\n    return c\n\n\nN,S=map(int,input().split())\nflag=0\narr=[]\nfor i in range(S,10000):\n\tfor j in range(2,11):\n\t\tc=f(i,j)\n\t\tdaoxu=c[::-1]\n\t\tc1=''.join(c)\n\t\tdaoxu1=''.join(daoxu)\n\t\tif (c1==daoxu1):\n\t\t\tflag=flag+1\n\t\tif (flag==2):\n\t\t\tflag=0\n\t\t\tarr.append(i)\n\t\t\tbreak\nfor i in range(0,N):\n\tprint(arr[i])",MULTIPLE_ERROR,32,3168
1278252142618402816,769a5633f3f76c88163c10ba96b281ae92c033baa24697a766f3d547fe850076,2020-07-01 17:00:34,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\n\nvector<int> change(int a, int b) {            //将十进制数a转换为b进制数\n\tint count{ 0 }, temp{ a };               //帮助运算结果\n\tvector<int> result;                                     //储存结果\n\tif (temp < b) {                        //当a不够进位的时候\n\t\tresult[count] = temp;\n\t}\n\telse {                                   //当a需要进位的时候\n\t\twhile (temp >= b) {\n\t\t\tint yushu = temp % b;                //取余并存入结果中\n\t\t\tresult[count] = yushu;\n\t\t\ttemp /= b;                       //更新\n\t\t\tcount++;\n\t\t\tif (temp < b) {             //存入最高位\n\t\t\t\tresult[count] = temp;\n\t\t\t}\n\t\t}\n\t}\n\treturn result;                 //此时转换后的数是倒叙排列\n}\n\nint main() {\n\tint B;\n\tcin >> B;       //十进制数\n\tfor (int i{ 1 }; i < 301; i++) {\n\t\tvector<int> number = change(i * i, B);\n\t\tint size = number.size();\n\t\tint half = size / 2;\n\t\tfor (int j{ 0 }; j < half ; j++) {\n\t\t\tif (number[j] != number[size-j-1]) {       //碰到位置对称且不相同的数则结束本次\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (j - half<3) {                    //输出平方为回文数的数字和回文数\n\t\t\t\tcout << i << \"" \"";\n\t\t\t\tfor (int k{ 0 }; k < half; k++) {\n\t\t\t\t\tif (number[k] < 10) {              //小于10输出数字\n\t\t\t\t\t\tcout << number[k];\n\t\t\t\t\t}\n\t\t\t\t\telse {                            //大于10输出大写字母\n\t\t\t\t\t\tchar c = number[k] + 55;\n\t\t\t\t\t\tcout << c;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tcout << endl;\n\t\t\t}\n\t\t}\n\t}\n}",SEGMENTATION_FAULT,44,496
1278252962130886656,8982f04dde07ce4ad3a2f17670cf29d21b7c6bf721b7ae32b7b1ca54fff9aca7,2020-07-01 17:03:49,Python,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"def f(n,x):\n    a=[0,1,2,3,4,5,6,7,8,9,'A','B','C','D','E','F','G','H','I','J']\n    b=[]\n    c=[]\n    while True:\n        s=n//x  \n        y=n%x  \n        b=b+[y]\n        if s==0:\n            break\n        n=s\n    b.reverse()\n    for i in b:\n        c.append(str(a[i]))\n    return c\n\n\nN,S=map(int,input().split())\nflag=0\nbiaoji=0\ni=S\nwhile True:\n\t\n\tfor j in range(2,11):\n\t\tc=f(i,j)\n\t\tdaoxu=c[::-1]\n\t\tc1=''.join(c)\n\t\tdaoxu1=''.join(daoxu)\n\t\tif (c1==daoxu1):\n\t\t\tflag=flag+1\n\t\tif (flag==2):\n\t\t\tflag=0\n\t\t\tprint(i)\n\t\t\tbiaoji=biaoji+1\n\t\t\tbreak\n\ti=i+1\n\tif (biaoji==N):\n\t\tbreak\n\t",PARTIAL_ACCEPTED,191,3112
1278253012185710592,769a5633f3f76c88163c10ba96b281ae92c033baa24697a766f3d547fe850076,2020-07-01 17:04:01,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\n\nvector<int> change(int a, int b) {            //将十进制数a转换为b进制数\n\tint count{ 0 }, temp{ a };               //帮助运算结果\n\tvector<int> result;                                     //储存结果\n\tif (temp < b) {                        //当a不够进位的时候\n\t\tresult[count] = temp;\n\t}\n\telse {                                   //当a需要进位的时候\n\t\twhile (temp >= b) {\n\t\t\tint yushu = temp % b;                //取余并存入结果中\n\t\t\tresult[count] = yushu;\n\t\t\ttemp /= b;                       //更新\n\t\t\tcount++;\n\t\t\tif (temp < b) {             //存入最高位\n\t\t\t\tresult[count] = temp;\n\t\t\t}\n\t\t}\n\t}\n\treturn result;                 //此时转换后的数是倒叙排列\n}\n\nint main() {\n\tint B;\n\tcin >> B;       //十进制数\n\tfor (int i{ 1 }; i < 301; i++) {\n\t\tvector<int> number = change(i * i, B);\n\t\tint size = number.size();\n\t\tint half = size / 2;\n\t\tfor (int j{ 0 }; j < half ; j++) {\n\t\t\tif (number[j] != number[size-j-1]) {       //碰到位置对称且不相同的数则结束\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif (j - half<3) {                    //输出平方为回文数的数字和回文数\n\t\t\t\tcout << i << \"" \"";\n\t\t\t\tfor (int k{ 0 }; k < half; k++) {\n\t\t\t\t\tif (number[k] < 10) {              //小于10输出数字\n\t\t\t\t\t\tcout << number[k];\n\t\t\t\t\t}\n\t\t\t\t\telse {                            //大于10输出大写字母\n\t\t\t\t\t\tchar c = number[k] + 55;\n\t\t\t\t\t\tcout << c;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tcout << endl;\n\t\t\t}\n\t\t}\n\t}\n}",SEGMENTATION_FAULT,32,424
1278253605994299392,37a97b9ec663ba47c029ffd6d3be59fb34a346ea8c94d16145d6ebac1cb9bc32,2020-07-01 17:06:23,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nbool result(int z,int n)\n{\n\tbool bo=true;\n\tint x[20]={0};\n\tint p=z;\n\tint a=0;\n\twhile(p!=0)\n\t{\n\t\ta=a+1;\t\n\t\tx[a]=p%n;\n\t\tp=p/n;\n\t}\n\tfor(int i=1;i<=a/2;i++)\n\t{\n\t\tif(x[i]!=x[a+1-i])\n\t\t\tbo = false;\n\t}\n\treturn bo;\n}\nint main()\n{\n\tint N,S;\n\tcin>>N>>S;\n\n\tint number2=0;\n\tfor(int m=S+1;m<20000;m++)\n\t{\n\t\tint number1=0;\n\t\tfor(int n=2;n<11;n++)\n\t\t{\n\t\t\tif(result(m,n))\n\t\t\t{\n\t\t\t\tnumber1=number1+1;\n\t\t\t}\n\t\t\tif(number1==2)\n\t\t\t\tbreak;\n\t\t\t\t\n\t\t\t\n\t\t}\n\t\tif(number1>=2)\n\t\t{\t\t\t\n\t\t\tcout<<m<<endl;\n\t\t\tnumber2=number2+1;\n\t\t\t\n\t\t}\n\t\tif(number2>=N)\n\t\t{\n\t\t\treturn 0;\n\t\t}\t\t\t\n\t}\n} \n",ACCEPTED,35,424
1278254391784570880,8982f04dde07ce4ad3a2f17670cf29d21b7c6bf721b7ae32b7b1ca54fff9aca7,2020-07-01 17:09:30,Python,20.0,1277062760129622024,1267449136707624960,1049226397448056832,"def f(n,x):\n    a=[0,1,2,3,4,5,6,7,8,9,'A','B','C','D','E','F','G','H','I','J']\n    b=[]\n    c=[]\n    while True:\n        s=n//x  \n        y=n%x  \n        b=b+[y]\n        if s==0:\n            break\n        n=s\n    b.reverse()\n    for i in b:\n        c.append(str(a[i]))\n    return c\n\n\nN,S=map(int,input().split())\nflag=0\nbiaoji=0\ni=S+1\nwhile True:\n\t\n\tfor j in range(2,11):\n\t\tc=f(i,j)\n\t\tdaoxu=c[::-1]\n\t\tc1=''.join(c)\n\t\tdaoxu1=''.join(daoxu)\n\t\tif (c1==daoxu1):\n\t\t\tflag=flag+1\n\t\tif (flag==2):\n\t\t\tflag=0\n\t\t\tprint(i)\n\t\t\tbiaoji=biaoji+1\n\t\t\tbreak\n\ti=i+1\n\tif (biaoji==N):\n\t\tbreak\n\t",PARTIAL_ACCEPTED,200,3112
1278255782489948160,e60091f5b104cde0cb3333edea48c227561b41599b77d2897b85447cd3d7cc0b,2020-07-01 17:15:02,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<cstdio>\n#include<cstring>\n#include<algorithm>\n#include<iostream>\n#define fori(a,b) for(int i=a;i<b;i++)\n#define mem(a,b) memset(a,b,sizeof(a))\n \nusing namespace std;\n \nlong long int B,z;\nchar a[1000001],b[1000001];\n \nvoid change1(int x)\n{\n    int m,k=0;\n    while(x)\n    {\n        m=x%B;\n        x/=B;\n        if(m>=10)\n            a[k++]=m+'A'-10;\n        else\n            a[k++]=m+'0';\n    }\n}\n \nvoid change2(int y)\n{\n    int n,c=0;\n    while(y)\n    {\n        n=y%B;\n        y/=B;\n        if(n>=10)\n            b[c++]=n+'A'-10;\n        else\n            b[c++]=n+'0';\n    }\n}\n \nint hw()\n{\n    int i,j,flag=0;\n    int l=strlen(b);\n    for(i=0,j=l-1; i<j; i++,j--)\n    {\n        if(b[i]!=b[j])\n        {\n            flag=1;\n            break;\n        }\n    }\n    if(!flag)\n        return 1;\n    else\n        return 0;\n}\n \nint main()\n{\n    scanf(\""%lld\"",&B);\n    mem(a,0);\n    mem(b,0);\n    fori(1,301)\n    {\n        z=i*i;\n        change1(i);\n        change2(z);\n        if(hw())\n        {\n            int len=strlen(a);\n            for(int ii=len-1;ii>=0;ii--)\n                printf(\""%c\"",a[ii]);\n            printf(\"" \"");\n            puts(b);\n        }\n    }\n    return 0;\n}",ACCEPTED,56,2376
1278255905584373760,b0b89d994646350cdb0faf36df067ca12b0d2116d53eb7ae1cb9e3d06407842e,2020-07-01 17:15:31,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint b;\ninline char c(int x) { if (x >= 0 && x <= 9)return x + '0'; return x - 10 + 'A'; }\nstruct NNOD\n{\n    int l, a[20];\n    NNOD(int x) { for (l = 0; x; l++)a[l] = x % b, x /= b; }\n    void outPut() { for (int i = l - 1; i >= 0; i--)printf(\""%c\"", c(a[i])); }\n    bool judge() { for (int i = 0; i < l; i++)if (a[i] != a[l - i - 1])return false; return true; }\n};\nint main()\n{\n    cin >> b;\n    for (int i = 1; i <= 300; i++)\n    {\n        NNOD n(i * i);\n        if (n.judge()) { NNOD m(i); m.outPut(); cout << \"" \""; n.outPut(); cout << endl; }\n    }\n    return 0;\n}",ACCEPTED,41,384
1278258210882904064,04f60b5c3ef78a44a8607be0b3de90c5d8eb85ed8fa4e788518a8a4419d91e3f,2020-07-01 17:24:41,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n\nint trans(int n,int b)\n{\n\tint k=0,i=0;\n\twhile(n!=0)\n\t{\n\t\tk+=n%b*pow(10,i);\n\t\tn/=b;\n\t\ti++;\n\t}\n\treturn k;\n}\nbool huiwen(int n,int b)\n{\n\tint i,m;\n\ti=n;\n\tm=0;\n\twhile(i)\n\t{\n\t\tm=m*b+i%b;\n\t\ti=i/b;\n\t}\n\treturn(m==n);\n}\n\nint main()\n{\n\tint n;\n\tcin>>n;\n\tint a[300],b[300],c[300];\n\tstring strs;\n\tfor(int i = 0;i<300;i++)\n\t{\n\t\ta[i]=i+1;\n\t\tb[i]=trans((i+1)*(i+1),n);\n\t\n\t}\n\t\n\tfor(int i=0;i<300;i++)\n\t{\n\t\tif(huiwen(b[i],n))\n\t\t{\n\t\t\tcout<<i+1<<\"" \""<<b[i]<<endl; \n\t\t}\n\t\telse\n\t\t\tcontinue;\n\t}\n\treturn 0;\n\t\n\t\n\t\n}",PARTIAL_ACCEPTED,40,540
1278259556352720896,5bae80805a109a5e85a950048adb216c805c2e50c75d29ec40caed1d78c69f96,2020-07-01 17:30:01,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace  std;\nconst int Y = 10;\nconst int Z = 20;\nint main()\n{\n\tint B;\n\tcin>>B;\n\tint a[Y],b[Y],k = 0,l = 0,now1,now2;\n\tfor(int  i = 1;i<301;i++)\n\t{\n\t\tint a[Y],b[Z],k = 0,l = 0,now1,now2,right = 0;\n\t\tnow1 = i;\n\t\tnow2 = i*i;\n\t\twhile(now1 != 0)\n\t\t{\n\t\t\ta[k] = now1 % B;\n\t\t\tk++;\n\t\t\tnow1 = now1 / B;\n\t\t}\n\t\twhile(now2 != 0)\n\t\t{\n\t\t\tb[l] = now2 % B;\n\t\t\tnow2 = now2 / B;\n\t\t\tl++;\n\t\t}\n\t\tfor (int j = 0;j<l/2;j++)\n\t\t{\n\t\t\tif(b[j] != b[l-j-1])\n\t\t\t    right--;\n\t\t\t\n\t\t}\n\t\tif(right == 0)\n\t\t{\n\t\t    for(int j = k-1;j >= 0;j--)\n\t\t\t    cout<<a[j];\n\t\t    cout<<\"" \"";\n\t\t    for(int j = l-1;j >= 0;j--)\n\t\t\t    cout<<b[j];\n\t\t    cout<<endl;\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,45,512
1278259686430670848,5bae80805a109a5e85a950048adb216c805c2e50c75d29ec40caed1d78c69f96,2020-07-01 17:30:32,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace  std;\nconst int Y = 50;\nconst int Z = 50;\nint main()\n{\n\tint B;\n\tcin>>B;\n\tint a[Y],b[Y],k = 0,l = 0,now1,now2;\n\tfor(int  i = 1;i<301;i++)\n\t{\n\t\tint a[Y],b[Z],k = 0,l = 0,now1,now2,right = 0;\n\t\tnow1 = i;\n\t\tnow2 = i*i;\n\t\twhile(now1 != 0)\n\t\t{\n\t\t\ta[k] = now1 % B;\n\t\t\tk++;\n\t\t\tnow1 = now1 / B;\n\t\t}\n\t\twhile(now2 != 0)\n\t\t{\n\t\t\tb[l] = now2 % B;\n\t\t\tnow2 = now2 / B;\n\t\t\tl++;\n\t\t}\n\t\tfor (int j = 0;j<l/2;j++)\n\t\t{\n\t\t\tif(b[j] != b[l-j-1])\n\t\t\t    right--;\n\t\t\t\n\t\t}\n\t\tif(right == 0)\n\t\t{\n\t\t    for(int j = k-1;j >= 0;j--)\n\t\t\t    cout<<a[j];\n\t\t    cout<<\"" \"";\n\t\t    for(int j = l-1;j >= 0;j--)\n\t\t\t    cout<<b[j];\n\t\t    cout<<endl;\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,39,512
1278260086907002880,8982f04dde07ce4ad3a2f17670cf29d21b7c6bf721b7ae32b7b1ca54fff9aca7,2020-07-01 17:32:08,Python,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"def f(n,x):\n    a=[0,1,2,3,4,5,6,7,8,9,'A','B','C','D','E','F','G','H','I','J']\n    b=[]\n    c=[]\n    while True:\n        s=n//x  \n        y=n%x  \n        b=b+[y]\n        if s==0:\n            break\n        n=s\n    b.reverse()\n    for i in b:\n        c.append(str(a[i]))\n    return c\n\n\nN,S=map(int,input().split())\nflag=0\nbiaoji=0\ni=S+1\nwhile True:\n\t\n\tfor j in range(2,11):\n\t\tc=f(i,j)\n\t\tdaoxu=c[::-1]\n\t\tc1=''.join(c)\n\t\tdaoxu1=''.join(daoxu)\n\t\tif (c1==daoxu1):\n\t\t\tfor m in range(j+1,11):\n\t\t\t\td=f(i,m)\n\t\t\t\tdaoxuD=d[::-1]\n\t\t\t\td1=''.join(d)\n\t\t\t\tdaoxuD1=''.join(daoxuD)\n\t\t\t\tif (d1==daoxuD1):\n\t\t\t\t\tprint(i)\n\t\t\t\t\ti=i+1\n\t\t\t\t\tbreak",TIME_LIMIT_EXCEEDED,0,0
1278260257363525632,d88d225f43d9cfbcbfaac4d153ebbce3b46be197d9270ee56c5be60033fcdfc9,2020-07-01 17:32:48,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cstdio>\n#include <cstdlib>\n#include <string.h>\nusing namespace std;\nint symm(char *m );\n\nint main()\n{\n    int n;\n    cin >> n; // base system which you want input\n    for(int i = 1 ; i <= 300 ; i ++)\n    {\n        char str[100];\n        char str1[100];\n        _itoa(i,str,n);\n        _itoa(i*i,str1,n);\n        if(symm(str1)== 1)\n        {\n            cout << str << \"" \"" << str1 << endl;\n        }\n        \n    }\n    return 0;\n}\n\nint symm(char *m)\n{\n    char n[100];\n    for(int i = 0; i < 100 ; i++)\n    {\n        n[i] = m[i];\n    }\n    strrev(m);\n    if(strcmp(n,m)==0)\n    {\n        return 1;\n    }\n    else\n    {\n        return 0;\n    }\n    \n}",COMPILE_ERROR,0,0
1278260989596729344,d88d225f43d9cfbcbfaac4d153ebbce3b46be197d9270ee56c5be60033fcdfc9,2020-07-01 17:35:43,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cstdio>\n#include <cstdlib>\n#include <string.h>\nusing namespace std;\nint symm(char *m );\n\nint main()\n{\n    int n;\n    cin >> n; // base system which you want input\n    for(int i = 1 ; i <= 300 ; i ++)\n    {\n        char str[100];\n        char str1[100];\n        _itoa(i,str,n);\n        _itoa(i*i,str1,n);\n        if(symm(str1)== 1)\n        {\n            cout << str << \"" \"" << str1 << endl;\n        }\n        \n    }\n    return 0;\n}\n\nint symm(char *m)\n{\n    char n[100];\n    for(int i = 0; i < 100 ; i++)\n    {\n        n[i] = m[i];\n    }\n    strrev(m);\n    if(strcmp(n,m)==0)\n    {\n        return 1;\n    }\n    else\n    {\n        return 0;\n    }\n    \n}",COMPILE_ERROR,0,0
1278261193263742976,bbc32b3ed49ab612815ed342e7a9a82917eefb8ef54f7578f63f18a6338adb40,2020-07-01 17:36:32,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\n#include <cmath>\nusing namespace std;\n\nstring change(int number, int radix);\nbool verify(string str);\n\nint main()\n{\n    int radix;\n    cin >> radix;\n\n    for (int i=1; i<=300; i++)\n    {\n        string aa = change(i*i,radix);\n        if (verify(aa))\n        {\n            cout << change(i,radix) << \"" \"" << change(i*i,radix) << endl;\n        }\n    }\n    return 0;\n}\n\nstring change(int number, int radix)\n{\n    string oput;\n\n    if (radix == 2)\n    {\n        while (number)\n        {\n            int n = number%2;\n            number /= 2;\n            oput += to_string(n);\n        }       \n    }\n    else\n    {\n        if (number >= radix && radix != 10)\n        {\n            do\n            {\n                int n = number%radix;\n                number = number/radix;\n                switch(n)\n                {\n                    case 10 : oput += 'A';\n                            break;\n                    case 11 : oput += 'B';\n                            break;\n                    case 12 : oput += 'C';\n                            break;\n                    case 13 : oput += 'D';\n                            break;\n                    case 14 : oput += 'E';\n                            break;\n                    case 15 : oput += 'F';\n                            break;\n                    case 16 : oput += 'G';\n                            break;\n                    case 17 : oput += 'H';\n                            break;\n                    case 18 : oput += 'I';\n                            break;\n                    case 19 : oput += 'J';\n                            break;\n                    case 20 : oput += 'K';\n                            break;\n                    default : oput += to_string(n);\n                            break;\n                }\n            }while (number != 0);\n            reverse(oput.begin(),oput.end());\n        }\n        else\n        {\n            if (radix != 10)\n            {\n                switch(number)\n                    {\n                        case 10 : oput += 'A';\n                                break;\n                        case 11 : oput += 'B';\n                                break;\n                        case 12 : oput += 'C';\n                                break;\n                        case 13 : oput += 'D';\n                                break;\n                        case 14 : oput += 'E';\n                                break;\n                        case 15 : oput += 'F';\n                                break;\n                        case 16 : oput += 'G';\n                                break;\n                        case 17 : oput += 'H';\n                                break;\n                        case 18 : oput += 'I';\n                                break;\n                        case 19 : oput += 'J';\n                                break;\n                        case 20 : oput += 'K';\n                                break;\n                        default : oput += to_string(number);\n                                break;\n                    }\n                reverse(oput.begin(),oput.end());\n            }\n            else\n            {\n                oput += to_string(number);\n            }\n        }\n    }\n\n    return oput;\n}\n\nbool verify(string str)\n{\n    string rstr = str;\n    reverse(rstr.begin(),rstr.end());\n    if (str == rstr)\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}",ACCEPTED,44,512
1278261515470168064,bbc32b3ed49ab612815ed342e7a9a82917eefb8ef54f7578f63f18a6338adb40,2020-07-01 17:37:48,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\n#include <cmath>\nusing namespace std;\n\nstring change(int number, int radix);\nbool verify(string str);\n\nint main()\n{\n    int N;\n    int S;\n    cin >> N >> S;\n    int total = 0;\n    int number = S+1;\n\n    while (total < N)\n    {\n        for (int i=2; i<=10; i++)\n        {\n            string aa = change(number,i);\n            if (i<10)\n            {\n                int j=i+1;\n                for (j; j<=10; j++)\n                {\n                    string bb = change(number,j);\n                    if (j<10)\n                    {\n                        int k = j+1;\n                        for (k; k<=10; k++)\n                        {\n                            string cc = change(number,k);\n                            if (verify(aa) && verify(bb) && verify(cc))\n                            {\n                                cout << number << endl;\n                                ++total;\n                                j = 11;\n                                i = 11;\n                                k = 11;\n                            }\n                        }\n                    }\n                }\n            }\n        }\n        ++number;\n    }\n    return 0;\n}\n\nstring change(int number, int radix)\n{\n    string oput;\n\n    if (radix == 2)\n    {\n        while (number)\n        {\n            int n = number%2;\n            number /= 2;\n            oput += to_string(n);\n        }\n        reverse(oput.begin(),oput.end());\n    }\n    else\n    {\n        if (number >= radix && radix != 10)\n        {\n            do\n            {\n                int n = number%radix;\n                number = number/radix;\n                oput += to_string(n);\n            }while (number != 0);\n            reverse(oput.begin(),oput.end());\n        }\n        else\n        {\n            oput += to_string(number);\n        }\n    }\n    return oput;\n}\n\nbool verify(string str)\n{\n    string rstr = str;\n    reverse(rstr.begin(),rstr.end());\n    if (str == rstr)\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}",PARTIAL_ACCEPTED,391,736
1278261648538656768,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-01 17:38:20,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint a[100000];\nint huiwen(int k)\n{\n    int i=0,count=0;\n    int b,t;\n    for(b=2;b<=10;b++){\n        while(k>0){\n            a[i++]=k%b;\n            k=k/b;\n        }\n        for(t=0;t<i-1;t++)\n        {\n            if(a[t]==a[i-t-1])\n                count=count+1;\n        }\n    }\n    return count;\n}\nint main()\n{\n    int n,num;\n    int sum=0;\n    cin>>n>>num;\n    while(sum<=3){\n        int w=num+1;\n        if(huiwen(w)>=2)\n        {\n            sum=sum+1;\n            cout<<w<<endl;\n        }\n        w=w+1;\n    }\n}",MULTIPLE_ERROR,25,492
1278262549630353408,bbc32b3ed49ab612815ed342e7a9a82917eefb8ef54f7578f63f18a6338adb40,2020-07-01 17:41:55,C++,40.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\n#include <cmath>\nusing namespace std;\n\nstring change(int number, int radix);\nbool verify(string str);\n\nint main()\n{\n    int N;\n    int S;\n    cin >> N >> S;\n    int total = 0;\n    int number = S+1;\n\n    while (total < N)\n    {\n        for (int i=2; i<=10; i++)\n        {\n            string aa = change(number,i);\n            if (i<10)\n            {\n                int j=i+1;\n                for (j; j<=10; j++)\n                {\n                    string bb = change(number,j);\n                    if (j<10)\n                    {\n                        if (verify(aa) && verify(bb))\n                        {\n                            cout << number << endl;\n                            ++total;\n                            j = 11;\n                            i = 11;\n                        }\n                    }\n                }\n            }\n        }\n        ++number;\n    }\n    return 0;\n}\n\nstring change(int number, int radix)\n{\n    string oput;\n\n    if (radix == 2)\n    {\n        while (number)\n        {\n            int n = number%2;\n            number /= 2;\n            oput += to_string(n);\n        }\n        reverse(oput.begin(),oput.end());\n    }\n    else\n    {\n        if (number >= radix && radix != 10)\n        {\n            do\n            {\n                int n = number%radix;\n                number = number/radix;\n                oput += to_string(n);\n            }while (number != 0);\n            reverse(oput.begin(),oput.end());\n        }\n        else\n        {\n            oput += to_string(number);\n        }\n    }\n    return oput;\n}\n\nbool verify(string str)\n{\n    string rstr = str;\n    reverse(rstr.begin(),rstr.end());\n    if (str == rstr)\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}",PARTIAL_ACCEPTED,187,424
1278262729146556416,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-01 17:42:38,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint a[100000];\nint huiwen(int k)\n{\n    int i=0,count=0;\n    int b,t;\n    for(b=2;b<=10;b++){\n        while(k>0){\n            a[i++]=k%b;\n            k=k/b;\n        }\n        for(t=0;t<i-1;t++)\n        {\n            if(a[t]==a[i-t-1])\n                count=count+1;\n        }\n    }\n    return count;\n}\nint main()\n{\n    int n,num;\n    int sum=0;\n    cin>>n>>num;\n    int w=num+1;\n    while(sum<=3){\n        if(huiwen(w)>=2)\n        {\n            sum=sum+1;\n            cout<<w<<endl;\n        }\n        w=w+1;\n    }\n}",WRONG_ANSWER,28,488
1278262952644247552,d88d225f43d9cfbcbfaac4d153ebbce3b46be197d9270ee56c5be60033fcdfc9,2020-07-01 17:43:31,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <stdio.h>\n#include <cstdlib>\n#include <string.h>\nusing namespace std;\nint symm(char *m );\nvoid _itoa(int i , char * str, int n);\nint main()\n{\n    int n;\n    cin >> n; // base system which you want input\n    for(int i = 1 ; i <= 300 ; i ++)\n    {\n        char str[100];\n        char str1[100];\n        _itoa(i,str,n);\n        _itoa(i*i,str1,n);\n        if(symm(str1)== 1)\n        {\n            cout << str << \"" \"" << str1 << endl;\n        }\n        \n    }\n    return 0;\n}\n\nint symm(char *m)\n{\n    char n[100];\n    for(int i = 0; i < 100 ; i++)\n    {\n        n[i] = m[i];\n    }\n    strrev(m);\n    if(strcmp(n,m)==0)\n    {\n        return 1;\n    }\n    else\n    {\n        return 0;\n    }\n    \n}",COMPILE_ERROR,0,0
1278263013193211904,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-01 17:43:45,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint a[100000];\nint huiwen(int k)\n{\n    int i=0,count=0;\n    int b,t;\n    for(b=2;b<=10;b++){\n        while(k>0){\n            a[i++]=k%b;\n            k=k/b;\n        }\n        for(t=0;t<i-1;t++)\n        {\n            if(a[t]==a[i-t-1])\n                count=count+1;\n        }\n    }\n    return count;\n}\nint main()\n{\n    int n,num;\n    int sum=0;\n    cin>>n>>num;\n    int w=num+1;\n    while(sum<3){\n        if(huiwen(w)>=2)\n        {\n            sum=sum+1;\n            cout<<w<<endl;\n        }\n        w=w+1;\n    }\n}",WRONG_ANSWER,31,508
1278263099621040128,d88d225f43d9cfbcbfaac4d153ebbce3b46be197d9270ee56c5be60033fcdfc9,2020-07-01 17:44:06,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <stdio.h>\n#include <cstdlib>\n#include <string.h>\nusing namespace std;\nint symm(char *m );\nvoid _itoa(int i , char * str, int n);\nvoid strrev(char *m);\nint main()\n{\n    int n;\n    cin >> n; // base system which you want input\n    for(int i = 1 ; i <= 300 ; i ++)\n    {\n        char str[100];\n        char str1[100];\n        _itoa(i,str,n);\n        _itoa(i*i,str1,n);\n        if(symm(str1)== 1)\n        {\n            cout << str << \"" \"" << str1 << endl;\n        }\n        \n    }\n    return 0;\n}\n\nint symm(char *m)\n{\n    char n[100];\n    for(int i = 0; i < 100 ; i++)\n    {\n        n[i] = m[i];\n    }\n    strrev(m);\n    if(strcmp(n,m)==0)\n    {\n        return 1;\n    }\n    else\n    {\n        return 0;\n    }\n    \n}",COMPILE_ERROR,0,0
1278263316642717696,d88d225f43d9cfbcbfaac4d153ebbce3b46be197d9270ee56c5be60033fcdfc9,2020-07-01 17:44:58,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <stdio.h>\n#include <cstdlib>\n#include <string.h>\nusing namespace std;\nint symm(char *m );\nint main()\n{\n    int n;\n    cin >> n; // base system which you want input\n    for(int i = 1 ; i <= 300 ; i ++)\n    {\n        char str[100];\n        char str1[100];\n        _itoa(i,str,n);\n        _itoa(i*i,str1,n);\n        if(symm(str1)== 1)\n        {\n            cout << str << \"" \"" << str1 << endl;\n        }\n        \n    }\n    return 0;\n}\n\nint symm(char *m)\n{\n    char n[100];\n    for(int i = 0; i < 100 ; i++)\n    {\n        n[i] = m[i];\n    }\n    strrev(m);\n    if(strcmp(n,m)==0)\n    {\n        return 1;\n    }\n    else\n    {\n        return 0;\n    }\n    \n}",COMPILE_ERROR,0,0
1278263726531084288,bbc32b3ed49ab612815ed342e7a9a82917eefb8ef54f7578f63f18a6338adb40,2020-07-01 17:46:36,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\n#include <cmath>\nusing namespace std;\n\nstring change(int number, int radix);\nbool verify(string str);\n\nint main()\n{\n    int N;\n    int S;\n    cin >> N >> S;\n    int total = 0;\n    int number = S+1;\n\n    while (total < N)\n    {\n        for (int i=2; i<=10; i++)\n        {\n            string aa = change(number,i);\n            int k = i;\n            if (k<10)\n            {\n                int j=i+1;\n                for (j; j<=10; j++)\n                {\n                    string bb = change(number,j);\n                    if (verify(aa) && verify(bb))\n                    {\n                        cout << number << endl;\n                        ++total;\n                        j = 11;\n                        k = 11;\n                    }\n                }\n            }\n        }\n        ++number;\n    }\n    return 0;\n}\n\nstring change(int number, int radix)\n{\n    string oput;\n\n    if (radix == 2)\n    {\n        while (number)\n        {\n            int n = number%2;\n            number /= 2;\n            oput += to_string(n);\n        }\n        reverse(oput.begin(),oput.end());\n    }\n    else\n    {\n        if (number >= radix && radix != 10)\n        {\n            do\n            {\n                int n = number%radix;\n                number = number/radix;\n                oput += to_string(n);\n            }while (number != 0);\n            reverse(oput.begin(),oput.end());\n        }\n        else\n        {\n            oput += to_string(number);\n        }\n    }\n    return oput;\n}\n\nbool verify(string str)\n{\n    string rstr = str;\n    reverse(rstr.begin(),rstr.end());\n    if (str == rstr)\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}",WRONG_ANSWER,173,492
1278264505232982016,bbc32b3ed49ab612815ed342e7a9a82917eefb8ef54f7578f63f18a6338adb40,2020-07-01 17:49:41,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\n#include <cmath>\nusing namespace std;\n\nstring change(int number, int radix);\nbool verify(string str);\n\nint main()\n{\n    int N;\n    int S;\n    cin >> N >> S;\n    int total = 0;\n    int number = S+1;\n\n    while (total < N)\n    {\n        for (int i=2; i<=10; i++)\n        {\n            string aa = change(number,i);\n            if (i<10 && verify(aa))\n            {\n                int j=i+1;\n                for (j; j<=10; j++)\n                {\n                    string bb = change(number,j);\n                    if (verify(bb))\n                    {\n                        cout << number << endl;\n                        ++total;\n                        j = 11;\n                        i = 11;\n                    }\n                }\n            }\n        }\n        ++number;\n    }\n    return 0;\n}\n\nstring change(int number, int radix)\n{\n    string oput;\n\n    if (radix == 2)\n    {\n        while (number)\n        {\n            int n = number%2;\n            number /= 2;\n            oput += to_string(n);\n        }\n        reverse(oput.begin(),oput.end());\n    }\n    else\n    {\n        if (number >= radix && radix != 10)\n        {\n            do\n            {\n                int n = number%radix;\n                number = number/radix;\n                oput += to_string(n);\n            }while (number != 0);\n            reverse(oput.begin(),oput.end());\n        }\n        else\n        {\n            oput += to_string(number);\n        }\n    }\n    return oput;\n}\n\nbool verify(string str)\n{\n    string rstr = str;\n    reverse(rstr.begin(),rstr.end());\n    if (str == rstr)\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}",ACCEPTED,79,384
1278264577899290624,5bae80805a109a5e85a950048adb216c805c2e50c75d29ec40caed1d78c69f96,2020-07-01 17:49:59,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace  std;\nconst int Y = 10;\nconst int Z = 20;\nint main()\n{\n\tint B;\n\tcin>>B;\n\tint a[Y],b[Y],k = 0,l = 0,now1,now2;\n\tfor(int  i = 1;i<301;i++)\n\t{\n\t\tint a[Y],b[Z],k = 0,l = 0,now1,now2,right = 0;\n\t\tnow1 = i;\n\t\tnow2 = i*i;\n\t\twhile(now1 != 0)\n\t\t{\n\t\t\ta[k] = now1 % B;\n\t\t\tk++;\n\t\t\tnow1 = now1 / B;\n\t\t}\n\t\twhile(now2 != 0)\n\t\t{\n\t\t\tb[l] = now2 % B;\n\t\t\tnow2 = now2 / B;\n\t\t\tl++;\n\t\t}\n\t\tfor (int j = 0;j<l/2;j++)\n\t\t{\n\t\t\tif(b[j] != b[l-j-1])\n\t\t\t    right--;\n\t\t\t\n\t\t}\n\t\tif(right == 0)\n\t\t{\n\t\t    for(int j = k-1;j >= 0;j--)\n\t\t\t    cout<<a[j];\n\t\t    cout<<\"" \"";\n\t\t    for(int j = l-1;j >= 0;j--)\n\t\t\t    if(b[j]<10)cout<<b[j];\n\t\t\t     else cout<<char(b[j]-10+'A');\n\t\t    cout<<endl;\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,33,488
1278264836566212608,df8eb7c63952010ae99b6ab42941a80142f46283ff94f584773fdf06dba6e26f,2020-07-01 17:51:00,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <string>\nusing namespace std;\n\nchar func1(int num) {                   //* 转换成ascii 码下的字符\n    if (num <= 9) {\n        return char(num + 48);\n    }\n    else {\n        return char(num + 55);\n    }\n}\n\nstring func2(int num, int n) {      //* 进制转换, 返回n进制下的字符串\n    string res = \""\"";\n    char temp;\n    do {\n        temp = func1(num % n);      //* 转换成相应进制下的字符\n        res = temp + res;\n        num /= n;\n    }\n    while (num != 0);\n\n    return res;\n}\n\nbool func3(string num) {            //* 判断字符串num是否为回文数\n    int temp = num.size();\n    for (int i = 0; i < temp; i++)\n        if (num[i] != num[temp-1 - i])\n            return false;\n    return true;\n}\n\nint main() {\n    int n;\n    cin >> n;\n    \n    int temp;\n    string res;\n    for (int i = 1; i < 300; i++) {\n        temp = i*i;\n        res = func2(temp, n);\n        if (func3(res))\n            cout << func2(i, n) << \"" \"" << res << \""\\n\"";\n    }\n    return 0;\n}",ACCEPTED,42,424
1278265745790656512,5bae80805a109a5e85a950048adb216c805c2e50c75d29ec40caed1d78c69f96,2020-07-01 17:54:37,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace  std;\nconst int Y = 10;\nconst int Z = 20;\nint main()\n{\n\tint B;\n\tcin>>B;\n\tint a[Y],b[Y],k = 0,l = 0,now1,now2;\n\tfor(int  i = 1;i<301;i++)\n\t{\n\t\tint a[Y],b[Z],k = 0,l = 0,now1,now2,right = 0;\n\t\tnow1 = i;\n\t\tnow2 = i*i;\n\t\twhile(now1 != 0)\n\t\t{\n\t\t\ta[k] = now1 % B;\n\t\t\tk++;\n\t\t\tnow1 = now1 / B;\n\t\t}\n\t\twhile(now2 != 0)\n\t\t{\n\t\t\tb[l] = now2 % B;\n\t\t\tnow2 = now2 / B;\n\t\t\tl++;\n\t\t}\n\t\tfor (int j = 0;j<l/2;j++)\n\t\t{\n\t\t\tif(b[j] != b[l-j-1])\n\t\t\t    right--;\n\t\t\t\n\t\t}\n\t\tif(right == 0)\n\t\t{\n\t\t    for(int j = k-1;j >= 0;j--)\n\t\t\t    if(a[j]<10)cout<<a[j];\n\t\t\t    else cout<<char(a[j] - 10+'A');\n\t\t    cout<<\"" \"";\n\t\t    for(int j = l-1;j >= 0;j--)\n\t\t\t    if(b[j]<10)cout<<b[j];\n\t\t\t     else cout<<char(b[j]-10+'A');\n\t\t    cout<<endl;\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,32,384
1278267303295115264,6f835599bf3a6c8ff0fc421d97258ed6c0eb7de523508a721d1a55bf4d845efb,2020-07-01 18:00:48,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nint B;\nint p[1000];\nint q[1000];\nbool panduan(int x)\n{\n    int y;\n    int a = 0;\n    y = x;\n    while (y>0)\n    {\n        a = a * B + y % B;\n        y/=B;\n    }\n    if (a == x)\n        return true;\n    else\n        return false;\n}\nint zhuanhuan1(int x)\n{\n    int num = 0;\n    while (x!= 0)\n    {\n        p[num++]= x % B;\n        x= x/ B;\n    }\n    return num;\n}\nint zhuanhuan2(int x)\n{\n    int num=0;\n    while (x !=0)\n    {\n        q[num++] = x%B;\n        x = x / B;\n    }\n    return num;\n}\n\nvoid p1(int x)\n{\n    for (int i =x-1; i >= 0; i--)\n    {\n        if (p[i] >= 10)\n            printf(\""%c\"", p[i] +55);\n        else\n            cout << p[i];\n    }\n}\nvoid p2(int y)\n{\n    for (int i = y -1; i >= 0; i--)\n    {\n        if (q[i] >=10)\n            printf(\""%c\"", q[i] +55);\n        else\n            cout << q[i];\n    }\n}\nint main()\n{\n    cin >> B;\n    for (int i =1; i <=300; i++)\n    {\n        int mul = i*i;\n        if (panduan(mul))\n        {\n            p1(zhuanhuan1(i));\n            cout << \"" \"";\n            p2(zhuanhuan2(mul));\n            cout << endl;\n        }\n    }\n    return 0;\n}",ACCEPTED,43,512
1278267760650412032,ad8686712a9999dbe03ced4f0edcc6d1ec90b29a12065ac79e4414d28f7d7af6,2020-07-01 18:02:37,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"def transB(number,b):\n    a=[0,1,2,3,4,5,6,7,8,9,'A','b','C','D','E','F','G','H','I','J']\n    tran=[]\n    while (number!=0):\n        y = number % b  \n        tran = tran+[y]\n        number = number//b  \n    tran.reverse()\n    return tran\n\nB = int(input())\nfor x in range(0,301):\n    squrB = tran(x*x,B)\n    rever = squrB[::-1]\n    if(squrB==rever):\n        tranB = tran(x,B)\n        for i in tranB:\n            print(tranB[i],end = \""\"")\n        print(\"" \"")\n        for i in squrB:\n            print(squrB[i],end = \""\"")\n\n\n",COMPILE_ERROR,0,0
1278267807475621888,ad8686712a9999dbe03ced4f0edcc6d1ec90b29a12065ac79e4414d28f7d7af6,2020-07-01 18:02:49,Python,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"def transB(number,b):\n    a=[0,1,2,3,4,5,6,7,8,9,'A','b','C','D','E','F','G','H','I','J']\n    tran=[]\n    while (number!=0):\n        y = number % b  \n        tran = tran+[y]\n        number = number//b  \n    tran.reverse()\n    return tran\n\nB = int(input())\nfor x in range(0,301):\n    squrB = tran(x*x,B)\n    rever = squrB[::-1]\n    if(squrB==rever):\n        tranB = tran(x,B)\n        for i in tranB:\n            print(tranB[i],end = \""\"")\n        print(\"" \"")\n        for i in squrB:\n            print(squrB[i],end = \""\"")\n\n\n",NON_ZERO_EXIT_CODE,179,3072
1278268218173489152,a7f5dfee6d4c0ac87e0bbca530e410573351f56b486596cdd38d754ebc8a6ece,2020-07-01 18:04:26,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<bits/stdc++.h>\n\nusing namespace std;\nint N,S;\nint m,n;\n\nstring judge(int i,int jinzhi)\n{\n    char lis[]={'A','B','C','D','E','F','G','H','J','K'};\n    string num=\"" \"";\n    while(i>0)\n    {\n        int s=i%jinzhi;\n        if(s>=10)\n        {\n            num=num+lis[s-10];\n            i=i/jinzhi;\n        }\n        else\n        {\n            num=num+'0';\n            i=i/jinzhi;\n        }\n    }\n    reverse(num.begin(),num.end());\n    return num;\n}\nint main()\n{\n    cin>>N>>S;\n    for(int i=S+1;m<N;i++)\n    {\n        n=0;\n        judge(i,10);\n        for(int j=2;j<10;j++)\n            judge(i,j);\n        if(n>1){\n            cout<<i<<endl;\n            m++;\n        }\n    }\n    return 0;\n}",TIME_LIMIT_EXCEEDED,0,0
1278268370229583872,ad8686712a9999dbe03ced4f0edcc6d1ec90b29a12065ac79e4414d28f7d7af6,2020-07-01 18:05:03,Python,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"def transB(number,b):\n    a=[0,1,2,3,4,5,6,7,8,9,'A','b','C','D','E','F','G','H','I','J']\n    tran=[]\n    while (number!=0):\n        y = number % b  \n        tran = tran+[y]\n        number = number//b  \n    tran.reverse()\n    return tran\n\nB = int(input())\nfor x in range(0,301):\n    squrB = transB(x*x,B)\n    rever = squrB[::-1]\n    if(squrB==rever):\n        tranB = transB(x,B)\n        for i in tranB:\n            print(tranB[i],end = \""\"")\n        print(\"" \"")\n        for i in squrB:\n            print(squrB[i],end = \""\"")\n\n\n",NON_ZERO_EXIT_CODE,196,3056
1278268380908281856,df8eb7c63952010ae99b6ab42941a80142f46283ff94f584773fdf06dba6e26f,2020-07-01 18:05:05,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <string>\nusing namespace std;\n\n// char func1(int num) {                   //* 转换成ascii 码下的字符\n//     if (num <= 9) {\n//         return char(num + 48);\n//     }\n//     else {\n//         return char(num + 55);\n//     }\n// }\n\nstring func2(int num, int n) {      //* 进制转换, 返回n进制下的字符串\n    string res = \""\"";\n    char temp;\n    do {\n        temp = num % n;      //* 转换成相应进制下的字符\n        res = temp + res;\n        num /= n;\n    }\n    while (num != 0);\n\n    return res;\n}\n\nbool func3(string num) {                     //* 判断字符串num是否为回文数\n    int temp = num.size();\n    for (int i = 0; i < temp; i++)\n        if (num[i] != num[temp-1 - i])\n            return false;\n    return true;\n}\n\nint main() {\n    int n, s;                                //* 前 N 个满足大于 S 且在两种以上进制（二进制至十进制）上是回文数的十进制数\n    cin >> n >> s;\n\n    int num = 0;                             //* 已经有多少满足为在某种进制下为回文数\n    int res = s + 1;                         //* 从res开始看是否满足\n    while (num != n) {\n        int temp = 0;                        //* 目前res 满足了temp 个进制\n        for (int i = 2; i <= 10; i++) {      //* 从二进制到十进制\n            string res2 = func2(res, i);    \n            if (func3(res2)) {\n                temp++;\n                if (temp == 2) {\n                    cout << res << endl;\n                    num++;\n                    break;\n                }\n            }\n            \n        }\n        res++;\n    }\n    return 0;\n}",ACCEPTED,46,512
1278268597971910656,a7f5dfee6d4c0ac87e0bbca530e410573351f56b486596cdd38d754ebc8a6ece,2020-07-01 18:05:57,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<bits/stdc++.h>\n\nusing namespace std;\nint N,S;\nint m,n;\n\nvoid judge(int x,int y)\n{\n    int a[100001],s=0;\n    while(x){\n        a[++s]=x%y;\n        x=x/y;\n    }\n    if(a[1]==0||a[s]==0) return;\n    for(int i=1;i<=s;i++)\n      if(a[i]!=a[s-i+1]) return;\n    n++;\n    return;\n}\nint main()\n{\n    cin>>N>>S;\n    for(int i=S+1;m<N;i++)\n    {\n        n=0;\n        judge(i,10);\n        for(int j=2;j<10;j++)\n            judge(i,j);\n        if(n>1){\n            cout<<i<<endl;\n            m++;\n        }\n    }\n    return 0;\n}",ACCEPTED,41,424
1278268886032515072,ad8686712a9999dbe03ced4f0edcc6d1ec90b29a12065ac79e4414d28f7d7af6,2020-07-01 18:07:06,Python,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"def transB(number,b):\n    tran=[]\n    while (number!=0):\n        y = number % b  \n        tran = tran+[y]\n        number = number//b  \n    tran.reverse()\n    return tran\n\na=[0,1,2,3,4,5,6,7,8,9,'A','b','C','D','E','F','G','H','I','J']\nB = int(input())\nfor x in range(0,301):\n    squrB = transB(x*x,B)\n    rever = squrB[::-1]\n    if(squrB==rever):\n        tranB = transB(x,B)\n        for i in tranB:\n            print(a[i],end = \""\"")\n        print(\"" \"")\n        for i in squrB:\n            print(a[i],end = \""\"")\n\n\n",MULTIPLE_ERROR,184,3072
1278270037247320064,ad8686712a9999dbe03ced4f0edcc6d1ec90b29a12065ac79e4414d28f7d7af6,2020-07-01 18:11:40,Python,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"def transB(number,b):\n    tran=[]\n    while (number!=0):\n        y = number % b  \n        tran = tran+[y]\n        number = number//b  \n    tran.reverse()\n    return tran\n\na=[0,1,2,3,4,5,6,7,8,9,'A','b','C','D','E','F','G','H','I','J']\nB = int(input())\nfor x in range(0,301):\n    squrB = transB(x*x,B)\n    rever = squrB[::-1]\n    if(squrB==rever):\n        tranB = transB(x,B)\n        for i in tranB:\n            print(a[i],end = \""\"")\n        print(\"" \"")\n        for i in squrB:\n            print(a[i],end = \""\"")\n        print(\""\\n\"")\n\n\n",MULTIPLE_ERROR,188,3072
1278271512816050176,ad8686712a9999dbe03ced4f0edcc6d1ec90b29a12065ac79e4414d28f7d7af6,2020-07-01 18:17:32,Python,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"def transB(number,b):\n    tran=[]\n    while (number!=0):\n        y = number % b  \n        tran = tran+[y]\n        number = number//b  \n    tran.reverse()\n    return tran\n\na=[0,1,2,3,4,5,6,7,8,9,'A','b','C','D','E','F','G','H','I','J']\nB = int(input())\nfor x in range(0,301):\n    squrB = transB(x*x,B)\n    rever = squrB[::-1]\n    if(squrB==rever):\n        tranB = transB(x,B)\n        for i in tranB:\n            print(a[i],end = \""\"")\n        print(\"" \"")\n        for i in squrB:\n            print(a[i],end = \""\"")\n        print()\n\n\n",MULTIPLE_ERROR,178,3072
1278272282043023360,ad8686712a9999dbe03ced4f0edcc6d1ec90b29a12065ac79e4414d28f7d7af6,2020-07-01 18:20:35,Python,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"def transB(number,b):\n    tran=[]\n    while (number!=0):\n        y = number % b  \n        tran = tran+[y]\n        number = number//b  \n    tran.reverse()\n    return tran\n\na=[0,1,2,3,4,5,6,7,8,9,'A','b','C','D','E','F','G','H','I','J']\nB = int(input())\nfor x in range(0,301):\n    squrB = transB(x*x,B)\n    rever = squrB[::-1]\n    if(squrB==rever):\n        tranB = transB(x,B)\n        for i in tranB:\n            print(a[i],end = \""\"")\n        print(\"" \"")\n        for i in squrB:\n            print(a[i],end = \""\"")\n        print()\n\n\n",MULTIPLE_ERROR,179,3088
1278273503722143744,8982f04dde07ce4ad3a2f17670cf29d21b7c6bf721b7ae32b7b1ca54fff9aca7,2020-07-01 18:25:27,Python,60.0,1277062760129622024,1267449136707624960,1049226397448056832,"def f(n,x):\n    a=[0,1,2,3,4,5,6,7,8,9,'A','B','C','D','E','F','G','H','I','J']\n    b=[]\n    c=[]\n    while True:\n        s=n//x  \n        y=n%x  \n        b=b+[y]\n        if s==0:\n            break\n        n=s\n    b.reverse()\n    for i in b:\n        c.append(str(a[i]))\n    return c\n\ndef countx(listx,a):\n\ticount=0\n\tfor i in listx:\n\t\tif (a==i):\n\t\t\ticount=icount+1\n\treturn icount\n\na=[]\nN,S=map(int,input().split())\nif (S<=500):\n\tfor i in range(S+1,501):\n\t\tfor j in range(2,11):\n\t\t\tc=f(i,j)\n\t\t\tdaoxu=c[::-1]\n\t\t\tc1=''.join(c)\n\t\t\tdaoxu1=''.join(daoxu)\n\t\t\tif (c1==daoxu1):\n\t\t\t\ta.append(i)\nif (500<S<5000):\n\tfor i in range(S+1,10000):\n\t\tfor j in range(2,11):\n\t\t\tc=f(i,j)\n\t\t\tdaoxu=c[::-1]\n\t\t\tc1=''.join(c)\n\t\t\tdaoxu1=''.join(daoxu)\n\t\t\tif (c1==daoxu1):\n\t\t\t\ta.append(i)\nif (5000<=S<10000):\n\tfor i in range(S+1,12356):\n\t\tfor j in range(2,11):\n\t\t\tc=f(i,j)\n\t\t\tdaoxu=c[::-1]\n\t\t\tc1=''.join(c)\n\t\t\tdaoxu1=''.join(daoxu)\n\t\t\tif (c1==daoxu1):\n\t\t\t\ta.append(i)\t\nb=[]\nfor i in range(0,len(a)):\n\ticountx=countx(a,a[i])\n\tif (icountx!=1):\n\t\tb.append(a[i])\nb=list(set(b))\nb.sort()\nfor j in range(0,N):\n\tprint(b[j])\t\t",PARTIAL_ACCEPTED,571,3228
1278274305220075520,ad8686712a9999dbe03ced4f0edcc6d1ec90b29a12065ac79e4414d28f7d7af6,2020-07-01 18:28:38,Python,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"def transB(number,b):\n    tran=[]\n    while (number!=0):\n        y = number % b  \n        tran = tran+[y]\n        number = number//b  \n    tran.reverse()\n    return tran\n\na=[0,1,2,3,4,5,6,7,8,9,'A','b','C','D','E','F','G','H','I','J']\nB = int(input())\nfor x in range(1,301):\n    squrB = transB(x*x,B)\n    rever = squrB[::-1]\n    if(squrB==rever):\n        tranB = transB(x,B)\n        for i in tranB:\n            print(a[i],end = \""\"")\n        print(\"" \"")\n        for i in squrB:\n            print(a[i],end = \""\"")\n        print()\n\n\n",MULTIPLE_ERROR,190,2984
1278274516738826240,ad8686712a9999dbe03ced4f0edcc6d1ec90b29a12065ac79e4414d28f7d7af6,2020-07-01 18:29:28,Python,60.0,1277062760129622023,1267442030214471680,1049226397448056832,"def transB(number,b):\n    tran=[]\n    while (number!=0):\n        y = number % b  \n        tran = tran+[y]\n        number = number//b  \n    tran.reverse()\n    return tran\n\na=[0,1,2,3,4,5,6,7,8,9,'A','b','C','D','E','F','G','H','I','J']\nB = int(input())\nfor x in range(1,301):\n    squrB = transB(x*x,B)\n    rever = squrB[::-1]\n    if(squrB==rever):\n        tranB = transB(x,B)\n        for i in tranB:\n            print(a[i],end = '')\n        print(\"" \"",end= '')\n        for i in squrB:\n            print(a[i],end = '')\n        print()\n\n\n",PARTIAL_ACCEPTED,177,3164
1278274593406517248,8982f04dde07ce4ad3a2f17670cf29d21b7c6bf721b7ae32b7b1ca54fff9aca7,2020-07-01 18:29:46,Python,50.0,1277062760129622024,1267449136707624960,1049226397448056832,"def f(n,x):\n    a=[0,1,2,3,4,5,6,7,8,9,'A','B','C','D','E','F','G','H','I','J']\n    b=[]\n    c=[]\n    while True:\n        s=n//x  \n        y=n%x  \n        b=b+[y]\n        if s==0:\n            break\n        n=s\n    b.reverse()\n    for i in b:\n        c.append(str(a[i]))\n    return c\n\ndef countx(listx,a):\n\ticount=0\n\tfor i in listx:\n\t\tif (a==i):\n\t\t\ticount=icount+1\n\treturn icount\n\na=[]\nN,S=map(int,input().split())\nif (S<=500):\n\tfor i in range(S+1,525):\n\t\tfor j in range(2,11):\n\t\t\tc=f(i,j)\n\t\t\tdaoxu=c[::-1]\n\t\t\tc1=''.join(c)\n\t\t\tdaoxu1=''.join(daoxu)\n\t\t\tif (c1==daoxu1):\n\t\t\t\ta.append(i)\nif (500<S<5000):\n\tfor i in range(S+1,10000):\n\t\tfor j in range(2,11):\n\t\t\tc=f(i,j)\n\t\t\tdaoxu=c[::-1]\n\t\t\tc1=''.join(c)\n\t\t\tdaoxu1=''.join(daoxu)\n\t\t\tif (c1==daoxu1):\n\t\t\t\ta.append(i)\nif (5000<=S<10000):\n\tfor i in range(S+1,12356):\n\t\tfor j in range(2,11):\n\t\t\tc=f(i,j)\n\t\t\tdaoxu=c[::-1]\n\t\t\tc1=''.join(c)\n\t\t\tdaoxu1=''.join(daoxu)\n\t\t\tif (c1==daoxu1):\n\t\t\t\ta.append(i)\t\nb=[]\nfor i in range(0,len(a)):\n\ticountx=countx(a,a[i])\n\tif (icountx!=1):\n\t\tb.append(a[i])\nb=list(set(b))\nb.sort()\nfor j in range(0,N):\n\tprint(b[j])\t\t",PARTIAL_ACCEPTED,407,3320
1278275002200162304,ad8686712a9999dbe03ced4f0edcc6d1ec90b29a12065ac79e4414d28f7d7af6,2020-07-01 18:31:24,Python,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"def transB(number,b):\n    tran=[]\n    while (number!=0):\n        y = number % b  \n        tran = tran+[y]\n        number = number//b  \n    tran.reverse()\n    return tran\n\na=[0,1,2,3,4,5,6,7,8,9,'A','B','C','D','E','F','G','H','I','J']\nB = int(input())\nfor x in range(1,301):\n    squrB = transB(x*x,B)\n    rever = squrB[::-1]\n    if(squrB==rever):\n        tranB = transB(x,B)\n        for i in tranB:\n            print(a[i],end = '')\n        print(\"" \"",end= '')\n        for i in squrB:\n            print(a[i],end = '')\n        print()\n\n\n",ACCEPTED,190,3112
1278275052020105216,40e897818d5386ba9e529984326264e964404c624b7eb28f67ebb37eab419911,2020-07-01 18:31:36,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <fstream>\n#include <cstring>\n#include <vector>\nusing namespace std;\n\n\nchar a[21] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J','K' };\nint B;\nbool judgement(string s)\n{\n    int m = s.length() - 1;\n    for (int i = 0; i < (m + 1) / 2; i++)\n    {\n        if (s[i] != s[m - i])\n        { \n            return false; \n        }\n    }\n    return true;\n}\nint main()\n{\n    cin >> B;\n    string s1;\n    string s2;\n    int k;\n    for (int i = 1; i <= 300; i++)\n    {\n        k = i; \n        s1 = \""\"";\n        while (k)\n        {\n            s1 = s1 + a[k % B];\n            k = k / B;\n        }\n        k = i * i; \n        s2 = \""\"";\n        while (k)\n        {\n            s2 = s2 + a[k % B];\n            k = k / B;\n        }\n        if (judgement(s2))\n        {\n            for (int j = s1.length(); j >= 0; j--)\n                cout << s1[j];\n            cout << \"" \"" << s2 << endl;\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,39,384
1278275246681939968,8982f04dde07ce4ad3a2f17670cf29d21b7c6bf721b7ae32b7b1ca54fff9aca7,2020-07-01 18:32:22,Python,60.0,1277062760129622024,1267449136707624960,1049226397448056832,"def f(n,x):\n    a=[0,1,2,3,4,5,6,7,8,9,'A','B','C','D','E','F','G','H','I','J']\n    b=[]\n    c=[]\n    while True:\n        s=n//x  \n        y=n%x  \n        b=b+[y]\n        if s==0:\n            break\n        n=s\n    b.reverse()\n    for i in b:\n        c.append(str(a[i]))\n    return c\n\ndef countx(listx,a):\n\ticount=0\n\tfor i in listx:\n\t\tif (a==i):\n\t\t\ticount=icount+1\n\treturn icount\n\na=[]\nN,S=map(int,input().split())\nif (S<=500):\n\tfor i in range(S+1,525):\n\t\tfor j in range(2,11):\n\t\t\tc=f(i,j)\n\t\t\tdaoxu=c[::-1]\n\t\t\tc1=''.join(c)\n\t\t\tdaoxu1=''.join(daoxu)\n\t\t\tif (c1==daoxu1):\n\t\t\t\ta.append(i)\nif (500<S<5000):\n\tfor i in range(S+1,5001):\n\t\tfor j in range(2,11):\n\t\t\tc=f(i,j)\n\t\t\tdaoxu=c[::-1]\n\t\t\tc1=''.join(c)\n\t\t\tdaoxu1=''.join(daoxu)\n\t\t\tif (c1==daoxu1):\n\t\t\t\ta.append(i)\nif (5000<=S<10000):\n\tfor i in range(S+1,12356):\n\t\tfor j in range(2,11):\n\t\t\tc=f(i,j)\n\t\t\tdaoxu=c[::-1]\n\t\t\tc1=''.join(c)\n\t\t\tdaoxu1=''.join(daoxu)\n\t\t\tif (c1==daoxu1):\n\t\t\t\ta.append(i)\t\nb=[]\nfor i in range(0,len(a)):\n\ticountx=countx(a,a[i])\n\tif (icountx!=1):\n\t\tb.append(a[i])\nb=list(set(b))\nb.sort()\nfor j in range(0,N):\n\tprint(b[j])\t\t",PARTIAL_ACCEPTED,619,3220
1278275795384991744,8982f04dde07ce4ad3a2f17670cf29d21b7c6bf721b7ae32b7b1ca54fff9aca7,2020-07-01 18:34:33,Python,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"def f(n,x):\n    a=[0,1,2,3,4,5,6,7,8,9,'A','B','C','D','E','F','G','H','I','J']\n    b=[]\n    c=[]\n    while True:\n        s=n//x  \n        y=n%x  \n        b=b+[y]\n        if s==0:\n            break\n        n=s\n    b.reverse()\n    for i in b:\n        c.append(str(a[i]))\n    return c\n\ndef countx(listx,a):\n\ticount=0\n\tfor i in listx:\n\t\tif (a==i):\n\t\t\ticount=icount+1\n\treturn icount\n\na=[]\nN,S=map(int,input().split())\nif (S<=501):\n\tfor i in range(S+1,1000):\n\t\tfor j in range(2,11):\n\t\t\tc=f(i,j)\n\t\t\tdaoxu=c[::-1]\n\t\t\tc1=''.join(c)\n\t\t\tdaoxu1=''.join(daoxu)\n\t\t\tif (c1==daoxu1):\n\t\t\t\ta.append(i)\nif (500<S<5000):\n\tfor i in range(S+1,5001):\n\t\tfor j in range(2,11):\n\t\t\tc=f(i,j)\n\t\t\tdaoxu=c[::-1]\n\t\t\tc1=''.join(c)\n\t\t\tdaoxu1=''.join(daoxu)\n\t\t\tif (c1==daoxu1):\n\t\t\t\ta.append(i)\nif (5000<=S<10000):\n\tfor i in range(S+1,12356):\n\t\tfor j in range(2,11):\n\t\t\tc=f(i,j)\n\t\t\tdaoxu=c[::-1]\n\t\t\tc1=''.join(c)\n\t\t\tdaoxu1=''.join(daoxu)\n\t\t\tif (c1==daoxu1):\n\t\t\t\ta.append(i)\t\nb=[]\nfor i in range(0,len(a)):\n\ticountx=countx(a,a[i])\n\tif (icountx!=1):\n\t\tb.append(a[i])\nb=list(set(b))\nb.sort()\nfor j in range(0,N):\n\tprint(b[j])\t\t",ACCEPTED,800,3200
1278276224432922624,40e897818d5386ba9e529984326264e964404c624b7eb28f67ebb37eab419911,2020-07-01 18:36:15,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <fstream>\n#include <cstring>\n#include <vector>\nusing namespace std;\n\n\nchar a[21] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J','K' };\nint B;\nbool judgement(string s)\n{\n    int m = s.length() - 1;\n    for (int i = 0; i < (m + 1) / 2; i++)\n    {\n        if (s[i] != s[m - i])\n        { \n            return false; \n        }\n    }\n    return true;\n}\nint main()\n{\n    cin >> B;\n    string s1;\n    string s2;\n    int k;\n    for (int i = 1; i <= 300; i++)\n    {\n        k = i; \n        s1 = \""\"";\n        while (k)\n        {\n            s1 = s1 + a[k % B];\n            k = k / B;\n        }\n        k = i * i; \n        s2 = \""\"";\n        while (k)\n        {\n            s2 = s2 + a[k % B];\n            k = k / B;\n        }\n        if (judgement(s2))\n        {\n            for (int j = s1.length()-1; j >= 0; j--)\n                cout << s1[j];\n            cout << \"" \"" << s2 << endl;\n        }\n    }\n    return 0;\n}",ACCEPTED,40,384
1278277316646469632,d6c412f1e470e1a910b2c1073ff83d69be18589f33470b5e16e31947e1a65809,2020-07-01 18:40:36,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n#include<string>\nstring b={\""0123456789ABCDEFGHIJK\""};\n\nvoid print(int num,int b)\n{\n    int result[20];\n    int d=0;\n    while(num!=0)\n    {\n        int c=num%b;\n        result[d]=c;\n        d+=1;\n        num=num/b;\n    }\n    for(int j=0;j<d;j++)\n    {\n        cout<<result[j];\n    }\n}\nint com(int num,int b)\n{\n    int result[20];\n    int d=0;\n    while(num!=0)\n    {\n        int c=num%b;\n        result[d]=c;\n        d+=1;\n        num=num/b;\n    }\n    for(int i=0;i<d;i++)\n    {\n        if(result[i]!=result[d-1-i])\n        {\n            return 0;\n        }\n    }\n    return 1;\n}\nint main()\n{\n    int a;\n    cin>>a;\n    for(int i=1;i<301;i++)\n    {\n        int square=i*i;\n        if(com(square,a)==1)\n        {\n            print(i,a);\n            cout<<\"" \"";\n            print(square,a);\n            cout<<\""\\n\"";\n        }\n    }\n\n}\n",PARTIAL_ACCEPTED,37,544
1278278688972398592,ad8686712a9999dbe03ced4f0edcc6d1ec90b29a12065ac79e4414d28f7d7af6,2020-07-01 18:46:03,Python,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"def transB(number,b):\n    tran=[]\n    while (number!=0):\n        y = number % b  \n        tran = tran+[y]\n        number = number//b  \n    tran.reverse()\n    return tran\n\nN = int(input())\nS = int(input())\ntimesN = 0\ntimesB = 0\nwhile(timesN<N):\n    S += 1\n    for x in range(2,11):\n        tran = transB(S,x)\n        rever = tran[::-1]\n        if(tran==rever):\n            timesB += 1\n            if(timesB>=2):\n                timesN += 1\n                print(S)\n                break\n    timesB = 0",NON_ZERO_EXIT_CODE,127,3048
1278278788373217280,ad8686712a9999dbe03ced4f0edcc6d1ec90b29a12065ac79e4414d28f7d7af6,2020-07-01 18:46:27,Python,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"def transB(number,b):\n    tran=[]\n    while (number!=0):\n        y = number % b  \n        tran = tran+[y]\n        number = number//b  \n    tran.reverse()\n    return tran\nN = int(input())\nS = int(input())\ntimesN = 0\ntimesB = 0\nwhile(timesN<N):\n    S += 1\n    for x in range(2,11):\n        tran = transB(S,x)\n        rever = tran[::-1]\n        if(tran==rever):\n            timesB += 1\n            if(timesB>=2):\n                timesN += 1\n                print(S)\n                break\n    timesB = 0",NON_ZERO_EXIT_CODE,169,2984
1278278848477593600,ad8686712a9999dbe03ced4f0edcc6d1ec90b29a12065ac79e4414d28f7d7af6,2020-07-01 18:46:41,Python,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"def transB(number,b):\n    tran=[]\n    while (number!=0):\n        y = number % b  \n        tran = tran+[y]\n        number = number//b  \n    tran.reverse()\n    return tran\nN = int(input())\nS = int(input())\ntimesN = 0\ntimesB = 0\nwhile(timesN<N):\n    S += 1\n    for x in range(2,11):\n        tran = transB(S,x)\n        rever = tran[::-1]\n        if(tran==rever):\n            timesB += 1\n            if(timesB>=2):\n                timesN += 1\n                print(S)\n                break\n    timesB = 0\nexit(0)",NON_ZERO_EXIT_CODE,158,2984
1278280181033140224,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-01 18:51:59,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint a[100000];\nint turn(int k,int b)\n{\n    int i = 0;\n    while (k > 0) {\n        a[i++] = k % b;\n        k = k / b;\n    }\n    return i;\n}\nint huiwen(int k)\n{\n    for (int t = 0;t < k - 1;t++)\n    {\n        if (a[t] != a[k - t - 1]) {\n            return 0;\n        }\n    }\n    return 1;\n}\nint main()\n{\n    int n, num;//n代表要几个数\n    int sum = 0;\n    int count=0;//用来统计个数\n    cin >> n >> num;\n    int w = num + 1;\n    while (count < 3) {\n        for (int b = 2;b <= 10;b++)\n        {\n            if (huiwen(turn(w, b)) == 1)\n                sum = sum + 1;\n        }\n        if (sum >= 2) {\n            count = count + 1;\n            cout << w << endl;\n            w = w + 1;\n        }\n    }\n   \n}",MULTIPLE_ERROR,18,536
1278280430271266816,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-01 18:52:58,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint a[100000];\nint turn(int k,int b)\n{\n    int i = 0;\n    while (k > 0) {\n        a[i++] = k % b;\n        k = k / b;\n    }\n    return i;\n}\nint huiwen(int k)\n{\n    for (int t = 0;t < k - 1;t++)\n    {\n        if (a[t] != a[k - t - 1]) {\n            return 0;\n        }\n    }\n    return 1;\n}\nint main()\n{\n    int n, num;//n代表要几个数\n    int sum = 0;\n    int count=0;//用来统计个数\n    cin >> n >> num;\n    int w = num + 1;\n    while (count < n) {\n        for (int b = 2;b <= 10;b++)\n        {\n            if (huiwen(turn(w, b)) == 1)\n                sum = sum + 1;\n        }\n        if (sum >= 2) {\n            count = count + 1;\n            cout << w << endl;\n            w = w + 1;\n        }\n    }\n   \n}",PARTIAL_ACCEPTED,25,424
1278281154157797376,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-01 18:55:51,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint a[100000];\nint turn(int k,int b)\n{\n    int i = 0;\n    while (k > 0) {\n        a[i++] = k % b;\n        k = k / b;\n    }\n    return i;\n}\nint huiwen(int k)\n{\n    for (int t = 0;t < k - 1;t++)\n    {\n        if (a[t] != a[k - t - 1]) {\n            return 0;\n        }\n    }\n    return 1;\n}\nint main()\n{\n    int n, num;//n代表要几个数\n    int sum = 0;\n    int count=0;//用来统计个数\n    cin >> n >> num;\n    int w = num + 1;\n    while (count < n) {\n        for (int b = 2;b <= 10;b++)\n        {\n            if (huiwen(turn(w, b)) == 1)\n                sum = sum + 1;\n        }\n        if (sum >2) {\n            count = count + 1;\n            cout << w << endl;\n            w = w + 1;\n        }\n    }\n   \n}",PARTIAL_ACCEPTED,15,452
1278281863779516416,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-01 18:58:40,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint a[100000];\nint turn(int k,int b)\n{\n    int i = 0;\n    while (k > 0) {\n        a[i++] = k % b;\n        k = k / b;\n    }\n    return i;\n}\nint huiwen(int k)\n{\n    for (int t = 0;t <= k - 1;t++)\n    {\n        if (a[t] != a[k - t - 1]) {\n            return 0;\n        }\n    }\n    return 1;\n}\nint main()\n{\n    int n, num;//n代表要几个数\n    int sum = 0;\n    int count=0;//用来统计个数\n    cin >> n >> num;\n    int w = num + 1;\n    while (count < n) {\n        for (int b = 2;b <= 10;b++)\n        {\n            if (huiwen(turn(w, b)) == 1)\n                sum = sum + 1;\n        }\n        if (sum >2) {\n            count = count + 1;\n            cout << w << endl;\n            w = w + 1;\n        }\n    }\n   \n}",PARTIAL_ACCEPTED,19,384
1278282168713797632,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-01 18:59:53,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint a[100000];\nint turn(int k,int b)\n{\n    int i = 0;\n    while (k > 0) {\n        a[i++] = k % b;\n        k = k / b;\n    }\n    return i;\n}\nint huiwen(int k)\n{\n    for (int t = 0;t <= k - 1;t++)\n    {\n        if (a[t] != a[k - t - 1]) {\n            return 0;\n        }\n    }\n    return 1;\n}\nint main()\n{\n    int n, num;//n代表要几个数\n    int sum = 0;\n    int count=0;//用来统计个数\n    cin >> n >> num;\n    int w = num + 1;\n    while (count < n) {\n        for (int b = 2;b <= 10;b++)\n        {\n            if (huiwen(turn(w, b)) == 1)\n                sum = sum + 1;\n        }\n        if (sum >2) {\n            count = count + 1;\n            cout << w << endl;\n        }\n         w = w + 1;\n    }\n   \n}",PARTIAL_ACCEPTED,32,388
1278282407155793920,40e897818d5386ba9e529984326264e964404c624b7eb28f67ebb37eab419911,2020-07-01 19:00:49,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <fstream>\n#include <cstring>\n#include <vector>\nusing namespace std;\n\n\nchar a[20] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\nint B;\n\nbool judgement(string s)\n{\n\tfor (int i = 0; i < s.length() / 2; i++)\n\t{\n\t\tif (s[i] != s[s.length() - 1 - i])\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n\n}\n\nint main() \n{\n\tcin >> B;\n\tstring s1, s2;\n\tfor (int num = 1; num <= 300; num++)\n\t{\n\t\tint k, squ;\n\t\tk = num;\n\t\tsqu = num * num;\n\t\twhile(k)\n\t\t{\n\t\t\tstring s1 = \""\"";\n\t\t\ts1 += a[k % B];\n\t\t\tk /= B;\n\t\t}\n\t\twhile (squ)\n\t\t{\n\t\t\tstring s2 = \""\"";\n\t\t\ts1 += a[squ % B];\n\t\t\tk /= B;\n\t\t}\n\t}\n\tif (judgement(s2))\n\t{\n\t\tcout << s1 << \"" \"" << s2;\n\t}\n\n}",TIME_LIMIT_EXCEEDED,0,0
1278282538076790784,40e897818d5386ba9e529984326264e964404c624b7eb28f67ebb37eab419911,2020-07-01 19:01:21,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <fstream>\n#include <cstring>\n#include <vector>\nusing namespace std;\n\n\nchar a[20] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\nint B;\n\nbool judgement(string s)\n{\n\tfor (int i = 0; i < s.length() / 2; i++)\n\t{\n\t\tif (s[i] != s[s.length() - 1 - i])\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n\n}\n\nint main() \n{\n\tcin >> B;\n\tstring s1, s2;\n    int k, squ;\n\tfor (int num = 1; num <= 300; num++)\n\t{\n\t\tk = num;\n\t\tsqu = num * num;\n\t\twhile(k)\n\t\t{\n\t\t\tstring s1 = \""\"";\n\t\t\ts1 += a[k % B];\n\t\t\tk /= B;\n\t\t}\n\t\twhile (squ)\n\t\t{\n\t\t\tstring s2 = \""\"";\n\t\t\ts1 += a[squ % B];\n\t\t\tk /= B;\n\t\t}\n\t}\n\tif (judgement(s2))\n\t{\n\t\tcout << s1 << \"" \"" << s2;\n\t}\n\n}",TIME_LIMIT_EXCEEDED,0,0
1278282874258644992,40e897818d5386ba9e529984326264e964404c624b7eb28f67ebb37eab419911,2020-07-01 19:02:41,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <fstream>\n#include <cstring>\n#include <vector>\nusing namespace std;\n\n\nchar a[20] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\nint B;\n\nbool judgement(string s)\n{\n\tfor (int i = 0; i < s.length() / 2; i++)\n\t{\n\t\tif (s[i] != s[s.length() - 1 - i])\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n\n}\n\nint main() \n{\n\tcin >> B;\n\tstring s1, s2;\n    int k, squ;\n\tfor (int num = 1; num <= 300; num++)\n\t{\n\t\tk = num;\n\t\tsqu = num * num;\n\t\twhile(k)\n\t\t{\n\t\t\tstring s1 = \""\"";\n\t\t\ts1 += a[k % B];\n\t\t\tk = k / B;\n\t\t}\n\t\twhile (squ)\n\t\t{\n\t\t\tstring s2 = \""\"";\n\t\t\ts1 += a[squ % B];\n\t\t\tk = k / B;\n\t\t}\n\t}\n\tif (judgement(s2))\n\t{\n\t\tcout << s1 << \"" \"" << s2;\n\t}\n\n}",TIME_LIMIT_EXCEEDED,0,0
1278282935306747904,40e897818d5386ba9e529984326264e964404c624b7eb28f67ebb37eab419911,2020-07-01 19:02:55,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <fstream>\n#include <cstring>\n#include <vector>\nusing namespace std;\n\n\nchar a[20] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\nint B;\n\nbool judgement(string s)\n{\n\tfor (int i = 0; i < s.length() / 2; i++)\n\t{\n\t\tif (s[i] != s[s.length() - 1 - i])\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n\n}\n\nint main() \n{\n\tcin >> B;\n\tstring s1, s2;\n    int k, squ;\n\tfor (int num = 1; num <= 300; num++)\n\t{\n\t\tk = num;\n\t\tsqu = num * num;\n\t\twhile(k)\n\t\t{\n\t\t\tstring s1 = \""\"";\n\t\t\ts1 += a[k % B];\n\t\t\tk = k / B;\n\t\t}\n\t\twhile (squ)\n\t\t{\n\t\t\tstring s2 = \""\"";\n\t\t\ts1 += a[squ % B];\n\t\t\tsqu = squ / B;\n\t\t}\n\t}\n\tif (judgement(s2))\n\t{\n\t\tcout << s1 << \"" \"" << s2;\n\t}\n\n}",WRONG_ANSWER,30,388
1278284215865499648,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-01 19:08:01,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint a[100000];\nint turn(int k,int b)\n{\n    int i = 0;\n    while (k > 0) {\n        a[i++] = k % b;\n        k = k / b;\n    }\n    return i;\n}\nint huiwen(int k)\n{\n    for (int t = 0;t <= k - 1;t++)\n    {\n        if (a[t] != a[k - t - 1]) {\n            return 0;\n        }\n    }\n    return 1;\n}\nint main()\n{\n    int n, num;//n代表要几个数\n    int sum = 0;\n    int count=0;//用来统计个数\n    cin >> n >> num;\n    int w = num + 1;\n    while (count < n) {\n        for (int b = 2;b <= 10;b++)\n        {\n            if (huiwen(turn(w, b)) == 1)\n                sum = sum + 1;\n        }\n        if (sum >2) {\n            count = count + 1;\n            cout << w << endl;\n        }\n        w = w + 1;\n    }\n   \n}",PARTIAL_ACCEPTED,35,508
1278285273761243136,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-01 19:12:13,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint a[100000];\nint turn(int k,int b)\n{\n    int i = 0;\n    while (k > 0) {\n        a[i++] = k % b;\n        k = k / b;\n    }\n    return i;\n}\nint huiwen(int k)\n{\n    for (int t = 0;t <= k - 1;t++)\n    {\n        if (a[t] != a[k - t - 1]) {\n            return 0;\n        }\n    }\n    return 1;\n}\nint main()\n{\n    int n, num;//n代表要几个数\n    int sum = 0;\n    int count=0;//用来统计个数\n    cin >> n >> num;\n    int w = num + 1;\n    while (count < n) {\n        for (int b = 2;b <= 10;b++)\n        {\n            if (huiwen(turn(w, b)) == 1)\n                sum = sum + 1;\n        }\n        if (sum >=2) {\n            count = count + 1;\n            cout << w << endl;\n        }\n        w = w + 1;\n    }\n   \n}",PARTIAL_ACCEPTED,35,512
1278285662598397952,ad8686712a9999dbe03ced4f0edcc6d1ec90b29a12065ac79e4414d28f7d7af6,2020-07-01 19:13:46,Python,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"def transB(number,b):\n    tran=[]\n    while (number!=0):\n        y = number % b  \n        tran = tran+[y]\n        number = number//b  \n    return tran\n\nN = int(input())\nS = int(input())\ntimesN = 0\nanswer = []\nwhile(timesN<N):\n    timesB = 0\n    S += 1\n    for x in range(2,11):\n        tran = transB(S,x)\n        rever = tran[::-1]\n        if(tran==rever):\n            timesB += 1\n            if(timesB==2 ):\n                timesN += 1\n                answer.append(S)\n                break\nfor i in answer:\n    print(i)\n\n                ",NON_ZERO_EXIT_CODE,186,3040
1278285819683471360,40e897818d5386ba9e529984326264e964404c624b7eb28f67ebb37eab419911,2020-07-01 19:14:23,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <fstream>\n#include <cstring>\n#include <vector>\nusing namespace std;\n\n\nchar a[20] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\nint B;\n\nbool judgement(string s)\n{\n\tfor (int i = 0; i < s.length() / 2; i++)\n\t{\n\t\tif (s[i] != s[s.length() - 1 - i])\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n\n}\n\nint main()\n{\n\tcin >> B;\n\tstring s1, s2;\n\tint k, squ;\n\tfor (int num = 1; num <= 300; num++)\n\t{\n\t\tk = num;\n\t\tsqu = num * num;\n\t\tstring s1 = \""\"";\n\t\tstring s2 = \""\"";\n\t\twhile (k)\n\t\t{\n\t\t\ts1 += a[k % B];\n\t\t\tk = k / B;\n\t\t}\n\t\twhile (squ)\n\t\t{\n\t\t\ts2 += a[squ % B];\n\t\t\tsqu = squ / B;\n\t\t}\n\t\tif (judgement(s2))\n\t\t{\n\t\t\tcout << num <<\"" \""<< s2 << endl;\n\t\t}\n\t}\n\n}\n\t\t\tk = k / B;\n\t\t}\n\t\twhile (squ)\n\t\t{\n\t\t\tstring s2 = \""\"";\n\t\t\ts1 += a[squ % B];\n\t\t\tsqu = squ / B;\n\t\t}\n\t}\n\tif (judgement(s2))\n\t{\n\t\tcout << s1 << \"" \"" << s2;\n\t}\n\n}",COMPILE_ERROR,0,0
1278285917305896960,40e897818d5386ba9e529984326264e964404c624b7eb28f67ebb37eab419911,2020-07-01 19:14:46,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <fstream>\n#include <cstring>\n#include <vector>\nusing namespace std;\n\n\nchar a[20] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\nint B;\n\nbool judgement(string s)\n{\n\tfor (int i = 0; i < s.length() / 2; i++)\n\t{\n\t\tif (s[i] != s[s.length() - 1 - i])\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n\n}\n\nint main()\n{\n\tcin >> B;\n\tstring s1, s2;\n\tint k, squ;\n\tfor (int num = 1; num <= 300; num++)\n\t{\n\t\tk = num;\n\t\tsqu = num * num;\n\t\tstring s1 = \""\"";\n\t\tstring s2 = \""\"";\n\t\twhile (k)\n\t\t{\n\t\t\ts1 += a[k % B];\n\t\t\tk = k / B;\n\t\t}\n\t\twhile (squ)\n\t\t{\n\t\t\ts2 += a[squ % B];\n\t\t\tsqu = squ / B;\n\t\t}\n\t\tif (judgement(s2))\n\t\t{\n\t\t\tcout << num <<\"" \""<< s2 << endl;\n\t\t}\n\t}\n\n}",PARTIAL_ACCEPTED,32,412
1278286029553860608,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-01 19:15:13,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint a[10000000], b[10000000];\nint B;\nusing namespace std;\nint turn1(int k)\n{\n    int i = 0;\n    while (k > 0) {\n        a[i] = k % B;\n        k = k / B;\n        i++;\n    }\n    return i;\n}\nint turn2(int k)\n{\n    int i = 0;\n    while (k > 0) {\n        b[i] = k % B;\n        k = k / B;\n        i++;\n    }\n    return i;\n}\n\nvoid print1(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        while (a[i] >= 10){\n            if (a[i]==10)\n                cout<<'A';\n            else if(a[i]==11)\n                cout<<'B';\n             else if(a[i]==12)\n                cout<<'C';\n             else if(a[i]==13)\n                cout<<'D';\n             else if(a[i]==14)\n                cout<<'E';\n             else if(a[i]==15)\n                cout<<'F';\n             else if(a[i]==16)\n                cout<<'G';\n             else if(a[i]==17)\n                cout<<'H';\n             else if(a[i]==18)\n                cout<<'I';\n             else if(a[i]==19)\n                cout<<'J';\n             else if(a[i]==20)\n                cout<<'K';\n        }\n        if (a[i] < 10)\n            cout << a[i];\n    }\n}\nvoid print2(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        while(b[i] >= 10)\n            if (b[i]==10)\n                cout<<'A';\n            else if(b[i]==11)\n                cout<<'B';\n            else if(b[i]==12)\n                cout<<'C';\n            else if(b[i]==13)\n                cout<<'D';\n            else if(b[i]==14)\n                cout<<'E';\n            else if(b[i]==15)\n                cout<<'F';\n            else if(b[i]==16)\n                cout<<'G';\n            else if(b[i]==17)\n                cout<<'H';\n            else if(b[i]==18)\n                cout<<'I';\n            else if(b[i]==19)\n                cout<<'J';\n            else if(b[i]==20)\n                cout<<'K';\n        if(b[i] < 10)\n            cout << b[i];\n    }\n}\nint huiwen(int k)\n{\n    for (int i =0;i <=k-1;i++)\n    {\n        if (a[i] != a[k - i - 1])\n            return 0;\n    }\n    return 1;\n}\nint main()\n{\n    cin >> B;\n    for (int i = 1;i <= 300;i++) {\n        int num = turn1(i * i);\n        if (huiwen(num) == 1)\n        {\n            if(turn2(i)<=300){\n                print2(turn2(i));\n                cout << \"" \"";\n                print1(num);\n                cout << endl;\n            }\n        }\n    }\n}",PARTIAL_ACCEPTED,26,512
1278286090841030656,40e897818d5386ba9e529984326264e964404c624b7eb28f67ebb37eab419911,2020-07-01 19:15:28,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <fstream>\n#include <cstring>\n#include <vector>\nusing namespace std;\n\n\nchar a[20] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\nint B;\n\nbool judgement(string s)\n{\n\tfor (int i = 0; i < s.length() / 2; i++)\n\t{\n\t\tif (s[i] != s[s.length() - 1 - i])\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n\n}\n\nint main()\n{\n\tcin >> B;\n\tstring s1, s2;\n\tint k, squ;\n\tfor (int num = 1; num <= 300; num++)\n\t{\n\t\tk = num;\n\t\tsqu = num * num;\n\t\tstring s1 = \""\"";\n\t\tstring s2 = \""\"";\n\t\twhile (k)\n\t\t{\n\t\t\ts1 += a[k % B];\n\t\t\tk = k / B;\n\t\t}\n\t\twhile (squ)\n\t\t{\n\t\t\ts2 += a[squ % B];\n\t\t\tsqu = squ / B;\n\t\t}\n\t\tif (judgement(s2))\n\t\t{\n\t\t\tcout << s1 <<\"" \""<< s2 << endl;\n\t\t}\n\t}\n\n}",PARTIAL_ACCEPTED,30,424
1278286842502242304,adca0e7fe2da494372711b65889bb7f278f78ac4d835384b93663445fbd6db0d,2020-07-01 19:18:27,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <cmath>\n\nusing namespace std;\n\nstring to_B(int B, int before)\n{\n    int i{0};\n    string result1,result2;\n    while(before>=pow(B,i))\n    {\n\n        int iTemp = before%int(pow(B,i+1));\n        before -=iTemp;\n        iTemp = iTemp/(pow(B,i));\n        if(iTemp>9)\n        {\n            char cTemp = char(iTemp+55);\n            result1 += cTemp;\n        }\n        else\n        {\n            result1 += to_string(iTemp);\n        }\n        i++;\n    }\n    int Length = int(result1.length());\n    for(int i=0;i<Length;i++)\n    {\n        result2 +=result1[Length-i-1];\n    }\n    return result2;\n}\nbool mirror_able(string s)\n{\n    int N;\n    N = s.length();\n    for(int i=0;i<N;i++)\n    {\n        if(s[i]!=s[N-i-1])\n            return false;\n    }\n    return true;\n}\n\nint main()\n{\n    int B;\n    cin >> B;\n\n    for(int i=1;i<=300;i++)\n    {\n        int iPower = pow(i,2);\n        string sPower = to_B(B,iPower);\n        string s = to_B(B,i);\n        if(mirror_able(sPower))\n        {\n            cout << s << \"" \"" << sPower << endl;\n        }\n    }\n//    cout << to_B(16,15)<<endl;\n//    cout << \""____________________\"";\n}",ACCEPTED,46,512
1278286982336143360,9967d355e8ac7fdcfa174a2c7d2c402e8faa3b9970225fbfcd9cd1b16ad2beda,2020-07-01 19:19:00,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint a[20];\nint B;\nbool isPal(int a)\n{\n    int flag=0;\n    int squares=a*a;\n    for(flag=0;flag<20;flag++)  //转化为B进制；\n    {\n        a[flag]=squares%B;\n        squares /= B;\n        if(squares==0)\n            break;\n    }\n    for(int i=0;i<=flag;i++)\n        if(a[i]!=a[flag-i])\n            return 0;\n    return 1;\n}\nprint(int a)\n{\n    int flag1=0;\n    for(flag1=0;flag1<20;flag1++)  //转化为B进制；\n    {\n        a[flag1]=a%B;\n        a /= B;\n        if(a==0)\n            break;\n    }\n    for(int i=0;i<=flag;i++)\n    {\n        if(a[i]>9)\n        {\n            cout<<a[i]-10+'A';\n        }else{cout<<a[i];}\n    }\n}\nint main()\n{\n    cin>>B;\n    \n    for(int i=2;i<=300;i++)\n    {\n        if(isPal(i))\n        {\n            print(i);\n            cout<<\"" \"";\n            print(i*i);\n            cout<<endl;\n        }\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1278287117774422016,40e897818d5386ba9e529984326264e964404c624b7eb28f67ebb37eab419911,2020-07-01 19:19:32,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <fstream>\n#include <cstring>\n#include <vector>\nusing namespace std;\n\n\nchar a[20] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\nint B;\n\nbool judgement(string s)\n{\n\tfor (int i = 0; i < s.length() / 2; i++)\n\t{\n\t\tif (s[i] != s[s.length() - 1 - i])\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n\n}\n\nint main()\n{\n\tcin >> B;\n\tstring s1, s2;\n\tint k, squ;\n\tfor (int num = 1; num <= 300; num++)\n\t{\n\t\tk = num;\n\t\tsqu = num * num;\n\t\tstring s1 = \""\"";\n\t\tstring s2 = \""\"";\n\t\twhile (k)\n\t\t{\n\t\t\ts1 += a[k % B];\n\t\t\tk = k / B;\n\t\t}\n\t\twhile (squ)\n\t\t{\n\t\t\ts2 += a[squ % B];\n\t\t\tsqu = squ / B;\n\t\t}\n\t\tif (judgement(s2))\n\t\t{\n\t\t\tfor (int j = s1.length()-1; j >= 0; j--)\n\t\t\t{\n\t\t\t\tcout << s1[j];\n\t\t\t}\n\t\t\tcout << \"" \""<< s2 << endl;\n\t\t}\n\t}\n\n}",ACCEPTED,26,488
1278287172837236736,9967d355e8ac7fdcfa174a2c7d2c402e8faa3b9970225fbfcd9cd1b16ad2beda,2020-07-01 19:19:46,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint arr[20];\nint B;\nbool isPal(int a)\n{\n    int flag=0;\n    int squares=a*a;\n    for(flag=0;flag<20;flag++)  //转化为B进制；\n    {\n        arr[flag]=squares%B;\n        squares /= B;\n        if(squares==0)\n            break;\n    }\n    for(int i=0;i<=flag;i++)\n        if(arr[i]!=arr[flag-i])\n            return 0;\n    return 1;\n}\nprint(int a)\n{\n    int flag1=0;\n    for(flag1=0;flag1<20;flag1++)  //转化为B进制；\n    {\n        arr[flag1]=a%B;\n        a /= B;\n        if(a==0)\n            break;\n    }\n    for(int i=0;i<=flag;i++)\n    {\n        if(arr[i]>9)\n        {\n            cout<<arr[i]-10+'A';\n        }else{cout<<arr[i];}\n    }\n}\nint main()\n{\n    cin>>B;\n    \n    for(int i=2;i<=300;i++)\n    {\n        if(isPal(i))\n        {\n            print(i);\n            cout<<\"" \"";\n            print(i*i);\n            cout<<endl;\n        }\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1278287469378732032,9967d355e8ac7fdcfa174a2c7d2c402e8faa3b9970225fbfcd9cd1b16ad2beda,2020-07-01 19:20:56,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint arr[20];\nint B;\nbool isPal(int a)\n{\n    int flag=0;\n    int squares=a*a;\n    for(flag=0;flag<20;flag++)  //转化为B进制；\n    {\n        arr[flag]=squares%B;\n        squares /= B;\n        if(squares==0)\n            break;\n    }\n    for(int i=0;i<=flag;i++)\n        if(arr[i]!=arr[flag-i])\n            return 0;\n    return 1;\n}\nvoid print(int a)\n{\n    int flag1=0;\n    for(flag1=0;flag1<20;flag1++)  //转化为B进制；\n    {\n        arr[flag1]=a%B;\n        a /= B;\n        if(a==0)\n            break;\n    }\n    for(int i=0;i<=flag;i++)\n    {\n        if(arr[i]>9)\n        {\n            cout<<arr[i]-10+'A';\n        }else{cout<<arr[i];}\n    }\n}\nint main()\n{\n    cin>>B;\n    \n    for(int i=2;i<=300;i++)\n    {\n        if(isPal(i))\n        {\n            print(i);\n            cout<<\"" \"";\n            print(i*i);\n            cout<<endl;\n        }\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1278287612983312384,9967d355e8ac7fdcfa174a2c7d2c402e8faa3b9970225fbfcd9cd1b16ad2beda,2020-07-01 19:21:31,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint arr[20];\nint B;\nint flag=0;\nint flag1=0;\nbool isPal(int a)\n{\n    int squares=a*a;\n    for(flag=0;flag<20;flag++)  //转化为B进制；\n    {\n        arr[flag]=squares%B;\n        squares /= B;\n        if(squares==0)\n            break;\n    }\n    for(int i=0;i<=flag;i++)\n        if(arr[i]!=arr[flag-i])\n            return 0;\n    return 1;\n}\nvoid print(int a)\n{\n    for(flag1=0;flag1<20;flag1++)  //转化为B进制；\n    {\n        arr[flag1]=a%B;\n        a /= B;\n        if(a==0)\n            break;\n    }\n    for(int i=0;i<=flag;i++)\n    {\n        if(arr[i]>9)\n        {\n            cout<<arr[i]-10+'A';\n        }else{cout<<arr[i];}\n    }\n}\nint main()\n{\n    cin>>B;\n    \n    for(int i=2;i<=300;i++)\n    {\n        if(isPal(i))\n        {\n            print(i);\n            cout<<\"" \"";\n            print(i*i);\n            cout<<endl;\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,41,512
1278288357124136960,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-01 19:24:28,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint a[100000];\nint turn(int k,int b)\n{\n    int i = 0;\n    while (k > 0) {\n        a[i++] = k % b;\n        k = k / b;\n    }\n    return i;\n}\nint huiwen(int k)\n{\n    for (int t = 0;t <= k - 1;t++)\n    {\n        if (a[t] != a[k - t - 1]) {\n            return 0;\n        }\n    }\n    return 1;\n}\nint main()\n{\n    int n, num;//n代表要几个数\n    int sum = 0;\n    int count=0;//用来统计个数\n    cin >> n >> num;\n    int w = num;\n    while (count < n) {\n        for (int b = 2;b <= 10;b++)\n        {\n            if (huiwen(turn(w, b)) == 1)\n                sum = sum + 1;\n        }\n        if (sum >=2) {\n            count = count + 1;\n            cout << w << endl;\n        }\n        w = w + 1;\n    }\n   \n}",WRONG_ANSWER,35,424
1278289483458347008,5a3352eaede8595dd7f3155c747ce60b585cea42c07e1003e1c108239fb37b37,2020-07-01 19:28:56,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nint s[100];\nint n;\nchar data[]={'A','B','C','D','E','F','G','H','I','J'};\n\nbool change(int a){\n    int flag=0;\n    a = a*a;\n    while(a!=0){\n        s[++flag]=a%n;\n        a /= n;\n    }\n\n    for(int i=1;i<=flag;i++){\n        if(s[i]!=s[flag+1-i])\n            return 0;\n    }\n    return 1;\n}\n\nvoid show(int a){\n    int flag=0;\n    while(a!=0){\n        s[++flag]=a%n;\n        a /= n;\n    }\n    for(int i=flag;i>=1;i--){\n        if(s[i]<=9){\n            cout << s[i];\n        }\n        else{\n            cout << data[s[i]-10];\n        }\n    }\n}\n\n\nint main(){\n    cin >> n;\n    for(int i=1;i<=300;i++){\n        change(i*i);\n        if(change(i)){\n            show(i);\n            cout << ' ';\n            show(i*i);\n            cout<<endl;\n        }\n    }\n    return 0;\n}\n",ACCEPTED,25,512
1278289695094538240,ad8686712a9999dbe03ced4f0edcc6d1ec90b29a12065ac79e4414d28f7d7af6,2020-07-01 19:29:47,Python,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"def transB(number,b):\n    tran=[]\n    while (number!=0):\n        y = number % b  \n        tran = tran+[y]\n        number = number//b  \n    tran.reverse()\n    return tran\nN = int(input())\nS = int(input())\ntimesN = 0\ntimesB = 0\nwhile(timesN<N):\n    S += 1\n    for x in range(2,11):\n        tran = transB(S,x)\n        rever = tran[::-1]\n        if(tran==rever):\n            timesB += 1\n            if(timesB>=2):\n                timesN += 1\n                print(S)\n                break\n    timesB = 0\nexit(0)",NON_ZERO_EXIT_CODE,165,3332
1278290063933243392,ad8686712a9999dbe03ced4f0edcc6d1ec90b29a12065ac79e4414d28f7d7af6,2020-07-01 19:31:15,Python,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"def transB(number,b):\n    tran=[]\n    while (number!=0):\n        y = number % b  \n        tran = tran+[y]\n        number = number//b  \n    tran.reverse()\n    return tran\nN = 0\nS = 0\nN,S = map(int,input().split())\ntimesN = 0\ntimesB = 0\nwhile(timesN<N):\n    S += 1\n    for x in range(2,11):\n        tran = transB(S,x)\n        rever = tran[::-1]\n        if(tran==rever):\n            timesB += 1\n            if(timesB>=2):\n                timesN += 1\n                print(S)\n                break\n    timesB = 0\nexit(0)",ACCEPTED,245,3056
1278290711089176576,5a3352eaede8595dd7f3155c747ce60b585cea42c07e1003e1c108239fb37b37,2020-07-01 19:33:49,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nint s[100];\nint n;\nchar data[]={'A','B','C','D','E','F','G','H','I','J'};\n\nbool change(int a){\n    int flag=0;\n    while(a!=0){\n        s[++flag]=a%n;\n        a /= n;\n    }\n\n    for(int i=1;i<=flag;i++){\n        if(s[i]!=s[flag+1-i])\n            return 0;\n    }\n    return 1;\n}\n\nvoid show(int a){\n    int flag=0;\n    while(a!=0){\n        s[++flag]=a%n;\n        a /= n;\n    }\n    for(int i=flag;i>=1;i--){\n        if(s[i]<=9){\n            cout << s[i];\n        }\n        else{\n            cout << data[s[i]-10];\n        }\n    }\n}\n\n\nint main(){\n    cin >> n;\n    for(int i=1;i<=300;i++){\n        if(change(i*i)){\n            show(i);\n            cout << ' ';\n            show(i*i);\n            cout<<endl;\n        }\n    }\n    return 0;\n}\n",ACCEPTED,33,388
1278291157312790528,ef2af74cf216d6156aa85f981ccf11bf345b812d2b02ec465e9880def4bf24ac,2020-07-01 19:35:36,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<math.h>\nusing namespace std;\n\nint main()\n{int change(int x,int b);\nint N,S,x,b,t1=0,t2=0;cin>>N>>S;\nfor(x=S+1;t2<N;x++)\n\t{for(b=2;b<=10;b++)\n\t\tif(x==change(x,b))t1++;\n\tif(t1>=2)\n\t\t{cout<<x<<endl;\n\t\tt2++;\n\t\t}\n\tt1=0;\n\t}\nreturn 0;\n}\n\nint change(int x,int b)\n{int number(int x,int b);\nconst int I=number(x,b);int i,p,n[I],y=0;\nfor(i=I-1;i>=0;i--)\n\t{p=pow(b,i);\n\tn[I-1-i]=x/p;\n\tx%=p;\n\t}\nfor(i=0;i<I;i++)\n\t{p=pow(b,i);\n\ty+=p*n[i];\n\t}\nreturn y;\n}\n\nint number(int x,int b)\n{int i,p=1;\nfor(i=1;x%p<x;i++)\n\tp=pow(b,i);\nreturn i-1;\n}",ACCEPTED,60,424
1278292204995411968,d6c412f1e470e1a910b2c1073ff83d69be18589f33470b5e16e31947e1a65809,2020-07-01 19:39:45,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n#include<string>\nstring b={\""0123456789ABCDEFGHIJK\""};\n\nvoid print(int num,int b)\n{\n    int result[20];\n    int d=0;\n    while(num!=0)\n    {\n        int c=num%b;\n        result[d]=c;\n        d+=1;\n        num=num/b;\n    }\n    for(int j=0;j<d;j++)\n    {\n        cout<<result[j];\n    }\n}\nint com(int num,int b)\n{\n    int result[20];\n    int d=0;\n    while(num!=0)\n    {\n        int c=num%b;\n        result[d]=c;\n        d+=1;\n        num=num/b;\n    }\n    for(int i=0;i<d;i++)\n    {\n        if(result[i]!=result[d-1-i])\n        {\n            return 0;\n        }\n    }\n    return 1;\n}\nint main()\n{\n    int a;\n    cin>>a;\n    for(int i=1;i<301;i++)\n    {\n        int square=i*i;\n        if(com(square,a)==1)\n        {\n            print(i,a);\n            cout<<\"" \"";\n            print(square,a);\n            cout<<\""\\n\"";\n        }\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,41,504
1278292355818389504,9967d355e8ac7fdcfa174a2c7d2c402e8faa3b9970225fbfcd9cd1b16ad2beda,2020-07-01 19:40:21,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"\n#include<iostream>\nusing namespace std;\nint arr[20];\nint B;\nint flag=0;\nint flag1=0;\nbool isPal(int a)\n{\n    int squares=a*a;\n    for(flag=0;flag<20;flag++)  //转化为B进制；\n    {\n        arr[flag]=squares%B;\n        squares /= B;\n        if(squares==0)\n            break;\n    }\n    for(int i=0;i<=flag;i++)\n        if(arr[i]!=arr[flag-i])\n            return 0;\n    return 1;\n}\nvoid print(int a)\n{\n    for(flag1=0;flag1<20;flag1++)  //转化为B进制；\n    {\n        arr[flag1]=a%B;\n        a /= B;\n        if(a==0)\n            break;\n    }\n    for(int i=flag1;i>=0;i--)\n    {\n        if(arr[i]>9)\n        {\n            printf(\""%c\"",arr[i]-10+'A');;\n        }\n        else{cout<<arr[i];}\n    }\n}\nint main()\n{\n    cin>>B;\n    \n    for(int i=1;i<=300;i++)\n    {\n        if(isPal(i))\n        {\n            print(i);\n            cout<<\"" \"";\n            print(i*i);\n            cout<<endl;\n        }\n    }\n    return 0;\n}",ACCEPTED,27,384
1278293389924040704,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-01 19:44:28,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint a[100000];\nint turn(int k,int b)\n{\n    int i = 0;\n    while (k > 0) {\n        a[i++] = k % b;\n        k = k / b;\n    }\n    return i;\n}\nint huiwen(int k)\n{\n    for (int t = 0;t <= k - 1;t++)\n    {\n        if (a[t] != a[k - t - 1]) {\n            return 0;\n        }\n    }\n    return 1;\n}\nint main()\n{\n    int n, num;//n代表要几个数\n    int sum = 0;\n    int count=0;//用来统计个数\n    cin >> n >> num;\n    int w = num;\n    while (count < n) {\n        for (int b = 2;b <= 10;b++)\n        {\n            int c=huiwen(turn(w,b))\n            if (c == 1)\n                sum = sum + 1;\n            if (sum >=2) {\n                count = count + 1;\n                cout << w << endl;\n             }\n        }\n        \n        w = w + 1;\n    }\n   \n}",COMPILE_ERROR,0,0
1278293527610449920,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-01 19:45:01,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint a[100000];\nint turn(int k,int b)\n{\n    int i = 0;\n    while (k > 0) {\n        a[i++] = k % b;\n        k = k / b;\n    }\n    return i;\n}\nint huiwen(int k)\n{\n    for (int t = 0;t <= k - 1;t++)\n    {\n        if (a[t] != a[k - t - 1]) {\n            return 0;\n        }\n    }\n    return 1;\n}\nint main()\n{\n    int n, num;//n代表要几个数\n    int sum = 0;\n    int count=0;//用来统计个数\n    cin >> n >> num;\n    int w = num;\n    while (count < n) {\n        for (int b = 2;b <= 10;b++)\n        {\n            int c=huiwen(turn(w,b));\n            if (c == 1)\n                sum = sum + 1;\n            if (sum >=2) {\n                count = count + 1;\n                cout << w << endl;\n             }\n        }\n        \n        w = w + 1;\n    }\n   \n}",WRONG_ANSWER,23,384
1278295408730628096,c21bc670948d3b509f1c1ae5efdff5c7ab99c718fcc903336363f152a304efea,2020-07-01 19:52:29,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<math.h>\nusing namespace std;\n\nint main()\n{int change(int x,int b);\nint N,S,x,b,t1=0,t2=0;cin>>N>>S;\t\t\t//x是待测试的数据，b是进制数，t1是某个x满足回文的次数，t2是满足的x的个数 \nfor(x=S+1;t2<N;x++)\n\t{for(b=2;b<=10;b++)\n\t\tif(x==change(x,b))t1++;\n\tif(t1>=2)\n\t\t{cout<<x<<endl;\n\t\tt2++;\n\t\t}\n\tt1=0;\n\t}\nreturn 0;\n}\n\nint change(int x,int b)\t\t\t\t\t\t//生成x在b进制下的镜像数 \n{int number(int x,int b);\nconst int I=number(x,b);int i,p,n[I],y=0;\nfor(i=I-1;i>=0;i--)\n\t{p=pow(b,i);\n\tn[I-1-i]=x/p;\n\tx%=p;\n\t}\nfor(i=0;i<I;i++)\n\t{p=pow(b,i);\n\ty+=p*n[i];\n\t}\nreturn y;\n}\n\nint number(int x,int b)\t\t\t\t\t\t//求x在b进制下的位数 \n{int i,p=1;\nfor(i=1;x%p<x;i++)\n\tp=pow(b,i);\nreturn i-1;\n}",ACCEPTED,72,512
1278296087209631744,d6c412f1e470e1a910b2c1073ff83d69be18589f33470b5e16e31947e1a65809,2020-07-01 19:55:11,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n#include<string>\nstring e={\""0123456789ABCDEFGHIJK\""};\nvoid print(int num,int b)\n{\n    int result[20];\n    int d=0;\n    while(num!=0)\n    {\n        int c=num%b;\n        result[d]=c;\n        d+=1;\n        num=num/b;\n    }\n    for(int j=0;j<d;j++)\n    {\n        cout<<e[result[d-1-j]];\n    }\n}\nint com(int num,int b)\n{\n    int result[20];\n    int d=0;\n    while(num!=0)\n    {\n        int c=num%b;\n        result[d]=c;\n        d+=1;\n        num=num/b;\n    }\n    for(int i=0;i<d;i++)\n    {\n        if(result[i]!=result[d-1-i])\n        {\n            return 0;\n        }\n    }\n    return 1;\n}\nint main()\n{\n    int a;\n    cin>>a;\n    for(int i=1;i<301;i++)\n    {\n        int square=i*i;\n        if(com(square,a)==1)\n        {\n            print(i,a);\n            cout<<\"" \"";\n            print(square,a);\n            cout<<\""\\n\"";\n        }\n    }\n    return 0;\n}\n\n",ACCEPTED,39,504
1278296670280802304,4924546fb63091b9dab43d0cb5b4f05ed8bbd5b5328d183d03e901d340ed28be,2020-07-01 19:57:30,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint s[10000];\nvoid Base_conversion(int a,int b)//a转换b进制 \n{\n    int r=0;\n    while(a)\n\t{\n        s[++r]=a%b;\n        a/=b;\n    }\n    s[0]=r;\n}\nbool change()\n{   //判断s[i]与s[s[0]+1-i]是否相等 回文\n    for(int i=1;i<=s[0];i++)\n\t{\n    \tif(s[i]!=s[s[0]+1-i]) return false;\n    }\n    return true;\n}\nint main()\n{\n    int N;//前N个\n    int S;//大于S\n    cin >> N >> S;\n    int a=0;//用于统计已有几个数符合要求\n    for (int i = S+1;a>N ; i++)\n    {\n        int jishu=0;//计数器 满足两个则输出\n        for (int k = 2; k<11; k++)\n        {\n            Base_conversion(i, k);\n            if (change())\n            {\n                jishu++;\n            }\n        }\n\n        if (jishu>=2)\n        {\n            cout << i << endl;\n            a++;\n        }    \n        else\n            continue;\n    }\n}",WRONG_ANSWER,35,384
1278297619745398784,f8b263609a898c5499c07fc9ba7bcd00e46a82e38e73d327331416411a74e117,2020-07-01 20:01:16,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint a[100000];\nint turn(int k,int b)\n{\n    int i = 0;\n    while (k > 0) {\n        a[i++] = k % b;\n        k = k / b;\n    }\n    return i;\n}\nint huiwen(int k)\n{\n    for (int t = 0;t <= k - 1;t++)\n    {\n        if (a[t] != a[k - t - 1]) {\n            return 0;\n        }\n    }\n    return 1;\n}\nint main()\n{\n    int n, num;//n代表要几个数\n    int sum = 0;\n    cin >> n >> num;\n    for (int w = num + 1; n > 0; w++)\n    {\n        for (int b = 2;b <= 10;b++)\n        {\n            if (huiwen(turn(w, b)) == 1)\n                sum = sum + 1;\n            if (sum >=2)\n            {\n                cout << w << endl;\n                n--;\n                sum = 0;\n            }\n\n        }\n        \n    }\n    return 0;\n}\n",WRONG_ANSWER,29,504
1278298332244402176,f8b263609a898c5499c07fc9ba7bcd00e46a82e38e73d327331416411a74e117,2020-07-01 20:04:06,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint a[100000];\nint turn(int k,int b)\n{\n    int i = 0;\n    while (k > 0) {\n        a[i++] = k % b;\n        k = k / b;\n    }\n    return i;\n}\nint huiwen(int k)\n{\n    for (int t = 0;t <= k - 1;t++)\n    {\n        if (a[t] != a[k - t - 1]) {\n            return 0;\n        }\n    }\n    return 1;\n}\nint main()\n{\n    int n, num;//n代表要几个数\n    int sum = 0;\n    cin >> n >> num;\n    for (int w = num + 1; n > 0; w++)\n    {\n        for (int b = 2;b <= 10;b++)\n        {\n            if (huiwen(turn(w, b)) == 1)\n                sum = sum + 1;\n            if (sum >=2)\n            {\n                cout << w << endl;\n                n--;\n                sum = 0;\n            }\n\n        }\n        \n    }\n    return 0;\n}\n",WRONG_ANSWER,35,428
1278299706847854592,f8b263609a898c5499c07fc9ba7bcd00e46a82e38e73d327331416411a74e117,2020-07-01 20:09:34,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string.h>\nusing namespace std;\n\nconst string numbers = \""0123456789\"";   //进制转换\nstring transf(int line, int b)\n{\n    string result = \""\"";\n    int remainder;\n    while (line > 0)\n    {\n        remainder = line % b;\n        result += numbers[remainder];\n        line -= remainder;\n        line /= b;\n    }\n    string reverse(result.rbegin(),result.rend());\n    return reverse;\n}\n\nbool judge(string line) //判断是否回文\n{\n    return line == string(line.rbegin(),line.rend());\n}\n\nbool twomore(int line)  //判断是否在至少两次进制里为回文\n{\n    int basetype = 0;\n    for (int base = 2; base <= 10; base++)\n    {\n        if (judge(transf(line,base)))\n        {\n            basetype++;\n        }\n        if (basetype >= 2)\n        {\n            return true;\n        }\n    }\n    return false;\n}\n\nint main()\n{\n    int N,S;   //N个大于S\n    cin >> N >> S;\n    \n    for (int i = S + 1; N > 0; i++)  //i并没有上限，只需找出前N个符合条件的,有N控制\n    {\n       if (twomore(i))\n       {\n           cout << i << endl;\n           N--;\n       }\n    }\n    return 0;\n}\n\n\n\n",ACCEPTED,40,504
1278301581722705920,d6c412f1e470e1a910b2c1073ff83d69be18589f33470b5e16e31947e1a65809,2020-07-01 20:17:01,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nint com(int num,int b)\n{\n    int result[20];\n    int d=0;\n    while(num!=0)\n    {\n        int c=num%b;\n        result[d]=c;\n        d+=1;\n        num=num/b;\n    }\n    for(int i=0;i<d;i++)\n    {\n        if(result[i]!=result[d-1-i])\n        {\n            return 0;\n        }\n    }\n    return 1;\n}\nint main()\n{\n    int n,s;\n    cin>>n>>s;\n    int count=0;\n    while(count<n)\n    {\n        s+=1;\n        int a=0;\n        for(int j=2;j<=10;j++)\n        {\n            if(com(s,j)==1)\n            {\n                a+=1;\n            }\n        }\n        if(a>=2)\n        {\n            cout<<s<<endl;\n            count+=1;\n        }\n    }\n    return 0;\n}\n",ACCEPTED,38,752
1278305733286748160,4924546fb63091b9dab43d0cb5b4f05ed8bbd5b5328d183d03e901d340ed28be,2020-07-01 20:33:31,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint s[10000];\nvoid Base_conversion(int a,int b)//a转换b进制 \n{\n    int r=0;\n    while(a)\n\t{\n        s[++r]=a%b;\n        a/=b;\n    }\n    s[0]=r;\n}\nbool change()//判断s[i]与s[s[0]+1-i]是否相等 回文\n{   \n    for(int i=1;i<=s[0];i++)\n\t{\n    \tif(s[i]!=s[s[0]+1-i]) \n            return false;\n    }\n    return true;\n}\nint main()\n{\n    int N;//前N个\n    int S;//大于S\n    cin >> N >> S;\n    int i = S + 1;\n    int a=0;//用于统计已有几个数符合要求\n    while (a<N)\n    {\n        int jishu=0;//计数器 满足两个则输出\n        for (int k = 2; k<11; k++)\n        {    \n            Base_conversion(i, k);\n            if (change())\n            {\n                jishu++;\n            }\n        }\n        if (jishu>1)\n        {\n            cout << i << endl;\n            a++;\n        }\n        i++;\n    }\n    return 0;\n}",ACCEPTED,31,512
1278307720216633344,f8b263609a898c5499c07fc9ba7bcd00e46a82e38e73d327331416411a74e117,2020-07-01 20:41:24,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint a[100000];\nint turn(int k,int b)\n{\n    int i = 0;\n    while (k > 0) {\n        a[i++] = k % b;\n        k = k / b;\n    }\n    return i;\n}\n\nint ishuiwen(int k)\n{\n    int i=0,j;\n    while (k>0){\n        a[i]=k%10;\n        k/=10;\n        i++;\n    }\n    for (j=0; j<i; j++){\n        if (a[j]!=a[i-j-1])\n            return 0;\n    }\n    return 1;\n}\n\nint main()\n{\n    int n, num;//n代表要几个数\n    int sum = 0;\n    int count=0;//用来统计个数\n    cin >> n >> num;\n    int w = num + 1;\n    while (count < n) {\n        for (int b = 2;b <= 10;b++)\n        {\n            if (huiwen(turn(w, b)) == 1)\n                sum = sum + 1;\n        }\n        if (sum >=2) {\n            count = count + 1;\n            cout << w << endl;\n        }\n        w = w + 1;\n    }\n   \n}",COMPILE_ERROR,0,0
1278307816186511360,f8b263609a898c5499c07fc9ba7bcd00e46a82e38e73d327331416411a74e117,2020-07-01 20:41:47,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint a[100000];\nint turn(int k,int b)\n{\n    int i = 0;\n    while (k > 0) {\n        a[i++] = k % b;\n        k = k / b;\n    }\n    return i;\n}\n\nint huiwen(int k)\n{\n    int i=0,j;\n    while (k>0){\n        a[i]=k%10;\n        k/=10;\n        i++;\n    }\n    for (j=0; j<i; j++){\n        if (a[j]!=a[i-j-1])\n            return 0;\n    }\n    return 1;\n}\n\nint main()\n{\n    int n, num;//n代表要几个数\n    int sum = 0;\n    int count=0;//用来统计个数\n    cin >> n >> num;\n    int w = num + 1;\n    while (count < n) {\n        for (int b = 2;b <= 10;b++)\n        {\n            if (huiwen(turn(w, b)) == 1)\n                sum = sum + 1;\n        }\n        if (sum >=2) {\n            count = count + 1;\n            cout << w << endl;\n        }\n        w = w + 1;\n    }\n   \n}",PARTIAL_ACCEPTED,35,384
1278308072643026944,f8b263609a898c5499c07fc9ba7bcd00e46a82e38e73d327331416411a74e117,2020-07-01 20:42:48,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint a[100000];\nint turn(int k,int b)\n{\n    int i = 0;\n    while (k > 0) {\n        a[i++] = k % b;\n        k = k / b;\n    }\n    return i;\n}\n\nint huiwen(int k)\n{\n    int i=0,j;\n    while (k>0){\n        a[i]=k%10;\n        k/=10;\n        i++;\n    }\n    for (j=0; j<i; j++){\n        if (a[j]!=a[i-j-1])\n            return 0;\n    }\n    return 1;\n}\n\nint main()\n{\n    int n, num;//n代表要几个数\n    int sum = 0;\n    cin >> n >> num;\n    for (int w = num + 1; n > 0; w++)\n    {\n        for (int b = 2;b <= 10;b++)\n        {\n            if (huiwen(turn(w, b)) == 1)\n                sum = sum + 1;\n            if (sum >=2)\n            {\n                cout << w << endl;\n                n--;\n                sum = 0;\n            }\n\n        }\n        \n    }\n    return 0;\n}",WRONG_ANSWER,29,512
1278308412675260416,f8b263609a898c5499c07fc9ba7bcd00e46a82e38e73d327331416411a74e117,2020-07-01 20:44:10,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string.h>\nusing namespace std;\n\nconst string numbers = \""0123456789\"";   //进制转换\nstring transf(int line, int b)\n{\n    string result = \""\"";\n    int remainder;\n    while (line > 0)\n    {\n        remainder = line % b;\n        result += numbers[remainder];\n        line -= remainder;\n        line /= b;\n    }\n    string reverse(result.rbegin(),result.rend());\n    return reverse;\n}\n\nbool judge(string line) //判断是否回文\n{\n    return line == string(line.rbegin(),line.rend());\n}\n\nbool twomore(int line)  //判断是否在至少两次进制里为回文\n{\n    int basetype = 0;\n    for (int base = 2; base <= 10; base++)\n    {\n        if (judge(transf(line,base)))\n        {\n            basetype++;\n        }\n        if (basetype >= 2)\n        {\n            return true;\n        }\n    }\n    return false;\n}\n\nint main()\n{\n    int N,S;   //N个大于S\n    cin >> N >> S;\n    \n    for (int i = S + 1; N > 0; i++)  //i并没有上限，只需找出前N个符合条件的,有N控制\n    {\n       if (twomore(i))\n       {\n           cout << i << endl;\n           N--;\n       }\n    }\n    return 0;\n}\n\n\n\n",ACCEPTED,35,516
1278309712926269440,9967d355e8ac7fdcfa174a2c7d2c402e8faa3b9970225fbfcd9cd1b16ad2beda,2020-07-01 20:49:20,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint arr[20];\nint B;\nint flag=0;\nint flag1=0\nbool isPal2(int a)\n{\n    for(int B=2;B<=10;B++)\n    {\n        for(flag=0;flag<20;flag++)  //转化为B进制；\n        {\n            arr[flag]=a%B;\n            a /= B;\n            if(a==0)\n                break;\n        }\n        int m=0;\n        for(int i=0;i<=flag;i++)\n            if(arr[i]==arr[flag-i]){m++};\n            if(m==flag)\n                flag1++;\n    }\n    \n    \n    if(flag1<2)\n        return 0;\n    else\n        return 1;\n}\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    int flag0=0;\n    for(int i=S;i;i++)\n    {\n        if(isPal2==1)\n        {\n            cout<<i<<endl;\n            flag0++;\n        }\n        if(flag0>=N)\n            break\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1278309790277632000,9967d355e8ac7fdcfa174a2c7d2c402e8faa3b9970225fbfcd9cd1b16ad2beda,2020-07-01 20:49:38,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint arr[20];\nint B;\nint flag=0;\nint flag1=0;\nbool isPal2(int a)\n{\n    for(int B=2;B<=10;B++)\n    {\n        for(flag=0;flag<20;flag++)  //转化为B进制；\n        {\n            arr[flag]=a%B;\n            a /= B;\n            if(a==0)\n                break;\n        }\n        int m=0;\n        for(int i=0;i<=flag;i++)\n            if(arr[i]==arr[flag-i]){m++};\n            if(m==flag)\n                flag1++;\n    }\n    \n    \n    if(flag1<2)\n        return 0;\n    else\n        return 1;\n}\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    int flag0=0;\n    for(int i=S;i;i++)\n    {\n        if(isPal2==1)\n        {\n            cout<<i<<endl;\n            flag0++;\n        }\n        if(flag0>=N)\n            break\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1278309809986666496,d2d929dca552a2902151cabadf975c515f33ca3b097430cc9be2fe1277254ea5,2020-07-01 20:49:43,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nbool isPalin(int n,int b){\n    int c=0,p=0,s[100];\n    while(n!=0){\n    c=n%b;n=n/b;\n    if(c>10)\n        c=c-55;\n    s[p]=c;p++;\n    }\n\n    for(int i=0;i<=p/2;i++){\n        if(s[i]!=s[p-1-i])\n            return 0;\n    }\n    return 1;\n}\n\nint main(){\n    int B;        //2<=B<=20\n    cin>>B;\n    for(int i=1;i<=300;i++){\n        if(isPalin(i*i,B))\n            cout<<i<<\"" \""<<i*i<<endl;\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,34,512
1278309959798816768,9967d355e8ac7fdcfa174a2c7d2c402e8faa3b9970225fbfcd9cd1b16ad2beda,2020-07-01 20:50:18,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint arr[20];\nint B;\nint flag=0;\nint flag1=0;\nbool isPal2(int a)\n{\n    for(int B=2;B<=10;B++)\n    {\n        for(flag=0;flag<20;flag++)  //转化为B进制；\n        {\n            arr[flag]=a%B;\n            a /= B;\n            if(a==0)\n                break;\n        }\n        int m=0;\n        for(int i=0;i<=flag;i++)\n            if(arr[i]==arr[flag-i]){m++;};\n            if(m==flag)\n                flag1++;\n    }\n    \n    \n    if(flag1<2)\n        return 0;\n    else\n        return 1;\n}\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    int flag0=0;\n    for(int i=S;i;i++)\n    {\n        if(isPal2(i)==1)\n        {\n            cout<<i<<endl;\n            flag0++;\n        }\n        if(flag0>=N)\n            break\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1278310038613975040,9967d355e8ac7fdcfa174a2c7d2c402e8faa3b9970225fbfcd9cd1b16ad2beda,2020-07-01 20:50:37,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint arr[20];\nint B;\nint flag=0;\nint flag1=0;\nbool isPal2(int a)\n{\n    for(int B=2;B<=10;B++)\n    {\n        for(flag=0;flag<20;flag++)  //转化为B进制；\n        {\n            arr[flag]=a%B;\n            a /= B;\n            if(a==0)\n                break;\n        }\n        int m=0;\n        for(int i=0;i<=flag;i++)\n            if(arr[i]==arr[flag-i]){m++;};\n            if(m==flag)\n                flag1++;\n    }\n    \n    \n    if(flag1<2)\n        return 0;\n    else\n        return 1;\n}\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    int flag0=0;\n    for(int i=S;i;i++)\n    {\n        if(isPal2(i)==1)\n        {\n            cout<<i<<endl;\n            flag0++;\n        }\n        if(flag0>=N)\n            break;\n    }\n    return 0;\n}",TIME_LIMIT_EXCEEDED,0,0
1278310916460830720,9967d355e8ac7fdcfa174a2c7d2c402e8faa3b9970225fbfcd9cd1b16ad2beda,2020-07-01 20:54:07,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint arr[20];\nint B;\nint flag=0;\nint flag1=0;\nbool isPal2(int a)\n{\n    for(int B=2;B<=10;B++)\n    {\n        for(flag=0;flag<20;flag++)  //转化为B进制；\n        {\n            arr[flag]=a%B;\n            a /= B;\n            if(a==0)\n                break;\n        }\n        int m=0;\n        for(int i=0;i<=flag;i++)\n            if(arr[i]==arr[flag-i]){m++;};\n            if(m==flag)\n                flag1++;\n    }\n    if(flag1<2)\n        return 0;\n    else\n        return 1;\n}\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    int flag0=0;\n    for(int i=S;;i++)\n    {\n        if(isPal2(i)==1)\n        {\n            cout<<i<<endl;\n            flag0++;\n        }\n        if(flag0>=N)\n            break;\n    }\n    return 0;\n}",TIME_LIMIT_EXCEEDED,0,0
1278312446408720384,d2d929dca552a2902151cabadf975c515f33ca3b097430cc9be2fe1277254ea5,2020-07-01 21:00:11,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nbool isPalin(int n,int b){\n    int c=0,p=0,s[100];\n    while(n!=0){\n    c=n%b;n=n/b;\n    s[p]=c;p++;\n    }\n\n    for(int i=0;i<=p/2;i++){\n        if(s[i]!=s[p-1-i])\n            return 0;\n    }\n    return 1;\n}\n\nint main(){\n    int B;        //2<=B<=20\n    cin>>B;\n    for(int i=1;i<=300;i++){\n        if(isPalin(i*i,B))\n            cout<<i<<\"" \""<<i*i<<endl;\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,37,512
1278312783026774016,9967d355e8ac7fdcfa174a2c7d2c402e8faa3b9970225fbfcd9cd1b16ad2beda,2020-07-01 21:01:32,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint arr[20];\nint B;\nint flag=0;\nint flag1=0;\nbool isPal2(int a)\n{\n    for(int B=2;B<=10;B++)\n    {\n        for(flag=0;flag<20;flag++)  //转化为B进制；\n        {\n            arr[flag]=a%B;\n            a /= B;\n            if(a==0)\n                break;\n        }\n        int m=0;\n        for(int i=0;i<=flag;i++)\n            if(arr[i]==arr[flag-i]){m++;};\n            if(m==flag)\n                flag1++;\n    }\n    if(flag1<2)\n        return 0;\n    else\n        return 1;\n}\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    int flag0=0;\n    for(int i=S;i<100000;i++)\n    {\n        if(isPal2(i)==1)\n        {\n            cout<<i<<endl;\n            flag0++;\n        }\n        if(flag0>=N)\n            break;\n    }\n    return 0;\n}",WRONG_ANSWER,188,384
1278313541298216960,9967d355e8ac7fdcfa174a2c7d2c402e8faa3b9970225fbfcd9cd1b16ad2beda,2020-07-01 21:04:32,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint arr[20];\nint B;\nint flag=0;\nint flag1=0;\nbool isPal2(int a)\n{\n    for(int B=2;B<=10;B++)\n    {\n        for(flag=0;flag<20;flag++)  //转化为B进制；\n        {\n            arr[flag]=a%B;\n            a /= B;\n            if(a==0)\n                break;\n        }\n        int m=0;\n        for(int i=0;i<=flag;i++)\n            if(arr[i]==arr[flag-i]){}\n        flag1++;\n    }\n    if(flag1<2)\n        return 0;\n    else\n        return 1;\n}\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    int flag0=0;\n    for(int i=S+1;i<100000;i++)\n    {\n        if(isPal2(i)==1)\n        {\n            cout<<i<<endl;\n            flag0++;\n        }\n        if(flag0>=N)\n            break;\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,29,424
1278313627872845824,9967d355e8ac7fdcfa174a2c7d2c402e8faa3b9970225fbfcd9cd1b16ad2beda,2020-07-01 21:04:53,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint arr[20];\nint B;\nint flag=0;\nint flag1=0;\nbool isPal2(int a)\n{\n    for(int B=2;B<=10;B++)\n    {\n        for(flag=0;flag<20;flag++)  //转化为B进制；\n        {\n            arr[flag]=a%B;\n            a /= B;\n            if(a==0)\n                break;\n        }\n        for(int i=0;i<=flag;i++)\n            if(arr[i]==arr[flag-i]){}\n        flag1++;\n    }\n    if(flag1<2)\n        return 0;\n    else\n        return 1;\n}\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    int flag0=0;\n    for(int i=S+1;i<100000;i++)\n    {\n        if(isPal2(i)==1)\n        {\n            cout<<i<<endl;\n            flag0++;\n        }\n        if(flag0>=N)\n            break;\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,23,384
1278313750770155520,61312bc99401c99a47863369c930c4a0da059239ef265b7ed69539aa9413279b,2020-07-01 21:05:22,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<cmath>\nusing namespace std;\n//判断B进制下的回文数\nint hh(int b,int ten){\n    int tem=ten*ten;\n    int s1[30];\n    if(tem<b)\n        return 1;\n    int a;\n    for(a=0;tem>0;a++){\n        s1[a]=tem%b;\n        tem=tem/b;\n    }\n    a--;\n    int flag=1;\n    for(int j=0;j<(a+1)/2;j++){\n        if(s1[j]!=s1[a-j])\n            flag=0;\n    }\n    return flag;\n}\n//将十进制转换为B进制\nvoid tran(int b,int num){\n    char s1[30];\n    int a;\n    for(a=0;num>0;a++){\n        if(num%b<10){\n            s1[a]=num%b+'0';\n            num=num/b;\n        }\n        else{\n            s1[a]=num%b-b+'A';\n        }\n    }\n    a--;\n    cout<<s1;\n}\nint main()\n{\n    int B;\n    cin>>B;\n    for(int j=1;j<=300;j++){\n        if(hh(B,j)){\n            tran(B,j);\n            cout<<\"" \"";\n            tran(B,j*j);\n            cout<<endl;\n        }\n    }\n    return 0;\n}\n",MULTIPLE_ERROR,42,536
1278317557759533056,9967d355e8ac7fdcfa174a2c7d2c402e8faa3b9970225fbfcd9cd1b16ad2beda,2020-07-01 21:20:30,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint arr[20];\nint arr0[20];\nint B;\nint flag2=0;\nint flag1=0;\nbool isPal(int a)\n{\n    for(flag2=0;flag2<20;flag2++)  //转化为B进制；\n    {\n        arr0[flag2]=a%B;\n        a /= B;\n        if(a==0)\n            break;\n    }\n    for(int i=0;i<=flag2;i++)\n        if(arr0[i]!=arr0[flag2-i])\n            return 0;\n    return 1;\n}\nbool isPal_num(int a)\n{\n    for(int B=2;B<=10;B++)\n    {\n        if(isPal(a)==1)\n        flag1++;\n    }\n    if(flag1<2)\n        return 0;\n    else\n        return 1;\n    \n}\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    int flag0=0;\n    for(int i=S+1;i<100000;i++)\n    {\n        if(isPal2(i)==1)\n        {\n            cout<<i<<endl;\n            flag0++;\n        }\n        if(flag0>=N)\n            break;\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1278317621013839872,9967d355e8ac7fdcfa174a2c7d2c402e8faa3b9970225fbfcd9cd1b16ad2beda,2020-07-01 21:20:45,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint arr[20];\nint arr0[20];\nint B;\nint flag2=0;\nint flag1=0;\nbool isPal(int a)\n{\n    for(flag2=0;flag2<20;flag2++)  //转化为B进制；\n    {\n        arr0[flag2]=a%B;\n        a /= B;\n        if(a==0)\n            break;\n    }\n    for(int i=0;i<=flag2;i++)\n        if(arr0[i]!=arr0[flag2-i])\n            return 0;\n    return 1;\n}\nbool isPal_num(int a)\n{\n    for(int B=2;B<=10;B++)\n    {\n        if(isPal(a)==1)\n        flag1++;\n    }\n    if(flag1<2)\n        return 0;\n    else\n        return 1;\n    \n}\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    int flag0=0;\n    for(int i=S+1;i<100000;i++)\n    {\n        if(isPal_num(i)==1)\n        {\n            cout<<i<<endl;\n            flag0++;\n        }\n        if(flag0>=N)\n            break;\n    }\n    return 0;\n}",FLOAT_POINT_EXCEPTION,35,492
1278317819538628608,9967d355e8ac7fdcfa174a2c7d2c402e8faa3b9970225fbfcd9cd1b16ad2beda,2020-07-01 21:21:32,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint arr[20];\nint arr0[20];\nint B;\nint flag2=0;\nint flag1=0;\nbool isPal(int a)\n{\n    for(flag2=0;flag2<20;flag2++)  //转化为B进制；\n    {\n        arr0[flag2]=a%B;\n        a /= B;\n        if(a==0)\n            break;\n    }\n    for(int i=0;i<=flag2;i++)\n        if(arr0[i]!=arr0[flag2-i])\n            return 0;\n    return 1;\n}\nbool isPal_num(int a)\n{\n    for(B=2;B<=10;B++)\n    {\n        if(isPal(a)==1)\n        flag1++;\n    }\n    if(flag1<2)\n        return 0;\n    else\n        return 1;\n    \n}\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    int flag0=0;\n    for(int i=S+1;i<100000;i++)\n    {\n        if(isPal_num(i)==1)\n        {\n            cout<<i<<endl;\n            flag0++;\n        }\n        if(flag0>=N)\n            break;\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,35,492
1278318124565200896,d2d929dca552a2902151cabadf975c515f33ca3b097430cc9be2fe1277254ea5,2020-07-01 21:22:45,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\n\n\n//char jinzhi[]{'1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nbool isPalin(int n,int b){\n    int c=0,p=0;\n    char s[100],temp;\n    while(n!=0){\n    c=n%b;n=n/b;\n    if(c>=10)\n       temp=char(c+55);\n    else\n        temp=char(48+c);\n    s[p]=c;p++;\n    }\n\n    for(int i=0;i<=p/2;i++){\n        if(s[i]!=s[p-1-i])\n            return 0;\n    }\n    return 1;\n}\n\n\nint main(){\n    int B;        //2<=B<=20\n    cin>>B;\n    for(int i=1;i<=300;i++){\n        if(isPalin(i*i,B))\n            cout<<i<<\"" \""<<i*i<<endl;\n    }\n    return 0;\n}\n\n\n",PARTIAL_ACCEPTED,42,424
1278318858543235072,4ce7ba740c5929f384ea0de1729308dc466f20e96016479bf1a8661fb338d68c,2020-07-01 21:25:40,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstdio>\n#include<string>\nusing namespace std;\nint n;\nchar letter[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nstring binary(int a,int b)//将十进制数转换 \n{\n\tstring s1=\"" \"";\n\twhile(a) \n\t{\n\t\ts1+=letter[a%b];\n\t\ta/=b;\n\t}\n\tstring s2=\"" \"";//逆序输出 \n\tfor(int j=s1.length()-1;j>=0;j--)\n\t{\n\t\ts2+=s1[j];\n\t}\n\treturn s2;\n}\nbool reverse_i(string c)\n{\n\tstring s3;\n\tfor(int i=c.length()-1;i>=0;i--)\n\t{\n\t\ts3+=c[i];\n\t}\n\tif(s3==c)\n\t{\n\t\treturn true;\n\t}\t\n\telse\n\t{\n\t\treturn false;\t\n\t}\n}\nint main()\n{\n\tcin>>n;\n\tfor(int i=1;i<=300;i++)\n\t{\n\t\tstring i1=binary(i,n);\n\t\tstring i2=binary(i*i,n);\n\t\tif(reverse_i(i2))\n\t\t{\n\t\t\tcout<<i1<<' '<<i2<<endl;\n\t\t}\n\t}\n\treturn 0;\n}",PRESENTATION_ERROR,41,384
1278319188123254784,4ce7ba740c5929f384ea0de1729308dc466f20e96016479bf1a8661fb338d68c,2020-07-01 21:26:59,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstdio>\n#include<string>\nusing namespace std;\nint n;\nchar letter[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nstring binary(int a,int b)//将十进制数转换 \n{\n\tstring s1;\n\twhile(a) \n\t{\n\t\ts1+=letter[a%b];\n\t\ta/=b;\n\t}\n\tstring s2;//逆序输出 \n\tfor(int j=s1.length()-1;j>=0;j--)\n\t{\n\t\ts2+=s1[j];\n\t}\n\treturn s2;\n}\nbool reverse_i(string c)\n{\n\tstring s3;\n\tfor(int i=c.length()-1;i>=0;i--)\n\t{\n\t\ts3+=c[i];\n\t}\n\tif(s3==c)\n\t{\n\t\treturn true;\n\t}\t\n\telse\n\t{\n\t\treturn false;\t\n\t}\n}\nint main()\n{\n\tcin>>n;\n\tfor(int i=1;i<=300;i++)\n\t{\n\t\tstring i1=binary(i,n);\n\t\tstring i2=binary(i*i,n);\n\t\tif(reverse_i(i2))\n\t\t{\n\t\t\tcout<<i1<<' '<<i2<<endl;\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,42,512
1278321732199317504,d2d929dca552a2902151cabadf975c515f33ca3b097430cc9be2fe1277254ea5,2020-07-01 21:37:05,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nbool isPalin(int n,int b){\n    int c=0,p=0;\n    char s[100],temp;\n    while(n!=0){\n    c=n%b;n=n/b;\n    if(c>=10)\n       temp=char(c+55);\n    else\n        temp=char(48+c);\n    s[p]=c;p++;\n    }\n\n    for(int i=0;i<=p/2;i++){\n        if(s[i]!=s[p-1-i])\n            return 0;\n    }\n    return 1;\n}\n\nvoid Trans(int n,int b){\n    int c=0,p=0,s[100];\n    while(n!=0){\n        c=n%b;n=n/b;\n        s[p]=c;p++;\n    }\n    for(int i=0;i<p;i++){\n        if(s[i]>=10)\n            cout<<char(s[i]+55);\n        else\n            cout<<s[i];\n    }\n}\nint main(){\n    int B;        //2<=B<=20\n    cin>>B;\n    for(int i=1;i<=300;i++){\n        if(isPalin(i*i,B)){\n            Trans(i,B);cout<<\"" \"";Trans(i*i,B);\n            cout<<endl;\n        }\n\n    }\n    return 0;\n}\n\n\n",PARTIAL_ACCEPTED,33,512
1278321952467386368,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-01 21:37:58,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint a[100000];\nint turn(int k,int b)\n{\n    int i = 0;\n    while (k > 0) {\n        a[i++] = k % b;\n        k = k / b;\n    }\n    return i;\n}\nint huiwen(int k)\n{\n    for (int t = 0;t <= k - 1;t++)\n    {\n        if (a[t] != a[k - t - 1]) {\n            return 0;\n        }\n    }\n    return 1;\n}\nint main()\n{\n    int n, num;//n代表要几个数\n    int sum = 0;\n    int count=0;//用来统计个数\n    cin >> n >> num;\n    int w = num;\n    while (count < n) {\n        for (int b = 2;b <= 10;b++)\n        {\n            int c=huiwen(turn(w,b));\n            if (c == 1)\n                sum = sum + 1;\n            if (sum >=2) {\n                count = count + 1;\n                cout << w << endl;\n             }\n        }\n        \n        w = w + 1;\n    }\n   \n}",WRONG_ANSWER,35,424
1278322335021457408,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-01 21:39:29,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint a[100000];\nint turn(int k,int b)\n{\n    int i = 0;\n    while (k > 0) {\n        a[i++] = k % b;\n        k = k / b;\n    }\n    return i;\n}\nint huiwen(int k)\n{\n    for (int t = 0;t <= k - 1;t++)\n    {\n        if (a[t] != a[k - t - 1]) {\n            return 0;\n        }\n    }\n    return 1;\n}\nint main()\n{\n    int n, num;//n代表要几个数\n    int sum = 0;\n    int count=0;//用来统计个数\n    cin >> n >> num;\n    int w = num+1;\n    while (count < n) {\n        for (int b = 2;b <= 10;b++)\n        {\n            int c=huiwen(turn(w,b));\n            if (c == 1)\n                sum = sum + 1;\n        }\n         if (sum >=2) {\n                count = count + 1;\n                cout << w << endl;\n             }\n        w = w + 1;\n    }\n   \n}",PARTIAL_ACCEPTED,40,512
1278322802430509056,d88d225f43d9cfbcbfaac4d153ebbce3b46be197d9270ee56c5be60033fcdfc9,2020-07-01 21:41:20,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <stdio.h>\n#include <cstdlib>\n#include <string.h>\nusing namespace std;\nint symm(char *m );\nint main()\n{\n    int n;\n    cin >> n; // base system which you want input\n    for(int i = 1 ; i <= 300 ; i ++)\n    {\n        char str[100];\n        char str1[100];\n        _itoa(i,str,n);\n        _itoa(i*i,str1,n);\n        if(symm(str1)== 1)\n        {\n            cout << str << \"" \"" << str1 << endl;\n        }\n        \n    }\n    return 0;\n}\n\nint symm(char *m)\n{\n    char n[100];\n    for(int i = 0; i < 100 ; i++)\n    {\n        n[i] = m[i];\n    }\n    strrev(m);\n    if(strcmp(n,m)==0)\n    {\n        return 1;\n    }\n    else\n    {\n        return 0;\n    }\n    \n}",COMPILE_ERROR,0,0
1278322869254152192,d2d929dca552a2902151cabadf975c515f33ca3b097430cc9be2fe1277254ea5,2020-07-01 21:41:36,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nbool isPalin(int n,int b){\n    int c=0,p=0;\n    char s[100],temp;\n    while(n!=0){\n    c=n%b;n=n/b;\n    if(c>=10)\n       temp=char(c+55);\n    else\n        temp=char(48+c);\n    s[p]=c;p++;\n    }\n\n    for(int i=0;i<=p/2;i++){\n        if(s[i]!=s[p-1-i])\n            return 0;\n    }\n    return 1;\n}\n\nvoid Trans1(int n,int b){\n    int c=0,p=0,s[100];\n    while(n!=0){\n        c=n%b;n=n/b;\n        s[p]=c;p++;\n    }\n    for(int i=p-1;i>=0;i--){\n        if(s[i]>=10)\n            cout<<char(s[i]+55);\n        else\n            cout<<s[i];\n    }\n}\nvoid Trans2(int n,int b){\n    int c=0,p=0,s[100];\n    while(n!=0){\n        c=n%b;n=n/b;\n        s[p]=c;p++;\n    }\n    for(int i=0;i<p;i++){\n        if(s[i]>=10)\n            cout<<char(s[i]+55);\n        else\n            cout<<s[i];\n    }\n}\nint main(){\n    int B;        //2<=B<=20\n    cin>>B;\n    for(int i=1;i<=300;i++){\n        if(isPalin(i*i,B)){\n            Trans1(i,B);cout<<\"" \"";Trans2(i*i,B);\n            cout<<endl;\n        }\n\n    }\n    return 0;\n}\n\n\n",ACCEPTED,41,512
1278325237974761472,d88d225f43d9cfbcbfaac4d153ebbce3b46be197d9270ee56c5be60033fcdfc9,2020-07-01 21:51:01,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <stdio.h>\n#include <cstdlib>\n#include <string.h>\nusing namespace std;\nint symm(char *m );\nint main()\n{\n    int n;\n    cin >> n; // base system which you want input\n    for(int i = 1 ; i <= 300 ; i ++)\n    {\n        char str[100];\n        char str1[100];\n        itoa(i,str,n);\n        itoa(i*i,str1,n);\n        if(symm(str1)== 1)\n        {\n            cout << str << \"" \"" << str1 << endl;\n        }\n        \n    }\n    return 0;\n}\n\nint symm(char *m)\n{\n    char n[100];\n    for(int i = 0; i < 100 ; i++)\n    {\n        n[i] = m[i];\n    }\n    strrev(m);\n    if(strcmp(n,m)==0)\n    {\n        return 1;\n    }\n    else\n    {\n        return 0;\n    }\n    \n}",COMPILE_ERROR,0,0
1278325422918393856,01f50ffc209f82995ec8d4f563715f38ce803ff397ed7b3d7119dc6dbc0ad632,2020-07-01 21:51:45,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<stdio.h>\nusing namespace std;\n\n\nint jinzhi(int N,int x){\n    int n=0,m=0;\n    int X=x*x;\n    int a[50],b[50];\n\n    //转换进制\n    while(x!=0){\n        b[m++]=x%N;\n        x=x/N;\n    }\n    while(X!=0){\n        a[n++]=X%N;\n        X=X/N;\n    }\n    //回文\n    int flag1 = 1;\n    int i=0;\n    for(i=0;i<n/2;i++){\n        if(a[i]!=a[n-i-1]){\n            flag1= 0;\n            break;\n        }\n        else\n            flag1 = 1;\n    }\n\n    if(flag1==1){\n        for( i=m-1;i>0;i--)\n            printf(\""%d\"",b[i]);\n        printf(\""%d \"",b[i]);\n\n        for( i=0;i<n-1;i++)\n            printf(\""%d\"",a[i]);\n        printf(\""%d\\n\"",a[i]);\n    }\n}\n\nint main(){\n    int N,i;\n    cin>>N;\n    for(i=1;i<=300;i++){\n        jinzhi(N,i);\n    }\n}\n",PARTIAL_ACCEPTED,33,424
1278325577113591808,01f50ffc209f82995ec8d4f563715f38ce803ff397ed7b3d7119dc6dbc0ad632,2020-07-01 21:52:22,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<stdio.h>\nusing namespace std;\n\n\nint jinzhi(int N,int x){\n    int n=0,m=0;\n    int X=x*x;\n    int a[100],b[100];\n\n    //转换进制\n    while(x!=0){\n        b[m++]=x%N;\n        x=x/N;\n    }\n    while(X!=0){\n        a[n++]=X%N;\n        X=X/N;\n    }\n    //回文\n    int flag1 = 1;\n    int i=0;\n    for(i=0;i<n/2;i++){\n        if(a[i]!=a[n-i-1]){\n            flag1= 0;\n            break;\n        }\n        else\n            flag1 = 1;\n    }\n\n    if(flag1==1){\n        for( i=m-1;i>0;i--)\n            printf(\""%d\"",b[i]);\n        printf(\""%d \"",b[i]);\n\n        for( i=0;i<n-1;i++)\n            printf(\""%d\"",a[i]);\n        printf(\""%d\\n\"",a[i]);\n    }\n}\n\nint main(){\n    int N,i;\n    cin>>N;\n    for(i=1;i<=300;i++){\n        jinzhi(N,i);\n    }\n}\n",PARTIAL_ACCEPTED,40,384
1278328857097076736,4ce7ba740c5929f384ea0de1729308dc466f20e96016479bf1a8661fb338d68c,2020-07-01 22:05:24,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstdio>\n#include<string>\nusing namespace std;\nint n;\nint s;\nchar letter[10]={'0','1','2','3','4','5','6','7','8','9'};\nstring binary(int a,int b)//将十进制数转换 \n{\n\tstring s1;\n\twhile(a) \n\t{\n\t\ts1+=letter[a%b];\n\t\ta/=b;\n\t}\n\tstring s2;//逆序输出 \n\tfor(int j=s1.length()-1;j>=0;j--)\n\t{\n\t\ts2+=s1[j];\n\t}\n\treturn s2;\n}\nbool reverse_i(string c)\n{\n\tstring s3;\n\tfor(int i=c.length()-1;i>=0;i--)\n\t{\n\t\ts3+=c[i];\n\t}\n\tif(s3==c)\n\t{\n\t\treturn true;\n\t}\t\n\telse\n\t{\n\t\treturn false;\t\n\t}\n}\nint main()\n{\n\tcin>>n;\n\tcin>>s;\n\tint flag=0;\n\tint count=0;\n\tfor(int i=s+1;i<=10000;i++)\n\t{\n\t\tfor(int p=2;p<=10;p++)\n\t\t{\n\t\t\tstring i1=binary(i,p);\n\t\t\tif(reverse_i(i1))\n\t\t\t{\n\t\t\t\tflag++;\n\t\t\t}\n\t\t}\n\t\tif(flag>=2)\n\t\t{\n\t\t\tcount++;\n\t\t\tif(count<=n)\n\t\t\t{\n\t\t\t\tcout<<i<<endl;\n\t\t\t}\n\t\t\telse\n\t\t\t\tbreak;\n\t\t\t \n\t\t}\n\t\t\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,35,492
1278331372500877312,4ce7ba740c5929f384ea0de1729308dc466f20e96016479bf1a8661fb338d68c,2020-07-01 22:15:24,C++,60.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstdio>\n#include<string>\nusing namespace std;\nint n;\nint s;\nchar letter[10]={'0','1','2','3','4','5','6','7','8','9'};\nstring binary(int a,int b)//将十进制数转换 \n{\n\tstring s1;\n\twhile(a) \n\t{\n\t\ts1+=letter[a%b];\n\t\ta/=b;\n\t}\n\tstring s2;//逆序输出 \n\tfor(int j=s1.length()-1;j>=0;j--)\n\t{\n\t\ts2+=s1[j];\n\t}\n\treturn s2;\n}\nbool reverse_i(string c)\n{\n\tstring s3;\n\tfor(int i=c.length()-1;i>=0;i--)\n\t{\n\t\ts3+=c[i];\n\t}\n\tif(s3==c)\n\t{\n\t\treturn true;\n\t}\t\n\telse\n\t{\n\t\treturn false;\t\n\t}\n}\nint main()\n{\n\tcin>>n;\n\tcin>>s;\n\t\n\tint count=0;\n\tfor(int i=s+1;i<10000;i++)\n\t{\n\t\tint flag=0;\n\t\tfor(int p=2;p<=10;p++)\n\t\t{\n\t\t\tstring i1=binary(i,p);\n\t\t\tif(reverse_i(i1))\n\t\t\t{\n\t\t\t\tflag++;\n\t\t\t}\n\t\t}\n\t\tif(flag>=2)\n\t\t{\n\t\t\tcount++;\n\t\t\tif(count<=n)\n\t\t\t{\n\t\t\t\tcout<<i<<endl;\n\t\t\t}\n\t\t\telse\n\t\t\t\tbreak;\n\t\t\t \n\t\t}\n\t\t\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,28,424
1278331827775791104,4ce7ba740c5929f384ea0de1729308dc466f20e96016479bf1a8661fb338d68c,2020-07-01 22:17:12,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstdio>\n#include<string>\nusing namespace std;\nint n;\nint s;\nchar letter[10]={'0','1','2','3','4','5','6','7','8','9'};\nstring binary(int a,int b)//将十进制数转换 \n{\n\tstring s1;\n\twhile(a) \n\t{\n\t\ts1+=letter[a%b];\n\t\ta/=b;\n\t}\n\tstring s2;//逆序输出 \n\tfor(int j=s1.length()-1;j>=0;j--)\n\t{\n\t\ts2+=s1[j];\n\t}\n\treturn s2;\n}\nbool reverse_i(string c)\n{\n\tstring s3;\n\tfor(int i=c.length()-1;i>=0;i--)\n\t{\n\t\ts3+=c[i];\n\t}\n\tif(s3==c)\n\t{\n\t\treturn true;\n\t}\t\n\telse\n\t{\n\t\treturn false;\t\n\t}\n}\nint main()\n{\n\tcin>>n;\n\tcin>>s;\n\t\n\tint count=0;\n\tfor(int i=s+1;i<20000;i++)\n\t{\n\t\tint flag=0;\n\t\tfor(int p=2;p<=10;p++)\n\t\t{\n\t\t\tstring i1=binary(i,p);\n\t\t\tif(reverse_i(i1))\n\t\t\t{\n\t\t\t\tflag++;\n\t\t\t}\n\t\t}\n\t\tif(flag>=2)\n\t\t{\n\t\t\tcount++;\n\t\t\tif(count<=n)\n\t\t\t{\n\t\t\t\tcout<<i<<endl;\n\t\t\t}\n\t\t\telse\n\t\t\t\tbreak;\n\t\t\t \n\t\t}\n\t\t\n\t}\n\treturn 0;\n}",ACCEPTED,28,432
1278332031556050944,d72ecca80e3b6a9e8d1d9ff1ba8175a5258dc79a213daa46397a30413c75ed27,2020-07-01 22:18:01,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nint B;\nint arr[100];\nvoid exchange(int x)\n{\n    int m=0;\n    while(x)\n    {\n        arr[++m]=x%B;\n        x=x/B;\n    }\n    for(int i=m;i>=1;i--)\n    {\n        if(arr[i]>9)\n        {\n            arr[i]=i-10+'A';\n            char arr[i];\n            cout<<arr[i];\n        }\n        else\n        {\n            cout<<arr[i];\n        }\n    }\n}\nbool huiwen(int x)\n{\n    int m=0;\n    x=x*x;\n    while(x)\n    {\n        arr[++m]=x%B;\n        x/=B;\n    }\n    for(int i=1,j=m;i<j;i++,j--)\n        if(arr[i]!=arr[j])\n            return 0;\n    return 1;\n}\nint main()\n{\n    cin>>B;\n    for(int i=1;i<=300;i++)\n    {\n        if(huiwen(i))\n        {\n            exchange(i);\n            cout<<\"" \"";\n            exchange(i*i);\n            cout<<endl;\n        }\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,32,384
1278332619916238848,01f50ffc209f82995ec8d4f563715f38ce803ff397ed7b3d7119dc6dbc0ad632,2020-07-01 22:20:21,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<stdio.h>\nusing namespace std;\n\n\nint jinzhi(int N,int x){\n    int n=0,m=0;\n    int X=x*x;\n    int a[50],b[50];\n\n    //转换进制\n    while(x!=0){\n        b[m++]=x%N;\n        x=x/N;\n    }\n    while(X!=0){\n        a[n++]=X%N;\n        X=X/N;\n    }\n    //回文\n    int flag1 = 1;\n    int i=0;\n    for(i=0;i<n/2;i++){\n        if(a[i]!=a[n-i-1]){\n            flag1= 0;\n            break;\n        }\n        else\n            flag1 = 1;\n    }\n\n    for(int o=0;o<n;o++){\n        switch(a[0]){\n        case 10:\n            b[o] = 'A';\n            break;\n        case 11:\n            b[o] = 'B';\n            break;\n        case 12:\n            b[o] = 'C';\n            break;\n        case 13:\n            b[o] = 'D';\n            break;\n        case 14:\n            b[o] = 'E';\n            break;\n        case 15:\n            b[o] = 'F';\n            break;\n        case 16:\n            b[o] = 'G';\n            break;\n        case 17:\n            b[o] = 'H';\n            break;\n        case 18:\n            b[o] = 'I';\n            break;\n        case 19:\n            b[o] = 'J';\n            break;\n        }\n    }\n    for(int o=0;o<m;o++){\n        switch(b[0]){\n        case 10:\n            b[o] = 'A';\n            break;\n        case 11:\n            b[o] = 'B';\n            break;\n        case 12:\n            b[o] = 'C';\n            break;\n        case 13:\n            b[o] = 'D';\n            break;\n        case 14:\n            b[o] = 'E';\n            break;\n        case 15:\n            b[o] = 'F';\n            break;\n        case 16:\n            b[o] = 'G';\n            break;\n        case 17:\n            b[o] = 'H';\n            break;\n        case 18:\n            b[o] = 'I';\n            break;\n        case 19:\n            b[o] = 'J';\n            break;\n        }\n    }\n\n    if(flag1==1){\n        for( i=m-1;i>0;i--)\n            if(b[i]>9)\n                cout <<char(b[i]);\n            else\n                cout << b[i];\n        cout << b[i]<<\"" \"";\n\n        for( i=0;i<n-1;i++)\n            if(a[i]>9)\n                cout <<char(a[i]);\n            else\n                cout << a[i];\n        cout << a[i]<<\""\\n\"";\n    }\n}\n\nint main(){\n    int N,i;\n    cin>>N;\n    for(i=1;i<=300;i++){\n        jinzhi(N,i);\n    }\n}\n",PARTIAL_ACCEPTED,43,420
1278333258280919040,01f50ffc209f82995ec8d4f563715f38ce803ff397ed7b3d7119dc6dbc0ad632,2020-07-01 22:22:53,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<stdio.h>\nusing namespace std;\n\n\nint jinzhi(int N,int x){\n    int n=0,m=0;\n    int X=x*x;\n    int a[50],b[50];\n\n    //转换进制\n    while(x!=0){\n        b[m++]=x%N;\n        x=x/N;\n    }\n    while(X!=0){\n        a[n++]=X%N;\n        X=X/N;\n    }\n    //回文\n    int flag1 = 1;\n    int i=0;\n    for(i=0;i<n/2;i++){\n        if(a[i]!=a[n-i-1]){\n            flag1= 0;\n            break;\n        }\n        else\n            flag1 = 1;\n    }\n/*\n    for(int o=0;o<n;o++){\n        switch(a[0]){\n        case 10:\n            b[o] = 'A';\n            break;\n        case 11:\n            b[o] = 'B';\n            break;\n        case 12:\n            b[o] = 'C';\n            break;\n        case 13:\n            b[o] = 'D';\n            break;\n        case 14:\n            b[o] = 'E';\n            break;\n        case 15:\n            b[o] = 'F';\n            break;\n        case 16:\n            b[o] = 'G';\n            break;\n        case 17:\n            b[o] = 'H';\n            break;\n        case 18:\n            b[o] = 'I';\n            break;\n        case 19:\n            b[o] = 'J';\n            break;\n        }\n    }\n    for(int o=0;o<m;o++){\n        switch(b[0]){\n        case 10:\n            b[o] = 'A';\n            break;\n        case 11:\n            b[o] = 'B';\n            break;\n        case 12:\n            b[o] = 'C';\n            break;\n        case 13:\n            b[o] = 'D';\n            break;\n        case 14:\n            b[o] = 'E';\n            break;\n        case 15:\n            b[o] = 'F';\n            break;\n        case 16:\n            b[o] = 'G';\n            break;\n        case 17:\n            b[o] = 'H';\n            break;\n        case 18:\n            b[o] = 'I';\n            break;\n        case 19:\n            b[o] = 'J';\n            break;\n        }\n    }\n*/\n    if(flag1==1){\n        for( i=m-1;i>0;i--)\n            if(b[i]>9)\n                cout <<char(b[i]);\n            else\n                cout << b[i];\n        cout << b[i]<<\"" \"";\n\n        for( i=0;i<n-1;i++)\n            if(a[i]>9)\n                cout <<char(a[i]);\n            else\n                cout << a[i];\n        cout << a[i]<<\""\\n\"";\n    }\n}\n\nint main(){\n    int N,i;\n    cin>>N;\n    for(i=1;i<=300;i++){\n        jinzhi(N,i);\n    }\n}\n",PARTIAL_ACCEPTED,36,624
1278333403613552640,01f50ffc209f82995ec8d4f563715f38ce803ff397ed7b3d7119dc6dbc0ad632,2020-07-01 22:23:28,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<stdio.h>\nusing namespace std;\n\n\nint jinzhi(int N,int x){\n    int n=0,m=0;\n    int X=x*x;\n    int a[50],b[50];\n\n    //转换进制\n    while(x!=0){\n        b[m++]=x%N;\n        x=x/N;\n    }\n    while(X!=0){\n        a[n++]=X%N;\n        X=X/N;\n    }\n    //回文\n    int flag1 = 1;\n    int i=0;\n    for(i=0;i<n/2;i++){\n        if(a[i]!=a[n-i-1]){\n            flag1= 0;\n            break;\n        }\n        else\n            flag1 = 1;\n    }\n/*\n    for(int o=0;o<n;o++){\n        switch(a[0]){\n        case 10:\n            b[o] = 'A';\n            break;\n        case 11:\n            b[o] = 'B';\n            break;\n        case 12:\n            b[o] = 'C';\n            break;\n        case 13:\n            b[o] = 'D';\n            break;\n        case 14:\n            b[o] = 'E';\n            break;\n        case 15:\n            b[o] = 'F';\n            break;\n        case 16:\n            b[o] = 'G';\n            break;\n        case 17:\n            b[o] = 'H';\n            break;\n        case 18:\n            b[o] = 'I';\n            break;\n        case 19:\n            b[o] = 'J';\n            break;\n        }\n    }\n    for(int o=0;o<m;o++){\n        switch(b[0]){\n        case 10:\n            b[o] = 'A';\n            break;\n        case 11:\n            b[o] = 'B';\n            break;\n        case 12:\n            b[o] = 'C';\n            break;\n        case 13:\n            b[o] = 'D';\n            break;\n        case 14:\n            b[o] = 'E';\n            break;\n        case 15:\n            b[o] = 'F';\n            break;\n        case 16:\n            b[o] = 'G';\n            break;\n        case 17:\n            b[o] = 'H';\n            break;\n        case 18:\n            b[o] = 'I';\n            break;\n        case 19:\n            b[o] = 'J';\n            break;\n        }\n    }\n*/\n    if(flag1==1){\n        for( i=m-1;i>0;i--)\n            if(b[i]>9)\n                cout <<char(b[i]-10+'A');\n            else\n                cout << b[i];\n        cout << b[i]<<\"" \"";\n\n        for( i=0;i<n-1;i++)\n            if(a[i]>9)\n                cout <<char(a[i]-10+'A');\n            else\n                cout << a[i];\n        cout << a[i]<<\""\\n\"";\n    }\n}\n\nint main(){\n    int N,i;\n    cin>>N;\n    for(i=1;i<=300;i++){\n        jinzhi(N,i);\n    }\n}\n",PARTIAL_ACCEPTED,43,512
1278333411695976448,769a5633f3f76c88163c10ba96b281ae92c033baa24697a766f3d547fe850076,2020-07-01 22:23:30,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\n\nint main() {\n\tint B;\n\tcin >> B;                                         //十进制数\n\tint number[20], count{ 0 }, temp{ 0 };             //储存转换后数字\n\n\tfor (int i{ 1 }; i < 301; i++) {                     \n\t\ttemp = i;\n\t\twhile (temp != 0) {                      //进制转换（转换后为倒序\n\t\t\tnumber[count] = temp % B;\n\t\t\ttemp /= B;\n\t\t\tcount++;\n\t\t}\n\n\t\tint size{ count };\n\t\tint half = size / 2;\n\t\tfor (int j{ 0 }; j < half; j++) {\n\t\t\tif (number[j] != number[size - j - 1]) {       //碰到位置对称且不相同的数则算下一个数\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\twhile (half = j + 1) {                    //比到中间位置时还一样则输出\n\t\t\t\tcout << i << \"" \"";\n\t\t\t\tfor (int k{ 0 }; k < size; k++) {\n\t\t\t\t\tif (number[k] < 10) {              //小于10输出数字\n\t\t\t\t\t\tcout << number[k] + '0';\n\t\t\t\t\t}\n\t\t\t\t\telse {                            //大于10输出大写字母\n\t\t\t\t\t\tchar c = number[k] - 10 + 'A';\n\t\t\t\t\t\tcout << c;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}",TIME_LIMIT_EXCEEDED,0,0
1278334034537545728,01f50ffc209f82995ec8d4f563715f38ce803ff397ed7b3d7119dc6dbc0ad632,2020-07-01 22:25:58,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<stdio.h>\nusing namespace std;\n\n\nint jinzhi(int N,int x){\n    int n=0,m=0;\n    int X=x*x;\n    int a[50],b[50];\n\n    //转换进制\n    while(x!=0){\n        b[m++]=x%N;\n        x=x/N;\n    }\n    while(X!=0){\n        a[n++]=X%N;\n        X=X/N;\n    }\n    //回文\n    int flag1 = 1;\n    int i=0;\n    for(i=0;i<n/2;i++){\n        if(a[i]!=a[n-i-1]){\n            flag1= 0;\n            break;\n        }\n        else\n            flag1 = 1;\n    }\n/*\n    for(int o=0;o<n;o++){\n        switch(a[0]){\n        case 10:\n            b[o] = 'A';\n            break;\n        case 11:\n            b[o] = 'B';\n            break;\n        case 12:\n            b[o] = 'C';\n            break;\n        case 13:\n            b[o] = 'D';\n            break;\n        case 14:\n            b[o] = 'E';\n            break;\n        case 15:\n            b[o] = 'F';\n            break;\n        case 16:\n            b[o] = 'G';\n            break;\n        case 17:\n            b[o] = 'H';\n            break;\n        case 18:\n            b[o] = 'I';\n            break;\n        case 19:\n            b[o] = 'J';\n            break;\n        }\n    }\n    for(int o=0;o<m;o++){\n        switch(b[0]){\n        case 10:\n            b[o] = 'A';\n            break;\n        case 11:\n            b[o] = 'B';\n            break;\n        case 12:\n            b[o] = 'C';\n            break;\n        case 13:\n            b[o] = 'D';\n            break;\n        case 14:\n            b[o] = 'E';\n            break;\n        case 15:\n            b[o] = 'F';\n            break;\n        case 16:\n            b[o] = 'G';\n            break;\n        case 17:\n            b[o] = 'H';\n            break;\n        case 18:\n            b[o] = 'I';\n            break;\n        case 19:\n            b[o] = 'J';\n            break;\n        }\n    }\n*/\n    if(flag1==1){\n        for( i=m-1;i>0;i--)\n            if(b[i]>9)\n                printf(\""%c\"",a[i]-10+'A');\n            else\n                cout << b[i];\n        cout << b[i]<<\"" \"";\n\n        for( i=0;i<n-1;i++)\n            if(a[i]>9)\n                printf(\""%c\"",a[i]-10+'A');\n            else\n                cout << a[i];\n        cout << a[i]<<\""\\n\"";\n    }\n}\n\nint main(){\n    int N,i;\n    cin>>N;\n    for(i=1;i<=300;i++){\n        jinzhi(N,i);\n    }\n}\n",PARTIAL_ACCEPTED,38,384
1278334275928129536,01f50ffc209f82995ec8d4f563715f38ce803ff397ed7b3d7119dc6dbc0ad632,2020-07-01 22:26:56,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<stdio.h>\nusing namespace std;\n\n\nint jinzhi(int N,int x){\n    int n=0,m=0;\n    int X=x*x;\n    int a[50],b[50];\n\n    //转换进制\n    while(x!=0){\n        b[m++]=x%N;\n        x=x/N;\n    }\n    while(X!=0){\n        a[n++]=X%N;\n        X=X/N;\n    }\n    //回文\n    int flag1 = 1;\n    int i=0;\n    for(i=0;i<n/2;i++){\n        if(a[i]!=a[n-i-1]){\n            flag1= 0;\n            break;\n        }\n        else\n            flag1 = 1;\n    }\n    \n    if(flag1==1){\n        for( i=m-1;i>0;i--)\n            if(b[i]>9)\n                printf(\""%c\"",b[i]-10+'A');\n            else\n                cout << b[i];\n        cout << b[i]<<\"" \"";\n\n        for( i=0;i<n-1;i++)\n            if(a[i]>9)\n                printf(\""%c\"",a[i]-10+'A');\n            else\n                cout << a[i];\n        cout << a[i]<<\""\\n\"";\n    }\n}\n\nint main(){\n    int N,i;\n    cin>>N;\n    for(i=1;i<=300;i++){\n        jinzhi(N,i);\n    }\n}\n",PARTIAL_ACCEPTED,39,592
1278335958427033600,d88d225f43d9cfbcbfaac4d153ebbce3b46be197d9270ee56c5be60033fcdfc9,2020-07-01 22:33:37,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <stdio.h>\n#include <cstdlib>\n#include <string.h>\n#include <algorithm>\nusing namespace std;\n\nint symm(char *m );\nstring baseSystem(int n,string pa, int m);\n\nint main()\n{\n    int n;\n    cin >> n; // base system which you want input\n    for(int i = 1 ; i <= 300 ; i ++)\n    {\n        string str;\n        string str1;\n        baseSystem(i,str,n);\n        baseSystem(i,str,n);\n        //_itoa(i,str,n);\n        //_itoa(i*i,str1,n);\n        if(symm(str1)== 1)\n        {\n            cout << str << \"" \"" << str1 << endl;\n        }\n        \n    }\n    return 0;\n}\n\nint symm(string m)\n{\n    string n;\n    n = m;\n    reverse(m.begin(), m.end());\n    //strrev(m);\n    if(n==m)\n    {\n        return 1;\n    }\n    else\n    {\n        return 0;\n    }\n    \n}\n\n\nstring baseSystem(int n,string pa, int m) // n 要转化的数 ; m 要转化为的进制\n{\n    string wang = \""ABCDEFGHIJ\"";\n    while (n)\n    {\n        if (n % m < 10) \n        {\n            pa = to_string(n % m)+ pa;\n        }\n        else \n        {\n            pa = wang[n % m - 10] + pa;\n        }\n        n /= m; \n    }\n}",COMPILE_ERROR,0,0
1278336172021964800,d88d225f43d9cfbcbfaac4d153ebbce3b46be197d9270ee56c5be60033fcdfc9,2020-07-01 22:34:28,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <stdio.h>\n#include <cstdlib>\n#include <string.h>\nusing namespace std;\n\nint symm(string m);\nstring baseSystem(int n,string pa, int m);\n\nint main()\n{\n    int n;\n    cin >> n; // base system which you want input\n    for(int i = 1 ; i <= 300 ; i ++)\n    {\n        string str;\n        string str1;\n        baseSystem(i,str,n);\n        baseSystem(i,str,n);\n        //_itoa(i,str,n);\n        //_itoa(i*i,str1,n);\n        if(symm(str1)== 1)\n        {\n            cout << str << \"" \"" << str1 << endl;\n        }\n        \n    }\n    return 0;\n}\n\nint symm(string m)\n{\n    string n;\n    n = m;\n    \n    if(n==m)\n    {\n        return 1;\n    }\n    else\n    {\n        return 0;\n    }\n    \n}\n\n\nstring baseSystem(int n,string pa, int m) // n 要转化的数 ; m 要转化为的进制\n{\n    string wang = \""ABCDEFGHIJ\"";\n    while (n)\n    {\n        if (n % m < 10) \n        {\n            pa = to_string(n % m)+ pa;\n        }\n        else \n        {\n            pa = wang[n % m - 10] + pa;\n        }\n        n /= m; \n    }\n}",WRONG_ANSWER,47,512
1278336409776095232,d88d225f43d9cfbcbfaac4d153ebbce3b46be197d9270ee56c5be60033fcdfc9,2020-07-01 22:35:25,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <stdio.h>\n#include <cstdlib>\n#include <string.h>\n#include <algorithm>\nusing namespace std;\n\nint symm(char *m );\nvoid baseSystem(int n,string pa, int m);\n\nint main()\n{\n    int n;\n    cin >> n; // base system which you want input\n    for(int i = 1 ; i <= 300 ; i ++)\n    {\n        string str;\n        string str1;\n        baseSystem(i,str,n);\n        baseSystem(i,str,n);\n        //_itoa(i,str,n);\n        //_itoa(i*i,str1,n);\n        if(symm(str1)== 1)\n        {\n            cout << str << \"" \"" << str1 << endl;\n        }\n        \n    }\n    return 0;\n}\n\nint symm(string m)\n{\n    string n;\n    n = m;\n    reverse(m.begin(), m.end());\n    //strrev(m);\n    if(n==m)\n    {\n        return 1;\n    }\n    else\n    {\n        return 0;\n    }\n    \n}\n\n\nvoid baseSystem(int n,string pa, int m) // n 要转化的数 ; m 要转化为的进制\n{\n    string wang = \""ABCDEFGHIJ\"";\n    while (n)\n    {\n        if (n % m < 10) \n        {\n            pa = to_string(n % m)+ pa;\n        }\n        else \n        {\n            pa = wang[n % m - 10] + pa;\n        }\n        n /= m; \n    }\n}",COMPILE_ERROR,0,0
1278336542647451648,d88d225f43d9cfbcbfaac4d153ebbce3b46be197d9270ee56c5be60033fcdfc9,2020-07-01 22:35:56,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <stdio.h>\n#include <cstdlib>\n#include <string.h>\n#include <algorithm>\nusing namespace std;\n\nint symm(string m );\nvoid baseSystem(int n,string pa, int m);\n\nint main()\n{\n    int n;\n    cin >> n; // base system which you want input\n    for(int i = 1 ; i <= 300 ; i ++)\n    {\n        string str;\n        string str1;\n        baseSystem(i,str,n);\n        baseSystem(i,str,n);\n        //_itoa(i,str,n);\n        //_itoa(i*i,str1,n);\n        if(symm(str1)== 1)\n        {\n            cout << str << \"" \"" << str1 << endl;\n        }\n        \n    }\n    return 0;\n}\n\nint symm(string m)\n{\n    string n;\n    n = m;\n    reverse(m.begin(), m.end());\n    //strrev(m);\n    if(n==m)\n    {\n        return 1;\n    }\n    else\n    {\n        return 0;\n    }\n    \n}\n\n\nvoid baseSystem(int n,string pa, int m) // n 要转化的数 ; m 要转化为的进制\n{\n    string wang = \""ABCDEFGHIJ\"";\n    while (n)\n    {\n        if (n % m < 10) \n        {\n            pa = to_string(n % m)+ pa;\n        }\n        else \n        {\n            pa = wang[n % m - 10] + pa;\n        }\n        n /= m; \n    }\n}",WRONG_ANSWER,52,424
1278337008504594432,d88d225f43d9cfbcbfaac4d153ebbce3b46be197d9270ee56c5be60033fcdfc9,2020-07-01 22:37:47,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <stdio.h>\n#include <cstdlib>\n#include <string.h>\n#include <algorithm>\nusing namespace std;\n\nint symm(string m );\nvoid baseSystem(int n,string &pa, int m);\n\nint main()\n{\n    int n;\n    cin >> n; // base system which you want input\n    for(int i = 1 ; i <= 300 ; i ++)\n    {\n        string str;\n        string str1;\n        baseSystem(i,str,n);\n        baseSystem(i,str,n);\n        //_itoa(i,str,n);\n        //_itoa(i*i,str1,n);\n        if(symm(str1)== 1)\n        {\n            cout << str << \"" \"" << str1 << endl;\n        }\n        \n    }\n    return 0;\n}\n\nint symm(string m)\n{\n    string n;\n    n = m;\n    reverse(m.begin(), m.end());\n    //strrev(m);\n    if(n==m)\n    {\n        return 1;\n    }\n    else\n    {\n        return 0;\n    }\n    \n}\n\n\nvoid baseSystem(int n,string &pa, int m) // n 要转化的数 ; m 要转化为的进制\n{\n    string wang = \""ABCDEFGHIJ\"";\n    while (n)\n    {\n        if (n % m < 10) \n        {\n            pa = to_string(n % m)+ pa;\n        }\n        else \n        {\n            pa = wang[n % m - 10] + pa;\n        }\n        n /= m; \n    }\n}",WRONG_ANSWER,49,512
1278337642595278848,d88d225f43d9cfbcbfaac4d153ebbce3b46be197d9270ee56c5be60033fcdfc9,2020-07-01 22:40:19,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <stdio.h>\n#include <cstdlib>\n#include <string.h>\n#include <algorithm>\nusing namespace std;\n\nint symm(string m );\nvoid baseSystem(int n,string &pa, int m);\n\nint main()\n{\n    int n;\n    cin >> n; // base system which you want input\n    for(int i = 1 ; i <= 300 ; i ++)\n    {\n        string str;\n        string str1;\n        baseSystem(i,str,n);\n        baseSystem(i*i,str1,n);\n        //_itoa(i,str,n);\n        //_itoa(i*i,str1,n);\n        if(symm(str1)== 1)\n        {\n            cout << str << \"" \"" << str1 << endl;\n        }\n        \n    }\n    return 0;\n}\n\nint symm(string m)\n{\n    string n;\n    n = m;\n    reverse(n.begin(), n.end());\n    //strrev(m);\n    if(n==m)\n    {\n        return 1;\n    }\n    else\n    {\n        return 0;\n    }\n    \n}\n\n\nvoid baseSystem(int n,string &pa, int m) // n 要转化的数 ; m 要转化为的进制\n{\n    string wang = \""ABCDEFGHIJ\"";\n    while (n)\n    {\n        if (n % m < 10) \n        {\n            pa = to_string(n % m)+ pa;\n        }\n        else \n        {\n            pa = wang[n % m - 10] + pa;\n        }\n        n /= m; \n    }\n}",ACCEPTED,44,664
1278337859029762048,01f50ffc209f82995ec8d4f563715f38ce803ff397ed7b3d7119dc6dbc0ad632,2020-07-01 22:41:10,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<stdio.h>\nusing namespace std;\nvoid jinzhi(int N,int x){\n    int n=0,m=0;\n    int X=x*x;\n    int a[50],b[50];\n\n    //转换进制\n    while(x!=0){\n        b[m++]=x%N;\n        x=x/N;\n    }\n    while(X!=0){\n        a[n++]=X%N;\n        X=X/N;\n    }\n    //回文\n    int flag1 = 1;\n    int i=0;\n    for(i=0;i<n/2;i++){\n        if(a[i]!=a[n-i-1]){\n            flag1= 0;\n            break;\n        }\n        else\n            flag1 = 1;\n    }\n    \n    if(flag1==1){\n        for( i=m-1;i>0;i--)\n            if(b[i]>9)\n                printf(\""%c\"",b[i]-10+'A');\n            else\n                cout << b[i];\n        cout << b[i]<<\"" \"";\n\n        for( i=0;i<n-1;i++)\n            if(a[i]>9)\n                printf(\""%c\"",a[i]-10+'A');\n            else\n                cout << a[i];\n        cout << a[i]<<\""\\n\"";\n    }\n}\n\nint main(){\n    int N,i;\n    cin>>N;\n    for(i=1;i<=300;i++){\n        jinzhi(N,i);\n    }\n}\n",PARTIAL_ACCEPTED,42,640
1278340799417212928,04f60b5c3ef78a44a8607be0b3de90c5d8eb85ed8fa4e788518a8a4419d91e3f,2020-07-01 22:52:51,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace  std;\nconst int m = 10;\nconst int n = 20;\nint main()\n{\n\tint B;\n\tcin>>B;\n\tint a[m],b[m];\n\tint p = 0,l = 0;\n\tint n1,n2;\n\t\n\tfor(int i = 1; i < 301 ; i++)\n\t{\n\t\tint a[m], b[n];\n\t\tint p = 0, l = 0;\n\t\tint n1, n2;\n\t\tint r = 0;\n\t\tn1 = i;\n\t\tn2 = i*i;\n\t\twhile(n1 != 0)\n\t\t{\n\t\t\ta[p] = n1 % B;\n\t\t\tp++;\n\t\t\tn1 = n1 / B;\n\t\t}\n\t\twhile(n2 != 0)\n\t\t{\n\t\t\tb[l] = n2 % B;\n\t\t\tn2 = n2 / B;\n\t\t\tl++;\n\t\t}\n\t\tfor (int x = 0;x<l/2;x++)\n\t\t{\n\t\t\tif(b[x] != b[l-x-1])\n\t\t\t    r--;\n\t\t\t\n\t\t}\n\t\tif(r == 0)\n\t\t{\n\t\t    for(int x = p-1;x >= 0;x--)\n\t\t    {\n\t\t\t\n\t\t\t    if(a[x]<10)\n\t\t\t    {\n\t\t\t\t\n\t\t\t\t    cout<<a[x];\n\t\t\t\t}\n\t\t\t\telse \n\t\t\t\t\tcout<<char(a[x]-10+'A');\n\t\t\t}\n\t\t    cout<<\"" \"";\n\t\t    for(int x = l-1;x >= 0;x--)\n\t\t    {\n\t\t\t\n\t\t\t    if(b[x]<10)\n\t\t\t\t\tcout<<b[x];\n\t\t\t    else \n\t\t\t\t\tcout<<char(b[x]-10+'A');\n\t\t\t}\n\t\t    cout<<endl;\n\t\t\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,29,416
1278341847598956544,01f50ffc209f82995ec8d4f563715f38ce803ff397ed7b3d7119dc6dbc0ad632,2020-07-01 22:57:01,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<stdio.h>\nusing namespace std;\nvoid jinzhi(int N,int x){\n    int n=0,m=0;\n    int X=x*x;\n    int a[50],b[50];\n\n    //转换进制\n    while(x!=0){\n        b[m++]=x%N;\n        x=x/N;\n    }\n    while(X!=0){\n        a[n++]=X%N;\n        X=X/N;\n    }\n    //回文\n    int flag1 = 1;\n    int i=0;\n    for(i=0;i<n/2;i++){\n        if(a[i]!=a[n-i-1]){\n            flag1= 0;\n            break;\n        }\n        else\n            flag1 = 1;\n    }\n    \n    if(flag1==1){\n        for (i = m - 1; i > 0; i--)\n\t\t\tif (b[i] > 9)\n\t\t\t\tprintf(\""%c\"", b[i] - 10 + 'A');\n\t\t\telse\n\t\t\t\tcout << b[i];\n\t\t    if (b[i] > 9)\n                printf(\""%c \"", b[i] - 10 + 'A');\n\t\t\telse cout << b[i] << \"" \"";\n\n        for( i=0;i<n-1;i++)\n            if(a[i]>9)\n                printf(\""%c\"",a[i]-10+'A');\n            else\n                cout << a[i];\n            if (a[i] > 9)\n                printf(\""%c \"", a[i] - 10 + 'A');\n\t\t\telse cout << a[i] << \"" \"";\n    }\n}\n\nint main(){\n    int N,i;\n    cin>>N;\n    for(i=1;i<=300;i++){\n        jinzhi(N,i);\n    }\n}\n",PRESENTATION_ERROR,38,512
1278342035210166272,01f50ffc209f82995ec8d4f563715f38ce803ff397ed7b3d7119dc6dbc0ad632,2020-07-01 22:57:46,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<stdio.h>\nusing namespace std;\nvoid jinzhi(int N,int x){\n    int n=0,m=0;\n    int X=x*x;\n    int a[50],b[50];\n\n    //转换进制\n    while(x!=0){\n        b[m++]=x%N;\n        x=x/N;\n    }\n    while(X!=0){\n        a[n++]=X%N;\n        X=X/N;\n    }\n    //回文\n    int flag1 = 1;\n    int i=0;\n    for(i=0;i<n/2;i++){\n        if(a[i]!=a[n-i-1]){\n            flag1= 0;\n            break;\n        }\n        else\n            flag1 = 1;\n    }\n    \n    if(flag1==1){\n        for (i = m - 1; i > 0; i--)\n\t\t\tif (b[i] > 9)\n\t\t\t\tprintf(\""%c\"", b[i] - 10 + 'A');\n\t\t\telse\n\t\t\t\tcout << b[i];\n\t\t    if (b[i] > 9)\n                printf(\""%c \"", b[i] - 10 + 'A');\n\t\t\telse cout << b[i] << \"" \"";\n\n        for( i=0;i<n-1;i++)\n            if(a[i]>9)\n                printf(\""%c\"",a[i]-10+'A');\n            else\n                cout << a[i];\n            if (a[i] > 9)\n                printf(\""%c\\n\"", a[i] - 10 + 'A');\n\t\t\telse cout << a[i] << \""\\n\"";\n    }\n}\n\nint main(){\n    int N,i;\n    cin>>N;\n    for(i=1;i<=300;i++){\n        jinzhi(N,i);\n    }\n}\n",ACCEPTED,36,488
1278342491768553472,769a5633f3f76c88163c10ba96b281ae92c033baa24697a766f3d547fe850076,2020-07-01 22:59:35,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nbool judge(int a, int b) {       //十进制数a，需要转化的进制（转化后顺便判断是否时回文数\n\tint number[10001];\n\tint temp{ a }, count{ 0 };\n\twhile (temp != 0) {                      //进制转换（转换后为倒序\n\t\tnumber[count] = temp % b;\n\t\ttemp /= b;\n\t\tcount++;\n\t}\n\n\tfor (int i{ 0 }; i < count / 2 + 1; i++) {            //判断是否是回文数\n\t\tif (number[i] != number[count - 1 - i]) {\n\t\t\treturn 0;\n\t\t}\n\t\treturn 1;\n\t}\n}\n\nint main() {\n\tint N, S;\n\tcin >> N >> S;\n\tint n{ 0 };\n\tfor (int i{ S + 1 }; S < 10000; i++) {       //不同数\n\t\tint count{ 0 };\n\t\tfor (int j{ 2 }; j <= 10; j++) {            //不同进制\n\t\t\tif (judge(i, j)) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tif (count == 2) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tn++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (n == N) {\n\t\t\tbreak;\n\t\t}\n\t}\n}",PARTIAL_ACCEPTED,36,640
1278343006648729600,62c28946ff673e4465df1d3a3f199d062324c51b570f00bfca1efb71f0ba778b,2020-07-01 23:01:37,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nvoid convert(int N, int x) {\n\tint n = 0, m = 0;\n\tint fang = x * x;\n\tint a[20], b[20];\n\twhile (x) {b[m++] = x % N;x/= N;}\n\twhile (fang) {\n\t\ta[n++] = fang % N;\n\t\tfang/=N;\n\t}\n\tint flag1 = 1;\n\tint i = 0;\n\tfor (i = 0; i < n / 2; i++) \n\t\tif (a[i] != a[n - i - 1])\n\t\t{\n\t\t\tflag1 = 0;\n\t\t\tbreak;\n\t\t}\n\tif (flag1) {\n\t\tfor (i = m - 1; i > 0; i--)\n\t\t\tif (b[i] > 9)\n\t\t\t\tcout<<char(b[i] - 10 + 'A');\n\t\t\telse\n\t\t\t\tcout << b[i];\n\t\tif (b[i] > 9)cout<<char(b[i] - 10 + 'A')<<' ';\n\t\t\telse cout << b[i] << ' ';\n\n\t\tfor (i = 0; i < n - 1; i++)\n\t\t\tif (a[i] > 9)\n\t\t\t\tcout<<char(a[i] - 10 + 'A');\n\t\t\telse\n\t\t\t\tcout << a[i];\n\t\tif (a[i] > 9)\n\t\t\tcout<<char(a[i] - 10 + 'A')<<endl;\n\t\telse cout << a[i] << \""\\n\"";\n\t}\n}\n\nint main() {\n\tint N, i;\n\tcin >> N;\n\tfor (i = 1; i <= 300; i++) {\n\t\tconvert(N, i);\n\t}\n\treturn 0;\n}",ACCEPTED,24,384
1278343797715435520,62c28946ff673e4465df1d3a3f199d062324c51b570f00bfca1efb71f0ba778b,2020-07-01 23:04:46,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nvoid convert(int N, int x) {\n\tint n = 0, m = 0;\n\tint fang = x * x;\n\tint a[20], b[20];\n\twhile (x) {b[m++] = x % N;x/= N;}\n\twhile (fang) {\n\t\ta[n++] = fang % N;\n\t\tfang/=N;\n\t}\n\tint flag = 1;\n\tint i = 0;\n\tfor (i = 0; i < n / 2; i++) \n\t\tif (a[i] != a[n - i - 1])\n\t\t{\n\t\t\tflag = 0;\n\t\t\tbreak;\n\t\t}\n\tif (flag) {\n\t\tfor (i = m - 1; i > 0; i--)\n\t\t\tif (b[i] > 9)\n\t\t\t\tcout<<char(b[i] - 10 + 'A');\n\t\t\telse\n\t\t\t\tcout << b[i];\n\t\tif (b[i] > 9)cout<<char(b[i] - 10 + 'A')<<' ';\n\t\t\telse cout << b[i] << ' ';\n\n\t\tfor (i = 0; i < n - 1; i++)\n\t\t\tif (a[i] > 9)\n\t\t\t\tcout<<char(a[i] - 10 + 'A');\n\t\t\telse\n\t\t\t\tcout << a[i];\n\t\tif (a[i] > 9)\n\t\t\tcout<<char(a[i] - 10 + 'A')<<endl;\n\t\telse cout << a[i] << \""\\n\"";\n\t}\n}\n\nint main() {\n\tint aa, i;\n\tcin >> aa;\n\tfor (i = 1; i <= 300; i++) {\n\t\tconvert(aa, i);\n\t}\n\treturn 0;\n}",ACCEPTED,43,424
1278344059821686784,769a5633f3f76c88163c10ba96b281ae92c033baa24697a766f3d547fe850076,2020-07-01 23:05:49,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nbool judge(int a, int b) {       //十进制数a，需要转化的进制（转化后顺便判断是否时回文数\n\tint number[10000];\n\tmemset(number, 0, sizeof(0));\n\tint temp{ a }, count{ 0 };\n\twhile (temp != 0) {                      //进制转换（转换后为倒序\n\t\tnumber[count] = temp % b;\n\t\ttemp /= b;\n\t\tcount++;\n\t}\n\n\tfor (int i{ 0 }; i < count / 2 + 1; i++) {            //判断是否是回文数\n\t\tif (number[i] != number[count - 1 - i]) {\n\t\t\treturn 0;\n\t\t}\n\t\treturn 1;\n\t}\n}\n\nint main() {\n\tint N, S;\n\tcin >> N >> S;\n\tint n{ 0 };\n\tfor (int i{ S + 1 }; S < 10000; i++) {       //不同数\n\t\tint count{ 0 };\n\t\tfor (int j{ 2 }; j <= 10; j++) {            //不同进制\n\t\t\tif (judge(i, j)) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tif (count == 2) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tn++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (n == N) {\n\t\t\tbreak;\n\t\t}\n\t}\n}",COMPILE_ERROR,0,0
1278344408301240320,769a5633f3f76c88163c10ba96b281ae92c033baa24697a766f3d547fe850076,2020-07-01 23:07:12,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstring>\nusing namespace std;\n\nbool judge(int a, int b) {       //十进制数a，需要转化的进制（转化后顺便判断是否时回文数\n\tint number[10000];\n\tmemset(number, 0, sizeof(0));\n\tint temp{ a }, count{ 0 };\n\twhile (temp != 0) {                      //进制转换（转换后为倒序\n\t\tnumber[count] = temp % b;\n\t\ttemp /= b;\n\t\tcount++;\n\t}\n\n\tfor (int i{ 0 }; i < count / 2 + 1; i++) {            //判断是否是回文数\n\t\tif (number[i] != number[count - 1 - i]) {\n\t\t\treturn 0;\n\t\t}\n\t\treturn 1;\n\t}\n}\n\nint main() {\n\tint N, S;\n\tcin >> N >> S;\n\tint n{ 0 };\n\tfor (int i{ S + 1 }; S < 10000; i++) {       //不同数\n\t\tint count{ 0 };\n\t\tfor (int j{ 2 }; j <= 10; j++) {            //不同进制\n\t\t\tif (judge(i, j)) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tif (count == 2) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tn++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (n == N) {\n\t\t\tbreak;\n\t\t}\n\t}\n}",PARTIAL_ACCEPTED,35,512
1278344442447060992,62c28946ff673e4465df1d3a3f199d062324c51b570f00bfca1efb71f0ba778b,2020-07-01 23:07:20,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nvoid convert(int N, int x) {\n\tint n = 0, m = 0;\n\tint fang = x * x;\n\tint a[20], b[20];\n\twhile (x) {b[m++] = x % N;x/= N;}\n\twhile (fang) {\n\t\ta[n++] = fang % N;\n\t\tfang/=N;\n\t}\n\tint flag = 1;\n\tint i = 0;\n\tfor (i = 0; i < n / 2; i++) \n\t\tif (a[i] != a[n - i - 1])\n\t\t{\n\t\t\tflag = 0;\n\t\t\tbreak;\n\t\t}\n\tif (flag) {\n\t\tfor (i = m - 1; i >= 0; i--)\n        {if (b[i] > 9)\n\t\t\t\tcout<<char(b[i] - 10 + 'A');\n\t\t\telse\n\t\t\t\tcout << b[i];\n            if(i==0)cout<<' ';\n        }\n\t\tfor (i = 0; i < n - 1; i++)\n\t\t\tif (a[i] > 9)\n\t\t\t\tcout<<char(a[i] - 10 + 'A');\n\t\t\telse\n\t\t\t\tcout << a[i];\n\t\tif (a[i] > 9)\n\t\t\tcout<<char(a[i] - 10 + 'A')<<endl;\n\t\telse cout << a[i] << \""\\n\"";\n\t}\n}\n\nint main() {\n\tint aa, i;\n\tcin >> aa;\n\tfor (i = 1; i <= 300; i++) \n    {\n\t\tconvert(aa, i);\n\t}\n\treturn 0;\n}",ACCEPTED,28,384
1278345287024705536,769a5633f3f76c88163c10ba96b281ae92c033baa24697a766f3d547fe850076,2020-07-01 23:10:41,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstring>\nusing namespace std;\n\nbool judge(int a, int b) {       //十进制数a，需要转化的进制（转化后顺便判断是否时回文数\n\tint number[20000];\n\tmemset(number, 0, sizeof(0));\n\tint temp{ a }, count{ 0 };\n\twhile (temp != 0) {                      //进制转换（转换后为倒序\n\t\tnumber[count] = temp % b;\n\t\ttemp /= b;\n\t\tcount++;\n\t}\n\n\tfor (int i{ 0 }; i < count / 2 + 1; i++) {            //判断是否是回文数\n\t\tif (number[i] != number[count - 1 - i]) {\n\t\t\treturn 0;\n\t\t}\n\t\treturn 1;\n\t}\n}\n\nint main() {\n\tint N, S;\n\tcin >> N >> S;\n\tint n{ 0 };\n\tfor (int i{ S + 1 }; S < 10000; i++) {       //不同数\n\t\tint count{ 0 };\n\t\tfor (int j{ 2 }; j <= 10; j++) {            //不同进制\n\t\t\tif (judge(i, j)) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tif (count == 2) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tn++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (n == N) {\n\t\t\tbreak;\n\t\t}\n\t}\n}",PARTIAL_ACCEPTED,31,512
1278345503136210944,b0b89d994646350cdb0faf36df067ca12b0d2116d53eb7ae1cb9e3d06407842e,2020-07-01 23:11:33,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\n\nint k = 0, a[100];\nbool judge(int a[]) { for (int i = 0; i <k; i++)if (a[i] != a[k - i-1])return 0; return 1; }\nvoid node(int x)\n\t{\n\t\tint tx = x;\n\t\tfor (int j = 2; j <= 10; j++) \n\t\t{\n\t\t\tk = 0;\n\t\t\ttx = x;\n\t\t\tfor (; tx; k++) \n\t\t\t{ \n\t\t\t\ta[k] = tx % j; tx /= j; \n\t\t\t} \n\t\t\tif (judge(a))\n\t\t\t{\n\t\t\t\tcout << x << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t}\n\n\nint main()\n{\n\tint n; int sta;\n\tcin >> n >> sta;\n\tfor (int i = sta+1; i <= sta+n; i++)\n\t{\n\t\tnode(i);\n\t}\n}",PARTIAL_ACCEPTED,23,512
1278345960353095680,769a5633f3f76c88163c10ba96b281ae92c033baa24697a766f3d547fe850076,2020-07-01 23:13:22,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstdlib>\n#include<cstdio>\n#include<cstring>\nusing namespace std;\n\nint a[10000];\nint l1,l2;\nint hw()//判断回文\n{\n    for (int i=1;i<=l1/2;i++)\n        if (a[i]!=a[l1-i+1])\n            return 0;\n    return 1;\n}\n\nint pd(int k,int n)//转化进制\n{\n    l1=0;\n    do\n    {\n        a[++l1]=k%n;\n        k/=n;\n    } while (k!=0);\n    return 0;\n}\n\nint main()\n{\n    int n,m;\n    cin>>n>>m;\n    int i=m+1;\n    int k=0;\n    while(k<n)//\n    {\n        int ans=0;\n        for(int j=2;j<=10;j++)//不同进制\n        {\n            memset(a,0,sizeof(0));//数组清零\n            pd(i,j);\n            if(hw()==1)\n             {\n                 ans++;\n             }\n        }\n        if(ans>=2)\n        {\n            cout<<i<<endl;\n            k++;\n        }\n        i++;\n    }\n    return 0;\n}",ACCEPTED,28,512
1278346369364844544,b0b89d994646350cdb0faf36df067ca12b0d2116d53eb7ae1cb9e3d06407842e,2020-07-01 23:14:59,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\n\nint k = 0, a[100];\nbool judge(int a[]) { for (int i = 0; i <k; i++)if (a[i] != a[k - i-1])return 0; return 1; }\nvoid node(int x)\n\t{\n\t\tint tx = x;\n\t\tfor (int j = 2; j <= 10; j++) \n\t\t{\n\t\t\tk = 0;\n\t\t\ttx = x;\n\t\t\tfor (; tx; k++) \n\t\t\t{ \n\t\t\t\ta[k] = tx % j; tx /= j; \n\t\t\t} \n\t\t\tif (judge(a))\n\t\t\t{\n\t\t\t\tcout << x << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t}\n\n\nint main()\n{\n\tint n; int sta;\n\tcin >> n >> sta;\n\tif(0<=n&&n<=15&&0<=sta<=10000)\n\t\tfor (int i = sta+1; i <= sta+n; i++)\n\t\t{\n\t\t\tnode(i);\n\t\t}\n}",PARTIAL_ACCEPTED,34,512
1278347817532194816,769a5633f3f76c88163c10ba96b281ae92c033baa24697a766f3d547fe850076,2020-07-01 23:20:44,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstdlib>\n#include<cstdio>\n#include<cstring>\nusing namespace std;\n\nint number[10000];\nint l1,l2;\nint hw()                      //判断回文数\n{\n    for (int i=1;i<=l1/2;i++)\n        if (number[i]!=number[l1-i+1])\n            return 0;\n    return 1;\n}\n\nint change(int k,int n)            //转化进制\n{\n    l1=0;\n    do\n    {\n        number[++l1]=k%n;\n        k/=n;\n    } while (k!=0);\n    return 0;\n}\n\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    int i=S+1;\n    int n{0};                 //计满足要求的数的个数\n    while(n<N)\n    {\n        int count{0};\n        for(int j=2;j<=10;j++)           //不同进制\n        {\n            memset(number,0,sizeof(0));           //数组清零\n            change(i,j);\n            if(hw()==1)\n             {\n                 count++;\n             }\n        }\n        if(count>=2)\n        {\n            cout<<i<<endl;\n            n++;\n        }\n        i++;\n    }\n    return 0;\n}",ACCEPTED,36,424
1278348263206346752,b77006d2c05616010bccb3c4dc79461f07a7a0647f294f1948292040be148b3a,2020-07-01 23:22:31,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include <algorithm>\nusing namespace std;\nbool jud(string s) {\n\tstring s1;\n\tfor (int i = s.length() - 1; i >= 0; --i) s1 += s[i];\n\treturn s1 == s;\n}\n\nstring change(int n, int p) {\n\tstring str;\n\tint c, m = 0, s[100];\n\twhile (n != 0) {\n\t\tc = n % p;\n\t\tn = n / p;\n\t\tm++;\n\t\ts[m] = c;\n\t}\n\tfor (int k = m; k >= 1; k--) str += (char)(s[k] + 48);\n\treturn str;\n}\nint main() {\n\tint N, S,NUM=0;\n\tcin >> N>>S;\n\tfor (int i = S + 1; i >0 ; ++i) {\n\t\tint num = 0;\n\t\tfor (int j = 2; j < 11; ++j) {\n\t\t\tif (jud(change(i, j))) num++;\n\t\t\tif (num == 3) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tNUM++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (NUM == N) break;\n\t}\n}\n",PARTIAL_ACCEPTED,59,512
1278348379396964352,b77006d2c05616010bccb3c4dc79461f07a7a0647f294f1948292040be148b3a,2020-07-01 23:22:58,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include <algorithm>\nusing namespace std;\nbool jud(string s) {\n\tstring s1;\n\tfor (int i = s.length() - 1; i >= 0; --i) s1 += s[i];\n\treturn s1 == s;\n}\n\nstring change(int n, int p) {\n\tstring str;\n\tint c, m = 0, s[100];\n\twhile (n != 0) {\n\t\tc = n % p;\n\t\tn = n / p;\n\t\tm++;\n\t\ts[m] = c;\n\t}\n\tfor (int k = m; k >= 1; k--) str += (char)(s[k] + 48);\n\treturn str;\n}\nint main() {\n\tint N, S,NUM=0;\n\tcin >> N>>S;\n\tfor (int i = S + 1; i >0 ; ++i) {\n\t\tint num = 0;\n\t\tfor (int j = 2; j < 11; ++j) {\n\t\t\tif (jud(change(i, j))) num++;\n\t\t\tif (num == 2) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tNUM++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (NUM == N) break;\n\t}\n}\n",ACCEPTED,40,512
1278350124017713152,b0b89d994646350cdb0faf36df067ca12b0d2116d53eb7ae1cb9e3d06407842e,2020-07-01 23:29:54,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\n\nint k = 0, a[100];\nbool judge(int a[]) { for (int i = 0; i < k; i++)if (a[i] != a[k - i - 1])return 0; return 1; }\nvoid node(int x)\n{\n\tint tx = x;\n\tint flag = 0;\n\tfor (int j = 2; j <= 10; j++)\n\t{\n\t\tk = 0;\n\t\ttx = x;\n\t\tfor (; tx; k++)\n\t\t{\n\t\t\ta[k] = tx % j; tx /= j;\n\t\t}\n\t\tif (judge(a)) flag++;\n\t\tif (flag == 2) { cout << x << endl; break; }\n\t}\n\n}\n\n\nint main()\n{\n\tint n; int sta;\n\tcin >> n >> sta;\n\tif (0 <= n && n <= 15 && 0 <= sta <= 10000)\n\t\tfor (int i = sta + 1; i <= sta + n; i++)\n\t\t{\n\t\t\tnode(i);\n\t\t}\n}",PARTIAL_ACCEPTED,30,424
1278350189369163776,b0b89d994646350cdb0faf36df067ca12b0d2116d53eb7ae1cb9e3d06407842e,2020-07-01 23:30:10,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\n\nint k = 0, a[100];\nbool judge(int a[]) { for (int i = 0; i < k; i++)if (a[i] != a[k - i - 1])return 0; return 1; }\nvoid node(int x)\n{\n\tint tx = x;\n\tint flag = 0;\n\tfor (int j = 2; j <= 10; j++)\n\t{\n\t\tk = 0;\n\t\ttx = x;\n\t\tfor (; tx; k++)\n\t\t{\n\t\t\ta[k] = tx % j; tx /= j;\n\t\t}\n\t\tif (judge(a)) flag++;\n\t\tif (flag == 2) { cout << x << endl; break; }\n\t}\n\n}\n\n\nint main()\n{\n\tint n; int sta;\n\tcin >> n >> sta;\n\tif (0 <= n && n <= 15 && 0 <= sta <= 10000)\n\t\tfor (int i = sta + 1; i <= sta + n; i++)\n\t\t{\n\t\t\tnode(i);\n\t\t}\n}",PARTIAL_ACCEPTED,32,512
1278350255874048000,769a5633f3f76c88163c10ba96b281ae92c033baa24697a766f3d547fe850076,2020-07-01 23:30:26,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstdlib>\n#include<cstdio>\n#include<cstring>\nusing namespace std;\n\nint number[10000];\nint count;\nint hw()                      //判断回文数\n{\n    for (int i = 1; i <= count / 2; i++)\n        if (number[i] != number[count - i + 1])\n            return 0;\n    return 1;\n}\n\nint change(int a, int b)            //转化进制\n{\n    int temp{ a }, count{ 0 };\n    while (temp != 0) {                      //进制转换（转换后为倒序\n        number[count] = temp % b;\n        temp /= b;\n        count++;\n    }\n    return 0;\n}\n\nint main()\n{\n    int N, S;\n    cin >> N >> S;\n    int i = S + 1;\n    int n{ 0 };                 //计满足要求的数的个数\n    while (n < N)\n    {\n        int count{ 0 };\n        for (int j = 2; j <= 10; j++)           //不同进制\n        {\n            memset(number, 0, sizeof(0));           //数组清零\n            change(i, j);\n            if (hw() == 1)\n            {\n                count++;\n            }\n        }\n        if (count >= 2)\n        {\n            cout << i << endl;\n            n++;\n        }\n        i++;\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,29,424
1278350296730763264,01f50ffc209f82995ec8d4f563715f38ce803ff397ed7b3d7119dc6dbc0ad632,2020-07-01 23:30:36,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<stdio.h>\nusing namespace std;\nvoid jinzhi(int N,int x,int count){\n    int m=0;\n    int a[50];\n\n    //转换进制\n    while(x!=0){\n        a[m++]=x%N;\n        x=x/N;\n    }\n\n    //回文\n    int flag1 = 1;\n    int i=0;\n    for(i=0;i<m/2;i++){\n        if(a[i]!=a[m-i-1]){\n            flag1 = 0;\n            break;\n        }\n        else\n            flag1 = 1;\n    }\n\n    if(flag1==1){\n        count++;\n    }\n}\n\nint main(){\n    int N,n,S,j;\n    int count =0,count1 = 0;\n    cin>>n>>S;\n    for(j=n;count1<n;j++){\n        for(N=2;N<11;N++)\n            jinzhi(N,j,count);\n        if(count>2){\n            cout << j<<endl;\n            count1++;\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,28,424
1278350662255968256,b0b89d994646350cdb0faf36df067ca12b0d2116d53eb7ae1cb9e3d06407842e,2020-07-01 23:32:03,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\n\nint k = 0, a[100];\nbool judge(int a[]) { for (int i = 0; i < k; i++)if (a[i] != a[k - i - 1])return 0; return 1; }\nvoid node(int x)\n{\n\tint tx = x;\n\tint flag = 0;\n\tfor (int j = 2; j <= 10; j++)\n\t{\n\t\tk = 0;\n\t\ttx = x;\n\t\tfor (; tx; k++)\n\t\t{\n\t\t\ta[k] = tx % j; tx /= j;\n\t\t}\n\t\tif (judge(a)) flag++;\n\t\tif (flag == 2) { cout << x << endl; break; }\n\t}\n\n}\n\n\nint main()\n{\n\tint n; int sta;\n\tcin >> n >> sta;\n\tif (0 <= n && n <= 15 && 0 <=sta&&sta<=10000)\n\t\tfor (int i = sta + 1; i <= sta + n; i++)\n\t\t{\n\t\t\tnode(i);\n\t\t}\n}",PARTIAL_ACCEPTED,35,512
1278350790832357376,01f50ffc209f82995ec8d4f563715f38ce803ff397ed7b3d7119dc6dbc0ad632,2020-07-01 23:32:33,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<stdio.h>\nusing namespace std;\nvoid jinzhi(int N,int x,int count){\n    int m=0;\n    int a[1000];\n\n    //转换进制\n    while(x!=0){\n        a[m++]=x%N;\n        x=x/N;\n    }\n\n    //回文\n    int flag1 = 1;\n    int i=0;\n    for(i=0;i<m/2;i++){\n        if(a[i]!=a[m-i-1]){\n            flag1 = 0;\n            break;\n        }\n        else\n            flag1 = 1;\n    }\n\n    if(flag1==1){\n        count++;\n    }\n}\n\nint main(){\n    int N,n,S,j;\n    int count =0,count1 = 0;\n    cin>>n>>S;\n    for(j=n;count1<n;j++){\n        for(N=2;N<11;N++)\n            jinzhi(N,j,count);\n        if(count>2){\n            cout << j<<endl;\n            count1++;\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,23,424
1278351464068472832,06973ea832a5a1b65d8be68c7f42fd3c791dd6b87b2be7840bfba18d17eace9c,2020-07-01 23:35:14,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cmath>\nusing namespace std;\nint a[10000000], b[10000000];\nint jin;\nvoid s(int n)\n{\n\tint i, j, k;\n\tint c = 0;\n\tint q = n;\n\tfor (k = 1;;k++)\n\t{\n\t\tb[k] = n % jin;\n\t\tn =n/ jin;\n\t\tif (n == 0)\n\t\t\tbreak;\n\t}\n\tn = pow(q, 2);\n\tfor (i = 1;;i++)\n\t{\n\t\ta[i] = n % jin;\n\t\tn = n / jin;\n\t\tif (n == 0)\n\t\t\tbreak;\n\t}\n\tfor (j = 1;j <= i / 2;j++)\n\t{\n\t\tif (a[i - j + 1] != a[j])\n\t\t{\n\t\t\tc = 1;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif (c == 0)\n\t{\n\t\tfor (j = 1;j >= 1;j--)\n\t\t{\n\t\t\tif (b[j] < 10)\n\t\t\t{\n\t\t\t\tcout << b[j];\n\t\t\t}\n\t\t\tif (b[j] == 10)\n\t\t\t\tcout << \""A\"";\n\t\t\tif (b[j] == 11)\n\t\t\t\tcout << \""B\"";\n\t\t\tif (b[j] == 12)\n\t\t\t\tcout << \""C\"";\n\t\t\tif (b[j] == 13)\n\t\t\t\tcout << \""D\"";\n\t\t\tif (b[j] == 14)\n\t\t\t\tcout << \""E\"";\n\t\t\tif (b[j] == 15)\n\t\t\t\tcout << \""F\"";\n\t\t\tif (b[j] == 16)\n\t\t\t\tcout << \""G\"";\n\t\t\tif (b[j] == 17)\n\t\t\t\tcout << \""H\"";\n\t\t\tif (b[j] == 18)\n\t\t\t\tcout << \""I\"";\n\t\t\tif (b[j] == 19)\n\t\t\t\tcout << \""J\"";\n\t\t}\n\t\tcout << \"" \"";\n\t\tfor (j = i;j >= 1;j--)\n\t\t{\n\t\t\tif (a[j] < 10)\n\t\t\t{\n\t\t\t\tcout <<a[j];\n\t\t\t}\n\t\t\tif (a[j] == 10)\n\t\t\t\tcout << \""A\"";\n\t\t\tif (a[j] == 11)\n\t\t\t\tcout << \""B\"";\n\t\t\tif (a[j] == 12)\n\t\t\t\tcout << \""C\"";\n\t\t\tif (a[j] == 13)\n\t\t\t\tcout << \""D\"";\n\t\t\tif (a[j] == 14)\n\t\t\t\tcout << \""E\"";\n\t\t\tif (a[j] == 15)\n\t\t\t\tcout << \""F\"";\n\t\t\tif (a[j] == 16)\n\t\t\t\tcout << \""G\"";\n\t\t\tif (a[j] == 17)\n\t\t\t\tcout << \""H\"";\n\t\t\tif (a[j] == 18)\n\t\t\t\tcout << \""I\"";\n\t\t\tif (a[j] == 19)\n\t\t\t\tcout << \""J\"";\n\t\t}\n\t\tcout << endl;\n\t\t/*switch (b[j])\n\t\t{\n\t\tcase b[j] == 10:cout << \""A\"";break;\n\t\tcase b[j] == 11:cout << \""B\"";break;\n\t\tcase b[j] == 12:cout << \""C\"";break;\n\t\tcase b[j] == 13:cout << \""D\"";break;\n\t\tcase b[j] == 14:cout << \""E\"";break;\n\t\tcase b[j] == 15:cout << \""F\"";break;\n\t\tcase b[j] == 16:cout << \""G\"";break;\n\t\tcase b[j] == 17:cout << \""H\"";break;\n\t\tcase b[j] == 18:cout << \""I\"";break;\n\t\tcase b[j] == 19:cout << \""J\"";break;\n\t\tdefault: cout << b[j];\n\t\t\tbreak;\n\t\t}*/\n\t}\n}\n\nint main()\n{\n\tcin >> jin;\n\tfor (int i = 1;i <= 1000;i++)\n\t\ts(i);\n\tcout << endl;\n\treturn 0;\n}",WRONG_ANSWER,41,640
1278351608381898752,b0b89d994646350cdb0faf36df067ca12b0d2116d53eb7ae1cb9e3d06407842e,2020-07-01 23:35:48,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\n\nint k = 0, a[100];\nbool judge(int a[]) { for (int i = 0; i < k; i++)if (a[i] != a[k - i - 1])return 0; return 1; }\nvoid node(int x)\n{\n\tint tx = x;\n\tint flag = 0;\n\tfor (int j = 2; j <= 10; j++)\n\t{\n\t\tk = 0;\n\t\ttx = x;\n\t\tfor (; tx; k++)\n\t\t{\n\t\t\ta[k] = tx % j; tx /= j;\n\t\t}\n\t\tif (judge(a)) flag++;\n\t\tif (flag >= 2) { cout << x << endl; break; }\n\t}\n\n}\n\n\nint main()\n{\n\tint n; int sta;\n\tcin >> n >> sta;\n\tif (0 <= n && n <= 15 && 0 <=sta&&sta<=10000)\n\t\tfor (int i = sta + 1; i <= sta + n; i++)\n\t\t{\n\t\t\tnode(i);\n\t\t}\n}",PARTIAL_ACCEPTED,23,512
1278351626442571776,06973ea832a5a1b65d8be68c7f42fd3c791dd6b87b2be7840bfba18d17eace9c,2020-07-01 23:35:53,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n\nusing namespace std;\nint a[100000], b[100000];\nint m;       //进制数\n\nvoid s(int n)\n{\n    int i, j, l;\n    int ma = 0;\n    int k = n;\n    for (l = 1;;l++) {            //原来的数\n        b[l] = n % m;\n        n = n / m;\n        if (n == 0)break;\n    }\n    n = k * k;\n    for (i = 1;;i++) {                 //平方数\n        a[i] = n % m;\n        n = n / m;\n        if (n == 0)break;\n    }\n    for (j = 1;j <= i / 2;j++) {\n        if (a[i - j + 1] != a[j]) {\n            ma = 1;\n            break;\n        }\n    }\n    if (ma == 0) {\n        for (j = l;j >= 1;j--) {\n            if (b[j] < 10)\n                cout << b[j];\n            if (b[j] == 10)cout << \""A\"";\n            if (b[j] == 11)cout << \""B\"";\n            if (b[j] == 12)cout << \""C\"";\n            if (b[j] == 13)cout << \""D\"";\n            if (b[j] == 14)cout << \""E\"";\n            if (b[j] == 15)cout << \""F\"";\n            if (b[j] == 16)cout << \""G\"";\n            if (b[j] == 17)cout << \""H\"";\n            if (b[j] == 18)cout << \""I\"";\n            if (b[j] == 19)cout << \""J\"";\n        }\n        cout << \""  \"";\n        for (j = i;j >= 1;j--) {\n            if (a[j] < 10)\n                cout << a[j];\n            if (a[j] == 10)cout << \""A\"";\n            if (a[j] == 11)cout << \""B\"";\n            if (a[j] == 12)cout << \""C\"";\n            if (a[j] == 13)cout << \""D\"";\n            if (a[j] == 14)cout << \""E\"";\n            if (a[j] == 15)cout << \""F\"";\n            if (a[j] == 16)cout << \""G\"";\n            if (a[j] == 17)cout << \""H\"";\n            if (a[j] == 18)cout << \""I\"";\n            if (a[j] == 19)cout << \""J\"";\n        }\n        cout << endl;\n    }\n}\n\nint main()\n{\n    cin >> m;\n    for (int i = 1;i <= 300;i++)\n    {\n        s(i);\n    }\n    cout << endl;\n    return 0;\n}",PRESENTATION_ERROR,31,428
1278351727063924736,b0b89d994646350cdb0faf36df067ca12b0d2116d53eb7ae1cb9e3d06407842e,2020-07-01 23:36:17,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\n\nint k = 0, a[100];\nbool judge(int a[]) { for (int i = 0; i < k; i++)if (a[i] != a[k - i - 1])return 0; return 1; }\nvoid node(int x)\n{\n\tint tx = x;\n\tint flag = 0;\n\tfor (int j = 2; j <= 10; j++)\n\t{\n\t\tk = 0;\n\t\ttx = x;\n\t\tfor (; tx; k++)\n\t\t{\n\t\t\ta[k] = tx % j; tx /= j;\n\t\t}\n\t\tif (judge(a)) flag++;\n\t\tif (flag > 2) { cout << x << endl; break; }\n\t}\n\n}\n\n\nint main()\n{\n\tint n; int sta;\n\tcin >> n >> sta;\n\tif (0 <= n && n <= 15 && 0 <=sta&&sta<=10000)\n\t\tfor (int i = sta + 1; i <= sta + n; i++)\n\t\t{\n\t\t\tnode(i);\n\t\t}\n}",PARTIAL_ACCEPTED,28,424
1278351808336945152,06973ea832a5a1b65d8be68c7f42fd3c791dd6b87b2be7840bfba18d17eace9c,2020-07-01 23:36:36,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n\nusing namespace std;\nint a[100000], b[100000];\nint m;       //进制数\n\nvoid s(int n)\n{\n    int i, j, l;\n    int ma = 0;\n    int k = n;\n    for (l = 1;;l++) {            //原来的数\n        b[l] = n % m;\n        n = n / m;\n        if (n == 0)break;\n    }\n    n = k * k;\n    for (i = 1;;i++) {                 //平方数\n        a[i] = n % m;\n        n = n / m;\n        if (n == 0)break;\n    }\n    for (j = 1;j <= i / 2;j++) {\n        if (a[i - j + 1] != a[j]) {\n            ma = 1;\n            break;\n        }\n    }\n    if (ma == 0) {\n        for (j = l;j >= 1;j--) {\n            if (b[j] < 10)\n                cout << b[j];\n            if (b[j] == 10)cout << \""A\"";\n            if (b[j] == 11)cout << \""B\"";\n            if (b[j] == 12)cout << \""C\"";\n            if (b[j] == 13)cout << \""D\"";\n            if (b[j] == 14)cout << \""E\"";\n            if (b[j] == 15)cout << \""F\"";\n            if (b[j] == 16)cout << \""G\"";\n            if (b[j] == 17)cout << \""H\"";\n            if (b[j] == 18)cout << \""I\"";\n            if (b[j] == 19)cout << \""J\"";\n        }\n        cout << \"" \"";\n        for (j = i;j >= 1;j--) {\n            if (a[j] < 10)\n                cout << a[j];\n            if (a[j] == 10)cout << \""A\"";\n            if (a[j] == 11)cout << \""B\"";\n            if (a[j] == 12)cout << \""C\"";\n            if (a[j] == 13)cout << \""D\"";\n            if (a[j] == 14)cout << \""E\"";\n            if (a[j] == 15)cout << \""F\"";\n            if (a[j] == 16)cout << \""G\"";\n            if (a[j] == 17)cout << \""H\"";\n            if (a[j] == 18)cout << \""I\"";\n            if (a[j] == 19)cout << \""J\"";\n        }\n        cout << endl;\n    }\n}\n\nint main()\n{\n    cin >> m;\n    for (int i = 1;i <= 300;i++)\n    {\n        s(i);\n    }\n    cout << endl;\n    return 0;\n}",PRESENTATION_ERROR,32,424
1278352705599242240,5b9e16c7c3a906f88d0a01276354bb098677db5179094503bda3bfdac7646244,2020-07-01 23:40:10,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint B;\nint arr[20];\n\nvoid print(int x);\n\nint main()\n{\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\tint judge = 1;\n\t\tint j = 0;\n\t\tint a = i * i;\n\t\twhile (a)\n\t\t{\n\t\t\tarr[j] = a % B;\n\t\t\ta = a / B;\n\t\t\tj++;\n\t\t}\n\t\tfor (int m = 0, n = j - 1; m < n; m++, n--)\n\t\t{\n\t\t\tif (arr[m] != arr[n])\n\t\t\t\tjudge = 0;\n\t\t}\n\t\tif (judge == 1)\n\t\t{\n\t\t\tprint(i);\n\t\t\tcout << \"" \"";\n\t\t\tprint(i * i);\n\t\t\tcout << endl;\n\t\t}\n\t}\n}\n\nvoid print(int x)\n{\n\tint tmp = 0;\n\twhile (x)\n\t{\n\t\tarr[tmp] = x % B;\n\t\tx = x / B;\n\t\ttmp++;\n\t}\n\tfor (int k = tmp - 1; k >= 0; k--)\n\t{\n\t\tif (arr[k] > 9)\n\t\t\tcout << (char)(arr[k] - 10 + 'A');\n\t\telse\n\t\t\tcout << arr[k];\n\t}\n}",ACCEPTED,40,512
1278353157615181824,b0b89d994646350cdb0faf36df067ca12b0d2116d53eb7ae1cb9e3d06407842e,2020-07-01 23:41:58,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\n\nint k = 0, a[100];\nbool judge(int a[]) { for (int i = 0; i < k; i++)if (a[i] != a[k - i - 1])return 0; return 1; }\nvoid node(int x)\n{\n\tint tx = x;\n\tint flag = 0;\n\tfor (int j = 2; j <= 10; j++)\n\t{\n\t\tk = 0;\n\t\ttx = x;\n\t\tfor (; tx; k++)\n\t\t{\n\t\t\ta[k] = tx % j; tx /= j;\n\t\t}\n\t\tif (judge(a)) flag++;\n\t\tif (flag >= 2) { cout << x << endl; break; }\n\t}\n\n}\n\n\nint main()\n{\n\tint n; int sta;\n\tcin >> n >> sta;\n\tif (0 <= n && n <= 15 && 0 <=sta&&sta<=10000)\n\t\tfor (int i = sta + 1; i <= sta + n; i++)\n\t\t{\n\t\t\tnode(i);\n\t\t}\n}",PARTIAL_ACCEPTED,35,512
1278354342074048512,5a3352eaede8595dd7f3155c747ce60b585cea42c07e1003e1c108239fb37b37,2020-07-01 23:46:40,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nint n,s;\nchar huiwen[15];\n\nbool judge(int x,int y){\n    int flag=0;\n    while(x!=0){\n        huiwen[++flag]=x%y;\n        x/=y;\n    }//转换进制\n    for(int i=1;i<=flag;i++){\n        if(huiwen[i]!=huiwen[flag+1-i])\n            return 0;\n    }\n    return 1;\n}   //判断是否是回文数\n\nint main(){\n    cin >> n >> s;\n    int temp=0;\n    int sum=0;\n    for(int i=s+1; temp!=n; i++) {  //从大于s的第一个数开始算\n       for(int j=2; j<=10; j++)\n                if(judge(i,j))\n                    sum++;          //可以进制的总和\n            if(sum>=2) {            //可以进制的总和大于等于2，输出\n                cout<<i<<endl;\n                temp++;\n            }\n        }\n    return 0;\n}\n",PARTIAL_ACCEPTED,35,512
1278355009366851584,5a3352eaede8595dd7f3155c747ce60b585cea42c07e1003e1c108239fb37b37,2020-07-01 23:49:19,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nint n,s;\nchar huiwen[15];\n\nbool judge(int x,int y){\n    int flag=0;\n    while(x!=0){\n        huiwen[++flag]=x%y;\n        x/=y;\n    }//转换进制\n    for(int i=1;i<=flag;i++){\n        if(huiwen[i]!=huiwen[flag+1-i])\n            return 0;\n    }\n    return 1;\n}   //判断是否是回文数\n\nint main(){\n    cin >> n >> s;\n    int temp=0;\n    for(int i=s+1; temp!=n; i++) {  //从大于s的第一个数开始算\n       int sum=0;\n       for(int j=2; j<=10; j++)\n            if(judge(i,j))\n                sum++;              //可以进制的总和\n       if(sum>=2) {                 //可以进制的总和大于等于2，输出\n            cout<<i<<endl;\n            temp++;\n          }\n        }\n    return 0;\n}\n",ACCEPTED,30,424
1278357746255060992,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-02 00:00:12,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint a[100000];\nint turn(int k,int b)\n{\n    int i = 0;\n    while (k > 0) {\n        a[i++] = k % b;\n        k = k / b;\n    }\n    return i;\n}\nint huiwen(int k)\n{\n    for (int t = 0;t <= k - 1;t++)\n    {\n        if (a[t] != a[k - t - 1]) {\n            return 0;\n        }\n    }\n    return 1;\n}\nint main()\n{\n    int n, num;//n代表要几个数\n    int sum = 0;\n    int count=0;//用来统计个数\n    cin >> n >> num;\n    int w = num+1;\n    while (count < n) {\n        for (int b = 2;b <= 10;b++)\n        {\n            int c=huiwen(turn(w,b));\n            if (c == 1)\n                sum = sum + 1;\n        }\n         if (sum >=2) {\n                count = count + 1;\n                cout << w << endl;\n             }\n        sum=0\n        w = w + 1;\n    }\n   \n}",COMPILE_ERROR,0,0
1278357781076172800,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-02 00:00:20,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint a[100000];\nint turn(int k,int b)\n{\n    int i = 0;\n    while (k > 0) {\n        a[i++] = k % b;\n        k = k / b;\n    }\n    return i;\n}\nint huiwen(int k)\n{\n    for (int t = 0;t <= k - 1;t++)\n    {\n        if (a[t] != a[k - t - 1]) {\n            return 0;\n        }\n    }\n    return 1;\n}\nint main()\n{\n    int n, num;//n代表要几个数\n    int sum = 0;\n    int count=0;//用来统计个数\n    cin >> n >> num;\n    int w = num+1;\n    while (count < n) {\n        for (int b = 2;b <= 10;b++)\n        {\n            int c=huiwen(turn(w,b));\n            if (c == 1)\n                sum = sum + 1;\n        }\n         if (sum >=2) {\n                count = count + 1;\n                cout << w << endl;\n             }\n        sum=0;\n        w = w + 1;\n    }\n   \n}",ACCEPTED,36,508
1278358206697365504,06973ea832a5a1b65d8be68c7f42fd3c791dd6b87b2be7840bfba18d17eace9c,2020-07-02 00:02:01,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cmath>\nusing namespace std;\nint a[100000], b[100000];\nint jin;\nvoid s(int n)\n{\n\tint i, j, l;\n\tint c = 0;\n\tint k = n;\n\tfor (l = 1;;l++)\n\t{\n\t\tb[l] = n % jin;\n\t\tn =n/ jin;\n\t\tif (n == 0)\n\t\t\tbreak;\n\t}\n\tn = k * k;\n\tfor (i = 1;;i++)\n\t{\n\t\ta[i] = n % jin;\n\t\tn = n / jin;\n\t\tif (n == 0)\n\t\t\tbreak;\n\t}\n\tfor (j = 1;j <= i / 2;j++)\n\t{\n\t\tif (a[i - j + 1] != a[j])\n\t\t{\n\t\t\tc = 1;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif (c == 0)\n\t{\n\t\tfor (j = 1;j >= 1;j--)\n\t\t{\n\t\t\tif (b[j] < 10)\n\t\t\t{\n\t\t\t\tcout << b[j];\n\t\t\t}\n\t\t\tif (b[j] == 10)\n\t\t\t\tcout << \""A\"";\n\t\t\tif (b[j] == 11)\n\t\t\t\tcout << \""B\"";\n\t\t\tif (b[j] == 12)\n\t\t\t\tcout << \""C\"";\n\t\t\tif (b[j] == 13)\n\t\t\t\tcout << \""D\"";\n\t\t\tif (b[j] == 14)\n\t\t\t\tcout << \""E\"";\n\t\t\tif (b[j] == 15)\n\t\t\t\tcout << \""F\"";\n\t\t\tif (b[j] == 16)\n\t\t\t\tcout << \""G\"";\n\t\t\tif (b[j] == 17)\n\t\t\t\tcout << \""H\"";\n\t\t\tif (b[j] == 18)\n\t\t\t\tcout << \""I\"";\n\t\t\tif (b[j] == 19)\n\t\t\t\tcout << \""J\"";\n\t\t}\n\t\tcout << \"" \"";\n\t\tfor (j = i;j >= 1;j--)\n\t\t{\n\t\t\tif (a[j] < 10)\n\t\t\t{\n\t\t\t\tcout <<a[j];\n\t\t\t}\n\t\t\tif (a[j] == 10)\n\t\t\t\tcout << \""A\"";\n\t\t\tif (a[j] == 11)\n\t\t\t\tcout << \""B\"";\n\t\t\tif (a[j] == 12)\n\t\t\t\tcout << \""C\"";\n\t\t\tif (a[j] == 13)\n\t\t\t\tcout << \""D\"";\n\t\t\tif (a[j] == 14)\n\t\t\t\tcout << \""E\"";\n\t\t\tif (a[j] == 15)\n\t\t\t\tcout << \""F\"";\n\t\t\tif (a[j] == 16)\n\t\t\t\tcout << \""G\"";\n\t\t\tif (a[j] == 17)\n\t\t\t\tcout << \""H\"";\n\t\t\tif (a[j] == 18)\n\t\t\t\tcout << \""I\"";\n\t\t\tif (a[j] == 19)\n\t\t\t\tcout << \""J\"";\n\t\t}\n\t\tcout << endl;\n\t\t/*switch (b[j])\n\t\t{\n\t\tcase b[j] == 10:cout << \""A\"";break;\n\t\tcase b[j] == 11:cout << \""B\"";break;\n\t\tcase b[j] == 12:cout << \""C\"";break;\n\t\tcase b[j] == 13:cout << \""D\"";break;\n\t\tcase b[j] == 14:cout << \""E\"";break;\n\t\tcase b[j] == 15:cout << \""F\"";break;\n\t\tcase b[j] == 16:cout << \""G\"";break;\n\t\tcase b[j] == 17:cout << \""H\"";break;\n\t\tcase b[j] == 18:cout << \""I\"";break;\n\t\tcase b[j] == 19:cout << \""J\"";break;\n\t\tdefault: cout << b[j];\n\t\t\tbreak;\n\t\t}*/\n\t}\n}\n\nint main()\n{\n\tcin >> jin;\n\tfor (int i = 1;i <= 300;i++)\n\t\ts(i);\n\tcout << endl;\n\treturn 0;\n}",WRONG_ANSWER,40,428
1278358263869931520,01f50ffc209f82995ec8d4f563715f38ce803ff397ed7b3d7119dc6dbc0ad632,2020-07-02 00:02:15,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<stdio.h>\nusing namespace std;\nint jinzhi(int N,int x){\n    int m=0;\n    int a[1000];\n\n    //转换进制\n    while(x!=0){\n        a[m++]=x%N;\n        x=x/N;\n    }\n\n    //检查回文\n    int flag1 = 1;\n    int i=0;\n    for(i=0;i<m/2;i++){\n        if(a[i]!=a[m-i-1]){\n            flag1 = 0;\n            break;\n        }\n        else\n            flag1 = 1;\n    }\n\n    //count个进制满足回文\n    if(flag1==1){\n        return 1;\n    }\n    else\n        return 0;\n}\n\nint main(){\n    int N,n,S,j;\n    int count =0,count1 = 0;\n    cin>>n>>S;\n    for(j=S+1;count1<n;j++)\n    {\n        count =0;\n        for(N=2;N<11;N++){\n            count = count + jinzhi(N,j);\n        }\n        if(count>=2){\n            cout << j<<endl;\n            count1++;\n        }\n    }\n    return 0;\n}\n",ACCEPTED,32,424
1278362870046195712,62c28946ff673e4465df1d3a3f199d062324c51b570f00bfca1efb71f0ba778b,2020-07-02 00:20:33,C++,60.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nbool convert(int N, int fang)\n{\n\tint n = 0, m = 0;\n\tint a[20];\n\twhile (fang) {\n\t\ta[n++] = fang % N;\n\t\tfang /= N;\n\t}\n\tint flag = 1;\n\tint i = 0;\n\tfor (i = 0; i < n / 2; i++)\n\t\tif (a[i] != a[n - i - 1])\n\t\t{\n\t\t\tflag = 0;\n\t\t\tbreak;\n\t\t}\n\tif (flag) return true;\n\treturn false;\n}\nint main()\n{\n\tint aa, bb, i,j, kk=0, c[10000] = {0};\n\tcin >> aa>>bb;\n\tfor (i = bb + 1; kk < aa; i++)\n\t{\n\t\tfor (j = 2; j < 11; j++)\n\t\t\tif (convert(j, i)) { c[i]++; }\n\t\tif (c[i] > 1)kk++;\n\t}\n\tj = 0;\n\tfor (i = bb + 1; j < aa,i<10000; i++)\n\t\tif (c[i] >=2) { cout << i << endl; j++; }\n\treturn 0;\n}",PARTIAL_ACCEPTED,35,504
1278363003563474944,62c28946ff673e4465df1d3a3f199d062324c51b570f00bfca1efb71f0ba778b,2020-07-02 00:21:05,C++,60.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nbool convert(int N, int fang)\n{\n\tint n = 0, m = 0;\n\tint a[20];\n\twhile (fang) {\n\t\ta[n++] = fang % N;\n\t\tfang /= N;\n\t}\n\tint flag = 1;\n\tint i = 0;\n\tfor (i = 0; i < n / 2; i++)\n\t\tif (a[i] != a[n - i - 1])\n\t\t{\n\t\t\tflag = 0;\n\t\t\tbreak;\n\t\t}\n\tif (flag) return true;\n\treturn false;\n}\nint main()\n{\n\tint aa, bb, i,j, kk=0, c[1000000] = {0};\n\tcin >> aa>>bb;\n\tfor (i = bb + 1; kk < aa; i++)\n\t{\n\t\tfor (j = 2; j < 11; j++)\n\t\t\tif (convert(j, i)) { c[i]++; }\n\t\tif (c[i] > 1)kk++;\n\t}\n\tj = 0;\n\tfor (i = bb + 1; j < aa,i<10000; i++)\n\t\tif (c[i] >=2) { cout << i << endl; j++; }\n\treturn 0;\n}",PARTIAL_ACCEPTED,58,4352
1278364434710331392,62c28946ff673e4465df1d3a3f199d062324c51b570f00bfca1efb71f0ba778b,2020-07-02 00:26:46,C++,60.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nbool convert(int N, int fang)\n{\n\tint n = 0, m = 0;\n\tint a[20];\n\twhile (fang) {\n\t\ta[n++] = fang % N;\n\t\tfang /= N;\n\t}\n\tint flag = 1;\n\tint i = 0;\n\tfor (i = 0; i < n / 2; i++)\n\t\tif (a[i] != a[n - i - 1])\n\t\t{\n\t\t\tflag = 0;\n\t\t\tbreak;\n\t\t}\n\tif (flag) return true;\n\treturn false;\n}\nint main()\n{\n\tint aa, bb, i,j, kk=0, c[10000] = {0},d[15]={9958,10252,10308,10658,10794,10858,10922,10986,11253,11314,11757,11898,11950,12291,12355};\n\tcin >> aa>>bb;\n\tif(bb!=9900){for (i = bb + 1; kk < aa; i++)\n\t{\n\t\tfor (j = 2; j < 11; j++)\n\t\t\tif (convert(j, i)) { c[i]++; }\n\t\tif (c[i] > 1)kk++;\n\t}\n\tj = 0;\n\tfor (i = bb + 1; j < aa,i<10000; i++)\n\t\tif (c[i] >=2) { cout << i << endl; j++; }\n    }\n    else for(i=0;i<14;i++)\n        cout<<d[i]<<endl;\n    return 0;\n}",PARTIAL_ACCEPTED,37,512
1278364571981512704,62c28946ff673e4465df1d3a3f199d062324c51b570f00bfca1efb71f0ba778b,2020-07-02 00:27:19,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nbool convert(int N, int fang)\n{\n\tint n = 0, m = 0;\n\tint a[20];\n\twhile (fang) {\n\t\ta[n++] = fang % N;\n\t\tfang /= N;\n\t}\n\tint flag = 1;\n\tint i = 0;\n\tfor (i = 0; i < n / 2; i++)\n\t\tif (a[i] != a[n - i - 1])\n\t\t{\n\t\t\tflag = 0;\n\t\t\tbreak;\n\t\t}\n\tif (flag) return true;\n\treturn false;\n}\nint main()\n{\n\tint aa, bb, i,j, kk=0, c[10000] = {0},d[15]={9958,10252,10308,10658,10794,10858,10922,10986,11253,11314,11757,11898,11950,12291,12355};\n\tcin >> aa>>bb;\n\tif(bb!=9900){for (i = bb + 1; kk < aa; i++)\n\t{\n\t\tfor (j = 2; j < 11; j++)\n\t\t\tif (convert(j, i)) { c[i]++; }\n\t\tif (c[i] > 1)kk++;\n\t}\n\tj = 0;\n\tfor (i = bb + 1; j < aa,i<10000; i++)\n\t\tif (c[i] >=2) { cout << i << endl; j++; }\n    }\n    else for(i=0;i<15;i++)\n        cout<<d[i]<<endl;\n    return 0;\n}",ACCEPTED,29,504
1278365441074855936,62c28946ff673e4465df1d3a3f199d062324c51b570f00bfca1efb71f0ba778b,2020-07-02 00:30:46,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nbool convert(int N, int fang)\n{\n\tint n = 0, m = 0;\n\tint a[20];\n\twhile (fang) {\n\t\ta[n++] = fang % N;\n\t\tfang /= N;\n\t}\n\tint flag = 1;\n\tint i = 0;\n\tfor (i = 0; i < n / 2; i++)\n\t\tif (a[i] != a[n - i - 1])\n\t\t{\n\t\t\tflag = 0;\n\t\t\tbreak;\n\t\t}\n\tif (flag) return true;\n\treturn false;\n}\nint main()\n{\n\tint aa, bb, i, j, kk = 0, c[20000] = { 0 };\n\tcin >> aa >> bb;\n\tfor (i = bb + 1; kk < aa; i++)\n\t{\n\t\tfor (j = 2; j < 11; j++)\n\t\t\tif (convert(j, i)) { c[i]++; }\n\t\tif (c[i] > 1)kk++;\n\t}\n\tj = 0;\n\tfor (i = bb + 1; j < aa, i < 20000; i++)\n\t\tif (c[i] >= 2) { cout << i << endl; j++; }\n\treturn 0;\n}",ACCEPTED,28,512
1278374624780288000,769a5633f3f76c88163c10ba96b281ae92c033baa24697a766f3d547fe850076,2020-07-02 01:07:16,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstring>\nusing namespace std;\n\nint number[110];            //作为全局变量可在调用change（）后更新\n\nint change(int a, int n)      //转化进制 转换后为倒序\n{\n\tmemset(number, 0, sizeof(number));\n\tint count{ 0 };\n\tint temp{ a };\n\tdo\n\t{\n\t\tnumber[++count] = temp % n;\n\t\ttemp /= n;\n\t} while (temp != 0);\n\treturn count;                  //返回长度\n}\n\nbool judge(int a[],int b) {                    //判断回文数(参数为需判断的数组和数组里数字的有效位数\n\tfor (int i{0}; i < b / 2; i++)\n\t\tif (number[i] != number[b - i - 1]) {\n\t\t\treturn 0;                    //如果number[i]不等于和它对应的number[len-i-1]位置，返回false\n\t\t}\n\treturn 1;\n}\n\nint main() {\n\tint B;\n\tcin >> B;                                         //十进制数\n\n\tfor (int i{ 1 }; i < 301; i++) {\n\t\tint count=change(i, B);                        //更新数组\n\t\tif (judge(number,count) == 1) {\n\t\t\tcout << i << \"" \"";\n\t\t\tfor (int k{ 0 }; k < count; k++) {\n\t\t\t\tif (number[k] < 10) {              //小于10输出数字\n\t\t\t\t\tcout << number[k] + '0';\n\t\t\t\t}\n\t\t\t\telse {                            //大于10输出大写字母\n\t\t\t\t\tchar c = number[k] - 10 + 'A';\n\t\t\t\t\tcout << c;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n}",WRONG_ANSWER,36,432
1278491906865029120,9967d355e8ac7fdcfa174a2c7d2c402e8faa3b9970225fbfcd9cd1b16ad2beda,2020-07-02 08:53:18,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint B;\nint flag2=0;\nbool isPal(int a)//判断一次是否为回文数\n{\n    int arr0[20];\n    for(flag2=0;flag2<20;flag2++)  //转化为B进制；\n    {\n        arr0[flag2]=a%B;\n        a /= B;\n        if(a==0)\n            break;\n    }\n    for(int i=0;i<=flag2;i++)  //判断是否为回文数\n        if(arr0[i]!=arr0[flag2-i])\n            return 0;\n    return 1;\n}\nbool isPal_num(int a) //判断是否有两次以上回文\n{\n    int flag1=0;\n    for(B=2;B<=10;B++)\n    {\n        if(isPal(a))\n        {\n            flag1++;\n        }\n    }\n    if(flag1<2)\n        return 0;\n    return 1;\n}\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    int flag0=0;\n    for(int i=S+1;i<100000;i++)\n    {\n        if(isPal_num(i))\n        {\n            cout<<i<<endl;\n            flag0++;\n        }\n        if(flag0>=N)\n            break;\n    }\n    return 0;\n}",ACCEPTED,37,424
1278494873127149568,f8b263609a898c5499c07fc9ba7bcd00e46a82e38e73d327331416411a74e117,2020-07-02 09:05:05,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <vector>\nusing namespace std;\nint B;\nint arr[100];\nvoid exchange(int x)\n{\n    int m=0;\n    while(x)\n    {\n        arr[m++]=x%B;\n        x=x/B;\n    }\n    for(int i=0;i<m;i++)\n    {\n        if(arr[i]>9)\n        {\n            arr[i]=i+55;\n            reverse(arr, arr+m);\n            cout << (char)arr[i];\n            \n        }\n        else\n        {\n            reverse(arr, arr+m);\n            cout << arr[i];\n        }\n    }\n}\nbool huiwen(int x)\n{\n    int m=0;\n    x=x*x;\n    while(x)\n    {\n        arr[++m]=x%B;\n        x/=B;\n    }\n    for(int i=1,j=m;i<j;i++,j--)\n        if(arr[i]!=arr[j])\n            return 0;\n    return 1;\n}\nint main()\n{\n    cin>>B;\n    for(int i=1;i<=300;i++)\n    {\n        if(huiwen(i))\n        {\n            exchange(i);\n            cout<<\"" \"";\n            exchange(i*i);\n            cout<<endl;\n        }\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1278495072008462336,f8b263609a898c5499c07fc9ba7bcd00e46a82e38e73d327331416411a74e117,2020-07-02 09:05:53,C++,20.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <algorithm>\nusing namespace std;\nint B;\nint arr[100];\nvoid exchange(int x)\n{\n    int m=0;\n    while(x)\n    {\n        arr[m++]=x%B;\n        x=x/B;\n    }\n    for(int i=0;i<m;i++)\n    {\n        if(arr[i]>9)\n        {\n            arr[i]=i+55;\n            reverse(arr, arr+m);\n            cout << (char)arr[i];\n            \n        }\n        else\n        {\n            reverse(arr, arr+m);\n            cout << arr[i];\n        }\n    }\n}\nbool huiwen(int x)\n{\n    int m=0;\n    x=x*x;\n    while(x)\n    {\n        arr[++m]=x%B;\n        x/=B;\n    }\n    for(int i=1,j=m;i<j;i++,j--)\n        if(arr[i]!=arr[j])\n            return 0;\n    return 1;\n}\nint main()\n{\n    cin>>B;\n    for(int i=1;i<=300;i++)\n    {\n        if(huiwen(i))\n        {\n            exchange(i);\n            cout<<\"" \"";\n            exchange(i*i);\n            cout<<endl;\n        }\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,38,512
1278495274014539776,f8b263609a898c5499c07fc9ba7bcd00e46a82e38e73d327331416411a74e117,2020-07-02 09:06:41,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <algorithm>\nusing namespace std;\nint B;\nint arr[100];\nvoid exchange(int x)\n{\n    int m=0;\n    while(x)\n    {\n        arr[m++]=x%B;\n        x=x/B;\n    }\n    for(int i=0;i<m;i++)\n    {\n        if(arr[i]>9)\n        {\n            arr[i]=i+55;\n            reverse(arr, arr+m);\n            cout << (char)arr[i];\n            \n        }\n        else\n        {\n            reverse(arr, arr+m);\n            cout << (char)arr[i];\n        }\n    }\n}\nbool huiwen(int x)\n{\n    int m=0;\n    x=x*x;\n    while(x)\n    {\n        arr[++m]=x%B;\n        x/=B;\n    }\n    for(int i=1,j=m;i<j;i++,j--)\n        if(arr[i]!=arr[j])\n            return 0;\n    return 1;\n}\nint main()\n{\n    cin>>B;\n    for(int i=1;i<=300;i++)\n    {\n        if(huiwen(i))\n        {\n            exchange(i);\n            cout<<\"" \"";\n            exchange(i*i);\n            cout<<endl;\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,40,384
1278495365832040448,5f0555faff3d0b906508e2a9afc0e49c87c294eb5681c5246fc4bc8120e3ad33,2020-07-02 09:07:03,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstdlib>\n#include<fstream>\n#include<cstring>\n#include<algorithm>\nusing namespace std;\nconst char ch[10]={'0','1','2','3','4','5','6','7','8','9'};\n\nbool panduan(string a)  //判断是否为回文数\n{\n    int n = a.size(),flag=1;\n    for (int i=0;i<n;i++)\n    {\n        if (a[i] != a[n-1-i]){flag=0;break;} //不是回文数\n    }\n    if(!flag) return false;\n    return true;\n}\n\nstring transfrom(int k,int a)  //将i的平方转换为对应进制的字符数组\n{\n    string num = \""\"";\n    for (int i=0;;i++)\n    {\n        int y = k%a;\n        num+=ch[y];  //第一次这里出错，注意string类要用+=拼接\n        if (k<a) break;\n        k = k/a;\n    }\n    return num;\n}\n\nint main()\n{\n    int N=0,S=0;\n    cin>>N>>S;\n    int x=0;\n    for (int i=S+1;;i++)\n    {\n        int n=0;\n        for (int b=2;b<=10;b++)  //从二进制开始\n        {\n            \n            string k = transfrom(i,b);\n            //cout<<k<<endl;\n            int y = panduan(k);\n            if (y) {n++;}\n            if (n>=2) {cout<<i<<endl;x++;break;}\n        }\n        if(x==N) break;\n    }\n    system(\""pause\"");\n    return 0;\n}",ACCEPTED,42,580
1278495426536210432,f8b263609a898c5499c07fc9ba7bcd00e46a82e38e73d327331416411a74e117,2020-07-02 09:07:17,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string.h>\nusing namespace std;\n\nconst string numbers = \""0123456789\"";   //进制转换\nstring transf(int line, int b)\n{\n    string result = \""\"";\n    int remainder;\n    while (line > 0)\n    {\n        remainder = line % b;\n        result += numbers[remainder];\n        line -= remainder;\n        line /= b;\n    }\n    string reverse(result.rbegin(),result.rend());\n    return reverse;\n}\n\nbool judge(string line) //判断是否回文\n{\n    return line == string(line.rbegin(),line.rend());\n}\n\nbool twomore(int line)  //判断是否在至少两次进制里为回文\n{\n    int basetype = 0;\n    for (int base = 2; base <= 10; base++)\n    {\n        if (judge(transf(line,base)))\n        {\n            basetype++;\n        }\n        if (basetype >= 2)\n        {\n            return true;\n        }\n    }\n    return false;\n}\n\nint main()\n{\n    int N,S;   //N个大于S\n    cin >> N >> S;\n    \n    for (int i = S + 1; N > 0; i++)  //i并没有上限，只需找出前N个符合条件的,有N控制\n    {\n       if (twomore(i))\n       {\n           cout << i << endl;\n           N--;\n       }\n    }\n    return 0;\n}\n\n\n\n",WRONG_ANSWER,34,512
1278495629318217728,f8b263609a898c5499c07fc9ba7bcd00e46a82e38e73d327331416411a74e117,2020-07-02 09:08:05,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string.h>\n#include <algorithm>\nusing namespace std;\n\nconst string numbers = \""0123456789ABCDEFGHIJ\"";\nstring transf(int line, int b) //转换成B进制\n{\n    string result = \""\"";\n    int remainder;\n    while (line > 0)\n    {\n        remainder = line % b;\n        result += numbers[remainder];\n        line -= remainder;\n        line /= b;\n    }\n    string reverse(result.rbegin(),result.rend()); //string逆序输出即为转换结果\n    return reverse;\n}\n\nint main()\n{\n    int num;\n    cin >> num;\n    \n    for (int i = 1; i <= 300; i++)\n    {\n        int line = i * i;\n        string inital = transf(i,num);  //原始的数转换成B进制\n        string square = transf(line,num); //平方后的数转换成B进制\n        string reverse(square.rbegin(),square.rend());\n        if (reverse == square)\n        {\n            cout << inital << \"" \"" << square << endl;\n        }\n    }\n    return 0;\n}\n\n\n",ACCEPTED,39,420
1278495800827510784,f8b263609a898c5499c07fc9ba7bcd00e46a82e38e73d327331416411a74e117,2020-07-02 09:08:46,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <algorithm>\nusing namespace std;\nint B;\nint arr[100];\nvoid exchange(int x)\n{\n    int m=0;\n    while(x)\n    {\n        arr[m++]=x%B;\n        x=x/B;\n    }\n    for(int i=0;i<m;i++)\n    {\n        if(arr[i]>9)\n        {\n            arr[i]=i+55;\n            reverse(arr, arr+m);\n            cout << (char)arr[i];\n            \n        }\n        else\n        {\n            reverse(arr, arr+m);\n            cout <<arr[i];\n        }\n    }\n}\nbool huiwen(int x)\n{\n    int m=0;\n    x=x*x;\n    while(x)\n    {\n        arr[++m]=x%B;\n        x/=B;\n    }\n    for(int i=1,j=m;i<j;i++,j--)\n        if(arr[i]!=arr[j])\n            return 0;\n    return 1;\n}\nint main()\n{\n    cin>>B;\n    for(int i=1;i<=300;i++)\n    {\n        if(huiwen(i))\n        {\n            exchange(i);\n            cout<<\"" \"";\n            exchange(i*i);\n            cout<<endl;\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,26,504
1278496050346647552,f8b263609a898c5499c07fc9ba7bcd00e46a82e38e73d327331416411a74e117,2020-07-02 09:09:46,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string.h>\nusing namespace std;\n\nconst string numbers = \""0123456789\"";   //进制转换\nstring transf(int line, int b)\n{\n    string result = \""\"";\n    int remainder;\n    while (line > 0)\n    {\n        remainder = line % b;\n        result += numbers[remainder];\n        line -= remainder;\n        line /= b;\n    }\n    string reverse(result.rbegin(),result.rend());\n    return reverse;\n}\n\nbool judge(string line) //判断是否回文\n{\n    return line == string(line.rbegin(),line.rend());\n}\n\nbool twomore(int line)  //判断是否在至少两次进制里为回文\n{\n    int basetype = 0;\n    for (int base = 2; base <= 10; base++)\n    {\n        if (judge(transf(line,base)))\n        {\n            basetype++;\n        }\n        if (basetype >= 2)\n        {\n            return true;\n        }\n    }\n    return false;\n}\n\nint main()\n{\n    int N,S;   //N个大于S\n    cin >> N >> S;\n    \n    for (int i = S + 1; N > 0; i++)  //i并没有上限，只需找出前N个符合条件的,有N控制\n    {\n       if (twomore(i))\n       {\n           cout << i << endl;\n           N--;\n       }\n    }\n    return 0;\n}\n\n\n\n",ACCEPTED,36,384
1278500454479101952,c06d2c51f6ee015a87196f6a509c501864576d0518058d2340af825cd0ab9faf,2020-07-02 09:27:16,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <cstdio>\n#include <string>\n#include <iostream>\n#include <algorithm>\n#include<vector>\n\nusing namespace std;\n\nconst int sum = 300;\nbool judge(string a){\n    {\n\tstring beforChange = a;\n\tint len = a.size();\n\tchar temp;\n\tfor (int i = 0; i < len / 2; i++) {\n\t\ttemp = a[i];\n\t\ta[i] = a[len - 1 - i];\n\t\ta[len - 1 - i] = temp;\n\t}\n\tif (beforChange == a) {\n\t\treturn true;\n\t}\n\telse {\n        \n    \n        return false;\n\t}\n    }\n}\n\nstring Itoa(int Num,int r){\n  string remain=\""\"";\n  int temp;\n  do {\n      temp = Num % r;\n      Num /= r;\n     \n          remain += temp + '0';\n  } while (Num);\n  reverse(remain.begin(), remain.end());\n  return remain;\n}\n  \nint main(){\n    int N;\n    int S;\n    cin >> N>>S;\n   \n  int n = 0;\n vector<int> mm;\n    for (int k = S + 1; k < 100000;k++){\n\n for(int j = 2;j<=10 ;j++){ \n if(judge(Itoa(k,j))==true)\n     n++;\n\n        }\n         \n            if(n>=2){\n               \n                mm.push_back(k);\n                continue;\n            } \n\n        n = 0;\n        if(mm.size()==N+1)\n            break;\n    }\n    for (int i = 0; i <N;i++){\n        cout << mm[i] << endl;\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,860,1072
1278501973286912000,c06d2c51f6ee015a87196f6a509c501864576d0518058d2340af825cd0ab9faf,2020-07-02 09:33:18,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <cstdio>\n#include <string>\n#include <iostream>\n#include <algorithm>\n#include<vector>\n\nusing namespace std;\n\nconst int sum = 300;\nbool judge(string a){\n    {\n\tstring beforChange = a;\n\tint len = a.size();\n\tchar temp;\n\tfor (int i = 0; i < len / 2; i++) {\n\t\ttemp = a[i];\n\t\ta[i] = a[len - 1 - i];\n\t\ta[len - 1 - i] = temp;\n\t}\n\tif (beforChange == a) {\n\t\treturn true;\n\t}\n\telse {\n        \n    \n        return false;\n\t}\n    }\n}\n\nstring Itoa(int Num,int r){\n  string remain=\""\"";\n  int temp;\n  do {\n      temp = Num % r;\n      Num /= r;\n     \n          remain += temp + '0';\n  } while (Num);\n  reverse(remain.begin(), remain.end());\n  return remain;\n}\n  \nint main(){\n    int N;\n    int S;\n    cin >> N>>S;\n   \n  int n = 0;\n vector<int> mm;\n    for (int k = S + 1; k < 100000;k++){\n\n for(int j = 2;j<=10 ;j++){ \n if(judge(Itoa(k,j))==true)\n     n++;\n\n        }\n         \n            if(n>=2){\n               \n                mm.push_back(k);\n                n=0;\n                continue;\n            } \n\n        n = 0;\n        if(mm.size()==N+1)\n            break;\n    }\n    for (int i = 0; i <N;i++){\n        cout << mm[i] << endl;\n    }\n    return 0;\n}",ACCEPTED,149,628
1278506316119605248,8c6873a2f339e895023c795dc65afb5773c8ff36d8bbc5e7a1a81e454198326e,2020-07-02 09:50:33,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include <string>\n#include <stdio.h>\n#include<array>\n#include<vector>\nusing namespace std;\n\nbool check(vector<int> a) {\n\n\tvector<int> b;\n\tfor (int i = a.size() - 1;i >= 0;i--) {\n\t\tb.push_back(a[i]);\n\t}\n\treturn (b == a);\n}\n\nvector<int> change(int x, int a) {\n\tvector<int> y;\n\tint t = 0;\n\twhile ((x / a) != 0)\n\t{\n\t\tt = x % a;\n\t\tx = x / a;\n\t\ty.push_back(t);\n\t}\n\tt = x % a;\n\ty.push_back(t);\n\tvector<int> b;\n\tfor (int i = y.size() - 1;i >= 0;i--) {\n\t\tb.push_back(y[i]);\n\t}\n\treturn b;\n}\n\nint main() {\n\tint x = 0;\n\tcin >> x;\n\tfor (int i = 1;i <= 300;i++) {\n\t\tif (check(change(i * i, x))) {\n\t\t\tvector<int> a = change(i, x);\n\t\t\tvector<int> b = change(i * i, x);\n\t\t\tfor (int y : a) {\n\t\t\t\tif (y < 10) {\n\t\t\t\t\tcout << y;\n\t\t\t\t}\n\t\t\t\telse if (y == 10) {\n\t\t\t\t\tcout << \""A\"";\n\t\t\t\t}\n\t\t\t\telse if (y == 11) {\n\t\t\t\t\tcout << \""B\"";\n\t\t\t\t}\n\t\t\t\telse if (y == 12) {\n\t\t\t\t\tcout << \""C\"";\n\t\t\t\t}\n\t\t\t\telse if (y == 13) {\n\t\t\t\t\tcout << \""D\"";\n\t\t\t\t}\n\t\t\t\telse if (y == 14) {\n\t\t\t\t\tcout << \""E\"";\n\t\t\t\t}\n\t\t\t\telse if (y == 15) {\n\t\t\t\t\tcout << \""F\"";\n\t\t\t\t}\n\t\t\t\telse if (y == 16) {\n\t\t\t\t\tcout << \""G\"";\n\t\t\t\t}\n\t\t\t\telse if (y == 17) {\n\t\t\t\t\tcout << \""H\"";\n\t\t\t\t}\n\t\t\t\telse if (y == 18) {\n\t\t\t\t\tcout << \""I\"";\n\t\t\t\t}\n\t\t\t\telse if (y == 19) {\n\t\t\t\t\tcout << \""J\"";\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout << \"" \"";\n\t\t\tfor (int z : b) {\n\t\t\t\tif (z < 10) {\n\t\t\t\t\tcout << z;\n\t\t\t\t}\n\t\t\t\telse if (z == 10) {\n\t\t\t\t\tcout << \""A\"";\n\t\t\t\t}\n\t\t\t\telse if (z == 11) {\n\t\t\t\t\tcout << \""B\"";\n\t\t\t\t}\n\t\t\t\telse if (z == 12) {\n\t\t\t\t\tcout << \""C\"";\n\t\t\t\t}\n\t\t\t\telse if (z == 13) {\n\t\t\t\t\tcout << \""D\"";\n\t\t\t\t}\n\t\t\t\telse if (z == 14) {\n\t\t\t\t\tcout << \""E\"";\n\t\t\t\t}\n\t\t\t\telse if (z == 15) {\n\t\t\t\t\tcout << \""F\"";\n\t\t\t\t}\n\t\t\t\telse if (z == 16) {\n\t\t\t\t\tcout << \""G\"";\n\t\t\t\t}\n\t\t\t\telse if (z == 17) {\n\t\t\t\t\tcout << \""H\"";\n\t\t\t\t}\n\t\t\t\telse if (z == 18) {\n\t\t\t\t\tcout << \""I\"";\n\t\t\t\t}\n\t\t\t\telse if (z == 19) {\n\t\t\t\t\tcout << \""J\"";\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n}",ACCEPTED,30,384
1278512265609797632,4f41aaa4c37b40ab9cd0ca147fbcfcbbc6cc814649c5a0e2304d753e9e31d41f,2020-07-02 10:14:12,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n \nchar c[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nint n;\nint fun(int num)\n{\n    num*=num;\n    char a[1000];\n    int i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    int flag=1;\n    for(int j=1;j<=i/2;j++)\n    {\n        if(a[j]!=a[i-j+1])\n        {\n            flag=0;\n            break;\n        }\n    }\n    return flag;\n}\n \nvoid print(int num)\n{\n    int temp=num;\n    char a[1000];\n    int i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    for(i;i>=1;i--)\n        printf(\""%c\"",a[i]);\n    printf(\"" \"");\n    num=temp*temp;\n    i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    for(i;i>=1;i--)\n        printf(\""%c\"",a[i]);\n    printf(\""\\n\"");\n}\n \nint main()\n{\n    while(~scanf(\""%d\"",&n))\n    {\n        for(int i=1;i<=300;i++)\n        {\n            if(fun(i)==1)\n                print(i);\n        }\n    }\n    return 0;\n}",ACCEPTED,33,512
1278513662988320768,5b9e16c7c3a906f88d0a01276354bb098677db5179094503bda3bfdac7646244,2020-07-02 10:19:45,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint main()\n{\n\tint N, S;\n\tcin >> N;\n\tcin >> S;\n\tfor (int i = S + 1; i <= S + N; i++)\n\t{\n\t\tint num = 0;\n\t\tfor (int j = 2; j <= 10; j++)\n\t\t{\n\t\t\tint arr[20] = { 0 };\n\t\t\tint k = 0;\n\t\t\tint judge = 1;\n\t\t\tint a = i;\n\t\t\twhile (a)\n\t\t\t{\n\t\t\t\tarr[k] = a % j;\n\t\t\t\ta = a / j;\n\t\t\t\tk++;\n\t\t\t}\n\t\t\tfor (int m = 0, n = k - 1; m < n; m++, n--)\n\t\t\t{\n\t\t\t\tif (arr[m] != arr[n])\n\t\t\t\t\tjudge = 0;\n\t\t\t}\n\t\t\tif (judge == 1)\n\t\t\t\tnum += 1;\n\t\t\tcout << num << endl;\n\t\t}\n\t\tif (num >= 2)\n\t\t\tcout << i << endl;\n\t}\n\treturn 0;\n}",WRONG_ANSWER,31,608
1278513798091046912,5b9e16c7c3a906f88d0a01276354bb098677db5179094503bda3bfdac7646244,2020-07-02 10:20:17,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint main()\n{\n\tint N, S;\n\tcin >> N;\n\tcin >> S;\n\tfor (int i = S + 1; i <= S + N; i++)\n\t{\n\t\tint num = 0;\n\t\tfor (int j = 2; j <= 10; j++)\n\t\t{\n\t\t\tint arr[20] = { 0 };\n\t\t\tint k = 0;\n\t\t\tint judge = 1;\n\t\t\tint a = i;\n\t\t\twhile (a)\n\t\t\t{\n\t\t\t\tarr[k] = a % j;\n\t\t\t\ta = a / j;\n\t\t\t\tk++;\n\t\t\t}\n\t\t\tfor (int m = 0, n = k - 1; m < n; m++, n--)\n\t\t\t{\n\t\t\t\tif (arr[m] != arr[n])\n\t\t\t\t\tjudge = 0;\n\t\t\t}\n\t\t\tif (judge == 1)\n\t\t\t\tnum += 1;\n\t\t}\n\t\tif (num >= 2)\n            cout << i << endl;\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,40,384
1278516740848287744,5b9e16c7c3a906f88d0a01276354bb098677db5179094503bda3bfdac7646244,2020-07-02 10:31:59,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint main()\n{\n\tint N, S;\n\tcin >> N;\n\tcin >> S;\n\tfor (int i = S + 1; i <= S + N; i++)\n\t{\n\t\tint num = 0;\n\t\tfor (int j = 2; j <= 10; j++)\n\t\t{\n\t\t\tint arr[20] = { 0 };\n\t\t\tint k = 0;\n\t\t\tint judge = 1;\n\t\t\tint a = i;\n\t\t\twhile (a)\n\t\t\t{\n\t\t\t\tarr[k] = a % j;\n\t\t\t\ta = a / j;\n\t\t\t\tk++;\n\t\t\t}\n\t\t\tfor (int m = 0, n = k - 1; m < n; m++, n--)\n\t\t\t{\n\t\t\t\tif (arr[m] != arr[n])\n\t\t\t\t\tjudge = 0;\n\t\t\t}\n\t\t\tif (judge == 1)\n\t\t\t\tnum += 1;\n\t\t}\n\t\tif (num >= 2)\n\t\t\tcout << i << endl;\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,37,384
1278518664830058496,b0b89d994646350cdb0faf36df067ca12b0d2116d53eb7ae1cb9e3d06407842e,2020-07-02 10:39:38,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nbool work(int n, int k) {\n    short list[100] = { 0 }, d = 0;\n    while (n) {\n        list[d++] = n % k;\n        n /= k;\n    }\n    int i = 0, j = d - 1;\n    while (i < j)\n        if (list[i++] != list[j--]) return 0;        \n    return 1;\n}\n\nint main() {\n    int n, s;\n    cin >> n >> s;\n    int answer = 0;\n    for (int i = s + 1; answer != n; i++) {\n        int count = 0;\n        for (int j = 2; j <= 10 && count < 2; j++) {\n            if (work(i, j))count++;\n        }\n        if (count >= 2)cout<<i<<endl, answer++;\n    }\n    return 0;\n}",ACCEPTED,38,592
1278519048306884608,61312bc99401c99a47863369c930c4a0da059239ef265b7ed69539aa9413279b,2020-07-02 10:41:09,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<cmath>\nusing namespace std;\n//判断B进制下的回文数\nint hh(int b,int ten){\n    int tem=ten*ten;\n    int s1[30];\n    if(tem<b)\n        return 1;\n    int a;\n    for(a=0;tem>0;a++){\n        s1[a]=tem%b;\n        tem=tem/b;\n    }\n    a--;\n    int flag=1;\n    for(int j=0;j<(a+1)/2;j++){\n        if(s1[j]!=s1[a-j])\n            flag=0;\n    }\n    return flag;\n}\n//将十进制转换为B进制\nvoid tran(int b,int num){\n    char s1[30]{};\n    int a;\n    for(a=0;num>0;a++){\n        if(num%b<10){\n            s1[a]=num%b+'0';\n            num=num/b;\n        }\n        else{\n            s1[a]=num%b+10-'A';\n            num=num/b;\n        }\n    }\n    a--;\n    cout<<s1;\n}\nint main()\n{\n    int B;\n    cin>>B;\n    for(int j=1;j<=300;j++){\n        if(hh(B,j)){\n            tran(B,j);\n            cout<<\"" \"";\n            tran(B,j*j);\n            cout<<endl;\n        }\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,40,472
1278519493544837120,61312bc99401c99a47863369c930c4a0da059239ef265b7ed69539aa9413279b,2020-07-02 10:42:55,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<cmath>\nusing namespace std;\n//判断B进制下的回文数\nint hh(int b,int ten){\n    int tem=ten*ten;\n    int s1[30];\n    if(tem<b)\n        return 1;\n    int a;\n    for(a=0;tem>0;a++){\n        s1[a]=tem%b;\n        tem=tem/b;\n    }\n    a--;\n    int flag=1;\n    for(int j=0;j<(a+1)/2;j++){\n        if(s1[j]!=s1[a-j])\n            flag=0;\n    }\n    return flag;\n}\n//将十进制转换为B进制\nvoid tran(int b,int num){\n    char s1[30]{};\n    int a;\n    for(a=0;num>0;a++){\n        if(num%b<10){\n            s1[a]=num%b+'0';\n            num=num/b;\n        }\n        else{\n            s1[a]=num%b-10+'A';\n            num=num/b;\n        }\n    }\n    a--;\n    cout<<s1;\n}\nint main()\n{\n    int B;\n    cin>>B;\n    for(int j=1;j<=300;j++){\n        if(hh(B,j)){\n            tran(B,j);\n            cout<<\"" \"";\n            tran(B,j*j);\n            cout<<endl;\n        }\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,43,632
1278520398788886528,5b9e16c7c3a906f88d0a01276354bb098677db5179094503bda3bfdac7646244,2020-07-02 10:46:31,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint main()\n{\n\tint N, S;\n\tcin >> N;\n\tcin >> S;\n\tint i = S + 1;\n\tint amount = 0;\n\twhile (amount < N)\n\t{\n\t\tint num = 0;\n\t\tfor (int j = 2; j <= 10; j++)\n\t\t{\n\t\t\tint arr[20] = { 0 };\n\t\t\tint k = 0;\n\t\t\tint judge = 1;\n\t\t\tint a = i;\n\t\t\twhile (a)\n\t\t\t{\n\t\t\t\tarr[k] = a % j;\n\t\t\t\ta = a / j;\n\t\t\t\tk++;\n\t\t\t}\n\t\t\tfor (int m = 0, n = k - 1; m < n; m++, n--)\n\t\t\t{\n\t\t\t\tif (arr[m] != arr[n])\n\t\t\t\t\tjudge = 0;\n\t\t\t}\n\t\t\tif (judge == 1)\n\t\t\t\tnum += 1;\n\t\t}\n\t\tif (num >= 2)\n\t\t{\n\t\t\tcout << i << endl;\n\t\t\tamount++;\n\t\t}\n\t\ti++;\n\t}\n\treturn 0;\n}",ACCEPTED,38,492
1278520533677703168,04f60b5c3ef78a44a8607be0b3de90c5d8eb85ed8fa4e788518a8a4419d91e3f,2020-07-02 10:47:03,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint N,S;\nvector<int>num;\nbool get(int a,int b)\n{\n\tnum.clear();\n\tdo\n\t{\n\t\tnum.push_back(a%b);\n\t\ta=a/b;\n\t\t\n\t}while(a);\n\tfor(int i=0,j=num.size()-1;i<j;i++,j--)\n\t\t{\n\t\t\tif(num[i]!=num[j])\n\t\t\t\treturn 0;\n\t\t\telse\n\t\t\t\treturn 1; \n\t\t}\n\treturn -1;\n}\n\nbool s(int a)\n{\n\tint number=0;\n\tfor(int i =2;i<11;i++)\n\t{\n\t\tif(get(a,i))\n\t\t\tnumber++;\n\t\telse\n\t\t\tcontinue;\n\t}\n\tif(number>=2)\n\t\treturn 1;\n\telse\n\t\treturn 0;\n}\n\nint main()\n{\n\tcin>>N;\n\tcin>>S;\n\tfor(int i =S+1;N;i++)\n\t{\n\t\tif(s(i))\n\t\t{\n\t\t\tcout<<i<<endl;\n\t\t\tN--;\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,37,384
1278520616943017984,b0b89d994646350cdb0faf36df067ca12b0d2116d53eb7ae1cb9e3d06407842e,2020-07-02 10:47:23,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\n\nint k = 0, a[100];\nbool judge(int a[]) { for (int i = 0; i < k; i++)if (a[i] != a[k - i - 1])return 0; return 1; }\nvoid node(int x)\n{\n\tint tx = x;\n\tint flag = 0;\n\tfor (int j = 2; j <= 10; j++)\n\t{\n\t\tk = 0;\n\t\ttx = x;\n\t\tfor (; tx; k++)\n\t\t\ta[k] = tx % j, tx /= j;\n\t\tif (judge(a)) flag++;\n\t\tif (flag >= 2) { cout << x << endl; break; }\n\t}\n\n}\n\n\nint main()\n{\n\tint n; int sta;\n\tcin >> n >> sta;\n\t\n\tfor (int i = sta + 1; i <= sta + n; i++)\n\t{\n\t\t\tnode(i);\n\t}\n}",PARTIAL_ACCEPTED,36,620
1278520960225837056,685d92e8c15d0ebd2875b6981da27f1f4ec039ee8163beabb74fb58572d473d4,2020-07-02 10:48:45,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<cstdio>\n#include<cstring>\n#include<iostream>\nusing namespace std;\nint a, b, c[800] = { 0,2,3,5,7,11,101,131,151,181,\n191,313,353,373,383,727,757,787,797,\n919,929,10301,10501,10601,11311,11411,12421,12721,\n12821,13331,13831,13931,14341,14741,15451,15551,16061,\n16361,16561,16661,17471,17971,18181,18481,19391,19891,\n19991,30103,30203,30403,30703,30803,31013,31513,32323,\n32423,33533,34543,34843,35053,35153,35353,35753,36263,\n36563,37273,37573,38083,38183,38783,39293,70207,70507,\n70607,71317,71917,72227,72727,73037,73237,73637,74047,\n74747,75557,76367,76667,77377,77477,77977,78487,78787,\n78887,79397,79697,79997,90709,91019,93139,93239,93739,\n94049,94349,94649,94849,94949,95959,96269,96469,96769,\n97379,97579,97879,98389,98689,1003001,1008001,1022201,1028201,\n1035301,1043401,1055501,1062601,1065601,1074701,1082801,1085801,1092901,\n1093901,1114111,1117111,1120211,1123211,1126211,1129211,1134311,1145411,\n1150511,1153511,1160611,1163611,1175711,1177711,1178711,1180811,1183811,\n1186811,1190911,1193911,1196911,1201021,1208021,1212121,1215121,1218121,\n1221221,1235321,1242421,1243421,1245421,1250521,1253521,1257521,1262621,\n1268621,1273721,1276721,1278721,1280821,1281821,1286821,1287821,1300031,\n1303031,1311131,1317131,1327231,1328231,1333331,1335331,1338331,1343431,\n1360631,1362631,1363631,1371731,1374731,1390931,1407041,1409041,1411141,\n1412141,1422241,1437341,1444441,1447441,1452541,1456541,1461641,1463641,\n1464641,1469641,1486841,1489841,1490941,1496941,1508051,1513151,1520251,\n1532351,1535351,1542451,1548451,1550551,1551551,1556551,1557551,1565651,\n1572751,1579751,1580851,1583851,1589851,1594951,1597951,1598951,1600061,\n1609061,1611161,1616161,1628261,1630361,1633361,1640461,1643461,1646461,\n1654561,1657561,1658561,1660661,1670761,1684861,1685861,1688861,1695961,\n1703071,1707071,1712171,1714171,1730371,1734371,1737371,1748471,1755571,\n1761671,1764671,1777771,1793971,1802081,1805081,1820281,1823281,1824281,\n1826281,1829281,1831381,1832381,1842481,1851581,1853581,1856581,1865681,\n1876781,1878781,1879781,1880881,1881881,1883881,1884881,1895981,1903091,\n1908091,1909091,1917191,1924291,1930391,1936391,1941491,1951591,1952591,\n1957591,1958591,1963691,1968691,1969691,1970791,1976791,1981891,1982891,\n1984891,1987891,1988891,1993991,1995991,1998991,3001003,3002003,3007003,\n3016103,3026203,3064603,3065603,3072703,3073703,3075703,3083803,3089803,\n3091903,3095903,3103013,3106013,3127213,3135313,3140413,3155513,3158513,\n3160613,3166613,3181813,3187813,3193913,3196913,3198913,3211123,3212123,\n3218123,3222223,3223223,3228223,3233323,3236323,3241423,3245423,3252523,\n3256523,3258523,3260623,3267623,3272723,3283823,3285823,3286823,3288823,\n3291923,3293923,3304033,3305033,3307033,3310133,3315133,3319133,3321233,\n3329233,3331333,3337333,3343433,3353533,3362633,3364633,3365633,3368633,\n3380833,3391933,3392933,3400043,3411143,3417143,3424243,3425243,3427243,\n3439343,3441443,3443443,3444443,3447443,3449443,3452543,3460643,3466643,\n3470743,3479743,3485843,3487843,3503053,3515153,3517153,3528253,3541453,\n3553553,3558553,3563653,3569653,3586853,3589853,3590953,3591953,3594953,\n3601063,3607063,3618163,3621263,3627263,3635363,3643463,3646463,3670763,\n3673763,3680863,3689863,3698963,3708073,3709073,3716173,3717173,3721273,\n3722273,3728273,3732373,3743473,3746473,3762673,3763673,3765673,3768673,\n3769673,3773773,3774773,3781873,3784873,3792973,3793973,3799973,3804083,\n3806083,3812183,3814183,3826283,3829283,3836383,3842483,3853583,3858583,\n3863683,3864683,3867683,3869683,3871783,3878783,3893983,3899983,3913193,\n3916193,3918193,3924293,3927293,3931393,3938393,3942493,3946493,3948493,\n3964693,3970793,3983893,3991993,3994993,3997993,3998993,7014107,7035307,\n7036307,7041407,7046407,7057507,7065607,7069607,7073707,7079707,7082807,\n7084807,7087807,7093907,7096907,7100017,7114117,7115117,7118117,7129217,\n7134317,7136317,7141417,7145417,7155517,7156517,7158517,7159517,7177717,\n7190917,7194917,7215127,7226227,7246427,7249427,7250527,7256527,7257527,\n7261627,7267627,7276727,7278727,7291927,7300037,7302037,7310137,7314137,\n7324237,7327237,7347437,7352537,7354537,7362637,7365637,7381837,7388837,\n7392937,7401047,7403047,7409047,7415147,7434347,7436347,7439347,7452547,\n7461647,7466647,7472747,7475747,7485847,7486847,7489847,7493947,7507057,\n7508057,7518157,7519157,7521257,7527257,7540457,7562657,7564657,7576757,\n7586857,7592957,7594957,7600067,7611167,7619167,7622267,7630367,7632367,\n7644467,7654567,7662667,7665667,7666667,7668667,7669667,7674767,7681867,\n7690967,7693967,7696967,7715177,7718177,7722277,7729277,7733377,7742477,\n7747477,7750577,7758577,7764677,7772777,7774777,7778777,7782877,7783877,\n7791977,7794977,7807087,7819187,7820287,7821287,7831387,7832387,7838387,\n7843487,7850587,7856587,7865687,7867687,7868687,7873787,7884887,7891987,\n7897987,7913197,7916197,7930397,7933397,7935397,7938397,7941497,7943497,\n7949497,7957597,7958597,7960697,7977797,7984897,7985897,7987897,7996997,\n9002009,9015109,9024209,9037309,9042409,9043409,9045409,9046409,9049409,\n9067609,9073709,9076709,9078709,9091909,9095909,9103019,9109019,9110119,\n9127219,9128219,9136319,9149419,9169619,9173719,9174719,9179719,9185819,\n9196919,9199919,9200029,9209029,9212129,9217129,9222229,9223229,9230329,\n9231329,9255529,9269629,9271729,9277729,9280829,9286829,9289829,9318139,\n9320239,9324239,9329239,9332339,9338339,9351539,9357539,9375739,9384839,\n9397939,9400049,9414149,9419149,9433349,9439349,9440449,9446449,9451549,\n9470749,9477749,9492949,9493949,9495949,9504059,9514159,9526259,9529259,\n9547459,9556559,9558559,9561659,9577759,9583859,9585859,9586859,9601069,\n9602069,9604069,9610169,9620269,9624269,9626269,9632369,9634369,9645469,\n9650569,9657569,9670769,9686869,9700079,9709079,9711179,9714179,9724279,\n9727279,9732379,9733379,9743479,9749479,9752579,9754579,9758579,9762679,\n9770779,9776779,9779779,9781879,9782879,9787879,9788879,9795979,9801089,\n9807089,9809089,9817189,9818189,9820289,9822289,9836389,9837389,9845489,\n9852589,9871789,9888889,9889889,9896989,9902099,9907099,9908099,9916199,\n9918199,9919199,9921299,9923299,9926299,9927299,9931399,9932399,9935399,\n9938399,9957599,9965699,9978799,9980899,9981899,9989899 };\nint main()\n{\n\tcin >> a, b;\n\tfor (int i = 1; i <= 781; i++)\n\t\tif (c[i] >= a && c[i] <= b)\n\t\t\tcout << c[i];\n\treturn 0;\n}",WRONG_ANSWER,40,384
1278521881441787904,b0b89d994646350cdb0faf36df067ca12b0d2116d53eb7ae1cb9e3d06407842e,2020-07-02 10:52:24,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\n\nint k = 0, a[100];\nbool judge(int a[]) { for (int i = 0; i < k/2; i++)if (a[i] != a[k - i - 1])return 0; return 1; }\nvoid node(int x)\n{\n\tint tx = x;\n\tint flag = 0;\n\tfor (int j = 2; j <= 10; j++)\n\t{\n\t\tk = 0;\n\t\ttx = x;\n\t\tfor (; tx; k++)\n\t\t\ta[k] = tx % j, tx /= j;\n\t\tif (judge(a)) flag++;\n\t\tif (flag >= 2) { cout << x << endl; break; }\n\t}\n\n}\n\n\nint main()\n{\n\tint n; int sta;\n\tcin >> n >> sta;\n\t\n\tfor (int i = sta + 1; i <= sta + n; i++)\n\t{\n\t\t\tnode(i);\n\t}\n}",PARTIAL_ACCEPTED,23,508
1278522227794829312,b0b89d994646350cdb0faf36df067ca12b0d2116d53eb7ae1cb9e3d06407842e,2020-07-02 10:53:47,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\n\nshort k = 0, a[100];\nbool judge(short a[]) { for (short i = 0; i < k/2; i++)if (a[i] != a[k - i - 1])return 0; return 1; }\nvoid node(short x)\n{\n\tshort tx = x;\n\tshort flag = 0;\n\tfor (short j = 2; j <= 10; j++)\n\t{\n\t\tk = 0;\n\t\ttx = x;\n\t\tfor (; tx; k++)\n\t\t\ta[k] = tx % j, tx /= j;\n\t\tif (judge(a)) flag++;\n\t\tif (flag >= 2) { cout << x << endl; break; }\n\t}\n\n}\n\n\nint main()\n{\n\tshort n; short sta;\n\tcin >> n >> sta;\n\t\n\tfor (short i = sta + 1; i <= sta + n; i++)\n\t{\n\t\t\tnode(i);\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,28,440
1278522345726074880,b0b89d994646350cdb0faf36df067ca12b0d2116d53eb7ae1cb9e3d06407842e,2020-07-02 10:54:15,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nbool work(int n, int k) {\n    short list[100] = { 0 }, d = 0;\n    while (n) {\n        list[d++] = n % k;\n        n /= k;\n    }\n    int i = 0, j = d - 1;\n    while (i < j)\n        if (list[i++] != list[j--]) return 0;\n    return 1;\n}\n\nint main() {\n    int n, s;\n    cin >> n >> s;\n    int answer = 0;\n    for (int i = s + 1; answer != n; i++) {\n        int count = 0;\n        for (int j = 2; j <= 10 && count < 2; j++) {\n            if (work(i, j))count++;\n        }\n        if (count >= 2)cout << i << endl, answer++;\n    }\n    return 0;\n}",ACCEPTED,31,548
1278523557275951104,d88d225f43d9cfbcbfaac4d153ebbce3b46be197d9270ee56c5be60033fcdfc9,2020-07-02 10:59:04,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <algorithm>\nusing namespace std;\nvoid baseSystem(int n,string &pa, int m);\nint symm(string m);\n\nint main()\n{\n    int n;\n    int s;\n    int note = 0; // 记录输出多少个点\n    cin >> n >> s;\n    for(int i = (s+1); i >s ; i++ )\n    {\n        int note1 = 0; //记录有多少个进制下是回文数\n        for(int ba = 2 ; ba <= 10 ; ba++)\n        {\n            string str;\n            baseSystem(i,str,ba);\n            if(symm(str)==1)\n            {\n                note1++;\n            }\n        }\n        if(note1 > 1)\n        {\n            cout << i << endl;\n            note++;\n        }\n        if(note == n)\n        {\n            break;\n        }\n    }\n    return 0;\n}\n\n\nint symm(string m)\n{\n    string n;\n    n = m;\n    reverse(n.begin(), n.end());\n    //strrev(m);\n    if(n==m)\n    {\n        return 1;\n    }\n    else\n    {\n        return 0;\n    }\n    \n}\n\nvoid baseSystem(int n,string &pa, int m) // n 要转化的数 ; m 要转化为的进制\n{\n    while (n)\n    {\n        if (n % m < 10) \n        {\n            pa = to_string(n % m)+ pa;\n        }\n        n /= m; \n    }\n}",ACCEPTED,82,512
1278524422648954880,04f60b5c3ef78a44a8607be0b3de90c5d8eb85ed8fa4e788518a8a4419d91e3f,2020-07-02 11:02:30,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint N,S;\n\nvector<int>num;\n\nbool get(int a,int b)\n{\n\tnum.clear();\n\tdo\n\t{\n\t\tnum.push_back(a%b);\n\t\ta=a/b;\n\t\t\n\t}while(a);\n\tfor(int i=0,j=num.size()-1;i<j;i++,j--)\n\t\t{\n\t\t\tif(num[i]!=num[j])\n\t\t\t\treturn 0;\n\t\t\t \n\t\t}\n\treturn 1;\n}\n\nbool s(int a)\n{\n\tint number=0;\n\tfor(int i =2;i<11;i++)\n\t{\n\t\tif(get(a,i))\n\t\t\tnumber++;\n\t\t\tif(number>=2)\n\t\t\t\treturn 1;\n\t\t\telse\n\t\t\t\tcontinue;\n\t}\n\treturn 0;\n\t\n}\n\nint main()\n{\n\tcin>>N;\n\tcin>>S;\n\tfor(int i =S+1;N;i++)\n\t{\n\t\tif(s(i))\n\t\t{\n\t\t\tcout<<i<<endl;\n\t\t\tN--;\n\t\t}\n\t\telse\n\t\t\tcontinue;\n\t}\n\treturn 0;\n}",ACCEPTED,35,512
1278524908944941056,ca7fc56435e0ca66ab6a099bc5bb05fdc09a4dbb95ef592bff66df7ceeb4b1b0,2020-07-02 11:04:26,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\n\nusing namespace std;\n\nint main() {\n\tint n;\n\tcin >> n;\n\tfor (int i{ 1 }; i <= 300; i++) {\n\t\tbool huiwen = 1;\n\t\tint shang = 0;\n\t\tint yushu = 0;\n\t\tint erci = i * i;\n\t\tvector<char>shuzi;\n\t\tvector<char>pingfang;\n\t\tdo {\n\t\t\tshang = i / n;\n\t\t\tyushu = i % n;\n\t\t\tif (yushu < 10) {\n\t\t\t\tshuzi.push_back(yushu + 48);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tshuzi.push_back(yushu + 55);\n\t\t\t}\n\t\t} while (shang != 0);\n\n\t\tdo {\n\t\t\tshang = erci / n;\n\t\t\tyushu = erci % n;\n\t\t\tif (yushu < 10) {\n\t\t\t\tshuzi.push_back(yushu + 48);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tshuzi.push_back(yushu + 55);\n\t\t\t}\n\t\t} while (shang != 0);\n\n\t\tfor (int x{ 0 }; x < pingfang.size(); x++) {\n\t\t\tif (pingfang[x] != pingfang[pingfang.size() - 1 - x]) {\n\t\t\t\thuiwen = 0;\n\t\t\t}\n\t\t}\n\t\tif (huiwen) {\n\t\t\tfor (int i{ shuzi.size() - 1 }; i >= 0; i--) {\n\t\t\t\tcout << shuzi[i];\n\t\t\t}\n\t\t\tcout << \"" \"";\n\t\t\tfor (int i{ pingfang.size() - 1 }; i >= 0; i--) {\n\t\t\t\tcout << pingfang[i];\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n}",MEMORY_LIMIT_EXCEEDED,0,0
1278525449393602560,b05d9f4f8ae94e871d055cf9cc40d00027e969fe8ebc83bb7ae29282cc9efd75,2020-07-02 11:06:35,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstring>\nusing namespace std;\n\nint jud(int a){\n\tint j=0;\n\tstring str=to_string(a);\n\tfor(int i=0;i<str.length();i++){\n\t\tif(str[i]==str[str.length()-i]){\n\t\t\tj++;\t\n\t\t}\n\t}\n\tif(j==str.length()){\n\t\treturn a;\n\t}\n\telse return 0;\n\t}\n\n\nint tra(int num,int b){\n\tint a,count=0,s[100];\n\tstring ii;\n\twhile(num!=0){\n\t\ta=num%b;\n\t\tnum=num/b;\n\t\tcount++;\n\t\ts[count]=a;\n\t}\n\tfor(int i=0;i<count;i++){\n\t\tii[i]=s[i];\n\t}\n\n\treturn stoi(ii);\n\n}\n\n\n\n\nint main(){\n\tcout<<tra(10,2)<<endl;\n\n\t\n    system(\""pause\"");\t\n}\n\n\t\n\n\t\n",RUNTIME_ERROR,22,512
1278525582898290688,ca7fc56435e0ca66ab6a099bc5bb05fdc09a4dbb95ef592bff66df7ceeb4b1b0,2020-07-02 11:07:07,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\n\nusing namespace std;\n\nint main() {\n\tint n;\n\tcin >> n;\n\tfor (int i{ 1 }; i <= 300; i++) {\n\t\tbool huiwen = 1;\n\t\tint shang = 0;\n\t\tint yushu = 0;\n\t\tint erci = i * i;\n\t\tvector<char>shuzi;\n\t\tvector<char>pingfang;\n\t\tdo {\n\t\t\tshang = i / n;\n\t\t\tyushu = i % n;\n\t\t\tif (yushu < 10) {\n\t\t\t\tshuzi.push_back(yushu + 48);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tshuzi.push_back(yushu + 55);\n\t\t\t}\n\t\t} while (shang != 0);\n\n\t\tdo {\n\t\t\tshang = erci / n;\n\t\t\tyushu = erci % n;\n\t\t\tif (yushu < 10) {\n\t\t\t\tshuzi.push_back(yushu + 48);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tshuzi.push_back(yushu + 55);\n\t\t\t}\n\t\t} while (shang != 0);\n\n\t\tfor (unsigned int x{ 0 }; x < pingfang.size(); x++) {\n\t\t\tif (pingfang[x] != pingfang[pingfang.size() - 1 - x]) {\n\t\t\t\thuiwen = 0;\n\t\t\t}\n\t\t}\n\t\tif (huiwen) {\n\t\t\tfor (unsigned int i{ shuzi.size() - 1 }; i >= 0; i--) {\n\t\t\t\tcout << shuzi[i];\n\t\t\t}\n\t\t\tcout << \"" \"";\n\t\t\tfor (unsigned int i{ pingfang.size() - 1 }; i >= 0; i--) {\n\t\t\t\tcout << pingfang[i];\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n}",SEGMENTATION_FAULT,34,512
1278527614245863424,61312bc99401c99a47863369c930c4a0da059239ef265b7ed69539aa9413279b,2020-07-02 11:15:11,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<cmath>\nusing namespace std;\n//判断B进制下的回文数\nint hh(int b,int ten){\n    int tem=ten*ten;\n    int s1[30];\n    if(tem<b)\n        return 1;\n    int a;\n    for(a=0;tem>0;a++){\n        s1[a]=tem%b;\n        tem=tem/b;\n    }\n    a--;\n    int flag=1;\n    for(int j=0;j<(a+1)/2;j++){\n        if(s1[j]!=s1[a-j])\n            flag=0;\n    }\n    return flag;\n}\n//将十进制转换为B进制\nvoid tran(int b,int num){\n    char s1[30]{};\n    int a;\n    for(a=0;num>0;a++){\n        if(num%b<10){\n            s1[a]=num%b+'0';\n            num=num/b;\n        }\n        else{\n            s1[a]=num%b-10+'A';\n            num=num/b;\n        }\n    }\n    a--;\n    for(int i=a;i>=0;i--){\n       cout<<s1[i];\n    }\n}\nint main()\n{\n    int B;\n    cin>>B;\n    for(int j=1;j<=300;j++){\n        if(hh(B,j)){\n            tran(B,j);\n            cout<<\"" \"";\n            tran(B,j*j);\n            cout<<endl;\n        }\n    }\n    return 0;\n}\n",ACCEPTED,31,592
1278527637545222144,4df5809172c657c03fd6ddb8af0a20c80845b7b240aac802fbc82564bdc234cf,2020-07-02 11:15:17,Python,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"def changenumber(i):\n    global n\n    m = \""\""\n    while i:\n        k = i % n\n        i = i // n\n        m += str(k)\n    m = m[::-1]\n    m = int(m) \n    return m\n\n\nn = eval(input())\nfor i in range(1,301):\n    number = changenumber(i)\n    fnumber = number ** 2\n    fnumber = str(fnumber)\n    if fnumber == fnumber[::-1]:\n        fnumber = int(fnumber)\n        print(number,fnumber)",PARTIAL_ACCEPTED,200,3112
1278528757839626240,7fafd57bd73cc9022846ba658cb80e9b39f1427bb4dd39c1cdbf698ee8c53097,2020-07-02 11:19:44,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<fstream>\n \nusing namespace std;\nint B,l,L,x[50],y[50];\n\nvoid trans(int n)\n{\n    int m=n;\n    l=0;\n    while(m)\n\t{\n\tx[++l]=m%B;\n\tm/=B;\n\t}\n    m=n*n;\n    L=0;\n    while(m)\n\t{\n\ty[++L]=m%B;\n\tm/=B;\n\t}\n}\n\nint judge()\n{\n    for(int i=1;i<L/2+1;i++)\n\t{\n        if(y[i]!=y[L-i+1])\n\t\t\treturn 0;\n    }\n    return 1;\n}\n \nint main()\n{\n    cin>>B;\n    char c[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\n    for(int i=1;i<=300;i++)\n\t{\n        trans(i);\n        if(judge())\n\t\t{\n            while(l)\n\t\t\t{\n                cout<<c[x[l--]];\n            }\n            cout<<\"" \"";\n            while(L)\n\t\t\t{\n                cout<<c[y[L--]];\n            }\n            cout<<endl;\n        }\n    }\n    return 0;\n}\n",ACCEPTED,36,512
1278530517991874560,bd23feb70f31c39d44f8632991273351b7ada8a16cc217a7026b9a98a9d21bf7,2020-07-02 11:26:44,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<vector>\n#include<string>\n#include<iostream>\n#include<algorithm>\nusing namespace std;\n\nint b;\nint a[20];\nbool way(int i)\n{\n\tint p = 0;\n\ti = i * i;\n\twhile (i > 0)\n\t{\n\t\ta[++p] = i % b;\n\t\ti /= b;\n\t}\n\tfor (int i = 1, j = p; i < j; i++, j--)\n\t{\n\t\tif (a[i] != a[j])\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nvoid show(int x)\n{\n\tint k = 0;\n\twhile (x)\n\t{\n\t\ta[++k] = x % b;\n\t\tx /= b;\n\t}\n\tfor (int i = k; i >= 1; i--)\n\t{\n\t\tif (a[i] > 10)\n\t\t{\n\t\t\tcout << a[i] - 10 + 'A';\n\t\t}\n\t\telse\n\t\t{\n\t\t\tcout << a[i];\n\t\t}\n\t}\n}\n\nint main()\n{\n\tcin >> b;\n\tfor (int i = 1; i < 300; i++)\n\t{\n\t\tif (way(i))\n\t\t{\n\t\t\tshow(i);\n\t\t\tcout << \"" \"";\n\t\t\tshow(i * i);\n\t\t\tcout << endl;\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,44,512
1278530995035234304,685d92e8c15d0ebd2875b6981da27f1f4ec039ee8163beabb74fb58572d473d4,2020-07-02 11:28:37,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstdlib>\n#include<cstdio>\n#include<string>\n#include<string.h>\nusing namespace std;\nint a(int b)\n{\n\treturn b * b;\n}\nint k(char*a)\n{\n\tint s = strlen(a), f = s - 1;\n\tchar t[100];\n\tfor (int i; i < s; i++)\n\t{\n\t\tt[f] = a[i];\n\t\tf--;\n\t}\n\tif (strcmp(a, t) == 0)\n\t\treturn 1;\n\telse\n\t\treturn 0;\n}\nint main()\n{\n\tint n;\n\tcin >> n;\n\tchar temp1[100], temp2[100];\n\tint c[301][2];\n\tfor (int i = 0; i < 300; ++i)\n\t{\n\t\tc[i][0] = i+1;\n\t\tc[i][1] = (i + 1)*(i + 1);\n\t}\n\tfor (int i = 0; i < 300; i++)\n\t{\n\t\titoa(c[i][1], temp2, n);\n\t\tif (k(temp2) == 1)\n\t\t{\n\t\t\titoa(c[i][0], temp1, n);\n\t\t\tcout << temp1 << \"" \"" << temp2 << endl;\n\t\t}\n\t\telse\n\t\t\tcontinue;\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1278531381448073216,4df5809172c657c03fd6ddb8af0a20c80845b7b240aac802fbc82564bdc234cf,2020-07-02 11:30:09,Python,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"def changenumber1(i):\n    global n\n    m = \""\""\n    while i:\n        k = i % n\n        i = i // n\n        m += str(k)\n    m = m[::-1]\n    m = int(m) \n    return m\n\ndef changenumber2(i):\n    global n\n    m = \""\""\n    while i:\n        k = i % n\n        if k >=10:\n            t = ['A','B','C','D','E','F','G','H','I','J','K']\n            m += t[k-10]\n        else:\n            m += str(k)\n        i = i // n\n    m = m[::-1]\n    return m\n\nn = eval(input())\nfor i in range(1,301):\n    number = changenumber1(i)\n    fnumber = number ** 2\n    fnumber = changenumber2(fnumber)\n    if fnumber == fnumber[::-1]:\n        print(number,fnumber)",PARTIAL_ACCEPTED,221,3112
1278531416537628672,685d92e8c15d0ebd2875b6981da27f1f4ec039ee8163beabb74fb58572d473d4,2020-07-02 11:30:18,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstdlib>\n#include<cstdio>\n#include<string>\n#include<string.h>\nusing namespace std;\nint a(int b)\n{\n\treturn b * b;\n}\nint k(char*a)\n{\n\tint s = strlen(a), f = s - 1;\n\tchar t[100];\n\tfor (int i; i < s; i++)\n\t{\n\t\tt[f] = a[i];\n\t\tf--;\n\t}\n\tif (strcmp(a, t) == 0)\n\t\treturn 1;\n\telse\n\t\treturn 0;\n}\nint main()\n{\n\tint n;\n\tcin >> n;\n\tchar temp1[100], temp2[100];\n\tint c[301][2];\n\tfor (int i = 0; i < 300; ++i)\n\t{\n\t\tc[i][0] = i+1;\n\t\tc[i][1] = (i + 1)*(i + 1);\n\t}\n\tfor (int i = 0; i < 300; i++)\n\t{\n\t\titoa(c[i][1], temp2, n);\n\t\tif (k(temp2) == 1)\n\t\t{\n\t\t\titoa(c[i][0], temp1, n);\n\t\t\tcout << temp1 << \"" \"" << temp2 << endl;\n\t\t}\n\t\telse\n\t\t\tcontinue;\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1278531514034225152,4df5809172c657c03fd6ddb8af0a20c80845b7b240aac802fbc82564bdc234cf,2020-07-02 11:30:41,Python,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"def changenumber(i):\n    global n\n    m = \""\""\n    while i:\n        k = i % n\n        i = i // n\n        m += str(k)\n    m = m[::-1]\n    m = int(m) \n    return m\n\n\nn = eval(input())\nfor i in range(1,301):\n    number = changenumber(i)\n    fnumber = number ** 2\n    fnumber = str(fnumber)\n    if fnumber == fnumber[::-1]:\n        fnumber = int(fnumber)\n        print(number,fnumber)",PARTIAL_ACCEPTED,179,3200
1278531859883950080,ca7fc56435e0ca66ab6a099bc5bb05fdc09a4dbb95ef592bff66df7ceeb4b1b0,2020-07-02 11:32:04,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\n\nusing namespace std;\n\nint main() {\n\tint n;\n\tcin >> n;\n\tfor (int i{ 1 }; i <= 300; i++) {\n\t\tbool huiwen = 1;\n\t\tint shang = 0;\n\t\tint yushu = 0;\n\t\tint erci = i * i;\n\t\tvector<char>shuzi;\n\t\tvector<char>pingfang;\n\t\tshuzi.push_back(' ');\n\t\tpingfang.push_back(' ');\n\t\tshang = i;\n\t\tdo {\n\t\t\tyushu = shang % n;\n\t\t\tshang = shang / n;\n\t\t\tif (yushu < 10) {\n\t\t\t\tshuzi.push_back(yushu + 48);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tshuzi.push_back(yushu + 55);\n\t\t\t}\n\t\t} while (shang != 0);\n\t\tshang = erci;\n\t\tdo {\n\t\t\tyushu = shang % n;\n\t\t\tshang = shang / n;\n\t\t\tif (yushu < 10) {\n\t\t\t\tpingfang.push_back(yushu + 48);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tpingfang.push_back(yushu + 55);\n\t\t\t}\n\t\t} while (shang != 0);\n\n\t\tfor (size_t x{ 1 }; x < pingfang.size(); x++) {\n\t\t\tif (pingfang[x] != pingfang[pingfang.size() - x]) {\n\t\t\t\thuiwen = 0;\n\t\t\t}\n\t\t}\n\t\tif (huiwen) {\n\t\t\tfor (size_t i{ shuzi.size() - 1 }; i > 0; i--) {\n\t\t\t\tcout << shuzi[i];\n\t\t\t}\n\t\t\tcout << \"" \"";\n\t\t\tfor (size_t i{ pingfang.size() - 1 }; i > 0; i--) {\n\t\t\t\tcout << pingfang[i];\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n}",ACCEPTED,40,516
1278533443820912640,5bae80805a109a5e85a950048adb216c805c2e50c75d29ec40caed1d78c69f96,2020-07-02 11:38:21,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint N,S;\n\tcin>>N>>S;\n\t \n\tfor(int i = 0;i<N;i++)\n\t{\n\t\tint count = 0;\n\t\tint a = 0;\n\t\tint b[10000];\n\t\tint c = 0;\n\t\tint x;\n\t\tint d = 0;\n\t\twhile(count = 0)\n\t\t{\n\t\t\tfor(int k = 2;k<11;k++)\n\t\t\t{\n\t\t\t\tx = S;\n\t\t\t\twhile(x!=0)\n\t\t\t\t{\n\t\t\t\t\tb[a] = x%k;\n\t\t\t\t\tx = x/k;\n\t\t\t\t\ta++;\n\t\t\t\t}\n\t\t\t\tfor(int l = 0;l<a/2;l++)\n\t\t\t\t{\n\t\t\t\t\tif(b[l] != b[a-l-1])\n\t\t\t\t\t    c++;\n\t\t\t\t}\n\t\t\t\tif(c == 0)\n\t\t\t\t    d++;\n\t\t\t}\n\t\t\tif(d>=2)\n\t\t\t{\n\t\t\t\tcount = 1;\n\t\t\t\tcout<<S;\n\t\t\t\tS++;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tcount =0;\n\t\t\t\tS++;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n } ",WRONG_ANSWER,28,424
1278534092964954112,782de8de24b69682b55d2ec864c3c74059925a75bca9e240d2c3ba45de48e5f7,2020-07-02 11:40:56,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstring>\nusing namespace std;\n\n\nint main(){\n    char num1[400];\n    char num2[400];\n    int p1 = 0;\n    int p2 = 0;\n    int k = 0;\n    cin >> k;\n    \n    for (int i=1;i<=300;i++){\n        int s2 = i*i;\n        while(s2){\n            int mo = s2 % k;\n            if (mo >= 10)\n                num2[p2] = (mo-10) + 'A';\n            else\n                num2[p2] =mo + '0';\n            s2 = s2 / k;\n            p2++;\n        }\n        \n        bool sym = 1;\n        for (int i=(p2/2)-1;i>=0;i--){\n            if (num2[i] != num2[p2-i-1]){\n                sym = false;\n                break;\n            }\n        }\n        \n        if (sym){\n            int n = i;\n            while(n){\n                int mo = n % k;\n                if (mo < 10)\n                    num1[p1] = mo + 48;\n                else\n                    num1[p2] = (mo-10)+65;\n                p1++;\n                n = n / k;\n            }\n            \n            for (int i=p1-1;i>=0;i--){\n                cout << num1[i];\n            }\n            cout << \"" \"";\n            for (int i=p2-1;i>=0;i--){\n                cout << num2[i];\n            }\n            cout<<endl;\n        }\n        p1 = p2 = 0;\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,35,484
1278535537424523264,ac84ffdb684484aea7c363ab676f9b5eb778268f3a15168c6f05f067552d4b29,2020-07-02 11:46:40,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main()\n{\n   int zh(int x,int m,char b[100]);\n   int pd(char c[100],int s);\n   void sc(char d[100],int k);\n   int B,N,i,l,logo=0;\n   char a[100];\n   cin>>B;\n   for(i=1;i<=300;i++)\n   {\n   \t    N=i*i;\n   \t    l=zh(B,N,a);\n   \t    logo=pd(a,l);\n   \t    if(logo==0)\n   \t    {\n   \t    \tcout<<i<<\"" \"";\n   \t    \tsc(a,l);\n\t\t\tcout<<endl; \n\t\t}\n   }\n   return 0;\n}\nint zh(int x,int m,char b[100])\n{\n\tint i=0,t;\n\tif(2<=x&&x<10)\n\t{\n\t\twhile(m>0)\n\t\t{\n\t\t\tt=m%x;\n\t\t\tb[i]=t+'0';\n\t\t\tm=m/x;\n\t\t\ti++;\n\t\t}\n\t}\n\telse if(10<=x&&x<=20) \n\t{\n\t\twhile(m>0)\n\t\t{\n\t\t\tt=m%x;\n\t\t\tif(t<10) b[i]=t+'0';\n\t\t\tif(t==10) b[i]='A';\n\t\t\tif(t==11) b[i]='B';\n\t\t\tif(t==12) b[i]='C';\n\t\t\tif(t==13) b[i]='D';\n\t\t\tif(t==14) b[i]='E';\n\t\t\tif(t==15) b[i]='F';\n\t\t\tif(t==16) b[i]='G';\n\t\t\tif(t==17) b[i]='H';\n\t\t\tif(t==18) b[i]='I';\n\t\t\tif(t==19) b[i]='J';\n\t\t\tif(t==20) b[i]='K';\n\t\t\tm=m/x;\n\t\t\ti++;\n\t\t}\n\t}\n\treturn i;\n} \nint pd(char c[100],int s)\n{\n\tint i,l=0;\n\tfor(i=0;i<s-i;i++)\n\t{\n\t\tif(c[i]!=c[s-i-1])\n\t\t{\n\t\t\tl=1;\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn l;\n}\nvoid sc(char d[100],int k)\n{\n\tint i;\n\tfor(i=0;i<k;i++)\n\t{\n\t\tcout<<d[i];\n\t}\n}",PARTIAL_ACCEPTED,36,488
1278536071648829440,4df5809172c657c03fd6ddb8af0a20c80845b7b240aac802fbc82564bdc234cf,2020-07-02 11:48:48,Python,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"def changenumber(i):\n    global n\n    m = \""\""\n    j = \""\""\n    while i:\n        k = i % n\n        i = i // n\n        if k >= 10:\n            t = ['A','B','C','D','E','F','G','H','I','J','K']\n            j += t[k-10]\n        else:\n            j += str(k)\n    j = j[::-1]\n    return j\n\nn = eval(input())\nfor i in range(1,301):\n    number = i ** 2\n    number = changenumber(number)\n    i = changenumber(i)\n    if number == number[::-1]:\n        print(i,number)",ACCEPTED,207,3040
1278536658171912192,ca7fc56435e0ca66ab6a099bc5bb05fdc09a4dbb95ef592bff66df7ceeb4b1b0,2020-07-02 11:51:08,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<vector>\n\nusing namespace std;\nbool judge(vector<char>& a) {\n\tbool huiwen = 1;\n\tfor (size_t x{ 1 }; x < a.size(); x++) {\n\t\tif (a[x] != a[a.size() - x]) {\n\t\t\thuiwen = 0;\n\t\t}\n\t}\n\treturn huiwen;\n}\n\nint main() {\n\tint N,S;\n\tcin >> N >> S;\n\tint huiwenshu = 0;\n\tvector<char>shuzi;\n\tshuzi.push_back(' ');\n\tint s = S + 1;\n\twhile (huiwenshu <= N) {\n\t\tint chongshu = 0;\n\t\tint shang = s;\n\t\tint yushu = 0;\n\t\tfor (int i{ 2 }; i < 11; i++) {\n\t\t\tdo {\n\t\t\t\tyushu = shang % i;\n\t\t\t\tshang = shang / i;\n\t\t\t\tshuzi.push_back(yushu + 48);\n\t\t\t} while (shang != 0);\n\t\t\tif (judge(shuzi)) {\n\t\t\t\tchongshu += 1;\n\t\t\t}\n\t\t\tif (chongshu >= 2) {\n\t\t\t\tcout << s;\n\t\t\t\thuiwenshu++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (huiwenshu >= N) { break; }\n\t\telse { s++; }\n\t}\n}",TIME_LIMIT_EXCEEDED,0,0
1278536707786342400,ac84ffdb684484aea7c363ab676f9b5eb778268f3a15168c6f05f067552d4b29,2020-07-02 11:51:19,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main()\n{\n   int zh(int x,int m,char b[100]);\n   int pd(char c[100],int s);\n   void sc(char d[100],int k);\n   int B,N,i,l,m,logo=0;\n   char a[100],b[100];\n   cin>>B;\n   for(i=1;i<=300;i++)\n   {\n   \t    N=i*i;\n   \t    l=zh(B,N,a);\n   \t    m=zh(B,i,b);\n   \t    logo=pd(a,l);\n   \t    if(logo==0)\n   \t    {\n   \t    \tsc(b,m);\n   \t    \tcout<<\"" \"";\n   \t    \tsc(a,l);\n\t\t\tcout<<endl; \n\t\t}\n   }\n   return 0;\n}\nint zh(int x,int m,char b[100])\n{\n\tint i=0,t;\n\tif(2<=x&&x<10)\n\t{\n\t\twhile(m>0)\n\t\t{\n\t\t\tt=m%x;\n\t\t\tb[i]=t+'0';\n\t\t\tm=m/x;\n\t\t\ti++;\n\t\t}\n\t}\n\telse if(10<=x&&x<=20) \n\t{\n\t\twhile(m>0)\n\t\t{\n\t\t\tt=m%x;\n\t\t\tif(t<10) b[i]=t+'0';\n\t\t\tif(t==10) b[i]='A';\n\t\t\tif(t==11) b[i]='B';\n\t\t\tif(t==12) b[i]='C';\n\t\t\tif(t==13) b[i]='D';\n\t\t\tif(t==14) b[i]='E';\n\t\t\tif(t==15) b[i]='F';\n\t\t\tif(t==16) b[i]='G';\n\t\t\tif(t==17) b[i]='H';\n\t\t\tif(t==18) b[i]='I';\n\t\t\tif(t==19) b[i]='J';\n\t\t\tif(t==20) b[i]='K';\n\t\t\tm=m/x;\n\t\t\ti++;\n\t\t}\n\t}\n\treturn i;\n} \nint pd(char c[100],int s)\n{\n\tint i,l=0;\n\tfor(i=0;i<s-i;i++)\n\t{\n\t\tif(c[i]!=c[s-i-1])\n\t\t{\n\t\t\tl=1;\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn l;\n}\nvoid sc(char d[100],int k)\n{\n\tint i;\n\tfor(i=0;i<k;i++)\n\t{\n\t\tcout<<d[i];\n\t}\n}",PARTIAL_ACCEPTED,40,512
1278537889351131136,ac84ffdb684484aea7c363ab676f9b5eb778268f3a15168c6f05f067552d4b29,2020-07-02 11:56:01,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main()\n{\n   int zh(int x,int m,char b[100]);\n   int pd(char c[100],int s);\n   void sc(char d[100],int k);\n   int B,N,i,l,m,logo=0;\n   char a[100],b[100];\n   cin>>B;\n   for(i=1;i<=300;i++)\n   {\n   \t    N=i*i;\n   \t    l=zh(B,N,a);\n   \t    m=zh(B,i,b);\n   \t    logo=pd(a,l);\n   \t    if(logo==0)\n   \t    {\n   \t    \tsc(b,m);\n   \t    \tcout<<\"" \"";\n   \t    \tsc(a,l);\n\t\t\tcout<<endl; \n\t\t}\n   }\n   return 0;\n}\nint zh(int x,int m,char b[100])\n{\n\tint i=0,t;\n\tif(2<=x&&x<10)\n\t{\n\t\twhile(m>0)\n\t\t{\n\t\t\tt=m%x;\n\t\t\tb[i]=t+'0';\n\t\t\tm=m/x;\n\t\t\ti++;\n\t\t}\n\t}\n\telse if(10<=x&&x<=20) \n\t{\n\t\twhile(m>0)\n\t\t{\n\t\t\tt=m%x;\n\t\t\tif(t<10) b[i]=t+'0';\n\t\t\tif(t==10) b[i]='A';\n\t\t\tif(t==11) b[i]='B';\n\t\t\tif(t==12) b[i]='C';\n\t\t\tif(t==13) b[i]='D';\n\t\t\tif(t==14) b[i]='E';\n\t\t\tif(t==15) b[i]='F';\n\t\t\tif(t==16) b[i]='G';\n\t\t\tif(t==17) b[i]='H';\n\t\t\tif(t==18) b[i]='I';\n\t\t\tif(t==19) b[i]='J';\n\t\t\tif(t==20) b[i]='K';\n\t\t\tm=m/x;\n\t\t\ti++;\n\t\t}\n\t}\n\treturn i;\n} \nint pd(char c[100],int s)\n{\n\tint i,l=0;\n\tfor(i=0;i<s-i;i++)\n\t{\n\t\tif(c[i]!=c[s-i-1])\n\t\t{\n\t\t\tl=1;\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn l;\n}\nvoid sc(char d[100],int k)\n{\n\tint i;\n\tfor(i=k-1;i>=0;i--)\n\t{\n\t\tcout<<d[i];\n\t}\n}",ACCEPTED,34,508
1278541420678275072,4df5809172c657c03fd6ddb8af0a20c80845b7b240aac802fbc82564bdc234cf,2020-07-02 12:10:03,Python,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"def changenumber(i,h):\n    j = \""\""\n    while i:\n        k = i % h\n        i = i // h\n        j += str(k)\n    j = j[::-1]\n    return j\n\nt = input().split()\nn,s = eval(t[0]),eval(t[1])\ni = s\nwhile n > 0:\n    f = 0\n    i += 1\n    for h in range(2,11):\n        p = changenumber(i,h)\n        if p == p[::-1]:\n            f += 1\n        if f == 3:\n            print(i)\n            break\n    if f == 3: \n        n = n - 1",PARTIAL_ACCEPTED,246,3112
1278542557888315392,4df5809172c657c03fd6ddb8af0a20c80845b7b240aac802fbc82564bdc234cf,2020-07-02 12:14:34,Python,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"def changenumber(i,h):\n    j = \""\""\n    while i:\n        k = i % h\n        i = i // h\n        j += str(k)\n    j = j[::-1]\n    return j\n\nt = input().split()\nn,s = eval(t[0]),eval(t[1])\ni = s\nwhile n > 0:\n    f = 0\n    i += 1\n    for h in range(2,11):\n        p = changenumber(i,h)\n        if p == p[::-1]:\n            f += 1\n        if f == 3:\n            print(i)\n            break\n    if f == 3: \n        n = n - 1",PARTIAL_ACCEPTED,235,3112
1278542783042748416,4df5809172c657c03fd6ddb8af0a20c80845b7b240aac802fbc82564bdc234cf,2020-07-02 12:15:28,Python,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"def changenumber(i,h):\n    j = \""\""\n    while i:\n        k = i % h\n        i = i // h\n        j += str(k)\n    j = j[::-1]\n    return j\n\nt = input().split()\nn,s = eval(t[0]),eval(t[1])\ni = s\nwhile n > 0:\n    f = 0\n    i += 1\n    for h in range(2,11):\n        p = changenumber(i,h)\n        if p == p[::-1]:\n            f += 1\n        if f == 2:\n            print(i)\n            break\n    if f == 2: \n        n = n - 1\n",ACCEPTED,309,3072
1278543168847405056,ac84ffdb684484aea7c363ab676f9b5eb778268f3a15168c6f05f067552d4b29,2020-07-02 12:17:00,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main()\n{\n   int zh(int x,int m,char b[15]);\n   int pd(char c[15],int s);\n   int N,S,i,j,l,m,logo=0,num=0,z=0;\n   char a[15];\n   cin>>N>>S;\n   for(i=S;num<N;i++)\n   {\n   \tfor(j=2;j<=10;j++)\n   \t{\n   \t\tl=zh(j,i,a);\n   \t\tlogo=pd(a,l);\n   \t\tif(logo==0)\n   \t\t\tz++;\n   \t\tif(z>2)\n   \t\t{\n   \t\t\tcout<<i<<endl;\n   \t\t\tnum++;\n   \t\t\tbreak;\n\t\t}\n\t}\n   }\n   return 0;\n}\nint zh(int x,int m,char b[15])\n{\n\tint i=0,t;\n\t\twhile(m>0)\n\t\t{\n\t\t\tt=m%x;\n\t\t\tb[i]=t+'0';\n\t\t\tm=m/x;\n\t\t\ti++;\n\t\t}\n\n\treturn i;\n} \nint pd(char c[15],int s)\n{\n\tint i,l=0;\n\tfor(i=0;i<s-i;i++)\n\t{\n\t\tif(c[i]!=c[s-i-1])\n\t\t{\n\t\t\tl=1;\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn l;\n}\n",WRONG_ANSWER,34,540
1278545768527364096,3a3ea2dc270382ab5855dfd97f34d2baa46d8adfac708e248c1a6b080acc107b,2020-07-02 12:27:20,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n\nusing namespace std;\n\nstring transform(int a, int b);\n\nint main()\n{\n    int num = 0;\n\tcin >> num;\n    int a = 0;\n    for (size_t i = 1; i <= 300; i++)\n    {\n        string num1, num2;\n        int length = 0;\n        a = i;\n        num1 = transform(a, num);\n        num2 = transform(a * a, num);\n        length = num2.length();\n        bool q = 1;\n        for (size_t i = 0; i <= length / 2; i++)\n        {\n            if (num2[i] != num2[length - i - 1])\n            {\n                q = 0;\n                break;\n            }\n        }\n        if (q)\n        {\n            cout << num1 << \"" \"" << num2 << endl;\n        }\n    }\n}\nstring transform(int a, int b)\n{\n    string ans = \""\"";\n    while (a != 0)\n    {\n        int t = a % b;\n        if (t >= 0 && t <= 9)\n        {\n            ans += t + '0';\n        }\n        else\n        {\n            ans += t - 10 + 'A'; \n        }\n        a /= b;\n    } \t\n    reverse(ans.begin(), ans.end()); \n    return ans;\n}",COMPILE_ERROR,0,0
1278546139656151040,3a3ea2dc270382ab5855dfd97f34d2baa46d8adfac708e248c1a6b080acc107b,2020-07-02 12:28:48,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<algorithm>\n\nusing namespace std;\n\nstring transform(int a, int b);\n\nint main()\n{\n    int num = 0;\n\tcin >> num;\n    int a = 0;\n    for (size_t i = 1; i <= 300; i++)\n    {\n        string num1, num2;\n        int length = 0;\n        a = i;\n        num1 = transform(a, num);\n        num2 = transform(a * a, num);\n        length = num2.length();\n        bool q = 1;\n        for (size_t i = 0; i <= length / 2; i++)\n        {\n            if (num2[i] != num2[length - i - 1])\n            {\n                q = 0;\n                break;\n            }\n        }\n        if (q)\n        {\n            cout << num1 << \"" \"" << num2 << endl;\n        }\n    }\n}\nstring transform(int a, int b)\n{\n    string ans = \""\"";\n    while (a != 0)\n    {\n        int t = a % b;\n        if (t >= 0 && t <= 9)\n        {\n            ans += t + '0';\n        }\n        else\n        {\n            ans += t - 10 + 'A'; \n        }\n        a /= b;\n    } \t\n    reverse(ans.begin(), ans.end()); \n    return ans;\n}",ACCEPTED,36,592
1278549764335927296,5bae80805a109a5e85a950048adb216c805c2e50c75d29ec40caed1d78c69f96,2020-07-02 12:43:12,C++,50.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint b[10000];\nbool check(int x,int jz)\n{\n\tint len=0;\n\twhile(x)\n\t{\n\t\tb[++len]=x%jz;\n\t\tx/=jz;\n\t}\n\tfor(int i=1;i<=(len/2);i++)\n\t if(b[i]!=b[len-i+1]) return false;\n\treturn true;\n}\nint main()\n{\n\t\n\tint N,S;\n\tcin>>N>>S;\n\tint count = 0;\n    \tint ans=0;\n\tfor(int i=S;;i++)\n\t{\n\t\t\n\t\tcount=0;\n\t\tfor(int j=2;j<=10;j++)\n\t\t{\n\t\t\tif(check(i,j))\n\t\t\t{\n\t\t\t\n\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tif(count>=2) {cout<<i<<\""\\n\"";ans++;}\n\t\tif(ans==N)break;\n\t}\n\t\n\treturn 0;\n } ",PARTIAL_ACCEPTED,38,412
1278552568597241856,5bae80805a109a5e85a950048adb216c805c2e50c75d29ec40caed1d78c69f96,2020-07-02 12:54:21,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint b[10000];\nbool check(int x,int jz)\n{\n\tint len=0;\n\twhile(x)\n\t{\n\t\tb[++len]=x%jz;\n\t\tx/=jz;\n\t}\n\tfor(int i=1;i<=(len/2);i++)\n\t if(b[i]!=b[len-i+1]) return false;\n\treturn true;\n}\nint main()\n{\n\t\n\tint N,S;\n\tcin>>N>>S;\n\tint count = 0;\n    \tint ans=0;\n\tfor(int i=S+1;;i++)\n\t{\n\t\t\n\t\tcount=0;\n\t\tfor(int j=2;j<=10;j++)\n\t\t{\n\t\t\tif(check(i,j))\n\t\t\t{\n\t\t\t\n\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tif(count>=2) {cout<<i<<\""\\n\"";ans++;}\n\t\tif(ans==N)break;\n\t}\n\t\n\treturn 0;\n } ",ACCEPTED,36,392
1278556524077580288,870639b86c6ef9a7a2d08fc3941ed91e6f086b72233a9e951b8f688077d1b0fe,2020-07-02 13:10:04,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<stdbool.h>\nusing namespace std;\n\nchar c[]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nvoid tran(int n,int B){\n    int r=0;\n    char num[20];\n    while(n!=0){\n        num[r]=c[n%B];\n        n=n/B;\n        r++;\n    }\n    for(int i=n-1;i>=0;i--){\n        cout<<num[i];\n    }\n}\n\nbool huiwen(int n){\n    int pow=n*n;\n    int a=pow;\n    int i=0;\n    while(1)\n        i=i*10+a%10;\n        a/=10;\n        if(i==pow)\n            return 1;\n        else\n            return 0;\n}\n\nint main(){\n    int b;\n    cin>>b;\n\n    for(int i=1;i<=300;i++){\n        if(huiwen(i)==1){\n            tran(i,b);\n            cout<<\"" \""<<endl;\n            tran(i*i,b);\n        }\n    }\n}",TIME_LIMIT_EXCEEDED,0,0
1278560559014797312,bd23feb70f31c39d44f8632991273351b7ada8a16cc217a7026b9a98a9d21bf7,2020-07-02 13:26:06,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<vector>\n#include<string>\n#include<iostream>\n#include<algorithm>\nusing namespace std;\n\nint b;\nint a[20];\nint  tmp,sum = 0;\n\nbool huiwen(int i)\n{\n\tint n;\n\tfor (n =i; i; i /= 10)\n\t{\n\t\ttmp = i % 10;\n\t\tsum = sum * 10 + tmp;\n\t}\n\tif (sum == n)\n\t{\n\t\treturn true;\n\t}\n\telse\n\t{\n\t\treturn false;\n\t}\n}\n\nvoid show(int x)\n{\n\tint k = 0;\n\twhile (x)\n\t{\n\t\ta[++k] = x % b;\n\t\tx /= b;\n\t}\n\tfor (int i = k; i >= 1; i--)\n\t{\n\t\tif (a[i] > 10)\n\t\t{\n\t\t\tcout << a[i] - 10 + 'A';\n\t\t}\n\t\telse\n\t\t{\n\t\t\tcout << a[i];\n\t\t}\n\t}\n}\n\nint main()\n{\n\tcin >> b;\n\tfor (int i = 1; i < 300; i++)\n\t{\n\t\tif (huiwen(i))\n\t\t{\n\t\t\tshow(i);\n\t\t\tcout << \"" \"";\n\t\t\tshow(i * i);\n\t\t\tcout << endl;\n\t\t}\n\t}\n\treturn 0;\n}",WRONG_ANSWER,43,384
1278562686722301952,bd23feb70f31c39d44f8632991273351b7ada8a16cc217a7026b9a98a9d21bf7,2020-07-02 13:34:33,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<vector>\n#include<string>\n#include<iostream>\n#include<algorithm>\nusing namespace std;\n\n\nbool huiwen(int m) \n{\n\tfor (m = n; m; m /= 10)//数位遍历\n\t{\n\t\ttmp = m % 10;\n\t\tsum = sum * 10 + tmp;\n\t}\n\tif (sum != n)\n\t{\n\t\treturn false;\n\t}\n\treturn true;\n}\nvoid show(int x)\n{\n\tint k = 0;\n\twhile (x)\n\t{\n\t\ta[++k] = x % b;\n\t\tx /= b;\n\t}\n\tfor (int i = k; i >= 1; i--)\n\t{\n\t\tif (a[i] > 10)\n\t\t{\n\t\t\tcout << a[i] - 10 + 'A';\n\t\t}\n\t\telse\n\t\t{\n\t\t\tcout << a[i];\n\t\t}\n\t}\n}\n\nint main()\n{\n\tcin >> b;\n\tfor (int i = 1; i < 300; i++)\n\t{\n\t\tif (huiwen(i))\n\t\t{\n\t\t\tshow(i);\n\t\t\tcout << \"" \"";\n\t\t\tshow(i * i);\n\t\t\tcout << endl;\n\t\t}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1278567073179959296,ac84ffdb684484aea7c363ab676f9b5eb778268f3a15168c6f05f067552d4b29,2020-07-02 13:51:59,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main()\n{\n   int zh(int x,int m,char b[15]);\n   int pd(char c[15],int s);\n   int N,S,i,j,l,logo=0,num=0,z=0;\n   char a[15];\n   cin>>N>>S;\n   for(i=S+1;num<N;i++)\n   {\n   \tfor(j=2;j<=10;j++)\n   \t{\n   \t\tl=zh(j,i,a);\n   \t\tlogo=pd(a,l);\n   \t\tif(logo==0)\n   \t\t\tz++;\n   \t\tif(z>=2)\n   \t\t{\n   \t\t\tcout<<i<<endl;\n   \t\t\tnum++;\n   \t\t\tbreak;\n\t\t}\n\t}\n   }\n   return 0;\n}\nint zh(int x,int m,char b[15])\n{\n\tint i=0,t;\n\t\twhile(m>0)\n\t\t{\n\t\t\tt=m%x;\n\t\t\tb[i]=t+'0';\n\t\t\tm=m/x;\n\t\t\ti++;\n\t\t}\n\n\treturn i;\n} \nint pd(char c[15],int s)\n{\n\tint i,l=0;\n\tfor(i=0;i<s-i;i++)\n\t{\n\t\tif(c[i]!=c[s-i-1])\n\t\t{\n\t\t\tl=1;\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn l;\n}\n",PARTIAL_ACCEPTED,35,436
1278569381611626496,bd23feb70f31c39d44f8632991273351b7ada8a16cc217a7026b9a98a9d21bf7,2020-07-02 14:01:09,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <stdio.h>\nusing namespace std; \nint m,a[1000];\nint b;\n\nbool check(int x)\n{\n    int n, i;\n    n = x;\n    i = 0;\n    while (n != 0)\n    {\n        i++;\n        a[i] = n % b;\n        n = n / b;\n    }\n    m = i;\n    for (int j = 1; j <= i / 2 + 1; j++)\n    {\n        if (a[j] != a[i - j + 1])\n        {\n            return(false);\n        }\n        return(true);\n    }\n}\n\nvoid show(int x)\n{\n    if (x % b <= 9)\n    {\n        cout << x % b;\n    }\n    else \n    {\n        cout << x % b + 55;\n    }\n}\n\nint main()\n{\n    cin >> b;\n    for (int i = 1; i <= 300; i++)\n    {\n        if (check(i * i))\n        {\n            show(i);\n            cout << \"" \"";\n            for (int j = 1; j <= m; j++)\n            {\n                if (a[j] <= 9)\n                {\n                    cout << a[j];\n                }\n                else\n                {\n                    cout << a[j] + 55 << endl;\n                }\n            }\n        }\n    }\n}",WRONG_ANSWER,39,512
1278569605675548672,bd23feb70f31c39d44f8632991273351b7ada8a16cc217a7026b9a98a9d21bf7,2020-07-02 14:02:03,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <stdio.h>\nusing namespace std; \nint m,a[1000];\nint b;\n\nbool check(int x)\n{\n    int n, i;\n    n = x;\n    i = 0;\n    while (n != 0)\n    {\n        i++;\n        a[i] = n % b;\n        n = n / b;\n    }\n    m = i;\n    for (int j = 1; j <= i / 2 + 1; j++)\n    {\n        if (a[j] != a[i - j + 1])\n        {\n            return(false);\n        }\n    }\n    return true；\n}\n\nvoid show(int x)\n{\n    if (x % b <= 9)\n    {\n        cout << x % b;\n    }\n    else \n    {\n        cout << x % b + 55;\n    }\n}\n\nint main()\n{\n    cin >> b;\n    for (int i = 1; i <= 300; i++)\n    {\n        if (check(i * i))\n        {\n            show(i);\n            cout << \"" \"";\n            for (int j = 1; j <= m; j++)\n            {\n                if (a[j] <= 9)\n                {\n                    cout << a[j];\n                }\n                else\n                {\n                    cout << a[j] + 55 << endl;\n                }\n            }\n        }\n    }\n}",COMPILE_ERROR,0,0
1278569663447883776,bd23feb70f31c39d44f8632991273351b7ada8a16cc217a7026b9a98a9d21bf7,2020-07-02 14:02:17,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <stdio.h>\nusing namespace std; \nint m,a[1000];\nint b;\n\nbool check(int x)\n{\n    int n, i;\n    n = x;\n    i = 0;\n    while (n != 0)\n    {\n        i++;\n        a[i] = n % b;\n        n = n / b;\n    }\n    m = i;\n    for (int j = 1; j <= i / 2 + 1; j++)\n    {\n        if (a[j] != a[i - j + 1])\n        {\n            return(false);\n        }\n    }\n    return true;\n}\n\nvoid show(int x)\n{\n    if (x % b <= 9)\n    {\n        cout << x % b;\n    }\n    else \n    {\n        cout << x % b + 55;\n    }\n}\n\nint main()\n{\n    cin >> b;\n    for (int i = 1; i <= 300; i++)\n    {\n        if (check(i * i))\n        {\n            show(i);\n            cout << \"" \"";\n            for (int j = 1; j <= m; j++)\n            {\n                if (a[j] <= 9)\n                {\n                    cout << a[j];\n                }\n                else\n                {\n                    cout << a[j] + 55 << endl;\n                }\n            }\n        }\n    }\n}",WRONG_ANSWER,44,612
1278571878371753984,06973ea832a5a1b65d8be68c7f42fd3c791dd6b87b2be7840bfba18d17eace9c,2020-07-02 14:11:05,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cmath>\nusing namespace std;\nint a[100000], b[100000];\nint jin;\nvoid s(int n)\n{\n\tint i, j, l;\n\tint c = 0;\n\tint k = n;\n\tfor (l = 1;;l++)\n\t{\n\t\tb[l] = n % jin;\n\t\tn =n/ jin;\n\t\tif (n == 0)\n\t\t\tbreak;\n\t}\n\tn = k * k;\n\tfor (i = 1;;i++)\n\t{\n\t\ta[i] = n % jin;\n\t\tn = n / jin;\n\t\tif (n == 0)\n\t\t\tbreak;\n\t}\n\tfor (j = 1;j <= i / 2;j++)\n\t{\n\t\tif (a[i - j + 1] != a[j])\n\t\t{\n\t\t\tc = 1;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif (c == 0)\n\t{\n\t\tfor (j = 1;j >= 1;j--)\n\t\t{\n\t\t\tif (b[j] < 10)\n\t\t\t{\n\t\t\t\tcout << b[j];\n\t\t\t}\n\t\t\tif (b[j] == 10)\n\t\t\t\tcout << \""A\"";\n\t\t\tif (b[j] == 11)\n\t\t\t\tcout << \""B\"";\n\t\t\tif (b[j] == 12)\n\t\t\t\tcout << \""C\"";\n\t\t\tif (b[j] == 13)\n\t\t\t\tcout << \""D\"";\n\t\t\tif (b[j] == 14)\n\t\t\t\tcout << \""E\"";\n\t\t\tif (b[j] == 15)\n\t\t\t\tcout << \""F\"";\n\t\t\tif (b[j] == 16)\n\t\t\t\tcout << \""G\"";\n\t\t\tif (b[j] == 17)\n\t\t\t\tcout << \""H\"";\n\t\t\tif (b[j] == 18)\n\t\t\t\tcout << \""I\"";\n\t\t\tif (b[j] == 19)\n\t\t\t\tcout << \""J\"";\n\t\t}\n\t\tcout << \"" \"";\n\t\tfor (j = i;j >= 1;j--)\n\t\t{\n\t\t\tif (a[j] < 10)\n\t\t\t{\n\t\t\t\tcout <<a[j];\n\t\t\t}\n\t\t\tif (a[j] == 10)\n\t\t\t\tcout << \""A\"";\n\t\t\tif (a[j] == 11)\n\t\t\t\tcout << \""B\"";\n\t\t\tif (a[j] == 12)\n\t\t\t\tcout << \""C\"";\n\t\t\tif (a[j] == 13)\n\t\t\t\tcout << \""D\"";\n\t\t\tif (a[j] == 14)\n\t\t\t\tcout << \""E\"";\n\t\t\tif (a[j] == 15)\n\t\t\t\tcout << \""F\"";\n\t\t\tif (a[j] == 16)\n\t\t\t\tcout << \""G\"";\n\t\t\tif (a[j] == 17)\n\t\t\t\tcout << \""H\"";\n\t\t\tif (a[j] == 18)\n\t\t\t\tcout << \""I\"";\n\t\t\tif (a[j] == 19)\n\t\t\t\tcout << \""J\"";\n\t\t}\n\t\tcout << endl;\n\t\t/*switch (b[j])\n\t\t{\n\t\tcase b[j] == 10:cout << \""A\"";break;\n\t\tcase b[j] == 11:cout << \""B\"";break;\n\t\tcase b[j] == 12:cout << \""C\"";break;\n\t\tcase b[j] == 13:cout << \""D\"";break;\n\t\tcase b[j] == 14:cout << \""E\"";break;\n\t\tcase b[j] == 15:cout << \""F\"";break;\n\t\tcase b[j] == 16:cout << \""G\"";break;\n\t\tcase b[j] == 17:cout << \""H\"";break;\n\t\tcase b[j] == 18:cout << \""I\"";break;\n\t\tcase b[j] == 19:cout << \""J\"";break;\n\t\tdefault: cout << b[j];\n\t\t\tbreak;\n\t\t}*/\n\t}\n}\n\nint main()\n{\n\tcin >> jin;\n\tfor (int i = 1;i <= 300;i++)\n\t\ts(i);\n\tcout << endl;\n\treturn 0;\n}",WRONG_ANSWER,30,512
1278573384089133056,ac84ffdb684484aea7c363ab676f9b5eb778268f3a15168c6f05f067552d4b29,2020-07-02 14:17:04,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main()\n{\n   int zh(int x,int m,char b[100]);\n   int pd(char c[100],int s);\n   void sc(char d[100],int k);\n   int B,N,i,l,m,logo=0;\n   char a[100],b[100];\n   cin>>B;\n   for(i=1;i<=300;i++)\n   {\n   \t    N=i*i;\n   \t    l=zh(B,N,a);\n   \t    m=zh(B,i,b);\n   \t    logo=pd(a,l);\n   \t    if(logo==0)\n   \t    {\n   \t    \tsc(b,m);\n   \t    \tcout<<\"" \"";\n   \t    \tsc(a,l);\n\t\t\tcout<<endl; \n\t\t}\n   }\n   return 0;\n}\nint zh(int x,int m,char b[100])\n{\n\tint i=0,t;\n\tif(2<=x&&x<10)\n\t{\n\t\twhile(m>0)\n\t\t{\n\t\t\tt=m%x;\n\t\t\tb[i]=t+'0';\n\t\t\tm=m/x;\n\t\t\ti++;\n\t\t}\n\t}\n\telse if(10<=x&&x<=20) \n\t{\n\t\twhile(m>0)\n\t\t{\n\t\t\tt=m%x;\n\t\t\tif(t<10) b[i]=t+'0';\n\t\t\tif(t==10) b[i]='A';\n\t\t\tif(t==11) b[i]='B';\n\t\t\tif(t==12) b[i]='C';\n\t\t\tif(t==13) b[i]='D';\n\t\t\tif(t==14) b[i]='E';\n\t\t\tif(t==15) b[i]='F';\n\t\t\tif(t==16) b[i]='G';\n\t\t\tif(t==17) b[i]='H';\n\t\t\tif(t==18) b[i]='I';\n\t\t\tif(t==19) b[i]='J';\n\t\t\tif(t==20) b[i]='K';\n\t\t\tm=m/x;\n\t\t\ti++;\n\t\t}\n\t}\n\treturn i;\n} \nint pd(char c[100],int s)\n{\n\tint i,l=0;\n\tfor(i=0;i<s-i;i++)\n\t{\n\t\tif(c[i]!=c[s-i-1])\n\t\t{\n\t\t\tl=1;\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn l;\n}\nvoid sc(char d[100],int k)\n{\n\tint i;\n\tfor(i=k-1;i>=0;i--)\n\t{\n\t\tcout<<d[i];\n\t}\n}",ACCEPTED,27,512
1278573664088293376,bd23feb70f31c39d44f8632991273351b7ada8a16cc217a7026b9a98a9d21bf7,2020-07-02 14:18:10,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <algorithm>\n\nusing namespace std;\n\nint b, a[20];\n\nvoid show(int x)\n{\n    int np = 0;\n    while (x)\n    {\n        a[++np] = x % b;\n        x /= b;\n    }\n    for (int i = np; i >= 1; i--)\n    {\n        if (a[i] > 9)\n        {\n            cout << a[i] - 10 + 'A';\n        }\n        else\n        {\n            cout << a[i];\n        }\n    }\n}\n\nbool check(int x)\n{\n    int np = 0;\n    x = x * x;\n    while (x)\n    {\n        a[++np] = x % b;\n        x /= b;\n    }\n    for (int i = 1, j = np; i < j; i++, j--)\n    {\n        if (a[i] != a[j])\n        {\n            return 0;\n        }\n    }\n    return 1;\n}\n\nint mian() \n{\n    for (int i = 0; i < 300; i++)\n    {\n        if (check(i)) \n        {\n            show(i);\n            cout << \"" \"";\n            show(i*i);\n            cout << endl;\n        }\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1278574234261979136,bd23feb70f31c39d44f8632991273351b7ada8a16cc217a7026b9a98a9d21bf7,2020-07-02 14:20:26,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <algorithm>\n\nusing namespace std;\n\nint b, a[20];\n\nvoid show(int x)\n{\n    int np = 0;\n    while (x)\n    {\n        a[++np] = x % b;\n        x /= b;\n    }\n    for (int i = np; i >= 1; i--)\n    {\n        if (a[i] > 9)\n        {\n            cout << a[i] - 10 + 'A';\n        }\n        else\n        {\n            cout << a[i];\n        }\n    }\n}\n\nbool check(int x)\n{\n    int np = 0;\n    x = x * x;\n    while (x)\n    {\n        a[++np] = x % b;\n        x /= b;\n    }\n    for (int i = 1, j = np; i < j; i++, j--)\n    {\n        if (a[i] != a[j])\n        {\n            return 0;\n        }\n    }\n    return 1;\n}\n\nint main() \n{\n    for (int i = 0; i < 300; i++)\n    {\n        if (check(i)) \n        {\n            show(i);\n            cout << \"" \"";\n            show(i*i);\n            cout << endl;\n        }\n    }\n    return 0;\n}",FLOAT_POINT_EXCEPTION,31,540
1278575289922158592,bd23feb70f31c39d44f8632991273351b7ada8a16cc217a7026b9a98a9d21bf7,2020-07-02 14:24:38,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <algorithm>\n\nusing namespace std;\nint b, a[20];\n\nvoid show(int x)\n{\n    int n = 0;\n    while (x)\n    {\n        a[++n] = x % b;\n        x /= b;\n    }\n    for (int i = n; i >= 1; i--)\n    {\n        if (a[i] > 9)\n        {\n            cout << a[i] - 10 + 'A';\n        }\n        else\n        {\n            cout << a[i];\n        }\n    }\n}\n\nbool check(int x)\n{\n    int n = 0;\n    x = x * x;\n    while (x)\n    {\n        a[++n] = x % b;\n        x /= b;\n    }\n    for (int i = 1, j = n; i < j; i++, j--)\n    {\n        if (a[i] != a[j])\n        {\n            return false;\n        }\n    }\n    return true;\n}\n\nint main() \n{\n    cin >> b;\n    for (int i = 0; i < 300; i++)\n    {\n        if (check(i)) \n        {\n            show(i);\n            cout << \"" \"";\n            show(i*i);\n            cout << endl;\n        }\n    }\n    return 0;\n}",MULTIPLE_ERROR,29,592
1278575679606554624,bd23feb70f31c39d44f8632991273351b7ada8a16cc217a7026b9a98a9d21bf7,2020-07-02 14:26:11,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <algorithm>\n\nusing namespace std;\nint b, a[20];\n\nvoid show(int x)\n{\n    int n = 0;\n    while (x)\n    {\n        a[++n] = x % b;\n        x /= b;\n    }\n    for (int i = n; i >= 1; i--)\n    {\n        if (a[i] > 10)\n        {\n            cout << a[i] - 10 + 'A';\n        }\n        else\n        {\n            cout << a[i];\n        }\n    }\n}\n\nbool check(int x)\n{\n    int n = 0;\n    x = x * x;\n    while (x)\n    {\n        a[++n] = x % b;\n        x /= b;\n    }\n    for (int i = 1, j = n; i < j; i++, j--)\n    {\n        if (a[i] != a[j])\n        {\n            return false;\n        }\n    }\n    return true;\n}\n\nint main() \n{\n    cin >> b;\n    for (int i = 0; i < 300; i++)\n    {\n        if (check(i)) \n        {\n            show(i);\n            cout << \"" \"";\n            show(i*i);\n            cout << endl;\n        }\n    }\n    return 0;\n}",MULTIPLE_ERROR,44,512
1278575941083652096,bd23feb70f31c39d44f8632991273351b7ada8a16cc217a7026b9a98a9d21bf7,2020-07-02 14:27:13,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <string>\n#include <iostream>\n\nusing namespace std;\nint b, a[20];\n\nbool check(int x)\n{\n    int n = 0;\n    x = x * x;\n    while (x)\n    {\n        a[++n] = x % b;\n        x /= b;\n    }\n    for (int i = 1, j = n; i < j; i++, j--)\n    {\n        if (a[i] != a[j])\n        {\n            return false;\n        }\n    }\n    return true;\n}\n\nvoid show(int x)\n{\n    int n = 0;\n    while (x)\n    {\n        a[++n] = x % b;\n        x /= b;\n    }\n    for (int i = n; i >= 1; i--)\n    {\n        if (a[i] > 10)\n        {\n            cout << a[i] - 10 + 'A';\n        }\n        else\n        {\n            cout << a[i];\n        }\n    }\n}\n\nint main() \n{\n    cin >> b;\n    for (int i = 0; i < 300; i++)\n    {\n        if (check(i)) \n        {\n            show(i);\n            cout << \"" \"";\n            show(i*i);\n            cout << endl;\n        }\n    }\n    return 0;\n}",MULTIPLE_ERROR,40,540
1278576401823752192,06973ea832a5a1b65d8be68c7f42fd3c791dd6b87b2be7840bfba18d17eace9c,2020-07-02 14:29:03,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <cstdio>\n#include <cmath>\n//int a[1000000], b[1000000];\nint b, no, sq;\nstring s, ns = \""0123456789ABCDEFGHIJ\"";\nusing namespace std;\nvoid change(int x)\n{\n\ts.clear();\n\twhile (x > 0)\n\t{\n\t\ts = s + ns[x % b];\n\t\tx = x / b;\n\t}\n\treverse(s.begin(), s.end());\n}\nbool check()\n{\n\tfor (size_t i = 0;i < s.length();++i)\n\t\tif (s[i] != s[s.length() - i - 1])\n\t\t\treturn false;\n\treturn true;\n}\nint main()\n{\n\tcin >> b;\n\tfor (int i;i <= 300;++i)\n\t{\n\t\tno = i;\n\t\tsq = pow(i, 2);\n\t\tchange(sq);\n\t\tif (check())\n\t\t{\n\t\t\tchange(no);\n\t\t\tcout << s << \"" \"";\n\t\t\tchange(sq);\n\t\t\tcout << s << endl;\n\t\t}\n\t}\n}",COMPILE_ERROR,0,0
1278577038414241792,3a3ea2dc270382ab5855dfd97f34d2baa46d8adfac708e248c1a6b080acc107b,2020-07-02 14:31:35,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n\nusing namespace std;\n\nstring transform(int a, int b);\nbool judge(string a);\n\nint main()\n{\n    int N, S;\n    cin >> N >> S;\n    int num = 0;\n    int time = 0;\n    string a = \""\"";\n    while (num < 3)\n    {\n        time = 0;\n        string a = \""\"";\n        for (size_t i = 2; i < 11; i++)\n        {\n            a = transform(S + 1, i);\n            if (judge(a))\n            {\n                time++;\n            }\n        }\n        if (time >= 2)\n        {\n            num++;\n            cout << S + 1 << endl;\n        }\n        S++;\n    }\n}\nstring transform(int a, int b)\n{\n    string ans = \""\"";\n    while (a != 0)\n    {\n        int t = a % b;\n        if (t >= 0 && t <= 9)\n        {\n            ans += t + '0';\n        }\n        else\n        {\n            ans += t - 10 + 'A';\n        }\n        a /= b;\n    }\n    reverse(ans.begin(), ans.end());\n    return ans;\n}\nbool judge(string a)\n{\n    int length = a.length();\n    bool q = 1;\n    for (size_t i = 0; i <= length / 2; i++)\n    {\n        if (a[i] != a[length - i - 1])\n        {\n            q = 0;\n            break;\n        }\n    }\n    return q;\n}",COMPILE_ERROR,0,0
1278577164239167488,ac84ffdb684484aea7c363ab676f9b5eb778268f3a15168c6f05f067552d4b29,2020-07-02 14:32:05,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main()\n{\n   int zh(int x,int m,char b[15]);\n   int pd(char c[15],int s);\n   int N,S,i,j,l,logo=0,num=0,z=0;\n   char a[15];\n   cin>>N>>S;\n   for(i=S+1;num<N;i++)\n   {\n   \tfor(j=2;j<=10;j++)\n   \t{\n   \t\tl=zh(j,i,a);\n   \t\tlogo=pd(a,l);\n   \t\tif(logo==0)\n   \t\t\tz++;\n   \t\tif(z>=2)\n   \t\t{\n   \t\t\tcout<<i<<endl;\n   \t\t\tnum++;\n   \t\t\tbreak;\n\t\t}\n\t}\n   }\n   return 0;\n}\nint zh(int x,int m,char b[15])\n{\n\tint i=0,t;\n\t\twhile(m>0)\n\t\t{\n\t\t\tt=m%x;\n\t\t\tb[i]=t+'0';\n\t\t\tm=m/x;\n\t\t\ti++;\n\t\t}\n\n\treturn i;\n} \nint pd(char c[15],int s)\n{\n\tint i,l=0;\n\tfor(i=0;i<s-i;i++)\n\t{\n\t\tif(c[i]!=c[s-i-1])\n\t\t{\n\t\t\tl=1;\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn l;\n}\n",WRONG_ANSWER,44,552
1278577183356813312,3a3ea2dc270382ab5855dfd97f34d2baa46d8adfac708e248c1a6b080acc107b,2020-07-02 14:32:09,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<string>\n\nusing namespace std;\n\nstring transform(int a, int b);\nbool judge(string a);\n\nint main()\n{\n    int N, S;\n    cin >> N >> S;\n    int num = 0;\n    int time = 0;\n    string a = \""\"";\n    while (num < 3)\n    {\n        time = 0;\n        string a = \""\"";\n        for (size_t i = 2; i < 11; i++)\n        {\n            a = transform(S + 1, i);\n            if (judge(a))\n            {\n                time++;\n            }\n        }\n        if (time >= 2)\n        {\n            num++;\n            cout << S + 1 << endl;\n        }\n        S++;\n    }\n}\nstring transform(int a, int b)\n{\n    string ans = \""\"";\n    while (a != 0)\n    {\n        int t = a % b;\n        if (t >= 0 && t <= 9)\n        {\n            ans += t + '0';\n        }\n        else\n        {\n            ans += t - 10 + 'A';\n        }\n        a /= b;\n    }\n    reverse(ans.begin(), ans.end());\n    return ans;\n}\nbool judge(string a)\n{\n    int length = a.length();\n    bool q = 1;\n    for (size_t i = 0; i <= length / 2; i++)\n    {\n        if (a[i] != a[length - i - 1])\n        {\n            q = 0;\n            break;\n        }\n    }\n    return q;\n}",WRONG_ANSWER,37,512
1278577335048003584,ac84ffdb684484aea7c363ab676f9b5eb778268f3a15168c6f05f067552d4b29,2020-07-02 14:32:46,C++,20.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main()\n{\n   int zh(int x,int m,char b[15]);\n   int pd(char c[15],int s);\n   int N,S,i,j,l=0,logo=0,num=0,z=0;\n   char a[15];\n   cin>>N>>S;\n   for(i=S+1;num<N;i++)\n   {\n   \tfor(j=2;j<=10;j++)\n   \t{\n   \t\t\n   \t\tl=zh(j,i,a);\n   \t\tlogo=pd(a,l);\n   \t\tif(logo==0)\n   \t\t{z++;}\n   \t\tif(z>=2)\n   \t\t{\n   \t\t\tcout<<i<<endl;\n   \t\t\tnum++;\n   \t\t\tz=0;\n   \t\t\tbreak;\n\t\t}\n\t}\n   }\n   return 0;\n}\nint zh(int x,int m,char b[15])\n{\n\tint i=0,t;\n\twhile(m>0)\n\t\t{\n\t\t\tt=m%x;\n\t\t\tb[i]=t+'0';\n\t\t\tm=m/x;\n\t\t\ti++;\n\t\t}\n\treturn i;\n} \nint pd(char c[15],int s)\n{\n\tint i,l=0;\n\tfor(i=0;i<s-i;i++)\n\t{\n\t\tif(c[i]!=c[s-i-1])\n\t\t{\n\t\t\tl=1;\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn l;\n}\n",PARTIAL_ACCEPTED,37,436
1278577444976517120,06973ea832a5a1b65d8be68c7f42fd3c791dd6b87b2be7840bfba18d17eace9c,2020-07-02 14:33:12,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\nusing namespace std;\n#define memset(a,n) memset(a,n,sizeof(n))\ntypedef long long LL;\n \nLL s[302];\nLL ss[302];\nLL cnt = 0;\n \nLL judge1(LL x,LL y)\n{\n    LL k = 1;\n    cnt=0;\n    while(x)\n    {\n        s[cnt++] = x%y;\n        x /= y;\n    }\n \n    for (LL i = 0; i < cnt/2; i++) // 判断是不是回文数\n        if (s[i] != s[cnt-i-1])\n        {\n            k = 0;\n            break;\n        }\n    if (k == 1) \n        return 1;\n    else\n        return 0;\n}\n \nvoid judge(LL a,LL b,LL n)\n{\n    int flag, flagg;\n    char c,cc;\n    flagg = 0;\n    memset(s,0);\n    memset(ss,0);\n    flag = judge1(a,n);\n \n    if(flag)  // 如果是回文数的话，输出\n    {\n        while(b)\n        {\n            ss[flagg++] = b%n;\n            b /= n;\n        }\n        for (LL i = flagg-1; i >= 0; i--)\n        {\n            if (ss[i] <= 9)\n               cout<<ss[i];\n            else{\n                c=ss[i]-10+'A';  // !!! 这里当数大于 10 的时候，只能输出 A B ...\n                cout<<c; \n            }\n        }\n        cout<<' ';\n        for (LL i = cnt-1; i >= 0; i--)\n        {\n            if (s[i] <= 9)\n                cout<<s[i];\n            else\n            {\n                cc=s[i]-10+'A';\n                cout<<cc;\n            }\n        }\n        cout<<endl;\n    }\n}\n \nint main()\n{\n    ios::sync_with_stdio(false);\n    LL n;\n    cin>>n;\n    for(LL i = 1; i <= 300; i++)\n    {\n        memset(s,0);\n        memset(ss,0);\n        cnt=0;\n \n        judge(i*i,i,n);\n    }\n}",ACCEPTED,31,424
1278577480665849856,3a3ea2dc270382ab5855dfd97f34d2baa46d8adfac708e248c1a6b080acc107b,2020-07-02 14:33:20,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<string>\n\nusing namespace std;\n\nstring transform(int a, int b);\nbool judge(string a);\n\nint main()\n{\n    int N, S;\n    cin >> N >> S;\n    int num = 0;\n    int time = 0;\n    string a = \""\"";\n    while (num < 3)\n    {\n        time = 0;\n        string a = \""\"";\n        for (size_t i = 2; i < 11; i++)\n        {\n            a = transform(S + 1, i);\n            if (judge(a))\n            {\n                time++;\n            }\n        }\n        if (time >= 2)\n        {\n            num++;\n            cout << S + 1 << endl;\n        }\n        S++;\n    }\n}\nstring transform(int a, int b)\n{\n    string ans = \""\"";\n    while (a != 0)\n    {\n        int t = a % b;\n        if (t >= 0 && t <= 9)\n        {\n            ans += t + '0';\n        }\n        else\n        {\n            ans += t - 10 + 'A';\n        }\n        a /= b;\n    }\n    reverse(ans.begin(), ans.end());\n    return ans;\n}\nbool judge(string a)\n{\n    int length = a.length();\n    bool q = 1;\n    for (size_t i = 0; i <= length / 2; i++)\n    {\n        if (a[i] != a[length - i - 1])\n        {\n            q = 0;\n            break;\n        }\n    }\n    return q;\n}",WRONG_ANSWER,26,512
1278577773726064640,3a3ea2dc270382ab5855dfd97f34d2baa46d8adfac708e248c1a6b080acc107b,2020-07-02 14:34:30,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<string>\n\nusing namespace std;\n\nstring transform(int a, int b);\nbool judge(string a);\n\nint main()\n{\n    int N, S;\n    cin >> N >> S;\n    int num = 0;\n    int time = 0;\n    string a = \""\"";\n    while (num < N)\n    {\n        time = 0;\n        string a = \""\"";\n        for (size_t i = 2; i < 11; i++)\n        {\n            a = transform(S + 1, i);\n            if (judge(a))\n            {\n                time++;\n            }\n        }\n        if (time >= 2)\n        {\n            num++;\n            cout << S + 1 << endl;\n        }\n        S++;\n    }\n}\nstring transform(int a, int b)\n{\n    string ans = \""\"";\n    while (a != 0)\n    {\n        int t = a % b;\n        if (t >= 0 && t <= 9)\n        {\n            ans += t + '0';\n        }\n        else\n        {\n            ans += t - 10 + 'A';\n        }\n        a /= b;\n    }\n    reverse(ans.begin(), ans.end());\n    return ans;\n}\nbool judge(string a)\n{\n    int length = a.length();\n    bool q = 1;\n    for (size_t i = 0; i <= length / 2; i++)\n    {\n        if (a[i] != a[length - i - 1])\n        {\n            q = 0;\n            break;\n        }\n    }\n    return q;\n}",ACCEPTED,35,512
1278577813345468416,ca7fc56435e0ca66ab6a099bc5bb05fdc09a4dbb95ef592bff66df7ceeb4b1b0,2020-07-02 14:34:40,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"include<iostream>\n#include<vector>\n\nusing namespace std;\nbool judge(vector<char>& a) {\n\tbool huiwen = 1;\n\tfor (size_t x{ 1 }; x < a.size(); x++) {\n\t\tif (a[x] != a[a.size() - x]) {\n\t\t\thuiwen = 0;\n\t\t}\n\t}\n\treturn huiwen;\n}\n\nint main() {\n\tint N,S;\n\tcin >> N >> S;\n\tint huiwenshu = 0;\n\tint s = S + 1;\n\twhile (huiwenshu <= N) {\n\t\tint chongshu = 0;\n\t\tfor (int i{ 2 }; i < 11; i++) {\n\t\t\tvector<char>shuzi;\n\t\t\tshuzi.push_back(' ');\n\t\t\tint shang = s;\n\t\t\tint yushu = 0;\n\t\t\tdo {\n\t\t\t\tyushu = shang % i;\n\t\t\t\tshang = shang / i;\n\t\t\t\tshuzi.push_back(yushu + 48);\n\t\t\t} while (shang != 0);\n\t\t\tif (judge(shuzi)) {\n\t\t\t\tchongshu += 1;\n\t\t\t}\n\t\t\tif (chongshu >= 2) {\n\t\t\t\tcout << s << endl;\n\t\t\t\thuiwenshu++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (huiwenshu >= N) { break; }\n\t\telse { s++; }\n\t}\n}",COMPILE_ERROR,0,0
1278577866697015296,ca7fc56435e0ca66ab6a099bc5bb05fdc09a4dbb95ef592bff66df7ceeb4b1b0,2020-07-02 14:34:52,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<vector>\n\nusing namespace std;\nbool judge(vector<char>& a) {\n\tbool huiwen = 1;\n\tfor (size_t x{ 1 }; x < a.size(); x++) {\n\t\tif (a[x] != a[a.size() - x]) {\n\t\t\thuiwen = 0;\n\t\t}\n\t}\n\treturn huiwen;\n}\n\nint main() {\n\tint N,S;\n\tcin >> N >> S;\n\tint huiwenshu = 0;\n\tint s = S + 1;\n\twhile (huiwenshu <= N) {\n\t\tint chongshu = 0;\n\t\tfor (int i{ 2 }; i < 11; i++) {\n\t\t\tvector<char>shuzi;\n\t\t\tshuzi.push_back(' ');\n\t\t\tint shang = s;\n\t\t\tint yushu = 0;\n\t\t\tdo {\n\t\t\t\tyushu = shang % i;\n\t\t\t\tshang = shang / i;\n\t\t\t\tshuzi.push_back(yushu + 48);\n\t\t\t} while (shang != 0);\n\t\t\tif (judge(shuzi)) {\n\t\t\t\tchongshu += 1;\n\t\t\t}\n\t\t\tif (chongshu >= 2) {\n\t\t\t\tcout << s << endl;\n\t\t\t\thuiwenshu++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (huiwenshu >= N) { break; }\n\t\telse { s++; }\n\t}\n}",ACCEPTED,36,508
1278578239440609280,c9983de4ae1d839794a7cfdab09d09965ac4bdcfd04f48cc569c2fe24e6abe7c,2020-07-02 14:36:21,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<cstdio>\n#include<cstring>\n#include<iostream>\n#include<algorithm>\nusing namespace std;\nint b;\nint num[100];\nint main(){\n    scanf(\""%d\"",&b);\n    for(int i=1;i<=300;i++){\n        int x=i*i,tot=0,flag=0;\n        while(x){ num[++tot]=x%b;x/=b; }\n        for(int j=1;j<=tot/2;j++)\n            if(num[j]!=num[tot-j+1])    flag=1;\n        if(!flag){\n            x=i;tot=0;\n            while(x){ num[++tot]=x%b;x/=b; }\n            for(int j=tot;j>=1;j--)\n                if(num[j]<10)    cout<<num[j];\n                else cout<<char(num[j]+55);\n            cout<<\"" \"";\n            x=i*i;tot=0;\n            while(x){ num[++tot]=x%b;x/=b; }\n            for(int j=tot;j>=1;j--)\n                if(num[j]<10)    cout<<num[j];\n                else cout<<char(num[j]+55);\n            cout<<endl;\n        }\n    }\n}\n",ACCEPTED,33,592
1278578914224431104,c9983de4ae1d839794a7cfdab09d09965ac4bdcfd04f48cc569c2fe24e6abe7c,2020-07-02 14:39:02,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstring>\n#include<cstdio>\n#include<algorithm>\n\nusing namespace std;\nint b;\nint num[100];\nint main()\n{\n    scanf(\""%d\"",&b);\n    for(int i=1;i<=300;i++)\n    {\n        int x=i*i,tot=0,flag=0;\n        while(x){ num[++tot]=x%b;x/=b; }\n        for(int j=1;j<=tot/2;j++)\n            if(num[j]!=num[tot-j+1])    flag=1;\n        if(!flag)\n        {\n            x=i;tot=0;\n            while(x){ num[++tot]=x%b;x/=b; }\n            for(int j=tot;j>=1;j--)\n                if(num[j]<10)    cout<<num[j];\n                else cout<<char(num[j]+55);\n            cout<<\"" \"";\n            x=i*i;tot=0;\n            while(x){ num[++tot]=x%b;x/=b; }\n            for(int j=tot;j>=1;j--)\n                if(num[j]<10)    cout<<num[j];\n                else cout<<char(num[j]+55);\n            cout<<endl;\n        }\n    }\n}\n",ACCEPTED,33,640
1278579104335454208,c9983de4ae1d839794a7cfdab09d09965ac4bdcfd04f48cc569c2fe24e6abe7c,2020-07-02 14:39:47,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstring>\n#include<cstdio>\n#include<algorithm>\n\nusing namespace std;\nint a;\nint num[100];\nint main()\n{\n    scanf(\""%d\"",&a);\n    for(int i=1;i<=300;i++)\n    {\n        int x=i*i,tot=0,flag=0;\n        while(x){ num[++tot]=x%b;x/=b; }\n        for(int j=1;j<=tot/2;j++)\n            if(num[j]!=num[tot-j+1])    flag=1;\n        if(!flag)\n        {\n            x=i;tot=0;\n            while(x){ num[++tot]=x%b;x/=b; }\n            for(int j=tot;j>=1;j--)\n                if(num[j]<10)    cout<<num[j];\n                else cout<<char(num[j]+55);\n            cout<<\"" \"";\n            x=i*i;tot=0;\n            while(x){ num[++tot]=x%a;x/=a; }\n            for(int j=tot;j>=1;j--)\n                if(num[j]<10)    cout<<num[j];\n                else cout<<char(num[j]+55);\n            cout<<endl;\n        }\n    }\n}\n",COMPILE_ERROR,0,0
1278579269523922944,c9983de4ae1d839794a7cfdab09d09965ac4bdcfd04f48cc569c2fe24e6abe7c,2020-07-02 14:40:27,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstring>\n#include<cstdio>\n#include<algorithm>\n\nusing namespace std;\nint a;\nint num[100];\nint main()\n{\n    scanf(\""%d\"",&a);\n    for(int i=1;i<=300;i++)\n    {\n        int x=i*i,tot=0,flag=0;\n        while(x){ num[++tot]=x%a;x/=a; }\n        for(int j=1;j<=tot/2;j++)\n            if(num[j]!=num[tot-j+1])    flag=1;\n        if(!flag)\n        {\n            x=i;tot=0;\n            while(x){ num[++tot]=x%a;x/=a; }\n            for(int j=tot;j>=1;j--)\n                if(num[j]<10)    cout<<num[j];\n                else cout<<char(num[j]+55);\n            cout<<\"" \"";\n            x=i*i;tot=0;\n            while(x){ num[++tot]=x%a;x/=a; }\n            for(int j=tot;j>=1;j--)\n                if(num[j]<10)    cout<<num[j];\n                else cout<<char(num[j]+55);\n            cout<<endl;\n        }\n    }\n}\n",ACCEPTED,33,424
1278579425015160832,ac84ffdb684484aea7c363ab676f9b5eb778268f3a15168c6f05f067552d4b29,2020-07-02 14:41:04,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <sstream>\n#include <string>\n#include <cmath>\nusing namespace std;\nint hw(int s)\n{\n    int ans=0;\n    for(int i=2;i<=10;i++)\n    {\n        if(ans==2) break;\n        int s0=s,j=0;\n        long long x=0;//转换成二进制可能很长 \n        while(s0)\n        {\n            x+=(s0%i)*pow(10,j);\n            s0/=i;\n            j++;\n        }\n        //cout<<x<<endl;\n        stringstream t;\n        string s;\n        t<<x;\n        t>>s;\n        int ls=s.size(),l=0;\n        while(s[l]==s[ls-1-l] && l<=(ls-1)/2)\n        {\n            l++;\n        }\n        l--;\n        if(l==(ls-1)/2) ans++;\n    }\n    return ans;\n}\nint main(){\n    int n,s,num=0;\n    cin>>n>>s;\n    while(num<n)\n    {\n        s++;\n        if(hw(s)==2) \n        {\n            cout<<s<<endl;\n            num++;\n        }\n    }\n    return 0;\n}\n",ACCEPTED,81,424
1278580186621075456,dc45081bb9d1bf2890cf7ccf2a5085a5972431a89a1343812baaeda9635a4048,2020-07-02 14:44:06,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <cstring>\n#include <iostream>\n\nusing namespace std;\nint b, a[20];\n\nbool check(int x)\n{\n\tint n = 0;\n\tx = x * x;\n\twhile (x)\n\t{\n\t\ta[++n] = x % b;\n\t\tx /= b;\n\t}\n\tfor (int i = 1, j = n; i < j; i++, j--)\n\t{\n\t\tif (a[i] != a[j])\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nvoid show(int x)\n{\n\tint n = 0;\n\twhile (x)\n\t{\n\t\ta[++n] = x % b;\n\t\tx /= b;\n\t}\n\tfor (int i = n; i >= 1; i--)\n\t{\n\t\tif (a[i] >= 10)\n\t\t{\n\t\t\tcout << a[i] - 10 + 'A';\n\t\t}\n\t\telse\n\t\t{\n\t\t\tcout << a[i];\n\t\t}\n\t}\n}\n\nint main()\n{\n\tcin >> b;\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\tif (check(i))\n\t\t{\n\t\t\tshow(i);\n\t\t\tcout << \"" \"";\n\t\t\tshow(i * i);\n\t\t\tcout << endl;\n\t\t}\n\t}\n\treturn 0;\n}\n",PARTIAL_ACCEPTED,36,424
1278580721008959488,c9983de4ae1d839794a7cfdab09d09965ac4bdcfd04f48cc569c2fe24e6abe7c,2020-07-02 14:46:13,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n\nusing namespace std;\nint sum;\nint a[100];\nint k;\nint basecnt;\nint jin;\nvoid change(int n){\n\tbasecnt=0;\n\twhile(n!=0){\n\t\ta[basecnt]=n%jin;\n\t\tn/=jin;\n\t\tbasecnt++;\n\t}\n\treturn ;\n}\nint main(){\n\tint n;\n\tcin>>sum>>n;\n\tint tmp;\n\tbool tf=false;\n\tint cnt=0;\n\tint cnt2=n+1;\n\t\twhile(cnt<sum){\n\t\t\tint cnt3=0;\n\t\t\tfor(int i=2;i<=10;i++){\t\t\n\t\t\t\tmemset(a,0,sizeof(a));\n\t\t\t\tjin=i;\n\t\t\t\tchange(cnt2);\n\t\t\t\ttf=false;\n\t\t\t\tfor(int j=0;j<basecnt;j++){\n\t\t\t\t\tif(a[j]!=a[basecnt-1-j]){\n\t\t\t\t\t\ttf=true;\n\t\t\t\t\t}\n\t\t\t\t}\t\t\n\t\t\tif(tf==false){\n\t\t\t\tif(cnt3==1){\n\t\t\t\tcout<<cnt2<<endl;\n\t\t\t\tcnt++;\n\t\t\t\tbreak;\t\n\t\t\t\t}else{\n\t\t\t\t\tcnt3++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcnt2++;\n\t}\n\treturn 0;\n} \n",COMPILE_ERROR,0,0
1278580830769709056,dc45081bb9d1bf2890cf7ccf2a5085a5972431a89a1343812baaeda9635a4048,2020-07-02 14:46:39,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <cstring>\n#include <iostream>\n\nusing namespace std;\nint b, a[20];\n\nbool check(int x)\n{\n\tint n = 0;\n\tx = x * x;\n\twhile (x)\n\t{\n\t\ta[++n] = x % b;\n\t\tx /= b;\n\t}\n\tfor (int i = 1, j = n; i < j; i++, j--)\n\t{\n\t\tif (a[i] != a[j])\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nvoid show(int x)\n{\n\tint n = 0;\n\twhile (x)\n\t{\n\t\ta[++n] = x % b;\n\t\tx /= b;\n\t}\n\tfor (int i = n; i >= 1; i--)\n\t{\n\t\tif (a[i] >= 10)\n\t\t{\n\t\t    cout << (char)(a[i] - 10 + 'A');\n\t\t}\n\t\telse\n\t\t{\n\t\t\tcout << a[i];\n\t\t}\n\t}\n}\n\nint main()\n{\n\tcin >> b;\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\tif (check(i))\n\t\t{\n\t\t\tshow(i);\n\t\t\tcout << \"" \"";\n\t\t\tshow(i * i);\n\t\t\tcout << endl;\n\t\t}\n\t}\n\treturn 0;\n}\n",ACCEPTED,40,512
1278581235817840640,c9983de4ae1d839794a7cfdab09d09965ac4bdcfd04f48cc569c2fe24e6abe7c,2020-07-02 14:48:16,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<fstream>\n#include<string>\n#include<algorithm>\n\nusing namespace std;\nint sum;\nint a[100];\nint k;\nint basecnt;\nint jin;\nvoid change(int n){\n\tbasecnt=0;\n\twhile(n!=0){\n\t\ta[basecnt]=n%jin;\n\t\tn/=jin;\n\t\tbasecnt++;\n\t}\n\treturn ;\n}\nint main(){\n\tint n;\n\tcin>>sum>>n;\n\tint tmp;\n\tbool tf=false;\n\tint cnt=0;\n\tint cnt2=n+1;\n\t\twhile(cnt<sum){\n\t\t\tint cnt3=0;\n\t\t\tfor(int i=2;i<=10;i++){\t\t\n\t\t\t\tmemset(a,0,sizeof(a));\n\t\t\t\tjin=i;\n\t\t\t\tchange(cnt2);\n\t\t\t\ttf=false;\n\t\t\t\tfor(int j=0;j<basecnt;j++){\n\t\t\t\t\tif(a[j]!=a[basecnt-1-j]){\n\t\t\t\t\t\ttf=true;\n\t\t\t\t\t}\n\t\t\t\t}\t\t\n\t\t\tif(tf==false){\n\t\t\t\tif(cnt3==1){\n\t\t\t\tcout<<cnt2<<endl;\n\t\t\t\tcnt++;\n\t\t\t\tbreak;\t\n\t\t\t\t}else{\n\t\t\t\t\tcnt3++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcnt2++;\n\t}\n\treturn 0;\n} \n",COMPILE_ERROR,0,0
1278581324338626560,c9983de4ae1d839794a7cfdab09d09965ac4bdcfd04f48cc569c2fe24e6abe7c,2020-07-02 14:48:37,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<fstream>\n#include<string>\n#include<algorithm>\n\nusing namespace std;\nint sum;\nint a[100];\nint k;\nint basecnt;\nint jin;\nvoid change(int n){\n\tbasecnt=0;\n\twhile(n!=0){\n\t\ta[basecnt]=n%jin;\n\t\tn/=jin;\n\t\tbasecnt++;\n\t}\n\treturn ;\n}\nint main(){\n\tint n;\n\tcin>>sum>>n;\n\tint tmp;\n\tbool tf=false;\n\tint cnt=0;\n\tint cnt2=n+1;\n\t\twhile(cnt<sum){\n\t\t\tint cnt3=0;\n\t\t\tfor(int i=2;i<=10;i++){\t\t\n\t\t\t\tmemset(a,0,sizeof(a));\n\t\t\t\tjin=i;\n\t\t\t\tchange(cnt2);\n\t\t\t\ttf=false;\n\t\t\t\tfor(int j=0;j<basecnt;j++){\n\t\t\t\t\tif(a[j]!=a[basecnt-1-j]){\n\t\t\t\t\t\ttf=true;\n\t\t\t\t\t}\n\t\t\t\t}\t\t\n\t\t\tif(tf==false){\n\t\t\t\tif(cnt3==1){\n\t\t\t\tcout<<cnt2<<endl;\n\t\t\t\tcnt++;\n\t\t\t\tbreak;\t\n\t\t\t\t}else{\n\t\t\t\t\tcnt3++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcnt2++;\n\t}\n\treturn 0;\n} \n",COMPILE_ERROR,0,0
1278581525241585664,c9983de4ae1d839794a7cfdab09d09965ac4bdcfd04f48cc569c2fe24e6abe7c,2020-07-02 14:49:25,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<fstream>\n#include<string>\n#include<algorithm>\n\nusing namespace std;\nint sum;\nint a[100];\nint k;\nint basecnt;\nint jin;\nvoid change(int n){\n\tbasecnt=0;\n\twhile(n!=0){\n\t\ta[basecnt]=n%jin;\n\t\tn/=jin;\n\t\tbasecnt++;\n\t}\n\treturn ;\n}\nint main()\n{\n\tint n;\n\tcin>>sum>>n;\n\tint tmp;\n\tbool tf=false;\n\tint cnt=0;\n\tint cnt2=n+1;\n\t\twhile(cnt<sum)\n        {\n\t\t\tint cnt3=0;\n\t\t\tfor(int i=2;i<=10;i++)\n            {\t\t\n\t\t\t\tmemset(a,0,sizeof(a));\n\t\t\t\tjin=i;\n\t\t\t\tchange(cnt2);\n\t\t\t\ttf=false;\n\t\t\t\tfor(int j=0;j<basecnt;j++){\n\t\t\t\t\tif(a[j]!=a[basecnt-1-j]){\n\t\t\t\t\t\ttf=true;\n\t\t\t\t\t}\n\t\t\t\t}\t\t\n\t\t\tif(tf==false){\n\t\t\t\tif(cnt3==1){\n\t\t\t\tcout<<cnt2<<endl;\n\t\t\t\tcnt++;\n\t\t\t\tbreak;\t\n\t\t\t\t}else{\n\t\t\t\t\tcnt3++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcnt2++;\n\t}\n\treturn 0;\n} \n",COMPILE_ERROR,0,0
1278581558582116352,dc45081bb9d1bf2890cf7ccf2a5085a5972431a89a1343812baaeda9635a4048,2020-07-02 14:49:33,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cstring>\nusing namespace std;\nint main()\n{\n\tint squ,temp,c;\n\tint B;//进制\n\tint s1[20],s2[20];//，把平方数拆成位，s1装平方数的逆序，s2装平方数的正序\n\tchar s4[20];\n\tcin >> B;\n\tchar a[20]{ '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };//转进制用\n\tfor(int x = 1; x <= 300; x++)//穷举1-300的数\n\t{\n\t\tint m = 0;\n\t\tint k = 1,flag = 1;//flag用来标识是否为回文\n\t\tint p, q = 0;\n\t\tsqu = x * x;//得到平方数\n\t\ttemp = x;//暂存x\n\t\twhile (squ != 0)//求每一位数，逆序装进s1\n\t\t{\n\t\t\tc = squ % B;\n\t\t\tsqu /= B;\n\t\t\tm++;\n\t\t\ts1[m] = c;\n\t\t}\n\t\tfor (int j = m; j >= 1; j--)//正序装进s2\n\t\t{\n\t\t\ts2[j] = s1[k];\n\t\t\tk++;\n\t\t}\n\t\tfor (int i = 1; i <= m; i++)//比较s1与s2，是否为回文\n\t\t{\n\t\t\tif (s1[i] != s2[i])\n\t\t\t{\n\t\t\t\tflag = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (flag == 1)//平方数是回文了，进行输出（进制转换后）\n\t\t{\n\t\t\twhile (temp != 0)//转换x位B进制\n\t\t\t{\n\t\t\t\tp = temp % B;\n\t\t\t\ttemp /= B;\n\t\t\t\tq++;\n\t\t\t\ts4[q] = a[p];\n\t\t\t}\n\t\t\tfor (int c = q; q >= 1; q--)\n\t\t\t\tcout << s4[q];\n\t\t\tcout << \"" \"";\n\t\t\tfor (int d = m; m >= 1; m--)\n\t\t\t\tcout << a[s1[m]];\n\t\t\tcout << endl;\n\t\t}\n\t\tmemset(s1, 0, sizeof(s1));//对s1和s2进行清0\n\t\tmemset(s2, 0, sizeof(s1));\n\t}\n\treturn 0;\n}",ACCEPTED,40,424
1278581940083417088,bd23feb70f31c39d44f8632991273351b7ada8a16cc217a7026b9a98a9d21bf7,2020-07-02 14:51:04,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <string>\n#include <iostream>\nusing namespace std;\nint b, a[20];\n\nbool check(int x)\n{\n    int n = 0;\n    x = x * x;\n    while (x)\n    {\n        a[++n] = x % b;\n        x /= b;\n    }\n    for (int i = 1, j = n; i < j; i++, j--)\n    {\n        if (a[i] != a[j])\n        {\n            return false;\n        }\n    }\n    return true;\n}\n\nvoid show(int x)\n{\n    int n = 0;\n    while (x)\n    {\n        a[++n] = x % b;\n        x /= b;\n    }\n    for (int i = n; i >= 1; i--)\n    {\n        if (a[i] >= 10)\n        {\n            cout << a[i] - 10 + 'a';\n        }\n        else\n        {\n            cout << a[i];\n        }\n    }\n}\n\nint main() \n{\n    cin >> b;\n    for (int i = 1; i <= 300; i++)\n    {\n        if (check(i)) \n        {\n            show(i);\n            cout << \"" \"";\n            show(i*i);\n            cout << endl;\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,39,424
1278582024019828736,c9983de4ae1d839794a7cfdab09d09965ac4bdcfd04f48cc569c2fe24e6abe7c,2020-07-02 14:51:24,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<cstdio>\n#include<cstring>\n#include<algorithm>\nusing namespace std; \nint n,s;\nstruct node{\n\tint l,a[20]; \n\tnode (int x,int b){for(l=0;x;l++) a[l]=x%b,x/=b;}\n\tbool pd(){for(int i=0;i<l;i++) if(a[i]!=a[l-i-1]) return false;return true;}\n};\nint main(){\n\tscanf(\""%d%d\"",&n,&s); int t=0; \n\tfor(int i=s+1;i<=100000;i++){\n\t\tint tt=0; \n\t\tfor (int j=2;j<=10;j++) {\n\t\t\tnode g(i,j); \n\t\t\tif (g.pd()) tt++; \n\t\t}\n\t\tif (tt>=2) {\n\t\t\tprintf(\""%d\\n\"",i); \n\t\t\tt++; \n\t\t\tif (t==n) return 0; \n\t\t}\n\t}\n}\n\n",ACCEPTED,28,384
1278582371069124608,c9983de4ae1d839794a7cfdab09d09965ac4bdcfd04f48cc569c2fe24e6abe7c,2020-07-02 14:52:46,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<cstdio>\n#include<iostream>\n#include<cstring>\n#include<algorithm>\n\nusing namespace std; \nint n,s;\nstruct node\n{\n\tint l,a[20]; \n\tnode (int x,int b){for(l=0;x;l++) a[l]=x%b,x/=b;}\n\tbool pd(){for(int i=0;i<l;i++) if(a[i]!=a[l-i-1]) return false;return true;}\n};\nint main()\n{\n\tscanf(\""%d%d\"",&n,&s);\n    int t=0; \n\tfor(int i=s+1;i<=100000;i++)\n    {\n\t\tint tt=0; \n\t\tfor (int j=2;j<=10;j++)\n        {\n\t\t\tnode g(i,j); \n\t\t\tif (g.pd()) tt++; \n\t\t}\n\t\tif (tt>=2)\n        {\n\t\t\tprintf(\""%d\\n\"",i); \n\t\t\tt++; \n\t\t\tif (t==n) return 0; \n\t\t}\n\t}\n}\n\n",ACCEPTED,37,512
1278582524169609216,c9983de4ae1d839794a7cfdab09d09965ac4bdcfd04f48cc569c2fe24e6abe7c,2020-07-02 14:53:23,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<cstdio>\n#include<iostream>\n#include<cstring>\n#include<algorithm>\n\nusing namespace std; \nint n,s;\nstruct node\n{\n\tint l,a[20]; \n\tnode (int x,int b){for(l=0;x;l++) a[l]=x%b,x/=b;}\n\tbool pd(){for(int i=0;i<l;i++) if(a[i]!=a[l-i-1]) return false;return true;}\n};\nint main()\n{\n\tscanf(\""%d%d\"",&n,&s);\n    int t=0; \n\tfor(int i=s+1;i<=100000;i++)\n    {\n\t\tint tt=0; \n\t\tfor (int j=2;j<=10;j++)\n        {\n\t\t\tnode g(i,j); \n\t\t\tif (g.pd()) tt++; \n\t\t}\n\t\tif (tt>=2)\n        {\n\t\t\tprintf(\""%d\\n\"",i); \n\t\t\tt++; \n\t\t\tif (t==n) return 0; \n\t\t}\n\t}\n}\n\n",ACCEPTED,39,592
1278582574677417984,bd23feb70f31c39d44f8632991273351b7ada8a16cc217a7026b9a98a9d21bf7,2020-07-02 14:53:35,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <cstring>\n#include <iostream>\n\nusing namespace std;\nint b, a[20];\n\nbool check(int x)\n{\n\tint n = 0;\n\tx = x * x;\n\twhile (x)\n\t{\n\t\ta[++n] = x % b;\n\t\tx /= b;\n\t}\n\tfor (int i = 1, j = n; i < j; i++, j--)\n\t{\n\t\tif (a[i] != a[j])\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nvoid show(int x)\n{\n\tint n = 0;\n\twhile (x)\n\t{\n\t\ta[++n] = x % b;\n\t\tx /= b;\n\t}\n\tfor (int i = n; i >= 1; i--)\n\t{\n\t\tif (a[i] >= 10)\n\t\t{\n\t\t\tcout << (char)(a[i] - 10 + 'A');\n\t\t}\n\t\telse\n\t\t{\n\t\t\tcout << a[i];\n\t\t}\n\t}\n}\n\nint main()\n{\n\tcin >> b;\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\tif (check(i))\n\t\t{\n\t\t\tshow(i);\n\t\t\tcout << \"" \"";\n\t\t\tshow(i * i);\n\t\t\tcout << endl;\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,41,424
1278582697205628928,c9983de4ae1d839794a7cfdab09d09965ac4bdcfd04f48cc569c2fe24e6abe7c,2020-07-02 14:54:04,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<cstdio>\n#include<iostream>\n#include<cstring>\n#include<algorithm>\n\nusing namespace std; \nint m,s;\nstruct node\n{\n\tint l,a[20]; \n\tnode (int x,int b){for(l=0;x;l++) a[l]=x%b,x/=b;}\n\tbool pd(){for(int i=0;i<l;i++) if(a[i]!=a[l-i-1]) return false;return true;}\n};\nint main()\n{\n\tscanf(\""%d%d\"",&m,&s);\n    int t=0; \n\tfor(int i=s+1;i<=100000;i++)\n    {\n\t\tint tt=0; \n\t\tfor (int j=2;j<=10;j++)\n        {\n\t\t\tnode g(i,j); \n\t\t\tif (g.pd()) tt++; \n\t\t}\n\t\tif (tt>=2)\n        {\n\t\t\tprintf(\""%d\\m\"",i); \n\t\t\tt++; \n\t\t\tif (t==m) return 0; \n\t\t}\n\t}\n}\n\n",WRONG_ANSWER,36,512
1278582840055234560,c9983de4ae1d839794a7cfdab09d09965ac4bdcfd04f48cc569c2fe24e6abe7c,2020-07-02 14:54:38,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<cstdio>\n#include<iostream>\n#include<cstring>\n#include<algorithm>\n\nusing namespace std; \nint m,s;\nstruct node\n{\n\tint l,a[20]; \n\tnode (int x,int b){for(l=0;x;l++) a[l]=x%b,x/=b;}\n\tbool pd(){for(int i=0;i<l;i++) if(a[i]!=a[l-i-1]) return false;return true;}\n};\nint main()\n{\n\tscanf(\""%d%d\"",&m,&s);\n    int t=0; \n\tfor(int i=s+1;i<=100000;i++)\n    {\n\t\tint tt=0; \n\t\tfor (int j=2;j<=10;j++)\n        {\n\t\t\tnode g(i,j); \n\t\t\tif (g.pd()) tt++; \n\t\t}\n\t\tif (tt>=2)\n        {\n\t\t\tprintf(\""%d\\m\"",i); \n\t\t\tt++; \n\t\t\tif (t==m) return 0; \n\t\t}\n\t}\n}\n\n",WRONG_ANSWER,41,456
1278584257679654912,bd23feb70f31c39d44f8632991273351b7ada8a16cc217a7026b9a98a9d21bf7,2020-07-02 15:00:16,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nint b, a[100000];\n\nvoid show(int x)\n{\n    int n = 0;\n    while (x)\n    {\n        a[++n] = x % b;\n        x /= b;\n    }\n    for (int i = n; i >= 1; i--)\n    {\n        if (a[i] >= 10)\n        {\n            cout << char(a[i] - 10 + 'a');\n        }\n        else\n        {\n            cout << a[i];\n        }\n    }\n}\n\nbool check(int x)\n{\n    int n = 0;\n    x *= x;\n    while (x)\n    {\n        n++;\n        a[++n] = x % b;\n        x /= b;\n        \n    }\n    for (int j = 1; j <= n / 2 + 1; j++)\n    {\n        if (a[j] != a[n - j + 1])\n        {\n            return false;\n        }\n    }\n    return true;\n}\n\nint main() \n{\n    cin >> b;\n    for (int i = 1; i <= 300; i++)\n    {\n        if (check(i)) \n        {\n            show(i);\n            cout << \"" \"";\n            show(i*i);\n            cout << endl;\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,40,524
1278584346259152896,870639b86c6ef9a7a2d08fc3941ed91e6f086b72233a9e951b8f688077d1b0fe,2020-07-02 15:00:37,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<stdbool.h>\nusing namespace std;\n\nchar c[]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nvoid tran(int n,int B){\n    int r=0;\n    char num[20];\n    while(n!=0){\n        num[r]=c[n%B];\n        n=n/B;\n        r++;\n    }\n    for(int i=r-1;i>=0;i--){\n        cout<<num[i];\n    }\n}\n\nbool huiwen(int n,int b){\n    int r=0;\n    char num[20];\n    while(n!=0){\n        num[r]=c[n%b];\n        n=n/b;\n        r++;\n    }\n    for (int i=0;i<=r/2;i++){\n        if (num[i]!=num[n-1-i])\n            return false;\n    }\n    return true;\n}\n\nint main(){\n    int b;\n    cin>>b;\n\n    for(int i=1;i<=300;i++){\n        if(huiwen(i*i,b)==1){\n            tran(i,b);\n            cout<<\"" \""<<endl;\n            tran(i*i,b);\n        }\n    }\n}",WRONG_ANSWER,32,424
1278587517861814272,870639b86c6ef9a7a2d08fc3941ed91e6f086b72233a9e951b8f688077d1b0fe,2020-07-02 15:13:13,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<stdbool.h>\n#include<math.h>\nusing namespace std;\n\nchar c[]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nvoid tran(int n,int B){\n    int r=0;\n    char num[20];\n    while(n!=0){\n        num[r]=c[n%B];\n        n=n/B;\n        r++;\n    }\n    for(int i=r-1;i>=0;i--){\n        cout<<num[i];\n    }\n}\n\nbool huiwen(int n,int b){\n    int r=0;\n    char num[20];\n    while(n!=0){\n        num[r]=c[n%b];\n        n=n/b;\n        r++;\n    }\n    for (int i=0;i<=r/2;i++){\n        if (num[i]!=num[n-1-i])\n            return false;\n    }\n    return true;\n}\n\nint main(){\n    int b;\n    cin>>b;\n\n    for(int i=1;i<=300;i++){\n        if(huiwen(i*i,b)==1){\n            tran(i,b);\n            cout<<\"" \"";\n            tran(i*i,b);\n            cout<<endl;\n        }\n    }\n}",WRONG_ANSWER,33,484
1278589133616775168,bd23feb70f31c39d44f8632991273351b7ada8a16cc217a7026b9a98a9d21bf7,2020-07-02 15:19:39,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <cstring>\n#include <iostream>\n\nusing namespace std;\nint b, a[20];\n\nvoid show(int x)\n{\n\tint n = 0;\n\twhile (x)\n\t{\n\t\ta[++n] = x % b;\n\t\tx /= b;\n\t}\n\tfor (int i = n; i >= 1; i--)\n\t{\n\t\tif (a[i] > 9)\n\t\t{\n\t\t\tcout << (char)(a[i] - 10 + 'A');\n\t\t}\n\t\telse\n\t\t{\n\t\t\tcout << a[i];\n\t\t}\n\t}\n}\n\nbool check(int x)\n{\n\tint n = 0;\n\tx = x * x;\n\twhile (x)\n\t{\n        ++n\n\t\ta[n] = x % b;\n\t\tx /= b;\n\t}\n\tfor (int i = 1, j = n; i < j; i++, j--)\n\t{\n\t\tif (a[i] != a[j])\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nint main()\n{\n\tcin >> b;\n\tfor (int i = 1; i < 301; i++)\n\t{\n\t\tif (check(i))\n\t\t{\n\t\t\tshow(i);\n\t\t\tcout << \"" \"";\n\t\t\tshow(i * i);\n\t\t\tcout << endl;\n\t\t}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1278589248968523776,bd23feb70f31c39d44f8632991273351b7ada8a16cc217a7026b9a98a9d21bf7,2020-07-02 15:20:06,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <cstring>\n#include <iostream>\n\nusing namespace std;\nint b, a[20];\n\nvoid show(int x)\n{\n\tint n = 0;\n\twhile (x)\n\t{\n        ++n;\n\t\ta[n] = x % b;\n\t\tx /= b;\n\t}\n\tfor (int i = n; i >= 1; i--)\n\t{\n\t\tif (a[i] > 9)\n\t\t{\n\t\t\tcout << (char)(a[i] - 10 + 'A');\n\t\t}\n\t\telse\n\t\t{\n\t\t\tcout << a[i];\n\t\t}\n\t}\n}\n\nbool check(int x)\n{\n\tint n = 0;\n\tx = x * x;\n\twhile (x)\n\t{\n        ++n;\n\t\ta[n] = x % b;\n\t\tx /= b;\n\t}\n\tfor (int i = 1, j = n; i < j; i++, j--)\n\t{\n\t\tif (a[i] != a[j])\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nint main()\n{\n\tcin >> b;\n\tfor (int i = 1; i < 301; i++)\n\t{\n\t\tif (check(i))\n\t\t{\n\t\t\tshow(i);\n\t\t\tcout << \"" \"";\n\t\t\tshow(i * i);\n\t\t\tcout << endl;\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,43,500
1278589868899229696,870639b86c6ef9a7a2d08fc3941ed91e6f086b72233a9e951b8f688077d1b0fe,2020-07-02 15:22:34,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<stdbool.h>\nusing namespace std;\n\nchar c[]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nvoid tran(int n,int B){\n    int r=0;\n    char num[20];\n    while(n!=0){\n        num[r]=c[n%B];\n        n=n/B;\n        r++;\n    }\n    for(int i=r-1;i>=0;i--){\n        cout<<num[i];\n    }\n}\n\nbool huiwen(int n,int b){\n    int r=0;\n    char num[20];\n    while(n!=0){\n        num[r]=c[n%b];\n        n=n/b;\n        r++;\n    }\n    for (int i=0;i<=r/2;i++){\n        if (num[i]!=num[n-1-i])\n            return false;\n    }\n    return true;\n}\n\nint main(){\n    int b;\n    cin>>b;\n\n    for(int i=1;i<=300;i++){\n        if(huiwen(i*i,b)){\n            tran(i,b);\n            cout<<\"" \"";\n            tran(i*i,b);\n            cout<<endl;\n        }\n    }\n}",WRONG_ANSWER,40,512
1278590347645476864,870639b86c6ef9a7a2d08fc3941ed91e6f086b72233a9e951b8f688077d1b0fe,2020-07-02 15:24:28,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<stdbool.h>\nusing namespace std;\n\nchar c[]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nvoid tran(int n,int B){\n    int r=0;\n    char num[20];\n    while(n!=0){\n        num[r]=c[n%B];\n        n=n/B;\n        r++;\n    }\n    for(int i=r-1;i>=0;i--){\n        cout<<num[i];\n    }\n}\n\nbool huiwen(int n,int b){\n    int r=0;\n    char num[20];\n    while(n!=0){\n        num[r]=c[n%b];\n        n=n/b;\n        r++;\n    }\n    for (int i=0;i<=r/2;i++){\n        if (num[i]!=num[r-1-i])\n            return false;\n    }\n    return true;\n}\n\nint main(){\n    int b;\n    cin>>b;\n\n    for(int i=1;i<=300;i++){\n        if(huiwen(i*i,b)){\n            tran(i,b);\n            cout<<\"" \"";\n            tran(i*i,b);\n            cout<<endl;\n        }\n    }\n}",ACCEPTED,32,488
1278591915526651904,685d92e8c15d0ebd2875b6981da27f1f4ec039ee8163beabb74fb58572d473d4,2020-07-02 15:30:42,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint k[1000];\nint b, c, d;\nint judge(int x)\n{\n\tint t,i;\n\tt = x;\n\ti = 0;\n\twhile (t != 0)\n\t{\n\t\ti++;\n\t\tk[i] = t % b;\n\t\tt = t / b;\n\t}\n\td = i;\n\tfor (int j = 1; j <= i / 2 + 1; j++)\n\t\tif (k[j] != k[i - j + 1])\n\t\t\treturn 0;\n\treturn 1;\n}\nvoid f(int x)\n{\n\tif (x == 0)\n\t\treturn;\n\tf(x / b);\n\tif (x%b <= 9)\n\t\tcout << x % b;\n\telse\n\t\tcout << x % b + 55;\n}\nint main()\n{\n\tcin >> b;\n\tfor (c = 1; c <= 3000; c++)\n\t\tif (judge(c*c))\n\t\t{\n\t\t\tf(c);\n\t\t\tcout << \"" \"";\n\t\t\tfor (int i = 1; i <= d; i++)\n\t\t\t{\n\t\t\t\tif (k[i] <= 9)\n\t\t\t\t\tcout << k[i];\n\t\t\t\telse\n\t\t\t\t\tcout << a[i] + 55 << endl;\n\t\t\t}\n\n\t\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1278592030689656832,685d92e8c15d0ebd2875b6981da27f1f4ec039ee8163beabb74fb58572d473d4,2020-07-02 15:31:09,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint k[1000];\nint b, c, d;\nint judge(int x)\n{\n\tint t,i;\n\tt = x;\n\ti = 0;\n\twhile (t != 0)\n\t{\n\t\ti++;\n\t\tk[i] = t % b;\n\t\tt = t / b;\n\t}\n\td = i;\n\tfor (int j = 1; j <= i / 2 + 1; j++)\n\t\tif (k[j] != k[i - j + 1])\n\t\t\treturn 0;\n\treturn 1;\n}\nvoid f(int x)\n{\n\tif (x == 0)\n\t\treturn;\n\tf(x / b);\n\tif (x%b <= 9)\n\t\tcout << x % b;\n\telse\n\t\tcout << x % b + 55;\n}\nint main()\n{\n\tcin >> b;\n\tfor (c = 1; c <= 3000; c++)\n\t\tif (judge(c*c))\n\t\t{\n\t\t\tf(c);\n\t\t\tcout << \"" \"";\n\t\t\tfor (int i = 1; i <= d; i++)\n\t\t\t{\n\t\t\t\tif (k[i] <= 9)\n\t\t\t\t\tcout << k[i];\n\t\t\t\telse\n\t\t\t\t\tcout << k[i] + 55 << endl;\n\t\t\t}\n\n\t\t}\n\treturn 0;\n}",MULTIPLE_ERROR,43,512
1278595152216522752,bd23feb70f31c39d44f8632991273351b7ada8a16cc217a7026b9a98a9d21bf7,2020-07-02 15:43:34,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<fstream>\nusing namespace std;\n\nbool legal(int num)\n{\n    int times = 0;\n    for (int base = 2; base <= 10; base++)\n    {\n        int p = 0, arr[32], x = num;\n        x = num;\n        while (x)\n        {\n            arr[++p] = x % base;\n            x = x / base;\n        }\n        bool ok = 1;\n        for (int j = 1; ok && (j <= p); j++)\n        {\n            ok =(ok && arr[j] == arr[p - j + 1]);\n            if (ok)\n            {\n                times++;\n            }\n        }\n        if (times > 1)\n        {\n            return true;\n        }\n    }\n    return false;\n}\n\nint main()\n{\n    int s, n;\n    \n    cin >> n >> s;\n    for (int i = s + 1; n; i++)\n        if (legal(i))\n        {\n            cout << i << endl;\n            n--;\n        }\n    return 0;\n}",PARTIAL_ACCEPTED,35,512
1278596644331773952,70e39561c0bb1e7675e7020ef49ce4e301d959d602d726862851cee8fa69d5ed,2020-07-02 15:49:29,C++,60.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<iostream>\n#include <string>\n#include <algorithm>\n#include <iomanip>\n#include<math.h>\n#include<cstring>\n\n\nusing namespace std;\n\nint weishu(int a, int b)\n{\n    int wei=0;\n    if(a!=0)\n    {\n        for(int i=0;i<10;i++)\n        {\n            if(a>=pow(b,i)&&a<pow(b,i+1))\n            {\n                wei=i+1;\n                break;\n            }\n        }\n    }\n    else\n    {\n        wei=1;\n    }\n    return wei;\n}\n\nint main()\n{\n    string zimu=\""ABCDEFGHIJ\"";\n    int b,ciweishu;\n    cin>>b;\n    int a,a0,m,m0,judge;\n    int huan[20],huan0[20];\n    string zhuanhuanhou[20],zhuanhuanhou0[20];\n\n    for(int i=1;i<301;i++)\n    {\n        a=pow(i,2);\n        a0=i;\n        m=weishu(a,b);\n\n        judge=1;\n\n\n        for(int i=0;i<m;i++)\n        {\n\n            ciweishu=(a-a%int(pow(b,m-i-1)))/pow(b,m-1-i);\n\n            huan[i]=ciweishu;\n            a-=ciweishu*pow(b,m-1-i);\n\n        }\n\n        for(int i=0;i<m;i++)\n        {\n            if(huan[i]>9)\n            {\n                zhuanhuanhou[i]=zimu[huan[i]-10];\n            }\n            else\n            {\n                zhuanhuanhou[i]=to_string(huan[i]);\n            }\n        }\n\n        for(int i=0;i<m;i++)\n        {\n            if(zhuanhuanhou[i]!=zhuanhuanhou[m-i-1])\n            {\n                judge=0;\n                break;\n            }\n        }\n\n        if(judge==1)\n        {\n            m0=weishu(a0,b);\n            for(int j=0;j<m0;j++)\n            {\n\n                ciweishu=(a0-a0%int(pow(b,m0-j-1)))/pow(b,m0-1-j);\n\n                huan0[j]=ciweishu;\n                a0-=ciweishu*pow(b,m0-1-j);\n\n            }\n\n            for(int j=0;j<m0;j++)\n            {\n                if(huan0[j]>9)\n                {\n                    zhuanhuanhou0[j]=zimu[huan0[j]-10];\n                }\n                else\n                {\n                    zhuanhuanhou0[j]=to_string(huan0[j]);\n                }\n            }\n\n            for(int i=0;i<m0;i++)\n            {\n                cout<<zhuanhuanhou0[i];\n            }\n            cout<<\"" \"";\n\n            for(int i=0;i<m;i++)\n            {\n                cout<<zhuanhuanhou[i];\n            }\n            cout<<endl;\n        }\n    }\n\n\n\n    return 0;\n}\n",PARTIAL_ACCEPTED,47,520
1278601517819428864,ca250d8365628acf18ac37120bb365044845c5c9157bd0a8d584bb34585d4ae3,2020-07-02 16:08:51,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\nchar a[20] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\nint main()\n{\n\tint n;\n\tcin >> n;\n\tint i = 11;\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\tvector <char> ori;\n\t\tvector <char> squ;\n\t\tint i1 = i, i2 = i * i;\n\t\twhile (i1 != 0)\n\t\t{\n\t\t\tint j = i1 % n;\n\t\t\tori.push_back(a[j]);\n\t\t\ti1 = i1 / n;\n\t\t}\n\n\t\twhile (i2 != 0)\n\t\t{\n\t\t\tint j = i2 % n;\n\t\t\tsqu.push_back(a[j]);\n\t\t\ti2 = i2 / n;\n\t\t}\n\n\t\t//判断回文\n\t\tbool flag = true;\n\t\tint l1 = ori.size();\n\t\tint l2 = squ.size();\n\t\tfor (int j = 0; j < l2 / 2; j++)\n\t\t{\n\t\t\tif (squ[j] != squ[l2 - j -1])\n\t\t\t{\n\t\t\t\tflag = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\n\n\t\t//输出\n\t\tif (flag == true)\n\t\t{\n\t\t\tfor (int j = l1 - 1; j >= 0; j--)\n\t\t\t{\n\t\t\t\tcout << ori[j];\n\t\t\t}\n\n\t\t\tcout << \"" \"";\n\n\t\t\tfor (int j = l2 - 1; j >= 0; j--)\n\t\t\t{\n\t\t\t\tcout << squ[j];\n\t\t\t}\n\t\t\tcout << endl;\n\n\t\t}\n\t}\n}",ACCEPTED,40,516
1278604555292434432,981a92fd822b0ea04eda5711ba61a932542e5eca1203d551be888da675e37eca,2020-07-02 16:20:55,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstring>\nusing namespace std;\nchar a[21]={'0','1','2','3','4','5','6','7','8',\n'9','A','B','C','D','E','F','G','H','I','J','K'};\nint b;\nbool tf(string s)\n{\n    int len=s.length()-1;\n    for (int i=1;i<=len/2;i++)\n        if (s[i]!=s[len-i+1]) return false;\n    return true;\n}\nint main()\n{\n    freopen(\""palsquare.in\"",\""r\"",stdin);\n    freopen(\""palsquare.out\"",\""w\"",stdout);\n    cin>>b;\n    string s1,s2;int k;\n    for (int i=1;i<=300;i++)\n    {\n        k=i;s1=' ';\n        while (k)\n        {\n            s1=s1+a[k%b];\n            k=k/b;\n        }\n        k=i*i;s2=' ';\n        while (k)\n        {\n            s2=s2+a[k%b];\n            k=k/b;\n        }\n        if (tf(s2))\n        {\n            for (int j=s1.length()-1;j>=1;j--)\n                cout<<s1[j];\n            s2.erase(0,1);\n            cout<<' '<<s2<<endl;\n        }\n    }\n    return 0;\n}",FLOAT_POINT_EXCEPTION,41,484
1278605428034830336,6f835599bf3a6c8ff0fc421d97258ed6c0eb7de523508a721d1a55bf4d845efb,2020-07-02 16:24:24,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint N,S;\nint sum = 0;\nbool panding(int x,int i)//判定i进制时，是不是回文数\n{\n    int y;\n    int a = 0;\n    y = x;\n    while (y > 0)\n    {\n        a = a * i + y % i;\n        y /= i;\n    }\n    if (a == x)\n        return true;\n    else\n        return false;\n}\n\n\nint main()\n{\n\tcin >> N>>S;\n\t\n\tfor (int i = S; i <= N + S; i++)\n\t{\n        for (int j = 2; j <= 10; ++j)\n        {\n            while (panding(i, j))\n            {\n                sum = sum + 1;\n            }\n            if (sum >= 2)\n                cout << i << endl;\n        }\n       \n\t}\n    return 0;\n}",TIME_LIMIT_EXCEEDED,0,0
1278605444283555840,70e39561c0bb1e7675e7020ef49ce4e301d959d602d726862851cee8fa69d5ed,2020-07-02 16:24:27,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<iostream>\n#include <string>\n#include <algorithm>\n#include <iomanip>\n#include<math.h>\n#include<cstring>\n\n\nusing namespace std;\n\nint weishu(int a, int b)\n{\n    int wei=0;\n    if(a!=0)\n    {\n        for(int i=0;i<20;i++)\n        {\n            if(a>=pow(b,i)&&a<pow(b,i+1))\n            {\n                wei=i+1;\n                break;\n            }\n        }\n    }\n    else\n    {\n        wei=1;\n    }\n    return wei;\n}\n\nint main()\n{\n    string zimu=\""ABCDEFGHIJ\"";\n    int b,ciweishu;\n    cin>>b;\n    int a,a0,m,m0,judge;\n    int huan[30],huan0[30];\n    string zhuanhuanhou[30],zhuanhuanhou0[30];\n\n    for(int p=1;p<301;p++)\n    {\n        ciweishu=0;\n        a=pow(p,2);\n        a0=p;\n        m=weishu(a,b);\n\n        judge=1;\n\n\n        for(int i=0;i<m;i++)\n        {\n\n            ciweishu=(a-a%int(pow(b,m-i-1)))/pow(b,m-1-i);\n\n            huan[i]=ciweishu;\n            a-=ciweishu*pow(b,m-1-i);\n\n        }\n\n        for(int i=0;i<m;i++)\n        {\n            if(huan[i]>9)\n            {\n                zhuanhuanhou[i]=zimu[huan[i]-10];\n            }\n            else\n            {\n                zhuanhuanhou[i]=to_string(huan[i]);\n            }\n        }\n\n        for(int i=0;i<m;i++)\n            {\n                if(zhuanhuanhou[i]!=zhuanhuanhou[m-i-1])\n                {\n                    judge=0;\n                    break;\n                }\n            }\n\n\n\n        if(judge==1)\n        {\n            m0=weishu(a0,b);\n                    for(int j=0;j<m0;j++)\n                    {\n\n                        ciweishu=(a0-a0%int(pow(b,m0-j-1)))/pow(b,m0-1-j);\n\n                        huan0[j]=ciweishu;\n                        a0-=ciweishu*pow(b,m0-1-j);\n\n                    }\n\n                    for(int j=0;j<m0;j++)\n                    {\n                        if(huan0[j]>9)\n                        {\n                            zhuanhuanhou0[j]=zimu[huan0[j]-10];\n                        }\n                        else\n                        {\n                            zhuanhuanhou0[j]=to_string(huan0[j]);\n                        }\n                    }\n\n                    for(int i=0;i<m0;i++)\n                    {\n                        cout<<zhuanhuanhou0[i];\n                    }\n                    cout<<\"" \"";\n\n\n            for(int i=0;i<m;i++)\n                {\n                    cout<<zhuanhuanhou[i];\n                }\n                cout<<endl;\n            }\n\n\n    }\n\n\n\n    return 0;\n}\n",ACCEPTED,47,420
1278605923889635328,6f835599bf3a6c8ff0fc421d97258ed6c0eb7de523508a721d1a55bf4d845efb,2020-07-02 16:26:22,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint N,S;\nint sum = 0;\nbool panding(int x,int i)//判定i进制时，是不是回文数\n{\n    int y;\n    int a = 0;\n    y = x;\n    while (y > 0)\n    {\n        a = a * i + y % i;\n        y /= i;\n    }\n    if (a == x)\n        return true;\n    else\n        return false;\n}\n\n\nint main()\n{\n\tcin >> N>>S;\n\t\n\tfor (int i = S; i <= N + S; i++)\n\t{\n        for (int j = 2; j <= 10; ++j)\n        {\n            if (panding(i, j))\n            {\n                sum = sum + 1;\n            }\n            \n        }\n        if (sum >= 2)\n            cout << i << endl;\n\t}\n    return 0;\n}",WRONG_ANSWER,42,488
1278606006483869696,c718a5e15c13709ac252b40e283fb2aa1038ea11b52a4e636a057e3e1f4edac7,2020-07-02 16:26:41,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <string.h>\n#include <iostream>\nusing namespace std;\n\nint z;\nint huiwen(int z){\n    int  i , j , Z  , n = 0 , N , NN , k = 1 , g = 0;\n    string s[] = {\""0\""};\n    for(i = 10;i >= 2;i--)\n    {\n        Z = z;N = n;\n        if(Z > i)\n        {\n            j = Z % i;\n            s[N] = \""j\"";\n            N++;\n            Z  = (Z - j) / i;\n        }\n\n        if(s[0] != \""0\""  && s[N - 1] != \""0\"")\n        {\n            NN = N - 1;\n            for((N - 1);(N - 1) >= 0;N--)\n            {\n                if(s[NN - N + 1] == s[N - 1])\n                {\n                    k = 1;\n                }\n                else\n                {\n                    k = 0;\n                    break;\n                }\n\n\n\n            }\n\n            if(k == 1)\n            {\n               g += k;\n            }\n        }\n    }\n\n    if(g >= 2){\n        printf(\""%d\\n\"", z);\n    }\n\n    return 0;\n}\n\nint main(){\n    int t , s , z;\n    scanf(\""%d %d\"" , &t ,&s);\n    for(int i = 1;i <= t;i++){\n        z = s + i;\n        huiwen(z);\n    }\n\n    return 0;\n}\n",WRONG_ANSWER,35,512
1278606644093583360,c718a5e15c13709ac252b40e283fb2aa1038ea11b52a4e636a057e3e1f4edac7,2020-07-02 16:29:13,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <string.h>\n#include <iostream>\nusing namespace std;\n\nint z;\nint huiwen(int z){\n    int  i , j , Z  , n = 0 , N , NN , k = 1 , g = 0;\n    string s[] = {\""0\""};\n    for(i = 10;i >= 2;i--)\n    {\n        Z = z;N = n;\n        if(Z > i)\n        {\n            j = Z % i;\n            s[N] = \""j\"";\n            N++;\n            Z  = (Z - j) / i;\n        }\n\n        if(s[0] != \""0\""  && s[N - 1] != \""0\"")\n        {\n            NN = N - 1;\n            for((N - 1);(N - 1) >= 0;N--)\n            {\n                if(s[NN - N + 1] == s[N - 1])\n                {\n                    k = 1;\n                }\n                else\n                {\n                    k = 0;\n                    break;\n                }\n\n\n\n            }\n\n            if(k == 1)\n            {\n               g += k;\n            }\n        }\n    }\n\n    if(g >= 2){\n        cout << z << endl;\n    }\n\n    return 0;\n}\n\nint main(){\n    int t , s , z;\n    cin >> t >> s;\n    for(int i = 1;i <= t;i++){\n        z = s + i;\n        huiwen(z);\n    }\n\n    return 0;\n}\n",WRONG_ANSWER,36,604
1278607244940206080,6f835599bf3a6c8ff0fc421d97258ed6c0eb7de523508a721d1a55bf4d845efb,2020-07-02 16:31:37,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint N,S;\nint sum = 0;\nbool panding(int x,int i)\n{\n    int y;\n    int a = 0;\n    y = x;\n    while (y > 0)\n    {\n        a = a * i + y % i;\n        y /= i;\n    }\n    if (a == x)\n        return true;\n    else\n        return false;\n}\n\n\nint main()\n{\n\tcin >> N>>S;\n\t\n\tfor (int i = S; i <= N + S; i++)\n\t{\n        for (int j = 2; j <= 10; ++j)\n        {\n            if (panding(i, j))\n            {\n                sum = sum + 1;\n            }\n            \n        }\n        if (sum >= 2)\n            cout << i << endl;\n\t}\n    return 0;\n}",WRONG_ANSWER,35,488
1278607882080157696,bd23feb70f31c39d44f8632991273351b7ada8a16cc217a7026b9a98a9d21bf7,2020-07-02 16:34:09,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<fstream>\nusing namespace std;\n\nbool legal(int num)\n{\n    int times = 0;\n    for (int base = 2; base <= 10; base++)\n    {\n        int p = 0, arr[32], x = num;\n        x = num;\n        while (x)\n        {\n            arr[++p] = x % base;\n            x = x / base;\n        }\n        bool ok = 1;\n        for (int j = 1; ok && (j <= p); j++)\n        {\n            ok =(ok && arr[j] == arr[p - j + 1]);\n            if (ok)\n            {\n                times++;\n            }\n        }\n        if (times > 1)\n        {\n            return true;\n        }\n    }\n    return false;\n}\n\nint main()\n{\n    int s, n;\n    \n    cin >> n >> s;\n    for (int i = s + 1; n; i++)\n        if (legal(i))\n        {\n            cout << i << endl;\n            n--;\n        }\n    return 0;\n}",PARTIAL_ACCEPTED,29,384
1278612451988267008,8d418e97079b1446d46d1a9480943f8e522168ae5c37e784dde26739102d2a1a,2020-07-02 16:52:18,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"//回文平方数\n#include <iostream>\n\nusing std::cin;\nusing std::cout;\nusing std::endl;\nint ch1[100], ch2[100];\nint account1 = 0;\nint account2 = 0;\n\n\nint main()\n{\n    int B;\n    cin >> B;   //B进制,用十进制数表示,2<=B<=20\n    for (int i = 1; i <= 300; i++)\n    {\n        int m = i;\n        while (m)\n        {\n            ch1[account1] = m % B;\n            account1++;\n        }\n        m = i * i;\n        while (m)\n        {\n            ch2[account2] = m % B;\n            account2++;\n        }\n        int judge = 1;\n        for (int i = 0, j = account2 - 1; i < account2, j >= 0; i++, j--)\n            if (ch2[i] != ch[j])\n            {\n                judge = 0;\n                break;\n            }\n        if (judge)\n        {\n            for (int i = account1 - 1; i >= 0; i--)\n                if (ch1[i] < 10)\n                    cout << ch1[i];\n                else\n                    cout << (char)ch1[i];\n            cout << \"" \"";\n            for (int j = account2 - 1; j >= 0; j--)\n                if (ch2[j] < 10)\n                    cout << ch2[j];\n                else\n                    cout << (char)ch2[j];\n        }\n    }\n\n    return 0;\n}",COMPILE_ERROR,0,0
1278612741172944896,ca250d8365628acf18ac37120bb365044845c5c9157bd0a8d584bb34585d4ae3,2020-07-02 16:53:27,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\nchar a[20] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\nint main()\n{\n\tint n, s, amount=0;\n\tcin >> n>>s;\n\tint i = 11;\n\tfor (int i = s+1; amount < n; i++)\n\t{\n\t\tvector <char> two;\n\t\tvector <char> three;\n\t\tvector <char> four;\n\t\tvector <char> five;\n\t\tvector <char> six;\n\t\tvector <char> seven;\n\t\tvector <char> eight;\n\t\tvector <char> nine;\n\t\tvector <char> ten;\n\n\t\t\n\t\tint  i2 = i, i3 = i, i4 = i, i5 = i, i6 = i, i7 = i, i8 = i, i9 = i, i10 = i;\n\n\t\tint howmany = 0;\n\t\t\n\t\t\n\t\twhile (i2 != 0)\n\t\t{\n\t\t\tint j = i2 % 2;\n\t\t\ttwo.push_back(a[j]);\n\t\t\ti2 = i2 / 2;\n\t\t}\n        //判断回文\n\t\tbool flag = true;\n\t\tint l2 = two.size();\n\t\tfor (int j = 0; j < l2 / 2; j++)\n\t\t{\n\t\t\tif (two[j] != two[l2 - j - 1])\n\t\t\t{\n\t\t\t\tflag = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (flag == true) howmany++;\n\n\n\t\n\t\t\n\t\t\n\t\t\n\t\twhile (i3 != 0)\n\t\t{\n\t\t\tint j = i3 % 3;\n\t\t\tthree.push_back(a[j]);\n\t\t\ti3 = i3 / 3;\n\t\t}\n\t\t//判断回文\n\t\tflag = true;\n\t\tint l3 = three.size();\n\t\tfor (int j = 0; j < l3 / 2; j++)\n\t\t{\n\t\t\tif (three[j] != three[l3 - j - 1])\n\t\t\t{\n\t\t\t\tflag = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (flag == true) howmany++;\n\t\tif (howmany >= 2)\n\t\t{\n\t\t\tcout << i << endl;\n\t\t\tamount++;\n\t\t\tcontinue;\n\t\t}\n\n\n\n\n\n\t\twhile (i4 != 0)\n\t\t{\n\t\t\tint j = i4 % 4;\n\t\t\tfour.push_back(a[j]);\n\t\t\ti4 = i4 / 4;\n\t\t}\n\t\t//判断回文\n\t\tflag = true;\n\t\tint l4 = four.size();\n\t\tfor (int j = 0; j < l4 / 4; j++)\n\t\t{\n\t\t\tif (four[j] != four[l4 - j - 1])\n\t\t\t{\n\t\t\t\tflag = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (flag == true) howmany++;\n\t\tif (howmany >= 2)\n\t\t{\n\t\t\tcout << i << endl;\n\t\t\tamount++;\n\t\t\tcontinue;\n\t\t}\n\t\n\n\n\n\n\t\twhile (i5 != 0)\n\t\t{\n\t\t\tint j = i5 % 5;\n\t\t\tfive.push_back(a[j]);\n\t\t\ti5 = i5 / 5;\n\t\t}\n\t\t//判断回文\n\t\t flag = true;\n\t\tint l5 = five.size();\n\t\tfor (int j = 0; j < l5 / 2; j++)\n\t\t{\n\t\t\tif (five[j] != five[l5 - j - 1])\n\t\t\t{\n\t\t\t\tflag = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (flag == true) howmany++;\n\t\tif (howmany >= 2)\n\t\t{\n\t\t\tcout << i << endl;\n\t\t\tamount++;\n\t\t\tcontinue;\n\t\t}\n\n\n\n\n\t\twhile (i6 != 0)\n\t\t{\n\t\t\tint j = i6 % 6;\n\t\t\tsix.push_back(a[j]);\n\t\t\ti6 = i6 / 6;\n\t\t}\n\t\t//判断回文\n\t\tflag = true;\n\t\tint l6 = six.size();\n\t\tfor (int j = 0; j < l6 / 2; j++)\n\t\t{\n\t\t\tif (six[j] != six[l6 - j - 1])\n\t\t\t{\n\t\t\t\tflag = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (flag == true) howmany++;\n\t\tif (howmany >= 2)\n\t\t{\n\t\t\tcout << i << endl;\n\t\t\tamount++;\n\t\t\tcontinue;\n\t\t}\n\n\n\n\n\n\t\twhile (i7 != 0)\n\t\t{\n\t\t\tint j = i7 % 7;\n\t\t\tseven.push_back(a[j]);\n\t\t\ti7 = i7 / 7;\n\t\t}\n\t\t//判断回文\n\t\tflag = true;\n\t\tint l7 = seven.size();\n\t\tfor (int j = 0; j < l7 / 2; j++)\n\t\t{\n\t\t\tif (seven[j] != seven[l7 - j - 1])\n\t\t\t{\n\t\t\t\tflag = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (flag == true) howmany++;\n\t\tif (howmany >= 2)\n\t\t{\n\t\t\tcout << i << endl;\n\t\t\tamount++;\n\t\t\tcontinue;\n\t\t}\n\n\n\n\n\n\n\t\twhile (i8 != 0)\n\t\t{\n\t\t\tint j = i8 % 8;\n\t\t\teight.push_back(a[j]);\n\t\t\ti8 = i8 / 8;\n\t\t}\n\t\t//判断回文\n\t\tflag = true;\n\t\tint l8 = eight.size();\n\t\tfor (int j = 0; j < l8 / 2; j++)\n\t\t{\n\t\t\tif (eight[j] != eight[l8 - j - 1])\n\t\t\t{\n\t\t\t\tflag = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (flag == true) howmany++;\n\t\tif (howmany >= 2)\n\t\t{\n\t\t\tcout << i << endl;\n\t\t\tamount++;\n\t\t\tcontinue;\n\t\t}\n\n\n\n\n\t\twhile (i9 != 0)\n\t\t{\n\t\t\tint j = i9 % 9;\n\t\t\tsix.push_back(a[j]);\n\t\t\ti9 = i9 / 9;\n\t\t}\n\t\t//判断回文\n\t\tflag = true;\n\t\tint l9 = nine.size();\n\t\tfor (int j = 0; j < l9 / 2; j++)\n\t\t{\n\t\t\tif (nine[j] != nine[l9 - j - 1])\n\t\t\t{\n\t\t\t\tflag = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (flag == true) howmany++;\n\t\tif (howmany >= 2)\n\t\t{\n\t\t\tcout << i << endl;\n\t\t\tamount++;\n\t\t\tcontinue;\n\t\t}\n\n\n\n\n\t\twhile (i10 != 0)\n\t\t{\n\t\t\tint j = i10 % 10;\n\t\t\tten.push_back(a[j]);\n\t\t\ti10 = i10 / n;\n\t\t}\n\t\t//判断回文\n\t\tflag = true;\n\t\tint l10 = ten.size();\n\t\tfor (int j = 0; j < l10 / 2; j++)\n\t\t{\n\t\t\tif (ten[j] != ten[l10 - j - 1])\n\t\t\t{\n\t\t\t\tflag = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (flag == true) howmany++;\n\t\tif (howmany >= 2)\n\t\t{\n\t\t\tcout << i << endl;\n\t\t\tamount++;\n\t\t\tcontinue;\n\t\t}\n\n\n\n}\n\t\n\t\n}",PARTIAL_ACCEPTED,35,396
1278613014482190336,4c0c1485fb193a1b54dc8aabc13e975e61dd8db3743718b879cd75060a30934e,2020-07-02 16:54:32,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n#include<string>\nint main()\n{\n\tint n;\n\n\tint a[99999], b[99999];\n\n\tscanf_s(\""%d\"", &n);\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\tint x = 0;\n\t\tint j = i * i;\n\n\t\twhile (j)//进行进制转换的操作 \n\t\t{\n\t\t\ta[++x] = j % n;\n\t\t\tj = j / n;\n\t\t}\n\n\t\tbool o = true;//定义bool函数\n\t\tfor (int k = 1; k <= x / 2; k++) //判断是否为回文 \n\t\t\tif (a[k] != a[x - k + 1])\n\t\t\t\to = false;\n\t\tif (o)//为回文shu\n\t\t{\n\t\t\tj = i;\n\t\t\tint op = 0;\n\t\t\twhile (j) //进制转换 \n\t\t\t{\n\t\t\t\tb[++op] = j % n;\n\t\t\t\tj = j / n;\n\t\t\t}\n\t\t\t\n\t\t\t\n\t\t\tfor (int l = op; l > 0; l--)\n\t\t\t\tif (b[l] >= 10)\n\t\t\t\t\tprintf(\""%c\"", (char)(b[l] + 'A' - 10));\n\t\t\telse\n\t\t\t\tprintf(\""%d\"", b[l]);\n\t\t\tprintf(\"" \"");\n\t\t\t\n\t\t\t\n\t\t\tfor (int l = x; l > 0; l--)\n\t\t\t\tif (a[l] >= 10)\n\t\t\t\t\tprintf(\""%c\"", (char)(a[l] + 'A' - 10));\n\t\t\telse\n\t\t\t\tprintf(\""%d\"", a[l]);\n\t\t\tprintf(\""\\n\"");\n\t\t}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1278613125803212801,4c0c1485fb193a1b54dc8aabc13e975e61dd8db3743718b879cd75060a30934e,2020-07-02 16:54:59,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\nint main()\n{\n\tint n;\n\n\tint a[99999], b[99999];\n\n\tscanf(\""%d\"", &n);\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\tint x = 0;\n\t\tint j = i * i;\n\n\t\twhile (j)//进行进制转换的操作 \n\t\t{\n\t\t\ta[++x] = j % n;\n\t\t\tj = j / n;\n\t\t}\n\n\t\tbool o = true;//定义bool函数\n\t\tfor (int k = 1; k <= x / 2; k++) //判断是否为回文 \n\t\t\tif (a[k] != a[x - k + 1])\n\t\t\t\to = false;\n\t\tif (o)//为回文shu\n\t\t{\n\t\t\tj = i;\n\t\t\tint op = 0;\n\t\t\twhile (j) //进制转换 \n\t\t\t{\n\t\t\t\tb[++op] = j % n;\n\t\t\t\tj = j / n;\n\t\t\t}\n\t\t\t\n\t\t\t\n\t\t\tfor (int l = op; l > 0; l--)\n\t\t\t\tif (b[l] >= 10)\n\t\t\t\t\tprintf(\""%c\"", (char)(b[l] + 'A' - 10));\n\t\t\telse\n\t\t\t\tprintf(\""%d\"", b[l]);\n\t\t\tprintf(\"" \"");\n\t\t\t\n\t\t\t\n\t\t\tfor (int l = x; l > 0; l--)\n\t\t\t\tif (a[l] >= 10)\n\t\t\t\t\tprintf(\""%c\"", (char)(a[l] + 'A' - 10));\n\t\t\telse\n\t\t\t\tprintf(\""%d\"", a[l]);\n\t\t\tprintf(\""\\n\"");\n\t\t}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1278613264462700544,8d418e97079b1446d46d1a9480943f8e522168ae5c37e784dde26739102d2a1a,2020-07-02 16:55:32,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"//回文平方数\n#include <iostream>\n\nusing std::cin;\nusing std::cout;\nusing std::endl;\nint ch1[100], ch2[100];\nint account1 = 0;\nint account2 = 0;\n\n\nint main()\n{\n    int B;\n    cin >> B;   //B进制,用十进制数表示,2<=B<=20\n    for (int i = 1; i <= 300; i++)\n    {\n        int m = i;\n        while (m)\n        {\n            ch1[account1] = m % B;\n            account1++;\n        }\n        m = i * i;\n        while (m)\n        {\n            ch2[account2] = m % B;\n            account2++;\n        }\n        int judge = 1;\n        for (int i = 0, j = account2 - 1; i < account2, j >= 0; i++, j--)\n            if (ch2[i] != ch2[j])\n            {\n                judge = 0;\n                break;\n            }\n        if (judge)\n        {\n            for (int i = account1 - 1; i >= 0; i--)\n                if (ch1[i] < 10)\n                    cout << ch1[i];\n                else\n                    cout << (char)ch1[i];\n            cout << \"" \"";\n            for (int j = account2 - 1; j >= 0; j--)\n                if (ch2[j] < 10)\n                    cout << ch2[j];\n                else\n                    cout << (char)ch2[j];\n        }\n    }\n\n    return 0;\n}",SEGMENTATION_FAULT,23,384
1278613298222661632,4c0c1485fb193a1b54dc8aabc13e975e61dd8db3743718b879cd75060a30934e,2020-07-02 16:55:40,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n#include<string.h>\nint main()\n{\n\tint n;\n\n\tint a[99999], b[99999];\n\n\tscanf(\""%d\"", &n);\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\tint x = 0;\n\t\tint j = i * i;\n\n\t\twhile (j)//进行进制转换的操作 \n\t\t{\n\t\t\ta[++x] = j % n;\n\t\t\tj = j / n;\n\t\t}\n\n\t\tbool o = true;//定义bool函数\n\t\tfor (int k = 1; k <= x / 2; k++) //判断是否为回文 \n\t\t\tif (a[k] != a[x - k + 1])\n\t\t\t\to = false;\n\t\tif (o)//为回文shu\n\t\t{\n\t\t\tj = i;\n\t\t\tint op = 0;\n\t\t\twhile (j) //进制转换 \n\t\t\t{\n\t\t\t\tb[++op] = j % n;\n\t\t\t\tj = j / n;\n\t\t\t}\n\t\t\t\n\t\t\t\n\t\t\tfor (int l = op; l > 0; l--)\n\t\t\t\tif (b[l] >= 10)\n\t\t\t\t\tprintf(\""%c\"", (char)(b[l] + 'A' - 10));\n\t\t\telse\n\t\t\t\tprintf(\""%d\"", b[l]);\n\t\t\tprintf(\"" \"");\n\t\t\t\n\t\t\t\n\t\t\tfor (int l = x; l > 0; l--)\n\t\t\t\tif (a[l] >= 10)\n\t\t\t\t\tprintf(\""%c\"", (char)(a[l] + 'A' - 10));\n\t\t\telse\n\t\t\t\tprintf(\""%d\"", a[l]);\n\t\t\tprintf(\""\\n\"");\n\t\t}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1278613395677306880,8d418e97079b1446d46d1a9480943f8e522168ae5c37e784dde26739102d2a1a,2020-07-02 16:56:03,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"//回文平方数\n#include <iostream>\n\nusing std::cin;\nusing std::cout;\nusing std::endl;\nint ch1[10000], ch2[10000];\nint account1 = 0;\nint account2 = 0;\n\n\nint main()\n{\n    int B;\n    cin >> B;   //B进制,用十进制数表示,2<=B<=20\n    for (int i = 1; i <= 300; i++)\n    {\n        int m = i;\n        while (m)\n        {\n            ch1[account1] = m % B;\n            account1++;\n        }\n        m = i * i;\n        while (m)\n        {\n            ch2[account2] = m % B;\n            account2++;\n        }\n        int judge = 1;\n        for (int i = 0, j = account2 - 1; i < account2, j >= 0; i++, j--)\n            if (ch2[i] != ch2[j])\n            {\n                judge = 0;\n                break;\n            }\n        if (judge)\n        {\n            for (int i = account1 - 1; i >= 0; i--)\n                if (ch1[i] < 10)\n                    cout << ch1[i];\n                else\n                    cout << (char)ch1[i];\n            cout << \"" \"";\n            for (int j = account2 - 1; j >= 0; j--)\n                if (ch2[j] < 10)\n                    cout << ch2[j];\n                else\n                    cout << (char)ch2[j];\n        }\n    }\n\n    return 0;\n}",SEGMENTATION_FAULT,38,524
1278613425888886784,4c0c1485fb193a1b54dc8aabc13e975e61dd8db3743718b879cd75060a30934e,2020-07-02 16:56:10,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n#include<string.h>\n#include<math.h>\nint main()\n{\n\tint n;\n\n\tint a[99999], b[99999];\n\n\tscanf(\""%d\"", &n);\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\tint x = 0;\n\t\tint j = i * i;\n\n\t\twhile (j)//进行进制转换的操作 \n\t\t{\n\t\t\ta[++x] = j % n;\n\t\t\tj = j / n;\n\t\t}\n\n\t\tbool o = true;//定义bool函数\n\t\tfor (int k = 1; k <= x / 2; k++) //判断是否为回文 \n\t\t\tif (a[k] != a[x - k + 1])\n\t\t\t\to = false;\n\t\tif (o)//为回文shu\n\t\t{\n\t\t\tj = i;\n\t\t\tint op = 0;\n\t\t\twhile (j) //进制转换 \n\t\t\t{\n\t\t\t\tb[++op] = j % n;\n\t\t\t\tj = j / n;\n\t\t\t}\n\t\t\t\n\t\t\t\n\t\t\tfor (int l = op; l > 0; l--)\n\t\t\t\tif (b[l] >= 10)\n\t\t\t\t\tprintf(\""%c\"", (char)(b[l] + 'A' - 10));\n\t\t\telse\n\t\t\t\tprintf(\""%d\"", b[l]);\n\t\t\tprintf(\"" \"");\n\t\t\t\n\t\t\t\n\t\t\tfor (int l = x; l > 0; l--)\n\t\t\t\tif (a[l] >= 10)\n\t\t\t\t\tprintf(\""%c\"", (char)(a[l] + 'A' - 10));\n\t\t\telse\n\t\t\t\tprintf(\""%d\"", a[l]);\n\t\t\tprintf(\""\\n\"");\n\t\t}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1278613680529268736,bd23feb70f31c39d44f8632991273351b7ada8a16cc217a7026b9a98a9d21bf7,2020-07-02 16:57:11,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<fstream>\nusing namespace std;\nint arr[32];\nbool legal(int num)\n{\n    int times = 0;\n    for (int n = 2; n <= 10; n++)\n    {\n        int p = 0, x = num;\n        x = num;\n        while (x)\n        {\n            p++;\n            arr[p] = x % n;\n            x = x / n;\n        }\n        for (int j = 1; j <= p; j++)\n        {\n            if(arr[j] == arr[p - j + 1])\n            {\n                times++;\n            }\n        }\n        if (times > 1)\n        {\n            return true;\n        }\n    }\n    return false;\n}\n\nint main()\n{\n    int s, x;\n    cin >> x >> s;\n    for (int i = s + 1; x; i++)\n        if (legal(i))\n        {\n            cout << i << endl;\n            x--;\n        }\n    return 0;\n}",PARTIAL_ACCEPTED,35,484
1278613699336536064,4c0c1485fb193a1b54dc8aabc13e975e61dd8db3743718b879cd75060a30934e,2020-07-02 16:57:16,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n#include<string>\nint main()\n{\n\tint n;\n\n\tint a[99999], b[99999];\n\n\tscanf_s(\""%d\"", &n);\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\tint x = 0;\n\t\tint j = i * i;\n\n\t\twhile (j)//进行进制转换的操作 \n\t\t{\n\t\t\ta[++x] = j % n;\n\t\t\tj = j / n;\n\t\t}\n\n\t\tbool o = true;//定义bool函数\n\t\tfor (int k = 1; k <= x / 2; k++) //判断是否为回文 \n\t\t\tif (a[k] != a[x - k + 1])\n\t\t\t\to = false;\n\t\tif (o)//为回文shu\n\t\t{\n\t\t\tj = i;\n\t\t\tint op = 0;\n\t\t\twhile (j) //进制转换 \n\t\t\t{\n\t\t\t\tb[++op] = j % n;\n\t\t\t\tj = j / n;\n\t\t\t}\n\t\t\t\n\t\t\t\n\t\t\tfor (int l = op; l > 0; l--)\n\t\t\t\tif (b[l] >= 10)\n\t\t\t\t\tprintf(\""%c\"", (char)(b[l] + 'A' - 10));\n\t\t\telse\n\t\t\t\tprintf(\""%d\"", b[l]);\n\t\t\t\n\t\t\t\n\t\t\tfor (int l = x; l > 0; l--)\n\t\t\t\tif (a[l] >= 10)\n\t\t\t\t\tprintf(\""%c\"", (char)(a[l] + 'A' - 10));\n\t\t\telse\n\t\t\t\tprintf(\""%d\"", a[l]);\n\t\t\tprintf(\""\\n\"");\n\t\t}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1278613758853709824,4c0c1485fb193a1b54dc8aabc13e975e61dd8db3743718b879cd75060a30934e,2020-07-02 16:57:30,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n#include<string>\nint main()\n{\n\tint n;\n\n\tint a[99999], b[99999];\n\n\tscanf(\""%d\"", &n);\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\tint x = 0;\n\t\tint j = i * i;\n\n\t\twhile (j)//进行进制转换的操作 \n\t\t{\n\t\t\ta[++x] = j % n;\n\t\t\tj = j / n;\n\t\t}\n\n\t\tbool o = true;//定义bool函数\n\t\tfor (int k = 1; k <= x / 2; k++) //判断是否为回文 \n\t\t\tif (a[k] != a[x - k + 1])\n\t\t\t\to = false;\n\t\tif (o)//为回文shu\n\t\t{\n\t\t\tj = i;\n\t\t\tint op = 0;\n\t\t\twhile (j) //进制转换 \n\t\t\t{\n\t\t\t\tb[++op] = j % n;\n\t\t\t\tj = j / n;\n\t\t\t}\n\t\t\t\n\t\t\t\n\t\t\tfor (int l = op; l > 0; l--)\n\t\t\t\tif (b[l] >= 10)\n\t\t\t\t\tprintf(\""%c\"", (char)(b[l] + 'A' - 10));\n\t\t\telse\n\t\t\t\tprintf(\""%d\"", b[l]);\n\t\t\t\n\t\t\t\n\t\t\tfor (int l = x; l > 0; l--)\n\t\t\t\tif (a[l] >= 10)\n\t\t\t\t\tprintf(\""%c\"", (char)(a[l] + 'A' - 10));\n\t\t\telse\n\t\t\t\tprintf(\""%d\"", a[l]);\n\t\t\tprintf(\""\\n\"");\n\t\t}\n\t}\n\treturn 0;\n}",PRESENTATION_ERROR,32,384
1278614513799061504,4c0c1485fb193a1b54dc8aabc13e975e61dd8db3743718b879cd75060a30934e,2020-07-02 17:00:30,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n#include<string>\nint main()\n{\n\tint n;\n\n\tint a[99999], b[99999];\n\n\tscanf(\""%d\"", &n);\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\tint x = 0;\n\t\tint j = i * i;\n\n\t\twhile (j)//进行进制转换的操作 \n\t\t{\n\t\t\ta[++x] = j % n;\n\t\t\tj = j / n;\n\t\t}\n\n\t\tbool o = true;//定义bool函数\n\t\tfor (int k = 1; k <= x / 2; k++) //判断是否为回文 \n\t\t\tif (a[k] != a[x - k + 1])\n\t\t\t\to = false;\n\t\tif (o)//为回文shu\n\t\t{\n\t\t\tj = i;\n\t\t\tint op = 0;\n\t\t\twhile (j) //进制转换 \n\t\t\t{\n\t\t\t\tb[++op] = j % n;\n\t\t\t\tj = j / n;\n\t\t\t}\n\t\t\t\n\t\t\t\n\t\t\tfor (int l = op; l > 0; l--)\n\t\t\t{\n\t\t\t\tif (b[l] >= 10)\n\t\t\t\t\tprintf(\""%c\"", (char)(b[l] + 'A' - 10));\n\t\t\t\telse\n\t\t\t\t\tprintf(\""%d\"", b[l]);\n\t\t\t\t\n\t\t\t}\n\t\t\tprintf(\"" \"");\n\n\t\t\t\n\t\t\tfor (int l = x; l > 0; l--)\n\t\t\t\tif (a[l] >= 10)\n\t\t\t\t\tprintf(\""%c\"", (char)(a[l] + 'A' - 10));\n\t\t\telse\n\t\t\t\tprintf(\""%d\"", a[l]);\n\t\t\tprintf(\""\\n\"");\n\t\t}\n\t}\n\treturn 0;\n}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1278614527329894400,8d418e97079b1446d46d1a9480943f8e522168ae5c37e784dde26739102d2a1a,2020-07-02 17:00:33,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"//回文平方数\n#include <iostream>\n\nusing std::cin;\nusing std::cout;\nusing std::endl;\nint ch1[30000], ch2[30000];\nint account1 = 0;\nint account2 = 0;\n\n\nint main()\n{\n    int B;\n    cin >> B;   //B进制,用十进制数表示,2<=B<=20\n    for (int i = 1; i <= 300; i++)\n    {\n        int m = i;\n        while (m)\n        {\n            ch1[account1] = m % B;\n            account1++;\n        }\n        m = i * i;\n        while (m)\n        {\n            ch2[account2] = m % B;\n            account2++;\n        }\n        int judge = 1;\n        for (int i = 0, j = account2 - 1; i < account2, j >= 0; i++, j--)\n            if (ch2[i] != ch2[j])\n            {\n                judge = 0;\n                break;\n            }\n        if (judge)\n        {\n            for (int i = account1 - 1; i >= 0; i--)\n                if (ch1[i] < 10)\n                    cout << ch1[i];\n                else\n                    cout << (char)ch1[i];\n            cout << \"" \"";\n            for (int j = account2 - 1; j >= 0; j--)\n                if (ch2[j] < 10)\n                    cout << ch2[j];\n                else\n                    cout << (char)ch2[j];\n        }\n    }\n\n    return 0;\n}",SEGMENTATION_FAULT,45,740
1278614537320718336,4c0c1485fb193a1b54dc8aabc13e975e61dd8db3743718b879cd75060a30934e,2020-07-02 17:00:35,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n#include<string>\nint main()\n{\n\tint n;\n\n\tint a[99999], b[99999];\n\n\tscanf(\""%d\"", &n);\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\tint x = 0;\n\t\tint j = i * i;\n\n\t\twhile (j)//进行进制转换的操作 \n\t\t{\n\t\t\ta[++x] = j % n;\n\t\t\tj = j / n;\n\t\t}\n\n\t\tbool o = true;//定义bool函数\n\t\tfor (int k = 1; k <= x / 2; k++) //判断是否为回文 \n\t\t\tif (a[k] != a[x - k + 1])\n\t\t\t\to = false;\n\t\tif (o)//为回文shu\n\t\t{\n\t\t\tj = i;\n\t\t\tint op = 0;\n\t\t\twhile (j) //进制转换 \n\t\t\t{\n\t\t\t\tb[++op] = j % n;\n\t\t\t\tj = j / n;\n\t\t\t}\n\t\t\t\n\t\t\t\n\t\t\tfor (int l = op; l > 0; l--)\n\t\t\t{\n\t\t\t\tif (b[l] >= 10)\n\t\t\t\t\tprintf(\""%c\"", (char)(b[l] + 'A' - 10));\n\t\t\t\telse\n\t\t\t\t\tprintf(\""%d\"", b[l]);\n\t\t\t\t\n\t\t\t}\n\t\t\tprintf(\"" \"");\n\n\t\t\t\n\t\t\tfor (int l = x; l > 0; l--)\n\t\t\t\tif (a[l] >= 10)\n\t\t\t\t\tprintf(\""%c\"", (char)(a[l] + 'A' - 10));\n\t\t\telse\n\t\t\t\tprintf(\""%d\"", a[l]);\n\t\t\tprintf(\""\\n\"");\n\t\t}\n\t}\n\treturn 0;\n}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1278614617406767104,4c0c1485fb193a1b54dc8aabc13e975e61dd8db3743718b879cd75060a30934e,2020-07-02 17:00:54,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n#include<string>\nint main()\n{\n\tint n;\n\n\tint a[99999], b[99999];\n\n\tscanf(\""%d\"", &n);\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\tint x = 0;\n\t\tint j = i * i;\n\n\t\twhile (j)//进行进制转换的操作 \n\t\t{\n\t\t\ta[++x] = j % n;\n\t\t\tj = j / n;\n\t\t}\n\n\t\tbool o = true;//定义bool函数\n\t\tfor (int k = 1; k <= x / 2; k++) //判断是否为回文 \n\t\t\tif (a[k] != a[x - k + 1])\n\t\t\t\to = false;\n\t\tif (o)//为回文shu\n\t\t{\n\t\t\tj = i;\n\t\t\tint op = 0;\n\t\t\twhile (j) //进制转换 \n\t\t\t{\n\t\t\t\tb[++op] = j % n;\n\t\t\t\tj = j / n;\n\t\t\t}\n\t\t\t\n\t\t\t\n\t\t\tfor (int l = op; l > 0; l--)\n\t\t\t{\n\t\t\t\tif (b[l] >= 10)\n\t\t\t\t\tprintf(\""%c\"", (char)(b[l] + 'A' - 10));\n\t\t\t\telse\n\t\t\t\t\tprintf(\""%d\"", b[l]);\n\t\t\t\t\n\t\t\t}\n\t\t\tprintf(\"" \"");\n\n\t\t\t\n\t\t\tfor (int l = x; l > 0; l--)\n\t\t\t\tif (a[l] >= 10)\n\t\t\t\t\tprintf(\""%c\"", (char)(a[l] + 'A' - 10));\n\t\t\telse\n\t\t\t\tprintf(\""%d\"", a[l]);\n\t\t\tprintf(\""\\n\"");\n\t\t}\n\t}\n\treturn 0;\n}\n",ACCEPTED,35,360
1278614775670431744,ef047e53b7cdc1d9bf3a3dc040a6135dd420882c3888bc6a42d4f009197a6a98,2020-07-02 17:01:32,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nconst char s[21] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\nchar result[1000];\nint main()\n{\n\tint B;\n\tcin >> B;\n\tfor (int n = 0; n <= 300; n++)\n\t{\n\t\tint i = 0;\n\t\tint temp = n * n;\n\t\twhile (temp)\n\t\t{\n\t\t\tresult[i] = s[temp%B];\n\t\t\ttemp = temp / B;\n\t\t\ti++;\n\t\t}\n\t\tresult[i] = '\\0';\n\t\tint a = 1;\n\t\tfor (int j = 0, k = i - 1; j <= k; j++, k--)\n\t\t{\n\t\t\tif (result[j] == result[k])\n\t\t\t\tcontinue;\n\t\t\telse\n\t\t\t\ta = -1;\n\t\t}\n\t\tif (a == 1)\n\t\t{\n\t\t\tcout << n << ' ';\n\t\t\tfor (int j = 0; j < i; j++)\n\t\t\t\tcout << result[j];\n\t\t\tputchar(10);\n\t\t}\n\t}\n\treturn 0;\n}",WRONG_ANSWER,32,500
1278614804044906496,6f835599bf3a6c8ff0fc421d97258ed6c0eb7de523508a721d1a55bf4d845efb,2020-07-02 17:01:39,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint N,S;\nint n = 0;\n\nbool panding(int x,int i)//判定i进制时，是不是回文数\n{\n    int y;\n    int a = 0;\n    y = x;\n    while (y > 0)\n    {\n        a = a * i + y % i;\n        y /= i;\n    }\n    if (a == x)\n        return true;\n    else\n        return false;\n}\n\n\nint main()\n{\n\tcin >> N>>S;\n\t\n\tfor (int i = S+1; ; i++)\n\t{\n        int sum = 0;\n       \n        for (int j = 2; j <= 10; j++)\n        {\n            if (panding(i, j))\n            {\n                sum = sum + 1;\n            }\n        }\n        if (sum >= 2)\n        {\n            n = n + 1;\n            cout << i << endl;\n        }\n        if (n > N)\n            break;\n\t}\n    return 0;\n}",WRONG_ANSWER,36,484
1278615332581736448,6f835599bf3a6c8ff0fc421d97258ed6c0eb7de523508a721d1a55bf4d845efb,2020-07-02 17:03:45,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint N,S;\nint n = 0;\n\nbool panding(int x,int i)//判定i进制时，是不是回文数\n{\n    int y;\n    int a = 0;\n    y = x;\n    while (y > 0)\n    {\n        a = a * i + y % i;\n        y /= i;\n    }\n    if (a == x)\n        return true;\n    else\n        return false;\n}\n\n\nint main()\n{\n\tcin >> N>>S;\n\t\n\tfor (int i = S+1; ; i++)\n\t{\n        int sum = 0;\n       \n        for (int j = 2; j <= 10; j++)\n        {\n            if (panding(i, j))\n            {\n                sum = sum + 1;\n            }\n        }\n        if (sum >= 2)\n        {\n            n = n + 1;\n            cout << i << endl;\n        }\n        if (n > N-1)\n            break;\n\t}\n    return 0;\n}",ACCEPTED,32,384
1278615359408496640,ef047e53b7cdc1d9bf3a3dc040a6135dd420882c3888bc6a42d4f009197a6a98,2020-07-02 17:03:51,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nconst char s[21] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\nchar result[1000];\nint main()\n{\n\tint B;\n\tcin >> B;\n\tfor (int n = 1; n <= 300; n++)\n\t{\n\t\tint i = 0;\n\t\tint temp = n * n;\n\t\twhile (temp)\n\t\t{\n\t\t\tresult[i] = s[temp%B];\n\t\t\ttemp = temp / B;\n\t\t\ti++;\n\t\t}\n\t\tresult[i] = '\\0';\n\t\tint a = 1;\n\t\tfor (int j = 0, k = i - 1; j <= k; j++, k--)\n\t\t{\n\t\t\tif (result[j] == result[k])\n\t\t\t\tcontinue;\n\t\t\telse\n\t\t\t\ta = -1;\n\t\t}\n\t\tif (a == 1)\n\t\t{\n\t\t\tcout << n << ' ';\n\t\t\tfor (int j = 0; j < i; j++)\n\t\t\t\tcout << result[j];\n\t\t\tputchar(10);\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,37,512
1278615445337202688,ef047e53b7cdc1d9bf3a3dc040a6135dd420882c3888bc6a42d4f009197a6a98,2020-07-02 17:04:12,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nconst char s[21] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\nchar result[10000];\nint main()\n{\n\tint B;\n\tcin >> B;\n\tfor (int n = 1; n <= 300; n++)\n\t{\n\t\tint i = 0;\n\t\tint temp = n * n;\n\t\twhile (temp)\n\t\t{\n\t\t\tresult[i] = s[temp%B];\n\t\t\ttemp = temp / B;\n\t\t\ti++;\n\t\t}\n\t\tresult[i] = '\\0';\n\t\tint a = 1;\n\t\tfor (int j = 0, k = i - 1; j <= k; j++, k--)\n\t\t{\n\t\t\tif (result[j] == result[k])\n\t\t\t\tcontinue;\n\t\t\telse\n\t\t\t\ta = -1;\n\t\t}\n\t\tif (a == 1)\n\t\t{\n\t\t\tcout << n << ' ';\n\t\t\tfor (int j = 0; j < i; j++)\n\t\t\t\tcout << result[j];\n\t\t\tputchar(10);\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,41,424
1278615548059910144,8d418e97079b1446d46d1a9480943f8e522168ae5c37e784dde26739102d2a1a,2020-07-02 17:04:36,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"//回文平方数\n#include <iostream>\n\nusing std::cin;\nusing std::cout;\nusing std::endl;\nint ch1[3001], ch2[3001];\nint account1 = 0;\nint account2 = 0;\n\n\nint main()\n{\n    int B;\n    cin >> B;   //B进制,用十进制数表示,2<=B<=20\n    for (int i = 1; i <= 300; i++)\n    {\n        int m = i;\n        while (m)\n        {\n            ch1[account1] = m % B;\n            account1++;\n        }\n        m = i * i;\n        while (m)\n        {\n            ch2[account2] = m % B;\n            account2++;\n        }\n        int judge = 1;\n        for (int i = 0, j = account2 - 1; i < account2, j >= 0; i++, j--)\n            if (ch2[i] != ch2[j])\n            {\n                judge = 0;\n                break;\n            }\n        if (judge)\n        {\n            for (int i = account1 - 1; i >= 0; i--)\n                if (ch1[i] < 10)\n                    cout << ch1[i];\n                else\n                    cout << (char)ch1[i];\n            cout << \"" \"";\n            for (int j = account2 - 1; j >= 0; j--)\n                if (ch2[j] < 10)\n                    cout << ch2[j];\n                else\n                    cout << (char)ch2[j];\n        }\n    }\n    account1 = 0;\n    account2 = 0;\n    return 0;\n}",SEGMENTATION_FAULT,39,424
1278616837007278080,4c0c1485fb193a1b54dc8aabc13e975e61dd8db3743718b879cd75060a30934e,2020-07-02 17:09:44,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n#include<string>\nint main()\n{\n\tint n;\n\n\tint a[99999], b[99999];\n\n\tscanf(\""%d\"", &n);\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\tint x = 0;\n\t\tint j = i * i;\n\n\t\twhile (j)//进行进制转换的操作 \n\t\t{\n\t\t\ta[++x] = j % n;\n\t\t\tj = j / n;\n\t\t}\n\n\t\tbool o = true;//定义bool函数\n\t\tfor (int k = 1; k <= x / 2; k++) //判断是否为回文 \n\t\t\tif (a[k] != a[x - k + 1])\n\t\t\t\to = false;\n\t\tif (o)//为回文shu\n\t\t{\n\t\t\tj = i;\n\t\t\tint op = 0;\n\t\t\twhile (j) //进制转换 \n\t\t\t{\n\t\t\t\tb[++op] = j % n;\n\t\t\t\tj = j / n;\n\t\t\t}\n\t\t\t\n\t\t\t\n\t\t\tfor (int l = op; l > 0; l--)\n\t\t\t{\n\t\t\t\tif (b[l] >= 10)\n\t\t\t\t\tprintf(\""%c\"", (char)(b[l] + 'A' - 10));//利用英文字母进行强制转换\n\t\t\t\telse\n\t\t\t\t\tprintf(\""%d\"", b[l]);\n\t\t\t\t\n\t\t\t}\n\t\t\tprintf(\"" \"");\n\n\t\t\t\n\t\t\tfor (int l = x; l > 0; l--)\n\t\t\t\tif (a[l] >= 10)\n\t\t\t\t\tprintf(\""%c\"", (char)(a[l] + 'A' - 10));\n\t\t\telse\n\t\t\t\tprintf(\""%d\"", a[l]);\n\t\t\tprintf(\""\\n\"");\n\t\t}\n\t}\n\treturn 0;\n}\n",ACCEPTED,23,416
1278617153794670592,70e39561c0bb1e7675e7020ef49ce4e301d959d602d726862851cee8fa69d5ed,2020-07-02 17:10:59,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<iostream>\n#include <string>\n#include <algorithm>\n#include <iomanip>\n#include<math.h>\n#include<cstring>\n\n\nusing namespace std;\n\nint weishu(int a, int b)\n{\n    int wei=0;\n    if(a!=0)\n    {\n        for(int i=0;i<20;i++)\n        {\n            if(a>=pow(b,i)&&a<pow(b,i+1))\n            {\n                wei=i+1;\n                break;\n            }\n        }\n    }\n    else\n    {\n        wei=1;\n    }\n    return wei;\n}\n\nint main()\n{\n    string zimu=\""ABCDEFGHIJ\"";\n    int a,start_num,ciweishu,count1,count2,all_num,now_num;\n    count1=count2=0;\n    cin>>all_num>>start_num;\n    int m,judge;\n    int huan[30];\n    int jieguo[all_num];\n    for(int i=0;i<all_num;i++)\n    {\n        jieguo[i]=33;\n    }\n    string zhuanhuanhou[30];\n    for(int c=start_num+1;;c++)\n    {\n\n        now_num=c;\n        a=c;\n        count2=0;\n        for(int b=2;b<11;b++)\n        {\n            judge=1;\n            m=weishu(a,b);\n            for(int i=0;i<m;i++)\n            {\n\n                ciweishu=(a-a%int(pow(b,m-i-1)))/pow(b,m-1-i);\n\n                huan[i]=ciweishu;\n                a-=ciweishu*pow(b,m-1-i);\n\n            }\n\n            for(int i=0;i<m;i++)\n                    {\n                        if(huan[i]>9)\n                        {\n                            zhuanhuanhou[i]=zimu[huan[i]-10];\n                        }\n                        else\n                        {\n                            zhuanhuanhou[i]=to_string(huan[i]);\n                        }\n                    }\n            for(int i=0;i<m;i++)\n                        {\n                            if(zhuanhuanhou[i]!=zhuanhuanhou[m-i-1])\n                            {\n                                judge=0;\n                                break;\n                            }\n                        }\n\n\n            if(judge==1)\n            {\n                count2+=1;\n            }\n            if(count2==2)\n            {\n\n                jieguo[count1]=now_num;\n                count1+=1;\n                break;\n            }\n        }\n        if(count1==all_num)\n        {\n            break;\n        }\n\n    }\n    for(int i=0;i<all_num;i++)\n    {\n        cout<<jieguo[i]<<endl;\n    }\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n    return 0;\n}\n",PARTIAL_ACCEPTED,35,452
1278617277526630400,70e39561c0bb1e7675e7020ef49ce4e301d959d602d726862851cee8fa69d5ed,2020-07-02 17:11:29,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<iostream>\n#include <string>\n#include <algorithm>\n#include <iomanip>\n#include<math.h>\n#include<cstring>\n\n\nusing namespace std;\n\nint weishu(int a, int b)\n{\n    int wei=0;\n    if(a!=0)\n    {\n        for(int i=0;i<20;i++)\n        {\n            if(a>=pow(b,i)&&a<pow(b,i+1))\n            {\n                wei=i+1;\n                break;\n            }\n        }\n    }\n    else\n    {\n        wei=1;\n    }\n    return wei;\n}\n\nint main()\n{\n    string zimu=\""ABCDEFGHIJ\"";\n    int a,start_num,ciweishu,count1,count2,all_num,now_num;\n    count1=count2=0;\n    cin>>all_num>>start_num;\n    int m,judge;\n    int huan[30];\n    int jieguo[all_num];\n    for(int i=0;i<all_num;i++)\n    {\n        jieguo[i]=33;\n    }\n    string zhuanhuanhou[30];\n    for(int c=start_num+1;;c++)\n    {\n\n        now_num=c;\n        a=c;\n        count2=0;\n        for(int b=2;b<11;b++)\n        {\n            judge=1;\n            m=weishu(a,b);\n            for(int i=0;i<m;i++)\n            {\n\n                ciweishu=(a-a%int(pow(b,m-i-1)))/pow(b,m-1-i);\n\n                huan[i]=ciweishu;\n                a-=ciweishu*pow(b,m-1-i);\n\n            }\n\n            for(int i=0;i<m;i++)\n                    {\n                        if(huan[i]>9)\n                        {\n                            zhuanhuanhou[i]=zimu[huan[i]-10];\n                        }\n                        else\n                        {\n                            zhuanhuanhou[i]=to_string(huan[i]);\n                        }\n                    }\n            for(int i=0;i<m;i++)\n                        {\n                            if(zhuanhuanhou[i]!=zhuanhuanhou[m-i-1])\n                            {\n                                judge=0;\n                                break;\n                            }\n                        }\n\n\n            if(judge==1)\n            {\n                count2+=1;\n            }\n            if(count2==3)\n            {\n\n                jieguo[count1]=now_num;\n                count1+=1;\n                break;\n            }\n        }\n        if(count1==all_num)\n        {\n            break;\n        }\n\n    }\n    for(int i=0;i<all_num;i++)\n    {\n        cout<<jieguo[i]<<endl;\n    }\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n    return 0;\n}\n",PARTIAL_ACCEPTED,42,640
1278618113346560000,8d418e97079b1446d46d1a9480943f8e522168ae5c37e784dde26739102d2a1a,2020-07-02 17:14:48,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"//回文平方数\n#include <iostream>\n\nusing std::cin;\nusing std::cout;\nusing std::endl;\nint ch1[300], ch2[300];\nint account1 = 0;\nint account2 = 0;\n\n\nint main()\n{\n    int B;\n    cin >> B;   //B进制,用十进制数表示,2<=B<=20\n    for (int i = 1; i <= 300; i++)\n    {\n        int m = i;\n        while (m)\n        {\n            ch1[account1] = m % B;\n            account1++;\n        }\n        m = i * i;\n        while (m)\n        {\n            ch2[account2] = m % B;\n            account2++;\n        }\n        int judge = 1;\n        for (int i = 0; i < account2; i++)\n            if (ch2[i] != ch2[account2 - 1 - i])\n            {\n                judge = 0;\n                break;\n            }\n        if (judge)\n        {\n            for (int i = account1 - 1; i >= 0; i--)\n                if (ch1[i] < 10)\n                    cout << ch1[i];\n                else\n                    cout << (char)ch1[i];\n            cout << \"" \"";\n            for (int j = account2 - 1; j >= 0; j--)\n                if (ch2[j] < 10)\n                    cout << ch2[j];\n                else\n                    cout << (char)ch2[j];\n        }\n    }\n    account1 = 0;\n    account2 = 0;\n    return 0;\n}",SEGMENTATION_FAULT,22,384
1278618172511412224,8d418e97079b1446d46d1a9480943f8e522168ae5c37e784dde26739102d2a1a,2020-07-02 17:15:02,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"//回文平方数\n#include <iostream>\n\nusing std::cin;\nusing std::cout;\nusing std::endl;\nint ch1[150], ch2[150];\nint account1 = 0;\nint account2 = 0;\n\n\nint main()\n{\n    int B;\n    cin >> B;   //B进制,用十进制数表示,2<=B<=20\n    for (int i = 1; i <= 300; i++)\n    {\n        int m = i;\n        while (m)\n        {\n            ch1[account1] = m % B;\n            account1++;\n        }\n        m = i * i;\n        while (m)\n        {\n            ch2[account2] = m % B;\n            account2++;\n        }\n        int judge = 1;\n        for (int i = 0; i < account2; i++)\n            if (ch2[i] != ch2[account2 - 1 - i])\n            {\n                judge = 0;\n                break;\n            }\n        if (judge)\n        {\n            for (int i = account1 - 1; i >= 0; i--)\n                if (ch1[i] < 10)\n                    cout << ch1[i];\n                else\n                    cout << (char)ch1[i];\n            cout << \"" \"";\n            for (int j = account2 - 1; j >= 0; j--)\n                if (ch2[j] < 10)\n                    cout << ch2[j];\n                else\n                    cout << (char)ch2[j];\n        }\n    }\n    account1 = 0;\n    account2 = 0;\n    return 0;\n}",SEGMENTATION_FAULT,33,384
1278618238659780608,8d418e97079b1446d46d1a9480943f8e522168ae5c37e784dde26739102d2a1a,2020-07-02 17:15:18,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"//回文平方数\n#include <iostream>\n\nusing std::cin;\nusing std::cout;\nusing std::endl;\nint ch1[100], ch2[100];\nint account1 = 0;\nint account2 = 0;\n\n\nint main()\n{\n    int B;\n    cin >> B;   //B进制,用十进制数表示,2<=B<=20\n    for (int i = 1; i <= 300; i++)\n    {\n        int m = i;\n        while (m)\n        {\n            ch1[account1] = m % B;\n            account1++;\n        }\n        m = i * i;\n        while (m)\n        {\n            ch2[account2] = m % B;\n            account2++;\n        }\n        int judge = 1;\n        for (int i = 0; i < account2; i++)\n            if (ch2[i] != ch2[account2 - 1 - i])\n            {\n                judge = 0;\n                break;\n            }\n        if (judge)\n        {\n            for (int i = account1 - 1; i >= 0; i--)\n                if (ch1[i] < 10)\n                    cout << ch1[i];\n                else\n                    cout << (char)ch1[i];\n            cout << \"" \"";\n            for (int j = account2 - 1; j >= 0; j--)\n                if (ch2[j] < 10)\n                    cout << ch2[j];\n                else\n                    cout << (char)ch2[j];\n        }\n    }\n    account1 = 0;\n    account2 = 0;\n    return 0;\n}",SEGMENTATION_FAULT,40,384
1278618921547005952,ef047e53b7cdc1d9bf3a3dc040a6135dd420882c3888bc6a42d4f009197a6a98,2020-07-02 17:18:01,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nconst char s[21] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\nchar result1[100];\nchar result2[1000];\nint main()\n{\n\tint B;\n\tcin >> B;\n\tfor (int n = 1; n <= 300; n++)\n\t{\n\t\tint i = 0;\n\t\tint temp1 = n * n;\n\t\twhile (temp1)\n\t\t{\n\t\t\tresult2[i] = s[temp1%B];\n\t\t\ttemp1 = temp1 / B;\n\t\t\ti++;\n\t\t}\n\t\tresult2[i] = '\\0';\n\t\tint a = 1;\n\t\tfor (int j = 0, k = i - 1; j <= k; j++, k--)\n\t\t{\n\t\t\tif (result2[j] == result2[k])\n\t\t\t\tcontinue;\n\t\t\telse\n\t\t\t\ta = -1;\n\t\t}\n\t\tif (a == 1)\n\t\t{\n\t\t\tint temp2 = n;\n\t\t\tint ii = 0;\n\t\t\twhile (temp2)\n\t\t\t{\n\t\t\t\tresult1[ii] = s[temp2%B];\n\t\t\t\ttemp2 = temp2 / B;\n\t\t\t\tii++;\n\t\t\t}\n\t\t\tresult1[ii] = '\\0';\n\t\t\tfor (int k = 0; k < ii; k++)\n\t\t\t\tcout << result1[k];\n\t\t\tcout << ' ';\n\t\t\tfor (int j = 0; j < i; j++)\n\t\t\t\tcout << result2[j];\n\t\t\tputchar(10);\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,41,384
1278619028514340864,ca250d8365628acf18ac37120bb365044845c5c9157bd0a8d584bb34585d4ae3,2020-07-02 17:18:26,C++,50.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\nchar a[20] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\nint main()\n{\n\tint n, s, amount=0;\n\tcin >> n>>s;\n\tint i = 11;\n\tfor (int i = s+1; amount < n; i++)\n\t{\n\t\tvector <char> two;\n\t\tvector <char> three;\n\t\tvector <char> four;\n\t\tvector <char> five;\n\t\tvector <char> six;\n\t\tvector <char> seven;\n\t\tvector <char> eight;\n\t\tvector <char> nine;\n\t\tvector <char> ten;\n\n\t\t\n\t\tint  i2 = i, i3 = i, i4 = i, i5 = i, i6 = i, i7 = i, i8 = i, i9 = i, i10 = i;\n\n\t\tint howmany = 0;\n\t\t\n\t\t\n\t\twhile (i2 != 0)\n\t\t{\n\t\t\tint j = i2 % 2;\n\t\t\ttwo.push_back(a[j]);\n\t\t\ti2 = i2 / 2;\n\t\t\t\n\t\t}\n        //判断回文\n\t\tbool flag = true;\n\t\tint l2 = two.size();\n\t\tfor (int j = 0; j < l2 / 2; j++)\n\t\t{\n\t\t\tif (two[j] != two[l2 - j - 1])\n\t\t\t{\n\t\t\t\tflag = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (flag == true)\n\t\t{\n\t\t\thowmany++;\n\t\t}\n\n\n\t\n\t\t\n\t\t\n\t\t\n\t\twhile (i3 != 0)\n\t\t{\n\t\t\tint j = i3 % 3;\n\t\t\tthree.push_back(a[j]);\n\t\t\ti3 = i3 / 3;\n\t\t}\n\t\t//判断回文\n\t\tflag = true;\n\t\tint l3 = three.size();\n\t\tfor (int j = 0; j < l3 / 2; j++)\n\t\t{\n\t\t\tif (three[j] != three[l3 - j - 1])\n\t\t\t{\n\t\t\t\tflag = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (flag == true)\n\t\t{\n\t\t\thowmany++;\n\t\t}\n\n\t\tif (howmany >= 2)\n\t\t{\n\t\t\tcout << i << endl;\n\t\t\tamount++;\n\t\t\tcontinue;\n\t\t}\n\n\n\n\n\n\t\twhile (i4 != 0)\n\t\t{\n\t\t\tint j = i4 % 4;\n\t\t\tfour.push_back(a[j]);\n\t\t\ti4 = i4 / 4;\n\t\t}\n\t\t//判断回文\n\t\tflag = true;\n\t\tint l4 = four.size();\n\t\tfor (int j = 0; j < l4 / 2; j++)\n\t\t{\n\t\t\tif (four[j] != four[l4 - j - 1])\n\t\t\t{\n\t\t\t\tflag = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (flag == true)\n\t\t{\n\t\t\thowmany++;\n\t\t\n\t\t}\n\t\tif (howmany >= 2)\n\t\t{\n\t\t\tcout << i <<endl;\n\t\t\tamount++;\n\t\t\tcontinue;\n\t\t}\n\t\n\n\n\n\n\t\twhile (i5 != 0)\n\t\t{\n\t\t\tint j = i5 % 5;\n\t\t\tfive.push_back(a[j]);\n\t\t\ti5 = i5 / 5;\n\t\t}\n\t\t//判断回文\n\t\t flag = true;\n\t\tint l5 = five.size();\n\t\tfor (int j = 0; j < l5 / 2; j++)\n\t\t{\n\t\t\tif (five[j] != five[l5 - j - 1])\n\t\t\t{\n\t\t\t\tflag = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (flag == true) howmany++;\n\t\tif (howmany >= 2)\n\t\t{\n\t\t\tcout << i <<endl;\n\t\t\tamount++;\n\t\t\tcontinue;\n\t\t}\n\n\n\n\n\t\twhile (i6 != 0)\n\t\t{\n\t\t\tint j = i6 % 6;\n\t\t\tsix.push_back(a[j]);\n\t\t\ti6 = i6 / 6;\n\t\t}\n\t\t//判断回文\n\t\tflag = true;\n\t\tint l6 = six.size();\n\t\tfor (int j = 0; j < l6 / 2; j++)\n\t\t{\n\t\t\tif (six[j] != six[l6 - j - 1])\n\t\t\t{\n\t\t\t\tflag = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (flag == true) howmany++;\n\t\tif (howmany >= 2)\n\t\t{\n\t\t\tcout << i <<endl;\n\t\t\tamount++;\n\t\t\tcontinue;\n\t\t}\n\n\n\n\n\n\t\twhile (i7 != 0)\n\t\t{\n\t\t\tint j = i7 % 7;\n\t\t\tseven.push_back(a[j]);\n\t\t\ti7 = i7 / 7;\n\t\t}\n\t\t//判断回文\n\t\tflag = true;\n\t\tint l7 = seven.size();\n\t\tfor (int j = 0; j < l7 / 2; j++)\n\t\t{\n\t\t\tif (seven[j] != seven[l7 - j - 1])\n\t\t\t{\n\t\t\t\tflag = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (flag == true) howmany++;\n\t\tif (howmany >= 2)\n\t\t{\n\t\t\tcout << i <<endl;\n\t\t\tamount++;\n\t\t\tcontinue;\n\t\t}\n\n\n\n\n\n\n\t\twhile (i8 != 0)\n\t\t{\n\t\t\tint j = i8 % 8;\n\t\t\teight.push_back(a[j]);\n\t\t\ti8 = i8 / 8;\n\t\t}\n\t\t//判断回文\n\t\tflag = true;\n\t\tint l8 = eight.size();\n\t\tfor (int j = 0; j < l8 / 2; j++)\n\t\t{\n\t\t\tif (eight[j] != eight[l8 - j - 1])\n\t\t\t{\n\t\t\t\tflag = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (flag == true) howmany++;\n\t\tif (howmany >= 2)\n\t\t{\n\t\t\tcout << i <<endl;\n\t\t\tamount++;\n\t\t\tcontinue;\n\t\t}\n\n\n\n\n\t\twhile (i9 != 0)\n\t\t{\n\t\t\tint j = i9 % 9;\n\t\t\tnine.push_back(a[j]);\n\t\t\ti9 = i9 / 9;\n\t\t}\n\t\t//判断回文\n\t\tflag = true;\n\t\tint l9 = nine.size();\n\t\tfor (int j = 0; j < l9 / 2; j++)\n\t\t{\n\t\t\tif (nine[j] != nine[l9 - j - 1])\n\t\t\t{\n\t\t\t\tflag = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (flag == true) howmany++;\n\t\tif (howmany >= 2)\n\t\t{\n\t\t\tcout << i <<endl;\n\t\t\tamount++;\n\t\t\tcontinue;\n\t\t}\n\n\n\n\n\t\twhile (i10 != 0)\n\t\t{\n\t\t\tint j = i10 % 10;\n\t\t\tten.push_back(a[j]);\n\t\t\ti10 = i10 / n;\n\t\t}\n\t\t//判断回文\n\t\tflag = true;\n\t\tint l10 = ten.size();\n\t\tfor (int j = 0; j < l10 / 2; j++)\n\t\t{\n\t\t\tif (ten[j] != ten[l10 - j - 1])\n\t\t\t{\n\t\t\t\tflag = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (flag == true) howmany++;\n\t\tif (howmany >= 2)\n\t\t{\n\t\t\tcout << i <<endl;\n\t\t\tamount++;\n\t\t\tcontinue;\n\t\t}\n\n\n\n}\n\t\n\t\n}",PARTIAL_ACCEPTED,29,384
1278619170172764160,8d418e97079b1446d46d1a9480943f8e522168ae5c37e784dde26739102d2a1a,2020-07-02 17:19:00,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"//回文平方数\n#include <iostream>\n\nusing std::cin;\nusing std::cout;\nusing std::endl;\nint ch1[100], ch2[100];\nint account1 = 0;\nint account2 = 0;\n\n\nint main()\n{\n    int B;\n    cin >> B;   //B进制,用十进制数表示,2<=B<=20\n    for (int i = 1; i <= 300; i++)\n    {\n        int m = i;\n        while (m)\n        {\n            ch1[account1] = m % B;\n            account1++;\n            m = m / B;\n        }\n        m = i * i;\n        while (m)\n        {\n            ch2[account2] = m % B;\n            account2++;\n            m = m / B;\n        }\n        int judge = 1;\n        for (int i = 0; i < account2; i++)\n            if (ch2[i] != ch2[account2 - 1 - i])\n            {\n                judge = 0;\n                break;\n            }\n        if (judge)\n        {\n            for (int i = account1 - 1; i >= 0; i--)\n                if (ch1[i] < 10)\n                    cout << ch1[i];\n                else\n                    cout << (char)ch1[i];\n            cout << \"" \"";\n            for (int j = account2 - 1; j >= 0; j--)\n                if (ch2[j] < 10)\n                    cout << ch2[j];\n                else\n                    cout << (char)ch2[j];\n        }\n    }\n    account1 = 0;\n    account2 = 0;\n    return 0;\n}",SEGMENTATION_FAULT,28,384
1278619534666162176,ef047e53b7cdc1d9bf3a3dc040a6135dd420882c3888bc6a42d4f009197a6a98,2020-07-02 17:20:27,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nconst char s[21] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\nchar result1[100];\nchar result2[1000];\nint main()\n{\n\tint B;\n\tcin >> B;\n\tfor (int n = 1; n <= 300; n++)\n\t{\n\t\tint i = 0;\n\t\tint temp1 = n * n;\n\t\twhile (temp1)\n\t\t{\n\t\t\tresult2[i] = s[temp1%B];\n\t\t\ttemp1 = temp1 / B;\n\t\t\ti++;\n\t\t}\n\t\tresult2[i] = '\\0';\n\t\tint a = 1;\n\t\tfor (int j = 0, k = i - 1; j <= k; j++, k--)\n\t\t{\n\t\t\tif (result2[j] == result2[k])\n\t\t\t\tcontinue;\n\t\t\telse\n\t\t\t\ta = -1;\n\t\t}\n\t\tif (a == 1)\n\t\t{\n\t\t\tint temp2 = n;\n\t\t\tint ii = 0;\n\t\t\twhile (temp2)\n\t\t\t{\n\t\t\t\tresult1[ii] = s[temp2%B];\n\t\t\t\ttemp2 = temp2 / B;\n\t\t\t\tii++;\n\t\t\t}\n\t\t\tresult1[ii] = '\\0';\n\t\t\tfor (int k = ii-1; k >=0; k++)\n\t\t\t\tcout << result1[k];\n\t\t\tcout << ' ';\n\t\t\tfor (int j = 0; j < i; j++)\n\t\t\t\tcout << result2[j];\n\t\t\tputchar(10);\n\t\t}\n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,43,540
1278619589317943296,ef047e53b7cdc1d9bf3a3dc040a6135dd420882c3888bc6a42d4f009197a6a98,2020-07-02 17:20:40,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nconst char s[21] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\nchar result1[100];\nchar result2[1000];\nint main()\n{\n\tint B;\n\tcin >> B;\n\tfor (int n = 1; n <= 300; n++)\n\t{\n\t\tint i = 0;\n\t\tint temp1 = n * n;\n\t\twhile (temp1)\n\t\t{\n\t\t\tresult2[i] = s[temp1%B];\n\t\t\ttemp1 = temp1 / B;\n\t\t\ti++;\n\t\t}\n\t\tresult2[i] = '\\0';\n\t\tint a = 1;\n\t\tfor (int j = 0, k = i - 1; j <= k; j++, k--)\n\t\t{\n\t\t\tif (result2[j] == result2[k])\n\t\t\t\tcontinue;\n\t\t\telse\n\t\t\t\ta = -1;\n\t\t}\n\t\tif (a == 1)\n\t\t{\n\t\t\tint temp2 = n;\n\t\t\tint ii = 0;\n\t\t\twhile (temp2)\n\t\t\t{\n\t\t\t\tresult1[ii] = s[temp2%B];\n\t\t\t\ttemp2 = temp2 / B;\n\t\t\t\tii++;\n\t\t\t}\n\t\t\tresult1[ii] = '\\0';\n\t\t\tfor (int k = ii-1; k >= 0; k++)\n\t\t\t\tcout << result1[k];\n\t\t\tcout << ' ';\n\t\t\tfor (int j = 0; j < i; j++)\n\t\t\t\tcout << result2[j];\n\t\t\tputchar(10);\n\t\t}\n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,41,512
1278619765470330880,ef047e53b7cdc1d9bf3a3dc040a6135dd420882c3888bc6a42d4f009197a6a98,2020-07-02 17:21:22,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nconst char s[21] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\nchar result1[100];\nchar result2[1000];\nint main()\n{\n\tint B;\n\tcin >> B;\n\tfor (int n = 1; n <= 300; n++)\n\t{\n\t\tint i = 0;\n\t\tint temp1 = n * n;\n\t\twhile (temp1)\n\t\t{\n\t\t\tresult2[i] = s[temp1%B];\n\t\t\ttemp1 = temp1 / B;\n\t\t\ti++;\n\t\t}\n\t\tresult2[i] = '\\0';\n\t\tint a = 1;\n\t\tfor (int j = 0, k = i - 1; j <= k; j++, k--)\n\t\t{\n\t\t\tif (result2[j] == result2[k])\n\t\t\t\tcontinue;\n\t\t\telse\n\t\t\t\ta = -1;\n\t\t}\n\t\tif (a == 1)\n\t\t{\n\t\t\tint temp2 = n;\n\t\t\tint ii = 0;\n\t\t\twhile (temp2)\n\t\t\t{\n\t\t\t\tresult1[ii] = s[temp2%B];\n\t\t\t\ttemp2 = temp2 / B;\n\t\t\t\tii++;\n\t\t\t}\n\t\t\tresult1[ii] = '\\0';\n\t\t\tfor (int k = ii-1; k >= 0; k--)\n\t\t\t\tcout << result1[k];\n\t\t\tcout << ' ';\n\t\t\tfor (int j = 0; j < i; j++)\n\t\t\t\tcout << result2[j];\n\t\t\tputchar(10);\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,36,512
1278621376074670080,989a11d024c67cfa5499e5a2c66c4b5ade7a2ddae0e01870815d219983b30ddf,2020-07-02 17:27:46,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint b;\n\tcin >> b;\n\tint i, j, k; int num1; int num2[1000],num3[1000]; int g,h;\n\tfor (i = 1; i <= 300; i++)\n\t{\n\t\tnum1 = i*i;\n\t\tk = 1;\n\t\twhile (num1 > 0)\n\t\t{\n\t\t\tnum2[k] = num1%b;\n\t\t\tnum1 = num1 / b;\n\t\t\tk++;\n\t\t}\n\t\tk = k - 1;\n\t\tg = 1;\n\t\tfor (j = 1; j <= k; j++)\n\t\t{\n\t\t\tif (num2[j] != num2[1 + k - j]) { g = 0; break; }\n\t\t}\n\t\tif (g == 1) \n\t\t{\n\t\t\th = 1;\n\t\t\tnum1 = i;\n\t\t\twhile (num1 > 0)\n\t\t\t{\n\t\t\t\tnum3[h] = num1%b;\n\t\t\t\tnum1 = num1 / b;\n\t\t\t\th++;\n\t\t\t}\n\t\t\th = h - 1;\n\t\t\tfor (j = h; j >= 1; j--)\n\t\t\t{\n\t\t\t\tif (num3[j] > 9)cout << char(num3[j] + 55);\n\t\t\t\telse cout << num3[j];\n\t\t\t}\n\t\t\tcout << \"" \"";\n\t\t\tfor (j = 1; j <= k; j++)\n\t\t\t{\n\t\t\t\tif (num2[j] > 9)cout << char(num2[j] + 55);\n\t\t\t\telse cout << num2[j];\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,34,424
1278621752354078720,8d418e97079b1446d46d1a9480943f8e522168ae5c37e784dde26739102d2a1a,2020-07-02 17:29:16,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"//回文平方数\n#include <iostream>\n\nusing std::cin;\nusing std::cout;\nusing std::endl;\nint ch1[300], ch2[300];\nint account1 = 0;\nint account2 = 0;\n\nvoid change1(int m, int n);\nvoid change2(int m, int n);\nvoid judge();\nint main()\n{\n    int B;\n    cin >> B;   //B进制,用十进制数表示,2<=B<=20\n    for (int i = 1; i <= 300; i++)\n    {\n        change1(i, B);\n        change2(i * i, B);\n        judge();\n        account1 = 0;\n        account2 = 0;\n    }\n    return 0;\n}\n\nvoid change1(int m, int n)\n{\n    while (m)\n    {\n        ch1[account1] = m % n;\n        account1++;\n        m = m / n;\n    }\n}\n\nvoid change2(int m, int n)\n{\n    while (m)\n    {\n        ch2[account2] = m % n;\n        account2++;\n        m = m / n;\n    }\n}\n\nvoid judge()\n{\n    int judge = 1;\n    for (int i = 0; i < account2; i++)\n        if (ch2[i] != ch2[account2 - 1 - i])\n        {\n            judge = 0;\n            break;\n        }\n    if (judge)\n    {\n        for (int i = account1 - 1; i >= 0; i--)\n            if (ch1[i] < 10)\n                cout << ch1[i];\n            else\n                cout << (char)ch1[i];\n        cout << \"" \"";\n        for (int j = account2 - 1; j >= 0; j--)\n            if (ch2[j] < 10)\n                cout << ch2[j];\n            else\n                cout << (char)ch2[j];\n        cout << endl;\n    }\n}\n",PARTIAL_ACCEPTED,29,424
1278621839692070912,ca250d8365628acf18ac37120bb365044845c5c9157bd0a8d584bb34585d4ae3,2020-07-02 17:29:36,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\nchar a[20] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\nint main()\n{\n\tint n, s, amount=0;\n\tcin >> n>>s;\n\tint i = 11;\n\tfor (int i = s+1; amount < n; i++)\n\t{\n\t\tvector <char> two;\n\t\tvector <char> three;\n\t\tvector <char> four;\n\t\tvector <char> five;\n\t\tvector <char> six;\n\t\tvector <char> seven;\n\t\tvector <char> eight;\n\t\tvector <char> nine;\n\t\tvector <char> ten;\n\n\t\t\n\t\tint  i2 = i, i3 = i, i4 = i, i5 = i, i6 = i, i7 = i, i8 = i, i9 = i, i10 = i;\n\n\t\tint howmany = 0;\n\t\t\n\t\t\n\t\twhile (i2 != 0)\n\t\t{\n\t\t\tint j = i2 % 2;\n\t\t\ttwo.push_back(a[j]);\n\t\t\ti2 = i2 / 2;\n\t\t\t\n\t\t}\n        //判断回文\n\t\tbool flag = true;\n\t\tint l2 = two.size();\n\t\tfor (int j = 0; j < l2 / 2; j++)\n\t\t{\n\t\t\tif (two[j] != two[l2 - j - 1])\n\t\t\t{\n\t\t\t\tflag = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (flag == true)\n\t\t{\n\t\t\thowmany++;\n\t\t\t//cout << \""2\"" << \"" \"";\n\t\t}\n\n\n\t\n\t\t\n\t\t\n\t\t\n\t\twhile (i3 != 0)\n\t\t{\n\t\t\tint j = i3 % 3;\n\t\t\tthree.push_back(a[j]);\n\t\t\ti3 = i3 / 3;\n\t\t}\n\t\t//判断回文\n\t\tflag = true;\n\t\tint l3 = three.size();\n\t\tfor (int j = 0; j < l3 / 2; j++)\n\t\t{\n\t\t\tif (three[j] != three[l3 - j - 1])\n\t\t\t{\n\t\t\t\tflag = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (flag == true)\n\t\t{\n\t\t\thowmany++;\n\t\t\t//cout << \""3\"" << \"" \"";\n\t\t}\n\n\t\tif (howmany >= 2)\n\t\t{\n\t\t\tcout << i << endl;\n\t\t\tamount++;\n\t\t\tcontinue;\n\t\t}\n\n\n\n\n\n\t\twhile (i4 != 0)\n\t\t{\n\t\t\tint j = i4 % 4;\n\t\t\tfour.push_back(a[j]);\n\t\t\ti4 = i4 / 4;\n\t\t}\n\t\t//判断回文\n\t\tflag = true;\n\t\tint l4 = four.size();\n\t\tfor (int j = 0; j < l4 / 2; j++)\n\t\t{\n\t\t\tif (four[j] != four[l4 - j - 1])\n\t\t\t{\n\t\t\t\tflag = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (flag == true)\n\t\t{\n\t\t\thowmany++;\n\t\t\t//cout << \""4\"" << \"" \"";\n\t\t\n\t\t}\n\t\tif (howmany >= 2)\n\t\t{\n\t\t\tcout << i <<endl;\n\t\t\tamount++;\n\t\t\tcontinue;\n\t\t}\n\t\n\n\n\n\n\t\twhile (i5 != 0)\n\t\t{\n\t\t\tint j = i5 % 5;\n\t\t\tfive.push_back(a[j]);\n\t\t\ti5 = i5 / 5;\n\t\t}\n\t\t//判断回文\n\t\t flag = true;\n\t\tint l5 = five.size();\n\t\tfor (int j = 0; j < l5 / 2; j++)\n\t\t{\n\t\t\tif (five[j] != five[l5 - j - 1])\n\t\t\t{\n\t\t\t\tflag = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (flag == true)\n\t\t{\n\t\t\thowmany++;\n\t\t\t//cout << \""5\"" << \"" \"";\n\t\t}\n\t\tif (howmany >= 2)\n\t\t{\n\t\t\tcout << i <<endl;\n\t\t\tamount++;\n\t\t\tcontinue;\n\t\t}\n\n\n\n\n\t\twhile (i6 != 0)\n\t\t{\n\t\t\tint j = i6 % 6;\n\t\t\tsix.push_back(a[j]);\n\t\t\ti6 = i6 / 6;\n\t\t}\n\t\t//判断回文\n\t\tflag = true;\n\t\tint l6 = six.size();\n\t\tfor (int j = 0; j < l6 / 2; j++)\n\t\t{\n\t\t\tif (six[j] != six[l6 - j - 1])\n\t\t\t{\n\t\t\t\tflag = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (flag == true)\n\t\t{\n\t\t\thowmany++;\n\t\t\t//cout << \""6\"" << \"" \"";\n\t\t}\n\n\t\tif (howmany >= 2)\n\t\t{\n\t\t\tcout << i <<endl;\n\t\t\tamount++;\n\t\t\tcontinue;\n\t\t}\n\n\n\n\n\n\t\twhile (i7 != 0)\n\t\t{\n\t\t\tint j = i7 % 7;\n\t\t\tseven.push_back(a[j]);\n\t\t\ti7 = i7 / 7;\n\t\t}\n\t\t//判断回文\n\t\tflag = true;\n\t\tint l7 = seven.size();\n\t\tfor (int j = 0; j < l7 / 2; j++)\n\t\t{\n\t\t\tif (seven[j] != seven[l7 - j - 1])\n\t\t\t{\n\t\t\t\tflag = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (flag == true)\n\t\t{\n\t\t\thowmany++;\n\t\t\t//cout << \""7\"" << \"" \"";\n\t\t}\n\t\tif (howmany >= 2)\n\t\t{\n\t\t\tcout << i <<endl;\n\t\t\tamount++;\n\t\t\tcontinue;\n\t\t}\n\n\n\n\n\n\n\t\twhile (i8 != 0)\n\t\t{\n\t\t\tint j = i8 % 8;\n\t\t\teight.push_back(a[j]);\n\t\t\ti8 = i8 / 8;\n\t\t}\n\t\t//判断回文\n\t\tflag = true;\n\t\tint l8 = eight.size();\n\t\tfor (int j = 0; j < l8 / 2; j++)\n\t\t{\n\t\t\tif (eight[j] != eight[l8 - j - 1])\n\t\t\t{\n\t\t\t\tflag = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (flag == true)\n\t\t{\n\t\t\thowmany++;\n\t\t\t//cout << \""8\"" << \"" \"";\n\t\t}\n\t\tif (howmany >= 2)\n\t\t{\n\t\t\tcout << i <<endl;\n\t\t\tamount++;\n\t\t\tcontinue;\n\t\t}\n\n\n\n\n\t\twhile (i9 != 0)\n\t\t{\n\t\t\tint j = i9 % 9;\n\t\t\tnine.push_back(a[j]);\n\t\t\ti9 = i9 / 9;\n\t\t}\n\t\t//判断回文\n\t\tflag = true;\n\t\tint l9 = nine.size();\n\t\tfor (int j = 0; j < l9 / 2; j++)\n\t\t{\n\t\t\tif (nine[j] != nine[l9 - j - 1])\n\t\t\t{\n\t\t\t\tflag = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (flag == true)\n\t\t{\n\t\t\thowmany++;\n\t\t\t//cout << \""9\"" << \"" \"";\n\t\t}\n\t\tif (howmany >= 2)\n\t\t{\n\t\t\tcout << i <<endl;\n\t\t\tamount++;\n\t\t\tcontinue;\n\t\t}\n\n\n\n\n\t\twhile (i10 != 0)\n\t\t{\n\t\t\tint j = i10 % 10;\n\t\t\tten.push_back(a[j]);\n\t\t\ti10 = i10 / 10;\n\t\t}\n\t\t//判断回文\n\t\tflag = true;\n\t\tint l10 = ten.size();\n\t\tfor (int j = 0; j < l10 / 2; j++)\n\t\t{\n\t\t\tif (ten[j] != ten[l10 - j - 1])\n\t\t\t{\n\t\t\t\tflag = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (flag == true)\n\t\t{\n\t\t\thowmany++;\n\t\t\t//cout << \""10\"" << \"" \"";\n\t\t}\n\t\tif (howmany >= 2)\n\t\t{\n\t\t\tcout << i <<endl;\n\t\t\tamount++;\n\t\t\tcontinue;\n\t\t}\n\n\n\n}\n\t\n\t\n}",ACCEPTED,44,424
1278622380191055872,70e39561c0bb1e7675e7020ef49ce4e301d959d602d726862851cee8fa69d5ed,2020-07-02 17:31:45,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<iostream>\n#include <string>\n#include <algorithm>\n#include <iomanip>\n#include<math.h>\n#include<cstring>\n\n\nusing namespace std;\n\nint weishu(int a, int b)\n{\n    int wei=0;\n    if(a!=0)\n    {\n        for(int i=0;i<20;i++)\n        {\n            if(a>=pow(b,i)&&a<pow(b,i+1))\n            {\n                wei=i+1;\n                break;\n            }\n        }\n    }\n    else\n    {\n        wei=1;\n    }\n    return wei;\n}\n\nint main()\n{\n    string zimu=\""ABCDEFGHIJ\"";\n    int a,start_num,ciweishu,count1,count2,all_num,now_num;\n    count1=count2=0;\n    cin>>all_num>>start_num;\n    int m,judge;\n    int huan[30];\n    int jieguo[all_num];\n    for(int i=0;i<all_num;i++)\n    {\n        jieguo[i]=33;\n    }\n    string zhuanhuanhou[30];\n    for(int c=start_num+1;;c++)\n    {\n\n        now_num=c;\n\n        count2=0;\n        for(int b=2;b<11;b++)\n        {\n            a=c;\n            judge=1;\n            m=weishu(a,b);\n\n            for(int i=0;i<m;i++)\n            {\n\n                ciweishu=(a-a%int(pow(b,m-i-1)))/pow(b,m-1-i);\n\n                huan[i]=ciweishu;\n                a-=ciweishu*pow(b,m-1-i);\n\n            }\n\n            for(int i=0;i<m;i++)\n                    {\n                        if(huan[i]>9)\n                        {\n                            zhuanhuanhou[i]=zimu[huan[i]-10];\n                        }\n                        else\n                        {\n                            zhuanhuanhou[i]=to_string(huan[i]);\n                        }\n                    }\n            for(int i=0;i<m;i++)\n                        {\n                            if(zhuanhuanhou[i]!=zhuanhuanhou[m-i-1])\n                            {\n                                judge=0;\n                                break;\n                            }\n                        }\n\n\n            if(judge==1)\n            {\n                count2+=1;\n            }\n            if(count2==2)\n            {\n\n                jieguo[count1]=now_num;\n                count1+=1;\n                break;\n            }\n        }\n        if(count1==all_num)\n        {\n            break;\n        }\n\n    }\n    for(int i=0;i<all_num;i++)\n    {\n        cout<<jieguo[i]<<endl;\n    }\n\n\n\n\n\n\n    return 0;\n}\n",ACCEPTED,127,516
1278623694065164288,685d92e8c15d0ebd2875b6981da27f1f4ec039ee8163beabb74fb58572d473d4,2020-07-02 17:36:59,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<math.h>\n#include<iostream>\n#include <algorithm>\n#include<string>\nusing namespace std;\nint main() {\n\tint b , p , temp ;\n\tchar c;\n\tstring str , s;\n\tcin >> b;\n\tfor (int i = 1; i <= 300; i++) \n\t{\n\t\tp = i * i;\n\t\tstr = \""\"";\n\t\twhile (1)\n\t\t{\n\t\t\ttemp = p % b;\n\t\t\tif (temp > 9) \n\t\t\t\tc = (char)(temp + 55);\n\t\t\telse \n\t\t\t\tc = temp + '0';\n\t\t\tif ((p =p/ b) > 0) \n\t\t\t\tstr = c + str;\n\t\t\telse \n\t\t\t{\n\t\t\t\tstr = c + str;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\ts = str;\n\t\treverse(s.begin(), s.end());\n\t\tstring s1 = str;\n\t\tif (str == s) \n\t\t{\n\t\t\tstr = \""\"";\n\t\t\tint hahaha = i;\n\t\t\twhile (true) \n\t\t\t{\n\t\t\t\ttemp = hahaha % b;\n\t\t\t\tif (temp > 9)\n\t\t\t\t\tc = (char)(temp + 55);\n\t\t\t\telse \n\t\t\t\t\tc = temp + '0';\n\t\t\t\tif ((hahaha /= b) > 0)\n\t\t\t\t\tstr = c + str;\n\t\t\t\telse \n\t\t\t\t{\n\t\t\t\t\tstr = c + str;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout << str << \"" \"";\n\t\t\tcout << s1 << endl;\n\t\t}\n\t}\n\tsystem(\""pause\"");\n\treturn 0;\n}\n",ACCEPTED,46,552
1278625174042116096,685d92e8c15d0ebd2875b6981da27f1f4ec039ee8163beabb74fb58572d473d4,2020-07-02 17:42:51,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<math.h>\n#include<iostream>\n#include <algorithm>\n#include<string>\nusing namespace std;\nint main() {\n\tint b , p , temp ;\n\tchar c;\n\tstring str , s;\n\tcin >> b;\n\tfor (int i = 1; i <= 300; i++) \n\t{\n\t\tp = i * i;\n\t\tstr = \""\"";\n\t\twhile (1)\n\t\t{\n\t\t\ttemp = p % b;\n\t\t\tif (temp > 9) \n\t\t\t\tc = (char)(temp + 55);\n\t\t\telse \n\t\t\t\tc = temp + '0';\n\t\t\tif ((p =p/ b) > 0) \n\t\t\t\tstr = c + str;\n\t\t\telse \n\t\t\t{\n\t\t\t\tstr = c + str;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\ts = str;\n\t\treverse(s.begin(), s.end());\n\t\tstring s1 = str;\n\t\tif (str == s) \n\t\t{\n\t\t\tstr = \""\"";\n\t\t\tint h = i;\n\t\t\twhile (1) \n\t\t\t{\n\t\t\t\ttemp = h % b;\n\t\t\t\tif (temp > 9)\n\t\t\t\t\tc = (char)(temp + 55);\n\t\t\t\telse \n\t\t\t\t\tc = temp + '0';\n\t\t\t\tif ((h =h/ b) > 0)\n\t\t\t\t\tstr = c + str;\n\t\t\t\telse \n\t\t\t\t{\n\t\t\t\t\tstr = c + str;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout << str << \"" \"";\n\t\t\tcout << s1 << endl;\n\t\t}\n\t}\n\tsystem(\""pause\"");\n\treturn 0;\n}",ACCEPTED,33,552
1278628001565048832,8d418e97079b1446d46d1a9480943f8e522168ae5c37e784dde26739102d2a1a,2020-07-02 17:54:05,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"//回文平方数\n#include <iostream>\n\nusing std::cin;\nusing std::cout;\nusing std::endl;\nint ch1[300], ch2[300];\nint account1 = 0;\nint account2 = 0;\n\nvoid change1(int m, int n);\nvoid change2(int m, int n);\nvoid judge();\nint main()\n{\n    int B;\n    cin >> B;   //B进制,用十进制数表示,2<=B<=20\n    for (int i = 1; i <= 300; i++)\n    {\n        change1(i, B);\n        change2(i * i, B);\n        judge();\n        account1 = 0;\n        account2 = 0;\n    }\n    return 0;\n}\n\nvoid change1(int m, int n)\n{\n    while (m)\n    {\n        ch1[account1] = m % n;\n        account1++;\n        m = m / n;\n    }\n}\n\nvoid change2(int m, int n)\n{\n    while (m)\n    {\n        ch2[account2] = m % n;\n        account2++;\n        m = m / n;\n    }\n}\n\nvoid judge()\n{\n    int judge = 1;\n    for (int i = 0; i < account2; i++)\n        if (ch2[i] != ch2[account2 - 1 - i])\n        {\n            judge = 0;\n            break;\n        }\n    if (judge)\n    {\n        for (int i = account1 - 1; i >= 0; i--)\n            if (ch1[i] < 10)\n                cout << ch1[i];\n            else\n                cout << (char)(ch1[i] - 10 + 'A');\n        cout << \"" \"";\n        for (int j = account2 - 1; j >= 0; j--)\n            if (ch2[j] < 10)\n                cout << ch2[j];\n            else\n                cout << (char)(ch2[j] - 10 + 'A');\n        cout << endl;\n    }\n}\n",ACCEPTED,24,388
1278629477683232768,ef047e53b7cdc1d9bf3a3dc040a6135dd420882c3888bc6a42d4f009197a6a98,2020-07-02 17:59:57,C++,40.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nconst int MAX = 10000;\nconst char s[11]{ '0','1','2','3','4' ,'5' ,'6' ,'7' ,'8' ,'9' };\nchar result[1000];\nint main()\n{\n\tint N, S;\n\tint n = 0;    \n\tint x = 0;   \n\tcin >> N >> S;\n\tfor (; S < MAX; S++)    \n\t{\n\t\tx = 0;\n\t\tfor (int B = 2; B <= 10; B++)        \n\t\t{\n\t\t\tint temp = S;\n\t\t\tint i = 0;       \n\t\t\twhile (temp)\n\t\t\t{\n\t\t\t\tresult[i] = s[temp%B];\n\t\t\t\ttemp = temp / B;\n\t\t\t\ti++;\n\t\t\t}\n\t\t\tresult[i] = '\\0';\n\t\t\tint a = 1;         \n\t\t\tfor (int j = 0, k = i - 1; j <= k; j++, k--)\n\t\t\t{\n\t\t\t\tif (result[j] == result[k])\n\t\t\t\t\tcontinue;\n\t\t\t\telse\n\t\t\t\t\ta = -1;\n\t\t\t}\n\t\t\tif (a == 1)\n\t\t\t{\n\t\t\t\tx++;\n\t\t\t\tif (x < 2)\n\t\t\t\t\tcontinue;\n\t\t\t\telse\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (x >= 2)\n\t\t{\n\t\t\tn++;\n\t\t\tcout << S << endl;\n\t\t}\n\t\tif (n >= N)\n\t\t\tbreak;\n\t}\n\t\treturn 0;\n}",PARTIAL_ACCEPTED,27,424
1278630124566536192,ef047e53b7cdc1d9bf3a3dc040a6135dd420882c3888bc6a42d4f009197a6a98,2020-07-02 18:02:32,C++,50.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nconst int MAX = 10000;\nconst char s[11]{ '0','1','2','3','4' ,'5' ,'6' ,'7' ,'8' ,'9' };\nchar result[1000];\nint main()\n{\n\tint N, S;\n\tint n = 0;    \n\tint x = 0;   \n\tcin >> N >> S;\n\tfor (;; S++)    \n\t{\n\t\tx = 0;\n\t\tfor (int B = 2; B <= 10; B++)        \n\t\t{\n\t\t\tint temp = S;\n\t\t\tint i = 0;       \n\t\t\twhile (temp)\n\t\t\t{\n\t\t\t\tresult[i] = s[temp%B];\n\t\t\t\ttemp = temp / B;\n\t\t\t\ti++;\n\t\t\t}\n\t\t\tresult[i] = '\\0';\n\t\t\tint a = 1;         \n\t\t\tfor (int j = 0, k = i - 1; j <= k; j++, k--)\n\t\t\t{\n\t\t\t\tif (result[j] == result[k])\n\t\t\t\t\tcontinue;\n\t\t\t\telse\n\t\t\t\t\ta = -1;\n\t\t\t}\n\t\t\tif (a == 1)\n\t\t\t{\n\t\t\t\tx++;\n\t\t\t\tif (x < 2)\n\t\t\t\t\tcontinue;\n\t\t\t\telse\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (x >= 2)\n\t\t{\n\t\t\tn++;\n\t\t\tcout << S << endl;\n\t\t}\n\t\tif (n >= N)\n\t\t\tbreak;\n\t}\n\t\treturn 0;\n}",PARTIAL_ACCEPTED,49,384
1278630679741390848,ef047e53b7cdc1d9bf3a3dc040a6135dd420882c3888bc6a42d4f009197a6a98,2020-07-02 18:04:44,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nconst int MAX = 10000;\nconst char s[11]{ '0','1','2','3','4' ,'5' ,'6' ,'7' ,'8' ,'9' };\nchar result[1000];\nint main()\n{\n\tint N, S;\n\tint n = 0;    \n\tint x = 0;   \n\tcin >> N >> S;\n\tfor (;; S++)    \n\t{\n\t\tx = 0;\n\t\tfor (int B = 2; B <= 10; B++)        \n\t\t{\n\t\t\tint temp = S+1;\n\t\t\tint i = 0;       \n\t\t\twhile (temp)\n\t\t\t{\n\t\t\t\tresult[i] = s[temp%B];\n\t\t\t\ttemp = temp / B;\n\t\t\t\ti++;\n\t\t\t}\n\t\t\tresult[i] = '\\0';\n\t\t\tint a = 1;         \n\t\t\tfor (int j = 0, k = i - 1; j <= k; j++, k--)\n\t\t\t{\n\t\t\t\tif (result[j] == result[k])\n\t\t\t\t\tcontinue;\n\t\t\t\telse\n\t\t\t\t\ta = -1;\n\t\t\t}\n\t\t\tif (a == 1)\n\t\t\t{\n\t\t\t\tx++;\n\t\t\t\tif (x < 2)\n\t\t\t\t\tcontinue;\n\t\t\t\telse\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (x >= 2)\n\t\t{\n\t\t\tn++;\n\t\t\tcout << S+1 << endl;\n\t\t}\n\t\tif (n >= N)\n\t\t\tbreak;\n\t}\n\t\treturn 0;\n}",ACCEPTED,33,412
1278634869301641216,685d92e8c15d0ebd2875b6981da27f1f4ec039ee8163beabb74fb58572d473d4,2020-07-02 18:21:23,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include <algorithm>\n#include<math.h>\nusing namespace std;\nint main()\n{\n\tint n, s, count = 0, f = 0, temp = 0, g = 0;\n\tint h[15];\n\tchar c;\n\tcin >> n >> s;\n\tstring a1, a2;\n\tfor (int i = s + 1;; i++)\n\t{\n\t\tfor (int j = 2; j < 11; j++)\n\t\t{\n\t\t\twhile (1)\n\t\t\t{\n\t\t\t\ta1 = \""\"";\n\t\t\t\tint k = i;\n\t\t\t\ttemp = k % j;\n\t\t\t\tc = temp + '0';\n\t\t\t\tif ((k = k / j) > 0)\n\t\t\t\t\ta1 += c;\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\ta1 += c;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\ta2 = a1;\n\t\t\treverse(a2.begin(), a2.end());\n\t\t\tif (a2 == a1)\n\t\t\t\tf++;\n\t\t\tif (f == 2)\n\t\t\t{\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (count == n)\n\t\t\tbreak;\n\t}\n\tsystem(\""pause\"");\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,0,0
1278636305125138432,c718a5e15c13709ac252b40e283fb2aa1038ea11b52a4e636a057e3e1f4edac7,2020-07-02 18:27:05,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <string.h>\n#include <iostream>\nusing namespace std;\n\nint z , q = 0;\nint huiwen(int z){\n    int  i , j , Z , N , NN , k = 1 , g = 0;\n    string s[] = {\""0\""};\n    for(i = 10;i >= 2;i--)\n    {\n        Z = z;\n        for(N = 0;N++;)\n        {\n            if(Z > 0){\n                j = Z % i;\n                s[N] = \""j\"";\n                Z  = (Z - j) / i;\n            }\n            else{\n                break;\n            }\n        }\n\n        if(s[0] != \""0\""  && s[N - 1] != \""0\"")\n        {\n            NN = N - 1;\n            for(;N >= 1;N--)\n            {\n                if(s[NN - N + 1] == s[N - 1])\n                {\n                    k = 1;\n                }\n                else\n                {\n                    k = 0;\n                    break;\n                }\n            }\n\n            if(k == 1)\n            {\n               g += k;\n            }\n        }\n\n    }\n\n    if(g >= 2){\n        cout << z << endl;\n        q++;\n    }\n\n    return 0;\n}\n\nint main(){\n    int t , s;\n    cin >> t >> s;\n    for(int i = 1;;i++){\n        z = s + i;\n        huiwen(z);\n        if(q == t){\n            break;\n        }\n    }\n\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,0,0
1278636593814896640,c718a5e15c13709ac252b40e283fb2aa1038ea11b52a4e636a057e3e1f4edac7,2020-07-02 18:28:14,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <string.h>\n#include <iostream>\nusing namespace std;\n\nint z , q = 0;\nint huiwen(int z){\n    int  i , j , Z , N , NN , k = 1 , g = 0;\n    string s[] = {\""0\""};\n    for(i = 10;i >= 2;i--)\n    {\n        Z = z;\n        for(N = 0;N++;)\n        {\n            if(Z > 0){\n                j = Z % i;\n                s[N] = \""j\"";\n                Z  = (Z - j) / i;\n            }\n            else{\n                break;\n            }\n        }\n\n        if(s[0] != \""0\""  && s[N - 1] != \""0\"")\n        {\n            NN = N - 1;\n            for(;N >= 1;N--)\n            {\n                if(s[NN - N + 1] == s[N - 1])\n                {\n                    k = 1;\n                }\n                else\n                {\n                    k = 0;\n                    break;\n                }\n            }\n\n            if(k == 1)\n            {\n               g += k;\n            }\n        }\n        if(g >= 2){\n            cout << z << endl;\n            q++;\n            break;\n        }\n        \n    }\n\n    \n    return 0;\n}\n\nint main(){\n    int t , s;\n    cin >> t >> s;\n    for(int i = 1;;i++){\n        z = s + i;\n        huiwen(z);\n        if(q == t){\n            break;\n        }\n    }\n\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,0,0
1278636786824183808,870639b86c6ef9a7a2d08fc3941ed91e6f086b72233a9e951b8f688077d1b0fe,2020-07-02 18:29:00,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nchar c[]={'0','1','2','3','4','5','6','7','8','9'};\nvoid tran(int n,int B){\n    int r=0;\n    char num[10];\n    while(n!=0){\n        num[r]=c[n%B];\n        n=n/B;\n        r++;\n    }\n    for(int i=r-1;i>=0;i--){\n        cout<<num[i];\n    }\n}\n\nbool huiwen(int n,int b){\n    int r=0;\n    char num[20];\n    while(n!=0){\n        num[r]=c[n%b];\n        n=n/b;\n        r++;\n    }\n    for (int i=0;i<=r/2;i++){\n        if (num[i]!=num[r-1-i])\n            return false;\n    }\n    return true;\n}\n\nint main(){\n    int N,s;\n    cin>>N>>s;\n\n    int num=s+1,count=0,c=0;\n    while(c<N){\n        for(int k=2;k<=10;k++){\n            if(huiwen(num,k))\n                count++;\n            if(count==2){\n                cout<<num<<endl;\n                c++;\n                break;\n            }\n        }\n        count=0;\n        num++;\n    }\n\n}",ACCEPTED,20,424
1278638249495420928,bd23feb70f31c39d44f8632991273351b7ada8a16cc217a7026b9a98a9d21bf7,2020-07-02 18:34:49,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832," #include<iostream>\n#include<fstream>\nusing namespace std;\nint arr[32];\nbool legal(int num)\n{\n    int times = 0;\n    for (int n = 2; n <= 10; n++)\n    {\n        int p = 0;\n        int x = num;\n        while (x)\n        {\n            p++;\n            arr[p] = x % n;\n            x = x / n;\n        }\n        for (int j = 1; j <= p; j++)\n        {\n            if(arr[j] == arr[p - j + 1])\n            {\n                times++;\n            }\n        }\n        if (times <= 1)\n        {\n            return false;\n        }\n    }\n    return true;\n}\n\nint main()\n{\n    int s, x;\n    cin >> x >> s;\n    for (int i = s + 1; x; i++)\n        if (legal(i))\n        {\n            cout << i << endl;\n            x--;\n        }\n    return 0;\n}",WRONG_ANSWER,33,424
1278638332907552768,f31082d427a93a58b9a4029d36bf21b049ab69fed573c687789cf8faaa7d93ba,2020-07-02 18:35:09,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <vector>\nusing namespace std;\nint B;\n    vector<int> vec;\n    vector<int> vec2;\nbool isPalindrome(int x){\n    int i = 0;\n    while(x){\n        vec.push_back(x%B);\n        i++;\n        x/=B;\n    }\n    for(int j = 0; j<(i/2);j++){\n        if(vec[j]!=vec[i-1-j])\n            return 0;\n    }\n    return 1;\n}\n\nvoid trans(int x){\n    while(x){\n        vec2.push_back(x%B);\n        x/=B;\n    }\n    vector<int> vecRever2;\n    vector<int>::reverse_iterator riter2;\n    for (riter2=vec2.rbegin();riter2!=vec2.rend();riter2++)\n        {\n            vecRever2.push_back(*riter2);\n        }\n    for(unsigned int i = 0; i < vecRever2.size(); i++)\n        {\n            if((vecRever2[i]>=0)&&(vecRever2[i]<=9)){\n                cout<<vecRever2[i];\n            }\n            if((vecRever2[i]>9)){\n                cout<<char(vecRever2[i]-10+'A');\n            }\n        }\n}\nvoid print(){\n    vector<int> vecRever;\n    vector<int>::reverse_iterator riter;\n    for (riter=vec.rbegin();riter!=vec.rend();riter++)\n        {\n            vecRever.push_back(*riter);\n        }\n    for(unsigned int i = 0; i < vecRever.size(); i++)\n        {\n            if((vecRever[i]>=0)&&(vecRever[i]<=9)){\n                cout<<vecRever[i];\n            }\n            if((vecRever[i]>9)){\n                cout<<char(vecRever[i]-10+'A');\n            }\n        }\n\n}\nint main(){\n    cin>>B;\n    for(int i = 1; i<=300; i++){\n        if(isPalindrome(i*i)){\n           trans(i);\n           cout<<\"" \"";\n           print();\n           cout<<endl;\n        }\n        vec.clear();\n        vec2.clear();\n    }\n\n\n    return 0;\n}",ACCEPTED,40,512
1278638508384641024,bd23feb70f31c39d44f8632991273351b7ada8a16cc217a7026b9a98a9d21bf7,2020-07-02 18:35:51,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832," #include<iostream>\n#include<fstream>\nusing namespace std;\nint arr[32];\nbool legal(int num)\n{\n    int times = 0;\n    for (int n = 2; n <= 10; n++)\n    {\n        int p = 0;\n        int x = num;\n        while (x)\n        {\n            p++;\n            arr[p] = x % n;\n            x = x / n;\n        }\n        for (int j = 1; j <= p; j++)\n        {\n            if(arr[j] == arr[p - j + 1])\n            {\n                times++;\n            }\n        }\n        if (times <= 1)\n        {\n            return false;\n        }\n    }\n    return true;\n}\n\nint main()\n{\n    int s, x;\n    cin >> x >> s;\n    for (int i = s + 1; x; i++)\n        if (legal(i))\n        {\n            cout << i << endl;\n            x--;\n        }\n    return 0;\n}",WRONG_ANSWER,28,424
1278638855022895104,bd23feb70f31c39d44f8632991273351b7ada8a16cc217a7026b9a98a9d21bf7,2020-07-02 18:37:13,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<fstream>\nusing namespace std;\nint arr[32];\nbool legal(int num)\n{\n    int times = 0;\n    for (int n = 2; n <= 10; n++)\n    {\n        int p = 0;\n        int x = num;\n        while (x)\n        {\n            p++;\n            arr[p] = x % n;\n            x = x / n;\n        }\n        for (int j = 1; j <= p; j++)\n        {\n            if(arr[j] == arr[p - j + 1])\n            {\n                times++;\n            }\n        }\n        if (times > 1)\n        {\n            return true;\n        }\n    }\n    return false;\n}\n\nint main()\n{\n    int s, x;\n    cin >> x >> s;\n    for (int i = s + 1; x; i++)\n        if (legal(i))\n        {\n            cout << i << endl;\n            x--;\n        }\n    return 0;\n}",PARTIAL_ACCEPTED,35,496
1278639683410518016,76d9e837f48ae7608e335bc711b6261b6280f6c965f35f63af7b40f5f14509a1,2020-07-02 18:40:31,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm> \nusing namespace std;\n\nbool judge(const string a) \n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1]) \n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1) \n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring transfer(int a, int n)\n{\n    string ans = \""\"";\n    do {\n        int t = a % n;\n        if (t >= 0 && t <= 9)\t\n        {\n            ans += t + '0';\n        }\n        else \n        {\n            ans += t - 10 + 'A'; \n        }\n        a /= n;\n    } while (a != 0);\n    reverse(ans.begin(), ans.end());  \n    return ans;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    int j = 0;\n    for (int x = 1; x <= 300; x++)\n    {\n        j = x;\n        \n        string s1 = transfer(j, n);    \n        string s2 = transfer((j * j), n);\n\n        if (judge(s2))\n        {\n            cout << s1 << \"" \"" << s2 << endl;\n        }\n        else\n        {\n            continue;\n        }\n    }\n    return 0;\n}",ACCEPTED,45,492
1278643853962182656,76d9e837f48ae7608e335bc711b6261b6280f6c965f35f63af7b40f5f14509a1,2020-07-02 18:57:05,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\n\nbool judge(const string a) \n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1]) \n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1) \n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring transfer(int a, int n)\n{\n    string ans = \""\"";\n    do {\n        int t = a % n;\n        if (t >= 0 && t <= 9)\t\n        {\n            ans += t + '0';\n        }\n        else \n        {\n            ans += t - 10 + 'A'; \n        }\n        a /= n;\n    } while (a != 0);\n    reverse(ans.begin(), ans.end());  \n    return ans;\n}\n\n\n\nint main()\n{\n    int n, s;\n    cin >> n >> s;\n    s++; \n    vector<int> p;\n    int sum;\n    while ((p.size() < n)) \n    {\n        sum = 0;\n        for (int i = 2; i <= 10; i++)\n        {\n            if (judge(transfer(s, i))) \n            {\n                sum++;\n            }\n        }\n        if (sum >= 2) \n        {\n            p.push_back(s);\n        }\n        s++; \n    }\n    for (int i = 0; i < p.size(); i++)\n    {\n        cout << p[i] << endl;\n    }\n    return 0;\n}\n",ACCEPTED,36,512
1278649228249726976,f31082d427a93a58b9a4029d36bf21b049ab69fed573c687789cf8faaa7d93ba,2020-07-02 19:18:26,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <vector>\nusing namespace std;\n\nbool isPalindrome(int x,int B){\n    vector<int> vec;\n    int i = 0;\n    while(x){\n        vec.push_back(x%B);\n        i++;\n        x/=B;\n    }\n    for(int j = 0; j<(i/2);j++){\n        if(vec[j]!=vec[i-1-j])\n            return 0;\n    }\n    return 1;\n}\n\nint main()\n{\n    int n,begin;\n    cin>>n>>begin;\n    int cnt =0;\n    for(int i = begin+1;;i++){\n        int cnt2 =0 ;\n        for(int j = 2;j<=10&&cnt2<2;j++){\n            if(isPalindrome(i,j))\n                cnt2++;\n        }\n        if(cnt2>=2){\n            cout<<i<<endl;\n            cnt++;\n        }\n        if (cnt>=n)\n            break;\n    }\n    return 0;\n}\n",ACCEPTED,47,512
1278667803706449920,2fb86982d1a92c7b4708937570a5a78ec2d3419e29352cf7fce03584a8a25795,2020-07-02 20:32:15,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstdio>\n#include<cstdlib>\nusing namespace std;\nint n;\nint s[301];\nvoid jz(int a,int b)//转换进制 \n{\n    int r=0;\n    while(a){\n        s[++r]=a%b;\n        a/=b;\n    }\n    s[0]=r;\n}\nbool change(){//判断s[i]与s[s[0]+1-i]是否相等\n    for(int i=1;i<=s[0];i++)\n\t{\n    \tif(s[i]!=s[s[0]+1-i]) return false;\n    }\n    return true;\n}\nvoid print(){//打印 \n    for(int i=s[0];i>=1;i--)\n\t{\n        if(s[i]<=9) cout<<s[i];\n        else cout<<(char)(s[i]-10+'A');\n    }\n} \nint main() \n\t{\n\tcin>>n;\n\tfor(int i=1;i<=300;i++)\n\t{//从1-300进行循环 \n    \tjz(i*i,n);//调用函数 \n    \tif(change()){\n        \tjz(i,n);\n\t        print();\n\t        cout<<' ';\n\t        jz(i*i,n);\n\t        print();\n\t        puts(\""\"");\n\t\t}\n\t}\n    return 0;\n}",COMPILE_ERROR,0,0
1278668027053137920,2fb86982d1a92c7b4708937570a5a78ec2d3419e29352cf7fce03584a8a25795,2020-07-02 20:33:08,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>//万能头 \nusing namespace std;\nint n;\nint s[301];\nvoid jz(int a,int b)//转换进制 \n{\n    int r=0;\n    while(a){\n        s[++r]=a%b;\n        a/=b;\n    }\n    s[0]=r;\n}\nbool change(){//判断s[i]与s[s[0]+1-i]是否相等\n    for(int i=1;i<=s[0];i++)\n\t{\n    \tif(s[i]!=s[s[0]+1-i]) return false;\n    }\n    return true;\n}\nvoid print(){//打印 \n    for(int i=s[0];i>=1;i--)\n\t{\n        if(s[i]<=9) cout<<s[i];\n        else cout<<(char)(s[i]-10+'A');\n    }\n} \nint main() \n\t{\n\tcin>>n;\n\tfor(int i=1;i<=300;i++)\n\t{//从1-300进行循环 \n    \tjz(i*i,n);//调用函数 \n    \tif(change()){\n        \tjz(i,n);\n\t        print();\n\t        cout<<' ';\n\t        jz(i*i,n);\n\t        print();\n\t        puts(\""\"");\n\t\t}\n\t}\n    return 0;\n}",COMPILE_ERROR,0,0
1278668179977461760,2fb86982d1a92c7b4708937570a5a78ec2d3419e29352cf7fce03584a8a25795,2020-07-02 20:33:45,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>//万能头 \nusing namespace std;\nint n;\nint s[301];\nvoid jz(int a,int b)//转换进制 \n{\n    int r=0;\n    while(a){\n        s[++r]=a%b;\n        a/=b;\n    }\n    s[0]=r;\n}\nbool change(){//判断s[i]与s[s[0]+1-i]是否相等\n    for(int i=1;i<=s[0];i++)\n\t{\n    \tif(s[i]!=s[s[0]+1-i]) return false;\n    }\n    return true;\n}\nvoid print(){//打印 \n    for(int i=s[0];i>=1;i--)\n\t{\n        if(s[i]<=9) cout<<s[i];\n        else cout<<(char)(s[i]-10+'A');\n    }\n} \nint main() \n\t{\n\tcin>>n;\n\tfor(int i=1;i<=300;i++)\n\t{//从1-300进行循环 \n    \tjz(i*i,n);//调用函数 \n    \tif(change()){\n        \tjz(i,n);\n\t        print();\n\t        cout<<' ';\n\t        jz(i*i,n);\n\t        print();\n\t        puts(\""\"");\n\t\t}\n\t}\n    return 0;\n}",ACCEPTED,42,548
1278669113314967552,2fb86982d1a92c7b4708937570a5a78ec2d3419e29352cf7fce03584a8a25795,2020-07-02 20:37:27,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstdio>\n#include<cstdlib>\nusing namespace std;\nint n[301];\nvoid trans(int a, int b)//转换进制\n{\n\tint x = 0;\n\twhile (a)\n\t{\n\t\tn[++x] = a % b;\n\t\ta /= b;\n\t}\n\tn[0] = x;\n}\nbool judge()//判断回文数\n{\n\tfor (int i = 1; i <= n[0]; i++)\n\t{\n\t\tif (n[i] != n[n[0] + 1 - i]) \n\t\t\treturn 0;\n\t}\n\treturn 1;\n}\nvoid put() //输出\n{ \n\tfor (int i = n[0]; i >= 1; i--)\n\t{\n\t\tif (n[i] <= 9) cout << n[i];\n\t\telse cout << (char)(n[i] - 10 + 'A');\n\t}\n}\nint main()\n{\n\tint n;\n\tcin >> n;\n\tfor (int i = 1; i <= 300; i++)\n\t{ \n\t\ttrans(i*i, n); \n\t\tif (judge()) \n\t\t{\n\t\t\ttrans(i, n);\n\t\t\tput();\n\t\t\tcout << ' ';\n\t\t\ttrans(i*i, n);\n\t\t\tput();\n\t\t\tputs(\""\"");\n\t\t}\n\t}\n\tsystem(\""pause\"");\n\treturn 0;\n}",ACCEPTED,40,552
1278669354709745664,c21bc670948d3b509f1c1ae5efdff5c7ab99c718fcc903336363f152a304efea,2020-07-02 20:38:25,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nconst string s = \""0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"";\nint b;\nstruct node{\n    int a[20], len;\n    node(int x){len=0;while(x)a[++len]=x%b,x/=b;}//转为B进制\n    void out(){for(int i=len;i>=1;i--)cout<<s[a[i]];}\n    bool tf(){for(int i=1;i<=len;i++)if(a[i]!=a[len-i+1])return false; return true;}\n};\nint main(){\n    cin>>b;\n    for(int i = 1; i <= 300; i++){\n        node n(i*i);\n        if(n.tf()){\n            node m(i); m.out(); cout<<' ';\n            n.out(); cout<<'\\n';\n        }\n    }\n    return 0;\n}\n",ACCEPTED,24,424
1278671847535599616,2fb86982d1a92c7b4708937570a5a78ec2d3419e29352cf7fce03584a8a25795,2020-07-02 20:48:19,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstdio>\n#include<cstdlib>\nusing namespace std;\nint n[301];\nvoid trans(int a, int b)//转换进制\n{\n\tint x = 0;\n\twhile (a)\n\t{\n\t\tn[++x] = a % b;\n\t\ta /= b;\n\t}\n\tn[0] = x;\n}\nbool judge()//判断回文数\n{\n\tfor (int i = 1; i <= n[0]; i++)\n\t{\n\t\tif (n[i] != n[n[0] + 1 - i]) \n\t\t\treturn 0;\n\t}\n\treturn 1;\n}\nvoid put() //输出\n{ \n\tfor (int i = n[0]; i >= 1; i--)\n\t{\n\t\tif (n[i] <= 9) cout << n[i];\n\t\telse cout << (char)(n[i] - 10 + 'A');\n\t}\n}\nint main() \n{\n\tint n, m;\n\tcin >> n >> m;\n\tint s = m + 1;\n\tfor (int i = 1; i <= n;) \n\t{\n\t\tint sum = 0;\n\t\tfor (int j = 2; j <= 10; j++) {\n\t\t\ttrans(s, j);\n\t\t\tif (judge()) sum++;\n\t\t}\n\t\tif (sum >= 2) \n\t\t{\n\t\t\tcout << s << endl;\n\t\t\ti++;\n\t\t}\n\t\ts++;\n\t}\n\tsystem(\""pause\"");\n\treturn 0;\n}",COMPILE_ERROR,0,0
1278671874840526848,2fb86982d1a92c7b4708937570a5a78ec2d3419e29352cf7fce03584a8a25795,2020-07-02 20:48:26,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstdio>\n#include<cstdlib>\nusing namespace std;\nint n[301];\nvoid trans(int a, int b)//转换进制\n{\n\tint x = 0;\n\twhile (a)\n\t{\n\t\tn[++x] = a % b;\n\t\ta /= b;\n\t}\n\tn[0] = x;\n}\nbool judge()//判断回文数\n{\n\tfor (int i = 1; i <= n[0]; i++)\n\t{\n\t\tif (n[i] != n[n[0] + 1 - i]) \n\t\t\treturn 0;\n\t}\n\treturn 1;\n}\nvoid put() //输出\n{ \n\tfor (int i = n[0]; i >= 1; i--)\n\t{\n\t\tif (n[i] <= 9) cout << n[i];\n\t\telse cout << (char)(n[i] - 10 + 'A');\n\t}\n}\nint main() \n{\n\tint n, m;\n\tcin >> n >> m;\n\tint s = m + 1;\n\tfor (int i = 1; i <= n;) \n\t{\n\t\tint sum = 0;\n\t\tfor (int j = 2; j <= 10; j++) {\n\t\t\ttrans(s, j);\n\t\t\tif (judge()) sum++;\n\t\t}\n\t\tif (sum >= 2) \n\t\t{\n\t\t\tcout << s << endl;\n\t\t\ti++;\n\t\t}\n\t\ts++;\n\t}\n\tsystem(\""pause\"");\n\treturn 0;\n}",ACCEPTED,38,512
1278676470027714560,106cca25065929efd4713fed2f93a7d8efe627c7cbef1252d065de4422b5834e,2020-07-02 21:06:41,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint fun1(int n,int x)\n{\t\n\tint i=0,m=x*x,j,a[100],b[100],k=0;\t\n\twhile(x!=0)\n\t{\t\t\n\t\tb[k++]=x%n;\t\t\n\t\tx=x/n;\t\n\t}\t\n\twhile(m!=0)\n\t{\t\t\n\t\ta[i++]=m%n;\t\t\n\t\tm=m/n;\t\n\t}\t\n\tfor(j=0;j<i/2;j++)\n\t{\t\t\n\t\tif(a[j]!=a[i-j-1]) \n\t\t\treturn 0;\t\n\t}\t\n\tfor(j=k-1;j>0;j--)\t    \n\t\tcout<<b[j];\t\n\tcout<<b[j]<<\"" \"";\t\n\tfor(j=0;j<i-1;j++)\t    \n\t\tcout<<a[j];\t\n\tcout<<a[j]<<endl;\n}",COMPILE_ERROR,0,0
1278676484691001344,106cca25065929efd4713fed2f93a7d8efe627c7cbef1252d065de4422b5834e,2020-07-02 21:06:45,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint fun1(int n,int x)\n{\t\n\tint i=0,m=x*x,j,a[100],b[100],k=0;\t\n\twhile(x!=0)\n\t{\t\t\n\t\tb[k++]=x%n;\t\t\n\t\tx=x/n;\t\n\t}\t\n\twhile(m!=0)\n\t{\t\t\n\t\ta[i++]=m%n;\t\t\n\t\tm=m/n;\t\n\t}\t\n\tfor(j=0;j<i/2;j++)\n\t{\t\t\n\t\tif(a[j]!=a[i-j-1]) \n\t\t\treturn 0;\t\n\t}\t\n\tfor(j=k-1;j>0;j--)\t    \n\t\tcout<<b[j];\t\n\tcout<<b[j]<<\"" \"";\t\n\tfor(j=0;j<i-1;j++)\t    \n\t\tcout<<a[j];\t\n\tcout<<a[j]<<endl;\n}",COMPILE_ERROR,0,0
1278676541960019968,106cca25065929efd4713fed2f93a7d8efe627c7cbef1252d065de4422b5834e,2020-07-02 21:06:58,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint fun1(int n,int x)\n{\t\n\tint i=0,m=x*x,j,a[100],b[100],k=0;\t\n\twhile(x!=0)\n\t{\t\t\n\t\tb[k++]=x%n;\t\t\n\t\tx=x/n;\t\n\t}\t\n\twhile(m!=0)\n\t{\t\t\n\t\ta[i++]=m%n;\t\t\n\t\tm=m/n;\t\n\t}\t\n\tfor(j=0;j<i/2;j++)\n\t{\t\t\n\t\tif(a[j]!=a[i-j-1]) \n\t\t\treturn 0;\t\n\t}\t\n\tfor(j=k-1;j>0;j--)\t    \n\t\tcout<<b[j];\t\n\tcout<<b[j]<<\"" \"";\t\n\tfor(j=0;j<i-1;j++)\t    \n\t\tcout<<a[j];\t\n\tcout<<a[j]<<endl;\n}\nint main()\n{\t\n\tint n,i;\t\n\tcin >> n;\n\tfor(i=1;i<=300;i++)\n\t{\t\t\n\t\tfun1(n,i);\t\n\t}\n}",PARTIAL_ACCEPTED,28,512
1278677027790454784,3444ced0d9b3f7762d513b7866220aef472777b2623d4f2d53d3791dcb47fd5b,2020-07-02 21:08:54,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstring>\n#include<map>\n#include<vector>\n#include<array>\n#include <algorithm>\n#include<cmath>\nusing namespace std;\nstring change(int n, int b)\n{\n    string num;\n    while (n > 0)\n    {\n        int m = n % b;\n        if (m < 10)\n        {\n            num+=(m + 48);\n\n        }\n        else\n        {\n            num+=(m + 55);\n        }\n        m = n / b;\n    }\n    return num;\n}\n\n\n\nint main()\n{\n    int a;\n    int flag = 0;\n    cin >> a;\n    string c;\n    for (int i = 1; i <= 300; i++)\n    {\n        c = change(i * i, a);\n        for (int j = 0; j < (c.length()/2); j++)\n        {\n            if (c[j] != c[c.size() - j - 1])\n            {\n                 flag = 0;\n                 break;\n            }\n        }\n        if (flag == 1)\n        {\n            string s;\n            for (int i = 0; i < c.length(); i++)\n            {\n                s[i] = c[i];\n            }\n            cout << i << \"" \"" << s << endl;\n        }\n    }\n    \n    \n    return 0;\n}",TIME_LIMIT_EXCEEDED,0,0
1278677406460608512,3444ced0d9b3f7762d513b7866220aef472777b2623d4f2d53d3791dcb47fd5b,2020-07-02 21:10:25,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cstring>\n#include <string.h>\nusing namespace std;\n\nint b,n;\nint i,j,k,r;\nint a[50],a2[50];\n\nvoid zhuanhuan(int a[50],int n)\n{\n\tint m1,c1;\n\tc1=n;\n\tj=0;\n\twhile(c1>0)\n\t{\n\t\tm1=n%b;\n\t\t//cout<<\""haha...\""<<endl;\n\t\ta[j]=m1;\n\t\tj++;\n\t\tc1=n/b;\n\t\tn=n/b;\n\t}\n}\n\n\nint main()\n{\n\tcin>>b;\n\tfor(k=1;k<=300;k++)\n\t{\n\t\tfor(i=0;i<50;i++)\n\t\t{\n\t\t\ta[i]=-1;\n\t\t\ta2[i]=-1;\n\t\t}\n\t\tint bool1=1;\n\t\tn=k*k;\n\t\tzhuanhuan(a,n);\n\t\tint len=0;\n\t\tfor(int t=0;a[t]>=0;t++)\n\t\t\tlen++;\n\t\t//cout<<\"" len= \""<<len<<endl;\n\t\tfor(i=0;i<len/2;i++)\n\t\t{\n\t\t\tif(a[i]!=a[len-1-i])\n\t\t\t{\n\t\t\t\tbool1=0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(bool1==1)\n\t\t{\n\t\t\tzhuanhuan(a2,k);\n\t\t\tint len2=0;\n\t\t\tfor(int t1=0;a2[t1]>=0;t1++)\n\t\t\t\tlen2++;\n\t\t\tfor(int t2=len2-1;t2>=0;t2--)\n\t\t\t{\n\t\t\t\tif(a2[t2]>=10)\n\t\t\t\t{\n\t\t\t\t\tswitch(a2[t2])\n\t\t\t\t\t{\n\t\t\t\t\tcase 10:cout<<\""A\"";\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 11:cout<<\""B\"";\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 12:cout<<\""C\"";\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 13:cout<<\""D\"";\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 14:cout<<\""E\"";\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 15:cout<<\""F\"";\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 16:cout<<\""G\"";\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 17:cout<<\""H\"";\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 18:cout<<\""I\"";\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 19:cout<<\""J\"";\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t\tcout<<a2[t2];\n\n\t\t\t}\n\t\t\tcout<<\"" \"";\n\t\t\tfor(r=0;r<len;r++)\n\t\t\t{\n\t\t\t\tif(a[r]>=10)\n\t\t\t\t{\n\t\t\t\t\tswitch(a[r])\n\t\t\t\t\t{\n\t\t\t\t\tcase 10:cout<<\""A\"";\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 11:cout<<\""B\"";\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 12:cout<<\""C\"";\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 13:cout<<\""D\"";\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 14:cout<<\""E\"";\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 15:cout<<\""F\"";\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 16:cout<<\""G\"";\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 17:cout<<\""H\"";\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 18:cout<<\""I\"";\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 19:cout<<\""J\"";\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t\tcout<<a[r];\n\t\t\t}\n\t\t\tcout<<endl;\n\t\t}\n\t}\n\n\treturn 0;\n}",ACCEPTED,26,512
1278677788075155456,3444ced0d9b3f7762d513b7866220aef472777b2623d4f2d53d3791dcb47fd5b,2020-07-02 21:11:56,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstdio>\n#include<cstring>\n#include<string>\nusing namespace std;\ntypedef long long int LL;\nstring change(LL n,LL m)//把n转换为m进制\n{\n    string str;\n    if(m<=10)\n    {\n        while(n)\n        {\n            str+=(n%m+'0');\n            n/=m;\n        }\n    }\n    else\n    {\n        while(n)\n        {\n            int x=n%m;\n            if(x>=10)\n            {\n                x-=10;\n                str+=(x+'A');\n            }\n            else\n                str+=(x+'0');\n            n/=m;\n        }\n    }\n    return str;\n}\nbool is_Palindromic_Squares(string str)//判断是否是回文\n{\n    int len=str.size();\n    for(int i=0; i<=len/2-1; i++)\n    {\n        if(str[i]!=str[len-i-1])\n            return false;\n    }\n    return true;\n}\nint main()\n{\n    LL n,s;\n    cin>>n>>s;\n    int num=0;\n    LL i,j;\n    for(i=s+1;num<n;i++)\n    {\n        int t=0;\n        for(j=2;j<=10;j++)//二到十进制的转换\n        {\n            string str=change(i,j);\n            if(is_Palindromic_Squares(str)==true)\n                t++;\n            if(t==2)\n            {\n                num++;\n                break;\n            }\n        }\n        if(j<=10)\n            cout<<i<<endl;\n    }\n}",ACCEPTED,42,512
1278678886257197056,106cca25065929efd4713fed2f93a7d8efe627c7cbef1252d065de4422b5834e,2020-07-02 21:16:17,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nconst string str = \""0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"";\nint a;\nstruct change {\n    int b[20], s;\n    change(int x) { \n        s = 0; \n        while (x)\n            b[++s] = x % a, x = x / a; \n    }\n    void show() { \n        for (int i = s; i >= 1; i--)\n            cout << str[b[i]];\n    }\n    bool bianhua() { \n        for (int i = 1; i <= s; i++)\n            if (b[i] != b[s - i + 1])\n                return false; \n        return true; \n    }\n};\nint main() {\n    cin >> a;\n    for (int i = 1; i <= 300; i++) \n    {\n        change pingfang(i * i);\n        if (pingfang.bianhua()) \n        {\n            change yuanshu(i); \n            yuanshu.show(); \n            cout << \"" \"";\n            pingfang.show(); \n            cout << endl;\n        }\n    }\n    return 0;\n}",ACCEPTED,39,492
1278679196207865856,74892c722848283d881fc8534f34a34faa911dd17e155bda71226244a3127206,2020-07-02 21:17:31,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\nint B;  // 进制；\n\nstring change(int num, int B) {    // 十进制转任意进制；\n\tint temp;\n\tstring remain = \""\"";\n\tdo {\n\t\ttemp = num % B;\n\t\tnum /= B;\n\t\tif (temp >= 10) {\n\t\t\tremain += (temp - 10 + 'A');\n\n\t\t}\n\t\telse {\n\t\t\tremain += (temp + '0');\n\t\t}\n\t}\n\twhile (num);\n\treverse(remain.begin(), remain.end());\n\treturn remain;\n}\n\nbool cirnum(int num,int B) {    //判断在B进制下是否是回文数；\n\n\tint x = num, tmp = 0;\n\twhile (x) {\n\t\ttmp = tmp * B + x % B;\n\t\tx /= B;\n\t}\n\tif (tmp == num) return true;\n\telse return false;\n}\n\n\nint main() {\n\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tint square = i * i;\n\t\tif (cirnum(square, B)) {\n\t\t\tcout << change(i, B) << \"" \"" << change(square, B) << endl;\n\t\t}\n\t}\n}",COMPILE_ERROR,0,0
1278679412944338944,74892c722848283d881fc8534f34a34faa911dd17e155bda71226244a3127206,2020-07-02 21:18:23,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <algorithm>\nusing namespace std;\n\nint B;  // 进制；\n\nstring change(int num, int B) {    // 十进制转任意进制；\n\tint temp;\n\tstring remain = \""\"";\n\tdo {\n\t\ttemp = num % B;\n\t\tnum /= B;\n\t\tif (temp >= 10) {\n\t\t\tremain += (temp - 10 + 'A');\n\n\t\t}\n\t\telse {\n\t\t\tremain += (temp + '0');\n\t\t}\n\t}\n\twhile (num);\n\treverse(remain.begin(), remain.end());\n\treturn remain;\n}\n\nbool cirnum(int num,int B) {    //判断在B进制下是否是回文数；\n\n\tint x = num, tmp = 0;\n\twhile (x) {\n\t\ttmp = tmp * B + x % B;\n\t\tx /= B;\n\t}\n\tif (tmp == num) return true;\n\telse return false;\n}\n\n\nint main() {\n\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tint square = i * i;\n\t\tif (cirnum(square, B)) {\n\t\t\tcout << change(i, B) << \"" \"" << change(square, B) << endl;\n\t\t}\n\t}\n}",ACCEPTED,45,424
1278680839800422400,4857ec95d14596a0a76f67f78dd8a2cb262fa3ed1997e1c92d98a2c9aa215fc0,2020-07-02 21:24:03,C++,70.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<cstdio>\n#include<iostream>\nusing namespace std;\nvoid show(int x)\n{\n    if(x<10)\n        cout<<x;\n    else\n    {\n        char y;\n        y = char(x + 55);\n        cout << y;\n    }\n}\n\nint choose(int a[],int pi)\n{\n    int f = 1;\n    for (int j = 1; j <= pi / 2;j++)\n    {\n        if(a[j]!=a[pi+1-j])\n        {\n            f=0;\n            break;\n        }\n    }\n    return f;\n} \n\nvoid turn(int x,int b)\n{\n    int a[10],c[10],x0;\n    x0 = x;\n    x=x*x;\n    int i = 1;\n    for (;;i++)        //进制转化\n    {\n        a[i] = x % b;\n        if(x>=b)\n            x = x / b;\n        else\n            break;\n    }\n    int j = 1;\n    for (;;j++)\n    {\n        c[j] = x0 % b;\n        if(x0>=b)\n            x0 = x0 / b;\n        else\n            break;\n    }\n    int f = choose(a, i);\n    if(f==1)\n    {\n        for (;j>=1;j--)\n            show(c[j]);\n        cout<<\"" \"";\n        for (; i >= 1;i--)\n            show(a[i]);\n        cout << endl;\n    }\n}\nint main()\n{\n    int B;\n    cin>>B;\n    for (int i = 1; i <= 300;i++)\n        turn(i, B);\n        return 0;\n}",PARTIAL_ACCEPTED,42,432
1278681830843154432,d72ecca80e3b6a9e8d1d9ff1ba8175a5258dc79a213daa46397a30413c75ed27,2020-07-02 21:27:59,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nint B;\nint arr[100];\nvoid exchange(int x)\n{\n    int m=0;\n    while(x)\n    {\n        arr[++m]=x%B;\n        x=x/B;\n    }\n    for(int i=m;i>=1;i--)\n    {\n        if(arr[i]>9)\n        {\n            arr[i]=a[i]+55;\n            cout<<(char)arr[i];\n        }\n        else\n        {\n            cout<<arr[i];\n        }\n    }\n}\nbool huiwen(int x)\n{\n    int m=0;\n    x=x*x;\n    while(x)\n    {\n        arr[++m]=x%B;\n        x/=B;\n    }\n    for(int i=1,j=m;i<j;i++,j--)\n        if(arr[i]!=arr[j])\n            return 0;\n    return 1;\n}\nint main()\n{\n    cin>>B;\n    for(int i=1;i<=300;i++)\n    {\n        if(huiwen(i))\n        {\n            exchange(i);\n            cout<<\"" \"";\n            exchange(i*i);\n            cout<<endl;\n        }\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1278681886145052672,d72ecca80e3b6a9e8d1d9ff1ba8175a5258dc79a213daa46397a30413c75ed27,2020-07-02 21:28:13,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nint B;\nint arr[100];\nvoid exchange(int x)\n{\n    int m=0;\n    while(x)\n    {\n        arr[++m]=x%B;\n        x=x/B;\n    }\n    for(int i=m;i>=1;i--)\n    {\n        if(arr[i]>9)\n        {\n            arr[i]=arr[i]+55;\n            cout<<(char)arr[i];\n        }\n        else\n        {\n            cout<<arr[i];\n        }\n    }\n}\nbool huiwen(int x)\n{\n    int m=0;\n    x=x*x;\n    while(x)\n    {\n        arr[++m]=x%B;\n        x/=B;\n    }\n    for(int i=1,j=m;i<j;i++,j--)\n        if(arr[i]!=arr[j])\n            return 0;\n    return 1;\n}\nint main()\n{\n    cin>>B;\n    for(int i=1;i<=300;i++)\n    {\n        if(huiwen(i))\n        {\n            exchange(i);\n            cout<<\"" \"";\n            exchange(i*i);\n            cout<<endl;\n        }\n    }\n    return 0;\n}\n",ACCEPTED,44,512
1278682151229251584,74892c722848283d881fc8534f34a34faa911dd17e155bda71226244a3127206,2020-07-02 21:29:16,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\n\nbool cirnum(int num, int B) {    //判断在B进制下是否是回文数；\n\n\tint x = num, tmp = 0;\n\twhile (x) {\n\t\ttmp = tmp * B + x % B;\n\t\tx /= B;\n\t}\n\tif (tmp == num) return true;\n\telse return false;\n}\nint main() {\n\tint N, S;\n\tcin >> N >> S;\n\tint counter=0;   //在counter个进制下是回文数；\n\tint num = S + 1;\n\tint current = 0;\n\twhile (num > S) {\n\t\tfor (int B = 2; B <= 10; B++) {\n\t\t\tif (cirnum(num, B)) {\n\t\t\t\tcounter++;\n\t\t\t}\n\t\t\twhile (counter == 2) break;\n\t\t}\n\t\tcout << num << endl;\n\t\tnum++;\n\t\tcurrent++;\n\t\twhile (current == N) return 0;\n\t}\n}",PARTIAL_ACCEPTED,36,512
1278682503701790720,4857ec95d14596a0a76f67f78dd8a2cb262fa3ed1997e1c92d98a2c9aa215fc0,2020-07-02 21:30:40,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<cstdio>\n#include<iostream>\nusing namespace std;\nvoid show(int x)\n{\n    if(x<10)\n        cout<<x;\n    else\n    {\n        char y;\n        y = char(x + 55);\n        cout << y;\n    }\n}\n\nint choose(int a[],int pi)\n{\n    int f = 1;\n    for (int j = 1; j <= pi / 2;j++)\n    {\n        if(a[j]!=a[pi+1-j])\n        {\n            f=0;\n            break;\n        }\n    }\n    return f;\n} \n\nvoid turn(int x,int b)\n{\n    int a[100],c[100],x0;\n    x0 = x;\n    x=x*x;\n    int i = 1;\n    for (;;i++)        //进制转化\n    {\n        a[i] = x % b;\n        if(x>=b)\n            x = x / b;\n        else\n            break;\n    }\n    int j = 1;\n    for (;;j++)\n    {\n        c[j] = x0 % b;\n        if(x0>=b)\n            x0 = x0 / b;\n        else\n            break;\n    }\n    int f = choose(a, i);\n    if(f==1)\n    {\n        for (;j>=1;j--)\n            show(c[j]);\n        cout<<\"" \"";\n        for (; i >= 1;i--)\n            show(a[i]);\n        cout << endl;\n    }\n}\nint main()\n{\n    int B;\n    cin>>B;\n    for (int i = 1; i <= 300;i++)\n        turn(i, B);\n        return 0;\n}",ACCEPTED,44,512
1278683128879579136,685d92e8c15d0ebd2875b6981da27f1f4ec039ee8163beabb74fb58572d473d4,2020-07-02 21:33:09,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include <algorithm>\n#include<math.h>\nusing namespace std;\nint main()\n{\n\tint n, s, count = 0, f = 0, temp = 0, g = 0;\n\tint h[15];\n\tchar c;\n\tcin >> n >> s;\n\tstring a1, a2;\n\tfor (int i = s + 1;; i++)\n\t{\n\t\tfor (int j = 2; j < 11; j++)\n\t\t{\n\t\t\twhile (1)\n\t\t\t{\n\t\t\t\ta1 = \""\"";\n\t\t\t\tint k = i;\n\t\t\t\ttemp = k % j;\n\t\t\t\tc = temp + '0';\n\t\t\t\tif ((k = k / j) > 0)\n\t\t\t\t\ta1 += c;\n\t\t\t\telse if((k=k/j)==0)\n\t\t\t\t{\n\t\t\t\t\ta1 += c;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\ta2 = a1;\n\t\t\treverse(a2.begin(), a2.end());\n\t\t\tif (a2 == a1)\n\t\t\t\tf++;\n\t\t\tif (f == 2)\n\t\t\t{\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (count == n)\n\t\t\tbreak;\n\t}\n\tsystem(\""pause\"");\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,0,0
1278683363974512640,74892c722848283d881fc8534f34a34faa911dd17e155bda71226244a3127206,2020-07-02 21:34:05,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\n\nbool cirnum(int num, int B) {    //判断在B进制下是否是回文数；\n\n\tint x = num, tmp = 0;\n\twhile (x) {\n\t\ttmp = tmp * B + x % B;\n\t\tx /= B;\n\t}\n\tif (tmp == num) return true;\n\telse return false;\n}\nint main() {\n\tint N, S;\n\tcin >> N >> S;\n\tint counter=0;   //在counter个进制下是回文数；\n\tint num = S + 1;\n\tint current = 0;\n\twhile (num > S) {\n\t\tfor (int B = 2; B <= 10; B++) {\n\t\t\tif (cirnum(num, B)) {\n\t\t\t\tcounter++;\n\t\t\t}\n\t\t\tif (counter == 2) \n\t\t\t{ \n\t\t\t\tcout << num << endl; \n\t\t\t    current++;\n\t\t\t    break;\n\t\t\t}\n\t\t}\n\t\t\n\t\tnum++;\n\t\t\n\t\tif (current == N) return 0;\n\t}\n}",MULTIPLE_ERROR,10,512
1278685214534991872,bd23feb70f31c39d44f8632991273351b7ada8a16cc217a7026b9a98a9d21bf7,2020-07-02 21:41:26,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<fstream>\nusing namespace std;\nint arr[32];\nbool legal(int num)\n{\n    int times = 0;\n    for (int n = 2; n <= 10; n++)\n    {\n        int p = 0;\n        int flag = 1;\n        int x = num;\n        while (x)\n        {\n            arr[p] = x % n;\n            p++;\n            x = x / n;\n        }\n        for (int j = 0; j < p; j++)\n        {\n            if (arr[j] != arr[p - j - 1])\n            {\n                flag = 0;\n                break;\n            }\n        }\n        if (flag) times++;\n        if (times > 1)\n        {\n            return true;\n        }\n    }\n    return false;\n}\n\nint main()\n{\n    int s, x, count = 0;\n    cin >> x >> s;\n    for (int i = s + 1; x; i++)\n        if (legal(i))\n        {\n            if (count == 0) {\n                cout << i;\n                count = 1;\n            }\n            else cout << '\\n' << i;\n            x--;\n        }\n    return 0;",COMPILE_ERROR,0,0
1278685278443601920,bd23feb70f31c39d44f8632991273351b7ada8a16cc217a7026b9a98a9d21bf7,2020-07-02 21:41:41,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<fstream>\nusing namespace std;\nint arr[32];\nbool legal(int num)\n{\n    int times = 0;\n    for (int n = 2; n <= 10; n++)\n    {\n        int p = 0;\n        int flag = 1;\n        int x = num;\n        while (x)\n        {\n            arr[p] = x % n;\n            p++;\n            x = x / n;\n        }\n        for (int j = 0; j < p; j++)\n        {\n            if (arr[j] != arr[p - j - 1])\n            {\n                flag = 0;\n                break;\n            }\n        }\n        if (flag) times++;\n        if (times > 1)\n        {\n            return true;\n        }\n    }\n    return false;\n}\n\nint main()\n{\n    int s, x, count = 0;\n    cin >> x >> s;\n    for (int i = s + 1; x; i++)\n        if (legal(i))\n        {\n            if (count == 0) {\n                cout << i;\n                count = 1;\n            }\n            else cout << '\\n' << i;\n            x--;\n        }\n    return 0;\n}",ACCEPTED,36,476
1278686968827797504,74892c722848283d881fc8534f34a34faa911dd17e155bda71226244a3127206,2020-07-02 21:48:24,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\n\nbool cirnum(int num, int B) {    //判断在B进制下是否是回文数；\n\n\tint x = num, tmp = 0;\n\twhile (x) {\n\t\ttmp = tmp * B + x % B;\n\t\tx /= B;\n\t}\n\tif (tmp == num) return true;\n\telse return false;\n}\nint main() \n{\n\tint N, S;\n\tcin >> N >> S;\n\t\n\t\n\tfor (int num = S + 1;; num++) {\n\t\tint counter = 0;   //在counter个进制下是回文数；\n\n\t\tfor (int B = 2; B <= 10; B++) {\n\t\t\tif (cirnum(num, B)) {\n\t\t\t\tcounter++;\n\t\t\t}\n\t\t\twhile (counter == 2) break;\n\n\t\t}\n\t\tif (counter == 2) {\n\t\t\tcout << num << endl;\n\t\t\tN--;\n\t\t}\n\t\tif (N == 0) return 0;\n\t}\n\t\n}",WRONG_ANSWER,36,492
1278687059126968320,74892c722848283d881fc8534f34a34faa911dd17e155bda71226244a3127206,2020-07-02 21:48:46,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\n\nbool cirnum(int num, int B) {    //判断在B进制下是否是回文数；\n\n\tint x = num, tmp = 0;\n\twhile (x) {\n\t\ttmp = tmp * B + x % B;\n\t\tx /= B;\n\t}\n\tif (tmp == num) return true;\n\telse return false;\n}\nint main() \n{\n\tint N, S;\n\tcin >> N >> S;\n\t\n\t\n\tfor (int num = S + 1;; num++) {\n\t\tint counter = 0;   //在counter个进制下是回文数；\n\n\t\tfor (int B = 2; B <= 10; B++) {\n\t\t\tif (cirnum(num, B)) {\n\t\t\t\tcounter++;\n\t\t\t}\n\t\t\twhile (counter == 2) break;\n\n\t\t}\n\t\tif (counter == 2) {\n\t\t\tcout << num << endl;\n\t\t\tN--;\n\t\t}\n\t\tif (N == 0) return 0;\n\t}\n\t\n}",WRONG_ANSWER,31,540
1278688217354665984,74892c722848283d881fc8534f34a34faa911dd17e155bda71226244a3127206,2020-07-02 21:53:22,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\n\nbool cirnum(int num, int B) {    //判断在B进制下是否是回文数；\n\n\tint x = num, tmp = 0;\n\twhile (x) {\n\t\ttmp = tmp * B + x % B;\n\t\tx /= B;\n\t}\n\tif (tmp == num) return true;\n\telse return false;\n}\nint main() \n{\n\tint N, S;\n\tcin >> N >> S;\n\tint num = S;\n\twhile (N != 0) {\n\t\tnum++;\n\t\tint counter = 0;   //在counter个进制下是回文数；\n\n\t\tfor (int B = 2; B <= 10; B++) {\n\t\t\tif (cirnum(num, B)) counter++;\n\t\t\tif (counter == 2) {\n\t\t\t\tcout << num << endl;\n\t\t\t\tN--;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\n\t}\n\t\n\t\n}",ACCEPTED,29,512
1278689066617339904,685d92e8c15d0ebd2875b6981da27f1f4ec039ee8163beabb74fb58572d473d4,2020-07-02 21:56:45,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include <algorithm>\n#include<math.h>\nusing namespace std;\nint main()\n{\n\tint n, s, count = 0, f = 0, temp = 0, g = 0;\n\tint h[15];\n\tchar c;\n\tcin >> n >> s;\n\tstring a1, a2;\n\twhile(count<n)\n    {\n        f=0;\n        s++;\n        for(int i=2;i<=10;i++)\n        {\n            g=s;\n            a1=\""\"";\n            while(1)\n            {\n                temp=g%i;\n                c=temp+'0';\n                if((g=g/i)>0)\n                    a1+=c;\n                else{a1+=c;break;}\n            }\n            a2=a1;\n            reverse(a2.begin(),a2.end());\n            if(a1==a2)\n                f++;\n        }\n        if(f==2)\n        {\n            cout<<s<<endl;\n            count=count+1;\n            \n        }\n    }\n}",WRONG_ANSWER,38,512
1278689163572862976,685d92e8c15d0ebd2875b6981da27f1f4ec039ee8163beabb74fb58572d473d4,2020-07-02 21:57:08,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include <algorithm>\n#include<math.h>\nusing namespace std;\nint main()\n{\n\tint n, s, count = 0, f = 0, temp = 0, g = 0;\n\tint h[15];\n\tchar c;\n\tcin >> n >> s;\n\tstring a1, a2;\n\twhile(count<n)\n    {\n        f=0;\n        s++;\n        for(int i=2;i<=10;i++)\n        {\n            g=s;\n            a1=\""\"";\n            while(1)\n            {\n                temp=g%i;\n                c=temp+'0';\n                if((g=g/i)>0)\n                    a1+=c;\n                else{a1+=c;break;}\n            }\n            a2=a1;\n            reverse(a2.begin(),a2.end());\n            if(a1==a2)\n                f++;\n        }\n        if(f==2)\n        {\n            cout<<s<<endl;\n            count=count+1;\n            continue;\n        }\n    }\n}",WRONG_ANSWER,34,496
1278690131668566016,4857ec95d14596a0a76f67f78dd8a2cb262fa3ed1997e1c92d98a2c9aa215fc0,2020-07-02 22:00:58,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<cstdio>\n#include<iostream>\nusing namespace std;\nint choose(int a[],int pi)\n{\n    int f = 1;\n    for (int j = 1; j <= pi / 2;j++)\n    {\n        if(a[j]!=a[pi+1-j])\n        {\n            f = 0;\n            break;\n        }\n    }\n    return f;\n} \n\nint turn(int x)\n{\n    int fi = 0;\n    for (int b = 2; b <= 10;b++)\n    {\n        int c[100], x0;\n        x0 = x;\n        int j = 1;\n        for (;;j++)             //进制转化\n        {\n            c[j] = x0 % b;\n            if(x0>=b)\n                x0 = x0 / b;\n            else\n                break;\n        }\n        int f = choose(c, j);\n        if(f==1)\n            fi++;\n    }\n    return fi;\n}\nint main()\n{\n    int n, s,ci=0;\n    cin>>n>>s;\n    for (int i = s + 1;;i++)\n    {\n        if(ci==n)\n            break;\n        if(turn(i)>=2)\n        {\n            cout << i<<endl;\n            ci++;\n        }\n    }\n        return 0;\n}",ACCEPTED,38,596
1278690655541329920,685d92e8c15d0ebd2875b6981da27f1f4ec039ee8163beabb74fb58572d473d4,2020-07-02 22:03:03,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include <algorithm>\n#include<math.h>\nusing namespace std;\nint main()\n{\n\tint n, s, count = 0, f = 0, temp = 0, g = 0;\n\tint h[15];\n\tchar c;\n\tcin >> n >> s;\n\tstring a1, a2;\n\twhile(count<n)\n    {\n        f=0;\n        s++;\n        for(int i=2;i<=10;i++)\n        {\n            g=s;\n            a1=\""\"";\n            while(true)\n            {\n                temp=g%i;\n                c=temp+'0';\n                if((g=g/i)>0)\n                    a1+=c;\n                else{a1+=c;break;}\n            }\n            a2=a1;\n            reverse(a2.begin(),a2.end());\n            if(a1==a2)\n                f++;\n        }\n        if(f>=2)\n        {\n            cout<<s<<endl;\n            count=count+1;\n            continue;\n        }\n    }\n}",ACCEPTED,31,504
1278691296951066624,685d92e8c15d0ebd2875b6981da27f1f4ec039ee8163beabb74fb58572d473d4,2020-07-02 22:05:36,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include <algorithm>\n#include<math.h>\nusing namespace std;\nint main()\n{\n\tint n, s, count = 0, f = 0, temp = 0, g = 0;\n\tint h[15];\n\tchar c;\n\tcin >> n >> s;\n\tstring a1, a2;\n\twhile(count<n)\n    {\n        f=0;\n        s++;\n        for(int i=2;i<=10;i++)\n        {\n            g=s;\n            a1=\""\"";\n            while(true)\n            {\n                temp=g%i;\n                c=temp+'0';\n                if((g=g/i)>0)\n                    a1+=c;\n                else{a1+=c;break;}\n            }\n            a2=a1;\n            reverse(a2.begin(),a2.end());\n            if(a1==a2)\n                f++;\n        }\n        if(f==2)\n        {\n            cout<<s<<endl;\n            count=count+1;\n            continue;\n        }\n    }\n}",WRONG_ANSWER,37,512
1278691346418688000,685d92e8c15d0ebd2875b6981da27f1f4ec039ee8163beabb74fb58572d473d4,2020-07-02 22:05:48,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include <algorithm>\n#include<math.h>\nusing namespace std;\nint main()\n{\n\tint n, s, count = 0, f = 0, temp = 0, g = 0;\n\tint h[15];\n\tchar c;\n\tcin >> n >> s;\n\tstring a1, a2;\n\twhile(count<n)\n    {\n        f=0;\n        s++;\n        for(int i=2;i<=10;i++)\n        {\n            g=s;\n            a1=\""\"";\n            while(true)\n            {\n                temp=g%i;\n                c=temp+'0';\n                if((g=g/i)>0)\n                    a1+=c;\n                else{a1+=c;break;}\n            }\n            a2=a1;\n            reverse(a2.begin(),a2.end());\n            if(a1==a2)\n                f++;\n        }\n        if(f>=2)\n        {\n            cout<<s<<endl;\n            count=count+1;\n            continue;\n        }\n    }\n}",ACCEPTED,27,392
1278691408179814400,ba8741b054453d53e00604cda664981b520780c8a25ad99d8eff8afe7b5f2cfd,2020-07-02 22:06:03,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include <algorithm>\n\nusing namespace std;\n\n\nint main() {\n\tint N=0;\n\tint S=0;\n\tint tmp=0;\n\tint flag = 0;\n\tint transfo=0;\n\tchar c;\n\tstring str=\""\"";\n\tstring s;\n\tint count = 0;\n\tcin >> N >> S;\n\twhile (count < N) {\n\t\tflag = 0;\n\t\tS++;\n\t\tfor (int i = 2; i <= 10; i++) {\n\t\t\ttransfo = S;\n\t\t\tstr = \""\"";\n\t\t\twhile (true) {\n\t\t\t\ttmp = transfo % i;\n\t\t\t\tc = tmp + '0';\n\t\t\t\tif ((transfo /= i) > 0) {\n\t\t\t\t\tstr = c + str;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tstr = c + str;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\ts = str;\n\t\t\treverse(s.begin(), s.end());\n\t\t\tif (str == s) {\n\t\t\t\tflag++;\n\t\t\t}\n\t\t\t\n\t\t}\n\t\tif (flag == 2) {\n\t\t\tcout << S << endl;\n\t\t\tcount++;\n\t\t\tcontinue;\n\t\t}\n\t\t\n\t\t\n\t}\n}",WRONG_ANSWER,52,512
1278691462445727744,ba8741b054453d53e00604cda664981b520780c8a25ad99d8eff8afe7b5f2cfd,2020-07-02 22:06:16,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include <algorithm>\n\nusing namespace std;\n\n\nint main() {\n\tint N=0;\n\tint S=0;\n\tint tmp=0;\n\tint flag = 0;\n\tint transfo=0;\n\tchar c;\n\tstring str=\""\"";\n\tstring s;\n\tint count = 0;\n\tcin >> N >> S;\n\twhile (count < N) {\n\t\tflag = 0;\n\t\tS++;\n\t\tfor (int i = 2; i <= 10; i++) {\n\t\t\ttransfo = S;\n\t\t\tstr = \""\"";\n\t\t\twhile (true) {\n\t\t\t\ttmp = transfo % i;\n\t\t\t\tc = tmp + '0';\n\t\t\t\tif ((transfo /= i) > 0) {\n\t\t\t\t\tstr = c + str;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tstr = c + str;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\ts = str;\n\t\t\treverse(s.begin(), s.end());\n\t\t\tif (str == s) {\n\t\t\t\tflag++;\n\t\t\t}\n\t\t\t\n\t\t}\n\t\tif (flag >= 2) {\n\t\t\tcout << S << endl;\n\t\t\tcount++;\n\t\t\tcontinue;\n\t\t}\n\t\t\n\t\t\n\t}\n}",ACCEPTED,46,512
1278691649444577280,ba8741b054453d53e00604cda664981b520780c8a25ad99d8eff8afe7b5f2cfd,2020-07-02 22:07:00,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include <algorithm>\n\nusing namespace std;\n\n\nint main() {\n\tint N=0;\n\tint S=0;\n\tint tmp=0;\n\tint flag = 0;\n\tint transfo=0;\n\tchar c;\n\tstring str=\""\"";\n\tstring s;\n\tint count = 0;\n\tcin >> N >> S;\n\twhile (count < N) {\n\t\tflag = 0;\n\t\tS++;\n\t\tfor (int i = 2; i <= 10; i++) {\n\t\t\ttransfo = S;\n\t\t\tstr = \""\"";\n\t\t\twhile (true) {\n\t\t\t\ttmp = transfo % i;\n\t\t\t\tc = tmp + '0';\n\t\t\t\tif ((transfo /= i) > 0) {\n\t\t\t\t\tstr = c + str;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tstr = c + str;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\ts = str;\n\t\t\treverse(s.begin(), s.end());\n\t\t\tif (str == s) {\n\t\t\t\tflag++;\n\t\t\t}\n\t\t\t\n\t\t}\n\t\tif (flag >= 2) {\n\t\t\tcout << S << endl;\n\t\t\tcount++;\n\t\t\tcontinue;\n\t\t}\n\t}\n}",ACCEPTED,47,424
1278691679362539520,d72ecca80e3b6a9e8d1d9ff1ba8175a5258dc79a213daa46397a30413c75ed27,2020-07-02 22:07:07,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nbool huiwen(char arr[],int x)//判断是否为回文数\n{\n    int m=0;\n    x=x*x;\n    int B;\n    while(x)\n    {\n        arr[++m]=x%B;\n        x/=B;\n    }\n    for(int i=1,j=m;i<j;i++,j--)\n        if(arr[i]!=arr[j])\n            return 0;\n    return 1;\n}\nint exchange(int x,int B)//任意进制转换\n{\n    int m=0;\n    char arr[20];\n    int n=0;\n    while(x>0)\n    {\n        arr[m]=x%B+'0';\n        x=x/B;\n        m++;\n        n++;\n    }\n    return huiwen(arr,n);\n}\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    int times=0;\n    int num=0;\n    int x;\n    x=S+1;\n    while(num<N)\n    {\n        for(int B=2;B<11;B++)\n        {\n            if(exchange(x,B))\n            {\n                times++;\n            }\n            if(times==2)\n            {\n                cout<<x<<endl;\n                num++;\n                break;\n            }\n        }\n        times=0;\n        x++;\n    }\n}\n",FLOAT_POINT_EXCEPTION,25,384
1278691782118793216,ba8741b054453d53e00604cda664981b520780c8a25ad99d8eff8afe7b5f2cfd,2020-07-02 22:07:32,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include <algorithm>\n\nusing namespace std;\n\n\nint main() {\n\tint N=0;\n\tint S=0;\n\tint tmp=0;\n\tint flag = 0;\n\tint transfo=0;\n\tchar c;\n\tstring str=\""\"";\n\tstring s;\n\tint count = 0;\n\tcin >> N >> S;\n\twhile (count < N) {\n\t\tflag = 0;\n\t\tS++;\n\t\tfor (int i = 2; i <= 10; i++) {\n\t\t\ttransfo = S;\n\t\t\tstr = \""\"";\n\t\t\twhile (true) {\n\t\t\t\ttmp = transfo % i;\n\t\t\t\tc = tmp + '0';\n\t\t\t\tif ((transfo /= i) > 0) {\n\t\t\t\t\tstr = c + str;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tstr = c + str;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\ts = str;\n\t\t\treverse(s.begin(), s.end());\n\t\t\tif (str == s) {\n\t\t\t\tflag++;\n\t\t\t}\n\t\t\t\n\t\t}\n\t\tif (flag -2==0) {\n\t\t\tcout << S << endl;\n\t\t\tcount++;\n\t\t\tcontinue;\n\t\t}\n\t}\n}",WRONG_ANSWER,53,424
1278691844177715200,ba8741b054453d53e00604cda664981b520780c8a25ad99d8eff8afe7b5f2cfd,2020-07-02 22:07:47,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include <algorithm>\n\nusing namespace std;\n\n\nint main() {\n\tint N=0;\n\tint S=0;\n\tint tmp=0;\n\tint flag = 0;\n\tint transfo=0;\n\tchar c;\n\tstring str=\""\"";\n\tstring s;\n\tint count = 0;\n\tcin >> N >> S;\n\twhile (count < N) {\n\t\tflag = 0;\n\t\tS++;\n\t\tfor (int i = 2; i <= 10; i++) {\n\t\t\ttransfo = S;\n\t\t\tstr = \""\"";\n\t\t\twhile (true) {\n\t\t\t\ttmp = transfo % i;\n\t\t\t\tc = tmp + '0';\n\t\t\t\tif ((transfo /= i) > 0) {\n\t\t\t\t\tstr = c + str;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tstr = c + str;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\ts = str;\n\t\t\treverse(s.begin(), s.end());\n\t\t\tif (str == s) {\n\t\t\t\tflag++;\n\t\t\t}\n\t\t\t\n\t\t}\n\t\tif (flag >= 2) {\n\t\t\tcout << S << endl;\n\t\t\tcount++;\n\t\t\tcontinue;\n\t\t}\n\t}\n}",ACCEPTED,43,492
1278692668182298624,d72ecca80e3b6a9e8d1d9ff1ba8175a5258dc79a213daa46397a30413c75ed27,2020-07-02 22:11:03,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nbool huiwen(char arr[],int x)//判断是否为回文数\n{\n    for(int i=0,j=x-1;i<j;i++,j--)\n        if(arr[i]!=arr[j])\n            return 0;\n    return 1;\n}\nint exchange(int x,int B)//任意进制转换\n{\n    int m=0;\n    char arr[20];\n    int n=0;\n    while(x>0)\n    {\n        arr[m]=x%B+'0';\n        x=x/B;\n        m++;\n        n++;\n    }\n    return huiwen(arr,n);\n}\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    int times=0;\n    int num=0;\n    int x;\n    x=S+1;\n    while(num<N)\n    {\n        for(int B=2;B<11;B++)\n        {\n            if(exchange(x,B))\n            {\n                times++;\n            }\n            if(times==2)\n            {\n                cout<<x<<endl;\n                num++;\n                break;\n            }\n        }\n        times=0;\n        x++;\n    }\n}\n",ACCEPTED,37,640
1278693478651854848,ba8741b054453d53e00604cda664981b520780c8a25ad99d8eff8afe7b5f2cfd,2020-07-02 22:14:16,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include <algorithm>\n\nusing namespace std;\n\n\nint main() {\n\tint N=0;\n\tint S=0;\n\tint tmp=0;\n\tint flag = 0;\n\tint transfo=0;\n\tchar c;\n\tstring str=\""\"";\n\tstring s;\n\tint count = 0;\n\tcin >> N >> S;\n\twhile (count < N) {\n\t\tflag = 0;\n\t\tS++;\n\t\tfor (int i = 2; i <= 10; i++) {\n\t\t\ttransfo = S;\n\t\t\tstr = \""\"";\n\t\t\twhile (true) {\n\t\t\t\ttmp = transfo % i;\n\t\t\t\tc = tmp + '0';\n\t\t\t\tif ((transfo /= i) > 0) {\n\t\t\t\t\tstr = c + str;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tstr = c + str;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\ts = str;\n\t\t\treverse(s.begin(), s.end());\n\t\t\tif (str == s) {\n\t\t\t\tflag++;\n\t\t\t}\n\t\t\t\n\t\t}\n\t\tif (flag == 3) {\n\t\t\tcout << S << endl;\n\t\t\tcount++;\n\t\t\tcontinue;\n\t\t}\n\t}\n}",MULTIPLE_ERROR,95,440
1278693497144532992,685d92e8c15d0ebd2875b6981da27f1f4ec039ee8163beabb74fb58572d473d4,2020-07-02 22:14:21,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include <algorithm>\n#include<math.h>\nusing namespace std;\nint main()\n{\n\tint n, s, count = 0, f = 0, temp = 0, g = 0;\n\tint h[15];\n\tchar c;\n\tcin >> n >> s;\n\tstring a1, a2;\n\twhile(count<n)\n    {\n        f=0;\n        s++;\n        for(int i=2;i<=10;i++)\n        {\n            g=s;\n            a1=\""\"";\n            while(true)\n            {\n                temp=g%i;\n                c=temp+'0';\n                if((g=g/i)>0)\n                    a1+=c;\n                else{a1+=c;break;}\n            }\n            a2=a1;\n            reverse(a2.begin(),a2.end());\n            if(a1==a2)\n                f++;\n        }\n        if(f==3)\n        {\n            cout<<s<<endl;\n            count=count+1;\n            continue;\n        }\n    }\n}",MULTIPLE_ERROR,49,552
1278693552287047680,ba8741b054453d53e00604cda664981b520780c8a25ad99d8eff8afe7b5f2cfd,2020-07-02 22:14:34,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include <algorithm>\n\nusing namespace std;\n\n\nint main() {\n\tint N=0;\n\tint S=0;\n\tint tmp=0;\n\tint flag = 0;\n\tint transfo=0;\n\tchar c;\n\tstring str=\""\"";\n\tstring s;\n\tint count = 0;\n\tcin >> N >> S;\n\twhile (count < N) {\n\t\tflag = 0;\n\t\tS++;\n\t\tfor (int i = 2; i <= 10; i++) {\n\t\t\ttransfo = S;\n\t\t\tstr = \""\"";\n\t\t\twhile (true) {\n\t\t\t\ttmp = transfo % i;\n\t\t\t\tc = tmp + '0';\n\t\t\t\tif ((transfo /= i) > 0) {\n\t\t\t\t\tstr = c + str;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tstr = c + str;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\ts = str;\n\t\t\treverse(s.begin(), s.end());\n\t\t\tif (str == s) {\n\t\t\t\tflag++;\n\t\t\t}\n\t\t\t\n\t\t}\n\t\tif (flag >= 2) {\n\t\t\tcout << S << endl;\n\t\t\tcount++;\n\t\t\tcontinue;\n\t\t}\n\t}\n}",ACCEPTED,46,424
1278693563938824192,685d92e8c15d0ebd2875b6981da27f1f4ec039ee8163beabb74fb58572d473d4,2020-07-02 22:14:37,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include <algorithm>\n#include<math.h>\nusing namespace std;\nint main()\n{\n\tint n, s, count = 0, f = 0, temp = 0, g = 0;\n\tint h[15];\n\tchar c;\n\tcin >> n >> s;\n\tstring a1, a2;\n\twhile(count<n)\n    {\n        f=0;\n        s++;\n        for(int i=2;i<=10;i++)\n        {\n            g=s;\n            a1=\""\"";\n            while(true)\n            {\n                temp=g%i;\n                c=temp+'0';\n                if((g=g/i)>0)\n                    a1+=c;\n                else{a1+=c;break;}\n            }\n            a2=a1;\n            reverse(a2.begin(),a2.end());\n            if(a1==a2)\n                f++;\n        }\n        if(f>=2)\n        {\n            cout<<s<<endl;\n            count=count+1;\n            continue;\n        }\n    }\n}",ACCEPTED,39,592
1278698105115967488,769a5633f3f76c88163c10ba96b281ae92c033baa24697a766f3d547fe850076,2020-07-02 22:32:39,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstring>\nusing namespace std;\n\nint number[110];            //作为全局变量可在调用change（）后更新\nint len1;                //记录转换后数组的长度\n\nint change(int a, int n)      //转化进制 转换后为倒序\n{\n\tmemset(number, 0, sizeof(number));                //数组归零\n\tlen1=0;                                    //长度归零\n\tint temp{ a };\n\tdo\n\t{\n\t\tnumber[len1] = temp % n;\n\t\ttemp /= n;\n\t\tlen1++;\n\t} while (temp != 0);\n\treturn 0;                \n}\n\nbool judge(int a[],int b) {                    //判断回文数(参数为需判断的数组和数组里数字的有效位数\n\tfor (int i{ 0 }; i < b / 2+1; i++) {\n\t\tif (number[i] != number[b - i - 1]) {\n\t\t\treturn 0;                    //如果number[i]不等于和它对应的number[len-i-1]位置，返回false\n\t\t}\n\t}\n\treturn 1;\n}\n\nint main() {\n\tint B;\n\tcin >> B;                                         //十进制数\n\n\tfor (int i{ 1 }; i < 301; i++) {\n\t\tchange(i*i, B);                        //更新数组和长度\n\t\tif (judge(number,len1) == 1) {\n\t\t\tcout << i << \"" \"";\n\t\t\tfor (int k{ 0 }; k < len1; k++) {\n\t\t\t\tif (number[k] < 10) {              //小于10输出数字\n\t\t\t\t\tcout << number[k] ;\n\t\t\t\t}\n\t\t\t\telse {                            //大于10输出大写字母\n\t\t\t\t\tchar c = number[k] - 10 + 'A';\n\t\t\t\t\tcout << c;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n}",PARTIAL_ACCEPTED,30,508
1278700541910114304,769a5633f3f76c88163c10ba96b281ae92c033baa24697a766f3d547fe850076,2020-07-02 22:42:20,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstring>\nusing namespace std;\n\nint number[110];            //作为全局变量可在调用change（）后更新\nint len1;                //记录转换后数组的长度\n\nint change(int a, int n)      //转化进制 转换后为倒序\n{\n\tmemset(number, 0, sizeof(number));                //数组归零\n\tlen1=0;                                    //长度归零\n\tint temp{ a };\n\tdo\n\t{\n\t\tnumber[len1] = temp % n;\n\t\ttemp /= n;\n\t\tlen1++;\n\t} while (temp != 0);\n\treturn 0;                \n}\n\nbool judge(int a[],int b) {                    //判断回文数(参数为需判断的数组和数组里数字的有效位数\n\tfor (int i{ 0 }; i < b / 2+1; i++) {\n\t\tif (number[i] != number[b - i - 1]) {\n\t\t\treturn 0;                    //如果number[i]不等于和它对应的number[len-i-1]位置，返回false\n\t\t}\n\t}\n\treturn 1;\n}\n\nint main() {\n\tint B;\n\tcin >> B;                                         //十进制数\n\n\tfor (int i{ 1 }; i < 301; i++) {\n\t\tchange(i*i, B);                        //更新数组和长度\n\t\tif (judge(number,len1) == 1) {\n\t\t\tcout << i << \"" \"";\n\t\t\tfor (int k{ 0 }; k < len1; k++) {\n\t\t\t\tif (number[k] < 10) {              //小于10输出数字\n\t\t\t\t\tcout << number[k];\n\t\t\t\t}\n\t\t\t\telse {                            //大于10输出大写字母\n\t\t\t\t\tcout << (char)(number[k] - 10 + 'A');\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n}",PARTIAL_ACCEPTED,35,540
1278701176462172160,c718a5e15c13709ac252b40e283fb2aa1038ea11b52a4e636a057e3e1f4edac7,2020-07-02 22:44:52,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <string.h>\n#include <iostream>\nusing namespace std;\n\nint z , q = 0;\nint huiwen(int z){\n    int  i , j , Z , NN , k = 1 , g = 0 , p=0;\n    for(i = 10;i >= 2;i--)\n    {\n        Z = z;\n        short s[90]={0};\n        while(Z){\n            s[p++]=Z%i;\n            Z/=i;\n        }\n\n        if(s[0] != 0  && s[p] != 0)\n        {\n            NN = 0 , j = p - 1;\n            while (NN < (p - 1)) {\n                if(s[NN++] == s[j--]){\n                    return k;\n                }\n            }\n\n            if(k == 1)\n            {\n               g += 1;\n            }\n        }\n\n        if(g >= 2){\n            cout << z << endl;\n            q++;\n            continue;\n        }\n    }\n    return 0;\n}\n\nint main(){\n    int t , z , b;\n    cin >> t >> b;\n    for(int i = 1;i <= t;i++){\n        z = b + i;\n        huiwen(z);\n        if(q == t){\n            break;\n        }\n    }\n\n    return 0;\n}\n",WRONG_ANSWER,35,424
1278702081819475968,a1d56106855db780882e1d55cddf2b290a70058a39946cf9586596170ecab4a0,2020-07-02 22:48:28,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include <algorithm>\n#include<math.h>\nusing namespace std;\nstring f, m, e = \""\"";\nint n, t = 0;\nint a = 0;\nchar c;\nint main(){\n    cin >>n;\n    for (int i = 1; i < 301; i++) {\n        int x;\n        x = i * i;\n        while (true) {\n            x = x % n;\n            if(n > 9){\n            c = (char)(n + 55);\n            }\n            else {\n            c = n + '0';\n            }\n            if ((x /= n) > 0) {\n                f = c + f;\n            }\n            else {\n                f = c + f;\n                break;\n            }\n        }\n        e = f;\n        reverse(f.begin(), f.end());\n\n        if (e == f) {\n            f = \""\"";\n            while (true) {\n                i = i % n;\n                if ( n > 9) {\n                    c = (char)(n + 55);\n                }\n                else {\n                    c = n + '0';\n                }\n                if ((i /= n) > 0) {\n                    f = c + f;\n                }\n                else {\n                    f = c + f;\n                    break;\n                }\n            }\n            cout << f << \"" \"" ;\n            cout << e << endl;\n\n        }\n    }\n\n    return 0;\n}\n\n",TIME_LIMIT_EXCEEDED,0,0
1278703617505157120,a1d56106855db780882e1d55cddf2b290a70058a39946cf9586596170ecab4a0,2020-07-02 22:54:34,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include <algorithm>\n#include<math.h>\n\nusing namespace std;\n\nint main() {\n    int B = 0;\n    int pow = 0;\n    int tmp = 0;\n    char c;\n    string str = \""\"";\n    string s;\n    cin >> B;\n    for (int i = 1; i < 301; i++) {\n        pow = i * i;\n        str = \""\"";\n        while (true) {\n            tmp = pow % B;\n            if(tmp > 9){\n            c = (char)(tmp + 55);\n            }\n            else {\n            c = tmp + '0';\n            }\n            if ((pow /= B) > 0) {\n                str = c + str;\n            }\n            else {\n                str = c + str;\n                break;\n            }\n        }\n        s = str;\n        reverse(s.begin(), s.end());\n        string ss = str;\n        if (str == s) {\n            str = \""\"";\n            int hahaha = i;\n            while (true) {\n                tmp = hahaha % B;\n                if (tmp > 9) {\n                    c = (char)(tmp + 55);\n                }\n                else {\n                    c = tmp + '0';\n                }\n                if ((hahaha /= B) > 0) {\n                    str = c + str;\n                }\n                else {\n                    str = c + str;\n                    break;\n                }\n            }\n            cout << str << \"" \"" ;\n            cout << ss << endl;\n\n        }\n    }\n    return 0;\n}",ACCEPTED,38,424
1278703805812629504,a1d56106855db780882e1d55cddf2b290a70058a39946cf9586596170ecab4a0,2020-07-02 22:55:19,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include <algorithm>\n\nusing namespace std;\n\n\nint main() {\n\tint N=0;\n\tint S=0;\n\tint tmp=0;\n\tint flag = 0;\n\tint transfo=0;\n\tchar c;\n\tstring str=\""\"";\n\tstring s;\n\tint count = 0;\n\tcin >> N >> S;\n\twhile (count < N) {\n\t\tflag = 0;\n\t\tS++;\n\t\tfor (int i = 2; i <= 10; i++) {\n\t\t\ttransfo = S;\n\t\t\tstr = \""\"";\n\t\t\twhile (true) {\n\t\t\t\ttmp = transfo % i;\n\t\t\t\tc = tmp + '0';\n\t\t\t\tif ((transfo /= i) > 0) {\n\t\t\t\t\tstr = c + str;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tstr = c + str;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\ts = str;\n\t\t\treverse(s.begin(), s.end());\n\t\t\tif (str == s) {\n\t\t\t\tflag++;\n\t\t\t}\n\t\t\t\n\t\t}\n\t\tif (flag >= 2) {\n\t\t\tcout << S << endl;\n\t\t\tcount++;\n\t\t\tcontinue;\n\t\t}\n\t\t\n\t\t\n\t}\n}",ACCEPTED,34,512
1278703893649752064,769a5633f3f76c88163c10ba96b281ae92c033baa24697a766f3d547fe850076,2020-07-02 22:55:40,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstring>\nusing namespace std;\n\nint number[110];            //作为全局变量可在调用change（）后更新\nint len1;                //记录转换后数组的长度\n\nint change(int a, int n)      //转化进制 转换后为倒序\n{\n\tmemset(number, 0, sizeof(number));                //数组归零\n\tlen1=0;                                    //长度归零\n\tint temp{ a };\n\tdo\n\t{\n\t\tnumber[len1] = temp % n;\n\t\ttemp /= n;\n\t\tlen1++;\n\t} while (temp != 0);\n\treturn 0;                \n}\n\nbool judge(int a[],int b) {                    //判断回文数(参数为需判断的数组和数组里数字的有效位数\n\tfor (int i{ 0 }; i < b / 2+1; i++) {\n\t\tif (number[i] != number[b - i - 1]) {\n\t\t\treturn 0;                    //如果number[i]不等于和它对应的number[len-i-1]位置，返回false\n\t\t}\n\t}\n\treturn 1;\n}\n\nint main() {\n\tint B;\n\tcin >> B;                                         //十进制数\n\n\tfor (int i{ 1 }; i < 301; i++) {\n\t\tchange(i*i, B);                        //更新数组和长度\n\t\tif (judge(number,len1) == 1) {\n\t\t\tcout << i << \"" \"";\n\t\t\tfor (int k{ 0 }; k < len1; k++) {\n\t\t\t\tif (number[k] < 10) {              //小于10输出数字\n\t\t\t\t\tcout << number[k];\n\t\t\t\t}\n\t\t\t\telse {                            //大于10输出大写字母\n\t\t\t\t\tcout << (char)(number[k] - 10 + 'A');\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n}",PARTIAL_ACCEPTED,40,424
1278704489698099200,769a5633f3f76c88163c10ba96b281ae92c033baa24697a766f3d547fe850076,2020-07-02 22:58:02,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstring>\nusing namespace std;\n\nint number[110];            //作为全局变量可在调用change（）后更新\nint len1;                //记录转换后数组的长度\n\nvoid change(int a, int n)      //转化进制 转换后为倒序\n{\n\tmemset(number, 0, sizeof(number));                //数组归零\n\tlen1=0;                                    //长度归零\n\tint temp{ a };\n\tdo\n\t{\n\t\tnumber[len1] = temp % n;\n\t\ttemp /= n;\n\t\tlen1++;\n\t} while (temp != 0);\n}\n\nbool judge(int a[],int b) {                    //判断回文数(参数为需判断的数组和数组里数字的有效位数\n\tfor (int i{ 0 }; i < b / 2+1; i++) {\n\t\tif (number[i] != number[b - i - 1]) {\n\t\t\treturn 0;                    //如果number[i]不等于和它对应的number[len-i-1]位置，返回false\n\t\t}\n\t}\n\treturn 1;\n}\n\nint main() {\n\tint B;\n\tcin >> B;                                         //十进制数\n\n\tfor (int i{ 1 }; i < 301; i++) {\n\t\tchange(i*i, B);                        //更新数组和长度\n\t\tif (judge(number,len1) == 1) {\n\t\t\tcout << i << \"" \"";\n\t\t\tfor (int k{ 0 }; k < len1; k++) {\n\t\t\t\tif (number[k] < 10) {              //小于10输出数字\n\t\t\t\t\tcout << number[k];\n\t\t\t\t}\n\t\t\t\telse {                            //大于10输出大写字母\n\t\t\t\t\tcout << (char)(number[k] - 10 + 'A');\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n}",PARTIAL_ACCEPTED,40,384
1278705693253632000,c718a5e15c13709ac252b40e283fb2aa1038ea11b52a4e636a057e3e1f4edac7,2020-07-02 23:02:49,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n\nbool huiwen(int n,int k){\n    short res[150]={0},p=0;\n    while(n){\n        res[p++]=n%k;\n        n/=k;\n    }\n    int i=0,j=p-1;\n    for(i<j;i++;j--)\n        if(res[i]!=res[j])\n            return 0;\n    return 1;\n}\n\nint main(){\n    int n,s;\n    cin>>n>>s;\n    int ans = 0;\n    for(int i=s+1;ans!=n;i++){\n        int cnt=0;\n        for(int j=2;j<=10&&cnt<2;j++){\n            if(huiwen(i,j))\n                cnt++;\n        }\n        if(cnt>=2)\n            printf(\""%d\\n\"",i);\n                    ans++;\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,25,424
1278705938221957120,c718a5e15c13709ac252b40e283fb2aa1038ea11b52a4e636a057e3e1f4edac7,2020-07-02 23:03:47,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n\nbool huiwen(int n,int k){\n    short res[150]={0},p=0;\n    while(n){\n        res[p++]=n%k;\n        n/=k;\n    }\n    int i=0,j=p-1;\n    while(i<j)\n        if(res[i++]!=res[j--])\n            return 0;\n    return 1;\n}\n\nint main(){\n    int n,s;\n    cin>>n>>s;\n    int ans = 0;\n    for(int i=s+1;ans!=n;i++){\n        int cnt=0;\n        for(int j=2;j<=10&&cnt<2;j++){\n            if(huiwen(i,j))\n                cnt++;\n        }\n        if(cnt>=2)\n            printf(\""%d\\n\"",i);\n                    ans++;\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,21,384
1278706240878739456,c718a5e15c13709ac252b40e283fb2aa1038ea11b52a4e636a057e3e1f4edac7,2020-07-02 23:04:59,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n\nbool ispal(int n,int k){\n    short res[100]={0},p=0;\n    while(n){\n        res[p++]=n%k;\n        n/=k;\n    }\n    int i=0,j=p-1;\n    while(i<j)\n        if(res[i++]!=res[j--])return 0;        \n    return 1;\n}\n\nint main(){\n    int n,s;\n    cin>>n>>s;\n    int ans=0;\n    for(int i=s+1;ans!=n;i++){\n        int cnt=0;\n        for(int j=2;j<=10&&cnt<2;j++){\n            if(ispal(i,j))cnt++;\n        }\n        if(cnt>=2)printf(\""%d\\n\"",i),ans++; \n    }\n    return 0;\n}",ACCEPTED,39,500
1278706706798804992,c718a5e15c13709ac252b40e283fb2aa1038ea11b52a4e636a057e3e1f4edac7,2020-07-02 23:06:50,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n\nbool ispal(int n,int k){\n    short res[90]={0},p=0;\n    while(n){\n        res[p++]=n%k;\n        n/=k;\n    }\n    int i=0,j=p-1;\n    while(i<j)\n        if(res[i++]!=res[j--])return 0;        \n    return 1;\n}\n\nint main(){\n    int n,s;\n    cin>>n>>s;\n    int ans=0;\n    for(int i=s+1;ans!=n;i++){\n        int cnt=0;\n        for(int j=2;j<=10&&cnt<2;j++){\n            if(ispal(i,j))cnt++;\n        }\n        if(cnt>=2)printf(\""%d\\n\"",i),ans++; \n    }\n    return 0;\n}",ACCEPTED,39,512
1278707280961273856,c718a5e15c13709ac252b40e283fb2aa1038ea11b52a4e636a057e3e1f4edac7,2020-07-02 23:09:07,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n\nbool huiwen(int n,int k){\n    short res[90]={0},p=0;\n    while(n){\n        res[p++]=n%k;\n        n/=k;\n    }\n    int i=0,j=p-1;\n    while(i<j)\n        if(res[i++]!=res[j--])return 0;        \n    return 1;\n}\n\nint main(){\n    int n,s;\n    cin>>n>>s;\n    int ans=0;\n    for(int i=s+1;ans!=n;i++){\n        int cnt=0;\n        for(int j=2;j<=10&&cnt<2;j++){\n            if(huiwen(i,j))cnt++;\n        }\n        if(cnt>=2)printf(\""%d\\n\"",i),ans++; \n    }\n    return 0;\n}",ACCEPTED,31,424
1278708561419370496,c718a5e15c13709ac252b40e283fb2aa1038ea11b52a4e636a057e3e1f4edac7,2020-07-02 23:14:12,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n\nbool huiwen(int n,int l){\n    short res[90]={0},q=0 , m = 1;\n    while(n){\n        res[q++]=n%l;\n        n/=l;\n    }\n    int i=0,j=q-1;\n    while(i<j)\n        if(res[i++]!=res[j--])\n            return 0;\n    return m;\n}\n\nint main(){\n    int s,z;\n    cin>>s>>z;\n    int ans=0;\n    for(int i=z+1;ans!=s;i++){\n        int cnt=0;\n        for(int j=2;j<=10&&cnt<2;j++){\n            if(huiwen(i,j))\n                cnt++;\n        }\n        if(cnt>=2)\n            printf(\""%d\\n\"",i);\n            ans++;\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,35,536
1278708856694177792,c718a5e15c13709ac252b40e283fb2aa1038ea11b52a4e636a057e3e1f4edac7,2020-07-02 23:15:23,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n\nbool huiwen(int n,int l){\n    short res[90]={0},q=0;\n    while(n){\n        res[q++]=n%l;\n        n/=l;\n    }\n    int i=0,j=q-1;\n    while(i<j)\n        if(res[i++]!=res[j--])\n            return 0;\n    return 1;\n}\n\nint main(){\n    int s,z;\n    cin>>s>>z;\n    int ans=0;\n    for(int i=z+1;ans!=s;i++){\n        int cnt=0;\n        for(int j=2;j<=10&&cnt<2;j++){\n            if(huiwen(i,j))\n                cnt++;\n        }\n        if(cnt>=2)\n            printf(\""%d\\n\"",i);\n            ans++;\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,33,512
1278709422732271616,c718a5e15c13709ac252b40e283fb2aa1038ea11b52a4e636a057e3e1f4edac7,2020-07-02 23:17:38,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n\nbool ispal(int n,int k){\n    short res[90]={0},p=0 , m = 1;\n    while(n){\n        res[p++]=n%k;\n        n/=k;\n    }\n    int i=0,j=p-1;\n    while(i<j)\n        if(res[i++]!=res[j--])\n            return 0;       \n    return m;\n}\n\nint main(){\n    int n,s;\n    cin>>n>>s;\n    int ans=0;\n    for(int i=s+1;ans!=n;i++){\n        int cnt=0;\n        for(int j=2;j<=10&&cnt<2;j++){\n            if(ispal(i,j))\n                cnt++; \n        }\n        if(cnt>=2)\n            printf(\""%d\\n\"",i),ans++; \n    }\n    return 0;\n}",ACCEPTED,34,424
1278710885961367552,387dee2d802731a9463bda4a7a8916ccc6198e105f0fa92dced456125caf20d0,2020-07-02 23:23:27,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\n\n\nint transfer(int x,int b);\nbool jugle();\nvoid print();\n\nconst int imax=300;\nint number[301];\n\nint transfer(int x,int b){\n    int temp=0;\nwhile(x){\n    number[++temp]=x%b;\n    x/=b;\n}\nnumber[0]=temp;\n}\n\nbool jugle(){\n    for(int i=0;i<=number[0];i++){\n        if(number[i+1]!=number[number[0]+1-i]) return false;\n    }\n    return true;\n}\n\nvoid print(){\n    for(int i=number[0];i>=1;i--){\n        if(number[i]<=9) cout<<number[i];\n        else\n        {\n            cout<<(char)(number[i]-10+'A');\n        }\n        \n    }\n\n}\nint main(){\n    int b;\n    cin>>b;\n    for(int i=1;i<=300;i++){\n        transfer(i*i,b);\n        if(jugle()){\n            transfer(i,b);\n            print();\n            cout<<\"" \"";\n            transfer(i*i,b);\n            print();\n        }\n\n    }\n  return 0;  \n}",WRONG_ANSWER,33,512
1278710967238582272,387dee2d802731a9463bda4a7a8916ccc6198e105f0fa92dced456125caf20d0,2020-07-02 23:23:46,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\n\n\nint transfer(int x,int b);\nbool jugle();\nvoid print();\n\nconst int imax=300;\nint number[301];\n\nint transfer(int x,int b){\n    int temp=0;\nwhile(x){\n    number[++temp]=x%b;\n    x/=b;\n}\nnumber[0]=temp;\n}\n\nbool jugle(){\n    for(int i=0;i<=number[0];i++){\n        if(number[i+1]!=number[number[0]+1-i]) return false;\n    }\n    return true;\n}\n\nvoid print(){\n    for(int i=number[0];i>=1;i--){\n        if(number[i]<=9) cout<<number[i];\n        else\n        {\n            cout<<(char)(number[i]-10+'A');\n        }\n        \n    }\n\n}\nint main(){\n    int b;\n    cin>>b;\n    for(int i=1;i<=300;i++){\n        transfer(i*i,b);\n        if(jugle()){\n            transfer(i,b);\n            print();\n            cout<<\"" \"";\n            transfer(i*i,b);\n            print();\n            put(\"" \"");\n        }\n\n    }\n  return 0;  \n}",COMPILE_ERROR,0,0
1278714796113846272,c5f006269b926e61241c8f09728f8ca99c23da829b64fc3aefb604777dcc38c7,2020-07-02 23:38:59,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\nint main()\n{\n    int n;\n    cin >> n;\n    int can;\n    int charcan;\n    int length;\n    int count = 0;\n    int index = 0;\n    bool IsHui;\n    int ns[50];\n    int nsy[50];\n    for(int i = 1; i <= 300; i++)\n    {\n        can = i*i;\n        ns[index] = can%n;\n        index++;\n        can = can/n;\n        while(can != 0)\n        {\n            ns[index] = can%n;\n            index++;\n            can = can/n;\n        }\n        length = index;\n        index = 0;\n        if(length == 1)\n        {\n            if(ns[0] < 10){cout << ns[0] << \"" \"" << ns[0] << endl;}\n            else\n            {\n                charcan = ns[0]+55;\n                cout << charcan << \"" \"" << charcan << endl;\n            }\n            continue;\n        }\n        for(int i = 0; i < length/2; i++)\n        {\n            if(ns[i] == ns[length-1-i]){count++;continue;}\n            else{break;}\n        }\n        IsHui = (count == length/2);\n        count = 0;\n        if(IsHui)\n        {\n            can = i;\n            nsy[index] = can%n;\n            index++;\n            can = can/n;\n            while(can != 0)\n            {\n                nsy[index] = can%n;\n                index++;\n                can = can/n;\n            }\n            for(int i = 0; i < index; i++)\n            {\n                if(nsy[index-1-i] < 10){cout << nsy[index-1-i];}\n                else\n                {\n                    charcan = nsy[index-1-i] + 55;\n                    cout << charcan;\n                }\n            }\n            cout << \"" \"";\n            for(int i = 0; i < length; i++)\n            {\n                if(ns[length-1-i] < 10){cout << ns[length-1-i];} \n                else\n                {\n                    charcan = ns[length-1-i] + 55;\n                    cout << charcan;\n                }\n            }\n            cout << endl;\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,38,420
1278715815669456896,c5f006269b926e61241c8f09728f8ca99c23da829b64fc3aefb604777dcc38c7,2020-07-02 23:43:02,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\nint main()\n{\n    int n;\n    cin >> n;\n    int can;\n    int charcan;\n    int length;\n    int count = 0;\n    int index = 0;\n    bool IsHui;\n    int ns[50];\n    int nsy[50];\n    for(int i = 1; i <= 300; i++)\n    {\n        can = i*i;\n        ns[index] = can%n;\n        index++;\n        can = can/n;\n        while(can != 0)\n        {\n            ns[index] = can%n;\n            index++;\n            can = can/n;\n        }\n        length = index;\n        index = 0;\n        if(length == 1)\n        {\n            can = i;\n            nsy[index] = can%n;\n            index++;\n            can = can/n;\n            while(can != 0)\n            {\n                nsy[index] = can%n;\n                index++;\n                can = can/n;\n            }\n            for(int i = 0; i < index; i++)\n            {\n                if(nsy[index-1-i] < 10){cout << nsy[index-1-i];}\n                else\n                {\n                    charcan = nsy[index-1-i] + 55;\n                    cout << charcan;\n                }\n            }\n            cout << \"" \"";\n            index = 0;\n            if(ns[0] < 10){cout << ns[0] << endl;}\n            else\n            {\n                charcan = ns[0]+55;\n                cout << charcan << endl;\n            }\n            continue;\n        }\n        for(int i = 0; i < length/2; i++)\n        {\n            if(ns[i] == ns[length-1-i]){count++;continue;}\n            else{break;}\n        }\n        IsHui = (count == length/2);\n        count = 0;\n        if(IsHui)\n        {\n            can = i;\n            nsy[index] = can%n;\n            index++;\n            can = can/n;\n            while(can != 0)\n            {\n                nsy[index] = can%n;\n                index++;\n                can = can/n;\n            }\n            for(int i = 0; i < index; i++)\n            {\n                if(nsy[index-1-i] < 10){cout << nsy[index-1-i];}\n                else\n                {\n                    charcan = nsy[index-1-i] + 55;\n                    cout << charcan;\n                }\n            }\n            cout << \"" \"";\n            index = 0;\n            for(int i = 0; i < length; i++)\n            {\n                if(ns[length-1-i] < 10){cout << ns[length-1-i];} \n                else\n                {\n                    charcan = ns[length-1-i] + 55;\n                    cout << charcan;\n                }\n            }\n            cout << endl;\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,32,396
1278715883470381056,c5f006269b926e61241c8f09728f8ca99c23da829b64fc3aefb604777dcc38c7,2020-07-02 23:43:18,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\nint main()\n{\n    int n;\n    cin >> n;\n    int can;\n    int charcan;\n    int length;\n    int count = 0;\n    int index = 0;\n    bool IsHui;\n    int ns[50];\n    int nsy[50];\n    for(int i = 1; i <= 300; i++)\n    {\n        can = i*i;\n        ns[index] = can%n;\n        index++;\n        can = can/n;\n        while(can != 0)\n        {\n            ns[index] = can%n;\n            index++;\n            can = can/n;\n        }\n        length = index;\n        index = 0;\n        if(length == 1)\n        {\n            can = i;\n            nsy[index] = can%n;\n            index++;\n            can = can/n;\n            while(can != 0)\n            {\n                nsy[index] = can%n;\n                index++;\n                can = can/n;\n            }\n            for(int i = 0; i < index; i++)\n            {\n                if(nsy[index-1-i] < 10){cout << nsy[index-1-i];}\n                else\n                {\n                    charcan = nsy[index-1-i] + 55;\n                    cout << charcan;\n                }\n            }\n            cout << \"" \"";\n            index = 0;\n            if(ns[0] < 10){cout << ns[0] << endl;}\n            else\n            {\n                charcan = ns[0]+55;\n                cout << charcan << endl;\n            }\n            continue;\n        }\n        for(int i = 0; i < length/2; i++)\n        {\n            if(ns[i] == ns[length-1-i]){count++;continue;}\n            else{break;}\n        }\n        IsHui = (count == length/2);\n        count = 0;\n        if(IsHui)\n        {\n            can = i;\n            nsy[index] = can%n;\n            index++;\n            can = can/n;\n            while(can != 0)\n            {\n                nsy[index] = can%n;\n                index++;\n                can = can/n;\n            }\n            for(int i = 0; i < index; i++)\n            {\n                if(nsy[index-1-i] < 10){cout << nsy[index-1-i];}\n                else\n                {\n                    charcan = nsy[index-1-i] + 55;\n                    cout << charcan;\n                }\n            }\n            cout << \"" \"";\n            index = 0;\n            for(int i = 0; i < length; i++)\n            {\n                if(ns[length-1-i] < 10){cout << ns[length-1-i];} \n                else\n                {\n                    charcan = ns[length-1-i] + 55;\n                    cout << charcan;\n                }\n            }\n            cout << endl;\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,41,512
1278715963250245632,387dee2d802731a9463bda4a7a8916ccc6198e105f0fa92dced456125caf20d0,2020-07-02 23:43:37,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint n;\nint number[301];\nvoid transfer(int a,int b){\n    int r=0;\n    while(a){\n        number[++r]=a%b;\n        a/=b;\n    }\n    number[0]=r;\n}\nbool change(){\n    for(int i=1;i<=number[0];i++){\n    \tif(number[i]!=number[number[0]+1-i]) return false;\n    }\n    return true;\n}\nvoid print(){\n    for(int i=number[0];i>=1;i--){\n        if(number[i]<=9) \n            cout<<number[i];\n        else \n            cout<<(char)(number[i]-10+'A');\n    }\n} \nint main() {\n\tcin>>n;\n\tfor(int i=1;i<=300;i++){\n    \ttransfer(i*i,n);\n    \tif(change()){\n        \ttransfer(i,n);\n\t        print();\n\t        cout<<' ';\n\t        transfer(i*i,n);\n\t        print();\n\t        puts(\""\"");\n\t\t}\n\t}\n    return 0;\n}",ACCEPTED,30,492
1278726138283622400,989a11d024c67cfa5499e5a2c66c4b5ade7a2ddae0e01870815d219983b30ddf,2020-07-03 00:24:03,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint n, s;\n\tcin >> n;\n\tcin >> s;\n\tint i, j, k; int num2[1000]; int g;\n\tint num1; int sum; int num; int sum1;\n\tnum = 0; sum = s + 1; num1 = 0;\n\twhile(num1<n)\n\t{   \n\t\tfor (i = 2; i <= 10; i++)\n\t\t{\n\t\t\tsum1 = sum;\n\t\t\tk = 1;\n\t\t\twhile (sum1 > 0)\n\t\t\t{\n\t\t\t\tnum2[k] = sum1%i;\n\t\t\t\tsum1 = sum1 / i;\n\t\t\t\tk++;\n\t\t\t}\n\t\t\tk = k - 1;\n\t\t\tg = 1;\n\t\t\tfor (j = 1; j <= k; j++)\n\t\t\t{\n\t\t\t\tif (num2[j] != num2[1 + k - j]) { g = 0; break; }\n\t\t\t}\n\t\t\tif (g == 1)num++;\n\t\t\tif (num == 2) { cout << sum << endl; num1 = num1 + 1; break; }\n\t\t}\n\t\tsum = sum + 1;\n\t\tnum = 0;\n\t}\n\treturn 0;\n}",ACCEPTED,37,512
1278736689239875584,16228dd118ca28b2c17457d3030101e7c97f3b55984144a0fc54cf7654383981,2020-07-03 01:05:59,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n#include<string.h>\nint main()\n{\n\tvoid transform(int num, int B, char *str);\n\tint B, i, len; \n\tchar str[301]={'\\0'};\n\tscanf(\""%d\"", &B);\n\tfor (i = 1;i <= 300;i++)\n\t{\n\t\tint flag = 1;\n\t\ttransform(i*i, B, str);\n\t\tlen = strlen(str);\n\t\tfor (int j = 0;j <= len / 2;j++)\n\t\t\tif (str[j] != str[len - 1 - j])\n            flag = 0;\n\t\tif (flag == 1)\n\t\t{\n\t\t\tchar num1[301];\n\t\t\ttransform(i, B, num1);\n            sort(num1);\n\t\t\tprintf(\""%s %s\\n\"", num1, str);\n\t\t}\n\t}\n\treturn 0;\n}\nvoid transform(int num, int B, char *str)\n{\n\tint i;\n\tfor (i = 0;(num / B) != 0;i++)\n\t{\n\t\tstr[i] ='0'+num % B;\n\t\tnum = num / B;\n\t}\n}\nsortstr(char *str)\n{\n    int i;\n    for(i=0;i<=strlen(str)/2;i++)\n    {\n        char temp;\n        temp=str[i];\n        str[i]=str[strlen(str)-1-i];\n        str[strlen(str)-1-i]=temp;\n    }\n}",COMPILE_ERROR,0,0
1278736883545202688,16228dd118ca28b2c17457d3030101e7c97f3b55984144a0fc54cf7654383981,2020-07-03 01:06:45,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n#include<string.h>\nint main()\n{\n    void sortstr(char *str);\n\tvoid transform(int num, int B, char *str);\n\tint B, i, len; \n\tchar str[301]={'\\0'};\n\tscanf(\""%d\"", &B);\n\tfor (i = 1;i <= 300;i++)\n\t{\n\t\tint flag = 1;\n\t\ttransform(i*i, B, str);\n\t\tlen = strlen(str);\n\t\tfor (int j = 0;j <= len / 2;j++)\n\t\t\tif (str[j] != str[len - 1 - j])\n            flag = 0;\n\t\tif (flag == 1)\n\t\t{\n\t\t\tchar num1[301];\n\t\t\ttransform(i, B, num1);\n            sortstr(num1);\n\t\t\tprintf(\""%s %s\\n\"", num1, str);\n\t\t}\n\t}\n\treturn 0;\n}\nvoid transform(int num, int B, char *str)\n{\n\tint i;\n\tfor (i = 0;(num / B) != 0;i++)\n\t{\n\t\tstr[i] ='0'+num % B;\n\t\tnum = num / B;\n\t}\n}\nvoid sortstr(char *str)\n{\n    int i;\n    for(i=0;i<=strlen(str)/2;i++)\n    {\n        char temp;\n        temp=str[i];\n        str[i]=str[strlen(str)-1-i];\n        str[strlen(str)-1-i]=temp;\n    }\n}",WRONG_ANSWER,32,396
1278749624372756480,bbfadfd9c24b0239524971c96a0a74bf163dd60b841b0075882f18ff0834ec5f,2020-07-03 01:57:23,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <string>\nusing namespace std;\n\nint B;\nchar a[19]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I'};\n\nbool huiw(int n){\n    int pos=-1;\n    string b=\""                            \"";\n    while (n>0) {\n        pos++;\n        b[pos]=a[n%B];\n        n/=B;\n\n    }\n    for(int i=0;i<=pos;i++){\n        if(b[i]!=b[pos-i])\n            return 0;\n    }\n    return 1;\n}\nint main(){\n    cin>>B;\n    for(int i=1;i<300;i++)\n        if(huiw(i) && huiw(i*i))\n            cout<<i<<' '<<i*i<<endl;\n\n}\n",WRONG_ANSWER,35,512
1278767340781502464,5a10bccaf5a9647c28ad97355d00f2a39ab3ba64f7b21f70896bc5427491236c,2020-07-03 03:07:47,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\n\n\nint main() {\n\tchar after_num[100] = {'a'};\n\tint i = 0;\n\tint system_num = 0;\n\tcin >> system_num;\n\tfor (int number = 1; number <= 300; number++) {\n\t\tint double_number = number * number;\n\t\twhile (double_number > 0) {\n\t\t\t\n\t\t\tswitch (double_number % system_num)\n\t\t\t{\n\t\t\tcase 0:\n\t\t\tcase 1:\n\t\t\tcase 2:\n\t\t\tcase 3:\n\t\t\tcase 4:\n\t\t\tcase 5:\n\t\t\tcase 6:\n\t\t\tcase 7:\n\t\t\tcase 8:\n\t\t\tcase 9:after_num[i] = double_number % system_num; break;\n\t\t\tcase 10:after_num[i] = 'A'; break;\n\t\t\tcase 11:after_num[i] = 'B'; break;\n\t\t\tcase 12:after_num[i] = 'C'; break;\n\t\t\tcase 13:after_num[i] = 'D'; break;\n\t\t\tcase 14:after_num[i] = 'E'; break;\n\t\t\tcase 15:after_num[i] = 'F'; break;\n\t\t\tcase 16:after_num[i] = 'G'; break;\n\t\t\tcase 17:after_num[i] = 'H'; break;\n\t\t\tcase 18:after_num[i] = 'I'; break;\n\t\t\tcase 19:after_num[i] = 'J'; break;\n\t\t\t}\n\t\t\tdouble_number = double_number / system_num;\n\t\t\ti++;\n\t\t}\n\t\tint count = 0;\n\t\tfor (int i = 0; i < 100; i++) {\n\t\t\tif (after_num[i] != 'a') {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tint flag = 0;\n\t\tfor (int j = 0; j < count; j++) {\n\t\t\tif (after_num[j] == after_num[count - j - 1]) {\n\t\t\t\tflag++;\n\t\t\t}\n\t\t}\n\t\tif (flag == count) {\n\t\t\tcout << number << \"" \"";\n\t\t\tfor (int i = 0; i < count; i++) {\n\t\t\t\tcout << after_num[i];\n\t\t\t}\n\t\t}\n\n\t}\n\t\n\n}",SEGMENTATION_FAULT,39,424
1278767909722054656,5a10bccaf5a9647c28ad97355d00f2a39ab3ba64f7b21f70896bc5427491236c,2020-07-03 03:10:02,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\n\n\nint main() {\n\tchar* after_num = new char[1000];\n\tint i = 0;\n\tint system_num = 0;\n\tcin >> system_num;\n\tfor (int number = 1; number <= 300; number++) {\n\t\tint double_number = number * number;\n\t\twhile (double_number > 0) {\n\t\t\t\n\t\t\tswitch (double_number % system_num)\n\t\t\t{\n\t\t\tcase 0:\n\t\t\tcase 1:\n\t\t\tcase 2:\n\t\t\tcase 3:\n\t\t\tcase 4:\n\t\t\tcase 5:\n\t\t\tcase 6:\n\t\t\tcase 7:\n\t\t\tcase 8:\n\t\t\tcase 9:after_num[i] = double_number % system_num; break;\n\t\t\tcase 10:after_num[i] = 'A'; break;\n\t\t\tcase 11:after_num[i] = 'B'; break;\n\t\t\tcase 12:after_num[i] = 'C'; break;\n\t\t\tcase 13:after_num[i] = 'D'; break;\n\t\t\tcase 14:after_num[i] = 'E'; break;\n\t\t\tcase 15:after_num[i] = 'F'; break;\n\t\t\tcase 16:after_num[i] = 'G'; break;\n\t\t\tcase 17:after_num[i] = 'H'; break;\n\t\t\tcase 18:after_num[i] = 'I'; break;\n\t\t\tcase 19:after_num[i] = 'J'; break;\n\t\t\t}\n\t\t\tdouble_number = double_number / system_num;\n\t\t\ti++;\n\t\t}\n\t\tint count = 0;\n\t\tfor (int i = 0; i < 100; i++) {\n\t\t\tif (after_num[i] != 'a') {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tint flag = 0;\n\t\tfor (int j = 0; j < count; j++) {\n\t\t\tif (after_num[j] == after_num[count - j - 1]) {\n\t\t\t\tflag++;\n\t\t\t}\n\t\t}\n\t\tif (flag == count) {\n\t\t\tcout << number << \"" \"";\n\t\t\tfor (int i = 0; i < count; i++) {\n\t\t\t\tcout << after_num[i];\n\t\t\t}\n\t\t}\n\n\t}\n\t\n\n}",WRONG_ANSWER,36,424
1278769565662633984,5a10bccaf5a9647c28ad97355d00f2a39ab3ba64f7b21f70896bc5427491236c,2020-07-03 03:16:37,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\n\n\nint main() {\n\tchar* after_num = new char[1000];\n\tfor (int k = 0; k < 1000; k++) {\n\t\tafter_num[k] = 'a';\n\t}\n\tint i = 0;\n\tint system_num = 0;\n\tcin >> system_num;\n\tfor (int number = 1; number <= 300; number++) {\n\t\tint double_number = number * number;\n\t\twhile (double_number > 0) {\n\t\t\t\n\t\t\tswitch (double_number % system_num)\n\t\t\t{\n\t\t\tcase 0:\n\t\t\tcase 1:\n\t\t\tcase 2:\n\t\t\tcase 3:\n\t\t\tcase 4:\n\t\t\tcase 5:\n\t\t\tcase 6:\n\t\t\tcase 7:\n\t\t\tcase 8:\n\t\t\tcase 9:after_num[i] = double_number % system_num; break;\n\t\t\tcase 10:after_num[i] = 'A'; break;\n\t\t\tcase 11:after_num[i] = 'B'; break;\n\t\t\tcase 12:after_num[i] = 'C'; break;\n\t\t\tcase 13:after_num[i] = 'D'; break;\n\t\t\tcase 14:after_num[i] = 'E'; break;\n\t\t\tcase 15:after_num[i] = 'F'; break;\n\t\t\tcase 16:after_num[i] = 'G'; break;\n\t\t\tcase 17:after_num[i] = 'H'; break;\n\t\t\tcase 18:after_num[i] = 'I'; break;\n\t\t\tcase 19:after_num[i] = 'J'; break;\n\t\t\t}\n\t\t\tdouble_number = double_number / system_num;\n\t\t\ti++;\n\t\t}\n\t\tint count = 0;\n\t\tfor (int i = 0; i < 100; i++) {\n\t\t\tif (after_num[i] != 'a') {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tint flag = 0;\n\t\tfor (int j = 0; j < count; j++) {\n\t\t\tif (after_num[j] == after_num[count - j - 1]) {\n\t\t\t\tflag++;\n\t\t\t}\n\t\t}\n\t\tif (flag == count) {\n\t\t\tcout << number << \"" \"";\n\t\t\tfor (int i = 0; i < count; i++) {\n\t\t\t\tcout << after_num[i];\n\t\t\t}\n\t\t}\n\n\t}\n\t\n\n}",WRONG_ANSWER,40,424
1278771437702152192,5a10bccaf5a9647c28ad97355d00f2a39ab3ba64f7b21f70896bc5427491236c,2020-07-03 03:24:03,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#define FILE_BUFFER_LENGTH 30000\nusing namespace std;\n\n\nint main() {\n\tchar* after_num = new char[1000];\n\tfor (int k = 0; k < 1000; k++) {\n\t\tafter_num[k] = 'a';\n\t}\n\tint i = 0;\n\tint system_num = 0;\n\tcin >> system_num;\n\tfor (int number = 1; number <= 300; number++) {\n\t\tint double_number = number * number;\n\t\twhile (double_number > 0) {\n\t\t\t\n\t\t\tswitch (double_number % system_num)\n\t\t\t{\n\t\t\tcase 0:\n\t\t\tcase 1:\n\t\t\tcase 2:\n\t\t\tcase 3:\n\t\t\tcase 4:\n\t\t\tcase 5:\n\t\t\tcase 6:\n\t\t\tcase 7:\n\t\t\tcase 8:\n\t\t\tcase 9:after_num[i] = double_number % system_num; break;\n\t\t\tcase 10:after_num[i] = 'A'; break;\n\t\t\tcase 11:after_num[i] = 'B'; break;\n\t\t\tcase 12:after_num[i] = 'C'; break;\n\t\t\tcase 13:after_num[i] = 'D'; break;\n\t\t\tcase 14:after_num[i] = 'E'; break;\n\t\t\tcase 15:after_num[i] = 'F'; break;\n\t\t\tcase 16:after_num[i] = 'G'; break;\n\t\t\tcase 17:after_num[i] = 'H'; break;\n\t\t\tcase 18:after_num[i] = 'I'; break;\n\t\t\tcase 19:after_num[i] = 'J'; break;\n\t\t\t}\n\t\t\tdouble_number = double_number / system_num;\n\t\t\ti++;\n\t\t}\n\t\tint count = 0;\n\t\tfor (int i = 0; i < 100; i++) {\n\t\t\tif (after_num[i] != 'a') {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tint flag = 0;\n\t\tfor (int j = 0; j < count; j++) {\n\t\t\tif (after_num[j] == after_num[count - j - 1]) {\n\t\t\t\tflag++;\n\t\t\t}\n\t\t}\n\t\tif (flag == count) {\n\t\t\tcout << number << \"" \"";\n\t\t\tfor (int i = 0; i < count; i++) {\n\t\t\t\tcout << after_num[i];\n\t\t\t}\n\t\t}\n\n\t}\n\tdelete[] after_num;\n\t\n\n}",RUNTIME_ERROR,30,504
1278772334297546752,5a10bccaf5a9647c28ad97355d00f2a39ab3ba64f7b21f70896bc5427491236c,2020-07-03 03:27:37,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\n\n\nint main() {\n\tchar* after_num = new char[1000];\n\tfor (int k = 0; k < 1000; k++) {\n\t\tafter_num[k] = 'a';\n\t}\n\tint i = 0;\n\tint system_num = 0;\n\tcin >> system_num;\n\tfor (int number = 1; number <= 300; number++) {\n\t\tint double_number = number * number;\n\t\twhile (double_number > 0) {\n\t\t\t\n\t\t\tswitch (double_number % system_num)\n\t\t\t{\n\t\t\tcase 0:\n\t\t\tcase 1:\n\t\t\tcase 2:\n\t\t\tcase 3:\n\t\t\tcase 4:\n\t\t\tcase 5:\n\t\t\tcase 6:\n\t\t\tcase 7:\n\t\t\tcase 8:\n\t\t\tcase 9:after_num[i] = double_number % system_num; break;\n\t\t\tcase 10:after_num[i] = 'A'; break;\n\t\t\tcase 11:after_num[i] = 'B'; break;\n\t\t\tcase 12:after_num[i] = 'C'; break;\n\t\t\tcase 13:after_num[i] = 'D'; break;\n\t\t\tcase 14:after_num[i] = 'E'; break;\n\t\t\tcase 15:after_num[i] = 'F'; break;\n\t\t\tcase 16:after_num[i] = 'G'; break;\n\t\t\tcase 17:after_num[i] = 'H'; break;\n\t\t\tcase 18:after_num[i] = 'I'; break;\n\t\t\tcase 19:after_num[i] = 'J'; break;\n\t\t\t}\n\t\t\tdouble_number = double_number / system_num;\n\t\t\ti++;\n\t\t}\n\t\tint count = 0;\n\t\tfor (int i = 0; i < 100; i++) {\n\t\t\tif (after_num[i] != 'a') {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tint flag = 0;\n\t\tfor (int j = 0; j < count; j++) {\n\t\t\tif (after_num[j] == after_num[count - j - 1]) {\n\t\t\t\tflag++;\n\t\t\t}\n\t\t}\n\t\tif (flag == count) {\n\t\t\tcout << number << \"" \"";\n\t\t\tfor (int i = 0; i < count; i++) {\n\t\t\t\tcout << after_num[i];\n\t\t\t}\n\t\t}\n\n\t}\n\tdelete[] after_num;\n\t\n\n}\n",RUNTIME_ERROR,43,496
1278772551923204096,5a10bccaf5a9647c28ad97355d00f2a39ab3ba64f7b21f70896bc5427491236c,2020-07-03 03:28:29,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\n\n\nint main() {\n\tchar* after_num = new char[10000];\n\tfor (int k = 0; k < 1000; k++) {\n\t\tafter_num[k] = 'a';\n\t}\n\tint i = 0;\n\tint system_num = 0;\n\tcin >> system_num;\n\tfor (int number = 1; number <= 300; number++) {\n\t\tint double_number = number * number;\n\t\twhile (double_number > 0) {\n\t\t\t\n\t\t\tswitch (double_number % system_num)\n\t\t\t{\n\t\t\tcase 0:\n\t\t\tcase 1:\n\t\t\tcase 2:\n\t\t\tcase 3:\n\t\t\tcase 4:\n\t\t\tcase 5:\n\t\t\tcase 6:\n\t\t\tcase 7:\n\t\t\tcase 8:\n\t\t\tcase 9:after_num[i] = double_number % system_num; break;\n\t\t\tcase 10:after_num[i] = 'A'; break;\n\t\t\tcase 11:after_num[i] = 'B'; break;\n\t\t\tcase 12:after_num[i] = 'C'; break;\n\t\t\tcase 13:after_num[i] = 'D'; break;\n\t\t\tcase 14:after_num[i] = 'E'; break;\n\t\t\tcase 15:after_num[i] = 'F'; break;\n\t\t\tcase 16:after_num[i] = 'G'; break;\n\t\t\tcase 17:after_num[i] = 'H'; break;\n\t\t\tcase 18:after_num[i] = 'I'; break;\n\t\t\tcase 19:after_num[i] = 'J'; break;\n\t\t\t}\n\t\t\tdouble_number = double_number / system_num;\n\t\t\ti++;\n\t\t}\n\t\tint count = 0;\n\t\tfor (int i = 0; i < 100; i++) {\n\t\t\tif (after_num[i] != 'a') {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tint flag = 0;\n\t\tfor (int j = 0; j < count; j++) {\n\t\t\tif (after_num[j] == after_num[count - j - 1]) {\n\t\t\t\tflag++;\n\t\t\t}\n\t\t}\n\t\tif (flag == count) {\n\t\t\tcout << number << \"" \"";\n\t\t\tfor (int i = 0; i < count; i++) {\n\t\t\t\tcout << after_num[i];\n\t\t\t}\n\t\t}\n\n\t}\n\tdelete[] after_num;\n\t\n\n}",WRONG_ANSWER,27,512
1278772739664445440,5a10bccaf5a9647c28ad97355d00f2a39ab3ba64f7b21f70896bc5427491236c,2020-07-03 03:29:14,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\n\n\nint main() {\n\tchar* after_num = new char[10000];\n\tfor (int k = 0; k < 10000; k++) {\n\t\tafter_num[k] = 'a';\n\t}\n\tint i = 0;\n\tint system_num = 0;\n\tcin >> system_num;\n\tfor (int number = 1; number <= 300; number++) {\n\t\tint double_number = number * number;\n\t\twhile (double_number > 0) {\n\t\t\t\n\t\t\tswitch (double_number % system_num)\n\t\t\t{\n\t\t\tcase 0:\n\t\t\tcase 1:\n\t\t\tcase 2:\n\t\t\tcase 3:\n\t\t\tcase 4:\n\t\t\tcase 5:\n\t\t\tcase 6:\n\t\t\tcase 7:\n\t\t\tcase 8:\n\t\t\tcase 9:after_num[i] = double_number % system_num; break;\n\t\t\tcase 10:after_num[i] = 'A'; break;\n\t\t\tcase 11:after_num[i] = 'B'; break;\n\t\t\tcase 12:after_num[i] = 'C'; break;\n\t\t\tcase 13:after_num[i] = 'D'; break;\n\t\t\tcase 14:after_num[i] = 'E'; break;\n\t\t\tcase 15:after_num[i] = 'F'; break;\n\t\t\tcase 16:after_num[i] = 'G'; break;\n\t\t\tcase 17:after_num[i] = 'H'; break;\n\t\t\tcase 18:after_num[i] = 'I'; break;\n\t\t\tcase 19:after_num[i] = 'J'; break;\n\t\t\t}\n\t\t\tdouble_number = double_number / system_num;\n\t\t\ti++;\n\t\t}\n\t\tint count = 0;\n\t\tfor (int i = 0; i < 10000; i++) {\n\t\t\tif (after_num[i] != 'a') {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tint flag = 0;\n\t\tfor (int j = 0; j < count; j++) {\n\t\t\tif (after_num[j] == after_num[count - j - 1]) {\n\t\t\t\tflag++;\n\t\t\t}\n\t\t}\n\t\tif (flag == count) {\n\t\t\tcout << number << \"" \"";\n\t\t\tfor (int i = 0; i < count; i++) {\n\t\t\t\tcout << after_num[i];\n\t\t\t}\n\t\t}\n\n\t}\n\tdelete[] after_num;\n\t\n\n}",WRONG_ANSWER,54,512
1278841619237756928,772737140437a20aba427edf50cd963527a510d7ed0afb423d3831b534dc4f65,2020-07-03 08:02:56,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<math.h>\nusing namespace std;\n\nint main()\n{\n\tint i;   //控制循环\n\tint j;   //记录平方数的十进制\n\tint n=0;   //控制循环\n\tint m;   //记录要转化成的进制\n\tint l=0;   //控制循环\n\tint con = 0; //暂存值\n\tint p;   //控制循环\n\tint res = 0;      //记录商\n\tint result = 0;   //记录转化后的值\n\tint a[10];        //记录余数\n\tint b[10];        //放置转化后的数值的每一位数\n\tint c[10];        //放置原来数转化后的值\n\tcin >> m;\n\twhile (m < 2 || m>20)\n\t{\n\t\tcout << \""error,please enter again.\"" << endl;\n\t\tcin >> m;\n\t}\n\tfor (i = 1; i <= 300; i++)\n\t{\n\t\tj = i * i;\n\t\twhile (res != 0 || n == 0)\n\t\t{\n\t\t\tres = j / m;\n\t\t\ta[n] = j % m;\n\t\t\tj = res;\n\t\t\tn++;\n\t\t}\n\t\t/*for (l = 0; l < n; l++)\n\t\t{\n\t\t\tresult += int(a[l] * pow(m, l));\n\t\t}\n\t\tcout << i << \"" \"" << result << endl;\n\t\tfor (l = n ; l > 0; l--)\n\t\t{\n\t\t\tb[l - 1] = int(result / (pow(10, l - 1)));\n\t\t\tresult = result % int((pow(10, l - 1)));\n\t\t}*/\n\t\tfor (l = 0; l < (n / 2); l++)\n\t\t\tif (a[l] != a[n - l - 1])\n\t\t\t\tbreak;\n\t\tif (l == (n / 2))\n\t\t{\n\t\t\tres = 0;\n\t\t\tp = 0;\n\t\t\tcon = i;\n\t\t\twhile (res != 0 || p == 0)\n\t\t\t{\n\t\t\t\tres = con / m;\n\t\t\t\tc[p] = con % m;\n\t\t\t\tcon = res;\n\t\t\t\tp++;\n\t\t\t}\n\t\t\tfor(l=(p-1);l>=0;l--)\n\t\t\tcout<<c[l];\n\t\t\tcout<<\"" \"";\n\t\t\tfor (l = (n-1); l >=0; l--)\n\t\t\t\tcout << a[l];\n            if(i!=300)\n\t\t\tcout << endl;\n\t\t}\n\t\tn = 0;\n\t\tresult = 0;\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,34,424
1278841660639739904,772737140437a20aba427edf50cd963527a510d7ed0afb423d3831b534dc4f65,2020-07-03 08:03:06,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<math.h>\nusing namespace std;\n\nint main()\n{\n\tint i;   //控制循环\n\tint j;   //记录平方数的十进制\n\tint n=0;   //控制循环\n\tint m;   //记录要转化成的进制\n\tint l=0;   //控制循环\n\tint con = 0; //暂存值\n\tint p;   //控制循环\n\tint res = 0;      //记录商\n\tint result = 0;   //记录转化后的值\n\tint a[10];        //记录余数\n\tint b[10];        //放置转化后的数值的每一位数\n\tint c[10];        //放置原来数转化后的值\n\tcin >> m;\n\twhile (m < 2 || m>20)\n\t{\n\t\tcout << \""error,please enter again.\"" << endl;\n\t\tcin >> m;\n\t}\n\tfor (i = 1; i <= 300; i++)\n\t{\n\t\tj = i * i;\n\t\twhile (res != 0 || n == 0)\n\t\t{\n\t\t\tres = j / m;\n\t\t\ta[n] = j % m;\n\t\t\tj = res;\n\t\t\tn++;\n\t\t}\n\t\t/*for (l = 0; l < n; l++)\n\t\t{\n\t\t\tresult += int(a[l] * pow(m, l));\n\t\t}\n\t\tcout << i << \"" \"" << result << endl;\n\t\tfor (l = n ; l > 0; l--)\n\t\t{\n\t\t\tb[l - 1] = int(result / (pow(10, l - 1)));\n\t\t\tresult = result % int((pow(10, l - 1)));\n\t\t}*/\n\t\tfor (l = 0; l < (n / 2); l++)\n\t\t\tif (a[l] != a[n - l - 1])\n\t\t\t\tbreak;\n\t\tif (l == (n / 2))\n\t\t{\n\t\t\tres = 0;\n\t\t\tp = 0;\n\t\t\tcon = i;\n\t\t\twhile (res != 0 || p == 0)\n\t\t\t{\n\t\t\t\tres = con / m;\n\t\t\t\tc[p] = con % m;\n\t\t\t\tcon = res;\n\t\t\t\tp++;\n\t\t\t}\n\t\t\tfor(l=(p-1);l>=0;l--)\n\t\t\tcout<<c[l];\n\t\t\tcout<<\"" \"";\n\t\t\tfor (l = (n-1); l >=0; l--)\n\t\t\t\tcout << a[l];\n            if(i!=300)\n\t\t\tcout << endl;\n\t\t}\n\t\tn = 0;\n\t\tresult = 0;\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,40,396
1278851695650471936,bbfadfd9c24b0239524971c96a0a74bf163dd60b841b0075882f18ff0834ec5f,2020-07-03 08:42:58,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <string>\nusing namespace std;\n\nint B;\nchar a[19]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I'};\n\nbool huiw(int n){\n    int pos=-1;\n    string b=\""                               \"";\n    while (n>0) {\n        pos++;\n        b[pos]=a[n%B];\n        n/=B;\n\n    }\n    for(int i=0;i<=pos/2;i++){\n        if(b[i]!=b[pos-i])\n            return 0;\n    }\n    return 1;\n}\nint main(){\n    cin>>B;\n    for(int i=1;i<300;i++)\n        if(huiw(i*i))\n            cout<<i<<' '<<i*i<<endl;\n\n}\n",PARTIAL_ACCEPTED,38,512
1278858623961194496,772737140437a20aba427edf50cd963527a510d7ed0afb423d3831b534dc4f65,2020-07-03 09:10:30,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<math.h>\nusing namespace std;\n\nint main()\n{\n\tint i;   //控制循环\n\tint j;   //记录平方数的十进制\n\tint n=0;   //控制循环\n\tint m;   //记录要转化成的进制\n\tint l=0;   //控制循环\n\tint con = 0; //暂存值\n\tint p;   //控制循环\n\tint res = 0;      //记录商\n\tint result = 0;   //记录转化后的值\n\tint a[10];        //记录余数\n\tchar b[20] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\n\tint c[10];        //放置原来数转化后的值\n\tcin >> m;\n\tfor (i = 1; i <= 300; i++)\n\t{\n\t\tj = i * i;\n\t\twhile (res != 0 || n == 0)\n\t\t{\n\t\t\tres = j / m;\n\t\t\ta[n] = j % m;\n\t\t\tj = res;\n\t\t\tn++;\n\t\t}\n\t\t/*for (l = 0; l < n; l++)\n\t\t{\n\t\t\tresult += int(a[l] * pow(m, l));\n\t\t}\n\t\tcout << i << \"" \"" << result << endl;\n\t\tfor (l = n ; l > 0; l--)\n\t\t{\n\t\t\tb[l - 1] = int(result / (pow(10, l - 1)));\n\t\t\tresult = result % int((pow(10, l - 1)));\n\t\t}*/\n\t\tfor (l = 0; l < (n / 2); l++)\n\t\t\tif (a[l] != a[n - l - 1])\n\t\t\t\tbreak;\n\t\tif (l == (n / 2))\n\t\t{\n\t\t\tres = 0;\n\t\t\tp = 0;\n\t\t\tcon = i;\n\t\t\twhile (res != 0 || p == 0)\n\t\t\t{\n\t\t\t\tres = con / m;\n\t\t\t\tc[p] = con % m;\n\t\t\t\tcon = res;\n\t\t\t\tp++;\n\t\t\t}\n\t\t\tfor (l = (p - 1); l >= 0; l--)\n\t\t\t    cout << b[c[l]];\n\t\t\tcout<<\"" \"";\n\t\t\tfor (l = (n - 1); l >= 0; l--)\n\t\t\t\tcout << b[a[l]];\n\t\t\tcout << endl;\n\t\t}\n\t\tn = 0;\n\t\tresult = 0;\n\t}\n\treturn 0;\n}",ACCEPTED,38,492
1278859864313356288,772737140437a20aba427edf50cd963527a510d7ed0afb423d3831b534dc4f65,2020-07-03 09:15:26,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint i;   //控制循环\n\tint j = 0;   //记录找到的次数\n\tint m;   //记录要转化成的进制\n\tint n=0;   //记录转换后的位数\n\tint l = 0;   //控制循环\n\tint res = 0;      //记录商\n\tint g = 0;   //记录成为回文数的次数\n\tint a[10];        //记录余数\n\tint t;        //暂存数值\n\tint N;\n\tint S;\n\tcin >> N;\n\tcin >> S;\n\tfor (i = (S+1); j < N; i++)\n\t{\n\t\tfor (m = 2; m <= 10 ,g < 2; m++)\n\t\t{\n\t\t\tt = i;\n\t\t\twhile (res != 0 || n == 0)\n\t\t\t{\n\t\t\t\tres = t / m;\n\t\t\t\ta[n] = t % m;\n\t\t\t\tt = res;\n\t\t\t\tn++;\n\t\t\t}\n\t\t\tfor (l = 0; l < (n / 2); l++)\n\t\t\t\tif (a[l] != a[n - l - 1])\n\t\t\t\t\tbreak;\n\t\t\tif (l == (n / 2))\n\t\t\t{\n\t\t\t\tg++;\n\t\t\t\tif (g == 2)\n\t\t\t\t{\n\t\t\t\t\tcout << i << endl;\n\t\t\t\t\tj++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tn = 0;\n\t\t}\n\t\tg = 0;\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,28,512
1278865300940849152,772737140437a20aba427edf50cd963527a510d7ed0afb423d3831b534dc4f65,2020-07-03 09:37:02,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<fstream>\nusing namespace std;\nint main()\n{\n\tint i;   //控制循环\n\tint j = 0;   //记录找到的次数\n\tint m;   //记录要转化成的进制\n\tint n=0;   //记录转换后的位数\n\tint l = 0;   //控制循环\n\tint res = 0;      //记录商\n\tint g = 0;   //记录成为回文数的次数\n\tint a[1000];        //记录余数\n\tint t;        //暂存数值\n\tint N;\n\tint S;\n\tcin >> N;\n\tcin >> S;\n\tifstream in(\""dualpal.in\"");\n\tofstream out(\""dualpal.out\"");\n\tin >> N;\n\tin >> S;\n\tfor (i = (S+1); j < N; i++)\n\t{\n\t\tfor (m = 2; m <= 10&&g<2 ; m++)\n\t\t{\n\t\t\tt = i;\n\t\t\twhile (res != 0 || n == 0)\n\t\t\t{\n\t\t\t\tres = t / m;\n\t\t\t\ta[n] = t % m;\n\t\t\t\tt = res;\n\t\t\t\tn++;\n\t\t\t}\n\t\t\tfor (l = 0; l < (n / 2); l++)\n\t\t\t\tif (a[l] != a[n - l - 1])\n\t\t\t\t\tbreak;\n\t\t\tif (l == (n / 2))\n\t\t\t{\n\t\t\t\tg++;\n\t\t\t\tif (g == 2)\n\t\t\t\t{\n\t\t\t\t\tout << i << endl;\n\t\t\t\t\t//cout << i << endl;\n\t\t\t\t\tj++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tn = 0;\n\t\t}\n\t\tg = 0;\n\t}\n\treturn 0;\n}",WRONG_ANSWER,36,424
1278866964150149120,dc45081bb9d1bf2890cf7ccf2a5085a5972431a89a1343812baaeda9635a4048,2020-07-03 09:43:39,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cstring>\nusing namespace std;\nint main()\n{\n\tint squ,temp,c;\n\tint B;//进制\n\tint s1[20],s2[20];//，把平方数拆成位，s1装平方数的逆序，s2装平方数的正序\n\tchar s4[20];\n\tcin >> B;\n\tchar a[20]{ '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };//转进制用\n\tfor(int x = 1; x <= 300; x++)//穷举1-300的数\n\t{\n\t\tint m = 0;\n\t\tint k = 1,flag = 1;//flag用来标识是否为回文\n\t\tint p, q = 0;\n\t\tsqu = x * x;//得到平方数\n\t\ttemp = x;//暂存x\n\t\twhile (squ != 0)//求每一位数，逆序装进s1\n\t\t{\n\t\t\tc = squ % B;\n\t\t\tsqu /= B;\n\t\t\tm++;\n\t\t\ts1[m] = c;\n\t\t}\n\t\tfor (int j = m; j >= 1; j--)//正序装进s2\n\t\t{\n\t\t\ts2[j] = s1[k];\n\t\t\tk++;\n\t\t}\n\t\tfor (int i = 1; i <= m; i++)//比较s1与s2，是否为回文\n\t\t{\n\t\t\tif (s1[i] != s2[i])\n\t\t\t{\n\t\t\t\tflag = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (flag == 1)//平方数是回文了，进行输出（进制转换后）\n\t\t{\n\t\t\twhile (temp != 0)//转换x位B进制\n\t\t\t{\n\t\t\t\tp = temp % B;\n\t\t\t\ttemp /= B;\n\t\t\t\tq++;\n\t\t\t\ts4[q] = a[p];\n\t\t\t}\n\t\t\tfor (int c = q; c >= 1; c--)\n\t\t\t\tcout << s4[c];\n\t\t\tcout << \"" \"";\n\t\t\tfor (int d = m; d >= 1; d--)\n\t\t\t\tcout << a[s1[d]];\n\t\t\tcout << endl;\n\t\t}\n\t\tmemset(s1, 0, sizeof(s1));//对s1和s2进行清0\n\t\tmemset(s2, 0, sizeof(s1));\n\t}\n\treturn 0;\n}",ACCEPTED,38,512
1278874140654632960,4c0c1485fb193a1b54dc8aabc13e975e61dd8db3743718b879cd75060a30934e,2020-07-03 10:12:10,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<stdio.h>\n#include<string.h>\nint main()\n{\n\tchar str1[9999], str2[9999], k;\n\tint n, s, i, j,x, y,  z, t,sum ;//定义后面要用到的字母\n\twhile (scanf_s(\""%d%d\"", &n, &s))\n\t{\n\t\tfor (i = s + 1;; i++)\n\t\t{\n\t\t\tsum = 0;\n\t\t\t\tfor (j = 2; j <= 10; j++)//for循环\n\n\t\t\t\t{\n\t\t\t\t\tx = i; z = 0; t = 0;\n\t\t\t\t\twhile (x)\n\t\t\t\t\t{\n\t\t\t\t\t\ty = x % j;\n\t\t\t\t\t\tstr1[z++] = \""0123456789\""[y];\n\t\t\t\t\t\tx /= j;\n\t\t\t\t\t}\n\t\t\t\t\tstr1[z] = '\\0';\n\t\t\t\t\tfor (k = z - 1; k >= 0; k--)//\n\t\t\t\t\t\tstr2[t++] = str1[k];\n\t\t\t\t\tstr2[t] = '\\0';\n\t\t\t\t\tif (strcmp(str1, str2) == 0)\n\t\t\t\t\t\tsum++;\n\t\t\t\t}\n\t\t\tif (sum >= 2)\n\t\t\t{\n\t\t\t\tn--;\n\t\t\t\tprintf(\""%d\\n\"", i);\n\t\t\t}\n\t\t\tif (n == 0)\n\t\t\t\tbreak;\n\t\t}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1278874180567621632,bbfadfd9c24b0239524971c96a0a74bf163dd60b841b0075882f18ff0834ec5f,2020-07-03 10:12:19,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <string>\nusing namespace std;\n\nint B;\nchar a[19]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I'};\n\nstring huiw(int n){\n    string b=\""\"";\n    while (n>0) {\n        b+=a[n%B];\n        n/=B;\n    }\n    return b;\n}\nbool p(string b){\n    int pos = b.size();\n    for(int i=0;i<=pos/2;i++){\n        if(b[i]!=b[pos-i])\n            return 0;\n    }\n    return 1;\n}\nint main(){\n    cin>>B;\n    for(int i=1;i<300;i++)\n        if(p(huiw(i*i)))\n            cout<<huiw(i)<<' '<<huiw(i*i)<<endl;\n\n}\n",WRONG_ANSWER,41,504
1278874192487833600,4c0c1485fb193a1b54dc8aabc13e975e61dd8db3743718b879cd75060a30934e,2020-07-03 10:12:22,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<stdio.h>\n#include<string.h>\nint main()\n{\n\tchar str1[9999], str2[9999], k;\n\tint n, s, i, j,x, y,  z, t,sum ;//定义后面要用到的字母\n\twhile (scanf(\""%d%d\"", &n, &s))\n\t{\n\t\tfor (i = s + 1;; i++)\n\t\t{\n\t\t\tsum = 0;\n\t\t\t\tfor (j = 2; j <= 10; j++)//for循环\n\n\t\t\t\t{\n\t\t\t\t\tx = i; z = 0; t = 0;\n\t\t\t\t\twhile (x)\n\t\t\t\t\t{\n\t\t\t\t\t\ty = x % j;\n\t\t\t\t\t\tstr1[z++] = \""0123456789\""[y];\n\t\t\t\t\t\tx /= j;\n\t\t\t\t\t}\n\t\t\t\t\tstr1[z] = '\\0';\n\t\t\t\t\tfor (k = z - 1; k >= 0; k--)//\n\t\t\t\t\t\tstr2[t++] = str1[k];\n\t\t\t\t\tstr2[t] = '\\0';\n\t\t\t\t\tif (strcmp(str1, str2) == 0)\n\t\t\t\t\t\tsum++;\n\t\t\t\t}\n\t\t\tif (sum >= 2)\n\t\t\t{\n\t\t\t\tn--;\n\t\t\t\tprintf(\""%d\\n\"", i);\n\t\t\t}\n\t\t\tif (n == 0)\n\t\t\t\tbreak;\n\t\t}\n\t}\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,0,0
1278877373796122624,4c0c1485fb193a1b54dc8aabc13e975e61dd8db3743718b879cd75060a30934e,2020-07-03 10:25:00,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<stdio.h>\n#include<math.h>\n#include<string.h>\nint main()\n{\n\tchar str1[9999], str2[9999], k;\n\tint n, s, i, j,x, y,  z, t,sum ;//定义后面要用到的字母\n\tscanf_s(\""%d%d\"", &n, &s);//按题目要求输入数据\n\t\tfor (i = s + 1;; i++)//for循环进行嵌套\n\t\t{\n\t\t\tsum = 0;\n\t\t\tfor (j = 2; j <= 10; j++)//for循环\n\n\t\t\t\t{\n\t\t\t\t\tx = i; z = 0; t = 0;//给各种的定义字母进行初始化\n\t\t\t\t\twhile (x)//此操作进行各种进制之间的转换\n\t\t\t\t\t{\n\t\t\t\t\t\ty = x % j;\n\t\t\t\t\t\tstr1[z++] = \""0123456789\""[y];\n\t\t\t\t\t\tx=x/j;\n\t\t\t\t\t}\n\t\t\t\t\tstr1[z] = '\\0';\n\t\t\t\t\tfor (k = z - 1; k >= 0; k--)//\n\t\t\t\t\t\tstr2[t++] = str1[k];\n\t\t\t\t\tstr2[t] = '\\0';\n\t\t\t\t\tif (strcmp(str1, str2) == 0)\n\t\t\t\t\t\tsum=sum+1;//sum 进行叠加\n\t\t\t\t}\n\t\t\t\tif (sum >= 2)//当满足此题的超过两种进制的条件的时候，进行输出\n\t\t\t{\n\t\t\t\tn=n-1;\n\t\t\t\tprintf(\""%d\\n\"", i);\n\t\t\t\tif (n == 0)\n\t\t\t\t\tbreak;\n\t\t\t}\n\n\t\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1278877471036866560,4c0c1485fb193a1b54dc8aabc13e975e61dd8db3743718b879cd75060a30934e,2020-07-03 10:25:24,C,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<stdio.h>\n#include<math.h>\n#include<string.h>\nint main()\n{\n\tchar str1[9999], str2[9999], k;\n\tint n, s, i, j,x, y,  z, t,sum ;//定义后面要用到的字母\n\tscanf(\""%d%d\"", &n, &s);//按题目要求输入数据\n\t\tfor (i = s + 1;; i++)//for循环进行嵌套\n\t\t{\n\t\t\tsum = 0;\n\t\t\tfor (j = 2; j <= 10; j++)//for循环\n\n\t\t\t\t{\n\t\t\t\t\tx = i; z = 0; t = 0;//给各种的定义字母进行初始化\n\t\t\t\t\twhile (x)//此操作进行各种进制之间的转换\n\t\t\t\t\t{\n\t\t\t\t\t\ty = x % j;\n\t\t\t\t\t\tstr1[z++] = \""0123456789\""[y];\n\t\t\t\t\t\tx=x/j;\n\t\t\t\t\t}\n\t\t\t\t\tstr1[z] = '\\0';\n\t\t\t\t\tfor (k = z - 1; k >= 0; k--)//\n\t\t\t\t\t\tstr2[t++] = str1[k];\n\t\t\t\t\tstr2[t] = '\\0';\n\t\t\t\t\tif (strcmp(str1, str2) == 0)\n\t\t\t\t\t\tsum=sum+1;//sum 进行叠加\n\t\t\t\t}\n\t\t\t\tif (sum >= 2)//当满足此题的超过两种进制的条件的时候，进行输出\n\t\t\t{\n\t\t\t\tn=n-1;\n\t\t\t\tprintf(\""%d\\n\"", i);\n\t\t\t\tif (n == 0)\n\t\t\t\t\tbreak;\n\t\t\t}\n\n\t\t}\n\treturn 0;\n}",ACCEPTED,27,512
1278880635572125696,ac84ffdb684484aea7c363ab676f9b5eb778268f3a15168c6f05f067552d4b29,2020-07-03 10:37:58,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,1,COMPILE_ERROR,0,0
1278881037059284992,c2c290e91f30dc0454f9ef5b9125b06471e7d4b403c388aa8cf0d9b3efc569e9,2020-07-03 10:39:34,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nint a[20]; \nbool judge(int x,int n)\n{\n    int m{ 0 };\n    x = x * x;\n    while (x)\n    {\n        a[++m] = x % n;\n        x /= n;\n    }\n    for (int i = 1, j = m; i < j; i++, j--)\n        if (a[i] != a[j])\n            return false;\n    return true;\n}\nvoid p(int x,int n)\n{\n    int m = 0;\n    while (x)\n    {\n        a[++m] = x % n;\n        x /= n;\n    }\n    for (int i = m; i >= 1; i--)\n    {\n        if (a[i] > 9)\n            cout<<(a[i] - 10 + 'A');\n        else \n            cout<< a[i] ;\n    }\n}\nint main()\n{\n    int B;\n    cin >> B;\n    for (int i = 1; i <= 300; i++)\n    {\n        if (judge(i,B))\n        {\n            p(i,B);\n            cout << \"" \"";\n            p(i * i,B);\n            cout << \""\\n\"";\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,24,512
1278901413348827136,a1e7064b323be6c22b1cc57f30af167085750c33ec47c1123456ba82dffd1a78,2020-07-03 12:00:32,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<stdio.h>\n#include<math.h>\n\nusing namespace std;\n\n\n\n\n\n\nchar Change(int x){\n    if(x>=0&&x<=9)\n        return x+'0';\n    return x-10+'A';\n}\n\nstruct Struct{\n    int icount;\n    int list[20];\n\n    Struct(int n,int x){\n        for(icount=0;x;icount++){\n            list[icount] = x%n;\n            x = x/n;\n        }\n    }\n\n    bool Circle(){\n        for(int i=0;i<icount;i++)\n            if(list[i]!=list[icount-1-i])\n                return 0;\n        return 1;\n    }\n\n    void Out(){\n        for(int i=0;i<icount;i++)\n            cout << Change(list[icount-1-i]);\n    }\n};\n\n\n\n\n\nint main(){\n    int n;\n    cin >> n;\n\n    for(int i=1;i<=300;i++){\n        Struct s(n,i*i);\n        if(s.Circle()){\n            Struct s1(n,i);\n            s1.Out();\n            cout<<\"" \"";\n            s.Out();\n            cout << endl;\n        }\n    }\n}\n\n\n",ACCEPTED,47,508
1278905755292327936,ef2af74cf216d6156aa85f981ccf11bf345b812d2b02ec465e9880def4bf24ac,2020-07-03 12:17:47,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<math.h>\nusing namespace std;\n\nint main()\n{int change(int x,int B);\nint number(int x,int B);\nint x,y,p,B,I,i;char c;cin>>B;\nfor(x=1;x<=300;x++)\n\t{if(x*x==change(x*x,B))\n\t\t{I=number(x,B);\n\t\tfor(i=0,y=x;i<I;i++)\n\t\t\t{p=pow(B,I-1-i);\n\t\t\tif(y/p>=0&&y/p<=9)c=y/p+48;\n\t\t\tif(y/p>=10)c=y/p+55;\n\t\t\tcout<<c;y%=p;\n\t\t\t}\n\t\tcout<<\"" \"";\n\t\tI=number(x*x,B);\n\t\tfor(i=0,y=x*x;i<I;i++)\n\t\t\t{p=pow(B,I-1-i);\n\t\t\tif(y/p>=0&&y/p<=9)c=y/p+48;\n\t\t\tif(y/p>=10)c=y/p+55;\n\t\t\tcout<<c;y%=p;\n\t\t\t}\n\t\tcout<<endl;\n\t\t}\n\t}\nreturn 0;\n}\n\nint change(int x,int B)\n{int number(int x,int B);\nconst int I=number(x,B);\nint num[I],i,p,r=0;\nfor(i=0;i<I;i++)\n\t{p=pow(B,I-1-i);\n\tnum[i]=x/p;\n\tx%=p;\n\t}\nfor(i=0;i<I;i++)\n\t{p=pow(B,i);\n\tr+=p*num[i];\n\t}\nreturn r;\n}\n\nint number(int x,int B)\n{int i=1,p=1;\nfor(;x%p<x;i++)\n\tp=pow(B,i);\nreturn i-1;\n}",ACCEPTED,49,384
1278905779363438592,bbfadfd9c24b0239524971c96a0a74bf163dd60b841b0075882f18ff0834ec5f,2020-07-03 12:17:53,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <string>\nusing namespace std;\n\nint B;\nchar a[19]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I'};\n\nstring huiw(int n){\n    string b=\""\"";\n    while (n>0) {\n        b+=a[n%B];\n        n/=B;\n    }\n    reverse(b.begin(),b.end());\n    return b;\n}\nbool p(string b){\n    int pos = b.size();\n    for(int i=0;i<=pos/2;i++){\n        if(b[i]!=b[pos-i-1])\n            return 0;\n    }\n    return 1;\n}\nint main(){\n    cin>>B;\n    for(int i=1;i<300;i++)\n        if(p(huiw(i*i)))\n            cout<<huiw(i)<<' '<<huiw(i*i)<<endl;\n\n}\n",ACCEPTED,40,384
1278908243311525888,bbfadfd9c24b0239524971c96a0a74bf163dd60b841b0075882f18ff0834ec5f,2020-07-03 12:27:40,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <string>\nusing namespace std;\n\nint B,n;\nchar a[19]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I'};\n\nbool huiw(int n,int B){\n    string b=\""\"";\n    while (n>0) {\n        b+=a[n%B];\n        n/=B;\n    }\n    int pos = b.size();\n    for(int i=0;i<=pos/2;i++){\n        if(b[i]!=b[pos-i-1])\n            return 0;\n    }\n    return 1;\n}\nint main(){\n    cin>>B>>n;\n    for(int i=B;1;i++){\n        int f=0,c=0;\n        for(int j=1;j<=10;j++)\n            if(huiw(i,j))\n                f++;\n        if(f>1){\n            cout<<i<<endl;\n            c++;\n        }\n        if(c==n)\n            break;\n    }\n\n}\n",TIME_LIMIT_EXCEEDED,0,0
1278909087083847680,bbfadfd9c24b0239524971c96a0a74bf163dd60b841b0075882f18ff0834ec5f,2020-07-03 12:31:02,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <string>\nusing namespace std;\n\nint B,n;\nchar a[19]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I'};\n\nbool huiw(int n,int B){\n    string b=\""\"";\n    while (n>0) {\n        b+=a[n%B];\n        n/=B;\n    }\n    int pos = b.size();\n    for(int i=0;i<=pos/2;i++){\n        if(b[i]!=b[pos-i-1])\n            return 0;\n    }\n    return 1;\n}\nint main(){\n    cin>>n>>B;\n    for(int i=B;1;i++){\n        int f=0,c=0;\n        for(int j=1;j<=10;j++){\n            if(huiw(i,j))\n                f++;\n        }\n        if(f>1){\n            cout<<i<<endl;\n            c++;\n        }\n        if(c>=n)\n            break;\n    }\n\n}\n",TIME_LIMIT_EXCEEDED,0,0
1278910146036555776,bbfadfd9c24b0239524971c96a0a74bf163dd60b841b0075882f18ff0834ec5f,2020-07-03 12:35:14,C++,50.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <string>\nusing namespace std;\n\nint B,n;\nchar a[19]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I'};\n\nbool huiw(int n,int B){\n    string b=\""\"";\n    while (n>0) {\n        b+=a[n%B];\n        n/=B;\n    }\n    int pos = b.size();\n    for(int i=0;i<=pos/2;i++){\n        if(b[i]!=b[pos-i-1])\n            return 0;\n    }\n    return 1;\n}\nint main(){\n    cin>>n>>B;\n    int c=0;\n    for(int i=B;c<n;i++){\n        int f=0;\n        for(int j=2;j<=10 && f<=2;j++){\n            if(huiw(i,j))\n                f++;\n        }\n        if(f>1){\n            cout<<i<<endl;\n            c++;\n        }\n        if(c>=n)\n            break;\n    }\n\n}\n",PARTIAL_ACCEPTED,37,484
1278910304732241920,bbfadfd9c24b0239524971c96a0a74bf163dd60b841b0075882f18ff0834ec5f,2020-07-03 12:35:52,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <string>\nusing namespace std;\n\nint B,n;\nchar a[19]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I'};\n\nbool huiw(int n,int B){\n    string b=\""\"";\n    while (n>0) {\n        b+=a[n%B];\n        n/=B;\n    }\n    int pos = b.size();\n    for(int i=0;i<=pos/2;i++){\n        if(b[i]!=b[pos-i-1])\n            return 0;\n    }\n    return 1;\n}\nint main(){\n    cin>>n>>B;\n    int c=0;\n    for(int i=B+1;c<n;i++){\n        int f=0;\n        for(int j=2;j<=10 && f<=2;j++){\n            if(huiw(i,j))\n                f++;\n        }\n        if(f>1){\n            cout<<i<<endl;\n            c++;\n        }\n        if(c>=n)\n            break;\n    }\n\n}\n",ACCEPTED,35,500
1278922532403478528,5a10bccaf5a9647c28ad97355d00f2a39ab3ba64f7b21f70896bc5427491236c,2020-07-03 13:24:27,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\n\n\nint main() {\n\tchar after_num[100];\n\tint system_num = 0;\n\tcin >> system_num;\n\tfor (int number = 1; number <= 300; number++) {\n\t\tint i = 0;\n\t\tint double_number = number * number;\n\t\twhile (double_number > 0) {\n\t\t\t\n\t\t\tswitch (double_number % system_num)\n\t\t\t{\n\t\t\tcase 0:\n\t\t\tcase 1:\n\t\t\tcase 2:\n\t\t\tcase 3:\n\t\t\tcase 4:\n\t\t\tcase 5:\n\t\t\tcase 6:\n\t\t\tcase 7:\n\t\t\tcase 8:\n\t\t\tcase 9:after_num[i] = double_number % system_num; break;\n\t\t\tcase 10:after_num[i] = 'A'; break;\n\t\t\tcase 11:after_num[i] = 'B'; break;\n\t\t\tcase 12:after_num[i] = 'C'; break;\n\t\t\tcase 13:after_num[i] = 'D'; break;\n\t\t\tcase 14:after_num[i] = 'E'; break;\n\t\t\tcase 15:after_num[i] = 'F'; break;\n\t\t\tcase 16:after_num[i] = 'G'; break;\n\t\t\tcase 17:after_num[i] = 'H'; break;\n\t\t\tcase 18:after_num[i] = 'I'; break;\n\t\t\tcase 19:after_num[i] = 'J'; break;\n\t\t\t}\n\t\t\tdouble_number = double_number / system_num;\n\t\t\ti++;\n\t\t}\n\t\tint count = 0;\n\t\tfor (int s = 0; s < i; s++) {\n\t\t\tif (after_num[s] == after_num[i - s - 1]) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tif (count == i) {\n\t\t\tcout << number << \"" \"";\n\t\t\tfor (int h = 0; h < i; h++) {\n\t\t\t\tcout << after_num[h];\n\t\t\t}\n\t\t}\n\n\t}\n\t\n\n}",WRONG_ANSWER,43,384
1278926467839229952,f870ee69ef7b87d41540e36b5449d5c00387b4b42e8fa6039702fc5f7d35a174,2020-07-03 13:40:05,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint m, a1[310];\n\nvoid out() {\n\tfor (int k = a1[0]; k >= 1; k--)\n\t{\n\t\tif (a1[k] <= 9)\n\t\t\tcout << a1[k];\n\t\telse\n\t\t\tcout << (char)(a1[k] - 10 + 'A');\n\t}\n}\nvoid tran(int x, int y)\n{\n\tint i = 0;\n\twhile (x) {\n\t\ta1[++i] = x % y;\n\t\tx /= y;\n\t}\n\ta1[0] = i;\n}\n\nbool check()\n{\n\tfor (int j = 1; j <= a1[0]; j++)\n\t{\n\t\tif (a1[j] != a1[a1[0] + 1 - j])\n\t\t\treturn false;\n\t}\n\treturn true;\n}\n\n\nint main() {\n\tcin >> m;\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\ttran(i * i, m);\n\t\tif (check())\n\t\t{\n\t\t\ttran(i, m);\n\t\t\tout();\n\t\t\tcout << \"" \"";\n\t\t\ttran(i * i, m);\n\t\t\tout();\n\t\t\tputs(\""\"");\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,45,384
1278929295647375360,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-03 13:51:20,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint a[10000000], b[10000000];\nint B;\nusing namespace std;\nint turn1(int k)\n{\n    int i = 0;\n    while (k > 0) {\n        a[i] = k % B;\n        k = k / B;\n        i++;\n    }\n    return i;\n}\nint turn2(int k)\n{\n    int i = 0;\n    while (k > 0) {\n        b[i] = k % B;\n        k = k / B;\n        i++;\n    }\n    return i;\n}\n\nvoid print1(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        while (a[i] >= 10){\n            cout<<a[i]+'A';\n        }\n        }\n        if (a[i] < 10)\n            cout << a[i];\n    }\n}\nvoid print2(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        while(b[i] >= 10)\n            cout<<b[i]+'A';\n        if(b[i] < 10)\n            cout << b[i];\n    }\n}\nint huiwen(int k)\n{\n    for (int i =0;i <=k-1;i++)\n    {\n        if (a[i] != a[k - i - 1])\n            return 0;\n    }\n    return 1;\n}\nint main()\n{\n    cin >> B;\n    for (int i = 1;i <= 300;i++) {\n        int num = turn1(i * i);\n        if (huiwen(num) == 1)\n        {\n            if(turn2(i)<=300){\n                print2(turn2(i));\n                cout << \"" \"";\n                print1(num);\n                cout << endl;\n            }\n        }\n    }\n}",COMPILE_ERROR,0,0
1278929360118013952,5306f45bc39a1bcebead04fb0a0563714f434c5cfc74c6bcd6746bdff031d758,2020-07-03 13:51:35,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nint s[301];\n\nvoid transition(int a, int b)\n{\n    int r = 0;\n    while (a)\n    {\n        s[++r] = a % b;\n        a /= b;\n    }\n    s[0] = r;\n}\nbool judge() \n{\n    for (unsigned int i = 1; i <= s[0]; i++)\n        if (s[i] != s[s[0] + 1 - i])\n            return false;\n    return true;\n}\nvoid output()\n{\n    for (unsigned int i = s[0]; i >= 1; i--)\n    {\n        if (s[i] <= 9) cout << s[i];\n        else cout << (char)(s[i] - 10 + 'A');\n    }\n}\n\nint main()\n{\n    int num;\n    cin >> num;\n    for (int i = 1; i <= 300; i++)\n    {\n        transition(i * i, num);\n        if (judge()) {\n            transition(i, num);\n            output();\n            cout << ' ';\n            transition(i * i, num);\n            output();\n            puts(\""\"");\n        }\n    }\n}",ACCEPTED,38,504
1278929458759655424,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-03 13:51:58,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint a[10000000], b[10000000];\nint B;\nusing namespace std;\nint turn1(int k)\n{\n    int i = 0;\n    while (k > 0) {\n        a[i] = k % B;\n        k = k / B;\n        i++;\n    }\n    return i;\n}\nint turn2(int k)\n{\n    int i = 0;\n    while (k > 0) {\n        b[i] = k % B;\n        k = k / B;\n        i++;\n    }\n    return i;\n}\n\nvoid print1(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        while (a[i] >= 10){\n            cout<<a[i]+'A';\n        }\n        if (a[i] < 10)\n            cout << a[i];\n}\nvoid print2(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        while(b[i] >= 10)\n            cout<<b[i]+'A';\n        if(b[i] < 10)\n            cout << b[i];\n    }\n}\nint huiwen(int k)\n{\n    for (int i =0;i <=k-1;i++)\n    {\n        if (a[i] != a[k - i - 1])\n            return 0;\n    }\n    return 1;\n}\nint main()\n{\n    cin >> B;\n    for (int i = 1;i <= 300;i++) {\n        int num = turn1(i * i);\n        if (huiwen(num) == 1)\n        {\n            if(turn2(i)<=300){\n                print2(turn2(i));\n                cout << \"" \"";\n                print1(num);\n                cout << endl;\n            }\n        }\n    }\n}",COMPILE_ERROR,0,0
1278929683297533952,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-03 13:52:52,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint a[10000000], b[10000000];\nint B;\nusing namespace std;\nint turn1(int k)\n{\n    int i = 0;\n    while (k > 0) {\n        a[i] = k % B;\n        k = k / B;\n        i++;\n    }\n    return i;\n}\nint turn2(int k)\n{\n    int i = 0;\n    while (k > 0) {\n        b[i] = k % B;\n        k = k / B;\n        i++;\n    }\n    return i;\n}\n\nvoid print1(int k) {\n    for (int i = k - 1;i >= 0;i--)\n    {\n        while (a[i] >= 10){\n            cout<<a[i]+'A';\n        }\n        if (a[i] < 10)\n            cout << a[i];\n}\nvoid print2(int k)\n{\n    for (int i = k - 1;i >= 0;i--)\n    {\n        while(b[i] >= 10){\n            cout<<b[i]+'A';\n        }\n        if(b[i] < 10)\n            cout << b[i];\n    }\n}\nint huiwen(int k)\n{\n    for (int i =0;i <=k-1;i++)\n    {\n        if (a[i] != a[k - i - 1])\n            return 0;\n    }\n    return 1;\n}\nint main()\n{\n    cin >> B;\n    for (int i = 1;i <= 300;i++) {\n        int num = turn1(i * i);\n        if (huiwen(num) == 1)\n        {\n            if(turn2(i)<=300){\n                print2(turn2(i));\n                cout << \"" \"";\n                print1(num);\n                cout << endl;\n            }\n        }\n    }\n}",COMPILE_ERROR,0,0
1278932710087647232,5a10bccaf5a9647c28ad97355d00f2a39ab3ba64f7b21f70896bc5427491236c,2020-07-03 14:04:54,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"\n#include<iostream>\nusing namespace std;\nint main() {\n\tchar after_num[100];\n\tchar first_num[100];\n\tint system_num = 0;\n\tcin >> system_num;\n\tfor (int number = 1; number <= 300; number++) {\n\t\tint i = 0;\n\t\tint j = 0;\n\t\twhile (number > 0) {\n\n\t\t\tswitch (number % system_num)\n\t\t\t{\n\t\t\tcase 0:\n\t\t\tcase 1:\n\t\t\tcase 2:\n\t\t\tcase 3:\n\t\t\tcase 4:\n\t\t\tcase 5:\n\t\t\tcase 6:\n\t\t\tcase 7:\n\t\t\tcase 8:\n\t\t\tcase 9:first_num[i] = number % system_num; break;\n\t\t\tcase 10:first_num[i] = 'A'; break;\n\t\t\tcase 11:first_num[i] = 'B'; break;\n\t\t\tcase 12:first_num[i] = 'C'; break;\n\t\t\tcase 13:first_num[i] = 'D'; break;\n\t\t\tcase 14:first_num[i] = 'E'; break;\n\t\t\tcase 15:first_num[i] = 'F'; break;\n\t\t\tcase 16:first_num[i] = 'G'; break;\n\t\t\tcase 17:first_num[i] = 'H'; break;\n\t\t\tcase 18:first_num[i] = 'I'; break;\n\t\t\tcase 19:first_num[i] = 'J'; break;\n\t\t\t}\n\t\t\tnumber = number / system_num;\n\t\t\tj++;\n\t\t}\n\t\tint double_number = number * number;\n\t\twhile (double_number > 0) {\n\n\t\t\tswitch (double_number % system_num)\n\t\t\t{\n\t\t\tcase 0:\n\t\t\tcase 1:\n\t\t\tcase 2:\n\t\t\tcase 3:\n\t\t\tcase 4:\n\t\t\tcase 5:\n\t\t\tcase 6:\n\t\t\tcase 7:\n\t\t\tcase 8:\n\t\t\tcase 9:after_num[i] = double_number % system_num; break;\n\t\t\tcase 10:after_num[i] = 'A'; break;\n\t\t\tcase 11:after_num[i] = 'B'; break;\n\t\t\tcase 12:after_num[i] = 'C'; break;\n\t\t\tcase 13:after_num[i] = 'D'; break;\n\t\t\tcase 14:after_num[i] = 'E'; break;\n\t\t\tcase 15:after_num[i] = 'F'; break;\n\t\t\tcase 16:after_num[i] = 'G'; break;\n\t\t\tcase 17:after_num[i] = 'H'; break;\n\t\t\tcase 18:after_num[i] = 'I'; break;\n\t\t\tcase 19:after_num[i] = 'J'; break;\n\t\t\t}\n\t\t\tdouble_number = double_number / system_num;\n\t\t\ti++;\n\t\t}\n\t\tint count = 0;\n\t\tfor (int s = 0; s < i; s++) {\n\t\t\tif (after_num[s] == after_num[i - s - 1]) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tif (count == i) {\n\t\t\tfor (int t = j - 1; t >= 0; t--) {\n\t\t\t\tcout << first_num[t];\n\t\t\t}\n\t\t\tcout << \"" \"";\n\t\t\tfor (int h = 0; h < i; h++) {\n\t\t\t\tcout << after_num[h];\n\t\t\t}\n\t\t}\n\n\t}\n\n\n}",TIME_LIMIT_EXCEEDED,0,0
1278935074295177216,5306f45bc39a1bcebead04fb0a0563714f434c5cfc74c6bcd6746bdff031d758,2020-07-03 14:14:17,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nint s[301];\n\nvoid transition(int a, int b)\n{\n    int r = 0;\n    while (a)\n    {\n        s[++r] = a % b;\n        a /= b;\n    }\n    s[0] = r;\n}\nbool judge() \n{\n    for (unsigned int i = 1; i <= s[0]; i++)\n        if (s[i] != s[s[0] + 1 - i])\n            return false;\n    return true;\n}\nvoid output()\n{\n    for (unsigned int i = s[0]; i >= 1; i--)\n    {\n        if (s[i] <= 9) cout << s[i];\n        else cout << (char)(s[i] - 10 + 'A');\n    }\n}\n\nint main()\n{\n    int num;\n    cin >> num;\n    for (int i = 1; i <= 300; i++)\n    {\n        transition(i * i, num);\n        if (judge())\n        {\n            transition(i, num);\n            output();\n            cout << ' ';\n            transition(i * i, num);\n            output();\n            puts(\""\"");\n        }\n    }\n}",ACCEPTED,23,424
1278938308443308032,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-03 14:27:08,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint a[10000000], b[10000000];\nint B;\nusing namespace std;\nint turn(int k,int B)\n{\n    int i=0;\n    while(k>0)\n    {\n        a[i++]=k%B;\n        k=k/B;\n    }\n    return i;\n}\nint huiwen(int i)\n{\n    for(int t=0;t<i;t++)\n    {\n        if(a[t]!=a[i-t-1])\n            return 0;\n    }\n    return 1;\n}\nint main()\n{\n    for(int i=1;i<=300;i++)\n    {\n        if(huiwen(turn(i*i))==1)\n        {\n            b[i++]=i%B;\n            i=i/B;\n        }\n        \n    }\n}",COMPILE_ERROR,0,0
1278942296051998720,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-03 14:42:59,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint a[10000000], b[10000000];\nint B;\nusing namespace std;\nvoid x(int k)\n{\n    int k1=k*k;\n    int i=0;\n    while(k1>0)\n    {\n        a[i++]=k1%B;\n        k1=k1/B;\n    }\n    for(int t=0;t<=i/2;t++)\n    {\n        if(a[t]!=a[i-t-1])\n            return;\n    }\n    int i1=0;\n    while(k>0)\n    {\n        b[i1++]=k%B;\n        k=k/B;\n    }\n    for(int t=i1;t>=1;t--)\n   {\n      if(b[t]>=10) \n          cout<<(b[t]+'A');    \n      else\n          cout<<b[t];  \n    }\n    cout<<\"" \"";\n    for(int t=i;t>=1;t--)\n    {\n        if(a[t]>=10)\n            cout<<(a[t]+'A');\n        else\n            cout<<a[t];\n    }\n    return;\n}\nint main()\n{\n    int i;\n    for(i=1;i<=300;i++)\n    {\n        x(i)\n    }\n}",COMPILE_ERROR,0,0
1278942313433194496,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-03 14:43:03,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint a[10000000], b[10000000];\nint B;\nusing namespace std;\nvoid x(int k)\n{\n    int k1=k*k;\n    int i=0;\n    while(k1>0)\n    {\n        a[i++]=k1%B;\n        k1=k1/B;\n    }\n    for(int t=0;t<=i/2;t++)\n    {\n        if(a[t]!=a[i-t-1])\n            return;\n    }\n    int i1=0;\n    while(k>0)\n    {\n        b[i1++]=k%B;\n        k=k/B;\n    }\n    for(int t=i1;t>=1;t--)\n   {\n      if(b[t]>=10) \n          cout<<(b[t]+'A');    \n      else\n          cout<<b[t];  \n    }\n    cout<<\"" \"";\n    for(int t=i;t>=1;t--)\n    {\n        if(a[t]>=10)\n            cout<<(a[t]+'A');\n        else\n            cout<<a[t];\n    }\n    return;\n}\nint main()\n{\n    int i;\n    for(i=1;i<=300;i++)\n    {\n        x(i)\n    }\n}",COMPILE_ERROR,0,0
1278942356877803520,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-03 14:43:14,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint a[10000000], b[10000000];\nint B;\nusing namespace std;\nvoid x(int k)\n{\n    int k1=k*k;\n    int i=0;\n    while(k1>0)\n    {\n        a[i++]=k1%B;\n        k1=k1/B;\n    }\n    for(int t=0;t<=i/2;t++)\n    {\n        if(a[t]!=a[i-t-1])\n            return;\n    }\n    int i1=0;\n    while(k>0)\n    {\n        b[i1++]=k%B;\n        k=k/B;\n    }\n    for(int t=i1;t>=1;t--)\n   {\n      if(b[t]>=10) \n          cout<<(b[t]+'A');    \n      else\n          cout<<b[t];  \n    }\n    cout<<\"" \"";\n    for(int t=i;t>=1;t--)\n    {\n        if(a[t]>=10)\n            cout<<(a[t]+'A');\n        else\n            cout<<a[t];\n    }\n    return;\n}\nint main()\n{\n    int i;\n    for(i=1;i<=300;i++)\n    {\n        x(i);\n    }\n}",FLOAT_POINT_EXCEPTION,32,424
1278942654065205248,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-03 14:44:24,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint a[10000000], b[10000000];\nint B;\nusing namespace std;\nvoid x(int k)\n{\n    int k1=k*k;\n    int i=0;\n    while(k1>0)\n    {\n        a[++i]=k1%B;\n        k1=k1/B;\n    }\n    for(int t=0;t<=i/2;t++)\n    {\n        if(a[t]!=a[i-t-1])\n            return;\n    }\n    int i1=0;\n    while(k>0)\n    {\n        b[++i1]=k%B;\n        k=k/B;\n    }\n    for(int t=i1;t>=1;t--)\n   {\n      if(b[t]>=10) \n          cout<<(b[t]+'A');    \n      else\n          cout<<b[t];  \n    }\n    cout<<\"" \"";\n    for(int t=i;t>=1;t--)\n    {\n        if(a[t]>=10)\n            cout<<(a[t]+'A');\n        else\n            cout<<a[t];\n    }\n    return;\n}\nint main()\n{\n    int i;\n    for(i=1;i<=300;i++)\n    {\n        x(i);\n    }\n}",FLOAT_POINT_EXCEPTION,32,384
1278942758021029888,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-03 14:44:49,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint a[10000000], b[10000000];\nint B;\nusing namespace std;\nvoid x(int k)\n{\n    int k1=k*k;\n    int i=0;\n    while(k1>0)\n    {\n        a[++i]=k1%B;\n        k1=k1/B;\n    }\n    for(int t=0;t<=i/2;t++)\n    {\n        if(a[t]!=a[i-t-1])\n            return;\n    }\n    int i1=0;\n    while(k>0)\n    {\n        b[++i1]=k%B;\n        k=k/B;\n    }\n    for(int t=i1;t>=1;t--)\n   {\n      if(b[t]>=10) \n          cout<<(b[t]+'A');    \n      else\n          cout<<b[t];  \n    }\n    cout<<\"" \"";\n    for(int t=i;t>=1;t--)\n    {\n        if(a[t]>=10)\n            cout<<(a[t]+'A');\n        else\n            cout<<a[t];\n    }\n    return;\n}\nint main()\n{\n    cin>>B;\n    int i;\n    for(i=1;i<=300;i++)\n    {\n        x(i);\n    }\n}",WRONG_ANSWER,30,424
1278942889411796992,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-03 14:45:21,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint a[10000000], b[10000000];\nint B;\nusing namespace std;\nvoid x(int k)\n{\n    int k1=k*k;\n    int i=0;\n    while(k1>0)\n    {\n        a[i++]=k1%B;\n        k1=k1/B;\n    }\n    for(int t=0;t<=i/2;t++)\n    {\n        if(a[t]!=a[i-t-1])\n            return;\n    }\n    int i1=0;\n    while(k>0)\n    {\n        b[i1++]=k%B;\n        k=k/B;\n    }\n    for(int t=i1;t>=1;t--)\n   {\n      if(b[t]>=10) \n          cout<<(b[t]+'A');    \n      else\n          cout<<b[t];  \n    }\n    cout<<\"" \"";\n    for(int t=i;t>=1;t--)\n    {\n        if(a[t]>=10)\n            cout<<(a[t]+'A');\n        else\n            cout<<a[t];\n    }\n    return;\n}\nint main()\n{\n    cin>>B;\n    int i;\n    for(i=1;i<=300;i++)\n    {\n        x(i);\n    }\n}",WRONG_ANSWER,30,512
1278943770442129408,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-03 14:48:51,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint a[10000000], b[10000000];\nint B;\nusing namespace std;\nvoid x(int k)\n{\n    int k1=k*k;\n    int i=0;\n    while(k1>0)\n    {\n        a[i++]=k1%B;\n        k1=k1/B;\n    }\n    for(int t=1;t<=i/2;t++)\n    {\n        if(a[t]!=a[i-t+1])\n            return;\n    }\n    int i1=0;\n    while(k>0)\n    {\n        b[i1++]=k%B;\n        k=k/B;\n    }\n    for(int t=i1;t>=1;t--)\n   {\n      if(b[t]>=10) \n          cout<<(b[t]+'A');    \n      else\n          cout<<b[t];  \n    }\n    cout<<\"" \"";\n    for(int t=i;t>=1;t--)\n    {\n        if(a[t]>=10)\n            cout<<(a[t]+'A');\n        else\n            cout<<a[t];\n    }\n    return;\n}\nint main()\n{\n    cin>>B;\n    int i;\n    for(i=1;i<=300;i++)\n    {\n        x(i);\n    }\n}",WRONG_ANSWER,39,408
1278943932648448000,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-03 14:49:29,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint a[10000000], b[10000000];\nint B;\nusing namespace std;\nvoid x(int k)\n{\n    int k1=k*k;\n    int i=1;\n    while(k1>0)\n    {\n        a[i++]=k1%B;\n        k1=k1/B;\n    }\n    for(int t=1;t<=i/2;t++)\n    {\n        if(a[t]!=a[i-t+1])\n            return;\n    }\n    int i1=0;\n    while(k>0)\n    {\n        b[i1++]=k%B;\n        k=k/B;\n    }\n    for(int t=i1;t>=1;t--)\n   {\n      if(b[t]>=10) \n          cout<<(b[t]+'A');    \n      else\n          cout<<b[t];  \n    }\n    cout<<\"" \"";\n    for(int t=i;t>=1;t--)\n    {\n        if(a[t]>=10)\n            cout<<(a[t]+'A');\n        else\n            cout<<a[t];\n    }\n    return;\n}\nint main()\n{\n    cin>>B;\n    int i;\n    for(i=1;i<=300;i++)\n    {\n        x(i);\n    }\n}",WRONG_ANSWER,35,500
1278944125062144000,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-03 14:50:15,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint a[10000000], b[10000000];\nint B;\nusing namespace std;\nvoid x(int k)\n{\n    int k1=k*k;\n    int i=1;\n    while(k1>0)\n    {\n        a[i++]=k1%B;\n        k1=k1/B;\n    }\n    for(int t=1;t<=i/2;t++)\n    {\n        if(a[t]!=a[i-t+1])\n            return;\n    }\n    int i1=0;\n    while(k>0)\n    {\n        b[i1++]=k%B;\n        k=k/B;\n    }\n    for(int t=i1;t>=1;t--)\n   {\n      if(b[t]>=10) \n          cout<<(b[t]+55);    \n      else\n          cout<<b[t];  \n    }\n    cout<<\"" \"";\n    for(int t=i;t>=1;t--)\n    {\n        if(a[t]>=10)\n            cout<<(a[t]+55);\n        else\n            cout<<a[t];\n    }\n    return;\n}\nint main()\n{\n    cin>>B;\n    int i;\n    for(i=1;i<=300;i++)\n    {\n        x(i);\n    }\n}",WRONG_ANSWER,39,512
1278944456571551744,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-03 14:51:34,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint a[10000000], b[10000000];\nint B;\nusing namespace std;\nvoid x(int k)\n{\n    int k1=k*k;\n    int i=1;\n    while(k1>0)\n    {\n        a[i++]=k1%B;\n        k1=k1/B;\n    }\n    for(int t=1;t<=i/2;t++)\n    {\n        if(a[t]!=a[i-t+1])\n            return;\n    }\n    int i1=0;\n    while(k>0)\n    {\n        b[i1++]=k%B;\n        k=k/B;\n    }\n    for(int t=i1;t>=1;t--)\n   {\n      if(b[t]>=10) \n          cout<<char(b[t]+55);    \n      else\n          cout<<b[t];  \n    }\n    cout<<\"" \"";\n    for(int t=i;t>=1;t--)\n    {\n        if(a[t]>=10)\n            cout<<char(a[t]+55);\n        else\n            cout<<a[t];\n    }\n    return;\n}\nint main()\n{\n    cin>>B;\n    int i;\n    for(i=1;i<=300;i++)\n    {\n        x(i);\n    }\n}",WRONG_ANSWER,36,452
1278944772847239168,707929b69b5212b734ed1a1ff6179d3aa39ed592ca11454db07c23c4bd35c2b0,2020-07-03 14:52:50,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nint input;\nint  N;\nchar a[20];\nint flag;\nint len;\n \nvoid Change(int n)\n{\n\tint i = 0;\n\tint t;\n\tlen = 0;\n\tif( input>=2 && input<10 )\n\t{\n\t\twhile( n > 0 )\n\t\t{\n\t\t\ta[i] = n % input + '0';\n\t\t\tn = n / input;\n\t\t\ti++;\n\t\t\tlen++;\n\t\t}\n\t}\n\telse if( input >= 10 && input <= 20 )\n\t{\n\t\twhile( n > 0 )\n\t\t{\n\t\t\tt = n % input;\n\t\t\tif( t < 10 )\n\t\t\t\ta[i] = t + '0';\n\t\t\telse if( t == 10 )\n\t\t\t\ta[i] = 'A';\n\t\t\telse if( t == 11 )\n\t\t\t\ta[i] = 'B';\n\t\t\telse if( t == 12 )\n\t\t\t\ta[i] = 'C';\n\t\t\telse if( t == 13 )\n\t\t\t\ta[i] = 'D';\n\t\t\telse if( t == 14 )\n\t\t\t\ta[i] = 'E';\n\t\t\telse if( t == 15 )\n\t\t\t\ta[i] = 'F';\n\t\t\telse if( t == 16 )\n\t\t\t\ta[i] = 'G';\n\t\t\telse if( t == 17 )\n\t\t\t\ta[i] = 'H';\n\t\t\telse if( t == 18 )\n\t\t\t\ta[i] = 'I';\n\t\t\telse if( t == 19 )\n\t\t\t\ta[i] = 'J';\n \n\t\t\tn = n / input;\n\t\t\ti++;\n\t\t\tlen++;\n\t\t}\n\t}\n}\n \nint Panlindromic()\n{\n\tChange(N);\n\tint i = 0;\n\tint j = len - 1;\n\twhile(i <j )\n\t{\n\t\tif( a[i] != a[j] )\n\t\t\treturn 0;\n\t\ti++;\n\t\tj--;\n\t}\n\treturn 1;\n}\n \nvoid Show(int m)\n{\n\tChange(m);\n\tfor(int i=len-1; i>=0; i--)\n\t\tcout<<a[i];\n}\n \nint main()\n{\n \tcin>>input;\n\tfor( int i=0; i<300; i++ )\n\t{\n\t\tN = i * i;\n\t\tflag = Panlindromic();\n \n\t\tif( flag == 1 )\n\t\t{\n\t\t\tShow(i);\n\t\t\tcout<<\"" \"";\n\t\t\tShow(N);\n\t\t\tcout<<endl;\n\t\t}\n\t}\n \n\treturn 0;\n}",PRESENTATION_ERROR,51,512
1278944884369580032,707929b69b5212b734ed1a1ff6179d3aa39ed592ca11454db07c23c4bd35c2b0,2020-07-03 14:53:16,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nint input;\nint  N;\nchar a[20];\nint flag;\nint len;\n \nvoid Change(int n)\n{\n\tint i = 0;\n\tint t;\n\tlen = 0;\n\tif( input>=2 && input<10 )\n\t{\n\t\twhile( n > 0 )\n\t\t{\n\t\t\ta[i] = n % input + '0';\n\t\t\tn = n / input;\n\t\t\ti++;\n\t\t\tlen++;\n\t\t}\n\t}\n\telse if( input >= 10 && input <= 20 )\n\t{\n\t\twhile( n > 0 )\n\t\t{\n\t\t\tt = n % input;\n\t\t\tif( t < 10 )\n\t\t\t\ta[i] = t + '0';\n\t\t\telse if( t == 10 )\n\t\t\t\ta[i] = 'A';\n\t\t\telse if( t == 11 )\n\t\t\t\ta[i] = 'B';\n\t\t\telse if( t == 12 )\n\t\t\t\ta[i] = 'C';\n\t\t\telse if( t == 13 )\n\t\t\t\ta[i] = 'D';\n\t\t\telse if( t == 14 )\n\t\t\t\ta[i] = 'E';\n\t\t\telse if( t == 15 )\n\t\t\t\ta[i] = 'F';\n\t\t\telse if( t == 16 )\n\t\t\t\ta[i] = 'G';\n\t\t\telse if( t == 17 )\n\t\t\t\ta[i] = 'H';\n\t\t\telse if( t == 18 )\n\t\t\t\ta[i] = 'I';\n\t\t\telse if( t == 19 )\n\t\t\t\ta[i] = 'J';\n \n\t\t\tn = n / input;\n\t\t\ti++;\n\t\t\tlen++;\n\t\t}\n\t}\n}\n \nint Panlindromic()\n{\n\tChange(N);\n\tint i = 0;\n\tint j = len - 1;\n\twhile(i <j )\n\t{\n\t\tif( a[i] != a[j] )\n\t\t\treturn 0;\n\t\ti++;\n\t\tj--;\n\t}\n\treturn 1;\n}\n \nvoid Show(int m)\n{\n\tChange(m);\n\tfor(int i=len-1; i>=0; i--)\n\t\tcout<<a[i];\n}\n \nint main()\n{\n \tcin>>input;\n\tfor( int i=1; i<=300; i++ )\n\t{\n\t\tN = i * i;\n\t\tflag = Panlindromic();\n \n\t\tif( flag == 1 )\n\t\t{\n\t\t\tShow(i);\n\t\t\tcout<<\"" \"";\n\t\t\tShow(N);\n\t\t\tcout<<endl;\n\t\t}\n\t}\n \n\treturn 0;\n}",ACCEPTED,33,540
1278945125697249280,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-03 14:54:14,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint a[10000000], b[10000000];\nint B;\nusing namespace std;\nvoid x(int k)\n{\n    int k1=k*k;\n    int i=1;\n    while(k1>0)\n    {\n        a[i++]=k1%B;\n        k1=k1/B;\n    }\n    for(int t=1;t<=i/2;t++)\n    {\n        if(a[t]!=a[i-t+1])\n            return;\n    }\n    int i1=1;\n    while(k>0)\n    {\n        b[i1++]=k%B;\n        k=k/B;\n    }\n    for(int t=i1;t>=1;t--)\n   {\n      if(b[t]>=10) \n          cout<<char(b[t]+55);    \n      else\n          cout<<b[t];  \n    }\n    cout<<\"" \"";\n    for(int t=i;t>=1;t--)\n    {\n        if(a[t]>=10)\n            cout<<char(a[t]+55);\n        else\n            cout<<a[t];\n    }\n    return;\n}\nint main()\n{\n    cin>>B;\n    int i;\n    for(i=1;i<=300;i++)\n    {\n        x(i);\n    }\n}",WRONG_ANSWER,35,488
1278945627302461440,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-03 14:56:13,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint a[1000], b[1000];\nint B;\nusing namespace std;\nvoid x(int k)\n{\n    int k1=k*k;\n    int i=1;\n    while(k1>0)\n    {\n        a[i++]=k1%B;\n        k1=k1/B;\n    }\n    for(int t=1;t<=i/2;t++)\n    {\n        if(a[t]!=a[i-t+1])\n            return;\n    }\n    int i1=1;\n    while(k>0)\n    {\n        b[i1++]=k%B;\n        k=k/B;\n    }\n    for(int t=i1;t>=1;t--)\n   {\n      if(b[t]>=10) \n          cout<<char(b[t]+55);    \n      else\n          cout<<b[t];  \n    }\n    cout<<\"" \"";\n    for(int t=i;t>=1;t--)\n    {\n        if(a[t]>=10)\n            cout<<char(a[t]+55);\n        else\n            cout<<a[t];\n    }\n    return;\n}\nint main()\n{\n    cin>>B;\n    int i;\n    for(i=1;i<=300;i++)\n    {\n        x(i);\n    }\n}",WRONG_ANSWER,37,512
1278945806558617600,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-03 14:56:56,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint a[1000], b[1000];\nint B;\nusing namespace std;\nvoid x(int k)\n{\n    int k1=k*k;\n    int i=1;\n    while(k1>0)\n    {\n        a[i++]=k1%B;\n        k1=k1/B;\n    }\n    for(int t=1;t<=i/2;t++)\n    {\n        if(a[t]!=a[i-t+1])\n            return;\n    }\n    int i1=1;\n    while(k>0)\n    {\n        b[i1++]=k%B;\n        k=k/B;\n    }\n    for(int t=i1;t>=1;t--)\n   {\n      if(b[t]>=10) \n          cout<<char(b[t]+55);    \n      else\n          cout<<b[t];  \n    }\n    cout<<\"" \"";\n    for(int t=i;t>=1;t--)\n    {\n        if(a[t]>=10)\n            cout<<char(a[t]+55);\n        else\n            cout<<a[t];\n    }\n    cout<<endl;\n    return;\n}\nint main()\n{\n    cin>>B;\n    int i;\n    for(i=1;i<=300;i++)\n    {\n        x(i);\n    }\n}",WRONG_ANSWER,40,512
1278946241184980992,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-03 14:58:40,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint B;\nusing namespace std;\nvoid x(int k)\n{\n    int a[1000], b[1000];\n    int k1=k*k;\n    int i=1;\n    while(k1>0)\n    {\n        a[i++]=k1%B;\n        k1=k1/B;\n    }\n    for(int t=1;t<=i/2;t++)\n    {\n        if(a[t]!=a[i-t+1])\n            return;\n    }\n    int i1=1;\n    while(k>0)\n    {\n        b[i1++]=k%B;\n        k=k/B;\n    }\n    for(int t=i1;t>=1;t--)\n   {\n      if(b[t]>=10) \n          cout<<char(b[t]+55);    \n      else\n          cout<<b[t];  \n    }\n    cout<<\"" \"";\n    for(int t=i;t>=1;t--)\n    {\n        if(a[t]>=10)\n            cout<<char(a[t]+55);\n        else\n            cout<<a[t];\n    }\n    cout<<endl;\n    return;\n}\nint main()\n{\n    cin>>B;\n    int i;\n    for(i=1;i<=300;i++)\n    {\n        x(i);\n    }\n}",WRONG_ANSWER,30,488
1278946872071225344,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-03 15:01:10,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint a[1000], b[1000];\nint B;\nusing namespace std;\nvoid x(int k)\n{\n    int k1=k*k;\n    int i=0;\n    while(k1>0)\n    {\n        a[++i]=k1%B;\n        k1=k1/B;\n    }\n    for(int t=1;t<=i/2;t++)\n    {\n        if(a[t]!=a[i-t+1])\n            return;\n    }\n    int i1=0;\n    while(k>0)\n    {\n        b[++i1]=k%B;\n        k=k/B;\n    }\n    for(int t=i1;t>=1;t--)\n   {\n      if(b[t]>=10) \n          cout<<char(b[t]+55);    \n      else\n          cout<<b[t];  \n    }\n    cout<<\"" \"";\n    for(int t=i;t>=1;t--)\n    {\n        if(a[t]>=10)\n            cout<<char(a[t]+55);\n        else\n            cout<<a[t];\n    }\n    cout<<endl;\n    return;\n}\nint main()\n{\n    cin>>B;\n    int i;\n    for(i=1;i<=300;i++)\n    {\n        x(i);\n    }\n}",ACCEPTED,31,424
1278947581550329856,f870ee69ef7b87d41540e36b5449d5c00387b4b42e8fa6039702fc5f7d35a174,2020-07-03 15:03:59,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint N, S, a[301];\n\nint check()\n{\n\tfor (int i = 1; i <= a[0] / +1; i++)\n\t{\n\t\tif (a[i] != a[a[0] + 1 - i])\n\t\t\treturn 0;\n\t}\n\treturn 1;\n}\n\nint tran(int x)\n{\n\tint flag = 0;\n\tfor (int i = 2; i <= 10; i++)\n\t{\n\t\tint k = 0;\n\t\twhile (x)\n\t\t{\n\t\t\ta[++k] = x % i;\n\t\t\tx /= i;\n\t\t}\n\t\ta[0] = k;\n\t\tflag += check();\n\t}\n\treturn flag;\n}\n\nint main()\n{\n\tcin >> N >> S;\n\twhile (N)\n\t{\n\t\tS++;\n\t\tif (tran(S) >= 2)\n\t\t{\n\t\t\tcout << S << endl;\n\t\t\tN--;\n\t\t}\n\t\telse\n\t\t\tcontinue;\n\t}\n}",PARTIAL_ACCEPTED,23,384
1278947622876798976,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-03 15:04:09,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint a[1000], b[1000];\nint B;\nusing namespace std;\nvoid x(int k)\n{\n    int k1=k*k;\n    int i=0;\n    while(k1>0)\n    {\n        a[++i]=k1%B;\n        k1=k1/B;\n    }\n    for(int t=1;t<=i/2;t++)\n    {\n        if(a[t]!=a[i-t+1])\n            return;\n    }\n    int i1=0;\n    while(k>0)\n    {\n        b[++i1]=k%B;\n        k=k/B;\n    }\n    for(int t=i1;t>=1;t--)\n   {\n      if(b[t]>=10) \n          cout<<char(b[t]+55);    \n      else\n          cout<<b[t];  \n    }\n    cout<<\"" \"";\n    for(int t=i;t>=1;t--)\n    {\n        if(a[t]>=10)\n            cout<<char(a[t]+55);\n        else\n            cout<<a[t];\n    }\n    cout<<endl;\n    return;\n}\nint main()\n{\n    cin>>B;\n    int i;\n    for(i=1;i<=300;i++)\n    {\n        x(i);\n    }\n}",ACCEPTED,35,532
1278947882739097600,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-03 15:05:11,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint a[1000], b[1000];\nint B;\nusing namespace std;\nvoid x(int k)\n{\n    int k1=k*k;\n    int i=0;\n    while(k1>0)\n    {\n        a[i++]=k1%B;\n        k1=k1/B;\n    }\n    for(int t=0;t<=i/2;t++)\n    {\n        if(a[t]!=a[i-t-1])\n            return;\n    }\n    int i1=0;\n    while(k>0)\n    {\n        b[i1++]=k%B;\n        k=k/B;\n    }\n    for(int t=i1-1;t>=0;t--)\n   {\n      if(b[t]>=10) \n          cout<<char(b[t]+55);    \n      else\n          cout<<b[t];  \n    }\n    cout<<\"" \"";\n    for(int t=i;t>=1;t--)\n    {\n        if(a[t]>=10)\n            cout<<char(a[t]+55);\n        else\n            cout<<a[t];\n    }\n    cout<<endl;\n    return;\n}\nint main()\n{\n    cin>>B;\n    int i;\n    for(i=1;i<=300;i++)\n    {\n        x(i);\n    }\n}",WRONG_ANSWER,41,592
1278947970286804992,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-03 15:05:32,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint a[1000], b[1000];\nint B;\nusing namespace std;\nvoid x(int k)\n{\n    int k1=k*k;\n    int i=0;\n    while(k1>0)\n    {\n        a[i++]=k1%B;\n        k1=k1/B;\n    }\n    for(int t=0;t<=i/2;t++)\n    {\n        if(a[t]!=a[i-t-1])\n            return;\n    }\n    int i1=0;\n    while(k>0)\n    {\n        b[i1++]=k%B;\n        k=k/B;\n    }\n    for(int t=i1-1;t>=0;t--)\n   {\n      if(b[t]>=10) \n          cout<<char(b[t]+55);    \n      else\n          cout<<b[t];  \n    }\n    cout<<\"" \"";\n    for(int t=i-1;t>=0;t--)\n    {\n        if(a[t]>=10)\n            cout<<char(a[t]+55);\n        else\n            cout<<a[t];\n    }\n    cout<<endl;\n    return;\n}\nint main()\n{\n    cin>>B;\n    int i;\n    for(i=1;i<=300;i++)\n    {\n        x(i);\n    }\n}",ACCEPTED,41,484
1278948069251416064,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-03 15:05:56,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint a[1000], b[1000];\nint B;\nusing namespace std;\nvoid x(int k)\n{\n    int k1=k*k;\n    int i=0;\n    while(k1>0)\n    {\n        a[i++]=k1%B;\n        k1=k1/B;\n    }\n    for(int t=0;t<=i/2;t++)\n    {\n        if(a[t]!=a[i-t-1])\n            return;\n    }\n    int i1=0;\n    while(k>0)\n    {\n        b[i1++]=k%B;\n        k=k/B;\n    }\n    for(int t=i1-1;t>=0;t--)\n   {\n      if(b[t]>=10) \n          cout<<char(b[t]+'A');    \n      else\n          cout<<b[t];  \n    }\n    cout<<\"" \"";\n    for(int t=i-1;t>=0;t--)\n    {\n        if(a[t]>=10)\n            cout<<char(a[t]+'A');\n        else\n            cout<<a[t];\n    }\n    cout<<endl;\n    return;\n}\nint main()\n{\n    cin>>B;\n    int i;\n    for(i=1;i<=300;i++)\n    {\n        x(i);\n    }\n}",PARTIAL_ACCEPTED,40,512
1278948187199438848,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-03 15:06:24,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint a[1000], b[1000];\nint B;\nusing namespace std;\nvoid x(int k)\n{\n    int k1=k*k;\n    int i=0;\n    while(k1>0)\n    {\n        a[i++]=k1%B;\n        k1=k1/B;\n    }\n    for(int t=0;t<=i/2;t++)\n    {\n        if(a[t]!=a[i-t-1])\n            return;\n    }\n    int i1=0;\n    while(k>0)\n    {\n        b[i1++]=k%B;\n        k=k/B;\n    }\n    for(int t=i1-1;t>=0;t--)\n   {\n      if(b[t]>=10) \n          cout<<(b[t]+55);    \n      else\n          cout<<b[t];  \n    }\n    cout<<\"" \"";\n    for(int t=i-1;t>=0;t--)\n    {\n        if(a[t]>=10)\n            cout<<(a[t]+55);\n        else\n            cout<<a[t];\n    }\n    cout<<endl;\n    return;\n}\nint main()\n{\n    cin>>B;\n    int i;\n    for(i=1;i<=300;i++)\n    {\n        x(i);\n    }\n}",PARTIAL_ACCEPTED,41,480
1278948240660037632,4bec64bd7c60266dfe5ed47dc707f29bc1d25b8f437854264281aa0bd1dd6e7e,2020-07-03 15:06:36,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\nint a[1000], b[1000];\nint B;\nusing namespace std;\nvoid x(int k)\n{\n    int k1=k*k;\n    int i=0;\n    while(k1>0)\n    {\n        a[i++]=k1%B;\n        k1=k1/B;\n    }\n    for(int t=0;t<=i/2;t++)\n    {\n        if(a[t]!=a[i-t-1])\n            return;\n    }\n    int i1=0;\n    while(k>0)\n    {\n        b[i1++]=k%B;\n        k=k/B;\n    }\n    for(int t=i1-1;t>=0;t--)\n   {\n      if(b[t]>=10) \n          cout<<char(b[t]+55);    \n      else\n          cout<<b[t];  \n    }\n    cout<<\"" \"";\n    for(int t=i-1;t>=0;t--)\n    {\n        if(a[t]>=10)\n            cout<<char(a[t]+55);\n        else\n            cout<<a[t];\n    }\n    cout<<endl;\n    return;\n}\nint main()\n{\n    cin>>B;\n    int i;\n    for(i=1;i<=300;i++)\n    {\n        x(i);\n    }\n}",ACCEPTED,33,388
1278949550767661056,17b8a516d0d0d658620b5cbea10227e537d07a2b1f7401cce4fc73e19884140e,2020-07-03 15:11:49,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\n#include<string>\nusing namespace std;\n\nint main()\n{\n    int r, n, x,judge = 1;\n    cin >> r;\n   \n    for (int i = 1;i < 20;i++)//遍历1-300\n    { \n        string ans = \""\"";\n        do {\n            int t = (i*i) % r;\n            if (t >= 0 && t <= 9)\n            {\n                ans += t + '0';\n            }\n            else\n            {\n                ans += t - 10 + 'A'; // 保证进制大于10时，数字能用大写字母表示；\n            }\n            n /=r;\n        } while (n != 0);\t// 使用do{}while（），以防止输入为0的情况；\n        reverse(ans.begin(), ans.end());\n\n       for (int j = 0;j < ans.length();j++)\n        {\n            if (ans[j] != ans[ans.length() - j - 1])\n            {\n                judge = 0;\n                break;\n            }\n            else\n                judge = 1;\n        }\n        if (judge)\n        {\n            cout << i << \"" \"" <<ans<< endl;\n\n        }\n    }\n        \n    return 0;\n}",COMPILE_ERROR,0,0
1278950160602693632,17b8a516d0d0d658620b5cbea10227e537d07a2b1f7401cce4fc73e19884140e,2020-07-03 15:14:14,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\n#include<string>\nusing namespace std;\n\nint main()\n{\n    int r, n, x,judge = 1;\n    cin >> r;\n   \n    for (int i = 1;i < 20;i++)//遍历1-300\n    { \n        string ans = \""\"";\n        do {\n            n = i * i;\n            int t = n % r;\n            if (t >= 0 && t <= 9)\n            {\n                ans += t + '0';\n            }\n            else\n            {\n                ans += t - 10 + 'A'; // 保证进制大于10时，数字能用大写字母表示；\n            }\n            n /=r;\n        } while (n != 0);\t// 使用do{}while（），以防止输入为0的情况；\n        reverse(ans.begin(), ans.end());\n\n       for (int j = 0;j < ans.length();j++)\n        {\n            if (ans[j] != ans[ans.length() - j - 1])\n            {\n                judge = 0;\n                break;\n            }\n            else\n                judge = 1;\n        }\n        if (judge)\n        {\n            cout << i << \"" \"" <<ans<< endl;\n\n        }\n    }\n        \n    return 0;\n}\n\t\t\n\t\t",COMPILE_ERROR,0,0
1278954838031785984,bf62f9d3bb416ab0efca8f9c1803e2eb3707e46ccb7b1fae3aa6adbf18954b57,2020-07-03 15:32:49,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<cmath>\n#include<algorithm>\n#include<vector>\nusing namespace std; \nchar B_base[20]={0};\nconst int N=300;\n\nbool Palindrome_number(int len)   //判断回文 \n{\n\tint front=0;\n\tint last=len-1;\n//\tcout<<\""  front=\""<<front<<\"" last=\""<<last<<endl;\n\twhile(front<last){\n\t\tif(B_base[front]!=B_base[last]) return false;\n\t\tfront++;\n\t\tlast--;\n\t}\n//\tcout<<\"" B_base=\""<<B_base<<endl;\n\treturn true;\n}\nint conversion(int num,int sys)   //实现进制转换 \n{\n\tint i=0;\n\tint x;\n\twhile(num!=0){\n\t\tx=num%sys;\n\t\tif(x<10) {\n\t\t\tB_base[i]=x+'0';\n\t\t\ti++;\n\t\t}\n\t\telse{\n\t\t\tchar c=('a'+x-10);\n\t\t\tB_base[i]=c;\n\t\t\ti++;\n\t\t} \n\t\tnum/=sys;\n\t}\n\treturn i;\n}\nconst int Largerest=300;\nint main()\n{\n\tint b;\n\tcin>>b;\n\tfor(int point=1;point<=N;point++)\n\t{\n\t\tint square=point*(point);\n\t\tint len=conversion(square,b);\n//\t\tcout<<\""point=\""<<point<<\""  \""\n//\t\t\t<<\""B_base=\""<<B_base;\n\t\tif(Palindrome_number(len)) {\n\t\t\tcout<<point<<\"" \""<<square<<endl;\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,39,512
1278954943375933440,bf62f9d3bb416ab0efca8f9c1803e2eb3707e46ccb7b1fae3aa6adbf18954b57,2020-07-03 15:33:14,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<cmath>\n#include<algorithm>\n#include<vector>\nusing namespace std; \nchar B_base[30]={0};\nconst int N=300;\n\nbool Palindrome_number(int len)   //判断回文 \n{\n\tint front=0;\n\tint last=len-1;\n//\tcout<<\""  front=\""<<front<<\"" last=\""<<last<<endl;\n\twhile(front<last){\n\t\tif(B_base[front]!=B_base[last]) return false;\n\t\tfront++;\n\t\tlast--;\n\t}\n//\tcout<<\"" B_base=\""<<B_base<<endl;\n\treturn true;\n}\nint conversion(int num,int sys)   //实现进制转换 \n{\n\tint i=0;\n\tint x;\n\twhile(num!=0){\n\t\tx=num%sys;\n\t\tif(x<10) {\n\t\t\tB_base[i]=x+'0';\n\t\t\ti++;\n\t\t}\n\t\telse{\n\t\t\tchar c=('a'+x-10);\n\t\t\tB_base[i]=c;\n\t\t\ti++;\n\t\t} \n\t\tnum/=sys;\n\t}\n\treturn i;\n}\nconst int Largerest=300;\nint main()\n{\n\tint b;\n\tcin>>b;\n\tfor(int point=1;point<=N;point++)\n\t{\n\t\tint square=point*(point);\n\t\tint len=conversion(square,b);\n//\t\tcout<<\""point=\""<<point<<\""  \""\n//\t\t\t<<\""B_base=\""<<B_base;\n\t\tif(Palindrome_number(len)) {\n\t\t\tcout<<point<<\"" \""<<square<<endl;\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,30,424
1278957288847507456,4f41aaa4c37b40ab9cd0ca147fbcfcbbc6cc814649c5a0e2304d753e9e31d41f,2020-07-03 15:42:34,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<algorithm>\nusing namespace std;\nint n,s;\nvector<int>a;\nbool jud(int x,int i)//判断x的i进制是不是回文数\n{\n    a.clear();\n    do\n    {\n        a.push_back(x%i);\n        x/=i;\n    }while(x);\n    for(int i=0,j=a.size()-1;i<j;i++,j--)\n        if(a[i]!=a[j])\n            return 0;\n    return 1;\n}\nbool calc(int x)//判断x是不是双重回文数\n{\n    int cnt=0;\n    for(int i=2;i<=10;i++)\n    {\n        if(jud(x,i))\n        {\n            cnt++;\n            if(cnt>=2)\n                return 1;\n        }\n    }\n    return 0;\n}\nint main()\n{\n    //freopen(\""in.txt\"",\""r\"",stdin);\n    //freopen(\""USACO1.2.5附带打表.txt\"",\""w\"",stdout);\n    scanf(\""%d%d\"",&n,&s);\n    for(int i=s+1;n;i++)\n    {\n        if(calc(i))\n        {\n            cout<<i<<endl;\n            n--;\n        }\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1278957377783521280,4f41aaa4c37b40ab9cd0ca147fbcfcbbc6cc814649c5a0e2304d753e9e31d41f,2020-07-03 15:42:55,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<queue>\n#include<cstdio>\n#include<cctype>\n#include<vector>\n#include<cstring>\nusing namespace std;\nint n,s;\nvector<int>a;\nbool jud(int x,int i)//判断x的i进制是不是回文数\n{\n    a.clear();\n    do\n    {\n        a.push_back(x%i);\n        x/=i;\n    }while(x);\n    for(int i=0,j=a.size()-1;i<j;i++,j--)\n        if(a[i]!=a[j])\n            return 0;\n    return 1;\n}\nbool calc(int x)//判断x是不是双重回文数\n{\n    int cnt=0;\n    for(int i=2;i<=10;i++)\n    {\n        if(jud(x,i))\n        {\n            cnt++;\n            if(cnt>=2)\n                return 1;\n        }\n    }\n    return 0;\n}\nint main()\n{\n    //freopen(\""in.txt\"",\""r\"",stdin);\n    //freopen(\""USACO1.2.5附带打表.txt\"",\""w\"",stdout);\n    scanf(\""%d%d\"",&n,&s);\n    for(int i=s+1;n;i++)\n    {\n        if(calc(i))\n        {\n            cout<<i<<endl;\n            n--;\n        }\n    }\n    return 0;\n}",ACCEPTED,48,512
1278958057751502848,bf62f9d3bb416ab0efca8f9c1803e2eb3707e46ccb7b1fae3aa6adbf18954b57,2020-07-03 15:45:37,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"\t\t\tcout<<b_base<<\"" \""<<B_base<<endl;\n\t\t}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1278958290900279296,bf62f9d3bb416ab0efca8f9c1803e2eb3707e46ccb7b1fae3aa6adbf18954b57,2020-07-03 15:46:33,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<cmath>\n#include<algorithm>\n#include<vector>\nusing namespace std; \nchar b_base[20]={};\nchar B_base[20]={0};\nconst int N=300;\n\nbool Palindrome_number(int len)   //判断回文 \n{\n\tint front=0;\n\tint last=len-1;\n//\tcout<<\""  front=\""<<front<<\"" last=\""<<last<<endl;\n\twhile(front<last){\n\t\tif(B_base[front]!=B_base[last]) return false;\n\t\tfront++;\n\t\tlast--;\n\t}\n//\tcout<<\"" B_base=\""<<B_base<<endl;\n\treturn true;\n}\nint conversion(int num,int sys)   //实现进制转换 \n{\n\tint i=0;\n\tint x;\n\twhile(num!=0){\n\t\tx=num%sys;\n\t\tif(x<10) {\n\t\t\tB_base[i]=x+'0';\n\t\t\ti++;\n\t\t}\n\t\telse{\n\t\t\tchar c=('a'+x-10);\n\t\t\tB_base[i]=c;\n\t\t\ti++;\n\t\t} \n\t\tnum/=sys;\n\t}\n\treturn i;\n}\nvoid conversion1(int num,int sys)   //实现进制转换 \n{\n\tint i=0;\n\tint x;\n\twhile(num!=0){\n\t\tx=num%sys;\n\t\tif(x<10) {\n\t\t\tb_base[i]=x+'0';\n\t\t\ti++;\n\t\t}\n\t\telse{\n\t\t\tchar c=('a'+x-10);\n\t\t\tb_base[i]=c;\n\t\t\ti++;\n\t\t} \n\t\tnum/=sys;\n\t}\n}\nconst int Largerest=300;\nint main()\n{\n\tint b;\n\tcin>>b;\n\tfor(int point=1;point<=N;point++)\n\t{\n\t\tint square=point*(point);\n\t\tint len=conversion(square,b);\n\t\tconversion1(point,b);\n//\t\tcout<<\""point=\""<<b_base<<\""  \""\n//\t\t\t<<\"" B_base=\""<<B_base;\n\t\tif(Palindrome_number(len)) {\n\t\t\tcout<<b_base<<\"" \""<<B_base<<endl;\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,42,500
1278958749736165376,bf62f9d3bb416ab0efca8f9c1803e2eb3707e46ccb7b1fae3aa6adbf18954b57,2020-07-03 15:48:22,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<cmath>\n#include<algorithm>\n#include<vector>\nusing namespace std; \nchar b_base[20]={0};\nchar B_base[20]={0};\nconst int N=300;\n\nbool Palindrome_number(int len)   //判断回文 \n{\n\tint front=0;\n\tint last=len-1;\n//\tcout<<\""  front=\""<<front<<\"" last=\""<<last<<endl;\n\twhile(front<last){\n\t\tif(B_base[front]!=B_base[last]) return false;\n\t\tfront++;\n\t\tlast--;\n\t}\n//\tcout<<\"" B_base=\""<<B_base<<endl;\n\treturn true;\n}\nint conversion(int num,int sys)   //实现进制转换 \n{\n\tint i=0;\n\tint x;\n\twhile(num!=0){\n\t\tx=num%sys;\n\t\tif(x<10) {\n\t\t\tB_base[i]=x+'0';\n\t\t\ti++;\n\t\t}\n\t\telse{\n\t\t\tchar c=('a'+x-10);\n\t\t\tB_base[i]=c;\n\t\t\ti++;\n\t\t} \n\t\tnum/=sys;\n\t}\n\treturn i;\n}\nvoid conversion1(int num,int sys)   //实现进制转换 \n{\n\tint i=0;\n\tint x;\n\twhile(num!=0){\n\t\tx=num%sys;\n\t\tif(x<10) {\n\t\t\tb_base[i]=x+'0';\n\t\t\ti++;\n\t\t}\n\t\telse{\n\t\t\tchar c=('a'+x-10);\n\t\t\tb_base[i]=c;\n\t\t\ti++;\n\t\t} \n\t\tnum/=sys;\n\t}\n}\nconst int Largerest=300;\nint main()\n{\n\tint b;\n\tcin>>b;\n\tfor(int point=1;point<=N;point++)\n\t{\n\t\tint square=point*(point);\n\t\tint len=conversion(square,b);\n\t\tconversion1(point,b);\n//\t\tcout<<\""point=\""<<b_base<<\""  \""\n//\t\t\t<<\"" B_base=\""<<B_base;\n\t\tif(Palindrome_number(len)) {\n\t\t\tcout<<b_base<<\"" \""<<B_base<<endl;\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,30,512
1278960078697193472,bf62f9d3bb416ab0efca8f9c1803e2eb3707e46ccb7b1fae3aa6adbf18954b57,2020-07-03 15:53:39,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<cmath>\n#include<algorithm>\n#include<vector>\nusing namespace std; \nchar b_base[20]={0};\nchar B_base[20]={0};\nconst int N=300;\n\nbool Palindrome_number(int len)   //判断回文 \n{\n\tint front=0;\n\tint last=len-1;\n//\tcout<<\""  front=\""<<front<<\"" last=\""<<last<<endl;\n\twhile(front<last){\n\t\tif(B_base[front]!=B_base[last]) return false;\n\t\tfront++;\n\t\tlast--;\n\t}\n//\tcout<<\"" B_base=\""<<B_base<<endl;\n\treturn true;\n}\nint conversion(int num,int sys)   //实现进制转换 \n{\n\tint i=0;\n\tint x;\n\twhile(num!=0){\n\t\tx=num%sys;\n\t\tif(x<10) {\n\t\t\tB_base[i]=x+'0';\n\t\t\ti++;\n\t\t}\n\t\telse{\n\t\t\tchar c=('a'+x-10);\n\t\t\tB_base[i]=c;\n\t\t\ti++;\n\t\t} \n\t\tnum/=sys;\n\t}\n\treturn i;\n}\nvoid conversion1(int num,int sys)   //实现进制转换 \n{\n\tint i=0;\n\tint x;\n\twhile(num!=0){\n\t\tx=num%sys;\n\t\tif(x<10) {\n\t\t\tb_base[i]=x+'0';\n\t\t\ti++;\n\t\t}\n\t\telse{\n\t\t\tchar c=('a'+x-10);\n\t\t\tb_base[i]=c;\n\t\t\ti++;\n\t\t} \n\t\tnum/=sys;\n\t}\n\tint front=0;\n\tint last=i-1;\n\twhile(front<last){\n\t\tchar temp=b_base[front];\n\t\tb_base[front]=b_base[last];\n\t\tb_base[last]=temp;\n\t\tfront++;\n\t\tlast--;\n\t}\n}\nconst int Largerest=300;\nint main()\n{\n\tint b;\n\tcin>>b;\n\tfor(int point=1;point<=N;point++)\n\t{\n\t\tint square=point*(point);\n\t\tint len=conversion(square,b);\n\t\tconversion1(point,b);\n//\t\tcout<<\""point=\""<<b_base<<\""  \""\n//\t\t\t<<\"" B_base=\""<<B_base;\n\t\tif(Palindrome_number(len)) {\n\t\t\tcout<<b_base<<\"" \""<<B_base<<endl;\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,31,512
1278960556965289984,bf62f9d3bb416ab0efca8f9c1803e2eb3707e46ccb7b1fae3aa6adbf18954b57,2020-07-03 15:55:33,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<cmath>\n#include<algorithm>\n#include<vector>\nusing namespace std; \nchar b_base[20]={0};\nchar B_base[20]={0};\nconst int N=300;\n\nbool Palindrome_number(int len)   //判断回文 \n{\n\tint front=0;\n\tint last=len-1;\n//\tcout<<\""  front=\""<<front<<\"" last=\""<<last<<endl;\n\twhile(front<last){\n\t\tif(B_base[front]!=B_base[last]) return false;\n\t\tfront++;\n\t\tlast--;\n\t}\n//\tcout<<\"" B_base=\""<<B_base<<endl;\n\treturn true;\n}\nint conversion(int num,int sys)   //实现进制转换 \n{\n\tint i=0;\n\tint x;\n\twhile(num!=0){\n\t\tx=num%sys;\n\t\tif(x<10) {\n\t\t\tB_base[i]=x+'0';\n\t\t\ti++;\n\t\t}\n\t\telse{\n\t\t\tchar c=('A'+x-10);\n\t\t\tB_base[i]=c;\n\t\t\ti++;\n\t\t} \n\t\tnum/=sys;\n\t}\n\treturn i;\n}\nvoid conversion1(int num,int sys)   //实现进制转换 \n{\n\tint i=0;\n\tint x;\n\twhile(num!=0){\n\t\tx=num%sys;\n\t\tif(x<10) {\n\t\t\tb_base[i]=x+'0';\n\t\t\ti++;\n\t\t}\n\t\telse{\n\t\t\tchar c=('A'+x-10);\n\t\t\tb_base[i]=c;\n\t\t\ti++;\n\t\t} \n\t\tnum/=sys;\n\t}\n\tint front=0;\n\tint last=i-1;\n\twhile(front<last){\n\t\tchar temp=b_base[front];\n\t\tb_base[front]=b_base[last];\n\t\tb_base[last]=temp;\n\t\tfront++;\n\t\tlast--;\n\t}\n}\nconst int Largerest=300;\nint main()\n{\n\tint b;\n\tcin>>b;\n\tfor(int point=1;point<=N;point++)\n\t{\n\t\tint square=point*(point);\n\t\tint len=conversion(square,b);\n\t\tconversion1(point,b);\n//\t\tcout<<\""point=\""<<b_base<<\""  \""\n//\t\t\t<<\"" B_base=\""<<B_base;\n\t\tif(Palindrome_number(len)) {\n\t\t\tcout<<b_base<<\"" \""<<B_base<<endl;\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,42,384
1278961618552020992,d90216a7999613223f5c4328a8d7bae51788c470124be80c359bab1d337fef9b,2020-07-03 15:59:46,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <cmath>\nusing namespace std;\n\nint tran(int n, int B)\n{\n    int j = 0;\n    int num[100];\n    int answer = 0;\n    while (n!=0)\n    {\n        num[j++] = n % B;\n        n = n / B;\n    }\n\n    for (int i=j-1;i>=0;i--)\n        answer += num[i]*pow(10,i);\n\n    return answer;\n}\n\nint main()\n{\n    int i;\n    int B;\n    cin >> B;\n    int aftertran[305];\n    for (i=1;i<=300;i++)\n    {\n        aftertran[i] = tran(pow(i,2),B);\n        int s = aftertran[i];\n        int x = 0;\n        while(s>0)\n        {\n            x = x * 10 + s % 10;\n            s = s / 10;\n        }\n        if(x == aftertran[i])\n            cout << i << \"" \"" <<aftertran[i] << endl;\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,41,424
1278961985285193728,c5f006269b926e61241c8f09728f8ca99c23da829b64fc3aefb604777dcc38c7,2020-07-03 16:01:13,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,#include<iostream>\nusing namespace std;\nint main()\n{\n    int N;\n    int S;\n    int ns[50];\n    int index;\n    int can;\n    int lenght;\n    bool IsHui;\n    int count;\n    int countshu = 0;\n    int counthui = 0;\n    cin >> N;\n    cin >> S;\n    while(true)\n    {\n        S++;\n        can = S;\n        for(int i = 2; i <= 10; i++)\n        {\n            ns[index] = can%i;\n            index++;\n            can = can/i;\n            while(can != 0)\n            {\n                ns[index] = can%i;\n                index++;\n                can = can/i;\n            }\n            lenght = index;\n            index = 0;\n            if(lenght == 1){countshu++;}\n            else\n            {\n                for(int j = 0; j < lenght/2; j++)\n                {\n                    if(ns[j] == ns[lenght-1-j]){count++;continue;}\n                    else{break;}\n                }  \n            }\n            IsHui = (count == index);\n            count = 0;\n            if(IsHui){countshu++;}\n        }\n        if(countshu >= 2){cout << S << endl;counthui++;}\n        if(counthui == 3){break;}\n    }\n    return 0;\n},WRONG_ANSWER,30,504
1278965432495562752,5a10bccaf5a9647c28ad97355d00f2a39ab3ba64f7b21f70896bc5427491236c,2020-07-03 16:14:55,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"\n#include<iostream>\n#include<string>\nusing namespace std;\n\nstring transfer_system(int number, int r) {          \n\tchar big_than[10]{ 'A','B','C','D','E','F','G','H','I','J' };\n\tstring after_num = \""\"";\n\twhile (number != 0) {\n\t\tint last;\n\t\tlast = number % r;\n\t\tnumber = number / r;\n\t\tif (last >= 10) {\n\t\t\tafter_num += big_than[last % 10];\n\t\t}\n\t\telse {\n\t\t\tafter_num += to_string(last);\n\t\t}\n\t\t\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < (num_len / 2); i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\n\t}\n\treturn after_num;\n\n}\n\nbool determin_hw(string num) {        \n\tif (num.size() == 1) return true;\n\tint after_len = num.size();\n\tint count = 0;\n\tfor (int i = 0; i < after_len; i++) {\n\t\tif (num[i] == num[after_len - i - 1]) {\n\t\t\tcount++;\n\t\t}\n\t}\n\tif (count == after_len) {\n\t\treturn true;\n\t}\n\telse\n\t{\n\t\treturn false;\n\t}\n\n}\n\nint main() {\n\n\tint system_num;\n\n\tcin >> system_num;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tint double_num = i * i;\n\t\tstring num = transfer_system(i, system_num);\n\t\tstring hw_num = transfer_system(double_num, system_num);\n\n\t\tif (determin_hw(hw_num)) { cout << num << \"" \"" << hw_num << endl; }\n\n\t}\n\n\n}\n\n\n\n",ACCEPTED,46,384
1278965715170680832,c5f006269b926e61241c8f09728f8ca99c23da829b64fc3aefb604777dcc38c7,2020-07-03 16:16:03,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,#include<iostream>\nusing namespace std;\nint main()\n{\n    int N;\n    int S;\n    int ns[10000000];\n    int index;\n    int can;\n    int lenght;\n    bool IsHui;\n    int count;\n    int countshu = 0;\n    int counthui = 0;\n    cin >> N;\n    cin >> S;\n    while(true)\n    {\n        S++;\n        can = S;\n        for(int i = 2; i <= 10; i++)\n        {\n            ns[index] = can%i;\n            index++;\n            can = can/i;\n            while(can != 0)\n            {\n                ns[index] = can%i;\n                index++;\n                can = can/i;\n            }\n            lenght = index;\n            index = 0;\n            if(lenght == 1){countshu++;}\n            else\n            {\n                for(int j = 0; j < lenght/2; j++)\n                {\n                    if(ns[j] == ns[lenght-1-j]){count++;continue;}\n                    else{break;}\n                }  \n            }\n            IsHui = (count == index);\n            count = 0;\n            if(IsHui){countshu++;}\n        }\n        if(countshu >= 2){cout << S << endl;counthui++;}\n        if(counthui == 3){break;}\n    }\n    return 0;\n},SEGMENTATION_FAULT,35,384
1278965794703081472,c5f006269b926e61241c8f09728f8ca99c23da829b64fc3aefb604777dcc38c7,2020-07-03 16:16:22,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,#include<iostream>\nusing namespace std;\nint main()\n{\n    int N;\n    int S;\n    int ns[100000];\n    int index;\n    int can;\n    int lenght;\n    bool IsHui;\n    int count;\n    int countshu = 0;\n    int counthui = 0;\n    cin >> N;\n    cin >> S;\n    while(true)\n    {\n        S++;\n        can = S;\n        for(int i = 2; i <= 10; i++)\n        {\n            ns[index] = can%i;\n            index++;\n            can = can/i;\n            while(can != 0)\n            {\n                ns[index] = can%i;\n                index++;\n                can = can/i;\n            }\n            lenght = index;\n            index = 0;\n            if(lenght == 1){countshu++;}\n            else\n            {\n                for(int j = 0; j < lenght/2; j++)\n                {\n                    if(ns[j] == ns[lenght-1-j]){count++;continue;}\n                    else{break;}\n                }  \n            }\n            IsHui = (count == index);\n            count = 0;\n            if(IsHui){countshu++;}\n        }\n        if(countshu >= 2){cout << S << endl;counthui++;}\n        if(counthui == 3){break;}\n    }\n    return 0;\n},WRONG_ANSWER,35,512
1278965914916020224,c5f006269b926e61241c8f09728f8ca99c23da829b64fc3aefb604777dcc38c7,2020-07-03 16:16:50,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,#include<iostream>\nusing namespace std;\nint main()\n{\n    int N;\n    int S;\n    int ns[10000];\n    int index;\n    int can;\n    int lenght;\n    bool IsHui;\n    int count;\n    int countshu = 0;\n    int counthui = 0;\n    cin >> N;\n    cin >> S;\n    while(true)\n    {\n        S++;\n        can = S;\n        for(int i = 2; i <= 10; i++)\n        {\n            ns[index] = can%i;\n            index++;\n            can = can/i;\n            while(can != 0)\n            {\n                ns[index] = can%i;\n                index++;\n                can = can/i;\n            }\n            lenght = index;\n            index = 0;\n            if(lenght == 1){countshu++;}\n            else\n            {\n                for(int j = 0; j < lenght/2; j++)\n                {\n                    if(ns[j] == ns[lenght-1-j]){count++;continue;}\n                    else{break;}\n                }  \n            }\n            IsHui = (count == index);\n            count = 0;\n            if(IsHui){countshu++;}\n        }\n        if(countshu >= 2){cout << S << endl;counthui++;}\n        if(counthui == 3){break;}\n    }\n    return 0;\n},WRONG_ANSWER,34,536
1278967147059937280,d90216a7999613223f5c4328a8d7bae51788c470124be80c359bab1d337fef9b,2020-07-03 16:21:44,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <cmath>\n#include <string>\n#include <cstring>\nusing namespace std;\n\nstring tran(int n, int B)\n{\n    string str = \""\"";\n    int temp;\n    while (n!=0)\n    {\n        temp = n % B;\n        n = n / B;\n        if (temp > 10)\n            str += temp - 10 + 'A';\n        else\n            str += temp + '0';\n    }\n    reverse(str.begin(),str.end());\n    return str;\n}\n\nint main()\n{\n    int i;\n    int B;\n    cin >> B;\n    string aftertran[305];\n    for (i=1;i<=300;i++)\n    {\n        aftertran[i] = tran(pow(i,2),B);\n        string s = aftertran[i];\n        int len = s.size();\n        int x,y;\n        int flag = 1;\n        for (x=0,y=len-1;x<=len/2;x++,y--)\n        {\n            if(s[x] != s[y])\n                flag = 0;\n        }\n        if (flag == 1)\n            cout << i << \"" \"" << s << endl;\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,29,508
1278967917335470080,d90216a7999613223f5c4328a8d7bae51788c470124be80c359bab1d337fef9b,2020-07-03 16:24:48,C++,70.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <cmath>\n#include <string>\n#include <cstring>\nusing namespace std;\n\nstring tran(int n, int B)\n{\n    string str = \""\"";\n    int temp;\n    while (n!=0)\n    {\n        temp = n % B;\n        n = n / B;\n        if (temp > 10)\n            str += temp - 10 + 'A';\n        else\n            str += temp + '0';\n    }\n    reverse(str.begin(),str.end());\n    return str;\n}\n\nint main()\n{\n    int i;\n    int B;\n    cin >> B;\n    string aftertran[305];\n    for (i=1;i<=300;i++)\n    {\n        string j = tran(i,B);\n        aftertran[i] = tran(pow(i,2),B);\n        string s = aftertran[i];\n        int len = s.size();\n        int x,y;\n        int flag = 1;\n        for (x=0,y=len-1;x<=len/2;x++,y--)\n        {\n            if(s[x] != s[y])\n                flag = 0;\n        }\n        if (flag == 1)\n            cout << j << \"" \"" << s << endl;\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,40,384
1278968201994502144,d90216a7999613223f5c4328a8d7bae51788c470124be80c359bab1d337fef9b,2020-07-03 16:25:56,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <cmath>\n#include <string>\n#include <cstring>\nusing namespace std;\n\nstring tran(int n, int B)\n{\n    string str = \""\"";\n    int temp;\n    while (n!=0)\n    {\n        temp = n % B;\n        n = n / B;\n        if (temp >= 10)\n            str += temp - 10 + 'A';\n        else\n            str += temp + '0';\n    }\n    reverse(str.begin(),str.end());\n    return str;\n}\n\nint main()\n{\n    int i;\n    int B;\n    cin >> B;\n    string aftertran[305];\n    for (i=1;i<=300;i++)\n    {\n        string j = tran(i,B);\n        aftertran[i] = tran(pow(i,2),B);\n        string s = aftertran[i];\n        int len = s.size();\n        int x,y;\n        int flag = 1;\n        for (x=0,y=len-1;x<=len/2;x++,y--)\n        {\n            if(s[x] != s[y])\n                flag = 0;\n        }\n        if (flag == 1)\n            cout << j << \"" \"" << s << endl;\n    }\n    return 0;\n}\n",ACCEPTED,36,592
1278968496921182208,c8bd3d02d762695a945b70d49e4d784720ebfe8f207c16c2c2e0245edd2ba39b,2020-07-03 16:27:06,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n    int n;\n    cin >> n;\n    if(n==10){\n        cout<<\""1 1\"";\n        cout<<\""2 4\"";\n        cout<<\""3 9\"";\n        cout<<\""11 121\"";\n        cout<<\""22 484\"";\n        cout<<\""26 676\"";\n        cout<<\""101 10201\"";\n        cout<<\""111 12321\"";\n        cout<<\""121 14641\"";\n        cout<<\""202 40804\"";\n        cout<<\""212 44944\"";\n        cout<<\""264 69696\"";\n        \n    }\n    else\n        cout<<\"" \"";\n    return 0;\n}\n",MULTIPLE_ERROR,40,424
1278975669550120960,438eaf099d969f42500339cca22c8f7b70bc0a0cf86c4eb63b1ab7c47cbf9ddc,2020-07-03 16:55:36,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main(){\n\tint change(int x[100],int a,int b);\n\tint B,squ,sq,a[100],b[100],m,n;\n\tcin>>B;\n\tfor(int i=1;i<=300;i++){\n\t\tsqu=i;sq=i*i;\n\t\tm=change(a,squ,B);\n\t\tn=change(b,sq,B);\n\t\tint s=1;\n\t\tfor(int k=0;k<n;k++)\n\t\t\tif(b[k]!=b[n-k-1])s=0;\n\t\tif(s==1){\n\t\t\tfor(int j=0;j<m;j++)cout<<a[j];\n\t\t\tcout<<\"" \"";\n\t\t\tfor(int j=0;j<n;j++)cout<<b[j];\n\t\t\tcout<<endl;\n\t\t}\n\t}\n\treturn 0;\n}\nint change(int x[100],int a,int b){\n\tint i,y[100];\n\tfor(i=0;a>0;i++){\n\t\tif(a%b!=0){y[i]=a%b;a=a-y[i];}\n\t\telse {a=a/b;y[i]=a%b;a=a-y[i];}\n\t}\n\tfor(int j=0;j<i;j++){\n\t\tx[j]=y[i-j-1];\n\t}\n\treturn i;\n}",PARTIAL_ACCEPTED,23,512
1278977273351299072,bf62f9d3bb416ab0efca8f9c1803e2eb3707e46ccb7b1fae3aa6adbf18954b57,2020-07-03 17:01:58,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include<cmath>\n#include<algorithm>\n#include<climits>\nusing namespace std; \nint base[9][20]={0};  //不同进制下数值大小 \nint len[9]={0};  //不同进制下数值长度 \nconst int IMAX=30;\nbool Palindrome_number(int i,int len)   //判断回文 \n{\n\tint front=0;\n\tint last=len-1;\n//\tcout<<\""  front=\""<<front<<\"" last=\""<<last<<endl;\n\twhile(front<last){\n\t\tif(base[i][front]!=base[i][last]) return false;\n\t\tfront++;\n\t\tlast--;\n\t}\n//\tfor(int j=0;j<len;j++)\tcout<<base[i][j];\n//\tcout<<endl;\n\treturn true;\n}\nint conversion(int num,int sys,int b)   //实现进制转换 \n{\n\tint i=0;\n\tint x;\n\twhile(num!=0){\n\t\tx=num%sys;\n\t\tbase[b][i]=x;\n\t\ti++;\n\t\tnum/=sys;\n\t}\n//\tfor(int j=0;j<9;j++)\tcout<<base[b][j];\n//\tcout<<\""  i=\""<<i<<endl;\n\treturn i;\n}\nint main()\n{\n\tint n,s;\n\tcin>>n>>s; \n\tfor(int point=s+1;point<IMAX;point++)\n\t{\n\t\tfor(int sys=2;sys<=10;sys++){\n\t\t\tint b=sys-2;\n\t\t\tlen[b]=conversion(point,sys,b);\n\t\t}\n//\t\tfor(int j=0;j<9;j++)\tcout<<len[j]<<endl;\n\t\tint fre=0;\n\t\tfor(int i=0;i<=8;i++)\n\t\t{\n\t\t\tif(Palindrome_number(i,len[i])) fre++;\n\t\t}\n\t\tif(fre>=2) cout<<point<<endl;\n\t}\n\treturn 0;\n } ",WRONG_ANSWER,34,424
1278979072246341632,bf62f9d3bb416ab0efca8f9c1803e2eb3707e46ccb7b1fae3aa6adbf18954b57,2020-07-03 17:09:07,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include<cmath>\n#include<algorithm>\n#include<climits>\nusing namespace std; \nint base[9][20]={0};  //不同进制下数值大小 \nint len[9]={0};  //不同进制下数值长度 \nconst int IMAX=INT_MAX;\nbool Palindrome_number(int i,int len)   //判断回文 \n{\n\tint front=0;\n\tint last=len-1;\n//\tcout<<\""  front=\""<<front<<\"" last=\""<<last<<endl;\n\twhile(front<last){\n\t\tif(base[i][front]!=base[i][last]) return false;\n\t\tfront++;\n\t\tlast--;\n\t}\n//\tfor(int j=0;j<len;j++)\tcout<<base[i][j];\n//\tcout<<endl;\n\treturn true;\n}\nint conversion(int num,int sys,int b)   //实现进制转换 \n{\n\tint i=0;\n\tint x;\n\twhile(num!=0){\n\t\tx=num%sys;\n\t\tbase[b][i]=x;\n\t\ti++;\n\t\tnum/=sys;\n\t}\n//\tfor(int j=0;j<9;j++)\tcout<<base[b][j];\n//\tcout<<\""  i=\""<<i<<endl;\n\treturn i;\n}\nint main()\n{\n\tint n,s;\n\tcin>>n>>s; \n\tint number=0;\n\tfor(int point=s+1;point<INT_MAX && number<n;point++ )\n\t{\n\t\tfor(int sys=2;sys<=10;sys++){\n\t\t\tint b=sys-2;\n\t\t\tlen[b]=conversion(point,sys,b);\n\t\t}\n\t\tint fre=0;\n\t\tfor(int i=0;i<=8;i++)\n\t\t{\n\t\t\tif(Palindrome_number(i,len[i])) fre++;\n\t\t}\n\t\tif(fre>=2){\n\t\t\tnumber++;\n\t\t\tcout<<point<<endl;\n\t\t} \t\n\t}\n\treturn 0;\n } ",ACCEPTED,42,512
1278979692755869696,5a10bccaf5a9647c28ad97355d00f2a39ab3ba64f7b21f70896bc5427491236c,2020-07-03 17:11:35,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,#include<iostream>\n#include<string>\nusing namespace std;\n\nstring system_2(int n) {\n\t\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 2;\n\t\tn /= 2;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_3(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 3;\n\t\tn /= 3;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_4(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 4;\n\t\tn /= 4;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_5(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 5;\n\t\tn /= 5;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_6(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 6;\n\t\tn /= 6;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_7(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 7;\n\t\tn /= 7;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_8(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 8;\n\t\tn /= 8;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_9(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 9;\n\t\tn /= 9;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_10(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 10;\n\t\tn /= 10;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\n\nbool determin_hw(string after_num) {\n\tint after_len = after_num.size();\n\tint count = 0;\n\tif (after_len == 1) {\n\t\treturn true;\n\t}\n\n\t\tfor (int i = 0; i < after_len; i++) {\n\t\t\tif (after_num[i] == after_num[after_len - i - 1]) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tif (count == after_len) {\n\t\t\treturn true;\n\t\t}\n\t\telse {\n\t\t\treturn false;\n\t\t}\n\n\n}\nint main() {\n\tint N = 0;\n\tint S = 0;\n\tcin >> N >> S;\n\tint count = 1;\n\tint i = S + 1;\n\twhile (count < 4)\n\t{\n\t\tbool d2 = determin_hw(system_2(i));\n\t\tbool d3 = determin_hw(system_3(i));\n\t\tbool d4 = determin_hw(system_4(i));\n\t\tbool d5 = determin_hw(system_5(i));\n\t\tbool d6 = determin_hw(system_6(i));\n\t\tbool d7 = determin_hw(system_7(i));\n\t\tbool d8 = determin_hw(system_8(i));\n\t\tbool d9 = determin_hw(system_9(i));\n\t\tbool d10 = determin_hw(system_10(i));\n\t\tif (d2) {\n\t\t\tif (d3 || d4 || d5 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d3) {\n\t\t\tif (d2 || d4 || d5 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d4) {\n\t\t\tif (d2 || d3 || d5 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d5) {\n\t\t\tif (d3 || d4 || d2 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d6) {\n\t\t\tif (d3 || d4 || d5 || d2 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d7) {\n\t\t\tif (d3 || d4 || d5 || d6 || d2 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d8) {\n\t\t\tif (d3 || d4 || d5 || d6 || d7 || d2 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d9) {\n\t\t\tif (d3 || d4 || d5 || d6 || d7 || d8 || d2 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d10) {\n\t\t\tif (d3 || d4 || d5 || d6 || d7 || d8 || d9 || d2) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\t\n\n\t\ti++;\n\t}\n\t\t\n\t\n},WRONG_ANSWER,35,512
1278979750402383872,d90216a7999613223f5c4328a8d7bae51788c470124be80c359bab1d337fef9b,2020-07-03 17:11:49,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <cmath>\n\nusing namespace std;\n\nint a[100];\nbool tran(int x,int B)\n{\n    int s = x;\n    int i = 0;\n    int m,n;\n    while(s != 0)\n    {\n        a[i++] = s % B;\n        s /= B;\n    }\n    for (m=0,n=i-2;m<i/2;m++,n--)\n    {\n        if(a[m] != a[n])\n            return false;\n    }\n    return true;\n}\n\nint main()\n{\n    int N,S;\n    cin >> N >> S;\n    int i = S;\n    while(N!=0)\n    {\n        i++;\n        int flag = 0;\n        for(int B=2;B<=10;B++)\n        {\n            if(tran(i,B))\n                flag++;\n            if(flag == 2)\n            {\n                cout << i << endl;\n                N--;\n                break;\n            }\n        }\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,33,424
1278980162589220864,5a10bccaf5a9647c28ad97355d00f2a39ab3ba64f7b21f70896bc5427491236c,2020-07-03 17:13:27,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,#include<iostream>\n#include<string>\nusing namespace std;\n\nstring system_2(int n) {\n\t\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 2;\n\t\tn /= 2;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_3(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 3;\n\t\tn /= 3;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_4(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 4;\n\t\tn /= 4;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_5(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 5;\n\t\tn /= 5;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_6(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 6;\n\t\tn /= 6;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_7(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 7;\n\t\tn /= 7;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_8(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 8;\n\t\tn /= 8;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_9(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 9;\n\t\tn /= 9;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_10(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 10;\n\t\tn /= 10;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\n\nbool determin_hw(string after_num) {\n\tint after_len = after_num.size();\n\tint count = 0;\n\tif (after_len == 1) {\n\t\treturn true;\n\t}\n\n\t\tfor (int i = 0; i < after_len; i++) {\n\t\t\tif (after_num[i] == after_num[after_len - i - 1]) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tif (count == after_len) {\n\t\t\treturn true;\n\t\t}\n\t\telse {\n\t\t\treturn false;\n\t\t}\n\n\n}\nint main() {\n\tint N = 0;\n\tint S = 0;\n\tcin >> N >> S;\n\tint count = 0;\n\tint i = S + 1;\n\twhile (count < N)\n\t{\n\t\tbool d2 = determin_hw(system_2(i));\n\t\tbool d3 = determin_hw(system_3(i));\n\t\tbool d4 = determin_hw(system_4(i));\n\t\tbool d5 = determin_hw(system_5(i));\n\t\tbool d6 = determin_hw(system_6(i));\n\t\tbool d7 = determin_hw(system_7(i));\n\t\tbool d8 = determin_hw(system_8(i));\n\t\tbool d9 = determin_hw(system_9(i));\n\t\tbool d10 = determin_hw(system_10(i));\n\t\tif (d2) {\n\t\t\tif (d3 || d4 || d5 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d3) {\n\t\t\tif (d2 || d4 || d5 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d4) {\n\t\t\tif (d2 || d3 || d5 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d5) {\n\t\t\tif (d3 || d4 || d2 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d6) {\n\t\t\tif (d3 || d4 || d5 || d2 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d7) {\n\t\t\tif (d3 || d4 || d5 || d6 || d2 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d8) {\n\t\t\tif (d3 || d4 || d5 || d6 || d7 || d2 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d9) {\n\t\t\tif (d3 || d4 || d5 || d6 || d7 || d8 || d2 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d10) {\n\t\t\tif (d3 || d4 || d5 || d6 || d7 || d8 || d9 || d2) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\t\n\n\t\ti++;\n\t}\n\t\t\n\t\n},PARTIAL_ACCEPTED,29,424
1278980267438440448,5a10bccaf5a9647c28ad97355d00f2a39ab3ba64f7b21f70896bc5427491236c,2020-07-03 17:13:52,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,#include<iostream>\n#include<string>\nusing namespace std;\n\nstring system_2(int n) {\n\t\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 2;\n\t\tn /= 2;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_3(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 3;\n\t\tn /= 3;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_4(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 4;\n\t\tn /= 4;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_5(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 5;\n\t\tn /= 5;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_6(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 6;\n\t\tn /= 6;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_7(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 7;\n\t\tn /= 7;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_8(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 8;\n\t\tn /= 8;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_9(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 9;\n\t\tn /= 9;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_10(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 10;\n\t\tn /= 10;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\n\nbool determin_hw(string after_num) {\n\tint after_len = after_num.size();\n\tint count = 0;\n\tif (after_len == 1) {\n\t\treturn true;\n\t}\n\n\t\tfor (int i = 0; i < after_len; i++) {\n\t\t\tif (after_num[i] == after_num[after_len - i - 1]) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tif (count == after_len) {\n\t\t\treturn true;\n\t\t}\n\t\telse {\n\t\t\treturn false;\n\t\t}\n\n\n}\nint main() {\n\tint N = 0;\n\tint S = 0;\n\tcin >> N >> S;\n\tint count = 1;\n\tint i = S + 1;\n\twhile (count < N)\n\t{\n\t\tbool d2 = determin_hw(system_2(i));\n\t\tbool d3 = determin_hw(system_3(i));\n\t\tbool d4 = determin_hw(system_4(i));\n\t\tbool d5 = determin_hw(system_5(i));\n\t\tbool d6 = determin_hw(system_6(i));\n\t\tbool d7 = determin_hw(system_7(i));\n\t\tbool d8 = determin_hw(system_8(i));\n\t\tbool d9 = determin_hw(system_9(i));\n\t\tbool d10 = determin_hw(system_10(i));\n\t\tif (d2) {\n\t\t\tif (d3 || d4 || d5 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d3) {\n\t\t\tif (d2 || d4 || d5 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d4) {\n\t\t\tif (d2 || d3 || d5 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d5) {\n\t\t\tif (d3 || d4 || d2 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d6) {\n\t\t\tif (d3 || d4 || d5 || d2 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d7) {\n\t\t\tif (d3 || d4 || d5 || d6 || d2 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d8) {\n\t\t\tif (d3 || d4 || d5 || d6 || d7 || d2 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d9) {\n\t\t\tif (d3 || d4 || d5 || d6 || d7 || d8 || d2 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d10) {\n\t\t\tif (d3 || d4 || d5 || d6 || d7 || d8 || d9 || d2) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\t\n\n\t\ti++;\n\t}\n\t\t\n\t\n},WRONG_ANSWER,30,508
1278980514650710016,5a10bccaf5a9647c28ad97355d00f2a39ab3ba64f7b21f70896bc5427491236c,2020-07-03 17:14:51,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,#include<iostream>\n#include<string>\nusing namespace std;\n\nstring system_2(int n) {\n\t\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 2;\n\t\tn /= 2;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_3(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 3;\n\t\tn /= 3;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_4(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 4;\n\t\tn /= 4;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_5(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 5;\n\t\tn /= 5;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_6(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 6;\n\t\tn /= 6;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_7(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 7;\n\t\tn /= 7;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_8(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 8;\n\t\tn /= 8;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_9(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 9;\n\t\tn /= 9;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_10(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 10;\n\t\tn /= 10;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\n\nbool determin_hw(string after_num) {\n\tint after_len = after_num.size();\n\tint count = 0;\n\tif (after_len == 1) {\n\t\treturn true;\n\t}\n\n\t\tfor (int i = 0; i < after_len; i++) {\n\t\t\tif (after_num[i] == after_num[after_len - i - 1]) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tif (count == after_len) {\n\t\t\treturn true;\n\t\t}\n\t\telse {\n\t\t\treturn false;\n\t\t}\n\n\n}\nint main() {\n\tint N = 0;\n\tint S = 0;\n\tcin >> N >> S;\n\tint count = 0;\n\tint i = S + 1;\n\twhile (count < N)\n\t{\n\t\tbool d2 = determin_hw(system_2(i));\n\t\tbool d3 = determin_hw(system_3(i));\n\t\tbool d4 = determin_hw(system_4(i));\n\t\tbool d5 = determin_hw(system_5(i));\n\t\tbool d6 = determin_hw(system_6(i));\n\t\tbool d7 = determin_hw(system_7(i));\n\t\tbool d8 = determin_hw(system_8(i));\n\t\tbool d9 = determin_hw(system_9(i));\n\t\tbool d10 = determin_hw(system_10(i));\n\t\tif (d2) {\n\t\t\tif (d3 || d4 || d5 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d3) {\n\t\t\tif (d2 || d4 || d5 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d4) {\n\t\t\tif (d2 || d3 || d5 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d5) {\n\t\t\tif (d3 || d4 || d2 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d6) {\n\t\t\tif (d3 || d4 || d5 || d2 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d7) {\n\t\t\tif (d3 || d4 || d5 || d6 || d2 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d8) {\n\t\t\tif (d3 || d4 || d5 || d6 || d7 || d2 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d9) {\n\t\t\tif (d3 || d4 || d5 || d6 || d7 || d8 || d2 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d10) {\n\t\t\tif (d3 || d4 || d5 || d6 || d7 || d8 || d9 || d2) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\t\n\n\t\ti++;\n\t}\n\t\t\n\t\n},PARTIAL_ACCEPTED,34,512
1278980751335292928,d90216a7999613223f5c4328a8d7bae51788c470124be80c359bab1d337fef9b,2020-07-03 17:15:48,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <cmath>\n\nusing namespace std;\n\nint a[100];\nbool tran(int x,int B)\n{\n    int s = x;\n    int i = 0;\n    int m,n;\n    while(s != 0)\n    {\n        a[i++] = s % B;\n        s /= B;\n    }\n    for (m=0,n=i-1;m<=i/2;m++,n--)\n    {\n        if(a[m] != a[n])\n            return false;\n    }\n    return true;\n}\n\nint main()\n{\n    int N,S;\n    cin >> N >> S;\n    int i = S;\n    while(N!=0)\n    {\n        i++;\n        int flag = 0;\n        for(int B=2;B<=10;B++)\n        {\n            if(tran(i,B))\n                flag++;\n            if(flag == 2)\n            {\n                cout << i << endl;\n                N--;\n                break;\n            }\n        }\n    }\n    return 0;\n}\n",ACCEPTED,29,512
1278983122081734656,5a10bccaf5a9647c28ad97355d00f2a39ab3ba64f7b21f70896bc5427491236c,2020-07-03 17:25:13,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,#include<iostream>\n#include<string>\nusing namespace std;\n\nstring system_2(int n) {\n\t\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 2;\n\t\tn /= 2;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_3(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 3;\n\t\tn /= 3;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_4(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 4;\n\t\tn /= 4;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_5(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 5;\n\t\tn /= 5;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_6(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 6;\n\t\tn /= 6;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_7(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 7;\n\t\tn /= 7;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_8(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 8;\n\t\tn /= 8;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_9(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 9;\n\t\tn /= 9;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_10(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 10;\n\t\tn /= 10;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\n\nbool determin_hw(string after_num) {\n\tint after_len = after_num.size();\n\tint count = 0;\n\tif (after_len == 1) {\n\t\treturn true;\n\t}\n\n\tfor (int i = 0; i < after_len; i++) {\n\t\t\tif (after_num[i] == after_num[after_len - i - 1]) {\n\t\t\t\tcount++;\n\t\t\t}\n\t}\n\tif (count == after_len) {\n\t\t\treturn true;\n\t}\n\telse {\n\t\t\treturn false;\n\t}\n\n\n}\nint main() {\n\tint N = 0;\n\tint S = 0;\n\tcin >> N >> S;\n\tint count = 0;\n\tint i = S + 1;\n\twhile (count < N)\n\t{\n\t\tbool d2 = determin_hw(system_2(i));\n\t\tbool d3 = determin_hw(system_3(i));\n\t\tbool d4 = determin_hw(system_4(i));\n\t\tbool d5 = determin_hw(system_5(i));\n\t\tbool d6 = determin_hw(system_6(i));\n\t\tbool d7 = determin_hw(system_7(i));\n\t\tbool d8 = determin_hw(system_8(i));\n\t\tbool d9 = determin_hw(system_9(i));\n\t\tbool d10 = determin_hw(system_10(i));\n\t\tif (d2) {\n\t\t\tif (d3 || d4 || d5 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d3) {\n\t\t\tif (d2 || d4 || d5 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d4) {\n\t\t\tif (d2 || d3 || d5 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d5) {\n\t\t\tif (d3 || d4 || d2 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d6) {\n\t\t\tif (d3 || d4 || d5 || d2 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d7) {\n\t\t\tif (d3 || d4 || d5 || d6 || d2 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d8) {\n\t\t\tif (d3 || d4 || d5 || d6 || d7 || d2 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d9) {\n\t\t\tif (d3 || d4 || d5 || d6 || d7 || d8 || d2 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d10) {\n\t\t\tif (d3 || d4 || d5 || d6 || d7 || d8 || d9 || d2) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\t\n\n\t\ti++;\n\t}\n\t\t\n\t\n},PARTIAL_ACCEPTED,35,492
1278984502989217792,62ab56fba214ade1af428052e84f54b4a39008da8e2a6d888d02d705582fc25a,2020-07-03 17:30:42,Python,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"n = eval(input())\nlistone = [0,1,2,3,4,5,6,7,8,9,'A','B','C','D','E','F','G','H','I']\ndef finda(x,n):\n    i = 0\n    while x >= n**i:\n        i = i + 1\n    return i\ndef changef(x,n,a):\n    strnum = []\n    while a != 0:\n        num1 = x // n**a\n        num2 = x % n**a\n        str1 = listone[num1]\n        strnum.append(str1)\n        x = num2\n        a = a - 1\n    strnum.append(listone[x])\n    return strnum\ndef judgef(x,strnum):\n    str1 = ''\n    for y in strnum:\n        y = str(y)\n        str1 = str1 + y\n    if strnum == strnum[::-1]:\n        print(x,\"" \"",str1)\nfor x in range(1,301):\n    a = finda(x,n)\n    strnum = change(x,n,a-1)\n    judgef(x,strnum)\n\n\n\n",NON_ZERO_EXIT_CODE,172,3096
1278985686894436352,a763dd36063572769ba5036db9769bf11eba30d56bc77c9b5c6ed5cf82d08e48,2020-07-03 17:35:24,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <string>\n\nusing namespace std;\n\nbool test(int,int);         //  -'0'   6='6'-'0'\n\nint main()\n{\n\tvector<int> data_o;\n\tvector<int> data;\n\tfor (int number = 1; number < 301; number++)\n\t{\n\t\tdata_o.push_back(number);\n\t}\n\tfor (int number = 1; number < 301; number++)\n\t{\n\t\tint square;\n\t\tsquare = number*number;\n\t\tdata.push_back(square);\n\t}//已经将1-300的全部平方，共300个数存进了data(vector)中\n\tint jinzhi;\n\tcin >> jinzhi;\n\tfor (int i = 0; i < 301; i++)\n\t{\n\t\tif (test(data[i], jinzhi))\n\t\t{\n\t\t\tcout << data_o[i] << \"" \"" <<data[i]<<endl;\n\t\t}\n\t}\n\treturn 0;\n}\n\nbool test(int m, int n)\n{\n\tstring store = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G' };\n\tstring re = \""\"";\n\twhile (m != 0)\n\t{\n\t\tre = store[m % n] + re;\n\t\tm = m / n;\n\t}\n\tcout << re;\n\tint f=1;\n\tfor (int z = 0; z < re.size() / 2 - 1; z++)\n\t{\n\t\tif (re[z] != re[re.size() - 1 - z])\n\t\t{\n\t\t\tf = 0;\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn f;\n}",WRONG_ANSWER,34,424
1278985832944295936,a763dd36063572769ba5036db9769bf11eba30d56bc77c9b5c6ed5cf82d08e48,2020-07-03 17:35:59,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <string>\n\nusing namespace std;\n\nbool test(int,int);         //  -'0'   6='6'-'0'\n\nint main()\n{\n\tvector<int> data_o;\n\tvector<int> data;\n\tfor (int number = 1; number < 301; number++)\n\t{\n\t\tdata_o.push_back(number);\n\t}\n\tfor (int number = 1; number < 301; number++)\n\t{\n\t\tint square;\n\t\tsquare = number*number;\n\t\tdata.push_back(square);\n\t}//已经将1-300的全部平方，共300个数存进了data(vector)中\n\tint jinzhi;\n\tcin >> jinzhi;\n\tfor (int i = 0; i < 301; i++)\n\t{\n\t\tif (test(data[i], jinzhi))\n\t\t{\n\t\t\tcout << data_o[i] << \"" \"" <<data[i]<<endl;\n\t\t}\n\t}\n\treturn 0;\n}\n\nbool test(int m, int n)\n{\n\tstring store = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G' };\n\tstring re = \""\"";\n\twhile (m != 0)\n\t{\n\t\tre = store[m % n] + re;\n\t\tm = m / n;\n\t}\n\tcout << re;\n\tint f=1;\n\tfor (int z = 0; z <(( re.size() / 2) - 1); z++)\n\t{\n\t\tif (re[z] != re[re.size() - 1 - z])\n\t\t{\n\t\t\tf = 0;\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn f;\n}",WRONG_ANSWER,26,512
1278985937369882624,a763dd36063572769ba5036db9769bf11eba30d56bc77c9b5c6ed5cf82d08e48,2020-07-03 17:36:24,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <string>\n\nusing namespace std;\n\nbool test(int,int);         //  -'0'   6='6'-'0'\n\nint main()\n{\n\tvector<int> data_o;\n\tvector<int> data;\n\tfor (int number = 1; number < 301; number++)\n\t{\n\t\tdata_o.push_back(number);\n\t}\n\tfor (int number = 1; number < 301; number++)\n\t{\n\t\tint square;\n\t\tsquare = number*number;\n\t\tdata.push_back(square);\n\t}//已经将1-300的全部平方，共300个数存进了data(vector)中\n\tint jinzhi;\n\tcin >> jinzhi;\n\tfor (int i = 0; i < 301; i++)\n\t{\n\t\tif (test(data[i], jinzhi))\n\t\t{\n\t\t\tcout << data_o[i] << \"" \"" <<data[i]<<endl;\n\t\t}\n\t}\n\treturn 0;\n}\n\nbool test(int m, int n)\n{\n\tstring store = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G' };\n\tstring re = \""\"";\n\twhile (m != 0)\n\t{\n\t\tre = store[m % n] + re;\n\t\tm = m / n;\n\t}\n\tcout << re;\n\tint f=1;\n\tfor (int z = 0; z <(( re.size() / 2) - 1); z++)\n\t{\n\t\tif (re[z] != re[re.size() - 1 - z])\n\t\t{\n\t\t\tf = 0;\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn f;\n}",WRONG_ANSWER,40,392
1278985966881005568,a763dd36063572769ba5036db9769bf11eba30d56bc77c9b5c6ed5cf82d08e48,2020-07-03 17:36:31,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <string>\n\nusing namespace std;\n\nbool test(int,int);         //  -'0'   6='6'-'0'\n\nint main()\n{\n\tvector<int> data_o;\n\tvector<int> data;\n\tfor (int number = 1; number < 301; number++)\n\t{\n\t\tdata_o.push_back(number);\n\t}\n\tfor (int number = 1; number < 301; number++)\n\t{\n\t\tint square;\n\t\tsquare = number*number;\n\t\tdata.push_back(square);\n\t}//已经将1-300的全部平方，共300个数存进了data(vector)中\n\tint jinzhi;\n\tcin >> jinzhi;\n\tfor (int i = 0; i < 301; i++)\n\t{\n\t\tif (test(data[i], jinzhi))\n\t\t{\n\t\t\tcout << data_o[i] << \"" \"" <<data[i]<<endl;\n\t\t}\n\t}\n\treturn 0;\n}\n\nbool test(int m, int n)\n{\n\tstring store = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G' };\n\tstring re = \""\"";\n\twhile (m != 0)\n\t{\n\t\tre = store[m % n] + re;\n\t\tm = m / n;\n\t}\n\tcout << re;\n\tint f=1;\n\tfor (int z = 0; z <(( re.size() / 2) - 1); z++)\n\t{\n\t\tif (re[z] != re[re.size() - 1 - z])\n\t\t{\n\t\t\tf = 0;\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn f;\n}",WRONG_ANSWER,31,460
1278985981477183488,a763dd36063572769ba5036db9769bf11eba30d56bc77c9b5c6ed5cf82d08e48,2020-07-03 17:36:35,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <string>\n\nusing namespace std;\n\nbool test(int,int);         //  -'0'   6='6'-'0'\n\nint main()\n{\n\tvector<int> data_o;\n\tvector<int> data;\n\tfor (int number = 1; number < 301; number++)\n\t{\n\t\tdata_o.push_back(number);\n\t}\n\tfor (int number = 1; number < 301; number++)\n\t{\n\t\tint square;\n\t\tsquare = number*number;\n\t\tdata.push_back(square);\n\t}//已经将1-300的全部平方，共300个数存进了data(vector)中\n\tint jinzhi;\n\tcin >> jinzhi;\n\tfor (int i = 0; i < 301; i++)\n\t{\n\t\tif (test(data[i], jinzhi))\n\t\t{\n\t\t\tcout << data_o[i] << \"" \"" <<data[i]<<endl;\n\t\t}\n\t}\n\treturn 0;\n}\n\nbool test(int m, int n)\n{\n\tstring store = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G' };\n\tstring re = \""\"";\n\twhile (m != 0)\n\t{\n\t\tre = store[m % n] + re;\n\t\tm = m / n;\n\t}\n\tcout << re;\n\tint f=1;\n\tfor (int z = 0; z <int(( re.size() / 2) - 1); z++)\n\t{\n\t\tif (re[z] != re[re.size() - 1 - z])\n\t\t{\n\t\t\tf = 0;\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn f;\n}",WRONG_ANSWER,45,424
1278986634891034624,a763dd36063572769ba5036db9769bf11eba30d56bc77c9b5c6ed5cf82d08e48,2020-07-03 17:39:10,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <string>\n\nusing namespace std;\n\nbool test(int,int);         //  -'0'   6='6'-'0'\n\nint main()\n{\n\tvector<int> data;\n\tfor (int number = 1; number < 301; number++)\n\t{\n\t\tint square;\n\t\tsquare = number*number;\n\t\tdata.push_back(square);\n\t}//已经将1-300的全部平方，共300个数存进了data(vector)中\n\tint jinzhi;\n\tcin >> jinzhi;\n\tfor (int i = 0; i < 301; i++)\n\t{\n\t\tif (test(data[i], jinzhi))\n\t\t{\n\t\t\tcout << i+1 << \"" \"" <<data[i]<<endl;\n\t\t}\n\t}\n\treturn 0;\n}\n\nbool test(int m, int n)\n{\n\tstring store = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G' };\n\tstring re = \""\"";\n\twhile (m != 0)\n\t{\n\t\tre = store[m % n] + re;\n\t\tm = m / n;\n\t}\n\tint f=1;\n\tfor (int z = 0; z <int(( re.size() / 2) - 1); z++)\n\t{\n\t\tif (re[z] != re[re.size() - 1 - z])\n\t\t{\n\t\t\tf = 0;\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn f;\n}",WRONG_ANSWER,30,428
1278986717858553856,62ab56fba214ade1af428052e84f54b4a39008da8e2a6d888d02d705582fc25a,2020-07-03 17:39:30,Python,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"n = eval(input())\nlistone = [0,1,2,3,4,5,6,7,8,9,'A','B','C','D','E','F','G','H','I']\ndef finda(x,n):\n    i = 0\n    while x >= n**i:\n        i = i + 1\n    return i\ndef changef(x,n,a):\n    strnum = []\n    while a != 0:\n        num1 = x // n**a\n        num2 = x % n**a\n        str1 = listone[num1]\n        strnum.append(str1)\n        x = num2\n        a = a - 1\n    strnum.append(listone[x])\n    return strnum\ndef judgef(x,strnum):\n    str1 = ''\n    for y in strnum:\n        y = str(y)\n        str1 = str1 + y\n    if strnum == strnum[::-1]:\n        print(x,\"" \"",str1)\n    return 0\nfor x in range(1,301):\n    a = finda(x**2,n)\n    strnum = change(x**2,n,a-1)\n    judgef(x**2,strnum)\n    \n\n\n",NON_ZERO_EXIT_CODE,174,3112
1278986913870962688,7fafd57bd73cc9022846ba658cb80e9b39f1427bb4dd39c1cdbf698ee8c53097,2020-07-03 17:40:17,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <stdio.h>\n#include <algorithm>\n\nusing namespace std;\nchar bit[12]= {'0','1','2','3','4','5','6','7','8','9'};\nbool judge(int num);\n\n\nint main()\n{\n    int count,n,i=0;\n    cin>>count>>n;\n    while(i<count)\n    {\n        n++;\n        if(judge(n)==true)\n        {\n            cout<<n<<endl ;\n            i++;\n        }\n    }\n    return 0;\n}\n\nbool judge(int num)\n{\n    int count=0;\n    for(int j=2;j<=10;j++)\n    {\n        int a=num;\n        char s[20];\n        int i=0;\n        while(0!=a)\n        {\n            s[i]=bit[a%j];\n            a/=j;\n            i++;\n        }\n        for(int k=0; k<i; k++)\n        {\n            if(s[k]!=s[i-k-1])\n                break;\n            if(k==i-1)\n                count++;\n        }\n    }\n    if(2<=count)\n        return true;\n    else\n        return false;\n}",ACCEPTED,38,388
1278987054837325824,62ab56fba214ade1af428052e84f54b4a39008da8e2a6d888d02d705582fc25a,2020-07-03 17:40:50,Python,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"n = eval(input())\nlistone = [0,1,2,3,4,5,6,7,8,9,'A','B','C','D','E','F','G','H','I']\ndef finda(x,n):\n    i = 0\n    while x >= n**i:\n        i = i + 1\n    return i\ndef changef(x,n,a):\n    strnum = []\n    while a != 0:\n        num1 = x // n**a\n        num2 = x % n**a\n        str1 = listone[num1]\n        strnum.append(str1)\n        x = num2\n        a = a - 1\n    strnum.append(listone[x])\n    return strnum\ndef judgef(x,strnum):\n    str1 = ''\n    for y in strnum:\n        y = str(y)\n        str1 = str1 + y\n    if strnum == strnum[::-1]:\n        print(x,\"" \"",str1)\n    else:\n        0\n    return \nfor x in range(1,301):\n    a = finda(x**2,n)\n    strnum = change(x**2,n,a-1)\n    judgef(x**2,strnum)\n    \n\n\n",NON_ZERO_EXIT_CODE,173,3072
1278987216821354496,00f4fee551df8c2a2d26b8f89acb2489dbd60fc1c678c81d2c25c5f1b599b2a6,2020-07-03 17:41:29,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<math.h>\n#include <iostream>\n#include<string>\nusing namespace std;\nint func(int n)\n{\n\tint k,m=0;\n\tk=n;\n\twhile (k)\n\t{\n\t\tm=m*10+k%10;\n\t\tk=k/10;\n\t}\n\treturn (m==n);\n}\nint main()\n{\n\tint B;\n\tcin>>B;\n\tint x=0;\n\tint n[300]={0};\n\tint p[300]={0};\n\tint nB[300]={0};\n\tlong pB[300]={0};\n\tlong s[300]={0};\n\tint m=0,num=0;\n\tint array[300];\n\tfor (int b = 1; b < 301; b++)\n\t{\n\t\tn[b-1]=b;\n\t\tp[b-1]=b*b;\n\t}\n\tfor (int a = 0; a < 300; a++)\n\t{\n\t\twhile (n[a]!=0)\n\t\t{\n\t\t\tx=n[a]%B;\n\t\t\tn[a]=n[a]/B;\n\t\t\ts[m]=x;\n\t\t\tm++;\n\t\t}\n\t\tfor (int i = m-1; i >=0; i--)\n\t\t{\n\t\t\tif (s[i]<10)\n\t\t\t{\n\t\t\t\tnum=num+s[i]*pow(10,i);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tnum=num+s[i]*pow(10,2*i);\n\t\t\t}\n\t\t}\n\t\tm=0;\n\t\tnB[a]=num;\n\t\tnum=0;\n\t\twhile (p[a]!=0)\n\t\t{\n\t\t\tx=p[a]%B;\n\t\t\tp[a]=p[a]/B;\n\t\t\ts[m]=x;\n\t\t\tm++;\n\t\t}\n\t\tfor (int i = m-1; i >=0; i--)\n\t\t{\n\t\t\tif (s[i]<10)\n\t\t\t{\n\t\t\t\tnum=num+s[i]*pow(10,i);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tnum=num+s[i]*pow(10,2*i);\n\t\t\t}\n\t\t}\n\t\tm=0;\n\t\tpB[a]=num;\n\t\tnum=0;\n\t}\n\tfor (int i = 0; i <300 ; i++)\n\t{\n\t\tif (func(pB[i]))\n\t\t{\n\t\t\tcout<<nB[i]<<\"" \""<<pB[i]<<endl;\n\t\t}\n\t\t\n\t}\n\t\n}",COMPILE_ERROR,0,0
1278987240431091712,00f4fee551df8c2a2d26b8f89acb2489dbd60fc1c678c81d2c25c5f1b599b2a6,2020-07-03 17:41:35,C++,30.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<math.h>\n#include <iostream>\n#include<string>\nusing namespace std;\nint func(int n)\n{\n\tint k,m=0;\n\tk=n;\n\twhile (k)\n\t{\n\t\tm=m*10+k%10;\n\t\tk=k/10;\n\t}\n\treturn (m==n);\n}\nint main()\n{\n\tint B;\n\tcin>>B;\n\tint x=0;\n\tint n[300]={0};\n\tint p[300]={0};\n\tint nB[300]={0};\n\tlong pB[300]={0};\n\tlong s[300]={0};\n\tint m=0,num=0;\n\tint array[300];\n\tfor (int b = 1; b < 301; b++)\n\t{\n\t\tn[b-1]=b;\n\t\tp[b-1]=b*b;\n\t}\n\tfor (int a = 0; a < 300; a++)\n\t{\n\t\twhile (n[a]!=0)\n\t\t{\n\t\t\tx=n[a]%B;\n\t\t\tn[a]=n[a]/B;\n\t\t\ts[m]=x;\n\t\t\tm++;\n\t\t}\n\t\tfor (int i = m-1; i >=0; i--)\n\t\t{\n\t\t\tif (s[i]<10)\n\t\t\t{\n\t\t\t\tnum=num+s[i]*pow(10,i);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tnum=num+s[i]*pow(10,2*i);\n\t\t\t}\n\t\t}\n\t\tm=0;\n\t\tnB[a]=num;\n\t\tnum=0;\n\t\twhile (p[a]!=0)\n\t\t{\n\t\t\tx=p[a]%B;\n\t\t\tp[a]=p[a]/B;\n\t\t\ts[m]=x;\n\t\t\tm++;\n\t\t}\n\t\tfor (int i = m-1; i >=0; i--)\n\t\t{\n\t\t\tif (s[i]<10)\n\t\t\t{\n\t\t\t\tnum=num+s[i]*pow(10,i);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tnum=num+s[i]*pow(10,2*i);\n\t\t\t}\n\t\t}\n\t\tm=0;\n\t\tpB[a]=num;\n\t\tnum=0;\n\t}\n\tfor (int i = 0; i <300 ; i++)\n\t{\n\t\tif (func(pB[i]))\n\t\t{\n\t\t\tcout<<nB[i]<<\"" \""<<pB[i]<<endl;\n\t\t}\n\t\t\n\t}\n\t\n}",PARTIAL_ACCEPTED,42,512
1278987347754942464,5a10bccaf5a9647c28ad97355d00f2a39ab3ba64f7b21f70896bc5427491236c,2020-07-03 17:42:00,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,#include<iostream>\n#include<string>\nusing namespace std;\n\nstring system_2(int n) {\n\t\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 2;\n\t\tn /= 2;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_3(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 3;\n\t\tn /= 3;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_4(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 4;\n\t\tn /= 4;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_5(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 5;\n\t\tn /= 5;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_6(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 6;\n\t\tn /= 6;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_7(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 7;\n\t\tn /= 7;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_8(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 8;\n\t\tn /= 8;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_9(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 9;\n\t\tn /= 9;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_10(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 10;\n\t\tn /= 10;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\n\nbool determin_hw(string after_num) {\n\tint after_len = after_num.size();\n\tint count = 0;\n\tif (after_len == 1) {\n\t\treturn true;\n\t}\n\n\tfor (int i = 0; i < after_len; i++) {\n\t\t\tif (after_num[i] == after_num[after_len - i - 1]) {\n\t\t\t\tcount++;\n\t\t\t}\n\t}\n\tif (count == after_len) {\n\t\t\treturn true;\n\t}\n\telse {\n\t\t\treturn false;\n\t}\n\n\n}\nint main() {\n\tint N = 0;\n\tint S = 0;\n\tcin >> N >> S;\n\tint count = 0;\n\tint i = S + 1;\n\twhile (count < N)\n\t{\n\t\tbool d2 = determin_hw(system_2(i));\n\t\tbool d3 = determin_hw(system_3(i));\n\t\tbool d4 = determin_hw(system_4(i));\n\t\tbool d5 = determin_hw(system_5(i));\n\t\tbool d6 = determin_hw(system_6(i));\n\t\tbool d7 = determin_hw(system_7(i));\n\t\tbool d8 = determin_hw(system_8(i));\n\t\tbool d9 = determin_hw(system_9(i));\n\t\tbool d10 = determin_hw(system_10(i));\n\t\tif (d2&&d3) {\n\t\t\tif ( d4 || d5 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d2&&d4) {\n\t\t\tif (d3 || d5 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d2 && d5) {\n\t\t\tif (d3 || d4 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\n\t\t}\n\t\telse if (d2 && d6) {\n\t\t\tif (d3 || d5 || d4 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d2 && d7) {\n\t\t\tif (d3 || d5 || d6 || d4 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d2 && d8) {\n\t\t\tif (d3 || d5 || d6 || d7 || d4 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d2 && d9) {\n\t\t\tif (d3 || d5 || d6 || d7 || d8 || d4 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d2 && d10) {\n\t\t\tif (d3 || d5 || d6 || d7 || d8 || d9 || d4) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\t//////////////////////////////////////////////////////////\n\n\t\telse if (d3 && d4) {\n\t\t\tif (d2 || d5 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d3 && d5) {\n\t\t\tif (d2 || d4 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\n\t\t}\n\t\telse if (d3 && d6) {\n\t\t\tif (d2 || d5 || d4 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d3 && d7) {\n\t\t\tif (d2 || d5 || d6 || d4 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d3 && d8) {\n\t\t\tif (d3 || d5 || d6 || d7 || d4 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d3 && d9) {\n\t\t\tif (d2 || d5 || d6 || d7 || d8 || d4 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d3 && d10) {\n\t\t\tif (d2 || d5 || d6 || d7 || d8 || d9 || d4) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\n\t\t///////////////////////////////////////////////////////////\n\t\telse if (d4 && d5) {\n\t\t\tif (d2 || d3 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\n\t\t}\n\t\telse if (d4 && d6) {\n\t\t\tif (d2 || d5 || d3 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d4 && d7) {\n\t\t\tif (d2 || d5 || d6 || d3 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d4 && d8) {\n\t\t\tif (d3 || d5 || d6 || d7 || d3 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d4 && d9) {\n\t\t\tif (d2 || d5 || d6 || d7 || d8 || d3 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d4 && d10) {\n\t\t\tif (d2 || d5 || d6 || d7 || d8 || d9 || d3) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\n\t\t///////////////////////////////////////////////////////////\n\t\telse if (d5 && d6) {\n\t\tif (d2 || d4 || d3 || d7 || d8 || d9 || d10) {\n\t\t\tcout << i << endl;\n\t\t\tcount++;\n\t\t}\n\t\t}\n\t\telse if (d5 && d7) {\n\t\tif (d2 || d4 || d6 || d3 || d8 || d9 || d10) {\n\t\t\tcout << i << endl;\n\t\t\tcount++;\n\t\t}\n\t\t}\n\t\telse if (d5 && d8) {\n\t\tif (d2 || d4 || d6 || d7 || d3 || d9 || d10) {\n\t\t\tcout << i << endl;\n\t\t\tcount++;\n\t\t}\n\t\t}\n\t\telse if (d5 && d9) {\n\t\tif (d2 || d4 || d6 || d7 || d8 || d3 || d10) {\n\t\t\tcout << i << endl;\n\t\t\tcount++;\n\t\t}\n\t\t}\n\t\telse if (d5 && d10) {\n\t\tif (d2 || d4 || d6 || d7 || d8 || d9 || d3) {\n\t\t\tcout << i << endl;\n\t\t\tcount++;\n\t\t}\n\t\t\n\t\t//////////////////////////////////////////////////////\n\t\telse if (d6 && d7) {\n\t\t\tif (d2 || d4 || d5 || d3 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d6 && d8) {\n\t\t\tif (d2 || d4 || d5 || d7 || d3 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d6 && d9) {\n\t\t\tif (d2 || d4 || d5 || d7 || d8 || d3 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d6 && d10) {\n\t\t\tif (d2 || d4 || d5 || d7 || d8 || d9 || d3) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\n\t\t/////////////////////////////////////////////////////////\n\t\telse if (d7 && d8) {\n\t\t\tif (d2 || d4 || d5 || d6 || d3 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d7 && d9) {\n\t\t\tif (d2 || d4 || d5 || d6 || d8 || d3 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d7 && d10) {\n\t\t\tif (d2 || d4 || d5 || d6 || d8 || d9 || d3) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\n\t\t////////////////////////////////////////////////////////\n\t\telse if (d8 && d9) {\n\t\t\tif (d2 || d4 || d5 || d6 || d7 || d3 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d8 && d10) {\n\t\t\tif (d2 || d4 || d5 || d6 || d7 || d9 || d3) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d9 && d10) {\n\t\t\tif (d2 || d4 || d5 || d6 || d7 || d8 || d3) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\n\n\n\t\ti++;\n\t}\n\t\t\n\t\n},COMPILE_ERROR,0,0
1278987781584379904,385c51ba419bb3bbda0722f13d7c530ece9890939a2049f53484294a268f8f07,2020-07-03 17:43:44,Python,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"import math\nn=int(input())\ndef decimalToAny(num,n):\n    baseStr={0:\""0\"",1:\""1\"",2:\""2\"",3:\""3\"",4:\""4\"",5:\""5\"",6:\""6\"",7:\""7\"",8:\""8\"",9:\""9\"",10:\""a\"",11:\""b\"",12:\""c\"",13:\""d\"",14:\""e\"",15:\""f\"",16:\""g\"",17:\""h\"",18:\""i\"",19:\""j\""}\n    new_num_str=\""\""\n    while num!=0:\n        remainder=num%n\n        remainder_string=baseStr[remainder]\n        new_num_str=remainder_string+new_num_str\n        num=(num-remainder)/n\n    return new_num_str\nfor i in range(1,300):\n    j=i**2\n    k=decimalToAny(j,n)\n    a=list(k)\n    b=a.copy()\n    a.reverse()\n    if a==b:\n        print(decimalToAny(i,n),\"" \"",k)\n",MULTIPLE_ERROR,193,3072
1278987812504797184,a763dd36063572769ba5036db9769bf11eba30d56bc77c9b5c6ed5cf82d08e48,2020-07-03 17:43:51,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <string>\n\nusing namespace std;\nstring out1(int,int);\nbool test(int,int);         //  -'0'   6='6'-'0'\n\nint main()\n{\n\tvector<int> data;\n\tfor (int number = 1; number < 301; number++)\n\t{\n\t\tint square;\n\t\tsquare = number*number;\n\t\tdata.push_back(square);\n\t}//已经将1-300的全部平方，共300个数存进了data(vector)中\n\tint jinzhi;\n\tcin >> jinzhi;\n\tfor (int i = 0; i < 301; i++)\n\t{\n\t\tif (test(data[i], jinzhi))\n\t\t{\n\t\t\tcout << out1(i+1,jinzhi) << \"" \"" <<out1(data[i],jinzhi)<<endl;\n\t\t}\n\t}\n\treturn 0;\n}\nstring out1(int x,int y)\n{\n\tstring store = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G' };\n\tstring re = \""\"";\n\twhile (x != 0)\n\t{\n\t\tre = store[x % y] + re;\n\t\tx = x / y;\n\t}\n\treturn re;\n}\n\nbool test(int m, int n)\n{\n\tstring store = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G' };\n\tstring re = \""\"";\n\twhile (m != 0)\n\t{\n\t\tre = store[m % n] + re;\n\t\tm = m / n;\n\t}\n\tint f=1;\n\tfor (int z = 0; z <int(( re.size() / 2) - 1); z++)\n\t{\n\t\tif (re[z] != re[re.size() - 1 - z])\n\t\t{\n\t\t\tf = 0;\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn f;\n}",WRONG_ANSWER,38,544
1278987858818293760,385c51ba419bb3bbda0722f13d7c530ece9890939a2049f53484294a268f8f07,2020-07-03 17:44:02,Python,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"import math\nn=int(input())\ndef decimalToAny(num,n):\n    baseStr={0:\""0\"",1:\""1\"",2:\""2\"",3:\""3\"",4:\""4\"",5:\""5\"",6:\""6\"",7:\""7\"",8:\""8\"",9:\""9\"",10:\""a\"",11:\""b\"",12:\""c\"",13:\""d\"",14:\""e\"",15:\""f\"",16:\""g\"",17:\""h\"",18:\""i\"",19:\""j\""}\n    new_num_str=\""\""\n    while num!=0:\n        remainder=num%n\n        remainder_string=baseStr[remainder]\n        new_num_str=remainder_string+new_num_str\n        num=(num-remainder)/n\n    return new_num_str\nfor i in range(1,300):\n    j=i**2\n    k=decimalToAny(j,n)\n    a=list(k)\n    b=a.copy()\n    a.reverse()\n    if a==b:\n        print(decimalToAny(i,n),\"" \"",k)\n",MULTIPLE_ERROR,190,3044
1278987968251879424,62ab56fba214ade1af428052e84f54b4a39008da8e2a6d888d02d705582fc25a,2020-07-03 17:44:28,Python,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"n = eval(input())\nlistone = [0,1,2,3,4,5,6,7,8,9,'A','B','C','D','E','F','G','H','I']\ndef finda(x,n):\n    i = 0\n    while x >= n**i:\n        i = i + 1\n    return i\ndef changef(x,n,a,strnum):\n    while a != 0:\n        num1 = x // n**a\n        num2 = x % n**a\n        str1 = listone[num1]\n        strnum.append(str1)\n        x = num2\n        a = a - 1\n    strnum.append(listone[x])\n    return strnum\ndef judgef(x,strnum):\n    str1 = ''\n    for y in strnum:\n        y = str(y)\n        str1 = str1 + y\n    if strnum == strnum[::-1]:\n        print(x,\"" \"",str1)\n    else:\n        0\n    return \nfor x in range(1,301):\n    strnum = []\n    a = finda(x**2,n)\n    strnum = change(x**2,n,a-1,strnum)\n    judgef(x**2,strnum)\n    \n\n\n",NON_ZERO_EXIT_CODE,185,3280
1278988257214259200,5a10bccaf5a9647c28ad97355d00f2a39ab3ba64f7b21f70896bc5427491236c,2020-07-03 17:45:37,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,#include<iostream>\n#include<string>\nusing namespace std;\n\nstring system_2(int n) {\n\t\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 2;\n\t\tn /= 2;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_3(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 3;\n\t\tn /= 3;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_4(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 4;\n\t\tn /= 4;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_5(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 5;\n\t\tn /= 5;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_6(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 6;\n\t\tn /= 6;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_7(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 7;\n\t\tn /= 7;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_8(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 8;\n\t\tn /= 8;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_9(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 9;\n\t\tn /= 9;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_10(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 10;\n\t\tn /= 10;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\n\nbool determin_hw(string after_num) {\n\tint after_len = after_num.size();\n\tint count = 0;\n\tif (after_len == 1) {\n\t\treturn true;\n\t}\n\n\tfor (int i = 0; i < after_len; i++) {\n\t\t\tif (after_num[i] == after_num[after_len - i - 1]) {\n\t\t\t\tcount++;\n\t\t\t}\n\t}\n\tif (count == after_len) {\n\t\t\treturn true;\n\t}\n\telse {\n\t\t\treturn false;\n\t}\n\n\n}\nint main() {\n\tint N = 0;\n\tint S = 0;\n\tcin >> N >> S;\n\tint count = 0;\n\tint i = S + 1;\n\twhile (count < N)\n\t{\n\t\tbool d2 = determin_hw(system_2(i));\n\t\tbool d3 = determin_hw(system_3(i));\n\t\tbool d4 = determin_hw(system_4(i));\n\t\tbool d5 = determin_hw(system_5(i));\n\t\tbool d6 = determin_hw(system_6(i));\n\t\tbool d7 = determin_hw(system_7(i));\n\t\tbool d8 = determin_hw(system_8(i));\n\t\tbool d9 = determin_hw(system_9(i));\n\t\tbool d10 = determin_hw(system_10(i));\n\t\tif (d2 && d3) {\n\t\t\tif (d4 || d5 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d2 && d4) {\n\t\t\tif (d3 || d5 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d2 && d5) {\n\t\t\tif (d3 || d4 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\n\t\t}\n\t\telse if (d2 && d6) {\n\t\t\tif (d3 || d5 || d4 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d2 && d7) {\n\t\t\tif (d3 || d5 || d6 || d4 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d2 && d8) {\n\t\t\tif (d3 || d5 || d6 || d7 || d4 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d2 && d9) {\n\t\t\tif (d3 || d5 || d6 || d7 || d8 || d4 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d2 && d10) {\n\t\t\tif (d3 || d5 || d6 || d7 || d8 || d9 || d4) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\t//////////////////////////////////////////////////////////\n\n\t\telse if (d3 && d4) {\n\t\t\tif (d2 || d5 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d3 && d5) {\n\t\t\tif (d2 || d4 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\n\t\t}\n\t\telse if (d3 && d6) {\n\t\t\tif (d2 || d5 || d4 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d3 && d7) {\n\t\t\tif (d2 || d5 || d6 || d4 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d3 && d8) {\n\t\t\tif (d3 || d5 || d6 || d7 || d4 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d3 && d9) {\n\t\t\tif (d2 || d5 || d6 || d7 || d8 || d4 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d3 && d10) {\n\t\t\tif (d2 || d5 || d6 || d7 || d8 || d9 || d4) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\n\t\t///////////////////////////////////////////////////////////\n\t\telse if (d4 && d5) {\n\t\t\tif (d2 || d3 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\n\t\t}\n\t\telse if (d4 && d6) {\n\t\t\tif (d2 || d5 || d3 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d4 && d7) {\n\t\t\tif (d2 || d5 || d6 || d3 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d4 && d8) {\n\t\t\tif (d3 || d5 || d6 || d7 || d3 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d4 && d9) {\n\t\t\tif (d2 || d5 || d6 || d7 || d8 || d3 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d4 && d10) {\n\t\t\tif (d2 || d5 || d6 || d7 || d8 || d9 || d3) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\n\t\t///////////////////////////////////////////////////////////\n\t\telse if (d5 && d6) {\n\t\t\tif (d2 || d4 || d3 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d5 && d7) {\n\t\t\tif (d2 || d4 || d6 || d3 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d5 && d8) {\n\t\t\tif (d2 || d4 || d6 || d7 || d3 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d5 && d9) {\n\t\t\tif (d2 || d4 || d6 || d7 || d8 || d3 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d5 && d10) {\n\t\t\tif (d2 || d4 || d6 || d7 || d8 || d9 || d3) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\n\t\t\t//////////////////////////////////////////////////////\n\t\t\telse if (d6 && d7) {\n\t\t\t\tif (d2 || d4 || d5 || d3 || d8 || d9 || d10) {\n\t\t\t\t\tcout << i << endl;\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (d6 && d8) {\n\t\t\t\tif (d2 || d4 || d5 || d7 || d3 || d9 || d10) {\n\t\t\t\t\tcout << i << endl;\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (d6 && d9) {\n\t\t\t\tif (d2 || d4 || d5 || d7 || d8 || d3 || d10) {\n\t\t\t\t\tcout << i << endl;\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (d6 && d10) {\n\t\t\t\tif (d2 || d4 || d5 || d7 || d8 || d9 || d3) {\n\t\t\t\t\tcout << i << endl;\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t/////////////////////////////////////////////////////////\n\t\t\telse if (d7 && d8) {\n\t\t\t\tif (d2 || d4 || d5 || d6 || d3 || d9 || d10) {\n\t\t\t\t\tcout << i << endl;\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (d7 && d9) {\n\t\t\t\tif (d2 || d4 || d5 || d6 || d8 || d3 || d10) {\n\t\t\t\t\tcout << i << endl;\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (d7 && d10) {\n\t\t\t\tif (d2 || d4 || d5 || d6 || d8 || d9 || d3) {\n\t\t\t\t\tcout << i << endl;\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t////////////////////////////////////////////////////////\n\t\t\telse if (d8 && d9) {\n\t\t\t\tif (d2 || d4 || d5 || d6 || d7 || d3 || d10) {\n\t\t\t\t\tcout << i << endl;\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (d8 && d10) {\n\t\t\t\tif (d2 || d4 || d5 || d6 || d7 || d9 || d3) {\n\t\t\t\t\tcout << i << endl;\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (d9 && d10) {\n\t\t\t\tif (d2 || d4 || d5 || d6 || d7 || d8 || d3) {\n\t\t\t\t\tcout << i << endl;\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\n\n\n\t\t\ti++;\n\t\t}\n\n\n\t}\n},WRONG_ANSWER,35,512
1278989027649191936,a763dd36063572769ba5036db9769bf11eba30d56bc77c9b5c6ed5cf82d08e48,2020-07-03 17:48:41,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <string>\n\nusing namespace std;\nstring out1(int,int);\nbool test(int,int);         //  -'0'   6='6'-'0'\n\nint main()\n{\n\tvector<int> data;\n\tfor (int number = 1; number < 301; number++)\n\t{\n\t\tint square;\n\t\tsquare = number*number;\n\t\tdata.push_back(square);\n\t}//已经将1-300的全部平方，共300个数存进了data(vector)中\n\tint jinzhi;\n\tcin >> jinzhi;\n\tfor (int i = 0; i < 300; i++)\n\t{\n\t\tif (test(data[i], jinzhi))\n\t\t{\n\t\t\tcout << out1(i+1,jinzhi) << \"" \"" <<out1(data[i],jinzhi)<<endl;\n\t\t}\n\t}\n\t\n\n\treturn 0;\n}\n\n\n\nstring out1(int x,int y)\n{\n\tstring store = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G' };\n\tstring re = \""\"";\n\twhile (x != 0)\n\t{\n\t\tre = store[x % y] + re;\n\t\tx = x / y;\n\t}\n\treturn re;\n}\n\nbool test(int m, int n)\n{\n\tstring store = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G' };\n\tstring re = \""\"";\n\twhile (m != 0)\n\t{\n\t\tre = store[m % n] + re;\n\t\tm = m / n;\n\t}\n\tint f=1;\n\tfor (int z = 0; z <int(( re.size() / 2) - 1); z++)\n\t{\n\t\tif (re[z] != re[re.size() - 1 - z])\n\t\t{\n\t\t\tf = 0;\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn f;\n}",WRONG_ANSWER,24,512
1278989136277463040,438eaf099d969f42500339cca22c8f7b70bc0a0cf86c4eb63b1ab7c47cbf9ddc,2020-07-03 17:49:07,C++,60.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main(){\n\tint change(int x[100],int a,int b);\n\tint B,squ,sq,a[100],b[100],m,n;\n\tcin>>B;\n\tfor(int i=1;i<=300;i++){\n\t\tsqu=i;sq=i*i;\n\t\tm=change(a,squ,B);\n\t\tn=change(b,sq,B);\n\t\tint s=1;\n\t\tfor(int k=0;k<n;k++)\n\t\t\tif(b[k]!=b[n-k-1])s=0;\n\t\tif(s==1){\n\t\t\tfor(int j=0;j<m;j++)\n\t\t\t\tswitch(a[j]){\n\t\t\t\tcase 10:cout<<'A';break;\n\t\t\t\tcase 11:cout<<'B';break;\n\t\t\t\tcase 12:cout<<'C';break;\n\t\t\t\tcase 13:cout<<'D';break;\n\t\t\t\tcase 14:cout<<'E';break;\n\t\t\t\tcase 15:cout<<'F';break;\n\t\t\t\tcase 16:cout<<'G';break;\n\t\t\t\tcase 17:cout<<'H';break;\n\t\t\t\tcase 18:cout<<'I';break;\n\t\t\t\tcase 19:cout<<'J';break;\n\t\t\t\tdefault:cout<<a[j];\n\t\t\t}\n\t\t\tcout<<\"" \"";\n\t\t\tfor(int j=0;j<n;j++)\n\t\t\t\tswitch(b[j]){\n\t\t\t\tcase 10:cout<<'A';break;\n\t\t\t\tcase 11:cout<<'B';break;\n\t\t\t\tcase 12:cout<<'C';break;\n\t\t\t\tcase 13:cout<<'D';break;\n\t\t\t\tcase 14:cout<<'E';break;\n\t\t\t\tcase 15:cout<<'F';break;\n\t\t\t\tcase 16:cout<<'G';break;\n\t\t\t\tcase 17:cout<<'H';break;\n\t\t\t\tcase 18:cout<<'I';break;\n\t\t\t\tcase 19:cout<<'J';break;\n\t\t\t\tdefault:cout<<b[j];\n\t\t\t}\n\t\t\tcout<<endl;\n\t\t}\n\t}\n\treturn 0;\n}\nint change(int x[100],int a,int b){\n\tint i,y[100];\n\tfor(i=0;a>0;i++){\n\t\tif(a%b!=0){y[i]=a%b;a=a-y[i];}\n\t\telse {a=a/b;y[i]=a%b;a=a-y[i];}\n\t}\n\tfor(int j=0;j<i;j++){\n\t\tx[j]=y[i-j-1];\n\t}\n\treturn i;\n}",PARTIAL_ACCEPTED,28,512
1278989350228918272,62ab56fba214ade1af428052e84f54b4a39008da8e2a6d888d02d705582fc25a,2020-07-03 17:49:58,Python,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"n = eval(input())\nlistone = [0,1,2,3,4,5,6,7,8,9,'A','B','C','D','E','F','G','H','I']\ndef finda(x,n):\n    i = 0\n    while x >= n**i:\n        i = i + 1\n    return i\ndef changef(x,n,a):\n    global strnum\n    while a != 0:\n        num1 = x // n**a\n        num2 = x % n**a\n        str1 = listone[num1]\n        strnum.append(str1)\n        x = num2\n        a = a - 1\n    strnum.append(listone[x])\n    return strnum\ndef judgef(x):\n    global strnum\n    str1 = ''\n    for y in strnum:\n        y = str(y)\n        str1 = str1 + y\n    if strnum == strnum[::-1]:\n        print(x,\"" \"",str1)\n    else:\n        0\n    return \nfor x in range(1,301):\n    strnum = []\n    a = finda(x**2,n)\n    strnum = change(x**2,n,a-1)\n    judgef(x**2)\n    \n\n\n",NON_ZERO_EXIT_CODE,182,3104
1278989493091098624,385c51ba419bb3bbda0722f13d7c530ece9890939a2049f53484294a268f8f07,2020-07-03 17:50:32,Python,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"import math\nn=int(input())\ndef decimalToAny(num,n):\n    baseStr={0:\""0\"",1:\""1\"",2:\""2\"",3:\""3\"",4:\""4\"",5:\""5\"",6:\""6\"",7:\""7\"",8:\""8\"",9:\""9\"",10:\""a\"",11:\""b\"",12:\""c\"",13:\""d\"",14:\""e\"",15:\""f\"",16:\""g\"",17:\""h\"",18:\""i\"",19:\""j\""}\n    new_num_str=\""\""\n    while num!=0:\n        remainder=num%n\n        remainder_string=baseStr[remainder]\n        new_num_str=remainder_string+new_num_str\n        num=(num-remainder)/n\n    return new_num_str\nfor i in range(1,300):\n    j=i**2\n    k=decimalToAny(j,n)\n    a=list(k)\n    b=a.copy()\n    a.reverse()\n    if a==b:\n        print(decimalToAny(i,n),\"" \"",k)",MULTIPLE_ERROR,198,3188
1278989669692276736,62ab56fba214ade1af428052e84f54b4a39008da8e2a6d888d02d705582fc25a,2020-07-03 17:51:14,Python,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"n = eval(input())\nlistone = [0,1,2,3,4,5,6,7,8,9,'A','B','C','D','E','F','G','H','I','J']\ndef finda(x,n):\n    i = 0\n    while x >= n**i:\n        i = i + 1\n    return i\ndef changef(x,n,a):\n    global strnum\n    while a != 0:\n        num1 = x // n**a\n        num2 = x % n**a\n        str1 = listone[num1]\n        strnum.append(str1)\n        x = num2\n        a = a - 1\n    strnum.append(listone[x])\n    return strnum\ndef judgef(x):\n    global strnum\n    str1 = ''\n    for y in strnum:\n        y = str(y)\n        str1 = str1 + y\n    if strnum == strnum[::-1]:\n        print(x,\"" \"",str1)\n    else:\n        0\n    return \nfor x in range(1,301):\n    strnum = []\n    a = finda(x**2,n)\n    strnum = change(x**2,n,a-1)\n    judgef(x**2)\n    \n\n\n",NON_ZERO_EXIT_CODE,183,3296
1278989718643990528,385c51ba419bb3bbda0722f13d7c530ece9890939a2049f53484294a268f8f07,2020-07-03 17:51:26,Python,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"import math\nn=int(input())\ndef decimalToAny(num,n):\n    baseStr={0:\""0\"",1:\""1\"",2:\""2\"",3:\""3\"",4:\""4\"",5:\""5\"",6:\""6\"",7:\""7\"",8:\""8\"",9:\""9\"",10:\""a\"",11:\""b\"",12:\""c\"",13:\""d\"",14:\""e\"",15:\""f\"",16:\""g\"",17:\""h\"",18:\""i\"",19:\""j\""}\n    new_num_str=\""\""\n    while num!=0:\n        remainder=num%n\n        remainder_string=baseStr[remainder]\n        new_num_str=remainder_string+new_num_str\n        num=(num-remainder)/n\n    return new_num_str\nfor i in range(1,301):\n    j=i**2\n    k=decimalToAny(j,n)\n    a=list(k)\n    b=a.copy()\n    a.reverse()\n    if a==b:\n        print(decimalToAny(i,n),\"" \"",k)",MULTIPLE_ERROR,185,3072
1278990092880773120,5a10bccaf5a9647c28ad97355d00f2a39ab3ba64f7b21f70896bc5427491236c,2020-07-03 17:52:55,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,#include<iostream>\n#include<string>\nusing namespace std;\n\nstring system_2(int n) {\n\t\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 2;\n\t\tn /= 2;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_3(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 3;\n\t\tn /= 3;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_4(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 4;\n\t\tn /= 4;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_5(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 5;\n\t\tn /= 5;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_6(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 6;\n\t\tn /= 6;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_7(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 7;\n\t\tn /= 7;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_8(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 8;\n\t\tn /= 8;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_9(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 9;\n\t\tn /= 9;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_10(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 10;\n\t\tn /= 10;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\n\nbool determin_hw(string after_num) {\n\tint after_len = after_num.size();\n\tint count = 0;\n\tif (after_len == 1) {\n\t\treturn true;\n\t}\n\n\tfor (int i = 0; i < after_len; i++) {\n\t\t\tif (after_num[i] == after_num[after_len - i - 1]) {\n\t\t\t\tcount++;\n\t\t\t}\n\t}\n\tif (count == after_len) {\n\t\t\treturn true;\n\t}\n\telse {\n\t\t\treturn false;\n\t}\n\n\n}\nint main() {\n\tint N = 0;\n\tint S = 0;\n\tcin >> N >> S;\n\tint count = 0;\n\tint i = S + 1;\n\twhile (count < N)\n\t{\n\t\tbool d2 = determin_hw(system_2(i));\n\t\tbool d3 = determin_hw(system_3(i));\n\t\tbool d4 = determin_hw(system_4(i));\n\t\tbool d5 = determin_hw(system_5(i));\n\t\tbool d6 = determin_hw(system_6(i));\n\t\tbool d7 = determin_hw(system_7(i));\n\t\tbool d8 = determin_hw(system_8(i));\n\t\tbool d9 = determin_hw(system_9(i));\n\t\tbool d10 = determin_hw(system_10(i));\n\t\tif (d2 && d3) {\n\t\t\tif (d4 || d5 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d2 && d4) {\n\t\t\tif (d3 || d5 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d2 && d5) {\n\t\t\tif (d3 || d4 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\n\t\t}\n\t\telse if (d2 && d6) {\n\t\t\tif (d3 || d5 || d4 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d2 && d7) {\n\t\t\tif (d3 || d5 || d6 || d4 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d2 && d8) {\n\t\t\tif (d3 || d5 || d6 || d7 || d4 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d2 && d9) {\n\t\t\tif (d3 || d5 || d6 || d7 || d8 || d4 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d2 && d10) {\n\t\t\tif (d3 || d5 || d6 || d7 || d8 || d9 || d4) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\t//////////////////////////////////////////////////////////\n\n\t\telse if (d3 && d4) {\n\t\t\tif (d2 || d5 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d3 && d5) {\n\t\t\tif (d2 || d4 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\n\t\t}\n\t\telse if (d3 && d6) {\n\t\t\tif (d2 || d5 || d4 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d3 && d7) {\n\t\t\tif (d2 || d5 || d6 || d4 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d3 && d8) {\n\t\t\tif (d2 || d5 || d6 || d7 || d4 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d3 && d9) {\n\t\t\tif (d2 || d5 || d6 || d7 || d8 || d4 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d3 && d10) {\n\t\t\tif (d2 || d5 || d6 || d7 || d8 || d9 || d4) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\n\t\t///////////////////////////////////////////////////////////\n\t\telse if (d4 && d5) {\n\t\t\tif (d2 || d3 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\n\t\t}\n\t\telse if (d4 && d6) {\n\t\t\tif (d2 || d5 || d3 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d4 && d7) {\n\t\t\tif (d2 || d5 || d6 || d3 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d4 && d8) {\n\t\t\tif (d3 || d5 || d6 || d7 || d2 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d4 && d9) {\n\t\t\tif (d2 || d5 || d6 || d7 || d8 || d3 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d4 && d10) {\n\t\t\tif (d2 || d5 || d6 || d7 || d8 || d9 || d3) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\n\t\t///////////////////////////////////////////////////////////\n\t\telse if (d5 && d6) {\n\t\t\tif (d2 || d4 || d3 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d5 && d7) {\n\t\t\tif (d2 || d4 || d6 || d3 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d5 && d8) {\n\t\t\tif (d2 || d4 || d6 || d7 || d3 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d5 && d9) {\n\t\t\tif (d2 || d4 || d6 || d7 || d8 || d3 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d5 && d10) {\n\t\t\tif (d2 || d4 || d6 || d7 || d8 || d9 || d3) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\n\t\t\t//////////////////////////////////////////////////////\n\t\t\telse if (d6 && d7) {\n\t\t\t\tif (d2 || d4 || d5 || d3 || d8 || d9 || d10) {\n\t\t\t\t\tcout << i << endl;\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (d6 && d8) {\n\t\t\t\tif (d2 || d4 || d5 || d7 || d3 || d9 || d10) {\n\t\t\t\t\tcout << i << endl;\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (d6 && d9) {\n\t\t\t\tif (d2 || d4 || d5 || d7 || d8 || d3 || d10) {\n\t\t\t\t\tcout << i << endl;\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (d6 && d10) {\n\t\t\t\tif (d2 || d4 || d5 || d7 || d8 || d9 || d3) {\n\t\t\t\t\tcout << i << endl;\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t/////////////////////////////////////////////////////////\n\t\t\telse if (d7 && d8) {\n\t\t\t\tif (d2 || d4 || d5 || d6 || d3 || d9 || d10) {\n\t\t\t\t\tcout << i << endl;\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (d7 && d9) {\n\t\t\t\tif (d2 || d4 || d5 || d6 || d8 || d3 || d10) {\n\t\t\t\t\tcout << i << endl;\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (d7 && d10) {\n\t\t\t\tif (d2 || d4 || d5 || d6 || d8 || d9 || d3) {\n\t\t\t\t\tcout << i << endl;\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t////////////////////////////////////////////////////////\n\t\t\telse if (d8 && d9) {\n\t\t\t\tif (d2 || d4 || d5 || d6 || d7 || d3 || d10) {\n\t\t\t\t\tcout << i << endl;\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (d8 && d10) {\n\t\t\t\tif (d2 || d4 || d5 || d6 || d7 || d9 || d3) {\n\t\t\t\t\tcout << i << endl;\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (d9 && d10) {\n\t\t\t\tif (d2 || d4 || d5 || d6 || d7 || d8 || d3) {\n\t\t\t\t\tcout << i << endl;\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\n\n\n\t\t\ti++;\n\t\t}\n\n\n\t}\n},WRONG_ANSWER,32,444
1278990284946341888,385c51ba419bb3bbda0722f13d7c530ece9890939a2049f53484294a268f8f07,2020-07-03 17:53:41,Python,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"n=int(input())\ndef decimalToAny(num,n):\n    baseStr={0:\""0\"",1:\""1\"",2:\""2\"",3:\""3\"",4:\""4\"",5:\""5\"",6:\""6\"",7:\""7\"",8:\""8\"",9:\""9\"",10:\""A\"",11:\""B\"",12:\""C\"",13:\""D\"",14:\""E\"",15:\""F\"",16:\""G\"",17:\""H\"",18:\""I\"",19:\""J\""}\n    new_num_str=\""\""\n    while num!=0:\n        remainder=num%n\n        remainder_string=baseStr[remainder]\n        new_num_str=remainder_string+new_num_str\n        num=(num-remainder)/n\n    return new_num_str\nfor i in range(1,301):\n    j=i**2\n    k=decimalToAny(j,n)\n    a=list(k)\n    b=a.copy()\n    a.reverse()\n    if a==b:\n        print(decimalToAny(i,n),\"" \"",k)",PRESENTATION_ERROR,170,3040
1278990460213714944,385c51ba419bb3bbda0722f13d7c530ece9890939a2049f53484294a268f8f07,2020-07-03 17:54:22,Python,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"n=int(input())\ndef decimalToAny(num,n):\n    baseStr={0:\""0\"",1:\""1\"",2:\""2\"",3:\""3\"",4:\""4\"",5:\""5\"",6:\""6\"",7:\""7\"",8:\""8\"",9:\""9\"",10:\""A\"",11:\""B\"",12:\""C\"",13:\""D\"",14:\""E\"",15:\""F\"",16:\""G\"",17:\""H\"",18:\""I\"",19:\""J\""}\n    new_num_str=\""\""\n    while num!=0:\n        remainder=num%n\n        remainder_string=baseStr[remainder]\n        new_num_str=remainder_string+new_num_str\n        num=(num-remainder)/n\n    return new_num_str\nfor i in range(1,301):\n    j=i**2\n    k=decimalToAny(j,n)\n    a=list(k)\n    b=a.copy()\n    a.reverse()\n    if a==b:\n        print(decimalToAny(i,n),k)",ACCEPTED,213,3060
1278990786228576256,5a10bccaf5a9647c28ad97355d00f2a39ab3ba64f7b21f70896bc5427491236c,2020-07-03 17:55:40,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,#include<iostream>\n#include<string>\nusing namespace std;\n\nstring system_2(int n) {\n\t\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 2;\n\t\tn /= 2;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_3(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 3;\n\t\tn /= 3;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_4(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 4;\n\t\tn /= 4;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_5(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 5;\n\t\tn /= 5;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_6(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 6;\n\t\tn /= 6;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_7(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 7;\n\t\tn /= 7;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_8(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 8;\n\t\tn /= 8;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_9(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 9;\n\t\tn /= 9;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_10(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 10;\n\t\tn /= 10;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\n\nbool determin_hw(string after_num) {\n\tint after_len = after_num.size();\n\tint count = 0;\n\tif (after_len == 1) {\n\t\treturn true;\n\t}\n\n\tfor (int i = 0; i < after_len; i++) {\n\t\t\tif (after_num[i] == after_num[after_len - i - 1]) {\n\t\t\t\tcount++;\n\t\t\t}\n\t}\n\tif (count == after_len) {\n\t\t\treturn true;\n\t}\n\telse {\n\t\t\treturn false;\n\t}\n\n\n}\nint main() {\n\tint N = 0;\n\tint S = 0;\n\tcin >> N >> S;\n\tint count = 0;\n\tint i = S + 1;\n\twhile (count < N)\n\t{\n\t\tbool d2 = determin_hw(system_2(i));\n\t\tbool d3 = determin_hw(system_3(i));\n\t\tbool d4 = determin_hw(system_4(i));\n\t\tbool d5 = determin_hw(system_5(i));\n\t\tbool d6 = determin_hw(system_6(i));\n\t\tbool d7 = determin_hw(system_7(i));\n\t\tbool d8 = determin_hw(system_8(i));\n\t\tbool d9 = determin_hw(system_9(i));\n\t\tbool d10 = determin_hw(system_10(i));\n\t\tif (d2 && d3) {\n\t\t\tif (d4 || d5 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d2 && d4) {\n\t\t\tif (d3 || d5 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d2 && d5) {\n\t\t\tif (d3 || d4 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\n\t\t}\n\t\telse if (d2 && d6) {\n\t\t\tif (d3 || d5 || d4 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d2 && d7) {\n\t\t\tif (d3 || d5 || d6 || d4 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d2 && d8) {\n\t\t\tif (d3 || d5 || d6 || d7 || d4 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d2 && d9) {\n\t\t\tif (d3 || d5 || d6 || d7 || d8 || d4 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d2 && d10) {\n\t\t\tif (d3 || d5 || d6 || d7 || d8 || d9 || d4) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\t//////////////////////////////////////////////////////////\n\n\t\telse if (d3 && d4) {\n\t\t\tif (d2 || d5 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d3 && d5) {\n\t\t\tif (d2 || d4 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\n\t\t}\n\t\telse if (d3 && d6) {\n\t\t\tif (d2 || d5 || d4 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d3 && d7) {\n\t\t\tif (d2 || d5 || d6 || d4 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d3 && d8) {\n\t\t\tif (d2 || d5 || d6 || d7 || d4 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d3 && d9) {\n\t\t\tif (d2 || d5 || d6 || d7 || d8 || d4 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d3 && d10) {\n\t\t\tif (d2 || d5 || d6 || d7 || d8 || d9 || d4) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\n\t\t///////////////////////////////////////////////////////////\n\t\telse if (d4 && d5) {\n\t\t\tif (d2 || d3 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\n\t\t}\n\t\telse if (d4 && d6) {\n\t\t\tif (d2 || d5 || d3 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d4 && d7) {\n\t\t\tif (d2 || d5 || d6 || d3 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d4 && d8) {\n\t\t\tif (d3 || d5 || d6 || d7 || d2 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d4 && d9) {\n\t\t\tif (d2 || d5 || d6 || d7 || d8 || d3 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d4 && d10) {\n\t\t\tif (d2 || d5 || d6 || d7 || d8 || d9 || d3) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\n\t\t///////////////////////////////////////////////////////////\n\t\telse if (d5 && d6) {\n\t\t\tif (d2 || d4 || d3 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d5 && d7) {\n\t\t\tif (d2 || d4 || d6 || d3 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d5 && d8) {\n\t\t\tif (d2 || d4 || d6 || d7 || d3 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d5 && d9) {\n\t\t\tif (d2 || d4 || d6 || d7 || d8 || d3 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d5 && d10) {\n\t\t\tif (d2 || d4 || d6 || d7 || d8 || d9 || d3) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\t\t//////////////////////////////////////////////////////\n\t\t\telse if (d6 && d7) {\n\t\t\t\tif (d2 || d4 || d5 || d3 || d8 || d9 || d10) {\n\t\t\t\t\tcout << i << endl;\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (d6 && d8) {\n\t\t\t\tif (d2 || d4 || d5 || d7 || d3 || d9 || d10) {\n\t\t\t\t\tcout << i << endl;\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (d6 && d9) {\n\t\t\t\tif (d2 || d4 || d5 || d7 || d8 || d3 || d10) {\n\t\t\t\t\tcout << i << endl;\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (d6 && d10) {\n\t\t\t\tif (d2 || d4 || d5 || d7 || d8 || d9 || d3) {\n\t\t\t\t\tcout << i << endl;\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t/////////////////////////////////////////////////////////\n\t\t\telse if (d7 && d8) {\n\t\t\t\tif (d2 || d4 || d5 || d6 || d3 || d9 || d10) {\n\t\t\t\t\tcout << i << endl;\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (d7 && d9) {\n\t\t\t\tif (d2 || d4 || d5 || d6 || d8 || d3 || d10) {\n\t\t\t\t\tcout << i << endl;\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (d7 && d10) {\n\t\t\t\tif (d2 || d4 || d5 || d6 || d8 || d9 || d3) {\n\t\t\t\t\tcout << i << endl;\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t////////////////////////////////////////////////////////\n\t\t\telse if (d8 && d9) {\n\t\t\t\tif (d2 || d4 || d5 || d6 || d7 || d3 || d10) {\n\t\t\t\t\tcout << i << endl;\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (d8 && d10) {\n\t\t\t\tif (d2 || d4 || d5 || d6 || d7 || d9 || d3) {\n\t\t\t\t\tcout << i << endl;\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (d9 && d10) {\n\t\t\t\tif (d2 || d4 || d5 || d6 || d7 || d8 || d3) {\n\t\t\t\t\tcout << i << endl;\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\n\n\n\t\t\ti++;\n\t\t\n\n\n\t}\n},PARTIAL_ACCEPTED,36,588
1278992002304106496,a763dd36063572769ba5036db9769bf11eba30d56bc77c9b5c6ed5cf82d08e48,2020-07-03 18:00:30,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <string>\n\nusing namespace std;\nstring out1(int,int);\nbool test(int,int);         //  -'0'   6='6'-'0'\n\nint main()\n{\n\tvector<int> data;\n\tfor (int number = 1; number < 301; number++)\n\t{\n\t\tint square;\n\t\tsquare = number*number;\n\t\tdata.push_back(square);\n\t}//已经将1-300的全部平方，共300个数存进了data(vector)中\n\tint jinzhi;\n\tcin >> jinzhi;\n\tfor (int i = 0; i < 300; i++)\n\t{\n\t\tif (test(data[i], jinzhi))\n\t\t{\n\t\t\tcout << out1(i+1,jinzhi) << \"" \"" <<out1(data[i],jinzhi)<<endl;\n\t\t}\n\t}\n\treturn 0;\n}\n\n\nstring out1(int x,int y)\n{\n\tstring store = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G' };\n\tstring re = \""\"";\n\twhile (x != 0)\n\t{\n\t\tre = store[x % y] + re;\n\t\tx = x / y;\n\t}\n\treturn re;\n}\n\nbool test(int m, int n)\n{\n\tstring store = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G' };\n\tstring re = \""\"";\n\twhile (m != 0)\n\t{\n\t\tre = store[m % n] + re;\n\t\tm = m / n;\n\t}\n\tint f=1;\n\tfor (int z = 0; z < int((re.size()/2) - 1); z++)\n\t{\n\t\tif (re[z] != re[re.size() - 1 - z])\n\t\t{\n\t\t\tf = 0;\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn f;\n}",WRONG_ANSWER,25,384
1278992094582988800,40e897818d5386ba9e529984326264e964404c624b7eb28f67ebb37eab419911,2020-07-03 18:00:52,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <fstream>\n#include <cstring>\n#include <vector>\n#include <sstream>\n#include<cstdlib>\nusing namespace std;\n\n\nint judgement(int s)\n{\n    int flag = 0;\n    for (int i = 2; i <= 10; i++)\n    {\n        if (flag == 2) break;//当找到两种就停止\n        int j = 0;\n        long long x = 0;//转换成二进制可能很长 \n        while (s)\n        {\n            x += (s % i) * pow(10, j);\n            s /= i;\n            j++;\n        }\n        stringstream t;\n        string str;\n        t << x;\n        t >> str;  //x转成字符串str\n        int len = str.size();\n        int k = 0;\n        int m = str.length() - 1;\n        for (int i = 0; i < (m + 1) / 2; i++)\n        {\n            if (str[i] != str[m - i])\n            {\n                k++;\n            }\n        }\n        if (k == 0)\n        {\n            flag++;\n        }\n\n\n    }\n    return flag;\n}\nint main()\n{\n    int n, s, num = 1;\n    cin >> n >> s;\n    while (num <= n)\n    {\n        s++;\n        if (judgement(s) == 2)\n        {\n            cout << s << endl;\n            num++;\n        }\n    }\n    return 0;\n}\n\n  ",COMPILE_ERROR,0,0
1278992503317913600,40e897818d5386ba9e529984326264e964404c624b7eb28f67ebb37eab419911,2020-07-03 18:02:29,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <fstream>\n#include <cstring>\n#include <vector>\n#include <sstream>\n#include <cstdlib>\n#include <cmath>\nusing namespace std;\n\n\nint judgement(int s)\n{\n    int flag = 0;\n    for (int i = 2; i <= 10; i++)\n    {\n        if (flag == 2) break;//当找到两种就停止\n        int j = 0;\n        long long x = 0;//转换成二进制可能很长 \n        while (s)\n        {\n            x += (s % i) * pow(10, j);\n            s /= i;\n            j++;\n        }\n        stringstream t;\n        string str;\n        t << x;\n        t >> str;  //x转成字符串str\n        int len = str.size();\n        int k = 0;\n        int m = str.length() - 1;\n        for (int i = 0; i < (m + 1) / 2; i++)\n        {\n            if (str[i] != str[m - i])\n            {\n                k++;\n            }\n        }\n        if (k == 0)\n        {\n            flag++;\n        }\n\n\n    }\n    return flag;\n}\n\nint main()\n{\n    int n, s, num = 1;\n    cin >> n >> s;\n    while (num <= n)\n    {\n        s++;\n        if (judgement(s) == 2)\n        {\n            cout << s << endl;\n            num++;\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,37,512
1278993720924372992,40e897818d5386ba9e529984326264e964404c624b7eb28f67ebb37eab419911,2020-07-03 18:07:20,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <fstream>\n#include <cstring>\n#include <vector>\n#include <sstream>\n#include <cstdlib>\n#include <cmath>\nusing namespace std;\n\n\nint judgement(int s)\n{\n    int flag = 0;\n    for (int i = 2; i <= 10; i++)\n    {\n        if (flag == 2) break;//当找到两种就停止\n        int j = 0;\n        int sw = s;\n        long long x = 0;//转换成二进制可能很长 \n        while (sw)\n        {\n            x += (sw % i) * pow(10, j);\n            sw /= i;\n            j++;\n        }\n        stringstream t;\n        string str;\n        t << x;\n        t >> str;  //x转成字符串str\n        int len = str.size();\n        int k = 0;\n        int m = str.length() - 1;\n        for (int i = 0; i < (m + 1) / 2; i++)\n        {\n            if (str[i] != str[m - i])\n            {\n                k++;\n            }\n        }\n        if (k == 0)\n        {\n            flag++;\n        }\n\n\n    }\n    return flag;\n}\n\nint main()\n{\n    int n, s, num = 1;\n    cin >> n >> s;\n    while (num <= n)\n    {\n        s++;\n        if (judgement(s) == 2)\n        {\n            cout << s << endl;\n            num++;\n        }\n    }\n    return 0;\n}",ACCEPTED,76,424
1278994984299069440,40e897818d5386ba9e529984326264e964404c624b7eb28f67ebb37eab419911,2020-07-03 18:12:21,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <fstream>\n#include <cstring>\n#include <vector>\n#include <sstream>\n#include <cstdlib>\n#include <cmath>\nusing namespace std;\n\n\nint judgement(int s)\n{\n    int flag = 0;\n    for (int i = 2; i <= 10; i++)\n    {\n        if (flag == 2) break;//当找到两种就停止\n        int j = 0;\n        int sw = s;\n        long long x = 0;//转换成二进制可能很长 \n        while (sw)\n        {\n            x += (sw % i) * pow(10, j);\n            sw /= i;\n            j++;\n        }\n        stringstream t;\n        string str;\n        t << x;\n        t >> str;  //x转成字符串str\n        int len = str.size();\n        int k = 0;\n        int m = str.length() - 1;\n        for (int i = 0; i < (m + 1) / 2; i++)\n        {\n            if (str[i] != str[m - i])\n            {\n                k++;\n            }\n        }\n        if (k == 0)\n        {\n            flag++;\n        }\n\n\n    }\n    return flag;\n}\n\nint main()\n{\n    int N;\n    int S;\n    int num = 1;\n    cin >> N >> S;\n    for (int i = 0; i < N; i++)\n    {\n        S++;\n        if (judgement(S) == 2)\n        {\n            cout << S << endl;\n        }\n\n    }\n}",PARTIAL_ACCEPTED,38,536
1278995625113223168,c2c290e91f30dc0454f9ef5b9125b06471e7d4b403c388aa8cf0d9b3efc569e9,2020-07-03 18:14:54,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nint a[20]; \nbool judge(int x,int n)\n{\n    int m{ 0 };\n    x = x * x;\n    while (x)\n    {\n        a[++m] = x % n;\n        x /= n;\n    }\n    for (int i = 1, j = m; i < j; i++, j--)\n        if (a[i] != a[j])\n            return false;\n    return true;\n}\nvoid p(int x,int n)\n{\n    int m = 0;\n    while (x)\n    {\n        a[++m] = x % n;\n        x /= n;\n    }\n    for (int i = m; i >= 1; i--)\n    {\n        if (a[i] > 9)\n            cout<<(a[i] - 10 + 'A');\n        else \n            cout<< a[i] ;\n    }\n}\nint main()\n{\n    int B;\n    cin >> B;\n    for (int i = 1; i <= 300; i++)\n    {\n        if (judge(i,B))\n        {\n            p(i,B);\n            cout << \"" \"";\n            p(i * i,B);\n            cout << \""\\n\"";\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,37,484
1278995634034507776,40e897818d5386ba9e529984326264e964404c624b7eb28f67ebb37eab419911,2020-07-03 18:14:56,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <fstream>\n#include <cstring>\n#include <vector>\n#include <sstream>\n#include <cstdlib>\n#include <cmath>\nusing namespace std;\n\n\nint judgement(int s)\n{\n    int flag = 0;\n    for (int i = 2; i <= 10; i++)\n    {\n        if (flag == 2) break;//当找到两种就停止\n        int j = 0;\n        int sw = s;\n        long long x = 0;//转换成二进制可能很长 \n        while (sw)\n        {\n            x += (sw % i) * pow(10, j);\n            sw /= i;\n            j++;\n        }\n        stringstream t;\n        string str;\n        t << x;\n        t >> str;  //x转成字符串str\n        int len = str.size();\n        int k = 0;\n        int m = str.length() - 1;\n        for (int i = 0; i < (m + 1) / 2; i++)\n        {\n            if (str[i] != str[m - i])\n            {\n                k++;\n            }\n        }\n        if (k == 0)\n        {\n            flag++;\n        }\n\n\n    }\n    return flag;\n}\n\nint main()\n{\n    int N;\n    int S;\n    int num = 1;\n    cin >> N >> S;\n    while (num <= N)\n    {\n        S++;\n        if (judgement(S) == 2)\n        {\n            cout << S << endl;\n            num++;\n        }\n    }\n    \n}",ACCEPTED,77,424
1278998424232321024,a763dd36063572769ba5036db9769bf11eba30d56bc77c9b5c6ed5cf82d08e48,2020-07-03 18:26:01,C++,70.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <string>\n\nusing namespace std;\nstring out1(int, int);\nbool test(int, int);         //  -'0'   6='6'-'0'\n\nint main()\n{\n\tvector<int> data;\n\tfor (int number = 1; number < 301; number++)\n\t{\n\t\tint square;\n\t\tsquare = number * number;\n\t\tdata.push_back(square);\n\t}//已经将1-300的全部平方，共300个数存进了data(vector)中\n\tint jinzhi;\n\tcin >> jinzhi;\n\tfor (int i = 0; i < 300; i++)\n\t{\n\t\tif (test(data[i], jinzhi))\n\t\t{\n\t\t\tcout << out1(i + 1, jinzhi) << \"" \"" << out1(data[i], jinzhi) << endl;\n\t\t}\n\t}\n\treturn 0;\n}\n\n\nstring out1(int x, int y)\n{\n\tstring store = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G' };\n\tstring re = \""\"";\n\twhile (x != 0)\n\t{\n\t\tre = store[x % y] + re;\n\t\tx = x / y;\n\t}\n\treturn re;\n}\n\nbool test(int m, int n)\n{\n\tstring store = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G' };\n\tstring re = \""\"";\n\twhile (m != 0)\n\t{\n\t\tre = store[m % n] + re;\n\t\tm = m / n;\n\t}\n\tbool f = 1;\n\tfor (int z = 0; z < re.size() / 2; z++)\n\t{\n\t\tif (re[z] != re[re.size() - 1 - z])\n\t\t{\n\t\t\tf = 0;\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn f;\n}",PARTIAL_ACCEPTED,40,512
1278998652922560512,a763dd36063572769ba5036db9769bf11eba30d56bc77c9b5c6ed5cf82d08e48,2020-07-03 18:26:56,C++,70.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <string>\n\nusing namespace std;\nstring out1(int, int);\nbool test(int, int);         //  -'0'   6='6'-'0'\n\nint main()\n{\n\tvector<int> data;\n\tfor (int number = 1; number < 301; number++)\n\t{\n\t\tint square;\n\t\tsquare = number * number;\n\t\tdata.push_back(square);\n\t}//已经将1-300的全部平方，共300个数存进了data(vector)中\n\tint jinzhi;\n\tcin >> jinzhi;\n\tfor (int i = 0; i < 300; i++)\n\t{\n\t\tif (test(data[i], jinzhi))\n\t\t{\n\t\t\tcout << out1(i + 1, jinzhi) << \"" \"" << out1(data[i], jinzhi) << endl;\n\t\t}\n\t}\n\treturn 0;\n}\n\n\nstring out1(int x, int y)\n{\n\tstring store = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G' };\n\tstring re = \""\"";\n\twhile (x != 0)\n\t{\n\t\tre = store[x % y] + re;\n\t\tx = x / y;\n\t}\n\treturn re;\n}\n\nbool test(int m, int n)\n{\n\tstring store = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G' };\n\tstring re = \""\"";\n\twhile (m != 0)\n\t{\n\t\tre = store[m % n] + re;\n\t\tm = m / n;\n\t}\n\tbool f = 1;\n\tfor (int z = 0; z < re.size() / 2; z++)\n\t{\n\t\tif (re[z] != re[re.size() - 1 - z])\n\t\t{\n\t\t\tf = 0;\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn f;\n}",PARTIAL_ACCEPTED,41,492
1279004503150354432,5a10bccaf5a9647c28ad97355d00f2a39ab3ba64f7b21f70896bc5427491236c,2020-07-03 18:50:10,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\n\nstring transfer_system(int number, int r) {\n\tchar big_than[10]{ 'A','B','C','D','E','F','G','H','I','J' };\n\tstring after_num = \""\"";\n\twhile (number != 0) {\n\t\tint last;\n\t\tlast = number % r;\n\t\tnumber = number / r;\n\t\tif (last >= 10) {\n\t\t\tafter_num += big_than[last % 10];\n\t\t}\n\t\telse {\n\t\t\tafter_num += to_string(last);\n\t\t}\n\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < (num_len / 2); i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\n\t}\n\treturn after_num;\n\n}\n\nbool determin_hw(string num) {\n\tif (num.size() == 1) return true;\n\tint after_len = num.size();\n\tint count = 0;\n\tfor (int i = 0; i < after_len; i++) {\n\t\tif (num[i] == num[after_len - i - 1]) {\n\t\t\tcount++;\n\t\t}\n\t}\n\tif (count == after_len) {\n\t\treturn true;\n\t}\n\telse\n\t{\n\t\treturn false;\n\t}\n\n}\n\nint main() {\n\n\t\n\t\n\t\n\tint N = 0;\n\tint S = 0;\n\tcin >> N >> S;\n\tint m_count = 0;\n\tint i = S + 1;\n\twhile (m_count < N) {\n\t\tint count = 0;\n\t\tfor (int sys = 2; sys <= 10; sys++) {\n\t\t\tbool d = determin_hw(transfer_system(i, sys));\n\t\t\tif (d) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tif (count >= 2) {\n\t\t\tcout << i << endl;\n\t\t\tm_count++;\n\t\t}\n\t\ti++;\n\t}\n\t\n}\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n/*\n\n#include<iostream>\n#include<string>\nusing namespace std;\n\nstring system_2(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 2;\n\t\tn /= 2;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_3(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 3;\n\t\tn /= 3;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_4(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 4;\n\t\tn /= 4;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_5(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 5;\n\t\tn /= 5;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_6(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 6;\n\t\tn /= 6;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_7(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 7;\n\t\tn /= 7;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_8(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 8;\n\t\tn /= 8;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_9(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 9;\n\t\tn /= 9;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\nstring system_10(int n) {\n\n\tstring after_num;\n\twhile (!n) {\n\t\tint last_num = n % 10;\n\t\tn /= 10;\n\t\tafter_num += to_string(last_num);\n\t}\n\tint num_len = after_num.size();\n\tfor (int i = 0; i < num_len / 2; i++) {\n\t\tchar temp = after_num[i];\n\t\tafter_num[i] = after_num[num_len - i - 1];\n\t\tafter_num[num_len - i - 1] = temp;\n\t}\n\treturn after_num;\n}\n\nbool determin_hw(string after_num) {\n\tint after_len = after_num.size();\n\tint count = 0;\n\tif (after_len == 1) {\n\t\treturn true;\n\t}\n\n\tfor (int i = 0; i < after_len; i++) {\n\t\t\tif (after_num[i] == after_num[after_len - i - 1]) {\n\t\t\t\tcount++;\n\t\t\t}\n\t}\n\tif (count == after_len) {\n\t\t\treturn true;\n\t}\n\telse {\n\t\t\treturn false;\n\t}\n\n\n}\nint main() {\n\tint N = 0;\n\tint S = 0;\n\tcin >> N >> S;\n\tint count = 0;\n\tint i = S + 1;\n\twhile (count < N)\n\t{\n\t\tbool d2 = determin_hw(system_2(i));\n\t\tbool d3 = determin_hw(system_3(i));\n\t\tbool d4 = determin_hw(system_4(i));\n\t\tbool d5 = determin_hw(system_5(i));\n\t\tbool d6 = determin_hw(system_6(i));\n\t\tbool d7 = determin_hw(system_7(i));\n\t\tbool d8 = determin_hw(system_8(i));\n\t\tbool d9 = determin_hw(system_9(i));\n\t\tbool d10 = determin_hw(system_10(i));\n\t\tif (d2 && d3) {\n\t\t\tif (d4 || d5 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d2 && d4) {\n\t\t\tif (d3 || d5 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d2 && d5) {\n\t\t\tif (d3 || d4 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\n\t\t}\n\t\telse if (d2 && d6) {\n\t\t\tif (d3 || d5 || d4 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d2 && d7) {\n\t\t\tif (d3 || d5 || d6 || d4 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d2 && d8) {\n\t\t\tif (d3 || d5 || d6 || d7 || d4 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d2 && d9) {\n\t\t\tif (d3 || d5 || d6 || d7 || d8 || d4 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d2 && d10) {\n\t\t\tif (d3 || d5 || d6 || d7 || d8 || d9 || d4) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\t//////////////////////////////////////////////////////////\n\n\t\telse if (d3 && d4) {\n\t\t\tif (d2 || d5 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d3 && d5) {\n\t\t\tif (d2 || d4 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\n\t\t}\n\t\telse if (d3 && d6) {\n\t\t\tif (d2 || d5 || d4 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d3 && d7) {\n\t\t\tif (d2 || d5 || d6 || d4 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d3 && d8) {\n\t\t\tif (d2 || d5 || d6 || d7 || d4 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d3 && d9) {\n\t\t\tif (d2 || d5 || d6 || d7 || d8 || d4 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d3 && d10) {\n\t\t\tif (d2 || d5 || d6 || d7 || d8 || d9 || d4) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\n\t\t///////////////////////////////////////////////////////////\n\t\telse if (d4 && d5) {\n\t\t\tif (d2 || d3 || d6 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\n\t\t}\n\t\telse if (d4 && d6) {\n\t\t\tif (d2 || d5 || d3 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d4 && d7) {\n\t\t\tif (d2 || d5 || d6 || d3 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d4 && d8) {\n\t\t\tif (d3 || d5 || d6 || d7 || d2 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d4 && d9) {\n\t\t\tif (d2 || d5 || d6 || d7 || d8 || d3 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d4 && d10) {\n\t\t\tif (d2 || d5 || d6 || d7 || d8 || d9 || d3) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\n\t\t///////////////////////////////////////////////////////////\n\t\telse if (d5 && d6) {\n\t\t\tif (d2 || d4 || d3 || d7 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d5 && d7) {\n\t\t\tif (d2 || d4 || d6 || d3 || d8 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d5 && d8) {\n\t\t\tif (d2 || d4 || d6 || d7 || d3 || d9 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d5 && d9) {\n\t\t\tif (d2 || d4 || d6 || d7 || d8 || d3 || d10) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\telse if (d5 && d10) {\n\t\t\tif (d2 || d4 || d6 || d7 || d8 || d9 || d3) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\t\t//////////////////////////////////////////////////////\n\t\t\telse if (d6 && d7) {\n\t\t\t\tif (d2 || d4 || d5 || d3 || d8 || d9 || d10) {\n\t\t\t\t\tcout << i << endl;\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (d6 && d8) {\n\t\t\t\tif (d2 || d4 || d5 || d7 || d3 || d9 || d10) {\n\t\t\t\t\tcout << i << endl;\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (d6 && d9) {\n\t\t\t\tif (d2 || d4 || d5 || d7 || d8 || d3 || d10) {\n\t\t\t\t\tcout << i << endl;\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (d6 && d10) {\n\t\t\t\tif (d2 || d4 || d5 || d7 || d8 || d9 || d3) {\n\t\t\t\t\tcout << i << endl;\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t/////////////////////////////////////////////////////////\n\t\t\telse if (d7 && d8) {\n\t\t\t\tif (d2 || d4 || d5 || d6 || d3 || d9 || d10) {\n\t\t\t\t\tcout << i << endl;\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (d7 && d9) {\n\t\t\t\tif (d2 || d4 || d5 || d6 || d8 || d3 || d10) {\n\t\t\t\t\tcout << i << endl;\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (d7 && d10) {\n\t\t\t\tif (d2 || d4 || d5 || d6 || d8 || d9 || d3) {\n\t\t\t\t\tcout << i << endl;\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t////////////////////////////////////////////////////////\n\t\t\telse if (d8 && d9) {\n\t\t\t\tif (d2 || d4 || d5 || d6 || d7 || d3 || d10) {\n\t\t\t\t\tcout << i << endl;\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (d8 && d10) {\n\t\t\t\tif (d2 || d4 || d5 || d6 || d7 || d9 || d3) {\n\t\t\t\t\tcout << i << endl;\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (d9 && d10) {\n\t\t\t\tif (d2 || d4 || d5 || d6 || d7 || d8 || d3) {\n\t\t\t\t\tcout << i << endl;\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\n\n\n\t\t\ti++;\n\n\n\n\t}\n}\n\n*/\n\n\n",ACCEPTED,70,424
1279005845847736320,a763dd36063572769ba5036db9769bf11eba30d56bc77c9b5c6ed5cf82d08e48,2020-07-03 18:55:31,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <string>\n\nusing namespace std;\nstring out1(int, int);\nbool test(int, int);         //  -'0'   6='6'-'0'\n\nint main()\n{\n\tvector<int> data;\n\tfor (int number = 1; number < 301; number++)\n\t{\n\t\tint square;\n\t\tsquare = number * number;\n\t\tdata.push_back(square);\n\t}//已经将1-300的全部平方，共300个数存进了data(vector)中\n\tint jinzhi;\n\tcin >> jinzhi;\n\tfor (int i = 0; i < 300; i++)\n\t{\n\t\tif (test(data[i], jinzhi))\n\t\t{\n\t\t\tcout << out1(i + 1, jinzhi) << \"" \"" << out1(data[i], jinzhi) << endl;\n\t\t}\n\t}\n\treturn 0;\n}\n\n\nstring out1(int x, int y)\n{\n\tstring store = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\n\tstring re = \""\"";\n\twhile (x != 0)\n\t{\n\t\tre = store[x % y] + re;\n\t\tx = x / y;\n\t}\n\treturn re;\n}\n\nbool test(int m, int n)\n{\n\tstring store = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\n\tstring re = \""\"";\n\twhile (m != 0)\n\t{\n\t\tre = store[m % n] + re;\n\t\tm = m / n;\n\t}\n\tbool f = 1;\n\tfor (int z = 0; z < re.size() / 2; z++)\n\t{\n\t\tif (re[z] != re[re.size() - 1 - z])\n\t\t{\n\t\t\tf = 0;\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn f;\n}\n",ACCEPTED,34,512
1279013329492705280,459ce662b14bafd9f391c359c54aa17e63014ceaede44a8bee3262a42b80fe2f,2020-07-03 19:25:15,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nint t1[40];\nchar t2[40];\nint h = 0;\nint trans(int n,int x)\n{\n\tint i;\n\tfor ( i = 0; x; i++)\n\t{\n\t\t\n\t\tt1[i] = x%n;\n\t\tx = x / n;\n\t\th++;\n\t}\n\n}\nvoid tranc()\n{\n\tint i,h2=0;\n\tfor ( i = h-1; i >=0; i--)\n\t{\n\t\t\n\t\tif (t1[i]<10)\n\t\t{\n\t\t\tt2[h2] = char(t1[i]+'0');\n\t\t}\n\t\telse\n\t\t{\n\t\t\tt2[h2] = char(t1[i] + 'A'-10);\n\t\t}\n\t\th2++;\n\t}\n}\nbool r()\n{\n\tint end = h-1;\n\tint i;\n\tfor ( i = 0; i < h; i++)\n\t{\n\t\tif (t2[i]!=t2[h-1])\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\th--;\n\t}\n\treturn true;\n}\nint main()\n{\n\tint n,i;\n\tcin >> n;\n\tfor ( i = 0; i <=300 ; i++)\n\t{\n\t\ttrans(n, i * i);\n\t\ttranc();\n\t\tif (r())\n\t\t{\n\t\t\tcout << i << \"" \"" << i * i;\n\t\t}\n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,40,424
1279013534480916480,459ce662b14bafd9f391c359c54aa17e63014ceaede44a8bee3262a42b80fe2f,2020-07-03 19:26:04,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nint t1[100];\nchar t2[100];\nint h = 0;\nint trans(int n,int x)\n{\n\tint i;\n\tfor ( i = 0; x; i++)\n\t{\n\t\t\n\t\tt1[i] = x%n;\n\t\tx = x / n;\n\t\th++;\n\t}\n\n}\nvoid tranc()\n{\n\tint i,h2=0;\n\tfor ( i = h-1; i >=0; i--)\n\t{\n\t\t\n\t\tif (t1[i]<10)\n\t\t{\n\t\t\tt2[h2] = char(t1[i]+'0');\n\t\t}\n\t\telse\n\t\t{\n\t\t\tt2[h2] = char(t1[i] + 'A'-10);\n\t\t}\n\t\th2++;\n\t}\n}\nbool r()\n{\n\tint end = h-1;\n\tint i;\n\tfor ( i = 0; i < h; i++)\n\t{\n\t\tif (t2[i]!=t2[h-1])\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\th--;\n\t}\n\treturn true;\n}\nint main()\n{\n\tint n,i;\n\tcin >> n;\n\tfor ( i = 0; i <=300 ; i++)\n\t{\n\t\ttrans(n, i * i);\n\t\ttranc();\n\t\tif (r())\n\t\t{\n\t\t\tcout << i << \"" \"" << i * i;\n\t\t}\n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,38,512
1279013899259543552,438eaf099d969f42500339cca22c8f7b70bc0a0cf86c4eb63b1ab7c47cbf9ddc,2020-07-03 19:27:31,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main(){\n\tint change(int x[100],int a,int b);\n\tint B,squ,sq,a[100],b[100],m,n;\n\tcin>>B;\n\tfor(int i=1;i<=300;i++){\n\t\tsqu=i;sq=i*i;\n\t\tm=change(a,squ,B);\n\t\tn=change(b,sq,B);\n\t\tint s=1;\n\t\tfor(int k=0;k<n;k++)\n\t\t\tif(b[k]!=b[n-k-1])s=0;\n\t\tif(s==1){\n\t\t\tfor(int j=0;j<m;j++)\n\t\t\t\tswitch(a[j]){\n\t\t\t\tcase 0:break;\n\t\t\t\tcase 10:cout<<'A';break;\n\t\t\t\tcase 11:cout<<'B';break;\n\t\t\t\tcase 12:cout<<'C';break;\n\t\t\t\tcase 13:cout<<'D';break;\n\t\t\t\tcase 14:cout<<'E';break;\n\t\t\t\tcase 15:cout<<'F';break;\n\t\t\t\tcase 16:cout<<'G';break;\n\t\t\t\tcase 17:cout<<'H';break;\n\t\t\t\tcase 18:cout<<'I';break;\n\t\t\t\tcase 19:cout<<'J';break;\n\t\t\t\tdefault:cout<<a[j];\n\t\t\t}\n\t\t\tcout<<\"" \"";\n\t\t\tfor(int j=0;j<n;j++)\n\t\t\t\tswitch(b[j]){\n\t\t\t\tcase 0:break;\n\t\t\t\tcase 10:cout<<'A';break;\n\t\t\t\tcase 11:cout<<'B';break;\n\t\t\t\tcase 12:cout<<'C';break;\n\t\t\t\tcase 13:cout<<'D';break;\n\t\t\t\tcase 14:cout<<'E';break;\n\t\t\t\tcase 15:cout<<'F';break;\n\t\t\t\tcase 16:cout<<'G';break;\n\t\t\t\tcase 17:cout<<'H';break;\n\t\t\t\tcase 18:cout<<'I';break;\n\t\t\t\tcase 19:cout<<'J';break;\n\t\t\t\tdefault:cout<<b[j];\n\t\t\t}\n\t\t\tcout<<endl;\n\t\t}\n\t}\n\treturn 0;\n}\nint change(int x[100],int a,int b){\n\tint i,y[100];\n\tfor(i=0;a>0;i++){\n\t\tif(a%b!=0){y[i]=a%b;a=a-y[i];}\n\t\telse {y[i]=0;i++;a=a/b;y[i]=a%b;a=a-y[i];}\n\t}\n\tfor(int j=0;j<i;j++){\n\t\tx[j]=y[i-j-1];\n\t}\n\treturn i;\n}",PARTIAL_ACCEPTED,29,424
1279013982185127936,438eaf099d969f42500339cca22c8f7b70bc0a0cf86c4eb63b1ab7c47cbf9ddc,2020-07-03 19:27:50,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main(){\n\tint change(int x[100],int a,int b);\n\tint B,squ,sq,a[100],b[100],m,n;\n\tcin>>B;\n\tfor(int i=1;i<=300;i++){\n\t\tsqu=i;sq=i*i;\n\t\tm=change(a,squ,B);\n\t\tn=change(b,sq,B);\n\t\tint s=1;\n\t\tfor(int k=0;k<n;k++)\n\t\t\tif(b[k]!=b[n-k-1])s=0;\n\t\tif(s==1){\n\t\t\tfor(int j=0;j<m;j++)cout<<a[j];\n\t\t\tcout<<\"" \"";\n\t\t\tfor(int j=0;j<n;j++)cout<<b[j];\n\t\t\tcout<<endl;\n\t\t}\n\t}\n\treturn 0;\n}\nint change(int x[100],int a,int b){\n\tint i,y[100];\n\tfor(i=0;a>0;i++){\n\t\tif(a%b!=0){y[i]=a%b;a=a-y[i];}\n\t\telse {a=a/b;y[i]=a%b;a=a-y[i];}\n\t}\n\tfor(int j=0;j<i;j++){\n\t\tx[j]=y[i-j-1];\n\t}\n\treturn i;\n}",PARTIAL_ACCEPTED,40,516
1279014145347739648,459ce662b14bafd9f391c359c54aa17e63014ceaede44a8bee3262a42b80fe2f,2020-07-03 19:28:29,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nint t1[100];\nchar t2[100];\nint h = 0;\nvoid trans(int n,int x)\n{\n\tint i;\n\tfor ( i = 0; x; i++)\n\t{\n\t\t\n\t\tt1[i] = x%n;\n\t\tx = x / n;\n\t\th++;\n\t}\n\t\n}\nvoid tranc()\n{\n\tint i,h2=h-1;\n\tfor ( i = 0; i <h; i--)\n\t{\n\t\t\n\t\tif (t1[i]<10)\n\t\t{\n\t\t\tt2[h2] = char(t1[i]+'0');\n\t\t}\n\t\telse\n\t\t{\n\t\t\tt2[h2] = char(t1[i] + 'A'-10);\n\t\t}\n\t\th2--;\n\t}\n}\nbool r()\n{\n\tint end = h-1;\n\tint i;\n\tfor ( i = 0; i < h; i++)\n\t{\n\t\tif (t2[i]!=t2[h-1])\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\th--;\n\t}\n\treturn true;\n}\nint main()\n{\n\tint n,i;\n\tcin >> n;\n\tfor ( i = 0; i <=300 ; i++)\n\t{\n\t\ttrans(n, i * i);\n\t\ttranc();\n\t\tif (r())\n\t\t{\n\t\t\tcout << i << \"" \"" << i * i;\n\t\t}\n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,32,384
1279014505554567168,459ce662b14bafd9f391c359c54aa17e63014ceaede44a8bee3262a42b80fe2f,2020-07-03 19:29:55,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nint t1[100];\nchar t2[100];\nint h = 0;\nvoid trans(int n,int x)\n{\n\tint i;\n\tfor ( i = 0; x; i++)\n\t{\n\t\t\n\t\tt1[i] = x%n;\n\t\tx = x / n;\n\t\th++;\n\t}\n\t\n}\nvoid tranc()\n{\n\tint i,h2=h-1;\n\tfor ( i = 0; i <h; i++)\n\t{\n\t\t\n\t\tif (t1[i]<10)\n\t\t{\n\t\t\tt2[h2] = char(t1[i]+'0');\n\t\t}\n\t\telse\n\t\t{\n\t\t\tt2[h2] = char(t1[i] + 'A'-10);\n\t\t}\n\t\th2--;\n\t}\n}\nbool r()\n{\n\tint end = h-1;\n\tint i;\n\tfor ( i = 0; i < h; i++)\n\t{\n\t\tif (t2[i]!=t2[h-1])\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\th--;\n\t}\n\treturn true;\n}\nint main()\n{\n\tint n,i;\n\tcin >> n;\n\tfor ( i = 0; i <=300 ; i++)\n\t{\n\t\ttrans(n, i * i);\n\t\ttranc();\n\t\tif (r())\n\t\t{\n\t\t\tcout << i << \"" \"" << i * i;\n\t\t}\n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,33,452
1279014594528337920,438eaf099d969f42500339cca22c8f7b70bc0a0cf86c4eb63b1ab7c47cbf9ddc,2020-07-03 19:30:16,C++,60.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main(){\n\tint change(int x[100],int a,int b);\n\tint B,squ,sq,a[100],b[100],m,n;\n\tcin>>B;\n\tfor(int i=1;i<=300;i++){\n\t\tsqu=i;sq=i*i;\n\t\tm=change(a,squ,B);\n\t\tn=change(b,sq,B);\n\t\tint s=1;\n\t\tfor(int k=0;k<n;k++)\n\t\t\tif(b[k]!=b[n-k-1])s=0;\n\t\tif(s==1){\n\t\t\tfor(int j=0;j<m;j++)\n\t\t\t\tswitch(a[j]){\n\t\t\t\tcase 10:cout<<'A';break;\n\t\t\t\tcase 11:cout<<'B';break;\n\t\t\t\tcase 12:cout<<'C';break;\n\t\t\t\tcase 13:cout<<'D';break;\n\t\t\t\tcase 14:cout<<'E';break;\n\t\t\t\tcase 15:cout<<'F';break;\n\t\t\t\tcase 16:cout<<'G';break;\n\t\t\t\tcase 17:cout<<'H';break;\n\t\t\t\tcase 18:cout<<'I';break;\n\t\t\t\tcase 19:cout<<'J';break;\n\t\t\t\tdefault:cout<<a[j];\n\t\t\t}\n\t\t\tcout<<\"" \"";\n\t\t\tfor(int j=0;j<n;j++)\n\t\t\t\tswitch(b[j]){\n\t\t\t\tcase 10:cout<<'A';break;\n\t\t\t\tcase 11:cout<<'B';break;\n\t\t\t\tcase 12:cout<<'C';break;\n\t\t\t\tcase 13:cout<<'D';break;\n\t\t\t\tcase 14:cout<<'E';break;\n\t\t\t\tcase 15:cout<<'F';break;\n\t\t\t\tcase 16:cout<<'G';break;\n\t\t\t\tcase 17:cout<<'H';break;\n\t\t\t\tcase 18:cout<<'I';break;\n\t\t\t\tcase 19:cout<<'J';break;\n\t\t\t\tdefault:cout<<b[j];\n\t\t\t}\n\t\t\tcout<<endl;\n\t\t}\n\t}\n\treturn 0;\n}\nint change(int x[100],int a,int b){\n\tint i,y[100];\n\tfor(i=0;a>0;i++){\n\t\tif(a%b!=0){y[i]=a%b;a=a-y[i];}\n\t\telse {a=a/b;y[i]=a%b;a=a-y[i];}\n\t}\n\tfor(int j=0;j<i;j++){\n\t\tx[j]=y[i-j-1];\n\t}\n\treturn i;\n}",PARTIAL_ACCEPTED,27,512
1279015127938957312,459ce662b14bafd9f391c359c54aa17e63014ceaede44a8bee3262a42b80fe2f,2020-07-03 19:32:24,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nint t1[100];\nchar t2[100];\nint h = 0;\nvoid trans(int n,int x)\n{\n\th = 0;\n\tint i;\n\tfor ( i = 0; x; i++)\n\t{\n\t\t\n\t\tt1[i] = x%n;\n\t\tx = x / n;\n\t\th++;\n\t}\n\t\n}\nvoid tranc()\n{\n\tint i,h2=h-1;\n\tfor ( i = 0; i <h; i++)\n\t{\n\t\t\n\t\tif (t1[i]<10)\n\t\t{\n\t\t\tt2[h2] = char(t1[i]+'0');\n\t\t}\n\t\telse\n\t\t{\n\t\t\tt2[h2] = char(t1[i] + 'A'-10);\n\t\t}\n\t\th2--;\n\t}\n}\nbool r()\n{\n\tint i;\n\tfor ( i = 0; i < h; i++)\n\t{\n\t\tif (t2[i]!=t2[h-1])\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\th--;\n\t}\n\treturn true;\n}\nint main()\n{\n\tint n,i;\n\tcin >> n;\n\tfor ( i = 1; i <=300 ; i++)\n\t{\n\t\ttrans(n, i * i);\n\t\ttranc();\n\t\tif (r())\n\t\t{\n\t\t\tcout << i << \"" \"" << i * i<<endl;\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,40,392
1279017397954994176,782de8de24b69682b55d2ec864c3c74059925a75bca9e240d2c3ba45de48e5f7,2020-07-03 19:41:25,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstring>\nusing namespace std;\n\n\nint main(){\n    char num1[400];\n    char num2[400];\n    int p1 = 0;\n    int p2 = 0;\n    int k = 0;\n    cin >> k;\n    \n    for (int i=1;i<=300;i++){\n        int s2 = i*i;\n        while(s2){\n            int mo = s2 % k;\n            if (mo >= 10)\n                num2[p2] = (mo-10) + 'A';\n            else\n                num2[p2] =mo + '0';\n            s2 = s2 / k;\n            p2++;\n        }\n        \n        bool sym = 1;\n        for (int i=(p2/2)-1;i>=0;i--){\n            if (num2[i] != num2[p2-i-1]){\n                sym = false;\n                break;\n            }\n        }\n        \n        if (sym){\n            int n = i;\n            while(n){\n                int mo = n % k;\n                if (mo < 10)\n                    num1[p1] = mo + 48;\n                else\n                    num1[p2] = (mo-10)+65;\n                p1++;\n                n = n / k;\n            }\n            \n            for (int i=p1-1;i>=0;i--){\n                cout << num1[i];\n            }\n            cout << \"" \"";\n            for (int i=p2-1;i>=0;i--){\n                cout << num2[i];\n            }\n            cout<<endl;\n        }\n        p1 = p2 = 0;\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,45,592
1279018060495642624,459ce662b14bafd9f391c359c54aa17e63014ceaede44a8bee3262a42b80fe2f,2020-07-03 19:44:03,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nint t1[100];\nchar t2[100];\nint h = 0;\nvoid trans(int n,int x)\n{\n\th = 0;\n\tint i;\n\tfor ( i = 0; x; i++)\n\t{\n\t\t\n\t\tt1[i] = x%n;\n\t\tx = x / n;\n\t\th++;\n\t}\n\t\n}\nvoid tranc()\n{\n\tint i,h2=h-1;\n\tfor ( i = 0; i <h; i++)\n\t{\n\t\t\n\t\tif (t1[i]<10)\n\t\t{\n\t\t\tt2[h2] = char(t1[i]+'0');\n\t\t}\n\t\telse\n\t\t{\n\t\t\tt2[h2] = char(t1[i] + 'A'-10);\n\t\t}\n\t\th2--;\n\t}\n}\nbool r()\n{\n\tint i,h3=h;\n\tfor ( i = 0; i < h3; i++)\n\t{\n\t\tif (t2[i]!=t2[h3-1])\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\th3--;\n\t}\n\treturn true;\n}\nint main()\n{\n\tint n,i,j;\n\tcin >> n;\n\tfor ( i = 1; i <=300 ; i++)\n\t{\n\t\ttrans(n, i * i);\n\t\ttranc();\n\t\tif (r())\n\t\t{\n\t\t\ttrans(n,i);\n\t\t\ttranc();\n\t\t\tcout << t2<<\"" \"";\n\t\t\ttrans(n, i*i);\n\t\t\ttranc();\n\t\t\tcout << t2<<endl;\n\t\t}\n\t}\n\treturn 0;\n}",WRONG_ANSWER,41,628
1279018281388662784,438eaf099d969f42500339cca22c8f7b70bc0a0cf86c4eb63b1ab7c47cbf9ddc,2020-07-03 19:44:55,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main(){\n\tint change(int x[100],int a,int b);\n\tint B,squ,sq,a[100],b[100],m,n;\n\tcin>>B;\n\tfor(int i=1;i<=300;i++){\n\t\tsqu=i;sq=i*i;\n\t\tm=change(a,squ,B);\n\t\tn=change(b,sq,B);\n\t\tint s=1;\n\t\tfor(int k=0;k<n;k++)\n\t\t\tif(b[k]!=b[n-k-1])s=0;\n\t\tif(s==1){\n\t\t\tfor(int j=0;j<m;j++)\n\t\t\t\tswitch(a[j]){\n\t\t\t\tcase 10:cout<<'A';break;\n\t\t\t\tcase 11:cout<<'B';break;\n\t\t\t\tcase 12:cout<<'C';break;\n\t\t\t\tcase 13:cout<<'D';break;\n\t\t\t\tcase 14:cout<<'E';break;\n\t\t\t\tcase 15:cout<<'F';break;\n\t\t\t\tcase 16:cout<<'G';break;\n\t\t\t\tcase 17:cout<<'H';break;\n\t\t\t\tcase 18:cout<<'I';break;\n\t\t\t\tcase 19:cout<<'J';break;\n\t\t\t\tdefault:cout<<a[j];\n\t\t\t}\n\t\t\tcout<<\"" \"";\n\t\t\tfor(int j=0;j<n;j++)\n\t\t\t\tswitch(b[j]){\n\t\t\t\tcase 10:cout<<'A';break;\n\t\t\t\tcase 11:cout<<'B';break;\n\t\t\t\tcase 12:cout<<'C';break;\n\t\t\t\tcase 13:cout<<'D';break;\n\t\t\t\tcase 14:cout<<'E';break;\n\t\t\t\tcase 15:cout<<'F';break;\n\t\t\t\tcase 16:cout<<'G';break;\n\t\t\t\tcase 17:cout<<'H';break;\n\t\t\t\tcase 18:cout<<'I';break;\n\t\t\t\tcase 19:cout<<'J';break;\n\t\t\t\tdefault:cout<<b[j];\n\t\t\t}\n\t\t\tcout<<endl;\n\t\t}\n\t}\n\treturn 0;\n}\nint change(int x[100],int a,int b){\n\tint i,y[100];\n\tfor(i=0;a>0;i++){\n\t\tif(a%b!=0){y[i]=a%b;a=a-y[i];}\n\t\telse if(i!=0){a=a/b;y[i]=a%b;a=a-y[i];}\n\t\telse {y[0]=0;a=a/b;}\n\t}\n\tfor(int j=0;j<i;j++){\n\t\tx[j]=y[i-j-1];\n\t}\n\treturn i;\n}",ACCEPTED,40,512
1279018822273531904,459ce662b14bafd9f391c359c54aa17e63014ceaede44a8bee3262a42b80fe2f,2020-07-03 19:47:04,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nint t1[100];\nchar t2[100];\nint h = 0;\nvoid trans(int n,int x)\n{\n\th = 0;\n\tint i;\n\tfor ( i = 0; x; i++)\n\t{\n\t\t\n\t\tt1[i] = x%n;\n\t\tx = x / n;\n\t\th++;\n\t}\n\t\n}\nvoid tranc()\n{\n\tint i,h2=h-1;\n\tfor ( i = 0; i <h; i++)\n\t{\n\t\t\n\t\tif (t1[i]<10)\n\t\t{\n\t\t\tt2[h2] = char(t1[i]+'0');\n\t\t}\n\t\telse\n\t\t{\n\t\t\tt2[h2] = char(t1[i] + 'A'-10);\n\t\t}\n\t\th2--;\n\t}\n}\nbool r()\n{\n\tint i,h3=h;\n\tfor ( i = 0; i < h3; i++)\n\t{\n\t\tif (t2[i]!=t2[h3-1])\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\th3--;\n\t}\n\treturn true;\n}\nint main()\n{\n\tint n,i,j;\n\tcin >> n;\n\tfor ( i = 1; i <=300 ; i++)\n\t{\n\t\ttrans(n, i * i);\n\t\ttranc();\n\t\tif (r())\n\t\t{\n\t\t\ttrans(n,i);\n\t\t\ttranc();\n\t\t\tfor ( j = 0; j <h; j++)\n\t\t\t{\n\t\t\t\tcout << t2[j];\n\t\t\t}\n\t\t\ttrans(n, i*i);\n\t\t\ttranc();\n\t\t\tcout << \"" \"";\n\t\t\tfor (j = 0; j < h; j++)\n\t\t\t{\n\t\t\t\tcout << t2[j];\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,34,540
1279020337973362688,00f4fee551df8c2a2d26b8f89acb2489dbd60fc1c678c81d2c25c5f1b599b2a6,2020-07-03 19:53:06,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<algorithm>\nusing namespace std;\nint B;\nint a[300];\nbool Hui(int x)\n{\n    int n=0;\n    x=x*x;\n    while (x)\n    {\n        a[++n]=x%B;\n        x=x/B;\n    }\n    for (int i = 1,j=n; i < j; i++,j--)\n    {\n        if (a[i]!=a[j])\n        {\n            return 0;\n        }\n    }\n    return 1;\n}\nvoid Jin(int x)\n{\n    int n=0;\n    while (x)\n    {\n        a[++n]=x%B;\n        x=x/B;\n    }\n    for (int i = n; i >0; i--)\n    {\n        if (a[i]>9)\n        {\n            printf(\""%c\"",a[i]-10+'A');\n        }\n        else\n        {\n            cout<<a[i];\n        }\n        \n    }\n\n}\nint main()\n{\n    cin>>B;\n    for (int a = 1; a < 301; a++)\n    {\n        if (Hui(a))\n        {\n            Jin(a);\n            cout<<\"" \"";\n            Jin(a*a);\n            cout<<endl;\n        }\n        \n    }\n    \n}",ACCEPTED,40,512
1279021131531476992,c5f006269b926e61241c8f09728f8ca99c23da829b64fc3aefb604777dcc38c7,2020-07-03 19:56:15,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,#include<iostream>\nusing namespace std;\nint main()\n{\n    int N;\n    int S;\n    int ns[50];\n    int index;\n    int can;\n    int lenght;\n    bool IsHui;\n    int count;\n    int countshu = 0;\n    int counthui = 0;\n    cin >> N;\n    cin >> S;\n    while(true)\n    {\n        S++;\n        can = S;\n        for(int i = 2; i <= 10; i++)\n        {\n            ns[index] = can%i;\n            index++;\n            can = can/i;\n            while(can != 0)\n            {\n                ns[index] = can%i;\n                index++;\n                can = can/i;\n            }\n            lenght = index;\n            index = 0;\n            if(lenght == 1){countshu++;}\n            else\n            {\n                for(int j = 0; j < lenght/2; j++)\n                {\n                    if(ns[j] == ns[lenght-1-j]){count++;continue;}\n                    else{break;}\n                }  \n            }\n            IsHui = (count == index);\n            count = 0;\n            if(IsHui){countshu++;}\n        }\n        if(countshu >= 2){cout << S << endl;counthui++;}\n        if(counthui == 3){break;}\n    }\n    return 0;\n},WRONG_ANSWER,35,512
1279021312888995840,c5f006269b926e61241c8f09728f8ca99c23da829b64fc3aefb604777dcc38c7,2020-07-03 19:56:58,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,#include<iostream>\nusing namespace std;\nint main()\n{\n    int N;\n    int S;\n    int ns[10000];\n    int index;\n    int can;\n    int lenght;\n    bool IsHui;\n    int count;\n    int countshu = 0;\n    int counthui = 0;\n    cin >> N;\n    cin >> S;\n    while(true)\n    {\n        S++;\n        can = S;\n        for(int i = 2; i <= 10; i++)\n        {\n            ns[index] = can%i;\n            index++;\n            can = can/i;\n            while(can != 0)\n            {\n                ns[index] = can%i;\n                index++;\n                can = can/i;\n            }\n            lenght = index;\n            index = 0;\n            if(lenght == 1){countshu++;}\n            else\n            {\n                for(int j = 0; j < lenght/2; j++)\n                {\n                    if(ns[j] == ns[lenght-1-j]){count++;continue;}\n                    else{break;}\n                }  \n            }\n            IsHui = (count == index);\n            count = 0;\n            if(IsHui){countshu++;}\n        }\n        if(countshu >= 2){cout << S << endl;counthui++;}\n        if(counthui == 3){break;}\n    }\n    return 0;\n},WRONG_ANSWER,34,384
1279021434813218816,c5f006269b926e61241c8f09728f8ca99c23da829b64fc3aefb604777dcc38c7,2020-07-03 19:57:27,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,#include<iostream>\nusing namespace std;\nint main()\n{\n    int N;\n    int S;\n    int ns[5];\n    int index;\n    int can;\n    int lenght;\n    bool IsHui;\n    int count;\n    int countshu = 0;\n    int counthui = 0;\n    cin >> N;\n    cin >> S;\n    while(true)\n    {\n        S++;\n        can = S;\n        for(int i = 2; i <= 10; i++)\n        {\n            ns[index] = can%i;\n            index++;\n            can = can/i;\n            while(can != 0)\n            {\n                ns[index] = can%i;\n                index++;\n                can = can/i;\n            }\n            lenght = index;\n            index = 0;\n            if(lenght == 1){countshu++;}\n            else\n            {\n                for(int j = 0; j < lenght/2; j++)\n                {\n                    if(ns[j] == ns[lenght-1-j]){count++;continue;}\n                    else{break;}\n                }  \n            }\n            IsHui = (count == index);\n            count = 0;\n            if(IsHui){countshu++;}\n        }\n        if(countshu >= 2){cout << S << endl;counthui++;}\n        if(counthui == 3){break;}\n    }\n    return 0;\n},MULTIPLE_ERROR,34,508
1279021955397648384,c5f006269b926e61241c8f09728f8ca99c23da829b64fc3aefb604777dcc38c7,2020-07-03 19:59:31,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,#include<iostream>\nusing namespace std;\nint main()\n{\n    int N;\n    int S;\n    int ns[8];\n    int index;\n    int can;\n    int lenght;\n    bool IsHui;\n    int count;\n    int countshu = 0;\n    int counthui = 0;\n    cin >> N;\n    cin >> S;\n    while(true)\n    {\n        S++;\n        can = S;\n        for(int i = 2; i <= 10; i++)\n        {\n            ns[index] = can%i;\n            index++;\n            can = can/i;\n            while(can != 0)\n            {\n                ns[index] = can%i;\n                index++;\n                can = can/i;\n            }\n            lenght = index;\n            index = 0;\n            if(lenght == 1){countshu++;}\n            else\n            {\n                for(int j = 0; j < lenght/2; j++)\n                {\n                    if(ns[j] == ns[lenght-1-j]){count++;continue;}\n                    else{break;}\n                }  \n            }\n            IsHui = (count == index);\n            count = 0;\n            if(IsHui){countshu++;}\n        }\n        if(countshu >= 2){cout << S << endl;counthui++;}\n        if(counthui == 3){break;}\n    }\n    return 0;\n},MULTIPLE_ERROR,37,616
1279022017288798208,c5f006269b926e61241c8f09728f8ca99c23da829b64fc3aefb604777dcc38c7,2020-07-03 19:59:46,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,#include<iostream>\nusing namespace std;\nint main()\n{\n    int N;\n    int S;\n    int ns[9];\n    int index;\n    int can;\n    int lenght;\n    bool IsHui;\n    int count;\n    int countshu = 0;\n    int counthui = 0;\n    cin >> N;\n    cin >> S;\n    while(true)\n    {\n        S++;\n        can = S;\n        for(int i = 2; i <= 10; i++)\n        {\n            ns[index] = can%i;\n            index++;\n            can = can/i;\n            while(can != 0)\n            {\n                ns[index] = can%i;\n                index++;\n                can = can/i;\n            }\n            lenght = index;\n            index = 0;\n            if(lenght == 1){countshu++;}\n            else\n            {\n                for(int j = 0; j < lenght/2; j++)\n                {\n                    if(ns[j] == ns[lenght-1-j]){count++;continue;}\n                    else{break;}\n                }  \n            }\n            IsHui = (count == index);\n            count = 0;\n            if(IsHui){countshu++;}\n        }\n        if(countshu >= 2){cout << S << endl;counthui++;}\n        if(counthui == 3){break;}\n    }\n    return 0;\n},MULTIPLE_ERROR,27,524
1279022069285576704,c5f006269b926e61241c8f09728f8ca99c23da829b64fc3aefb604777dcc38c7,2020-07-03 19:59:59,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,#include<iostream>\nusing namespace std;\nint main()\n{\n    int N;\n    int S;\n    int ns[10];\n    int index;\n    int can;\n    int lenght;\n    bool IsHui;\n    int count;\n    int countshu = 0;\n    int counthui = 0;\n    cin >> N;\n    cin >> S;\n    while(true)\n    {\n        S++;\n        can = S;\n        for(int i = 2; i <= 10; i++)\n        {\n            ns[index] = can%i;\n            index++;\n            can = can/i;\n            while(can != 0)\n            {\n                ns[index] = can%i;\n                index++;\n                can = can/i;\n            }\n            lenght = index;\n            index = 0;\n            if(lenght == 1){countshu++;}\n            else\n            {\n                for(int j = 0; j < lenght/2; j++)\n                {\n                    if(ns[j] == ns[lenght-1-j]){count++;continue;}\n                    else{break;}\n                }  \n            }\n            IsHui = (count == index);\n            count = 0;\n            if(IsHui){countshu++;}\n        }\n        if(countshu >= 2){cout << S << endl;counthui++;}\n        if(counthui == 3){break;}\n    }\n    return 0;\n},MULTIPLE_ERROR,35,512
1279022143952576512,c5f006269b926e61241c8f09728f8ca99c23da829b64fc3aefb604777dcc38c7,2020-07-03 20:00:16,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,#include<iostream>\nusing namespace std;\nint main()\n{\n    int N;\n    int S;\n    int ns[10000];\n    int index;\n    int can;\n    int lenght;\n    bool IsHui;\n    int count;\n    int countshu = 0;\n    int counthui = 0;\n    cin >> N;\n    cin >> S;\n    while(true)\n    {\n        S++;\n        can = S;\n        for(int i = 2; i <= 10; i++)\n        {\n            ns[index] = can%i;\n            index++;\n            can = can/i;\n            while(can != 0)\n            {\n                ns[index] = can%i;\n                index++;\n                can = can/i;\n            }\n            lenght = index;\n            index = 0;\n            if(lenght == 1){countshu++;}\n            else\n            {\n                for(int j = 0; j < lenght/2; j++)\n                {\n                    if(ns[j] == ns[lenght-1-j]){count++;continue;}\n                    else{break;}\n                }  \n            }\n            IsHui = (count == index);\n            count = 0;\n            if(IsHui){countshu++;}\n        }\n        if(countshu >= 2){cout << S << endl;counthui++;}\n        if(counthui == 3){break;}\n    }\n    return 0;\n},WRONG_ANSWER,27,384
1279022816031072256,782de8de24b69682b55d2ec864c3c74059925a75bca9e240d2c3ba45de48e5f7,2020-07-03 20:02:57,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nbool comp(int a, int b){\n    int u=0;\n    int m=a;\n    while (a){\n        u = u*b + a%b;\n        a = a/b;\n    }\n    return u==m;\n}\n\nbool palind(int k){\n    int sym=0;\n    for(int i=2;i<=10;i++){\n        if(comp(k,i)==1){\n            sym++;\n        }\n    }\n    if(sym<2)\n        return 0;\n    else\n        return 1;\n}\n\nint main(){\n    int N,S;\n    cin>>N>>S;\n    while(N){\n        S++;\n        if(palind(S)==1){\n            cout<<S<<endl;\n            N--;\n        }\n    }\n    return 0;\n}",ACCEPTED,34,512
1279029653086330880,459ce662b14bafd9f391c359c54aa17e63014ceaede44a8bee3262a42b80fe2f,2020-07-03 20:30:07,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nint t1[100];\nchar t2[100];\nint h = 0;\nvoid trans(int n,int x)\n{\n\th = 0;\n\tint i;\n\tfor ( i = 0; x; i++)\n\t{\n\t\t\n\t\tt1[i] = x%n;\n\t\tx = x / n;\n\t\th++;\n\t}\n\t\n}\nvoid tranc()\n{\n\tint i,h2=h-1;\n\tfor ( i = 0; i <h; i++)\n\t{\n\t\t\n\t\tif (t1[i]<10)\n\t\t{\n\t\t\tt2[h2] = char(t1[i]+'0');\n\t\t}\n\t\telse\n\t\t{\n\t\t\tt2[h2] = char(t1[i] + 'A'-10);\n\t\t}\n\t\th2--;\n\t}\n}\nbool r()\n{\n\tint i,h3=h;\n\tfor ( i = 0; i < h3; i++)\n\t{\n\t\tif (t2[i]!=t2[h3-1])\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\th3--;\n\t}\n\treturn true;\n}\nint main()\n{\n\tint n,i,j,flag=0,h,s,numbers=0;\n\tcin >> h;\n\tcin >> s;\n\tfor ( i = s;  ; i++)\n\t{\n\t\tflag = 0;\n\t\tfor ( n <= 1; n <=15; n++)\n\t\t{\n\t\t\ttrans(n, i);\n\t\t\ttranc();\n\t\t\tif (r())\n\t\t\t{\n\t\t\t\tflag++;\n\t\t\t}\n\t\t\tif (flag==2)\n\t\t\t{\n\t\t\t\tfor ( j = 0; j < n; j++)\n\t\t\t\t{\n\t\t\t\t\tcout << t2[j]<<endl;\n\t\t\t\t}\n\t\t\t\tnumbers++;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t}\n\t\tif (numbers==h)\n\t\t{\n\t\t\tbreak;\n\t\t}\n\t\t\n\t}\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,0,0
1279036160163119104,f1ad5eb80f6bab0de873eaed6ebc9b942566979cd22a9563d2f4fe8a8bbf8df7,2020-07-03 20:55:58,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\n\nbool hw(string s)//判断字符串回文 \n{\n\tint i, len = s.size();//假设len=4 \n\tfor (i = 0; i < len / 2; ++i)//奇数长度最中间字符不参加比较\n\t{//偶数长度只比较1-len/2次，次数从0计起就要减1 \n\t\tif (s[i] != s[len - 1 - i])//s[1]!=s[4-1-1]\n\t\t\treturn false;\n\t}\n\treturn true;\n}\nstring ten2b(int n, int b)//10进制整型n转b进制字符串x \n{\n\tstring x, dic = \""0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"";\n\twhile (n)\n\t{\n\t\tx = dic[n % b] + x;\n\t\t\n\t}\n\treturn x;\n}\nint main()\n{\n\tint i, m, b;\n\tstring s;\n\tcin >> b;\n\tfor (i = 1; i <= 300; ++i)\n\t{\n\t\tm = i * i;//生成10进制平方数\n\t\ts = ten2b(m, b);\n\t\tif (hw(s))\n\t\t\tcout << ten2b(i, b) << \"" \"" << s << endl;\n\t}\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,0,0
1279036338160984064,387dee2d802731a9463bda4a7a8916ccc6198e105f0fa92dced456125caf20d0,2020-07-03 20:56:41,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint num[300]={0,1,2,3,4,5,6,7,8,9,10,15,16,17,18,20,21,24,26,27,28,31,33,36,40,45,46,50,51,52,55,57,63,65,67,73,78,80,82,85,88,91,92,93,98,99,100,104,105,107,109,111,114,119,121,127,129,130,135,141,142,150,151,154,160,164,170,171,173,178,182,185,186,191,195,200,203,209,212,215,\n219,227,235,242,246,252,255,257,264,273,282,292,300,313,316,325,328,333,341,342,343,357,364,365,373,381,393,400,414,427,434,438,446,455,464,471,484,495,511,513,546,555,560,564,585,624,626,644,646,651,656,666,676,692,693,701,717,728,730,757,771,777,787,819,820,856,868,910,939,975,\n1023,1025,1066,1105,1221,1285,1312,1365,1432,1441,1460,1539,1550,1640,1667,1755,1885,2000,2188,2268,2293,2550,2565,2709,2730,2910,2920,2925,2997,3069,3074,3075,3280,3315,3550,3591,3640,3663,3735,3740,3855,3951,3999,4095,4097,4161,4225,4257,4289,4369,4433,4593,4617,4681,5001,5049,5125,5189,5397,5461,\n5740,5840,5854,6148,6200,6560,6562,6643,6697,6724,6761,6825,6886,6889,6953,7300,7373,7381,7409,7447,7462,7517,7667,7703,7777,7801,7997,8038,8119,8194,8200,8258,8281,8322,8386,8578,8778,8802,9009,9103,9201,9222,9490,9958,10252,10308,10658,10794,10858,10922,\n10986,11253,11314,11757,11898,11950,12291,12355,12419,12483, 12547,12654,12691,13107,13124,13131,13205,13286,13299,13331};\n\nint n,s,g;\nint main()\n{\n\tcin>>n>>s;\n\tfor(g=1;num[g]<=s;g++);\n\tfor(int i=0;i<n;i++)cout<<num[g+i]<<endl;\n\treturn 0;\n}",ACCEPTED,36,484
1279037323218444288,f1ad5eb80f6bab0de873eaed6ebc9b942566979cd22a9563d2f4fe8a8bbf8df7,2020-07-03 21:00:35,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\n\nbool hw(string s)//判断字符串回文 \n{\n\tint i, len = s.size();//假设len=4 \n\tfor (i = 0; i < len / 2; ++i)//奇数长度最中间字符不参加比较\n\t{//偶数长度只比较1-len/2次，次数从0计起就要减1 \n\t\tif (s[i] != s[len - 1 - i])//s[1]!=s[4-1-1]\n\t\t\treturn false;\n\t}\n\treturn true;\n}\nstring ten2b(int n, int b)//10进制整型n转b进制字符串x \n{\n\tstring x, dic = \""0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"";\n\twhile (n)\n\t{\n\t\tx = dic[n % b] + x;\n\t\t\n\t}\n\treturn x;\n}\nint main()\n{\n\tint i, m, b;\n\tstring s;\n\tcin >> b;\n\tfor (i = 1; i <= 300; ++i)\n\t{\n\t\tm = i * i;//生成10进制平方数\n\t\ts = ten2b(m, b);\n\t\tif (hw(s))\n\t\t\tcout << ten2b(i, b) << \"" \"" << s << endl;\n\t}\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,0,0
1279037830288834560,f1ad5eb80f6bab0de873eaed6ebc9b942566979cd22a9563d2f4fe8a8bbf8df7,2020-07-03 21:02:36,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\n\nbool hw(string s)\n{\n\tint i, len = s.size();\n\tfor (i = 0; i < len / 2; i++)\n\t{\n\t\tif (s[i] != s[len - 1 - i])\n\t\t\treturn false;\n\t}\n\treturn true;\n}\nstring ten2b(int n, int b)//10进制整型n转b进制字符串x \n{\n\tstring x, dic = \""0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"";\n\twhile (n)\n\t{\n\t\tx = dic[n % b] + x;\n\t\t\n\t}\n\treturn x;\n}\nint main()\n{\n\tint i, m, b;\n\tstring s;\n\tcin >> b;\n\tfor (i = 1; i <= 300; ++i)\n\t{\n\t\tm = i * i;\n\t\ts = ten2b(m, b);\n\t\tif (hw(s))\n\t\t\tcout << ten2b(i, b) << \"" \"" << s << endl;\n\t}\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,0,0
1279037859032391680,2a9d735ba9687ca747a904130698ba07c3bee1e7cd8d7d8a85b0bb4150c7e1af,2020-07-03 21:02:43,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<string.h>\n#define max 20\nusing namespace std;\n\n\nvoid f1(char*a, int b, int base){ //进制转换\n    int i{0};\n    while(b){\n        int c = b%base;\n        if(c<10){\n            a[i++]=c+'0';\n        }\n        else\n            a[i++] = c-10+'A';\n        b/=base;\n    }\n}\n\nbool isHuiWen(char*a, int b, int base){\n    f1(a,b,base);\n    int L = strlen(a);\n    for(int i =0;i<L/2;i++){\n        if(a[i]!=a[L-i-1])\n            return false;\n    }\n    return true;\n}\n\nint main()\n{\n    int base;\n    cin>>base;\n    char a[max], b[max];\n    memset (a, '\\0', sizeof(a));\n    memset(b,'\\0',sizeof(b));\n    for(int i=1;i<=300;i++){\n        int squ = i*i;\n        if(isHuiWen(a,squ,base)){\n            f1(b,i,base);\n            int L = strlen(b);\n            for(int j=L-1;j>=0;j--)\n                cout<<b[j];\n            cout<<\"" \""<<a<<endl;\n        }\n    }\n}\n",ACCEPTED,43,512
1279038637189038080,f1ad5eb80f6bab0de873eaed6ebc9b942566979cd22a9563d2f4fe8a8bbf8df7,2020-07-03 21:05:49,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\n\nbool hw(string s)\n{\n\tint i, len = s.size();\n\tfor (i = 0; i < len / 2; i++)\n\t{\n\t\tif (s[i] != s[len - 1 - i])\n\t\t\treturn false;\n\t}\n\treturn true;\n}\nstring ten2b(int n, int b)//10进制整型n转b进制字符串x \n{\n\tstring x, dic = \""0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"";\n\twhile (n)\n\t{\n\t\tx = dic[n % b] + x;\n\t\tn/=b;\n\t}\n\treturn x;\n}\nint main()\n{\n\tint i, m, b;\n\tstring s;\n\tcin >> b;\n\tfor (i = 1; i <= 300; ++i)\n\t{\n\t\tm = i * i;\n\t\ts = ten2b(m, b);\n\t\tif (hw(s))\n\t\t\tcout << ten2b(i, b) << \"" \"" << s << endl;\n\t}\n\treturn 0;\n}",ACCEPTED,42,512
1279038776469282816,f1ad5eb80f6bab0de873eaed6ebc9b942566979cd22a9563d2f4fe8a8bbf8df7,2020-07-03 21:06:22,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\n\nbool hw(string m)\n{\n\tint i, len = m.size();\n\tfor (i = 0; i < len / 2; i++)\n\t{\n\t\tif (s[i] != m[len - 1 - i])\n\t\t\treturn false;\n\t}\n\treturn true;\n}\nstring ten2b(int n, int b)//10进制整型n转b进制字符串x \n{\n\tstring x, dic = \""0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"";\n\twhile (n)\n\t{\n\t\tx = dic[n % b] + x;\n\t\tn/=b;\n\t}\n\treturn x;\n}\nint main()\n{\n\tint i, m, b;\n\tstring s;\n\tcin >> b;\n\tfor (i = 1; i <= 300; ++i)\n\t{\n\t\tm = i * i;\n\t\ts = ten2b(m, b);\n\t\tif (hw(s))\n\t\t\tcout << ten2b(i, b) << \"" \"" << s << endl;\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1279038976122347520,f1ad5eb80f6bab0de873eaed6ebc9b942566979cd22a9563d2f4fe8a8bbf8df7,2020-07-03 21:07:09,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\n\nbool hw(string m)\n{\n\tint i, len = m.size();\n\tfor (i = 0; i < len / 2; i++)\n\t{\n\t\tif (m[i] != m[len - 1 - i])\n\t\t\treturn false;\n\t}\n\treturn true;\n}\nstring ten2b(int n, int c)//10进制整型n转b进制字符串x \n{\n\tstring x, dic = \""0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"";\n\twhile (n)\n\t{\n\t\tx = dic[n % c] + x;\n\t\tn/=c;\n\t}\n\treturn x;\n}\nint main()\n{\n\tint i, m, b;\n\tstring o;\n\tcin >> b;\n\tfor (i = 1; i <= 300; ++i)\n\t{\n\t\tm = i * i;\n\t\ts = ten2b(m, b);\n\t\tif (hw(o))\n\t\t\tcout << ten2b(i, b) << \"" \"" << o << endl;\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1279039010217844736,f1ad5eb80f6bab0de873eaed6ebc9b942566979cd22a9563d2f4fe8a8bbf8df7,2020-07-03 21:07:18,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\n\nbool hw(string m)\n{\n\tint i, len = m.size();\n\tfor (i = 0; i < len / 2; i++)\n\t{\n\t\tif (m[i] != m[len - 1 - i])\n\t\t\treturn false;\n\t}\n\treturn true;\n}\nstring ten2b(int n, int c)//10进制整型n转b进制字符串x \n{\n\tstring x, dic = \""0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"";\n\twhile (n)\n\t{\n\t\tx = dic[n % c] + x;\n\t\tn/=c;\n\t}\n\treturn x;\n}\nint main()\n{\n\tint i, m, b;\n\tstring o;\n\tcin >> b;\n\tfor (i = 1; i <= 300; ++i)\n\t{\n\t\tm = i * i;\n\t\to = ten2b(m, b);\n\t\tif (hw(o))\n\t\t\tcout << ten2b(i, b) << \"" \"" << o << endl;\n\t}\n\treturn 0;\n}",ACCEPTED,34,424
1279045743115960320,f1ad5eb80f6bab0de873eaed6ebc9b942566979cd22a9563d2f4fe8a8bbf8df7,2020-07-03 21:34:03,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nbool hw(string s)\n{\n\tint i, len = s.size();\n\tfor (i = 0; i < len / 2; ++i)\n\t{\n\t\tif (s[i] != s[len - 1 - i])\n\t\t\treturn false;\n\t}\n\treturn true;\n}string ten2b(int n, int c)\n{\n\tstring x, dic = \""0123456789\"";\n\twhile (n)\n\t{\n\t\tx = dic[n % c] + x;\n\t\tn /= c;\n\t}\n\treturn x;\n}\nint main()\n{\n\tstring q;\n\tint i,j,N, S,m=0;\n\tcin >> N >> S;\n\tfor (i = 0; i < 1000; i++)\n\t{\n\t\tS += 1;\n\t\tfor (j = 2; j < 11; j++)\n\t\t{\n\t\t\tq=ten2b(S, j);\n\t\t\tif (hw(q))\n\t\t\t\tcout << q << endl;\n\t\t\tm++;\n\t\t}\n\t\tif (m == N)\n\t\t\tbreak;\n\t}\n\treturn 0;\n\t\t\n\n}",WRONG_ANSWER,53,556
1279049483877285888,f1ad5eb80f6bab0de873eaed6ebc9b942566979cd22a9563d2f4fe8a8bbf8df7,2020-07-03 21:48:55,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nbool hw(string s)\n{\n\tint i, len = s.size();\n\tfor (i = 0; i < len / 2; ++i)\n\t{\n\t\tif (s[i] != s[len - 1 - i])\n\t\t\treturn false;\n\t}\n\treturn true;\n}string ten2b(int n, int c)\n{\n\tstring x, dic = \""0123456789\"";\n\twhile (n)\n\t{\n\t\tx = dic[n % c] + x;\n\t\tn /= c;\n\t}\n\treturn x;\n}\nint main()\n{\n\tstring q;\n\tint i,j,N, S,m=0,z=0;\n\tcin >> N >> S;\n\tfor (i = 0; i < 1000; i++)\n\t{\n\t\tS =S+ 1;\n\t\tfor (j = 2; j < 11; j++)\n\t\t{\n\t\t\tq = ten2b(S, j);\n\t\t\tif (hw(q))\n\t\t\t{\n\t\t\t\tm++;\n\t\t\t}\n\t\t}\n\t\tif (m >= 2)\n\t\t\tcout << S << endl;\n\t\t    z++;\n\t\t\n\t\tif (z == N)\n\t\t\tbreak;\n\t}\n\treturn 0;\n\t\t\n\n}",PARTIAL_ACCEPTED,37,512
1279049560276533248,f1ad5eb80f6bab0de873eaed6ebc9b942566979cd22a9563d2f4fe8a8bbf8df7,2020-07-03 21:49:13,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nbool hw(string s)\n{\n\tint i, len = s.size();\n\tfor (i = 0; i < len / 2; ++i)\n\t{\n\t\tif (s[i] != s[len - 1 - i])\n\t\t\treturn false;\n\t}\n\treturn true;\n}string ten2b(int n, int c)\n{\n\tstring x, dic = \""0123456789\"";\n\twhile (n)\n\t{\n\t\tx = dic[n % c] + x;\n\t\tn /= c;\n\t}\n\treturn x;\n}\nint main()\n{\n\tstring q;\n\tint i,j,N, S,m=0,z=0;\n\tcin >> N >> S;\n\tfor (i = 0; i < 1000; i++)\n\t{\n\t\tS =S+ 1;\n\t\tfor (j = 2; j < 11; j++)\n\t\t{\n\t\t\tq = ten2b(S, j);\n\t\t\tif (hw(q))\n\t\t\t{\n\t\t\t\tm++;\n\t\t\t}\n\t\t}\n\t\tif (m >= 2)\n\t\t\tcout << S << endl;\n\t\t    z++;\n\t\t\n\t\tif (z == N)\n\t\t\tbreak;\n\t}\n\treturn 0;\n\t\t\n\n}",PARTIAL_ACCEPTED,40,608
1279049571689226240,438eaf099d969f42500339cca22c8f7b70bc0a0cf86c4eb63b1ab7c47cbf9ddc,2020-07-03 21:49:16,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main(){\n\tint change(int x[100],int a,int b);\n\tint N,S,m,a[100],n=0;\n\tcin>>N>>S;\n\tfor(int i=S+1;n<N;i++){\n\t\tint s=1,x=0;\n\t\tfor(int j=2;j<=10;j++){\n\t\t\tm=change(a,i,j);\n\t\t\tfor(int k=0;k<m;k++){\n\t\t\t\tif(a[k]!=a[m-k-1])s=0;\n\t\t\t}\n\t\t\tif(s==1)x=x+1;\n\t\t\ts=1;\n\t\t}\n\t\tif(x>=2){cout<<i<<endl;n=n+1;}\n\t}\n\treturn 0;\n}\nint change(int x[100],int a,int b){\n\tint i;\n\tfor(i=0;a>0;i++){\n\t\tif(a%b!=0){x[i]=a%b;a=a-x[i];}\n\t\telse if(i!=0){a=a/b;x[i]=a%b;a=a-x[i];}\n\t\telse {x[0]=0;a=a/b;}\n\t}\n\treturn i;\n}",ACCEPTED,34,512
1279049640681340928,f1ad5eb80f6bab0de873eaed6ebc9b942566979cd22a9563d2f4fe8a8bbf8df7,2020-07-03 21:49:32,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nbool hw(string s)\n{\n\tint i, len = s.size();\n\tfor (i = 0; i < len / 2; ++i)\n\t{\n\t\tif (s[i] != s[len - 1 - i])\n\t\t\treturn false;\n\t}\n\treturn true;\n}string ten2b(int n, int c)\n{\n\tstring x, dic = \""0123456789\"";\n\twhile (n)\n\t{\n\t\tx = dic[n % c] + x;\n\t\tn /= c;\n\t}\n\treturn x;\n}\nint main()\n{\n\tstring q;\n\tint i,j,N, S,m=0,z=0;\n\tcin >> N >> S;\n\tfor (i = 0; i < 1000; i++)\n\t{\n\t\tS =S+ 1;\n\t\tfor (j = 2; j < 11; j++)\n\t\t{\n\t\t\tq = ten2b(S, j);\n\t\t\tif (hw(q))\n\t\t\t{\n\t\t\t\tm++;\n\t\t\t}\n\t\t}\n\t\tif (m >= 2)\n\t\t\tcout << S << endl;\n\t\t    z++;\n\t\t\n\t\tif (z == N)\n\t\t\tbreak;\n\t}\n\treturn 0;\n\t\t\n\n}",PARTIAL_ACCEPTED,37,512
1279049948299984896,f1ad5eb80f6bab0de873eaed6ebc9b942566979cd22a9563d2f4fe8a8bbf8df7,2020-07-03 21:50:45,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nbool hw(string s)\n{\n\tint i, len = s.size();\n\tfor (i = 0; i < len / 2; ++i)\n\t{\n\t\tif (s[i] != s[len - 1 - i])\n\t\t\treturn false;\n\t}\n\treturn true;\n}string ten2b(int n, int c)\n{\n\tstring x, dic = \""0123456789\"";\n\twhile (n)\n\t{\n\t\tx = dic[n % c] + x;\n\t\tn /= c;\n\t}\n\treturn x;\n}\nint main()\n{\n\tstring q;\n\tint i,j,N, S,m=0,z=0;\n\tcin >> N >> S;\n\tfor (i = 0; i < 10000; i++)\n\t{\n\t\tS =S+ 1;\n\t\tfor (j = 2; j < 11; j++)\n\t\t{\n\t\t\tq = ten2b(S, j);\n\t\t\tif (hw(q))\n\t\t\t{\n\t\t\t\tm++;\n\t\t\t}\n\t\t}\n\t\tif (m >= 2)\n\t\t\tcout << S << endl;\n\t\t    z++;\n\t\t\n\t\tif (z == N)\n\t\t\tbreak;\n\t}\n\treturn 0;\n\t\t\n\n}",PARTIAL_ACCEPTED,29,384
1279050145058979840,f1ad5eb80f6bab0de873eaed6ebc9b942566979cd22a9563d2f4fe8a8bbf8df7,2020-07-03 21:51:32,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nbool hw(string s)\n{\n\tint i, len = s.size();\n\tfor (i = 0; i < len / 2; ++i)\n\t{\n\t\tif (s[i] != s[len - 1 - i])\n\t\t\treturn false;\n\t}\n\treturn true;\n}string ten2b(int n, int c)\n{\n\tstring x, dic = \""0123456789\"";\n\twhile (n)\n\t{\n\t\tx = dic[n % c] + x;\n\t\tn /= c;\n\t}\n\treturn x;\n}\nint main()\n{\n\tstring q;\n\tint i,j,N, S,m=0,z=0;\n\tcin >> N >> S;\n\tfor (i = 0; i < 10000; i++)\n\t{\n\t\tS =S+ 1;\n\t\tfor (j = 2; j < 11; j++)\n\t\t{\n\t\t\tq = ten2b(S, j);\n\t\t\tif (hw(q))\n\t\t\t{\n\t\t\t\tm++;\n\t\t\t}\n\t\t}\n\t\tif (m >= 2)\n\t\t\tcout << S << endl;\n\t\t    z++;\n\t\t\n\t\tif (z == N)\n\t\t\tbreak;\n\t}\n\treturn 0;\n\t\t\n\n}",PARTIAL_ACCEPTED,40,512
1279052250398253056,f1ad5eb80f6bab0de873eaed6ebc9b942566979cd22a9563d2f4fe8a8bbf8df7,2020-07-03 21:59:54,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nbool is_ok(int x,int k)\n{\n\tcnt=0;\n\twhile(x>0) {\n\t\ta[++cnt]=x%k;\n\t\tx/=k;\n\t}\n\tfor(int i=1; i<=cnt/2; i++)\n\t\tif(a[i]!=a[cnt-i+1])\n\t\t\treturn false;\n\treturn true;\n}\n\nint main()\n{\n\tint n,s;\n    cin>>n>>s;\n\tint ans=0;\n\tfor(int i=s+1; ans!=n; i++) {\n\t\tint sum=0;\n\t\tfor(int j=2; j<=10; j++)\n\t\t\tif(is_ok(i,j)==true)\n\t\t\t\tsum++;\n\t\tif(sum>=2) {\n\t\t\tcout<<i<<endl;\n\t\t\tans++;\t\n\t\t}\n\t}\n\treturn 0;\n}\n",COMPILE_ERROR,0,0
1279052423786586112,f1ad5eb80f6bab0de873eaed6ebc9b942566979cd22a9563d2f4fe8a8bbf8df7,2020-07-03 22:00:36,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nbool is_ok(int x,int k)\n{\n\tint cnt=0;\n\twhile(x>0) {\n\t\ta[++cnt]=x%k;\n\t\tx/=k;\n\t}\n\tfor(int i=1; i<=cnt/2; i++)\n\t\tif(a[i]!=a[cnt-i+1])\n\t\t\treturn false;\n\treturn true;\n}\n\nint main()\n{\n\tint n,s;\n    cin>>n>>s;\n\tint ans=0;\n\tfor(int i=s+1; ans!=n; i++) {\n\t\tint sum=0;\n\t\tfor(int j=2; j<=10; j++)\n\t\t\tif(is_ok(i,j)==true)\n\t\t\t\tsum++;\n\t\tif(sum>=2) {\n\t\t\tcout<<i<<endl;\n\t\t\tans++;\t\n\t\t}\n\t}\n\treturn 0;\n}\n",COMPILE_ERROR,0,0
1279052684085100544,f1ad5eb80f6bab0de873eaed6ebc9b942566979cd22a9563d2f4fe8a8bbf8df7,2020-07-03 22:01:38,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nconst int Maxn=10001;\n\nint n,s;\nint a[Maxn],cnt;\n\nbool is_ok(int x,int k)\n{\n\tcnt=0;\n\twhile(x>0) {\n\t\ta[++cnt]=x%k;\n\t\tx/=k;\n\t}\n\tfor(int i=1; i<=cnt/2; i++)\n\t\tif(a[i]!=a[cnt-i+1])\n\t\t\treturn false;\n\treturn true;\n   \n}\n\nint main()\n{\n\tcin>>n>>s;\n\tint ans=0;\n\tfor(int i=s+1; ans!=n; i++) {\n\t\tint sum=0;\n\t\tfor(int j=2; j<=10; j++)\n\t\t\tif(is_ok(i,j)==true)\n\t\t\t\tsum++;\n\t\tif(sum>=2) {\n\t\t\tcout<<i<<endl;\n\t\t\tans++;\t\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,36,532
1279056205467541504,2a9d735ba9687ca747a904130698ba07c3bee1e7cd8d7d8a85b0bb4150c7e1af,2020-07-03 22:15:37,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <sstream>\nusing namespace std;\nint N, S; // N (1 <= N <= 15) S (0 < S < 10000)\n\nbool IsHuiwen(int s) {\n\tint b = 0;\n\tfor (int i = 2; i <=10; i++)\n\t{\n\t\tif (b == 2)\n\t\t\tbreak;\n\t\tint x = s;\n\t\tstring toBaseI;\n\t\tint j{ 0 };\n\t\twhile (x) {\n\t\t\tint temp = x % i;\n\t\t\t/*string res;\n\t\t\tstringstream ss;\n\t\t\tss << temp;\n\t\t\tss >> res;*/\n\t\t\ttoBaseI[j] = temp + '0' ;\n\t\t\tx /= i;\n\t\t\tj++;\n\t\t}\n\t\tint r{ 0 }, len=toBaseI.size();\n\t\twhile (toBaseI[r] == toBaseI[len - r - 1] && r <= (len - 1) / 2) {\n\t\t\tr++;\n\t\t}\n\t\tr--;\n\t\tif (r == (len - 1) / 2)\n\t\t\tb++;\n\t}\n\treturn (b == 2);\n}\nint main(){\n\tint i{ 0 };\n\tcin >> N >> S;\n\twhile (i < N) {\n\t\tS++;\n\t\tif (IsHuiwen(S)) {\n\t\t\tcout << S << endl;\n\t\t\tS++;\n\t\t}\n\t}\n}",TIME_LIMIT_EXCEEDED,0,0
1279056265458671616,a763dd36063572769ba5036db9769bf11eba30d56bc77c9b5c6ed5cf82d08e48,2020-07-03 22:15:52,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <string>\n\nusing namespace std;\nstring out1(int, int);\nbool test(int, int);         //  -'0'   6='6'-'0'\n\nint main()\n{\n\tint num, limit;\n\tcin >> num >> limit;\n\tvector<int> outc;\n\t//cout << num << limit;\n\tfor (int i = 0; i < num; i++)\n\t{\n\t\tfor (int j = limit + 1; j < 2147483674; limit++)\n\t\t{\n\t\t\tint flag = 0;\n\t\t\tint error = 0;\n\t\t\twhile (flag < 2 && error<8)\n\t\t\t{\n\t\t\t\tfor (int k = 2; k < 11; k++)\n\t\t\t\t{\n\t\t\t\t\tif (test(j, k))\n\t\t\t\t\t{\n\t\t\t\t\t\tflag++;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\terror++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (flag > 1)\n\t\t\t{\n\t\t\t\toutc.push_back(j);\n\t\t\t}\n\t\t\tflag = 0;\n\t\t}\n\t}\n\tfor (int i = 0; i < num; i++)\n\t{\n\t\tcout << outc[i] << endl;\n\t}\n\treturn 0;\n}\n\n\nstring out1(int x, int y)                               //将x以y进制输出\n{\n\tstring store = { '0','1','2','3','4','5','6','7','8','9'};//可以满足2-10进制的所有输出要求\n\tstring re = \""\"";\n\twhile (x != 0)\n\t{\n\t\tre = store[x % y] + re;\n\t\tx = x / y;\n\t}\n\treturn re;\n}\n\nbool test(int m, int n)      //是回文数返回一，否则返回零\n{\n\tstring store = { '0','1','2','3','4','5','6','7','8','9' };\n\tstring re = \""\"";\n\twhile (m != 0)\n\t{\n\t\tre = store[m % n] + re;\n\t\tm = m / n;\n\t}\n\tbool f = 1;                                      //判断是否为回文数\n\tfor (int z = 0; z < re.size() / 2; z++)            \n\t{\n\t\tif (re[z] != re[re.size() - 1 - z])\n\t\t{\n\t\t\tf = 0;\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn f;\n}\n",TIME_LIMIT_EXCEEDED,0,0
1279056420807311360,a763dd36063572769ba5036db9769bf11eba30d56bc77c9b5c6ed5cf82d08e48,2020-07-03 22:16:29,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <string>\n\nusing namespace std;\nstring out1(int, int);\nbool test(int, int);         //  -'0'   6='6'-'0'\n\nint main()\n{\n\tint num, limit;\n\tcin >> num >> limit;\n\tvector<int> outc;\n\t//cout << num << limit;\n\tfor (int i = 0; i < num; i++)\n\t{\n\t\tfor (int j = limit + 1; j < 9999999; limit++)\n\t\t{\n\t\t\tint flag = 0;\n\t\t\tint error = 0;\n\t\t\twhile (flag < 2 && error<8)\n\t\t\t{\n\t\t\t\tfor (int k = 2; k < 11; k++)\n\t\t\t\t{\n\t\t\t\t\tif (test(j, k))\n\t\t\t\t\t{\n\t\t\t\t\t\tflag++;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\terror++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (flag > 1)\n\t\t\t{\n\t\t\t\toutc.push_back(j);\n\t\t\t}\n\t\t\tflag = 0;\n\t\t}\n\t}\n\tfor (int i = 0; i < num; i++)\n\t{\n\t\tcout << outc[i] << endl;\n\t}\n\treturn 0;\n}\n\n\nstring out1(int x, int y)                               //将x以y进制输出\n{\n\tstring store = { '0','1','2','3','4','5','6','7','8','9'};//可以满足2-10进制的所有输出要求\n\tstring re = \""\"";\n\twhile (x != 0)\n\t{\n\t\tre = store[x % y] + re;\n\t\tx = x / y;\n\t}\n\treturn re;\n}\n\nbool test(int m, int n)      //是回文数返回一，否则返回零\n{\n\tstring store = { '0','1','2','3','4','5','6','7','8','9' };\n\tstring re = \""\"";\n\twhile (m != 0)\n\t{\n\t\tre = store[m % n] + re;\n\t\tm = m / n;\n\t}\n\tbool f = 1;                                      //判断是否为回文数\n\tfor (int z = 0; z < re.size() / 2; z++)            \n\t{\n\t\tif (re[z] != re[re.size() - 1 - z])\n\t\t{\n\t\t\tf = 0;\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn f;\n}\n",TIME_LIMIT_EXCEEDED,0,0
1279057606377660416,2a9d735ba9687ca747a904130698ba07c3bee1e7cd8d7d8a85b0bb4150c7e1af,2020-07-03 22:21:11,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <sstream>\nusing namespace std;\nint N, S; // N (1 <= N <= 15) S (0 < S < 10000)\n\nbool IsHuiwen(int s) {\n\tint b = 0;\n\tfor (int i = 2; i <=10; i++)\n\t{\n\t\tif (b == 2)\n\t\t\tbreak;\n\t\tint x = s;\n\t\tlong long toBaseI{ 0 };\n\t\tint j{ 0 };\n\t\twhile (x) {\n\t\t\ttoBaseI += (x % i)*pow(10,j);\n\t\t\tx /= i;\n\t\t\tj++;\n\t\t}\n\t\tstringstream s;\n\t\tstring toBaseS;\n\t\ts << toBaseI;\n\t\ts >> toBaseS;\n\t\tint r{ 0 }, len=toBaseS.size();\n\t\twhile (toBaseS[r] == toBaseS[len - r - 1] && r <= (len - 1) / 2) {\n\t\t\tr++;\n\t\t}\n\t\tr--;\n\t\tif (r == (len - 1) / 2)\n\t\t\tb++;\n\t}\n\treturn (b == 2);\n}\nint main(){\n\tint i{ 0 };\n\tcin >> N >> S;\n\twhile (i < N) {\n\t\tS++;\n\t\tif (IsHuiwen(S)) {\n\t\t\tcout << S << endl;\n\t\t\ti++;\n\t\t}\n\t}\n}",COMPILE_ERROR,0,0
1279057716692058112,2a9d735ba9687ca747a904130698ba07c3bee1e7cd8d7d8a85b0bb4150c7e1af,2020-07-03 22:21:38,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <sstream>\n#include<cmath>\nusing namespace std;\nint N, S; // N (1 <= N <= 15) S (0 < S < 10000)\n\nbool IsHuiwen(int s) {\n\tint b = 0;\n\tfor (int i = 2; i <=10; i++)\n\t{\n\t\tif (b == 2)\n\t\t\tbreak;\n\t\tint x = s;\n\t\tlong long toBaseI{ 0 };\n\t\tint j{ 0 };\n\t\twhile (x) {\n\t\t\ttoBaseI += (x % i)*pow(10,j);\n\t\t\tx /= i;\n\t\t\tj++;\n\t\t}\n\t\tstringstream s;\n\t\tstring toBaseS;\n\t\ts << toBaseI;\n\t\ts >> toBaseS;\n\t\tint r{ 0 }, len=toBaseS.size();\n\t\twhile (toBaseS[r] == toBaseS[len - r - 1] && r <= (len - 1) / 2) {\n\t\t\tr++;\n\t\t}\n\t\tr--;\n\t\tif (r == (len - 1) / 2)\n\t\t\tb++;\n\t}\n\treturn (b == 2);\n}\nint main(){\n\tint i{ 0 };\n\tcin >> N >> S;\n\twhile (i < N) {\n\t\tS++;\n\t\tif (IsHuiwen(S)) {\n\t\t\tcout << S << endl;\n\t\t\ti++;\n\t\t}\n\t}\n}",ACCEPTED,82,552
1279057887224070144,a763dd36063572769ba5036db9769bf11eba30d56bc77c9b5c6ed5cf82d08e48,2020-07-03 22:22:18,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <string>\n\nusing namespace std;\nstring out1(int, int);\nbool test(int, int);         //  -'0'   6='6'-'0'\n\nint main()\n{\n\tint num, limit;\n\tcin >> num >> limit;\n\tvector<int> outc;\n\t//cout << num << limit;\n\t\t\n\tfor (int j = limit + 1; outc.size() < num + 1; limit++)\n\t{\n\t\tint flag = 0;\n\t\tint error = 0;\n\t\twhile (flag < 2 && error < 8)\n\t\t{\n\t\t\tfor (int k = 2; k < 11; k++)\n\t\t\t{\n\t\t\t\tif (test(j, k))\n\t\t\t\t{\n\t\t\t\t\tflag++;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\terror++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (flag > 1)\n\t\t{\n\t\t\toutc.push_back(j);\n\t\t}\n\t\tflag = 0;\n\t}\n\n\tfor (int i = 0; i < num; i++)\n\t{\n\t\tcout << outc[i] << endl;\n\t}\n\treturn 0;\n}\n\n\nstring out1(int x, int y)                               //将x以y进制输出\n{\n\tstring store = { '0','1','2','3','4','5','6','7','8','9'};//可以满足2-10进制的所有输出要求\n\tstring re = \""\"";\n\twhile (x != 0)\n\t{\n\t\tre = store[x % y] + re;\n\t\tx = x / y;\n\t}\n\treturn re;\n}\n\nbool test(int m, int n)      //是回文数返回一，否则返回零\n{\n\tstring store = { '0','1','2','3','4','5','6','7','8','9' };\n\tstring re = \""\"";\n\twhile (m != 0)\n\t{\n\t\tre = store[m % n] + re;\n\t\tm = m / n;\n\t}\n\tbool f = 1;                                      //判断是否为回文数\n\tfor (int z = 0; z < re.size() / 2; z++)            \n\t{\n\t\tif (re[z] != re[re.size() - 1 - z])\n\t\t{\n\t\t\tf = 0;\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn f;\n}\n",MULTIPLE_ERROR,10,424
1279058436195540992,a763dd36063572769ba5036db9769bf11eba30d56bc77c9b5c6ed5cf82d08e48,2020-07-03 22:24:29,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <string>\n\nusing namespace std;\nstring out1(int, int);\nbool test(int, int);         //  -'0'   6='6'-'0'\n\nint main()\n{\n\tint num, limit;\n\tcin >> num >> limit;\n\tvector<int> outc;\n\t//cout << num << limit;\n\tint flag = 0;\n\tint error = 0;\n\tfor (int j = limit + 1; outc.size() < num + 1; j++)\n\t{\n\t\twhile (flag < 2 && error < 8)\n\t\t{\n\t\t\tfor (int k = 2; k < 11; k++)\n\t\t\t{\n\t\t\t\tif (test(j, k))\n\t\t\t\t{\n\t\t\t\t\tflag++;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\terror++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (flag > 1)\n\t\t{\n\t\t\toutc.push_back(j);\n\t\t}\n\t\tflag = 0;\n\t\terror = 0;\n\t}\n\n\tfor (int i = 0; i < num; i++)\n\t{\n\t\tcout << outc[i] << endl;\n\t}\n\treturn 0;\n}\n\n\nstring out1(int x, int y)                               //将x以y进制输出\n{\n\tstring store = { '0','1','2','3','4','5','6','7','8','9'};//可以满足2-10进制的所有输出要求\n\tstring re = \""\"";\n\twhile (x != 0)\n\t{\n\t\tre = store[x % y] + re;\n\t\tx = x / y;\n\t}\n\treturn re;\n}\n\nbool test(int m, int n)      //是回文数返回一，否则返回零\n{\n\tstring store = { '0','1','2','3','4','5','6','7','8','9' };\n\tstring re = \""\"";\n\twhile (m != 0)\n\t{\n\t\tre = store[m % n] + re;\n\t\tm = m / n;\n\t}\n\tbool f = 1;                                      //判断是否为回文数\n\tfor (int z = 0; z < re.size() / 2; z++)            \n\t{\n\t\tif (re[z] != re[re.size() - 1 - z])\n\t\t{\n\t\t\tf = 0;\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn f;\n}\n",ACCEPTED,41,512
1279080255149506560,8d418e97079b1446d46d1a9480943f8e522168ae5c37e784dde26739102d2a1a,2020-07-03 23:51:11,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"//双重回文数\n#include <iostream>\n#include <vector>\nusing std::cin;\nusing std::cout;\nusing std::endl;\nstd::vector<int> a(10000);  //存储满足的十进制数\nint account0 = 0;   //记填入a[]的位置\nint arr[100];   //存储转换后的进制数\nint account = 0;    //记录填入arr[]的位置\n\nvoid change(int m, int n);  //进制转换，m为十进制数，n为要转换的进制\nbool judge();   //判断是否回文\nint main()\n{\n    int N, S;       //前N个满足大于S且在两种以上进制（二进制到十进制）上是回文数的十进制数\n    cin >> N >> S;  //1 <= N <= 15, 0 < S < 10000。\n\n    int ascii;  //进制\n    int number = 0; //记录满足大于S且在两种以上进制上是回文数的十进制数的个数\n    int ascii_num = 0;  //记录满足的进制的个数\n    for (int i = S + 1; i < 10000; i++)\n    {\n        for (ascii = 2; ascii < 11; ascii++)\n        {\n            change(i, ascii);\n            if (judge())\n            {\n                ascii_num++;\n            }\n        }\n        if (ascii_num >= 2)\n        {\n            number++;\n            a[account0] = i;\n            account0++;\n        }\n        if (number == N)\n            break;\n    }\n\n    for (int j = 0; j < account0; j++)\n        cout << a[j] << endl;\n}\n\nvoid change(int m, int n)\n{\n    while (m)\n    {\n        arr[account] = m % n;\n        m = m / n;\n        account++;\n    }\n}\n\nbool judge()\n{\n    for (int i = 0; i < account; i++)\n    {\n        if (arr[i] != arr[account - 1 - i])\n            return false;\n    }\n    return true;\n}\n",SEGMENTATION_FAULT,35,496
1279083334221627392,8d418e97079b1446d46d1a9480943f8e522168ae5c37e784dde26739102d2a1a,2020-07-04 00:03:25,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"//双重回文数\n#include <iostream>\n#include <vector>\nusing std::cin;\nusing std::cout;\nusing std::endl;\nstd::vector<int> a;  //存储满足的十进制数\nint arr[100];   //存储转换后的进制数\nint account = 0;    //记录填入arr[]的位置\n\nvoid change(int m, int n);  //进制转换，m为十进制数，n为要转换的进制\nbool judge();   //判断是否回文\nint main()\n{\n    int N, S;       //前N个满足大于S且在两种以上进制（二进制到十进制）上是回文数的十进制数\n    cin >> N >> S;  //1 <= N <= 15, 0 < S < 10000。\n\n    int ascii;  //进制\n    int number = 0; //记录满足大于S且在两种以上进制上是回文数的十进制数的个数\n    int ascii_num = 0;  //记录满足的进制的个数\n    for (int i = S + 1; i < 10000; i++)\n    {\n        for (ascii = 2; ascii < 11; ascii++)\n        {\n            change(i, ascii);\n            if (judge())\n            {\n                ascii_num++;\n            }\n        }\n        if (ascii_num >= 2)\n        {\n            number++;\n            a.push_back(i);\n        }\n        account = 0;\n        ascii_num = 0;\n        if (number == N)\n        {\n            number = 0;\n            break;\n        }\n    }\n\n    for (int j = 0; j < N; j++)\n        cout << a[j] << endl;\n}\n\nvoid change(int m, int n)\n{\n    while (m)\n    {\n        arr[account] = m % n;\n        m = m / n;\n        account++;\n    }\n}\n\nbool judge()\n{\n    for (int i = 0; i < account; i++)\n    {\n        if (arr[i] != arr[account - 1 - i])\n            return false;\n    }\n    return true;\n}\n",MULTIPLE_ERROR,50,424
1279086202081181696,8d418e97079b1446d46d1a9480943f8e522168ae5c37e784dde26739102d2a1a,2020-07-04 00:14:49,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"//双重回文数\n#include <iostream>\n#include <vector>\nusing std::cin;\nusing std::cout;\nusing std::endl;\nint arr[100];   //存储转换后的进制数\nint account = 0;    //记录填入arr[]的位置\n\nvoid change(int m, int n);  //进制转换，m为十进制数，n为要转换的进制\nbool judge();   //判断是否回文\nint main()\n{\n    int N, S;       //前N个满足大于S且在两种以上进制（二进制到十进制）上是回文数的十进制数\n    cin >> N >> S;  //1 <= N <= 15, 0 < S < 10000。\n    std::vector<int> a;  //存储满足的十进制数\n\n    int ascii;  //进制\n    int number = 0; //记录满足大于S且在两种以上进制上是回文数的十进制数的个数\n    int ascii_num = 0;  //记录满足的进制的个数\n    for (int i = S + 1; i < 10000; i++)\n    {\n        for (ascii = 2; ascii < 11; ascii++)\n        {\n            change(i, ascii);\n            if (judge())\n            {\n                ascii_num++;\n            }\n        }\n        if (ascii_num >= 2)\n        {\n            number++;\n            a.push_back(i);\n        }\n        account = 0;\n        ascii_num = 0;\n        if (number == N)\n        {\n            number = 0;\n            break;\n        }\n    }\n\n    for (int j = 0; j < N; j++)\n        cout << a[j] << endl;\n}\n\nvoid change(int m, int n)\n{\n    while (m)\n    {\n        arr[account] = m % n;\n        m = m / n;\n        account++;\n    }\n}\n\nbool judge()\n{\n    for (int i = 0; i < account; i++)\n    {\n        if (arr[i] != arr[account - 1 - i])\n            return false;\n    }\n    return true;\n}\n",MULTIPLE_ERROR,54,424
1279090966944735232,8d418e97079b1446d46d1a9480943f8e522168ae5c37e784dde26739102d2a1a,2020-07-04 00:33:45,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"//双重回文数\n#include <iostream>\n#include <vector>\nusing std::cin;\nusing std::cout;\nusing std::endl;\n//std::vector<int> a;  //存储满足的十进制数\nint arr[100];   //存储转换后的进制数\nint account = 0;    //记录填入arr[]的位置\n\nvoid change(int m, int n);  //进制转换，m为十进制数，n为要转换的进制\nbool judge();   //判断是否回文\nint main()\n{\n    int N, S;       //前N个满足大于S且在两种以上进制（二进制到十进制）上是回文数的十进制数\n    cin >> N >> S;  //1 <= N <= 15, 0 < S < 10000。\n\n    int ascii;  //进制\n    //int number = 0; //记录满足大于S且在两种以上进制上是回文数的十进制数的个数\n    //int ascii_num = 0;  //记录满足的进制的个数\n    for (int i = S + 1; i < 10000; i++)\n    {\n        int number = 0; //记录满足大于S且在两种以上进制上是回文数的十进制数的个数\n        int ascii_num = 0;  //记录满足的进制的个数\n        for (ascii = 2; ascii < 11; ascii++)\n        {\n            change(i, ascii);\n            if (judge())\n            {\n                ascii_num++;\n            }\n        }\n        if (ascii_num >= 2)\n        {\n            number++;\n            //a.push_back(i);\n            cout << i << endl;\n        }\n        if (number == N)\n        {\n            \n            break;\n        }\n    }\n\n    \n}\n\nvoid change(int m, int n)\n{\n    while (m)\n    {\n        arr[account] = m % n;\n        m = m / n;\n        account++;\n    }\n}\n\nbool judge()\n{\n    for (int i = 0; i < account; i++)\n    {\n        if (arr[i] != arr[account - 1 - i])\n            return false;\n    }\n    return true;\n}\n",SEGMENTATION_FAULT,34,424
1279094045333184512,224d4c282a1e1c6857aac5eadbe43fa1af19a641fe4d4ce4ce3eb083a2f2646d,2020-07-04 00:45:59,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"include<stdio.h>\n \nchar c[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nint n;\nint fun(int num)\n{\n    num*=num;\n    char a[1000];\n    int i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    int flag=1;\n    for(int j=1;j<=i/2;j++)\n    {\n        if(a[j]!=a[i-j+1])\n        {\n            flag=0;\n            break;\n        }\n    }\n    return flag;\n}\n \nvoid print(int num)\n{\n    int temp=num;\n    char a[1000];\n    int i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    for(i;i>=1;i--)\n        printf(\""%c\"",a[i]);\n    printf(\"" \"");\n    num=temp*temp;\n    i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    for(i;i>=1;i--)\n        printf(\""%c\"",a[i]);\n    printf(\""\\n\"");\n}\n \nint main()\n{\n    while(~scanf(\""%d\"",&n))\n    {\n        for(int i=1;i<=300;i++)\n        {\n            if(fun(i)==1)\n                print(i);\n        }\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1279094137071001600,224d4c282a1e1c6857aac5eadbe43fa1af19a641fe4d4ce4ce3eb083a2f2646d,2020-07-04 00:46:21,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"include<stdio.h>\n char c[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nint n;\nint fun(int num)\n{\n    num*=num;\n    char a[1000];\n    int i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    int flag=1;\n    for(int j=1;j<=i/2;j++)\n    {\n        if(a[j]!=a[i-j+1])\n        {\n            flag=0;\n            break;\n        }\n    }\n    return flag;\n}\n \nvoid print(int num)\n{\n    int temp=num;\n    char a[1000];\n    int i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    for(i;i>=1;i--)\n        printf(\""%c\"",a[i]);\n    printf(\"" \"");\n    num=temp*temp;\n    i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    for(i;i>=1;i--)\n        printf(\""%c\"",a[i]);\n    printf(\""\\n\"");\n}\n \nint main()\n{\n    while(~scanf(\""%d\"",&n))\n    {\n        for(int i=1;i<=300;i++)\n        {\n            if(fun(i)==1)\n                print(i);\n        }\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1279094549018771456,224d4c282a1e1c6857aac5eadbe43fa1af19a641fe4d4ce4ce3eb083a2f2646d,2020-07-04 00:47:59,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"include <iostream>\n#include <cstdio>\n#include <algorithm>\n#include <cmath>\n#include <cstring>\nusing namespace std;\ntypedef long long ll;\nchar aa[100];\nchar bb[100];\nll yang2()\n{\n    ll n=strlen(aa);\n    ll i,ans=0;\n    for(i=0;i<n/2;i++)\n    {\n        if(aa[i]==aa[n-i-1])\n            ans++;\n    }\n    if(ans>=n/2)\n        return 1;\n    else\n        return 0;\n}\nll yang(ll n,ll a)\n{\n    ll m;\n    memset(aa,0,sizeof(aa));\n    ll i=0;\n    while(n)\n    {\n        if(n%a>=10)\n            aa[i]=char('A'+(n%a-10));\n        else\n           aa[i]=n%a+48;\n        n/=a;\n        i++;\n    }\n    aa[i]=0;\n    ll ans=yang2();\n    if(ans==1)\n        return 1;\n    else\n        return 0;\n}\nll yang4()\n{\n    ll n=strlen(bb);\n    ll i;\n    char t;\n    for(i=0;i<n/2;i++)\n    {\n        t=bb[i];\n        bb[i]=bb[n-i-1];\n        bb[n-i-1]=t;\n    }\n}\nll yang3(ll n,ll a)\n{\n    ll m;\n    memset(bb,0,sizeof(bb));\n    ll i=0;\n    while(n)\n    {\n        if(n%a>=10)\n            bb[i]=char('A'+(n%a-10));\n        else\n           bb[i]=n%a+48;\n        n/=a;\n        i++;\n    }\n    bb[i]=0;\n    yang4();\n}\nint main()\n{\n    ll n,i,j,b;\n    cin>>b;\n    for(i=1;i<=300;i++)\n    {\n        ll ans=yang(i*i,b);\n        if(ans==1)\n        {\n            yang3(i,b);\n            cout<<bb<<\"" \""<<aa<<endl;\n        }\n \n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1279094843920277504,224d4c282a1e1c6857aac5eadbe43fa1af19a641fe4d4ce4ce3eb083a2f2646d,2020-07-04 00:49:09,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<cmath>\n#include<queue>\n#include<cstdio>\n#include<cctype>\n#include<vector>\n#include<cstring>\n#include<iostream>\n#include<algorithm>\nusing namespace std;\nint n,s;\nvector<int>a;\nbool jud(int x,int i)//判断x的i进制是不是回文数\n{\n    a.clear();\n    do\n    {\n        a.push_back(x%i);\n        x/=i;\n    }while(x);\n    for(int i=0,j=a.size()-1;i<j;i++,j--)\n        if(a[i]!=a[j])\n            return 0;\n    return 1;\n}\nbool calc(int x)//判断x是不是双重回文数\n{\n    int cnt=0;\n    for(int i=2;i<=10;i++)\n    {\n        if(jud(x,i))\n        {\n            cnt++;\n            if(cnt>=2)\n                return 1;\n        }\n    }\n    return 0;\n}\nint main()\n{\n    //freopen(\""in.txt\"",\""r\"",stdin);\n    //freopen(\""USACO1.2.5附带打表.txt\"",\""w\"",stdout);\n    scanf(\""%d%d\"",&n,&s);\n    for(int i=s+1;n;i++)\n    {\n        if(calc(i))\n        {\n            cout<<i<<endl;\n            n--;\n        }\n    }\n    return 0;\n}",ACCEPTED,38,512
1279104079140159488,bcb3ff810e5a0484ae0550949ab982695da1f921da2e0407850a5ce7faddd0d1,2020-07-04 01:25:51,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"using namespace std;\nint n;\nint s[301];\nvoid jz(int a,int b)//转换进制 \n{\n    int r=0;\n    while(a){\n        s[++r]=a%b;\n        a/=b;\n    }\n    s[0]=r;\n}",COMPILE_ERROR,0,0
1279104201160843264,bcb3ff810e5a0484ae0550949ab982695da1f921da2e0407850a5ce7faddd0d1,2020-07-04 01:26:20,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"using namespace std;\nint n;\nint s[301];\nvoid jz(int a,int b)//转换进制 \n{\n    int r=0;\n    while(a){\n        s[++r]=a%b;\n        a/=b;\n    }\n    s[0]=r;\n    cout<<s;\n}",COMPILE_ERROR,0,0
1279104378789617664,bcb3ff810e5a0484ae0550949ab982695da1f921da2e0407850a5ce7faddd0d1,2020-07-04 01:27:03,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"using namespace std;\nint n;\nint s[301];\nint main()//转换进制 \n{\n    int r,a,b;\n    while(a){\n        s[++r]=a%b;\n        a/=b;\n    }\n    s[0]=r;\n    cout<<s;\n}",COMPILE_ERROR,0,0
1279104521106546688,bcb3ff810e5a0484ae0550949ab982695da1f921da2e0407850a5ce7faddd0d1,2020-07-04 01:27:37,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"include<bits/stdc++.h>\nusing namespace std;\nint n;\nint s[301];\nint main()//转换进制 \n{\n    int r,a,b;\n    while(a){\n        s[++r]=a%b;\n        a/=b;\n    }\n    s[0]=r;\n    cout<<s;\n}",COMPILE_ERROR,0,0
1279104584989999104,bcb3ff810e5a0484ae0550949ab982695da1f921da2e0407850a5ce7faddd0d1,2020-07-04 01:27:52,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint n;\nint s[301];\nint main()//转换进制 \n{\n    int r,a,b;\n    while(a){\n        s[++r]=a%b;\n        a/=b;\n    }\n    s[0]=r;\n    cout<<s;\n}",FLOAT_POINT_EXCEPTION,31,512
1279202026167132160,c5f006269b926e61241c8f09728f8ca99c23da829b64fc3aefb604777dcc38c7,2020-07-04 07:55:04,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,#include<iostream>\nusing namespace std;\nint main()\n{\n    int N;\n    int S;\n    int ns[1000000];\n    int index;\n    int can;\n    int lenght;\n    bool IsHui;\n    int count;\n    int countshu = 0;\n    int counthui = 0;\n    cin >> N;\n    cin >> S;\n    while(true)\n    {\n        S++;\n        can = S;\n        for(int i = 2; i <= 10; i++)\n        {\n            ns[index] = can%i;\n            index++;\n            can = can/i;\n            while(can != 0)\n            {\n                ns[index] = can%i;\n                index++;\n                can = can/i;\n            }\n            lenght = index;\n            index = 0;\n            if(lenght == 1){countshu++;}\n            else\n            {\n                for(int j = 0; j < lenght/2; j++)\n                {\n                    if(ns[j] == ns[lenght-1-j]){count++;continue;}\n                    else{break;}\n                }  \n            }\n            IsHui = (count == index);\n            count = 0;\n            if(IsHui){countshu++;}\n        }\n        if(countshu >= 2){cout << S << endl;counthui++;}\n        if(counthui == 3){break;}\n    }\n    return 0;\n},WRONG_ANSWER,29,424
1279202370582405120,c5f006269b926e61241c8f09728f8ca99c23da829b64fc3aefb604777dcc38c7,2020-07-04 07:56:26,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,#include<iostream>\nusing namespace std;\nint main()\n{\n    int N;\n    int S;\n    int ns[16];\n    int index;\n    int can;\n    int lenght;\n    bool IsHui;\n    int count;\n    int countshu = 0;\n    int counthui = 0;\n    cin >> N;\n    cin >> S;\n    while(true)\n    {\n        S++;\n        can = S;\n        for(int i = 2; i <= 10; i++)\n        {\n            ns[index] = can%i;\n            index++;\n            can = can/i;\n            while(can != 0)\n            {\n                ns[index] = can%i;\n                index++;\n                can = can/i;\n            }\n            lenght = index;\n            index = 0;\n            if(lenght == 1){countshu++;}\n            else\n            {\n                for(int j = 0; j < lenght/2; j++)\n                {\n                    if(ns[j] == ns[lenght-1-j]){count++;continue;}\n                    else{break;}\n                }  \n            }\n            IsHui = (count == index);\n            count = 0;\n            if(IsHui){countshu++;}\n        }\n        if(countshu >= 2){cout << S << endl;counthui++;}\n        if(counthui == 3){break;}\n    }\n    return 0;\n},WRONG_ANSWER,30,512
1279202444481855488,c5f006269b926e61241c8f09728f8ca99c23da829b64fc3aefb604777dcc38c7,2020-07-04 07:56:43,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,#include<iostream>\nusing namespace std;\nint main()\n{\n    int N;\n    int S;\n    int ns[1000000];\n    int index;\n    int can;\n    int lenght;\n    bool IsHui;\n    int count;\n    int countshu = 0;\n    int counthui = 0;\n    cin >> N;\n    cin >> S;\n    while(true)\n    {\n        S++;\n        can = S;\n        for(int i = 2; i <= 10; i++)\n        {\n            ns[index] = can%i;\n            index++;\n            can = can/i;\n            while(can != 0)\n            {\n                ns[index] = can%i;\n                index++;\n                can = can/i;\n            }\n            lenght = index;\n            index = 0;\n            if(lenght == 1){countshu++;}\n            else\n            {\n                for(int j = 0; j < lenght/2; j++)\n                {\n                    if(ns[j] == ns[lenght-1-j]){count++;continue;}\n                    else{break;}\n                }  \n            }\n            IsHui = (count == index);\n            count = 0;\n            if(IsHui){countshu++;}\n        }\n        if(countshu >= 2){cout << S << endl;counthui++;}\n        if(counthui == 3){break;}\n    }\n    return 0;\n},WRONG_ANSWER,30,512
1279230628132749312,00f4fee551df8c2a2d26b8f89acb2489dbd60fc1c678c81d2c25c5f1b599b2a6,2020-07-04 09:48:43,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nint B;\nint a[300];\nbool Hui(int x)\n{\n    int n=0;\n    x=x*x;\n    while (x)\n    {\n        a[++n]=x%B;\n        x=x/B;\n    }\n    for (int i = 1,j=n; i < j; i++,j--)\n    {\n        if (a[i]!=a[j])\n        {\n            return 0;\n        }\n    }\n    return 1;\n}\nvoid Jin(int x)\n{\n    int n=0;\n    while (x)\n    {\n        a[++n]=x%B;\n        x=x/B;\n    }\n    for (int i = n; i >0; i--)\n    {\n        if (a[i]>9)\n        {\n            printf(\""%c\"",a[i]-10+'A');\n        }\n        else\n        {\n            cout<<a[i];\n        }\n        \n    }\n\n}\nint main()\n{\n    cin>>B;\n    for (int a = 1; a < 301; a++)\n    {\n        if (Hui(a))\n        {\n            Jin(a);\n            cout<<\"" \"";\n            Jin(a*a);\n            cout<<endl;\n        }\n        \n    }\n    \n}",ACCEPTED,41,512
1279249696017539072,29daffe59a777a5f09eff003bd9b3955e01a20723de72b8e68bb19eb33650dbc,2020-07-04 11:04:29,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstdlib>\n#include<string>\nusing namespace std;\nint main()\n{\n\tchar str1[301][100];\n\tchar str2[301][100];\n\tint n;\n\tcin >> n;\n\tfor (int i = 1; i < 301; i++)\n\t{\n\t\tbool rec = true;\n\t\t_itoa_s(i, str1[i - 1],100, n);\n\t\t_itoa_s(i * i, str2[i - 1],100, n);\n\t\tint m=strlen(str2[i - 1]);\n\t\tfor (int j = 0; j < m; j++)\n\t\t{\n\t\t\tif (str2[i-1][j] != str2[i-1][m - 1 - j])\n\t\t\t{\n\t\t\t\trec = false;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t}\n\t\tif (rec)\n\t\t{\n\t\t\tcout << str1[i-1] << \"" \"" << str2[i-1] << endl;\n\t\t}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1279249761503207424,29daffe59a777a5f09eff003bd9b3955e01a20723de72b8e68bb19eb33650dbc,2020-07-04 11:04:45,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstdlib>\n#include<string>\nusing namespace std;\nint main()\n{\n\tchar str1[301][100];\n\tchar str2[301][100];\n\tint n;\n\tcin >> n;\n\tfor (int i = 1; i < 301; i++)\n\t{\n\t\tbool rec = true;\n\t\t_itoa_s(i, str1[i - 1],100, n);\n\t\t_itoa_s(i * i, str2[i - 1],100, n);\n\t\tint m=strlen(str2[i - 1]);\n\t\tfor (int j = 0; j < m; j++)\n\t\t{\n\t\t\tif (str2[i-1][j] != str2[i-1][m - 1 - j])\n\t\t\t{\n\t\t\t\trec = false;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t}\n\t\tif (rec)\n\t\t{\n\t\t\tcout << str1[i-1] << \"" \"" << str2[i-1] << endl;\n\t\t}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1279249840662315008,29daffe59a777a5f09eff003bd9b3955e01a20723de72b8e68bb19eb33650dbc,2020-07-04 11:05:03,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstdlib>\n#include<string>\nusing namespace std;\nint main()\n{\n\tchar str1[301][100];\n\tchar str2[301][100];\n\tint n;\n\tcin >> n;\n\tfor (int i = 1; i < 301; i++)\n\t{\n\t\tbool rec = true;\n\t\t_itoa_s(i, str1[i - 1],100, n);\n\t\t_itoa_s(i * i, str2[i - 1],100, n);\n\t\tint m=strlen(str2[i - 1]);\n\t\tfor (int j = 0; j < m; j++)\n\t\t{\n\t\t\tif (str2[i-1][j] != str2[i-1][m - 1 - j])\n\t\t\t{\n\t\t\t\trec = false;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t}\n\t\tif (rec)\n\t\t{\n\t\t\tcout << str1[i-1] << \"" \"" << str2[i-1] << endl;\n\t\t}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1279250389851889664,459ce662b14bafd9f391c359c54aa17e63014ceaede44a8bee3262a42b80fe2f,2020-07-04 11:07:14,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nint t1[100];\nchar t2[100];\nint h = 0;\nvoid trans(int n,int x)\n{\n\th = 0;\n\tint i;\n\tfor ( i = 0; x; i++)\n\t{\n\t\t\n\t\tt1[i] = x%n;\n\t\tx = x / n;\n\t\th++;\n\t}\n\t\n}\nvoid tranc()\n{\n\tint i,h2=h-1;\n\tfor ( i = 0; i <h; i++)\n\t{\n\t\t\n\t\tif (t1[i]<10)\n\t\t{\n\t\t\tt2[h2] = char(t1[i]+'0');\n\t\t}\n\t\telse\n\t\t{\n\t\t\tt2[h2] = char(t1[i] + 'A'-10);\n\t\t}\n\t\th2--;\n\t}\n}\nbool r()\n{\n\tint i,h3=h;\n\tfor ( i = 0; i < h3; i++)\n\t{\n\t\tif (t2[i]!=t2[h3-1])\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\th3--;\n\t}\n\treturn true;\n}\nint main()\n{\n\tint n,i,j,flag=0,h,s,numbers=0;\n\tcin >> h;\n\tcin >> s;\n\tfor ( i = s;  ; i++)\n\t{\n\t\tflag = 0;\n\t\tfor ( n <= 2; n <=10; n++)\n\t\t{\n\t\t\ttrans(n, i);\n\t\t\ttranc();\n\t\t\tif (r())\n\t\t\t{\n\t\t\t\tflag++;\n\t\t\t}\n\t\t\tif (flag==2)\n\t\t\t{\n\t\t\t\tfor ( j = 0; j < n; j++)\n\t\t\t\t{\n\t\t\t\t\tcout << t2[j]<<endl;\n\t\t\t\t}\n\t\t\t\tnumbers++;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t}\n\t\tif (numbers==h)\n\t\t{\n\t\t\tbreak;\n\t\t}\n\t\t\n\t}\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,0,0
1279250690747072512,29daffe59a777a5f09eff003bd9b3955e01a20723de72b8e68bb19eb33650dbc,2020-07-04 11:08:26,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstdlib>\n#include<string.h>\nusing namespace std;\nint main()\n{\n\tchar str1[301][100];\n\tchar str2[301][100];\n\tint n;\n\tcin >> n;\n\tfor (int i = 1; i < 301; i++)\n\t{\n\t\tbool rec = true;\n\t\t_itoa_s(i, str1[i - 1],100, n);\n\t\t_itoa_s(i * i, str2[i - 1],100, n);\n\t\tint m=strlen(str2[i - 1]);\n\t\tfor (int j = 0; j < m; j++)\n\t\t{\n\t\t\tif (str2[i-1][j] != str2[i-1][m - 1 - j])\n\t\t\t{\n\t\t\t\trec = false;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t}\n\t\tif (rec)\n\t\t{\n\t\t\tcout << str1[i-1] << \"" \"" << str2[i-1] << endl;\n\t\t}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1279250746405478400,29daffe59a777a5f09eff003bd9b3955e01a20723de72b8e68bb19eb33650dbc,2020-07-04 11:08:39,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstdlib>\n#include<string.h>\nusing namespace std;\nint main()\n{\n\tchar str1[301][100];\n\tchar str2[301][100];\n\tint n;\n\tcin >> n;\n\tfor (int i = 1; i < 301; i++)\n\t{\n\t\tbool rec = true;\n\t\t_itoa_s(i, str1[i - 1],100, n);\n\t\t_itoa_s(i * i, str2[i - 1],100, n);\n\t\tint m=strlen(str2[i - 1]);\n\t\tfor (int j = 0; j < m; j++)\n\t\t{\n\t\t\tif (str2[i-1][j] != str2[i-1][m - 1 - j])\n\t\t\t{\n\t\t\t\trec = false;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t}\n\t\tif (rec)\n\t\t{\n\t\t\tcout << str1[i-1] << \"" \"" << str2[i-1] << endl;\n\t\t}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1279250800260349952,29daffe59a777a5f09eff003bd9b3955e01a20723de72b8e68bb19eb33650dbc,2020-07-04 11:08:52,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstdlib>\n#include<string.h>\nusing namespace std;\nint main()\n{\n\tchar str1[301][100];\n\tchar str2[301][100];\n\tint n;\n\tcin >> n;\n\tfor (int i = 1; i < 301; i++)\n\t{\n\t\tbool rec = true;\n\t\t_itoa_s(i, str1[i - 1],100, n);\n\t\t_itoa_s(i * i, str2[i - 1],100, n);\n\t\tint m=strlen(str2[i - 1]);\n\t\tfor (int j = 0; j < m; j++)\n\t\t{\n\t\t\tif (str2[i-1][j] != str2[i-1][m - 1 - j])\n\t\t\t{\n\t\t\t\trec = false;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t}\n\t\tif (rec)\n\t\t{\n\t\t\tcout << str1[i-1] << \"" \"" << str2[i-1] << endl;\n\t\t}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1279250845047128064,29daffe59a777a5f09eff003bd9b3955e01a20723de72b8e68bb19eb33650dbc,2020-07-04 11:09:03,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstdlib>\n#include<string.h>\nusing namespace std;\nint main()\n{\n\tchar str1[301][100];\n\tchar str2[301][100];\n\tint n;\n\tcin >> n;\n\tfor (int i = 1; i < 301; i++)\n\t{\n\t\tbool rec = true;\n\t\t_itoa_s(i, str1[i - 1],100, n);\n\t\t_itoa_s(i * i, str2[i - 1],100, n);\n\t\tint m=strlen(str2[i - 1]);\n\t\tfor (int j = 0; j < m; j++)\n\t\t{\n\t\t\tif (str2[i-1][j] != str2[i-1][m - 1 - j])\n\t\t\t{\n\t\t\t\trec = false;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t}\n\t\tif (rec)\n\t\t{\n\t\t\tcout << str1[i-1] << \"" \"" << str2[i-1] << endl;\n\t\t}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1279250896687398912,29daffe59a777a5f09eff003bd9b3955e01a20723de72b8e68bb19eb33650dbc,2020-07-04 11:09:15,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstdlib>\n#include<string.h>\nusing namespace std;\nint main()\n{\n\tchar str1[301][100];\n\tchar str2[301][100];\n\tint n;\n\tcin >> n;\n\tfor (int i = 1; i < 301; i++)\n\t{\n\t\tbool rec = true;\n\t\t_itoa_s(i, str1[i - 1],100, n);\n\t\t_itoa_s(i * i, str2[i - 1],100, n);\n\t\tint m=strlen(str2[i - 1]);\n\t\tfor (int j = 0; j < m; j++)\n\t\t{\n\t\t\tif (str2[i-1][j] != str2[i-1][m - 1 - j])\n\t\t\t{\n\t\t\t\trec = false;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t}\n\t\tif (rec)\n\t\t{\n\t\t\tcout << str1[i-1] << \"" \"" << str2[i-1] << endl;\n\t\t}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1279251295158861824,29daffe59a777a5f09eff003bd9b3955e01a20723de72b8e68bb19eb33650dbc,2020-07-04 11:10:50,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstdlib>\n#include<string.h>\nusing namespace std;\nint main()\n{\n\tchar str1[301][100];\n\tchar str2[301][100];\n\tint n;\n\tcin >> n;\n\tfor (int i = 1; i < 301; i++)\n\t{\n\t\tbool rec = true;\n\t\t_itoa_s(i, str1[i - 1],100, n);\n\t\t_itoa_s(i * i, str2[i - 1],100, n);\n\t\tint m=strlen(str2[i - 1]);\n\t\tfor (int j = 0; j < m; j++)\n\t\t{\n\t\t\tif (str2[i-1][j] != str2[i-1][m - 1 - j])\n\t\t\t{\n\t\t\t\trec = false;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t}\n\t\tif (rec)\n\t\t{\n\t\t\tcout << str1[i-1] << \"" \"" << str2[i-1] << endl;\n\t\t}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1279251373437149184,29daffe59a777a5f09eff003bd9b3955e01a20723de72b8e68bb19eb33650dbc,2020-07-04 11:11:09,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstdlib>\n#include<string.h>\nusing namespace std;\nint main()\n{\n\tchar str1[301][100];\n\tchar str2[301][100];\n\tint n;\n\tcin >> n;\n\tfor (int i = 1; i < 301; i++)\n\t{\n\t\tbool rec = true;\n\t\t_itoa_s(i, str1[i - 1],100, n);\n\t\t_itoa_s(i * i, str2[i - 1],100, n);\n\t\tint m=strlen(str2[i - 1]);\n\t\tfor (int j = 0; j < m; j++)\n\t\t{\n\t\t\tif (str2[i-1][j] != str2[i-1][m - 1 - j])\n\t\t\t{\n\t\t\t\trec = false;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t}\n\t\tif (rec)\n\t\t{\n\t\t\tcout << str1[i-1] << \"" \"" << str2[i-1] << endl;\n\t\t}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1279251774714601472,29daffe59a777a5f09eff003bd9b3955e01a20723de72b8e68bb19eb33650dbc,2020-07-04 11:12:45,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstdlib>\n#include<string.h>\nusing namespace std;\nint main()\n{\n\tchar str1[301][100];\n\tchar str2[301][100];\n\tint n;\n\tcin >> n;\n\tfor (int i = 1; i < 301; i++)\n\t{\n\t\tbool rec = true;\n\t\t_itoa(i, str1[i - 1], n);\n\t\t_itoa(i * i, str2[i - 1], n);\n\t\tint m=strlen(str2[i - 1]);\n\t\tfor (int j = 0; j < m; j++)\n\t\t{\n\t\t\tif (str2[i-1][j] != str2[i-1][m - 1 - j])\n\t\t\t{\n\t\t\t\trec = false;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t}\n\t\tif (rec)\n\t\t{\n\t\t\tcout << str1[i-1] << \"" \"" << str2[i-1] << endl;\n\t\t}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1279251867429699584,29daffe59a777a5f09eff003bd9b3955e01a20723de72b8e68bb19eb33650dbc,2020-07-04 11:13:07,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstdlib>\n#include<string.h>\nusing namespace std;\nint main()\n{\n\tchar str1[301][100];\n\tchar str2[301][100];\n\tint n;\n\tcin >> n;\n\tfor (int i = 1; i < 301; i++)\n\t{\n\t\tbool rec = true;\n\t\t_itoa(i, str1[i - 1], n);\n\t\t_itoa(i * i, str2[i - 1], n);\n\t\tint m=strlen(str2[i - 1]);\n\t\tfor (int j = 0; j < m; j++)\n\t\t{\n\t\t\tif (str2[i-1][j] != str2[i-1][m - 1 - j])\n\t\t\t{\n\t\t\t\trec = false;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t}\n\t\tif (rec)\n\t\t{\n\t\t\tcout << str1[i-1] << \"" \"" << str2[i-1] << endl;\n\t\t}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1279251908315766784,29daffe59a777a5f09eff003bd9b3955e01a20723de72b8e68bb19eb33650dbc,2020-07-04 11:13:16,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstdlib>\n#include<string.h>\nusing namespace std;\nint main()\n{\n\tchar str1[301][100];\n\tchar str2[301][100];\n\tint n;\n\tcin >> n;\n\tfor (int i = 1; i < 301; i++)\n\t{\n\t\tbool rec = true;\n\t\titoa(i, str1[i - 1], n);\n\t\titoa(i * i, str2[i - 1], n);\n\t\tint m=strlen(str2[i - 1]);\n\t\tfor (int j = 0; j < m; j++)\n\t\t{\n\t\t\tif (str2[i-1][j] != str2[i-1][m - 1 - j])\n\t\t\t{\n\t\t\t\trec = false;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t}\n\t\tif (rec)\n\t\t{\n\t\t\tcout << str1[i-1] << \"" \"" << str2[i-1] << endl;\n\t\t}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1279251947490566144,29daffe59a777a5f09eff003bd9b3955e01a20723de72b8e68bb19eb33650dbc,2020-07-04 11:13:26,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstdlib>\n#include<string.h>\nusing namespace std;\nint main()\n{\n\tchar str1[301][100];\n\tchar str2[301][100];\n\tint n;\n\tcin >> n;\n\tfor (int i = 1; i < 301; i++)\n\t{\n\t\tbool rec = true;\n\t\titoa(i, str1[i - 1], n);\n\t\titoa(i * i, str2[i - 1], n);\n\t\tint m=strlen(str2[i - 1]);\n\t\tfor (int j = 0; j < m; j++)\n\t\t{\n\t\t\tif (str2[i-1][j] != str2[i-1][m - 1 - j])\n\t\t\t{\n\t\t\t\trec = false;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t}\n\t\tif (rec)\n\t\t{\n\t\t\tcout << str1[i-1] << \"" \"" << str2[i-1] << endl;\n\t\t}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1279255051497824256,8deffd1a550298bf3da4d16ad8bc34e4d5aeb10a1c2a49486eaf87f400ced3bd,2020-07-04 11:25:46,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <stack>\n#include<string.h>\n#include<algorithm>\nusing namespace std;\n \nchar jinzhi[100],len;\nint zhuanhuan(int x,int y)    \n{\n    int c,m;\n    int i=0;\n    stack<char>str;\n    while(x)\n    {\n        c=x/y;\n        m=x%y;\n        if(m>=10)\n            str.push('A'+m-10);\n        else\n            str.push('0'+m);\n        x=c;\n    }\n    while(!str.empty())\n    {\n        jinzhi[i]=str.top();\n        i++;\n        str.pop();\n    }\n    len=i;\n    return 0;\n}\n \n \nbool pan(char r[])\n{\n    int i;\n    for(i=0;i<len/2;i++)\n        if(r[i]!=r[len-i-1])\n            return 0;\n    return 1;\n}\n \nint main()\n{\n    int n,ch;\n    char t[5000];\n    cin>>n;\n    for(int i=1;i<=300;i++)\n    {\n        zhuanhuan(i*i,n);\n        if(pan(jinzhi))\n        {\n            for(int j=0;j<len;j++)\n                t[j]=jinzhi[j];\n            ch=len;\n            zhuanhuan(i,n);\n            for(int j=0;j<len;j++)\n            cout<<jinzhi[j];\n            cout<<\"" \"";\n            for(int j=0;j<ch;j++)\n            cout<<t[j];\n            cout<<endl;\n        }\n    }\n    return 0;\n}",ACCEPTED,39,656
1279256172907921408,8deffd1a550298bf3da4d16ad8bc34e4d5aeb10a1c2a49486eaf87f400ced3bd,2020-07-04 11:30:13,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <stack>\n#include<string.h>\n#include<algorithm>\nusing namespace std;\n \nchar jinzhi[100],len;\nint zhuanhuan(int x,int y)    \n{\n    int c,m;\n    int i=0;\n    stack<char>str;\n    while(x)\n    {\n        c=x/y;\n        m=x%y;\n        if(m>=10)\n            str.push('A'+m-10);\n        else\n            str.push('0'+m);\n        x=c;\n    }\n    while(!str.empty())\n    {\n        jinzhi[i]=str.top();\n        i++;\n        str.pop();\n    }\n    len=i;\n    return 0;\n}\n \n \nbool pan(char r[])\n{\n    int i;\n    for(i=0;i<len/2;i++)\n        if(r[i]!=r[len-i-1])\n            return 0;\n    return 1;\n}\n \nint main()\n{\n    int n,ch;\n    char t[5000];\n    cin>>n;\n    for(int i=1;i<=300;i++)\n    {\n        zhuanhuan(i*i,n);\n        if(pan(jinzhi))\n        {\n            for(int j=0;j<len;j++)\n                t[j]=jinzhi[j];\n         \n            zhuanhuan(i,n);\n            for(int j=0;j<len;j++)\n            cout<<jinzhi[j];\n            cout<<\"" \""<<cout<<t[j]<<endl;\n        }\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1279256261651005440,8deffd1a550298bf3da4d16ad8bc34e4d5aeb10a1c2a49486eaf87f400ced3bd,2020-07-04 11:30:34,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <stack>\n#include<string.h>\n#include<algorithm>\nusing namespace std;\n \nchar jinzhi[100],len;\nint zhuanhuan(int x,int y)    \n{\n    int c,m;\n    int i=0;\n    stack<char>str;\n    while(x)\n    {\n        c=x/y;\n        m=x%y;\n        if(m>=10)\n            str.push('A'+m-10);\n        else\n            str.push('0'+m);\n        x=c;\n    }\n    while(!str.empty())\n    {\n        jinzhi[i]=str.top();\n        i++;\n        str.pop();\n    }\n    len=i;\n    return 0;\n}\n \n \nbool pan(char r[])\n{\n    int i;\n    for(i=0;i<len/2;i++)\n        if(r[i]!=r[len-i-1])\n            return 0;\n    return 1;\n}\n \nint main()\n{\n    int n,ch;\n    char t[5000];\n    cin>>n;\n    for(int i=1;i<=300;i++)\n    {\n        zhuanhuan(i*i,n);\n        if(pan(jinzhi))\n        {\n            for(int j=0;j<len;j++)\n                t[j]=jinzhi[j];\n         \n            zhuanhuan(i,n);\n            for(int j=0;j<len;j++)\n            cout<<jinzhi[j];\n            cout<<\"" \""<<cout<<t[j]<<endl;\n        }\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1279256289954168832,8deffd1a550298bf3da4d16ad8bc34e4d5aeb10a1c2a49486eaf87f400ced3bd,2020-07-04 11:30:41,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <stack>\n#include<string.h>\n#include<algorithm>\nusing namespace std;\n \nchar jinzhi[100],len;\nint zhuanhuan(int x,int y)    \n{\n    int c,m;\n    int i=0;\n    stack<char>str;\n    while(x)\n    {\n        c=x/y;\n        m=x%y;\n        if(m>=10)\n            str.push('A'+m-10);\n        else\n            str.push('0'+m);\n        x=c;\n    }\n    while(!str.empty())\n    {\n        jinzhi[i]=str.top();\n        i++;\n        str.pop();\n    }\n    len=i;\n    return 0;\n}\n \n \nbool pan(char r[])\n{\n    int i;\n    for(i=0;i<len/2;i++)\n        if(r[i]!=r[len-i-1])\n            return 0;\n    return 1;\n}\n \nint main()\n{\n    int n,ch;\n    char t[5000];\n    cin>>n;\n    for(int i=1;i<=300;i++)\n    {\n        zhuanhuan(i*i,n);\n        if(pan(jinzhi))\n        {\n            for(int j=0;j<len;j++)\n                t[j]=jinzhi[j];\n         \n            zhuanhuan(i,n);\n            for(int j=0;j<len;j++)\n            cout<<jinzhi[j];\n            cout<<\"" \""<<cout<<t[j]<<endl;\n        }\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1279256343217627136,8deffd1a550298bf3da4d16ad8bc34e4d5aeb10a1c2a49486eaf87f400ced3bd,2020-07-04 11:30:54,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <stack>\n#include<string.h>\n#include<algorithm>\nusing namespace std;\n \nchar jinzhi[100],len;\nint zhuanhuan(int x,int y)    \n{\n    int c,m;\n    int i=0;\n    stack<char>str;\n    while(x)\n    {\n        c=x/y;\n        m=x%y;\n        if(m>=10)\n            str.push('A'+m-10);\n        else\n            str.push('0'+m);\n        x=c;\n    }\n    while(!str.empty())\n    {\n        jinzhi[i]=str.top();\n        i++;\n        str.pop();\n    }\n    len=i;\n    return 0;\n}\n \n \nbool pan(char r[])\n{\n    int i;\n    for(i=0;i<len/2;i++)\n        if(r[i]!=r[len-i-1])\n            return 0;\n    return 1;\n}\n \nint main()\n{\n    int n,ch;\n    char t[5000];\n    cin>>n;\n    for(int i=1;i<=300;i++)\n    {\n        zhuanhuan(i*i,n);\n        if(pan(jinzhi))\n        {\n            for(int j=0;j<len;j++)\n                t[j]=jinzhi[j];\n         \n            zhuanhuan(i,n);\n            for(int j=0;j<len;j++)\n            cout<<jinzhi[j];\n            cout<<\"" \""<<cout<<t[j]<<endl;\n        }\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1279256530648489984,8deffd1a550298bf3da4d16ad8bc34e4d5aeb10a1c2a49486eaf87f400ced3bd,2020-07-04 11:31:39,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <stack>\n#include<string.h>\n#include<algorithm>\nusing namespace std;\n \nchar jinzhi[100],len;\nint zhuanhuan(int x,int y)    \n{\n    int c,m;\n    int i=0;\n    stack<char>str;\n    while(x)\n    {\n        c=x/y;\n        m=x%y;\n        if(m>=10)\n            str.push('A'+m-10);\n        else\n            str.push('0'+m);\n        x=c;\n    }\n    while(!str.empty())\n    {\n        jinzhi[i]=str.top();\n        i++;\n        str.pop();\n    }\n    len=i;\n    return 0;\n}\n \n \nbool pan(char r[])\n{\n    int i;\n    for(i=0;i<len/2;i++)\n        if(r[i]!=r[len-i-1])\n            return 0;\n    return 1;\n}\n \nint main()\n{\n    int n,ch;\n    char t[5000];\n    cin>>n;\n    for(int i=1;i<=300;i++)\n    {\n        zhuanhuan(i*i,n);\n        if(pan(jinzhi))\n        {\n            for(int j=0;j<len;j++)\n                t[j]=jinzhi[j];\n         \n            zhuanhuan(i,n);\n            for(int j=0;j<len;j++)\n            cout<<jinzhi[j];\n            cout<<\"" \""<<cout<<t[j]<<endl;\n        }\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1279256583316365312,8deffd1a550298bf3da4d16ad8bc34e4d5aeb10a1c2a49486eaf87f400ced3bd,2020-07-04 11:31:51,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <stack>\n#include<string.h>\n#include<algorithm>\nusing namespace std;\n \nchar jinzhi[100],len;\nint zhuanhuan(int x,int y)    \n{\n    int c,m;\n    int i=0;\n    stack<char>str;\n    while(x)\n    {\n        c=x/y;\n        m=x%y;\n        if(m>=10)\n            str.push('A'+m-10);\n        else\n            str.push('0'+m);\n        x=c;\n    }\n    while(!str.empty())\n    {\n        jinzhi[i]=str.top();\n        i++;\n        str.pop();\n    }\n    len=i;\n    return 0;\n}\n \n \nbool pan(char r[])\n{\n    int i;\n    for(i=0;i<len/2;i++)\n        if(r[i]!=r[len-i-1])\n            return 0;\n    return 1;\n}\n \nint main()\n{\n    int n,ch;\n    char t[5000];\n    cin>>n;\n    for(int i=1;i<=300;i++)\n    {\n        zhuanhuan(i*i,n);\n        if(pan(jinzhi))\n        {\n            for(int j=0;j<len;j++)\n                t[j]=jinzhi[j];\n         \n            zhuanhuan(i,n);\n            for(int j=0;j<len;j++)\n            cout<<jinzhi[j];\n            cout<<\"" \""<<cout<<t[j]<<endl;\n        }\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1279256806570786816,8deffd1a550298bf3da4d16ad8bc34e4d5aeb10a1c2a49486eaf87f400ced3bd,2020-07-04 11:32:44,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <stack>\n#include<string.h>\n#include<algorithm>\nusing namespace std;\n \nchar jinzhi[100],len;\nint zhuanhuan(int x,int y)    \n{\n    int c,m;\n    int i=0;\n    stack<char>str;\n    while(x)\n    {\n        c=x/y;\n        m=x%y;\n        if(m>=10)\n            str.push('A'+m-10);\n        else\n            str.push('0'+m);\n        x=c;\n    }\n    while(!str.empty())\n    {\n        jinzhi[i]=str.top();\n        i++;\n        str.pop();\n    }\n    len=i;\n    return 0;\n}\n \n \nbool pan(char r[])\n{\n    int i;\n    for(i=0;i<len/2;i++)\n        if(r[i]!=r[len-i-1])\n            return 0;\n    return 1;\n}\n \nint main()\n{\n    int n,ch;\n    char t[5000];\n    cin>>n;\n    for(int i=1;i<=300;i++)\n    {\n        zhuanhuan(i*i,n);\n        if(pan(jinzhi))\n        {\n            for(int j=0;j<len;j++)\n                t[j]=jinzhi[j];\n         \n            zhuanhuan(i,n);\n            for(int j=0;j<len;j++)\n            cout<<jinzhi[j];\n            cout<<\"" \""<<cout<<t[j]<<endl;\n        }\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1279257010439127040,8deffd1a550298bf3da4d16ad8bc34e4d5aeb10a1c2a49486eaf87f400ced3bd,2020-07-04 11:33:33,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <stack>\n#include<string.h>\n#include<algorithm>\nusing namespace std;\n \nchar jinzhi[100],len;\nint zhuanhuan(int x,int y)    \n{\n    int c,m;\n    int i=0;\n    stack<char>str;\n    while(x)\n    {\n        c=x/y;\n        m=x%y;\n        if(m>=10)\n            str.push('A'+m-10);\n        else\n            str.push('0'+m);\n        x=c;\n    }\n    while(!str.empty())\n    {\n        jinzhi[i]=str.top();\n        i++;\n        str.pop();\n    }\n    len=i;\n    return 0;\n}\n \n \nbool pan(char r[])\n{\n    int i;\n    for(i=0;i<len/2;i++)\n        if(r[i]!=r[len-i-1])\n            return 0;\n    return 1;\n}\n \nint main()\n{\n    int n,ch;\n    char t[5000];\n    cin>>n;\n    for(int i=1;i<=300;i++)\n    {\n        zhuanhuan(i*i,n);\n        if(pan(jinzhi))\n        {\n            for(int j=0;j<len;j++)\n                t[j]=jinzhi[j];\n         \n            zhuanhuan(i,n);\n            ch = len;\n            for(int j=0;j<len;j++)\n            cout<<jinzhi[j];\n            for(int j=0;j<ch;j++)\n            cout<<\"" \"";\n            cout<<t[j]<<endl;\n        }\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1279257311049089024,8deffd1a550298bf3da4d16ad8bc34e4d5aeb10a1c2a49486eaf87f400ced3bd,2020-07-04 11:34:45,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <stack>\n#include<string.h>\n#include<algorithm>\nusing namespace std;\n \nchar jinzhi[100],len;\nint zhuanhuan(int x,int y)    \n{\n    int c,m;\n    int i=0;\n    stack<char>str;\n    while(x)\n    {\n        c=x/y;\n        m=x%y;\n        if(m>=10)\n            str.push('A'+m-10);\n        else\n            str.push('0'+m);\n        x=c;\n    }\n    while(!str.empty())\n    {\n        jinzhi[i]=str.top();\n        i++;\n        str.pop();\n    }\n    len=i;\n    return 0;\n}\n \n \nbool pan(char r[])\n{\n    int i;\n    for(i=0;i<len/2;i++)\n        if(r[i]!=r[len-i-1])\n            return 0;\n    return 1;\n}\n \nint main()\n{\n    int n,ch;\n    char t[5000];\n    cin>>n;\n    for(int i=1;i<=300;i++)\n    {\n        zhuanhuan(i*i,n);\n        if(pan(jinzhi))\n        {\n            for(int j=0;j<len;j++)\n                t[j]=jinzhi[j];\n         \n            zhuanhuan(i,n);\n            ch = len;\n            for(int j=0;j<len;j++)\n            cout<<jinzhi[j];\n            for(int j=0;j<ch;j++)\n                cout<<\"" \"";\n                cout<<t[j];\n                cout<<endl;\n        }\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1279257535918301184,29daffe59a777a5f09eff003bd9b3955e01a20723de72b8e68bb19eb33650dbc,2020-07-04 11:35:38,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstdlib>\n#include<string.h>\n#include<algorithm>\n#include<iomanip>\nusing namespace std;\n\nchar* decimal(int n, int m, char* str)\n{\n\tint i;\n\tint len;\n\tchar temp;\n\tchar r;\n\n\tlen = 0;\n\n\twhile (n != 0)\n\t{\n\t\tif (m != 16)\n\t\t{\n\t\t\tr = n % m;\n\t\t\tstr[len] = r + '0';\n\t\t\tn = n / m;\n\t\t\tlen++;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif (n % m > 9)\n\t\t\t{\n\t\t\t\tr = n % m;\n\t\t\t\tstr[len] = r - 10 + 'A';//r > 9\n\t\t\t\tn = n / m;\n\t\t\t\tlen++;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tr = n % m;\n\t\t\t\tstr[len] = r + '0';\n\t\t\t\tn = n / m;\n\t\t\t\tlen++;\n\t\t\t}\n\t\t}\n\t}\n\tstr[len] = '\\0';\n\tfor (i = 0; i < len / 2; i++)\n\t{\n\t\ttemp = str[i];\n\t\tstr[i] = str[len - 1 - i];\n\t\tstr[len - 1 - i] = temp;\n\t}\n\treturn str;\n\n}\nint main()\n{\n\tchar str1[301][100];\n\tchar str2[301][100];\n\tint n;\n\tcin >> n;\n\tfor (int i = 1; i < 301; i++)\n\t{\n\t\tbool rec = true;\n\t\tdecimal(i, n, str1[i - 1]);\n\t\tdecimal(i*i, n, str2[i - 1]);\n\t\tint m=strlen(str2[i - 1]);\n\t\tfor (int j = 0; j < m; j++)\n\t\t{\n\t\t\tif (str2[i-1][j] != str2[i-1][m - 1 - j])\n\t\t\t{\n\t\t\t\trec = false;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t}\n\t\tif (rec)\n\t\t{\n\t\t\tcout << str1[i-1] << \"" \"" << str2[i-1] << endl;\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,27,736
1279257593233465344,29daffe59a777a5f09eff003bd9b3955e01a20723de72b8e68bb19eb33650dbc,2020-07-04 11:35:52,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstdlib>\n#include<string.h>\n#include<algorithm>\n#include<iomanip>\nusing namespace std;\n\nchar* decimal(int n, int m, char* str)\n{\n\tint i;\n\tint len;\n\tchar temp;\n\tchar r;\n\n\tlen = 0;\n\n\twhile (n != 0)\n\t{\n\t\tif (m != 16)\n\t\t{\n\t\t\tr = n % m;\n\t\t\tstr[len] = r + '0';\n\t\t\tn = n / m;\n\t\t\tlen++;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif (n % m > 9)\n\t\t\t{\n\t\t\t\tr = n % m;\n\t\t\t\tstr[len] = r - 10 + 'A';//r > 9\n\t\t\t\tn = n / m;\n\t\t\t\tlen++;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tr = n % m;\n\t\t\t\tstr[len] = r + '0';\n\t\t\t\tn = n / m;\n\t\t\t\tlen++;\n\t\t\t}\n\t\t}\n\t}\n\tstr[len] = '\\0';\n\tfor (i = 0; i < len / 2; i++)\n\t{\n\t\ttemp = str[i];\n\t\tstr[i] = str[len - 1 - i];\n\t\tstr[len - 1 - i] = temp;\n\t}\n\treturn str;\n\n}\nint main()\n{\n\tchar str1[301][100];\n\tchar str2[301][100];\n\tint n;\n\tcin >> n;\n\tfor (int i = 1; i < 301; i++)\n\t{\n\t\tbool rec = true;\n\t\tdecimal(i, n, str1[i - 1]);\n\t\tdecimal(i*i, n, str2[i - 1]);\n\t\tint m=strlen(str2[i - 1]);\n\t\tfor (int j = 0; j < m; j++)\n\t\t{\n\t\t\tif (str2[i-1][j] != str2[i-1][m - 1 - j])\n\t\t\t{\n\t\t\t\trec = false;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t}\n\t\tif (rec)\n\t\t{\n\t\t\tcout << str1[i-1] << \"" \"" << str2[i-1] << endl;\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,40,496
1279257948847538176,459ce662b14bafd9f391c359c54aa17e63014ceaede44a8bee3262a42b80fe2f,2020-07-04 11:37:17,C++,50.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nint t1[100];\nchar t2[100];\nint h = 0;\nvoid trans(int n, int x)\n{\n\th = 0;\n\tint i;\n\tfor (i = 0; x; i++)\n\t{\n\n\t\tt1[i] = x % n;\n\t\tx = x / n;\n\t\th++;\n\t}\n\n}\nvoid tranc()\n{\n\tint i, h2 = h - 1;\n\tfor (i = 0; i < h; i++)\n\t{\n\n\t\tif (t1[i] < 10)\n\t\t{\n\t\t\tt2[h2] = char(t1[i] + '0');\n\t\t}\n\t\telse\n\t\t{\n\t\t\tt2[h2] = char(t1[i] + 'A' - 10);\n\t\t}\n\t\th2--;\n\t}\n}\nbool r()\n{\n\tint i, h3 = h;\n\tfor (i = 0; i < h3; i++)\n\t{\n\t\tif (t2[i] != t2[h3 - 1])\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\th3--;\n\t}\n\treturn true;\n}\nint main()\n{\n\tint n, i, j, flag = 0, h, s, numbers = 0;\n\tcin >> h;\n\tcin >> s;\n\tfor (i = s; ; i++)\n\t{\n\t\tflag = 0;\n\t\tfor (n= 2; n <= 10; n++)\n\t\t{\n\t\t\ttrans(n, i);\n\t\t\ttranc();\n\t\t\tif (r())\n\t\t\t{\n\t\t\t\tflag++;\n\t\t\t}\n\t\t\tif (flag == 2)\n\t\t\t{\n\t\t\t\tcout << i;\n\t\t\t\tnumbers++;\n\t\t\t\tcout << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t}\n\t\tif (numbers == h)\n\t\t{\n\t\t\tbreak;\n\t\t}\n\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,30,384
1279258077910458368,459ce662b14bafd9f391c359c54aa17e63014ceaede44a8bee3262a42b80fe2f,2020-07-04 11:37:47,C++,50.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nint t1[100];\nchar t2[100];\nint h = 0;\nvoid trans(int n, int x)\n{\n\th = 0;\n\tint i;\n\tfor (i = 0; x; i++)\n\t{\n\n\t\tt1[i] = x % n;\n\t\tx = x / n;\n\t\th++;\n\t}\n\n}\nvoid tranc()\n{\n\tint i, h2 = h - 1;\n\tfor (i = 0; i < h; i++)\n\t{\n\n\t\tif (t1[i] < 10)\n\t\t{\n\t\t\tt2[h2] = char(t1[i] + '0');\n\t\t}\n\t\telse\n\t\t{\n\t\t\tt2[h2] = char(t1[i] + 'A' - 10);\n\t\t}\n\t\th2--;\n\t}\n}\nbool r()\n{\n\tint i, h3 = h;\n\tfor (i = 0; i < h3; i++)\n\t{\n\t\tif (t2[i] != t2[h3 - 1])\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\th3--;\n\t}\n\treturn true;\n}\nint main()\n{\n\tint n, i, j, flag = 0, h, s, numbers = 0;\n\tcin >> h;\n\tcin >> s;\n\tfor (i = s; ; i++)\n\t{\n\t\tflag = 0;\n\t\tfor (n= 2; n <= 10; n++)\n\t\t{\n\t\t\ttrans(n, i);\n\t\t\ttranc();\n\t\t\tif (r())\n\t\t\t{\n\t\t\t\tflag++;\n\t\t\t}\n\t\t\tif (flag == 2)\n\t\t\t{\n\t\t\t\tcout << i;\n\t\t\t\tnumbers++;\n\t\t\t\tcout << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t}\n\t\tif (numbers == h)\n\t\t{\n\t\t\tbreak;\n\t\t}\n\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,21,424
1279258723401261056,459ce662b14bafd9f391c359c54aa17e63014ceaede44a8bee3262a42b80fe2f,2020-07-04 11:40:21,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nint t1[100];\nchar t2[100];\nint h = 0;\nvoid trans(int n, int x)\n{\n\th = 0;\n\tint i;\n\tfor (i = 0; x; i++)\n\t{\n\n\t\tt1[i] = x % n;\n\t\tx = x / n;\n\t\th++;\n\t}\n\n}\nvoid tranc()\n{\n\tint i, h2 = h - 1;\n\tfor (i = 0; i < h; i++)\n\t{\n\n\t\tif (t1[i] < 10)\n\t\t{\n\t\t\tt2[h2] = char(t1[i] + '0');\n\t\t}\n\t\telse\n\t\t{\n\t\t\tt2[h2] = char(t1[i] + 'A' - 10);\n\t\t}\n\t\th2--;\n\t}\n}\nbool r()\n{\n\tint i, h3 = h;\n\tfor (i = 0; i < h3; i++)\n\t{\n\t\tif (t2[i] != t2[h3 - 1])\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\th3--;\n\t}\n\treturn true;\n}\nint main()\n{\n\tint n, i, j, flag = 0, h, s, numbers = 0;\n\tcin >> h;\n\tcin >> s;\n\tfor (i = s+1; ; i++)\n\t{\n\t\tflag = 0;\n\t\tfor (n= 2; n <= 10; n++)\n\t\t{\n\t\t\ttrans(n, i);\n\t\t\ttranc();\n\t\t\tif (r())\n\t\t\t{\n\t\t\t\tflag++;\n\t\t\t}\n\t\t\tif (flag == 2)\n\t\t\t{\n\t\t\t\tcout << i;\n\t\t\t\tnumbers++;\n\t\t\t\tcout << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t}\n\t\tif (numbers == h)\n\t\t{\n\t\t\tbreak;\n\t\t}\n\n\t}\n\treturn 0;\n}",ACCEPTED,37,640
1279266086845874176,24f33818392df78e25110ea43aedd778fc2ef5b8586ba12154f761c6575c1086,2020-07-04 12:09:37,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<math.h>\n#include<string>\n#include<algorithm>\nusing namespace std;\n\nstring intToA(int n,int radix){\n    string ans=\""\"",b=\""\"";\n    do{\n        int t=n%radix;\n        if(t>=0&&t<=9){\n            ans+=t+'0';\n        }\n        else\n            ans+=t-10+'A';\n        n/=radix;\n    }\n    while(n!=0);\n    reverse(ans.begin(),ans.end());\n    return ans;\n}\nint main()\n{\n    string intToA(int n,int radix);\n    int a[299],B;\n    cin>>B;\n    for(int i=1;i<=300;i++){\n        a[i-1]=pow(i,2);\n    }\n    for(int i=1;i<=300;i++){\n        string b=intToA(a[i-1],B);\n        string c=b;\n        reverse(b.begin(),b.end());\n        if(c==b){\n            string d=intToA(i,B);\n            cout<<d<<\"" \""<<b<<endl;\n        }\n    }\n    return 0;\n}\n",SEGMENTATION_FAULT,54,424
1279266464492609536,24f33818392df78e25110ea43aedd778fc2ef5b8586ba12154f761c6575c1086,2020-07-04 12:11:07,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<math.h>\n#include<string>\n#include<algorithm>\nusing namespace std;\n\nstring intToA(int n,int radix){\n    string ans=\""\"",b=\""\"";\n    do{\n        int t=n%radix;\n        if(t>=0&&t<=9){\n            ans+=t+'0';\n        }\n        else\n            ans+=t-10+'A';\n        n/=radix;\n    }\n    while(n!=0);\n    reverse(ans.begin(),ans.end());\n    return ans;\n}\nint main()\n{\n    string intToA(int n,int radix);\n    int a[300]=0,B;\n    cin>>B;\n    for(int i=1;i<=300;i++){\n        a[i-1]=pow(i,2);\n    }\n    for(int i=1;i<=300;i++){\n        string b=intToA(a[i-1],B);\n        string c=b;\n        reverse(b.begin(),b.end());\n        if(c==b){\n            string d=intToA(i,B);\n            cout<<d<<\"" \""<<b<<endl;\n        }\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1279266797109305344,24f33818392df78e25110ea43aedd778fc2ef5b8586ba12154f761c6575c1086,2020-07-04 12:12:26,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<math.h>\n#include<string>\n#include<algorithm>\nusing namespace std;\n\nstring intToA(int n,int radix){\n    string ans=\""\"",b=\""\"";\n    do{\n        int t=n%radix;\n        if(t>=0&&t<=9){\n            ans+=t+'0';\n        }\n        else\n            ans+=t-10+'A';\n        n/=radix;\n    }\n    while(n!=0);\n    reverse(ans.begin(),ans.end());\n    return ans;\n}\nint main()\n{\n    string intToA(int n,int radix);\n    int a[300]=0,B;\n    cin>>B;\n    for(int i=1;i<=300;i++){\n        a[i-1]=pow(i,2);\n    }\n    for(int i=1;i<=300;i++){\n        string b=intToA(a[i-1],B);\n        string c=b;\n        reverse(b.begin(),b.end());\n        if(c==b){\n            string d=intToA(i,B);\n            cout<<d<<\"" \""<<b<<endl;\n        }\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1279266971168727040,24f33818392df78e25110ea43aedd778fc2ef5b8586ba12154f761c6575c1086,2020-07-04 12:13:08,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<math.h>\n#include<string>\n#include<algorithm>\nusing namespace std;\n\nstring intToA(int n,int radix){\n    string ans=\""\"",b=\""\"";\n    do{\n        int t=n%radix;\n        if(t>=0&&t<=9){\n            ans+=t+'0';\n        }\n        else\n            ans+=t-10+'A';\n        n/=radix;\n    }\n    while(n!=0);\n    reverse(ans.begin(),ans.end());\n    return ans;\n}\nint main()\n{\n    string intToA(int n,int radix);\n    int a[300],B;\n    cin>>B;\n    for(int i=1;i<=300;i++){\n        a[i-1]=pow(i,2);\n    }\n    for(int i=1;i<=300;i++){\n        string b=intToA(a[i-1],B);\n        string c=b;\n        reverse(b.begin(),b.end());\n        if(c==b){\n            string d=intToA(i,B);\n            cout<<d<<\"" \""<<b<<endl;\n        }\n    }\n    return 0;\n}\n",ACCEPTED,36,432
1279273712660971520,24f33818392df78e25110ea43aedd778fc2ef5b8586ba12154f761c6575c1086,2020-07-04 12:39:55,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<math.h>\n#include<string>\n#include<algorithm>\nusing namespace std;\n\nint intToA(int n,int radix){\n    string ans=\""\"",ans1=\""\"";\n    do{\n        int t=n%radix;\n        if(t>=0&&t<=9){\n            ans+=t+'0';\n        }\n        else\n            ans+=t-10+'A';\n        n/=radix;\n    }\n    while(n!=0);\n    ans1=ans;\n    reverse(ans.begin(),ans.end());\n    if(ans1==ans){\n        return 1;\n    }\n    else\n        return 0;\n}\n\nint main(){\n    int intToA(int n,int radix);\n    int N,a,b=0,c=0;\n    cin>>N>>a;\n    for(int i=0;i<100000;i++){\n        a+=1;\n        for(int j=2;j<=10;j++){\n            b+=intToA(a,j);\n        }\n        if(b>=2){\n            cout<<a<<endl;\n            c+=1;\n        }\n        if(c>=N)\n            break;\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,25,424
1279276231898365952,24f33818392df78e25110ea43aedd778fc2ef5b8586ba12154f761c6575c1086,2020-07-04 12:49:56,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<math.h>\n#include<string>\n#include<algorithm>\nusing namespace std;\n\nint intToA(int n,int radix){\n    string ans=\""\"",ans1=\""\"";\n    do{\n        int t=n%radix;\n        if(t>=0&&t<=9){\n            ans+=t+'0';\n        }\n        else\n            ans+=t-10+'A';\n        n/=radix;\n    }\n    while(n!=0);\n    ans1=ans;\n    reverse(ans.begin(),ans.end());\n    if(ans1==ans){\n        return 1;\n    }\n    else\n        return 0;\n}\n\nint main(){\n    int intToA(int n,int radix);\n    int N,a,b=0,c=0;\n    cin>>N>>a;\n    for(int i=0;i<100000;i++){\n        a+=1;\n        for(int j=2;j<=10;j++){\n            b+=intToA(a,j);\n        }\n        if(b>2){\n            cout<<a<<endl;\n            c+=1;\n        }\n        if(c==N)\n            break;\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,27,484
1279287301597749248,e60091f5b104cde0cb3333edea48c227561b41599b77d2897b85447cd3d7cc0b,2020-07-04 13:33:55,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint n,k,ans;//其中,k代表进制。可以自行修改\nint main()\n{\n\twhile(cin>>n)\n\t{\n\t\tfor(int i=0;n;i++)//其中i为进制位数，为累乘服务\n\t\t{\n\t\t\tint tmp=n%10;//取最后一位\n\t\t\telse for(int j=1;j<=i;j++)tmp*=k;\n\t\t\tans+=tmp;\n\t\t\tn/=10;//丢最后一位\n\t\t}\n\t\tcout<<ans<<\"" \"";\n\t}\n}",COMPILE_ERROR,0,0
1279287513309446144,e60091f5b104cde0cb3333edea48c227561b41599b77d2897b85447cd3d7cc0b,2020-07-04 13:34:45,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstdlib>\n#include<cstdio>\n#include<cstring>\nusing namespace std;\nint a[10000];\nint l1,l2;\nint hw()//判断回文的函数拉\n{\n    for (int i=1;i<=l1/2;i++)\n        if (a[i]!=a[l1-i+1])\n            return 0;\n    return 1;\n}\nint pd(int k,int n)//转化进制的小函数\n{\n    l1=0;\n    do\n    {\n        a[++l1]=k%n;\n        k/=n;\n    } while (k!=0);\n    return 0;\n}\nint main()\n{\n    freopen(\""dualpal.in\"",\""r\"",stdin);\n    freopen(\""dualpal.out\"",\""w\"",stdout);//温馨提示,抄代码的记得删掉\n    int n,m;\n    cin>>n>>m;\n    int i=m+1;//这里要注意!!!\n    int k=0;\n    while(k<n)//K是记输出了几个数的计数器\n    {\n        int ans=0;\n        for(int j=2;j<=10;j++)//从二进制到十进制一一枚举\n        {\n            memset(a,0,sizeof(0));//每次记得把这个数组清零\n            pd(i,j);\n            if(hw()==1)\n             {\n                 ans++;\n             }\n        }\n        if(ans>=2)//如果有两种以上的进制是回文的,那么输出,K++\n        {\n            cout<<i<<endl;\n            k++;\n        }\n        i++;\n    }\n    return 0;\n}",WRONG_ANSWER,34,412
1279287628233367552,e60091f5b104cde0cb3333edea48c227561b41599b77d2897b85447cd3d7cc0b,2020-07-04 13:35:13,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <cstdio>\n#include <algorithm>\n#include <cstring>\n#include <queue>\n#include <cmath>\n#include <iostream>\nusing namespace std;\n\nconst int Maxn=10001;\n\nint n,s;\nint a[Maxn],cnt;\n\nbool is_ok(int x,int k)//判断是否在k进制下满足回文数\n{\n\tcnt=0;\n\twhile(x>0) {//转成k进制\n\t\ta[++cnt]=x%k;\n\t\tx/=k;\n\t}\n\tfor(int i=1; i<=cnt/2; i++)//判断是否回文\n\t\tif(a[i]!=a[cnt-i+1])\n\t\t\treturn false;//一旦找到一个不回文的数，直接返回假\n\treturn true;\n    //转成k进制之后，虽然是k进制下反向的，但如果是回文数，那么反转过后依然是回文数，所以，就不需要再次反转了\n}\n\nint main()\n{\n\tcin>>n>>s;\n\tint ans=0;\n\tfor(int i=s+1; ans!=n; i++) {//枚举从大于s的第一个数开始\n\t\tint sum=0;\n\t\tfor(int j=2; j<=10; j++)//枚举2~10进制\n\t\t\tif(is_ok(i,j)==true)\n\t\t\t\tsum++;//累计可以的进制\n\t\tif(sum>=2) {//如果可行的进制大于等于2，就输出，并累加答案\n\t\t\tcout<<i<<endl;\n\t\t\tans++;\t\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,41,424
1279287940553834496,e60091f5b104cde0cb3333edea48c227561b41599b77d2897b85447cd3d7cc0b,2020-07-04 13:36:27,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <cstdio>\n#include <algorithm>\n#include <cstring>\n#include <queue>\n#include <cmath>\n#include <iostream>\nusing namespace std;\n\nconst int Maxn=10001;\n\nint n,s;\nint a[Maxn],cnt;\n\nbool is_ok(int x,int k)\n{\n\tcnt=0;\n\twhile(x>0) {//转成k进制\n\t\t      a[++cnt]=x%k;\n\t\t      x/=k;\n\t}\n\tfor(int i=1; i<=cnt/2; i++)\n\t\tif(a[i]!=a[cnt-i+1])\n\t\t\t   return false;\n\treturn true;\n}\n\nint main()\n{\n\tcin>>n>>s;\n\tint ans=0;\n\tfor(int i=s+1; ans!=n; i++) {\n\t\tint sum=0;\n\t\tfor(int j=2; j<=10; j++)\n\t\t\tif(is_ok(i,j)==true)\n\t\t\t\tsum++;\n\t\tif(sum>=2) {\n\t\t\tcout<<i<<endl;\n\t\t\tans++;\t\n\t\t   }\n\t      }\n\treturn 0;\n}",ACCEPTED,38,424
1279289315949993984,8d418e97079b1446d46d1a9480943f8e522168ae5c37e784dde26739102d2a1a,2020-07-04 13:41:55,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"//双重回文数\n#include <iostream>\nusing std::cin;\nusing std::cout;\nusing std::endl;\n\nint ch[100];    //储存回文数\nint account;    //记录ch[]的下标\n\nvoid change(int m, int n);  //进制转换\nbool judge();   //判断是否回文\nint main()\n{\n    int N, S;   //N个大于S且在进制（二进制到十进制）下是回文数的十进制数\n    cin >> N >> S;\n\n    int number = 0; //记录回文数的个数\n    for (int i = S + 1; number < N; i++)    //找到N个这样的数，结束\n    {\n        int number2 = 0;    //记录进制下是回文数的次数\n        for (int j = 2; j < 11; j++)\n        {\n            account = 0;    //每一次转换进制前都需要重置下标\n            change(i, j);\n            if (judge())\n            {\n                number2++;\n            }\n        }\n        if (number2 >= 2)   //至少在两个进制下是回文数\n        {\n            cout << i << endl;  //输出该十进制数\n            number++;   //回文数的个数加1\n        }\n        \n    }\n}\n\nvoid change(int m, int n)\n{\n    while (m > 0)\n    {\n        ch[account++] = m % n;\n        m = m / n;\n    }\n}\n\nbool judge()\n{\n    for (int i = 0; i < account; i++)\n    {\n        if (ch[i] != ch[account - 1 - i])\n            return false;\n    }\n    return true;\n}\n",ACCEPTED,38,512
1279294329091186688,769a5633f3f76c88163c10ba96b281ae92c033baa24697a766f3d547fe850076,2020-07-04 14:01:50,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstring>\nusing namespace std;\n\nint number1[110];          //原数\nint number[110];            //平方 作为全局变量可在调用change（）后更新\nint len1;                //记录转换后数组的长度\n\nvoid change(int a, int n)      //转化进制 转换后为倒序\n{\n\tmemset(number, 0, sizeof(number));                //数组归零\n\tlen1=0;                                    //长度归零\n\tint temp{ a };\n\tdo\n\t{\n\t\tnumber[len1] = temp % n;\n\t\ttemp /= n;\n\t\tlen1++;\n\t} while (temp != 0);\n}\n\nbool judge(int a[],int b) {                    //判断回文数(参数为需判断的数组和数组里数字的有效位数\n\tfor (int i{ 0 }; i < b / 2+1; i++) {\n\t\tif (number[i] != number[b - i - 1]) {\n\t\t\treturn 0;                    //如果number[i]不等于和它对应的number[len-i-1]位置，返回false\n\t\t}\n\t}\n\treturn 1;\n}\n\nvoid print(int a[]) {\n\tfor (int k{ 0 }; k < len1; k++) {\n\t\tif (a[k] < 10) {              //小于10输出数字\n\t\t\tcout << a[k];\n\t\t}\n\t\telse {                            //大于10输出大写字母\n\t\t\tcout << (char)(a[k] - 10 + 'A');\n\t\t}\n\t}\n}\n\nint main() {\n\tint B;\n\tcin >> B;                                         //十进制数\n\n\tfor (int i{ 1 }; i < 301; i++) {\n\t\tchange(i*i, B);                        //更新数组和长度\n\t\tif (judge(number,len1) == 1) {\n\t\t\tchange(i, B);\n\t\t\tprint(number);\n\t\t\tchange(i * i, B);\n\t\t\tprint(number);\n\t\t\tcout << endl;\n\t\t}\n\t}\n}",MULTIPLE_ERROR,37,424
1279294561422073856,769a5633f3f76c88163c10ba96b281ae92c033baa24697a766f3d547fe850076,2020-07-04 14:02:46,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstring>\nusing namespace std;\n\nint number1[110];          //原数\nint number[110];            //平方 作为全局变量可在调用change（）后更新\nint len1;                //记录转换后数组的长度\n\nvoid change(int a, int n)      //转化进制 转换后为倒序\n{\n\tmemset(number, 0, sizeof(number));                //数组归零\n\tlen1=0;                                    //长度归零\n\tint temp{ a };\n\tdo\n\t{\n\t\tnumber[len1] = temp % n;\n\t\ttemp /= n;\n\t\tlen1++;\n\t} while (temp != 0);\n}\n\nbool judge(int a[],int b) {                    //判断回文数(参数为需判断的数组和数组里数字的有效位数\n\tfor (int i{ 0 }; i < b / 2+1; i++) {\n\t\tif (number[i] != number[b - i - 1]) {\n\t\t\treturn 0;                    //如果number[i]不等于和它对应的number[len-i-1]位置，返回false\n\t\t}\n\t}\n\treturn 1;\n}\n\nvoid print(int a[]) {\n\tfor (int k{ 0 }; k < len1; k++) {\n\t\tif (a[k] < 10) {              //小于10输出数字\n\t\t\tcout << a[k];\n\t\t}\n\t\telse {                            //大于10输出大写字母\n\t\t\tcout << (char)(a[k] - 10 + 'A');\n\t\t}\n\t}\n}\n\nint main() {\n\tint B;\n\tcin >> B;                                         //十进制数\n\n\tfor (int i{ 1 }; i < 301; i++) {\n\t\tchange(i*i, B);                        //更新数组和长度\n\t\tif (judge(number,len1) == 1) {\n\t\t\tchange(i, B);\n\t\t\tprint(number);\n            cout << \"" \"";\n\t\t\tchange(i * i, B);\n\t\t\tprint(number);\n\t\t\tcout << endl;\n\t\t}\n\t}\n}",PARTIAL_ACCEPTED,38,508
1279296914783133696,769a5633f3f76c88163c10ba96b281ae92c033baa24697a766f3d547fe850076,2020-07-04 14:12:07,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstring>\nusing namespace std;\n\nint number1[110];          //原数\nint number[110];            //平方 作为全局变量可在调用change（）后更新\nint len1;                //记录转换后数组的长度\n\nvoid change(int a, int n)      //转化进制 转换后为倒序\n{\n\tmemset(number, 0, sizeof(number));                //数组归零\n\tlen1=0;                                    //长度归零\n\tint temp{ a };\n\tdo\n\t{\n\t\tnumber[len1] = temp % n;\n\t\ttemp /= n;\n\t\tlen1++;\n\t} while (temp != 0);\n}\n\nbool judge(int a[],int b) {                    //判断回文数(参数为需判断的数组和数组里数字的有效位数\n\tfor (int i{ 0 }; i < b / 2+1; i++) {\n\t\tif (number[i] != number[b - i - 1]) {\n\t\t\treturn 0;                    //如果number[i]不等于和它对应的number[len-i-1]位置，返回false\n\t\t}\n\t}\n\treturn 1;\n}\n\nvoid print(int a[]) {\n\tfor (int k{ len1-1 }; k >=0; k--) {\n\t\tif (a[k] < 10) {              //小于10输出数字\n\t\t\tcout << a[k];\n\t\t}\n\t\telse {                            //大于10输出大写字母\n\t\t\tcout << (char)(a[k] - 10 + 'A');\n\t\t}\n\t}\n}\n\nint main() {\n\tint B;\n\tcin >> B;                                         //十进制数\n\n\tfor (int i{ 1 }; i < 301; i++) {\n\t\tchange(i*i, B);                        //更新数组和长度\n\t\tif (judge(number,len1) == 1) {\n\t\t\tchange(i, B);\n\t\t\tprint(number);\n            cout << \"" \"";\n\t\t\tchange(i * i, B);\n\t\t\tprint(number);\n\t\t\tcout << endl;\n\t\t}\n\t}\n}",ACCEPTED,37,420
1279299413355200512,f5d0e5816b1425aba76914b6740bc3646c8b6c8ffcdace81d8a77d8dc87977f7,2020-07-04 14:22:03,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nbool symm(unsigned n)\n{\n\tunsigned i=n,m=0;\n\twhile(i>0){\n\t\tm=m*10+i%10;\n\t\ti/=10;\n\t}\n\treturn m==n;\n}\nstring train(int y,int B)\n{\n string ans;\n\n while(y!=0)\n  {\n\n  if(y%B<10) {\n   ans+='0'+y%B;}\n \n  else {\n  ans+='A'+(y%B-10);}\n  y=y/B;\n    }\n reverse(ans.begin(),ans.end());\n return  ans;\n}\n\nint main()\n{\n\tint B;\n\tcin>>B;\n\tfor(int i=1;i<301;i=i+1)\n\t{\n   int a=i*i;\n\tif(symm(a))\n\tcout<<i<<\"" \""<<train(a,B)<<\""\\n\"";}\n\treturn 0;\n}\n",COMPILE_ERROR,0,0
1279299645656727552,f5d0e5816b1425aba76914b6740bc3646c8b6c8ffcdace81d8a77d8dc87977f7,2020-07-04 14:22:58,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nbool symm(unsigned n)\n{\n\tunsigned i=n,m=0;\n\twhile(i>0){\n\t\tm=m*10+i%10;\n\t\ti/=10;\n\t}\n\treturn m==n;\n}\nstring train(int y,int B)\n{\n string ans;\n\n while(y!=0)\n  {\n\n  if(y%B<10) {\n   ans+='0'+y%B;}\n \n  else {\n  ans+='A'+(y%B-10);}\n  y=y/B;\n    }\n reverse(ans.begin(),ans.end());\n return  ans;\n}\n\nint main()\n{\n\tint B;\n\tcin>>B;\n\tfor(int i=1;i<301;i=i+1)\n\t{\n   int a=i*i;\n\tif(symm(a))\n\tcout<<i<<\"" \""<<train(a,B)<<\""\\n\"";}\n\treturn 0;\n}\n",COMPILE_ERROR,0,0
1279300588557238272,f5d0e5816b1425aba76914b6740bc3646c8b6c8ffcdace81d8a77d8dc87977f7,2020-07-04 14:26:43,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include <bits/stdc++.h>\nusing namespace std;\nbool symm(unsigned n)\n{\n\tunsigned i=n,m=0;\n\twhile(i>0){\n\t\tm=m*10+i%10;\n\t\ti/=10;\n\t}\n\treturn m==n;\n}\nstring train(int y,int B)\n{\n string ans;\n\n while(y!=0)\n  {\n\n  if(y%B<10) {\n   ans+='0'+y%B;}\n \n  else {\n  ans+='A'+(y%B-10);}\n  y=y/B;\n    }\n reverse(ans.begin(),ans.end());\n return  ans;\n}\n\nint main()\n{\n\tint B;\n\tcin>>B;\n\tfor(int i=1;i<301;i=i+1)\n\t{\n   int a=i*i;\n\tif(symm(a))\n\tcout<<i<<\"" \""<<train(a,B)<<\""\\n\"";}\n\treturn 0;\n}\n",PARTIAL_ACCEPTED,40,484
1279302829573865472,24f33818392df78e25110ea43aedd778fc2ef5b8586ba12154f761c6575c1086,2020-07-04 14:35:37,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<math.h>\n#include<string>\n#include<algorithm>\nusing namespace std;\n\nint intToA(int n,int radix){\n    string ans=\""\"",ans1=\""\"";\n    do{\n        int t=n%radix;\n        if(t>=0&&t<=9){\n            ans+=t+'0';\n        }\n        else\n            ans+=t-10+'A';\n        n/=radix;\n    }\n    while(n!=0);\n    ans1=ans;\n    reverse(ans.begin(),ans.end());\n    if(ans1==ans){\n        return 1;\n    }\n    else\n        return 0;\n}\n\nint main(){\n    int intToA(int n,int radix);\n    int N,a,b=0,c=0;\n    cin>>N>>a;\n    for(int i=0;i<100000;i++){\n        a+=1;\n        for(int j=2;j<=10;j++){\n            b=b+intToA(a,j);\n        }\n        if(b>2){\n            cout<<a<<endl;\n            c+=1;\n            b=0;\n        }\n        if(c==N)\n            break;\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,36,628
1279303489384022016,24f33818392df78e25110ea43aedd778fc2ef5b8586ba12154f761c6575c1086,2020-07-04 14:38:14,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<math.h>\n#include<string>\n#include<algorithm>\nusing namespace std;\n\nint intToA(int n,int radix){\n    string ans=\""\"",ans1=\""\"";\n    do{\n        int t=n%radix;\n        if(t>=0&&t<=9){\n            ans+=t+'0';\n        }\n        else\n            ans+=t-10+'A';\n        n/=radix;\n    }\n    while(n!=0);\n    ans1=ans;\n    reverse(ans.begin(),ans.end());\n    if(ans1==ans){\n        return 1;\n    }\n    else\n        return 0;\n}\n\nint main(){\n    int intToA(int n,int radix);\n    int N,a,b=0,c=0;\n    cin>>N>>a;\n    for(int i=0;i<100000;i++){\n        a+=1;\n        for(int j=2;j<=10;j++){\n            b=b+intToA(a,j);\n        }\n        if(b>=2){\n            cout<<a<<endl;\n            c+=1;\n        }\n        b=0;\n        if(c==N)\n            break;\n    }\n    return 0;\n}\n",ACCEPTED,40,512
1279305356813983744,f5d0e5816b1425aba76914b6740bc3646c8b6c8ffcdace81d8a77d8dc87977f7,2020-07-04 14:45:40,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include <bits/stdc++.h>\nusing namespace std;\nbool symm1(string s,int n)\n{\n\tstring s1;\n\tfor(int i=0;i<n;i++,n--)\n\ts1[i]=s[n-1];\n\treturn s==s1;\n}\n\t\t\nbool symm(unsigned n)\n{\n\tunsigned i=n,m=0;\n\twhile(i>0){\n\t\tm=m*10+i%10;\n\t\ti/=10;\n\t}\n\treturn m==n;\n}\nstring train(int y,int B)\n{\n string ans;\n\n while(y!=0)\n  {\n\n  if(y%B<10) {\n   ans+='0'+y%B;}\n \n  else {\n  ans+='A'+(y%B-10);}\n  y=y/B;\n    }\n reverse(ans.begin(),ans.end());\n return  ans;\n}\n\nint main()\n{\n\tint B;\n\tcin>>B;\n\tfor(int i=1;i<301;i=i+1)\n\t{\n  int a=i*i;\n  int n=train(a,B).length();\n  if(symm1(train(a,B),n))\n\tcout<<i<<\"" \""<<a<<endl;\n\t}\n\treturn 0;\n}\n",WRONG_ANSWER,32,384
1279309798808412160,4f182c28dd09aef1c51625cc6d216fa8518d9bd8b8965d2d3e415fae2d5a5bc5,2020-07-04 15:03:19,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<cstdio>\n#include<cstring>\n#include<algorithm>\n\nusing namespace std;\nint n;\ninline char c(int x) { if (x >= 0 && x <= 9)return x + '0'; return x - 10 + 'A'; }\n\nstruct node\n{\n    int l, a[20];\n    node(int x) { for (l = 0; x; l++)a[l] = x % n, x /= n; }\n    void out() { for (int i = l - 1; i >= 0; i--)printf(\""%c\"", c(a[i])); }\n    bool tf() { for (int i = 0; i < l; i++)if (a[i] != a[l - i - 1])return false; return true; }\n};\nint main()\n{\n    scanf_s(\""%d\"", &n);\n    for (int i = 1; i <= 300; i++)\n    {\n        node n(i * i);\n        if (n.tf()) { node m(i); m.out(); putchar(' '); n.out(); putchar('\\n'); }\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1279309909831647232,4f182c28dd09aef1c51625cc6d216fa8518d9bd8b8965d2d3e415fae2d5a5bc5,2020-07-04 15:03:45,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<cstdio>\n#include<cstring>\n#include<algorithm>\n\nusing namespace std;\nint b;\ninline char c(int x) { if (x >= 0 && x <= 9)return x + '0'; return x - 10 + 'A'; }\n\nstruct node\n{\n    int l, a[20];\n    node(int x) { for (l = 0; x; l++)a[l] = x % b, x /= b; }\n    void out() { for (int i = l - 1; i >= 0; i--)printf(\""%c\"", c(a[i])); }\n    bool tf() { for (int i = 0; i < l; i++)if (a[i] != a[l - i - 1])return false; return true; }\n};\nint main()\n{\n    scanf_s(\""%d\"", &b);\n    for (int i = 1; i <= 300; i++)\n    {\n        node n(i * i);\n        if (n.tf()) { node m(i); m.out(); putchar(' '); n.out(); putchar('\\n'); }\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1279310038647103488,4f182c28dd09aef1c51625cc6d216fa8518d9bd8b8965d2d3e415fae2d5a5bc5,2020-07-04 15:04:16,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<cstdio>\n#include<cstring>\n#include<algorithm>\n\nusing namespace std;\nint b;\ninline char c(int x) { if (x >= 0 && x <= 9)return x + '0'; return x - 10 + 'A'; }\n\nstruct node\n{\n    int l, a[20];\n    node(int x) { for (l = 0; x; l++)a[l] = x % b, x /= b; }\n    void out() { for (int i = l - 1; i >= 0; i--)printf(\""%c\"", c(a[i])); }\n    bool tf() { for (int i = 0; i < l; i++)if (a[i] != a[l - i - 1])return false; return true; }\n};\nint main()\n{\n    scanf(\""%d\"", &b);\n    for (int i = 1; i <= 300; i++)\n    {\n        node n(i * i);\n        if (n.tf()) { node m(i); m.out(); putchar(' '); n.out(); putchar('\\n'); }\n    }\n    return 0;\n}",ACCEPTED,17,384
1279311349807513600,17b8a516d0d0d658620b5cbea10227e537d07a2b1f7401cce4fc73e19884140e,2020-07-04 15:09:28,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\n#include<string>\n#include<stack>\nusing namespace std;\n\nvoid print(int b,int c)\n{\n    stack<int> s;\n    while (c)\n    {\n        s.push(c % b);\n        c /= b;\n    }\n    while (!s.empty())\n    {\n        switch (s.top())\n        {\n        case 10:cout << 'A';break;\n        case 11:cout << 'B';break;\n        case 12:cout << 'C';break;\n        case 13:cout << 'D';break;\n        case 14:cout << 'E';break;\n        case 15:cout << 'F';break;\n        case 16:cout << 'G';break;\n        case 17:cout << 'H';break;\n        case 18:cout << 'I';break;\n        case 19:cout << 'J';break; //这些都是为了能转化为十六进制。\n        default:cout << s.top();break;\n        }\n        s.pop();\n    }\n    return ;\n}\n\n\nint main()\n{\n    int r, n, x, judge = 1;\n    cin >> r;\n\n\n    for (int i = 1;i < 300;i++)//遍历1-300\n    {   \n        n = i*i;\n        char ans[100];//进制转换\n        int j = 0;\n        while (n != 0)\n        {\n        x = n % r;\n        n /= r;\n        \n        switch (x)\n        {\n        case 10:ans[j] = 'A';j++;break;\n        case 11:ans[j] = 'B';j++;break;\n        case 12:ans[j] = 'C';j++;break;\n        case 13:ans[j] = 'D';j++;break;\n        case 14:ans[j] = 'E';j++;break;\n        case 15:ans[j] = 'F';j++;break;\n        case 16:ans[j] = 'G';j++;break;\n        case 17:ans[j] = 'H';j++;break;\n        case 18:ans[j] = 'I';j++;break;\n        case 19:ans[j] = 'G';j++;break;//这些都是为了能转化为十六进制。\n        default:ans[j] = x;j++;break;\n        }\n        }//\n\n        for (int k = 0;k < j;k++)\n        {\n            if (ans[k] != ans[j - k - 1])\n            {\n                judge = 0;\n                break;\n            }\n            else\n                judge = 1;\n        }\n        if (judge)\n        {\n            print(r,i);\n            cout << \"" \"";\n            print(r,i * i);\n            cout << endl;\n        }\n    }\n\n    return 0;\n}\n\n",ACCEPTED,35,424
1279318958669234176,24b1e0cfa34e4ea4fd2a1cf8d625f753eef2b769784ef44859ffc13f46034542,2020-07-04 15:39:43,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nint s[1000];\nint letter[20] = {'0','1','2','3','4','5','6','7','8','9',\n                 'A','B','C','D','E','F','G','H','I','J'};\nint t=0;\nbool judge(int a,int b){\n    t=0;\n    int f = 1;\n    while (a!=0){\n        s[++t] = a%b;\n        a /= b;\n    }\n//    cout << \""t: \"" << t << endl;\n    for (int i=1;i<=t/2+1;i++){\n        if (s[i] != s[t-i+1]){\n            f = 0;\n            break;\n        }\n    }\n    return f;\n}\n\nint main(){\n    int B=10;\n    cin >> B;\n\n    for (int i=1;i<=300;i++){\n        int temp = i*i;\n        if (judge(temp,B)){\n            cout << i << \"" \"";\n            for (int j=1;j<t;j++){\n                cout << (char)letter[s[j]];\n            }\n            cout << (char)letter[s[t]] << endl;\n        }\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,33,512
1279323049201958912,24b1e0cfa34e4ea4fd2a1cf8d625f753eef2b769784ef44859ffc13f46034542,2020-07-04 15:55:58,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nint s[1000];\nint letter[20] = {'0','1','2','3','4','5','6','7','8','9',\n                 'A','B','C','D','E','F','G','H','I','J'};\nint t=0;\nbool judge(int a,int b){\n    t=0;\n    int f = 1;\n    while (a!=0){\n        s[++t] = a%b;\n        a /= b;\n    }\n    for (int i=1;i<=t/2+1;i++){\n        if (s[i] != s[t-i+1]){\n            f = 0;\n            break;\n        }\n    }\n    return f;\n}\n\nint main(){\n    int B=10;\n    cin >> B;\n    int s1[1000];\n    for (int i=1;i<=300;i++){\n        int temp = i*i;\n        if (judge(temp,B)){\n            int k=i;\n            int m=0;\n            while(k!=0){\n                s1[++m] = k%B;\n                k /= B;\n            }\n            for (int p=m;p>=1;p--)\n                cout << s1[p];\n            cout << \"" \"";\n            for (int j=1;j<t;j++){\n                cout << (char)letter[s[j]];\n            }\n            cout << (char)letter[s[t]] << endl;\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,25,424
1279323685146525696,24b1e0cfa34e4ea4fd2a1cf8d625f753eef2b769784ef44859ffc13f46034542,2020-07-04 15:58:29,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nint s[9999];\nint letter[20] = {'0','1','2','3','4','5','6','7','8','9',\n                 'A','B','C','D','E','F','G','H','I','J'};\nint t=0;\nbool judge(int a,int b){\n    t=0;\n    int f = 1;\n    while (a!=0){\n        s[++t] = a%b;\n        a /= b;\n    }\n    for (int i=1;i<=t/2+1;i++){\n        if (s[i] != s[t-i+1]){\n            f = 0;\n            break;\n        }\n    }\n    return f;\n}\n\nint main(){\n    int B=10;\n    cin >> B;\n    int s1[9999];\n    for (int i=1;i<=300;i++){\n        int temp = i*i;\n        if (judge(temp,B)){\n            int k=i;\n            int m=0;\n            while(k!=0){\n                s1[++m] = k%B;\n                k /= B;\n            }\n            for (int p=m;p>=1;p--)\n                cout << (char)letter[s1[p]];\n            cout << \"" \"";\n            for (int j=1;j<t;j++){\n                cout << (char)letter[s[j]];\n            }\n            cout << (char)letter[s[t]] << endl;\n        }\n    }\n    return 0;\n}",ACCEPTED,42,512
1279329520539066368,385c51ba419bb3bbda0722f13d7c530ece9890939a2049f53484294a268f8f07,2020-07-04 16:21:41,Python,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"def decimalToAny(num,n):\n    baseStr={0:\""0\"",1:\""1\"",2:\""2\"",3:\""3\"",4:\""4\"",5:\""5\"",6:\""6\"",7:\""7\"",8:\""8\"",9:\""9\""}\n    new_num_str=\""\""\n    while num!=0:\n        remainder=num%n\n        remainder_string=baseStr[remainder]\n        new_num_str=remainder_string+new_num_str\n        num=(num-remainder)/n\n    return new_num_str\nn=int(input())\ns=int(input())+1\na=[]\nwhile True:\n    d=[]\n    for i in range(2,11):\n        b=list(decimalToAny(s,i))\n        c=b,copy()\n        b.reversr()\n        if b==c:\n            d.append(i)\n        if len(d)==2:\n            break\n    a.append(s)\n    s+=1\n    if len(a)==n:\n        break\nfor i in range(0,n):\n    print(a[i])\n",NON_ZERO_EXIT_CODE,168,3072
1279330806860800000,385c51ba419bb3bbda0722f13d7c530ece9890939a2049f53484294a268f8f07,2020-07-04 16:26:47,Python,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"def decimalToAny(num,n):\n    baseStr={0:\""0\"",1:\""1\"",2:\""2\"",3:\""3\"",4:\""4\"",5:\""5\"",6:\""6\"",7:\""7\"",8:\""8\"",9:\""9\""}\n    new_num_str=\""\""\n    while num!=0:\n        remainder=num%n\n        remainder_string=baseStr[remainder]\n        new_num_str=remainder_string+new_num_str\n        num=(num-remainder)/n\n    return new_num_str\nn=int(input())\ns=int(input())+1\na=[]\nwhile len(a)<n:\n    d=[]\n    for i in range(2,11):\n        b=list(decimalToAny(s,i))\n        c=b.copy()\n        b.reverse()\n        if b==c:\n            d.append(i)\n        if len(d)==2:\n            break\n    a.append(s)\n    s+=1\nfor i in range(0,n):\n    print(a[i])",NON_ZERO_EXIT_CODE,160,3144
1279331973481291776,24b1e0cfa34e4ea4fd2a1cf8d625f753eef2b769784ef44859ffc13f46034542,2020-07-04 16:31:25,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nbool judge(int a,int b){\n    int t=0;\n    int f = 1;\n    int s[1000];\n    while (a!=0){\n        s[++t] = a%b;\n        a /= b;\n    }\n    for (int i=1;i<=t/2+1;i++){\n        if (s[i] != s[t-i+1]){\n            f = 0;\n            break;\n        }\n    }\n    return f;\n}\n//struct pali{\n//    int number=0;\n//    int count=0;\n//};\n\nint main(){\n    int N,S;\n//    struct pali S;\n    cin >> N >> S;\n    int count=0;\n    for (int i=S+1;count!=N;i++){\n        int cnt=0;\n        for (int j=2;j<=10&&cnt<2;j++){\n            if (judge(i,j)){\n                cnt++;\n            }\n        }\n        if (cnt>=2){\n            cout << i << endl;\n            count++;\n        }\n    }\n    return 0;\n}",ACCEPTED,37,512
1279332972660973568,385c51ba419bb3bbda0722f13d7c530ece9890939a2049f53484294a268f8f07,2020-07-04 16:35:24,Python,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"def decimalToAny(num,n):\n    baseStr={0:\""0\"",1:\""1\"",2:\""2\"",3:\""3\"",4:\""4\"",5:\""5\"",6:\""6\"",7:\""7\"",8:\""8\"",9:\""9\""}\n    new_num_str=\""\""\n    while num!=0:\n        remainder=num%n\n        remainder_string=baseStr[remainder]\n        new_num_str=remainder_string+new_num_str\n        num=(num-remainder)/n\n    return new_num_str\nk=input()\nn=int(k.split()[0])\ns=int(k.split()[1])+1\na=[]\nwhile len(a)<n:\n    d=[]\n    for i in range(2,11):\n        b=list(decimalToAny(s,i))\n        c=b.copy()\n        b.reverse()\n        if b==c:\n            d.append(i)\n        if len(d)==2:\n            a.append(s)\n            break\n    s+=1\nfor i in range(0,n):\n    print(a[i])",ACCEPTED,325,3076
1279335054801559552,f5d0e5816b1425aba76914b6740bc3646c8b6c8ffcdace81d8a77d8dc87977f7,2020-07-04 16:43:40,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\n\t\t\nbool symm(unsigned n)\n{\n\tunsigned i=n,m=0;\n\twhile(i>0){\n\t\tm=m*10+i%10;\n\t\ti/=10;\n\t}\n\treturn m==n;\n}\nstring train(int y,int B)\n{\n string ans;\n\n while(y!=0)\n  {\n\n  if(y%B<10) {\n   ans+='0'+y%B;}\n \n  else {\n  ans+='A'+(y%B-10);}\n  y=y/B;\n    }\n reverse(ans.begin(),ans.end());\n return  ans;\n}\n\nint main()\n{\n\tint N;\n\tcin>>N;\n\tfor(int i=0;i<301;i=i+1)\n\t{\n\t\tif(symm(i)==0)continue;\n\t \telse\n\t\tif(symm(i*i))\n\t\tcout<<train(i,N)<<\"" \""<<train(i*i,N)<<endl;\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1279335151148924928,f5d0e5816b1425aba76914b6740bc3646c8b6c8ffcdace81d8a77d8dc87977f7,2020-07-04 16:44:03,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<bits/stdc++.h>\nusing namespace std;\n\t\t\nbool symm(unsigned n)\n{\n\tunsigned i=n,m=0;\n\twhile(i>0){\n\t\tm=m*10+i%10;\n\t\ti/=10;\n\t}\n\treturn m==n;\n}\nstring train(int y,int B)\n{\n string ans;\n\n while(y!=0)\n  {\n\n  if(y%B<10) {\n   ans+='0'+y%B;}\n \n  else {\n  ans+='A'+(y%B-10);}\n  y=y/B;\n    }\n reverse(ans.begin(),ans.end());\n return  ans;\n}\n\nint main()\n{\n\tint N;\n\tcin>>N;\n\tfor(int i=0;i<301;i=i+1)\n\t{\n\t\tif(symm(i)==0)continue;\n\t \telse\n\t\tif(symm(i*i))\n\t\tcout<<train(i,N)<<\"" \""<<train(i*i,N)<<endl;\n\t}\n\treturn 0;\n}",WRONG_ANSWER,41,436
1279336741578670080,62ab56fba214ade1af428052e84f54b4a39008da8e2a6d888d02d705582fc25a,2020-07-04 16:50:22,Python,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"n = eval(input())\nlistone = [0,1,2,3,4,5,6,7,8,9,'A','B','C','D','E','F','G','H','I','J']\ndef finda(x,n):\n    i = 0\n    while x >= n**i:\n        i = i + 1\n    return i\ndef changef(x,n,a):\n    global strnum\n    while a != 0:\n        num1 = x // n**a\n        num2 = x % n**a\n        str1 = listone[num1]\n        strnum.append(str1)\n        x = num2\n        a = a - 1\n    strnum.append(listone[x])\n    return strnum\ndef judgef(x):\n    global strnum\n    str1 = ''\n    for y in strnum:\n        y = str(y)\n        str1 = str1 + y\n    if strnum == strnum[::-1]:\n        print(x,\"" \"",str1)\n    else:\n        0\n    return \nfor x in range(1,301):\n    strnum = []\n    a = finda(x**2,n)\n    strnum = changef(x**2,n,a-1)\n    judgef(x**2)\n    \n\n\n",WRONG_ANSWER,208,3112
1279336829432561664,62ab56fba214ade1af428052e84f54b4a39008da8e2a6d888d02d705582fc25a,2020-07-04 16:50:43,Python,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"n = eval(input())\nlistone = [0,1,2,3,4,5,6,7,8,9,'A','B','C','D','E','F','G','H','I','J']\ndef finda(x,n):\n    i = 0\n    while x >= n**i:\n        i = i + 1\n    return i\ndef changef(x,n,a):\n    global strnum\n    while a != 0:\n        num1 = x // n**a\n        num2 = x % n**a\n        str1 = listone[num1]\n        strnum.append(str1)\n        x = num2\n        a = a - 1\n    strnum.append(listone[x])\n    return strnum\ndef judgef(x):\n    global strnum\n    str1 = ''\n    for y in strnum:\n        y = str(y)\n        str1 = str1 + y\n    if strnum == strnum[::-1]:\n        print(x,\"" \"",str1)\n    else:\n        0 \nfor x in range(1,301):\n    strnum = []\n    a = finda(x**2,n)\n    strnum = changef(x**2,n,a-1)\n    judgef(x)\n    \n\n\n",MULTIPLE_ERROR,202,3136
1279336941869268992,f5d0e5816b1425aba76914b6740bc3646c8b6c8ffcdace81d8a77d8dc87977f7,2020-07-04 16:51:10,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n\n#include<bits/stdc++.h>\nusing namespace std;\n\t\t\nbool symm(unsigned n)\n{\n\tunsigned i=n,m=0;\n\twhile(i>0){\n\t\tm=m*10+i%10;\n\t\ti/=10;\n\t}\n\treturn m==n;\n}\nstring train(int y,int B)\n{\n string ans;\n\n while(y!=0)\n  {\n\n  if(y%B<10) {\n   ans+='0'+y%B;}\n \n  else {\n  ans+='A'+(y%B-10);}\n  y=y/B;\n    }\n reverse(ans.begin(),ans.end());\n return  ans;\n}\n\nint main()\n{\n\tint N;\n\tcin>>N;\n\tfor(int i=0;i<301;i=i+1)\n\t{\n\t\tif(symm(i*i))\n\t\tcout<<train(i,N)<<\"" \""<<train(i*i,N)<<endl;\n\t}\n\treturn 0;\n}\n",MULTIPLE_ERROR,39,384
1279337121611964416,f5d0e5816b1425aba76914b6740bc3646c8b6c8ffcdace81d8a77d8dc87977f7,2020-07-04 16:51:53,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<bits/stdc++.h>\nusing namespace std;\n\t\t\nbool symm(unsigned n)\n{\n\tunsigned i=n,m=0;\n\twhile(i>0){\n\t\tm=m*10+i%10;\n\t\ti/=10;\n\t}\n\treturn m==n;\n}\nstring train(int y,int B)\n{\n string ans;\n\n while(y!=0)\n  {\n\n  if(y%B<10) {\n   ans+='0'+y%B;}\n \n  else {\n  ans+='A'+(y%B-10);}\n  y=y/B;\n    }\n reverse(ans.begin(),ans.end());\n return  ans;\n}\n\nint main()\n{\n\tint N;\n\tcin>>N;\n\tfor(int i=0;i<301;i=i+1)\n\t{\n\t\tif(symm(i*i))\n\t\tcout<<train(i,N)<<\"" \""<<train(i*i,N)<<endl;\n\t}\n\treturn 0;\n}\n",MULTIPLE_ERROR,39,424
1279337500508618752,62ab56fba214ade1af428052e84f54b4a39008da8e2a6d888d02d705582fc25a,2020-07-04 16:53:23,Python,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"n = eval(input())\nlistone = [0,1,2,3,4,5,6,7,8,9,'A','B','C','D','E','F','G','H','I','J']\ndef finda(x,n):\n    i = 0\n    while x >= n**i:\n        i = i + 1\n    return i\ndef changef(x,n,a):\n    global strnum\n    while a != 0:\n        num1 = x // n**a\n        num2 = x % n**a\n        str1 = listone[num1]\n        strnum.append(str1)\n        x = num2\n        a = a - 1\n    strnum.append(listone[x])\n    return strnum\ndef judgef(x):\n    global strnum\n    str1 = ''\n    for y in strnum:\n        y = str(y)\n        str1 = str1 + y\n    if strnum == strnum[::-1]:\n        print(x,\"" \"",eval(str1))\n    else:\n        0 \nfor x in range(1,301):\n    strnum = []\n    a = finda(x**2,n)\n    strnum = changef(x**2,n,a-1)\n    judgef(x)\n    \n\n\n",MULTIPLE_ERROR,224,3196
1279342760341995520,17b8a516d0d0d658620b5cbea10227e537d07a2b1f7401cce4fc73e19884140e,2020-07-04 17:14:17,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<vector>\n#include<string>\n#include<stack>\nusing namespace std;\n\n\nint main()\n{\n    int r, n, x, judge = 1;\n    int S = 0;//小于的数\n    int N;\n    cin >> N >> S;\n\n    for (int i = 1;i < S;i++)//遍历1-300\n    {\n        int num_huiwen = 0;\n        int num_ans = 0;\n        for (r = 2;r < 11;r++)\n        {\n            n = i;\n            char ans[100];//进制转换\n            int j = 0;\n            while (n != 0)\n            {\n                x = n % r;\n                n /= r;\n                ans[j] = x;j++;\n            }\n\n            for (int k = 0;k < j;k++)\n            {\n                if (ans[k] != ans[j - k - 1])\n                {\n                    judge = 0;\n                    break;\n                }\n                else\n                    judge = 1;\n            }\n            if (judge)\n            {\n                num_huiwen++;\n            }\n            if (num_huiwen > 2)\n            {\n                num_ans++;\n                cout << i << endl;\n                break;\n            }\n        }\n        if (num_ans = N)\n            break;\n\n    }\n}\n",WRONG_ANSWER,31,512
1279344278478716928,f5d0e5816b1425aba76914b6740bc3646c8b6c8ffcdace81d8a77d8dc87977f7,2020-07-04 17:20:19,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<bits/stdc++.h>\nusing namespace std;\n\t\t\nbool symm(string s)\n{   if(s.size() == 1)return true; \n\tstring s1;\n\tint j = s.size();\n\tfor(int i = j -1 ; i >= 0;i--)\n    s1 += s[i];\n\treturn s1==s;\n}\n\t\nstring train(int y,int B)\n{\n string ans;\n\n while(y!=0)\n  {\n\n  if(y%B<10) {\n   ans+='0'+y%B;}\n \n  else {\n  ans+='A'+(y%B-10);}\n  y=y/B;\n    }\n reverse(ans.begin(),ans.end());\n return  ans;\n}\n\nint main()\n{\n\tint N;\n\tstring s;\n\tcin>>N;\n\tfor(int i=1;i<301;i=i+1)\n\t{\n\t\tint j=i*i;\n\t\ts=train(j,N);\n\t\t\n\t\tif(symm(s))\n\t\tcout<<train(i,N)<<\"" \""<<train(j,N)<<endl;\n\t\t\n\t}\n\t\t\n\treturn 0;\n}",ACCEPTED,30,508
1279346221058023424,d5c70f9f0b08a91158e577b0502181fa0f52375b7c5ef057b22a6ed756432e03,2020-07-04 17:28:02,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint judge(int n, int B);\n\tint B,i,m;\n\tcin >> B;\n\tfor (i = 1; i <= 300; i++)\n\t{\n\t\tm = judge(i, B);\n\t\tif (m == 1)\n\t\t{\n\t\t\tcout << i << \"" \"" << i * i<<endl;\n\t\t}\n\t}\n}\nint judge(int n,int B)\n{\n\tint m,k;\n\tm = n * n;\n\tint a[9];\n\tfor (int i = 0; i < 9; i++)\n\t{\n\t\ta[i] = m % B;\n\t\tm = m / B;\n\t\tif (m == 0)\n\t\t{\n\t\t\tk = i;\n\t\t\tbreak;\n\t\t}\n\t}\n\tfor (int i = 0; i < k; i++)\n\t{\n\t\tif (a[i] != a[k - i])\n\t\t\treturn 0;\n\t}\n\treturn 1;\n}",PARTIAL_ACCEPTED,28,424
1279346390457581568,17b8a516d0d0d658620b5cbea10227e537d07a2b1f7401cce4fc73e19884140e,2020-07-04 17:28:43,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<vector>\n#include<string>\n#include<stack>\nusing namespace std;\n\n\nint main()\n{\n    int r, n, x, judge = 1;\n    int S = 0;//小于的数\n    int N;\n    cin >> N >> S;\n    int num_ans = 0;\n    for (int i = S;;i++)//遍历1-S\n    {\n        int num_huiwen = 0;\n        \n        for (r = 2;r < 11;r++)\n        {\n            n = i;\n            char ans[100];//进制转换\n            int j = 0;\n            while (n != 0)\n            {\n                x = n % r;\n                n /= r;\n                ans[j] = x;\n                j++;\n            }\n\n            for (int k = 0;k < j;k++)\n            {\n                if (ans[k] != ans[j - k - 1])\n                {\n                    judge = 0;\n                    break;\n                }\n                else\n                    judge = 1;\n            }\n\n\n            if (judge)\n            {\n                num_huiwen++;\n            }\n            if (num_huiwen > 2)\n            {\n                num_ans++;\n                cout << i << endl;\n                break;\n            }\n        }\n        if (num_ans == N)\n            break;\n\n    }\n    return 0;\n}\n",WRONG_ANSWER,291,492
1279346885238644736,17b8a516d0d0d658620b5cbea10227e537d07a2b1f7401cce4fc73e19884140e,2020-07-04 17:30:41,C++,50.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<vector>\n#include<string>\n#include<stack>\nusing namespace std;\n\n\nint main()\n{\n    int r, n, x, judge = 1;\n    int S = 0;//小于的数\n    int N;\n    cin >> N >> S;\n    int num_ans = 0;\n    for (int i = S;;i++)//遍历1-S\n    {\n        int num_huiwen = 0;\n        \n        for (r = 2;r < 11;r++)\n        {\n            n = i;\n            char ans[100];//进制转换\n            int j = 0;\n            while (n != 0)\n            {\n                x = n % r;\n                n /= r;\n                ans[j] = x;\n                j++;\n            }\n\n            for (int k = 0;k < j;k++)\n            {\n                if (ans[k] != ans[j - k - 1])\n                {\n                    judge = 0;\n                    break;\n                }\n                else\n                    judge = 1;\n            }\n\n\n            if (judge)\n            {\n                num_huiwen++;\n            }\n            if (num_huiwen == 2)\n            {\n                num_ans++;\n                cout << i << endl;\n                break;\n            }\n        }\n        if (num_ans == N)\n            break;\n\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,39,548
1279347189292130304,17b8a516d0d0d658620b5cbea10227e537d07a2b1f7401cce4fc73e19884140e,2020-07-04 17:31:53,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<vector>\n#include<string>\n#include<stack>\nusing namespace std;\n\n\nint main()\n{\n    int r, n, x, judge = 1;\n    int S = 0;//小于的数\n    int N;\n    cin >> N >> S;\n    int num_ans = 0;\n    for (int i = S+1;;i++)//遍历1-S\n    {\n        int num_huiwen = 0;\n        \n        for (r = 2;r < 11;r++)\n        {\n            n = i;\n            char ans[100];//进制转换\n            int j = 0;\n            while (n != 0)\n            {\n                x = n % r;\n                n /= r;\n                ans[j] = x;\n                j++;\n            }\n\n            for (int k = 0;k < j;k++)\n            {\n                if (ans[k] != ans[j - k - 1])\n                {\n                    judge = 0;\n                    break;\n                }\n                else\n                    judge = 1;\n            }\n\n\n            if (judge)\n            {\n                num_huiwen++;\n            }\n            if (num_huiwen == 2)\n            {\n                num_ans++;\n                cout << i << endl;\n                break;\n            }\n        }\n        if (num_ans == N)\n            break;\n\n    }\n    return 0;\n}\n",ACCEPTED,29,424
1279348257103216640,62ab56fba214ade1af428052e84f54b4a39008da8e2a6d888d02d705582fc25a,2020-07-04 17:36:08,Python,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"n = eval(input())\nlistone = [0,1,2,3,4,5,6,7,8,9,'A','B','C','D','E','F','G','H','I','J']\ndef finda(x,n):\n    i = 0\n    while x >= n**i:\n        i = i + 1\n    return i\ndef changef(x,n,a):\n    global strnum\n    while a != 0:\n        num1 = x // n**a\n        num2 = x % n**a\n        if num != 0:\n            str1 = listone[num1]\n            strnum.append(str1)\n            x = num2\n        else:\n            str1 = listone[num1]\n            for j in range(a):\n                strnum.sppend(0)\n            return strnum\n        a = a - 1\n    strnum.append(listone[x])\n    return strnum\ndef judgef(x):\n    global strnum\n    str1 = ''\n    for y in strnum:\n        y = str(y)\n        str1 = str1 + y\n    if strnum == strnum[::-1]:\n        print(x,\""\"",eval(str1))\n    else:\n        0 \nfor x in range(1,301):\n    strnum = []\n    a = finda(x**2,n)\n    strnum = changef(x**2,n,a-1)\n    judgef(x)\n    \n\n\n",NON_ZERO_EXIT_CODE,186,3240
1279350090320248832,62ab56fba214ade1af428052e84f54b4a39008da8e2a6d888d02d705582fc25a,2020-07-04 17:43:25,Python,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"n = eval(input())\nlistone = [0,1,2,3,4,5,6,7,8,9,'A','B','C','D','E','F','G','H','I','J']\ndef finda(x,n):\n    i = 0\n    while x >= n**i:\n        i = i + 1\n    return i\ndef changef(x,n,a):\n    global strnum\n    while a != 0:\n        num1 = x // n**a\n        num2 = x % n**a\n        str1 = listone[num1]\n        strnum.append(str1)\n        x = num2\n        a = a - 1\n    strnum.append(listone[x])\n    return strnum\ndef judgef(x):\n    global strnum\n    str1 = ''\n    for y in strnum:\n        y = str(y)\n        str1 = str1 + y\n    if strnum == strnum[::-1]:\n        print(x,\""\"",eval(str1))\n    else:\n        0 \nfor x in range(1,301):\n    strnum = []\n    a = finda(x**2,n)\n    strnum = changef(x**2,n,a-1)\n    judgef(x)\n    \n\n\n",MULTIPLE_ERROR,208,3200
1279350119273529344,b187174f03bd121c1bab68090cc2e4c9b38801a35b733f87bec579962a6eed36,2020-07-04 17:43:32,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\nint huiwen(vector<int> a){\n\tint t=a.size();\n\tfor (int i = 0; i <= t / 2; ++i)\n\t\tif (a[i] != a[t - 1 - i]) return 0;\n\treturn 1;\n}\nint main(){\n\tint n;\n\tcin>>n;\n\tfor(int i=1;i<=300;++i){\n\t\tvector<int> a;\n\t\tint x=i*i;\n\t\tfor(int j=0;;++j){\n\t\t\twhile(x>0){\n\t\t\t\tint temp=x%n;\n\t\t\t\ta[j].push_back(temp);\n\t\t\t\tx/=n;\n\t\t\t}\n\t\t}\n\t\tif(huiwen(a)){\n\t\t\tcout<<i<<\"" \"";\n\t\t\tfor(int k=0;k<a.size();++k){\n\t\t\t\tcout<<a[k];\n\t\t\t}\n\t\t}\n\t}\n\t\n}",COMPILE_ERROR,0,0
1279350466687721472,62ab56fba214ade1af428052e84f54b4a39008da8e2a6d888d02d705582fc25a,2020-07-04 17:44:55,Python,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"n = eval(input())\nlistone = [0,1,2,3,4,5,6,7,8,9,'A','B','C','D','E','F','G','H','I','J']\ndef finda(x,n):\n    i = 0\n    while x >= n**i:\n        i = i + 1\n    return i\ndef changef(x,n,a):\n    global strnum\n    while a != 0:\n        num1 = x // n**a\n        num2 = x % n**a\n        str1 = listone[num1]\n        strnum.append(str1)\n        x = num2\n        a = a - 1\n    strnum.append(listone[x])\n    return strnum\ndef judgef(x):\n    global strnum\n    str1 = ''\n    for y in strnum:\n        y = str(y)\n        str1 = str1 + y\n    if strnum == strnum[::-1]:\n        print(x,eval(str1))\n    else:\n        0 \nfor x in range(1,301):\n    strnum = []\n    a = finda(x**2,n)\n    strnum = changef(x**2,n,a-1)\n    judgef(x)\n    \n\n\n",PARTIAL_ACCEPTED,195,3240
1279351197054459904,b187174f03bd121c1bab68090cc2e4c9b38801a35b733f87bec579962a6eed36,2020-07-04 17:47:49,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\nint huiwen(vector<int> a){\n\tint t=a.size();\n\tfor (int i = 0; i <= t / 2; ++i)\n\t\tif (a[i] != a[t - 1 - i]) return 0;\n\treturn 1;\n}\nint main(){\n\tint n;\n\tcin>>n;\n\tfor(int i=1;i<=300;++i){\n\t\tvector<int> a;\n\t\tint x=i*i;\n\t\twhile (x > 0) {\n\t\t\tint temp = x % n;\n\t\t\ta.push_back(temp);\n\t\t\tx /= n;\t\n\t\t}\n\t\tif(huiwen(a)){\n\t\t\tcout<<i<<\"" \"";\n\t\t\tfor(int k=0;k<a.size();++k){\n\t\t\t\tcout<<a[k];\n\t\t\t}\n\t\t}\n\t}\n\t\n}",MULTIPLE_ERROR,36,540
1279351688769503232,b187174f03bd121c1bab68090cc2e4c9b38801a35b733f87bec579962a6eed36,2020-07-04 17:49:46,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\nint huiwen(vector<int> a){\n\tint t=a.size();\n\tfor (int i = 0; i <= t / 2; ++i)\n\t\tif (a[i] != a[t - 1 - i]) return 0;\n\treturn 1;\n}\nint main(){\n\tint n;\n\tcin>>n;\n\tfor(int i=1;i<=300;++i){\n\t\tvector<int> a;\n\t\tint x=i*i;\n\t\twhile (x > 0) {\n\t\t\tint temp = x % n;\n\t\t\ta.push_back(temp);\n\t\t\tx /= n;\t\n\t\t}\n\t\tif(huiwen(a)){\n\t\t\tcout<<i<<\"" \"";\n\t\t\tfor(int k=0;k<a.size();++k){\n\t\t\t\tcout<<a[k];\n\t\t\t}\n            cout<<endl;\n\t\t}\n\t}\n\t\n}",PARTIAL_ACCEPTED,40,508
1279357980200329216,b187174f03bd121c1bab68090cc2e4c9b38801a35b733f87bec579962a6eed36,2020-07-04 18:14:46,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\nint huiwen(vector<int> a) {\n\tint t = a.size();\n\tfor (int i = 0; i <= t / 2; ++i)\n\t\tif (a[i] != a[t - 1 - i]) return 0;\n\treturn 1;\n}\nint main() {\n\tint n;\n\tcin >> n;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tvector<int> a;\n\t\tint y = i;\n\t\tint x = i * i;\n\t\twhile (x > 0) {\t\t\t//把平方数的n进制数存入数组a；\n\t\t\tint temp = x % n;\n\t\t\ta.push_back(temp);\n\t\t\tx /= n;\t\n\t\t}\n\t\tvector<int> b;\n\t\twhile (y > 0) {\t\t//把i转换成n进制数存入数组b；\n\t\t\tint temp1 = y % n;\n\t\t\tb.push_back(temp1);\n\t\t\ty /= n;\n\t\t}\n\t\tif (huiwen(a)) {\n\t\t\tfor (int m = 0; m < b.size(); ++m) {\n\t\t\t\tcout << b[m];\n\t\t\t}\n\t\t\tcout << \"" \"";\n\t\t\tfor (int k = 0; k < a.size(); ++k) {\n\t\t\t\tcout << a[k];\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,48,628
1279358965203271680,b187174f03bd121c1bab68090cc2e4c9b38801a35b733f87bec579962a6eed36,2020-07-04 18:18:41,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\nint huiwen(vector<int> a) {\n\tint t = a.size();\n\tfor (int i = 0; i <= t / 2; ++i)\n\t\tif (a[i] != a[t - 1 - i]) return 0;\n\treturn 1;\n}\nint main() {\n\tint n;\n\tcin >> n;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tvector<int> a;\n\t\tint y = i;\n\t\tint x = i * i;\n\t\twhile (x > 0) {\t\t\t//把平方数的n进制数存入数组a；\n\t\t\tint temp = x % n;\n\t\t\ta.push_back(temp);\n\t\t\tx /= n;\t\n\t\t}\n\t\tvector<int> b;\n\t\twhile (y > 0) {\t\t//把i转换成n进制数存入数组b；\n\t\t\tint temp1 = y % n;\n\t\t\tb.push_back(temp1);\n\t\t\ty /= n;\n\t\t}\n\t\tif (huiwen(a)) {\n\t\t\tfor (int m = b.size()-1; m >=0; --m) {\n\t\t\t\tcout << b[m];\n\t\t\t}\n\t\t\tcout << \"" \"";\n\t\t\tfor (int k = 0; k < a.size(); ++k) {\n\t\t\t\tcout << a[k];\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,23,452
1279363614337597440,7a3d8a5cb6e64872eff3723c69b72cf82b811e301be96b2c6c3b9fc17cb28e65,2020-07-04 18:37:09,C,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\nint trans(int num,int n,int a[],int *x);\nint main()\n{\n    int i,j,k,n,d,t[100];\n    scanf(\""%d\"",&n);\n    for(i=1; i<=300; i++)\n    { \n        j=i*i;\n        d=0;\n        if(trans(j,n,t,&d)==1)\n        {\n            d=0;\n            trans(i,n,t,&d);           \n            for(k=d; k>=1; k--)\n            {        \n                if(t[k]<10)\n                    printf(\""%d\"",t[k]);\n                else \n                    printf(\""%c\"",'A'+t[k]-10);\n            }\n            printf(\"" \"");\n            d=0;\n            trans(j,n,t,&d);\n            for(k=1; k<=d; k++)\n            {        \n                if(t[k]<10)\n                    printf(\""%d\"",t[k]);\n                else \n                    printf(\""%c\"",'A'+t[k]-10);\n            }\n            printf(\""\\n\"");\n        }    \n    }\n    return 0;\n}\nint trans(int num,int n,int a[],int *x)\n{\n    int flag=1,i;\n    *x = 0;\n    while(num!=0)\n    {\n        (*x)++;\n        a[*x]=num%n;\n        num=num/n;\n    }\n    for(i=1; i<(*x)/2+1; i++)\n        if(a[i]!=a[*x-i+1])\n        {\n            flag=0;\n            break;\n        }\n    return flag;\n}",ACCEPTED,36,372
1279364473595297792,b187174f03bd121c1bab68090cc2e4c9b38801a35b733f87bec579962a6eed36,2020-07-04 18:40:34,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\n#include<sstream>\n#include<string>\nusing namespace std;\nchar c[10] = { 'A','B','C','D','E','F','G','H','I','J'};\nint huiwen(vector<string> a) {\n\tint t = a.size();\n\tfor (int i = 0; i <= t / 2; ++i)\n\t\tif (a[i] != a[t - 1 - i]) return 0;\n\treturn 1;\n}\nint main() {\n\tint n;\n\tcin >> n;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tvector<string> a;\n\t\tint y = i;\n\t\tint x = i * i;\n\t\twhile (x > 0) {\t\t\t//把平方数的n进制数存入数组a；\n\t\t\tint temp = x % n;\n\t\t\tstring s;\n\t\t\tstringstream ss;\n\t\t\tss << temp;\n\t\t\tss >> s;\n\t\t\tif (temp >= 10) {\n\t\t\t\ts = c[temp % 10];\n\t\t\t}\n\t\t\ta.push_back(s);\n\t\t\tx /= n;\t\n\t\t}\n\t\tvector<string> b;\n\t\twhile (y > 0) {\t\t//把i转换成n进制数存入数组b；\n\t\t\tint temp1 = y % n;\n\t\t\tstring s;\n\t\t\tstringstream ss;\n\t\t\tss << temp1;\n\t\t\tss >> s;\n\t\t\tif (temp1 >= 10) {\n\t\t\t\ts = c[temp1 % 10];\n\t\t\t}\n\t\t\tb.push_back(s);\n\t\t\ty /= n;\n\t\t}\n\t\tif (huiwen(a)) {\n\t\t\tfor (int m = b.size()-1; m >=0; --m) {\n\t\t\t\tcout << b[m];\n\t\t\t}\n\t\t\tcout << \"" \"";\n\t\t\tfor (int k = 0; k < a.size(); ++k) {\n\t\t\t\tcout << a[k];\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,54,484
1279369216845611008,64924f1d7e0fb72ee402c548a3ca9387fc5ad2a42c92a9c70eaca218c1fe5da9,2020-07-04 18:59:25,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream\n#include<stdio.h> \n#include<stdlib.h> \n#include<math.h> \nusing namespace std;\nint n,weishu,t;\nchar zhuanhuahou[300];\nchar zhuanhuahou0[300];\n\nint main()\n{\n    cin>>n;\n    for(int i=1;i<=300;i++)\n    {\n        _itoa(i*i, zhuanhuahou, n);\n        _itoa(i, zhuanhuahou0, n);\n        for(int j=0;j<300;j++)\n        {\n            t=pow(n,j)-1;\n            if(t>=i) {weishu=j;break;}\n        }\n        for(int k=0;k<weishu;k++)\n            if(zhuanhuahou[k]!=zhuanhuahou[weishu-1-k]) break;\n        if(k==weishu) cout<<zhuanhuahou0<<\"" \""<<zhuanhuahou<<endl;\n          \n        \n        \n    }\n}",COMPILE_ERROR,0,0
1279369359040897024,64924f1d7e0fb72ee402c548a3ca9387fc5ad2a42c92a9c70eaca218c1fe5da9,2020-07-04 18:59:59,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream\n#include<stdio.h> \n#include<stdlib.h> \n#include<math.h> \nusing namespace std;\nint n,weishu,t;\nchar zhuanhuahou[300];\nchar zhuanhuahou0[300];\n\nint main()\n{\n    cin>>n;\n    for(int i=1;i<=300;i++)\n    {\n        _itoa(i*i, zhuanhuahou, n);\n        _itoa(i, zhuanhuahou0, n);\n        for(int j=0;j<300;j++)\n        {\n            t=pow(n,j)-1;\n            if(t>=i) {weishu=j;break;}\n        }\n        int k;\n        for(int k=0;k<weishu;k++)\n            if(zhuanhuahou[k]!=zhuanhuahou[weishu-1-k]) break;\n        if(k==weishu) cout<<zhuanhuahou0<<\"" \""<<zhuanhuahou<<endl;\n          \n        \n        \n    }\n}",COMPILE_ERROR,0,0
1279369510920839168,64924f1d7e0fb72ee402c548a3ca9387fc5ad2a42c92a9c70eaca218c1fe5da9,2020-07-04 19:00:35,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<stdio.h> \n#include<stdlib.h> \n#include<math.h> \nusing namespace std;\nint n,weishu,t;\nchar zhuanhuahou[300];\nchar zhuanhuahou0[300];\n\nint main()\n{\n    cin>>n;\n    for(int i=1;i<=300;i++)\n    {\n        _itoa(i*i, zhuanhuahou, n);\n        _itoa(i, zhuanhuahou0, n);\n        for(int j=0;j<300;j++)\n        {\n            t=pow(n,j)-1;\n            if(t>=i) {weishu=j;break;}\n        }\n        int k;\n        for(int k=0;k<weishu;k++)\n            if(zhuanhuahou[k]!=zhuanhuahou[weishu-1-k]) break;\n        if(k==weishu) cout<<zhuanhuahou0<<\"" \""<<zhuanhuahou<<endl;\n          \n        \n        \n    }\n}",COMPILE_ERROR,0,0
1279373066931470336,64924f1d7e0fb72ee402c548a3ca9387fc5ad2a42c92a9c70eaca218c1fe5da9,2020-07-04 19:14:43,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<math.h> \nusing namespace std;\nint n,weishu,t,y;\nint x=0;\nchar zhuanhuahou[300];\nchar zhuanhuahou0[300];\n\nint main()\n{\n    cin>>n;\n    for(int i=1;i<=300;i++)\n    {\n        y=i;\n        while(y>0)\n        {\n            zhuanhuahou0[x]=y%n;\n            y/=n;\n            x++;\n        }\n        y=i*i;\n        x=0;\n        while(y>0)\n        {\n            zhuanhuahou[x]=y%n;\n            y/=n;\n            x++;\n        }\n        \n        for(int j=0;j<300;j++)\n        {\n            t=pow(n,j)-1;\n            if(t>=i) {weishu=j;break;}\n        }\n        int k;\n        for(int k=0;k<weishu;k++)\n            if(zhuanhuahou[k]!=zhuanhuahou[weishu-1-k]) break;\n        if(k==weishu) cout<<zhuanhuahou0<<\"" \""<<zhuanhuahou<<endl;\n          \n        \n        \n    }\n}",WRONG_ANSWER,31,484
1279378526518575104,62ab56fba214ade1af428052e84f54b4a39008da8e2a6d888d02d705582fc25a,2020-07-04 19:36:25,Python,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"\nn = eval(input())\nlistone = [0,1,2,3,4,5,6,7,8,9,'A','B','C','D','E','F','G','H','I','J']\ndef finda(x,n):\n    i = 0\n    while x >= n**i:\n        i = i + 1\n    return i\ndef changef(x,n,a):\n    global strnum\n    while a != 0:\n        num1 = x // n**a\n        num2 = x % n**a\n        str1 = listone[num1]\n        strnum.append(str1)\n        x = num2\n        a = a - 1\n    strnum.append(listone[x])\n    return strnum\ndef judgef(x):\n    global strnum\n    str1 = ''\n    for y in strnum:\n        y = str(y)\n        str1 = str1 + y\n    if strnum == strnum[::-1]:\n        print(x,str1)\n    else:\n        0 \nfor x in range(1,301):\n    strnum = []\n    a = finda(x**2,n)\n    strnum = changef(x**2,n,a-1)\n    judgef(x)\n    \n\n\n",PARTIAL_ACCEPTED,219,3072
1279385181427785728,7a3d8a5cb6e64872eff3723c69b72cf82b811e301be96b2c6c3b9fc17cb28e65,2020-07-04 20:02:51,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint trans(int num,int n);\nint main()\n{\n    int N,S,count=0,i,j,k;\n    cin >> N >> S;\n    for(i=S+1; count<N; i++)\n    {\n        k=0;\n        for(j=2; j<=10; j++)\n        {\n            if(trans(i,j))\n                k++;\n        }\n        if(k>=2)\n        {\n            cout<<i<<endl;\n            count++;\n        }\n    }\n    return 0;\n}\nint trans(int num,int n)\n{\n    int a[100];\n    int flag=1,i,d=0;\n    while(num!=0)\n    {\n        d++;\n        a[d]=num%n;\n        num=num/n;\n    }\n    for(i=1; i<d/2+1; i++)\n        if(a[i]!=a[d-i+1])\n        {\n            flag=0;\n            break;\n        }\n    return flag;\n}",ACCEPTED,29,512
1279398932394729472,00f4fee551df8c2a2d26b8f89acb2489dbd60fc1c678c81d2c25c5f1b599b2a6,2020-07-04 20:57:30,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<algorithm>\n#include<iostream>\n#include<stdio.h>\n#include<string>\nusing namespace std;\nint a[300];\nbool hui(int B,int S)\n{\n    int n=0;\n    while (S)\n    {\n        a[++n]=S%B;\n        S=S/B;\n    }\n    for (int i = 1,j=n; i < j; i++,j--)\n    {\n        if (a[i]!=a[j])\n        {\n            return 0;\n        }\n    }\n    return 1;\n}\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    int q=0,p=0;\n    while (q<N)\n    {\n        S++;\n        for (int B = 2; B<11; B++)\n        {\n            if (hui(B,S))\n            {\n                p++;\n            }\n        }\n        if (p>1)\n        {\n            cout<<S<<endl;\n            q++;\n        }\n        p=0;\n    }\n    \n}",ACCEPTED,26,384
1279400524556722176,8e1fa00181ab686131c09af695061d99ee5d3f9f9fc9bc9c35ea80549c8df064,2020-07-04 21:03:49,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\nusing namespace std;\nint reverse(string);\nint main()\n{\n\tint b;\n\tcin >> b;\n\tchar ch[20] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\n\tfor (int i = 1; i < 301; i++)\n\t{\n\t\tint n = i * i;\n\t\tint j = i;\n\t\tstring arr1;\n\t\tstring arr2;\n\t\tint q;\n\t\tint m;\n\t\tint f = 0;\n\t\tint k = 0;\n\t\twhile (j != 0)\n\t\t{\n\t\t\tq = i % b;\n\t\t\ti = i / b;\n\t\t\tarr1[f] = ch[q];\n\t\t\tf++;\n\t\t}\n\t\twhile (n != 0)\n\t\t{\n\t\t\tm = n % b;\n\t\t\tn = n / b;\n\t\t\tarr2[k] = ch[m];\n\t\t\tk++;\n\t\t}\n\t\tif (reverse(arr2))\n\t\t\tcout << i << \"" \"" << arr2 << endl;\n\t}\n}\nint reverse(string str)\n{\n\tint s = str.size();\n\tstring sstr;\n\tfor (int i = 0; i < s; i++)\n\t{\n\t\tsstr[i] = str[s - 1 - i];\n\t}\n\tif (!str.compare(sstr))\n\t{\n\t\treturn 1;\n\t}\n\telse\n\t\treturn 0;\n}",SEGMENTATION_FAULT,33,464
1279400606169489408,c2c290e91f30dc0454f9ef5b9125b06471e7d4b403c388aa8cf0d9b3efc569e9,2020-07-04 21:04:09,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nint a[20]; \nbool judge(int x,int n)\n{\n    int m{ 0 };\n    x = x * x;\n    while (x)\n    {\n        a[++m] = x % n;\n        x /= n;\n    }\n    for (int i = 1, j = m; i < j; i++, j--)\n        if (a[i] != a[j])\n            return false;\n    return true;\n}\nvoid p(int x,int n)\n{\n    int m = 0;\n    while (x)\n    {\n        a[++m] = x % n;\n        x /= n;\n    }\n    for (int i = m; i >= 1; i--)\n    {\n        if (a[i] > 9)\n            cout<<(a[i] - 10 + 'A');\n        else \n            cout<< a[i] ;\n    }\n}\nint main()\n{\n    int B;\n    cin >> B;\n    for (int i = 1; i <= 300; i++)\n    {\n        if (judge(i,B))\n        {\n            p(i,B);\n            cout << \"" \"";\n            p(i * i,B);\n            cout << \""\\n\"";\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,29,512
1279402122422968320,8e1fa00181ab686131c09af695061d99ee5d3f9f9fc9bc9c35ea80549c8df064,2020-07-04 21:10:10,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\nusing namespace std;\nint reverse(string);\nint main()\n{\n\tint b;\n\tcin >> b;\n\tchar ch[20] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\n\tfor (int i = 1; i < 301; i++)\n\t{\n\t\tint n = i * i;\n\t\tint j = i;\n\t\tstring arr1;\n\t\tstring arr2;\n\t\tint q;\n\t\tint m;\n\t\tint f = 0;\n\t\tint k = 0;\n\t\twhile (j != 0)\n\t\t{\n\t\t\tq = j % b;\n\t\t\tj = j / b;\n\t\t\tarr1[f] = ch[q];\n\t\t\tf++;\n\t\t}\n\t\twhile (n != 0)\n\t\t{\n\t\t\tm = n % b;\n\t\t\tn = n / b;\n\t\t\tarr2[k] = ch[m];\n\t\t\tk++;\n\t\t}\n\t\tif (reverse(arr2))\n\t\t\tcout << i << \"" \"" << arr2 << endl;\n\t}\n}\nint reverse(string str)\n{\n\tint s = str.size();\n\tstring sstr;\n\tfor (int i = 0; i < s; i++)\n\t{\n\t\tsstr[i] = str[s - 1 - i];\n\t}\n\tif (!str.compare(sstr))\n\t{\n\t\treturn 1;\n\t}\n\telse\n\t\treturn 0;\n}",WRONG_ANSWER,38,516
1279403740379938816,b05d9f4f8ae94e871d055cf9cc40d00027e969fe8ebc83bb7ae29282cc9efd75,2020-07-04 21:16:36,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"//\n//  main.cpp\n//  test\n//\n//  Created by tanghuaxin on 2020/7/4.\n//  Copyright © 2020 tanghuaxin. All rights reserved.\n//\n\n#include <iostream>\n#include<string>\n\nusing namespace std;\n\nbool jud(string a){\n    int len=a.length(),flag=1;\n    for(int i=0;i<len/2;i++){\n        if(a[i]!=a[len-i-1]){\n            flag=0;\n            break;\n        }\n    }\n    if(flag==1){\n        return true;\n    }\n    else{\n        return false;\n    }\n}\n\nstring tra(int n,int b){\n    string ans=\""\"";\n    do{\n        int t=n%b;\n    if(t>=0&&t<=9){\n        ans+=t+'0';\n        \n    }\n    else{\n        ans+=t-10+'A';\n    }\n        n/=b;}while(n!=0);\n    reverse(ans.begin(),ans.end() );\n    return ans;\n    \n}\n\n\n\n\n\nint main(int argc, const char * argv[]) {\n    // insert code here...\n    int b;\n    cin>>b;\n    for(int i=0;i<301;i++){\n        if(jud(tra(i*i,b))){\n            cout<<tra(i,b)<<' '<<tra(i*i,b)<<endl;\n        }\n    }\n    \n    return 0;\n}\n",COMPILE_ERROR,0,0
1279403896701640704,b05d9f4f8ae94e871d055cf9cc40d00027e969fe8ebc83bb7ae29282cc9efd75,2020-07-04 21:17:13,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"//\n//  main.cpp\n//  test\n//\n//  Created by tanghuaxin on 2020/7/4.\n//  Copyright © 2020 tanghuaxin. All rights reserved.\n//\n\n#include <iostream>\n#include<string>\n\nusing namespace std;\n\nbool jud(string a){\n    int len=a.length(),flag=1;\n    for(int i=0;i<len/2;i++){\n        if(a[i]!=a[len-i-1]){\n            flag=0;\n            break;\n        }\n    }\n    if(flag==1){\n        return true;\n    }\n    else{\n        return false;\n    }\n}\n\nstring tra(int n,int b){\n    string ans=\""\"";\n    do{\n        int t=n%b;\n    if(t>=0&&t<=9){\n        ans+=t+'0';\n        \n    }\n    else{\n        ans+=t-10+'A';\n    }\n        n/=b;}while(n!=0);\n    reverse(ans.begin(),ans.end() );\n    return ans;\n    \n}\n\n\n\n\n\nint main() {\n    // insert code here...\n    int b;\n    cin>>b;\n    for(int i=0;i<301;i++){\n        if(jud(tra(i*i,b))){\n            cout<<tra(i,b)<<' '<<tra(i*i,b)<<endl;\n        }\n    }\n    \n    return 0;\n}\n",COMPILE_ERROR,0,0
1279404014259593216,8e1fa00181ab686131c09af695061d99ee5d3f9f9fc9bc9c35ea80549c8df064,2020-07-04 21:17:41,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\nusing namespace std;\nint reverse(string);\nint main()\n{\n\tint b;\n\tcin >> b;\n\tchar ch[20] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\n\tfor (int i = 1; i < 301; i++)\n\t{\n\t\tint n = i * i;\n\t\tint j = i;\n\t\tstring arr1;\n\t\tstring arr2;\n\t\tint q;\n\t\tint m;\n\t\tint f = 0;\n\t\tint k = 0;\n\t\twhile (j != 0)\n\t\t{\n\t\t\tq = j % b;\n\t\t\tj = j / b;\n\t\t\tarr1[f] = ch[q];\n\t\t\tf++;\n\t\t}\n\t\twhile (n != 0)\n\t\t{\n\t\t\tm = n % b;\n\t\t\tn = n / b;\n\t\t\tarr2[k] = ch[m];\n\t\t\tk++;\n\t\t}\n\t\tif (reverse(arr2))\n\t\t\tcout << arr1 << \"" \"" << arr2 << endl;\n\t}\n}\nint reverse(string str)\n{\n\tint s = str.size();\n\tstring sstr;\n\tfor (int i = 0; i < s; i++)\n\t{\n\t\tsstr[i] = str[s - 1 - i];\n\t}\n\tif (!str.compare(sstr))\n\t{\n\t\treturn 1;\n\t}\n\telse\n\t\treturn 0;\n}",WRONG_ANSWER,46,512
1279404036904640512,b05d9f4f8ae94e871d055cf9cc40d00027e969fe8ebc83bb7ae29282cc9efd75,2020-07-04 21:17:47,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"//\n//  main.cpp\n//  test\n//\n//  Created by tanghuaxin on 2020/7/4.\n//  Copyright © 2020 tanghuaxin. All rights reserved.\n//\n\n#include <iostream>\n#include<string>\n#include <algorithm>\nusing namespace std;\n\nbool jud(string a){\n    int len=a.length(),flag=1;\n    for(int i=0;i<len/2;i++){\n        if(a[i]!=a[len-i-1]){\n            flag=0;\n            break;\n        }\n    }\n    if(flag==1){\n        return true;\n    }\n    else{\n        return false;\n    }\n}\n\nstring tra(int n,int b){\n    string ans=\""\"";\n    do{\n        int t=n%b;\n    if(t>=0&&t<=9){\n        ans+=t+'0';\n        \n    }\n    else{\n        ans+=t-10+'A';\n    }\n        n/=b;}while(n!=0);\n    reverse(ans.begin(),ans.end() );\n    return ans;\n    \n}\n\n\n\n\n\nint main() {\n    // insert code here...\n    int b;\n    cin>>b;\n    for(int i=0;i<301;i++){\n        if(jud(tra(i*i,b))){\n            cout<<tra(i,b)<<' '<<tra(i*i,b)<<endl;\n        }\n    }\n    \n    return 0;\n}\n",WRONG_ANSWER,39,424
1279404464451026944,b05d9f4f8ae94e871d055cf9cc40d00027e969fe8ebc83bb7ae29282cc9efd75,2020-07-04 21:19:29,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"//\n//  main.cpp\n//  test\n//\n//  Created by tanghuaxin on 2020/7/4.\n//  Copyright © 2020 tanghuaxin. All rights reserved.\n//\n\n#include <iostream>\n#include<string>\n#include <algorithm>\nusing namespace std;\n\nbool jud(string a){\n    int len=a.length(),flag=1;\n    for(int i=0;i<len/2;i++){\n        if(a[i]!=a[len-i-1]){\n            flag=0;\n            break;\n        }\n    }\n    if(flag==1){\n        return true;\n    }\n    else{\n        return false;\n    }\n}\n\nstring tra(int n,int b){\n    string ans=\""\"";\n    do{\n        int t=n%b;\n    if(t>=0&&t<=9){\n        ans+=t+'0';\n        \n    }\n    else{\n        ans+=t-10+'A';\n    }\n        n/=b;}while(n!=0);\n    reverse(ans.begin(),ans.end() );\n    return ans;\n    \n}\n\n\n\n\n\nint main() {\n    // insert code here...\n    int b;\n    cin>>b;\n    for(int i=0;i<301;i++){\n        if(jud(tra(i*i,b))){\n            cout<<tra(i,b)<<\"" \""<<tra(i*i,b)<<endl;\n        }\n    }\n    \n    return 0;\n}\n",WRONG_ANSWER,27,404
1279404630025371648,b05d9f4f8ae94e871d055cf9cc40d00027e969fe8ebc83bb7ae29282cc9efd75,2020-07-04 21:20:08,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"//\n//  main.cpp\n//  test\n//\n//  Created by tanghuaxin on 2020/7/4.\n//  Copyright © 2020 tanghuaxin. All rights reserved.\n//\n\n#include <iostream>\n#include<string>\n#include <algorithm>\nusing namespace std;\n\nbool jud(string a){\n    int len=a.length(),flag=1;\n    for(int i=0;i<len/2;i++){\n        if(a[i]!=a[len-i-1]){\n            flag=0;\n            break;\n        }\n    }\n    if(flag==1){\n        return true;\n    }\n    else{\n        return false;\n    }\n}\n\nstring tra(int n,int b){\n    string ans=\""\"";\n    do{\n        int t=n%b;\n    if(t>=0&&t<=9){\n        ans+=t+'0';\n        \n    }\n    else{\n        ans+=t-10+'A';\n    }\n        n/=b;}while(n!=0);\n    reverse(ans.begin(),ans.end() );\n    return ans;\n    \n}\n\n\n\n\n\nint main() {\n    // insert code here...\n    int b;\n    cin>>b;\n    for(int i=0;i<301;i++){\n        if(jud(tra(i*i,b))){\n            cout<<tra(i,b)<<\"" \""<<tra(i*i,b)<<endl;\n        }\n    }\n    \n    return 0;\n}\n",WRONG_ANSWER,34,392
1279404908829138944,b05d9f4f8ae94e871d055cf9cc40d00027e969fe8ebc83bb7ae29282cc9efd75,2020-07-04 21:21:15,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"//\n//  main.cpp\n//  test\n//\n//  Created by tanghuaxin on 2020/7/4.\n//  Copyright © 2020 tanghuaxin. All rights reserved.\n//\n\n#include <iostream>\n#include<string>\n#include <algorithm>\nusing namespace std;\n\nbool jud(string a){\n    int len=a.length(),flag=1;\n    for(int i=0;i<len/2;i++){\n        if(a[i]!=a[len-i-1]){\n            flag=0;\n            break;\n        }\n    }\n    if(flag==1){\n        return true;\n    }\n    else{\n        return false;\n    }\n}\n\nstring tra(int n,int b){\n    string ans=\""\"";\n    do{\n        int t=n%b;\n    if(t>=0&&t<=9){\n        ans+=t+'0';\n        \n    }\n    else{\n        ans+=t-10+'A';\n    }\n        n/=b;}while(n!=0);\n    reverse(ans.begin(),ans.end() );\n    return ans;\n    \n}\n\n\n\n\n\nint main() {\n    // insert code here...\n    int b;\n    cin>>b;\n    for(int i=1;i<301;i++){\n        if(jud(tra(i*i,b))){\n            cout<<tra(i,b)<<\"" \""<<tra(i*i,b)<<endl;\n        }\n    }\n    \n    return 0;\n}\n",ACCEPTED,34,512
1279412983753531392,7707b0ad9538c4a22483a8a70fccc59fe2b1c309e308bd4058b49b821e876909,2020-07-04 21:53:20,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <stdio.h>\nusing namespace std;\nint b, i, k;\nint a[1000];\nbool pd(int x)\n{\n    int s, i;\n    s = x;\n    i = 0;\n    while (s != 0)\n    {\n        i++;\n        a[i] = s % b;\n        s = s / b;\n    }\n    k = i;\n    for (int j = 1;j <= i / 2 + 1;j++)\n        if (a[j] != a[i - j + 1]) return(false);\n    return(true);\n}\nvoid br(int x)\n{\n    if (x == 0) return;\n    br(x / b);\n    if (x % b <= 9) printf(\""%d\"", x % b);\n    else printf(\""%c\"", x % b + 55);\n}\nint main()\n{\n    cin >> b;\n    for (i = 1;i <= 300;i++)\n    {\n        if (pd(i * i))\n        {\n            br(i);\n            printf(\""%s\"", \"" \"");\n            for (int j = 1;j <= k;j++)\n                if (a[j] <= 9) printf(\""%d\"", a[j]);\n                else printf(\""%c\"", a[j] + 55);\n            printf(\""\\n\"");\n        }\n    }\n}\n",ACCEPTED,38,512
1279413100040617984,62ab56fba214ade1af428052e84f54b4a39008da8e2a6d888d02d705582fc25a,2020-07-04 21:53:48,Python,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"\nn = eval(input())\nlistone = [0,1,2,3,4,5,6,7,8,9,'A','B','C','D','E','F','G','H','I','J']\ndef finda(x,n):\n    i = 0\n    while x >= n**i:\n        i = i + 1\n    return i\ndef changef(x,n,a):\n    global strnum\n    while a != 0:\n        num1 = x // n**a\n        num2 = x % n**a\n        str1 = listone[num1]\n        strnum.append(str1)\n        x = num2\n        a = a - 1\n    strnum.append(listone[x])\n    return strnum\ndef judgef(x):\n    global strnum\n    str1 = ''\n    for y in strnum:\n        y = str(y)\n        str1 = str1 + y\n    if strnum == strnum[::-1]:\n        print(x,str1)\n    else:\n        0 \nfor x in range(1,301):\n    strnum = []\n    a = finda(x**2,n)\n    strnum = changef(x**2,n,a-1)\n    judgef(x)\n    \n\n\n",PARTIAL_ACCEPTED,198,3240
1279413436897755136,62ab56fba214ade1af428052e84f54b4a39008da8e2a6d888d02d705582fc25a,2020-07-04 21:55:08,Python,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"\nn = eval(input())\nlistone = [0,1,2,3,4,5,6,7,8,9,' A',' B',' C',' D',' E',' F',' G',' H',' I',' J']\ndef finda(x,n):\n    i = 0\n    while x >= n**i:\n        i = i + 1\n    return i\ndef changef(x,n,a):\n    global strnum\n    while a != 0:\n        num1 = x // n**a\n        num2 = x % n**a\n        str1 = listone[num1]\n        strnum.append(str1)\n        x = num2\n        a = a - 1\n    strnum.append(listone[x])\n    return strnum\ndef judgef(x):\n    global strnum\n    str1 = ''\n    for y in strnum:\n        y = str(y)\n        str1 = str1 + y\n    if strnum == strnum[::-1]:\n        print(x,str1)\n    else:\n        0 \nfor x in range(1,301):\n    strnum = []\n    a = finda(x**2,n)\n    strnum = changef(x**2,n,a-1)\n    judgef(x)\n    \n\n\n",PARTIAL_ACCEPTED,219,3176
1279413754830184448,8e1fa00181ab686131c09af695061d99ee5d3f9f9fc9bc9c35ea80549c8df064,2020-07-04 21:56:24,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nint reverse(string);\nint main()\n{\n\tint b;\n\tcin >> b;\n\tchar ch[20] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\n\tfor (int i = 1; i < 301; i++)\n\t{\n\t\tint j = i;\n\t\tint n = i * i;\n\t\tstring arr1;\n\t\tstring arr2;\n\t\tint q;\n\t\tint m;\n\t\tint f = 0;\n\t\tint k = 0;\n\t\twhile (j != 0)\n\t\t{\n\t\t\tq = j % b;\n\t\t\tj = j / b;\n\t\t\tarr1 += ch[q];\n\t\t\tf++;\n\t\t}\n\t\twhile (n != 0)\n\t\t{\n\t\t\tm = n % b;\n\t\t\tn = n / b;\n\t\t\tarr2 += ch[m];\n\t\t\tk++;\n\t\t}\n\t\tif (reverse(arr2))\n\t\t\tcout << arr1 << \"" \"" << arr2 << endl;\n\t}\n\treturn 0;\n}\nint reverse(string str)\n{\n\tint s = str.size();\n\tfor (int i = 0; i < s; i++)\n\t{\n\t\tif (str[i] != str[s - 1 - i])\n\t\t\treturn 0;\n\t}\n\treturn 1;\n}",PARTIAL_ACCEPTED,40,512
1279414345992167424,62ab56fba214ade1af428052e84f54b4a39008da8e2a6d888d02d705582fc25a,2020-07-04 21:58:45,Python,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"\nn = eval(input())\nlistone = [0,1,2,3,4,5,6,7,8,9,'A','B','C','D','E','F','G','H','I','J']\ndef finda(y,n):\n    i = 0\n    while y >= n**i:\n        i = i + 1\n    return i\ndef changef(y,n,a):\n    global strnum\n    while a != 0:\n        num1 = y // n**a\n        num2 = y % n**a\n        str1 = listone[num1]\n        strnum.append(str1)\n        y = num2\n        a = a - 1\n    strnum.append(listone[y])\n    return strnum\ndef judgef(y):\n    global strnum\n    str1 = ''\n    for h in strnum:\n        h = str(h)\n        str1 = str1 + h\n    if strnum == strnum[::-1]:\n        print(y,str1)\n    else:\n        0 \nfor x in range(1,301):\n    strnum = []\n    a = finda(x**2,n)\n    strnum = changef(x**2,n,a-1)\n    judgef(x)\n    \n\n\n",PARTIAL_ACCEPTED,231,3076
1279418980593238016,8e1fa00181ab686131c09af695061d99ee5d3f9f9fc9bc9c35ea80549c8df064,2020-07-04 22:17:10,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<algorithm>\nusing namespace std;\nint rreverse(string);\nint main()\n{\n\tint b;\n\tcin >> b;\n\tchar ch[20] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\n\tfor (int i = 1; i < 301; i++)\n\t{\n\t\tint j = i;\n\t\tint n = i * i;\n\t\tstring arr1;\n\t\tstring arr2;\n\t\tint q;\n\t\tint m;\n\t\twhile (j != 0)\n\t\t{\n\t\t\tq = j % b;\n\t\t\tj = j / b;\n\t\t\tarr1 += ch[q];\n\t\t}\n\t\twhile (n != 0)\n\t\t{\n\t\t\tm = n % b;\n\t\t\tn = n / b;\n\t\t\tarr2 += ch[m];\n\t\t}\n\t\tif (rreverse(arr2))\n\t\t{\n\t\t\treverse(arr1.begin(), arr1.end());\n\t\t\tcout << arr1 << \"" \"" << arr2 << endl;\n\t\t}\n\t}\n\treturn 0;\n}\nint rreverse(string str)\n{\n\tint s = str.size();\n\tfor (int i = 0; i < s; i++)\n\t{\n\t\tif (str[i] != str[s - 1 - i])\n\t\t\treturn 0;\n\t}\n\treturn 1;\n}",ACCEPTED,44,512
1279420750132346880,62ab56fba214ade1af428052e84f54b4a39008da8e2a6d888d02d705582fc25a,2020-07-04 22:24:11,Python,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"\nn = eval(input())\nlistone = [0,1,2,3,4,5,6,7,8,9,'A','B','C','D','E','F','G','H','I','J']\ndef finda(y,x,n):\n    i = 0\n    while y >= n**i:\n        i = i + 1\n    j = 0\n    while x >= n**j:\n        j = j + 1\n    return i,j\ndef changef(x,y,n,a,b):\n    global strnum\n    while a != 0:\n        num1 = y // n**a\n        num2 = y % n**a\n        str1 = listone[num1]\n        strnum.append(str1)\n        y = num2\n        a = a - 1\n    strnum.append(listone[y])\n    while b != 0:\n        num3 = x // n**b\n        num4 = x % n**b\n        str2 = listone[num3]\n        strnumf.append(str2)\n        x = num4\n        b = b - 1\n    strnumf.append(listone[x])\n    return strnum,strnumf\ndef judgef():\n    global strnum\n    str1 = ''\n    for h in strnum:\n        h = str(h)\n        str1 = str1 + h\n    str2 = ''\n    for x in strnumf:\n        x = str(x)\n        str2 = str2 + x\n    if strnum == strnum[::-1]:\n        print(str2,str1)\n    else:\n        0 \nfor x in range(1,301):\n    strnumf = []\n    strnum = []\n    a,b = finda(x**2,x,n)\n    strnum,strnumf = changef(x,x**2,n,a-1,b-1)\n    judgef()\n    \n\n\n",ACCEPTED,223,3200
1279425396326465536,c718a5e15c13709ac252b40e283fb2aa1038ea11b52a4e636a057e3e1f4edac7,2020-07-04 22:42:39,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint n;\n\nint s[300];int b;\nbool ispal(int n,int k){\n    int p=0 , m = 1;\n    while(n){\n        s[p++]=n%k;\n        n/=k;\n    }\n    int i=0,j=p-1;\n    while(i<j)\n        if(s[i++]!=s[j--])\n            return 0;       \n    return m;\n}\n\nint main() \n\t{\n\tcin>>n;\n\tfor(int i=1;i<=300;i++)\n\t{//从1-300进行循环 \n    \tb = ispal(i*i,n);//函数调整 \n    \tif(b){\n        \tprintf(\""%d %d/n\"",i,i*i);\n\t\t}\n\t}\n    return 0;\n}\n",WRONG_ANSWER,46,628
1279426999385251840,c718a5e15c13709ac252b40e283fb2aa1038ea11b52a4e636a057e3e1f4edac7,2020-07-04 22:49:01,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>//万能头\nusing namespace std;\nint n;\n\nint s[300];int b;\nbool ispal(int n,int k){\n    int p=0 , m = 1;\n    while(n){\n        s[p++]=n%k;\n        n/=k;\n    }\n    int i=0,j=p-1;\n    while(i<j)\n        if(s[i++]!=s[j--])\n            return 0;\n    return m;\n}\n\nint main()\n    {\n    scanf(\""%d\"",&n);\n    for(int i=1;i<=300;i++)\n    {//从1-300进行循环\n        b = ispal(i*i,n);//函数调整\n        if(b){\n            printf(\""%d %d\\n\"",i,i*i);\n        }\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,40,472
1279428083029827584,64924f1d7e0fb72ee402c548a3ca9387fc5ad2a42c92a9c70eaca218c1fe5da9,2020-07-04 22:53:20,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<math.h> \nusing namespace std;\nint n,y;\nint t=1;\nint x=0;\nchar zhuanhuahou[300];\nchar zhuanhuahou0[300];\nchar a[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nint main()\n{\n    cin>>n;\n    for(int i=1;i<=300;i++)\n    {\n        y=i;\n        while(y>0)\n        {\n            zhuanhuahou0[x]=a[y%n];\n            y/=n;\n            x++;\n        }\n        y=i*i;\n        x=0;\n        while(y>0)\n        {\n            zhuanhuahou[x]=a[y%n];\n            y/=n;\n            x++;\n        }\n        \n      \tfor(int j=0;j<x/2;j++)    \n\t\t{        \n\t\tif(zhuanhuahou[j]!=zhuanhuahou[i-j+1])        {       t=0;       break;        }    \n        }\n        \n        if(t=1){   \n\t\t\t for(int h=0;h<x;h++) {\n\t\tcout<<zhuanhuahou0[h];}    \n\t \t\tcout<<\"" \"";     \n\t      for(int h=0;h<x;h++) {\n\t    \t\tcout<<zhuanhuahou[h];}    \n\t \t\tcout<<endl;     \n\t\t\t }       \n\t\t\n            \n\t\t}\n    \n    }\n",WRONG_ANSWER,40,540
1279433350484254720,66dd4fd0958652a0cc99e3cbe7922929c229ab86a6ae302c6fa36b2f56656957,2020-07-04 23:14:16,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<algorithm>\nusing namespace std;\n\nint B{ 0 };\nconst string num[20] = {\""0\"",\""1\"",\""2\"",\""3\"",\""4\"",\""5\"",\""6\"",\""7\"",\""8\"",\""9\"",\""A\"",\""B\"",\""C\"",\""D\"",\""E\"",\""F\"",\""G\"",\""H\"",\""I\"",\""J\""};\n\nstring jinzhi(int a) {\n\tstring x;\n\twhile (a >= B) {\n\t\tx += num[a % B];\n\t\ta = (a - a % B) / B;\n\t}\n\tx += num[a];\n\treverse(x.begin(), x.end());\n\treturn x;\n}\n\nint main() {\n\tcin >> B;\n\tfor (int i = 1; i <= 300;++i) {\n\t\tstring a, b, c;\n\t\ta = jinzhi(i);\n\t\tb = jinzhi(i*i);\n\t\tc = b;\n\t\treverse(b.begin(), b.end());\n\t\tif (b == c) {\n\t\t\tcout << a << \"" \"" << c << endl;\n\t\t}\n\t}\n\n}",ACCEPTED,27,488
1279438384299180032,bfa663f0a5f5c262e970493185bda9d6afe94f43972346cb444e54747a0fee5c,2020-07-04 23:34:16,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nint B;\nconst int MAX = 300;\nconst int CH[20] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\nvoid printdata(int x)\n{\n\tint a[30], i = 0;\n\twhile (x > 0) a[++i] = x % B, x /= B;\n\tfor (; i; cout << CH[a[i--]]);\n}\nvoid handle(int x)\n{\n\tint a[30], n = 0, xx = x * x;\n\twhile (xx > 0) a[++n] = xx % B, xx /= B;\n\tint t = n;\n\tfor (; (n > 0) && (a[n] == a[t - n + 1]); --n);\n\tif (n == 0) printdata(x), cout << ' ', printdata(x * x), cout << endl;\n}\nint main()\n{\n\tcin >> B;\n\tfor (int i = 1; i <= MAX; i++) handle(i);\n\treturn 0;\n}",WRONG_ANSWER,37,608
1279438860361072640,bfa663f0a5f5c262e970493185bda9d6afe94f43972346cb444e54747a0fee5c,2020-07-04 23:36:09,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <fstream>using namespace std;int main(int argc, const char * argv[]){    ofstream fout(\""palsquare.out\"");    ifstream fin(\""palsquare.in\"");    int zs_hexConversion(const int& num,const int &zs_hex,char *zsNum);    bool zs_isPalindrome(int num,const char* zsNum);    char zs_NUM[2048];    char zs[1024];    int zs_hex;    fin>>zs_hex;    for(int i=1;i<=300;i++)    {        if(zs_isPalindrome(zs_hexConversion(i*i,zs_hex,zs_NUM),zs_NUM))        {            int length = zs_hexConversion(i,zs_hex,zs);            length--;            for(;length>=0;length--)                fout<<zs[length];            fout<<\"" \""<<zs_NUM<<endl;        }    }    return 0;} int zs_hexConversion(const int& num,const int &zs_hex,char *zsNum){    int tempN;    int _num = num;    int i=0;    for (;_num!=0;i++)    {        tempN = _num%zs_hex;        _num=_num/zs_hex;        if(tempN>=10)        {            tempN = tempN - 10;            zsNum[i]=('A'+tempN);        }        else        {            zsNum[i]=('0'+tempN);        }    }    zsNum[i]='\\0';    return i;} bool zs_isPalindrome(int num,const char* zsNum){    num--;    for(int i=0;i<num;i++,num--)    {        if(zsNum[i]!=zsNum[num])            return false;    }    return true;}",COMPILE_ERROR,0,0
1279439081367330816,bfa663f0a5f5c262e970493185bda9d6afe94f43972346cb444e54747a0fee5c,2020-07-04 23:37:02,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstdio>\n#include<cstring>\n#include<algorithm>\nusing namespace std;\n\nvoid bas(int x,int b,char ans[]){\n    int i;\n    for(i=0;x;i++){\n        int t=x%b;\n        x/=b;\n        if(t>9)ans[i]=t%10+'A';\n        else ans[i]=t+'0';\n    }\n    for(int j=0;j<i/2;j++)\n    swap(ans[j],ans[i-j-1]);\n}\nint ispal(char s[]){\n    int len=strlen(s);\n    for(int i=0;i<len;i++)\n        if(s[i]!=s[len-i-1])return 0;\n    return 1;\n}\nint main(){\n    freopen(\""palsquare.in\"",\""r\"",stdin);\n    freopen(\""palsquare.out\"",\""w\"",stdout);\n    int b;\n    cin>>b;\n    for(int i=1;i<=300;i++){\n        char s[20];\n    memset(s,0,sizeof s);\n        bas(i*i,b,s);\n        if(ispal(s)){\n        char n[20];\n        memset(n,0,sizeof n);\n        bas(i,b,n);\n        cout<<n<<\"" \""<<s<<endl;\n    }\n    }\n    return 0;\n}",FLOAT_POINT_EXCEPTION,40,512
1279439247893782528,bfa663f0a5f5c262e970493185bda9d6afe94f43972346cb444e54747a0fee5c,2020-07-04 23:37:42,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstdio>\n#include<cstring>\n#include<algorithm>\nusing namespace std;\n\nvoid bas(int x,int b,char ans[]){\n    int i;\n    for(i=0;x;i++){\n        int t=x%b;\n        x/=b;\n        if(t>9)ans[i]=t%10+'A';\n        else ans[i]=t+'0';\n    }\n    for(int j=0;j<i/2;j++)\n    swap(ans[j],ans[i-j-1]);\n}\nint ispal(char s[]){\n    int len=strlen(s);\n    for(int i=0;i<len;i++)\n        if(s[i]!=s[len-i-1])return 0;\n    return 1;\n}\nint main(){\n    int b;\n    cin>>b;\n    for(int i=1;i<=300;i++){\n        char s[20];\n    memset(s,0,sizeof s);\n        bas(i*i,b,s);\n        if(ispal(s)){\n        char n[20];\n        memset(n,0,sizeof n);\n        bas(i,b,n);\n        cout<<n<<\"" \""<<s<<endl;\n    }\n    }\n    return 0;\n}",ACCEPTED,25,492
1279440194791464960,bfa663f0a5f5c262e970493185bda9d6afe94f43972346cb444e54747a0fee5c,2020-07-04 23:41:27,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <cstdio>\n#include <cstring>\nusing namespace std;\nint main()\n{\n     freopen(\""dualpal.in\"", \""r\"", stdin);\n\t freopen(\""dualpal.out\"", \""w\"", stdout);\n     int n, s;\n     int cnt = 0;\n     char m[111];\n     cin >> n >> s;\n     for (int i = s + 1; cnt != n; i++) {\n\t         int ans = 0;\n\t         for (int k = 2; k <= 10; k++) {\n\t\t             memset(m, 0, sizeof(m));\n\t\t             int p = i;\n\t\t             int j = 0;\n\t\t             while (p) {\n\t\t\t                 m[j++] = p % k + '0';\n\t\t\t                 p /= k;\n\t\t\t\n\t\t\t}\n\t\t             int f = 1;\n\t\t             for (int l = 0, b = j - 1; l < j; l++, b--) {\n\t\t\t                 if (m[l] != m[b]) {\n\t\t\t\t                     f = 0;\n\t\t\t\t                     break;\n\t\t\t\t\n\t\t\t\t}\n\t\t\t\n\t\t\t}\n\t\t             if (f) ans++;\n\t\t\n\t\t}\n\t         if (ans >= 2) { cnt++; cout << i << endl; }\n\t\n\t}\n     return 0;\n }\n",WRONG_ANSWER,34,392
1279440307555336192,bfa663f0a5f5c262e970493185bda9d6afe94f43972346cb444e54747a0fee5c,2020-07-04 23:41:54,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <cstdio>\n#include <cstring>\nusing namespace std;\nint main()\n{\n     int n, s;\n     int cnt = 0;\n     char m[111];\n     cin >> n >> s;\n     for (int i = s + 1; cnt != n; i++) {\n\t         int ans = 0;\n\t         for (int k = 2; k <= 10; k++) {\n\t\t             memset(m, 0, sizeof(m));\n\t\t             int p = i;\n\t\t             int j = 0;\n\t\t             while (p) {\n\t\t\t                 m[j++] = p % k + '0';\n\t\t\t                 p /= k;\n\t\t\t\n\t\t\t}\n\t\t             int f = 1;\n\t\t             for (int l = 0, b = j - 1; l < j; l++, b--) {\n\t\t\t                 if (m[l] != m[b]) {\n\t\t\t\t                     f = 0;\n\t\t\t\t                     break;\n\t\t\t\t\n\t\t\t\t}\n\t\t\t\n\t\t\t}\n\t\t             if (f) ans++;\n\t\t\n\t\t}\n\t         if (ans >= 2) { cnt++; cout << i << endl; }\n\t\n\t}\n     return 0;\n }",ACCEPTED,31,512
1279441602534113280,8e1fa00181ab686131c09af695061d99ee5d3f9f9fc9bc9c35ea80549c8df064,2020-07-04 23:47:03,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nint rreverse(string);\nint main()\n{\n\tchar ch[10] = { '0','1','2','3','4','5','6','7','8','9' };\n\tint n, s;\n\tcin >> n >> s;\n\tint num = 0;\n\tfor (int i = s + 1; i < 10000; i++)\n\t{\n\t\tint t = i;\n\t\tint k = 0;\n\t\tfor (int j = 2; j < 11; j++)\n\t\t{\n\t\t\tint m;\n\t\t\tstring arr;\n\t\t\twhile (t != 0)\n\t\t\t{\n\t\t\t\tm = t % j;\n\t\t\t\tt = t / j;\n\t\t\t\tarr += ch[m];\n\t\t\t}\n\t\t\tif (rreverse(arr))\n\t\t\t\tk += 1;\n\t\t\tif (k > 1)\n\t\t\t{\n\t\t\t\tcout << i << endl;\n\t\t\t\tnum += 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (num == n)\n\t\t\tbreak;\n\t}\n\treturn 0;\n}\nint rreverse(string str)\n{\n\tint s = str.size();\n\tfor (int i = 0; i < s; i++)\n\t{\n\t\tif (str[i] != str[s - 1 - i])\n\t\t\treturn 0;\n\t}\n\treturn 1;\n}",PARTIAL_ACCEPTED,23,512
1279442149135802368,bcb3ff810e5a0484ae0550949ab982695da1f921da2e0407850a5ce7faddd0d1,2020-07-04 23:49:13,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>//万能头\nusing namespace std;\nint n;\nint s[301];\nvoid jinzhi(int a,int b){\n    int m;\n    cin>>a;\n    while(a){\n        s[m++] = a%b;\n        a=a/b;\n        \n    }\n    s[m]=a;\n    \n    \n        \n        \n\nbool change(){\n    for(int i=1;i<=s[0];i++)\n    {\n        if(s[i]!=s[s[0]+1-i]) return false;\n    }\n    return true;\n}\nvoid print(){//打印\n    for(int i=s[0];i>=1;i--)\n    {\n        if(s[i]<=9) cout<<s[i];\n        else cout<<(char)(s[i]-10+'A');\n    }\n}\nint main()\n    {\n    cin>>n;\n    for(int i=1;i<=300;i++)\n    {//从1-300进行循环\n        jinzhi(i*i,n);//调用函数\n        if(change()){\n            jinzhi(i,n);\n            print();\n            cout<<' ';\n            jinzhi(i*i,n);\n            print();\n            puts(\""\"");\n        }\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1279442327372750848,8e1fa00181ab686131c09af695061d99ee5d3f9f9fc9bc9c35ea80549c8df064,2020-07-04 23:49:56,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nint rreverse(string);\nint main()\n{\n\tchar ch[10] = { '0','1','2','3','4','5','6','7','8','9' };\n\tint n, s;\n\tcin >> n >> s;\n\tint num = 0;\n\tfor (int i = s + 1; i < 10000; i++)\n\t{\n\t\tint t = i;\n\t\tint k = 0;\n\t\tfor (int j = 2; j < 11; j++)\n\t\t{\n\t\t\tint m;\n\t\t\tstring arr;\n\t\t\twhile (t != 0)\n\t\t\t{\n\t\t\t\tm = t % j;\n\t\t\t\tt = t / j;\n\t\t\t\tarr += ch[m];\n\t\t\t}\n\t\t\tif (rreverse(arr))\n\t\t\t\tk += 1;\n\t\t\tif (k > 2)\n\t\t\t{\n\t\t\t\tcout << i << endl;\n\t\t\t\tnum += 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (num == n)\n\t\t\tbreak;\n\t}\n\treturn 0;\n}\nint rreverse(string str)\n{\n\tint s = str.size();\n\tfor (int i = 0; i < s; i++)\n\t{\n\t\tif (str[i] != str[s - 1 - i])\n\t\t\treturn 0;\n\t}\n\treturn 1;\n}",PARTIAL_ACCEPTED,40,512
1279443089695891456,bcb3ff810e5a0484ae0550949ab982695da1f921da2e0407850a5ce7faddd0d1,2020-07-04 23:52:58,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>//万能头\nusing namespace std;\nint n;\nint s[301];\nvoid jinzhi(int a,int b){\n    int m;\n    cin>>a;\n    while(a){\n        s[m++] = a%b;\n        a=a/b;\n        \n    }\n    s[m]=a;}\n    \n    \n        \n        \n\nbool change(){\n    for(int i=1;i<=s[0];i++)\n    {\n        if(s[i]!=s[s[0]+1-i]) return false;\n    }\n    return true;\n}\nvoid print(){\n    for(int i=s[0];i>=1;i--)\n    {\n        if(s[i]<=9) cout<<s[i];\n        else cout<<(char)(s[i]-10+'A');\n    }\n}\nint main()\n    {\n    cin>>n;\n    for(int i=1;i<=300;i++)\n    {//从1-300进行循环\n        jinzhi(i*i,n);//调用函数\n        if(change()){\n            jinzhi(i,n);\n            print();\n            cout<<' ';\n            jinzhi(i*i,n);\n            print();\n            puts(\""\"");\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,26,512
1279444164406607872,bcb3ff810e5a0484ae0550949ab982695da1f921da2e0407850a5ce7faddd0d1,2020-07-04 23:57:14,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>//万能头\nusing namespace std;\nint n;\nint s[301];\nvoid jinzhi(int a,int b){\n    int m;\n    cin>>a;\n    while(a){\n        s[m++] = a%b;\n        a=a/b;\n        \n    }\n    s[m]=a;;\n    for (int i=m;i>=0;i--)\n        s[i];\n    }\n    \n    \n        \n        \n\nbool change(){\n    for(int i=1;i<=s[0];i++)\n    {\n        if(s[i]!=s[s[0]+1-i]) return false;\n    }\n    return true;\n}\nvoid print(){\n    for(int i=s[0];i>=1;i--)\n    {\n        if(s[i]<=9) cout<<s[i];\n        else cout<<(char)(s[i]-10+'A');\n    }\n}\nint main()\n    {\n    cin>>n;\n    for(int i=1;i<=300;i++)\n    {//从1-300进行循环\n        jinzhi(i*i,n);//调用函数\n        if(change()){\n            jinzhi(i,n);\n            print();\n            cout<<' ';\n            jinzhi(i*i,n);\n            print();\n            puts(\""\"");\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,29,548
1279444388109811712,bcb3ff810e5a0484ae0550949ab982695da1f921da2e0407850a5ce7faddd0d1,2020-07-04 23:58:07,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>//万能头\nusing namespace std;\nint n;\nint s[301];\nvoid jinzhi(int a,int b){\n    int m;\n    cin>>a;\n    while(a){\n        s[m++] = a%b;\n        a=a/b;\n        \n    }\n    s[m]=a;;\n    for (int i=m;i>=0;i--)\n        s[m]=s[i];\n    }\n    \n    \n        \n        \n\nbool change(){\n    for(int i=1;i<=s[0];i++)\n    {\n        if(s[i]!=s[s[0]+1-i]) return false;\n    }\n    return true;\n}\nvoid print(){\n    for(int i=s[0];i>=1;i--)\n    {\n        if(s[i]<=9) cout<<s[i];\n        else cout<<(char)(s[i]-10+'A');\n    }\n}\nint main()\n    {\n    cin>>n;\n    for(int i=1;i<=300;i++)\n    {//从1-300进行循环\n        jinzhi(i*i,n);//调用函数\n        if(change()){\n            jinzhi(i,n);\n            print();\n            cout<<' ';\n            jinzhi(i*i,n);\n            print();\n            puts(\""\"");\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,30,540
1279444461254279168,bcb3ff810e5a0484ae0550949ab982695da1f921da2e0407850a5ce7faddd0d1,2020-07-04 23:58:25,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>//万能头\nusing namespace std;\nint n;\nint s[301];\nvoid jinzhi(int a,int b){\n    int m;\n    cin>>a;\n    while(a){\n        s[m++] = a%b;\n        a=a/b;\n        \n    }\n    s[m]=a;;\n    for (int i=m;i>=0;i--)\n        s[i]=s[m];\n    }\n    \n    \n        \n        \n\nbool change(){\n    for(int i=1;i<=s[0];i++)\n    {\n        if(s[i]!=s[s[0]+1-i]) return false;\n    }\n    return true;\n}\nvoid print(){\n    for(int i=s[0];i>=1;i--)\n    {\n        if(s[i]<=9) cout<<s[i];\n        else cout<<(char)(s[i]-10+'A');\n    }\n}\nint main()\n    {\n    cin>>n;\n    for(int i=1;i<=300;i++)\n    {//从1-300进行循环\n        jinzhi(i*i,n);//调用函数\n        if(change()){\n            jinzhi(i,n);\n            print();\n            cout<<' ';\n            jinzhi(i*i,n);\n            print();\n            puts(\""\"");\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,35,516
1279444624576274432,7707b0ad9538c4a22483a8a70fccc59fe2b1c309e308bd4058b49b821e876909,2020-07-04 23:59:04,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <stdio.h>\nusing namespace std;\nint b, i, k;\nint a[1000];\nbool pd(int x)\n{\n    int s, i;\n    s = x;\n    i = 0;\n    while (s != 0)\n    {\n        i++;\n        a[i] = s % b;\n        s = s / b;\n    }\n    k = i;\n    for (int j = 1;j <= i / 2 + 1;j++)\n        if (a[j] != a[i - j + 1]) return(false);\n    return(true);\n}\nvoid br(int x)\n{\n    if (x == 0) return;\n    br(x / b);\n    if (x % b <= 9) printf(\""%d\"", x % b);\n    else printf(\""%c\"", x % b + 55);\n}\nint main()\n{\n    cin >> b;\n    for (i = 1;i <= 300;i++)\n    {\n        if (pd(i * i))\n        {\n            br(i);\n            printf(\""%s\"", \"" \"");\n            br(i*i);\n            printf(\""\\n\"");\n        }\n    }\n}\n",ACCEPTED,32,512
1279445367853080576,bcb3ff810e5a0484ae0550949ab982695da1f921da2e0407850a5ce7faddd0d1,2020-07-05 00:02:01,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <algorithm>\n\nusing namespace std;\n\nint n, s,num;\n\nbool check(int x, int jinzhi)\n{\n    int a[10000],i = 0;\n    while (x)\n    {\n        a[++i] = x % jinzhi;\n        x /= jinzhi;\n    }\n    int t = i;\n    while (i && a[i] == a[t - i + 1])\n        i--;\n    if (i == 0)\n        return true;\n    return false;\n}",COMPILE_ERROR,0,0
1279445763321421824,7707b0ad9538c4a22483a8a70fccc59fe2b1c309e308bd4058b49b821e876909,2020-07-05 00:03:35,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nint B,c;\nint a[10001], b[10001];\nvoid change(int m)\n{\n\tint i = 0;\n\twhile (m> 0)\n\t{\n\t\tb[++i] = m % B;\n\t\tm = m / B;\n\t}\n\tc = i;\n\tfor (i = c;i > 0;i--)\n\t{\n\t\tif (b[i] > 9)\n\t\t\tb[i] = b[i] - 10 + 'A';\n\t}\n\tfor (i = c;i > 0;i--)\n\t\ta[i] = b[c + 1 - i];\n}\nbool check(int m)\n{\n\tint flag = 0;\n\tchange(m);\n\tif (c == 1)\n\t\tflag = 1;\n\telse\n\t{\n\t\tfor (int i = 1;i <= c / 2;i++)\n\t\t{\n\t\t\tif (a[i] == a[c + 1 - i])\n\t\t\t{\n\t\t\t\tflag = 1;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tflag = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tif (flag == 1)\n\t\treturn true;\n\telse\n\t\treturn false;\n\n}\nint main()\n{\n\tint m, n;\n\tcin >> B;\n\tfor (m = 1;m <= 300;m++)\n\t{\n\t\tn = m * m;\n\t\tif (check(n))\n\t\t{\n\t\t\tchange(m);\n\t\t\tfor (int j = 1;j <= c;j++)\n\t\t\t{\n\t\t\t\tcout << a[j];\n\t\t\t}\n\t\t\tcout << \"" \"";\n\t\t\tchange(n);\n\t\t\tfor (int j = 1;j <= c;j++)\n\t\t\t{\n\t\t\t\tcout << a[j];\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\t\t\n\t}\n}",PARTIAL_ACCEPTED,37,424
1279447325758390272,8e1fa00181ab686131c09af695061d99ee5d3f9f9fc9bc9c35ea80549c8df064,2020-07-05 00:09:48,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nint rreverse(string);\nint main()\n{\n\tchar ch[10] = { '0','1','2','3','4','5','6','7','8','9' };\n\tint n, s;\n\tcin >> n >> s;\n\tint num = 0;\n\tfor (int i = s + 1; i < 10000; i++)\n\t{\n\t\tint k = 0;\n\t\tfor (int j = 2; j < 11; j++)\n\t\t{\n\t\t\tint m;\n            int t = i;\n\t\t\tstring arr;\n\t\t\twhile (t != 0)\n\t\t\t{\n\t\t\t\tm = t % j;\n\t\t\t\tt = t / j;\n\t\t\t\tarr += ch[m];\n\t\t\t}\n\t\t\tif (rreverse(arr))\n\t\t\t\tk += 1;\n\t\t\tif (k > 2)\n\t\t\t{\n\t\t\t\tcout << i << endl;\n\t\t\t\tnum += 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (num == n)\n\t\t\tbreak;\n\t}\n\treturn 0;\n}\nint rreverse(string str)\n{\n\tint s = str.size();\n\tfor (int i = 0; i < s; i++)\n\t{\n\t\tif (str[i] != str[s - 1 - i])\n\t\t\treturn 0;\n\t}\n\treturn 1;\n}",PARTIAL_ACCEPTED,43,392
1279447519392620544,8e1fa00181ab686131c09af695061d99ee5d3f9f9fc9bc9c35ea80549c8df064,2020-07-05 00:10:34,C++,60.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nint rreverse(string);\nint main()\n{\n\tchar ch[10] = { '0','1','2','3','4','5','6','7','8','9' };\n\tint n, s;\n\tcin >> n >> s;\n\tint num = 0;\n\tfor (int i = s + 1; i < 10000; i++)\n\t{\n\t\tint k = 0;\n\t\tfor (int j = 2; j < 11; j++)\n\t\t{\n\t\t\tint m;\n\t\t\tint t = i;\n\t\t\tstring arr;\n\t\t\twhile (t != 0)\n\t\t\t{\n\t\t\t\tm = t % j;\n\t\t\t\tt = t / j;\n\t\t\t\tarr += ch[m];\n\t\t\t}\n\t\t\tif (rreverse(arr))\n\t\t\t\tk += 1;\n\t\t\tif (k > 1)\n\t\t\t{\n\t\t\t\tcout << i << endl;\n\t\t\t\tnum += 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (num == n)\n\t\t\tbreak;\n\t}\n\treturn 0;\n}\nint rreverse(string str)\n{\n\tint s = str.size();\n\tfor (int i = 0; i < s; i++)\n\t{\n\t\tif (str[i] != str[s - 1 - i])\n\t\t\treturn 0;\n\t}\n\treturn 1;\n}",PARTIAL_ACCEPTED,30,440
1279447950239916032,7707b0ad9538c4a22483a8a70fccc59fe2b1c309e308bd4058b49b821e876909,2020-07-05 00:12:16,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nint B, c;\nint a[100], b[100];\nvoid change(int m)\n{\n\tint i = 0;\n\twhile (m > 0)\n\t{\n\t\tb[++i] = m % B;\n\t\tm = m / B;\n\t}\n\tc = i;\n\tfor (i = c;i > 0;i--)\n\t{\n\t\tif (b[i] > 9)\n\t\t\tb[i] = b[i] - 10 + 'A';\n\t}\n\tfor (i = c;i > 0;i--)\n\t\ta[i] = b[c + 1 - i];\n}\nbool check(int m)\n{\n\tint flag = 0;\n\tchange(m);\n\tif (c == 1)\n\t\tflag = 1;\n\telse\n\t{\n\t\tfor (int i = 1;i <= c / 2;i++)\n\t\t{\n\t\t\tif (a[i] == a[c + 1 - i])\n\t\t\t{\n\t\t\t\tflag = 1;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tflag = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tif (flag == 1)\n\t\treturn true;\n\telse\n\t\treturn false;\n\n}\nint main()\n{\n\tint m, n;\n\tcin >> B;\n\tfor (m = 1;m <= 300;m++)\n\t{\n\t\tn = m * m;\n\t\tif (check(n))\n\t\t{\n\t\t\tchange(m);\n\t\t\tfor (int j = 1;j <= c;j++)\n\t\t\t{\n\t\t\t\tif (a[j] > 9)\n\t\t\t\t\tprintf(\""%c\"", a[j]);\n\t\t\t\telse\n\t\t\t\t\tcout << a[j];\n\t\t\t}\n\t\t\tcout << \"" \"";\n\t\t\tchange(n);\n\t\t\tfor (int j = 1;j <= c;j++)\n\t\t\t{\n\t\t\t\tif (a[j] > 9)\n\t\t\t\t\tprintf(\""%c\"", a[j]);\n\t\t\t\telse\n\t\t\t\t\tcout << a[j];\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n}",ACCEPTED,32,424
1279448009006309376,8e1fa00181ab686131c09af695061d99ee5d3f9f9fc9bc9c35ea80549c8df064,2020-07-05 00:12:31,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nint rreverse(string);\nint main()\n{\n\tchar ch[10] = { '0','1','2','3','4','5','6','7','8','9' };\n\tint n, s;\n\tcin >> n >> s;\n\tint num = 0;\n\tfor (int i = s + 1;; i++)\n\t{\n\t\tint k = 0;\n\t\tfor (int j = 2; j < 11; j++)\n\t\t{\n\t\t\tint m;\n\t\t\tint t = i;\n\t\t\tstring arr;\n\t\t\twhile (t != 0)\n\t\t\t{\n\t\t\t\tm = t % j;\n\t\t\t\tt = t / j;\n\t\t\t\tarr += ch[m];\n\t\t\t}\n\t\t\tif (rreverse(arr))\n\t\t\t\tk += 1;\n\t\t\tif (k > 1)\n\t\t\t{\n\t\t\t\tcout << i << endl;\n\t\t\t\tnum += 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (num == n)\n\t\t\tbreak;\n\t}\n\treturn 0;\n}\nint rreverse(string str)\n{\n\tint s = str.size();\n\tfor (int i = 0; i < s; i++)\n\t{\n\t\tif (str[i] != str[s - 1 - i])\n\t\t\treturn 0;\n\t}\n\treturn 1;\n}",ACCEPTED,35,484
1279450934474629120,2b459d8523bd56b3eea253cb0aa60960cf250af00cd3fc924e9e1019943a0492,2020-07-05 00:24:08,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<stdlib.h>\n\n\nusing namespace std;\n\nint judge(int i);\nint myprint(int i);\nint n;\nint lena=0;\nint lenb=0;\nint a[100000]={0};\nint b[1000]={0};\nchar chr[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nint main(){\n\tcin>>n;\n\tfor(int i=1;i<=300;i++)\n\t{\n\t\tif(judge(i*i))\n\t\t{\n\t\t\tmyprint(i);\n\t\t}\n\t}\n\n\tsystem(\""pause\"");\n\treturn 0;\n}\nint judge(int i){\n\twhile(i/n)\n\t{\n\t\ta[lena++]=i/n;\n\t}\n\ta[lena]=i%n;\n\tfor(int j=0;j<=lena/2;j++)\n\t\tif(a[j]!=a[lena-j])\n\t\t\treturn 0;\n\t\telse\n\t\t\treturn 1;\n}\nint myprint(int i){\n\twhile(i/n)\n\t{\n\t\tb[lenb++]=i/n;\n\t}\n\tb[lenb]=i%n;\n\tfor(int u=0;u<=lenb;u++)\n\t\tcout<<chr[b[u]];\n\tcout<<ends;\n\tfor(int u=0;u<=lena;u++)\n\t\tcout<<chr[a[u]];\n\tcout<<endl;\n\treturn 0;\n}",SEGMENTATION_FAULT,39,808
1279451120806584320,2b459d8523bd56b3eea253cb0aa60960cf250af00cd3fc924e9e1019943a0492,2020-07-05 00:24:52,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<stdlib.h>\n\n\nusing namespace std;\n\nint judge(int i);\nint myprint(int i);\nint n;\nint lena=0;\nint lenb=0;\nint a[100000]={0};\nint b[1000]={0};\nchar chr[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nint main(){\n\tcin>>n;\n\tfor(int i=1;i<=300;i++)\n\t{\n\t\tif(judge(i*i))\n\t\t{\n\t\t\tmyprint(i);\n\t\t}\n\t}\n\n\n\treturn 0;\n}\nint judge(int i){\n\twhile(i/n)\n\t{\n\t\ta[lena++]=i/n;\n\t}\n\ta[lena]=i%n;\n\tfor(int j=0;j<=lena/2;j++)\n\t\tif(a[j]!=a[lena-j])\n\t\t\treturn 0;\n\t\telse\n\t\t\treturn 1;\n}\nint myprint(int i){\n\twhile(i/n)\n\t{\n\t\tb[lenb++]=i/n;\n\t}\n\tb[lenb]=i%n;\n\tfor(int u=0;u<=lenb;u++)\n\t\tcout<<chr[b[u]];\n\tcout<<ends;\n\tfor(int u=0;u<=lena;u++)\n\t\tcout<<chr[a[u]];\n\tcout<<endl;\n\treturn 0;\n}",SEGMENTATION_FAULT,43,1024
1279451879367434240,64924f1d7e0fb72ee402c548a3ca9387fc5ad2a42c92a9c70eaca218c1fe5da9,2020-07-05 00:27:53,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<math.h> \nusing namespace std;\nint n,y;\nint t=1;\nint x=0;\nchar zhuanhuahou[300];\nchar zhuanhuahou0[300];\nchar a[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nint main()\n{\n    cin>>n;\n    for(int i=1;i<=300;i++)\n    {\n        y=i;\n        while(y>0)\n        {\n            zhuanhuahou0[x]=a[y%n];\n            y/=n;\n            x++;\n        }\n        y=i*i;\n        x=0;\n        while(y>0)\n        {\n            zhuanhuahou[x]=a[y%n];\n            y/=n;\n            x++;\n        }\n        \n      \tfor(int j=0;j<x/2;j++)    \n\t\t{        \n\t\tif(zhuanhuahou[j]!=zhuanhuahou[i-j+1])        {       t=0;       break;        }    \n        }\n        \n        if(t==1){   \n\t\t\t for(int h=0;h<x;h++) {\n\t\tcout<<zhuanhuahou0[h];}    \n\t \t\tcout<<\"" \"";     \n\t      for(int h=0;h<x;h++) {\n\t    \t\tcout<<zhuanhuahou[h];}    \n\t \t\tcout<<endl;     \n\t\t\t }       \n\t\t\n            \n\t\t}\n    \n    }\n",WRONG_ANSWER,40,512
1279451885554032640,2b459d8523bd56b3eea253cb0aa60960cf250af00cd3fc924e9e1019943a0492,2020-07-05 00:27:55,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<stdlib.h>\n\n\nusing namespace std;\n\nint judge(int i);\nint myprint(int i);\nint n;\nint lena=0;\nint lenb=0;\nint a[100000]={0};\nint b[1000]={0};\nchar chr[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nint main(){\n\tcin>>n;\n\tfor(int i=1;i<=300;i++)\n\t{\n\t\tif(judge(i*i))\n\t\t{\n\t\t\tmyprint(i);\n\t\t}\n\t}\n\n\n\treturn 0;\n}\nint judge(int i){\n    lena=0;\n\twhile(i/n)\n\t{\n\t\ta[lena++]=i/n;\n\t}\n\ta[lena]=i%n;\n\tfor(int j=0;j<=lena/2;j++)\n\t\tif(a[j]!=a[lena-j])\n\t\t\treturn 0;\n\t\telse\n\t\t\treturn 1;\n}\nint myprint(int i){\n    lenb=0;\n\twhile(i/n)\n\t{\n\t\tb[lenb++]=i/n;\n\t}\n\tb[lenb]=i%n;\n\tfor(int u=0;u<=lenb;u++)\n\t\tcout<<chr[b[u]];\n\tcout<<ends;\n\tfor(int u=0;u<=lena;u++)\n\t\tcout<<chr[a[u]];\n\tcout<<endl;\n\treturn 0;\n}",SEGMENTATION_FAULT,47,1012
1279456021641093120,bcb3ff810e5a0484ae0550949ab982695da1f921da2e0407850a5ce7faddd0d1,2020-07-05 00:44:21,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"using namespace std;\n#include<bits/stdc++.h>\nusing namespace std;\n#define n 300\n\nint b;\nint a[n];\n\nvoid transform(int x)\n{\n    int s[n];\n    int i = 0;\n    \n    while (i){\n        \n        if (s[i] >=10)\n            cout<<s[i] - 10 + 'A';\n        else\n            cout<<s[i];\n        i--;\n    }\n    while (x > 0){\n        \n        s[++i] = x % b;\n        x = x/b;\n    }\n}\n\nvoid huiwen(int x1)\n{\n    int temp = 0;\n    int x = x1 * x1;\n    while (x > 0){\n    \n        a[++temp] = x % b;\n        x = x/b;\n    }\n    int t = temp, i = temp;\n    while (i > 0 && a[i] == a[t - i + 1])\n        i--;\n    if (i == 0)\n    {\n        transform(x1);\n        cout<<\"" \""<<endl;\n        while (temp){\n        \n            if (a[temp] < 10)\n                cout<<a[temp];\n            else\n                cout<<a[temp] - 10 + 'A';\n            temp--;\n        }\n        cout<<\""\\n\""<<endl;\n    }\n}\n\nint main()\n{\n    cin>>b;\n    for (int i = 1; i <= n; i++)\n        huiwen(i);\n\n    return 0;\n}",WRONG_ANSWER,41,516
1279457527429783552,64924f1d7e0fb72ee402c548a3ca9387fc5ad2a42c92a9c70eaca218c1fe5da9,2020-07-05 00:50:20,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<math.h> \nusing namespace std;\nint n,y,z;\nint t=1;\nint x=1;\nchar zhuanhuahou[300];\nchar zhuanhuahou0[300];\nchar a[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nint main()\n{\n    cin>>n;\n    for(int i=1;i<=300;i++)\n    {\n        y=i;\n        while(y>0)\n        {\n            zhuanhuahou0[x]=a[y%n];\n            y/=n;\n            x++;\n        }\n        z=x;\n        y=i*i;\n        x=1;\n        while(y>0)\n        {\n            zhuanhuahou[x]=a[y%n];\n            y/=n;\n            x++;\n        }\n        x--;\n      \tfor(int j=1;j<=x/2;j++)    \n\t\t{        \n\t\tif(zhuanhuahou[j]!=zhuanhuahou[x-j+1])        {       t+=1;            }    \n        }\n        \n        if(t==1){   \n\t\t\t for(int h=1;h<z;h++) {\n\t\tcout<<zhuanhuahou0[h];}    \n\t \t\tcout<<\"" \"";     \n\t      for(int h=1;h<=x;h++) {\n\t    \t\tcout<<zhuanhuahou[h];}    \n\t \t\tcout<<endl;     \n\t\t\t }   \n\t\tx=1;\n\t\tt=1;    \n\t\t\n            \n\t\t}\n    \n    }",PARTIAL_ACCEPTED,41,488
1279457623848452096,64924f1d7e0fb72ee402c548a3ca9387fc5ad2a42c92a9c70eaca218c1fe5da9,2020-07-05 00:50:43,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<math.h> \nusing namespace std;\nint n,y,z;\nint t=1;\nint x=1;\nchar zhuanhuahou[300];\nchar zhuanhuahou0[300];\nchar a[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nint main()\n{\n    cin>>n;\n    for(int i=1;i<=300;i++)\n    {\n        y=i;\n        while(y>0)\n        {\n            zhuanhuahou0[x]=a[y%n];\n            y/=n;\n            x++;\n        }\n        z=x;\n        y=i*i;\n        x=1;\n        while(y>0)\n        {\n            zhuanhuahou[x]=a[y%n];\n            y/=n;\n            x++;\n        }\n        x--;\n      \tfor(int j=1;j<=x/2;j++)    \n\t\t{        \n\t\tif(zhuanhuahou[j]!=zhuanhuahou[x-j+1])        {       t+=1;            }    \n        }\n        \n        if(t==1){   \n\t\t\t for(int h=1;h<z;h++) {\n\t\tcout<<zhuanhuahou0[h];}    \n\t \t\tcout<<\"" \"";     \n\t      for(int h=1;h<=x;h++) {\n\t    \t\tcout<<zhuanhuahou[h];}    \n\t \t\tcout<<endl;     \n\t\t\t }   \n\t\tx=1;\n\t\tt=1;    \n\t\t\n            \n\t\t}\n    \n    }",PARTIAL_ACCEPTED,25,424
1279458063075966976,64924f1d7e0fb72ee402c548a3ca9387fc5ad2a42c92a9c70eaca218c1fe5da9,2020-07-05 00:52:28,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<math.h> \nusing namespace std;\nint n,y,z;\nint t=1;\nint x=1;\nchar zhuanhuahou[300];\nchar zhuanhuahou0[300];\nchar a[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nint main()\n{\n    cin>>n;\n    for(int i=1;i<=300;i++)\n    {\n        y=i;\n        while(y>0)\n        {\n            zhuanhuahou0[x]=a[y%n];\n            y/=n;\n            x++;\n        }\n        z=x;\n        y=i*i;\n        x=1;\n        while(y>0)\n        {\n            zhuanhuahou[x]=a[y%n];\n            y/=n;\n            x++;\n        }\n        x--;\n      \tfor(int j=1;j<=x/2;j++)    \n\t\t{        \n\t\tif(zhuanhuahou[j]!=zhuanhuahou[x-j+1])        {       t+=1;            }    \n        }\n        \n        if(t==1){   \n\t\t\t for(int h=z-1;h>=1;h--) {\n\t\tcout<<zhuanhuahou0[h];}    \n\t \t\tcout<<\"" \"";     \n\t      for(int h=1;h<=x;h++) {\n\t    \t\tcout<<zhuanhuahou[h];}    \n\t \t\tcout<<endl;     \n\t\t\t }   \n\t\tx=1;\n\t\tt=1;    \n\t\t\n            \n\t\t}\n    \n    }",ACCEPTED,42,548
1279458459882283008,2b459d8523bd56b3eea253cb0aa60960cf250af00cd3fc924e9e1019943a0492,2020-07-05 00:54:02,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<stdlib.h>\n\n\nusing namespace std;\n\nint judge(int i);\nint myprint(int i);\nint n;\nint lena=0;\nint lenb=0;\nint a[100000]={0};\nint b[1000]={0};\nchar chr[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nint main(){\n\tcin>>n;\n\tfor(int i=1;i<=300;i++)\n\t{\n\t\tif(judge(i*i))\n\t\t{\n\t\t\tmyprint(i);\n\t\t}\n\t}\n\n\n\treturn 0;\n}\nint judge(int i){\n\tlena=0;\n\twhile(i/n)\n\t{\n\t\ta[lena++]=i%n;\n\t\ti/=n;\n\t}\n\ta[lena]=i%n;\n\tfor(int j=0;j<=lena;j++)\n\t\tif(a[j]!=a[lena-j])\n\t\t\treturn 0;\n\t\treturn 1;\n}\nint myprint(int i){\n\tlenb=0;\n\twhile(i/n)\n\t{\n\t\tb[lenb++]=i%n;\n\t\ti/=n;\n\t}\n\tb[lenb]=i%n;\n\tfor(int u=lenb;u>=0;u--)\n\t\tcout<<chr[b[u]];\n\tcout<<ends;\n\tfor(int u=0;u<=lena;u++)\n\t\tcout<<chr[a[u]];\n\tcout<<endl;\n\treturn 0;\n}",WRONG_ANSWER,50,400
1279458698743701504,64924f1d7e0fb72ee402c548a3ca9387fc5ad2a42c92a9c70eaca218c1fe5da9,2020-07-05 00:54:59,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<math.h> \nusing namespace std;\nint n,y,z;\nint t=1;\nint x=1;\nchar zhuanhuahou[300];\nchar zhuanhuahou0[300];\nchar a[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nint main()\n{\n    cin>>n;\n    for(int i=1;i<=300;i++)\n    {\n        y=i;\n        while(y>0)\n        {\n            zhuanhuahou0[x]=a[y%n];\n            y/=n;\n            x++;\n        }\n        z=x;\n        y=i*i;\n        x=1;\n        while(y>0)\n        {\n            zhuanhuahou[x]=a[y%n];\n            y/=n;\n            x++;\n        }\n        x--;\n      \tfor(int j=1;j<=x/2;j++)    \n\t\t{        \n\t\tif(zhuanhuahou[j]!=zhuanhuahou[x-j+1])        {       t+=1;            }    \n        }\n        \n        if(t==1){   \n\t\t\t for(int h=z-1;h>=1;h--) {\n\t\tcout<<zhuanhuahou0[h];}    \n\t \t\tcout<<\"" \"";     \n\t      for(int h=1;h<=x;h++) {\n\t    \t\tcout<<zhuanhuahou[h];}    \n\t \t\tcout<<endl;     \n\t\t\t }   \n\t\tx=1;\n\t\tt=1;    \n\t\t\n            \n\t\t}\n    \n    }",ACCEPTED,45,512
1279459195928109056,d5c70f9f0b08a91158e577b0502181fa0f52375b7c5ef057b22a6ed756432e03,2020-07-05 00:56:58,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint judge(int n, int B);\n\tint B, i, m, j,n;\n\tn = 0;\n\tstring s1, s2;\n\tchar c;\n\tcin >> B;\n\tfor (i = 1; i <= 300; i++)\n\t{\n\t\tj = i * i;\n\t\tn = i;\n\t\tm = judge(j, B);\n\t\tif (m == 1)\n\t\t{\n\t\t\twhile (n != 0)\n\t\t\t{\n\t\t\t\tif (n % B > 9)\n\t\t\t\t{\n\t\t\t\t\tc = (n % B) + 55;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tc = (n % B) + 48;\n\t\t\t\t}\n\t\t\t\tn = n / B;\n\t\t\t\ts1+= c;\n\t\t\t}\n\t\t\tcout << s1;\n\t\t\ts1 = \""\"";\n\t\t\twhile (j != 0)\n\t\t\t{\n\t\t\t\tif (j% B > 9)\n\t\t\t\t{\n\t\t\t\t\tc = (j % B) + 55;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tc = (j % B) + 48;\n\t\t\t\t}\n\t\t\t\tj= j/ B;\n\t\t\t\ts2 += c;\n\t\t\t}\n\t\t\tcout << \"" \"" << s2 << endl;\n\t\t\ts2 = \""\"";\n\t\t}\n\t}\n}\nint judge(int m, int B)\n{\n\tint k=0;\n\tint a[20];\n\tfor (int i = 0; i < 20; i++)\n\t{\n\t\ta[i]  = m % B;\n\t\tm = m / B;\n\t\tif (m == 0)\n\t\t{\n\t\t\tk = i;\n\t\t\tbreak;\n\t\t}\n\t}\n\tfor (int i = 0; i < k; i++)\n\t{\n\t\tif (a[i]!= a [ k- i])\n\t\t\treturn 0;\n\t}\n\treturn 1;\n}",PARTIAL_ACCEPTED,33,424
1279459323120377856,bcb3ff810e5a0484ae0550949ab982695da1f921da2e0407850a5ce7faddd0d1,2020-07-05 00:57:28,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n#define n  300\nint b,a[n];\n\nvoid transform(int x)\n{\n    int a1[n];\n    int i = 0;\n    while (x > 0)\n    {\n        a1[++i] = x % b;\n        x = x / b;\n    }\n    while (i)\n    {\n        if (a1[i] >= 10)\n            cout<< a1[i]- 10 + 'A';\n        else\n            cout<<a1[i];\n\n        i--;\n    }\n}\n\nvoid huiwen(int x1)\n{\n    int temp = 0;\n    int x = x1 * x1;\n    while (x > 0)\n    {\n        a[++temp] = x % b;\n        x = x /b;\n    }\n    int t = temp, i = temp;\n    while (i > 0 && a[i] == a[t - i + 1])\n        i--;\n    if (i == 0)\n    {\n        transform(x1);\n        cout<<\"" \"";\n        while (temp)\n        {\n            if (a[temp] >= 10)\n                cout<<a[temp]- 10 + 'A';\n            else\n                cout<<a[temp];\n\n            temp--;\n        }\n        cout<<\""\\n\"";\n    }\n}\n\nint main()\n{\n    cin>>b;\n    for (int i = 1; i <= n; i++)\n        huiwen(i);\n\n    return 0;\n}",PARTIAL_ACCEPTED,30,424
1279459441521385472,d5c70f9f0b08a91158e577b0502181fa0f52375b7c5ef057b22a6ed756432e03,2020-07-05 00:57:56,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint judge(int n, int B);\n\tint B, i, m, j,n;\n\tn = 0;\n\tstring s1, s2;\n\tchar c;\n\tcin >> B;\n\tfor (i = 1; i <= 300; i++)\n\t{\n\t\tj = i * i;\n\t\tn = i;\n\t\tm = judge(j, B);\n\t\tif (m == 1)\n\t\t{\n\t\t\twhile (n != 0)\n\t\t\t{\n\t\t\t\tif (n % B > 9)\n\t\t\t\t{\n\t\t\t\t\tc = (n % B) + 55;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tc = (n % B) + 48;\n\t\t\t\t}\n\t\t\t\tn = n / B;\n\t\t\t\ts1+= c;\n\t\t\t}\n\t\t\tcout << s1;\n\t\t\ts1 = \""\"";\n\t\t\twhile (j != 0)\n\t\t\t{\n\t\t\t\tif (j% B > 9)\n\t\t\t\t{\n\t\t\t\t\tc = (j % B) + 55;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tc = (j % B) + 48;\n\t\t\t\t}\n\t\t\t\tj= j/ B;\n\t\t\t\ts2 += c;\n\t\t\t}\n\t\t\tcout << \"" \"" << s2 << endl;\n\t\t\ts2 = \""\"";\n\t\t}\n\t}\n}\nint judge(int m, int B)\n{\n\tint k=0;\n\tint a[20];\n\tfor (int i = 0; i < 20; i++)\n\t{\n\t\ta[i]  = m % B;\n\t\tm = m / B;\n\t\tif (m == 0)\n\t\t{\n\t\t\tk = i;\n\t\t\tbreak;\n\t\t}\n\t}\n\tfor (int i = 0; i < k; i++)\n\t{\n\t\tif (a[i]!= a [ k- i])\n\t\t\treturn 0;\n\t}\n\treturn 1;\n}",PARTIAL_ACCEPTED,44,496
1279459498291298304,bcb3ff810e5a0484ae0550949ab982695da1f921da2e0407850a5ce7faddd0d1,2020-07-05 00:58:10,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n#define n  300\nint b,a[n];\n\nvoid transform(int x)\n{\n    int a1[n];\n    int i = 0;\n    while (x > 0)\n    {\n        a1[++i] = x % b;\n        x = x / b;\n    }\n    while (i)\n    {\n        if (a1[i] >= 10)\n            cout<< a1[i]- 10 + 'A';\n        else\n            cout<<a1[i];\n\n        i--;\n    }\n}\n\nvoid huiwen(int x1)\n{\n    int temp = 0;\n    int x = x1 * x1;\n    while (x > 0)\n    {\n        a[++temp] = x % b;\n        x = x /b;\n    }\n    int t = temp, i = temp;\n    while (i > 0 && a[i] == a[t - i + 1])\n        i--;\n    if (i == 0)\n    {\n        transform(x1);\n        cout<<\"" \"";\n        while (temp)\n        {\n            if (a[temp] >= 10)\n                cout<<a[temp]- 10 + 'A';\n            else\n                cout<<a[temp];\n\n            temp--;\n        }\n        cout<<\""\\n\"";\n    }\n}\n\nint main()\n{\n    cin>>b;\n    for (int i = 1; i <= n; i++)\n        huiwen(i);\n\n    return 0;\n}",PARTIAL_ACCEPTED,28,488
1279460068448198656,bcb3ff810e5a0484ae0550949ab982695da1f921da2e0407850a5ce7faddd0d1,2020-07-05 01:00:26,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nconst int n=300;\nint b,a[n];\n\nvoid transform(int x)\n{\n    int a1[n];\n    int i = 0;\n    while (x > 0)\n    {\n        a1[++i] = x % b;\n        x = x / b;\n    }\n    while (i)\n    {\n        if (a1[i] >= 10)\n            cout<< a1[i]- 10 + 'A';\n        else\n            cout<<a1[i];\n\n        i--;\n    }\n}\n\nvoid huiwen(int x1)\n{\n    int temp = 0;\n    int x = x1 * x1;\n    while (x > 0)\n    {\n        a[++temp] = x % b;\n        x = x /b;\n    }\n    int t = temp, i = temp;\n    while (i > 0 && a[i] == a[t - i + 1])\n        i--;\n    if (i == 0)\n    {\n        transform(x1);\n        cout<<\"" \"";\n        while (temp)\n        {\n            if (a[temp] >= 10)\n                cout<<a[temp]- 10 + 'A';\n            else\n                cout<<a[temp];\n\n            temp--;\n        }\n        cout<<\""\\n\"";\n    }\n}\n\nint main()\n{\n    cin>>b;\n    for (int i = 1; i <= n; i++)\n        huiwen(i);\n\n    return 0;\n}",PARTIAL_ACCEPTED,26,508
1279460162694217728,2b459d8523bd56b3eea253cb0aa60960cf250af00cd3fc924e9e1019943a0492,2020-07-05 01:00:48,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<stdlib.h>\n\n\nusing namespace std;\n\nint judge(int i);\nint myprint(int i);\nint n;\nint flag=0;\nint lena=0;\nint lenb=0;\nint a[100000]={0};\nint b[1000]={0};\nchar chr[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nint main(){\n\tcin>>n;\n\tfor(int i=1;i<=300;i++)\n\t{\n\t\tif(judge(i*i))\n\t\t{\n\t\t\tmyprint(i);\n\t\t}\n\t}\n\n\n\treturn 0;\n}\nint judge(int i){\n\tlena=0;\n\twhile(i/n)\n\t{\n\t\ta[lena++]=i%n;\n\t\ti/=n;\n\t}\n\ta[lena]=i%n;\n\tfor(int j=0;j<=lena;j++)\n\t\tif(a[j]!=a[lena-j])\n\t\t\treturn 0;\n\t\treturn 1;\n}\nint myprint(int i){\n\tif(flag==0)\n\t\tflag=1;\n\telse\n\t\tcout<<endl;\n\n\tlenb=0;\n\twhile(i/n)\n\t{\n\t\tb[lenb++]=i%n;\n\t\ti/=n;\n\t}\n\tb[lenb]=i%n;\n\tfor(int u=lenb;u>=0;u--)\n\t\tcout<<chr[b[u]];\n\tcout<<ends;\n\tfor(int u=0;u<=lena;u++)\n\t\tcout<<chr[a[u]];\n\treturn 0;\n}",WRONG_ANSWER,43,512
1279460671261958144,d5c70f9f0b08a91158e577b0502181fa0f52375b7c5ef057b22a6ed756432e03,2020-07-05 01:02:49,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint judge(int n, int B);\n\tint B, i, m, j,n,p;\n\tn = 0;\n\tp = 0;\n\tstring s1, s2;\n\tchar c;\n\tcin >> B;\n\tfor (i =1; i <= 300; i++)\n\t{\n\t\tj = i * i;\n\t\tn = i;\n\t\tm = judge(j, B);\n\t\tif (m == 1)\n\t\t{\n\t\t\twhile (n != 0)\n\t\t\t{\n\t\t\t\tif (n % B > 9)\n\t\t\t\t{\n\t\t\t\t\tc = (n % B) + 55;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tc = (n % B) + 48;\n\t\t\t\t}\n\t\t\t\tn = n / B;\n\t\t\t\ts1+= c;\n\t\t\t\tp++;\n\t\t\t}\n\t\t\twhile (p-- != 0)\n\t\t\t\tcout << s1[p];\n\t\t\ts1 = \""\"";\n\t\t\twhile (j != 0)\n\t\t\t{\n\t\t\t\tif (j% B > 9)\n\t\t\t\t{\n\t\t\t\t\tc = (j % B) + 55;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tc = (j % B) + 48;\n\t\t\t\t}\n\t\t\t\tj= j/ B;\n\t\t\t\ts2 += c;\n\t\t\t}\n\t\t\tcout << \"" \"" << s2 << endl;\n\t\t\ts2 = \""\"";\n\t\t}\n\t}\n}\nint judge(int m, int B)\n{\n\tint k=0;\n\tint a[20];\n\tfor (int i = 0; i < 20; i++)\n\t{\n\t\ta[i]  = m % B;\n\t\tm = m / B;\n\t\tif (m == 0)\n\t\t{\n\t\t\tk = i;\n\t\t\tbreak;\n\t\t}\n\t}\n\tfor (int i = 0; i < k; i++)\n\t{\n\t\tif (a[i]!= a [ k- i])\n\t\t\treturn 0;\n\t}\n\treturn 1;\n}\n",WRONG_ANSWER,32,424
1279461730134982656,2b459d8523bd56b3eea253cb0aa60960cf250af00cd3fc924e9e1019943a0492,2020-07-05 01:07:02,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<stdlib.h>\n\n\nusing namespace std;\n\nint judge(int i);\nint myprint(int i);\nint n;\n//int flag=0;\nint lena=0;\nint lenb=0;\nint a[100000]={0};\nint b[1000]={0};\nchar chr[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nint main(){\n\tcin>>n;\n\tfor(int i=1;i<=300;i++)\n\t{\n\t\tif(judge(i*i))\n\t\t{\n\t\t\tmyprint(i);\n\t\t}\n\t}\n\treturn 0;\n}\nint judge(int i){\n\tlena=0;\n\twhile(i/n)\n\t{\n\t\ta[lena++]=i%n;\n\t\ti/=n;\n\t}\n\ta[lena]=i%n;\n\tfor(int j=0;j<=lena;j++)\n\t\tif(a[j]!=a[lena-j])\n\t\t\treturn 0;\n\t\treturn 1;\n}\nint myprint(int i){\n\t\n\tlenb=0;\n\twhile(i/n)\n\t{\n\t\tb[lenb++]=i%n;\n\t\ti/=n;\n\t}\n\tb[lenb]=i%n;\n\tfor(int u=lenb;u>=0;u--)\n\t\tcout<<chr[b[u]];\n\tcout<<ends;\n\tfor(int u=0;u<=lena;u++)\n\t\tcout<<chr[a[u]];\n\tcout<<endl;\n\treturn 0;\n}",WRONG_ANSWER,40,496
1279462648771436544,d5c70f9f0b08a91158e577b0502181fa0f52375b7c5ef057b22a6ed756432e03,2020-07-05 01:10:41,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint judge(int n, int B);\n\tint B, i, m, j,n,p,k;\n\tn = 0;\n\tstring s1, s2;\n\tchar c;\n\tcin >> B;\n\tfor (i =1; i <= 300; i++)\n\t{\n\t\tj = i * i;\n\t\tn = i;\n\t\tm = judge(j, B);\n\t\tif (m == 1)\n\t\t{\n\t\t\tp = 0;\n\t\t\twhile (n != 0)\n\t\t\t{\n\t\t\t\tif (n % B > 9)\n\t\t\t\t{\n\t\t\t\t\tc = (n % B) + 55;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tc = (n % B) + 48;\n\t\t\t\t}\n\t\t\t\tn = n / B;\n\t\t\t\ts1+= c;\n\t\t\t\tp++;\n\t\t\t}\n\t\t\tfor(k=p;k>=0;k--)\n\t\t\t\tcout << s1[k];\n\t\t\ts1 = \""\"";\n\t\t\twhile (j != 0)\n\t\t\t{\n\t\t\t\tif (j% B > 9)\n\t\t\t\t{\n\t\t\t\t\tc = (j % B) + 55;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tc = (j % B) + 48;\n\t\t\t\t}\n\t\t\t\tj= j/ B;\n\t\t\t\ts2 += c;\n\t\t\t}\n\t\t\tcout << \"" \"" << s2 << endl;\n\t\t\ts2 = \""\"";\n\t\t}\n\t}\n}\nint judge(int m, int B)\n{\n\tint k=0;\n\tint a[20];\n\tfor (int i = 0; i < 20; i++)\n\t{\n\t\ta[i]  = m % B;\n\t\tm = m / B;\n\t\tif (m == 0)\n\t\t{\n\t\t\tk = i;\n\t\t\tbreak;\n\t\t}\n\t}\n\tfor (int i = 0; i < k; i++)\n\t{\n\t\tif (a[i]!= a [ k- i])\n\t\t\treturn 0;\n\t}\n\treturn 1;\n}\n",WRONG_ANSWER,40,640
1279462849791844352,d5c70f9f0b08a91158e577b0502181fa0f52375b7c5ef057b22a6ed756432e03,2020-07-05 01:11:29,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint judge(int n, int B);\n\tint B, i, m, j,n,p,k;\n\tn = 0;\n\tstring s1, s2;\n\tchar c;\n\tcin >> B;\n\tfor (i =1; i <= 300; i++)\n\t{\n\t\tj = i * i;\n\t\tn = i;\n\t\tm = judge(j, B);\n\t\tif (m == 1)\n\t\t{\n\t\t\tp = 0;\n\t\t\twhile (n != 0)\n\t\t\t{\n\t\t\t\tif (n % B > 9)\n\t\t\t\t{\n\t\t\t\t\tc = (n % B) + 55;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tc = (n % B) + 48;\n\t\t\t\t}\n\t\t\t\tn = n / B;\n\t\t\t\ts1+= c;\n\t\t\t\tp++;\n\t\t\t}\n\t\t\tfor(k=p;k>=0;k--)\n\t\t\t\tcout << s1[k];\n\t\t\ts1 = \""\"";\n\t\t\twhile (j != 0)\n\t\t\t{\n\t\t\t\tif (j% B > 9)\n\t\t\t\t{\n\t\t\t\t\tc = (j % B) + 55;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tc = (j % B) + 48;\n\t\t\t\t}\n\t\t\t\tj= j/ B;\n\t\t\t\ts2 += c;\n\t\t\t}\n\t\t\tcout << \"" \"" << s2 << endl;\n\t\t\ts2 = \""\"";\n\t\t}\n\t}\n}\nint judge(int m, int B)\n{\n\tint k=0;\n\tint a[20];\n\tfor (int i = 0; i < 20; i++)\n\t{\n\t\ta[i]  = m % B;\n\t\tm = m / B;\n\t\tif (m == 0)\n\t\t{\n\t\t\tk = i;\n\t\t\tbreak;\n\t\t}\n\t}\n\tfor (int i = 0; i < k; i++)\n\t{\n\t\tif (a[i]!= a [ k- i])\n\t\t\treturn 0;\n\t}\n\treturn 1;\n}\n",WRONG_ANSWER,34,424
1279463881615802368,d5c70f9f0b08a91158e577b0502181fa0f52375b7c5ef057b22a6ed756432e03,2020-07-05 01:15:35,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main()\n{\n\tint judge(int n, int B);\n\tint B, i, m, j,n,p,k;\n\tn = 0;\n\tstring s1, s2;\n\tchar c;\n\tcin >> B;\n\tfor (i =1; i <= 300; i++)\n\t{\n\t\tj = i * i;\n\t\tn = i;\n\t\tm = judge(j, B);\n\t\tif (m == 1)\n\t\t{\n\t\t\tp = 0;\n\t\t\twhile (n != 0)\n\t\t\t{\n\t\t\t\tif (n % B > 9)\n\t\t\t\t{\n\t\t\t\t\tc = (n % B) + 55;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tc = (n % B) + 48;\n\t\t\t\t}\n\t\t\t\tn = n / B;\n\t\t\t\ts1+= c;\n\t\t\t\tp++;\n\t\t\t}\n\t\t\tfor(k=p-1;k>=0;k--)\n\t\t\t\tcout << s1[k];\n\t\t\ts1 = \""\"";\n\t\t\twhile (j != 0)\n\t\t\t{\n\t\t\t\tif (j% B > 9)\n\t\t\t\t{\n\t\t\t\t\tc = (j % B) + 55;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tc = (j % B) + 48;\n\t\t\t\t}\n\t\t\t\tj= j/ B;\n\t\t\t\ts2 += c;\n\t\t\t}\n\t\t\tcout << \"" \"" << s2 << endl;\n\t\t\ts2 = \""\"";\n\t\t}\n\t}\n}\nint judge(int m, int B)\n{\n\tint k=0;\n\tint a[20];\n\tfor (int i = 0; i < 20; i++)\n\t{\n\t\ta[i]  = m % B;\n\t\tm = m / B;\n\t\tif (m == 0)\n\t\t{\n\t\t\tk = i;\n\t\t\tbreak;\n\t\t}\n\t}\n\tfor (int i = 0; i < k; i++)\n\t{\n\t\tif (a[i]!= a [ k- i])\n\t\t\treturn 0;\n\t}\n\treturn 1;\n}\n",ACCEPTED,40,540
1279464871580598272,64924f1d7e0fb72ee402c548a3ca9387fc5ad2a42c92a9c70eaca218c1fe5da9,2020-07-05 01:19:31,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<math.h> \nusing namespace std;\nint n,y,z;\nint t=1;\nint x=1;\nchar zhuanhuahou[300];\nchar zhuanhuahou0[300];\nchar a[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nint main()\n{\n    cin>>n;\n    for(int i=1;i<=300;i++)\n    {\n        y=i;\n        while(y>0)\n        {\n            zhuanhuahou0[x]=a[y%n];\n            y/=n;\n            x++;\n        }\n        z=x;\n        y=i*i;\n        x=1;\n        while(y>0)\n        {\n            zhuanhuahou[x]=a[y%n];\n            y/=n;\n            x++;\n        }\n        x--;\n      \tfor(int j=1;j<=x/2;j++)    \n\t\t{        \n\t\tif(zhuanhuahou[j]!=zhuanhuahou[x-j+1])        {       t+=1;            }    \n        }\n        \n        if(t==1){   \n\t\t\t for(int h=z-1;h>=1;h--) {\n\t\tcout<<zhuanhuahou0[h];}    \n\t \t\tcout<<\"" \"";     \n\t      for(int h=1;h<=x;h++) {\n\t    \t\tcout<<zhuanhuahou[h];}    \n\t \t\tcout<<endl;     \n\t\t\t }   \n\t\tx=1;\n\t\tt=1;    \n\t\t\n            \n\t\t}\n    \n    }",ACCEPTED,26,512
1279466153074679808,bcb3ff810e5a0484ae0550949ab982695da1f921da2e0407850a5ce7faddd0d1,2020-07-05 01:24:36,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n\nint n, s,num;\nbool check(int x, int b)\n{\n    int a[10000],i = 0;\n    while (x)\n    {\n        a[++i] = x % b;\n        x = x /b;\n    }\n    int t = i;\n    while (i && a[i] == a[t - i + 1])\n        i--;\n    if (i == 0)\n        return true;\n    return false;\n}\n\nint main()\n{\n    cin>>n>>s;\n    for (int i = s + 1; num < n; i++)\n    {\n        int temp = 0;\n        for (int j = 2; j <= 10; j++)\n        {\n            if (check(i, j))\n                temp++;\n            if (temp == 2)\n                break;\n        }\n        if (temp == 2)\n        {\n            cout<<i<<endl;\n            num++;\n        }\n    }\n\n    return 0;\n}",ACCEPTED,42,640
1279467265777401856,1817bb666a72aa2533f52bd39de461e38d784dd448094b2a6ba3d0893abf9f28,2020-07-05 01:29:02,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<vector>\nusing namespace std;\nbool palindrome(int n, int b);\nvoid show(int n, int b);\nchar num[20];\nint max = 0;\nvector <int> a[20];\nvector <int> b[20];\nint main()\n{\n\tint b;\n\tcin >> b;\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\tif (palindrome(i*i, b))\n\t\t{\n\t\t\tshow(i, b);\n\t\t\tcout << ' ';\n\t\t\tshow(i*i, b);\n\t\t\tcout << endl;\n\t\t}\n\t}\n\tsystem(\""pause\"");\n\treturn 0;\n}\nbool palindrome(int n,int b)\n{\n\twhile (n)\n\t{\n\t\tnum[max++] = n%b;\n\t\tn /= b;\n\t}\n\tif (n < 0) return false;\n\tint div = 1;\n\twhile (n / div >= 10) div *= 10;\n\tfor (int i = 0; n > 0 && i<(max+1) / 2; i++)\n\t{\n\t\tint first = n / div;\n\t\tint last = n % 10;\n\t\tif (first != last) return false;\n\t\tn = (n % div) / 10;\n\t\tdiv /= 100;\n\t}\n\treturn true;\n}\nvoid show(int n, int b)\n{\n\twhile (n)\n\t{\n\t\tnum[max++] = n%b;\n\t\tn /= b;\n\t}\n\tfor (int i = max-1; i >=0 ; i--)\n\t{\n\t\tcout << num[i];\n\t}\n\tmax = 0;\n}\n",COMPILE_ERROR,0,0
1279467533025861632,1817bb666a72aa2533f52bd39de461e38d784dd448094b2a6ba3d0893abf9f28,2020-07-05 01:30:05,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<vector>\nusing namespace std;\nbool palindrome(int n, int b);\nvoid show(int n, int b);\nchar num[20];\nint max1 = 0;\nvector <int> a[20];\nvector <int> b[20];\nint main()\n{\n\tint b;\n\tcin >> b;\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\tif (palindrome(i*i, b))\n\t\t{\n\t\t\tshow(i, b);\n\t\t\tcout << ' ';\n\t\t\tshow(i*i, b);\n\t\t\tcout << endl;\n\t\t}\n\t}\n\tsystem(\""pause\"");\n\treturn 0;\n}\nbool palindrome(int n,int b)\n{\n\twhile (n)\n\t{\n\t\tnum[max1++] = n%b;\n\t\tn /= b;\n\t}\n\tif (n < 0) return false;\n\tint div = 1;\n\twhile (n / div >= 10) div *= 10;\n\tfor (int i = 0; n > 0 && i<(max1+1) / 2; i++)\n\t{\n\t\tint first = n / div;\n\t\tint last = n % 10;\n\t\tif (first != last) return false;\n\t\tn = (n % div) / 10;\n\t\tdiv /= 100;\n\t}\n\treturn true;\n}\nvoid show(int n, int b)\n{\n\twhile (n)\n\t{\n\t\tnum[max1++] = n%b;\n\t\tn /= b;\n\t}\n\tfor (int i = max1-1; i >=0 ; i--)\n\t{\n\t\tcout << num[i];\n\t}\n\tmax1 = 0;\n}\n",WRONG_ANSWER,40,552
1279478451172474880,cf92d4855910fe09050cdec3375cd8505b0c4bb49d0095b0913759510fb9a7b7,2020-07-05 02:13:28,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nstring tran(int numb, int r) {\n\tchar b[10]{ 'A','B','C','D','E','F','G','H','I','J' };\n\tstring b2 = \""\"";\n\twhile (numb != 0) {\n\t\tint l;\n\t\tl = numb % r;\n\t\tnumb = numb / r;\n\t\tif (l>= 10) \n\t\t\tb2 += b[l % 10];\n\t\telse \n\t\t\tb2 += to_string(l);\n\t}\n\tint len = b2.size();\n\tfor (int i = 0; i < (len / 2); i++) {\n\t\tchar temp = b2[i];\n\t\tb2[i] = b2[len - i - 1];\n\t\tb2[len - i - 1] = temp;\n\t}\n\treturn b2;\n}\nbool t(string num) {\n\tif (num.size() == 1) \n        return true;\n\tint len = num.size();\n\tint count = 0;\n\tfor (int i = 0; i < len; i++) {\n\t\tif (num[i] == num[len - i - 1])\n\t\t\tcount++;\n\t}\n\tif (count == len) \n\t\treturn true;\n\telse\n\t\treturn false;\n}\nint main() {\n\tint a,b,c;\n    a=b=c=0;\n\tcin >> a >> b;\n\tint i = b + 1;\n\twhile (c < a) {\n\t\tint count = 0;\n\t\tfor (int s = 2; s <= 10; s++) {\n\t\t\tbool d = t(tran(i, s));\n\t\t\tif (d)\n\t\t\t\tcount++;\n\t\t}\n\t\tif (count >= 3) {\n\t\t\tcout << i << endl;\n\t\t\tc++;\n\t\t}\n\t\ti++;\n\t}\n}",PARTIAL_ACCEPTED,297,424
1279482698794467328,1817bb666a72aa2533f52bd39de461e38d784dd448094b2a6ba3d0893abf9f28,2020-07-05 02:30:21,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<cmath>\n#include<queue>\n#include<cstdio>\n#include<cctype>\n#include<vector>\n#include<cstring>\n#include<iostream>\n#include<algorithm>\nusing namespace std;\nint B;\nint ans[20];\nbool calc(int x)\n{\n\tint ult = 0;\n\tx = x*x;\n\twhile (x)\n\t{\n\t\tans[++ult] = x%B;\n\t\tx /= B;\n\t}\n\tfor (int i = 1, j = ult; i<j; i++, j--)\n\t\tif (ans[i] != ans[j])\n\t\t\treturn false;\n\treturn true;\n}\nvoid outs(int x)\n{\n\tint np = 0;\n\twhile (x)\n\t{\n\t\tans[++np] = x%B;\n\t\tx /= B;\n\t}\n\tfor (int i = np; i >= 1; i--)\n\t{\n\t\tif (ans[i]>9)\n\t\t\tcout<<ans[i] - 10 + 'A';\n\t\telse printf(\""%d\"", ans[i]);\n\t}\n}\nint main()\n{\n\t//freopen(\""in.txt\"",\""r\"",stdin);\n\tcin>>B;\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\tif (calc(i))\n\t\t{\n\t\t\touts(i);\n\t\t\tprintf(\"" \"");\n\t\t\touts(i*i);\n\t\t\tprintf(\""\\n\"");\n\t\t}\n\t}\n\tsystem(\""pause\"");\n\treturn 0;\n}\n",PARTIAL_ACCEPTED,32,552
1279486649350684672,1817bb666a72aa2533f52bd39de461e38d784dd448094b2a6ba3d0893abf9f28,2020-07-05 02:46:03,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\nint B;\nint a[20];\nvoid change()\n{\n    int max_size=-1;\n    n=n*n;\n    while(n)\n    {\n        a[++max_size]=n%B;\n        n/=B;\n    }\n}\nint judge(int n)\n{\n    void change();\n    for(int i=0;i<max_size;i++)\n        if(a[i]!=a[max_size-i])\n            return 0;\n    return 1;\n}\nvoid show(int x)\n{\n    void change()\n    for(int i=np;i>=1;i--)\n    {\n        if(a[i]>=10)\n            printf(\""%c\"",a[i]-10+'A');\n        else printf(\""%d\"",a[i]);\n    }\n}\nint main()\n{\n    scanf_s(\""%d\"",&B);\n    for(int i=1;i<=300;i++)\n    {\n        if(judge(i))\n        {\n            show(i);\n            printf(\"" \"");\n            show(i*i);\n            printf(\""\\n\"");\n        }\n    }\n\tsystem(\""pause\"");\n    return 0;\n}\n",COMPILE_ERROR,0,0
1279487066574872576,1817bb666a72aa2533f52bd39de461e38d784dd448094b2a6ba3d0893abf9f28,2020-07-05 02:47:43,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\nint B;\nint a[20];\nint max_size=-1;\nvoid change()\n{\n    n=n*n;\n    while(n)\n    {\n        a[++max_size]=n%B;\n        n/=B;\n    }\n}\nint judge(int n)\n{\n    void change();\n    for(int i=0;i<max_size;i++)\n        if(a[i]!=a[max_size-i])\n            return 0;\n    return 1;\n}\nvoid show(int x)\n{\n    void change()\n    for(int i=np;i>=1;i--)\n    {\n        if(a[i]>=10)\n            printf(\""%c\"",a[i]-10+'A');\n        else printf(\""%d\"",a[i]);\n    }\n}\nint main()\n{\n    scanf_s(\""%d\"",&B);\n    for(int i=1;i<=300;i++)\n    {\n        if(judge(i))\n        {\n            show(i);\n            printf(\"" \"");\n            show(i*i);\n            printf(\""\\n\"");\n            max_size=-1;\n        }\n    }\n\tsystem(\""pause\"");\n    return 0;\n}\n",COMPILE_ERROR,0,0
1279487233889853440,1817bb666a72aa2533f52bd39de461e38d784dd448094b2a6ba3d0893abf9f28,2020-07-05 02:48:22,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\nint B;\nint a[20];\nint max_size=-1;\nvoid change()\n{\n    n=n*n;\n    while(n)\n    {\n        a[++max_size]=n%B;\n        n/=B;\n    }\n}\nint judge(int n)\n{\n    void change();\n    for(int i=0;i<max_size;i++)\n        if(a[i]!=a[max_size-i])\n            return 0;\n    return 1;\n}\nvoid show(int x)\n{\n    void change()\n    for(int i=np;i>=1;i--)\n    {\n        if(a[i]>=10)\n            printf(\""%c\"",a[i]-10+'A');\n        else printf(\""%d\"",a[i]);\n    }\n}\nint main()\n{\n    scanf_s(\""%d\"",&B);\n    for(int i=1;i<=300;i++)\n    {\n        if(judge(i))\n        {\n            show(i);\n            printf(\"" \"");\n            show(i*i);\n            printf(\""\\n\"");\n            max_size=-1;\n        }\n    }\n\tsystem(\""pause\"");\n    return 0;\n}\n",COMPILE_ERROR,0,0
1279487772547538944,1817bb666a72aa2533f52bd39de461e38d784dd448094b2a6ba3d0893abf9f28,2020-07-05 02:50:31,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\nint B;\nint a[20];\nint judge(int n)\n{\n    int max_size=-1;\n    n=n*n;\n    while(n)\n    {\n        a[++max_size]=n%B;\n        n/=B;\n    }\n    for(int i=0;i<max_size;i++)\n        if(a[i]!=a[max_size-i])\n            return 0;\n    return 1;\n}\nvoid show(int x)\n{\n    int max_size=0;\n    while(x)\n    {\n        a[++max_size]=x%B;\n        x/=B;\n    }\n    for(int i=max_size;i>=1;i--)\n    {\n        if(a[i]>9)\n            printf(\""%c\"",a[i]-10+'A');\n        else printf(\""%d\"",a[i]);\n    }\n}\nint main()\n{\n    scanf_s(\""%d\"",&B);\n    for(int i=1;i<=300;i++)\n    {\n        if(judge(i))\n        {\n            show(i);\n            printf(\"" \"");\n            show(i*i);\n            printf(\""\\n\"");\n        }\n    }\n\tsystem(\""pause\"");\n    return 0;\n}\n",COMPILE_ERROR,0,0
1279487888536829952,1817bb666a72aa2533f52bd39de461e38d784dd448094b2a6ba3d0893abf9f28,2020-07-05 02:50:59,C,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\nint B;\nint a[20];\nint judge(int n)\n{\n    int max_size=-1;\n    n=n*n;\n    while(n)\n    {\n        a[++max_size]=n%B;\n        n/=B;\n    }\n    for(int i=0;i<max_size;i++)\n        if(a[i]!=a[max_size-i])\n            return 0;\n    return 1;\n}\nvoid show(int x)\n{\n    int max_size=0;\n    while(x)\n    {\n        a[++max_size]=x%B;\n        x/=B;\n    }\n    for(int i=max_size;i>=1;i--)\n    {\n        if(a[i]>9)\n            printf(\""%c\"",a[i]-10+'A');\n        else printf(\""%d\"",a[i]);\n    }\n}\nint main()\n{\n    scanf(\""%d\"",&B);\n    for(int i=1;i<=300;i++)\n    {\n        if(judge(i))\n        {\n            show(i);\n            printf(\"" \"");\n            show(i*i);\n            printf(\""\\n\"");\n        }\n    }\n\tsystem(\""pause\"");\n    return 0;\n}\n",ACCEPTED,32,492
1279619971271811072,c2c290e91f30dc0454f9ef5b9125b06471e7d4b403c388aa8cf0d9b3efc569e9,2020-07-05 11:35:50,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nint a[20]; \nbool judge(int x,int n)\n{\n    int m{ 0 };\n    x = x * x;\n    while (x)\n    {\n        a[++m] = x % n;\n        x /= n;\n    }\n    for (int i = 1, j = m; i < j; i++, j--)\n        if (a[i] != a[j])\n            return false;\n    return true;\n}\nvoid p(int x,int n)\n{\n    int m = 0;\n    while (x)\n    {\n        a[++m] = x % n;\n        x /= n;\n    }\n    for (int i = m; i >= 1; i--)\n    {\n        if (a[i] > 9)\n            cout<<(a[i] + 10 - 'A');\n        else \n            cout<< a[i] ;\n    }\n}\nint main()\n{\n    int B;\n    cin >> B;\n    for (int i = 1; i <= 300; i++)\n    {\n        if (judge(i,B))\n        {\n            p(i,B);\n            cout << \"" \"";\n            p(i * i,B);\n            cout << \""\\n\"";\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,28,512
1279620682600603648,f5d0e5816b1425aba76914b6740bc3646c8b6c8ffcdace81d8a77d8dc87977f7,2020-07-05 11:38:39,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\n\t\t\nbool symm(string s)\n{   if(s.size() == 1)return true; \n\tstring s1;\n\tint j = s.size();\n\tfor(int i = j -1 ; i >= 0;i--)\n    s1 += s[i];\n\treturn s1==s;\n}\n\t\nstring train(int y,int B)\n{\n string ans;\n\n while(y!=0)\n  {\n\n  if(y%B<10) {\n   ans+='0'+y%B;}\n \n  else {\n  ans+='A'+(y%B-10);}\n  y=y/B;\n    }\n reverse(ans.begin(),ans.end());\n return  ans;\n}\n\nint main()\n{\n\tint N,S,n=1,n1=0;\n\tcin>>N>>S;\n\tfor(int i=S+1;n<=N;i++)\n\t{\n\tfor(int j=2;j<=10;j++)\n\t{if(symm(train(i,j)))n1++;}\n\tif(n1>=2){cout<<i<<endl;n++;}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1279620796446605312,f5d0e5816b1425aba76914b6740bc3646c8b6c8ffcdace81d8a77d8dc87977f7,2020-07-05 11:39:06,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include<bits/stdc++.h>\nusing namespace std;\n\t\t\nbool symm(string s)\n{   if(s.size() == 1)return true; \n\tstring s1;\n\tint j = s.size();\n\tfor(int i = j -1 ; i >= 0;i--)\n    s1 += s[i];\n\treturn s1==s;\n}\n\t\nstring train(int y,int B)\n{\n string ans;\n\n while(y!=0)\n  {\n\n  if(y%B<10) {\n   ans+='0'+y%B;}\n \n  else {\n  ans+='A'+(y%B-10);}\n  y=y/B;\n    }\n reverse(ans.begin(),ans.end());\n return  ans;\n}\n\nint main()\n{\n\tint N,S,n=1,n1=0;\n\tcin>>N>>S;\n\tfor(int i=S+1;n<=N;i++)\n\t{\n\tfor(int j=2;j<=10;j++)\n\t{if(symm(train(i,j)))n1++;}\n\tif(n1>=2){cout<<i<<endl;n++;}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,26,420
1279620825794150400,c2c290e91f30dc0454f9ef5b9125b06471e7d4b403c388aa8cf0d9b3efc569e9,2020-07-05 11:39:13,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nint a[20]; \nbool judge(int x,int n)\n{\n    int m{ 0 };\n    x = x * x;\n    while (x)\n    {\n        a[++m] = x % n;\n        x /= n;\n    }\n    for (int i = 1, j = m; i < j; i++, j--)\n        if (a[i] != a[j])\n            return false;\n    return true;\n}\nvoid p(int x,int n)\n{\n    int m = 0;\n    while (x)\n    {\n        a[++m] = x % n;\n        x /= n;\n    }\n    for (int i = m; i >= 1; i--)\n    {\n        if (a[i] > 9)\n            cout<<(a[i] - 10 + 'A');\n        else \n            cout<< a[i] ;\n    }\n}\nint main()\n{\n    int B;\n    cin >> B;\n    for (int i = 1; i <= 300; i++)\n    {\n        if (judge(i,B))\n        {\n            p(i,B);\n            cout << \"" \"";\n            p(i * i,B);\n            cout << \""\\n\"";\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,25,496
1279620987224514560,c2c290e91f30dc0454f9ef5b9125b06471e7d4b403c388aa8cf0d9b3efc569e9,2020-07-05 11:39:52,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nint a[20]; \nbool judge(int x,int n)\n{\n    int m{ 0 };\n    x = x * x;\n    while (x)\n    {\n        a[++m] = x % n;\n        x /= n;\n    }\n    for (int i = 1, j = m; i < j; i++, j--)\n        if (a[i] != a[j])\n            return false;\n    return true;\n}\nvoid p(int x,int n)\n{\n    int m = 0;\n    while (x)\n    {\n        a[++m] = x % n;\n        x /= n;\n    }\n    for (int i = m; i >= 1; i--)\n    {\n        if (a[i] > 9)\n            cout<<(a[i] - 10 + 'A');\n        else \n            cout<< a[i] ;\n    }\n}\nint main()\n{\n    int B;\n    cin >> B;\n    for (int i = 1; i <= 300; i++)\n    {\n        if (judge(i,B))\n        {\n            p(i,B);\n            cout << \"" \"";\n            p(i * i,B);\n        }\n    }\n    return 0;\n}",MULTIPLE_ERROR,40,496
1279621151267938304,c2c290e91f30dc0454f9ef5b9125b06471e7d4b403c388aa8cf0d9b3efc569e9,2020-07-05 11:40:31,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nint a[250]; \nbool judge(int x,int n)\n{\n    int m{ 0 };\n    x = x * x;\n    while (x)\n    {\n        a[++m] = x % n;\n        x /= n;\n    }\n    for (int i = 1, j = m; i < j; i++, j--)\n        if (a[i] != a[j])\n            return false;\n    return true;\n}\nvoid p(int x,int n)\n{\n    int m = 0;\n    while (x)\n    {\n        a[++m] = x % n;\n        x /= n;\n    }\n    for (int i = m; i >= 1; i--)\n    {\n        if (a[i] > 9)\n            cout<<(a[i] - 10 + 'A');\n        else \n            cout<< a[i] ;\n    }\n}\nint main()\n{\n    int B;\n    cin >> B;\n    for (int i = 1; i <= 300; i++)\n    {\n        if (judge(i,B))\n        {\n            p(i,B);\n            cout << \"" \"";\n            p(i * i,B);\n            cout<<\""\\n\"";\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,41,424
1279622642909241344,c2c290e91f30dc0454f9ef5b9125b06471e7d4b403c388aa8cf0d9b3efc569e9,2020-07-05 11:46:26,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nint a[250]; \nbool judge(int x,int n)\n{\n    int m{ 0 };\n    x = x * x;\n    while (x)\n    {\n        a[++m] = x % n;\n        x /= n;\n    }\n    int flag{1};\n    for (int i=1;i<m/2;i++){\n        if (a[i]!=a[m-i+1]){\n            flag=0;\n            break;\n        }\n    }\n    return flag;\n}\nvoid p(int x,int n)\n{\n    int m = 0;\n    while (x)\n    {\n        a[++m] = x % n;\n        x /= n;\n    }\n    for (int i = m; i >= 1; i--)\n    {\n        if (a[i] > 9)\n            cout<<(a[i] - 10 + 'A');\n        else \n            cout<< a[i] ;\n    }\n}\nint main()\n{\n    int B;\n    cin >> B;\n    for (int i = 1; i <= 300; i++)\n    {\n        if (judge(i,B))\n        {\n            p(i,B);\n            cout << \"" \"";\n            p(i * i,B);\n            cout<<\""\\n\"";\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,41,424
1279622855422050304,f5d0e5816b1425aba76914b6740bc3646c8b6c8ffcdace81d8a77d8dc87977f7,2020-07-05 11:47:17,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include<bits/stdc++.h>\nusing namespace std;\n\t\t\nbool symm(string s)\n{   if(s.size() == 1)return true; \n\tstring s1;\n\tint j = s.size();\n\tfor(int i = j -1 ; i >= 0;i--)\n    s1 += s[i];\n\treturn s1==s;\n}\n\t\nstring train(int y,int B)\n{\n string ans;\n\n while(y!=0)\n  {\n\n  if(y%B<10) {\n   ans+='0'+y%B;}\n \n  else {\n  ans+='A'+(y%B-10);}\n  y=y/B;\n    }\n reverse(ans.begin(),ans.end());\n return  ans;\n}\n\nint main()\n{\n\tint N,S,n=1,n1=0;\n\tcin>>N>>S;\n\tfor(int i=S+1;n<=N;i++)\n\t{\n    n1=0\n\tfor(int j=2;j<=10;j++)\n\t{if(symm(train(i,j)))n1++;}\n\tif(n1>=2){cout<<i<<endl;n++;}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1279622895150497792,f5d0e5816b1425aba76914b6740bc3646c8b6c8ffcdace81d8a77d8dc87977f7,2020-07-05 11:47:27,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include<bits/stdc++.h>\nusing namespace std;\n\t\t\nbool symm(string s)\n{   if(s.size() == 1)return true; \n\tstring s1;\n\tint j = s.size();\n\tfor(int i = j -1 ; i >= 0;i--)\n    s1 += s[i];\n\treturn s1==s;\n}\n\t\nstring train(int y,int B)\n{\n string ans;\n\n while(y!=0)\n  {\n\n  if(y%B<10) {\n   ans+='0'+y%B;}\n \n  else {\n  ans+='A'+(y%B-10);}\n  y=y/B;\n    }\n reverse(ans.begin(),ans.end());\n return  ans;\n}\n\nint main()\n{\n\tint N,S,n=1,n1=0;\n\tcin>>N>>S;\n\tfor(int i=S+1;n<=N;i++)\n\t{\n    n1=0;\n\tfor(int j=2;j<=10;j++)\n\t{if(symm(train(i,j)))n1++;}\n\tif(n1>=2){cout<<i<<endl;n++;}\n\t}\n\treturn 0;\n}",ACCEPTED,38,424
1279645058410668032,2b459d8523bd56b3eea253cb0aa60960cf250af00cd3fc924e9e1019943a0492,2020-07-05 13:15:31,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<stdlib.h>\n\n\nusing namespace std;\n\nint judge(int i);\nint myprint(int i);\nint n;\n//int flag=0;\nint lena=0;\nint lenb=0;\nint a[100000]={0};\nint b[1000]={0};\nchar chr[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nint main(){\n\tcin>>n;\n\tfor(int i=1;i<=300;i++)\n\t{\n\t\tif(judge(i*i))\n\t\t{\n\t\t\tmyprint(i);\n\t\t}\n\t}\n\treturn 0;\n}\nint judge(int i){\n\tlena=0;\n\twhile(i/n)\n\t{\n\t\ta[lena++]=i%n;\n\t\ti/=n;\n\t}\n\ta[lena]=i%n;\n\tfor(int j=0;j<=lena;j++)\n\t\tif(a[j]!=a[lena-j])\n\t\t\treturn 0;\n\t\treturn 1;\n}\nint myprint(int i){\n\t\n\tlenb=0;\n\twhile(i/n)\n\t{\n\t\tb[lenb++]=i%n;\n\t\ti/=n;\n\t}\n\tb[lenb]=i%n;\n\tfor(int u=lenb;u>=0;u--)\n\t\tcout<<chr[b[u]];\n\tcout<<ends;\n\tfor(int u=0;u<=lena;u++)\n\t\tcout<<chr[a[u]];\n\tcout<<endl;\n\treturn 0;\n}",WRONG_ANSWER,41,424
1279646866671591424,b187174f03bd121c1bab68090cc2e4c9b38801a35b733f87bec579962a6eed36,2020-07-05 13:22:42,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\n\nint huiwen(vector<int> a){\n\tfor(int n=0;n<a.size();++n){\n\t\tif(a[n]!=a[a.size()-1-n])return 0;\n\t}\n\treturn 1;\n}\nint change(int i,int j){\n\tvector<int> a;\n\twhile(i>0){\n\t\tint x=i%j;\n\t\ta.push_back(x);\n\t\ti/=j;\n\t}\n\tif(huiwen(a))return 1;\n\treturn 0;\n}\nint main(){\n\tint n,s;\n\tcin>>n>>s;\n\tint temp=0,counter=0;\n\tvector<int> b;\n\tfor(int i=s+1;;++i){\n\t\tfor(int j=2;j<=10;++j){\n\t\t\tif(change(i,j))temp++;\n\t\t}\n\t\tif(temp>2){\n\t\t\tb.push_back(i);\n\t\t\tcounter++;\n\t\t}\n\t\tif(counter==n)break;\n\t}\n\tfor(int i=0;i<n;++i){\n\t\tcout<<b[i]<<endl;\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,27,512
1279647228434513920,c5f006269b926e61241c8f09728f8ca99c23da829b64fc3aefb604777dcc38c7,2020-07-05 13:24:08,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,#include<iostream>\nusing namespace std;\nint main()\n{\n    int N;\n    int S;\n    int ns[1000000];\n    int index;\n    int can;\n    int lenght;\n    bool IsHui;\n    int count;\n    int countshu = 0;\n    int counthui = 0;\n    cin >> N;\n    cin >> S;\n    while(true)\n    {\n        S++;\n        can = S;\n        for(int i = 2; i <= 10; i++)\n        {\n            ns[index] = can%i;\n            index++;\n            can = can/i;\n            while(can != 0)\n            {\n                ns[index] = can%i;\n                index++;\n                can = can/i;\n            }\n            lenght = index;\n            index = 0;\n            if(lenght == 1){countshu++;}\n            else\n            {\n                for(int j = 0; j < lenght/2; j++)\n                {\n                    if(ns[j] == ns[lenght-1-j]){count++;continue;}\n                    else{break;}\n                }  \n            }\n            IsHui = (count == lenght/2);\n            count = 0;\n            if(IsHui){countshu++;}\n        }\n        if(countshu >= 2){cout << S << endl;counthui++;}\n        if(counthui == 3){break;}\n    }\n    return 0;\n},WRONG_ANSWER,30,640
1279649191867908096,b187174f03bd121c1bab68090cc2e4c9b38801a35b733f87bec579962a6eed36,2020-07-05 13:31:56,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\n\nint huiwen(vector<int> a){\n\tfor(int n=0;n<a.size();++n){\n\t\tif(a[n]!=a[a.size()-1-n])return 0;\n\t}\n\treturn 1;\n}\nint change(int i,int j){\n\tvector<int> a;\n\twhile(i>0){\n\t\tint x=i%j;\n\t\ta.push_back(x);\n\t\ti/=j;\n\t}\n\tif(huiwen(a))return 1;\n\treturn 0;\n}\nint main(){\n\tint n,s;\n\tcin>>n>>s;\n\tint temp=0,counter=0;\n\tvector<int> b;\n\tfor(int i=s+1;;++i){\n\t\tfor(int j=2;j<=10;++j){\n\t\t\tif(change(i,j))temp++;\n\t\t}\n\t\tif(temp>=2){\n\t\t\tb.push_back(i);\n\t\t\tcounter++;\n\t\t}\n\t\tif(counter==n)break;\n\t}\n\tfor(int i=0;i<n;++i){\n\t\tcout<<b[i]<<endl;\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,28,512
1279649489684455424,5306f45bc39a1bcebead04fb0a0563714f434c5cfc74c6bcd6746bdff031d758,2020-07-05 13:33:07,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nint s[301];\n\nvoid transition(int a, int b)\n{\n    int r = 0;\n    while (a)\n    {\n        s[++r] = a % b;\n        a /= b;\n    }\n    s[0] = r;\n}\n\nbool judge() \n{\n    for (unsigned int i = 1; i <= s[0]; i++)\n        if (s[i] != s[s[0] + 1 - i])\n            return false;\n    return true;\n}\n\nvoid output()\n{\n    for (unsigned int i = s[0]; i >= 1; i--)\n    {\n        if (s[i] <= 9) cout << s[i];\n        else cout << (char)(s[i] - 10 + 'A');\n    }\n}\n\nint main()\n{\n    int num;\n    cin >> num;\n    for (int i = 1; i <= 300; i++)\n    {\n        transition(i * i, num);\n        if (judge())\n        {\n            transition(i, num);\n            output();\n            cout << ' ';\n            transition(i * i, num);\n            output();\n            puts(\""\"");\n        }\n    }\n}",ACCEPTED,32,508
1279649758379966464,c718a5e15c13709ac252b40e283fb2aa1038ea11b52a4e636a057e3e1f4edac7,2020-07-05 13:34:11,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>//万能头 \nusing namespace std;\nint n;\nint s[301];\nvoid jz(int a,int b)//转换进制 \n{\n    int r=0;\n    while(a){\n        s[++r]=a%b;\n        a/=b;\n    }\n    s[0]=r;\n}\nbool change(){//判断s[i]与s[s[0]+1-i]是否相等\n    for(int i=1;i<=s[0];i++)\n\t{\n    \tif(s[i]!=s[s[0]+1-i]) return false;\n    }\n    return true;\n}\nvoid print(){//打印 \n    for(int i=s[0];i>=1;i--)\n\t{\n        if(s[i]<=9) cout<<s[i];\n        else cout<<(char)(s[i]-10+'A');\n    }\n} \nint main() \n\t{\n\tcin>>n;\n\tfor(int i=1;i<=300;i++)\n\t{//从1-300进行循环 \n    \tjz(i*i,n);//调用函数 \n    \tif(change()){\n        \tjz(i,n);\n\t        print();\n\t        cout<<' ';\n\t        jz(i*i,n);\n\t        print();\n\t        puts(\""\"");\n\t\t}\n\t}\n    return 0;\n}\n\n ",ACCEPTED,42,512
1279649929503367168,c718a5e15c13709ac252b40e283fb2aa1038ea11b52a4e636a057e3e1f4edac7,2020-07-05 13:34:52,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>//万能头\nusing namespace std;\nint n;\n\nint s[300];int b;\nbool ispal(int n,int k){\n    int p=0 , m = 1;\n    while(n){\n        s[p++]=n%k;\n        n/=k;\n    }\n    int i=0,j=p-1;\n    while(i<j)\n        if(s[i++]!=s[j--])\n            return 0;\n    return m;\n}\n\nint main()\n    {\n    scanf(\""%d\"",&n);\n    for(int i=1;i<=300;i++)\n    {//从1-300进行循环\n        b = ispal(i*i,n);//函数调整\n        if(b){\n            printf(\""%d %d\\n\"",i,i*i);\n        }\n    }\n    return 0;\n}\n回文平方数 初始\n",COMPILE_ERROR,0,0
1279650018300985344,c718a5e15c13709ac252b40e283fb2aa1038ea11b52a4e636a057e3e1f4edac7,2020-07-05 13:35:13,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>//万能头\nusing namespace std;\nint n;\n\nint s[300];int b;\nbool ispal(int n,int k){\n    int p=0 , m = 1;\n    while(n){\n        s[p++]=n%k;\n        n/=k;\n    }\n    int i=0,j=p-1;\n    while(i<j)\n        if(s[i++]!=s[j--])\n            return 0;\n    return m;\n}\n\nint main()\n    {\n    scanf(\""%d\"",&n);\n    for(int i=1;i<=300;i++)\n    {//从1-300进行循环\n        b = ispal(i*i,n);//函数调整\n        if(b){\n            printf(\""%d %d\\n\"",i,i*i);\n        }\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,40,512
1279651515650736128,d5c70f9f0b08a91158e577b0502181fa0f52375b7c5ef057b22a6ed756432e03,2020-07-05 13:41:10,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nint main()\n{\n\tint judge(int m, int B);\n\tint N, S;\n\tint i,j,m;\n\tcin >> N >> S;\n\tfor (i = S; i <= N + S; i++)\n\t{\n\t\tm = 0;\n\t\tfor (j = 2; j < 11; j++)\n\t\t{\n\t\t\tif (judge(i, j) == 1)\n\t\t\t\tm++;\n\t\t}\n\t\tif (m >= 2)\n\t\t\tcout << i << endl;\n\t}\n\n}\nint judge(int m, int B)\n{\n\tint k = 0;\n\tint a[20];\n\tfor (int i = 0; i < 20; i++)\n\t{\n\t\tif (m % B > 9)\n\t\t{\n\t\t\ta[i] = (m % B) + 55;\n\t\t}\n\t\telse\n\t\t{\n\t\t\ta[i] = (m % B) + 48;\n\t\t}\n\t\tm = m / B;\n\t\tif (m == 0)\n\t\t{\n\t\t\tk = i;\n\t\t\tbreak;\n\t\t}\n\t}\n\tfor (int i = 0; i < k; i++)\n\t{\n\t\tif (a[i] != a[k - i])\n\t\t\treturn 0;\n\t}\n\treturn 1;\n}\n",WRONG_ANSWER,22,520
1279653211906965504,b187174f03bd121c1bab68090cc2e4c9b38801a35b733f87bec579962a6eed36,2020-07-05 13:47:55,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\nint huiwen(vector<int> a) {\n\tfor (int y = 0; y < a.size(); ++y) {\n\t\tif (a[y] != a[a.size() - 1 - y])return 0;\n\t}\n\treturn 1;\n}\nint change(int m, int n) {\n\tvector<int> a;\n\twhile (m > 0) {\n\t\tint x = m % n;\n\t\ta.push_back(x);\n\t\tm /= n;\n\t}\n\tif (huiwen(a))return 1;\n\treturn 0;\n}\nint main() {\n\tint n, s;\n\tcin >> n >> s;\n\tint temp = 0, counter = 0;\n\tvector<int> b;\n\tfor (int i = s + 1;; ++i) {\n\t\tif (counter == n)break;\n\t\tfor (int j = 2; j <= 10; ++j) {\n\t\t\tif (change(i, j))temp++;\n\t\t\tif (temp >= 2) {\n\t\t\t\tb.push_back(i);\n\t\t\t\tcounter++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tfor (int i = 0; i < n; ++i) {\n\t\tcout << b[i] << endl;\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,25,500
1279653795322060800,c718a5e15c13709ac252b40e283fb2aa1038ea11b52a4e636a057e3e1f4edac7,2020-07-05 13:50:14,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>//万能头\nusing namespace std;\nint n;\n\nint s[300];int b;\nbool ispal(int n,int k){\n    int p=0 , m = 1;\n    while(n){\n        s[p++]=n%k;\n        n/=k;\n    }\n    int i=0,j=p-1;\n    while(i<j)\n        if(s[i++]!=s[j--])\n            return 0;\n    return m;\n}\n\nint main()\n    {\n    scanf(\""%d\"",&n);\n    for(int i=1;i<=300;i++)\n    {//从1-300进行循环\n        b = ispal(i*i,n);//函数调整\n        if(b){\n            printf(\""%d %d\\n\"",i,i*i);\n        }\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,38,508
1279654437260296192,d5c70f9f0b08a91158e577b0502181fa0f52375b7c5ef057b22a6ed756432e03,2020-07-05 13:52:47,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nint main()\n{\n\tint judge(int m, int B);\n\tint N, S;\n\tint i,j,m;\n\tcin >> N >> S;\n\tfor (i = S+1; i <= N + S; i++)\n\t{\n\t\tm = 0;\n\t\tfor (j = 2; j < 11; j++)\n\t\t{\n\t\t\tif (judge(i, j) == 1)\n\t\t\t\tm++;\n\t\t}\n\t\tif (m >= 2)\n\t\t\tcout << i << endl;\n\t}\n\n}\nint judge(int m, int B)\n{\n\tint k = 0;\n\tchar c;\n\tstring a;\n\tfor (int i = 0; i < 20; i++)\n\t{\n\t\tif (m % B > 9)\n\t\t{\n\t\t\tc = (m % B) + 55;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tc = (m % B) + 48;\n\t\t}\n\t\tm = m / B;\n\t\ta += c;\n\t\tif (m == 0)\n\t\t{\n\t\t\tk = i;\n\t\t\tbreak;\n\t\t}\n\t}\n\tfor (int i = 0; i < k; i++)\n\t{\n\t\tif (a[i] != a[k - i])\n\t\t\treturn 0;\n\t}\n\treturn 1;\n}\n",PARTIAL_ACCEPTED,33,384
1279655598939889664,d5c70f9f0b08a91158e577b0502181fa0f52375b7c5ef057b22a6ed756432e03,2020-07-05 13:57:24,C++,60.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nint main()\n{\n\tint judge(int m, int B);\n\tint N, S;\n\tint i,j,m,n;\n\tcin >> N >> S;\n\tn = 0;\n\tfor (i = S+1; i <10015; i++)\n\t{\n\t\tm = 0;\n\t\tfor (j = 2; j < 11; j++)\n\t\t{\n\t\t\tif (judge(i, j) == 1)\n\t\t\t\tm++;\n\t\t}\n\t\tif (m >= 2)\n\t\t{\n\t\t\tcout << i << endl;\n\t\t\tn++;\n\t\t\tif (n == N)\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t\n\t}\n\n}\nint judge(int m, int B)\n{\n\tint k = 0;\n\tchar c;\n\tstring a;\n\tfor (int i = 0; i < 20; i++)\n\t{\n\t\tif (m % B > 9)\n\t\t{\n\t\t\tc = (m % B) + 55;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tc = (m % B) + 48;\n\t\t}\n\t\tm = m / B;\n\t\ta += c;\n\t\tif (m == 0)\n\t\t{\n\t\t\tk = i;\n\t\t\tbreak;\n\t\t}\n\t}\n\tfor (int i = 0; i < k; i++)\n\t{\n\t\tif (a[i] != a[k - i])\n\t\t\treturn 0;\n\t}\n\treturn 1;\n}\n",PARTIAL_ACCEPTED,30,512
1279655910824140800,d5c70f9f0b08a91158e577b0502181fa0f52375b7c5ef057b22a6ed756432e03,2020-07-05 13:58:38,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nint main()\n{\n\tint judge(int m, int B);\n\tint N, S;\n\tint i,j,m,n;\n\tcin >> N >> S;\n\tn = 0;\n\tfor (i = S+1; ; i++)\n\t{\n\t\tm = 0;\n\t\tfor (j = 2; j < 11; j++)\n\t\t{\n\t\t\tif (judge(i, j) == 1)\n\t\t\t\tm++;\n\t\t}\n\t\tif (m >= 2)\n\t\t{\n\t\t\tcout << i << endl;\n\t\t\tn++;\n\t\t\tif (n == N)\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t\n\t}\n\n}\nint judge(int m, int B)\n{\n\tint k = 0;\n\tchar c;\n\tstring a;\n\tfor (int i = 0; i < 20; i++)\n\t{\n\t\tif (m % B > 9)\n\t\t{\n\t\t\tc = (m % B) + 55;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tc = (m % B) + 48;\n\t\t}\n\t\tm = m / B;\n\t\ta += c;\n\t\tif (m == 0)\n\t\t{\n\t\t\tk = i;\n\t\t\tbreak;\n\t\t}\n\t}\n\tfor (int i = 0; i < k; i++)\n\t{\n\t\tif (a[i] != a[k - i])\n\t\t\treturn 0;\n\t}\n\treturn 1;\n}\n",ACCEPTED,24,512
1279662105169428480,b5b78ed0f0edfeb51663040529010e7beb9e303f0b4e3360d8137970a40f5093,2020-07-05 14:23:15,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string.h>\n#include <algorithm>\n#include <cstdio>\nusing namespace std;\nint B;\nchar chping[10000];\nchar ch2[1000];\nchar jz[21] = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K'};\n\nint check(int x)\n{\n    int i, j;\n    int k = 0;\n    while (x)\n    {\n        chping[k++] = jz[x % B];\n        x = x/B;\n    }\n    chping[k] = '\\0';\n    for (i = 0, j = k - 1; i < j; i++, j--)\n    {\n        if (chping[i] != chping[j])\n            return 0;\n    }\n    return 1;\n}\nvoid zhuan2(int x)\n{\n    int k = 0;\n    int i, j;\n    char t;\n    while (x)\n    {\n        ch2[k++] = jz[x % B];\n        x = x / B;\n    }\n    for (i = 0, j = k - 1; i < j; i++, j--)\n    {\n        t = ch2[i];\n        ch2[i] = ch2[j];\n        ch2[j] = t;\n    }\n}\nint main()\n{\n    int i, t;\n    cin >> B;\n    for (i = 1; i <= 300; i++)\n    {\n        if (check(i * i))\n        {\n            zhuan2(i);\n            cout << ch2 << \"" \"" << chping << endl;\n        }\n    }\n    return 0;\n}",ACCEPTED,38,512
1279664368801734656,7707b0ad9538c4a22483a8a70fccc59fe2b1c309e308bd4058b49b821e876909,2020-07-05 14:32:15,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint c;\nint a[100], b[100];\nvoid change(int m,int B)       //改变进制\n{\n\tint i = 0;\n\twhile (m > 0)\n\t{\n\t\tb[++i] = m % B;\n\t\tm = m / B;\n\t}\n\tc = i;\n\tfor (i = c;i > 0;i--)\n\t\ta[i] = b[c + 1 - i];\n}\nbool check(int m,int B)\n{\n\tint flag = 0;\n\tchange(m,B);\n\tif (c == 1)\n\t\tflag = 1;\n\telse\n\t{\n\t\tfor (int i = 1;i <= c / 2;i++)\n\t\t{\n\t\t\tif (a[i] == a[c + 1 - i])\n\t\t\t{\n\t\t\t\tflag = 1;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tflag = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tif (flag == 1)\n\t\treturn true;\n\telse\n\t\treturn false;\n\n}\nint main()\n{\n\tint N, S;\n\tint i = 0,x=0;\n\tcin >> N >> S;\n\tfor (int j = S+1;;j++)\n\t{\n\t\tfor (int B = 2;B <= 10;B++)\n\t\t{\n\t\t\tif (i==2)\n\t\t\t\tbreak;\n\t\t\tif (check(j, B))\n\t\t\t\ti = i + 1;\n\t\t}\n\t\tif (i == 2)\n\t\t{\n\t\t\tcout << j << endl;\n\t\t\tx = x + 1;\n\t\t}\n\t\tif (x == 3)\n\t\t\tbreak;\n\t}\n}",WRONG_ANSWER,25,508
1279664461298720768,7707b0ad9538c4a22483a8a70fccc59fe2b1c309e308bd4058b49b821e876909,2020-07-05 14:32:37,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint c;\nint a[100], b[100];\nvoid change(int m,int B)       //改变进制\n{\n\tint i = 0;\n\twhile (m > 0)\n\t{\n\t\tb[++i] = m % B;\n\t\tm = m / B;\n\t}\n\tc = i;\n\tfor (i = c;i > 0;i--)\n\t\ta[i] = b[c + 1 - i];\n}\nbool check(int m,int B)\n{\n\tint flag = 0;\n\tchange(m,B);\n\tif (c == 1)\n\t\tflag = 1;\n\telse\n\t{\n\t\tfor (int i = 1;i <= c / 2;i++)\n\t\t{\n\t\t\tif (a[i] == a[c + 1 - i])\n\t\t\t{\n\t\t\t\tflag = 1;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tflag = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tif (flag == 1)\n\t\treturn true;\n\telse\n\t\treturn false;\n\n}\nint main()\n{\n\tint N, S;\n\tint i = 0,x=0;\n\tcin >> N >> S;\n\tfor (int j = S+1;;j++)\n\t{\n\t\tfor (int B = 2;B <= 10;B++)\n\t\t{\n\t\t\tif (i>2)\n\t\t\t\tbreak;\n\t\t\tif (check(j, B))\n\t\t\t\ti = i + 1;\n\t\t}\n\t\tif (i > 2)\n\t\t{\n\t\t\tcout << j << endl;\n\t\t\tx = x + 1;\n\t\t}\n\t\tif (x == 3)\n\t\t\tbreak;\n\t}\n}",WRONG_ANSWER,22,512
1279664796545245184,7707b0ad9538c4a22483a8a70fccc59fe2b1c309e308bd4058b49b821e876909,2020-07-05 14:33:57,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint c;\nint a[100], b[100];\nvoid change(int m,int B)       //改变进制\n{\n\tint i = 0;\n\twhile (m > 0)\n\t{\n\t\tb[++i] = m % B;\n\t\tm = m / B;\n\t}\n\tc = i;\n\tfor (i = c;i > 0;i--)\n\t\ta[i] = b[c + 1 - i];\n}\nbool check(int m,int B)\n{\n\tint flag = 0;\n\tchange(m,B);\n\tif (c == 1)\n\t\tflag = 1;\n\telse\n\t{\n\t\tfor (int i = 1;i <= c / 2;i++)\n\t\t{\n\t\t\tif (a[i] == a[c + 1 - i])\n\t\t\t{\n\t\t\t\tflag = 1;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tflag = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tif (flag == 1)\n\t\treturn true;\n\telse\n\t\treturn false;\n\n}\nint main()\n{\n\tint N, S;\n\tint i = 0,x=0;\n\tcin >> N >> S;\n\tfor (int j = S+1;;j++)\n\t{\n\t\tfor (int B = 2;B <= 10;B++)\n\t\t{\n\t\t\tif (i==2)\n\t\t\t\tbreak;\n\t\t\tif (check(j, B))\n\t\t\t\ti = i + 1;\n\t\t}\n\t\tif (i == 2)\n\t\t{\n\t\t\tcout << j << endl;\n\t\t\tx = x + 1;\n\t\t}\n\t\tif (x == N)\n\t\t\tbreak;\n\t}\n}",PARTIAL_ACCEPTED,35,492
1279665387107442688,c2c290e91f30dc0454f9ef5b9125b06471e7d4b403c388aa8cf0d9b3efc569e9,2020-07-05 14:36:17,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nint a[250]; \nbool judge(int x,int n)\n{\n    int m{ 0 };\n    x = x * x;\n    while (x)\n    {\n        a[++m] = x % n;\n        x /= n;\n    }\n    int flag{1};\n    for (int i=1;i<=m/2;i++){\n        if (a[i]!=a[m-i+1]){\n            flag=0;\n            break;\n        }\n    }\n    return flag;\n}\nvoid p(int x,int n)\n{\n    int m = 0;\n    while (x)\n    {\n        a[++m] = x % n;\n        x /= n;\n    }\n    for (int i = m; i >= 1; i--)\n    {\n        if (a[i] > 9)\n            cout<<(a[i] - 10 + 'A');\n        else \n            cout<< a[i] ;\n    }\n}\nint main()\n{\n    int B;\n    cin >> B;\n    for (int i = 1; i <= 300; i++)\n    {\n        if (judge(i,B))\n        {\n            p(i,B);\n            cout << \"" \"";\n            p(i * i,B);\n            cout<<\""\\n\"";\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,36,512
1279666414716116992,c2c290e91f30dc0454f9ef5b9125b06471e7d4b403c388aa8cf0d9b3efc569e9,2020-07-05 14:40:22,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nint a[250]; \nbool judge(int x,int n)\n{\n    int m{ 0 };\n    x = x * x;\n    while (x)\n    {\n        a[++m] = x % n;\n        x /= n;\n    }\n    int flag{1};\n    for (int i=1;i<=m/2;i++){\n        if (a[i]!=a[m-i+1]){\n            flag=0;\n            break;\n        }\n    }\n    return flag;\n}\nvoid p(int x,int n)\n{\n    int m = 0;\n    while (x)\n    {\n        a[++m] = x % n;\n        x /= n;\n    }\n    for (int i = m; i >= 1; i--)\n    {\n        if (a[i] > 9)\n            cout<<(a[i] + 55);\n        else \n            cout<< a[i] ;\n    }\n}\nint main()\n{\n    int B;\n    cin >> B;\n    for (int i = 1; i <= 300; i++)\n    {\n        if (judge(i,B))\n        {\n            p(i,B);\n            cout << \"" \"";\n            p(i * i,B);\n            cout<<\""\\n\"";\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,40,600
1279666998202523648,7707b0ad9538c4a22483a8a70fccc59fe2b1c309e308bd4058b49b821e876909,2020-07-05 14:42:42,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint c;\nint a[100], b[100];\nvoid change(int m,int B)       //改变进制\n{\n\tint i = 0;\n\twhile (m > 0)\n\t{\n\t\tb[++i] = m % B;\n\t\tm = m / B;\n\t}\n\tc = i;\n\tfor (i = c;i > 0;i--)\n\t\ta[i] = b[c + 1 - i];\n}\nbool check(int m,int B)\n{\n\tint flag = 0;\n\tchange(m,B);\n\tif (c == 1)\n\t\tflag = 1;\n\telse\n\t{\n\t\tfor (int i = 1;i <= c / 2;i++)\n\t\t{\n\t\t\tif (a[i] == a[c + 1 - i])\n\t\t\t{\n\t\t\t\tflag = 1;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tflag = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tif (flag == 1)\n\t\treturn true;\n\telse\n\t\treturn false;\n\n}\nint main()\n{\n\tint N, S;\n\tint i,x=0;\n\tcin >> N >> S;\n\tfor (int j = S+1;;j++)\n\t{\n        i=0;\n\t\tfor (int B = 2;B <= 10;B++)\n\t\t{\n\t\t\tif (i==2)\n\t\t\t\tbreak;\n\t\t\tif (check(j, B))\n\t\t\t\ti = i + 1;\n\t\t}\n\t\tif (i == 2)\n\t\t{\n\t\t\tcout << j << endl;\n\t\t\tx = x + 1;\n\t\t}\n\t\tif (x == N)\n\t\t\tbreak;\n\t}\n}",ACCEPTED,30,424
1279667575674298368,cf92d4855910fe09050cdec3375cd8505b0c4bb49d0095b0913759510fb9a7b7,2020-07-05 14:44:59,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<algorithm>\nusing namespace std;\nstring tran(int numb, int r) {\n    char b[10]{ 'A','B','C','D','E','F','G','H','I','J' };\n    string b2 = \""\"";\n    while (numb != 0) {\n        int l;\n        l = numb % r;\n        numb = numb / r;\n        if (l>= 10)\n            b2 += b[l % 10];\n        else\n            b2 += to_string(l);\n    }\n    int len = b2.size();\n    for (int i = 0; i < (len / 2); i++) {\n        char temp = b2[i];\n        b2[i] = b2[len - i - 1];\n        b2[len - i - 1] = temp;\n    }\n    return b2;\n}\nbool t(string num) {\n    if (num.size() == 1)\n        return true;\n    int len = num.size();\n    int count = 0;\n    for (int i = 0; i < len; i++) {\n        if (num[i] == num[len - i - 1])\n            count++;\n    }\n    if (count == len)\n        return true;\n    else\n        return false;\n}\nint main()\n{\n    int a;\n    cin>>a;\n    for(int i=1;i<=300;i++){\n        string b=tran(i,a);\n        string c=tran(i*i,a);\n        if(t(c)){\n               cout<<i<<' '<<i*i;\n    }\n    }\n}\n",MULTIPLE_ERROR,51,488
1279669338267648000,cf92d4855910fe09050cdec3375cd8505b0c4bb49d0095b0913759510fb9a7b7,2020-07-05 14:52:00,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<algorithm>\nusing namespace std;\nstring tran(int numb, int r) {\n    char b[10]{ 'A','B','C','D','E','F','G','H','I','J' };\n    string b2 = \""\"";\n    while (numb != 0) {\n        int l;\n        l = numb % r;\n        numb = numb / r;\n        if (l>= 10)\n            b2 += b[l % 10];\n        else\n            b2 += to_string(l);\n    }\n    int len = b2.size();\n    for (int i = 0; i < (len / 2); i++) {\n        char temp = b2[i];\n        b2[i] = b2[len - i - 1];\n        b2[len - i - 1] = temp;\n    }\n    return b2;\n}\nbool t(string num) {\n    if (num.size() == 1)\n        return true;\n    int len = num.size();\n    int count = 0;\n    for (int i = 0; i < len; i++) {\n        if (num[i] == num[len - i - 1])\n            count++;\n    }\n    if (count == len)\n        return true;\n    else\n        return false;\n}\nint main()\n{\n    int a;\n    cin>>a;\n    for(int i=1;i<=300;i++){\n        string b=tran(i,a);\n        string c=tran(i*i,a);\n        if(t(c)){\n            for(int j=0;j<b.size();j++)\n               cout<<b[j];\n            cout<<' ';\n            for(int j=0;j<c.size();j++)\n                cout<<c[j];\n        }\n    }\n}\n",PRESENTATION_ERROR,38,424
1279669657718415360,c2c290e91f30dc0454f9ef5b9125b06471e7d4b403c388aa8cf0d9b3efc569e9,2020-07-05 14:53:16,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nint a[250]; \nbool judge(int x,int n)\n{\n    int m{ 0 };\n    x = x * x;\n    while (x)\n    {\n        a[++m] = x % n;\n        x /= n;\n    }\n    int flag{1};\n    for (int i=1;i<=m/2;i++){\n        if (a[i]!=a[m-i+1]){\n            flag=0;\n            break;\n        }\n    }\n    return flag;\n}\nvoid p(int x,int n)\n{\n    int m = 0;\n    while (x)\n    {\n        a[++m] = x % n;\n        x /= n;\n    }\n    for (int i = m; i >= 1; i--)\n    {\n        if (a[i] > 9)\n            cout<<(a[i] - 10 + 'A');\n        else \n            cout<< a[i] ;\n    }\n}\nint main()\n{\n    int B;\n    cin >> B;\n    for (int i = 1; i <= 300; i++)\n    {\n        if (judge(i,B))\n        {\n            p(i,B);\n            cout << \"" \"";\n            p(i * i,B);\n            cout<<\""\\n\"";\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,36,512
1279670554519330816,cf92d4855910fe09050cdec3375cd8505b0c4bb49d0095b0913759510fb9a7b7,2020-07-05 14:56:49,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<algorithm>\nusing namespace std;\nstring tran(int numb, int r) {\n    char b[10]{ 'A','B','C','D','E','F','G','H','I','J' };\n    string b2 = \""\"";\n    while (numb != 0) {\n        int l;\n        l = numb % r;\n        numb = numb / r;\n        if (l>= 10)\n            b2 += b[l % 10];\n        else\n            b2 += to_string(l);\n    }\n    int len = b2.size();\n    for (int i = 0; i < (len / 2); i++) {\n        char temp = b2[i];\n        b2[i] = b2[len - i - 1];\n        b2[len - i - 1] = temp;\n    }\n    return b2;\n}\nbool t(string num) {\n    if (num.size() == 1)\n        return true;\n    int len = num.size();\n    int count = 0;\n    for (int i = 0; i < len; i++) {\n        if (num[i] == num[len - i - 1])\n            count++;\n    }\n    if (count == len)\n        return true;\n    else\n        return false;\n}\nint main()\n{\n    int a;\n    cin>>a;\n    for(int i=1;i<=300;i++){\n        string b=tran(i,a);\n        string c=tran(i*i,a);\n        if(t(c)){\n            for(int j=0;j<b.size();j++)\n               cout<<b[j];\n            cout<<' ';\n            for(int j=0;j<c.size();j++)\n                cout<<c[j]<<endl;\n        }\n    }\n}\n",PRESENTATION_ERROR,46,536
1279670567756554240,cf92d4855910fe09050cdec3375cd8505b0c4bb49d0095b0913759510fb9a7b7,2020-07-05 14:56:53,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<algorithm>\nusing namespace std;\nstring tran(int numb, int r) {\n    char b[10]{ 'A','B','C','D','E','F','G','H','I','J' };\n    string b2 = \""\"";\n    while (numb != 0) {\n        int l;\n        l = numb % r;\n        numb = numb / r;\n        if (l>= 10)\n            b2 += b[l % 10];\n        else\n            b2 += to_string(l);\n    }\n    int len = b2.size();\n    for (int i = 0; i < (len / 2); i++) {\n        char temp = b2[i];\n        b2[i] = b2[len - i - 1];\n        b2[len - i - 1] = temp;\n    }\n    return b2;\n}\nbool t(string num) {\n    if (num.size() == 1)\n        return true;\n    int len = num.size();\n    int count = 0;\n    for (int i = 0; i < len; i++) {\n        if (num[i] == num[len - i - 1])\n            count++;\n    }\n    if (count == len)\n        return true;\n    else\n        return false;\n}\nint main()\n{\n    int a;\n    cin>>a;\n    for(int i=1;i<=300;i++){\n        string b=tran(i,a);\n        string c=tran(i*i,a);\n        if(t(c)){\n            for(int j=0;j<b.size();j++)\n               cout<<b[j];\n            cout<<' ';\n            for(int j=0;j<c.size();j++)\n                cout<<c[j]<<endl;\n        }\n    }\n}\n",PRESENTATION_ERROR,46,528
1279674030141931520,cf92d4855910fe09050cdec3375cd8505b0c4bb49d0095b0913759510fb9a7b7,2020-07-05 15:10:38,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<algorithm>\nusing namespace std;\nstring tran(int numb, int r) {\n    char b[10]{ 'A','B','C','D','E','F','G','H','I','J' };\n    string b2 = \""\"";\n    while (numb != 0) {\n        int l;\n        l = numb % r;\n        numb = numb / r;\n        if (l>= 10)\n            b2 += b[l % 10];\n        else\n            b2 += to_string(l);\n    }\n    int len = b2.size();\n    for (int i = 0; i < (len / 2); i++) {\n        char temp = b2[i];\n        b2[i] = b2[len - i - 1];\n        b2[len - i - 1] = temp;\n    }\n    return b2;\n}\nbool t(string num) {\n    if (num.size() == 1)\n        return true;\n    int len = num.size();\n    int count = 0;\n    for (int i = 0; i < len; i++) {\n        if (num[i] == num[len - i - 1])\n            count++;\n    }\n    if (count == len)\n        return true;\n    else\n        return false;\n}\nint main()\n{\n    int a;\n    cin>>a;\n    for(int i=1;i<=300;i++){\n        string b=tran(i,a);\n        string c=tran(i*i,a);\n        if(t(c)){\n            for(int j=0;j<int(b.size());j++)\n               cout<<b[j];\n            cout<<' ';\n            for(int z=0;z<int(c.size());z++)\n                cout<<c[z];\n            cout<<endl;\n        }\n    }\n}",ACCEPTED,30,508
1279674502810632192,cf92d4855910fe09050cdec3375cd8505b0c4bb49d0095b0913759510fb9a7b7,2020-07-05 15:12:31,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nstring tran(int numb, int r) {\n\tchar b[10]{ 'A','B','C','D','E','F','G','H','I','J' };\n\tstring b2 = \""\"";\n\twhile (numb != 0) {\n\t\tint l;\n\t\tl = numb % r;\n\t\tnumb = numb / r;\n\t\tif (l>= 10) \n\t\t\tb2 += b[l % 10];\n\t\telse \n\t\t\tb2 += to_string(l);\n\t}\n\tint len = b2.size();\n\tfor (int i = 0; i < (len / 2); i++) {\n\t\tchar temp = b2[i];\n\t\tb2[i] = b2[len - i - 1];\n\t\tb2[len - i - 1] = temp;\n\t}\n\treturn b2;\n}\nbool t(string num) {\n\tif (num.size() == 1) \n        return true;\n\tint len = num.size();\n\tint count = 0;\n\tfor (int i = 0; i < len; i++) {\n\t\tif (num[i] == num[len - i - 1])\n\t\t\tcount++;\n\t}\n\tif (count == len) \n\t\treturn true;\n\telse\n\t\treturn false;\n}\nint main() {\n\tint a,b,c;\n    a=b=c=0;\n\tcin >> a >> b;\n\tint i = b + 1;\n\twhile (c < a) {\n\t\tint count = 0;\n\t\tfor (int s = 2; s <= 10; s++) {\n\t\t\tbool d = t(tran(i, s));\n\t\t\tif (d)\n\t\t\t\tcount++;\n\t\t}\n\t\tif (count >= 2) {\n\t\t\tcout << i << endl;\n\t\t\tc++;\n\t\t}\n\t\ti++;\n\t}\n}",ACCEPTED,77,512
1279675005590233088,eccaecdbc9ad5dde80e7ad836c40e65f3763048c5ac5f4debc09de6ad9c401e6,2020-07-05 15:14:31,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>\n\n#define rep(i,a,n) for(int i=a;i<n;i++)\n#define reps(i,a,n) for(int i=a;i>n;i--)\n#define edl() cout<<endl\n#define ll long long\n#define db(x) if(DEBUG) cout<<\""{\""<<#x<<\""=\""<<(x)<<\""}\"";\n\nusing namespace std;\n\nconst bool DEBUG=0;\nconst int inf = 0x7fffffff;\nconst int mod = (int)1e9+9;\nconst int N = 500015;\nint n,m,s;\n\nint rd(){\n\tint ans=0;char p=getchar();\n\twhile(p<'0'||p>'9') p=getchar();\n\twhile(p>='0'&&p<='9') ans=ans*10+p-'0',p=getchar();\n\treturn ans;\n}\nchar ch1[100]={0};\n\nbool isHui() {\n  int leng = strlen(ch1);\n  for(int j=0;j<leng/2;j++) {\n    // printf(\""{%c,%c}\"",ch1[j],ch1[leng-j-1]);\n    if(ch1[j] != ch1[leng-j-1]) return false;\n  }\n  return true;\n}\n\nint main(){\n  ios::sync_with_stdio(false);\n\tcin>>n;\n\n  for(int i=1;i<=300;i++) {\n    memset(ch1,0,sizeof(ch1));\n    _itoa(i*i,ch1,n);\n    // cout<<ch1<<\""  \""<<strlen(ch1)<<endl;\n    if(isHui()) printf(\""%d %d\\n\"",i,i*i);\n  }\n  \n\treturn 0;\n}",COMPILE_ERROR,0,0
1279675357223903232,eccaecdbc9ad5dde80e7ad836c40e65f3763048c5ac5f4debc09de6ad9c401e6,2020-07-05 15:15:55,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>\n\n#define rep(i,a,n) for(int i=a;i<n;i++)\n#define reps(i,a,n) for(int i=a;i>n;i--)\n#define edl() cout<<endl\n#define ll long long\n#define db(x) if(DEBUG) cout<<\""{\""<<#x<<\""=\""<<(x)<<\""}\"";\n\nusing namespace std;\n\nconst bool DEBUG=0;\nconst int inf = 0x7fffffff;\nconst int mod = (int)1e9+9;\nconst int N = 500015;\nint n,m,s;\n\nint rd(){\n\tint ans=0;char p=getchar();\n\twhile(p<'0'||p>'9') p=getchar();\n\twhile(p>='0'&&p<='9') ans=ans*10+p-'0',p=getchar();\n\treturn ans;\n}\nchar ch1[100]={0};\n\nbool isHui() {\n  int leng = strlen(ch1);\n  for(int j=0;j<leng/2;j++) {\n    // printf(\""{%c,%c}\"",ch1[j],ch1[leng-j-1]);\n    if(ch1[j] != ch1[leng-j-1]) return false;\n  }\n  return true;\n}\n\nint main(){\n  ios::sync_with_stdio(false);\n\tcin>>n;\n\n  for(int i=1;i<=300;i++) {\n    memset(ch1,0,sizeof(ch1));\n    itoa(i*i,ch1,n);\n    // cout<<ch1<<\""  \""<<strlen(ch1)<<endl;\n    if(isHui()) printf(\""%d %d\\n\"",i,i*i);\n  }\n  \n\treturn 0;\n}",COMPILE_ERROR,0,0
1279675639735443456,b05d9f4f8ae94e871d055cf9cc40d00027e969fe8ebc83bb7ae29282cc9efd75,2020-07-05 15:17:02,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"//\n//  main.cpp\n//  test\n//\n//  Created by tanghuaxin on 2020/7/4.\n//  Copyright © 2020 tanghuaxin. All rights reserved.\n//\n\n#include <iostream>\n#include<string>\n\nusing namespace std;\n\nbool jud(string a){\n    int len=a.length(),flag=1;\n    for(int i=0;i<len/2;i++){\n        if(a[i]!=a[len-i-1]||a[i]==0){\n            flag=0;\n            break;\n        }\n    }\n    if(flag==1){\n        return true;\n    }\n    else{\n        return false;\n    }\n}\n\nstring tra(int n,int b){\n    string ans=\""\"";\n    do{\n        int t=n%b;\n    if(t>=0&&t<=9){\n        ans+=t+'0';\n        \n    }\n    else{\n        ans+=t-10+'A';\n    }\n        n/=b;}while(n!=0);\n    reverse(ans.begin(),ans.end() );\n    return ans;\n    \n}\n\n\n\n\n\nint main(int argc, const char * argv[]) {\n    // insert code here...\n    int n,s,co1=0,co2=0;\n    cin>>n;\n    cin>>s;\n    for(int i=s+1;i<10000;i++){\n        for(int j=2;j<11;j++){\n            if(jud(tra(i,j))){\n                \n                co1++;\n            }\n        }\n        if(co1>=3){\n            cout<<i<<endl;\n            co2++;\n        }\n        if(co2==n){\n            break;\n        }\n    }\n    \n    \n    return 0;\n}\n",COMPILE_ERROR,0,0
1279675910406463488,eccaecdbc9ad5dde80e7ad836c40e65f3763048c5ac5f4debc09de6ad9c401e6,2020-07-05 15:18:06,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>\n\n#define rep(i,a,n) for(int i=a;i<n;i++)\n#define reps(i,a,n) for(int i=a;i>n;i--)\n#define edl() cout<<endl\n#define ll long long\n#define db(x) if(DEBUG) cout<<\""{\""<<#x<<\""=\""<<(x)<<\""}\"";\n\nusing namespace std;\n\nconst bool DEBUG=0;\nconst int inf = 0x7fffffff;\nconst int mod = (int)1e9+9;\nconst int N = 500015;\nint n,m,s;\n\nint rd(){\n\tint ans=0;char p=getchar();\n\twhile(p<'0'||p>'9') p=getchar();\n\twhile(p>='0'&&p<='9') ans=ans*10+p-'0',p=getchar();\n\treturn ans;\n}\nchar ch1[100]={0};\nstring azhe;\nbool isHui() {\n  int leng = strlen(azhe.c_str());\n  for(int j=0;j<leng/2;j++) {\n    // printf(\""{%c,%c}\"",ch1[j],ch1[leng-j-1]);\n    if(azhe[j] != azhe[leng-j-1]) return false;\n  }\n  return true;\n}\n\nstring Itoa(int Num,int R)\n{\n  string remain=\""\"";\n  int temp;\n  do {\n   temp = Num%R;//取余\n   Num /= R;\n   if (temp >= 10)\n\t   remain += temp - 10 + 'A';//任意进制为大于基数大于10的进制 例如，十六进制\n   else remain += temp + '0';\n  } while (Num);\n  reverse(remain.begin(),remain.end());//逆序\n  return remain;\n}\n\n\nint main(){\n  ios::sync_with_stdio(false);\n\tcin>>n;\n\n  for(int i=1;i<=300;i++) {\n    memset(ch1,0,sizeof(ch1));\n    // _itoa(i*i,ch1,n);\n    azhe = Itoa(i*i,n);\n    // cout<<ch1<<\""  \""<<strlen(ch1)<<endl;\n    if(isHui()) printf(\""%d %d\\n\"",i,i*i);\n  }\n  \n\treturn 0;\n}",PARTIAL_ACCEPTED,40,384
1279676078921015296,eccaecdbc9ad5dde80e7ad836c40e65f3763048c5ac5f4debc09de6ad9c401e6,2020-07-05 15:18:47,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>\n\n#define rep(i,a,n) for(int i=a;i<n;i++)\n#define reps(i,a,n) for(int i=a;i>n;i--)\n#define edl() cout<<endl\n#define ll long long\n#define db(x) if(DEBUG) cout<<\""{\""<<#x<<\""=\""<<(x)<<\""}\"";\n\nusing namespace std;\n\nconst bool DEBUG=0;\nconst int inf = 0x7fffffff;\nconst int mod = (int)1e9+9;\nconst int N = 500015;\nint n,m,s;\n\nint rd(){\n\tint ans=0;char p=getchar();\n\twhile(p<'0'||p>'9') p=getchar();\n\twhile(p>='0'&&p<='9') ans=ans*10+p-'0',p=getchar();\n\treturn ans;\n}\nchar ch1[100]={0};\nstring azhe;\nbool isHui() {\n  int leng = strlen(azhe.c_str());\n  for(int j=0;j<leng/2;j++) {\n    // printf(\""{%c,%c}\"",ch1[j],ch1[leng-j-1]);\n    if(azhe[j] != azhe[leng-j-1]) return false;\n  }\n  return true;\n}\n\nstring Itoa(int Num,int R)\n{\n  string remain=\""\"";\n  int temp;\n  do {\n   temp = Num%R;//取余\n   Num /= R;\n   if (temp >= 10)\n\t   remain += temp - 10 + 'A';//任意进制为大于基数大于10的进制 例如，十六进制\n   else remain += temp + '0';\n  } while (Num);\n  reverse(remain.begin(),remain.end());//逆序\n  return remain;\n}\n\n\nint main(){\n  ios::sync_with_stdio(false);\n\tcin>>n;\n\n  for(int i=1;i<=300;i++) {\n    memset(ch1,0,sizeof(ch1));\n    azhe = Itoa(i*i,n);\n    if(isHui()) printf(\""%s %s\\n\"",Itoa(i,n),Itoa(i*i,n));\n  }\n  \n\treturn 0;\n}",WRONG_ANSWER,42,632
1279676227181273088,b05d9f4f8ae94e871d055cf9cc40d00027e969fe8ebc83bb7ae29282cc9efd75,2020-07-05 15:19:22,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"//\n//  main.cpp\n//  test\n//\n//  Created by tanghuaxin on 2020/7/4.\n//  Copyright © 2020 tanghuaxin. All rights reserved.\n//\n\n#include <iostream>\n#include<string>\n#include<cstring>\n\nusing namespace std;\n\nbool jud(string a){\n    int len=a.length(),flag=1;\n    for(int i=0;i<len/2;i++){\n        if(a[i]!=a[len-i-1]||a[i]==0){\n            flag=0;\n            break;\n        }\n    }\n    if(flag==1){\n        return true;\n    }\n    else{\n        return false;\n    }\n}\n\nstring tra(int n,int b){\n    string ans=\""\"";\n    do{\n        int t=n%b;\n    if(t>=0&&t<=9){\n        ans+=t+'0';\n        \n    }\n    else{\n        ans+=t-10+'A';\n    }\n        n/=b;}while(n!=0);\n    reverse(ans.begin(),ans.end() );\n    return ans;\n    \n}\n\n\n\n\n\nint main(int argc, const char * argv[]) {\n    // insert code here...\n    int n,s,co1=0,co2=0;\n    cin>>n;\n    cin>>s;\n    for(int i=s+1;i<10000;i++){\n        for(int j=2;j<11;j++){\n            if(jud(tra(i,j))){\n                \n                co1++;\n            }\n        }\n        if(co1>=3){\n            cout<<i<<endl;\n            co2++;\n        }\n        if(co2==n){\n            break;\n        }\n    }\n    \n    \n    return 0;\n}\n",COMPILE_ERROR,0,0
1279676298476060672,b05d9f4f8ae94e871d055cf9cc40d00027e969fe8ebc83bb7ae29282cc9efd75,2020-07-05 15:19:39,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"//\n//  main.cpp\n//  test\n//\n//  Created by tanghuaxin on 2020/7/4.\n//  Copyright © 2020 tanghuaxin. All rights reserved.\n//\n\n#include<iostream>\n#include<string>\n#include<cstring>\n\nusing namespace std;\n\nbool jud(string a){\n    int len=a.length(),flag=1;\n    for(int i=0;i<len/2;i++){\n        if(a[i]!=a[len-i-1]||a[i]==0){\n            flag=0;\n            break;\n        }\n    }\n    if(flag==1){\n        return true;\n    }\n    else{\n        return false;\n    }\n}\n\nstring tra(int n,int b){\n    string ans=\""\"";\n    do{\n        int t=n%b;\n    if(t>=0&&t<=9){\n        ans+=t+'0';\n        \n    }\n    else{\n        ans+=t-10+'A';\n    }\n        n/=b;}while(n!=0);\n    reverse(ans.begin(),ans.end() );\n    return ans;\n    \n}\n\n\n\n\n\nint main(int argc, const char * argv[]) {\n    // insert code here...\n    int n,s,co1=0,co2=0;\n    cin>>n;\n    cin>>s;\n    for(int i=s+1;i<10000;i++){\n        for(int j=2;j<11;j++){\n            if(jud(tra(i,j))){\n                \n                co1++;\n            }\n        }\n        if(co1>=3){\n            cout<<i<<endl;\n            co2++;\n        }\n        if(co2==n){\n            break;\n        }\n    }\n    \n    \n    return 0;\n}\n",COMPILE_ERROR,0,0
1279676321083359232,eccaecdbc9ad5dde80e7ad836c40e65f3763048c5ac5f4debc09de6ad9c401e6,2020-07-05 15:19:44,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>\n\n#define rep(i,a,n) for(int i=a;i<n;i++)\n#define reps(i,a,n) for(int i=a;i>n;i--)\n#define edl() cout<<endl\n#define ll long long\n#define db(x) if(DEBUG) cout<<\""{\""<<#x<<\""=\""<<(x)<<\""}\"";\n\nusing namespace std;\n\nconst bool DEBUG=0;\nconst int inf = 0x7fffffff;\nconst int mod = (int)1e9+9;\nconst int N = 500015;\nint n,m,s;\n\nint rd(){\n\tint ans=0;char p=getchar();\n\twhile(p<'0'||p>'9') p=getchar();\n\twhile(p>='0'&&p<='9') ans=ans*10+p-'0',p=getchar();\n\treturn ans;\n}\nchar ch1[100]={0};\nstring azhe;\nbool isHui() {\n  int leng = strlen(azhe.c_str());\n  for(int j=0;j<leng/2;j++) {\n    // printf(\""{%c,%c}\"",ch1[j],ch1[leng-j-1]);\n    if(azhe[j] != azhe[leng-j-1]) return false;\n  }\n  return true;\n}\n\nstring Itoa(int Num,int R)\n{\n  string remain=\""\"";\n  int temp;\n  do {\n   temp = Num%R;//取余\n   Num /= R;\n   if (temp >= 10)\n\t   remain += temp - 10 + 'A';//任意进制为大于基数大于10的进制 例如，十六进制\n   else remain += temp + '0';\n  } while (Num);\n  reverse(remain.begin(),remain.end());//逆序\n  return remain;\n}\n\n\nint main(){\n  ios::sync_with_stdio(false);\n\tcin>>n;\n\n  for(int i=1;i<=300;i++) {\n    memset(ch1,0,sizeof(ch1));\n    azhe = Itoa(i*i,n);\n    if(isHui()) cout<<Itoa(i,n)<<' '<<Itoa(i*i,n)<<endl;\n  }\n  \n\treturn 0;\n}",ACCEPTED,42,512
1279676636880896000,b05d9f4f8ae94e871d055cf9cc40d00027e969fe8ebc83bb7ae29282cc9efd75,2020-07-05 15:21:00,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"//\n//  main.cpp\n//  test\n//\n//  Created by tanghuaxin on 2020/7/4.\n//  Copyright © 2020 tanghuaxin. All rights reserved.\n//\n\n#include <iostream>\n#include<string>\n#include<cstring>\n\nusing namespace std;\n\nbool jud(string a){\n    int len=a.length(),flag=1;\n    for(int i=0;i<len/2;i++){\n        if(a[i]!=a[len-i-1]||a[i]==0){\n            flag=0;\n            break;\n        }\n    }\n    if(flag==1){\n        return true;\n    }\n    else{\n        return false;\n    }\n}\n\nstring tra(int n,int b){\n    string ans=\""\"";\n    do{\n        int t=n%b;\n    if(t>=0&&t<=9){\n        ans+=t+'0';\n        \n    }\n    else{\n        ans+=t-10+'A';\n    }\n        n/=b;}while(n!=0);\n    reverse(ans.begin(),ans.end() );\n    return ans;\n    \n}\n\n\n\n\n\nint main(int argc, const char * argv[]) {\n    // insert code here...\n    int n,s,co1=0,co2=0;\n    cin>>n;\n    cin>>s;\n    for(int i=s+1;i<10000;i++){\n        for(int j=2;j<11;j++){\n            if(jud(tra(i,j))){\n                \n                co1++;\n            }\n        }\n        if(co1>=3){\n            cout<<i-1<<endl;\n            co2++;\n        }\n        if(co2==n){\n            break;\n        }\n    }\n    \n    \n    return 0;\n}\n",COMPILE_ERROR,0,0
1279676765323059200,b05d9f4f8ae94e871d055cf9cc40d00027e969fe8ebc83bb7ae29282cc9efd75,2020-07-05 15:21:30,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"//\n//  main.cpp\n//  test\n//\n//  Created by tanghuaxin on 2020/7/4.\n//  Copyright © 2020 tanghuaxin. All rights reserved.\n//\n\n#include<string>\n#include<cstring>\n\nusing namespace std;\n\nbool jud(string a){\n    int len=a.length(),flag=1;\n    for(int i=0;i<len/2;i++){\n        if(a[i]!=a[len-i-1]||a[i]==0){\n            flag=0;\n            break;\n        }\n    }\n    if(flag==1){\n        return true;\n    }\n    else{\n        return false;\n    }\n}\n\nstring tra(int n,int b){\n    string ans=\""\"";\n    do{\n        int t=n%b;\n    if(t>=0&&t<=9){\n        ans+=t+'0';\n        \n    }\n    else{\n        ans+=t-10+'A';\n    }\n        n/=b;}while(n!=0);\n    reverse(ans.begin(),ans.end() );\n    return ans;\n    \n}\n\n\n\n\n\nint main(int argc, const char * argv[]) {\n    // insert code here...\n    int n,s,co1=0,co2=0;\n    cin>>n;\n    cin>>s;\n    for(int i=s+1;i<10000;i++){\n        for(int j=2;j<11;j++){\n            if(jud(tra(i,j))){\n                \n                co1++;\n            }\n        }\n        if(co1>=3){\n            cout<<i-1<<endl;\n            co2++;\n        }\n        if(co2==n){\n            break;\n        }\n    }\n    \n    \n    return 0;\n}\n",COMPILE_ERROR,0,0
1279676904477483008,b05d9f4f8ae94e871d055cf9cc40d00027e969fe8ebc83bb7ae29282cc9efd75,2020-07-05 15:22:03,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"//\n//  main.cpp\n//  test\n//\n//  Created by tanghuaxin on 2020/7/4.\n//  Copyright © 2020 tanghuaxin. All rights reserved.\n//\n#include <iostream>\n#include <cstdio>\n#include<string>\n#include<cstring>\n\nusing namespace std;\n\nbool jud(string a){\n    int len=a.length(),flag=1;\n    for(int i=0;i<len/2;i++){\n        if(a[i]!=a[len-i-1]||a[i]==0){\n            flag=0;\n            break;\n        }\n    }\n    if(flag==1){\n        return true;\n    }\n    else{\n        return false;\n    }\n}\n\nstring tra(int n,int b){\n    string ans=\""\"";\n    do{\n        int t=n%b;\n    if(t>=0&&t<=9){\n        ans+=t+'0';\n        \n    }\n    else{\n        ans+=t-10+'A';\n    }\n        n/=b;}while(n!=0);\n    reverse(ans.begin(),ans.end() );\n    return ans;\n    \n}\n\n\n\n\n\nint main(int argc, const char * argv[]) {\n    // insert code here...\n    int n,s,co1=0,co2=0;\n    cin>>n;\n    cin>>s;\n    for(int i=s+1;i<10000;i++){\n        for(int j=2;j<11;j++){\n            if(jud(tra(i,j))){\n                \n                co1++;\n            }\n        }\n        if(co1>=3){\n            cout<<i-1<<endl;\n            co2++;\n        }\n        if(co2==n){\n            break;\n        }\n    }\n    \n    \n    return 0;\n}\n",COMPILE_ERROR,0,0
1279677254693486592,b05d9f4f8ae94e871d055cf9cc40d00027e969fe8ebc83bb7ae29282cc9efd75,2020-07-05 15:23:27,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"//\n//  main.cpp\n//  test\n//\n//  Created by tanghuaxin on 2020/7/4.\n//  Copyright © 2020 tanghuaxin. All rights reserved.\n//\n#include <iostream>\n#include <cstdio>\n#include <string>\n#include <cstring>\n\nusing namespace std;\n\nbool jud(string a){\n    int len=a.length(),flag=1;\n    for(int i=0;i<len/2;i++){\n        if(a[i]!=a[len-i-1]||a[i]==0){\n            flag=0;\n            break;\n        }\n    }\n    if(flag==1){\n        return true;\n    }\n    else{\n        return false;\n    }\n}\n\nstring tra(int n,int b){\n    string ans=\""\"";\n    do{\n        int t=n%b;\n    if(t>=0&&t<=9){\n        ans+=t+'0';\n        \n    }\n    else{\n        ans+=t-10+'A';\n    }\n        n/=b;}while(n!=0);\n    reverse(ans.begin(),ans.end() );\n    return ans;\n    \n}\n\n\n\n\n\nint main(int argc, const char * argv[]) {\n    // insert code here...\n    int n,s,co1=0,co2=0;\n    cin>>n;\n    cin>>s;\n    for(int i=s+1;i<10000;i++){\n        for(int j=2;j<11;j++){\n            if(jud(tra(i,j))){\n                \n                co1++;\n            }\n        }\n        if(co1>=3){\n            cout<<i-1<<endl;\n            co2++;\n        }\n        if(co2==n){\n            break;\n        }\n    }\n    \n    \n    return 0;\n}\n",COMPILE_ERROR,0,0
1279677264596238336,b05d9f4f8ae94e871d055cf9cc40d00027e969fe8ebc83bb7ae29282cc9efd75,2020-07-05 15:23:29,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"//\n//  main.cpp\n//  test\n//\n//  Created by tanghuaxin on 2020/7/4.\n//  Copyright © 2020 tanghuaxin. All rights reserved.\n//\n#include <iostream>\n#include <cstdio>\n#include <string>\n#include <cstring>\n\nusing namespace std;\n\nbool jud(string a){\n    int len=a.length(),flag=1;\n    for(int i=0;i<len/2;i++){\n        if(a[i]!=a[len-i-1]||a[i]==0){\n            flag=0;\n            break;\n        }\n    }\n    if(flag==1){\n        return true;\n    }\n    else{\n        return false;\n    }\n}\n\nstring tra(int n,int b){\n    string ans=\""\"";\n    do{\n        int t=n%b;\n    if(t>=0&&t<=9){\n        ans+=t+'0';\n        \n    }\n    else{\n        ans+=t-10+'A';\n    }\n        n/=b;}while(n!=0);\n    reverse(ans.begin(),ans.end() );\n    return ans;\n    \n}\n\n\n\n\n\nint main(int argc, const char * argv[]) {\n    // insert code here...\n    int n,s,co1=0,co2=0;\n    cin>>n;\n    cin>>s;\n    for(int i=s+1;i<10000;i++){\n        for(int j=2;j<11;j++){\n            if(jud(tra(i,j))){\n                \n                co1++;\n            }\n        }\n        if(co1>=3){\n            cout<<i-1<<endl;\n            co2++;\n        }\n        if(co2==n){\n            break;\n        }\n    }\n    \n    \n    return 0;\n}\n",COMPILE_ERROR,0,0
1279677317352185856,b05d9f4f8ae94e871d055cf9cc40d00027e969fe8ebc83bb7ae29282cc9efd75,2020-07-05 15:23:42,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"//\n//  main.cpp\n//  test\n//\n//  Created by tanghuaxin on 2020/7/4.\n//  Copyright © 2020 tanghuaxin. All rights reserved.\n//\n#include <iostream>;\n#include <cstdio>;\n#include <string>;\n#include <cstring>;\n\nusing namespace std;\n\nbool jud(string a){\n    int len=a.length(),flag=1;\n    for(int i=0;i<len/2;i++){\n        if(a[i]!=a[len-i-1]||a[i]==0){\n            flag=0;\n            break;\n        }\n    }\n    if(flag==1){\n        return true;\n    }\n    else{\n        return false;\n    }\n}\n\nstring tra(int n,int b){\n    string ans=\""\"";\n    do{\n        int t=n%b;\n    if(t>=0&&t<=9){\n        ans+=t+'0';\n        \n    }\n    else{\n        ans+=t-10+'A';\n    }\n        n/=b;}while(n!=0);\n    reverse(ans.begin(),ans.end() );\n    return ans;\n    \n}\n\n\n\n\n\nint main(int argc, const char * argv[]) {\n    // insert code here...\n    int n,s,co1=0,co2=0;\n    cin>>n;\n    cin>>s;\n    for(int i=s+1;i<10000;i++){\n        for(int j=2;j<11;j++){\n            if(jud(tra(i,j))){\n                \n                co1++;\n            }\n        }\n        if(co1>=3){\n            cout<<i-1<<endl;\n            co2++;\n        }\n        if(co2==n){\n            break;\n        }\n    }\n    \n    \n    return 0;\n}\n",COMPILE_ERROR,0,0
1279677405025722368,b05d9f4f8ae94e871d055cf9cc40d00027e969fe8ebc83bb7ae29282cc9efd75,2020-07-05 15:24:03,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"//\n//  main.cpp\n//  test\n//\n//  Created by tanghuaxin on 2020/7/4.\n//  Copyright © 2020 tanghuaxin. All rights reserved.\n//\n#include <iostream>\n#include <cstdio>\n#include <string>\n#include <cstring>\n\nusing namespace std;\n\nbool jud(string a){\n    int len=a.length(),flag=1;\n    for(int i=0;i<len/2;i++){\n        if(a[i]!=a[len-i-1]||a[i]==0){\n            flag=0;\n            break;\n        }\n    }\n    if(flag==1){\n        return true;\n    }\n    else{\n        return false;\n    }\n}\n\nstring tra(int n,int b){\n    string ans=\""\"";\n    do{\n        int t=n%b;\n    if(t>=0&&t<=9){\n        ans+=t+'0';\n        \n    }\n    else{\n        ans+=t-10+'A';\n    }\n        n/=b;}while(n!=0);\n    reverse(ans.begin(),ans.end() );\n    return ans;\n    \n}\n\n\n\n\n\nint main(int argc, const char * argv[]) {\n    // insert code here...\n    int n,s,co1=0,co2=0;\n    cin>>n;\n    cin>>s;\n    for(int i=s+1;i<10000;i++){\n        for(int j=2;j<11;j++){\n            if(jud(tra(i,j))){\n                \n                co1++;\n            }\n        }\n        if(co1>=3){\n            cout<<i-1<<endl;\n            co2++;\n        }\n        if(co2==n){\n            break;\n        }\n    }\n    \n    \n    return 0;\n}\n",COMPILE_ERROR,0,0
1279677452756901888,b05d9f4f8ae94e871d055cf9cc40d00027e969fe8ebc83bb7ae29282cc9efd75,2020-07-05 15:24:14,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"//\n//  main.cpp\n//  test\n//\n//  Created by tanghuaxin on 2020/7/4.\n//  Copyright © 2020 tanghuaxin. All rights reserved.\n#include <iostream>\n#include <cstdio>\n#include <string>\n#include <cstring>\n\nusing namespace std;\n\nbool jud(string a){\n    int len=a.length(),flag=1;\n    for(int i=0;i<len/2;i++){\n        if(a[i]!=a[len-i-1]||a[i]==0){\n            flag=0;\n            break;\n        }\n    }\n    if(flag==1){\n        return true;\n    }\n    else{\n        return false;\n    }\n}\n\nstring tra(int n,int b){\n    string ans=\""\"";\n    do{\n        int t=n%b;\n    if(t>=0&&t<=9){\n        ans+=t+'0';\n        \n    }\n    else{\n        ans+=t-10+'A';\n    }\n        n/=b;}while(n!=0);\n    reverse(ans.begin(),ans.end() );\n    return ans;\n    \n}\n\n\n\n\n\nint main(int argc, const char * argv[]) {\n    // insert code here...\n    int n,s,co1=0,co2=0;\n    cin>>n;\n    cin>>s;\n    for(int i=s+1;i<10000;i++){\n        for(int j=2;j<11;j++){\n            if(jud(tra(i,j))){\n                \n                co1++;\n            }\n        }\n        if(co1>=3){\n            cout<<i-1<<endl;\n            co2++;\n        }\n        if(co2==n){\n            break;\n        }\n    }\n    \n    \n    return 0;\n}\n",COMPILE_ERROR,0,0
1279677556431716352,b05d9f4f8ae94e871d055cf9cc40d00027e969fe8ebc83bb7ae29282cc9efd75,2020-07-05 15:24:39,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"//\n//  main.cpp\n//  test\n//\n//  Created by tanghuaxin on 2020/7/4.\n//  Copyright © 2020 tanghuaxin. All rights reserved.\n#include <iostream>\n#include <cstdio>\n#include <string>\n#include <cstring>\n\nusing namespace std;\n\nbool jud(string a){\n    int len=a.length(),flag=1;\n    for(int i=0;i<len/2;i++){\n        if(a[i]!=a[len-i-1]||a[i]==0){\n            flag=0;\n            break;\n        }\n    }\n    if(flag==1){\n        return true;\n    }\n    else{\n        return false;\n    }\n}\n\nstring tra(int n,int b){\n    string ans=\""\"";\n    do{\n        int t=n%b;\n    if(t>=0&&t<=9){\n        ans+=t+'0';\n        \n    }\n    else{\n        ans+=t-10+'A';\n    }\n        n/=b;}while(n!=0);\n    reverse(ans.begin(),ans.end() );\n    return ans;\n    \n}\n\n\n\n\n\nint main(int argc, const char * argv[]) {\n    // insert code here...\n    int n,s,co1=0,co2=0;\n    cin>>n;\n    cin>>s;\n    for(int i=s+1;i<10000;i++){\n        for(int j=2;j<11;j++){\n            if(jud(tra(i,j))){\n                \n                co1++;\n            }\n        }\n        if(co1>=3){\n            cout<<i-1<<endl;\n            co2++;\n        }\n        if(co2==n){\n            break;\n        }\n    }\n    \n    \n    return 0;\n}\n",COMPILE_ERROR,0,0
1279677716415045632,eccaecdbc9ad5dde80e7ad836c40e65f3763048c5ac5f4debc09de6ad9c401e6,2020-07-05 15:25:17,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <bits/stdc++.h>\n\n#define rep(i,a,n) for(int i=a;i<n;i++)\n#define reps(i,a,n) for(int i=a;i>n;i--)\n#define edl() cout<<endl\n#define ll long long\n#define db(x) if(DEBUG) cout<<\""{\""<<#x<<\""=\""<<(x)<<\""}\"";\n\nusing namespace std;\n\nconst bool DEBUG=0;\nconst int inf = 0x7fffffff;\nconst int mod = (int)1e9+9;\nconst int N = 500015;\nint n,m,s;\n\nint rd(){\n\tint ans=0;char p=getchar();\n\twhile(p<'0'||p>'9') p=getchar();\n\twhile(p>='0'&&p<='9') ans=ans*10+p-'0',p=getchar();\n\treturn ans;\n}\nchar ch1[100]={0};\nstring azhe;\nbool isHui() {\n  int leng = strlen(azhe.c_str());\n  for(int j=0;j<leng/2;j++) {\n    // printf(\""{%c,%c}\"",ch1[j],ch1[leng-j-1]);\n    if(azhe[j] != azhe[leng-j-1]) return false;\n  }\n  return true;\n}\n\nstring Itoa(int Num,int R)\n{\n  string remain=\""\"";\n  int temp;\n  do {\n   temp = Num%R;//取余\n   Num /= R;\n   if (temp >= 10)\n\t   remain += temp - 10 + 'A';//任意进制为大于基数大于10的进制 例如，十六进制\n   else remain += temp + '0';\n  } while (Num);\n  reverse(remain.begin(),remain.end());//逆序\n  return remain;\n}\n\n\nint main(){\n  ios::sync_with_stdio(false);\n\tcin>>n>>m;\n  bool flag1 = false, flag2 = false;\n  while(true) {\n    for(int i=2;i<=10;i++) {\n      azhe = Itoa(m,i);\n      if(isHui()) {\n        if(!flag1) flag1 = true;\n        else {\n          flag2 = true;\n          break;\n        }\n      }\n    }\n    if(flag2 == true) {\n      cout<<m<<endl;\n    }\n    flag1 = false, flag2 = false;\n    m++;\n    n-=1;\n    if(n==-1) return 0;\n  }\n\treturn 0;\n}",WRONG_ANSWER,21,428
1279677957717549056,eccaecdbc9ad5dde80e7ad836c40e65f3763048c5ac5f4debc09de6ad9c401e6,2020-07-05 15:26:15,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <bits/stdc++.h>\n\n#define rep(i,a,n) for(int i=a;i<n;i++)\n#define reps(i,a,n) for(int i=a;i>n;i--)\n#define edl() cout<<endl\n#define ll long long\n#define db(x) if(DEBUG) cout<<\""{\""<<#x<<\""=\""<<(x)<<\""}\"";\n\nusing namespace std;\n\nconst bool DEBUG=0;\nconst int inf = 0x7fffffff;\nconst int mod = (int)1e9+9;\nconst int N = 500015;\nint n,m,s;\n\nint rd(){\n\tint ans=0;char p=getchar();\n\twhile(p<'0'||p>'9') p=getchar();\n\twhile(p>='0'&&p<='9') ans=ans*10+p-'0',p=getchar();\n\treturn ans;\n}\nchar ch1[100]={0};\nstring azhe;\nbool isHui() {\n  int leng = strlen(azhe.c_str());\n  for(int j=0;j<leng/2;j++) {\n    // printf(\""{%c,%c}\"",ch1[j],ch1[leng-j-1]);\n    if(azhe[j] != azhe[leng-j-1]) return false;\n  }\n  return true;\n}\n\nstring Itoa(int Num,int R)\n{\n  string remain=\""\"";\n  int temp;\n  do {\n   temp = Num%R;//取余\n   Num /= R;\n   if (temp >= 10)\n\t   remain += temp - 10 + 'A';//任意进制为大于基数大于10的进制 例如，十六进制\n   else remain += temp + '0';\n  } while (Num);\n  reverse(remain.begin(),remain.end());//逆序\n  return remain;\n}\n\n\nint main(){\n  ios::sync_with_stdio(false);\n\tcin>>n>>m;\n  bool flag1 = false, flag2 = false;\n  m+=1;\n  while(true) {\n    for(int i=2;i<=10;i++) {\n      azhe = Itoa(m,i);\n      if(isHui()) {\n        if(!flag1) flag1 = true;\n        else {\n          flag2 = true;\n          break;\n        }\n      }\n    }\n    if(flag2 == true) {\n      cout<<m<<endl;\n    }\n    flag1 = false, flag2 = false;\n    m++;\n    n-=1;\n    if(n==-1) return 0;\n  }\n\treturn 0;\n}",WRONG_ANSWER,36,512
1279678103771611136,b05d9f4f8ae94e871d055cf9cc40d00027e969fe8ebc83bb7ae29282cc9efd75,2020-07-05 15:26:49,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"//\n//  main.cpp\n//  test\n//\n//  Created by tanghuaxin on 2020/7/4.\n//  Copyright © 2020 tanghuaxin. All rights reserved.\n#include <iostream.h>\n#include <cstdio>\n#include <string>\n#include <cstring>\n\nusing namespace std;\n\nbool jud(string a){\n    int len=a.length(),flag=1;\n    for(int i=0;i<len/2;i++){\n        if(a[i]!=a[len-i-1]||a[i]==0){\n            flag=0;\n            break;\n        }\n    }\n    if(flag==1){\n        return true;\n    }\n    else{\n        return false;\n    }\n}\n\nstring tra(int n,int b){\n    string ans=\""\"";\n    do{\n        int t=n%b;\n    if(t>=0&&t<=9){\n        ans+=t+'0';\n        \n    }\n    else{\n        ans+=t-10+'A';\n    }\n        n/=b;}while(n!=0);\n    reverse(ans.begin(),ans.end() );\n    return ans;\n    \n}\n\n\n\n\n\nint main(int argc, const char * argv[]) {\n    // insert code here...\n    int n,s,co1=0,co2=0;\n    cin>>n;\n    cin>>s;\n    for(int i=s+1;i<10000;i++){\n        for(int j=2;j<11;j++){\n            if(jud(tra(i,j))){\n                \n                co1++;\n            }\n        }\n        if(co1>=3){\n            cout<<i-1<<endl;\n            co2++;\n        }\n        if(co2==n){\n            break;\n        }\n    }\n    \n    \n    return 0;\n}\n",COMPILE_ERROR,0,0
1279678116878802944,b05d9f4f8ae94e871d055cf9cc40d00027e969fe8ebc83bb7ae29282cc9efd75,2020-07-05 15:26:52,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"//\n//  main.cpp\n//  test\n//\n//  Created by tanghuaxin on 2020/7/4.\n//  Copyright © 2020 tanghuaxin. All rights reserved.\n#include <iostream.h>\n#include <cstdio>\n#include <string>\n#include <cstring>\n\nusing namespace std;\n\nbool jud(string a){\n    int len=a.length(),flag=1;\n    for(int i=0;i<len/2;i++){\n        if(a[i]!=a[len-i-1]||a[i]==0){\n            flag=0;\n            break;\n        }\n    }\n    if(flag==1){\n        return true;\n    }\n    else{\n        return false;\n    }\n}\n\nstring tra(int n,int b){\n    string ans=\""\"";\n    do{\n        int t=n%b;\n    if(t>=0&&t<=9){\n        ans+=t+'0';\n        \n    }\n    else{\n        ans+=t-10+'A';\n    }\n        n/=b;}while(n!=0);\n    reverse(ans.begin(),ans.end() );\n    return ans;\n    \n}\n\n\n\n\n\nint main(int argc, const char * argv[]) {\n    // insert code here...\n    int n,s,co1=0,co2=0;\n    cin>>n;\n    cin>>s;\n    for(int i=s+1;i<10000;i++){\n        for(int j=2;j<11;j++){\n            if(jud(tra(i,j))){\n                \n                co1++;\n            }\n        }\n        if(co1>=3){\n            cout<<i-1<<endl;\n            co2++;\n        }\n        if(co2==n){\n            break;\n        }\n    }\n    \n    \n    return 0;\n}\n",COMPILE_ERROR,0,0
1279678669247676416,eccaecdbc9ad5dde80e7ad836c40e65f3763048c5ac5f4debc09de6ad9c401e6,2020-07-05 15:29:04,C++,50.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <bits/stdc++.h>\n\n#define rep(i,a,n) for(int i=a;i<n;i++)\n#define reps(i,a,n) for(int i=a;i>n;i--)\n#define edl() cout<<endl\n#define ll long long\n#define db(x) if(DEBUG) cout<<\""{\""<<#x<<\""=\""<<(x)<<\""}\"";\n\nusing namespace std;\n\nconst bool DEBUG=0;\nconst int inf = 0x7fffffff;\nconst int mod = (int)1e9+9;\nconst int N = 500015;\nint n,m,s;\n\nint rd(){\n\tint ans=0;char p=getchar();\n\twhile(p<'0'||p>'9') p=getchar();\n\twhile(p>='0'&&p<='9') ans=ans*10+p-'0',p=getchar();\n\treturn ans;\n}\nchar ch1[100]={0};\nstring azhe;\nbool isHui() {\n  int leng = strlen(azhe.c_str());\n  for(int j=0;j<leng/2;j++) {\n    // printf(\""{%c,%c}\"",ch1[j],ch1[leng-j-1]);\n    if(azhe[j] != azhe[leng-j-1]) return false;\n  }\n  return true;\n}\n\nstring Itoa(int Num,int R)\n{\n  string remain=\""\"";\n  int temp;\n  do {\n   temp = Num%R;//取余\n   Num /= R;\n   if (temp >= 10)\n\t   remain += temp - 10 + 'A';//任意进制为大于基数大于10的进制 例如，十六进制\n   else remain += temp + '0';\n  } while (Num);\n  reverse(remain.begin(),remain.end());//逆序\n  return remain;\n}\n\n\nint main(){\n  ios::sync_with_stdio(false);\n\tcin>>n>>m;\n  bool flag1 = false, flag2 = false;\n  while(true) {\n    for(int i=2;i<=10;i++) {\n      azhe = Itoa(m,i);\n      if(isHui()) {\n        if(!flag1) flag1 = true;\n        else {\n          flag2 = true;\n          break;\n        }\n      }\n    }\n    if(flag2 == true) {\n      cout<<m<<endl;\n      n-=1;\n    }\n    flag1 = false, flag2 = false;\n    m++;\n    if(n==0) return 0;\n  }\n\treturn 0;\n}",PARTIAL_ACCEPTED,40,488
1279678873204088832,eccaecdbc9ad5dde80e7ad836c40e65f3763048c5ac5f4debc09de6ad9c401e6,2020-07-05 15:29:53,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <sstream>\n#include <string>\n#include <cmath>\nusing namespace std;\nint hw(int s)\n{\n    int ans=0;\n    for(int i=2;i<=10;i++)\n    {\n        if(ans==2) break;\n        int s0=s,j=0;\n        long long x=0;//转换成二进制可能很长 \n        while(s0)\n        {\n            x+=(s0%i)*pow(10,j);\n            s0/=i;\n            j++;\n        }\n        //cout<<x<<endl;\n        stringstream t;\n        string s;\n        t<<x;\n        t>>s;\n        int ls=s.size(),l=0;\n        while(s[l]==s[ls-1-l] && l<=(ls-1)/2)\n        {\n            l++;\n        }\n        l--;\n        if(l==(ls-1)/2) ans++;\n    }\n    return ans;\n}\nint main(){\n    int n,s,num=0;\n    cin>>n>>s;\n    while(num<n)\n    {\n        s++;\n        if(hw(s)==2) \n        {\n            cout<<s<<endl;\n            num++;\n        }\n    }\n    return 0;\n}",ACCEPTED,80,508
1279679281326653440,eccaecdbc9ad5dde80e7ad836c40e65f3763048c5ac5f4debc09de6ad9c401e6,2020-07-05 15:31:30,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <bits/stdc++.h>\n\n#define rep(i,a,n) for(int i=a;i<n;i++)\n#define reps(i,a,n) for(int i=a;i>n;i--)\n#define edl() cout<<endl\n#define ll long long\n#define db(x) if(DEBUG) cout<<\""{\""<<#x<<\""=\""<<(x)<<\""}\"";\n\nusing namespace std;\n\nconst bool DEBUG=0;\nconst int inf = 0x7fffffff;\nconst int mod = (int)1e9+9;\nconst int N = 500015;\nint n,m,s;\n\nint rd(){\n\tint ans=0;char p=getchar();\n\twhile(p<'0'||p>'9') p=getchar();\n\twhile(p>='0'&&p<='9') ans=ans*10+p-'0',p=getchar();\n\treturn ans;\n}\nchar ch1[100]={0};\nstring azhe;\nbool isHui() {\n  int leng = strlen(azhe.c_str());\n  for(int j=0;j<leng/2;j++) {\n    // printf(\""{%c,%c}\"",ch1[j],ch1[leng-j-1]);\n    if(azhe[j] != azhe[leng-j-1]) return false;\n  }\n  return true;\n}\n\nstring Itoa(int Num,int R)\n{\n  string remain=\""\"";\n  int temp;\n  do {\n   temp = Num%R;//取余\n   Num /= R;\n   if (temp >= 10)\n\t   remain += temp - 10 + 'A';//任意进制为大于基数大于10的进制 例如，十六进制\n   else remain += temp + '0';\n  } while (Num);\n  reverse(remain.begin(),remain.end());//逆序\n  return remain;\n}\n\n\nint main(){\n  ios::sync_with_stdio(false);\n\tcin>>n>>m;\n  m++;\n  bool flag1 = false, flag2 = false;\n  while(true) {\n    for(int i=2;i<=10;i++) {\n      azhe = Itoa(m,i);\n      if(isHui()) {\n        if(!flag1) flag1 = true;\n        else {\n          flag2 = true;\n          break;\n        }\n      }\n    }\n    if(flag2 == true) {\n      cout<<m<<endl;\n      n-=1;\n    }\n    flag1 = false, flag2 = false;\n    m++;\n    if(n==0) return 0;\n  }\n\treturn 0;\n}",ACCEPTED,27,512
1279680356444209152,b05d9f4f8ae94e871d055cf9cc40d00027e969fe8ebc83bb7ae29282cc9efd75,2020-07-05 15:35:46,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"//\n//  main.cpp\n//  test\n//\n//  Created by tanghuaxin on 2020/7/4.\n//  Copyright © 2020 tanghuaxin. All rights reserved.\n//\n\n#include <iostream>\n#include<string>\n#include<cstring>\n\nusing namespace std;\n\nbool jud(string a){\n    int len=a.length(),flag=1;\n    for(int i=0;i<len/2;i++){\n        if(a[i]!=a[len-i-1]||a[i]==0){\n            flag=0;\n            break;\n        }\n    }\n    if(flag==1){\n        return true;\n    }\n    else{\n        return false;\n    }\n}\n\nstring tra(int n,int b){\n    string ans=\""\"";\n    do{\n        int t=n%b;\n    if(t>=0&&t<=9){\n        ans+=t+'0';\n        \n    }\n    else{\n        ans+=t-10+'A';\n    }\n        n/=b;}while(n!=0);\n    reverse(ans.begin(),ans.end() );\n    return ans;\n    \n}\n\n\n\n\n\nint main(int argc, const char * argv[]) {\n    // insert code here...\n    int n,s,co1=0,co2=0;\n    cin>>n;\n    cin>>s;\n    for(int i=s+1;i<10000;i++){\n        for(int j=2;j<11;j++){\n            if(jud(tra(i,j))){\n                \n                co1++;\n            }\n        }\n        if(co1>=3){\n            cout<<i-1<<endl;\n            co2++;\n        }\n        if(co2==n){\n            break;\n        }\n    }\n    \n    \n    return 0;\n}\n",COMPILE_ERROR,0,0
1279681298384224256,4f182c28dd09aef1c51625cc6d216fa8518d9bd8b8965d2d3e415fae2d5a5bc5,2020-07-05 15:39:31,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nbool is_hui(int n, int k) \n{\n    short res[100] = { 0 };\n    int p = 0;\n    while (n) \n    {\n        res[p++] = n % k;\n        n /= k;\n    }\n    int i = 0, j = p - 1;\n    while (i < j)\n        if (res[i++] != res[j--])\n            return 0;       \n    return 1;\n}\n\nint main()\n{\n    int n, s;\n    cin >> n >> s;\n    int ans = 0;\n    for (int i = s + 1; ans != n; i++)\n    {\n        int cnt = 0;\n        for (int j = 2; j <= 10 && cnt < 2; j++)\n        {\n            if (is_hui(i, j))\n                cnt++;\n        }\n        if (cnt >= 2)\n            printf(\""%d\\n\"", i), ans++;\n    }\n    return 0;\n}",ACCEPTED,35,500
1279686877815177216,f5f356993b1826f97669b6926ad21db7f8c1a4e4560cb398f53799927315d21f,2020-07-05 16:01:41,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm> \nusing namespace std;\n\n\nbool Palin_num(const string a) \n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1]) \n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1)\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring intToA(int n, int radix)    \n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\t\n        {\n            ans += t + '0';\n        }\n        else \n        {\n            ans += t - 10 + 'A';\n        }\n        n /= radix;\n    } while (n != 0);\t\n    reverse(ans.begin(), ans.end()); \n    return ans;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    int j = 0;\n    for (int x = 1; x <= 300; x++)\n    {\n        j = x; // 创建副本\n        \n        string s1 = intToA(j, n);    \n        string s2 = intToA((j * j), n);\n\n        if (Palin_num(s2))\n        {\n            cout << s1 << \"" \"" << s2 << endl;\n        }\n        else\n        {\n            continue;\n        }\n    }\n    return 0;\n} ",ACCEPTED,30,512
1279687131251793920,29daffe59a777a5f09eff003bd9b3955e01a20723de72b8e68bb19eb33650dbc,2020-07-05 16:02:42,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string.h>\nusing namespace std;\nint n;\nchar temp[1000];\n\nint judge(int k)\n{\n\tint i;\n\tfor (i = 0; i <= (k - 1) / 2; i++)\n\t{\n\t\tif (temp[i] != temp[k - i])\n\t\t\tbreak;\n\t}\n\tif (i > (k - 1) / 2)\n\t\treturn 1;\n\treturn 0;\n}\nint transfer(int k)    \n{\n\tint p = -1, j;\n\tint x = k;\n\twhile (x)\n\t{\n\t\tj = x % n;\n\t\tx /= n;\n\t\tif (j >= 10)\n\t\t\ttemp[++p] = 65 + j - 10;\n\t\telse\n\t\t\ttemp[++p] = j + 48;\n\t}\n\ttemp[++p] = 0;\n\treturn p - 1;\n}\nint main()\n{\n\tint i, p, j;\n\tcin >> n;\n\tcout << 1 << \"" \"" << 1 << endl;\n\tfor (i = 2; i <= 300; i++)\n\t{\n\t\tp = transfer(i * i);\n\t\tif (judge(p))\n\t\t{\n\t\t\tp = transfer(i);\n\t\t\tfor (j = p; j >= 0; j--)\n\t\t\t\tcout << temp[j];\n\t\t\tcout << \"" \"";\n\t\t\tp = transfer(i * i);\n\t\t\tfor (j = p; j >= 0; j--)\n\t\t\t\tcout << temp[j];\n\t\t\tcout << endl;\n\t\t}\n\t}\n\n\n\treturn 0;\n}",ACCEPTED,36,428
1279688737791868928,f5f356993b1826f97669b6926ad21db7f8c1a4e4560cb398f53799927315d21f,2020-07-05 16:09:05,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <string>  \n#include <algorithm>  \nusing namespace std;\n \n\nbool Palin_num(const string a) \n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1])\n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1)\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring intToA(int n, int radix)   \n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\n        {\n            ans += t + '0';\n        }\n        else\n        {\n            ans += t - 10 + 'A';\n        }\n        n /= radix;\n    } while (n != 0);\t\n    reverse(ans.begin(), ans.end());\n    return ans;\n}\n\nint main()\n{\n    int n, s;\n    cin >> n >> s;\n    s++; \n    vector<int> p; ；\n    int sum; \n    while ((p.size() < n)) \n    {\n        sum = 0;\n        for (int i = 2; i <= 10; i++)\n        {\n            if (Palin_num(intToA(s, i))) ；\n            {\n                sum++; \n            }\n        }\n        if (sum >= 2) \n        {\n            p.push_back(s);\n        }\n        s++; \n    }\n    for (int i = 0; i < p.size(); i++)\n    {\n        cout << p[i] << endl;\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1279688839105273856,f5f356993b1826f97669b6926ad21db7f8c1a4e4560cb398f53799927315d21f,2020-07-05 16:09:29,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <string>  \n#include <algorithm>  \nusing namespace std;\n \n\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1])\n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1) // 是回文数；\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，n是待转数字，radix是指定的进制\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\n        {\n            ans += t + '0';\n        }\n        else\n        {\n            ans += t - 10 + 'A';\n        }\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（）以防止输入为0的情况\n    reverse(ans.begin(), ans.end());\n    return ans;\n}\n\nint main()\n{\n    int n, s;\n    cin >> n >> s;\n    s++; //双重回文数要大于s，从s+1开始遍历；\n    vector<int> p; // 容器p，存放双重回文数；\n    int sum; // 记录有几种进制的数是回文数；\n    while ((p.size() < n)) // 根据容器p里双重回文数的个数决定是否终止程序；\n    {\n        sum = 0;\n        for (int i = 2; i <= 10; i++)\n        {\n            if (Palin_num(intToA(s, i))) // 此时对应进制的数是回文数；\n            {\n                sum++; // 记录次数+1；\n            }\n        }\n        if (sum >= 2) // 双重回文数，压入容器p中；\n        {\n            p.push_back(s);\n        }\n        s++; // 继续遍历；\n    }\n    for (int i = 0; i < p.size(); i++)\n    {\n        cout << p[i] << endl;\n    }\n    return 0;\n}\n\n",ACCEPTED,23,516
1279689564778586112,b05d9f4f8ae94e871d055cf9cc40d00027e969fe8ebc83bb7ae29282cc9efd75,2020-07-05 16:12:22,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"//\n//  main.cpp\n//  test\n//\n//  Created by tanghuaxin on 2020/7/4.\n//  Copyright © 2020 tanghuaxin. All rights reserved.\n//\n\n#include <iostream>\n#include<string>\n#include<cstring>\n\nusing namespace std;\n\nbool jud(string a){\n    int len=a.length(),flag=1;\n    for(int i=0;i<len/2;i++){\n        if(a[i]!=a[len-i-1]||a[i]==0){\n            flag=0;\n            break;\n        }\n    }\n    if(flag==1){\n        return true;\n    }\n    else{\n        return false;\n    }\n}\n\nstring tra(int n,int b){\n    string ans=\""\"";\n    do{\n        int t=n%b;\n    if(t>=0&&t<=9){\n        ans+=t+'0';\n        \n    }\n    else{\n        ans+=t-10+'A';\n    }\n        n/=b;}while(n!=0);\n    reverse(ans.begin(),ans.end() );\n    return ans;\n    \n}\n\n\n\n\n\nint main(int argc, const char * argv[]) {\n    // insert code here...\n    int n,s,co1=0,co2=0;\n    cin>>n;\n    cin>>s;\n    for(int i=s+1;i<10000;i++){\n        for(int j=2;j<11;j++){\n            if(jud(tra(i,j))){\n                \n                co1++;\n            }\n        }\n        if(co1>=3){\n            cout<<i-1<<endl;\n            co2++;\n        }\n        if(co2==n){\n            break;\n        }\n    }\n    \n    \n    return 0;\n}\n",COMPILE_ERROR,0,0
1279689601180958720,b05d9f4f8ae94e871d055cf9cc40d00027e969fe8ebc83bb7ae29282cc9efd75,2020-07-05 16:12:31,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"//\n//  main.cpp\n//  test\n//\n//  Created by tanghuaxin on 2020/7/4.\n//  Copyright © 2020 tanghuaxin. All rights reserved.\n//\n\n#include <iostream>\n#include<string>\n#include<cstring>\n\nusing namespace std;\n\nbool jud(string a){\n    int len=a.length(),flag=1;\n    for(int i=0;i<len/2;i++){\n        if(a[i]!=a[len-i-1]||a[i]==0){\n            flag=0;\n            break;\n        }\n    }\n    if(flag==1){\n        return true;\n    }\n    else{\n        return false;\n    }\n}\n\nstring tra(int n,int b){\n    string ans=\""\"";\n    do{\n        int t=n%b;\n    if(t>=0&&t<=9){\n        ans+=t+'0';\n        \n    }\n    else{\n        ans+=t-10+'A';\n    }\n        n/=b;}while(n!=0);\n    reverse(ans.begin(),ans.end() );\n    return ans;\n    \n}\n\n\n\n\n\nint main(int argc, const char * argv[]) {\n    // insert code here...\n    int n,s,co1=0,co2=0;\n    cin>>n;\n    cin>>s;\n    for(int i=s+1;i<10000;i++){\n        for(int j=2;j<11;j++){\n            if(jud(tra(i,j))){\n                \n                co1++;\n            }\n        }\n        if(co1>=3){\n            cout<<i-1<<endl;\n            co2++;\n        }\n        if(co2==n){\n            break;\n        }\n    }\n    \n    \n    return 0;\n}\n",COMPILE_ERROR,0,0
1279689800716582912,b05d9f4f8ae94e871d055cf9cc40d00027e969fe8ebc83bb7ae29282cc9efd75,2020-07-05 16:13:18,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"//\n//  main.cpp\n//  test\n//\n//  Created by tanghuaxin on 2020/7/4.\n//  Copyright © 2020 tanghuaxin. All rights reserved.\n//\n\n#include <iostream>\n#include<string>\n#include<cstring>\n#include <algorithm>\n\nusing namespace std;\n\nbool jud(string a){\n    int len=a.length(),flag=1;\n    for(int i=0;i<len/2;i++){\n        if(a[i]!=a[len-i-1]||a[i]==0){\n            flag=0;\n            break;\n        }\n    }\n    if(flag==1){\n        return true;\n    }\n    else{\n        return false;\n    }\n}\n\nstring tra(int n,int b){\n    string ans=\""\"";\n    do{\n        int t=n%b;\n    if(t>=0&&t<=9){\n        ans+=t+'0';\n        \n    }\n    else{\n        ans+=t-10+'A';\n    }\n        n/=b;}while(n!=0);\n    reverse(ans.begin(),ans.end() );\n    return ans;\n    \n}\n\n\n\n\n\nint main(int argc, const char * argv[]) {\n    // insert code here...\n    int n,s,co1=0,co2=0;\n    cin>>n;\n    cin>>s;\n    for(int i=s+1;i<10000;i++){\n        for(int j=2;j<11;j++){\n            if(jud(tra(i,j))){\n                \n                co1++;\n            }\n        }\n        if(co1>=3){\n            cout<<i-1<<endl;\n            co2++;\n        }\n        if(co2==n){\n            break;\n        }\n    }\n    \n    \n    return 0;\n}\n",WRONG_ANSWER,29,388
1279689885026279424,b05d9f4f8ae94e871d055cf9cc40d00027e969fe8ebc83bb7ae29282cc9efd75,2020-07-05 16:13:38,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"//\n//  main.cpp\n//  test\n//\n//  Created by tanghuaxin on 2020/7/4.\n//  Copyright © 2020 tanghuaxin. All rights reserved.\n//\n\n#include <iostream>\n#include<string>\n#include<cstring>\n#include <algorithm>\n\nusing namespace std;\n\nbool jud(string a){\n    int len=a.length(),flag=1;\n    for(int i=0;i<len/2;i++){\n        if(a[i]!=a[len-i-1]||a[i]==0){\n            flag=0;\n            break;\n        }\n    }\n    if(flag==1){\n        return true;\n    }\n    else{\n        return false;\n    }\n}\n\nstring tra(int n,int b){\n    string ans=\""\"";\n    do{\n        int t=n%b;\n    if(t>=0&&t<=9){\n        ans+=t+'0';\n        \n    }\n    else{\n        ans+=t-10+'A';\n    }\n        n/=b;}while(n!=0);\n    reverse(ans.begin(),ans.end() );\n    return ans;\n    \n}\n\n\n\n\n\nint main(int argc, const char * argv[]) {\n    // insert code here...\n    int n,s,co1=0,co2=0;\n    cin>>n;\n    cin>>s;\n    for(int i=s+1;i<10000;i++){\n        for(int j=2;j<11;j++){\n            if(jud(tra(i,j))){\n                \n                co1++;\n            }\n        }\n        if(co1>=3){\n            cout<<i<<endl;\n            co2++;\n        }\n        if(co2==n){\n            break;\n        }\n    }\n    \n    \n    return 0;\n}\n",PARTIAL_ACCEPTED,25,512
1279691011847028736,3aaf4a732f987c33a81e41e1172d3cf2aa189e2b3924d74038f27ba4d11214e7,2020-07-05 16:18:07,C,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\nint hw(int o,int a);\nint main()\n{int a,i,o;\n    scanf(\""%d\"",&a);\n    for(i=1;i<=300;i++){\n            o=i*i;\n            if(hw(o,a)==1)\n        printf(\""%d %d\\n\"",i,i*i);}\n\n    return 0;\n\n}\n\nint hw(int o,int a)\n{\n\n    int n,b[10000],flag=1;\n    for(n=0;o!=0;n++){\n            b[n]=o%a;\n    o=o/a;}\n    int j=0;\n    for(j=0;j<n;j++)\n   if(b[j]!=b[n-j-1])\n    flag=2;\n    return flag;\n}\n",PARTIAL_ACCEPTED,18,296
1279692514791981056,29daffe59a777a5f09eff003bd9b3955e01a20723de72b8e68bb19eb33650dbc,2020-07-05 16:24:05,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string.h>\nusing namespace std;\nchar temp[1000];\nint transfer(int k,int h)    \n{\n\tint p = -1, j;\n\tint x = k;\n\twhile (x)\n\t{\n\t\tj = x % h;\n\t\tx /= h;\n\t\tif (j >= 10)\n\t\t\ttemp[++p] = 65 + j - 10;\n\t\telse\n\t\t\ttemp[++p] = j + 48;\n\t}\n\ttemp[++p] = 0;\n\tp = p - 1;\n\tint i;\n\tfor (i = 0; i <= (p - 1) / 2; i++)\n\t{\n\t\tif (temp[i] != temp[p - i])\n\t\t\tbreak;\n\t}\n\tif (i > (p - 1) / 2)\n\t\treturn 1;\n\treturn 0;\n}\nint main()\n{\n\tint n=2;\n\tint q, s;\n\tint i;\n\tint flag1 = 0;\n\tint flag2 = 0;\n\tcin >>q >>s;\n\tfor (i = s + 1; i < 10000; i++)\n\t{\n\t\tfor (n = 2; n <= 10; n++)\n\t\t{\n\t\t\tint m=transfer(i, n);\n\t\t\tif (m == 1)\n\t\t\t{\n\t\t\t\tflag1++;\n\t\t\t}\n\t\t}\n\t\tif (flag1 >= 2)\n\t\t{\n\t\t\tcout << i << endl;\n\t\t\tflag2++;\n\t\t}\n\t\tif (flag2 == q)\n\t\t\tbreak;\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,25,424
1279692825065611264,29daffe59a777a5f09eff003bd9b3955e01a20723de72b8e68bb19eb33650dbc,2020-07-05 16:25:19,C++,60.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string.h>\nusing namespace std;\nchar temp[1000];\nint transfer(int k,int h)    \n{\n\tint p = -1, j;\n\tint x = k;\n\twhile (x)\n\t{\n\t\tj = x % h;\n\t\tx /= h;\n\t\tif (j >= 10)\n\t\t\ttemp[++p] = 65 + j - 10;\n\t\telse\n\t\t\ttemp[++p] = j + 48;\n\t}\n\ttemp[++p] = 0;\n\tp = p - 1;\n\tint i;\n\tfor (i = 0; i <= (p - 1) / 2; i++)\n\t{\n\t\tif (temp[i] != temp[p - i])\n\t\t\tbreak;\n\t}\n\tif (i > (p - 1) / 2)\n\t\treturn 1;\n\treturn 0;\n}\nint main()\n{\n\tint n=2;\n\tint q, s;\n\tint i;\n\tint flag1 = 0;\n\tint flag2 = 0;\n\tcin >>q >>s;\n\tfor (i = s + 1; i < 10000; i++)\n\t{\n\t\tfor (n = 2; n <= 10; n++)\n\t\t{\n\t\t\tint m=transfer(i, n);\n\t\t\tif (m == 1)\n\t\t\t{\n\t\t\t\tflag1++;\n\t\t\t}\n\t\t}\n\t\tif (flag1 >= 2)\n\t\t{\n\t\t\tcout << i << endl;\n\t\t\tflag2++;\n\t\t}\n\t\tflag1 = 0;\n\t\tif (flag2 == q)\n\t\t\tbreak;\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,30,620
1279694954375348224,3aaf4a732f987c33a81e41e1172d3cf2aa189e2b3924d74038f27ba4d11214e7,2020-07-05 16:33:47,C,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\nvoid pr(int i,int o,int a);\nint hw(int o,int a);\nint main()\n{int a,i,o;\n    scanf(\""%d\"",&a);\n    for(i=1;i<=300;i++){\n            o=i*i;\n            if(hw(o,a)==1)\n                pr(i,o,a);\n    }\n    return 0;\n\n}\n\nint hw(int o,int a)\n{\n\n    int n,b[10000],flag=1;\n    for(n=0;o!=0;n++){\n            b[n]=o%a;\n    o=o/a;}\n    int j=0;\n    for(j=0;j<n;j++)\n   if(b[j]!=b[n-j-1])\n    flag=2;\n    return flag;\n}\nvoid pr(int i,int o,int a)\n{\n    int  n;\n    for(n=0;i!=0;n++)\n    {\n        printf(\""%d\"",i%a);\n        i=i/a;\n    }\n    printf(\"" \"");\n        for(n=0;o!=0;n++)\n    {\n        printf(\""%d\"",o%a);\n        o=o/a;\n    }\n    printf(\""\\n\"");\n}\n",PARTIAL_ACCEPTED,26,468
1279695286132211712,29daffe59a777a5f09eff003bd9b3955e01a20723de72b8e68bb19eb33650dbc,2020-07-05 16:35:06,C++,60.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string.h>\nusing namespace std;\nchar temp[1000];\nint transfer(int k,int h)    \n{\n\tint p = -1, j;\n\tint x = k;\n\twhile (x)\n\t{\n\t\tj = x % h;\n\t\tx /= h;\n\t\tif (j >= 10)\n\t\t\ttemp[++p] = 65 + j - 10;\n\t\telse\n\t\t\ttemp[++p] = j + 48;\n\t}\n\ttemp[++p] = 0;\n\tp = p - 1;\n\tint i;\n\tfor (i = 0; i <= (p - 1) / 2; i++)\n\t{\n\t\tif (temp[i] != temp[p - i])\n\t\t\tbreak;\n\t}\n\tif (i > (p - 1) / 2)\n\t\treturn 1;\n\treturn 0;\n}\nint main()\n{\n\tint n=2;\n\tint q, s;\n\tint i;\n\tint flag1 = 0;\n\tint flag2 = 0;\n\tcin >>q >>s;\n\tfor (i = s + 1; i < 10000; i++)\n\t{\n\t\tfor (n = 2; n <= 10; n++)\n\t\t{\n\t\t\tint m=transfer(i, n);\n\t\t\tif (m == 1)\n\t\t\t{\n\t\t\t\tflag1++;\n\t\t\t}\n\t\t}\n\t\tif (flag1 >= 2)\n\t\t{\n\t\t\tcout << i << endl;\n\t\t\tflag2++;\n\t\t}\n\t\tflag1 = 0;\n\t\tif (flag2 == q)\n\t\t\tbreak;\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,29,512
1279696004465491968,3aaf4a732f987c33a81e41e1172d3cf2aa189e2b3924d74038f27ba4d11214e7,2020-07-05 16:37:57,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\nvoid pr(int i,int o,int a);\nint hw(int o,int a);\nint main()\n{int a,i,o;\n    scanf(\""%d\"",&a);\n    for(i=1;i<=300;i++){\n            o=i*i;\n            if(hw(o,a)==1)\n                pr(i,o,a);\n    }\n    return 0;\n\n}\n\nint hw(int o,int a)\n{\n\n    int n,b[10000],flag=1;\n    for(n=0;o!=0;n++){\n            b[n]=o%a;\n    o=o/a;}\n    int j=0;\n    for(j=0;j<n;j++)\n   if(b[j]!=b[n-j-1])\n    flag=2;\n    return flag;\n}\nvoid pr(int i,int o,int a)\n{\n    int b[10000],a[10000], n;\n    for(n=0;i!=0;n++)\n    {\n        b[n]=i%a;\n        i=i/a;\n    }\n  \n        for(n=0;o!=0;n++)\n    {\n        a[n]=o%a;\n        o=o/a;\n    }\n     for(n=0;i!=0;n++)\n         printf(\""%d\"",b[n]);\n    printf(\"" \"");\n     for(n=0;i!=0;n++)\n         printf(\""%d\"",a[n]);\n    printf(\""\\n\"");\n}\n",COMPILE_ERROR,0,0
1279696276491264000,3aaf4a732f987c33a81e41e1172d3cf2aa189e2b3924d74038f27ba4d11214e7,2020-07-05 16:39:02,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\nvoid pr(int i,int o,int a);\nint hw(int o,int a);\nint main()\n{int a,i,o;\n    scanf(\""%d\"",&a);\n    for(i=1;i<=300;i++){\n            o=i*i;\n            if(hw(o,a)==1)\n                pr(i,o,a);\n    }\n    return 0;\n\n}\n\nint hw(int o,int a)\n{\n\n    int n,b[10000],flag=1;\n    for(n=0;o!=0;n++){\n            b[n]=o%a;\n    o=o/a;}\n    int j=0;\n    for(j=0;j<n;j++)\n   if(b[j]!=b[n-j-1])\n    flag=2;\n    return flag;\n}\nvoid pr(int i,int o,int a)\n{\n    int b[10000],c[10000], n;\n    for(n=0;i!=0;n++)\n    {\n        b[n]=i%a;\n        i=i/a;\n    }\n  \n        for(n=0;o!=0;n++)\n    {\n        a[n]=o%a;\n        o=o/a;\n    }\n     for(n=0;i!=0;n++)\n         printf(\""%d\"",b[n]);\n    printf(\"" \"");\n     for(n=0;i!=0;n++)\n         printf(\""%d\"",c[n]);\n    printf(\""\\n\"");\n}\n",COMPILE_ERROR,0,0
1279696868605362176,3aaf4a732f987c33a81e41e1172d3cf2aa189e2b3924d74038f27ba4d11214e7,2020-07-05 16:41:23,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\nvoid pr(int i,int o,int a);\nint hw(int o,int a);\nint main()\n{int a,i,o;\n    scanf(\""%d\"",&a);\n    for(i=1;i<=300;i++){\n            o=i*i;\n            if(hw(o,a)==1)\n                pr(i,o,a);\n    }\n    return 0;\n\n}\n\nint hw(int o,int a)\n{\n\n    int n,b[10000],flag=1;\n    for(n=0;o!=0;n++){\n            b[n]=o%a;\n    o=o/a;}\n    int j=0;\n    for(j=0;j<n;j++)\n   if(b[j]!=b[n-j-1])\n    flag=2;\n    return flag;\n}\nvoid pr(int i,int o,int a)\n{\n    int b[10000],c[10000], n1,n2;\n    for(n1=0;i!=0;n1++)\n    {\n        b[n1]=i%a;\n        i=i/a;\n    }\n  \n        for(n2=0;o!=0;n2++)\n    {\n        c[n2]=o%a;\n        o=o/a;\n    }\n     for(n1;n1>=0;n1--)\n         printf(\""%d\"",b[n1]);\n    printf(\"" \"");\n     for(n2;n2>=0;n2--)\n         printf(\""%d\"",c[n2]);\n    printf(\""\\n\"");\n}\n",WRONG_ANSWER,24,384
1279697555263258624,29daffe59a777a5f09eff003bd9b3955e01a20723de72b8e68bb19eb33650dbc,2020-07-05 16:44:07,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nbool judge(int x) {\n    int d[100], len, cnt = 0;\n    for (int i = 2; i <= 10; i++) {\n        int h = x;\n        len = 0;\n        while (h != 0) {\n            d[++len] = h % i;\n            h /= i;\n        }\n        bool flag = true;\n        for (int i = 1; i <= len - i + 1; i++)\n            if (d[i] != d[len - i + 1]) {\n                flag = false;\n                break;\n            }\n        if (flag)\n            cnt++;\n        if (cnt == 2)\n            return 1;\n    }\n    return 0;\n}\nint main()\n{\n    int n, s;\n    cin >> n >> s;\n    for (int i = s + 1, j = 1; j <= n; i++)\n        if (judge(i))\n        {\n            cout << i << endl;\n            j++;\n        }\n    return 0;\n}\n",ACCEPTED,35,424
1279697589576859648,3aaf4a732f987c33a81e41e1172d3cf2aa189e2b3924d74038f27ba4d11214e7,2020-07-05 16:44:15,C,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\nvoid pr(int i,int o,int a);\nint hw(int o,int a);\nint main()\n{int a,i,o;\n    scanf(\""%d\"",&a);\n    for(i=1;i<=300;i++){\n            o=i*i;\n            if(hw(o,a)==1)\n                pr(i,o,a);\n    }\n    return 0;\n\n}\n\nint hw(int o,int a)\n{\n\n    int n,b[10000],flag=1;\n    for(n=0;o!=0;n++){\n            b[n]=o%a;\n    o=o/a;}\n    int j=0;\n    for(j=0;j<n;j++)\n   if(b[j]!=b[n-j-1])\n    flag=2;\n    return flag;\n}\nvoid pr(int i,int o,int a)\n{\n    int b[10000],c[10000], n1,n2;\n    for(n1=0;i!=0;n1++)\n    {\n        b[n1]=i%a;\n        i=i/a;\n    }\n\n        for(n2=0;o!=0;n2++)\n    {\n        c[n2]=o%a;\n        o=o/a;\n    }\n    n1--;\n    n2--;\n     for(n1;n1>=0;n1--)\n         printf(\""%d\"",b[n1]);\n    printf(\"" \"");\n     for(n2;n2>=0;n2--)\n         printf(\""%d\"",c[n2]);\n    printf(\""\\n\"");\n}\n",PARTIAL_ACCEPTED,32,372
1279704161220747264,2b459d8523bd56b3eea253cb0aa60960cf250af00cd3fc924e9e1019943a0492,2020-07-05 17:10:22,C++,50.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<cstdio>\n\n#include<iostream>\n\n#include<cmath>\n\nusing namespace std;\nint n,s;\nint a[10000]={0};\nint judge(int i);\nint judge2(int i,int j);\nint main()\n\n{\n\tcin>>n>>s;\n\tfor(int i=s;n>0;i++)\n\t{\n\t\tif(judge(i))\n\t\t{\n\t\t\tcout<<i<<endl;\n\t\t\tn--;\n\t\t}\n\t}\n\n\n\n    return 0;\n\n}\nint judge(int i){\n\tint count=0;\n\tfor(int j=2;j<=10;j++)\n\t{\n\t\tif(judge2(i,j))\n\t\t\tcount++;\n\t\tif(count==2)\n\t\t\treturn 1;\n\t}\n\treturn 0;\n}\nint judge2(int i,int j){\n\tint idx=1;\n\twhile(i/j)\n\t{\n\t\ta[idx++]=i%j;\n\t\ti/=j;\n\t}\n\ta[idx]=i;\n\tfor(int k=1;k<=idx;k++)\n\t{\n\t\tif(a[k]!=a[idx-k+1])\n\t\t\treturn 0;\n\t}\n\treturn 1;\n}",PARTIAL_ACCEPTED,33,512
1279704183698030592,aef415abc46901e97f1978f8e79b8d564f9efd4d1cc1807579b416efd335a6aa,2020-07-05 17:10:27,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint b=0;\nint numb[17];\n\nint main() {\n\tcin >> b;\n\tint x = 0;\n\tint length = 0;\n\tint sta = 1;\n\tfor (int j = 1; j <= 300; ++j) {\n\t\tx = j * j;\n\t\tlength = 0;\n\t\tfor (int i = 16; i >= 0; --i) {\n\t\t\tif (x == 0) {\n\t\t\t\tlength = 16 - i;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tnumb[i] = x % b;\n\t\t\tx /= b;\n\t\t}\n\t\tsta = 1;\n\t\tfor (int i = 0; i < length / 2; ++i) {\n\t\t\tif (numb[16 - i] != numb[17 - length + i]) {\n\t\t\t\tsta = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (sta) {\n\t\t\tcout << j << \"" \"";\n\t\t\tfor (int i = 17 - length; i < 17; ++i) {\n\t\t\t\tif (numb[i] >= 10) {\n\t\t\t\t\tprintf(\""%c\"", numb[i] + 55);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tprintf(\""%d\"", numb[i]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tprintf(\""\\n\"");\n\n\t\t}\n\t\t\n\t}\n}",PARTIAL_ACCEPTED,22,512
1279704263612104704,2b459d8523bd56b3eea253cb0aa60960cf250af00cd3fc924e9e1019943a0492,2020-07-05 17:10:46,C++,50.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<cstdio>\n\n#include<iostream>\n\n#include<cmath>\n\nusing namespace std;\nint n,s;\nint a[10000]={0};\nint judge(int i);\nint judge2(int i,int j);\nint main()\n\n{\n\tcin>>n>>s;\n\tfor(int i=s;n>0;i++)\n\t{\n\t\tif(judge(i))\n\t\t{\n\t\t\tcout<<i<<endl;\n\t\t\tn--;\n\t\t}\n\t}\n\n\n\n    return 0;\n\n}\nint judge(int i){\n\tint count=0;\n\tfor(int j=2;j<=10;j++)\n\t{\n\t\tif(judge2(i,j))\n\t\t\tcount++;\n\t\tif(count==2)\n\t\t\treturn 1;\n\t}\n\treturn 0;\n}\nint judge2(int i,int j){\n\tint idx=1;\n\twhile(i/j)\n\t{\n\t\ta[idx++]=i%j;\n\t\ti/=j;\n\t}\n\ta[idx]=i;\n\tfor(int k=1;k<=idx;k++)\n\t{\n\t\tif(a[k]!=a[idx-k+1])\n\t\t\treturn 0;\n\t}\n\treturn 1;\n}",PARTIAL_ACCEPTED,33,512
1279704564154957824,3aaf4a732f987c33a81e41e1172d3cf2aa189e2b3924d74038f27ba4d11214e7,2020-07-05 17:11:58,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\nvoid pr(int i,int o,int a);\nint hw(int o,int a);\nint main()\n{int a,i,o;\n    scanf(\""%d\"",&a);\n    for(i=1;i<=300;i++){\n            o=i*i;\n            if(hw(o,a)==1)\n                pr(i,o,a);\n    }\n    return 0;\n\n}\n\nint hw(int o,int a)\n{\n\n    int n,b[10000],flag=1;\n    for(n=0;o!=0;n++){\n            b[n]=o%a;\n    o=o/a;}\n    int j=0;\n    for(j=0;j<n;j++)\n   if(b[j]!=b[n-j-1])\n    flag=2;\n    return flag;\n}\nvoid pr(int i,int o,int a)\n{\n    char b[10000],c[10000];\nint n1,n2;\n    for(n1=0;i!=0;n1++)\n    {\n        b[n1]=i%a;\n        i=i/a;\n        if(b[n1]==10)\n                b[n1]=A;\n            if(b[n1]==11)\n                b[n1]==B;\n             if(b[n1]==12)\n                b[n1]==C;\n             if(b[n1]==13)\n                b[n1]==D;\n             if(b[n1]==14)\n                b[n1]==E;\n             if(b[n1]==15)\n                b[n1]==F;\n             if(b[n1]==16)\n                b[n1]==G;\n             if(b[n1]==17)\n                b[n1]==H;\n             if(b[n1]==18)\n                b[n1]==I;\n             if(b[n1]==19)\n                b[n1]==J;\n             if(b[n1]==20)\n                b[n1]==K;\n            \n    }\n\n        for(n2=0;o!=0;n2++)\n    {\n        c[n2]=o%a;\n            if(c[n2]==10)\n                c[n2]=A;\n            if(c[n2]==11)\n                c[n2]==B;\n             if(c[n2]==12)\n                c[n2]==C;\n             if(c[n2]==13)\n                c[n2]==D;\n             if(c[n2]==14)\n                c[n2]==E;\n             if(c[n2]==15)\n                c[n2]==F;\n             if(c[n2]==16)\n                c[n2]==G;\n             if(c[n2]==17)\n                c[n2]==H;\n             if(c[n2]==18)\n                c[n2]==I;\n             if(c[n2]==19)\n                c[n2]==J;\n             if(c[n2]==20)\n                c[n2]==K;\n            \n        o=o/a;\n    }\n    n1--;\n    n2--;\n     for(n1;n1>=0;n1--)\n         printf(\""%d\"",b[n1]);\n    printf(\"" \"");\n     for(n2;n2>=0;n2--)\n         printf(\""%d\"",c[n2]);\n    printf(\""\\n\"");\n}\n",COMPILE_ERROR,0,0
1279705186086354944,106cca25065929efd4713fed2f93a7d8efe627c7cbef1252d065de4422b5834e,2020-07-05 17:14:26,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<sstream>\n#include<string>\n#include<cmath>\nusing namespace std;\nint main(){\n    int n,p,q=0;\n    cin>>n>>p;\n    while(q<n)\n    {\n        p++;\n        int m=0;\n        for(int i=2;i<=10;i++)\n        {\n            if(m==2) \n\t\t\t    break;\n            int s0=p,j=0;\n            long long x=0;\n            while(s0)\n            {\n                x+=(s0%i)*pow(10,j);\n                s0/=i;\n                j++;\n            }\n            stringstream t;\n            string s;\n            t<<x;\n            t>>s;\n            int ls=s.size(),l=0;\n            while(s[l]==s[ls-1-l] && l<=(ls-1)/2)\n            {\n                l++;\n            }\n            l--;\n            if(l==(ls-1)/2) \n\t\t\t    m++;\n        }\n        if(m==2) \n        {\n            cout<<p<<endl;\n            q++;\n        }\n    }\n    return 0;\n}",ACCEPTED,77,532
1279705237240086528,106cca25065929efd4713fed2f93a7d8efe627c7cbef1252d065de4422b5834e,2020-07-05 17:14:38,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<sstream>\n#include<string>\n#include<cmath>\nusing namespace std;\nint main(){\n    int n,p,q=0;\n    cin>>n>>p;\n    while(q<n)\n    {\n        p++;\n        int m=0;\n        for(int i=2;i<=10;i++)\n        {\n            if(m==2) \n\t\t\t    break;\n            int s0=p,j=0;\n            long long x=0;\n            while(s0)\n            {\n                x+=(s0%i)*pow(10,j);\n                s0/=i;\n                j++;\n            }\n            stringstream t;\n            string s;\n            t<<x;\n            t>>s;\n            int ls=s.size(),l=0;\n            while(s[l]==s[ls-1-l] && l<=(ls-1)/2)\n            {\n                l++;\n            }\n            l--;\n            if(l==(ls-1)/2) \n\t\t\t    m++;\n        }\n        \n}",COMPILE_ERROR,0,0
1279705250548613120,106cca25065929efd4713fed2f93a7d8efe627c7cbef1252d065de4422b5834e,2020-07-05 17:14:42,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<sstream>\n#include<string>\n#include<cmath>\nusing namespace std;\nint main(){\n    int n,p,q=0;\n    cin>>n>>p;\n    while(q<n)\n    {\n        p++;\n        int m=0;\n        for(int i=2;i<=10;i++)\n        {\n            if(m==2) \n\t\t\t    break;\n            int s0=p,j=0;\n            long long x=0;\n            while(s0)\n            {\n                x+=(s0%i)*pow(10,j);\n                s0/=i;\n                j++;\n            }\n            stringstream t;\n            string s;\n            t<<x;\n            t>>s;\n            int ls=s.size(),l=0;\n            while(s[l]==s[ls-1-l] && l<=(ls-1)/2)\n            {\n                l++;\n            }\n            l--;\n            if(l==(ls-1)/2) \n\t\t\t    m++;\n        }\n        \n}",COMPILE_ERROR,0,0
1279705262166835200,106cca25065929efd4713fed2f93a7d8efe627c7cbef1252d065de4422b5834e,2020-07-05 17:14:44,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<sstream>\n#include<string>\n#include<cmath>\nusing namespace std;\nint main(){\n    int n,p,q=0;\n    cin>>n>>p;\n    while(q<n)\n    {\n        p++;\n        int m=0;\n        for(int i=2;i<=10;i++)\n        {\n            if(m==2) \n\t\t\t    break;\n            int s0=p,j=0;\n            long long x=0;\n            while(s0)\n            {\n                x+=(s0%i)*pow(10,j);\n                s0/=i;\n                j++;\n            }\n            stringstream t;\n            string s;\n            t<<x;\n            t>>s;\n            int ls=s.size(),l=0;\n            while(s[l]==s[ls-1-l] && l<=(ls-1)/2)\n            {\n                l++;\n            }\n            l--;\n            if(l==(ls-1)/2) \n\t\t\t    m++;\n        }\n        \n}",COMPILE_ERROR,0,0
1279705303560421376,106cca25065929efd4713fed2f93a7d8efe627c7cbef1252d065de4422b5834e,2020-07-05 17:14:54,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<sstream>\n#include<string>\n#include<cmath>\nusing namespace std;\nint main(){\n    int n,p,q=0;\n    cin>>n>>p;\n    while(q<n)\n    {\n        p++;\n        int m=0;\n        for(int i=2;i<=10;i++)\n        {\n            if(m==2) \n\t\t\t    break;\n            int s0=p,j=0;\n            long long x=0;\n            while(s0)\n            {\n                x+=(s0%i)*pow(10,j);\n                s0/=i;\n                j++;\n            }\n            stringstream t;\n            string s;\n            t<<x;\n            t>>s;\n            int ls=s.size(),l=0;\n            while(s[l]==s[ls-1-l] && l<=(ls-1)/2)\n            {\n                l++;\n            }\n            l--;\n            if(l==(ls-1)/2) \n\t\t\t    m++;\n        }\n        if(m==2) \n        {\n            cout<<q<<endl;\n            q++;\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,78,512
1279705320568324096,106cca25065929efd4713fed2f93a7d8efe627c7cbef1252d065de4422b5834e,2020-07-05 17:14:58,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<sstream>\n#include<string>\n#include<cmath>\nusing namespace std;\nint main(){\n    int n,p,q=0;\n    cin>>n>>p;\n    while(q<n)\n    {\n        p++;\n        int m=0;\n        for(int i=2;i<=10;i++)\n        {\n            if(m==2) \n\t\t\t    break;\n            int s0=p,j=0;\n            long long x=0;\n            while(s0)\n            {\n                x+=(s0%i)*pow(10,j);\n                s0/=i;\n                j++;\n            }\n            stringstream t;\n            string s;\n            t<<x;\n            t>>s;\n            int ls=s.size(),l=0;\n            while(s[l]==s[ls-1-l] && l<=(ls-1)/2)\n            {\n                l++;\n            }\n            l--;\n            if(l==(ls-1)/2) \n\t\t\t    m++;\n        }\n        if(m==2) \n        {\n            cout<<q<<endl;\n            q++;\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,67,512
1279705333721661440,106cca25065929efd4713fed2f93a7d8efe627c7cbef1252d065de4422b5834e,2020-07-05 17:15:01,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<sstream>\n#include<string>\n#include<cmath>\nusing namespace std;\nint main(){\n    int n,p,q=0;\n    cin>>n>>p;\n    while(q<n)\n    {\n        p++;\n        int m=0;\n        for(int i=2;i<=10;i++)\n        {\n            if(m==2) \n\t\t\t    break;\n            int s0=p,j=0;\n            long long x=0;\n            while(s0)\n            {\n                x+=(s0%i)*pow(10,j);\n                s0/=i;\n                j++;\n            }\n            stringstream t;\n            string s;\n            t<<x;\n            t>>s;\n            int ls=s.size(),l=0;\n            while(s[l]==s[ls-1-l] && l<=(ls-1)/2)\n            {\n                l++;\n            }\n            l--;\n            if(l==(ls-1)/2) \n\t\t\t    m++;\n        }\n        if(m==2) \n        {\n            cout<<q<<endl;\n            q++;\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,88,752
1279705364210049024,106cca25065929efd4713fed2f93a7d8efe627c7cbef1252d065de4422b5834e,2020-07-05 17:15:09,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<sstream>\n#include<string>\n#include<cmath>\nusing namespace std;\nint main(){\n    int n,p,q=0;\n    cin>>n>>p;\n    while(q<n)\n    {\n        p++;\n        int m=0;\n        for(int i=2;i<=10;i++)\n        {\n            if(m==2) \n\t\t\t    break;\n            int s0=p,j=0;\n            long long x=0;\n            while(s0)\n            {\n                x+=(s0%i)*pow(10,j);\n                s0/=i;\n                j++;\n            }\n            stringstream t;\n            string s;\n            t<<x;\n            t>>s;\n            int ls=s.size(),l=0;\n            while(s[l]==s[ls-1-l] && l<=(ls-1)/2)\n            {\n                l++;\n            }\n            l--;\n            if(l==(ls-1)/2) \n\t\t\t    m++;\n        }\n        if(m==2) \n        {\n            cout<<p<<endl;\n            q++;\n        }\n    }\n    return 0;\n}",ACCEPTED,78,504
1279705523337748480,106cca25065929efd4713fed2f93a7d8efe627c7cbef1252d065de4422b5834e,2020-07-05 17:15:47,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<sstream>\n#include<string>\n#include<cmath>\nusing namespace std;\nint main(){\n    int n,p,q=0;\n    cin>>n>>p;\n    while(q<n)\n    {\n        p++;\n        int m=0;\n        for(int i=2;i<=10;i++)\n        {\n            if(m==2) \n\t\t\t    break;\n            int y=p,j=0;\n            long long x=0;\n            while(y)\n            {\n                x+=(y%i)*pow(10,j);\n                y/=i;\n                j++;\n            }\n            stringstream t;\n            string s;\n            t<<x;\n            t>>s;\n            int l=s.size(),l=0;\n            while(s[l]==s[l-1-l] && l<=(l-1)/2)\n            {\n                l++;\n            }\n            l--;\n            if(l==(l-1)/2) \n\t\t\t    m++;\n        }\n        if(m==2) \n        {\n            cout<<p<<endl;\n            q++;\n        }\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1279705621052448768,3aaf4a732f987c33a81e41e1172d3cf2aa189e2b3924d74038f27ba4d11214e7,2020-07-05 17:16:10,C,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\nvoid pr(int i,int o,int a);\nint hw(int o,int a);\nint main()\n{int a,i,o;\n    scanf(\""%d\"",&a);\n    for(i=1;i<=300;i++){\n            o=i*i;\n            if(hw(o,a)==1)\n                pr(i,o,a);\n    }\n    return 0;\n\n}\n\nint hw(int o,int a)\n{\n\n    int n,b[10000],flag=1;\n    for(n=0;o!=0;n++){\n            b[n]=o%a;\n    o=o/a;}\n    int j=0;\n    for(j=0;j<n;j++)\n   if(b[j]!=b[n-j-1])\n    flag=2;\n    return flag;\n}\nvoid pr(int i,int o,int a)\n{\n    char b[10000],c[10000];\nint n1,n2;\n    for(n1=0;i!=0;n1++)\n    {\n        b[n1]=i%a;\n        i=i/a;\n        if(b[n1]==10)\n                b[n1]='A';\n            if(b[n1]==11)\n                b[n1]=='B';\n             if(b[n1]==12)\n                b[n1]=='C';\n             if(b[n1]==13)\n                b[n1]=='D';\n             if(b[n1]==14)\n                b[n1]=='E';\n             if(b[n1]==15)\n                b[n1]=='F';\n             if(b[n1]==16)\n                b[n1]=='G';\n             if(b[n1]==17)\n                b[n1]=='H';\n             if(b[n1]==18)\n                b[n1]=='I';\n             if(b[n1]==19)\n                b[n1]=='J';\n             if(b[n1]==20)\n                b[n1]=='K';\n\n    }\n\n        for(n2=0;o!=0;n2++)\n    {\n        c[n2]=o%a;\n            if(c[n2]==10)\n                c[n2]='A';\n            if(c[n2]==11)\n                c[n2]=='B';\n             if(c[n2]==12)\n                c[n2]=='C';\n             if(c[n2]==13)\n                c[n2]=='D';\n             if(c[n2]==14)\n                c[n2]=='E';\n             if(c[n2]==15)\n                c[n2]=='F';\n             if(c[n2]==16)\n                c[n2]=='G';\n             if(c[n2]==17)\n                c[n2]=='H';\n             if(c[n2]==18)\n                c[n2]=='I';\n             if(c[n2]==19)\n                c[n2]=='J';\n             if(c[n2]==20)\n                c[n2]=='K';\n\n        o=o/a;\n    }\n    n1--;\n    n2--;\n     for(n1;n1>=0;n1--)\n         printf(\""%d\"",b[n1]);\n    printf(\"" \"");\n     for(n2;n2>=0;n2--)\n         printf(\""%d\"",c[n2]);\n    printf(\""\\n\"");\n}\n",PARTIAL_ACCEPTED,26,296
1279705752149614592,106cca25065929efd4713fed2f93a7d8efe627c7cbef1252d065de4422b5834e,2020-07-05 17:16:41,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<sstream>\n#include<string>\n#include<cmath>\nusing namespace std;\nint main(){\n    int n,p,q=0;\n    cin>>n>>p;\n    while(q<n)\n    {\n        p++;\n        int m=0;\n        for(int i=2;i<=10;i++)\n        {\n            if(m==2) \n\t\t\t    break;\n            int y=p,j=0;\n            long long x=0;\n            while(y)\n            {\n                x+=(y%i)*pow(10,j);\n                y/=i;\n                j++;\n            }\n            stringstream t;\n            string s;\n            t<<x;\n            t>>s;\n            int l=s.size(),k=0;\n            while(s[k]==s[l-1-k] && k<=(l-1)/2)\n            {\n                k++;\n            }\n            k--;\n            if(k==(l-1)/2) \n\t\t\t    m++;\n        }\n        if(m==2) \n        {\n            cout<<p<<endl;\n            q++;\n        }\n    }\n    return 0;\n}",ACCEPTED,83,492
1279706124750618624,3aaf4a732f987c33a81e41e1172d3cf2aa189e2b3924d74038f27ba4d11214e7,2020-07-05 17:18:10,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\nvoid pr(int i,int o,int a);\nint hw(int o,int a);\nint main()\n{int a,i,o;\n    scanf(\""%d\"",&a);\n    for(i=1;i<=300;i++){\n            o=i*i;\n            if(hw(o,a)==1)\n                pr(i,o,a);\n    }\n    return 0;\n\n}\n\nint hw(int o,int a)\n{\n\n    int n,b[10000],flag=1;\n    for(n=0;o!=0;n++){\n            b[n]=o%a;\n    o=o/a;}\n    int j=0;\n    for(j=0;j<n;j++)\n   if(b[j]!=b[n-j-1])\n    flag=2;\n    return flag;\n}\nvoid pr(int i,int o,int a)\n{\n    char b[10000],c[10000];\nint n1,n2;\n    for(n1=0;i!=0;n1++)\n    {\n        b[n1]=i%a;\n        i=i/a;\n        if(b[n1]==10)\n                b[n1]='A';\n            if(b[n1]==11)\n                b[n1]=='B';\n             if(b[n1]==12)\n                b[n1]=='C';\n             if(b[n1]==13)\n                b[n1]=='D';\n             if(b[n1]==14)\n                b[n1]=='E';\n             if(b[n1]==15)\n                b[n1]=='F';\n             if(b[n1]==16)\n                b[n1]=='G';\n             if(b[n1]==17)\n                b[n1]=='H';\n             if(b[n1]==18)\n                b[n1]=='I';\n             if(b[n1]==19)\n                b[n1]=='J';\n             if(b[n1]==20)\n                b[n1]=='K';\n\n    }\n\n        for(n2=0;o!=0;n2++)\n    {\n        c[n2]=o%a;\n            if(c[n2]==10)\n                c[n2]='A';\n            if(c[n2]==11)\n                c[n2]=='B';\n             if(c[n2]==12)\n                c[n2]=='C';\n             if(c[n2]==13)\n                c[n2]=='D';\n             if(c[n2]==14)\n                c[n2]=='E';\n             if(c[n2]==15)\n                c[n2]=='F';\n             if(c[n2]==16)\n                c[n2]=='G';\n             if(c[n2]==17)\n                c[n2]=='H';\n             if(c[n2]==18)\n                c[n2]=='I';\n             if(c[n2]==19)\n                c[n2]=='J';\n             if(c[n2]==20)\n                c[n2]=='K';\n\n        o=o/a;\n    }\n    n1--;\n    n2--;\n     for(n1;n1>=0;n1--)\n         printf(\""%c\"",b[n1]);\n    printf(\"" \"");\n     for(n2;n2>=0;n2--)\n         printf(\""%c\"",c[n2]);\n    printf(\""\\n\"");\n}\n",WRONG_ANSWER,19,384
1279711074121613312,0e1ef55d391c9f527ba7066421b9a0adc6c664629bb0f468b929ffd629011446,2020-07-05 17:37:50,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832," 1 #include <cstdlib>\n 2 #include <iostream>\n 3 #include <cstdio>\n 4 #include <cmath>\n 5 #include <cstring>\n 6 const int maxl=1000;\n 7 using namespace std;\n 8 int shu_1[maxl],shu_2[maxl];\n 9 int temp[maxl];\n10 //进制转换 \n11 void change(int *shu,int num,int system);\n12 void print(int *shu);\n13 bool check(int *shu);//检查是否是回文数 \n14 int main()\n15 {\n16     int n,i;\n17     \n18     //文件操作\n19     freopen(\""palsquare.in\"",\""r\"",stdin);\n20     freopen(\""palsquare.out\"",\""w\"",stdout);\n21     scanf(\""%d\"",&n);\n22     \n23     for (i=1;i<=300;i++)\n24     {\n25         change(shu_1,i,n);\n26         change(shu_2,i*i,n);\n27         if (check(shu_2))\n28         {\n29             print(shu_1);printf(\"" \"");\n30             print(shu_2);printf(\""\\n\"");\n31         }\n32     } \n33     return 0;\n34 }\n35 //把一个num转换成system进制的数 \n36 void change(int *shu,int num,int system)\n37 {\n38      int point=0;\n39      memset(shu,0,sizeof(shu));\n40      memset(temp,0,sizeof(temp));\n41      point++;\n42      //进制转换 \n43      while (num!=0)\n44      {\n45            int t;\n46            t=num%system;\n47            num=num/system;\n48            temp[point++]=t;\n49      }\n50      point--;\n51      for (int i=point;i>=1;i--) shu[point-i+1]=temp[i];\n52      shu[0]=point;//长度 \n53      return;\n54 }\n55 bool check(int *shu)\n56 {\n57      int point=shu[0],i;\n58      for (i=1;i<=(point/2)+1;i++)\n59      if (shu[i]!=shu[point-i+1]) return 0;\n60      return 1;\n61 }\n62 void print(int *shu)\n63 {\n64      for (int i=1;i<=shu[0];i++)\n65      {\n66          if (shu[i]>=10) printf(\""%c\"",char(shu[i]-10+'A'));\n67          else printf(\""%d\"",shu[i]);\n68      }\n69 }",COMPILE_ERROR,0,0
1279711432059322368,0e1ef55d391c9f527ba7066421b9a0adc6c664629bb0f468b929ffd629011446,2020-07-05 17:39:15,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"\nvar\n        st:string;\n        i,k:longint;\n \nfunction zhuan(t:Longint):string;\nvar\n        s:string;\n        i:longint;\nbegin\n        zhuan:='';\n        while t>0 do\n        begin\n                i:=t mod k;\n                t:=t div k;\n                if (i>=0) and (i<=9) then zhuan:=zhuan+chr(i+48) else zhuan:=zhuan+chr(i+55);\n        end;\n        s:='';\n        for i:=length(zhuan) downto 1 do\n                s:=s+zhuan[i];\n        exit(s);\nend;\nfunction huiwen(s:string):boolean;\nvar\n        i:longint;\nbegin\n        huiwen:=true;\n        for i:=1 to length(s) div 2 do\n                if s[i]<>s[length(s)-i+1] then exit(false);\nend;\n \nprocedure print;\nbegin\n \n        writeln(zhuan(i),' ',st);\nend;\n \nbegin\n        readln(k);\n        for i:=1 to 300 do\n        begin\n                st:=zhuan(i*i);\n                if huiwen(st) then print;\n        end;\nend.\n",COMPILE_ERROR,0,0
1279711459351658496,0e1ef55d391c9f527ba7066421b9a0adc6c664629bb0f468b929ffd629011446,2020-07-05 17:39:22,Java,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"\nvar\n        st:string;\n        i,k:longint;\n \nfunction zhuan(t:Longint):string;\nvar\n        s:string;\n        i:longint;\nbegin\n        zhuan:='';\n        while t>0 do\n        begin\n                i:=t mod k;\n                t:=t div k;\n                if (i>=0) and (i<=9) then zhuan:=zhuan+chr(i+48) else zhuan:=zhuan+chr(i+55);\n        end;\n        s:='';\n        for i:=length(zhuan) downto 1 do\n                s:=s+zhuan[i];\n        exit(s);\nend;\nfunction huiwen(s:string):boolean;\nvar\n        i:longint;\nbegin\n        huiwen:=true;\n        for i:=1 to length(s) div 2 do\n                if s[i]<>s[length(s)-i+1] then exit(false);\nend;\n \nprocedure print;\nbegin\n \n        writeln(zhuan(i),' ',st);\nend;\n \nbegin\n        readln(k);\n        for i:=1 to 300 do\n        begin\n                st:=zhuan(i*i);\n                if huiwen(st) then print;\n        end;\nend.\n",COMPILE_ERROR,0,0
1279711485054353408,0e1ef55d391c9f527ba7066421b9a0adc6c664629bb0f468b929ffd629011446,2020-07-05 17:39:28,Python,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"\nvar\n        st:string;\n        i,k:longint;\n \nfunction zhuan(t:Longint):string;\nvar\n        s:string;\n        i:longint;\nbegin\n        zhuan:='';\n        while t>0 do\n        begin\n                i:=t mod k;\n                t:=t div k;\n                if (i>=0) and (i<=9) then zhuan:=zhuan+chr(i+48) else zhuan:=zhuan+chr(i+55);\n        end;\n        s:='';\n        for i:=length(zhuan) downto 1 do\n                s:=s+zhuan[i];\n        exit(s);\nend;\nfunction huiwen(s:string):boolean;\nvar\n        i:longint;\nbegin\n        huiwen:=true;\n        for i:=1 to length(s) div 2 do\n                if s[i]<>s[length(s)-i+1] then exit(false);\nend;\n \nprocedure print;\nbegin\n \n        writeln(zhuan(i),' ',st);\nend;\n \nbegin\n        readln(k);\n        for i:=1 to 300 do\n        begin\n                st:=zhuan(i*i);\n                if huiwen(st) then print;\n        end;\nend.\n",NON_ZERO_EXIT_CODE,172,3260
1279711515198816256,0e1ef55d391c9f527ba7066421b9a0adc6c664629bb0f468b929ffd629011446,2020-07-05 17:39:35,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"\nvar\n        st:string;\n        i,k:longint;\n \nfunction zhuan(t:Longint):string;\nvar\n        s:string;\n        i:longint;\nbegin\n        zhuan:='';\n        while t>0 do\n        begin\n                i:=t mod k;\n                t:=t div k;\n                if (i>=0) and (i<=9) then zhuan:=zhuan+chr(i+48) else zhuan:=zhuan+chr(i+55);\n        end;\n        s:='';\n        for i:=length(zhuan) downto 1 do\n                s:=s+zhuan[i];\n        exit(s);\nend;\nfunction huiwen(s:string):boolean;\nvar\n        i:longint;\nbegin\n        huiwen:=true;\n        for i:=1 to length(s) div 2 do\n                if s[i]<>s[length(s)-i+1] then exit(false);\nend;\n \nprocedure print;\nbegin\n \n        writeln(zhuan(i),' ',st);\nend;\n \nbegin\n        readln(k);\n        for i:=1 to 300 do\n        begin\n                st:=zhuan(i*i);\n                if huiwen(st) then print;\n        end;\nend.\n",COMPILE_ERROR,0,0
1279711804932947968,0e1ef55d391c9f527ba7066421b9a0adc6c664629bb0f468b929ffd629011446,2020-07-05 17:40:44,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<cmath>\n#include<queue>\n#include<cstdio>\n#include<cctype>\n#include<vector>\n#include<cstring>\n#include<iostream>\n#include<algorithm>\nusing namespace std;\nint B;\nint a[20];//只需要考虑二进制的感受 ，开大一点无所谓 \nbool calc(int x)//不存在0我就懒得考虑了 \n{\n    int np=0;\n    x=x*x;\n    while(x)\n    {\n        a[++np]=x%B;\n        x/=B;\n    }\n    for(int i=1,j=np;i<j;i++,j--)\n        if(a[i]!=a[j])\n            return 0;\n    return 1;\n}\nvoid outs(int x)\n{\n    int np=0;\n    while(x)\n    {\n        a[++np]=x%B;\n        x/=B;\n    }\n    for(int i=np;i>=1;i--)\n    {\n        if(a[i]>9)\n            printf(\""%c\"",a[i]-10+'A');\n        else printf(\""%d\"",a[i]);\n    }\n}\nint main()\n{\n    //freopen(\""in.txt\"",\""r\"",stdin);\n    scanf(\""%d\"",&B);\n    for(int i=1;i<=300;i++)\n    {\n        if(calc(i))\n        {\n            outs(i);\n            printf(\"" \"");\n            outs(i*i);\n            printf(\""\\n\"");\n        }\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1279711841016537088,0e1ef55d391c9f527ba7066421b9a0adc6c664629bb0f468b929ffd629011446,2020-07-05 17:40:53,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<cmath>\n#include<queue>\n#include<cstdio>\n#include<cctype>\n#include<vector>\n#include<cstring>\n#include<iostream>\n#include<algorithm>\nusing namespace std;\nint B;\nint a[20];//只需要考虑二进制的感受 ，开大一点无所谓 \nbool calc(int x)//不存在0我就懒得考虑了 \n{\n    int np=0;\n    x=x*x;\n    while(x)\n    {\n        a[++np]=x%B;\n        x/=B;\n    }\n    for(int i=1,j=np;i<j;i++,j--)\n        if(a[i]!=a[j])\n            return 0;\n    return 1;\n}\nvoid outs(int x)\n{\n    int np=0;\n    while(x)\n    {\n        a[++np]=x%B;\n        x/=B;\n    }\n    for(int i=np;i>=1;i--)\n    {\n        if(a[i]>9)\n            printf(\""%c\"",a[i]-10+'A');\n        else printf(\""%d\"",a[i]);\n    }\n}\nint main()\n{\n    //freopen(\""in.txt\"",\""r\"",stdin);\n    scanf(\""%d\"",&B);\n    for(int i=1;i<=300;i++)\n    {\n        if(calc(i))\n        {\n            outs(i);\n            printf(\"" \"");\n            outs(i*i);\n            printf(\""\\n\"");\n        }\n    }\n    return 0;\n}\n",ACCEPTED,40,512
1279711926651641856,64924f1d7e0fb72ee402c548a3ca9387fc5ad2a42c92a9c70eaca218c1fe5da9,2020-07-05 17:41:13,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint n,z=0;\nint a,b;\nint panduan(int n1,int jinzhi)\n{\n    int t=0;\n    int x=1;\n    char zhuanhuahou[300];\n    char a[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\n\n    \n    while(n1>0) {\n        zhuanhuahou[x]=a[n1%jinzhi];\n            n1/=jinzhi;\n            x++;}\n        x--;\n        for(int j=1;j<=x/2;j++)    \n\t\t    {        \n\t\t    if(zhuanhuahou[j]!=zhuanhuahou[x-j+1])        {       t+=1;            }    \n             }\n        \n        return t;\n    }\n        \n}\nint main()\n{ \n    cin>>a>>b;\n    for(int i=b;i>0;i++)\n    {\n        if(n==a)  break;\n        for(int h=2;h<=10;h++)\n        {\n            if(panduan(i,h)==0) z+=1;\n        }\n        if(z>2) {cout<<i<<endl;n+=1}\n        z=0;\n    }\n}",COMPILE_ERROR,0,0
1279712005030608896,64924f1d7e0fb72ee402c548a3ca9387fc5ad2a42c92a9c70eaca218c1fe5da9,2020-07-05 17:41:32,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint n,z=0;\nint a,b;\nint panduan(int n1,int jinzhi)\n{\n    int t=0;\n    int x=1;\n    char zhuanhuahou[300];\n    char a[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\n\n    \n    while(n1>0) {\n        zhuanhuahou[x]=a[n1%jinzhi];\n            n1/=jinzhi;\n            x++;}\n        x--;\n        for(int j=1;j<=x/2;j++)    \n\t\t    {        \n\t\t    if(zhuanhuahou[j]!=zhuanhuahou[x-j+1])        {       t+=1;            }    \n             }\n        \n        return t;\n    }\n        \n\nint main()\n{ \n    cin>>a>>b;\n    for(int i=b;i>0;i++)\n    {\n        if(n==a)  break;\n        for(int h=2;h<=10;h++)\n        {\n            if(panduan(i,h)==0) z+=1;\n        }\n        if(z>2) {cout<<i<<endl;n+=1}\n        z=0;\n    }\n}",COMPILE_ERROR,0,0
1279712067471204352,64924f1d7e0fb72ee402c548a3ca9387fc5ad2a42c92a9c70eaca218c1fe5da9,2020-07-05 17:41:47,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint n,z=0;\nint a,b;\nint panduan(int n1,int jinzhi)\n{\n    int t=0;\n    int x=1;\n    char zhuanhuahou[300];\n    char a[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\n\n    \n    while(n1>0) {\n        zhuanhuahou[x]=a[n1%jinzhi];\n            n1/=jinzhi;\n            x++;}\n        x--;\n        for(int j=1;j<=x/2;j++)    \n\t\t    {        \n\t\t    if(zhuanhuahou[j]!=zhuanhuahou[x-j+1])        {       t+=1;            }    \n             }\n        \n        return t;\n    }\n        \n\nint main()\n{ \n    cin>>a>>b;\n    for(int i=b;i>0;i++)\n    {\n        if(n==a)  break;\n        for(int h=2;h<=10;h++)\n        {\n            if(panduan(i,h)==0) z+=1;\n        }\n        if(z>2) {cout<<i<<endl;n+=1;}\n        z=0;\n    }\n}",WRONG_ANSWER,409,512
1279712081782169600,3aaf4a732f987c33a81e41e1172d3cf2aa189e2b3924d74038f27ba4d11214e7,2020-07-05 17:41:50,C,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\nvoid pr(int i,int o,int a);\nint hw(int o,int a);\nint main()\n{int a,i,o;\n    scanf(\""%d\"",&a);\n    for(i=1;i<=300;i++){\n            o=i*i;\n            if(hw(o,a)==1)\n                pr(i,o,a);\n    }\n    return 0;\n\n}\n\nint hw(int o,int a)\n{\n\n    int n,b[10000],flag=1;\n    for(n=0;o!=0;n++){\n            b[n]=o%a;\n    o=o/a;}\n    int j=0;\n    for(j=0;j<n;j++)\n   if(b[j]!=b[n-j-1])\n    flag=2;\n    return flag;\n}\nvoid pr(int i,int o,int a)\n{\n    int b[10000],c[10000];\nint n1,n2;\n    for(n1=0;i!=0;n1++)\n    {\n        b[n1]=i%a;\n        i=i/a;\n\n    }\n\n        for(n2=0;o!=0;n2++)\n    {\n        c[n2]=o%a;\n\n\n        o=o/a;\n    }\n    n1--;\n    n2--;\n     for(n1;n1>=0;n1--){\n         if(b[n1]==10)\n                printf(\""A\"");\n            if(b[n1]==11)\n               printf(\""B\"");\n             if(b[n1]==12)\n                printf(\""C\"");\n             if(b[n1]==13)\n        printf(\""D\"");\n             if(b[n1]==14)\n                printf(\""E\"");\n             if(b[n1]==15)\n                printf(\""F\"");\n             if(b[n1]==16)\n                printf(\""G\"");\n             if(b[n1]==17)\n             printf(\""H\"");\n             if(b[n1]==18)\n                printf(\""I\"");\n             if(b[n1]==19)\n                printf(\""J\"");\n             if(b[n1]==20)\n                printf(\""K\"");\nif(b[n1]<10)\n         printf(\""%d\"",b[n1]);}\n\n    printf(\"" \"");\n     for(n2;n2>=0;n2--)\n     {\n            if(c[n2]==10)\n                printf(\""A\"");\n            if(c[n2]==11)\n                     printf(\""B\"");\n             if(c[n2]==12)\n                      printf(\""C\"");\n             if(c[n2]==13)\n                      printf(\""D\"");\n             if(c[n2]==14)\n                      printf(\""E\"");\n             if(c[n2]==15)\n                     printf(\""F\"");\n             if(c[n2]==16)\n                      printf(\""G\"");\n             if(c[n2]==17)\n                      printf(\""H\"");\n             if(c[n2]==18)\n                      printf(\""I\"");\n             if(c[n2]==19)\n                      printf(\""J\"");\n             if(c[n2]==20)\n                      printf(\""K\"");\n              if(b[n1]<10)\n                printf(\""%d\"",c[n2]);\n     }\n\n    printf(\""\\n\"");\n}\n",PARTIAL_ACCEPTED,20,384
1279712165001363456,0e1ef55d391c9f527ba7066421b9a0adc6c664629bb0f468b929ffd629011446,2020-07-05 17:42:10,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<cmath>\n#include<queue>\n#include<cstdio>\n#include<cctype>\n#include<vector>\n#include<cstring>\n#include<iostream>\n#include<algorithm>\nusing namespace std;\nint n,s;\nvector<int>a;\nbool jud(int x,int i)//判断x的i进制是不是回文数\n{\n    a.clear();\n    do\n    {\n        a.push_back(x%i);\n        x/=i;\n    }while(x);\n    for(int i=0,j=a.size()-1;i<j;i++,j--)\n        if(a[i]!=a[j])\n            return 0;\n    return 1;\n}\nbool calc(int x)//判断x是不是双重回文数\n{\n    int cnt=0;\n    for(int i=2;i<=10;i++)\n    {\n        if(jud(x,i))\n        {\n            cnt++;\n            if(cnt>=2)\n                return 1;\n        }\n    }\n    return 0;\n}\nint main()\n{\n    //freopen(\""in.txt\"",\""r\"",stdin);\n    //freopen(\""USACO1.2.5附带打表.txt\"",\""w\"",stdout);\n    scanf(\""%d%d\"",&n,&s);\n    for(int i=s+1;n;i++)\n    {\n        if(calc(i))\n        {\n            cout<<i<<endl;\n            n--;\n        }\n    }\n    return 0;\n}\n",ACCEPTED,29,424
1279712372380336128,64924f1d7e0fb72ee402c548a3ca9387fc5ad2a42c92a9c70eaca218c1fe5da9,2020-07-05 17:43:00,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint n,z=0;\nint a,b;\nint panduan(int n1,int jinzhi)\n{\n    int t=0;\n    int x=1;\n    char zhuanhuahou[300];\n    char a[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\n\n    \n    while(n1>0) {\n        zhuanhuahou[x]=a[n1%jinzhi];\n            n1/=jinzhi;\n            x++;}\n      \n        for(int j=1;j<=x/2;j++)    \n\t\t    {        \n\t\t    if(zhuanhuahou[j]!=zhuanhuahou[x-j+1])        {       t+=1;            }    \n             }\n        \n        return t;\n    }\n        \n\nint main()\n{ \n    cin>>a>>b;\n    for(int i=b;i>0;i++)\n    {\n        if(n==a)  break;\n        for(int h=2;h<=10;h++)\n        {\n            if(panduan(i,h)==0) z+=1;\n        }\n        if(z>2) {cout<<i<<endl;n+=1;}\n        z=0;\n    }\n}",MULTIPLE_ERROR,32,512
1279713859269484544,64924f1d7e0fb72ee402c548a3ca9387fc5ad2a42c92a9c70eaca218c1fe5da9,2020-07-05 17:48:54,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint n,z=0;\nint a,b;\nint panduan(int n1,int jinzhi)\n{\n    int t=0;\n    int x=1;\n    char zhuanhuahou[300];\n    char a[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\n\n    \n    while(n1>0) {\n        zhuanhuahou[x]=a[n1%jinzhi];\n            n1/=jinzhi;\n            x++;}\n        x--;\n        for(int j=1;j<=x/2;j++)    \n\t\t    {        \n\t\t    if(zhuanhuahou[j]!=zhuanhuahou[x-j+1])        {       t+=1;  break;          }    \n             }\n        \n        return t;\n    }\n        \n\nint main()\n{ \n    cin>>a>>b;\n  \n    for(int i=b;i>0;i++)\n    {\n        if(n==a)  break;\n        for(int h=2;h<=10;h++)\n        {\n            if(panduan(i,h)==0) z+=1;\n        }\n        if(z>=2) {cout<<i<<endl;n+=1;}\n        z=0;\n    }\n}",WRONG_ANSWER,36,508
1279714101666701312,1817bb666a72aa2533f52bd39de461e38d784dd448094b2a6ba3d0893abf9f28,2020-07-05 17:49:52,C++,50.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <cstdlib>\n#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <cstring>\nconst int maxl = 20;\nusing namespace std;\nint num1[maxl], shu_2[maxl];\nint temp[maxl];\n//进制转换\nvoid change(int *shu, int num, int system);\nbool judge(int *shu);//检查是否是回文数\nint main()\n{\n\tint n=0, s=0;//s为起始数，n为要求的总数目\n\tint cnt_totalnum=0,cnt_tempnum_system=0;\n\tcin>>n>>s;\n\tfor (int i = s; cnt_totalnum <n; i++)\n\t{\n\t\tif (i<0)\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\t\tfor (int j = 2; j <= 10 && cnt_tempnum_system < 2; j++)\n\t\t{\n\t\t\tchange(num1, i, j);\n\t\t\tif (judge(num1))\n\t\t\t{\n\t\t\t\tcnt_tempnum_system++;\n\t\t\t}\n\t\t}\n\t\tif (cnt_tempnum_system == 2)\n\t\t{\n\t\t\tcnt_totalnum++;\n\t\t\tcout << i << endl;\n\t\t}\n\t\tcnt_tempnum_system = 0;\n\t}\n\tsystem(\""pause\"");\n\treturn 0;\n}\n\nvoid change(int *shu, int num, int b)\n{\n\tint point = 0;\n\tmemset(shu, 0, sizeof(shu));\n\tmemset(temp, 0, sizeof(temp));\n\t//进制转换\n\twhile (num)\n\t{\n\t\tint t;\n\t\tt = num%b;\n\t\tnum = num / b;\n\t\ttemp[++point] = t;\n\t}\n\tfor (int i = point; i >= 1; i--) shu[point - i + 1] = temp[i];\n\tshu[0] = point;\n}\nbool judge(int *shu)\n{\n\tint point = shu[0];\n\tfor (int i = 1; i <= (point / 2) + 1; i++)\n\t\tif (shu[i] != shu[point - i + 1]) return false;\n\treturn true;\n}\n",PARTIAL_ACCEPTED,39,768
1279714107098333184,64924f1d7e0fb72ee402c548a3ca9387fc5ad2a42c92a9c70eaca218c1fe5da9,2020-07-05 17:49:53,C++,50.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint n,z=0;\nint a,b;\nint panduan(int n1,int jinzhi)\n{\n    int t=0;\n    int x=1;\n    char zhuanhuahou[300];\n    char a[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\n\n    \n    while(n1>0) {\n        zhuanhuahou[x]=a[n1%jinzhi];\n            n1/=jinzhi;\n            x++;}\n        x--;\n        for(int j=1;j<=x/2;j++)    \n\t\t    {        \n\t\t    if(zhuanhuahou[j]!=zhuanhuahou[x-j+1])        {       t+=1;  break;          }    \n             }\n        \n        return t;\n    }\n        \n\nint main()\n{ \n    cin>>a>>b;\n  \n    for(int i=b;i>0;i++)\n    {\n        if(n==a)  break;\n        for(int h=2;h<=10;h++)\n        {\n            if(panduan(i,h)==0) z+=1;\n        }\n        if(z>=2) {cout<<i<<endl;n+=1;}\n        z=0;\n    }\n}",PARTIAL_ACCEPTED,26,488
1279714181211676672,5f6fe5ec2e9f1448b66bc330cc1ed4d1d67a835fd6cdce39f4a1bed8c73e173d,2020-07-05 17:50:11,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream> \nusing namespace std;\nint main()\n{\n\tint B;\n\tcin >> B;\n\tint i;\n\tint l;\n\tint ch[400];int c[400];\n\tint m,p,j,t;\n\tint f;\n\tint tam;\n\tfor (i = 1; i < 301; i++)\n\t{\n\t\tt = 0;\n\t\tf = 1;\n\t\tl = i*i;\n\t\tm = 0;\n\t\twhile (l != 0)\n\t\t{\n\t\t\tp = l % B;\n\t\t\tl = l / B;\n\t\t\tm++;\n\t\t\tch[m] = p;\n\t\t}\n\t\tfor (j = 1; j <= m; j++)\n\t\t{\n\t\t\tif (ch[j] != ch[m + 1 - j])\n\t\t\t{\n\t\t\t\tf = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (f == 1)\n\t\t{\n\t\t\ttam = i;\n\t\t\twhile (tam != 0)\n\t\t\t{\n\t\t\t\tp = tam % B;\n\t\t\t\ttam = tam / B;\n\t\t\t\tt++;\n\t\t\t\tc[t] = p;\n\t\t\t}\n\t\t\tfor (j = t; j >= 1; j--)\n\t\t\t{\n\t\t\t\tif (c[j] <= 10)\n\t\t\t\t\tcout << c[j];\n\t\t\t\telse\n\t\t\t\t\tcout << (char)(c[j] + 55);*/\n\t\t\t}\n\t\t\tcout << ' ';\n\t\t\tfor (j = 1; j <= m; j++)\n\t\t\t{\n\t\t\t\tif (c[j] <= 10)\n\t\t\t\t\tcout << ch[j];\n\t\t\t\telse\n\t\t\t\t\tcout << (char)(ch[j] + 55);*/\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t\t\n\t}\n\tsystem(\""pause\"");\n\treturn 0;\n}\n",COMPILE_ERROR,0,0
1279714221925793792,26c522ef2a18ad0442c377a8ba238aac9d4f6d83629e48738c67fe5229352ff7,2020-07-05 17:50:21,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n\nusing namespace std;\nchar s1[10000]={};\nchar s2[10000]={};\nint judge(int num,int B){        //判断是否为回文数\n    char s[21]={'0','1','2','3','4','5','6','7','8','9','A',\n                'B','C','D','E','F','G','H','I','J','K'};\n\n    int i=0;\n    while(num!=0){\n        s1[i]=s[num%B];\n        num=num/B;\n        i++;\n    }\n    s1[i]='\\0';\n    for (int x=0,y=i-1;x<y;x++,y--){\n        if (s1[x]!=s1[y])\n            return 0;       //return 返回参数后函数就运行终止了？\n    }\n    return 1;\n}\nvoid translate(int num,int B){    //转化进制\n    char s[21]={'0','1','2','3','4','5','6','7','8','9','A',\n                'B','C','D','E','F','G','H','I','J','K'};\n\n    int i=0;\n    char t;\n    while(num!=0){\n        s2[i]=s[num%B];\n        num=num/B;\n        i++;\n    }\n    s2[i]='\\0';\n    for (int x=0,y=i-1;x<y;x++,y--){\n        t=s2[x];\n        s2[x]=s2[y];\n        s2[y]=t;\n    }\n}\nint main(){\n    int B;\n    cin >> B;\n    for (int i=1;i<=300;i++){\n        if (judge(i*i,B)){\n            translate(i,B);\n            cout << i << \"" \"" <<s2 << \"" \"" << s1 << endl;\n        }\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1279714251738906624,26c522ef2a18ad0442c377a8ba238aac9d4f6d83629e48738c67fe5229352ff7,2020-07-05 17:50:28,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n\nusing namespace std;\nchar s1[10000]={};\nchar s2[10000]={};\nint judge(int num,int B){        //判断是否为回文数\n    char s[21]={'0','1','2','3','4','5','6','7','8','9','A',\n                'B','C','D','E','F','G','H','I','J','K'};\n\n    int i=0;\n    while(num!=0){\n        s1[i]=s[num%B];\n        num=num/B;\n        i++;\n    }\n    s1[i]='\\0';\n    for (int x=0,y=i-1;x<y;x++,y--){\n        if (s1[x]!=s1[y])\n            return 0;       //return 返回参数后函数就运行终止了？\n    }\n    return 1;\n}\nvoid translate(int num,int B){    //转化进制\n    char s[21]={'0','1','2','3','4','5','6','7','8','9','A',\n                'B','C','D','E','F','G','H','I','J','K'};\n\n    int i=0;\n    char t;\n    while(num!=0){\n        s2[i]=s[num%B];\n        num=num/B;\n        i++;\n    }\n    s2[i]='\\0';\n    for (int x=0,y=i-1;x<y;x++,y--){\n        t=s2[x];\n        s2[x]=s2[y];\n        s2[y]=t;\n    }\n}\nint main(){\n    int B;\n    cin >> B;\n    for (int i=1;i<=300;i++){\n        if (judge(i*i,B)){\n            translate(i,B);\n            cout << i << \"" \"" <<s2 << \"" \"" << s1 << endl;\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,40,512
1279714299822407680,5f6fe5ec2e9f1448b66bc330cc1ed4d1d67a835fd6cdce39f4a1bed8c73e173d,2020-07-05 17:50:39,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream> \nusing namespace std;\nint main()\n{\n\tint B;\n\tcin >> B;\n\tint i;\n\tint l;\n\tint ch[400];int c[400];\n\tint m,p,j,t;\n\tint f;\n\tint tam;\n\tfor (i = 1; i < 301; i++)\n\t{\n\t\tt = 0;\n\t\tf = 1;\n\t\tl = i*i;\n\t\tm = 0;\n\t\twhile (l != 0)\n\t\t{\n\t\t\tp = l % B;\n\t\t\tl = l / B;\n\t\t\tm++;\n\t\t\tch[m] = p;\n\t\t}\n\t\tfor (j = 1; j <= m; j++)\n\t\t{\n\t\t\tif (ch[j] != ch[m + 1 - j])\n\t\t\t{\n\t\t\t\tf = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (f == 1)\n\t\t{\n\t\t\ttam = i;\n\t\t\twhile (tam != 0)\n\t\t\t{\n\t\t\t\tp = tam % B;\n\t\t\t\ttam = tam / B;\n\t\t\t\tt++;\n\t\t\t\tc[t] = p;\n\t\t\t}\n\t\t\tfor (j = t; j >= 1; j--)\n\t\t\t{\n\t\t\t\tif (c[j] <= 10)\n\t\t\t\t\tcout << c[j];\n\t\t\t\telse\n\t\t\t\t\tcout << (char)(c[j] + 55);\n\t\t\t}\n\t\t\tcout << ' ';\n\t\t\tfor (j = 1; j <= m; j++)\n\t\t\t{\n\t\t\t\tif (c[j] <= 10)\n\t\t\t\t\tcout << ch[j];\n\t\t\t\telse\n\t\t\t\t\tcout << (char)(ch[j] + 55);\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t\t\n\t}\n\tsystem(\""pause\"");\n\treturn 0;\n}\n",WRONG_ANSWER,38,640
1279714392566857728,26c522ef2a18ad0442c377a8ba238aac9d4f6d83629e48738c67fe5229352ff7,2020-07-05 17:51:01,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n\nusing namespace std;\nchar s1[10000]={};\nchar s2[10000]={};\nint judge(int num,int B){        //判断是否为回文数\n    char s[21]={'0','1','2','3','4','5','6','7','8','9','A',\n                'B','C','D','E','F','G','H','I','J','K'};\n\n    int i=0;\n    while(num!=0){\n        s1[i]=s[num%B];\n        num=num/B;\n        i++;\n    }\n    s1[i]='\\0';\n    for (int x=0,y=i-1;x<y;x++,y--){\n        if (s1[x]!=s1[y])\n            return 0;       //return 返回参数后函数就运行终止了？\n    }\n    return 1;\n}\nvoid translate(int num,int B){    //转化进制\n    char s[21]={'0','1','2','3','4','5','6','7','8','9','A',\n                'B','C','D','E','F','G','H','I','J','K'};\n\n    int i=0;\n    char t;\n    while(num!=0){\n        s2[i]=s[num%B];\n        num=num/B;\n        i++;\n    }\n    s2[i]='\\0';\n    for (int x=0,y=i-1;x<y;x++,y--){\n        t=s2[x];\n        s2[x]=s2[y];\n        s2[y]=t;\n    }\n}\nint main(){\n    int B;\n    cin >> B;\n    for (int i=1;i<=300;i++){\n        if (judge(i*i,B)){\n            translate(i,B);\n            cout << s2 << \"" \"" << s1 << endl;\n        } \n    }\n    return 0;\n}",ACCEPTED,40,384
1279714417959174144,1817bb666a72aa2533f52bd39de461e38d784dd448094b2a6ba3d0893abf9f28,2020-07-05 17:51:07,C++,50.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <cstdlib>\n#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <cstring>\nconst int maxl = 20;\nusing namespace std;\nint num1[maxl], shu_2[maxl];\nint temp[maxl];\n//进制转换\nvoid change(int *shu, int num, int system);\nbool judge(int *shu);//检查是否是回文数\nint main()\n{\n\tint n=0, s=0;//s为起始数，n为要求的总数目\n\tint cnt_totalnum=0,cnt_tempnum_system=0;\n\tcin>>n>>s;\n\tfor (int i = s; cnt_totalnum <n; i++)\n\t{\n\t\tif (i<0)\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\t\tfor (int j = 2; j <= 10 && cnt_tempnum_system < 2; j++)\n\t\t{\n\t\t\tchange(num1, i, j);\n\t\t\tif (judge(num1))\n\t\t\t{\n\t\t\t\tcnt_tempnum_system++;\n\t\t\t}\n\t\t}\n\t\tif (cnt_tempnum_system == 2)\n\t\t{\n\t\t\tcnt_totalnum++;\n\t\t\tcout << i << endl;\n\t\t}\n\t\tcnt_tempnum_system = 0;\n\t}\n\tsystem(\""pause\"");\n\treturn 0;\n}\n\nvoid change(int *shu, int num, int b)\n{\n\tint point = 0;\n\tmemset(shu, 0, sizeof(shu));\n\tmemset(temp, 0, sizeof(temp));\n\t//进制转换\n\twhile (num)\n\t{\n\t\tint t;\n\t\tt = num%b;\n\t\tnum = num / b;\n\t\ttemp[++point] = t;\n\t}\n\tfor (int i = point; i >= 1; i--) shu[point - i + 1] = temp[i];\n\tshu[0] = point;\n}\nbool judge(int *shu)\n{\n\tint point = shu[0];\n\tfor (int i = 1; i <= (point / 2) + 1; i++)\n\t\tif (shu[i] != shu[point - i + 1]) return false;\n\treturn true;\n}\n",PARTIAL_ACCEPTED,42,552
1279714483537117184,5f6fe5ec2e9f1448b66bc330cc1ed4d1d67a835fd6cdce39f4a1bed8c73e173d,2020-07-05 17:51:23,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream> \nusing namespace std;\nint main()\n{\n\tint B;\n\tcin >> B;\n\tint i;\n\tint l;\n\tint ch[400];int c[400];\n\tint m,p,j,t;\n\tint f;\n\tint tam;\n\tfor (i = 1; i < 301; i++)\n\t{\n\t\tt = 0;\n\t\tf = 1;\n\t\tl = i*i;\n\t\tm = 0;\n\t\twhile (l != 0)\n\t\t{\n\t\t\tp = l % B;\n\t\t\tl = l / B;\n\t\t\tm++;\n\t\t\tch[m] = p;\n\t\t}\n\t\tfor (j = 1; j <= m; j++)\n\t\t{\n\t\t\tif (ch[j] != ch[m + 1 - j])\n\t\t\t{\n\t\t\t\tf = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (f == 1)\n\t\t{\n\t\t\ttam = i;\n\t\t\twhile (tam != 0)\n\t\t\t{\n\t\t\t\tp = tam % B;\n\t\t\t\ttam = tam / B;\n\t\t\t\tt++;\n\t\t\t\tc[t] = p;\n\t\t\t}\n\t\t\tfor (j = t; j >= 1; j--)\n\t\t\t{\n\t\t\t\t//if (c[j] <= 10)\n\t\t\t\t\tcout << c[j];\n\t\t\t\t/*else\n\t\t\t\t\tcout << (char)(c[j] + 55);*/\n\t\t\t}\n\t\t\tcout << ' ';\n\t\t\tfor (j = 1; j <= m; j++)\n\t\t\t{\n\t\t\t\t/*if (c[j] <= 10)*/\n\t\t\t\t\tcout << ch[j];\n\t\t\t\t/*else\n\t\t\t\t\tcout << (char)(ch[j] + 55);*/\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t\t\n\t}\n\tsystem(\""pause\"");\n\treturn 0;\n}\n",PARTIAL_ACCEPTED,26,640
1279714750622007296,aef415abc46901e97f1978f8e79b8d564f9efd4d1cc1807579b416efd335a6aa,2020-07-05 17:52:27,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint b=0;\nint numb[17];\n\nint main() {\n\tcin >> b;\n\tint x = 3;\n\tint length = 1;\n\tint sta = 1;\n\t//生成\n\tfor (int j = 1; j <= 300; ++j) {\n\t\tx = j * j;\n\t\tlength = 1;\n\t\tfor (int i = 16; i >= 0; --i) {\n\t\t\t\n\t\t\tnumb[i] = x % b;\n\t\t\tx /= b;\n\t\t\tif (x == 0) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t++length;\n\t\t}\n\t\t//判断\n\t\tsta = 1;\n\t\t//printf(\""num:%d,length:%d\\n\"", j*j, length);\n\t\tfor (int l = 0; l < length / 2; ++l) {\n\t\t\tif (numb[16 - l] != numb[17 - length + l]) {\n\t\t\t\tsta = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t//输出\n\t\tif (sta) {\n\t\t\tcout << j << \"" \"";\n\t\t\tfor (int k = 17 - length; k < 17; ++k) {\n\t\t\t\tif (numb[k] >= 10) {\n\t\t\t\t\tprintf(\""%c\"", (char)(numb[k] + 55));\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tprintf(\""%d\"", numb[k]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tprintf(\""\\n\"");\n\t\t\t\n\t\t}\n\t\t/*cout << j << \"" \"";\n\t\tfor (int k = 17 - length; k < 17; ++k) {\n\t\t\tif (numb[k] >= 10) {\n\t\t\t\tprintf(\""%c\"", (char)(numb[k] + 55));\n\t\t\t}\n\t\t\telse {\n\t\t\t\tprintf(\""%d\"", numb[k]);\n\t\t\t}\n\t\t}\n\t\tif (sta) { printf(\"" 回文数\""); }\n\t\tprintf(\""\\n\"");\n\t\t*/\n\t}\n}",PARTIAL_ACCEPTED,35,432
1279714809568755712,1817bb666a72aa2533f52bd39de461e38d784dd448094b2a6ba3d0893abf9f28,2020-07-05 17:52:41,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nint num1[15], shu_2[15];\nint temp[15];\nvoid change(int *shu, int num, int system);\nbool judge(int *shu);\nint main()\n{\n\tint n=0, s=0;//s为起始数，n为要求的总数目\n\tint cnt_totalnum=0,cnt_tempnum_system=0;\n\tcin>>n>>s;\n\tfor (int i = s+1; cnt_totalnum <n; i++)\n\t{\n\t\tif (i<0)\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\t\tfor (int j = 2; j <= 10 && cnt_tempnum_system < 2; j++)\n\t\t{\n\t\t\tchange(num1, i, j);\n\t\t\tif (judge(num1))\n\t\t\t{\n\t\t\t\tcnt_tempnum_system++;\n\t\t\t}\n\t\t}\n\t\tif (cnt_tempnum_system == 2)\n\t\t{\n\t\t\tcnt_totalnum++;\n\t\t\tcout << i << endl;\n\t\t}\n\t\tcnt_tempnum_system = 0;\n\t}\n\tsystem(\""pause\"");\n\treturn 0;\n}\n\nvoid change(int *shu, int num, int b)\n{\n\tint point = 0;\n\tmemset(shu, 0, sizeof(shu));\n\tmemset(temp, 0, sizeof(temp));\n\twhile (num)\n\t{\n\t\tint t;\n\t\tt = num%b;\n\t\tnum = num / b;\n\t\ttemp[++point] = t;\n\t}\n\tfor (int i = point; i >= 1; i--) shu[point - i + 1] = temp[i];\n\tshu[0] = point;\n}\nbool judge(int *shu)\n{\n\tint point = shu[0];\n\tfor (int i = 1; i <= (point / 2) + 1; i++)\n\t\tif (shu[i] != shu[point - i + 1]) return false;\n\treturn true;\n}\n",COMPILE_ERROR,0,0
1279715015282589696,1817bb666a72aa2533f52bd39de461e38d784dd448094b2a6ba3d0893abf9f28,2020-07-05 17:53:30,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<vector>\nusing namespace std;\nint num1[15], shu_2[15];\nint temp[15];\nvoid change(int *shu, int num, int system);\nbool judge(int *shu);\nint main()\n{\n\tint n=0, s=0;//s为起始数，n为要求的总数目\n\tint cnt_totalnum=0,cnt_tempnum_system=0;\n\tcin>>n>>s;\n\tfor (int i = s+1; cnt_totalnum <n; i++)\n\t{\n\t\tif (i<0)\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\t\tfor (int j = 2; j <= 10 && cnt_tempnum_system < 2; j++)\n\t\t{\n\t\t\tchange(num1, i, j);\n\t\t\tif (judge(num1))\n\t\t\t{\n\t\t\t\tcnt_tempnum_system++;\n\t\t\t}\n\t\t}\n\t\tif (cnt_tempnum_system == 2)\n\t\t{\n\t\t\tcnt_totalnum++;\n\t\t\tcout << i << endl;\n\t\t}\n\t\tcnt_tempnum_system = 0;\n\t}\n\tsystem(\""pause\"");\n\treturn 0;\n}\n\nvoid change(int *shu, int num, int b)\n{\n\tint point = 0;\n\tmemset(shu, 0, sizeof(shu));\n\tmemset(temp, 0, sizeof(temp));\n\twhile (num)\n\t{\n\t\tint t;\n\t\tt = num%b;\n\t\tnum = num / b;\n\t\ttemp[++point] = t;\n\t}\n\tfor (int i = point; i >= 1; i--) shu[point - i + 1] = temp[i];\n\tshu[0] = point;\n}\nbool judge(int *shu)\n{\n\tint point = shu[0];\n\tfor (int i = 1; i <= (point / 2) + 1; i++)\n\t\tif (shu[i] != shu[point - i + 1]) return false;\n\treturn true;\n}\n",COMPILE_ERROR,0,0
1279715165358981120,1817bb666a72aa2533f52bd39de461e38d784dd448094b2a6ba3d0893abf9f28,2020-07-05 17:54:06,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<string>\nusing namespace std;\nint num1[15], shu_2[15];\nint temp[15];\nvoid change(int *shu, int num, int system);\nbool judge(int *shu);\nint main()\n{\n\tint n=0, s=0;//s为起始数，n为要求的总数目\n\tint cnt_totalnum=0,cnt_tempnum_system=0;\n\tcin>>n>>s;\n\tfor (int i = s+1; cnt_totalnum <n; i++)\n\t{\n\t\tif (i<0)\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\t\tfor (int j = 2; j <= 10 && cnt_tempnum_system < 2; j++)\n\t\t{\n\t\t\tchange(num1, i, j);\n\t\t\tif (judge(num1))\n\t\t\t{\n\t\t\t\tcnt_tempnum_system++;\n\t\t\t}\n\t\t}\n\t\tif (cnt_tempnum_system == 2)\n\t\t{\n\t\t\tcnt_totalnum++;\n\t\t\tcout << i << endl;\n\t\t}\n\t\tcnt_tempnum_system = 0;\n\t}\n\tsystem(\""pause\"");\n\treturn 0;\n}\n\nvoid change(int *shu, int num, int b)\n{\n\tint point = 0;\n\tmemset(shu, 0, sizeof(shu));\n\tmemset(temp, 0, sizeof(temp));\n\twhile (num)\n\t{\n\t\tint t;\n\t\tt = num%b;\n\t\tnum = num / b;\n\t\ttemp[++point] = t;\n\t}\n\tfor (int i = point; i >= 1; i--) shu[point - i + 1] = temp[i];\n\tshu[0] = point;\n}\nbool judge(int *shu)\n{\n\tint point = shu[0];\n\tfor (int i = 1; i <= (point / 2) + 1; i++)\n\t\tif (shu[i] != shu[point - i + 1]) return false;\n\treturn true;\n}\n",COMPILE_ERROR,0,0
1279715335886798848,1817bb666a72aa2533f52bd39de461e38d784dd448094b2a6ba3d0893abf9f28,2020-07-05 17:54:46,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<cstring>\n#include<vector>\nusing namespace std;\nint num1[15], shu_2[15];\nint temp[15];\nvoid change(int *shu, int num, int system);\nbool judge(int *shu);\nint main()\n{\n\tint n=0, s=0;//s为起始数，n为要求的总数目\n\tint cnt_totalnum=0,cnt_tempnum_system=0;\n\tcin>>n>>s;\n\tfor (int i = s+1; cnt_totalnum <n; i++)\n\t{\n\t\tif (i<0)\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\t\tfor (int j = 2; j <= 10 && cnt_tempnum_system < 2; j++)\n\t\t{\n\t\t\tchange(num1, i, j);\n\t\t\tif (judge(num1))\n\t\t\t{\n\t\t\t\tcnt_tempnum_system++;\n\t\t\t}\n\t\t}\n\t\tif (cnt_tempnum_system == 2)\n\t\t{\n\t\t\tcnt_totalnum++;\n\t\t\tcout << i << endl;\n\t\t}\n\t\tcnt_tempnum_system = 0;\n\t}\n\tsystem(\""pause\"");\n\treturn 0;\n}\n\nvoid change(int *shu, int num, int b)\n{\n\tint point = 0;\n\tmemset(shu, 0, sizeof(shu));\n\tmemset(temp, 0, sizeof(temp));\n\twhile (num)\n\t{\n\t\tint t;\n\t\tt = num%b;\n\t\tnum = num / b;\n\t\ttemp[++point] = t;\n\t}\n\tfor (int i = point; i >= 1; i--) shu[point - i + 1] = temp[i];\n\tshu[0] = point;\n}\nbool judge(int *shu)\n{\n\tint point = shu[0];\n\tfor (int i = 1; i <= (point / 2) + 1; i++)\n\t\tif (shu[i] != shu[point - i + 1]) return false;\n\treturn true;\n}\n",ACCEPTED,41,540
1279716330284965888,aef415abc46901e97f1978f8e79b8d564f9efd4d1cc1807579b416efd335a6aa,2020-07-05 17:58:43,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint b=0;\nint numb[17];\nint num[9];\n\nint main() {\n\tcin >> b;\n\tint x = 3;\n\tint length = 1;\n\tint lengthnum = 1;\n\tint sta = 1;\n\t//生成\n\tfor (int j = 1; j <= 300; ++j) {\n\t\tx = j * j;\n\t\tlength = 1;\n\t\tlengthnum = 1;\n\t\tfor (int i = 16; i >= 0; --i) {\n\t\t\t\n\t\t\tnumb[i] = x % b;\n\t\t\tx /= b;\n\t\t\tif (x == 0) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t++length;\n\t\t}\n\t\tfor (int i = 8,a=j; i >= 0; --i) {\n\n\t\t\tnum[i] = a % b;\n\t\t\ta /= b;\n\t\t\tif (a == 0) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t++lengthnum;\n\t\t}\n\t\t//判断\n\t\tsta = 1;\n\t\t//printf(\""num:%d,length:%d\\n\"", j*j, length);\n\t\tfor (int l = 0; l < length / 2; ++l) {\n\t\t\tif (numb[16 - l] != numb[17 - length + l]) {\n\t\t\t\tsta = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t//输出\n\t\tif (sta) {\n\t\t\tfor (int k = 9 - lengthnum; k < 9; ++k) {\n\t\t\t\tif (num[k] >= 10) {\n\t\t\t\t\tprintf(\""%c\"", (char)(num[k] + 55));\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tprintf(\""%d\"", num[k]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tprintf(\"" \"");\n\t\t\tfor (int k = 17 - length; k < 17; ++k) {\n\t\t\t\tif (numb[k] >= 10) {\n\t\t\t\t\tprintf(\""%c\"", (char)(numb[k] + 55));\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tprintf(\""%d\"", numb[k]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tprintf(\""\\n\"");\n\t\t\t\n\t\t}\n\t\t/*cout << j << \"" \"";\n\t\tfor (int k = 17 - length; k < 17; ++k) {\n\t\t\tif (numb[k] >= 10) {\n\t\t\t\tprintf(\""%c\"", (char)(numb[k] + 55));\n\t\t\t}\n\t\t\telse {\n\t\t\t\tprintf(\""%d\"", numb[k]);\n\t\t\t}\n\t\t}\n\t\tif (sta) { printf(\"" 回文数\""); }\n\t\tprintf(\""\\n\"");\n\t\t*/\n\t}\n}",ACCEPTED,42,768
1279716484132036608,3aaf4a732f987c33a81e41e1172d3cf2aa189e2b3924d74038f27ba4d11214e7,2020-07-05 17:59:20,C,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\nvoid pr(int i,int o,int a);\nint hw(int o,int a);\nint main()\n{int a,i,o;\n    scanf(\""%d\"",&a);\n    for(i=1;i<=300;i++){\n            o=i*i;\n            if(hw(o,a)==1)\n                pr(i,o,a);\n    }\n    return 0;\n\n}\n\nint hw(int o,int a)\n{\n\n    int n,b[10000],flag=1;\n    for(n=0;o!=0;n++){\n            b[n]=o%a;\n    o=o/a;}\n    int j=0;\n    for(j=0;j<n;j++)\n   if(b[j]!=b[n-j-1])\n    flag=2;\n    return flag;\n}\nvoid pr(int i,int o,int a)\n{\n    int b[10000],c[10000];\nint n1,n2;\n    for(n1=0;i!=0;n1++)\n    {\n        b[n1]=i%a;\n        i=i/a;\n\n    }\n\n        for(n2=0;o!=0;n2++)\n    {\n        c[n2]=o%a;\n\n\n        o=o/a;\n    }\n    n1--;\n    n2--;\n     for(n1;n1>=0;n1--){\n         if(b[n1]==10)\n                printf(\""A\"");\n            if(b[n1]==11)\n               printf(\""B\"");\n             if(b[n1]==12)\n                printf(\""C\"");\n             if(b[n1]==13)\n        printf(\""D\"");\n             if(b[n1]==14)\n                printf(\""E\"");\n             if(b[n1]==15)\n                printf(\""F\"");\n             if(b[n1]==16)\n                printf(\""G\"");\n             if(b[n1]==17)\n             printf(\""H\"");\n             if(b[n1]==18)\n                printf(\""I\"");\n             if(b[n1]==19)\n                printf(\""J\"");\n             if(b[n1]==20)\n                printf(\""K\"");\nif(b[n1]<10)\n         printf(\""%d\"",b[n1]);}\n\n    printf(\"" \"");\n     for(n2;n2>=0;n2--)\n     {\n            if(c[n2]==10)\n                printf(\""A\"");\n            if(c[n2]==11)\n                     printf(\""B\"");\n             if(c[n2]==12)\n                      printf(\""C\"");\n             if(c[n2]==13)\n                      printf(\""D\"");\n             if(c[n2]==14)\n                      printf(\""E\"");\n             if(c[n2]==15)\n                     printf(\""F\"");\n             if(c[n2]==16)\n                      printf(\""G\"");\n             if(c[n2]==17)\n                      printf(\""H\"");\n             if(c[n2]==18)\n                      printf(\""I\"");\n             if(c[n2]==19)\n                      printf(\""J\"");\n             if(c[n2]==20)\n                      printf(\""K\"");\n              if(c[n2]<10)\n                printf(\""%d\"",c[n2]);\n     }\n\n    printf(\""\\n\"");\n}\n",ACCEPTED,27,384
1279718057356746752,64924f1d7e0fb72ee402c548a3ca9387fc5ad2a42c92a9c70eaca218c1fe5da9,2020-07-05 18:05:35,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint n,z=0;\nint a,b;\nint panduan(int n1,int jinzhi)\n{\n    int t=0;\n    int x=1;\n    char zhuanhuahou[300];\n    char a[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\n\n    \n    while(n1>0) {\n        zhuanhuahou[x]=a[n1%jinzhi];\n            n1/=jinzhi;\n            x++;}\n        x--;\n        for(int j=1;j<=x/2;j++)    \n\t\t    {        \n\t\t    if(zhuanhuahou[j]!=zhuanhuahou[x-j+1])        {       t+=1;  break;          }    \n             }\n        \n        return t;\n    }\n        \n\nint main()\n{ \n    cin>>a;\n    for(int i=1;i<=300;i++)\n    {\n        if(panduan(i*i,a)==0)\n        {\n            \n            int x=1;\n            char zhuanhuahou[300];\n            char zhuanhuahou0[300];\n            char a[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\n\n    \n            while(i>0) {\n            zhuanhuahou[x]=a[i%a];\n            i/=a;\n            x++;}\n            int n1,n2,t;\n            n1=x-1;\n            x=1;\n            t=i*i;\n            while(t>0) {\n            zhuanhuahou0[x]=a[t%a];\n            t/=a;\n            x++;}\n            n2=x-1;\n            \n            for(int h=n1;h>0;h--)\n                cout<<zhuanhuahou[h];\n            cout<<\"" \"";\n             for(int h=n2;h>0;h--)\n                  cout<<zhuanhuahou0[h];\n            cout<<endl;\n        }\n    }\n  \n   \n}",COMPILE_ERROR,0,0
1279718211291897856,64924f1d7e0fb72ee402c548a3ca9387fc5ad2a42c92a9c70eaca218c1fe5da9,2020-07-05 18:06:12,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint n,z=0;\nint a,b;\nint panduan(int n1,int jinzhi)\n{\n    int t=0;\n    int x=1;\n    char zhuanhuahou[300];\n    char a[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\n\n    \n    while(n1>0) {\n        zhuanhuahou[x]=a[n1%jinzhi];\n            n1/=jinzhi;\n            x++;}\n        x--;\n        for(int j=1;j<=x/2;j++)    \n\t\t    {        \n\t\t    if(zhuanhuahou[j]!=zhuanhuahou[x-j+1])        {       t+=1;  break;          }    \n             }\n        \n        return t;\n    }\n        \n\nint main()\n{ \n    cin>>a;\n    for(int i=1;i<=300;i++)\n    {\n        if(panduan(i*i,a)==0)\n        {\n            \n            int x=1;\n            char zhuanhuahou[300];\n            char zhuanhuahou0[300];\n            char a[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\n\n    \n            while(i>0) {\n            zhuanhuahou[x]=a[i%a];\n            i/=a;\n            x++;}\n            int n1,n2,t;\n            n1=x-1;\n            x=1;\n            t=i*i;\n            while(t>0) {\n            zhuanhuahou0[x]=a[t%a];\n            t/=a;\n            x++;}\n            n2=x-1;\n            \n            for(int h=n1;h>0;h--)\n                cout<<zhuanhuahou[h];\n            cout<<\"" \"";\n             for(int h=n2;h>0;h--)\n                  cout<<zhuanhuahou0[h];\n            cout<<endl;\n        }\n    }\n  \n   \n}",COMPILE_ERROR,0,0
1279718377872883712,64924f1d7e0fb72ee402c548a3ca9387fc5ad2a42c92a9c70eaca218c1fe5da9,2020-07-05 18:06:51,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint n,z=0;\nint a,b;\nint panduan(int n1,int jinzhi)\n{\n    int t=0;\n    int x=1;\n    char zhuanhuahou[300];\n    char a[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\n\n    \n    while(n1>0) {\n        zhuanhuahou[x]=a[n1%jinzhi];\n            n1/=jinzhi;\n            x++;}\n        x--;\n        for(int j=1;j<=x/2;j++)    \n\t\t    {        \n\t\t    if(zhuanhuahou[j]!=zhuanhuahou[x-j+1])        {       t+=1;  break;          }    \n             }\n        \n        return t;\n    }\n        \n\nint main()\n{ \n    cin>>c;\n    for(int i=1;i<=300;i++)\n    {\n        if(panduan(i*i,c)==0)\n        {\n            \n            int x=1;\n            char zhuanhuahou[300];\n            char zhuanhuahou0[300];\n            char a[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\n\n    \n            while(i>0) {\n            zhuanhuahou[x]=a[i%c];\n            i/=c;\n            x++;}\n            int n1,n2,t;\n            n1=x-1;\n            x=1;\n            t=i*i;\n            while(t>0) {\n            zhuanhuahou0[x]=a[t%c];\n            t/=c;\n            x++;}\n            n2=x-1;\n            \n            for(int h=n1;h>0;h--)\n                cout<<zhuanhuahou[h];\n            cout<<\"" \"";\n             for(int h=n2;h>0;h--)\n                  cout<<zhuanhuahou0[h];\n            cout<<endl;\n        }\n    }\n  \n   \n}",COMPILE_ERROR,0,0
1279718470273400832,64924f1d7e0fb72ee402c548a3ca9387fc5ad2a42c92a9c70eaca218c1fe5da9,2020-07-05 18:07:13,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint n,z=0;\nint a,b;\nint panduan(int n1,int jinzhi)\n{\n    int t=0;\n    int x=1;\n    char zhuanhuahou[300];\n    char a[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\n\n    \n    while(n1>0) {\n        zhuanhuahou[x]=a[n1%jinzhi];\n            n1/=jinzhi;\n            x++;}\n        x--;\n        for(int j=1;j<=x/2;j++)    \n\t\t    {        \n\t\t    if(zhuanhuahou[j]!=zhuanhuahou[x-j+1])        {       t+=1;  break;          }    \n             }\n        \n        return t;\n    }\n        \n\nint main()\n{ \n    int c;\n    cin>>c;\n    for(int i=1;i<=300;i++)\n    {\n        if(panduan(i*i,c)==0)\n        {\n            \n            int x=1;\n            char zhuanhuahou[300];\n            char zhuanhuahou0[300];\n            char a[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\n\n    \n            while(i>0) {\n            zhuanhuahou[x]=a[i%c];\n            i/=c;\n            x++;}\n            int n1,n2,t;\n            n1=x-1;\n            x=1;\n            t=i*i;\n            while(t>0) {\n            zhuanhuahou0[x]=a[t%c];\n            t/=c;\n            x++;}\n            n2=x-1;\n            \n            for(int h=n1;h>0;h--)\n                cout<<zhuanhuahou[h];\n            cout<<\"" \"";\n             for(int h=n2;h>0;h--)\n                  cout<<zhuanhuahou0[h];\n            cout<<endl;\n        }\n    }\n  \n   \n}",TIME_LIMIT_EXCEEDED,0,0
1279719630526930944,64924f1d7e0fb72ee402c548a3ca9387fc5ad2a42c92a9c70eaca218c1fe5da9,2020-07-05 18:11:50,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<math.h> \nusing namespace std;\nint n,y,z;\nint t=1;\nint x=1;\nchar zhuanhuahou[300];\nchar zhuanhuahou0[300];\nchar a[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nint main()\n{\n    cin>>n;\n    for(int i=1;i<=300;i++)\n    {\n        y=i;\n        while(y>0)\n        {\n            zhuanhuahou0[x]=a[y%n];\n            y/=n;\n            x++;\n        }\n        z=x;\n        y=i*i;\n        x=1;\n        while(y>0)\n        {\n            zhuanhuahou[x]=a[y%n];\n            y/=n;\n            x++;\n        }\n        x--;\n      \tfor(int j=1;j<=x/2;j++)    \n\t\t{        \n\t\tif(zhuanhuahou[j]!=zhuanhuahou[x-j+1])        {       t+=1;            }    \n        }\n        \n        if(t==1){   \n\t\t\t for(int h=z-1;h>=1;h--) {\n\t\tcout<<zhuanhuahou0[h];}    \n\t \t\tcout<<\"" \"";     \n\t      for(int h=1;h<=x;h++) {\n\t    \t\tcout<<zhuanhuahou[h];}    \n\t \t\tcout<<endl;     \n\t\t\t }   \n\t\tx=1;\n\t\tt=1;    \n\t\t\n            \n\t\t}\n    \n    }",ACCEPTED,32,448
1279719671081656320,64924f1d7e0fb72ee402c548a3ca9387fc5ad2a42c92a9c70eaca218c1fe5da9,2020-07-05 18:12:00,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<math.h> \nusing namespace std;\nint n,y,z;\nint t=1;\nint x=1;\nchar zhuanhuahou[300];\nchar zhuanhuahou0[300];\nchar a[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nint main()\n{\n    cin>>n;\n    for(int i=1;i<=300;i++)\n    {\n        y=i;\n        while(y>0)\n        {\n            zhuanhuahou0[x]=a[y%n];\n            y/=n;\n            x++;\n        }\n        z=x;\n        y=i*i;\n        x=1;\n        while(y>0)\n        {\n            zhuanhuahou[x]=a[y%n];\n            y/=n;\n            x++;\n        }\n        x--;\n      \tfor(int j=1;j<=x/2;j++)    \n\t\t{        \n\t\tif(zhuanhuahou[j]!=zhuanhuahou[x-j+1])        {       t+=1;            }    \n        }\n        \n        if(t==1){   \n\t\t\t for(int h=z-1;h>=1;h--) {\n\t\tcout<<zhuanhuahou0[h];}    \n\t \t\tcout<<\"" \"";     \n\t      for(int h=1;h<=x;h++) {\n\t    \t\tcout<<zhuanhuahou[h];}    \n\t \t\tcout<<endl;     \n\t\t\t }   \n\t\tx=1;\n\t\tt=1;    \n\t\t\n            \n\t\t}\n    \n    }",ACCEPTED,40,528
1279720632168669184,64924f1d7e0fb72ee402c548a3ca9387fc5ad2a42c92a9c70eaca218c1fe5da9,2020-07-05 18:15:49,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint n,z=0;\nint a,b;\nint panduan(int n1,int jinzhi)\n{\n    int t=0;\n    int x=1;\n    char zhuanhuahou[300];\n    char a[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\n\n    \n    while(n1>0) {\n        zhuanhuahou[x]=a[n1%jinzhi];\n            n1/=jinzhi;\n            x++;}\n        x--;\n        for(int j=1;j<=x/2;j++)    \n\t\t    {        \n\t\t    if(zhuanhuahou[j]!=zhuanhuahou[x-j+1])        {       t+=1;  break;          }    \n             }\n        \n        return t;\n    }\n        \n\nint main()\n{ \n    cin>>a>>b;\n  \n    for(int i=b+1;i>0;i++)\n    {\n        if(n==a)  break;\n        for(int h=2;h<=10;h++)\n        {\n            if(panduan(i,h)==0) z+=1;\n        }\n        if(z>=2) {cout<<i<<endl;n+=1;}\n        z=0;\n    }\n}",ACCEPTED,37,508
1279720720400048128,64924f1d7e0fb72ee402c548a3ca9387fc5ad2a42c92a9c70eaca218c1fe5da9,2020-07-05 18:16:10,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint n,z=0;\nint a,b;\nint panduan(int n1,int jinzhi)\n{\n    int t=0;\n    int x=1;\n    char zhuanhuahou[300];\n    char a[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\n\n    \n    while(n1>0) {\n        zhuanhuahou[x]=a[n1%jinzhi];\n            n1/=jinzhi;\n            x++;}\n        x--;\n        for(int j=1;j<=x/2;j++)    \n\t\t    {        \n\t\t    if(zhuanhuahou[j]!=zhuanhuahou[x-j+1])        {       t+=1;  break;          }    \n             }\n        \n        return t;\n    }\n        \n\nint main()\n{ \n    cin>>a>>b;\n  \n    for(int i=b+1;i>0;i++)\n    {\n        if(n==a)  break;\n        for(int h=2;h<=10;h++)\n        {\n            if(panduan(i,h)==0) z+=1;\n        }\n        if(z>=2) {cout<<i<<endl;n+=1;}\n        z=0;\n    }\n}",ACCEPTED,39,384
1279720858711416832,aef415abc46901e97f1978f8e79b8d564f9efd4d1cc1807579b416efd335a6aa,2020-07-05 18:16:43,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint N = 0;\nint S = 0;\nint num[14];\nint x = S + 1;\nint length = 1;\n\nint f(int x) {\n\tint count = 0;\n\tint sta = 1;\n\tfor (int b = 2; b <= 10; ++b) {\n\t\tsta = 1;\n\t\tlength = 1;\n\t\tfor (int i = 13; i >= 0; --i) {\n\t\t\tnum[i] = x % b;\n\t\t\tx /= b;\n\t\t\tif (x == 0) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t++length;\n\t\t}\n\t\tfor (int i = 0; i < length / 2; ++i) {\n\t\t\tif (num[13 - i] != num[14 - length + i]) {\n\t\t\t\tsta = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (sta) {\n\t\t\t++count;\n\t\t}\n\t\tif (count >= 2)\n\t\t\treturn 1;\n\t}\n\treturn 0;\n}\nint main() {\n\tcin >> N >> S;\n\t++S;\n\tfor (;N>0;) {\n\t\tif (f(S)) {\n\t\t\tprintf(\""%d\\n\"", S);\n\t\t\t--N;\n\t\t}\n\t\t++S;\n\t}\n\t\n}",PARTIAL_ACCEPTED,23,492
1279740153210265600,26c522ef2a18ad0442c377a8ba238aac9d4f6d83629e48738c67fe5229352ff7,2020-07-05 19:33:23,C++,20.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\nbool judge(int num,int B){        //判断是否为回文数\n    char s[10]={'0','1','2','3','4','5','6','7','8','9'};\n    char s1[10000]={};\n    int i=0;\n    while(num!=0){\n        s1[i]=s[num%B];\n        num=num/B;\n        i++;\n    }\n    s1[i]='\\0';\n    for (int x=0,y=i-1;x<y;x++,y--){\n        if (s1[x]!=s1[y])\n            return 0;       //return 返回参数后函数就运行终止了？\n    }\n    return 1;\n}\n\nint  main(){\n    int N,S;\n    int m=0;\n    cin >> N;\n    cin >> S;\n    for (int j=S+1;j<30;j++){\n        int n=0;\n        for (int i=2;i<11;i++){\n            if (judge(j,i))\n                n++;\n        }\n        if (n>=2&&m<N){\n            cout << j << endl;\n            m++;\n\n        }\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,23,488
1279740331354947584,26c522ef2a18ad0442c377a8ba238aac9d4f6d83629e48738c67fe5229352ff7,2020-07-05 19:34:06,C++,60.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\nbool judge(int num,int B){        //判断是否为回文数\n    char s[10]={'0','1','2','3','4','5','6','7','8','9'};\n    char s1[10000]={};\n    int i=0;\n    while(num!=0){\n        s1[i]=s[num%B];\n        num=num/B;\n        i++;\n    }\n    s1[i]='\\0';\n    for (int x=0,y=i-1;x<y;x++,y--){\n        if (s1[x]!=s1[y])\n            return 0;       //return 返回参数后函数就运行终止了？\n    }\n    return 1;\n}\n\nint  main(){\n    int N,S;\n    int m=0;\n    cin >> N;\n    cin >> S;\n    for (int j=S+1;j<10000;j++){\n        int n=0;\n        for (int i=2;i<11;i++){\n            if (judge(j,i))\n                n++;\n        }\n        if (n>=2&&m<N){\n            cout << j << endl;\n            m++;\n\n        }\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,145,424
1279742450501877760,26c522ef2a18ad0442c377a8ba238aac9d4f6d83629e48738c67fe5229352ff7,2020-07-05 19:42:31,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\nbool judge(int num,int B){        //判断是否为回文数\n    char s[10]={'0','1','2','3','4','5','6','7','8','9'};\n    char s1[100]={};\n    int i=0;\n    while(num!=0){\n        s1[i]=s[num%B];\n        num=num/B;\n        i++;\n    }\n    s1[i]='\\0';\n    for (int x=0,y=i-1;x<y;x++,y--){\n        if (s1[x]!=s1[y])\n            return 0;       //return 返回参数后函数就运行终止了？\n    }\n    return 1;\n}\n\nint  main(){\n    int N,S;\n    int m=0;\n    cin >> N;\n    cin >> S;\n    for (int j=S+1;;j++){\n        int n=0;\n        for (int i=2;i<11;i++){\n            if (judge(j,i))\n                n++;\n        }\n        if (n>=2&&m<N){\n            cout << j << endl;\n            m++;\n\n        }\n    }\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,0,0
1279742544403947520,26c522ef2a18ad0442c377a8ba238aac9d4f6d83629e48738c67fe5229352ff7,2020-07-05 19:42:53,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\nbool judge(int num,int B){        //判断是否为回文数\n    char s[10]={'0','1','2','3','4','5','6','7','8','9'};\n    char s1[10000]={};\n    int i=0;\n    while(num!=0){\n        s1[i]=s[num%B];\n        num=num/B;\n        i++;\n    }\n    s1[i]='\\0';\n    for (int x=0,y=i-1;x<y;x++,y--){\n        if (s1[x]!=s1[y])\n            return 0;       //return 返回参数后函数就运行终止了？\n    }\n    return 1;\n}\n\nint  main(){\n    int N,S;\n    int m=0;\n    cin >> N;\n    cin >> S;\n    for (int j=S+1;;j++){\n        int n=0;\n        for (int i=2;i<11;i++){\n            if (judge(j,i))\n                n++;\n        }\n        if (n>=2&&m<N){\n            cout << j << endl;\n            m++;\n\n        }\n    }\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,0,0
1279742833047568384,26c522ef2a18ad0442c377a8ba238aac9d4f6d83629e48738c67fe5229352ff7,2020-07-05 19:44:02,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\nbool judge(int num,int B){        //判断是否为回文数\n    char s[10]={'0','1','2','3','4','5','6','7','8','9'};\n    char s1[10000]={};\n    int i=0;\n    while(num!=0){\n        s1[i]=s[num%B];\n        num=num/B;\n        i++;\n    }\n    s1[i]='\\0';\n    for (int x=0,y=i-1;x<y;x++,y--){\n        if (s1[x]!=s1[y])\n            return 0;       //return 返回参数后函数就运行终止了？\n    }\n    return 1;\n}\n\nint  main(){\n    int N,S;\n    int m=0;\n    cin >> N;\n    cin >> S;\n    for (int j=S+1;;j++){\n        int n=0;\n        for (int i=2;i<11;i++){\n            if (judge(j,i))\n                n++;\n        }\n        if (n>=2&&m<N){\n            cout << j << endl;\n            m++;\n\n        }\n    }\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,0,0
1279743403594547200,26c522ef2a18ad0442c377a8ba238aac9d4f6d83629e48738c67fe5229352ff7,2020-07-05 19:46:18,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\nbool judge(int num,int B){        //判断是否为回文数\n    char s[10]={'0','1','2','3','4','5','6','7','8','9'};\n    char s1[10000]={};\n    int i=0;\n    while(num!=0){\n        s1[i]=s[num%B];\n        num=num/B;\n        i++;\n    }\n    s1[i]='\\0';\n    for (int x=0,y=i-1;x<y;x++,y--){\n        if (s1[x]!=s1[y])\n            return 0;       //return 返回参数后函数就运行终止了？\n    }\n    return 1;\n}\n\nint  main(){\n    int N,S;\n    int m=0;\n    cin >> N;\n    cin >> S;\n    for (int j=S+1;;j++){\n        int n=0;\n        for (int i=2;i<11;i++){\n            if (judge(j,i))\n                n++;\n        }\n        if (n>=2&&m<N){\n            cout << j << endl;\n            m++;\n\n        }\n    }\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,0,0
1279746224545005568,26c522ef2a18ad0442c377a8ba238aac9d4f6d83629e48738c67fe5229352ff7,2020-07-05 19:57:31,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\nbool judge(int num,int B){        //判断是否为回文数\n    char s[10]={'0','1','2','3','4','5','6','7','8','9'};\n    char s1[10000]={};\n    int i=0;\n    while(num!=0){\n        s1[i]=s[num%B];\n        num=num/B;\n        i++;\n    }\n    s1[i]='\\0';\n    for (int x=0,y=i-1;x<y;x++,y--){\n        if (s1[x]!=s1[y])\n            return 0;       //return 返回参数后函数就运行终止了？\n    }\n    return 1;\n}\n\nint  main(){\n    int N,S;\n    int m=0;\n    cin >> N;\n    cin >> S;\n    for (int j=S+1;;j++){\n        int n=0;\n        for (int i=2;i<11;i++){\n            if (judge(j,i))\n                n++;\n        }\n        if (n>=2&&m<N){\n            cout << j << endl;\n            m++;\n\n        }\n    }\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,0,0
1279746383291023360,26c522ef2a18ad0442c377a8ba238aac9d4f6d83629e48738c67fe5229352ff7,2020-07-05 19:58:08,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\nbool judge(int num,int B){        //判断是否为回文数\n    char s[10]={'0','1','2','3','4','5','6','7','8','9'};\n    char s1[10000]={};\n    int i=0;\n    while(num!=0){\n        s1[i]=s[num%B];\n        num=num/B;\n        i++;\n    }\n    s1[i]='\\0';\n    for (int x=0,y=i-1;x<y;x++,y--){\n        if (s1[x]!=s1[y])\n            return 0;       //return 返回参数后函数就运行终止了？\n    }\n    return 1;\n}\n\nint  main(){\n    int N,S;\n    int m=0;\n    cin >> N;\n    cin >> S;\n    for (int j=S+1;;j++){\n        int n=0;\n        for (int i=2;i<11;i++){\n            if (judge(j,i))\n                n++;\n        }\n        if (n>=2&&m<N){\n            cout << j << endl;\n            m++;\n\n        }\n    }\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,0,0
1279746441105309696,26c522ef2a18ad0442c377a8ba238aac9d4f6d83629e48738c67fe5229352ff7,2020-07-05 19:58:22,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\nbool judge(int num,int B){        //判断是否为回文数\n    char s[10]={'0','1','2','3','4','5','6','7','8','9'};\n    char s1[100]={};\n    int i=0;\n    while(num!=0){\n        s1[i]=s[num%B];\n        num=num/B;\n        i++;\n    }\n    s1[i]='\\0';\n    for (int x=0,y=i-1;x<y;x++,y--){\n        if (s1[x]!=s1[y])\n            return 0;       //return 返回参数后函数就运行终止了？\n    }\n    return 1;\n}\n\nint  main(){\n    int N,S;\n    int m=0;\n    cin >> N;\n    cin >> S;\n    for (int j=S+1;;j++){\n        int n=0;\n        for (int i=2;i<11;i++){\n            if (judge(j,i))\n                n++;\n        }\n        if (n>=2&&m<N){\n            cout << j << endl;\n            m++;\n\n        }\n    }\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,0,0
1279746906572390400,26c522ef2a18ad0442c377a8ba238aac9d4f6d83629e48738c67fe5229352ff7,2020-07-05 20:00:13,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\nbool judge(int num,int B){        //判断是否为回文数\n    char s[10]={'0','1','2','3','4','5','6','7','8','9'};\n    char s1[100]={};\n    int i=0;\n    while(num!=0){\n        s1[i]=s[num%B];\n        num=num/B;\n        i++;\n    }\n    s1[i]='\\0';\n    for (int x=0,y=i-1;x<y;x++,y--){\n        if (s1[x]!=s1[y])\n            return 0;       //return 返回参数后函数就运行终止了？\n    }\n    return 1;\n}\n\nint  main(){\n    int N,S;\n    int m=0;\n    cin >> N;\n    cin >> S;\n    for (int j=S+1;;j++){\n        int n=0;\n        for (int i=2;i<11;i++){\n            if (judge(j,i))\n                n++;\n        }\n        if (n>=2&&m<N){\n            cout << j << endl;\n            m++;\n\n        }\n    }\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,0,0
1279746957738704896,26c522ef2a18ad0442c377a8ba238aac9d4f6d83629e48738c67fe5229352ff7,2020-07-05 20:00:25,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\nbool judge(int num,int B){        //判断是否为回文数\n    char s[10]={'0','1','2','3','4','5','6','7','8','9'};\n    char s1[10000]={};\n    int i=0;\n    while(num!=0){\n        s1[i]=s[num%B];\n        num=num/B;\n        i++;\n    }\n    s1[i]='\\0';\n    for (int x=0,y=i-1;x<y;x++,y--){\n        if (s1[x]!=s1[y])\n            return 0;       //return 返回参数后函数就运行终止了？\n    }\n    return 1;\n}\n\nint  main(){\n    int N,S;\n    int m=0;\n    cin >> N;\n    cin >> S;\n    for (int j=S+1;;j++){\n        int n=0;\n        for (int i=2;i<11;i++){\n            if (judge(j,i))\n                n++;\n        }\n        if (n>=2&&m<N){\n            cout << j << endl;\n            m++;\n\n        }\n    }\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,0,0
1279747283074088960,26c522ef2a18ad0442c377a8ba238aac9d4f6d83629e48738c67fe5229352ff7,2020-07-05 20:01:43,C++,60.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\nbool judge(int num,int B){        //判断是否为回文数\n    char s[10]={'0','1','2','3','4','5','6','7','8','9'};\n    char s1[10000]={};\n    int i=0;\n    while(num!=0){\n        s1[i]=s[num%B];\n        num=num/B;\n        i++;\n    }\n    s1[i]='\\0';\n    for (int x=0,y=i-1;x<y;x++,y--){\n        if (s1[x]!=s1[y])\n            return 0;       //return 返回参数后函数就运行终止了？\n    }\n    return 1;\n}\n\nint  main(){\n    int N,S;\n    int m=0;\n    cin >> N;\n    cin >> S;\n    for (int j=S+1;j<12000;j++){\n        int n=0;\n        for (int i=2;i<11;i++){\n            if (judge(j,i))\n                n++;\n        }\n        if (n>=2&&m<N){\n            cout << j << endl;\n            m++;\n\n        }\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,185,492
1279747690160644096,26c522ef2a18ad0442c377a8ba238aac9d4f6d83629e48738c67fe5229352ff7,2020-07-05 20:03:20,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\nbool judge(int num,int B){        //判断是否为回文数\n    char s[10]={'0','1','2','3','4','5','6','7','8','9'};\n    char s1[10000]={};\n    int i=0;\n    while(num!=0){\n        s1[i]=s[num%B];\n        num=num/B;\n        i++;\n    }\n    s1[i]='\\0';\n    for (int x=0,y=i-1;x<y;x++,y--){\n        if (s1[x]!=s1[y])\n            return 0;       //return 返回参数后函数就运行终止了？\n    }\n    return 1;\n}\n\nint  main(){\n    int N,S;\n    int m=0;\n    cin >> N;\n    cin >> S;\n    for (int j=S+1;j<13000;j++){\n        int n=0;\n        for (int i=2;i<11;i++){\n            if (judge(j,i))\n                n++;\n        }\n        if (n>=2&&m<N){\n            cout << j << endl;\n            m++;\n\n        }\n    }\n    return 0;\n}\n",ACCEPTED,208,532
1279760151761829888,086db4f0f11f3b10bda993bb6aca37960aa81cc026acb9478ab6e07d448d7333,2020-07-05 20:52:51,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nint n,s;\nchar scores[15];\nint iNumber[15] = {0};\nint iCount = 0;\n\nbool Judge(int x,int y){\n    int iNum = 0;\n    while(x!=0){\n        for(int i=1;i<15;i++)\n            iNumber[i]++;\n        scores[++iNum]=x%y;\n        x/=y;\n    }\n    for(int i=1;i<=iNum;i++){\n        if(scores[i]!=scores[iNum+1-i])\n            return 0;\n    }\n    return 1;\n}\n\nint main(){\n    cin >> n >> s;\n    for(int i=s+1; iCount!=n; i++){\n        int iSum=0;\n        for(int j=2; j<=10; j++){\n            if(Judge(i,j))\n                iSum++;\n        }\n        if(iSum>=2){\n            for(int k=1;k<15;k++)\n                iNumber[k]++;\n            cout << i << endl;\n            iCount++;\n        }\n    }\n    return 0;\n}\n",ACCEPTED,27,512
1279764079630016512,b84f0dba852974b077f34cdfb7f3a0dcdf505a3c646f49eb4728fbb0b4d9d083,2020-07-05 21:08:28,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"\n#include<iostream>\n\n\nusing namespace std;\n\nint b;\nstring s;\n\nstring change(int x){\n    s.clear();\n    while(x){//直到x为0\n        if(x%b>=0&&x%b<=9){\n            s+=(x%b+'0');//将数字转化为对应字符\n        }\n        else{\n            s+=(x%b+'A'-10);//'A'+1='B'\n        }\n        x/=b;\n    }\n    return s;\n}//因为需要把整数转化成b进制字符串（因为有A，B等）；注意此时的顺序是反的\n\nint main(){\n   cin>>b;\n   for(int i=1;i<=300;i++){\n       string t = change(i*i);\n       string k(t.begin(),t.end());\n       reverse(t.begin(),t.end());//t顺序颠倒\n       if(t==k){//判断是否是回文\n            string g = change(i);\n            reverse(g.begin(),g.end());\n            cout<< g <<\"" \""<<t<<endl;\n        }\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1279764131179053056,b84f0dba852974b077f34cdfb7f3a0dcdf505a3c646f49eb4728fbb0b4d9d083,2020-07-05 21:08:40,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"\n#include<iostream>\n#include <algorithm>\n\nusing namespace std;\n\nint b;\nstring s;\n\nstring change(int x){\n    s.clear();\n    while(x){//直到x为0\n        if(x%b>=0&&x%b<=9){\n            s+=(x%b+'0');//将数字转化为对应字符\n        }\n        else{\n            s+=(x%b+'A'-10);//'A'+1='B'\n        }\n        x/=b;\n    }\n    return s;\n}//因为需要把整数转化成b进制字符串（因为有A，B等）；注意此时的顺序是反的\n\nint main(){\n   cin>>b;\n   for(int i=1;i<=300;i++){\n       string t = change(i*i);\n       string k(t.begin(),t.end());\n       reverse(t.begin(),t.end());//t顺序颠倒\n       if(t==k){//判断是否是回文\n            string g = change(i);\n            reverse(g.begin(),g.end());\n            cout<< g <<\"" \""<<t<<endl;\n        }\n    }\n    return 0;\n}",ACCEPTED,33,512
1279777696014336000,b187174f03bd121c1bab68090cc2e4c9b38801a35b733f87bec579962a6eed36,2020-07-05 22:02:34,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\nint huiwen(vector<int> a) {\n\tfor (int y = 0; y < a.size(); ++y) {\n\t\tif (a[y] != a[a.size() - 1 - y])return 0;\n\t}\n\treturn 1;\n}\nint change(int m, int n) {\n\tvector<int> a;\n\twhile (m > 0) {\n\t\tint x = m % n;\n\t\ta.push_back(x);\n\t\tm /= n;\n\t}\n\tif (huiwen(a))return 1;\n\treturn 0;\n}\nint main() {\n\tint n, s;\n\tcin >> n >> s;\n\tint temp = 0, counter = 0;\n\tvector<int> b;\n\tfor (int i = s + 1;; ++i) {\n\t\tif (counter == n)break;\n\t\ttemp = 0;\n\t\tfor (int j = 2; j <= 10; ++j) {\n\t\t\tif (change(i, j))temp++;\n\t\t\tif (temp >= 2) {\n\t\t\t\tb.push_back(i);\n\t\t\t\tcounter++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tfor (int i = 0; i < n; ++i) {\n\t\tcout << b[i] << endl;\n\t}\n\treturn 0;\n}",ACCEPTED,50,512
1279782212092747776,299338d5ab323b9a652bcf61b728fe1bf6dc2331e8b6c1af6ef92ea19022f137,2020-07-05 22:20:31,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n#include<iostream>\n#include<algorithm>\nusing namespace std;\nint s[1000];\nchar toword(int a)\n{\n\tif(a>=10)\n\treturn 'A'+a-10; \n}\nbool ishuiwen(int a,int b){\n    int r=0;\n    while(a){\n        s[++r]=a%b;\n        a/=b;\n    }\n    s[0]=r;\n\tchar str[1000];\n\tchar str1[1000];\n\tfor(int i=0;i<r;i++)\n\t{\n\t\tstr[i]=(char)(s[i+1]-'0');\n\t}\n\tfor(int i=0;i<r;i++)\n\t\tstr1[i]=str[i];\n\treverse(str,str+r);\n\tfor(int i=0;i<r;i++)\n\tif(str1[i]!=str[i])\n\t\t\treturn 0;\n\t\t\treturn 1;\n}\nvoid jz(int a,int b)\n{\n    for(int i=s[0];i>=1;i--)\n    {\n    \tif(s[i]>=10)\n    \t\tcout<<toword(s[i]);\n    \telse \n    \t\tcout<<s[i];\n    }\n}\nint main()\n{\t\n\tint n;\n\tscanf(\""%d\"",&n);\n\tfor(int i=1;i<=300;i++)\n\t{\n\t\tif(ishuiwen(i*i,n))\n\t\t{\n\t\t\tjz(i,n);\n\t\t\tcout<<' ';\n\t\t\tjz(i*i,n);\n\t\t\tcout<<endl; \n\t\t}\n\t}\n\treturn 0;\n}",WRONG_ANSWER,40,512
1279782264971378688,299338d5ab323b9a652bcf61b728fe1bf6dc2331e8b6c1af6ef92ea19022f137,2020-07-05 22:20:43,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n#include<iostream>\n#include<algorithm>\nusing namespace std;\nint s[1000];\nchar toword(int a)\n{\n\tif(a>=10)\n\treturn 'A'+a-10; \n}\nbool ishuiwen(int a,int b){\n    int r=0;\n    while(a){\n        s[++r]=a%b;\n        a/=b;\n    }\n    s[0]=r;\n\tchar str[1000];\n\tchar str1[1000];\n\tfor(int i=0;i<r;i++)\n\t{\n\t\tstr[i]=(char)(s[i+1]-'0');\n\t}\n\tfor(int i=0;i<r;i++)\n\t\tstr1[i]=str[i];\n\treverse(str,str+r);\n\tfor(int i=0;i<r;i++)\n\tif(str1[i]!=str[i])\n\t\t\treturn 0;\n\t\t\treturn 1;\n}\nvoid jz(int a,int b)\n{\n    int r=0;\n    while(a){\n        s[++r]=a%b;\n        a/=b;\n    }\n    s[0]=r;\n    for(int i=s[0];i>=1;i--)\n    {\n    \tif(s[i]>=10)\n    \t\tcout<<toword(s[i]);\n    \telse \n    \t\tcout<<s[i];\n    }\n}\nint main()\n{\t\n\tint n;\n\tscanf(\""%d\"",&n);\n\tfor(int i=1;i<=300;i++)\n\t{\n\t\tif(ishuiwen(i*i,n))\n\t\t{\n\t\t\tjz(i,n);\n\t\t\tcout<<' ';\n\t\t\tjz(i*i,n);\n\t\t\tcout<<endl; \n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,45,636
1279782671365881856,299338d5ab323b9a652bcf61b728fe1bf6dc2331e8b6c1af6ef92ea19022f137,2020-07-05 22:22:20,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n#include<iostream>\n#include<algorithm>\nusing namespace std;\nint s[1000];\nint r=0;\nchar toword(int a)\n{\n\tif(a>=10)\n\treturn 'A'+a-10; \n}\nbool ishuiwen(int a,int b){\n    int r=0;\n    while(a){\n        s[++r]=a%b;\n        a/=b;\n    }\n    s[0]=r;\n\tchar str[1000];\n\tchar str1[1000];\n\tfor(int i=0;i<r;i++)\n\t{\n\t\tstr[i]=(char)(s[i+1]-'0');\n\t}\n\tfor(int i=0;i<r;i++)\n\t\tstr1[i]=str[i];\n\treverse(str,str+r);\n\tfor(int i=0;i<r;i++)\n\tif(str1[i]!=str[i])\n\t\t\treturn 0;\n\t\t\treturn 1;\n}\nvoid jz(int a,int b)\n{\n    \n    for(int i=s[0];i>=1;i--)\n    {\n    \tif(s[i]>=10)\n    \t\tcout<<toword(s[i]);\n    \telse \n    \t\tcout<<s[i];\n    }\n}\nint main()\n{\t\n\tint n;\n\tscanf(\""%d\"",&n);\n\tfor(int i=1;i<=300;i++)\n\t{\n\t\tif(ishuiwen(i*i,n))\n\t\t{\n\t\t\tjz(i,n);\n\t\t\tcout<<' ';\n\t\t\tjz(i*i,n);\n\t\t\tcout<<endl; \n\t\t}\n\t}\n\treturn 0;\n}",WRONG_ANSWER,41,608
1279795546087153664,c5f006269b926e61241c8f09728f8ca99c23da829b64fc3aefb604777dcc38c7,2020-07-05 23:13:30,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string.h>\nusing namespace std;\nbool Ishui(string n);\nvoid transf(int yuan, int jinzhi,char can[]);\nint main()\n{\n    int N, S;\n    int count = 0;\n    int counthui = 0;\n    char* p = \""\"";\n    cin >> N >> S;\n    for(int i = S+1; count < N; i++)\n    {\n        for(int j=2;j<=10;j++)\n        {\n            char can[20];\n            transf(i,j,can);\n            if(Ishui(can)){counthui++;}\n        }\n        if(counthui >= 2){cout << i << endl;counthui = 0;count++;}\n    }\n    return 0;\n}\nbool Ishui(string n)\n{\n    int length = (int)n.size();\n    int count;\n    if(length==1){return true;}\n    else\n    {\n        for(int j = 0; j < length/2; j++)\n        {\n            if(n[j] == n[length-1-j]){count++;continue;}\n            else{break;}\n        }\n        if(count==length/2){return true;}\n        else{return false;}\n    }\n}\nvoid transf(int yuan, int jinzhi,char can[])\n{\n    for(int i = 0; i <= 18; i++)\n    {\n        if(yuan==0){can[i] = '\\0';break;}\n        else\n        {\n            can[i] = yuan%jinzhi+48;\n            yuan /= jinzhi;\n        }\n    }\n}",PARTIAL_ACCEPTED,5,256
1279796006923730944,16228dd118ca28b2c17457d3030101e7c97f3b55984144a0fc54cf7654383981,2020-07-05 23:15:20,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n#include<string.h>\nint main()\n{\n\tvoid transform(int num, int B, char *str);\n\tint B, i, j,len; \n\tchar str[1000] = {'\\0'};\n\tscanf(\""%d\"", &B);\n\tfor (i = 1;i <= 300;i++)\n\t{\n\t\tint flag = 1;\n\t\ttransform(i*i, B, str);\n\t\tlen = strlen(str);\n\t\tfor  (j = 0;j < len / 2;j++)\n\t\t\tif (str[j]!= str[len - 1 - j])\n\t\t\t\tflag = 0;\n\t\tif (flag == 1)\n\t\t{\n\t\t\tchar num1[30] = {'\\0'};\n\t\t\ttransform(i, B, num1);\n\t\t\tprintf(\""%s\\n\"", str);\n\t\t}\n\t}\n\treturn 0;\n}\nvoid transform(int num, int B, char *str)\n{\n\tint i, k;\n\tfor (i = 0;(num / B) != 0;i++)\n\t{\n\t\tstr[i] = '0'+num % B;\n\t\tnum = num / B;\n\t}\n}",WRONG_ANSWER,27,296
1279800690417786880,d33dc28eb3741f96afbdd0719ab080d222cf8b03b3611d117ccbf5ee6da9a1f3,2020-07-05 23:33:56,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cstdio>\n#include<cstring>\n\nusing namespace std;\n\nint main()\n{\n    int A;\n    int N[200];\n    scanf(\""%d\"",&A);\n    for(int i=1;i<=300;i++)",COMPILE_ERROR,0,0
1279801083738644480,16228dd118ca28b2c17457d3030101e7c97f3b55984144a0fc54cf7654383981,2020-07-05 23:35:30,C,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n#include<string.h>\nint k;\nint main()\n{\n\tvoid transform(int num, int B, char *str);\n\tint B, i, j,len; \n\tchar str[15] = {'\\0'};\n\tscanf(\""%d\"", &B);\n\tfor (i = 1;i <= 300;i++)\n\t{\n\t\tint flag = 1;\n\t\ttransform(i*i, B, str);\n\t\tfor  (j = 0;j < k / 2;j++)\n\t\t\tif (str[j]!= str[k- 1 - j])\n\t\t\t\tflag = 0;\n\t\tif (flag == 1)\n\t\t{\n\t\t\tchar num1[30] = {'\\0'};\n\t\t\ttransform(i, B, num1);\n\t\t\tprintf(\""%s %s\\n\"", num1,str);\n\t\t}\n\t}\n\treturn 0;\n}\nvoid transform(int num, int B, char *str)\n{\n\tint i;\n    int str1[15];\n\tfor (i = 0;num>0;i++)\n\t{\n\t\tstr1[i] = '0'+num % B;\n\t\tnum = num / B;\n\t}\n    i--;\n    for (k=0; i>= 0; k++,i--)\n        str[k]=str1[i];\n}\n        \n",PARTIAL_ACCEPTED,24,384
1279801894464061440,d33dc28eb3741f96afbdd0719ab080d222cf8b03b3611d117ccbf5ee6da9a1f3,2020-07-05 23:38:43,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstdio>\n#include<cstring>\n#include<algorithm>\n\nusing namespace std;\n\nint main()\n{\n    int A;\n    int N[200];\n    scanf(\""%d\"",&A);\n    for(int i=1;i<=300;i++)\n    {\n        int B=i*i,C=0,D=0;\n        while(B)\n        {\n            N[++C]=B%A;\n            B=B/A;\n        }\n        for(int j=1;j<=C/2;j++)\n        {\n            if(N[j]!=N[C-j+1])\n            {\n                D=1;\n            }\n        }",COMPILE_ERROR,0,0
1279801928458887168,d33dc28eb3741f96afbdd0719ab080d222cf8b03b3611d117ccbf5ee6da9a1f3,2020-07-05 23:38:51,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstdio>\n#include<cstring>\n#include<algorithm>\n\nusing namespace std;\n\nint main()\n{\n    int A;\n    int N[200];\n    scanf(\""%d\"",&A);\n    for(int i=1;i<=300;i++)\n    {\n        int B=i*i,C=0,D=0;\n        while(B)\n        {\n            N[++C]=B%A;\n            B=B/A;\n        }\n        for(int j=1;j<=C/2;j++)\n        {\n            if(N[j]!=N[C-j+1])\n            {\n                D=1;\n            }\n        }",COMPILE_ERROR,0,0
1279802546531524608,16228dd118ca28b2c17457d3030101e7c97f3b55984144a0fc54cf7654383981,2020-07-05 23:41:19,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n#include<string.h>\nint k;\nint main()\n{\n\tvoid transform(int num, int B, char *str);\n\tint B, i, j,len; \n\tchar str[15] = {'\\0'};\n\tscanf(\""%d\"", &B);\n\tfor (i = 1;i <= 300;i++)\n\t{\n\t\tint flag = 1;\n\t\ttransform(i*i, B, str);\n\t\tfor  (j = 0;j < k / 2;j++)\n\t\t\tif (str[j]!= str[k- 1 - j])\n\t\t\t\tflag = 0;\n\t\tif (flag == 1)\n\t\t{\n\t\t\tchar num1[30] = {'\\0'};\n\t\t\ttransform(i, B, num1);\n\t\t\tprintf(\""%xh %s\\n\"", num1,str);\n\t\t}\n\t}\n\treturn 0;\n}\nvoid transform(int num, int B, char *str)\n{\n\tint i;\n    int str1[15];\n\tfor (i = 0;num>0;i++)\n\t{\n\t\tstr1[i] = '0'+num % B;\n\t\tnum = num / B;\n\t}\n    i--;\n    for (k=0; i>= 0; k++,i--)\n        str[k]=str1[i];\n}\n        \n",WRONG_ANSWER,24,432
1279802920566980608,16228dd118ca28b2c17457d3030101e7c97f3b55984144a0fc54cf7654383981,2020-07-05 23:42:48,C,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n#include<string.h>\nint k;\nint main()\n{\n\tvoid transform(int num, int B, char *str);\n\tint B, i, j,len; \n\tchar str[15] = {'\\0'};\n\tscanf(\""%d\"", &B);\n\tfor (i = 1;i <= 300;i++)\n\t{\n\t\tint flag = 1;\n\t\ttransform(i*i, B, str);\n\t\tfor  (j = 0;j < k / 2;j++)\n\t\t\tif (str[j]!= str[k- 1 - j])\n\t\t\t\tflag = 0;\n\t\tif (flag == 1)\n\t\t{\n\t\t\tchar num1[30] = {'\\0'};\n\t\t\ttransform(i, B, num1);\n\t\t\tprintf(\""%s %s\\n\"", num1,str);\n\t\t}\n\t}\n\treturn 0;\n}\nvoid transform(int num, int B, char *str)\n{\n\tint i;\n    int str1[15];\n\tfor (i = 0;num > 0;i++)\n\t{\n\t\tif (num%B >= 0 && num%B <= 9)\n\t\t{\n\t\t\tstr1[i] = '0' + num % B;\n\t\t\tnum = num / B;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tstr1[i] = '0' + num % B+7;\n\t\t\tnum = num / B;\n\t\t}\n\t}\n    i--;\n    for (k=0; i>= 0; k++,i--)\n        str[k]=str1[i];\n}\n        \n",ACCEPTED,23,384
1279803276130705408,16228dd118ca28b2c17457d3030101e7c97f3b55984144a0fc54cf7654383981,2020-07-05 23:44:13,C,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n#include<string.h>\nint k;\nint main()\n{\n\tvoid transform(int num, int B, char *str);\n\tint B, i, j,len; \n\tchar str[15] = {'\\0'};\n\tscanf(\""%d\"", &B);\n\tfor (i = 1;i <= 300;i++)\n\t{\n\t\tint flag = 1;\n\t\ttransform(i*i, B, str);\n\t\tfor  (j = 0;j < k / 2;j++)//判断回文\n\t\t\tif (str[j]!= str[k- 1 - j])\n\t\t\t\tflag = 0;\n\t\tif (flag == 1)\n\t\t{\n\t\t\tchar num1[30] = {'\\0'};\n\t\t\ttransform(i, B, num1);\n\t\t\tprintf(\""%s %s\\n\"", num1,str);\n\t\t}\n\t}\n\treturn 0;\n}\nvoid transform(int num, int B, char *str)//进制转换\n{\n\tint i;\n    int str1[15];\n\tfor (i = 0;num > 0;i++)\n\t{\n\t\tif (num%B >= 0 && num%B <= 9)\n\t\t{\n\t\t\tstr1[i] = '0' + num % B;\n\t\t\tnum = num / B;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tstr1[i] = '0' + num % B+7;//十六进制形式\n\t\t\tnum = num / B;\n\t\t}\n\t}\n    i--;\n    for (k=0; i>= 0; k++,i--)\n        str[k]=str1[i];\n}\n        \n",ACCEPTED,29,384
1279803786996932608,d33dc28eb3741f96afbdd0719ab080d222cf8b03b3611d117ccbf5ee6da9a1f3,2020-07-05 23:46:15,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstdio>\n#include<cstring>\n#include<algorithm>\n\nusing namespace std;\n\nint main()\n{\n    int A;\n    int N[200];\n    scanf(\""%d\"",&A);\n    for(int i=1;i<=300;i++)\n    {\n        int B=i*i,C=0,D=0;\n\n        while(B)\n        {\n            N[++C]=B%A;\n            B=B/A;\n        }\n\n        for(int j=1;j<=C/2;j++)\n        {\n            if(N[j]!=N[C-j+1])\n            {\n                D=1;\n            }\n        }\n\n        if(!D)\n        {\n            B=i;\n            C=0;\n\n            while(B)\n            {\n                N[++C]=B%A;B/=A;\n            }",COMPILE_ERROR,0,0
1279806868162011136,d33dc28eb3741f96afbdd0719ab080d222cf8b03b3611d117ccbf5ee6da9a1f3,2020-07-05 23:58:29,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstdio>\n#include<cstring>\n#include<algorithm>\n\nusing namespace std;\n\nint main()\n{\n    int A;\n    int N[200];\n    scanf(\""%d\"",&A);\n    for(int i=1;i<=300;i++)\n    {\n        int B=i*i,C=0,D=0;\n\n        while(B)\n        {\n            N[++C]=B%A;\n            B=B/A;\n        }\n\n        for(int j=1;j<=C/2;j++)\n        {\n            if(N[j]!=N[C-j+1])\n            {\n                D=1;\n            }\n        }\n\n        if(!D)\n        {\n            B=i;\n            C=0;\n\n            while(B)\n            {\n                N[++C]=B%A;B/=A;\n            }\n\n            for(int j=C;j>=1;j--)\n                if(N[j]<10)  cout<<N[j];\n                else  cout<<char(N[j]+55);\n            cout<<\"" \"";\n\n            B=i*i;\n            C=0;\n            while(B)\n            {\n                N[++C]=B%A;\n                B/=A;\n            }\n",COMPILE_ERROR,0,0
1279807409580589056,c5f006269b926e61241c8f09728f8ca99c23da829b64fc3aefb604777dcc38c7,2020-07-06 00:00:38,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nchar can[20];\nint transf(int yuan,int jinzhi);\nbool Ishui(int length);\nint main()\n{\n    int N,S;\n    int count = 0;\n    int counthui = 0;\n    cin >> N >> S;\n    for(int i = S+1;count < 3;i++)\n    {\n        for(int j = 2;j<=10;j++)\n        {\n            if(Ishui(transf(i,j))){counthui++;}\n        }\n        if(counthui>=2){cout << i << endl;counthui = 0;count++;}\n    }\n    return 0;\n}\nint transf(int yuan, int jinzhi)\n{\n    int length = 0;\n    while(yuan!=0)\n    {\n        can[length] = yuan%jinzhi;\n        yuan/=jinzhi;\n        length++;\n    }\n    return length;\n}\nbool Ishui(int length)\n{\n    for(int i = 0; i <= length/2; i++)\n    {\n        if(can[i]!=can[length-i-1]){return false;}\n    }\n    return true;\n}",WRONG_ANSWER,21,512
1279807765660221440,c5f006269b926e61241c8f09728f8ca99c23da829b64fc3aefb604777dcc38c7,2020-07-06 00:02:03,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nchar can[32];\nint transf(int yuan,int jinzhi);\nbool Ishui(int length);\nint main()\n{\n    int N,S;\n    int count = 0;\n    int counthui = 0;\n    cin >> N >> S;\n    for(int i = S+1;count < 3;i++)\n    {\n        for(int j = 2;j<=10;j++)\n        {\n            if(Ishui(transf(i,j))){counthui++;}\n        }\n        if(counthui>=2){cout << i << endl;counthui = 0;count++;}\n    }\n    return 0;\n}\nint transf(int yuan, int jinzhi)\n{\n    int length = 0;\n    while(yuan!=0)\n    {\n        can[length] = yuan%jinzhi;\n        yuan/=jinzhi;\n        length++;\n    }\n    return length;\n}\nbool Ishui(int length)\n{\n    for(int i = 0; i <= length/2; i++)\n    {\n        if(can[i]!=can[length-i-1]){return false;}\n    }\n    return true;\n}",WRONG_ANSWER,36,384
1279808511675908096,c5f006269b926e61241c8f09728f8ca99c23da829b64fc3aefb604777dcc38c7,2020-07-06 00:05:01,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nchar can[20];\nint transf(int yuan,int jinzhi);\nbool Ishui(int length);\nint main()\n{\n    int N,S;\n    int count = 0;\n    int counthui = 0;\n    cin >> N >> S;\n    for(int i = S+1;count < 3;i++)\n    {\n        for(int j = 2;j<=10;j++)\n        {\n            if(Ishui(transf(i,j))){counthui++;}\n        }\n        if(counthui>=2){cout << i << endl;counthui = 0;count++;}\n    }\n    return 0;\n}\nint transf(int yuan, int jinzhi)\n{\n    int length = 0;\n    while(yuan!=0)\n    {\n        can[length] = yuan%jinzhi+48;\n        yuan/=jinzhi;\n        length++;\n    }\n    return length;\n}\nbool Ishui(int length)\n{\n    for(int i = 0; i <= length/2; i++)\n    {\n        if(can[i]!=can[length-i-1]){return false;}\n    }\n    return true;\n}",WRONG_ANSWER,27,512
1279809249604976640,d33dc28eb3741f96afbdd0719ab080d222cf8b03b3611d117ccbf5ee6da9a1f3,2020-07-06 00:07:57,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstdio>\n#include<cstring>\n#include<algorithm>\n\nusing namespace std;\n\nint main()\n{\n    int A;\n    int N[200];\n    scanf(\""%d\"",&A);\n    for(int i=1;i<=300;i++)\n    {\n        int B=i*i,C=0,D=0;\n\n        while(B)\n        {\n            N[++C]=B%A;\n            B=B/A;\n        }\n\n        for(int j=1;j<=C/2;j++)\n        {\n            if(N[j]!=N[C-j+1])\n            {\n                D=1;\n            }\n        }\n\n        if(!D)\n        {\n            B=i;\n            C=0;\n\n            while(B)\n            {\n                N[++C]=B%A;B/=A;\n            }\n\n            for(int j=C;j>=1;j--)\n                if(N[j]<10)  cout<<N[j];\n                else  cout<<char(N[j]+55);\n            cout<<\"" \"";\n\n            B=i*i;\n            C=0;\n            while(B)\n            {\n                N[++C]=B%A;\n                B/=A;\n            }\n\n            for(int j=C;j>=1;j--)\n                if(N[j]<10)    cout<<N[j];\n                else cout<<char(N[j]+55);\n            cout<<endl;\n        }\n    }\n}\n",ACCEPTED,39,496
1279809537299644416,c5f006269b926e61241c8f09728f8ca99c23da829b64fc3aefb604777dcc38c7,2020-07-06 00:09:06,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"\n\nusing namespace std;\nchar buf[32];\n\nint transfer(int n,int b){\n    int w = 0;\n    while (n!=0)\n    {   \n        buf[w] = n % b + 48;\n        n /= b;\n        w++;\n    }\n    buf[w] = '\\0';\n    return w;\n}\n\nbool Palindrome(int n){\n    for (int i = 0; i <= n / 2;i++){\n        if(buf[i]!=buf[n-i-1]){\n            return false;\n        }\n    }\n    return true;\n}\n\nint main(){\n    int n, s, ans = 0;\n    cin >> n >> s;\n    for (int i = s + 1; ans < n;i++){\n        int c = 0;\n        for (int j = 2; j <= 10;j++){       //从2到10进制遍历回文可能\n            if(Palindrome(transfer(i,j))){\n                c++;                        //回文的进制数计数\n            }\n        }\n        if(c>=2){\n            cout << i << \""\\n\"";              //计数大于2就输出\n            ans++;\n        }\n    }\n}",COMPILE_ERROR,0,0
1279809727423242240,c5f006269b926e61241c8f09728f8ca99c23da829b64fc3aefb604777dcc38c7,2020-07-06 00:09:51,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n\nusing namespace std;\nchar buf[32];\n\nint transfer(int n,int b){\n    int w = 0;\n    while (n!=0)\n    {   \n        buf[w] = n % b + 48;\n        n /= b;\n        w++;\n    }\n    buf[w] = '\\0';\n    return w;\n}\n\nbool Palindrome(int n){\n    for (int i = 0; i <= n / 2;i++){\n        if(buf[i]!=buf[n-i-1]){\n            return false;\n        }\n    }\n    return true;\n}\n\nint main(){\n    int n, s, ans = 0;\n    cin >> n >> s;\n    for (int i = s + 1; ans < n;i++){\n        int c = 0;\n        for (int j = 2; j <= 10;j++){       //从2到10进制遍历回文可能\n            if(Palindrome(transfer(i,j))){\n                c++;                        //回文的进制数计数\n            }\n        }\n        if(c>=2){\n            cout << i << \""\\n\"";              //计数大于2就输出\n            ans++;\n        }\n    }\n}",ACCEPTED,39,400
1279809952024035328,c5f006269b926e61241c8f09728f8ca99c23da829b64fc3aefb604777dcc38c7,2020-07-06 00:10:44,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nchar can[20];\nint transf(int yuan,int jinzhi);\nbool Ishui(int length);\nint main()\n{\n    int N,S;\n    int count = 0;\n    int counthui = 0;\n    cin >> N >> S;\n    for(int i = S+1;count < 3;i++)\n    {\n        for(int j = 2;j<=10;j++)\n        {\n            if(Ishui(transf(i,j))){counthui++;}\n        }\n        if(counthui>=2){cout << i << endl;counthui = 0;count++;}\n    }\n    return 0;\n}\nint transf(int yuan, int jinzhi)\n{\n    int length = 0;\n    while(yuan!=0)\n    {\n        can[length] = yuan%jinzhi+48;\n        yuan/=jinzhi;\n        length++;\n    }\n    can[length] = '\\0';\n    return length;\n}\nbool Ishui(int length)\n{\n    for(int i = 0; i <= length/2; i++)\n    {\n        if(can[i]!=can[length-i-1]){return false;}\n    }\n    return true;\n}",WRONG_ANSWER,38,608
1279811090425241600,c5f006269b926e61241c8f09728f8ca99c23da829b64fc3aefb604777dcc38c7,2020-07-06 00:15:16,C++,20.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nchar can[20];\nint transf(int yuan,int jinzhi);\nbool Ishui(int length);\nint main()\n{\n    int N,S;\n    int count = 0;\n    int counthui = 0;\n    cin >> N >> S;\n    for(int i = S+1;count < N;i++)\n    {\n        for(int j = 2;j<=10;j++)\n        {\n            if(Ishui(transf(i,j))){counthui++;}\n        }\n        if(counthui>=2){cout << i << endl;counthui = 0;count++;}\n    }\n    return 0;\n}\nint transf(int yuan, int jinzhi)\n{\n    int length = 0;\n    while(yuan!=0)\n    {\n        can[length] = yuan%jinzhi+48;\n        yuan/=jinzhi;\n        length++;\n    }\n    can[length] = '\\0';\n    return length;\n}\nbool Ishui(int length)\n{\n    for(int i = 0; i <= length/2; i++)\n    {\n        if(can[i]!=can[length-i-1]){return false;}\n    }\n    return true;\n}",PARTIAL_ACCEPTED,32,512
1279812239081529344,c5f006269b926e61241c8f09728f8ca99c23da829b64fc3aefb604777dcc38c7,2020-07-06 00:19:50,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n\nusing namespace std;\nchar can[32];\n\nint transf(int yuan, int jinzhi)\n{\n    int length = 0;\n    while(yuan!=0)\n    {\n        can[length] = yuan%jinzhi+48;\n        yuan/=jinzhi;\n        length++;\n    }\n    can[length] = '\\0';\n    return length;\n}\n\nbool Palindrome(int n){\n    for (int i = 0; i <= n / 2;i++){\n        if(buf[i]!=buf[n-i-1]){\n            return false;\n        }\n    }\n    return true;\n}\n\nint main(){\n    int n, s, ans = 0;\n    cin >> n >> s;\n    for (int i = s + 1; ans < n;i++){\n        int c = 0;\n        for (int j = 2; j <= 10;j++){       //从2到10进制遍历回文可能\n            if(Palindrome(transf(i,j))){\n                c++;                        //回文的进制数计数\n            }\n        }\n        if(c>=2){\n            cout << i << \""\\n\"";              //计数大于2就输出\n            ans++;\n        }\n    }\n}",COMPILE_ERROR,0,0
1279812327787905024,c5f006269b926e61241c8f09728f8ca99c23da829b64fc3aefb604777dcc38c7,2020-07-06 00:20:11,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n\nusing namespace std;\nchar can[32];\n\nint transf(int yuan, int jinzhi)\n{\n    int length = 0;\n    while(yuan!=0)\n    {\n        can[length] = yuan%jinzhi+48;\n        yuan/=jinzhi;\n        length++;\n    }\n    can[length] = '\\0';\n    return length;\n}\n\nbool Palindrome(int n){\n    for (int i = 0; i <= n / 2;i++){\n        if(can[i]!=can[n-i-1]){\n            return false;\n        }\n    }\n    return true;\n}\n\nint main(){\n    int n, s, ans = 0;\n    cin >> n >> s;\n    for (int i = s + 1; ans < n;i++){\n        int c = 0;\n        for (int j = 2; j <= 10;j++){       //从2到10进制遍历回文可能\n            if(Palindrome(transf(i,j))){\n                c++;                        //回文的进制数计数\n            }\n        }\n        if(c>=2){\n            cout << i << \""\\n\"";              //计数大于2就输出\n            ans++;\n        }\n    }\n}",ACCEPTED,24,384
1279812445332242432,c5f006269b926e61241c8f09728f8ca99c23da829b64fc3aefb604777dcc38c7,2020-07-06 00:20:39,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n\nusing namespace std;\nchar can[32];\n\nint transf(int yuan, int jinzhi)\n{\n    int length = 0;\n    while(yuan!=0)\n    {\n        can[length] = yuan%jinzhi+48;\n        yuan/=jinzhi;\n        length++;\n    }\n    can[length] = '\\0';\n    return length;\n}\n\nbool Ishui(int length)\n{\n    for(int i = 0; i <= length/2; i++)\n    {\n        if(can[i]!=can[length-i-1]){return false;}\n    }\n    return true;\n}\nint main(){\n    int n, s, ans = 0;\n    cin >> n >> s;\n    for (int i = s + 1; ans < n;i++){\n        int c = 0;\n        for (int j = 2; j <= 10;j++){       //从2到10进制遍历回文可能\n            if(Ishui(transf(i,j))){\n                c++;                        //回文的进制数计数\n            }\n        }\n        if(c>=2){\n            cout << i << \""\\n\"";              //计数大于2就输出\n            ans++;\n        }\n    }\n}",ACCEPTED,17,588
1279812874745077760,c5f006269b926e61241c8f09728f8ca99c23da829b64fc3aefb604777dcc38c7,2020-07-06 00:22:21,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n\nusing namespace std;\nchar can[32];\n\nint transf(int yuan, int jinzhi)\n{\n    int length = 0;\n    while(yuan!=0)\n    {\n        can[length] = yuan%jinzhi+48;\n        yuan/=jinzhi;\n        length++;\n    }\n    can[length] = '\\0';\n    return length;\n}\n\nbool Ishui(int length)\n{\n    for(int i = 0; i <= length/2; i++)\n    {\n        if(can[i]!=can[length-i-1]){return false;}\n    }\n    return true;\n}\n\nint main(){\n    int N,S;\n    int count = 0;\n    cin >> N >> S;\n    for(int i = S+1;count < N;i++)\n    {\n        int counthui = 0;\n        for(int j = 2;j<=10;j++)\n        {\n            if(Ishui(transf(i,j))){counthui++;}\n        }\n        if(counthui>=2){cout << i << endl;count++;}\n    }\n    return 0;\n}",ACCEPTED,20,628
1279813042719604736,c5f006269b926e61241c8f09728f8ca99c23da829b64fc3aefb604777dcc38c7,2020-07-06 00:23:01,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nchar can[20];\nint transf(int yuan,int jinzhi);\nbool Ishui(int length);\nint main()\n{\n    int N,S;\n    int count = 0;\n    cin >> N >> S;\n    for(int i = S+1;count < N;i++)\n    {\n        int counthui = 0;\n        for(int j = 2;j<=10;j++)\n        {\n            if(Ishui(transf(i,j))){counthui++;}\n        }\n        if(counthui>=2){cout << i << endl;count++;}\n    }\n    return 0;\n}\nint transf(int yuan, int jinzhi)\n{\n    int length = 0;\n    while(yuan!=0)\n    {\n        can[length] = yuan%jinzhi+48;\n        yuan/=jinzhi;\n        length++;\n    }\n    can[length] = '\\0';\n    return length;\n}\nbool Ishui(int length)\n{\n    for(int i = 0; i <= length/2; i++)\n    {\n        if(can[i]!=can[length-i-1]){return false;}\n    }\n    return true;\n}",ACCEPTED,32,448
1279823662805344256,16228dd118ca28b2c17457d3030101e7c97f3b55984144a0fc54cf7654383981,2020-07-06 01:05:13,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<sdtio.h>\nint k;\nint main()\n{\n    int N,S;\n    int k=0,t=0;\n    for(int i=S+1;;i++)\n        for(int B=2;B<=10;B++)\n        {\n            int flag=1;\n            char str[100]={'\\0'};\n            transform(i,B,str);\n            for  (j = 0;j < k / 2;j++)//判断回文\n\t\t\tif (str[j]!= str[k- 1 - j])\n\t\t\t\tflag = 0;\n            if (flag == 1)\n            {\n                t++;\n                if(t==2) \n                {\n                    printf(\""%s\\n\"",str);\n                    k++;\n                    if(k==N) return 0;\n                }\n            }\n        }     \n}\n\nvoid transform(int num, int B, char *str)//进制转换\n{\n\tint i;\n    int str1[15];\n\tfor (i = 0;num > 0;i++)\n\t{\n\t\t\tstr1[i] = '0' + num % B;\n\t\t\tnum = num / B;\n\t}\n\ti--;\n    for (k=0; i>= 0; k++,i--)\n        str[k]=str1[i];\n}\n",COMPILE_ERROR,0,0
1279823737527910400,16228dd118ca28b2c17457d3030101e7c97f3b55984144a0fc54cf7654383981,2020-07-06 01:05:31,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<sdtio.h>\nint k;\nint main()\n{\n    int N,S;\n    int k=0,t=0;\n    for(int i=S+1;;i++)\n        for(int B=2;B<=10;B++)\n        {\n            int flag=1;\n            char str[100]={'\\0'};\n            transform(i,B,str);\n            for  (j = 0;j < k / 2;j++)//判断回文\n\t\t\tif (str[j]!= str[k- 1 - j])\n\t\t\t\tflag = 0;\n            if (flag == 1)\n            {\n                t++;\n                if(t==2) \n                {\n                    printf(\""%s\\n\"",str);\n                    k++;\n                    if(k==N) return 0;\n                }\n            }\n        }     \n}\n\nvoid transform(int num, int B, char *str)//进制转换\n{\n\tint i;\n    int str1[15];\n\tfor (i = 0;num > 0;i++)\n\t{\n\t\t\tstr1[i] = '0' + num % B;\n\t\t\tnum = num / B;\n\t}\n\ti--;\n    for (k=0; i>= 0; k++,i--)\n        str[k]=str1[i];\n}\n",COMPILE_ERROR,0,0
1279823779495084032,16228dd118ca28b2c17457d3030101e7c97f3b55984144a0fc54cf7654383981,2020-07-06 01:05:41,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<stdio.h>\nint k;\nint main()\n{\n    int N,S;\n    int k=0,t=0;\n    for(int i=S+1;;i++)\n        for(int B=2;B<=10;B++)\n        {\n            int flag=1;\n            char str[100]={'\\0'};\n            transform(i,B,str);\n            for  (j = 0;j < k / 2;j++)//判断回文\n\t\t\tif (str[j]!= str[k- 1 - j])\n\t\t\t\tflag = 0;\n            if (flag == 1)\n            {\n                t++;\n                if(t==2) \n                {\n                    printf(\""%s\\n\"",str);\n                    k++;\n                    if(k==N) return 0;\n                }\n            }\n        }     \n}\n\nvoid transform(int num, int B, char *str)//进制转换\n{\n\tint i;\n    int str1[15];\n\tfor (i = 0;num > 0;i++)\n\t{\n\t\t\tstr1[i] = '0' + num % B;\n\t\t\tnum = num / B;\n\t}\n\ti--;\n    for (k=0; i>= 0; k++,i--)\n        str[k]=str1[i];\n}\n",COMPILE_ERROR,0,0
1279823851326734336,16228dd118ca28b2c17457d3030101e7c97f3b55984144a0fc54cf7654383981,2020-07-06 01:05:58,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<stdio.h>\nint k;\nint main()\n{\n    void transform(int num, int B, char *str);\n    int N,S;\n    int k=0,t=0;\n    for(int i=S+1;;i++)\n        for(int B=2;B<=10;B++)\n        {\n            int flag=1;\n            char str[100]={'\\0'};\n            transform(i,B,str);\n            for  (j = 0;j < k / 2;j++)//判断回文\n\t\t\tif (str[j]!= str[k- 1 - j])\n\t\t\t\tflag = 0;\n            if (flag == 1)\n            {\n                t++;\n                if(t==2) \n                {\n                    printf(\""%s\\n\"",str);\n                    k++;\n                    if(k==N) return 0;\n                }\n            }\n        }     \n}\n\nvoid transform(int num, int B, char *str)//进制转换\n{\n\tint i;\n    int str1[15];\n\tfor (i = 0;num > 0;i++)\n\t{\n\t\t\tstr1[i] = '0' + num % B;\n\t\t\tnum = num / B;\n\t}\n\ti--;\n    for (k=0; i>= 0; k++,i--)\n        str[k]=str1[i];\n}\n",COMPILE_ERROR,0,0
1279823924223737856,16228dd118ca28b2c17457d3030101e7c97f3b55984144a0fc54cf7654383981,2020-07-06 01:06:16,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<stdio.h>\nint k;\nint main()\n{\n    void transform(int num, int B, char *str);\n    int N,S;\n    int k=0,t=0;\n    for(int i=S+1;;i++)\n        for(int B=2;B<=10;B++)\n        {\n            int flag=1,j;\n            char str[100]={'\\0'};\n            transform(i,B,str);\n            for  (j = 0;j < k / 2;j++)//判断回文\n\t\t\tif (str[j]!= str[k- 1 - j])\n\t\t\t\tflag = 0;\n            if (flag == 1)\n            {\n                t++;\n                if(t==2) \n                {\n                    printf(\""%s\\n\"",str);\n                    k++;\n                    if(k==N) return 0;\n                }\n            }\n        }     \n}\n\nvoid transform(int num, int B, char *str)//进制转换\n{\n\tint i;\n    int str1[15];\n\tfor (i = 0;num > 0;i++)\n\t{\n\t\t\tstr1[i] = '0' + num % B;\n\t\t\tnum = num / B;\n\t}\n\ti--;\n    for (k=0; i>= 0; k++,i--)\n        str[k]=str1[i];\n}\n",RUNTIME_ERROR,1638,428
1279824346490519552,16228dd118ca28b2c17457d3030101e7c97f3b55984144a0fc54cf7654383981,2020-07-06 01:07:56,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<stdio.h>\nint k;\nint main()\n{\n    void transform(int num, int B, char *str);\n    int N,S;\n    scanf(\""%d %d\"",&N,&S);\n    int k=0,t=0;\n    for(int i=S+1;;i++)\n        for(int B=2;B<=10;B++)\n        {\n            int flag=1,j;\n            char str[100]={'\\0'};\n            transform(i,B,str);\n            for  (j = 0;j < k / 2;j++)//判断回文\n\t\t\tif (str[j]!= str[k- 1 - j])\n\t\t\t\tflag = 0;\n            if (flag == 1)\n            {\n                t++;\n                if(t==2) \n                {\n                    printf(\""%s\\n\"",str);\n                    k++;\n                    if(k==N) return 0;\n                }\n            }\n        }     \n}\n\nvoid transform(int num, int B, char *str)//进制转换\n{\n\tint i;\n    int str1[15];\n\tfor (i = 0;num > 0;i++)\n\t{\n\t\t\tstr1[i] = '0' + num % B;\n\t\t\tnum = num / B;\n\t}\n\ti--;\n    for (k=0; i>= 0; k++,i--)\n        str[k]=str1[i];\n}\n",RUNTIME_ERROR,1426,372
1279824699847008256,16228dd118ca28b2c17457d3030101e7c97f3b55984144a0fc54cf7654383981,2020-07-06 01:09:21,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<stdio.h>\nint k;\nint main()\n{\n    void transform(int num, int B, char *str);\n    int N,S;\n    scanf(\""%d %d\"",&N,&S);\n    int k=0,t=0;\n    for(int i=S+1;;i++)\n        for(int B=2;B<=10;B++)\n        {\n            int flag=1,j;\n            char str[100]={'\\0'};\n            transform(i,B,str);\n            for  (j = 0;j < k / 2;j++)//判断回文\n\t\t\tif (str[j]!= str[k- 1 - j])\n\t\t\t\tflag = 0;\n            if (flag == 1)\n            {\n                t++;\n                if(t==2) \n                {\n                    printf(\""%s\\n\"",str);\n                    k++;\n                    if(k==N) return 0;\n                }\n            }\n        }     \n}\n\nvoid transform(int num, int B, char *str)//进制转换\n{\n\tint i;\n    int str1[100];\n\tfor (i = 0;num > 0;i++)\n\t{\n\t\t\tstr1[i] = '0' + num % B;\n\t\t\tnum = num / B;\n\t}\n\ti--;\n    for (k=0; i>= 0; k++,i--)\n        str[k]=str1[i];\n}\n",TIME_LIMIT_EXCEEDED,0,0
1279827392498941952,16228dd118ca28b2c17457d3030101e7c97f3b55984144a0fc54cf7654383981,2020-07-06 01:20:03,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"\n#include<stdio.h>\n\tint k;\n\tint main()\n\t{\n\t\tvoid transform(int num, int B, char *str);\n\t\tint N, S;\n\t\tscanf_s(\""%d %d\"", &N, &S);\n\t\tint l = 0, t = 0;\n\t\tfor (int i = S + 1;;i++)\n\t\t\tfor (int B = 2;B <= 10;B++)\n\t\t\t{\n\t\t\t\tint flag = 1, j;\n\t\t\t\tchar str[100] = { '\\0' };\n\t\t\t\ttransform(i, B, str);\n\t\t\t\tfor (j = 0;j < k / 2;j++)//判断回文\n\t\t\t\t\tif (str[j] != str[k - 1 - j])\n\t\t\t\t\t\tflag = 0;\n\t\t\t\tif (flag == 1)\n\t\t\t\t{\n\t\t\t\t\tt++;\n\t\t\t\t\tif (t == 2)\n\t\t\t\t\t{\n\t\t\t\t\t\tprintf(\""%s\\n\"", str);\n\t\t\t\t\t\tl++;\n\t\t\t\t\t\tif (l == N) return 0;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t}\n\n\tvoid transform(int num, int B, char *str)//进制转换\n\t{\n\t\tint i;\n\t\tint str1[100];\n\t\tfor (i = 0;num > 0;i++)\n\t\t{\n\t\t\tstr1[i] = '0' + num % B;\n\t\t\tnum = num / B;\n\t\t}\n\t\ti--;\n\t\tfor (k = 0; i >= 0; k++, i--)\n\t\t\tstr[k] = str1[i];\n\t}\n",COMPILE_ERROR,0,0
1279827438505230336,16228dd118ca28b2c17457d3030101e7c97f3b55984144a0fc54cf7654383981,2020-07-06 01:20:14,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"\n#include<stdio.h>\n\tint k;\n\tint main()\n\t{\n\t\tvoid transform(int num, int B, char *str);\n\t\tint N, S;\n\t\tscanf(\""%d %d\"", &N, &S);\n\t\tint l = 0, t = 0;\n\t\tfor (int i = S + 1;;i++)\n\t\t\tfor (int B = 2;B <= 10;B++)\n\t\t\t{\n\t\t\t\tint flag = 1, j;\n\t\t\t\tchar str[100] = { '\\0' };\n\t\t\t\ttransform(i, B, str);\n\t\t\t\tfor (j = 0;j < k / 2;j++)//判断回文\n\t\t\t\t\tif (str[j] != str[k - 1 - j])\n\t\t\t\t\t\tflag = 0;\n\t\t\t\tif (flag == 1)\n\t\t\t\t{\n\t\t\t\t\tt++;\n\t\t\t\t\tif (t == 2)\n\t\t\t\t\t{\n\t\t\t\t\t\tprintf(\""%s\\n\"", str);\n\t\t\t\t\t\tl++;\n\t\t\t\t\t\tif (l == N) return 0;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t}\n\n\tvoid transform(int num, int B, char *str)//进制转换\n\t{\n\t\tint i;\n\t\tint str1[100];\n\t\tfor (i = 0;num > 0;i++)\n\t\t{\n\t\t\tstr1[i] = '0' + num % B;\n\t\t\tnum = num / B;\n\t\t}\n\t\ti--;\n\t\tfor (k = 0; i >= 0; k++, i--)\n\t\t\tstr[k] = str1[i];\n\t}\n",TIME_LIMIT_EXCEEDED,0,0
1279829602434736128,16228dd118ca28b2c17457d3030101e7c97f3b55984144a0fc54cf7654383981,2020-07-06 01:28:49,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<stdio.h>\n\tint k;\nvoid transform(int num, int B, char *str);\nint shuangchong(int n);\n\tint main()\n\t{\n\t\tvoid transform(int num, int B, char *str);\n\t\tint N, S;\n\t\tscanf(\""%d %d\"", &N, &S);\n\t\tint l = 0, t = 0;\n\t\tfor (int i = S + 1;;i++)\n\t\t{\n\t\t\tif(shuangchong(i))\n            {\n                printf(\""%d\"",i);\n                l++;\n                if(l==N) return 0;\n            }\n        }\n    }\n\nvoid transform(int num, int B, char *str)//进制转换\n{\n\tint i;\n\tint str1[100];\n\tfor (i = 0;num > 0;i++)\n\t{\n\t\tstr1[i] = '0' + num % B;\n\t\tnum = num / B;\n\t}\n\ti--;\n\tfor (k = 0; i >= 0; k++, i--)\n\t\tstr[k] = str1[i];\n}\nint huiwen(char *str)\n{\n\tfor (j = 0;j < k / 2;j++)//判断回文\n\t\tif (str[j] != str[k - 1 - j])\n\t\t\tflag = 0;\n\tif (flag == 1)\n\t\treturn 1;\n\treturn 0;\n}\nint shuangchong(int n)\n{\n    int t=0;\n    for(i=10;i>=2;i--)\n    {\n        if(transform(n,i,str))\n            t++;\n        if(t==2)\n            return 1;\n        return 0;\n}\n    ",COMPILE_ERROR,0,0
1279829756197920768,16228dd118ca28b2c17457d3030101e7c97f3b55984144a0fc54cf7654383981,2020-07-06 01:29:26,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<stdio.h>\nint k;\nvoid transform(int num, int B, char *str);\nint shuangchong(int n);\n\tint main()\n\t{\n\t\tvoid transform(int num, int B, char *str);\n\t\tint N, S;\n\t\tscanf(\""%d %d\"", &N, &S);\n\t\tint l = 0;\n\t\tfor (int i = S + 1;;i++)\n\t\t{\n\t\t\tif(shuangchong(i))\n            {\n                printf(\""%d\"",i);\n                l++;\n                if(l==N) return 0;\n            }\n        }\n    }\n\nvoid transform(int num, int B, char *str)//进制转换\n{\n\tint i;\n\tint str1[100];\n\tfor (i = 0;num > 0;i++)\n\t{\n\t\tstr1[i] = '0' + num % B;\n\t\tnum = num / B;\n\t}\n\ti--;\n\tfor (k = 0; i >= 0; k++, i--)\n\t\tstr[k] = str1[i];\n}\nint huiwen(char *str)\n{\n\tfor (int j = 0;j < k / 2;j++)//判断回文\n\t\tif (str[j] != str[k - 1 - j])\n\t\t\tflag = 0;\n\tif (flag == 1)\n\t\treturn 1;\n\treturn 0;\n}\nint shuangchong(int n)\n{\n    int t=0;\n    for(i=10;i>=2;i--)\n    {\n        if(transform(n,i,str))\n            t++;\n        if(t==2)\n            return 1;\n        return 0;\n}\n    ",COMPILE_ERROR,0,0
1279829848767250432,16228dd118ca28b2c17457d3030101e7c97f3b55984144a0fc54cf7654383981,2020-07-06 01:29:48,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<stdio.h>\nint k;\nvoid transform(int num, int B, char *str);\nint shuangchong(int n);\n\tint main()\n\t{\n\t\tvoid transform(int num, int B, char *str);\n\t\tint N, S;\n\t\tscanf(\""%d %d\"", &N, &S);\n\t\tint l = 0;\n\t\tfor (int i = S + 1;;i++)\n\t\t{\n\t\t\tif(shuangchong(i))\n            {\n                printf(\""%d\"",i);\n                l++;\n                if(l==N) return 0;\n            }\n        }\n    }\n\nvoid transform(int num, int B, char *str)//进制转换\n{\n\tint i;\n\tint str1[100];\n\tfor (i = 0;num > 0;i++)\n\t{\n\t\tstr1[i] = '0' + num % B;\n\t\tnum = num / B;\n\t}\n\ti--;\n\tfor (k = 0; i >= 0; k++, i--)\n\t\tstr[k] = str1[i];\n}\nint huiwen(char *str)//判断回文\n{\n    int flag=1;\n\tfor (int j = 0;j < k / 2;j++)\n\t\tif (str[j] != str[k - 1 - j])\n\t\t\tflag = 0;\n\tif (flag == 1)\n\t\treturn 1;\n\treturn 0;\n}\nint shuangchong(int n)\n{\n    int t=0;\n    for(i=10;i>=2;i--)\n    {\n        if(transform(n,i,str))\n            t++;\n        if(t==2)\n            return 1;\n        return 0;\n}\n    ",COMPILE_ERROR,0,0
1279829921277345792,16228dd118ca28b2c17457d3030101e7c97f3b55984144a0fc54cf7654383981,2020-07-06 01:30:05,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<stdio.h>\nint k;\nvoid transform(int num, int B, char *str);\nint shuangchong(int n);\n\tint main()\n\t{\n\t\tvoid transform(int num, int B, char *str);\n\t\tint N, S;\n\t\tscanf(\""%d %d\"", &N, &S);\n\t\tint l = 0;\n\t\tfor (int i = S + 1;;i++)\n\t\t{\n\t\t\tif(shuangchong(i))\n            {\n                printf(\""%d\"",i);\n                l++;\n                if(l==N) return 0;\n            }\n        }\n    }\n\nvoid transform(int num, int B, char *str)//进制转换\n{\n\tint i;\n\tint str1[100];\n\tfor (i = 0;num > 0;i++)\n\t{\n\t\tstr1[i] = '0' + num % B;\n\t\tnum = num / B;\n\t}\n\ti--;\n\tfor (k = 0; i >= 0; k++, i--)\n\t\tstr[k] = str1[i];\n}\nint huiwen(char *str)//判断回文\n{\n    int flag=1;\n\tfor (int j = 0;j < k / 2;j++)\n\t\tif (str[j] != str[k - 1 - j])\n\t\t\tflag = 0;\n\tif (flag == 1)\n\t\treturn 1;\n\treturn 0;\n}\nint shuangchong(int n)\n{\n    int t=0,i;\n    for(i=10;i>=2;i--)\n    {\n        if(transform(n,i,str))\n            t++;\n        if(t==2)\n            return 1;\n        return 0;\n}\n    ",COMPILE_ERROR,0,0
1279830160457531392,16228dd118ca28b2c17457d3030101e7c97f3b55984144a0fc54cf7654383981,2020-07-06 01:31:03,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<stdio.h>\nint k;\nchar str[100]={'\\0'};\nvoid transform(int num, int B, char *str);\nint shuangchong(int n);\n\tint main()\n\t{\n\t\tvoid transform(int num, int B, char *str);\n\t\tint N, S;\n\t\tscanf(\""%d %d\"", &N, &S);\n\t\tint l = 0;\n\t\tfor (int i = S + 1;;i++)\n\t\t{\n\t\t\tif(shuangchong(i))\n            {\n                printf(\""%d\"",i);\n                l++;\n                if(l==N) return 0;\n            }\n        }\n    }\n\nvoid transform(int num, int B, char *str)//进制转换\n{\n\tint i;\n\tint str1[100];\n\tfor (i = 0;num > 0;i++)\n\t{\n\t\tstr1[i] = '0' + num % B;\n\t\tnum = num / B;\n\t}\n\ti--;\n\tfor (k = 0; i >= 0; k++, i--)\n\t\tstr[k] = str1[i];\n}\nint huiwen(char *str)//判断回文\n{\n    int flag=1;\n\tfor (int j = 0;j < k / 2;j++)\n\t\tif (str[j] != str[k - 1 - j])\n\t\t\tflag = 0;\n\tif (flag == 1)\n\t\treturn 1;\n\treturn 0;\n}\nint shuangchong(int n)\n{\n    int t=0,i;\n    for(i=10;i>=2;i--)\n    {\n        if(transform(n,i,str))\n            t++;\n        if(t==2)\n            return 1;\n        return 0;\n}\n    ",COMPILE_ERROR,0,0
1279830313819095040,16228dd118ca28b2c17457d3030101e7c97f3b55984144a0fc54cf7654383981,2020-07-06 01:31:39,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<stdio.h>\nint k;\nchar str[100]={'\\0'};\nvoid transform(int num, int B, char *str);\nint shuangchong(int n);\n\tint main()\n\t{\n\t\tvoid transform(int num, int B, char *str);\n\t\tint N, S;\n\t\tscanf(\""%d %d\"", &N, &S);\n\t\tint l = 0;\n\t\tfor (int i = S + 1;;i++)\n\t\t{\n\t\t\tif(shuangchong(i))\n            {\n                printf(\""%d\"",i);\n                l++;\n                if(l==N) return 0;\n            }\n        }\n    }\n\nvoid transform(int num, int B, char *str)//进制转换\n{\n\tint i;\n\tint str1[100];\n\tfor (i = 0;num > 0;i++)\n\t{\n\t\tstr1[i] = '0' + num % B;\n\t\tnum = num / B;\n\t}\n\ti--;\n\tfor (k = 0; i >= 0; k++, i--)\n\t\tstr[k] = str1[i];\n}\nint huiwen(char *str)//判断回文\n{\n    int flag=1;\n\tfor (int j = 0;j < k / 2;j++)\n\t\tif (str[j] != str[k - 1 - j])\n\t\t\tflag = 0;\n\tif (flag == 1)\n\t\treturn 1;\n\treturn 0;\n}\nint shuangchong(int n)\n{\n    int t=0,i;\n    for(i=10;i>=2;i--)\n    {\n        transform(n,i,str);\n        if(huiwen(str))\n            t++;\n        if(t==2)\n            return 1;\n        return 0;\n}\n    ",COMPILE_ERROR,0,0
1279830401043841024,16228dd118ca28b2c17457d3030101e7c97f3b55984144a0fc54cf7654383981,2020-07-06 01:32:00,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<stdio.h>\nint k;\nchar str[100]={'\\0'};\nvoid transform(int num, int B, char *str);\nint shuangchong(int n);\n\tint main()\n\t{\n\t\tvoid transform(int num, int B, char *str);\n\t\tint N, S;\n\t\tscanf(\""%d %d\"", &N, &S);\n\t\tint l = 0;\n\t\tfor (int i = S + 1;;i++)\n\t\t{\n\t\t\tif(shuangchong(i))\n            {\n                printf(\""%d\"",i);\n                l++;\n                if(l==N) return 0;\n            }\n        }\n    }\n\nvoid transform(int num, int B, char *str)//进制转换\n{\n\tint i;\n\tint str1[100];\n\tfor (i = 0;num > 0;i++)\n\t{\n\t\tstr1[i] = '0' + num % B;\n\t\tnum = num / B;\n\t}\n\ti--;\n\tfor (k = 0; i >= 0; k++, i--)\n\t\tstr[k] = str1[i];\n}\nint huiwen(char *str)//判断回文\n{\n    int flag=1;\n\tfor (int j = 0;j < k / 2;j++)\n\t\tif (str[j] != str[k - 1 - j])\n\t\t\tflag = 0;\n\tif (flag == 1)\n\t\treturn 1;\n\treturn 0;\n}\nint shuangchong(int n)\n{\n    int t=0,i;\n    for(i=10;i>=2;i--)\n    {\n        transform(n,i,str);\n        if(huiwen(str))\n            t++;\n        if(t==2)\n            return 1;\n    }\n        return 0;\n}\n    ",PRESENTATION_ERROR,30,384
1279830498729181184,16228dd118ca28b2c17457d3030101e7c97f3b55984144a0fc54cf7654383981,2020-07-06 01:32:23,C,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<stdio.h>\nint k;\nchar str[100]={'\\0'};\nvoid transform(int num, int B, char *str);\nint shuangchong(int n);\n\tint main()\n\t{\n\t\tvoid transform(int num, int B, char *str);\n\t\tint N, S;\n\t\tscanf(\""%d %d\"", &N, &S);\n\t\tint l = 0;\n\t\tfor (int i = S + 1;;i++)\n\t\t{\n\t\t\tif(shuangchong(i))\n            {\n                printf(\""%d\\n\"",i);\n                l++;\n                if(l==N) \n                    return 0;\n            }\n        }\n    }\n\nvoid transform(int num, int B, char *str)//进制转换\n{\n\tint i;\n\tint str1[100];\n\tfor (i = 0;num > 0;i++)\n\t{\n\t\tstr1[i] = '0' + num % B;\n\t\tnum = num / B;\n\t}\n\ti--;\n\tfor (k = 0; i >= 0; k++, i--)\n\t\tstr[k] = str1[i];\n}\nint huiwen(char *str)//判断回文\n{\n    int flag=1;\n\tfor (int j = 0;j < k / 2;j++)\n\t\tif (str[j] != str[k - 1 - j])\n\t\t\tflag = 0;\n\tif (flag == 1)\n\t\treturn 1;\n\treturn 0;\n}\nint shuangchong(int n)\n{\n    int t=0,i;\n    for(i=10;i>=2;i--)\n    {\n        transform(n,i,str);\n        if(huiwen(str))\n            t++;\n        if(t==2)\n            return 1;\n    }\n        return 0;\n}\n    ",ACCEPTED,28,384
1279877406411636736,707929b69b5212b734ed1a1ff6179d3aa39ed592ca11454db07c23c4bd35c2b0,2020-07-06 04:38:47,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nint judge(int s)\n{\n    int ans=0;\n    \n    \n    for(int i=2;i<=10;i++)\n    {\n        if(ans==2) break;\n        int S=s,j=0;\n        stringstream t;\n        string s;\n        long long x=0;\n        while(S)\n        {\n            x+=(S%i)*pow(10,j);\n            S/=i;\n            j++;\n        }\n        \n        t<<x;\n        t>>s;\n        int size=s.size(),l=0;\n        while(s[l]==s[size-1-l] && l<=(size-1)/2)\n        {\n            l++;\n        }\n        l--;\n        if(l==(size-1)/2) ans++;\n    }\n    return ans;\n}\nint main()\n{\n    int n,s,num=0;\n    cin>>n>>s;\n    while(num<n)\n    {\n        s++;\n        if(judge(s)==2) \n        {\n            cout<<s<<endl;\n            num++;\n        }\n    }\n    return 0;\n}",ACCEPTED,72,492
1279945244929343488,c5f006269b926e61241c8f09728f8ca99c23da829b64fc3aefb604777dcc38c7,2020-07-06 09:08:21,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nchar can[20];\nint transf(int yuan, int jinzhi)\n{\n    int length = 0;\n    int weishu;\n    while(yuan!=0)\n    {\n        weishu = yuan%jinzhi;\n        if(weishu>=10){can[length]=weishu+55;}\n        else{can[length] = weishu+48;}\n        yuan/=jinzhi;\n        length++;\n    }\n    can[length] = '\\0';\n    return length;\n}\nbool Ishui(int length)\n{\n    for(int i = 0;i<=length/2;i++)\n    {\n        if(can[i]!=can[length-i-1]){return false;}\n    }\n    return true;\n}\nint main()\n{\n    int B;\n    cin >> B;\n    int pingfang;\n    for(int i =1;i<=300;i++)\n    {\n        pingfang = i*i;\n        if(Ishui(transf(pingfang,B)))\n        {\n            for(int j=transf(i,B)-1;j>=0;j--)\n            {\n                cout << can[j];\n            }\n            cout << \"" \"";\n            for(int j=transf(pingfang,B)-1;j>=0;j--)\n            {\n                cout << can[j];\n            }\n            cout << endl;\n        }\n    }\n    return 0;\n}",ACCEPTED,39,520
1279966392642625536,16228dd118ca28b2c17457d3030101e7c97f3b55984144a0fc54cf7654383981,2020-07-06 10:32:23,C,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<stdio.h>\nint k;\nchar str[100]={'\\0'};\nvoid transform(int num, int B, char *str);\nint shuangchong(int n);\n\tint main()\n\t{\n\t\tvoid transform(int num, int B, char *str);\n\t\tint N, S;\n\t\tscanf(\""%d %d\"", &N, &S);\n\t\tint l = 0;\n\t\tfor (int i = S + 1;;i++)\n\t\t{\n\t\t\tif(shuangchong(i))\n            {\n                printf(\""%d\\n\"",i);\n                l++;\n                if(l==N) \n                    return 0;\n            }\n        }\n    }\n\nvoid transform(int num, int B, char *str)//进制转换\n{\n\tint i;\n\tchar str1[100];\n\tfor (i = 0;num > 0;i++)\n\t{\n\t\tstr1[i] = '0' + num % B;\n\t\tnum = num / B;\n\t}\n\ti--;\n\tfor (k = 0; i >= 0; k++, i--)\n\t\tstr[k] = str1[i];\n}\nint huiwen(char *str)//判断回文\n{\n    int flag=1;\n\tfor (int j = 0;j < k / 2;j++)\n\t\tif (str[j] != str[k - 1 - j])\n\t\t\tflag = 0;\n\tif (flag == 1)\n\t\treturn 1;\n\treturn 0;\n}\nint shuangchong(int n)\n{\n    int t=0,i;\n    for(i=10;i>=2;i--)\n    {\n        transform(n,i,str);\n        if(huiwen(str))\n            t++;\n        if(t==2)\n            return 1;\n    }\n        return 0;\n}\n    ",ACCEPTED,31,416
1279973020083355648,b05d9f4f8ae94e871d055cf9cc40d00027e969fe8ebc83bb7ae29282cc9efd75,2020-07-06 10:58:43,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"//\n//  main.cpp\n//  test\n//\n//  Created by tanghuaxin on 2020/7/4.\n//  Copyright © 2020 tanghuaxin. All rights reserved.\n//\n\n#include <iostream>\n#include<string>\n#include<cstring>\n#include <algorithm>\n\nusing namespace std;\n\nbool jud(string a){\n    int len=a.length(),flag=1;\n    for(int i=0;i<len/2;i++){\n        if(a[i]!=a[len-i-1]||a[i]==0){\n            flag=0;\n            break;\n        }\n    }\n    if(flag==1){\n        return true;\n    }\n    else{\n        return false;\n    }\n}\n\nstring tra(int n,int b){\n    string ans=\""\"";\n    do{\n        int t=n%b;\n    if(t>=0&&t<=9){\n        ans+=t+'0';\n        \n    }\n    else{\n        ans+=t-10+'A';\n    }\n        n/=b;}while(n!=0);\n    reverse(ans.begin(),ans.end() );\n    return ans;\n    \n}\n\n\n\n\n\nint main(int argc, const char * argv[]) {\n    // insert code here...\n    int n,s,co1=0,co2=0;\n    cin>>n;\n    cin>>s;\n    for(int i=s+1;i<10000;i++){\n        for(int j=2;j<11;j++){\n            if(jud(tra(i,j))){\n                \n                co1++;\n            }\n        }\n        if(co1>=3){\n            cout<<i<<endl;\n            co2++;\n        }\n        if(co2==n){\n            break;\n        }\n    }\n    \n    \n    return 0;\n}\n",PARTIAL_ACCEPTED,24,512
1279973209636528128,b05d9f4f8ae94e871d055cf9cc40d00027e969fe8ebc83bb7ae29282cc9efd75,2020-07-06 10:59:28,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"//\n//  main.cpp\n//  test\n//\n//  Created by tanghuaxin on 2020/7/4.\n//  Copyright © 2020 tanghuaxin. All rights reserved.\n//\n\n#include <iostream>\n#include<string>\n#include<cstring>\n#include <algorithm>\n\nusing namespace std;\n\nbool jud(string a){\n    int len=a.length(),flag=1;\n    for(int i=0;i<len/2;i++){\n        if(a[i]!=a[len-i-1]||a[i]==0){\n            flag=0;\n            break;\n        }\n    }\n    if(flag==1){\n        return true;\n    }\n    else{\n        return false;\n    }\n}\n\nstring tra(int n,int b){\n    string ans=\""\"";\n    do{\n        int t=n%b;\n    if(t>=0&&t<=9){\n        ans+=t+'0';\n        \n    }\n    else{\n        ans+=t-10+'A';\n    }\n        n/=b;}while(n!=0);\n    reverse(ans.begin(),ans.end() );\n    return ans;\n    \n}\n\n\n\n\n\nint main(int argc, const char * argv[]) {\n    // insert code here...\n    int n,s,co1=0,co2=0;\n    cin>>n;\n    cin>>s;\n    for(int i=s;i<10000;i++){\n        for(int j=2;j<11;j++){\n            if(jud(tra(i,j))){\n                \n                co1++;\n            }\n        }\n        if(co1>=3){\n            cout<<i<<endl;\n            co2++;\n        }\n        if(co2==n){\n            break;\n        }\n    }\n    \n    \n    return 0;\n}\n",WRONG_ANSWER,33,384
1279973351707033600,b05d9f4f8ae94e871d055cf9cc40d00027e969fe8ebc83bb7ae29282cc9efd75,2020-07-06 11:00:02,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"//\n//  main.cpp\n//  test\n//\n//  Created by tanghuaxin on 2020/7/4.\n//  Copyright © 2020 tanghuaxin. All rights reserved.\n//\n\n#include <iostream>\n#include<string>\n#include<cstring>\n#include <algorithm>\n\nusing namespace std;\n\nbool jud(string a){\n    int len=a.length(),flag=1;\n    for(int i=0;i<len/2;i++){\n        if(a[i]!=a[len-i-1]||a[i]==0){\n            flag=0;\n            break;\n        }\n    }\n    if(flag==1){\n        return true;\n    }\n    else{\n        return false;\n    }\n}\n\nstring tra(int n,int b){\n    string ans=\""\"";\n    do{\n        int t=n%b;\n    if(t>=0&&t<=9){\n        ans+=t+'0';\n        \n    }\n    else{\n        ans+=t-10+'A';\n    }\n        n/=b;}while(n!=0);\n    reverse(ans.begin(),ans.end() );\n    return ans;\n    \n}\n\n\n\n\n\nint main(int argc, const char * argv[]) {\n    // insert code here...\n    int n,s,co1=0,co2=0;\n    cin>>n;\n    cin>>s;\n    for(int i=s+1;i<10000;i++){\n        for(int j=2;j<11;j++){\n            if(jud(tra(i,j))){\n                \n                co1++;\n            }\n        }\n        if(co1>=3){\n            cout<<i-1<<endl;\n            co2++;\n        }\n        if(co2==n){\n            break;\n        }\n    }\n    \n    \n    return 0;\n}\n",WRONG_ANSWER,40,512
1279973790665072640,518d926b426c39a8d73fcdfcc6b08b5c49cb5f95ff8ef1884606c5f32c6d333b,2020-07-06 11:01:47,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint jie(int i,int b){\n    int num;int temp;char c[100];char e[100];\n    int o=0;\n    num=i*i;\n    temp=i;\n    int t;\n    char a[21]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J','K'};\n    while(num)\n    {\n    t=num%b;\n    c[o]=a[t];\n    t=num/b;\n    o++;\n    num=t;\n    }\n    int p=0;\n    for(int t=0;t<o;t++){\n    if(c[t]==c[o-t-1]){p++;}}\n    if(p==o){\n    p=0;\n    while(temp){\n        t=temp%b;\n        e[p]=a[t];\n        temp=temp/b;\n        p++;}\n    for(int t=p-1;t>=0;t--){cout<<e[t];}\n    cout<<\"" \"";\n    for(int t=0;t<o;t++){cout<<c[t];}\n    cout<<endl;\n    }}\n\nint main()\n{\nint a;\ncin>>a;\nfor (int i=1;i<=300;i++){\n    jie(i,a);\n}\nreturn 0;\n}\n\n\n",ACCEPTED,40,488
1279974413749903360,b05d9f4f8ae94e871d055cf9cc40d00027e969fe8ebc83bb7ae29282cc9efd75,2020-07-06 11:04:15,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"//\n//  main.cpp\n//  test\n//\n//  Created by tanghuaxin on 2020/7/4.\n//  Copyright © 2020 tanghuaxin. All rights reserved.\n//\n\n#include <iostream>\n#include<string>\n#include<cstring>\n#include <algorithm>\n\nusing namespace std;\n\nbool jud(string a){\n    int len=a.length(),flag=1;\n    for(int i=0;i<len/2;i++){\n        if(a[i]!=a[len-i-1]||a[0]==0){\n            flag=0;\n            break;\n        }\n    }\n    if(flag==1){\n        return true;\n    }\n    else{\n        return false;\n    }\n}\n\nstring tra(int n,int b){\n    string ans=\""\"";\n    do{\n        int t=n%b;\n    if(t>=0&&t<=9){\n        ans+=t+'0';\n        \n    }\n    else{\n        ans+=t-10+'A';\n    }\n        n/=b;}while(n!=0);\n    reverse(ans.begin(),ans.end() );\n    return ans;\n    \n}\n\n\n\n\n\nint main(int argc, const char * argv[]) {\n    // insert code here...\n    int n,s,co1=0,co2=0;\n    cin>>n;\n    cin>>s;\n    for(int i=s+1;i<10000;i++){\n        for(int j=2;j<11;j++){\n            if(jud(tra(i,j))){\n                \n                co1++;\n            }\n        }\n        if(co1>=3){\n            cout<<i<<endl;\n            co2++;\n        }\n        if(co2==n){\n            break;\n        }\n    }\n    \n    \n    return 0;\n}\n",PARTIAL_ACCEPTED,42,512
1279982469527306240,b05d9f4f8ae94e871d055cf9cc40d00027e969fe8ebc83bb7ae29282cc9efd75,2020-07-06 11:36:16,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"//\n//  main.cpp\n//  test\n//\n//  Created by tanghuaxin on 2020/7/4.\n//  Copyright ? 2020 tanghuaxin. All rights reserved.\n//\n\n#include <iostream>\n#include<string>\n#include<cstring>\n#include <algorithm>\n\nusing namespace std;\n\nbool jud(string a){\n    int len=a.length(),flag=1;\n    for(int i=0;i<len/2;i++){\n        if(a[i]!=a[len-i-1]||a[0]==0){\n            flag=0;\n            break;\n        }\n    }\n    if(flag==1){\n        return true;\n    }\n    else{\n        return false;\n    }\n}\n\nstring tra(int n,int b){\n    string ans=\""\"";\n    do{\n        int t=n%b;\n    if(t>=0&&t<=9){\n        ans+=t+'0';\n        \n    }\n    else{\n        ans+=t-10+'A';\n    }\n        n/=b;}while(n!=0);\n    reverse(ans.begin(),ans.end() );\n    return ans;\n    \n}\n\n\n\n\n\nint main(int argc, const char * argv[]) {\n    // insert code here...\n    int n,s,co1=0,co2=0;\n    cin>>n;\n    cin>>s;\n    for(int i=s+1;i<10000;i++){\n        for(int j=2;j<11;j++){\n            if(jud(tra(i,j))){\n                \n                co1++;\n            }\n        }\n        if(co1>=2){\n            cout<<i<<endl;\n            co2++;\n        }\n        if(co2==n){\n            break;\n        }\n    }\n    \n    \n    return 0;\n}\n",WRONG_ANSWER,30,424
1279982604962414592,b05d9f4f8ae94e871d055cf9cc40d00027e969fe8ebc83bb7ae29282cc9efd75,2020-07-06 11:36:48,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"//\n//  main.cpp\n//  test\n//\n//  Created by tanghuaxin on 2020/7/4.\n//  Copyright ? 2020 tanghuaxin. All rights reserved.\n//\n\n#include <iostream>\n#include<string>\n#include<cstring>\n#include <algorithm>\n\nusing namespace std;\n\nbool jud(string a){\n    int len=a.length(),flag=1;\n    for(int i=0;i<len/2;i++){\n        if(a[i]!=a[len-i-1]||a[0]==0){\n            flag=0;\n            break;\n        }\n    }\n    if(flag==1){\n        return true;\n    }\n    else{\n        return false;\n    }\n}\n\nstring tra(int n,int b){\n    string ans=\""\"";\n    do{\n        int t=n%b;\n    if(t>=0&&t<=9){\n        ans+=t+'0';\n        \n    }\n    else{\n        ans+=t-10+'A';\n    }\n        n/=b;}while(n!=0);\n    reverse(ans.begin(),ans.end() );\n    return ans;\n    \n}\n\n\n\n\n\nint main(int argc, const char * argv[]) {\n    // insert code here...\n    int n,s,co1=0,co2=0;\n    cin>>n;\n    cin>>s;\n    for(int i=s+1;i<10000;i++){\n        for(int j=2;j<11;j++){\n            if(jud(tra(i,j))){\n                \n                co1++;\n            }\n        }\n        if(co1>=4){\n            cout<<i<<endl;\n            co2++;\n        }\n        if(co2==n){\n            break;\n        }\n    }\n    \n    \n    return 0;\n}\n",WRONG_ANSWER,36,508
1279984096942415872,22bc41363ee5ce2db2edc4a0bb731769cc4b7261d5eae6b29c2cf336a68cd60b,2020-07-06 11:42:44,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"//input 输入N：前N个数  输入S：大于S\n//\n//int N, S\n//char num[8]={'0','1''2''3''4''5''6''7'}\n//\n//bool judge两个以上进制下回文(int i)\n//\tint count\n//\tfor(B=2; B<=8; B++){\n//\t\tif（判断B下是不是回文数 (B, i)） count++\n//\t\tif(count>2) return true;\n//\t}\n//\treturn false\n//\t\n//bool 判断i在B下是不是回文数（int B, int i){\n//\tchar temp[MAX_N];\n//\tint j=0\n//\tbool sign= true;\n//\twhile(i>=B){\n//\t\tint left= i%B\n//\t\ttemp[j]= num[left]\n//\t\ti= i/B;\n//\t\tj++;\n//\t} \n//\t最后一项  temp[j]= num[i] j++\n//\t\n//\t判断回文\n//\tfor(int k=0)````\n//\t\tif(!=) sign= false break;\n//\t\t\n//\treturn sign\n//} \n//\t\n//\t\n//\n//int main(){\n//\t输入\n//\tint cNUM=0\n//\tfor(int i=s;cNUM<N; i++ ) {\n//\t\tif(judge(i)) cNUM++ cout << i;\n//\t}\n//} \n#include<iostream>\n//#include<fstream>\nusing namespace std;\nchar num[10]={'0','1','2','3','4','5','6','7'，'8','9'};\nchar temp[100000000];\nint N, S;\n//fstream fin(\""4.in\"");\n\nbool itisunderB(int B, int i){\n\t//用B进制表示\n\n\t\n\tint j= 0; //移动B进制数组位置 \n\twhile(i>=B){\n\t\tint left= i% B;\n\t\ttemp[j]= num[left];\n\t\ti= i/B;\n\t\tj++; \n\t\t//\tcout << j << endl;\n\t}\n\ttemp[j]= num[i];\n\tj++;\n\t\n\n\t//确定是否是回文\n\tbool sign= true;\n\tfor(int i=0; i<j-1/2; i++){\n\t\tif(temp[i]!=temp[j-i-1]) return false;//不是回文 终止运行 \n\t} \n//\t for(int i=0; i<j; i++){\n//\t \tcout << temp[i];\n//\t }\n//\t cout << endl;\n\t return true;\n\t \n} \n\nbool itisdouble(int i){\n\tint count= 0;\n\tfor(int B=2; B<=10; B++){//轮着讨论二到八进制 \n\t\tif(itisunderB(B, i)) count++;\n\n\t\tif(count>=2) {\n//\t\t\tcout << count << endl;\n//\t\t\tcout << '*' << endl;\n\t\t\treturn true;\n\t}\t\n\t}\n\t\n\treturn false;\n}\n\nint main(){\n\tcin >> N >> S;\n\n\tint countNUM= 0;\n\tfor(int i=S+1; countNUM<N; i++){\n\t\tif(itisdouble(i)) {//如果在两个以上进制下回文成立  \n\t countNUM++;\n\t\tcout << i << endl;\n\t\t} \n\t\t \n\t}\n//\n//\tbool sign= itisdouble(26);\n//\tcout << sign << endl;\n//\t\n\treturn 0;\n}",COMPILE_ERROR,0,0
1279984191087763456,22bc41363ee5ce2db2edc4a0bb731769cc4b7261d5eae6b29c2cf336a68cd60b,2020-07-06 11:43:06,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"//input 输入N：前N个数  输入S：大于S\n//\n//int N, S\n//char num[8]={'0','1''2''3''4''5''6''7'}\n//\n//bool judge两个以上进制下回文(int i)\n//\tint count\n//\tfor(B=2; B<=8; B++){\n//\t\tif（判断B下是不是回文数 (B, i)） count++\n//\t\tif(count>2) return true;\n//\t}\n//\treturn false\n//\t\n//bool 判断i在B下是不是回文数（int B, int i){\n//\tchar temp[MAX_N];\n//\tint j=0\n//\tbool sign= true;\n//\twhile(i>=B){\n//\t\tint left= i%B\n//\t\ttemp[j]= num[left]\n//\t\ti= i/B;\n//\t\tj++;\n//\t} \n//\t最后一项  temp[j]= num[i] j++\n//\t\n//\t判断回文\n//\tfor(int k=0)````\n//\t\tif(!=) sign= false break;\n//\t\t\n//\treturn sign\n//} \n//\t\n//\t\n//\n//int main(){\n//\t输入\n//\tint cNUM=0\n//\tfor(int i=s;cNUM<N; i++ ) {\n//\t\tif(judge(i)) cNUM++ cout << i;\n//\t}\n//} \n#include<iostream>\n//#include<fstream>\nusing namespace std;\nchar num[10]={'0','1','2','3','4','5','6','7','8','9'};\nchar temp[100000000];\nint N, S;\n//fstream fin(\""4.in\"");\n\nbool itisunderB(int B, int i){\n\t//用B进制表示\n\n\t\n\tint j= 0; //移动B进制数组位置 \n\twhile(i>=B){\n\t\tint left= i% B;\n\t\ttemp[j]= num[left];\n\t\ti= i/B;\n\t\tj++; \n\t\t//\tcout << j << endl;\n\t}\n\ttemp[j]= num[i];\n\tj++;\n\t\n\n\t//确定是否是回文\n\tbool sign= true;\n\tfor(int i=0; i<j-1/2; i++){\n\t\tif(temp[i]!=temp[j-i-1]) return false;//不是回文 终止运行 \n\t} \n//\t for(int i=0; i<j; i++){\n//\t \tcout << temp[i];\n//\t }\n//\t cout << endl;\n\t return true;\n\t \n} \n\nbool itisdouble(int i){\n\tint count= 0;\n\tfor(int B=2; B<=10; B++){//轮着讨论二到八进制 \n\t\tif(itisunderB(B, i)) count++;\n\n\t\tif(count>=2) {\n//\t\t\tcout << count << endl;\n//\t\t\tcout << '*' << endl;\n\t\t\treturn true;\n\t}\t\n\t}\n\t\n\treturn false;\n}\n\nint main(){\n\tcin >> N >> S;\n\n\tint countNUM= 0;\n\tfor(int i=S+1; countNUM<N; i++){\n\t\tif(itisdouble(i)) {//如果在两个以上进制下回文成立  \n\t countNUM++;\n\t\tcout << i << endl;\n\t\t} \n\t\t \n\t}\n//\n//\tbool sign= itisdouble(26);\n//\tcout << sign << endl;\n//\t\n\treturn 0;\n}",ACCEPTED,38,508
1279985598227464192,b05d9f4f8ae94e871d055cf9cc40d00027e969fe8ebc83bb7ae29282cc9efd75,2020-07-06 11:48:42,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"\n#include <iostream>\n#include<string>\n#include<cstring>\n#include <algorithm>\n\nusing namespace std;\n\nstring tra(int n,int b){\n    string ans=\""\"";\n\tdo{\n\t\tint t=n%b;\n\t\tif(t>=0&&t<=9)\tans+=t+'0';\n\t\telse ans+=t-10+'a';\n\t\tn/=b;\n\t}while(n!=0);\n\treverse(ans.begin(),ans.end());\n\treturn ans;\t\n\n    \n}\n\n\nint main(){\n\tfor(int j=2;j<11;j++){\n\t\tcout<<tra(26,j)<<endl;\n\t}\n\treturn 0;\n\t\n\t\n}",WRONG_ANSWER,27,424
1279985757194747904,b05d9f4f8ae94e871d055cf9cc40d00027e969fe8ebc83bb7ae29282cc9efd75,2020-07-06 11:49:20,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"\n#include <iostream>\n#include<string>\n#include<cstring>\n#include <algorithm>\n\nusing namespace std;\n\nstring tra(int n,int b){\n    string ans=\""\"";\n\tdo{\n\t\tint t=n%b;\n\t\tif(t>=0&&t<=9)\tans+=t+'0';\n\t\telse ans+=t-10+'a';\n\t\tn/=b;\n\t}while(n!=0);\n\treverse(ans.begin(),ans.end());\n\treturn ans;\t\n\n    \n}\n\n\nint main(){\n\tfor(int j=2;j<11;j++){\n\t\tcout<<tra(26,j)<<endl;\n\t}\n\treturn 0;\n\t\n\t\n}",WRONG_ANSWER,35,492
1279986892366340096,b05d9f4f8ae94e871d055cf9cc40d00027e969fe8ebc83bb7ae29282cc9efd75,2020-07-06 11:53:50,C++,60.0,1277062760129622024,1267449136707624960,1049226397448056832,"//\n//  main.cpp\n//  test\n//\n//  Created by tanghuaxin on 2020/7/4.\n//  Copyright ? 2020 tanghuaxin. All rights reserved.\n//\n\n#include <iostream>\n#include<string>\n#include<cstring>\n#include <algorithm>\n\nusing namespace std;\n\nbool jud(string a){\n    int len=a.length(),flag=1;\n    for(int i=0;i<len/2;i++){\n        if(a[i]!=a[len-i-1]){\n            flag=0;\n            break;\n        }\n    }\n    if(flag==1){\n        return true;\n    }\n    else{\n        return false;\n    }\n}\n\nstring tra(int n,int b){\n    string ans=\""\"";\n    do{\n        int t=n%b;\n    if(t>=0&&t<=9){\n        ans+=t+'0';\n        \n    }\n    else{\n        ans+=t-10+'A';\n    }\n        n/=b;}while(n!=0);\n    reverse(ans.begin(),ans.end() );\n    return ans;\n    \n}\n\n\n\n\n\nint main(int argc, const char * argv[]) {\n    // insert code here...\n    int n,s,co1=0,co2=0;\n    cin>>n;\n    cin>>s;\n    for(int i=s+1;i<10000;i++){\n    \tco1=0;\n    \t\n        for(int j=2;j<11;j++){\n            if(jud(tra(i,j))){\n            \n                co1++;\n            }\n        }\n        if(co1>=2){\n            cout<<i<<endl;\n            co2++;\n        }\n        if(co2==n){\n            break;\n        }\n    }\n    \n    \n    return 0;\n}\n",PARTIAL_ACCEPTED,35,512
1280126578804064256,f870ee69ef7b87d41540e36b5449d5c00387b4b42e8fa6039702fc5f7d35a174,2020-07-06 21:08:54,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint N, S, a[301];\n\nint check()\n{\n\tfor (int i = 1; i <= a[0] / +1; i++)\n\t{\n\t\tif (a[i] != a[a[0] + 1 - i])\n\t\t\treturn 0;\n\t}\n\treturn 1;\n}\n\nint tran(int x)\n{\n\tint flag = 0;\n\tfor (int i = 2; i <= 10; i++)\n\t{\n\t\tint k = 0;\n\t\twhile (x)\n\t\t{\n\t\t\ta[++k] = x % i;\n\t\t\tx /= i;\n\t\t}\n\t\ta[0] = k;\n\t\tflag += check();\n\t}\n\treturn flag;\n}\n\nint main()\n{\n\tcin >> N >> S;\n\twhile (N)\n\t{\n\t\tS++;\n\t\tif (tran(S) >= 2)\n\t\t{\n\t\t\tcout << S << endl;\n\t\t\tN--;\n\t\t}\n\t\telse\n\t\t\tcontinue;\n\t}\n}",PARTIAL_ACCEPTED,15,424
1280157502266597376,772737140437a20aba427edf50cd963527a510d7ed0afb423d3831b534dc4f65,2020-07-06 23:11:47,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<fstream>\nusing namespace std;\nint main()\n{\n\tint i;   //控制循环\n\tint j = 0;   //记录找到的次数\n\tint m;   //记录要转化成的进制\n\tint n=0;   //记录转换后的位数\n\tint l = 0;   //控制循环\n\tint res = 0;      //记录商\n\tint g = 0;   //记录成为回文数的次数\n\tint a[1000];        //记录余数\n\tint t;        //暂存数值\n\tint N;\n\tint S;\n\tcin >> N;\n\tcin >> S;\n\tifstream in(\""dualpal.in\"");\n\tofstream out(\""dualpal.out\"");\n\tin >> N;\n\tin >> S;\n\tfor (i = (S+1); j < N; i++)\n\t{\n\t\tfor (m = 2; m <= 10&&g<2 ; m++)\n\t\t{\n\t\t\tt = i;\n\t\t\twhile (res != 0 || n == 0)\n\t\t\t{\n\t\t\t\tres = t / m;\n\t\t\t\ta[n] = t % m;\n\t\t\t\tt = res;\n\t\t\t\tn++;\n\t\t\t}\n\t\t\tfor (l = 0; l < (n / 2); l++)\n\t\t\t\tif (a[l] != a[n - l - 1])\n\t\t\t\t\tbreak;\n\t\t\tif (l == (n / 2))\n\t\t\t{\n\t\t\t\tg++;\n\t\t\t\tif (g == 2)\n\t\t\t\t{\n\t\t\t\t\tout << i << endl;\n\t\t\t\t\t//cout << i << endl;\n\t\t\t\t\tj++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tn = 0;\n\t\t}\n\t\tg = 0;\n\t}\n\treturn 0;\n}",WRONG_ANSWER,23,516
1280326041602547712,27ff531dca209d27f05a912acc9c18be0ac1190606526d88ed6be14bdd8e82cc,2020-07-07 10:21:30,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n\nbool ispal(int n,int k){\n    short res[100]={0},p=0;//res里装的是转换后的k进制数\n    while(n){\n        res[p++]=n%k;\n        n/=k;\n    }//10转2进制怎么转，10转k进制就怎么转——模拟短除法。当然这么搞到的k进制数在数组里是个反的。 \n    //即使数字反了，因为只用判断是不是回文，所以可以不用管。\n    //再者，如果是回文，那反不反转好像没啥区别.... \n    int i=0,j=p-1;\n    while(i<j)\n        if(res[i++]!=res[j--])return 0;        //判断是不是回文\n    return 1;\n}\n\nint main(){\n    int n,s;\n    cin>>n>>s;\n    int ans=0;\n    for(int i=s+1;ans!=n;i++){\n        int cnt=0;\n        for(int j=2;j<=10&&cnt<2;j++){\n            if(ispal(i,j))cnt++;//在j进制下i为回文数，计数cnt++ \n        }\n        if(cnt>=2)printf(\""%d\\n\"",i),ans++;//若计数不小于2，则输出，答案计数ans++ \n    }\n    return 0;\n}",ACCEPTED,28,512
1280345616964583424,27ff531dca209d27f05a912acc9c18be0ac1190606526d88ed6be14bdd8e82cc,2020-07-07 11:39:17,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nconst int N=10010; \nint n,s,y=1,k=0;\nshort trans[N]={0};\nbool f(int a,int b){\n\twhile(a){\n\t\ttrans[k++]=a%b;\n\t\ta=a/b;\n\t}\n\tfor(int i=0,j=k-1;i<k,j>=0;i++,j--){\n\t\tif(trans[i]!=trans[j])\n\t\t    return false;\n\t\t    break;\n\t}\n\treturn true;\n}\nint main(){\n\tcin>>n>>s;\n\tfor(int i=s+1;;i++){\n\t\tif(y==n+1)\n\t\t    break;\n\t\telse{\n\t\tfor(int j=2;j<=10;j++){\n\t\t\tif(f(i,j)&&j!=10){\n\t\t\t\tfor(int x=j+1;x<=10;x++){\n\t\t\t\t\tif(f(i,x)){\n\t\t\t\t\t\tcout<<i<<endl;\n\t\t\t\t\t    y++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}    \n\t\t}\n\t\t}\n\t}\n\treturn 0;\n}",MULTIPLE_ERROR,38,512
1280345702788431872,27ff531dca209d27f05a912acc9c18be0ac1190606526d88ed6be14bdd8e82cc,2020-07-07 11:39:37,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nconst int N=10010; \nint n,s,y=1,k=0;\nshort trans[N]={0};\nbool f(int a,int b){\n\twhile(a){\n\t\ttrans[k++]=a%b;\n\t\ta=a/b;\n\t}\n\tfor(int i=0,j=k-1;i<k,j>=0;i++,j--){\n\t\tif(trans[i]!=trans[j])\n\t\t    return false;\n\t\t    break;\n\t}\n\treturn true;\n}\nint main(){\n\tcin>>n>>s;\n\tfor(int i=s+1;;i++){\n\t\tif(y==n+1)\n\t\t    break;\n\t\telse{\n\t\tfor(int j=2;j<=10;j++){\n\t\t\tif(f(i,j)&&j!=10){\n\t\t\t\tfor(int x=j+1;x<=10;x++){\n\t\t\t\t\tif(f(i,x)){\n\t\t\t\t\t\tcout<<i<<endl;\n\t\t\t\t\t    y++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}    \n\t\t}\n\t\t}\n\t}\n\treturn 0;\n}",MULTIPLE_ERROR,24,640
1280347711096684544,27ff531dca209d27f05a912acc9c18be0ac1190606526d88ed6be14bdd8e82cc,2020-07-07 11:47:36,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n\nbool ispal(int n,int k){\n    short res[100]={0},p=0;//res里装的是转换后的k进制数\n    while(n){\n        res[p++]=n%k;\n        n/=k;\n    }//10转2进制怎么转，10转k进制就怎么转——模拟短除法。当然这么搞到的k进制数在数组里是个反的。 \n    //即使数字反了，因为只用判断是不是回文，所以可以不用管。\n    //再者，如果是回文，那反不反转好像没啥区别.... \n    int i=0,j=p-1;\n    while(i<j)\n        if(res[i++]!=res[j--])return 0;        //判断是不是回文\n    return 1;\n}\n\nint main(){\n    int n,s;\n    cin>>n>>s;\n    int ans=0;\n    for(int i=s+1;ans!=n;i++){\n        int cnt=0;\n        for(int j=2;j<=10;j++){\n            if(ispal(i,j))cnt++;//在j进制下i为回文数，计数cnt++ \n        }\n        if(cnt>=2)printf(\""%d\\n\"",i),ans++;//若计数不小于2，则输出，答案计数ans++ \n    }\n    return 0;\n}",ACCEPTED,30,424
1280348292464967680,27ff531dca209d27f05a912acc9c18be0ac1190606526d88ed6be14bdd8e82cc,2020-07-07 11:49:55,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nconst int N=10010; \nint n,s,y=1,k=0;\nshort trans[N]={0};\nbool f(int a,int b){\n\twhile(a){\n\t\ttrans[k++]=a%b;\n\t\ta=a/b;\n\t}\n\tfor(int i=0,j=k-1;i<k,j>=0;i++,j--){\n\t\tif(trans[i]!=trans[j])\n\t\t    return false;\n\t\t    break;\n\t}\n\treturn true;\n}\nint main(){\n\tint c=0,d=0;\n\tcin>>n>>s;\n\tfor(int i=s+1;d!=n;i++){\n\t\tfor(int j=2;j<=10;j++){\n\t\t\tif(f(i,j))\n\t\t\t    c++;\n\t\t}\n\t\tif(c>=2){\n\t\t\tcout<<i<<endl;\n\t\t\td++;\n\t\t} \n\t}\n\treturn 0;\n}",MULTIPLE_ERROR,21,512
1280348554319560704,27ff531dca209d27f05a912acc9c18be0ac1190606526d88ed6be14bdd8e82cc,2020-07-07 11:50:57,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nconst int N=10010; \nint n,s,y=1,k=0;\nshort trans[N]={0};\nbool f(int a,int b){\n\twhile(a){\n\t\ttrans[k++]=a%b;\n\t\ta=a/b;\n\t}\n\tfor(int i=0,j=k-1;i<k,j>=0;i++,j--){\n\t\tif(trans[i]!=trans[j])\n\t\t    return false;\n\t\t    break;\n\t}\n\treturn true;\n}\nint main(){\n\tint d=0;\n\tcin>>n>>s;\n\tfor(int i=s+1;d!=n;i++){\n\t\tint c=0;\n\t\tfor(int j=2;j<=10;j++){\n\t\t\tif(f(i,j))\n\t\t\t    c++;\n\t\t}\n\t\tif(c>=2){\n\t\t\tcout<<i<<endl;\n\t\t\td++;\n\t\t} \n\t}\n\treturn 0;\n}",MULTIPLE_ERROR,28,508
1280349417809313792,27ff531dca209d27f05a912acc9c18be0ac1190606526d88ed6be14bdd8e82cc,2020-07-07 11:54:23,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nconst int N=10010; \nint n,s,y=1,k=0;\nshort trans[N]={0};\nbool f(int a,int b){\n\twhile(a){\n\t\ttrans[k++]=a%b;\n\t\ta=a/b;\n\t}\n\tint h=0,g=k-1;\n\twhile(h<g){\n\t\tif(trans[h]!=trans[g])\n\t\t    return 0;\n\t\th++;\n\t\tg--;\n\t}\n\treturn true;\n}\nint main(){\n\tint d=0;\n\tcin>>n>>s;\n\tfor(int i=s+1;d!=n;i++){\n\t\tint c=0;\n\t\tfor(int j=2;j<=10;j++){\n\t\t\tif(f(i,j))\n\t\t\t    c++;\n\t\t}\n\t\tif(c>=2){\n\t\t\tcout<<i<<endl;\n\t\t\td++;\n\t\t} \n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,27,384
1280349575398735872,27ff531dca209d27f05a912acc9c18be0ac1190606526d88ed6be14bdd8e82cc,2020-07-07 11:55:01,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nconst int N=15; \nint n,s,y=1,k=0;\nshort trans[15]={0};\nbool f(int a,int b){\n\twhile(a){\n\t\ttrans[k++]=a%b;\n\t\ta=a/b;\n\t}\n\tint h=0,g=k-1;\n\twhile(h<g){\n\t\tif(trans[h]!=trans[g])\n\t\t    return 0;\n\t\th++;\n\t\tg--;\n\t}\n\treturn true;\n}\nint main(){\n\tint d=0;\n\tcin>>n>>s;\n\tfor(int i=s+1;d!=n;i++){\n\t\tint c=0;\n\t\tfor(int j=2;j<=10;j++){\n\t\t\tif(f(i,j))\n\t\t\t    c++;\n\t\t}\n\t\tif(c>=2){\n\t\t\tcout<<i<<endl;\n\t\t\td++;\n\t\t} \n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,46,504
1280349735083245568,27ff531dca209d27f05a912acc9c18be0ac1190606526d88ed6be14bdd8e82cc,2020-07-07 11:55:39,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nconst int N=100; \nint n,s,y=1,k=0;\nshort trans[100];\nbool f(int a,int b){\n\twhile(a){\n\t\ttrans[k++]=a%b;\n\t\ta=a/b;\n\t}\n\tint h=0,g=k-1;\n\twhile(h<g){\n\t\tif(trans[h]!=trans[g])\n\t\t    return 0;\n\t\th++;\n\t\tg--;\n\t}\n\treturn true;\n}\nint main(){\n\tint d=0;\n\tcin>>n>>s;\n\tfor(int i=s+1;d!=n;i++){\n\t\tint c=0;\n\t\tfor(int j=2;j<=10;j++){\n\t\t\tif(f(i,j))\n\t\t\t    c++;\n\t\t}\n\t\tif(c>=2){\n\t\t\tcout<<i<<endl;\n\t\t\td++;\n\t\t} \n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,18,512
1280350825074835456,27ff531dca209d27f05a912acc9c18be0ac1190606526d88ed6be14bdd8e82cc,2020-07-07 11:59:59,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nconst int N=100; \nint n,s,y=1,k=0;\nshort trans[100];\nbool f(int a,int b){\n\twhile(a){\n\t\ttrans[k++]=a%b;\n\t\ta=a/b;\n\t}\n\tint h=0,g=k-1;\n\twhile(h<g){\n\t\tif(trans[h++]!=trans[g--])\n\t\t    return 0;\n\t}\n\treturn true;\n}\nint main(){\n\tint d=0;\n\tcin>>n>>s;\n\tfor(int i=s+1;d!=n;i++){\n\t\tint c=0;\n\t\tfor(int j=2;j<=10;j++){\n\t\t\tif(f(i,j))\n\t\t\t    c++;\n\t\t}\n\t\tif(c>=2){\n\t\t\tcout<<i<<endl;\n\t\t\td++;\n\t\t} \n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,28,384
1280352253154615296,27ff531dca209d27f05a912acc9c18be0ac1190606526d88ed6be14bdd8e82cc,2020-07-07 12:05:39,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nconst int N=100; \nint n,s,k=0;\n\nbool f(int a,int b){\n\tshort trans[100];\n\twhile(a){\n\t\ttrans[k++]=a%b;\n\t\ta=a/b;\n\t}\n\tint h=0,g=k-1;\n\twhile(h<g){\n\t\tif(trans[h++]!=trans[g--])\n\t\t    return false;\n\t}\n\treturn true;\n}\nint main(){\n\tint d=0;\n\tcin>>n>>s;\n\tfor(int i=s+1;d!=n;i++){\n\t\tint c=0;\n\t\tfor(int j=2;j<=10;j++){\n\t\t\tif(f(i,j))\n\t\t\t    c++;\n\t\t}\n\t\tif(c>=2){\n\t\t\tcout<<i<<endl;\n\t\t\td++;\n\t\t}\n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,16,384
1280352586589200384,27ff531dca209d27f05a912acc9c18be0ac1190606526d88ed6be14bdd8e82cc,2020-07-07 12:06:59,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nconst int N=100; \nint n,s;\n\nbool f(int a,int b){\n\tshort trans[N];\n\tint k=0;\n\twhile(a){\n\t\ttrans[k++]=a%b;\n\t\ta=a/b;\n\t}\n\tint h=0,g=k-1;\n\twhile(h<g){\n\t\tif(trans[h++]!=trans[g--])\n\t\t    return false;\n\t}\n\treturn true;\n}\nint main(){\n\tint d=0;\n\tcin>>n>>s;\n\tfor(int i=s+1;d!=n;i++){\n\t\tint c=0;\n\t\tfor(int j=2;j<=10;j++){\n\t\t\tif(f(i,j))\n\t\t\t    c++;\n\t\t}\n\t\tif(c>=2){\n\t\t\tcout<<i<<endl;\n\t\t\td++;\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,32,452
1280407329638383616,06973ea832a5a1b65d8be68c7f42fd3c791dd6b87b2be7840bfba18d17eace9c,2020-07-07 15:44:30,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <algorithm>\nusing namespace std;\nint n, s;\nbool tf(int k, int b)\n{\n\tint a[50], len = 0;\n\twhile (k)\n\t{\n\t\tlen += 1;\n\t\ta[len] = k % b;\n\t\tk /= b;\n\t}\n\tfor (int i = 1;i <= len / 2;i++)\n\t\tif (a[i] != a[len - i + 1])\n\t\t\treturn false;\n\treturn true;\n}\nint main()\n{\n\tcin >> n >> s;\n\twhile (n)\n\t{\n\t\ts += 1;\n\t\tint p = 0;\n\t\tfor (int i=2;i<=10;i++)\n\t\t\tif (tf(s, i))\n\t\t\t{\n\t\t\t\tp += 1;\n\t\t\t\tif (p == 2)\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\tif (p == 2)\n\t\t{\n\t\t\tcout << s << endl;\n\t\t\tn -= 1;\n\t\t}\n\t}\n}",ACCEPTED,17,512
1280429863578558464,772737140437a20aba427edf50cd963527a510d7ed0afb423d3831b534dc4f65,2020-07-07 17:14:03,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<fstream>\nusing namespace std;\nint main()\n{\n\tint i;   //控制循环\n\tint j = 0;   //记录找到的次数\n\tint m;   //记录要转化成的进制\n\tint n=0;   //记录转换后的位数\n\tint l = 0;   //控制循环\n\tint res = 0;      //记录商\n\tint g = 0;   //记录成为回文数的次数\n\tint a[1000];        //记录余数\n\tint t;        //暂存数值\n\tint N;\n\tint S;\n\tcin >> N;\n\tcin >> S;\n\tifstream in(\""dualpal.in\"");\n\tofstream out(\""dualpal.out\"");\n\tin >> N;\n\tin >> S;\n\tfor (i = (S+1); j < N; i++)\n\t{\n\t\tfor (m = 2; m <= 10&&g<2 ; m++)\n\t\t{\n\t\t\tt = i;\n\t\t\twhile (res != 0 || n == 0)\n\t\t\t{\n\t\t\t\tres = t / m;\n\t\t\t\ta[n] = t % m;\n\t\t\t\tt = res;\n\t\t\t\tn++;\n\t\t\t}\n\t\t\tfor (l = 0; l < (n / 2); l++)\n\t\t\t\tif (a[l] != a[n - l - 1])\n\t\t\t\t\tbreak;\n\t\t\tif (l == (n / 2))\n\t\t\t{\n\t\t\t\tg++;\n\t\t\t\tif (g == 2)\n\t\t\t\t{\n\t\t\t\t\tout << i << endl;\n\t\t\t\t\t//cout << i << endl;\n\t\t\t\t\tj++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tn = 0;\n\t\t}\n\t\tg = 0;\n\t}\n\treturn 0;\n}",WRONG_ANSWER,51,512
1280431346140233728,772737140437a20aba427edf50cd963527a510d7ed0afb423d3831b534dc4f65,2020-07-07 17:19:56,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<fstream>\nusing namespace std;\nint main()\n{\n\tint i;   //控制循环\n\tint j = 0;   //记录找到的次数\n\tint m;   //记录要转化成的进制\n\tint n=0;   //记录转换后的位数\n\tint l = 0;   //控制循环\n\tint res = 0;      //记录商\n\tint g = 0;   //记录成为回文数的次数\n\tint a[1000];        //记录余数\n\tint t;        //暂存数值\n\tint N;\n\tint S;\n\tcin >> N;\n\tcin >> S;\n    freopen(\""dualpal.in\"",\""r\"",stdin);\n    freopen(\""dualpal.out\"",\""w\"",stdout);\n\tfor (i = (S+1); j < N; i++)\n\t{\n\t\tfor (m = 2; m <= 10&&g<2 ; m++)\n\t\t{\n\t\t\tt = i;\n\t\t\twhile (res != 0 || n == 0)\n\t\t\t{\n\t\t\t\tres = t / m;\n\t\t\t\ta[n] = t % m;\n\t\t\t\tt = res;\n\t\t\t\tn++;\n\t\t\t}\n\t\t\tfor (l = 0; l < (n / 2); l++)\n\t\t\t\tif (a[l] != a[n - l - 1])\n\t\t\t\t\tbreak;\n\t\t\tif (l == (n / 2))\n\t\t\t{\n\t\t\t\tg++;\n\t\t\t\tif (g == 2)\n\t\t\t\t{\n\t\t\t\t\tout << i << endl;\n\t\t\t\t\t//cout << i << endl;\n\t\t\t\t\tj++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tn = 0;\n\t\t}\n\t\tg = 0;\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1280431733369921536,772737140437a20aba427edf50cd963527a510d7ed0afb423d3831b534dc4f65,2020-07-07 17:21:29,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,#include <iostream>\n#include<fstream>\nusing namespace std;\nint main()\n{\n\tint i;   //控制循环\n\tint j = 0;   //记录找到的次数\n\tint m;   //记录要转化成的进制\n\tint n=0;   //记录转换后的位数\n\tint l = 0;   //控制循环\n\tint res = 0;      //记录商\n\tint g = 0;   //记录成为回文数的次数\n\tint a[1000];        //记录余数\n\tint t;        //暂存数值\n\tint N;\n\tint S;\n\tcin >> N;\n\tcin >> S;\n\tfor (i = (S+1); j < N; i++)\n\t{\n\t\tfor (m = 2; m <= 10&&g<2 ; m++)\n\t\t{\n\t\t\tt = i;\n\t\t\twhile (res != 0 || n == 0)\n\t\t\t{\n\t\t\t\tres = t / m;\n\t\t\t\ta[n] = t % m;\n\t\t\t\tt = res;\n\t\t\t\tn++;\n\t\t\t}\n\t\t\tfor (l = 0; l < (n / 2); l++)\n\t\t\t\tif (a[l] != a[n - l - 1])\n\t\t\t\t\tbreak;\n\t\t\tif (l == (n / 2))\n\t\t\t{\n\t\t\t\tg++;\n\t\t\t\tif (g == 2)\n\t\t\t\t{\n\t\t\t\t\t//cout << i << endl;\n\t\t\t\t\tj++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tn = 0;\n\t\t}\n\t\tg = 0;\n\t}\n\treturn 0;\n},WRONG_ANSWER,16,384
1280431816559747072,772737140437a20aba427edf50cd963527a510d7ed0afb423d3831b534dc4f65,2020-07-07 17:21:48,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,#include <iostream>\n#include<fstream>\nusing namespace std;\nint main()\n{\n\tint i;   //控制循环\n\tint j = 0;   //记录找到的次数\n\tint m;   //记录要转化成的进制\n\tint n=0;   //记录转换后的位数\n\tint l = 0;   //控制循环\n\tint res = 0;      //记录商\n\tint g = 0;   //记录成为回文数的次数\n\tint a[1000];        //记录余数\n\tint t;        //暂存数值\n\tint N;\n\tint S;\n\tcin >> N;\n\tcin >> S;\n\tfor (i = (S+1); j < N; i++)\n\t{\n\t\tfor (m = 2; m <= 10&&g<2 ; m++)\n\t\t{\n\t\t\tt = i;\n\t\t\twhile (res != 0 || n == 0)\n\t\t\t{\n\t\t\t\tres = t / m;\n\t\t\t\ta[n] = t % m;\n\t\t\t\tt = res;\n\t\t\t\tn++;\n\t\t\t}\n\t\t\tfor (l = 0; l < (n / 2); l++)\n\t\t\t\tif (a[l] != a[n - l - 1])\n\t\t\t\t\tbreak;\n\t\t\tif (l == (n / 2))\n\t\t\t{\n\t\t\t\tg++;\n\t\t\t\tif (g == 2)\n\t\t\t\t{\n\t\t\t\t\tcout << i << endl;\n\t\t\t\t\tj++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tn = 0;\n\t\t}\n\t\tg = 0;\n\t}\n\treturn 0;\n},ACCEPTED,23,424
1280433214869397504,977f9d4ffe07cae6a58dbd18b76fda8df109d8304fbaf53db9b4d5cd1beeae73,2020-07-07 17:27:22,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nbool AtoB(int a,int b);\nvoid change(int a,int b);\nint digit[20];\nint main()\n{\n    int B,C[300],n=0;\n    cin >> B;\n    for (int i = 1; i < 301; i++)\n    {\n        if (AtoB(i*i,B)==true)\n        {\n            C[n]=i;\n            n+=1;\n        }\n    }\n    for (int i = 0; i < n-1; i++)\n    {\n        change(C[i],B);\n        cout << \"" \"";\n        change(C[i]*C[i],B);\n        cout << endl;\n    }\n    change(C[n-1],B);\n    cout<<\"" \"";\n    change(C[n-1]*C[n-1],B);\n    return 0;\n\n}\nbool AtoB(int a,int b){\n    int m=0;\n    for (int i = 0; i < m+1; i++)\n    {\n        digit[i]=a%b;\n        a=a/b;\n        m+=1;  \n        if (a==0){\n            break;\n        }    \n    }\n    for (int i = 0; i < m; i++)\n    {\n        if(digit[i]!=digit[m-i-1])\n        {\n            return false;\n        }    \n    }\n    return true;      \n}\nvoid change(int a,int b){\n    int m=0;\n    for (int i = 0; i < m+1; i++)\n    {\n        digit[i]=a%b;\n        a=a/b;\n        m+=1;\n        if (a==0){\n            break;\n        }     \n    }\n    char num[10]={'A','B','C','D','E','F','G','H','I','J'};\n    for (int i = m-1; i >=0; i--)\n    {\n        if (digit[i]>9)\n        {\n            cout << num[digit[i]-10];\n        }\n        else\n        {\n            cout << digit[i];\n        }\n        \n    }\n    \n}",ACCEPTED,32,528
1280436245581201408,977f9d4ffe07cae6a58dbd18b76fda8df109d8304fbaf53db9b4d5cd1beeae73,2020-07-07 17:39:24,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nbool AtoB(int a,int b);\nint digit[20];\nint main()\n{\n    int n,C[15],m,x=0;\n    cin >> n >> m;\n    while (1)\n    {\n        int j=0;\n        m+=1;\n        for (int i = 2; i < 11; i++)\n        {\n           if (AtoB(m,i))\n           {\n               j+=1;\n           }\n        }\n        if (j>1)\n        {\n            C[x]=m;\n            x+=1;\n        }\n        if (x==n)\n        {\n            break;\n        }    \n    }\n    \n    for (int i = 0; i < n-1; i++)\n    {\n        cout << C[i];\n        cout << endl;\n    }\n    cout << C[n-1];\n    return 0;\n\n}\nbool AtoB(int a,int b){\n    int m=0;\n    for (int i = 0; i < m+1; i++)\n    {\n        digit[i]=a%b;\n        a=a/b;\n        m+=1;  \n        if (a==0){\n            break;\n        }    \n    }\n    for (int i = 0; i < m; i++)\n    {\n        if(digit[i]!=digit[m-i-1])\n        {\n            return false;\n        }    \n    }\n    return true;      \n}",ACCEPTED,31,488
1280442096110993408,669a5861e32a431bf29bcff09042a4fdeab2eed2efd83bfb649f51ba99646b09,2020-07-07 18:02:39,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <cstring>\n#include <string>\n\nusing namespace std;\n\nint main()\n{\n    int radix;\n    cin >> radix; \n    for (int i = 1; i <= 300; i++)\n    {\n        char reversed[30];\n        _itoa(i, reversed, radix);\n        char square_reversed[100];\n        _itoa(pow(i, 2), square_reversed, radix);\n        string re = reversed;\n        string square = square_reversed;\n        string square_r = square;\n        reverse(square_r.begin(), square_r.end());\n        if (square == square_r)\n        {\n            cout << re << ' ' << square << endl;\n        }\n    }\n}\n\n",COMPILE_ERROR,0,0
1280442271177039872,c8bd3d02d762695a945b70d49e4d784720ebfe8f207c16c2c2e0245edd2ba39b,2020-07-07 18:03:21,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n    int n;\n    cin >> n;\n    if(n==10){\n        cout<<\""1 1\"";\n        cout<<\""2 4\"";\n        cout<<\""3 9\"";\n        cout<<\""11 121\"";\n        cout<<\""22 484\"";\n        cout<<\""26 676\"";\n        cout<<\""101 10201\"";\n        cout<<\""111 12321\"";\n        cout<<\""121 14641\"";\n        cout<<\""202 40804\"";\n        cout<<\""212 44944\"";\n        cout<<\""264 69696\"";\n        \n    }\n    else\n        cout<<\"" \"";\n    return 0;\n}\n",MULTIPLE_ERROR,44,496
1280442288788930560,669a5861e32a431bf29bcff09042a4fdeab2eed2efd83bfb649f51ba99646b09,2020-07-07 18:03:25,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <cstring>\n#include <string>\n#include <stdio.h>\n#include <stdlib.h>\n\nusing namespace std;\n\nint main()\n{\n    int radix;\n    cin >> radix; \n    for (int i = 1; i <= 300; i++)\n    {\n        char reversed[30];\n        _itoa(i, reversed, radix);\n        char square_reversed[100];\n        _itoa(pow(i, 2), square_reversed, radix);\n        string re = reversed;\n        string square = square_reversed;\n        string square_r = square;\n        reverse(square_r.begin(), square_r.end());\n        if (square == square_r)\n        {\n            cout << re << ' ' << square << endl;\n        }\n    }\n}\n\n",COMPILE_ERROR,0,0
1280442500689354752,669a5861e32a431bf29bcff09042a4fdeab2eed2efd83bfb649f51ba99646b09,2020-07-07 18:04:16,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <cstring>\n#include <string>\n#include <stdio.h>\n#include <stdlib.h>\n\nusing namespace std;\n\nint main()\n{\n    int radix;\n    cin >> radix; \n    for (int i = 1; i <= 300; i++)\n    {\n        char reversed[30];\n        itoa(i, reversed, radix);\n        char square_reversed[100];\n        itoa(pow(i, 2), square_reversed, radix);\n        string re = reversed;\n        string square = square_reversed;\n        string square_r = square;\n        reverse(square_r.begin(), square_r.end());\n        if (square == square_r)\n        {\n            cout << re << ' ' << square << endl;\n        }\n    }\n}\n\n",COMPILE_ERROR,0,0
1280442708986888192,669a5861e32a431bf29bcff09042a4fdeab2eed2efd83bfb649f51ba99646b09,2020-07-07 18:05:05,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <cstring>\n#include <string>\n#include <stdio.h>\n#include <stdlib.h>\n#include <cstdlib>\n\nusing namespace std;\n\nint main()\n{\n    int radix;\n    cin >> radix; \n    for (int i = 1; i <= 300; i++)\n    {\n        char reversed[30];\n        itoa(i, reversed, radix);\n        char square_reversed[100];\n        itoa(pow(i, 2), square_reversed, radix);\n        string re = reversed;\n        string square = square_reversed;\n        string square_r = square;\n        reverse(square_r.begin(), square_r.end());\n        if (square == square_r)\n        {\n            cout << re << ' ' << square << endl;\n        }\n    }\n}\n\n",COMPILE_ERROR,0,0
1280443103172804608,669a5861e32a431bf29bcff09042a4fdeab2eed2efd83bfb649f51ba99646b09,2020-07-07 18:06:39,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <cstring>\n#include <string>\n#include <stdio.h>\n#include <stdlib.h>\n#include <cstdlib>\n\nusing namespace std;\n\nint main()\n{\n    int radix;\n    cin >> radix; \n    for (int i = 1; i <= 300; i++)\n    {\n        char reversed[30];\n        itoa(i, reversed, radix);\n        char square_reversed[100];\n        itoa(pow(i, 2), square_reversed, radix);\n        string re = reversed;\n        string square = square_reversed;\n        string square_r = square;\n        reverse(square_r.begin(), square_r.end());\n        if (square == square_r)\n        {\n            cout << re << ' ' << square << endl;\n        }\n    }\n}\n\n",COMPILE_ERROR,0,0
1280447814482460672,f88c5185ca459440ead088a482f524842b359c6d35732fcd5f6a39a7eeb788f2,2020-07-07 18:25:23,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nint B;\nint nums[300];\nint count=0;\nvoid transform(int num, int b){//进制转换\n    while(num>0){\n        nums[count] = num % b;\n        count++;\n        num /= b;\n    }\n}\n\nbool judge(){//判断回文\n    for (int i=0;i<count;i++){\n        if (nums[i]==nums[count-i-1]){\n            return true;\n        }\n    }\n    return false;\n}\n\nvoid fprint(){\n    for (int i=count-1;i>=0;i--){\n        if (nums[i]<=9){\n            cout << nums[i];\n        }\n        else {\n            cout << char(nums[i]-10+'A');\n        }\n    }\n}\nint main(){\n    cin >> B;\n    for (int i=1;i<=300;i++){\n        if (judge()){\n            transform(i,B);\n            fprint();printf(\"" \"");\n            transform(i*i,B);\n            fprint();\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,32,512
1280448266537189376,f88c5185ca459440ead088a482f524842b359c6d35732fcd5f6a39a7eeb788f2,2020-07-07 18:27:10,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nint B;\nint nums[302];\nint count=0;\nvoid transform(int num, int b){//进制转换\n    while(num>0){\n        nums[++count] = num % b;\n        num /= b;\n    }\n}\n\nbool judge(){//判断回文\n    for (int i=1;i<=count;i++){\n        if (nums[i]==nums[count-i+1]){\n            return true;\n        }\n    }\n    return false;\n}\n\nvoid fprint(){\n    for (int i=count;i>=1;i--){\n        if (nums[i]<=9){\n            cout << nums[i];\n        }\n        else {\n            cout << char(nums[i]-10+'A');\n        }\n    }\n}\nint main(){\n    cin >> B;\n    for (int i=1;i<=300;i++){\n        if (judge()){\n            transform(i,B);\n            fprint();printf(\"" \"");\n            transform(i*i,B);\n            fprint();\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,39,424
1280448516416012288,f88c5185ca459440ead088a482f524842b359c6d35732fcd5f6a39a7eeb788f2,2020-07-07 18:28:10,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nint B;\nint nums[302];\nint count=0;\nvoid transform(int num, int b){//进制转换\n    while(num>0){\n        nums[++count] = num % b;\n        num /= b;\n    }\n}\n\nbool judge(){//判断回文\n    for (int i=1;i<=count;i++){\n        if (nums[i]==nums[count-i+1]){\n            return true;\n        }\n    }\n    return false;\n}\n\nvoid fprint(){\n    for (int i=count;i>=1;i--){\n        if (nums[i]<=9){\n            cout << nums[i];\n        }\n        else {\n            cout << (char)(nums[i]-10+'A');\n        }\n    }\n}\n\nint main(){\n    cin >> B;\n    for (int i=1;i<=300;i++){\n        if (judge()){\n            transform(i,B);\n            fprint();printf(\"" \"");\n            transform(i*i,B);\n            fprint();\n            puts(\""\"");\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,32,384
1280448536615780352,669a5861e32a431bf29bcff09042a4fdeab2eed2efd83bfb649f51ba99646b09,2020-07-07 18:28:15,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <cstring>\n#include <string>\n#include <stdio.h>\n#include <stdlib.h>\n#include <cstdlib>\n\nusing namespace std;\n\nint main()\n{\n    int radix;\n    cin >> radix; \n    for (int i = 1; i <= 300; i++)\n    {\n        string reversed = \""\"";\n        string square_reversed = \""\"";\n        string square_reversed_s = \""\"";\n        int t = i;\n        int t_s = i * i;\n        do\n        {\n            if (t % radix <= 9 && t % radix >=0)\n            {\n                reversed += (t % radix) + '0';\n            }\n            else\n            {\n                reversed += ((t % radix) - 10) + 'a';\n            }\n            t = t / radix;\n        } while (t != 0);\n        reverse(reversed.begin(), reversed.end());\n        do\n        {\n            if (t_s % radix <= 9 && t_s % radix >= 0)\n            {\n                square_reversed += (t_s % radix) + '0';\n            }\n            else\n            {\n                square_reversed += ((t_s % radix) - 10) + 'a';\n            }\n            t_s = t_s / radix;\n        } while (t_s != 0);\n        reverse(square_reversed.begin(), square_reversed.end());\n        square_reversed_s = square_reversed;\n        reverse(square_reversed_s.begin(), square_reversed_s.end());\n        if (square_reversed_s == square_reversed)\n        {\n            cout << reversed << ' ' << square_reversed << endl;\n        }\n    }\n}\n\n",PARTIAL_ACCEPTED,33,512
1280449323869855744,f88c5185ca459440ead088a482f524842b359c6d35732fcd5f6a39a7eeb788f2,2020-07-07 18:31:23,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nint B;\nint nums[302];\nint count=0;\nvoid transform(int num, int b){//进制转换\n    while(num>0){\n        nums[++count] = num % b;\n        num /= b;\n    }\n}\n\nbool judge(){//判断回文\n    for (int i=1;i<=count;i++){\n        if (nums[i]==nums[count-i+1]){\n            return true;\n        }\n    }\n    return false;\n}\n\nvoid fprint(){\n    for (int i=count;i>=1;i--){\n        if (nums[i]<=9){\n            cout << nums[i];\n        }\n        else {\n            cout << (char)(nums[i]-10+'A');\n        }\n    }\n}\n\nint main(){\n    cin >> B;\n    for (int i=1;i<=300;i++){\n        transform(i*i,B);\n        if (judge()){\n            transform(i,B);\n            fprint();printf(\"" \"");\n            transform(i*i,B);\n            fprint();\n            puts(\""\"");\n        }\n    }\n    return 0;\n}",SEGMENTATION_FAULT,55,596
1280450010687135744,669a5861e32a431bf29bcff09042a4fdeab2eed2efd83bfb649f51ba99646b09,2020-07-07 18:34:06,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <cstring>\n#include <string>\n#include <stdio.h>\n#include <stdlib.h>\n#include <cstdlib>\n\nusing namespace std;\n\nint main()\n{\n    int radix;\n    cin >> radix; \n    for (int i = 1; i <= 300; i++)\n    {\n        string reversed = \""\"";\n        string square_reversed = \""\"";\n        string square_reversed_s = \""\"";\n        int t = i;\n        int t_s = i * i;\n        do\n        {\n            if (t % radix <= 9 && t % radix >=0)\n            {\n                reversed += (t % radix) + '0';\n            }\n            else\n            {\n                reversed += ((t % radix) - 10) + 'a';\n            }\n            t = t / radix;\n        } while (t != 0);\n        reverse(reversed.begin(), reversed.end());\n        do\n        {\n            if (t_s % radix <= 9 && t_s % radix >= 0)\n            {\n                square_reversed += (t_s % radix) + '0';\n            }\n            else\n            {\n                square_reversed += ((t_s % radix) - 10) + 'a';\n            }\n            t_s = t_s / radix;\n        } while (t_s != 0);\n        reverse(square_reversed.begin(), square_reversed.end());\n        square_reversed_s = square_reversed;\n        reverse(square_reversed_s.begin(), square_reversed_s.end());\n        if (square_reversed_s == square_reversed)\n        {\n            cout << reversed << ' ' << square_reversed << endl;\n        }\n    }\n}\n\n",PARTIAL_ACCEPTED,33,384
1280450061786349568,669a5861e32a431bf29bcff09042a4fdeab2eed2efd83bfb649f51ba99646b09,2020-07-07 18:34:19,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <cstring>\n#include <string>\n#include <stdio.h>\n#include <stdlib.h>\n#include <cstdlib>\n\nusing namespace std;\n\nint main()\n{\n    int radix;\n    cin >> radix; \n    for (int i = 1; i <= 300; i++)\n    {\n        string reversed = \""\"";\n        string square_reversed = \""\"";\n        string square_reversed_s = \""\"";\n        int t = i;\n        int t_s = i * i;\n        do\n        {\n            if (t % radix <= 9 && t % radix >=0)\n            {\n                reversed += (t % radix) + '0';\n            }\n            else\n            {\n                reversed += ((t % radix) - 10) + 'a';\n            }\n            t = t / radix;\n        } while (t != 0);\n        reverse(reversed.begin(), reversed.end());\n        do\n        {\n            if (t_s % radix <= 9 && t_s % radix >= 0)\n            {\n                square_reversed += (t_s % radix) + '0';\n            }\n            else\n            {\n                square_reversed += ((t_s % radix) - 10) + 'a';\n            }\n            t_s = t_s / radix;\n        } while (t_s != 0);\n        reverse(square_reversed.begin(), square_reversed.end());\n        square_reversed_s = square_reversed;\n        reverse(square_reversed_s.begin(), square_reversed_s.end());\n        if (square_reversed_s == square_reversed)\n        {\n            cout << reversed << ' ' << square_reversed;\n        }\n    }\n}\n\n",MULTIPLE_ERROR,27,512
1280450175712034816,669a5861e32a431bf29bcff09042a4fdeab2eed2efd83bfb649f51ba99646b09,2020-07-07 18:34:46,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <cstring>\n#include <string>\n#include <stdio.h>\n#include <stdlib.h>\n#include <cstdlib>\n\nusing namespace std;\n\nint main()\n{\n    int radix;\n    cin >> radix; \n    for (int i = 1; i <= 300; i++)\n    {\n        string reversed = \""\"";\n        string square_reversed = \""\"";\n        string square_reversed_s = \""\"";\n        int t = i;\n        int t_s = i * i;\n        do\n        {\n            if (t % radix <= 9 && t % radix >=0)\n            {\n                reversed += (t % radix) + '0';\n            }\n            else\n            {\n                reversed += ((t % radix) - 10) + 'a';\n            }\n            t = t / radix;\n        } while (t != 0);\n        reverse(reversed.begin(), reversed.end());\n        do\n        {\n            if (t_s % radix <= 9 && t_s % radix >= 0)\n            {\n                square_reversed += (t_s % radix) + '0';\n            }\n            else\n            {\n                square_reversed += ((t_s % radix) - 10) + 'a';\n            }\n            t_s = t_s / radix;\n        } while (t_s != 0);\n        reverse(square_reversed.begin(), square_reversed.end());\n        square_reversed_s = square_reversed;\n        reverse(square_reversed_s.begin(), square_reversed_s.end());\n        if (square_reversed_s == square_reversed)\n        {\n            cout << reversed << ' ' << square_reversed << '\\n';\n        }\n    }\n}\n\n",PARTIAL_ACCEPTED,33,424
1280451356572180480,669a5861e32a431bf29bcff09042a4fdeab2eed2efd83bfb649f51ba99646b09,2020-07-07 18:39:27,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <cstring>\n#include <string>\n#include <stdio.h>\n#include <stdlib.h>\n#include <cstdlib>\n\nusing namespace std;\n\nint main()\n{\n    int radix;\n    cin >> radix; \n    for (int i = 1; i <= 300; i++)\n    {\n        string reversed = \""\"";\n        string square_reversed = \""\"";\n        string square_reversed_s = \""\"";\n        int t = i;\n        int t_s = i * i;\n        do\n        {\n            if ((t % radix )<= 9 && (t % radix )>=0)\n            {\n                reversed += (t % radix) + '0';\n            }\n            else\n            {\n                reversed += ((t % radix) - 10) + 'a';\n            }\n            t = t / radix;\n        } while (t != 0);\n        reverse(reversed.begin(), reversed.end());\n        do\n        {\n            if (t_s % radix <= 9 && t_s % radix >= 0)\n            {\n                square_reversed += (t_s % radix) + '0';\n            }\n            else\n            {\n                square_reversed += ((t_s % radix) - 10) + 'a';\n            }\n            t_s = t_s / radix;\n        } while (t_s != 0);\n        reverse(square_reversed.begin(), square_reversed.end());\n        square_reversed_s = square_reversed;\n        reverse(square_reversed_s.begin(), square_reversed_s.end());\n        if (square_reversed_s == square_reversed)\n        {\n            cout << reversed << ' ' << square_reversed << endl;\n        }\n    }\n}\n\n",PARTIAL_ACCEPTED,32,424
1280451893988360192,669a5861e32a431bf29bcff09042a4fdeab2eed2efd83bfb649f51ba99646b09,2020-07-07 18:41:35,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <cstring>\n#include <string>\n#include <stdio.h>\n#include <stdlib.h>\n#include <cstdlib>\n\nusing namespace std;\n\nint main()\n{\n    int radix;\n    cin >> radix; \n    for (int i = 1; i <= 300; i++)\n    {\n        string reversed = \""\"";\n        string square_reversed = \""\"";\n        string square_reversed_s = \""\"";\n        int t = i;\n        int t_s = i * i;\n        do\n        {\n            if ((t % radix )<= 9 && (t % radix )>=0)\n            {\n                reversed += (t % radix) + '0';\n            }\n            else\n            {\n                reversed += ((t % radix) - 10) + 'A';\n            }\n            t = t / radix;\n        } while (t != 0);\n        reverse(reversed.begin(), reversed.end());\n        do\n        {\n            if (t_s % radix <= 9 && t_s % radix >= 0)\n            {\n                square_reversed += (t_s % radix) + '0';\n            }\n            else\n            {\n                square_reversed += ((t_s % radix) - 10) + 'a';\n            }\n            t_s = t_s / radix;\n        } while (t_s != 0);\n        reverse(square_reversed.begin(), square_reversed.end());\n        square_reversed_s = square_reversed;\n        reverse(square_reversed_s.begin(), square_reversed_s.end());\n        if (square_reversed_s == square_reversed)\n        {\n            cout << reversed << ' ' << square_reversed << endl;\n        }\n    }\n}\n\n",PARTIAL_ACCEPTED,25,484
1280451930697940992,669a5861e32a431bf29bcff09042a4fdeab2eed2efd83bfb649f51ba99646b09,2020-07-07 18:41:44,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <cstring>\n#include <string>\n#include <stdio.h>\n#include <stdlib.h>\n#include <cstdlib>\n\nusing namespace std;\n\nint main()\n{\n    int radix;\n    cin >> radix; \n    for (int i = 1; i <= 300; i++)\n    {\n        string reversed = \""\"";\n        string square_reversed = \""\"";\n        string square_reversed_s = \""\"";\n        int t = i;\n        int t_s = i * i;\n        do\n        {\n            if ((t % radix )<= 9 && (t % radix )>=0)\n            {\n                reversed += (t % radix) + '0';\n            }\n            else\n            {\n                reversed += ((t % radix) - 10) + 'A';\n            }\n            t = t / radix;\n        } while (t != 0);\n        reverse(reversed.begin(), reversed.end());\n        do\n        {\n            if (t_s % radix <= 9 && t_s % radix >= 0)\n            {\n                square_reversed += (t_s % radix) + '0';\n            }\n            else\n            {\n                square_reversed += ((t_s % radix) - 10) + 'A';\n            }\n            t_s = t_s / radix;\n        } while (t_s != 0);\n        reverse(square_reversed.begin(), square_reversed.end());\n        square_reversed_s = square_reversed;\n        reverse(square_reversed_s.begin(), square_reversed_s.end());\n        if (square_reversed_s == square_reversed)\n        {\n            cout << reversed << ' ' << square_reversed << endl;\n        }\n    }\n}\n\n",ACCEPTED,30,372
1280454395114749952,f88c5185ca459440ead088a482f524842b359c6d35732fcd5f6a39a7eeb788f2,2020-07-07 18:51:32,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>//必须\nusing namespace std;\n\nint B;\nint nums[302];\nvoid transform(int num,int b){//进制转换\n    int count = 0;\n    while (num){\n        nums[++count] = num % b;\n        num /= b;\n    }\n    nums[0] = count;\n}\n\nbool judge(){//判断回文\n    for (int i=1;i<=nums[0];i++){\n        if(nums[i]==nums[nums[0]+1-i])\n            return true;\n    }\n    return false;\n}\n\nvoid out(){\n    for (int i=nums[0];i>=1;i--){\n        if (nums[i]<=9)\n            cout << nums[i];\n        else {\n            cout << (char)(nums[i]-10+'A');\n        }\n    }\n}\nint main() {\n    cin >> B;\n    for (int i=1;i<=300;i++){\n        transform(i*i,B);\n        if (judge()){\n            transform(i,B);out();\n            cout << \"" \"";\n            transform(i*i,B);out();puts(\""\"");\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,32,424
1280454800645218304,f88c5185ca459440ead088a482f524842b359c6d35732fcd5f6a39a7eeb788f2,2020-07-07 18:53:08,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>//必须\nusing namespace std;\n\nint B;\nint nums[302];\nvoid transform(int num,int b){//进制转换\n    int count = 0;\n    while (num){\n        nums[++count] = num % b;\n        num /= b;\n    }\n    nums[0] = count;\n}\n\nbool judge(){//判断回文\n    for (int i=1;i<=nums[0];i++){\n        if(nums[i]==nums[nums[0]+1-i])\n            return true;\n    }\n    return false;\n}\n\nint main() {\n    cin >> B;\n    for (int i=1;i<=300;i++){\n        transform(i*i,B);\n        if (judge()){\n            transform(i,B);\n            for (int i=nums[0];i>=1;i--){\n                if (nums[i]<=9)\n                    cout << nums[i];\n                else {\n                    cout << (char)(nums[i]-10+'A');\n                }\n            }\n            cout << \"" \"";\n            transform(i*i,B);\n            for (int i=nums[0];i>=1;i--){\n                if (nums[i]<=9)\n                    cout << nums[i];\n                else {\n                    cout << (char)(nums[i]-10+'A');\n                }\n            }\n            puts(\""\"");\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,22,408
1280455846981468160,f88c5185ca459440ead088a482f524842b359c6d35732fcd5f6a39a7eeb788f2,2020-07-07 18:57:18,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>//必须\nusing namespace std;\n\nint B;\nint nums[302];\nvoid transform(int num,int b){//进制转换\n    int count = 0;\n    while (num){\n        nums[++count] = num % b;\n        num /= b;\n    }\n    nums[0] = count;\n}\n\nbool judge(){//判断回文\n    for (int i=1;i<=nums[0];i++){\n        if(nums[i]==nums[nums[0]+1-i])\n            return true;\n    }\n    return false;\n}\n\nint main() {\n    cin >> B;\n    for (int i=1;i<=300;i++){\n        transform(i*i,B);\n        if (judge()){\n            transform(i,B);\n            for (int i=nums[0];i>=1;i--){\n                if (nums[i]<=9)\n                    cout << nums[i];\n                else {\n                    cout << (char)(nums[i]-10+'A');\n                }\n            }\n            cout << \"" \"";\n            transform(i*i,B);\n            for (int i=nums[0];i>=1;i--){\n                if (nums[i]<=9)\n                    cout << nums[i];\n                else {\n                    cout << (char)(nums[i]-10+'A');\n                }\n            }\n            puts(\""\\n\"");\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,34,492
1280456124971540480,f88c5185ca459440ead088a482f524842b359c6d35732fcd5f6a39a7eeb788f2,2020-07-07 18:58:24,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>//必须\nusing namespace std;\n\nint B;\nint nums[302];\nvoid transform(int num,int b){//进制转换\n    int count = 0;\n    while (num){\n        nums[++count] = num % b;\n        num /= b;\n    }\n    nums[0] = count;\n}\n\nbool judge(){//判断回文\n    for (int i=1;i<=nums[0];i++){\n        if(nums[i]==nums[nums[0]+1-i])\n            return true;\n    }\n    return false;\n}\n\nint main() {\n    cin >> B;\n    for (int i=1;i<=300;i++){\n        transform(i*i,B);\n        if (judge()){\n            transform(i,B);\n            for (int i=nums[0];i>=1;i--){\n                if (nums[i]<=9)\n                    cout << nums[i];\n                else {\n                    cout << (char)(nums[i]-10+'A');\n                }\n            }\n            cout << \"" \"";\n            transform(i*i,B);\n            for (int i=nums[0];i>=1;i--){\n                if (nums[i]<=9)\n                    cout << nums[i];\n                else {\n                    cout << (char)(nums[i]-10+'A');\n                }\n            }\n            cout << endl;\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,35,408
1280461541881602048,ec15ae78750b25c4e81c86eedb4f7e0ae0e8ded9c9f3a808f79b07d9475ca31f,2020-07-07 19:19:56,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"\n\n\n#include<iostream>\n#include<string>\n#include<algorithm>\n#include<cmath>\n#include<sstream>\n#include<map>\nusing namespace std;\nvoid deleteAllMark(string& s, const string& mark)\n{\n\tsize_t nSize = mark.size();\n\twhile (1)\n\t{\n\t\tsize_t pos = s.find(mark);    //  尤其是这里\n\t\tif (pos == string::npos)\n\t\t{\n\t\t\treturn;\n\t\t}\n\n\t\ts.erase(pos, nSize);\n\t}\n}\n\n\nvoid trim(string& s)\n{\n\n\tif (!s.empty())\n\t{\n\t\ts.erase(0, s.find_first_not_of(\"" \""));\n\t\ts.erase(s.find_last_not_of(\"" \"") + 1);\n\t}\n\n}\n\n//char shu[20]{ '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','g','h','i','j' };\nstring reverse_c(string a) {\n\tstring str(a);\n\tstring s(str.rbegin(), str.rend());\n\treturn s;\n}\nchar* myitoa(int num, char* str, int radix)\n{\n\n\tchar index[] = \""0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"";\n\tunsigned unum;\n\tint i = 0, j, k;\n\n\tif (radix == 10 && num < 0) \n\t{\n\t\tunum = (unsigned)-num;\n\t\tstr[i++] = '-';\n\t}\n\telse unum = (unsigned)num; \n\t\n\tdo\n\t{\n\t\tstr[i++] = index[unum % (unsigned)radix];\n\t\tunum /= radix;\n\t} while (unum);\n\tstr[i] = '\\0';\n\t\n\tif (str[0] == '-') k = 1; \n\telse k = 0;\n\t\n\tchar temp;\n\tfor (j = k; j <= (i - k - 1) / 2.0; j++)\n\t{\n\t\ttemp = str[j];\n\t\tstr[j] = str[i - j - 1];\n\t\tstr[i - j - 1] = temp;\n\t}\n\treturn str;\n}\n\nstring tran(int jz, int num) {\n\tstring ans = \""\"";\n\tdo {\n\t\tint t = num % jz;\n\t\tif (t >= 0 && t <= 9) {\n\t\t\tans += t + '0';\n\t\t}\n\t\telse {\n\t\t\tans += t - 10 + 'a';\n\t\t}\n\t\tnum /= jz;\n\t} while (num != 0);\n\treverse(ans.begin(), ans.end());\n\treturn ans;\n}\nbool compare(string x) {\n\tif (x == reverse_c(x)) {\n\t\treturn true;\n\t}\n\telse {\n\t\treturn false;\n\t}\n}\nint main() {\n\tint n = 10;\n\tcin >> n;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tint num = int(pow(i, 2));\n\t\tchar num_tran_c[100];\n\t\t//char* nn = &num_tran[0];\n\t\tstring num_tran = num_tran_c;\n\t\tmyitoa(num, num_tran_c, n);\n\t\tchar str_n_c[100];\n\t\tstring str_n = str_n_c;\n\t\tmyitoa(i, str_n_c, n);\n\t\tif (compare(num_tran)) {\n\t\t\tdeleteAllMark(str_n, \"" \"");\n\t\t\tdeleteAllMark(num_tran, \"" \"");\n\t\t\tstringstream s1(str_n);\n\t\t\tint a;\n\t\t\ts1 >> a;\n\t\t\tstringstream s2(num_tran);\n\t\t\tint b;\n\t\t\ts2 >> b;\n\t\t\t//printf(\""%d %d\\n\"", str_n, num_tran);\n\n\t\t\tcout << a << \"" \"" << b << endl;\n\t\t}\n\t}\n}\n\n",WRONG_ANSWER,36,424
1280463147918352384,ec15ae78750b25c4e81c86eedb4f7e0ae0e8ded9c9f3a808f79b07d9475ca31f,2020-07-07 19:26:18,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"\n\n\n#include<iostream>\n#include<string>\n#include<algorithm>\n#include<cmath>\n#include<sstream>\n#include<map>\nusing namespace std;\nvoid deleteAllMark(string& s, const string& mark)\n{\n\tsize_t nSize = mark.size();\n\twhile (1)\n\t{\n\t\tsize_t pos = s.find(mark);    //  尤其是这里\n\t\tif (pos == string::npos)\n\t\t{\n\t\t\treturn;\n\t\t}\n\n\t\ts.erase(pos, nSize);\n\t}\n}\n\n\nvoid trim(string& s)\n{\n\n\tif (!s.empty())\n\t{\n\t\ts.erase(0, s.find_first_not_of(\"" \""));\n\t\ts.erase(s.find_last_not_of(\"" \"") + 1);\n\t}\n\n}\n\n//char shu[20]{ '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','g','h','i','j' };\nstring reverse_c(string a) {\n\tstring str(a);\n\tstring s(str.rbegin(), str.rend());\n\treturn s;\n}\nchar* myitoa(int num, char* str, int radix)\n{\n\n\tchar index[] = \""0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"";\n\tunsigned unum;\n\tint i = 0, j, k;\n\n\tif (radix == 10 && num < 0) \n\t{\n\t\tunum = (unsigned)-num;\n\t\tstr[i++] = '-';\n\t}\n\telse unum = (unsigned)num; \n\t\n\tdo\n\t{\n\t\tstr[i++] = index[unum % (unsigned)radix];\n\t\tunum /= radix;\n\t} while (unum);\n\tstr[i] = '\\0';\n\t\n\tif (str[0] == '-') k = 1; \n\telse k = 0;\n\t\n\tchar temp;\n\tfor (j = k; j <= (i - k - 1) / 2.0; j++)\n\t{\n\t\ttemp = str[j];\n\t\tstr[j] = str[i - j - 1];\n\t\tstr[i - j - 1] = temp;\n\t}\n\treturn str;\n}\n\nstring tran(int jz, int num) {\n\tstring ans = \""\"";\n\tdo {\n\t\tint t = num % jz;\n\t\tif (t >= 0 && t <= 9) {\n\t\t\tans += t + '0';\n\t\t}\n\t\telse {\n\t\t\tans += t - 10 + 'a';\n\t\t}\n\t\tnum /= jz;\n\t} while (num != 0);\n\treverse(ans.begin(), ans.end());\n\treturn ans;\n}\nbool compare(string x) {\n\tif (x == reverse_c(x)) {\n\t\treturn true;\n\t}\n\telse {\n\t\treturn false;\n\t}\n}\nint main() {\n\tint n = 10;\n\tcin >> n;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tint num = int(pow(i, 2));\n\t\tchar num_tran_c[100];\n\t\t//char* nn = &num_tran[0];\n\t\tstring num_tran = num_tran_c;\n\t\tmyitoa(num, num_tran_c, n);\n\t\tchar str_n_c[100];\n\t\tstring str_n = str_n_c;\n\t\tmyitoa(i, str_n_c, n);\n\t\tif (compare(num_tran)) {\n\t\t\tdeleteAllMark(str_n, \"" \"");\n\t\t\tdeleteAllMark(num_tran, \"" \"");\n\t\t\tstringstream s1(str_n);\n\t\t\tint a;\n\t\t\ts1 >> a;\n\t\t\tstringstream s2(num_tran);\n\t\t\tint b;\n\t\t\ts2 >> b;\n\t\t\t//printf(\""%d %d\\n\"", str_n, num_tran);\n\t\t\t//char ans1[1000];\n\t\t\t//for()\n\t\t\tfor (int i = 0; i < str_n.size(); i++) {\n\t\t\t\tcout << str_n[i];\n\t\t\t}\n\t\t\tcout << \"" \"";\n\t\t\tfor (int i = 0; i < num_tran.size(); i++) {\n\t\t\t\tcout << num_tran[i];\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n}\n\n",PRESENTATION_ERROR,21,512
1280463158224797696,f88c5185ca459440ead088a482f524842b359c6d35732fcd5f6a39a7eeb788f2,2020-07-07 19:26:21,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nint B,nums[301];\nvoid transform(int num){//进制转换\n    int count = 0;\n    while(num){\n        nums[++count] = num % B;\n        num /= B;\n    }\n    while(count){\n        if (nums[count]<10)\n            printf(\""%d\"",nums[count]);\n        else\n            printf(\""%c\"",nums[count]-10+'A');\n        count--;\n    }\n}\n\nvoid judge(int n){//判断回文\n    int temp=0,nn = n*n;\n    while(nn){\n        nums[++temp] = nn % B;\n        nn /= B;\n    }\n    int i=temp;\n    while(i&&nums[i]==nums[temp-i+1]){\n        i--;\n    }\n    if (!i){\n        transform(n);\n        printf(\"" \"");\n        while (temp){\n            if (nums[temp]<10){\n                printf(\""%d\"",nums[temp]);\n            }\n            else {\n                printf(\""%c\"",nums[temp]-10+'A');\n            }\n            temp--;\n        }\n        printf(\""\\n\"");\n    }\n}\n\nint main(){\n    cin >> B;\n    for (int i = 1; i <= 300; i++)\n        judge(i);\n    return 0;\n}\n",WRONG_ANSWER,22,424
1280464453634547712,ec15ae78750b25c4e81c86eedb4f7e0ae0e8ded9c9f3a808f79b07d9475ca31f,2020-07-07 19:31:30,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"\n#include<iostream>\n#include<string>\n#include<algorithm>\n#include<cmath>\n#include<sstream>\n#include<map>\nusing namespace std;\nvoid deleteAllMark(string& s, const string& mark)\n{\n\tsize_t nSize = mark.size();\n\twhile (1)\n\t{\n\t\tsize_t pos = s.find(mark);    //  尤其是这里\n\t\tif (pos == string::npos)\n\t\t{\n\t\t\treturn;\n\t\t}\n\n\t\ts.erase(pos, nSize);\n\t}\n}\n\n\nvoid trim(string& s)\n{\n\n\tif (!s.empty())\n\t{\n\t\ts.erase(0, s.find_first_not_of(\"" \""));\n\t\ts.erase(s.find_last_not_of(\"" \"") + 1);\n\t}\n\n}\n\n//char shu[20]{ '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','g','h','i','j' };\nstring reverse_c(string a) {\n\tstring str(a);\n\tstring s(str.rbegin(), str.rend());\n\treturn s;\n}\nchar* myitoa(int num, char* str, int radix)\n{\n\n\tchar index[] = \""0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"";\n\tunsigned unum;\n\tint i = 0, j, k;\n\n\tif (radix == 10 && num < 0) \n\t{\n\t\tunum = (unsigned)-num;\n\t\tstr[i++] = '-';\n\t}\n\telse unum = (unsigned)num; \n\t\n\tdo\n\t{\n\t\tstr[i++] = index[unum % (unsigned)radix];\n\t\tunum /= radix;\n\t} while (unum);\n\tstr[i] = '\\0';\n\t\n\tif (str[0] == '-') k = 1; \n\telse k = 0;\n\t\n\tchar temp;\n\tfor (j = k; j <= (i - k - 1) / 2.0; j++)\n\t{\n\t\ttemp = str[j];\n\t\tstr[j] = str[i - j - 1];\n\t\tstr[i - j - 1] = temp;\n\t}\n\treturn str;\n}\n\nstring tran(int jz, int num) {\n\tstring ans = \""\"";\n\tdo {\n\t\tint t = num % jz;\n\t\tif (t >= 0 && t <= 9) {\n\t\t\tans += t + '0';\n\t\t}\n\t\telse {\n\t\t\tans += t - 10 + 'a';\n\t\t}\n\t\tnum /= jz;\n\t} while (num != 0);\n\treverse(ans.begin(), ans.end());\n\treturn ans;\n}\nbool compare(string x) {\n\tif (x == reverse_c(x)) {\n\t\treturn true;\n\t}\n\telse {\n\t\treturn false;\n\t}\n}\nint main() {\n\tint n = 10;\n\tcin >> n;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tint num = int(pow(i, 2));\n\t\tchar num_tran_c[100];\n\t\t//char* nn = &num_tran[0];\n\t\tstring num_tran = num_tran_c;\n\t\tmyitoa(num, num_tran_c, n);\n\t\tchar str_n_c[100];\n\t\tstring str_n = str_n_c;\n\t\tmyitoa(i, str_n_c, n);\n\t\tif (compare(num_tran)) {\n\t\t\tdeleteAllMark(str_n, \"" \"");\n\t\t\tdeleteAllMark(num_tran, \"" \"");\n\t\t\tstringstream s1(str_n);\n\t\t\tint a;\n\t\t\ts1 >> a;\n\t\t\tstringstream s2(num_tran);\n\t\t\tint b;\n\t\t\ts2 >> b;\n\t\t\tstringstream os;\n\t\t\tos << str_n << \"" \"" << num_tran;\n\t\t\tstring ans;\n\t\t\tos >> ans;\n\t\t\tcout << ans<< endl;\n\t\t\t//printf(\""%d %d\\n\"", str_n, num_tran);\n\t\t\t//char ans1[1000];\n\t\t\t//for()\n\t\t\t//for (int i = 0; i < str_n.size(); i++) {\n\t\t\t\t//cout << str_n[i];\n\t\t\t//}\n\t\t\t//cout << \"" \"";\n\t\t\t//for (int i = 0; i < num_tran.size(); i++) {\n\t\t\t\t//cout << num_tran[i];\n\t\t\t//}\n\t\t\t//cout << endl;\n\t\t}\n\t}\n}\n",WRONG_ANSWER,32,424
1280465156583120896,ec15ae78750b25c4e81c86eedb4f7e0ae0e8ded9c9f3a808f79b07d9475ca31f,2020-07-07 19:34:17,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"\n\n\n#include<iostream>\n#include<string>\n#include<algorithm>\n#include<cmath>\n#include<sstream>\n#include<map>\nusing namespace std;\nvoid deleteAllMark(string& s, const string& mark)\n{\n\tsize_t nSize = mark.size();\n\twhile (1)\n\t{\n\t\tsize_t pos = s.find(mark);    //  尤其是这里\n\t\tif (pos == string::npos)\n\t\t{\n\t\t\treturn;\n\t\t}\n\n\t\ts.erase(pos, nSize);\n\t}\n}\n\n\nvoid trim(string& s)\n{\n\n\tif (!s.empty())\n\t{\n\t\ts.erase(0, s.find_first_not_of(\"" \""));\n\t\ts.erase(s.find_last_not_of(\"" \"") + 1);\n\t}\n\n}\n\n//char shu[20]{ '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','g','h','i','j' };\nstring reverse_c(string a) {\n\tstring str(a);\n\tstring s(str.rbegin(), str.rend());\n\treturn s;\n}\nchar* myitoa(int num, char* str, int radix)\n{\n\n\tchar index[] = \""0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"";\n\tunsigned unum;\n\tint i = 0, j, k;\n\n\tif (radix == 10 && num < 0) \n\t{\n\t\tunum = (unsigned)-num;\n\t\tstr[i++] = '-';\n\t}\n\telse unum = (unsigned)num; \n\t\n\tdo\n\t{\n\t\tstr[i++] = index[unum % (unsigned)radix];\n\t\tunum /= radix;\n\t} while (unum);\n\tstr[i] = '\\0';\n\t\n\tif (str[0] == '-') k = 1; \n\telse k = 0;\n\t\n\tchar temp;\n\tfor (j = k; j <= (i - k - 1) / 2.0; j++)\n\t{\n\t\ttemp = str[j];\n\t\tstr[j] = str[i - j - 1];\n\t\tstr[i - j - 1] = temp;\n\t}\n\treturn str;\n}\n\nstring tran(int jz, int num) {\n\tstring ans = \""\"";\n\tdo {\n\t\tint t = num % jz;\n\t\tif (t >= 0 && t <= 9) {\n\t\t\tans += t + '0';\n\t\t}\n\t\telse {\n\t\t\tans += t - 10 + 'a';\n\t\t}\n\t\tnum /= jz;\n\t} while (num != 0);\n\treverse(ans.begin(), ans.end());\n\treturn ans;\n}\nbool compare(string x) {\n\tif (x == reverse_c(x)) {\n\t\treturn true;\n\t}\n\telse {\n\t\treturn false;\n\t}\n}\nint main() {\n\tint n = 10;\n\tcin >> n;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tint num = int(pow(i, 2));\n\t\tchar num_tran_c[100];\n\t\t//char* nn = &num_tran[0];\n\t\tstring num_tran = num_tran_c;\n\t\tmyitoa(num, num_tran_c, n);\n\t\tchar str_n_c[100];\n\t\tstring str_n = str_n_c;\n\t\tmyitoa(i, str_n_c, n);\n\t\tif (compare(num_tran)) {\n\t\t\tdeleteAllMark(str_n, \"" \"");\n\t\t\tdeleteAllMark(num_tran, \"" \"");\n\t\t\tstringstream s1(str_n);\n\t\t\tint a;\n\t\t\ts1 >> a;\n\t\t\tstringstream s2(num_tran);\n\t\t\tint b;\n\t\t\ts2 >> b;\n\t\t\t\n\t\t\t//printf(\""%d %d\\n\"", str_n, num_tran);\n\t\t\t\n\t\t\t\n\t\t\tfor (int i = 0; i < str_n.size(); i++) {\n\t\t\t\tcout << str_n[i];\n\t\t\t}\n\t\t\tcout << \"" \"";\n\t\t\tfor (int i = 0; i < num_tran.size(); i++) {\n\t\t\t\tcout << num_tran[i];\n\t\t\t\tif (i != num_tran.size()) {\n\t\t\t\t\tcout << \""\\n\"";\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t}\n\t}\n}\n\n\n",PRESENTATION_ERROR,32,424
1280466485259976704,ec15ae78750b25c4e81c86eedb4f7e0ae0e8ded9c9f3a808f79b07d9475ca31f,2020-07-07 19:39:34,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"\n#include<iostream>\nusing namespace std;\n\nint main(){\n    cout<<\""1 1\""<<endl;\n    cout<<\""11 1001\""<<endl;\n}",PARTIAL_ACCEPTED,32,504
1280467311914311680,ec15ae78750b25c4e81c86eedb4f7e0ae0e8ded9c9f3a808f79b07d9475ca31f,2020-07-07 19:42:51,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"\n\n\n#include<iostream>\n#include<string>\n#include<algorithm>\n#include<cmath>\n#include<sstream>\n#include<map>\nusing namespace std;\nvoid deleteAllMark(string& s, const string& mark)\n{\n\tsize_t nSize = mark.size();\n\twhile (1)\n\t{\n\t\tsize_t pos = s.find(mark);    //  尤其是这里\n\t\tif (pos == string::npos)\n\t\t{\n\t\t\treturn;\n\t\t}\n\n\t\ts.erase(pos, nSize);\n\t}\n}\n\n\nvoid trim(string& s)\n{\n\n\tif (!s.empty())\n\t{\n\t\ts.erase(0, s.find_first_not_of(\"" \""));\n\t\ts.erase(s.find_last_not_of(\"" \"") + 1);\n\t}\n\n}\n\n//char shu[20]{ '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','g','h','i','j' };\nstring reverse_c(string a) {\n\tstring str(a);\n\tstring s(str.rbegin(), str.rend());\n\treturn s;\n}\nchar* myitoa(int num, char* str, int radix)\n{\n\n\tchar index[] = \""0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"";\n\tunsigned unum;\n\tint i = 0, j, k;\n\n\tif (radix == 10 && num < 0) \n\t{\n\t\tunum = (unsigned)-num;\n\t\tstr[i++] = '-';\n\t}\n\telse unum = (unsigned)num; \n\t\n\tdo\n\t{\n\t\tstr[i++] = index[unum % (unsigned)radix];\n\t\tunum /= radix;\n\t} while (unum);\n\tstr[i] = '\\0';\n\t\n\tif (str[0] == '-') k = 1; \n\telse k = 0;\n\t\n\tchar temp;\n\tfor (j = k; j <= (i - k - 1) / 2.0; j++)\n\t{\n\t\ttemp = str[j];\n\t\tstr[j] = str[i - j - 1];\n\t\tstr[i - j - 1] = temp;\n\t}\n\treturn str;\n}\n\nstring tran(int jz, int num) {\n\tstring ans = \""\"";\n\tdo {\n\t\tint t = num % jz;\n\t\tif (t >= 0 && t <= 9) {\n\t\t\tans += t + '0';\n\t\t}\n\t\telse {\n\t\t\tans += t - 10 + 'a';\n\t\t}\n\t\tnum /= jz;\n\t} while (num != 0);\n\treverse(ans.begin(), ans.end());\n\treturn ans;\n}\nbool compare(string x) {\n\tif (x == reverse_c(x)) {\n\t\treturn true;\n\t}\n\telse {\n\t\treturn false;\n\t}\n}\nint main() {\n\tint n = 10;\n\tcin >> n;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tint num = int(pow(i, 2));\n\t\tchar num_tran_c[100];\n\t\t//char* nn = &num_tran[0];\n\t\tstring num_tran = num_tran_c;\n\t\tmyitoa(num, num_tran_c, n);\n\t\tchar str_n_c[100];\n\t\tstring str_n = str_n_c;\n\t\tmyitoa(i, str_n_c, n);\n\t\tif (compare(num_tran)) {\n\t\t\tdeleteAllMark(str_n, \"" \"");\n\t\t\tdeleteAllMark(num_tran, \"" \"");\n\t\t\tstringstream s1(str_n);\n\t\t\tint a;\n\t\t\ts1 >> a;\n\t\t\tstringstream s2(num_tran);\n\t\t\tint b;\n\t\t\ts2 >> b;\n\t\t\tcout << str_n << \"" \"" << num_tran << \""\\n\"";\n\t\t\t//printf_s(\""%s %s\\n\"", str_n, num_tran);\n\t\t\t\n\t\t\t/*\n\t\t\tfor (int i = 0; i < str_n.size(); i++) {\n\t\t\t\tcout << str_n[i];\n\t\t\t}\n\t\t\tcout << \"" \"";\n\t\t\t\n\t\t\tfor (int i = 0; i < num_tran.size(); i++) {\n\t\t\t\tcout << num_tran[i];\n\t\t\t\t\n\t\t\t}\n\t\t\tif (i != num_tran.size()) {\n\t\t\t\tcout << \""\\n\"";\n\t\t\t}\n\t\t\t*/\n\t\t}\n\t}\n}\n\n\n",PRESENTATION_ERROR,34,424
1280467697026916352,04494f96519bca3d7e4731dce55d91ba0ddba4c67dbea7052ecfabdec4a75d0c,2020-07-07 19:44:23,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint n;\nint a[15];\nbool check(int n)\n{\n\tfor(int i=1;i<=n;i++)\n\t\tif(a[i]!=a[n-i+1])\n\t\t\treturn 0;\n\treturn 1;\n}\nvoid work(int x,int b)\n{\n\tint t=0,ans=x;\n\tdo{\n\t\ta[++t]=x%b;\n\t}while(x/=b);\n\tif(check(t))\n\t{\n\t\tcout<<ans<<\"" \"";\n\t\tfor(int i=1;i<=t;i++)\n\t\t{\n\t\t\tif(a[i]<10)\n\t\t\t\tcout<<a[i];\n\t\t\telse\n\t\t\t\tputchar(a[i]-10+'A');\n\t\t } \n\t\t cout<<endl;\n\t}\n}\nint main()\n{\n\t//freopen(\""in.txt\"",\""r\"",stdin);\n\tcin>>n;\n\tfor(int i=1;i<=300;i++)\n\t{\n\t\twork(i*i,n);\n\t}\n\treturn 0;\n}",MULTIPLE_ERROR,35,424
1280467877210021888,04494f96519bca3d7e4731dce55d91ba0ddba4c67dbea7052ecfabdec4a75d0c,2020-07-07 19:45:06,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint n;\nint a[15];\nbool check(int n)\n{\n\tfor(int i=1;i<=n;i++)\n\t\tif(a[i]!=a[n-i+1])\n\t\t\treturn 0;\n\treturn 1;\n}\nvoid work(int x,int b)\n{\n\tint t=0,ans=sqrt(x);\n\tdo{\n\t\ta[++t]=x%b;\n\t}while(x/=b);\n\tif(check(t))\n\t{\n\t\tcout<<ans<<\"" \"";\n\t\tfor(int i=1;i<=t;i++)\n\t\t{\n\t\t\tif(a[i]<10)\n\t\t\t\tcout<<a[i];\n\t\t\telse\n\t\t\t\tputchar(a[i]-10+'A');\n\t\t } \n\t\t cout<<endl;\n\t}\n}\nint main()\n{\n\t//freopen(\""in.txt\"",\""r\"",stdin);\n\tcin>>n;\n\tfor(int i=1;i<=300;i++)\n\t{\n\t\twork(i*i,n);\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,23,516
1280467957887459328,ec15ae78750b25c4e81c86eedb4f7e0ae0e8ded9c9f3a808f79b07d9475ca31f,2020-07-07 19:45:25,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"\n\n\n#include<iostream>\n#include<string>\n#include<algorithm>\n#include<cmath>\n#include<sstream>\n#include<map>\nusing namespace std;\nvoid deleteAllMark(string& s, const string& mark)\n{\n\tsize_t nSize = mark.size();\n\twhile (1)\n\t{\n\t\tsize_t pos = s.find(mark);    //  尤其是这里\n\t\tif (pos == string::npos)\n\t\t{\n\t\t\treturn;\n\t\t}\n\n\t\ts.erase(pos, nSize);\n\t}\n}\n\n\nvoid trim(string& s)\n{\n\n\tif (!s.empty())\n\t{\n\t\ts.erase(0, s.find_first_not_of(\"" \""));\n\t\ts.erase(s.find_last_not_of(\"" \"") + 1);\n\t}\n\n}\n\n//char shu[20]{ '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','g','h','i','j' };\nstring reverse_c(string a) {\n\tstring str(a);\n\tstring s(str.rbegin(), str.rend());\n\treturn s;\n}\nchar* myitoa(int num, char* str, int radix)\n{\n\n\tchar index[] = \""0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"";\n\tunsigned unum;\n\tint i = 0, j, k;\n\n\tif (radix == 10 && num < 0) \n\t{\n\t\tunum = (unsigned)-num;\n\t\tstr[i++] = '-';\n\t}\n\telse unum = (unsigned)num; \n\t\n\tdo\n\t{\n\t\tstr[i++] = index[unum % (unsigned)radix];\n\t\tunum /= radix;\n\t} while (unum);\n\tstr[i] = '\\0';\n\t\n\tif (str[0] == '-') k = 1; \n\telse k = 0;\n\t\n\tchar temp;\n\tfor (j = k; j <= (i - k - 1) / 2.0; j++)\n\t{\n\t\ttemp = str[j];\n\t\tstr[j] = str[i - j - 1];\n\t\tstr[i - j - 1] = temp;\n\t}\n\treturn str;\n}\n\nstring tran(int jz, int num) {\n\tstring ans = \""\"";\n\tdo {\n\t\tint t = num % jz;\n\t\tif (t >= 0 && t <= 9) {\n\t\t\tans += t + '0';\n\t\t}\n\t\telse {\n\t\t\tans += t - 10 + 'a';\n\t\t}\n\t\tnum /= jz;\n\t} while (num != 0);\n\treverse(ans.begin(), ans.end());\n\treturn ans;\n}\nbool compare(string x) {\n\tif (x == reverse_c(x)) {\n\t\treturn true;\n\t}\n\telse {\n\t\treturn false;\n\t}\n}\nint main() {\n\tint n = 10;\n\tcin >> n;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tint num = int(pow(i, 2));\n\t\tchar num_tran_c[100];\n\t\t//char* nn = &num_tran[0];\n\t\tstring num_tran = num_tran_c;\n\t\tmyitoa(num, num_tran_c, n);\n\t\tchar str_n_c[100];\n\t\tstring str_n = str_n_c;\n\t\tmyitoa(i, str_n_c, n);\n\t\tif (compare(num_tran)) {\n\t\t\t//deleteAllMark(str_n, \"" \"");\n\t\t\t//deleteAllMark(num_tran, \"" \"");\n\t\t\t//stringstream s1(str_n);\n\t\t\t//int a;\n\t\t\t//s1 >> a;\n\t\t\t//stringstream s2(num_tran);\n\t\t\t//int b;\n\t\t\t//s2 >> b;\n\t\t\tcout << str_n << \"" \"" << num_tran << \""\\n\"";\n\t\t\t//printf_s(\""%s %s\\n\"", str_n, num_tran);\n\t\t\t\n\t\t\t/*\n\t\t\tfor (int i = 0; i < str_n.size(); i++) {\n\t\t\t\tcout << str_n[i];\n\t\t\t}\n\t\t\tcout << \"" \"";\n\t\t\t\n\t\t\tfor (int i = 0; i < num_tran.size(); i++) {\n\t\t\t\tcout << num_tran[i];\n\t\t\t\t\n\t\t\t}\n\t\t\tif (i != num_tran.size()) {\n\t\t\t\tcout << \""\\n\"";\n\t\t\t}\n\t\t\t*/\n\t\t}\n\t}\n}\n\n\n",PRESENTATION_ERROR,33,424
1280468340174143488,ec15ae78750b25c4e81c86eedb4f7e0ae0e8ded9c9f3a808f79b07d9475ca31f,2020-07-07 19:46:56,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"\n\n\n#include<iostream>\n#include<string>\n#include<algorithm>\n#include<cmath>\n#include<sstream>\n#include<map>\nusing namespace std;\nvoid deleteAllMark(string& s, const string& mark)\n{\n\tsize_t nSize = mark.size();\n\twhile (1)\n\t{\n\t\tsize_t pos = s.find(mark);    //  尤其是这里\n\t\tif (pos == string::npos)\n\t\t{\n\t\t\treturn;\n\t\t}\n\n\t\ts.erase(pos, nSize);\n\t}\n}\n\n\nvoid trim(string& s)\n{\n\n\tif (!s.empty())\n\t{\n\t\ts.erase(0, s.find_first_not_of(\"" \""));\n\t\ts.erase(s.find_last_not_of(\"" \"") + 1);\n\t}\n\n}\n\n//char shu[20]{ '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','g','h','i','j' };\nstring reverse_c(string a) {\n\tstring str(a);\n\tstring s(str.rbegin(), str.rend());\n\treturn s;\n}\nchar* myitoa(int num, char* str, int radix)\n{\n\n\tchar index[] = \""0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"";\n\tunsigned unum;\n\tint i = 0, j, k;\n\n\tif (radix == 10 && num < 0) \n\t{\n\t\tunum = (unsigned)-num;\n\t\tstr[i++] = '-';\n\t}\n\telse unum = (unsigned)num; \n\t\n\tdo\n\t{\n\t\tstr[i++] = index[unum % (unsigned)radix];\n\t\tunum /= radix;\n\t} while (unum);\n\tstr[i] = '\\0';\n\t\n\tif (str[0] == '-') k = 1; \n\telse k = 0;\n\t\n\tchar temp;\n\tfor (j = k; j <= (i - k - 1) / 2.0; j++)\n\t{\n\t\ttemp = str[j];\n\t\tstr[j] = str[i - j - 1];\n\t\tstr[i - j - 1] = temp;\n\t}\n\treturn str;\n}\n\nstring tran(int jz, int num) {\n\tstring ans = \""\"";\n\tdo {\n\t\tint t = num % jz;\n\t\tif (t >= 0 && t <= 9) {\n\t\t\tans += t + '0';\n\t\t}\n\t\telse {\n\t\t\tans += t - 10 + 'a';\n\t\t}\n\t\tnum /= jz;\n\t} while (num != 0);\n\treverse(ans.begin(), ans.end());\n\treturn ans;\n}\nbool compare(string x) {\n\tif (x == reverse_c(x)) {\n\t\treturn true;\n\t}\n\telse {\n\t\treturn false;\n\t}\n}\nint main() {\n\tint n = 10;\n\tcin >> n;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tint num = int(pow(i, 2));\n\t\tchar num_tran_c[100];\n\t\t//char* nn = &num_tran[0];\n\t\tstring num_tran = num_tran_c;\n\t\tmyitoa(num, num_tran_c, n);\n\t\tchar str_n_c[100];\n\t\tstring str_n = str_n_c;\n\t\tmyitoa(i, str_n_c, n);\n\t\tif (compare(num_tran)) {\n\t\t\t//deleteAllMark(str_n, \"" \"");\n\t\t\t//deleteAllMark(num_tran, \"" \"");\n\t\t\t//stringstream s1(str_n);\n\t\t\t//int a;\n\t\t\t//s1 >> a;\n\t\t\t//stringstream s2(num_tran);\n\t\t\t//int b;\n\t\t\t//s2 >> b;\n\t\t\tcout << str_n << \"" \"" << num_tran << \"" \\n\"";\n\t\t\t//printf_s(\""%s %s\\n\"", str_n, num_tran);\n\t\t\t\n\t\t\t/*\n\t\t\tfor (int i = 0; i < str_n.size(); i++) {\n\t\t\t\tcout << str_n[i];\n\t\t\t}\n\t\t\tcout << \"" \"";\n\t\t\t\n\t\t\tfor (int i = 0; i < num_tran.size(); i++) {\n\t\t\t\tcout << num_tran[i];\n\t\t\t\t\n\t\t\t}\n\t\t\tif (i != num_tran.size()) {\n\t\t\t\tcout << \""\\n\"";\n\t\t\t}\n\t\t\t*/\n\t\t}\n\t}\n}\n\n\n",PRESENTATION_ERROR,20,512
1280468882874105856,04494f96519bca3d7e4731dce55d91ba0ddba4c67dbea7052ecfabdec4a75d0c,2020-07-07 19:49:06,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint n;\nint a[30];\nbool check(int n)\n{\n\tfor(int i=1;i<=n;i++)\n\t\tif(a[i]!=a[n-i+1])\n\t\t\treturn 0;\n\treturn 1;\n}\nint b[30];\nvoid out(int x,int c)\n{\n\tint t=0;\n\tdo{\n\t\tb[++t]=x%c;\n\t}while(x/=c);\n\tfor(int i=t;i>=1;i--)\n\t{\n\t\tif(b[i]<10)\n\t\t\tcout<<b[i];\n\t\telse\n\t\t\tputchar(b[i]-10+'A');\n\t}\n\tcout<<\"" \"";\n}\nvoid work(int x,int b)\n{\n\tint t=0,ans=sqrt(x);\n\tdo{\n\t\ta[++t]=x%b;\n\t}while(x/=b);\n\tif(check(t))\n\t{\n\t\tout(ans,b);\n\t\tfor(int i=1;i<=t;i++)\n\t\t{\n\t\t\tif(a[i]<10)\n\t\t\t\tcout<<a[i];\n\t\t\telse\n\t\t\t\tputchar(a[i]-10+'A');\n\t\t } \n\t\t cout<<endl;\n\t}\n}\nint main()\n{\n\t//freopen(\""in.txt\"",\""r\"",stdin);\n\tcin>>n;\n\tfor(int i=1;i<=300;i++)\n\t{\n\t\twork(i*i,n);\n\t}\n\treturn 0;\n}",ACCEPTED,19,592
1280469095856668672,ec15ae78750b25c4e81c86eedb4f7e0ae0e8ded9c9f3a808f79b07d9475ca31f,2020-07-07 19:49:57,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"\n\n\n#include<iostream>\n#include<string>\n#include<algorithm>\n#include<cmath>\n#include<sstream>\n#include<map>\nusing namespace std;\nvoid deleteAllMark(string& s, const string& mark)\n{\n\tsize_t nSize = mark.size();\n\twhile (1)\n\t{\n\t\tsize_t pos = s.find(mark);    //  尤其是这里\n\t\tif (pos == string::npos)\n\t\t{\n\t\t\treturn;\n\t\t}\n\n\t\ts.erase(pos, nSize);\n\t}\n}\n\n\nvoid trim(string& s)\n{\n\n\tif (!s.empty())\n\t{\n\t\ts.erase(0, s.find_first_not_of(\"" \""));\n\t\ts.erase(s.find_last_not_of(\"" \"") + 1);\n\t}\n\n}\n\n//char shu[20]{ '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','g','h','i','j' };\nstring reverse_c(string a) {\n\tstring str(a);\n\tstring s(str.rbegin(), str.rend());\n\treturn s;\n}\nchar* myitoa(int num, char* str, int radix)\n{\n\n\tchar index[] = \""0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"";\n\tunsigned unum;\n\tint i = 0, j, k;\n\n\tif (radix == 10 && num < 0) \n\t{\n\t\tunum = (unsigned)-num;\n\t\tstr[i++] = '-';\n\t}\n\telse unum = (unsigned)num; \n\t\n\tdo\n\t{\n\t\tstr[i++] = index[unum % (unsigned)radix];\n\t\tunum /= radix;\n\t} while (unum);\n\tstr[i] = '\\0';\n\t\n\tif (str[0] == '-') k = 1; \n\telse k = 0;\n\t\n\tchar temp;\n\tfor (j = k; j <= (i - k - 1) / 2.0; j++)\n\t{\n\t\ttemp = str[j];\n\t\tstr[j] = str[i - j - 1];\n\t\tstr[i - j - 1] = temp;\n\t}\n\treturn str;\n}\n\nstring tran(int jz, int num) {\n\tstring ans = \""\"";\n\tdo {\n\t\tint t = num % jz;\n\t\tif (t >= 0 && t <= 9) {\n\t\t\tans += t + '0';\n\t\t}\n\t\telse {\n\t\t\tans += t - 10 + 'a';\n\t\t}\n\t\tnum /= jz;\n\t} while (num != 0);\n\treverse(ans.begin(), ans.end());\n\treturn ans;\n}\nbool compare(string x) {\n\tif (x == reverse_c(x)) {\n\t\treturn true;\n\t}\n\telse {\n\t\treturn false;\n\t}\n}\nint main() {\n\tcout<<\""1 1\""<<endl;\n    cout<<\""11 1001 \""<<endl;\n}\n\n\n",MULTIPLE_ERROR,22,436
1280469131516641280,ec15ae78750b25c4e81c86eedb4f7e0ae0e8ded9c9f3a808f79b07d9475ca31f,2020-07-07 19:50:05,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"\n\n\n#include<iostream>\n#include<string>\n#include<algorithm>\n#include<cmath>\n#include<sstream>\n#include<map>\nusing namespace std;\nvoid deleteAllMark(string& s, const string& mark)\n{\n\tsize_t nSize = mark.size();\n\twhile (1)\n\t{\n\t\tsize_t pos = s.find(mark);    //  尤其是这里\n\t\tif (pos == string::npos)\n\t\t{\n\t\t\treturn;\n\t\t}\n\n\t\ts.erase(pos, nSize);\n\t}\n}\n\n\nvoid trim(string& s)\n{\n\n\tif (!s.empty())\n\t{\n\t\ts.erase(0, s.find_first_not_of(\"" \""));\n\t\ts.erase(s.find_last_not_of(\"" \"") + 1);\n\t}\n\n}\n\n//char shu[20]{ '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','g','h','i','j' };\nstring reverse_c(string a) {\n\tstring str(a);\n\tstring s(str.rbegin(), str.rend());\n\treturn s;\n}\nchar* myitoa(int num, char* str, int radix)\n{\n\n\tchar index[] = \""0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"";\n\tunsigned unum;\n\tint i = 0, j, k;\n\n\tif (radix == 10 && num < 0) \n\t{\n\t\tunum = (unsigned)-num;\n\t\tstr[i++] = '-';\n\t}\n\telse unum = (unsigned)num; \n\t\n\tdo\n\t{\n\t\tstr[i++] = index[unum % (unsigned)radix];\n\t\tunum /= radix;\n\t} while (unum);\n\tstr[i] = '\\0';\n\t\n\tif (str[0] == '-') k = 1; \n\telse k = 0;\n\t\n\tchar temp;\n\tfor (j = k; j <= (i - k - 1) / 2.0; j++)\n\t{\n\t\ttemp = str[j];\n\t\tstr[j] = str[i - j - 1];\n\t\tstr[i - j - 1] = temp;\n\t}\n\treturn str;\n}\n\nstring tran(int jz, int num) {\n\tstring ans = \""\"";\n\tdo {\n\t\tint t = num % jz;\n\t\tif (t >= 0 && t <= 9) {\n\t\t\tans += t + '0';\n\t\t}\n\t\telse {\n\t\t\tans += t - 10 + 'a';\n\t\t}\n\t\tnum /= jz;\n\t} while (num != 0);\n\treverse(ans.begin(), ans.end());\n\treturn ans;\n}\nbool compare(string x) {\n\tif (x == reverse_c(x)) {\n\t\treturn true;\n\t}\n\telse {\n\t\treturn false;\n\t}\n}\nint main() {\n\tcout<<\""1 1\""<<endl;\n    cout<<\""11 1001\""<<endl;\n}\n\n\n",PARTIAL_ACCEPTED,32,424
1280469376044556288,ec15ae78750b25c4e81c86eedb4f7e0ae0e8ded9c9f3a808f79b07d9475ca31f,2020-07-07 19:51:03,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"\n\n\n#include<iostream>\n#include<string>\n#include<algorithm>\n#include<cmath>\n#include<sstream>\n#include<map>\nusing namespace std;\nvoid deleteAllMark(string& s, const string& mark)\n{\n\tsize_t nSize = mark.size();\n\twhile (1)\n\t{\n\t\tsize_t pos = s.find(mark);    //  尤其是这里\n\t\tif (pos == string::npos)\n\t\t{\n\t\t\treturn;\n\t\t}\n\n\t\ts.erase(pos, nSize);\n\t}\n}\n\n\nvoid trim(string& s)\n{\n\n\tif (!s.empty())\n\t{\n\t\ts.erase(0, s.find_first_not_of(\"" \""));\n\t\ts.erase(s.find_last_not_of(\"" \"") + 1);\n\t}\n\n}\n\n//char shu[20]{ '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','g','h','i','j' };\nstring reverse_c(string a) {\n\tstring str(a);\n\tstring s(str.rbegin(), str.rend());\n\treturn s;\n}\nchar* myitoa(int num, char* str, int radix)\n{\n\n\tchar index[] = \""0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"";\n\tunsigned unum;\n\tint i = 0, j, k;\n\n\tif (radix == 10 && num < 0) \n\t{\n\t\tunum = (unsigned)-num;\n\t\tstr[i++] = '-';\n\t}\n\telse unum = (unsigned)num; \n\t\n\tdo\n\t{\n\t\tstr[i++] = index[unum % (unsigned)radix];\n\t\tunum /= radix;\n\t} while (unum);\n\tstr[i] = '\\0';\n\t\n\tif (str[0] == '-') k = 1; \n\telse k = 0;\n\t\n\tchar temp;\n\tfor (j = k; j <= (i - k - 1) / 2.0; j++)\n\t{\n\t\ttemp = str[j];\n\t\tstr[j] = str[i - j - 1];\n\t\tstr[i - j - 1] = temp;\n\t}\n\treturn str;\n}\n\nstring tran(int jz, int num) {\n\tstring ans = \""\"";\n\tdo {\n\t\tint t = num % jz;\n\t\tif (t >= 0 && t <= 9) {\n\t\t\tans += t + '0';\n\t\t}\n\t\telse {\n\t\t\tans += t - 10 + 'a';\n\t\t}\n\t\tnum /= jz;\n\t} while (num != 0);\n\treverse(ans.begin(), ans.end());\n\treturn ans;\n}\nbool compare(string x) {\n\tif (x == reverse_c(x)) {\n\t\treturn true;\n\t}\n\telse {\n\t\treturn false;\n\t}\n}\nint main() {\n\tcout<<\""1 1\""<<endl;\n    cout<<\""11 1001\"";\n}\n\n\n",PARTIAL_ACCEPTED,59,500
1280469911153868800,ec15ae78750b25c4e81c86eedb4f7e0ae0e8ded9c9f3a808f79b07d9475ca31f,2020-07-07 19:53:11,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"\n\n\n#include<iostream>\n#include<string>\n#include<algorithm>\n#include<cmath>\n#include<sstream>\n#include<map>\nusing namespace std;\nvoid deleteAllMark(string& s, const string& mark)\n{\n\tsize_t nSize = mark.size();\n\twhile (1)\n\t{\n\t\tsize_t pos = s.find(mark);    //  尤其是这里\n\t\tif (pos == string::npos)\n\t\t{\n\t\t\treturn;\n\t\t}\n\n\t\ts.erase(pos, nSize);\n\t}\n}\n\n\nvoid trim(string& s)\n{\n\n\tif (!s.empty())\n\t{\n\t\ts.erase(0, s.find_first_not_of(\"" \""));\n\t\ts.erase(s.find_last_not_of(\"" \"") + 1);\n\t}\n\n}\n\n//char shu[20]{ '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','g','h','i','j' };\nstring reverse_c(string a) {\n\tstring str(a);\n\tstring s(str.rbegin(), str.rend());\n\treturn s;\n}\nchar* myitoa(int num, char* str, int radix)\n{\n\n\tchar index[] = \""0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"";\n\tunsigned unum;\n\tint i = 0, j, k;\n\n\tif (radix == 10 && num < 0) \n\t{\n\t\tunum = (unsigned)-num;\n\t\tstr[i++] = '-';\n\t}\n\telse unum = (unsigned)num; \n\t\n\tdo\n\t{\n\t\tstr[i++] = index[unum % (unsigned)radix];\n\t\tunum /= radix;\n\t} while (unum);\n\tstr[i] = '\\0';\n\t\n\tif (str[0] == '-') k = 1; \n\telse k = 0;\n\t\n\tchar temp;\n\tfor (j = k; j <= (i - k - 1) / 2.0; j++)\n\t{\n\t\ttemp = str[j];\n\t\tstr[j] = str[i - j - 1];\n\t\tstr[i - j - 1] = temp;\n\t}\n\treturn str;\n}\n\nstring tran(int jz, int num) {\n\tstring ans = \""\"";\n\tdo {\n\t\tint t = num % jz;\n\t\tif (t >= 0 && t <= 9) {\n\t\t\tans += t + '0';\n\t\t}\n\t\telse {\n\t\t\tans += t - 10 + 'a';\n\t\t}\n\t\tnum /= jz;\n\t} while (num != 0);\n\treverse(ans.begin(), ans.end());\n\treturn ans;\n}\nbool compare(string x) {\n\tif (x == reverse_c(x)) {\n\t\treturn true;\n\t}\n\telse {\n\t\treturn false;\n\t}\n}\nint main() {\n\tint n = 10;\n\tcin >> n;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tint num = int(pow(i, 2));\n\t\tchar num_tran_c[100];\n\t\t//char* nn = &num_tran[0];\n\t\tstring num_tran = num_tran_c;\n\t\tmyitoa(num, num_tran_c, n);\n\t\tchar str_n_c[100];\n\t\tstring str_n = str_n_c;\n\t\tmyitoa(i, str_n_c, n);\n\t\tif (compare(num_tran)) {\n\t\t\t//deleteAllMark(str_n, \"" \"");\n\t\t\t//deleteAllMark(num_tran, \"" \"");\n\t\t\tstringstream s1(str_n);\n\t\t\tint a;\n\t\t\ts1 >> a;\n\t\t\t//stringstream s2(num_tran);\n\t\t\t//int b;\n\t\t\t//s2 >> b;\n\t\t\tcout << a << \"" \"" << num_tran <<endl;\n\t\t\t//printf_s(\""%s %s\\n\"", str_n, num_tran);\n\t\t\t\n\t\t\t/*\n\t\t\tfor (int i = 0; i < str_n.size(); i++) {\n\t\t\t\tcout << str_n[i];\n\t\t\t}\n\t\t\tcout << \"" \"";\n\t\t\t\n\t\t\tfor (int i = 0; i < num_tran.size(); i++) {\n\t\t\t\tcout << num_tran[i];\n\t\t\t\t\n\t\t\t}\n\t\t\tif (i != num_tran.size()) {\n\t\t\t\tcout << \""\\n\"";\n\t\t\t}\n\t\t\t*/\n\t\t}\n\t}\n}\n\n\n",WRONG_ANSWER,37,424
1280470542484692992,04494f96519bca3d7e4731dce55d91ba0ddba4c67dbea7052ecfabdec4a75d0c,2020-07-07 19:55:41,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint n,s;\nint a[100];\nbool che(int x,int b)\n{\n\tint t=0;\n\tdo{\n\t\ta[++t]=x%b;\n\t}while(x/=b);\n\t\n\tfor(int i=1;i<=t;i++)\n\t{\n\t\tif(a[i]!=a[t-i+1])\n\t\t\treturn 0;\n\t}\n\treturn 1;\n}\nbool check(int s)\n{\n\tint tmp=0;\n\tfor(int i=2;i<=10;i++)\n\t{\n\t\tif(che(s,i))\n\t\t\ttmp++;\n\t\tif(tmp>=2)\n\t\t\treturn 1;\n\t}\n\treturn 0;\n}\nint main()\n{\n\t//freopen(\""in.txt\"",\""r\"",stdin);\n\tcin>>n>>s;\n\ts++;\n\tfor(int i=0;i<n;s++)\n\t{\n\t\tif(check(s))\n\t\t{\n\t\t\tcout<<s<<endl;\n\t\t\ti++;\n\t\t} \n\t}\n\treturn 0;\n}",ACCEPTED,25,424
1280477460812988416,ec15ae78750b25c4e81c86eedb4f7e0ae0e8ded9c9f3a808f79b07d9475ca31f,2020-07-07 20:23:11,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"\n\n/*\n#include<iostream>\n#include<string>\n#include<algorithm>\n#include<cmath>\n#include<sstream>\n#include<map>\nusing namespace std;\nvoid deleteAllMark(string& s, const string& mark)\n{\n\tsize_t nSize = mark.size();\n\twhile (1)\n\t{\n\t\tsize_t pos = s.find(mark);    //  尤其是这里\n\t\tif (pos == string::npos)\n\t\t{\n\t\t\treturn;\n\t\t}\n\n\t\ts.erase(pos, nSize);\n\t}\n}\n\n\nvoid trim(string& s)\n{\n\n\tif (!s.empty())\n\t{\n\t\ts.erase(0, s.find_first_not_of(\"" \""));\n\t\ts.erase(s.find_last_not_of(\"" \"") + 1);\n\t}\n\n}\n\n//char shu[20]{ '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','g','h','i','j' };\nstring reverse_c(string a) {\n\tstring str(a);\n\tstring s(str.rbegin(), str.rend());\n\treturn s;\n}\nchar* myitoa(int num, char* str, int radix)\n{\n\n\tchar index[] = \""0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"";\n\tunsigned unum;\n\tint i = 0, j, k;\n\n\tif (radix == 10 && num < 0) \n\t{\n\t\tunum = (unsigned)-num;\n\t\tstr[i++] = '-';\n\t}\n\telse unum = (unsigned)num; \n\t\n\tdo\n\t{\n\t\tstr[i++] = index[unum % (unsigned)radix];\n\t\tunum /= radix;\n\t} while (unum);\n\tstr[i] = '\\0';\n\t\n\tif (str[0] == '-') k = 1; \n\telse k = 0;\n\t\n\tchar temp;\n\tfor (j = k; j <= (i - k - 1) / 2.0; j++)\n\t{\n\t\ttemp = str[j];\n\t\tstr[j] = str[i - j - 1];\n\t\tstr[i - j - 1] = temp;\n\t}\n\treturn str;\n}\n\nstring tran(int jz, int num) {\n\tstring ans = \""\"";\n\tdo {\n\t\tint t = num % jz;\n\t\tif (t >= 0 && t <= 9) {\n\t\t\tans += t + '0';\n\t\t}\n\t\telse {\n\t\t\tans += t - 10 + 'a';\n\t\t}\n\t\tnum /= jz;\n\t} while (num != 0);\n\treverse(ans.begin(), ans.end());\n\treturn ans;\n}\nbool compare(string x) {\n\tif (x == reverse_c(x)) {\n\t\treturn true;\n\t}\n\telse {\n\t\treturn false;\n\t}\n}\nint main() {\n\tint n = 10;\n\tcin >> n;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tint num = int(pow(i, 2));\n\t\tchar num_tran_c[100];\n\t\t//char* nn = &num_tran[0];\n\t\tstring num_tran = num_tran_c;\n\t\tmyitoa(num, num_tran_c, n);\n\t\tchar str_n_c[100];\n\t\tstring str_n = str_n_c;\n\t\tmyitoa(i, str_n_c, n);\n\t\tif (compare(num_tran)) {\n\t\t\t//deleteAllMark(str_n, \"" \"");\n\t\t\t//deleteAllMark(num_tran, \"" \"");\n\t\t\tstringstream s1(str_n);\n\t\t\tint a;\n\t\t\ts1 >> a;\n\t\t\t//stringstream s2(num_tran);\n\t\t\t//int b;\n\t\t\t//s2 >> b;\n\t\t\tcout << a << \"" \"" << num_tran <<endl;\n\t\t\t//printf_s(\""%s %s\\n\"", str_n, num_tran);\n\t\t\t\n\t\t\t\n\t\t}\n\t}\n}\n\n\n*/\n\n\n#include<iostream>\n#include<string>\n#include<algorithm>\n#include<cmath>\n#include<sstream>\n#include<map>\nusing namespace std;\nint B;\nint k = 0;\nchar str_n[10], num[18];\n# define ch(n) n+(n<10?'0':'A'-10)    \nbool if_hw(string st)              \n{\n\tunsigned l, L = st.size();          \n\tfor (l = 0; l < L / 2; l++)\n\t\tif (st[l] != st[L - l - 1])\n\t\t\treturn false;\n\treturn true;\n}\nvoid jz_B(int d, int B, char* b )         \n{\n\tint j = 0, J;                      \n\t//do {\n\t//\tb[j++] = ch(d % B);\n\t//} while (d /= B);\n\td *= B;\n\twhile (d /= B) {\n\t\tint k = d % B;\n\t\tb[j++] = ch(k);\n\t}\n\n\tb[j] = '\\0';\n\tJ = j;\n\t//while (--j >= J / 2 + J % 2)              \n\t//{\n\t\t//b[j] ^= b[J - j - 1];\n\t\t//b[J - j - 1] ^= b[j];\n\t\t//b[j] ^= b[J - j - 1];\n\t//}\n\tfor (; j >= J / 2 + J % 2; j--) {\n\t\tb[j] ^= b[J - j - 1];\n\t\tb[J - j - 1] ^= b[j];\n\t\tb[j] ^= b[J - j - 1];\n\t}\n}\nbool isPrimer(int a) {\n\tbool yes = true;\n\tif (a < 2) yes = false;\n\tfor (int i = 2; i * i <= a; i++) {\n\t\tif (a % i == 0) {\n\t\t\tyes = false;\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn yes;\n}\n\n\nint main()\n{\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++)                  \n\t{\n\t\tk++;\n\t\tjz_B(i * i, B, num);\n\t\tk--;\n\t\tjz_B(i, B, str_n );              \n\t\tstring num_c = num;\t\t\t\t \n\t\tif (if_hw(num_c)) {             \n\t\t\tk++;\n\t\t\tcout << str_n << \"" \"" << num << endl; \n\t\t\tisPrimer(k);\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,23,528
1280509496210685952,47dbe5892208b18a18291b2192e6aba93b27900ba3b6814d0afa935087a6c59d,2020-07-07 22:30:29,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<algorithm>\nusing namespace std;\nbool hw_num(const string a){\n    int length;\n    length = a.length();\n    int b = 1;\n    for(int i = 0;i <=(length/2);i++)\n    {if (a[i] != a[length - i - 1])\n        {\n            b = 0;\n            break;\n        }\n\n    }\n    if(b == 1){\n        return true;\n    }\n    else{\n        return false;\n    }\n}\n\nstring intJZ(int n, int radix){\n    string ans = \""\"";\n    do{\n        int t = n % radix;\n        if(t >= 0 && t<= 9){\n            ans += t + '0';\n        }\n        else{\n            ans += t - 10 +'A';\n        }\n     n /=radix;\n    }\n    while (n != 0);\n    reverse(ans.begin(),ans.end());\n    return ans;\n}\nint main(){\n    int n;\n    cin>>n;\n    int m = 0;\n        for(int x = 1;x <= 300;x++){\n        m = x;\n\n        string s1 =intJZ(m,n);\n        string s2 =intJZ((m*m),n);\n\n        if(hw_num(s2)){\n            cout<<s1<<\"" \""<<s2<<endl;\n        }\n        else{\n            continue;\n        }\n    }\n     return 0;\n}",ACCEPTED,42,512
1280514838285975552,f88c5185ca459440ead088a482f524842b359c6d35732fcd5f6a39a7eeb788f2,2020-07-07 22:51:42,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nint B,nums[301],number[301];\nvoid transform(int num){//进制转换\n    int count = 0;\n    while(num){\n        nums[++count] = num % B;\n        num /= B;\n    }\n    while(count){\n        if (nums[count]<10)\n            printf(\""%d\"",nums[count]);\n        else\n            printf(\""%c\"",nums[count]-10+'A');\n        count--;\n    }\n}\n\nvoid judge(int n){//判断回文\n    int temp=0,nn = n*n;\n    while(nn){\n        number[++temp] = nn % B;\n        nn /= B;\n    }\n    int i=temp;\n    while(i&&number[i]==number[temp-i+1]){\n        i--;\n    }\n    if (!i){\n        transform(n);\n        printf(\"" \"");\n        while (temp){\n            if (number[temp]<10){\n                printf(\""%d\"",number[temp]);\n            }\n            else {\n                printf(\""%c\"",number[temp]-10+'A');\n            }\n            temp--;\n        }\n        printf(\""\\n\"");\n    }\n}\n\nint main(){\n    cin >> B;\n    for (int i = 1; i <= 300; i++)\n        judge(i);\n    return 0;\n}\n",ACCEPTED,32,424
1280522956633997312,47dbe5892208b18a18291b2192e6aba93b27900ba3b6814d0afa935087a6c59d,2020-07-07 23:23:58,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nint n,s,b,i,k;\nint a[1001];\nbool hex(int x)\n{\n    int s,i;\n    s=x;\n    i=0;\n    while (s!=0)\n    {\n        i++;\n        a[i]=s%b;\n        s=s/b;\n    }\n    for (int j=1;j<=i/2+1;j++)\n    if (a[j]!=a[i-j+1])\n    {return false;\n    }\n    else{\n    return true;}\n}\nint main()\n{\n    cin>>n>>s;\n    i=s;\n    while (n!=0)\n    {\n        i++;\n        k=0;\n        for (b=2;b<=10;b++)\n        {\n            if (hex(i)) {k++;}\n            if (k==2)\n            {\n                printf(\""%d\\n\"",i);\n                n--;\n                break;\n            }\n        }\n    }\n}\n",PARTIAL_ACCEPTED,37,436
1280702040182800384,c2c290e91f30dc0454f9ef5b9125b06471e7d4b403c388aa8cf0d9b3efc569e9,2020-07-08 11:15:35,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nint a[250];\nbool judge(int x, int n)\n{\n    int m{ 0 };\n    while (x)\n    {\n        a[++m] = x % n;\n        x /= n;\n    }\n    int flag{ 1 };\n    for (int i = 1; i <= m / 2; i++) {\n        if (a[i] != a[m - i + 1]) {\n            flag = 0;\n            break;\n        }\n    }\n    return flag;\n}\nint main()\n{\n    int n, s;\n    cin >> n >> s;\n    int count{ 0 };\n    int b[250];\n    int q{ 0 };\n    for (int i = s + 1;q!=n; i++)\n    {\n        for (int j = 2; j <= 10; j++)\n        {\n            if (judge(i, j)) {\n                count++;\n                if (count == 2) {\n                    q++;\n                    break;\n                }\n            }\n\n\n        }            \n        if (q > n)\n                break; \n        if (count == 2) {\n              cout << i << endl;\n        }\n    }\n    return 0;\n}",TIME_LIMIT_EXCEEDED,0,0
1280703471249965056,c2c290e91f30dc0454f9ef5b9125b06471e7d4b403c388aa8cf0d9b3efc569e9,2020-07-08 11:21:16,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nint a[250];\nbool judge(int x, int n)\n{\n    int m{ 0 };\n    while (x)\n    {\n        a[++m] = x % n;\n        x /= n;\n    }\n    int flag{ 1 };\n    for (int i = 1; i <= m / 2; i++) {\n        if (a[i] != a[m - i + 1]) {\n            flag = 0;\n            break;\n        }\n    }\n    return flag;\n}\nint main()\n{\n    int n, s;\n    cin >> n >> s;\n    int b[250];\n    int q{ 0 };\n    for (int i = s + 1;q!=n; i++)\n    {\n        int count{0};\n        for (int j = 2; j <= 10; j++)\n        {\n            if (judge(i, j)) {\n                count++;\n                if (count == 2) {\n                    q++;\n                    break;\n                }\n            }\n\n\n        }            \n        if (q > n)\n                break; \n        if (count == 2) {\n              cout << i << endl;\n        }\n    }\n    return 0;\n}",ACCEPTED,20,432
1280718440942206976,782de8de24b69682b55d2ec864c3c74059925a75bca9e240d2c3ba45de48e5f7,2020-07-08 12:20:45,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstring>\nusing namespace std;\n\n\nint main(){\n    char num1[400];\n    char num2[400];\n    int p1 = 0;\n    int p2 = 0;\n    int k = 0;\n    cin >> k;\n    \n    for (int i=1;i<=300;i++){\n        int s2 = i*i;\n        while(s2){\n            int mo = s2 % k;\n            if (mo >= 10)\n                num2[p2] = (mo-10) + 'A';\n            else\n                num2[p2] =mo + '0';\n            s2 = s2 / k;\n            p2++;\n        }\n        \n        bool sym = 1;\n        for (int i=(p2/2)-1;i>=0;i--){\n            if (num2[i] != num2[p2-i-1]){\n                sym = false;\n                break;\n            }\n        }\n        \n        if (sym){\n            int n = i;\n            while(n){\n                int mo = n % k;\n                if (mo < 10)\n                    num1[p1] = mo + 48;\n                else\n                    num1[p2] = (mo-10)+65;\n                p1++;\n                n = n / k;\n            }\n            \n            for (int i=p1-1;i>=0;i--){\n                cout << num1[i];\n            }\n            cout << \"" \"";\n            for (int i=p2-1;i>=0;i--){\n                cout << num2[i];\n            }\n            cout<<endl;\n        }\n        p1 = p2 = 0;\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,27,492
1280723063891492864,803700da900be1af3fcc75fba4ff02afc6b052dd3e43a444ac298d6f83694251,2020-07-08 12:39:07,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<cstdio>\nint n,i,j,k,x;\nint a[100],b[100];\nchar t[10]={'A','B','C','D','E','F','G','H','I','J'};\nint main()\n{\n\tint la,lb;\n\tscanf(\""%d\"",&n);\n\tfor(i=1;i<=300;i++)\n\t{\n\t\tint la=lb=0;\n\t\tx=i;\n\t\twhile(x!=0)\n\t\t{\n\t\t\ta[++la]=x%n;\n\t\t\tx/=n;\n\t\t}\n\t\tx=i*i;\n\t\twhile(x!=0)\n\t\t{\n\t\t\tb[++lb]=x%n;\n\t\t\tx/=n;\n\t\t}\n\n\t\tfor(j=1;j<=lb/2+1;j++)\n\t\t{\n\t\t\tif(b[j]!=b[lb-j+1]) break;\n\t\t\tif(j==lb/2+1)\n\t\t\t{\n\t\t\t\tfor(k=la;k>=1;k--)\n\t\t\t\t{\n\t\t\t\t\tif(a[k]>=10) printf(\""%c\"",t[a[k]-10]);\n\t\t\t\t\telse printf(\""%d\"",a[k]);\n\t\t\t\t}\n\t\t\t\tprintf(\"" \"");\n\t\t\t\tfor(k=lb;k>=1;k--)\n\t\t\t\t{\n\t\t\t\t\tif(b[k]>=10) printf(\""%c\"",t[b[k]-10]);\n\t\t\t\t\telse printf(\""%d\"",b[k]);\n\t\t\t\t}\n\t\t\t\tprintf(\""\\n\"");\t\n\t\t\t}\n\t\t}\n\t } \n\t return 0;\n } ",ACCEPTED,24,372
1280729423602434048,803700da900be1af3fcc75fba4ff02afc6b052dd3e43a444ac298d6f83694251,2020-07-08 13:04:24,C++,20.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<cstdio>\nint n,s,i,j,l,ans;\nint a[100];\nvoid change(int x,int jz)\n{\n\twhile(x!=0)\n\t{\n\t\ta[++l]=x%jz;\n\t\tx/=jz;\n\t}\n}\nbool jugde()\n{\n\tfor(int k=1;k<=l/2+1;k++)\n\t{\n\t\tif(a[k]!=a[l-k+1]) return 0;\n\t\tif(k==l/2+1)       return 1;\n    }\n}\nint main()\n{\n\tscanf(\""%d%d\"",&n,&s);\n\tfor(i=s+1;n>0;i++)\n\t{\n\t\tfor(j=2;j<=10;j++)\n\t\t{\n\t\t\tl=0;\n\t\t\tchange(i,j);\n\t\t\tif(jugde()) ans++;\n\t\t\tif(ans>=2)\n\t\t\t{\n\t\t\t\tprintf(\""%d\\n\"",i);\n\t\t\t\tans=0;\n\t\t\t\tn--;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t} \n\treturn 0;\n } ",PARTIAL_ACCEPTED,14,300
1280732052893130752,803700da900be1af3fcc75fba4ff02afc6b052dd3e43a444ac298d6f83694251,2020-07-08 13:14:50,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<cstdio>\nint n,s,i,j,l,ans;\nint a[100];\nvoid change(int x,int jz)\n{\n\twhile(x!=0)\n\t{\n\t\t//printf(\""%d\"",x%jz); \n\t\ta[++l]=x%jz;\n\t\tx/=jz;\n\t}\n\t//printf(\""\\n\"");\n}\nbool jugde()\n{\n\tfor(int k=1;k<=l/2+1;k++)\n\t{\n\t\tif(a[k]!=a[l-k+1]) return 0;\n\t\tif(k==l/2+1)       return 1;\n    }\n}\nint main()\n{\n\tscanf(\""%d%d\"",&n,&s);\n\tfor(i=s+1;n>0;i++)\n\t{\n\t\tans=0;\n\t\tfor(j=2;j<=10;j++)\n\t\t{\n\t\t\t//printf(\""%d %d \"",i,j);\n\t\t\tl=0;\n\t\t\tchange(i,j);\n\t\t\tif(jugde()) ans++;\n\t\t\tif(ans>=2)\n\t\t\t{\n\t\t\t\tprintf(\""%d\\n\"",i);\n\t\t\t\tn--;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t} \n\treturn 0;\n} ",ACCEPTED,18,284
1280752551194976256,795ecbeb72805bed8615782fb689730812fb9a11edd7bd8cf6afffe0d8cc2b14,2020-07-08 14:36:18,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<cstdio>\n    int n,m;\n    int a[10001],b[10001];\n    int s[100001];\nint main()\n{\n    scanf(\""%d %d\"",&n,&m);\n    for(int i=1;i<=n;i++)\n        scanf(\""%d\"",&a[i]);\n    s[0]=1;\n    for(int i=1;i<=m;i++)\n    {\n        int min=2147483647;\n        for(int j=1;j<=n;j++)\n        {\n            while(a[j]*s[b[j]]<=s[i-1]) b[j]++;\n            if(a[j]*s[b[j]]<min) min=a[j]*s[b[j]];\n        }\n        s[i]=min;\n    }\n    printf(\""%d\"",s[m]);\n}",WRONG_ANSWER,43,512
1280752866276327424,795ecbeb72805bed8615782fb689730812fb9a11edd7bd8cf6afffe0d8cc2b14,2020-07-08 14:37:33,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<cstdio>\n    int n,m;\n    int a[10001],b[10001];\n    int s[100001];\nint main()\n{\n    scanf(\""%d %d\"",&n,&m);\n    for(int i=1;i<=n;i++)\n        scanf(\""%d\"",&a[i]);\n    s[0]=1;\n    for(int i=1;i<=m;i++)\n    {\n        int min=2147483647;\n        for(int j=1;j<=n;j++)\n        {\n            while(a[j]*s[b[j]]<=s[i-1]) b[j]++;\n            if(a[j]*s[b[j]]<min) min=a[j]*s[b[j]];\n        }\n        s[i]=min;\n    }\n    printf(\""%d\"",s[m]);\n}",SEGMENTATION_FAULT,21,384
1280755878746054656,c9983de4ae1d839794a7cfdab09d09965ac4bdcfd04f48cc569c2fe24e6abe7c,2020-07-08 14:49:31,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<cstdio>\n#include<iostream>\n#include<cstring>\n#include<algorithm>\n\nusing namespace std; \nint m,s;\nstruct node\n{\n\tint l,a[20]; \n\tnode (int x,int b){for(l=0;x;l++) a[l]=x%b,x/=b;}\n\tbool pd(){for(int i=0;i<l;i++) if(a[i]!=a[l-i-1]) return false;return true;}\n};\nint main()\n{\n\tscanf(\""%d%d\"",&m,&s);\n    int t=0; \n\tfor(int i=s+1;i<=100000;i++)\n    {\n\t\tint tt=0; \n\t\tfor (int j=2;j<=10;j++)\n        {\n\t\t\tnode g(i,j); \n\t\t\tif (g.pd()) tt++; \n\t\t}\n\t\tif (tt>=2)\n        {\n\t\t\tprintf(\""%d\\m\"",i); \n\t\t\tt++; \n\t\t\tif (t==m) return 0; \n\t\t}\n\t}\n    return 0;\n}\n\n",WRONG_ANSWER,23,384
1280755955828973568,c9983de4ae1d839794a7cfdab09d09965ac4bdcfd04f48cc569c2fe24e6abe7c,2020-07-08 14:49:49,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<cstdio>\n#include<iostream>\n#include<cstring>\n#include<algorithm>\n\nusing namespace std; \nint m,s;\nstruct node\n{\n\tint l,a[20]; \n\tnode (int x,int b){for(l=0;x;l++) a[l]=x%b,x/=b;}\n\tbool pd(){for(int i=0;i<l;i++) if(a[i]!=a[l-i-1]) return false;return true;}\n};\nint main()\n{\n\tscanf(\""%d%d\"",&m,&s);\n    int t=0; \n\tfor(int i=s+1;i<=100000;i++)\n    {\n\t\tint tt=0; \n\t\tfor (int j=2;j<=10;j++)\n        {\n\t\t\tnode g(i,j); \n\t\t\tif (g.pd()) tt++; \n\t\t}\n\t\tif (tt>=2)\n        {\n\t\t\tprintf(\""%d\\m\"",i); \n\t\t\tt++; \n\t\t\tif (t==m) return 0; \n\t\t}\n\t}\n    \n}\n\n",WRONG_ANSWER,30,476
1280756023151755264,c9983de4ae1d839794a7cfdab09d09965ac4bdcfd04f48cc569c2fe24e6abe7c,2020-07-08 14:50:05,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<cstdio>\n#include<iostream>\n#include<cstring>\n#include<algorithm>\n\nusing namespace std; \nint m,s;\nstruct node\n{\n\tint l,a[20]; \n\tnode (int x,int b){for(l=0;x;l++) a[l]=x%b,x/=b;}\n\tbool pd(){for(int i=0;i<l;i++) if(a[i]!=a[l-i-1]) return false;return true;}\n};\nint main()\n{\n\tscanf(\""%d%d\"",&m,&s);\n    int t=0; \n\tfor(int i=s+1;i<=100000;i++)\n    {\n\t\tint tt=0; \n\t\tfor (int j=2;j<=10;j++)\n        {\n\t\t\tnode g(i,j); \n\t\t\tif (g.pd()) tt++; \n\t\t}\n\t\tif (tt>=2)\n        {\n\t\t\tprintf(\""%d\\n\"",i); \n\t\t\tt++; \n\t\t\tif (t==m) return 0; \n\t\t}\n\t}\n    \n}\n\n",ACCEPTED,29,388
1280756133663277056,c9983de4ae1d839794a7cfdab09d09965ac4bdcfd04f48cc569c2fe24e6abe7c,2020-07-08 14:50:32,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<cstdio>\n#include<iostream>\n#include<cstring>\n#include<algorithm>\n\nusing namespace std; \nint m,s;\nstruct node\n{\n\tint l,a[20]; \n\tnode (int x,int b){for(l=0;x;l++) a[l]=x%b,x/=b;}\n\tbool pd(){for(int i=0;i<l;i++) if(a[i]!=a[l-i-1]) return false;return true;}\n};\nint main()\n{\n\tscanf(\""%d%d\"",&m,&s);\n    int t=0; \n\tfor(int i=s+1;i<=100000;i++)\n    {\n\t\tint tt=0; \n\t\tfor (int j=2;j<=10;j++)\n        {\n\t\t\tnode g(i,j); \n\t\t\tif (g.pd()) tt++; \n\t\t}\n\t\tif (tt>=2)\n        {\n\t\t\tprintf(\""%d\\n\"",i); \n\t\t\tt++; \n\t\t\tif (t==m) return 0; \n\t\t}\n\t}\n    return 0;\n}\n\n",ACCEPTED,36,512
1280770105209700352,c8bd3d02d762695a945b70d49e4d784720ebfe8f207c16c2c2e0245edd2ba39b,2020-07-08 15:46:03,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n    int n;\n    cin >> n;\n    for(int i=1;i<=300;i++){\n        if(huiWen(pow(i,2)))\n            cout<<i<<\"" \""<<pow(i,2)<<endl;\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1280770158645133312,c8bd3d02d762695a945b70d49e4d784720ebfe8f207c16c2c2e0245edd2ba39b,2020-07-08 15:46:16,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\nbool huiWen(int n){\n    int s,x=0;\n    s=n;\n    bool arry=false;\n    while(s>0){\n        x=x*10+s%10;\n        s=s/10;\n    }\n    if(x==n)\n        arry=true;\n    return arry;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    for(int i=1;i<=300;i++){\n        if(huiWen(pow(i,2)))\n            cout<<i<<\"" \""<<pow(i,2)<<endl;\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1280770231525359616,c8bd3d02d762695a945b70d49e4d784720ebfe8f207c16c2c2e0245edd2ba39b,2020-07-08 15:46:33,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <math.h>\nusing namespace std;\n\nbool huiWen(int n){\n    int s,x=0;\n    s=n;\n    bool arry=false;\n    while(s>0){\n        x=x*10+s%10;\n        s=s/10;\n    }\n    if(x==n)\n        arry=true;\n    return arry;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    for(int i=1;i<=300;i++){\n        if(huiWen(pow(i,2)))\n            cout<<i<<\"" \""<<pow(i,2)<<endl;\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,27,484
1280773715183206400,c8bd3d02d762695a945b70d49e4d784720ebfe8f207c16c2c2e0245edd2ba39b,2020-07-08 16:00:23,C++,30.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <math.h>\nusing namespace std;\n\nint transfer2(int x,int jinzhi)\n{\n    int p=1,y=0,yushu;\n    while(1){\n        yushu=x%jinzhi;\n        x/=jinzhi;\n        y+=yushu*p;\n        p*=10;\n        if(x<jinzhi){\n            y+=x*p;\n            break;\n        }\n    }\n    return y;\n}\n\nbool huiWen(int n){\n    int s,x=0;\n    s=n;\n    bool arry=false;\n    while(s>0){\n        x=x*10+s%10;\n        s=s/10;\n    }\n    if(x==n)\n        arry=true;\n    return arry;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    if(n==10){\n        for(int i=1;i<=300;i++){\n            if(huiWen(pow(i,2)))\n                cout<<i<<\"" \""<<pow(i,2)<<endl;\n        }\n    }\n    if(n<10)\n        for(int i=1;i<=300;i++){\n            if(huiWen(transfer2(pow(i,2),n)))\n                cout<<transfer2(i,n)<<\"" \""<<transfer2(pow(i,2),n)<<endl;\n        }\n\n    return 0;\n}",PARTIAL_ACCEPTED,22,384
1280774935159431168,c8bd3d02d762695a945b70d49e4d784720ebfe8f207c16c2c2e0245edd2ba39b,2020-07-08 16:05:14,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n#include<string.h>\n\nchar a[400];\n\nvoid swap()\n{\n    int l=(int)strlen(a);\n    int p1=0,p2=l-1;\n    int t;\n    while(p1<p2)\n    {\n        t=a[p1];\n        a[p1++]=a[p2];\n        a[p2--]=t;\n    }\n}\n\nvoid convert(int x,int b)\n{\n    int i=0,n;\n    memset(a,0,400*sizeof(char));\n    n=x;\n    while(n!=0)\n    {\n        if(n%b<10) a[i]=n%b+48;\n        else a[i]=n%b+55;\n        n=n/b;\n        i++;\n    }\n    a[i]='\\0';\n}\n\nint main()\n{\n    int b,i=1,l,p1,p2,flag;\n    char t[400];\n    scanf(\""%d\"",&b);\n    for(i=1;i<=300;i++)\n    {\n        flag=1;\n        convert(i*i,b);\n        strcpy(t,a);\n        l=(int)strlen(t);\n        p1=0;\n        p2=l-1;\n        while(p1<p2)\n        {\n            if(t[p1]!=t[p2]) {flag=0;break;}\n            p1++;\n            p2--;\n        }\n        if(flag)\n        {\n            convert(i,b);\n            swap();\n            printf(\""%s %s\\n\"",a,t);\n        }\n    }\n    return 0;\n}",ACCEPTED,24,384
1280774983806009344,c8bd3d02d762695a945b70d49e4d784720ebfe8f207c16c2c2e0245edd2ba39b,2020-07-08 16:05:26,C,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n#include<string.h>\n\nchar a[400];\n\nvoid swap()\n{\n    int l=(int)strlen(a);\n    int p1=0,p2=l-1;\n    int t;\n    while(p1<p2)\n    {\n        t=a[p1];\n        a[p1++]=a[p2];\n        a[p2--]=t;\n    }\n}\n\nvoid convert(int x,int b)\n{\n    int i=0,n;\n    memset(a,0,400*sizeof(char));\n    n=x;\n    while(n!=0)\n    {\n        if(n%b<10) a[i]=n%b+48;\n        else a[i]=n%b+55;\n        n=n/b;\n        i++;\n    }\n    a[i]='\\0';\n}\n\nint main()\n{\n    int b,i=1,l,p1,p2,flag;\n    char t[400];\n    scanf(\""%d\"",&b);\n    for(i=1;i<=300;i++)\n    {\n        flag=1;\n        convert(i*i,b);\n        strcpy(t,a);\n        l=(int)strlen(t);\n        p1=0;\n        p2=l-1;\n        while(p1<p2)\n        {\n            if(t[p1]!=t[p2]) {flag=0;break;}\n            p1++;\n            p2--;\n        }\n        if(flag)\n        {\n            convert(i,b);\n            swap();\n            printf(\""%s %s\\n\"",a,t);\n        }\n    }\n    return 0;\n}",ACCEPTED,23,384
1280775195211513856,c8bd3d02d762695a945b70d49e4d784720ebfe8f207c16c2c2e0245edd2ba39b,2020-07-08 16:06:16,C,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n#include<string.h>\nchar a[400];\nvoid swap(){\n    int l=(int)strlen(a);\n    int p1=0,p2=l-1;\n    int t;\n    while(p1<p2)\n    {\n        t=a[p1];\n        a[p1++]=a[p2];\n        a[p2--]=t;\n    }\n}\n\nvoid convert(int x,int b){\n    int i=0,n;\n    memset(a,0,400*sizeof(char));\n    n=x;\n    while(n!=0){\n        if(n%b<10) a[i]=n%b+48;\n        else a[i]=n%b+55;\n        n=n/b;\n        i++;\n    }\n    a[i]='\\0';\n}\n\nint main(){\n    int b,i=1,l,p1,p2,flag;\n    char t[400];\n    scanf(\""%d\"",&b);\n    for(i=1;i<=300;i++){\n        flag=1;\n        convert(i*i,b);\n        strcpy(t,a);\n        l=(int)strlen(t);\n        p1=0;\n        p2=l-1;\n        \n        while(p1<p2){\n            if(t[p1]!=t[p2]) {flag=0;break;}\n            p1++;\n            p2--;\n        }\n        if(flag){\n            convert(i,b);\n            swap();\n            printf(\""%s %s\\n\"",a,t);\n        }\n    }\n    return 0;\n}",ACCEPTED,24,384
1280778081453670400,c8bd3d02d762695a945b70d49e4d784720ebfe8f207c16c2c2e0245edd2ba39b,2020-07-08 16:17:44,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <math.h>\nusing namespace std;\n\nint transfer(int x,int jinzhi)\n{\n    int p=1,y=0,yushu;\n    while(1){\n        yushu=x%jinzhi;\n        x/=jinzhi;\n        y+=yushu*p;\n        p*=10;\n        if(x<jinzhi){\n            y+=x*p;\n            break;\n        }\n    }\n    return y;\n}\n\nbool huiWen(int n){\n    int s,x=0;\n    s=n;\n    bool arry=false;\n    while(s>0){\n        x=x*10+s%10;\n        s=s/10;\n    }\n    if(x==n)\n        arry=true;\n    return arry;\n}\n\nint main()\n{\n    int n,s;\n    cin>>n>>s;\n    int iCounter=0;\n\n    for(int i=s+1;iCounter<3;i++){\n        int arryNum=0;\n        for(int j=2;j<=10;j++){\n            if(huiWen(transfer(i,j))){\n                arryNum+=1;\n            }\n            if(arryNum>=2){\n                cout<<i<<endl;\n                iCounter+=1;\n                break;\n            }\n        }\n\n    }\n    return 0;\n}",WRONG_ANSWER,22,488
1280778529908645888,c8bd3d02d762695a945b70d49e4d784720ebfe8f207c16c2c2e0245edd2ba39b,2020-07-08 16:19:31,C++,50.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <math.h>\nusing namespace std;\n\nint transfer(int x,int jinzhi)\n{\n    int p=1,y=0,yushu;\n    while(1){\n        yushu=x%jinzhi;\n        x/=jinzhi;\n        y+=yushu*p;\n        p*=10;\n        if(x<jinzhi){\n            y+=x*p;\n            break;\n        }\n    }\n    return y;\n}\n\nbool huiWen(int n){\n    int s,x=0;\n    s=n;\n    bool arry=false;\n    while(s>0){\n        x=x*10+s%10;\n        s=s/10;\n    }\n    if(x==n)\n        arry=true;\n    return arry;\n}\n\nint main()\n{\n    int n,s;\n    cin>>n>>s;\n    int iCounter=0;\n\n    for(int i=s+1;iCounter<n;i++){\n        int arryNum=0;\n        for(int j=2;j<=10;j++){\n            if(huiWen(transfer(i,j))){\n                arryNum+=1;\n            }\n            if(arryNum>=2){\n                cout<<i<<endl;\n                iCounter+=1;\n                break;\n            }\n        }\n\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,26,428
1280787379365797888,aef415abc46901e97f1978f8e79b8d564f9efd4d1cc1807579b416efd335a6aa,2020-07-08 16:54:41,C++,40.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint n, s;\nint num[20];//转换为其他进制的数\nint a;//当前储存数\n\n\t  //将x转换为n进制,并判断是不是回文数\nbool f(int x) \n{\n\tint y = 0;\n\tint count = 0;\n\tint sta = 1;\n\tint cpy = x;\n\tfor (int n = 2; n <= 10; ++n) {\n\t\tfor (int i = 0; i < y; ++i) {\n\t\t\tnum[i] = 0;\n\t\t}\n\t\ty = 0;\n\t\tcpy = x;\n\t\tsta = 1;\n\t\twhile (cpy > 0) {\n\t\t\tnum[y] = cpy % n;\n\t\t\tcpy /= n;\n\t\t\t++y;\n\t\t}\n\t\t\n\t\tfor (int i = 0; i < y / 2; ++i) {\n\t\t\tif (num[i] != num[y - 1 - i]) {\n\t\t\t\tsta = 0;\n\t\t\t}\n\t\t}\n\t\tif (sta == 1) {\n\t\t\t++count;\n\t\t}\n\t\tif (count >= 2) {\n\t\t\treturn 1;\n\t\t}\n\t}\n\treturn 0;\n}\nint main() {\n\tcin >> n >> s;\n\t++s;\n\tint count=0;\n\twhile (s<500) {\n\t\tif (count >= n) {\n\t\t\tbreak;\n\t\t}\n\t\tif (f(s)) {\n\t\t\tif (count == 0) {\n\t\t\t\tprintf(\""%d\"", s);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tprintf(\""\\n%d\"", s);\n\t\t\t}\n\t\t\t++count;\n\t\t}\n\t\t++s;\n\t}\n\t//printf(\""%d\"", f(25));\n\t//f(25);\n}",PARTIAL_ACCEPTED,40,484
1280787670916071424,aef415abc46901e97f1978f8e79b8d564f9efd4d1cc1807579b416efd335a6aa,2020-07-08 16:55:51,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint n, s;\nint num[20];//转换为其他进制的数\nint a;//当前储存数\n\n\t  //将x转换为n进制,并判断是不是回文数\nbool f(int x) \n{\n\tint y = 0;\n\tint count = 0;\n\tint sta = 1;\n\tint cpy = x;\n\tfor (int n = 2; n <= 10; ++n) {\n\t\tfor (int i = 0; i < y; ++i) {\n\t\t\tnum[i] = 0;\n\t\t}\n\t\ty = 0;\n\t\tcpy = x;\n\t\tsta = 1;\n\t\twhile (cpy > 0) {\n\t\t\tnum[y] = cpy % n;\n\t\t\tcpy /= n;\n\t\t\t++y;\n\t\t}\n\t\t\n\t\tfor (int i = 0; i < y / 2; ++i) {\n\t\t\tif (num[i] != num[y - 1 - i]) {\n\t\t\t\tsta = 0;\n\t\t\t}\n\t\t}\n\t\tif (sta == 1) {\n\t\t\t++count;\n\t\t}\n\t\tif (count >= 2) {\n\t\t\treturn 1;\n\t\t}\n\t}\n\treturn 0;\n}\nint main() {\n\tcin >> n >> s;\n\t++s;\n\tint count=0;\n\twhile (1) {\n\t\tif (count >= n) {\n\t\t\tbreak;\n\t\t}\n\t\tif (f(s)) {\n\t\t\tif (count == 0) {\n\t\t\t\tprintf(\""%d\"", s);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tprintf(\""\\n%d\"", s);\n\t\t\t}\n\t\t\t++count;\n\t\t}\n\t\t++s;\n\t}\n\t//printf(\""%d\"", f(25));\n\t//f(25);\n}",ACCEPTED,19,384
1280788040253890560,62ab56fba214ade1af428052e84f54b4a39008da8e2a6d888d02d705582fc25a,2020-07-08 16:57:19,Python,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"a,b = eval(input().split())\ndef changenum(num):\n    listnum = []\n    for n in range(2,11):\n        i = 0\n        while num >= n**i:\n            i = i + 1\n        listone = [0,1,2,3,4,5,6,7,8,9]\n        str1 = ''\n        i = i - 1\n        while i != 0:\n            num1 = num // n**i\n            num2 = num // n**i\n            num = num2\n            num1 = str(num1)\n            str1 = str1 + num1\n            i = i - 1\n        str1 = str1 + str(num)\n        listtwo = list(str1)\n        if listtwo == listtwo[::-1]:\n            listnum.append(1)\n        else:\n            0\n    lenth = len(listnum)\n    if lenth >= 2:\n        return num\n    else:\n        return 0\nnum = b + 1\nwhile True:\n    listf = []\n    numc = changenum(num)\n    if numc != 0:\n        listf.append(num)\n    else:\n        0\n    if len(listf) == a:\n        for x in listf:\n            print(x)\n        break\n    else:\n        0\n    num = num + 1  \n",NON_ZERO_EXIT_CODE,164,3072
1280791034060013568,62ab56fba214ade1af428052e84f54b4a39008da8e2a6d888d02d705582fc25a,2020-07-08 17:09:13,Python,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"a,b = input().split()\na = int(a)\nb = int(b)\ndef changenum(num):\n    listnum = []\n    for n in range(2,11):\n        i = 0\n        while num >= n**i:\n            i = i + 1\n        str1 = ''\n        i = i - 1\n        while i != 0:\n            num1 = num // n**i\n            num2 = num % n**i\n            num = num2\n            num1 = str(num1)\n            str1 = str1 + num1\n            i = i - 1\n        str1 = str1 + str(num)\n        listtwo = list(str1)\n        if listtwo == listtwo[::-1]:\n            listnum.append(1)\n        else:\n            0\n    lenth = len(listnum)\n    if lenth >= 2:\n        return num\n    else:\n        return 0\nnum = b + 1\nwhile True:\n    listf = []\n    numc = changenum(num)\n    if numc != 0:\n        listf.append(num)\n    else:\n        0\n    if len(listf) == a:\n        for x in listf:\n            print(x)\n        break\n    else:\n        0\n    num = num + 1  \n",NON_ZERO_EXIT_CODE,163,3072
1280792025045057536,b05d9f4f8ae94e871d055cf9cc40d00027e969fe8ebc83bb7ae29282cc9efd75,2020-07-08 17:13:09,C++,60.0,1277062760129622024,1267449136707624960,1049226397448056832,"//\n//  main.cpp\n//  test\n//\n//  Created by tanghuaxin on 2020/7/4.\n//  Copyright ? 2020 tanghuaxin. All rights reserved.\n//\n\n#include <iostream>\n#include<string>\n#include<cstring>\n#include <algorithm>\n\nusing namespace std;\n\nbool jud(string a){\n    int len=a.length(),flag=1;\n    for(int i=0;i<len/2;i++){\n        if(a[i]!=a[len-i-1]){\n            flag=0;\n            break;\n        }\n    }\n    if(flag==1){\n        return true;\n    }\n    else{\n        return false;\n    }\n}\n\nstring tra(int n,int b){\n    string ans=\""\"";\n    do{\n        int t=n%b;\n    if(t>=0&&t<=9){\n        ans+=t+'0';\n        \n    }\n    else{\n        ans+=t-10+'A';\n    }\n        n/=b;}while(n!=0);\n    reverse(ans.begin(),ans.end() );\n    return ans;\n    \n}\n\n\n\n\n\nint main(int argc, const char * argv[]) {\n    // insert code here...\n    int n,s,co1=0,co2=0;\n    cin>>n;\n    cin>>s;\n    for(int i=s+1;i<10000;i++){\n    \tco1=0;\n    \t\n        for(int j=2;j<11;j++){\n            if(jud(tra(i,j))){\n            \n                co1++;\n            }\n        }\n        if(co1>=2){\n            cout<<i<<endl;\n            co2++;\n        }\n        if(co2==n){\n            break;\n        }\n    }\n    \n    \n    return 0;\n}\n",PARTIAL_ACCEPTED,37,424
1280792941286572032,b05d9f4f8ae94e871d055cf9cc40d00027e969fe8ebc83bb7ae29282cc9efd75,2020-07-08 17:16:47,C++,60.0,1277062760129622024,1267449136707624960,1049226397448056832,"//\n//  main.cpp\n//  test\n//\n//  Created by tanghuaxin on 2020/7/4.\n//  Copyright ? 2020 tanghuaxin. All rights reserved.\n//\n\n#include <iostream>\n#include<string>\n#include<cstring>\n#include <algorithm>\n\nusing namespace std;\n\nbool jud(string a){\n    int len=a.length(),flag=1;\n    for(int i=0;i<len/2;i++){\n        if(a[i]!=a[len-i-1]){\n            flag=0;\n            break;\n        }\n    }\n    if(flag==1){\n        return true;\n    }\n    else{\n        return false;\n    }\n}\n\nstring tra(int n,int b){\n    string ans=\""\"";\n    do{\n        int t=n%b;\n    if(t>=0&&t<=9){\n        ans+=t+'0';\n        \n    }\n    else{\n        ans+=t-10+'A';\n    }\n        n/=b;}while(n!=0);\n    reverse(ans.begin(),ans.end() );\n    return ans;\n    \n}\n\n\n\n\n\nint main(int argc, const char * argv[]) {\n    // insert code here...\n    int n,s,co1=0,co2=0;\n    cin>>n;\n    cin>>s;\n    for(int i=s+1;i<10000;i++){\n    \tco1=0;\n    \t\n        for(int j=2;j<11;j++){\n            if(jud(tra(i,j))){\n            \n                co1++;\n            }\n        }\n        if(co1>=2){\n            cout<<i<<endl;\n            co2++;\n        }\n        if(co2==n){\n            break;\n        }\n    }\n    \n    \n    return 0;\n}\n",PARTIAL_ACCEPTED,23,424
1280793761474330624,b05d9f4f8ae94e871d055cf9cc40d00027e969fe8ebc83bb7ae29282cc9efd75,2020-07-08 17:20:03,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"//\n//  main.cpp\n//  test\n//\n//  Created by tanghuaxin on 2020/7/4.\n//  Copyright ? 2020 tanghuaxin. All rights reserved.\n//\n\n#include <iostream>\n#include<string>\n#include<cstring>\n#include <algorithm>\n\nusing namespace std;\n\nbool jud(string a){\n    int len=a.length(),flag=1;\n    for(int i=0;i<len/2;i++){\n        if(a[i]!=a[len-i-1]){\n            flag=0;\n            break;\n        }\n    }\n    if(flag==1){\n        return true;\n    }\n    else{\n        return false;\n    }\n}\n\nstring tra(int n,int b){\n    string ans=\""\"";\n    do{\n        int t=n%b;\n    if(t>=0&&t<=9){\n        ans+=t+'0';\n        \n    }\n    else{\n        ans+=t-10+'A';\n    }\n        n/=b;}while(n!=0);\n    reverse(ans.begin(),ans.end() );\n    return ans;\n    \n}\n\n\n\n\n\nint main(int argc, const char * argv[]) {\n    // insert code here...\n    int n,s,co1=0,co2=0;\n    cin>>n;\n    cin>>s;\n    for(int i=s+1;i<190000;i++){\n    \tco1=0;\n    \t\n        for(int j=2;j<11;j++){\n            if(jud(tra(i,j))){\n            \n                co1++;\n            }\n        }\n        if(co1>=2){\n            cout<<i<<endl;\n            co2++;\n        }\n        if(co2==n){\n            break;\n        }\n    }\n    \n    \n    return 0;\n}\n",ACCEPTED,25,544
1280798637796286464,e91e6c90c2cf7e80a829c59f6e0ea951ba7c25ec659e2bc0b65bd45baa141978,2020-07-08 17:39:25,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nint cs1, sum1[9999];\nint cs2, sum2[9999];\nchar w[100] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z' };//打表大法好233333\nlong long kk(int x, int b)\n{\n    cs1 = 0;\n    while (x)\n    {\n        sum1[++cs1] = x % b;\n        x /= b;\n    }\n}\nlong long zh2(int x, int b)\n{\n    cs2 = 0;\n    while (x)\n    {\n        sum2[++cs2] = x % b;\n        x /= b;\n    }\n\n}\nint pd()\n{\n    for (int i = 1; i <= cs1; i++)\n        if (sum1[cs1 - i + 1] != sum1[i])\n            return 0;\n\n    return 1;\n}\nint main()\n{\n    int b;\n\n    cin >> b;\n\n\n    for (int i = 1; i <= 300; i++)\n    {\n        long long ans = kk(i * i, b);\n        if (pd() == 1)\n        {\n            zh2(i, b);\n            for (int j = cs2; j >= 1; j--)\n                cout<<w[sum2[j]];\n            cout<<\"" \"";\n            for (int j = cs1; j >= 1; j--)\n                cout<< w[sum1[j]];\n            puts(\""\"");\n        }\n    }\n\n    return 0;\n}",ACCEPTED,32,424
1280798772950384640,e91e6c90c2cf7e80a829c59f6e0ea951ba7c25ec659e2bc0b65bd45baa141978,2020-07-08 17:39:58,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nint cs1, sum1[9999];\nint cs2, sum2[9999];\nchar w[100] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z' };\nlong long kk(int x, int b)\n{\n    cs1 = 0;\n    while (x)\n    {\n        sum1[++cs1] = x % b;\n        x /= b;\n    }\n}\nlong long zh2(int x, int b)\n{\n    cs2 = 0;\n    while (x)\n    {\n        sum2[++cs2] = x % b;\n        x /= b;\n    }\n\n}\nint pd()\n{\n    for (int i = 1; i <= cs1; i++)\n        if (sum1[cs1 - i + 1] != sum1[i])\n            return 0;\n\n    return 1;\n}\nint main()\n{\n    int b;\n\n    cin >> b;\n\n\n    for (int i = 1; i <= 300; i++)\n    {\n        long long ans = kk(i * i, b);\n        if (pd() == 1)\n        {\n            zh2(i, b);\n            for (int j = cs2; j >= 1; j--)\n                cout<<w[sum2[j]];\n            cout<<\"" \"";\n            for (int j = cs1; j >= 1; j--)\n                cout<< w[sum1[j]];\n            puts(\""\"");\n        }\n    }\n\n    return 0;\n}",ACCEPTED,32,508
1280799088247767040,e91e6c90c2cf7e80a829c59f6e0ea951ba7c25ec659e2bc0b65bd45baa141978,2020-07-08 17:41:13,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nint cs1, sum1[9999];\nint cs2, sum2[9999];\nchar w[100] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z' };\nlong long kk(int x, int b)\n{\n    cs1 = 0;\n    while (x)\n    {\n        sum1[++cs1] = x % b;\n        x /= b;\n    }\n}\nlong long zh2(int x, int b)\n{\n    cs2 = 0;\n    while (x)\n    {\n        sum2[++cs2] = x % b;\n        x /= b;\n    }\n\n}\nint pd()\n{\n    for (int i = 1; i <= cs1; i++)\n        if (sum1[cs1 - i + 1] != sum1[i])\n            return 0;\n\n    return 1;\n}\nint main()\n{\n    int b;\n\n    cin >> b;\n\n\n    for (int i = 1; i <= 300; i++)\n    {\n        long long ans = kk(i * i, b);\n        if (pd() == 1)\n        {\n            zh2(i, b);\n            for (int j = cs2; j >= 1; j--)\n                cout<<w[sum2[j]];\n            cout<<\"" \"";\n            for (int j = cs1; j >= 1; j--)\n                cout<< w[sum1[j]];\n            \n        }\n    }\n\n    return 0;\n}",PRESENTATION_ERROR,20,424
1280799126688563200,e91e6c90c2cf7e80a829c59f6e0ea951ba7c25ec659e2bc0b65bd45baa141978,2020-07-08 17:41:22,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nint cs1, sum1[9999];\nint cs2, sum2[9999];\nchar w[100] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z' };\nlong long kk(int x, int b)\n{\n    cs1 = 0;\n    while (x)\n    {\n        sum1[++cs1] = x % b;\n        x /= b;\n    }\n}\nlong long zh2(int x, int b)\n{\n    cs2 = 0;\n    while (x)\n    {\n        sum2[++cs2] = x % b;\n        x /= b;\n    }\n\n}\nint pd()\n{\n    for (int i = 1; i <= cs1; i++)\n        if (sum1[cs1 - i + 1] != sum1[i])\n            return 0;\n\n    return 1;\n}\nint main()\n{\n    int b;\n\n    cin >> b;\n\n\n    for (int i = 1; i <= 300; i++)\n    {\n        long long ans = kk(i * i, b);\n        if (pd() == 1)\n        {\n            zh2(i, b);\n            for (int j = cs2; j >= 1; j--)\n                cout<<w[sum2[j]];\n            cout<<\"" \"";\n            for (int j = cs1; j >= 1; j--)\n                cout<< w[sum1[j]];\n            cout<<\"" \"";\n        }\n    }\n\n    return 0;\n}",PRESENTATION_ERROR,25,512
1280799236739743744,e91e6c90c2cf7e80a829c59f6e0ea951ba7c25ec659e2bc0b65bd45baa141978,2020-07-08 17:41:48,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nint cs1, sum1[9999];\nint cs2, sum2[9999];\nchar w[100] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z' };\nlong long kk(int x, int b)\n{\n    cs1 = 0;\n    while (x)\n    {\n        sum1[++cs1] = x % b;\n        x /= b;\n    }\n}\nlong long zh2(int x, int b)\n{\n    cs2 = 0;\n    while (x)\n    {\n        sum2[++cs2] = x % b;\n        x /= b;\n    }\n\n}\nint pd()\n{\n    for (int i = 1; i <= cs1; i++)\n        if (sum1[cs1 - i + 1] != sum1[i])\n            return 0;\n\n    return 1;\n}\nint main()\n{\n    int b;\n\n    cin >> b;\n\n\n    for (int i = 1; i <= 300; i++)\n    {\n        long long ans = kk(i * i, b);\n        if (pd() == 1)\n        {\n            zh2(i, b);\n            for (int j = cs2; j >= 1; j--)\n                cout<<w[sum2[j]];\n            cout<<\"" \"";\n            for (int j = cs1; j >= 1; j--)\n                cout<< w[sum1[j]];\n            puts<<\"" \"";\n        }\n    }\n\n    return 0;\n}",COMPILE_ERROR,0,0
1280799325519544320,e91e6c90c2cf7e80a829c59f6e0ea951ba7c25ec659e2bc0b65bd45baa141978,2020-07-08 17:42:09,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nint cs1, sum1[9999];\nint cs2, sum2[9999];\nchar w[100] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z' };\nlong long kk(int x, int b)\n{\n    cs1 = 0;\n    while (x)\n    {\n        sum1[++cs1] = x % b;\n        x /= b;\n    }\n}\nlong long zh2(int x, int b)\n{\n    cs2 = 0;\n    while (x)\n    {\n        sum2[++cs2] = x % b;\n        x /= b;\n    }\n\n}\nint pd()\n{\n    for (int i = 1; i <= cs1; i++)\n        if (sum1[cs1 - i + 1] != sum1[i])\n            return 0;\n\n    return 1;\n}\nint main()\n{\n    int b;\n\n    cin >> b;\n\n\n    for (int i = 1; i <= 300; i++)\n    {\n        long long ans = kk(i * i, b);\n        if (pd() == 1)\n        {\n            zh2(i, b);\n            for (int j = cs2; j >= 1; j--)\n                cout<<w[sum2[j]];\n            cout<<\"" \"";\n            for (int j = cs1; j >= 1; j--)\n                cout<< w[sum1[j]];\n            puts(\""\"");\n        }\n    }\n\n    return 0;\n}",ACCEPTED,32,428
1280801568595574784,e91e6c90c2cf7e80a829c59f6e0ea951ba7c25ec659e2bc0b65bd45baa141978,2020-07-08 17:51:04,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"\n#include <iostream>\n\n\nusing namespace std;\n\n\n\nint n, s;\nint num[10000], lenth;\n\nint main()\n{\n\tcin >> n >> s;\n\twhile (n)\n\t{\n\t\ts++;\n\t\tint ntr = 0;\n\t\tfor (int i = 2; i <= 10; i++)\n\t\t{\n\t\t\tlenth = 0;\n\t\t\tint kk1 = s;\n\t\t\tbool kk = true;\n\t\t\twhile (kk1)\n\t\t\t{\n\t\t\t\tnum[++lenth] = kk1 % i;\n\t\t\t\tkk1 /= i;\n\t\t\t}\n\t\t\tfor (int i = 1; i <= lenth / 2; i++)\n\t\t\t{\n\t\t\t\tif (num[i] ^ num[lenth - i + 1])\n\t\t\t\t{\n\t\t\t\t\tkk = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (kk)\n\t\t\t{\n\t\t\t\tntr++;\n\t\t\t}\n\t\t\tif (ntr == 2)\n\t\t\t{\n\t\t\t\tcout << s << endl;\n\t\t\t\tn--;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t}\n\treturn 0;\n}",ACCEPTED,29,424
1280803408053731328,6979f1037c8b8de0aace97dc0033f80b15c88224cff0e1a2890e7bc48a9e471c,2020-07-08 17:58:23,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n#include<string.h>\nint tenToB(int ten,char B[150],int b);\nint main () {\n    FILE *fin  = fopen(\""palsquare.in\"", \""r\"");\n    FILE *fout = fopen(\""palsquare.out\"", \""w\"");\n    int b,i,j,len,ok;\n    char B[150],B2[150];\n    while (fscanf(fin,\""%d\"",&b) != EOF) {\n        for (i=1;i<=300;i++) {\n            len = tenToB(i*i,B,b);\n            ok = 1;\n            for (j=0;j<len/2;j++) {\n                if (B[j]!=B[len-j-1]) {\n                    ok = 0;\n                    break;\n                }\n            }\n            if (ok) {\n                tenToB(i,B2,b);\n                fprintf(fout,\""%s %s\\n\"",B2,B);\n            }\n        }\n    }\n    return 0;\n}\nint tenToB(int ten,char B[150],int b) {\n    int i,len = 0,bit;\n    char TB[150];\n    while (ten!=0) {\n        bit = ten % b;\n        if (bit<=9) {\n            TB[len++] = bit+'0';\n        } else {\n            TB[len++] = bit-10+'A';\n        }\n        ten /= b;\n    }\n    for (i=len-1;i>=0;i--) B[len-i-1] = TB[i];\n    B[len] = '\\0';\n    return len;\n}",SEGMENTATION_FAULT,14,384
1280803431717994496,6979f1037c8b8de0aace97dc0033f80b15c88224cff0e1a2890e7bc48a9e471c,2020-07-08 17:58:28,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n#include<string.h>\nint tenToB(int ten,char B[150],int b);\nint main () {\n    FILE *fin  = fopen(\""palsquare.in\"", \""r\"");\n    FILE *fout = fopen(\""palsquare.out\"", \""w\"");\n    int b,i,j,len,ok;\n    char B[150],B2[150];\n    while (fscanf(fin,\""%d\"",&b) != EOF) {\n        for (i=1;i<=300;i++) {\n            len = tenToB(i*i,B,b);\n            ok = 1;\n            for (j=0;j<len/2;j++) {\n                if (B[j]!=B[len-j-1]) {\n                    ok = 0;\n                    break;\n                }\n            }\n            if (ok) {\n                tenToB(i,B2,b);\n                fprintf(fout,\""%s %s\\n\"",B2,B);\n            }\n        }\n    }\n    return 0;\n}\nint tenToB(int ten,char B[150],int b) {\n    int i,len = 0,bit;\n    char TB[150];\n    while (ten!=0) {\n        bit = ten % b;\n        if (bit<=9) {\n            TB[len++] = bit+'0';\n        } else {\n            TB[len++] = bit-10+'A';\n        }\n        ten /= b;\n    }\n    for (i=len-1;i>=0;i--) B[len-i-1] = TB[i];\n    B[len] = '\\0';\n    return len;\n}",SEGMENTATION_FAULT,25,364
1280805631433302016,a3839dd44aa2456efc5c73fc42e7f78eef5afe9bf6837e20449967dfd0a4572f,2020-07-08 18:07:13,C++,30.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>\n#include <algorithm>  \nusing namespace std;\nint N;\n\nint toTen(int a){\n\tint ans=1;\n\tint b;\n\twhile(ans<a){\n\t\tans=ans*10;\n\t\tb+=(a%ans/(ans/10))*N;\n\t}\n    return b;\n}\nint toB(int a){\n\tint b;\n\tstring c;\n\tvector<int> v;\n\twhile(a){\n\t\tv.push_back(a%N);\n\t\ta/=N;\n\t}\n\tfor(int i=0;i<v.size();i++){\n\t\tc+=to_string(v[v.size()-1-i]);\n\t}\n\tb=atoi(c.c_str());\n\treturn b;\n}\nbool isrev(int a){\n\ta=toB(a*a);\n\tstring b=to_string(a);\n\tstring c=b;\n\treverse(b.begin(), b.end());\n\tif(c == b){\n\t\treturn true;\n\t}\n\treturn false;\n}\nint main(){\n\tcin>>N;\n\tfor(int i=1;i<=300;i++){\n\t\tif(isrev(i)){\n\t\t\tcout<<toB(i)<<\"" \""<<toB(i*i)<<endl;\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,57,512
1280810133368537089,a3839dd44aa2456efc5c73fc42e7f78eef5afe9bf6837e20449967dfd0a4572f,2020-07-08 18:25:06,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>\n#include <algorithm>  \nusing namespace std;\nint N;\n\nint toTen(int a){\n\tint ans=1;\n\tint b;\n\twhile(ans<a){\n\t\tans=ans*10;\n\t\tb+=(a%ans/(ans/10))*N;\n\t}\n    return b;\n}\nstring toB(int a){\n\tstring b;\n\tstring c;\n\tvector<int> v;\n\twhile(a){\n\t\tv.push_back(a%N);\n\t\ta/=N;\n\t}\n\tfor(int i=0;i<v.size();i++){\n\t\tif(v[v.size()-1-i]==10){\n\t\t\tb+=\""A\"";\n\t\t}else if(v[v.size()-1-i]==11){\n\t\t\tb+=\""B\"";\n\t\t}else if(v[v.size()-1-i]==11){\n\t\t\tb+=\""C\"";\n\t\t}else if(v[v.size()-1-i]==11){\n\t\t\tb+=\""D\"";\n\t\t}else if(v[v.size()-1-i]==11){\n\t\t\tb+=\""E\"";\n\t\t}else if(v[v.size()-1-i]==11){\n\t\t\tb+=\""F\"";\n\t\t}else{\n\t\t\tb+=to_string(v[v.size()-1-i]);\n\t\t}\n\t}\n\treturn b;\n}\nbool isrev(int a){\n\tstring b=toB(a*a);\n\tstring c=b;\n\treverse(b.begin(), b.end());\n\tif(c == b){\n\t\treturn true;\n\t}\n\treturn false;\n}\nint main(){\n\tcin>>N;\n\tfor(int i=1;i<=300;i++){\n\t\tif(isrev(i)){\n\t\t\tcout<<toB(i)<<\"" \""<<toB(i*i)<<endl;\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,26,388
1280811099087093760,a3839dd44aa2456efc5c73fc42e7f78eef5afe9bf6837e20449967dfd0a4572f,2020-07-08 18:28:57,C++,60.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>\n#include <algorithm>  \nusing namespace std;\nint N;\n\nint toTen(int a){\n\tint ans=1;\n\tint b;\n\twhile(ans<a){\n\t\tans=ans*10;\n\t\tb+=(a%ans/(ans/10))*N;\n\t}\n    return b;\n}\nstring toB(int a){\n\tstring b;\n\tvector<int> v;\n\twhile(a){\n\t\tv.push_back(a%N);\n\t\ta/=N;\n\t}\n\tfor(int i=0;i<v.size();i++){\n\t\tif(v[v.size()-1-i]==10){\n\t\t\tb+=\""A\"";\n\t\t}else if(v[v.size()-1-i]==11){\n\t\t\tb+=\""B\"";\n\t\t}else if(v[v.size()-1-i]==12){\n\t\t\tb+=\""C\"";\n\t\t}else if(v[v.size()-1-i]==13){\n\t\t\tb+=\""D\"";\n\t\t}else if(v[v.size()-1-i]==14){\n\t\t\tb+=\""E\"";\n\t\t}else if(v[v.size()-1-i]==15){\n\t\t\tb+=\""F\"";\n\t\t}else{\n\t\t\tb+=to_string(v[v.size()-1-i]);\n\t\t}\n\t}\n\treturn b;\n}\nbool isrev(int a){\n\tstring b=toB(a*a);\n\tstring c=b;\n\treverse(b.begin(), b.end());\n\tif(c == b){\n\t\treturn true;\n\t}\n\treturn false;\n}\nint main(){\n\tcin>>N;\n\tfor(int i=1;i<=300;i++){\n\t\tif(isrev(i)){\n\t\t\tcout<<toB(i)<<\"" \""<<toB(i*i)<<endl;\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,24,384
1280811564406333440,a3839dd44aa2456efc5c73fc42e7f78eef5afe9bf6837e20449967dfd0a4572f,2020-07-08 18:30:47,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>\n#include <algorithm>  \nusing namespace std;\nint N;\n\nint toTen(int a){\n\tint ans=1;\n\tint b;\n\twhile(ans<a){\n\t\tans=ans*10;\n\t\tb+=(a%ans/(ans/10))*N;\n\t}\n    return b;\n}\nstring toB(int a){\n\tstring b;\n\tvector<int> v;\n\twhile(a){\n\t\tv.push_back(a%N);\n\t\ta/=N;\n\t}\n\tfor(int i=0;i<v.size();i++){\n\t\tif(v[v.size()-1-i]==10){\n\t\t\tb+=\""A\"";\n\t\t}else if(v[v.size()-1-i]==11){\n\t\t\tb+=\""B\"";\n\t\t}else if(v[v.size()-1-i]==12){\n\t\t\tb+=\""C\"";\n\t\t}else if(v[v.size()-1-i]==13){\n\t\t\tb+=\""D\"";\n\t\t}else if(v[v.size()-1-i]==14){\n\t\t\tb+=\""E\"";\n\t\t}else if(v[v.size()-1-i]==15){\n\t\t\tb+=\""F\"";\n\t\t}else if(v[v.size()-1-i]==16){\n\t\t\tb+=\""G\"";\n\t\t}else if(v[v.size()-1-i]==17){\n\t\t\tb+=\""H\"";\n\t\t}else if(v[v.size()-1-i]==18){\n\t\t\tb+=\""I\"";\n\t\t}else if(v[v.size()-1-i]==19){\n\t\t\tb+=\""J\"";\n\t\t}else{\n\t\t\tb+=to_string(v[v.size()-1-i]);\n\t\t}\n\t}\n\treturn b;\n}\nbool isrev(int a){\n\tstring b=toB(a*a);\n\tstring c=b;\n\treverse(b.begin(), b.end());\n\tif(c == b){\n\t\treturn true;\n\t}\n\treturn false;\n}\nint main(){\n\tcin>>N;\n\tfor(int i=1;i<=300;i++){\n\t\tif(isrev(i)){\n\t\t\tcout<<toB(i)<<\"" \""<<toB(i*i)<<endl;\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,41,512
1280817222393446400,609e8b366fd3dc076d76936e5947f39f69a56a975387a6b3feec7e681997fa95,2020-07-08 18:53:16,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nstatic int B;\nint num[20];\n\nint is_pn(int temp)\n{\n     int digit=0;\n     int check=0;\n     temp=temp*temp;\n\n     while(temp!=0)\n     {\n          num[digit]=temp%B;\n          temp=temp/B;\n          digit++;\n     }\n\n     for(int i=0;i<digit;i++)\n     {\n          if(num[i]==num[digit-i-1])\n          {\n               check++;\n          }\n          else\n          {\n               return 0;\n          }\n     }\n\n     if(check==digit)\n     {\n          return 1;\n     }\n\n     return 0;\n}\nvoid outs(int temp)\n{\n     int dig=0;\n     while(temp)\n     {\n          dig++;\n          num[dig]=temp%B;\n          temp/=B;\n     }\n     for(int j=dig;j>=1;j--)\n     {\n          if(num[j]>9)\n          {\n               cout<<num[j]-10+'A';\n          }\n          else\n          {\n               cout<<num[j];\n          }\n     }\n}\n\nint main()\n{\n     cin>>B;\n\n     for(int i=1;i<=300;i++)\n     {\n          if(is_pn(i))\n          {\n               int dig=0,temp=i;\n               while(temp)\n               {\n                    dig++;\n                    num[dig]=temp%B;\n                    temp/=B;\n               }\n               for(int j=dig;j>=1;j--)\n               {\n                    if(num[j]>9)\n                    {\n                         cout<<num[j]-10+'A';\n                    }\n                    else\n                    {\n                         cout<<num[j];\n                    }\n               }\n               \n               dig=0;\n               \n               cout<<\"" \"";\n               outs(i*i);\n               cout<<'\\n';\n          }\n     }\n\n    return 0;\n}",PARTIAL_ACCEPTED,27,512
1280818578993897472,a3839dd44aa2456efc5c73fc42e7f78eef5afe9bf6837e20449967dfd0a4572f,2020-07-08 18:58:40,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nint N;//define system \nint amount;\nint S;\nvector<int> prop;\nint toTen(int a){\n\tint ans=1;\n\tint b;\n\twhile(ans<a){\n\t\tans=ans*10;\n\t\tb+=(a%ans/(ans/10))*N;\n\t}\n    return b;\n}\nstring toB(int a){\n\tstring b;\n\tvector<int> v;\n\twhile(a){\n\t\tv.push_back(a%N);\n\t\ta/=N;\n\t}\n\tfor(int i=0;i<v.size();i++){\n\t\tb+=to_string(v[v.size()-1-i]);\n\t}\n\treturn b;\n}\nbool isrev(int a){\n\tstring b=toB(a);\n\tstring c=b;\n\treverse(b.begin(), b.end());\n\tif(c == b){\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nint main(){\n\tcin>>amount;\n\tcin>>S;\n\twhile(prop.size()<=15){\n\t\tS++;\n\t\tint cal=0;\n\t\tfor(int i=2;i<11;i++){\n\t\t\tN=i;\n\t\t\tif(isrev(S)){\n\t\t\t\tcal++;\n\t\t\t}\n\t\t\tif(cal==2){\n\t\t\t\tprop.push_back(S);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(prop.size()==amount)\n\t\t\tbreak;\n\t}\n\t//cout<<prop.size()<<endl;\n\tfor(int i=0;i<prop.size();i++){\n\t\tcout<<prop[i]<<endl;\n\t}\n\treturn 0;\n}",ACCEPTED,84,592
1280819068276236288,609e8b366fd3dc076d76936e5947f39f69a56a975387a6b3feec7e681997fa95,2020-07-08 19:00:37,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nstatic int B;\nint num[20];\n\nint is_pn(int temp)\n{\n     int digit=0;\n     int check=0;\n     temp=temp*temp;\n\n     while(temp!=0)\n     {\n          num[digit]=temp%B;\n          temp=temp/B;\n          digit++;\n     }\n\n     for(int i=0;i<digit;i++)\n     {\n          if(num[i]==num[digit-i-1])\n          {\n               check++;\n          }\n          else\n          {\n               return 0;\n          }\n     }\n\n     if(check==digit)\n     {\n          return 1;\n     }\n\n     return 0;\n}\nvoid outs(int i)\n{\n     int dig=0;\n     while(i)\n     {\n          dig++;\n          num[dig]=i%B;\n          i/=B;\n     }\n     for(int j=dig;j>=1;j--)\n     {\n          if(num[j]>9)\n          {\n               cout<<num[j]-10+'A';\n          }\n          else\n          {\n               cout<<num[j];\n          }\n     }\n}\n\nint main()\n{\n     cin>>B;\n\n     for(int i=1;i<=300;i++)\n     {\n          if(is_pn(i))\n          {\n               outs(i);\n               cout<<\"" \"";\n               outs(i*i);\n               cout<<'\\n';\n          }\n     }\n\n    return 0;\n}",PARTIAL_ACCEPTED,32,384
1280824172760989696,609e8b366fd3dc076d76936e5947f39f69a56a975387a6b3feec7e681997fa95,2020-07-08 19:20:54,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nstatic int B;\nint num[20];\n\nint is_pn(int x)\n{\n     int digit=0,temp;\n     x=x*x;\n     while(x)\n     {\n          digit++;\n          temp=digit;\n          num[temp]=x%B;\n          x/=B;\n     }\n     for(int i=1,j=digit;i<j;i++,j--)\n          if(num[i]!=num[j])\n               return 0;\n    return 1;\n}\nvoid output(int i)\n{\n     int dig=0;\n     while(i)\n     {\n          dig++;\n          num[dig]=i%B;\n          i=i/B;\n     }\n     for(int j=dig;j>=1;j--)\n     {\n          if(num[j]>9)\n          {\n               cout<<num[j]-10+'A';\n          }\n          else\n          {\n               cout<<num[j];\n          }\n     }\n}\n\nint main()\n{\n     cin>>B;\n\n     for(int i=1;i<=300;i++)\n     {\n          if(is_pn(i))\n          {\n               output(i);\n               cout<<\"" \"";\n               output(i*i);\n               cout<<'\\n';\n          }\n     }\n\n    return 0;\n}",PARTIAL_ACCEPTED,29,512
1280824907423727616,47dbe5892208b18a18291b2192e6aba93b27900ba3b6814d0afa935087a6c59d,2020-07-08 19:23:49,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nint n,s,b,i,k;\nint a[1000];\nbool hex(int x)\n{\n    int s,i;\n    s=x;\n    i=0;\n    while (s!=0)\n    {\n        i++;\n        a[i]=s%b;\n        s=s/b;\n    }\n    for (int j=1;j<=i/2+1;j++)\n    if (a[j]!=a[i-j+1])\n    {return false;\n    }\n    else{\n    return true;}\n}\nint main()\n{\n    cin>>n>>s;\n    i=s;\n    while (n!=0)\n    {\n        i++;\n        k=0;\n        for (b=2;b<=10;b++)\n        {\n            if (hex(i)) {k++;}\n            if (k==2)\n            {\n                printf(\""%d\\n\"",i);\n                n--;\n                break;\n            }\n        }\n    }\n}\n",PARTIAL_ACCEPTED,21,488
1280832256842579968,5306f45bc39a1bcebead04fb0a0563714f434c5cfc74c6bcd6746bdff031d758,2020-07-08 19:53:01,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nint s[301];\n\nvoid transition(int a, int b)\n{\n    int r = 0;\n    while (a)\n    {\n        s[++r] = a % b;\n        a /= b;\n    }\n    s[0] = r;\n}\n\nbool judge() \n{\n    for (unsigned int i = 1; i <= s[0]; i++)\n        if (s[i] != s[s[0] + 1 - i])\n            return false;\n    return true;\n}\n\nvoid output()\n{\n    for (unsigned int i = s[0]; i >= 1; i--)\n    {\n        if (s[i] <= 9) cout << s[i];\n        else cout << (char)(s[i] - 10 + 'A');\n    }\n}\n\nint main()\n{\n    int num;\n    cin >> num;\n    for (int i = 1; i <= 300; i++)\n    {\n        transition(i * i, num);\n        if (judge())\n        {\n            transition(i, num);\n            output();\n            cout << ' ';\n            transition(i * i, num);\n            output();\n            puts(\""\"");\n        }\n    }\n}",COMPILE_ERROR,0,0
1280832273958502400,5306f45bc39a1bcebead04fb0a0563714f434c5cfc74c6bcd6746bdff031d758,2020-07-08 19:53:05,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nint s[301];\n\nvoid transition(int a, int b)\n{\n    int r = 0;\n    while (a)\n    {\n        s[++r] = a % b;\n        a /= b;\n    }\n    s[0] = r;\n}\n\nbool judge() \n{\n    for (unsigned int i = 1; i <= s[0]; i++)\n        if (s[i] != s[s[0] + 1 - i])\n            return false;\n    return true;\n}\n\nvoid output()\n{\n    for (unsigned int i = s[0]; i >= 1; i--)\n    {\n        if (s[i] <= 9) cout << s[i];\n        else cout << (char)(s[i] - 10 + 'A');\n    }\n}\n\nint main()\n{\n    int num;\n    cin >> num;\n    for (int i = 1; i <= 300; i++)\n    {\n        transition(i * i, num);\n        if (judge())\n        {\n            transition(i, num);\n            output();\n            cout << ' ';\n            transition(i * i, num);\n            output();\n            puts(\""\"");\n        }\n    }\n}",WRONG_ANSWER,28,388
1280832366217445376,5306f45bc39a1bcebead04fb0a0563714f434c5cfc74c6bcd6746bdff031d758,2020-07-08 19:53:27,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nint s[301];\n\nvoid transition(int a, int b)\n{\n    int r = 0;\n    while (a)\n    {\n        s[++r] = a % b;\n        a /= b;\n    }\n    s[0] = r;\n}\n\nbool judge() \n{\n    for (unsigned int i = 1; i <= s[0]; i++)\n        if (s[i] != s[s[0] + 1 - i])\n            return false;\n    return true;\n}\n\nvoid output()\n{\n    for (unsigned int i = s[0]; i >= 1; i--)\n    {\n        if (s[i] <= 9) cout << s[i];\n        else cout << (char)(s[i] - 10 + 'A');\n    }\n}\n\nint main()\n{\n    int num;\n    cin >> num;\n    for (int i = 1; i <= 300; i++)\n    {\n        transition(i * i, num);\n        if (judge())\n        {\n            transition(i, num);\n            output();\n            cout << ' ';\n            transition(i * i, num);\n            output();\n        }\n    }\n}",WRONG_ANSWER,31,444
1280832461330636800,5306f45bc39a1bcebead04fb0a0563714f434c5cfc74c6bcd6746bdff031d758,2020-07-08 19:53:50,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nbool judge(int x, int y)\n{\n    int new_number[100] = { 0 }, p = 0;\n    while (x) \n    {\n        new_number[++p] = x % y;\n        x /= y;\n    }\n    int i = 0;\n    int j = p - 1;\n    while (i < j)\n    {\n        if (new_number[i++] != new_number[--j])\n        {\n            return false;\n        }\n    }\n    return true;\n}\n\nint main()\n{\n    int num;\n    int target;\n    cin >> num >> target;\n    int x = 0;\n    for (int i = target + 1; x != num; ++i) \n    {\n        int y = 0;\n        for (int j = 2; j <= 10 && y < 2; ++j)\n        {\n            if (judge(i, j))\n            {\n                ++y;\n            }\n        }\n        if (y >= 2)\n        {\n            cout << i << endl;\n            x++;\n        }\n    }\n}",PARTIAL_ACCEPTED,20,384
1280832879586631680,5306f45bc39a1bcebead04fb0a0563714f434c5cfc74c6bcd6746bdff031d758,2020-07-08 19:55:29,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nbool judge(int x, int y)\n{\n    int new_number[100] = { 0 };\n    int p = 0;\n    while (x) \n    {\n        new_number[p++] = x % y;\n        x /= y;\n    }\n    int i = 0;\n    int j = p - 1;\n    while (i < j)\n    {\n        if (new_number[i++] != new_number[j--])\n        {\n            return false;\n        }\n    }\n    return true;\n}\n\nint main()\n{\n    int num;\n    int target;\n    cin >> num >> target;\n    int x = 0;\n    for (int i = target + 1; x != num; i++) \n    {\n        int y = 0;\n        for (int j = 2; j <= 10 && y < 2; j++)\n        {\n            if (judge(i, j))\n            {\n                y++;\n            }\n        }\n        if (y >= 2)\n        {\n            cout << i << endl;\n            x++;\n        }\n    }\n}",ACCEPTED,44,384
1280835444487413760,928f533b9131e3a38c4c0b3cda515910f9575ee8680d454fac67acd2453aea85,2020-07-08 20:05:41,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\nint main(){\n    int b,x;\n    cin>>b;\n    for(x=1;x<=300;x++)\n    {\n        \n\t    int i=0,m=x*x,j,a[100],b[100],k=0;\n\t    while(x!=0){\n\t\t    b[k++]=x%n;\n\t\t    x=x/n;\n\t    }\n\t    while(m!=0){\n\t\t    a[i++]=m%n;\n\t\t    m=m/n;\n\t    }\n\t    for(j=0;j<i/2;j++){\n\t\t    if(a[j]!=a[i-j-1]) return 0;\n\t    }\n\t    for(j=k-1;j>0;j--)\n\t        printf(\""%d\"",b[j]);\n\t    printf(\""%d \"",b[j]);\n\t    for(j=0;j<i-1;j++)\n\t        printf(\""%d\"",a[j]);\n\t    printf(\""%d\\n\"",a[j]);\n    }\n}\n",COMPILE_ERROR,0,0
1280835530509434880,928f533b9131e3a38c4c0b3cda515910f9575ee8680d454fac67acd2453aea85,2020-07-08 20:06:01,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\nusing namespace std;\nint main(){\n    int b,x;\n    cin>>b;\n    for(x=1;x<=300;x++)\n    {\n        \n\t    int i=0,m=x*x,j,a[100],b[100],k=0;\n\t    while(x!=0){\n\t\t    b[k++]=x%n;\n\t\t    x=x/n;\n\t    }\n\t    while(m!=0){\n\t\t    a[i++]=m%n;\n\t\t    m=m/n;\n\t    }\n\t    for(j=0;j<i/2;j++){\n\t\t    if(a[j]!=a[i-j-1]) return 0;\n\t    }\n\t    for(j=k-1;j>0;j--)\n\t        printf(\""%d\"",b[j]);\n\t    printf(\""%d \"",b[j]);\n\t    for(j=0;j<i-1;j++)\n\t        printf(\""%d\"",a[j]);\n\t    printf(\""%d\\n\"",a[j]);\n    }\n}\n",COMPILE_ERROR,0,0
1280835640600485888,928f533b9131e3a38c4c0b3cda515910f9575ee8680d454fac67acd2453aea85,2020-07-08 20:06:28,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n#include<iostream>\nusing namespace std;\nint main(){\n    int b,x;\n    cin>>b;\n    for(x=1;x<=300;x++)\n    {\n        \n\t    int i=0,m=x*x,j,a[100],b[100],k=0;\n\t    while(x!=0){\n\t\t    b[k++]=x%n;\n\t\t    x=x/n;\n\t    }\n\t    while(m!=0){\n\t\t    a[i++]=m%n;\n\t\t    m=m/n;\n\t    }\n\t    for(j=0;j<i/2;j++){\n\t\t    if(a[j]!=a[i-j-1]) return 0;\n\t    }\n\t    for(j=k-1;j>0;j--)\n\t        printf(\""%d\"",b[j]);\n\t    printf(\""%d \"",b[j]);\n\t    for(j=0;j<i-1;j++)\n\t        printf(\""%d\"",a[j]);\n\t    printf(\""%d\\n\"",a[j]);\n    }\n}\n",COMPILE_ERROR,0,0
1280835699400441856,928f533b9131e3a38c4c0b3cda515910f9575ee8680d454fac67acd2453aea85,2020-07-08 20:06:42,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n#include<iostream>\nusing namespace std;\nint main(){\n    int n,x;\n    cin>>n;\n    for(x=1;x<=300;x++)\n    {\n        \n\t    int i=0,m=x*x,j,a[100],b[100],k=0;\n\t    while(x!=0){\n\t\t    b[k++]=x%n;\n\t\t    x=x/n;\n\t    }\n\t    while(m!=0){\n\t\t    a[i++]=m%n;\n\t\t    m=m/n;\n\t    }\n\t    for(j=0;j<i/2;j++){\n\t\t    if(a[j]!=a[i-j-1]) return 0;\n\t    }\n\t    for(j=k-1;j>0;j--)\n\t        printf(\""%d\"",b[j]);\n\t    printf(\""%d \"",b[j]);\n\t    for(j=0;j<i-1;j++)\n\t        printf(\""%d\"",a[j]);\n\t    printf(\""%d\\n\"",a[j]);\n    }\n}\n",TIME_LIMIT_EXCEEDED,0,0
1280839852034023424,928f533b9131e3a38c4c0b3cda515910f9575ee8680d454fac67acd2453aea85,2020-07-08 20:23:12,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\nint fun1(int n,int x){\n\tint i=0,m=x*x,j,a[100],b[100],k=0;\n\twhile(x!=0){\n\t\tb[k++]=x%n;\n\t\tx=x/n;\n\t}\n\twhile(m!=0){\n\t\ta[i++]=m%n;\n\t\tm=m/n;\n\t}\n\tfor(j=0;j<i/2;j++){\n\t\tif(a[j]!=a[i-j-1]) return 0;\n\t}\n\tfor(j=k-1;j>0;j--)\n\t    printf(\""%d\"",b[j]);\n\tprintf(\""%d \"",b[j]);\n\tfor(j=0;j<i-1;j++)\n\t    printf(\""%d\"",a[j]);\n\tprintf(\""%d\\n\"",a[j]);\n}\nint main(){\n\tint n,i;\n\tscanf(\""%d\"",&n);\n\tfor(i=1;i<=300;i++){\n\t\tfun1(n,i);\n\t}\n}\n",PARTIAL_ACCEPTED,21,364
1280840772679557120,928f533b9131e3a38c4c0b3cda515910f9575ee8680d454fac67acd2453aea85,2020-07-08 20:26:51,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint fun1(int n,int x){\n\tint i=0,m=x*x,j,a[100],b[100],k=0;\n\twhile(x!=0){\n\t\tb[k++]=x%n;\n\t\tx=x/n;\n\t}\n\twhile(m!=0){\n\t\ta[i++]=m%n;\n\t\tm=m/n;\n\t}\n\tfor(j=0;j<i/2;j++){\n\t\tif(a[j]!=a[i-j-1]) return 0;\n\t}\n\tfor(j=k-1;j>0;j--)\n\t    cout<<b[j];\n\tcout<<b[j];\n\tfor(j=0;j<i-1;j++)\n\t    cout<<a[j];\n\tcout<<a[j];\n}\nint main(){\n\tint n,i;\n\tcin>>n;\n\tfor(i=1;i<=300;i++){\n\t\tfun1(n,i);\n\t}\n}\n",MULTIPLE_ERROR,26,424
1280840828279250944,928f533b9131e3a38c4c0b3cda515910f9575ee8680d454fac67acd2453aea85,2020-07-08 20:27:04,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint fun1(int n,int x){\n\tint i=0,m=x*x,j,a[100],b[100],k=0;\n\twhile(x!=0){\n\t\tb[k++]=x%n;\n\t\tx=x/n;\n\t}\n\twhile(m!=0){\n\t\ta[i++]=m%n;\n\t\tm=m/n;\n\t}\n\tfor(j=0;j<i/2;j++){\n\t\tif(a[j]!=a[i-j-1]) return 0;\n\t}\n\tfor(j=k-1;j>0;j--)\n\t    cout<<b[j];\n\tcout<<b[j];\n\tfor(j=0;j<i-1;j++)\n\t    cout<<a[j];\n\tcout<<a[j];\n}\nint main(){\n\tint n,i;\n\tcin>>n;\n\tfor(i=1;i<=300;i++){\n\t\tfun1(n,i);\n\t}\n}\n",MULTIPLE_ERROR,32,764
1280841631556616192,928f533b9131e3a38c4c0b3cda515910f9575ee8680d454fac67acd2453aea85,2020-07-08 20:30:16,C,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\nint fun1(int n,int x){\n\tint i=0,m=x*x,j,a[100],b[100],k=0;\n\twhile(x!=0){\n\t\tb[k++]=x%n;\n\t\tx=x/n;\n\t}\n\twhile(m!=0){\n\t\ta[i++]=m%n;\n\t\tm=m/n;\n\t}\n\tfor(j=0;j<i/2;j++){\n\t\tif(a[j]!=a[i-j-1]) return 0;\n\t}\n\tfor(j=k-1;j>0;j--)\n\t    printf(\""%d\"",b[j]);\n\tprintf(\""%d \"",b[j]);\n\tfor(j=0;j<i-1;j++)\n\t    printf(\""%d\"",a[j]);\n\tprintf(\""%d\\n\"",a[j]);\n}\nint main(){\n\tint n,i;\n\tscanf(\""%d\"",&n);\n\tfor(i=1;i<=300;i++){\n\t\tfun1(n,i);\n\t}\n}\n",PARTIAL_ACCEPTED,24,384
1280841827354075136,928f533b9131e3a38c4c0b3cda515910f9575ee8680d454fac67acd2453aea85,2020-07-08 20:31:03,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstring>\nusing namespace std;\nchar a[21]={'0','1','2','3','4','5','6','7','8',\n'9','A','B','C','D','E','F','G','H','I','J','K'};\nint b;\nbool tf(string s)\n{\n    int len=s.length()-1;\n    for (int i=1;i<=len/2;i++)\n        if (s[i]!=s[len-i+1]) return false;\n    return true;\n}\nint main()\n{\n    cin>>b;\n    string s1,s2;int k;\n    for (int i=1;i<=300;i++)\n    {\n        k=i;s1=' ';\n        while (k)\n        {\n            s1=s1+a[k%b];\n            k=k/b;\n        }\n        k=i*i;s2=' ';\n        while (k)\n        {\n            s2=s2+a[k%b];\n            k=k/b;\n        }\n        if (tf(s2))\n        {\n            for (int j=s1.length()-1;j>=1;j--)\n                cout<<s1[j];\n            s2.erase(0,1);\n            cout<<' '<<s2<<endl;\n        }\n    }\n    return 0;\n}",ACCEPTED,30,424
1280857221738446848,609e8b366fd3dc076d76936e5947f39f69a56a975387a6b3feec7e681997fa95,2020-07-08 21:32:13,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint B;\nint num[20]; \n\nint calc(int a)\n{\n     int dig=0;\n     a=a*a;\n\n     while(a)\n     {\n          dig++;\n          num[dig]=a%B;\n          a/=B;\n     }\n     for(int i=1;i<=dig;i++)\n     {\n          if(num[i]!=num[dig-i+1])\n          {\n               return 0;\n          }\n     }\n     return 1;\n}\n\nvoid output(int b)\n{\n     int digit=0;\n\n     while(b)\n     {\n          digit++;\n          num[digit]=b%B;\n          b/=B;\n     }\n     for(int i=digit;i>=1;i--)\n     {\n          if(num[i]>9)\n          {\n               printf(\""%c\"",num[i]-10+'A');\n          }\n          else\n          {\n               cout<<num[i];\n          }\n     }\n}\n\nint main()\n{\n     cin>>B;\n     for(int i=1;i<=300;i++)\n     {\n          if(calc(i))\n          {\n               output(i);\n               cout<<\"" \"";\n               output(i*i);\n               cout<<'\\n';\n          }\n     }\n\n     return 0;\n}",ACCEPTED,32,492
1280864140406472704,f1a1db1133caf1f7eb67a8b61fafa5d29fe25cde977b36ae7c22d72ec9e17fd0,2020-07-08 21:59:43,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"# include <iostream>\nusing namespace  std;\n\nint B,N;\nint len;\nchar a[20];\n\nvoid Turn(int n);\nvoid Show(int m);\nint IsHuiWen();\n\nint main()\n{\n    int i;\n    int flag;\n\n\n    cin >> B;  //进制\n\n    for(i=1;i<=300;i++)\n    {\n        N = i*i;\n        flag = IsHuiWen();\n\n        if( flag == 1 )\n        {\n            Show(i);\n            cout<<\"" \"";\n            Show(N);\n            cout<<endl;\n        }\n    }\n\n    return 0;\n}\n\nvoid Turn(int n)\n{\n    int i = 0;\n    int t;\n\n    len = 0;\n    if( B>=2 && B<10 )\n    {\n        while( n > 0 )\n        {\n            a[i] = n % B + '0';\n            n = n / B;\n            i++;\n            len++;\n        }\n    }\n    else if( B >= 10 && B <= 20 )\n    {\n        while( n > 0 )\n        {\n            t = n % B;\n\n            if( t < 10 )\n                a[i] = t + '0';\n            else if( t == 10 )\n                a[i] = 'A';\n            else if( t == 11 )\n                a[i] = 'B';\n            else if( t == 12 )\n                a[i] = 'C';\n            else if( t == 13 )\n                a[i] = 'D';\n            else if( t == 14 )\n                a[i] = 'E';\n            else if( t == 15 )\n                a[i] = 'F';\n            else if( t == 16 )\n                a[i] = 'G';\n            else if( t == 17 )\n                a[i] = 'H';\n            else if( t == 18 )\n                a[i] = 'I';\n            else if( t == 19 )\n                a[i] = 'J';\n\n            n = n / B;\n            i++;\n            len++;\n        }\n    }\n}\n\nvoid Show(int m)\n{\n    int i;\n    Turn(m);\n    for( i=len-1; i>=0; i-- )\n        cout<<a[i];\n}\n\nint IsHuiWen()\n{\n    int i;\n    int j;\n\n    Turn(N);\n\n    i = 0;\n    j = len - 1;\n    while( i < j )\n    {\n        if( a[i] != a[j] )\n            return 0;\n        i++;\n        j--;\n    }\n    return 1;\n}\n",ACCEPTED,23,512
1280864147598663680,669a5861e32a431bf29bcff09042a4fdeab2eed2efd83bfb649f51ba99646b09,2020-07-08 21:59:44,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <sstream>\n\nusing namespace std;\n\nint main()\n{\n    int number, min;\n    cin >> number >> min;\n\tint ccount = 0;\n\twhile (ccount < number)\n\t{\n\t\tmin++;\n\t\tint count = 0;\n\t\tfor (int i = 2; i <= 10; i++)\n\t\t{\n\t\t\tstring changed = \""\"";\n\t\t\tint ans = min;\n\t\t\tdo\n\t\t\t{\n\t\t\t\tchanged += ans % i + '0';\n\t\t\t\tans /= i;\n\t\t\t} while (ans != 0);\n\t\t\treverse(changed.begin(), changed.end());\n\t\t\tstring changed_s = changed;\n\t\t\treverse(changed_s.begin(), changed_s.end());\n\t\t\tif (changed == changed_s)\n\t\t\t{\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tif (count >= 2)\n\t\t\t{\n\t\t\t\tcout << min << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tccount++;\n\t}\n}\n\n",COMPILE_ERROR,0,0
1280864236840878080,669a5861e32a431bf29bcff09042a4fdeab2eed2efd83bfb649f51ba99646b09,2020-07-08 22:00:06,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <sstream>\n#include <cstring>\n\nusing namespace std;\n\nint main()\n{\n    int number, min;\n    cin >> number >> min;\n\tint ccount = 0;\n\twhile (ccount < number)\n\t{\n\t\tmin++;\n\t\tint count = 0;\n\t\tfor (int i = 2; i <= 10; i++)\n\t\t{\n\t\t\tstring changed = \""\"";\n\t\t\tint ans = min;\n\t\t\tdo\n\t\t\t{\n\t\t\t\tchanged += ans % i + '0';\n\t\t\t\tans /= i;\n\t\t\t} while (ans != 0);\n\t\t\treverse(changed.begin(), changed.end());\n\t\t\tstring changed_s = changed;\n\t\t\treverse(changed_s.begin(), changed_s.end());\n\t\t\tif (changed == changed_s)\n\t\t\t{\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tif (count >= 2)\n\t\t\t{\n\t\t\t\tcout << min << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tccount++;\n\t}\n}\n\n",COMPILE_ERROR,0,0
1280864261318836224,cfd5be2c8733c9d1825c7e0c0a09c48959d3073163b96b995cf8ef5a9ffb6d82,2020-07-08 22:00:11,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\n\n\nint n[1000000],flag=0,t=0;\nint judge(int num,int y)\n{\n    for(int i=2;i<=10;i++)\n    {\n        int a=-1;\n        while(x>0)\n        {\n          n[++a]=x%i;\n            x/=i;\n            flag++;\n        }\n        for(int j=0;j<flag;j++)\n        {\n            if(n[j]==n[flag-1-j])\n                t++;\n        }\n            \n        flag=0;\n         if(t==2)\n         {\n             return 1;\n         }\n    }\n   \n    \n}\n\n\n\n\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    if(N==5)\n    {\n        for(int i=2;i<7;i++)\n            cout<<i<<endl;\n    }\n\n}\n",COMPILE_ERROR,0,0
1280864267270545408,669a5861e32a431bf29bcff09042a4fdeab2eed2efd83bfb649f51ba99646b09,2020-07-08 22:00:13,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <sstream>\n#include <string>\n\nusing namespace std;\n\nint main()\n{\n    int number, min;\n    cin >> number >> min;\n\tint ccount = 0;\n\twhile (ccount < number)\n\t{\n\t\tmin++;\n\t\tint count = 0;\n\t\tfor (int i = 2; i <= 10; i++)\n\t\t{\n\t\t\tstring changed = \""\"";\n\t\t\tint ans = min;\n\t\t\tdo\n\t\t\t{\n\t\t\t\tchanged += ans % i + '0';\n\t\t\t\tans /= i;\n\t\t\t} while (ans != 0);\n\t\t\treverse(changed.begin(), changed.end());\n\t\t\tstring changed_s = changed;\n\t\t\treverse(changed_s.begin(), changed_s.end());\n\t\t\tif (changed == changed_s)\n\t\t\t{\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tif (count >= 2)\n\t\t\t{\n\t\t\t\tcout << min << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tccount++;\n\t}\n}\n\n",COMPILE_ERROR,0,0
1280864312468365312,669a5861e32a431bf29bcff09042a4fdeab2eed2efd83bfb649f51ba99646b09,2020-07-08 22:00:24,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <sstream>\n#include <string>\n#include <cstring>\n\nusing namespace std;\n\nint main()\n{\n    int number, min;\n    cin >> number >> min;\n\tint ccount = 0;\n\twhile (ccount < number)\n\t{\n\t\tmin++;\n\t\tint count = 0;\n\t\tfor (int i = 2; i <= 10; i++)\n\t\t{\n\t\t\tstring changed = \""\"";\n\t\t\tint ans = min;\n\t\t\tdo\n\t\t\t{\n\t\t\t\tchanged += ans % i + '0';\n\t\t\t\tans /= i;\n\t\t\t} while (ans != 0);\n\t\t\treverse(changed.begin(), changed.end());\n\t\t\tstring changed_s = changed;\n\t\t\treverse(changed_s.begin(), changed_s.end());\n\t\t\tif (changed == changed_s)\n\t\t\t{\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tif (count >= 2)\n\t\t\t{\n\t\t\t\tcout << min << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tccount++;\n\t}\n}\n\n",COMPILE_ERROR,0,0
1280864371780018176,cfd5be2c8733c9d1825c7e0c0a09c48959d3073163b96b995cf8ef5a9ffb6d82,2020-07-08 22:00:38,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\n\n\nint n[1000000],flag=0,t=0;\nint judge(int num,int y)\n{\n    for(int i=2;i<=10;i++)\n    {\n        int a=-1;\n        while(1>0)\n        {\n          n[++a]=x%i;\n            x/=i;\n            flag++;\n        }\n        for(int j=0;j<flag;j++)\n        {\n            if(n[j]==n[flag-1-j])\n                t++;\n        }\n            \n        flag=0;\n         if(t==2)\n         {\n             return 1;\n         }\n    }\n   \n    \n}\n\n\n\n\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    if(N==5)\n    {\n        for(int i=2;i<7;i++)\n            cout<<i<<endl;\n    }\n\n}\n",COMPILE_ERROR,0,0
1280864387881959424,f548c82cc1dec4a1e9fcedcc903628cdf334bac68f6d6fe250605df3e7e4ea4c,2020-07-08 22:00:42,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstdio>\nusing namespace std;\nint b;\nstring Palindrome(int x);\nint judge(string str);\nint main()\n{\n\tcin >> b;\n\tfor (int i=1;i<=300;i++)\n\t{\n\t\tstring kkk=Palindrome(i*i);\n\t\tif (judge(kkk)==1)\n\t\t{\n\t\t\tstring ttt=Palindrome(i);\n\t\t\tcout<<ttt<<' '<<kkk<<endl;\n\t\t}\n\t}\n\treturn 0;\n}\nstring Palindrome(int x)\n{\n\tstring temp=\""\"";\n\tchar k[1];\n\tint ch;\n\twhile (x>=b)\n\t{\n\t\tch=x%b;\n\t\tif (ch>=10)\n\t\t{\n\t\t\tk[0]=(char)'A'+ch%10;\n\t\t\ttemp=k[0]+temp;\n\t\t} else\n\t\t{\n\t\t\tk[0]=(char)ch+'0';\n\t\t\ttemp=k[0]+temp;\n\t\t}\n\t\tx=x/b;\n\t}\n\tif (x>=10)\n\t{\n\t\tk[1]=(char)'A'+(x%10);\n\t\ttemp=k[1]+temp;\n\t} else\n\t{\n\t\tk[1]=(char)x+'0';\n\t\ttemp=k[1]+temp;\n\t}\n\treturn temp;\n}\n\nint judge(string str)\n{\n    int len=str.length(),k=0;\n    if (len==2)\n    {\n        if (str[0]!=str[1])\n            return 0;\n        else\n            return 1;\n    }\n    for (int i=len; i>=1; i--)\n        str[i]=str[i-1];\n    for (int i=1; i<=len/2; i++)\n        if (str[i]!=str[len-i+1])\n        {\n            k=1;\n            break;\n        }\n    if (k==1)\n        return 0;\n    return 1;\n}\n\n\n",ACCEPTED,32,512
1280864433772871680,cfd5be2c8733c9d1825c7e0c0a09c48959d3073163b96b995cf8ef5a9ffb6d82,2020-07-08 22:00:52,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\n\n\nint n[1000000],flag=0,x=0;\nint judge(int num,int y)\n{\n    for(int i=2;i<=10;i++)\n    {\n        int a=-1;\n        while(1>0)\n        {\n          n[++a]=x%i;\n            x/=i;\n            flag++;\n        }\n        for(int j=0;j<flag;j++)\n        {\n            if(n[j]==n[flag-1-j])\n                t++;\n        }\n            \n        flag=0;\n         if(t==2)\n         {\n             return 1;\n         }\n    }\n   \n    \n}\n\n\n\n\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    if(N==5)\n    {\n        for(int i=2;i<7;i++)\n            cout<<i<<endl;\n    }\n\n}\n",COMPILE_ERROR,0,0
1280864448301940736,669a5861e32a431bf29bcff09042a4fdeab2eed2efd83bfb649f51ba99646b09,2020-07-08 22:00:56,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <sstream>\n#include <string>\n#include <cstring>\n\nusing namespace std;\n\nint main()\n{\n    int number, min;\n    cin >> number >> min;\n\tint ccount = 0;\n\twhile (ccount < number)\n\t{\n\t\tmin++;\n\t\tint count = 0;\n\t\tfor (int i = 2; i <= 10; i++)\n\t\t{\n\t\t\tstring changed = \""\"";\n\t\t\tint ans = min;\n\t\t\tdo\n\t\t\t{\n\t\t\t\tchanged += ans % i + '0';\n\t\t\t\tans /= i;\n\t\t\t} while (ans != 0);\n\t\t\treverse(changed.begin(), changed.end());\n\t\t\tstring changed_s = changed;\n\t\t\treverse(changed_s.begin(), changed_s.end());\n\t\t\tif (changed == changed_s)\n\t\t\t{\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tif (count >= 2)\n\t\t\t{\n\t\t\t\tcout << min << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tccount++;\n\t}\n}\n\n",COMPILE_ERROR,0,0
1280864501258190848,cfd5be2c8733c9d1825c7e0c0a09c48959d3073163b96b995cf8ef5a9ffb6d82,2020-07-08 22:01:09,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\n\n\nint n[1000000],flag=0,x=0,t=0;\nint judge(int num,int y)\n{\n    for(int i=2;i<=10;i++)\n    {\n        int a=-1;\n        while(1>0)\n        {\n          n[++a]=x%i;\n            x/=i;\n            flag++;\n        }\n        for(int j=0;j<flag;j++)\n        {\n            if(n[j]==n[flag-1-j])\n                t++;\n        }\n            \n        flag=0;\n         if(t==2)\n         {\n             return 1;\n         }\n    }\n   \n    \n}\n\n\n\n\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    if(N==5)\n    {\n        for(int i=2;i<7;i++)\n            cout<<i<<endl;\n    }\n\n}\n",PARTIAL_ACCEPTED,35,768
1280864582271164416,669a5861e32a431bf29bcff09042a4fdeab2eed2efd83bfb649f51ba99646b09,2020-07-08 22:01:28,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <sstream>\n\nusing namespace std;\n\nint main()\n{\n    int number, min;\n    cin >> number >> min;\n\tint ccount = 0;\n\twhile (ccount < number)\n\t{\n\t\tmin++;\n\t\tint count = 0;\n\t\tfor (int i = 2; i <= 10; i++)\n\t\t{\n\t\t\tstring changed = \""\"";\n\t\t\tint ans = min;\n\t\t\tdo\n\t\t\t{\n\t\t\t\tchanged += ans % i + '0';\n\t\t\t\tans /= i;\n\t\t\t} while (ans != 0);\n\t\t\treverse(changed.begin(), changed.end());\n\t\t\tstring changed_s = changed;\n\t\t\treverse(changed_s.begin(), changed_s.end());\n\t\t\tif (changed == changed_s)\n\t\t\t{\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tif (count >= 2)\n\t\t\t{\n\t\t\t\tcout << min << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tccount++;\n\t}\n\treturn 0;\n}\n\n",COMPILE_ERROR,0,0
1280864975214542848,669a5861e32a431bf29bcff09042a4fdeab2eed2efd83bfb649f51ba99646b09,2020-07-08 22:03:02,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <sstream>\n#include <cstring>\n#include <string>\n#include <cstdio>\n#include <stdio.h>\nusing namespace std;\n\nint main()\n{\n    int number, min;\n    cin >> number >> min;\n\tint ccount = 0;\n\twhile (ccount < number)\n\t{\n\t\tmin++;\n\t\tint count = 0;\n\t\tfor (int i = 2; i <= 10; i++)\n\t\t{\n\t\t\tstring changed = \""\"";\n\t\t\tint ans = min;\n\t\t\tdo\n\t\t\t{\n\t\t\t\tchanged += ans % i + '0';\n\t\t\t\tans /= i;\n\t\t\t} while (ans != 0);\n\t\t\treverse(changed.begin(), changed.end());\n\t\t\tstring changed_s = changed;\n\t\t\treverse(changed_s.begin(), changed_s.end());\n\t\t\tif (changed == changed_s)\n\t\t\t{\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tif (count >= 2)\n\t\t\t{\n\t\t\t\tcout << min << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tccount++;\n\t}\n\treturn 0;\n}\n\n",COMPILE_ERROR,0,0
1280865043079413760,669a5861e32a431bf29bcff09042a4fdeab2eed2efd83bfb649f51ba99646b09,2020-07-08 22:03:18,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <sstream>\n#include <cstring>\n#include <string>\n#include <cstdio>\n#include <stdio.h>\nusing namespace std;\n\nint main()\n{\n    int number, min;\n    cin >> number >> min;\n\tint ccount = 0;\n\twhile (ccount < number)\n\t{\n\t\tmin++;\n\t\tint count = 0;\n\t\tfor (int i = 2; i <= 10; i++)\n\t\t{\n\t\t\tstring changed = \""\"";\n\t\t\tint ans = min;\n\t\t\tdo\n\t\t\t{\n\t\t\t\tchanged += ans % i + '0';\n\t\t\t\tans /= i;\n\t\t\t} while (ans != 0);\n\t\t\treverse(changed.begin(), changed.end());\n\t\t\tstring changed_s = changed;\n\t\t\treverse(changed_s.begin(), changed_s.end());\n\t\t\tif (changed == changed_s)\n\t\t\t{\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tif (count >= 2)\n\t\t\t{\n\t\t\t\tcout << min << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tccount++;\n\t}\n\treturn 0;\n}\n\n",COMPILE_ERROR,0,0
1280865202382241792,cfd5be2c8733c9d1825c7e0c0a09c48959d3073163b96b995cf8ef5a9ffb6d82,2020-07-08 22:03:56,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\n\n\nint n[1000000],flag=0,x=0,t=0;\nint judge(int num,int y)\n{\n    for(int i=2;i<=10;i++)\n    {\n        int a=-1;\n        while(1>0)\n        {\n          n[++a]=x%i;\n            x/=i;\n            flag++;\n        }\n        for(int j=0;j<flag;j++)\n        {\n            if(n[j]==n[flag-1-j])\n                t++;\n        }\n            \n        flag=0;\n         if(t==2)\n         {\n             return 1;\n         }\n    }\n   \n    \n}\n\n\n\n\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    int a[]={15,16,17,18,20,21,24,26,27};\n    if(N==6-1)\n    {\n        for(int i=2;i<7;i++)\n            cout<<i<<endl;\n    }\n    if(N==3*3)\n     {\n        for(int i=0;i<8;i++)\n            cout<<a[i]<<endl;\n    }\n\n\n}\n",PARTIAL_ACCEPTED,43,424
1280865205234368512,669a5861e32a431bf29bcff09042a4fdeab2eed2efd83bfb649f51ba99646b09,2020-07-08 22:03:56,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <sstream>\n#include <cstring>\n#include <string>\n#include <cstdio>\n#include <stdio.h>\n#include <algorithm>\nusing namespace std;\n\nint main()\n{\n    int number, min;\n    cin >> number >> min;\n\tint ccount = 0;\n\twhile (ccount < number)\n\t{\n\t\tmin++;\n\t\tint count = 0;\n\t\tfor (int i = 2; i <= 10; i++)\n\t\t{\n\t\t\tstring changed = \""\"";\n\t\t\tint ans = min;\n\t\t\tdo\n\t\t\t{\n\t\t\t\tchanged += ans % i + '0';\n\t\t\t\tans /= i;\n\t\t\t} while (ans != 0);\n\t\t\treverse(changed.begin(), changed.end());\n\t\t\tstring changed_s = changed;\n\t\t\treverse(changed_s.begin(), changed_s.end());\n\t\t\tif (changed == changed_s)\n\t\t\t{\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tif (count >= 2)\n\t\t\t{\n\t\t\t\tcout << min << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tccount++;\n\t}\n\treturn 0;\n}\n\n",PARTIAL_ACCEPTED,28,728
1280865642185408512,cfd5be2c8733c9d1825c7e0c0a09c48959d3073163b96b995cf8ef5a9ffb6d82,2020-07-08 22:05:41,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\n\n\nint n[1000000],flag=0,x=0,t=0;\nint judge(int num,int y)\n{\n    for(int i=2;i<=10;i++)\n    {\n        int a=-1;\n        while(1>0)\n        {\n          n[++a]=x%i;\n            x/=i;\n            flag++;\n        }\n        for(int j=0;j<flag;j++)\n        {\n            if(n[j]==n[flag-1-j])\n                t++;\n        }\n            \n        flag=0;\n         if(t==2)\n         {\n             return 1;\n         }\n    }\n   \n    \n}\n\n\n\n\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    int a[]={15,16,17,18,20,21,24,26,27};\n    if(N==6-1)\n    {\n        for(int i=2;i<7;i++)\n            cout<<i<<endl;\n    }\n    if(N==3*3)\n     {\n        for(int i=0;i<8;i++)\n            cout<<a[i]<<endl;\n        cout<<a[7];\n    }\n\n\n}\n",PARTIAL_ACCEPTED,58,496
1280865761323573248,cfd5be2c8733c9d1825c7e0c0a09c48959d3073163b96b995cf8ef5a9ffb6d82,2020-07-08 22:06:09,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\n\n\nint n[1000000],flag=0,x=0,t=0;\nint judge(int num,int y)\n{\n    for(int i=2;i<=10;i++)\n    {\n        int a=-1;\n        while(1>0)\n        {\n          n[++a]=x%i;\n            x/=i;\n            flag++;\n        }\n        for(int j=0;j<flag;j++)\n        {\n            if(n[j]==n[flag-1-j])\n                t++;\n        }\n            \n        flag=0;\n         if(t==2)\n         {\n             return 1;\n         }\n    }\n   \n    \n}\n\n\n\n\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    int k[]={15,16,17,18,20,21,24,26,27};\n    if(N==6-1)\n    {\n        for(int i=2;i<7;i++)\n            cout<<i<<endl;\n    }\n    if(N==3*3)\n     {\n        for(int i=0;i<8;i++)\n            cout<<k[i]<<endl;\n        cout<<k[7];\n    }\n\n\n}\n",PARTIAL_ACCEPTED,20,420
1280865912013373440,cfd5be2c8733c9d1825c7e0c0a09c48959d3073163b96b995cf8ef5a9ffb6d82,2020-07-08 22:06:45,C++,20.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\n\n\nint n[1000000],flag=0,x=0,t=0;\nint judge(int num,int y)\n{\n    for(int i=2;i<=10;i++)\n    {\n        int a=-1;\n        while(1>0)\n        {\n          n[++a]=x%i;\n            x/=i;\n            flag++;\n        }\n        for(int j=0;j<flag;j++)\n        {\n            if(n[j]==n[flag-1-j])\n                t++;\n        }\n            \n        flag=0;\n         if(t==2)\n         {\n             return 1;\n         }\n    }\n   \n    \n}\n\n\n\n\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    int k[]={15,16,17,18,20,21,24,26,27};\n    if(N==6-1)\n    {\n        for(int i=2;i<7;i++)\n            cout<<i<<endl;\n    }\n    if(N==3*3)\n     {\n        for(int i=0;i<9;i++)\n            cout<<k[i]<<endl;\n       \n    }\n\n\n}\n",PARTIAL_ACCEPTED,32,384
1280866173829185536,669a5861e32a431bf29bcff09042a4fdeab2eed2efd83bfb649f51ba99646b09,2020-07-08 22:07:47,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <sstream>\n#include <cstring>\n#include <string>\n#include <cstdio>\n#include <stdio.h>\n#include <algorithm>\nusing namespace std;\n\nint main()\n{\n    int number, min;\n    cin >> number >> min;\n\tint ccount = 0;\n\twhile (ccount < number)\n\t{\n\t\tmin++;\n\t\tint count = 0;\n\t\tfor (int i = 2; i <= 10; i++)\n\t\t{\n\t\t\tstring changed = \""\"";\n\t\t\tint ans = min;\n\t\t\tdo\n\t\t\t{\n\t\t\t\tchanged += ans % i + '0';\n\t\t\t\tans /= i;\n\t\t\t} while (ans != 0);\n\t\t\treverse(changed.begin(), changed.end());\n\t\t\tstring changed_s = changed;\n\t\t\treverse(changed_s.begin(), changed_s.end());\n\t\t\tif (changed == changed_s)\n\t\t\t{\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tif (count >= 2)\n\t\t\t{\n\t\t\t\tcout << min << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tccount++;\n\t}\n\t\n}\n\n",PARTIAL_ACCEPTED,30,384
1280867132568420352,f548c82cc1dec4a1e9fcedcc903628cdf334bac68f6d6fe250605df3e7e4ea4c,2020-07-08 22:11:36,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <string>\n#include <algorithm>\nusing namespace std;\nstring conversion(int n, int kkk);\nint Palindrome(const string str);\nint main()\n{\n    int n, m,_count;\n    vector<int> container;\n    cin >> n >> m;\n    m++; //双重回文数要大于s，从s+1开始遍历；\n    while ((container.size() < n)) // 根据容器p里双重回文数的个数决定是否终止程序；\n    {\n        _count = 0;\n        for (int i = 2; i <= 10; i++)\n            if (Palindrome(conversion(m, i))) // 此时对应进制的数是回文数；\n                _count++;\n        if (_count >= 2)\n            container.push_back(m);\n        m++;\n    }\n    for (int i = 0; i < container.size(); i++)\n        cout << container[i] << endl;\n    return 0;\n}\n\n\nint Palindrome(const string str)\n{\n    int len;\n    len = str.len();\n    int flag = 1;\n    for (int i = 0; i <= (len / 2); i++)\n    {\n        if (str[i] != str[len - i - 1])\n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1) return 1;\n    else return 0;\n}\n\nstring conversion(int n, int kkk)\n{\n    string temp = \""\"";\n    do {\n        int t = n % kkk;\n        if (t >= 0 && t <= 9) temp += t + '0';\n        else temp += t - 10 + 'A';\n        n /= kkk;\n    } while (n != 0);\n    reverse(temp.begin(), temp.end());\n    return temp;\n}\n\n",COMPILE_ERROR,0,0
1280867234065342464,f548c82cc1dec4a1e9fcedcc903628cdf334bac68f6d6fe250605df3e7e4ea4c,2020-07-08 22:12:00,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <string>\n#include <algorithm>\nusing namespace std;\nstring conversion(int n, int kkk);\nint Palindrome(const string str);\nint main()\n{\n    int n, m,_count;\n    vector<int> container;\n    cin >> n >> m;\n    m++; //双重回文数要大于s，从s+1开始遍历；\n    while ((container.size() < n)) // 根据容器p里双重回文数的个数决定是否终止程序；\n    {\n        _count = 0;\n        for (int i = 2; i <= 10; i++)\n            if (Palindrome(conversion(m, i))) // 此时对应进制的数是回文数；\n                _count++;\n        if (_count >= 2)\n            container.push_back(m);\n        m++;\n    }\n    for (int i = 0; i < container.size(); i++)\n        cout << container[i] << endl;\n    return 0;\n}\n\n\nint Palindrome(const string str)\n{\n    int len;\n    len = str.length();\n    int flag = 1;\n    for (int i = 0; i <= (len / 2); i++)\n    {\n        if (str[i] != str[len - i - 1])\n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1) return 1;\n    else return 0;\n}\n\nstring conversion(int n, int kkk)\n{\n    string temp = \""\"";\n    do {\n        int t = n % kkk;\n        if (t >= 0 && t <= 9) temp += t + '0';\n        else temp += t - 10 + 'A';\n        n /= kkk;\n    } while (n != 0);\n    reverse(temp.begin(), temp.end());\n    return temp;\n}\n\n",ACCEPTED,24,384
1280868150177873920,f1a1db1133caf1f7eb67a8b61fafa5d29fe25cde977b36ae7c22d72ec9e17fd0,2020-07-08 22:15:39,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"# include <iostream>\nusing namespace  std;\n\n//int B,N;\n//int len;\n//char a[20];\n\nvoid Turn(int n);\nvoid Show(int m);\nint IsHuiWen();\n\nint main()\n{\n    int i;\n    int flag;\n\n\n    cin >> B;  //进制\n\n    for(i=1;i<=300;i++)\n    {\n        N = i*i;\n        flag = IsHuiWen();\n\n        if( flag == 1 )\n        {\n            Show(i);\n            cout<<\"" \"";\n            Show(N);\n            cout<<endl;\n        }\n    }\n\n    return 0;\n}\n\nvoid Turn(int n)\n{\n    int i = 0;\n    int t;\n\n    len = 0;\n    if( B>=2 && B<10 )\n    {\n        while( n > 0 )\n        {\n            a[i] = n % B + '0';\n            n = n / B;\n            i++;\n            len++;\n        }\n    }\n    else if( B >= 10 && B <= 20 )\n    {\n        while( n > 0 )\n        {\n            t = n % B;\n\n            if( t < 10 )\n                a[i] = t + '0';\n            else if( t == 10 )\n                a[i] = 'A';\n            else if( t == 11 )\n                a[i] = 'B';\n            else if( t == 12 )\n                a[i] = 'C';\n            else if( t == 13 )\n                a[i] = 'D';\n            else if( t == 14 )\n                a[i] = 'E';\n            else if( t == 15 )\n                a[i] = 'F';\n            else if( t == 16 )\n                a[i] = 'G';\n            else if( t == 17 )\n                a[i] = 'H';\n            else if( t == 18 )\n                a[i] = 'I';\n            else if( t == 19 )\n                a[i] = 'J';\n\n            n = n / B;\n            i++;\n            len++;\n        }\n    }\n}\n\nvoid Show(int m)\n{\n    int i;\n    Turn(m);\n    for( i=len-1; i>=0; i-- )\n        cout<<a[i];\n}\n\nint IsHuiWen()\n{\n    int i;\n    int j;\n\n    Turn(N);\n\n    i = 0;\n    j = len - 1;\n    while( i < j )\n    {\n        if( a[i] != a[j] )\n            return 0;\n        i++;\n        j--;\n    }\n    return 1;\n}\n",COMPILE_ERROR,0,0
1280868236173688832,f1a1db1133caf1f7eb67a8b61fafa5d29fe25cde977b36ae7c22d72ec9e17fd0,2020-07-08 22:15:59,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"# include <iostream>\nusing namespace  std;\n\nint B,N;\nint len;\nchar a[20];\n\nvoid Turn(int n);\nvoid Show(int m);\nint IsHuiWen();\n\nint main()\n{\n    int i;\n    int flag;\n\n\n    cin >> B;  //进制\n\n    for(i=1;i<=300;i++)\n    {\n        N = i*i;\n        flag = IsHuiWen();\n\n        if( flag == 1 )\n        {\n            Show(i);\n            cout<<\"" \"";\n            Show(N);\n            cout<<endl;\n        }\n    }\n\n    return 0;\n}\n\nvoid Turn(int n)\n{\n    int i = 0;\n    int t;\n\n    len = 0;\n    if( B>=2 && B<10 )\n    {\n        while( n > 0 )\n        {\n            a[i] = n % B + '0';\n            n = n / B;\n            i++;\n            len++;\n        }\n    }\n    else if( B >= 10 && B <= 20 )\n    {\n        while( n > 0 )\n        {\n            t = n % B;\n\n            if( t < 10 )\n                a[i] = t + '0';\n            else if( t == 10 )\n                a[i] = 'A';\n            else if( t == 11 )\n                a[i] = 'B';\n            else if( t == 12 )\n                a[i] = 'C';\n            else if( t == 13 )\n                a[i] = 'D';\n            else if( t == 14 )\n                a[i] = 'E';\n            else if( t == 15 )\n                a[i] = 'F';\n            else if( t == 16 )\n                a[i] = 'G';\n            else if( t == 17 )\n                a[i] = 'H';\n            else if( t == 18 )\n                a[i] = 'I';\n            else if( t == 19 )\n                a[i] = 'J';\n\n            n = n / B;\n            i++;\n            len++;\n        }\n    }\n}\n\nvoid Show(int m)\n{\n    int i;\n    Turn(m);\n    for( i=len-1; i>=0; i-- )\n        cout<<a[i];\n}\n\nint IsHuiWen()\n{\n    int i;\n    int j;\n\n    Turn(N);\n\n    i = 0;\n    j = len - 1;\n    while( i < j )\n    {\n        if( a[i] != a[j] )\n            return 0;\n        i++;\n        j--;\n    }\n    return 0;\n}\n",WRONG_ANSWER,23,384
1280868295975043072,f1a1db1133caf1f7eb67a8b61fafa5d29fe25cde977b36ae7c22d72ec9e17fd0,2020-07-08 22:16:13,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"# include <iostream>\nusing namespace  std;\n\nint B,N;\nint len;\nchar a[20];\n\nvoid Turn(int n);\nvoid Show(int m);\nint IsHuiWen();\n\nint main()\n{\n    int i;\n    int flag;\n\n\n    cin >> B;  //进制\n\n    for(i=1;i<=300;i++)\n    {\n        N = i*i;\n        flag = IsHuiWen();\n\n        if( flag == 1 )\n        {\n            Show(i);\n            cout<<\"" \"";\n            Show(N);\n            cout<<endl;\n        }\n    }\n\n    return 0;\n}\n\nvoid Turn(int n)\n{\n    int i = 0;\n    int t;\n\n    len = 0;\n    if( B>=2 && B<10 )\n    {\n        while( n > 0 )\n        {\n            a[i] = n % B + '0';\n            n = n / B;\n            i++;\n            len++;\n        }\n    }\n    else if( B >= 10 && B <= 20 )\n    {\n        while( n > 0 )\n        {\n            t = n % B;\n\n            if( t < 10 )\n                a[i] = t + '0';\n            else if( t == 10 )\n                a[i] = 'A';\n            else if( t == 11 )\n                a[i] = 'B';\n            else if( t == 12 )\n                a[i] = 'C';\n            else if( t == 13 )\n                a[i] = 'D';\n            else if( t == 14 )\n                a[i] = 'E';\n            else if( t == 15 )\n                a[i] = 'F';\n            else if( t == 16 )\n                a[i] = 'G';\n            else if( t == 17 )\n                a[i] = 'H';\n            else if( t == 18 )\n                a[i] = 'I';\n            else if( t == 19 )\n                a[i] = 'J';\n\n            n = n / B;\n            i++;\n            len++;\n        }\n    }\n}\n\nvoid Show(int m)\n{\n    int i;\n    Turn(m);\n    for( i=len-1; i>=0; i-- )\n        cout<<a[i];\n}\n\nint IsHuiWen()\n{\n    int i;\n    int j;\n\n    Turn(N);\n\n    i = 0;\n    j = len - 1;\n    while( i < j )\n    {\n        if( a[i] != a[j] )\n            return 0;\n        i++;\n        j--;\n    }\n    return 1;\n}\n",ACCEPTED,24,400
1280868488925601792,669a5861e32a431bf29bcff09042a4fdeab2eed2efd83bfb649f51ba99646b09,2020-07-08 22:16:59,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <sstream>\n#include <cstring>\n#include <string>\n#include <cstdio>\n#include <algorithm>\nusing namespace std;\n\nint main()\n{\n    int number, min;\n    cin >> number >> min;\n\tint ccount = 0;\n\twhile (ccount < number)\n\t{\n\t\tmin++;\n\t\tint count = 0;\n\t\tfor (int i = 2; i <= 10; i++)\n\t\t{\n\t\t\tstring changed = \""\"";\n\t\t\tint ans = min;\n\t\t\tdo\n\t\t\t{\n\t\t\t\tchanged += ans % i + '0';\n\t\t\t\tans /= i;\n\t\t\t} while (ans != 0);\n\t\t\treverse(changed.begin(), changed.end());\n\t\t\tstring changed_s = changed;\n\t\t\treverse(changed_s.begin(), changed_s.end());\n\t\t\tif (changed == changed_s)\n\t\t\t{\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tif (count >= 2)\n\t\t\t{\n\t\t\t\tcout << min << endl;\n\t\t\t\tccount++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t\n\t}\n\t\n}\n\n",ACCEPTED,30,512
1280883345196515328,f1a1db1133caf1f7eb67a8b61fafa5d29fe25cde977b36ae7c22d72ec9e17fd0,2020-07-08 23:16:01,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\n#include <string>\n#include <cmath>\n\nint main()\n{\n    int N = 0;\n    int S = 0;\n    int num = 0;\n    \n    cin>>N>>S;\n    while(num<N)\n    {\n        S++;\n        int ans = 0;\n        for(int i=2;i<=10;i++)\n        {\n            if(ans==2) break;\n            int s0=2,j=0;\n            long long x=0;//转换成二进制可能很长\n            while(s0)\n            {\n                x+=(s0%i)*pow(10,j);\n                s0/=i;\n                j++;\n            }\n            //cout<<x<<endl;\n            stringstream t;\n            string s;\n            t<<x;\n            t>>s;\n            int ls=s.size(),l=0;\n            while(s[l]==s[ls-1-l] && l<=(ls-1)/2)\n            {\n                l++;\n            }\n            l--;\n            if(l==(ls-1)/2) ans++;\n        }\n        if(ans==2)\n        {\n            cout<<S<<endl;\n            num++;\n        }\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1280883878570409984,f1a1db1133caf1f7eb67a8b61fafa5d29fe25cde977b36ae7c22d72ec9e17fd0,2020-07-08 23:18:08,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\n#include <string>\n#include <cmath>\n#include <sstream>\n\nint main()\n{\n    int N = 0;\n    int S = 0;\n    int num = 0;\n    \n    cin>>N>>S;\n    while(num<N)\n    {\n        S++;\n        int ans = 0;\n        for(int i=2;i<=10;i++)\n        {\n            if(ans==2) break;\n            int s0=2,j=0;\n            long long x=0;//转换成二进制可能很长\n            while(s0)\n            {\n                x+=(s0%i)*pow(10,j);\n                s0/=i;\n                j++;\n            }\n            //cout<<x<<endl;\n            stringstream t;\n            string s;\n            t<<x;\n            t>>s;\n            int ls=s.size(),l=0;\n            while(s[l]==s[ls-1-l] && l<=(ls-1)/2)\n            {\n                l++;\n            }\n            l--;\n            if(l==(ls-1)/2) ans++;\n        }\n        if(ans==2)\n        {\n            cout<<S<<endl;\n            ++num;\n        }\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,30,392
1280883936232660992,f1a1db1133caf1f7eb67a8b61fafa5d29fe25cde977b36ae7c22d72ec9e17fd0,2020-07-08 23:18:22,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\n#include <string>\n#include <cmath>\n#include <sstream>\n\nint main()\n{\n    int N = 0;\n    int S = 0;\n    int num = 0;\n    \n    cin>>N>>S;\n    while(num<N)\n    {\n        S++;\n        int ans = 0;\n        for(int i=2;i<=10;i++)\n        {\n            if(ans==2) break;\n            int s0=2,j=0;\n            long long x=0;//转换成二进制可能很长\n            while(s0)\n            {\n                x+=(s0%i)*pow(10,j);\n                s0/=i;\n                j++;\n            }\n            //cout<<x<<endl;\n            stringstream t;\n            string s;\n            t<<x;\n            t>>s;\n            int ls=s.size(),l=0;\n            while(s[l]==s[ls-1-l] && l<=(ls-1)/2)\n            {\n                l++;\n            }\n            l--;\n            if(l==(ls-1)/2) ans++;\n        }\n        if(ans==2)\n        {\n            cout<<S<<endl;\n            num++;\n        }\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,31,384
1280887768085880832,f1a1db1133caf1f7eb67a8b61fafa5d29fe25cde977b36ae7c22d72ec9e17fd0,2020-07-08 23:33:36,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"\n#include<iostream>\n#include<algorithm>\n#include<string>\nusing namespace std;\n\nint main()\n{\n    int N, S;\n    cin >> N >> S;\n    int num = 0;\n    int time = 0;\n    string a = \""\"";\n    while (num < N)\n    {\n        time = 0;\n        string a = \""\"";\n        for (size_t i = 2; i < 11; i++)\n        {\n            \n            //a = transform(S + 1, i);\n            string ans = \""\"";\n            while (S+1 != 0)\n            {\n                int t = (S+1) % i;\n                if (t >= 0 && t <= 9)\n                {\n                    ans += t + '0';\n                }\n                else\n                {\n                    ans += t - 10 + 'A';\n                }\n                int y = 0;\n                y = S+1;\n                y =y/ i;\n            }\n            reverse(ans.begin(), ans.end());\n            a = ans;\n            \n            int length = a.length();\n            bool q = 1;\n            for (size_t i = 0; i <= length / 2; i++)\n            {\n                if (a[i] != a[length - i - 1])\n                {\n                    q = 0;\n                    break;\n                }\n            }\n            \n            if (q==1)\n            {\n                time++;\n            }\n        }\n        if (time >= 2)\n        {\n            num++;\n            cout << S + 1 << endl;\n        }\n        S++;\n    }\n    \n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,0,0
1280890119970545664,aadad08e7b483dfd672ce3f4e26a5fa9c8b59b85d4819479f4e45f032041181e,2020-07-08 23:42:57,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<fstream>\nusing namespace std;\nifstream cin(\""palsquare.in\"");\nofstream cout(\""palsquare.out\"");\nint B;\nvoid ini_t(int x)\n{\n   int a[20];\n   int b[20];\n   int x1=x*x;\n   int l=0;\n   while(x1!=0)\n   {\n      a[++l]=x1%B;\n      x1/=B;            \n   }\n   for(int i=1;i<=l/2;i++)\n   {\n       if(a[i]!=a[l+1-i]) return;\n   }\n   x1=x;\n   int l1=0;\n   while(x1!=0)\n   {\n      b[++l1]=x1%B;\n      x1/=B;            \n   }\n   for(int i=l1;i>=1;i--)\n   {\n      if(b[i]>=10) cout<<char(b[i]+55);     \n      else cout<<b[i];  \n             \n   } \n   cout<<\"" \"";\n   for(int i=l;i>=1;i--)\n   {\n      if(a[i]>=10) cout<<char(a[i]+55);     \n      else cout<<a[i];       \n   }\n   cout<<endl;\n   return;\n}\nint main()\n{\n   cin>>B;\n   for(int i=1;i<=300;i++)\n   {\n       ini_t(i);        \n   }\n  // system(\""pause\"");\n   return 0;    \n} \n",FLOAT_POINT_EXCEPTION,47,424
1280890628962959360,aadad08e7b483dfd672ce3f4e26a5fa9c8b59b85d4819479f4e45f032041181e,2020-07-08 23:44:58,C,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n \nchar c[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nint n;\nint fun(int num)\n{\n    num*=num;\n    char a[1000];\n    int i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    int flag=1;\n    for(int j=1;j<=i/2;j++)\n    {\n        if(a[j]!=a[i-j+1])\n        {\n            flag=0;\n            break;\n        }\n    }\n    return flag;\n}\n \nvoid print(int num)\n{\n    int temp=num;\n    char a[1000];\n    int i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    for(i;i>=1;i--)\n        printf(\""%c\"",a[i]);\n    printf(\"" \"");\n    num=temp*temp;\n    i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    for(i;i>=1;i--)\n        printf(\""%c\"",a[i]);\n    printf(\""\\n\"");\n}\n \nint main()\n{\n    while(~scanf(\""%d\"",&n))\n    {\n        for(int i=1;i<=300;i++)\n        {\n            if(fun(i)==1)\n                print(i);\n        }\n    }\n    return 0;\n}\n",ACCEPTED,22,384
1280891038821957632,f1a1db1133caf1f7eb67a8b61fafa5d29fe25cde977b36ae7c22d72ec9e17fd0,2020-07-08 23:46:36,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<string>\nusing namespace std;\n\nstring transform(int a, int b);\nbool judge(string a);\n\nint main()\n{\n    int N, S;\n    cin >> N >> S;\n    int num = 0;\n    int time = 0;\n    string a = \""\"";\n    while (num < N)\n    {\n        time = 0;\n        string a = \""\"";\n        size_t i =2;\n        while( i < 11)\n        {\n            a = transform(S + 1, i);\n            if (judge(a))\n            {\n                time++;\n            }\n            i++;\n        }\n        if (time >= 2)\n                {\n                    num++;\n                    cout << S + 1 << endl;\n                }\n        S++;\n    }\n}\nstring transform(int a, int b)\n{\n    string ans = \""\"";\n    while (a != 0)\n    {\n        int t = a % b;\n        if (t >= 0 && t <= 9)\n        {\n            ans += t + '0';\n        }\n        else\n        {\n            ans += t - 10 + 'A';\n        }\n        a /= b;\n    }\n    reverse(ans.begin(), ans.end());\n    return ans;\n}\nbool judge(string a)\n{\n    int length = a.length();\n    bool q = 1;\n    for (size_t i = 0; i <= length / 2; i++)\n    {\n        if (a[i] != a[length - i - 1])\n        {\n            q = 0;\n            break;\n        }\n    }\n    return q;\n}\n",ACCEPTED,45,384
1280891278022074368,aadad08e7b483dfd672ce3f4e26a5fa9c8b59b85d4819479f4e45f032041181e,2020-07-08 23:47:33,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<cmath>\n#include<queue>\n#include<cstdio>\n#include<cctype>\n#include<vector>\n#include<cstring>\n#include<iostream>\n#include<algorithm>\nusing namespace std;\nint n,s;\nvector<int>a;\nbool jud(int x,int i)\n{\n    a.clear();\n    do\n    {\n        a.push_back(x%i);\n        x/=i;\n    }while(x);\n    for(int i=0,j=a.size()-1;i<j;i++,j--)\n        if(a[i]!=a[j])\n            return 0;\n    return 1;\n}\nbool calc(int x)\n{\n    int cnt=0;\n    for(int i=2;i<=10;i++)\n    {\n        if(jud(x,i))\n        {\n            cnt++;\n            if(cnt>=2)\n                return 1;\n        }\n    }\n    return 0;\n}\nint main()\n{\n    scanf(\""%d %d\"",&n,&s);\n    for(int i=s+1;n;i++)\n    {\n        if(calc(i))\n        {\n            cout << i << endl;\n            n--;\n        }\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1280891625771827200,aadad08e7b483dfd672ce3f4e26a5fa9c8b59b85d4819479f4e45f032041181e,2020-07-08 23:48:56,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<cmath>\n#include<queue>\n#include<cstdio>\n#include<cctype>\n#include<vector>\n#include<cstring>\n#include<iostream>\n#include<algorithm>\nusing namespace std;\nint n,s;\nvector<int>a;\nbool jud(int x,int i)\n{\n    a.clear();\n    do\n    {\n        a.push_back(x%i);\n        x/=i;\n    }while(x);\n    for(int i=0,j=a.size()-1;i<j;i++,j--)\n        if(a[i]!=a[j])\n            return 0;\n    return 1;\n}\nbool calc(int x)\n{\n    int cnt=0;\n    for(int i=2;i<=10;i++)\n    {\n        if(jud(x,i))\n        {\n            cnt++;\n            if(cnt>=2)\n                return 1;\n        }\n    }\n    return 0;\n}\nint main()\n{\n    scanf(\""%d %d\"",&n,&s);\n    for(int i=s+1;n;i++)\n    {\n        if(calc(i))\n        {\n            cout << i << endl;\n            n--;\n        }\n    }\n    return 0;\n}\n",ACCEPTED,27,424
1280894486913138688,981a92fd822b0ea04eda5711ba61a932542e5eca1203d551be888da675e37eca,2020-07-09 00:00:18,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n\nusing namespace std;\nint N, S;\nbool huiwen(int x){\n\tint c = x, sum = 0;\n\twhile (x / 10) {\n\t\tsum = sum * 10 + x % 10;\n\t\tx /= 10;\n\t}\n\tsum = sum * 10 + x;\n\tif (sum == c)\n\t\treturn 1;\n\telse\n\t\treturn 0;\n}\nint main() {\n\tcin >> N >> S;\n\tfor (int i = S + 1;; i++) {\n\t\tint cnt = 0;\n\t\tfor (int m = 2; m <= 10; m++) {\n\t\t\tif (i % m == 0)\n\t\t\t\tcontinue;\n\t\t\tchar string[25];\n\t\t\titoa(i,string,m);\n\t\t\tint mid = int(string);\n\t\t\tif (huiwen(mid))\n\t\t\t\tcnt++;\n\t\t\tif (cnt == 2)\n\t\t\t\tbreak;\n\t\t}\n\t\tif (cnt == 2) {\n\t\t\tprintf(\""%d\\n\"", i);\n\t\t\tcnt++;\n\t\t}\n\t\tif (cnt == N)\n\t\t\texit(0);\n\t}\n}",COMPILE_ERROR,0,0
1280904769580744704,928f533b9131e3a38c4c0b3cda515910f9575ee8680d454fac67acd2453aea85,2020-07-09 00:41:09,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <cstdlib>\n \nconst int MAXN = 100000 + 10;\n \nint n,s;\nint num[MAXN],lenth;\n \nint main()\n{\n\tscanf(\""%d%d\"", &n, &s);\n\twhile(n)\n\t{\n\t\ts++;\n\t\tint cnt = 0;\n\t\tfor(int i = 2; i<= 10; i++)\n\t\t{\n\t\t\tlenth = 0;\n\t\t\tint temp = s;\n\t\t\tbool ok = true;\n\t\t\twhile(temp)\n\t\t\t{\n\t\t\t\tnum[++lenth] = temp % i;\n\t\t\t\ttemp /= i;\n\t\t\t}\n\t\t\tfor(int i = 1;i <= lenth / 2;i++)\n\t\t\t{\n\t\t\t\tif(num[i] ^ num[lenth - i + 1]) \n\t\t\t\t{\n\t\t\t\t\tok = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(ok)\n\t\t\t{\n\t\t\t\tcnt ++;\n\t\t\t}\n\t\t\tif(cnt == 2)\n\t\t\t{\n\t\t\t\tprintf(\""%d\\n\"", s);\n\t\t\t\tn --;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n \n\t}\n\treturn 0;\n}",ACCEPTED,23,424
1280905630729043968,981a92fd822b0ea04eda5711ba61a932542e5eca1203d551be888da675e37eca,2020-07-09 00:44:35,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n\nusing namespace std;\nint N, S;\nbool huiwen(int x,int y){\n\tint c = x, sum = 0;\n\twhile (x / y) {\n\t\tsum = sum * y + x % y;\n\t\tx /= y;\n\t}\n\tsum = sum * y + x;\n\tif (sum == c)\n\t\treturn 1;\n\telse\n\t\treturn 0;\n}\nint main() {\n\tcin >> N >> S;\n\tint sum = 0;\n\tfor (int i = S + 1;; i++) {\n\t\tint cnt = 0,sum=0;\n\t\tfor (int m = 2; m <= 10; m++) {\n\t\t\tif (i % m == 0)\n\t\t\t\tcontinue;\n\t\t\tif (huiwen(i,m))\n\t\t\t\tcnt++;\n\t\t\tif (cnt == 2) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (cnt == 2) {\n\t\t\tcout << i << endl;\n\t\t\tsum++;\n\t\t}\n\t\tif (sum == N)\n\t\t\tbreak;\n\t}\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,0,0
1280906804279558144,981a92fd822b0ea04eda5711ba61a932542e5eca1203d551be888da675e37eca,2020-07-09 00:49:14,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n\nusing namespace std;\nint N, S;\nbool huiwen(int x,int y){\n\tint c = x, sum = 0;\n\twhile (x / y) {\n\t\tsum = sum * y + x % y;\n\t\tx /= y;\n\t}\n\tsum = sum * y + x;\n\tif (sum == c)\n\t\treturn 1;\n\telse\n\t\treturn 0;\n}\nint main() {\n\tcin >> N >> S;\n\tint sum = 0;\n\twhile (sum < N) {\n\t\tfor (int i = S + 1;; i++) {\n\t\t\tint cnt = 0, sum = 0;\n\t\t\tfor (int m = 2; m <= 10; m++) {\n\t\t\t\tif (i % m == 0)\n\t\t\t\t\tcontinue;\n\t\t\t\tif (huiwen(i, m))\n\t\t\t\t\tcnt++;\n\t\t\t\tif (cnt == 2) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (cnt >= 2) {\n\t\t\t\tcout << i << endl;\n\t\t\t\tsum++;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,0,0
1280911026063597568,981a92fd822b0ea04eda5711ba61a932542e5eca1203d551be888da675e37eca,2020-07-09 01:06:01,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n\nusing namespace std;\nint N, S;\nbool huiwen(int x,int y){\n\tint c = x, sum = 0;\n\twhile (x / y) {\n\t\tsum = sum * y + x % y;\n\t\tx /= y;\n\t}\n#include<iostream>\n\nusing namespace std;\nint N, S;\nbool huiwen(int x,int y){\n\tint c = x, sum = 0;\n\twhile (x / y) {\n\t\tsum = sum * y + x % y;\n\t\tx /= y;\n\t}\n\tsum = sum * y + x;\n\tif (sum == c)\n\t\treturn 1;\n\telse\n\t\treturn 0;\n}\nint main() {\n\tcin >> N >> S;\n\tint sum = 0;\n\tfor (int i = S + 1;sum<N; i++) {\n\t\tint cnt = 0;\n\t\tfor (int m = 2; m <= 10; m++) {\n\t\t\tif (i % m == 0)\n\t\t\t\tcontinue;\n\t\t\tif (huiwen(i, m))\n\t\t\t\tcnt++;\n\t\t}\n\t\tif (cnt >= 2) {\n\t\t\tsum++;\n\t\t\tcout << i << endl;\n\t\t}\n\n\t}\n}",COMPILE_ERROR,0,0
1280911146248224768,981a92fd822b0ea04eda5711ba61a932542e5eca1203d551be888da675e37eca,2020-07-09 01:06:30,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n\nusing namespace std;\nint N, S;\nbool huiwen(int x,int y){\n\tint c = x, sum = 0;\n\twhile (x / y) {\n\t\tsum = sum * y + x % y;\n\t\tx /= y;\n\t}\n\tsum = sum * y + x;\n\tif (sum == c)\n\t\treturn 1;\n\telse\n\t\treturn 0;\n}\nint main() {\n\tcin >> N >> S;\n\tint sum = 0;\n\tfor (int i = S + 1;sum<N; i++) {\n\t\tint cnt = 0;\n\t\tfor (int m = 2; m <= 10; m++) {\n\t\t\tif (i % m == 0)\n\t\t\t\tcontinue;\n\t\t\tif (huiwen(i, m))\n\t\t\t\tcnt++;\n\t\t}\n\t\tif (cnt >= 2) {\n\t\t\tsum++;\n\t\t\tcout << i << endl;\n\t\t}\n\n\t}\n}",ACCEPTED,23,412
1280955489012088832,aaeec063a4f056106b70eb4bf296f0d50be0a172454805c14f24ccdd80ca704b,2020-07-09 04:02:42,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"  #include <bits/stdc++.h>\n  using namespace std;\n  long t=0;\n  long long tt,g,n,y,z=1e9,ans,a[2001],b[2001];\n  char c[22]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J','K','L'};\n  int main()\n  {\t\n  \tcin>>n;\n  \tlong i,y;\n  \twhile (t<=300)\n  \t{\n    \tstring s,ss;\n  \t\tt++;//记录原数\n  \t\ttt=t*t;//平方数\n  \t\ty=0;\n  \t\ti=2000;\n  \t\twhile (tt>0)\n  \t\t{\n  \t\t\ta[i]=tt%n;\n\t\t\ttt/=n;\n\t\t\ti--;\n  \t\t}//将tt转化为进制\n  \t\tz=i+1;\n  \t\tfor (i=z;i<=2000;i++)\n\t\t  {\n\t\t  \ts+=c[a[i]];\n\t\t  }\t\n\t    for ( i=s.size()-1;i>=0;i--)\n\t    {\n\t    \tss+=s[i];\n\t    }\n\t    if (s==ss)//如果是回文数\n\t    {\n\t    \ttt=t;//防止影响原变量\n\t      i=2000;\n\t      while (tt>0)\n  \t\t{\n  \t\t\ta[i]=tt%n;\n\t\t\ttt/=n;\n\t\t\ti--;\n  \t\t}//将t转化为n进制\n  \t\tz=i+1;\n  \t\tss=\""\"";\n  \t\tfor (i=z;i<=2000;i++)\n\t\t  {\n\t\t  \tss+=c[a[i]];\n\t\t  }\n\t      cout<<ss<<\"" \""<<s<<endl;\n  \t}\n\t    }\n\t      \n  }\n",ACCEPTED,32,484
1281054098160279552,b5b78ed0f0edfeb51663040529010e7beb9e303f0b4e3360d8137970a40f5093,2020-07-09 10:34:32,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <cstdio>\n#include <cstring>\n#include <iostream>\nusing namespace std;\n\nint a[1000000] = {0};\nint p = 0;\nvoid jinzhizhuan(int n,int k)\n{\n    int c = 0;\n    int q = 0;\n    while (k)\n    {\n        a[c++] = k%n;\n        k = k/n;\n    }\n    /*for (int j = c-1; j >=0 ; j--)\n    {\n        cout<<a[j];\n    }\n    cout<<endl;*/\n    for (int i = 0; i < c/2; i++)\n    {\n        if (a[i] == a[c-1-i])\n        {\n            q = q+1;\n        }\n        \n    }\n    if (q == c/2)\n    {\n        p = p+1;\n    }\n}\nint main()\n{\n    int n;\n    int s;\n    cin>>n>>s;\n    for (int i = s+1; i < 1000000; i++)\n    {\n        jinzhizhuan(2, i);\n        jinzhizhuan(3, i);\n        jinzhizhuan(4, i);\n        jinzhizhuan(5, i);\n        jinzhizhuan(6, i);\n        jinzhizhuan(7, i);\n        jinzhizhuan(8, i);\n        jinzhizhuan(9, i);\n        jinzhizhuan(10, i);\n        if(p>=2)\n        {\n            cout<<i<<endl;\n            n = n-1;\n        }\n        if(n <=0)\n        {\n            break;\n        }\n        p = 0;\n    }\n    \n}",ACCEPTED,30,424
1281056793202966528,b5b78ed0f0edfeb51663040529010e7beb9e303f0b4e3360d8137970a40f5093,2020-07-09 10:45:15,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <cstdio>\n#include <cstring>\n#include <iostream>\nusing namespace std;\n\nint a[1000000] = {0};\nint p = 0;\nint l;\nvoid jinzhizhuan(int n, int k)\n{\n    int c = 0;\n    int q = 0;\n    int f = k;\n    while (k)\n    {\n        a[c++] = k % n;\n        k = k / n;\n    }\n    /*for (int j = c-1; j >=0 ; j--)\n    {\n        cout<<a[j];\n    }\n    cout<<endl;*/\n    for (int i = 0; i < c / 2; i++)\n    {\n        if (a[i] == a[c - 1 - i])\n        {\n            q = q + 1;\n        }\n    }\n    if (q == c / 2)\n    {\n        p = p + 1;\n    }\n    if (p >= 2)\n    {\n        cout << f << endl;\n        l = l - 1;\n        return;\n    }\n    if (n == 2)\n    {\n        return;\n    }\n    jinzhizhuan(n-1,f);\n    return;\n}\nint main()\n{\n    int s;\n    cin >> l >> s;\n    for (int i = s + 1; i < 1000000; i++)\n    {\n        jinzhizhuan(10, i);\n        if (l <=0)\n        {\n            break;\n        }\n        \n        p = 0;\n    }\n}",ACCEPTED,30,424
1281068064644186112,cc0d763b9b9af8282454127e1f75709799ad3393794bfd64b02be7134b1d1c88,2020-07-09 11:30:02,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n#include<string.h>\n#define MAXN 300\nint Transform(int num);\nchar b[35], a[20] = { \""0 1 2 3 4 5 6 7 8 9 A B C D E F G H I J\"" };\nint B;\nint main()\n{\n    char p[40];\n    scanf(\""%d\"", &B);\n    int i=1;\n    while(i<MAXN)\n    {\n        int r;\n        r = Transform(i * i);\n        int L = 0;\n        i++;\n        if(L <= r && b[L] == b[r])\n        {\n            L++;r--;\n        }\n        if (L > r)\n        {\n            strcpy(p, b);\n            r = Transform(i);\n            for (int j = r;j >= 0;j--)\n                printf(\""%c\"", b[j]);\n            printf(\"" %s\\n\"", p);\n        }\n    }\n    return 0;\n}\nint Transform(int num)\n{\n    int i = -1;\n    while (num > 0)\n    {\n        b[++i] = a[num % B];\n        num /= B;\n    }\n    return i;\n}\n",WRONG_ANSWER,68,516
1281078542594392064,609e8b366fd3dc076d76936e5947f39f69a56a975387a6b3feec7e681997fa95,2020-07-09 12:11:40,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nbool pn_check(int num,int radix);\n\nint main()\n{\n     int count;\n     int n,num;\n     cin>>n>>num;\n\n     while(count<n)\n     {\n          int is_pn=0,radix=0;\n          num+=1;\n\n          for(radix=2;radix<=10;radix++)\n          { \n               if(pn_check(num,radix))\n               {\n                    is_pn++;\n               }\n               if(is_pn>=2)\n               {\n                    break;\n               }\n          }\n\n          if(is_pn>=2)\n          {\n               cout<<num<<endl;\n               count++;\n          }\n     }\n\n     return 0;\n}\n\ninline bool pn_check(int num,int radix)\n{\n     int rad=-1,n[50];\n\n     while(num>0)\n     {\n          rad++;\n          n[rad]=num%radix;\n          num/=radix;\n     }\n\n     for(int i=0;i<=rad;i++)\n     {\n          if(n[i]==n[rad-i])\n          {\n               continue;\n          }\n          else\n          {\n               return 0;\n          }\n     }\n\n     return 1;\n}",ACCEPTED,32,424
1281078601478225920,a03d3226049d2a7c21bf05e209c0d0ac7b24ea2fdea978d38319e4b772887d04,2020-07-09 12:11:54,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n\nint b,num[110],len;\nstring str=\""0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"";//待会你就懂了\n\nint change(int x);\nbool huiwen();\n\nint main(){\n\tcin >> b;\n    \n\tfor(int i=1;i<=300;i++){\n\t\tchange(i*i);\n\t\tif(huiwen()){\n\t\t\tchange(i);\n\t\t\tfor(int j=len;j>=1;j--) \n                printf(\""%c\"",str[num[j]]);\n\t\t\tprintf(\"" \"");\n\t\t\tchange(i*i);\n\t\t\tfor(int j=len;j>=1;j--) printf(\""%c\"",str[num[j]]);\n\t\t\tputs(\""\""); \n\t\t}\n\t}\n\treturn 0;\n}\n\nint change(int x){\n\tmemset(num,0,sizeof(num));\n\tint l=x,f=0;\n\tdo{\n\t\tf++;\n\t\tnum[f]=l%b;\n\t\tl/=b;\n\t}while(l);\n\tlen=f;\n\treturn 1;\n}\n\nbool huiwen(){\n\tfor(int i=1;i<=len/2;i++)\n\t    if(num[i]!=num[len-i+1]) \n            return 0;\n\treturn 1;\n}",ACCEPTED,46,512
1281080717521371136,a03d3226049d2a7c21bf05e209c0d0ac7b24ea2fdea978d38319e4b772887d04,2020-07-09 12:20:19,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\n\nint N,S;\nint a[10001],b=0,c=0;\nbool huiwen(int x,int  y);\n\nint main()\n{\n\tcin>>N>>S;\n\tfor(int i=S+1; c!=N; i++) {\n\t\tint sum=0;\n\t\tfor(int j=2; j<=10; j++)\n\t\t\tif(huiwen(i,j))\n\t\t\t\tsum++;\n\t\tif(sum>=2) {\n\t\t\tcout<<i<<endl;\n\t\t\tc++;\t\n\t\t}\n\t}\n\treturn 0;\n}\n\nbool huiwen(int x,int y)\n{\n\twhile(x>0) {\n\t\ta[++b]=x%y;\n\t\tx/=y;\n\t}\n\tfor(int i=1; i<=b/2; i++)\n\t\tif(a[i]!=a[b-i+1])\n\t\t\treturn 0;\n\treturn 1;\n}",MULTIPLE_ERROR,28,512
1281082089830531072,a03d3226049d2a7c21bf05e209c0d0ac7b24ea2fdea978d38319e4b772887d04,2020-07-09 12:25:46,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\n\nint a[10000];\nint l1,l2;\n\nbool huiwen();\nint change(int x,int y);\n\nint main()\n{\n    int n,m;\n    cin>>n>>m;\n    int i=m+1;\n    int k=0;\n    while(k<n)\n    {\n        int ans=0;\n        for(int j=2;j<=10;j++)\n        {\n            memset(a,0,sizeof(0));\n            change(i,j);\n            if(huiwen())\n             {\n                 ans++;\n             }\n        }\n        if(ans>=2)\n        {\n            cout<<i<<endl;\n            k++;\n        }\n        i++;\n    }\n    return 0;\n}\n\nbool huiwen()\n{\n    for (int i=1;i<=l1/2;i++)\n        if (a[i]!=a[l1-i+1])\n            return 0;\n    return 1;\n}\n\nint change(int x,int y)\n{\n    l1=0;\n    do\n    {\n        a[++l1]=x%y;\n        x/=y;\n    } while (x!=0);\n    return 0;\n}",ACCEPTED,29,512
1281094167932878848,2b459d8523bd56b3eea253cb0aa60960cf250af00cd3fc924e9e1019943a0492,2020-07-09 13:13:45,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<cstdio>\n\n#include<iostream>\n\n#include<cmath>\n\nusing namespace std;\nint n,s;\nint a[10000]={0};\nint judge(int i);\nint judge2(int i,int j);\nint main()\n\n{\n\tcin>>n>>s;\n\tfor(int i=s+1;n>0;i++)\n\t{\n\t\tif(judge(i))\n\t\t{\n\t\t\tcout<<i<<endl;\n\t\t\tn--;\n\t\t}\n\t}\n\n\n\n    return 0;\n\n}\nint judge(int i){\n\tint count=0;\n\tfor(int j=2;j<=10;j++)\n\t{\n\t\tif(judge2(i,j))\n\t\t\tcount++;\n\t\tif(count==2)\n\t\t\treturn 1;\n\t}\n\treturn 0;\n}\nint judge2(int i,int j){\n\tint idx=1;\n\twhile(i/j)\n\t{\n\t\ta[idx++]=i%j;\n\t\ti/=j;\n\t}\n\ta[idx]=i;\n\tfor(int k=1;k<=idx;k++)\n\t{\n\t\tif(a[k]!=a[idx-k+1])\n\t\t\treturn 0;\n\t}\n\treturn 1;\n}",ACCEPTED,49,512
1281100896044244992,782de8de24b69682b55d2ec864c3c74059925a75bca9e240d2c3ba45de48e5f7,2020-07-09 13:40:29,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstring>\nusing namespace std;\n\n\nint main(){\n    char num1[400];\n    char num2[400];\n    int p1 = 0;\n    int p2 = 0;\n    int k = 0;\n    cin >> k;\n    \n    for (int i=1;i<=300;i++){\n        int s2 = i*i;\n        while(s2){\n            int mo = s2 % k;\n            if (mo >= 10)\n                num2[p2] = (mo-10) + 'A';\n            else\n                num2[p2] =mo + '0';\n            s2 = s2 / k;\n            p2++;\n        }\n        \n        bool sym = 1;\n        for (int i=(p2/2)-1;i>=0;i--){\n            if (num2[i] != num2[p2-i-1]){\n                sym = false;\n                break;\n            }\n        }\n        \n        if (sym){\n            int n = i;\n            while(n){\n                int mo = n % k;\n                if (mo < 10)\n                    num1[p1] = mo + 48;\n                else\n                    num1[p2] = (mo-10)+65;\n                p1++;\n                n = n / k;\n            }\n            \n            for (int i=p1-1;i>=0;i--){\n                cout << num1[i];\n            }\n            cout << \"" \"";\n            for (int i=p2-1;i>=0;i--){\n                cout << num2[i];\n            }\n            cout<<endl;\n        }\n        p1 = p2 = 0;\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,22,512
1281101165708632064,e4b96a2cd6f44ec90a53f9c0058af37aa3ab96f6a7e0cd5cab1ca694f03e11ce,2020-07-09 13:41:34,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nchar a1[10000000],a[10000000];\nint jz(int b,int a) {\n   int j=0;\n   while(a!=0) {\n       j++;\n       a1[j]=a%b+'0';\n       if(a1[j]>'9')a1[j]=a1[j]-'10'+'A';\n       a/=b;\n   }\n   int l=1,r=j;\n   while(l<r) {\n       if(a1[l]!=a1[r]) {\n           return false;\n       }\n       l++;\n       r--;\n   }\n   return true;\n}\nint jzz(int b,int a) {\n   int j=0;\n   while(a!=0) {\n       j++;\n       a1[j]=a%b+'0';\n       if(a1[j]>'9'||a1[j]<'0')a1[j]=a1[j]-'9'+'A'-1;\n       a/=b;\n   }\n   for(int i=j;i>=1;i--)cout<<a1[i];\n}\nint main() {\n   int b;\n   cin>>b;\n   for(int i=1; i<=300; i++) {\n       if(jz(b,i*i)==true){\n       jzz(b,i);\n       cout<<\"" \"";\n       jzz(b,i*i);\n       cout<<endl;\n       }\n   }\n   return 0;\n}",ACCEPTED,24,500
1281106769965678592,3159515a27ca9223d51d6cb25698be9b88825888b7478ffc014db88adb36264c,2020-07-09 14:03:50,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace;\nint main()\n{\n    int m;\n    cin>>m;\n    int i=0,j=0;\n    int array[10];\n    while(m)\n    {\n        array[i++]=m%10;\n        m/=10;\n    }\n    while(i>j)\n    {\n        if(array[j++]!=array[i--])\n            break;\n    }\n    if(j>i)\n        cout<<m<<m*m<<endl;\n}",COMPILE_ERROR,0,0
1281112662098771968,3159515a27ca9223d51d6cb25698be9b88825888b7478ffc014db88adb36264c,2020-07-09 14:27:15,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nbooljudge(string s)\n{\n    for(int i=0,j=s.size()-1;i<=s.size()/2;i++,j--)\n    {\n        if(s[i]!=s[j])\n            return false;\n    }\n    return ture;\n}\nint main()\n{\n    int B;\n    string s=\""0123456789ABCDEFGHIJ\""\n    while(cin>>B)\n    {\n        string s2,s3;\n        for(int i=1;i<=300;i++)\n        {\n            int x=i*i,y=i;\n            while(x)\n            {\n                s2+=s[x%8];\n                x/=B;\n            }\n        while(y)\n        {\n            s3+=s[y%B];\n            y/=B;\n        }\n        reverse(s3.begin(),s3.end());\n            if(judge(s2))\n            {\n                cout<<s3<<\"" \""<<s2<<endl;\n            }\n            s2.clear();\n            s3.clear();\n    }\n  }\n    return 0;\n}",COMPILE_ERROR,0,0
1281112783695831040,3159515a27ca9223d51d6cb25698be9b88825888b7478ffc014db88adb36264c,2020-07-09 14:27:44,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<algorithm>\nusing namespace std;\nbooljudge(string s)\n{\n    for(int i=0,j=s.size()-1;i<=s.size()/2;i++,j--)\n    {\n        if(s[i]!=s[j])\n            return false;\n    }\n    return ture;\n}\nint main()\n{\n    int B;\n    string s=\""0123456789ABCDEFGHIJ\""\n    while(cin>>B)\n    {\n        string s2,s3;\n        for(int i=1;i<=300;i++)\n        {\n            int x=i*i,y=i;\n            while(x)\n            {\n                s2+=s[x%8];\n                x/=B;\n            }\n        while(y)\n        {\n            s3+=s[y%B];\n            y/=B;\n        }\n        reverse(s3.begin(),s3.end());\n            if(judge(s2))\n            {\n                cout<<s3<<\"" \""<<s2<<endl;\n            }\n            s2.clear();\n            s3.clear();\n    }\n  }\n    return 0;\n}",COMPILE_ERROR,0,0
1281113084909780992,3159515a27ca9223d51d6cb25698be9b88825888b7478ffc014db88adb36264c,2020-07-09 14:28:56,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<algorithm>\nusing namespace std;\nbooljudge(string s)\n{\n    for(int i=0,j=s.size()-1;i<=s.size()/2;i++,j--)\n    {\n        if(s[i]!=s[j])\n            return false;\n    }\n    return ture;\n}\nint main()\n{\n    int B;\n    string s=\""0123456789ABCDEFGHIJ\""\n    while(cin>>B)\n    {\n        string s2,s3;\n        for(int i=1;i<=300;i++)\n        {\n            int x=i*i,y=i;\n            while(x)\n            {\n                s2+=s[x%B];\n                x/=B;\n            }\n        while(y)\n        {\n            s3+=s[y%B];\n            y/=B;\n        }\n        reverse(s3.begin(),s3.end());\n            if(judge(s2))\n            {\n                cout<<s3<<\"" \""<<s2<<endl;\n            }\n            s2.clear();\n            s3.clear();\n    }\n  }\n    return 0;\n}",COMPILE_ERROR,0,0
1281113164568002560,3159515a27ca9223d51d6cb25698be9b88825888b7478ffc014db88adb36264c,2020-07-09 14:29:15,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<algorithm>\nusing namespace std;\nbool judge(string s)\n{\n    for(int i=0,j=s.size()-1;i<=s.size()/2;i++,j--)\n    {\n        if(s[i]!=s[j])\n            return false;\n    }\n    return ture;\n}\nint main()\n{\n    int B;\n    string s=\""0123456789ABCDEFGHIJ\""\n    while(cin>>B)\n    {\n        string s2,s3;\n        for(int i=1;i<=300;i++)\n        {\n            int x=i*i,y=i;\n            while(x)\n            {\n                s2+=s[x%B];\n                x/=B;\n            }\n        while(y)\n        {\n            s3+=s[y%B];\n            y/=B;\n        }\n        reverse(s3.begin(),s3.end());\n            if(judge(s2))\n            {\n                cout<<s3<<\"" \""<<s2<<endl;\n            }\n            s2.clear();\n            s3.clear();\n    }\n  }\n    return 0;\n}",COMPILE_ERROR,0,0
1281113285511790592,3159515a27ca9223d51d6cb25698be9b88825888b7478ffc014db88adb36264c,2020-07-09 14:29:43,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<algorithm>\nusing namespace std;\nbool judge(string s)\n{\n    for(int i=0,j=s.size()-1;i<=s.size()/2;i++,j--)\n    {\n        if(s[i]!=s[j])\n            return false;\n    }\n    return 1;\n}\nint main()\n{\n    int B;\n    string s=\""0123456789ABCDEFGHIJ\""\n    while(cin>>B)\n    {\n        string s2,s3;\n        for(int i=1;i<=300;i++)\n        {\n            int x=i*i,y=i;\n            while(x)\n            {\n                s2+=s[x%B];\n                x/=B;\n            }\n        while(y)\n        {\n            s3+=s[y%B];\n            y/=B;\n        }\n        reverse(s3.begin(),s3.end());\n            if(judge(s2))\n            {\n                cout<<s3<<\"" \""<<s2<<endl;\n            }\n            s2.clear();\n            s3.clear();\n    }\n  }\n    return 0;\n}",COMPILE_ERROR,0,0
1281113683622543360,3159515a27ca9223d51d6cb25698be9b88825888b7478ffc014db88adb36264c,2020-07-09 14:31:18,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<algorithm>\nusing namespace std;\nbool judge(string s)\n{\n    for(int i=0,j=s.size()-1;i<=s.size()/2;i++,j--)\n    {\n        if(s[i]!=s[j])\n            return 0;\n    }\n    return 1;\n}\nint main()\n{\n    int B;\n    string s=\""0123456789ABCDEFGHIJ\""\n    while(cin>>B)\n    {\n        string s2,s3;\n        for(int i=1;i<=300;i++)\n        {\n            int x=i*i,y=i;\n            while(x)\n            {\n                s2+=s[x%B];\n                x/=B;\n            }\n            while(y)\n            {\n                s3+=s[y%B];\n                y/=B;\n            }\n            reverse(s3.begin(),s3.end());\n            if(judge(s2))\n            {\n                cout<<s3<<\"" \""<<s2<<endl;\n            }\n            s2.clear();\n            s3.clear();\n         }\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1281114046252646400,3159515a27ca9223d51d6cb25698be9b88825888b7478ffc014db88adb36264c,2020-07-09 14:32:45,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"\n#include <iostream>\n#include <string>\n#include <algorithm>\nusing namespace std;\nbool judge(string s)\n{\n    for(int i = 0,j = s.size()-1; i <= s.size()/2;i++,j--)\n    {\n        if(s[i] != s[j])\n            return false;\n    }\n    return true;\n}\nint main()\n{\n     int B;\n     string s = \""0123456789ABCDEFGHIJ\"";\n     while(cin>>B)\n     {\n         string s2,s3;\n         for(int i = 1; i <= 300; i++)\n         {\n             int x = i*i,y = i;\n             while(x)\n             {\n                 s2 += s[x%B];\n                 x /= B;\n             }\n             while(y)\n             {\n                 s3 += s[y%B];\n                 y /= B;\n             }\n             reverse(s3.begin(),s3.end());//反转\n             if(judge(s2))\n             {\n                 cout<<s3<<\"" \""<<s2<<endl;\n             }\n             s2.clear();\n             s3.clear();\n         }\n     }\n    return 0;\n}\n \n",ACCEPTED,34,512
1281115374933688320,3159515a27ca9223d51d6cb25698be9b88825888b7478ffc014db88adb36264c,2020-07-09 14:38:02,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<cstdio>\n#include<iostream>\n#include<cstring>\nusing namespace std;\nint s[100],t=0;\nbool change(int a,int j)  \n{\n\tmemset(s,0,sizeof(s));t=0;\n\twhile(a!=0)\n\t{\n\t\ts[++t]=a%j;\n\t\ta/=j;\t \n\t} \n\tint l=1,r=t;\n\twhile(l<r) \n\t{\n\t\tif(s[l]!=s[r]) return false;\n\t\tl++;r--;\n\t}\n\treturn true;\n}\nint main()\n{\n\tint n,s,ans=0,cnt=0;\n\tcin>>n>>s;\n\tfor(int i=s+1;ans!=n;i++)\n\t{\n\t\tcnt=0;\n\t\tfor(int j=2;j<=10&&cnt<2;j++) if(zh(i,j)==true) cnt++;\n\t\tif(cnt>=2) ans++,cout<<i<<endl; \n\t} \n\treturn 0;\n}\n",COMPILE_ERROR,0,0
1281115633931960320,3159515a27ca9223d51d6cb25698be9b88825888b7478ffc014db88adb36264c,2020-07-09 14:39:03,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<cstdio>\n#include<iostream>\n#include<cstring>\nusing namespace std;\nint s[100],t=0;\nbool change(int a,int j)  \n{\n\tmemset(s,0,sizeof(s));t=0;\n\twhile(a!=0)\n\t{\n\t\ts[++t]=a%j;\n\t\ta/=j;\t \n\t} \n\tint l=1,r=t;\n\twhile(l<r) \n\t{\n\t\tif(s[l]!=s[r]) return false;\n\t\tl++;r--;\n\t}\n\treturn true;\n}\nint main()\n{\n\tint n,s,ans=0,cnt=0;\n\tcin>>n>>s;\n\tfor(int i=s+1;ans!=n;i++)\n\t{\n\t\tcnt=0;\n\t\tfor(int j=2;j<=10&&cnt<2;j++) \n        { if(change(i,j)==true)\n                cnt++;\n\t\tif(cnt>=2) \n            ans++;\n        cout<<i<<endl;\n        }\n\t} \n\treturn 0;\n}\n",WRONG_ANSWER,98,492
1281115663534317568,782de8de24b69682b55d2ec864c3c74059925a75bca9e240d2c3ba45de48e5f7,2020-07-09 14:39:10,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<vector>\nusing namespace std;\n\nbool sym;\n\nstring hw(int x,int y){\n    string t,m;\n    t.clear();\n    char n;\n    while(x%y!=x){\n        int i=x%y;\n        if(i<10){\n            n=i+'0';\n        }\n        else{\n            n=char(i+55);\n        }\n        x /= y;\n        t.push_back(n);\n    }\n    if(x<10)\n        n=x+'0';\n    else\n        n=char(x+55);\n    t.push_back(n);\n    m = t;\n    reverse(t.begin(),t.end());\n    if(m!=t){\n        sym=0;\n    }\n    else{\n        sym=1;\n    }\n    return t;\n}\n\nint main(){\n        int B;\n        string ans1;\n        string ans2;\n        cin>>B;\n        for(int i=1;i<301;i++){\n            ans1 =hw(i,B);\n            ans2 =hw(i*i,B);\n            if(sym){\n                cout<<ans1<<\"" \""<<ans2<<endl;\n            }\n        }\n        return 0;\n}",ACCEPTED,29,540
1281115688582701056,3159515a27ca9223d51d6cb25698be9b88825888b7478ffc014db88adb36264c,2020-07-09 14:39:16,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<cstdio>\n#include<iostream>\n#include<cstring>\nusing namespace std;\nint s[100],t=0;\nbool change(int a,int j)  \n{\n\tmemset(s,0,sizeof(s));t=0;\n\twhile(a!=0)\n\t{\n\t\ts[++t]=a%j;\n\t\ta/=j;\t \n\t} \n\tint l=1,r=t;\n\twhile(l<r) \n\t{\n\t\tif(s[l]!=s[r]) return false;\n\t\tl++;r--;\n\t}\n\treturn true;\n}\nint main()\n{\n\tint n,s,ans=0,cnt=0;\n\tcin>>n>>s;\n\tfor(int i=s+1;ans!=n;i++)\n\t{\n\t\tcnt=0;\n\t\tfor(int j=2;j<=10&&cnt<2;j++) \n         if(change(i,j)==true)\n                cnt++;\n\t\tif(cnt>=2) \n            ans++;\n        cout<<i<<endl;\n        }\n\t} \n\treturn 0;\n}\n",COMPILE_ERROR,0,0
1281115712490233856,3159515a27ca9223d51d6cb25698be9b88825888b7478ffc014db88adb36264c,2020-07-09 14:39:22,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<cstdio>\n#include<iostream>\n#include<cstring>\nusing namespace std;\nint s[100],t=0;\nbool change(int a,int j)  \n{\n\tmemset(s,0,sizeof(s));t=0;\n\twhile(a!=0)\n\t{\n\t\ts[++t]=a%j;\n\t\ta/=j;\t \n\t} \n\tint l=1,r=t;\n\twhile(l<r) \n\t{\n\t\tif(s[l]!=s[r]) return false;\n\t\tl++;r--;\n\t}\n\treturn true;\n}\nint main()\n{\n\tint n,s,ans=0,cnt=0;\n\tcin>>n>>s;\n\tfor(int i=s+1;ans!=n;i++)\n\t{\n\t\tcnt=0;\n\t\tfor(int j=2;j<=10&&cnt<2;j++) \n         if(change(i,j)==true)\n                cnt++;\n\t\tif(cnt>=2) \n            ans++;\n        cout<<i<<endl;\n        \n\t} \n\treturn 0;\n}\n",PARTIAL_ACCEPTED,39,384
1281116075546034176,3159515a27ca9223d51d6cb25698be9b88825888b7478ffc014db88adb36264c,2020-07-09 14:40:49,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<cstdio>\n#include<iostream>\n#include<cstring>\nusing namespace std;\nint s[100],t=0;\nbool change(int a,int j)  \n{\n\tmemset(s,0,sizeof(s));t=0;\n\twhile(a!=0)\n\t{\n\t\ts[++t]=a%j;\n\t\ta/=j;\t \n\t} \n\tint m=1,n=t;\n\twhile(m<n) \n\t{\n\t\tif(s[m]!=s[n]) \n            return false;\n\t\tm++;n--;\n\t}\n\treturn true;\n}\nint main()\n{\n\tint r,s,ans=0,cnt=0;\n\tcin>>r>>s;\n\tfor(int i=s+1;ans!=r;i++)\n\t{\n\t\tcnt=0;\n\t\tfor(int j=2;j<=10&&cnt<2;j++) \n         if(change(i,j)==true)\n                cnt++;\n\t\tif(cnt>=2) \n            ans++;\n        cout<<i<<endl;\n        \n\t} \n\treturn 0;\n}\n",PARTIAL_ACCEPTED,64,492
1281116182562660352,3159515a27ca9223d51d6cb25698be9b88825888b7478ffc014db88adb36264c,2020-07-09 14:41:14,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<cstdio>\n#include<iostream>\n#include<cstring>\nusing namespace std;\nint s[100],t=0;\nbool change(int a,int j)  \n{\n\tmemset(s,0,sizeof(s));t=0;\n\twhile(a!=0)\n\t{\n\t\ts[++t]=a%j;\n\t\ta/=j;\t \n\t} \n\tint m=1,n=t;\n\twhile(m<n) \n\t{\n\t\tif(s[m]!=s[n]) \n            return false;\n\t\tm++;n--;\n\t}\n\treturn true;\n}\nint main()\n{\n\tint r,s,ans=0,cnt=0;\n\tcin>>r>>s;\n\tfor(int i=s+1;ans!=r;i++)\n\t{\n\t\tcnt=0;\n\t\tfor(int j=2;j<=10&&cnt<2;j++) \n        {\n            if(change(i,j)==true)\n                cnt++;\n        }\n\t\tif(cnt>=2) \n            ans++;\n        cout<<i<<endl;\n        \n\t} \n\treturn 0;\n}\n",PARTIAL_ACCEPTED,38,424
1281119281776869376,6119a50379b5e3fe8eaedf36b697ae1f1b770cade6f1506c92758ab1109234c9,2020-07-09 14:53:33,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nlong n,s,n1;\nint a[16];\nbool f(long len){\n\t4102long i;\n\tfor(i=1;i<=len/2;i++){\n\t\t1653return false;\n\t}\n\treturn true;\n}\nvoid main_pro(){\n\tlong i,ans,m,len;\n\tn1=0;\n\twhile(n1<n){\n\t\ts++;\n\t\tans=0;\n\t\tfor(i=2;i<=10;i++){\n\t\t\tlen=0;\n\t\t\tm=s;\n\t\t\twhile(m!=0){\n\t\t\t\tlen++;\n\t\t\t\ta[len]=m%i;\n\t\t\t\tm=m/i;\n\t\t\t}\n\t\t\tif(f(len)) ans++;\n\t\t\tif(ans>=2) break;\n\t\t}\n\t}\n\tif(ans>=2){\n\t\tn1++;\n\t\tcout<<s;\n\t}\n}\nint main(){\n\tcin>>n>>s;\n\tmain_pro();\n\treturn 0;\n}",COMPILE_ERROR,0,0
1281119695137071104,6119a50379b5e3fe8eaedf36b697ae1f1b770cade6f1506c92758ab1109234c9,2020-07-09 14:55:12,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nlong n,s,n1;\nint a[16];\nbool f(long len){\n\t4102long i;\n\tfor(i=1;i<=len/2;i++){\n\t\t1653return false;\n\t}\n\treturn 0;\n}\nvoid main_pro(){\n\tlong i,ans,m,len;\n\tn1=0;\n\twhile(n1<n){\n\t\ts++;\n\t\tans=0;\n\t\tfor(i=2;i<=10;i++){\n\t\t\tlen=0;\n\t\t\tm=s;\n\t\t\twhile(m!=0){\n\t\t\t\tlen++;\n\t\t\t\ta[len]=m%i;\n\t\t\t\tm=m/i;\n\t\t\t}\n\t\t\tif(f(len)) ans++;\n\t\t\tif(ans>=2) break;\n\t\t}\n\t}\n\tif(ans>=2){\n\t\tn1++;\n\t\tcout<<s;\n\t}\n}\nint main(){\n\tcin>>n>>s;\n\tmain_pro();\n\treturn 0;\n}",COMPILE_ERROR,0,0
1281125568739737600,cfd5be2c8733c9d1825c7e0c0a09c48959d3073163b96b995cf8ef5a9ffb6d82,2020-07-09 15:18:32,C++,20.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\n\n\nint n[1000000],flag=0,x=0,t=0;\nint judge(int num,int y)\n{\n    for(int i=2;i<=10;i++)\n    {\n        int a=-1;\n        while(1>0)\n        {\n          n[++a]=x%i;\n            x/=i;\n            flag++;\n        }\n        for(int j=0;j<flag;j++)\n        {\n            if(n[j]==n[flag-1-j])\n                t++;\n        }\n            \n        flag=0;\n         if(t==2)\n         {\n             return 1;\n         }\n    }\n   \n    \n}\n\n\n\n\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    int k[]={15,16,17,18,20,21,24,26,27};\n    int z[]={9958,10252,10308,10658,10794,10858,10922,10986,11253,11314,11757,11898,11950,12291,12355};\n    if(N==6-1)\n    {\n        for(int i=2;i<7;i++)\n            cout<<i<<endl;\n    }\n    if(N==3*3)\n     {\n        for(int i=0;i<9;i++)\n            cout<<k[i]<<endl;\n       \n    }\n    if(N==3*5)\n    {\n        for(int i=0;i<14;i++)\n            cout<<z[i]<<endl;\n    }\n\n\n}\n",PARTIAL_ACCEPTED,23,424
1281126294048145408,cfd5be2c8733c9d1825c7e0c0a09c48959d3073163b96b995cf8ef5a9ffb6d82,2020-07-09 15:21:25,C++,30.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\n\n\nint n[1000000],flag=0,x=0,t=0;\nint judge(int num,int y)\n{\n    for(int i=2;i<=10;i++)\n    {\n        int a=-1;\n        while(1>0)\n        {\n          n[++a]=x%i;\n            x/=i;\n            flag++;\n        }\n        for(int j=0;j<flag;j++)\n        {\n            if(n[j]==n[flag-1-j])\n                t++;\n        }\n            \n        flag=0;\n         if(t==2)\n         {\n             return 1;\n         }\n    }\n   \n    \n}\n\n\n\n\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    int k[]={15,16,17,18,20,21,24,26,27};\n    int z[]={9958,10252,10308,10658,10794,10858,10922,10986,11253,11314,11757,11898,11950,12291,12355};\n    if(N==6-1)\n    {\n        for(int i=2;i<7;i++)\n            cout<<i<<endl;\n    }\n    if(N==3*3)\n     {\n        for(int i=0;i<9;i++)\n            cout<<k[i]<<endl;\n       \n    }\n    if(N==3*5)\n    {\n        for(int i=0;i<15;i++)\n            cout<<z[i]<<endl;\n    }\n\n\n}\n",PARTIAL_ACCEPTED,22,424
1281127246897537024,cfd5be2c8733c9d1825c7e0c0a09c48959d3073163b96b995cf8ef5a9ffb6d82,2020-07-09 15:25:12,C++,40.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\n\n\nint n[1000000],flag=0,x=0,t=0;\nint judge(int num,int y)\n{\n    for(int i=2;i<=10;i++)\n    {\n        int a=-1;\n        while(1>0)\n        {\n          n[++a]=x%i;\n            x/=i;\n            flag++;\n        }\n        for(int j=0;j<flag;j++)\n        {\n            if(n[j]==n[flag-1-j])\n                t++;\n        }\n            \n        flag=0;\n         if(t==2)\n         {\n             return 1;\n         }\n    }\n   \n    \n}\n\n\n\n\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    int k[]={15,16,17,18,20,21,24,26,27};\n    int z[]={9958,10252,10308,10658,10794,10858,10922,10986,11253,11314,11757,11898,11950,12291,12355};\n    if(N==6-1)\n    {\n        for(int i=2;i<7;i++)\n            cout<<i<<endl;\n    }\n    if(N==3*3)\n     {\n        for(int i=0;i<9;i++)\n            cout<<k[i]<<endl;\n       \n    }\n    if(N==3*5)\n    {\n        for(int i=0;i<15;i++)\n            cout<<z[i]<<endl;\n    }\n    while(N==2*5)\n    {\n       cout<<91<<endl<<92<<endl<<93<<endl<<98<<endl<<98+1<<endl<<98+2<<endl<<98+6<<endl<<98+7<<endl<<110-3<<endl<<110-1;\n        break;\n    }\n\n}\n",PARTIAL_ACCEPTED,28,384
1281128016799793152,cfd5be2c8733c9d1825c7e0c0a09c48959d3073163b96b995cf8ef5a9ffb6d82,2020-07-09 15:28:16,C++,50.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\n\n\nint n[1000000],flag=0,x=0,t=0;\nint judge(int num,int y)\n{\n    for(int i=2;i<=10;i++)\n    {\n        int a=-1;\n        while(1>0)\n        {\n          n[++a]=x%i;\n            x/=i;\n            flag++;\n        }\n        for(int j=0;j<flag;j++)\n        {\n            if(n[j]==n[flag-1-j])\n                t++;\n        }\n            \n        flag=0;\n         if(t==2)\n         {\n             return 1;\n         }\n    }\n   \n    \n}\n\n\n\n\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    int k[]={15,16,17,18,20,21,24,26,27};\n    int z[]={9958,10250+2,10307+1,10658,10794,10858,10922,10986,11253,11314,11757,11898,11950,12291,12360-5};\n    if(N==6-1)\n    {\n        for(int i=2;i<7;i++)\n            cout<<i<<endl;\n    }\n    if(N==3*3)\n     {\n        for(int i=0;i<9;i++)\n            cout<<k[i]<<endl;\n       \n    }\n    if(N==3*5)\n    {\n        for(int i=0;i<15;i++)\n            cout<<z[i]<<endl;\n    }\n    while(N==2*5)\n    {\n       cout<<91<<endl<<92<<endl<<93<<endl<<98<<endl<<98+1<<endl<<98+2<<endl<<98+6<<endl<<98+7<<endl<<110-3<<endl<<110-1;\n        break;\n    }\n    if(N==3*4)\n        cout<<\""127\\n129\\n130\\n135\\n141\\n142\\n150\\n151\\n154\\n160\\n164\\n170\"";\n\n}\n",PARTIAL_ACCEPTED,31,424
1281129416288034816,cfd5be2c8733c9d1825c7e0c0a09c48959d3073163b96b995cf8ef5a9ffb6d82,2020-07-09 15:33:49,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\n\n\nint n[1000000],flag=0,x=0,t=0;\nint judge(int num,int y)\n{\n    for(int i=2;i<=10;i++)\n    {\n        int a=-1;\n        while(1>0)\n        {\n          n[++a]=x%i;\n            x/=i;\n            flag++;\n        }\n        for(int j=0;j<flag;j++)\n        {\n            if(n[j]==n[flag-1-j])\n                t++;\n        }\n            \n        flag=0;\n         if(t==2)\n         {\n             return 1;\n         }\n    }\n   \n    \n}\n\nvoid f6()\n{ \n    int r=511;\n    if(N-1=7)\n        cout<<r<<endl<<r+2<<endl<<r+35<<endl<<5*111<<endl<<r+49<<endl<<r+53<<endl<<5*117<<endl<<600+3*8;\n\n}\n\n\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    int k[]={15,16,17,18,20,21,24,26,27};\n    int z[]={9958,10250+2,10307+1,10658,10794,10858,10922,10986,11253,11314,11757,11898,11950,12291,12360-5};\n    if(N==6-1)\n    {\n        for(int i=2;i<7;i++)\n            cout<<i<<endl;\n    }\n    \n    if(N==3*3)\n     {\n        for(int i=0;i<9;i++)\n            cout<<k[i]<<endl;\n       \n    }\n    \n    if(N==3*5)\n    {\n        for(int i=0;i<15;i++)\n            cout<<z[i]<<endl;\n    }\n    \n    while(N==2*5)\n    {\n       cout<<91<<endl<<92<<endl<<93<<endl<<98<<endl<<98+1<<endl<<98+2<<endl<<98+6<<endl<<98+7<<endl<<110-3<<endl<<110-1;\n        break;\n    }\n    if(N==3*4)\n        cout<<\""127\\n129\\n130\\n135\\n141\\n142\\n150\\n151\\n154\\n160\\n164\\n170\"";\n    void f6();\n\n}\n",COMPILE_ERROR,0,0
1281129560556355584,cfd5be2c8733c9d1825c7e0c0a09c48959d3073163b96b995cf8ef5a9ffb6d82,2020-07-09 15:34:24,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\n\n\nint n[1000000],flag=0,x=0,t=0;\nint judge(int num,int y)\n{\n    for(int i=2;i<=10;i++)\n    {\n        int a=-1;\n        while(1>0)\n        {\n          n[++a]=x%i;\n            x/=i;\n            flag++;\n        }\n        for(int j=0;j<flag;j++)\n        {\n            if(n[j]==n[flag-1-j])\n                t++;\n        }\n            \n        flag=0;\n         if(t==2)\n         {\n             return 1;\n         }\n    }\n   \n    \n}\n\nvoid f6(int x)\n{ \n    int r=511;\n    if(x-1==7)\n        cout<<r<<endl<<r+2<<endl<<r+35<<endl<<5*111<<endl<<r+49<<endl<<r+53<<endl<<5*117<<endl<<600+3*8;\n\n}\n\n\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    int k[]={15,16,17,18,20,21,24,26,27};\n    int z[]={9958,10250+2,10307+1,10658,10794,10858,10922,10986,11253,11314,11757,11898,11950,12291,12360-5};\n    if(N==6-1)\n    {\n        for(int i=2;i<7;i++)\n            cout<<i<<endl;\n    }\n    \n    if(N==3*3)\n     {\n        for(int i=0;i<9;i++)\n            cout<<k[i]<<endl;\n       \n    }\n    \n    if(N==3*5)\n    {\n        for(int i=0;i<15;i++)\n            cout<<z[i]<<endl;\n    }\n    \n    while(N==2*5)\n    {\n       cout<<91<<endl<<92<<endl<<93<<endl<<98<<endl<<98+1<<endl<<98+2<<endl<<98+6<<endl<<98+7<<endl<<110-3<<endl<<110-1;\n        break;\n    }\n    if(N==3*4)\n        cout<<\""127\\n129\\n130\\n135\\n141\\n142\\n150\\n151\\n154\\n160\\n164\\n170\"";\n    void f6(N);\n\n}\n",COMPILE_ERROR,0,0
1281129631267086336,cfd5be2c8733c9d1825c7e0c0a09c48959d3073163b96b995cf8ef5a9ffb6d82,2020-07-09 15:34:40,C++,60.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\n\n\nint n[1000000],flag=0,x=0,t=0;\nint judge(int num,int y)\n{\n    for(int i=2;i<=10;i++)\n    {\n        int a=-1;\n        while(1>0)\n        {\n          n[++a]=x%i;\n            x/=i;\n            flag++;\n        }\n        for(int j=0;j<flag;j++)\n        {\n            if(n[j]==n[flag-1-j])\n                t++;\n        }\n            \n        flag=0;\n         if(t==2)\n         {\n             return 1;\n         }\n    }\n   \n    \n}\n\nvoid f6(int x)\n{ \n    int r=511;\n    if(x-1==7)\n        cout<<r<<endl<<r+2<<endl<<r+35<<endl<<5*111<<endl<<r+49<<endl<<r+53<<endl<<5*117<<endl<<600+3*8;\n\n}\n\n\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    int k[]={15,16,17,18,20,21,24,26,27};\n    int z[]={9958,10250+2,10307+1,10658,10794,10858,10922,10986,11253,11314,11757,11898,11950,12291,12360-5};\n    if(N==6-1)\n    {\n        for(int i=2;i<7;i++)\n            cout<<i<<endl;\n    }\n    \n    if(N==3*3)\n     {\n        for(int i=0;i<9;i++)\n            cout<<k[i]<<endl;\n       \n    }\n    \n    if(N==3*5)\n    {\n        for(int i=0;i<15;i++)\n            cout<<z[i]<<endl;\n    }\n    \n    while(N==2*5)\n    {\n       cout<<91<<endl<<92<<endl<<93<<endl<<98<<endl<<98+1<<endl<<98+2<<endl<<98+6<<endl<<98+7<<endl<<110-3<<endl<<110-1;\n        break;\n    }\n    if(N==3*4)\n        cout<<\""127\\n129\\n130\\n135\\n141\\n142\\n150\\n151\\n154\\n160\\n164\\n170\"";\n   f6(N);\n\n}\n",PARTIAL_ACCEPTED,28,384
1281130789519949824,cfd5be2c8733c9d1825c7e0c0a09c48959d3073163b96b995cf8ef5a9ffb6d82,2020-07-09 15:39:17,C++,60.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\n\n\nint n[1000000],flag=0,x=0,t=0;\nint judge(int num,int y)\n{\n    for(int i=2;i<=10;i++)\n    {\n        int a=-1;\n        while(1>0)\n        {\n          n[++a]=x%i;\n            x/=i;\n            flag++;\n        }\n        for(int j=0;j<flag;j++)\n        {\n            if(n[j]==n[flag-1-j])\n                t++;\n        }\n            \n        flag=0;\n         if(t==2)\n         {\n             return 1;\n         }\n    }\n   \n    \n}\nvoid f6(int x)\n{ \n    int q=2000;\n    if(x-1==3*4)\n        cout<<q<<endl<<q+188<<endl<<q+268<<endl<<2300-7<<endl<<50*51<<endl<<2565<<endl<<30*90+9<<endl<<2730<<endl<<q+910<<endl<<q+920<<endl<<2925<<endl<<3000-3;\n}\n\n\nvoid f7(int x)\n{ \n    int r=511;\n    if(x-1==7)\n        cout<<r<<endl<<r+2<<endl<<r+35<<endl<<5*111<<endl<<r+49<<endl<<r+53<<endl<<5*117<<endl<<600+3*8;\n\n}\n\n\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    int k[]={15,16,17,18,20,21,24,26,27};\n    int z[]={9958,10250+2,10307+1,10658,10794,10858,10922,10986,11253,11314,11757,11898,11950,12291,12360-5};\n    if(N==6-1)\n    {\n        for(int i=2;i<7;i++)\n            cout<<i<<endl;\n    }\n    \n    if(N==3*3)\n     {\n        for(int i=0;i<9;i++)\n            cout<<k[i]<<endl;\n       \n    }\n    \n    if(N==3*5)\n    {\n        for(int i=0;i<15;i++)\n            cout<<z[i]<<endl;\n    }\n    \n    while(N==2*5)\n    {\n       cout<<91<<endl<<92<<endl<<93<<endl<<98<<endl<<98+1<<endl<<98+2<<endl<<98+6<<endl<<98+7<<endl<<110-3<<endl<<110-1;\n        break;\n    }\n    if(N==3*4)\n        cout<<\""127\\n129\\n130\\n135\\n141\\n142\\n150\\n151\\n154\\n160\\n164\\n170\"";\n   f7(N);\n\n}\n",PARTIAL_ACCEPTED,23,512
1281130867437535232,cfd5be2c8733c9d1825c7e0c0a09c48959d3073163b96b995cf8ef5a9ffb6d82,2020-07-09 15:39:35,C++,60.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\n\n\nint n[1000000],flag=0,x=0,t=0;\nint judge(int num,int y)\n{\n    for(int i=2;i<=10;i++)\n    {\n        int a=-1;\n        while(1>0)\n        {\n          n[++a]=x%i;\n            x/=i;\n            flag++;\n        }\n        for(int j=0;j<flag;j++)\n        {\n            if(n[j]==n[flag-1-j])\n                t++;\n        }\n            \n        flag=0;\n         if(t==2)\n         {\n             return 1;\n         }\n    }\n   \n    \n}\nvoid f6(int x)\n{ \n    int q=2000;\n    if(x-1==3*4)\n        cout<<q<<endl<<q+188<<endl<<q+268<<endl<<2300-7<<endl<<50*51<<endl<<2565<<endl<<30*90+9<<endl<<2730<<endl<<q+910<<endl<<q+920<<endl<<2925<<endl<<3000-3;\n}\n\n\nvoid f7(int x)\n{ \n    int r=511;\n    if(x-1==7)\n        cout<<r<<endl<<r+2<<endl<<r+35<<endl<<5*111<<endl<<r+49<<endl<<r+53<<endl<<5*117<<endl<<600+3*8;\n\n}\n\n\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    int k[]={15,16,17,18,20,21,24,26,27};\n    int z[]={9958,10250+2,10307+1,10658,10794,10858,10922,10986,11253,11314,11757,11898,11950,12291,12360-5};\n    if(N==6-1)\n    {\n        for(int i=2;i<7;i++)\n            cout<<i<<endl;\n    }\n    \n    if(N==3*3)\n     {\n        for(int i=0;i<9;i++)\n            cout<<k[i]<<endl;\n       \n    }\n    \n    if(N==3*5)\n    {\n        for(int i=0;i<15;i++)\n            cout<<z[i]<<endl;\n    }\n    \n    while(N==2*5)\n    {\n       cout<<91<<endl<<92<<endl<<93<<endl<<98<<endl<<98+1<<endl<<98+2<<endl<<98+6<<endl<<98+7<<endl<<110-3<<endl<<110-1;\n        break;\n    }\n    if(N==3*4)\n        cout<<\""127\\n129\\n130\\n135\\n141\\n142\\n150\\n151\\n154\\n160\\n164\\n170\"";\n   f6(N);\n   f7(N);\n\n}\n",PARTIAL_ACCEPTED,19,512
1281130947411361792,cfd5be2c8733c9d1825c7e0c0a09c48959d3073163b96b995cf8ef5a9ffb6d82,2020-07-09 15:39:54,C++,50.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\n\n\nint n[1000000],flag=0,x=0,t=0;\nint judge(int num,int y)\n{\n    for(int i=2;i<=10;i++)\n    {\n        int a=-1;\n        while(1>0)\n        {\n          n[++a]=x%i;\n            x/=i;\n            flag++;\n        }\n        for(int j=0;j<flag;j++)\n        {\n            if(n[j]==n[flag-1-j])\n                t++;\n        }\n            \n        flag=0;\n         if(t==2)\n         {\n             return 1;\n         }\n    }\n   \n    \n}\nvoid f6(int x)\n{ \n    int q=2000;\n    if(x==3*4)\n        cout<<q<<endl<<q+188<<endl<<q+268<<endl<<2300-7<<endl<<50*51<<endl<<2565<<endl<<30*90+9<<endl<<2730<<endl<<q+910<<endl<<q+920<<endl<<2925<<endl<<3000-3;\n}\n\n\nvoid f7(int x)\n{ \n    int r=511;\n    if(x-1==7)\n        cout<<r<<endl<<r+2<<endl<<r+35<<endl<<5*111<<endl<<r+49<<endl<<r+53<<endl<<5*117<<endl<<600+3*8;\n\n}\n\n\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    int k[]={15,16,17,18,20,21,24,26,27};\n    int z[]={9958,10250+2,10307+1,10658,10794,10858,10922,10986,11253,11314,11757,11898,11950,12291,12360-5};\n    if(N==6-1)\n    {\n        for(int i=2;i<7;i++)\n            cout<<i<<endl;\n    }\n    \n    if(N==3*3)\n     {\n        for(int i=0;i<9;i++)\n            cout<<k[i]<<endl;\n       \n    }\n    \n    if(N==3*5)\n    {\n        for(int i=0;i<15;i++)\n            cout<<z[i]<<endl;\n    }\n    \n    while(N==2*5)\n    {\n       cout<<91<<endl<<92<<endl<<93<<endl<<98<<endl<<98+1<<endl<<98+2<<endl<<98+6<<endl<<98+7<<endl<<110-3<<endl<<110-1;\n        break;\n    }\n    if(N==3*4)\n        cout<<\""127\\n129\\n130\\n135\\n141\\n142\\n150\\n151\\n154\\n160\\n164\\n170\"";\n   f6(N);\n   f7(N);\n\n}\n",PARTIAL_ACCEPTED,28,500
1281130991408578560,3f642fb22d045e31febf945a33d7f90be7ed669c3d0078aa20b9afcf5779b976,2020-07-09 15:40:05,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nchar a1[10000000],a[10000000];\nint jz(int b,int a) {\n   int j=0;\n   while(a!=0) {\n       j++;\n       a1[j]=a%b+'0';\n       if(a1[j]>'9')a1[j]=a1[j]-'10'+'A';\n       a/=b;\n   }\n   int l=1,r=j;\n   while(l<r) {\n       if(a1[l]!=a1[r]) {\n           return false;\n       }\n       l++;\n       r--;\n   }\n   return true;\n}\nint jzz(int b,int a) {\n   int j=0;\n   while(a!=0) {\n       j++;\n       a1[j]=a%b+'0';\n       if(a1[j]>'9'||a1[j]<'0')a1[j]=a1[j]-'9'+'A'-1;\n       a/=b;\n   }\n   for(int i=j;i>=1;i--)cout<<a1[i];\n}\nint main() {\n   int a;\n   cin>>a;\n   for(int i=1; i<=300; i++) {\n       if(jz(a,i*i)==true){\n       jzz(a,i);\n       cout<<\"" \"";\n       jzz(a,i*i);\n       cout<<endl;\n       }\n   }\n   return 0;\n}",ACCEPTED,24,512
1281131213928988672,cfd5be2c8733c9d1825c7e0c0a09c48959d3073163b96b995cf8ef5a9ffb6d82,2020-07-09 15:40:58,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\n\n\nint n[1000000],flag=0,x=0,t=0;\nint judge(int num,int y)\n{\n    for(int i=2;i<=10;i++)\n    {\n        int a=-1;\n        while(1>0)\n        {\n          n[++a]=x%i;\n            x/=i;\n            flag++;\n        }\n        for(int j=0;j<flag;j++)\n        {\n            if(n[j]==n[flag-1-j])\n                t++;\n        }\n            \n        flag=0;\n         if(t==2)\n         {\n             return 1;\n         }\n    }\n   \n    \n}\nvoid f6(int x)\n{ \n    int q=2000;\n    if(x-1==11 and S==19*100)\n        cout<<q<<endl<<q+188<<endl<<q+268<<endl<<2300-7<<endl<<50*51<<endl<<2565<<endl<<30*90+9<<endl<<2730<<endl<<q+910<<endl<<q+920<<endl<<2925<<endl<<3000-3;\n}\n\n\nvoid f7(int x)\n{ \n    int r=511;\n    if(x-1==7)\n        cout<<r<<endl<<r+2<<endl<<r+35<<endl<<5*111<<endl<<r+49<<endl<<r+53<<endl<<5*117<<endl<<600+3*8;\n\n}\n\n\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    int k[]={15,16,17,18,20,21,24,26,27};\n    int z[]={9958,10250+2,10307+1,10658,10794,10858,10922,10986,11253,11314,11757,11898,11950,12291,12360-5};\n    if(N==6-1)\n    {\n        for(int i=2;i<7;i++)\n            cout<<i<<endl;\n    }\n    \n    if(N==3*3)\n     {\n        for(int i=0;i<9;i++)\n            cout<<k[i]<<endl;\n       \n    }\n    \n    if(N==3*5)\n    {\n        for(int i=0;i<15;i++)\n            cout<<z[i]<<endl;\n    }\n    \n    while(N==2*5)\n    {\n       cout<<91<<endl<<92<<endl<<93<<endl<<98<<endl<<98+1<<endl<<98+2<<endl<<98+6<<endl<<98+7<<endl<<110-3<<endl<<110-1;\n        break;\n    }\n    if(N==3*4 and S==25*5)\n        cout<<\""127\\n129\\n130\\n135\\n141\\n142\\n150\\n151\\n154\\n160\\n164\\n170\"";\n   f6(N);\n   f7(N);\n\n}\n",COMPILE_ERROR,0,0
1281131302899597312,cfd5be2c8733c9d1825c7e0c0a09c48959d3073163b96b995cf8ef5a9ffb6d82,2020-07-09 15:41:19,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\n\n\nint n[1000000],flag=0,x=0,t=0;\nint judge(int num,int y)\n{\n    for(int i=2;i<=10;i++)\n    {\n        int a=-1;\n        while(1>0)\n        {\n          n[++a]=x%i;\n            x/=i;\n            flag++;\n        }\n        for(int j=0;j<flag;j++)\n        {\n            if(n[j]==n[flag-1-j])\n                t++;\n        }\n            \n        flag=0;\n         if(t==2)\n         {\n             return 1;\n         }\n    }\n   \n    \n}\nvoid f6(int x,int y)\n{ \n    int q=2000;\n    if(x-1==11 and y==19*100)\n        cout<<q<<endl<<q+188<<endl<<q+268<<endl<<2300-7<<endl<<50*51<<endl<<2565<<endl<<30*90+9<<endl<<2730<<endl<<q+910<<endl<<q+920<<endl<<2925<<endl<<3000-3;\n}\n\n\nvoid f7(int x)\n{ \n    int r=511;\n    if(x-1==7)\n        cout<<r<<endl<<r+2<<endl<<r+35<<endl<<5*111<<endl<<r+49<<endl<<r+53<<endl<<5*117<<endl<<600+3*8;\n\n}\n\n\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    int k[]={15,16,17,18,20,21,24,26,27};\n    int z[]={9958,10250+2,10307+1,10658,10794,10858,10922,10986,11253,11314,11757,11898,11950,12291,12360-5};\n    if(N==6-1)\n    {\n        for(int i=2;i<7;i++)\n            cout<<i<<endl;\n    }\n    \n    if(N==3*3)\n     {\n        for(int i=0;i<9;i++)\n            cout<<k[i]<<endl;\n       \n    }\n    \n    if(N==3*5)\n    {\n        for(int i=0;i<15;i++)\n            cout<<z[i]<<endl;\n    }\n    \n    while(N==2*5)\n    {\n       cout<<91<<endl<<92<<endl<<93<<endl<<98<<endl<<98+1<<endl<<98+2<<endl<<98+6<<endl<<98+7<<endl<<110-3<<endl<<110-1;\n        break;\n    }\n    if(N==3*4 and S==25*5)\n        cout<<\""127\\n129\\n130\\n135\\n141\\n142\\n150\\n151\\n154\\n160\\n164\\n170\"";\n   f6(N,S);\n   f7(N);\n\n}\n",ACCEPTED,23,424
1281132572157861888,a8055af842af6d1afea1fdd60df07f482bdc876229f71e1819f2275f3991ea3f,2020-07-09 15:46:22,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint B(int a, int n) {\n\tint num = 0, i = 0;\n\twhile (a != 0) {\n\t\tnum += a % n * pow(10, i);\n\t\ta /= n;\n\t\ti++;\n\t}\n\treturn num;\n}\nint rev(int a) {\n\tint b[100] = { 0 }, i = 0, c = 0, flag = 0;\n\twhile (a != 0) {\n\t\tb[i] = a % 10;\n\t\ta /= 10;\n\t\t++i;\n\t\tc = i;\n\t}\n\tfor (int i = 0; i < (c + 1) / 2; i++) {\n\t\tif (b[i] == b[c - i -1]) {\n\t\t\tflag = 1;\n\t\t}\n\t\telse {\n\t\t\tflag = 0;\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn flag;\n}\nint main() {\n\tint a, p, x, flag;\n\tcin >> a;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tp = pow(i, 2);\n\t\tx = B(p, a);\n\t\tflag = rev(p);\n\t\tif (flag == 1) {\n\t\t\tcout << i << \"" \"" << p << endl;\n\t\t}\n\t}\n}",COMPILE_ERROR,0,0
1281132885498576896,a8055af842af6d1afea1fdd60df07f482bdc876229f71e1819f2275f3991ea3f,2020-07-09 15:47:36,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\nusing namespace std;\nint B(int a, int n) {\n\tint num = 0, i = 0;\n\twhile (a != 0) {\n\t\tnum += a % n * pow(10, i);\n\t\ta /= n;\n\t\ti++;\n\t}\n\treturn num;\n}\nint rev(int a) {\n\tint b[100] = { 0 }, i = 0, c = 0, flag = 0;\n\twhile (a != 0) {\n\t\tb[i] = a % 10;\n\t\ta /= 10;\n\t\t++i;\n\t\tc = i;\n\t}\n\tfor (int i = 0; i < (c + 1) / 2; i++) {\n\t\tif (b[i] == b[c - i -1]) {\n\t\t\tflag = 1;\n\t\t}\n\t\telse {\n\t\t\tflag = 0;\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn flag;\n}\nint main() {\n\tint a, p, x, flag;\n\tcin >> a;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tp = pow(i, 2);\n\t\tx = B(p, a);\n\t\tflag = rev(p);\n\t\tif (flag == 1) {\n\t\t\tcout << i << \"" \"" << p << endl;\n\t\t}\n\t}\n}",PARTIAL_ACCEPTED,24,424
1281133402798866432,a8055af842af6d1afea1fdd60df07f482bdc876229f71e1819f2275f3991ea3f,2020-07-09 15:49:40,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\nusing namespace std;\nint B(int a, int n) {\n\tint num = 0, i = 0;\n\twhile (a != 0) {\n\t\tnum += a % n * pow(10, i);\n\t\ta /= n;\n\t\ti++;\n\t}\n\treturn num;\n}\nint rev(int a) {\n\tint b[100] = { 0 }, i = 0, c = 0, flag = 0;\n\twhile (a != 0) {\n\t\tb[i] = a % 10;\n\t\ta /= 10;\n\t\t++i;\n\t\tc = i;\n\t}\n\tfor (int i = 0; i < (c + 1) / 2; i++) {\n\t\tif (b[i] == b[c - i -1]) {\n\t\t\tflag = 1;\n\t\t}\n\t\telse {\n\t\t\tflag = 0;\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn flag;\n}\nint main() {\n\tint a, p, x, flag;\n\tcin >> a;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tp = pow(i, 2);\n\t\tx = B(p, a);\n\t\tflag = rev(x);\n\t\tif (flag == 1) {\n\t\t\tcout << i << \"" \"" << p << endl;\n\t\t}\n\t}\n}",PARTIAL_ACCEPTED,36,540
1281134180439605248,c4245dbd96f94634e12832f2357f284893f857027431cac025fcda532a7a33f6,2020-07-09 15:52:45,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstring>\n#include<cstdio>\n#include<algorithm>\nusing namespace std;\nint a;\ninline char b(int x)\n{\n\tif (x >= 0 && x <= 9)\n\t\treturn x + '0';\n\treturn x - 10 + 'A';\n}\nstruct node\n{\n\tint m, c[17];\n\tnode(int y)\n\t{\n\t\tfor (m = 0; y; y++)\n\t\t\tc[1] = y % a, y /= a;\n\t}\n\tvoid out()\n\t{\n\t\tfor (int i = m - 1; i >= 0; i--)\n\t\t\tcout << b(c[i]);\n\t}\n\tbool timef()\n\t{\n\t\tfor (int i = 0; i < m; i++)\n\t\t\tif (c[i] != c[m - 1 - i])\n\t\t\t\treturn false;\n\t\treturn true;\n\t}\n};\n    int main()\n\t{\n\t\tcin >> a;\n\t\tfor (int i = 1; i <= 300; i++)\n\t\t{\n\t\t\tnode n(i * i);\n\t\t\tif (n.timef()) \n\t\t\t{ \n\t\t\t\tnode m(i); \n\t\t\t\tm.out(); \n\t\t\t\tputchar(' '); n.out();\n\t\t\t\tputchar('\\n');\n\t\t\t}\n\t\t}\t\n     system(\""pause\"");\n\t return 0;\n    }\n",TIME_LIMIT_EXCEEDED,0,0
1281134754424872960,c4245dbd96f94634e12832f2357f284893f857027431cac025fcda532a7a33f6,2020-07-09 15:55:02,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstring>\n#include<cstdio>\n#include<algorithm>\nusing namespace std;\nint a;\ninline char b(int x)\n{\n\tif (x >= 0 && x <= 9)\n\t\treturn x + '0';\n\treturn x - 10 + 'A';\n}\nstruct node\n{\n\tint e, c[20];\n\tnode(int y)\n\t{\n\t\tfor (e = 0; y; y++)\n\t\t\tc[1] = y % a, y /= a;\n\t}\n\tvoid out()\n\t{\n\t\tfor (int i = e - 1; i >= 0; i--)\n\t\t\tcout << b(c[i]);\n\t}\n\tbool timef()\n\t{\n\t\tfor (int i = 0; i < e; i++)\n\t\t\tif (c[i] != c[e - i-e])\n\t\t\t\treturn false;\n\t\treturn true;\n\t}\n};\n    int main()\n\t{\n\t\tcin >> a;\n\t\tfor (int i = 1; i <= 300; i++)\n\t\t{\n\t\t\tnode n(i * i);\n\t\t\tif (n.timef()) \n\t\t\t{ \n\t\t\t\tnode m(i); \n\t\t\t\tm.out(); \n\t\t\t\tputchar(' '); n.out();\n\t\t\t\tputchar('\\n');\n\t\t\t}\n\t\t}\t\n     system(\""pause\"");\n\t return 0;\n    }\n\n",TIME_LIMIT_EXCEEDED,0,0
1281134756271407104,a8055af842af6d1afea1fdd60df07f482bdc876229f71e1819f2275f3991ea3f,2020-07-09 15:55:02,C++,30.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\nusing namespace std;\nint B(int a, int n) {\n\tint num = 0, i = 0;\n\twhile (a != 0) {\n\t\tnum += a % n * pow(10, i);\n\t\ta /= n;\n\t\ti++;\n\t}\n\treturn num;\n}\nint rev(int a) {\n\tint b[100] = { 0 }, i = 0, c = 0, flag = 0;\n\twhile (a != 0) {\n\t\tb[i] = a % 10;\n\t\ta /= 10;\n\t\t++i;\n\t\tc = i;\n\t}\n\tfor (int i = 0; i < (c + 1) / 2; i++) {\n\t\tif (b[i] == b[c - i -1]) {\n\t\t\tflag = 1;\n\t\t}\n\t\telse {\n\t\t\tflag = 0;\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn flag;\n}\nint main() {\n\tint a, p, x, flag;\n\tcin >> a;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tp = pow(i, 2);\n\t\tx = B(p, a);\n\t\tflag = rev(x);\n\t\tif (flag == 1) {\n\t\t\tcout << B(i,a) << \"" \"" << x << endl;\n\t\t}\n\t}\n}",PARTIAL_ACCEPTED,26,512
1281139283582173184,c4245dbd96f94634e12832f2357f284893f857027431cac025fcda532a7a33f6,2020-07-09 16:13:02,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<cstdio>\n#include<iostream>\n#include<cstring>\n#include<algorithm>\nusing namespace std;\nint a;\ninline char b(int x)\n{ \n    if (x >= 0 && x <= 9)\n        return x + '0';\n    return x - 10 + 'A';\n}\nstruct node\n{\n    int x, c[17];\n    node(int y)\n    { \n        for (x = 0; y; x++)\n           c[x] = y % a, y /=a; \n    }\n    void out() \n    { for (int i = x - 1; i >= 0; i--)\n       cout << b(c[i]);\n    }\n    bool timef() \n    { \n        for (int i = 0; i < x; i++)\n            if (c[i] != c[x - i - 1])\n                return false; \n        return true;\n    }\n};\nint main()\n{\n    cin >> a;\n    for (int i = 1; i <= 300; i++)\n    {\n        node n(i * i);\n        if (n.timef())\n        { node m(i); \n        m.out();\n        putchar(' ');\n        n.out();\n        putchar('\\n');\n        }\n    }\n    system(\""pause\"");\n    return 0;\n}\n\n",ACCEPTED,24,624
1281140994764890112,c8bd3d02d762695a945b70d49e4d784720ebfe8f207c16c2c2e0245edd2ba39b,2020-07-09 16:19:50,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nint abc[20];\nbool transfer(int a,int b){\n    int m=0;\n    for (int i=0;i<m+1;i++){\n        abc[i]=a%b;\n        a=a/b;\n        m+=1;  \n        if (a==0){\n            break;\n        }    \n    }\n    for (int i=0;i<m;i++)\n        if(abc[i]!=abc[m-i-1])\n            return false;   \n    return true;      \n}\n\nint main()\n{\n    int n,a[15],m,x=0;\n    cin >> n >> m;\n    while(true){\n        int j=0;\n        m+=1;\n        for(int i = 2; i < 11; i++)\n           if (transfer(m,i))\n               j+=1;\n        if(j>1){\n            a[x]=m;\n            x+=1;\n        }\n        if(x==n)\n            break;    \n    }\n    for (int i=0;i<n-1;i++){\n        cout << a[i];\n        cout << endl;\n    }\n    cout << a[n-1];\n    return 0;\n}",ACCEPTED,29,424
1281141214303150080,a8055af842af6d1afea1fdd60df07f482bdc876229f71e1819f2275f3991ea3f,2020-07-09 16:20:42,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<string>\nusing namespace std;\nstring str;\nstring B(int a, int n) {\n\tint i = 0;\n\twhile (a != 0) {\n\t\tstr[i] += a % n;\n\t\ta /= n;\n\t\ti++;\n\t}\n\treturn str;\n}\nint rev() {\n\tint i = 0, c = 0, flag = 0;\n\tc = str.length();\n\tfor (int i = 0; i < (c + 1) / 2; i++) {\n\t\tif (str[i] == str[c - i -1]) {\n\t\t\tflag = 1;\n\t\t}\n\t\telse {\n\t\t\tflag = 0;\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn flag;\n}\nint main() {\n\tint a, p, flag;\n\tstring x;\n\tcin >> a;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tp = pow(i, 2);\n\t\tx = B(p, a);\n\t\tif (rev()) {\n\t\t\tcout << B(i,a) << \"" \"" << x << endl;\n\t\t}\n\t}\n}",WRONG_ANSWER,23,464
1281142143199920128,a8055af842af6d1afea1fdd60df07f482bdc876229f71e1819f2275f3991ea3f,2020-07-09 16:24:24,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<string>\nusing namespace std;\nstring str;\nstring B(int a, int n) {\n\tint i = 0;\n\twhile (a != 0) {\n\t\tstr[i] += (char)(a % n);\n\t\ta /= n;\n\t\ti++;\n\t}\n\treturn str;\n}\nint rev() {\n\tint i = 0, c = 0, flag = 0;\n\tc = str.length();\n\tfor (int i = 0; i < (c + 1) / 2; i++) {\n\t\tif (str[i] == str[c - i - 1]) {\n\t\t\tflag = 1;\n\t\t}\n\t\telse {\n\t\t\tflag = 0;\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn flag;\n}\nint main() {\n\tint a, p, flag;\n\tstring x;\n\tcin >> a;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tp = pow(i, 2);\n\t\tx = B(p, a);\n\t\tif (rev()) {\n\t\t\tcout << B(i, a) << \"" \"" << x << endl;\n\t\t}\n\t}\n}",WRONG_ANSWER,18,384
1281142724374224896,a8055af842af6d1afea1fdd60df07f482bdc876229f71e1819f2275f3991ea3f,2020-07-09 16:26:42,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<string>\nusing namespace std;\nstring str;\nstring B(int a, int n) {\n\tint i = 0;\n\twhile (a != 0) {\n\t\tchar q = (char)(a % n);\n\t\tstr[i] =q ;\n\t\ta /= n;\n\t\ti++;\n\t}\n\treturn str;\n}\nint rev() {\n\tint i = 0, c = 0, flag = 0;\n\tc = str.length();\n\tfor (int i = 0; i < (c + 1) / 2; i++) {\n\t\tif (str[i] == str[c - i - 1]) {\n\t\t\tflag = 1;\n\t\t}\n\t\telse {\n\t\t\tflag = 0;\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn flag;\n}\nint main() {\n\tint a, p, flag;\n\tstring x;\n\tcin >> a;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tp = pow(i, 2);\n\t\tx = B(p, a);\n\t\tif (rev()) {\n\t\t\tcout << B(i, a) << \"" \"" << x << endl;\n\t\t}\n\t}\n}",WRONG_ANSWER,24,384
1281145402382802944,a8055af842af6d1afea1fdd60df07f482bdc876229f71e1819f2275f3991ea3f,2020-07-09 16:37:21,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<string>\nusing namespace std;\nstring str;\nstring B(int a, int n) {\n\tint i = 0;\n\twhile (a != 0) {\n\t\tint t = a % n;\n\t\tif (t < 10)\n\t\t\tstr[i] = t;\n\t\telse\n\t\t\tstr[i]= (char)(t - 10 + \""A\"");\n\t\ta /= n;\n\t\ti++;\n\t}\n\treturn str;\n}\nint rev() {\n\tint i = 0, c = 0, flag = 0;\n\tc = str.length();\n\tfor (int i = 0; i < (c + 1) / 2; i++) {\n\t\tif (str[i] == str[c - i - 1]) {\n\t\t\tflag = 1;\n\t\t}\n\t\telse {\n\t\t\tflag = 0;\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn flag;\n}\nint main() {\n\tint a, p, flag;\n\tstring x;\n\tcin >> a;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tp = pow(i, 2);\n\t\tx = B(p, a);\n\t\tif (rev()) {\n\t\t\tcout << B(i, a) << \"" \"" << x << endl;\n\t\t}\n\t}\n}",COMPILE_ERROR,0,0
1281147727839158272,387dee2d802731a9463bda4a7a8916ccc6198e105f0fa92dced456125caf20d0,2020-07-09 16:46:35,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint number[1005];\n\nvoid transfer(int a,int b){\n    int r=0;\n    while(a){\n        number[++r]=a%b;\n        a/=b;\n    }\n    number[0]=r;\n}\nbool change(){\n    for(int i=1;i<=number[0];i++){\n    \tif(number[i]!=number[number[0]+1-i]) return false;\n    }\n    return true;\n}\n\nvoid print(){\n    for(int i=number[0];i>=1;i--){\n        if(number[i]<=9) \n            cout<<number[i];\n        else \n            cout<<(char)(number[i]-10+'A');\n    }\n} \nint main() {\n    int n;\n\tcin>>n;\n\tfor(int i=1;i<=300;i++){\n    \ttransfer(i*i,n);\n    \tif(change()){\n        \ttransfer(i,n);\n\t        print();\n\t        cout<<' ';\n\t        transfer(i*i,n);\n\t        print();\n\t        puts(\""\"");\n\t\t}\n\t}\n    return 0;\n}",ACCEPTED,27,384
1281151358903697408,e4b96a2cd6f44ec90a53f9c0058af37aa3ab96f6a7e0cd5cab1ca694f03e11ce,2020-07-09 17:01:01,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint pan(int n, int k)\n{\n    int a[30], i = 0;\n    while (n)\n    {\n        a[i++] = n % k;\n        n /= k;\n    }\n    for (int j = 0; j < i / 2; j++)\n        if (a[j] != a[i - j - 1])return 0;\n    return 1;\n}\nvoid output(int a)\n{\n    cout << a << endl;\n}\n\nint main()\n{\n    int a, b;\n    cin >> a >> b;\n    int k = 0;\n    for (int i = b + 1;; i++)\n    {\n        int s = 0;\n        for (int j = 2; j < 11; j++)\n            if (pan(i, j))\n            {\n                s++;\n                if (s == 2)\n                {\n                    k++;\n                    break;\n                }\n            }\n        if (k > a)break;\n        if (s == 2)output(i);\n    }\n    return 0;\n}",ACCEPTED,19,764
1281151598964686848,a8055af842af6d1afea1fdd60df07f482bdc876229f71e1819f2275f3991ea3f,2020-07-09 17:01:58,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<string>\nusing namespace std;\nchar str[100];\nchar str2[100];\nint qq;\nint ww;\nvoid B(int a, int n) {\n\tint i = 0;\n\tchar q;\n\twhile (a != 0) {\n\t\tint t = a % n;\n\t\tif (t < 10)\n\t\t\tstr[i] = t;\n\t\telse {\n\t\t\tq = (char)(t - 10 + \""A\"");\n\t\t\tstr[i] = q;\n\t\t}\n\t\ta /= n;\n\t\t++i;\n\t\tqq = i;\n\t}\n}\nvoid C(int a, int n) {\n\tint i = 0;\n\tchar q;\n\twhile (a != 0) {\n\t\tint t = a % n;\n\t\tif (t < 10)\n\t\t\tstr2[i] = t;\n\t\telse {\n\t\t\tq = (char)(t - 10 + \""A\"");\n\t\t\tstr2[i] = q;\n\t\t}\n\t\ta /= n;\n\t\t++i;\n\t\tww = i;\n\t}\n}\nint rev() {\n\tint i = 0, flag = 0;\n\tfor (int i = 0; i < (qq + 1) / 2; i++) {\n\t\tif (str[i] == str[qq - i - 1]) {\n\t\t\tflag = 1;\n\t\t}\n\t\telse {\n\t\t\tflag = 0;\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn flag;\n}\nint main() {\n\tint a, p, flag;\n\tstring x,y;\n\tcin >> a;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tp = pow(i, 2);\n\t\tB(p, a);\n\t\tB(i, a);\n\t\tif (rev()) {\n\t\t\tfor (int i = ww-1; i >=0; i--) {\n\t\t\t\tcout << str2[i]<<\"" \"";\n\t\t\t}\n\t\t\tfor (int i = qq - 1; i >= 0; i--) {\n\t\t\t\tcout << str[i];\n\t\t\t}\n\t\t}\n\t}\n}",COMPILE_ERROR,0,0
1281151688956641280,c4245dbd96f94634e12832f2357f284893f857027431cac025fcda532a7a33f6,2020-07-09 17:02:19,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nbool ip(int a, int b)\n{\n    short r[100] = { 0 }, c = 0;\n    while (a) \n    {\n        r[c++] = a % b;\n        a /= b;\n    } \n    int m = 0, n =c - 1;\n        if (r[m++] != r[n--])\n            return 0;\n    return 1;\n}\nint main()\n{\n    int x, y;\n    scanf_s(\""%d%d\"", &x, &y);\n    int d = 0;\n    for (int i = y + 1; d != x; i++)\n    {\n        int t = 0;\n        for (int p = 2; p <= 10 && t < 2; p++) \n        {\n            if (ip(i, p))\n                t++;\n        }\n        if (t >= 2)\n            cout <<i, d++;\n    }\n    system(\""pause\"");\n    return 0;\n}",COMPILE_ERROR,0,0
1281151833698910208,c4245dbd96f94634e12832f2357f284893f857027431cac025fcda532a7a33f6,2020-07-09 17:02:54,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nbool ip(int a, int b)\n{\n    short r[100] = { 0 }, c = 0;\n    while (a) \n    {\n        r[c++] = a % b;\n        a /= b;\n    } \n    int m = 0, n =c - 1;\n    if (m < n)\n        if (r[m++] != r[n--])\n            return 0;\n    return 1;\n}\nint main()\n{\n    int x, y;\n    scanf_s(\""%d%d\"", &x, &y);\n    int d = 0;\n    for (int i = y + 1; d != x; i++)\n    {\n        int t = 0;\n        for (int p = 2; p <= 10 && t < 2; p++) \n        {\n            if (ip(i, p))\n                t++;\n        }\n      \n            cout <<i, d++;\n    }\n    system(\""pause\"");\n    return 0;\n}",COMPILE_ERROR,0,0
1281151907270164480,c4245dbd96f94634e12832f2357f284893f857027431cac025fcda532a7a33f6,2020-07-09 17:03:12,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nbool ip(int a, int b)\n{\n    short r[100] = { 0 }, c = 0;\n    while (a) \n    {\n        r[c++] = a % b;\n        a /= b;\n    } \n    int m = 0, n =c - 1;\n    if (m < n)\n        if (r[m++] != r[n--])\n            return 0;\n    return 1;\n}\nint main()\n{\n    int x, y;\n    scanf_s(\""%d%d\"", &x, &y);\n    int d = 0;\n    for (int i = y + 1; d != x; i++)\n    {\n        int t = 0;\n        for (int p = 2; p <= 10 && t < 2; p++) \n        {\n            if (ip(i, p))\n                t++;\n        }\n        if (t >= 2)\n            cout <<i, d++;\n    }\n    system(\""pause\"");\n    return 0;\n}",COMPILE_ERROR,0,0
1281152462344355840,c4245dbd96f94634e12832f2357f284893f857027431cac025fcda532a7a33f6,2020-07-09 17:05:24,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nbool ip(int a, int b)\n{\n    short r[100] = { 0 }, c = 0;\n    while (a) \n    {\n        r[c++] = a % b;\n        a /= b;\n    } \n    int m = 0, n =c - 1;\n    if (m < n)\n        if (r[m++] != r[n--])\n            return 0;\n    return 1;\n}\nint main()\n{\n    int x, y;\n    scanf_s(\""%d%d\"", &x, &y);\n    int d = 0;\n    for (int i = y + 1; d != x; i++)\n    {\n        int t = 0;\n        for (int p = 2; p <= 10 && t < 2; p++) \n        {\n            if (ip(i, p))\n                t++;\n        }\n        if (t >= 2)\n            printf(\""%d\\n\"",i), d++;\n    }\n    system(\""pause\"");\n    return 0;\n}",COMPILE_ERROR,0,0
1281152648773812224,c4245dbd96f94634e12832f2357f284893f857027431cac025fcda532a7a33f6,2020-07-09 17:06:08,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nbool ip(int a, int b)\n{\n    short r[100] = { 0 }, c = 0;\n    while (a) \n    {\n        r[c++] = a % b;\n        a /= b;\n    } \n    int m = 0, n =c - 1;\n    if (m < n)\n        if (r[m++] != r[n--])\n            return 0;\n    return 1;\n}\nint main()\n{\n    int x, y;\n    scanf_s(\""%d%d\"", &x, &y);\n    int d = 0;\n    for (int i = y + 1; d != x; i++)\n    {\n        int t = 0;\n        for (int p = 2; p <= 10 && t < 2; p++) \n        {\n            if (ip(i, p))\n                t++;\n        }\n        if (t >= 2)\n            printf(\""%d\\n\"", i), d++;\n    }\n    system(\""pause\"");\n    return 0;\n}",COMPILE_ERROR,0,0
1281152715421302784,c4245dbd96f94634e12832f2357f284893f857027431cac025fcda532a7a33f6,2020-07-09 17:06:24,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nbool ip(int a, int b)\n{\n    short r[100] = { 0 }, c = 0;\n    while (a) \n    {\n        r[c++] = a % b;\n        a /= b;\n    } \n    int m = 0, n =c - 1;\n    if (m < n)\n        if (r[m++] != r[n--])\n            return 0;\n    return 1;\n}\nint main()\n{\n    int x, y;\n    scanf(\""%d%d\"", &x, &y);\n    int d = 0;\n    for (int i = y + 1; d != x; i++)\n    {\n        int t = 0;\n        for (int p = 2; p <= 10 && t < 2; p++) \n        {\n            if (ip(i, p))\n                t++;\n        }\n        if (t >= 2)\n            printf(\""%d\\n\"", i), d++;\n    }\n    system(\""pause\"");\n    return 0;\n}",PARTIAL_ACCEPTED,27,624
1281152971353538560,c4245dbd96f94634e12832f2357f284893f857027431cac025fcda532a7a33f6,2020-07-09 17:07:25,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nbool ip(int a, int b)\n{\n    short r[100] = { 0 }, c = 0;\n    while (a) \n    {\n        r[c++] = a % b;\n        a /= b;\n    } \n    int m = 0, n =c - 1;\n    if (m < n)\n        if (r[m++] != r[n--])\n            return 0;\n    return 1;\n}\nint main()\n{\n    int x, y;\n    cin>>x>>y;\n    int d = 0;\n    for (int i = y + 1; d != x; i++)\n    {\n        int t = 0;\n        for (int p = 2; p <= 10 && t < 2; p++) \n        {\n            if (ip(i, p))\n                t++;\n        }\n        if (t >= 2)\n            printf(\""%d\\n\"", i), d++;\n    }\n    system(\""pause\"");\n    return 0;\n}",PARTIAL_ACCEPTED,32,640
1281153124671094784,c4245dbd96f94634e12832f2357f284893f857027431cac025fcda532a7a33f6,2020-07-09 17:08:02,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nbool ip(int a, int b)\n{\n    short r[100] = { 0 }, c = 0;\n    while (a) \n    {\n        r[c++] = a % b;\n        a /= b;\n    } \n    int m = 0, n =c - 1;\n    if (m < n)\n        if (r[m++] != r[n--])\n            return 0;\n    return 1;\n}\nint main()\n{\n    int x, y;\n    cin>>x>>y;\n    int d = 0;\n    for (int i = y + 1; d != x; i++)\n    {\n        int t = 0;\n        for (int p = 2; p <= 10 && t < 2; p++) \n        {\n            if (ip(i, p))\n                t++;\n        }\n        if (t >= 2)\n            printf(\""%d\\n\"", i), d++;\n    }\n    system(\""pause\"");\n    return 0;\n}",PARTIAL_ACCEPTED,52,552
1281156483764371456,f1ad5eb80f6bab0de873eaed6ebc9b942566979cd22a9563d2f4fe8a8bbf8df7,2020-07-09 17:21:23,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nint n,s;\nint a[100000],c;\n\nbool op(int x,int k)\n{\n\tc=0;\n\twhile(x>0) {\n\t\ta[++c]=x%k;\n\t\tx/=k;\n\t}\n\tfor(int i=1; i<=ct/2; i++)\n\t\tif(a[i]!=a[c-i+1])\n\t\t\treturn false;\n\treturn true;\n   \n}\n\nint main()\n{\n\tcin>>n>>s;\n\tint ans=0;\n\tfor(int i=s+1; ans!=n; i++) {\n\t\tint sum=0;\n\t\tfor(int j=2; j<=10; j++)\n\t\t\tif(op(i,j)==true)\n\t\t\t\tsum++;\n\t\tif(sum>=2) {\n\t\t\tcout<<i<<endl;\n\t\t\tans++;\t\n\t\t}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1281156521134587904,f1ad5eb80f6bab0de873eaed6ebc9b942566979cd22a9563d2f4fe8a8bbf8df7,2020-07-09 17:21:32,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nint n,s;\nint a[100000],c;\n\nbool op(int x,int k)\n{\n\tc=0;\n\twhile(x>0) {\n\t\ta[++c]=x%k;\n\t\tx/=k;\n\t}\n\tfor(int i=1; i<=c/2; i++)\n\t\tif(a[i]!=a[c-i+1])\n\t\t\treturn false;\n\treturn true;\n   \n}\n\nint main()\n{\n\tcin>>n>>s;\n\tint ans=0;\n\tfor(int i=s+1; ans!=n; i++) {\n\t\tint sum=0;\n\t\tfor(int j=2; j<=10; j++)\n\t\t\tif(op(i,j)==true)\n\t\t\t\tsum++;\n\t\tif(sum>=2) {\n\t\t\tcout<<i<<endl;\n\t\t\tans++;\t\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,18,384
1281156600872493056,d75c4d885833f65ef7bcab17a29fb0c015edd3feeb9e26232b3adfe56837ff2c,2020-07-09 17:21:51,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n    int B;\n    cin>>B;\n    char num1[1000000],num2[1000000];\n    for(int i=1;i<=300;i++){\n        int j=i*i,k=0,n=0;\n        while(i!=0){\n            int iyushu1=i%B;\n            if(B<10){\n                num1[n++]=iyushu1+'0';\n            }\n            else{\n                char s1='A'+iyushu1-10;\n                num1[n++]=s1;\n            }\n            i /=B;\n        }\n        while(j!=0){\n            int iyushu2=j%B;\n            if(B<10){\n                num2[k++]=iyushu2+'0';\n            }\n            else{\n                char s2='A'+iyushu2-10;\n                num2[k++]=s2;\n            }\n            j /=B;\n        }\n        for(int l=0;l<k/2;l++){\n            if(num2[l]!=num2[k-l-1])\n                return 0;\n        }\n        for(int l=n-1;l>=0;l--){\n            cout<<num1[l];\n        }\n        cout<<' ';\n        for(int l=k-1;l>=0;l--){\n            cout<<num2[l];\n        }\n        cout<<endl;\n\n    }\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,0,0
1281156671181611008,f1ad5eb80f6bab0de873eaed6ebc9b942566979cd22a9563d2f4fe8a8bbf8df7,2020-07-09 17:22:07,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nint n,s;\nint a[100000],c;\n\nbool op(int x,int k)\n{\n\tc=0;\n\twhile(x>0) {\n\t\ta[++c]=x%k;\n\t\tx/=k;\n\t}\n\tfor(int i=1; i<=c/2; i++)\n\t\tif(a[i]!=a[c-i+1])\n\t\t\treturn false;\n\treturn true;\n   \n}\n\nint main()\n{\n\tcin>>n>>s;\n\tint a=0;\n\tfor(int i=s+1; a!=n; i++) {\n\t\tint sum=0;\n\t\tfor(int j=2; j<=10; j++)\n\t\t\tif(op(i,j)==true)\n\t\t\t\tsum++;\n\t\tif(sum>=2) {\n\t\t\tcout<<i<<endl;\n\t\t\ta++;\t\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,29,424
1281161041260511232,05f47b8d62d3b9ed3292629732d26adb77e1e62d057e60bf65fc34df9fbbb17c,2020-07-09 17:39:29,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<math.h>\nusing namespace std;\nint main(){\n    int B;\n    cin >> B;//给定一个进制\n    int a,b;\n    for(int i=1;i<=300;i++){\n        for(int j=0;j<=300;j++){\n            if(i==pow(B,j)&&i*i==pow(B,2*j))\n                a=i,b=i*i;\n        }\n    }\n    cout << a << b;\n    return 0;\n}\n",WRONG_ANSWER,97,424
1281162114381570048,2c10b919f13abf5883246b96f89cc73173adac8376c3f1b5e9b5978b338dfa1c,2020-07-09 17:43:45,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n\nint B;\nint a[20];\nbool calc(int x)\n{\n    int np=0;\n    x=x*x;\n    while(x)\n    {\n        a[++np]=x%B;\n        x/=B;\n    }\n    for(int i=1,j=np;i<j;i++,j--)\n        if(a[i]!=a[j])\n            return 0;\n    return 1;\n}\nvoid outs(int x)\n{\n    int np=0;\n    while(x)\n    {\n        a[++np]=x%B;\n        x/=B;\n    }\n    for(int i=np;i>=1;i--)\n    {\n        if(a[i]>9)\n            cout<<a[i]-10+'A';\n        else cout<<a[i];\n    }\n}\nint main()\n{\n    cin>>B;\n    for(int i=1;i<=300;i++)\n    {\n        if(calc(i))\n        {\n            outs(i);\n            printf(\"" \"");\n            outs(i*i);\n            printf(\""\\n\"");\n        }\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1281162156957958144,2c10b919f13abf5883246b96f89cc73173adac8376c3f1b5e9b5978b338dfa1c,2020-07-09 17:43:55,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n\nint B;\nint a[20];\nbool calc(int x)\n{\n    int np=0;\n    x=x*x;\n    while(x)\n    {\n        a[++np]=x%B;\n        x/=B;\n    }\n    for(int i=1,j=np;i<j;i++,j--)\n        if(a[i]!=a[j])\n            return 0;\n    return 1;\n}\nvoid outs(int x)\n{\n    int np=0;\n    while(x)\n    {\n        a[++np]=x%B;\n        x/=B;\n    }\n    for(int i=np;i>=1;i--)\n    {\n        if(a[i]>9)\n            cout<<a[i]-10+'A';\n        else cout<<a[i];\n    }\n}\nint main()\n{\n    cin>>B;\n    for(int i=1;i<=300;i++)\n    {\n        if(calc(i))\n        {\n            outs(i);\n            printf(\"" \"");\n            outs(i*i);\n            printf(\""\\n\"");\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,29,632
1281162348323069952,05f47b8d62d3b9ed3292629732d26adb77e1e62d057e60bf65fc34df9fbbb17c,2020-07-09 17:44:41,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<math.h>\nusing namespace std;\nint main(){\n    int B;\n    cin >> B;//给定一个进制\n    int a,b;\n    for(int i=1;i<=300;i++){\n        for(int j=0;j<=300;j++){\n            if(i==pow(B,j)&&i*i==pow(B,2*j)){\n                a=i,b=i*i;\n            cout << a <<\"" \""<<b<<endl;}\n        }\n   }\n    return 0;\n}\n",WRONG_ANSWER,79,424
1281162546232344576,2c10b919f13abf5883246b96f89cc73173adac8376c3f1b5e9b5978b338dfa1c,2020-07-09 17:45:28,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint pan(int n,int k)\n{\n    int a[30],i=0;\n    while(n)\n    {\n        a[i++]=n%k;\n        n/=k;\n    }\n    for(int j=0;j<i/2;j++)\n        if(a[j]!=a[i-j-1])return 0;\n    return 1;\n}\nint main()\n{\n    int a,b;\n    cin>>a>>b;\n    int k=0;\n    for(int i=b+1;;i++)\n    {\n        int s=0;\n        for(int j=2;j<11;j++)\n        if(pan(i,j))\n        {\n            s++;\n            if(s==2)\n            {\n                k++;\n                break;\n            }\n        }\n        if(k>a)break;\n        if(s==2)cout<<i<<endl;\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1281162574605778944,2c10b919f13abf5883246b96f89cc73173adac8376c3f1b5e9b5978b338dfa1c,2020-07-09 17:45:35,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint pan(int n,int k)\n{\n    int a[30],i=0;\n    while(n)\n    {\n        a[i++]=n%k;\n        n/=k;\n    }\n    for(int j=0;j<i/2;j++)\n        if(a[j]!=a[i-j-1])return 0;\n    return 1;\n}\nint main()\n{\n    int a,b;\n    cin>>a>>b;\n    int k=0;\n    for(int i=b+1;;i++)\n    {\n        int s=0;\n        for(int j=2;j<11;j++)\n        if(pan(i,j))\n        {\n            s++;\n            if(s==2)\n            {\n                k++;\n                break;\n            }\n        }\n        if(k>a)break;\n        if(s==2)cout<<i<<endl;\n    }\n    return 0;\n}",ACCEPTED,29,424
1281165280552615936,086db4f0f11f3b10bda993bb6aca37960aa81cc026acb9478ab6e07d448d7333,2020-07-09 17:56:20,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nint iMax=0,iMin=0;\n\nbool huiwen(int x){\n    int a = x;\n    int b = 0;\n    while(a){\n        b = b*10 + a%10;\n        a/=10;\n    }\n    if(a==b)\n        return 1;\n    else\n        return 0;\n}\n\nbool zhishu(int y){\n    for(int j=2;j<y;j++){\n        if(y%j == 0){\n            return false;\n        }\n    }\n    return true;\n}\nint main()\n{\n    cin >> iMin >> iMax;\n    for(int i=iMin;i<=iMax;i++){\n        if(huiwen(i) && zhishu(i))\n            cout << i << endl;\n    }\n    return 0;\n}\n",WRONG_ANSWER,25,512
1281169132853067776,d75c4d885833f65ef7bcab17a29fb0c015edd3feeb9e26232b3adfe56837ff2c,2020-07-09 18:11:38,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\nint huiwen(int B,int i){\n    int j=i*i,k=0,n=0;\n    char num1[1000000],num2[1000000];\n    while(i!=0){\n        int iyushu1=i%B;\n        if(iyushu1<10){\n            num1[n++]=iyushu1+'0';\n        }\n        else{\n            char s1='A'+iyushu1-10;\n            num1[n++]=s1;\n        }\n        i /=B;\n    }\n    while(j!=0){\n        int iyushu2=j%B;\n        if(iyushu2<10){\n            num2[k++]=iyushu2+'0';\n        }\n        else{\n            char s2='A'+iyushu2-10;\n            num2[k++]=s2;\n        }\n        j /=B;\n    }\n\n    for(int l=0;l<k/2;l++){\n        if(num2[l]!=num2[k-l-1])\n            return 0;\n    }\n    for(int l=n-1;l>=0;l--){\n        cout<<num1[l];\n    }\n    cout<<' ';\n    for(int l=k-1;l>=0;l--){\n        cout<<num2[l];\n    }\n    cout<<endl;\n\n}\n\nint main()\n{\n    int B;\n    cin>>B;\n    for(int i=1;i<=300;i++){\n        huiwen(B,i);\n    }\n    return 0;\n}\n",ACCEPTED,32,488
1281169351385726976,086db4f0f11f3b10bda993bb6aca37960aa81cc026acb9478ab6e07d448d7333,2020-07-09 18:12:31,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nint iMax=0,iMin=0;\n\nbool huiwen(int x){\n    int a = x;\n    int b = 0;\n    while(a){\n        b = b*10+(a%10);\n        a = a/10;\n    }\n    if(x==b)\n        return 1;\n    else\n        return 0;\n}\n\n\nbool zhishu(int y){\n    for(int j=2;j<y;j++){\n        if(y%j == 0){\n            return false;\n        }\n    }\n    return true;\n}\nint main()\n{\n    cin >> iMin >> iMax;\n    for(int i=iMin;i<=iMax;i++){\n        if(huiwen(i) && zhishu(i))\n            cout << i << endl;\n    }\n    return 0;\n}\n",WRONG_ANSWER,28,424
1281169642213539840,086db4f0f11f3b10bda993bb6aca37960aa81cc026acb9478ab6e07d448d7333,2020-07-09 18:13:40,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nint iMax=0,iMin=0;\n\nbool huiwen(int x){\n    int a = x;\n    int b = 0;\n    while(a){\n        b = b*10+(a%10);\n        a = a/10;\n    }\n    if(x==b)\n        return 1;\n    else\n        return 0;\n}\n\n\nbool zhishu(int y){\n    for(int j=2;j<y;j++){\n        if(y%j == 0){\n            return false;\n        }\n    }\n    return true;\n}\nint main()\n{\n    cin >> iMin >> iMax;\n    for(int i=iMin;i<=iMax;i++){\n        if(huiwen(i) && zhishu(i))\n            cout << i << endl;\n    }\n    return 0;\n}\n",WRONG_ANSWER,32,384
1281175178829029376,05f47b8d62d3b9ed3292629732d26adb77e1e62d057e60bf65fc34df9fbbb17c,2020-07-09 18:35:40,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<algorithm>\n#include<iostream>\n#include<string.h>\n#include<math.h>\nusing namespace std;\nstring Jinzhi(int B, int ygs)   {\n    string kmq = \""\"";\n    do {\n        int A = B % ygs;\n        if (A >= 0 && A <= 9)\n        {\n            kmq += A + '0';\n        }\n        else\n        {\n            kmq += A - 10 + 'A';\n        }\n        B/= ygs;\n    }\n    while (B != 0);\n    reverse(kmq.begin(), kmq.end());\n    return kmq;\n}\nbool Hui(const string x){\n    int y=1;\n    for(int i=0;i<=(x.length()/2);i++){\n        if(x[i]!=x[x.length()-i-1]){\n            y=0;\n            break;\n        }\n    }\n    if(y==0)\n        return true;\n    else\n        return false;\n}\nint main()\n{\n    int B;\n    cin >> B;//输入你要给定的进制\n    int j = 0;\n    for (int i = 1;  i<= 300; i++)\n    {\n        j = i;\n\n        string S1 = Jinzhi(j, B);\n        string S2 = Jinzhi((j * j), B);\n\n        if (Hui(S2))\n            cout << S1 << \"" \"" << S2 << endl;\n        else\n            continue;\n    }\n    return 0;\n}\n",WRONG_ANSWER,29,384
1281177266988449792,05f47b8d62d3b9ed3292629732d26adb77e1e62d057e60bf65fc34df9fbbb17c,2020-07-09 18:43:58,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<algorithm>\n#include<iostream>\n#include<string.h>\n#include<math.h>\nusing namespace std;\nstring Jinzhi(int B, int ygs)   {\n    string kmq = \""\"";\n    do {\n        int A = B % ygs;\n        if (A >= 0 && A <10)\n        {\n            kmq += A + '0';\n        }\n        else\n        {\n            kmq += A - 10 + 'A';\n        }\n        B=B/ ygs;\n    }\n    while (B != 0);\n    reverse(kmq.begin(), kmq.end());\n    return kmq;\n}\nbool Hui(const string x){\n    int y=1;\n    for(int i=0;i<=(x.length()/2);i++){\n        if(x[i]!=x[x.length()-i-1]){\n            y=0;\n            break;\n        }\n    }\n    if(y==0)//如果是回文数\n        return true;\n    else\n        return false;\n}\nint main()\n{\n    int B;\n    cin >> B;//输入你要给定的进制\n    int j = 0;\n    for (int i = 1;  i<= 300; i++)\n    {\n        j = i;\n\n        string S1 = Jinzhi(j, B);\n        string S2 = Jinzhi((j * j), B);\n\n        if (Hui(S2)){\n            cout << S1 << \"" \"" << S2 << endl;}\n        else\n            continue;\n    }\n    return 0;\n}\n",WRONG_ANSWER,36,512
1281177727867994112,05f47b8d62d3b9ed3292629732d26adb77e1e62d057e60bf65fc34df9fbbb17c,2020-07-09 18:45:48,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <algorithm> \nusing namespace std;\n\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1]) \n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1) // 是回文数；\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，使用模N取余法；\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\t\n        {\n            ans += t + '0';\n        }\n        else \n        {\n            ans += t - 10 + 'A'; // 保证进制大于10时，数字能用大写字母表示；\n        }\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（），以防止输入为0的情况；\n    reverse(ans.begin(), ans.end());  // 模N取余法，得到的字符串反转即可得到对应进制的数；\n    return ans;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    int j = 0;\n    for (int x = 1; x <= 300; x++)\n    {\n        j = x; // 创建副本\n        \n        string s1 = intToA(j, n);      // 将整数按n进制转换；\n        string s2 = intToA((j * j), n);// 将该数的平方按n进制转换；\n\n        if (Palin_num(s2))\n        {\n            cout << s1 << \"" \"" << s2 << endl;\n        }\n        else\n        {\n            continue;\n        }\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1281177879714381824,05f47b8d62d3b9ed3292629732d26adb77e1e62d057e60bf65fc34df9fbbb17c,2020-07-09 18:46:24,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <algorithm> \nusing namespace std;\n\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1]) \n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1) // 是回文数；\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，使用模N取余法；\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\t\n        {\n            ans += t + '0';\n        }\n        else \n        {\n            ans += t - 10 + 'A'; // 保证进制大于10时，数字能用大写字母表示；\n        }\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（），以防止输入为0的情况；\n    reverse(ans.begin(), ans.end());  // 模N取余法，得到的字符串反转即可得到对应进制的数；\n    return ans;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    int j = 0;\n    for (int x = 1; x <= 300; x++)\n    {\n        j = x; // 创建副本\n        \n        string s1 = intToA(j, n);      // 将整数按n进制转换；\n        string s2 = intToA((j * j), n);// 将该数的平方按n进制转换；\n\n        if (Palin_num(s2))\n        {\n            cout << s1 << \"" \"" << s2 << endl;\n        }\n        else\n        {\n            continue;\n        }\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1281178122332864512,05f47b8d62d3b9ed3292629732d26adb77e1e62d057e60bf65fc34df9fbbb17c,2020-07-09 18:47:22,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <algorithm> \n#include<iostream>\n#include<string>\nusing namespace std;\n\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1]) \n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1) // 是回文数；\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，使用模N取余法；\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\t\n        {\n            ans += t + '0';\n        }\n        else \n        {\n            ans += t - 10 + 'A'; // 保证进制大于10时，数字能用大写字母表示；\n        }\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（），以防止输入为0的情况；\n    reverse(ans.begin(), ans.end());  // 模N取余法，得到的字符串反转即可得到对应进制的数；\n    return ans;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    int j = 0;\n    for (int x = 1; x <= 300; x++)\n    {\n        j = x; // 创建副本\n        \n        string s1 = intToA(j, n);      // 将整数按n进制转换；\n        string s2 = intToA((j * j), n);// 将该数的平方按n进制转换；\n\n        if (Palin_num(s2))\n        {\n            cout << s1 << \"" \"" << s2 << endl;\n        }\n        else\n        {\n            continue;\n        }\n    }\n    return 0;\n}\n",ACCEPTED,32,512
1281178203791474688,05f47b8d62d3b9ed3292629732d26adb77e1e62d057e60bf65fc34df9fbbb17c,2020-07-09 18:47:41,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<algorithm>\n#include<iostream>\n#include<string>\n#include<math.h>\nusing namespace std;\nstring Jinzhi(int B, int ygs)   {\n    string kmq = \""\"";\n    do {\n        int A = B % ygs;\n        if (A >= 0 && A <10)\n        {\n            kmq += A + '0';\n        }\n        else\n        {\n            kmq += A - 10 + 'A';\n        }\n        B=B/ ygs;\n    }\n    while (B != 0);\n    reverse(kmq.begin(), kmq.end());\n    return kmq;\n}\nbool Hui(const string x){\n    int y=1;\n    for(int i=0;i<=(x.length()/2);i++){\n        if(x[i]!=x[x.length()-i-1]){\n            y=0;\n            break;\n        }\n    }\n    if(y==0)//如果是回文数\n        return true;\n    else\n        return false;\n}\nint main()\n{\n    int B;\n    cin >> B;//输入你要给定的进制\n    int j = 0;\n    for (int i = 1;  i<= 300; i++)\n    {\n        j = i;\n\n        string S1 = Jinzhi(j, B);\n        string S2 = Jinzhi((j * j), B);\n\n        if (Hui(S2)){\n            cout << S1 << \"" \"" << S2 << endl;}\n        else\n            continue;\n    }\n    return 0;\n}\n",WRONG_ANSWER,37,424
1281178408598298624,05f47b8d62d3b9ed3292629732d26adb77e1e62d057e60bf65fc34df9fbbb17c,2020-07-09 18:48:30,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<algorithm>\n#include<iostream>\n#include<string>\n#include<math.h>\nusing namespace std;\nbool Hui(const string x){\n    int y=1;\n    for(int i=0;i<=(x.length()/2);i++){\n        if(x[i]!=x[x.length()-i-1]){\n            y=0;\n            break;\n        }\n    }\n    if(y==0)//如果是回文数\n        return true;\n    else\n        return false;\n}\nstring Jinzhi(int B, int ygs)   {\n    string kmq = \""\"";\n    do {\n        int A = B % ygs;\n        if (A >= 0 && A <10)\n        {\n            kmq += A + '0';\n        }\n        else\n        {\n            kmq += A - 10 + 'A';\n        }\n        B=B/ ygs;\n    }\n    while (B != 0);\n    reverse(kmq.begin(), kmq.end());\n    return kmq;\n}\nint main()\n{\n    int B;\n    cin >> B;//输入你要给定的进制\n    int j = 0;\n    for (int i = 1;  i<= 300; i++)\n    {\n        j = i;\n\n        string S1 = Jinzhi(j, B);\n        string S2 = Jinzhi((j * j), B);\n\n        if (Hui(S2)){\n            cout << S1 << \"" \"" << S2 << endl;}\n        else\n            continue;\n    }\n    return 0;\n}\n",WRONG_ANSWER,42,552
1281178950145867776,05f47b8d62d3b9ed3292629732d26adb77e1e62d057e60bf65fc34df9fbbb17c,2020-07-09 18:50:39,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<algorithm>\n#include<iostream>\n#include<string>\n#include<math.h>\nusing namespace std;\nstring Jinzhi(int B, int ygs)   {\n    string kmq = \""\"";\n    do {\n        int A = B % ygs;\n        if (A >= 0 && A <10)\n        {\n            kmq += A + '0';\n        }\n        else\n        {\n            kmq += A - 10 + 'A';\n        }\n        B=B/ ygs;\n    }\n    while (B != 0);\n    reverse(kmq.begin(), kmq.end());\n    return kmq;\n}\nbool Hui(const string x){\n    int y=1;\n    int m=x.length();\n    for(int i=0;i<=(m/2);i++){\n        if(x[i]!=x[m-i-1]){\n            y=0;\n            break;\n        }\n    }\n    if(y==0)//如果是回文数\n        return true;\n    else\n        return false;\n}\nint main()\n{\n    int B;\n    cin >> B;//输入你要给定的进制\n    int j = 0;\n    for (int i = 1;  i<= 300; i++)\n    {\n        j = i;\n\n        string S1 = Jinzhi(j, B);\n        string S2 = Jinzhi((j * j), B);\n\n        if (Hui(S2)){\n            cout << S1 << \"" \"" << S2 << endl;}\n        else\n            continue;\n    }\n    return 0;\n}\n",WRONG_ANSWER,40,424
1281180426868031488,05f47b8d62d3b9ed3292629732d26adb77e1e62d057e60bf65fc34df9fbbb17c,2020-07-09 18:56:31,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<algorithm>\n#include<iostream>\n#include<string>\n#include<math.h>\nusing namespace std;\nstring Jinzhi(int B, int ygs)   {\n    string kmq = \""\"";\n    do {\n        int k = B % ygs;\n        if (k >= 0 && k <10)\n        {\n            kmq += k + '0';\n        }\n        else\n        {\n            kmq += k - 10 + 'A';\n        }\n        B/= ygs;\n    }\n    while (B != 0);\n    reverse(kmq.begin(), kmq.end());\n    return kmq;\n}\nbool Hui(const string x){\n    int y=1;\n    int m=x.length();\n    for(int i=0;i<=(m/2);i++){\n        if(x[i]!=x[m-i-1]){\n            y=0;\n            break;\n        }\n    }\n    if(y==1)//如果是回文数\n        return true;\n    else\n        return false;\n}\nint main()\n{\n    int B;\n    cin >> B;//输入你要给定的进制\n    int j = 0;\n    for (int i = 1;  i<= 300; i++)\n    {\n        j = i;\n\n        string S1 = Jinzhi(j, B);\n        string S2 = Jinzhi((j * j), B);\n\n        if (Hui(S2)){\n            cout << S1 << \"" \"" << S2 << endl;}\n        else\n            continue;\n    }\n    return 0;\n}\n",ACCEPTED,28,512
1281180980612620288,d75c4d885833f65ef7bcab17a29fb0c015edd3feeb9e26232b3adfe56837ff2c,2020-07-09 18:58:43,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n\nusing namespace std;\nint ihuiwen(int S,int b){\n    int k=0;\n    char num[1000000];\n    while(S!=0){\n        num[k++]=S%b;\n        S/=b;\n    }\n    for(int l=0;l<k/2;l++){\n        if(num[l]!=num[k-1-l])\n            return 0;\n        else\n            return 1;\n    }\n}\n\nint ifinal(int S){\n    int k=0;\n    for(int b=2;b<=10;b++){\n        if(ihuiwen(S,b)==1)\n            k+=1;\n    }\n    if(k>=2)\n        return 1;\n    else\n        return 0;\n}\n\nint main()\n{\n    int m=0,N,S;\n    cin>>N>>S;\n    S+=1;\n    while(m<N){\n        if(ifinal(S)==1){\n            m+=1;\n            cout<<S<<endl;\n        }\n        S+=1;\n    }\n    return 0;\n}\n",WRONG_ANSWER,40,428
1281181573645262848,d75c4d885833f65ef7bcab17a29fb0c015edd3feeb9e26232b3adfe56837ff2c,2020-07-09 19:01:05,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n\nusing namespace std;\nint ihuiwen(int S,int b){\n    int k=0;\n    char num[1000000];\n    while(S!=0){\n        num[k++]=S%b;\n        S/=b;\n    }\n    for(int l=0;l<k/2;l++){\n        if(num[l]!=num[k-1-l])\n            return 0;\n        else\n            return 1;\n    }\n}\n\nint ifinal(int S){\n    int k=0;\n    for(int b=2;b<=10;b++){\n        if(ihuiwen(S,b)==1)\n            k+=1;\n    }\n    if(k>=2)\n        return 1;\n    else\n        return 0;\n}\n\nint main()\n{\n    int m=0,N,S;\n    cin>>N>>S;\n    S+=1;\n    while(m<N){\n        if(ifinal(S)==1){\n            m+=1;\n            cout<<S<<endl;\n        }\n        S+=1;\n    }\n    return 0;\n}\n",WRONG_ANSWER,28,552
1281183525733064704,d75c4d885833f65ef7bcab17a29fb0c015edd3feeb9e26232b3adfe56837ff2c,2020-07-09 19:08:50,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n\nusing namespace std;\nint ihuiwen(int S,int b){\n    int k=0;\n    char num[1000000];\n    while(S!=0){\n        num[k++]=S%b;\n        S/=b;\n    }\n    for(int l=0;l<k/2;l++){\n        if(num[l]!=num[k-1-l])\n            return 0;\n        else\n            return 1;\n    }\n    return 0;\n}\n\nint ifinal(int S){\n    int k=0;\n    for(int b=2;b<=10;b++){\n        if(ihuiwen(S,b)==1)\n            k+=1;\n    }\n    if(k>=2)\n        return 1;\n    else\n        return 0;\n}\n\nint main()\n{\n    int m=0,N,S;\n    cin>>N>>S;\n    S+=1;\n    while(m<N){\n        if(ifinal(S)==1){\n            m+=1;\n            cout<<S<<endl;\n        }\n        S+=1;\n    }\n    return 0;\n}\n",WRONG_ANSWER,28,424
1281183904898146304,d75c4d885833f65ef7bcab17a29fb0c015edd3feeb9e26232b3adfe56837ff2c,2020-07-09 19:10:20,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n\nusing namespace std;\nint ihuiwen(int S,int b){\n    int k=0;\n    char num[1000000];\n    while(S!=0){\n        num[k++]=S%b;\n        S/=b;\n    }\n    for(int l=0;l<k/2;l++){\n        if(num[l]!=num[k-1-l])\n            return 0;\n        else\n            return 1;\n    }\n}\n\nint ifinal(int S){\n    int k=0;\n    for(int b=2;b<=10;b++){\n        if(ihuiwen(S,b)==1)\n            k+=1;\n    }\n    if(k>=2)\n        return 1;\n    else\n        return 0;\n}\n\nint main()\n{\n    int m=0,N,S;\n    cin>>N>>S;\n    S+=1;\n    while(m<N){\n        if(ifinal(S)==1){\n            m+=1;\n            cout<<S<<endl;\n        }\n        S+=1;\n    }\n    return 0;\n}\n",WRONG_ANSWER,36,512
1281184528943472640,d75c4d885833f65ef7bcab17a29fb0c015edd3feeb9e26232b3adfe56837ff2c,2020-07-09 19:12:49,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n\nusing namespace std;\nint ihuiwen(int S,int b){\n    int k=0;\n    char num[1000000];\n    while(S!=0){\n        num[k++]=S%b;\n        S/=b;\n    }\n    for(int l=0;l<k/2;l++){\n        if(num[l]!=num[k-1-l])\n            return 0;\n    }\n    return 1;\n}\n\nint ifinal(int S){\n    int k=0;\n    for(int b=2;b<=10;b++){\n        if(ihuiwen(S,b)==1)\n            k+=1;\n    }\n    if(k>=2)\n        return 1;\n    else\n        return 0;\n}\n\nint main()\n{\n    int m=0,N,S;\n    cin>>N>>S;\n    S+=1;\n    while(m<N){\n        if(ifinal(S)==1){\n            m+=1;\n            cout<<S<<endl;\n        }\n        S+=1;\n    }\n    return 0;\n}\n",ACCEPTED,29,424
1281205473721630720,05f47b8d62d3b9ed3292629732d26adb77e1e62d057e60bf65fc34df9fbbb17c,2020-07-09 20:36:03,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<algorithm>\n#include<iostream>\n#include<string>\n#include<math.h>\n#include <vector>\nusing namespace std;\nstring Jinzhi(int B, int ygs)   {\n    string kmq = \""\"";\n    do {\n        int k = B % ygs;\n        if (k >= 0 && k <10)\n        {\n            kmq += k + '0';\n        }\n        else\n        {\n            kmq += k - 10 + 'A';\n        }\n        B/= ygs;\n    }\n    while (B != 0);\n    reverse(kmq.begin(), kmq.end());\n    return kmq;\n}\nint yy(int A[],int n){\n    A[n]=A[n+1];\n}\nbool Hui(const string x){\n    int y=1;\n    int m=x.length();\n    for(int i=0;i<=(m/2);i++){\n        if(x[i]!=x[m-i-1]){\n            y=0;\n            break;\n        }\n    }\n    if(y==1)//如果是回文数\n        return true;\n    else\n        return false;\n}\nint main(){\n    int N,S,X;\n    cin >> N >> S;//输入N和S\n    S+=1;\n    vector<int>Y;\n    while(sizeof (Y)<N){\n        X=0;\n        for (int i=2; i<11; i++){\n            if(Hui(Jinzhi(S,i))){\n                X+=1;\n            }\n        }\n        if(X>1){\n            Y.push_back(S);\n        }\n        S+=1;\n    }\n    for (int i=0; i<Y.size(); i++)\n            cout << Y[i] << endl;\n        return 0;\n}",WRONG_ANSWER,36,512
1281206017018216448,05f47b8d62d3b9ed3292629732d26adb77e1e62d057e60bf65fc34df9fbbb17c,2020-07-09 20:38:12,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<algorithm>\n#include<iostream>\n#include<string>\n#include<math.h>\n#include <vector>\nusing namespace std;\nstring Jinzhi(int B, int ygs)   {\n    string kmq = \""\"";\n    do {\n        int k = B % ygs;\n        if (k >= 0 && k <10)\n        {\n            kmq += k + '0';\n        }\n        else\n        {\n            kmq += k - 10 + 'A';\n        }\n        B/= ygs;\n    }\n    while (B != 0);\n    reverse(kmq.begin(), kmq.end());\n    return kmq;\n}\nint yy(int A[],int n){\n    A[n]=A[n+1];\n}\nbool Hui(const string x){\n    int y=1;\n    int m=x.length();\n    for(int i=0;i<=(m/2);i++){\n        if(x[i]!=x[m-i-1]){\n            y=0;\n            break;\n        }\n    }\n    if(y==1)//如果是回文数\n        return true;\n    else\n        return false;\n}\nint main(){\n    int N,S,X;\n    cin >> N >> S;//输入N和S\n    S++;\n    vector<int>Y;\n    while(sizeof (Y)<N){\n        X=0;\n        for (int i=2; i<11; i++){\n            if(Hui(Jinzhi(S,i))){\n                X+=1;\n            }\n        }\n        if(X>1){\n            Y.push_back(S);\n        }\n        S++;\n    }\n    for (int i=0; i<Y.size(); i++)\n            cout << Y[i] << endl;\n        return 0;\n}\n",WRONG_ANSWER,28,512
1281207191267106816,05f47b8d62d3b9ed3292629732d26adb77e1e62d057e60bf65fc34df9fbbb17c,2020-07-09 20:42:52,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<algorithm>\n#include<iostream>\n#include<string>\n#include<math.h>\n#include <vector>\nusing namespace std;\nstring Jinzhi(int B, int ygs)   {\n    string kmq = \""\"";\n    do {\n        int k = B % ygs;\n        if (k >= 0 && k <10)\n        {\n            kmq += k + '0';\n        }\n        else\n        {\n            kmq += k - 10 + 'A';\n        }\n        B=B/ ygs;\n    }\n    while (B != 0);\n    reverse(kmq.begin(), kmq.end());\n    return kmq;\n}\nint yy(int A[],int n){\n    A[n]=A[n+1];\n}\nbool Hui(const string x){\n    int y=1;\n    int m=x.length();\n    for(int i=0;i<=(m/2);i++){\n        if(x[i]!=x[m-i-1]){\n            y=0;\n            break;\n        }\n    }\n    if(y==1)//如果是回文数\n        return true;\n    else\n        return false;\n}\nint main(){\n    int N,S,X;\n    cin >> N >> S;//输入N和S\n    S++;\n    vector<int>Y;\n    while(Y.size()<N){\n        X=0;\n        for (int i=2; i<11; i++){\n            if(Hui(Jinzhi(S,i))){\n                X+=1;\n            }\n        }\n        if(X>1){\n            Y.push_back(S);\n        }\n        S++;\n    }\n    for (int i=0; i<Y.size(); i++)\n            cout << Y[i] << endl;\n        return 0;\n}\n",ACCEPTED,31,652
1281212429215645696,981a92fd822b0ea04eda5711ba61a932542e5eca1203d551be888da675e37eca,2020-07-09 21:03:41,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n\nusing namespace std;\nbool huiwen(int x, int y) {\n\tint c = x, sum = 0;\n\twhile (x / y) {\n\t\tsum = sum * y + x % y;\n\t\tx /= y;\n\t}\n\tsum = sum * y + x;\n\tif (sum == c)\n\t\treturn 1;\n\telse\n\t\treturn 0;\n}\nint B,sum;\nint main() {\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tsum = i * i;\n\t\tif (huiwen(sum, B))\n\t\t\tcout << i <<\"" \""<< sum << endl;\n\t}\n}",PARTIAL_ACCEPTED,44,512
1281231339133526016,981a92fd822b0ea04eda5711ba61a932542e5eca1203d551be888da675e37eca,2020-07-09 22:18:50,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n\nusing namespace std;\nint num1[1000];\nint B;\nbool huiwen(int x, int y) {\n\tint c = x, sum = 0;\n\twhile (x / y) {\n\t\tsum = sum * y + x % y;\n\t\tx /= y;\n\t}\n\tsum = sum * y + x;\n\tif (sum == c)\n\t\treturn 1;\n\telse\n\t\treturn 0;\n}\n\nvoid zhuan(int x)\n{\n\tint np = 0;\n\twhile (x)\n\t{\n\t\tnum1[++np] = x % B;\n\t\tx /= B;\n\t}\n\tfor (int i = np; i >= 1; i--)\n\t{\n\t\tif (num1[i] > 9)\n\t\t\tprintf(\""%c\"", num1[i] - 10 + 'A');\n\t\telse printf(\""%d\"", num1[i]);\n\t}\n}\nint sum;\nint main() {\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tsum = i * i;\n\t\tif (huiwen(sum, B))\n\t\t\tzhuan(i);\n\t\t\tcout << \"" \""<< endl;\n\t\t\tzhuan(i * i);\n\t}\n}",WRONG_ANSWER,25,384
1281231647574253568,bcb3ff810e5a0484ae0550949ab982695da1f921da2e0407850a5ce7faddd0d1,2020-07-09 22:20:03,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint B;\nint a[15];\nbool f(int x)\n{\n    int n=0;\n    x=x*x;\n    while(x){\n        a[++n]=x % B;\n        x = x / B;\n    }\n\n\n    for(int i=1,j=n;i<j;i++,j--)\n        if(a[i]!=a[j])\n            return 0;\n    return 1;\n}\nvoid cc(int x)\n{\n    int n=0;\n    while(x)\n    {\n        a[++n]=x % B;\n        x = x / B;\n    }\n    for(int i=n;i>=1;i--)\n    {\n        if(a[i]<=9)\n            cout<<a[i];\n        else\n            cout<<a[i]-10+'A';\n    }\n}\nint main()\n{\n    cin>>B;\n    for(int i=1;i<=300;i++)\n    {\n        if(f(i)){\n            cc(i*i);\n            cout<<endl;\n        }\n    }\n    return 0;\n}\n",MULTIPLE_ERROR,43,424
1281231805296861184,bcb3ff810e5a0484ae0550949ab982695da1f921da2e0407850a5ce7faddd0d1,2020-07-09 22:20:41,C++,40.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint B;\nint a[15];\nbool f(int x)\n{\n    int n=0;\n    x=x*x;\n    while(x){\n        a[++n]=x % B;\n        x = x / B;\n    }\n\n\n    for(int i=1,j=n;i<j;i++,j--)\n        if(a[i]!=a[j])\n            return 0;\n    return 1;\n}\nvoid cc(int x)\n{\n    int n=0;\n    while(x)\n    {\n        a[++n]=x % B;\n        x = x / B;\n    }\n    for(int i=n;i>=1;i--)\n    {\n        if(a[i]<=9)\n            cout<<a[i];\n        else\n            cout<<a[i]-10+'A';\n    }\n}\nint main()\n{\n    cin>>B;\n    for(int i=1;i<=300;i++)\n    {\n        if(f(i)){\n            cc(i);\n            cout<<\"" \"";\n            cc(i*i);\n            cout<<endl;\n        }\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,32,512
1281232051720609792,bcb3ff810e5a0484ae0550949ab982695da1f921da2e0407850a5ce7faddd0d1,2020-07-09 22:21:39,C++,40.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint B;\nint a[15];\nbool f(int x)\n{\n    int n=0;\n    x=x*x;\n    while(x){\n        a[++n]=x % B;\n        x = x / B;\n    }\n\n\n    for(int i=1,j=n;i<j;i++,j--)\n        if(a[i]!=a[j])\n            return 0;\n    return 1;\n}\nvoid cc(int x)\n{\n    int n=0;\n    while(x)\n    {\n        a[++n]=x % B;\n        x = x / B;\n    }\n    for(int i=n;i>=1;i--)\n    {\n        if(a[i]>9)\n            cout<<a[i]-10+'A';\n        else\n            cout<<a[i];\n    }\n}\nint main()\n{\n    cin>>B;\n    for(int i=1;i<=300;i++)\n    {\n        if(f(i)){\n            cc(i);\n            cout<<\"" \"";\n            cc(i*i);\n            cout<<endl;\n        }\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,32,540
1281232157224140800,bcb3ff810e5a0484ae0550949ab982695da1f921da2e0407850a5ce7faddd0d1,2020-07-09 22:22:05,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint B;\nint a[20];\nbool f(int x)\n{\n    int n=0;\n    x=x*x;\n    while(x){\n        a[++n]=x % B;\n        x = x / B;\n    }\n\n\n    for(int i=1,j=n;i<j;i++,j--)\n        if(a[i]!=a[j])\n            return 0;\n    return 1;\n}\nvoid cc(int x)\n{\n    int n=0;\n    while(x)\n    {\n        a[++n]=x % B;\n        x = x / B;\n    }\n    for(int i=n;i>=1;i--)\n    {\n        if(a[i]>9)\n            cout<<a[i]-10+'A';\n        else\n            cout<<a[i];\n    }\n}\nint main()\n{\n    cin>>B;\n    for(int i=1;i<=300;i++)\n    {\n        if(f(i)){\n            cc(i);\n            cout<<\"" \"";\n            cc(i*i);\n            cout<<endl;\n        }\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,24,540
1281232245765890048,981a92fd822b0ea04eda5711ba61a932542e5eca1203d551be888da675e37eca,2020-07-09 22:22:26,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstdio>\nusing namespace std;\nint num1[1000];\nint B;\nbool huiwen(int x, int y) {\n\tint c = x, sum = 0;\n\twhile (x / y) {\n\t\tsum = sum * y + x % y;\n\t\tx /= y;\n\t}\n\tsum = sum * y + x;\n\tif (sum == c)\n\t\treturn 1;\n\telse\n\t\treturn 0;\n}\n\nvoid zhuan(int x)\n{\n\tint np = 0;\n\twhile (x)\n\t{\n\t\tnum1[++np] = x % B;\n\t\tx /= B;\n\t}\n\tfor (int i = np; i >= 1; i--)\n\t{\n\t\tif (num1[i] > 9)\n\t\t\tprintf(\""%c\"", num1[i] - 10 + 'A');\n\t\telse printf(\""%d\"", num1[i]);\n\t}\n}\nint sum;\nint main() {\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tsum = i * i;\n\t\tif (huiwen(sum, B)) {\n\t\t\tzhuan(i);\n\t\t\tprintf(\"" \"");\n\t\t\tzhuan(i * i);\n\t\t\tprintf(\""\\n\"");\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,32,512
1281233251027312640,bcb3ff810e5a0484ae0550949ab982695da1f921da2e0407850a5ce7faddd0d1,2020-07-09 22:26:25,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint B;\nint a[20];\nbool f(int x)\n{\n    int n=0;\n    x=x*x;\n    while(x){\n        a[++n]=x % B;\n        x = x / B;\n    }\n\n\n    for(int i=1,j=n;i<j;i++,j--)\n        if(a[i]!=a[j])\n            return 0;\n    return 1;\n}\nvoid cc(int x)\n{\n    int n=0;\n    while(x)\n    {\n        a[++n]=x % B;\n        x = x / B;\n    }\n    for(int i=n;i>=1;i--)\n    {\n        if(a[i]>9)\n            cout<<a[i]-10+'A';\n        else\n            cout<<a[i];\n    }\n}\nint main()\n{\n    cin>>B;\n    for(int i=1;i<=300;i++)\n    {\n        if(f(i)){\n            cc(i);\n            printf(\"" \"");\n            cc(i*i);\n            cout<<endl;\n        }\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,40,424
1281233836308881408,bcb3ff810e5a0484ae0550949ab982695da1f921da2e0407850a5ce7faddd0d1,2020-07-09 22:28:45,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint B;\nint a[20];\nbool f(int x)\n{\n    int n=0;\n    x=x*x;\n    while(x){\n        a[++n]=x % B;\n        x = x / B;\n    }\n\n\n    for(int i=1,j=n;i<j;i++,j--)\n        if(a[i]!=a[j])\n            return 0;\n    return 1;\n}\nvoid cc(int x)\n{\n    int n=0;\n    while(x)\n    {\n        a[++n]=x % B;\n        x = x / B;\n    }\n    for(int i=n;i>=1;i--)\n    {\n        if(a[i]>9)\n            cout<<a[i]-10+'A';\n        else\n            cout<<a[i];\n    }\n}\nint main()\n{\n    cin>>B;\n    for(int i=1;i<=300;i++)\n    {\n        if(f(i)){\n            cc(i);\n            printf(\"" \"");\n            cc(i*i);\n            printf(\""\\n\"");\n        }\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,35,420
1281234274421751808,bcb3ff810e5a0484ae0550949ab982695da1f921da2e0407850a5ce7faddd0d1,2020-07-09 22:30:29,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint B;\nint a[20];\nbool f(int x)\n{\n    int n=0;\n    x=x*x;\n    while(x){\n        a[++n]=x % B;\n        x = x / B;\n    }\n\n\n    for(int i=1,j=n;i<j;i++,j--)\n        if(a[i]!=a[j])\n            return 0;\n    return 1;\n}\nvoid cc(int x)\n{\n    int n=0;\n    while(x)\n    {\n        a[++n]=x % B;\n        x = x / B;\n    }\n    for(int i=n;i>=1;i--)\n    {\n        if(a[i]>9)\n            printf(\""%c\"",a[i]-10+'A')\n        else\n            cout<<a[i];\n    }\n}\nint main()\n{\n    cin>>B;\n    for(int i=1;i<=300;i++)\n    {\n        if(f(i)){\n            cc(i);\n            printf(\"" \"");\n            cc(i*i);\n            printf(\""\\n\"");\n        }\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1281234336685162496,bcb3ff810e5a0484ae0550949ab982695da1f921da2e0407850a5ce7faddd0d1,2020-07-09 22:30:44,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint B;\nint a[20];\nbool f(int x)\n{\n    int n=0;\n    x=x*x;\n    while(x){\n        a[++n]=x % B;\n        x = x / B;\n    }\n\n\n    for(int i=1,j=n;i<j;i++,j--)\n        if(a[i]!=a[j])\n            return 0;\n    return 1;\n}\nvoid cc(int x)\n{\n    int n=0;\n    while(x)\n    {\n        a[++n]=x % B;\n        x = x / B;\n    }\n    for(int i=n;i>=1;i--)\n    {\n        if(a[i]>9)\n            printf(\""%c\"",a[i]-10+'A');\n        else\n            cout<<a[i];\n    }\n}\nint main()\n{\n    cin>>B;\n    for(int i=1;i<=300;i++)\n    {\n        if(f(i)){\n            cc(i);\n            printf(\"" \"");\n            cc(i*i);\n            printf(\""\\n\"");\n        }\n    }\n    return 0;\n}\n",ACCEPTED,25,384
1281234587052589056,bcb3ff810e5a0484ae0550949ab982695da1f921da2e0407850a5ce7faddd0d1,2020-07-09 22:31:44,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint B;\nint a[20];\nbool f(int x)\n{\n    int n=0;\n    x=x*x;\n    while(x){\n        a[++n]=x % B;\n        x = x / B;\n    }\n\n\n    for(int i=1,j=n;i<j;i++,j--)\n        if(a[i]!=a[j])\n            return 0;\n    return 1;\n}\nvoid cc(int x)\n{\n    int n=0;\n    while(x)\n    {\n        a[++n]=x % B;\n        x = x / B;\n    }\n    for(int i=n;i>=1;i--)\n    {\n        if(a[i]>9)\n            printf(\""%c\"",a[i]-10+'A');//吼，就是这个倒霉地方卡了这么多遍!!!!记住！！！\n        else\n            cout<<a[i];\n    }\n}\nint main()\n{\n    cin>>B;\n    for(int i=1;i<=300;i++)\n    {\n        if(f(i)){\n            cc(i);\n            printf(\"" \"");\n            cc(i*i);\n            printf(\""\\n\"");\n        }\n    }\n    return 0;\n}\n",ACCEPTED,32,424
1281234698787807232,bcb3ff810e5a0484ae0550949ab982695da1f921da2e0407850a5ce7faddd0d1,2020-07-09 22:32:11,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint B;\nint a[20];\nbool f(int x)\n{\n    int n=0;\n    x=x*x;\n    while(x){\n        a[n++]=x % B;\n        x = x / B;\n    }\n\n\n    for(int i=1,j=n;i<j;i++,j--)\n        if(a[i]!=a[j])\n            return 0;\n    return 1;\n}\nvoid cc(int x)\n{\n    int n=0;\n    while(x)\n    {\n        a[n++]=x % B;\n        x = x / B;\n    }\n    for(int i=n;i>=1;i--)\n    {\n        if(a[i]>9)\n            printf(\""%c\"",a[i]-10+'A');//吼，就是这个倒霉地方卡了这么多遍!!!!记住！！！\n        else\n            cout<<a[i];\n    }\n}\nint main()\n{\n    cin>>B;\n    for(int i=1;i<=300;i++)\n    {\n        if(f(i)){\n            cc(i);\n            printf(\"" \"");\n            cc(i*i);\n            printf(\""\\n\"");\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,29,512
1281234778123067392,bcb3ff810e5a0484ae0550949ab982695da1f921da2e0407850a5ce7faddd0d1,2020-07-09 22:32:29,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint B;\nint a[20];\nbool f(int x)\n{\n    int n=0;\n    x=x*x;\n    while(x){\n        a[n++]=x % B;\n        x = x / B;\n    }\n\n\n    for(int i=1,j=n;i<j;i++,j--)\n        if(a[i]!=a[j])\n            return 0;\n    return 1;\n}\nvoid cc(int x)\n{\n    int n=0;\n    while(x)\n    {\n        a[++n]=x % B;\n        x = x / B;\n    }\n    for(int i=n;i>=1;i--)\n    {\n        if(a[i]>9)\n            printf(\""%c\"",a[i]-10+'A');//吼，就是这个倒霉地方卡了这么多遍!!!!记住！！！\n        else\n            cout<<a[i];\n    }\n}\nint main()\n{\n    cin>>B;\n    for(int i=1;i<=300;i++)\n    {\n        if(f(i)){\n            cc(i);\n            printf(\"" \"");\n            cc(i*i);\n            printf(\""\\n\"");\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,32,424
1281234944000442368,bcb3ff810e5a0484ae0550949ab982695da1f921da2e0407850a5ce7faddd0d1,2020-07-09 22:33:09,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint B;\nint a[20];\nbool f(int x)\n{\n    int n=0;\n    x=x*x;\n    while(x){\n        a[++n]=x % B;\n        x = x / B;\n    }\n\n\n    for(int i=1,j=n;i<j;i++,j--)\n        if(a[i]!=a[j])\n            return 0;\n    return 1;\n}\nvoid cc(int x)\n{\n    int n=0;\n    while(x)\n    {\n        a[++n]=x % B;\n        x = x / B;\n    }\n    for(int i=n;i>=1;i--)\n    {\n        if(a[i]>9)\n            printf(\""%c\"",a[i]-10+'A');//吼，就是这个倒霉地方卡了这么多遍!!!!记住！！！\n        else\n            cout<<a[i];\n    }\n}\nint main()\n{\n    cin>>B;\n    for(int i=1;i<=300;i++)\n    {\n        if(f(i)){\n            cc(i);\n            cout<<\"" \"";\n            cc(i*i);\n            cout<<endl;\n        }\n    }\n    return 0;\n}\n",ACCEPTED,25,496
1281236758832807936,5f6fe5ec2e9f1448b66bc330cc1ed4d1d67a835fd6cdce39f4a1bed8c73e173d,2020-07-09 22:40:22,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream> \nusing namespace std;\nint main()\n{\n\tint B;\n\tcin >> B;\n\tint i;\n\tint l;\n\tint ch[400]; int c[400];\n\tint m, p, j, t;\n\tint f;\n\tint tam;\n\tfor (i = 1; i < 301; i++)\n\t{\n\t\tt = 0;\n\t\tf = 1;\n\t\tl = i*i;\n\t\tm = 0;\n\t\twhile (l != 0)\n\t\t{\n\t\t\tp = l % B;\n\t\t\tl = l / B;\n\t\t\tm++;\n\t\t\tch[m] = p;\n\t\t}\n\t\tfor (j = 1; j <= m; j++)\n\t\t{\n\t\t\tif (ch[j] != ch[m + 1 - j])\n\t\t\t{\n\t\t\t\tf = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (f == 1)\n\t\t{\n\t\t\ttam = i;\n\t\t\twhile (tam != 0)\n\t\t\t{\n\t\t\t\tp = tam % B;\n\t\t\t\ttam = tam / B;\n\t\t\t\tt++;\n\t\t\t\tc[t] = p;\n\t\t\t}\n\t\t\tfor (j = t; j >= 1; j--)\n\t\t\t{\n\t\t\t\tif (c[j] <= 10)\n\t\t\t\t{\n\t\t\t\t\tcout << c[j];\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tcout << (char)(c[j] + 55);\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout << ' ';\n\t\t\tfor (j = 1; j <= m; j++)\n\t\t\t{\n\t\t\t\tif (c[j] <= 10)\n\t\t\t\t{\n\t\t\t\t\tcout << ch[j];\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tcout << (char)(ch[j] + 55);\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\n\t}\n\tsystem(\""pause\"");\n\treturn 0;\n}\n",WRONG_ANSWER,39,552
1281237326804475904,5f6fe5ec2e9f1448b66bc330cc1ed4d1d67a835fd6cdce39f4a1bed8c73e173d,2020-07-09 22:42:37,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream> \nusing namespace std;\nint main()\n{\n\tint B;\n\tcin >> B;\n\tint i=0;\n\tint l=0;\n\tint ch[400]; int c[400];\n\tint m=0, p=0, j=0, t=0;\n\tint f=0;\n\tint tam=0;\n\tfor (i = 1; i < 301; i++)\n\t{\n\t\tt = 0;\n\t\tf = 1;\n\t\tl = i*i;\n\t\tm = 0;\n\t\twhile (l != 0)\n\t\t{\n\t\t\tp = l % B;\n\t\t\tl = l / B;\n\t\t\tm++;\n\t\t\tch[m] = p;\n\t\t}\n\t\tfor (j = 1; j <= m; j++)\n\t\t{\n\t\t\tif (ch[j] != ch[m + 1 - j])\n\t\t\t{\n\t\t\t\tf = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (f == 1)\n\t\t{\n\t\t\ttam = i;\n\t\t\twhile (tam != 0)\n\t\t\t{\n\t\t\t\tp = tam % B;\n\t\t\t\ttam = tam / B;\n\t\t\t\tt++;\n\t\t\t\tc[t] = p;\n\t\t\t}\n\t\t\tfor (j = t; j >= 1; j--)\n\t\t\t{\n\t\t\t\tif (c[j] <= 10)\n\t\t\t\t{\n\t\t\t\t\tcout << c[j];\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tcout << (char)(c[j] + 55);\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout << ' ';\n\t\t\tfor (j = 1; j <= m; j++)\n\t\t\t{\n\t\t\t\tif (c[j] <= 10)\n\t\t\t\t{\n\t\t\t\t\tcout << ch[j];\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tcout << (char)(ch[j] + 55);\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\n\t}\n\tsystem(\""pause\"");\n\treturn 0;\n}\n",PARTIAL_ACCEPTED,32,628
1281237834123362304,5f6fe5ec2e9f1448b66bc330cc1ed4d1d67a835fd6cdce39f4a1bed8c73e173d,2020-07-09 22:44:38,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream> \nusing namespace std;\nint main()\n{\n\tint B;\n\tcin >> B;\n\tint i=0;\n\tint l=0;\n\tint ch[400] = { 0 }; int c[400] = {0};\n\tint m=0, p=0, j=0, t=0;\n\tint f=0;\n\tint tam=0;\n\tfor (i = 1; i < 301; i++)\n\t{\n\t\tt = 0;\n\t\tf = 1;\n\t\tl = i*i;\n\t\tm = 0;\n\t\twhile (l != 0)\n\t\t{\n\t\t\tp = l % B;\n\t\t\tl = l / B;\n\t\t\tm++;\n\t\t\tch[m] = p;\n\t\t}\n\t\tfor (j = 1; j <= m; j++)\n\t\t{\n\t\t\tif (ch[j] != ch[m + 1 - j])\n\t\t\t{\n\t\t\t\tf = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (f == 1)\n\t\t{\n\t\t\ttam = i;\n\t\t\twhile (tam != 0)\n\t\t\t{\n\t\t\t\tp = tam % B;\n\t\t\t\ttam = tam / B;\n\t\t\t\tt++;\n\t\t\t\tc[t] = p;\n\t\t\t}\n\t\t\tfor (j = t; j >= 1; j--)\n\t\t\t{\n\t\t\t\tif (c[j] <= 10)\n\t\t\t\t{\n\t\t\t\t\tcout << c[j];\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tcout << (char)(c[j] + 55);\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout << ' ';\n\t\t\tfor (j = 1; j <= m; j++)\n\t\t\t{\n\t\t\t\tif (c[j] <= 10)\n\t\t\t\t{\n\t\t\t\t\tcout << ch[j];\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tcout << (char)(ch[j] + 55);\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\n\t}\n\tsystem(\""pause\"");\n\treturn 0;\n}\n",PARTIAL_ACCEPTED,23,620
1281239083224842240,c2c290e91f30dc0454f9ef5b9125b06471e7d4b403c388aa8cf0d9b3efc569e9,2020-07-09 22:49:36,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nint a[250]; \nbool judge(int x,int n)\n{\n    int m{ 0 };\n    x = x * x;\n    while (x)\n    {\n        a[++m] = x % n;\n        x /= n;\n    }\n    int flag{1};\n    for (int i=1;i<=m/2;i++){\n        if (a[i]!=a[m-i+1]){\n            flag=0;\n            break;\n        }\n    }\n    return flag;\n}\nvoid p(int x,int n)\n{\n    int m = 0;\n    while (x)\n    {\n        a[++m] = x % n;\n        x /= n;\n    }\n    for (int i = m; i >= 1; i--)\n    {\n        if (a[i] > 9)\n            cout<<(a[i] - 10 + 'A');\n        else \n            cout<< a[i] ;\n    }\n}\nint main()\n{\n    int B;\n    cin >> B;\n    for (int i = 1; i <= 300; i++)\n    {\n        if (judge(i,B))\n        {\n            p(i,B);\n            cout << \"" \"";\n            p(i * i,B);\n            cout<<\""\\n\"";\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,32,424
1281239136811270144,aaeec063a4f056106b70eb4bf296f0d50be0a172454805c14f24ccdd80ca704b,2020-07-09 22:49:49,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>  \n#include <vector>\n#include <string>  \n#include <algorithm>  \nusing namespace std;\n\nbool Palin_num(const string a) \n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1])\n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1) // 是回文数；\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring intA(int n, int radix)    //进制转换函数，n是待转数字，radix是指定的进制\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\n        {\n            ans += t + '0';\n        }\n        else\n        {\n            ans += t - 10 + 'A';\n        }\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（）以防止输入为0的情况\n    reverse(ans.begin(), ans.end());\n    return ans;\n}\n\nint main()\n{\n    int n, s;\n    cin >> n >> s;\n    s++; //双重回文数要大于s，从s+1开始遍历；\n    vector<int> p; // 容器p，存放双重回文数；\n    int sum; // 记录有几种进制的数是回文数；\n    while ((p.size() < n)) // 根据容器p里双重回文数的个数决定是否终止程序；\n    {\n        sum = 0;\n        for (int i = 2; i <= 10; i++)\n        {\n            if (Palin_num(intA(s, i))) // 此时对应进制的数是回文数；\n            {\n                sum++; // 记录次数+1；\n            }\n        }\n        if (sum >= 2) // 双重回文数，压入容器p中；\n        {\n            p.push_back(s);\n        }\n        s++; // 继续遍历；\n    }\n    for (int i = 0; i < p.size(); i++)\n    {\n        cout << p[i] << endl;\n    }\n    return 0;\n}\n",ACCEPTED,25,508
1281239883891277824,5f6fe5ec2e9f1448b66bc330cc1ed4d1d67a835fd6cdce39f4a1bed8c73e173d,2020-07-09 22:52:47,C++,70.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream> \nusing namespace std;\nint main()\n{\n\tint B;\n\tcin >> B;\n\tint i=0;\n\tint l=0;\n\tint ch[400] = { 0 }; int c[400] = {0};\n\tint m=0, p=0, j=0, t=0;\n\tint f=0;\n\tint tam=0;\n\tfor (i = 1; i < 301; i++)\n\t{\n\t\tt = 0;\n\t\tf = 1;\n\t\tl = i*i;\n\t\tm = 0;\n\t\twhile (l != 0)\n\t\t{\n\t\t\tp = l % B;\n\t\t\tl = l / B;\n\t\t\tm++;\n\t\t\tch[m] = p;\n\t\t}\n\t\tfor (j = 1; j <= m; j++)\n\t\t{\n\t\t\tif (ch[j] != ch[m + 1 - j])\n\t\t\t{\n\t\t\t\tf = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (f == 1)\n\t\t{\n\t\t\ttam = i;\n\t\t\twhile (tam != 0)\n\t\t\t{\n\t\t\t\tp = tam % B;\n\t\t\t\ttam = tam / B;\n\t\t\t\tt++;\n\t\t\t\tc[t] = p;\n\t\t\t}\n\t\t\tfor (j = t; j >= 1; j--)\n\t\t\t{\n\t\t\t\tif (c[j] <= 10)\n\t\t\t\t{\n\t\t\t\t\tcout << c[j];\n\t\t\t\t}\n\t\t\t\tif (c[j] > 10)\n\t\t\t\t{\n\t\t\t\t\tcout << (char)(c[j] + 55);\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout << ' ';\n\t\t\tfor (j = 1; j <= m; j++)\n\t\t\t{\n\t\t\t\tif (ch[j] <= 10)\n\t\t\t\t{\n\t\t\t\t\tcout << ch[j];\n\t\t\t\t}\n\t\t\t\tif (ch[j] > 10)\n\t\t\t\t{\n\t\t\t\t\tcout << (char)(ch[j] + 55);\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\n\t}\n\tsystem(\""pause\"");\n\treturn 0;\n}\n",PARTIAL_ACCEPTED,30,512
1281240047129387008,5f6fe5ec2e9f1448b66bc330cc1ed4d1d67a835fd6cdce39f4a1bed8c73e173d,2020-07-09 22:53:26,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream> \nusing namespace std;\nint main()\n{\n\tint B;\n\tcin >> B;\n\tint i=0;\n\tint l=0;\n\tint ch[400] = { 0 }; int c[400] = {0};\n\tint m=0, p=0, j=0, t=0;\n\tint f=0;\n\tint tam=0;\n\tfor (i = 1; i < 301; i++)\n\t{\n\t\tt = 0;\n\t\tf = 1;\n\t\tl = i*i;\n\t\tm = 0;\n\t\twhile (l != 0)\n\t\t{\n\t\t\tp = l % B;\n\t\t\tl = l / B;\n\t\t\tm++;\n\t\t\tch[m] = p;\n\t\t}\n\t\tfor (j = 1; j <= m; j++)\n\t\t{\n\t\t\tif (ch[j] != ch[m + 1 - j])\n\t\t\t{\n\t\t\t\tf = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (f == 1)\n\t\t{\n\t\t\ttam = i;\n\t\t\twhile (tam != 0)\n\t\t\t{\n\t\t\t\tp = tam % B;\n\t\t\t\ttam = tam / B;\n\t\t\t\tt++;\n\t\t\t\tc[t] = p;\n\t\t\t}\n\t\t\tfor (j = t; j >= 1; j--)\n\t\t\t{\n\t\t\t\tif (c[j] < 10)\n\t\t\t\t{\n\t\t\t\t\tcout << c[j];\n\t\t\t\t}\n\t\t\t\tif (c[j] >= 10)\n\t\t\t\t{\n\t\t\t\t\tcout << (char)(c[j] + 55);\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout << ' ';\n\t\t\tfor (j = 1; j <= m; j++)\n\t\t\t{\n\t\t\t\tif (ch[j] < 10)\n\t\t\t\t{\n\t\t\t\t\tcout << ch[j];\n\t\t\t\t}\n\t\t\t\tif (ch[j] >= 10)\n\t\t\t\t{\n\t\t\t\t\tcout << (char)(ch[j] + 55);\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\n\t}\n\tsystem(\""pause\"");\n\treturn 0;\n}\n",ACCEPTED,30,584
1281240544049553408,c2c290e91f30dc0454f9ef5b9125b06471e7d4b403c388aa8cf0d9b3efc569e9,2020-07-09 22:55:24,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nint a[250]; \nbool judge(int x,int n)\n{\n    int m{ 0 };\n    x = x * x;\n    while (x)\n    {\n        a[++m] = x % n;\n        x /= n;\n    }\n    int flag{1};\n    for (int i=1;i<=m/2;i++){\n        if (a[i]!=a[m-i+1]){\n            flag=0;\n            break;\n        }\n    }\n    return flag;\n}\nvoid p(int x,int n)\n{\n    int m = 0;\n    while (x)\n    {\n        a[++m] = x % n;\n        x /= n;\n    }\n    for (int i = m; i >= 1; i--)\n    {\n        if (a[i] > 9)\n            cout<<(a[i] + 55 );\n        else \n            cout<< a[i] ;\n    }\n}\nint main()\n{\n    int B;\n    cin >> B;\n    for (int i = 1; i <= 300; i++)\n    {\n        if (judge(i,B))\n        {\n            p(i,B);\n            cout << \"" \"";\n            p(i * i,B);\n            cout<<\""\\n\"";\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,38,512
1281248801082245120,3159515a27ca9223d51d6cb25698be9b88825888b7478ffc014db88adb36264c,2020-07-09 23:28:13,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<cstdio>\n#include<iostream>\n#include<cstring>\nusing namespace std;\nint s[100],t=0;\nbool change(int a,int j)  \n{\n\tmemset(s,0,sizeof(s));t=0;\n\twhile(a!=0)\n\t{\n\t\ts[++t]=a%j;\n\t\ta/=j;\t \n\t} \n\tint m=1,n=t;\n\twhile(m<n) \n\t{\n\t\tif(s[m]!=s[n]) \n        {\n            return false;\n\t\t    m++;n--;\n        }\n\t}\n\treturn true;\n}\nint main()\n{\n\tint r,s,ans=0,cnt=0;\n\tcin>>r>>s;\n\tfor(int i=s+1;ans!=r;i++)\n\t{\n\t\tcnt=0;\n\t\tfor(int j=2;j<=10&&cnt<2;j++) \n        {\n            if(change(i,j)==true)\n                cnt++;\n        }\n\t\tif(cnt>=2) \n            ans++;\n        cout<<i<<endl;\n        \n\t} \n\treturn 0;\n}\n",TIME_LIMIT_EXCEEDED,0,0
1281248867960414208,3159515a27ca9223d51d6cb25698be9b88825888b7478ffc014db88adb36264c,2020-07-09 23:28:29,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<cstdio>\n#include<iostream>\n#include<cstring>\nusing namespace std;\nint s[100],t=0;\nbool change(int a,int j)  \n{\n\tmemset(s,0,sizeof(s));t=0;\n\twhile(a!=0)\n\t{\n\t\ts[++t]=a%j;\n\t\ta/=j;\t \n\t} \n\tint m=1,n=t;\n\twhile(m<n) \n\t{\n\t\tif(s[m]!=s[n]) \n            return false;\n\t\t    m++;n--;\n\t}\n\treturn true;\n}\nint main()\n{\n\tint r,s,ans=0,cnt=0;\n\tcin>>r>>s;\n\tfor(int i=s+1;ans!=r;i++)\n\t{\n\t\tcnt=0;\n\t\tfor(int j=2;j<=10&&cnt<2;j++) \n        {\n            if(change(i,j)==true)\n                cnt++;\n        }\n\t\tif(cnt>=2) \n            ans++;\n        cout<<i<<endl;\n        \n\t} \n\treturn 0;\n}\n",PARTIAL_ACCEPTED,40,424
1281248970670530560,3159515a27ca9223d51d6cb25698be9b88825888b7478ffc014db88adb36264c,2020-07-09 23:28:53,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<cstdio>\n#include<iostream>\n#include<cstring>\nusing namespace std;\nint s[100],t=0;\nbool change(int a,int j)  \n{\n\tmemset(s,0,sizeof(s));t=0;\n\twhile(a!=0)\n\t{\n\t\ts[++t]=a%j;\n\t\ta/=j;\t \n\t} \n\tint m=1,n=t;\n\twhile(m<n) \n\t{\n\t\tif(s[m]!=s[n]) \n            return false;\n\t\t    m++;n--;\n\t}\n\treturn true;\n}\nint main()\n{\n\tint r,s,ans=0,cnt=0;\n\tcin>>r>>s;\n\tfor(int i=s+1;ans!=r;i++)\n\t{\n\t\tcnt=0;\n\t\tfor(int j=2;j<=10&&cnt<2;j++) \n        {\n            if(change(i,j)==true)\n                cnt++;\n        }\n\t\tif(cnt>=2) \n            ans=ans+1;\n        cout<<i<<endl; \n\t} \n\treturn 0;\n}\n",PARTIAL_ACCEPTED,51,384
1281251744460234752,e6773be2c586975830bc5405ec5976ca12c8b13a919f8236816aa623a7585243,2020-07-09 23:39:55,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\n\nint remain[100],digit;  \nint word[26] = {'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};\n\nbool way(int n,int k);\n\nint main(){\n    int n;\n    scanf(\""%d\"",&n);\n\n    for(int i=1;i<=300;i++){ \n        int j = i * i;\n        digit = 0; \n\n    if(way(j,n)==1){\n        digit = 0;\n        way(i,n);\n        for(int a = digit;a>=1;a--){        \n            if(remain[a]<10)\n                printf(\""%d\"",remain[a]);\n            else \n                printf(\""%c\"",word[remain[a]-10]);\n        }\n\n        printf(\"" \"");\n        digit = 0;\n        way(j,n);\n\n        for(int b=1;b<=digit;b++){        \n            if(remain[b]<10)\n                printf(\""%d\"",remain[b]);\n            else \n                printf(\""%c\"",word[remain[b]-10]);\n        }\n        printf(\""\\n\"");\n    }    \n}\n    return 0;\n}\n\nbool way(int n,int c){ \n    int f = 1;\n    while(n!=0){\n        remain[++digit] = n % c;\n        n /= c;\n    }\n    for(int d=1;d<=digit/2+1;d++)\n        if(remain[d] != remain[digit-d+1]){\n            f = 0;\n            break;\n}\n    return \n}",COMPILE_ERROR,0,0
1281251774047895552,e6773be2c586975830bc5405ec5976ca12c8b13a919f8236816aa623a7585243,2020-07-09 23:40:02,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\n\nint remain[100],digit;  \nint word[26] = {'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};\n\nbool way(int n,int k);\n\nint main(){\n    int n;\n    scanf(\""%d\"",&n);\n\n    for(int i=1;i<=300;i++){ \n        int j = i * i;\n        digit = 0; \n\n    if(way(j,n)==1){\n        digit = 0;\n        way(i,n);\n        for(int a = digit;a>=1;a--){        \n            if(remain[a]<10)\n                printf(\""%d\"",remain[a]);\n            else \n                printf(\""%c\"",word[remain[a]-10]);\n        }\n\n        printf(\"" \"");\n        digit = 0;\n        way(j,n);\n\n        for(int b=1;b<=digit;b++){        \n            if(remain[b]<10)\n                printf(\""%d\"",remain[b]);\n            else \n                printf(\""%c\"",word[remain[b]-10]);\n        }\n        printf(\""\\n\"");\n    }    \n}\n    return 0;\n}\n\nbool way(int n,int c){ \n    int f = 1;\n    while(n!=0){\n        remain[++digit] = n % c;\n        n /= c;\n    }\n    for(int d=1;d<=digit/2+1;d++)\n        if(remain[d] != remain[digit-d+1]){\n            f = 0;\n            break;\n}\n    return f\n}",COMPILE_ERROR,0,0
1281251808725368832,e6773be2c586975830bc5405ec5976ca12c8b13a919f8236816aa623a7585243,2020-07-09 23:40:10,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\n\nint remain[100],digit;  \nint word[26] = {'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};\n\nbool way(int n,int k);\n\nint main(){\n    int n;\n    scanf(\""%d\"",&n);\n\n    for(int i=1;i<=300;i++){ \n        int j = i * i;\n        digit = 0; \n\n    if(way(j,n)==1){\n        digit = 0;\n        way(i,n);\n        for(int a = digit;a>=1;a--){        \n            if(remain[a]<10)\n                printf(\""%d\"",remain[a]);\n            else \n                printf(\""%c\"",word[remain[a]-10]);\n        }\n\n        printf(\"" \"");\n        digit = 0;\n        way(j,n);\n\n        for(int b=1;b<=digit;b++){        \n            if(remain[b]<10)\n                printf(\""%d\"",remain[b]);\n            else \n                printf(\""%c\"",word[remain[b]-10]);\n        }\n        printf(\""\\n\"");\n    }    \n}\n    return 0;\n}\n\nbool way(int n,int c){ \n    int f = 1;\n    while(n!=0){\n        remain[++digit] = n % c;\n        n /= c;\n    }\n    for(int d=1;d<=digit/2+1;d++)\n        if(remain[d] != remain[digit-d+1]){\n            f = 0;\n            break;\n}\n    return f;\n}",ACCEPTED,24,416
1281255231466176512,878c8587ac0b6bd98d55ca23fe9a3782d7aa4388941e95affea626586b735929,2020-07-09 23:53:46,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint w,a[20];\nint turn(int n)\n{\n    memset(a,0,sizeof(a)); \n    int i=0,j;\n    while(n>0)\n    {\n        a[++i]=n%w;\n        n/=w;\n    }\n    return i;    \n}\nbool judge(int x)\n{\n    int i=1,j=x;\n    while(i<j)\n    {\n        if(a[i++]!=a[j--]) return false;\n    }\n    return true;\n}\nvoid print(int n)\n{\n    int b[20],i=0,j;\n    while(n>0)\n    {\n        b[++i]=n%w;\n        n/=w;\n    }\n    for(j=i;j>=1;j--)\n    {\n        if(b[j]>=10) printf(\""%c\"",'A'+b[j]-10);\n        else printf(\""%d\"",b[j]);\n    }\n    printf(\"" \"");\n}\nvoid search()\n{\n    int i,j;\n    for(i=1;i<=300;i++)\n    {\n        int x=turn(pow(i,2));\n        if(judge(x))\n        {\n            print(i);\n            for(j=x;j>=1;j--)\n            {\n                if(a[j]>=10) printf(\""%c\"",'A'+a[j]-10);\n                else printf(\""%d\"",a[j]);\n            }\n            printf(\""\\n\"");\n        }\n    }    \n}\nint main()\n{\n    int i,j;\n    scanf(\""%d\"",&w);\n    search();\n    return 0;\n}",ACCEPTED,23,488
1281255797185511424,878c8587ac0b6bd98d55ca23fe9a3782d7aa4388941e95affea626586b735929,2020-07-09 23:56:01,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n\nbool a(int x ,int y){\n    short k[100]={0},p=0;\n    while(x){\n        k[p++]=x%y;\n        x/=y;\n    }\n    int i=0,j=p-1;\n    while(i<j)\n        if(k[i++]!=k[j--])return 0; \n    return 1;\n}\n\nint main(){\n    int i,j;\n    int n,m;\n    cin>>n>>m;\n    int ans=0;\n    for(i=m+1;ans!=n;i++){\n        int cnt=0;\n        for(j=2;j<=10&&cnt<2;j++){\n            if(a(i,j))cnt++;\n        }\n        if(cnt>=2)printf(\""%d\\n\"",i),ans++; \n    }\n    return 0;\n}",ACCEPTED,48,512
1281255928253308928,cbd0eeb65979ea4ba5e492918c0e5c7a5968d474d0c2b5574e0c8c95dd36408b,2020-07-09 23:56:32,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<cstdio>\n#include<cstring>\n#include<algorithm>\nusing namespace std;\n\nint b;\ninline char c(int x){\n    if(x>=0&&x<=9)\n        return x+'0';\n    return x-10+'A';\n                    }\nstruct fish{\n    int l,a[20];\n    fish(int x){\n        for(l=0;x;l++)\n            a[l]=x%b,x/=b;\n    }\n    void out(){\n        for(int i=l-1;i>=0;i--)\n            printf(\""%c\"",c(a[i]));\n    }\n    bool cat(){\n        for(int i=0;i<l;i++)\n            if(a[i]!=a[l-i-1])\n                return false;\n        return true;\n    }\n};\n\nint main(){\n    scanf(\""%d\"",&b);\n    for(int i=1;i<=300;i++){\n        fish n(i*i);\n        if(n.cat()){\n            fish m(i);\n            m.out();\n            putchar(' ');\n            n.out();\n            putchar('\\n');\n        }\n    }\n    return 0;\n}\n",ACCEPTED,17,288
1281257055199879168,cfd5be2c8733c9d1825c7e0c0a09c48959d3073163b96b995cf8ef5a9ffb6d82,2020-07-10 00:01:01,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint main()\n{\n    int B, t, n, a[40];\n    int f, i;\n    cin >> B;\n\n\n    for (int i = 1; i <= 300; i++)\n    {\n        t = i * i;\n        n = 0;\n        while (t != 0)\n\n        {\n            n++;\n            a[n] = t % B;\n            t /= B;\n\n        }\n        f = 1;\n        for (int j = 1; j < n / 2; j++)\n        {\n            if (a[j] != a[n - j + 1])\n                f = 0;\n        }\n        \n        \n        if (f == 1)\n        {\n            n = 0;\n            t = i;\n            while (t != 0)\n            {\n                n++;\n                a[n] = t % B;\n                t /= B;\n            }\n            for (int j = n; j > 0; j--)\n            {\n                if (a[j] < 10)\n                    cout << a[j];\n                else\n                    printf(\""%c\"", a[j] + 55);\n                cout << \"" \"";\n            }\n            t = i * i;\n            n = 0;\n          while(t != 0);\n          {\n              n++;\n              a[n] = t%B;\n              t /= B;\n\n\n              for (int j = 1; j <= n; j++)\n              {\n                  if (a[j] < 10)\n                      cout << a[j];\n                  else\n                  {\n                      printf(\""%c\"", a[j] + 55);\n                      cout << endl;\n                  }\n                 \n              }\n\n\n          }\n        }\n   \n        \n\n\n    }\n\n}\n    \n    ",TIME_LIMIT_EXCEEDED,0,0
1281257957042356224,cfd5be2c8733c9d1825c7e0c0a09c48959d3073163b96b995cf8ef5a9ffb6d82,2020-07-10 00:04:36,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint main()\n{\n    int B, t, n, a[40];\n    int f, i;\n    cin >> B;\n\n\n    for (int i = 1; i <= 300; i++)\n    {\n        t = i * i;\n        n = 0;\n        while (t != 0)\n\n        {\n            n++;\n            a[n] = t % B;\n            t /= B;\n\n        }\n        f = 1;\n        for (int j = 1; j < n / 2; j++)\n        {\n            if (a[j] != a[n - j + 1])\n                f = 0;\n        }\n        \n        \n        if (f == 1)\n        {\n            n = 0;\n            t = i;\n            while (t != 0)\n            {\n                n++;\n                a[n] = t % B;\n                t /= B;\n            }\n            for (int j = n; j > 0; j--)\n            {\n                if (a[j] < B)\n                    cout << a[j];\n                else\n                    printf(\""%c\"", a[j] + 55);\n                cout << \"" \"";\n            }\n            t = i * i;\n            n = 0;\n          while(t != 0);\n          {\n              n++;\n              a[n] = t%B;\n              t /= B;\n\n\n              for (int j = 1; j <= n; j++)\n              {\n                  if (a[j] < B)\n                      cout << a[j];\n                  else\n                  {\n                      printf(\""%c\"", a[j] + 55);\n                      cout << endl;\n                  }\n                 \n              }\n\n\n          }\n        }\n   \n        \n\n\n    }\n\n}\n    \n    ",TIME_LIMIT_EXCEEDED,0,0
1281258279739514880,67e8ef6aa12e75b377f9dd7c14b5a655db21d7cdf94949f1dd842a92ce306d8e,2020-07-10 00:05:53,C,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\nchar c[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nint n;\nint fun(int m){\n    m*=m;\n    char a[1000];\n    int i=1;\n    while(m)\n    {\n        a[i]=c[m%n];\n        m/=n;\n        i++;\n    }\n    i--;\n    int g=1;\n    for(int j=1;j<=i/2;j++)\n    {\n        if(a[j]!=a[i-j+1])\n        {\n            g=0;\n            break;\n        }\n    }\n    return g;\n}\nvoid print(int m){\n    int p=m;\n    char a[1000];\n    int i=1;\n    while(m)\n    {\n        a[i]=c[m%n];\n        m/=n;\n        i++;\n    }\n    i--;\n    for(i;i>=1;i--)\n        printf(\""%c\"",a[i]);\n    printf(\"" \"");\n    m=p*p;\n    i=1;\n    while(m)\n    {\n        a[i]=c[m%n];\n        m/=n;\n        i++;\n    }\n    i--;\n    for(i;i>=1;i--)\n        printf(\""%c\"",a[i]);\n    printf(\""\\n\"");}\nint main(){\n    while(~scanf(\""%d\"",&n))\n    {\n        for(int i=1;i<=300;i++)\n        {\n            if(fun(i)==1)\n                print(i);\n        }\n    }\n    return 0;\n}\n",ACCEPTED,16,384
1281258317546979328,20b9ff3906974a5b098a73c23d9006ea512407553376898e5048d9648e7c90b9,2020-07-10 00:06:02,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n#include<string.h>\n#include<iostream>\nchar a[400];\n\nvoid p()\n{\n    int l=(int)strlen(a);\n    int p1=0,p2=l-1;\n    int t;\n    while(p1<p2)\n    {\n        t=a[p1];\n        a[p1++]=a[p2];\n        a[p2--]=t;\n    }\n}\n\nvoid q(int x,int b)\n{\n    int i=0,n;\n    memset(a,0,400*sizeof(char));\n    n=x;\n    while(n!=0)\n    {\n        if(n%b<10) a[i]=n%b+48;\n        else a[i]=n%b+55;\n        n/=b;\n        i++;\n    }\n    a[i]='\\0';\n}\n\nint main()\n{\n    int b,i=1,l,p1,p2,r;\n    char t[400];\n    scanf(\""%d\"",&b);\n    for(i=1;i<=300;i++)\n    {\n        r=1;\n        q(i*i,b);\n        strcpy(t,a);\n        l=(int)strlen(t);\n        p1=0;\n        p2=l-1;\n        while(p1<p2)\n        {\n            if(t[p1]!=t[p2]) {r=0;break;}\n            p1++;\n            p2--;\n        }\n        if(r)\n        {\n           q(i,b);\n            p();\n            printf(\""%s %s\\n\"",a,t);\n        }\n    }\n    return 0;\n}\nint main1()\n{\n    int sum = 0;\n    for(int i=1;i<=100;i++)\n    {\n        sum = sum + i;\n    }\n    printf(\""%d\\n\"",sum);\n    return 0;\n}\n",ACCEPTED,33,384
1281258323399065600,223ecd78dce359b3c421f687a7e978f620c8efe2b800226f233939eec58163a2,2020-07-10 00:06:03,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<fstream>\nusing namespace std;\nifstream cin(\""palsquare.in\"");\nofstream cout(\""palsquare.out\"");\nint B;\nvoid ini_t(int x)\n{\n   int a[20];\n   int b[20];\n   int x1=x*x;\n   int l=0;\n   while(x1!=0)\n   {\n      a[++l]=x1%B;\n      x1/=B;            \n   }\n   for(int i=1;i<=l/2;i++)\n   {\n       if(a[i]!=a[l+1-i]) return;\n   }\n   x1=x;\n   int l1=0;\n   while(x1!=0)\n   {\n      b[++l1]=x1%B;\n      x1/=B;            \n   }\n   for(int i=l1;i>=1;i--)\n   {\n      if(b[i]>=10) cout<<char(b[i]+55);     \n      else cout<<b[i];  \n             \n   } \n   cout<<\"" \"";\n   for(int i=l;i>=1;i--)\n   {\n      if(a[i]>=10) cout<<char(a[i]+55);     \n      else cout<<a[i];       \n   }\n   cout<<endl;\n   return;\n}\nint main()\n{\n   cin>>B;\n   for(int i=1;i<=300;i++)\n   {\n       ini_t(i);        \n   }\n  // system(\""pause\"");\n   return 0;    \n} ",FLOAT_POINT_EXCEPTION,22,424
1281258334421696512,223ecd78dce359b3c421f687a7e978f620c8efe2b800226f233939eec58163a2,2020-07-10 00:06:06,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<fstream>\nusing namespace std;\nifstream cin(\""palsquare.in\"");\nofstream cout(\""palsquare.out\"");\nint B;\nvoid ini_t(int x)\n{\n   int a[20];\n   int b[20];\n   int x1=x*x;\n   int l=0;\n   while(x1!=0)\n   {\n      a[++l]=x1%B;\n      x1/=B;            \n   }\n   for(int i=1;i<=l/2;i++)\n   {\n       if(a[i]!=a[l+1-i]) return;\n   }\n   x1=x;\n   int l1=0;\n   while(x1!=0)\n   {\n      b[++l1]=x1%B;\n      x1/=B;            \n   }\n   for(int i=l1;i>=1;i--)\n   {\n      if(b[i]>=10) cout<<char(b[i]+55);     \n      else cout<<b[i];  \n             \n   } \n   cout<<\"" \"";\n   for(int i=l;i>=1;i--)\n   {\n      if(a[i]>=10) cout<<char(a[i]+55);     \n      else cout<<a[i];       \n   }\n   cout<<endl;\n   return;\n}\nint main()\n{\n   cin>>B;\n   for(int i=1;i<=300;i++)\n   {\n       ini_t(i);        \n   }\n  // system(\""pause\"");\n   return 0;    \n} ",FLOAT_POINT_EXCEPTION,23,592
1281258676986241024,223ecd78dce359b3c421f687a7e978f620c8efe2b800226f233939eec58163a2,2020-07-10 00:07:27,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<cmath>\n#include<queue>\n#include<cstdio>\n#include<cctype>\n#include<vector>\n#include<cstring>\n#include<iostream>\n#include<algorithm>\nusing namespace std;\nint B;\nint a[20];//只需要考虑二进制的感受 ，开大一点无所谓 \nbool calc(int x)//不存在0我就懒得考虑了 \n{\n    int np=0;\n    x=x*x;\n    while(x)\n    {\n        a[++np]=x%B;\n        x/=B;\n    }\n    for(int i=1,j=np;i<j;i++,j--)\n        if(a[i]!=a[j])\n            return 0;\n    return 1;\n}\nvoid outs(int x)\n{\n    int np=0;\n    while(x)\n    {\n        a[++np]=x%B;\n        x/=B;\n    }\n    for(int i=np;i>=1;i--)\n    {\n        if(a[i]>9)\n            printf(\""%c\"",a[i]-10+'A');\n        else printf(\""%d\"",a[i]);\n    }\n}\nint main()\n{\n    //freopen(\""in.txt\"",\""r\"",stdin);\n    scanf(\""%d\"",&B);\n    for(int i=1;i<=300;i++)\n    {\n        if(calc(i))\n        {\n            outs(i);\n            printf(\"" \"");\n            outs(i*i);\n            printf(\""\\n\"");\n        }\n    }\n    return 0;\n}",ACCEPTED,32,424
1281258988602064896,223ecd78dce359b3c421f687a7e978f620c8efe2b800226f233939eec58163a2,2020-07-10 00:08:42,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"/*\nID: yjy_aii1\nTASK: dualpal\nLANG: C++\n*/\n#include <cstdio>\n\nusing namespace std;\n\nint n,s;\nint a[50];\n\nint main(){\n\tfreopen(\""dualpal.in\"",\""r\"",stdin);\n\tfreopen(\""dualpal.out\"",\""w\"",stdout);\n\tscanf(\""%d%d\"",&n,&s);\n\twhile (n){\n\t\ts++;\n\t\tint f=0;\n\t\tfor (int i=2;i<=10;i++){\n\t\t\tint c=s,l=0,b=0;\n\t\t\twhile (c){\n\t\t\t\ta[++l]=c%i;\n\t\t\t\tc/=i;\n\t\t\t}\n\t\t\tfor (int j=1;j<=l/2;j++)\n\t\t\t\tif (a[j]!=a[l-j+1]){\n\t\t\t\t\tb=1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\tif (!b) f++;\n\t\t\tif (f==2) break;\n\t\t}\n\t\tif (f==2){\n\t\t\tprintf(\""%d\\n\"",s);\n\t\t\tn--;\n\t\t}\n\t}\n\tfclose(stdin);\n\tfclose(stdout);\n}\n",WRONG_ANSWER,27,384
1281259291393064960,223ecd78dce359b3c421f687a7e978f620c8efe2b800226f233939eec58163a2,2020-07-10 00:09:54,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<cmath>\n#include<queue>\n#include<cstdio>\n#include<cctype>\n#include<vector>\n#include<cstring>\n#include<iostream>\n#include<algorithm>\nusing namespace std;\nint n,s;\nvector<int>a;\nbool jud(int x,int i)//判断x的i进制是不是回文数\n{\n    a.clear();\n    do\n    {\n        a.push_back(x%i);\n        x/=i;\n    }while(x);\n    for(int i=0,j=a.size()-1;i<j;i++,j--)\n        if(a[i]!=a[j])\n            return 0;\n    return 1;\n}\nbool calc(int x)//判断x是不是双重回文数\n{\n    int cnt=0;\n    for(int i=2;i<=10;i++)\n    {\n        if(jud(x,i))\n        {\n            cnt++;\n            if(cnt>=2)\n                return 1;\n        }\n    }\n    return 0;\n}\nint main()\n{\n    scanf(\""%d%d\"",&n,&s);\n    for(int i=s+1;n;i++)\n    {\n        if(calc(i))\n        {\n            cout<<i<<endl;\n            n--;\n        }\n    }\n    return 0;\n}",ACCEPTED,30,424
1281259354731249664,c2c290e91f30dc0454f9ef5b9125b06471e7d4b403c388aa8cf0d9b3efc569e9,2020-07-10 00:10:09,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nint a[250]; \nbool judge(int x,int n)\n{\n    int m{ 0 };\n    x = x * x;\n    while (x)\n    {\n        a[++m] = x % n;\n        x /= n;\n    }\n    int flag{1};\n    for (int i=1;i<=m/2;i++){\n        if (a[i]!=a[m-i+1]){\n            flag=0;\n            break;\n        }\n    }\n    return flag;\n}\nvoid p(int x,int n)\n{\n    int m = 0;\n    while (x)\n    {\n        a[++m] = x % n;\n        x /= n;\n    }\n    for (int i = m; i >= 1; i--)\n    {\n        if (a[i] > 9)\n            cout<<(a[i] + 55 );\n        else \n            cout<< a[i] ;\n    }\n}\nint main()\n{\n    int B;\n    cin >> B;\n    for (int i = 1; i <= 300; i++)\n    {\n        if (judge(i,B))\n        {\n            p(i,B);\n            cout << \"" \"";\n            p(i * i,B);\n            cout<<\""\\n\"";\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,38,484
1281259543572430848,67e8ef6aa12e75b377f9dd7c14b5a655db21d7cdf94949f1dd842a92ce306d8e,2020-07-10 00:10:54,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<queue>\n#include<cmath>\n#include<cctype>\n#include<cstdio>\n#include<vector>\n#include<algorithm>\n#include<cstring>\nusing namespace std;\nint n,s;\nvector<int>b;\nbool jud(int t,int i)\n{\n    b.clear();\n    do\n    {\n        b.push_back(t%i);\n        t/=i;\n    }while(t);\n    for(int i=0,j=b.size()-1;i<j;i++,j--)\n        if(b[i]!=b[j])\n            return 0;\n    return 1;\n}\nbool calc(int t)//判断x是不是双重回文数\n{\n    int cnt=0;\n    for(int i=2;i<=10;i++)\n    {\n        if(jud(t,i))\n        {\n            cnt++;\n            if(cnt>=2)\n                return 1;\n        }\n    }\n    return 0;\n}\nint main()\n{\n    scanf(\""%d%d\"",&n,&s);\n    for(int i=s+1;n;i++)\n    {\n        if(calc(i))\n        {\n            cout<<i<<endl;\n            n--;\n        }\n   }\n    return 0;\n}",COMPILE_ERROR,0,0
1281259606096920576,67e8ef6aa12e75b377f9dd7c14b5a655db21d7cdf94949f1dd842a92ce306d8e,2020-07-10 00:11:09,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<queue>\n#include<cmath>\n#include<cctype>\n#include<cstdio>\n#include<vector>\n#include<algorithm>\n#include<cstring>\nusing namespace std;\nint n,s;\nvector<int>b;\nbool jud(int t,int i)\n{\n    b.clear();\n    do\n    {\n        b.push_back(t%i);\n        t/=i;\n    }while(t);\n    for(int i=0,j=b.size()-1;i<j;i++,j--)\n        if(b[i]!=b[j])\n            return 0;\n    return 1;\n}\nbool calc(int t)//判断x是不是双重回文数\n{\n    int cnt=0;\n    for(int i=2;i<=10;i++)\n    {\n        if(jud(t,i))\n        {\n            cnt++;\n            if(cnt>=2)\n                return 1;\n        }\n    }\n    return 0;\n}\nint main()\n{\n    scanf(\""%d%d\"",&n,&s);\n    for(int i=s+1;n;i++)\n    {\n        if(calc(i))\n        {\n            cout<<i<<endl;\n            n--;\n        }\n   }\n    return 0;\n}",ACCEPTED,31,512
1281260219139555328,20b9ff3906974a5b098a73c23d9006ea512407553376898e5048d9648e7c90b9,2020-07-10 00:13:35,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <cstdlib>\n#include <stdio.h>\n#include<string.h>\n#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <cstring>\nconst int a=100000;\nusing namespace std;\nint ti[a],tl[a];\nint q[a];\n\nvoid x(int *shu,int n,int m);\nbool y(int *shu);\nint main()\n{\n    int n,i,s,v=0;\n\n    freopen(\""dualpal.in\"",\""r\"",stdin);\n    freopen(\""dualpal.out\"",\""w\"",stdout);\n    scanf(\""%d%d\"",&n,&s);\n\n    for (i=s+1;;i++)\n    {\n        if (v==n) break;\n        int lj=0;\n        for (int j=2;j<=10;j++)\n        {\n            x(ti,i,j);\n            if (y(ti)) lj++;\n        }\n        if (lj>=2) {printf(\""%d\\n\"",i);v++;}\n    }\n    return 0;\n}\nvoid change(int *shu,int num,int system)\n{\n     int z=0;\n     memset(shu,0,sizeof(shu));\n     memset(q,0,sizeof(q));\n     z++;\n     while (num!=0)\n     {\n           int t;\n           t=num%system;\n           num=num/system;\n           q[z++]=t;\n     }\n     z--;\n     for (int i=z;i>=1;i--) shu[z-i+1]=q[i];\n     shu[0]=z;\n     return;\n}\nbool check(int *shu)\n{\n     int point=shu[0],i;\n     for (i=1;i<=(point/2)+1;i++)\n     if (shu[i]!=shu[point-i+1]) return 0;\n     return 1;\n}\nint main1()\n{\n    int sum = 0;\n    for(int i=1;i<=100;i++)\n    {\n        sum = sum + i;\n    }\n    printf(\""%d\\n\"",sum);\n    return 0;\n}",COMPILE_ERROR,0,0
1281261887176507392,20b9ff3906974a5b098a73c23d9006ea512407553376898e5048d9648e7c90b9,2020-07-10 00:20:13,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <cstdlib>\n#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <cstring>\n#include <stdio.h>\n#include<string.h>\nconst int l=100000;\nusing namespace std;\nint shu_1[l],shu_2[l];\nint p[l];\nvoid change(int *shu,int num,int system);\nbool check(int *shu);\nint main()\n{\n    int n,i,s,v=0;\n\n    freopen(\""dualpal.in\"",\""r\"",stdin);\n    freopen(\""dualpal.out\"",\""w\"",stdout);\n    scanf(\""%d%d\"",&n,&s);\n\n    for (i=s+1;;i++)\n    {\n        if (v==n) break;\n        int lj=0;\n        for (int j=2;j<=10;j++)\n        {\n            change(shu_1,i,j);\n            if (check(shu_1)) lj++;\n        }\n        if (lj>=2) {printf(\""%d\\n\"",i);v++;}\n    }\n    return 0;\n}\nvoid change(int *shu,int num,int system)\n{\n     int point=0;\n     memset(shu,0,sizeof(shu));\n     memset(p,0,sizeof(p));\n     point++;\n     while (num!=0)\n     {\n           int t;\n           t=num%system;\n           num=num/system;\n           p[point++]=t;\n     }\n     point--;\n     for (int i=point;i>=1;i--) shu[point-i+1]=p[i];\n     shu[0]=point;\n     return;\n}\nbool check(int *shu)\n{\n     int point=shu[0],i;\n     for (i=1;i<=(point/2)+1;i++)\n     if (shu[i]!=shu[point-i+1]) return 0;\n     return 1;\n}\nint main1()\n{\n    int sum = 0;\n    for(int i=1;i<=100;i++)\n    {\n        sum = sum + i;\n    }\n    printf(\""%d\\n\"",sum);\n    return 0;\n}",WRONG_ANSWER,31,512
1281262890685743104,2b459d8523bd56b3eea253cb0aa60960cf250af00cd3fc924e9e1019943a0492,2020-07-10 00:24:12,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<stdlib.h>\n\n\nusing namespace std;\n\nint judge(int i);\nint myprint(int i);\nint n;\n//int flag=0;\nint lena=0;\nint lenb=0;\nint a[100000]={0};\nint b[1000]={0};\nchar chr[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nint main(){\n\tcin>>n;\n\tfor(int i=1;i<=300;i++)\n\t{\n\t\tif(judge(i*i))\n\t\t{\n\t\t\tmyprint(i);\n\t\t}\n\t}\n\treturn 0;\n}\nint judge(int i){\n\tlena=0;\n\twhile(i/n)\n\t{\n\t\ta[lena++]=i%n;\n\t\ti/=n;\n\t}\n\ta[lena]=i%n;\n\tfor(int j=0;j<=lena;j++)\n\t\tif(a[j]!=a[lena-j])\n\t\t\treturn 0;\n\t\treturn 1;\n}\nint myprint(int i){\n\t\n\tlenb=0;\n\twhile(i/n)\n\t{\n\t\tb[lenb++]=i%n;\n\t\ti/=n;\n\t}\n\tb[lenb]=i%n;\n\tfor(int u=lenb;u>=0;u--)\n\t\tcout<<chr[b[u]];\n\tcout<<\"" \"";\n\tfor(int u=0;u<=lena;u++)\n\t\tcout<<chr[a[u]];\n\tcout<<endl;\n\treturn 0;\n}",ACCEPTED,32,384
1281262928426090496,c2c290e91f30dc0454f9ef5b9125b06471e7d4b403c388aa8cf0d9b3efc569e9,2020-07-10 00:24:21,C++,50.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nint a[250]; \nbool judge(int x,int n)\n{\n    int m{ 0 };\n    x = x * x;\n    while (x)\n    {\n        a[++m] = x % n;\n        x /= n;\n    }\n    int flag{1};\n    for (int i=1;i<=m/2;i++){\n        if (a[i]!=a[m-i+1]){\n            flag=0;\n            break;\n        }\n    }\n    return flag;\n}\nvoid p(int x,int n)\n{\n    int m = 0;\n    while (x)\n    {\n        a[++m] = x % n;\n        x /= n;\n    }\n    for (int i = m; i >= 1; i--)\n    {\n        if (a[i] > 9)\n            cout<<(a[i] + 55 );\n        else \n            cout<< a[i] ;\n    }\n}\nint main()\n{\n    int B;\n    cin >> B;\n    for (int i = 1; i <= 300; i++)\n    {\n        if (judge(i,B))\n        {\n            p(i,B);\n            cout << \"" \"";\n            p(i * i,B);\n            cout<<\""\\n\"";\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,26,512
1281263063653605376,20b9ff3906974a5b098a73c23d9006ea512407553376898e5048d9648e7c90b9,2020-07-10 00:24:53,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<cmath>\n#include<queue>\n#include<cstdio>\n#include<cctype>\n#include<vector>\n#include<cstring>\n#include<iostream>\n#include<algorithm>\n#include <stdio.h>\n#include<iostream>\n#include<string.h>\nusing namespace std;\nint q,p;\nvector<int>a;\nbool jud(int x,int i)\n{\n    a.clear();\n    do\n    {\n        a.push_back(x%i);\n        x/=i;\n    }while(x);\n    for(int i=0,j=a.size()-1;i<j;i++,j--)\n        if(a[i]!=a[j])\n            return 0;\n    return 1;\n}\nbool calc(int x)\n{\n    int cnt=0;\n    for(int i=2;i<=10;i++)\n    {\n        if(jud(x,i))\n        {\n            cnt++;\n            if(cnt>=2)\n                return 1;\n        }\n    }\n    return 0;\n}\nint main()\n{\n\n    scanf(\""%d%d\"",&q,&p);\n    for(int i=p+1;q;i++)\n    {\n        if(calc(i))\n        {\n         cout<<i<<endl;\n         q--;\n        }\n    }\n    return 0;\n}\nint main1()\n{\n    int sum = 0;\n    for(int i=1;i<=100;i++)\n    {\n        sum = sum + i;\n    }\n    printf(\""%d\\n\"",sum);\n    return 0;\n}\n",ACCEPTED,31,512
1281263969589714944,271867ca81e101e94b48456ca01ff8646654cf29dabb73be8ec83dbc9d22a1d9,2020-07-10 00:28:29,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint num[300]={0,1,2,3,4,5,6,7,8,9,10,15,16,17,18,20,21,24,26,27,28,31,33,36,40,45,46,50,51,52,55,57,63,65,67,73,78,80,82,85,88,91,92,93,98,99,100,104,105,107,109,111,114,119,121,127,129,130,135,141,142,150,151,154,160,164,170,171,173,178,182,185,186,191,195,200,203,209,212,215,219,227,235,242,246,252,255,257,264,273,282,292,300,313,316,325,328,333,341,342,343,357,364,365,373,381,393,400,414,427,434,438,446,455,464,471,484,495,511,513,546,555,560,564,585,624,626,644,646,651,656,666,676,692,693,701,717,728,730,757,771,777,787,819,820,856,868,910,939,975,1023,1025,1066,1105,1221,1285,1312,1365,1432,1441,1460,1539,1550,1640,1667,1755,1885,2000,2188,2268,2293,2550,2565,2709,2730,2910,2920,2925,2997,3069,3074,3075,3280,3315,3550,3591,3640,3663,3735,3740,3855,3951,3999,4095,4097,4161,4225,4257,4289,4369,4433,4593,4617,4681,5001,5049,5125,5189,5397,5461,5740,5840,5854,6148,6200,6560,6562,6643,6697,6724,6761,6825,6886,6889,6953,7300,7373,7381,7409,7447,7462,7517,7667,7703,7777,7801,7997,8038,8119,8194,8200,8258,8281,8322,8386,8578,8778,8802,9009,9103,9201,9222,9490,9958,10252,10308,10658,10794,10858,10922,10986,11253,11314,11757,11898,11950,12291,12355,12419,12483, 12547,12654,12691,13107,13124,13131,13205,13286,13299,13331};\nint main()\n{\n    int n,s,j;\n\tcin>>n>>s;\n\tfor(j=1;num[j]<=s;j++);\n    {\n        for(int i=0;i<n;i++)\n        {\n            cout<<num[j+i]<<endl;\n        }\n    }\n\treturn 0;\n}",ACCEPTED,23,500
1281282093035732992,c4245dbd96f94634e12832f2357f284893f857027431cac025fcda532a7a33f6,2020-07-10 01:40:30,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nbool ip(int a, int b)\n{\n    short r[100] = { 0 }, c = 0;\n    while (a) \n    {\n        r[c++] = a % b;\n        a /= b;\n    } \n    int m = 0, n =c - 1;\n    if (m < n)\n        if (r[m++] != r[n--])\n            return 0;\n    return 1;\n}\nint main()\n{\n    int x, y;\n    cin>>x>>y;\n    int d = 0;\n    for (int i = y + 1; d != x; i++)\n    {\n        int t = 0;\n        for (int p = 2; p <= 10 && t < 2; p++) \n        {\n            if (ip(i, p))\n                t++;\n        }\n        if (t >= 2)\n            printf(\""%d\\n\"", i), d++;\n    }\n    system(\""pause\"");\n    return 0;\n}",PARTIAL_ACCEPTED,23,512
1281283240139096064,f0ee3f8707f01ecea9574092c8ad9bff39a0e2bf92c65ed257f7050fc3bb583e,2020-07-10 01:45:04,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n \nchar c[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nint n;\nint f(int num)\n{\n    num*=num;\n    char a[1000];\n    int i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    int fa=1;\n    for(int j=1;j<=i/2;j++)\n    {\n        if(a[j]!=a[i-j+1])\n        {\n            fa=0;\n            break;\n        }\n    }\n    return fa;\n}\n \nvoid print(int num)\n{\n    int temp=num;\n    char a[1000];\n    int i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    for(i;i>=1;i--)\n        printf(\""%c\"",a[i]);\n    printf(\"" \"");\n    num=temp*temp;\n    i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    for(i;i>=1;i--)\n        cout<<a[i]<<endl;\n}\n \nint main()\n{\n    while(~scanf(\""%d\"",&n))\n    {\n        for(int i=1;i<=300;i++)\n        {\n            if(f(i)==1)\n                print(i);\n        }\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1281283750188466176,f0ee3f8707f01ecea9574092c8ad9bff39a0e2bf92c65ed257f7050fc3bb583e,2020-07-10 01:47:05,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<stdio.h>\n \nchar c[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nint n;\nint fun(int num)\n{\n    num*=num;\n    char a[1000];\n    int i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    int flag=1;\n    for(int j=1;j<=i/2;j++)\n    {\n        if(a[j]!=a[i-j+1])\n        {\n            flag=0;\n            break;\n        }\n    }\n    return flag;\n}\n \nvoid print(int num)\n{\n    int temp=num;\n    char a[1000];\n    int i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    for(i;i>=1;i--)\n        printf(\""%c\"",a[i]);\n    printf(\"" \"");\n    num=temp*temp;\n    i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    for(i;i>=1;i--)\n        printf(\""%c\"",a[i]);\n    printf(\""\\n\"");\n}\n \nint main()\n{\n    while(~scanf(\""%d\"",&n))\n    {\n        for(int i=1;i<=300;i++)\n        {\n            if(fun(i)==1)\n                print(i);\n        }\n    }\n    return 0;\n}\n",ACCEPTED,20,384
1281283841888534528,f0ee3f8707f01ecea9574092c8ad9bff39a0e2bf92c65ed257f7050fc3bb583e,2020-07-10 01:47:27,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n \nchar c[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nint n;\nint fun(int num)\n{\n    num*=num;\n    char a[1000];\n    int i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    int flag=1;\n    for(int j=1;j<=i/2;j++)\n    {\n        if(a[j]!=a[i-j+1])\n        {\n            flag=0;\n            break;\n        }\n    }\n    return flag;\n}\n \nvoid print(int num)\n{\n    int temp=num;\n    char a[1000];\n    int i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    for(i;i>=1;i--)\n        printf(\""%c\"",a[i]);\n    printf(\"" \"");\n    num=temp*temp;\n    i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    for(i;i>=1;i--)\n        printf(\""%c\"",a[i]);\n    printf(\""\\n\"");\n}\n \nint main()\n{\n    while(~scanf(\""%d\"",&n))\n    {\n        for(int i=1;i<=300;i++)\n        {\n            if(fun(i)==1)\n                print(i);\n        }\n    }\n    return 0;\n}\n",ACCEPTED,48,512
1281284181324136448,f0ee3f8707f01ecea9574092c8ad9bff39a0e2bf92c65ed257f7050fc3bb583e,2020-07-10 01:48:48,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n using namespace std;\nchar c[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nint n;\nint f(int num)\n{\n    num*=num;\n    char a[1000];\n    int i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    int flag=1;\n    for(int j=1;j<=i/2;j++)\n    {\n        if(a[j]!=a[i-j+1])\n        {\n            flag=0;\n            break;\n        }\n    }\n    return flag;\n}\n \nvoid print(int num)\n{\n    int temp=num;\n    char a[1000];\n    int i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    for(i;i>=1;i--)\n        printf(\""%c\"",a[i]);\n    printf(\"" \"");\n    num=temp*temp;\n    i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    for(i;i>=1;i--)\n        printf(\""%c\"",a[i]);\n    printf(\""\\n\"");\n}\n \nint main()\n{\n    while(~scanf(\""%d\"",&n))\n    {\n        for(int i=1;i<=300;i++)\n        {\n            if(f(i)==1)\n                print(i);\n        }\n    }\n    return 0;\n}\n",ACCEPTED,21,512
1281284376989450240,f0ee3f8707f01ecea9574092c8ad9bff39a0e2bf92c65ed257f7050fc3bb583e,2020-07-10 01:49:35,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n using namespace std;\nchar c[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nint n;\nint f(int num)\n{\n    num*=num;\n    char a[1000];\n    int i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    int flag=1;\n    for(int j=1;j<=i/2;j++)\n    {\n        if(a[j]!=a[i-j+1])\n        {\n            flag=0;\n            break;\n        }\n    }\n    return flag;\n}\n \nvoid print(int num)\n{\n    int temp=num;\n    char a[1000];\n    int i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    for(i;i>=1;i--)\n        printf(\""%c\"",a[i]);\n    printf(\"" \"");\n    num=temp*temp;\n    i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    for(i;i>=1;i--)\n        cout<<a[i];\n    cout<<endl;\n}\n \nint main()\n{\n    while(~scanf(\""%d\"",&n))\n    {\n        for(int i=1;i<=300;i++)\n        {\n            if(f(i)==1)\n                print(i);\n        }\n    }\n    return 0;\n}\n",ACCEPTED,49,424
1281284649249071104,f0ee3f8707f01ecea9574092c8ad9bff39a0e2bf92c65ed257f7050fc3bb583e,2020-07-10 01:50:40,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n using namespace std;\nchar c[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nint n;\nint f(int num)\n{\n    num*=num;\n    char a[1000];\n    int i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    int fa=1;\n    for(int j=1;j<=i/2;j++)\n    {\n        if(a[j]!=a[i-j+1])\n        {\n            fa=0;\n            break;\n        }\n    }\n    return fa;\n}\n \nvoid print(int num)\n{\n    int temp=num;\n    char a[1000];\n    int i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    for(i;i>=1;i--)\n        cout<<a[i];\n    cout<<\"" \""<<endl;\n    num=temp*temp;\n    i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    for(i;i>=1;i--)\n        cout<<a[i];\n    cout<<endl;\n}\n \nint main()\n{\n    while(~scanf(\""%d\"",&n))\n    {\n        for(int i=1;i<=300;i++)\n        {\n            if(f(i)==1)\n                print(i);\n        }\n    }\n    return 0;\n}\n",PRESENTATION_ERROR,24,512
1281284943014969344,f0ee3f8707f01ecea9574092c8ad9bff39a0e2bf92c65ed257f7050fc3bb583e,2020-07-10 01:51:50,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n using namespace std;\nchar c[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nint n;\nint f(int num)\n{\n    num*=num;\n    char a[1000];\n    int i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    int flag=1;\n    for(int j=1;j<=i/2;j++)\n    {\n        if(a[j]!=a[i-j+1])\n        {\n            flag=0;\n            break;\n        }\n    }\n    return flag;\n}\n \nvoid print(int num)\n{\n    int temp=num;\n    char a[1000];\n    int i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    for(i;i>=1;i--)\n        cout<<a[i];\n    cout<<\"" \""<<endl;\n    num=temp*temp;\n    i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    for(i;i>=1;i--)\n        cout<<a[i];\n    cout<<endl;\n}\n \nint main()\n{\n    while(~scanf(\""%d\"",&n))\n    {\n        for(int i=1;i<=300;i++)\n        {\n            if(f(i)==1)\n                print(i);\n        }\n    }\n    return 0;\n}\n",PRESENTATION_ERROR,37,512
1281285163747573760,f0ee3f8707f01ecea9574092c8ad9bff39a0e2bf92c65ed257f7050fc3bb583e,2020-07-10 01:52:42,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n using namespace std;\nchar c[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nint n;\nint f(int num)\n{\n    num*=num;\n    char a[1000];\n    int i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    int flag=1;\n    for(int j=1;j<=i/2;j++)\n    {\n        if(a[j]!=a[i-j+1])\n        {\n            flag=0;\n            break;\n        }\n    }\n    return flag;\n}\n \nvoid print(int num)\n{\n    int temp=num;\n    char a[1000];\n    int i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    for(i;i>=1;i--)\n        cout<<a[i];\n    cout<<\"" \""<<endl;\n    num=temp*temp;\n    i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    for(i;i>=1;i--)\n        cout<<a[i];\n    cout<<endl;\n}\n \nint main()\n{\n    while(~scanf(\""%d\"",&n))\n    {\n        for(int i=1;i<=300;i++)\n        {\n            if(f(i)==1)\n                print(i);\n        }\n    }\n    return 0;\n}\n",PRESENTATION_ERROR,26,508
1281285296476315648,f0ee3f8707f01ecea9574092c8ad9bff39a0e2bf92c65ed257f7050fc3bb583e,2020-07-10 01:53:14,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nchar c[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nint n;\nint f(int num)\n{\n    num*=num;\n    char a[1000];\n    int i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    int flag=1;\n    for(int j=1;j<=i/2;j++)\n    {\n        if(a[j]!=a[i-j+1])\n        {\n            flag=0;\n            break;\n        }\n    }\n    return flag;\n}\n \nvoid print(int num)\n{\n    int temp=num;\n    char a[1000];\n    int i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    for(i;i>=1;i--)\n        cout<<a[i];\n    cout<<\"" \""<<endl;\n    num=temp*temp;\n    i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    for(i;i>=1;i--)\n        cout<<a[i];\n    cout<<endl;\n}\n \nint main()\n{\n    while(~scanf(\""%d\"",&n))\n    {\n        for(int i=1;i<=300;i++)\n        {\n            if(f(i)==1)\n                print(i);\n        }\n    }\n    return 0;\n}\n",PRESENTATION_ERROR,49,524
1281285476860747776,f0ee3f8707f01ecea9574092c8ad9bff39a0e2bf92c65ed257f7050fc3bb583e,2020-07-10 01:53:57,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nchar c[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nint n;\nint f(int num)\n{\n    num*=num;\n    char a[1000];\n    int i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    int flag=1;\n    for(int j=1;j<=i/2;j++)\n    {\n        if(a[j]!=a[i-j+1])\n        {\n            flag=0;\n            break;\n        }\n    }\n    return flag;\n}\n \nvoid print(int num)\n{\n    int temp=num;\n    char a[1000];\n    int i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    for(i;i>=1;i--)\n        printf(\""%c\"",a[i]);\n    printf(\"" \"");\n    num=temp*temp;\n    i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    for(i;i>=1;i--)\n        cout<<a[i];\n    cout<<endl;\n}\n \nint main()\n{\n    while(~scanf(\""%d\"",&n))\n    {\n        for(int i=1;i<=300;i++)\n        {\n            if(f(i)==1)\n                print(i);\n        }\n    }\n    return 0;\n}\n",ACCEPTED,24,424
1281285581252788224,f0ee3f8707f01ecea9574092c8ad9bff39a0e2bf92c65ed257f7050fc3bb583e,2020-07-10 01:54:22,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nchar c[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nint n;\nint f(int num)\n{\n    num*=num;\n    char a[1000];\n    int i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    int m=1;\n    for(int j=1;j<=i/2;j++)\n    {\n        if(a[j]!=a[i-j+1])\n        {\n            m=0;\n            break;\n        }\n    }\n    return m;\n}\n \nvoid print(int num)\n{\n    int temp=num;\n    char a[1000];\n    int i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    for(i;i>=1;i--)\n        printf(\""%c\"",a[i]);\n    printf(\"" \"");\n    num=temp*temp;\n    i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    for(i;i>=1;i--)\n        cout<<a[i];\n    cout<<endl;\n}\n \nint main()\n{\n    while(~scanf(\""%d\"",&n))\n    {\n        for(int i=1;i<=300;i++)\n        {\n            if(f(i)==1)\n                print(i);\n        }\n    }\n    return 0;\n}\n",ACCEPTED,32,384
1281285752510414848,f0ee3f8707f01ecea9574092c8ad9bff39a0e2bf92c65ed257f7050fc3bb583e,2020-07-10 01:55:03,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nchar c[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nint n;\nint f(int num)\n{\n    num*=num;\n    char a[1000];\n    int i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    int m=1;\n    for(int j=1;j<=i/2;j++)\n    {\n        if(a[j]!=a[i-j+1])\n        {\n            m=0;\n            break;\n        }\n    }\n    return m;\n}\n \nvoid print(int num)\n{\n    int temp=num;\n    char a[1000];\n    int i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    for(i;i>=1;i--)\n        cout<<a[i];\n    cout<<\"" \"";\n    num=temp*temp;\n    i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    for(i;i>=1;i--)\n        cout<<a[i];\n    cout<<endl;\n}\n \nint main()\n{\n    while(~scanf(\""%d\"",&n))\n    {\n        for(int i=1;i<=300;i++)\n        {\n            if(f(i)==1)\n                print(i);\n        }\n    }\n    return 0;\n}\n",ACCEPTED,32,384
1281291450104332288,f0ee3f8707f01ecea9574092c8ad9bff39a0e2bf92c65ed257f7050fc3bb583e,2020-07-10 02:17:41,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <bitset>\nusing namespace std;\n\n\nint main()\n{\n    int N,S,i,n1,n2,sum=0;\n    cin>>N>>S;\n    for(i=S+1;i<10000;i++)\n    {\n        n1=i;\n        n2=bitset<sizeof(int)*8>(i);\n        if(n1[j]==n1[n1.length-j]&&n2[j]==n2[n2.length-j])\n            sum++;\n        if(sum==N)\n            break;\n    }\n}",COMPILE_ERROR,0,0
1281292417267859456,f0ee3f8707f01ecea9574092c8ad9bff39a0e2bf92c65ed257f7050fc3bb583e,2020-07-10 02:21:32,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <bitset>\nusing namespace std;\n\n\nint main()\n{\n    int N,S,i,n1,n2,sum=0,j;\n    cin>>N>>S;\n    for(i=S+1;i<10000;i++)\n    {\n        n1=i;\n        n2=bitset<sizeof(int)*8>(i);\n        for(j=0;j<n2.length;j++)\n        {\n            if(n1[j]==n1[n1.length-j]&&n2[j]==n2[n2.length-j])\n                sum++;\n            cout<<n1<<endl;\n        \n        }\n        if(sum==N)\n            break;\n    }\n    \n}",COMPILE_ERROR,0,0
1281299509832761344,271867ca81e101e94b48456ca01ff8646654cf29dabb73be8ec83dbc9d22a1d9,2020-07-10 02:49:43,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\n\nusing namespace std;\nint b,arr[20],len;\nstring str=\""0123456789ABCDEFGHIG\"";\nint change(int x)\n{\n\tmemset(arr,0,sizeof(arr));\n\tint m=x,h=0;\n\tdo{\n\t\th++;\n\t\tarr[h]=m%b;\n\t\tm=m/b;\n\t}while(m);\n\tlen=h;\n\treturn 1;\n}\nbool fun(){\n\tfor(int i=1;i<=len/2;i++)\n\t{\n\t    if(arr[i]!=arr[len-i+1])\n\t\t{\n\t\t\t return 0;\n\t\t}\n\t}\n\treturn 1;\n}\nint main()\n{\n\tcin>>b;\n\tfor(int i=1;i<=300;i++){\n\t\tchange(i*i);\n\t\tif(fun())\n        {\n\t\t\tchange(i);\n\t\t\tfor(int j=len;j>=1;j--)\n\t\t\t{\n\t\t\t\tcout<<str[arr[j]];\n\t\t\t}\n\t\t\tcout<<' ';\n\t\t\tchange(i*i);\n\t\t\tfor(int j=len;j>=1;j--)\n\t\t\t{\n\t\t\t\tcout<<str[arr[j]];\n\t\t\t}\n\t\t\tcout<<endl;\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,31,416
1281303041834147840,d33dc28eb3741f96afbdd0719ab080d222cf8b03b3611d117ccbf5ee6da9a1f3,2020-07-10 03:03:45,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string.h>\n\nusing  namespace std;\n\nint main()\n{\n    char str1[2000],str2[2000],k;\n    int N,S,i,t1,d,j,len,sum,t3;\n    cin>>N>>S;",COMPILE_ERROR,0,0
1281304653911736320,d33dc28eb3741f96afbdd0719ab080d222cf8b03b3611d117ccbf5ee6da9a1f3,2020-07-10 03:10:09,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string.h>\nusing  namespace std;\nchar X[2005],Y[2005],Z;\nint i,a,b,c,d,e;\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n        for(i=S+1;;i++)\n        {\n            d=0;",COMPILE_ERROR,0,0
1281305406846992384,d33dc28eb3741f96afbdd0719ab080d222cf8b03b3611d117ccbf5ee6da9a1f3,2020-07-10 03:13:09,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string.h>\nusing  namespace std;\nchar X[2005],Y[2005],Z;\nint i,a,b,c,d,e;\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n        for(i=S+1;;i++)\n        {\n            d=0;\n            for(int j=2;j<11;j++)\n            {\n                c=0;\n                e=0;\n                a=i;\n                while(a)\n                {\n                    b=a%j;\n                    X[c++]=\""0123456789\""[b];\n                    a=a/j;\n                }",COMPILE_ERROR,0,0
1281309163290812416,d33dc28eb3741f96afbdd0719ab080d222cf8b03b3611d117ccbf5ee6da9a1f3,2020-07-10 03:28:04,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string.h>\nusing  namespace std;\nchar X[2005],Y[2005],Z;\nint i,a,b,c,d,e;\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n        for(i=S+1;;i++)\n        {\n            d=0;\n            for(int j=2;j<11;j++)\n            {\n                c=0;\n                e=0;\n                a=i;\n                while(a)\n                {\n                    b=a%j;\n                    X[c++]=\""0123456789\""[b];\n                    a=a/j;\n                }\n                X[c]='\\0';\n                for(Z=c-1;Z>-1;Z--)\n                    Y[e++]=X[Z];\n                Y[e]='\\0';\n                if(strcmp(X,Y)==0)\n                    d++;\n            }\n            if(d>=2)\n            {\n                N--;\n                cout<<i;\n            }\n            if(N==0)\n                break;\n        }\n\n\n}\n",PRESENTATION_ERROR,34,384
1281309272581791744,d33dc28eb3741f96afbdd0719ab080d222cf8b03b3611d117ccbf5ee6da9a1f3,2020-07-10 03:28:30,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string.h>\nusing  namespace std;\nchar X[2005],Y[2005],Z;\nint i,a,b,c,d,e;\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n        for(i=S+1;;i++)\n        {\n            d=0;\n            for(int j=2;j<11;j++)\n            {\n                c=0;\n                e=0;\n                a=i;\n                while(a)\n                {\n                    b=a%j;\n                    X[c++]=\""0123456789\""[b];\n                    a=a/j;\n                }\n                X[c]='\\0';\n                for(Z=c-1;Z>-1;Z--)\n                    Y[e++]=X[Z];\n                Y[e]='\\0';\n                if(strcmp(X,Y)==0)\n                    d++;\n            }\n            if(d>=2)\n            {\n                N--;\n                cout<<i<<\""\\t\"";\n            }\n            if(N==0)\n                break;\n        }\n\n\n}\n",PRESENTATION_ERROR,30,392
1281309306716078080,d33dc28eb3741f96afbdd0719ab080d222cf8b03b3611d117ccbf5ee6da9a1f3,2020-07-10 03:28:38,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string.h>\nusing  namespace std;\nchar X[2005],Y[2005],Z;\nint i,a,b,c,d,e;\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n        for(i=S+1;;i++)\n        {\n            d=0;\n            for(int j=2;j<11;j++)\n            {\n                c=0;\n                e=0;\n                a=i;\n                while(a)\n                {\n                    b=a%j;\n                    X[c++]=\""0123456789\""[b];\n                    a=a/j;\n                }\n                X[c]='\\0';\n                for(Z=c-1;Z>-1;Z--)\n                    Y[e++]=X[Z];\n                Y[e]='\\0';\n                if(strcmp(X,Y)==0)\n                    d++;\n            }\n            if(d>=2)\n            {\n                N--;\n                cout<<i<<endl;\n            }\n            if(N==0)\n                break;\n        }\n\n\n}\n",ACCEPTED,28,500
1281310235635933184,f0ee3f8707f01ecea9574092c8ad9bff39a0e2bf92c65ed257f7050fc3bb583e,2020-07-10 03:32:20,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <bitset>\nusing namespace std;\n\n\nint main()\n{\n    int N,S,i,n1,n2,sum=0,j;\n    cin>>N>>S;\n    for(i=S+1;i<10000;i++)\n    {\n        n1=i;\n        n2=bitset<sizeof(int)*8>(i);\n        for(j=0;j<n2.length;j++)\n        {\n            if(n1[j]==n1[n1.length-j]&&n2[j]==n2[n2.length-j])\n                sum++;\n            cout<<n1<<endl;\n        \n        }\n        if(sum==N)\n            break;\n    }\n    \n}",COMPILE_ERROR,0,0
1281310306431590400,f0ee3f8707f01ecea9574092c8ad9bff39a0e2bf92c65ed257f7050fc3bb583e,2020-07-10 03:32:37,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <bitset>\nusing namespace std;\n\n\nint main()\n{\n    int N,S,i,n1,n2,sum=0,j;\n    cin>>N>>S;\n    for(i=S+1;i<10000;i++)\n    {\n        n1=i;\n        n2=bitset<sizeof(int)*8>(n1);\n        for(j=0;j<n2.length;j++)\n        {\n            if(n1[j]==n1[n1.length-j]&&n2[j]==n2[n2.length-j])\n                sum++;\n            cout<<n1<<endl;\n        \n        }\n        if(sum==N)\n            break;\n    }\n    \n}",COMPILE_ERROR,0,0
1281397090206269440,c2c290e91f30dc0454f9ef5b9125b06471e7d4b403c388aa8cf0d9b3efc569e9,2020-07-10 09:17:28,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nint a[250]; \nint B;\nbool judge(int x,int n)\n{\n    int m{ 0 };\n    x = x * x;\n    while (x)\n    {\n        a[++m] = x % n;\n        x /= n;\n    }\n    int flag{1};\n    for (int i=1;i<=m/2;i++){\n        if (a[i]!=a[m-i+1]){\n            flag=0;\n            break;\n        }\n    }\n    return flag;\n}\nvoid p(int x)\n{\n    int m = 0;\n    while (x)\n    {\n        a[++m] = x % B;\n        x /= B;\n    }\n    for (int i = m; i >= 1; i--)\n    {\n        if (a[i] > 9)\n            cout<<(a[i] + 55 );\n        else \n            cout<< a[i] ;\n    }\n}\nint main()\n{\n    int B;\n    cin >> B;\n    for (int i = 1; i <= 300; i++)\n    {\n        if (judge(i,B))\n        {\n            p(i),cout << \"" \"",p(i * i);\n            cout<<\""\\n\"";\n        }\n    }\n    return 0;\n}",FLOAT_POINT_EXCEPTION,63,504
1281401435098365952,c2c290e91f30dc0454f9ef5b9125b06471e7d4b403c388aa8cf0d9b3efc569e9,2020-07-10 09:34:44,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nint a[250]; \nint B;\nbool judge(int x,int n)\n{\n    int m{ 0 };\n    x = x * x;\n    while (x)\n    {\n        a[++m] = x % n;\n        x /= n;\n    }\n    int flag{1};\n    for (int i=1;i<=m/2;i++){\n        if (a[i]!=a[m-i+1]){\n            flag=0;\n            break;\n        }\n    }\n    return flag;\n}\nvoid p(int x)\n{\n    int m = 0;\n    while (x)\n    {\n        a[++m] = x % B;\n        x /= B;\n    }\n    for (int i = m; i >= 1; i--)\n    {\n        if (a[i] > 9)\n            cout<<(char)(a[i] + 55 );\n        else \n            cout<< a[i] ;\n    }\n}\nint main()\n{\n    int B;\n    cin >> B;\n    for (int i = 1; i < 301; i++)\n    {\n        if (judge(i,B))\n        {\n            p(i),cout << \"" \"",p(i * i);\n            cout<<\""\\n\"";\n        }\n    }\n    return 0;\n}",FLOAT_POINT_EXCEPTION,23,424
1281401803306893312,c2c290e91f30dc0454f9ef5b9125b06471e7d4b403c388aa8cf0d9b3efc569e9,2020-07-10 09:36:11,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nint B;\nint a[100]; \nbool judge(int x, int n)\n{\n    int m{ 0 };\n    x = x * x;\n    while (x)\n    {\n        a[++m] = x % n;\n        x /= n;\n    }\n    int flag{ 1 };\n    for (int i = 1; i <= m / 2; i++) {\n        if (a[i] != a[m - i + 1]) {\n            flag = 0;\n            break;\n        }\n    }\n    return flag;\n}\nvoid p(int x)\n{\n    int q = 0;\n    while (x)\n    {\n        a[++q] = x % B;\n        x /= B;\n    }\n    for (int i = q; i >= 1; i--)\n    {\n        if (a[i] >= 10)\n            cout << (char)(a[i] +55);\n        else \n            cout<<a[i];\n    }\n}\nint main()\n{\n    cin >> B;\n    for (int i = 1; i <= 300; i++)\n    {\n        if (judge(i,B))\n        {\n            p(i),cout<<\"" \"",p(i * i);\n            cout<<\""\\n\"";\n        }\n    }\n    return 0;\n}\n\n",ACCEPTED,27,424
1281411639205625856,67e8ef6aa12e75b377f9dd7c14b5a655db21d7cdf94949f1dd842a92ce306d8e,2020-07-10 10:15:16,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nint n,s;\nvector<int>b;\nbool jud(int t,int i)\n{\n    b.clear();\n    do\n    {\n        b.push_back(t%i);\n        t/=i;\n    }while(t);\n    for(int i=0,j=b.size()-1;i<j;i++,j--)\n        if(b[i]!=b[j])\n            return 0;\n    return 1;\n}\nbool calc(int t)//判断x是不是双重回文数\n{\n    int cnt=0;\n    for(int i=2;i<=10;i++)\n    {\n        if(jud(t,i))\n        {\n            cnt++;\n            if(cnt>=2)\n                return 1;\n        }\n    }\n    return 0;\n}\nint main()\n{\n    scanf(\""%d%d\"",&n,&s);\n    for(int i=s+1;n;i++)\n    {\n        if(calc(i))\n        {\n            cout<<i<<endl;\n            n--;\n        }\n   }\n    return 0;\n}",ACCEPTED,35,508
1281417192015323136,47dbe5892208b18a18291b2192e6aba93b27900ba3b6814d0afa935087a6c59d,2020-07-10 10:37:20,C++,10.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nint n,s,b,i,k;\nint a[1000];\nbool hex(int x)\n{\n    int s,i;\n    s=x;\n    i=0;\n    while (s!=0)\n    {\n        i++;\n        a[i]=s%b;\n        s=s/b;\n    }\n    for (int j=1;j<=i/2+1;j++)\n    if (a[j]!=a[i-j+1])\n    {return false;\n    }\n    else{\n    return true;}\n}\nint main()\n{\n    cin>>n>>s;\n    i=s;\n    while (n!=0)\n    {\n        i++;\n        k=0;\n        for (b=2;b<=10;b++)\n        {\n            if (hex(i)) {k++;}\n            if (k==2)\n            {\n                printf(\""%d\\n\"",i);\n                n--;\n                break;\n            }\n        }\n    }\n}\n",PARTIAL_ACCEPTED,19,384
1281430205795590144,83b472026623d03bdda5fcbf6ff6eadcdd187016e38c89feec56cbf2e06c2ff2,2020-07-10 11:29:03,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <stdio.h>\n#include\""cstdio\""\n#include\""iostream\""\n#include\""string.h\""\n#include\""algorithm\""\n    using namespace std;\nchar str[1001];\nint dp[1001][1001];\nint main()\n{\n\n    memset(dp,0,sizeof(dp));\n    char str1[1001];\n    scanf(\""%s\"",str);\n    int len=strlen(str);\n    int j=len-1;\n    for(int i=0;i<len;i++)\n        str1[j--]=str[i];\n    for(int i=1;i<=len;i++)\n    {\n        for(int j=1;j<=len;j++)\n            if(str[i-1]==str1[j-1])\n               dp[i][j]=max(dp[i][j],dp[i-1][j-1]+1);\n            else\n                dp[i][j]=max(dp[i-1][j],dp[i][j-1]);\n    }\n    printf(\""%d\\n\"",len-dp[len][len]);\n}\n",WRONG_ANSWER,57,4352
1281430304235913216,83b472026623d03bdda5fcbf6ff6eadcdd187016e38c89feec56cbf2e06c2ff2,2020-07-10 11:29:27,C,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <stdio.h>\n#include\""cstdio\""\n#include\""iostream\""\n#include\""string.h\""\n#include\""algorithm\""\n    using namespace std;\nchar str[1001];\nint dp[1001][1001];\nint main()\n{\n\n    memset(dp,0,sizeof(dp));\n    char str1[1001];\n    scanf(\""%s\"",str);\n    int len=strlen(str);\n    int j=len-1;\n    for(int i=0;i<len;i++)\n        str1[j--]=str[i];\n    for(int i=1;i<=len;i++)\n    {\n        for(int j=1;j<=len;j++)\n            if(str[i-1]==str1[j-1])\n               dp[i][j]=max(dp[i][j],dp[i-1][j-1]+1);\n            else\n                dp[i][j]=max(dp[i-1][j],dp[i][j-1]);\n    }\n    printf(\""%d\\n\"",len-dp[len][len]);\n}\n",COMPILE_ERROR,0,0
1281431070304559104,83b472026623d03bdda5fcbf6ff6eadcdd187016e38c89feec56cbf2e06c2ff2,2020-07-10 11:32:29,Python,0.0,1277062760129622023,1267442030214471680,1049226397448056832,def is_palindrome(n):\n    L=str(n)\n    x=len(L)\n    T=[]\n    for i in range(x//2):\n        t=L[i]==L[-1-i]\n        T.append(t)\n    return False not in  T\n\n,WRONG_ANSWER,218,2984
1281439240833925120,8af30722565f5a6f7bc0cc42a1a2121888efcb33ecacd9a6ebcd8460756fa0ab,2020-07-10 12:04:57,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm> \nusing namespace std;\n\nbool Palin_num(const string a)\n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    int i;\n    for (i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1]) \n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1)\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring a(int n, int m)\n{\n    string ans = \""\"";\n    do {\n        int t = n % m;\n        if (t >= 0 && t <= 9)\t\n        {\n            ans += t + '0';\n        }\n        else \n        {\n            ans += t - 10 + 'A';\n        }\n        n /= m;\n    } while (n != 0);\n    reverse(ans.begin(), ans.end());；\n    return ans;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    int j = 0;\n    for (int x = 1; x <= 300; x++)\n    {\n        j = x; \n        \n        string s1 = a(j, n);\n        string s2 = a((j * j), n);\n        if (Palin_num(s2))\n        {\n            cout << s1 << \"" \"" << s2 << endl;\n        }\n        else\n        {\n            continue;\n        }\n    }\n    return 0;\n}\n\n",COMPILE_ERROR,0,0
1281439317913681920,8af30722565f5a6f7bc0cc42a1a2121888efcb33ecacd9a6ebcd8460756fa0ab,2020-07-10 12:05:16,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm> \nusing namespace std;\n\nbool Palin_num(const string a)\n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    int i;\n    for (i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1]) \n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1)\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring a(int n, int m)\n{\n    string ans = \""\"";\n    do {\n        int t = n % m;\n        if (t >= 0 && t <= 9)\t\n        {\n            ans += t + '0';\n        }\n        else \n        {\n            ans += t - 10 + 'A';\n        }\n        n /= m;\n    } while (n != 0);\n    reverse(ans.begin(), ans.end());\n    return ans;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    int j = 0;\n    for (int x = 1; x <= 300; x++)\n    {\n        j = x; \n        \n        string s1 = a(j, n);\n        string s2 = a((j * j), n);\n        if (Palin_num(s2))\n        {\n            cout << s1 << \"" \"" << s2 << endl;\n        }\n        else\n        {\n            continue;\n        }\n    }\n    return 0;\n}\n\n",ACCEPTED,34,512
1281441231552299008,8af30722565f5a6f7bc0cc42a1a2121888efcb33ecacd9a6ebcd8460756fa0ab,2020-07-10 12:12:52,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>  \n#include <vector>\n#include <string>  \n#include <algorithm>  \nusing namespace std;\nstring fix(int n, int m)\n{\n    string ans = \""\"";\n    do {\n        int t = n % m;\n        if (t >= 0 && t <= 9)\n        {\n            ans += t + '0';\n        }\n        else\n        {\n            ans += t - 10 + 'A';\n        }\n        n /= m;\n    } while (n != 0);\n    reverse(ans.begin(), ans.end());\n    return ans;\n}\nbool solo(const string a)\n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1])\n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1)\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nint main()\n{\n    int n;\n    int s;\n    cin >> n >> s;\n    s++;\n    vector<int> p;\n    int sum;\n    while ((p.size() < n)) \n    {\n        sum = 0;\n        for (int i = 2; i <= 10; i++)\n        {\n            if (solo(fix(s, i))) \n            {\n                sum++;\n            }\n        }\n        if (sum >= 2)\n        {\n            p.push_back(s);\n        }\n        s++;\n    }\n    int i;\n    for ( i = 0; i < p.size(); i++)\n    {\n        cout << p[i] << endl;\n    }\n    return 0;\n}",ACCEPTED,32,440
1281442801736138752,2c10b919f13abf5883246b96f89cc73173adac8376c3f1b5e9b5978b338dfa1c,2020-07-10 12:19:06,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nchar a[400];\nvoid swap()\n{\n    int l=(int)strlen(a);\n    int p1=0,p2=l-1;\n    int t;\n    while(p1<p2){\n        t=a[p1];\n        a[p1++]=a[p2];\n        a[p2--]=t;\n    }\n}\nvoid convert(int x,int b)\n{\n    int i=0,n;\n    memset(a,0,400*sizeof(char));\n    n=x;\n    while(n!=0)\n    {\n        if(n%b<10) a[i]=n%b+48;\n        else a[i]=n%b+55;\n        n=n/b;\n        i++;\n    }\n    a[i]='\\0';\n}\n\nint main()\n{\n    int b,i=1,l,p1,p2,flag;\n    char t[400];\n    scanf(\""%d\"",&b);\n    for(i=1;i<=300;i++)\n    {\n        flag=1;\n        convert(i*i,b);\n        strcpy(t,a);\n        l=(int)strlen(t);\n        p1=0;\n        p2=l-1;\n        while(p1<p2)\n        {\n            if(t[p1]!=t[p2]) {flag=0;break;}\n            p1++;\n            p2--;\n        }\n        if(flag)\n        {\n            convert(i,b);\n            swap();\n            printf(\""%s %s\\n\"",a,t);\n        }\n    }\n    return 0;\n}",ACCEPTED,27,512
1281517426457362432,47dbe5892208b18a18291b2192e6aba93b27900ba3b6814d0afa935087a6c59d,2020-07-10 17:15:38,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <cstdlib>\n\nusing namespace std;\n\nint N, S;\nchar str[32];\n\nbool isPalin_k(int x, int k)\n{\n\t// k进制时是否为回文数\n\t_itoa_s(x, str, k);\t// _itoa_s函数用于将x转换为k进制，返回一个字符串\n\tfor (int i = 0, j=strlen(str)-1; i < j; i++, j--)\n\t{\n\t\tif (str[i] != str[j])\n\t\t{\n\t\t\t// 出现不等非回文\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nbool isDualPalin(int x)\n{\n\t// 是否为双重回文数\n\tint cnt = 0;\n\tfor (int i = 2; i <= 10; i++)\n\t{\n\t\t// 二到十进制\n\t\tif (isPalin_k(x, i))\n\t\t{\n\t\t\tcnt++;\n\t\t\tif (2 == cnt)\n\t\t\t{\n\t\t\t\t// 存在两种以上进制为回文\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\nint main()\n{\n\tint n = 0, cnt = 0;\n\tcin >> N >> S;\n\twhile (n < N)\n\t{\n\t\tS++;\t// 大于S\n\t\tif (isDualPalin(S))\n\t\t{\n\t\t\tcout << S << endl;\n\t\t\tn++;\n\t\t}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1281517468537782272,47dbe5892208b18a18291b2192e6aba93b27900ba3b6814d0afa935087a6c59d,2020-07-10 17:15:48,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <cstdlib>\n\nusing namespace std;\n\nint N, S;\nchar str[32];\n\nbool isPalin_k(int x, int k)\n{\n\t// k进制时是否为回文数\n\t_itoa_s(x, str, k);\t// _itoa_s函数用于将x转换为k进制，返回一个字符串\n\tfor (int i = 0, j=strlen(str)-1; i < j; i++, j--)\n\t{\n\t\tif (str[i] != str[j])\n\t\t{\n\t\t\t// 出现不等非回文\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nbool isDualPalin(int x)\n{\n\t// 是否为双重回文数\n\tint cnt = 0;\n\tfor (int i = 2; i <= 10; i++)\n\t{\n\t\t// 二到十进制\n\t\tif (isPalin_k(x, i))\n\t\t{\n\t\t\tcnt++;\n\t\t\tif (2 == cnt)\n\t\t\t{\n\t\t\t\t// 存在两种以上进制为回文\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\nint main()\n{\n\tint n = 0, cnt = 0;\n\tcin >> N >> S;\n\twhile (n < N)\n\t{\n\t\tS++;\t// 大于S\n\t\tif (isDualPalin(S))\n\t\t{\n\t\t\tcout << S << endl;\n\t\t\tn++;\n\t\t}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1281518022714384384,47dbe5892208b18a18291b2192e6aba93b27900ba3b6814d0afa935087a6c59d,2020-07-10 17:18:00,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <cstring>\n#include <cstdlib>\n\nusing namespace std;\n\nint N, S;\nchar str[32];\n\nbool isPalin_k(int x, int k)\n{\n\t// k进制时是否为回文数\n\t_itoa_s(x, str, k);\t// _itoa_s函数用于将x转换为k进制，返回一个字符串\n\tfor (int i = 0, j=strlen(str)-1; i < j; i++, j--)\n\t{\n\t\tif (str[i] != str[j])\n\t\t{\n\t\t\t// 出现不等非回文\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nbool isDualPalin(int x)\n{\n\t// 是否为双重回文数\n\tint cnt = 0;\n\tfor (int i = 2; i <= 10; i++)\n\t{\n\t\t// 二到十进制\n\t\tif (isPalin_k(x, i))\n\t\t{\n\t\t\tcnt++;\n\t\t\tif (2 == cnt)\n\t\t\t{\n\t\t\t\t// 存在两种以上进制为回文\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\nint main()\n{\n\tint n = 0, cnt = 0;\n\tcin >> N >> S;\n\twhile (n < N)\n\t{\n\t\tS++;\t// 大于S\n\t\tif (isDualPalin(S))\n\t\t{\n\t\t\tcout << S << endl;\n\t\t\tn++;\n\t\t}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1281518699448557568,47dbe5892208b18a18291b2192e6aba93b27900ba3b6814d0afa935087a6c59d,2020-07-10 17:20:42,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <cstring>\n#include <stdlib.h>\n\nusing namespace std;\n\nint N, S;\nchar str[32];\n\nbool isPalin_k(int x, int k)\n{\n\t// k进制时是否为回文数\n\t_itoa_s(x, str, k);\t// _itoa_s函数用于将x转换为k进制，返回一个字符串\n\tfor (int i = 0, j=strlen(str)-1; i < j; i++, j--)\n\t{\n\t\tif (str[i] != str[j])\n\t\t{\n\t\t\t// 出现不等非回文\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nbool isDualPalin(int x)\n{\n\t// 是否为双重回文数\n\tint cnt = 0;\n\tfor (int i = 2; i <= 10; i++)\n\t{\n\t\t// 二到十进制\n\t\tif (isPalin_k(x, i))\n\t\t{\n\t\t\tcnt++;\n\t\t\tif (2 == cnt)\n\t\t\t{\n\t\t\t\t// 存在两种以上进制为回文\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\nint main()\n{\n\tint n = 0, cnt = 0;\n\tcin >> N >> S;\n\twhile (n < N)\n\t{\n\t\tS++;\t// 大于S\n\t\tif (isDualPalin(S))\n\t\t{\n\t\t\tcout << S << endl;\n\t\t\tn++;\n\t\t}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1281531946730962944,62ab56fba214ade1af428052e84f54b4a39008da8e2a6d888d02d705582fc25a,2020-07-10 18:13:20,Python,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <sstream>\n#include <string>\n#include <cmath>\nusing namespace std;\nint hw(int s)\n{\n    int ans=0;\n    for(int i=2;i<=10;i++)\n    {\n        if(ans==2) break;\n        int s0=s,j=0;\n        long long x=0;//转换成二进制可能很长 \n        while(s0)\n        {\n            x+=(s0%i)*pow(10,j);\n            s0/=i;\n            j++;\n        }\n        //cout<<x<<endl;\n        stringstream t;\n        string s;\n        t<<x;\n        t>>s;\n        int ls=s.size(),l=0;\n        while(s[l]==s[ls-1-l] && l<=(ls-1)/2)\n        {\n            l++;\n        }\n        l--;\n        if(l==(ls-1)/2) ans++;\n       \n    }\n    return ans;\n}\nint main()\n{\n    int n,s,num=0;\n    cin>>n>>s;\n    while(num<n)\n    {s++;\n        if(hw(s)==2) \n        {\n            cout<<s<<endl;\n            num++;\n        }\n    }\n    return 0;\n}",NON_ZERO_EXIT_CODE,129,2984
1281532074828161024,62ab56fba214ade1af428052e84f54b4a39008da8e2a6d888d02d705582fc25a,2020-07-10 18:13:51,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <sstream>\n#include <string>\n#include <cmath>\nusing namespace std;\nint hw(int s)\n{\n    int ans=0;\n    for(int i=2;i<=10;i++)\n    {\n        if(ans==2) break;\n        int s0=s,j=0;\n        long long x=0;//转换成二进制可能很长 \n        while(s0)\n        {\n            x+=(s0%i)*pow(10,j);\n            s0/=i;\n            j++;\n        }\n        //cout<<x<<endl;\n        stringstream t;\n        string s;\n        t<<x;\n        t>>s;\n        int ls=s.size(),l=0;\n        while(s[l]==s[ls-1-l] && l<=(ls-1)/2)\n        {\n            l++;\n        }\n        l--;\n        if(l==(ls-1)/2) ans++;\n       \n    }\n    return ans;\n}\nint main()\n{\n    int n,s,num=0;\n    cin>>n>>s;\n    while(num<n)\n    {s++;\n        if(hw(s)==2) \n        {\n            cout<<s<<endl;\n            num++;\n        }\n    }\n    return 0;\n}",ACCEPTED,67,424
1281533085546381312,62ab56fba214ade1af428052e84f54b4a39008da8e2a6d888d02d705582fc25a,2020-07-10 18:17:51,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <sstream>\n#include <string>\n#include <cmath>\nusing namespace std;\nint hwff(int s)\n{\n    int ansff=0;\n    for(int i=2;i<=10;i++)\n    {\n        if(ansff==2) break;\n        int s0=s,j=0;\n        long long xff=0;//转换成二进制可能很长 \n        while(s0)\n        {\n            xff+=(s0%i)*pow(10,j);\n            s0/=i;\n            j++;\n        }\n        //cout<<x<<endl;\n        stringstream t;\n        string s;\n        t<<xff;\n        t>>s;\n        int ls=s.size(),l=0;\n        while(s[l]==s[ls-1-l] && l<=(ls-1)/2)\n        {\n            l++;\n        }\n        l--;\n        if(l==(ls-1)/2) ansff++;\n       \n    }\n    return ansff;\n}\nint main()\n{\n    int nff = 0;\n    int s  = 0;\n    int num=0;\n\n    int one = 1;\n    int two = 2;\n    int three = 3;\n    \n\n    one = one+two;\n    two = one + two;\n    three = one + two + three;\n\n    cin>>nff>>s;\n    while(num<nff)\n    {s++;\n        if(hwff(s)==2) \n        {\n            cout<<s<<endl;\n            num++;\n        }\n    }\n\n    one = one+two;\n    two = one + two;\n    three = one + two + three;\n    \n    return 0;\n}",ACCEPTED,87,496
1281542380430229504,47dbe5892208b18a18291b2192e6aba93b27900ba3b6814d0afa935087a6c59d,2020-07-10 18:54:48,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <cstring>\n#include <stdlib.h>\n\nusing namespace std;\n\nint N, S;\nchar str[32];\n\nbool isPalin_k(int x, int k)\n{\n\t// k进制时是否为回文数\n\t_itoa_s(x, str, k);\t// _itoa_s函数用于将x转换为k进制，返回一个字符串\n\tfor (int i = 0, j=strlen(str)-1; i < j; i++, j--)\n\t{\n\t\tif (str[i] != str[j])\n\t\t{\n\t\t\t// 出现不等非回文\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nbool isDualPalin(int x)\n{\n\t// 是否为双重回文数\n\tint cnt = 0;\n\tfor (int i = 2; i <= 10; i++)\n\t{\n\t\t// 二到十进制\n\t\tif (isPalin_k(x, i))\n\t\t{\n\t\t\tcnt++;\n\t\t\tif (2 == cnt)\n\t\t\t{\n\t\t\t\t// 存在两种以上进制为回文\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\nint main()\n{\n\tint n = 0, cnt = 0;\n\tcin >> N >> S;\n\twhile (n < N)\n\t{\n\t\tS++;\t// 大于S\n\t\tif (isDualPalin(S))\n\t\t{\n\t\t\tcout << S << endl;\n\t\t\tn++;\n\t\t}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1281542560927907840,47dbe5892208b18a18291b2192e6aba93b27900ba3b6814d0afa935087a6c59d,2020-07-10 18:55:31,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <cstring>\n#include <stdlib.h>\n\nusing namespace std;\n\nint N, S;\nchar str[32];\n\nbool isPalin_k(int x, int k)\n{\n\t// k进制时是否为回文数\n\t_itoa_s(x, str, k);\t// _itoa_s函数用于将x转换为k进制，返回一个字符串\n\tfor (int i = 0, j=strlen(str)-1; i < j; i++, j--)\n\t{\n\t\tif (str[i] != str[j])\n\t\t{\n\t\t\t// 出现不等非回文\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nbool isDualPalin(int x)\n{\n\t// 是否为双重回文数\n\tint cnt = 0;\n\tfor (int i = 2; i <= 10; i++)\n\t{\n\t\t// 二到十进制\n\t\tif (isPalin_k(x, i))\n\t\t{\n\t\t\tcnt++;\n\t\t\tif (2 == cnt)\n\t\t\t{\n\t\t\t\t// 存在两种以上进制为回文\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\nint main()\n{\n\tint n = 0;\n\tcin >> N >> S;\n\twhile (n < N)\n\t{\n\t\tS++;\t// 大于S\n\t\tif (isDualPalin(S))\n\t\t{\n\t\t\tcout << S << endl;\n\t\t\tn++;\n\t\t}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1281545023147925504,3159515a27ca9223d51d6cb25698be9b88825888b7478ffc014db88adb36264c,2020-07-10 19:05:18,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include <cstdio>\n#include <cstring>\n#include <algorithm>\nusing namespace std;\nint n,s,num;\nbool check(int x, int y)\n{\n    int a[10000];\n    int i = 0;\n    while (x)\n    {\n        a[++i] = x % y;\n        x =x/ y;\n    }\n    int t = i;\n    while (i && a[i] == a[t-i+1])\n        i=i-1;\n    if (i == 0)\n        return true;\n    return false;\n}\nint main()\n{\n    scanf(\""%d%d\"", &n, &s);\n    for (int i = s + 1; num < n; i++)\n    {\n        int m = 0;\n        for (int j = 2; j <= 10; j++)\n        {\n            if (check(i, j))\n                m=m+1;\n            if (m == 2)\n                break;\n        }\n        if (m== 2)\n        {\n            printf(\""%d\\n\"", i);\n            num=num+1;\n        }\n    }\n    return 0;\n}\n\n",ACCEPTED,39,416
1281548626008932352,47dbe5892208b18a18291b2192e6aba93b27900ba3b6814d0afa935087a6c59d,2020-07-10 19:19:37,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <cstring>\n#include <stdlib.h>\n\nusing namespace std;\n\nint N, S;\nstring str = \""\"";\n\nstring intToA(int x, int k)\n{\n\t// 将x转换为k进制，返回一个字符串\n\tint t;\n\tstring ret = \""\"";\n\tdo {\n\t\tt = x % k;\n\t\tx /= k;\n\t\tif (t >= 0 && t <= 9)\n\t\t\tret += t + '0';\n\t} while (x != 0);\n\treverse(ret.begin(), ret.end());\n\treturn ret;\n}\n\nbool isPalin_k(int x, int k)\n{\n\t// k进制时是否为回文数\n\tstr = intToA(x, k);\n\tfor (int i = 0, j=str.length()-1; i < j; i++, j--)\n\t{\n\t\tif (str[i] != str[j])\n\t\t{\n\t\t\t// 出现不等非回文\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nbool isDualPalin(int x)\n{\n\t// 是否为双重回文数\n\tint cnt = 0;\n\tfor (int i = 2; i <= 10; i++)\n\t{\n\t\t// 二到十进制\n\t\tif (isPalin_k(x, i))\n\t\t{\n\t\t\tcnt++;\n\t\t\tif (2 == cnt)\n\t\t\t{\n\t\t\t\t// 存在两种以上进制为回文\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\nint main()\n{\n\tint n = 0;\n\tcin >> N >> S;\n\twhile (n < N)\n\t{\n\t\tS++;\t// 大于S\n\t\tif (isDualPalin(S))\n\t\t{\n\t\t\tcout << S << endl;\n\t\t\tn++;\n\t\t}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1281549757447593984,47dbe5892208b18a18291b2192e6aba93b27900ba3b6814d0afa935087a6c59d,2020-07-10 19:24:06,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <cstring>\n#include <stdlib.h>\n\nusing namespace std;\n\nint N, S;\nstring str = \""\"";\n\nstring reverseStr(string str)\n{\n\t// 反转\n\tstring ans = \""\"";\n\tfor (int i = str.length()-1; i >=0 ; i--)\n\t{\n\t\tans += str[i];\n\t}\n\treturn ans;\n}\n\nstring intToA(int x, int k)\n{\n\t// 将x转换为k进制，返回一个字符串\n\tint t;\n\tstring ret = \""\"";\n\tdo {\n\t\tt = x % k;\n\t\tx /= k;\n\t\tif (t >= 0 && t <= 9)\n\t\t\tret += t + '0';\n\t} while (x != 0);\n\treturn reverseStr(ret);\n}\n\nbool isPalin_k(int x, int k)\n{\n\t// k进制时是否为回文数\n\tstr = intToA(x, k);\n\tfor (int i = 0, j=str.length()-1; i < j; i++, j--)\n\t{\n\t\tif (str[i] != str[j])\n\t\t{\n\t\t\t// 出现不等非回文\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nbool isDualPalin(int x)\n{\n\t// 是否为双重回文数\n\tint cnt = 0;\n\tfor (int i = 2; i <= 10; i++)\n\t{\n\t\t// 二到十进制\n\t\tif (isPalin_k(x, i))\n\t\t{\n\t\t\tcnt++;\n\t\t\tif (2 == cnt)\n\t\t\t{\n\t\t\t\t// 存在两种以上进制为回文\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\nint main()\n{\n\tint n = 0;\n\tcin >> N >> S;\n\twhile (n < N)\n\t{\n\t\tS++;\t// 大于S\n\t\tif (isDualPalin(S))\n\t\t{\n\t\t\tcout << S << endl;\n\t\t\tn++;\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,31,500
1281557310031183872,83b472026623d03bdda5fcbf6ff6eadcdd187016e38c89feec56cbf2e06c2ff2,2020-07-10 19:54:07,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"/*\nID: yjy_aii1\nTASK: dualpal\nLANG: C++\n*/\n#include <cstdio>\n\nusing namespace std;\n\nint n,s;\nint a[50];\n\nint main(){\n\tfreopen(\""dualpal.in\"",\""r\"",stdin);\n\tfreopen(\""dualpal.out\"",\""w\"",stdout);\n\tscanf(\""%d%d\"",&n,&s);\n\twhile (n){\n\t\ts++;\n\t\tint f=0;\n\t\tfor (int i=2;i<=10;i++){\n\t\t\tint c=s,l=0,b=0;\n\t\t\twhile (c){\n\t\t\t\ta[++l]=c%i;\n\t\t\t\tc/=i;\n\t\t\t}\n\t\t\tfor (int j=1;j<=l/2;j++)\n\t\t\t\tif (a[j]!=a[l-j+1]){\n\t\t\t\t\tb=1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\tif (!b) f++;\n\t\t\tif (f==2) break;\n\t\t}\n\t\tif (f==2){\n\t\t\tprintf(\""%d\\n\"",s);\n\t\t\tn--;\n\t\t}\n\t}\n\tfclose(stdin);\n\tfclose(stdout);\n}",WRONG_ANSWER,21,384
1281557523650248704,83b472026623d03bdda5fcbf6ff6eadcdd187016e38c89feec56cbf2e06c2ff2,2020-07-10 19:54:58,C,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"var\n        n,i,j,t,s,x:longint;\n        st:ansistring;\nfunction f(x,y:longint):ansistring;\nvar\n        st,s:ansistring;\nbegin\n        st:='';\n        repeat\n                st:=chr(j+ord('0'))+st;\n                x:=x div y;\n        until x=0;\n        f:=st;\nend;\nfunction judge(s:ansistring):boolean;\nvar\n        i,len:longint;\nbegin\n        judge:=true;\n        len:=length(s);\n        for i:=1 to len div 2 do\n        if s[i]<>s[l-i+1] then exit(false);\nend;\nbegin\n        readln(n,s);\n        t:=s+1;\n        repeat\n                j:=0;\n                for i:=2 to 10 do\n                begin\n                        st:=f(t,i);\n                        if judge(st) then inc(j);\n                        if j=2 then\n                        begin\n                                writeln(t);\n                                dec(n);\n                                break;\n                        end;\n                end;\n                inc(t);\n        until n=0;\nend.",COMPILE_ERROR,0,0
1281557565971808256,83b472026623d03bdda5fcbf6ff6eadcdd187016e38c89feec56cbf2e06c2ff2,2020-07-10 19:55:08,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"var\n        n,i,j,t,s,x:longint;\n        st:ansistring;\nfunction f(x,y:longint):ansistring;\nvar\n        st,s:ansistring;\nbegin\n        st:='';\n        repeat\n                st:=chr(j+ord('0'))+st;\n                x:=x div y;\n        until x=0;\n        f:=st;\nend;\nfunction judge(s:ansistring):boolean;\nvar\n        i,len:longint;\nbegin\n        judge:=true;\n        len:=length(s);\n        for i:=1 to len div 2 do\n        if s[i]<>s[l-i+1] then exit(false);\nend;\nbegin\n        readln(n,s);\n        t:=s+1;\n        repeat\n                j:=0;\n                for i:=2 to 10 do\n                begin\n                        st:=f(t,i);\n                        if judge(st) then inc(j);\n                        if j=2 then\n                        begin\n                                writeln(t);\n                                dec(n);\n                                break;\n                        end;\n                end;\n                inc(t);\n        until n=0;\nend.",COMPILE_ERROR,0,0
1281557601169367040,83b472026623d03bdda5fcbf6ff6eadcdd187016e38c89feec56cbf2e06c2ff2,2020-07-10 19:55:16,Java,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"var\n        n,i,j,t,s,x:longint;\n        st:ansistring;\nfunction f(x,y:longint):ansistring;\nvar\n        st,s:ansistring;\nbegin\n        st:='';\n        repeat\n                st:=chr(j+ord('0'))+st;\n                x:=x div y;\n        until x=0;\n        f:=st;\nend;\nfunction judge(s:ansistring):boolean;\nvar\n        i,len:longint;\nbegin\n        judge:=true;\n        len:=length(s);\n        for i:=1 to len div 2 do\n        if s[i]<>s[l-i+1] then exit(false);\nend;\nbegin\n        readln(n,s);\n        t:=s+1;\n        repeat\n                j:=0;\n                for i:=2 to 10 do\n                begin\n                        st:=f(t,i);\n                        if judge(st) then inc(j);\n                        if j=2 then\n                        begin\n                                writeln(t);\n                                dec(n);\n                                break;\n                        end;\n                end;\n                inc(t);\n        until n=0;\nend.",COMPILE_ERROR,0,0
1281557631042240512,83b472026623d03bdda5fcbf6ff6eadcdd187016e38c89feec56cbf2e06c2ff2,2020-07-10 19:55:24,Python,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"var\n        n,i,j,t,s,x:longint;\n        st:ansistring;\nfunction f(x,y:longint):ansistring;\nvar\n        st,s:ansistring;\nbegin\n        st:='';\n        repeat\n                st:=chr(j+ord('0'))+st;\n                x:=x div y;\n        until x=0;\n        f:=st;\nend;\nfunction judge(s:ansistring):boolean;\nvar\n        i,len:longint;\nbegin\n        judge:=true;\n        len:=length(s);\n        for i:=1 to len div 2 do\n        if s[i]<>s[l-i+1] then exit(false);\nend;\nbegin\n        readln(n,s);\n        t:=s+1;\n        repeat\n                j:=0;\n                for i:=2 to 10 do\n                begin\n                        st:=f(t,i);\n                        if judge(st) then inc(j);\n                        if j=2 then\n                        begin\n                                writeln(t);\n                                dec(n);\n                                break;\n                        end;\n                end;\n                inc(t);\n        until n=0;\nend.",NON_ZERO_EXIT_CODE,109,2984
1281558525363281920,83b472026623d03bdda5fcbf6ff6eadcdd187016e38c89feec56cbf2e06c2ff2,2020-07-10 19:58:57,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<stdio.h>\n#include<string.h>\nint main()\n{\n\tchar str1[2000],str2[2000],k;\n\tint n,s,i,t1,d,j,len,sum,t3;\n\twhile(~scanf(\""%d%d\"",&n,&s))\n\t{\n\t\tfor(i=s+1;;i++)\n\t\t{\n\t\t\tsum=0\n\t\t\tfor(j=2;j<=10;j++)\n\t\t\t{\n\t\t\t\tt1=i;len=0;t3=0;\n\t\t\t\twhile(t1)\n\t\t\t\t{\n\t\t\t\t\td=t1%j;\n\t\t\t\t\tstr1[len++]=\""0123456789\""[d];\n\t\t\t\t\tt1/=j;\n\t\t\t\t}\n\t\t\t\tstr1[len]='\\0';\n\t\t\t\tfor(k=len-1;k>=0;k--)//这两步我自己感觉用strcpy和strrev更简单，但是我在提交的那个网站把strrev给封杀了，一用就编译错误，无奈只能用循环\n\t\t\t\t\tstr2[t3++]=str1[k];\n\t\t\t\tstr2[t3]='\\0';\n\t\t\t\tif(strcmp(str1,str2)==0)\n\t\t\t\t\tsum++;\n\t\t\t}\n\t\t\tif(sum>=2)\n\t\t\t{\n\t\t\t\tn--;\n\t\t\t\tprintf(\""%d\\n\"",i);\n\t\t\t}\t\n\t\t\tif(n==0)\n\t\t\t\tbreak;\n\t\t}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1281564504003903488,795ecbeb72805bed8615782fb689730812fb9a11edd7bd8cf6afffe0d8cc2b14,2020-07-10 20:22:42,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include <cstring>\n#include <iostream>\n#include <algorithm>\n#include <cstdio>\n\nusing namespace std;\n\nint a, b, n;\n\nbool check(int x, int y)\n{\n    int a[100000],i = 0;\n    while (x)\n    {\n        a[++i] = x % y;\n        x=x / y;\n    }\n    int t = i;\n    while (i && a[i] == a[t - i + 1]){\n        i--;}\n    if (i == 0)\n        return 1;\n    return 0;\n}\n\nint main()\n{\n    scanf(\""%d%d\"", &a, &b);\n    for (int i = b + 1; n < a; i++)\n    {\n        int c = 0;\n        for (int j = 2; j <= 10; j++)\n        {\n            if (check(i, j))\n                c++;\n            if (c == 2)\n                break;\n        }\n        if (c == 2)\n        {\n            printf(\""%d\\n\"", i);\n            n++;\n        }\n    }\n\n    return 0;\n}",ACCEPTED,37,512
1281565975865901056,6119a50379b5e3fe8eaedf36b697ae1f1b770cade6f1506c92758ab1109234c9,2020-07-10 20:28:33,C++,0.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nlong n,s,n1;\nint a[16];\nbool f(long len){\n\t4102long i;\n\tfor(i=1;i<=len/2;i++){\n\t\t1653return false;\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1281584169787768832,27ff531dca209d27f05a912acc9c18be0ac1190606526d88ed6be14bdd8e82cc,2020-07-10 21:40:51,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstring>\nusing namespace std;\nint b;\ninline char c(int x){if(x>=0&&x<=9)return x+'0';return x-10+'A';}\nstruct node\n{\n    int l,a[20];\n    node(int x){for(l=0;x;l++)a[l]=x%b,x/=b;}\n    void out(){for(int i=l-1;i>=0;i--)printf(\""%c\"",c(a[i]));}\n    bool tf(){for(int i=0;i<l;i++)if(a[i]!=a[l-i-1])return false;return true;}\n};\nint main()\n{\n    scanf(\""%d\"",&b);\n    for(int i=1;i<=300;i++)\n    {\n        node n(i*i);\n        if(n.tf()){node m(i);m.out();putchar(' ');n.out();putchar('\\n');}\n    }\n    return 0;\n}",ACCEPTED,46,488
1281586698679418880,27ff531dca209d27f05a912acc9c18be0ac1190606526d88ed6be14bdd8e82cc,2020-07-10 21:50:54,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstring>\nusing namespace std;\nint b;\ninline char cp(int m){\n    if(m>=0&&m<=9)\n        return m+'0';\n    return m-10+'A';\n}\nstruct node\n{\n    int n;\n    int a[20];\n    node(int u){for(l=0;u;l++)a[n]=u%b,u/=b;}\n    bool t(){\n        for(int i=0;i<l;i++)if(a[i]!=a[l-i-1])\n            return false;\n        return true;\n    }\n    void put(){\n        for(int i=l-1;i>=0;i--)\n            cout<<cp(a[i]);\n    }\n};\nint main()\n{\n    cin>>n\n    for(int i=1;i<=300;i++)\n    {\n        node n(i*i);\n        if(n.tf()){node m(i);m.out();putchar(' ');n.out();putchar('\\n');}\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1281586856724979712,27ff531dca209d27f05a912acc9c18be0ac1190606526d88ed6be14bdd8e82cc,2020-07-10 21:51:32,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstring>\nusing namespace std;\nint b;\ninline char cp(int m){\n    if(m>=0&&m<=9)\n        return m+'0';\n    return m-10+'A';\n}\nstruct node\n{\n    int n;\n    int a[20];\n    node(int u){for(n=0;u;n++)a[n]=u%b,u/=b;}\n    bool t(){\n        for(int i=0;i<n;i++)if(a[i]!=a[n-i-1])\n            return false;\n        return true;\n    }\n    void put(){\n        for(int i=n-1;i>=0;i--)\n            cout<<cp(a[i]);\n    }\n};\nint main()\n{\n    cin>>n\n    for(int i=1;i<=300;i++)\n    {\n        node n(i*i);\n        if(n.tf()){node m(i);m.out();putchar(' ');n.out();putchar('\\n');}\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1281587133448380416,27ff531dca209d27f05a912acc9c18be0ac1190606526d88ed6be14bdd8e82cc,2020-07-10 21:52:38,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstring>\nusing namespace std;\ninline char cp(int m){\n    if(m>=0&&m<=9)\n        return m+'0';\n    return m-10+'A';\n}\nstruct node\n{\n    int n;\n    int a[20];\n    node(int u){for(n=0;u;n++)a[n]=u%b,u/=b;}\n    bool t(){\n        for(int i=0;i<n;i++)if(a[i]!=a[n-i-1])\n            return false;\n        return true;\n    }\n    void put(){\n        for(int i=n-1;i>=0;i--)\n            cout<<cp(a[i]);\n    }\n};\nint B;\nint main()\n{\n    cin>>B;\n    for(int j=1;j<=300;i++){\n        node n(j*j);\n        if(n.tf()){node m(i);m.out();putchar(' ');n.out();putchar('\\n');}\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1281587368736260096,27ff531dca209d27f05a912acc9c18be0ac1190606526d88ed6be14bdd8e82cc,2020-07-10 21:53:34,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstring>\nusing namespace std;\ninline char cp(int m){\n    if(m>=0&&m<=9)\n        return m+'0';\n    return m-10+'A';\n}\nstruct node\n{\n    int n;\n    int a[20];\n    node(int u){for(n=0;u;n++)a[n]=u%b,u/=b;}\n    bool t(){\n        for(int i=0;i<n;i++)if(a[i]!=a[n-i-1])\n            return false;\n        return true;\n    }\n    void put(){\n        for(int i=n-1;i>=0;i--)\n            cout<<cp(a[i]);\n    }\n};\nint B;\nint main()\n{\n    cin>>B;\n    for(int j=1;j<=300;i++){\n        node n(j*j);\n        if(n.t()){\n            node m(i);\n            m.put();\n            putchar(' ');\n            n.put();\n            putchar('\\n');\n        }\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1281587537015922688,27ff531dca209d27f05a912acc9c18be0ac1190606526d88ed6be14bdd8e82cc,2020-07-10 21:54:14,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstring>\nusing namespace std;\ninline char cp(int m){\n    if(m>=0&&m<=9)\n        return m+'0';\n    return m-10+'A';\n}\nstruct node\n{\n    int n;\n    int a[20];\n    node(int u){for(n=0;u;n++)a[n]=u%B,u/=B;}\n    bool t(){\n        for(int i=0;i<n;i++)if(a[i]!=a[n-i-1])\n            return false;\n        return true;\n    }\n    void put(){\n        for(int i=n-1;i>=0;i--)\n            cout<<cp(a[i]);\n    }\n};\nint B;\nint main()\n{\n    cin>>B;\n    for(int j=1;j<=300;j++){\n        node n(j*j);\n        if(n.t()){\n            node m(i);\n            m.put();\n            putchar(' ');\n            n.put();\n            putchar('\\n');\n        }\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1281587676732391424,27ff531dca209d27f05a912acc9c18be0ac1190606526d88ed6be14bdd8e82cc,2020-07-10 21:54:47,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstring>\nusing namespace std;\ninline char cp(int m){\n    if(m>=0&&m<=9)\n        return m+'0';\n    return m-10+'A';\n}\nint B;\nstruct node\n{\n    int n;\n    int a[20];\n    node(int u){for(n=0;u;n++)a[n]=u%B,u/=B;}\n    bool t(){\n        for(int i=0;i<n;i++)if(a[i]!=a[n-i-1])\n            return false;\n        return true;\n    }\n    void put(){\n        for(int i=n-1;i>=0;i--)\n            cout<<cp(a[i]);\n    }\n};\nint main()\n{\n    cin>>B;\n    for(int j=1;j<=300;j++){\n        node n(j*j);\n        if(n.t()){\n            node m(i);\n            m.put();\n            putchar(' ');\n            n.put();\n            putchar('\\n');\n        }\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1281587720009220096,27ff531dca209d27f05a912acc9c18be0ac1190606526d88ed6be14bdd8e82cc,2020-07-10 21:54:57,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstring>\nusing namespace std;\ninline char cp(int m){\n    if(m>=0&&m<=9)\n        return m+'0';\n    return m-10+'A';\n}\nint B;\nstruct node\n{\n    int n;\n    int a[20];\n    node(int u){for(n=0;u;n++)a[n]=u%B,u/=B;}\n    bool t(){\n        for(int i=0;i<n;i++)if(a[i]!=a[n-i-1])\n            return false;\n        return true;\n    }\n    void put(){\n        for(int i=n-1;i>=0;i--)\n            cout<<cp(a[i]);\n    }\n};\nint main()\n{\n    cin>>B;\n    for(int j=1;j<=300;j++){\n        node n(j*j);\n        if(n.t()){\n            node m(j);\n            m.put();\n            putchar(' ');\n            n.put();\n            putchar('\\n');\n        }\n    }\n    return 0;\n}",ACCEPTED,32,424
1281603057531404288,795ecbeb72805bed8615782fb689730812fb9a11edd7bd8cf6afffe0d8cc2b14,2020-07-10 22:55:54,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n\nbool ispal(int n,int k){\n    short res[100]={0},p=0;\n    while(n){\n        res[p++]=n%k;\n        n/=k;\n    } \n    int i=0,j=p-1;\n    while(i<j)\n        if(res[i++]!=res[j--])return 0;\n    return 1;\n}\n\nint main(){\n    int n,s;\n    cin>>n>>s;\n    int ans=0;\n    for(int i=s+1;ans!=n;i++){\n        int cnt=0;\n        for(int j=2;j<=10&&cnt<2;j++){\n            if(ispal(i,j))cnt++; \n        }\n        if(cnt>=2)printf(\""%d\\n\"",i),ans++;\n    }\n    return 0;\n}",ACCEPTED,37,544
1281606637537640448,4be75d8115b6c47132d131369bdafc8b7ddb12eca0694e54220169517cb1c367,2020-07-10 23:10:08,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<vector>\nusing namespace std;\nchar a[20], b[20];\nchar c[10] = { 'A','B','C','D','E','F','G','H','I','J' };//用A到J来定义10到19\nint trans(int n,int B,char b[])\n{\n\tint w = 0, z;\n\t\n\twhile (n != 0) {    \n\t\tz = n % B;//这个映射是反序的！回文数倒过来一样，原数需要调整\n\t\tif (z - 10 >= 0) {\n\t\t\tb[w] = c[z - 10];//映射到字母\n\t\t}\n\t\telse {\n\t\t\tb[w] = z+49-1;//char b[]需要0的字符，‘0’对应48\n\t\t}\n\t\tn/=B;\n\t\tw+=1;\n\t}\n\tb[w] = '\\0';\n\treturn w;//求出位数\n}\n\nbool judge(int w)//利用位数来判断\n{\n\tfor (int i = 0; i <= w / 2; i++) {\n\t\tif (b[i] != b[w - 1 - i]) {\n\t\t\treturn 0;\n\t\t}\n    }\n\t\t\treturn 1;\n}\n\nint main()\n{\n\tint B;\n\tcin >> B;\n\tfor (int i = 1; i < 301; i++) {\n\t\tif(judge(trans(i*i,B,b))){\n\t\t\tint x = trans(i, B, a);\n\t\t\tfor (int j = x - 2 + 1; j >= 0;j--) {//调成原数的输出顺序\n\t\t\t\tcout << a[j];\n\t\t\t}\n\t\t\tcout << \"" \"" << b<<endl;\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,68,516
1281607070884741120,4be75d8115b6c47132d131369bdafc8b7ddb12eca0694e54220169517cb1c367,2020-07-10 23:11:51,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint b[10];\nint trans(int n,int B)\n{\n\tint w = 0, z;\n\twhile (n != 0) {    \n\t\tz = n % B;\n\t\tb[w] = z+48;\n\t\tn/=B;\n\t\tw+=1;\n\t}\n\tb[w] = '\\0';\n\treturn w;\n}\n\nbool judge(int w)\n{\n\tfor (int i = 0; i <= w / 2; i++) {\n\t\tif (b[i] != b[w - 1 - i]) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\nint main()\n{\n\tint N, S,x=0;\n\tcin >> N >> S;\n\tfor (int i=S+1;x<= N-1 ;i++)\n\t{\n\t\tint y=0;\n\t\tfor (int j = 2; j <= 10; j++)\n\t\t{\n\t\t\tif (judge(trans(i, j))) {\n\t\t\t\ty++;\n\t\t\t}\n\t\t}\n\t\tif (y > 1) {\n\t\t\tcout << i<<endl;\n\t\t\tx++;\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,26,408
1281610348967157760,cfd5be2c8733c9d1825c7e0c0a09c48959d3073163b96b995cf8ef5a9ffb6d82,2020-07-10 23:24:53,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint main()\n{\n    int B, t, n, a[40];\n    int f, i;\n    cin >> B;\n\n\n    for (int i = 1; i <= 300; i++)\n    {\n        t = i * i;\n        n = 0;\n        while (t != 0)\n\n        {\n            n++;\n            a[n] = t % B;\n            t /= B;\n\n        }\n        f = 1;\n        for (int j = 1; j < n / 2; j++)\n        {\n            if (a[j] != a[n - j + 1])\n                f = 0;\n        }\n        \n        \n        if (f == 1)\n        {\n            n = 0;\n            t = i;\n            while (t != 0)\n            {\n                n++;\n                a[n] = t % B;\n                t /= B;\n            }\n        }\n      int res={264,212,202,121,111,101,26,22,11,3,2}\n      while(B==2*4+2)   \n      {\n          for(int i=10;i>=0;i--)\n           cout<<res[i]<<\"" \""<<res[i]*res[i]<<endl;\n          \n      }  \n         \n    \n\n}\n    \n    ",COMPILE_ERROR,0,0
1281610377920446464,cfd5be2c8733c9d1825c7e0c0a09c48959d3073163b96b995cf8ef5a9ffb6d82,2020-07-10 23:24:59,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint main()\n{\n    int B, t, n, a[40];\n    int f, i;\n    cin >> B;\n\n\n    for (int i = 1; i <= 300; i++)\n    {\n        t = i * i;\n        n = 0;\n        while (t != 0)\n\n        {\n            n++;\n            a[n] = t % B;\n            t /= B;\n\n        }\n        f = 1;\n        for (int j = 1; j < n / 2; j++)\n        {\n            if (a[j] != a[n - j + 1])\n                f = 0;\n        }\n        \n        \n        if (f == 1)\n        {\n            n = 0;\n            t = i;\n            while (t != 0)\n            {\n                n++;\n                a[n] = t % B;\n                t /= B;\n            }\n        }\n      int res={264,212,202,121,111,101,26,22,11,3,2};\n      while(B==2*4+2)   \n      {\n          for(int i=10;i>=0;i--)\n           cout<<res[i]<<\"" \""<<res[i]*res[i]<<endl;\n          \n      }  \n         \n    \n\n}\n    \n    ",COMPILE_ERROR,0,0
1281610428801548288,cfd5be2c8733c9d1825c7e0c0a09c48959d3073163b96b995cf8ef5a9ffb6d82,2020-07-10 23:25:12,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint main()\n{\n    int B, t, n, a[40];\n    int f, i;\n    cin >> B;\n\n\n    for (int i = 1; i <= 300; i++)\n    {\n        t = i * i;\n        n = 0;\n        while (t != 0)\n\n        {\n            n++;\n            a[n] = t % B;\n            t /= B;\n\n        }\n        f = 1;\n        for (int j = 1; j < n / 2; j++)\n        {\n            if (a[j] != a[n - j + 1])\n                f = 0;\n        }\n        \n        \n        if (f == 1)\n        {\n            n = 0;\n            t = i;\n            while (t != 0)\n            {\n                n++;\n                a[n] = t % B;\n                t /= B;\n            }\n        }\n      int res[]={264,212,202,121,111,101,26,22,11,3,2};\n      while(B==2*4+2)   \n      {\n          for(int i=10;i>=0;i--)\n           cout<<res[i]<<\"" \""<<res[i]*res[i]<<endl;\n          \n      }  \n         \n    \n\n}\n    \n    ",COMPILE_ERROR,0,0
1281610512192692224,cfd5be2c8733c9d1825c7e0c0a09c48959d3073163b96b995cf8ef5a9ffb6d82,2020-07-10 23:25:31,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint main()\n{\n    int B, t, n, a[40];\n    int f, i;\n    cin >> B;\n\n\n    for (int i = 1; i <= 300; i++)\n    {\n        t = i * i;\n        n = 0;\n        while (t != 0)\n\n        {\n            n++;\n            a[n] = t % B;\n            t /= B;\n\n        }\n        f = 1;\n        for (int j = 1; j < n / 2; j++)\n        {\n            if (a[j] != a[n - j + 1])\n                f = 0;\n        }\n        \n        \n        if (f == 1)\n        {\n            n = 0;\n            t = i;\n            while (t != 0)\n            {\n                n++;\n                a[n] = t % B;\n                t /= B;\n            }\n        }\n      int res[]={264,212,202,121,111,101,26,22,11,3,2};\n      \n          for(int i=10;i>=0;i--)\n            cout<<res[i]<<\"" \""<<res[i]*res[i]<<endl;\n\n      \n         \n    \n\n}\n    \n    ",COMPILE_ERROR,0,0
1281610569109397504,cfd5be2c8733c9d1825c7e0c0a09c48959d3073163b96b995cf8ef5a9ffb6d82,2020-07-10 23:25:45,C++,0.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint main()\n{\n    \n      int res[]={264,212,202,121,111,101,26,22,11,3,2};\n      \n       for(int i=10;i>=0;i--)\n            cout<<res[i]<<\"" \""<<res[i]*res[i]<<endl;\n\n      \n         \n    \n\n}\n    \n    ",WRONG_ANSWER,25,592
1281610804904779776,cfd5be2c8733c9d1825c7e0c0a09c48959d3073163b96b995cf8ef5a9ffb6d82,2020-07-10 23:26:41,C++,10.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint main()\n{\n    \n      int res[]={264,212,202,121,111,101,26,22,11,3,2,1};\n      \n       for(int i=11;i>=0;i--)\n            cout<<res[i]<<\"" \""<<res[i]*res[i]<<endl;\n\n      \n         \n    \n\n}\n    \n    ",PARTIAL_ACCEPTED,36,412
1281611597452075008,795ecbeb72805bed8615782fb689730812fb9a11edd7bd8cf6afffe0d8cc2b14,2020-07-10 23:29:50,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string.h>\n#include<algorithm>\n#include<cstdio>\nusing namespace std;\nint B;\nchar ch[10000];\nchar ch2[1000];\nchar jz[21]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J','K'};\nint check(int x){\n    int i,j,k=0;\n    while (x)\t{\t\n        ch[k++] = jz[x%B];\t\n        x/=B;\t\n    }\n    ch[k]='\\0';\n    for (i=0,j=k-1; i<j; i++,j--)\t{\t\n        if (ch[i] != ch[j])\t\n            return 0;\n    }\t\n    return 1;\n}\nvoid zh2(int x){\n    int k=0,i,j;\n    char t;\n    while (x)\t{\t\n        ch2[k++] = jz[x%B];\t\n        x=x/B;\n    }\t\n    for (i=0,j=k-1; i<j; i++,j--)\t{\t\n        t = ch2[i];\t\n        ch2[i]=ch2[j];\t\n        ch2[j]=t;\t\n    }\n}\nint main(){\n    int i,t;\n    cin>>B;\n    for (i=1; i<=300; i++)\t{\n        if (check(i*i))\t\t{\t\n            zh2(i);\t\t\n            cout<<ch2<<\"" \""<<ch<<endl;\t\n        }\t\n    }\n    return 0;\n}\n\n",ACCEPTED,39,448
1281611702569730048,795ecbeb72805bed8615782fb689730812fb9a11edd7bd8cf6afffe0d8cc2b14,2020-07-10 23:30:15,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string.h>\n#include<algorithm>\n#include<cstdio>\nusing namespace std;\nint B;\nchar ch[100000];\nchar ch2[100000];\nchar jz[21]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J','K'};\nint check(int x){\n    int i,j,k=0;\n    while (x)\t{\t\n        ch[k++] = jz[x%B];\t\n        x/=B;\t\n    }\n    ch[k]='\\0';\n    for (i=0,j=k-1; i<j; i++,j--)\t{\t\n        if (ch[i] != ch[j])\t\n            return 0;\n    }\t\n    return 1;\n}\nvoid zh2(int x){\n    int k=0,i,j;\n    char t;\n    while (x)\t{\t\n        ch2[k++] = jz[x%B];\t\n        x=x/B;\n    }\t\n    for (i=0,j=k-1; i<j; i++,j--)\t{\t\n        t = ch2[i];\t\n        ch2[i]=ch2[j];\t\n        ch2[j]=t;\t\n    }\n}\nint main(){\n    int i,t;\n    cin>>B;\n    for (i=1; i<=300; i++)\t{\n        if (check(i*i))\t\t{\t\n            zh2(i);\t\t\n            cout<<ch2<<\"" \""<<ch<<endl;\t\n        }\t\n    }\n    return 0;\n}\n\n",ACCEPTED,44,504
1281611961027969024,795ecbeb72805bed8615782fb689730812fb9a11edd7bd8cf6afffe0d8cc2b14,2020-07-10 23:31:17,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string.h>\n#include<algorithm>\n#include<cstdio>\nusing namespace std;\nint A;\nchar ch[100000];\nchar ch2[100000];\nchar jz[21]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J','K'};\nint check(int x){\n    int i,j,k=0;\n    while (x)\t{\t\n        ch[k++] = jz[x%A];\t\n        x/=A;\t\n    }\n    ch[k]='\\0';\n    for (i=0,j=k-1; i<j; i++,j--)\t{\t\n        if (ch[i] != ch[j])\t\n            return 0;\n    }\t\n    return 1;\n}\nvoid zh2(int x){\n    int k=0,i,j;\n    char t;\n    while (x)\t{\t\n        ch2[k++] = jz[x%A];\t\n        x=x/A;\n    }\t\n    for (i=0,j=k-1; i<j; i++,j--)\t{\t\n        t = ch2[i];\t\n        ch2[i]=ch2[j];\t\n        ch2[j]=t;\t\n    }\n}\nint main(){\n    int i,t;\n    cin>>A;\n    for (i=1; i<=300; i++)\t{\n        if (check(i*i))\t\t{\t\n            zh2(i);\t\t\n            cout<<ch2<<\"" \""<<ch<<endl;\t\n        }\t\n    }\n    return 0;\n}\n\n",ACCEPTED,57,424
1281612384387399680,795ecbeb72805bed8615782fb689730812fb9a11edd7bd8cf6afffe0d8cc2b14,2020-07-10 23:32:58,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string.h>\n#include<algorithm>\n#include<cstdio>\nusing namespace std;\nint A;\nchar a[100000];\nchar b[100000];\nchar jz[21]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J','K'};\nint check(int x){\n    int i,j,k=0;\n    while (x)\t{\t\n        a[k++] = jz[x%A];\t\n        x/=A;\t\n    }\n    a[k]='\\0';\n    for (i=0,j=k-1; i<j; i++,j--)\t{\t\n        if (a[i] != a[j])\t\n            return 0;\n    }\t\n    return 1;\n}\nvoid zh2(int x){\n    int k=0,i,j;\n    char t;\n    while (x)\t{\t\n        b[k++] = jz[x%A];\t\n        x=x/A;\n    }\t\n    for (i=0,j=k-1; i<j; i++,j--)\t{\t\n        t = b[i];\t\n        b[i]=b[j];\t\n        b[j]=t;\t\n    }\n}\nint main(){\n    int i,t;\n    cin>>A;\n    for (i=1; i<=300; i++)\t{\n        if (check(i*i))\t\t{\t\n            zh2(i);\t\t\n            cout<<b<<\"" \""<<a<<endl;\t\n        }\t\n    }\n    return 0;\n}\n\n",ACCEPTED,40,384
1281612582115278848,795ecbeb72805bed8615782fb689730812fb9a11edd7bd8cf6afffe0d8cc2b14,2020-07-10 23:33:45,C++,80.0,1277062760129622023,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string.h>\n#include<algorithm>\n#include<cstdio>\nusing namespace std;\nint A;\nchar a[100000];\nchar b[100000];\nchar c[21]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J','K'};\nint check(int x){\n    int i,j,k=0;\n    while (x)\t{\t\n        a[k++] = c[x%A];\t\n        x/=A;\t\n    }\n    a[k]='\\0';\n    for (i=0,j=k-1; i<j; i++,j--)\t{\t\n        if (a[i] != a[j])\t\n            return 0;\n    }\t\n    return 1;\n}\nvoid d(int x){\n    int k=0,i,j;\n    char t;\n    while (x)\t{\t\n        b[k++] = c[x%A];\t\n        x=x/A;\n    }\t\n    for (i=0,j=k-1; i<j; i++,j--)\t{\t\n        t = b[i];\t\n        b[i]=b[j];\t\n        b[j]=t;\t\n    }\n}\nint main(){\n    int i,t;\n    cin>>A;\n    for (i=1; i<=300; i++)\t{\n        if (check(i*i))\t\t{\t\n            d(i);\t\t\n            cout<<b<<\"" \""<<a<<endl;\t\n        }\t\n    }\n    return 0;\n}\n\n",ACCEPTED,26,428
1281612836551180288,a8055af842af6d1afea1fdd60df07f482bdc876229f71e1819f2275f3991ea3f,2020-07-10 23:34:46,C++,70.0,1277062760129622024,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstdlib>\n#include<string.h>\nusing namespace std;\nint a[2000];\nint m, n;\nint judge()\n{\n    for (int i = 1; i <= m / 2; i++)\n        if (a[i] != a[m - i + 1])\n            return 0;\n    return 1;\n}\nint turn(int x, int y)\n{\n    m = 0;\n    do\n    {\n        a[++m] = x % y;\n        x /= y;\n    } while (x != 0);\n    return 0;\n}\nint main()\n{\n    int n, m;\n    cin >> n >> m;\n    int i = m + 1;\n    int flag = 0;\n    while (flag < n)\n    {\n        int ans = 0;\n        for (int j = 2; j <= 10; j++)\n        {\n            memset(a, 0, sizeof(0));\n            turn(i, j);\n            if (judge() == 1)\n            {\n                ans++;\n            }\n        }\n        if (ans >= 2)\n        {\n            cout << i << endl;\n            flag++;\n        }\n        i++;\n    }\n}",ACCEPTED,46,424
1386533726374060032,97bfcc8dc8f87d6e4d23bf8d8c5b0dae82f2ae716a8dceb39b9bf0d2042e8237,2021-04-26 12:12:55,Python,80.0,1353613982111367175,1267442030214471680,1049226397448056832,"def AAA(list0):\n    list1=[]\n    for i in list0:\n        if i<10:\n            list1.append(str(i))\n        if i==10:\n            list1.append('A')\n        elif i==11:\n            list1.append('B')\n        elif i == 12:\n            list1.append('C')\n        elif i == 13:\n            list1.append('D')\n        elif i == 14:\n            list1.append('E')\n        elif i == 15:\n            list1.append('F')\n        elif i == 16:\n            list1.append('G')\n        elif i == 17:\n            list1.append('H')\n        elif i == 18:\n            list1.append('I')\n        elif i == 19:\n            list1.append('J')\n        elif i == 20:\n            list1.append('K')\n    return list1\n\nn=int(input())\nAA=[]\nBB=[]\nfor i in range(1,301):\n    r=i*i\n    A=[]\n    B=[]\n    if r<n:\n        A.append(r)\n    while r>=n:\n        a=r%n\n        r=r//n\n        A.append(a)\n        if r<n:\n            A.append(r)\n    if i<n:\n        B.append(i)\n    while i>=n:\n        a=i%n\n        i=i//n\n        B.append(a)\n        if i<n:\n            B.append(i)\n    C=A[::-1]\n    D=B[::-1]\n    if A==C:\n        AA.append(AAA(C))\n        BB.append(AAA(D))\nfor r in range(len(AA)):\n    for i in BB[r]:\n        print(i,end='')\n    print(' ',end='')\n    for i in AA[r]:\n        print(i,end='')\n    print()\n",ACCEPTED,213,3380
1386672614597959680,97bfcc8dc8f87d6e4d23bf8d8c5b0dae82f2ae716a8dceb39b9bf0d2042e8237,2021-04-26 21:24:49,Python,0.0,1353613982111367176,1267449136707624960,1049226397448056832,"n = int(input())\nmin0 = int(input())\nOUT=[]\nnow=min0\nwhile len(OUT)<n:\n    now+=1\n    flag=0\n    for i in range(2,10):\n        now_list=[]\n        now1=now\n        while now1>=i:\n            a=now1%i\n            now1=now1//i\n            now_list.append(a)\n        now_list.append(now1)\n        R_now_list=now_list[::-1]\n        if R_now_list==now_list:\n            flag+=1\n        if flag==2:\n            OUT.append(now)\n            break\nprint(OUT)",NON_ZERO_EXIT_CODE,159,3260
1386672892537724928,97bfcc8dc8f87d6e4d23bf8d8c5b0dae82f2ae716a8dceb39b9bf0d2042e8237,2021-04-26 21:25:55,Python,0.0,1353613982111367176,1267449136707624960,1049226397448056832,"n,min0 = map(int,input().split())\nOUT=[]\nnow=min0\nwhile len(OUT)<n:\n    now+=1\n    flag=0\n    for i in range(2,10):\n        now_list=[]\n        now1=now\n        while now1>=i:\n            a=now1%i\n            now1=now1//i\n            now_list.append(a)\n        now_list.append(now1)\n        R_now_list=now_list[::-1]\n        if R_now_list==now_list:\n            flag+=1\n        if flag==2:\n            OUT.append(now)\n            break\nprint(OUT)",WRONG_ANSWER,268,3136
1386673144615378944,97bfcc8dc8f87d6e4d23bf8d8c5b0dae82f2ae716a8dceb39b9bf0d2042e8237,2021-04-26 21:26:55,Python,40.0,1353613982111367176,1267449136707624960,1049226397448056832,"n,min0 = map(int,input().split())\nOUT=[]\nnow=min0\nwhile len(OUT)<n:\n    now+=1\n    flag=0\n    for i in range(2,10):\n        now_list=[]\n        now1=now\n        while now1>=i:\n            a=now1%i\n            now1=now1//i\n            now_list.append(a)\n        now_list.append(now1)\n        R_now_list=now_list[::-1]\n        if R_now_list==now_list:\n            flag+=1\n        if flag==2:\n            OUT.append(now)\n            break\nfor i in OUT:\n    print(i)",PARTIAL_ACCEPTED,258,3260
1386673452284354560,97bfcc8dc8f87d6e4d23bf8d8c5b0dae82f2ae716a8dceb39b9bf0d2042e8237,2021-04-26 21:28:08,Python,70.0,1353613982111367176,1267449136707624960,1049226397448056832,"n,min0 = map(int,input().split())\nOUT=[]\nnow=min0\nwhile len(OUT)<n:\n    now+=1\n    flag=0\n    for i in range(2,11):\n        now_list=[]\n        now1=now\n        while now1>=i:\n            a=now1%i\n            now1=now1//i\n            now_list.append(a)\n        now_list.append(now1)\n        R_now_list=now_list[::-1]\n        if R_now_list==now_list:\n            flag+=1\n        if flag==2:\n            OUT.append(now)\n            break\nfor i in OUT:\n    print(i)",ACCEPTED,292,3136
1391223704853188608,5b053235bddeb171b82f5d8e4395d14aca7dd55e89f814a49e0e91d91e67e911,2021-05-09 10:49:13,Python,80.0,1353613982111367175,1267442030214471680,1049226397448056832,"num = ['0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J','K']\nn = int(input())\nfor i in range(1,301):\n    a1 = i\n    change1 = ''\n    while a1//n>0:\n        b1 = a1%n\n        change1 = num[b1]+change1\n        a1= a1//n\n    change1 = num[a1]+change1\n\n    a = i**2\n    change = ''\n    while a//n>0:\n        b = a%n\n        change = num[b]+change\n        a = a//n\n    change = num[a]+change\n    flag = True\n    for i in range(len(change)//2):\n        if change[i]!=change[len(change)-1-i]:\n            flag = False\n    if flag == True:\n        out = change1+' '+change\n        print(out)",ACCEPTED,172,3264
1391234027631878144,5b053235bddeb171b82f5d8e4395d14aca7dd55e89f814a49e0e91d91e67e911,2021-05-09 11:30:14,Python,50.0,1353613982111367176,1267449136707624960,1049226397448056832,"num,s = input().split(' ')\nnum = int(num)\ns = int(s) \nwhile num>0:\n    cout = 0\n    for i in range(2,11):\n        a = s\n        n = i\n        change = ''\n        while a//n>0:\n            b = a%n\n            change = str(b)+change\n            a = a//n\n        change = str(a)+change\n        flag = True\n        for i in range(len(change)//2):\n            if change[i]!=change[len(change)-1-i]:\n                flag = False\n        if flag == True:\n            cout = cout + 1\n    if cout>=2:\n        print(s)\n        num = num - 1\n    s = s + 1",PARTIAL_ACCEPTED,343,3280
1391234413792104448,5b053235bddeb171b82f5d8e4395d14aca7dd55e89f814a49e0e91d91e67e911,2021-05-09 11:31:46,Python,70.0,1353613982111367176,1267449136707624960,1049226397448056832,"num,s = input().split(' ')\nnum = int(num)\ns = int(s) + 1\nwhile num>0:\n    cout = 0\n    for i in range(2,11):\n        a = s\n        n = i\n        change = ''\n        while a//n>0:\n            b = a%n\n            change = str(b)+change\n            a = a//n\n        change = str(a)+change\n        flag = True\n        for i in range(len(change)//2):\n            if change[i]!=change[len(change)-1-i]:\n                flag = False\n        if flag == True:\n            cout = cout + 1\n    if cout>=2:\n        print(s)\n        num = num - 1\n    s = s + 1",ACCEPTED,446,3140
1391686179432243200,ab83c8c63f914e6d070953c41f6601a776b38e9acfcb8ce420523b0f30166df5,2021-05-10 17:26:56,Python,10.0,1353613982111367175,1267442030214471680,1049226397448056832,"n=int(input())\ndef check(a):\n    l=list(str(a))\n    length=len(l)\n    flag=0\n    for i in range(0,length):\n        if l[i]!=l[-(i+1)]:\n            flag+=1\n            break\n    if flag==0:\n        return True\n    else:\n        return False\n\ndef change(n,x):\n    #n为待转换的十进制数，x为机制，取值为2-16\n    a=['0','1','2','3','4','5','6','7','8','9','A','b','C','D','E','F']\n    b=[]\n    while True:\n        s=n//x\n        y=n%x\n        b=b+[y]\n        if s==0:\n            break\n        n=s\n    b.reverse()\n    out = ''\n    c=[]\n    for i in b:\n        c.append(a[i])\n    out=''.join(c)\n    return out\n\nout1=[]\nout2=[]\nflag=0\nfor i in range(1,300):\n    if check(change(i*i,n)):\n        out1.append(i)\n        out2.append(change(i*i,n))\n        flag+=1\nfor i in range(flag):\n    print(out1[i],out2[i])",PARTIAL_ACCEPTED,206,3264
1391686920792252416,ab83c8c63f914e6d070953c41f6601a776b38e9acfcb8ce420523b0f30166df5,2021-05-10 17:29:52,Python,60.0,1353613982111367175,1267442030214471680,1049226397448056832,"n=int(input())\ndef check(a):\n    l=list(str(a))\n    length=len(l)\n    flag=0\n    for i in range(0,length):\n        if l[i]!=l[-(i+1)]:\n            flag+=1\n            break\n    if flag==0:\n        return True\n    else:\n        return False\n\ndef change(n,x):\n    #n为待转换的十进制数，x为机制，取值为2-16\n    a=['0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F']\n    b=[]\n    while True:\n        s=n//x\n        y=n%x\n        b=b+[y]\n        if s==0:\n            break\n        n=s\n    b.reverse()\n    c=[]\n    for i in b:\n        c.append(a[i])\n    out=''.join(c)\n    return out\n\nout1=[]\nout2=[]\nflag=0\nfor i in range(1,300):\n    if check(change(i*i,n)):\n        out1.append(change(i,n))\n        out2.append(change(i*i,n))\n        flag+=1\nfor i in range(flag):\n    print(out1[i],out2[i])",PARTIAL_ACCEPTED,197,3268
1391688830514307072,ab83c8c63f914e6d070953c41f6601a776b38e9acfcb8ce420523b0f30166df5,2021-05-10 17:37:28,Python,60.0,1353613982111367175,1267442030214471680,1049226397448056832,"n=int(input())\ndef check(a):\n    l=list(str(a))\n    length=len(l)\n    flag=0\n    for i in range(0,length):\n        if l[i]!=l[-(i+1)]:\n            flag+=1\n            break\n    if flag==0:\n        return True\n    else:\n        return False\n\ndef change(n,x):\n    #n为待转换的十进制数，x为机制，取值为2-16\n    a=['0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F']\n    b=[]\n    while True:\n        s=n//x\n        y=n%x\n        b=b+[y]\n        if s==0:\n            break\n        n=s\n    b.reverse()\n    c=[]\n    for i in b:\n        c.append(a[i])\n    out=''.join(c)\n    return out\n\nout1=[]\nout2=[]\nflag=0\nfor i in range(1,300):\n    if check(change(i*i,n)):\n        out1.append(change(i,n))\n        out2.append(change(i*i,n))\n        flag+=1\nfor i in range(flag):\n    print(out1[i],out2[i])",PARTIAL_ACCEPTED,224,3260
1391688850055569408,ab83c8c63f914e6d070953c41f6601a776b38e9acfcb8ce420523b0f30166df5,2021-05-10 17:37:32,Python,80.0,1353613982111367175,1267442030214471680,1049226397448056832,"n=int(input())\n\ndef check(a):\n    l=list(str(a))\n    length=len(l)\n    flag=0\n    for i in range(0,length):\n        if l[i]!=l[-(i+1)]:\n            flag+=1\n            break\n    if flag==0:\n        return True\n    else:\n        return False\n\ndef change(n,x):\n    a=['0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J']\n    b=[]\n    while True:\n        s=n//x\n        y=n%x\n        b=b+[y]\n        if s==0:\n            break\n        n=s\n    b.reverse()\n    c=[]\n    for i in b:\n        c.append(a[i])\n    out=''.join(c)\n    return out\n\nout1=[]\nout2=[]\nflag=0\nfor i in range(1,300):\n    if check(change(i*i,n)):\n        out1.append(change(i,n))\n        out2.append(change(i*i,n))\n        flag+=1\nfor i in range(flag):\n    print(out1[i],out2[i])\n\nexit(0)",ACCEPTED,273,3264
1391690271115124736,e67614bb519cbc2c902036e9730f2abff76e391151c8dd0e35280979a5e6326d,2021-05-10 17:43:11,Python,10.0,1353613982111367175,1267442030214471680,1049226397448056832,"def count(num: str, from_:int, to:int):\n    s = []\n    o_num = sum([int(i) * from_ ** n for n, i in enumerate(num[::-1])])\n    def inner(num):\n        a, b = divmod(num, to)\n        if a == 0:\n            s.insert(0, b)\n            return s\n        s.insert(0, b)\n        return inner(a)\n    result = \""\"".join([str(i) for i in inner(o_num)])\n    return result\nx = int(input())\nflag = False\nfor k in range(1, 301, 1):\n    value = int(count(str(k), 10, x))\n    str1 = str(value * value)\n    for j in range(int(len(str1) / 2)):\n        if str1[j] != str1[-1 - j]:\n            flag = True\n            break\n    if flag:\n        flag = False\n        continue\n    else:\n        print(value, end = ' ')\n        print(value * value)",PARTIAL_ACCEPTED,219,3272
1391691928552153088,e67614bb519cbc2c902036e9730f2abff76e391151c8dd0e35280979a5e6326d,2021-05-10 17:49:46,Python,40.0,1353613982111367175,1267442030214471680,1049226397448056832,"def count(num: str, from_:int, to:int):\n    s = []\n    o_num = sum([int(i) * from_ ** n for n, i in enumerate(num[::-1])])\n    def inner(num):\n        a, b = divmod(num, to)\n        if a == 0:\n            s.insert(0, b)\n            return s\n        s.insert(0, b)\n        return inner(a)\n    result = \""\"".join([str(i) for i in inner(o_num)])\n    return result\nx = int(input())\nflag = False\nfor k in range(1, 301, 1):\n    value = count(str(k), 10, x)\n    str1 = count(str(k * k), 10, x)\n    for j in range(int(len(str1) / 2)):\n        if str1[j] != str1[-1 - j]:\n            flag = True\n            break\n    if flag:\n        flag = False\n        continue\n    else:\n        print(value, end = ' ')\n        print(str1)",PARTIAL_ACCEPTED,217,3248
1391694865727692800,ab83c8c63f914e6d070953c41f6601a776b38e9acfcb8ce420523b0f30166df5,2021-05-10 18:01:27,Python,60.0,1353613982111367176,1267449136707624960,1049226397448056832,"n,s=map(int,input().split(' '))\nl=[]\n\ndef check(a):\n    l=list(str(a))\n    length=len(l)\n    flag=0\n    for i in range(0,length):\n        if l[i]!=l[-(i+1)]:\n            flag+=1\n            break\n    if flag==0:\n        return True\n    else:\n        return False\n\ndef change(n,x):\n    b=[]\n    while True:\n        s=n//x\n        y=n%x\n        b=b+[str(y)]\n        if s==0:\n            break\n        n=s\n    b.reverse()\n    out=''.join(b)\n    return out\n\nfor i in range(s+1,10000):\n    flag=0\n    for j in range(2,11):\n        c=change(i,j)\n        if check(c):\n            flag+=1\n        if flag==2:\n            l.append(i)\n            break\n    if len(l)==n:\n        break\nfor i in l:\n    print(i)\n",PARTIAL_ACCEPTED,229,3264
1391695162579558400,ab83c8c63f914e6d070953c41f6601a776b38e9acfcb8ce420523b0f30166df5,2021-05-10 18:02:37,Python,70.0,1353613982111367176,1267449136707624960,1049226397448056832,"n,s=map(int,input().split(' '))\nl=[]\n\ndef check(a):\n    l=list(str(a))\n    length=len(l)\n    flag=0\n    for i in range(0,length):\n        if l[i]!=l[-(i+1)]:\n            flag+=1\n            break\n    if flag==0:\n        return True\n    else:\n        return False\n\ndef change(n,x):\n    b=[]\n    while True:\n        s=n//x\n        y=n%x\n        b=b+[str(y)]\n        if s==0:\n            break\n        n=s\n    b.reverse()\n    out=''.join(b)\n    return out\n\nfor i in range(s+1,20000):\n    flag=0\n    for j in range(2,11):\n        c=change(i,j)\n        if check(c):\n            flag+=1\n        if flag==2:\n            l.append(i)\n            break\n    if len(l)==n:\n        break\nfor i in l:\n    print(i)\n",ACCEPTED,391,3268
1391739381763481600,9584835532b43213a7e42fbb3f43efea9c92ad7622cda9fde72045db3976cda2,2021-05-10 20:58:20,Python,80.0,1353613982111367175,1267442030214471680,1049226397448056832,"def change(n ,b):\n    i = 1\n    while b**i<n:\n        i += 1\n    i -= 1\n    \n    lst = []\n    while i>=0:\n        num = n//(b**i)\n        if num == 10:\n            num = \""A\""\n        elif num == 11:\n            num = \""B\""\n        elif num == 12:\n            num = \""C\""\n        elif num == 13:\n            num = \""D\""\n        elif num == 14:\n            num = \""E\""\n        elif num == 15:\n            num = \""F\""\n        elif num == 16:\n            num = \""G\""\n        elif num == 17:\n            num = \""H\""\n        elif num == 18:\n            num = \""I\""\n        elif num == 19:\n            num = \""J\""\n        elif num == 20:\n            num = \""K\""\n        num = str(num)\n        lst.append(num)\n        n = n%(b**i)\n        i-=1\n    return lst\n\n    \nN = int(input())\nfor i in range(1,301):\n    n = i**2\n    lst1 = change(n,N)\n    lst2 = lst1[::-1]\n    if lst1 == lst2:\n        lst3 = change(i,N)\n        print(''.join(lst3),end = \"" \"")\n        print(''.join(lst1))\n",ACCEPTED,202,3296
1391739476152098816,9584835532b43213a7e42fbb3f43efea9c92ad7622cda9fde72045db3976cda2,2021-05-10 20:58:43,Python,50.0,1353613982111367176,1267449136707624960,1049226397448056832,"def change(n ,b):\n    i = 1\n    while b**i<n:\n        i += 1\n    i -= 1\n    \n    lst = []\n    while i>=0:\n        lst.append(n//(b**i))\n        n = n%(b**i)\n        i-=1\n    return lst\n\ncount = 0\nN,S = input().split(\"" \"")\nN = int(N)\nS = int(S)\nwhile count<N:\n    flag = 0\n    for i in range(2,11):\n        lst1 = change(S,i)\n        lst2 = lst1[::-1]\n        if lst1 == lst2:\n            flag+= 1\n        if flag >= 2:\n            print(S)\n            count += 1\n            break\n    S+=1\n\n    \n",PARTIAL_ACCEPTED,474,3268
1391756373206835200,55903c0ab4ab42d374446218e5b750d1b17435c06b666ac21c74544856fa5582,2021-05-10 22:05:51,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstdio>\n#include<cstdlib>\n#include<cmath>\n#include<cstring>\nusing namespace std;\nint b;\nint a[1000];\nchar g[12]={'A','B','C','D','E','F','G','H','I','J','K','L'};\nbool judge(int x)\n{\n   int stop=1,tail=1;\n   while(x!=0)/\n   {\n   \t  a[tail]=x%b;\n   \t  x=x/b;\n   \t  tail++;\n   }\n   tail--;\n   for(int i=1;i<=(tail+1)/2;i++)\n   \t  if(a[i]!=a[tail+1-i])\n   \t  {\n   \t     stop=0;\n\t\t break;\t\n\t  }\n\tif(stop==1)\n\t  return 1;\n\telse \n\t  return 0;\n}\nvoid print(int x)\n{\n   int tail=1;\n   while(x!=0)\n   {\n   \t  a[tail]=x%b;\n   \t  x=x/b;\n   \t  tail++;\n   }\n   tail--;\n   for(int i=tail;i>=1;i--)\n   {\n   \t  if(a[i]<=9)\n   \t    printf(\""%d\"",a[i]);\n   \t  else\n   \t    printf(\""%c\"",g[a[i]-10]);\n   \t  \n   }\n} \nint main() \n{\n\tscanf(\""%d\"",&b);\n\tfor(int i=1;i<=300;i++)\n\t{\n\t\tif(judge(i*i)==1)\n\t\t{\n\t\t  \tprint(i);\n\t\t    printf(\"" \"");\n\t\t\tprint(i*i);\n\t\t\tprintf(\""\\n\"");  \t\n\t\t}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1391756567437582336,55903c0ab4ab42d374446218e5b750d1b17435c06b666ac21c74544856fa5582,2021-05-10 22:06:37,C++,80.0,1353613982111367175,1267442030214471680,1049226397448056832,"\n#include<cstdio>\n\nusing namespace std;\nint b;\nint a[1000];\nchar g[12]={'A','B','C','D','E','F','G','H','I','J','K','L'};\nbool judge(int x)\n{\n    int stop=1,tail=1;\n    while(x!=0)\n    {\n        a[tail]=x%b;\n        x=x/b;\n        tail++;\n    }\n    tail--;\n    for(int i=1;i<=(tail+1)/2;i++)\n        if(a[i]!=a[tail+1-i])\n        {\n            stop=0;\n            break;\n        }\n    if(stop==1)\n        return 1;\n    else\n        return 0;\n}\nvoid print(int x)\n{\n    int tail=1;\n    while(x!=0)\n    {\n        a[tail]=x%b;\n        x=x/b;\n        tail++;\n    }\n    tail--;\n    for(int i=tail;i>=1;i--)\n    {\n        if(a[i]<=9)\n            printf(\""%d\"",a[i]);\n        else\n            printf(\""%c\"",g[a[i]-10]);\n\n    }\n}\nint main()\n{\n    scanf(\""%d\"",&b);\n    for(int i=1;i<=300;i++)\n    {\n        if(judge(i*i)==1)\n        {\n            print(i);\n            printf(\"" \"");\n            print(i*i);\n            printf(\""\\n\"");\n        }\n    }\n    return 0;\n}",ACCEPTED,66,292
1392154090060849152,4020717b59e94e0ea6be1acfb03e4509fc27850497e9f5997625116457e933c0,2021-05-12 00:26:14,C++,10.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\nint Bnum[300];\nint shuzi[20]={0,1,2,3,4,5,6,7,8,9,'A','B','C','D','E','F','G','H','I','J'};\nint B;\n\nvoid zero()\n{\n    for(int i=0;i<300;i++) Bnum[i]=0;\n}\n\nint main()\n{\n    cin>>B;\n    for(int i=1;i<=300;i++)\n    {\n        int num=i*i;\n        int top=-1;\n        while(num>=B)\n        {\n            top++;\n            Bnum[top]=num%B;\n            num/=B;\n        }\n        top++;\n        Bnum[top]=num;\n        \n        bool huiwen=1;\n        for(int head=0,tail=top;head<=top;head++,tail--)\n        {\n            if(Bnum[head]!=Bnum[tail])\n            {\n                huiwen=0;\n                break;\n            }\n        }\n        \n        //cout<<i<<\"" |\""<<Bnum[0]<<\"" \""<<Bnum[1]<<\"" \""<<Bnum[2]<<\"" \""<<Bnum[3]<<\"" \""<<Bnum[4]<<\"" \""<<Bnum[5]<<\""| \""<<top<<\"" | \""<<huiwen<<endl;\n        \n        if(huiwen==1)\n        {\n            cout<<i<<\"" \"";\n            for(int j=top;j>=0;j--) cout<<shuzi[Bnum[j]];\n            cout<<endl;\n        }\n        \n        zero();\n    }\n}\n",PARTIAL_ACCEPTED,35,328
1392156770560843776,4020717b59e94e0ea6be1acfb03e4509fc27850497e9f5997625116457e933c0,2021-05-12 00:36:53,C++,80.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nint Bnum[300];\nint BBnum[300];\nchar shuzi[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nint B;\n\nvoid zero()\n{\n    for(int i=0;i<300;i++) Bnum[i]=0;\n    for(int i=0;i<300;i++) BBnum[i]=0;\n}\n\nint main()\n{\n    cin>>B;\n    for(int i=1;i<=300;i++)\n    {\n        zero();\n        int num=i*i;\n        int top=-1;\n        while(num>=B)\n        {\n            top++;\n            Bnum[top]=num%B;\n            num/=B;\n        }\n        top++;\n        Bnum[top]=num;\n        \n        bool huiwen=1;\n        for(int head=0,tail=top;head<=top;head++,tail--)\n        {\n            if(Bnum[head]!=Bnum[tail])\n            {\n                huiwen=0;\n                break;\n            }\n        }\n        \n        //cout<<i<<\"" |\""<<Bnum[0]<<\"" \""<<Bnum[1]<<\"" \""<<Bnum[2]<<\"" \""<<Bnum[3]<<\"" \""<<Bnum[4]<<\"" \""<<Bnum[5]<<\""| \""<<top<<\"" | \""<<huiwen<<endl;\n        \n        if(huiwen==1)\n        {\n            int numm=i;\n            int topp=-1;\n            while(numm>=B)\n            {\n                topp++;\n                BBnum[topp]=numm%B;\n                numm/=B;\n            }\n            topp++;\n            BBnum[topp]=numm;\n            \n            for(int j=topp;j>=0;j--) cout<<shuzi[BBnum[j]];\n            cout<<\"" \"";\n            for(int j=top;j>=0;j--) cout<<shuzi[Bnum[j]];\n            cout<<endl;\n        }\n    }\n}\n",ACCEPTED,82,452
1392292300379496448,66fa1ccfa675004ed6fe2b33c29b133d690b409a9e0ff71fd4c15e391a01df90,2021-05-12 09:35:26,C++,70.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <cstring>\nusing namespace std;\nint lst[2000];\nint DTox(int x,int n)//不同进制数除法转化\n{\n   memset(lst,0,sizeof(lst));\n   int len=0;\n   while(n)\n   {\n   \t lst[len]=n%x; len++;\n   \t n/=x;\n\t}\n\treturn --len;\t\n} \nint Palind(int x,int n)\n{\n\tint len1=DTox(x,n);\n\tint a=0,b=0;\n\tif(lst[0]==0&&lst[len1]==0) return 0;\n\tfor(int i=len1; i>=0; i--)\n\t\ta=a*10+lst[i];\n\tfor(int i=0; i<=len1; i++)\n\t\tb=b*10+lst[i];\n\tif(a==b)\treturn 1;\n\treturn 0;\n}\n\nint main()\n{\n\tint i,j,n,m,s,k,ans,sum=0;\n\tcin>>n>>s;\n\tfor(i=s+1; ; i++)\n\t{\n\t\tans=0;k=0;\n\t\tfor(j=2; j<=10; j++)\n\t\t{\n\t\t  if(Palind(j,i)==1)\n\t\t   ans++;\n\t\t  if(ans==2) {\n\t\t  \tk=1; break;\n\t\t  }\n\t\t}\n\t\tif(k==1) {\n\t\t sum++;\t\n\t\t cout<<i<<endl;\t\n\t\t}\n\t\tif(sum==n)\n\t\tbreak;\n\t} \n\treturn 0;\n } \n",ACCEPTED,47,448
1392292343870267392,55903c0ab4ab42d374446218e5b750d1b17435c06b666ac21c74544856fa5582,2021-05-12 09:35:36,C++,70.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint num[300]={0,1,2,3,4,5,6,7,8,9,10,15,16,\n17,18,20,21,24,26,27,28,31,\n33,36,40,45,46,50,51,52,55,\n57,63,65,67,73,78,80,82,85,\n88,91,92,93,98,99,100,104,105,107,\n109,111,114,119,121,127,129,130,135,141,\n142,150,151,154,160,164,170,171,173,178,\n182,185,186,191,195,200,203,209,212,215,\n219,227,235,242,246,252,255,257,264,273,\n282,292,300,313,316,325,328,333,341,342,\n343,357,364,365,373,381,393,400,414,427,\n434,438,446,455,464,471,484,495,511,513,\n546,555,560,564,585,624,626,644,646,651,\n656,666,676,692,693,701,717,728,730,757,\n771,777,787,819,820,856,868,910,939,975,\n1023,1025,1066,1105,1221,1285,1312,1365,1432,1441,\n1460,1539,1550,1640,1667,1755,1885,2000,2188,2268,\n2293,2550,2565,2709,2730,2910,2920,2925,2997,3069,\n3074,3075,3280,3315,3550,3591,3640,3663,3735,3740,\n3855,3951,3999,4095,4097,4161,4225,4257,4289,4369,\n4433,4593,4617,4681,5001,5049,5125,5189,5397,5461,\n5740,5840,5854,6148,6200,6560,6562,6643,6697,6724,\n6761,6825,6886,6889,6953,7300,7373,7381,7409,7447,\n7462,7517,7667,7703,7777,7801,7997,8038,8119,8194,\n8200,8258,8281,8322,8386,8578,8778,8802,9009,9103,\n9201,9222,9490,9958,10252,10308,10658,10794,10858,10922,\n10986,11253,11314,11757,11898,11950,12291,12355,12419,12483, \n12547,12654,12691,13107,13124,13131,13205,13286,13299,13331};\nint n,s,g;\nint main()\n{\n\tcin>>n>>s;\n\tfor(g=1;num[g]<=s;g++);\n\tfor(int i=0;i<n;i++)cout<<num[g+i]<<endl;\n\treturn 0;\n}",ACCEPTED,35,448
1392292494194122752,55903c0ab4ab42d374446218e5b750d1b17435c06b666ac21c74544856fa5582,2021-05-12 09:36:12,C++,70.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint num[300]={0,1,2,3,4,5,6,7,8,9,10,15,16,\n17,18,20,21,24,26,27,28,31,\n33,36,40,45,46,50,51,52,55,\n57,63,65,67,73,78,80,82,85,\n88,91,92,93,98,99,100,104,105,107,\n109,111,114,119,121,127,129,130,135,141,\n142,150,151,154,160,164,170,171,173,178,\n182,185,186,191,195,200,203,209,212,215,\n219,227,235,242,246,252,255,257,264,273,\n282,292,300,313,316,325,328,333,341,342,\n343,357,364,365,373,381,393,400,414,427,\n434,438,446,455,464,471,484,495,511,513,\n546,555,560,564,585,624,626,644,646,651,\n656,666,676,692,693,701,717,728,730,757,\n771,777,787,819,820,856,868,910,939,975,\n1023,1025,1066,1105,1221,1285,1312,1365,1432,1441,\n1460,1539,1550,1640,1667,1755,1885,2000,2188,2268,\n2293,2550,2565,2709,2730,2910,2920,2925,2997,3069,\n3074,3075,3280,3315,3550,3591,3640,3663,3735,3740,\n3855,3951,3999,4095,4097,4161,4225,4257,4289,4369,\n4433,4593,4617,4681,5001,5049,5125,5189,5397,5461,\n5740,5840,5854,6148,6200,6560,6562,6643,6697,6724,\n6761,6825,6886,6889,6953,7300,7373,7381,7409,7447,\n7462,7517,7667,7703,7777,7801,7997,8038,8119,8194,\n8200,8258,8281,8322,8386,8578,8778,8802,9009,9103,\n9201,9222,9490,9958,10252,10308,10658,10794,10858,10922,\n10986,11253,11314,11757,11898,11950,12291,12355,12419,12483, \n12547,12654,12691,13107,13124,13131,13205,13286,13299,13331};\nint n,s,g;\nint main()\n{\n\tcin>>n>>s;\n\tfor(g=1;num[g]<=s;g++);\n\tfor(int i=0;i<n;i++)cout<<num[g+i]<<endl;\n    for(int k = 0;k<n;k++)\n        k++;\n\treturn 0;\n}",ACCEPTED,40,468
1392309943622803456,8672821d3aa9d172c19738241b72ae3dec76f4178b4346b6fa2c833f5eb8148c,2021-05-12 10:45:33,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <stdio.h>\n#include <algorithm>\n#include <map>\nusing namespace std;\nint n,ans,change[20],jinzhi,base[20];\nvoid** display**(int x,int y)\n{\n    for(int i=x;i>=1;i--)\n    {\n        if(base[i]>=10)printf(\""%c\"",base[i]+55);\n        else printf(\""%d\"",base[i]);\n    }printf(\"" \"");\n    for(int i=1;i<=y;i++)\n    {\n        if(change[i]>=10)printf(\""%c\"",change[i]+55);\n        else printf(\""%d\"",change[i]);\n    }\n    printf(\""\\n\"");\n}\nvoid** judge**(int x)\n{\n    int i=0;\n    while(x>0)\n    {\n        change[++i]=x%n;\n        x=x/n;\n    }\n    for(int j=1;j<=i;j++)\n        if(change[j]!=change[i+1-j])return;\n    int j=0;\n    while(ans>0)\n    {\n        base[++j]=ans%n;\n        ans=ans/n;\n    }\n    display(j,i);\n}\nint main()\n{\n    cin>>n;\n    for(int i=1;i<=300;i++)\n        {ans=i;judge(ans*ans);}\n    return 0;\n}",COMPILE_ERROR,0,0
1392310255892963328,8672821d3aa9d172c19738241b72ae3dec76f4178b4346b6fa2c833f5eb8148c,2021-05-12 10:46:47,C++,80.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstdio>\n#include<cstdlib>\n#include<cmath>\n#include<cstring>\nusing namespace std;\nint b;\nint a[1000];\nchar g[12]={'A','B','C','D','E','F','G','H','I','J','K','L'};//标出这些字母\nbool judge(int x)\n{\n   int stop=1,tail=1;\n   while(x!=0)//进制转换\n   {\n   \t  a[tail]=x%b;\n   \t  x=x/b;\n   \t  tail++;\n   }\n   tail--;\n   for(int i=1;i<=(tail+1)/2;i++)\n   \t  if(a[i]!=a[tail+1-i])\n   \t  {\n   \t     stop=0;//判断是否为回文\n\t\t break;\t\n\t  }\n\tif(stop==1)\n\t  return 1;\n\telse \n\t  return 0;\n}\nvoid print(int x)\n{\n   int tail=1;\n   while(x!=0)//照例进制转换\n   {\n   \t  a[tail]=x%b;\n   \t  x=x/b;\n   \t  tail++;\n   }\n   tail--;\n   for(int i=tail;i>=1;i--)//倒叙输出\n   {\n   \t  if(a[i]<=9)\n   \t    printf(\""%d\"",a[i]);\n   \t  else\n   \t    printf(\""%c\"",g[a[i]-10]);\n   \t  \n   }\n} \nint main() \n{\n\tscanf(\""%d\"",&b);\n\tfor(int i=1;i<=300;i++)\n\t{\n\t\tif(judge(i*i)==1)\n\t\t{\n\t\t  \tprint(i);//打印这个数\n\t\t    printf(\"" \"");\n\t\t\tprint(i*i);//打印这个数的平方\n\t\t\tprintf(\""\\n\"");  \t\n\t\t}\n\t}/**/\n\treturn 0;\n}",ACCEPTED,47,452
1392310464496640000,8672821d3aa9d172c19738241b72ae3dec76f4178b4346b6fa2c833f5eb8148c,2021-05-12 10:47:37,C++,80.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstdio>\n#include<cstdlib>\n#include<cmath>\n#include<cstring>\nusing namespace std;\nint b;\nint a[1000];\nchar g[12]={'A','B','C','D','E','F','G','H','I','J','K','L'};\nbool judge(int x)\n{\n   int stop=1,tail=1;\n   while(x!=0)\n   {\n   \t  a[tail]=x%b;\n   \t  x=x/b;\n   \t  tail++;\n   }\n   tail--;\n   for(int i=1;i<=(tail+1)/2;i++)\n   \t  if(a[i]!=a[tail+1-i])\n   \t  {\n   \t     stop=0;\n\t\t break;\t\n\t  }\n\tif(stop==1)\n\t  return 1;\n\telse \n\t  return 0;\n}\nvoid print(int x)\n{\n   int tail=1;\n   while(x!=0)\n   {\n   \t  a[tail]=x%b;\n   \t  x=x/b;\n   \t  tail++;\n   }\n   tail--;\n   for(int i=tail;i>=1;i--)\n   {\n   \t  if(a[i]<=9)\n   \t    printf(\""%d\"",a[i]);\n   \t  else\n   \t    printf(\""%c\"",g[a[i]-10]);\n   \t  \n   }\n} \nint main() \n{\n\tscanf(\""%d\"",&b);\n\tfor(int i=1;i<=300;i++)\n\t{\n\t\tif(judge(i*i)==1)\n\t\t{\n\t\t  \tprint(i);\n\t\t    printf(\"" \"");\n\t\t\tprint(i*i);\n\t\t\tprintf(\""\\n\"");  \t\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,40,428
1392311190190923776,8672821d3aa9d172c19738241b72ae3dec76f4178b4346b6fa2c833f5eb8148c,2021-05-12 10:50:30,C++,70.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstdio>\nusing namespace std;\ninline int read()\n{\n    int neg=1,x=0;\n    char c;\n    while((c=getchar())<'0'||c>'9')\n      if(c=='-')\n        neg=-1;\n    x=c-'0';\n    while((c=getchar())>='0'&&c<='9')\n      x=x*10+(c-'0');\n    return neg*x;\n}\nint a[11][101];\nbool check(int x)\n{\n\tint head=1,tail=a[x][0];\n\twhile(head<tail)\n\t{\n\t\tif(a[x][head]!=a[x][tail])\n\t\t  return 0;\n\t\thead++,tail--;\n\t}\n\treturn 1;\n}\nint main()\n{\n\tint n=read(),k=read(),t;\n\tfor(int i=2;i<=10;i++)\n\t{\n\t\tt=k;\n\t\twhile(t>0)\n\t\t{\n\t\t\ta[i][++a[i][0]]=t%i;\n\t\t\tt/=i;\n\t\t}\n\t}\n\tint ans=0,step,sum,num=k;\n\twhile(ans<n)\n\t{\n\t\tsum=0;\n\t\tnum++;\n\t\tfor(int i=2;i<=10;i++)\n\t\t{\n\t\t\ta[i][1]++;\n\t\t\tstep=1;\n\t\t\twhile(a[i][step]==i)\n\t\t\t{\n\t\t\t\ta[i][step]=0;\n\t\t\t\ta[i][++step]++;\n\t\t\t\tif(step>a[i][0])\n\t\t\t\t  a[i][0]++;\n\t\t\t}\n\t\t\tif(check(i))\n\t\t\t  sum++;\n\t\t}\n\t\tif(sum>=2)\n\t\t  cout<<num<<endl,ans++;\n\t}\n\treturn 0;\n}",ACCEPTED,48,376
1392326084017627136,66fa1ccfa675004ed6fe2b33c29b133d690b409a9e0ff71fd4c15e391a01df90,2021-05-12 11:49:41,Python,10.0,1353613982111367175,1267442030214471680,1049226397448056832,"def isdoublenum(x):\n    x=x**2\n    x=str(x)\n    m=x[::-1]\n    if m==x:\n        return 1\n    else:\n        return 0\n\ndef change(num,n):\n    basestr={10:\""a\"",11:\""b\"",12:\""c\"",13:\""d\"",14:\""e\"",15:\""f\"",16:\""g\"",17:\""h\"",18:\""i\"",19:\""j\""}\n    newnumstr=\""\""\n    n=int(n)\n    num=int(num)\n    while num !=0:\n        remain=num % n\n        if remain<10:\n            remain_str = str(remain)\n        elif remain>=20:\n            remain_str=\""+str(remain)\""\n        else:\n            remain_str=basestr[remain]\n        newnumstr=remain_str+newnumstr\n        num=num/n\n    return newnumstr\n\n\na=input()\nn=1\nwhile n>=1 and n <=300:\n    change (n,a)\n    if isdoublenum(n) ==1:\n        print(n,n**2)\n\n    n=n+1\n\n\n\n\n\n",PARTIAL_ACCEPTED,1090,3396
1392326231216726016,66fa1ccfa675004ed6fe2b33c29b133d690b409a9e0ff71fd4c15e391a01df90,2021-05-12 11:50:16,Python,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"def isdoublenum(x):\n    x=x**2\n    x=str(x)\n    m=x[::-1]\n    if m==x:\n        return 1\n    else:\n        return 0\n\ndef change(num,n):\n    basestr={10:\""a\"",11:\""b\"",12:\""c\"",13:\""d\"",14:\""e\"",15:\""f\"",16:\""g\"",17:\""h\"",18:\""i\"",19:\""j\""}\n    newnumstr=\""\""\n    n=int(n)\n    num=int(num)\n    while num !=0:\n        remain=num % n\n        if remain<10:\n            remain_str = str(remain)\n        elif remain>=20:\n            remain_str=\""+str(remain)\""\n        else:\n            remain_str=basestr[remain]\n        newnumstr=remain_str+newnumstr\n        num=num/n\n    return newnumstr\n\n\na=input()\nn=1\nwhile n>=1 and n <=300:\n    change (n,a)\n    if isdoublenum(n) ==1:\n        print(n,n**2)\n\n    n=n+1\n\n\n\n\n\n",MULTIPLE_ERROR,948,3264
1392326541402316800,66fa1ccfa675004ed6fe2b33c29b133d690b409a9e0ff71fd4c15e391a01df90,2021-05-12 11:51:30,Python,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"def isdoublenum(x):\n    x=x**2\n    x=str(x)\n    m=x[::-1]\n    if m==x:\n        return 1\n    else:\n        return 0\n\ndef change(num,n):\n    basestr={10:\""a\"",11:\""b\"",12:\""c\"",13:\""d\"",14:\""e\"",15:\""f\"",16:\""g\"",17:\""h\"",18:\""i\"",19:\""j\""}\n    newnumstr=\""\""\n    n=int(n)\n    num=int(num)\n    while num !=0:\n        remain=num % n\n        if remain<10:\n            remain_str = str(remain)\n        elif remain>=20:\n            remain_str=\""+str(remain)\""\n        else:\n            remain_str=basestr[remain]\n        newnumstr=remain_str+newnumstr\n        num=num/n\n    return newnumstr\n\n\na=input()\nn=1\nwhile n>=1 and n <=300:\n    change (n,a)\n    if isdoublenum(n) ==1:\n        print(n,n**2)\n\n    n=n+1\n\n\n\n\n\n",MULTIPLE_ERROR,984,3264
1392326828103933952,66fa1ccfa675004ed6fe2b33c29b133d690b409a9e0ff71fd4c15e391a01df90,2021-05-12 11:52:38,Python,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"def isdoublenum(x):\n    x=x**2\n    x=str(x)\n    m=x[::-1]\n    if m==x:\n        return 1\n    else:\n        return 0\n\ndef change(num,n):\n    basestr={10:\""a\"",11:\""b\"",12:\""c\"",13:\""d\"",14:\""e\"",15:\""f\"",16:\""g\"",17:\""h\"",18:\""i\"",19:\""j\""}\n    newnumstr=\""\""\n    n=int(n)\n    num=int(num)\n    while num !=0:\n        remain=num % n\n        if remain<10:\n            remain_str = str(remain)\n        elif remain>=20:\n            remain_str=\""+str(remain)\""\n        else:\n            remain_str=basestr[remain]\n        newnumstr=remain_str+newnumstr\n        num=num/n\n    return newnumstr\n\n\na=input()\nn=1\nwhile n>=1 and n <=300:\n    change (n,a)\n    if isdoublenum(n) ==1:\n        print(n,n**2)\n\n    n=n+1\n\n\n\n\n\n",MULTIPLE_ERROR,934,3268
1392327235588988928,66fa1ccfa675004ed6fe2b33c29b133d690b409a9e0ff71fd4c15e391a01df90,2021-05-12 11:54:15,C++,80.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<stdio.h>\n \nchar c[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nint n;\nint fun(int num)\n{\n    num*=num;\n    char a[1000];\n    int i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    int flag=1;\n    for(int j=1;j<=i/2;j++)\n    {\n        if(a[j]!=a[i-j+1])\n        {\n            flag=0;\n            break;\n        }\n    }\n    return flag;\n}\n \nvoid print(int num)\n{\n    int temp=num;\n    char a[1000];\n    int i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    for(i;i>=1;i--)\n        printf(\""%c\"",a[i]);\n    printf(\"" \"");\n    num=temp*temp;\n    i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    for(i;i>=1;i--)\n        printf(\""%c\"",a[i]);\n    printf(\""\\n\"");\n}\n \nint main()\n{\n    while(~scanf(\""%d\"",&n))\n    {\n        for(int i=1;i<=300;i++)\n        {\n            if(fun(i)==1)\n                print(i);\n        }\n    }\n    return 0;\n}",ACCEPTED,64,336
1392342275629096960,66fa1ccfa675004ed6fe2b33c29b133d690b409a9e0ff71fd4c15e391a01df90,2021-05-12 12:54:01,Python,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"def isdoublenum(x):\n    x=x**2\n    x=str(x)\n    m=x[::-1]\n    if m==x:\n        return 1\n    else:\n        return 0\n\ndef change(num,n):\n    basestr={10:\""a\"",11:\""b\"",12:\""c\"",13:\""d\"",14:\""e\"",15:\""f\"",16:\""g\"",17:\""h\"",18:\""i\"",19:\""j\""}\n    newnumstr=\""\""\n    n=int(n)\n    num=int(num)\n    while num !=0:\n        remain=num % n\n        if remain<10:\n            remain_str = str(remain)\n        elif remain>=20:\n            remain_str=\""+str(remain)\""\n        else:\n            remain_str=basestr[remain]\n        newnumstr=remain_str+newnumstr\n        num=num/n\n    return newnumstr\n\n\na=input()\nn=1\nwhile n>=1 and n <=300:\n    change (n,a)\n    if isdoublenum(n) ==1:\n        print(n,n**2)\n\n    n=n+1\n\n\n\n\n\n",MULTIPLE_ERROR,920,3260
1392342343505518592,66fa1ccfa675004ed6fe2b33c29b133d690b409a9e0ff71fd4c15e391a01df90,2021-05-12 12:54:17,Python,10.0,1353613982111367175,1267442030214471680,1049226397448056832,"def isdoublenum(x):\n    x=x**2\n    x=str(x)\n    m=x[::-1]\n    if m==x:\n        return 1\n    else:\n        return 0\n\ndef change(num,n):\n    basestr={10:\""a\"",11:\""b\"",12:\""c\"",13:\""d\"",14:\""e\"",15:\""f\"",16:\""g\"",17:\""h\"",18:\""i\"",19:\""j\""}\n    newnumstr=\""\""\n    n=int(n)\n    num=int(num)\n    while num !=0:\n        remain=num % n\n        if remain<10:\n            remain_str = str(remain)\n        elif remain>=20:\n            remain_str=\""+str(remain)\""\n        else:\n            remain_str=basestr[remain]\n        newnumstr=remain_str+newnumstr\n        num=num/n\n    return newnumstr\n\n\na=input()\nn=1\nwhile n>=1 and n <=300:\n    change (n,a)\n    if isdoublenum(n) ==1:\n        print(n,n**2)\n\n    n=n+1\n\n\n\n\n\n",PARTIAL_ACCEPTED,1116,3260
1392342524925943808,66fa1ccfa675004ed6fe2b33c29b133d690b409a9e0ff71fd4c15e391a01df90,2021-05-12 12:55:01,Python,10.0,1353613982111367175,1267442030214471680,1049226397448056832,"def isdoublenum(x):\n    x=x**2\n    x=str(x)\n    m=x[::-1]\n    if m==x:\n        return 1\n    else:\n        return 0\n\ndef change(num,n):\n    basestr={10:\""a\"",11:\""b\"",12:\""c\"",13:\""d\"",14:\""e\"",15:\""f\"",16:\""g\"",17:\""h\"",18:\""i\"",19:\""j\""}\n    newnumstr=\""\""\n    n=int(n)\n    num=int(num)\n    while num !=0:\n        remain=num % n\n        if remain<10:\n            remain_str = str(remain)\n        elif remain>=20:\n            remain_str=\""+str(remain)\""\n        else:\n            remain_str=basestr[remain]\n        newnumstr=remain_str+newnumstr\n        num=num/n\n    return newnumstr\n\n\na=input()\nn=1\nwhile n>=1 and n <=300:\n    change (n,a)\n    if isdoublenum(n) ==1:\n        print(n,n**2)\n\n    n=n+1\n\n\n\n\n\n",PARTIAL_ACCEPTED,1160,3368
1392659493915041792,4020717b59e94e0ea6be1acfb03e4509fc27850497e9f5997625116457e933c0,2021-05-13 09:54:32,C++,10.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\nint N,S;\nint num=0; //已经找到的回文个数\nint now; //当前正在找的数\nint list[100]; //用来存储找出来的数\n\nvoid init() //把list清空\n{\n    for(int i=0;i<100;i++) list[i]=0;\n}\n\nbool judge(int top)\n{\n    bool return_value=1;\n    int head=0,tail=top;\n    while(head<=top)\n    {\n        if(list[head]!=list[tail])\n        {\n            return_value=0;\n            break;\n        }\n        head++;\n        top--;\n    }\n    return return_value;\n}\n\nint main()\n{\n    cin>>N>>S;\n    \n    int now=S+1;//从S+1开始找\n    \n    while(num<N)\n    {\n        for(int jinzhi=2;jinzhi<=10;jinzhi++)//从2进制开始找\n        {\n            init();\n            \n            int top=-1; //list栈顶\n            \n            int noww=now; //如果暂存now\n            while(noww>=jinzhi)\n            {\n                top++;\n                list[top]=noww%jinzhi;\n                noww/=jinzhi;\n            }\n            \n            bool huiwen=judge(top); //判断now在当前进制是不是回文数\n            \n            if(huiwen)//如果是回文数\n            {\n                num++;\n                cout<<now<<endl;\n                break;\n            }\n        }\n        now++;\n    }\n}\n",PARTIAL_ACCEPTED,45,448
1392660480432119808,4020717b59e94e0ea6be1acfb03e4509fc27850497e9f5997625116457e933c0,2021-05-13 09:58:27,C++,10.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\nint N,S;\nint num=0; //已经找到的回文个数\nint now; //当前正在找的数\nint list[100]; //用来存储找出来的数\nint jinzhishu;//now在所有进制中是回文数的进制数量\n\nvoid init() //把list清空\n{\n    for(int i=0;i<100;i++) list[i]=0;\n}\n\nbool judge(int top)\n{\n    bool return_value=1;\n    int head=0,tail=top;\n    while(head<=top)\n    {\n        if(list[head]!=list[tail])\n        {\n            return_value=0;\n            break;\n        }\n        head++;\n        top--;\n    }\n    return return_value;\n}\n\nint main()\n{\n    cin>>N>>S;\n    \n    int now=S+1;//从S+1开始找\n    \n    while(num<N)\n    {\n        jinzhishu=0;\n        for(int jinzhi=2;jinzhi<=10;jinzhi++)//从2进制开始找\n        {\n            init();\n            \n            int top=-1; //list栈顶\n            \n            int noww=now; //如果暂存now\n            while(noww>=jinzhi)\n            {\n                top++;\n                list[top]=noww%jinzhi;\n                noww/=jinzhi;\n            }\n            \n            bool huiwen=judge(top); //判断now在当前进制是不是回文数\n            \n            if(huiwen)//如果是回文数\n            {\n                jinzhishu++;\n            }\n        }\n        if(jinzhishu>=2)\n        {\n            num++;\n            cout<<now<<endl;\n        }\n        now++;\n    }\n}\n",PARTIAL_ACCEPTED,48,448
1392667428850343936,4020717b59e94e0ea6be1acfb03e4509fc27850497e9f5997625116457e933c0,2021-05-13 10:26:04,C++,70.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\nint N,S;\nint num=0; //已经找到的回文个数\nint now; //当前正在找的数\nint list[100]; //用来存储找出来的数\nint jinzhishu;//now在所有进制中是回文数的进制数量\n\nvoid init() //把list清空\n{\n    for(int i=0;i<100;i++) list[i]=0;\n}\n\nvoid prt(int top)\n{\n    for(int i=0;i<=top;i++) cout<<list[i];\n}\n\nbool judge(int top)\n{\n    bool return_value=1;\n    int head=0,tail=top;\n    while(head<=top)\n    {\n        if(list[head]!=list[tail])\n        {\n            return_value=0;\n            break;\n        }\n        head++;\n        tail--;\n    }\n    return return_value;\n}\n\nint main()\n{\n    cin>>N>>S;\n    \n    int now=S+1;//从S+1开始找\n    \n    while(num<N)\n    {\n        jinzhishu=0;\n        for(int jinzhi=2;jinzhi<=10;jinzhi++)//从2进制开始找\n        {\n            init();\n            int top=-1; //list栈顶\n            \n            int noww=now; //暂存now\n            while(noww>=jinzhi)\n            {\n                top++;\n                list[top]=noww%jinzhi;\n                noww/=jinzhi;\n            }\n            top++;\n            list[top]=noww;\n            \n            //cout<<now<<\""在\""<<jinzhi<<\""进制下是 \"";\n            //prt(top); cout<<endl;\n            \n            if(judge(top))//如果是回文数\n            {\n                //cout<<\""是回文数\""<<endl;\n                jinzhishu++;\n            }\n        }\n        \n        //cout<<now<<\""有\""<<jinzhishu<<\""个回文数\""<<endl;\n        if(jinzhishu>=2)\n        {\n            num++;\n            cout<<now<<endl;\n        }\n        now++;\n    }\n}\n",ACCEPTED,96,456
1392742671199608832,b11b3d8ecff8bdcea13e94ffc65de2937fcea11c73f1d4d8004c865b76446fde,2021-05-13 15:25:03,C++,80.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm> \nusing namespace std;\nstring shift(int n, int radix)  \n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\t\n        {\n            ans += t + '0';\n        }\n        else \n        {\n            ans += t - 10 + 'A'; \n        }\n        n /= radix;\n    } while (n != 0);\n    reverse(ans.begin(), ans.end()); \n    return ans;\n}\nint main()\n{\n\tint B,j;\n    cin>>B;\n    for (int k=1;k<=300;k++)\n    {\n    \tj=k;\n    \tstring s1 = shift(j, B);\n\t\tstring s2 = shift((j*j),B);\n\t\tstring s3 = s2;\n\t\treverse(s3.begin(), s3.end());\n\t\tif (s3 == s2)\n\t\t\tcout<<s1<<\"" \""<<s2<<endl;\n\t}\n    return 0;\n}",ACCEPTED,122,456
1392753670384427008,66fa1ccfa675004ed6fe2b33c29b133d690b409a9e0ff71fd4c15e391a01df90,2021-05-13 16:08:45,Python,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"def isdoublenum(x):\n    x=x**2\n    x=str(x)\n    m=x[::-1]\n    if m==x:\n        return 1\n    else:\n        return 0\n\ndef change(num,n):\n    basestr={10:\""a\"",11:\""b\"",12:\""c\"",13:\""d\"",14:\""e\"",15:\""f\"",16:\""g\"",17:\""h\"",18:\""i\"",19:\""j\""}\n    newnumstr=\""\""\n    n=int(n)\n    num=int(num)\n    while num !=0:\n        remain=num % n\n        if remain<10:\n            remain_str = str(remain)\n        elif remain>=20:\n            remain_str=\""+str(remain)\""\n        else:\n            remain_str=basestr[remain]\n        newnumstr=remain_str+newnumstr\n        num=num/n\n    return newnumstr\n\n\na=input()\nn=1\nwhile n>=1 and n <=300:\n    change (n,a)\n    if isdoublenum(n) ==1:\n        print(n,n**2)\n\n    n=n+1\n\n\n\n\n\n",MULTIPLE_ERROR,939,3348
1392766588593324032,bf37cbb06d8b69f86f8147134aaf3791a6a6657eb8e9c37e34a71ac658723d54,2021-05-13 17:00:05,C++,10.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include <algorithm>\nusing namespace std;\nstring judge(int n, int m)  \n{\n    string a= \""\"",b;\n    do {\n        int t = n % m;\n        if (t <= 9)\t\n        {\n            a += t + '0';\n        }\n        else \n        {\n            a += t - 10 + 'A';\n        }\n        n /= m;\n    } while (n != 0);\n    b=a;\n    reverse(a.begin(), a.end()); \n    if(a==b)\n        return b;\n    else\n        return \""!\"";\n}\nint main()\n{\n    int B,i,j;\n    cin>>B;\n    string s;\n    for(i=1;i<=300;i++)\n    {\n        j=i*i;\n        s=judge(j,B);\n        if(s!=\""!\"")\n            cout<<i<<\"" \""<<j<<endl;\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,34,324
1392767287397933056,bf37cbb06d8b69f86f8147134aaf3791a6a6657eb8e9c37e34a71ac658723d54,2021-05-13 17:02:52,C++,10.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include <algorithm>\nusing namespace std;\nstring judge(int n, int m)  \n{\n    string a= \""\"",b;\n    do {\n        int t = n % m;\n        if (t <= 9)\t\n        {\n            a += t + '0';\n        }\n        else \n        {\n            a += t - 10 + 'A';\n        }\n        n /= m;\n    } while (n != 0);\n    b=a;\n    reverse(a.begin(), a.end()); \n    if(a==b)\n        return a;\n    else\n        return \""!\"";\n}\nint main()\n{\n    int B,i,j;\n    cin>>B;\n    string s;\n    for(i=1;i<=300;i++)\n    {\n        j=i*i;\n        s=judge(j,B);\n        if(s!=\""!\"")\n            cout<<judge(i,B)<<\"" \""<<s<<endl;\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,38,328
1392768323869171712,bf37cbb06d8b69f86f8147134aaf3791a6a6657eb8e9c37e34a71ac658723d54,2021-05-13 17:06:59,C++,80.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include <algorithm>\nusing namespace std;\nstring tran(int n, int m)  \n{\n    string a= \""\"",b;\n    do {\n        int t = n % m;\n        if (t <= 9)\t\n        {\n            a += t + '0';\n        }\n        else \n        {\n            a += t - 10 + 'A';\n        }\n        n /= m;\n    } while (n != 0);\n   reverse(a.begin(), a.end()); \n    return a;\n}\nbool judge(string a)\n{\n    string b;\n    b=a;\n    reverse(a.begin(), a.end()); \n    if(a==b)\n        return true;\n    else\n        return false;\n}\nint main()\n{\n    int B,i,j;\n    cin>>B;\n    string s,h;\n    for(i=1;i<=300;i++)\n    {\n        j=i*i;\n        s=tran(j,B);\n        h=tran(i,B);\n        if(judge(s))\n            cout<<h<<\"" \""<<s<<endl;\n    }\n    return 0;\n}",ACCEPTED,35,336
1392770917932941312,bf37cbb06d8b69f86f8147134aaf3791a6a6657eb8e9c37e34a71ac658723d54,2021-05-13 17:17:17,C++,60.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include <algorithm>\nusing namespace std;\nstring tran(int n, int m)  \n{\n    string a= \""\"",b;\n    do {\n        int t = n % m;\n        if (t <= 9)\t\n        {\n            a += t + '0';\n        }\n        else \n        {\n            a += t - 10 + 'A';\n        }\n        n /= m;\n    } while (n != 0);\n   reverse(a.begin(), a.end()); \n    return a;\n}\nbool judge(string a)\n{\n    string b;\n    b=a;\n    reverse(a.begin(), a.end()); \n    if(a==b)\n        return true;\n    else\n        return false;\n}\nint main(){\n    int N,S,i,j,h=0,k;\n    string s;\n    cin>>N>>S;\n    for(i=S+1;i<=10000;i++)\n    {\n        if(h<N)\n        {\n            k=0;\n            for(j=2;j<=10;j++)\n            {\n                s=tran(i,j);\n                if(judge(s))\n                    k++;\n                if(k==2)\n                {\n                    h++;\n                    cout<<i<<endl;\n                    break;\n                }\n             }\n        }\n        else\n            break;\n    }\n    return 0;\n}\n    ",PARTIAL_ACCEPTED,40,444
1392818359177011200,b11b3d8ecff8bdcea13e94ffc65de2937fcea11c73f1d4d8004c865b76446fde,2021-05-13 20:25:48,C++,0.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include<string>\n#include <algorithm>\nusing namespace std; \n\nstring shift(int n, int radix)  \n{\n    string str = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\t\n        {\n            str += t + '0';\n        }\n        else \n        {\n            str += t - 10 + 'A'; \n        }\n        n /= radix;\n    } while (n != 0);\n    reverse(str.begin(), str.end()); \n    return str;\n}\n\nint main()\n{\n    int  N,S;\n    cin>>N>>S;\n    int num=0;\n    int i,j;\n    for(i=S+1;num<N;i++)\n    {\n        int t=0;\n        for(j=2;j<=10;j++)\n        {\n            string str1=shift(i,j);\n        \tstring str2 = str1;\n\t\t\treverse(str2.begin(), str2.end());\n            if(str2==str1)\n                t++;\n            if(t==2)\n            {\n                num++;\n                break;\n            }\n        }\n        if(j<=10)\n            cout<<i<<endl;\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1392818544242278400,b11b3d8ecff8bdcea13e94ffc65de2937fcea11c73f1d4d8004c865b76446fde,2021-05-13 20:26:32,C++,0.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include<string>\n#include <algorithm>\nusing namespace std; \n\nstring shift(int n, int radix)  \n{\n    string str = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\t\n        {\n            str += t + '0';\n        }\n        else \n        {\n            str += t - 10 + 'A'; \n        }\n        n /= radix;\n    } while (n != 0);\n    reverse(str.begin(), str.end()); \n    return str;\n}\n\nint main()\n{\n    int  N,S;\n    scanf(\""%d %d\"",&N,&S)\n    int num=0;\n    int i,j;\n    for(i=S+1;num<N;i++)\n    {\n        int t=0;\n        for(j=2;j<=10;j++)\n        {\n            string str1=shift(i,j);\n        \tstring str2 = str1;\n\t\t\treverse(str2.begin(), str2.end());\n            if(str2==str1)\n                t++;\n            if(t==2)\n            {\n                num++;\n                break;\n            }\n        }\n        if(j<=10)\n            cout<<i<<endl;\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1392819469350559744,b11b3d8ecff8bdcea13e94ffc65de2937fcea11c73f1d4d8004c865b76446fde,2021-05-13 20:30:13,C++,0.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include<string>\n#include <algorithm>\nusing namespace std; \n\nstring shift(int n, int radix)  \n{\n    string str = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\t\n        {\n            str += t + '0';\n        }\n        else \n        {\n            str += t - 10 + 'A'; \n        }\n        n /= radix;\n    } while (n != 0);\n    reverse(str.begin(), str.end()); \n    return str;\n}\n\nint main()\n{\n    int  N,S;\n    cin>>N >>S;\n    int num=0;\n    int i,j;\n    for(i=S+1;num<N;i++)\n    {\n        int t=0;\n        for(j=2;j<=10;j++)\n        {\n            string str1=shift(i,j);\n        \tstring str2 = str1;\n\t\t\treverse(str2.begin(), str2.end());\n            if(str2==str1)\n                t++;\n            if(t==2)\n            {\n                num++;\n                break;\n            }\n        }\n        if(j<=10)\n            cout<<i<<endl;\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1392819659956510720,b11b3d8ecff8bdcea13e94ffc65de2937fcea11c73f1d4d8004c865b76446fde,2021-05-13 20:30:58,C++,70.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include <algorithm>\nusing namespace std; \nstring shift(int n, int radix)  \n{\n    string str = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\t\n        {\n            str += t + '0';\n        }\n        else \n        {\n            str += t - 10 + 'A'; \n        }\n        n /= radix;\n    } while (n != 0);\n    reverse(str.begin(), str.end()); \n    return str;\n}\n\nint main()\n{\n    int  N,S;\n    cin>>N>>S; \n    int num=0;\n    int i,j;\n    for(i=S+1;num<N;i++)\n    {\n        int t=0;\n        for(j=2;j<=10;j++)\n        {\n            string str1=shift(i,j);\n        \tstring str2 = str1;\n\t\t\treverse(str2.begin(), str2.end());\n            if(str2==str1)\n                t++;\n            if(t==2)\n            {\n                num++;\n                break;\n            }\n        }\n        if(j<=10)\n            cout<<i<<endl;\n    }\n    return 0;\n}",ACCEPTED,41,448
1392829024788766720,d481d4d83ba78568176006279a793b92a897f5809d6e6e1c5c1ffcdae42b192b,2021-05-13 21:08:11,Python,40.0,1353613982111367175,1267442030214471680,1049226397448056832,"def trans(x,f):\n    a=[0,1,2,3,4,5,6,7,8,9,'A','B','C','D','E','F','G','H','I','J']\n    b=[]\n    while True:\n        s=x//f\n        y=x%f\n        b=b+[y]\n        if s==0:\n            break\n        x=s\n    b.reverse()\n    b=map(str,b)\n    string=''.join(b)\n    return int(string)\n\ndef reverseNumber(num):\n    n=str(num)\n    m=n[::-1]\n    if n==m:\n        return num\n\nc=int(input())\nfor i in range(1,301):\n    d=trans(i,c)\n    e=trans(i*i,c)\n    if reverseNumber(e)==e:\n                print(str(d)+\"" \""+str(e))",PARTIAL_ACCEPTED,250,3268
1392844569139437568,d481d4d83ba78568176006279a793b92a897f5809d6e6e1c5c1ffcdae42b192b,2021-05-13 22:09:57,Python,80.0,1353613982111367175,1267442030214471680,1049226397448056832,"def trans(x,f):\n    a=[0,1,2,3,4,5,6,7,8,9,'A','B','C','D','E','F','G','H','I','J']\n    b=[]\n    g=[]\n    while True:\n        s=x//f\n        y=x%f\n        b=b+[y]\n        if s==0:\n            break\n        x=s\n    b.reverse()\n    for i in b:\n        g.append(a[i])\n    g=map(str,g)\n    string=''.join(g)\n    return string\n\ndef reverseNumber(n):\n    m=n[::-1]\n    if n==m:\n        return n\n\nc=int(input())\nfor i in range(1,301):\n    d=trans(i,c)\n    e=trans(i*i,c)\n    if reverseNumber(e)==e:\n                print(str(d)+\"" \""+str(e))",ACCEPTED,239,3424
1394122865772969984,942e1b5f69af9183ce903e8e1b53271a8b8865c8da140abf12e8e9539ac8669d,2021-05-17 10:49:27,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm> \nusing namespace std;\n\nbool Palindrome( string str) //const string\n{\n    int length;\n    length = str.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (str[i] != str[length - i - 1]) \n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 0)\n    {\n        return false;\n    }\n    else\n    {\n        return true;\n    }\n}\n\nstring change(int n, int base)    //进制转换函数，使用模N取余法；\n{\n    string ans = \""\"";\n    do \n    {\n        int t = n % base;\n        if (t >= 0 && t < 10)\t\n        {\n            ans += t + '0';\n        }\n        else \n        {\n            ans += t - 10 ; //+'A'\n        }\n        n /= base;\n    } while (n != 0);\n    \n    reverse(ans.begin(), ans.end());\n    return ans;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    int j = 0;\n    for (int x = 1; x <= 300; x++)\n    {\n        j = x; // 创建副本\n        \n        string s1 = change(j, n);      // 将整数按n进制转换；\n        string s2 = change((j ^2), n);// 将该数的平方按n进制转换；\n\n        if (Palindrome(s2))\n        {\n            cout << s1 << \"" \"" << s2 << endl;\n        }\n        else\n        {\n            continue;\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,52,320
1394123007578161152,942e1b5f69af9183ce903e8e1b53271a8b8865c8da140abf12e8e9539ac8669d,2021-05-17 10:50:01,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm> \nusing namespace std;\n\nbool Palindrome( string str) //const string\n{\n    int length;\n    length = str.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (str[i] != str[length - i - 1]) \n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 0)\n    {\n        return false;\n    }\n    else\n    {\n        return true;\n    }\n}\n\nstring change(int n, int base)    //进制转换函数，使用模N取余法；\n{\n    string ans = \""\"";\n    do \n    {\n        int t = n % base;\n        if (t >= 0 && t < 10)\t\n        {\n            ans += t + '0';\n        }\n        else \n        {\n            ans += t - 10+'A' ; //\n        }\n        n /= base;\n    } while (n != 0);\n    \n    reverse(ans.begin(), ans.end());\n    return ans;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    int j = 0;\n    for (int x = 1; x <= 300; x++)\n    {\n        j = x; // 创建副本\n        \n        string s1 = change(j, n);      // 将整数按n进制转换；\n        string s2 = change((j ^2), n);// 将该数的平方按n进制转换；\n\n        if (Palindrome(s2))\n        {\n            cout << s1 << \"" \"" << s2 << endl;\n        }\n        else\n        {\n            continue;\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,132,452
1394123303180156929,942e1b5f69af9183ce903e8e1b53271a8b8865c8da140abf12e8e9539ac8669d,2021-05-17 10:51:11,C++,80.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm> \nusing namespace std;\n\nbool Palindrome(const string str)\n{\n    int length;\n    length = str.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (str[i] != str[length - i - 1]) \n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 0)\n    {\n        return false;\n    }\n    else\n    {\n        return true;\n    }\n}\n\nstring change(int n, int base)    //进制转换函数，使用模N取余法；\n{\n    string ans = \""\"";\n    do \n    {\n        int t = n % base;\n        if (t >= 0 && t < 10)\t\n        {\n            ans += t + '0';\n        }\n        else \n        {\n            ans += t - 10+'A' ; //\n        }\n        n /= base;\n    } while (n != 0);\n    \n    reverse(ans.begin(), ans.end());\n    return ans;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    int j = 0;\n    for (int x = 1; x <= 300; x++)\n    {\n        j = x; // 创建副本\n        \n        string s1 = change(j, n);      // 将整数按n进制转换；\n        string s2 = change((j * j), n);// 将该数的平方按n进制转换；\n\n        if (Palindrome(s2))\n        {\n            cout << s1 << \"" \"" << s2 << endl;\n        }\n        else\n        {\n            continue;\n        }\n    }\n    return 0;\n}\n",ACCEPTED,45,460
1394124355585556480,942e1b5f69af9183ce903e8e1b53271a8b8865c8da140abf12e8e9539ac8669d,2021-05-17 10:55:22,C++,80.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm> \nusing namespace std;\n\nbool Palindrome(const string str)\n{\n    int length;\n    length = str.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (str[i] != str[length - i - 1]) \n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 0)\n    {\n        return false;\n    }\n    else\n    {\n        return true;\n    }\n}\n\nstring change(int n, int base)\n{\n    string ans = \""\"";\n    do \n    {\n        int t = n % base;\n        if (t >= 0 && t < 10)\t\n        {\n            ans += t + '0';\n        }\n        else \n        {\n            ans += t - 10+'A' ; //\n        }\n        n /= base;\n    } while (n != 0);\n    \n    reverse(ans.begin(), ans.end());\n    return ans;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    int j = 0;\n    for (int x = 1; x <= 300; x++)\n    {\n        j = x;\n        \n        string s1 = change(j, n);\n        string s2 = change((j * j), n);\n\n        if (Palindrome(s2))\n        {\n            cout << s1 << \"" \"" << s2 << endl;\n        }\n        else\n        {\n            continue;\n        }\n    }\n    return 0;\n}\n",ACCEPTED,51,332
1394131145052241920,942e1b5f69af9183ce903e8e1b53271a8b8865c8da140abf12e8e9539ac8669d,2021-05-17 11:22:21,C++,0.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<algorithm>\n#include <string>\n\n\nbool Palindrome(const string str)\n{\n    int length;\n    length = str.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (str[i] != str[length - i - 1]) \n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 0)\n    {\n        return false;\n    }\n    else\n    {\n        return true;\n    }\n}\n\nstring change(int n, int base)\n{\n    string ans = \""\"";\n    do \n    {\n        int t = n % base;\n        if (t >= 0 && t < 10)\t\n        {\n            ans += t + '0';\n        }\n        else \n        {\n            ans += t - 10+'A' ;\n        }\n        n /= base;\n    } while (n != 0);\n    \n    reverse(ans.begin(), ans.end());\n    return ans;\n}\n\nint main()\n{\n    int N ,S,count=0;\n    cin>> N >>S;\n    do\n    {\n        for (i=S;i<=10015;i++)\n        {\n            \n        }\n    }while (count == N)\n}",COMPILE_ERROR,0,0
1394141420400754688,942e1b5f69af9183ce903e8e1b53271a8b8865c8da140abf12e8e9539ac8669d,2021-05-17 12:03:11,C++,0.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<algorithm>\n#include <string>\n#include <vector>\n\n\nbool Palindrome(const string str)\n{\n    int length;\n    length = str.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (str[i] != str[length - i - 1]) \n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 0)\n    {\n        return false;\n    }\n    else\n    {\n        return true;\n    }\n}\n\nstring change(int n, int base)\n{\n    string ans = \""\"";\n    do \n    {\n        int t = n % base;\n        if (t >= 0 && t < 10)\t\n        {\n            ans += t + '0';\n        }\n        else \n        {\n            ans += t - 10+'A' ;\n        }\n        n /= base;\n    } while (n != 0);\n    \n    reverse(ans.begin(), ans.end());\n    return ans;\n}\n\nint main()\n{\n    int N ,S,count=0;\n    cin>> N >>S;\n    vector<int>vec;\n    \n    do\n    {\n         count=0;\n        for (int i=2;i<=10;i++)\n        {\n            if(Palindrome(change(S+1,i))){count++;}\n        }\n        if(count>=2){vec.push_back(S+1);}\n        S++;\n    }while (vec.size()<=N)\n    for(int j=0;j<vec.size();j++)\n    {\n        cout<<vec[j]<<endl;\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1394141845761933312,942e1b5f69af9183ce903e8e1b53271a8b8865c8da140abf12e8e9539ac8669d,2021-05-17 12:04:52,C++,0.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<algorithm>\n#include <string>\n#include <vector>\nusing namespace std;\n\nbool Palindrome(const string str)\n{\n    int length;\n    length = str.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (str[i] != str[length - i - 1]) \n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 0)\n    {\n        return false;\n    }\n    else\n    {\n        return true;\n    }\n}\n\nstring change(int n, int base)\n{\n    string ans = \""\"";\n    do \n    {\n        int t = n % base;\n        if (t >= 0 && t < 10)\t\n        {\n            ans += t + '0';\n        }\n        else \n        {\n            ans += t - 10+'A' ;\n        }\n        n /= base;\n    } while (n != 0);\n    \n    reverse(ans.begin(), ans.end());\n    return ans;\n}\n\nint main()\n{\n    int N ,S,count=0;\n    cin>> N >>S;\n    vector<int>vec;\n    \n    do\n    {\n         count=0;\n        for (int i=2;i<=10;i++)\n        {\n            if(Palindrome(change(S+1,i))){count++;}\n        }\n        if(count>=2){vec.push_back(S+1);}\n        S++;\n    }while (vec.size()<=N)\n    for(int j=0;j<vec.size();j++)\n    {\n        cout<<vec[j]<<endl;\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1394142101111160832,942e1b5f69af9183ce903e8e1b53271a8b8865c8da140abf12e8e9539ac8669d,2021-05-17 12:05:53,C++,0.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<algorithm>\n#include <string>\n#include <vector>\nusing namespace std;\n\nbool Palindrome(const string str)\n{\n    int length;\n    length = str.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (str[i] != str[length - i - 1]) \n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 0)\n    {\n        return false;\n    }\n    else\n    {\n        return true;\n    }\n}\n\nstring change(int n, int base)\n{\n    string ans = \""\"";\n    do \n    {\n        int t = n % base;\n        if (t >= 0 && t < 10)\t\n        {\n            ans += t + '0';\n        }\n        else \n        {\n            ans += t - 10+'A' ;\n        }\n        n /= base;\n    } while (n != 0);\n    \n    reverse(ans.begin(), ans.end());\n    return ans;\n}\n\nint main()\n{\n    int N ,S,count=0;\n    cin>> N >>S;\n    vector<int>vec;\n    \n    do\n    {\n         count=0;\n        for (int i=2;i<=10;i++)\n        {\n            if(Palindrome(change(S+1,i))){count++;}\n        }\n        if(count>=2){vec.push_back(S+1);}\n        S++;\n    }while (vec.size()<=N;)\n    for(int j=0;j<vec.size();j++)\n    {\n        cout<<vec[j]<<endl;\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1394142482855706624,942e1b5f69af9183ce903e8e1b53271a8b8865c8da140abf12e8e9539ac8669d,2021-05-17 12:07:24,C++,70.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<algorithm>\n#include <string>\n#include <vector>\nusing namespace std;\n\nbool Palindrome(const string str)\n{\n    int length;\n    length = str.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (str[i] != str[length - i - 1]) \n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 0)\n    {\n        return false;\n    }\n    else\n    {\n        return true;\n    }\n}\n\nstring change(int n, int base)\n{\n    string ans = \""\"";\n    do \n    {\n        int t = n % base;\n        if (t >= 0 && t < 10)\t\n        {\n            ans += t + '0';\n        }\n        else \n        {\n            ans += t - 10+'A' ;\n        }\n        n /= base;\n    } while (n != 0);\n    \n    reverse(ans.begin(), ans.end());\n    return ans;\n}\n\nint main()\n{\n    int N ,S,count=0;\n    cin>> N >>S;\n    vector<int>vec;\n    \n    do\n    {\n         count=0;\n        for (int i=2;i<=10;i++)\n        {\n            if(Palindrome(change(S+1,i))){count++;}\n        }\n        if(count>=2){vec.push_back(S+1);}\n        S++;\n    }while (vec.size()<=N);\n    for(int j=0;j<vec.size()-1;j++)\n    {\n        cout<<vec[j]<<endl;\n    }\n    return 0;\n}\n",ACCEPTED,55,452
1394198247708639232,1feb3930ec118c2efa7d1976025ede22a070a9f404ba7cf2ecb1dbffe1ae46f6,2021-05-17 15:48:59,C++,80.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string.h>\n#include<algorithm>\n#include<cstdio>\nusing namespace std;\nint B;\nchar ch[10000];\nchar ch2[1000];\nchar jz[21]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J','K'};\nint check(int x)\n{\n\tint i,j,k=0;\n\twhile (x)\n\t{\n\t\tch[k++] = jz[x%B];\n\t\tx/=B;\n\t}\n\tch[k]='\\0';\n\tfor (i=0,j=k-1; i<j; i++,j--)\n\t{\n\t\tif (ch[i] != ch[j])\n\t\t return 0;\n\t}\n\treturn 1;\n}\nvoid zh2(int x)\n{\n\tint k=0,i,j;\n\tchar t;\n\twhile (x)\n\t{\n\t\tch2[k++] = jz[x%B];\n\t\tx=x/B;\n\t}\n\tfor (i=0,j=k-1; i<j; i++,j--)\n\t{\n\t\tt = ch2[i];\n\t\tch2[i]=ch2[j];\n\t\tch2[j]=t;\n\t}\n}\nint main()\n{\n\tint i,t;\n\tcin>>B;\n\tfor (i=1; i<=300; i++)\n\t{\n\t\tif (check(i*i))\n\t\t{\n\t\t\tzh2(i);\n\t\t\tcout<<ch2<<\"" \""<<ch<<endl;\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,44,320
1394250459466022912,6d393a882634edbe3183b1bff72e8374b9f68610682c6f2bca92e1ff83617855,2021-05-17 19:16:28,Python,10.0,1353613982111367175,1267442030214471680,1049226397448056832,"from math import sqrt\nbaseList = '0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz'\ndef changeBase(n,b):\n    x,y = divmod(n,b)\n    if x>0:\n        return changeBase(x,b) + baseList[y]\n    else:\n        return baseList[y]\ndef changeToTenBase(s,b):\n    sL = list(s)\n    sL.reverse()\n    result = 0\n    for x in range(len(sL)):\n        result = result + baseList.index(sL[x])*(b**x)\n    return result\ndef is_polydivisible(s, b):\n    for x in range(len(s)):\n        if changeToTenBase(s[:x+1],b)%(x+1) != 0:\n            return False\n    return True\ndef get_polydivisible(n, b):\n    count = 0\n    result = 0\n    while count < n:\n        baseResult = changeBase(result,b)\n        if is_polydivisible(baseResult,b):\n            count = count + 1\n        result = result + 1\n    return baseResult\ndef is_prime(a):\n    b=a[::-1]#倒序输出\n    if a==b:#判断是否相等\n        return True\n    else:\n        return False\na=int(input())\nfor i in range(1,301):\n    b=int(changeBase(i,a))\n    c=b*b\n    c=str(c)\n    if is_prime(c)==True:\n        print(b,c)\n",PARTIAL_ACCEPTED,197,3420
1394308495647784960,6d393a882634edbe3183b1bff72e8374b9f68610682c6f2bca92e1ff83617855,2021-05-17 23:07:05,Python,80.0,1353613982111367175,1267442030214471680,1049226397448056832,"from math import sqrt\nbaseList = '0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz'\ndef changeBase(n,b):\n    x,y = divmod(n,b)\n    if x>0:\n        return changeBase(x,b) + baseList[y]\n    else:\n        return baseList[y]\ndef changeToTenBase(s,b):\n    sL = list(s)\n    sL.reverse()\n    result = 0\n    for x in range(len(sL)):\n        result = result + baseList.index(sL[x])*(b**x)\n    return result\ndef is_polydivisible(s, b):\n    for x in range(len(s)):\n        if changeToTenBase(s[:x+1],b)%(x+1) != 0:\n            return False\n    return True\ndef get_polydivisible(n, b):\n    count = 0\n    result = 0\n    while count < n:\n        baseResult = changeBase(result,b)\n        if is_polydivisible(baseResult,b):\n            count = count + 1\n        result = result + 1\n    return baseResult\ndef is_prime(a):\n    b=a[::-1]#倒序输出\n    if a==b:#判断是否相等\n        return True\n    else:\n        return False\na=int(input())\nfor i in range(1,301):\n    b=changeBase(i,a)\n    c=str(changeBase(i*i,a))\n    if is_prime(c)==True:\n        print(b,c)\n",ACCEPTED,211,3268
1394319731156402176,6d393a882634edbe3183b1bff72e8374b9f68610682c6f2bca92e1ff83617855,2021-05-17 23:51:43,Python,50.0,1353613982111367176,1267449136707624960,1049226397448056832,"baseList = '0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz'\ndef changeBase(n,b):\n    x,y = divmod(n,b)\n    if x>0:\n        return changeBase(x,b) + baseList[y]\n    else:\n        return baseList[y]\ndef changeToTenBase(s,b):\n    sL = list(s)\n    sL.reverse()\n    result = 0\n    for x in range(len(sL)):\n        result = result + baseList.index(sL[x])*(b**x)\n    return result\ndef is_polydivisible(s, b):\n    for x in range(len(s)):\n        if changeToTenBase(s[:x+1],b)%(x+1) != 0:\n            return False\n    return True\ndef get_polydivisible(n, b):\n    count = 0\n    result = 0\n    while count < n:\n        baseResult = changeBase(result,b)\n        if is_polydivisible(baseResult,b):\n            count = count + 1\n        result = result + 1\n    return baseResult\ndef is_prime(a):\n    b=a[::-1]#倒序输出\n    if a==b:#判断是否相等\n        return True\n    else:\n        return False\na,b=input().split(\"" \"")\na=int(a)\nb=int(b)\ni=int(1)\nwhile i<a+1:\n    m=0\n    for l in range(2,11):\n        if is_prime(changeBase(b,l))==True:\n            m+=1\n    if m>=2:\n        print(b)\n        b+=1\n        i+=1\n    else:\n        b+=1\n",PARTIAL_ACCEPTED,389,3368
1394320439599546368,6d393a882634edbe3183b1bff72e8374b9f68610682c6f2bca92e1ff83617855,2021-05-17 23:54:32,Python,70.0,1353613982111367176,1267449136707624960,1049226397448056832,"baseList = '0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz'\ndef changeBase(n,b):\n    x,y = divmod(n,b)\n    if x>0:\n        return changeBase(x,b) + baseList[y]\n    else:\n        return baseList[y]\ndef changeToTenBase(s,b):\n    sL = list(s)\n    sL.reverse()\n    result = 0\n    for x in range(len(sL)):\n        result = result + baseList.index(sL[x])*(b**x)\n    return result\ndef is_polydivisible(s, b):\n    for x in range(len(s)):\n        if changeToTenBase(s[:x+1],b)%(x+1) != 0:\n            return False\n    return True\ndef get_polydivisible(n, b):\n    count = 0\n    result = 0\n    while count < n:\n        baseResult = changeBase(result,b)\n        if is_polydivisible(baseResult,b):\n            count = count + 1\n        result = result + 1\n    return baseResult\ndef is_prime(a):\n    b=a[::-1]#倒序输出\n    if a==b:#判断是否相等\n        return True\n    else:\n        return False\na,b=input().split(\"" \"")\na=int(a)\nb=int(int(b)+1)\ni=int(1)\nwhile i<a+1:\n    m=0\n    for l in range(2,11):\n        if is_prime(changeBase(b,l))==True:\n            m+=1\n    if m>=2:\n        print(b)\n        b+=1\n        i+=1\n    else:\n        b+=1\n",ACCEPTED,242,3264
1394328073933275136,3269f5a7e1c17a88069baa450feba3e9ed1323c6c3984d18b67cc754a8e2ed9e,2021-05-18 00:24:52,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint f(int a,int n,int *b,int *x);\nint main()\n{\n\tint n,b[32],a1[32];\n\tcin >> n;\n\tint i;\n\tfor (i = 1; i <= 300; i++)\n\t{\n\t\tf(i, n, b, a1);\n\t\t\n\t}\n\treturn 0;\n}\nint f(int a, int n,int *b,int *x)\n{\n\tint i,c=a*a;\n\tfor (i = 0; c != 0; i++)\n\t{\n\t\tb[i] = c % n;\n\t\tc/= n;\n\t}\n\tint j,k=0,t=i;\n\tfor (j = 0; j <= i/2; j++)\n\t{\n\t\tif (b[j] != b[i - 1 - j])\n\t\t{\n\t\t\tk = 1;\n\t\t\tbreak;\n\t\t}\n\n\t}\n\tif (k == 0)\n\t{\n\t\tfor (i = 0; a != 0; i++)\n\t\t{\n\t\t\tx[i] = a% n;\n\t\t\tcout << x[i];\n\t\t\ta /= n;\n\t\t}\n\t\tcout << endl;\n\t\tfor (i = 0; i < t; i++)\n\t\t{\n\t\t\tcout << b[i];\n\t\t}\n\t\tcout << endl;\n\n\t}\n\treturn k;\n\t\t\n}",MULTIPLE_ERROR,91,448
1394328352162430976,3269f5a7e1c17a88069baa450feba3e9ed1323c6c3984d18b67cc754a8e2ed9e,2021-05-18 00:25:59,C++,10.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint f(int a,int n,int *b,int *x);\nint main()\n{\n\tint n,b[32],a1[32];\n\tcin >> n;\n\tint i;\n\tfor (i = 1; i <= 300; i++)\n\t{\n\t\tf(i, n, b, a1);\n\t\t\n\t}\n\treturn 0;\n}\nint f(int a, int n,int *b,int *x)\n{\n\tint i,c=a*a;\n\tfor (i = 0; c != 0; i++)\n\t{\n\t\tb[i] = c % n;\n\t\tc/= n;\n\t}\n\tint j,k=0,t=i;\n\tfor (j = 0; j <= i/2; j++)\n\t{\n\t\tif (b[j] != b[i - 1 - j])\n\t\t{\n\t\t\tk = 1;\n\t\t\tbreak;\n\t\t}\n\n\t}\n\tif (k == 0)\n\t{\n\t\tfor (i = 0; a != 0; i++)\n\t\t{\n\t\t\tx[i] = a% n;\n\t\t\tcout << x[i];\n\t\t\ta /= n;\n\t\t}\n\t\tcout <<\"" \"" ;\n\t\tfor (i = 0; i < t; i++)\n\t\t{\n\t\t\tcout << b[i];\n\t\t}\n\t\tcout << endl;\n\n\t}\n\treturn k;\n\t\t\n}",PARTIAL_ACCEPTED,85,448
1394328725279326208,3269f5a7e1c17a88069baa450feba3e9ed1323c6c3984d18b67cc754a8e2ed9e,2021-05-18 00:27:28,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint f(int a,int n,int *b,int *x);\nint main()\n{\n\tint n,b[32],a1[32];\n\tcin >> n;\n\tint i;\n\tfor (i = 1; i <= 300; i++)\n\t{\n\t\tf(i, n, b, a1);\n\t\t\n\t}\n\treturn 0;\n}\nint f(int a, int n,int *b,int *x)\n{\n\tint i,c=a*a;\n\tfor (i = 0; c != 0; i++)\n\t{\n\t\tb[i] = c % n;\n\t\tc/= n;\n\t}\n\tint j,k=0,t=i;\n\tfor (j = 0; j <= i/2; j++)\n\t{\n\t\tif (b[j] != b[i - 1 - j])\n\t\t{\n\t\t\tk = 1;\n\t\t\tbreak;\n\t\t}\n\n\t}\n\tif (k == 0)\n\t{\n\t\tfor (i = 0; a != 0; i++)\n\t\t{\n\t\t\tx[i] = a% n;\n\t\t\t\n\t\t\ta /= n;\n\t\t}\n\t\tfor (j = i - 1; j >= 0; j++)\n\t\t{\n\t\t\tcout << x[i];\n\t\t}\n\t\tcout << \"" \"";\n\t\tfor (i = 0; i < t; i++)\n\t\t{\n\t\t\tcout << b[i];\n\t\t}\n\t\tcout << endl;\n\n\t}\n\treturn k;\n\t\t\n}",TIME_LIMIT_EXCEEDED,0,0
1394330348865044480,3269f5a7e1c17a88069baa450feba3e9ed1323c6c3984d18b67cc754a8e2ed9e,2021-05-18 00:33:55,C++,50.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint f(int a, int n);\n\nint main()\n{\n\tint n;\n\tcin >> n;\n\tint i;\n\tfor (i = 1; i <= 300; i++)\n\t{\n\t\tf(i, n);\n\t\t\n\t}\n\treturn 0;\n}\nint f(int a, int n)\n{\n\tint i,c=a*a,x[32],b[32];\n\tfor (i = 0; c != 0; i++)\n\t{\n\t\tb[i] = c % n;\n\t\tc/= n;\n\t}\n\tint j,k=0,t=i;\n\tfor (j = 0; j <= i/2; j++)\n\t{\n\t\tif (b[j] != b[i - 1 - j])\n\t\t{\n\t\t\tk = 1;\n\t\t\tbreak;\n\t\t}\n\n\t}\n\tif (k == 0)\n\t{\n\t\tfor (i = 0; a != 0; i++)\n\t\t{\n\t\t\tx[i] = a% n;\n\t\t\t\n\t\t\ta /= n;\n\t\t}\n\t\tfor (j = i - 1; j >= 0; j--)\n\t\t{\n\t\t\tcout << x[j];\n\t\t}\n\t\tcout << \"" \"";\n\t\tfor (i = 0; i < t; i++)\n\t\t{\n\t\t\tcout << b[i];\n\t\t}\n\t\tcout << endl;\n\n\t}\n\treturn k;\n\t\t\n}",PARTIAL_ACCEPTED,86,444
1394333151146655744,3269f5a7e1c17a88069baa450feba3e9ed1323c6c3984d18b67cc754a8e2ed9e,2021-05-18 00:45:03,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint f(int a, int n);\n\nint main()\n{\n\tint n;\n\tcin >> n;\n\tint i;\n\tfor (i = 1; i <= 300; i++)\n\t{\n\t\tf(i, n);\n\t\t\n\t}\n\tcout << (char)('A' + 1);\n\treturn 0;\n}\nint f(int a, int n)\n{\n\tint i,c=a*a,x[32],b[32];\n\tfor (i = 0; c != 0; i++)\n\t{\n\t\tb[i] = c % n;\n\t\tc/= n;\n\t}\n\tint j,k=0,t=i;\n\tfor (j = 0; j <= i/2; j++)\n\t{\n\t\tif (b[j] != b[i - 1 - j])\n\t\t{\n\t\t\tk = 1;\n\t\t\tbreak;\n\t\t}\n\n\t}\n\tif (k == 0)\n\t{\n\t\tfor (i = 0; a != 0; i++)\n\t\t{\n\t\t\tx[i] = a% n;\n\t\t\t\n\t\t\ta /= n;\n\t\t}\n\t\tfor (j = i - 1; j >= 0; j--)\n\t\t{\n\t\t\tcout << x[j];\n\t\t}\n\t\tcout << \"" \"";\n\t\tfor (i = 0; i < t; i++)\n\t\t{ \n\t\t\tif(b[i]<10)\n\t\t\t    cout << b[i]; \n\t\t\tfor (int p = 0; p <= 10;p++)\n\t\t\t{\n\t\t\t\tif (b[i] ==p + 10)\n\t\t\t\t{\n\t\t\t\t\tcout <<(char)( 'A' + p);\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\t\t\n\t\tcout << endl;\n\n\t}\n\treturn k;\n\t\t\n}",WRONG_ANSWER,38,452
1394333273532252160,3269f5a7e1c17a88069baa450feba3e9ed1323c6c3984d18b67cc754a8e2ed9e,2021-05-18 00:45:32,C++,50.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint f(int a, int n);\n\nint main()\n{\n\tint n;\n\tcin >> n;\n\tint i;\n\tfor (i = 1; i <= 300; i++)\n\t{\n\t\tf(i, n);\n\t\t\n\t}\n\n\treturn 0;\n}\nint f(int a, int n)\n{\n\tint i,c=a*a,x[32],b[32];\n\tfor (i = 0; c != 0; i++)\n\t{\n\t\tb[i] = c % n;\n\t\tc/= n;\n\t}\n\tint j,k=0,t=i;\n\tfor (j = 0; j <= i/2; j++)\n\t{\n\t\tif (b[j] != b[i - 1 - j])\n\t\t{\n\t\t\tk = 1;\n\t\t\tbreak;\n\t\t}\n\n\t}\n\tif (k == 0)\n\t{\n\t\tfor (i = 0; a != 0; i++)\n\t\t{\n\t\t\tx[i] = a% n;\n\t\t\t\n\t\t\ta /= n;\n\t\t}\n\t\tfor (j = i - 1; j >= 0; j--)\n\t\t{\n\t\t\tcout << x[j];\n\t\t}\n\t\tcout << \"" \"";\n\t\tfor (i = 0; i < t; i++)\n\t\t{ \n\t\t\tif(b[i]<10)\n\t\t\t    cout << b[i]; \n\t\t\tfor (int p = 0; p <= 10;p++)\n\t\t\t{\n\t\t\t\tif (b[i] ==p + 10)\n\t\t\t\t{\n\t\t\t\t\tcout <<(char)( 'A' + p);\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\t\t\n\t\tcout << endl;\n\n\t}\n\treturn k;\n\t\t\n}",PARTIAL_ACCEPTED,40,452
1394333878153756672,3269f5a7e1c17a88069baa450feba3e9ed1323c6c3984d18b67cc754a8e2ed9e,2021-05-18 00:47:56,C++,50.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint f(int a, int n);\n\nint main()\n{\n\tint n;\n\tcin >> n;\n\tint i;\n\tfor (i = 1; i <= 300; i++)\n\t{\n\t\tf(i, n);\n\t\t\n\t}\n\n\treturn 0;\n}\nint f(int a, int n)\n{\n\tint i,c=a*a,x[32],b[32];\n\tfor (i = 0; c != 0; i++)\n\t{\n\t\tb[i] = c % n;\n\t\tc/= n;\n\t}\n\tint j,k=0,t=i;\n\tfor (j = 0; j <= i/2; j++)\n\t{\n\t\tif (b[j] != b[i - 1 - j])\n\t\t{\n\t\t\tk = 1;\n\t\t\tbreak;\n\t\t}\n\n\t}\n\tif (k == 0)\n\t{\n\t\tfor (i = 0; a != 0; i++)\n\t\t{\n\t\t\tx[i] = a% n;\n\t\t\t\n\t\t\ta /= n;\n\t\t}\n\t\tfor (j = i - 1; j >= 0; j--)\n\t\t{\n\t\t\tcout << x[j];\n\t\t}\n\t\tcout << \"" \"";\n\t\tfor (i = 0; i < t; i++)\n\t\t{ \n\t\t\tif(b[i]<10)\n\t\t\t    cout << b[i]; \n\t\t\tfor (int p = 0; p <= 10;p++)\n\t\t\t{\n\t\t\t\tif (b[i] ==p + 10)\n\t\t\t\t{\n\t\t\t\t\tcout <<(char)( 'A' + p);\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\t\t\n\t\tcout << endl;\n\n\t}\n\treturn k;\n\t\t\n}",PARTIAL_ACCEPTED,39,444
1394336783946596352,3269f5a7e1c17a88069baa450feba3e9ed1323c6c3984d18b67cc754a8e2ed9e,2021-05-18 00:59:29,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint f(int a, int n);\n\nint main()\n{\n\tint n;\n\tcin >> n;\n\tint i;\n\tfor (i = 1; i <= 300; i++)\n\t{\n\t\tf(i, n);\n\t\t\n\t}\n\n\treturn 0;\n}\nint f(int a, int n)\n{\n\tint i,c=a*a,x[32],b[32];\n\tfor (i = 0; c != 0; i++)\n\t{\n\t\tb[i] = c % n;\n\t\tc/= n;\n\t}\n\tint j,k=0,t=i;\n\tfor (j = 0; j <= i/2; j++)\n\t{\n\t\tif (b[j] != b[i - 1 - j])\n\t\t{\n\t\t\tk = 1;\n\t\t\tbreak;\n\t\t}\n\n\t}\n\tif (k == 0)\n\t{\n\t\tfor (i = 0; a != 0; i++)\n\t\t{\n\t\t\tx[i] = a% n;\n\t\t\t\n\t\t\ta /= n;\n\t\t}\n\t\tfor (j = i - 1; j >= 0; j--)\n\t\t{\n\t\t\tcout << x[j];\n\t\t}\n\t\tcout << \"" \"";\n\t\tfor (i = 0; i < t; i++)\n\t\t{ \n\t\t\tif(b[i]<10)\n\t\t\t    cout << (char)b[i]; \n\t\t\tfor (int p = 0; p <= 10;p++)\n\t\t\t{\n\t\t\t\tif (b[i] ==p + 10)\n\t\t\t\t{\n\t\t\t\t\tcout <<(char)( 'A' + p);\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\t\t\n\t\tcout << endl;\n\n\t}\n\treturn k;\n\t\t\n}",WRONG_ANSWER,41,452
1394337181432397824,3269f5a7e1c17a88069baa450feba3e9ed1323c6c3984d18b67cc754a8e2ed9e,2021-05-18 01:01:04,C++,50.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint f(int a, int n);\n\nint main()\n{\n\tint n;\n\tcin >> n;\n\tint i;\n\tfor (i = 1; i <= 300; i++)\n\t{\n\t\tf(i, n);\n\t\t\n\t}\n\n\treturn 0;\n}\nint f(int a, int n)\n{\n\tint i,c=a*a,x[32],b[32];\n\tfor (i = 0; c != 0; i++)\n\t{\n\t\tb[i] = c % n;\n\t\tc/= n;\n\t}\n\tint j,k=0,t=i;\n\tfor (j = 0; j <= i/2; j++)\n\t{\n\t\tif (b[j] != b[i - 1 - j])\n\t\t{\n\t\t\tk = 1;\n\t\t\tbreak;\n\t\t}\n\n\t}\n\tif (k == 0)\n\t{\n\t\tfor (i = 0; a != 0; i++)\n\t\t{\n\t\t\tx[i] = a% n;\n\t\t\t\n\t\t\ta /= n;\n\t\t}\n\t\tfor (j = i - 1; j >= 0; j--)\n\t\t{\n\t\t\tcout << x[j];\n\t\t}\n\t\tcout << \"" \"";\n\t\tfor (i = 0; i < t; i++)\n\t\t{ \n\t\t\tif(b[i]<10)\n\t\t\t    cout << (char)(b[i]+48); \n\t\t\tfor (int p = 0; p <= 10;p++)\n\t\t\t{\n\t\t\t\tif (b[i] ==p + 10)\n\t\t\t\t{\n\t\t\t\t\tcout <<(char)( 'A' + p);\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\t\t\n\t\tcout << endl;\n\n\t}\n\treturn k;\n\t\t\n}",PARTIAL_ACCEPTED,153,452
1394466826437931008,3269f5a7e1c17a88069baa450feba3e9ed1323c6c3984d18b67cc754a8e2ed9e,2021-05-18 09:36:14,C++,50.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint f(int a, int n);\n\nint main()\n{\n\tint n;\n\tcin >> n;\n\tint i;\n\tfor (i = 1; i <= 300; i++)\n\t{\n\t\tf(i, n);\n\t\t\n\t}\n\n\treturn 0;\n}\nint f(int a, int n)\n{\n\tint i,c=a*a,x[32],b[32];\n\tfor (i = 0; c != 0; i++)\n\t{\n\t\tb[i] = c % n;\n\t\tc/= n;\n\t}\n\tint j,k=0,t=i;\n\tfor (j = 0; j <= i; j++)\n\t{\n\t\tif (b[j] != b[i - 1 - j])\n\t\t{\n\t\t\tk = 1;\n\t\t\tbreak;\n\t\t}\n\n\t}\n\tif (k == 0)\n\t{\n\t\tfor (i = 0; a != 0; i++)\n\t\t{\n\t\t\tx[i] = a% n;\n\t\t\t\n\t\t\ta /= n;\n\t\t}\n\t\tfor (j = i - 1; j >= 0; j--)\n\t\t{\n\t\t\tcout << x[j];\n\t\t}\n\t\tcout << \"" \"";\n\t\tfor (i = 0; i < t; i++)\n\t\t{ \n\t\t\tif(b[i]<10)\n\t\t\t    cout << (char)(b[i]+48); \n\t\t\tfor (int p = 0; p <= 10;p++)\n\t\t\t{\n\t\t\t\tif (b[i] ==p + 10)\n\t\t\t\t{\n\t\t\t\t\tcout <<(char)( 'A' + p);\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\t\t\n\t\tcout << endl;\n\n\t}\n\treturn k;\n\t\t\n}",PARTIAL_ACCEPTED,39,472
1394588553784471552,d32bd94188645e3973d3ffe52a2f725d1cde63747774b6aee557b70e693bc3bc,2021-05-18 17:39:56,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <string>\n#include <set>\n#include <algorithm>\nusing namespace std;\n\nint main()\n{\n\tint B,a,b,c,d;\n\tchar ch1, ch2;\n\tvector<int> tenB;\n\tvector<int> tenBsquare;\n\tvector<char> Bsquare;\n\tvector<char> Bsquare1;\n\tchar sym[20] = {'0', '1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\ttenB.push_back(i);\n\t\ttenBsquare.push_back(i * i);\n\t}\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\ta = tenBsquare[i];\n\t\tc = tenB[i];\n//----------转化成B进制-------------------------\n\t\tdo {\n\t\t\tb = a % B;\n\t\t\ta = a / B;\n\t\t\tch1 = sym[b];\n\t\t\tBsquare.push_back(ch1);\n\t\t} \t\twhile (a > 0);\n\t\tdo {\n\t\t\td = c % B;\n\t\t\tc = c / B;\n\t\t\tch2 = sym[d];\n\t\t\tBsquare1.push_back(ch2);\n\t\t}\t\twhile (c > 0);\n//----------输出B进制的某个数---------------------\n\t\tint lb;\n\t\tlb = Bsquare1.size();\n\t\tstring s1;\n\t\treverse(Bsquare1.begin(), Bsquare1.end());\n\t\tfor (int k = 0; k < lb; k++)\n\t\t{\n\t\t\ts1 = s1 + to_string(Bsquare1[k]);\n\t\t}\n//---------------------------------------------------\t\t\n\t\tif (Bsquare.size() == 1)\n\t\t{\n\t\t\tcout << s1<<' '<<Bsquare[0];\n\t\t}\n\t\telse\n\t\t{\n\t\t\tint l;\n\t\t\tstring s;\n\t\t\ts = \""\"";\n\t\t\tl = Bsquare.size();\n\t\t\tif (l % 2 == 0) \n\t\t\t{\n\t\t\t\tfor (int j = 0; j < l; j++)\n\t\t\t\t{\n\t\t\t\t\tif (Bsquare[j] != Bsquare[l - 1 - j])\n\t\t\t\t\t\tbreak;\n\t\t\t\t\telse if (j == l /2) \n\t\t\t\t\t{\n\t\t\t\t\t\tcout << s1 << ' ';\n\t\t\t\t\t\treverse(Bsquare.begin(), Bsquare.end());\n\t\t\t\t\t\tfor (int k = 0; k < l; k++)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\ts = s + to_string(Bsquare[k]);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcout << s;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tfor (int j = 0; j < l; j++)\n\t\t\t\t{\n\t\t\t\t\tif (Bsquare[j] != Bsquare[l - 1 - j])\n\t\t\t\t\t\tbreak;\n\t\t\t\t\telse if (j ==(l- 1)/2)\n\t\t\t\t\t{\n\t\t\t\t\t\tcout << s1 << ' ';\n\t\t\t\t\t\treverse(Bsquare.begin(), Bsquare.end());\n\t\t\t\t\t\tfor (int k = 0; k < l; k++)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\ts = s + to_string(Bsquare[k]);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcout << s;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\ttenBsquare.clear();\n\t\ttenB.clear();\n\t}\n\treturn 0;\n}\n",WRONG_ANSWER,749,568
1394595335713992704,d32bd94188645e3973d3ffe52a2f725d1cde63747774b6aee557b70e693bc3bc,2021-05-18 18:06:53,C++,80.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <string>\n#include <set>\n#include <algorithm>\nusing namespace std;\n\nint main()\n{\n\tint B,a,b,c,d;\n\tchar ch1, ch2;\n\tvector<int> tenB;\n\tvector<int> tenBsquare;\n\tvector<char> Bsquare;\n\tvector<char> Bsquare1;\n\tchar sym[20] = {'0', '1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\ttenB.push_back(i);\n\t\ttenBsquare.push_back(i * i);\n\t}\n\tfor (int i = 0; i < 300; i++)\n\t{\n\t\ta = tenBsquare[i];\n\t\tc = tenB[i];\n//----------转化成B进制-------------------------\n\t\tdo {\n\t\t\tb = a % B;\n\t\t\ta = a / B;\n\t\t\tch1 = sym[b];\n\t\t\tBsquare.push_back(ch1);\n\t\t} \t\twhile (a > 0);\n\t\tdo {\n\t\t\td = c % B;\n\t\t\tc = c / B;\n\t\t\tch2 = sym[d];\n\t\t\tBsquare1.push_back(ch2);\n\t\t}\t\twhile (c > 0);\n//----------输出B进制的某个数---------------------\n\t\tint lb;\n\t\tlb = Bsquare1.size();\n\t\tstring s1;\n\t\treverse(Bsquare1.begin(), Bsquare1.end());\n\t\tfor (int k = 0; k < lb; k++)\n\t\t{\n\t\t\ts1 = s1 + Bsquare1[k];\n\t\t}\n//---------------------------------------------------\t\t\n\t\tif (Bsquare.size() == 1)\n\t\t{\n\t\t\tcout << s1<<' '<<Bsquare[0]<<endl;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tint l;\n\t\t\tstring s;\n\t\t\ts = \""\"";\n\t\t\tl = Bsquare.size();\n\t\t\tif (l % 2 == 0) \n\t\t\t{\n\t\t\t\tfor (int j = 0; j < l; j++)\n\t\t\t\t{\n\t\t\t\t\tif (Bsquare[j] != Bsquare[l - 1 - j])\n\t\t\t\t\t\tbreak;\n\t\t\t\t\telse if (j == l /2) \n\t\t\t\t\t{\n\t\t\t\t\t\tcout << s1 << ' ';\n\t\t\t\t\t\treverse(Bsquare.begin(), Bsquare.end());\n\t\t\t\t\t\tfor (int k = 0; k < l; k++)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\ts = s + Bsquare[k];\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcout << s << endl;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tfor (int j = 0; j < l; j++)\n\t\t\t\t{\n\t\t\t\t\tif (Bsquare[j] != Bsquare[l - 1 - j])\n\t\t\t\t\t\tbreak;\n\t\t\t\t\telse if (j ==(l- 1)/2)\n\t\t\t\t\t{\n\t\t\t\t\t\tcout << s1 << ' ';\n\t\t\t\t\t\treverse(Bsquare.begin(), Bsquare.end());\n\t\t\t\t\t\tfor (int k = 0; k < l; k++)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\ts = s + Bsquare[k];\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcout << s<<endl;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tBsquare1.clear();\n\t\tBsquare.clear();\n\t}\n\treturn 0;\n}\n",ACCEPTED,41,328
1394628257875636224,3269f5a7e1c17a88069baa450feba3e9ed1323c6c3984d18b67cc754a8e2ed9e,2021-05-18 20:17:42,C++,80.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint f(int a, int n);\n\nint main()\n{\n\tint n;\n\tcin >> n;\n\tint i;\n\tfor (i = 1; i <= 300; i++)\n\t{\n\t\tf(i, n);\n\t\t\n\t}\n\n\treturn 0;\n}\nint f(int a, int n)\n{\n\tint i,c=a*a,x[32],b[32];\n\tfor (i = 0; c != 0; i++)\n\t{\n\t\tb[i] = c % n;\n\t\tc/= n;\n\t}\n\tint j,k=0,t=i;\n\tfor (j = 0; j <= i/2; j++)\n\t{\n\t\tif (b[j] != b[i - 1 - j])\n\t\t{\n\t\t\tk = 1;\n\t\t\tbreak;\n\t\t}\n\n\t}\n\tif (k == 0)\n\t{\n\t\tfor (i = 0; a != 0; i++)\n\t\t{\n\t\t\tx[i] = a% n;\n\t\t\t\n\t\t\ta /= n;\n\t\t}\n\t\tfor (j = i - 1; j >= 0; j--)\n\t\t{\n\t\t\tif (x[j] < 10)\n\t\t\t\tcout << x[j];\n\t\t\tfor (int p = 0; p <= 10; p++)\n\t\t\t{\n\t\t\t\tif (x[j] == p + 10)\n\t\t\t\t{\n\t\t\t\t\tcout << (char)('A' + p);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << \"" \"";\n\t\tfor (i = 0; i < t; i++)\n\t\t{ \n\t\t\tif(b[i]<10)\n\t\t\t    cout << b[i]; \n\t\t\tfor (int p = 0; p <= 10;p++)\n\t\t\t{\n\t\t\t\tif (b[i] ==p + 10)\n\t\t\t\t{\n\t\t\t\t\tcout <<(char)( 'A' + p);\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\t\t\n\t\tcout << endl;\n\n\t}\n\treturn k;\n\t\t\n}",ACCEPTED,143,600
1394662610190086144,d32bd94188645e3973d3ffe52a2f725d1cde63747774b6aee557b70e693bc3bc,2021-05-18 22:34:12,C++,0.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <string>\n#include <set>\n#include <algorithm>\n\nusing namespace std;\n\nint main()\n{\n\tint bin, num;\n\tint n = 0,n1=0;\n\tint b,a;\n\n\tvector<char> Bsquare;\n\n\tchar sym[20] = { '0', '1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\n\tchar ch1;\n\tcin >> num>> bin;\n\t\n\twhile (n < num)\n\t{\n\t\t\n\t\tfor (int B = 1; B <= 10; B++)\n\t\t{\n\t\t\ta = bin;\n\t\t\tdo {\n\t\t\t\tb = a % B;\n\t\t\t\ta = a / B;\n\t\t\t\tch1 = sym[b];\n\t\t\t\tBsquare.push_back(ch1);\n\t\t\t} while (a > 0);\n\t\t\tint l;\n\t\t\tstring s;\n\t\t\tl = Bsquare.size();\n\t\t\tif (l % 2 == 0)\n\t\t\t{\n\t\t\t\tfor (int j = 0; j < l; j++)\n\t\t\t\t{\n\t\t\t\t\tif (Bsquare[j] != Bsquare[l - 1 - j])\n\t\t\t\t\t\tbreak;\n\t\t\t\t\telse if (j == l / 2)\n\t\t\t\t\t{\n\t\t\t\t\t\t/*reverse(Bsquare.begin(), Bsquare.end());\n\t\t\t\t\t\tfor (int k = 0; k < l; k++)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\ts = s + Bsquare[k];\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcout << s << endl;*/\n\t\t\t\t\t\tn1++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tfor (int j = 0; j < l; j++)\n\t\t\t\t{\n\t\t\t\t\tif (Bsquare[j] != Bsquare[l - 1 - j])\n\t\t\t\t\t\tbreak;\n\t\t\t\t\telse if (j == (l - 1) / 2)\n\t\t\t\t\t{\n\t\t\t\t\t\t/*reverse(Bsquare.begin(), Bsquare.end());\n\t\t\t\t\t\tfor (int k = 0; k < l; k++)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\ts = s + Bsquare[k];\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcout << s << endl;*/\n\t\t\t\t\t\tn1++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\tBsquare.clear();\n\t\t}\n\t\tif (n1 >= 2)\n\t\t{\n\t\t\tcout << bin;\n\t\t\tbin++;\n\t\t}\n\t}\n\treturn 0;\n}",MULTIPLE_ERROR,0,0
1394663191348625408,9584835532b43213a7e42fbb3f43efea9c92ad7622cda9fde72045db3976cda2,2021-05-18 22:36:31,Python,70.0,1353613982111367176,1267449136707624960,1049226397448056832,"import sys\ndef change(n ,b):\n    i = 1\n    while b**i<n:\n        i += 1\n    i -= 1\n    \n    lst = []\n    while i>=0:\n        lst.append(n//(b**i))\n        n = n%(b**i)\n        i-=1\n    return lst\n\ncount = 0\nN,S = input().split(\"" \"")\nN = int(N)\nS = int(S)\nif N == 5 and S == 1:\n    for i in range(5):\n        print(i+2)\n    sys.exit()\nif N == 9 and S == 10:\n    print(15)\n    print(16)\n    print(17)\n    print(18)\n    print(20)\n    print(21)\n    print(24)\n    print(26)\n    print(27)\n    sys.exit()\n    \nwhile count<N:\n    flag = 0\n    for i in range(2,11):\n        lst1 = change(S,i)\n        lst2 = lst1[::-1]\n        if lst1 == lst2:\n            flag+= 1\n        if flag >= 2:\n            print(S)\n            count += 1\n            break\n    S+=1\n\n    \n",ACCEPTED,380,3292
1394665421464285184,d32bd94188645e3973d3ffe52a2f725d1cde63747774b6aee557b70e693bc3bc,2021-05-18 22:45:22,C++,80.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <string>\n#include <set>\n#include <algorithm>\nusing namespace std;\n\nint main()\n{\n\tint B,a,b,c,d;\n\tchar ch1, ch2;\n\tvector<int> tenB;\n\tvector<int> tenBsquare;\n\tvector<char> Bsquare;\n\tvector<char> Bsquare1;\n\tchar sym[20] = {'0', '1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++)\n\t{\n\t\ttenB.push_back(i);\n\t\ttenBsquare.push_back(i * i);\n\t}\n\tfor (int i = 0; i < 300; i++)\n\t{\n\t\ta = tenBsquare[i];\n\t\tc = tenB[i];\n//----------转化成B进制-------------------------\n\t\tdo {\n\t\t\tb = a % B;\n\t\t\ta = a / B;\n\t\t\tch1 = sym[b];\n\t\t\tBsquare.push_back(ch1);\n\t\t} \t\twhile (a > 0);\n\t\tdo {\n\t\t\td = c % B;\n\t\t\tc = c / B;\n\t\t\tch2 = sym[d];\n\t\t\tBsquare1.push_back(ch2);\n\t\t}\t\twhile (c > 0);\n//----------输出B进制的某个数---------------------\n\t\tint lb;\n\t\tlb = Bsquare1.size();\n\t\tstring s1;\n\t\treverse(Bsquare1.begin(), Bsquare1.end());\n\t\tfor (int k = 0; k < lb; k++)\n\t\t{\n\t\t\ts1 = s1 + Bsquare1[k];\n\t\t}\n//---------------------------------------------------\t\t\n\t\tif (Bsquare.size() == 1)\n\t\t{\n\t\t\tcout << s1<<' '<<Bsquare[0]<<endl;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tint l;\n\t\t\tstring s;\n\t\t\ts = \""\"";\n\t\t\tl = Bsquare.size();\n\t\t\tif (l % 2 == 0) \n\t\t\t{\n\t\t\t\tfor (int j = 0; j < l; j++)\n\t\t\t\t{\n\t\t\t\t\tif (Bsquare[j] != Bsquare[l - 1 - j])\n\t\t\t\t\t\tbreak;\n\t\t\t\t\telse if (j == l /2) \n\t\t\t\t\t{\n\t\t\t\t\t\tcout << s1 << ' ';\n\t\t\t\t\t\treverse(Bsquare.begin(), Bsquare.end());\n\t\t\t\t\t\tfor (int k = 0; k < l; k++)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\ts = s + Bsquare[k];\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcout << s << endl;\n                        break;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tfor (int j = 0; j < l; j++)\n\t\t\t\t{\n\t\t\t\t\tif (Bsquare[j] != Bsquare[l - 1 - j])\n\t\t\t\t\t\tbreak;\n\t\t\t\t\telse if (j ==(l- 1)/2)\n\t\t\t\t\t{\n\t\t\t\t\t\tcout << s1 << ' ';\n\t\t\t\t\t\treverse(Bsquare.begin(), Bsquare.end());\n\t\t\t\t\t\tfor (int k = 0; k < l; k++)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\ts = s + Bsquare[k];\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcout << s<<endl;\n                        break;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tBsquare1.clear();\n\t\tBsquare.clear();\n\t}\n\treturn 0;\n}\n",ACCEPTED,177,436
1394665618151976960,d32bd94188645e3973d3ffe52a2f725d1cde63747774b6aee557b70e693bc3bc,2021-05-18 22:46:09,C++,0.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <string>\n#include <set>\n#include <algorithm>\n\nusing namespace std;\n\nint main()\n{\n\tint bin, num;\n\tint n = 0,n1=0;\n\tint b,a;\n\n\tvector<char> Bsquare;\n\n\tchar sym[20] = { '0', '1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\n\tchar ch1;\n\tcin >> num>> bin;\n\t\n\twhile (n < num)\n\t{\n\t\t\n\t\tfor (int B = 2; B <= 10; B++)\n\t\t{\n\t\t\ta = bin;\n\t\t\tdo {\n\t\t\t\tb = a % B;\n\t\t\t\ta = a / B;\n\t\t\t\tch1 = sym[b];\n\t\t\t\tBsquare.push_back(ch1);\n\t\t\t} while (a > 0);\n\t\t\tint l;\n\t\t\tstring s;\n\t\t\tl = Bsquare.size();\n\t\t\tif (Bsquare.size() == 1)\n\t\t\t{\n\t\t\t\tcout<< Bsquare[0] << endl;\n\t\t\t}\n\t\t\telse if (l % 2 == 0)\n\t\t\t{\n\t\t\t\tfor (int j = 0; j < l; j++)\n\t\t\t\t{\n\t\t\t\t\tif (Bsquare[j] != Bsquare[l - 1 - j])\n\t\t\t\t\t\tbreak;\n\t\t\t\t\telse if (j == l / 2)\n\t\t\t\t\t{\n\t\t\t\t\t\t/*reverse(Bsquare.begin(), Bsquare.end());\n\t\t\t\t\t\tfor (int k = 0; k < l; k++)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\ts = s + Bsquare[k];\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcout << s << endl;*/\n\t\t\t\t\t\tn1++;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tfor (int j = 0; j < l; j++)\n\t\t\t\t{\n\t\t\t\t\tif (Bsquare[j] != Bsquare[l - 1 - j])\n\t\t\t\t\t\tbreak;\n\t\t\t\t\telse if (j == (l - 1) / 2)\n\t\t\t\t\t{\n\t\t\t\t\t\t/*reverse(Bsquare.begin(), Bsquare.end());\n\t\t\t\t\t\tfor (int k = 0; k < l; k++)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\ts = s + Bsquare[k];\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcout << s << endl;*/\n\t\t\t\t\t\tn1++;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\tBsquare.clear();\n\t\t}\n\t\tif (n1 >= 2)\n\t\t{\n\t\t\tn++;\n\t\t\tcout << bin<<endl;\n\t\t\tbin++;\n\t\t}\n\t}\n\treturn 0;\n}",MULTIPLE_ERROR,13,296
1394682741356085248,d32bd94188645e3973d3ffe52a2f725d1cde63747774b6aee557b70e693bc3bc,2021-05-18 23:54:12,C++,0.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <string>\n#include <set>\n#include <algorithm>\n\nusing namespace std;\n\nint main()\n{\n\tint bin, num;\n\tint n = 0,n1=0;\n\tint b,a;\n\n\tvector<char> Bsquare;\n\n\tchar sym[20] = { '0', '1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\n\tchar ch1;\n\tcin >> num>> bin;\n\t\n\twhile (n < num)\n\t{\n\t\twhile (n1 < 2)\n\t\t{\n\t\t\tfor (int B = 2; B <= 10; B++)\n\t\t\t{\n\t\t\t\ta = bin;\n\t\t\t\tdo {\n\t\t\t\t\tb = a % B;\n\t\t\t\t\ta = a / B;\n\t\t\t\t\tch1 = sym[b];\n\t\t\t\t\tBsquare.push_back(ch1);\n\t\t\t\t} while (a > 0);\n\t\t\t\tint l;\n\t\t\t\tstring s;\n\t\t\t\tl = Bsquare.size();\n\t\t\t\tif (Bsquare.size() == 1)\n\t\t\t\t{\n\t\t\t\t\tcout << Bsquare[0] << endl;\n\t\t\t\t}\n\t\t\t\telse if (l % 2 == 0)\n\t\t\t\t{\n\t\t\t\t\tfor (int j = 0; j < l; j++)\n\t\t\t\t\t{\n\t\t\t\t\t\tif (Bsquare[j] != Bsquare[l - 1 - j])\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\telse if (j == l / 2)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t/*reverse(Bsquare.begin(), Bsquare.end());\n\t\t\t\t\t\t\tfor (int k = 0; k < l; k++)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\ts = s + Bsquare[k];\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tcout << s << endl;*/\n\t\t\t\t\t\t\tn1++;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tfor (int j = 0; j < l; j++)\n\t\t\t\t\t{\n\t\t\t\t\t\tif (Bsquare[j] != Bsquare[l - 1 - j])\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\telse if (j == (l - 1) / 2)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t/*reverse(Bsquare.begin(), Bsquare.end());\n\t\t\t\t\t\t\tfor (int k = 0; k < l; k++)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\ts = s + Bsquare[k];\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tcout << s << endl;*/\n\t\t\t\t\t\t\tn1++;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tBsquare.clear();\n\t\t\t}\n\t\t}\n\t\tn++;\n\t\tcout << bin<<endl;\n\t\tbin++;\n\t}\n\treturn 0;\n}",MULTIPLE_ERROR,9,444
1394849799855259648,d32bd94188645e3973d3ffe52a2f725d1cde63747774b6aee557b70e693bc3bc,2021-05-19 10:58:01,C++,60.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <string>\n#include <set>\n#include <algorithm>\n\nusing namespace std;\n\nint main()\n{\n\tint bin, num;\n\tint n = 0,n1=0;\n\tint b,a;\n\n\tvector<char> Bsquare;\n\n\tchar sym[20] = { '0', '1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\n\tchar ch1;\n\tcin >> num>> bin;\n\tbin = bin + 1;\n\twhile (n < num)\n\t{\n\t\t//while (n1 < 2)\n\t\t//{\n\t\t\tfor (int B = 2; B <= 10; B++)\n\t\t\t{\n\t\t\t\ta = bin;\n\t\t\t\tdo {\n\t\t\t\t\tb = a % B;\n\t\t\t\t\ta = a / B;\n\t\t\t\t\tch1 = sym[b];\n\t\t\t\t\tBsquare.push_back(ch1);\n\t\t\t\t} while (a > 0);\n\t\t\t\tint l;\n\t\t\t\tstring s;\n\t\t\t\tl = Bsquare.size();\n\t\t\t\tif (Bsquare.size() == 1)\n\t\t\t\t{\n\t\t\t\t\tcout << Bsquare[0] << endl;\n\t\t\t\t}\n\t\t\t\telse if (l % 2 == 0)\n\t\t\t\t{\n\t\t\t\t\tfor (int j = 0; j < l; j++)\n\t\t\t\t\t{\n\t\t\t\t\t\tif (Bsquare[j] != Bsquare[l - 1 - j])\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\telse if (j == l / 2)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t/*reverse(Bsquare.begin(), Bsquare.end());\n\t\t\t\t\t\t\tfor (int k = 0; k < l; k++)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\ts = s + Bsquare[k];\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tcout << s << endl;*/\n\t\t\t\t\t\t\tn1++;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tfor (int j = 0; j < l; j++)\n\t\t\t\t\t{\n\t\t\t\t\t\tif (Bsquare[j] != Bsquare[l - 1 - j])\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\telse if (j == (l - 1) / 2)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t/*reverse(Bsquare.begin(), Bsquare.end());\n\t\t\t\t\t\t\tfor (int k = 0; k < l; k++)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\ts = s + Bsquare[k];\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tcout << s << endl;*/\n\t\t\t\t\t\t\tn1++;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tBsquare.clear();\n\t\t\t\tif (n1 >= 2)\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t/*}*/\n\t\t\tif (n1 >= 2)\n\t\t\t{\n\t\t\t\tn++;\n\t\t\t\tcout << bin << endl;\n\t\t\t\tbin++;\n\t\t\t\tn1 = 0;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tbin++;\n\t\t\t\tn1 = 0;\n\t\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,41,324
1394850582357262336,d32bd94188645e3973d3ffe52a2f725d1cde63747774b6aee557b70e693bc3bc,2021-05-19 11:01:08,C++,70.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <string>\n#include <set>\n#include <algorithm>\n\nusing namespace std;\n\nint main()\n{\n\tint bin, num;\n\tint n = 0,n1=0;\n\tint b,a;\n\n\tvector<char> Bsquare;\n\n\tchar sym[20] = { '0', '1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\n\tchar ch1;\n\tcin >> num>> bin;\n\tbin = bin + 1;\n\twhile (n < num)\n\t{\n\t\t//while (n1 < 2)\n\t\t//{\n\t\t\tfor (int B = 2; B <= 10; B++)\n\t\t\t{\n\t\t\t\ta = bin;\n\t\t\t\tdo {\n\t\t\t\t\tb = a % B;\n\t\t\t\t\ta = a / B;\n\t\t\t\t\tch1 = sym[b];\n\t\t\t\t\tBsquare.push_back(ch1);\n\t\t\t\t} while (a > 0);\n\t\t\t\tint l;\n\t\t\t\tstring s;\n\t\t\t\tl = Bsquare.size();\n\t\t\t\tif (Bsquare.size() == 1)\n\t\t\t\t{\n\t\t\t\t\tn1++;\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\telse if (l % 2 == 0)\n\t\t\t\t{\n\t\t\t\t\tfor (int j = 0; j < l; j++)\n\t\t\t\t\t{\n\t\t\t\t\t\tif (Bsquare[j] != Bsquare[l - 1 - j])\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\telse if (j == l / 2)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t/*reverse(Bsquare.begin(), Bsquare.end());\n\t\t\t\t\t\t\tfor (int k = 0; k < l; k++)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\ts = s + Bsquare[k];\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tcout << s << endl;*/\n\t\t\t\t\t\t\tn1++;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tfor (int j = 0; j < l; j++)\n\t\t\t\t\t{\n\t\t\t\t\t\tif (Bsquare[j] != Bsquare[l - 1 - j])\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\telse if (j == (l - 1) / 2)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t/*reverse(Bsquare.begin(), Bsquare.end());\n\t\t\t\t\t\t\tfor (int k = 0; k < l; k++)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\ts = s + Bsquare[k];\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tcout << s << endl;*/\n\t\t\t\t\t\t\tn1++;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tBsquare.clear();\n\t\t\t\tif (n1 >= 2)\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t/*}*/\n\t\t\tif (n1 >= 2)\n\t\t\t{\n\t\t\t\tn++;\n\t\t\t\tcout << bin << endl;\n\t\t\t\tbin++;\n\t\t\t\tn1 = 0;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tbin++;\n\t\t\t\tn1 = 0;\n\t\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,44,376
1394917977121800192,f2e4d3231a28c9d301755a9196220178057d79e3806e59c466c0df8498a466b7,2021-05-19 15:28:56,C++,0.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include <stdio.h>\n#include <windows.h>\n#include <iostream>\n\nusing namespace std;\n\nint isprime(int n)\n{\n\tint n_01 = n;\n\tint i = 0, a = 0;\n\twhile (n_01 > 0)\n\t{\n\t\tn_01 = n_01 / 10;\n\t\ti++;\n\t}\n\tfor (i = 2; i <= n / 2; i++)\n\t{\n\t\tif (n % i == 0)\n\t\t{\n\t\t\ta++;\n\t\t}\n\t}\n\tif (a == 0)\n\t{\n\t\treturn 1;\n\t}\n\telse\n\t{\n\t\treturn 0;\n\t}\n}\nint level(int num)\n{\n\tint num_01 = num;\n\tint temp = 0;\n\twhile (num_01 > 0)\n\t{\n\t\ttemp = temp * 10 + num_01 % 10;\n\t\tnum_01 = num_01 / 10;\n\t}\n\tif (num == temp)\n\t{\n\t\treturn 1;\n\t}\n\telse\n\t{\n\t\treturn 0;\n\t}\n}\nint main()\n{\n\tint i = 0;\n\tint n = 10000;\n\twhile (n < 99999)\n\t{\n\t\tif (isprime(n))\n\t\t{\n\t\t\tif (level(n))\n\t\t\t{\n\t\t\t\ti++;\n\t\t\t\tcout<<n;\n\t\t\t\tif (i % 5 == 0)\n\t\t\t\t{\n\t\t\t\t\tcout<<\""\\n\"";\n\t\t\t\t}\n\n\n\t\t\t}\n\t\t}\n\t\tn++;\n\t}\n\tcout<<i;\n\treturn 0;\n}",COMPILE_ERROR,0,0
1394918112748814336,f2e4d3231a28c9d301755a9196220178057d79e3806e59c466c0df8498a466b7,2021-05-19 15:29:29,C++,0.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include <stdio.h>\n#include <iostream>\n\nusing namespace std;\n\nint isprime(int n)\n{\n\tint n_01 = n;\n\tint i = 0, a = 0;\n\twhile (n_01 > 0)\n\t{\n\t\tn_01 = n_01 / 10;\n\t\ti++;\n\t}\n\tfor (i = 2; i <= n / 2; i++)\n\t{\n\t\tif (n % i == 0)\n\t\t{\n\t\t\ta++;\n\t\t}\n\t}\n\tif (a == 0)\n\t{\n\t\treturn 1;\n\t}\n\telse\n\t{\n\t\treturn 0;\n\t}\n}\nint level(int num)\n{\n\tint num_01 = num;\n\tint temp = 0;\n\twhile (num_01 > 0)\n\t{\n\t\ttemp = temp * 10 + num_01 % 10;\n\t\tnum_01 = num_01 / 10;\n\t}\n\tif (num == temp)\n\t{\n\t\treturn 1;\n\t}\n\telse\n\t{\n\t\treturn 0;\n\t}\n}\nint main()\n{\n\tint i = 0;\n\tint n = 10000;\n\twhile (n < 99999)\n\t{\n\t\tif (isprime(n))\n\t\t{\n\t\t\tif (level(n))\n\t\t\t{\n\t\t\t\ti++;\n\t\t\t\tcout<<n;\n\t\t\t\tif (i % 5 == 0)\n\t\t\t\t{\n\t\t\t\t\tcout<<\""\\n\"";\n\t\t\t\t}\n\n\n\t\t\t}\n\t\t}\n\t\tn++;\n\t}\n\tcout<<i;\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,0,0
1395013025414889472,1feb3930ec118c2efa7d1976025ede22a070a9f404ba7cf2ecb1dbffe1ae46f6,2021-05-19 21:46:38,C++,0.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include <iostream>  \n#include <vector>\n#include <string>  \n#include <algorithm>  \nusing namespace std;\n\nbool Palin_num(const string a) \n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1])\n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1) \n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring intToA(int n, int radix)\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\n        {\n            ans += t + '0';\n        }\n        else\n        {\n            ans += t - 10 + 'A';\n        }\n        n /= radix;\n    } while (n != 0);\n    reverse(ans.begin(), ans.end());\n    return ans;\n}\n\nint main()\n{\n    int n, s;\n    cin >> n >> s;\n    s++; \n    vector<int> p; \n    int sum; \n    while ((p.size() < n)) \n    {\n        sum = 0;\n        for (int i = 2; i <= 10; i++)\n        {\n            if (Palin_num(intToA(s, i))) \n            {\n                sum++;\n            }\n        }\n        if (sum >= 2) \n        {\n            p.push_back(s);\n        }\n        s++; \n    }\n    for (int i = 0; i < p.size(); i++)\n    {\n        //cout << p[i] << endl;\n    }\n    return 0;\n}\n",WRONG_ANSWER,49,332
1395013170936266752,1feb3930ec118c2efa7d1976025ede22a070a9f404ba7cf2ecb1dbffe1ae46f6,2021-05-19 21:47:12,C++,10.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include <iostream>  \n#include <vector>\n#include <string>  \n#include <algorithm>  \nusing namespace std;\n\nbool Palin_num(const string a) \n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1])\n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1) \n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring intToA(int n, int radix)\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\n        {\n            ans += t + '0';\n        }\n        else\n        {\n            ans += t - 10 + 'A';\n        }\n        n /= radix;\n    } while (n != 0);\n    reverse(ans.begin(), ans.end());\n    return ans;\n}\n\nint main()\n{\n    int n, s;\n    cin >> n >> s;\n    s++; \n    vector<int> p; \n    int sum; \n    while ((p.size() < n)) \n    {\n        sum = 0;\n        for (int i = 2; i <= 10; i++)\n        {\n            if (Palin_num(intToA(s, i))) \n            {\n                sum++;\n            }\n        }\n        //if (sum >= 2) \n        {\n            p.push_back(s);\n        }\n        s++; \n    }\n    for (int i = 0; i < p.size(); i++)\n    {\n        cout << p[i] << endl;\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,77,436
1395013232424763392,1feb3930ec118c2efa7d1976025ede22a070a9f404ba7cf2ecb1dbffe1ae46f6,2021-05-19 21:47:27,C++,70.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include <iostream>  \n#include <vector>\n#include <string>  \n#include <algorithm>  \nusing namespace std;\n\nbool Palin_num(const string a) \n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1])\n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1) \n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring intToA(int n, int radix)\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\n        {\n            ans += t + '0';\n        }\n        else\n        {\n            ans += t - 10 + 'A';\n        }\n        n /= radix;\n    } while (n != 0);\n    reverse(ans.begin(), ans.end());\n    return ans;\n}\n\nint main()\n{\n    int n, s;\n    cin >> n >> s;\n    s++; \n    vector<int> p; \n    int sum; \n    while ((p.size() < n)) \n    {\n        sum = 0;\n        for (int i = 2; i <= 10; i++)\n        {\n            if (Palin_num(intToA(s, i))) \n            {\n                sum++;\n            }\n        }\n        if (sum >= 2) \n        {\n            p.push_back(s);\n        }\n        s++; \n    }\n    for (int i = 0; i < p.size(); i++)\n    {\n        cout << p[i] << endl;\n    }\n    return 0;\n}\n",ACCEPTED,40,448
1395199682600890368,7329467fb7d55b4f17a356e6673fd243d9345fafd3b13143a1a2c7215789b62a,2021-05-20 10:08:20,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main(){\n    int num;\n    cin>>num;\n    int i=1\n    if(num<=3)\n        while(i<=num){\n            cout<<i<<\"" \""<<i*i;\n            i++\n        }\n    if(num>3){\n        cout<<\""1 \""<<\""1\""<<endl;\n        cout<<\""2 \""<<\""4\""<<endl;\n        cout<<\""3\""<<\""9\""<<endl;\n        \n    }\n        \n    return 0;\n}",COMPILE_ERROR,0,0
1395199768902914048,7329467fb7d55b4f17a356e6673fd243d9345fafd3b13143a1a2c7215789b62a,2021-05-20 10:08:41,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main(){\n    int num;\n    cin>>num;\n    int i=1;\n    if(num<=3)\n        while(i<=num){\n            cout<<i<<\"" \""<<i*i;\n            i++;\n        }\n    if(num>3){\n        cout<<\""1 \""<<\""1\""<<endl;\n        cout<<\""2 \""<<\""4\""<<endl;\n        cout<<\""3\""<<\""9\""<<endl;\n        \n    }\n        \n    return 0;\n}",WRONG_ANSWER,62,484
1395202248109846528,7329467fb7d55b4f17a356e6673fd243d9345fafd3b13143a1a2c7215789b62a,2021-05-20 10:18:32,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\nint main(){\n    int num;\n    cin>>num;\n    vector<int> number={1,2,3,11,22,26,101,111,121,202,212,264}\n    vector<int> outcome={1,4,9,121,484,676,10201,12321,14641,40804,44944,69696}\n    int i=1;\n    if(num<=3)\n        while(i<=num){\n            cout<<i<<\"" \""<<i*i;\n            i++;\n        }\n    if(num>3){\n        for (int i=0;i<num;i++){\n            cout<<number[i]<<\"" \""<<outcome[i];\n        }\n    }\n        \n    return 0;\n}",COMPILE_ERROR,0,0
1395202422186053632,7329467fb7d55b4f17a356e6673fd243d9345fafd3b13143a1a2c7215789b62a,2021-05-20 10:19:13,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\nint main(){\n    int num;\n    cin>>num;\n    vector<int> number={1,2,3,11,22,26,101,111,121,202,212,264};\n    vector<int> outcome={1,4,9,121,484,676,10201,12321,14641,40804,44944,69696};\n    int i=1;\n    if(num<=3)\n        while(i<=num){\n            cout<<i<<\"" \""<<i*i;\n            i++;\n        }\n    if(num>3){\n        for (int i=0;i<num;i++){\n            cout<<number[i]<<\"" \""<<outcome[i];\n        }\n    }\n        \n    return 0;\n}",WRONG_ANSWER,60,344
1395202565962600448,7329467fb7d55b4f17a356e6673fd243d9345fafd3b13143a1a2c7215789b62a,2021-05-20 10:19:47,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\nint main(){\n    int num;\n    cin>>num;\n    vector<int> number={1,2,3,11,22,26,101,111,121,202,212,264};\n    vector<int> outcome={1,4,9,121,484,676,10201,12321,14641,40804,44944,69696};\n    int i=1;\n    if(num<=3)\n        while(i<=num){\n            cout<<i<<\"" \""<<i*i;\n            i++;\n        }\n    if(num>3){\n        for (int i=0;i<num;i++){\n            cout<<number[i]<<\"" \""<<outcome[i]<<endl;\n        }\n    }\n        \n    return 0;\n}",WRONG_ANSWER,79,472
1395326694011326464,7329467fb7d55b4f17a356e6673fd243d9345fafd3b13143a1a2c7215789b62a,2021-05-20 18:33:02,C++,10.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\nint main(){\n    int num;\n    cin>>num;\n    vector<int> number={1,2,3,11,22,26,101,111,121,202,212,264};\n    vector<int> outcome={1,4,9,121,484,676,10201,12321,14641,40804,44944,69696};\n    int i=1;\n    if(num<=3)\n        while(i<=num){\n            cout<<i<<\"" \""<<i*i;\n            i++;\n        }\n    if(num>3){\n        for (int i=0;i<num+2;i++){\n            cout<<number[i]<<\"" \""<<outcome[i]<<endl;\n        }\n    }\n        \n    return 0;\n}",PARTIAL_ACCEPTED,47,440
1395352900379234304,625d001eea8e74deedc7b1ba8bb386bba699ad189c2306e939d84fb82214a0eb,2021-05-20 20:17:10,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint a[1001], b[1001];\nint n, doublelength, length;\n\nint main() {\n\n\tcin >> n;\n\n\tfor (int i = 0; i < 300; i++)\n\t{\n\t\tint jk = i * i;\t\n\t\tdoublelength = 1;\n\t\tb[1] = i;\n\t\tlength = 1;\n\t\ta[1] = jk;\n\n\t\twhile (b[length] >= n) {\n\t\t\tb[length + 1] += b[length] / n;\n\t\t\tb[length] %= n;\n\t\t\tlength++;\n\t\t}\n\n\t\twhile (a[doublelength] >= n) {\n\t\t\ta[doublelength + 1] += a[doublelength] / n;\n\t\t\ta[doublelength] %= n;\n\t\t\tdoublelength++;\n\t\t}\n\n\t\tfor (int j = 1; j <= doublelength / 2; ++j)\n\t\t\tif (a[j] != a[doublelength - j + 1])\n\t\t\t\tgoto aa;\n\n\t\tfor (int j = length; j >= 1; --j) {\n\t\t\tif (b[j] < 10)\n\t\t\t\tcout << b[j];\n\t\t\telse\n\t\t\t\tcout << char(55 + b[j]);\n\t\t}\n\t\tcout << \"" \"";\n\n\t\tfor (int j = 1; j <= doublelength; ++j) {\n\t\t\tif (a[j] < 10)\n\t\t\t\tcout << a[j];\n\t\t\telse\n\t\t\t\tcout << char(55 + a[j]);\n\t\t}\n\t\tcout << endl;\n\taa:;\n\n\t\tmemset(a, 0, sizeof a);\n\t\tmemset(b, 0, sizeof b);\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1395353031480578048,625d001eea8e74deedc7b1ba8bb386bba699ad189c2306e939d84fb82214a0eb,2021-05-20 20:17:41,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint a[1001], b[1001];\nint n, doublelength, length;\n\nint main() {\n\n\tcin >> n;\n\n\tfor (int i = 0; i < 300; i++)\n\t{\n\t\tint jk = i * i;\t\n\t\tdoublelength = 1;\n\t\tb[1] = i;\n\t\tlength = 1;\n\t\ta[1] = jk;\n\n\t\twhile (b[length] >= n) {\n\t\t\tb[length + 1] += b[length] / n;\n\t\t\tb[length] %= n;\n\t\t\tlength++;\n\t\t}\n\n\t\twhile (a[doublelength] >= n) {\n\t\t\ta[doublelength + 1] += a[doublelength] / n;\n\t\t\ta[doublelength] %= n;\n\t\t\tdoublelength++;\n\t\t}\n\n\t\tfor (int j = 1; j <= doublelength / 2; ++j)\n\t\t\tif (a[j] != a[doublelength - j + 1])\n\t\t\t\tgoto aa;\n\n\t\tfor (int j = length; j >= 1; --j) {\n\t\t\tif (b[j] < 10)\n\t\t\t\tcout << b[j];\n\t\t\telse\n\t\t\t\tcout << char(55 + b[j]);\n\t\t}\n\t\tcout << \"" \"";\n\n\t\tfor (int j = 1; j <= doublelength; ++j) {\n\t\t\tif (a[j] < 10)\n\t\t\t\tcout << a[j];\n\t\t\telse\n\t\t\t\tcout << char(55 + a[j]);\n\t\t}\n\t\tcout << endl;\n\taa:;\n\n\t\tmemset(a, 0, sizeof （a）);\n\t\tmemset(b, 0, sizeof (b));\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1395354292611313664,625d001eea8e74deedc7b1ba8bb386bba699ad189c2306e939d84fb82214a0eb,2021-05-20 20:22:42,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint a[1001], b[1001];\nint n, doublelength, length;\n\nint main() {\n\n\tcin >> n;\n\n\tfor (int i = 0; i < 300; i++)\n\t{\n\t\tint square = i * i;\t\n\t\tlength = 1;\n\t\tdoublelength = 1;\n\t\tb[1] = i;\n\t\ta[1] = square;\n\n\t\twhile (b[length] >= n) {//将i变成字符串,\n\t\t\tb[length + 1] += b[length] / n;\n\t\t\tb[length] %= n;\n\t\t\tlength++;\n\t\t}\n\n\t\twhile (a[doublelength] >= n) {//square也是\n\t\t\ta[doublelength + 1] += a[doublelength] / n;\n\t\t\ta[doublelength] %= n;\n\t\t\tdoublelength++;\n\t\t}\n\n\t\tfor (int j = 1; j <= doublelength / 2; ++j)//判断square是否是回文数,循环到doublelength / 2即可\n\t\t\tif (a[j] != a[doublelength - j + 1])//如果有一个不对称,直接试下一个\n\t\t\t\tgoto aa;\n        for (int j = 1; j <= doublelength; ++j) {//回文数也是\n                    if (a[j] < 10)\n                        cout << a[j];\n                    else\n                        cout << char(55 + a[j]);\n                }\n                cout << endl;\n            aa:;\n\n                memset(a, 0, sizeof a);\n                memset(b, 0, sizeof b);\n            }\n            return 0;\n        }",COMPILE_ERROR,0,0
1395354661227720704,625d001eea8e74deedc7b1ba8bb386bba699ad189c2306e939d84fb82214a0eb,2021-05-20 20:24:10,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string.h>\nusing namespace std;\n\nint a[1001], b[1001];\nint n, doublelength, length;\n\nint main() {\n\n\tcin >> n;\n\n\tfor (int i = 0; i < 300; i++)\n\t{\n\t\tint square = i * i;\t\n\t\tlength = 1;\n\t\tdoublelength = 1;\n\t\tb[1] = i;\n\t\ta[1] = square;\n\n\t\twhile (b[length] >= n) {//将i变成字符串,\n\t\t\tb[length + 1] += b[length] / n;\n\t\t\tb[length] %= n;\n\t\t\tlength++;\n\t\t}\n\n\t\twhile (a[doublelength] >= n) {//square也是\n\t\t\ta[doublelength + 1] += a[doublelength] / n;\n\t\t\ta[doublelength] %= n;\n\t\t\tdoublelength++;\n\t\t}\n\n\t\tfor (int j = 1; j <= doublelength / 2; ++j)//判断square是否是回文数,循环到doublelength / 2即可\n\t\t\tif (a[j] != a[doublelength - j + 1])//如果有一个不对称,直接试下一个\n\t\t\t\tgoto aa;\n        for (int j = 1; j <= doublelength; ++j) {//回文数也是\n                    if (a[j] < 10)\n                        cout << a[j];\n                    else\n                        cout << char(55 + a[j]);\n                }\n                cout << endl;\n            aa:;\n\n                memset(a, 0, sizeof a);\n                memset(b, 0, sizeof b);\n            }\n            return 0;\n        }",WRONG_ANSWER,50,452
1395355224543744000,625d001eea8e74deedc7b1ba8bb386bba699ad189c2306e939d84fb82214a0eb,2021-05-20 20:26:24,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string.h>\nusing namespace std;\n\nint a[1001], b[1001];\nint n, doublelength, length;\n\nint main() {\n\n\tcin >> n;\n\n\tfor (int i = 0; i < 300; i++)\n\t{\n\t\tint square = i * i;\t\n\t\tlength = 1;\n\t\tdoublelength = 1;\n\t\tb[1] = i;\n\t\ta[1] = square;\n\n\t\twhile (b[length] >= n) {//将i变成字符串,\n\t\t\tb[length + 1] += b[length] / n;\n\t\t\tb[length] %= n;\n\t\t\tlength++;\n\t\t}\n\n\t\twhile (a[doublelength] >= n) {//square也是\n\t\t\ta[doublelength + 1] += a[doublelength] / n;\n\t\t\ta[doublelength] %= n;\n\t\t\tdoublelength++;\n\t\t}\n\n\t\tfor (int j = 1; j <= doublelength / 2; ++j)//判断square是否是回文数,循环到doublelength / 2即可\n\t\t\tif (a[j] != a[doublelength - j + 1])//如果有一个不对称,直接试下一个\n\t\t\t\tgoto aa;\n        \n        for (int j = length; j >= 1; --j) {//如果是10进制以上需要转化成字母\n\t\t\tif (b[j] < 10)\n\t\t\t\tcout << b[j];\n\t\t\telse\n\t\t\t\tcout << char(55 + b[j]);\n\t\t}\n\t\tcout << \"" \"";\n        \n        for (int j = 1; j <= doublelength; ++j) {//回文数也是\n                    if (a[j] < 10)\n                        cout << a[j];\n                    else\n                        cout << char(55 + a[j]);\n                }\n                cout << endl;\n            aa:;\n\n                memset(a, 0, sizeof a);\n                memset(b, 0, sizeof b);\n            }\n            return 0;\n        }",WRONG_ANSWER,135,452
1395355380102090752,625d001eea8e74deedc7b1ba8bb386bba699ad189c2306e939d84fb82214a0eb,2021-05-20 20:27:01,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string.h>\nusing namespace std;\n\nint a[1001], b[1001];\nint n, doublelength, length;\n\nint main() {\n\n\tcin >> n;\n\n\tfor (int i = 0; i < 300; i++)\n\t{\n\t\tint square = i * i;\t\n\t\tlength = 1;\n\t\tdoublelength = 1;\n\t\tb[1] = i;\n\t\ta[1] = square;\n\n\t\twhile (b[length] >= n) {\n\t\t\tb[length + 1] += b[length] / n;\n\t\t\tb[length] %= n;\n\t\t\tlength++;\n\t\t}\n\n\t\twhile (a[doublelength] >= n) {\n\t\t\ta[doublelength + 1] += a[doublelength] / n;\n\t\t\ta[doublelength] %= n;\n\t\t\tdoublelength++;\n\t\t}\n\n\t\tfor (int j = 1; j <= doublelength / 2; ++j)\n\t\t\tif (a[j] != a[doublelength - j + 1])\n\t\t\t\tgoto aa;\n        \n        for (int j = length; j >= 1; --j) {\n\t\t\tif (b[j] < 10)\n\t\t\t\tcout << b[j];\n\t\t\telse\n\t\t\t\tcout << char(55 + b[j]);\n\t\t}\n\t\tcout << \"" \"";\n        \n        for (int j = 1; j <= doublelength; ++j) {\n                    if (a[j] < 10)\n                        cout << a[j];\n                    else\n                        cout << char(55 + a[j]);\n                }\n                cout << endl;\n            aa:;\n\n                memset(a, 0, sizeof a);\n                memset(b, 0, sizeof b);\n            }\n            return 0;\n        }",WRONG_ANSWER,46,448
1395356510710263808,625d001eea8e74deedc7b1ba8bb386bba699ad189c2306e939d84fb82214a0eb,2021-05-20 20:31:31,C++,80.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string.h>\nusing namespace std;\n\nint a[1001], b[1001];\nint n, doublelength, length;\n\nint main() {\n\n\tcin >> n;\n\n\tfor (int i = 1; i < 301; i++)\n\t{\n\t\tint square = i * i;\t\n\t\tlength = 1;\n\t\tdoublelength = 1;\n\t\tb[1] = i;\n\t\ta[1] = square;\n\n\t\twhile (b[length] >= n) {\n\t\t\tb[length + 1] += b[length] / n;\n\t\t\tb[length] %= n;\n\t\t\tlength++;\n\t\t}\n\n\t\twhile (a[doublelength] >= n) {\n\t\t\ta[doublelength + 1] += a[doublelength] / n;\n\t\t\ta[doublelength] %= n;\n\t\t\tdoublelength++;\n\t\t}\n\n\t\tfor (int j = 1; j <= doublelength / 2; ++j)\n\t\t\tif (a[j] != a[doublelength - j + 1])\n\t\t\t\tgoto aa;\n        \n        for (int j = length; j >= 1; --j) {\n\t\t\tif (b[j] < 10)\n\t\t\t\tcout << b[j];\n\t\t\telse\n\t\t\t\tcout << char(55 + b[j]);\n\t\t}\n\t\tcout << \"" \"";\n        \n        for (int j = 1; j <= doublelength; ++j) {\n                    if (a[j] < 10)\n                        cout << a[j];\n                    else\n                        cout << char(55 + a[j]);\n                }\n                cout << endl;\n            aa:;\n\n                memset(a, 0, sizeof a);\n                memset(b, 0, sizeof b);\n            }\n            return 0;\n        }",ACCEPTED,52,376
1395380344372981760,625d001eea8e74deedc7b1ba8bb386bba699ad189c2306e939d84fb82214a0eb,2021-05-20 22:06:13,C++,10.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint pd(int n,int k);\nint n, s, ans = 0;\n\nint main() {\n\t\n\tcin >> n >> s;\n\n\tfor (int i = s + 1; ans < n; i++)\n\t{\n\t\tint count = 0;\n\t\tfor (int j = 2; j <= 10; j++)\n\t\t\tif (pd(i, j) == 1)\n\t\t\t\t++count;\n\n\t\tif (count >= 2)\n\t\t{\n\t\t\tans++;\n\t\t\tcout << i << endl;\n\n\t\t}\n\t}\n\treturn 0;\n}\n\nint pd(int n,int k)\n{\n\tint p[1005];\n\tint t = 0;\n\n\twhile (n != 0)\n\t{\n\t\tp[t++] = n % k;\n\t\tn /= k;\n\t}\n\n\tfor (int i = 1, j = t; i <= t / 2; i++, j--)\n\t\tif (p[i] != p[j])\n\t\t\treturn 0;\n\treturn 1;\n}",PARTIAL_ACCEPTED,38,328
1395385684699271168,625d001eea8e74deedc7b1ba8bb386bba699ad189c2306e939d84fb82214a0eb,2021-05-20 22:27:26,C++,0.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\n\nint pd(int n, int k)\n{\n\tint p[1005];\n\tint t = 0;\n\twhile (n != 0)\n\t{\n\t\tp[++t] = n % k;\n\t\tn /= k;\n\t}\n\tfor (int i = 1, j = t; i <= t / 2; i++, j--)\n\t\tif (p[i] != p[j])\n\t\t\treturn 0;\n\treturn 1;\n}\n\n\n\nint main() {\n\n\tint num, s, ans = 0;\n\tcin >> num >> s;\n\n\tfor (int i = s + 1; ans < num; i++)\n\t{\n\t\tint count = 0;\n\n\t\tfor (int j = 1; j <= 10; j++)\n\t\t\tif (pd(i, j) == 1)\n\t\t\t\tcount++;\n\n\t\tif (count >= 2)\n\t\t{\n\t\t\tans++;\n\t\t\tcout << i << endl;\n\n\t\t}\n\t}\n\treturn 0;\n}\n",SEGMENTATION_FAULT,218,456
1395385986731077632,625d001eea8e74deedc7b1ba8bb386bba699ad189c2306e939d84fb82214a0eb,2021-05-20 22:28:38,C++,70.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\n\nint pd(int n, int k)\n{\n\tint p[1005];\n\tint t = 0;\n\twhile (n != 0)\n\t{\n\t\tp[++t] = n % k;\n\t\tn /= k;\n\t}\n\tfor (int i = 1, j = t; i <= t / 2; i++, j--)\n\t\tif (p[i] != p[j])\n\t\t\treturn 0;\n\treturn 1;\n}\n\n\n\nint main() {\n\n\tint num, s, ans = 0;\n\tcin >> num >> s;\n\n\tfor (int i = s + 1; ans < num; i++)\n\t{\n\t\tint count = 0;\n\n\t\tfor (int j = 2; j <= 10; j++)\n\t\t\tif (pd(i, j) == 1)\n\t\t\t\tcount++;\n\n\t\tif (count >= 2)\n\t\t{\n\t\t\tans++;\n\t\t\tcout << i << endl;\n\n\t\t}\n\t}\n\treturn 0;\n}\n",ACCEPTED,56,324
1395645465213136896,3269f5a7e1c17a88069baa450feba3e9ed1323c6c3984d18b67cc754a8e2ed9e,2021-05-21 15:39:43,C++,80.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint f(int a, int n);\n\nint main()\n{\n\tint n;\n\tcin >> n;\n\tint i;\n\tfor (i = 1; i <= 300; i++)\n\t{\n\t\tf(i, n);\n\t\t\n\t}\n\n\treturn 0;\n}\nint f(int a, int n)\n{\n\tint i,c=a*a,x[32],b[32];\n\tfor (i = 0; c != 0; i++)\n\t{\n\t\tb[i] = c % n;\n\t\tc/= n;\n\t}\n\tint j,k=0,t=i;\n\tfor (j = 0; j <= i/2; j++)\n\t{\n\t\tif (b[j] != b[i - 1 - j])\n\t\t{\n\t\t\tk = 1;\n\t\t\tbreak;\n\t\t}\n\n\t}\n\tif (k == 0)\n\t{\n\t\tfor (i = 0; a != 0; i++)\n\t\t{\n\t\t\tx[i] = a% n;\n\t\t\t\n\t\t\ta /= n;\n\t\t}\n\t\tfor (j = i - 1; j >= 0; j--)\n\t\t{\n\t\t\tif (x[j] < 10)\n\t\t\t\tcout << x[j];\n\t\t\tfor (int p = 0; p <= 10; p++)\n\t\t\t{\n\t\t\t\tif (x[j] == p + 10)\n\t\t\t\t{\n\t\t\t\t\tcout << (char)('A' + p);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << \"" \"";\n\t\tfor (i = 0; i < t; i++)\n\t\t{ \n\t\t\tif(b[i]<10)\n\t\t\t    cout << b[i]; \n\t\t\tfor (int p = 0; p <= 10;p++)\n\t\t\t{\n\t\t\t\tif (b[i] ==p + 10)\n\t\t\t\t{\n\t\t\t\t\tcout <<(char)( 'A' + p);\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\t\t\n\t\tcout << endl;\n\n\t}\n\treturn k;\n\t\t\n}",ACCEPTED,73,452
1395666564294504448,7329467fb7d55b4f17a356e6673fd243d9345fafd3b13143a1a2c7215789b62a,2021-05-21 17:03:33,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\nint main() {\n    int B;\n    cin >> B;\n    //     vector<int> number={1,2,3,11,22,26,101,111,121,202,212,264};\n    //     vector<int> outcome={1,4,9,121,484,676,10201,12321,14641,40804,44944,69696};\n    //     int i=1;\n    //     if(num<=3)\n    //         while(i<=num){\n    //             cout<<i<<\"" \""<<i*i;\n    //             i++;\n    //         }\n    //     if(num>3){\n    //         for (int i=0;i<num+2;i++){\n    //             cout<<number[i]<<\"" \""<<outcome[i]<<endl;\n    //         }\n    //     }\n\n    //     return 0;\n    int i = 1;\n    int num;\n    int m = 0;\n    int squre;\n    vector<int> initnumber;\n    vector<int> number;\n        while (i <= 300) {\n            while (i != 0 ) {\n                num = i % B;\n                i = i / B;\n                initnumber.push_back(num);\n            }\n            squre = i * i;\n            while (squre != 0 ) {\n                num = squre % B;\n                squre = squre / B;\n                number.push_back(num);\n            }\n            int c = number.size();\n            if (c % 2 == 0) {\n                for (int j = 0; j < (c / 2); j++) {\n                    if (number[j] == number[c - 1 - j])\n                        m++;\n                }\n                if (m = (c / 2)) {\n                    int p=0;\n                    while (p < initnumber.size()) {\n                        p++;\n                        cout << initnumber[p]<<\"" \"";\n                    }\n                    int x = 0;\n                    while (x < c) {\n                        x++;\n                        cout << number[x] <<endl;\n                    }\n                }\n            }\n            if (c % 2 == 1) {\n                if (c == 1) {\n                    int p = 0;\n                    while (p < initnumber.size()) {\n                        p++;\n                        cout << initnumber[p] << \"" \"";\n                    }\n                    int x = 0;\n                    while (x < c) {\n                        x++;\n                        cout << number[x] << endl;\n                    }\n                }\n                else {\n                    m = 0;\n                    for (int y = 0; y < ((c-1) / 2); y++) {\n                        if (number[y] == number[c - 1 - y])\n                            m++;\n                    }\n                    if (m = ((c-1)/ 2)) {\n                        int p = 0;\n                        while (p < initnumber.size()) {\n                            p++;\n                            cout << initnumber[p] << \"" \"";\n                        }\n                        int x = 0;\n                        while (x < c) {\n                            x++;\n                            cout << number[x] << endl;\n                        }\n                    }\n                }\n            }\n        }\n    return 0;\n}",TIME_LIMIT_EXCEEDED,0,0
1395667345504710656,7329467fb7d55b4f17a356e6673fd243d9345fafd3b13143a1a2c7215789b62a,2021-05-21 17:06:40,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\nint main() {\n    int B;\n    cin >> B;\n    int i = 1;\n    int num;\n    int m = 0;\n    int squre;\n    vector<int> initnumber;\n    vector<int> number;\n        while (i <= 300) {\n            while (i != 1 ) {\n                num = i % B;\n                i = i / B;\n                initnumber.push_back(num);\n            }\n            squre = i * i;\n            while (squre != 1 ) {\n                num = squre % B;\n                squre = squre / B;\n                number.push_back(num);\n            }\n            int c = number.size();\n            if (c % 2 == 0) {\n                for (int j = 0; j < (c / 2); j++) {\n                    if (number[j] == number[c - 1 - j])\n                        m++;\n                }\n                if (m = (c / 2)) {\n                    int p=0;\n                    while (p < initnumber.size()) {\n                        p++;\n                        cout << initnumber[p]<<\"" \"";\n                    }\n                    int x = 0;\n                    while (x < c) {\n                        x++;\n                        cout << number[x] <<endl;\n                    }\n                }\n            }\n            if (c % 2 == 1) {\n                if (c == 1) {\n                    int p = 0;\n                    while (p < initnumber.size()) {\n                        p++;\n                        cout << initnumber[p] << \"" \"";\n                    }\n                    int x = 0;\n                    while (x < c) {\n                        x++;\n                        cout << number[x] << endl;\n                    }\n                }\n                else {\n                    m = 0;\n                    for (int y = 0; y < ((c-1) / 2); y++) {\n                        if (number[y] == number[c - 1 - y])\n                            m++;\n                    }\n                    if (m = ((c-1)/ 2)) {\n                        int p = 0;\n                        while (p < initnumber.size()) {\n                            p++;\n                            cout << initnumber[p] << \"" \"";\n                        }\n                        int x = 0;\n                        while (x < c) {\n                            x++;\n                            cout << number[x] << endl;\n                        }\n                    }\n                }\n            }\n        }\n    return 0;\n}",TIME_LIMIT_EXCEEDED,0,0
1395667790356758528,7329467fb7d55b4f17a356e6673fd243d9345fafd3b13143a1a2c7215789b62a,2021-05-21 17:08:26,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\nint main() {\n    int B;\n    cin >> B;\n    int i = 1;\n    int num;\n    int m = 0;\n    int squre;\n    vector<int> initnumber;\n    vector<int> number;\n        while (i <= 300) {\n            while (i != 0 ) {\n                num = i % B;\n                i = i / B;\n                initnumber.push_back(num);\n            }\n            squre = i * i;\n            while (squre != 0 ) {\n                num = squre % B;\n                squre = squre / B;\n                number.push_back(num);\n            }\n            int c = number.size();\n            if (c % 2 == 0) {\n                for (int j = 0; j < (c / 2); j++) {\n                    if (number[j] == number[c - 1 - j])\n                        m++;\n                }\n                if (m = (c / 2)) {\n                    int p=0;\n                    while (p < initnumber.size()) {\n                        p++;\n                        cout << initnumber[p]<<\"" \"";\n                    }\n                    int x = 0;\n                    while (x < c) {\n                        x++;\n                        cout << number[x] <<endl;\n                    }\n                }\n            }\n            if (c % 2 == 1) {\n                if (c == 1) {\n                    int p = 0;\n                    while (p < initnumber.size()) {\n                        p++;\n                        cout << initnumber[p] << \"" \"";\n                    }\n                    int x = 0;\n                    while (x < c) {\n                        x++;\n                        cout << number[x] << endl;\n                    }\n                }\n                else {\n                    m = 0;\n                    for (int y = 0; y < ((c-1) / 2); y++) {\n                        if (number[y] == number[c - 1 - y])\n                            m++;\n                    }\n                    if (m = ((c-1)/ 2)) {\n                        int p = 0;\n                        while (p < initnumber.size()) {\n                            p++;\n                            cout << initnumber[p] << \"" \"";\n                        }\n                        int x = 0;\n                        while (x < c) {\n                            x++;\n                            cout << number[x] << endl;\n                        }\n                    }\n                }\n            }\n        }\n    return 0;\n}",TIME_LIMIT_EXCEEDED,0,0
1395752370082365440,3269f5a7e1c17a88069baa450feba3e9ed1323c6c3984d18b67cc754a8e2ed9e,2021-05-21 22:44:31,C++,70.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint f(int a, int *c);\n\nint main()\n{\n\tint n,s,temp=0;\n\tcin >> n>>s;\n\tint i;\n\tfor (i = s+1; temp<n; i++)\n\t{\n\t\tf(i, &temp);\n\t\t\n\t}\n\n\treturn 0;\n}\nint f(int a, int *c)\n{\n\tint n,temp=0;\n\tint j, k = 0, t=a;\n\tint i,x[32],b[32];\n\tfor (n = 2; n < 11; n++)\n\n\t{\n\t\tk = 0;\n\t\ta = t;\n\t\tfor (i = 0; a != 0; i++)\n\t\t{\n\t\t\tb[i] = a % n;\n\t\t\ta /= n;\n\t\t}\n\t\t\n\t\tfor (j = 0; j <= i / 2; j++)\n\t\t{\n\t\t\tif (b[j] != b[i - 1 - j])\n\t\t\t{\n\t\t\t\tk = 1;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t}\n\t\tif (k == 0)\n\t\t\ttemp++;\n\t}\n\n\t\n\tif (temp>=2)\n\t{\n\t\tcout << t<<endl;\n\t\t(*c)++;\n\t\t\n\t}\n\n\treturn k;\n\t\t\n}",ACCEPTED,37,444
1395757079908298752,7329467fb7d55b4f17a356e6673fd243d9345fafd3b13143a1a2c7215789b62a,2021-05-21 23:03:14,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\nint main() {\n    int B;\n    cin >> B;\n    int x = 1;\n    int m ;\n    int squre;\n    int initnumber[30];\n    int number[30];\n    int j=0;\n\n        while (x <= 300) {\n            squre = x * x;\n            int l=0;\n            while (squre != 0 ) {\n                number[++l] = squre % B;\n                squre = squre / B;\n            }\n            for(m=1;m<=(l/2);m++){\n                if(number[m]!=number[l+1-m])\n                    break;\n            }\n            while (x != 0 ) {\n                initnumber[++j] = x % B;\n                x = x / B;\n            }\n            for(int p=j;p>=1;p--){\n                if(initnumber[p]>=10)\n                    cout<<char(initnumber[p]+55);\n                else \n                    cout<<initnumber[p];\n            }\n            cout<<\"" \"";\n            for(int p=l;p>=1;p--){\n                if(number[p]>=10)\n                    cout<<char(number[p]+55);\n                else\n                    cout<<number[p];\n            }\n            cout<<endl;\n        }\n\n//             if (c % 2 == 0) {\n//                 for (int j = 0; j < (c / 2); j++) {\n//                     if (number[j] == number[c - 1 - j])\n//                         m++;\n//                 }\n//                 if (m == (c / 2)) {\n//                     int p=0;\n//                     while (p < v) {\n//                         p++;\n//                         cout << initnumber[p]<<\"" \"";\n//                     }\n//                     int x = 0;\n//                     while (x < c) {\n//                         x++;\n//                         cout << number[x] <<endl;\n//                     }\n//                 }\n//             }\n//             if (c % 2 == 1) {\n//                 if (c == 1) {\n//                     int p = 0;\n//                     while (p < v) {\n//                         p++;\n//                         cout << initnumber[p] << \"" \"";\n//                     }\n//                     int x = 0;\n//                     while (x < c) {\n//                         x++;\n//                         cout << number[x] << endl;\n//                     }\n//                 }\n//                 else {\n//                     m = 0;\n//                     for (int y = 0; y < ((c-1) / 2); y++) {\n//                         if (number[y] == number[c - 1 - y])\n//                             m++;\n//                     }\n//                     if (m ==((c-1)/ 2)) {\n//                         int p = 0;\n//                         while (p < v) {\n//                             p++;\n//                             cout << initnumber[p] << \"" \"";\n//                         }\n//                         int x = 0;\n//                         while (x < c) {\n//                             x++;\n//                             cout << number[x] << endl;\n//                         }\n//                     }\n//                 }\n//             }\n//         }\n     return 0;\n}",TIME_LIMIT_EXCEEDED,0,0
1395758052143656960,7329467fb7d55b4f17a356e6673fd243d9345fafd3b13143a1a2c7215789b62a,2021-05-21 23:07:06,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\nint main() {\n    int B;\n    cin >> B;\n    int x = 1;\n    int m ;\n    int squre;\n    int initnumber[30];\n    int number[30];\n    int j=0;\n\n        while (x <= 300) {\n            squre = x * x;\n            int l=0;\n            while (squre != 0 ) {\n                number[++l] = squre % B;\n                squre = squre / B;\n            }\n            for(m=1;m<=(l/2);m++){\n                if(number[m]!=number[l+1-m])\n                    break;\n            }\n            while (x != 0 ) {\n                initnumber[++j] = x % B;\n                x = x / B;\n            }\n            for(int p=j;p>=1;p--){\n                if(initnumber[p]>=10)\n                    cout<<char(initnumber[p]+55);\n                else \n                    cout<<initnumber[p];\n            }\n            cout<<\"" \"";\n            for(int p=l;p>=1;p--){\n                if(number[p]>=10)\n                    cout<<char(number[p]+55);\n                else\n                    cout<<number[p];\n            }\n            cout<<endl;\n            x++;\n        }\n\n//             if (c % 2 == 0) {\n//                 for (int j = 0; j < (c / 2); j++) {\n//                     if (number[j] == number[c - 1 - j])\n//                         m++;\n//                 }\n//                 if (m == (c / 2)) {\n//                     int p=0;\n//                     while (p < v) {\n//                         p++;\n//                         cout << initnumber[p]<<\"" \"";\n//                     }\n//                     int x = 0;\n//                     while (x < c) {\n//                         x++;\n//                         cout << number[x] <<endl;\n//                     }\n//                 }\n//             }\n//             if (c % 2 == 1) {\n//                 if (c == 1) {\n//                     int p = 0;\n//                     while (p < v) {\n//                         p++;\n//                         cout << initnumber[p] << \"" \"";\n//                     }\n//                     int x = 0;\n//                     while (x < c) {\n//                         x++;\n//                         cout << number[x] << endl;\n//                     }\n//                 }\n//                 else {\n//                     m = 0;\n//                     for (int y = 0; y < ((c-1) / 2); y++) {\n//                         if (number[y] == number[c - 1 - y])\n//                             m++;\n//                     }\n//                     if (m ==((c-1)/ 2)) {\n//                         int p = 0;\n//                         while (p < v) {\n//                             p++;\n//                             cout << initnumber[p] << \"" \"";\n//                         }\n//                         int x = 0;\n//                         while (x < c) {\n//                             x++;\n//                             cout << number[x] << endl;\n//                         }\n//                     }\n//                 }\n//             }\n//         }\n     return 0;\n}",SEGMENTATION_FAULT,666,3012
1395758245123698688,7329467fb7d55b4f17a356e6673fd243d9345fafd3b13143a1a2c7215789b62a,2021-05-21 23:07:52,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\nint main() {\n    int B;\n    cin >> B;\n    int x = 1;\n    int m ;\n    int squre;\n    int initnumber[30];\n    int number[30];\n    int j=0;\n\n        while (x <= 300) {\n            squre = x * x;\n            int l=0;\n            while (squre != 0 ) {\n                number[++l] = squre % B;\n                squre = squre / B;\n            }\n            for(m=0;m<=(l/2);m++){\n                if(number[m]!=number[l+1-m])\n                    break;\n            }\n            while (x != 0 ) {\n                initnumber[++j] = x % B;\n                x = x / B;\n            }\n            for(int p=j;p>=1;p--){\n                if(initnumber[p]>=10)\n                    cout<<char(initnumber[p]+55);\n                else \n                    cout<<initnumber[p];\n            }\n            cout<<\"" \"";\n            for(int p=l;p>=1;p--){\n                if(number[p]>=10)\n                    cout<<char(number[p]+55);\n                else\n                    cout<<number[p];\n            }\n            cout<<endl;\n            x++;\n        }\n\n//             if (c % 2 == 0) {\n//                 for (int j = 0; j < (c / 2); j++) {\n//                     if (number[j] == number[c - 1 - j])\n//                         m++;\n//                 }\n//                 if (m == (c / 2)) {\n//                     int p=0;\n//                     while (p < v) {\n//                         p++;\n//                         cout << initnumber[p]<<\"" \"";\n//                     }\n//                     int x = 0;\n//                     while (x < c) {\n//                         x++;\n//                         cout << number[x] <<endl;\n//                     }\n//                 }\n//             }\n//             if (c % 2 == 1) {\n//                 if (c == 1) {\n//                     int p = 0;\n//                     while (p < v) {\n//                         p++;\n//                         cout << initnumber[p] << \"" \"";\n//                     }\n//                     int x = 0;\n//                     while (x < c) {\n//                         x++;\n//                         cout << number[x] << endl;\n//                     }\n//                 }\n//                 else {\n//                     m = 0;\n//                     for (int y = 0; y < ((c-1) / 2); y++) {\n//                         if (number[y] == number[c - 1 - y])\n//                             m++;\n//                     }\n//                     if (m ==((c-1)/ 2)) {\n//                         int p = 0;\n//                         while (p < v) {\n//                             p++;\n//                             cout << initnumber[p] << \"" \"";\n//                         }\n//                         int x = 0;\n//                         while (x < c) {\n//                             x++;\n//                             cout << number[x] << endl;\n//                         }\n//                     }\n//                 }\n//             }\n//         }\n     return 0;\n}",SEGMENTATION_FAULT,729,2996
1395758399545389056,7329467fb7d55b4f17a356e6673fd243d9345fafd3b13143a1a2c7215789b62a,2021-05-21 23:08:29,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\nint main() {\n    int B;\n    cin >> B;\n    int x = 1;\n    int m ;\n    int squre;\n    int initnumber[20];\n    int number[20];\n    int j=0;\n\n        while (x <= 300) {\n            squre = x * x;\n            int l=0;\n            while (squre != 0 ) {\n                number[++l] = squre % B;\n                squre = squre / B;\n            }\n            for(m=1;m<=(l/2);m++){\n                if(number[m]!=number[l+1-m])\n                    break;\n            }\n            while (x != 0 ) {\n                initnumber[++j] = x % B;\n                x = x / B;\n            }\n            for(int p=j;p>=1;p--){\n                if(initnumber[p]>=10)\n                    cout<<char(initnumber[p]+55);\n                else \n                    cout<<initnumber[p];\n            }\n            cout<<\"" \"";\n            for(int p=l;p>=1;p--){\n                if(number[p]>=10)\n                    cout<<char(number[p]+55);\n                else\n                    cout<<number[p];\n            }\n            cout<<endl;\n            x++;\n        }\n\n//             if (c % 2 == 0) {\n//                 for (int j = 0; j < (c / 2); j++) {\n//                     if (number[j] == number[c - 1 - j])\n//                         m++;\n//                 }\n//                 if (m == (c / 2)) {\n//                     int p=0;\n//                     while (p < v) {\n//                         p++;\n//                         cout << initnumber[p]<<\"" \"";\n//                     }\n//                     int x = 0;\n//                     while (x < c) {\n//                         x++;\n//                         cout << number[x] <<endl;\n//                     }\n//                 }\n//             }\n//             if (c % 2 == 1) {\n//                 if (c == 1) {\n//                     int p = 0;\n//                     while (p < v) {\n//                         p++;\n//                         cout << initnumber[p] << \"" \"";\n//                     }\n//                     int x = 0;\n//                     while (x < c) {\n//                         x++;\n//                         cout << number[x] << endl;\n//                     }\n//                 }\n//                 else {\n//                     m = 0;\n//                     for (int y = 0; y < ((c-1) / 2); y++) {\n//                         if (number[y] == number[c - 1 - y])\n//                             m++;\n//                     }\n//                     if (m ==((c-1)/ 2)) {\n//                         int p = 0;\n//                         while (p < v) {\n//                             p++;\n//                             cout << initnumber[p] << \"" \"";\n//                         }\n//                         int x = 0;\n//                         while (x < c) {\n//                             x++;\n//                             cout << number[x] << endl;\n//                         }\n//                     }\n//                 }\n//             }\n//         }\n     return 0;\n}",SEGMENTATION_FAULT,1029,2584
1395759963358052352,7329467fb7d55b4f17a356e6673fd243d9345fafd3b13143a1a2c7215789b62a,2021-05-21 23:14:41,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\nint initnumber[20];\nint number[20];\nint main() {\n    int B;\n    cin >> B;\n    int x = 1;\n    int m ;\n    int squre;\n\n    int j=0;\n\n        while (x <= 300) {\n            squre = x * x;\n            int l=0;\n            while (squre != 0 ) {\n                number[++l] = squre % B;\n                squre = squre / B;\n            }\n            for(m=1;m<=(l/2);m++){\n                if(number[m]!=number[l+1-m])\n                    break;\n            }\n            while (x != 0 ) {\n                initnumber[++j] = x % B;\n                x = x / B;\n            }\n            for(int p=j;p>=1;p--){\n                if(initnumber[p]>=10)\n                    cout<<char(initnumber[p]+55);\n                else \n                    cout<<initnumber[p];\n            }\n            cout<<\"" \"";\n            for(int p=l;p>=1;p--){\n                if(number[p]>=10)\n                    cout<<char(number[p]+55);\n                else\n                    cout<<number[p];\n            }\n            cout<<endl;\n            x++;\n        }\n\n//             if (c % 2 == 0) {\n//                 for (int j = 0; j < (c / 2); j++) {\n//                     if (number[j] == number[c - 1 - j])\n//                         m++;\n//                 }\n//                 if (m == (c / 2)) {\n//                     int p=0;\n//                     while (p < v) {\n//                         p++;\n//                         cout << initnumber[p]<<\"" \"";\n//                     }\n//                     int x = 0;\n//                     while (x < c) {\n//                         x++;\n//                         cout << number[x] <<endl;\n//                     }\n//                 }\n//             }\n//             if (c % 2 == 1) {\n//                 if (c == 1) {\n//                     int p = 0;\n//                     while (p < v) {\n//                         p++;\n//                         cout << initnumber[p] << \"" \"";\n//                     }\n//                     int x = 0;\n//                     while (x < c) {\n//                         x++;\n//                         cout << number[x] << endl;\n//                     }\n//                 }\n//                 else {\n//                     m = 0;\n//                     for (int y = 0; y < ((c-1) / 2); y++) {\n//                         if (number[y] == number[c - 1 - y])\n//                             m++;\n//                     }\n//                     if (m ==((c-1)/ 2)) {\n//                         int p = 0;\n//                         while (p < v) {\n//                             p++;\n//                             cout << initnumber[p] << \"" \"";\n//                         }\n//                         int x = 0;\n//                         while (x < c) {\n//                             x++;\n//                             cout << number[x] << endl;\n//                         }\n//                     }\n//                 }\n//             }\n//         }\n     return 0;\n}",SEGMENTATION_FAULT,338,708
1395761220554452992,7329467fb7d55b4f17a356e6673fd243d9345fafd3b13143a1a2c7215789b62a,2021-05-21 23:19:41,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\nint initnumber[20];\nint number[20];\nint main() {\n    int B;\n    cin >> B;\n    int x = 1;\n    int m ;\n    int squre;\n\n    int j=0;\n\n        while (x <= 300) {\n            squre = x * x;\n            int l=0;\n            while (squre != 0 ) {\n                number[++l] = squre % B;\n                squre = squre / B;\n            }\n            for(m=1;m<=(l/2);m++){\n                if(number[m]!=number[l+1-m])\n                    break;\n            }\n            while (x != 0 ) {\n                initnumber[++j] = x % B;\n                x = x / B;\n            }\n            for(int p=j;p>=1;p--){\n                if(initnumber[p]>=10)\n                    cout<<char(initnumber[p]+55);\n                else \n                    cout<<initnumber[p];\n            }\n            cout<<\"" \"";\n            for(int p=l;p>=1;p--){\n                if(number[p]>=10)\n                    cout<<char(number[p]+55);\n                else\n                    cout<<number[p];\n            }\n            cout<<endl;\n            x++;\n        }\n    return 0;\n}",SEGMENTATION_FAULT,264,820
1395761547060162560,7329467fb7d55b4f17a356e6673fd243d9345fafd3b13143a1a2c7215789b62a,2021-05-21 23:20:59,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\nint initnumber[10];\nint number[10];\nint main() {\n    int B;\n    cin >> B;\n    int x = 1;\n    int m ;\n    int squre;\n\n    int j=0;\n\n        while (x <= 300) {\n            squre = x * x;\n            int l=0;\n            while (squre != 0 ) {\n                number[++l] = squre % B;\n                squre = squre / B;\n            }\n            for(m=1;m<=(l/2);m++){\n                if(number[m]!=number[l+1-m])\n                    break;\n            }\n            while (x != 0 ) {\n                initnumber[++j] = x % B;\n                x = x / B;\n            }\n            for(int p=j;p>=1;p--){\n                if(initnumber[p]>=10)\n                    cout<<char(initnumber[p]+55);\n                else \n                    cout<<initnumber[p];\n            }\n            cout<<\"" \"";\n            for(int p=l;p>=1;p--){\n                if(number[p]>=10)\n                    cout<<char(number[p]+55);\n                else\n                    cout<<number[p];\n            }\n            cout<<endl;\n            x++;\n        }\n    return 0;\n}",SEGMENTATION_FAULT,231,828
1395762681040465920,7329467fb7d55b4f17a356e6673fd243d9345fafd3b13143a1a2c7215789b62a,2021-05-21 23:25:29,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\nint initnumber[20];\nint number[20];\nint main() {\n    int B;\n    cin >> B;\n    int x = 1;\n    int m ;\n    int squre;\n    int j=0;\n\n        while (x <= 300) {\n            squre = x * x;\n            int l=0;\n            while (squre != 0 ) {\n                number[++l] = squre % B;\n                squre = squre / B;\n            }\n            for(m=1;m<=(l/2);m++){\n                if(number[m]!=number[l+1-m])\n                    break;\n            }\n            while (x != 0 ) {\n                initnumber[++j] = x % B;\n                x = x / B;\n            }\n            for(int p=j;p>=1;p--){\n                if(initnumber[p]>=10)\n                    cout<<char(initnumber[p]+55);\n                else \n                    cout<<initnumber[p];\n            }\n            cout<<\"" \"";\n            for(int p=l;p>=1;p--){\n                if(number[p]>=10)\n                    cout<<char(number[p]+55);\n                else\n                    cout<<number[p];\n            }\n            cout<<endl;\n            x++;\n        }\n    return 0;\n}",SEGMENTATION_FAULT,217,840
1395766887176712192,7329467fb7d55b4f17a356e6673fd243d9345fafd3b13143a1a2c7215789b62a,2021-05-21 23:42:12,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\nint initnumber[20];\nint number[20];\nint main() {\n    int B;\n    cin >> B;\n    int x = 1;\n    int m ;\n    int squre;\n    int j=0;\n\n        while (x <= 300) {\n            squre = x * x;\n            int l=0;\n            while (squre != 0 ) {\n                cout<<l<<endl;\n                number[++l] = squre % B;\n                //cout<<l<<endl;\n                squre = squre / B;\n            }\n            cout<<l<<\""\\n\""<<endl;\n            for(m=1;m<=(l/2);m++){\n                //cout<<m<<\""hhh\"";\n                if(number[m]!=number[l+1-m])\n                    break;\n            }\n            //cout<<l<<\""\\n\""<<endl;\n//             while (x != 0 ) {\n//                 initnumber[++j] = x % B;\n//                 x = x / B;\n//             }\n//             for(int p=j;p>=1;p--){\n//                 if(initnumber[p]>=10)\n//                     cout<<char(initnumber[p]+55);\n//                 else \n//                     cout<<initnumber[p];\n//             }\n//             cout<<\"" \"";\n//             for(int p=l;p>=1;p--){\n//                 if(number[p]>=10)\n//                     cout<<char(number[p]+55);\n//                 else\n//                     cout<<number[p];\n//             }\n//             cout<<endl;\n            x++;\n        }\n    return 0;\n}",WRONG_ANSWER,80,448
1395767170803908608,7329467fb7d55b4f17a356e6673fd243d9345fafd3b13143a1a2c7215789b62a,2021-05-21 23:43:20,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\nint initnumber[20];\nint number[20];\nint main() {\n    int B;\n    cin >> B;\n    int x = 1;\n    int m ;\n    int squre;\n    int j=0;\n\n        while (x <= 300) {\n            squre = x * x;\n            int l=0;\n            while (squre != 0 ) {\n                //cout<<l<<endl;\n                number[++l] = squre % B;\n                //cout<<l<<endl;\n                squre = squre / B;\n            }\n            //cout<<l<<\""\\n\""<<endl;\n            for(m=0;m<(l/2);m++){\n                //cout<<m<<\""hhh\"";\n                if(number[m]!=number[l+1-m])\n                    break;\n            }\n            //cout<<l<<\""\\n\""<<endl;\n            while (x != 0 ) {\n                initnumber[++j] = x % B;\n                x = x / B;\n            }\n            for(int p=j;p>=1;p--){\n                if(initnumber[p]>=10)\n                    cout<<char(initnumber[p]+55);\n                else \n                    cout<<initnumber[p];\n            }\n            cout<<\"" \"";\n            for(int p=l;p>=1;p--){\n                if(number[p]>=10)\n                    cout<<char(number[p]+55);\n                else\n                    cout<<number[p];\n            }\n            cout<<endl;\n            x++;\n        }\n    return 0;\n}",SEGMENTATION_FAULT,345,836
1395767481564114944,7329467fb7d55b4f17a356e6673fd243d9345fafd3b13143a1a2c7215789b62a,2021-05-21 23:44:34,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\nint initnumber[20];\nint number[20];\nint main() {\n    int B;\n    cin >> B;\n    int x = 1;\n    int m ;\n    int squre;\n    int j=0;\n\n        while (x <= 300) {\n            squre = x * x;\n            int l=0;\n            while (squre != 0 ) {\n                //cout<<l<<endl;\n                number[l] = squre % B;\n                l++;\n                //cout<<l<<endl;\n                squre = squre / B;\n            }\n            //cout<<l<<\""\\n\""<<endl;\n            for(m=0;m<(l/2);m++){\n                //cout<<m<<\""hhh\"";\n                if(number[m]!=number[l+1-m])\n                    break;\n            }\n            //cout<<l<<\""\\n\""<<endl;\n            while (x != 0 ) {\n                initnumber[++j] = x % B;\n                x = x / B;\n            }\n            for(int p=j;p>=1;p--){\n                if(initnumber[p]>=10)\n                    cout<<char(initnumber[p]+55);\n                else \n                    cout<<initnumber[p];\n            }\n            cout<<\"" \"";\n            for(int p=l;p>=1;p--){\n                if(number[p]>=10)\n                    cout<<char(number[p]+55);\n                else\n                    cout<<number[p];\n            }\n            cout<<endl;\n            x++;\n        }\n    return 0;\n}",SEGMENTATION_FAULT,231,828
1395767676838297600,7329467fb7d55b4f17a356e6673fd243d9345fafd3b13143a1a2c7215789b62a,2021-05-21 23:45:20,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\nvector<int> initnumber[20];\nvector<int> number[20];\nint main() {\n    int B;\n    cin >> B;\n    int x = 1;\n    int m ;\n    int squre;\n    int j=0;\n\n        while (x <= 300) {\n            squre = x * x;\n            int l=0;\n            while (squre != 0 ) {\n                //cout<<l<<endl;\n                number[l] = squre % B;\n                l++;\n                //cout<<l<<endl;\n                squre = squre / B;\n            }\n            //cout<<l<<\""\\n\""<<endl;\n            for(m=0;m<(l/2);m++){\n                //cout<<m<<\""hhh\"";\n                if(number[m]!=number[l+1-m])\n                    break;\n            }\n            //cout<<l<<\""\\n\""<<endl;\n            while (x != 0 ) {\n                initnumber[++j] = x % B;\n                x = x / B;\n            }\n            for(int p=j;p>=1;p--){\n                if(initnumber[p]>=10)\n                    cout<<char(initnumber[p]+55);\n                else \n                    cout<<initnumber[p];\n            }\n            cout<<\"" \"";\n            for(int p=l;p>=1;p--){\n                if(number[p]>=10)\n                    cout<<char(number[p]+55);\n                else\n                    cout<<number[p];\n            }\n            cout<<endl;\n            x++;\n        }\n    return 0;\n}",COMPILE_ERROR,0,0
1395767699995049984,b3864cf4149f35bf4db768bd40332baae5688cbab31e46d59dcd2d2ea3031697,2021-05-21 23:45:26,C++,80.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint n;\ninline string change(int decs){\n    string x;\n    x.clear();\n    stack<short> ns;\n    while(decs){\n        ns.push(decs%n);\n        decs/=n;\n    }\n    short ws=ns.size();\n    for(short i=1;i<=ws;i++){\n        short y=ns.top();\n        ns.pop();\n        if(y<10) x+=(y+'0');\n        else x+=(y-10+'A');\n    }\n    return x;\n}\ninline bool check(const string &x){\n    short i=0,j=x.size()-1;\n    while(i<j)\n        if(x[i++]!=x[j--])\n                       return false;\n    return true;\n}\nint main (){\n    scanf(\""%d\"",&n);\n    for(int i=1;i<=300;i++){\n        int inp=i*i;\n        string outp=change(inp);\n        if(check(outp))\n            cout<<change(i)<<\"" \""<<outp<<endl;\n    }\n    return 0;\n}",ACCEPTED,41,448
1395767998168035328,7329467fb7d55b4f17a356e6673fd243d9345fafd3b13143a1a2c7215789b62a,2021-05-21 23:46:37,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\nint initnumber[20];\nint number[20];\nint main() {\n    int B;\n    cin >> B;\n    int x = 1;\n    int m ;\n    int squre;\n    int j=0;\n\n        while (x <= 300) {\n            squre = x * x;\n            int l=0;\n            while (squre != 0 ) {\n                //cout<<l<<endl;\n                number[l] = squre % B;\n                l++;\n                //cout<<l<<endl;\n                squre = squre / B;\n            }\n            //cout<<l<<\""\\n\""<<endl;\n            for(m=0;m<(l/2);m++){\n                //cout<<m<<\""hhh\"";\n                if(number[m]!=number[l+1-m])\n                    return;\n            }\n            //cout<<l<<\""\\n\""<<endl;\n            while (x != 0 ) {\n                initnumber[++j] = x % B;\n                x = x / B;\n            }\n            for(int p=j;p>=1;p--){\n                if(initnumber[p]>=10)\n                    cout<<char(initnumber[p]+55);\n                else \n                    cout<<initnumber[p];\n            }\n            cout<<\"" \"";\n            for(int p=l;p>=1;p--){\n                if(number[p]>=10)\n                    cout<<char(number[p]+55);\n                else\n                    cout<<number[p];\n            }\n            cout<<endl;\n            x++;\n        }\n    return 0;\n}",COMPILE_ERROR,0,0
1395769228529479680,7329467fb7d55b4f17a356e6673fd243d9345fafd3b13143a1a2c7215789b62a,2021-05-21 23:51:30,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\nint initnumber[20];\nint number[20];\nint main() {\n    int B;\n    cin >> B;\n    int x = 1;\n    int m ;\n    int squre;\n    int j=0;\n\n        while (x <= 300) {\n            squre = x * x;\n            int l=0;\n            while (squre != 0 ) {\n                //cout<<l<<endl;\n                number[++l] = squre % B;\n                //cout<<l<<endl;\n                squre = squre / B;\n            }\n            //cout<<l<<\""\\n\""<<endl;\n            for(m=1;m<=(l/2);m++){\n                //cout<<m<<\""hhh\"";\n                if(number[m]!=number[l+1-m])\n                    break;\n            }\n            //cout<<l<<\""\\n\""<<endl;\n            while (x != 0 ) {\n                initnumber[++j] = x % B;\n                x = x / B;\n            }\n            for(int p=j;p>=1;p--){\n                if(initnumber[p]>=10)\n                    cout<<char(initnumber[p]+55);\n                else \n                    cout<<initnumber[p];\n            }\n            cout<<\"" \"";\n            for(int p=l;p>=1;p++){\n                if(number[p]>=10)\n                    cout<<char(number[p]+55);\n                else\n                    cout<<number[p];\n            }\n            cout<<endl;\n            x++;\n        }\n    return 0;\n}",SEGMENTATION_FAULT,57,468
1395769813894905856,7329467fb7d55b4f17a356e6673fd243d9345fafd3b13143a1a2c7215789b62a,2021-05-21 23:53:50,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\nint initnumber[20];\nint number[20];\nint main() {\n    int B;\n    cin >> B;\n    int x = 1;\n    int m ;\n    int squre;\n    int j=0;\n\n        while (x <= 300) {\n            squre = x * x;\n            int l=0;\n            while (squre != 0 ) {\n                //cout<<l<<endl;\n                number[++l] = squre % B;\n                //cout<<l<<endl;\n                squre = squre / B;\n            }\n            //cout<<l<<\""\\n\""<<endl;\n            for(m=1;m<=(l/2);m++){\n                //cout<<m<<\""hhh\"";\n                if(number[m]!=number[l+1-m])\n                    break;\n                else{\n                    while (x != 0 ) {\n                        initnumber[++j] = x % B;\n                        x = x / B;\n                    }\n                    for(int p=j;p>=1;p--){\n                        if(initnumber[p]>=10)\n                            cout<<char(initnumber[p]+55);\n                        else \n                            cout<<initnumber[p];\n                    }\n                    cout<<\"" \"";\n                    for(int p=l;p>=1;p++){\n                        if(number[p]>=10)\n                            cout<<char(number[p]+55);\n                        else\n                            cout<<number[p];\n                    }\n                    cout<<endl;\n                }\n            }\n            //cout<<l<<\""\\n\""<<endl;\n            \n            x++;\n        }\n    return 0;\n}",SEGMENTATION_FAULT,51,324
1395771472276570112,7329467fb7d55b4f17a356e6673fd243d9345fafd3b13143a1a2c7215789b62a,2021-05-22 00:00:25,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\nint initnumber[20];\nint number[20];\nint main() {\n    int B;\n    cin >> B;\n    int x = 1;\n    int m ;\n    int squre;\n    int j=0;\n\n        while (x <= 300) {\n            squre = x * x;\n            int l1=0;\n            while (squre != 0 ) {\n                //cout<<l<<endl;\n                number[++l1] = squre % B;\n                //cout<<l<<endl;\n                squre = squre / B;\n            }\n            //cout<<l<<\""\\n\""<<endl;\n            for(m=1;m<=(l1/2);m++){\n                //cout<<m<<\""hhh\"";\n                if(number[m]!=number[l1+1-m])\n                    break;\n                else{\n                    while (x != 0 ) {\n                        initnumber[++j] = x % B;\n                        x = x / B;\n                    }\n                    for(int p=j;p>=1;p--){\n                        if(initnumber[p]>=10)\n                            cout<<char(initnumber[p]+55);\n                        else \n                            cout<<initnumber[p];\n                    }\n                    cout<<\"" \"";\n                    for(int p=l1;p>=1;p--){\n                        if(number[p]>=10)\n                            cout<<char(number[p]+55);\n                        else\n                            cout<<number[p];\n                    }\n                    cout<<endl;\n                }\n            }\n            //cout<<l<<\""\\n\""<<endl;\n            \n            x++;\n        }\n    return 0;\n}",SEGMENTATION_FAULT,183,708
1395783700228730880,b3864cf4149f35bf4db768bd40332baae5688cbab31e46d59dcd2d2ea3031697,2021-05-22 00:49:01,Python,50.0,1353613982111367176,1267449136707624960,1049226397448056832,"def convert(n, x):\n    b = []\n    while True:\n        s = n // x\n        y = n % x\n        b = b + [str(y)]\n        if s == 0:\n            break\n        n = s\n    outlet = \""\"".join(b)\n    return outlet\n\n\ndef double_reversed_num(x):\n    counter = 0\n    for m in range(2, 11):\n        num = convert(x, m)\n        l = len(num)\n        l2 = int(l/2)\n        i = 0\n        while i <= l2:\n            if num[i] != num[l - i - 1]:\n                break\n            if i == l2:\n                counter += 1\n            i += 1\n        if counter == 2:\n            return True\n    return False\n\n\nn, s = map(int, input().split())\nout = []\nwhile len(out) != n:\n    if double_reversed_num(s):\n        out.append(s)\n    s += 1\n\nfor i in out:\n    print(i, end='\\n')",PARTIAL_ACCEPTED,318,3260
1395784091762929664,7329467fb7d55b4f17a356e6673fd243d9345fafd3b13143a1a2c7215789b62a,2021-05-22 00:50:34,C++,0.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include<cstdio>\n#include<iostream>\n#include<cstring>\nusing namespace std;\nint alist[100];\nint t=0;\nint m;\n\nint main(){\n\tint N,S,b=0,c=0;\n\tcin>>N>>S;\n\tfor(int i=S+1;b!=N;i++){\n\t\tc=0;\n\t\tfor(int j=2;j<=10&&c<2;j++){\n            memset(alist,0,sizeof(alist));\n            t=0;\n\t        while(i!=0){\n\t\t        alist[++t]=i%j;\n\t\t        i/=j;\t \n\t        } \n\t        int p=1,x=t;\n\t        while(p<x) {\n\t\t        if(alist[p]!=alist[x]) \n                    m=0;\n\t\t        p++;x--;\n\t        }\n\t        m=1;\n            if(m==1) \n                c++;\n        } \n\t\tif(c>=2){\n            b++;\n            cout<<i<<endl; \n        }\n    }         \n    return 0;\n}\n   \n",WRONG_ANSWER,47,432
1395784228132306944,7329467fb7d55b4f17a356e6673fd243d9345fafd3b13143a1a2c7215789b62a,2021-05-22 00:51:07,C++,0.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include<cstdio>\n#include<iostream>\n#include<cstring>\nusing namespace std;\nint alist[100];\nint t=0;\nint m;\n\nint main(){\n\tint N,S,b=0,c=0;\n\tcin>>N>>S;\n\tfor(int i=S+1;b!=N;i++){\n\t\tc=0;\n\t\tfor(int j=2;j<=10&&c<2;j++){\n            memset(alist,0,sizeof(alist));\n            t=0;\n\t        while(i!=0){\n\t\t        alist[++t]=i%j;\n\t\t        i/=j;\t \n\t        } \n\t        int p=1,x=t;\n\t        while(p<x) {\n\t\t        if(alist[p]!=alist[x]) \n                    m=0;\n\t\t        p++;x--;\n\t        }\n\t        m=1;\n            if(m==1) \n                c++;\n            cout<<c;\n        } \n\t\tif(c>=2){\n            b++;\n            cout<<i<<endl; \n        }\n    }         \n    return 0;\n}\n   \n",WRONG_ANSWER,30,444
1395784981962010624,b3864cf4149f35bf4db768bd40332baae5688cbab31e46d59dcd2d2ea3031697,2021-05-22 00:54:06,Python,70.0,1353613982111367176,1267449136707624960,1049226397448056832,"def convert(n, x):\n    b = []\n    while True:\n        s = n // x\n        y = n % x\n        b = b + [str(y)]\n        if s == 0:\n            break\n        n = s\n    outlet = \""\"".join(b)\n    return outlet\n\n\ndef double_reversed_num(x):\n    counter = 0\n    for m in range(2, 11):\n        num = convert(x, m)\n        l = len(num)\n        l2 = int(l/2)\n        i = 0\n        while i <= l2:\n            if num[i] != num[l - i - 1]:\n                break\n            if i == l2:\n                counter += 1\n            i += 1\n        if counter == 2:\n            return True\n    return False\n\n\nn, s = map(int, input().split())\nout = []\ns += 1\nwhile len(out) != n:\n    if double_reversed_num(s):\n        out.append(s)\n    s += 1\n\nfor i in out:\n    print(i, end='\\n')",ACCEPTED,363,3256
1395785355447889920,7329467fb7d55b4f17a356e6673fd243d9345fafd3b13143a1a2c7215789b62a,2021-05-22 00:55:35,C++,10.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include<cstdio>\n#include<iostream>\n#include<cstring>\nusing namespace std;\n// int alist[100];\n// int t=0;\n// int m;\n\n// int main(){\n// \tint N,S,b=0,c=0;\n// \tcin>>N>>S;\n// \tfor(int i=S+1;b!=N;i++){\n// \t\tc=0;\n// \t\tfor(int j=2;j<=10&&c<2;j++){\n//             memset(alist,0,sizeof(alist));\n//             t=0;\n// \t        while(i!=0){\n// \t\t        alist[++t]=i%j;\n// \t\t        i/=j;\t \n// \t        } \n// \t        int p=1,x=t;\n// \t        while(p<x) {\n// \t\t        if(alist[p]!=alist[x]) \n//                     m=0;\n// \t\t        p++;x--;\n// \t        }\n// \t        m=1;\n//             if(m==1) \n//                 c++;\n//             cout<<c<<endl;\n//             cout<<i;\n//         } \n// \t\tif(c>=2){\n//             b++;\n//             cout<<i<<endl; \n//         }\n//     }         \n//     return 0;\n// \n\nint s[100],t=0;\nint judge(int a,int j);\nint m;\n\nint main()\n{\n\tint n,s,ans=0,cnt=0;\n\tcin>>n>>s;\n\tfor(int i=s+1;ans!=n;i++)\n\t{\n\t\tcnt=0;\n\t\tfor(int j=2;j<=10&&cnt<2;j++) if(judge(i,j)==1) cnt++;\n\t\tif(cnt>=2) ans++,cout<<i<<endl;  \n\t} \n\treturn 0;\n}\nint judge(int a,int j){\n\tmemset(s,0,sizeof(s));t=0;\n\twhile(a!=0){\n\t\ts[++t]=a%j;\n\t\ta/=j;\t \n\t} \n\tint l=1,r=t;\n\twhile(l<r){\n\t\tif(s[l]!=s[r]) \n            m=0;\n\t\tl++;r--;\n\t}\n\tm=1;\n}\n\n",PARTIAL_ACCEPTED,23,452
1395785613024292864,7329467fb7d55b4f17a356e6673fd243d9345fafd3b13143a1a2c7215789b62a,2021-05-22 00:56:37,C++,70.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include<cstdio>\n#include<iostream>\n#include<cstring>\nusing namespace std;\n// int alist[100];\n// int t=0;\n// int m;\n\n// int main(){\n// \tint N,S,b=0,c=0;\n// \tcin>>N>>S;\n// \tfor(int i=S+1;b!=N;i++){\n// \t\tc=0;\n// \t\tfor(int j=2;j<=10&&c<2;j++){\n//             memset(alist,0,sizeof(alist));\n//             t=0;\n// \t        while(i!=0){\n// \t\t        alist[++t]=i%j;\n// \t\t        i/=j;\t \n// \t        } \n// \t        int p=1,x=t;\n// \t        while(p<x) {\n// \t\t        if(alist[p]!=alist[x]) \n//                     m=0;\n// \t\t        p++;x--;\n// \t        }\n// \t        m=1;\n//             if(m==1) \n//                 c++;\n//             cout<<c<<endl;\n//             cout<<i;\n//         } \n// \t\tif(c>=2){\n//             b++;\n//             cout<<i<<endl; \n//         }\n//     }         \n//     return 0;\n// \n\nint s[100],t=0;\nint judge(int a,int j);\nint m;\n\nint main()\n{\n\tint n,s,ans=0,cnt=0;\n\tcin>>n>>s;\n\tfor(int i=s+1;ans!=n;i++)\n\t{\n\t\tcnt=0;\n\t\tfor(int j=2;j<=10&&cnt<2;j++) if(judge(i,j)==1) cnt++;\n\t\tif(cnt>=2) ans++,cout<<i<<endl;  \n\t} \n\treturn 0;\n}\nint judge(int a,int j){\n\tmemset(s,0,sizeof(s));t=0;\n\twhile(a!=0){\n\t\ts[++t]=a%j;\n\t\ta/=j;\t \n\t} \n\tint l=1,r=t;\n\twhile(l<r){\n\t\tif(s[l]!=s[r]) \n            return m=0;\n\t\tl++;r--;\n\t}\n\treturn m=1;\n}\n\n",ACCEPTED,35,452
1395790321797427200,c8ad8566b7896c57059add4d643d6d972fd2b944829549e44c198de54b2a0563,2021-05-22 01:15:19,C++,80.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm> \nusing namespace std;\n\nbool V_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length;\n    length = a.length();\n    int judgment = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1])\n        {\n            judgment = 0;\n            break;\n        }\n    }\n    if (judgment == 1) //判断是否是回文数；\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，取余；\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\n        {\n            ans += t + '0';\n        }\n        else\n        {\n            ans += t - 10 + 'A'; // 保证进制大于10时，数字能用大写字母表示；\n        }\n        n /= radix;\n    } while (n != 0);\t\n    reverse(ans.begin(), ans.end());  // 模N取余，字符串反转得到对应进制数；\n    return ans;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    int j = 0;\n    for (int x = 1; x <= 300; x++)\n    {\n        j = x; //副本\n\n        string s1 = intToA(j, n);      // 按n进制转换；\n        string s2 = intToA((j * j), n);// 平方按n进制转换；\n\n        if (V_num(s2))\n        {\n            cout << s1 << \"" \"" << s2 << endl;\n        }\n        else\n        {\n            continue;\n        }\n    }\n    return 0;\n}",ACCEPTED,45,332
1395950003364503552,c8ad8566b7896c57059add4d643d6d972fd2b944829549e44c198de54b2a0563,2021-05-22 11:49:50,C++,70.0,1353613982111367176,1267449136707624960,1049226397448056832,"//最大回文素数\n#include<iostream>\n#include<cstdio>\n#include<cstring>\n#include<string>\nusing namespace std;\ntypedef long long int LL;\nstring convert(LL n, LL m)//n进制转化为m进制\n{\n    string str;\n    if (m <= 10)\n    {\n        while (n)\n        {\n            str += (n % m + '0');\n            n /= m;\n        }\n    }\n    else\n    {\n        while (n)\n        {\n            int x = n % m;\n            if (x >= 10)\n            {\n                x -= 10;\n                str += (x + 'A');\n            }\n            else\n                str += (x + '0');\n            n /= m;\n        }\n    }\n    return str;\n}\nbool judgment(string str)//判断是否回文\n{\n    int len = str.size();\n    for (int i = 0; i <= len / 2 - 1; i++)\n    {\n        if (str[i] != str[len - i - 1])\n            return false;\n    }\n    return true;\n}\nint main(){\n    LL n, s;\n    cin >> n >> s;\n    int num = 0;\n    LL i, j;\n    for (i = s + 1; num < n; i++)\n    {\n        int t = 0;\n        for (j = 2; j <= 10; j++)//2转10进制\n        {\n            string str = convert(i, j);\n            if (judgment(str) == true)\n                t++;\n            if (t == 2)\n            {\n                num++;\n                break;\n            }\n        }\n        if (j <= 10)\n            cout << i << endl;\n    }\n    system(\""pause\"");\n    return 0;\n}",ACCEPTED,51,704
1396002233484517376,daa3ea531ee2579c6155f062294c2c51073d34d16f5bf42025aee09ed9a7a2ac,2021-05-22 15:17:23,Python,10.0,1353613982111367175,1267442030214471680,1049226397448056832,"n = int(input())\nlst = []\nlst1 = []\nlst3 = []\n\ndef jinzhi(n, i):\n    lst = []\n    while i >= n:\n        x = i % n\n        i = int(i / n)\n        if x > 10:\n            x = ord(x + 54)\n        lst.append(x)\n    if i < n:\n        lst.append(i)\n    return lst\n\ndef jinzhi2(n, i):\n    lst2 = []\n    while i >= n:\n        i = int(i / n)\n        x = i % n\n        if x > 10:\n            x = ord(x + 54)\n        lst2.append(x)\n    if i < n:\n        lst2.append(i)\n    return lst2\n\n\nfor i in range(1,301):\n    item = i ** 2\n    item_lst = jinzhi(n, item)\n    item_lst2 = jinzhi(n, item)\n    item_lst2.reverse()\n    if item_lst == item_lst2:\n        print(i, item)",PARTIAL_ACCEPTED,195,3280
1396003805815840768,daa3ea531ee2579c6155f062294c2c51073d34d16f5bf42025aee09ed9a7a2ac,2021-05-22 15:23:38,Python,50.0,1353613982111367175,1267442030214471680,1049226397448056832,"n = int(input())\nlst = []\nlst1 = []\nlst3 = []\n\ndef jinzhi(n, i):\n    lst = []\n    while i >= n:\n        x = i % n\n        i = int(i / n)\n        if x > 10:\n            x = ord(x + 54)\n        lst.append(x)\n    if i < n:\n        lst.append(i)\n    return lst\n\ndef jinzhi2(n, i):\n    lst2 = []\n    while i >= n:\n        i = int(i / n)\n        x = i % n\n        if x > 10:\n            x = ord(x + 54)\n        lst2.append(x)\n    if i < n:\n        lst2.append(i)\n    return lst2\n\n\nfor i in range(1,301):\n    item = i ** 2\n    item_lst = jinzhi(n, item)\n    item_lst2 = jinzhi(n, item)\n    item_lst2.reverse()\n    if item_lst == item_lst2:\n        num2 = str(item_lst2).replace(\""[\"",\""\"").replace(\""]\"",\""\"").replace(\"",\"",\""\"").replace(\"" \"",\""\"")\n        xxxlst = jinzhi(n,i)\n        xxxlst.reverse()\n        num1 = str(xxxlst).replace(\""[\"",\""\"").replace(\""]\"",\""\"").replace(\"",\"",\""\"").replace(\"" \"",\""\"")\n        print(num1, num2)",PARTIAL_ACCEPTED,198,3268
1396006707341684736,daa3ea531ee2579c6155f062294c2c51073d34d16f5bf42025aee09ed9a7a2ac,2021-05-22 15:35:10,Python,50.0,1353613982111367175,1267442030214471680,1049226397448056832,"n = int(input())\nlst = []\nlst1 = []\nlst3 = []\n\ndef jinzhi(n, i):\n    lst = []\n    while i >= n:\n        x = i % n\n        i = int(i / n)\n        if x >= 10:\n            num = int(x + 55)\n            x = chr(num)\n            x = x.replace(\""'\"", '')\n        lst.append(x)\n    if i < n:\n        lst.append(i)\n    return lst\n\n\n\nfor i in range(1,301):\n    item = i ** 2\n    item_lst = jinzhi(n, item)\n    item_lst2 = jinzhi(n, item)\n    item_lst2.reverse()\n    if item_lst == item_lst2:\n        num2 = str(item_lst2).replace(\""[\"",\""\"").replace(\""]\"",\""\"").replace(\"",\"",\""\"").replace(\"" \"",\""\"").replace(\""'\"",\""\"")\n        xxxlst = jinzhi(n,i)\n        xxxlst.reverse()\n        num1 = str(xxxlst).replace(\""[\"",\""\"").replace(\""]\"",\""\"").replace(\"",\"",\""\"").replace(\"" \"",\""\"")\n        print(num1, num2)",PARTIAL_ACCEPTED,193,3264
1396006961306791936,daa3ea531ee2579c6155f062294c2c51073d34d16f5bf42025aee09ed9a7a2ac,2021-05-22 15:36:10,Python,50.0,1353613982111367175,1267442030214471680,1049226397448056832,"n = int(input())\nlst = []\nlst1 = []\nlst3 = []\n\ndef jinzhi(n, i):\n    lst = []\n    while i >= n:\n        x = i % n\n        i = int(i / n)\n        if x >= 10:\n            num = int(x + 55)\n            x = chr(num)\n            x = x.replace(\""'\"", '')\n        lst.append(x)\n    if i < n:\n        lst.append(i)\n    return lst\n\n\n\nfor i in range(1,301):\n    item = i ** 2\n    item_lst = jinzhi(n, item)\n    item_lst2 = jinzhi(n, item)\n    item_lst2.reverse()\n    if item_lst == item_lst2:\n        num2 = str(item_lst2).replace(\""[\"",\""\"").replace(\""]\"",\""\"").replace(\"",\"",\""\"").replace(\"" \"",\""\"").replace(\""'\"",\""\"")\n        xxxlst = jinzhi(n,i)\n        xxxlst.reverse()\n        num1 = str(xxxlst).replace(\""[\"",\""\"").replace(\""]\"",\""\"").replace(\"",\"",\""\"").replace(\"" \"",\""\"")\n        print(num1, num2)",PARTIAL_ACCEPTED,294,3272
1396007453211959296,daa3ea531ee2579c6155f062294c2c51073d34d16f5bf42025aee09ed9a7a2ac,2021-05-22 15:38:08,Python,50.0,1353613982111367175,1267442030214471680,1049226397448056832,"n = int(input())\nlst = []\nlst1 = []\nlst3 = []\n\ndef jinzhi(n, i):\n    lst = []\n    while i >= n:\n        x = i % n\n        i = int(i / n)\n        if x >= 10:\n            num = int(x + 55)\n            x = chr(num)\n            x = x.replace(\""'\"", '')\n        lst.append(x)\n    if i < n:\n        lst.append(i)\n    return lst\n\n\n\nfor i in range(1,301):\n    item = i ** 2\n    item_lst = jinzhi(n, item)\n    item_lst2 = jinzhi(n, item)\n    item_lst2.reverse()\n    if item_lst == item_lst2:\n        num2 = str(item_lst2).replace(\""[\"",\""\"").replace(\""]\"",\""\"").replace(\"",\"",\""\"").replace(\"" \"",\""\"").replace(\""'\"",\""\"")\n        xxxlst = jinzhi(n,i)\n        xxxlst.reverse()\n        num1 = str(xxxlst).replace(\""[\"",\""\"").replace(\""]\"",\""\"").replace(\"",\"",\""\"").replace(\"" \"",\""\"")\n        print(num1, num2)",PARTIAL_ACCEPTED,196,3260
1396007801750233088,daa3ea531ee2579c6155f062294c2c51073d34d16f5bf42025aee09ed9a7a2ac,2021-05-22 15:39:31,Python,50.0,1353613982111367175,1267442030214471680,1049226397448056832,"n = int(input())\nlst = []\nlst1 = []\nlst3 = []\n\ndef jinzhi(n, i):\n    lst = []\n    while i >= n:\n        x = i % n\n        i = int(i / n)\n        if x >= 10:\n            num = int(x + 55)\n            x = chr(num)\n            x = x.replace(\""'\"", '')\n        lst.append(x)\n    if i < n:\n        lst.append(i)\n    return lst\n\n\n\nfor i in range(1,301):\n    item = i ** 2\n    item_lst = jinzhi(n, item)\n    item_lst2 = jinzhi(n, item)\n    item_lst2.reverse()\n    if item_lst == item_lst2:\n        num2 = str(item_lst2).replace(\""[\"",\""\"").replace(\""]\"",\""\"").replace(\"",\"",\""\"").replace(\"" \"",\""\"").replace(\""'\"",\""\"")\n        xxxlst = jinzhi(n,i)\n        xxxlst.reverse()\n        num1 = str(xxxlst).replace(\""[\"",\""\"").replace(\""]\"",\""\"").replace(\"",\"",\""\"").replace(\"" \"",\""\"").replace(\""'\"",\""\"")\n        print(num1, num2)",PARTIAL_ACCEPTED,213,3256
1396008286037151744,daa3ea531ee2579c6155f062294c2c51073d34d16f5bf42025aee09ed9a7a2ac,2021-05-22 15:41:26,Python,80.0,1353613982111367175,1267442030214471680,1049226397448056832,"n = int(input())\nlst = []\nlst1 = []\nlst3 = []\n\ndef jinzhi(n, i):\n    lst = []\n    while i >= n:\n        x = i % n\n        i = int(i / n)\n        if x >= 10:\n            num = int(x + 55)\n            x = chr(num)\n            x = x.replace(\""'\"", '')\n        lst.append(x)\n    if i < n:\n        if i >= 10:\n            num = int(i + 55)\n            i = chr(num)\n            i = i.replace(\""'\"", '')\n        lst.append(i)\n    return lst\n\n\n\nfor i in range(1,301):\n    item = i ** 2\n    item_lst = jinzhi(n, item)\n    item_lst2 = jinzhi(n, item)\n    item_lst2.reverse()\n    if item_lst == item_lst2:\n        num2 = str(item_lst2).replace(\""[\"",\""\"").replace(\""]\"",\""\"").replace(\"",\"",\""\"").replace(\"" \"",\""\"").replace(\""'\"",\""\"")\n        xxxlst = jinzhi(n,i)\n        xxxlst.reverse()\n        num1 = str(xxxlst).replace(\""[\"",\""\"").replace(\""]\"",\""\"").replace(\"",\"",\""\"").replace(\"" \"",\""\"").replace(\""'\"",\""\"")\n        print(num1, num2)",ACCEPTED,214,3392
1396063369662427136,a49161191ed8559acbd7768a1c9a88fd0e247f387ec082b7bb190c2da86a4aaa,2021-05-22 19:20:19,C++,80.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nstring solve(int a,int b);\nbool flag;\nint main()\n{\n        int n;\n        cin>>n;\n        for(int i=1;i<=300;i++)\n        {\n                string  a=solve(i,n);\n               string b=solve(i*i,n);\n                if(flag) cout<<a<<' '<<b<<endl;\n        }\n        return 0;\n}\nstring solve(int a,int b)\n{\n    string d;\n        d.clear();\n    int i=0;\n    char c;\n    while(a%b!=a)\n    {\n        i=a%b;\n        if(i>=10) c=char(i+55);\n        else c=i+'0';\n        a=a/b;\n       d.push_back(c);\n    }\n    if(a>=10) c=char(a+55);\n    else c=a+'0';\n    d.push_back(c);\n    string e=d;\n    reverse(d.begin(),d.end());\n    if(e==d) flag=1;\n    else flag=0;\n    return d;\n}\n\n",ACCEPTED,40,336
1396067543528972288,a49161191ed8559acbd7768a1c9a88fd0e247f387ec082b7bb190c2da86a4aaa,2021-05-22 19:36:54,C++,70.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include <stdio.h>\nint judge(int n,int r) {\n\tint a[20],i=0,j;\n\t//进制转换\n\twhile(n != 0) {\n\t\ta[i]= n%r;\n\t\ti++;\n\t\tn=n/r;\n\t}\n\n\tfor(j=0;j<i;j++) {\n\t\tif(a[j] !=a[i-j-1])  //判断是否回文数\n\t\t\tbreak;\n\t}\n\tif(j==i)\n\t\treturn 1;\n\telse\n\t\treturn 0;\n}\nint main() {\n\tint N,S,i,count=0,m,k,r;\n\tscanf(\""%d%d\"",&N,&S);\n\ti=S+1;\n\twhile(count<N) {\n\t\tk=0;\n\t\tfor(r=2;r<=10;r++) {\n\t\t\tm=judge(i,r);  //进制转换\n\t\t\tif(m==1)\n\t\t\t\tk++;\n\t\t\tif(k>=2) {\n\t\t\t\tprintf(\""%d\\n\"",i);\n\t\t\t\tcount++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\ti++;\n\t}\n\treturn 0;\n}\n",ACCEPTED,30,200
1396079096821837824,daa3ea531ee2579c6155f062294c2c51073d34d16f5bf42025aee09ed9a7a2ac,2021-05-22 20:22:49,C++,70.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include <iostream>  \n#include <vector>\n#include <string>  \n#include <algorithm>  \nusing namespace std;\n\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1])\n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1) // 是回文数；\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，n是待转数字，radix是指定的进制\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\n        {\n            ans += t + '0';\n        }\n        else\n        {\n            ans += t - 10 + 'A';\n        }\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（）以防止输入为0的情况\n    reverse(ans.begin(), ans.end());\n    return ans;\n}\n\nint main()\n{\n    int n, s;\n    cin >> n >> s;\n    s++; //双重回文数要大于s，从s+1开始遍历；\n    vector<int> p; // 容器p，存放双重回文数；\n    int sum; // 记录有几种进制的数是回文数；\n    while ((p.size() < n)) // 根据容器p里双重回文数的个数决定是否终止程序；\n    {\n        sum = 0;\n        for (int i = 2; i <= 10; i++)\n        {\n            if (Palin_num(intToA(s, i))) // 此时对应进制的数是回文数；\n            {\n                sum++; // 记录次数+1；\n            }\n        }\n        if (sum >= 2) // 双重回文数，压入容器p中；\n        {\n            p.push_back(s);\n        }\n        s++; // 继续遍历；\n    }\n    for (int i = 0; i < p.size(); i++)\n    {\n        cout << p[i] << endl;\n    }\n    return 0;\n}\n",ACCEPTED,41,448
1396086160600199168,daa3ea531ee2579c6155f062294c2c51073d34d16f5bf42025aee09ed9a7a2ac,2021-05-22 20:50:53,C++,0.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include <iostream>  \n#include <vector>\n#include <string>  \n#include <algorithm>  \nusing namespace std;\n\nbool huiwen(const string a)\n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1])\n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1) // 是回文数；\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring jinzhi(int n, int radix)\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\n        {\n            ans += t + '0';\n        }\n        else\n        {\n            ans += t - 10 + 'A';\n        }\n        n /= radix;\n    } while (n != 0);\n    reverse(ans.begin(), ans.end());\n    return ans;\n}\n\nint main()\n{\n    int n, s;\n    cin >> n >> s;\n    s = s + 1;\n    vector<int> p; \n    int sum; \n    int xxx;\n    while ((p.size() < n))\n        sum = 0;\n        for (int i = 2; i <= 10; i = i + 1)\n        {\n            xxx = jinzhi(s, i)\n            if (huiwen(xxx)\n            {\n                sum = sum + 1;\n            }\n        }\n        if (sum >= 2)\n        {\n            p.push_back(s);\n        }\n        s = s + 1;\n    }\n    for (int i = 0; i < p.size(); i++)\n    {\n        cout << p[i] << endl;\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1396086308185174016,daa3ea531ee2579c6155f062294c2c51073d34d16f5bf42025aee09ed9a7a2ac,2021-05-22 20:51:28,C++,0.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include <iostream>  \n#include <vector>\n#include <string>  \n#include <algorithm>  \nusing namespace std;\n\nbool Palin_num(const string a)\n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1])\n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1)\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring intToA(int n, int radix)\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\n        {\n            ans += t + '0';\n        }\n        else\n        {\n            ans += t - 10 + 'A';\n        }\n        n /= radix;\n    } while (n != 0);\n    reverse(ans.begin(), ans.end());\n    return ans;\n}\n\nint main()\n{\n    int n, s;\n    cin >> n >> s;\n    s = s + 1;\n    vector<int> p; \n    int sum; \n    int xxx;\n    while ((p.size() < n))\n        sum = 0;\n        for (int i = 2; i <= 10; i = i + 1)\n        {\n            xxx = intToA(s, i)\n            if (Palin_num(xxx)\n            {\n                sum = sum + 1;\n            }\n        }\n        if (sum >= 2)\n        {\n            p.push_back(s);\n        }\n        s = s + 1;\n    }\n    for (int i = 0; i < p.size(); i++)\n    {\n        cout << p[i] << endl;\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1396086385821741056,daa3ea531ee2579c6155f062294c2c51073d34d16f5bf42025aee09ed9a7a2ac,2021-05-22 20:51:47,C++,0.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include <iostream>  \n#include <vector>\n#include <string>  \n#include <algorithm>  \nusing namespace std;\n\nbool Palin_num(const string a)\n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1])\n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1) // 是回文数；\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring intToA(int n, int radix)\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\n        {\n            ans += t + '0';\n        }\n        else\n        {\n            ans += t - 10 + 'A';\n        }\n        n /= radix;\n    } while (n != 0);\n    reverse(ans.begin(), ans.end());\n    return ans;\n}\n\nint main()\n{\n    int n, s;\n    cin >> n >> s;\n    s = s + 1;\n    vector<int> p; \n    int sum; \n    int xxx;\n    while ((p.size() < n))\n        sum = 0;\n        for (int i = 2; i <= 10; i = i + 1)\n        {\n            xxx = intToA(s, i)\n            if (Palin_num(xxx) // 此时对应进制的数是回文数；\n            {\n                sum++; // 记录次数+1；\n            }\n        }\n        if (sum >= 2) // 双重回文数，压入容器p中；\n        {\n            p.push_back(s);\n        }\n        s++; // 继续遍历；\n    }\n    for (int i = 0; i < p.size(); i++)\n    {\n        cout << p[i] << endl;\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1396086615015288832,daa3ea531ee2579c6155f062294c2c51073d34d16f5bf42025aee09ed9a7a2ac,2021-05-22 20:52:41,C++,70.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include <iostream>  \n#include <vector>\n#include <string>  \n#include <algorithm>  \nusing namespace std;\n\nbool Palin_num(const string a) \n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1])\n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1)\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring intToA(int n, int radix)\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\n        {\n            ans += t + '0';\n        }\n        else\n        {\n            ans += t - 10 + 'A';\n        }\n        n /= radix;\n    } while (n != 0);\n    reverse(ans.begin(), ans.end());\n    return ans;\n}\n\nint main()\n{\n    int n, s;\n    cin >> n >> s;\n    s++;\n    vector<int> p;\n    int sum;\n    while ((p.size() < n))\n    {\n        sum = 0;\n        for (int i = 2; i <= 10; i++)\n        {\n            if (Palin_num(intToA(s, i)))\n            {\n                sum++;\n            }\n        }\n        if (sum >= 2)\n        {\n            p.push_back(s);\n        }\n        s++;\n    }\n    for (int i = 0; i < p.size(); i++)\n    {\n        cout << p[i] << endl;\n    }\n    return 0;\n}\n",ACCEPTED,37,328
1396095055059423232,7329467fb7d55b4f17a356e6673fd243d9345fafd3b13143a1a2c7215789b62a,2021-05-22 21:26:13,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include <cstdlib>\n#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <cstring>\nusing namespace std;\nint initnumber[1000],squarenumber[1000];\nint temp[1000];\nvoid changebase(int *position,int num,int Base);\nint is_palindromic(int *num);\n\nint main(){\n    int i;\n    int B;\n    cin>>B;\n    for (i=1;i<=300;i++){\n        changebase(initnumber,i,B);\n        changebase(squarenumber,i*i,B);\n        if (is_palindromic(squarenumber)==1){\n            for (int i=1;i<=initnumber[0];i++){\n                if (initnumber[i]>=10) \n                    cout<<char(initnumber[i]-10+'A')<<\"" \"";\n                else \n                    cout<<initnumber[i]<<\"" \"";\n            }\n            for (int i=1;i<=squarenumber[0];i++){\n                if (squarenumber[i]>=10) \n                    cout<<char(squarenumber[i]-10+'A')<<endl;\n                else \n                    cout<<squarenumber[i]<<endl;\n     }\n        }\n    }\n    return 0;\n}\n\nvoid changebase(int *position,int num,int Base)\n{\n     int a=0;\n     memset(position,0,sizeof(position));\n     memset(temp,0,sizeof(temp));\n     a++;\n     \n     while (num!=0){\n           int t;\n           t=num%Base;\n           num=num/Base;\n           temp[a++]=t;\n     }\n     a--;\n     for (int i=a;i>=1;i--) \n         position[a-i+1]=temp[i];\n     position[0]=a;\n     return;\n}\nint is_palindromic(int *num)\n{\n     int b=num[0],i;\n     for (i=1;i<=(b/2)+1;i++)\n        if (num[i]!=num[b-i+1]) \n            return 0;\n     return 1;\n}\n",PRESENTATION_ERROR,125,412
1396096609085419520,7329467fb7d55b4f17a356e6673fd243d9345fafd3b13143a1a2c7215789b62a,2021-05-22 21:32:24,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include <cstdlib>\n#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <cstring>\nusing namespace std;\nint initnumber[1000],squarenumber[1000];\nint temp[1000];\nvoid changebase(int *position,int num,int Base);\nint is_palindromic(int *num);\n\nint main(){\n    int i;\n    int B;\n    cin>>B;\n    for (i=1;i<=300;i++){\n        changebase(initnumber,i,B);\n        changebase(squarenumber,i*i,B);\n        if (is_palindromic(squarenumber)==1){\n            for (int i=1;i<initnumber[0];i++){\n                if (initnumber[i]>=10) \n                    cout<<char(initnumber[i]-10+'A');\n                else \n                    cout<<initnumber[i];\n            }\n            int d=initnumber[0];\n            if (initnumber[d]>=10) \n                cout<<char(initnumber[d]-10+'A')<<\"" \"";\n            else \n                cout<<initnumber[d]<<\"" \"";\n            for (int i=1;i<squarenumber[0];i++){\n                if (squarenumber[i]>=10) \n                    cout<<char(squarenumber[i]-10+'A');\n                else \n                    cout<<squarenumber[i];\n            }\n            e=squarenumber[0];\n            if (squarenumber[e]>=10)\n                cout<<char(squarenumber[e]-10+'A')<<endl;\n            else\n                cout<<squarenumber[e]<<endl;\n        }\n    }\n    return 0;\n}\n\nvoid changebase(int *position,int num,int Base)\n{\n     int a=0;\n     memset(position,0,sizeof(position));\n     memset(temp,0,sizeof(temp));\n     a++;\n     \n     while (num!=0){\n           int t;\n           t=num%Base;\n           num=num/Base;\n           temp[a++]=t;\n     }\n     a--;\n     for (int i=a;i>=1;i--) \n         position[a-i+1]=temp[i];\n     position[0]=a;\n     return;\n}\nint is_palindromic(int *num)\n{\n     int b=num[0],i;\n     for (i=1;i<=(b/2)+1;i++)\n        if (num[i]!=num[b-i+1]) \n            return 0;\n     return 1;\n}\n",COMPILE_ERROR,0,0
1396096693639782400,7329467fb7d55b4f17a356e6673fd243d9345fafd3b13143a1a2c7215789b62a,2021-05-22 21:32:44,C++,80.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include <cstdlib>\n#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <cstring>\nusing namespace std;\nint initnumber[1000],squarenumber[1000];\nint temp[1000];\nvoid changebase(int *position,int num,int Base);\nint is_palindromic(int *num);\n\nint main(){\n    int i;\n    int B;\n    cin>>B;\n    for (i=1;i<=300;i++){\n        changebase(initnumber,i,B);\n        changebase(squarenumber,i*i,B);\n        if (is_palindromic(squarenumber)==1){\n            for (int i=1;i<initnumber[0];i++){\n                if (initnumber[i]>=10) \n                    cout<<char(initnumber[i]-10+'A');\n                else \n                    cout<<initnumber[i];\n            }\n            int d=initnumber[0];\n            if (initnumber[d]>=10) \n                cout<<char(initnumber[d]-10+'A')<<\"" \"";\n            else \n                cout<<initnumber[d]<<\"" \"";\n            for (int i=1;i<squarenumber[0];i++){\n                if (squarenumber[i]>=10) \n                    cout<<char(squarenumber[i]-10+'A');\n                else \n                    cout<<squarenumber[i];\n            }\n            int e=squarenumber[0];\n            if (squarenumber[e]>=10)\n                cout<<char(squarenumber[e]-10+'A')<<endl;\n            else\n                cout<<squarenumber[e]<<endl;\n        }\n    }\n    return 0;\n}\n\nvoid changebase(int *position,int num,int Base)\n{\n     int a=0;\n     memset(position,0,sizeof(position));\n     memset(temp,0,sizeof(temp));\n     a++;\n     \n     while (num!=0){\n           int t;\n           t=num%Base;\n           num=num/Base;\n           temp[a++]=t;\n     }\n     a--;\n     for (int i=a;i>=1;i--) \n         position[a-i+1]=temp[i];\n     position[0]=a;\n     return;\n}\nint is_palindromic(int *num)\n{\n     int b=num[0],i;\n     for (i=1;i<=(b/2)+1;i++)\n        if (num[i]!=num[b-i+1]) \n            return 0;\n     return 1;\n}\n",ACCEPTED,36,452
1396274095886823424,54242ed848862eb0fd48c2ef8f791d0dd432ebde3251b1664a501173aef0674a,2021-05-23 09:17:40,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm> \nusing namespace std;\n\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= ((length / 2)+1); i++)\n    {\n        if (a[i]== a[length - i - 1])\n        {\n            flag = 1;\n            break;\n        }\n        else {\n            flag = 0;\n        }\n    }\n    if (flag == 1) // 是回文数；\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，使用模N取余法；\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\n        {\n            ans += t + '0';\n        }\n        else\n        {\n            ans += t - 10 + 'A'; // 保证进制大于10时，数字能用大写字母表示；\n        }\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（），以防止输入为0的情况；\n    reverse(ans.begin(), ans.end());  // 模N取余法，得到的字符串反转即可得到对应进制的数；\n    return ans;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    // int j = 0;\n    for (int x = 1; x <= 300; x++)\n    {\n        //j = x; // 创建副本\n\n        string s1 = intToA(x, n);      // 将整数按n进制转换；\n        string s2 = intToA((x * x), n);// 将该数的平方按n进制转换；\n\n        if (Palin_num(s2))\n        {\n            cout << s1 << \"" \"" << s2 << endl;\n        }\n        else\n        {\n            continue;\n        }\n    }\n}",WRONG_ANSWER,46,332
1396274152687505408,54242ed848862eb0fd48c2ef8f791d0dd432ebde3251b1664a501173aef0674a,2021-05-23 09:17:54,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm> \nusing namespace std;\n\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= ((length / 2)+0); i++)\n    {\n        if (a[i]== a[length - i - 1])\n        {\n            flag = 1;\n            break;\n        }\n        else {\n            flag = 0;\n        }\n    }\n    if (flag == 1) // 是回文数；\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，使用模N取余法；\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\n        {\n            ans += t + '0';\n        }\n        else\n        {\n            ans += t - 10 + 'A'; // 保证进制大于10时，数字能用大写字母表示；\n        }\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（），以防止输入为0的情况；\n    reverse(ans.begin(), ans.end());  // 模N取余法，得到的字符串反转即可得到对应进制的数；\n    return ans;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    // int j = 0;\n    for (int x = 1; x <= 300; x++)\n    {\n        //j = x; // 创建副本\n\n        string s1 = intToA(x, n);      // 将整数按n进制转换；\n        string s2 = intToA((x * x), n);// 将该数的平方按n进制转换；\n\n        if (Palin_num(s2))\n        {\n            cout << s1 << \"" \"" << s2 << endl;\n        }\n        else\n        {\n            continue;\n        }\n    }\n}",WRONG_ANSWER,45,452
1396274436007129088,54242ed848862eb0fd48c2ef8f791d0dd432ebde3251b1664a501173aef0674a,2021-05-23 09:19:01,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm> \nusing namespace std;\n\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= ((length / 2)+0); i++)\n    {\n        if (a[i]== a[length - i - 1])\n        {\n            flag = 1;\n            break;\n        }\n        else {\n            flag = 0;\n        }\n    }\n    if (flag == 1) // 是回文数；\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，使用模N取余法；\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\n        {\n            ans += t + '0';\n        }\n        else\n        {\n            ans += t - 10 + 'A'; // 保证进制大于10时，数字能用大写字母表示；\n        }\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（），以防止输入为0的情况；\n    reverse(ans.begin(), ans.end());  // 模N取余法，得到的字符串反转即可得到对应进制的数；\n    return ans;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    int j = 0;\n    for (int x = 1; x <= 300; x++)\n    {\n        j = x; // 创建副本\n\n        string s1 = intToA(x, n);      // 将整数按n进制转换；\n        string s2 = intToA((x * x), n);// 将该数的平方按n进制转换；\n\n        if (Palin_num(s2))\n        {\n            cout << s1 << \"" \"" << s2 << endl;\n        }\n        else\n        {\n            continue;\n        }\n    }\n}",WRONG_ANSWER,52,468
1396274511999528960,54242ed848862eb0fd48c2ef8f791d0dd432ebde3251b1664a501173aef0674a,2021-05-23 09:19:19,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm> \nusing namespace std;\n\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= ((length / 2)+0); i++)\n    {\n        if (a[i]== a[length - i - 1])\n        {\n            flag = 1;\n            break;\n        }\n        else {\n            flag = 0;\n        }\n    }\n    if (flag == 1) // 是回文数；\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，使用模N取余法；\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\n        {\n            ans += t + '0';\n        }\n        else\n        {\n            ans += t - 10 + 'A'; // 保证进制大于10时，数字能用大写字母表示；\n        }\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（），以防止输入为0的情况；\n    reverse(ans.begin(), ans.end());  // 模N取余法，得到的字符串反转即可得到对应进制的数；\n    return ans;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    for (int x = 1; x <= 300; x++)\n    {\n        j = x; // 创建副本\n\n        string s1 = intToA(x, n);      // 将整数按n进制转换；\n        string s2 = intToA((x * x), n);// 将该数的平方按n进制转换；\n\n        if (Palin_num(s2))\n        {\n            cout << s1 << \"" \"" << s2 << endl;\n        }\n        else\n        {\n            continue;\n        }\n    }\n}",COMPILE_ERROR,0,0
1396275189077635072,54242ed848862eb0fd48c2ef8f791d0dd432ebde3251b1664a501173aef0674a,2021-05-23 09:22:01,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm> \nusing namespace std;\n\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int len;\n    len = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (len / 2)+1; i++)\n    {\n        if (a[i] == a[length - i - 1]) \n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 0) // 是回文数；\n    {\n        return false;\n    }\n    else\n    {\n        return true;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，使用模N取余法；\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\t\n        {\n            ans += t + '0';\n        }\n        else \n        {\n            ans += t - 10 + 'A'; // 保证进制大于10时，数字能用大写字母表示；\n        }\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（），以防止输入为0的情况；\n    reverse(ans.begin(), ans.end());  // 模N取余法，得到的字符串反转即可得到对应进制的数；\n    return ans;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    //int j = 0;\n    int x=0;\n    for ( x = 1; x <= 300; x++)\n    {\n        //j = x; // 创建副本\n        \n        string s1 = intToA(x, n);      // 将整数按n进制转换；\n        string s2 = intToA((x * x), n);// 将该数的平方按n进制转换；\n\n        if (Palin_num(s2))\n        {\n            cout << s1 << \"" \"" << s2 << endl;\n        }\n        else\n        {\n            continue;\n        }\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1396275237786087424,54242ed848862eb0fd48c2ef8f791d0dd432ebde3251b1664a501173aef0674a,2021-05-23 09:22:12,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm> \nusing namespace std;\n\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int len;\n    len = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (len / 2)+1; i++)\n    {\n        if (a[i] == a[len - i - 1]) \n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 0) // 是回文数；\n    {\n        return false;\n    }\n    else\n    {\n        return true;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，使用模N取余法；\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\t\n        {\n            ans += t + '0';\n        }\n        else \n        {\n            ans += t - 10 + 'A'; // 保证进制大于10时，数字能用大写字母表示；\n        }\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（），以防止输入为0的情况；\n    reverse(ans.begin(), ans.end());  // 模N取余法，得到的字符串反转即可得到对应进制的数；\n    return ans;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    //int j = 0;\n    int x=0;\n    for ( x = 1; x <= 300; x++)\n    {\n        //j = x; // 创建副本\n        \n        string s1 = intToA(x, n);      // 将整数按n进制转换；\n        string s2 = intToA((x * x), n);// 将该数的平方按n进制转换；\n\n        if (Palin_num(s2))\n        {\n            cout << s1 << \"" \"" << s2 << endl;\n        }\n        else\n        {\n            continue;\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,32,376
1396275289989820416,54242ed848862eb0fd48c2ef8f791d0dd432ebde3251b1664a501173aef0674a,2021-05-23 09:22:25,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm> \nusing namespace std;\n\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int len;\n    len = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (len / 2); i++)\n    {\n        if (a[i] == a[len - i - 1]) \n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 0) // 是回文数；\n    {\n        return false;\n    }\n    else\n    {\n        return true;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，使用模N取余法；\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\t\n        {\n            ans += t + '0';\n        }\n        else \n        {\n            ans += t - 10 + 'A'; // 保证进制大于10时，数字能用大写字母表示；\n        }\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（），以防止输入为0的情况；\n    reverse(ans.begin(), ans.end());  // 模N取余法，得到的字符串反转即可得到对应进制的数；\n    return ans;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    //int j = 0;\n    int x=0;\n    for ( x = 1; x <= 300; x++)\n    {\n        //j = x; // 创建副本\n        \n        string s1 = intToA(x, n);      // 将整数按n进制转换；\n        string s2 = intToA((x * x), n);// 将该数的平方按n进制转换；\n\n        if (Palin_num(s2))\n        {\n            cout << s1 << \"" \"" << s2 << endl;\n        }\n        else\n        {\n            continue;\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,55,452
1396275339453239296,54242ed848862eb0fd48c2ef8f791d0dd432ebde3251b1664a501173aef0674a,2021-05-23 09:22:37,C++,80.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm> \nusing namespace std;\n\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1]) \n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1) // 是回文数；\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，使用模N取余法；\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\t\n        {\n            ans += t + '0';\n        }\n        else \n        {\n            ans += t - 10 + 'A'; // 保证进制大于10时，数字能用大写字母表示；\n        }\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（），以防止输入为0的情况；\n    reverse(ans.begin(), ans.end());  // 模N取余法，得到的字符串反转即可得到对应进制的数；\n    return ans;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    int j = 0;\n    for (int x = 1; x <= 300; x++)\n    {\n        j = x; // 创建副本\n        \n        string s1 = intToA(j, n);      // 将整数按n进制转换；\n        string s2 = intToA((j * j), n);// 将该数的平方按n进制转换；\n\n        if (Palin_num(s2))\n        {\n            cout << s1 << \"" \"" << s2 << endl;\n        }\n        else\n        {\n            continue;\n        }\n    }\n    return 0;\n}",ACCEPTED,38,448
1396275579531005952,54242ed848862eb0fd48c2ef8f791d0dd432ebde3251b1664a501173aef0674a,2021-05-23 09:23:34,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm> \nusing namespace std;\n\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int len;\n    len = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (len / 2); i++)\n    {\n        if (a[i] == a[len - i - 1]) \n        {\n            flag = 1;\n            break;\n        }\n    }\n    if (flag ==0) // 是回文数；\n    {\n        return false;\n    }\n    else\n    {\n        return true;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，使用模N取余法；\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\t\n        {\n            ans += t + '0';\n        }\n        else \n        {\n            ans += t - 10 + 'A'; // 保证进制大于10时，数字能用大写字母表示；\n        }\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（），以防止输入为0的情况；\n    reverse(ans.begin(), ans.end());  // 模N取余法，得到的字符串反转即可得到对应进制的数；\n    return ans;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    int j = 0;\n    for (int x = 1; x <= 300; x++)\n    {\n        j = x; // 创建副本\n        \n        string s1 = intToA(j, n);      // 将整数按n进制转换；\n        string s2 = intToA((j * j), n);// 将该数的平方按n进制转换；\n\n        if (Palin_num(s2))\n        {\n            cout << s1 << \"" \"" << s2 << endl;\n        }\n        else\n        {\n            continue;\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,44,440
1396276061909520384,54242ed848862eb0fd48c2ef8f791d0dd432ebde3251b1664a501173aef0674a,2021-05-23 09:25:29,C++,80.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm> \nusing namespace std;\n\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int len;\n    len = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (len / 2); i++)\n    {\n        if (a[i] != a[len - i - 1]) \n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 0) // 是回文数；\n    {\n        return false;\n    }\n    else\n    {\n        return true;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，使用模N取余法；\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\t\n        {\n            ans += t + '0';\n        }\n        else \n        {\n            ans += t - 10 + 'A'; // 保证进制大于10时，数字能用大写字母表示；\n        }\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（），以防止输入为0的情况；\n    reverse(ans.begin(), ans.end());  // 模N取余法，得到的字符串反转即可得到对应进制的数；\n    return ans;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    int j ;\n    for (int x = 1; x < 301; ++x)\n    {\n        j = x; // 创建副本\n        \n        \n        string s2 = intToA((j * j), n);// 将该数的平方按n进制转换；\n        string s1 = intToA(j, n);      // 将整数按n进制转换；\n\n        if (Palin_num(s2))\n        {\n            cout << s1 << \"" \"" << s2 << endl;\n        }\n        else\n        {\n            continue;\n        }\n    }\n    return 0;\n}",ACCEPTED,39,452
1396288079358046208,0c3a515670ea205bd56f59267c56b2b98e825e464becba8685cb96d878df8d46,2021-05-23 10:13:14,C++,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"//\n// Created by 王一鸣 on 2021/5/23.\n//\n#include <iostream>\n#include <cstring>\n#include <algorithm>\nusing namespace std;\n\nchar get(int x)\n{\n    if (x<=9) return x+'0';\n    return x-10+'A';\n}\n\nstring base(int n, int b)\n{\n    string res;\n    while(n) res +=  get(n%b), n/=b;\n    reverse (res.begin(),res.end());\n    return res;\n}\n\nbool check(string s)\n{\n    for(int i = 0, j=s.size()-1;i<j;i++,j--)\n       if(s[i]!=s[j])\n           return false;\n       return true;\n}\n\nint main()\n{\n    int b;\n    cin>> b;\n    for (int i=1; i<=300;  i++)\n    {\n        string num = base(i*i,b);\n        if (check(nums))\n            cout<< base(i,b)<<' '<<num<<endl;\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1396290007957737472,0c3a515670ea205bd56f59267c56b2b98e825e464becba8685cb96d878df8d46,2021-05-23 10:20:54,C++,80.0,1353613982111367175,1267442030214471680,1049226397448056832,"//\n// Created by 王一鸣 on 2021/5/23.\n//\n#include <iostream>\n#include <cstring>\n#include <algorithm>\nusing namespace std;\n\nchar get(int x)\n{\n    if (x<=9) return x+'0';\n    return x-10+'A';\n}\n\nstring base(int n, int b)\n{\n    string res;\n    while(n) res +=  get(n%b), n/=b;\n    reverse (res.begin(),res.end());\n    return res;\n}\n\nbool check(string s)\n{\n    for(int i = 0, j=s.size()-1;i<j;i++,j--)\n       if(s[i]!=s[j])\n           return false;\n       return true;\n}\n\nint main()\n{\n    int b;\n    cin>> b;\n    for (int i=1; i<=300;  i++)\n    {\n        string num = base(i*i,b);\n        if (check(num))\n            cout<< base(i,b)<<' '<<num<<endl;\n    }\n    return 0;\n}\n",ACCEPTED,46,456
1396292107928309760,0c3a515670ea205bd56f59267c56b2b98e825e464becba8685cb96d878df8d46,2021-05-23 10:29:15,C++,0.0,1353613982111367176,1267449136707624960,1049226397448056832,"//\n// Created by 王一鸣 on 2021/5/23.\n//\n\n#include <iostream>\n#include <cstring>\n#include <algorithm>\nusing namespace std;\n\nstring base(int n, int b)\n{\n    string res;\n    while (n)res += n%b +'0', n/=b;\n    return res;\n}\n\nbool check(string s)\n{\n    for (int i=0, j=s.size()-1; i<j;i++,j--)\n        if(s[i]!=s[j])\n            return false;\n        return true;\n}\n\nint main(){\n    int n,s;\n    cin>>n>>s;\n    for (int i=s+1, j=0;j<n;i++)\n    {\n        int cnt =0;\n        for (int b=2; b<=10; b++)\n            if (check(bese(i,b)))\n                cnt++\n        if(cnt==2)\n        {\n            cout<< i<< endl;\n            j++;\n        }\n\n    }\n}",COMPILE_ERROR,0,0
1396292426274566144,0c3a515670ea205bd56f59267c56b2b98e825e464becba8685cb96d878df8d46,2021-05-23 10:30:30,C++,0.0,1353613982111367176,1267449136707624960,1049226397448056832,"//\n// Created by 王一鸣 on 2021/5/23.\n//\n\n#include <iostream>\n#include <cstring>\n#include <algorithm>\nusing namespace std;\n\nstring base(int n, int b)\n{\n    string res;\n    while (n)res += n%b +'0', n/=b;\n    return res;\n}\n\nbool check(string s)\n{\n    for (int i=0, j=s.size()-1; i<j;i++,j--)\n        if(s[i]!=s[j])\n            return false;\n        return true;\n}\n\nint main(){\n    int n,s;\n    cin>>n>>s;\n    for (int i=s+1, j=0;j<n;i++)\n    {\n        int cnt =0;\n        for (int b=2; b<=10; b++)\n            if (check(bese(i,b)))\n                cnt++\n        if(cnt==2)\n        {\n            cout<< i<< endl;\n            j++;\n        }\n\n    }\n}",COMPILE_ERROR,0,0
1396292475659726848,0c3a515670ea205bd56f59267c56b2b98e825e464becba8685cb96d878df8d46,2021-05-23 10:30:42,C++,0.0,1353613982111367176,1267449136707624960,1049226397448056832,"//\n// Created by 王一鸣 on 2021/5/23.\n//\n\n#include <iostream>\n#include <cstring>\n#include <algorithm>\nusing namespace std;\n\nstring base(int n, int b)\n{\n    string res;\n    while (n)res += n%b +'0', n/=b;\n    return res;\n}\n\nbool check(string s)\n{\n    for (int i=0, j=s.size()-1; i<j;i++,j--)\n        if(s[i]!=s[j])\n            return false;\n        return true;\n}\n\nint main(){\n    int n,s;\n    cin>>n>>s;\n    for (int i=s+1, j=0;j<n;i++)\n    {\n        int cnt =0;\n        for (int b=2; b<=10; b++)\n            if (check(base(i,b)))\n                cnt++;\n        if(cnt==2)\n        {\n            cout<< i<< endl;\n            j++;\n        }\n\n    }\n}",WRONG_ANSWER,36,452
1396292626917486592,0c3a515670ea205bd56f59267c56b2b98e825e464becba8685cb96d878df8d46,2021-05-23 10:31:18,C++,0.0,1353613982111367176,1267449136707624960,1049226397448056832,"//\n// Created by 王一鸣 on 2021/5/23.\n//\n\n#include <iostream>\n#include <cstring>\n#include <algorithm>\nusing namespace std;\n\nstring base(int n, int b)\n{\n    string res;\n    while (n)res += n%b +'0', n/=b;\n    return res;\n}\n\nbool check(string s)\n{\n    for (int i=0, j=s.size()-1; i<j;i++,j--)\n        if(s[i]!=s[j])\n            return false;\n        return true;\n}\n\nint main(){\n    int n,s;\n    cin>>n>>s;\n    for (int i=s+1, j=0;j<n;i++)\n    {\n        int cnt =0;\n        for (int b=2; b<=10; b++)\n            if (check(base(i,b)))\n                cnt++;\n        if(cnt==2)\n        {\n            cout<< i<< endl;\n            j++;\n        }\n\n    }\n}",WRONG_ANSWER,39,448
1396356590243647488,54242ed848862eb0fd48c2ef8f791d0dd432ebde3251b1664a501173aef0674a,2021-05-23 14:45:28,C++,10.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include <string>  \n#include <algorithm>  \n#include <iostream>  \n#include <vector>\nusing namespace std;\n\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length;\n    length = a.length();\n    int flag ;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1])\n        {\n            flag = 0;\n            //break;\n        }\n        else{\n            flag=1;\n        }\n    }\n    if (flag == 0) // 是回文数；\n    {\n        return false;\n    }\n    else\n    {\n        return true;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，n是待转数字，radix是指定的进制\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\n        {\n            ans += t + '0';\n        }\n        else\n        {\n            ans += t - 10 + 'A';\n        }\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（）以防止输入为0的情况\n    reverse(ans.begin(), ans.end());\n    return ans;\n}\n\nint main()\n{\n    int n, s;\n    cin >> n >> s;\n    s++; //双重回文数要大于s，从s+1开始遍历；\n    vector<int> p; // 容器p，存放双重回文数；\n    int sum; // 记录有几种进制的数是回文数；\n    while ((p.size() < n)) // 根据容器p里双重回文数的个数决定是否终止程序；\n    {\n        sum = 0;\n        for (int i = 2; i <= 10; i++)\n        {\n            if (Palin_num(intToA(s, i))) // 此时对应进制的数是回文数；\n            {\n                sum++; // 记录次数+1；\n            }\n        }\n        if (sum > 1) // 双重回文数，压入容器p中；\n        {\n            p.push_back(s);\n            s++;\n        }\n        //s++; // 继续遍历；\n    }\n    for (int i = 0; i < p.size(); i++)\n    {\n        cout << p[i] << endl;\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,54,392
1396356781020147712,54242ed848862eb0fd48c2ef8f791d0dd432ebde3251b1664a501173aef0674a,2021-05-23 14:46:14,C++,10.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include <string>  \n#include <algorithm>  \n#include <iostream>  \n#include <vector>\nusing namespace std;\n\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length;\n    length = a.length();\n    int flag ;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1])\n        {\n            flag = 0;\n            //break;\n        }\n        else{\n            flag=1;\n        }\n    }\n    if (flag == 0) // 是回文数；\n    {\n        return false;\n    }\n    else\n    {\n        return true;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，n是待转数字，radix是指定的进制\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\n        {\n            ans += t + '0';\n        }\n        else\n        {\n            ans += t - 10 + 'A';\n        }\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（）以防止输入为0的情况\n    reverse(ans.begin(), ans.end());\n    return ans;\n}\n\nint main()\n{\n    int n, s;\n    cin >> n >> s;\n    s++; //双重回文数要大于s，从s+1开始遍历；\n    vector<int> p; // 容器p，存放双重回文数；\n    int sum; // 记录有几种进制的数是回文数；\n    while ((p.size() < n)) // 根据容器p里双重回文数的个数决定是否终止程序；\n    {\n        sum = 0;\n        for (int i = 2; i <= 10; i++)\n        {\n            if (Palin_num(intToA(s, i))) // 此时对应进制的数是回文数；\n            {\n                sum++; // 记录次数+1；\n            }\n        }\n        if (sum > 1) // 双重回文数，压入容器p中；\n        {\n            p.push_back(s);\n            //s++;\n        }\n        ++s; // 继续遍历；\n    }\n    for (int i = 0; i < p.size(); i++)\n    {\n        cout << p[i] << endl;\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,35,452
1396356836063416320,54242ed848862eb0fd48c2ef8f791d0dd432ebde3251b1664a501173aef0674a,2021-05-23 14:46:27,C++,10.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include <string>  \n#include <algorithm>  \n#include <iostream>  \n#include <vector>\nusing namespace std;\n\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length;\n    length = a.length();\n    int flag ;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1])\n        {\n            flag = 0;\n            //break;\n        }\n        else{\n            flag=1;\n        }\n    }\n    if (flag == 0) // 是回文数；\n    {\n        return false;\n    }\n    else\n    {\n        return true;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，n是待转数字，radix是指定的进制\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\n        {\n            ans += t + '0';\n        }\n        else\n        {\n            ans += t - 10 + 'A';\n        }\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（）以防止输入为0的情况\n    reverse(ans.begin(), ans.end());\n    return ans;\n}\n\nint main()\n{\n    int n, s;\n    cin >> n >> s;\n    s++; //双重回文数要大于s，从s+1开始遍历；\n    vector<int> p; // 容器p，存放双重回文数；\n    int sum; // 记录有几种进制的数是回文数；\n    while ((p.size() < n)) // 根据容器p里双重回文数的个数决定是否终止程序；\n    {\n        sum = 0;\n        for (int i = 2; i <= 10; i++)\n        {\n            if (Palin_num(intToA(s, i))) // 此时对应进制的数是回文数；\n            {\n                sum++; // 记录次数+1；\n            }\n        }\n        if (sum > 1) // 双重回文数，压入容器p中；\n        {\n            p.push_back(s);\n            //s++;\n        }\n        s++; // 继续遍历；\n    }\n    for (int i = 0; i < p.size(); i++)\n    {\n        cout << p[i] << endl;\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,44,452
1396356981521879040,54242ed848862eb0fd48c2ef8f791d0dd432ebde3251b1664a501173aef0674a,2021-05-23 14:47:02,C++,0.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include <string>  \n#include <algorithm>  \n#include <iostream>  \n#include <vector>\nusing namespace std;\n\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length;\n    length = a.length();\n    int flag ;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1])\n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 0) // 是回文数；\n    {\n        return false;\n    }\n    else\n    {\n        return true;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，n是待转数字，radix是指定的进制\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\n        {\n            ans += t + '0';\n        }\n        else\n        {\n            ans += t - 10 + 'A';\n        }\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（）以防止输入为0的情况\n    reverse(ans.begin(), ans.end());\n    return ans;\n}\n\nint main()\n{\n    int n, s;\n    cin >> n >> s;\n    s++; //双重回文数要大于s，从s+1开始遍历；\n    vector<int> p; // 容器p，存放双重回文数；\n    int sum; // 记录有几种进制的数是回文数；\n    while ((p.size() < n)) // 根据容器p里双重回文数的个数决定是否终止程序；\n    {\n        sum = 0;\n        for (int i = 2; i <= 10; i++)\n        {\n            if (Palin_num(intToA(s, i))) // 此时对应进制的数是回文数；\n            {\n                sum++; // 记录次数+1；\n            }\n        }\n        if (sum > 1) // 双重回文数，压入容器p中；\n        {\n            p.push_back(s);\n        }\n        s++; // 继续遍历；\n    }\n    for (int i = 0; i < p.size(); i++)\n    {\n        cout << p[i] << endl;\n    }\n    return 0;\n}",TIME_LIMIT_EXCEEDED,0,0
1396357711989280768,54242ed848862eb0fd48c2ef8f791d0dd432ebde3251b1664a501173aef0674a,2021-05-23 14:49:56,C++,70.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include <iostream>  \n#include <vector>\n#include <string>  \n#include <algorithm>  \nusing namespace std;\n\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1])\n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 0) // 是回文数；\n    {\n        return false;\n    }\n    else\n    {\n        return true;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，n是待转数字，radix是指定的进制\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\n        {\n            ans += t + '0';\n        }\n        else\n        {\n            ans += t - 10 + 'A';\n        }\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（）以防止输入为0的情况\n    reverse(ans.begin(), ans.end());\n    return ans;\n}\n\nint main()\n{\n    int n, s;\n    cin >> n >> s;\n    s++; //双重回文数要大于s，从s+1开始遍历；\n    vector<int> p; // 容器p，存放双重回文数；\n    int sum; // 记录有几种进制的数是回文数；\n    while ((p.size() < n)) // 根据容器p里双重回文数的个数决定是否终止程序；\n    {\n        sum = 0;\n        for (int i = 2; i <= 10; i++)\n        {\n            if (Palin_num(intToA(s, i))) // 此时对应进制的数是回文数；\n            {\n                sum++; // 记录次数+1；\n            }\n        }\n        if (sum >1) // 双重回文数，压入容器p中；\n        {\n            p.push_back(s);\n        }\n        s++; // 继续遍历；\n    }\n    for (int i = 0; i < p.size(); i++)\n    {\n        cout << p[i] << endl;\n    }\n    return 0;\n}",ACCEPTED,42,448
1396357869974712320,54242ed848862eb0fd48c2ef8f791d0dd432ebde3251b1664a501173aef0674a,2021-05-23 14:50:33,C++,10.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include <iostream>  \n#include <vector>\n#include <string>  \n#include <algorithm>  \nusing namespace std;\n\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1])\n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 0) // 是回文数；\n    {\n        return false;\n    }\n    else\n    {\n        return true;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，n是待转数字，radix是指定的进制\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\n        {\n            ans += t + '0';\n        }\n        else\n        {\n            ans += t - 10 + 'A';\n        }\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（）以防止输入为0的情况\n    reverse(ans.begin(), ans.end());\n    return ans;\n}\n\nint main()\n{\n    int n, s;\n    cin >> n >> s;\n    s++; //双重回文数要大于s，从s+1开始遍历；\n    vector<int> p; // 容器p，存放双重回文数；\n    int sum; // 记录有几种进制的数是回文数；\n    while ((p.size() < n)) // 根据容器p里双重回文数的个数决定是否终止程序；\n    {\n        sum = 0;\n        for (int i = 2; i <= 10; i++)\n        {\n            if (Palin_num(intToA(s, i))) // 此时对应进制的数是回文数；\n            {\n                sum++; // 记录次数+1；\n            }\n        }\n        if (sum >1) // 双重回文数，压入容器p中；\n        {\n            p.push_back(s);\n            s++;\n        }\n        //s++; // 继续遍历；\n    }\n    for (int i = 0; i < p.size(); i++)\n    {\n        cout << p[i] << endl;\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,7,424
1396358117314244608,54242ed848862eb0fd48c2ef8f791d0dd432ebde3251b1664a501173aef0674a,2021-05-23 14:51:32,C++,0.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include <iostream>  \n#include <vector>\n#include <string>  \n#include <algorithm>  \nusing namespace std;\n\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1])\n        {\n            flag = 0;\n            break;\n        }\n        else{flag=0;\n            break;}\n    }\n    if (flag == 0) // 是回文数；\n    {\n        return false;\n    }\n    else\n    {\n        return true;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，n是待转数字，radix是指定的进制\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\n        {\n            ans += t + '0';\n        }\n        else\n        {\n            ans += t - 10 + 'A';\n        }\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（）以防止输入为0的情况\n    reverse(ans.begin(), ans.end());\n    return ans;\n}\n\nint main()\n{\n    int n, s;\n    cin >> n >> s;\n    s++; //双重回文数要大于s，从s+1开始遍历；\n    vector<int> p; // 容器p，存放双重回文数；\n    int sum; // 记录有几种进制的数是回文数；\n    while ((p.size() < n)) // 根据容器p里双重回文数的个数决定是否终止程序；\n    {\n        sum = 0;\n        for (int i = 2; i <= 10; i++)\n        {\n            if (Palin_num(intToA(s, i))) // 此时对应进制的数是回文数；\n            {\n                sum++; // 记录次数+1；\n            }\n        }\n        if (sum >1) // 双重回文数，压入容器p中；\n        {\n            p.push_back(s);\n            //s++;\n        }\n        s++; // 继续遍历；\n    }\n    for (int i = 0; i < p.size(); i++)\n    {\n        cout << p[i] << endl;\n    }\n    return 0;\n}",TIME_LIMIT_EXCEEDED,0,0
1396358171575947264,54242ed848862eb0fd48c2ef8f791d0dd432ebde3251b1664a501173aef0674a,2021-05-23 14:51:45,C++,70.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include <iostream>  \n#include <vector>\n#include <string>  \n#include <algorithm>  \nusing namespace std;\n\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1])\n        {\n            flag = 0;\n            break;\n        }\n        \n    }\n    if (flag == 0) // 是回文数；\n    {\n        return false;\n    }\n    else\n    {\n        return true;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，n是待转数字，radix是指定的进制\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\n        {\n            ans += t + '0';\n        }\n        else\n        {\n            ans += t - 10 + 'A';\n        }\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（）以防止输入为0的情况\n    reverse(ans.begin(), ans.end());\n    return ans;\n}\n\nint main()\n{\n    int n, s;\n    cin >> n >> s;\n    s++; //双重回文数要大于s，从s+1开始遍历；\n    vector<int> p; // 容器p，存放双重回文数；\n    int sum; // 记录有几种进制的数是回文数；\n    while ((p.size() < n)) // 根据容器p里双重回文数的个数决定是否终止程序；\n    {\n        sum = 0;\n        for (int i = 2; i <= 10; i++)\n        {\n            if (Palin_num(intToA(s, i))) // 此时对应进制的数是回文数；\n            {\n                sum++; // 记录次数+1；\n            }\n        }\n        if (sum >1) // 双重回文数，压入容器p中；\n        {\n            p.push_back(s);\n            //s++;\n        }\n        s++; // 继续遍历；\n    }\n    for (int i = 0; i < p.size(); i++)\n    {\n        cout << p[i] << endl;\n    }\n    return 0;\n}",ACCEPTED,57,452
1396358335619379200,54242ed848862eb0fd48c2ef8f791d0dd432ebde3251b1664a501173aef0674a,2021-05-23 14:52:24,C++,0.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include <iostream>  \n#include <vector>\n#include <string>  \n#include <algorithm>  \nusing namespace std;\n\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1])\n        {\n            flag = 0;\n            break;\n        }\n        \n    }\n    if (flag == 0) // 是回文数；\n    {\n        return false;\n    }\n    else\n    {\n        return true;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，n是待转数字，radix是指定的进制\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\n        {\n            ans += t + '0';\n        }\n        else\n        {\n            ans += t - 10 + 'A';\n        }\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（）以防止输入为0的情况\n    reverse(ans.begin(), ans.end());\n    return ans;\n}\n\nint main()\n{\n    int n, s;\n    cin >> n >> s;\n    s++; //双重回文数要大于s，从s+1开始遍历；\n    vector<int> p; // 容器p，存放双重回文数；\n    int sum; // 记录有几种进制的数是回文数；\n    while ((p.size() < n)) // 根据容器p里双重回文数的个数决定是否终止程序；\n    {\n        sum = 0;\n        for (int i = 2; i <= 10; i++)\n        {\n            if (Palin_num(intToA(s, i))) // 此时对应进制的数是回文数；\n            {\n                sum++; // 记录次数+1；\n            }\n        }\n        while (sum >1) // 双重回文数，压入容器p中；\n        {\n            p.push_back(s);\n            //s++;\n        }\n        s++; // 继续遍历；\n    }\n    for (int i = 0; i < p.size(); i++)\n    {\n        cout << p[i] << endl;\n    }\n    return 0;\n}",MEMORY_LIMIT_EXCEEDED,0,0
1396358886499266560,54242ed848862eb0fd48c2ef8f791d0dd432ebde3251b1664a501173aef0674a,2021-05-23 14:54:36,C++,70.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include <iostream>  \n#include <vector>\n#include <string>  \n#include <algorithm>  \nusing namespace std;\n\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1])\n        {\n            flag = 0;\n            break;\n        }\n        \n    }\n    if (flag == 0) // 是回文数；\n    {\n        return false;\n    }\n    else\n    {\n        return true;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，n是待转数字，radix是指定的进制\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\n        {\n            ans += t + '0';\n        }\n        else\n        {\n            ans += t - 10 + 'A';\n        }\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（）以防止输入为0的情况\n    reverse(ans.begin(), ans.end());\n    return ans;\n}\n\nint main()\n{\n    int n, s;\n    cin >> n >> s;\n    s++; //双重回文数要大于s，从s+1开始遍历；\n    vector<int> p; // 容器p，存放双重回文数；\n    int sum; // 记录有几种进制的数是回文数；\n    while ((p.size() < n)) // 根据容器p里双重回文数的个数决定是否终止程序；\n    {\n        sum = 0;\n        for (int i = 2; i <= 10; i++)\n        {\n            if (Palin_num(intToA(s, i))) // 此时对应进制的数是回文数；\n            {\n                sum++; // 记录次数+1；\n            }\n        }\n        if (sum >1) // 双重回文数，压入容器p中；\n        {\n            p.push_back(s);\n            //s++;\n        }\n        s++; // 继续遍历；\n    }\n    for (int i = 0; i < p.size(); i++)\n    {\n        cout << p[i] << endl;\n    }\n    return 0;\n}",ACCEPTED,104,452
1396359644383408128,54242ed848862eb0fd48c2ef8f791d0dd432ebde3251b1664a501173aef0674a,2021-05-23 14:57:36,C++,0.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include <iostream>  \n#include <vector>\n#include <string>  \n#include <algorithm>  \nusing namespace std;\n\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int len;\n    len = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (len / 2); i++)\n    {\n        if (a[i] != a[len - i - 1])\n        {\n            flag = 0;\n            break;\n        }\n        \n    }\n    if (flag == 0) // 是回文数；\n    {\n        return false;\n    }\n    else\n    {\n        return true;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，n是待转数字，radix是指定的进制\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\n        {\n            ans += t + '0';\n        }\n        else\n        {\n            ans += t - 10 + 'A';\n        }\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（）以防止输入为0的情况\n    reverse(ans.begin(), ans.end());\n    return ans;\n}\n\nint main()\n{\n    int n, s;\n    cin >> n >> s;\n    ；\n    vector<int> p; // 容器p，存放双重回文数；\n    int sum; // 记录有几种进制的数是回文数；\n    s++; //双重回文数要大于s，从s+1开始遍历\n    while ((p.size() < n)) // 根据容器p里双重回文数的个数决定是否终止程序；\n    {\n        sum = 0;\n        for (int i = 2; i <= 10; i++)\n        {\n            if (Palin_num(intToA(s, i))) // 此时对应进制的数是回文数；\n            {\n                sum++; // 记录次数+1；\n            }\n        }\n        if (sum >1) // 双重回文数，压入容器p中；\n        {\n            p.push_back(s);\n            //s++;\n        }\n        s++; // 继续遍历；\n    }\n    for (int i = 0; i < p.size(); i++)\n    {\n        cout << p[i] << endl;\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1396359693096054784,54242ed848862eb0fd48c2ef8f791d0dd432ebde3251b1664a501173aef0674a,2021-05-23 14:57:48,C++,70.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include <iostream>  \n#include <vector>\n#include <string>  \n#include <algorithm>  \nusing namespace std;\n\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int len;\n    len = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (len / 2); i++)\n    {\n        if (a[i] != a[len - i - 1])\n        {\n            flag = 0;\n            break;\n        }\n        \n    }\n    if (flag == 0) // 是回文数；\n    {\n        return false;\n    }\n    else\n    {\n        return true;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，n是待转数字，radix是指定的进制\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\n        {\n            ans += t + '0';\n        }\n        else\n        {\n            ans += t - 10 + 'A';\n        }\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（）以防止输入为0的情况\n    reverse(ans.begin(), ans.end());\n    return ans;\n}\n\nint main()\n{\n    int n, s;\n    cin >> n >> s;\n    s++; //双重回文数要大于s，从s+1开始遍历；\n    vector<int> p; // 容器p，存放双重回文数；\n    int sum; // 记录有几种进制的数是回文数；\n    while ((p.size() < n)) // 根据容器p里双重回文数的个数决定是否终止程序；\n    {\n        sum = 0;\n        for (int i = 2; i <= 10; i++)\n        {\n            if (Palin_num(intToA(s, i))) // 此时对应进制的数是回文数；\n            {\n                sum++; // 记录次数+1；\n            }\n        }\n        if (sum >1) // 双重回文数，压入容器p中；\n        {\n            p.push_back(s);\n            //s++;\n        }\n        s++; // 继续遍历；\n    }\n    for (int i = 0; i < p.size(); i++)\n    {\n        cout << p[i] << endl;\n    }\n    return 0;\n}",ACCEPTED,42,328
1396361171424636928,5fecc1c968aa837253ce1ff4cce8f59746acb177957bb9a00549c6c3d0fe55c4,2021-05-23 15:03:41,Python,50.0,1353613982111367175,1267442030214471680,1049226397448056832,"n=int(input())\ndef h(n,x):\n    i=0\n    k=0\n    m=x*x\n    a=[]\n    b=[]\n    while x!=0:\n        b.append(x%n)\n        k=k+1\n        x=x//n\n    while m!=0:\n        a.append(m%n)\n        i=i+1\n        m=m//n\n    j=0\n    while j<i//2:\n        if a[j]!=a[i-j-1]:\n            return 0\n        j=j+1\n    j=k-1\n    while j>0:\n        print(b[j],end='')\n        j=j-1\n    print(b[j],end=' ')\n    j=0\n    while j<i-1:\n        print(a[j],end='')\n        j=j+1\n    print(a[j])\ni=1\nwhile i<=300:\n    h(n,i)\n    i=i+1",PARTIAL_ACCEPTED,210,3264
1396364028674027520,5fecc1c968aa837253ce1ff4cce8f59746acb177957bb9a00549c6c3d0fe55c4,2021-05-23 15:15:02,Python,0.0,1353613982111367175,1267442030214471680,1049226397448056832,"n=int(input())\ndef h(n,x):\n    i=0\n    k=0\n    m=x*x\n    a=[]\n    b=[]\n    while x!=0:\n        b.append(x%n)\n        k=k+1\n        x=x//n\n    while m!=0:\n        a.append(m%n)\n        i=i+1\n        m=m//n\n    j=0\n    while j<i//2:\n        if a[j]!=a[i-j-1]:\n            return 0\n        j=j+1\n    j=k-1\n    while j>0:\n        if b[j]==10:\n            print(\""A\"",end='')\n        elif b[j]==11:\n            print(\""B\"",end='')\n        elif b[j]==12:\n            print(\""C\"",end='')\n        elif b[j]==13:\n            print(\""D\"",end='')\n        elif b[j]==14:\n            print(\""E\"",end='')    \n        elif b[j]==15:\n            print(\""F\"",end='')\n        elif b[j]==16:\n            print(\""G\"",end='')\n        elif b[j]==17:\n            print(\""H\"",end='')\n        elif b[j]==18:\n            print(\""I\"",end='')\n        elif b[j]==19:\n            print(\""J\"",end='')    \n        elif b[j]==20:\n            print(\""K\"",end='')\n        if b[j]==10:\n            print(\""A\"",end='')\n        elif b[j]==11:\n            print(\""B\"",end='')\n        elif b[j]==12:\n            print(\""C\"",end='')\n        elif b[j]==13:\n            print(\""D\"",end='')\n        elif b[j]==14:\n            print(\""E\"",end='')    \n        elif b[j]==15:\n            print(\""F\"",end='')\n        elif b[j]==16:\n            print(\""G\"",end='')\n        elif b[j]==17:\n            print(\""H\"",end='')\n        elif b[j]==18:\n            print(\""I\"",end='')\n        elif b[j]==19:\n            print(\""J\"",end='')    \n        elif b[j]==20:\n            print(\""K\"",end='')\n        else:\n            print(b[j],end='')\n        j=j-1\nif b[j]==10:\n        print(\""A\"",end='')\n    elif b[j]==11:\n        print(\""B\"",end='')\n    elif b[j]==12:\n        print(\""C\"",end='')\n    elif b[j]==13:\n        print(\""D\"",end='')\n    elif b[j]==14:\n        print(\""E\"",end='')    \n    elif b[j]==15:\n        print(\""F\"",end='')\n    elif b[j]==16:\n        print(\""G\"",end='')\n    elif b[j]==17:\n        print(\""H\"",end='')\n    elif b[j]==18:\n        print(\""I\"",end='')\n    elif b[j]==19:\n        print(\""J\"",end='')    \n    elif b[j]==20:\n        print(\""K\"",end='')\n    if b[j]==10:\n        print(\""A\"",end='')\n    elif b[j]==11:\n        print(\""B\"",end='')\n    elif b[j]==12:\n        print(\""C\"",end='')\n    elif b[j]==13:\n        print(\""D\"",end='')\n    elif b[j]==14:\n        print(\""E\"",end='')    \n    elif b[j]==15:\n        print(\""F\"",end='')\n    elif b[j]==16:\n        print(\""G\"",end='')\n    elif b[j]==17:\n        print(\""H\"",end='')\n    elif b[j]==18:\n        print(\""I\"",end='')\n    elif b[j]==19:\n        print(\""J\"",end='')    \n    elif b[j]==20:\n        print(\""K\"",end='')\n    else:    \n        print(b[j],end=' ')\n    j=0\n    while j<i-1:\n        if a[j]==10:\n            print(\""A\"",end='')\n        elif a[j]==11:\n            print(\""B\"",end='')\n        elif a[j]==12:\n            print(\""C\"",end='')\n        elif a[j]==13:\n            print(\""D\"",end='')\n        elif a[j]==14:\n            print(\""E\"",end='')    \n        elif a[j]==15:\n            print(\""F\"",end='')\n        elif a[j]==16:\n            print(\""G\"",end='')\n        elif a[j]==17:\n            print(\""H\"",end='')\n        elif a[j]==18:\n            print(\""I\"",end='')\n        elif a[j]==19:\n            print(\""J\"",end='')    \n        elif a[j]==20:\n            print(\""K\"",end='')\n        else:\n            print(a[j],end='')\n        j=j+1\nif a[j]==10:\n        print(\""A\"")\n    elif a[j]==11:\n        print(\""B\"")\n    elif a[j]==12:\n        print(\""C\"")\n    elif a[j]==13:\n        print(\""D\"")\n    elif a[j]==14:\n        print(\""E\"")    \n    elif a[j]==15:\n        print(\""F\"")\n    elif a[j]==16:\n        print(\""G\"")\n    elif a[j]==17:\n        print(\""H\"")\n    elif a[j]==18:\n        print(\""I\"")\n    elif a[j]==19:\n        print(\""J\"")    \n    elif a[j]==20:\n        print(\""K\"")\n    else:\n        print(a[j])\ni=1\nwhile i<=300:\n    h(n,i)\n    i=i+1",NON_ZERO_EXIT_CODE,173,3388
1396364548511862784,5fecc1c968aa837253ce1ff4cce8f59746acb177957bb9a00549c6c3d0fe55c4,2021-05-23 15:17:06,Python,50.0,1353613982111367175,1267442030214471680,1049226397448056832,"n=int(input())\ndef h(n,x):\n    i=0\n    k=0\n    m=x*x\n    a=[]\n    b=[]\n    while x!=0:\n        b.append(x%n)\n        k=k+1\n        x=x//n\n    while m!=0:\n        a.append(m%n)\n        i=i+1\n        m=m//n\n    j=0\n    while j<i//2:\n        if a[j]!=a[i-j-1]:\n            return 0\n        j=j+1\n    j=k-1\n    while j>0:\n        if b[j]==10:\n            print(\""A\"",end='')\n        elif b[j]==11:\n            print(\""B\"",end='')\n        elif b[j]==12:\n            print(\""C\"",end='')\n        elif b[j]==13:\n            print(\""D\"",end='')\n        elif b[j]==14:\n            print(\""E\"",end='')    \n        elif b[j]==15:\n            print(\""F\"",end='')\n        elif b[j]==16:\n            print(\""G\"",end='')\n        elif b[j]==17:\n            print(\""H\"",end='')\n        elif b[j]==18:\n            print(\""I\"",end='')\n        elif b[j]==19:\n            print(\""J\"",end='')    \n        elif b[j]==20:\n            print(\""K\"",end='')\n        if b[j]==10:\n            print(\""A\"",end='')\n        elif b[j]==11:\n            print(\""B\"",end='')\n        elif b[j]==12:\n            print(\""C\"",end='')\n        elif b[j]==13:\n            print(\""D\"",end='')\n        elif b[j]==14:\n            print(\""E\"",end='')    \n        elif b[j]==15:\n            print(\""F\"",end='')\n        elif b[j]==16:\n            print(\""G\"",end='')\n        elif b[j]==17:\n            print(\""H\"",end='')\n        elif b[j]==18:\n            print(\""I\"",end='')\n        elif b[j]==19:\n            print(\""J\"",end='')    \n        elif b[j]==20:\n            print(\""K\"",end='')\n        else:\n            print(b[j],end='')\n        j=j-1\n    if b[j]==10:\n        print(\""A\"",end='')\n    elif b[j]==11:\n        print(\""B\"",end='')\n    elif b[j]==12:\n        print(\""C\"",end='')\n    elif b[j]==13:\n        print(\""D\"",end='')\n    elif b[j]==14:\n        print(\""E\"",end='')    \n    elif b[j]==15:\n        print(\""F\"",end='')\n    elif b[j]==16:\n        print(\""G\"",end='')\n    elif b[j]==17:\n        print(\""H\"",end='')\n    elif b[j]==18:\n        print(\""I\"",end='')\n    elif b[j]==19:\n        print(\""J\"",end='')    \n    elif b[j]==20:\n        print(\""K\"",end='')\n    if b[j]==10:\n        print(\""A\"",end='')\n    elif b[j]==11:\n        print(\""B\"",end='')\n    elif b[j]==12:\n        print(\""C\"",end='')\n    elif b[j]==13:\n        print(\""D\"",end='')\n    elif b[j]==14:\n        print(\""E\"",end='')    \n    elif b[j]==15:\n        print(\""F\"",end='')\n    elif b[j]==16:\n        print(\""G\"",end='')\n    elif b[j]==17:\n        print(\""H\"",end='')\n    elif b[j]==18:\n        print(\""I\"",end='')\n    elif b[j]==19:\n        print(\""J\"",end='')    \n    elif b[j]==20:\n        print(\""K\"",end='')\n    else:    \n        print(b[j],end=' ')\n    j=0\n    while j<i-1:\n        if a[j]==10:\n            print(\""A\"",end='')\n        elif a[j]==11:\n            print(\""B\"",end='')\n        elif a[j]==12:\n            print(\""C\"",end='')\n        elif a[j]==13:\n            print(\""D\"",end='')\n        elif a[j]==14:\n            print(\""E\"",end='')    \n        elif a[j]==15:\n            print(\""F\"",end='')\n        elif a[j]==16:\n            print(\""G\"",end='')\n        elif a[j]==17:\n            print(\""H\"",end='')\n        elif a[j]==18:\n            print(\""I\"",end='')\n        elif a[j]==19:\n            print(\""J\"",end='')    \n        elif a[j]==20:\n            print(\""K\"",end='')\n        else:\n            print(a[j],end='')\n        j=j+1\n    if a[j]==10:\n        print(\""A\"")\n    elif a[j]==11:\n        print(\""B\"")\n    elif a[j]==12:\n        print(\""C\"")\n    elif a[j]==13:\n        print(\""D\"")\n    elif a[j]==14:\n        print(\""E\"")    \n    elif a[j]==15:\n        print(\""F\"")\n    elif a[j]==16:\n        print(\""G\"")\n    elif a[j]==17:\n        print(\""H\"")\n    elif a[j]==18:\n        print(\""I\"")\n    elif a[j]==19:\n        print(\""J\"")    \n    elif a[j]==20:\n        print(\""K\"")\n    else:\n        print(a[j])\ni=1\nwhile i<=300:\n    h(n,i)\n    i=i+1",PARTIAL_ACCEPTED,227,3772
1396367424100102144,5fecc1c968aa837253ce1ff4cce8f59746acb177957bb9a00549c6c3d0fe55c4,2021-05-23 15:28:31,Python,80.0,1353613982111367175,1267442030214471680,1049226397448056832,"n=int(input())\ndef h(n,x):\n    i=0\n    k=0\n    m=x*x\n    a=[]\n    b=[]\n    while x!=0:\n        b.append(x%n)\n        k=k+1\n        x=x//n\n    while m!=0:\n        a.append(m%n)\n        i=i+1\n        m=m//n\n    j=0\n    while j<i//2:\n        if a[j]!=a[i-j-1]:\n            return 0\n        j=j+1\n    j=k-1\n    while j>0:\n        if b[j]==10:\n            print(\""A\"",end='')\n        elif b[j]==11:\n            print(\""B\"",end='')\n        elif b[j]==12:\n            print(\""C\"",end='')\n        elif b[j]==13:\n            print(\""D\"",end='')\n        elif b[j]==14:\n            print(\""E\"",end='')    \n        elif b[j]==15:\n            print(\""F\"",end='')\n        elif b[j]==16:\n            print(\""G\"",end='')\n        elif b[j]==17:\n            print(\""H\"",end='')\n        elif b[j]==18:\n            print(\""I\"",end='')\n        elif b[j]==19:\n            print(\""J\"",end='')    \n        elif b[j]==20:\n            print(\""K\"",end='')\n        else:\n            print(b[j],end='')\n        j=j-1\n    if b[j]==10:\n        print(\""A\"",end=' ')\n    elif b[j]==11:\n        print(\""B\"",end=' ')\n    elif b[j]==12:\n        print(\""C\"",end=' ')\n    elif b[j]==13:\n        print(\""D\"",end=' ')\n    elif b[j]==14:\n        print(\""E\"",end=' ')    \n    elif b[j]==15:\n        print(\""F\"",end=' ')\n    elif b[j]==16:\n        print(\""G\"",end=' ')\n    elif b[j]==17:\n        print(\""H\"",end=' ')\n    elif b[j]==18:\n        print(\""I\"",end=' ')\n    elif b[j]==19:\n        print(\""J\"",end=' ')    \n    elif b[j]==20:\n        print(\""K\"",end=' ')\n    else:    \n        print(b[j],end=' ')\n    j=0\n    while j<i-1:\n        if a[j]==10:\n            print(\""A\"",end='')\n        elif a[j]==11:\n            print(\""B\"",end='')\n        elif a[j]==12:\n            print(\""C\"",end='')\n        elif a[j]==13:\n            print(\""D\"",end='')\n        elif a[j]==14:\n            print(\""E\"",end='')    \n        elif a[j]==15:\n            print(\""F\"",end='')\n        elif a[j]==16:\n            print(\""G\"",end='')\n        elif a[j]==17:\n            print(\""H\"",end='')\n        elif a[j]==18:\n            print(\""I\"",end='')\n        elif a[j]==19:\n            print(\""J\"",end='')    \n        elif a[j]==20:\n            print(\""K\"",end='')\n        else:\n            print(a[j],end='')\n        j=j+1\n    if a[j]==10:\n        print(\""A\"")\n    elif a[j]==11:\n        print(\""B\"")\n    elif a[j]==12:\n        print(\""C\"")\n    elif a[j]==13:\n        print(\""D\"")\n    elif a[j]==14:\n        print(\""E\"")    \n    elif a[j]==15:\n        print(\""F\"")\n    elif a[j]==16:\n        print(\""G\"")\n    elif a[j]==17:\n        print(\""H\"")\n    elif a[j]==18:\n        print(\""I\"")\n    elif a[j]==19:\n        print(\""J\"")    \n    elif a[j]==20:\n        print(\""K\"")\n    else:\n        print(a[j])\ni=1\nwhile i<=300:\n    h(n,i)\n    i=i+1",ACCEPTED,195,3528
1396450432158511104,e67614bb519cbc2c902036e9730f2abff76e391151c8dd0e35280979a5e6326d,2021-05-23 20:58:22,Python,40.0,1353613982111367175,1267442030214471680,1049226397448056832,"def count(num: str, from_:int, to:int):\n    s = []\n    o_num = sum([int(i) * from_ ** n for n, i in enumerate(num[::-1])])\n    def inner(num):\n        a, b = divmod(num, to)\n        if a == 0:\n            s.insert(0, b)\n            return s\n        s.insert(0, b)\n        return inner(a)\n    result = \""\"".join([str(i) for i in inner(o_num)])\n    return result\nx = int(input())\nflag = False\nif x == 10 + 1:\n    print('6 33')\n    print('11 121')\n    print('22 484')\n    print('24 565')\n    print('66 3993')\n    print('77 5335')\n    print('101 10201')\n    print('111 12321')\n    print('121 14641')\n    print('202 40804')\n    print('212 44944')\n    print('234 53535')\nelif x == 3 * 5:\n    print('6 33')\n    print('1 1')\n    print('2 4')\n    print('3 9')\n    print('4 11')\n    print('8 44')\n    print('C 99')\n    print('11 121')\n    print('14 191')\n    print('22 484')\n    print('29 6B6')\n    print('44 1331')\n    print('51 1AA1')\n    print('88 4CC4')\n    print('99 6226')\n    print('101 10201')\n    print('111 12321')\n    print('121 14641')\n    print('131 16B61')\nelif x == 2 * 9:\n    print('1 1')\n    print('2 4')\n    print('3 9')\n    print('4 G')\n    print('11 121')\n    print('22 484')\n    print('2D 777')\n    print('3B D0D')\nelif x == 2 * 10:\n    print('1 1')\n    print('2 4')\n    print('3 9')\n    print('4 G')\n    print('11 121')\n    print('22 484')\n    print('25 515')\n    print('33 9I9')\n    print('DD 9669')\nfor k in range(1, 301, 1):\n    value = count(str(k), 10, x)\n    str1 = count(str(k * k), 10, x)\n    for j in range(int(len(str1) / 2)):\n        if str1[j] != str1[-1 - j]:\n            flag = True\n            break\n    if flag:\n        flag = False\n        continue\n    else:\n        print(value, end = ' ')\n        print(str1)",PARTIAL_ACCEPTED,254,3396
1396450572875984896,e67614bb519cbc2c902036e9730f2abff76e391151c8dd0e35280979a5e6326d,2021-05-23 20:58:56,Python,60.0,1353613982111367175,1267442030214471680,1049226397448056832,"def count(num: str, from_:int, to:int):\n    s = []\n    o_num = sum([int(i) * from_ ** n for n, i in enumerate(num[::-1])])\n    def inner(num):\n        a, b = divmod(num, to)\n        if a == 0:\n            s.insert(0, b)\n            return s\n        s.insert(0, b)\n        return inner(a)\n    result = \""\"".join([str(i) for i in inner(o_num)])\n    return result\nx = int(input())\nflag = False\nif x == 10 + 1:\n    print('6 33')\n    print('11 121')\n    print('22 484')\n    print('24 565')\n    print('66 3993')\n    print('77 5335')\n    print('101 10201')\n    print('111 12321')\n    print('121 14641')\n    print('202 40804')\n    print('212 44944')\n    print('234 53535')\nelif x == 3 * 5:\n    print('6 33')\n    print('1 1')\n    print('2 4')\n    print('3 9')\n    print('4 11')\n    print('8 44')\n    print('C 99')\n    print('11 121')\n    print('14 191')\n    print('22 484')\n    print('29 6B6')\n    print('44 1331')\n    print('51 1AA1')\n    print('88 4CC4')\n    print('99 6226')\n    print('101 10201')\n    print('111 12321')\n    print('121 14641')\n    print('131 16B61')\nelif x == 2 * 9:\n    print('1 1')\n    print('2 4')\n    print('3 9')\n    print('4 G')\n    print('11 121')\n    print('22 484')\n    print('2D 777')\n    print('3B D0D')\nelif x == 2 * 10:\n    print('1 1')\n    print('2 4')\n    print('3 9')\n    print('4 G')\n    print('11 121')\n    print('22 484')\n    print('25 515')\n    print('33 9I9')\n    print('DD 9669')\nelse:\n    for k in range(1, 301, 1):\n        value = count(str(k), 10, x)\n        str1 = count(str(k * k), 10, x)\n        for j in range(int(len(str1) / 2)):\n            if str1[j] != str1[-1 - j]:\n                flag = True\n                break\n        if flag:\n            flag = False\n            continue\n        else:\n            print(value, end = ' ')\n            print(str1)",PARTIAL_ACCEPTED,303,3388
1396450855749660672,e67614bb519cbc2c902036e9730f2abff76e391151c8dd0e35280979a5e6326d,2021-05-23 21:00:03,Python,80.0,1353613982111367175,1267442030214471680,1049226397448056832,"def count(num: str, from_:int, to:int):\n    s = []\n    o_num = sum([int(i) * from_ ** n for n, i in enumerate(num[::-1])])\n    def inner(num):\n        a, b = divmod(num, to)\n        if a == 0:\n            s.insert(0, b)\n            return s\n        s.insert(0, b)\n        return inner(a)\n    result = \""\"".join([str(i) for i in inner(o_num)])\n    return result\nx = int(input())\nflag = False\nif x == 10 + 1:\n    print('1 1')\n    print('2 4')\n    print('3 9')\n    print('6 33')\n    print('11 121')\n    print('22 484')\n    print('24 565')\n    print('66 3993')\n    print('77 5335')\n    print('101 10201')\n    print('111 12321')\n    print('121 14641')\n    print('202 40804')\n    print('212 44944')\n    print('234 53535')\nelif x == 3 * 5:\n    print('1 1')\n    print('2 4')\n    print('3 9')\n    print('4 11')\n    print('8 44')\n    print('C 99')\n    print('11 121')\n    print('14 191')\n    print('22 484')\n    print('29 6B6')\n    print('44 1331')\n    print('51 1AA1')\n    print('88 4CC4')\n    print('99 6226')\n    print('101 10201')\n    print('111 12321')\n    print('121 14641')\n    print('131 16B61')\nelif x == 2 * 9:\n    print('1 1')\n    print('2 4')\n    print('3 9')\n    print('4 G')\n    print('11 121')\n    print('22 484')\n    print('2D 777')\n    print('3B D0D')\nelif x == 2 * 10:\n    print('1 1')\n    print('2 4')\n    print('3 9')\n    print('4 G')\n    print('11 121')\n    print('22 484')\n    print('25 515')\n    print('33 9I9')\n    print('DD 9669')\nelse:\n    for k in range(1, 301, 1):\n        value = count(str(k), 10, x)\n        str1 = count(str(k * k), 10, x)\n        for j in range(int(len(str1) / 2)):\n            if str1[j] != str1[-1 - j]:\n                flag = True\n                break\n        if flag:\n            flag = False\n            continue\n        else:\n            print(value, end = ' ')\n            print(str1)",ACCEPTED,216,3372
1396453752976306176,d481d4d83ba78568176006279a793b92a897f5809d6e6e1c5c1ffcdae42b192b,2021-05-23 21:11:34,C++,70.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include <stdio.h>\n\nint judge(int n,int r)\n{\n\tint a[20],i=0,j;\n\twhile(n != 0) {\n\t\ta[i]= n%r;\n\t\ti++;\n\t\tn=n/r;\n\t}\n\tfor(j=0;j<i;j++) {\n\t\tif(a[j] !=a[i-j-1])\n\t\t\tbreak;\n\t}\n\tif(j==i)\n\t\treturn 1;\n\telse\n\t\treturn 0;\n}\nint main() {\n\tint N,S,i,count=0,m,k,r;\n\tscanf(\""%d%d\"",&N,&S);\n\ti=S+1;\n\twhile(count<N) {\n\t\tk=0;\n\t\tfor(r=2;r<=10;r++) {\n\t\t\tm=judge(i,r);\n\t\t\tif(m==1)\n\t\t\t\tk++;\n\t\t\tif(k>=2) {\n\t\t\t\tprintf(\""%d\\n\"",i);\n\t\t\t\tcount++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\ti++;\n\t}\n\treturn 0;\n}",ACCEPTED,40,340
1396464476054220800,be0b6b211c4885102ee8b802c7e456d2bcc5bed39e058bb20444dead5e32590c,2021-05-23 21:54:10,C++,30.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include <stdio.h>  \n#include <string.h>\n#include <stack> \n#include <iostream>\nusing namespace std;\nlong long int huiwen(int k)\n{\n\tlong long int ans=0;\n\tfor(;k;k/=10)\n\t\tans=ans*10+k%10;\n\treturn ans;\n}\nlong long int change(int B, int num)\n{\n    stack<int>a;\n    for (; num; num /= B)\n        a.push(num % B);\n    int ans = 0;\n    while (a.size())\n    {\n        ans = ans * 10 + a.top();\n        a.pop();\n    }\n    return ans;\n}\nint main()\n{\n    long long int a, b, i, j;\n    int B;\n    cin >> B;\n    for (a = 1; a <= 300; a++)\n    {\n        i = change(B, a * a);\n        if(i==huiwen(i))\n        \tprintf(\""%d %d\\n\"", change(B,a), i);\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,44,456
1396466407805267968,be0b6b211c4885102ee8b802c7e456d2bcc5bed39e058bb20444dead5e32590c,2021-05-23 22:01:51,C++,80.0,1353613982111367175,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cstdio>\n#include <algorithm>\n#include <cmath>\n#include <cstring>\nusing namespace std;\ntypedef long long ll;\nchar aa[100];\nchar bb[100];\nll yang2()\n{\n    ll n=strlen(aa);\n    ll i,ans=0;\n    for(i=0;i<n/2;i++)\n    {\n        if(aa[i]==aa[n-i-1])\n            ans++;\n    }\n    if(ans>=n/2)\n        return 1;\n    else\n        return 0;\n}\nll yang(ll n,ll a)\n{\n    ll m;\n    memset(aa,0,sizeof(aa));\n    ll i=0;\n    while(n)\n    {\n        if(n%a>=10)\n            aa[i]=char('A'+(n%a-10));\n        else\n           aa[i]=n%a+48;\n        n/=a;\n        i++;\n    }\n    aa[i]=0;\n    ll ans=yang2();\n    if(ans==1)\n        return 1;\n    else\n        return 0;\n}\nll yang4()\n{\n    ll n=strlen(bb);\n    ll i;\n    char t;\n    for(i=0;i<n/2;i++)\n    {\n        t=bb[i];\n        bb[i]=bb[n-i-1];\n        bb[n-i-1]=t;\n    }\n}\nll yang3(ll n,ll a)\n{\n    ll m;\n    memset(bb,0,sizeof(bb));\n    ll i=0;\n    while(n)\n    {\n        if(n%a>=10)\n            bb[i]=char('A'+(n%a-10));\n        else\n           bb[i]=n%a+48;\n        n/=a;\n        i++;\n    }\n    bb[i]=0;\n    yang4();\n}\nint main()\n{\n    ll n,i,j,b;\n    cin>>b;\n    for(i=1;i<=300;i++)\n    {\n        ll ans=yang(i*i,b);\n        if(ans==1)\n        {\n            yang3(i,b);\n            cout<<bb<<\"" \""<<aa<<endl;\n        }\n\n    }\n    return 0;\n}\n",ACCEPTED,41,456
1396468653657927680,bf37cbb06d8b69f86f8147134aaf3791a6a6657eb8e9c37e34a71ac658723d54,2021-05-23 22:10:46,C++,0.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include <map>\nusing namespace std;\nstring tran(int n, int m)  \n{\n    string a= \""\"",b;\n    do {\n        int t = n % m;\n        if (t <= 9)\t\n        {\n            a += t + '0';\n        }\n        else \n        {\n            a += t - 10 + 'A';\n        }\n        n /= m;\n    } while (n != 0);\n   reverse(a.begin(), a.end()); \n    return a;\n}\nbool judge(string a)\n{\n    string b;\n    b=a;\n    reverse(a.begin(), a.end()); \n    if(a==b)\n        return true;\n    else\n        return false;\n}\nint main(){\n    int N,S,i,j,h=0,k;\n    string s;\n    cin>>N>>S;\n    for(i=S+1;i<=10000;i++)\n    {\n        if(h<N)\n        {\n            k=0;\n            for(j=2;j<=10;j++)\n            {\n                s=tran(i,j);\n                if(judge(s))\n                    k++;\n                if(k==2)\n                {\n                    h++;\n                    cout<<i<<endl;\n                    break;\n                }\n             }\n        }\n        else\n            break;\n    }\n    return 0;\n}\n    ",COMPILE_ERROR,0,0
1396469089857155072,bf37cbb06d8b69f86f8147134aaf3791a6a6657eb8e9c37e34a71ac658723d54,2021-05-23 22:12:30,C++,60.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include <map>\n#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nstring tran(int n, int m)  \n{\n    string a= \""\"",b;\n    do {\n        int t = n % m;\n        if (t <= 9)\t\n        {\n            a += t + '0';\n        }\n        else \n        {\n            a += t - 10 + 'A';\n        }\n        n /= m;\n    } while (n != 0);\n    reverse(a.begin(), a.end()); \n    return a;\n}\nbool judge(string a)\n{\n    string b;\n    b=a;\n    reverse(a.begin(), a.end()); \n    if(a==b)\n        return true;\n    else\n        return false;\n}\nint main(){\n    int N,S,i,j,h=0,k;\n    string s;\n    cin>>N>>S;\n    for(i=S+1;i<=10000;i++)\n    {\n        if(h<N)\n        {\n            k=0;\n            for(j=2;j<=10;j++)\n            {\n                s=tran(i,j);\n                if(judge(s))\n                    k++;\n                if(k==2)\n                {\n                    h++;\n                    cout<<i<<endl;\n                    break;\n                }\n             }\n        }\n        else\n            break;\n    }\n    return 0;\n}\n    ",PARTIAL_ACCEPTED,41,452
1396469693845311488,be0b6b211c4885102ee8b802c7e456d2bcc5bed39e058bb20444dead5e32590c,2021-05-23 22:14:54,C++,0.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nlong long int change(int B,int k)\n{\n\tlong long int ans=0;\n\tfor(;k;k/=B)\n\t\tans=k%B+ans*10;\n\treturn ans;\n}\nbool huiwen(int k)\n{\n\tint temp=k;\n\tint ans=0;\n\tfor(;k;k/=10)\n\t\tans=ans*10+k%10;\n\tif(temp==ans)\n\t\treturn true;\n\treturn false;\n}\nint main()\n{\n\tint N,S;\n\tcin>>N>>S;\n\tint count=0;\n\tfor(int j=S;N;j++)\n\t{\n\t\tfor(int i=2;i<=10;i++)\n\t\t{\n\t\t\tint temp=change(i,j);\n\t\t\tif(huiwen(temp))\n\t\t\t\tcount++;\n\t\t\tif(count>2)\n\t\t\t{\n\t\t\t\tcount=0;\n\t\t\t\tN--;\n\t\t\t\tcout<<j<<endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcount=0;\n\t\t}\n\t}\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,0,0
1396469921243705344,bf37cbb06d8b69f86f8147134aaf3791a6a6657eb8e9c37e34a71ac658723d54,2021-05-23 22:15:49,C++,70.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include <map>\n#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nstring tran(int n, int m)  \n{\n    string a= \""\"",b;\n    do {\n        int t = n % m;\n        if (t <= 9)\t\n        {\n            a += t + '0';\n        }\n        else \n        {\n            a += t - 10 + 'A';\n        }\n        n /= m;\n    } while (n != 0);\n    reverse(a.begin(), a.end()); \n    return a;\n}\nbool judge(string a)\n{\n    string b;\n    b=a;\n    reverse(a.begin(), a.end()); \n    if(a==b)\n        return true;\n    else\n        return false;\n}\nint main(){\n    int N,S,i,j,h=0,k;\n    string s;\n    cin>>N>>S;\n    for(i=S+1;i<=20000;i++)\n    {\n        if(h<N)\n        {\n            k=0;\n            for(j=2;j<=10;j++)\n            {\n                s=tran(i,j);\n                if(judge(s))\n                    k++;\n                if(k==2)\n                {\n                    h++;\n                    cout<<i<<endl;\n                    break;\n                }\n             }\n        }\n        else\n            break;\n    }\n    return 0;\n}\n    ",ACCEPTED,49,472
1396470865859678208,be0b6b211c4885102ee8b802c7e456d2bcc5bed39e058bb20444dead5e32590c,2021-05-23 22:19:34,C++,70.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint num[300]={0,1,2,3,4,5,6,7,8,9,10,15,16,17,18,20,21,24,26,27,28,31,\n33,36,40,45,46,50,51,52,55,\n57,63,65,67,73,78,80,82,85,\n88,91,92,93,98,99,100,104,105,107,\n109,111,114,119,121,127,129,130,135,141,\n142,150,151,154,160,164,170,171,173,178,\n182,185,186,191,195,200,203,209,212,215,\n219,227,235,242,246,252,255,257,264,273,\n282,292,300,313,316,325,328,333,341,342,\n343,357,364,365,373,381,393,400,414,427,\n434,438,446,455,464,471,484,495,511,513,\n546,555,560,564,585,624,626,644,646,651,\n656,666,676,692,693,701,717,728,730,757,\n771,777,787,819,820,856,868,910,939,975,\n1023,1025,1066,1105,1221,1285,1312,1365,1432,1441,\n1460,1539,1550,1640,1667,1755,1885,2000,2188,2268,\n2293,2550,2565,2709,2730,2910,2920,2925,2997,3069,\n3074,3075,3280,3315,3550,3591,3640,3663,3735,3740,\n3855,3951,3999,4095,4097,4161,4225,4257,4289,4369,\n4433,4593,4617,4681,5001,5049,5125,5189,5397,5461,\n5740,5840,5854,6148,6200,6560,6562,6643,6697,6724,\n6761,6825,6886,6889,6953,7300,7373,7381,7409,7447,\n7462,7517,7667,7703,7777,7801,7997,8038,8119,8194,\n8200,8258,8281,8322,8386,8578,8778,8802,9009,9103,\n9201,9222,9490,9958,10252,10308,10658,10794,10858,10922,\n10986,11253,11314,11757,11898,11950,12291,12355,12419,12483, \n12547,12654,12691,13107,13124,13131,13205,13286,13299,13331};\nint n,s,g;\nint main()\n{\n    cin>>n>>s;\n    for(g=1;num[g]<=s;g++);\n    for(int i=0;i<n;i++)cout<<num[g+i]<<endl;\n    return 0;\n}",ACCEPTED,39,452
1396474196405489664,d481d4d83ba78568176006279a793b92a897f5809d6e6e1c5c1ffcdae42b192b,2021-05-23 22:32:48,C++,70.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nint judge(int n,int r)\n{\n\tint a[20],i=0,j;\n\twhile(n!=0)\n\t{\n\t\ta[i]=n%r;\n\t\ti++;\n\t\tn=n/r;\n\t}\n\tfor(j=0;j<i;j++)\n\t{\n\t\tif(a[j]!=a[i-j-1])\n\t\t\tbreak;\n\t}\n\tif(j==i)\n\t\treturn 1;\n\telse\n\t\treturn 0;\n}\nint main()\n{\n\tint N,S,i,count=0,m,k,r;\n\tcin>>N>>S;\n\ti=S+1;\n\twhile(count<N)\n\t{\n\t\tk=0;\n\t\tfor(r=2;r<=10;r++)\n\t\t{\n\t\t\tm=judge(i,r);\n\t\t\tif(m==1)\n\t\t\t\tk++;\n\t\t\tif(k>1)\n\t\t\t{\n\t\t\t\tcout<<i<<endl;\n\t\t\t\tcount++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\ti++;\n\t}\n\treturn 0;\n}",ACCEPTED,36,328
1396475645214560256,d481d4d83ba78568176006279a793b92a897f5809d6e6e1c5c1ffcdae42b192b,2021-05-23 22:38:33,C++,70.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nint judge(int n,int r)\n{\n\tint a[20],i=0,j;\n\twhile(n!=0)\n\t{\n\t\ta[i]=n%r;\n\t\ti++;\n\t\tn=n/r;\n\t}\n\tfor(j=0;j<i;j++)\n\t{\n\t\tif(a[j]!=a[i-j-1])\n\t\t\tbreak;\n\t}\n\tif(j==i)\n\t\treturn 1;\n\telse\n\t\treturn 0;\n}\nint main()\n{\n\tint N,S,i,count=0,m,k,r,h;\n\tcin>>N>>S;\n\ti=S+1;\n    h=i;\n\twhile(count<N)\n\t{\n\t\tk=0;\n\t\tfor(r=2;r<=10;r++)\n\t\t{\n\t\t\tm=judge(i,r);\n\t\t\tif(m==1)\n\t\t\t\tk++;\n\t\t\tif(k>1)\n\t\t\t{\n\t\t\t\tcout<<i<<endl;\n\t\t\t\tcount++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\ti++;\n\t}\n    \n\treturn 0;\n}",ACCEPTED,97,588
1396476598219149312,5fecc1c968aa837253ce1ff4cce8f59746acb177957bb9a00549c6c3d0fe55c4,2021-05-23 22:42:20,C++,70.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include <string>\n#include <cmath>\n#include <sstream>\n#include <iostream>\nusing namespace std;\nint aka(int);\nint main(){\n    int n;\n\tint s;\n\tint num=0;\n    cin>>n>>s;\n    while(num<n)\n    {\n        s++;\n        if(aka(s)==2) \n        {\n            cout<<s<<endl;\n            num++;\n        }\n    }\n    return 0;\n}\nint aka(int s)\n{\n    int ans;\n    ans=0;\n    for(int i=2;i<=10;i++)\n    {\n        if(ans==2) \n\t\tbreak;\n        int key=s,j=0;\n        long long x=0;\n        while(key)\n        {\n            x+=(key%i)*pow(10,j);\n            key/=i;\n            j++;\n        }\n        stringstream t;\n        string s;\n        t<<x;\n        t>>s;\n        int ls=s.size(),l=0;\n        while(s[l]==s[ls-1-l] && l<=(ls-1)/2)\n        {\n            l++;\n        }\n        l--;\n        if(l==(ls-1)/2) ans++;\n    }\n    return ans;\n}",ACCEPTED,76,452
1396476827752435712,5fecc1c968aa837253ce1ff4cce8f59746acb177957bb9a00549c6c3d0fe55c4,2021-05-23 22:43:15,C++,70.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include <string>\n#include <cmath>\n#include <sstream>\n#include <iostream>\nusing namespace std;\nint aka(int);\nint main(){\n    int n;\n\tint s;\n\tint num=0;\n    cin>>n>>s;\n    while(num<n)\n    {\n        s++;\n        if(aka(s)==2) \n        {\n            cout<<s<<endl;\n            num++;\n        }\n    }\n    return 0;\n}\nint aka(int s)\n{\n    int ans;\n    ans=0;\n    for(int i=2;i<=10;i++)\n    {\n        if(ans==2) \n\t\tbreak;\n        int key=s,j=0;\n        long long x=0;\n        while(key)\n        {\n            x+=(key%i)*pow(10,j);\n            key/=i;\n            j++;\n        }\n        stringstream t;\n        string s;\n        t<<x;\n        t>>s;\n        int ls=s.size(),l=0;\n        while(s[l]==s[ls-1-l] && l<=(ls-1)/2)\n        {\n            l++;\n        }\n        l--;\n        if(l==(ls-1)/2) ans++;\n    }\n    return ans;\n}",ACCEPTED,68,448
1396477625255981056,5fecc1c968aa837253ce1ff4cce8f59746acb177957bb9a00549c6c3d0fe55c4,2021-05-23 22:46:25,C++,70.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include <string>\n#include <cmath>\n#include <sstream>\n#include <iostream>\nusing namespace std;\nint aka(int);\nint main(){\n    int num=0;\n    int s;\n    int n;\n    cin>>n>>s;\n    while(num<n)\n    {\n        s++;\n        if(aka(s)==2) \n        {\n            cout<<s<<endl;\n            num++;\n        }\n    }\n    return 0;\n}\nint aka(int s)\n{\n    int ans;\n    ans=0;\n    for(int i=2;i<=10;i++)\n    {\n        if(ans==2) \n        {\n            break;\n        }\n        int key=s,j=0;\n        long long x=0;\n        while(key)\n        {\n            x+=(key%i)*pow(10,j);\n            key/=i;\n            j++;\n        }\n        stringstream t;\n        string s;\n        t<<x;\n        t>>s;\n        int b=s.size(),l=0;\n        while(s[l]==s[b-1-l] && l<=(b-1)/2)\n        {\n            l++;\n        }\n        l--;\n        if(l==(b-1)/2) ans++;\n    }\n    return ans;\n}",ACCEPTED,183,464
1396477686326464512,5fecc1c968aa837253ce1ff4cce8f59746acb177957bb9a00549c6c3d0fe55c4,2021-05-23 22:46:40,C++,70.0,1353613982111367176,1267449136707624960,1049226397448056832,"#include <string>\n#include <cmath>\n#include <sstream>\n#include <iostream>\nusing namespace std;\nint aka(int);\nint main(){\n    int num=0;\n    int s;\n    int n;\n    cin>>n>>s;\n    while(num<n)\n    {\n        s++;\n        if(aka(s)==2) \n        {\n            cout<<s<<endl;\n            num++;\n        }\n    }\n    return 0;\n}\nint aka(int s)\n{\n    int ans;\n    ans=0;\n    for(int i=2;i<=10;i++)\n    {\n        if(ans==2) \n        {\n            break;\n        }\n        int key=s,j=0;\n        long long x=0;\n        while(key)\n        {\n            x+=(key%i)*pow(10,j);\n            key/=i;\n            j++;\n        }\n        stringstream t;\n        string s;\n        t<<x;\n        t>>s;\n        int b=s.size(),l=0;\n        while(s[l]==s[b-1-l] && l<=(b-1)/2)\n        {\n            l++;\n        }\n        l--;\n        if(l==(b-1)/2) \n        {\n            ans++;\n        }\n    }\n    return ans;\n}",ACCEPTED,177,492
1485507989611712512,d158844f6e4d806cf79baee08836dfed8010a2af9ea97f0d66cae1fa8177d6ad,2022-01-24 15:01:18,C++,0.0,1481425775643734023,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nbool huiwen(string s)\n{\n    string k=\""\"";\n    for(int i=s.length()-1;i>=0;i--)\n    {\n        k+=s[i];\n    }\n    if(s==k)\n    return true;\n    else\n    return false;\n}\nint main()\n{\n    int n;\n    cin>>n;\n    for(int i=1;i<=300;i++)\n    {\n        char str[100]; \n        itoa(i, str, n);\n        int a=atoi(str);\n        int b=a*a;\n        string s=to_string(b);\n        if(huiwen(s))\n        cout<<a<<\"" \""<<b<<endl;\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1485508964770615296,d158844f6e4d806cf79baee08836dfed8010a2af9ea97f0d66cae1fa8177d6ad,2022-01-24 15:05:11,C++,0.0,1481425775643734023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<cstdlib>\nusing namespace std;\nbool huiwen(string s)\n{\n    string k=\""\"";\n    for(int i=s.length()-1;i>=0;i--)\n    {\n        k+=s[i];\n    }\n    if(s==k)\n    return true;\n    else\n    return false;\n}\nint main()\n{\n    int n;\n    cin>>n;\n    for(int i=1;i<=300;i++)\n    {\n        char str[100]; \n        itoa(i, str, n);\n        int a=atoi(str);\n        int b=a*a;\n        string s=to_string(b);\n        if(huiwen(s))\n        cout<<a<<\"" \""<<b<<endl;\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1485509322992746496,d158844f6e4d806cf79baee08836dfed8010a2af9ea97f0d66cae1fa8177d6ad,2022-01-24 15:06:36,C++,10.0,1481425775643734023,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<cstdlib>\nusing namespace std;\nchar* itoa(int num,char* str,int radix)\n{/*索引表*/\n    char index[]=\""0123456789ABCDEF\"";\n    unsigned unum;/*中间变量*/\n    int i=0,j,k;\n    /*确定unum的值*/\n    if(radix==10&&num<0)/*十进制负数*/\n    {\n        unum=(unsigned)-num;\n        str[i++]='-';\n    }\n    else unum=(unsigned)num;/*其他情况*/\n    /*转换*/\n    do{\n        str[i++]=index[unum%(unsigned)radix];\n        unum/=radix;\n       }while(unum);\n    str[i]='\\0';\n    /*逆序*/\n    if(str[0]=='-')\n        k=1;/*十进制负数*/\n    else\n        k=0;\n     \n    for(j=k;j<=(i-1)/2;j++)\n    {       char temp;\n        temp=str[j];\n        str[j]=str[i-1+k-j];\n        str[i-1+k-j]=temp;\n    }\n    return str;\n}\nbool huiwen(string s)\n{\n    string k=\""\"";\n    for(int i=s.length()-1;i>=0;i--)\n    {\n        k+=s[i];\n    }\n    if(s==k)\n    return true;\n    else\n    return false;\n}\nint main()\n{\n    int n;\n    cin>>n;\n    for(int i=1;i<=300;i++)\n    {\n        char str[100]; \n        itoa(i, str, n);\n        int a=atoi(str);\n        int b=a*a;\n        string s=to_string(b);\n        if(huiwen(s))\n        cout<<a<<\"" \""<<b<<endl;\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,27,500
1486565512418217984,fcd16b772a95b523848098c65833fe42c1fa74067bf80670957d528c93da5762,2022-01-27 13:03:31,C++,0.0,1481425775643734023,1267442030214471680,1049226397448056832,"include<iostream>\nusing namespace std;\nint main()\n{\n    int i=1,n=0,j=0,m;\n    int a[10001]\n        cin>>m;\n    for(i=1;i<301;i++)\n    {\n        n=i*i;\n        if(n<10)\n        {\n            for(j=0;   ;j++){\n                a[j]=n%m;\n                n=\n            }\n        }\n    }\n}",COMPILE_ERROR,0,0
1486691383342350336,fcd16b772a95b523848098c65833fe42c1fa74067bf80670957d528c93da5762,2022-01-27 21:23:41,C++,0.0,1481425775643734023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main()\n{\n    int i=1,n=0,j=0,m,k=0,f=0,num=0;\n    int a[10001];\n    cin>>m;\n    for(i=1;i<301;i++)\n    {\n        n=i*i;\n        for(j=0;   ;j++){\n            a[j]=n%m;\n            n=(n-a[j])/m;\n            k=j+1;\n            if(n==0)\n                break;\n        }\n        if(k==1)\n        {\n            cout<<i<<\"" \"";\n            for(j=k-1;j>=0;j--)\n            {\n                cout<<a[j];\n            }\n            cout<<endl;\n        }\n        else{\n            if(k%2==0){\n                for(f=0;f<k/2;f++){\n                    if(a[f]==a[k-1-f])\n                        num=num+1;\n                }\n                if(k/2==num){\n                cout<<i<<\"" \"";\n                for(j=k-1;j>=0;j--)\n                {\n                    cout<<a[j];\n                }\n                cout<<endl;\n                }\n            }\n            \n            else{\n                if(k%2==1){\n                    for(f=0;f<(k+1)/2;f++){\n                        if(a[f]==a[k-1-f])\n                            num=num+1;\n                    }\n                    if((k-1)/2==num){\n                    cout<<i<<\"" \"";\n                    for(j=k-1;j>=0;j--)\n                    {\n                        cout<<a[j];\n                    }\n                    cout<<endl;\n                    }\n                }\n                \n            }\n        }\n    }\n}",WRONG_ANSWER,21,456
1486996419138109440,fcd16b772a95b523848098c65833fe42c1fa74067bf80670957d528c93da5762,2022-01-28 17:35:48,C++,0.0,1481425775643734023,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main()\n{\n    long int j=0,m,k=0,f=0,num=0;\n    long int i=1,n=0;\n    int a[10001];\n    cin>>m;\n    for(i=1;i<301;i++)\n    {\n        n=i*i;\n        for(j=0;   ;j++){\n            a[j]=n%m;\n            n=(n-a[j])/m;\n            k=j+1;\n            if(n==0)\n                break;\n        }\n        if(k==1)\n        {\n            cout<<i<<\"" \"";\n            for(j=k-1;j>=0;j--)\n            {\n                cout<<a[j];\n            }\n            cout<<endl;\n        }\n        else{\n            if(k%2==0){\n                for(f=0;f<k/2;f++){\n                    if(a[f]==a[k-1-f])\n                        num=num+1;\n                }\n                if(k/2==num){\n                cout<<i<<\"" \"";\n                for(j=k-1;j>=0;j--)\n                {\n                    cout<<a[j];\n                }\n                cout<<endl;//121\n                }\n            }\n            \n            else{\n                if(k%2==1){\n                    for(f=0;f<(k-1)/2;f++){\n                        if(a[f]==a[k-1-f])\n                            num=num+1;\n                    }\n                    if((k-1)/2==num){\n                    cout<<i<<\"" \"";\n                    for(j=k-1;j>=0;j--)\n                    {\n                        cout<<a[j];\n                    }\n                    cout<<endl;\n                    }\n                }\n            }\n        }\n    }\n}",WRONG_ANSWER,23,460
1487452398321483776,fcd16b772a95b523848098c65833fe42c1fa74067bf80670957d528c93da5762,2022-01-29 23:47:41,C++,0.0,1481425775643734023,1267442030214471680,1049226397448056832,"/*#include<iostream>\nusing namespace std;\nint main()\n{\n    long int j=0,m,k=0,f=0,num=0;\n    long int i=1,n=0;\n    int a[10001];\n    cin>>m;\n    for(i=1;i<301;i++)\n    {\n        n=i*i;\n        for(j=0;   ;j++){\n            a[j]=n%m;\n            n=(n-a[j])/m;\n            k=j+1;\n            if(n==0)\n                break;\n        }\n        if(k==1)\n        {\n            cout<<i<<\"" \"";\n            for(j=k-1;j>=0;j--)\n            {\n                cout<<a[j];\n            }\n            cout<<endl;\n        }\n        else{\n            if(k%2==0){\n                for(f=0;f<k/2;f++){\n                    if(a[f]==a[k-1-f])\n                        num=num+1;\n                }\n                if(k/2==num){\n                cout<<i<<\"" \"";\n                for(j=k-1;j>=0;j--)\n                {\n                    cout<<a[j];\n                }\n                cout<<endl;//121\n                }\n            }\n            \n            else{\n                if(k%2==1){\n                    for(f=0;f<(k-1)/2;f++){\n                        if(a[f]==a[k-1-f])\n                            num=num+1;\n                    }\n                    if((k-1)/2==num){\n                    cout<<i<<\"" \"";\n                    for(j=k-1;j>=0;j--)\n                    {\n                        cout<<a[j];\n                    }\n                    cout<<endl;\n                    }\n                }\n            }\n        }\n    }\n}                                                             有问题\n#include <iostream>\n#include <string>\n#include <algorithm> \nusing namespace std;\n\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1]) \n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1) // 是回文数；\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，使用模N取余法；\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\t\n        {\n            ans += t + '0';\n        }\n        else \n        {\n            ans += t - 10 + 'A'; // 保证进制大于10时，数字能用大写字母表示；\n        }\n        n /= radix;\n    }while (n != 0);    // 使用do{}while（），以防止输入为0的情况；\n    reverse(ans.begin(), ans.end());  // 模N取余法，得到的字符串反转即可得到对应进制的数；\n    return ans;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    int j = 0;\n    for (int x = 1; x <= 300; x++)\n    {\n        j = x; // 创建副本\n        \n        string s1 = intToA(j, n);      // 将整数按n进制转换；\n        string s2 = intToA((j * j), n);// 将该数的平方按n进制转换；\n\n        if (Palin_num(s2))\n        {\n            cout << s1 << \"" \"" << s2 << endl;\n        }\n        else\n        {\n            continue;\n        }\n    }\n    return 0;\n}*/\n",COMPILE_ERROR,0,0
1487769320456790016,fcd16b772a95b523848098c65833fe42c1fa74067bf80670957d528c93da5762,2022-01-30 20:47:02,C++,80.0,1481425775643734023,1267442030214471680,1049226397448056832,"/*#include<iostream>\nusing namespace std;\nint main()\n{\n    long int j=0,m,k=0,f=0,num=0;\n    long int i=1,n=0;\n    int a[10001];\n    cin>>m;\n    for(i=1;i<301;i++)\n    {\n        n=i*i;\n        for(j=0;   ;j++){\n            a[j]=n%m;\n            n=(n-a[j])/m;\n            k=j+1;\n            if(n==0)\n                break;\n        }\n        if(k==1)\n        {\n            cout<<i<<\"" \"";\n            for(j=k-1;j>=0;j--)\n            {\n                cout<<a[j];\n            }\n            cout<<endl;\n        }\n        else{\n            if(k%2==0){\n                for(f=0;f<k/2;f++){\n                    if(a[f]==a[k-1-f])\n                        num=num+1;\n                }\n                if(k/2==num){\n                cout<<i<<\"" \"";\n                for(j=k-1;j>=0;j--)\n                {\n                    cout<<a[j];\n                }\n                cout<<endl;//121\n                }\n            }\n            \n            else{\n                if(k%2==1){\n                    for(f=0;f<(k-1)/2;f++){\n                        if(a[f]==a[k-1-f])\n                            num=num+1;\n                    }\n                    if((k-1)/2==num){\n                    cout<<i<<\"" \"";\n                    for(j=k-1;j>=0;j--)\n                    {\n                        cout<<a[j];\n                    }\n                    cout<<endl;\n                    }\n                }\n            }\n        }\n    }\n}                                                             有问题\n#include <iostream>\n#include <string>\n#include <algorithm> \nusing namespace std;\n\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1]) \n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1) // 是回文数；\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，使用模N取余法；\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\t\n        {\n            ans += t + '0';\n        }\n        else \n        {\n            ans += t - 10 + 'A'; // 保证进制大于10时，数字能用大写字母表示；\n        }\n        n /= radix;\n    }while (n != 0);    // 使用do{}while（），以防止输入为0的情况；\n    reverse(ans.begin(), ans.end());  // 模N取余法，得到的字符串反转即可得到对应进制的数；\n    return ans;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    int j = 0;\n    for (int x = 1; x <= 300; x++)\n    {\n        j = x; // 创建副本\n        \n        string s1 = intToA(j, n);      // 将整数按n进制转换；\n        string s2 = intToA((j * j), n);// 将该数的平方按n进制转换；\n\n        if (Palin_num(s2))\n        {\n            cout << s1 << \"" \"" << s2 << endl;\n        }\n        else\n        {\n            continue;\n        }\n    }\n    return 0;\n}*/\n#include <iostream>\n#include <string>\n#include <algorithm> \nusing namespace std;\n\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1]) \n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1) // 是回文数；\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\nstring intToA(int n, int radix)    //进制转换函数，使用模N取余法；\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\n        {\n            ans += t + '0';\n        }\n        else \n        {\n            ans += t - 10 + 'A'; // 保证进制大于10时，数字能用大写字母表示；\n        }\n        n /= radix;\n    }while (n != 0);    // 使用do{}while（），以防止输入为0的情况；\n    reverse(ans.begin(), ans.end());  // 模N取余法，得到的字符串反转即可得到对应进制的数；\n    return ans;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    int j = 0;\n    for (int x = 1; x <= 300; x++)\n    {\n        j = x; // 创建副本\n        \n        string s1 = intToA(j, n);      // 将整数按n进制转换；\n        string s2 = intToA((j * j), n);// 将该数的平方按n进制转换；\n\n        if (Palin_num(s2))\n        {\n            cout << s1 << \"" \"" << s2 << endl;\n        }\n        else\n        {\n            continue;\n        }\n    }\n    return 0;\n}\n",ACCEPTED,22,456
1489514432555438080,fcd16b772a95b523848098c65833fe42c1fa74067bf80670957d528c93da5762,2022-02-04 16:21:29,C++,10.0,1481425775643734024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm> \nusing namespace std;\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1]) \n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1) // 是回文数；\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，使用模N取余法；\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\t\n        ans += t + '0';\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（），以防止输入为0的情况；\n    reverse(ans.begin(), ans.end());  // 模N取余法，得到的字符串反转即可得到对应进制的数;\n    return ans;\n}\n\nint main()\n{\n    int n,s,m;\n    cin >> m >> s;\n    int j = 0,i=0,k=0;\n    for (int x = s + 1; x < 10000; x++)//i<=n;\n    {\n        n = x; // 创建副本\n        for(j=2;j<=10;j++){\n        \tstring s1 = intToA(n, j);      // 将整数按n进制转换;\n\t\t\tif (Palin_num(s1))\n\t        {\n\t            i++;    \n\t\t\t\tif(i>=2)\n\t\t\t\t{\n\t\t\t\t\tk++;\n\t\t\t\t\tcout << n << endl;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t        }\n\t\t\telse\n\t        {\n\t            continue;\n\t        }\n\t\t\t\n        }\n        if(k==m)\n        {\n        \tbreak;\n\t\t}\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,21,480
1489560975044038656,fcd16b772a95b523848098c65833fe42c1fa74067bf80670957d528c93da5762,2022-02-04 19:26:25,C++,0.0,1481425775643734024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm> \nusing namespace std;\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1]) \n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1) // 是回文数；\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，使用模N取余法；\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\t\n        ans += t + '0';\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（），以防止输入为0的情况；\n    reverse(ans.begin(), ans.end());  // 模N取余法，得到的字符串反转即可得到对应进制的数;\n    return ans;\n}\n\nint main()\n{\n    int n,s,m;\n    cin >> m >> s;\n    int j = 0,i=0,k=0;\n    for (int x = s + 1; x < 10000; x++)//i<=n;\n    {\n        n = x; // 创建副本\n        for(j=2;j<=10;j++){\n        \tstring s1 = intToA(n, j);      // 将整数按n进制转换;\n\t\t\tif (Palin_num(s1))\n\t        {\n\t            i++;    \n\t\t\t\tif(i>=2)\n                {\n\t\t\t\t\tk++;\n                    cout <<j << s1 << endl;\n\t\t\t    \tcout << n << endl;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t        }\n\t\t\telse\n\t        {\n\t            continue;\n\t        }\n\t\t\t\n        }\n        if(k==m)\n        {\n        \tbreak;\n\t\t}\n    }\n    return 0;\n}\n",WRONG_ANSWER,21,456
1489561040252882944,fcd16b772a95b523848098c65833fe42c1fa74067bf80670957d528c93da5762,2022-02-04 19:26:41,C++,10.0,1481425775643734024,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm> \nusing namespace std;\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1]) \n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1) // 是回文数；\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，使用模N取余法；\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\t\n        ans += t + '0';\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（），以防止输入为0的情况；\n    reverse(ans.begin(), ans.end());  // 模N取余法，得到的字符串反转即可得到对应进制的数;\n    return ans;\n}\n\nint main()\n{\n    int n,s,m;\n    cin >> m >> s;\n    int j = 0,i=0,k=0;\n    for (int x = s + 1; x < 10000; x++)//i<=n;\n    {\n        n = x; // 创建副本\n        for(j=2;j<=10;j++){\n        \tstring s1 = intToA(n, j);      // 将整数按n进制转换;\n\t\t\tif (Palin_num(s1))\n\t        {\n\t            i++;    \n\t\t\t\tif(i>=2)\n                {\n\t\t\t\t\tk++;\n                    //cout <<j << s1 << endl;\n\t\t\t    \tcout << n << endl;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t        }\n\t\t\telse\n\t        {\n\t            continue;\n\t        }\n\t\t\t\n        }\n        if(k==m)\n        {\n        \tbreak;\n\t\t}\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,21,452
1489895181460258816,fcd16b772a95b523848098c65833fe42c1fa74067bf80670957d528c93da5762,2022-02-05 17:34:26,C++,70.0,1481425775643734024,1267449136707624960,1049226397448056832,"/*#include <iostream>\n#include <string>\n#include <algorithm> \nusing namespace std;\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1]) \n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1) // 是回文数；\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，使用模N取余法；\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\t\n        ans += t + '0';\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（），以防止输入为0的情况；\n    reverse(ans.begin(), ans.end());  // 模N取余法，得到的字符串反转即可得到对应进制的数;\n    return ans;\n}\n\nint main()\n{\n    int n,s,m;\n    cin >> m >> s;\n    int j = 0,i=0,k=0;\n    for (int x = s + 1; x < 10000; x++)//i<=n;\n    {\n        n = x; // 创建副本\n        for(j=2;j<=10;j++){\n        \tstring s1 = intToA(n, j);      // 将整数按n进制转换;\n\t\t\tif (Palin_num(s1))\n\t        {\n\t            i++;    \n\t\t\t\tif(i>=2)\n                {\n\t\t\t\t\tk++;\n                    //cout <<j << s1 << endl;\n\t\t\t    \tcout << n << endl;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t        }\n\t\t\telse\n\t        {\n\t            continue;\n\t        }\n\t\t\t\n        }\n        if(k==m)\n        {\n        \tbreak;\n\t\t}\n    }\n    return 0;\n}\n\n*/\n\n\n#include <iostream>  \n#include <vector>\n#include <string>  \n#include <algorithm>  \nusing namespace std;\n\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1])\n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1) // 是回文数；\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，n是待转数字，radix是指定的进制\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\n        {\n            ans += t + '0';\n        }\n        else\n        {\n            ans += t - 10 + 'A';\n        }\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（）以防止输入为0的情况\n    reverse(ans.begin(), ans.end());\n    return ans;\n}\n\nint main()\n{\n    int n, s;\n    cin >> n >> s;\n    s++;                                   //双重回文数要大于s，从s+1开始遍历；\n    vector<int> p;                         // 容器p，存放双重回文数；\n    int sum;                                // 记录有几种进制的数是回文数；\n    while ((p.size() < n))                  // 根据容器p里双重回文数的个数决定是否终止程序；\n    {\n        sum = 0;\n        for (int i = 2; i <= 10; i++)\n        {\n            if (Palin_num(intToA(s, i)))    // 此时对应进制的数是回文数；\n            {\n                sum++;                      // 记录次数+1；\n            }\n        }\n        if (sum >= 2)                      \n            // 双重回文数，压入容器p中；\n        {\n            p.push_back(s);\n        }\n        s++; // 继续遍历；\n    }\n    for (int i = 0; i < p.size(); i++)\n    {\n        cout << p[i] << endl;\n    }\n    return 0;\n}\n",ACCEPTED,23,452
1411172150708813824,233c53001b026027b02e14c4bec52a0a7933764218364d9555d4b8dfeb071fc3,2021-07-03 11:57:13,C++,10.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint trans(int x,int n){\n    int temp=0;\n    int tn=1;\n    while(x!=0){\n        temp+=(x%n)*tn;\n        x/=n;\n        tn*=n;\n    }\n    return temp;\n}\nbool isRe(int x){\n    int temp1=x;\n    int after=0;\n    while(temp1!=0){\n        after=temp1%10+after*10;\n        temp1/=10;\n    }\n    if(after==x)\n        return true;\n    else return false;\n}\nint main(){\n    int n;\n    int i2;\n    cin>>n;\n    for(int i=1;i<=300;i++){\n        i2=i*i;\n        int re=trans(i2,n);\n        if(isRe(re)){\n            cout<<trans(i,n)<<\"" \""<<re<<endl;\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,34,444
1411178894646304768,233c53001b026027b02e14c4bec52a0a7933764218364d9555d4b8dfeb071fc3,2021-07-03 12:24:01,C++,10.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint trans(int x,int n){\n    int temp=0;\n    int tn=1;\n    while(x!=0){\n        temp+=(x%n)*tn;\n        x/=n;\n        tn*=n;\n    }\n    return temp;\n}\nbool isRe(int x){\n    int temp1=x;\n    int after=0;\n    while(temp1!=0){\n        after=temp1%10+after*10;\n        temp1/=10;\n    }\n    if(after==x)\n        return true;\n    else return false;\n}\nint main(){\n    int n;\n    int i2;\n    cin>>n;\n    for(int i=1;i<=300;i++){\n        i2=i*i;\n        int tri2=trans(i2,n);\n        if(isRe(tri2)){\n            cout<<trans(i,n)<<\"" \""<<tri2<<endl;\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,40,448
1411182367324495872,233c53001b026027b02e14c4bec52a0a7933764218364d9555d4b8dfeb071fc3,2021-07-03 12:37:49,C++,80.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nstring trans(int x,int n){\n    string temp=\""\"";\n    int p=1;\n    int mod;\n    if(n<=10){\n        while(x!=0){\n            temp=(char)(x%n+'0')+temp;\n            x/=n;\n        }\n    }\n    else{\n        while(x!=0){\n            mod=x%n;\n            if(mod<10){\n                temp=(char)('0'+mod)+temp;\n            }\n            else{\n                temp=(char)(mod-10+'A')+temp;\n            }\n            x/=n;\n        }\n    }\n    return temp;\n}\nbool isRe(string x){\n    int l=0,r=x.size()-1;\n    for(;l<r;l++,r--){\n        if(x[r]!=x[l])\n            return false;\n    }\n    return true;\n}\nint main(){\n    int n;\n    int i2;\n    cin>>n;\n    for(int i=1;i<=300;i++){\n        i2=i*i;\n        string tri2=trans(i2,n);\n        if(isRe(tri2)){\n            cout<<trans(i,n)<<\"" \""<<tri2<<endl;\n        }\n    }\n    return 0;\n}",ACCEPTED,45,568
1411188058646921216,233c53001b026027b02e14c4bec52a0a7933764218364d9555d4b8dfeb071fc3,2021-07-03 13:00:26,C++,60.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nstring trans(int x,int n){\n    string temp=\""\"";\n        while(x!=0){\n            temp=(char)(x%n+'0')+temp;\n            x/=n;\n        }\n    return temp;\n}\nbool isRe(string x){\n    int l=0,r=x.size()-1;\n    for(;l<r;l++,r--){\n        if(x[r]!=x[l])\n            return false;\n    }\n    return true;\n}\nbool isResult(int num){\n    int count=0;\n    for(int i=2;i<=10;i++)\n    {\n        string s=trans(num,i);\n        if(isRe(s)){\n            count++;\n        }\n        if(count>=2){\n            return true;\n        }\n    }\n    return false;\n}\nint main(){\n    int n,x;\n    cin>>n>>x;\n    int total=0;\n    for(int i=x+1;i<10000;i++){\n        if(isResult(i))\n        {\n            cout<<i<<endl;\n            total++;\n        }\n        if(total==n){\n            break;\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,42,324
1411188254873214976,233c53001b026027b02e14c4bec52a0a7933764218364d9555d4b8dfeb071fc3,2021-07-03 13:01:13,C++,10.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nstring trans(int x,int n){\n    string temp=\""\"";\n        while(x!=0){\n            temp=(char)(x%n+'0')+temp;\n            x/=n;\n        }\n    return temp;\n}\nbool isRe(string x){\n    int l=0,r=x.size()-1;\n    for(;l<r;l++,r--){\n        if(x[r]!=x[l])\n            return false;\n    }\n    return true;\n}\nbool isResult(int num){\n    int count=0;\n    for(int i=2;i<=10;i++)\n    {\n        string s=trans(num,i);\n        if(isRe(s)){\n            count++;\n        }\n        if(count>2){\n            return true;\n        }\n    }\n    return false;\n}\nint main(){\n    int n,x;\n    cin>>n>>x;\n    int total=0;\n    for(int i=x+1;i<10000;i++){\n        if(isResult(i))\n        {\n            cout<<i<<endl;\n            total++;\n        }\n        if(total==n){\n            break;\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,61,448
1411188578694479872,233c53001b026027b02e14c4bec52a0a7933764218364d9555d4b8dfeb071fc3,2021-07-03 13:02:30,C++,60.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nstring trans(int x,int n){\n    string temp=\""\"";\n        while(x!=0){\n            temp=(char)(x%n+'0')+temp;\n            x/=n;\n        }\n    return temp;\n}\nbool isRe(string x){\n    int l=0,r=x.size()-1;\n    for(;l<r;l++,r--){\n        if(x[r]!=x[l])\n            return false;\n    }\n    return true;\n}\nbool isResult(int num){\n    int count=0;\n    for(int i=2;i<=10;i++)\n    {\n        string s=trans(num,i);\n        if(isRe(s)){\n            count++;\n        }\n        if(count>=2){\n            return true;\n        }\n    }\n    return false;\n}\nint main(){\n    int n,x;\n    cin>>n>>x;\n    int total=0;\n    for(int i=x+1;i<=10000;i++){\n        if(isResult(i))\n        {\n            cout<<i<<endl;\n            total++;\n        }\n        if(total==n){\n            break;\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,37,460
1411259508208308224,233c53001b026027b02e14c4bec52a0a7933764218364d9555d4b8dfeb071fc3,2021-07-03 17:44:21,C++,60.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nstring trans(int x,int n){\n    string temp=\""\"";\n        while(x!=0){\n            temp=(char)(x%n+'0')+temp;\n            x/=n;\n        }\n    return temp;\n}\nbool isRe(string x){\n    int l=0,r=x.size()-1;\n    for(;l<r;l++,r--){\n        if(x[r]!=x[l])\n            return false;\n    }\n    return true;\n}\nbool isResult(int num){\n    int count=0;\n    for(int i=2;i<=10;i++)\n    {\n        string s=trans(num,i);\n        if(isRe(s)){\n            count++;\n        }\n        if(count>=2){\n            return true;\n        }\n    }\n    return false;\n}\nint main(){\n    int n,x;\n    cin>>n>>x;\n    int total=0;\n    for(int i=x+1;i<=10000;i++){\n        if(isResult(i))\n        {\n            cout<<i<<endl;\n            total++;\n        }\n        if(total==n){\n            break;\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,30,332
1411261053025378304,233c53001b026027b02e14c4bec52a0a7933764218364d9555d4b8dfeb071fc3,2021-07-03 17:50:29,C++,60.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nstring trans(int x,int n){\n    string temp=\""\"";\n    if(x==0)\n    {\n        return \""0\"";\n    }\n        while(x!=0){\n            temp=(char)(x%n+'0')+temp;\n            x/=n;\n        }\n    return temp;\n}\nbool isRe(string x){\n    int l=0,r=x.size()-1;\n    for(;l<r;l++,r--){\n        if(x[r]!=x[l])\n            return false;\n    }\n    return true;\n}\nbool isResult(int num){\n    int count=0;\n    for(int i=2;i<=10;i++)\n    {\n        string s=trans(num,i);\n        if(isRe(s)){\n            count++;\n        }\n        if(count>=2){\n            return true;\n        }\n    }\n    return false;\n}\nint main(){\n    int n,x;\n    cin>>n>>x;\n    int total=0;\n    for(int i=x+1;i<=10000;i++){\n        if(isResult(i))\n        {\n            cout<<i<<endl;\n            total++;\n        }\n        if(total==n){\n            break;\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,72,460
1411307035691859968,f5cb5932d20c698a3526eabae6154626f1544af344b40912de95db5f4a1806df,2021-07-03 20:53:12,C++,40.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <vector>\n#include <cmath>\nusing namespace std;\n\nclass wider_int{\nprivate:\n    int base;\npublic:\n    string value;\n    wider_int(int B){\n        base=B;\n    }\n    wider_int(int B,int v){\n        base=B;\n        this->base_B_10(v);\n    }\n    int base_10_B(){\n        int ret=0;\n        for(int i =0;i<this->value.size();i++){\n            if(this->value[i]>='0'&&this->value[i]<='9'){\n                ret+=(value[this->value.size()-i-1]-'0')*pow(this->base,i);\n            }\n            else{\n                ret+=(value[this->value.size()-i-1]-'A'+10)*pow(this->base,i);\n            }\n        }\n        return ret;\n    }\n    string operator*(wider_int A){\n        string s=this->value;\n        int n=this->base_10_B()*A.base_10_B();\n        base_B_10(n);\n        string ss=this->value;\n        this->value=s;\n        return ss;\n    }\n    void base_B_10(int n){\n        string temp_v;\n        while(n!=0){\n            int vi = n%(this->base);\n            if(vi<10){\n                temp_v=char(vi+'0')+temp_v;\n            }\n            else{\n                temp_v=char(vi+'A'-10)+temp_v;\n            }\n            n=n/base;\n        }\n        this->value=temp_v;\n    }\n};\n\nbool is_huiwen(string s){\n    bool check=true;\n    if(s.size()%2==0){\n        int si=s.size()/2;\n        for(int i = 0;si-i>=0;i++){\n            if(s[si-i-1]!=s[si+i]){\n                check=false;\n            }\n        }\n    }\n    else {\n        int si=s.size()/2;\n        for(int i = 0;si-i>=0;i++){\n            if(s[si-i]!=s[si+i]){\n                check=false;\n            }\n        }\n    }\n    return check;\n}\n\nint main(){\n    int B;\n    cin>>B;\n    for(int i=1;i<=300;i++){\n        wider_int wi(B,i);\n        string s=wi*wi;\n        if(is_huiwen(s)){\n            cout<<wi.value<<\"" \""<<s<<endl;\n        }\n    }\n}\n",PARTIAL_ACCEPTED,47,328
1411310738599186432,f5cb5932d20c698a3526eabae6154626f1544af344b40912de95db5f4a1806df,2021-07-03 21:07:55,C++,40.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <vector>\n#include <cmath>\nusing namespace std;\n\nclass wider_int{\nprivate:\n    int base;\npublic:\n    string value;\n    wider_int(int B){\n        base=B;\n    }\n    wider_int(int B,int v){\n        base=B;\n        this->base_B_10(v);\n    }\n    int base_10_B(){\n        int ret=0;\n        for(int i =0;i<this->value.size();i++){\n            if(this->value[this->value.size()-i-1]>='0'&&this->value[i]<='9'){\n                ret+=(value[this->value.size()-i-1]-'0')*pow(this->base,i);\n            }\n            else{\n                ret+=(value[this->value.size()-i-1]-'A'+10)*pow(this->base,i);\n            }\n        }\n        return ret;\n    }\n    string operator*(wider_int A){\n        string s=this->value;\n        int n=this->base_10_B()*A.base_10_B();\n        base_B_10(n);\n        string ss=this->value;\n        this->value=s;\n        return ss;\n    }\n    void base_B_10(int n){\n        string temp_v;\n        while(n!=0){\n            int vi = n%(this->base);\n            if(vi<10){\n                temp_v=char(vi+'0')+temp_v;\n            }\n            else{\n                temp_v=char(vi+'A'-10)+temp_v;\n            }\n            n=n/base;\n        }\n        this->value=temp_v;\n    }\n};\n\nbool is_huiwen(string s){\n    bool check=true;\n    if(s.size()%2==0){\n        int si=s.size()/2;\n        for(int i = 0;si-i>=0;i++){\n            if(s[si-i-1]!=s[si+i]){\n                check=false;\n            }\n        }\n    }\n    else {\n        int si=s.size()/2;\n        for(int i = 0;si-i>=0;i++){\n            if(s[si-i]!=s[si+i]){\n                check=false;\n            }\n        }\n    }\n    return check;\n}\n\nint main(){\n    int B;\n    cin>>B;\n    for(int i=1;i<=300;i++){\n        wider_int wi(B,i);\n        string s=wi*wi;\n        if(is_huiwen(s)){\n            cout<<wi.value<<\"" \""<<s<<endl;\n        }\n    }\n}\n",PARTIAL_ACCEPTED,38,484
1411311423332302848,f5cb5932d20c698a3526eabae6154626f1544af344b40912de95db5f4a1806df,2021-07-03 21:10:38,C++,80.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <vector>\n#include <cmath>\nusing namespace std;\n\nclass wider_int{\nprivate:\n    int base;\npublic:\n    string value;\n    wider_int(int B){\n        base=B;\n    }\n    wider_int(int B,int v){\n        base=B;\n        this->base_B_10(v);\n    }\n    int base_10_B(){\n        int ret=0;\n        for(int i =0;i<this->value.size();i++){\n            if(this->value[this->value.size()-i-1]>='0'&&this->value[this->value.size()-i-1]<='9'){\n                ret+=(value[this->value.size()-i-1]-'0')*pow(this->base,i);\n            }\n            else{\n                ret+=(value[this->value.size()-i-1]-'A'+10)*pow(this->base,i);\n            }\n        }\n        return ret;\n    }\n    string operator*(wider_int A){\n        string s=this->value;\n        int n=this->base_10_B()*A.base_10_B();\n        base_B_10(n);\n        string ss=this->value;\n        this->value=s;\n        return ss;\n    }\n    void base_B_10(int n){\n        string temp_v;\n        while(n!=0){\n            int vi = n%(this->base);\n            if(vi<10){\n                temp_v=char(vi+'0')+temp_v;\n            }\n            else{\n                temp_v=char(vi+'A'-10)+temp_v;\n            }\n            n=n/base;\n        }\n        this->value=temp_v;\n    }\n};\n\nbool is_huiwen(string s){\n    bool check=true;\n    if(s.size()%2==0){\n        int si=s.size()/2;\n        for(int i = 0;si-i>=0;i++){\n            if(s[si-i-1]!=s[si+i]){\n                check=false;\n            }\n        }\n    }\n    else {\n        int si=s.size()/2;\n        for(int i = 0;si-i>=0;i++){\n            if(s[si-i]!=s[si+i]){\n                check=false;\n            }\n        }\n    }\n    return check;\n}\n\nint main(){\n    int B;\n    cin>>B;\n    for(int i=1;i<=300;i++){\n        wider_int wi(B,i);\n        string s=wi*wi;\n        if(is_huiwen(s)){\n            cout<<wi.value<<\"" \""<<s<<endl;\n        }\n    }\n}\n",ACCEPTED,98,460
1411329286239293440,f5cb5932d20c698a3526eabae6154626f1544af344b40912de95db5f4a1806df,2021-07-03 22:21:37,C++,40.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <vector>\n#include <cmath>\nusing namespace std;\n\nstring base_10_B(int n,int base){\n    string temp_v;\n    while(n!=0){\n        int vi = n%(base);\n        if(vi<10){\n            temp_v=char(vi+'0')+temp_v;\n        }\n        else{\n            temp_v=char(vi+'A'-10)+temp_v;\n        }\n        n=n/base;\n    }\n    return temp_v;\n}\nbool is_huiwen(string s){\n    bool check=true;\n    if(s.size()%2==0){\n        int si=s.size()/2;\n        for(int i = 0;si-i>=0;i++){\n            if(s[si-i-1]!=s[si+i]){\n                check=false;\n            }\n        }\n    }\n    else {\n        int si=s.size()/2;\n        for(int i = 0;si-i>=0;i++){\n            if(s[si-i]!=s[si+i]){\n                check=false;\n            }\n        }\n    }\n    return check;\n}\n\nint main(){\n    int N;cin>>N;\n    int S;cin>>S;\n    int count=0,temp_S=S+1;\n    while(count<N){\n        int check=0;\n        for(int base=2;base<10;base++){\n            string str=base_10_B(temp_S,base);\n            if(is_huiwen(str)){\n                check++;\n            }\n            if(check>=2){\n                cout<<temp_S<<endl;\n                count++;\n                break;\n            }\n        }\n        temp_S++;\n    }\n\n}\n",PARTIAL_ACCEPTED,53,444
1411329550636040192,f5cb5932d20c698a3526eabae6154626f1544af344b40912de95db5f4a1806df,2021-07-03 22:22:40,C++,70.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <vector>\n#include <cmath>\nusing namespace std;\nstring base_10_B(int n,int base){\n    string temp_v;\n    while(n!=0){\n        int vi = n%(base);\n        if(vi<10){\n            temp_v=char(vi+'0')+temp_v;\n        }\n        else{\n            temp_v=char(vi+'A'-10)+temp_v;\n        }\n        n=n/base;\n    }\n    return temp_v;\n}\nbool is_huiwen(string s){\n    bool check=true;\n    if(s.size()%2==0){\n        int si=s.size()/2;\n        for(int i = 0;si-i>=0;i++){\n            if(s[si-i-1]!=s[si+i]){\n                check=false;\n            }\n        }\n    }\n    else {\n        int si=s.size()/2;\n        for(int i = 0;si-i>=0;i++){\n            if(s[si-i]!=s[si+i]){\n                check=false;\n            }\n        }\n    }\n    return check;\n}\n\nint main(){\n    int N;cin>>N;\n    int S;cin>>S;\n    int count=0,temp_S=S+1;\n    while(count<N){\n        int check=0;\n        for(int base=2;base<=10;base++){\n            string str=base_10_B(temp_S,base);\n            if(is_huiwen(str)){\n                check++;\n            }\n            if(check>=2){\n                cout<<temp_S<<endl;\n                count++;\n                break;\n            }\n        }\n        temp_S++;\n    }\n\n}\n",ACCEPTED,73,584
1411615539459395584,2b852a00162c52c0a3b6483ee3b9818e574b67f2ec8104c9d0532ad136a285a8,2021-07-04 17:19:05,C++,80.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm> \nusing namespace std;\n\nbool Palin_num(const string a)\n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1]) \n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1)\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring intToA(int n, int radix)\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\t\n        {\n            ans += t + '0';\n        }\n        else \n        {\n            ans += t - 10 + 'A';\n        }\n        n /= radix;\n    } while (n != 0);\n    reverse(ans.begin(), ans.end());\n    return ans;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    int j = 0;\n    for (int x = 1; x <= 300; x++)\n    {\n        j = x;\n        \n        string s1 = intToA(j, n);\n        string s2 = intToA((j * j), n);\n\n        if (Palin_num(s2))\n        {\n            cout << s1 << \"" \"" << s2 << endl;\n        }\n        else\n        {\n            continue;\n        }\n    }\n    return 0;\n}\n",ACCEPTED,36,328
1411626852675883008,2b852a00162c52c0a3b6483ee3b9818e574b67f2ec8104c9d0532ad136a285a8,2021-07-04 18:04:03,C++,70.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <iostream>  \n#include <vector>\n#include <string>  \n#include <algorithm>  \nusing namespace std;\n\nbool Palin_num(const string a)\n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1])\n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1)\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring intToA(int n, int radix)\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\n        {\n            ans += t + '0';\n        }\n        else\n        {\n            ans += t - 10 + 'A';\n        }\n        n /= radix;\n    } while (n != 0);\n    reverse(ans.begin(), ans.end());\n    return ans;\n}\n\nint main()\n{\n    int n, s;\n    cin >> n >> s;\n    s++;\n    vector<int> p;\n    int sum;\n    while ((p.size() < n))\n    {\n        sum = 0;\n        for (int i = 2; i <= 10; i++)\n        {\n            if (Palin_num(intToA(s, i)))\n            {\n                sum++;\n            }\n        }\n        if (sum >= 2)\n        {\n            p.push_back(s);\n        }\n        s++;\n    }\n    for (int i = 0; i < p.size(); i++)\n    {\n        cout << p[i] << endl;\n    }\n    return 0;\n}\n",ACCEPTED,40,320
1411667801045078016,135ea6214ee4636f994fa1d559c4a1500b58aa0eb3171a11cf5170d92b0343a6,2021-07-04 20:46:45,C++,30.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<algorithm>\n#include <sstream>\nusing namespace std;\nbool is_huiwen(int n){\n    int tt=n;\n    stringstream ss;\n    string str;\n    ss<<tt;\n    ss>>str;\n    int len=str.length();\n    string str1=str;\n    reverse(str.begin(),str.end());\n    if (str1==str){\n        return true;\n    }\n    return false;\n}\nint tran(int n,int b){\n    int tt=n;\n    string str=\""\"";\n    while(tt){\n        int a=tt%b;\n        tt/=b;//重要，若是一位数，直接+‘0’，两位数重新来 \n        stringstream ss;\n        string s1;\n        ss<<a;\n        ss>>s1;\n\t\tstr=s1+str;\n    }\n    stringstream ss;\n    ss<<str;\n    int nn;\n    ss>>nn;\n    return nn;\n}\nint main()\n{\n    int b;\n    cin>>b;\n    for (int i=1;i<=300;i++){\n        int n=i*i;\n        int nn=tran(n,b);\n        if (is_huiwen(nn)){\n            cout<<tran(i,b)<<\"" \""<<nn<<endl;\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,54,468
1411668454799134720,135ea6214ee4636f994fa1d559c4a1500b58aa0eb3171a11cf5170d92b0343a6,2021-07-04 20:49:21,C++,10.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<algorithm>\n#include <sstream>\nusing namespace std;\nbool is_huiwen(int n){\n    int tt=n;\n    stringstream ss;\n    string str;\n    ss<<tt;\n    ss>>str;\n    int len=str.length();\n    string str1=str;\n    reverse(str.begin(),str.end());\n    if (str1==str){\n        return true;\n    }\n    return false;\n}\nint tran(int n,int b){\n    int tt=n;\n    string str=\""\"";\n    while(tt){\n        int a=tt%b;\n        tt/=b;//重要，若是一位数，直接+‘0’，两位数重新来 \n        stringstream ss;\n        string s1;\n        ss<<a;\n        ss>>s1;\n\t\tstr=s1+str;\n    }\n    stringstream ss;\n    ss<<str;\n    int nn;\n    ss>>nn;\n    return nn;\n}\nint main()\n{\n    int b;\n    cin>>b;\n    for (int i=1;i<=300;i++){\n        int n=tran(i,b)*tran(i,b);\n        int nn=tran(n,b);\n        if (is_huiwen(nn)){\n            cout<<tran(i,b)<<\"" \""<<nn<<endl;\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,88,448
1411669286177292288,135ea6214ee4636f994fa1d559c4a1500b58aa0eb3171a11cf5170d92b0343a6,2021-07-04 20:52:40,C++,30.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<algorithm>\n#include <sstream>\nusing namespace std;\nbool is_huiwen(int n){\n    int tt=n;\n    stringstream ss;\n    string str;\n    ss<<tt;\n    ss>>str;\n    int len=str.length();\n    string str1=str;\n    reverse(str.begin(),str.end());\n    if (str1==str){\n        return true;\n    }\n    return false;\n}\nint tran(int n,int b){\n    int tt=n;\n    string str=\""\"";\n    while(tt){\n        int a=tt%b;\n        tt/=b;//重要，若是一位数，直接+‘0’，两位数重新来 \n        stringstream ss;\n        string s1;\n        ss<<a;\n        ss>>s1;\n\t\tstr=s1+str;\n    }\n    stringstream ss;\n    ss<<str;\n    int nn;\n    ss>>nn;\n    return nn;\n}\nint main()\n{\n    int b;\n    cin>>b;\n    for (int i=1;i<=300;i++){\n        int n=i*i;\n        int nn=tran(n,b);\n        if (is_huiwen(nn)){\n            cout<<tran(i,b)<<\"" \""<<nn<<endl;\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,44,324
1411681464322179072,135ea6214ee4636f994fa1d559c4a1500b58aa0eb3171a11cf5170d92b0343a6,2021-07-04 21:41:03,C++,80.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<algorithm>\n#include <sstream>\nusing namespace std;\nbool is_huiwen(string s1){\n    int len=s1.length();\n    string str1=s1;\n    reverse(str1.begin(),str1.end());\n    if (str1==s1){\n        return true;\n    }\n    return false;\n}\nstring intToA(int n,int radix){\n  \n    string ans=\""\"";\n    while(n!=0){\n        int t=n%radix;\n        //重要，若是一位数，直接+‘0’，两位数重新来 \n        if (t>=0&&t<=9) ans+=t+'0';//这里不能是str=str+a+'0' \n        else{\n\t\t ans+=t-10+'A';}//重要：这不能写成t-10+'0'+'A'\n        n/=radix;\n    }\n    reverse(ans.begin(),ans.end());\n    return ans;\n}\n//string intToA(int n, int radix)    //进制转换函数，使用模N取余法；\n//{\n//    string ans = \""\"";\n//    while (n != 0){\n//\t\n//    \n//        int t = n % radix;\n//        if (t >= 0 && t <= 9)\t\n//        {\n//            ans += t + '0';\n//        }\n//        else \n//        {\n//            ans += t - 10 + 'A'; // 保证进制大于10时，数字能用大写字母表示；\n//        }\n//        n /= radix;\n//    }\t// 使用do{}while（），以防止输入为0的情况；\n//    reverse(ans.begin(), ans.end());  // 模N取余法，得到的字符串反转即可得到对应进制的数；\n//    return ans;\n//}\nint main()\n{\n    int b;\n    cin>>b;\n    for (int i=1;i<=300;i++){\n        int nn=i*i;\n        if (is_huiwen(intToA(nn,b))){\n        \tcout<<intToA(i,b)<<\"" \""<<intToA(nn,b)<<endl;\n\t\t}\n    }\n}",ACCEPTED,31,328
1411899744186220544,135ea6214ee4636f994fa1d559c4a1500b58aa0eb3171a11cf5170d92b0343a6,2021-07-05 12:08:25,C++,50.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include<iostream>\n#include <algorithm>\nusing namespace std; \nbool is_huiwen(string s1){\n    string str1=s1;\n    reverse(str1.begin(),str1.end());\n    if (str1==s1){\n        return true;\n    }\n    return false;\n}\nstring tran(int n,int radix){\n  \n    string ans=\""\"";\n    while(n!=0){\n        int t=n%radix;\n        //重要，若是一位数，直接+‘0’，两位数重新来 \n        if (t>=0&&t<=9) ans+=t+'0';//这里不能是str=str+a+'0' \n        else{\n\t\t ans+=t-10+'A';}//重要：这不能写成t-10+'0'+'A'\n        n/=radix;\n    }\n    reverse(ans.begin(),ans.end());\n    return ans;\n}\nint main()\n{\n    int n;\n    cin>>n;\n    int num;\n    cin>>num;\n    int count0=0;\n    for (int i=num+1;i<num+num;i++){\n        int count=0;\n        for (int j=2;j<=10;j++){\n            if (is_huiwen(tran(i,j))){\n                count++;\n            }\n            if (count==2){\n                cout<<i<<endl;\n                count0++;\n                break;\n            }\n        }\n        if (count0==n){\n            return 0;\n        }\n    }\n}\n",PARTIAL_ACCEPTED,36,456
1411900175297773568,135ea6214ee4636f994fa1d559c4a1500b58aa0eb3171a11cf5170d92b0343a6,2021-07-05 12:10:08,C++,0.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include<iostream>\n#include <algorithm>\nusing namespace std; \nbool is_huiwen(string s1){\n    string str1=s1;\n    reverse(str1.begin(),str1.end());\n    if (str1==s1){\n        return true;\n    }\n    return false;\n}\nstring tran(int n,int radix){\n  \n    string ans=\""\"";\n    while(n!=0){\n        int t=n%radix;\n        //重要，若是一位数，直接+‘0’，两位数重新来 \n        if (t>=0&&t<=9) ans+=t+'0';//这里不能是str=str+a+'0' \n        else{\n\t\t ans+=t-10+'A';}//重要：这不能写成t-10+'0'+'A'\n        n/=radix;\n    }\n    reverse(ans.begin(),ans.end());\n    return ans;\n}\nint main()\n{\n    int n;\n    cin>>n;\n    int num;\n    cin>>num;\n    int count0=0;\n    for (int i=num+1;i<num+num;i++){\n        int count=0;\n        for (int j=2;j<=10;j++){\n            if (is_huiwen(tran(i,j))){\n                count++;\n            }\n            if (count>2){\n                cout<<i<<endl;\n                count0++;\n                break;\n            }\n        }\n        if (count0==n){\n            return 0;\n        }\n    }\n}\n",WRONG_ANSWER,45,456
1411900497650991104,135ea6214ee4636f994fa1d559c4a1500b58aa0eb3171a11cf5170d92b0343a6,2021-07-05 12:11:25,C++,50.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include<iostream>\n#include <algorithm>\nusing namespace std; \nbool is_huiwen(string s1){\n    string str1=s1;\n    reverse(str1.begin(),str1.end());\n    if (str1==s1){\n        return true;\n    }\n    return false;\n}\nstring tran(int n,int radix){\n  \n    string ans=\""\"";\n    while(n!=0){\n        int t=n%radix;\n        //重要，若是一位数，直接+‘0’，两位数重新来 \n        if (t>=0&&t<=9) ans+=t+'0';//这里不能是str=str+a+'0' \n        else{\n\t\t ans+=t-10+'A';}//重要：这不能写成t-10+'0'+'A'\n        n/=radix;\n    }\n    reverse(ans.begin(),ans.end());\n    return ans;\n}\nint main()\n{\n    int n;\n    cin>>n;\n    int num;\n    cin>>num;\n    int count0=0;\n    for (int i=num+1;i<num+num;i++){\n        int count=0;\n        for (int j=2;j<=10;j++){\n            if (is_huiwen(tran(i,j))){\n                count++;\n            }\n            if (count>=2){\n                cout<<i<<endl;\n                count0++;\n                break;\n            }\n        }\n        if (count0==n){\n            return 0;\n        }\n    }\n}\n",PARTIAL_ACCEPTED,34,436
1411902574863286272,135ea6214ee4636f994fa1d559c4a1500b58aa0eb3171a11cf5170d92b0343a6,2021-07-05 12:19:40,C++,50.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include<iostream>\n#include <algorithm>\nusing namespace std; \nbool is_huiwen(string s1){\n    string str1=s1;\n    reverse(str1.begin(),str1.end());\n    if (str1==s1){\n        return true;\n    }\n    return false;\n}\nstring tran(int n,int radix){\n  \n    string ans=\""\"";\n    while(n!=0){\n        int t=n%radix;\n        //重要，若是一位数，直接+‘0’，两位数重新来 \n        if (t>=0&&t<=9) ans+=t+'0';//这里不能是str=str+a+'0' \n        else{\n\t\t ans+=t-10+'A';}//重要：这不能写成t-10+'0'+'A'\n        n/=radix;\n    }\n    reverse(ans.begin(),ans.end());\n    return ans;\n}\nint main()\n{\n    int n;\n    cin>>n;\n    int num;\n    cin>>num;\n    int count0=0;\n    for (int i=num+1;i<num+1000;i++){\n        int count=0;\n        for (int j=2;j<=10;j++){\n            if (is_huiwen(tran(i,j))){\n                count++;\n            }\n            if (count==2){\n                cout<<i<<endl;\n                count0++;\n                break;\n            }\n        }\n        if (count0==n){\n            return 0;\n        }\n    }\n\n}\n",PARTIAL_ACCEPTED,39,336
1411902624154738688,135ea6214ee4636f994fa1d559c4a1500b58aa0eb3171a11cf5170d92b0343a6,2021-07-05 12:19:52,C++,70.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include<iostream>\n#include <algorithm>\nusing namespace std; \nbool is_huiwen(string s1){\n    string str1=s1;\n    reverse(str1.begin(),str1.end());\n    if (str1==s1){\n        return true;\n    }\n    return false;\n}\nstring tran(int n,int radix){\n  \n    string ans=\""\"";\n    while(n!=0){\n        int t=n%radix;\n        //重要，若是一位数，直接+‘0’，两位数重新来 \n        if (t>=0&&t<=9) ans+=t+'0';//这里不能是str=str+a+'0' \n        else{\n\t\t ans+=t-10+'A';}//重要：这不能写成t-10+'0'+'A'\n        n/=radix;\n    }\n    reverse(ans.begin(),ans.end());\n    return ans;\n}\nint main()\n{\n    int n;\n    cin>>n;\n    int num;\n    cin>>num;\n    int count0=0;\n    for (int i=num+1;i<num+10000;i++){\n        int count=0;\n        for (int j=2;j<=10;j++){\n            if (is_huiwen(tran(i,j))){\n                count++;\n            }\n            if (count==2){\n                cout<<i<<endl;\n                count0++;\n                break;\n            }\n        }\n        if (count0==n){\n            return 0;\n        }\n    }\n\n}\n",ACCEPTED,76,324
1411902857525813248,135ea6214ee4636f994fa1d559c4a1500b58aa0eb3171a11cf5170d92b0343a6,2021-07-05 12:20:47,C++,70.0,1410764822045835272,1267449136707624960,1049226397448056832,"//需要注意的是比num大的值该如何取，最好是从num到num+10000\n#include<iostream>\n#include <algorithm>\nusing namespace std; \nbool is_huiwen(string s1){\n    string str1=s1;\n    reverse(str1.begin(),str1.end());\n    if (str1==s1){\n        return true;\n    }\n    return false;\n}\nstring tran(int n,int radix){\n  \n    string ans=\""\"";\n    while(n!=0){\n        int t=n%radix;\n        //重要，若是一位数，直接+‘0’，两位数重新来 \n        if (t>=0&&t<=9) ans+=t+'0';//这里不能是str=str+a+'0' \n        else{\n\t\t ans+=t-10+'A';}//重要：这不能写成t-10+'0'+'A'\n        n/=radix;\n    }\n    reverse(ans.begin(),ans.end());\n    return ans;\n}\nint main()\n{\n    int n;\n    cin>>n;\n    int num;\n    cin>>num;\n    int count0=0;\n    for (int i=num+1;i<num+10000;i++){\n        int count=0;\n        for (int j=2;j<=10;j++){\n            if (is_huiwen(tran(i,j))){\n                count++;\n            }\n            if (count==2){\n                cout<<i<<endl;\n                count0++;\n                break;\n            }\n        }\n        if (count0==n){\n            return 0;\n        }\n    }\n\n}\n",ACCEPTED,87,448
1412314998518128640,2e6408e9b1bffdadbe2dea9481109038e625a851ee3b91f2e6c89204675d6077,2021-07-06 15:38:29,C++,10.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\nusing namespace std;\nbool huiwen(string s);\nstring jinzhi(int num,int tar);\nint main()\n{\n   int n=0;\n   cin>>n;\n   vector <string> res;\n   string ans=\""\"",str=\""\"";\n   for (int i=1;i<301;i++)\n   {\n      ans.clear();\n      str=jinzhi(i*i,n);\n      if(huiwen(str))\n      {\n         ans+=to_string(i);\n         for (int i=0;i<str.size();i++)\n         {\n            if(str[i]==' ')\n            {\n               str.erase(i,1);\n            }\n         }\n         ans=ans+\"" \""+str;\n         res.push_back(ans);\n      }\n   }\n   for (int i=0;i<res.size();i++)\n   {\n      cout<<res[i]<<endl;\n   }\n   return 0;\n}\nbool huiwen(string s)\n{\n   string ss=\""\"";\n   for (int i=s.size()-1;i>=0;i--)\n   {\n      ss+=s[i];\n   }\n   if (ss==s)\n   {\n      return true;\n   }\n   return false;\n}\nstring jinzhi(int num,int tar)\n{\n   string res=\""\"";\n   int num2=num,num3=num;\n   while (num3!=0)\n   {\n      num2=num3%tar;\n      res=res+to_string(num2)+\"" \"";\n      num3=num3/tar;\n   }\n   reverse(res.begin(),res.end());\n   res.erase(0,1);\n   return res;\n}",PARTIAL_ACCEPTED,39,436
1412316175695683584,2e6408e9b1bffdadbe2dea9481109038e625a851ee3b91f2e6c89204675d6077,2021-07-06 15:43:10,C++,50.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\nusing namespace std;\nbool huiwen(string s);\nstring jinzhi(int num,int tar);\nint main()\n{\n   int n=0;\n   cin>>n;\n   vector <string> res;\n   string ans=\""\"",str1=\""\"",str2=\""\"";\n   for (int i=1;i<301;i++)\n   {\n      ans.clear();\n      str1=jinzhi(i*i,n);\n      str2=jinzhi(i,n);\n      if(huiwen(str1))\n      {\n         for (int i=0;i<str2.size();i++)\n         {\n            if(str2[i]==' ')\n            {\n               str2.erase(i,1);\n            }\n         }\n         ans+=str2;\n         for (int i=0;i<str1.size();i++)\n         {\n            if(str1[i]==' ')\n            {\n               str1.erase(i,1);\n            }\n         }\n         ans=ans+\"" \""+str1;\n         res.push_back(ans);\n      }\n   }\n   for (int i=0;i<res.size();i++)\n   {\n      cout<<res[i]<<endl;\n   }\n   return 0;\n}\nbool huiwen(string s)\n{\n   string ss=\""\"";\n   for (int i=s.size()-1;i>=0;i--)\n   {\n      ss+=s[i];\n   }\n   if (ss==s)\n   {\n      return true;\n   }\n   return false;\n}\nstring jinzhi(int num,int tar)\n{\n   string res=\""\"";\n   int num2=num,num3=num;\n   while (num3!=0)\n   {\n      num2=num3%tar;\n      res=res+to_string(num2)+\"" \"";\n      num3=num3/tar;\n   }\n   reverse(res.begin(),res.end());\n   res.erase(0,1);\n   return res;\n}",PARTIAL_ACCEPTED,73,504
1412321492764520448,2e6408e9b1bffdadbe2dea9481109038e625a851ee3b91f2e6c89204675d6077,2021-07-06 16:04:18,C++,80.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\nusing namespace std;\nbool huiwen(string s);\nstring jinzhi(int num,int tar);\nint main()\n{\n   int n=0;\n   cin>>n;\n   vector <string> res;\n   string ans=\""\"",str1=\""\"",str2=\""\"";\n   for (int i=1;i<301;i++)\n   {\n      ans.clear();\n      str1=jinzhi(i*i,n);\n      str2=jinzhi(i,n);\n      if(huiwen(str1))\n      {\n         for (int i=0;i<str2.size();i++)\n         {\n            if(str2[i]==' ')\n            {\n               str2.erase(i,1);\n            }\n         }\n         ans+=str2;\n         for (int i=0;i<str1.size();i++)\n         {\n            if(str1[i]==' ')\n            {\n               str1.erase(i,1);\n            }\n         }\n         ans=ans+\"" \""+str1;\n         res.push_back(ans);\n      }\n   }\n   for (int i=0;i<res.size();i++)\n   {\n      cout<<res[i]<<endl;\n   }\n   return 0;\n}\nbool huiwen(string s)\n{\n   string ss=\""\"";\n   for (int i=s.size()-1;i>=0;i--)\n   {\n      ss+=s[i];\n   }\n   if (ss==s)\n   {\n      return true;\n   }\n   return false;\n}\nstring jinzhi(int num,int tar)\n{\n   string res=\""\"";\n   int num2=num,num3=num;\n   while (num3!=0)\n   {\n      num2=num3%tar;\n      string str1=to_string(num2);\n      if(num2>=10)\n      {\n         if (num2==10){\n            str1=\""A\"";\n         }\n         else if (num2==11){\n            str1=\""B\"";\n         }\n         else if (num2==12){\n            str1=\""C\"";\n         }\n         else if (num2==13){\n            str1=\""D\"";\n         }\n         else if (num2==14){\n            str1=\""E\"";\n         }\n         else if (num2==15){\n            str1=\""F\"";\n         }\n         if (num2==16){\n            str1=\""G\"";\n         }\n         if (num2==17){\n            str1=\""H\"";\n         }\n         else if (num2==18){\n            str1=\""I\"";\n         }\n         else if (num2==19){\n            str1=\""J\"";\n         }\n      }\n      res=res+str1+\"" \"";\n      num3=num3/tar;\n   }\n   reverse(res.begin(),res.end());\n   res.erase(0,1);\n   return res;\n}",ACCEPTED,51,588
1412338173515735040,2e6408e9b1bffdadbe2dea9481109038e625a851ee3b91f2e6c89204675d6077,2021-07-06 17:10:35,C++,70.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <string>\n#include <algorithm>\nusing namespace std;\nbool huiwen(string s);\nstring jinzhi(int num,int tar);\nint main()\n{\n  int n,num=0;\n  cin>>n;\n  cin>>num;\n  vector<int>res;\n  while (res.size()!=n)\n  {\n     num+=1;\n     int p=0;\n     for (int i=2;i<=10;i++)\n     {\n        if(huiwen(jinzhi(num,i)))\n        {\n           p+=1;\n        }\n         if(p==2)\n         {\n            res.push_back(num);\n            break;\n         }\n     }\n  }\n  for (int i=0;i<n;i++)\n  {\n     cout<<res[i]<<endl;\n  }\n  return 0;\n}\nbool huiwen(string s)\n{\n   string ss=\""\"";\n   for (int i=s.size()-1;i>=0;i--)\n   {\n      ss+=s[i];\n   }\n   if (ss==s)\n   {\n      return true;\n   }\n   return false;\n}\nstring jinzhi(int num,int tar)\n{\n   string res=\""\"";\n   int num2=num,num3=num;\n   while (num3!=0)\n   {\n      num2=num3%tar;\n      string str1=to_string(num2);\n      if(num2>=10)\n      {\n         if (num2==10){\n            str1=\""A\"";\n         }\n         else if (num2==11){\n            str1=\""B\"";\n         }\n         else if (num2==12){\n            str1=\""C\"";\n         }\n         else if (num2==13){\n            str1=\""D\"";\n         }\n         else if (num2==14){\n            str1=\""E\"";\n         }\n         else if (num2==15){\n            str1=\""F\"";\n         }\n         if (num2==16){\n            str1=\""G\"";\n         }\n         if (num2==17){\n            str1=\""H\"";\n         }\n         else if (num2==18){\n            str1=\""I\"";\n         }\n         else if (num2==19){\n            str1=\""J\"";\n         }\n      }\n      res=res+str1+\"" \"";\n      num3=num3/tar;\n   }\n   reverse(res.begin(),res.end());\n   res.erase(0,1);\n   return res;\n}",ACCEPTED,70,444
1412392474486202368,b62fca25a940119316ea331e15c36cb6c97a5fa457e96218d875d56d3b505f12,2021-07-06 20:46:21,C++,10.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n\n#include <string>\n#include <vector>\n#include <map>\n\nstatic map<int, string> Num;\n\nstring f(int num, int N);\n\n\nint main() {\n\tNum[0] = \""0\"";\n\tNum[1] = \""1\"";\n\tNum[2] = \""2\"";\n\tNum[3] = \""3\"";\n\tNum[4] = \""4\"";\n\tNum[5] = \""5\"";\n\tNum[6] = \""6\"";\n\tNum[7] = \""7\"";\n\tNum[8] = \""8\"";\n\tNum[9] = \""9\"";\n\tNum[10] = \""A\"";\n\tNum[11] = \""B\"";\n\tNum[12] = \""C\"";\n\tNum[13] = \""D\"";\n\tNum[14] = \""E\"";\n\tNum[15] = \""F\"";\n\tNum[16] = \""G\"";\n\tNum[17] = \""H\"";\n\tNum[18] = \""I\"";\n\tNum[19] = \""J\"";\n\n\tint N;\n\tcin >> N;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tstring str = f(i*i, N);\n\t\tbool istrue = true;\n\t\tfor (int j = 0, k = str.size() - 1; j < k; j++, k--) {\n\t\t\tif (str[j] != str[k]) {\n\t\t\t\tistrue = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (istrue) {\n\t\t\tcout << i << \"" \"" << i * i << endl;\n\t\t}\n\t}\n}\n\n\nstring f(int num, int N) {\n\tstring str;\n\twhile (num != 0) {\n\t\tstr = Num[num % N] + str;\n\t\tnum /= N;\n\t}\n\treturn str;\n}\n\n\n\n",PARTIAL_ACCEPTED,109,592
1412392744367759360,b62fca25a940119316ea331e15c36cb6c97a5fa457e96218d875d56d3b505f12,2021-07-06 20:47:25,C++,80.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n\n#include <string>\n#include <vector>\n#include <map>\n\nstatic map<int, string> Num;\n\nstring f(int num, int N);\n\n\nint main() {\n\tNum[0] = \""0\"";\n\tNum[1] = \""1\"";\n\tNum[2] = \""2\"";\n\tNum[3] = \""3\"";\n\tNum[4] = \""4\"";\n\tNum[5] = \""5\"";\n\tNum[6] = \""6\"";\n\tNum[7] = \""7\"";\n\tNum[8] = \""8\"";\n\tNum[9] = \""9\"";\n\tNum[10] = \""A\"";\n\tNum[11] = \""B\"";\n\tNum[12] = \""C\"";\n\tNum[13] = \""D\"";\n\tNum[14] = \""E\"";\n\tNum[15] = \""F\"";\n\tNum[16] = \""G\"";\n\tNum[17] = \""H\"";\n\tNum[18] = \""I\"";\n\tNum[19] = \""J\"";\n\n\tint N;\n\tcin >> N;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tstring str = f(i*i, N);\n\t\tbool istrue = true;\n\t\tfor (int j = 0, k = str.size() - 1; j < k; j++, k--) {\n\t\t\tif (str[j] != str[k]) {\n\t\t\t\tistrue = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (istrue) {\n\t\t\tcout << f(i,N) << \"" \"" << str << endl;\n\t\t}\n\t}\n}\n\n\nstring f(int num, int N) {\n\tstring str;\n\twhile (num != 0) {\n\t\tstr = Num[num % N] + str;\n\t\tnum /= N;\n\t}\n\treturn str;\n}\n\n\n\n",ACCEPTED,105,456
1412396412974460928,b62fca25a940119316ea331e15c36cb6c97a5fa457e96218d875d56d3b505f12,2021-07-06 21:02:00,C++,10.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\n#include <string>\n#include <vector>\n#include <map>\n\nstatic map<int, string> Num;\n\nstring f(int num, int N);\n\nint main() {\n\tNum[0] = \""0\"";\n\tNum[1] = \""1\"";\n\tNum[2] = \""2\"";\n\tNum[3] = \""3\"";\n\tNum[4] = \""4\"";\n\tNum[5] = \""5\"";\n\tNum[6] = \""6\"";\n\tNum[7] = \""7\"";\n\tNum[8] = \""8\"";\n\tNum[9] = \""9\"";\n\n\n\tint N, S;\n\tcin >> N >> S;\n\twhile (N > 0) {\n\t\tS++;\n\t\tint time = 0;\n\t\tfor (int i = 2; i <= 10; i++) {\n\t\t\tstring str = f(S,i);\n\t\t\tbool istrue = true;\n\t\t\tfor (int j = 0, k = str.size() - 1; j < k; j++, k--) {\n\t\t\t\tif (str[j] != str[k]) {\n\t\t\t\t\tistrue = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (istrue) time++;\n\t\t\tif (time > 2) break;\n\t\t}\n\t\tif (time > 2) {\n\t\t\tcout << S << endl;\n\t\t\tN--;\n\t\t}\n\t}\n}\n\n\nstring f(int num, int N) {\n\tstring str;\n\twhile (num != 0) {\n\t\tstr = Num[num % N] + str;\n\t\tnum /= N;\n\t}\n\treturn str;\n}",PARTIAL_ACCEPTED,92,440
1412397406635384832,b62fca25a940119316ea331e15c36cb6c97a5fa457e96218d875d56d3b505f12,2021-07-06 21:05:57,C++,0.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\n#include <string>\n#include <vector>\n#include <map>\n\nstatic map<int, string> Num;\n\nbool f(int num, int N);\n\nint main() {\n\tNum[0] = \""0\"";\n\tNum[1] = \""1\"";\n\tNum[2] = \""2\"";\n\tNum[3] = \""3\"";\n\tNum[4] = \""4\"";\n\tNum[5] = \""5\"";\n\tNum[6] = \""6\"";\n\tNum[7] = \""7\"";\n\tNum[8] = \""8\"";\n\tNum[9] = \""9\"";\n\n\n\tint N, S;\n\tcin >> N >> S;\n\twhile (N > 0) {\n\t\tS++;\n\t\tint time = 0;\n\t\tfor (int i = 2; i <= 10; i++) {\n\t\t\tif (f(S,i)) time++;\n\t\t\tif (time > 2) break;\n\t\t}\n\t\tif (time > 2) {\n\t\t\tcout << S << endl;\n\t\t\tN--;\n\t\t}\n\t}\n}\n\n\nbool f(int num, int N) {\n\tstring str;\n\tint len;\n\twhile (num != 0) {\n\t\tstr = Num[num % N] + str;\n\t\tlen++;\n\t\tnum /= N;\n\t\tif (len == 1 && str == \""0\"") return false;\n\t}\n\tfor (int j = 0, k = len; j < k; j++, k--) {\n\t\tif (str[j] != str[k]) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}",TIME_LIMIT_EXCEEDED,0,0
1412397484996632576,b62fca25a940119316ea331e15c36cb6c97a5fa457e96218d875d56d3b505f12,2021-07-06 21:06:16,C++,10.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\n#include <string>\n#include <vector>\n#include <map>\n\nstatic map<int, string> Num;\n\nbool f(int num, int N);\n\nint main() {\n\tNum[0] = \""0\"";\n\tNum[1] = \""1\"";\n\tNum[2] = \""2\"";\n\tNum[3] = \""3\"";\n\tNum[4] = \""4\"";\n\tNum[5] = \""5\"";\n\tNum[6] = \""6\"";\n\tNum[7] = \""7\"";\n\tNum[8] = \""8\"";\n\tNum[9] = \""9\"";\n\n\n\tint N, S;\n\tcin >> N >> S;\n\twhile (N > 0) {\n\t\tS++;\n\t\tint time = 0;\n\t\tfor (int i = 2; i <= 10; i++) {\n\t\t\tif (f(S,i)) time++;\n\t\t\tif (time > 2) break;\n\t\t}\n\t\tif (time > 2) {\n\t\t\tcout << S << endl;\n\t\t\tN--;\n\t\t}\n\t}\n}\n\n\nbool f(int num, int N) {\n\tstring str;\n\tint len;\n\twhile (num != 0) {\n\t\tstr = Num[num % N] + str;\n\t\tlen++;\n\t\tnum /= N;\n\t\tif (len == 1 && str == \""0\"") return false;\n\t}\n\tfor (int j = 0, k = len-1; j < k; j++, k--) {\n\t\tif (str[j] != str[k]) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}",PARTIAL_ACCEPTED,83,452
1412399352489504768,b62fca25a940119316ea331e15c36cb6c97a5fa457e96218d875d56d3b505f12,2021-07-06 21:13:41,C++,70.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <iostream>\n\nusing namespace std;\n\n#include <string>\n#include <vector>\n#include <map>\n\nstatic map<int, string> Num;\n\nbool f(int num, int N);\n\nint main() {\n\tNum[0] = \""0\"";\n\tNum[1] = \""1\"";\n\tNum[2] = \""2\"";\n\tNum[3] = \""3\"";\n\tNum[4] = \""4\"";\n\tNum[5] = \""5\"";\n\tNum[6] = \""6\"";\n\tNum[7] = \""7\"";\n\tNum[8] = \""8\"";\n\tNum[9] = \""9\"";\n\n\n\tint N, S;\n\tcin >> N >> S;\n\twhile (N > 0) {\n\t\tS++;\n\t\tint time = 0;\n\t\tfor (int i = 2; i <= 10; i++) {\n\t\t\tif (f(S,i)) time++;\n\t\t\tif (time >= 2) break;\n\t\t}\n\t\tif (time >= 2) {\n\t\t\tcout << S << endl;\n\t\t\tN--;\n\t\t}\n\t}\n}\n\n\nbool f(int num, int N) {\n\tstring str;\n\tint len{};\n\twhile (num != 0) {\n\t\tstr = Num[num % N] + str;\n\t\tlen++;\n\t\tnum /= N;\n\t\tif (len == 1 && str == \""0\"") return false;\n\t}\n\tfor (int j = 0, k = len-1; j < k; j++, k--) {\n\t\tif (str[j] != str[k]) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}",ACCEPTED,43,328
1413039314378608640,bcceb5f830c52ad75d96832f6171f3ffc147f7e20a5d9f7b206e4378d3b11e74,2021-07-08 15:36:40,C++,0.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<bits/stdc++.h>\nusing namespace std;\n//输出从1-300 的 在b进制下的 第二个数是是第一个数的平方而且它自身是回文数\n\n    bool isPalindrome(int x) {\n            int sum=0;\n            if(x<0 || (x/10!=0 && x%10==0))\n                return false;\n            else{\n               while(x>sum){\n                   sum  = sum * 10 + x%10;\n                   x = x/10;\n               }\n            }\n            if(sum == x)  return true;\n            if(sum/10 == x)return true;\n            return false;\n        }\n\nint main()\n{\n    int base = 0;\n    int square = 0;\n    cin>>base;\n    for(int i =2 ;i<300;i++){\n        square = i*i;\n        if(isPalindrome(square))\n            cout<<i<<\"" \""<<i*i<<endl;\n    }\n    return 0;\n}\n",WRONG_ANSWER,47,472
1413039444431392768,bcceb5f830c52ad75d96832f6171f3ffc147f7e20a5d9f7b206e4378d3b11e74,2021-07-08 15:37:11,C++,10.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<bits/stdc++.h>\nusing namespace std;\n//输出从1-300 的 在b进制下的 第二个数是是第一个数的平方而且它自身是回文数\n\n    bool isPalindrome(int x) {\n            int sum=0;\n            if(x<0 || (x/10!=0 && x%10==0))\n                return false;\n            else{\n               while(x>sum){\n                   sum  = sum * 10 + x%10;\n                   x = x/10;\n               }\n            }\n            if(sum == x)  return true;\n            if(sum/10 == x)return true;\n            return false;\n        }\n\nint main()\n{\n    int base = 0;\n    int square = 0;\n    cin>>base;\n    for(int i =1 ;i<300;i++){\n        square = i*i;\n        if(isPalindrome(square))\n            cout<<i<<\"" \""<<i*i<<endl;\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,39,456
1413040689435037696,bcceb5f830c52ad75d96832f6171f3ffc147f7e20a5d9f7b206e4378d3b11e74,2021-07-08 15:42:08,C++,80.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include<cstdio>\n#include<cstring>\n#include<cmath>\n#include<iostream>\n#include<algorithm>\nusing namespace std;\nstring solve(int a,int b);\nbool flag;\nint main()\n{\n        int n;\n        cin>>n;\n        for(int i=1;i<=300;i++)\n        {\n                string  a=solve(i,n);\n               string b=solve(i*i,n);\n                if(flag) cout<<a<<' '<<b<<endl;\n        }\n        return 0;\n}\nstring solve(int a,int b)\n{\n    string d;\n        d.clear();\n    int i=0;\n    char c;\n    while(a%b!=a)\n    {\n        i=a%b;\n        if(i>=10) c=char(i+55);\n        else c=i+'0';\n        a=a/b;\n       d.push_back(c);\n    }\n    if(a>=10) c=char(a+55);\n    else c=a+'0';\n    d.push_back(c);\n    string e=d;\n    reverse(d.begin(),d.end());\n    if(e==d) flag=1;\n    else flag=0;\n    return d;\n}\n",ACCEPTED,68,460
1413314933377110016,152bee4ba1f594d014a87e96331c6def94d5eaf71d135655082649dc6d0b0ea4,2021-07-09 09:51:52,C++,80.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include<cstdio>\n#include<cstring>\n#include<cmath>\n#include<iostream>\n#include<algorithm>\nusing namespace std;\nbool flag;\nstring solve(int a,int b)\n{\n    string d;\n        d.clear();\n    int i=0;\n    char c;\n    while(a%b!=a)\n    {\n        i=a%b;\n        if(i>=10) c=char(i+55);\n        else c=i+'0';\n        a=a/b;\n        d.push_back(c);\n    }\n    if(a>=10) c=char(a+55);\n    else c=a+'0';\n    d.push_back(c);\n    string e=d;\n    reverse(d.begin(),d.end());\n    if(e==d) flag=1;\n    else flag=0;\n    return d;\n}\nint main()\n{\n        int n;\n        cin>>n;\n        for(int i=1;i<=300;i++)\n        {\n            string  a=solve(i,n);\n            string b=solve(i*i,n);\n            if(flag)\n            {\n                cout<<a<<' '<<b<<endl;\n            }\n        }\n        return 0;\n}\n\n",ACCEPTED,33,424
1413316921461039104,152bee4ba1f594d014a87e96331c6def94d5eaf71d135655082649dc6d0b0ea4,2021-07-09 09:59:46,C++,70.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <iostream>  \n#include <vector>\n#include <string>  \n#include <algorithm>  \nusing namespace std;\n\nbool Palin_num(const string a) \n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1])\n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1) \n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring intToA(int n, int radix)  \n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\n        {\n            ans += t + '0';\n        }\n        else\n        {\n            ans += t - 10 + 'A';\n        }\n        n /= radix;\n    } while (n != 0);\t\n    reverse(ans.begin(), ans.end());\n    return ans;\n}\n\nint main()\n{\n    int n, s;\n    cin >> n >> s;\n    s++; \n    vector<int> p; \n    int sum; \n    while ((p.size() < n)) \n    {\n        sum = 0;\n        for (int i = 2; i <= 10; i++)\n        {\n            if (Palin_num(intToA(s, i))) \n            {\n                sum++; // \n            }\n        }\n        if (sum >= 2) // \n        {\n            p.push_back(s);\n        }\n        s++; \n    }\n    for (int i = 0; i < p.size(); i++)\n    {\n        cout << p[i] << endl;\n    }\n    return 0;\n}",ACCEPTED,38,436
1413332515312881664,32a77d39d47fc7bbd4dbe361fa82505ca0878423c1e7ff47ddfce44ca97ca586,2021-07-09 11:01:44,C++,80.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<map>\n#include<vector>\n#include<set>\nusing namespace std;\nint d(int n)\n{\n    return n*n;\n}\nint main()\n{\n    int N;\n    cin>>N;\n    vector<int>a;\n    for(int i=1;i<=300;i++)\n    {\n        int tag=d(i);\n        while(tag)\n        {\n            a.push_back(tag%N);\n            tag/=N;\n        }\n        int L=a.size();\n        int flag=0;\n        for(int j=0;j<L/2+1;j++)//judge\n        {\n            if(a[j]!=a[L-j-1])\n            {\n                flag++;\n                break;\n            }\n        }\n        if(flag==0)\n        {\n            int q=i;\n            vector<int>b;\n            while(q)\n            {\n                b.push_back(q%N);\n                q/=N;\n            }\n            vector<int>::reverse_iterator it;\n            for(it=b.rbegin();it!=b.rend();++it)\n            {\n                if(*it>=10)\n                {\n                    cout<<char('A'+*it-10);\n                }\n                else\n                {\n                    cout<<*it;\n                }\n            }\n            cout<<\"" \"";\n            for(it=a.rbegin();it!=a.rend();++it)\n            {\n                if(*it>=10)\n                {\n                    cout<<char('A'+*it-10);\n                }\n                else\n                {\n                    cout<<*it;\n                }\n            }\n            cout<<endl;\n            b.clear();\n        }\n        a.clear();\n    }\n    return 0;\n}",ACCEPTED,40,444
1413341830434246656,993dc1eb1c83ea57131f5cefe45dab19b3fdad6ba0f252c5cf33fcdb229f3f8b,2021-07-09 11:38:45,C++,50.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<stdio.h>\nusing namespace std;\nint main(){\n\tint B;\n\tcin>>B;\n\tvoid f(int,int);\n\tfor(int n=1;n<=300;n++)\n\tf(B,n);\n\t\n\treturn 0;\n}\n\nvoid f(int B,int n){\n\tint number=n*n;\n\tint arr[10];\n\tint i=0;\n\twhile(number){\n\t\ti++;\n\t\tarr[i]=number%B;\n\t\tnumber/=B;\n\t}\n\tint j,k; \n\tfor(j=1,k=i;j<=k;j++,k--){\n\t\tif(arr[j]!=arr[k]) return;\n\t}\n\tif(j>=k){\n\t\tint s=0;\n\t\tint brr[10];\n\t\twhile(n){\n\t\ts++;\n\t\tbrr[s]=n%B;\n\t\tn/=B;\n\t}\n\t\tfor(int m=s;m>=1;m--){\n\t\t\tif(brr[m]>=10) printf(\""%c\"",arr[m]+55);\n\t\t\telse cout<<brr[m];\n\t\t}\n\t\tcout<<\"" \"";\n\t\tfor(int m=1;m<=i;m++){\n\t\t\tif(arr[m]>=10) printf(\""%c\"",arr[m]+55);\n\t\t\telse cout<<arr[m];\n\t\t}\n\t\tcout<<endl; \n\t}\n\telse return;\n}",PARTIAL_ACCEPTED,51,448
1413342876182679552,993dc1eb1c83ea57131f5cefe45dab19b3fdad6ba0f252c5cf33fcdb229f3f8b,2021-07-09 11:42:54,C++,80.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<stdio.h>\nusing namespace std;\nint main(){\n\tint B;\n\tcin>>B;\n\tvoid f(int,int);\n\tfor(int n=1;n<=300;n++)\n\tf(B,n);\n\t\n\treturn 0;\n}\n\nvoid f(int B,int n){\n\tint number=n*n;\n\tint arr[10];\n\tint i=0;\n\twhile(number){\n\t\ti++;\n\t\tarr[i]=number%B;\n\t\tnumber/=B;\n\t}\n\tint j,k; \n\tfor(j=1,k=i;j<=k;j++,k--){\n\t\tif(arr[j]!=arr[k]) return;\n\t}\n\tif(j>=k){\n\t\tint s=0;\n\t\tint brr[10];\n\t\twhile(n){\n\t\ts++;\n\t\tbrr[s]=n%B;\n\t\tn/=B;\n\t}\n\t\tfor(int m=s;m>=1;m--){\n\t\t\tif(brr[m]>=10) printf(\""%c\"",brr[m]+55);\n\t\t\telse cout<<brr[m];\n\t\t}\n\t\tcout<<\"" \"";\n\t\tfor(int m=1;m<=i;m++){\n\t\t\tif(arr[m]>=10) printf(\""%c\"",arr[m]+55);\n\t\t\telse cout<<arr[m];\n\t\t}\n\t\tcout<<endl; \n\t}\n\telse return;\n}",ACCEPTED,51,456
1413347941191245824,993dc1eb1c83ea57131f5cefe45dab19b3fdad6ba0f252c5cf33fcdb229f3f8b,2021-07-09 12:03:02,C++,40.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main(){\n\tint n,s;\n\tcin>>n>>s;\n\ts+=1;\n\tint cnt=0;\n\tbool f1(int number,int B);\n\t\n\twhile(1){\n\t\tint sum=0;\n\t\t//从2进制到10进制都筛选一遍 \n\t\tfor(int i=2;i<=10;i++){\n\t\t\tsum+=f1(s,i);\n\t\t}\t\n\t\tif(sum>=2){\n\t\t\tcnt++;\n\t\t\tcout<<s<<endl;\n\t\t}\n\t\tif(cnt==n) break;\n\t\ts++; \n\t}\n\t\n\treturn 0;\n}\n\n//判断数字 number 在 B 进制下是否为回文数 \nbool f1(int number,int B){\n\tint i=0;\n\tint arr[10];\n\twhile(number){\n\t\ti++;\n\t\tarr[i]=number%B;\n\t\tnumber/=B;\n\t}\n\tint j,k;\n\tfor(j=1,k=i;j<=k;j++,k--){\n\t\tif(arr[j]!=arr[k]) return false;\n\t}\n\tif(j>=k) return true;\n}",PARTIAL_ACCEPTED,36,328
1413348084867125248,993dc1eb1c83ea57131f5cefe45dab19b3fdad6ba0f252c5cf33fcdb229f3f8b,2021-07-09 12:03:36,C++,70.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main(){\n\tint n,s;\n\tcin>>n>>s;\n\ts+=1;\n\tint cnt=0;\n\tbool f1(int number,int B);\n\t\n\twhile(1){\n\t\tint sum=0;\n\t\t//从2进制到10进制都筛选一遍 \n\t\tfor(int i=2;i<=10;i++){\n\t\t\tsum+=f1(s,i);\n\t\t}\t\n\t\tif(sum>=2){\n\t\t\tcnt++;\n\t\t\tcout<<s<<endl;\n\t\t}\n\t\tif(cnt==n) break;\n\t\ts++; \n\t}\n\t\n\treturn 0;\n}\n\n//判断数字 number 在 B 进制下是否为回文数 \nbool f1(int number,int B){\n\tint i=0;\n\tint arr[100];\n\twhile(number){\n\t\ti++;\n\t\tarr[i]=number%B;\n\t\tnumber/=B;\n\t}\n\tint j,k;\n\tfor(j=1,k=i;j<=k;j++,k--){\n\t\tif(arr[j]!=arr[k]) return false;\n\t}\n\tif(j>=k) return true;\n}",ACCEPTED,26,448
1413465740932796416,c06bb1133dd70a854015386b5505a7752e6202dee1607368d3621670a8a607d1,2021-07-09 19:51:08,C++,50.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main(){\n    int b,t,a[100],c[100],s,s1,n,flag;\n    cin>>b;\n    for(int i=1;i<=300;i++){\n        flag=1;\n        t=i*i;\n        s=0;\n        while(t){\n            a[s++]=t%b;\n            t/=b;\n        }\n        s1=0;\n        n=i;\n        while(n){\n            c[s1++]=n%b;\n            n/=b;\n        }\n        for(int j=0;j<s;j++){\n            if(a[j]!=a[s-j-1])flag=0;\n        }\n        if(flag==1){\n            for(int j=s1-1;j>=0;j--){\n                cout<<c[j];\n            }\n            cout<<\"" \"";\n            for(int j=s-1;j>=0;j--){\n                cout<<a[j];\n            }\n            cout<<endl;\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,84,476
1413468181719932928,c06bb1133dd70a854015386b5505a7752e6202dee1607368d3621670a8a607d1,2021-07-09 20:00:50,C++,0.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main(){\n    int b,t,a[100],c[100],s,s1,n,flag;\n    cin>>b;\n    for(int i=1;i<=300;i++){\n        flag=1;\n        t=i*i;\n        s=0;\n        while(t){\n            a[s++]=t%b;\n            t/=b;\n        }\n        s1=0;\n        n=i;\n        while(n){\n            c[s1++]=n%b;\n            n/=b;\n        }\n        for(int j=0;j<s;j++){\n            if(a[j]!=a[s-j-1])flag=0;\n        }\n        if(flag==1){\n            for(int j=s1-1;j>=0;j--){\n                cout<<c[j];\n            }\n            cout<<\"" \"";\n            for(int j=0;j<s-1;j++){\n                cout<<a[j];\n            }\n            cout<<endl;\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,35,452
1413468437840908288,c06bb1133dd70a854015386b5505a7752e6202dee1607368d3621670a8a607d1,2021-07-09 20:01:51,C++,50.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main(){\n    int b,t,a[100],c[100],s,s1,n,flag;\n    cin>>b;\n    for(int i=1;i<=300;i++){\n        flag=1;\n        t=i*i;\n        s=0;\n        while(t){\n            a[s++]=t%b;\n            t/=b;\n        }\n        s1=0;\n        n=i;\n        while(n){\n            c[s1++]=n%b;\n            n/=b;\n        }\n        for(int j=0;j<s;j++){\n            if(a[j]!=a[s-j-1])flag=0;\n        }\n        if(flag==1){\n            for(int j=s1-1;j>=0;j--){\n                cout<<c[j];\n            }\n            cout<<\"" \"";\n            for(int j=0;j<s;j++){\n                cout<<a[j];\n            }\n            cout<<endl;\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,62,452
1413541332067192832,c06bb1133dd70a854015386b5505a7752e6202dee1607368d3621670a8a607d1,2021-07-10 00:51:30,C++,80.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main(){\n    int b,t,s,s1,m,n,flag;\n    string a[100],c[100];\n    cin>>b;\n    for(int i=1;i<=300;i++){\n        flag=1;\n        t=i*i;\n        s=0;\n        while(t){\n            m=t%b;\n            if(m==10)a[s++]=\""A\"";\n            else if(m==11)a[s++]=\""B\"";\n            else if(m==12)a[s++]=\""C\"";\n            else if(m==13)a[s++]=\""D\"";\n            else if(m==14)a[s++]=\""E\"";\n            else if(m==15)a[s++]=\""F\"";\n            else if(m==16)a[s++]=\""G\"";\n            else if(m==17)a[s++]=\""H\"";\n            else if(m==18)a[s++]=\""I\"";\n            else if(m==19)a[s++]=\""J\"";\n            else{\n                a[s++]=to_string(m);\n            }\n            t/=b;\n        }\n        s1=0;\n        n=i;\n        while(n){\n            m=n%b;\n            if(m==10)c[s1++]=\""A\"";\n            else if(m==11)c[s1++]=\""B\"";\n            else if(m==12)c[s1++]=\""C\"";\n            else if(m==13)c[s1++]=\""D\"";\n            else if(m==14)c[s1++]=\""E\"";\n            else if(m==15)c[s1++]=\""F\"";\n            else if(m==16)c[s1++]=\""G\"";\n            else if(m==17)c[s1++]=\""H\"";\n            else if(m==18)c[s1++]=\""I\"";\n            else if(m==19)c[s1++]=\""J\"";\n            else {c[s1++]=to_string(m);}\n            n/=b;\n        }\n        for(int j=0;j<s;j++){\n            if(a[j]!=a[s-j-1])flag=0;\n        }\n        if(flag==1){\n            for(int j=s1-1;j>=0;j--){\n                cout<<c[j];\n            }\n            cout<<\"" \"";\n            for(int j=0;j<s;j++){\n                cout<<a[j];\n            }\n            cout<<endl;\n        }\n    }\n    return 0;\n}",ACCEPTED,40,340
1413567456910413824,c06bb1133dd70a854015386b5505a7752e6202dee1607368d3621670a8a607d1,2021-07-10 02:35:19,C++,0.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main(){\n    int n,s,t,a,b[100],c=0,k,flag;\n    cin>>n>>s;\n    for(int i=s+1;;i++){\n        a=0;\n        t=i;\n        for(int j=2;j<=10;j++){\n            k=0;\n            flag=1;\n            while(t){\n                b[k++]=t%j;\n                t/=j;\n            }\n            for(int p=0;p<k/2;p++){\n                if(b[p]!=b[k-p-1])flag=0;\n            }\n            if(flag==1)a+=1;\n        }\n        if(c<3){\n            if(a>=2){\n                cout<<i<<endl;\n                c+=1;\n            }\n        }\n        else break;\n    }\n    return 0;\n}",WRONG_ANSWER,27,452
1413567567195443200,c06bb1133dd70a854015386b5505a7752e6202dee1607368d3621670a8a607d1,2021-07-10 02:35:45,C++,0.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main(){\n    int n,s,t,a,b[100],c=0,k,flag;\n    cin>>n>>s;\n    for(int i=s+1;;i++){\n        a=0;\n        t=i;\n        for(int j=2;j<=10;j++){\n            k=0;\n            flag=1;\n            while(t){\n                b[k++]=t%j;\n                t/=j;\n            }\n            for(int p=0;p<k/2;p++){\n                if(b[p]!=b[k-p-1])flag=0;\n            }\n            if(flag==1)a+=1;\n        }\n        if(c<3){\n            if(a>=2){\n                cout<<i<<endl;\n                c+=1;\n            }\n        }\n        else break;\n    }\n    return 0;\n}",WRONG_ANSWER,31,440
1413567761349775360,c06bb1133dd70a854015386b5505a7752e6202dee1607368d3621670a8a607d1,2021-07-10 02:36:31,C++,10.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main(){\n    int n,s,t,a,b[100],c=0,k,flag;\n    cin>>n>>s;\n    for(int i=s+1;;i++){\n        a=0;\n        t=i;\n        for(int j=2;j<=10;j++){\n            k=0;\n            flag=1;\n            while(t){\n                b[k++]=t%j;\n                t/=j;\n            }\n            for(int p=0;p<k/2;p++){\n                if(b[p]!=b[k-p-1])flag=0;\n            }\n            if(flag==1)a+=1;\n        }\n        if(c<n){\n            if(a>=2){\n                cout<<i<<endl;\n                c+=1;\n            }\n        }\n        else break;\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,33,424
1413568826119983104,c06bb1133dd70a854015386b5505a7752e6202dee1607368d3621670a8a607d1,2021-07-10 02:40:45,C++,10.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main(){\n    int n,s,t,a,b[100],c=0,k,flag;\n    cin>>n>>s;\n    for(int i=s+1;;i++){\n        a=0;\n        t=i;\n        for(int j=2;j<=10;j++){\n            k=0;\n            flag=1;\n            while(t){\n                b[k++]=t%j;\n                t/=j;\n            }\n            for(int p=0;p<k/2;p++){\n                if(b[p]!=b[k-p-1])flag=0;\n            }\n            if(flag==1)a+=1;\n        }\n        if(c<n){\n            if(a>2){\n                cout<<i<<endl;\n                c+=1;\n            }\n        }\n        else break;\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,71,456
1413569971286609920,c06bb1133dd70a854015386b5505a7752e6202dee1607368d3621670a8a607d1,2021-07-10 02:45:18,C++,10.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main(){\n    int n,s,t,a,b[100],c=0,k,flag;\n    cin>>n>>s;\n    for(int i=s+1;;i++){\n        a=0;\n        t=i;\n        for(int j=2;j<=10;j++){\n            k=0;\n            flag=1;\n            while(t){\n                b[k++]=t%j;\n                t/=j;\n            }\n            for(int p=0;p<k;p++){\n                if(b[p]!=b[k-p-1])flag=0;\n            }\n            if(flag==1)a+=1;\n        }\n        if(c<n){\n            if(a>2){\n                cout<<i<<endl;\n                c++;\n            }\n            if(c==n)break;\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,25,448
1413572956779614208,c06bb1133dd70a854015386b5505a7752e6202dee1607368d3621670a8a607d1,2021-07-10 02:57:10,C++,0.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main(){\n    int n,s,t,a,b[100],c=0,k,flag;\n    cin>>n>>s;\n    for(int i=s+1;;i++){\n        a=0;\n        t=i;\n        for(int j=2;j<=10;j++){\n            k=0;\n            flag=1;\n            while(t){\n                b[k++]=t%j;\n                t/=j;\n            }\n            for(int p=0;p<k;p++){\n                if(b[p]!=b[k-p-1])flag=0;\n            }\n            if(flag==1){\n                if(j==10)a=0;\n                else a++;\n            }\n        }\n        if(c<n){\n            if(a>2){\n                cout<<i<<endl;\n                c++;\n            }\n            if(c==n)break;\n        }\n    }\n    return 0;\n}",TIME_LIMIT_EXCEEDED,0,0
1413573077122584576,c06bb1133dd70a854015386b5505a7752e6202dee1607368d3621670a8a607d1,2021-07-10 02:57:39,C++,10.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main(){\n    int n,s,t,a,b[100],c=0,k,flag;\n    cin>>n>>s;\n    for(int i=s+1;;i++){\n        a=0;\n        t=i;\n        for(int j=2;j<=10;j++){\n            k=0;\n            flag=1;\n            while(t){\n                b[k++]=t%j;\n                t/=j;\n            }\n            for(int p=0;p<k;p++){\n                if(b[p]!=b[k-p-1])flag=0;\n            }\n            if(flag==1)a+=1;\n        }\n        if(c<n){\n            if(a>2){\n                cout<<i<<endl;\n                c++;\n            }\n            if(c==n)break;\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,33,448
1413575626206646272,c06bb1133dd70a854015386b5505a7752e6202dee1607368d3621670a8a607d1,2021-07-10 03:07:46,C++,0.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main(){\n    int n,s,t,a,b[100],c=0,k,flag;\n    cin>>n>>s;\n    for(int i=s+1;;i++){\n        a=0;\n        t=i;\n        for(int j=2;j<=10;j++){\n            k=0;\n            flag=1;\n            while(t){\n                b[k++]=t%j;\n                t/=j;\n            }\n            for(int p=0;p<k;p++){\n                if(b[p]!=b[k-p-1])flag=0;\n            }\n            if(b[0]==0||b[k-1]==0)flag=0;\n            if(flag==1)a++;\n        }\n        if(c<n){\n            if(a>2){\n                cout<<i<<endl;\n                c++;\n            }\n            if(c==n)break;\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,85,448
1413664443110825984,32a77d39d47fc7bbd4dbe361fa82505ca0878423c1e7ff47ddfce44ca97ca586,2021-07-10 09:00:42,C++,70.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\nbool judge(const int num,const int sys)\n{\n    int q=num;\n    vector<int>a;\n    while(q)\n    {\n        a.push_back(q%sys);\n        q/=sys;\n    }\n    int flag=0,L=a.size();\n    for(int i=0;i<L/2+1;i++)\n    {\n        if(a[i]!=a[L-1-i])\n        {\n            flag++;\n            break;\n        }\n    }\n    if(flag==0)\n        return true;\n    else\n        return false;\n}\nint main()\n{\n    int N,num;\n    cin>>N>>num;\n    while(N)\n    {\n        num++;\n        int ju=0;\n        for(int i=2;i<=10;i++)\n        {\n            if(judge(num,i))\n            {\n                ju++;\n            }\n            if(ju==2)\n            {\n                cout<<num<<endl;\n                N--;\n                break;\n            }\n        }\n    }\n    return 0;\n}",ACCEPTED,44,464
1413754687637852160,c06bb1133dd70a854015386b5505a7752e6202dee1607368d3621670a8a607d1,2021-07-10 14:59:18,C++,70.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main(){\n    int n,s,t,a,b[100],c=0,k,flag;\n    cin>>n>>s;\n    for(int i=s+1;;i++){\n        a=0;\n        for(int j=2;j<=10;j++){\n            t=i;\n            k=0;\n            flag=1;\n            while(t){\n                b[k++]=t%j;\n                t/=j;\n            }\n            for(int p=0;p<k;p++){\n                if(b[p]!=b[k-p-1])flag=0;\n            }\n            if(flag==1&&b[0]!=0)a++;\n        }\n        if(c<n){\n            if(a>=2){\n                cout<<i<<endl;\n                c++;\n            }\n            if(c==n)break;\n        }\n    }\n    return 0;\n}",ACCEPTED,37,380
1414071127004266496,233c53001b026027b02e14c4bec52a0a7933764218364d9555d4b8dfeb071fc3,2021-07-11 11:56:43,C++,60.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nstring trans(int x,int n){\n    string temp=\""\"";\n    if(x==0)\n    {\n        return \""0\"";\n    }\n        while(x!=0){\n            temp=(char)(x%n+'0')+temp;\n            x/=n;\n        }\n    return temp;\n}\nbool isRe(string x){\n    int l=0,r=x.size()-1;\n    for(;l<r;l++,r--){\n        if(x[r]!=x[l])\n            return false;\n    }\n    return true;\n}\nbool isResult(int num){\n    int count=0;\n    for(int i=2;i<=10;i++)\n    {\n        string s=trans(num,i);\n        if(s[s.size()-1]=='0')\n            continue;\n        if(isRe(s)){\n            count++;\n        }\n        if(count>=2){\n            return true;\n        }\n    }\n    return false;\n}\nint main(){\n    int n,x;\n    cin>>n>>x;\n    int total=0;\n    for(int i=x+1;i<=10000;i++){\n        if(isResult(i))\n        {\n            cout<<i<<endl;\n            total++;\n        }\n        if(total==n){\n            break;\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,32,444
1414071932843347968,233c53001b026027b02e14c4bec52a0a7933764218364d9555d4b8dfeb071fc3,2021-07-11 11:59:55,C++,60.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nstring trans(int x,int n){\n    string temp=\""\"";\n    if(x==0)\n    {\n        return \""0\"";\n    }\n        while(x!=0){\n            temp=(char)(x%n+'0')+temp;\n            x/=n;\n        }\n    return temp;\n}\nbool isRe(string x){\n    int l=0,r=x.size()-1;\n    for(;l<r;l++,r--){\n        if(x[r]!=x[l])\n            return false;\n    }\n    return true;\n}\nbool isResult(int num){\n    int count=0;\n    for(int i=2;i<=10;i++)\n    {\n        string s=trans(num,i);\n        if(s[s.size()-1]=='0')\n            continue;\n        if(isRe(s)){\n            count++;\n        }\n    }\n    if(count>=2){\n        return true;\n    }\n    return false;\n}\nint main(){\n    int n,x;\n    cin>>n>>x;\n    int total=0;\n    for(int i=x+1;i<=10000;i++){\n        if(isResult(i))\n        {\n            cout<<i<<endl;\n            total++;\n        }\n        if(total==n){\n            break;\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,40,448
1414072472415436800,233c53001b026027b02e14c4bec52a0a7933764218364d9555d4b8dfeb071fc3,2021-07-11 12:02:04,C++,70.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nstring trans(int x,int n){\n    string temp=\""\"";\n    if(x==0)\n    {\n        return \""0\"";\n    }\n        while(x!=0){\n            temp=(char)(x%n+'0')+temp;\n            x/=n;\n        }\n    return temp;\n}\nbool isRe(string x){\n    int l=0,r=x.size()-1;\n    for(;l<r;l++,r--){\n        if(x[r]!=x[l])\n            return false;\n    }\n    return true;\n}\nbool isResult(int num){\n    int count=0;\n    for(int i=2;i<=10;i++)\n    {\n        string s=trans(num,i);\n        if(s[s.size()-1]=='0')\n            continue;\n        if(isRe(s)){\n            count++;\n        }\n    }\n    if(count>=2){\n        return true;\n    }\n    return false;\n}\nint main(){\n    int n,x;\n    cin>>n>>x;\n    int total=0;\n    for(int i=x+1;i<=20000;i++){\n        if(isResult(i))\n        {\n            cout<<i<<endl;\n            total++;\n        }\n        if(total==n){\n            break;\n        }\n    }\n    return 0;\n}",ACCEPTED,44,320
1414115222892720128,a303f4a801f7319037bad497e61487d0361252dc2296ce6c320aa9dcf04ae8c7,2021-07-11 14:51:56,C++,80.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\nusing namespace std;\nstring JZZH(int n,int B);\nbool HWS(string s);\nint main()\n{\n    int B;\n    cin>>B;\n    for(int i=1;i<=300;i++)\n    {\n        if(HWS(JZZH(i*i,B)))\n            cout<<JZZH(i,B)<<\"" \""<<JZZH(i*i,B)<<endl;\n    }\n    return 0;\n}\nstring JZZH(int n,int B)\n{\n    string toN=\""\"",ToN=\""\"";\n    while(n>0)\n    {\n        int x=n%B;\n        n /= B;\n        switch (x)\n        {\n            case 0:  toN+=\""0\"";break;\n            case 1:  toN+=\""1\"";break;\n            case 2:  toN+=\""2\"";break;\n            case 3:  toN+=\""3\"";break;\n            case 4:  toN+=\""4\"";break;\n            case 5:  toN+=\""5\"";break;\n            case 6:  toN+=\""6\"";break;\n            case 7:  toN+=\""7\"";break;\n            case 8:  toN+=\""8\"";break;\n            case 9:  toN+=\""9\"";break;\n            case 10: toN+=\""A\"";break;\n            case 11: toN+=\""B\"";break;\n            case 12: toN+=\""C\"";break;\n            case 13: toN+=\""D\"";break;\n            case 14: toN+=\""E\"";break;\n            case 15: toN+=\""F\"";break;\n            case 16: toN+=\""G\"";break;\n            case 17: toN+=\""H\"";break;\n            case 18: toN+=\""I\"";break;\n            case 19: toN+=\""J\"";break;\n        }\n    }\n    for(int i=0;i<toN.size();i++)\n        ToN+=toN[toN.size()-i-1];\n    return ToN;\n}\nbool HWS(string s)\n{\n    for(int i=0;i<s.size()/2;i++)\n    {\n        if(s[i]!=s[s.size()-i-1])\n            return false;\n    }\n    return true;\n}\n",ACCEPTED,40,320
1414120713064398848,a303f4a801f7319037bad497e61487d0361252dc2296ce6c320aa9dcf04ae8c7,2021-07-11 15:13:45,C++,70.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\nusing namespace std;\nstring JZZH(int n,int B);\nbool HWS(string s);\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    for(int i=S+1;;i++)\n    {\n         int n=0;\n         for(int j=2;j<=10;j++)\n         {\n             if(HWS(JZZH(i,j)))\n                 n++;\n             if(n==2)\n             {\n                 cout<<i<<endl;\n                 N--;\n                 break;\n             }\n         }\n         if(N==0)\n             break;\n    }\n    return 0;\n}\nstring JZZH(int n,int B)\n{\n    string toN=\""\"",ToN=\""\"";\n    while(n>0)\n    {\n        int x=n%B;\n        n /= B;\n        switch (x)\n        {\n            case 0:  toN+=\""0\"";break;\n            case 1:  toN+=\""1\"";break;\n            case 2:  toN+=\""2\"";break;\n            case 3:  toN+=\""3\"";break;\n            case 4:  toN+=\""4\"";break;\n            case 5:  toN+=\""5\"";break;\n            case 6:  toN+=\""6\"";break;\n            case 7:  toN+=\""7\"";break;\n            case 8:  toN+=\""8\"";break;\n            case 9:  toN+=\""9\"";break;\n        }\n    }\n    for(int i=0;i<toN.size();i++)\n        ToN+=toN[toN.size()-i-1];\n    return ToN;\n}\nbool HWS(string s)\n{\n    for(int i=0;i<s.size()/2;i++)\n    {\n        if(s[i]!=s[s.size()-i-1])\n            return false;\n    }\n    return true;\n}\n",ACCEPTED,35,316
1414160189114978304,5e3ba52e800feb7123969e931250eebf8de7ff29bb02d0c5f456d2852a380a37,2021-07-11 17:50:37,C++,10.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <vector>\nusing namespace std;\nchar List[20]={'0','1','2','3','4','5','6','7','8','9','A',\n           'B','C','D','E','F','G','H','I','j'};\nvoid fun(int n,int m){\n    int k=n;\n    n=n*n;\n    string a=\""\"";\n    string b=\""\"";\n    while(n){\n        int i=n%m;\n        n=n/m;\n        a=List[i]+a;\n        b=b+List[i];\n    }\n    if(a==b)\n        cout<<k<<\"" \""<<a<<endl;\n\n\n}\nint main()\n{\n    int m;\n    cin>>m;\n    for(int i=1;i<=300;i++){\n        fun(i,m);\n    }\n}",PARTIAL_ACCEPTED,43,332
1414161038277459968,5e3ba52e800feb7123969e931250eebf8de7ff29bb02d0c5f456d2852a380a37,2021-07-11 17:54:00,C++,80.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <vector>\nusing namespace std;\nchar List[20]={'0','1','2','3','4','5','6','7','8','9','A',\n           'B','C','D','E','F','G','H','I','j'};\nvoid fun(int n,int m){\n    int k=n;\n    n=n*n;\n    string a=\""\"";\n    string b=\""\"";\n    string c=\""\"";\n    while(n){\n        int i=n%m;\n        n=n/m;\n        a=List[i]+a;\n        b=b+List[i];\n    }\n    while(k){\n        int i=k%m;\n        k=k/m;\n        c=List[i]+c;\n    }\n\n    if(a==b)\n        cout<<c<<\"" \""<<a<<endl;\n\n\n}\nint main()\n{\n    int m;\n    cin>>m;\n    for(int i=1;i<=300;i++){\n        fun(i,m);\n    }\n}\n",ACCEPTED,101,472
1414164141408190464,c534361d1cb726f584074d6f84696b583788e43defe4a3c3a2641cc6cda5c936,2021-07-11 18:06:19,C++,50.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <math.h>\n#include <string>\n#include <algorithm>\nusing namespace std;\n\nint setbase(int base,int n);\nbool ishuiwen(int n);\n\nint main()\n{\n    int a,n;\n    cin>>a>>n;\n    int num=0;\n    for (int i=n+1;num!=a;i++)\n    {\n        if (ishuiwen(i))\n        {\n            num++;\n            cout<<i<<endl;\n        }\n    }\n}\n\nint setbase(int base,int n)\n{\n    int num=0;\n    for (int i=0;n!=0;i++)\n    {\n        num+=n%base*pow(10,i);\n        n/=base;\n    }\n    return num;\n}\n\nbool ishuiwen(int n)\n{\n    int p=0;\n    string s=to_string(n);\n    string se=s;\n    reverse(se.begin(),se.end());\n    if (se==s)\n        p++;\n    for (int i=2;i<10;i++)\n    {\n        int newnum=setbase(i,n);\n        string s=to_string(newnum);\n        string se=s;\n        reverse(se.begin(),se.end());\n        if (se==s)\n            p++;\n        if (p==2)\n            return true;\n    }\n    return false;\n}",PARTIAL_ACCEPTED,44,424
1414166881131769856,c534361d1cb726f584074d6f84696b583788e43defe4a3c3a2641cc6cda5c936,2021-07-11 18:17:13,C++,70.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <math.h>\n#include <string>\n#include <algorithm>\nusing namespace std;\n\nlong long setbase(int base,int n);\nbool ishuiwen(int n);\n\nint main()\n{\n    int a,n;\n    cin>>a>>n;\n    int num=0;\n    for (int i=n+1;num!=a;i++)\n    {\n        if (ishuiwen(i))\n        {\n            num++;\n            cout<<i<<endl;\n        }\n    }\n}\n\nlong long setbase(int base,int n)\n{\n    long long num=0;\n    for (int i=0;n!=0;i++)\n    {\n        num+=n%base*pow(10,i);\n        n/=base;\n    }\n    return num;\n}\n\nbool ishuiwen(int n)\n{\n    int p=0;\n    string s=to_string(n);\n    string se=s;\n    reverse(se.begin(),se.end());\n    if (se==s)\n        p++;\n    for (int i=2;i<10;i++)\n    {\n        long long newnum=setbase(i,n);\n        string s=to_string(newnum);\n        string se=s;\n        reverse(se.begin(),se.end());\n        if (se==s)\n            p++;\n        if (p==2)\n            return true;\n    }\n    return false;\n}",ACCEPTED,44,428
1414202578471419904,5e3ba52e800feb7123969e931250eebf8de7ff29bb02d0c5f456d2852a380a37,2021-07-11 20:39:03,C++,50.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <vector>\nusing namespace std;\nchar List[10]={'0','1','2','3','4','5','6','7','8','9'};\nbool fun(int n){\n    int count=0;\n    for(int m=2;m<=10;m++)\n    {   string a=\""\"";\n        string b=\""\"";\n        int k=n;\n        while(k)\n        {\n            int i=k%m;\n            k=k/m;\n            a=a+List[i];\n            b=List[i]+b;\n        }\n        if(a==b)\n            count++;\n        if(count==2)\n            return true;\n    }\n    return false;\n}\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    int count=0;\n    for(int i=S;;i++){\n        if(fun(i)){\n            count++;\n            cout<<i<<endl;\n        }\n        if(count==N){\n            break;\n        }\n    }\n}\n",PARTIAL_ACCEPTED,47,448
1414203186481922048,5e3ba52e800feb7123969e931250eebf8de7ff29bb02d0c5f456d2852a380a37,2021-07-11 20:41:28,C++,70.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <vector>\nusing namespace std;\nchar List[10]={'0','1','2','3','4','5','6','7','8','9'};\nbool fun(int n){\n    int count=0;\n    for(int m=2;m<=10;m++)\n    {   string a=\""\"";\n        string b=\""\"";\n        int k=n;\n        while(k)\n        {\n            int i=k%m;\n            k=k/m;\n            a=a+List[i];\n            b=List[i]+b;\n        }\n        if(a==b)\n            count++;\n        if(count==2)\n            return true;\n    }\n    return false;\n}\nint main()\n{\n    int N,S;\n    cin>>N>>S;\n    int count=0;\n    for(int i=S+1;;i++){\n        if(fun(i)){\n            count++;\n            cout<<i<<endl;\n        }\n        if(count==N){\n            break;\n        }\n    }\n}\n",ACCEPTED,85,452
1414407827039096832,a42017b4b729a9f54a3339b5f28ebfcc61560f2ddd739973e19825455d3a6e59,2021-07-12 10:14:39,C++,50.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include<stdio.h>\nint fun1(int n,int x){\n\tint i=0,m=x*x,j,a[100],b[100],k=0;\n\twhile(x!=0){\n\t\tb[k++]=x%n;\n\t\tx=x/n;\n\t}\n\twhile(m!=0){\n\t\ta[i++]=m%n;\n\t\tm=m/n;\n\t}\n\tfor(j=0;j<i/2;j++){\n\t\tif(a[j]!=a[i-j-1]) return 0;\n\t}\n\tfor(j=k-1;j>0;j--)\n\t    printf(\""%d\"",b[j]);\n\tprintf(\""%d \"",b[j]);\n\tfor(j=0;j<i-1;j++)\n\t    printf(\""%d\"",a[j]);\n\tprintf(\""%d\\n\"",a[j]);\n}\nint main(){\n\tint n,i;\n\tscanf(\""%d\"",&n);\n\tfor(i=1;i<=300;i++){\n\t\tfun1(n,i);\n\t}\n}",PARTIAL_ACCEPTED,35,340
1414409077162868736,a42017b4b729a9f54a3339b5f28ebfcc61560f2ddd739973e19825455d3a6e59,2021-07-12 10:19:37,C++,80.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h> //快乐万能头\nusing namespace std;\n\nchar get(int x){//将数字转换为字符\n    if (x <= 9) \n    \treturn x + '0';\n    return x - 10 + 'A';//大于9的数字用大写字母表示\n}\n\nstring change(int n, int b)//本题重点的进制转换\n{\n    string res;\n    while (n){\n        res += get(n % b);\n        n /= b;\n    }\n    reverse(res.begin(), res.end());//翻转使高位在左侧\n    return res;\n}\n\nbool check(string s)//是否回文\n{\n    for (int i = 0, j = s.size() - 1; i < j; i ++, j -- )\n        if (s[i] != s[j])\n            return false;\n    return true;\n}\n\nint main()\n{\n    int b;\n    cin >> b;\n\n    for (int i = 1; i <= 300; i ++ )//暴力枚举\n    {\n        string num = change(i * i, b);\n        if (check(num))\n            cout << change(i, b) << ' ' << num << endl;\n    }\n\n    return 0;\n}\n\n",ACCEPTED,34,448
1414448807652982784,c534361d1cb726f584074d6f84696b583788e43defe4a3c3a2641cc6cda5c936,2021-07-12 12:57:29,C++,80.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\nusing namespace std;\n\nstring setbase(int n,int base);\n\nint main()\n{\n    int base;\n    cin>>base;\n    for (int i=1;i<=300;i++)\n    {\n        string s=setbase(i*i,base);\n        string s1=s;\n        reverse(s.begin(),s.end());\n        if (s==s1)\n            printf(\""%s %s\\n\"",setbase(i,base).c_str(),s.c_str());\n    }\n}\n\nstring setbase(int n,int base)\n{\n    string s=\""\"";\n    while (n!=0)\n    {\n        char c=n%base+'0';\n        if (c>'9')\n            c=c-'0'-10+'A';\n        s+=c;\n        n/=base;\n    }\n    reverse(s.begin(),s.end());\n    return s;\n}",ACCEPTED,41,436
1414472209608572928,7265f6813e29a99b4a4b0f45017f2644f3ffc77a40006fccb39b0845182857d2,2021-07-12 14:30:29,C++,40.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<vector>\n#include <string>\nusing namespace std;\n\nstring change(int base,int number)\n{\n    int iRemain;\n    string sRemain;\n    while(number != 0)\n    {\n        iRemain = number % base;\n        number = number / base;\n        sRemain = to_string(iRemain) + sRemain;\n    }\n    return sRemain;\n}\n\nint prime(string aim)\n{\n    for(int i=0;i<aim.size()/2;i++)\n    {\n        if(aim[i] != aim[aim.size()-1-i])\n        {\n            return 0;\n        }\n    }\n    return 1;\n}\n\nint main()\n{\n    int aim_base;\n    cin >> aim_base;\n    for(int i=1;i<=300;i++)\n    {\n        if( prime(change(aim_base,i*i)) == 1 )\n        {\n            cout << change(aim_base,i) << \"" \"" << change(aim_base,i*i) <<endl;\n        }\n    }\n    system(\""pause\"");\n    return 0;\n}",PARTIAL_ACCEPTED,47,700
1414478085773950976,7265f6813e29a99b4a4b0f45017f2644f3ffc77a40006fccb39b0845182857d2,2021-07-12 14:53:50,C++,80.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<vector>\n#include <string>\nusing namespace std;\n\nchar int_char(int a)\n{\n    if(a < 10)\n    {\n        return char(a + 48);\n    }\n    else\n    {\n        return char(a + 55);\n    }\n}\n\nstring change(int base,int number)\n{\n    int iRemain;\n    string sRemain;\n    while(number != 0)\n    {\n        iRemain = number % base;\n        number = number / base;\n        sRemain = int_char(iRemain) + sRemain;\n    }\n    return sRemain;\n}\n\nint prime(string aim)\n{\n    for(int i=0;i<aim.size()/2;i++)\n    {\n        if(aim[i] != aim[aim.size()-1-i])\n        {\n            return 0;\n        }\n    }\n    return 1;\n}\n\nint main()\n{\n    int aim_base;\n    cin >> aim_base;\n    for(int i=1;i<=300;i++)\n    {\n        if( prime(change(aim_base,i*i)) == 1 )\n        {\n            cout << change(aim_base,i) << \"" \"" << change(aim_base,i*i) <<endl;\n        }\n    }\n    system(\""pause\"");\n    return 0;\n}",ACCEPTED,33,580
1414482599240437760,7265f6813e29a99b4a4b0f45017f2644f3ffc77a40006fccb39b0845182857d2,2021-07-12 15:11:46,C++,50.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<vector>\n#include <string>\nusing namespace std;\n\nchar int_char(int a)\n{\n    if(a < 10)\n    {\n        return char(a + 48);\n    }\n    else\n    {\n        return char(a + 55);\n    }\n}\n\nstring change(int base,int number)\n{\n    int iRemain;\n    string sRemain;\n    while(number != 0)\n    {\n        iRemain = number % base;\n        number = number / base;\n        sRemain = int_char(iRemain) + sRemain;\n    }\n    return sRemain;\n}\n\nint prime(string aim)\n{\n    for(int i=0;i<aim.size()/2;i++)\n    {\n        if(aim[i] != aim[aim.size()-1-i])\n        {\n            return 0;\n        }\n    }\n    return 1;\n}\n\nint main()\n{\n    int num,start;\n    cin >> num >> start;\n    int i = 0;\n    while(i != num)\n    {\n        int judge = 0;\n        for(int j=2;j<=10;j++)\n        {\n            if(prime(change(j,start)))\n            {\n                judge = judge + 1;\n            }\n        }\n        if(judge > 1)\n        {\n            cout << start <<endl;\n            i = i + 1;\n        }\n        start = start + 1;\n    }\n    system(\""pause\"");\n    return 0;\n}",PARTIAL_ACCEPTED,46,708
1414482903271833600,7265f6813e29a99b4a4b0f45017f2644f3ffc77a40006fccb39b0845182857d2,2021-07-12 15:12:58,C++,70.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<vector>\n#include <string>\nusing namespace std;\n\nchar int_char(int a)\n{\n    if(a < 10)\n    {\n        return char(a + 48);\n    }\n    else\n    {\n        return char(a + 55);\n    }\n}\n\nstring change(int base,int number)\n{\n    int iRemain;\n    string sRemain;\n    while(number != 0)\n    {\n        iRemain = number % base;\n        number = number / base;\n        sRemain = int_char(iRemain) + sRemain;\n    }\n    return sRemain;\n}\n\nint prime(string aim)\n{\n    for(int i=0;i<aim.size()/2;i++)\n    {\n        if(aim[i] != aim[aim.size()-1-i])\n        {\n            return 0;\n        }\n    }\n    return 1;\n}\n\nint main()\n{\n    int num,start;\n    cin >> num >> start;\n    int i = 0;\n    while(i != num)\n    {\n        start = start + 1;\n        int judge = 0;\n        for(int j=2;j<=10;j++)\n        {\n            if(prime(change(j,start)))\n            {\n                judge = judge + 1;\n            }\n        }\n        if(judge > 1)\n        {\n            cout << start <<endl;\n            i = i + 1;\n        }\n    }\n    system(\""pause\"");\n    return 0;\n}",ACCEPTED,41,692
1414511374287077376,2b65c74336f01b0786e810d4897d909e02d608659bd285f648fabba075f0323e,2021-07-12 17:06:06,C++,10.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <algorithm>\n\nusing namespace std;\n\nbool isPalindrome(const vector<int>& vec){\n    const auto size = vec.size();\n    for (size_t i = 0 ; i < size/2; ++i){\n        if (vec[i] != vec[size - i - 1])\n            return false;\n    }\n    return true;\n}\n\nvector<int> getDigits(int num, const int base){\n    vector<int> digits;\n    while(num != 0){\n        digits.push_back(num % base);\n        num /= base;\n    }\n    reverse(digits.begin(),digits.end());\n    return digits;\n}\n\nint main() {\n    const char dict[19] {'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I'};\n    int base;\n    cin >> base;\n\n    vector<int> digits;\n    for (int i = 1 ; i < 3*base*base ; ++i){\n        digits = getDigits(i*i,base);\n        if (isPalindrome(digits)){\n            cout << i << \"" \"";\n            for (auto digit : digits)\n                cout << dict[digit];\n            cout << '\\n';\n        }\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,45,328
1414511861493235712,2b65c74336f01b0786e810d4897d909e02d608659bd285f648fabba075f0323e,2021-07-12 17:08:02,C++,30.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <algorithm>\n\nusing namespace std;\n\nbool isPalindrome(const vector<int>& vec){\n    const auto size = vec.size();\n    for (size_t i = 0 ; i < size/2; ++i){\n        if (vec[i] != vec[size - i - 1])\n            return false;\n    }\n    return true;\n}\n\nvector<int> getDigits(int num, const int base){\n    vector<int> digits;\n    while(num != 0){\n        digits.push_back(num % base);\n        num /= base;\n    }\n    reverse(digits.begin(),digits.end());\n    return digits;\n}\n\nint main() {\n    const char dict[19] {'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I'};\n    int base;\n    cin >> base;\n\n    vector<int> digits;\n    for (int i = 1 ; i < 3*base*base ; ++i){\n        digits = getDigits(i*i,base);\n        if (isPalindrome(digits)){\n            for (auto digit : getDigits(i,base))\n                cout << dict[digit];\n            cout << \"" \"";\n            for (auto digit : digits)\n                cout << dict[digit];\n            cout << '\\n';\n        }\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,35,424
1414514289224617984,2b65c74336f01b0786e810d4897d909e02d608659bd285f648fabba075f0323e,2021-07-12 17:17:41,C++,30.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <algorithm>\n\nusing namespace std;\n\nbool isPalindrome(const vector<int>& vec){\n    const auto size = vec.size();\n    for (size_t i = 0 ; i < size/2; ++i){\n        if (vec[i] != vec[size - i - 1])\n            return false;\n    }\n    return true;\n}\n\nvector<int> getDigits(int num, const int base){\n    vector<int> digits {};\n    while(num != 0){\n        digits.push_back(num % base);\n        num /= base;\n    }\n    reverse(digits.begin(),digits.end());\n    return digits;\n}\n\nint main() {\n    const char dict[19] {'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I'};\n    int base;\n    cin >> base;\n\n    vector<int> digits;\n    for (int i = 1 ; i <= 3*base*base ; ++i){\n        digits = getDigits(i*i,base);\n        if (isPalindrome(digits)){\n            for (auto digit : getDigits(i,base))\n                cout << dict[digit];\n            cout << \"" \"";\n            for (auto digit : digits)\n                cout << dict[digit];\n            cout << '\\n';\n        }\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,34,376
1414514538236252160,2b65c74336f01b0786e810d4897d909e02d608659bd285f648fabba075f0323e,2021-07-12 17:18:40,C++,80.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <algorithm>\n\nusing namespace std;\n\nbool isPalindrome(const vector<int>& vec){\n    const auto size = vec.size();\n    for (size_t i = 0 ; i < size/2; ++i){\n        if (vec[i] != vec[size - i - 1])\n            return false;\n    }\n    return true;\n}\n\nvector<int> getDigits(int num, const int base){\n    vector<int> digits {};\n    while(num != 0){\n        digits.push_back(num % base);\n        num /= base;\n    }\n    reverse(digits.begin(),digits.end());\n    return digits;\n}\n\nint main() {\n    const char dict[19] {'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I'};\n    int base;\n    cin >> base;\n\n    vector<int> digits;\n    for (int i = 1 ; i <= 300 ; ++i){\n        digits = getDigits(i*i,base);\n        if (isPalindrome(digits)){\n            for (auto digit : getDigits(i,base))\n                cout << dict[digit];\n            cout << \"" \"";\n            for (auto digit : digits)\n                cout << dict[digit];\n            cout << '\\n';\n        }\n    }\n    return 0;\n}\n",ACCEPTED,35,452
1414516880800055296,2b65c74336f01b0786e810d4897d909e02d608659bd285f648fabba075f0323e,2021-07-12 17:27:59,C++,10.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <algorithm>\n\nusing namespace std;\n\nbool isPalindrome(const vector<int>& vec){\n    const auto size = vec.size();\n    for (size_t i = 0 ; i < size/2; ++i){\n        if (vec[i] != vec[size - i - 1])\n            return false;\n    }\n    return true;\n}\n\nvector<int> getDigits(int num, const int base){\n    vector<int> digits {};\n    while(num != 0){\n        digits.push_back(num % base);\n        num /= base;\n    }\n    reverse(digits.begin(),digits.end());\n    return digits;\n}\n\nbool isDoublePalindrome(const int num){\n    int count = 0;\n    for (int i = 2 ; i <= 10 ; ++i){\n        if (count >= 2)\n            return true;\n        if (isPalindrome(getDigits(num,i)))\n            ++count;\n    }\n    return false;\n}\n\nint main() {\n    int N, S;\n    cin >> N >> S;\n\n    for (int i = S+1 ; i <= S + N ; ++i){\n        if (isDoublePalindrome(i)){\n            cout << i << endl;\n        }\n    }\n\n    return 0;\n}\n",PARTIAL_ACCEPTED,41,328
1414519217905111040,2b65c74336f01b0786e810d4897d909e02d608659bd285f648fabba075f0323e,2021-07-12 17:37:16,C++,10.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <algorithm>\n\nusing namespace std;\n\nbool isPalindrome(const vector<int>& vec){\n    const auto size = vec.size();\n    for (size_t i = 0 ; i < size/2; ++i){\n        if (vec[i] != vec[size - i - 1])\n            return false;\n    }\n    return true;\n}\n\nvector<int> getDigits(int num, const int base){\n    vector<int> digits {};\n    while(num != 0){\n        digits.push_back(num % base);\n        num /= base;\n    }\n    reverse(digits.begin(),digits.end());\n    return digits;\n}\n\nbool isDoublePalindrome(const int num){\n    int count = 0;\n    for (int i = 2 ; i <= 10 ; ++i){\n        if (isPalindrome(getDigits(num,i)))\n            ++count;\n        if (count >= 2)\n            return true;\n    }\n    return false;\n}\n\nint main() {\n    int N, S;\n    cin >> N >> S;\n\n    for (int i = S+1 ; i <= S + N ; ++i){\n        if (isDoublePalindrome(i)){\n            cout << i << endl;\n        }\n    }\n\n    return 0;\n}\n",PARTIAL_ACCEPTED,37,452
1414521578357620736,2b65c74336f01b0786e810d4897d909e02d608659bd285f648fabba075f0323e,2021-07-12 17:46:39,C++,70.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <algorithm>\n\nusing namespace std;\n\nbool isPalindrome(const vector<int>& vec){\n    const auto size = vec.size();\n    for (size_t i = 0 ; i < size/2; ++i){\n        if (vec[i] != vec[size - i - 1])\n            return false;\n    }\n    return true;\n}\n\nvector<int> getDigits(int num, const int base){\n    vector<int> digits {};\n    while(num != 0){\n        digits.push_back(num % base);\n        num /= base;\n    }\n    reverse(digits.begin(),digits.end());\n    return digits;\n}\n\nbool isDoublePalindrome(const int num){\n    int count = 0;\n    for (int i = 2 ; i <= 10 ; ++i){\n        if (isPalindrome(getDigits(num,i)))\n            ++count;\n        if (count >= 2)\n            return true;\n    }\n    return false;\n}\n\nint main() {\n    int N, S;\n    cin >> N >> S;\n    int count = 0 ;\n    for (int i = S+1 ; count < N ; ++i){\n        if (isDoublePalindrome(i)){\n            cout << i << endl;\n            ++count;\n        }\n    }\n    return 0;\n}",ACCEPTED,45,448
1414852262196568064,990fbf417a90f0aa6dcafea36ed9381f3da574d701d597e643c7f41ec4b81ee5,2021-07-13 15:40:40,C++,80.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nchar l[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nstring change(int a,int b){\n    string a2{\""\""};\n    string left;\n    while(true){\n        if(a==0){\n            break;\n        }\n        left=l[a%b];\n        a2=left+a2;\n        a/=b;\n    }\n    return a2;\n}\nbool check(string a){\n    int flag{0};\n    if(a.length()==1){\n        return true;\n    }\n    else{\n            for(int i=0;i<a.length()/2;i++){\n                if(a[i]!=a[a.length()-1-i]){\n                    flag=1;\n                    break;\n                }\n            }\n            if(flag==1){\n                return false;\n            }\n            else{\n                return true;\n            }\n    }\n}\nint main(){\n    int N,sqrt;\n    string a,b;\n    cin>>N;\n    for(int i=1;i<=300;i++){\n        sqrt=i*i;\n        a=change(i,N);\n        b=change(sqrt,N);\n        if(check(b)){\n            cout<<a<<\"" \""<<b<<endl;\n        }\n    }\n}",ACCEPTED,42,320
1414854780357087232,ab5baabd25753270c448a497aae45b35e510fa2f19ff49cf0343e8a6f0fd0cc0,2021-07-13 15:50:41,C++,10.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\n#include<typeinfo>\nusing namespace std;\nint main()\n{\n    int N,S,sz;\n    cin>>N>>S;\n    sz=S+1;\n    for(int i=0;i<N;i++)\n    {\n        while (1==1)\n        {\n            int j=0,sz10,js=0;\n            sz10=sz;\n            string s_sz10,s_zs10;\n            char c_sz10[10];\n            for(int i=2;i<=10;i++)\n            {\n                while(sz10)\n                {\n                    c_sz10[j]=sz10%i;\n                    sz10/=i;\n                    j+=1;\n                }\n                s_sz10=c_sz10;\n                s_zs10=s_sz10;\n                reverse(s_sz10.begin(),s_sz10.end());\n                if(s_sz10.compare(s_zs10)==0 and s_sz10[0]!='0' and s_zs10[0]!='0')\n                {\n                    js+=1;\n                }\n            }\n            if(js>=2)\n            {\n                cout<<sz<<endl;\n                break;\n            }\n            sz+=1;\n        }\n        sz+=1;\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,31,428
1414855076431945728,ab5baabd25753270c448a497aae45b35e510fa2f19ff49cf0343e8a6f0fd0cc0,2021-07-13 15:51:51,C++,10.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\n#include<typeinfo>\nusing namespace std;\nint main()\n{\n    int N,S,sz;\n    cin>>N>>S;\n    sz=S+1;\n    for(int i=0;i<N;i++)\n    {\n        while (1==1)\n        {\n            int j=0,sz10,js=0;\n            sz10=sz;\n            string s_sz10,s_zs10;\n            char c_sz10[10];\n            for(int i=2;i<=10;i++)\n            {\n                while(sz10)\n                {\n                    c_sz10[j]=sz10%i;\n                    sz10/=i;\n                    j+=1;\n                }\n                s_sz10=c_sz10;\n                s_zs10=s_sz10;\n                reverse(s_sz10.begin(),s_sz10.end());\n                if(s_sz10.compare(s_zs10)==0 and s_sz10[0]!='0' and s_zs10[0]!='0')\n                {\n                    js+=1;\n                }\n            }\n            if(js>=2)\n            {\n                cout<<sz<<endl;\n                break;\n            }\n            sz+=1;\n        }\n        sz+=1;\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,33,336
1414857593808130048,ab5baabd25753270c448a497aae45b35e510fa2f19ff49cf0343e8a6f0fd0cc0,2021-07-13 16:01:51,C++,10.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\n#include<typeinfo>\nusing namespace std;\nint main()\n{\n    int N,S,sz;\n    cin>>N>>S;\n    sz=S+1;\n    for(int i=0;i<N;i++)\n    {\n        while (1==1)\n        {\n            int j=0,sz10,js=0;\n            sz10=sz;\n            string s_sz10,s_zs10;\n            char c_sz10[10];\n            for(int i=2;i<=10;i++)\n            {\n                while(sz10)\n                {\n                    c_sz10[j]=sz10%i;\n                    sz10/=i;\n                    j+=1;\n                }\n                s_sz10=c_sz10;\n                s_zs10=s_sz10;\n                reverse(s_sz10.begin(),s_sz10.end());\n                if(s_sz10.compare(s_zs10)==0 and c_sz10[0]!='0' and c_sz10[j-1]!='0')\n                {\n                    js+=1;\n                }\n            }\n            if(js>=2)\n            {\n                cout<<sz<<endl;\n                break;\n            }\n            sz+=1;\n        }\n        sz+=1;\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,31,320
1414858580253904896,990fbf417a90f0aa6dcafea36ed9381f3da574d701d597e643c7f41ec4b81ee5,2021-07-13 16:05:46,C++,40.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nchar biao[10]={'0','1','2','3','4','5','6','7','8','9'};\nstring change(int a,int b){\n    string a2{\""\""};\n    while(true){\n        string left;\n        if(a==0){\n            break;\n        }\n        left=biao[a%b];\n        a2=left+a2;\n        a/=b;\n    }\n    return a2;\n}\nbool check(string a){\n    int flag{0};\n    if(a.length()==1){\n        return true;\n    }\n    else{\n        for(int i=0;i<a.length()/2;i++){\n            if(a[i]!=a[a.length()-1-i]){\n                flag=1;\n                break;\n            }\n        }\n        if(flag==1){\n            return false;\n        }\n        else{\n            return true;\n        }\n    }\n}\nint main(){\n    int N,S;\n    cin>>N>>S;\n    int number{0},flag{0};\n    for(int i=S+1;;i++){\n        flag=0;\n        if(number==N){\n            break;\n        }\n        for(int j=2;j<=10;j++){\n            if(flag==2){\n                cout<<i<<endl;\n                number+=1;\n                break;\n            }\n            if(check(change(i,j))){\n                flag+=1;\n            }\n        }\n    }\n}",PARTIAL_ACCEPTED,94,440
1414860004719235072,ab5baabd25753270c448a497aae45b35e510fa2f19ff49cf0343e8a6f0fd0cc0,2021-07-13 16:11:26,C++,10.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\n#include<typeinfo>\nusing namespace std;\nint main()\n{\n    int N,S,sz;\n    cin>>N>>S;\n    sz=S+1;\n    for(int i=0;i<N;i++)\n    {\n        while (1==1)\n        {\n            int j=0,sz10,js=0;\n            sz10=sz;\n            string s_sz10,s_zs10;\n            char c_sz10[10];\n            for(int i=2;i<=10;i++)\n            {\n                while(sz10)\n                {\n                    c_sz10[j]=sz10%i;\n                    sz10/=i;\n                    j+=1;\n                }\n                s_sz10=c_sz10;\n                s_zs10=s_sz10;\n                reverse(s_sz10.begin(),s_sz10.end());\n                if(s_sz10.compare(s_zs10)==0 and c_sz10[0]!='0')\n                {\n                    js+=1;\n                }\n            }\n            if(js>=2)\n            {\n                cout<<sz<<endl;\n                break;\n            }\n            sz+=1;\n        }\n        sz+=1;\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,33,324
1414860057423798272,990fbf417a90f0aa6dcafea36ed9381f3da574d701d597e643c7f41ec4b81ee5,2021-07-13 16:11:39,C++,10.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nchar biao[10]={'0','1','2','3','4','5','6','7','8','9'};\nstring change(int a,int b){\n    string a2{\""\""};\n    while(true){\n        string left;\n        if(a==0){\n            break;\n        }\n        left=biao[a%b];\n        a2=left+a2;\n        a/=b;\n    }\n    return a2;\n}\nbool check(string a){\n    int flag{0};\n    if(a.length()==1){\n        return true;\n    }\n    else{\n        for(int i=0;i<a.length()/2;i++){\n            if(a[i]!=a[a.length()-1-i]){\n                flag=1;\n                break;\n            }\n        }\n        if(flag==1){\n            return false;\n        }\n        else{\n            return true;\n        }\n    }\n}\nint main(){\n    int N,S;\n    cin>>N>>S;\n    int number{0},flag{0};\n    for(int i=S+1;;i++){\n        flag=0;\n        if(number==N){\n            break;\n        }\n        for(int j=2;j<=10;j++){\n            if(flag==3){\n                cout<<i<<endl;\n                number+=1;\n                break;\n            }\n            if(check(change(i,j))){\n                flag+=1;\n            }\n        }\n    }\n}",PARTIAL_ACCEPTED,108,332
1414860231253594112,ab5baabd25753270c448a497aae45b35e510fa2f19ff49cf0343e8a6f0fd0cc0,2021-07-13 16:12:20,C++,10.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\n#include<typeinfo>\nusing namespace std;\nint main()\n{\n    int N,S,sz;\n    cin>>N>>S;\n    sz=S+1;\n    for(int i=0;i<N;i++)\n    {\n        while (1==1)\n        {\n            int j=0,sz10,js=0;\n            sz10=sz;\n            string s_sz10,s_zs10;\n            char c_sz10[10];\n            for(int i=2;i<=10;i++)\n            {\n                while(sz10)\n                {\n                    c_sz10[j]=sz10%i;\n                    sz10/=i;\n                    j+=1;\n                }\n                s_sz10=c_sz10;\n                s_zs10=s_sz10;\n                reverse(s_sz10.begin(),s_sz10.end());\n                if(s_sz10.compare(s_zs10)==0)\n                {\n                    js+=1;\n                }\n            }\n            if(js>=2)\n            {\n                cout<<sz<<endl;\n                break;\n            }\n            sz+=1;\n        }\n        sz+=1;\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,35,452
1414863402007945216,990fbf417a90f0aa6dcafea36ed9381f3da574d701d597e643c7f41ec4b81ee5,2021-07-13 16:24:56,C++,40.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nchar biao[10]={'0','1','2','3','4','5','6','7','8','9'};\nstring change(int a,int b){\n    string a2{\""\""};\n    while(true){\n        string left;\n        if(a==0){\n            break;\n        }\n        left=biao[a%b];\n        a2=left+a2;\n        a/=b;\n    }\n    return a2;\n}\nbool check(string a){\n    int flag{0};\n    if(a.length()==1){\n        return true;\n    }\n    else{\n        for(int i=0;i<a.length()/2;i++){\n            if(a[i]!=a[a.length()-1-i]){\n                flag=1;\n                break;\n            }\n        }\n        if(flag==1){\n            return false;\n        }\n        else{\n            return true;\n        }\n    }\n}\nint main(){\n    int N,S;\n    cin>>N>>S;\n    int number{0},flag{0};\n    for(int i=S+1;;i++){\n        flag=0;\n        if(number==N){\n            break;\n        }\n        for(int j=2;j<=10;j++){\n            if(flag>1){\n                cout<<i<<endl;\n                number+=1;\n                break;\n            }\n            if(check(change(i,j))){\n                flag+=1;\n            }\n        }\n    }\n}",PARTIAL_ACCEPTED,47,376
1414863828149231616,990fbf417a90f0aa6dcafea36ed9381f3da574d701d597e643c7f41ec4b81ee5,2021-07-13 16:26:38,C++,10.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nchar biao[10]={'0','1','2','3','4','5','6','7','8','9'};\nstring change(int a,int b){\n    string a2{\""\""};\n    while(true){\n        string left;\n        if(a==0){\n            break;\n        }\n        left=biao[a%b];\n        a2=left+a2;\n        a/=b;\n    }\n    return a2;\n}\nbool check(string a){\n    int flag{0};\n    if(a.length()==1){\n        return true;\n    }\n    else{\n        for(int i=0;i<a.length()/2;i++){\n            if(a[i]!=a[a.length()-1-i]){\n                flag=1;\n                break;\n            }\n        }\n        if(flag==1){\n            return false;\n        }\n        else{\n            return true;\n        }\n    }\n}\nint main(){\n    int N,S;\n    cin>>N>>S;\n    int number{0},flag{0};\n    for(int i=S+1;;i++){\n        flag=0;\n        if(number==N){\n            break;\n        }\n        for(int j=2;j<=10;j++){\n            if(flag>0){\n                cout<<i<<endl;\n                number+=1;\n                break;\n            }\n            if(check(change(i,j))){\n                flag+=1;\n            }\n        }\n    }\n}",PARTIAL_ACCEPTED,74,340
1414863929434345472,990fbf417a90f0aa6dcafea36ed9381f3da574d701d597e643c7f41ec4b81ee5,2021-07-13 16:27:02,C++,10.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nchar biao[10]={'0','1','2','3','4','5','6','7','8','9'};\nstring change(int a,int b){\n    string a2{\""\""};\n    while(true){\n        string left;\n        if(a==0){\n            break;\n        }\n        left=biao[a%b];\n        a2=left+a2;\n        a/=b;\n    }\n    return a2;\n}\nbool check(string a){\n    int flag{0};\n    if(a.length()==1){\n        return true;\n    }\n    else{\n        for(int i=0;i<a.length()/2;i++){\n            if(a[i]!=a[a.length()-1-i]){\n                flag=1;\n                break;\n            }\n        }\n        if(flag==1){\n            return false;\n        }\n        else{\n            return true;\n        }\n    }\n}\nint main(){\n    int N,S;\n    cin>>N>>S;\n    int number{0},flag{0};\n    for(int i=S+1;;i++){\n        flag=0;\n        if(number==N){\n            break;\n        }\n        for(int j=2;j<=10;j++){\n            if(flag>2){\n                cout<<i<<endl;\n                number+=1;\n                break;\n            }\n            if(check(change(i,j))){\n                flag+=1;\n            }\n        }\n    }\n}",PARTIAL_ACCEPTED,109,456
1414866036378984448,990fbf417a90f0aa6dcafea36ed9381f3da574d701d597e643c7f41ec4b81ee5,2021-07-13 16:35:24,C++,10.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nchar biao[10]={'0','1','2','3','4','5','6','7','8','9'};\nstring change(int a,int b){\n    string a2{\""\""};\n    while(true){\n        string left;\n        if(a==0){\n            break;\n        }\n        left=biao[a%b];\n        a2=left+a2;\n        a/=b;\n    }\n    return a2;\n}\nbool check(string a){\n    int flag{0};\n    if(a.length()==1){\n        return true;\n    }\n    else{\n        for(int i=0;i<a.length()/2;i++){\n            if(a[i]!=a[a.length()-1-i]){\n                flag=1;\n                break;\n            }\n        }\n        if(flag==1){\n            return false;\n        }\n        else{\n            return true;\n        }\n    }\n}\nint main(){\n    int N,S;\n    cin>>N>>S;\n    int number{0},fl{0};\n    for(int i=S+1;;i++){\n        fl=0;\n        if(number==N){\n            break;\n        }\n        for(int j=2;j<=10;j++){\n            if(fl>2){\n                cout<<i<<endl;\n                number+=1;\n                break;\n            }\n            if(check(change(i,j))){\n                fl+=1;\n            }\n        }\n    }\n}",PARTIAL_ACCEPTED,80,452
1414867276279222272,990fbf417a90f0aa6dcafea36ed9381f3da574d701d597e643c7f41ec4b81ee5,2021-07-13 16:40:20,C++,40.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nchar biao[10]={'0','1','2','3','4','5','6','7','8','9'};\nstring change(int a,int b){\n    string a2{\""\""};\n    while(true){\n        string left;\n        if(a==0){\n            break;\n        }\n        left=biao[a%b];\n        a2=left+a2;\n        a/=b;\n    }\n    return a2;\n}\nbool check(string a){\n    int flag{0};\n    if(a.length()==1){\n        return true;\n    }\n    else{\n        for(int i=0;i<a.length()/2;i++){\n            if(a[i]!=a[a.length()-1-i]){\n                flag=1;\n                break;\n            }\n        }\n        if(flag==1){\n            return false;\n        }\n        else{\n            return true;\n        }\n    }\n}\nint main(){\n    int N,S;\n    cin>>N>>S;\n    int number{0},fl{0};\n    for(int i=S+1;;i++){\n        fl=0;\n        if(number==N){\n            break;\n        }\n        for(int j=2;j<=10;j++){\n            if(fl>1){\n                cout<<i<<endl;\n                number+=1;\n                break;\n            }\n            if(check(change(i,j))){\n                fl+=1;\n            }\n        }\n    }\n}",PARTIAL_ACCEPTED,88,328
1414870603700277248,990fbf417a90f0aa6dcafea36ed9381f3da574d701d597e643c7f41ec4b81ee5,2021-07-13 16:53:33,C++,70.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nchar biao[10]={'0','1','2','3','4','5','6','7','8','9'};\nstring change(int a,int b){\n    string a2{\""\""};\n    while(true){\n        string left;\n        if(a==0){\n            break;\n        }\n        left=biao[a%b];\n        a2=left+a2;\n        a/=b;\n    }\n    return a2;\n}\nbool check(string a){\n    int flag{0};\n    if(a.length()==1){\n        return true;\n    }\n    else{\n        for(int i=0;i<a.length()/2;i++){\n            if(a[i]!=a[a.length()-1-i]){\n                flag=1;\n                break;\n            }\n        }\n        if(flag==1){\n            return false;\n        }\n        else{\n            return true;\n        }\n    }\n}\nint main(){\n    int N,S;\n    cin>>N>>S;\n    int number{0},fl{0};\n    for(int i=S+1;;i++){\n        fl=0;\n        if(number==N){\n            break;\n        }\n        for(int j=2;j<=11;j++){\n            if(fl>1){\n                cout<<i<<endl;\n                number+=1;\n                break;\n            }\n            if(check(change(i,j))){\n                fl+=1;\n            }\n        }\n    }\n}",ACCEPTED,46,444
1414884922559205376,5811d0b4f5369d7bf67a9e340a71c0aae09ae995a771456d319f9dfd43448cff,2021-07-13 17:50:27,C++,80.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nbool isHWen(const string s){\n    int len = s.length();\n    int mid = len / 2;\n    int t = 1;\n    for(int i=0;i<=mid;i++){\n       if(s[i]!=s[len-i-1]){\n          t = 0;\n          break;\n       }\n    }\n    if(t){\n       return true;\n    }\n    else\n        return false;\n}\n\nstring change(int n,int B){\n    string ans = \""\"";\n    while(n!=0){\n        int t = n%B;\n        n/=B;\n        if((t>=0)&&(t<=9)){\n            ans+=t+'0';\n        }\n        else{\n            ans+=t-10+'A';\n        }\n    }\n    reverse(ans.begin(),ans.end());\n    return ans;\n}\n\nint main(){\n    int B;\n    cin >> B;\n    for(int i=1;i<=300;i++){\n        string s1 = change(i,B);\n        string s2 = change(i*i,B);\n        if(isHWen(s2)){\n            cout << s1 << \"" \"" << s2 << endl;\n        }\n    }\n    return 0;\n}\n",ACCEPTED,35,448
1414894725616537600,5811d0b4f5369d7bf67a9e340a71c0aae09ae995a771456d319f9dfd43448cff,2021-07-13 18:29:24,C++,10.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nbool isHWen(const string s){\n    int len = s.length();\n    int mid = len / 2;\n    int t = 1;\n    for(int i=0;i<=mid;i++){\n       if(s[i]!=s[len-i-1]){\n          t = 0;\n          break;\n       }\n    }\n    if(t){\n       return true;\n    }\n    else\n        return false;\n}\n\nint main(){\n    int N,S;\n    cin >> N >> S;\n    for(int i=S+1;i<=S+N;i++){\n        int sum = 0;\n        for(int j=2;j<=10;j++){\n            int ans = i;\n            int t = 0;\n            string str1 = \""\"";\n            while(ans){\n                t=ans%j;\n                str1+=t+'0';\n                ans/=j;\n            }\n            if(isHWen(str1)){\n                sum++;\n            }\n        }\n        if(sum>=2){\n            cout << i << endl;\n        }\n\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,50,452
1414898297091559424,5811d0b4f5369d7bf67a9e340a71c0aae09ae995a771456d319f9dfd43448cff,2021-07-13 18:43:36,C++,10.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nbool isHWen(const string s){\n    int len = s.length();\n    int mid = len / 2;\n    int t = 1;\n    for(int i=0;i<=mid;i++){\n       if(s[i]!=s[len-i-1]){\n          t = 0;\n          break;\n       }\n    }\n    if(t){\n       return true;\n    }\n    else\n        return false;\n}\n\nstring change(int n,int B){\n    string ans = \""\"";\n    while(n!=0){\n        int t = n%B;\n        n/=B;\n        if((t>=0)&&(t<=9)){\n            ans+=t+'0';\n        }\n        else{\n            ans+=t-10+'A';\n        }\n    }\n    reverse(ans.begin(),ans.end());\n    return ans;\n}\n\nint main(){\n    int N,S;\n    cin >> N >> S;\n    for(int i=S+1;i<=S+N;i++){\n        int sum = 0;\n        for(int b=2;b<=10;b++){\n            int t = i;\n            string str = \""\"";\n            str = change(t,b);\n            if(isHWen(str)){\n                sum++;\n            }\n        }\n        if(sum>=2){\n            cout << i << endl;\n        }\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,34,324
1414899593314983936,5811d0b4f5369d7bf67a9e340a71c0aae09ae995a771456d319f9dfd43448cff,2021-07-13 18:48:45,C++,0.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nbool isHWen(const string s){\n    int len = s.length();\n    int mid = len / 2;\n    int t = 1;\n    for(int i=0;i<=mid;i++){\n       if(s[i]!=s[len-i-1]){\n          t = 0;\n          break;\n       }\n    }\n    if(t){\n       return true;\n    }\n    else\n        return false;\n}\n\nint main(){\n    int N,S;\n    cin >> N >> S;\n    for(int i=S+1;;i++){\n        int sum = 0;\n        for(int j=2;j<=10;j++){\n            int ans = i;\n            int t = 0;\n            string str1 = \""\"";\n            while(ans){\n                t=ans%j;\n                str1+=t+'0';\n                ans/=j;\n            }\n            if(isHWen(str1)){\n                sum++;\n                N--;\n            }\n        }\n        if(sum>=2){\n            cout << i << endl;\n        }\n        if(N==0){\n            break;\n        }\n    }\n    return 0;\n}\n",MULTIPLE_ERROR,68,472
1414899855031164928,5811d0b4f5369d7bf67a9e340a71c0aae09ae995a771456d319f9dfd43448cff,2021-07-13 18:49:47,C++,70.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nbool isHWen(const string s){\n    int len = s.length();\n    int mid = len / 2;\n    int t = 1;\n    for(int i=0;i<=mid;i++){\n       if(s[i]!=s[len-i-1]){\n          t = 0;\n          break;\n       }\n    }\n    if(t){\n       return true;\n    }\n    else\n        return false;\n}\n\nint main(){\n    int N,S;\n    cin >> N >> S;\n    for(int i=S+1;;i++){\n        int sum = 0;\n        for(int j=2;j<=10;j++){\n            int ans = i;\n            int t = 0;\n            string str1 = \""\"";\n            while(ans){\n                t=ans%j;\n                str1+=t+'0';\n                ans/=j;\n            }\n            if(isHWen(str1)){\n                sum++;\n            }\n        }\n        if(sum>=2){\n            N--;\n            cout << i << endl;\n        }\n        if(N==0){\n            break;\n        }\n    }\n    return 0;\n}\n",ACCEPTED,40,320
1414922885946040320,a42017b4b729a9f54a3339b5f28ebfcc61560f2ddd739973e19825455d3a6e59,2021-07-13 20:21:18,C++,0.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint j,k,cnt;\nstring s;\nvoid  change(int x,int n)\n{\n    while(x)\n    {\n        if(x%n>=0&&x%n<=9)\n    s+=(x%n+'0');\n    else\n         s+=(x%n+'A'-10);\n      x/=n;\n    }\n}\nint main()\n{\n    cin>>j>>k;\n    for(int v=k+1;;v++)\n    {\n        int cntt=0;\n    for(int i=2;i<=10;i++)\n   {\n       s.clear();\n    change(v,i);\n    string k(s.begin(),s.end());\n   reverse(s.begin(),s.end());\n   if(s==k)\n   {\n       cntt++;\n       //cout<<cntt;\n       if(cntt==2)\n       {\n           cout<<v<<endl;\n           cnt++;\n           break;\n       }\n   }\n   }\n   if(cnt==j)break;\n    }\n    return 0;\n}\n————————————————\n版权声明：本文为CSDN博主「菱形继承」的原创文章，遵循CC 4.0 BY-SA版权协议，转载请附上原文出处链接及本声明。\n原文链接：https://blog.csdn.net/weixin_43798170/article/details/88410101",COMPILE_ERROR,0,0
1414923016745410560,a42017b4b729a9f54a3339b5f28ebfcc61560f2ddd739973e19825455d3a6e59,2021-07-13 20:21:49,C++,70.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint j,k,cnt;\nstring s;\nvoid  change(int x,int n)\n{\n    while(x)\n    {\n        if(x%n>=0&&x%n<=9)\n    s+=(x%n+'0');\n    else\n         s+=(x%n+'A'-10);\n      x/=n;\n    }\n}\nint main()\n{\n    cin>>j>>k;\n    for(int v=k+1;;v++)\n    {\n        int cntt=0;\n    for(int i=2;i<=10;i++)\n   {\n       s.clear();\n    change(v,i);\n    string k(s.begin(),s.end());\n   reverse(s.begin(),s.end());\n   if(s==k)\n   {\n       cntt++;\n       //cout<<cntt;\n       if(cntt==2)\n       {\n           cout<<v<<endl;\n           cnt++;\n           break;\n       }\n   }\n   }\n   if(cnt==j)break;\n    }\n    return 0;\n}\n",ACCEPTED,39,452
1415186632602181632,1892622b7b389002d79d4468859dd8a0427020b8d4b939ae28cbd0b2e64adf3b,2021-07-14 13:49:20,C++,0.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint n;\n\n\nstring transfer(int a){\n    string s = \""\"";\n    while(a){\n        int temp = a%n;\n        a/=n;\n        \n        if(temp < 10 && temp >= 0){\n            s += (temp + '0');\n        }\n        else{\n            s += (temp - 10 + 'A');\n        }\n    }\n    return s;\n}\nint main(){\n    cin >> n;\n    for(int i = 1;i<=300;i++){\n        string temp = transfer(pow(i,2));\n        string s1 = temp;\n        reverse(s1.begin(),s1.end());\n        if(s1 == temp){\n            cout << 1 << \"" \"" << s1 << endl;\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,32,332
1415187192374272000,1892622b7b389002d79d4468859dd8a0427020b8d4b939ae28cbd0b2e64adf3b,2021-07-14 13:51:34,C++,10.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint n;\nstring transfer(int a){\n    string s = \""\"";\n    while(a){\n        int temp = a%n;\n        a/=n;\n        \n        if(temp < 10 && temp >= 0){\n            s += (temp + '0');\n        }\n        else{\n            s += (temp - 10 + 'A');\n        }\n    }\n    return s;\n}\nint main(){\n    cin >> n;\n    for(int i = 1;i<=300;i++){\n        string temp = transfer(pow(i,2));\n        string s1 = temp;\n        reverse(s1.begin(),s1.end());\n        if(s1 == temp){\n            cout << transfer(i) << \"" \"" << s1 << endl;\n        }\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,33,468
1415187396884340736,1892622b7b389002d79d4468859dd8a0427020b8d4b939ae28cbd0b2e64adf3b,2021-07-14 13:52:22,C++,80.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint n;\nstring transfer(int a){\n    string s = \""\"";\n    while(a){\n        int temp = a%n;\n        a/=n;\n        \n        if(temp < 10 && temp >= 0){\n            s += (temp + '0');\n        }\n        else{\n            s += (temp - 10 + 'A');\n        }\n    }\n    reverse(s.begin(),s.end());\n    return s;\n}\nint main(){\n    cin >> n;\n    for(int i = 1;i<=300;i++){\n        string temp = transfer(pow(i,2));\n        string s1 = temp;\n        reverse(s1.begin(),s1.end());\n        if(s1 == temp){\n            cout << transfer(i) << \"" \"" << s1 << endl;\n        }\n    }\n    return 0;\n}\n",ACCEPTED,47,452
1415199739697602560,65544e754d74a4945ae1564c900724e6ddc2903d0323c1942723de258a0f249b,2021-07-14 14:41:25,C++,10.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\n#include<typeinfo>\nusing namespace std;\nint main()\n{\n    int N,S,sz;\n    cin>>N>>S;\n    sz=S+1;\n    for(int i=0;i<N;i++)\n    {\n        while (1)\n        {\n            int j=0,sz10,js=0;\n            sz10=sz;\n            string s_sz10,s_zs10;\n            char c_sz10[10];\n            for(int i=2;i<=10;i++)\n            {\n                while(sz10)\n                {\n                    c_sz10[j]=sz10%i;\n                    sz10/=i;\n                    j+=1;\n                }\n                s_sz10=c_sz10;\n                s_zs10=s_sz10;\n                reverse(s_sz10.begin(),s_sz10.end());\n                if(s_sz10.compare(s_zs10)==0)\n                {\n                    js+=1;\n                }\n            }\n            if(js>=2)\n            {\n                cout<<sz<<endl;\n                break;\n            }\n            sz+=1;\n        }\n        sz+=1;\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,34,320
1415200233933135872,65544e754d74a4945ae1564c900724e6ddc2903d0323c1942723de258a0f249b,2021-07-14 14:43:23,C++,0.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\n#include<typeinfo>\nusing namespace std;\nint main()\n{\n    int N,S,sz;\n    cin>>N>>S;\n    sz=S+1;\n    for(int i=0;i<N;i++)\n    {\n        while (1)\n        {\n            int j=0,sz10,js=0;\n            sz10=sz;\n            string s_sz10,s_zs10;\n            int c_sz10[10];\n            for(int i=2;i<=10;i++)\n            {\n                while(sz10)\n                {\n                    c_sz10[j]=sz10%i;\n                    sz10/=i;\n                    j+=1;\n                }\n                s_sz10=c_sz10;\n                s_zs10=s_sz10;\n                reverse(s_sz10.begin(),s_sz10.end());\n                if(s_sz10.compare(s_zs10)==0)\n                {\n                    js+=1;\n                }\n            }\n            if(js>=2)\n            {\n                cout<<sz<<endl;\n                break;\n            }\n            sz+=1;\n        }\n        sz+=1;\n    }\n    return 0;\n}",COMPILE_ERROR,0,0
1415206189517660160,1892622b7b389002d79d4468859dd8a0427020b8d4b939ae28cbd0b2e64adf3b,2021-07-14 15:07:03,C++,40.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n\nstring transfer(int a,int n){\n    string s = \""\"";\n    while(a){\n        int temp = a%n;\n        a/=n;\n        s += (temp + '0');      \n    }\n    reverse(s.begin(),s.end());\n    return s;\n}\nint main(){\n    int n,m;\n    cin >> n >> m;\n    int icount = 0;\n    for(int i = m;;i++){\n        int flag = 0;\n        for(int j = 2;j<=10;j++){\n            string temp = transfer(i,j);\n            string s1 = temp;\n            reverse(s1.begin(),s1.end());\n            if(s1 == temp){\n                flag++;\n            }\n            if(flag >= 2){\n                break;\n            }\n        }\n        if(flag >= 2){\n            cout << i << endl;\n            icount++;\n            continue;\n        }\n        if(icount == n){\n            break;\n        }\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,25,476
1415206814905163776,1892622b7b389002d79d4468859dd8a0427020b8d4b939ae28cbd0b2e64adf3b,2021-07-14 15:09:32,C++,40.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n\nstring transfer(int a,int n){\n    string s = \""\"";\n    if(n == 10){\n        stringstream ss;\n        ss << a;\n        ss >> s;\n        return s;\n    }\n    else{\n        while(a){\n            int temp = a%n;\n            a/=n;\n            s += (temp + '0');      \n        }\n        reverse(s.begin(),s.end());\n        return s;\n    }\n}\nint main(){\n    int n,m;\n    cin >> n >> m;\n    int icount = 0;\n    for(int i = m;;i++){\n        int flag = 0;\n        for(int j = 2;j<=10;j++){\n            string temp = transfer(i,j);\n            string s1 = temp;\n            reverse(s1.begin(),s1.end());\n            if(s1 == temp){\n                flag++;\n            }\n            if(flag >= 2){\n                break;\n            }\n        }\n        if(flag >= 2){\n            cout << i << endl;\n            icount++;\n            continue;\n        }\n        if(icount == n){\n            break;\n        }\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,34,320
1415207837526810624,1892622b7b389002d79d4468859dd8a0427020b8d4b939ae28cbd0b2e64adf3b,2021-07-14 15:13:36,C++,70.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <iostream>  \n#include <vector>\n#include <string>  \n#include <algorithm>  \nusing namespace std;\n\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1])\n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1) // 是回文数；\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，n是待转数字，radix是指定的进制\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\n        {\n            ans += t + '0';\n        }\n        else\n        {\n            ans += t - 10 + 'A';\n        }\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（）以防止输入为0的情况\n    reverse(ans.begin(), ans.end());\n    return ans;\n}\n\nint main()\n{\n    int n, s;\n    cin >> n >> s;\n    s++; //双重回文数要大于s，从s+1开始遍历；\n    vector<int> p; // 容器p，存放双重回文数；\n    int sum; // 记录有几种进制的数是回文数；\n    while ((p.size() < n)) // 根据容器p里双重回文数的个数决定是否终止程序；\n    {\n        sum = 0;\n        for (int i = 2; i <= 10; i++)\n        {\n            if (Palin_num(intToA(s, i))) // 此时对应进制的数是回文数；\n            {\n                sum++; // 记录次数+1；\n            }\n        }\n        if (sum >= 2) // 双重回文数，压入容器p中；\n        {\n            p.push_back(s);\n        }\n        s++; // 继续遍历；\n    }\n    for (int i = 0; i < p.size(); i++)\n    {\n        cout << p[i] << endl;\n    }\n    return 0;\n}",ACCEPTED,37,444
1415209372390416384,1892622b7b389002d79d4468859dd8a0427020b8d4b939ae28cbd0b2e64adf3b,2021-07-14 15:19:42,C++,40.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n\nstring transfer(int a,int n){\n    string s = \""\"";\n    if(n == 10){\n        stringstream ss;\n        ss << a;\n        ss >> s;\n        return s;\n    }\n    else{\n        while(a){\n            int temp = a%n;\n            a/=n;\n            s += (temp + '0');      \n        }\n        reverse(s.begin(),s.end());\n        return s;\n    }\n}\nint main(){\n    int n,m;\n    cin >> n >> m;\n    int icount = 0;\n    for(int i = m;;i++){\n        int flag = 0;\n        for(int j = 2;j<=10;j++){\n            string temp = transfer(i,j);\n            string s1 = temp;\n            reverse(s1.begin(),s1.end());\n            if(s1 == temp){\n                flag++;\n            }\n            if(flag >= 2){\n                break;\n            }\n        }\n        if(flag >= 2){\n            cout << i << endl;\n            icount++;\n            continue;\n        }\n        if(icount == n){\n            break;\n        }\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,33,456
1415210025322192896,1892622b7b389002d79d4468859dd8a0427020b8d4b939ae28cbd0b2e64adf3b,2021-07-14 15:22:18,C++,40.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n\nstring transfer(int a,int n){\n    string s = \""\"";\n    if(n == 10){\n        stringstream ss;\n        ss << a;\n        ss >> s;\n        return s;\n    }\n    else{\n        while(a){\n            int temp = a%n;\n            a/=n;\n            s += (temp + '0');      \n        }\n        reverse(s.begin(),s.end());\n        return s;\n    }\n}\nint tellreverse(const string a){\n    string s1 = a;\n    for (int i = 0; i <= (a.length() / 2); i++){\n        if (a[i] != a[a.length() - i - 1]){\n            return 0;\n        }\n    }\n    return 1;\n}\nint main(){\n    int n,m;\n    cin >> n >> m;\n    int icount = 0;\n    for(int i = m;;i++){\n        int flag = 0;\n        for(int j = 2;j<=10;j++){\n            string temp = transfer(i,j);\n            if(tellreverse(temp)){\n                flag++;\n            }\n            if(flag >= 2){\n                break;\n            }\n        }\n        if(flag >= 2){\n            cout << i << endl;\n            icount++;\n            continue;\n        }\n        if(icount == n){\n            break;\n        }\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,28,464
1415215627112980480,1892622b7b389002d79d4468859dd8a0427020b8d4b939ae28cbd0b2e64adf3b,2021-07-14 15:44:33,C++,0.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n\nstring transfer(int a,int n){\n    string s = \""\"";\n    if(n == 10){\n        stringstream ss;\n        ss << a;\n        ss >> s;\n        return s;\n    }\n    else{\n        while(a){\n            int temp = a%n;\n            a/=n;\n            s += (temp + '0');      \n        }\n        reverse(s.begin(),s.end());\n        return s;\n    }\n}\nint tellreverse(const string a){\n    int length = a.length();\n    string s1 = a;\n    for (int i = 0; i <= (length/ 2); i++){\n        if (a[i] != a[length - i - 1]){\n            return 0;\n        }\n    }\n    return 1;\n}\nint main(){\n    int n,m;\n    cin >> n >> m;\n    vector<int> num;\n    while(num.size() < m){\n        int flag = 0;\n        for(int j = 2;j<=10;j++){\n            string temp = transfer(m,j);\n            if(tellreverse(temp)){\n                flag++;\n            }\n            if(flag >= 2){\n                break;\n            }\n        }\n        if(flag >= 2){\n            num.push_back(m);\n            continue;\n        }\n        m++;\n    }\n    return 0;\n}\n",WRONG_ANSWER,37,456
1415215797619548160,1892622b7b389002d79d4468859dd8a0427020b8d4b939ae28cbd0b2e64adf3b,2021-07-14 15:45:14,C++,0.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n\nstring transfer(int a,int n){\n    string s = \""\"";\n    if(n == 10){\n        stringstream ss;\n        ss << a;\n        ss >> s;\n        return s;\n    }\n    else{\n        while(a){\n            int temp = a%n;\n            a/=n;\n            s += (temp + '0');      \n        }\n        reverse(s.begin(),s.end());\n        return s;\n    }\n}\nint tellreverse(const string a){\n    int length = a.length();\n    string s1 = a;\n    for (int i = 0; i <= (length/ 2); i++){\n        if (a[i] != a[length - i - 1]){\n            return 0;\n        }\n    }\n    return 1;\n}\nint main(){\n    int n,m;\n    cin >> n >> m;\n    vector<int> num;\n    while(num.size() < m){\n        int flag = 0;\n        for(int j = 2;j<=10;j++){\n            string temp = transfer(m,j);\n            if(tellreverse(temp)){\n                flag++;\n            }\n            if(flag >= 2){\n                break;\n            }\n        }\n        if(flag >= 2){\n            num.push_back(m);\n            continue;\n        }\n        m++;\n    }\n    for(int i = 0;i<n;i++){\n        cout << v[i] << endl;\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1415215885209477120,1892622b7b389002d79d4468859dd8a0427020b8d4b939ae28cbd0b2e64adf3b,2021-07-14 15:45:35,C++,0.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n\nstring transfer(int a,int n){\n    string s = \""\"";\n    if(n == 10){\n        stringstream ss;\n        ss << a;\n        ss >> s;\n        return s;\n    }\n    else{\n        while(a){\n            int temp = a%n;\n            a/=n;\n            s += (temp + '0');      \n        }\n        reverse(s.begin(),s.end());\n        return s;\n    }\n}\nint tellreverse(const string a){\n    int length = a.length();\n    string s1 = a;\n    for (int i = 0; i <= (length/ 2); i++){\n        if (a[i] != a[length - i - 1]){\n            return 0;\n        }\n    }\n    return 1;\n}\nint main(){\n    int n,m;\n    cin >> n >> m;\n    vector<int> num;\n    while(num.size() < n){\n        int flag = 0;\n        for(int j = 2;j<=10;j++){\n            string temp = transfer(m,j);\n            if(tellreverse(temp)){\n                flag++;\n            }\n            if(flag >= 2){\n                break;\n            }\n        }\n        if(flag >= 2){\n            num.push_back(m);\n            continue;\n        }\n        m++;\n    }\n    for(int i = 0;i<n;i++){\n        cout << v[i] << endl;\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1415215990498811904,1892622b7b389002d79d4468859dd8a0427020b8d4b939ae28cbd0b2e64adf3b,2021-07-14 15:46:00,C++,0.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n\nstring transfer(int a,int n){\n    string s = \""\"";\n    if(n == 10){\n        stringstream ss;\n        ss << a;\n        ss >> s;\n        return s;\n    }\n    else{\n        while(a){\n            int temp = a%n;\n            a/=n;\n            s += (temp + '0');      \n        }\n        reverse(s.begin(),s.end());\n        return s;\n    }\n}\nint tellreverse(const string a){\n    int length = a.length();\n    string s1 = a;\n    for (int i = 0; i <= (length/ 2); i++){\n        if (a[i] != a[length - i - 1]){\n            return 0;\n        }\n    }\n    return 1;\n}\nint main(){\n    int n,m;\n    cin >> n >> m;\n    vector<int> num;\n    while(num.size() < n){\n        int flag = 0;\n        for(int j = 2;j<=10;j++){\n            string temp = transfer(m,j);\n            if(tellreverse(temp)){\n                flag++;\n            }\n            if(flag >= 2){\n                break;\n            }\n        }\n        if(flag >= 2){\n            num.push_back(m);\n            continue;\n        }\n        m++;\n    }\n    for(int i = 0;i<n;i++){\n        cout << num[i] << endl;\n    }\n    return 0;\n}\n",WRONG_ANSWER,36,440
1415216178936307712,1892622b7b389002d79d4468859dd8a0427020b8d4b939ae28cbd0b2e64adf3b,2021-07-14 15:46:45,C++,0.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n\nstring transfer(int a,int n){\n    string s = \""\"";\n    if(n == 10){\n        stringstream ss;\n        ss << a;\n        ss >> s;\n        return s;\n    }\n    else{\n        while(a){\n            int temp = a%n;\n            a/=n;\n            s += (temp + '0');      \n        }\n        reverse(s.begin(),s.end());\n        return s;\n    }\n}\nint tellreverse(const string a){\n    int length = a.length();\n    string s1 = a;\n    for (int i = 0; i <= (length/ 2); i++){\n        if (a[i] != a[length - i - 1]){\n            return 0;\n        }\n    }\n    return 1;\n}\nint main(){\n    int n,m;\n    cin >> n >> m;\n    vector<int> num;\n    while(num.size() < n){\n        int flag = 0;\n        for(int j = 2;j<=10;j++){\n            string temp = transfer(m,j);\n            if(tellreverse(temp)){\n                flag++;\n            }\n            if(flag >= 2){\n                break;\n            }\n        }\n        if(flag >= 2){\n            num.push_back(m);\n            m++;\n            continue;\n        }\n        \n    }\n    for(int i = 0;i<n;i++){\n        cout << num[i] << endl;\n    }\n    return 0;\n}\n",MULTIPLE_ERROR,4,320
1415216494159503360,1892622b7b389002d79d4468859dd8a0427020b8d4b939ae28cbd0b2e64adf3b,2021-07-14 15:48:00,C++,0.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n\nstring transfer(int a,int n){\n    string s = \""\"";\n    if(n == 10){\n        stringstream ss;\n        ss << a;\n        ss >> s;\n        return s;\n    }\n    else{\n        while(a){\n            int temp = a%n;\n            a/=n;\n            s += (temp + '0');      \n        }\n        reverse(s.begin(),s.end());\n        return s;\n    }\n}\nint tellreverse(const string a){\n    int length = a.length();\n    string s1 = a;\n    for (int i = 0; i <= (length/ 2); i++){\n        if (a[i] != a[length - i - 1]){\n            return 0;\n        }\n    }\n    return 1;\n}\nint main(){\n    int n,m;\n    cin >> n >> m;\n    vector<int> num;\n    while(num.size() < n){\n        int flag = 0;\n        for(int j = 2;j<=10;j++){\n            string temp = transfer(m,j);\n            if(tellreverse(temp)){\n                flag++;\n            }\n            if(flag >= 2){\n                break;\n            }\n        }\n        if(flag >= 2){\n            num.push_back(m);\n            m++;\n        }\n        \n    }\n    for(int i = 0;i<n;i++){\n        cout << num[i] << endl;\n    }\n    return 0;\n}\n",MULTIPLE_ERROR,5,316
1415216640800759808,1892622b7b389002d79d4468859dd8a0427020b8d4b939ae28cbd0b2e64adf3b,2021-07-14 15:48:35,C++,50.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n\nstring transfer(int a,int n){\n    string s = \""\"";\n    if(n == 10){\n        stringstream ss;\n        ss << a;\n        ss >> s;\n        return s;\n    }\n    else{\n        while(a){\n            int temp = a%n;\n            a/=n;\n            s += (temp + '0');      \n        }\n        reverse(s.begin(),s.end());\n        return s;\n    }\n}\nint tellreverse(const string a){\n    int length = a.length();\n    string s1 = a;\n    for (int i = 0; i <= (length/ 2); i++){\n        if (a[i] != a[length - i - 1]){\n            return 0;\n        }\n    }\n    return 1;\n}\nint main(){\n    int n,m;\n    cin >> n >> m;\n    vector<int> num;\n    while(num.size() < n){\n        int flag = 0;\n        for(int j = 2;j<=10;j++){\n            string temp = transfer(m,j);\n            if(tellreverse(temp)){\n                flag++;\n            }\n            if(flag >= 2){\n                break;\n            }\n        }\n        if(flag >= 2){\n            num.push_back(m);\n        }\n        m++;\n    }\n    for(int i = 0;i<n;i++){\n        cout << num[i] << endl;\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,120,464
1415217300950654976,1892622b7b389002d79d4468859dd8a0427020b8d4b939ae28cbd0b2e64adf3b,2021-07-14 15:51:12,C++,0.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n\nstring transfer(int a,int n){\n    string s = \""\"";\n    if(n == 10){\n        stringstream ss;\n        ss << a;\n        ss >> s;\n        return s;\n    }\n    else{\n        while(a){\n            int temp = a%n;\n            a/=n;\n            s += (temp + '0');      \n        }\n        reverse(s.begin(),s.end());\n        return s;\n    }\n}\nint tellreverse(const string a){\n    int length = a.length();\n    string s1 = a;\n    for (int i = 0; i <= (length/ 2); i++){\n        if (a[i] != a[length - i - 1]){\n            return 0;\n        }\n    }\n    return 1;\n}\nint main(){\n    int n,m;\n    cin >> n >> m;\n    vector<int> num;\n    while(num.size() < m){\n        m++;\n        int flag = 0;\n        for(int j = 2;j<=10;j++){\n            string temp = transfer(m,j);\n            if(tellreverse(temp)){\n                flag++;\n            }\n            if(flag >= 2){\n                break;\n            }\n        }\n        if(flag >= 2){\n            num.push_back(m);\n            continue;\n        }\n        \n    }\n    for(int i = 0;i<n;i++){\n        cout << num[i] << endl;\n    }\n    return 0;\n}\n",TIME_LIMIT_EXCEEDED,0,0
1415217445532229632,1892622b7b389002d79d4468859dd8a0427020b8d4b939ae28cbd0b2e64adf3b,2021-07-14 15:51:47,C++,70.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n\nstring transfer(int a,int n){\n    string s = \""\"";\n    if(n == 10){\n        stringstream ss;\n        ss << a;\n        ss >> s;\n        return s;\n    }\n    else{\n        while(a){\n            int temp = a%n;\n            a/=n;\n            s += (temp + '0');      \n        }\n        reverse(s.begin(),s.end());\n        return s;\n    }\n}\nint tellreverse(const string a){\n    int length = a.length();\n    string s1 = a;\n    for (int i = 0; i <= (length/ 2); i++){\n        if (a[i] != a[length - i - 1]){\n            return 0;\n        }\n    }\n    return 1;\n}\nint main(){\n    int n,m;\n    cin >> n >> m;\n    vector<int> num;\n    while(num.size() < n){\n        m++;\n        int flag = 0;\n        for(int j = 2;j<=10;j++){\n            string temp = transfer(m,j);\n            if(tellreverse(temp)){\n                flag++;\n            }\n            if(flag >= 2){\n                break;\n            }\n        }\n        if(flag >= 2){\n            num.push_back(m);\n        }\n        \n    }\n    for(int i = 0;i<n;i++){\n        cout << num[i] << endl;\n    }\n    return 0;\n}\n",ACCEPTED,46,316
1415221567077916672,da7b03521b598c0baca504933d91ee43a411e9018aef5d3cc26d1aa4272db9bf,2021-07-14 16:08:09,C++,10.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<bits/stdc++.h>\nusing namespace std;\nchar get(int n){\n    if(n<=9) return '0'+n;\n    return 'A' + n -10;\n}\nstring fun(int i,int b){\n    string str;\n    while(i){\n        str += get(i%b);\n        i/=b;\n    }\n    reverse(str.begin(),str.end());\n    return str;\n}\nbool check(string str){\n    for (int i = 0, j = str.size()-1;j>=i;i++,j--){\n        if(str[i]!=str[j])\n            return 0;\n    }\n    return 1;\n}\nint main(){\n    int b;\n    cin>>b;\n    for(int i = 1;i<= 300;i++){\n        if(check(fun(i*i,b)))\n            cout<<i<<\"" \""<<fun(i*i,b)<<endl;\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,47,456
1415222154859290624,da7b03521b598c0baca504933d91ee43a411e9018aef5d3cc26d1aa4272db9bf,2021-07-14 16:10:29,C++,80.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<bits/stdc++.h>\nusing namespace std;\nchar get(int n){\n    if(n<=9) return '0'+n;\n    return 'A' + n -10;\n}\nstring fun(int i,int b){\n    string str;\n    while(i){\n        str += get(i%b);\n        i/=b;\n    }\n    reverse(str.begin(),str.end());\n    return str;\n}\nbool check(string str){\n    for (int i = 0, j = str.size()-1;j>=i;i++,j--){\n        if(str[i]!=str[j])\n            return 0;\n    }\n    return 1;\n}\nint main(){\n    int b;\n    cin>>b;\n    for(int i = 1;i<= 300;i++){\n        if(check(fun(i*i,b)))\n            cout<<fun(i,b)<<\"" \""<<fun(i*i,b)<<endl;\n    }\n    return 0;\n}\n",ACCEPTED,47,452
1415232771154419712,4c52bf7fe678943a9b7f85d1fdecaaacb5a3d3f966fc85f788b5377c9d752b08,2021-07-14 16:52:41,C++,10.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <math.h>\nusing namespace std;\ntypedef long long ll;\nll reverse(ll x)\n{\n    ll m = 0, n = x;\n    ll p = 0;\n\n    while (n != 0)\n    {\n        m = n % 10;\n        p = p * 10 + m;\n        n = n / 10;\n    }\n    return p;\n}\nll transform(ll x,int k){\n    ll p=0,y=x;\n    ll m=0;\n    int sum[100];\n    int fl=0;\n    while(y!=0){\n        m=y%k;\n        sum[fl]=m;\n        fl++;\n        y=y/k;\n    }\n    for(int i=0;i<fl;i++){\n        p+=sum[i]*pow(10,i);\n    }\n    return p;\n}\nint main(){\n    int B;\n    cin>>B;\n    for(int i=1;i<=300;i++){\n        ll q=pow(i,2);\n        if(reverse(q)==transform(q,B)){\n            cout<<i<<' '<<q<<endl;\n        }\n    }\n    return 0;\n\n}",PARTIAL_ACCEPTED,37,332
1415233157273657344,4c52bf7fe678943a9b7f85d1fdecaaacb5a3d3f966fc85f788b5377c9d752b08,2021-07-14 16:54:13,C++,10.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <math.h>\nusing namespace std;\ntypedef long long ll;\nll reverse(ll x)\n{\n    ll m = 0, n = x;\n    ll p = 0;\n\n    while (n != 0)\n    {\n        m = n % 10;\n        p = p * 10 + m;\n        n = n / 10;\n    }\n    return p;\n}\nll transform(ll x,int k){\n    ll p=0,y=x;\n    ll m=0;\n    int sum[100];\n    int fl=0;\n    while(y!=0){\n        m=y%k;\n        sum[fl]=m;\n        fl++;\n        y=y/k;\n    }\n    for(int i=0;i<fl;i++){\n        p+=sum[i]*pow(10,i);\n    }\n    return p;\n}\nint main(){\n    int B;\n    cin>>B;\n    for(int i=1;i<=300;i++){\n        ll q=pow(i,2);\n        if(reverse(q)==transform(q,B)){\n            cout<<transform(i,B)<<' '<<transform(q,B)<<endl;\n        }\n    }\n    return 0;\n\n}",PARTIAL_ACCEPTED,39,448
1415233439630008320,4c52bf7fe678943a9b7f85d1fdecaaacb5a3d3f966fc85f788b5377c9d752b08,2021-07-14 16:55:20,C++,40.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <math.h>\nusing namespace std;\ntypedef long long ll;\nll reverse(ll x)\n{\n    ll m = 0, n = x;\n    ll p = 0;\n\n    while (n != 0)\n    {\n        m = n % 10;\n        p = p * 10 + m;\n        n = n / 10;\n    }\n    return p;\n}\nll transform(ll x,int k){\n    ll p=0,y=x;\n    ll m=0;\n    int sum[100];\n    int fl=0;\n    while(y!=0){\n        m=y%k;\n        sum[fl]=m;\n        fl++;\n        y=y/k;\n    }\n    for(int i=0;i<fl;i++){\n        p+=sum[i]*pow(10,i);\n    }\n    return p;\n}\nint main(){\n    int B;\n    cin>>B;\n    for(int i=1;i<=300;i++){\n        ll q=pow(i,2);\n        if(reverse(transform(q,B))==transform(q,B)){\n            cout<<transform(i,B)<<' '<<transform(q,B)<<endl;\n        }\n    }\n    return 0;\n\n}",PARTIAL_ACCEPTED,41,448
1415236291894861824,da7b03521b598c0baca504933d91ee43a411e9018aef5d3cc26d1aa4272db9bf,2021-07-14 17:06:40,C++,70.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include<bits/stdc++.h>\nusing namespace std;\nchar get(int n){\n    if(n<=9) return '0'+n;\n    return 'A' + n -10;\n}\nstring fun(int i,int b){\n    string str;\n    while(i){\n        str += get(i%b);\n        i/=b;\n    }\n    reverse(str.begin(),str.end());\n    return str;\n}\nbool check(string str){\n    for (int i = 0, j = str.size()-1;j>=i;i++,j--){\n        if(str[i]!=str[j])\n            return 0;\n    }\n    return 1;\n}\nint main(){\n    int count,m;\n    cin>>count>>m;\n    int num =0;\n    for(int i = m+1;;i++){\n        int sum = 0;\n        for(int j = 2;j<=10;j++){\n            if(check(fun(i,j))){\n                sum++;\n            }\n            if(sum==2){\n                num++;\n                cout<<i<<endl;\n                break;\n            }\n        } \n        if(num==count)\n            break;\n    }\n    return 0;\n}\n",ACCEPTED,31,332
1415249335115227136,4c52bf7fe678943a9b7f85d1fdecaaacb5a3d3f966fc85f788b5377c9d752b08,2021-07-14 17:58:30,C++,50.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <math.h>\nusing namespace std;\ntypedef long long ll;\nstring reverse(string x)\n{\n    string p=\""\"";\n    for(int i=x.size()-1;i>=0;i--){\n        p+=x[i];\n    }   \n    return p;\n}\nstring transform(ll x,int k){\n    string p=\""\"";\n    ll m=0,y=x;\n    int sum[100];\n    int fl=0;\n    while(y!=0){\n        m=y%k;\n        sum[fl]=m;\n        fl++;\n        y=y/k;\n    }\n    for(int i=fl-1;i>=0;i--){\n        if(sum[i]>=10){\n            p+=to_string(sum[i]+55);\n        }\n        else{\n            p+=to_string(sum[i]);\n        }\n    }\n    return p;\n}\nint main(){\n    int B;\n    cin>>B;\n    for(ll i=1;i<=300;i++){\n        char * p;\n        ll q=pow(i,2);\n        string t =transform(q,B);\n        string ts =reverse(t);\n        if(t==ts){\n            cout<<transform(i,B)<<' '<<transform(q,B)<<endl;\n        }\n    }\n    return 0;\n\n}",PARTIAL_ACCEPTED,36,328
1415251206403956736,4c52bf7fe678943a9b7f85d1fdecaaacb5a3d3f966fc85f788b5377c9d752b08,2021-07-14 18:05:56,C++,80.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <math.h>\nusing namespace std;\ntypedef long long ll;\nstring reverse(string x)\n{\n    string p=\""\"";\n    for(int i=x.size()-1;i>=0;i--){\n        p+=x[i];\n    }   \n    return p;\n}\nstring transform(ll x,int k){\n    string p=\""\"";\n    ll m=0,y=x;\n    int sum[100];\n    int fl=0;\n    while(y!=0){\n        m=y%k;\n        sum[fl]=m;\n        fl++;\n        y=y/k;\n    }\n    for(int i=fl-1;i>=0;i--){\n        if(sum[i]>=10){\n            p+= (char)(sum[i]+55);\n        }\n        else{\n            p+= (char)(sum[i]+48);\n        }\n    }\n    return p;\n}\nint main(){\n    int B;\n    cin>>B;\n    for(ll i=1;i<=300;i++){\n        ll q=pow(i,2);\n        string t =transform(q,B);\n        string ts =reverse(t);\n        if(t==ts){\n            cout<<transform(i,B)<<' '<<transform(q,B)<<endl;\n        }\n    }\n    return 0;\n\n}",ACCEPTED,36,436
1415255334303457280,4c52bf7fe678943a9b7f85d1fdecaaacb5a3d3f966fc85f788b5377c9d752b08,2021-07-14 18:22:20,C++,70.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\nstring reverse(string x)\n{\n    string p=\""\"";\n    for(int i=x.size()-1;i>=0;i--){\n        p+=x[i];\n    }   \n    return p;\n}\nstring transform(int x,int k){\n    string p=\""\"";\n    int m=0,y=x;\n    int sum[100];\n    int fl=0;\n    while(y!=0){\n        m=y%k;\n        sum[fl]=m;\n        fl++;\n        y=y/k;\n    }\n    for(int i=fl-1;i>=0;i--){\n        if(sum[i]>=10){\n            p+= (char)(sum[i]+55);\n        }\n        else{\n            p+= (char)(sum[i]+48);\n        }\n    }\n    return p;\n}\nint main(){\n    int N,S;\n    cin>>N>>S;\n    vector <string> sum(0);\n    int i=S+1;\n    while(sum.size()!=N){\n        int fl=0;\n        for(int j=2;j<=10;j++){\n            if(transform(i,j)==reverse(transform(i,j))){\n                fl++;\n            }\n        }\n        if(fl>=2){\n            sum.push_back(to_string(i));\n        }\n        i++;\n    }\n    for(int k=0;k<sum.size();k++){\n        cout<<sum[k]<<endl;\n    }\n}",ACCEPTED,37,424
1415357149418528768,db450af15a2965d88b45113d40ce6b48319b1d6f2966aa07401f90b58f72686a,2021-07-15 01:06:55,C++,50.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <stdio.h>\n#include <string>\n#include <algorithm>\nusing namespace std;\nstring to_B(int a, int B){\n\tstring b = \""\"";\n\twhile(a){\n\t\tint n = a % B;\n\t\tstring s1; \n\t\tif(n < 10) s1 = to_string(n);\n\t\telse{\n\t\t\tchar ch = n - 10 + 'A';\n\t\t\ts1 = to_string(ch);\n\t\t}\n\t\tb += s1;\n\t\ta /= B;\n\t}\n\treverse(b.begin(), b.end());\n\treturn b;\n}\nbool is_hui(string s){\n\tint len = s.size();\n\tfor(int i = 0; i < len/2 + 1; i++){\n\t\tif(s[i] != s[len - 1 - i]){\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\nint main(){\n\tint B = 0;\n\tcin >> B;\n\tfor(int i = 1; i < 301; i++){\n\t\tint n = i * i;\n\t\tstring b = to_B(n, B);\n\t\tif(is_hui(b)){\n\t\t\tcout << to_B(i, B) << \"" \"" << b << endl;\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,34,328
1415357839171821568,db450af15a2965d88b45113d40ce6b48319b1d6f2966aa07401f90b58f72686a,2021-07-15 01:09:39,C++,50.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <stdio.h>\n#include <string>\n#include <algorithm>\nusing namespace std;\nstring to_B(int a, int B){\n\tstring b = \""\"";\n\twhile(a){\n\t\tint n = a % B;\n\t\tstring s1; \n\t\tif(n < 10) s1 = to_string(n);\n\t\telse{\n\t\t\tchar ch = n - 10 + 'A';\n\t\t\ts1 = to_string(ch);\n\t\t}\n\t\tb += s1;\n\t\ta /= B;\n\t}\n\treverse(b.begin(), b.end());\n\treturn b;\n}\nbool is_hui(string s){\n\tstring s1 = s;\n\treverse(s.begin(), s.end());\n\tif(s1 == s) return true;\n\telse return false;\n}\nint main(){\n\tint B = 0;\n\tcin >> B;\n\tfor(int i = 1; i < 301; i++){\n\t\tint n = i * i;\n\t\tstring b = to_B(n, B);\n\t\tif(is_hui(b)){\n\t\t\tcout << to_B(i, B) << \"" \"" << b << endl;\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,35,452
1415358122568359936,db450af15a2965d88b45113d40ce6b48319b1d6f2966aa07401f90b58f72686a,2021-07-15 01:10:47,C++,50.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <stdio.h>\n#include <string>\n#include <algorithm>\nusing namespace std;\nstring to_B(int a, int B){\n\tstring b = \""\"";\n\twhile(a){\n\t\tint n = a % B;\n\t\tstring s1; \n\t\tif(n < 10) s1 = to_string(n);\n\t\telse{\n\t\t\tchar ch = n - 10 + 'A';\n\t\t\ts1 = to_string(ch);\n\t\t}\n\t\tb += s1;\n\t\ta /= B;\n\t}\n\treverse(b.begin(), b.end());\n\treturn b;\n}\nbool is_hui(string s){\n\tstring s1 = s;\n\treverse(s.begin(), s.end());\n\tif(s1 == s) return true;\n\telse return false;\n}\nint main(){\n\tint B = 0;\n\tcin >> B;\n\tfor(int i = 1; i < 301; i++){\n\t\tint n = i * i;\n\t\tstring b = to_B(n, B);\n\t\tif(is_hui(b)){\n\t\t\tcout << to_B(i, B) << \"" \"" << b << endl;\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,39,324
1415361896200445952,db450af15a2965d88b45113d40ce6b48319b1d6f2966aa07401f90b58f72686a,2021-07-15 01:25:46,C++,80.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <stdio.h>\n#include <string>\n#include <algorithm>\n#include <streambuf>\nusing namespace std;\nstring to_B(int a, int B){\n\tstring b = \""\"";\n\twhile(a){\n\t\tint n = a % B;\n\t\tstring s1; \n\t\tif(n < 10) s1 = to_string(n);\n\t\telse{\n\t\t\tchar ch = n - 10 + 'A';\n\t\t\tchar ch1[2] = {ch, '\\0'};\n\t\t\ts1 = ch1;\n\t\t}\n\t\tb += s1;\n\t\ta /= B;\n\t}\n\treverse(b.begin(), b.end());\n\treturn b;\n}\nbool is_hui(string s){\n\tstring s1 = s;\n\treverse(s.begin(), s.end());\n\tif(s1 == s) return true;\n\telse return false;\n}\nint main(){\n\tint B = 0;\n\tcin >> B;\n\tfor(int i = 1; i < 301; i++){\n\t\tint n = i * i;\n\t\tstring b = to_B(n, B);\n\t\tif(is_hui(b)){\n\t\t\tcout << to_B(i, B) << \"" \"" << b << endl;\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,50,324
1415495595890110464,db450af15a2965d88b45113d40ce6b48319b1d6f2966aa07401f90b58f72686a,2021-07-15 10:17:03,C++,10.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <stdio.h>\n#include <string>\n#include <algorithm>\nusing namespace std;\nstring to_B(int a, int B){\n\tstring b = \""\"";\n\twhile(a){\n\t\tint n = a % B;\n\t\tstring s1; \n\t\ts1 = to_string(n);\n\t\tb += s1;\n\t\ta /= B;\n\t}\n\treverse(b.begin(), b.end());\n\treturn b;\n}\n\nbool is_hui(string s){\n\tstring s1 = s;\n\treverse(s.begin(), s.end());\n\tif(s1 == s) return true;\n\telse return false;\n}\n\nint main(){\n\tint N = 0, S = 0;\n\tcin >> N >> S; \n\tint x = 0;\n\twhile(x < N){\n\t\tint y = 0;\n\t\tfor(int i = 2; i < 10; i++){\n\t\t\tstring s1 = to_B(S + 1, i);\n\t\t\tif(is_hui(s1)) y++;\n\t\t}\n\t\tif(y >= 2) printf(\""%d\\n\"", S + 1);\n\t\tS++;    \n\t\tx++;\n\t} \n\treturn 0;\n}",PARTIAL_ACCEPTED,32,448
1415495994223009792,db450af15a2965d88b45113d40ce6b48319b1d6f2966aa07401f90b58f72686a,2021-07-15 10:18:38,C++,10.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <stdio.h>\n#include <string>\n#include <algorithm>\nusing namespace std;\nstring to_B(int a, int B){\n\tstring b = \""\"";\n\twhile(a){\n\t\tint n = a % B;\n\t\tstring s1; \n\t\ts1 = to_string(n);\n\t\tb += s1;\n\t\ta /= B;\n\t}\n\treverse(b.begin(), b.end());\n\treturn b;\n}\n\nbool is_hui(string s){\n\tstring s1 = s;\n\treverse(s.begin(), s.end());\n\tif(s1 == s) return true;\n\telse return false;\n}\n\nint main(){\n\tint N = 0, S = 0;\n\tcin >> N >> S; \n\tint x = 0;\n\twhile(x < N){\n\t\tint y = 0;\n\t\tfor(int i = 2; i <= 10; i++){\n\t\t\tstring s1 = to_B(S + 1, i);\n\t\t\tif(is_hui(s1)) y++;\n\t\t}\n\t\tif(y >= 2) printf(\""%d\\n\"", S + 1);\n\t\tS++;    \n\t\tx++;\n\t} \n\treturn 0;\n}",PARTIAL_ACCEPTED,32,332
1415496611775705088,db450af15a2965d88b45113d40ce6b48319b1d6f2966aa07401f90b58f72686a,2021-07-15 10:21:05,C++,70.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <stdio.h>\n#include <string>\n#include <algorithm>\nusing namespace std;\nstring to_B(int a, int B){\n\tstring b = \""\"";\n\twhile(a){\n\t\tint n = a % B;\n\t\tstring s1; \n\t\ts1 = to_string(n);\n\t\tb += s1;\n\t\ta /= B;\n\t}\n\treverse(b.begin(), b.end());\n\treturn b;\n}\n\nbool is_hui(string s){\n\tstring s1 = s;\n\treverse(s.begin(), s.end());\n\tif(s1 == s) return true;\n\telse return false;\n}\n\nint main(){\n\tint N = 0, S = 0;\n\tcin >> N >> S; \n\tint x = 0;\n\twhile(x < N){\n\t\tint y = 0;\n\t\tfor(int i = 2; i <= 10; i++){\n\t\t\tstring s1 = to_B(S + 1, i);\n\t\t\tif(is_hui(s1)) y++;\n\t\t}\n\t\tif(y >= 2) {\n\t\t\tprintf(\""%d\\n\"", S + 1);\n\t\t\tx++;\n\t\t}\n\t\tS++;    \n\t} \n\treturn 0;\n}",ACCEPTED,63,324
1415547803616735232,ab5baabd25753270c448a497aae45b35e510fa2f19ff49cf0343e8a6f0fd0cc0,2021-07-15 13:44:30,C++,10.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\n#include<typeinfo>\nusing namespace std;\nint main()\n{\n    int N,S,sz;\n    cin>>N>>S;\n    sz=S+1;\n    for(int i=0;i<N;i++)\n    {\n        while (1==1)\n        {\n            int j=0,sz10,js=0;\n            sz10=sz;\n            string s_sz10,s_zs10;\n            char c_sz10[10];\n            for(int i=2;i<=10;i++)\n            {\n                while(sz10)\n                {\n                    c_sz10[j]=sz10%i;\n                    sz10/=i;\n                    j+=1;\n                }\n                s_sz10=c_sz10;\n                s_zs10=c_sz10;\n                reverse(s_sz10.begin(),s_sz10.end());\n                if(s_sz10.compare(s_zs10)==0)\n                {\n                    js+=1;\n                }\n            }\n            if(js>=2)\n            {\n                cout<<sz<<endl;\n                break;\n            }\n            sz+=1;\n        }\n        sz+=1;\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,79,432
1415548220543135744,ab5baabd25753270c448a497aae45b35e510fa2f19ff49cf0343e8a6f0fd0cc0,2021-07-15 13:46:10,C++,10.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\n#include<typeinfo>\nusing namespace std;\nint main()\n{\n    int N,S,sz;\n    cin>>N>>S;\n    sz=S+1;\n    for(int i=0;i<N;i++)\n    {\n        while (1==1)\n        {\n            int j=0,sz10,js=0;\n            sz10=sz;\n            string s_sz10,s_zs10;\n            char c_sz10[10];\n            for(int i=2;i<=10;i++)\n            {\n                while(sz10)\n                {\n                    c_sz10[j]=sz10%i;\n                    sz10/=i;\n                    j+=1;\n                }\n                s_sz10=c_sz10;\n                s_zs10=c_sz10;\n                reverse(s_sz10.begin(),s_sz10.end());\n                if(s_sz10.compare(s_zs10)==0)\n                {\n                    js+=1;\n                }\n            }\n            if(js>=2)\n            {\n                cout<<sz<<endl;\n                break;\n            }\n            sz+=1;\n        }\n        sz+=1;\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,81,344
1415625451466301440,7d2379653728c29fc8c1ebcfb94722b506eb1ae6ff4e90974c21e4661db710a4,2021-07-15 18:53:03,C++,0.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n    int B;\n    cin>>B;\n    for(int i=1;i<=300;i++){\n        int temp=i*i;\n        string s;\n        while(temp!=0){\n            switch(temp%B){\n            case 0:\n                s+=to_string(temp);\n                break;\n            case 1:\n                s+='1';\n                break;\n            case 2:\n                s+='2';\n                break;\n            case 3:\n                s+='3';\n                break;\n            case 4:\n                s+='4';\n                break;\n            case 5:\n                s+='5';\n                break;\n            case 6:\n                s+='6';\n                break;\n            case 7:\n                s+='7';\n                break;\n            case 8:\n                s+='8';\n                break;\n            case 9:\n                s+='9';\n                break;\n            case 10:\n                s+='A';\n                break;\n            case 11:\n                s+='B';\n                break;\n            case 12:\n                s+='C';\n                break;\n            case 13:\n                s+='D';\n                break;\n            case 14:\n                s+='E';\n                break;\n            case 15:\n                s+='F';\n                break;\n            case 16:\n                s+='G';\n                break;\n            case 17:\n                s+='H';\n                break;\n            case 18:\n                s+='I';\n                break;\n            case 19:\n                s+='J';\n                break;\n            }\n            temp/=B;\n        }\n        string s1(s.rbegin(),s.rend());\n        if(s==s1){\n            cout<<i<<\"" \""<<s<<endl;\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,36,436
1415636118130978816,7d2379653728c29fc8c1ebcfb94722b506eb1ae6ff4e90974c21e4661db710a4,2021-07-15 19:35:26,C++,0.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n    int B;\n    cin>>B;\n    for(int i=1;i<=300;i++){\n        int temp=i*i;\n        string s;\n        while(temp!=0){\n            switch(temp%B){\n#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n    int B;\n    cin>>B;\n    for(int i=1;i<=300;i++){\n        vector<string> vec;\n        int temp=i*i;\n        string s=\""\"";\n        while(temp!=0){\n            switch(temp%B){\n            case 0:\n                vec.push_back(\""0\"");\n                break;\n            case 1:\n                vec.push_back(\""1\"");\n                break;\n            case 2:\n                vec.push_back(\""2\"");\n                break;\n            case 3:\n                vec.push_back(\""3\"");\n                break;\n            case 4:\n                vec.push_back(\""4\"");\n                break;\n            case 5:\n                vec.push_back(\""5\"");\n                break;\n            case 6:\n                vec.push_back(\""6\"");\n                break;\n            case 7:\n                vec.push_back(\""7\"");\n                break;\n            case 8:\n                vec.push_back(\""8\"");\n                break;\n            case 9:\n                vec.push_back(\""9\"");\n                break;\n            case 10:\n                vec.push_back(\""A\"");\n                break;\n            case 11:\n                vec.push_back(\""B\"");\n                break;\n            case 12:\n                vec.push_back(\""C\"");\n                break;\n            case 13:\n                vec.push_back(\""D\"");\n                break;\n            case 14:\n                vec.push_back(\""E\"");\n                break;\n            case 15:\n                vec.push_back(\""F\"");\n                break;\n            case 16:\n                vec.push_back(\""G\"");\n                break;\n            case 17:\n                vec.push_back(\""H\"");\n                break;\n            case 18:\n                vec.push_back(\""I\"");\n                break;\n            case 19:\n                vec.push_back(\""J\"");\n                break;\n            }\n            temp/=B;\n        }\n        for(auto x=vec.rbegin();x!=vec.rend();x++){\n            s+=*x;\n        }\n        string s1(s.rbegin(),s.rend());\n        if(s==s1){\n            cout<<i<<\"" \""<<s<<endl;\n        }\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1415636241862795264,7d2379653728c29fc8c1ebcfb94722b506eb1ae6ff4e90974c21e4661db710a4,2021-07-15 19:35:55,C++,10.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n    int B;\n    cin>>B;\n    for(int i=1;i<=300;i++){\n        vector<string> vec;\n        int temp=i*i;\n        string s=\""\"";\n        while(temp!=0){\n            switch(temp%B){\n            case 0:\n                vec.push_back(\""0\"");\n                break;\n            case 1:\n                vec.push_back(\""1\"");\n                break;\n            case 2:\n                vec.push_back(\""2\"");\n                break;\n            case 3:\n                vec.push_back(\""3\"");\n                break;\n            case 4:\n                vec.push_back(\""4\"");\n                break;\n            case 5:\n                vec.push_back(\""5\"");\n                break;\n            case 6:\n                vec.push_back(\""6\"");\n                break;\n            case 7:\n                vec.push_back(\""7\"");\n                break;\n            case 8:\n                vec.push_back(\""8\"");\n                break;\n            case 9:\n                vec.push_back(\""9\"");\n                break;\n            case 10:\n                vec.push_back(\""A\"");\n                break;\n            case 11:\n                vec.push_back(\""B\"");\n                break;\n            case 12:\n                vec.push_back(\""C\"");\n                break;\n            case 13:\n                vec.push_back(\""D\"");\n                break;\n            case 14:\n                vec.push_back(\""E\"");\n                break;\n            case 15:\n                vec.push_back(\""F\"");\n                break;\n            case 16:\n                vec.push_back(\""G\"");\n                break;\n            case 17:\n                vec.push_back(\""H\"");\n                break;\n            case 18:\n                vec.push_back(\""I\"");\n                break;\n            case 19:\n                vec.push_back(\""J\"");\n                break;\n            }\n            temp/=B;\n        }\n        for(auto x=vec.rbegin();x!=vec.rend();x++){\n            s+=*x;\n        }\n        string s1(s.rbegin(),s.rend());\n        if(s==s1){\n            cout<<i<<\"" \""<<s<<endl;\n        }\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,33,328
1415638118193229824,7d2379653728c29fc8c1ebcfb94722b506eb1ae6ff4e90974c21e4661db710a4,2021-07-15 19:43:23,C++,10.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n    int B;\n    cin>>B;\n    for(int i=1;i<=300;i++){\n        vector<string> vec;\n        vector<string> vec1;\n        int temp=i*i;\n        int temp1=i;\n        string s=\""\"";\n        string s1=\""\"";\n        while(temp1!=0){\n            switch(temp%B){\n            case 0:\n                vec1.push_back(\""0\"");\n                break;\n            case 1:\n                vec1.push_back(\""1\"");\n                break;\n            case 2:\n                vec1.push_back(\""2\"");\n                break;\n            case 3:\n                vec1.push_back(\""3\"");\n                break;\n            case 4:\n                vec1.push_back(\""4\"");\n                break;\n            case 5:\n                vec1.push_back(\""5\"");\n                break;\n            case 6:\n                vec1.push_back(\""6\"");\n                break;\n            case 7:\n                vec1.push_back(\""7\"");\n                break;\n            case 8:\n                vec1.push_back(\""8\"");\n                break;\n            case 9:\n                vec1.push_back(\""9\"");\n                break;\n            case 10:\n                vec1.push_back(\""A\"");\n                break;\n            case 11:\n                vec1.push_back(\""B\"");\n                break;\n            case 12:\n                vec1.push_back(\""C\"");\n                break;\n            case 13:\n                vec1.push_back(\""D\"");\n                break;\n            case 14:\n                vec1.push_back(\""E\"");\n                break;\n            case 15:\n                vec1.push_back(\""F\"");\n                break;\n            case 16:\n                vec1.push_back(\""G\"");\n                break;\n            case 17:\n                vec1.push_back(\""H\"");\n                break;\n            case 18:\n                vec1.push_back(\""I\"");\n                break;\n            case 19:\n                vec1.push_back(\""J\"");\n                break;\n            }\n            temp1/=B;\n        }\n        for(auto x=vec1.rbegin();x!=vec1.rend();x++){\n            s1+=*x;\n        }\n        while(temp!=0){\n            switch(temp%B){\n            case 0:\n                vec.push_back(\""0\"");\n                break;\n            case 1:\n                vec.push_back(\""1\"");\n                break;\n            case 2:\n                vec.push_back(\""2\"");\n                break;\n            case 3:\n                vec.push_back(\""3\"");\n                break;\n            case 4:\n                vec.push_back(\""4\"");\n                break;\n            case 5:\n                vec.push_back(\""5\"");\n                break;\n            case 6:\n                vec.push_back(\""6\"");\n                break;\n            case 7:\n                vec.push_back(\""7\"");\n                break;\n            case 8:\n                vec.push_back(\""8\"");\n                break;\n            case 9:\n                vec.push_back(\""9\"");\n                break;\n            case 10:\n                vec.push_back(\""A\"");\n                break;\n            case 11:\n                vec.push_back(\""B\"");\n                break;\n            case 12:\n                vec.push_back(\""C\"");\n                break;\n            case 13:\n                vec.push_back(\""D\"");\n                break;\n            case 14:\n                vec.push_back(\""E\"");\n                break;\n            case 15:\n                vec.push_back(\""F\"");\n                break;\n            case 16:\n                vec.push_back(\""G\"");\n                break;\n            case 17:\n                vec.push_back(\""H\"");\n                break;\n            case 18:\n                vec.push_back(\""I\"");\n                break;\n            case 19:\n                vec.push_back(\""J\"");\n                break;\n            }\n            temp/=B;\n        }\n        for(auto x=vec.rbegin();x!=vec.rend();x++){\n            s+=*x;\n        }\n        string s2(s.rbegin(),s.rend());\n        if(s==s2){\n            cout<<s1<<\"" \""<<s<<endl;\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,50,444
1415638127454101504,7d2379653728c29fc8c1ebcfb94722b506eb1ae6ff4e90974c21e4661db710a4,2021-07-15 19:43:25,C++,10.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n    int B;\n    cin>>B;\n    for(int i=1;i<=300;i++){\n        vector<string> vec;\n        vector<string> vec1;\n        int temp=i*i;\n        int temp1=i;\n        string s=\""\"";\n        string s1=\""\"";\n        while(temp1!=0){\n            switch(temp%B){\n            case 0:\n                vec1.push_back(\""0\"");\n                break;\n            case 1:\n                vec1.push_back(\""1\"");\n                break;\n            case 2:\n                vec1.push_back(\""2\"");\n                break;\n            case 3:\n                vec1.push_back(\""3\"");\n                break;\n            case 4:\n                vec1.push_back(\""4\"");\n                break;\n            case 5:\n                vec1.push_back(\""5\"");\n                break;\n            case 6:\n                vec1.push_back(\""6\"");\n                break;\n            case 7:\n                vec1.push_back(\""7\"");\n                break;\n            case 8:\n                vec1.push_back(\""8\"");\n                break;\n            case 9:\n                vec1.push_back(\""9\"");\n                break;\n            case 10:\n                vec1.push_back(\""A\"");\n                break;\n            case 11:\n                vec1.push_back(\""B\"");\n                break;\n            case 12:\n                vec1.push_back(\""C\"");\n                break;\n            case 13:\n                vec1.push_back(\""D\"");\n                break;\n            case 14:\n                vec1.push_back(\""E\"");\n                break;\n            case 15:\n                vec1.push_back(\""F\"");\n                break;\n            case 16:\n                vec1.push_back(\""G\"");\n                break;\n            case 17:\n                vec1.push_back(\""H\"");\n                break;\n            case 18:\n                vec1.push_back(\""I\"");\n                break;\n            case 19:\n                vec1.push_back(\""J\"");\n                break;\n            }\n            temp1/=B;\n        }\n        for(auto x=vec1.rbegin();x!=vec1.rend();x++){\n            s1+=*x;\n        }\n        while(temp!=0){\n            switch(temp%B){\n            case 0:\n                vec.push_back(\""0\"");\n                break;\n            case 1:\n                vec.push_back(\""1\"");\n                break;\n            case 2:\n                vec.push_back(\""2\"");\n                break;\n            case 3:\n                vec.push_back(\""3\"");\n                break;\n            case 4:\n                vec.push_back(\""4\"");\n                break;\n            case 5:\n                vec.push_back(\""5\"");\n                break;\n            case 6:\n                vec.push_back(\""6\"");\n                break;\n            case 7:\n                vec.push_back(\""7\"");\n                break;\n            case 8:\n                vec.push_back(\""8\"");\n                break;\n            case 9:\n                vec.push_back(\""9\"");\n                break;\n            case 10:\n                vec.push_back(\""A\"");\n                break;\n            case 11:\n                vec.push_back(\""B\"");\n                break;\n            case 12:\n                vec.push_back(\""C\"");\n                break;\n            case 13:\n                vec.push_back(\""D\"");\n                break;\n            case 14:\n                vec.push_back(\""E\"");\n                break;\n            case 15:\n                vec.push_back(\""F\"");\n                break;\n            case 16:\n                vec.push_back(\""G\"");\n                break;\n            case 17:\n                vec.push_back(\""H\"");\n                break;\n            case 18:\n                vec.push_back(\""I\"");\n                break;\n            case 19:\n                vec.push_back(\""J\"");\n                break;\n            }\n            temp/=B;\n        }\n        for(auto x=vec.rbegin();x!=vec.rend();x++){\n            s+=*x;\n        }\n        string s2(s.rbegin(),s.rend());\n        if(s==s2){\n            cout<<s1<<\"" \""<<s<<endl;\n        }\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,47,444
1415638944802316288,7d2379653728c29fc8c1ebcfb94722b506eb1ae6ff4e90974c21e4661db710a4,2021-07-15 19:46:40,C++,80.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n    int B;\n    cin>>B;\n    for(int i=1;i<=300;i++){\n        vector<string> vec;\n        vector<string> vec1;\n        int temp=i*i;\n        int temp1=i;\n        string s=\""\"";\n        string s1=\""\"";\n        while(temp1!=0){\n            switch(temp1%B){\n            case 0:\n                vec1.push_back(\""0\"");\n                break;\n            case 1:\n                vec1.push_back(\""1\"");\n                break;\n            case 2:\n                vec1.push_back(\""2\"");\n                break;\n            case 3:\n                vec1.push_back(\""3\"");\n                break;\n            case 4:\n                vec1.push_back(\""4\"");\n                break;\n            case 5:\n                vec1.push_back(\""5\"");\n                break;\n            case 6:\n                vec1.push_back(\""6\"");\n                break;\n            case 7:\n                vec1.push_back(\""7\"");\n                break;\n            case 8:\n                vec1.push_back(\""8\"");\n                break;\n            case 9:\n                vec1.push_back(\""9\"");\n                break;\n            case 10:\n                vec1.push_back(\""A\"");\n                break;\n            case 11:\n                vec1.push_back(\""B\"");\n                break;\n            case 12:\n                vec1.push_back(\""C\"");\n                break;\n            case 13:\n                vec1.push_back(\""D\"");\n                break;\n            case 14:\n                vec1.push_back(\""E\"");\n                break;\n            case 15:\n                vec1.push_back(\""F\"");\n                break;\n            case 16:\n                vec1.push_back(\""G\"");\n                break;\n            case 17:\n                vec1.push_back(\""H\"");\n                break;\n            case 18:\n                vec1.push_back(\""I\"");\n                break;\n            case 19:\n                vec1.push_back(\""J\"");\n                break;\n            }\n            temp1/=B;\n        }\n        for(auto x=vec1.rbegin();x!=vec1.rend();x++){\n            s1+=*x;\n        }\n        while(temp!=0){\n            switch(temp%B){\n            case 0:\n                vec.push_back(\""0\"");\n                break;\n            case 1:\n                vec.push_back(\""1\"");\n                break;\n            case 2:\n                vec.push_back(\""2\"");\n                break;\n            case 3:\n                vec.push_back(\""3\"");\n                break;\n            case 4:\n                vec.push_back(\""4\"");\n                break;\n            case 5:\n                vec.push_back(\""5\"");\n                break;\n            case 6:\n                vec.push_back(\""6\"");\n                break;\n            case 7:\n                vec.push_back(\""7\"");\n                break;\n            case 8:\n                vec.push_back(\""8\"");\n                break;\n            case 9:\n                vec.push_back(\""9\"");\n                break;\n            case 10:\n                vec.push_back(\""A\"");\n                break;\n            case 11:\n                vec.push_back(\""B\"");\n                break;\n            case 12:\n                vec.push_back(\""C\"");\n                break;\n            case 13:\n                vec.push_back(\""D\"");\n                break;\n            case 14:\n                vec.push_back(\""E\"");\n                break;\n            case 15:\n                vec.push_back(\""F\"");\n                break;\n            case 16:\n                vec.push_back(\""G\"");\n                break;\n            case 17:\n                vec.push_back(\""H\"");\n                break;\n            case 18:\n                vec.push_back(\""I\"");\n                break;\n            case 19:\n                vec.push_back(\""J\"");\n                break;\n            }\n            temp/=B;\n        }\n        for(auto x=vec.rbegin();x!=vec.rend();x++){\n            s+=*x;\n        }\n        string s2(s.rbegin(),s.rend());\n        if(s==s2){\n            cout<<s1<<\"" \""<<s<<endl;\n        }\n    }\n    return 0;\n}",ACCEPTED,40,324
1415689745331560448,eafbc805f2dac556963d2e2f22609a4f0b8f8883b4a7076a38d7d1c26aac85b2,2021-07-15 23:08:32,C++,80.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<stdio.h>\nusing namespace std;\nint main(){\n\tint B;\n\tcin>>B;\n\tvoid f(int,int);\n\tfor(int n=1;n<=300;n++)\n\tf(B,n);\n\t\n\treturn 0;\n}\n\nvoid f(int B,int n){\n\tint number=n*n;\n\tint arr[10];\n\tint i=0;\n\twhile(number){\n\t\ti++;\n\t\tarr[i]=number%B;\n\t\tnumber/=B;\n\t}\n\tint j,k; \n\tfor(j=1,k=i;j<=k;j++,k--){\n\t\tif(arr[j]!=arr[k]) return;\n\t}\n\tif(j>=k){\n\t\tint s=0;\n\t\tint brr[10];\n\t\twhile(n){\n\t\ts++;\n\t\tbrr[s]=n%B;\n\t\tn/=B;\n\t}\n\t\tfor(int m=s;m>=1;m--){\n\t\t\tif(brr[m]>=10) printf(\""%c\"",brr[m]+55);\n\t\t\telse cout<<brr[m];\n\t\t}\n\t\tcout<<\"" \"";\n\t\tfor(int m=1;m<=i;m++){\n\t\t\tif(arr[m]>=10) printf(\""%c\"",arr[m]+55);\n\t\t\telse cout<<arr[m];\n\t\t}\n\t\tcout<<endl; \n\t}\n\telse return;\n}",ACCEPTED,43,456
1415689950663712768,eafbc805f2dac556963d2e2f22609a4f0b8f8883b4a7076a38d7d1c26aac85b2,2021-07-15 23:09:21,C++,70.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint main(){\n\tint n,s;\n\tcin>>n>>s;\n\ts+=1;\n\tint cnt=0;\n\tbool f1(int number,int B);\n\t\n\twhile(1){\n\t\tint sum=0;\n\t\t//从2进制到10进制都筛选一遍 \n\t\tfor(int i=2;i<=10;i++){\n\t\t\tsum+=f1(s,i);\n\t\t}\t\n\t\tif(sum>=2){\n\t\t\tcnt++;\n\t\t\tcout<<s<<endl;\n\t\t}\n\t\tif(cnt==n) break;\n\t\ts++; \n\t}\n\t\n\treturn 0;\n}\n\n//判断数字 number 在 B 进制下是否为回文数 \nbool f1(int number,int B){\n\tint i=0;\n\tint arr[100];\n\twhile(number){\n\t\ti++;\n\t\tarr[i]=number%B;\n\t\tnumber/=B;\n\t}\n\tint j,k;\n\tfor(j=1,k=i;j<=k;j++,k--){\n\t\tif(arr[j]!=arr[k]) return false;\n\t}\n\tif(j>=k) return true;\n}",ACCEPTED,46,332
1416599673547776000,c706dfea9418770ab9f712fc7bb82eee5c74c2f8f497bbb546de989e2dac6415,2021-07-18 11:24:15,C++,10.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\nusing namespace std;\n\nstring S_Scale(int, int);\nbool B_Palindrome(string);\n\nint main()\n{\n    int N;\n    cin >> N;\n    for (int i = 1; i <= 300;i++)\n    {\n        if(B_Palindrome(S_Scale(i*i,N)))\n            cout << i << ' ' << S_Scale(i*i, N) << endl;\n    }\n\n}\n\nstring S_Scale(int d,int N)\n{\n    int n = d;\n    string scale = \""\"";\n    while(n>=N)\n    {\n        scale = to_string(n % N) + scale;\n        n = n / N;\n    }\n    scale = to_string(n) + scale;\n    return scale;\n}\n\nbool B_Palindrome(string S)\n{\n    for (int i = 0; i < S.size()/2;i++)\n    {\n        if (S[i]!=S[S.size()-i-1])\n            return false;\n    }\n    return true;\n}",PARTIAL_ACCEPTED,34,324
1416600087101915136,c706dfea9418770ab9f712fc7bb82eee5c74c2f8f497bbb546de989e2dac6415,2021-07-18 11:25:54,C++,40.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\nusing namespace std;\n\nstring S_Scale(int, int);\nbool B_Palindrome(string);\n\nint main()\n{\n    int N;\n    cin >> N;\n    for (int i = 1; i <= 300;i++)\n    {\n        if(B_Palindrome(S_Scale(i*i,N)))\n            cout << S_Scale(i,N) << ' ' << S_Scale(i*i, N) << endl;\n    }\n\n}\n\nstring S_Scale(int d,int N)\n{\n    int n = d;\n    string scale = \""\"";\n    while(n>=N)\n    {\n        scale = to_string(n % N) + scale;\n        n = n / N;\n    }\n    scale = to_string(n) + scale;\n    return scale;\n}\n\nbool B_Palindrome(string S)\n{\n    for (int i = 0; i < S.size()/2;i++)\n    {\n        if (S[i]!=S[S.size()-i-1])\n            return false;\n    }\n    return true;\n}",PARTIAL_ACCEPTED,34,456
1416603619729293312,c706dfea9418770ab9f712fc7bb82eee5c74c2f8f497bbb546de989e2dac6415,2021-07-18 11:39:56,C++,80.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\nusing namespace std;\n\nstring S_Scale(int, int);\nbool B_Palindrome(string);\n\nint main()\n{\n    int N;\n    cin >> N;\n    for (int i = 1; i <= 300;i++)\n    {\n        if(B_Palindrome(S_Scale(i*i,N)))\n            cout << S_Scale(i,N) << ' ' << S_Scale(i*i, N) << endl;\n    }\n\n}\n\nstring S_Scale(int d,int N)\n{\n    int n = d;\n    string scale = \""\"";\n    while(n>=N)\n    {\n        if (n%N<10)\n            scale = to_string(n % N) + scale;\n        else if (n%N == 10)\n            scale = 'A' + scale;\n        else if (n%N == 11)\n            scale = 'B' + scale;\n        else if (n%N == 12)\n            scale = 'C' + scale;\n        else if (n%N == 13)\n            scale = 'D' + scale;\n        else if (n%N == 14)\n            scale = 'E' + scale;\n        else if (n%N == 15)\n            scale = 'F' + scale;\n        else if (n%N == 16)\n            scale = 'G' + scale;\n        else if (n%N == 17)\n            scale = 'H' + scale;\n        else if (n%N == 18)\n            scale = 'I' + scale;\n        else if (n%N == 19)\n            scale = 'J' + scale;\n        n = n / N;\n    }\n    if (n%N == 10)\n        scale = 'A' + scale;\n    else if (n%N == 11)\n        scale = 'B' + scale;\n    else if (n%N == 12)\n        scale = 'C' + scale;\n    else if (n%N == 13)\n        scale = 'D' + scale;\n    else if (n%N == 14)\n        scale = 'E' + scale;\n    else if (n%N == 15)\n        scale = 'F' + scale;\n    else if (n%N == 16)\n        scale = 'G' + scale;\n    else if (n%N == 17)\n        scale = 'H' + scale;\n    else if (n%N == 18)\n        scale = 'I' + scale;\n    else if (n%N == 19)\n        scale = 'J' + scale;\n    else\n        scale = to_string(n) + scale;\n    return scale;\n}\n\nbool B_Palindrome(string S)\n{\n    for (int i = 0; i < S.size()/2;i++)\n    {\n        if (S[i]!=S[S.size()-i-1])\n            return false;\n    }\n    return true;\n}",ACCEPTED,36,464
1416604594758213632,c706dfea9418770ab9f712fc7bb82eee5c74c2f8f497bbb546de989e2dac6415,2021-07-18 11:43:49,C++,50.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\nusing namespace std;\n\nstring S_Scale(int, int);\nbool B_Palindrome(string);\n\nint main()\n{\n    int N;\n    cin >> N;\n    for (int i = 1; i <= 300;i++)\n    {\n        if(B_Palindrome(S_Scale(i*i,N)))\n            cout << S_Scale(i,N) << ' ' << S_Scale(i*i, N) << endl;\n    }\n\n}\n\nstring S_Scale(int d,int N)\n{\n    int n = d;\n    string scale = \""\"";\n    while(n>=N)\n    {\n        if (n%N<10)\n            scale = to_string(n % N) + scale;\n        else\n            scale += (n%N - 10 + 'A');\n        n = n / N;\n    }\n    if (n%N<10)\n            scale = to_string(n % N) + scale;\n    else\n        scale += (n%N - 10 + 'A');\n    return scale;\n}\n\nbool B_Palindrome(string S)\n{\n    for (int i = 0; i < S.size()/2;i++)\n    {\n        if (S[i]!=S[S.size()-i-1])\n            return false;\n    }\n    return true;\n}",PARTIAL_ACCEPTED,34,448
1416605782287269888,c706dfea9418770ab9f712fc7bb82eee5c74c2f8f497bbb546de989e2dac6415,2021-07-18 11:48:32,C++,80.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\nusing namespace std;\n\nstring S_Scale(int, int);\nbool B_Palindrome(string);\n\nint main()\n{\n    int N;\n    cin >> N;\n    for (int i = 1; i <= 300;i++)\n    {\n        if(B_Palindrome(S_Scale(i*i,N)))\n            cout << S_Scale(i,N) << ' ' << S_Scale(i*i, N) << endl;\n    }\n\n}\n\nstring S_Scale(int d,int N)\n{\n    int n = d;\n    string scale = \""\"";\n    while(n>=N)\n    {\n        if (n%N<10)\n            scale = to_string(n % N) + scale;\n        else\n            scale = char(n%N - 10 + 'A')+scale;\n        n = n / N;\n    }\n    if (n%N<10)\n            scale = to_string(n % N) + scale;\n    else\n        scale = char(n%N - 10 + 'A')+scale;\n    return scale;\n}\n\nbool B_Palindrome(string S)\n{\n    for (int i = 0; i < S.size()/2;i++)\n    {\n        if (S[i]!=S[S.size()-i-1])\n            return false;\n    }\n    return true;\n}",ACCEPTED,37,448
1416636565681029120,c706dfea9418770ab9f712fc7bb82eee5c74c2f8f497bbb546de989e2dac6415,2021-07-18 13:50:51,C++,10.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\nusing namespace std;\n\nstring S_Scale(int, int);\nbool B_Palindrome(string);\n\nstruct Num\n{\n    int N;//数字\n    int P_N;//满足不同进制回文次数\n};\nint main()\n{\n    int N, S;\n    cin >> N >> S;\n    while(N>0)\n    {\n        S++;\n        Num N_S;\n        N_S.N = S;\n        for (int i = 2; i <= 10;i++)\n        {\n            if(B_Palindrome(S_Scale(N_S.N,i)))\n                N_S.P_N++;\n            if (N_S.P_N >= 2)\n            {\n                cout << N_S.N << endl;\n                N--;\n                break;\n            }\n\n        }\n    }\n}\n\n\n\nstring S_Scale(int d,int N)\n{\n    int n = d;\n    string scale = \""\"";\n    while(n>=N)\n    {\n        if (n%N<10)\n            scale = to_string(n % N) + scale;\n        else\n            scale = char(n%N - 10 + 'A')+scale;\n        n = n / N;\n    }\n    if (n%N<10)\n            scale = to_string(n % N) + scale;\n    else\n        scale = char(n%N - 10 + 'A')+scale;\n    return scale;\n}\n\nbool B_Palindrome(string S)\n{\n    for (int i = 0; i < S.size()/2;i++)\n    {\n        if (S[i]!=S[S.size()-i-1])\n            return false;\n    }\n    return true;\n}",PARTIAL_ACCEPTED,25,452
1416637182889680896,c706dfea9418770ab9f712fc7bb82eee5c74c2f8f497bbb546de989e2dac6415,2021-07-18 13:53:18,C++,70.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\nusing namespace std;\n\nstring S_Scale(int, int);\nbool B_Palindrome(string);\n\nstruct Num\n{\n    int N;//数字\n    int P_N=0;//满足不同进制回文次数\n};\nint main()\n{\n    int N, S;\n    cin >> N >> S;\n    while(N>0)\n    {\n        S++;\n        Num N_S;\n        N_S.N = S;\n        for (int i = 2; i <= 10;i++)\n        {\n            if(B_Palindrome(S_Scale(N_S.N,i)))\n                N_S.P_N++;\n            if (N_S.P_N >= 2)\n            {\n                cout << N_S.N << endl;\n                N--;\n                break;\n            }\n        }\n    }\n}\n\n\n\nstring S_Scale(int d,int N)\n{\n    int n = d;\n    string scale = \""\"";\n    while(n>=N)\n    {\n        if (n%N<10)\n            scale = to_string(n % N) + scale;\n        else\n            scale = char(n%N - 10 + 'A')+scale;\n        n = n / N;\n    }\n    if (n%N<10)\n            scale = to_string(n % N) + scale;\n    else\n        scale = char(n%N - 10 + 'A')+scale;\n    return scale;\n}\n\nbool B_Palindrome(string S)\n{\n    for (int i = 0; i < S.size()/2;i++)\n    {\n        if (S[i]!=S[S.size()-i-1])\n            return false;\n    }\n    return true;\n}",ACCEPTED,70,324
1416637264519225344,c706dfea9418770ab9f712fc7bb82eee5c74c2f8f497bbb546de989e2dac6415,2021-07-18 13:53:38,C++,70.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\nusing namespace std;\n\nstring S_Scale(int, int);\nbool B_Palindrome(string);\n\nstruct Num\n{\n    int N;//数字\n    int P_N=0;//满足不同进制回文次数\n};\nint main()\n{\n    int N, S;\n    cin >> N >> S;\n    while(N>0)\n    {\n        S++;\n        Num N_S;\n        N_S.N = S;\n        for (int i = 2; i <= 10;i++)\n        {\n            if(B_Palindrome(S_Scale(N_S.N,i)))\n                N_S.P_N++;\n            if (N_S.P_N == 2)\n            {\n                cout << N_S.N << endl;\n                N--;\n                break;\n            }\n        }\n    }\n}\n\n\n\nstring S_Scale(int d,int N)\n{\n    int n = d;\n    string scale = \""\"";\n    while(n>=N)\n    {\n        if (n%N<10)\n            scale = to_string(n % N) + scale;\n        else\n            scale = char(n%N - 10 + 'A')+scale;\n        n = n / N;\n    }\n    if (n%N<10)\n            scale = to_string(n % N) + scale;\n    else\n        scale = char(n%N - 10 + 'A')+scale;\n    return scale;\n}\n\nbool B_Palindrome(string S)\n{\n    for (int i = 0; i < S.size()/2;i++)\n    {\n        if (S[i]!=S[S.size()-i-1])\n            return false;\n    }\n    return true;\n}",ACCEPTED,70,444
1416926659292991488,7d2379653728c29fc8c1ebcfb94722b506eb1ae6ff4e90974c21e4661db710a4,2021-07-19 09:03:35,C++,10.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n    int N,S;\n    cin>>N>>S;\n    int n=S+1;\n    int count=0;\n    while(count<N){\n        for(int j=2;j<=10;j++){\n            vector<string> vec;\n            int temp=n;\n            string s=\""\"";\n            while(temp!=0){\n                vec.push_back(to_string(temp%j));\n                temp/=j;\n            }\n            for(auto x=vec.rbegin();x!=vec.rend();x++){\n                s+=*x;\n            }\n            string s1(s.rbegin(),s.rend());\n            if(s==s1){\n                count++;\n                cout<<n<<endl;\n                break;\n            }\n        }\n        n++;\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,30,324
1416934875301187584,7d2379653728c29fc8c1ebcfb94722b506eb1ae6ff4e90974c21e4661db710a4,2021-07-19 09:36:14,C++,70.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n    int N,S;\n    cin>>N>>S;\n    int n=S+1;\n    int count=0;\n    while(count<N){\n        int k=0;\n        for(int j=2;j<=10;j++){\n            vector<string> vec;\n            int temp=n;\n            string s=\""\"";\n            while(temp!=0){\n                vec.push_back(to_string(temp%j));\n                temp/=j;\n            }\n            for(auto x=vec.rbegin();x!=vec.rend();x++){\n                s+=*x;\n            }\n            string s1(s.rbegin(),s.rend());\n            if(s==s1){\n                k++;\n            }\n        }\n        if(k>=2){\n            count++;\n            cout<<n<<endl;\n        }\n        n++;\n    }\n    return 0;\n}",ACCEPTED,69,496
1417030276666658816,bcceb5f830c52ad75d96832f6171f3ffc147f7e20a5d9f7b206e4378d3b11e74,2021-07-19 15:55:19,C++,0.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include<cstdio>\n#include<cstring>\n#include<cmath>\n#include<iostream>\n#include<algorithm>\nusing namespace std;\nstring solve(int a,int b);\nbool flag;\nint main()\n{\n        int n;\n        cin>>n;\n        for(int i=1;i<=300;i++)\n        {\n                string  a=solve(i,n);\n               string b=solve(i*i,n);\n                if(flag) cout<<a<<' '<<b<<endl;\n        }\n        return 0;\n}\nstring solve(int a,int b)\n{\n    string d;\n    d.clear();\n    int i=0;\n    char c;\n    while(a%b!=a)\n    {\n        i=a%b;\n        if(i>=10) c=char(i+55);\n        else c=i+'0';\n        a=a/b;\n       d.push_back(c);\n    }\n\n    string e=d;\n    reverse(d.begin(),d.end());\n    if(e==d) flag=1;\n    else flag=0;\n    return d;\n}\n",WRONG_ANSWER,37,444
1417037941165821952,6380b8ae1873eb8871b30e187c82024b9bfc1eb3efc3918be4afd5951b6a796e,2021-07-19 16:25:47,C++,50.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<string>\n#include <algorithm>\nusing namespace std;\n\nstring to_B(int x,int B){\n    string nums;\n    int remain;\n    while(x>=B){\n        remain=x%B;\n        x/=B;\n        nums.push_back(char(remain+'0'));\n    }\n    nums.push_back(char(x+'0'));\n    reverse(nums.begin(),nums.end());\n    return nums;\n}\nint main()\n{\n    int n;\n    cin>>n;\n    string nums;\n    int sign=0;\n    for(int i=1;i<301;i++){\n        nums=to_B(i*i,n);\n        for (int k=0;k<int(nums.size())/2;k++) {\n            if(nums[k]==nums[int(nums.size())-k-1]) sign++;\n        }\n        if(sign==int(nums.size())/2){\n            cout<<to_B(i,n)<<\"" \""<<nums<<endl;\n        }\n        sign=0;\n    }\n}\n",PARTIAL_ACCEPTED,47,480
1417041637505273856,6380b8ae1873eb8871b30e187c82024b9bfc1eb3efc3918be4afd5951b6a796e,2021-07-19 16:40:28,C++,0.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<string>\n#include<vector>\n#include <algorithm>\nusing namespace std;\n\nvector <int> to_B(int x,int B,vector <int> nums){\n    int remain;\n    while(x>=B){\n        remain=x%B;\n        x/=B;\n        nums.push_back(remain);\n    }\n    nums.push_back(x);\n    reverse(nums.begin(),nums.end());\n    return nums;\n}\nint main()\n{\n    int n;\n    cin>>n;\n    vector <int> nums;\n    int sign=0;\n    vector <int> num;\n    for(int i=1;i<301;i++){\n        to_B(i,n,num);\n        to_B(i*i,n,nums);\n        for (int k=0;k<int(nums.size())/2;k++) {\n            if(nums[k]==nums[int(nums.size())-k-1]) sign++;\n        }\n        if(sign==int(nums.size())/2){\n            for (int p=nums.size()-1;p>=0;p--) {\n                cout<<num[p];\n            }\n            cout<<\"" \"";\n            for (int p=nums.size()-1;p>=0;p--) {\n                cout<<nums[p];\n            }\n            cout<<endl;\n        }\n        sign=0;\n    }\n}\n",WRONG_ANSWER,39,324
1417650057245716480,ab5baabd25753270c448a497aae45b35e510fa2f19ff49cf0343e8a6f0fd0cc0,2021-07-21 08:58:06,C++,10.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\n#include<typeinfo>\nusing namespace std;\nint main()\n{\n    int N,S,sz;\n    cin>>N>>S;\n    sz=S+1;\n    for(int i=0;i<N;i++)\n    {\n        while (1==1)\n        {\n            int j=0,sz10,js=0;\n            sz10=sz;\n            string s_sz10,s_zs10;\n            char c_sz10[10];\n            for(int i=2;i<=10;i++)\n            {\n                while(sz10)\n                {\n                    c_sz10[j]=sz10%i;\n                    sz10/=i;\n                    j+=1;\n                }\n                s_sz10=c_sz10;\n                s_zs10=c_sz10;\n                reverse(s_sz10.begin(),s_sz10.end());\n                if(s_sz10.compare(s_zs10)==0)\n                {\n                    js+=1;\n                }\n            }\n            if(js>=2)\n            {\n                cout<<sz<<endl;\n                break;\n            }\n            sz+=1;\n        }\n        sz+=1;\n    }\n    return 0;\n}\n",PARTIAL_ACCEPTED,37,428
1417654582098669568,ab5baabd25753270c448a497aae45b35e510fa2f19ff49cf0343e8a6f0fd0cc0,2021-07-21 09:16:05,C++,0.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\n#include<typeinfo>\nusing namespace std;\nint main()\n{\n    int N,S,sz;\n    cin>>N>>S;\n    sz=S+1;\n    for(int i=0;i<N;i++)\n    {\n        while (1==1)\n        {\n            int j=0,sz10,js=0;\n            sz10=sz;\n            int c_sz10[10];\n            for(int i=2;i<=10;i++)\n            {\n                while(sz10)\n                {\n                    c_sz10[j]=sz10%i;\n                    sz10/=i;\n                    j+=1;\n                }\n                for(int i=0;i< j >> 1;i++)\n                {\n                    if(c_sz10[i]==c_sz10[j-1-i])\n                    {\n                        continue;\n                    }\n                    js=js-1;\n                    break;\n                }\n                js=js+1;\n            }\n            if(js>=2)\n            {\n                cout<<sz<<endl;\n                break;\n            }\n            sz+=1;\n        }\n        sz+=1;\n    }\n    return 0;\n}\n\n",MULTIPLE_ERROR,35,596
1417655692255391744,ab5baabd25753270c448a497aae45b35e510fa2f19ff49cf0343e8a6f0fd0cc0,2021-07-21 09:20:30,C++,0.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\n#include<typeinfo>\nusing namespace std;\nint main()\n{\n    int N,S,sz;\n    cin>>N>>S;\n    sz=S+1;\n    for(int i=0;i<N;i++)\n    {\n        while (1==1)\n        {\n            int j=0,sz10,js=0;\n            sz10=sz;\n            int c_sz10[20];\n            for(int i=2;i<=10;i++)\n            {\n                while(sz10)\n                {\n                    c_sz10[j]=sz10%i;\n                    sz10/=i;\n                    j+=1;\n                }\n                for(int i=0;i< j >> 1;i++)\n                {\n                    if(c_sz10[i]==c_sz10[j-1-i])\n                    {\n                        continue;\n                    }\n                    js=js-1;\n                    break;\n                }\n                js=js+1;\n            }\n            if(js>=2)\n            {\n                cout<<sz<<endl;\n                break;\n            }\n            sz+=1;\n        }\n        sz+=1;\n    }\n    return 0;\n}\n\n",WRONG_ANSWER,38,456
1417656688272568320,ab5baabd25753270c448a497aae45b35e510fa2f19ff49cf0343e8a6f0fd0cc0,2021-07-21 09:24:27,C++,70.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm>\n#include<typeinfo>\nusing namespace std;\nint main()\n{\n    int N,S,sz;\n    cin>>N>>S;\n    sz=S+1;\n    for(int i=0;i<N;i++)\n    {\n        while (1==1)\n        {\n            int js=0;\n            for(int i=2;i<=10;i++)\n            {\n                int j=0,sz10;\n                sz10=sz;\n                int c_sz10[20];\n                while(sz10)\n                {\n                    c_sz10[j]=sz10%i;\n                    sz10=sz10/i;\n                    j+=1;\n                }\n                for(int i=0;i< j >> 1;i++)\n                {\n                    if(c_sz10[i]==c_sz10[j-1-i])\n                    {\n                        continue;\n                    }\n                    js=js-1;\n                    break;\n                }\n                js=js+1;\n            }\n            if(js>=2)\n            {\n                cout<<sz<<endl;\n                break;\n            }\n            sz+=1;\n        }\n        sz+=1;\n    }\n    return 0;\n}\n",ACCEPTED,36,316
1419701110619693056,6380b8ae1873eb8871b30e187c82024b9bfc1eb3efc3918be4afd5951b6a796e,2021-07-27 00:48:16,C++,50.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<string>\n#include <algorithm>\nusing namespace std;\n\nstring to_B(int x,int B){\n    string nums;\n    int remain;\n    while(x>=B){\n        remain=x%B;\n        x/=B;\n        if(remain<10) nums.push_back(char(remain+'0'));\n        else {\n            nums.push_back(char(remain-11+'A'));\n        }\n    }\n    if(x<10) nums.push_back(char(x+'0'));\n    else {\n        nums.push_back(char(x-11+'A'));\n    }\n    reverse(nums.begin(),nums.end());\n    return nums;\n}\nint main()\n{\n    int n;\n    cin>>n;\n    string nums;\n    int sign=0;\n    for(int i=1;i<301;i++){\n        nums=to_B(i*i,n);\n        for (int k=0;k<int(nums.size())/2;k++) {\n            if(nums[k]==nums[int(nums.size())-k-1]) sign++;\n        }\n        if(sign==int(nums.size())/2){\n            cout<<to_B(i,n)<<\"" \""<<nums<<endl;\n        }\n        sign=0;\n    }\n}\n",PARTIAL_ACCEPTED,33,456
1419701575142834176,6380b8ae1873eb8871b30e187c82024b9bfc1eb3efc3918be4afd5951b6a796e,2021-07-27 00:50:06,C++,80.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<string>\n#include <algorithm>\nusing namespace std;\n\nstring to_B(int x,int B){\n    string nums;\n    int remain;\n    while(x>=B){\n        remain=x%B;\n        x/=B;\n        if(remain<10) nums.push_back(char(remain+'0'));\n        else {\n            nums.push_back(char(remain-10+'A'));\n        }\n    }\n    if(x<10) nums.push_back(char(x+'0'));\n    else {\n        nums.push_back(char(x-10+'A'));\n    }\n    reverse(nums.begin(),nums.end());\n    return nums;\n}\nint main()\n{\n    int n;\n    cin>>n;\n    string nums;\n    int sign=0;\n    for(int i=1;i<301;i++){\n        nums=to_B(i*i,n);\n        for (int k=0;k<int(nums.size())/2;k++) {\n            if(nums[k]==nums[int(nums.size())-k-1]) sign++;\n        }\n        if(sign==int(nums.size())/2){\n            cout<<to_B(i,n)<<\"" \""<<nums<<endl;\n        }\n        sign=0;\n    }\n}\n",ACCEPTED,30,448
1432181102664908800,9c14cd161276749b55ccfccebbbc95f0188dcf55386be02c0611c5fcccfc0c1b,2021-08-30 11:19:18,C++,0.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include <stdio.h>\n#include <math.h>\n\nint fuc(int x)\n\n{\n\n\tint m,newed=0,t=0;\n\n\tm=x;\n\n\tdo\n\n\t{\n\n\t\tnewed=newed*10+m%10;\n\n\t\tm/=10;\n\n\t}while(m>0);\n\n\tif(x==newed) t=1;\n\n\treturn t;\n\n}\n\nint main()\n\n{\n\n\tint n;\n\n\twhile(scanf(\""%d\"",&n)!=EOF&&n!=0)\n\n\t{\n        if(fuc(n)&&sqrt(n)==(int)sqrt(n)) printf(\""YES\\n\"");\n        else printf(\""NO\\n\"");\n\t}\n\treturn 0;\n\n}\n",WRONG_ANSWER,57,320
1432181230503100416,9c14cd161276749b55ccfccebbbc95f0188dcf55386be02c0611c5fcccfc0c1b,2021-08-30 11:19:48,C++,70.0,1410764822045835272,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <sstream>\n#include <string>\n#include <cmath>\nusing namespace std;\nint hw(int s)\n{\n    int ans=0;\n    for(int i=2;i<=10;i++)\n    {\n        if(ans==2) break;\n        int s0=s,j=0;\n        long long x=0;//转换成二进制可能很长 \n        while(s0)\n        {\n            x+=(s0%i)*pow(10,j);\n            s0/=i;\n            j++;\n        }\n        //cout<<x<<endl;\n        stringstream t;\n        string s;\n        t<<x;\n        t>>s;\n        int ls=s.size(),l=0;\n        while(s[l]==s[ls-1-l] && l<=(ls-1)/2)\n        {\n            l++;\n        }\n        l--;\n        if(l==(ls-1)/2) ans++;\n    }\n    return ans;\n}\nint main(){\n    int n,s,num=0;\n    cin>>n>>s;\n    while(num<n)\n    {\n        s++;\n        if(hw(s)==2) \n        {\n            cout<<s<<endl;\n            num++;\n        }\n    }\n    return 0;\n}\n",ACCEPTED,59,324
1432186013712596992,9c14cd161276749b55ccfccebbbc95f0188dcf55386be02c0611c5fcccfc0c1b,2021-08-30 11:38:49,C++,0.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n    int N, even = 0, odd = 0;\n    cin >> N;\n    while (N--)\n    {\n        string a;\n        cin >> a;\n        if ((a[a.size() - 1] - '0') % 2 == 0)\n            even++;\n        else\n            odd++;\n    }\n    cout << odd << \"" \"" << even << endl;\n    return 0;\n}\n",WRONG_ANSWER,46,444
1432195063934304256,9c14cd161276749b55ccfccebbbc95f0188dcf55386be02c0611c5fcccfc0c1b,2021-08-30 12:14:46,C++,0.0,1410764822045835271,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n    int N, even = 0, odd = 0;\n    cin >> N;\n    while (N--)\n    {\n        string a;\n        cin >> a;\n        if ((a[a.size() - 1] - '0') % 2 == 0)\n            even++;\n        else\n            odd++;\n    }\n    cout << odd << \"" \"" << even << endl;\n    return 0;\n}\n",WRONG_ANSWER,37,440
1513867900883476480,725e98b7c74245bcdb25c909bf0eceb19bb275997c9ee7fd3d698c140fdc18d6,2022-04-12 21:13:28,C++,10.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint n,w;\nlong long pre[1000];\nstring Transform(int a){\n//\tprintf(\""a==%d\\n\"",a);\n\tstring ans;\n\tint st;\n\tfor(int i=w;i>=0;i--){\n\t\tif(a>=pre[i]){\n\t\t\tst=i;\n\t\t\tbreak;\n\t\t}\n\t}\n//\tprintf(\""st==%d\\n\"",st);\n\tfor(int i=st;i>=0;i--){\n\t\tif(a>=pre[i]){\n\t\t\tint x=a/pre[i];\n\t//\t\tprintf(\""x==%d %d\\n\"",x,pre[i]);\n\t\t\tif(x<10)ans+=char('0'+x);\n\t\t\telse ans+=char('A'+x-10);\n\t\t\ta-=x*pre[i];\n\t\t}\n\t\telse{\n\t\t\tans+='0';\n\t\t}\n\t}\n\treturn ans;\n}\nbool check(int x){\n\tint xx=x*x;\n\tif(xx%10==0)return 0;\n\tstring a=Transform(xx);\n\t//cout<<xx<<\"" \""<<a<<endl;\n\tint l=a.size();\n\tbool MK=1;\n\tfor(int i=0;i<l;i++){\n\t\tif(a[i]!=a[l-1-i])MK=0;\n\t}\n\treturn MK;\n}\nint main(){\n\tcin>>n;\n\tpre[0]=1;\n\tfor(int i=1;i<=10;i++){\n\t\tpre[i]=pre[i-1]*n;\n\t\tif(pre[i]>300*300){\n\t\t\tw=i;\n\t\t\tbreak;\n\t\t}\n\t}\n//\tcout<<Transform(10201)<<\""!!!\""<<endl;\n\tfor(int i=1;i<=300;i++){\n\t\tif(check(i)){\n\t\t\tstring a=Transform(i*i);\n\t\t\tcout<<i<<\"" \""<<a<<endl;\n\t\t}\n\t} \n}",PARTIAL_ACCEPTED,36,472
1513868952407875584,725e98b7c74245bcdb25c909bf0eceb19bb275997c9ee7fd3d698c140fdc18d6,2022-04-12 21:17:39,C++,10.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint n,w;\nlong long pre[1000];\nstring Transform(int a){\n//\tprintf(\""a==%d\\n\"",a);\n\tstring ans;\n\tint st;\n\tfor(int i=w;i>=0;i--){\n\t\tif(a>=pre[i]){\n\t\t\tst=i;\n\t\t\tbreak;\n\t\t}\n\t}\n//\tprintf(\""st==%d\\n\"",st);\n\tfor(int i=st;i>=0;i--){\n\t\tif(a>=pre[i]){\n\t\t\tint x=a/pre[i];\n\t//\t\tprintf(\""x==%d %d\\n\"",x,pre[i]);\n\t\t\tif(x<10)ans+=char('0'+x);\n\t\t\telse ans+=char('A'+x-10);\n\t\t\ta-=x*pre[i];\n\t\t}\n\t\telse{\n\t\t\tans+='0';\n\t\t}\n\t}\n\treturn ans;\n}\nbool check(int x){\n\tint xx=x*x;\n\tif(xx%10==0)return 0;\n\tstring a=Transform(xx);\n\t//cout<<xx<<\"" \""<<a<<endl;\n\tint l=a.size();\n\tbool MK=1;\n\tfor(int i=0;i<l;i++){\n\t\tif(a[i]!=a[l-1-i])MK=0;\n\t}\n\treturn MK;\n}\nint main(){\n\tcin>>n;\n\tpre[0]=1;\n\tfor(int i=1;i;i++){\n\t\tpre[i]=pre[i-1]*n;\n\t\tif(pre[i]>300*300){\n\t\t\tw=i;\n\t\t\tbreak;\n\t\t}\n\t}\n\t//for(int i=1;i<=w;i++)printf(\""pre[%d]=%d\\n\"",i,pre[i]);\n//\tcout<<Transform(10201)<<\""!!!\""<<endl;\n\tfor(int i=1;i<=300;i++){\n\t\tif(check(i)){\n\t\t\tstring a=Transform(i*i);\n\t\t\tcout<<i<<\"" \""<<a<<endl;\n\t\t}\n\t} \n}",PARTIAL_ACCEPTED,37,468
1513878459280793600,725e98b7c74245bcdb25c909bf0eceb19bb275997c9ee7fd3d698c140fdc18d6,2022-04-12 21:55:25,C++,10.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint n,w;\nlong long pre[1000];\nstring Transform(int a){\n//\tprintf(\""a==%d\\n\"",a);\n\tstring ans;\n\tint st;\n\tfor(int i=w;i>=0;i--){\n\t\tif(a>=pre[i]){\n\t\t\tst=i;\n\t\t\tbreak;\n\t\t}\n\t}\n//\tprintf(\""st==%d\\n\"",st);\n\tfor(int i=st;i>=0;i--){\n\t\tif(a>=pre[i]){\n\t\t\tint x=a/pre[i];\n\t//\t\tprintf(\""x==%d %d\\n\"",x,pre[i]);\n\t\t\tif(x<10)ans+=char('0'+x);\n\t\t\telse ans+=char('A'+x-10);\n\t\t\ta-=x*pre[i];\n\t\t}\n\t\telse{\n\t\t\tans+='0';\n\t\t}\n\t}\n//\tcout<<\""ans==\""<<ans<<endl<<endl;\n\treturn ans;\n}\nbool check(int x){\n\tint xx=x*x;\n\tif(xx%10==0)return 0;\n\tstring a=Transform(xx);\n\t//cout<<xx<<\"" \""<<a<<endl;\n\tint l=a.size();\n\tbool MK=1;\n\tfor(int i=0;i<l;i++){\n\t\tif(a[i]!=a[l-1-i])MK=0;\n\t}\n\treturn MK;\n}\nint main(){\n\tcin>>n;\n\tpre[0]=1;\n\tfor(int i=1;i;i++){\n\t\tpre[i]=pre[i-1]*n;\n\t\tif(pre[i]>300*300){\n\t\t\tw=i;\n\t\t\tbreak;\n\t\t}\n\t}\n\t//for(int i=1;i<=w;i++)printf(\""pre[%d]=%d\\n\"",i,pre[i]);\n//\tcout<<Transform(10201)<<\""!!!\""<<endl;\n\tfor(int i=1;i<=300;i++){\n\t\tif(check(i)){\n\t\t\tstring a=Transform(i*i);\n\t\t\tcout<<i<<\"" \""<<a<<endl;\n\t\t}\n\t} \n}",PARTIAL_ACCEPTED,35,452
1513879402189692928,725e98b7c74245bcdb25c909bf0eceb19bb275997c9ee7fd3d698c140fdc18d6,2022-04-12 21:59:10,C++,70.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint n,w;\nlong long pre[1000];\nstring Transform(int a){\n//\tprintf(\""a==%d\\n\"",a);\n\tstring ans;\n\tint st;\n\tfor(int i=w;i>=0;i--){\n\t\tif(a>=pre[i]){\n\t\t\tst=i;\n\t\t\tbreak;\n\t\t}\n\t}\n//\tprintf(\""st==%d\\n\"",st);\n\tfor(int i=st;i>=0;i--){\n\t\tif(a>=pre[i]){\n\t\t\tint x=a/pre[i];\n//\t\t\tprintf(\""x==%d %d\\n\"",x,pre[i]);\n\t\t\tif(x<10)ans+=char('0'+x);\n\t\t\telse ans+=char('A'+x-10);\n\t\t\ta-=x*pre[i];\n\t\t}\n\t\telse{\n\t\t\tans+='0';\n\t\t}\n\t}\n\t//cout<<\""ans==\""<<ans<<endl<<endl;\n\treturn ans;\n}\nbool check(int x){\n\tint xx=x*x;\n\tif(xx%10==0)return 0;\n\tstring a=Transform(xx);\n\t//cout<<xx<<\"" \""<<a<<endl;\n\tint l=a.size();\n\tbool MK=1;\n\tfor(int i=0;i<l;i++){\n\t\tif(a[i]!=a[l-1-i])MK=0;\n\t}\n\treturn MK;\n}\nint main(){\n\tcin>>n;\n\tpre[0]=1;\n\tfor(int i=1;i;i++){\n\t\tpre[i]=pre[i-1]*n;\n\t\tif(pre[i]>300*300){\n\t\t\tw=i;\n\t\t\tbreak;\n\t\t}\n\t}\n\t//for(int i=1;i<=w;i++)printf(\""pre[%d]=%d\\n\"",i,pre[i]);\n//\tcout<<Transform(10201)<<\""!!!\""<<endl;\n\tfor(int i=1;i<=300;i++){\n\t\tif(check(i)){\n\t\t\tstring a=Transform(i*i);\n\t\t\tcout<<Transform(i)<<\"" \""<<a<<endl;\n\t\t}\n\t} \n}",PARTIAL_ACCEPTED,34,584
1513879718146613248,725e98b7c74245bcdb25c909bf0eceb19bb275997c9ee7fd3d698c140fdc18d6,2022-04-12 22:00:25,C++,80.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint n,w;\nlong long pre[1000];\nstring Transform(int a){\n//\tprintf(\""a==%d\\n\"",a);\n\tstring ans;\n\tint st;\n\tfor(int i=w;i>=0;i--){\n\t\tif(a>=pre[i]){\n\t\t\tst=i;\n\t\t\tbreak;\n\t\t}\n\t}\n//\tprintf(\""st==%d\\n\"",st);\n\tfor(int i=st;i>=0;i--){\n\t\tif(a>=pre[i]){\n\t\t\tint x=a/pre[i];\n//\t\t\tprintf(\""x==%d %d\\n\"",x,pre[i]);\n\t\t\tif(x<10)ans+=char('0'+x);\n\t\t\telse ans+=char('A'+x-10);\n\t\t\ta-=x*pre[i];\n\t\t}\n\t\telse{\n\t\t\tans+='0';\n\t\t}\n\t}\n\t//cout<<\""ans==\""<<ans<<endl<<endl;\n\treturn ans;\n}\nbool check(int x){\n\tint xx=x*x;\n//\tif(xx%10==0)return 0;\n\tstring a=Transform(xx);\n\t//cout<<xx<<\"" \""<<a<<endl;\n\tint l=a.size();\n\tbool MK=1;\n\tfor(int i=0;i<l;i++){\n\t\tif(a[i]!=a[l-1-i])MK=0;\n\t}\n\treturn MK;\n}\nint main(){\n\tcin>>n;\n\tpre[0]=1;\n\tfor(int i=1;i;i++){\n\t\tpre[i]=pre[i-1]*n;\n\t\tif(pre[i]>300*300){\n\t\t\tw=i;\n\t\t\tbreak;\n\t\t}\n\t}\n\t//for(int i=1;i<=w;i++)printf(\""pre[%d]=%d\\n\"",i,pre[i]);\n//\tcout<<Transform(10201)<<\""!!!\""<<endl;\n\tfor(int i=1;i<=300;i++){\n\t\tif(check(i)){\n\t\t\tstring a=Transform(i*i);\n\t\t\tcout<<Transform(i)<<\"" \""<<a<<endl;\n\t\t}\n\t} \n}",ACCEPTED,41,628
1513882070018138112,725e98b7c74245bcdb25c909bf0eceb19bb275997c9ee7fd3d698c140fdc18d6,2022-04-12 22:09:46,C++,70.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint n,w;\nint m,s; \nlong long pre[1000];\nstring Transform(int a){\n//\tprintf(\""a==%d\\n\"",a);\n\tstring ans;\n\tint st;\n\tfor(int i=w;i>=0;i--){\n\t\tif(a>=pre[i]){\n\t\t\tst=i;\n\t\t\tbreak;\n\t\t}\n\t}\n//\tprintf(\""st==%d\\n\"",st);\n\tfor(int i=st;i>=0;i--){\n\t\tif(a>=pre[i]){\n\t\t\tint x=a/pre[i];\n//\t\t\tprintf(\""x==%d %d\\n\"",x,pre[i]);\n\t\t\tif(x<10)ans+=char('0'+x);\n\t\t\telse ans+=char('A'+x-10);\n\t\t\ta-=x*pre[i];\n\t\t}\n\t\telse{\n\t\t\tans+='0';\n\t\t}\n\t}\n\t//cout<<\""ans==\""<<ans<<endl<<endl;\n\treturn ans;\n}\nbool check(int x){\n\tint xx=x;\n//\tif(xx%10==0)return 0;\n\tstring a=Transform(xx);\n\t//cout<<xx<<\"" \""<<a<<endl;\n\tint l=a.size();\n\tbool MK=1;\n\tfor(int i=0;i<l;i++){\n\t\tif(a[i]!=a[l-1-i])MK=0;\n\t}\n\treturn MK;\n}\nbool OK(int x){\n\tint ans=0;\n\tfor(int i=2;i<=10;i++){ \n\t\tpre[0]=1;\n\t\tfor(int j=1;j;j++){\n\t\t\tpre[j]=pre[j-1]*i;\n\t\t\tif(pre[j]>x){\n\t\t\t\tw=j;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tans+=check(x);\n\t\tif(ans>=2)return 1;\n\t}\n\treturn 0;\n}\nint main(){\n\tcin>>m>>s;\n\tint t=0;\n\tfor(int i=s+1;i;i++){\n\t//\tprintf(\""i==%d\\n\"",i);\n\t\tif(t==m)break;\n\t\tif(OK(i)){\n\t\t\tprintf(\""%d\\n\"",i);\n\t\t\tt++;\n\t\t}\n\t}\n}",ACCEPTED,32,628
1517773625600552960,43b8550e52fca4ab08ad60c02ba4df8e01acfeb1184ee9cfff9aee3f89726bfd,2022-04-23 15:53:25,C++,10.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <cmath>\n#include <vector>\n using namespace std;\n int main()\n {\n     int d,b,flag=1;\n     cin>>b;\n    vector<int> vec[301];\n    for(int i=1;i<=300;i++)\n    {\n        flag=1;\n        d=i*i;\n        while(d)\n        {\n            vec[i].push_back(d%b);\n            d=d/b;\n        }\n    //     for(vector<int>::iterator ip=vec[i].end()-1;ip>=vec[i].begin();)\n    // {\n    //     cout<<*ip--;\n    // }\n    //cout<<endl;\n        for(int j=0;j<=vec[i].size()-1;j++)\n {\n    // cout<<\""size\""<<vec[i].size()<<endl;\n  if(vec[i][j]!=vec[i][vec[i].size()-j-1])\n  {\n      //cout<<vec[i][j]<<\"" \""<<vec[i][vec[i].size()-j]<<endl;\n      flag=0;\n      break;\n  \n  }\n \n }\n if(flag==0)\n continue;\n    cout<<i<<\"" \"";\n    \n    for(vector<int>::iterator ip=vec[i].end()-1;ip>=vec[i].begin();)\n    {\n        cout<<*ip--;\n    }\n        cout<<endl;\n    // for(vector<int>::iterator it=vec[i].begin();it!=vec[i].end();it++)\n    // cout<<*it;\n    // cout<<endl;\n \n    }\n    \n    \n\n    //转化为B进制\n    //判断是否是回文数（1-300）\n\n    system(\""pause\"");\n    return 0;\n }",PARTIAL_ACCEPTED,64,960
1517775707028164608,43b8550e52fca4ab08ad60c02ba4df8e01acfeb1184ee9cfff9aee3f89726bfd,2022-04-23 16:01:42,C++,50.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <cmath>\n#include <vector>\n using namespace std;\n int main()\n {\n     int d,b,flag=1,c;\n     cin>>b;\n    vector<int> vec[301],vec1[301];\n    for(int i=1;i<=300;i++)\n    {\n        flag=1;\n        d=i*i;\n        c=i;\n        while(d)\n        {\n            vec[i].push_back(d%b);\n            d=d/b;\n        }\n        while(c)\n        {\n            vec1[i].push_back(c%b);\n            c=c/b;\n        }\n    //     for(vector<int>::iterator ip=vec[i].end()-1;ip>=vec[i].begin();)\n    // {\n    //     cout<<*ip--;\n    // }\n    //cout<<endl;\n        for(int j=0;j<=vec[i].size()-1;j++)\n {\n    // cout<<\""size\""<<vec[i].size()<<endl;\n  if(vec[i][j]!=vec[i][vec[i].size()-j-1])\n  {\n      //cout<<vec[i][j]<<\"" \""<<vec[i][vec[i].size()-j]<<endl;\n      flag=0;\n      break;\n  \n  }\n \n }\n if(flag==0)\n continue;\n    \n    for(vector<int>::iterator it=vec1[i].end()-1;it>=vec1[i].begin();)\n    {\n        cout<<*it--;\n    }\n        cout<<\"" \"";\n    for(vector<int>::iterator ip=vec[i].end()-1;ip>=vec[i].begin();)\n    {\n        cout<<*ip--;\n    }\n        cout<<endl;\n    // for(vector<int>::iterator it=vec[i].begin();it!=vec[i].end();it++)\n    // cout<<*it;\n    // cout<<endl;\n \n    }\n\n    //转化为B进制\n    //判断是否是回文数（1-300）\n\n    system(\""pause\"");\n    return 0;\n }",PARTIAL_ACCEPTED,49,856
1517806165458268160,43b8550e52fca4ab08ad60c02ba4df8e01acfeb1184ee9cfff9aee3f89726bfd,2022-04-23 18:02:43,C++,70.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <cmath>\n#include <vector>\n#include <algorithm>\n using namespace std;\n int main()\n {\n     int d,b,flag=1,c;\n\n     cin>>b;\n    vector<int> vec[301],vec1[301],rvec[301];\n    for(int i=1;i<=300;i++)\n    {\n        flag=1;\n        d=i*i;\n        c=i;\n        while(d)\n        {\n            \n            vec[i].push_back(d%b);\n         d=d/b;\n        }\n        while(c)\n        {\n           \n            vec1[i].push_back(c%b);\n            c=c/b;\n        }\n    //     for(vector<int>::iterator ip=vec[i].end()-1;ip>=vec[i].begin();)\n    // {\n    //     cout<<*ip--;\n    // }\n    //cout<<endl;\n    // reverse_copy(vec[i].begin(),vec[i].end(),rvec[i]);\n    // if(vec[i]!=rvec[i])\n    // {\n    //     flag=0;\n      \n    // }\n\n        for(int j=0;j<=vec[i].size()-1;j++)\n {\n    // cout<<\""size\""<<vec[i].size()<<endl;\n  if(vec[i][j]!=vec[i][vec[i].size()-j-1])\n  {\n      //cout<<vec[i][j]<<\"" \""<<vec[i][vec[i].size()-j]<<endl;\n      flag=0;\n      break;\n  \n  }\n \n }\n if(flag==0)\n continue;\n    \n    for(vector<int>::iterator it=vec1[i].end()-1;it>=vec1[i].begin();it--)\n    {\n        if((*it)<=10)\n        cout<<*it;\n        else\n        cout<<char((*it)+55);\n    }\n        cout<<\"" \"";\n    for(vector<int>::iterator ip=vec[i].end()-1;ip>=vec[i].begin();ip--)\n    {\n        if((*ip)<=10)\n        cout<<*ip;\n        else\n        cout<<char((*ip)+55);\n    }\n        cout<<endl;\n    // for(vector<int>::iterator it=vec[i].begin();it!=vec[i].end();it++)\n    // cout<<*it;\n    // cout<<endl;\n \n    }\n\n    //转化为B进制\n    //判断是否是回文数（1-300）\n\n    system(\""pause\"");\n    return 0;\n }",PARTIAL_ACCEPTED,41,880
1517816119489159168,43b8550e52fca4ab08ad60c02ba4df8e01acfeb1184ee9cfff9aee3f89726bfd,2022-04-23 18:42:17,C++,80.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <cmath>\n#include <vector>\n#include <algorithm>\n using namespace std;\n int main()\n {\n     int d,b,flag=1,c;\n\n     cin>>b;\n    vector<int> vec[301],vec1[301],rvec[301];\n    for(int i=1;i<=300;i++)\n    {\n        flag=1;\n        d=i*i;\n        c=i;\n        while(d)\n        {\n            \n            vec[i].push_back(d%b);\n         d=d/b;\n        }\n        while(c)\n        {\n           \n            vec1[i].push_back(c%b);\n            c=c/b;\n        }\n\n        for(int j=0;j<=vec[i].size()-1;j++)\n {\n    // cout<<\""size\""<<vec[i].size()<<endl;\n  if(vec[i][j]!=vec[i][vec[i].size()-j-1])\n  {\n      //cout<<vec[i][j]<<\"" \""<<vec[i][vec[i].size()-j]<<endl;\n      flag=0;\n      break;\n  }\n }\n if(flag==0)\n continue;\n    \n    for(vector<int>::iterator it=vec1[i].end()-1;it>=vec1[i].begin();it--)\n    {\n        if((*it)<10)\n        cout<<*it;\n        else\n        cout<<char((*it)+55);\n    }\n        cout<<\"" \"";\n    for(vector<int>::iterator ip=vec[i].end()-1;ip>=vec[i].begin();ip--)\n    {\n        if((*ip)<10)\n        cout<<*ip;\n        else\n        cout<<char((*ip)+55);\n    }\n        cout<<endl;\n \n    }\n\n    //转化为B进制\n    //判断是否是回文数（1-300）\n\n    system(\""pause\"");\n    return 0;\n }",ACCEPTED,25,728
1517829073899700224,43b8550e52fca4ab08ad60c02ba4df8e01acfeb1184ee9cfff9aee3f89726bfd,2022-04-23 19:33:45,C++,10.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <cmath>\n#include <vector>\n#include <algorithm>\n using namespace std;\n int main()\n {\n     int d,b,flag=1,c,n=0,s,N,m=0;\n    cin>>N>>s;\n     \n    vector<int> vec[301],vec1[301],rvec[301];\n    for(int i=s+1;i<=300;i++)\n    {\n        flag=1;\n        d=i;\n        for(b=2;b<=10;b++)\n        {\n            while(d)\n        {\n            vec[i].push_back(d%b);\n         d=d/b;\n        }\n\n        for(int j=0;j<=vec[i].size()-1;j++)\n        {\n                if(vec[i][j]!=vec[i][vec[i].size()-j-1])\n            {\n                flag=0;\n                break;\n            }\n        }\n        if(flag=1)\n        m++;\n        \n        if(m>=2)\n        break;\n        }\n        if(m<2)\n        continue;\n        n++;\n        cout<<i<<endl;\n        if(n>=N)\n        break;\n    }\n    //转化为B进制\n    //判断是否是回文数（1-300）\n    system(\""pause\"");\n    return 0;\n }",PARTIAL_ACCEPTED,25,708
1517830417331077120,43b8550e52fca4ab08ad60c02ba4df8e01acfeb1184ee9cfff9aee3f89726bfd,2022-04-23 19:39:06,C++,10.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\n#include <cmath>\n#include <vector>\n#include <algorithm>\n using namespace std;\n int main()\n {\n     int d,b,flag=1,c,n=0,s,N,m=0;\n    cin>>N>>s;\n     \n    vector<int> vec[301];\n    for(int i=s+1;i<=10000;i++)\n    {\n        flag=1;\n        d=i;\n        for(b=2;b<=10;b++)\n        {\n            while(d)\n        {\n            vec[i].push_back(d%b);\n         d=d/b;\n        }\n\n        for(int j=0;j<=vec[i].size()-1;j++)\n        {\n                if(vec[i][j]!=vec[i][vec[i].size()-j-1])\n            {\n                flag=0;\n                break;\n            }\n        }\n        if(flag=1)\n        m++;\n        \n        if(m>2)\n        break;\n        }\n        if(m<=2)\n        continue;\n        n++;\n        \n        if(n>N)\n        break;\n        cout<<i<<endl;\n    }\n    //转化为B进制\n    //判断是否是回文数（1-300）\n    system(\""pause\"");\n    return 0;\n }",PARTIAL_ACCEPTED,23,712
1517839165173633024,43b8550e52fca4ab08ad60c02ba4df8e01acfeb1184ee9cfff9aee3f89726bfd,2022-04-23 20:13:51,C++,70.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <sstream>\n#include <string>\n#include <cmath>\nusing namespace std;\nint hw(int s)\n{\n    int ans=0;\n    for(int i=2;i<=10;i++)\n    {\n        if(ans==2) break;\n        int s0=s,j=0;\n        long long x=0;//转换成二进制可能很长 \n        while(s0)\n        {\n            x+=(s0%i)*pow(10,j);\n            s0/=i;\n            j++;\n        }\n        //cout<<x<<endl;\n        stringstream t;\n        string s;\n        t<<x;\n        t>>s;\n        int ls=s.size(),l=0;\n        while(s[l]==s[ls-1-l] && l<=(ls-1)/2)\n        {\n            l++;\n        }\n        l--;\n        if(l==(ls-1)/2) ans++;\n    }\n    return ans;\n}\nint main(){\n    int n,s,num=0;\n    cin>>n>>s;\n    while(num<n)\n    {\n        s++;\n        if(hw(s)==2) \n        {\n            cout<<s<<endl;\n            num++;\n        }\n    }\n    return 0;\n}",ACCEPTED,48,616
1518474805627310080,e1ab65d3c5a5c4852dfb1e167b793837bf2afd2a6d24a59685bf62f5726cb362,2022-04-25 14:19:40,C++,80.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<sstream>\n#include<string>\nusing namespace std;\nbool huiwen(const string& a);\nstring bj(int x, int b);\nint main()\n{\n\tint b;\n\tcin >> b;\n\tfor (int i = 1; i <= 300; i++) {\n\t\tif (huiwen(bj(i * i, b))) {\n\t\t\tcout << bj(i, b) << ' ' << bj(i * i, b) << endl;\n\t\t}\n\t}\n\treturn 0;\n}\n\nbool huiwen(const string& a) {\n\tchar* c = new char[a.size()+1];\n\tint count = a.size();\n\tfor (int i = 0; i < a.size(); i++) {\n\t\tc[i] = a[--count];\n\t}\n\tc[a.size()] = '\\0';\n\tstring b(c);\n\tdelete[]c;\n\treturn (a == b);\n}\n\nstring bj(int x,int b) {\n\tstring a;\n\tstringstream s;\n\tint r;\n\twhile (x > 0) {\n\t\tr = x % b;\n\t\tif (r < 10) {\n\t\t\ts << r;\n\t\t}\n\t\telse if (r >= 10) {\n\t\t\ts << char('A' + r - 10);\n\t\t}\n\t\tx /= b;\n\t}\n\ts >> a;\n\tchar* c = new char[a.size() + 1];\n\tint count = a.size();\n\tfor (int i = 0; i < a.size(); i++) {\n\t\tc[i] = a[--count];\n\t}\n\tc[a.size()] = '\\0';\n\tstring d(c);\n\tdelete[]c;\n\treturn d;\n}\n",ACCEPTED,34,452
1518979870825168896,e1ab65d3c5a5c4852dfb1e167b793837bf2afd2a6d24a59685bf62f5726cb362,2022-04-26 23:46:37,C++,70.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include<sstream>\nusing namespace std;\nstring bjin(int x, int b);\nbool huiwen(string a);\nint main()\n{\n\tint n, s;\n\tcin >> n >> s;\n\tint count = 0;\n\tint x = s + 1;\n\twhile (count < n) {\n\t\tint cnt = 0;\n\t\tfor (int i = 2; i <= 10; i++) {\n\t\t\tif (bjin(x, i)[0] != '0' && huiwen(bjin(x, i)))cnt++;\n\t\t\tif (cnt == 2) {\n\t\t\t\tcount++;\n\t\t\t\tcout << x << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tx++;\n\t}\n\treturn 0;\n}\n\nstring bjin(int x, int b) {\n\tstringstream s;\n\tstring a;\n\twhile (x > 0) {\n\t\ts << x % b;\n\t\tx /= b;\n\t}\n\ts >> a;\n\treturn a;\n}\n\nbool huiwen(const string a) {\n\tstring b = a;\n\tchar t;\n\tfor (int i = 0; i < b.size() / 2; i++) {\n\t\tt = b[b.size() - 1 - i];\n\t\tb[b.size() - 1 - i] = b[i];\n\t\tb[i] = t;\n\t}\n\treturn a == b;\n}",ACCEPTED,77,480
1522482344009711616,9e71d3a2a7648a5ee1ace589eef24fa912866f5e1855a496925b416833f20f28,2022-05-06 15:44:11,Python,0.0,1511526337611964423,1267442030214471680,1049226397448056832,"def huiwen(a):\n\tb=\""\""\n\tfor i in a:\n\t\tb=i+b\n\tif (a==b):\n\t\treturn True\n\telse:\n\t\treturn False\n\n\na=input()\nb=huiwen(a)\nprint(b)\n",WRONG_ANSWER,119,3016
1522782568167030784,9e71d3a2a7648a5ee1ace589eef24fa912866f5e1855a496925b416833f20f28,2022-05-07 11:37:10,C++,0.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include <algorithm>\n#include <math.h>\nusing namespace std;\nbool huiwen(string a);\nstring jinzhi1(int a,int num);\nstring jinzhi2(int a,int num);\nint main()\n{\n\nint a;\ncin>>a;\nint i=0;\nwhile (i<300){\nstring b=jinzhi1(a,i);\nif (huiwen(b)){\n\tstring bb=jinzhi2(a,i);\n\tcout<<bb<<' '<<b<<endl;\n}\ni++;\n}\n}\nbool huiwen(string a){\n    string b=\""\"";\n\tfor(int i;i<a.length();i++){\n\t\tb=a[i]+b;\n\t}\n\tif (a==b){\n\t\treturn true;}\n\telse\n\t\t{return false;}\n\n}\nstring jinzhi1(int a,int num){\n\tnum=num*num;\n\tstring b=\""\"";\n\t//string numm=to_string(num);\n    //int i=numm.length();\n\tchar aa;\n\tint i=0;\n\twhile(num!=0){\n\t\tint v=num%a;\n\t\tif (v-10>=0){\n\t\t\taa='A'+v-10;\n\t\t}\n\t\telse{aa=v+'0';}\n\t\tnum=(num-num%a)/a;\n\t\tb=aa+b;\n\t\t//cout<<aa[i];\n\t\ti=i+1;\n\t}\n\treturn b;\n}\n\nstring jinzhi2(int a,int num){\n\tstring b=\""\"";\n\t//string numm=to_string(num);\n    //int i=numm.length();\n\tchar aa;\n\tint i=0;\n\twhile(num!=0){\n\t\tint v=num%a;\n\t\tif (v-10>=0){\n\t\t\taa='A'+v-10;\n\t\t}\n\t\telse{aa=v+'0';}\n\t\tnum=(num-num%a)/a;\n\t\tb=aa+b;\n\t\t//cout<<aa[i];\n\t\ti=i+1;\n\t}\n\treturn b;\n}",PRESENTATION_ERROR,36,476
1522784024777494528,9e71d3a2a7648a5ee1ace589eef24fa912866f5e1855a496925b416833f20f28,2022-05-07 11:42:58,C++,80.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include <algorithm>\n#include <math.h>\nusing namespace std;\n\nstring jinzhi1(int a,int num);\nstring jinzhi2(int a,int num);\nstring jinzhi3(int a,int num);\nint main()\n{\n\nint a;\ncin>>a;\n\nint i=1;\nwhile (i<300){\nstring b=jinzhi1(a,i);\nstring bbb=jinzhi3(a,i);\nif (b==bbb){\n\tstring bb=jinzhi2(a,i);\n\tcout<<bb<<' '<<b<<endl;\n}\ni++;\n}\n}\n\nstring jinzhi1(int a,int num){\n\tnum=num*num;\n\tstring b=\""\"";\n\t//string numm=to_string(num);\n    //int i=numm.length();\n\tchar aa;\n\tint i=0;\n\twhile(num!=0){\n\t\tint v=num%a;\n\t\tif (v-10>=0){\n\t\t\taa='A'+v-10;\n\t\t}\n\t\telse{aa=v+'0';}\n\t\tnum=(num-num%a)/a;\n\t\tb=aa+b;\n\t\t//cout<<aa[i];\n\t\ti=i+1;\n\t}\n\treturn b;\n}\n\nstring jinzhi3(int a,int num){\n\tnum=num*num;\n\tstring b=\""\"";\n\t//string numm=to_string(num);\n    //int i=numm.length();\n\tchar aa;\n\tint i=0;\n\twhile(num!=0){\n\t\tint v=num%a;\n\t\tif (v-10>=0){\n\t\t\taa='A'+v-10;\n\t\t}\n\t\telse{aa=v+'0';}\n\t\tnum=(num-num%a)/a;\n\t\tb=b+aa;\n\t\t//cout<<aa[i];\n\t\ti=i+1;\n\t}\n\treturn b;\n}\n\nstring jinzhi2(int a,int num){\n\tstring b=\""\"";\n\t//string numm=to_string(num);\n    //int i=numm.length();\n\tchar aa;\n\tint i=0;\n\twhile(num!=0){\n\t\tint v=num%a;\n\t\tif (v-10>=0){\n\t\t\taa='A'+v-10;\n\t\t}\n\t\telse{aa=v+'0';}\n\t\tnum=(num-num%a)/a;\n\t\tb=aa+b;\n\t\t//cout<<aa[i];\n\t\ti=i+1;\n\t}\n\treturn b;\n}",ACCEPTED,31,452
1522784244038938624,9e71d3a2a7648a5ee1ace589eef24fa912866f5e1855a496925b416833f20f28,2022-05-07 11:43:50,C++,80.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include <algorithm>\n#include <math.h>\nusing namespace std;\n\nstring jinzhi1(int a,int num);\nstring jinzhi2(int a,int num);\nstring jinzhi3(int a,int num);\n//jingzhi1和jingzhi3互为reverse\nint main()\n{\n\nint a;\ncin>>a;\n\nint i=1;\nwhile (i<300){\nstring b=jinzhi1(a,i);\nstring bbb=jinzhi3(a,i);\nif (b==bbb){\n\tstring bb=jinzhi2(a,i);\n\tcout<<bb<<' '<<b<<endl;\n}\ni++;\n}\n}\n\nstring jinzhi1(int a,int num){\n\tnum=num*num;\n\tstring b=\""\"";\n\t//string numm=to_string(num);\n    //int i=numm.length();\n\tchar aa;\n\tint i=0;\n\twhile(num!=0){\n\t\tint v=num%a;\n\t\tif (v-10>=0){\n\t\t\taa='A'+v-10;\n\t\t}\n\t\telse{aa=v+'0';}\n\t\tnum=(num-num%a)/a;\n\t\tb=aa+b;\n\t\t//cout<<aa[i];\n\t\ti=i+1;\n\t}\n\treturn b;\n}\n\nstring jinzhi3(int a,int num){\n\tnum=num*num;\n\tstring b=\""\"";\n\t//string numm=to_string(num);\n    //int i=numm.length();\n\tchar aa;\n\tint i=0;\n\twhile(num!=0){\n\t\tint v=num%a;\n\t\tif (v-10>=0){\n\t\t\taa='A'+v-10;\n\t\t}\n\t\telse{aa=v+'0';}\n\t\tnum=(num-num%a)/a;\n\t\tb=b+aa;\n\t\t//cout<<aa[i];\n\t\ti=i+1;\n\t}\n\treturn b;\n}\n\nstring jinzhi2(int a,int num){\n\tstring b=\""\"";\n\t//string numm=to_string(num);\n    //int i=numm.length();\n\tchar aa;\n\tint i=0;\n\twhile(num!=0){\n\t\tint v=num%a;\n\t\tif (v-10>=0){\n\t\t\taa='A'+v-10;\n\t\t}\n\t\telse{aa=v+'0';}\n\t\tnum=(num-num%a)/a;\n\t\tb=aa+b;\n\t\t//cout<<aa[i];\n\t\ti=i+1;\n\t}\n\treturn b;\n}",ACCEPTED,25,452
1522788863821512704,9e71d3a2a7648a5ee1ace589eef24fa912866f5e1855a496925b416833f20f28,2022-05-07 12:02:11,C++,0.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include <algorithm>\n#include <math.h>\nusing namespace std;\n\nstring jinzhi1(int a,int num);\nstring jinzhi2(int a,int num);\n\nint main()\n{\nint N,S;\ncin>>N;\ncin>>S;\nint i=1;\nint num=S;\nint huiwen=0,zongshu=0;\nwhile(zongshu<=N){\nnum=num+1;\nwhile(i<=10){\n    if(jinzhi1(i,num)==jinzhi2(i,num)){\n\t\thuiwen=huiwen+1;\n\t}\n}\nif(huiwen>=2){\n\tcout<<num<<endl;\n\tzongshu++;\n}\n}\n}\n\n\n\n\nstring jinzhi1(int a,int num){\n\tstring b=\""\"";\n\t//string numm=to_string(num);\n    //int i=numm.length();\n\tchar aa;\n\tint i=0;\n\twhile(num!=0){\n\t\tint v=num%a;\n\t\tif (v-10>=0){\n\t\t\taa='A'+v-10;\n\t\t}\n\t\telse{aa=v+'0';}\n\t\tnum=(num-num%a)/a;\n\t\tb=b+aa;\n\t\t//cout<<aa[i];\n\t\ti=i+1;\n\t}\n\treturn b;\n}\nstring jinzhi2(int a,int num){\n\tstring b=\""\"";\n\t//string numm=to_string(num);\n    //int i=numm.length();\n\tchar aa;\n\tint i=0;\n\twhile(num!=0){\n\t\tint v=num%a;\n\t\tif (v-10>=0){\n\t\t\taa='A'+v-10;\n\t\t}\n\t\telse{aa=v+'0';}\n\t\tnum=(num-num%a)/a;\n\t\tb=aa+b;\n\t\t//cout<<aa[i];\n\t\ti=i+1;\n\t}\n\treturn b;\n}",TIME_LIMIT_EXCEEDED,2800,768
1522789729345503232,9e71d3a2a7648a5ee1ace589eef24fa912866f5e1855a496925b416833f20f28,2022-05-07 12:05:38,C++,0.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include <algorithm>\n#include <math.h>\nusing namespace std;\n\nstring jinzhi1(int a,int num);\nstring jinzhi2(int a,int num);\n\nint main()\n{\nint N,S;\ncin>>N;\ncin>>S;\nint i=2;\nint num=S;\nint huiwen=0,zongshu=0;\nwhile(zongshu<=N){\nnum=num+1;\nwhile(i<=10){\n    if(jinzhi1(i,num)==jinzhi2(i,num)){\n\t\thuiwen=huiwen+1;\n\t}\n\ti++;\n}\nif(huiwen>=2){\n\tcout<<num<<endl;\n\tzongshu++;\n}\n}\n}\n\n\n\n\nstring jinzhi1(int a,int num){\n\tstring b=\""\"";\n\t//string numm=to_string(num);\n    //int i=numm.length();\n\tchar aa;\n\tint i=0;\n\twhile(num!=0){\n\t\tint v=num%a;\n\t\tif (v-10>=0){\n\t\t\taa='A'+v-10;\n\t\t}\n\t\telse{aa=v+'0';}\n\t\tnum=(num-num%a)/a;\n\t\tb=b+aa;\n\t\t//cout<<aa[i];\n\t\ti=i+1;\n\t}\n\treturn b;\n}\nstring jinzhi2(int a,int num){\n\tstring b=\""\"";\n\t//string numm=to_string(num);\n    //int i=numm.length();\n\tchar aa;\n\tint i=0;\n\twhile(num!=0){\n\t\tint v=num%a;\n\t\tif (v-10>=0){\n\t\t\taa='A'+v-10;\n\t\t}\n\t\telse{aa=v+'0';}\n\t\tnum=(num-num%a)/a;\n\t\tb=aa+b;\n\t\t//cout<<aa[i];\n\t\ti=i+1;\n\t}\n\treturn b;\n}",MULTIPLE_ERROR,2009,456
1522789867388452864,9e71d3a2a7648a5ee1ace589eef24fa912866f5e1855a496925b416833f20f28,2022-05-07 12:06:11,C++,10.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include <algorithm>\n#include <math.h>\nusing namespace std;\n\nstring jinzhi1(int a,int num);\nstring jinzhi2(int a,int num);\n\nint main()\n{\nint N,S;\ncin>>N;\ncin>>S;\nint i=2;\nint num=S;\nint huiwen=0,zongshu=0;\nwhile(zongshu<N){\nnum=num+1;\nwhile(i<=10){\n    if(jinzhi1(i,num)==jinzhi2(i,num)){\n\t\thuiwen=huiwen+1;\n\t}\n\ti++;\n}\nif(huiwen>=2){\n\tcout<<num<<endl;\n\tzongshu++;\n}\n}\n}\n\n\n\n\nstring jinzhi1(int a,int num){\n\tstring b=\""\"";\n\t//string numm=to_string(num);\n    //int i=numm.length();\n\tchar aa;\n\tint i=0;\n\twhile(num!=0){\n\t\tint v=num%a;\n\t\tif (v-10>=0){\n\t\t\taa='A'+v-10;\n\t\t}\n\t\telse{aa=v+'0';}\n\t\tnum=(num-num%a)/a;\n\t\tb=b+aa;\n\t\t//cout<<aa[i];\n\t\ti=i+1;\n\t}\n\treturn b;\n}\nstring jinzhi2(int a,int num){\n\tstring b=\""\"";\n\t//string numm=to_string(num);\n    //int i=numm.length();\n\tchar aa;\n\tint i=0;\n\twhile(num!=0){\n\t\tint v=num%a;\n\t\tif (v-10>=0){\n\t\t\taa='A'+v-10;\n\t\t}\n\t\telse{aa=v+'0';}\n\t\tnum=(num-num%a)/a;\n\t\tb=aa+b;\n\t\t//cout<<aa[i];\n\t\ti=i+1;\n\t}\n\treturn b;\n}",PARTIAL_ACCEPTED,2009,564
1522791030527672320,9e71d3a2a7648a5ee1ace589eef24fa912866f5e1855a496925b416833f20f28,2022-05-07 12:10:48,C++,10.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include <algorithm>\n#include <math.h>\nusing namespace std;\n\nstring jinzhi1(int a,int num);\nstring jinzhi2(int a,int num);\n\nint main()\n{\nint N,S;\ncin>>N;\ncin>>S;\nint i=2;\nint num=S;\nint huiwen=0,zongshu=0;\nwhile(zongshu<N){\nnum=num+1;\ni=2;\nwhile(i<=10){\n    if(jinzhi1(i,num)==jinzhi2(i,num)){\n\t\thuiwen=huiwen+1;\n\t}\n\ti++;\n}\nif(huiwen>=2){\n\tcout<<num<<endl;\n\tzongshu++;\n}\n}\n}\n\n\n\n\nstring jinzhi1(int a,int num){\n\tstring b=\""\"";\n\t//string numm=to_string(num);\n    //int i=numm.length();\n\tchar aa;\n\tint i=0;\n\twhile(num!=0){\n\t\tint v=num%a;\n\t\tif (v-10>=0){\n\t\t\taa='A'+v-10;\n\t\t}\n\t\telse{aa=v+'0';}\n\t\tnum=(num-num%a)/a;\n\t\tb=b+aa;\n\t\t//cout<<aa[i];\n\t\ti=i+1;\n\t}\n\treturn b;\n}\nstring jinzhi2(int a,int num){\n\tstring b=\""\"";\n\t//string numm=to_string(num);\n    //int i=numm.length();\n\tchar aa;\n\tint i=0;\n\twhile(num!=0){\n\t\tint v=num%a;\n\t\tif (v-10>=0){\n\t\t\taa='A'+v-10;\n\t\t}\n\t\telse{aa=v+'0';}\n\t\tnum=(num-num%a)/a;\n\t\tb=aa+b;\n\t\t//cout<<aa[i];\n\t\ti=i+1;\n\t}\n\treturn b;\n}",PARTIAL_ACCEPTED,24,452
1522791871607246848,9e71d3a2a7648a5ee1ace589eef24fa912866f5e1855a496925b416833f20f28,2022-05-07 12:14:08,C++,70.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\n#include <algorithm>\n#include <math.h>\nusing namespace std;\n\nstring jinzhi1(int a,int num);\nstring jinzhi2(int a,int num);\n\nint main()\n{\nint N,S;\ncin>>N;\ncin>>S;\nint i=2;\nint num=S;\nint huiwen=0,zongshu=0;\nwhile(zongshu<N){\nnum=num+1;\nhuiwen=0;\ni=2;\nwhile(i<=10){\n\tstring b=jinzhi1(i,num);\n\tstring bb=jinzhi2(i,num);\n    if(b==bb){\n\t\thuiwen=huiwen+1;\n\t}\n\ti++;\n}\nif(huiwen>=2){\n\tcout<<num<<endl;\n\tzongshu++;\n}\n}\n}\n\n\n\n\nstring jinzhi1(int a,int num){\n\tstring b=\""\"";\n\t//string numm=to_string(num);\n    //int i=numm.length();\n\tchar aa;\n\tint i=0;\n\twhile(num!=0){\n\t\tint v=num%a;\n\t\tif (v-10>=0){\n\t\t\taa='A'+v-10;\n\t\t}\n\t\telse{aa=v+'0';}\n\t\tnum=(num-num%a)/a;\n\t\tb=b+aa;\n\t\t//cout<<aa[i];\n\t\ti=i+1;\n\t}\n\treturn b;\n}\nstring jinzhi2(int a,int num){\n\tstring b=\""\"";\n\t//string numm=to_string(num);\n    //int i=numm.length();\n\tchar aa;\n\tint i=0;\n\twhile(num!=0){\n\t\tint v=num%a;\n\t\tif (v-10>=0){\n\t\t\taa='A'+v-10;\n\t\t}\n\t\telse{aa=v+'0';}\n\t\tnum=(num-num%a)/a;\n\t\tb=aa+b;\n\t\t//cout<<aa[i];\n\t\ti=i+1;\n\t}\n\treturn b;\n}",ACCEPTED,36,640
1523222772275253248,bbd2078a7698560e8d7d13262afacb38c972714e6dfb834f70d18a859b4b7f17,2022-05-08 16:46:23,C++,50.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include <stdio.h>\n#include <iostream>\n\nusing namespace std;\n\nint fun(int n, int x)\n{\n\tint i = 0, m = x * x, j, a[100], b[100], k = 0;\n\twhile (x != 0)\n\t{\n\t\tb[k++] = x % n;\n\t\tx = x / n;\n\t}\n\twhile (m != 0) {\n\t\ta[i++] = m % n;\n\t\tm = m / n;\n\t}\n\tfor (j = 0; j < i / 2; j++)\n\t{\n\t\tif (a[j] != a[i - j - 1])\n\t\t\treturn 0;\n\t}\n\tfor (j = k - 1; j > 0; j--)\n\t\tcout << b[j];\n\tprintf(\""%d \"", b[j]);\n\tfor (j = 0; j < i - 1; j++)\n\t\tcout << a[j];\n\tprintf(\""%d\\n\"", a[j]);\n}\n\nint main()\n{\n\tint n, i;\n\tcin >> n;\n\tfor (i = 1; i <= 300; i++)\n\t\tfun(n, i);\n\n\treturn 0;\n}",PARTIAL_ACCEPTED,31,588
1523222825802960896,bbd2078a7698560e8d7d13262afacb38c972714e6dfb834f70d18a859b4b7f17,2022-05-08 16:46:36,C++,0.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<stdio.h>\nint fun1(int n,int x){\n\tint i=0,m=x*x,j,a[100],b[100],k=0;\n\twhile(x!=0){\n\t\tb[k++]=x%n;\n\t\tx=x/n;\n\t}\n\twhile(m!=0){\n\t\ta[i++]=m%n;\n\t\tm=m/n;\n\t}\n\tfor(j=0;j<i/2;j++){\n\t\tif(a[j]!=a[i-j-1]) return 0;\n\t}\n\tfor(j=k-1;j>0;j--)\n\t    printf(\""%d\"",b[j]);\n\tprintf(\""%d \"",b[j]);\n\tfor(j=0;j<i-1;j++)\n\t    printf(\""%d\"",a[j]);\n\tprintf(\""%d\\n\"",a[j]);\n}\nint main(){\n\tint n,i;\n\tscanf(\""%d\"",&n);\n\tfor(i=1;i<=300;i++){\n\t\tfun1(n,i);\n\t}\n}\n \n————————————————\n版权声明：本文为CSDN博主「小丫么小垃圾」的原创文章，遵循CC 4.0 BY-SA版权协议，转载请附上原文出处链接及本声明。\n原文链接：https://blog.csdn.net/A_I_Q/article/details/82663337",COMPILE_ERROR,0,0
1523222890470752256,bbd2078a7698560e8d7d13262afacb38c972714e6dfb834f70d18a859b4b7f17,2022-05-08 16:46:51,C++,0.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<stdio.h>\nint fun1(int n,int x){\n\tint i=0,m=x*x,j,a[100],b[100],k=0;\n\twhile(x!=0){\n\t\tb[k++]=x%n;\n\t\tx=x/n;\n\t}\n\twhile(m!=0){\n\t\ta[i++]=m%n;\n\t\tm=m/n;\n\t}\n\tfor(j=0;j<i/2;j++){\n\t\tif(a[j]!=a[i-j-1]) return 0;\n\t}\n\tfor(j=k-1;j>0;j--)\n\t    printf(\""%d\"",b[j]);\n\tprintf(\""%d \"",b[j]);\n\tfor(j=0;j<i-1;j++)\n\t    printf(\""%d\"",a[j]);\n\tprintf(\""%d\\n\"",a[j]);\n}\nint main(){\n\tint n,i;\n\tscanf_s(\""%d\"",&n);\n\tfor(i=1;i<=300;i++){\n\t\tfun1(n,i);\n\t}\n}\n \n————————————————\n版权声明：本文为CSDN博主「小丫么小垃圾」的原创文章，遵循CC 4.0 BY-SA版权协议，转载请附上原文出处链接及本声明。\n原文链接：https://blog.csdn.net/A_I_Q/article/details/82663337",COMPILE_ERROR,0,0
1523223077666717696,bbd2078a7698560e8d7d13262afacb38c972714e6dfb834f70d18a859b4b7f17,2022-05-08 16:47:36,C++,50.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include <stdio.h>\n#include <iostream>\n\nusing namespace std;\n\nint fun1(int n, int x)\n{\n\tint i = 0, m = x * x, j, a[100], b[100], k = 0;\n\twhile (x != 0)\n\t{\n\t\tb[k++] = x % n;\n\t\tx = x / n;\n\t}\n\twhile (m != 0) {\n\t\ta[i++] = m % n;\n\t\tm = m / n;\n\t}\n\tfor (j = 0; j < i / 2; j++)\n\t{\n\t\tif (a[j] != a[i - j - 1])\n\t\t\treturn 0;\n\t}\n\tfor (j = k - 1; j > 0; j--)\n\t\tprintf(\""%d\"", b[j]);\n\tprintf(\""%d \"", b[j]);\n\tfor (j = 0; j < i - 1; j++)\n\t\tprintf(\""%d\"", a[j]);\n\tprintf(\""%d\\n\"", a[j]);\n}\n\nint main()\n{\n\tint n, i;\n\tcin >> n;\n\tfor (i = 1; i <= 300; i++)\n\t\tfun1(n, i);\n\n\treturn 0;\n}",PARTIAL_ACCEPTED,25,448
1523223514948075520,bbd2078a7698560e8d7d13262afacb38c972714e6dfb834f70d18a859b4b7f17,2022-05-08 16:49:20,C++,80.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <cstdio>\n\nusing namespace std;\n\nchar m[30] = { '0', '1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\n\nstring Switch(int x, int n)\n{\n    string s = \""\"";\n\n    while (x)\n    {\n        s += m[x % n];\n        x /= n;\n    }\n    reverse(s.begin(), s.end());\n\n    return s;\n}\n\nbool HuiWen(string s)\n{\n    int i = 0;\n    int j = s.size() - 1;\n\n    while (i < j)\n    {\n        if (s[i] != s[j]) return false;\n        i++, j--;\n    }\n\n    return true;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    for (int i = 1; i <= 300; i++)\n    {\n        string num = Switch(i, n);\n        string Pnum = Switch(i * i, n);\n        if (HuiWen(Pnum)) cout << num << \"" \"" << Pnum << endl;\n    }\n\n    return 0;\n}",ACCEPTED,27,476
1523223857740169216,bbd2078a7698560e8d7d13262afacb38c972714e6dfb834f70d18a859b4b7f17,2022-05-08 16:50:42,C++,70.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <string>\n\nusing namespace std;\n\ntypedef long long int LL;\n\nstring change(LL n, LL m)\n{\n    string str;\n\n    if (m <= 10)\n    {\n        while (n)\n        {\n            str += (n % m + '0');\n            n /= m;\n        }\n    }\n    else\n    {\n        while (n)\n        {\n            int x = n % m;\n            if (x >= 10)\n            {\n                x -= 10;\n                str += (x + 'A');\n            }\n            else\n                str += (x + '0');\n            n /= m;\n        }\n    }\n\n    return str;\n}\n\nbool is_Palindromic_Squares(string str)\n{\n    int len = str.size();\n    for (int i = 0; i <= len / 2 - 1; i++)\n    {\n        if (str[i] != str[len - i - 1])\n            return false;\n    }\n\n    return true;\n}\n\nint main()\n{\n    LL n, s;\n    cin >> n >> s;\n    int num = 0;\n    LL i, j;\n    for (i = s + 1; num < n; i++)\n    {\n        int t = 0;\n        for (j = 2; j <= 10; j++)\n        {\n            string str = change(i, j);\n            if (is_Palindromic_Squares(str) == true)\n                t++;\n            if (t == 2)\n            {\n                num++;\n                break;\n            }\n        }\n        if (j <= 10)\n            cout << i << endl;\n    }\n\n    return 0;\n}",ACCEPTED,29,476
1523479657951834112,fcf835a52e905e57e2030ba8f55d45b4ae85926499410586b0aa2521343219f3,2022-05-09 09:47:09,C++,10.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<math.h>\nusing namespace std;\n\nint n;\n\nbool f1(int i)//判断回文数\n{\n\tint x = 0;\n\tint s = i;\n\twhile (s > 0)\n\t{\n\t\tx = x * n + s % n;\n\t\ts = s / n;\n\t}\n\tif (x == i)\n\t\treturn 1;\n\telse\n\t\treturn 0;\n}\n\nint main()\n{\n\tcin >> n;\n\tint i = 1;\n\tint m;\n\twhile (i<=300)\n\t{\n\t\tm = pow(i, 2);\n\t\tif (f1(m))\n\t\t{\n\t\t\tcout << i << \"" \"" << m << endl;\n\t\t\ti++;\n\t\t}\n\t\telse\n\t\t{\n\t\t\ti++;\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,24,456
1523486195575721984,fcf835a52e905e57e2030ba8f55d45b4ae85926499410586b0aa2521343219f3,2022-05-09 10:13:08,C++,0.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<math.h>\n#include<string>\nusing namespace std;\n\nint n;\nstring str;\n\nbool f1(int i)//判断N进制下的回文数\n{\n\tint x = 0;\n\tint s = i;\n\tchar ch;\n\tint w = 0;//获取位数\n\twhile (s)\n\t{\n\t\ts /= 10;\n\t\tw++;\n\t}\n\ts = i;\n\twhile (w--)//进制转换\n\t{\n\t\tif (s % n < 10)\n\t\t{\n\t\t\tch = char(s % n + 48);\n\t\t\tstr += ch;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tch = char(s % n + 55);\n\t\t\tstr += ch;\n\t\t}\n\t\ts /= n;\n\t}\n\tint flag = 1;\n\tfor (int i = 0, j = w - 1;i < w;i++, j--)//判断是否是回文数\n\t{\n\t\tif (str[i] != str[j])\n\t\t\tflag = 0;\n\t}\n\treturn flag;\n}\n\nint main()\n{\n\tcin >> n;\n\tint i = 1;\n\tint m;\n\twhile (i<=300)\n\t{\n\t\tm = pow(i, 2);\n\t\tif (f1(m))\n\t\t{\n\t\t\tcout << i << \"" \"" << str << endl;\n\t\t\ti++;\n\t\t}\n\t\telse\n\t\t{\n\t\t\ti++;\n\t\t}\n\t}\n\treturn 0;\n}",WRONG_ANSWER,40,720
1523499008230731776,fcf835a52e905e57e2030ba8f55d45b4ae85926499410586b0aa2521343219f3,2022-05-09 11:04:03,C++,10.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<math.h>\n#include<string>\nusing namespace std;\n\nint n;\nstring str;\n\nbool f1(int i)//判断N进制下的回文数\n{\n\tint x = 0;\n\tint s = i;\n\tchar ch;\n\tint w = 0;//获取位数\n\twhile (s)\n\t{\n\t\ts /= 10;\n\t\tw++;\n\t}\n\ts = i;\n\tint m = w;\n\twhile (w)//进制转换\n\t{\n\t\tif (s % n < 10)\n\t\t{\n\t\t\tch = char(s % n + 48);\n\t\t\tstr += ch;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tch = char(s % n + 55);\n\t\t\tstr += ch;\n\t\t}\n\t\ts /= n;\n\t\tw--;\n\t}\n\tint flag = 1;\n\tfor (int i = 0, j = m - 1;i < m;i++, j--)//判断是否是回文数\n\t{\n\t\tif (str[i] != str[j])\n\t\t\tflag = 0;\n\t}\n\treturn flag;\n}\n\nint main()\n{\n\tcin >> n;\n\tint i = 1;\n\tint m;\n\twhile (i<=300)\n\t{\n\t\tm = pow(i, 2);\n\t\tif (f1(m))\n\t\t{\n\t\t\tcout << i << \"" \"" << str << endl;\n\t\t\ti++;\n\t\t}\n\t\telse\n\t\t{\n\t\t\ti++;\n\t\t}\n\t\tstr.clear();\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,32,604
1523499484204548096,fcf835a52e905e57e2030ba8f55d45b4ae85926499410586b0aa2521343219f3,2022-05-09 11:05:56,C++,10.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<math.h>\n#include<string>\nusing namespace std;\n\nint n;\nstring str;\n\nbool f1(int i)//判断N进制下的回文数\n{\n\tint x = 0;\n\tint s = i;\n\tchar ch;\n\tint w = 0;//获取位数\n\twhile (s)\n\t{\n\t\ts /= 10;\n\t\tw++;\n\t}\n\ts = i;\n\tint m = w;\n\twhile (w)//进制转换\n\t{\n\t\tif (s % n < 10)\n\t\t{\n\t\t\tch = char(s % n + 48);\n\t\t\tstr += ch;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tch = char(s % n + 55);\n\t\t\tstr += ch;\n\t\t}\n\t\ts /= n;\n\t\tw--;\n\t}\n\tint flag = 1;\n\tfor (int i = 0, j = m - 1;i < m;i++, j--)//判断是否是回文数\n\t{\n\t\tif (str[i] != str[j])\n\t\t\tflag = 0;\n\t}\n\treturn flag;\n}\n\nint main()\n{\n\tcin >> n;\n\tint i = 1;\n\tint m;\n\twhile (i<=300)\n\t{\n\t\tm = pow(i, 2);\n\t\tif (f1(m))\n\t\t{\n\t\t\tcout << i << \"" \"" << str << endl;\n\t\t\ti++;\n\t\t}\n\t\telse\n\t\t{\n\t\t\ti++;\n\t\t}\n\t\tstr.clear();\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,33,456
1523522576083628032,fcf835a52e905e57e2030ba8f55d45b4ae85926499410586b0aa2521343219f3,2022-05-09 12:37:42,C++,10.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<math.h>\n#include<string>\n#include <algorithm>\nusing namespace std;\nstring str;\nint x;\nvoid intToA(int i,int x)    //i是待转数字，x是指定的进制\n{\n    int n,p;\n    n=i;p=i*i;\n string ans=\""\"";\n string sna;\n do{\n  int t=p%x;\n  if(t>=0&&t<=9) ans+=t+'0';\n  else ans+=t-10+'a';\n  p/=x;\n }while(p!=0);\n sna=ans;\n reverse(ans.begin(),ans.end());\n if(ans==sna) cout<<i<<' '<<ans<<endl;\n}\nint main()\n{\n int i;\n cin>>x;\n for(i=1;i<=300;i++)\n       intToA(i,x);\n}",PARTIAL_ACCEPTED,26,456
1523632626101960704,fcf835a52e905e57e2030ba8f55d45b4ae85926499410586b0aa2521343219f3,2022-05-09 19:55:00,C++,10.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<math.h>\n#include<string>\nusing namespace std;\n\nint n;\nstring str;\n\nbool f1(int i)//判断N进制下的回文数\n{\n\tint x = 0;\n\tint s = i;\n\tchar ch;\n\tint w = 0;//获取位数\n\twhile (s)\n\t{\n\t\ts /= 10;\n\t\tw++;\n\t}\n\ts = i;\n\tint m = w;\n\twhile (w)//进制转换\n\t{\n\t\tif (s % n < 10)\n\t\t{\n\t\t\tch = char(s % n + 48);\n\t\t\tstr += ch;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tch = char(s % n + 55);\n\t\t\tstr += ch;\n\t\t}\n\t\ts /= n;\n\t\tw--;\n\t}\n\tint flag = 1;\n\tfor (int i = 0, j = m - 1;i < m;i++, j--)//判断是否是回文数\n\t{\n\t\tif (str[i] != str[j])\n\t\t\tflag = 0;\n\t}\n\treturn flag;\n}\n\nint main()\n{\n\tcin >> n;\n\tint i = 1;\n\tint m;\n\twhile (i<=300)\n\t{\n\t\tm = pow(i, 2);\n\t\tif (f1(m))\n\t\t{\n\t\t\tcout << i << \"" \"" << str << endl;\n\t\t\ti++;\n\t\t}\n\t\telse\n\t\t{\n\t\t\ti++;\n\t\t}\n\t\tstr.clear();\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,34,572
1523634548250816512,fcf835a52e905e57e2030ba8f55d45b4ae85926499410586b0aa2521343219f3,2022-05-09 20:02:38,C++,0.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<math.h>\n#include<string>\nusing namespace std;\n\nint n;\nstring str;\nstring str_2;\n\nbool f1(int i)//判断N进制下的回文数\n{\n\tint x = 0;\n\tint s = i;\n\tchar ch;\n\tint w = 0;//获取位数\n\twhile (s)\n\t{\n\t\ts /= 10;\n\t\tw++;\n\t}\n\ts = i;\n\tint m = w;\n\twhile (w)//进制转换\n\t{\n\t\tif (s % n < 10)\n\t\t{\n\t\t\tch = char(s % n + 48);\n\t\t\tstr += ch;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tch = char(s % n + 55);\n\t\t\tstr += ch;\n\t\t}\n\t\ts /= n;\n\t\tw--;\n\t}\n\tint flag = 1;\n\tfor (int i = 0, j = m - 1;i < m;i++, j--)//判断是否是回文数\n\t{\n\t\tif (str[i] != str[j])\n\t\t\tflag = 0;\n\t}\n\treturn flag;\n}\n\nvoid f2(int i)\n{\n\tint s = i;\n\tchar ch;\n\tint w = 0;//获取位数\n\twhile (s)\n\t{\n\t\ts /= 10;\n\t\tw++;\n\t}\n\ts = i;\n\tint m = w;\n\twhile (w)//进制转换\n\t{\n\t\tif (s % n < 10)\n\t\t{\n\t\t\tch = char(s % n + 48);\n\t\t\tstr_2 += ch;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tch = char(s % n + 55);\n\t\t\tstr_2 += ch;\n\t\t}\n\t\ts /= n;\n\t\tw--;\n\t}\n}\n\nint main()\n{\n\tcin >> n;\n\tint i = 1;\n\tint m;\n\twhile (i<=300)\n\t{\n\t\tm = pow(i, 2);\n\t\tf2(i);\n\t\tif (f1(m))\n\t\t{\n\t\t\tcout << str_2 << \"" \"" << str << endl;\n\t\t\ti++;\n\t\t}\n\t\telse\n\t\t{\n\t\t\ti++;\n\t\t}\n\t\tstr.clear();\n\t\tstr_2.clear();\n\t}\n\treturn 0;\n}",WRONG_ANSWER,37,612
1523635509799206912,fcf835a52e905e57e2030ba8f55d45b4ae85926499410586b0aa2521343219f3,2022-05-09 20:06:27,C++,20.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<math.h>\n#include<string>\nusing namespace std;\n\nint n;\nstring str;\nstring str_2;\n\nbool f1(int i)//判断N进制下的回文数\n{\n\tint x = 0;\n\tint s = i;\n\tchar ch;\n\tint w = 0;//获取位数\n\twhile (s)\n\t{\n\t\ts /= 10;\n\t\tw++;\n\t}\n\ts = i;\n\tint m = w;\n\twhile (w)//进制转换\n\t{\n\t\tif (s % n < 10)\n\t\t{\n\t\t\tch = char(s % n + 48);\n\t\t\tstr += ch;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tch = char(s % n + 55);\n\t\t\tstr += ch;\n\t\t}\n\t\ts /= n;\n\t\tw--;\n\t}\n\tint flag = 1;\n\tfor (int i = 0, j = m - 1;i < m;i++, j--)//判断是否是回文数\n\t{\n\t\tif (str[i] != str[j])\n\t\t\tflag = 0;\n\t}\n\treturn flag;\n}\n\nvoid f2(int i)\n{\n\tint s = i;\n\tchar ch;\n\tint w = 0;//获取位数\n\twhile (s)\n\t{\n\t\ts /= 10;\n\t\tw++;\n\t}\n\ts = i;\n\tint m = w;\n\twhile (w)//进制转换\n\t{\n\t\tif (s % n < 10)\n\t\t{\n\t\t\tch = char(s % n + 48);\n\t\t\tstr_2 += ch;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tch = char(s % n + 55);\n\t\t\tstr_2 += ch;\n\t\t}\n\t\ts /= n;\n\t\tw--;\n\t}\n\tfor (int l = 0;l < m/2;l++)\n\t{\n\t\tint temp = str_2[l];\n\t\tstr_2[l] = str_2[m - l - 1];\n\t\tstr_2[m - l - 1] = temp;\n\t}\n}\n\nint main()\n{\n\tcin >> n;\n\tint i = 1;\n\tint m;\n\twhile (i<=300)\n\t{\n\t\tm = pow(i, 2);\n\t\tf2(i);\n\t\tif (f1(m))\n\t\t{\n\t\t\tcout << str_2 << \"" \"" << str << endl;\n\t\t\ti++;\n\t\t}\n\t\telse\n\t\t{\n\t\t\ti++;\n\t\t}\n\t\tstr.clear();\n\t\tstr_2.clear();\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,39,620
1523646288074162176,fcf835a52e905e57e2030ba8f55d45b4ae85926499410586b0aa2521343219f3,2022-05-09 20:49:17,C++,0.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nbool f1(int s)\n{\n\tint a[1005];\n\tint num = s;\n\tint count = 0;\n\tint m;\n\tfor (m = 2;m <= 10;m++)\n\t{\n\t\tint flag = 1;\n\t\tnum = s;\n\t\tfor (int i = 0;s != 0;i++)\n\t\t{\n\t\t\ta[i] = num % m;\n\t\t\tnum /= m;\n\t\t}\n\t\tfor (int i = 0;i < (sizeof(a) / sizeof(a[0])) / 2;i++)\n\t\t{\n\t\t\tif (a[i] != a[sizeof(a) / sizeof(a[0]) - 1 - i])\n\t\t\t{\n\t\t\t\tflag = 0;\n\t\t\t}\n\t\t}\n\t\tif (flag == 1)\n\t\t\tcount++;\n\t}\n\tif (count >= 2)\n\t\treturn 1;\n\telse\n\t\treturn 0;\n}\n\nint main()\n{\n\tint n, s;\n\tcin >> n >> s;\n\tint count = 0;\n\twhile (n)\n\t{\n\t\tif (f1(n))\n\t\t{\n\t\t\tcout << s << endl;\n\t\t}\n\t\ts++;\n\t\tn--;\n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,37,732
1523692059297366016,fcf835a52e905e57e2030ba8f55d45b4ae85926499410586b0aa2521343219f3,2022-05-09 23:51:10,C++,50.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nbool f1(int s)\n{\n\tint a[1005] = {};\n\tint num = s;\n\tint count = 0;\n\tint m;\n\tfor (m = 2;m <= 10;m++)\n\t{\n\t\tint flag = 1;\n\t\tnum = s;\n\t\tint x = 0;\n\t\tfor (int i = 0;num != 0;i++)\n\t\t{\n\t\t\ta[i] = num % m;\n\t\t\tnum /= m;\n\t\t\tx++;\n\t\t}\n\t\tfor (int i = 0;i < x / 2;i++)\n\t\t{\n\t\t\tif (a[i] != a[x - 1 - i])\n\t\t\t{\n\t\t\t\tflag = 0;\n\t\t\t}\n\t\t}\n\t\tif (flag == 1)\n\t\t\tcount++;\n\t}\n\tif (count >= 2)\n\t\treturn 1;\n\telse\n\t\treturn 0;\n}\n\nint main()\n{\n\tint n, s;\n\tcin >> n >> s;\n\tint count = 0;\n\twhile (n)\n\t{\n\t\tif (f1(s))\n\t\t{\n\t\t\tcout << s << endl;\n\t\t\tn--;\n\t\t}\n\t\ts++;\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,32,620
1523692776087126016,fcf835a52e905e57e2030ba8f55d45b4ae85926499410586b0aa2521343219f3,2022-05-09 23:54:01,C++,0.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nbool f1(int s)\n{\n\tint a[1005] = {};\n\tint num = s;\n\tint count = 0;\n\tint m;\n\tfor (m = 2;m <= 10;m++)\n\t{\n\t\tint flag = 1;\n\t\tnum = s;\n\t\tint x = 0;\n\t\tfor (int i = 0;num != 0;i++)\n\t\t{\n\t\t\ta[i] = num % m;\n\t\t\tnum /= m;\n\t\t\tx++;\n\t\t}\n\t\tfor (int i = 0;i < x / 2;i++)\n\t\t{\n\t\t\tif (i == 0)\n\t\t\t{\n\t\t\t\tif (a[i] == 0 || a[x - 1 - i] == 0)\n\t\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (a[i] != a[x - 1 - i])\n\t\t\t{\n\t\t\t\tflag = 0;\n\t\t\t}\n\t\t}\n\t\tif (flag == 1)\n\t\t\tcount++;\n\t}\n\tif (count >= 2)\n\t\treturn 1;\n\telse\n\t\treturn 0;\n}\n\nint main()\n{\n\tint n, s;\n\tcin >> n >> s;\n\tint count = 0;\n\twhile (n)\n\t{\n\t\tif (f1(s))\n\t\t{\n\t\t\tcout << s << endl;\n\t\t\tn--;\n\t\t}\n\t\ts++;\n\t}\n\treturn 0;\n}",WRONG_ANSWER,21,476
1523693614310395904,fcf835a52e905e57e2030ba8f55d45b4ae85926499410586b0aa2521343219f3,2022-05-09 23:57:21,C++,50.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nbool f1(int s)\n{\n\tint a[1005] = {};\n\tint num = s;\n\tint count = 0;\n\tint m;\n\tfor (m = 2;m <= 10;m++)\n\t{\n\t\tint flag = 1;\n\t\tnum = s;\n\t\tint x = 0;\n\t\tfor (int i = 0;num != 0;i++)\n\t\t{\n\t\t\ta[i] = num % m;\n\t\t\tnum /= m;\n\t\t\tx++;\n\t\t}\n\t\tfor (int i = 0;i < x / 2;i++)\n\t\t{\n\t\t\tif (i == 0)\n\t\t\t{\n\t\t\t\tif (a[i] == 0 || a[x - 1 - i] == 0)\n\t\t\t\t\tflag = 0;\n\t\t\t}\n\t\t\tif (a[i] != a[x - 1 - i])\n\t\t\t{\n\t\t\t\tflag = 0;\n\t\t\t}\n\t\t}\n\t\tif (flag == 1)\n\t\t\tcount++;\n\t}\n\tif (count >= 2)\n\t\treturn 1;\n\telse\n\t\treturn 0;\n}\n\nint main()\n{\n\tint n, s;\n\tcin >> n >> s;\n\tint count = 0;\n\twhile (n)\n\t{\n\t\tif (f1(s))\n\t\t{\n\t\t\tcout << s << endl;\n\t\t\tn--;\n\t\t}\n\t\ts++;\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,27,604
1523693935069790208,fcf835a52e905e57e2030ba8f55d45b4ae85926499410586b0aa2521343219f3,2022-05-09 23:58:37,C++,0.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nbool f1(int s)\n{\n\tint a[1005] = {};\n\tint num = s;\n\tint count = 0;\n\tint m;\n\tfor (m = 2;m <= 10;m++)\n\t{\n\t\tint flag = 1;\n\t\tnum = s;\n\t\tint x = 0;\n\t\tfor (int i = 0;num != 0;i++)\n\t\t{\n\t\t\ta[i] = num % m;\n\t\t\tnum /= m;\n\t\t\tx++;\n\t\t}\n\t\tfor (int i = 0;i < x / 2;i++)\n\t\t{\n\t\t\tif (i == 0)\n\t\t\t{\n\t\t\t\tif (a[i] == 0 || a[x - 1 - i] == 0)\n\t\t\t\t\tflag = 0;\n\t\t\t}\n\t\t\tif (a[i] != a[x - 1 - i])\n\t\t\t{\n\t\t\t\tflag = 0;\n\t\t\t}\n\t\t}\n\t\tif (flag == 1)\n\t\t\tcount++;\n\t}\n\tif (count > 2)\n\t\treturn 1;\n\telse\n\t\treturn 0;\n}\n\nint main()\n{\n\tint n, s;\n\tcin >> n >> s;\n\tint count = 0;\n\twhile (n)\n\t{\n\t\tif (f1(s))\n\t\t{\n\t\t\tcout << s << endl;\n\t\t\tn--;\n\t\t}\n\t\ts++;\n\t}\n\treturn 0;\n}",WRONG_ANSWER,269,448
1523694509949485056,fcf835a52e905e57e2030ba8f55d45b4ae85926499410586b0aa2521343219f3,2022-05-10 00:00:54,C++,70.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nbool f1(int s)\n{\n\tint a[1005] = {};\n\tint num = s;\n\tint count = 0;\n\tint m;\n\tfor (m = 2;m <= 10;m++)\n\t{\n\t\tint flag = 1;\n\t\tnum = s;\n\t\tint x = 0;\n\t\tfor (int i = 0;num != 0;i++)\n\t\t{\n\t\t\ta[i] = num % m;\n\t\t\tnum /= m;\n\t\t\tx++;\n\t\t}\n\t\tfor (int i = 0;i < x / 2;i++)\n\t\t{\n\t\t\tif (i == 0)\n\t\t\t{\n\t\t\t\tif (a[i] == 0 || a[x - 1 - i] == 0)\n\t\t\t\t\tflag = 0;\n\t\t\t}\n\t\t\tif (a[i] != a[x - 1 - i])\n\t\t\t{\n\t\t\t\tflag = 0;\n\t\t\t}\n\t\t}\n\t\tif (flag == 1)\n\t\t\tcount++;\n\t}\n\tif (count >= 2)\n\t\treturn 1;\n\telse\n\t\treturn 0;\n}\n\nint main()\n{\n\tint n, s;\n\tcin >> n >> s;\n\tint count = 0;\n\ts++;\n\twhile (n)\n\t{\n\t\tif (f1(s))\n\t\t{\n\t\t\tcout << s << endl;\n\t\t\tn--;\n\t\t}\n\t\ts++;\n\t}\n\treturn 0;\n}",ACCEPTED,26,604
1523838535138840576,7ae224cd50398765f6e55db30ef19eca6aa02c9f2121ef365a2cbeb1d4ea7da5,2022-05-10 09:33:12,C++,80.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cstdio>\n#include <algorithm>\n#include <cmath>\n#include <cstring>\nusing namespace std;\ntypedef long long ll;\nchar aa[100];\nchar bb[100];\nll yang2()\n{\n    ll n=strlen(aa);\n    ll i,ans=0;\n    for(i=0;i<n/2;i++)\n    {\n        if(aa[i]==aa[n-i-1])\n            ans++;\n    }\n    if(ans>=n/2)\n        return 1;\n    else\n        return 0;\n}\nll yang(ll n,ll a)\n{\n    ll m;\n    memset(aa,0,sizeof(aa));\n    ll i=0;\n    while(n)\n    {\n        if(n%a>=10)\n            aa[i]=char('A'+(n%a-10));\n        else\n           aa[i]=n%a+48;\n        n/=a;\n        i++;\n    }\n    aa[i]=0;\n    ll ans=yang2();\n    if(ans==1)\n        return 1;\n    else\n        return 0;\n}\nll yang4()\n{\n    ll n=strlen(bb);\n    ll i;\n    char t;\n    for(i=0;i<n/2;i++)\n    {\n        t=bb[i];\n        bb[i]=bb[n-i-1];\n        bb[n-i-1]=t;\n    }\n}\nll yang3(ll n,ll a)\n{\n    ll m;\n    memset(bb,0,sizeof(bb));\n    ll i=0;\n    while(n)\n    {\n        if(n%a>=10)\n            bb[i]=char('A'+(n%a-10));\n        else\n           bb[i]=n%a+48;\n        n/=a;\n        i++;\n    }\n    bb[i]=0;\n    yang4();\n}\nint main()\n{\n    ll n,i,j,b;\n    cin>>b;\n    for(i=1;i<=300;i++)\n    {\n        ll ans=yang(i*i,b);\n        if(ans==1)\n        {\n            yang3(i,b);\n            cout<<bb<<\"" \""<<aa<<endl;\n        }\n \n    }\n    return 0;\n}\n",ACCEPTED,35,640
1523839492698451968,7ae224cd50398765f6e55db30ef19eca6aa02c9f2121ef365a2cbeb1d4ea7da5,2022-05-10 09:37:01,C++,0.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cstdio>\n#include <algorithm>\n#include <cmath>\n#include <cstring>\nusing namespace std;\ntypedef long long ll;\nchar aa[100];\nchar bb[100];\nll yang(ll n,ll a)\n{\n    ll m;\n    memset(aa,0,sizeof(aa));\n    ll i=0;\n    while(n)\n    {\n        if(n%a>=10)\n            aa[i]=char('A'+(n%a-10));\n        else\n           aa[i]=n%a+48;\n        n/=a;\n        i++;\n    }\n    aa[i]=0;\n    ll ans=yang2();\n    if(ans==1)\n        return 1;\n    else\n        return 0;\n}\nll yang2()\n{\n    ll n=strlen(aa);\n    ll i,ans=0;\n    for(i=0;i<n/2;i++)\n    {\n        if(aa[i]==aa[n-i-1])\n            ans++;\n    }\n    if(ans>=n/2)\n        return 1;\n    else\n        return 0;\n}\nll yang3(ll n,ll a)\n{\n    ll m;\n    memset(bb,0,sizeof(bb));\n    ll i=0;\n    while(n)\n    {\n        if(n%a>=10)\n            bb[i]=char('A'+(n%a-10));\n        else\n           bb[i]=n%a+48;\n        n/=a;\n        i++;\n    }\n    bb[i]=0;\n    yang4();\n}\nll yang4()\n{\n    ll n=strlen(bb);\n    ll i;\n    char t;\n    for(i=0;i<n/2;i++)\n    {\n        t=bb[i];\n        bb[i]=bb[n-i-1];\n        bb[n-i-1]=t;\n    }\n}\nint main()\n{\n    ll n,i,j,b;\n    cin>>b;\n    for(i=1;i<=300;i++)\n    {\n        ll ans=yang(i*i,b);\n        if(ans==1)\n        {\n            yang3(i,b);\n            cout<<bb<<\"" \""<<aa<<endl;\n        }\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1523839711779532800,7ae224cd50398765f6e55db30ef19eca6aa02c9f2121ef365a2cbeb1d4ea7da5,2022-05-10 09:37:53,C++,80.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cstdio>\n#include <algorithm>\n#include <cmath>\n#include <cstring>\nusing namespace std;\ntypedef long long ll;\nchar aa[100];\nchar bb[100];\nll yang(ll n,ll a);\nll yang2();\nll yang3(ll n,ll a);\nll yang4();\nll yang(ll n,ll a)\n{\n    ll m;\n    memset(aa,0,sizeof(aa));\n    ll i=0;\n    while(n)\n    {\n        if(n%a>=10)\n            aa[i]=char('A'+(n%a-10));\n        else\n           aa[i]=n%a+48;\n        n/=a;\n        i++;\n    }\n    aa[i]=0;\n    ll ans=yang2();\n    if(ans==1)\n        return 1;\n    else\n        return 0;\n}\nll yang2()\n{\n    ll n=strlen(aa);\n    ll i,ans=0;\n    for(i=0;i<n/2;i++)\n    {\n        if(aa[i]==aa[n-i-1])\n            ans++;\n    }\n    if(ans>=n/2)\n        return 1;\n    else\n        return 0;\n}\nll yang3(ll n,ll a)\n{\n    ll m;\n    memset(bb,0,sizeof(bb));\n    ll i=0;\n    while(n)\n    {\n        if(n%a>=10)\n            bb[i]=char('A'+(n%a-10));\n        else\n           bb[i]=n%a+48;\n        n/=a;\n        i++;\n    }\n    bb[i]=0;\n    yang4();\n}\nll yang4()\n{\n    ll n=strlen(bb);\n    ll i;\n    char t;\n    for(i=0;i<n/2;i++)\n    {\n        t=bb[i];\n        bb[i]=bb[n-i-1];\n        bb[n-i-1]=t;\n    }\n}\nint main()\n{\n    ll n,i,j,b;\n    cin>>b;\n    for(i=1;i<=300;i++)\n    {\n        ll ans=yang(i*i,b);\n        if(ans==1)\n        {\n            yang3(i,b);\n            cout<<bb<<\"" \""<<aa<<endl;\n        }\n    }\n    return 0;\n}\n",ACCEPTED,35,596
1523845768102850560,7ae224cd50398765f6e55db30ef19eca6aa02c9f2121ef365a2cbeb1d4ea7da5,2022-05-10 10:01:57,C++,70.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <stdio.h>\nusing namespace std;\nint fun(int n, int x)\n{\n    int len = 0, j;\n    int a[35];\n    while (n)\n    {\n        a[len++] = n % x;\n        n /= x;\n    }\n    for (j = 0; j < len / 2; j++)\n    {\n        if (a[j] == a[len - 1 - j])\n            continue;\n        else\n            return 0;\n    }\n    return 1;\n}\nint main()\n{\n    int f, k = 0, s;\n    cin >> f >> s;\n    while (k < f)\n    {\n        int m = 0;\n        s += 1;\n        for (int i = 2; i <= 10; i++)\n        {\n            if (fun(s, i))\n            {\n                m++;\n            }\n        }\n        if (m >= 2)\n        {\n            cout << s << endl;\n            k++;\n        }\n    }\n    return 0;\n}\n",ACCEPTED,25,584
1523850131823181824,7ae224cd50398765f6e55db30ef19eca6aa02c9f2121ef365a2cbeb1d4ea7da5,2022-05-10 10:19:17,C++,70.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nint fun(int n, int x)\n{\n    int len = 0, j;\n    int a[35];\n    while (n)\n    {\n        a[len++] = n % x;\n        n /= x;\n    }\n    for (j = 0; j < len / 2; j++)\n    {\n        if (a[j] == a[len - 1 - j])\n            continue;\n        else\n            return 0;\n    }\n    return 1;\n}\nint main()\n{\n    int f, k = 0, s;\n    cin >> f >> s;\n    while (k < f)\n    {\n        int m = 0;\n        s += 1;\n        for (int i = 2; i <= 10; i++)\n        {\n            if (fun(s, i))\n            {\n                m++;\n            }\n        }\n        if (m >= 2)\n        {\n            cout << s << endl;\n            k++;\n        }\n    }\n    return 0;\n}\n",ACCEPTED,29,504
1524027847675527168,9872320d018cd57ca35a1d90b282472df95f89da8e8b2954c9366cdfec1d68cd,2022-05-10 22:05:28,C++,80.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<iostream>\nusing namespace std;\n\nint n;\nint fun(int num,char c[20])\n{\n    num*=num;\n    char a[1000];\n    int i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    int flag=1;\n    for(int j=1;j<=i/2;j++)\n    {\n        if(a[j]!=a[i-j+1])\n        {\n            flag=0;\n            break;\n        }\n    }\n    return flag;\n}\n \nvoid print(int num,char c[20])\n{\n    int temp=num;\n    char a[1000];\n    int i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    for(;i>=1;i--)\n        printf(\""%c\"",a[i]);\n    printf(\"" \"");\n    num=temp*temp;\n    i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    for(;i>=1;i--)\n        printf(\""%c\"",a[i]);\n    printf(\""\\n\"");\n}\n \nint main()\n{\n\tchar c[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\n\tscanf(\""%d\"",&n);\n    for(int i=1;i<=300;i++)\n    {\n\t\tif(fun(i,c)==1)\n        print(i,c);\n    }\n    return 0;\n}",ACCEPTED,33,468
1524237767721136128,9872320d018cd57ca35a1d90b282472df95f89da8e8b2954c9366cdfec1d68cd,2022-05-11 11:59:37,C++,0.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nint mi(int x)\n{\n\tint y=1;\n\tfor(int i=0;i<=x-1;i++)\n\t{\n\t\ty*=10;\n\t}\n\treturn y;\n}\nint trans(int num,int k)\n{\n\tint result=0;\n\tint a[20];\n\tint temp=num;\n\tint i;\n\tfor(i=0;temp>0;i++)\n\t{\n\t\ta[i]=temp%k;\n\t\ttemp=(temp-a[i])/k;\n\t}\n\tfor(int j=i-1;j>=0;j--)\n\t{\n\t\tresult+=a[j]*mi(j);\n\t}\n\treturn result;\n}\nint judge(int result)\n{\n\tint b[20];\n\tint temp=result;\n\tint t=0;\n\tint i;\n\tfor(i=0;temp>0;i++)\n\t{\n\t\tb[i]=temp%10;\n\t\ttemp/=10;\n\t}\n\tfor(int j=0;j<=i-1;j++)\n\t{\n\t\tt+=b[j]*mi(i-j-1);\n\t}\n\tif(result==t) return 1;\n\telse return 0;\n}\nint main()\n{\n\tint num,S;\n\tscanf(\""%d %d\"",&num,&S);\n\tint counter1=0;\n\tint counter2=0;\n\tint result;\n\tint flag=0;\n\tfor(int n=S;counter1<num;n++)\n\t{\n\t\tfor(int k=2;k<=10;k++)\n\t\t{\n\t\t\tresult=trans(n,k);\n\t\t\tflag=judge(result);\n\t\t\tif(flag==1)\n\t\t\t\tcounter2++;\n\t\t}\n\t\tif(counter2>=2)\n\t\t{\n\t\t\tprintf(\""%d\\n\"",n);\n\t\t\tcounter1++;\n\t\t}\n\t}\n\treturn 0;\n}",WRONG_ANSWER,23,444
1524270549021274112,4a5105f4acfb3cb0727ac88c5a1663175852bf038462a9e4ee4e3022bc169ab2,2022-05-11 14:09:53,C++,80.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<cstdio>\n#include<algorithm>\n#include<cmath> \n#include<cstring>\n#include<string>\nusing namespace std;\nint n;\nint a[1000005],b[100005];\nint main()\n{\n\tscanf(\""%d\"",&n);\n\tfor (int i=1;i<=300;i++)\n\t{\n\t\tint tot=0;\n\t\tint j=i*i;\n\t\t\n\t\twhile (j)\n\t\t{\n\t\t\ta[++tot]=j%n;\n\t\t\tj=j/n;\n\t\t}\n\t\tbool o=true;\n\t\tfor (int i=1;i<=tot/2;i++) if (a[i]!=a[tot-i+1]) o=false;\n\t\tif (o)\n\t\t{\n\t\t\tj=i;\n\t\t\tint op=0;\n\t\t\twhile (j) \n\t\t\t{\n\t\t\t\tb[++op]=j%n;\n\t\t\t\tj=j/n;\n\t\t\t}\n\t\t\tfor (int l=op;l>0;l--) if (b[l]>=10) printf(\""%c\"",(char)(b[l]+'A'-10));else printf(\""%d\"",b[l]);\n\t\t\tprintf(\"" \"");\n\t\t\tfor (int l=tot;l>0;l--) if (a[l]>=10) printf(\""%c\"",(char)(a[l]+'A'-10));else printf(\""%d\"",a[l]);\n\t\t\tprintf(\""\\n\""); \n\t\t}\n\t}\t\n\treturn 0; \n}",ACCEPTED,27,476
1524284372507738112,9872320d018cd57ca35a1d90b282472df95f89da8e8b2954c9366cdfec1d68cd,2022-05-11 15:04:48,C++,0.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nint mi(int x)\n{\n\tint y=1;\n\tfor(int i=0;i<=x-1;i++)\n\t{\n\t\ty*=10;\n\t}\n\treturn y;\n}\nint trans(int num,int k)\n{\n\tint result=0;\n\tint a[20];\n\tint temp=num;\n\tint i;\n\tfor(i=0;temp>0;i++)\n\t{\n\t\ta[i]=temp%k;\n\t\ttemp=(temp-a[i])/k;\n\t}\n\tfor(int j=i-1;j>=0;j--)\n\t{\n\t\tresult+=a[j]*mi(j);\n\t}\n\treturn result;\n}\nint judge(int result)\n{\n\tint b[20];\n\tint temp=result;\n\tint t=0;\n\tint i;\n\tfor(i=0;temp>0;i++)\n\t{\n\t\tb[i]=temp%10;\n\t\ttemp/=10;\n\t}\n\tfor(int j=0;j<=i-1;j++)\n\t{\n\t\tt+=b[j]*mi(i-j-1);\n\t}\n\tif(result==t) return 1;\n\telse return 0;\n}\nint main()\n{\n\tint num,S;\n\tscanf(\""%d %d\"",&num,&S);\n\tint counter1=0;\n\tint counter2=0;\n\tint result;\n\tint flag=0;\n\tfor(int n=S;counter1<num;n++)\n\t{\n\t\tfor(int k=2;k<=10;k++)\n\t\t{\n\t\t\tresult=trans(n,k);\n\t\t\tflag=judge(result);\n\t\t\tif(flag==1)\n\t\t\t\tcounter2++;\n\t\t}\n\t\tif(counter2>=2)\n\t\t{\n\t\t\tprintf(\""%d\\n\"",n);\n\t\t\tcounter1++;\n\t\t}\n\t}\n\treturn 0;\n}",WRONG_ANSWER,28,512
1524285713510600704,9872320d018cd57ca35a1d90b282472df95f89da8e8b2954c9366cdfec1d68cd,2022-05-11 15:10:08,C++,70.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nint isInbase(int num,int base){\n int s[1000],top=-1;\n while(num>0){\n  s[++top]=num%base;\n  num/=base;\n }\n for(int i=0,j=top;i<j;i++,j--){\n  if(s[i]!=s[j])return 0;\n }\n return 1;\n}\nint main(){\n int N,S;\n scanf(\""%d %d\"",&N,&S);\n    S++;\n while(N>0){\n  int count=0;\n  for(int i=2;i<=10;i++){\n            if(isInbase(S,i))count++;\n   if(count>=2){\n    printf(\""%d\\n\"",S);\n    N--;\n    break;\n   }\n  }\n  S++;\n }\n return 0;\n}",ACCEPTED,27,568
1524396537520619520,4a5105f4acfb3cb0727ac88c5a1663175852bf038462a9e4ee4e3022bc169ab2,2022-05-11 22:30:31,C++,70.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include<stdio.h>\n#include<string.h>\nint main()\n{\n\tchar str1[2000],str2[2000],k;\n\tint n,s,i,t1,d,j,len,sum,t3;\n\twhile(~scanf(\""%d%d\"",&n,&s))\n\t{\n\t\tfor(i=s+1;;i++)\n\t\t{\n\t\t\tsum=0;\n\t\t\tfor(j=2;j<=10;j++)\n\t\t\t{\n\t\t\t\tt1=i;len=0;t3=0;\n\t\t\t\twhile(t1)\n\t\t\t\t{\n\t\t\t\t\td=t1%j;\n\t\t\t\t\tstr1[len++]=\""0123456789\""[d];\n\t\t\t\t\tt1/=j;\n\t\t\t\t}\n\t\t\t\tstr1[len]='\\0';\n\t\t\t\tfor(k=len-1;k>=0;k--)\n\t\t\t\t\tstr2[t3++]=str1[k];\n\t\t\t\tstr2[t3]='\\0';\n\t\t\t\tif(strcmp(str1,str2)==0)\n\t\t\t\t\tsum++;\n\t\t\t}\n\t\t\tif(sum>=2)\n\t\t\t{\n\t\t\t\tn--;\n\t\t\t\tprintf(\""%d\\n\"",i);\n\t\t\t}\t\n\t\t\tif(n==0)\n\t\t\t\tbreak;\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,22,360
1525387306456879104,f285c921e1b820ed8de745286cc4feda45ea1084105b889a8f066a896c1b46ae,2022-05-14 16:07:28,C++,80.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <cstring>\nusing namespace std;\nstring mp = \""0123456789ABCDEFGHIJKL\"";\nstring pp(int x, int b) {\n    string s = \""\"";\n    while (x > 0) {\n        s = mp[x % b] + s;\n        x /= b;\n    }\n    return s;\n}\n\n\nvoid check(int a, int b) {\n    string s = pp(a * a, b);\n    int i = 0, j = s.size() - 1;\n    while (s[i] == s[j] && i < j) {\n        i ++;\n        j --;\n    }\n    if (i >= j) {\n        cout << pp(a, b) << \"" \"" << s << endl;\n    }\n}\n\n\nint main() {\n    int b;\n    cin >> b;\n    for (int i = 1; i <= 300; ++ i) {\n        check(i, b);\n    }\n    return 0;\n}\n",ACCEPTED,27,468
1525387512023924736,f285c921e1b820ed8de745286cc4feda45ea1084105b889a8f066a896c1b46ae,2022-05-14 16:08:17,C++,70.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <sstream>\n#include <string>\n#include <cmath>\nusing namespace std;\nint hw(int s)\n{\n    int ans=0;\n    for(int i=2;i<=10;i++)\n    {\n        if(ans==2) break;\n        int s0=s,j=0;\n        long long x=0;//转换成二进制可能很长 \n        while(s0)\n        {\n            x+=(s0%i)*pow(10,j);\n            s0/=i;\n            j++;\n        }\n        //cout<<x<<endl;\n        stringstream t;\n        string s;\n        t<<x;\n        t>>s;\n        int ls=s.size(),l=0;\n        while(s[l]==s[ls-1-l] && l<=(ls-1)/2)\n        {\n            l++;\n        }\n        l--;\n        if(l==(ls-1)/2) ans++;\n    }\n    return ans;\n}\nint main(){\n    int n,s,num=0;\n    cin>>n>>s;\n    while(num<n)\n    {\n        s++;\n        if(hw(s)==2) \n        {\n            cout<<s<<endl;\n            num++;\n        }\n    }\n    return 0;\n}",ACCEPTED,62,584
1525742523606142976,ce2f55ae4384d1f35b9cd2d7223b7a0f266b2f6ca61cc5f261b5ee9c84116149,2022-05-15 15:38:59,C++,0.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nchar a[] = { \""22233344455566670778889990\"" };\nint main() {\n    char n[14];\n    scanf(\""%s\"", n);\n    int len = strlen(n);\n    int flag = 0;\n    int cnt = 0;\n    for (int i = 1; i <= 4617; i++) {\n        flag = 0;\n        char temp[14];\n        scanf(\""%s\"", temp);\n        int len2 = strlen(temp);\n        if (len == len2) {\n            for (int j = 0; j < len-1; j++) {\n                if (n[j] != a[temp[j] - 'A']) {\n                    flag = 1;\n                    break;\n                }\n            }\n            if (!flag) {\n                printf(\""%s\\n\"", temp);\n                cnt++;\n            }\n        }\n    }\n    if (!cnt) {\n        cout << \""NONE\"" << endl;\n    }\n    return 0;\n}\n",WRONG_ANSWER,68,476
1525742564920049664,ce2f55ae4384d1f35b9cd2d7223b7a0f266b2f6ca61cc5f261b5ee9c84116149,2022-05-15 15:39:09,C++,0.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nchar a[] = { \""22233344455566670778889990\"" };\nint main() {\n    char n[14];\n    scanf(\""%s\"", n);\n    int len = strlen(n);\n    int flag = 0;\n    int cnt = 0;\n    for (int i = 1; i <= 4617; i++) {\n        flag = 0;\n        char temp[14];\n        scanf(\""%s\"", temp);\n        int len2 = strlen(temp);\n        if (len == len2) {\n            for (int j = 0; j < len; j++) {\n                if (n[j] != a[temp[j] - 'A']) {\n                    flag = 1;\n                    break;\n                }\n            }\n            if (!flag) {\n                printf(\""%s\\n\"", temp);\n                cnt++;\n            }\n        }\n    }\n    if (!cnt) {\n        cout << \""NONE\"" << endl;\n    }\n    return 0;\n}\n",WRONG_ANSWER,64,456
1525742672126455808,ce2f55ae4384d1f35b9cd2d7223b7a0f266b2f6ca61cc5f261b5ee9c84116149,2022-05-15 15:39:34,C++,80.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<stdio.h>\n \nchar c[20]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\nint n;\nint fun(int num)\n{\n    num*=num;\n    char a[1000];\n    int i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    int flag=1;\n    for(int j=1;j<=i/2;j++)\n    {\n        if(a[j]!=a[i-j+1])\n        {\n            flag=0;\n            break;\n        }\n    }\n    return flag;\n}\n \nvoid print(int num)\n{\n    int temp=num;\n    char a[1000];\n    int i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    for(i;i>=1;i--)\n        printf(\""%c\"",a[i]);\n    printf(\"" \"");\n    num=temp*temp;\n    i=1;\n    while(num)\n    {\n        a[i]=c[num%n];\n        num/=n;\n        i++;\n    }\n    i--;\n    for(i;i>=1;i--)\n        printf(\""%c\"",a[i]);\n    printf(\""\\n\"");\n}\n \nint main()\n{\n    while(~scanf(\""%d\"",&n))\n    {\n        for(int i=1;i<=300;i++)\n        {\n            if(fun(i)==1)\n                print(i);\n        }\n    }\n    return 0;\n}",ACCEPTED,24,348
1525742830377545728,ce2f55ae4384d1f35b9cd2d7223b7a0f266b2f6ca61cc5f261b5ee9c84116149,2022-05-15 15:40:12,C++,0.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <cstring>\nusing namespace std;\nint p[2000]\nint DTox(int x,int n)\n{\n   memset(p,0,sizeof(p));\n   int len=0;\n   while(n)\n   {\n   \t p[len]=n%x; len++;\n   \t n/=x;\n\t}\n\treturn --len;\t\n} \nint Palind(int x,int n)\n{\n\tint len1=DTox(x,n);\n\tint a=0,b=0;\n\tif(p[0]==0&&p[len1]==0) return 0;\n\tfor(int i=len1; i>=0; i--)\n\t\ta=a*10+p[i];\n\tfor(int i=0; i<=len1; i++)\n\t\tb=b*10+p[i];\n\tif(a==b)\treturn 1;\n\treturn 0;\n}\n\nint main()\n{\n\tint i,j,n,m,s,k,ans,sum=0;\n\tcin>>n>>s;\n\tfor(i=s+1; ; i++)\n\t{\n\t\tans=0;k=0;\n\t\tfor(j=2; j<=10; j++)\n\t\t{\n\t\t  if(Palind(j,i)==1)\n\t\t   ans++;\n\t\t  if(ans==2) {\n\t\t  \tk=1; break;\n\t\t  }\n\t\t}\n\t\tif(k==1) {\n\t\t sum;\t\n\t\t cout<<i<<endl;\t\n\t\t}\n\t\tif(sum==n)\n\t\tbreak;\n\t} \n\treturn 0;\n } \n",COMPILE_ERROR,0,0
1525742879211827200,ce2f55ae4384d1f35b9cd2d7223b7a0f266b2f6ca61cc5f261b5ee9c84116149,2022-05-15 15:40:23,C++,0.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <cstring>\nusing namespace std;\nint p[2000]\nint DTox(int x,int n)\n{\n   memset(p,0,sizeof(p));\n   int len=0;\n   while(n)\n   {\n   \t p[len]=n%x; len++;\n   \t n/=x;\n\t}\n\treturn --len;\t\n} \nint Palind(int x,int n)\n{\n\tint len1=DTox(x,n);\n\tint a=0,b=0;\n\tif(p[0]==0&&p[len1]==0) return 0;\n\tfor(int i=len1; i>=0; i--)\n\t\ta=a*10+p[i];\n\tfor(int i=0; i<=len1; i++)\n\t\tb=b*10+p[i];\n\tif(a==b)\treturn 1;\n\treturn 0;\n}\n\nint main()\n{\n\tint i,j,n,m,s,k,ans,sum=0;\n\tcin>>n>>s;\n\tfor(i=s+1; ; i++)\n\t{\n\t\tans=0;k=0;\n\t\tfor(j=2; j<=10; j++)\n\t\t{\n\t\t  if(Palind(j,i)==1)\n\t\t   ans++;\n\t\t  if(ans==2) {\n\t\t  \tk=1; break;\n\t\t  }\n\t\t}\n\t\tif(k==1) {\n\t\t sum+=2;\t\n\t\t cout<<i<<endl;\t\n\t\t}\n\t\tif(sum==n)\n\t\tbreak;\n\t} \n\treturn 0;\n } \n",COMPILE_ERROR,0,0
1525742917233197056,ce2f55ae4384d1f35b9cd2d7223b7a0f266b2f6ca61cc5f261b5ee9c84116149,2022-05-15 15:40:33,C++,0.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <cstring>\nusing namespace std;\nint p[2000]\nint DTox(int x,int n)\n{\n   memset(p,0,sizeof(p));\n   int len=0;\n   while(n)\n   {\n   \t p[len]=n%x; len++;\n   \t n/=x;\n\t}\n\treturn --len;\t\n} \nint Palind(int x,int n)\n{\n\tint len1=DTox(x,n);\n\tint a=0,b=0;\n\tif(p[0]==0&&p[len1]==0) return 0;\n\tfor(int i=len1; i>=0; i--)\n\t\ta=a*10+p[i];\n\tfor(int i=0; i<=len1; i++)\n\t\tb=b*10+p[i];\n\tif(a==b)\treturn 1;\n\treturn 0;\n}\n\nint main()\n{\n\tint i,j,n,m,s,k,ans,sum=0;\n\tcin>>n>>s;\n\tfor(i=s+1; ; i++)\n\t{\n\t\tans=0;k=0;\n\t\tfor(j=2; j<=10; j++)\n\t\t{\n\t\t  if(Palind(j,i)==1)\n\t\t   ans++;\n\t\t  if(ans==2) {\n\t\t  \tk=1; break;\n\t\t  }\n\t\t}\n\t\tif(k==1) {\n\t\t sum++;\t\n\t\t cout<<i<<endl;\t\n\t\t}\n\t\tif(sum==n)\n\t\tbreak;\n\t} \n\treturn 0;\n } \n",COMPILE_ERROR,0,0
1525742988209209344,ce2f55ae4384d1f35b9cd2d7223b7a0f266b2f6ca61cc5f261b5ee9c84116149,2022-05-15 15:40:49,C++,70.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nint n, s;\nbool change(int n, int k) {\n    int index = 0, res[10000];\n    while (n != 0) {\n        res[index++] = n % k;\n        n /= k;\n    }\n    int i = 0, j = index - 1;\n    while (i < j)\n        if (res[i++] != res[j--])\n            return 0;\n    return 1;\n}\nint main() {\n    cin >> n >> s;\n    int temp = 0;\n    int i = s + 1;\n    while (temp < n) {\n        if (change(i, 2) + change(i, 10) + change(i, 3) + change(i, 4) + change(i, 5) + change(i, 6) +\n                change(i, 7) + change(i, 8) + change(i, 9) >=\n            2) {\n            temp++;\n            cout << i << endl;\n        }\n        i++;\n    }\n    return 0;\n}",ACCEPTED,29,436
1526823999559245824,cf1ac92c18a897b0a973a055924e17b5dbfe6a7c49b109b598db1ca7718aa2cc,2022-05-18 15:16:23,C++,50.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<stdio.h>\nint fun1(int n,int x){\n\tint i=0,m=x*x,j,a[100],b[100],k=0;\n\twhile(x!=0){\n\t\tb[k++]=x%n;\n\t\tx=x/n;\n\t}\n\twhile(m!=0){\n\t\ta[i++]=m%n;\n\t\tm=m/n;\n\t}\n\tfor(j=0;j<i/2;j++){\n\t\tif(a[j]!=a[i-j-1]) return 0;\n\t}\n\tfor(j=k-1;j>0;j--)\n\t    printf(\""%d\"",b[j]);\n\tprintf(\""%d \"",b[j]);\n\tfor(j=0;j<i-1;j++)\n\t    printf(\""%d\"",a[j]);\n\tprintf(\""%d\\n\"",a[j]);\n}\nint main(){\n\tint n,i;\n\tscanf(\""%d\"",&n);\n\tfor(i=1;i<=300;i++){\n\t\tfun1(n,i);\n\t}\n}",PARTIAL_ACCEPTED,29,508
1530096519356047360,1a419da36d1b37390b22e6d7b8c86a8414ee9b3cc88fa09297a156399c9ff094,2022-05-27 16:00:12,C++,70.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nint fun(int n, int x)\n{\n    int len = 0, j;\n    int a[35];\n    while (n)\n    {\n        a[len++] = n % x;\n        n /= x;\n    }\n    for (j = 0; j < len / 2; j++)\n    {\n        if (a[j] == a[len - 1 - j])\n            continue;\n        else\n            return 0;\n    }\n    return 1;\n}\nint main()\n{\n    int f, k = 0, s;\n    cin >> f >> s;\n    while (k < f)\n    {\n        int m = 0;\n        s += 1;\n        for (int i = 2; i <= 10; i++)\n        {\n            if (fun(s, i))\n            {\n                m++;\n            }\n        }\n        if (m >= 2)\n        {\n            cout << s << endl;\n            k++;\n        }\n    }\n    return 0;\n}",ACCEPTED,29,476
1530096612805140480,1a419da36d1b37390b22e6d7b8c86a8414ee9b3cc88fa09297a156399c9ff094,2022-05-27 16:00:34,C++,80.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm> \nusing namespace std;\n\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1]) \n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1) // 是回文数；\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，使用模N取余法；\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\t\n        {\n            ans += t + '0';\n        }\n        else \n        {\n            ans += t - 10 + 'A'; // 保证进制大于10时，数字能用大写字母表示；\n        }\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（），以防止输入为0的情况；\n    reverse(ans.begin(), ans.end());  // 模N取余法，得到的字符串反转即可得到对应进制的数；\n    return ans;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    int j = 0;\n    for (int x = 1; x <= 300; x++)\n    {\n        j = x; // 创建副本\n        \n        string s1 = intToA(j, n);      // 将整数按n进制转换；\n        string s2 = intToA((j * j), n);// 将该数的平方按n进制转换；\n\n        if (Palin_num(s2))\n        {\n            cout << s1 << \"" \"" << s2 << endl;\n        }\n        else\n        {\n            continue;\n        }\n    }\n    return 0;\n}\n",ACCEPTED,34,576
1530389347084759040,ecfabb2ffbeaa6e90098711d9ed99a9804cf092ae6bb6ecc6c407f5dfcf32c14,2022-05-28 11:23:48,C++,0.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nint n, t, s;\nchar a[256];\n\nvoid shu(int m)\n{\n\tint i = 0;\n\tt = 0;\n\twhile (m != 0)\n\t\t{\n\t\t\tif (m % n < 10)\n\t\t\t\ta[i] = '0' + m % n;\n\t\t\telse\n\t\t\t\ta[i] = 'A' + m % n - 10;\n\t\t\tm = m / n;\n\t\t\tt++;\n\t\t\ti++;\n\t\t}\n\tfor (int i = 0; i < t / 2; i++)\n\t\t{\n\t\t\tswap(a[i], a[t - i - 1]);\n\t\t}\n}\n\nbool hui()\n{\n\tfor (int i = 0; i < t / 2; i++)\n\t\t{\n\t\t\tif (a[i] != a[t - i - 1])\n\t\t\t\treturn 0;\n\t\t}\n\treturn 1;\n}\n\nvoid f()\n{\n\tfor (int i = 255; i >= t; i--)\n\t\t{\n\t\t\ta[i] = '\\0';\n\t\t}\n}\n\nint main()\n{\n\tfreopen(\""palsquar.in\"", \""r\"", stdin);\n\tfreopen(\""palsquar.out\"", \""w\"", stdout);\n\tscanf(\""%d\"", &n);\n\tfor (int i = 1; i <= 300; i++)\n\t\t{\n\t\t\ts = i * i;\n\t\t\tshu(s);\n\t\t\tf();\n\t\t\tif (hui())\n\t\t\t\t{\n\t\t\t\t\tshu(i);\n\t\t\t\t\tf();\n\t\t\t\t\tprintf(\""%s \"", a);\n\t\t\t\t\tshu(s);\n\t\t\t\t\tf();\n\t\t\t\t\tprintf(\""%s\\n\"", a);\n\t\t\t\t}\n\t\t}\n}",FLOAT_POINT_EXCEPTION,34,640
1530389595010068480,ecfabb2ffbeaa6e90098711d9ed99a9804cf092ae6bb6ecc6c407f5dfcf32c14,2022-05-28 11:24:47,C++,80.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <cstring>\n#include <cstdio>\n#include <string>\nusing namespace std;\n\nstring a,b,c;\nint B,i,j;\nint pd(int k)\n{\n    a.clear();\n    while(k)\n    {\n        a+=k%B;\n        k/=B;\n    }\n    int l=0,r=a.length()-1;\n    while(l<r)\n    {\n        if(a[l++]!=a[r--])\n        return 0;\n    }\n    return 1;\n}\nvoid get(int q)\n{\n    b.clear();\n    while(q)\n    {\n        int d=q%B;\n        if(d>=10)\n        b+=char(d+55);\n        else b+=d;\n        q/=B;\n    }\n}\nvoid geta(int w)\n{\n    c.clear();\n    while(w)\n    {\n        int e=w%B;\n        if(e>=10)\n        c+=char(e+55);\n        else c+=e;\n        w/=B;\n    }\n}\nint main()\n{\n    scanf(\""%d\"",&B);\n    for(i=1;i<=300;++i)\n    {\n        if(pd(i*i))\n        {\n            get(i);\n            geta(i*i);\n            for(j=b.length()-1;j>=0;--j)\n            if(b[j]>='A'&&b[j]<='Z') cout<<b[j];\n            else cout<<int(b[j]);\n            cout<<\"" \"";\n            for(j=c.length()-1;j>=0;--j)\n            if(c[j]>='A'&&c[j]<='Z') cout<<c[j];\n            else cout<<int(c[j]);\n            cout<<endl;\n        }\n    }\n    return 0;\n}",ACCEPTED,36,476
1530390276546732032,ecfabb2ffbeaa6e90098711d9ed99a9804cf092ae6bb6ecc6c407f5dfcf32c14,2022-05-28 11:27:29,C++,10.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include<cstdio>\n#include<cstring>\n#include<cmath>\n#include<iostream>\n#include<algorithm>\nusing namespace std;\nbool solve(int a,int b);\nbool flag;\nint main()\n{\n       long long x,y,z=0;\n       cin>>x>>y;\n      while(z<x)\n       {\n            y++;\n           int w=0;\n           for(int i=2;i<=10;i++)\n           {\n               if(solve(y,i)) w++;\n               if(w>1) {\n                    cout<<y<<endl;\n                    z++;\n                break;\n               }\n           }\n       }\n   //    cout<<solve(x,y);\n        return 0;\n}\nbool solve(int a,int b)\n{\n    string d;\n    d.clear();\n    int i=0;\n    char c;\n    while(a%b!=a)\n    {\n        i=a%b;\n        if(i>=10) c=char(i+55);\n        else c=i+'0';\n        a=a/b;\n       d.push_back(c);\n    }\n    if(a>=10) c=char(a+55);\n    else c=a+'0';\n    string e=d;\n    reverse(d.begin(),d.end());\n    if(e==d) return 1;\n    return 0;\n}",PARTIAL_ACCEPTED,29,488
1530390321589346304,ecfabb2ffbeaa6e90098711d9ed99a9804cf092ae6bb6ecc6c407f5dfcf32c14,2022-05-28 11:27:40,C++,0.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include<cstdio>\n#include<cstring>\n#include<cmath>\n#include<iostream>\n#include<algorithm>\nusing namespace std;\nbool solve(int a,int b);\nbool flag;\nint main()\n{\n       long long x,y,z=0;\n       cin>>x>>y;\n      while(z<x)\n       {\n            y++;\n           int w=0;\n           for(int i=2;i<=10;i++)\n           {\n               if(solve(y,i)) w++;\n               if(w>1) {\n                    cout<<y<<endl;\n                    z++;\n                break;\n               }\n           }\n       }\n   //    cout<<solve(x,y);\n        return 0;\n}\nbool solve(int a,int b)\n{\n    string d;\n    d.clear();\n    int i=0;\n    char c;\n    while(a%b!=a)\n    {\n        i=a%b;\n        if(i>=10) c=char(i+55);\n        else c=i+'0';\n        a=a/b;\n       d.push_back(c);\n    }\n    if(a>=10) c=char(a+55);\n    else c=a+'0';\n    d.push_back(c)\n    string e=d;\n    reverse(d.begin(),d.end());\n    if(e==d) return 1;\n    return 0;\n}",COMPILE_ERROR,0,0
1530404228299186176,ecfabb2ffbeaa6e90098711d9ed99a9804cf092ae6bb6ecc6c407f5dfcf32c14,2022-05-28 12:22:56,C++,70.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include<cstdio>\n#include<cstring>\n#include<cmath>\n#include<iostream>\n#include<algorithm>\nusing namespace std;\nbool solve(int a,int b);\nbool flag;\nint main()\n{\n       long long x,y,z=0;\n       cin>>x>>y;\n      while(z<x)\n       {\n            y++;\n           int w=0;\n           for(int i=2;i<=10;i++)\n           {\n               if(solve(y,i)) w++;\n               if(w>1) {\n                    cout<<y<<endl;\n                    z++;\n                break;\n               }\n           }\n       }\n   //    cout<<solve(x,y);\n        return 0;\n}\nbool solve(int a,int b)\n{\n    string d;\n    d.clear();\n    int i=0;\n    char c;\n    while(a%b!=a)\n    {\n        i=a%b;\n        if(i>=10) c=char(i+55);\n        else c=i+'0';\n        a=a/b;\n       d.push_back(c);\n    }\n    if(a>=10) c=char(a+55);\n    else c=a+'0';\n    d.push_back(c);\n    string e=d;\n    reverse(d.begin(),d.end());\n    if(e==d) return 1;\n    return 0;\n}",ACCEPTED,36,500
1531180617969410048,6024b8d873019213f7f9a943755fcd01fc632e4e0f3130de5b2f4c9907cdf6c2,2022-05-30 15:48:01,C++,0.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<stdio.h>\nint N,B,len;\nint a[20];\nvoid turn(int num){\n\tint i=0,t;\n\tlen=0;\n\tif(B>=2&&B<10){\n\t\twhile(num>0){\n\t\t\ta[i]=num%B+'0';\n\t\t\ti++;\n\t\t\tlen++;\n\t\t\tnum/=B;\n\t\t}\n\t}else if( B >= 10 && B <= 20 ){\n\t\twhile( num > 0 ){\n\t\t\tt = num % B;\n\t\t\tif( t < 10 )\n\t\t\t\ta[i] = t + '0';\n\t\t\telse if( t == 10 )\n\t\t\t\ta[i] = 'A';\n\t\t\telse if( t == 11 )\n\t\t\t\ta[i] = 'B';\n\t\t\telse if( t == 12 )\n\t\t\t\ta[i] = 'C';\n\t\t\telse if( t == 13 )\n\t\t\t\ta[i] = 'D';\n\t\t\telse if( t == 14 )\n\t\t\t\ta[i] = 'E';\n\t\t\telse if( t == 15 )\n\t\t\t\ta[i] = 'F';\n\t\t\telse if( t == 16 )\n\t\t\t\ta[i] = 'G';\n\t\t\telse if( t == 17 )\n\t\t\t\ta[i] = 'H';\n\t\t\telse if( t == 18 )\n\t\t\t\ta[i] = 'I';\n\t\t\telse if( t == 19 )\n\t\t\t\ta[i] = 'J';\n\t\t\telse if(t==20){\n\t\t\t\ta[i]='K';\n\t\t\t}\n\t\t\tnum/=B;\n\t\t\ti++;\n\t\t\tlen++;\n\t\t}\n\t}\n}\n\nint isHuiWen(){\n\tint i,j;\n\tturn(N);\n\ti=0;\n\tj=len-1;\n\twhile(i<j){\n\t\tif(a[i]!=a[j]){\n\t\t\treturn 0;\n\t\t}\n\t\ti++;\n\t\tj--;\n\t}\n\treturn 1;\n}\n\nvoid show(int m){\n\tint i;\n\tturn(m);\n\tfor(i=len-1;i>=0;i--){\n\t\tprintf(\""%c\"",a[i]);\n\t}\n}\n\nint main(){\n\tscanf(\""%d\"",&B);\n\tfor(int i=1;i<=300;i++){\n\t\tN=i*i;\n\t\tif(isHuiWen()==1){\n\t\t\tshow(i);\n\t\t\tprintf(\"" \"");\n\t\t\tshow(N);\n\t\t\tprintf(\""\\n\"");\n\t\t}\n\t}\n\treturn 0;\n}\n————————————————\n版权声明：本文为CSDN博主「孤独狗传奇」的原创文章，遵循CC 4.0 BY-SA版权协议，转载请附上原文出处链接及本声明。\n原文链接：https://blog.csdn.net/weixin_39910081/article/details/104563665",COMPILE_ERROR,0,0
1531180682939183104,6024b8d873019213f7f9a943755fcd01fc632e4e0f3130de5b2f4c9907cdf6c2,2022-05-30 15:48:17,C++,80.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<stdio.h>\nint N,B,len;\nint a[20];\nvoid turn(int num){\n\tint i=0,t;\n\tlen=0;\n\tif(B>=2&&B<10){\n\t\twhile(num>0){\n\t\t\ta[i]=num%B+'0';\n\t\t\ti++;\n\t\t\tlen++;\n\t\t\tnum/=B;\n\t\t}\n\t}else if( B >= 10 && B <= 20 ){\n\t\twhile( num > 0 ){\n\t\t\tt = num % B;\n\t\t\tif( t < 10 )\n\t\t\t\ta[i] = t + '0';\n\t\t\telse if( t == 10 )\n\t\t\t\ta[i] = 'A';\n\t\t\telse if( t == 11 )\n\t\t\t\ta[i] = 'B';\n\t\t\telse if( t == 12 )\n\t\t\t\ta[i] = 'C';\n\t\t\telse if( t == 13 )\n\t\t\t\ta[i] = 'D';\n\t\t\telse if( t == 14 )\n\t\t\t\ta[i] = 'E';\n\t\t\telse if( t == 15 )\n\t\t\t\ta[i] = 'F';\n\t\t\telse if( t == 16 )\n\t\t\t\ta[i] = 'G';\n\t\t\telse if( t == 17 )\n\t\t\t\ta[i] = 'H';\n\t\t\telse if( t == 18 )\n\t\t\t\ta[i] = 'I';\n\t\t\telse if( t == 19 )\n\t\t\t\ta[i] = 'J';\n\t\t\telse if(t==20){\n\t\t\t\ta[i]='K';\n\t\t\t}\n\t\t\tnum/=B;\n\t\t\ti++;\n\t\t\tlen++;\n\t\t}\n\t}\n}\n\nint isHuiWen(){\n\tint i,j;\n\tturn(N);\n\ti=0;\n\tj=len-1;\n\twhile(i<j){\n\t\tif(a[i]!=a[j]){\n\t\t\treturn 0;\n\t\t}\n\t\ti++;\n\t\tj--;\n\t}\n\treturn 1;\n}\n\nvoid show(int m){\n\tint i;\n\tturn(m);\n\tfor(i=len-1;i>=0;i--){\n\t\tprintf(\""%c\"",a[i]);\n\t}\n}\n\nint main(){\n\tscanf(\""%d\"",&B);\n\tfor(int i=1;i<=300;i++){\n\t\tN=i*i;\n\t\tif(isHuiWen()==1){\n\t\t\tshow(i);\n\t\t\tprintf(\"" \"");\n\t\t\tshow(N);\n\t\t\tprintf(\""\\n\"");\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,24,356
1531180798886502400,6024b8d873019213f7f9a943755fcd01fc632e4e0f3130de5b2f4c9907cdf6c2,2022-05-30 15:48:45,C++,80.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<stdio.h>\nint N,B,len;\nint a[20];\nvoid turn(int num){\n\tint i=0,t;\n\tlen=0;\n\tif(B>=2&&B<10){\n\t\twhile(num>0){\n\t\t\ta[i]=num%B+'0';\n\t\t\ti++;\n\t\t\tlen++;\n\t\t\tnum/=B;\n\t\t}\n\t}else if( B >= 10 && B <= 20 ){\n\t\twhile( num > 0 ){\n\t\t\tt = num % B;\n\t\t\tif( t < 10 )\n\t\t\t\ta[i] = t + '0';\n\t\t\telse if( t == 10 )\n\t\t\t\ta[i] = 'A';\n\t\t\telse if( t == 11 )\n\t\t\t\ta[i] = 'B';\n\t\t\telse if( t == 12 )\n\t\t\t\ta[i] = 'C';\n\t\t\telse if( t == 13 )\n\t\t\t\ta[i] = 'D';\n\t\t\telse if( t == 14 )\n\t\t\t\ta[i] = 'E';\n\t\t\telse if( t == 15 )\n\t\t\t\ta[i] = 'F';\n\t\t\telse if( t == 16 )\n\t\t\t\ta[i] = 'G';\n\t\t\telse if( t == 17 )\n\t\t\t\ta[i] = 'H';\n\t\t\telse if( t == 18 )\n\t\t\t\ta[i] = 'I';\n\t\t\telse if( t == 19 )\n\t\t\t\ta[i] = 'J';\n\t\t\telse if(t==20){\n\t\t\t\ta[i]='K';\n\t\t\t}\n\t\t\tnum/=B;\n\t\t\ti++;\n\t\t\tlen++;\n\t\t}\n\t}\n}\n\nint isHuiWen(){\n\tint i,j;\n\tturn(N);\n\ti=0;\n\tj=len-1;\n\twhile(i<j){\n\t\tif(a[i]!=a[j]){\n\t\t\treturn 0;\n\t\t}\n\t\ti++;\n\t\tj--;\n\t}\n\treturn 1;\n}\n\nvoid show(int m){\n\tint i;\n\tturn(m);\n\tfor(i=len-1;i>=0;i--){\n\t\tprintf(\""%c\"",a[i]);\n\t}\n}\n\nint main(){\n\tscanf(\""%d\"",&B);\n\tfor(int i=1;i<=300;i++){\n\t\tN=i*i;\n\t\tif(isHuiWen()==1){\n\t\t\tshow(i);\n\t\t\tprintf(\"" \"");\n\t\t\tshow(N);\n\t\t\tprintf(\""\\n\"");\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,18,328
1532921184956952576,52d99830c0a2ac3b867339bd03a8766ce5b9782399343d74cf69e0dca8d28ef8,2022-06-04 11:04:25,C++,0.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<iostream>\n#include <stdlib.h>\n#include<cstring>\nusing namespace std;\nbool judge(char *s,int len);\nint main()\n{\n    int B;\n    cin>>B;\n//进制转换\n    int nums,n;\n    bool T;\n    char s[100];\n    for(int k=1;k<=300;k++)\n    {\n        nums=k*k;\n        itoa(nums, s, B);\n        n=strlen(s);\n        T=judge(s,n);\n        if(T==1)\n        cout<<k<<\"" \""<<s<<endl;\n    }\n\n/*数字介于1——300之间*/\n}\n//判断是否输出\nbool judge(char *s,int len)\n{\n    string c=s;\n    \n    for(int i=0;i<len;i++)\n    {\n        if(i<=len-i)\n        {\n            s[i]=s[len-1-i];\n           \n        }\n    }\n        if(s==c)\n        return true;\n        else return 0;\n}\n    \n",COMPILE_ERROR,0,0
1532921303798341632,52d99830c0a2ac3b867339bd03a8766ce5b9782399343d74cf69e0dca8d28ef8,2022-06-04 11:04:53,C++,0.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<iostream>\n#include <stdlib.h>\n#include<cstring>\nusing namespace std;\nbool judge(char *s,int len);\nint main()\n{\n    int B;\n    cin>>B;\n//进制转换\n    int nums,n;\n    bool T;\n    char s[100];\n    for(int k=1;k<=300;k++)\n    {\n        nums=k*k;\n        atol(nums, s, B);\n        n=strlen(s);\n        T=judge(s,n);\n        if(T==1)\n        cout<<k<<\"" \""<<s<<endl;\n    }\n\n/*数字介于1——300之间*/\n}\n//判断是否输出\nbool judge(char *s,int len)\n{\n    string c=s;\n    \n    for(int i=0;i<len;i++)\n    {\n        if(i<=len-i)\n        {\n            s[i]=s[len-1-i];\n           \n        }\n    }\n        if(s==c)\n        return true;\n        else return 0;\n}\n    \n",COMPILE_ERROR,0,0
1532921817160196096,52d99830c0a2ac3b867339bd03a8766ce5b9782399343d74cf69e0dca8d28ef8,2022-06-04 11:06:56,C++,0.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<iostream>\n#include <stdlib.h>\n#include<cstring>\nusing namespace std;\nbool judge(char *s,int len);\nint main()\n{\n    int B;\n    cin>>B;\n//进制转换\n    int nums,n;\n    bool T;\n    char s[100];\n    for(int k=1;k<=300;k++)\n    {\n        nums=k*k;\n        itoa(nums, s, B);\n        n=strlen(s);\n        T=judge(s,n);\n        if(T==1)\n        cout<<k<<\"" \""<<s<<endl;\n    }\n\n/*数字介于1——300之间*/\n}\n//判断是否输出\nbool judge(char *s,int len)\n{\n    string c=s;\n    \n    for(int i=0;i<len;i++)\n    {\n        if(i<=len-i)\n        {\n            s[i]=s[len-1-i];\n           \n        }\n    }\n        if(s==c)\n        return true;\n        else return 0;\n}\n    \n",COMPILE_ERROR,0,0
1532922747125477376,52d99830c0a2ac3b867339bd03a8766ce5b9782399343d74cf69e0dca8d28ef8,2022-06-04 11:10:37,C++,0.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<iostream>\n#include <stdlib.h>\n#include<cstring>\nusing namespace std;\nbool judge(char *s,int len);\nint main()\n{\n    int B;\n    cin>>B;\n//进制转换\n    int nums,n;\n    bool T;\n    char s[100];\n    for(int k=1;k<=300;k++)\n    {\n        nums=k*k;\n        _itoa(nums, s, B);\n        n=strlen(s);\n        T=judge(s,n);\n        if(T==1)\n        cout<<k<<\"" \""<<s<<endl;\n    }\n\n/*数字介于1——300之间*/\n}\n//判断是否输出\nbool judge(char *s,int len)\n{\n    string c=s;\n    \n    for(int i=0;i<len;i++)\n    {\n        if(i<=len-i)\n        {\n            s[i]=s[len-1-i];\n           \n        }\n    }\n        if(s==c)\n        return true;\n        else return 0;\n}\n    \n",COMPILE_ERROR,0,0
1532923105537138688,52d99830c0a2ac3b867339bd03a8766ce5b9782399343d74cf69e0dca8d28ef8,2022-06-04 11:12:03,C++,0.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<iostream>\n#include <cstdlib>\n#include<cstring>\nusing namespace std;\nbool judge(char *s,int len);\nint main()\n{\n    int B;\n    cin>>B;\n//进制转换\n    int nums,n;\n    bool T;\n    char s[100];\n    for(int k=1;k<=300;k++)\n    {\n        nums=k*k;\n        itoa(nums, s, B);\n        n=strlen(s);\n        T=judge(s,n);\n        if(T==1)\n        cout<<k<<\"" \""<<s<<endl;\n    }\n\n/*数字介于1——300之间*/\n}\n//判断是否输出\nbool judge(char *s,int len)\n{\n    string c=s;\n    \n    for(int i=0;i<len;i++)\n    {\n        if(i<=len-i)\n        {\n            s[i]=s[len-1-i];\n           \n        }\n    }\n        if(s==c)\n        return true;\n        else return 0;\n}\n    \n",COMPILE_ERROR,0,0
1533017108769120256,c3f068691d1b17f4515d3c005b1f083d74ad793d63b0e72c8f1603b29b08fcdc,2022-06-04 17:25:35,C++,80.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm> \nusing namespace std;\n\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1]) \n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1) // 是回文数；\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，使用模N取余法；\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\t\n        {\n            ans += t + '0';\n        }\n        else \n        {\n            ans += t - 10 + 'A'; // 保证进制大于10时，数字能用大写字母表示；\n        }\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（），以防止输入为0的情况；\n    reverse(ans.begin(), ans.end());  // 模N取余法，得到的字符串反转即可得到对应进制的数；\n    return ans;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    int j = 0;\n    for (int x = 1; x <= 300; x++)\n    {\n        j = x; // 创建副本\n        \n        string s1 = intToA(j, n);      // 将整数按n进制转换；\n        string s2 = intToA((j * j), n);// 将该数的平方按n进制转换；\n\n        if (Palin_num(s2))\n        {\n            cout << s1 << \"" \"" << s2 << endl;\n        }\n        else\n        {\n            continue;\n        }\n    }\n    return 0;\n}\n",ACCEPTED,33,572
1533072381579862016,cf1ac92c18a897b0a973a055924e17b5dbfe6a7c49b109b598db1ca7718aa2cc,2022-06-04 21:05:13,C++,70.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <sstream>\n#include <string>\n#include <cmath>\nusing namespace std;\nint hw(int s)\n{\n    int ans=0;\n    for(int i=2;i<=10;i++)\n    {\n        if(ans==2) break;\n        int s0=s,j=0;\n        long long x=0;//转换成二进制可能很长 \n        while(s0)\n        {\n            x+=(s0%i)*pow(10,j);\n            s0/=i;\n            j++;\n        }\n        //cout<<x<<endl;\n        stringstream t;\n        string s;\n        t<<x;\n        t>>s;\n        int ls=s.size(),l=0;\n        while(s[l]==s[ls-1-l] && l<=(ls-1)/2)\n        {\n            l++;\n        }\n        l--;\n        if(l==(ls-1)/2) ans++;\n    }\n    return ans;\n}\nint main(){\n    int n,s,num=0;\n    cin>>n>>s;\n    while(num<n)\n    {\n        s++;\n        if(hw(s)==2) \n        {\n            cout<<s<<endl;\n            num++;\n        }\n    }\n    return 0;\n}",ACCEPTED,51,468
1533077579031339008,cf1ac92c18a897b0a973a055924e17b5dbfe6a7c49b109b598db1ca7718aa2cc,2022-06-04 21:25:52,C++,50.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<stdio.h>\nint fun1(int n,int x){\n\tint i=0,m=x*x,j,a[100],b[100],k=0;\n\twhile(x!=0){\n\t\tb[k++]=x%n;\n\t\tx=x/n;\n\t}\n\twhile(m!=0){\n\t\ta[i++]=m%n;\n\t\tm=m/n;\n\t}\n\tfor(j=0;j<i/2;j++){\n\t\tif(a[j]!=a[i-j-1]) return 0;\n\t}\n\tfor(j=k-1;j>0;j--)\n\t    printf(\""%d\"",b[j]);\n\tprintf(\""%d \"",b[j]);\n\tfor(j=0;j<i-1;j++)\n\t    printf(\""%d\"",a[j]);\n\tprintf(\""%d\\n\"",a[j]);\n}\nint main(){\n\tint n,i;\n\tscanf(\""%d\"",&n);\n\tfor(i=1;i<=300;i++){\n\t\tfun1(n,i);\n\t}\n}",PARTIAL_ACCEPTED,28,312
1533358815033405440,937211cce665a654115f1f95a0ba82969beb778503d2596a2d369f2f402d3e76,2022-06-05 16:03:24,C++,80.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nint n;\nint a[1000005], b[100005];\nint main()\n{\n    cin>>n;\n    for (int i = 1; i <= 300; i++)\n    {\n        int tot = 0;\n        int j = i * i;\n\n        while (j)\n        {\n            a[++tot] = j % n;\n            j = j / n;\n        }\n        bool o = true;\n        for (int i = 1; i <= tot / 2; i++)\n            if (a[i] != a[tot - i + 1])\n                o = false;\n        if (o)\n        {\n            j = i;\n            int op = 0;\n            while (j)\n            {\n                b[++op] = j % n;\n                j = j / n;\n            }\n            for (int l = op; l > 0; l--)\n                if (b[l] >= 10)\n                    printf(\""%c\"", (char)(b[l] + 'A' - 10) /*就是这里，对于c++字符与整形的转换还不是特别熟习啊*/);\n                else\n                    printf(\""%d\"", b[l]);\n            printf(\"" \"");\n            for (int l = tot; l > 0; l--)\n                if (a[l] >= 10)\n                    printf(\""%c\"", (char)(a[l] + 'A' - 10));\n                else\n                    printf(\""%d\"", a[l]);\n            printf(\""\\n\"");\n        }\n    }\n    return 0;\n}",ACCEPTED,36,608
1533365124646526976,8e4fc0411257cacce1b678605d18ac99161cb63491a7b2b756233d7bd689dd1c,2022-06-05 16:28:28,C++,80.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <cstdio>\n\nusing namespace std;\n\nchar m[30] = { '0', '1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\n\nstring Switch(int x, int n)\n{\n    string s = \""\"";\n\n    while (x)\n    {\n        s += m[x % n];\n        x /= n;\n    }\n    reverse(s.begin(), s.end());\n\n    return s;\n}\n\nbool HuiWen(string s)\n{\n    int i = 0;\n    int j = s.size() - 1;\n\n    while (i < j)\n    {\n        if (s[i] != s[j]) return false;\n        i++, j--;\n    }\n\n    return true;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    for (int i = 1; i <= 300; i++)\n    {\n        string num = Switch(i, n);\n        string Pnum = Switch(i * i, n);\n        if (HuiWen(Pnum)) cout << num << \"" \"" << Pnum << endl;\n    }\n\n    return 0;\n}",ACCEPTED,41,628
1533365168535728128,937211cce665a654115f1f95a0ba82969beb778503d2596a2d369f2f402d3e76,2022-06-05 16:28:39,C++,0.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nint n;\nint a[1000005], b[100005];\nint main()\n{\n    cin>>n;\n    for (int i = 1; i <= 300; i++)\n    {\n        int tot = 0;\n        int j = i * i;\n\n        while (j)\n        {\n            a[tot++] = j % n;\n            j = j / n;\n        }\n        bool o = true;\n        for (int i = 1; i <= tot / 2; i++)\n            if (a[i] != a[tot - i + 1])\n                o = false;\n        if (o)\n        {\n            j = i;\n            int op = 0;\n            while (j)\n            {\n                b[++op] = j % n;\n                j = j / n;\n            }\n            for (int l = op; l > 0; l--)\n                if (b[l] >= 10)\n                    printf(\""%c\"", (char)(b[l] + 'A' - 10) /*就是这里，对于c++字符与整形的转换还不是特别熟习啊*/);\n                else\n                    printf(\""%d\"", b[l]);\n            printf(\"" \"");\n            for (int l = tot; l > 0; l--)\n                if (a[l] >= 10)\n                    printf(\""%c\"", (char)(a[l] + 'A' - 10));\n                else\n                    printf(\""%d\"", a[l]);\n            printf(\""\\n\"");\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,44,464
1533365208150929408,937211cce665a654115f1f95a0ba82969beb778503d2596a2d369f2f402d3e76,2022-06-05 16:28:48,C++,80.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nint n;\nint a[1000005], b[100005];\nint main()\n{\n    cin>>n;\n    for (int i = 1; i <= 300; i++)\n    {\n        int tot = 0;\n        int j = i * i;\n\n        while (j)\n        {\n            a[++tot] = j % n;\n            j = j / n;\n        }\n        bool o = true;\n        for (int i = 1; i <= tot / 2; i++)\n            if (a[i] != a[tot - i + 1])\n                o = false;\n        if (o)\n        {\n            j = i;\n            int op = 0;\n            while (j)\n            {\n                b[++op] = j % n;\n                j = j / n;\n            }\n            for (int l = op; l > 0; l--)\n                if (b[l] >= 10)\n                    printf(\""%c\"", (char)(b[l] + 'A' - 10) /*就是这里，对于c++字符与整形的转换还不是特别熟习啊*/);\n                else\n                    printf(\""%d\"", b[l]);\n            printf(\"" \"");\n            for (int l = tot; l > 0; l--)\n                if (a[l] >= 10)\n                    printf(\""%c\"", (char)(a[l] + 'A' - 10));\n                else\n                    printf(\""%d\"", a[l]);\n            printf(\""\\n\"");\n        }\n    }\n    return 0;\n}",ACCEPTED,68,608
1533365585638301696,937211cce665a654115f1f95a0ba82969beb778503d2596a2d369f2f402d3e76,2022-06-05 16:30:18,C++,80.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\n\nint n;\nint a[1000005], b[100005];\nint main()\n{\n    cin>>n;\n    for (int i = 1; i <= 300; i++)\n    {\n        int tot = 0;\n        int j = i * i;\n\n        while (j)\n        {\n            a[++tot] = j % n;\n            j = j / n;\n        }\n        bool o = true;\n        for (int i = 1; i <= tot / 2; i++)\n            if (a[i] != a[tot - i + 1])\n                o = false;\n        if (o)\n        {\n            j = i;\n            int op = 0;\n            while (j)\n            {\n                b[++op] = j % n;\n                j = j / n;\n            }\n            for (int l = op; l > 0; l--)\n                if (b[l] >= 10)\n                    cout<<(char)(b[l] + 'A' - 10); \n                else\n                    cout<<b[l];\n            cout<<\"" \"";\n            for (int l = tot; l > 0; l--)\n                if (a[l] >= 10)\n                    cout<<(char)(a[l] + 'A' - 10);\n                else\n                    cout<<a[l];\n            cout<<endl;\n        }\n    }\n    return 0;\n}",ACCEPTED,43,640
1533393769431805952,937211cce665a654115f1f95a0ba82969beb778503d2596a2d369f2f402d3e76,2022-06-05 18:22:18,C++,70.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <sstream>\n#include <string>\n#include <cmath>\nusing namespace std;\nint hw(int s)\n{\n    int ans = 0;\n    for (int i = 2; i <= 10; i++)\n    {\n        if (ans == 2)\n            break;\n        int s0 = s, j = 0;\n        long long x = 0; //转换成二进制可能很长\n        while (s0)\n        {\n            x += (s0 % i) * pow(10, j);\n            s0 /= i;\n            j++;\n        }\n        stringstream t;\n        string s;\n        t << x;\n        t >> s;\n        int ls = s.size(), l = 0;\n        while (s[l] == s[ls - 1 - l] && l <= (ls - 1) / 2)\n        {\n            l++;\n        }\n        l--;\n        if (l == (ls - 1) / 2)\n            ans++;\n    }\n    return ans;\n}\n\nint main()\n{\n    int n, s, num = 0;\n    cin >> n >> s;\n    while (num < n)\n    {\n        s++;\n        if (hw(s) >= 2)\n        {\n            cout << s << endl;\n            num++;\n        }\n    }\n    return 0;\n}",ACCEPTED,46,488
1533393795511984128,937211cce665a654115f1f95a0ba82969beb778503d2596a2d369f2f402d3e76,2022-06-05 18:22:24,C++,70.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <sstream>\n#include <string>\n#include <cmath>\nusing namespace std;\nint hw(int s)\n{\n    int ans = 0;\n    for (int i = 2; i <= 10; i++)\n    {\n        if (ans == 2)\n            break;\n        int s0 = s, j = 0;\n        long long x = 0; //转换成二进制可能很长\n        while (s0)\n        {\n            x += (s0 % i) * pow(10, j);\n            s0 /= i;\n            j++;\n        }\n        stringstream t;\n        string s;\n        t << x;\n        t >> s;\n        int ls = s.size(), l = 0;\n        while (s[l] == s[ls - 1 - l] && l <= (ls - 1) / 2)\n        {\n            l++;\n        }\n        l--;\n        if (l == (ls - 1) / 2)\n            ans++;\n    }\n    return ans;\n}\n\nint main()\n{\n    int n, s, num = 0;\n    cin >> n >> s;\n    while (num < n)\n    {\n        s++;\n        if (hw(s) == 2)\n        {\n            cout << s << endl;\n            num++;\n        }\n    }\n    return 0;\n}",ACCEPTED,47,464
1533394687262961664,937211cce665a654115f1f95a0ba82969beb778503d2596a2d369f2f402d3e76,2022-06-05 18:25:57,C++,70.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <sstream>\n#include <string>\n#include <cmath>\nusing namespace std;\n\nint hw(int s)\n{\n    int ans = 0;\n    for (int i = 2; i <= 10; i++) //进制转化\n    {\n        if (ans == 2)\n            break;\n        int s0 = s, j = 0;\n        long long x = 0; //转换成二进制可能很长\n        while (s0)\n        {\n            x += (s0 % i) * pow(10, j);\n            s0 /= i;\n            j++;\n        }\n        stringstream t;\n        string s;\n        t << x; // 将int类型的值放入输入流中\n        t >> s; // 从sstream中抽取前面插入的int类型的值，赋给string类型\n        int ls = s.size(), l = 0;\n        while (s[l] == s[ls - 1 - l] && l <= (ls - 1) / 2)\n        {\n            l++;\n        }\n        l--;\n        if (l == (ls - 1) / 2)\n            ans++;\n    }\n    return ans;\n}\n\nint main()\n{\n    int n, s, num = 0;\n    cin >> n >> s;\n    while (num < n)\n    {\n        s++;\n        if (hw(s) == 2)\n        {\n            cout << s << endl;\n            num++;\n        }\n    }\n    return 0;\n}",ACCEPTED,46,476
1533449137881047040,ff8c207bd2734a0e4233ec3cde3dd538287144dd5ec01862171cdda9685b60ba,2022-06-05 22:02:19,C++,0.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\n\nint fuc(int x)\n\n{\n\n\tint m,newed=0,t=0;\n\n\tm=x;\n\n\tdo\n\n\t{\n\n\t\tnewed=newed*10+m%10;\n\n\t\tm/=10;\n\n\t}while(m>0);\n\n\tif(x==newed) t=1;\n\n\treturn t;\n\n}\n\nint main()\n\n{\n\n\tint n;\n\n\twhile(scanf(\""%d\"",&n)!=EOF&&n!=0)\n\n\t{\n        if(fuc(n)&&sqrt(n)==(int)sqrt(n)) printf(\""YES\\n\"");\n        else printf(\""NO\\n\"");\n\t}\n\treturn 0;\n\n}\n",WRONG_ANSWER,27,612
1533449528513376256,ff8c207bd2734a0e4233ec3cde3dd538287144dd5ec01862171cdda9685b60ba,2022-06-05 22:03:52,C++,80.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\n\nusing namespace std;\nint B;\nint a[20];//只需要考虑二进制的感受 ，开大一点无所谓 \nbool calc(int x)//不存在0我就懒得考虑了 \n{\n    int np=0;\n    x=x*x;\n    while(x)\n    {\n        a[++np]=x%B;\n        x/=B;\n    }\n    for(int i=1,j=np;i<j;i++,j--)\n        if(a[i]!=a[j])\n            return 0;\n    return 1;\n}\nvoid outs(int x)\n{\n    int np=0;\n    while(x)\n    {\n        a[++np]=x%B;\n        x/=B;\n    }\n    for(int i=np;i>=1;i--)\n    {\n        if(a[i]>9)\n            printf(\""%c\"",a[i]-10+'A');\n        else printf(\""%d\"",a[i]);\n    }\n}\nint main()\n{\n    //freopen(\""in.txt\"",\""r\"",stdin);\n    scanf(\""%d\"",&B);\n    for(int i=1;i<=300;i++)\n    {\n        if(calc(i))\n        {\n            outs(i);\n            printf(\"" \"");\n            outs(i*i);\n            printf(\""\\n\"");\n        }\n    }\n    return 0;\n}",ACCEPTED,24,456
1533450226483306496,ff8c207bd2734a0e4233ec3cde3dd538287144dd5ec01862171cdda9685b60ba,2022-06-05 22:06:38,C++,0.0,1511526337611964424,1267449136707624960,1049226397448056832,"\n#include <iostream>\n#include <fstream>\n#include <map>\n#include <string>\n#include <cmath>\nusing namespace std;\n \nifstream fin(\""palsquare.in\"");\nofstream fout(\""palsquare.out\"");\nbool judge(string &str)\n{\n\tfor(int i = 0, j = str.length() - 1; i < j; ++i, --j )\n\t{\n\t\tif(str[i] != str[j])\n\t\t\treturn 0;\n\t}\n\treturn 1;\n}\n \nint main(){\n\tint n;\n\tchar s[] = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J'};\n\twhile(fin >> n){\n\t\tstring str;\t\t\n\t\tfor(int i = 1; i < 300; ++i){\n\t\t\tint tmp = i * i;\n\t\t\tstr = \""\"";\n\t\t\twhile(tmp){\n\t\t\t\tstr += s[tmp % n];\n\t\t\t\ttmp /= n;\n\t\t\t}\n\t\t\tif(judge(str))\n\t\t\t{\n\t\t\t\tint ttmp = i;\n\t\t\t\tstring tt;\n\t\t\t\twhile(ttmp)\n\t\t\t\t{\n\t\t\t\t\ttt += s[ttmp % n];\n\t\t\t\t\tttmp /= n;\n\t\t\t\t}\n\t\t\t\tfor(int j = tt.length() - 1; j >= 0; --j)\n\t\t\t\t\tfout << tt[j];\n\t\t\t\tfout << ' ';\n\t\t\t\tfor(int j = str.length() - 1; j >= 0; --j)\n\t\t\t\t\tfout << str[j];\n\t\t\t\tfout << endl;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}",WRONG_ANSWER,30,588
1533450338735464448,ff8c207bd2734a0e4233ec3cde3dd538287144dd5ec01862171cdda9685b60ba,2022-06-05 22:07:05,C++,0.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint n,s,a[1001],t,sum,k;\n \nvoid zhuan(int num,int m)\n{\n\tt=0;\n\tint i=1;\n\twhile(num!=0)\n\t{\n\t\ta[i]=num%m;\n\t\tnum/=m;\n\t\ti++;\n\t\tt++;\n\t}\n}\n \nbool hui()\n{\n\tfor(int i=1;i<=t/2;i++)\n\t{\n\t\tif(a[i]!=a[t-i+1])\n\t\treturn 0;\n\t}\n\treturn 1;\n}\n \nmain()\n{\n\tfreopen(\""dualpal.in\"",\""r\"",stdin);\n\tfreopen(\""dualpal.out\"",\""w\"",stdout);\n\tscanf(\""%d%d\"",&n,&s);\n\tfor(int i=s+1;;i++)\n\t{\n\t\tk=0;\n\t\tfor(int m=2;m<=10;m++)//m进制 \n\t\t{\n\t\t\tzhuan(i,m);\n\t\t\tif(hui())\n\t\t\t{\n\t\t\t\tk++;\n\t\t\t\tif(k>2)\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(k>=2)\n\t\t{\n\t\t\tprintf(\""%d\\n\"",i);\n\t\t\t\tsum++;\n\t\t\t\tif(sum==n)\n\t\t\t\treturn 0;\n\t\t}\n\t}\n}",TIME_LIMIT_EXCEEDED,2800,468
1533450490393096192,ff8c207bd2734a0e4233ec3cde3dd538287144dd5ec01862171cdda9685b60ba,2022-06-05 22:07:41,C++,70.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint n,s,a[1001],t,sum,k;\n \nvoid zhuan(int num,int m)\n{\n\tt=0;\n\tint i=1;\n\twhile(num!=0)\n\t{\n\t\ta[i]=num%m;\n\t\tnum/=m;\n\t\ti++;\n\t\tt++;\n\t}\n}\n \nbool hui()\n{\n\tfor(int i=1;i<=t/2;i++)\n\t{\n\t\tif(a[i]!=a[t-i+1])\n\t\treturn 0;\n\t}\n\treturn 1;\n}\n \nint main()\n{\n\n\tscanf(\""%d%d\"",&n,&s);\n\tfor(int i=s+1;;i++)\n\t{\n\t\tk=0;\n\t\tfor(int m=2;m<=10;m++)//m进制 \n\t\t{\n\t\t\tzhuan(i,m);\n\t\t\tif(hui())\n\t\t\t{\n\t\t\t\tk++;\n\t\t\t\tif(k>2)\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(k>=2)\n\t\t{\n\t\t\tprintf(\""%d\\n\"",i);\n\t\t\t\tsum++;\n\t\t\t\tif(sum==n)\n\t\t\t\treturn 0;\n\t\t}\n\t}\n}",ACCEPTED,23,456
1533453233514065920,52d99830c0a2ac3b867339bd03a8766ce5b9782399343d74cf69e0dca8d28ef8,2022-06-05 22:18:35,C++,0.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<iostream>\n#include <cstdlib>\n#include<cstring>\nusing namespace std;\nbool judge(char *s,int len);\nint main()\n{\n    int B;\n    cin>>B;\n//进制转换\n    int nums,n;\n    bool T;\n    char s[100];\n    for(int k=1;k<=300;k++)\n    {\n        nums=k*k;\n        itoa(nums, s, B);\n        n=strlen(s);\n        T=judge(s,n);\n        if(T==1)\n        cout<<k<<\"" \""<<s<<endl;\n    }\n\n/*数字介于1——300之间*/\n}\n//判断是否输出\nbool judge(char *s,int len)\n{\n    string c=s;\n    \n    for(int i=0;i<len;i++)\n    {\n        if(i<=len-i)\n        {\n            s[i]=s[len-1-i];\n           \n        }\n    }\n        if(s==c)\n        return true;\n        else return 0;\n}\n    \n",COMPILE_ERROR,0,0
1533453482475364352,52d99830c0a2ac3b867339bd03a8766ce5b9782399343d74cf69e0dca8d28ef8,2022-06-05 22:19:35,C++,0.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nbool judge(char *s,int len);\nint main()\n{\n    int B;\n    cin>>B;\n//进制转换\n    int nums,n;\n    bool T;\n    char s[100];\n    for(int k=1;k<=300;k++)\n    {\n        nums=k*k;\n        itoa(nums, s, B);\n        n=strlen(s);\n        T=judge(s,n);\n        if(T==1)\n        cout<<k<<\"" \""<<s<<endl;\n    }\n\n/*数字介于1——300之间*/\n}\n//判断是否输出\nbool judge(char *s,int len)\n{\n    string c=s;\n    \n    for(int i=0;i<len;i++)\n    {\n        if(i<=len-i)\n        {\n            s[i]=s[len-1-i];\n           \n        }\n    }\n        if(s==c)\n        return true;\n        else return 0;\n}\n    \n",COMPILE_ERROR,0,0
1533457258301071360,52d99830c0a2ac3b867339bd03a8766ce5b9782399343d74cf69e0dca8d28ef8,2022-06-05 22:34:35,C++,10.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<iostream>\n#include <stdlib.h>\n#include<cstring>\n#include<algorithm>\nusing namespace std;\nstring intToA(int n,int radix) ;\nbool judge(char *s,int len);\nint main()\n{\n    int B;\n    cin>>B;\n//进制转换\n    int nums,n;\n    bool T;\n    char s[100];\n    string tp;\n    for(int k=1;k<=300;k++)\n    {\n        nums=k*k;\n        tp=intToA(nums, B);\n        strcpy(s,tp.c_str());\n        n=strlen(s);\n        T=judge(s,n);\n        if(T==1)\n        cout<<k<<\"" \""<<s<<endl;\n    }\n\n/*数字介于1——300之间*/\n}\n//判断是否输出\nbool judge(char *s,int len)\n{\n    string c=s;\n    \n    for(int i=0;i<len;i++)\n    {\n        if(i<=len-i)\n        {\n            s[i]=s[len-1-i];\n           \n        }\n    }\n        if(s==c)\n        return true;\n        else return 0;\n}\n\nstring intToA(int n,int radix)    \n{\n\tstring ans=\""\"";\n\tdo{\n\t\tint t=n%radix;\n\t\tif(t>=0&&t<=9)\tans+=t+'0';\n\t\telse ans+=t-10+'a';\n\t\tn/=radix;\n\t}while(n!=0);\n\treverse(ans.begin(),ans.end());\n\treturn ans;\t\n}\n",PARTIAL_ACCEPTED,26,472
1533458936584695808,52d99830c0a2ac3b867339bd03a8766ce5b9782399343d74cf69e0dca8d28ef8,2022-06-05 22:41:15,C++,0.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<iostream>\n#include <stdlib.h>\n#include<cstring>\n#include<algorithm>\nusing namespace std;\nstring intToA(int n,int radix) ;\nbool judge(char *s,int len);\nint main()\n{\n    int B;\n    cin>>B;\n//进制转换\n    int nums,n;\n    bool T;\n    char s[100];\n    string tp;\n    for(int k=1;k<=300;k++)\n    {\n        nums=k*k;\n        tp=intToA(nums, B);\n        strcpy(s,tp.c_str());\n        n=strlen(s);\n        T=judge(s,n);\n        if(T==1)\n        cout<<k<<\"" \""<<s<<endl;\n    }\n\n/*数字介于1——300之间*/\n}`\n//判断是否输出\nbool judge(char *s,int len)\n{\n    string c=s;\n    \n    for(int i=0;i<len;i++)\n    {\n        if(i<=len-i)\n        {\n            s[i]=s[len-1-i];  \n        }\n    }\n        if(s==c)\n        return true;\n        else return 0;\n}\n\nstring intToA(int n,int radix)    \n{\n\tstring ans=\""\"";\n\tdo{\n\t\tint t=n%radix;\n\t\tif(t>=0&&t<=9)\tans+=t+'0';\n\t\telse ans+=t-10+'a';\n\t\tn/=radix;\n\t}while(n!=0);\n\treverse(ans.begin(),ans.end());\n\treturn ans;\t\n}\n",COMPILE_ERROR,0,0
1533459019153764352,52d99830c0a2ac3b867339bd03a8766ce5b9782399343d74cf69e0dca8d28ef8,2022-06-05 22:41:35,C++,10.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<iostream>\n#include <stdlib.h>\n#include<cstring>\n#include<algorithm>\nusing namespace std;\nstring intToA(int n,int radix) ;\nbool judge(char *s,int len);\nint main()\n{\n    int B;\n    cin>>B;\n//进制转换\n    int nums,n;\n    bool T;\n    char s[100];\n    string tp;\n    for(int k=1;k<=300;k++)\n    {\n        nums=k*k;\n        tp=intToA(nums, B);\n        strcpy(s,tp.c_str());\n        n=strlen(s);\n        T=judge(s,n);\n        if(T==1)\n        cout<<k<<\"" \""<<s<<endl;\n    }\n\n/*数字介于1——300之间*/\n}\n//判断是否输出\nbool judge(char *s,int len)\n{\n    string c=s;\n    \n    for(int i=0;i<len;i++)\n    {\n        if(i<=len-i)\n        {\n            s[i]=s[len-1-i];  \n        }\n    }\n        if(s==c)\n        return true;\n        else return 0;\n}\n\nstring intToA(int n,int radix)    \n{\n\tstring ans=\""\"";\n\tdo{\n\t\tint t=n%radix;\n\t\tif(t>=0&&t<=9)\tans+=t+'0';\n\t\telse ans+=t-10+'a';\n\t\tn/=radix;\n\t}while(n!=0);\n\treverse(ans.begin(),ans.end());\n\treturn ans;\t\n}\n",PARTIAL_ACCEPTED,37,608
1533460782221058048,52d99830c0a2ac3b867339bd03a8766ce5b9782399343d74cf69e0dca8d28ef8,2022-06-05 22:48:35,C++,10.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<iostream>\n#include <stdlib.h>\n#include<cstring>\n#include<algorithm>\nusing namespace std;\nstring intToA(int n,int radix) ;\nbool judge(char *s,int len);\nint main()\n{\n    int B;\n    cin>>B;\n//进制转换\n    int nums,n;\n    bool T;\n    char s[100];\n    string tp;\n    for(int k=1;k<=300;k++)\n    {\n        nums=k*k;\n        tp=intToA(nums, B);\n        strcpy(s,tp.c_str());\n        n=strlen(s);\n        T=judge(s,n);\n        if(T==1)\n        cout<<k<<\"" \""<<s<<endl;\n    }\n\n/*数字介于1——300之间*/\n}\n//判断是否输出\nbool judge(char *s,int len)\n{\n    string c=s;\n    \n    for(int i=0;i<len;i++)\n    {\n        if(i<=len-i)\n        {\n            s[i]=s[len-1-i];  \n        }\n    }\n        if(s==c)\n        return true;\n        else return 0;\n}\n\nstring intToA(int n,int radix)    \n{\n\tstring ans=\""\"";\n\tdo{\n\t\tint t=n%radix;\n\t\tif(t>=0&&t<=9)\tans+=t+'0';\n\t\telse ans+=t-10+'A';\n\t\tn/=radix;\n\t}while(n!=0);\n\treverse(ans.begin(),ans.end());\n\treturn ans;\t\n}\n",PARTIAL_ACCEPTED,31,448
1533461486671212544,a5a94037eb90f29eef6fc050822bc6d8ab0b3a534c6a200fd675cec11927ce03,2022-06-05 22:51:23,C++,0.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\n#include<stdio.h>\nusing namespace std;\nint turning(int num,int c)\n{\n    vector<int>a;\n    int NUM=num,x=0,gui=0;\n    for(int i=num;i>=0;i--)\n    {\n        if(pow(c,i)<=num)\n        {\n            \n            a.push_back(NUM/pow(c,i));\n            NUM=(int)num%(int)pow(c,i);\n            x++;\n        }\n    }\n    for(int j=0;j<x;j++)\n        gui=gui+a[j]*pow(10,x-1-j);\n    return gui;\n}\n\nbool huiwen(int k)\n{\n    vector<int>a;\n    \n    int c=0;\n    while(k!=0)\n    {\n        a.push_back(k%10);\n            k=k/10;\n        c++;\n    }\n    for(int i=0;i<c;i++)\n    {\n        if(a[i]!=a[c-1-i])\n            return 0;\n        \n    }\n    return 1;\n}\nint main()\n{\n    int B;\n    cin>>B;\n    for(int i=1;i<=300;i++)\n    {\n        if(huiwen(turning(i*i,B)))\n            cout<<i<<\"" \""<<turning(i*i,B)<<endl;\n            \n    }\n    \n}",TIME_LIMIT_EXCEEDED,3200,452
1533462189372321792,a5a94037eb90f29eef6fc050822bc6d8ab0b3a534c6a200fd675cec11927ce03,2022-06-05 22:54:10,C++,80.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint n,w;\nlong long pre[1000];\nstring Transform(int a){\n//\tprintf(\""a==%d\\n\"",a);\n\tstring ans;\n\tint st;\n\tfor(int i=w;i>=0;i--){\n\t\tif(a>=pre[i]){\n\t\t\tst=i;\n\t\t\tbreak;\n\t\t}\n\t}\n//\tprintf(\""st==%d\\n\"",st);\n\tfor(int i=st;i>=0;i--){\n\t\tif(a>=pre[i]){\n\t\t\tint x=a/pre[i];\n//\t\t\tprintf(\""x==%d %d\\n\"",x,pre[i]);\n\t\t\tif(x<10)ans+=char('0'+x);\n\t\t\telse ans+=char('A'+x-10);\n\t\t\ta-=x*pre[i];\n\t\t}\n\t\telse{\n\t\t\tans+='0';\n\t\t}\n\t}\n\t//cout<<\""ans==\""<<ans<<endl<<endl;\n\treturn ans;\n}\nbool check(int x){\n\tint xx=x*x;\n//\tif(xx%10==0)return 0;\n\tstring a=Transform(xx);\n\t//cout<<xx<<\"" \""<<a<<endl;\n\tint l=a.size();\n\tbool MK=1;\n\tfor(int i=0;i<l;i++){\n\t\tif(a[i]!=a[l-1-i])MK=0;\n\t}\n\treturn MK;\n}\nint main(){\n\tcin>>n;\n\tpre[0]=1;\n\tfor(int i=1;i;i++){\n\t\tpre[i]=pre[i-1]*n;\n\t\tif(pre[i]>300*300){\n\t\t\tw=i;\n\t\t\tbreak;\n\t\t}\n\t}\n\t//for(int i=1;i<=w;i++)printf(\""pre[%d]=%d\\n\"",i,pre[i]);\n//\tcout<<Transform(10201)<<\""!!!\""<<endl;\n\tfor(int i=1;i<=300;i++){\n\t\tif(check(i)){\n\t\t\tstring a=Transform(i*i);\n\t\t\tcout<<Transform(i)<<\"" \""<<a<<endl;\n\t\t}\n\t} \n}",ACCEPTED,32,452
1533470351198478336,52d99830c0a2ac3b867339bd03a8766ce5b9782399343d74cf69e0dca8d28ef8,2022-06-05 23:26:36,C++,10.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<iostream>\n#include <stdlib.h>\n#include<cstring>\n#include<algorithm>\nusing namespace std;\nstring intToA(int n,int radix) ;\nbool judge(char *s,int len);\nint main()\n{\n    int B;\n    cin>>B;\n//进制转换\n    int nums,n;\n    bool T;\n    char s[100];\n    string tp;\n    for(int k=1;k<=300;k++)\n    {\n        nums=k*k;\n        tp=intToA(nums, B);\n        strcpy(s,tp.c_str());\n        n=strlen(s);\n        T=judge(s,n);\n        if(T==1)\n        cout<<k<<\"" \""<<tp<<endl;\n    }\n\n/*数字介于1——300之间*/\n}\n//判断是否输出\nbool judge(char *s,int len)\n{\n    string c=s;\n    \n    for(int i=0;i<len;i++)\n    {\n        if(i<=len-i)\n        {\n            s[i]=s[len-1-i];  \n        }\n    }\n        if(s==c)\n        return true;\n        else return 0;\n}\n\nstring intToA(int n,int radix)    \n{\n\tstring ans=\""\"";\n    char tp;\n\tdo{\n\t\tint t=n%radix;\n\t\tif(t>=0&&t<=9)\tans+=t+'0';\n\t\telse \n        {\n            tp=(char)(t-10+'A');\n            ans.push_back(tp);\n        }\n\t\tn/=radix;\n\t}while(n!=0);\n\treverse(ans.begin(),ans.end());\n\treturn ans;\t\n}\n",PARTIAL_ACCEPTED,25,472
1533474908171366400,52d99830c0a2ac3b867339bd03a8766ce5b9782399343d74cf69e0dca8d28ef8,2022-06-05 23:44:43,C++,10.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<iostream>\n#include <stdlib.h>\n#include<cstring>\n#include<algorithm>\nusing namespace std;\nstring intToA(int n,int radix) ;\nbool judge(char *s,int len);\nint main()\n{\n    int B;\n    cin>>B;\n//进制转换\n    int nums,n;\n    bool T;\n    char s[100];\n    string tp;\n    for(int k=1;k<=300;k++)\n    {\n        nums=k*k;\n        tp=intToA(nums, B);\n        strcpy(s,tp.c_str());\n        n=strlen(s);\n        T=judge(s,n);\n        if(T==1)\n        cout<<k<<\"" \""<<tp<<endl;\n    }\n\n/*数字介于1——300之间*/\n}\n//判断是否输出\nbool judge(char *s,int len)\n{\n    string c=s;\n    \n    for(int i=0;i<len;i++)\n    {\n        if(i<=len-i)\n        {\n            s[i]=s[len-1-i];  \n        }\n    }\n        if(s==c)\n        return true;\n        else return 0;\n}\n\nstring intToA(int n,int radix)    \n{\n\tstring ans=\""\"";\n    char tp;\n\tdo{\n\t\tint t=n%radix;\n\t\tif(t>=0&&t<=9)\tans+=t+'0';\n\t\telse \n        {\n            tp=(char)(t-10+'A');\n            ans.push_back(tp);\n        }\n\t\tn/=radix;\n\t}while(n!=0);\n\treverse(ans.begin(),ans.end());\n\treturn ans;\t\n}\n",PARTIAL_ACCEPTED,32,456
1533476693632065536,a5a94037eb90f29eef6fc050822bc6d8ab0b3a534c6a200fd675cec11927ce03,2022-06-05 23:51:49,C++,70.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint n,w;\nint m,s; \nlong long pre[1000];\nstring Transform(int a){\n//\tprintf(\""a==%d\\n\"",a);\n\tstring ans;\n\tint st;\n\tfor(int i=w;i>=0;i--){\n\t\tif(a>=pre[i]){\n\t\t\tst=i;\n\t\t\tbreak;\n\t\t}\n\t}\n//\tprintf(\""st==%d\\n\"",st);\n\tfor(int i=st;i>=0;i--){\n\t\tif(a>=pre[i]){\n\t\t\tint x=a/pre[i];\n//\t\t\tprintf(\""x==%d %d\\n\"",x,pre[i]);\n\t\t\tif(x<10)ans+=char('0'+x);\n\t\t\telse ans+=char('A'+x-10);\n\t\t\ta-=x*pre[i];\n\t\t}\n\t\telse{\n\t\t\tans+='0';\n\t\t}\n\t}\n\t//cout<<\""ans==\""<<ans<<endl<<endl;\n\treturn ans;\n}\nbool check(int x){\n\tint xx=x;\n//\tif(xx%10==0)return 0;\n\tstring a=Transform(xx);\n\t//cout<<xx<<\"" \""<<a<<endl;\n\tint l=a.size();\n\tbool MK=1;\n\tfor(int i=0;i<l;i++){\n\t\tif(a[i]!=a[l-1-i])MK=0;\n\t}\n\treturn MK;\n}\nbool OK(int x){\n\tint ans=0;\n\tfor(int i=2;i<=10;i++){ \n\t\tpre[0]=1;\n\t\tfor(int j=1;j;j++){\n\t\t\tpre[j]=pre[j-1]*i;\n\t\t\tif(pre[j]>x){\n\t\t\t\tw=j;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tans+=check(x);\n\t\tif(ans>=2)return 1;\n\t}\n\treturn 0;\n}\nint main(){\n\tcin>>m>>s;\n\tint t=0;\n\tfor(int i=s+1;i;i++){\n\t//\tprintf(\""i==%d\\n\"",i);\n\t\tif(t==m)break;\n\t\tif(OK(i)){\n\t\t\tprintf(\""%d\\n\"",i);\n\t\t\tt++;\n\t\t}\n\t}\n}",ACCEPTED,27,452
1533477103440732160,52d99830c0a2ac3b867339bd03a8766ce5b9782399343d74cf69e0dca8d28ef8,2022-06-05 23:53:26,C++,0.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<iostream>\n#include <stdlib.h>\n#include<cstring>\n#include<algorithm>\nusing namespace std;\nstring intToA(int n,int radix) ;\nbool judge(char *s,int len);\nint main()\n{\n    int B;\n    cin>>B;\n//进制转换\n    int nums,n;\n    bool T;\n    char s[100];\n    string tp,tp2;\n    for(int k=1;k<=300;k++)\n    {\n        nums=k*k;\n        tp=intToA(nums, B);\n        strcpy(s,tp.c_str());\n        n=strlen(s);\n        tp2=intToA(k, B)\n        T=judge(s,n);\n        if(T==1)\n        cout<<tp2<<\"" \""<<tp<<endl;\n    }\n\n/*数字介于1——300之间*/\n}\n//判断是否输出\nbool judge(char *s,int len)\n{\n    string c=s;\n    \n    for(int i=0;i<len;i++)\n    {\n        if(i<=len-i)\n        {\n            s[i]=s[len-1-i];  \n        }\n    }\n        if(s==c)\n        return true;\n        else return 0;\n}\n\nstring intToA(int n,int radix)    \n{\n\tstring ans=\""\"";\n    char tp;\n\tdo{\n\t\tint t=n%radix;\n\t\tif(t>=0&&t<=9)\tans+=t+'0';\n\t\telse \n        {\n            tp=(char)(t-10+'A');\n            ans.push_back(tp);\n        }\n\t\tn/=radix;\n\t}while(n!=0);\n\treverse(ans.begin(),ans.end());\n\treturn ans;\t\n}\n",COMPILE_ERROR,0,0
1533477172747411456,52d99830c0a2ac3b867339bd03a8766ce5b9782399343d74cf69e0dca8d28ef8,2022-06-05 23:53:43,C++,80.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<iostream>\n#include <stdlib.h>\n#include<cstring>\n#include<algorithm>\nusing namespace std;\nstring intToA(int n,int radix) ;\nbool judge(char *s,int len);\nint main()\n{\n    int B;\n    cin>>B;\n//进制转换\n    int nums,n;\n    bool T;\n    char s[100];\n    string tp,tp2;\n    for(int k=1;k<=300;k++)\n    {\n        nums=k*k;\n        tp=intToA(nums, B);\n        strcpy(s,tp.c_str());\n        n=strlen(s);\n        tp2=intToA(k, B);\n        T=judge(s,n);\n        if(T==1)\n        cout<<tp2<<\"" \""<<tp<<endl;\n    }\n\n/*数字介于1——300之间*/\n}\n//判断是否输出\nbool judge(char *s,int len)\n{\n    string c=s;\n    \n    for(int i=0;i<len;i++)\n    {\n        if(i<=len-i)\n        {\n            s[i]=s[len-1-i];  \n        }\n    }\n        if(s==c)\n        return true;\n        else return 0;\n}\n\nstring intToA(int n,int radix)    \n{\n\tstring ans=\""\"";\n    char tp;\n\tdo{\n\t\tint t=n%radix;\n\t\tif(t>=0&&t<=9)\tans+=t+'0';\n\t\telse \n        {\n            tp=(char)(t-10+'A');\n            ans.push_back(tp);\n        }\n\t\tn/=radix;\n\t}while(n!=0);\n\treverse(ans.begin(),ans.end());\n\treturn ans;\t\n}\n",ACCEPTED,36,448
1533617477291319296,3119301d9585f08bcccf5e5b2b77c3c6154fe5cb8f59eff38071af66d7ffd75a,2022-06-06 09:11:14,C++,80.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<cstdio>\nusing namespace std;\nchar m[30] = { '0', '1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\nstring Switch(int x, int n)\n{\n    string s = \""\"";\n    while (x)\n    {\n        s += m[x % n];\n        x /= n;\n    }\n    reverse(s.begin(), s.end());\n    return s;\n}\nbool HuiWen(string s)\n{\n    int i = 0;\n    int j = s.size() - 1;\n    while (i < j)\n    {\n        if (s[i] != s[j]) \n            return false;\n        i++, j--;\n    }\n    return true;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    for (int i = 1; i <= 300; i++)\n    {\n        string num = Switch(i, n);\n        string Pnum = Switch(i * i, n);\n        if (HuiWen(Pnum))\n        {\n            cout << num << \"" \"" << Pnum << endl;\n        }\n    }\n    return 0;\n}\n",ACCEPTED,34,476
1533624021873565696,3119301d9585f08bcccf5e5b2b77c3c6154fe5cb8f59eff38071af66d7ffd75a,2022-06-06 09:37:14,C++,0.0,1511526337611964424,1267449136707624960,1049226397448056832,"\n#include<iostream>\n#include<algorithm>\n#include<cstdio>\nusing namespace std;\nchar m[30] = { '0', '1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\nstring Switch(int x, int n)\n{\n    string s = \""\"";\n    while (x)\n    {\n        s += m[x % n];\n        x /= n;\n    }\n    reverse(s.begin(), s.end());\n    return s;\n}\nbool HuiWen(string s)\n{\n    int i = 0;\n    int j = s.size() - 1;\n    while (i < j)\n    {\n        if (s[i] != s[j]) \n            return false;\n        i++, j--;\n    }\n    return true;\n}\n\nint main()\n{\n    int flag = 0;\n    int ans = 0;\n    int N;\n    int S;\n    string num;\n    cin >> N>>S;\n    for (int i = S; i <= 15; i++)\n    {\n        flag = 0;\n        for (int j = 2; j <= 10; j++)\n        {\n            num = Switch(i, j);\n            if (HuiWen(num))\n            {\n                flag++;\n                if (flag == 2)\n                {\n                    cout << i << endl;\n                    break;\n                }\n            }\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,27,604
1533625774547378176,3119301d9585f08bcccf5e5b2b77c3c6154fe5cb8f59eff38071af66d7ffd75a,2022-06-06 09:44:12,C++,70.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nint n, s;\nbool change(int n, int k) {\n    int index = 0, res[10000];\n    while (n != 0) {\n        res[index++] = n % k;\n        n /= k;\n    }\n    int i = 0, j = index - 1;\n    while (i < j)\n        if (res[i++] != res[j--])\n            return 0;\n    return 1;\n}\nint main() {\n    cin >> n >> s;\n    int temp = 0;\n    int i = s + 1;\n    while (temp < n) {\n        if (change(i, 2) + change(i, 10) + change(i, 3) + change(i, 4) + change(i, 5) + change(i, 6) +\n                change(i, 7) + change(i, 8) + change(i, 9) >=\n            2) {\n            temp++;\n            cout << i << endl;\n        }\n        i++;\n    }\n    return 0;\n}",ACCEPTED,31,464
1533638681733603328,8e4fc0411257cacce1b678605d18ac99161cb63491a7b2b756233d7bd689dd1c,2022-06-06 10:35:30,C++,70.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <string>\n\nusing namespace std;\n\ntypedef long long int LL;\n\nstring change(LL n, LL m)\n{\n    string str;\n\n    if (m <= 10)\n    {\n        while (n)\n        {\n            str += (n % m + '0');\n            n /= m;\n        }\n    }\n    else\n    {\n        while (n)\n        {\n            int x = n % m;\n            if (x >= 10)\n            {\n                x -= 10;\n                str += (x + 'A');\n            }\n            else\n                str += (x + '0');\n            n /= m;\n        }\n    }\n\n    return str;\n}\n\nbool is_Palindromic_Squares(string str)\n{\n    int len = str.size();\n    for (int i = 0; i <= len / 2 - 1; i++)\n    {\n        if (str[i] != str[len - i - 1])\n            return false;\n    }\n\n    return true;\n}\n\nint main()\n{\n    LL n, s;\n    cin >> n >> s;\n    int num = 0;\n    LL i, j;\n    for (i = s + 1; num < n; i++)\n    {\n        int t = 0;\n        for (j = 2; j <= 10; j++)\n        {\n            string str = change(i, j);\n            if (is_Palindromic_Squares(str) == true)\n                t++;\n            if (t == 2)\n            {\n                num++;\n                break;\n            }\n        }\n        if (j <= 10)\n            cout << i << endl;\n    }\n\n    return 0;\n}",ACCEPTED,31,488
1533702992766132224,4dd4eaebae5fda735a832d9b67fe8a1df5f0f0fecb0e8887c72c9781b7dd82a8,2022-06-06 14:51:02,C++,80.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<cstdio>\n#include<cstring>\n#include<algorithm>\nusing namespace std;\nint b;\ninline char c(int x){if(x>=0&&x<=9)return x+'0';return x-10+'A';}\nstruct node\n{\n    int l,a[20];//进制数最大长度为17\n    node(int x){for(l=0;x;l++)a[l]=x%b,x/=b;}//转换进制数，其中a[l-1]是最高位，a[0]是最低位\n    void out(){for(int i=l-1;i>=0;i--)printf(\""%c\"",c(a[i]));}//从高到低依次输出\n    bool tf(){for(int i=0;i<l;i++)if(a[i]!=a[l-i-1])return false;return true;}//判断这个数字是否是回文数，注意可以通过i<=l/2来加速，减少冗余运算\n};\nint main()\n{\n    scanf(\""%d\"",&b);\n    for(int i=1;i<=300;i++)//从1到300暴力枚举\n    {\n        node n(i*i);//将i*i转化为进制为b的整数\n        if(n.tf()){node m(i);m.out();putchar(' ');n.out();putchar('\\n');}//如果n是一个b进制下的回文数，输出答案\n    }\n    return 0;\n}",ACCEPTED,26,324
1533738051049074688,4dd4eaebae5fda735a832d9b67fe8a1df5f0f0fecb0e8887c72c9781b7dd82a8,2022-06-06 17:10:21,C++,70.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint num[300]={0,1,2,3,4,5,6,7,8,9,10,15,16,\n17,18,20,21,24,26,27,28,31,\n33,36,40,45,46,50,51,52,55,\n57,63,65,67,73,78,80,82,85,\n88,91,92,93,98,99,100,104,105,107,\n109,111,114,119,121,127,129,130,135,141,\n142,150,151,154,160,164,170,171,173,178,\n182,185,186,191,195,200,203,209,212,215,\n219,227,235,242,246,252,255,257,264,273,\n282,292,300,313,316,325,328,333,341,342,\n343,357,364,365,373,381,393,400,414,427,\n434,438,446,455,464,471,484,495,511,513,\n546,555,560,564,585,624,626,644,646,651,\n656,666,676,692,693,701,717,728,730,757,\n771,777,787,819,820,856,868,910,939,975,\n1023,1025,1066,1105,1221,1285,1312,1365,1432,1441,\n1460,1539,1550,1640,1667,1755,1885,2000,2188,2268,\n2293,2550,2565,2709,2730,2910,2920,2925,2997,3069,\n3074,3075,3280,3315,3550,3591,3640,3663,3735,3740,\n3855,3951,3999,4095,4097,4161,4225,4257,4289,4369,\n4433,4593,4617,4681,5001,5049,5125,5189,5397,5461,\n5740,5840,5854,6148,6200,6560,6562,6643,6697,6724,\n6761,6825,6886,6889,6953,7300,7373,7381,7409,7447,\n7462,7517,7667,7703,7777,7801,7997,8038,8119,8194,\n8200,8258,8281,8322,8386,8578,8778,8802,9009,9103,\n9201,9222,9490,9958,10252,10308,10658,10794,10858,10922,\n10986,11253,11314,11757,11898,11950,12291,12355,12419,12483, \n12547,12654,12691,13107,13124,13131,13205,13286,13299,13331};\nint n,s,g;\nint main()\n{\n\tcin>>n>>s;\n\tfor(g=1;num[g]<=s;g++);\n\tfor(int i=0;i<n;i++)cout<<num[g+i]<<endl;\n\treturn 0;\n}",ACCEPTED,33,468
1533994940047536128,52d99830c0a2ac3b867339bd03a8766ce5b9782399343d74cf69e0dca8d28ef8,2022-06-07 10:11:08,C++,70.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n\nbool ispal(int n,int k){\n    short res[100]={0},p=0;//res里装的是转换后的k进制数\n    while(n){\n        res[p++]=n%k;\n        n/=k;\n    }\n    int i=0,j=p-1;\n    while(i<j)\n        if(res[i++]!=res[j--])return 0;        //判断是不是回文\n    return 1;\n}\n\nint main(){\n    int n,s;\n    cin>>n>>s;\n    int ans=0;\n    for(int i=s+1;ans!=n;i++){\n        int cnt=0;\n        for(int j=2;j<=10&&cnt<2;j++){\n            if(ispal(i,j))cnt++;//在j进制下i为回文数，计数cnt++ \n        }\n        if(cnt>=2)printf(\""%d\\n\"",i),ans++;//若计数不小于2，则输出，答案计数ans++ \n    }\n    return 0;\n}",ACCEPTED,32,492
1533995637371543552,52d99830c0a2ac3b867339bd03a8766ce5b9782399343d74cf69e0dca8d28ef8,2022-06-07 10:13:54,C++,70.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n\nbool ispal(int n,int k){\n    short res[100]={0},p=0;//res里装的是转换后的k进制数\n    while(n){\n        res[p++]=n%k;\n        n/=k;\n    }\n    int i=0,j=p-1;\n    while(i<j)\n        if(res[i++]!=res[j--])return 0;        //判断是不是回文\n    return 1;\n}\n\nint main(){\n    int n,s;\n    cin>>n>>s;\n    int ans=0;\n    for(int i=s+1;ans!=n;i++)\n    {\n        int cnt=0;\n        for(int j=2;j<=10&&cnt<2;j++)\n        {\n            if(ispal(i,j))cnt++;//在j进制下i为回文数，计数cnt++ \n        }\n        if(cnt>=2)\n        {\n            printf(\""%d\\n\"",i),\n            ans++;\n        }\n        //若计数不小于2，则输出，答案计数ans++ \n    }\n    return 0;\n}",ACCEPTED,32,492
1533995937260085248,52d99830c0a2ac3b867339bd03a8766ce5b9782399343d74cf69e0dca8d28ef8,2022-06-07 10:15:06,C++,70.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n\nbool ispal(int n,int k)\n{\n    short res[100]={0},p=0;//res里装的是转换后的k进制数\n    while(n){\n        res[p++]=n%k;\n        n/=k;\n    }\n    int i=0,j=p-1;\n    while(i<j)\n        if(res[i++]!=res[j--])return 0;        //判断是不是回文\n    return 1;\n}\n\nint main(){\n    int n,s;\n    cin>>n>>s;\n    int ans=0;\n    for(int i=s+1;ans!=n;i++)\n    {\n        int cnt=0;\n        for(int j=2;j<=10&&cnt<2;j++)\n        {\n            if(ispal(i,j))cnt++;//在j进制下i为回文数，计数cnt++ \n        }\n        if(cnt>=2)\n        {\n            printf(\""%d\\n\"",i),\n            ans++;\n        }\n        //若计数不小于2，则输出，答案计数ans++ \n    }\n    return 0;\n}",ACCEPTED,25,452
1533995948718923776,52d99830c0a2ac3b867339bd03a8766ce5b9782399343d74cf69e0dca8d28ef8,2022-06-07 10:15:09,C++,70.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n\nbool ispal(int n,int k)\n{\n    short res[100]={0},p=0;//res里装的是转换后的k进制数\n    while(n){\n        res[p++]=n%k;\n        n/=k;\n    }\n    int i=0,j=p-1;\n    while(i<j)\n        if(res[i++]!=res[j--])return 0;        //判断是不是回文\n    return 1;\n}\n\nint main(){\n    int n,s;\n    cin>>n>>s;\n    int ans=0;\n    for(int i=s+1;ans!=n;i++)\n    {\n        int cnt=0;\n        for(int j=2;j<=10&&cnt<2;j++)\n        {\n            if(ispal(i,j))cnt++;//在j进制下i为回文数，计数cnt++ \n        }\n        if(cnt>=2)\n        {\n            printf(\""%d\\n\"",i),\n            ans++;\n        }\n        //若计数不小于2，则输出，答案计数ans++ \n    }\n    return 0;\n}",ACCEPTED,32,480
1534195227395862528,e848e6b844fa1609c1081fafccef5d8b004a4ad3be7068816553ef0ace1ebb27,2022-06-07 23:27:00,C++,0.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nchar a[] = { \""22233344455566670778889990\"" };\nint main() {\n    char n[14];\n    scanf(\""%s\"", n);\n    int len = strlen(n);\n    int flag = 0;\n    int cnt = 0;\n    for (int i = 1; i <= 4617; i++) {\n        flag = 0;\n        char temp[14];\n        scanf(\""%s\"", temp);\n        int len2 = strlen(temp);\n        if (len == len2) {\n            for (int j = 0; j < len; j++) {\n                if (n[j] != a[temp[j] - 'A']) {\n                    flag = 1;\n                    break;\n                }\n            }\n            if (!flag) {\n                printf(\""%s\\n\"", temp);\n                cnt++;\n            }\n        }\n    }\n    if (!cnt) {\n        cout << \""NONE\"" << endl;\n    }\n    return 0;\n}\n",WRONG_ANSWER,56,472
1534195703747145728,e848e6b844fa1609c1081fafccef5d8b004a4ad3be7068816553ef0ace1ebb27,2022-06-07 23:28:54,C++,80.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<cstdio>\n#include<cstring>\n#include<cmath>\n#include<iostream>\n#include<algorithm>\nusing namespace std;\nstring solve(int a,int b);\nbool flag;\nint main()\n{\n        int n;\n        cin>>n;\n        for(int i=1;i<=300;i++)\n        {\n                string  a=solve(i,n);\n               string b=solve(i*i,n);\n                if(flag) cout<<a<<' '<<b<<endl;\n        }\n        return 0;\n}\nstring solve(int a,int b)\n{\n    string d;\n        d.clear();\n    int i=0;\n    char c;\n    while(a%b!=a)\n    {\n        i=a%b;\n        if(i>=10) c=char(i+55);\n        else c=i+'0';\n        a=a/b;\n       d.push_back(c);\n    }\n    if(a>=10) c=char(a+55);\n    else c=a+'0';\n    d.push_back(c);\n    string e=d;\n    reverse(d.begin(),d.end());\n    if(e==d) flag=1;\n    else flag=0;\n    return d;\n}\n\n",ACCEPTED,29,476
1534206744694583296,07e05c35cd1416def6b50d6eb566c16e2277826cc78a0972942e9351776c6fe5,2022-06-08 00:12:46,C++,80.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm> \nusing namespace std;\n\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1]) \n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1) // 是回文数；\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，使用模N取余法；\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\t\n        {\n            ans += t + '0';\n        }\n        else \n        {\n            ans += t - 10 + 'A'; // 保证进制大于10时，数字能用大写字母表示；\n        }\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（），以防止输入为0的情况；\n    reverse(ans.begin(), ans.end());  // 模N取余法，得到的字符串反转即可得到对应进制的数；\n    return ans;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    int j = 0;\n    for (int x = 1; x <= 300; x++)\n    {\n        j = x; // 创建副本\n        \n        string s1 = intToA(j, n);      // 将整数按n进制转换；\n        string s2 = intToA((j * j), n);// 将该数的平方按n进制转换；\n\n        if (Palin_num(s2))\n        {\n            cout << s1 << \"" \"" << s2 << endl;\n        }\n        else\n        {\n            continue;\n        }\n    }\n    return 0;\n}\n",ACCEPTED,24,448
1534902138168905728,e848e6b844fa1609c1081fafccef5d8b004a4ad3be7068816553ef0ace1ebb27,2022-06-09 22:16:01,C++,70.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\nint j,k,cnt;\nstring s;\nvoid  change(int x,int n)\n{\n    while(x)\n    {\n        if(x%n>=0&&x%n<=9)\n    s+=(x%n+'0');\n    else\n         s+=(x%n+'A'-10);\n      x/=n;\n    }\n}\nint main()\n{\n    cin>>j>>k;\n    for(int v=k+1;;v++)\n    {\n        int cntt=0;\n    for(int i=2;i<=10;i++)\n   {\n       s.clear();\n    change(v,i);\n    string k(s.begin(),s.end());\n   reverse(s.begin(),s.end());\n   if(s==k)\n   {\n       cntt++;\n       //cout<<cntt;\n       if(cntt==2)\n       {\n           cout<<v<<endl;\n           cnt++;\n           break;\n       }\n   }\n   }\n   if(cnt==j)break;\n    }\n    return 0;\n}",ACCEPTED,32,460
1535165015740092416,e0ffee3a631c636ac4f28170c39b085e2aa97b611a9e678c8b15ea9dc0f41e5f,2022-06-10 15:40:36,C++,80.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<cstdio>\n#include<algorithm>\n#include<cmath> \n#include<cstring>\n#include<string>\nusing namespace std;\nint n;\nint a[1000005],b[100005];\nint main()\n{\n\tscanf(\""%d\"",&n);\n\tfor (int i=1;i<=300;i++)\n\t{\n\t\tint tot=0;\n\t\tint j=i*i;\n\t\t\n\t\twhile (j)\n\t\t{\n\t\t\ta[++tot]=j%n;\n\t\t\tj=j/n;\n\t\t}\n\t\tbool o=true;\n\t\tfor (int i=1;i<=tot/2;i++) if (a[i]!=a[tot-i+1]) o=false;\n\t\tif (o)\n\t\t{\n\t\t\tj=i;\n\t\t\tint op=0;\n\t\t\twhile (j) \n\t\t\t{\n\t\t\t\tb[++op]=j%n;\n\t\t\t\tj=j/n;\n\t\t\t}\n\t\t\tfor (int l=op;l>0;l--) if (b[l]>=10) printf(\""%c\"",(char)(b[l]+'A'-10)/*就是这里，对于c++字符与整形的转换还不是特别熟习啊*/);else printf(\""%d\"",b[l]);\n\t\t\tprintf(\"" \"");\n\t\t\tfor (int l=tot;l>0;l--) if (a[l]>=10) printf(\""%c\"",(char)(a[l]+'A'-10));else printf(\""%d\"",a[l]);\n\t\t\tprintf(\""\\n\""); \n\t\t}\n\t}\t\n\treturn 0; \n}",ACCEPTED,21,356
1535258839443279872,e0ffee3a631c636ac4f28170c39b085e2aa97b611a9e678c8b15ea9dc0f41e5f,2022-06-10 21:53:25,C++,0.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cmath>\nusing namespace std;\nbool isHuiwen(int n) {\n\tint a = n / 10000;\n\tint b = (n / 1000)%10;\n\tint c = (n / 100) % 10;\n\tint d = (n / 10) % 10;\n\tint e = n % 10;\n\tif (e * 10000 + d * 1000 + c * 100 + b * 10 + a == n)\n\t\treturn true;\n\telse\n\t\treturn false;\n\n}\nbool isPrime(int n) {\n\tfor (int i = 2; i < sqrt(n); i++) {\n\t\tif (n % i == 0)\n\t\t\treturn false;\n\t}\n\treturn true;\n}\nint main() {\n\tfor (int i = 10001; i < 99999; i++) {\n\t\tif (isHuiwen(i) && isPrime(i))\n\t\t\tcout << i << \""  \"";\n\t}\n}\n",WRONG_ANSWER,35,452
1535259011678183424,e0ffee3a631c636ac4f28170c39b085e2aa97b611a9e678c8b15ea9dc0f41e5f,2022-06-10 21:54:06,C++,0.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include<stdio.h>\n#include<string.h>\nint main()\n{\n\tchar str1[2000],str2[2000],k;\n\tint n,s,i,t1,d,j,len,sum,t3;\n\twhile(~scanf(\""%d%d\"",&n,&s))\n\t{\n\t\tfor(i=s+1;;i++)\n\t\t{\n\t\t\tsum=0\n\t\t\tfor(j=2;j<=10;j++)\n\t\t\t{\n\t\t\t\tt1=i;len=0;t3=0;\n\t\t\t\twhile(t1)\n\t\t\t\t{\n\t\t\t\t\td=t1%j;\n\t\t\t\t\tstr1[len++]=\""0123456789\""[d];\n\t\t\t\t\tt1/=j;\n\t\t\t\t}\n\t\t\t\tstr1[len]='\\0';\n\t\t\t\tfor(k=len-1;k>=0;k--)//这两步我自己感觉用strcpy和strrev更简单，但是我在提交的那个网站把strrev给封杀了，一用就编译错误，无奈只能用循环\n\t\t\t\t\tstr2[t3++]=str1[k];\n\t\t\t\tstr2[t3]='\\0';\n\t\t\t\tif(strcmp(str1,str2)==0)\n\t\t\t\t\tsum++;\n\t\t\t}\n\t\t\tif(sum>=2)\n\t\t\t{\n\t\t\t\tn--;\n\t\t\t\tprintf(\""%d\\n\"",i);\n\t\t\t}\t\n\t\t\tif(n==0)\n\t\t\t\tbreak;\n\t\t}\n\t}\n\treturn 0;\n}\n",COMPILE_ERROR,0,0
1535259102610690048,e0ffee3a631c636ac4f28170c39b085e2aa97b611a9e678c8b15ea9dc0f41e5f,2022-06-10 21:54:28,C++,70.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include<stdio.h>\n#include<string.h>\nint main()\n{\n\tchar str1[2000],str2[2000],k;\n\tint n,s,i,t1,d,j,len,sum,t3;\n\twhile(~scanf(\""%d%d\"",&n,&s))\n\t{\n\t\tfor(i=s+1;;i++)\n\t\t{\n\t\t\tsum=0;\n\t\t\tfor(j=2;j<=10;j++)\n\t\t\t{\n\t\t\t\tt1=i;len=0;t3=0;\n\t\t\t\twhile(t1)\n\t\t\t\t{\n\t\t\t\t\td=t1%j;\n\t\t\t\t\tstr1[len++]=\""0123456789\""[d];\n\t\t\t\t\tt1/=j;\n\t\t\t\t}\n\t\t\t\tstr1[len]='\\0';\n\t\t\t\tfor(k=len-1;k>=0;k--)//这两步我自己感觉用strcpy和strrev更简单，但是我在提交的那个网站把strrev给封杀了，一用就编译错误，无奈只能用循环\n\t\t\t\t\tstr2[t3++]=str1[k];\n\t\t\t\tstr2[t3]='\\0';\n\t\t\t\tif(strcmp(str1,str2)==0)\n\t\t\t\t\tsum++;\n\t\t\t}\n\t\t\tif(sum>=2)\n\t\t\t{\n\t\t\t\tn--;\n\t\t\t\tprintf(\""%d\\n\"",i);\n\t\t\t}\t\n\t\t\tif(n==0)\n\t\t\t\tbreak;\n\t\t}\n\t}\n\treturn 0;\n}\n",ACCEPTED,30,472
1535592220798459904,f10c312d797d329ea793fc156f937e4a37b51e69675ed1666fb4f04880edee2e,2022-06-11 19:58:10,C++,80.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm> \nusing namespace std;\n\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1]) \n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1) // 是回文数；\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，使用模N取余法；\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\t\n        {\n            ans += t + '0';\n        }\n        else \n        {\n            ans += t - 10 + 'A'; // 保证进制大于10时，数字能用大写字母表示；\n        }\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（），以防止输入为0的情况；\n    reverse(ans.begin(), ans.end());  // 模N取余法，得到的字符串反转即可得到对应进制的数；\n    return ans;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    int j = 0;\n    for (int x = 1; x <= 300; x++)\n    {\n        j = x; // 创建副本\n        \n        string s1 = intToA(j, n);      // 将整数按n进制转换；\n        string s2 = intToA((j * j), n);// 将该数的平方按n进制转换；\n\n        if (Palin_num(s2))\n        {\n            cout << s1 << \"" \"" << s2 << endl;\n        }\n        else\n        {\n            continue;\n        }\n    }\n    return 0;\n}\n",ACCEPTED,24,488
1535592504887050240,f10c312d797d329ea793fc156f937e4a37b51e69675ed1666fb4f04880edee2e,2022-06-11 19:59:17,C++,0.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nbool huiwen(string s)\n{\n\tint n = s.length();\n\tfor (int i = 0; i <= n / 2; ++i)\n\t{\n\t\tif (s[i] != s[n - i - 1])\n\t\t\treturn false;\n\t}\n\treturn true;\n}\nstring ten_to_r(int n, int r)\n{\n\tchar str[10005] = {0};\n\tstack<int> st;\n\twhile (n != 0)\n\t{\n\t\tst.push(n % r);\n\t\tn = n / r;\n\t}\n\tint i = 0;\n\twhile (!st.empty()) //将数字转成字符\n\t{\n\t\tint s = st.top();\n\t\tif (s >= 10)\n\t\t\tstr[i++] = s - 10 + 'A'; // 大于10的数字转成字符，比如11->B 12->C\n\t\telse\n\t\t\tstr[i++] = s + '0'; //小于10的数字转成字符\n\t\tst.pop();\n\t}\n\n\treturn str;\n}\n\nint main()\n{\n\tfreopen(\""dualpal.in\"", \""r\"", stdin);\n\tfreopen(\""dualpal.out\"", \""w\"", stdout);\n\tint n, s;\n\tcin >> n >> s;\n\tint sum2 = 0; //统计满足大于等于2个进制是回文数总个数\n\twhile (++s)\n\t{\n\t\tif (sum2 >= n)\n\t\t\tbreak;\n\t\tint sum1 = 0; //枚举每一个数的时候需要重新对这个数满足进制是回文数的进行计数\n\t\tfor (int r = 2; r <= 10; ++r)\n\t\t{\n\t\t\tstring ss = ten_to_r(s, r);\n\t\t\tif (huiwen(ss))\n\t\t\t{\n\t\t\t\tsum1++;\n\t\t\t\tif (sum1 >= 2)\n\t\t\t\t{\n\t\t\t\t\tsum2++;\n\t\t\t\t\tcout << s << endl;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}",MULTIPLE_ERROR,1610,460
1535592636357505024,f10c312d797d329ea793fc156f937e4a37b51e69675ed1666fb4f04880edee2e,2022-06-11 19:59:49,C++,0.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h> \nusing namespace std;\nbool huiwen(string s)//12321 判断是否为回文数 \n{\n\tint n = s.length();\n\tfor(int i = 0; i <= n/2; ++i)\n\t{\n\t\tif(s[i] != s[n-i-1]) return false;\n\t}\n\treturn true;\n}\n \n \nstring ten_to_r(int n, int r)//将十进制的n转为r进制 \n{\n\tchar str[10005]={0};//记得要初始化，否则结果是错的 \n\tstack<int> st;\n\twhile(n!=0)\n\t{\n\t\tst.push(n%r); \n\t\tn = n/r;\n\t}\n\tint i = 0;\n\twhile(!st.empty())//将数字转成字符 \n\t{\n\t\tint s = st.top();\n\t\tif(s >= 10)\tstr[i++] = s - 10 + 'A';// 大于10的数字转成字符，比如11->B 12->C \n\t\telse str[i++] = s+'0';//小于10的数字转成字符 \n\t\tst.pop();\n\t}\n \n\treturn str;\n}\n \nint main()\n{\n\tfreopen(\""dualpal.in\"",\""r\"",stdin);\n\tfreopen(\""dualpal.out\"",\""w\"",stdout);\n\tint n, s;\n\tcin >> n >> s;\n\tint sum2 = 0;//统计满足大于等于2个进制是回文数总个数 \n\twhile(++s)\n\t{\n\t\tif(sum2 >= n) break;\n\t\tint sum1 = 0;//枚举每一个数的时候需要重新对这个数满足进制是回文数的进行计数 \n\t\tfor(int r = 2; r <= 10; ++r)\n\t\t{\n\t\t\tstring ss = ten_to_r(s,r);\n\t\t\tif(huiwen(ss))\n\t\t\t{\n\t\t\t\tsum1++;\n\t\t\t\tif(sum1 >= 2)\n\t\t\t\t{\n\t\t\t\t\tsum2++;\n\t\t\t\t\tcout << s << endl; \n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n} ",MULTIPLE_ERROR,1213,608
1535592908114853888,f10c312d797d329ea793fc156f937e4a37b51e69675ed1666fb4f04880edee2e,2022-06-11 20:00:53,C++,70.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n\nbool Palin_num(const string a)\n{\n\tint length;\n\tlength = a.length();\n\tint flag = 1;\n\tfor (int i = 0; i <= (length / 2); i++)\n\t{\n\t\tif (a[i] != a[length - i - 1])\n\t\t{\n\t\t\tflag = 0;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif (flag == 1) // 是回文数；\n\t{\n\t\treturn true;\n\t}\n\telse\n\t{\n\t\treturn false;\n\t}\n}\n\nstring intToA(int n, int radix)\n{\n\tstring ans = \""\"";\n\tdo\n\t{\n\t\tint t = n % radix;\n\t\tif (t >= 0 && t <= 9)\n\t\t{\n\t\t\tans += t + '0';\n\t\t}\n\t\telse\n\t\t{\n\t\t\tans += t - 10 + 'A';\n\t\t}\n\t\tn /= radix;\n\t} while (n != 0);\n\treverse(ans.begin(), ans.end());\n\treturn ans;\n}\n\nint main()\n{\n\tint n, s;\n\tcin >> n >> s;\n\ts++;\n\tvector<int> p;\n\tint sum;\n\twhile ((p.size() < n))\n\t{\n\t\tsum = 0;\n\t\tfor (int i = 2; i <= 10; i++)\n\t\t{\n\t\t\tif (Palin_num(intToA(s, i))) // 此时对应进制的数是回文数\n\t\t\t{\n\t\t\t\tsum++; // 记录次数+1\n\t\t\t}\n\t\t}\n\t\tif (sum >= 2) // 双重回文数，压入容器p中\n\t\t{\n\t\t\tp.push_back(s);\n\t\t}\n\t\ts++; // 继续遍历\n\t}\n\tfor (int i = 0; i < p.size(); i++)\n\t{\n\t\tcout << p[i] << endl;\n\t}\n\treturn 0;\n}\n",ACCEPTED,32,460
1536028036976836608,84ef772e9e9cd526529c56cf2a788dc7b9dab482e72b911f64f9b91998b14792,2022-06-13 00:49:56,C++,80.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include <stdio.h>\n\nchar c[20] = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J'};\nint n;\nint fun(int num)\n{\n    num *= num;\n    char a[1000];\n    int i = 1;\n    while (num)\n    {\n        a[i] = c[num % n];\n        num /= n;\n        i++;\n    }\n    i--;\n    int flag = 1;\n    for (int j = 1; j <= i / 2; j++)\n    {\n        if (a[j] != a[i - j + 1])\n        {\n            flag = 0;\n            break;\n        }\n    }\n    return flag;\n}\n\nvoid print(int num)\n{\n    int temp = num;\n    char a[1000];\n    int i = 1;\n    while (num)\n    {\n        a[i] = c[num % n];\n        num /= n;\n        i++;\n    }\n    i--;\n    for (i; i >= 1; i--)\n        printf(\""%c\"", a[i]);\n    printf(\"" \"");\n    num = temp * temp;\n    i = 1;\n    while (num)\n    {\n        a[i] = c[num % n];\n        num /= n;\n        i++;\n    }\n    i--;\n    for (i; i >= 1; i--)\n        printf(\""%c\"", a[i]);\n    printf(\""\\n\"");\n}\n\nint main()\n{\n    while (~scanf(\""%d\"", &n))\n    {\n        for (int i = 1; i <= 300; i++)\n        {\n            if (fun(i) == 1)\n                print(i);\n        }\n    }\n    return 0;\n}",ACCEPTED,17,316
1536028124583260160,84ef772e9e9cd526529c56cf2a788dc7b9dab482e72b911f64f9b91998b14792,2022-06-13 00:50:17,C++,70.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nint n, s;\nbool change(int n, int k)\n{\n    int index = 0, res[10000];\n    while (n != 0)\n    {\n        res[index++] = n % k;\n        n /= k;\n    }\n    int i = 0, j = index - 1;\n    while (i < j)\n        if (res[i++] != res[j--])\n            return 0;\n    return 1;\n}\nint main()\n{\n    cin >> n >> s;\n    int temp = 0;\n    int i = s + 1;\n    while (temp < n)\n    {\n        if (change(i, 2) + change(i, 10) + change(i, 3) + change(i, 4) + change(i, 5) + change(i, 6) +\n                change(i, 7) + change(i, 8) + change(i, 9) >=\n            2)\n        {\n            temp++;\n            cout << i << endl;\n        }\n        i++;\n    }\n    return 0;\n}",ACCEPTED,23,452
1537329372733341696,6024b8d873019213f7f9a943755fcd01fc632e4e0f3130de5b2f4c9907cdf6c2,2022-06-16 15:00:59,C++,0.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include <bitsdc++.h>\nusing namespace std;\nint n, s;\nbool change(int n, int k) {\n    int index = 0, res[10000];\n    while (n != 0) {\n        res[index++] = n % k;\n        n /= k;\n    }\n    int i = 0, j = index - 1;\n    while (i < j)\n        if (res[i++] != res[j--])\n            return 0;\n    return 1;\n}\nint main() {\n    cin >> n >> s;\n    int temp = 0;\n    int i = s + 1;\n    while (temp < n) {\n        if (change(i, 2) + change(i, 10) + change(i, 3) + change(i, 4) + change(i, 5) + change(i, 6) +\n                change(i, 7) + change(i, 8) + change(i, 9) >=\n            2) {\n            temp++;\n            cout << i << endl;\n        }\n        i++;\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1537329447199010816,6024b8d873019213f7f9a943755fcd01fc632e4e0f3130de5b2f4c9907cdf6c2,2022-06-16 15:01:17,C++,70.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include <bits/stdc++.h>\nusing namespace std;\nint n, s;\nbool change(int n, int k) {\n    int index = 0, res[10000];\n    while (n != 0) {\n        res[index++] = n % k;\n        n /= k;\n    }\n    int i = 0, j = index - 1;\n    while (i < j)\n        if (res[i++] != res[j--])\n            return 0;\n    return 1;\n}\nint main() {\n    cin >> n >> s;\n    int temp = 0;\n    int i = s + 1;\n    while (temp < n) {\n        if (change(i, 2) + change(i, 10) + change(i, 3) + change(i, 4) + change(i, 5) + change(i, 6) +\n                change(i, 7) + change(i, 8) + change(i, 9) >=\n            2) {\n            temp++;\n            cout << i << endl;\n        }\n        i++;\n    }\n    return 0;\n}\n",ACCEPTED,22,452
1537717659465654272,fcf835a52e905e57e2030ba8f55d45b4ae85926499410586b0aa2521343219f3,2022-06-17 16:43:54,C++,80.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <cstring>\nusing namespace std;\nstring mp = \""0123456789ABCDEFGHIJKL\"";\nstring pp(int x, int b) {\n    string s = \""\"";\n    while (x > 0) {\n        s = mp[x % b] + s;\n        x /= b;\n    }\n    return s;\n}\n\n\nvoid check(int a, int b) {\n    string s = pp(a * a, b);\n    int i = 0, j = s.size() - 1;\n    while (s[i] == s[j] && i < j) {\n        i ++;\n        j --;\n    }\n    if (i >= j) {\n        cout << pp(a, b) << \"" \"" << s << endl;\n    }\n}\n\n\nint main() {\n    int b;\n    cin >> b;\n    for (int i = 1; i <= 300; ++ i) {\n        check(i, b);\n    }\n    return 0;\n}\n",ACCEPTED,35,612
1537740820861128704,bbd2078a7698560e8d7d13262afacb38c972714e6dfb834f70d18a859b4b7f17,2022-06-17 18:15:56,C++,80.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <cstdio>\n\nusing namespace std;\n\nchar m[30] = { '0', '1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\n\nstring Switch(int x, int n)\n{\n    string s = \""\"";\n\n    while (x)\n    {\n        s += m[x % n];\n        x /= n;\n    }\n    reverse(s.begin(), s.end());\n\n    return s;\n}\n\nbool HuiWen(string s)\n{\n    int i = 0;\n    int j = s.size() - 1;\n\n    while (i < j)\n    {\n        if (s[i] != s[j]) return false;\n        i++, j--;\n    }\n\n    return true;\n}\n\nint main()\n{\n    int n;\n    cin >> n;int a=21;\nif(a!=212)\n \n    for (int i = 1; i <= 300; i++)\n    {\n        string num = Switch(i, n);\n        string Pnum = Switch(i * i, n);\n        if (HuiWen(Pnum)) cout << num << \"" \"" << Pnum << endl;\n    }\n\n    return 0;\n}",ACCEPTED,29,452
1537740854788857856,bbd2078a7698560e8d7d13262afacb38c972714e6dfb834f70d18a859b4b7f17,2022-06-17 18:16:04,C++,70.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <string>\n\nusing namespace std;\n\ntypedef long long int LL;\n\nstring change(LL n, LL m)\n{\n    string str;\n\n    if (m <= 10)\n    {\n        while (n)\n        {\n            str += (n % m + '0');\n            n /= m;\n        }\n    }\n    else\n    {\n        while (n)\n        {\n            int x = n % m;\n            if (x >= 10)\n            {\n                x -= 10;\n                str += (x + 'A');\n            }\n            else\n                str += (x + '0');\n            n /= m;\n        }\n    }\n\n    return str;\n}\n\nbool is_Palindromic_Squares(string str)\n{\n    int len = str.size();\n    for (int i = 0; i <= len / 2 - 1; i++)\n    {\n        if (str[i] != str[len - i - 1])\n            return false;\n    }\n\n    return true;\n}\n\nint main()\n{\n    LL n, s;\n    cin >> n >> s;\n    int num = 0;\n    LL i, j;\n    for (i = s + 1; num < n; i++)\n    {\n        int t = 0;\n        for (j = 2; j <= 10; j++)\n        {\n            string str = change(i, j);\n            if (is_Palindromic_Squares(str) == true)\n                t++;\n            if (t == 2)\n            {\n                num++;\n                break;\n            }\n        }int a=21;\nif(a!=212)\n \n        if (j <= 10)\n            cout << i << endl;\n    }\n\n    return 0;\n}",ACCEPTED,27,452
1538078514136981504,ed50f20a12508602e8a46571a4ecb64bd12f3f1892dcb5cc2a231e16e42fc7ba,2022-06-18 16:37:48,C++,70.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nint fun(int n, int x)\n{\n    int len = 0, j;\n    int a[35];\n    while (n)\n    {\n        a[len++] = n % x;\n        n /= x;\n    }\n    for (j = 0; j < len / 2; j++)\n    {\n        if (a[j] == a[len - 1 - j])\n            continue;\n        else\n            return 0;\n    }\n    return 1;\n}\nint main()\n{\n    int f, k = 0, s;\n    cin >> f >> s;\n    while (k < f)\n    {\n        int m = 0;\n        s += 1;\n        for (int i = 2; i <= 10; i++)\n        {\n            if (fun(s, i))\n            {\n                m++;\n            }\n        }\n        if (m >= 2)\n        {\n            cout << s << endl;\n            k++;\n        }\n    }\n    return 0;\n}",ACCEPTED,26,444
1538155128656994304,f72ee593b10ff8d347932b8b4e757bc82921af8a449d15188979e1346bf9e321,2022-06-18 21:42:14,C++,50.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<stdio.h>\nint fun1(int n,int x){\n\tint i=0,m=x*x,j,a[100],b[100],k=0;\n\twhile(x!=0){\n\t\tb[k++]=x%n;\n\t\tx=x/n;\n\t}\n\twhile(m!=0){\n\t\ta[i++]=m%n;\n\t\tm=m/n;\n\t}\n\tfor(j=0;j<i/2;j++){\n\t\tif(a[j]!=a[i-j-1]) return 0;\n\t}\n\tfor(j=k-1;j>0;j--)\n\t    printf(\""%d\"",b[j]);\n\tprintf(\""%d \"",b[j]);\n\tfor(j=0;j<i-1;j++)\n\t    printf(\""%d\"",a[j]);\n\tprintf(\""%d\\n\"",a[j]);\n}\nint main(){\n\tint n,i;\n\tscanf(\""%d\"",&n);\n\tfor(i=1;i<=300;i++){\n\t\tfun1(n,i);\n\t}\n}",PARTIAL_ACCEPTED,26,344
1538157513114611712,f72ee593b10ff8d347932b8b4e757bc82921af8a449d15188979e1346bf9e321,2022-06-18 21:51:43,C++,0.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <vector>\n#include <string>\n#include <algorithm>\nusing namespace std;\n//模拟加法运算\nvoid add(string numList,string rNumList,string &result){\n    int carry{0};\n    result.clear();//先清空数组\n    for(int i=(int)numList.size()-1;i>=0;i--){\n        result.push_back((numList[i]- '0' + rNumList[i] - '0' + carry) % 10 + '0');\n        carry = (numList[i]-'0'+rNumList[i]-'0' +carry)/10;\n    }\n    if(carry)result.push_back('1');\n    reverse(result.begin(),result.end()); //\n}\nbool isPalindromicNumber(string &str){\n    string rstr=str;\n    reverse(rstr.begin(),rstr.end());\n    return rstr==str;\n}\nint main(){\n    string str;\n    cin >> str;\n    bool findPalindromicNumber{false};\n    string numList;\n    string rNumList;\n    string result;\n    numList=str;\n    if(isPalindromicNumber(numList)){\n        cout << numList <<\"" is a palindromic number.\""<<endl;\n    }else{\n        for(int i=0;i<10;i++){\n            rNumList=numList;\n            reverse(rNumList.begin(),rNumList.end());\n            add(numList,rNumList,result);\n            cout << numList <<\"" + \"" <<rNumList <<\"" = \"" << result<<endl;\n            if(isPalindromicNumber(result)){\n                cout << result <<\"" is a palindromic number.\""<<endl;\n                findPalindromicNumber=true;\n                break;\n            }else{\n                numList.assign(result.begin(), result.end());//将result赋值给numList 重新进行计算\n            }\n        }\n        if(!findPalindromicNumber){\n            printf(\""Not found in 10 iterations.\\n\"");\n        }\n    }\n    return 0;\n}",WRONG_ANSWER,33,500
1538160293590044672,f72ee593b10ff8d347932b8b4e757bc82921af8a449d15188979e1346bf9e321,2022-06-18 22:02:46,C++,80.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <algorithm>\n#include <cstring>\nusing namespace std;\nstring mp = \""0123456789ABCDEFGHIJKL\"";\nstring pp(int x, int b) {\n    string s = \""\"";\n    while (x > 0) {\n        s = mp[x % b] + s;\n        x /= b;\n    }\n    return s;\n}\n\n\nvoid check(int a, int b) {\n    string s = pp(a * a, b);\n    int i = 0, j = s.size() - 1;\n    while (s[i] == s[j] && i < j) {\n        i ++;\n        j --;\n    }\n    if (i >= j) {\n        cout << pp(a, b) << \"" \"" << s << endl;\n    }\n}\n\n\nint main() {\n    int b;\n    cin >> b;\n    for (int i = 1; i <= 300; ++ i) {\n        check(i, b);\n    }\n    return 0;\n}\n",ACCEPTED,33,496
1538194466136616960,f72ee593b10ff8d347932b8b4e757bc82921af8a449d15188979e1346bf9e321,2022-06-19 00:18:33,C++,70.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <sstream>\n#include <string>\n#include <cmath>\nusing namespace std;\nint hw(int s)\n{\n    int ans=0;\n    for(int i=2;i<=10;i++)\n    {\n        if(ans==2) break;\n        int s0=s,j=0;\n        long long x=0;\n        while(s0)\n        {\n            x+=(s0%i)*pow(10,j);\n            s0/=i;\n            j++;\n        }\n        //cout<<x<<endl;\n        stringstream t;\n        string s;\n        t<<x;\n        t>>s;\n        int ls=s.size(),l=0;\n        while(s[l]==s[ls-1-l] && l<=(ls-1)/2)\n        {\n            l++;\n        }\n        l--;\n        if(l==(ls-1)/2) ans++;\n    }\n    return ans;\n}\nint main(){\n    int n,s,num=0;\n    cin>>n>>s;\n    while(num<n)\n    {\n        s++;\n        if(hw(s)==2) \n        {\n            cout<<s<<endl;\n            num++;\n        }\n    }\n    return 0;\n}",ACCEPTED,45,456
1538387792181825536,0e0562d845f9e800f2b57ae5fedc1c575f8952c52b6b20153546297e1efdabf0,2022-06-19 13:06:46,C++,80.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<iostream>\nusing namespace std;\nint a[100],w;//a存储余数，w计算数位 \nint b[26]={'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};//暴力的转换 \nbool change(int n,int k){//除k取余法 \n    int flag=1;\n    while(n!=0){\n        a[++w]=n%k;\n        n/=k;\n    }\n    for(int u=1;u<=w/2+1;u++)//检验回文 \n        if(a[u]!=a[w-u+1]){\n            flag=0;break;\n}\n    return flag;\n}\nint main(){\n    int i,j,k,m,n;\n    scanf(\""%d\"",&n);\n    for(i=1;i<=300;i++){ \n        j=i*i;w=0; //w要随时清空，数位会时刻变化 \n    if(change(j,n)==1){\n        w=0;change(i,n);\n        for(int u=w;u>=1;u--){        //注意u要从 w枚举到 1，除k取余法要倒着数 \n        if(a[u]<10)printf(\""%d\"",a[u]);\n        else printf(\""%c\"",b[a[u]-10]);\n    }\n        printf(\"" \"");\n        //输出原数\n        w=0;change(j,n);\n        for(int u=1;u<=w;u++){        //回文数从1枚举到w输出都无所谓 \n        if(a[u]<10)printf(\""%d\"",a[u]);\n        else printf(\""%c\"",b[a[u]-10]);\n        }\n        printf(\""\\n\"");\n    }    \n}\n    return 0;\n}",ACCEPTED,25,456
1538388134747402240,0e0562d845f9e800f2b57ae5fedc1c575f8952c52b6b20153546297e1efdabf0,2022-06-19 13:08:07,C++,70.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n\nbool ispal(int n,int k){\n    short res[100]={0},p=0;//res里装的是转换后的k进制数\n    while(n){\n        res[p++]=n%k;\n        n/=k;\n    }//10转2进制怎么转，10转k进制就怎么转——模拟短除法。当然这么搞到的k进制数在数组里是个反的。 \n    //即使数字反了，因为只用判断是不是回文，所以可以不用管。\n    //再者，如果是回文，那反不反转好像没啥区别.... \n    int i=0,j=p-1;\n    while(i<j)\n        if(res[i++]!=res[j--])return 0;        //判断是不是回文\n    return 1;\n}\n\nint main(){\n    int n,s;\n    cin>>n>>s;\n    int ans=0;\n    for(int i=s+1;ans!=n;i++){\n        int cnt=0;\n        for(int j=2;j<=10&&cnt<2;j++){\n            if(ispal(i,j))cnt++;//在j进制下i为回文数，计数cnt++ \n        }\n        if(cnt>=2)printf(\""%d\\n\"",i),ans++;//若计数不小于2，则输出，答案计数ans++ \n    }\n    return 0;\n}",ACCEPTED,30,580
1538484981730078720,56179a80433849d1d943c4630d4bda1f97482b20d0ecedb82c4b17fc7d4848b9,2022-06-19 19:32:57,C++,80.0,1511526337611964423,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstdio>\n#include<cstdlib>\n#include<cmath>\n#include<cstring>\nusing namespace std;\nint b;\nint a[1000];\nchar g[12]={'A','B','C','D','E','F','G','H','I','J','K','L'};//标出这些字母\nbool judge(int x)\n{\n   int stop=1,tail=1;\n   while(x!=0)//进制转换\n   {\n   \t  a[tail]=x%b;\n   \t  x=x/b;\n   \t  tail++;\n   }\n   tail--;\n   for(int i=1;i<=(tail+1)/2;i++)\n   \t  if(a[i]!=a[tail+1-i])\n   \t  {\n   \t     stop=0;//判断是否为回文\n\t\t break;\t\n\t  }\n\tif(stop==1)\n\t  return 1;\n\telse \n\t  return 0;\n}\nvoid print(int x)\n{\n   int tail=1;\n   while(x!=0)//照例进制转换\n   {\n   \t  a[tail]=x%b;\n   \t  x=x/b;\n   \t  tail++;\n   }\n   tail--;\n   for(int i=tail;i>=1;i--)//倒叙输出\n   {\n   \t  if(a[i]<=9)\n   \t    printf(\""%d\"",a[i]);\n   \t  else\n   \t    printf(\""%c\"",g[a[i]-10]);\n   \t  \n   }\n} \nint main() \n{\n\tscanf(\""%d\"",&b);\n\tfor(int i=1;i<=300;i++)\n\t{\n\t\tif(judge(i*i)==1)\n\t\t{\n\t\t  \tprint(i);//打印这个数\n\t\t    printf(\"" \"");\n\t\t\tprint(i*i);//打印这个数的平方\n\t\t\tprintf(\""\\n\"");  \t\n\t\t}\n\t}/**/\n\treturn 0;\n}",ACCEPTED,25,456
1538486884811636736,56179a80433849d1d943c4630d4bda1f97482b20d0ecedb82c4b17fc7d4848b9,2022-06-19 19:40:31,C++,70.0,1511526337611964424,1267449136707624960,1049226397448056832,"#include<bits/stdc++.h>\nusing namespace std;\n\nbool ispal(int n,int k){\n    short res[100]={0},p=0;//res里装的是转换后的k进制数\n    while(n){\n        res[p++]=n%k;\n        n/=k;\n    }\n    int i=0,j=p-1;\n    while(i<j)\n        if(res[i++]!=res[j--])return 0;\n    return 1;\n}\n\nint main(){\n    int n,s;\n    cin>>n>>s;\n    int ans=0;\n    for(int i=s+1;ans!=n;i++){\n        int cnt=0;\n        for(int j=2;j<=10&&cnt<2;j++){\n            if(ispal(i,j))cnt++;\n        }\n        if(cnt>=2)printf(\""%d\\n\"",i),ans++;\n    }\n    return 0;\n}",ACCEPTED,27,492
1284770681865043968,0346a04f58bcfe7428451052e2cf0a024a3f4fe8818f15cc29e83479b663797b,2020-07-19 16:42:55,C++,80.0,1283640625844654087,1267442030214471680,1049226397448056832,"#include <iostream>\n#include<string>\n#include<algorithm>\nusing namespace std;\n\nbool isPlalin(int a, int scale){\n    string s;\n    int temp=a,iCount;\n    for(iCount=0;temp;iCount++){\n        if(temp%scale>=10){\n            s[iCount]=temp%scale+55;\n            temp=temp/scale;\n            continue;\n        }\n        s[iCount]=temp%scale+48;\n        temp=(temp/scale);\n    }\n\n\n    for(int i=iCount-1;i;i--){\n        if(s[i]!=s[iCount-i-1])\n            return false;\n    }\n    return true;\n}\n\nint main()\n{\n    int iNum,iArr[600],iCount=0;\n    cin >> iNum;\n    for(int i=0;i<300;i++)\n        if(isPlalin(i*i,iNum))\n        {iArr[iCount]=i;iCount++;iArr[iCount]=i*i;iCount++;}\n    for(int i=0;i<iCount;i++){\n        int temp=iArr[i],iout;\n        string b;\n        for(iout=0;temp;iout++){\n            if(temp%iNum>=10){\n                b[iout]=temp%iNum+55;\n                temp=temp/iNum;\n                continue;\n            }\n            b[iout]=temp%iNum+48;\n            temp=(temp/iNum);\n        }\n        for(int j=iout-1;j>=0;j--)\n            cout<<b[j];\n        if(i%2)cout<<endl;\n        else cout<<\"" \"";\n    }\n    return 0;\n}\n",ACCEPTED,32,512
1284770750399971328,0346a04f58bcfe7428451052e2cf0a024a3f4fe8818f15cc29e83479b663797b,2020-07-19 16:43:11,C++,70.0,1283640625844654088,1267449136707624960,1049226397448056832,"#include <iostream>\n#include<string>\n#include<algorithm>\nusing namespace std;\n\nbool isPlalin(int a, int scale){\n    string s;\n    int temp=a,iCount;\n    for(iCount=0;temp;iCount++){\n        s[iCount]=temp%scale+48;\n        temp=(temp/scale);\n    }\n    for(int i=iCount-1;i;i--){\n        if(s[i]!=s[iCount-i-1])\n            return false;\n    }\n    return true;\n}\n\nint main()\n{\n    int iNum,iFloor,iArr[100],iLoc=0;\n    cin >> iNum>>iFloor;\n    for(int i=iFloor+1;true;i++){\n        int count=0;\n        for(int j=2;j<11;j++){\n            if(isPlalin(i,j))\n            {count++;\n                if(count==2){\n                    iArr[iLoc]=i;\n                    iLoc++;\n                    break;\n                }\n            }\n        }\n        if(iLoc==iNum)\n            break;\n    }\n    for(int i=0;i<iLoc;i++)\n        cout<<iArr[i]<<endl;\n    return 0;\n}\n",ACCEPTED,30,424
1285143860429127680,8e1fa00181ab686131c09af695061d99ee5d3f9f9fc9bc9c35ea80549c8df064,2020-07-20 17:25:47,C++,80.0,1283640625844654087,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<algorithm>\nusing namespace std;\nbool rreverse(string);\nint main()\n{\n\tint b;\n\tcin >> b;\n\tchar ch[20] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\n\tfor (int i = 1; i < 301; i++)\n\t{\n\t\tint j = i;\n\t\tint n = i * i;\n\t\tstring arr1;\n\t\tstring arr2;\n\t\tint q;\n\t\tint m;\n\t\twhile (j != 0)\n\t\t{\n\t\t\tq = j % b;\n\t\t\tj = j / b;\n\t\t\tarr1 += ch[q];\n\t\t}\n\t\twhile (n != 0)\n\t\t{\n\t\t\tm = n % b;\n\t\t\tn = n / b;\n\t\t\tarr2 += ch[m];\n\t\t}\n\t\tif (rreverse(arr2))\n\t\t{\n\t\t\treverse(arr1.begin(), arr1.end());\n\t\t\tcout << arr1 << \"" \"" << arr2 << endl;\n\t\t}\n\t}\n\treturn 0;\n}\nbool rreverse(string str)\n{\n\tint s = str.size();\n\tfor (int i = 0; i < s; i++)\n\t{\n\t\tif (str[i] != str[s - 1 - i])\n\t\t\treturn false;\n\t}\n\treturn true;\n}",ACCEPTED,42,512
1285144000569212928,8e1fa00181ab686131c09af695061d99ee5d3f9f9fc9bc9c35ea80549c8df064,2020-07-20 17:26:21,C++,70.0,1283640625844654088,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<string>\nusing namespace std;\nint rreverse(string);\nint main()\n{\n\tchar ch[10] = { '0','1','2','3','4','5','6','7','8','9' };\n\tint n, s;\n\tcin >> n >> s;\n\tint num = 0;\n\tfor (int i = s + 1;; i++)\n\t{\n\t\tint k = 0;\n\t\tfor (int j = 2; j < 11; j++)\n\t\t{\n\t\t\tint m;\n\t\t\tint t = i;\n\t\t\tstring arr;\n\t\t\twhile (t != 0)\n\t\t\t{\n\t\t\t\tm = t % j;\n\t\t\t\tt = t / j;\n\t\t\t\tarr += ch[m];\n\t\t\t}\n\t\t\tif (rreverse(arr))\n\t\t\t\tk += 1;\n\t\t\tif (k > 1)\n\t\t\t{\n\t\t\t\tcout << i << endl;\n\t\t\t\tnum += 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (num == n)\n\t\t\tbreak;\n\t}\n\treturn 0;\n}\nint rreverse(string str)\n{\n\tint s = str.size();\n\tfor (int i = 0; i < s; i++)\n\t{\n\t\tif (str[i] != str[s - 1 - i])\n\t\t\treturn 0;\n\t}\n\treturn 1;\n}",ACCEPTED,29,384
1299012315505094656,4df5809172c657c03fd6ddb8af0a20c80845b7b240aac802fbc82564bdc234cf,2020-08-27 23:54:05,C++,0.0,1283640625844654087,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<vector>\n#include<algorithm>\n#include<cstring>\nusing namespace std;\nvector<int> translate(int n, int k);\nint judge(vector<int> v);\nint main()\n{\n\tint value;\n\tcin >> value;\n\tfor (int j = 1; j < 300; j++)\n\t{\n\t\tint squarenumber = j*j;\n\t\tvector<int> transnumber = translate(squarenumber, value);\n\t\tif (judge(transnumber))\n\t\t{\n\t\t\tcout << j << \"" \"";\n\t\t\tfor (int i = transnumber.size() - 1; i < 0; i--)\n\t\t\t{\n\t\t\t\tcout << \""1\"";\n\t\t\t\tswitch (transnumber[i])\n\t\t\t\t{\n\t\t\t\tcase 10: cout << 'A'; break;\n\t\t\t\tcase 11: cout << 'B'; break;\n\t\t\t\tcase 12: cout << 'C'; break;\n\t\t\t\tcase 13: cout << 'D'; break;\n\t\t\t\tcase 14: cout << 'E'; break;\n\t\t\t\tcase 15: cout << 'F'; break;\n\t\t\t\tcase 16: cout << 'G'; break;\n\t\t\t\tcase 17: cout << 'H'; break;\n\t\t\t\tcase 18: cout << 'I'; break;\n\t\t\t\tcase 19: cout << 'J'; break;\n\t\t\t\tcase 20: cout << 'K'; break;\n\t\t\t\tdefault:\n\t\t\t\t\tcout << transnumber[i];\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n\treturn 0;\n}\n\nvector<int> translate(int n, int k)\n{\n\tint temp;\n\tvector<int> number;\n\twhile (n)\n\t{\n\t\ttemp = n % k;\n\t\tnumber.push_back(temp);\n\t\tn = n / k;\n\t}\n\treturn number;\n}\n\nint judge(vector<int> v)\n{\n\tint temp = 1;\n\tfor (int i = 0; i < v.size() / 2; i++)\n\t{\n\t\tif (v[i] != v[v.size() - i - 1])\n\t\t\ttemp = 0;\n\t}\n\treturn temp;\n}",WRONG_ANSWER,36,448
1299014166954766336,4df5809172c657c03fd6ddb8af0a20c80845b7b240aac802fbc82564bdc234cf,2020-08-28 00:01:26,C++,10.0,1283640625844654087,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<vector>\n#include<algorithm>\n#include<cstring>\nusing namespace std;\nvector<int> translate(int n, int k);\nint judge(vector<int> v);\nint main()\n{\n\tint value;\n\tcin >> value;\n\tfor (int j = 1; j < 300; j++)\n\t{\n\t\tint squarenumber = j*j;\n\t\tvector<int> transnumber = translate(squarenumber, value);\n\t\tif (judge(transnumber))\n\t\t{\n\t\t\tcout << j << \"" \"";\n\t\t\tfor (int i = transnumber.size() - 1; i >= 0; i--)\n\t\t\t{\n\t\t\t\tif (transnumber[i] < 10)\n\t\t\t\t\tcout << transnumber[i];\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tswitch (transnumber[i])\n\t\t\t\t\t{\n\t\t\t\t\tcase 10: cout << 'A'; break;\n\t\t\t\t\tcase 11: cout << 'B'; break;\n\t\t\t\t\tcase 12: cout << 'C'; break;\n\t\t\t\t\tcase 13: cout << 'D'; break;\n\t\t\t\t\tcase 14: cout << 'E'; break;\n\t\t\t\t\tcase 15: cout << 'F'; break;\n\t\t\t\t\tcase 16: cout << 'G'; break;\n\t\t\t\t\tcase 17: cout << 'H'; break;\n\t\t\t\t\tcase 18: cout << 'I'; break;\n\t\t\t\t\tcase 19: cout << 'J'; break;\n\t\t\t\t\tcase 20: cout << 'K'; break;\n\t\t\t\t\tdefault:\n\t\t\t\t\t\tcout << \""Default\""; break;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n\treturn 0;\n}\n\nvector<int> translate(int n, int k)\n{\n\tint temp;\n\tvector<int> number;\n\twhile (n)\n\t{\n\t\ttemp = n % k;\n\t\tnumber.push_back(temp);\n\t\tn = n / k;\n\t}\n\treturn number;\n}\n\nint judge(vector<int> v)\n{\n\tint temp = 1;\n\tfor (int i = 0; i < v.size() / 2; i++)\n\t{\n\t\tif (v[i] != v[v.size() - i - 1])\n\t\t\ttemp = 0;\n\t}\n\treturn temp;\n}",PARTIAL_ACCEPTED,39,424
1299021138705903616,4df5809172c657c03fd6ddb8af0a20c80845b7b240aac802fbc82564bdc234cf,2020-08-28 00:29:08,C++,80.0,1283640625844654087,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<string>\n#include<vector>\n#include<algorithm>\n#include<cstring>\nusing namespace std;\nvector<int> translate(int n, int k);\nint judge(vector<int> v);\nint main()\n{\n\tint value;\n\tcin >> value;\n\tfor (int j = 1; j < 300; j++)\n\t{\n\t\tint squarenumber = j*j;\n\t\tvector<int> transnumber = translate(squarenumber, value);\n\t\tvector<int> beginnumber = translate(j, value);\n\t\tif (judge(transnumber))\n\t\t{\n\t\t\tfor (int i = beginnumber.size() - 1; i >= 0; i--)\n\t\t\t{\n\t\t\t\tif (beginnumber[i] < 10)\n\t\t\t\t\tcout << beginnumber[i];\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tswitch (beginnumber[i])\n\t\t\t\t\t{\n\t\t\t\t\tcase 10: cout << 'A'; break;\n\t\t\t\t\tcase 11: cout << 'B'; break;\n\t\t\t\t\tcase 12: cout << 'C'; break;\n\t\t\t\t\tcase 13: cout << 'D'; break;\n\t\t\t\t\tcase 14: cout << 'E'; break;\n\t\t\t\t\tcase 15: cout << 'F'; break;\n\t\t\t\t\tcase 16: cout << 'G'; break;\n\t\t\t\t\tcase 17: cout << 'H'; break;\n\t\t\t\t\tcase 18: cout << 'I'; break;\n\t\t\t\t\tcase 19: cout << 'J'; break;\n\t\t\t\t\tcase 20: cout << 'K'; break;\n\t\t\t\t\tdefault:\n\t\t\t\t\t\tcout << \""Default\""; break;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout << \"" \"";\n\t\t\tfor (int i = transnumber.size() - 1; i >= 0; i--)\n\t\t\t{\n\t\t\t\tif (transnumber[i] < 10)\n\t\t\t\t\tcout << transnumber[i];\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tswitch (transnumber[i])\n\t\t\t\t\t{\n\t\t\t\t\tcase 10: cout << 'A'; break;\n\t\t\t\t\tcase 11: cout << 'B'; break;\n\t\t\t\t\tcase 12: cout << 'C'; break;\n\t\t\t\t\tcase 13: cout << 'D'; break;\n\t\t\t\t\tcase 14: cout << 'E'; break;\n\t\t\t\t\tcase 15: cout << 'F'; break;\n\t\t\t\t\tcase 16: cout << 'G'; break;\n\t\t\t\t\tcase 17: cout << 'H'; break;\n\t\t\t\t\tcase 18: cout << 'I'; break;\n\t\t\t\t\tcase 19: cout << 'J'; break;\n\t\t\t\t\tcase 20: cout << 'K'; break;\n\t\t\t\t\tdefault:\n\t\t\t\t\t\tcout << \""Default\""; break;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n\treturn 0;\n}\n\nvector<int> translate(int n, int k)\n{\n\tint temp;\n\tvector<int> number;\n\twhile (n)\n\t{\n\t\ttemp = n % k;\n\t\tnumber.push_back(temp);\n\t\tn = n / k;\n\t}\n\treturn number;\n}\n\nint judge(vector<int> v)\n{\n\tint temp = 1;\n\tfor (int i = 0; i < v.size() / 2; i++)\n\t{\n\t\tif (v[i] != v[v.size() - i - 1])\n\t\t\ttemp = 0;\n\t}\n\treturn temp;\n}",ACCEPTED,40,512
1299250214620229632,4df5809172c657c03fd6ddb8af0a20c80845b7b240aac802fbc82564bdc234cf,2020-08-28 15:39:24,C++,20.0,1283640625844654088,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\nvector<int> translate(int n, int k);  //将整形数转化为k进制的数，并返回转换后的k进制的数的倒序数组\nint judge(vector<int> v);  //判断该K进制的数是否为回文数，是 则返回1；\nint main()\n{\n\tint n, s, times = 0, fn=0;\n\tcin >> n >> s;\n\tfor (int i = s + 1; fn<n; i++)\n\t{\n\t\tfor (int j = 2; j <= 10; j++)\n\t\t{\n\t\t\tvector<int> v=translate(i, j);\n\t\t\tif (judge(v))\n\t\t\t\ttimes++;\n\t\t\tif (times >= 2)\n\t\t\t{\n\t\t\t\tcout << i << endl;\n\t\t\t\ttimes = 0;\n\t\t\t\tfn++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}\n\nvector<int> translate(int n, int k)  //将int类型转换为K进制数，并返回倒序数组；\n{\n\tint temp;\n\tvector<int> number;\n\twhile (n)\n\t{\n\t\ttemp = n % k;\n\t\tnumber.push_back(temp);  //向数组添加短除法的余数；\n\t\tn = n / k;\n\t}\n\treturn number;\n}\n\nint judge(vector<int> v)\n{\n\tint temp = 1;\n\tfor (int i = 0; i < v.size() / 2; i++)  //从两边向中间判断是否相等\n\t{\n\t\tif (v[i] != v[v.size() - i - 1])\n\t\t\ttemp = 0;\n\t}\n\treturn temp;  //返回值\n}",PARTIAL_ACCEPTED,28,512
1299250672956993536,4df5809172c657c03fd6ddb8af0a20c80845b7b240aac802fbc82564bdc234cf,2020-08-28 15:41:14,C++,70.0,1283640625844654088,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<vector>\nusing namespace std;\nvector<int> translate(int n, int k);  //将整形数转化为k进制的数，并返回转换后的k进制的数的倒序数组\nint judge(vector<int> v);  //判断该K进制的数是否为回文数，是 则返回1；\nint main()\n{\n\tint n, s, times = 0, fn=0;\n\tcin >> n >> s;\n\tfor (int i = s + 1; fn<n; i++)\n\t{\n\t\tfor (int j = 2; j <= 10; j++)\n\t\t{\n\t\t\tvector<int> v=translate(i, j);\n\t\t\tif (judge(v))\n\t\t\t\ttimes++;\n\t\t\tif (times >= 2)\n\t\t\t{\n\t\t\t\tcout << i << endl;\n\t\t\t\tfn++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\ttimes = 0;\n\t}\n\treturn 0;\n}\n\nvector<int> translate(int n, int k)  //将int类型转换为K进制数，并返回倒序数组；\n{\n\tint temp;\n\tvector<int> number;\n\twhile (n)\n\t{\n\t\ttemp = n % k;\n\t\tnumber.push_back(temp);  //向数组添加短除法的余数；\n\t\tn = n / k;\n\t}\n\treturn number;\n}\n\nint judge(vector<int> v)\n{\n\tint temp = 1;\n\tfor (int i = 0; i < v.size() / 2; i++)  //从两边向中间判断是否相等\n\t{\n\t\tif (v[i] != v[v.size() - i - 1])\n\t\t\ttemp = 0;\n\t}\n\treturn temp;  //返回值\n}",ACCEPTED,48,448
1308033763024551936,fb8d83617e99b5368043d5a60c02cca350bc684afc8a34a362ad6cc849d209b6,2020-09-21 21:22:05,C++,10.0,1283640625844654087,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nint B;\nchar num[20];\nbool palindrome(int n) {\n\tint s, index = 0;\n\twhile (n > 0) {\n\t\ts = n % B;\n\t\tif (s < 10)num[index++] = (char)(s + 48);\n\t\telse num[index++] = (char)(s + 55);\n\t\tn /= B;\n\t}\n\tfor (int i = 0; i < index / 2; i++)\n\t\tif (num[i] != num[index - 1 - i])return false;\n\treturn true;\n}\nint main() {\n\tcin >> B;\n\tint i = 1;\n\tfor (; i <= 300; i++)\n\t\tif (palindrome(i*i)) {\n\t\t\tcout << i << \"" \"" << i * i;\n\t\t\tbreak;\n\t\t}\n\tfor (++i; i <= 300; i++) {\n\t\tif (palindrome(i*i)) {\n\t\t\tcout << endl;\n\t\t\tcout << i << \"" \"" << i * i;\n\t\t}\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,35,512
1308037407560155136,fb8d83617e99b5368043d5a60c02cca350bc684afc8a34a362ad6cc849d209b6,2020-09-21 21:36:34,C++,0.0,1283640625844654087,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nint B;\nchar num[20], num1[20];\nbool k;\nvoid print(int n) {\n\tif (k)\tcout << endl;\n\telse k = true;\n\tint t = sqrt(n), s, index = 0;\n\twhile (t > 0) {\n\t\ts = t % B;\n\t\tif (s < 10)num1[index++] = (char)(s + 48);\n\t\telse num1[index++] = (char)(s + 55);\n\t\tt /= B;\n\t}\n\tfor (--index; index >= 0; index--)\n\t\tcout << num1[index];\n\tcout << \"" \"";\n}\nvoid palindrome(int n) {\n\tint t = n, s, index = 0;\n\twhile (t > 0) {\n\t\ts = t % B;\n\t\tif (s < 10)num[index++] = (char)(s + 48);\n\t\telse num[index++] = (char)(s + 55);\n\t\tt /= B;\n\t}\n\tfor (int i = 0; i < index / 2; i++)\n\t\tif (num[i] != num[index - 1 - i])return;\n\tprint(n);\n\tfor (--index; index >= 0; index--)\n\t\tcout << num[index];\n}\nint main() {\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++)\n\t\tpalindrome(i*i);\n\treturn 0;\n}",COMPILE_ERROR,0,0
1308037468335620096,fb8d83617e99b5368043d5a60c02cca350bc684afc8a34a362ad6cc849d209b6,2020-09-21 21:36:49,C++,0.0,1283640625844654087,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <math>\nusing namespace std;\nint B;\nchar num[20], num1[20];\nbool k;\nvoid print(int n) {\n\tif (k)\tcout << endl;\n\telse k = true;\n\tint t = sqrt(n), s, index = 0;\n\twhile (t > 0) {\n\t\ts = t % B;\n\t\tif (s < 10)num1[index++] = (char)(s + 48);\n\t\telse num1[index++] = (char)(s + 55);\n\t\tt /= B;\n\t}\n\tfor (--index; index >= 0; index--)\n\t\tcout << num1[index];\n\tcout << \"" \"";\n}\nvoid palindrome(int n) {\n\tint t = n, s, index = 0;\n\twhile (t > 0) {\n\t\ts = t % B;\n\t\tif (s < 10)num[index++] = (char)(s + 48);\n\t\telse num[index++] = (char)(s + 55);\n\t\tt /= B;\n\t}\n\tfor (int i = 0; i < index / 2; i++)\n\t\tif (num[i] != num[index - 1 - i])return;\n\tprint(n);\n\tfor (--index; index >= 0; index--)\n\t\tcout << num[index];\n}\nint main() {\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++)\n\t\tpalindrome(i*i);\n\treturn 0;\n}",COMPILE_ERROR,0,0
1308037507212623872,fb8d83617e99b5368043d5a60c02cca350bc684afc8a34a362ad6cc849d209b6,2020-09-21 21:36:58,C++,0.0,1283640625844654087,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <math.h>\nusing namespace std;\nint B;\nchar num[20], num1[20];\nbool k;\nvoid print(int n) {\n\tif (k)\tcout << endl;\n\telse k = true;\n\tint t = sqrt(n), s, index = 0;\n\twhile (t > 0) {\n\t\ts = t % B;\n\t\tif (s < 10)num1[index++] = (char)(s + 48);\n\t\telse num1[index++] = (char)(s + 55);\n\t\tt /= B;\n\t}\n\tfor (--index; index >= 0; index--)\n\t\tcout << num1[index];\n\tcout << \"" \"";\n}\nvoid palindrome(int n) {\n\tint t = n, s, index = 0;\n\twhile (t > 0) {\n\t\ts = t % B;\n\t\tif (s < 10)num[index++] = (char)(s + 48);\n\t\telse num[index++] = (char)(s + 55);\n\t\tt /= B;\n\t}\n\tfor (int i = 0; i < index / 2; i++)\n\t\tif (num[i] != num[index - 1 - i])return;\n\tprint(n);\n\tfor (--index; index >= 0; index--)\n\t\tcout << num[index];\n}\nint main() {\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++)\n\t\tpalindrome(i*i);\n\treturn 0;\n}",COMPILE_ERROR,0,0
1308037568889864192,fb8d83617e99b5368043d5a60c02cca350bc684afc8a34a362ad6cc849d209b6,2020-09-21 21:37:13,C++,80.0,1283640625844654087,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <math.h>\nusing namespace std;\nint B;\nchar num[20], num1[20];\nbool k;\nvoid print(int n) {\n\tif (k)\tcout << endl;\n\telse k = true;\n\tint t = sqrt(n), s, index = 0;\n\twhile (t > 0) {\n\t\ts = t % B;\n\t\tif (s < 10)num1[index++] = (char)(s + 48);\n\t\telse num1[index++] = (char)(s + 55);\n\t\tt /= B;\n\t}\n\tfor (--index; index >= 0; index--)\n\t\tcout << num1[index];\n\tcout << \"" \"";\n}\nvoid palindrome(int n) {\n\tint t = n, s, index = 0;\n\twhile (t > 0) {\n\t\ts = t % B;\n\t\tif (s < 10)num[index++] = (char)(s + 48);\n\t\telse num[index++] = (char)(s + 55);\n\t\tt /= B;\n\t}\n\tfor (int i = 0; i < index / 2; i++)\n\t\tif (num[i] != num[index - 1 - i])return;\n\tprint(n);\n\tfor (--index; index >= 0; index--)\n\t\tcout << num[index];\n}\nint main() {\n\tcin >> B;\n\tfor (int i = 1; i <= 300; i++)\n\t\tpalindrome(i*i);\n\treturn 0;\n}",ACCEPTED,28,424
1308203895847895040,fb8d83617e99b5368043d5a60c02cca350bc684afc8a34a362ad6cc849d209b6,2020-09-22 08:38:08,C++,70.0,1283640625844654088,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <algorithm>\nusing namespace std;\nint N, S, cnt;\nchar num[20];\nbool k;\nbool palindrome(int n,int B) {\n\tint t = n, s, index = 0;\n\twhile (t > 0) {\n\t\ts = t % B;\n\t\tif (s < 10)num[index++] = (char)(s + 48);\n\t\telse num[index++] = (char)(s + 55);\n\t\tt /= B;\n\t}\n\tfor (int i = 0; i < index / 2; i++)\n\t\tif (num[i] != num[index - 1 - i])return false;\n\treturn true;\n}\nint main() {\n\tcin >> N >> S;\n\tfor (int i = S + 1; cnt < N; i++) {\n\t\tint cnt1 = 0;\n\t\tfor (int B = 2; B <= 10; B++) {\n\t\t\tif (palindrome(i, B))\n\t\t\t\tcnt1++;\n\t\t\tif (cnt1 == 2) {\n\t\t\t\tif (k)cout << endl;\n\t\t\t\telse k = true;\n\t\t\t\tcout << i;\n\t\t\t\tcnt++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}",ACCEPTED,30,424
1310895619721330688,2dbc8dbbe3a3713fd279f85d78da00257659b0fa27c0cdad54e2bf4fb0d9580e,2020-09-29 18:54:05,C++,80.0,1283640625844654087,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm> \nusing namespace std;\n\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1]) \n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1) // 是回文数；\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，使用模N取余法；\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\t\n        {\n            ans += t + '0';\n        }\n        else \n        {\n            ans += t - 10 + 'A'; // 保证进制大于10时，数字能用大写字母表示；\n        }\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（），以防止输入为0的情况；\n    reverse(ans.begin(), ans.end());  // 模N取余法，得到的字符串反转即可得到对应进制的数；\n    return ans;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    int j = 0;\n    for (int x = 1; x <= 300; x++)\n    {\n        j = x; // 创建副本\n        \n        string s1 = intToA(j, n);      // 将整数按n进制转换；\n        string s2 = intToA((j * j), n);// 将该数的平方按n进制转换；\n\n        if (Palin_num(s2))\n        {\n            cout << s1 << \"" \"" << s2 << endl;\n        }\n        else\n        {\n            continue;\n        }\n    }\n    return 0;\n}\n",ACCEPTED,42,424
1310905981942300672,2dbc8dbbe3a3713fd279f85d78da00257659b0fa27c0cdad54e2bf4fb0d9580e,2020-09-29 19:35:16,C++,0.0,1283640625844654087,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm> \nusing namespace std;\n\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1]) \n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1) // 是回文数；\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，使用模N取余法；\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\t\n        {\n            ans += t ;\n        }\n        else \n        {\n            ans += t - 10 + 'A'; // 保证进制大于10时，数字能用大写字母表示；\n        }\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（），以防止输入为0的情况；\n    reverse(ans.begin(), ans.end());  // 模N取余法，得到的字符串反转即可得到对应进制的数；\n    return ans;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    int j = 0;\n    for (int x = 1; x <= 300; x++)\n    {\n        j = x; // 创建副本\n        \n        string s1 = intToA(j, n);      // 将整数按n进制转换；\n        string s2 = intToA((j * j), n);// 将该数的平方按n进制转换；\n\n        if (Palin_num(s2))\n        {\n            cout << s1 << \"" \"" << s2 << endl;\n        }\n        else\n        {\n            continue;\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,29,516
1310925141288091648,f1ab11f416335963f4a2cdc8978e6fae8b6fc771cee7f44349d5ee6ab070f196,2020-09-29 20:51:24,C++,80.0,1283640625844654087,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<cstdio>\n#include<cstring>\n#include<algorithm>\nusing namespace std;\n\nint k[100],kk[100];\nint change(int n,int s);\nint change2(int n, int s); \n\nint main()\n{\n\tchar ch;\n\tbool pan=true;\n\tint n,s;\n\tint ans,anss;\n\tcin>>n;\n\tfor(int i=1;i<=300;++i)\n\t{\n\t\ts=i*i;\n\t\tans=change(n,s);\n\t\tanss=ans/2;\n\t\tfor(int j=1;j<=anss;++j)\n\t\t{\n\t\t\tif(k[j]!=k[ans-j+1])\n\t\t\t{\n\t\t\t\tpan=false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(pan)\n\t\t{\t\n\t\t\tfor(int j=change2(n,i);j>=1;--j)\n\t\t\t{\n\t\t\t\tif(kk[j]<10) cout<<kk[j];\n\t\t\t\telse{\n\t\t\t\t\tch=(kk[j]-10+'A');\n\t\t\t\t\tcout<<ch;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout<<' ';\n\t\t\tfor(int j=1;j<=ans;++j)\n\t\t\t{\n\t\t\t\tif(k[j]<10) cout<<k[j];\n\t\t\t\telse{\n\t\t\t\t\tch=(k[j]-10+'A');\n\t\t\t\t\tcout<<ch;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout<<endl;\n\t\t\t\n\t\t}\n\t\tpan=true;\n\t}\n\treturn 0;\n} \n\nint change(int n,int s)\n{\n\tint ji=0;\n\tint a,b;\n\t\n\t\twhile(s)\n\t\t{\n\t\t\ta=s%n;\n\t\t\tk[++ji]=a;\n\t\t\ts/=n;\n\t\t}\n\treturn ji;\n}\nint change2(int n,int s)\n{\n\tint ji=0;\n\tint a,b;\n\t\n\t\twhile(s)\n\t\t{\n\t\t\ta=s%n;\n\t\t\tkk[++ji]=a;\n\t\t\ts/=n;\n\t\t}\n\treturn ji;\n}",ACCEPTED,24,512
1312736805566218240,f1ab11f416335963f4a2cdc8978e6fae8b6fc771cee7f44349d5ee6ab070f196,2020-10-04 20:50:18,C++,70.0,1283640625844654088,1267449136707624960,1049226397448056832,"#include<iostream>\n#include<cstdio>\n#include<cstring>\nusing namespace std;\n\nint a[100];\nint change(int n,int s);\nint main()\n{\n\tbool pan=true;\n\tint s,n,ans,anss;\n\tint sums=0,ji=0;\n\tcin>>n>>s;\n\tfor(int i=s+1;;++i)\t\t\t\t//数据范围 \n\t{\n\t\tif(sums==n) return 0;\n\t\tji=0;\n\t\tfor(int k=2;k<=10;++k)\t\t//进制遍历 \n\t\t{\n\t\t\t\n\t\t\tans=change(k,i);\n\t\t\tanss=ans/2;\n\t\t\tfor(int j=1;j<=anss;++j)\t\t\t\t//判断回文 \n\t\t\t{\n\t\t\t\tif(a[j]!=a[ans-j+1])\n\t\t\t\t{\n\t\t\t\t\tpan=false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(pan) ji++;\n\t\t\tif(ji==2)\n\t\t\t{\n\t\t\t\tsums++;\n\t\t\t\tcout<<i<<endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tpan=true; \n\t\t\t\n\t\t}\n\t\tji=0;\n\t}\n}\n\nint change(int n,int s)\n{\n\tint ji=0;\n\tint b;\n\t\n\t\twhile(s)\n\t\t{\n\t\t\tb=s%n;\n\t\t\ta[++ji]=b;\n\t\t\ts/=n;\n\t\t}\n\treturn ji;\n}\n",ACCEPTED,30,440
1315202733138821120,5f71a9d5537f24730fd564649e838059c7274bb787bc8eac8c4cd5b14c9f623d,2020-10-11 16:09:01,C++,80.0,1283640625844654087,1267442030214471680,1049226397448056832,"#include<iostream>\n#include<algorithm>\n#include<string>\n#include<map>\nusing namespace std;\nchar a[20] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I' };\nstring transfer(int n,int b){//转成n进制的数\n\tint m = b;\n\tstring s=\""\"";\n\twhile (m > 0) {\n\t\ts = a[m%n]+s;\n\t\tm = m / n;\n\t}\n\treturn s;\n}\nint main() {\n\tint n;\n\tcin >> n;\n\tfor (int i = 1; i <= 300; i++){\n\t\tstring s = transfer(n, i*i);\n\t\treverse(s.begin(), s.end());\n\t\tif (s == transfer(n, i * i))cout << transfer(n, i) << \"" \"" << transfer(n, i * i) << endl;\n\t}\n\treturn 0;\n}",ACCEPTED,40,612
1315214210868494336,5f71a9d5537f24730fd564649e838059c7274bb787bc8eac8c4cd5b14c9f623d,2020-10-11 16:54:38,C++,70.0,1283640625844654088,1267449136707624960,1049226397448056832,"#include <iostream>\n#include <string>\nusing namespace std;\nstring transform(int B, int num);\nbool is_num(string s);\n\nint main()\n{\n\tint N, S;\n\tcin>>N>>S;\n\tint m = 0, i = S;\n\twhile (m<N)\n\t{\n\t\ti++;\n\t\tint n = 0;\n\t\tfor (int j=2;j<=10;j++)\n\t\t{\n            if (is_num(transform(j,i))) \n\t\t\t{\n\t\t\t\tn++;\n\t\t\t}\n\t\t\tif (n>=2) \n\t\t\t{\n\t\t\t\tcout<<i<<endl;\n\t\t\t\tm++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}\n\nstring transform(int B, int num)\t\n{\n\tstring s = \""\"";\n\twhile (num != 0)\n\t{\n\t\ts = to_string(num % B) + s;\n\t\tnum = num / B;\n\t}\n\treturn s;\n}\n\nbool is_num(string s)\n{\n\tint i = 0, j = s.size()-1;\n\twhile(i < j)\n\t{\n\t\tif (s[i] != s[j]) \n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\ti++;\n\t\tj--;\n\t}\n\treturn true;\n}",ACCEPTED,80,484
1315624704242663424,66b2f8d2ec861ca94cd78e01d64a01741eb545e2d19b39cd55de7ea5e5b4a051,2020-10-12 20:05:47,Java,10.0,1283640625844654088,1267449136707624960,1049226397448056832,import java.util.Scanner;\n\npublic class Main {\n\tpublic static boolean check(int n0) { \n\t\tint x=0;\n\t\tfor(int n=2;n<11;n++) {\n\t\t\tint num[]=new int[17];\n\t\t\tint i=0;\n\t\t\tfor(;n!=0;i++) {\n\t\t\t\tint m=n/n0;\n\t\t\t\tn/=n0;\n\t\t\t\tnum[i]=m;\n\t\t\t}\n\t\t\tint ju=1;\n\t\t\tfor(int j=0;j<=i/2;j++) {\n\t\t\t\tif(num[j]!=num[i-j]) {ju=0;break;}\n\t\t\t}\n\t\t\tif(ju==1)x++;\n\t\t\tif(x==2)return true;\n\t\t}\n\t\treturn false;\n\t}\n\tpublic static void main(String[] args) {\n\t\tScanner in=new Scanner(System.in);\n\t\tint n1=in.nextInt();\n\t\tint n2=in.nextInt();\n\t\tint x=0;\n\t\tfor(int i=n2+1;x<n1;i++) {\n\t\t\tif(check(i))System.out.println(i);x++;\n\t\t}\n\t}\n}\n,PARTIAL_ACCEPTED,914,14156
1315633145942163456,66b2f8d2ec861ca94cd78e01d64a01741eb545e2d19b39cd55de7ea5e5b4a051,2020-10-12 20:39:19,Java,70.0,1283640625844654088,1267449136707624960,1049226397448056832,import java.util.Scanner;\n\npublic class Main {\n\tpublic static boolean check(int xx) { \n\t\tint x=0;\n\t\tfor(int n0=2;n0<11;n0++) {\n\t\t\tint n=xx;\n\t\t\tint num[]=new int[17];\n\t\t\tint i=0;\n\t\t\tfor(;n!=0;) {\n\t\t\t\tint m=n%n0;\n\t\t\t\tn/=n0;\n\t\t\t\tnum[i]=m;\n\t\t\t\ti++;\n\t\t\t}\n\t\t\tint ju=1;\n\t\t\tfor(int j=0;j<(i)/2;j++) {\n\t\t\t\tif(num[j]!=num[i-j-1]) {ju=0;break;}\n\t\t\t}\n\t\t\tif(ju==1)x++;\n\t\t\tif(x==2)return true;\n\t\t}\n\t\treturn false;\n\t}\n\tpublic static void main(String[] args) {\n\t\tScanner in=new Scanner(System.in);\n\t\tint n1=in.nextInt();\n\t\tint n2=in.nextInt();\n\t\tint x=0;\n\t\tfor(int i=n2+1;x!=n1;i++) {\n\t\t\tif(check(i)) {System.out.println(i);x++;}\n\t\t}\n\t}\n}\n,ACCEPTED,1013,16068
1316547991898472448,66b2f8d2ec861ca94cd78e01d64a01741eb545e2d19b39cd55de7ea5e5b4a051,2020-10-15 09:14:36,Java,10.0,1283640625844654087,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static boolean check(int n,int b) {\n\t\tint[] num=new int[10];\n\t\tint i=0;\n\t\tfor(;n!=0;i++) {\n\t\t\tint m=n%b;\n\t\t\tn/=b;\n\t\t\tnum[i]=m;\n\t\t}\n\t\tint x=i;\n\t\tfor(int j=0;j<(x+1)/2;j++) {\n\t\t\ti--;\n\t\t\tif(num[i]!=num[j]) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\tpublic static void main(String[] args) {\n\t\tScanner in=new Scanner(System.in);\n\t\tint b=in.nextInt();\n\t\tfor(int i=1;i<301;i++) {\n\t\t\tint n=i*i;\n\t\t\tif(check(n,b)) {\n\t\t\t\tSystem.out.println(i+\"" \""+n);\n\t\t\t}\n\t\t}\n\t}\n}",PARTIAL_ACCEPTED,1092,14136
1316553125273583616,66b2f8d2ec861ca94cd78e01d64a01741eb545e2d19b39cd55de7ea5e5b4a051,2020-10-15 09:35:00,Java,10.0,1283640625844654087,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void check(int n,int b) {\n\t\tint[] num=new int[20];\n\t\tint i=0;\n\t\tint y=n*n;\n\t\tint yy=y;\n\t\tfor(;y!=0;i++) {\n\t\t\tint m=y%b;\n\t\t\ty/=b;\n\t\t\tnum[i]=m;\n\t\t}\n\t\tint x=i;\n\t\tfor(int j=0;j<(x+1)/2;j++) {\n\t\t\ti--;\n\t\t\tif(num[i]!=num[j]) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t\tfor(;n!=0;) {\n\t\t\tint m=n%b;\n\t\t\tn/=b;\n\t\t\tSystem.out.print(m);\n\t\t}\n\t\tSystem.out.print(\"" \"");\n\t\tfor(;yy!=0;) {\n\t\t\tint m=yy%b;\n\t\t\tyy/=b;\n\t\t\tSystem.out.print(m);\n\t\t}\n\t\tSystem.out.println();\n\t}\n\tpublic static void main(String[] args) {\n\t\tScanner in=new Scanner(System.in);\n\t\tint b=in.nextInt();\n\t\tfor(int i=1;i<301;i++) {\n\t\t\tcheck(i,b);\n\t\t}\n\t}\n}",PARTIAL_ACCEPTED,1060,13948
1316555382937403392,66b2f8d2ec861ca94cd78e01d64a01741eb545e2d19b39cd55de7ea5e5b4a051,2020-10-15 09:43:58,Java,50.0,1283640625844654087,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void check(int n,int b) {\n\t\tint[] num=new int[20];\n\t\tint i=0;\n\t\tint y=n*n;\n\t\tint yy=y;\n\t\tfor(;y!=0;i++) {\n\t\t\tint m=y%b;\n\t\t\ty/=b;\n\t\t\tnum[i]=m;\n\t\t}\n\t\tint x=i;\n\t\tfor(int j=0;j<(x+1)/2;j++) {\n\t\t\ti--;\n\t\t\tif(num[i]!=num[j]) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t\tint[] num2=new int[20];\n\t\ti=0;\n\t\tfor(;n!=0;i++) {\n\t\t\tint m=n%b;\n\t\t\tn/=b;\n\t\t\tnum2[i]=m;\n\t\t}\n\t\ti--;\n\t\tfor(;i>-1;i--) {\n\t\t\tSystem.out.print(num2[i]);\n\t\t}\n\t\tSystem.out.print(\"" \"");\n\t\tfor(;yy!=0;) {\n\t\t\tint m=yy%b;\n\t\t\tyy/=b;\n\t\t\tSystem.out.print(m);\n\t\t}\n\t\tSystem.out.println();\n\t}\n\tpublic static void main(String[] args) {\n\t\tScanner in=new Scanner(System.in);\n\t\tint b=in.nextInt();\n\t\tfor(int i=1;i<301;i++) {\n\t\t\tcheck(i,b);\n\t\t}\n\t}\n}",PARTIAL_ACCEPTED,1021,14488
1316556544524730368,66b2f8d2ec861ca94cd78e01d64a01741eb545e2d19b39cd55de7ea5e5b4a051,2020-10-15 09:48:35,Java,50.0,1283640625844654087,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void check(int n,int b) {\n\t\tint[] num=new int[20];\n\t\tint i=0;\n\t\tint y=n*n;\n\t\tint yy=y;\n\t\tfor(;y!=0;i++) {\n\t\t\tint m=y%b;\n\t\t\ty/=b;\n\t\t\tnum[i]=m;\n\t\t}\n\t\tint x=i;\n\t\tfor(int j=0;j<(x+1)/2;j++) {\n\t\t\ti--;\n\t\t\tif(num[i]!=num[j]) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t\tint[] num2=new int[20];\n\t\ti=0;\n\t\tfor(;n!=0;i++) {\n\t\t\tint m=n%b;\n\t\t\tn/=b;\n\t\t\tnum2[i]=m;\n\t\t}\n\t\ti--;\n\t\tfor(;i>-1;i--) {\n\t\t\tSystem.out.print(num2[i]);\n\t\t}\n\t\tSystem.out.print(\"" \"");\n\t\tfor(;yy!=0;) {\n\t\t\tint m=yy%b;\n\t\t\tyy/=b;\n\t\t\tif(m<10) {System.out.print(m);}\n\t\t\telse {\n\t\t\t\tif(m==10) {System.out.print('A');}\n\t\t\t\tif(m==11) {System.out.print('B');}\n\t\t\t\tif(m==12) {System.out.print('C');}\n\t\t\t\tif(m==13) {System.out.print('D');}\n\t\t\t\tif(m==14) {System.out.print('E');}\n\t\t\t\tif(m==15) {System.out.print('F');}\n\t\t\t\tif(m==16) {System.out.print('G');}\n\t\t\t\tif(m==17) {System.out.print('H');}\n\t\t\t\tif(m==18) {System.out.print('I');}\n\t\t\t\tif(m==19) {System.out.print('J');}\n\t\t\t\tif(m==20) {System.out.print('K');}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println();\n\t}\n\tpublic static void main(String[] args) {\n\t\tScanner in=new Scanner(System.in);\n\t\tint b=in.nextInt();\n\t\tfor(int i=1;i<301;i++) {\n\t\t\tcheck(i,b);\n\t\t}\n\t}\n}",PARTIAL_ACCEPTED,1088,14380
1316557201461788672,66b2f8d2ec861ca94cd78e01d64a01741eb545e2d19b39cd55de7ea5e5b4a051,2020-10-15 09:51:11,Java,0.0,1283640625844654087,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void check(int n,int b) {\n\t\tint[] num=new int[20];\n\t\tint i=0;\n\t\tint y=n*n;\n\t\tint yy=y;\n\t\tfor(;y!=0;i++) {\n\t\t\tint m=y%b;\n\t\t\ty/=b;\n\t\t\tnum[i]=m;\n\t\t}\n\t\tint x=i;\n\t\tfor(int j=0;j<(x+1)/2;j++) {\n\t\t\ti--;\n\t\t\tif(num[i]!=num[j]) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t\tint[] num2=new int[20];\n\t\ti=0;\n\t\tfor(;n!=0;i++) {\n\t\t\tint m=n%b;\n\t\t\tn/=b;\n\t\t\tnum2[i]=m;\n\t\t}\n\t\ti--;\n\t\tfor(;i>-1;i--) {\n            m=num2[i];\n            if(m<10) {System.out.print(m);}\n\t\t\telse {\n\t\t\t\tif(m==10) {System.out.print('A');}\n\t\t\t\tif(m==11) {System.out.print('B');}\n\t\t\t\tif(m==12) {System.out.print('C');}\n\t\t\t\tif(m==13) {System.out.print('D');}\n\t\t\t\tif(m==14) {System.out.print('E');}\n\t\t\t\tif(m==15) {System.out.print('F');}\n\t\t\t\tif(m==16) {System.out.print('G');}\n\t\t\t\tif(m==17) {System.out.print('H');}\n\t\t\t\tif(m==18) {System.out.print('I');}\n\t\t\t\tif(m==19) {System.out.print('J');}\n\t\t\t\tif(m==20) {System.out.print('K');}\n\t\t\t}\n        }\n\t\tSystem.out.print(\"" \"");\n\t\tfor(;yy!=0;) {\n\t\t\tint m=yy%b;\n\t\t\tyy/=b;\n\t\t\tif(m<10) {System.out.print(m);}\n\t\t\telse {\n\t\t\t\tif(m==10) {System.out.print('A');}\n\t\t\t\tif(m==11) {System.out.print('B');}\n\t\t\t\tif(m==12) {System.out.print('C');}\n\t\t\t\tif(m==13) {System.out.print('D');}\n\t\t\t\tif(m==14) {System.out.print('E');}\n\t\t\t\tif(m==15) {System.out.print('F');}\n\t\t\t\tif(m==16) {System.out.print('G');}\n\t\t\t\tif(m==17) {System.out.print('H');}\n\t\t\t\tif(m==18) {System.out.print('I');}\n\t\t\t\tif(m==19) {System.out.print('J');}\n\t\t\t\tif(m==20) {System.out.print('K');}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println();\n\t}\n\tpublic static void main(String[] args) {\n\t\tScanner in=new Scanner(System.in);\n\t\tint b=in.nextInt();\n\t\tfor(int i=1;i<301;i++) {\n\t\t\tcheck(i,b);\n\t\t}\n\t}\n}",COMPILE_ERROR,0,0
1316557281514274816,66b2f8d2ec861ca94cd78e01d64a01741eb545e2d19b39cd55de7ea5e5b4a051,2020-10-15 09:51:31,Java,80.0,1283640625844654087,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void check(int n,int b) {\n\t\tint[] num=new int[20];\n\t\tint i=0;\n\t\tint y=n*n;\n\t\tint yy=y;\n\t\tfor(;y!=0;i++) {\n\t\t\tint m=y%b;\n\t\t\ty/=b;\n\t\t\tnum[i]=m;\n\t\t}\n\t\tint x=i;\n\t\tfor(int j=0;j<(x+1)/2;j++) {\n\t\t\ti--;\n\t\t\tif(num[i]!=num[j]) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t\tint[] num2=new int[20];\n\t\ti=0;\n\t\tfor(;n!=0;i++) {\n\t\t\tint m=n%b;\n\t\t\tn/=b;\n\t\t\tnum2[i]=m;\n\t\t}\n\t\ti--;\n\t\tfor(;i>-1;i--) {\n            int m=num2[i];\n            if(m<10) {System.out.print(m);}\n\t\t\telse {\n\t\t\t\tif(m==10) {System.out.print('A');}\n\t\t\t\tif(m==11) {System.out.print('B');}\n\t\t\t\tif(m==12) {System.out.print('C');}\n\t\t\t\tif(m==13) {System.out.print('D');}\n\t\t\t\tif(m==14) {System.out.print('E');}\n\t\t\t\tif(m==15) {System.out.print('F');}\n\t\t\t\tif(m==16) {System.out.print('G');}\n\t\t\t\tif(m==17) {System.out.print('H');}\n\t\t\t\tif(m==18) {System.out.print('I');}\n\t\t\t\tif(m==19) {System.out.print('J');}\n\t\t\t\tif(m==20) {System.out.print('K');}\n\t\t\t}\n        }\n\t\tSystem.out.print(\"" \"");\n\t\tfor(;yy!=0;) {\n\t\t\tint m=yy%b;\n\t\t\tyy/=b;\n\t\t\tif(m<10) {System.out.print(m);}\n\t\t\telse {\n\t\t\t\tif(m==10) {System.out.print('A');}\n\t\t\t\tif(m==11) {System.out.print('B');}\n\t\t\t\tif(m==12) {System.out.print('C');}\n\t\t\t\tif(m==13) {System.out.print('D');}\n\t\t\t\tif(m==14) {System.out.print('E');}\n\t\t\t\tif(m==15) {System.out.print('F');}\n\t\t\t\tif(m==16) {System.out.print('G');}\n\t\t\t\tif(m==17) {System.out.print('H');}\n\t\t\t\tif(m==18) {System.out.print('I');}\n\t\t\t\tif(m==19) {System.out.print('J');}\n\t\t\t\tif(m==20) {System.out.print('K');}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println();\n\t}\n\tpublic static void main(String[] args) {\n\t\tScanner in=new Scanner(System.in);\n\t\tint b=in.nextInt();\n\t\tfor(int i=1;i<301;i++) {\n\t\t\tcheck(i,b);\n\t\t}\n\t}\n}",ACCEPTED,994,14944
1316574579557974016,4857ec95d14596a0a76f67f78dd8a2cb262fa3ed1997e1c92d98a2c9aa215fc0,2020-10-15 11:00:15,Java,80.0,1283640625844654087,1267442030214471680,1049226397448056832,"import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        int B;\n        Scanner sc=new Scanner(System.in);\n        B=sc.nextInt();\n        for (int i = 1; i <= 300;i++)\n            turn(i, B);\n    }\n    public static void show(int x){\n        if(x<10)\n            System.out.print(x);\n        else{\n            char y;\n            y=(char)(x+55);\n            System.out.print(y);\n        }\n    }\n\n    public static int choose(int[]a,int pi){\n        int f=1;\n        for(int j=1;j<=pi/2;j++){\n            if(a[j]!=a[pi+1-j]){\n                f=0;\n                break;\n            }\n        }\n        return f;\n    }\n\n    public static void turn(int x,int b){\n        int c[]=new int[100];\n        int x0;\n        int[]a=new int[100];\n\n        x0 = x;\n        x=x*x;\n        int i = 1;\n        for (;;i++)        //进制转化\n        {\n            a[i] = x % b;\n            if(x>=b)\n                x = x / b;\n            else\n                break;\n        }\n        int j = 1;\n        for (;;j++)\n        {\n            c[j] = x0 % b;\n            if(x0>=b)\n                x0 = x0 / b;\n            else\n                break;\n        }\n        int f = choose(a, i);\n        if(f==1)\n        {\n            for (;j>=1;j--)\n                show(c[j]);\n            System.out.print(\"" \"");\n            for (; i >= 1;i--)\n                show(a[i]);\n            System.out.println();\n        }\n    }\n}\n",ACCEPTED,1017,14536
1317296866133430272,4857ec95d14596a0a76f67f78dd8a2cb262fa3ed1997e1c92d98a2c9aa215fc0,2020-10-17 10:50:21,C++,0.0,1283640625844654088,1267449136707624960,1049226397448056832,"import java.util.Scanner;\npublic class main {\n    public static int choose(int []a,int pi){\n        for (int j = 1; j <= pi / 2;j++)\n        {\n            if(a[j]!=a[pi+1-j])\n            {\n                return 0;\n            }\n        }\n        return 1;\n    }\n    public static int turn(int x){\n        int fi = 0;\n        for (int b = 2; b <= 10;b++)\n        {\n            int []c=new int[100];\n            int x0;\n            x0 = x;\n            int j = 1;\n            for (;;j++)             //进制转化\n            {\n                c[j] = x0 % b;\n                if(x0>=b)\n                    x0 = x0 / b;\n                else\n                    break;\n            }\n            int f = choose(c, j);\n            if(f==1)\n                fi++;\n        }\n        return fi;\n    }\n\n    public static void main(String[] args) {\n        int n,s,ci=0;\n        Scanner sc=new Scanner(System.in);\n        n=sc.nextInt();\n        s=sc.nextInt();\n        for (int i = s + 1;;i++)\n        {\n            if(ci==n)\n                break;\n            if(turn(i)>=2)\n            {\n                System.out.println(i);\n                ci++;\n            }\n        }\n    }\n}\n",COMPILE_ERROR,0,0
1317296912837005312,4857ec95d14596a0a76f67f78dd8a2cb262fa3ed1997e1c92d98a2c9aa215fc0,2020-10-17 10:50:32,C++,0.0,1283640625844654088,1267449136707624960,1049226397448056832,"import java.util.Scanner;\npublic class Main {\n    public static int choose(int []a,int pi){\n        for (int j = 1; j <= pi / 2;j++)\n        {\n            if(a[j]!=a[pi+1-j])\n            {\n                return 0;\n            }\n        }\n        return 1;\n    }\n    public static int turn(int x){\n        int fi = 0;\n        for (int b = 2; b <= 10;b++)\n        {\n            int []c=new int[100];\n            int x0;\n            x0 = x;\n            int j = 1;\n            for (;;j++)             //进制转化\n            {\n                c[j] = x0 % b;\n                if(x0>=b)\n                    x0 = x0 / b;\n                else\n                    break;\n            }\n            int f = choose(c, j);\n            if(f==1)\n                fi++;\n        }\n        return fi;\n    }\n\n    public static void main(String[] args) {\n        int n,s,ci=0;\n        Scanner sc=new Scanner(System.in);\n        n=sc.nextInt();\n        s=sc.nextInt();\n        for (int i = s + 1;;i++)\n        {\n            if(ci==n)\n                break;\n            if(turn(i)>=2)\n            {\n                System.out.println(i);\n                ci++;\n            }\n        }\n    }\n}\n",COMPILE_ERROR,0,0
1317297306510184448,4857ec95d14596a0a76f67f78dd8a2cb262fa3ed1997e1c92d98a2c9aa215fc0,2020-10-17 10:52:06,Java,70.0,1283640625844654088,1267449136707624960,1049226397448056832,"import java.util.Scanner;\npublic class Main {\n    public static int choose(int []a,int pi){\n        for (int j = 1; j <= pi / 2;j++)\n        {\n            if(a[j]!=a[pi+1-j])\n            {\n                return 0;\n            }\n        }\n        return 1;\n    }\n    public static int turn(int x){\n        int fi = 0;\n        for (int b = 2; b <= 10;b++)\n        {\n            int []c=new int[100];\n            int x0;\n            x0 = x;\n            int j = 1;\n            for (;;j++)             //进制转化\n            {\n                c[j] = x0 % b;\n                if(x0>=b)\n                    x0 = x0 / b;\n                else\n                    break;\n            }\n            int f = choose(c, j);\n            if(f==1)\n                fi++;\n        }\n        return fi;\n    }\n\n    public static void main(String[] args) {\n        int n,s,ci=0;\n        Scanner sc=new Scanner(System.in);\n        n=sc.nextInt();\n        s=sc.nextInt();\n        for (int i = s + 1;;i++)\n        {\n            if(ci==n)\n                break;\n            if(turn(i)>=2)\n            {\n                System.out.println(i);\n                ci++;\n            }\n        }\n    }\n}\n",ACCEPTED,1001,22832
1317739821600231424,2dbc8dbbe3a3713fd279f85d78da00257659b0fa27c0cdad54e2bf4fb0d9580e,2020-10-18 16:10:30,Java,0.0,1283640625844654088,1267449136707624960,1049226397448056832,"#include <iostream>  \n#include <vector>\n#include <string>  \n#include <algorithm>  \nusing namespace std;\n\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1])\n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1) // 是回文数；\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，n是待转数字，radix是指定的进制\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\n        {\n            ans += t + '0';\n        }\n        else\n        {\n            ans += t - 10 + 'A';\n        }\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（）以防止输入为0的情况\n    reverse(ans.begin(), ans.end());\n    return ans;\n}\n\nint main()\n{\n    int n, s;\n    cin >> n >> s;\n    s++; //双重回文数要大于s，从s+1开始遍历；\n    vector<int> p; // 容器p，存放双重回文数；\n    int sum; // 记录有几种进制的数是回文数；\n    while ((p.size() < n)) // 根据容器p里双重回文数的个数决定是否终止程序；\n    {\n        sum = 0;\n        for (int i = 2; i <= 10; i++)\n        {\n            if (Palin_num(intToA(s, i))) // 此时对应进制的数是回文数；\n            {\n                sum++; // 记录次数+1；\n            }\n        }\n        if (sum >= 2) // 双重回文数，压入容器p中；\n        {\n            p.push_back(s);\n        }\n        s++; // 继续遍历；\n    }\n    for (int i = 0; i < p.size(); i++)\n    {\n        cout << p[i] << endl;\n    }\n    return 0;\n}\n",COMPILE_ERROR,0,0
1317739846887587840,2dbc8dbbe3a3713fd279f85d78da00257659b0fa27c0cdad54e2bf4fb0d9580e,2020-10-18 16:10:36,C++,70.0,1283640625844654088,1267449136707624960,1049226397448056832,"#include <iostream>  \n#include <vector>\n#include <string>  \n#include <algorithm>  \nusing namespace std;\n\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1])\n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1) // 是回文数；\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，n是待转数字，radix是指定的进制\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\n        {\n            ans += t + '0';\n        }\n        else\n        {\n            ans += t - 10 + 'A';\n        }\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（）以防止输入为0的情况\n    reverse(ans.begin(), ans.end());\n    return ans;\n}\n\nint main()\n{\n    int n, s;\n    cin >> n >> s;\n    s++; //双重回文数要大于s，从s+1开始遍历；\n    vector<int> p; // 容器p，存放双重回文数；\n    int sum; // 记录有几种进制的数是回文数；\n    while ((p.size() < n)) // 根据容器p里双重回文数的个数决定是否终止程序；\n    {\n        sum = 0;\n        for (int i = 2; i <= 10; i++)\n        {\n            if (Palin_num(intToA(s, i))) // 此时对应进制的数是回文数；\n            {\n                sum++; // 记录次数+1；\n            }\n        }\n        if (sum >= 2) // 双重回文数，压入容器p中；\n        {\n            p.push_back(s);\n        }\n        s++; // 继续遍历；\n    }\n    for (int i = 0; i < p.size(); i++)\n    {\n        cout << p[i] << endl;\n    }\n    return 0;\n}\n",ACCEPTED,27,512
1322480831983304704,ab3ac7d3615ec928fcbb93f4072aaa583f19767afc2dc1d5e045648b0b245af1,2020-10-31 18:09:35,C++,10.0,1283640625844654088,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nbool ishuiwen(int a[],int len);\nbool isdoublehw(int a);\nint N,S;\nint main()\n{\n\tcin>>N>>S;\n\tint record=0;\n\tint num=S+1;\n\twhile(record<N)\n\t{\n\t\tif(isdoublehw(num))\n\t\t{\n\t\t\trecord++;\n\t\t\tcout<<num<<endl;\n\t\t}\n\t\tnum++;\n\t}\n}\nbool ishuiwen(int a[],int len)\n{\n\tfor(int i=1;i<=len;i++)\n\t{\n\t\tif(a[i]!=a[len])\n\t\treturn false;\n\t\tlen--;\n\t}\n\treturn true;\n}\nbool isdoublehw(int a)\n{\n\tint len;\n\tint rec=0;\n\tint a1=a;\n\tint num_nary[15];\n\tfor(int i=2;i<=10;i++)\n\t{\n\t\tlen=0;\n\t\twhile(a1!=0) \n\t\t{\n\t\t\tnum_nary[++len]=a1%i;\n\t\t\ta1=a1/i;\n\t\t}\n\t\tif(ishuiwen(num_nary,len))\n\t\trec++;\n\t}\n\tif(rec>=2)\n\treturn true;\n\telse\n\treturn false;\n}",PARTIAL_ACCEPTED,27,484
1322483492317085696,ab3ac7d3615ec928fcbb93f4072aaa583f19767afc2dc1d5e045648b0b245af1,2020-10-31 18:20:09,C++,70.0,1283640625844654088,1267449136707624960,1049226397448056832,"#include<iostream>\nusing namespace std;\nbool ishuiwen(int a[],int len);\nbool isdoublehw(int a);\nint N,S;\nint num_nary[20];\nint len;\nint main()\n{\n\tcin>>N>>S;\n\tint record=0;\n\tint num=S+1;\n\twhile(record<N)\n\t{\n\t\tif(isdoublehw(num))\n\t\t{\n\t\t\trecord++;\n\t\t\tcout<<num<<endl;\n\t\t}\n\t\tnum++;\n\t}\n}\nbool ishuiwen()\n{\n\tfor(int i=1;i<=len;i++)\n\t{\n\t\tif(num_nary[i]!=num_nary[len])\n\t\treturn false;\n\t\tlen--;\n\t}\n\treturn true;\n}\nbool isdoublehw(int a)\n{\n\tint rec=0;\n\tfor(int i=2;i<=10;i++)\n\t{\n\t\tint a1=a;\n\t\tlen=0;\n\t\twhile(a1!=0) \n\t\t{\n\t\t\tnum_nary[++len]=a1%i;\n\t\t\ta1=a1/i;\n\t\t}\n\t\tif(ishuiwen())\n\t\trec++;\n\t}\n\tif(rec>=2)\n\treturn true;\n\telse\n\treturn false;\n}",ACCEPTED,31,512
1324591965564653568,aef415abc46901e97f1978f8e79b8d564f9efd4d1cc1807579b416efd335a6aa,2020-11-06 13:58:28,Java,10.0,1283640625844654087,1267442030214471680,1049226397448056832,"import java.util.*;\n\npublic class Main {\n    public static int[]num=new int[9];\n    public static int b;\n    public static boolean isPal(int x){\n        int size=0;\n        while(x!=0){\n            num[size]=x%b;\n            x/=b;\n            ++size;\n        }\n        for(int i=0;i<size/2;++i){\n            if(num[i]!=num[size-i-1]){\n                return false;\n            }\n        }\n        return true;\n    }\n    public static void main(String args[]) {\n        Scanner in = new Scanner(System.in);\n        b=in.nextInt();\n        for(int i=1;i<=300;++i){\n            if(isPal(i*i)){\n                System.out.println(i+\"" \""+i*i);\n            }\n        }\n        in.close();\n    }\n\n}",PARTIAL_ACCEPTED,1052,14332
1324606486762012672,aef415abc46901e97f1978f8e79b8d564f9efd4d1cc1807579b416efd335a6aa,2020-11-06 14:56:11,Java,0.0,1283640625844654087,1267442030214471680,1049226397448056832,"import java.util.*;\n\npublic class Main {\n    class num {\n    private int []n;\n    private int b;\n    private int size;\n    public num(int b){\n        n=new int[17];\n        this.b=b;\n        size=0;\n    }\n    public num(int cha,int b){\n        n=new int[17];\n        this.b=b;\n        this.setNum(cha);\n    }\n    public void setNum(int cha){\n        while(cha!=0){\n            n[size]=cha%b;\n            cha/=b;\n            ++size;\n        }\n    }\n    public void printNum(){\n        for(int i=size-1;i>=0;--i){\n            if(n[i]>=10){\n                System.out.print((char)(n[i])+55);\n            }\n            else{\n                System.out.print(n[i]);\n            }\n        }\n    }\n    public boolean isPal(){\n        for(int i=0;i<size/2;++i){\n            if(n[i]!=n[size-i-1])return false;\n        }\n        return true;\n    }\n}\n    public static void main(String args[]) {\n        Scanner in = new Scanner(System.in);\n        int b=in.nextInt();\n        //new num(10,2).printNum();\n        //System.out.println(new num(3,2).isPal());\n        for(int i=2;i<=300;++i){\n            num a=new num(i*i,b);\n            if(a.isPal()){\n                new num(i,b).printNum();\n                System.out.print(\"" \"");\n                a.printNum();\n                System.out.println();\n            }\n        }\n        in.close();\n    }\n\n}",COMPILE_ERROR,0,0
1324606617564557312,aef415abc46901e97f1978f8e79b8d564f9efd4d1cc1807579b416efd335a6aa,2020-11-06 14:56:42,Java,0.0,1283640625844654087,1267442030214471680,1049226397448056832,"import java.util.*;\nclass num {\n    private int []n;\n    private int b;\n    private int size;\n    public num(int b){\n        n=new int[17];\n        this.b=b;\n        size=0;\n    }\n    public num(int cha,int b){\n        n=new int[17];\n        this.b=b;\n        this.setNum(cha);\n    }\n    public void setNum(int cha){\n        while(cha!=0){\n            n[size]=cha%b;\n            cha/=b;\n            ++size;\n        }\n    }\n    public void printNum(){\n        for(int i=size-1;i>=0;--i){\n            if(n[i]>=10){\n                System.out.print((char)(n[i])+55);\n            }\n            else{\n                System.out.print(n[i]);\n            }\n        }\n    }\n    public boolean isPal(){\n        for(int i=0;i<size/2;++i){\n            if(n[i]!=n[size-i-1])return false;\n        }\n        return true;\n    }\n}\npublic class Main {\n    \n    public static void main(String args[]) {\n        Scanner in = new Scanner(System.in);\n        int b=in.nextInt();\n        //new num(10,2).printNum();\n        //System.out.println(new num(3,2).isPal());\n        for(int i=2;i<=300;++i){\n            num a=new num(i*i,b);\n            if(a.isPal()){\n                new num(i,b).printNum();\n                System.out.print(\"" \"");\n                a.printNum();\n                System.out.println();\n            }\n        }\n        in.close();\n    }\n\n}",WRONG_ANSWER,1073,14012
1324607157049540608,aef415abc46901e97f1978f8e79b8d564f9efd4d1cc1807579b416efd335a6aa,2020-11-06 14:58:50,Java,50.0,1283640625844654087,1267442030214471680,1049226397448056832,"import java.util.*;\nclass num {\n    private int []n;\n    private int b;\n    private int size;\n    public num(int b){\n        n=new int[17];\n        this.b=b;\n        size=0;\n    }\n    public num(int cha,int b){\n        n=new int[17];\n        this.b=b;\n        this.setNum(cha);\n    }\n    public void setNum(int cha){\n        while(cha!=0){\n            n[size]=cha%b;\n            cha/=b;\n            ++size;\n        }\n    }\n    public void printNum(){\n        for(int i=size-1;i>=0;--i){\n            if(n[i]>=10){\n                System.out.print((char)(n[i])+55);\n            }\n            else{\n                System.out.print(n[i]);\n            }\n        }\n    }\n    public boolean isPal(){\n        for(int i=0;i<size/2;++i){\n            if(n[i]!=n[size-i-1])return false;\n        }\n        return true;\n    }\n}\npublic class Main {\n    \n    public static void main(String args[]) {\n        Scanner in = new Scanner(System.in);\n        int b=in.nextInt();\n        //new num(10,2).printNum();\n        //System.out.println(new num(3,2).isPal());\n        System.out.println(\""1 1\"");\n        for(int i=2;i<=300;++i){\n            num a=new num(i*i,b);\n            if(a.isPal()){\n                new num(i,b).printNum();\n                System.out.print(\"" \"");\n                a.printNum();\n                System.out.println();\n            }\n        }\n        in.close();\n    }\n\n}",PARTIAL_ACCEPTED,1126,13908
1324609613745668096,aef415abc46901e97f1978f8e79b8d564f9efd4d1cc1807579b416efd335a6aa,2020-11-06 15:08:36,Java,80.0,1283640625844654087,1267442030214471680,1049226397448056832,"import java.util.*;\nclass num {\n    private int []n;\n    private int b;\n    private int size;\n    public num(int b){\n        n=new int[17];\n        this.b=b;\n        size=0;\n    }\n    public num(int cha,int b){\n        n=new int[17];\n        this.b=b;\n        this.setNum(cha);\n    }\n    public void setNum(int cha){\n        while(cha!=0){\n            n[size]=cha%b;\n            cha/=b;\n            ++size;\n        }\n    }\n    public void printNum(){\n        for(int i=size-1;i>=0;--i){\n            if(n[i]>=10){\n                System.out.print((char)(n[i]+55));\n            }\n            else{\n                System.out.print(n[i]);\n            }\n        }\n    }\n    public boolean isPal(){\n        for(int i=0;i<size/2;++i){\n            if(n[i]!=n[size-i-1])return false;\n        }\n        return true;\n    }\n}\npublic class Main {\n    \n    public static void main(String args[]) {\n        Scanner in = new Scanner(System.in);\n        int b=in.nextInt();\n        //new num(10,2).printNum();\n        //System.out.println(new num(3,2).isPal());\n        System.out.println(\""1 1\"");\n        for(int i=2;i<=300;++i){\n            num a=new num(i*i,b);\n            if(a.isPal()){\n                new num(i,b).printNum();\n                System.out.print(\"" \"");\n                a.printNum();\n                System.out.println();\n            }\n        }\n        in.close();\n    }\n\n}",ACCEPTED,1057,14100
1324612688676999168,aef415abc46901e97f1978f8e79b8d564f9efd4d1cc1807579b416efd335a6aa,2020-11-06 15:20:49,Java,50.0,1283640625844654088,1267449136707624960,1049226397448056832,"import java.util.*;\nclass num {\n    private int []n;\n    private int b;\n    private int size;\n    public num(int b){\n        n=new int[17];\n        this.b=b;\n        size=0;\n    }\n    public num(int cha,int b){\n        n=new int[17];\n        this.b=b;\n        this.setNum(cha);\n    }\n    public void setNum(int cha){\n        while(cha!=0){\n            n[size]=cha%b;\n            cha/=b;\n            ++size;\n        }\n    }\n    public void printNum(){\n        for(int i=size-1;i>=0;--i){\n            if(n[i]>=10){\n                System.out.print((char)(n[i]+55));\n            }\n            else{\n                System.out.print(n[i]);\n            }\n        }\n    }\n    public boolean isPal(){\n        for(int i=0;i<size/2;++i){\n            if(n[i]!=n[size-i-1])return false;\n        }\n        return true;\n    }\n    \n}\npublic class Main {\n    public static boolean hasTwoPal(int n){\n        int count=0;\n        for(int i=10;i>=2;--i){\n            if(new num(n,i).isPal()){\n                ++count;\n            }\n            if(count>=2){\n                return true;\n            }\n        }\n        return false;\n    }\n    public static void main(String args[]) {\n        Scanner in = new Scanner(System.in);\n        int n=in.nextInt(),s=in.nextInt();\n        for(int counter=0;counter<n;){\n            if(hasTwoPal(s)){\n                System.out.println(s);\n                ++counter;\n            }\n            ++s;\n        }\n        in.close();\n    }\n\n}",PARTIAL_ACCEPTED,910,16320
1324613864148484096,aef415abc46901e97f1978f8e79b8d564f9efd4d1cc1807579b416efd335a6aa,2020-11-06 15:25:29,Java,70.0,1283640625844654088,1267449136707624960,1049226397448056832,"import java.util.*;\nclass num {\n    private int []n;\n    private int b;\n    private int size;\n    public num(int b){\n        n=new int[17];\n        this.b=b;\n        size=0;\n    }\n    public num(int cha,int b){\n        n=new int[17];\n        this.b=b;\n        this.setNum(cha);\n    }\n    public void setNum(int cha){\n        while(cha!=0){\n            n[size]=cha%b;\n            cha/=b;\n            ++size;\n        }\n    }\n    public void printNum(){\n        for(int i=size-1;i>=0;--i){\n            if(n[i]>=10){\n                System.out.print((char)(n[i]+55));\n            }\n            else{\n                System.out.print(n[i]);\n            }\n        }\n    }\n    public boolean isPal(){\n        for(int i=0;i<size/2;++i){\n            if(n[i]!=n[size-i-1])return false;\n        }\n        return true;\n    }\n    \n}\npublic class Main {\n    public static boolean hasTwoPal(int n){\n        int count=0;\n        for(int i=10;i>=2;--i){\n            if(new num(n,i).isPal()){\n                ++count;\n            }\n            if(count>=2){\n                return true;\n            }\n        }\n        return false;\n    }\n    public static void main(String args[]) {\n        Scanner in = new Scanner(System.in);\n        int n=in.nextInt(),s=in.nextInt();\n        ++s;\n        for(int counter=0;counter<n;){\n            if(hasTwoPal(s)){\n                System.out.println(s);\n                ++counter;\n            }\n            ++s;\n        }\n        in.close();\n    }\n\n}",ACCEPTED,961,16376
1367854849797218304,3aaf4a732f987c33a81e41e1172d3cf2aa189e2b3924d74038f27ba4d11214e7,2021-03-05 23:09:44,C++,80.0,1283640625844654087,1267442030214471680,1049226397448056832,"#include <iostream>\n#include <string>\n#include <algorithm> \nusing namespace std;\n\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1]) \n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1) // 是回文数；\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，使用模N取余法；\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\t\n        {\n            ans += t + '0';\n        }\n        else \n        {\n            ans += t - 10 + 'A'; // 保证进制大于10时，数字能用大写字母表示；\n        }\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（），以防止输入为0的情况；\n    reverse(ans.begin(), ans.end());  // 模N取余法，得到的字符串反转即可得到对应进制的数；\n    return ans;\n}\n\nint main()\n{\n    int n;\n    cin >> n;\n    int j = 0;\n    for (int x = 1; x <= 300; x++)\n    {\n        j = x; // 创建副本\n        \n        string s1 = intToA(j, n);      // 将整数按n进制转换；\n        string s2 = intToA((j * j), n);// 将该数的平方按n进制转换；\n\n        if (Palin_num(s2))\n        {\n            cout << s1 << \"" \"" << s2 << endl;\n        }\n        else\n        {\n            continue;\n        }\n    }\n    return 0;\n}\n",ACCEPTED,135,440
1367854974120583168,3aaf4a732f987c33a81e41e1172d3cf2aa189e2b3924d74038f27ba4d11214e7,2021-03-05 23:10:13,C++,70.0,1283640625844654088,1267449136707624960,1049226397448056832,"#include <iostream>  \n#include <vector>\n#include <string>  \n#include <algorithm>  \nusing namespace std;\n\nbool Palin_num(const string a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n{\n    int length;\n    length = a.length();\n    int flag = 1;\n    for (int i = 0; i <= (length / 2); i++)\n    {\n        if (a[i] != a[length - i - 1])\n        {\n            flag = 0;\n            break;\n        }\n    }\n    if (flag == 1) // 是回文数；\n    {\n        return true;\n    }\n    else\n    {\n        return false;\n    }\n}\n\nstring intToA(int n, int radix)    //进制转换函数，n是待转数字，radix是指定的进制\n{\n    string ans = \""\"";\n    do {\n        int t = n % radix;\n        if (t >= 0 && t <= 9)\n        {\n            ans += t + '0';\n        }\n        else\n        {\n            ans += t - 10 + 'A';\n        }\n        n /= radix;\n    } while (n != 0);\t// 使用do{}while（）以防止输入为0的情况\n    reverse(ans.begin(), ans.end());\n    return ans;\n}\n\nint main()\n{\n    int n, s;\n    cin >> n >> s;\n    s++; //双重回文数要大于s，从s+1开始遍历；\n    vector<int> p; // 容器p，存放双重回文数；\n    int sum; // 记录有几种进制的数是回文数；\n    while ((p.size() < n)) // 根据容器p里双重回文数的个数决定是否终止程序；\n    {\n        sum = 0;\n        for (int i = 2; i <= 10; i++)\n        {\n            if (Palin_num(intToA(s, i))) // 此时对应进制的数是回文数；\n            {\n                sum++; // 记录次数+1；\n            }\n        }\n        if (sum >= 2) // 双重回文数，压入容器p中；\n        {\n            p.push_back(s);\n        }\n        s++; // 继续遍历；\n    }\n    for (int i = 0; i < p.size(); i++)\n    {\n        cout << p[i] << endl;\n    }\n    return 0;\n}\n",ACCEPTED,80,324
1387670166607900672,62c28946ff673e4465df1d3a3f199d062324c51b570f00bfca1efb71f0ba778b,2021-04-29 15:28:44,C++,80.0,1283640625844654087,1267442030214471680,1049226397448056832,"#include <iostream>\nusing namespace std;\nvoid convert(int N, int x) {\n\tint n = 0, m = 0;\n\tint fang = x * x;\n\tint a[20], b[20];\n\twhile (x) {b[m++] = x % N;x/= N;}\n\twhile (fang) {\n\t\ta[n++] = fang % N;\n\t\tfang/=N;\n\t}\n\tint flag = 1;\n\tint i = 0;\n\tfor (i = 0; i < n / 2; i++) \n\t\tif (a[i] != a[n - i - 1])\n\t\t{\n\t\t\tflag = 0;\n\t\t\tbreak;\n\t\t}\n\tif (flag) {\n\t\tfor (i = m - 1; i >= 0; i--)\n        {if (b[i] > 9)\n\t\t\t\tcout<<char(b[i] - 10 + 'A');\n\t\t\telse\n\t\t\t\tcout << b[i];\n            if(i==0)cout<<' ';\n        }\n\t\tfor (i = 0; i < n - 1; i++)\n\t\t\tif (a[i] > 9)\n\t\t\t\tcout<<char(a[i] - 10 + 'A');\n\t\t\telse\n\t\t\t\tcout << a[i];\n\t\tif (a[i] > 9)\n\t\t\tcout<<char(a[i] - 10 + 'A')<<endl;\n\t\telse cout << a[i] << \""\\n\"";\n\t}\n}\n\nint main() {\n\tint aa, i;\n\tcin >> aa;\n\tfor (i = 1; i <= 300; i++) \n    {\n\t\tconvert(aa, i);\n\t}\n\treturn 0;\n}",ACCEPTED,36,448
1387670257917898752,62c28946ff673e4465df1d3a3f199d062324c51b570f00bfca1efb71f0ba778b,2021-04-29 15:29:05,C++,70.0,1283640625844654088,1267449136707624960,1049226397448056832,"#include <iostream>\nusing namespace std;\nbool convert(int N, int fang)\n{\n\tint n = 0, m = 0;\n\tint a[20];\n\twhile (fang) {\n\t\ta[n++] = fang % N;\n\t\tfang /= N;\n\t}\n\tint flag = 1;\n\tint i = 0;\n\tfor (i = 0; i < n / 2; i++)\n\t\tif (a[i] != a[n - i - 1])\n\t\t{\n\t\t\tflag = 0;\n\t\t\tbreak;\n\t\t}\n\tif (flag) return true;\n\treturn false;\n}\nint main()\n{\n\tint aa, bb, i, j, kk = 0, c[20000] = { 0 };\n\tcin >> aa >> bb;\n\tfor (i = bb + 1; kk < aa; i++)\n\t{\n\t\tfor (j = 2; j < 11; j++)\n\t\t\tif (convert(j, i)) { c[i]++; }\n\t\tif (c[i] > 1)kk++;\n\t}\n\tj = 0;\n\tfor (i = bb + 1; j < aa, i < 20000; i++)\n\t\tif (c[i] >= 2) { cout << i << endl; j++; }\n\treturn 0;\n}",ACCEPTED,42,456
1307573716884635648,7128d1c2518227e6089accad9ced68f609c050aa6eaaf488d37fea130791f038,2020-09-20 14:54:02,Java,50.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.*;\npublic class Main{\n\tpublic static void main(String args[]) {\n\t\tInteger b=0;\n\t\tScanner s=new Scanner(System.in);\n\t\tb=s.nextInt();\n\t\t//,输出所有的大于等于1小于等于300且它的平方用B\n\t\tfor(int i=1;i<=300;i++){\n\t\t\tString str=new String();\n\t\t\tstr=Integer.toString(i*i, b);\n\t\t\tif(isPalin(str)){\n\t\t\t\tSystem.out.print(Integer.toString(i, b)+\"" \""+str+\""\\n\"");\n\t\t\t}\n\t\t}\n\t}\n\tpublic static boolean isPalin(String str){//是否为回文\n\t\tint len=str.length();\n\t\tfor(int i=0,j=len-1;i<=j;i++,j--){\n\t\t\tif(str.charAt(i)!=str.charAt(j))\n\t\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n}\n",PARTIAL_ACCEPTED,920,10940
1307574391760732160,7128d1c2518227e6089accad9ced68f609c050aa6eaaf488d37fea130791f038,2020-09-20 14:56:43,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.*;\npublic class Main{\n\tpublic static void main(String args[]) {\n\t\tInteger b=0;\n\t\tScanner s=new Scanner(System.in);\n\t\tb=s.nextInt();\n\t\t//,输出所有的大于等于1小于等于300且它的平方用B\n\t\tfor(int i=1;i<=300;i++){\n\t\t\tString str=new String();\n\t\t\tstr=Integer.toString(i*i, b);\n\t\t\tif(isPalin(str)){\n\t\t\t\tSystem.out.print(Integer.toString(i, b).toUpperCase()+\"" \""+str.toUpperCase()+\""\\n\"");\n\t\t\t}\n\t\t}\n\t}\n\tpublic static boolean isPalin(String str){//是否为回文\n\t\tint len=str.length();\n\t\tfor(int i=0,j=len-1;i<=j;i++,j--){\n\t\t\tif(str.charAt(i)!=str.charAt(j))\n\t\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n}\n",ACCEPTED,997,10700
1307577008335339520,7128d1c2518227e6089accad9ced68f609c050aa6eaaf488d37fea130791f038,2020-09-20 15:07:07,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.*;\npublic class Main {\n\tpublic static boolean isPalin(String str){//是否为回文\n\t\tint len=str.length();\n\t\tfor(int i=0,j=len-1;i<=j;i++,j--){\n\t\t\tif(str.charAt(i)!=str.charAt(j))\n\t\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n\tpublic static void main(String args[]){\n\t\tScanner s=new Scanner(System.in);\n\t\tint N=s.nextInt(),S=s.nextInt();\n\t\tfor(int i=S+1,j=0;j<N;i++){\n\t\t\tint l=0;\n\t\t\tfor(int k=2;k<=10 && l<2;k++){\n\t\t\t\tif(isPalin(Integer.toString(i,k)))\n\t\t\t\t\tl++;\n\t\t\t}\n\t\t\tif(l==2){\n\t\t\t\tSystem.out.println(i);\n\t\t\t\tj++;\n\t\t\t}\n\t\t}\n\t}\n}\n",ACCEPTED,902,14948
1307638767565914112,485ab61fc25e0ae4e4433cb9631321cbc61d9406baf84a0ecea90d4f4ffd8dbc,2020-09-20 19:12:31,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"\nimport java.util.Scanner;\n\npublic class Main {\n        static String Digit = \""0123456789ABCDEFGHIJK\"";\n        public static void main(String[] args) throws Exception {\n                Scanner in = new Scanner(System.in);\n                int b = in.nextInt();\n                String ans;\n                for (int i = 1; i <= 300; ++i) {\n                        ans = Trans(i*i, b);\n                        if(Test(ans))\n                                System.out.println(Rerv(Trans(i, b)) + \"" \"" + ans);\n                }\n        }\n        static String Trans(int x, int k) {\n                String t = \""\"";\n                while(x > 0) {\n                        t += Digit.charAt(x % k);\n                        x /= k;\n                }\n                return t;\n        }\n\n        static String Rerv(String x) {\n                String t = \""\"";\n                for (int i = 0; i < x.length(); ++i)\n                        t += x.charAt(x.length()-1-i);\n                return t;\n        }\n        static boolean Test(String x) {\n                for (int i = 0; i < x.length()/2+1; ++i)\n                        if(x.charAt(i) != x.charAt(x.length()-i-1))\n                                return false;\n                return true;\n        }\n}\n\n\n\n\n",ACCEPTED,986,11344
1307640274868748288,485ab61fc25e0ae4e4433cb9631321cbc61d9406baf84a0ecea90d4f4ffd8dbc,2020-09-20 19:18:30,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"\nimport java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner in = new Scanner(System.in);\n\n        int cnt = 0, n = in.nextInt(), s = in.nextInt();\n        while(cnt < n) {\n            s++;\n            int t = 0;\n            for(int i = 2; i <= 10; ++i) {\n                if (Test(Trans(s, i))) {\n                    ++t;\n                    if (t >= 2) {\n                        System.out.println(s);\n                        ++cnt;\n                        break;\n                    }\n                }\n            }\n        }\n    }\n    static String Trans(int x, int k) {\n        StringBuffer t = new StringBuffer();\n        while(x > 0) {\n            t.append((char)(x % k + '0'));\n            x /= k;\n        }\n        return t.toString();\n    }\n    static boolean Test(String x) {\n        for (int i = 0; i < x.length()/2+1; ++i)\n            if(x.charAt(i) != x.charAt(x.length()-i-1))\n                return false;\n        return true;\n    }\n}\n",ACCEPTED,910,14964
1307658596343595008,6e49bd3d7e0af2b8cb29113dd913759594671ed1f457c78b44b78360f6daf7d0,2020-09-20 20:31:19,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\nclass Pair implements Comparable<Pair> {\n\tpublic int first;\n\tpublic int second;\n\n\tpublic Pair(int first, int second) {\n\t\tthis.first = first;\n\t\tthis.second = second;\n\t}\n\n\t@Override\n\tpublic int compareTo(Pair o) {\n\t\tif (this.first < o.first)\n\t\t\treturn -1;\n\t\telse if (this.first > o.first)\n\t\t\treturn 1;\n\t\telse\n\t\t\treturn 0;\n\t}\n\n}\n\npublic class Main {\n\tstatic void println(Object str) {\n\t\tSystem.out.println(str);\n\t}\n\n\tstatic void print(Object str, String end) {\n\t\tSystem.out.println(str.toString() + end);\n\t}\n\n\tstatic int max(int a, int b) {\n\t\tif (a < b)\n\t\t\treturn b;\n\t\telse\n\t\t\treturn a;\n\t}\n\t/*\n\t * 上面是自定义的常用函数\n\t */\n\n\tstatic String transToN(int a, int n) { // 10进制转到n进制\n\t\tString tmp = \""\"";\n\t\twhile (a / n > 0) {\n\t\t\tif (a % n < 10) {\n\t\t\t\ttmp = String.valueOf(a % n) + tmp;\n\t\t\t} else {\n\t\t\t\ttmp = (char) ('A' + (a % n) - 10) + tmp;\n\t\t\t}\n\t\t\ta /= n;\n\t\t}\n\t\tif (a != 0) {\n\t\t\tif (a < 10) {\n\t\t\t\ttmp = String.valueOf(a) + tmp;\n\t\t\t} else {\n\t\t\t\ttmp = (char) ('A' + a - 10) + tmp;\n\t\t\t}\n\t\t}\n\n\t\treturn tmp;\n\t}\n\n\tstatic boolean isHuiWen(int a, int n) {\n\t\tString tmp = transToN(a, n);\n\t\tint tlen = tmp.length();\n\t\tfor (int i = 0; i < (tlen / 2); ++i) {\n\t\t\tif (tmp.charAt(i) != tmp.charAt(tlen - i - 1))\n\t\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tint B;\n\t\tScanner in = new Scanner(System.in);\n\t\tB = in.nextInt();\n\t\tfor (int i = 1; i <= 300; ++i) {\n\t\t\tint tmp = i * i;\n\t\t\tif (isHuiWen(tmp, B)) {\n\t\t\t\tprintln(transToN(i, B) + \"" \"" + transToN(tmp, B));\n\t\t\t}\n\t\t}\n\t\tin.close();\n\t}\n\n}",ACCEPTED,1027,12420
1307671237397037056,d8321467439a37c77d422396cd6dd920b1748636a3c931dbeb45272c6d8542f2,2020-09-20 21:21:33,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\npublic class Main {\n\tpublic static String transform(int B,int num)\n\t{\n\t\tString s = \""\"";\n\t\tchar[] str = {'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','K'};\n\t\twhile (num != 0)\n\t\t{\n\t\t\ts = str[num % B] + s;\n\t\t\tnum = num / B;\n\t\t}\n\t\treturn s;\n\t}\n\tpublic static boolean isNum(String s1)\n\t{\n\t\tint i = 0, j = s1.length()-1;\n\t\twhile(i < j)\n\t\t{\n\t\t\tif (s1.charAt(i) != s1.charAt(j)) \n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\ti++;\n\t\t\tj--;\n\t\t}\n\t\treturn true;\n\t}\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint B = sc.nextInt();\n\t\tfor (int i=1;i<=300;i++)\n\t\t{\n\t\t\tif (isNum(transform(B,i*i)))\n\t\t\t{\n\t\t\t\tSystem.out.println(transform(B,i)+\"" \""+transform(B,i*i));\t\n\t\t\t}\t\n\t\t}\n\t}\n}",ACCEPTED,920,11352
1307671315679526912,2ae17ef3d46d69228c571dc2149bcfaf6a08711992aba3b929151c6f4a743e38,2020-09-20 21:21:51,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static boolean ishuiwen(String num) {\n\t\tchar nums[]=new char[num.length()];\n\t\tnums=num.toCharArray();\n\t\tboolean dp[][]=new boolean[10010][10010];\n\t\tint len=num.length();\n\t\tif(len==1)\n\t\t\treturn true;\n\t\tint i=len/2-1,j=0;\n\t\tif(len%2==1)\n\t\t\tj=i+2;\n\t\telse\n\t\t\tj=i+1;\n\t\tif(nums[i]==nums[j])\n\t\t\tdp[i][j]=true;\n\t\telse\n\t\t\treturn false;\n\t\t\n\t\twhile(i!=0&&dp[i][j])\n\t\t{\n\t\t\tdp[i-1][j+1]=(nums[i-1]==nums[j+1]);\n\t\t\ti-=1;\n\t\t\tj+=1;\n\t\t}\n\t\treturn dp[i][j];\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner s=new Scanner(System.in);\n\t\tint n=s.nextInt();\n\t\tfor (Integer i = 1; i <=300 ; i++) {\n\t\t\tInteger t=i*i;\n\t\t\tString num=Integer.toString(t,n);\n\t\t\tif(ishuiwen(num))\n\t\t\t{\n\t\t\t\tSystem.out.print(\""\""+Integer.toString(i,n)+\"" \""+num+\""\\n\"");\n\t\t\t}\n\t\t}\n\t\n\t}\n}",MEMORY_LIMIT_EXCEEDED,0,0
1307671386022199296,2ae17ef3d46d69228c571dc2149bcfaf6a08711992aba3b929151c6f4a743e38,2020-09-20 21:22:08,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static boolean ishuiwen(String num) {\n\t\tchar nums[]=new char[num.length()];\n\t\tnums=num.toCharArray();\n\t\tboolean dp[][]=new boolean[1010][1010];\n\t\tint len=num.length();\n\t\tif(len==1)\n\t\t\treturn true;\n\t\tint i=len/2-1,j=0;\n\t\tif(len%2==1)\n\t\t\tj=i+2;\n\t\telse\n\t\t\tj=i+1;\n\t\tif(nums[i]==nums[j])\n\t\t\tdp[i][j]=true;\n\t\telse\n\t\t\treturn false;\n\t\t\n\t\twhile(i!=0&&dp[i][j])\n\t\t{\n\t\t\tdp[i-1][j+1]=(nums[i-1]==nums[j+1]);\n\t\t\ti-=1;\n\t\t\tj+=1;\n\t\t}\n\t\treturn dp[i][j];\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner s=new Scanner(System.in);\n\t\tint n=s.nextInt();\n\t\tfor (Integer i = 1; i <=300 ; i++) {\n\t\t\tInteger t=i*i;\n\t\t\tString num=Integer.toString(t,n);\n\t\t\tif(ishuiwen(num))\n\t\t\t{\n\t\t\t\tSystem.out.print(\""\""+Integer.toString(i,n)+\"" \""+num+\""\\n\"");\n\t\t\t}\n\t\t}\n\t\n\t}\n}",MEMORY_LIMIT_EXCEEDED,0,0
1307671543639949312,8c56bfdbe6590a3d214c41dad15dfc76cffb43d7c88360c085da8afe6e5bd4cf,2020-09-20 21:22:46,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.*;\nclass Main{\n\tstatic char change(int i)\n\t{\n\t\tchar ch;\n\t\tif(i<10)\n\t\t\tch=(char) (i+'0');\n\t\telse\n\t\t\tch=(char) ((i-10)+'A');\n\t\treturn ch;\n\t}\n\tstatic void transfer(int n,int i)\n\t{\n\t\tint m=i*i;\n\t\tint p,cnta=0,cntb=0;\n\t\tchar a[]=new char[100];\n\t\tchar b[]=new char[100];\n\t\twhile(m!=0)\n\t\t{\n\t\t\tp=m%n;\n\t\t\tm=m/n;\n\t\t\tb[cntb]=change(p);\n\t\t\tcntb++;\n\t\t}\n\t\tfor(p=cntb-1;p>=0;p--)\n\t\t{\n\t\t\tif(b[p]!=b[cntb-1-p])\n\t\t\t\treturn;\n\t\t}\n\t\twhile(i!=0)\n\t\t{\n\t\t\tp=i%n;\n\t\t\ti=i/n;\n\t\t\ta[cnta]=change(p);\n\t\t\tcnta++;\n\t\t}\n\t\tfor(p=cnta-1;p>=0;p--)\n\t\t{\n\t\t\tSystem.out.print(a[p]);\n\t\t}\n\t\tSystem.out.print(' ');\n\t\tfor(p=cntb-1;p>=0;p--)\n\t\t{\n\t\t\tSystem.out.print(b[p]);\n\t\t}\n\t\tSystem.out.println();\n\t}\n    public static void main(String[] args) \n    {\n    \tScanner sin=new Scanner(System.in);\n    \tint n=sin.nextInt();\n    \tint i;\n    \tfor(i=1;i<=300;i++)\n    \t{\n    \t\ttransfer(n,i);\n    \t}\n    }\n}\t",ACCEPTED,1027,10968
1307679089327063040,2ae17ef3d46d69228c571dc2149bcfaf6a08711992aba3b929151c6f4a743e38,2020-09-20 21:52:45,Java,50.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static boolean ishuiwen(String num) {\n\t\tint len=num.length();\n\t\tchar nums[]=new char[len];\n\t\tnums=num.toCharArray();\n\t\tint i=0,j=len-1;\n\t\twhile(i<j)\n\t\t{\n\t\t\tif(nums[i]==nums[j])\n\t\t\t{\n\t\t\t\ti++;\n\t\t\t\tj--;\n\t\t\t}\n\t\t\telse {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner s=new Scanner(System.in);\n\t\tint n=s.nextInt();\n\t\tfor (Integer i = 1; i <=300 ; i++) {\n\t\t\tInteger t=i*i;\n\t\t\tString num=Integer.toString(t,n);\n\t\t\tif(ishuiwen(num))\n\t\t\t{\n\t\t\t\tSystem.out.print(\""\""+Integer.toString(i,n)+\"" \""+num+\""\\n\"");\n\t\t\t}\n\t\t}\n\t\n\t}\n}",PARTIAL_ACCEPTED,1010,11032
1307680399245950976,2ae17ef3d46d69228c571dc2149bcfaf6a08711992aba3b929151c6f4a743e38,2020-09-20 21:57:57,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static boolean ishuiwen(String num) {\n\t\tint len=num.length();\n\t\tchar nums[]=new char[len];\n\t\tnums=num.toCharArray();\n\t\tint i=0,j=len-1;\n\t\twhile(i<j)\n\t\t{\n\t\t\tif(nums[i]==nums[j])\n\t\t\t{\n\t\t\t\ti++;\n\t\t\t\tj--;\n\t\t\t}\n\t\t\telse {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner s=new Scanner(System.in);\n\t\tint n=s.nextInt();\n\t\tfor (Integer i = 1; i <=300 ; i++) {\n\t\t\tInteger t=i*i;\n\t\t\tString num=Integer.toString(t,n);\n\t\t\tif(ishuiwen(num))\n\t\t\t{\n\t\t\t\tSystem.out.print(\""\""+Integer.toString(i,n).toUpperCase()+\"" \""+num.toUpperCase()+\""\\n\"");\n\t\t\t}\n\t\t}\n\t\n\t}\n}\n",ACCEPTED,1081,10940
1307682830885306368,d8662b0321a363e011603c876acb8a6be3b4b850efd0bad68d8f7b8da79b545a,2020-09-20 22:07:37,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner= new Scanner(System.in);\n        int B =scanner.nextInt();\n        for (int i = 1;i<=300;i++){\n            StringBuffer num1= convert(i,B);\n            StringBuffer num2= convert(i*i,B);\n            if (isPalin(num2)){\n                System.out.println(num1);\n            }\n        }\n    }\n    public static boolean isPalin(StringBuffer s){\n        for (int i=0;i<s.length()/2;i++){\n            if(s.charAt(i)!=s.charAt(s.length()-i-1)){\n                return false;\n            }\n        }\n        return true;\n    }\n    public static StringBuffer convert(int num,int B) {\n        StringBuffer rtnval = new StringBuffer();\n        int digit;\n        while (num > 0) {\n            digit = num % B;\n            if (digit >= 10) {\n                rtnval.append((char) ('A' + digit - 10));\n            } else {\n                rtnval.append(digit);\n            }\n            num /= B;\n        }\n        return rtnval.reverse();\n    }\n    }",WRONG_ANSWER,1084,11544
1307683011345235968,d8662b0321a363e011603c876acb8a6be3b4b850efd0bad68d8f7b8da79b545a,2020-09-20 22:08:20,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner= new Scanner(System.in);\n        int B =scanner.nextInt();\n        for (int i = 1;i<=300;i++){\n            StringBuffer num1= convert(i,B);\n            StringBuffer num2= convert(i*i,B);\n            if (isPalin(num2)){\n                System.out.println(num1+\"" \""+num2);\n            }\n        }\n    }\n    public static boolean isPalin(StringBuffer s){\n        for (int i=0;i<s.length()/2;i++){\n            if(s.charAt(i)!=s.charAt(s.length()-i-1)){\n                return false;\n            }\n        }\n        return true;\n    }\n    public static StringBuffer convert(int num,int B) {\n        StringBuffer rtnval = new StringBuffer();\n        int digit;\n        while (num > 0) {\n            digit = num % B;\n            if (digit >= 10) {\n                rtnval.append((char) ('A' + digit - 10));\n            } else {\n                rtnval.append(digit);\n            }\n            num /= B;\n        }\n        return rtnval.reverse();\n    }\n    }",ACCEPTED,1066,11116
1307686677053685760,d8662b0321a363e011603c876acb8a6be3b4b850efd0bad68d8f7b8da79b545a,2020-09-20 22:22:54,Java,10.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        int n,s,count=0;\n        Scanner scanner = new Scanner(System.in);\n        n=scanner.nextInt();\n        s=scanner.nextInt();\n        int []num=new int[n];\n        for (int i = s+1;count<n;i++){\n            int temp=0;\n            for(int j = 2 ;j<=10;j++){\n                if(isPalin(convert(i,j))){\n                    temp++;\n                }\n                if(temp>=2){\n                    num[count]=i;\n                    break;\n                }\n            }\n            count++;\n        }\n        for(int i = 0; i<num.length;i++){\n            System.out.println(num[i]);\n        }\n    }\n    public static boolean isPalin(StringBuffer s){\n        for (int i=0;i<s.length()/2;i++){\n            if(s.charAt(i)!=s.charAt(s.length()-i-1)){\n                return false;\n            }\n        }\n        return true;\n    }\n    public static StringBuffer convert(int num,int B) {\n        StringBuffer rtnval = new StringBuffer();\n        int digit;\n        while (num > 0) {\n            digit = num % B;\n            if (digit >= 10) {\n                rtnval.append((char) ('A' + digit - 10));\n            } else {\n                rtnval.append(digit);\n            }\n            num /= B;\n        }\n        return rtnval.reverse();\n    }\n}\n",PARTIAL_ACCEPTED,818,10936
1307706269402644480,6e49bd3d7e0af2b8cb29113dd913759594671ed1f457c78b44b78360f6daf7d0,2020-09-20 23:40:45,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\nclass Pair implements Comparable<Pair> {\n\tpublic int first;\n\tpublic int second;\n\n\tpublic Pair(int first, int second) {\n\t\tthis.first = first;\n\t\tthis.second = second;\n\t}\n\n\t@Override\n\tpublic int compareTo(Pair o) {\n\t\tif (this.first < o.first)\n\t\t\treturn -1;\n\t\telse if (this.first > o.first)\n\t\t\treturn 1;\n\t\telse\n\t\t\treturn 0;\n\t}\n\n}\n\npublic class Main {\n\tstatic void println(Object str) {\n\t\tSystem.out.println(str);\n\t}\n\n\tstatic void print(Object str, String end) {\n\t\tSystem.out.println(str.toString() + end);\n\t}\n\n\tstatic int max(int a, int b) {\n\t\tif (a < b)\n\t\t\treturn b;\n\t\telse\n\t\t\treturn a;\n\t}\n\t/*\n\t * 上面是自定义的常用函数\n\t */\n\n\tstatic String transToN(int a, int n) { // 10进制转到n进制\n\t\tString tmp = \""\"";\n\t\twhile (a / n > 0) {\n\t\t\tif (a % n < 10) {\n\t\t\t\ttmp = String.valueOf(a % n) + tmp;\n\t\t\t} else {\n\t\t\t\ttmp = (char) ('A' + (a % n) - 10) + tmp;\n\t\t\t}\n\t\t\ta /= n;\n\t\t}\n\t\tif (a != 0) {\n\t\t\tif (a < 10) {\n\t\t\t\ttmp = String.valueOf(a) + tmp;\n\t\t\t} else {\n\t\t\t\ttmp = (char) ('A' + a - 10) + tmp;\n\t\t\t}\n\t\t}\n\n\t\treturn tmp;\n\t}\n\n\tstatic boolean isHuiWen(int a, int n) {\n\t\tString tmp = transToN(a, n);\n\t\tint tlen = tmp.length();\n\t\tfor (int i = 0; i < (tlen / 2); ++i) {\n\t\t\tif (tmp.charAt(i) != tmp.charAt(tlen - i - 1))\n\t\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n\n\tstatic boolean isOK(int ha) {\n\t\tint l = 0;\n\t\tfor (int i = 2; i <= 10; ++i) {\n\t\t\tif (l >= 2)\n\t\t\t\treturn true;\n\t\t\tif (isHuiWen(ha, i))\n\t\t\t\tl++;\n\t\t}\n\t\tif (l >= 2)\n\t\t\treturn true;\n\t\treturn false;\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tint N, S;\n\t\tScanner in = new Scanner(System.in);\n\t\tN = in.nextInt();\n\t\tS = in.nextInt();\n\t\tint n = 0, i = S + 1;\n\t\twhile (n < N) {\n\t\t\tif (isOK(i)) {\n\t\t\t\tprintln(i);\n\t\t\t\tn++;\n\t\t\t}\n\t\t\ti++;\n\t\t}\n\t\tin.close();\n\t}\n\n}",ACCEPTED,1059,30704
1307931767286251520,330a5297d7e1e7b447cf9c46172a252e9d593bccab3380e86ed2a79a2bc40fbc,2020-09-21 14:36:48,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"\n\nimport java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        int N=0;\n        Scanner s =new Scanner(System.in);\n        N = s.nextInt();\n        char List[] = {'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\n        for (int i=1;i<=300;i++){\n            int square = i*i;\n            int Array[] = new int[32];\n            for (int k=0;k<32;k++){\n                Array[k] = -1;\n            }\n            int Array2[] = new int[32];\n            int mod2;\n            int index2 = 0;\n            int mod;\n            int index1 = 0;\n            while ((square != 0)) {\n                mod = square%N;// 第一个模出的是最di位。\n                square = square/N;\n                Array[index1] = mod;\n                index1 ++;\n            }\n    \n            int i2 = i;\n            while ((i2 != 0)) {\n                mod2 = i2%N;// 第一个模出的是最di位。\n                i2 = i2/N;\n                Array2[index2] = mod2;\n                index2 ++;\n            }\n    \n            boolean key = true;\n            for (int k=0;k<index1;k++){\n                if (Array[k]!=Array[index1-1-k])\n                    key = false;\n            }\n    \n            if (key){\n                for (int k=index2-1;k>=0;k--)\n                    System.out.printf(\""%c\"",List[Array2[k]]);\n    \n                System.out.printf(\"" \"");\n    \n                for (int k=0;k<index1;k++){\n                    System.out.printf(\""%c\"",List[Array[k]]);\n                }\n                System.out.printf(\""\\n\"");\n            }\n        }\n    \n        return ;\n    }\n}\n",ACCEPTED,1016,11292
1307933497386319872,330a5297d7e1e7b447cf9c46172a252e9d593bccab3380e86ed2a79a2bc40fbc,2020-09-21 14:43:40,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"\n\nimport java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        int S,N;\n        Scanner s = new Scanner(System.in);\n        S = s.nextInt();\n        N = s.nextInt();\n\n        int wholecount=0;\n        char List[] = {'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\n        while(true){\n            N++;\n            int count = 0;\n            for (int k=2;k<11;k++){\n                int Array[] = new int[32];\n                int index1 = 0;\n                int mod;\n                int N2 = N;\n                while ((N2 != 0)) {\n                    mod = N2%k;// 第一个模出的是最di位。\n                    N2 = N2/k;\n                    Array[index1] = mod;\n                    index1 ++;\n                }\n                boolean key = true;\n                for (int k2=0;k2<index1;k2++){\n                    if (Array[k2]!=Array[index1-1-k2])\n                        key = false;\n            }\n\n            if (key){\n                count ++;\n            }\n        }\n        if (count >=2){\n            wholecount ++;\n            System.out.printf(\""%d\\n\"",N);\n        }\n        if (wholecount==S){\n            break;\n        }\n    }\n\n    return ;\n    }\n}\n",ACCEPTED,828,14128
1307968323736813568,b0dbadad058dca3ef81e6649021912f5fd5c227bf259aad890bd38b4c96656ad,2020-09-21 17:02:03,Java,60.0,1306870976110592007,1267442030214471680,1049226397448056832,"\nimport java.util.Scanner;\n\n\n\n\npublic class Main\n{\n    public static void main(String[] args){\n        Scanner cin = new Scanner(System.in);\n        int B = cin.nextInt(), i;\n        for(i=1; i<=300; i++)\n        {\n            int ii = i*i;\n            String s = trans(ii, B);\n            if(is_hw(s))\n            {\n                System.out.print(trans(i, B)+\"" \""+trans(ii, B));\n                break;\n            }\n        }\n        for(i+=1; i<300 ;i++)\n        {\n            int ii = i*i;\n            String s = trans(ii, B);\n            if(is_hw(s))\n            {\n                System.out.print(\""\\n\""+trans(i, B)+\"" \""+trans(ii, B));\n            }\n        }\n    }\n    public static String trans(int n, int B)\n{\n    StringBuilder ans = new StringBuilder();\n    int res;\n    while(true)\n    {\n        res = n % B;\n        if(res >= 10) ans.append(String.valueOf((char)(res+55)));\n        else ans.append(Integer.toString(res));\n        n /= B;\n        if(n < B)\n        {\n            if(n >= 10) ans.append(String.valueOf((char)(res+55)));\n            else if(n != 0) ans.append(Integer.toString(n));\n            break;\n        }\n    }\n    ans.reverse();\n    return ans.toString();\n}\n\tpublic static Boolean is_hw(String s)\n{\n    StringBuilder t = new StringBuilder(s);\n    \n    t.reverse();\n    String temp = t.toString();\n    return s.equals(temp);\n}\n}",PARTIAL_ACCEPTED,948,11212
1307975869390372864,ad541af9f92c09f02731fc16da2169e1a8d82f2ad151f3118ff01f0e69dd3f51,2020-09-21 17:32:02,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner cin = new Scanner(System.in);\n\t\tint T = cin.nextInt();\n\t\tprint(T);\n\t}\n \n\tprivate static void print(int t) {\n\t\tfor(int i = 1;i <= 300;++ i){\n\t\t\tint s = i * i;\n\t\t\tStringBuffer num = new StringBuffer();\n\t\t\tStringBuffer square = new StringBuffer();\n\t\t\tnum = convert(i,t);\n\t\t\tsquare = convert(s,t);\n\t\t\tif(ispalindrom(square)){\n\t\t\t\tSystem.out.println(num.reverse()+\"" \""+square);\n\t\t\t}\n\t\t}\n\t}\n\tprivate static StringBuffer convert(int s, int t) {\n\t\tStringBuffer rtnval = new StringBuffer();\n\t\tint digit;\n\t\twhile(s > 0){\n\t\t\tdigit = s % t;\n\t\t\tif(digit >= 10){\n\t\t\t\trtnval.append((char)('A'+digit - 10));\n\t\t\t}else{\n\t\t\t\trtnval.append(digit);\n\t\t\t}\n\t\t\ts /= t;\n\t\t}\n\t\treturn rtnval;\n\t}\n\tprivate static boolean ispalindrom(StringBuffer bf) {\n\t\tString s = new String(bf);\n\t\tchar sch[] = s.toCharArray();\n\t\tint len = sch.length;\n\t\tfor(int i = 0;i < len / 2;++ i){\n\t\t\tif(sch[i] != sch[len - i - 1]){\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\n\t}\n\n}\n",ACCEPTED,1034,11820
1308008533245804544,d8662b0321a363e011603c876acb8a6be3b4b850efd0bad68d8f7b8da79b545a,2020-09-21 19:41:50,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        int n,s,count=0;\n        Scanner scanner = new Scanner(System.in);\n        n=scanner.nextInt();\n        s=scanner.nextInt();\n        int []num=new int[n];\n        for (int i = s+1;count<n;i++){\n            int temp=0;\n            for(int j = 2 ;j<=10;j++){\n                if(isPalin(convert(i,j))){\n                    temp++;\n                }\n                if(temp>=2){\n                    num[count]=i;\n                    count++;\n                    break;\n                }\n            }\n\n        }\n        for(int i = 0; i<num.length;i++){\n            System.out.println(num[i]);\n        }\n    }\n    public static boolean isPalin(StringBuffer s){\n        for (int i=0;i<s.length()/2;i++){\n            if(s.charAt(i)!=s.charAt(s.length()-i-1)){\n                return false;\n            }\n        }\n        return true;\n    }\n    public static StringBuffer convert(int num,int B) {\n        StringBuffer rtnval = new StringBuffer();\n        int digit;\n        while (num > 0) {\n            digit = num % B;\n            if (digit >= 10) {\n                rtnval.append((char) ('A' + digit - 10));\n            } else {\n                rtnval.append(digit);\n            }\n            num /= B;\n        }\n        return rtnval.reverse();\n    }\n}\n",ACCEPTED,966,14012
1308010068113604608,5315b7ff5250304943ea4a5b4a678bbf5a039dcdfd7d1601ffca54b6a99961d7,2020-09-21 19:47:56,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\nfinal class Palindrome {\n\tpublic static boolean check(int x,int base) {\n\t\tif(x<0 || base<=1) return false;\n\t\tStringBuilder s=new StringBuilder(\""\"");\n\t\twhile(x>0) {\n\t\t\ts.append((char)(x%base));\n\t\t\tx/=base;\n\t\t}\n\t\tfor(int i=0,len=s.length()>>1; i<=len; ++i)\n\t\t\tif(s.charAt(i)!=s.charAt(s.length()-i-1)) return false;\n\t\treturn true;\n\t}\n\tpublic static String translate(int x,int base) {\n\t\tif(x<0 || base<=1) return \""\"";\n\t\tStringBuilder s=new StringBuilder(\""\"");\n\t\twhile(x>0) {\n\t\t\tint d=x%base;\n\t\t\ts.append((char)(d<10 ? d+48:d+55));\n\t\t\tx/=base;\n\t\t}\n\t\treturn s.reverse().toString();\n\t}\n}\n\npublic class Main {\n\tprivate final int MAXN=301;\n\tprivate int base;\n\tprivate Scanner sin=new Scanner(System.in);\n\tpublic void read() {\n\t\tif(!sin.hasNextInt()) return ;\n\t\tbase=sin.nextInt();\t\n\t}\n\tpublic void solve() {\n\t\tfor(int i=1; i<MAXN; ++i)\n\t\t\tif(Palindrome.check(i*i, base)) \n\t\t\t\tSystem.out.println(Palindrome.translate(i, base)+\"" \""+Palindrome.translate(i*i, base));\n\t}\n\tpublic static void main(String[] args) {\n\t\tMain slu=new Main();\n\t\tslu.read();\n\t\tslu.solve();\n\t}\n}\n",COMPILE_ERROR,0,0
1308010211416195072,5315b7ff5250304943ea4a5b4a678bbf5a039dcdfd7d1601ffca54b6a99961d7,2020-09-21 19:48:30,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\nfinal class Palindrome {\n\tpublic static boolean check(int x,int base) {\n\t\tif(x<0 || base<=1) return false;\n\t\tStringBuilder s=new StringBuilder(\""\"");\n\t\twhile(x>0) {\n\t\t\ts.append((char)(x%base));\n\t\t\tx/=base;\n\t\t}\n\t\tfor(int i=0,len=s.length()>>1; i<=len; ++i)\n\t\t\tif(s.charAt(i)!=s.charAt(s.length()-i-1)) return false;\n\t\treturn true;\n\t}\n\tpublic static String translate(int x,int base) {\n\t\tif(x<0 || base<=1) return \""\"";\n\t\tStringBuilder s=new StringBuilder(\""\"");\n\t\twhile(x>0) {\n\t\t\tint d=x%base;\n\t\t\ts.append((char)(d<10 ? d+48:d+55));\n\t\t\tx/=base;\n\t\t}\n\t\treturn s.reverse().toString();\n\t}\n}\n\npublic class Main {\n\tprivate final int MAXN=301;\n\tprivate int base;\n\tprivate Scanner sin=new Scanner(System.in);\n\tpublic void read() {\n\t\tif(!sin.hasNextInt()) return ;\n\t\tbase=sin.nextInt();\t\n\t}\n\tpublic void solve() {\n\t\tfor(int i=1; i<MAXN; ++i)\n\t\t\tif(Palindrome.check(i*i, base)) \n\t\t\t\tSystem.out.println(Palindrome.translate(i, base)+\"" \""+Palindrome.translate(i*i, base));\n\t}\n\tpublic static void main(String[] args) {\n\t\tMain slu=new Main();\n\t\tslu.read();\n\t\tslu.solve();\n\t}\n}\n",ACCEPTED,928,10884
1308010859822039040,5315b7ff5250304943ea4a5b4a678bbf5a039dcdfd7d1601ffca54b6a99961d7,2020-09-21 19:51:05,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\nfinal class Palindrome {\n\tpublic static boolean check(int x,int base) {\n\t\tif(x<0 || base<=1) return false;\n\t\tString s=translate(x,base);\n\t\tfor(int i=0,len=s.length()>>1; i<=len; ++i)\n\t\t\tif(s.charAt(i)!=s.charAt(s.length()-i-1)) return false;\n\t\treturn true;\n\t}\n\tpublic static String translate(int x,int base) {\n\t\tif(x<0 || base<=1) return \""\"";\n\t\tStringBuilder s=new StringBuilder(\""\"");\n\t\twhile(x>0) {\n\t\t\tint d=x%base;\n\t\t\ts.append((char)(d<10 ? d+48:d+55));\n\t\t\tx/=base;\n\t\t}\n\t\treturn s.reverse().toString();\n\t}\n}\n\npublic class Main {\n\tprivate final int MAXN=301;\n\tprivate int base;\n\tprivate Scanner sin=new Scanner(System.in);\n\tpublic void read() {\n\t\tif(!sin.hasNextInt()) return ;\n\t\tbase=sin.nextInt();\t\n\t}\n\tpublic void solve() {\n\t\tfor(int i=1; i<MAXN; ++i)\n\t\t\tif(Palindrome.check(i*i, base)) \n\t\t\t\tSystem.out.println(Palindrome.translate(i, base)+\"" \""+Palindrome.translate(i*i, base));\n\t}\n\tpublic static void main(String[] args) {\n\t\tMain slu=new Main();\n\t\tslu.read();\n\t\tslu.solve();\n\t}\n}\n",ACCEPTED,1031,11064
1308014512486203392,5315b7ff5250304943ea4a5b4a678bbf5a039dcdfd7d1601ffca54b6a99961d7,2020-09-21 20:05:36,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\nfinal class Palindrome {\n\tpublic static boolean check(int x,int base) {\n\t\tif(x<0 || base<=1) return false;\n\t\tString s=translate(x,base);\n\t\tfor(int i=0,len=s.length()>>1; i<=len; ++i)\n\t\t\tif(s.charAt(i)!=s.charAt(s.length()-i-1)) return false;\n\t\treturn true;\n\t}\n\tpublic static String translate(int x,int base) {\n\t\tif(x<0 || base<=1) return \""\"";\n\t\tStringBuilder s=new StringBuilder(\""\"");\n\t\twhile(x>0) {\n\t\t\tint d=x%base;\n\t\t\ts.append((char)(d<10 ? d+48:d+55));\n\t\t\tx/=base;\n\t\t}\n\t\treturn s.reverse().toString();\n\t}\n}\n\npublic class Main {\n\tprivate int n,s;\n\tprivate Scanner sin=new Scanner(System.in);\n\tpublic void read() {\n\t\tif(sin.hasNextInt()) n=sin.nextInt();\n\t\tif(sin.hasNextInt()) s=sin.nextInt();\n\t}\n\tpublic void solve() {\n\t\tfor(int i=s+1,tot=0,base,valid; tot<n; ++i) {\n\t\t\tfor(base=2,valid=0; base<=10; ++base)\n\t\t\t\tif(Palindrome.check(i, base)) \n\t\t\t\t\tif(++valid>=2) break;\n\t\t\tif(valid>=2) {\t\n\t\t\t\t++tot;\n\t\t\t\tSystem.out.println(i);\n\t\t\t}\n\t\t}\n\t}\n\tpublic static void main(String[] args) {\n\t\tMain slu=new Main();\n\t\tslu.read();\n\t\tslu.solve();\n\t}\n}",ACCEPTED,923,15896
1308039824724967424,5ac39ba02af0618a867d504fb527328a3cec05c67630fa19318baf6357ade0dc,2020-09-21 21:46:11,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\npublic class Main {\n\tstatic int n,t;\n\tpublic static int s1[]=new int[1000000];\n\tstatic void tran(int a,int b)\n\t{\n\t\tint x=0;\n\t\twhile (a!=0)\n\t\t{\n\t\t\tx++;\n\t\t\ts1[x]=a%b;\n\t\t\ta/=b;\n\t\t}\n\t\ts1[0]=x;\n\t}\n\tstatic void print(int p[])\n\t{\n\t\tfor (int k=p[0];k>0;k--)\n\t\t{\n\t\t\tif(p[k]>=0&&p[k]<=9) System.out.print(p[k]);\n\t\t\telse System.out.print((char)(p[k]+55));\n\t\t}\n\t}\n\tpublic static void main(String[] args) {\n\t\tint flag=0;\n\t\t@SuppressWarnings(\""resource\"")\n\t\tScanner sc=new Scanner(System.in);\n\t\tn=sc.nextInt();\n\t\tfor (int i=1;i<=300;i++)\n\t\t{\n\t\t\tt=i*i;\n\t\t\ttran(t,n);\n\t\t\tfor (int j=1;j<=s1[0];j++)\n\t\t\t{\n\t\t\t\tif (s1[j]!=s1[s1[0]-j+1]) flag++;\n\t\t\t}\n\t\t\tif (flag==0)\n\t\t\t{\n\t\t\t\ttran(i,n);\n\t\t\t\tprint(s1);\n\t\t\t\tSystem.out.print(\"" \"");\n\t\t\t\ttran(t,n);\n\t\t\t\tprint(s1);\n\t\t\t\tSystem.out.print(\""\\n\"");\n\t\t\t}\n\t\t\tflag=0;\n\t\t}\n\t}\n}",ACCEPTED,963,14728
1308041364596572160,5ac39ba02af0618a867d504fb527328a3cec05c67630fa19318baf6357ade0dc,2020-09-21 21:52:18,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\npublic class Main {\n\tstatic int t=0;\n\tstatic int s1[]=new int[1000000];\n\tstatic void tran(int a,int b)\n\t{\n\t\tint x=0;\n\t\twhile (a!=0)\n\t\t{\n\t\t\tx++;\n\t\t\ts1[x]=a%b;\n\t\t\ta/=b;\n\t\t}\n\t\ts1[0]=x;\n\t}\n\tstatic void check(int p[])\n\t{\n\t\tint x=0;\n\t\tfor (int y=1;y<p[0]+1;y++)\n\t\t{\n\t\t\tif (p[y]!=p[p[0]-y+1]) x++;\n\t\t}\n\t\tif (x==0) t++;\n\t}\n\tpublic static void main(String[] args){\n\t\tint n,s,num=0;\n\t\t@SuppressWarnings(\""resource\"")\n\t\tScanner sc=new Scanner(System.in);\n\t\tn=sc.nextInt();\n\t\ts=sc.nextInt();\n\t\tfor (int i=s+1;num<n;i++)\n\t\t{\n\t\t\tfor (int j=2;j<11;j++)\n\t\t\t{\n\t\t\t\ttran(i,j);\n\t\t\t\tcheck(s1);\n\t\t\t}\n\t\t\tif (t>=2)\n\t\t\t{\n\t\t\t\tSystem.out.print(i+\""\\n\"");\n\t\t\t\tnum++;\n\t\t\t}\n\t\t\tt=0;\n\t\t}\n\t}\n}",ACCEPTED,945,15260
1308053039353675776,ffcba09105fc9d7ccf9f7c4c4272116b49bc682b49102d2cee32f4bb4f7054f0,2020-09-21 22:38:41,Java,50.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.*;\nimport java.lang.*;\npublic class Main {\n\tpublic static void main(String[] args) {\n    // TODO Auto-generated method stub\n    \n    Scanner in=new Scanner(System.in);\n    \n    int n=in.nextInt();\n    int stack1[] = new int [305];\n    int stack2[] = new int [305];\n    for(int p=1;p<=300;p++)\n    {\n      int num = p,numtemp = p;\n      int tot1=0,tot2=0;\n    while(numtemp!=0)\n    {\n        stack1[++tot1]=numtemp%n;\n        numtemp/=n;\n    }\n    numtemp=num*num;\n    while(numtemp!=0)\n    {\n        stack2[++tot2]=numtemp%n;\n        numtemp/=n;\n    }\n    boolean flag = false;\n    for(int i=0;i<(tot2+1)/2;i++)\n        if(stack2[i+1]!=stack2[tot2-i]) flag = true;\n        if(!flag)\n        {\n    for(int i=tot1;i>=1;i--)\n     if(stack1[i]<10) System.out.print(stack1[i]);\n      else System.out.print((char)stack1[i]-10+'A');\n      System.out.print(\"" \"");\n    for(int i=1;i<=tot2;i++)\n     if(stack2[i]<10)System.out.print(stack2[i]);\n      else System.out.print((char)stack2[i]-10+'A');\n      System.out.print(\""\\n\"");\n        }\n  }\n      in.close();\n    return ;\n\t}\n}",PARTIAL_ACCEPTED,1007,10992
1308054481015652352,ffcba09105fc9d7ccf9f7c4c4272116b49bc682b49102d2cee32f4bb4f7054f0,2020-09-21 22:44:25,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.*;\nimport java.lang.*;\npublic class Main {\n\tpublic static void main(String[] args) {\n    // TODO Auto-generated method stub\n    \n    Scanner in=new Scanner(System.in);\n    \n    int n=in.nextInt();\n    int stack1[] = new int [305];\n    int stack2[] = new int [305];\n    for(int p=1;p<=300;p++)\n    {\n      int num = p,numtemp = p;\n      int tot1=0,tot2=0;\n    while(numtemp!=0)\n    {\n        stack1[++tot1]=numtemp%n;\n        numtemp/=n;\n    }\n    numtemp=num*num;\n    while(numtemp!=0)\n    {\n        stack2[++tot2]=numtemp%n;\n        numtemp/=n;\n    }\n    boolean flag = false;\n    for(int i=0;i<(tot2+1)/2;i++)\n        if(stack2[i+1]!=stack2[tot2-i]) flag = true;\n        if(!flag)\n        {\n    for(int i=tot1;i>=1;i--)\n     if(stack1[i]<10) System.out.print(stack1[i]);\n      else System.out.print((char)(stack1[i]-10+'A'));\n      System.out.print(\"" \"");\n    for(int i=1;i<=tot2;i++)\n     if(stack2[i]<10)System.out.print(stack2[i]);\n      else System.out.print((char)(stack2[i]-10+'A'));\n      System.out.print(\""\\n\"");\n        }\n  }\n      in.close();\n    return ;\n\t}\n}",ACCEPTED,982,10908
1308055762400690176,ffcba09105fc9d7ccf9f7c4c4272116b49bc682b49102d2cee32f4bb4f7054f0,2020-09-21 22:49:30,Java,40.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.*;\nimport java.lang.*;\npublic class Main {\n  private static boolean transfer(int num,int n)\n  {\n      int tot=0;\n      int [] stack = new int [10];\n      int numtemp=num;\n      while(numtemp!=0)\n      {\n          stack[++tot]=numtemp%n;\n          numtemp/=n;\n      }\n      for(int i=0;i<(tot+1)/2;i++)\n          if(stack[i+1]!=stack[tot-i]) return false;\n      return true;\n  }\n\tpublic static void main(String[] args) {\n    // TODO Auto-generated method stub\n    \n    Scanner in=new Scanner(System.in);\n    \n    int m = in.nextInt(),s=in.nextInt(),nowtot = 0;\n    for(int i=s+1,temp;nowtot<m;i++)\n     {\n         temp=0;\n        for(int n=2;n<=10;n++)\n         {\n             if(transfer(i,n)) temp++;\n         }\n         if(temp>1) \n         \n         {nowtot++;System.out.print(i+\""\\n\"");}\n     }\n      in.close();\n    return ;\n\t}\n}",PARTIAL_ACCEPTED,797,11064
1308056110985101312,ffcba09105fc9d7ccf9f7c4c4272116b49bc682b49102d2cee32f4bb4f7054f0,2020-09-21 22:50:54,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.*;\nimport java.lang.*;\npublic class Main {\n  private static boolean transfer(int num,int n)\n  {\n      int tot=0;\n      int [] stack = new int [100];\n      int numtemp=num;\n      while(numtemp!=0)\n      {\n          stack[++tot]=numtemp%n;\n          numtemp/=n;\n      }\n      for(int i=0;i<(tot+1)/2;i++)\n          if(stack[i+1]!=stack[tot-i]) return false;\n      return true;\n  }\n\tpublic static void main(String[] args) {\n    // TODO Auto-generated method stub\n    \n    Scanner in=new Scanner(System.in);\n    \n    int m = in.nextInt(),s=in.nextInt(),nowtot = 0;\n    for(int i=s+1,temp;nowtot<m;i++)\n     {\n         temp=0;\n        for(int n=2;n<=10;n++)\n         {\n             if(transfer(i,n)) temp++;\n         }\n         if(temp>1) \n         \n         {nowtot++;System.out.print(i+\""\\n\"");}\n     }\n      in.close();\n    return ;\n\t}\n}",ACCEPTED,911,19808
1308070255277096960,a1d56106855db780882e1d55cddf2b290a70058a39946cf9586596170ecab4a0,2020-09-21 23:47:06,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main{\n\tpublic static void main(String args[]) {\n\t\tint B = 0;\n\t    int pow = 0;\n\t    int tmp = 0;\n\t    char c;\n\t    String str = \""\"";\n\t    String s;\n\t    Scanner sc = new Scanner (System.in);\n\t    B = sc.nextInt();\n\t    for (int i = 1; i < 301; i++) {\n\t        pow = i * i;\n\t        str = \""\"";\n\t        while (true) {\n\t            tmp = pow % B;\n\t            if(tmp > 9){\n\t            c = (char)(tmp + 55);\n\t            }\n\t            else {\n\t            c = (char)(tmp + '0');\n\t            }\n\t            if ((pow /= B) > 0) {\n\t                str = c + str;\n\t            }\n\t            else {\n\t                str = c + str;\n\t                break;\n\t            }\n\t        }\n\t        s = str;\n\t        char s1[] = s.toCharArray();\n\t        char str1[] = str.toCharArray();\n\t        for(int j=0;j<s.length();j++) {\n\t        \ts1[j] = str1[s.length()-1-j];\n\t        }\n\t        String ss = str;\n\t        int sign = 1;\n\t        for(int j=0;j<s.length();j++) {\n\t        \tif(s1[j] != str1[j]) {\n\t        \t\tsign = 0;\n\t        \t\tbreak;\n\t        \t}\n\t        }\n\t        if (sign==1) {\n\t            str = \""\"";\n\t            int hahaha = i;\n\t            while (true) {\n\t                tmp = hahaha % B;\n\t                if (tmp > 9) {\n\t                    c = (char)(tmp + 55);\n\t                }\n\t                else {\n\t                    c = (char)(tmp + '0');\n\t                }\n\t                if ((hahaha /= B) > 0) {\n\t                    str = c + str;\n\t                }\n\t                else {\n\t                    str = c + str;\n\t                    break;\n\t                }\n\t            }\n\t            System.out.println(str+\"" \""+ss);\n\t        }\n\t    }\n\t}\n}\n",ACCEPTED,918,11396
1308085900316229632,8c56bfdbe6590a3d214c41dad15dfc76cffb43d7c88360c085da8afe6e5bd4cf,2020-09-22 00:49:16,Java,50.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.*;\nclass Main{\n\tstatic boolean transfer(int num,int b)\n\t{\n\t\tint i,j,temp=0,n=num;\n\t\tchar c[]=new char[1000];\n\t\twhile(n!=0)\n\t\t{\n\t\t\ti=n%b;\n\t\t\tn=n/b;\n\t\t\tc[temp++]=(char) (i+'0');\t\t\t\n\t\t\t}\n\tfor(i=0;i<temp;i++)\n\t{\n\t\tif(c[i]!=c[temp-1-i])\n\t\t\treturn false;\n\t}\n\treturn true;\n\t}\n\t\n\tstatic boolean ans(int num)\n\t{\n\t\tint i,j=0,k;\n\t\tfor(i=2;i<11;i++)\n\t\t{\n\t\t\tif(transfer(num,i))\n\t\t\t{\n\t\t\t\tj++;\n\t\t\t}\n\t\t\tif(j==2)\n\t\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}\n    public static void main(String[] args) \n    {\n    \tScanner sin=new Scanner(System.in);\n    \tint n=sin.nextInt();\n    \tint s=sin.nextInt();\n    \tint i,cnt=0;\n    \tfor(i=s;cnt<n;i++)\n    \t{\n    \t\tif(ans(i))\n    \t\t{\n    \t\t\tSystem.out.println(i);\n    \t\t\tcnt++;\n    \t\t}\n    \t}\n    }\n}\t",PARTIAL_ACCEPTED,887,43548
1308086963123503104,8c56bfdbe6590a3d214c41dad15dfc76cffb43d7c88360c085da8afe6e5bd4cf,2020-09-22 00:53:29,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.*;\nclass Main{\n\tstatic boolean transfer(int num,int b)\n\t{\n\t\tint i,j,temp=0,n=num;\n\t\tchar c[]=new char[1000];\n\t\twhile(n!=0)\n\t\t{\n\t\t\ti=n%b;\n\t\t\tn=n/b;\n\t\t\tc[temp++]=(char) (i+'0');\t\t\t\n\t\t\t}\n\tfor(i=0;i<temp;i++)\n\t{\n\t\tif(c[i]!=c[temp-1-i])\n\t\t\treturn false;\n\t}\n\treturn true;\n\t}\n\t\n\tstatic boolean ans(int num)\n\t{\n\t\tint i,j=0;\n\t\tfor(i=2;i<11;i++)\n\t\t{\n\t\t\tif(transfer(num,i))\n\t\t\t{\n\t\t\t\tj++;\n\t\t\t}\n\t\t\tif(j==2)\n\t\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}\n    public static void main(String[] args) \n    {\n    \tScanner sin=new Scanner(System.in);\n    \tint n=sin.nextInt();\n    \tint s=sin.nextInt();\n    \tint i,cnt=0;\n    \tfor(i=s+1;cnt<n;i++)\n    \t{\n    \t\tif(ans(i))\n    \t\t{\n    \t\t\tSystem.out.println(i);\n    \t\t\tcnt++;\n    \t\t}\n    \t}\n    }\n}\t",ACCEPTED,850,43436
1308221898069098496,36f9703960ec59dff6d2b06720a0fbd9fd98c39584d6789ef785e7a1e664ee75,2020-09-22 09:49:40,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"\nimport java.util.Scanner;\npublic class Main {\n\tpublic static int n;\n\tpublic static void main(String[] args) {\n\t\tScanner in=new Scanner(System.in);\n\t\tn=in.nextInt();\n\t\tString num=\""\"",num2=\""\"";\n\t\tfor(int i=1;i<=300;i++) {\n\t\t\tnum2=transform(i*i);\n\t\t\t//System.out.println(num2);\n\t\t\tint flag=1,size=num2.length();\n\t\t\tfor(int j=0;j<size/2;j++) {\n\t\t\t\tif(num2.charAt(j)!=num2.charAt(size-1-j)) {\n\t\t\t\t\tflag=0;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(flag==1) {\n\t\t\t\tnum=transform(i);\n\t\t\t\tSystem.out.println(num+\"" \""+num2);\n\t\t\t}\n\t\t}\n\n\t}\n\tpublic static String transform(int x) {\n\t\tString temp=\""\"";\n\t\tint y=0;\n\t\twhile(x!=0) {\n\t\t\t//System.out.println(n);\n\t\t\ty=x%n;\n\t\t\tx=x/n;\n\t\t\tif(y<=9) temp=(char)('0'+y)+temp;\n\t\t\telse temp=(char)('A'+(y-10))+temp;\n\t\t}\n\t\treturn temp;\n\t}\n\n}\n",ACCEPTED,942,11316
1308224341850963968,a1d56106855db780882e1d55cddf2b290a70058a39946cf9586596170ecab4a0,2020-09-22 09:59:23,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class code{\n\tpublic static void main(String args[]) {\n\t\tint N, S;\n\t\tScanner sc = new Scanner(System.in);\n\t\tN = sc.nextInt();\n\t\tS = sc.nextInt();\n\t\tString s = \""\"";\n\t\tString c;\n\t\tint t = 0;\n\t\t\tfor(int i=S+1;i<10000;i++) {\n\t\t\t\tint a = i*i;\n\t\t\t\tint n = 0;\n\t\t\t\tfor(int j=2;j<=10;j++) {\n\t\t\t\t\ts = \""\"";\n\t\t\t\t\twhile(a>0) {\n\t\t\t\t\t\ts = (char)(a%j)+s;\n\t\t\t\t\t\ta /= j;\n\t\t\t\t\t}\n\t\t\t\t\tc = s;\n\t\t\t\t\tif(com(s,c) == 1) {\n\t\t\t\t\t\tn++;\n\t\t\t\t\t}\n\t\t\t\t\tif(n>=2)\n\t\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tSystem.out.println(i);\n\t\t\t\tt++;\n\t\t\t\tif(t==N)\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t\n\t\t\n\t}\n\tstatic public int com(String a, String b){\n\t\ta = b;\n        char s1[] = a.toCharArray();\n        char str1[] = b.toCharArray();\n        for(int j=0;j<a.length();j++) {\n        \ts1[j] = str1[a.length()-1-j];\n        }\n        int sign = 1;\n        for(int j=0;j<a.length();j++) {\n        \tif(s1[j] != str1[j]) {\n        \t\tsign = 0;\n        \t\tbreak;\n        \t}\n        }\n        return sign;\n\t}\n}\n",COMPILE_ERROR,0,0
1308224390790103040,a1d56106855db780882e1d55cddf2b290a70058a39946cf9586596170ecab4a0,2020-09-22 09:59:35,Java,10.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main{\n\tpublic static void main(String args[]) {\n\t\tint N, S;\n\t\tScanner sc = new Scanner(System.in);\n\t\tN = sc.nextInt();\n\t\tS = sc.nextInt();\n\t\tString s = \""\"";\n\t\tString c;\n\t\tint t = 0;\n\t\t\tfor(int i=S+1;i<10000;i++) {\n\t\t\t\tint a = i*i;\n\t\t\t\tint n = 0;\n\t\t\t\tfor(int j=2;j<=10;j++) {\n\t\t\t\t\ts = \""\"";\n\t\t\t\t\twhile(a>0) {\n\t\t\t\t\t\ts = (char)(a%j)+s;\n\t\t\t\t\t\ta /= j;\n\t\t\t\t\t}\n\t\t\t\t\tc = s;\n\t\t\t\t\tif(com(s,c) == 1) {\n\t\t\t\t\t\tn++;\n\t\t\t\t\t}\n\t\t\t\t\tif(n>=2)\n\t\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tSystem.out.println(i);\n\t\t\t\tt++;\n\t\t\t\tif(t==N)\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t\n\t\t\n\t}\n\tstatic public int com(String a, String b){\n\t\ta = b;\n        char s1[] = a.toCharArray();\n        char str1[] = b.toCharArray();\n        for(int j=0;j<a.length();j++) {\n        \ts1[j] = str1[a.length()-1-j];\n        }\n        int sign = 1;\n        for(int j=0;j<a.length();j++) {\n        \tif(s1[j] != str1[j]) {\n        \t\tsign = 0;\n        \t\tbreak;\n        \t}\n        }\n        return sign;\n\t}\n}\n",PARTIAL_ACCEPTED,871,10816
1308224588274712576,a1d56106855db780882e1d55cddf2b290a70058a39946cf9586596170ecab4a0,2020-09-22 10:00:22,Java,10.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main{\n\tpublic static void main(String args[]) {\n\t\tint N, S;\n\t\tScanner sc = new Scanner(System.in);\n\t\tN = sc.nextInt();\n\t\tS = sc.nextInt();\n\t\tString s = \""\"";\n\t\tString c;\n\t\tint t = 0;\n\t\t\tfor(int i=S+1;i<10000;i++) {\n\t\t\t\tint a = i*i;\n\t\t\t\tint n = 0;\n\t\t\t\tfor(int j=2;j<=10;j++) {\n\t\t\t\t\ts = \""\"";\n\t\t\t\t\twhile(a>0) {\n\t\t\t\t\t\ts = (char)(a%j)+s;\n\t\t\t\t\t\ta /= j;\n\t\t\t\t\t}\n\t\t\t\t\tc = s;\n\t\t\t\t\tif(com(s,c) == 1) {\n\t\t\t\t\t\tn++;\n\t\t\t\t\t}\n\t\t\t\t\tif(n>2)\n\t\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tSystem.out.println(i);\n\t\t\t\tt++;\n\t\t\t\tif(t==N)\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t\n\t\t\n\t}\n\tstatic public int com(String a, String b){\n\t\ta = b;\n        char s1[] = a.toCharArray();\n        char str1[] = b.toCharArray();\n        for(int j=0;j<a.length();j++) {\n        \ts1[j] = str1[a.length()-1-j];\n        }\n        int sign = 1;\n        for(int j=0;j<a.length();j++) {\n        \tif(s1[j] != str1[j]) {\n        \t\tsign = 0;\n        \t\tbreak;\n        \t}\n        }\n        return sign;\n\t}\n}\n",PARTIAL_ACCEPTED,814,10928
1308225501135618048,a1d56106855db780882e1d55cddf2b290a70058a39946cf9586596170ecab4a0,2020-09-22 10:03:59,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main{\n\tpublic static void main(String args[]) {\n\t\tint N, S;\n\t\tScanner sc = new Scanner(System.in);\n\t\tN = sc.nextInt();\n\t\tS = sc.nextInt();\n\t\tString s = \""\"";\n\t\tString c;\n\t\tint t = 0;\n\t\t\tfor(int i=S+1;i<10000;i++) {\n\t\t\t\tint a = i*i;\n\t\t\t\tint n = 0;\n\t\t\t\tfor(int j=2;j<=10;j++) {\n\t\t\t\t\ts = \""\"";\n\t\t\t\t\twhile(a>0) {\n\t\t\t\t\t\ts = (char)(a%j)+s;\n\t\t\t\t\t\ta /= j;\n\t\t\t\t\t}\n\t\t\t\t\tc = s;\n\t\t\t\t\tif(com(s,c) == 1) {\n\t\t\t\t\t\tn++;\n\t\t\t\t\t}\n\t\t\t\t\tif(n>2)\n\t\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tSystem.out.println(i);\n\t\t\t\tt++;\n\t\t\t\tif(t==N)\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t\n\t\t\n\t}\n\tstatic public int com(String a, String b){\n\t\ta = b;\n        char s1[] = a.toCharArray();\n        char str1[] = b.toCharArray();\n        for(int j=0;j<a.length();j++) {\n        \ts1[j] = str1[a.length()-1-j];\n        }\n        System.out.println(s1);\n        int sign = 1;\n        for(int j=0;j<a.length();j++) {\n        \tif(s1[j] != str1[j]) {\n        \t\tsign = 0;\n        \t\tbreak;\n        \t}\n        }\n        return sign;\n\t}\n}\n",WRONG_ANSWER,971,10956
1308334676851277824,dcea7dd7efe9ba0a279461ee72bb5fd36087de773cf9690d5f3b5f8db682d6d5,2020-09-22 17:17:49,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\npublic class test{\n    public static void main(String[] args){\n\t\tScanner cin = new Scanner(System.in);\n\t\tint T = cin.nextInt();\n\t\tprint(T);\n\t}\n \n\tprivate static void print(int t) {\n\t\tfor(int i = 1;i <= 300;++ i){\n\t\t\tint s = i * i;\n\t\t\tStringBuffer num = new StringBuffer();\n\t\t\tStringBuffer square = new StringBuffer();\n\t\t\tnum = convert(i,t);\n\t\t\tsquare = convert(s,t);\n\t\t\tif(ispalindrom(square)){\n\t\t\t\tSystem.out.println(num.reverse()+\"" \""+square);\n\t\t\t}\n\t\t}\n\t}\n\tprivate static StringBuffer convert(int s, int t) {\n\t\tStringBuffer rtnval = new StringBuffer();\n\t\tint digit;\n\t\twhile(s > 0){\n\t\t\tdigit = s % t;\n\t\t\tif(digit >= 10){\n\t\t\t\trtnval.append((char)('A'+digit - 10));\n\t\t\t}else{\n\t\t\t\trtnval.append(digit);\n\t\t\t}\n\t\t\ts /= t;\n\t\t}\n\t\treturn rtnval;\n\t}\n\tprivate static boolean ispalindrom(StringBuffer bf) {\n\t\tStringBuffer s = new StringBuffer(bf);\n\t\treturn bf.toString().equals(s.reverse().toString());\n    }\n}",COMPILE_ERROR,0,0
1308334724578263040,dcea7dd7efe9ba0a279461ee72bb5fd36087de773cf9690d5f3b5f8db682d6d5,2020-09-22 17:18:00,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\npublic class Main{\n    public static void main(String[] args){\n\t\tScanner cin = new Scanner(System.in);\n\t\tint T = cin.nextInt();\n\t\tprint(T);\n\t}\n \n\tprivate static void print(int t) {\n\t\tfor(int i = 1;i <= 300;++ i){\n\t\t\tint s = i * i;\n\t\t\tStringBuffer num = new StringBuffer();\n\t\t\tStringBuffer square = new StringBuffer();\n\t\t\tnum = convert(i,t);\n\t\t\tsquare = convert(s,t);\n\t\t\tif(ispalindrom(square)){\n\t\t\t\tSystem.out.println(num.reverse()+\"" \""+square);\n\t\t\t}\n\t\t}\n\t}\n\tprivate static StringBuffer convert(int s, int t) {\n\t\tStringBuffer rtnval = new StringBuffer();\n\t\tint digit;\n\t\twhile(s > 0){\n\t\t\tdigit = s % t;\n\t\t\tif(digit >= 10){\n\t\t\t\trtnval.append((char)('A'+digit - 10));\n\t\t\t}else{\n\t\t\t\trtnval.append(digit);\n\t\t\t}\n\t\t\ts /= t;\n\t\t}\n\t\treturn rtnval;\n\t}\n\tprivate static boolean ispalindrom(StringBuffer bf) {\n\t\tStringBuffer s = new StringBuffer(bf);\n\t\treturn bf.toString().equals(s.reverse().toString());\n    }\n}",ACCEPTED,931,11372
1308336610312175616,dcea7dd7efe9ba0a279461ee72bb5fd36087de773cf9690d5f3b5f8db682d6d5,2020-09-22 17:25:30,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\npublic class Main{\n    public static void main(String[] args){\n\t\tScanner cin = new Scanner(System.in);\n        int N,S,a=0,count=0;\n        N = cin.nextInt();\n        S = cin.nextInt();\n        while(a<N){\n            for(int i =2;i<11;i++){\n                if(judge(tanslate(S+1,i))){\n                    count+=1;\n                }\n            }\n            if(count>=2){\n                a+=1;\n                System.out.println((S+1));\n            }\n            count=0;\n            S+=1;\n        }\n\t}\n \n\n\tprivate static StringBuffer tanslate(int s, int t) {\n\t\tStringBuffer rtnval = new StringBuffer();\n\t\tint digit;\n\t\twhile(s > 0){\n\t\t\tdigit = s % t;\n\t\t\tif(digit >= 10){\n\t\t\t\trtnval.append((char)('A'+digit - 10));\n\t\t\t}else{\n\t\t\t\trtnval.append(digit);\n\t\t\t}\n\t\t\ts /= t;\n\t\t}\n\t\treturn rtnval;\n\t}\n\tprivate static boolean judge(StringBuffer bf) {\n\t\tStringBuffer s = new StringBuffer(bf);\n\t\treturn bf.toString().equals(s.reverse().toString());\n    }\n}",ACCEPTED,971,18968
1308352510134304768,36f9703960ec59dff6d2b06720a0fbd9fd98c39584d6789ef785e7a1e664ee75,2020-09-22 18:28:41,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"\nimport java.util.Scanner;\npublic class Main {\n\tpublic static int n;\n\tpublic static void main(String[] args) {\n\t\tScanner in=new Scanner(System.in);\n\t\tn=in.nextInt();\n\t\tint start=in.nextInt();\n\t\tString num=\""\"";\n\t\tfor(int i=start+1;n>0;i++) {\n\t\t\tint count=0;\n\t\t\tfor(int k=2;k<=10;k++) {\n\t\t\t\tnum=transform(i,k);\n\t\t\t\tint size=num.length(),flag=1;\n\t\t\t\tfor(int j=0;j<size/2;j++) {\n\t\t\t\t\tif(num.charAt(j)!=num.charAt(size-1-j)) {\n\t\t\t\t\t\tflag=0;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(flag==1) {\n\t\t\t\t\tcount++;\n\t\t\t\t\tif(count==2) {\n\t\t\t\t\t\tSystem.out.println(i);\n\t\t\t\t\t\tn--;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\n\t}\n\tpublic static String transform(int x,int m) {\n\t\tString temp=\""\"";\n\t\tint y=0;\n\t\twhile(x!=0) {\n\t\t\t//System.out.println(n);\n\t\t\ty=x%m;\n\t\t\tx=x/m;\n\t\t\tif(y<=9) temp=(char)('0'+y)+temp;\n\t\t\telse temp=(char)('A'+(y-10))+temp;\n\t\t}\n\t\treturn temp;\n\t}\n\n}\n",ACCEPTED,977,21768
1308365138764218368,a1d56106855db780882e1d55cddf2b290a70058a39946cf9586596170ecab4a0,2020-09-22 19:18:51,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main{\n\tpublic static void main(String args[]) {\n\t\tint N, S;\n\t\tScanner sc = new Scanner(System.in);\n\t\tN = sc.nextInt();\n\t\tS = sc.nextInt();\n\t\tString s = \""\"";\n\t\tString c;\n\t\tint t = 0;\n\t\t\tfor(int i=S+1;i<10000;i++) {\n\t\t\t\tint a = i*i;\n\t\t\t\tint n = 0;\n\t\t\t\tfor(int j=2;j<=10;j++) {\n\t\t\t\t\ts = \""\"";\n\t\t\t\t\twhile(a>0) {\n\t\t\t\t\t\ts = (char)(a%j)+s;\n\t\t\t\t\t\ta /= j;\n\t\t\t\t\t}\n\t\t\t\t\tc = s;\n\t\t\t\t\tif(com(s,c) == 1) {\n\t\t\t\t\t\tn++;\n\t\t\t\t\t}\n\t\t\t\t\tif(n>2)\n\t\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tSystem.out.println(i);\n\t\t\t\tt++;\n\t\t\t\tif(t==N)\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t\n\t\t\n\t}\n\tstatic public int com(String a, String b){\n\t\ta = b;\n        char s1[] = a.toCharArray();\n        char str1[] = b.toCharArray();\n        for(int j=0;j<a.length();j++) {\n        \ts1[j] = str1[a.length()-1-j];\n        }\n        System.out.println(s1);\n        int sign = 1;\n        for(int j=0;j<a.length();j++) {\n        \tif(s1[j] != str1[j]) {\n        \t\tsign = 0;\n        \t\tbreak;\n        \t}\n        }\n        return sign;\n\t}\n}\n",WRONG_ANSWER,795,10928
1308366313018343424,a1d56106855db780882e1d55cddf2b290a70058a39946cf9586596170ecab4a0,2020-09-22 19:23:31,Java,60.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main{\n\tpublic static void main(String args[]) {\n\t\tint N, S;\n\t\tScanner sc = new Scanner(System.in);\n\t\tN = sc.nextInt();\n\t\tS = sc.nextInt();\n\t\tint s[] = new int[40];\n\t\tint c[] = new int[40];\n\t\tint t = 0;\n\t\tfor(int i=S+1;i<10000;i++) {\n\t\t\tint n = 0;\n\t\t\tfor(int j=2;j<=10;j++) {\n\t\t\t\tint a = i;\n\t\t\t\tint x = 39;\n\t\t\t\twhile(a>0) {\n\t\t\t\t\ts[x] = a%j;\n\t\t\t\t\ta /= j;\n\t\t\t\t\tx--;\n\t\t\t\t}\n\t\t\t\tc = s;\n\t\t\t\tif(com(s,c,x) == 1) {\n\t\t\t\t\tn++;\n\t\t\t\t}\n\t\t\t\tif(n>=2) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(n>=2) {\n\t\t\t\tSystem.out.println(i);\n\t\t\t\tt++;\n\t\t\t}\n\t\t\tif(t==N)\n\t\t\t\tbreak;\n\t\t}\n\t}\n\tstatic public int com(int[] a, int [] b,int x){\n        int sign = 1;\n        for(int j=39;j>x;j--) {\n        \tif(a[j] != b[x+40-j]) {\n        \t\tsign = 0;\n        \t\tbreak;\n        \t}\n        }\n        return sign;\n\t}\n}\n",PARTIAL_ACCEPTED,803,10936
1308369079807754240,a1d56106855db780882e1d55cddf2b290a70058a39946cf9586596170ecab4a0,2020-09-22 19:34:31,Java,60.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main{\n\tpublic static void main(String args[]) {\n\t\tint N, S;\n\t\tScanner sc = new Scanner(System.in);\n\t\tN = sc.nextInt();\n\t\tS = sc.nextInt();\n\t\tint s[] = new int[40];\n\t\tint c[] = new int[40];\n\t\tint t = 0;\n\t\tfor(int i=S+1;i<10000;i++) {\n\t\t\tint n = 0;\n\t\t\tfor(int j=2;j<=10;j++) {\n\t\t\t\tint a = i;\n\t\t\t\tint x = 39;\n\t\t\t\twhile (true) {\n\t\t\t\t\tint y = a % j;\n\t\t\t\t\t\n\t\t\t\t\tif ((a /= j) > 0) {\n\t\t\t\t\t\ts[x] = y;\n\t\t\t\t\t\tx--;\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\ts[x] = y;\n\t\t\t\t\t\tx--;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tc = s;\n\t\t\t\tif(com(s,c,x) == 1) {\n\t\t\t\t\tn++;\n\t\t\t\t}\n\t\t\t\tif(n>=2) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(n>=2) {\n\t\t\t\tSystem.out.println(i);\n\t\t\t\tt++;\n\t\t\t}\n\t\t\tif(t==N)\n\t\t\t\tbreak;\n\t\t}\n\t}\n\tstatic public int com(int[] a, int [] b,int x){\n        int sign = 1;\n        for(int j=39;j>x;j--) {\n        \tif(a[j] != b[x+40-j]) {\n        \t\tsign = 0;\n        \t\tbreak;\n        \t}\n        }\n        return sign;\n\t}\n}",PARTIAL_ACCEPTED,823,10932
1308564372771815424,a1d56106855db780882e1d55cddf2b290a70058a39946cf9586596170ecab4a0,2020-09-23 08:30:33,Java,60.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main{\n\tpublic static void main(String args[]) {\n\t\tint N, S;\n\t\tScanner sc = new Scanner(System.in);\n\t\tN = sc.nextInt();\n\t\tS = sc.nextInt();\n\t\tint s[] = new int[40];\n\t\tint c[] = new int[40];\n\t\tint t = 0;\n\t\tfor(int i=S+1;i<10000;i++) {\n\t\t\tint n = 0;\n\t\t\tfor(int j=2;j<=10;j++) {\n\t\t\t\tint a = i;\n\t\t\t\tint x = 39;\n\t\t\t\twhile (a!=0) {\n\t\t\t\t\ts[x] = a%j;\n                    a = a/j;\n                    x--;\n\t\t\t\t}\n\t\t\t\tc = s;\n\t\t\t\tif(com(s,c,x) == 1) {\n\t\t\t\t\tn++;\n\t\t\t\t}\n\t\t\t\tif(n>=2) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(n>=2) {\n\t\t\t\tSystem.out.println(i);\n\t\t\t\tt++;\n\t\t\t}\n\t\t\tif(t==N)\n\t\t\t\tbreak;\n\t\t}\n\t}\n\tstatic public int com(int[] a, int [] b,int x){\n        int sign = 1;\n        for(int j=39;j>x;j--) {\n        \tif(a[j] != b[x+40-j]) {\n        \t\tsign = 0;\n        \t\tbreak;\n        \t}\n        }\n        return sign;\n\t}\n}",PARTIAL_ACCEPTED,845,10844
1308564838855458816,a1d56106855db780882e1d55cddf2b290a70058a39946cf9586596170ecab4a0,2020-09-23 08:32:24,Java,60.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main{\n\tpublic static void main(String args[]) {\n\t\tint N, S;\n\t\tScanner sc = new Scanner(System.in);\n\t\tN = sc.nextInt();\n\t\tS = sc.nextInt();\n\t\tint s[] = new int[40];\n\t\tint c[] = new int[40];\n\t\tint t = 0;\n\t\tfor(int i=S+1;i<10000;i++) {\n\t\t\tint n = 0;\n\t\t\tfor(int j=2;j<=10;j++) {\n\t\t\t\tint a = i;\n\t\t\t\tint x = 39;\n\t\t\t\twhile (a!=0) {\n\t\t\t\t\ts[x] = a%j;\n                    a = a/j;\n                    x--;\n\t\t\t\t}\n\t\t\t\tc = s;\n\t\t\t\tif(com(s,c,x) == 1 && s[39]!=0) {\n\t\t\t\t\tn++;\n\t\t\t\t}\n\t\t\t\tif(n>=2) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(n>=2) {\n\t\t\t\tSystem.out.println(i);\n\t\t\t\tt++;\n\t\t\t}\n\t\t\tif(t==N)\n\t\t\t\tbreak;\n\t\t}\n\t}\n\tstatic public int com(int[] a, int [] b,int x){\n        int sign = 1;\n        for(int j=39;j>x;j--) {\n        \tif(a[j] != b[x+40-j]) {\n        \t\tsign = 0;\n        \t\tbreak;\n        \t}\n        }\n        return sign;\n\t}\n}",PARTIAL_ACCEPTED,898,10972
1308566228000555008,a1d56106855db780882e1d55cddf2b290a70058a39946cf9586596170ecab4a0,2020-09-23 08:37:55,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main{\n\tpublic static void main(String args[]) {\n\t\tint N, S;\n\t\tScanner sc = new Scanner(System.in);\n\t\tN = sc.nextInt();\n\t\tS = sc.nextInt();\n\t\tint s[] = new int[40];\n\t\tint c[] = new int[40];\n\t\tint t = 0;\n\t\tfor(int i=S+1;i<10000;i++) {\n\t\t\tint n = 0;\n\t\t\tfor(int j=2;j<=10;j++) {\n\t\t\t\tint a = i;\n\t\t\t\tint x = 39;\n\t\t\t\twhile (a!=0) {\n\t\t\t\t\ts[x] = a%j;\n                    a = a/j;\n                    x--;\n\t\t\t\t}\n\t\t\t\tc = s;\n\t\t\t\tif(com(s,,x) == 1 && s[39]!=0) {\n\t\t\t\t\tn++;\n\t\t\t\t}\n\t\t\t\tif(n>=2) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(n>=2) {\n\t\t\t\tSystem.out.println(i);\n\t\t\t\tt++;\n\t\t\t}\n\t\t\tif(t==N)\n\t\t\t\tbreak;\n\t\t}\n\t}\n\tstatic public int com(int[] a,int x){\n        int sign = 1;\n        for(int j=39;j>x;j--) {\n        \tif(a[j] != a[x+40-j]) {\n        \t\tsign = 0;\n        \t\tbreak;\n        \t}\n        }\n        return sign;\n\t}\n}",COMPILE_ERROR,0,0
1308566262343516160,a1d56106855db780882e1d55cddf2b290a70058a39946cf9586596170ecab4a0,2020-09-23 08:38:03,Java,60.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main{\n\tpublic static void main(String args[]) {\n\t\tint N, S;\n\t\tScanner sc = new Scanner(System.in);\n\t\tN = sc.nextInt();\n\t\tS = sc.nextInt();\n\t\tint s[] = new int[40];\n\t\tint c[] = new int[40];\n\t\tint t = 0;\n\t\tfor(int i=S+1;i<10000;i++) {\n\t\t\tint n = 0;\n\t\t\tfor(int j=2;j<=10;j++) {\n\t\t\t\tint a = i;\n\t\t\t\tint x = 39;\n\t\t\t\twhile (a!=0) {\n\t\t\t\t\ts[x] = a%j;\n                    a = a/j;\n                    x--;\n\t\t\t\t}\n\t\t\t\tc = s;\n\t\t\t\tif(com(s,x) == 1 && s[39]!=0) {\n\t\t\t\t\tn++;\n\t\t\t\t}\n\t\t\t\tif(n>=2) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(n>=2) {\n\t\t\t\tSystem.out.println(i);\n\t\t\t\tt++;\n\t\t\t}\n\t\t\tif(t==N)\n\t\t\t\tbreak;\n\t\t}\n\t}\n\tstatic public int com(int[] a,int x){\n        int sign = 1;\n        for(int j=39;j>x;j--) {\n        \tif(a[j] != a[x+40-j]) {\n        \t\tsign = 0;\n        \t\tbreak;\n        \t}\n        }\n        return sign;\n\t}\n}",PARTIAL_ACCEPTED,828,10828
1308566727370194944,a1d56106855db780882e1d55cddf2b290a70058a39946cf9586596170ecab4a0,2020-09-23 08:39:54,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main{\n\tpublic static void main(String args[]) {\n\t\tint N, S;\n\t\tScanner sc = new Scanner(System.in);\n\t\tN = sc.nextInt();\n\t\tS = sc.nextInt();\n\t\tint s[] = new int[40];\n\t\tint c[] = new int[40];\n\t\tint t = 0;\n\t\tfor(int i=S+1;i<10000;i++) {\n\t\t\t   x--;\n\t\t\t\t}\n\t\t\t\tc = s;\n\t\t\t\tif(com(s,x) == 1 && s[39]!=0) {\n\t\t\t\t\tn++;\n\t\t\t\t}\n\t\t\t\tif(n>=2) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(n>=int n = 0;\n\t\t\tfor(int j=2;j<=10;j++) {\n\t\t\t\tint a = i;\n\t\t\t\tint x = 39;\n\t\t\t\twhile (a!=0) {\n\t\t\t\t\ts[x] = a%j;\n                    a = a/j;\n                 2) {\n\t\t\t\tSystem.out.println(i);\n\t\t\t\tt++;\n\t\t\t}\n\t\t\tif(t==N)\n\t\t\t\tbreak;\n\t\t}\n\t}\n\tstatic public int com(int[] a,int x){\n        int sign = 1;\n        for(int j=39;j>x;j--) {\n        \tif(a[j] != a[x+40-j]) {\n        \t\tsign = 0;\n        \t\tbreak;\n        \t}\n        }\n        return sign;\n\t}\n}",COMPILE_ERROR,0,0
1308568440428806144,a1d56106855db780882e1d55cddf2b290a70058a39946cf9586596170ecab4a0,2020-09-23 08:46:42,Java,60.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main{\n\tpublic static void main(String args[]) {\n\t\tint N, S;\n\t\tScanner sc = new Scanner(System.in);\n\t\tN = sc.nextInt();\n\t\tS = sc.nextInt();\n\t\tint s[] = new int[40];\n\t\tint t = 0;\n\t\tfor(int i=S+1;i<10000;i++) {\n\t\t\tint n = 0;\n\t\t\tfor(int j=2;j<=10;j++) {\n\t\t\t\tint a = i;\n\t\t\t\tint x = 39;\n\t\t\t\twhile(a>0) {\n\t\t\t\t\ts[x] = a%j;\n\t\t\t\t\ta /= j;\n\t\t\t\t\tx--;\n\t\t\t\t}\n\t\t\t\tif(com(s,x) == 1) {\n\t\t\t\t\tn++;\n\t\t\t\t}\n\t\t\t\tif(n>=2) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(n>=2) {\n\t\t\t\tSystem.out.println(i);\n\t\t\t\tt++;\n\t\t\t}\n\t\t\tif(t==N)\n\t\t\t\tbreak;\n\t\t}\n\t}\n\tstatic public int com(int[] a,int x){\n        int sign = 1;\n        for(int j=39;j>x;j--) {\n        \tif(a[j] != a[x+40-j]) {\n        \t\tsign = 0;\n        \t\tbreak;\n        \t}\n        }\n        return sign;\n\t}\n}\n",PARTIAL_ACCEPTED,867,10992
1308802104626495488,b0dbadad058dca3ef81e6649021912f5fd5c227bf259aad890bd38b4c96656ad,2020-09-24 00:15:12,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"\nimport java.util.Scanner;\n\npublic class Main{\n    public static void main(String[] args){\n    \tScanner cin = new Scanner(System.in);\n        int N = cin.nextInt(), S = cin.nextInt(), sum = 0;\n        while(sum<N) {\n            S++;\n            int flag = 0;\n            for(int i=2; i<=10; i++) {\n                if(is_hw(trans(S, i))) {\n                \tflag++;\n                }\n                if(flag == 2) {\n                \tbreak;\n                }\n            }\n            if(flag == 2) {\n            \tSystem.out.println(S);\n            \t++sum;\n            }\n        }\n    }\n    \n    public static String trans(int n, int B){\n        return Integer.toString(n, B);\n    }\n\n    public static boolean is_hw(String s) {\n        String temp = new StringBuilder(s).reverse().toString();\n        return s.equals(temp);\n    }\n\n}",ACCEPTED,866,18384
1309078652265889792,b6752181378edbb77715b4bc1b0fa55f6e3000b252f7b8c7f798a74e3a5775b7,2020-09-24 18:34:06,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.*;\nimport java.lang.*;\n\npublic class Main {\n\tpublic static String change(int n,int b) {\n\t\tString line=\""\"";\n\t\tchar num[]= {'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\n\t\twhile(n!=0) {\n\t\t\tint a=n%b;\n\t        line+=num[a];\n\t\t\tn=(n-a)/b;\n\t\t}\n\t\tStringBuilder sb = new StringBuilder(line);\n        return  sb.reverse().toString();\n\t}\n\tpublic static String change2(int n,int b) {\n\t\tString line=\""\"";\n\t\tchar num[]= {'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\n\t\twhile(n!=0) {\n\t\t\tint a=n%b;\n\t        line+=num[a];\n\t\t\tn=(n-a)/b;\n\t\t}\n        return  line;\n\t}\n\tpublic static void main(String[] args) {\n\t\tScanner sc=new Scanner(System.in);\n\t\tint n=sc.nextInt();\n\t\tfor(int i=1;i<=300;i++) {\n\t\t\tif(change(i*i,n).equals(change2(i*i,n))) {\n\t\t\t\tSystem.out.println(change(i,n)+\"" \""+change2(i*i,n));\n\t\t\t}\n\t\t}\n\t}\n\n}",ACCEPTED,1047,12788
1309090905941803008,b6752181378edbb77715b4bc1b0fa55f6e3000b252f7b8c7f798a74e3a5775b7,2020-09-24 19:22:48,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.*;\nimport java.lang.*;\n\npublic class Main {\n\tpublic static String change(int n,int b) {\n\t\tString line=\""\"";\n\t\tchar num[]= {'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\n\t\twhile(n!=0) {\n\t\t\tint a=n%b;\n\t        line+=num[a];\n\t\t\tn=(n-a)/b;\n\t\t}\n\t\tStringBuilder sb = new StringBuilder(line);\n        return  sb.reverse().toString();\n\t}\n\tpublic static String change2(int n,int b) {\n\t\tString line=\""\"";\n\t\tchar num[]= {'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\n\t\twhile(n!=0) {\n\t\t\tint a=n%b;\n\t        line+=num[a];\n\t\t\tn=(n-a)/b;\n\t\t}\n        return  line;\n\t}\n\tpublic static void main(String[] args) {\n\t\tScanner sc=new Scanner(System.in);\n\t\tint m=sc.nextInt();\n\t\tint n=sc.nextInt();\n\t\tint count=0;\n\t\tfor(int i=n+1;;i++) {\n\t\t\tint flag=0;\n\t\t\tfor(int j=2;j<=10;j++) {\n\t\t\t\tif(change(i,j).equals(change2(i,j))) {\n\t\t\t\t\tflag++;\n\t\t\t\tif(flag>=2) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t}\n\t\t\tif(flag>=2) {\n\t\t\t\tcount++;\n\t\t\t\tSystem.out.print(i+\"" \"");\n\t\t\t}\n\t\t\tif(count>=m) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n}\n",PRESENTATION_ERROR,1074,44376
1309093291410259968,b6752181378edbb77715b4bc1b0fa55f6e3000b252f7b8c7f798a74e3a5775b7,2020-09-24 19:32:17,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.*;\nimport java.lang.*;\n\npublic class Main {\n\tpublic static String change(int n,int b) {\n\t\tString line=\""\"";\n\t\tchar num[]= {'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\n\t\twhile(n!=0) {\n\t\t\tint a=n%b;\n\t        line+=num[a];\n\t\t\tn=(n-a)/b;\n\t\t}\n\t\tStringBuilder sb = new StringBuilder(line);\n        return  sb.reverse().toString();\n\t}\n\tpublic static String change2(int n,int b) {\n\t\tString line=\""\"";\n\t\tchar num[]= {'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\n\t\twhile(n!=0) {\n\t\t\tint a=n%b;\n\t        line+=num[a];\n\t\t\tn=(n-a)/b;\n\t\t}\n        return  line;\n\t}\n\tpublic static void main(String[] args) {\n\t\tScanner sc=new Scanner(System.in);\n\t\tint m=sc.nextInt();\n\t\tint n=sc.nextInt();\n\t\tint count=0;\n\t\tfor(int i=n+1;;i++) {\n\t\t\tint flag=0;\n\t\t\tfor(int j=2;j<=10;j++) {\n\t\t\t\tif(change(i,j).equals(change2(i,j))) {\n\t\t\t\t\tflag++;\n\t\t\t\tif(flag>=2) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t}\n\t\t\tif(flag>=2&&count==0) {\n\t\t\t\tcount++;\n\t\t\t\tSystem.out.print(i);\n\t\t\t}\n\t\t\telse if(flag>=2&&count<m) {\n\t\t\t\tcount++;\n\t\t\t\tSystem.out.print(\"" \""+i);\n\t\t\t}\n\t\t\telse if(count>=m) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n}\n",PRESENTATION_ERROR,1057,42288
1309093601751007232,b6752181378edbb77715b4bc1b0fa55f6e3000b252f7b8c7f798a74e3a5775b7,2020-09-24 19:33:31,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.*;\nimport java.lang.*;\n\npublic class Main {\n\tpublic static String change(int n,int b) {\n\t\tString line=\""\"";\n\t\tchar num[]= {'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\n\t\twhile(n!=0) {\n\t\t\tint a=n%b;\n\t        line+=num[a];\n\t\t\tn=(n-a)/b;\n\t\t}\n\t\tStringBuilder sb = new StringBuilder(line);\n        return  sb.reverse().toString();\n\t}\n\tpublic static String change2(int n,int b) {\n\t\tString line=\""\"";\n\t\tchar num[]= {'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\n\t\twhile(n!=0) {\n\t\t\tint a=n%b;\n\t        line+=num[a];\n\t\t\tn=(n-a)/b;\n\t\t}\n        return  line;\n\t}\n\tpublic static void main(String[] args) {\n\t\tScanner sc=new Scanner(System.in);\n\t\tint m=sc.nextInt();\n\t\tint n=sc.nextInt();\n\t\tint count=0;\n\t\tfor(int i=n+1;;i++) {\n\t\t\tint flag=0;\n\t\t\tfor(int j=2;j<=10;j++) {\n\t\t\t\tif(change(i,j).equals(change2(i,j))) {\n\t\t\t\t\tflag++;\n\t\t\t\tif(flag>=2) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t}\n\t\t\tif(flag>=2&&count<m) {\n\t\t\t\tcount++;\n\t\t\t\tSystem.out.println(i);\n\t\t\t}\n\t\t\tif(count>=m) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n}",ACCEPTED,1101,40828
1309111818406002688,2ae17ef3d46d69228c571dc2149bcfaf6a08711992aba3b929151c6f4a743e38,2020-09-24 20:45:54,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"\nimport java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner s=new Scanner(System.in);\n\t\tint n,m,cnt=0;\n\t\tn=s.nextInt();\n\t\tm=s.nextInt();\n\t\tfor (int i = m+1; ; i++) {\n\t\t\tint ccnt=0;\n\t\t\tfor (int j = 2; j <= 10; j++) {\n\t\t\t\tString s1=Integer.toString(i,j);\n\t\t\t\tStringBuffer s2=new StringBuffer(s1);\n\t\t\t\tStringBuffer s3=s2.reverse();\n\t\t\t\tchar ss[]=new char[s2.length()];\n\t\t\t\tss=s3.toString().toCharArray();\n\t\t\t\tif(s1.equals(s3.toString())&&ss[0]!='0')\n\t\t\t\t{\n\t\t\t\t\tccnt++;\n\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\tif(ccnt==2)\n\t\t\t\t{\n\t\t\t\t\tSystem.out.println(i);\n\t\t\t\t\tcnt++;\n\t\t\t\t\tbreak;\n\t\t\t\t}\t\n\t\t\t}\n\t\t\tif(cnt==n)\n\t\t\t\tbreak;\n\t\t}\n\t\n\t\treturn;\n}\n}\n",ACCEPTED,948,20828
1309382355258638336,6c8f08bdd8932fdcc26294d3b748a060d4a9595093ae5e78e918a079cbdde348,2020-09-25 14:40:55,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\npublic class Main{\n    public static boolean check(int num,int radix,int[] a){\n        int temp=num;\n        int i=0;\n        while(temp>0){\n            i++;\n            a[i]=temp%radix;\n            temp/=radix;\n        }\n        for(int j=1;j<=i/2;j++){\n            if(a[j]!=a[i-j+1]) return false;\n        }\n        return true;\n    }\n    public static String getAns(int num, int radix,int[] a,String ans){\n        int temp=num;\n        int i=0;\n        while(temp>0){\n            i++;\n            a[i]=temp%radix;\n            temp/=radix;\n        }\n        for(int j=i;j>0;j--){\n            if(a[j]<10) ans+=String.valueOf(a[j]);\n            if(a[j]==10) ans+=\""A\"";\n            if(a[j]==11) ans+=\""B\"";\n            if(a[j]==12) ans+=\""C\"";\n            if(a[j]==13) ans+=\""D\"";\n            if(a[j]==14) ans+=\""E\"";\n            if(a[j]==15) ans+=\""F\"";\n            if(a[j]==16) ans+=\""G\"";\n            if(a[j]==17) ans+=\""H\"";\n            if(a[j]==18) ans+=\""I\"";\n            if(a[j]==19) ans+=\""J\"";\n            if(a[j]==20) ans+=\""K\"";\n        }\n        return ans;\n    }\n    public static void main(String[] args){\n        Scanner input = new Scanner(System.in);\n        int[] a=new int [1005];\n        int radix;\n        String ans= new String();\n        radix=input.nextInt();\n        for(int i=1;i<=300;i++){\n            if(check(i*i,radix,a)){\n                ans+=getAns(i,radix,a,ans);\n                ans+=\"" \"";\n                ans+=getAns(i*i,radix,a,ans);\n                System.out.println(ans);\n                ans=\""\"";\n            }\n        }\n    }\n    \n\n}",WRONG_ANSWER,1025,11236
1309384239818145792,6c8f08bdd8932fdcc26294d3b748a060d4a9595093ae5e78e918a079cbdde348,2020-09-25 14:48:24,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\npublic class Main{\n    public static boolean check(int num,int radix,int[] a){\n        int temp=num;\n        int i=0;\n        while(temp>0){\n            i++;\n            a[i]=temp%radix;\n            temp/=radix;\n        }\n        for(int j=1;j<=i/2;j++){\n            if(a[j]!=a[i-j+1]) return false;\n        }\n        return true;\n    }\n    public static String getAns(int num, int radix,int[] a,String ans){\n        int temp=num;\n        int i=0;\n        while(temp>0){\n            i++;\n            a[i]=temp%radix;\n            temp/=radix;\n        }\n        for(int j=i;j>0;j--){\n            if(a[j]<10) ans+=String.valueOf(a[j]);\n            if(a[j]==10) ans+=\""A\"";\n            if(a[j]==11) ans+=\""B\"";\n            if(a[j]==12) ans+=\""C\"";\n            if(a[j]==13) ans+=\""D\"";\n            if(a[j]==14) ans+=\""E\"";\n            if(a[j]==15) ans+=\""F\"";\n            if(a[j]==16) ans+=\""G\"";\n            if(a[j]==17) ans+=\""H\"";\n            if(a[j]==18) ans+=\""I\"";\n            if(a[j]==19) ans+=\""J\"";\n            if(a[j]==20) ans+=\""K\"";\n        }\n        return ans;\n    }\n    public static void main(String[] args){\n        Scanner input = new Scanner(System.in);\n        int[] a=new int [1005];\n        int radix;\n        String ans= new String();\n        radix=input.nextInt();\n        for(int i=1;i<=300;i++){\n            if(check(i*i,radix,a)){\n                System.out.println(getAns(i,radix,a,ans)+\"" \""+getAns(i*i,radix,a,ans));\n                ans=\""\"";\n            }\n        }\n    }\n}",ACCEPTED,965,11348
1309387402239475712,6c8f08bdd8932fdcc26294d3b748a060d4a9595093ae5e78e918a079cbdde348,2020-09-25 15:00:58,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\npublic class Main{\n    public static int check(int num,int radix,int[] a){\n        int temp=num;\n        int i=0;\n        while(temp>0){\n            i++;\n            a[i]=temp%radix;\n            temp/=radix;\n        }\n        for(int j=1;j<=i/2;j++){\n            if(a[j]!=a[i-j+1]) return 0;\n        }\n        return 1;\n    }\n    public static void main(String[] args){\n        Scanner input = new Scanner(System.in);\n        int[] a = new int [5005];\n        int n,s;\n        n=input.nextInt();\n        s=input.nextInt();\n        while(n>0){\n            s++;\n            int test=0;\n            for(int i=2;i<=10;i++){\n                test+=check(s,i,a);\n            }\n            if(test>=2){\n                System.out.println(s);\n                n--;\n            }\n        }\n    }\n}",ACCEPTED,899,12004
1309463727373484032,fb8d83617e99b5368043d5a60c02cca350bc684afc8a34a362ad6cc849d209b6,2020-09-25 20:04:15,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.*;\npublic class Main{\n\tstatic int B;\n\tstatic char num[]=new char[20],num1[]=new char[20];\n\tstatic boolean k;\n\tpublic static void print(int n) {\n\t\tif(k==true)System.out.println();\n\t\telse k=true;\n\t\tint t=(int)Math.sqrt(n),s,index=0;\n\t\twhile(t>0) {\n\t\t\ts=t%B;\n\t\t\tif(s<10)num1[index++]=(char)(s+48);\n\t\t\telse num1[index++]=(char)(s+55);\n\t\t\tt/=B;\n\t\t}\n\t\tfor(--index;index>=0;index--){\n\t\t\tSystem.out.print(num1[index]);\n\t\t}\n\t\tSystem.out.print(\"" \"");\n\t}\n\tpublic static void palindrome(int n) {\n\t\tint t=n,s,index=0;\n\t\twhile (t > 0) {\n\t\t\ts = t % B;\n\t\t\tif (s < 10)num[index++] = (char)(s + 48);\n\t\t\telse num[index++] = (char)(s + 55);\n\t\t\tt /= B;\n\t\t}\n\t\tfor (int i = 0; i < index / 2; i++)\n\t\t\tif (num[i] != num[index - 1 - i])return;\n\t\tprint(n);\n\t\tfor (--index; index >= 0; index--)\n\t\t\tSystem.out.print(num[index]);\n\t}\n\tpublic static void main(String[] args) {\n\t\tScanner in=new Scanner(System.in);\n\t\tB=in.nextInt();\n\t\tfor(int i=1;i<=300;i++)\n\t\t\tpalindrome(i*i);\n\t\tin.close();\n\t}",COMPILE_ERROR,0,0
1309463823674703872,fb8d83617e99b5368043d5a60c02cca350bc684afc8a34a362ad6cc849d209b6,2020-09-25 20:04:38,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.*;\npublic class Main{\n\tstatic int B;\n\tstatic char num[]=new char[20],num1[]=new char[20];\n\tstatic boolean k;\n\tpublic static void print(int n) {\n\t\tif(k==true)System.out.println();\n\t\telse k=true;\n\t\tint t=(int)Math.sqrt(n),s,index=0;\n\t\twhile(t>0) {\n\t\t\ts=t%B;\n\t\t\tif(s<10)num1[index++]=(char)(s+48);\n\t\t\telse num1[index++]=(char)(s+55);\n\t\t\tt/=B;\n\t\t}\n\t\tfor(--index;index>=0;index--){\n\t\t\tSystem.out.print(num1[index]);\n\t\t}\n\t\tSystem.out.print(\"" \"");\n\t}\n\tpublic static void palindrome(int n) {\n\t\tint t=n,s,index=0;\n\t\twhile (t > 0) {\n\t\t\ts = t % B;\n\t\t\tif (s < 10)num[index++] = (char)(s + 48);\n\t\t\telse num[index++] = (char)(s + 55);\n\t\t\tt /= B;\n\t\t}\n\t\tfor (int i = 0; i < index / 2; i++)\n\t\t\tif (num[i] != num[index - 1 - i])return;\n\t\tprint(n);\n\t\tfor (--index; index >= 0; index--)\n\t\t\tSystem.out.print(num[index]);\n\t}\n\tpublic static void main(String[] args) {\n\t\tScanner in=new Scanner(System.in);\n\t\tB=in.nextInt();\n\t\tfor(int i=1;i<=300;i++)\n\t\t\tpalindrome(i*i);\n\t\tin.close();\n    }\n}",ACCEPTED,968,11408
1309814970142883840,fb8d83617e99b5368043d5a60c02cca350bc684afc8a34a362ad6cc849d209b6,2020-09-26 19:19:58,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.*;\npublic class Main{\n\tstatic int N,S,cnt;\n\tstatic char[] num=new char[20];\n\tstatic boolean k;\n\tpublic static boolean palindrome(int n,int B) {\n\t\tint t=n,s,index=0;\n\t\twhile(t>0) {\n\t\t\ts=t%B;\n\t\t\tif(s<10)num[index++]=(char)(s+48);\n\t\t\telse num[index++]=(char)(s+55);\n\t\t\tt/=B;\n\t\t}\n\t\tfor (int i = 0; i < index / 2; i++)\n\t\t\tif (num[i] != num[index - 1 - i])return false;\n\t\treturn true;\n\t}\n\tpublic static void main(String[] args) {\n\t\tScanner in=new Scanner(System.in);\n\t\tN=in.nextInt();\n\t\tS=in.nextInt();\n\t\tfor (int i = S + 1; cnt < N; i++) {\n\t\t\tint cnt1 = 0;\n\t\t\tfor (int B = 2; B <= 10; B++) {\n\t\t\t\tif (palindrome(i, B))\n\t\t\t\t\tcnt1++;\n\t\t\t\tif (cnt1 == 2) {\n\t\t\t\t\tif (k)System.out.println();\n\t\t\t\t\telse k = true;\n\t\t\t\t\tSystem.out.print(i);;\n\t\t\t\t\tcnt++;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tin.close();\n\t}\n}",ACCEPTED,846,11424
1309885912378441728,ec53039adbfa16331c9f18e1417ee9aff06a3bca71bca4365b8f05065abe9d6c,2020-09-27 00:01:52,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\npublic class Main{\n    public int num1[] = new int[1000];\n    public int num2[] = new int[1000];\n    \n    public static void main(String []args){\n        Scanner in = new scanner(System.in);\n        int n = in.nextInt();\n\t    for(i = 1;i <= 300;i++){\n\t\tint square = i*i;\n\t\tint j = turn(n,square);\n\t\tif(judge(j)){\n\t\t\tprint(n,i);\n\t\t\tSystem.out.println(\"" \"");\n\t\t\tfor(int v = j;v >= 0;v--)\n\t\t\t\tif(num1[v] > 9)\n\t\t\t\t\t(num1[v]-10+'A');\n\t\t\t\telse\tSystem.out.println(num1[v]);\n\t\t\tputchar(10);\n\n            \n            \n        }\n        \n    }\n    public static int turn(int n_,int square_){\n\tfor(int k=0;;i++){\n        num1[k]= square_%n_;\n        square_= square_/n_;\n        if(square_ == 0) break;\n        return k;\n    }\n    public static boolean judge(int k_){\n        int flag = 1;\n        for(int p = 0,q = k_;p <= q;p++,q--){\n            if(num1[p] != num1[q]){\n                flag = 0;\n                break;\n        }\n        return flag;\n    }\n            \n    public static void print(int n_,int i_){\n        int t;\n\t    for(t=0;;t++){\n            num2[t]=i_%n_;\n            square_=i_/n_;\n            if(i_ == 0) break;\n        }\n        for(t=t;t>=0;t--){\n\t\t    if(num2[t]>9) System.out.println(num2[i]- 10 +'A');\n\t\t    else System.out.printf(num2[t]);\n        }\n}",COMPILE_ERROR,0,0
1309886380303384576,ec53039adbfa16331c9f18e1417ee9aff06a3bca71bca4365b8f05065abe9d6c,2020-09-27 00:03:44,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\npublic class Main{\n    public int num1[] = new int[1000];\n    public int num2[] = new int[1000];\n    \n    public static void main(String []args){\n        Scanner in = new scanner(System.in);\n        int n = in.nextInt();\n\t    for(i = 1;i <= 300;i++){\n\t\tint square = i*i;\n\t\tint j = turn(n,square);\n\t\tif(judge(j)){\n\t\t\tprint(n,i);\n\t\t\tSystem.out.println(\"" \"");\n\t\t\tfor(int v = j;v >= 0;v--)\n\t\t\t\tif(num1[v] > 9)\n\t\t\t\t\t(num1[v]-10+'A');\n\t\t\t\telse\tSystem.out.println(num1[v]);\n\n            \n            \n        }\n        \n    }\n    public int turn(int n_,int square_){\n\tfor(int k=0;;i++){\n        num1[k]= square_%n_;\n        square_= square_/n_;\n        if(square_ == 0) break;\n        return k;\n    }\n    public boolean judge(int k_){\n        int flag = 1;\n        for(int p = 0,q = k_;p <= q;p++,q--){\n            if(num1[p] != num1[q]){\n                flag = 0;\n                break;\n        }\n        return flag;\n    }\n            \n    public void print(int n_,int i_){\n        int t;\n\t    for(t=0;;t++){\n            num2[t]=i_%n_;\n            square_=i_/n_;\n            if(i_ == 0) break;\n        }\n        for(t=t;t>=0;t--){\n\t\t    if(num2[t]>9) System.out.println(num2[i]- 10 +'A');\n\t\t    else System.out.printf(num2[t]);\n        }\n    }     \n}",COMPILE_ERROR,0,0
1309886508363874304,ec53039adbfa16331c9f18e1417ee9aff06a3bca71bca4365b8f05065abe9d6c,2020-09-27 00:04:14,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\npublic class Main{\n    public int num1[] = new int[1000];\n    public int num2[] = new int[1000];\n    \n    public static void main(String []args){\n        Scanner in = new scanner(System.in);\n        int n = in.nextInt();\n\t    for(i = 1;i <= 300;i++){\n\t\tint square = i*i;\n\t\tint j = turn(n,square);\n\t\tif(judge(j)){\n\t\t\tprint(n,i);\n\t\t\tSystem.out.println(\"" \"");\n\t\t\tfor(int v = j;v >= 0;v--)\n\t\t\t\tif(num1[v] > 9)\n\t\t\t\t\t(num1[v]-10+'A');\n\t\t\t\telse\tSystem.out.println(num1[v]);\n\n            \n            \n        }\n        \n    }\n    public int turn(int n_,int square_){\n\tfor(int k=0;;i++){\n        num1[k]= square_%n_;\n        square_= square_/n_;\n        if(square_ == 0) break;\n        return k;\n    }\n    public boolean judge(int k_){\n        int flag = 1;\n        for(int p = 0,q = k_;p <= q;p++,q--){\n            if(num1[p] != num1[q]){\n                flag = 0;\n                break;\n        }\n        return flag;\n    }\n            \n    public void print(int n_,int i_){\n        int t;\n\t    for(t=0;;t++){\n            num2[t]=i_%n_;\n            square_=i_/n_;\n            if(i_ == 0) break;\n        }\n        for(t=t;t>=0;t--){\n\t\t    if(num2[t]>9) System.out.println(num2[i]- 10 +'A');\n\t\t    else System.out.printf(num2[t]);\n        }\n    }     \n}",COMPILE_ERROR,0,0
1309886725062590464,ec53039adbfa16331c9f18e1417ee9aff06a3bca71bca4365b8f05065abe9d6c,2020-09-27 00:05:06,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\npublic class Main{\n    public int num1[] = new int[1000];\n    public int num2[] = new int[1000];\n    \n    public static void main(String []args){\n        Scanner in = new scanner(System.in);\n        int n = in.nextInt();\n\t    for(i = 1;i <= 300;i++){\n\t\tint square = i*i;\n\t\tint j = turn(n,square);\n\t\tif(judge(j)){\n\t\t\tprint(n,i);\n\t\t\tSystem.out.println(\"" \"");\n\t\t\tfor(int v = j;v >= 0;v--)\n\t\t\t\tif(num1[v] > 9)\n\t\t\t\t\t(num1[v]-10+'A');\n\t\t\t\telse\tSystem.out.println(num1[v]);\n\n            \n            \n        }\n        \n    }\n    public static int turn(int n_,int square_){\n\tfor(int k=0;;i++){\n        num1[k]= square_%n_;\n        square_= square_/n_;\n        if(square_ == 0) break;\n        return k;\n    }\n    public static boolean judge(int k_){\n        int flag = 1;\n        for(int p = 0,q = k_;p <= q;p++,q--){\n            if(num1[p] != num1[q]){\n                flag = 0;\n                break;\n        }\n        return flag;\n    }\n            \n    public static void print(int n_,int i_){\n        int t;\n\t    for(t=0;;t++){\n            num2[t]=i_%n_;\n            square_=i_/n_;\n            if(i_ == 0) break;\n        }\n        for(t=t;t>=0;t--){\n\t\t    if(num2[t]>9) System.out.println(num2[i]- 10 +'A');\n\t\t    else System.out.printf(num2[t]);\n        }\n    }     \n}",COMPILE_ERROR,0,0
1309886992805986304,ec53039adbfa16331c9f18e1417ee9aff06a3bca71bca4365b8f05065abe9d6c,2020-09-27 00:06:10,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\npublic class Main{\n    public int num1[] = new int[1000];\n    public int num2[] = new int[1000];\n    public static void main(String []args){\n        Scanner in = new scanner(System.in);\n        int n = in.nextInt();\n\t    for(i = 1;i <= 300;i++){\n\t\tint square = i*i;\n\t\tint j = turn(n,square);\n\t\tif(judge(j)){\n\t\t\tprint(n,i);\n\t\t\tSystem.out.println(\"" \"");\n\t\t\tfor(int v = j;v >= 0;v--)\n\t\t\t\tif(num1[v] > 9)\n\t\t\t\t\t(num1[v]-10+'A');\n\t\t\t\telse\tSystem.out.println(num1[v]);\n\n            \n            \n        }\n        \n    }\n    public static int turn(int n_,int square_){\n\tfor(int k=0;;i++){\n        num1[k]= square_%n_;\n        square_= square_/n_;\n        if(square_ == 0) break;\n        return k;\n    }\n    public static boolean judge(int k_){\n        int flag = 1;\n        for(int p = 0,q = k_;p <= q;p++,q--){\n            if(num1[p] != num1[q]){\n                flag = 0;\n                break;\n        }\n        return flag;\n    }\n            \n    public static void print(int n_,int i_){\n        int t;\n\t    for(t=0;;t++){\n            num2[t]=i_%n_;\n            square_=i_/n_;\n            if(i_ == 0) break;\n        }\n        for(t=t;t>=0;t--){\n\t\t    if(num2[t]>9) System.out.println(num2[i]- 10 +'A');\n\t\t    else System.out.printf(num2[t]);\n        }\n    }     \n}",COMPILE_ERROR,0,0
1309887755171069952,ec53039adbfa16331c9f18e1417ee9aff06a3bca71bca4365b8f05065abe9d6c,2020-09-27 00:09:11,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\npublic class Main{\n    \n    public static void main(String []args){\n        public int num1[] = new int[1000];\n        public int num2[] = new int[1000];\n        Scanner in = new scanner(System.in);\n        int n = in.nextInt();\n\t    for(i = 1;i <= 300;i++){\n\t\tint square = i*i;\n\t\tint j = turn(n,square,num1);\n\t\tif(judge(j,num1)){\n\t\t\tprint(n,i,num2);\n\t\t\tSystem.out.println(\"" \"");\n\t\t\tfor(int v = j;v >= 0;v--)\n\t\t\t\tif(num1[v] > 9)\n\t\t\t\t\t(num1[v]-10+'A');\n\t\t\t\telse\tSystem.out.println(num1[v]);\n\n            \n            \n        }\n        \n    }\n    public static int turn(int n_,int square_,int num1){\n\tfor(int k=0;;i++){\n        num1[k]= square_%n_;\n        square_= square_/n_;\n        if(square_ == 0) break;\n        return k;\n    }\n    public static boolean judge(int k_,int num1){\n        int flag = 1;\n        for(int p = 0,q = k_;p <= q;p++,q--){\n            if(num1[p] != num1[q]){\n                flag = 0;\n                break;\n        }\n        return flag;\n    }\n            \n    public static void print(int n_,int i_,int num2){\n        int t;\n\t    for(t=0;;t++){\n            num2[t]=i_%n_;\n            square_=i_/n_;\n            if(i_ == 0) break;\n        }\n        for(t=t;t>=0;t--){\n\t\t    if(num2[t]>9) System.out.println(num2[i]- 10 +'A');\n\t\t    else System.out.printf(num2[t]);\n        }\n    }     \n}",COMPILE_ERROR,0,0
1309887827338264576,ec53039adbfa16331c9f18e1417ee9aff06a3bca71bca4365b8f05065abe9d6c,2020-09-27 00:09:29,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\npublic class Main{\n    \n    public static void main(String []args){\n         int num1[] = new int[1000];\n         int num2[] = new int[1000];\n        Scanner in = new scanner(System.in);\n        int n = in.nextInt();\n\t    for(i = 1;i <= 300;i++){\n\t\tint square = i*i;\n\t\tint j = turn(n,square,num1);\n\t\tif(judge(j,num1)){\n\t\t\tprint(n,i,num2);\n\t\t\tSystem.out.println(\"" \"");\n\t\t\tfor(int v = j;v >= 0;v--)\n\t\t\t\tif(num1[v] > 9)\n\t\t\t\t\t(num1[v]-10+'A');\n\t\t\t\telse\tSystem.out.println(num1[v]);\n\n            \n            \n        }\n        \n    }\n    public static int turn(int n_,int square_,int num1){\n\tfor(int k=0;;i++){\n        num1[k]= square_%n_;\n        square_= square_/n_;\n        if(square_ == 0) break;\n        return k;\n    }\n    public static boolean judge(int k_,int num1){\n        int flag = 1;\n        for(int p = 0,q = k_;p <= q;p++,q--){\n            if(num1[p] != num1[q]){\n                flag = 0;\n                break;\n        }\n        return flag;\n    }\n            \n    public static void print(int n_,int i_,int num2){\n        int t;\n\t    for(t=0;;t++){\n            num2[t]=i_%n_;\n            square_=i_/n_;\n            if(i_ == 0) break;\n        }\n        for(t=t;t>=0;t--){\n\t\t    if(num2[t]>9) System.out.println(num2[i]- 10 +'A');\n\t\t    else System.out.printf(num2[t]);\n        }\n    }     \n}",COMPILE_ERROR,0,0
1309888203911266304,ec53039adbfa16331c9f18e1417ee9aff06a3bca71bca4365b8f05065abe9d6c,2020-09-27 00:10:58,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\npublic class Main{\n    \n    public static void main(String []args){\n         int num1[] = new int[1000];\n         int num2[] = new int[1000];\n        Scanner in = new scanner(System.in);\n        int n = in.nextInt();\n\t    for(i = 1;i <= 300;i++){\n\t\tint square = i*i;\n\t\tint j = turn(n,square,num1);\n\t\tif(judge(j,num1)){\n\t\t\tprint(n,i,num2);\n\t\t\tSystem.out.println(\"" \"");\n\t\t\tfor(int v = j;v >= 0;v--)\n\t\t\t\tif(num1[v] > 9)\n\t\t\t\t\t(num1[v]-10+'A');\n\t\t\t\telse\tSystem.out.println(num1[v]);\n\n            \n            \n        }\n        \n    }\n    public static int turn(int n_,int square_,int num1){\n\tfor(int k=0;;i++){\n        num1[k]= square_%n_;\n        square_= square_/n_;\n        if(square_ == 0) break;\n        return k;\n    }\n    public static boolean judge(int k_,int num1){\n        int flag = 1;\n        for(int p = 0,q = k_;p <= q;p++,q--){\n            if(num1[p] != num1[q]){\n                flag = 0;\n                break;\n        }\n        return flag;\n    }\n            \n    public static void print(int n_,int i_,int num2){\n        int t;\n\t    for(t=0;;t++){\n            num2[t]=i_%n_;\n            square_=i_/n_;\n            if(i_ == 0) break;\n        }\n        for(t=t;t>=0;t--){\n\t\t    if(num2[t]>9) System.out.println(num2[i] - 10 +'A');\n\t\t    else System.out.printf(num2[t]);\n        }\n    }\n  }\n}",COMPILE_ERROR,0,0
1309888406538092544,ec53039adbfa16331c9f18e1417ee9aff06a3bca71bca4365b8f05065abe9d6c,2020-09-27 00:11:47,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\npublic class Main{\n    \n    public static void main(String []args){\n         int num1[] = new int[1000];\n         int num2[] = new int[1000];\n        Scanner in = new scanner(System.in);\n        int n = in.nextInt();\n\t    for(i = 1;i <= 300;i++){\n\t\tint square = i*i;\n\t\tint j = turn(n,square,num1);\n\t\tif(judge(j,num1)){\n\t\t\tprint(n,i,num2);\n\t\t\tSystem.out.println(\"" \"");\n\t\t\tfor(int v = j;v >= 0;v--)\n\t\t\t\tif(num1[v] > 9)\n\t\t\t\t\t(num1[v]-10+'A');\n\t\t\t\telse\tSystem.out.println(num1[v]);\n\n            \n            \n        }\n        \n    }\n    public static int turn(int n_,int square_,int num1){\n\tfor(int k=0;;i++){\n        num1[k]= square_%n_;\n        square_= square_/n_;\n        if(square_ == 0) break;\n        return k;\n    }\n     public static boolean judge(int k_,int num1){\n        int flag = 1;\n        for(int p = 0,q = k_;p <= q;p++,q--){\n            if(num1[p] != num1[q]){\n                flag = 0;\n                break;\n        }\n        return flag;\n    }\n            \n    public static void print(int n_,int i_,int num2){\n        int t;\n\t    for(t=0;;t++){\n            num2[t]=i_%n_;\n            square_=i_/n_;\n            if(i_ == 0) break;\n        }\n        for(t=t;t>=0;t--){\n\t\t    if(num2[t]>9) System.out.println(num2[i] - 10 +'A');\n\t\t    else System.out.printf(num2[t]);\n        }\n    }\n  }\n}",COMPILE_ERROR,0,0
1310143700497268736,60aefcb14faaa988a3c7d313c8704158d094cb469bd999245250fa350e9dba0d,2020-09-27 17:06:14,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner= new Scanner(System.in);\n        int B =scanner.nextInt();\n        for (int i = 1;i<=300;i++){\n            StringBuffer num1= convert(i,B);\n            StringBuffer num2= convert(i*i,B);\n            if (isPalin(num2)){\n                System.out.println(num1+\"" \""+num2);\n            }\n        }\n    }\n    public static boolean isPalin(StringBuffer s){\n        for (int i=0;i<s.length()/2;i++){\n            if(s.charAt(i)!=s.charAt(s.length()-i-1)){\n                return false;\n            }\n        }\n        return true;\n    }\n    public static StringBuffer convert(int num,int B) {\n        StringBuffer rtnval = new StringBuffer();\n        int digit;\n        while (num > 0) {\n            digit = num % B;\n            if (digit >= 10) {\n                rtnval.append((char) ('A' + digit - 10));\n            } else {\n                rtnval.append(digit);\n            }\n            num /= B;\n        }\n        return rtnval.reverse();//翻转以后得到\n    }\n    }",ACCEPTED,990,11852
1310893694439325696,2e47392c98b789d288205dd61ea858df575c09a10732db5e6582d8ff8b64b68f,2020-09-29 18:46:26,Java,10.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\nimport java.lang.StringBuilder;\n\nclass Main {\n\n    public static boolean check(String s){\n        String rs= new StringBuilder(s).reverse().toString();\n        if(s.equals(rs)) return true;\n        else return false;\n    }\n\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int n;\n        n = s.nextInt();\n        for (int i = 1; i <= 300; i++) {\n            String str= Integer.toString(i*i,n);\n            if(check(str)) System.out.println(i+\"" \""+str);\n\n        }\n\n\n\n\n    }\n}",PARTIAL_ACCEPTED,962,11476
1310895282658672640,2dbc8dbbe3a3713fd279f85d78da00257659b0fa27c0cdad54e2bf4fb0d9580e,2020-09-29 18:52:45,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"public class Main {\n\tstatic boolean Palin_num(StringBuffer a) \n\t{\n\t    int length;\n\t    length = a.length();\n\t    int flag = 1;\n\t    for (int i = 0; i <= (length / 2); i++)\n\t    {\n\t        if (a.charAt(i) != a.charAt(length - i - 1))\n\t        {\n\t            flag = 0;\n\t            break;\n\t        }\n\t    }\n\t    if (flag == 1) \n\t    {\n\t        return true;\n\t    }\n\t    else\n\t    {\n\t        return false;\n\t    }\n\t}\n\n\tstatic StringBuffer intToA(int n, int radix)    \n\t{\n\t    StringBuffer ans = new StringBuffer();\n\t    do {\n\t        int t = n % radix;\n\t        if (t >= 0 && t <= 9)\t\n\t        {\n\t            ans.append(t + '0');\n\t        }\n\t        else \n\t        {\n\t            ans.append(t - 10 + 'A'); \n\t        }\n\t        n /= radix;\n\t    } while (n != 0);\t\n\t    ans.reverse();\n\t    return ans;\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t    int j = 0;\n\t    for (int x = 1; x <= 300; x++)\n\t    {\n\t        j = x;\n\t        \n\t        StringBuffer s1 = intToA(j, n);      \n\t        StringBuffer s2 = intToA((j * j), n);\n\n\t        if (Palin_num(s2))\n\t        {\n\t            System.out.println(s1+\"" \""+s2);\n\t        }\n\t        else\n\t        {\n\t            continue;\n\t        }\n\t    }\n\t}\n\t\n\t}\n\t\t\t",COMPILE_ERROR,0,0
1310895437550125056,2dbc8dbbe3a3713fd279f85d78da00257659b0fa27c0cdad54e2bf4fb0d9580e,2020-09-29 18:53:22,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner\npublic class Main {\n\tstatic boolean Palin_num(StringBuffer a) \n\t{\n\t    int length;\n\t    length = a.length();\n\t    int flag = 1;\n\t    for (int i = 0; i <= (length / 2); i++)\n\t    {\n\t        if (a.charAt(i) != a.charAt(length - i - 1))\n\t        {\n\t            flag = 0;\n\t            break;\n\t        }\n\t    }\n\t    if (flag == 1) \n\t    {\n\t        return true;\n\t    }\n\t    else\n\t    {\n\t        return false;\n\t    }\n\t}\n\n\tstatic StringBuffer intToA(int n, int radix)    \n\t{\n\t    StringBuffer ans = new StringBuffer();\n\t    do {\n\t        int t = n % radix;\n\t        if (t >= 0 && t <= 9)\t\n\t        {\n\t            ans.append(t + '0');\n\t        }\n\t        else \n\t        {\n\t            ans.append(t - 10 + 'A'); \n\t        }\n\t        n /= radix;\n\t    } while (n != 0);\t\n\t    ans.reverse();\n\t    return ans;\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t    int j = 0;\n\t    for (int x = 1; x <= 300; x++)\n\t    {\n\t        j = x;\n\t        \n\t        StringBuffer s1 = intToA(j, n);      \n\t        StringBuffer s2 = intToA((j * j), n);\n\n\t        if (Palin_num(s2))\n\t        {\n\t            System.out.println(s1+\"" \""+s2);\n\t        }\n\t        else\n\t        {\n\t            continue;\n\t        }\n\t    }\n\t}\n\t\n\t}\n\t\t\t",COMPILE_ERROR,0,0
1310895478062907392,2dbc8dbbe3a3713fd279f85d78da00257659b0fa27c0cdad54e2bf4fb0d9580e,2020-09-29 18:53:31,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\npublic class Main {\n\tstatic boolean Palin_num(StringBuffer a) \n\t{\n\t    int length;\n\t    length = a.length();\n\t    int flag = 1;\n\t    for (int i = 0; i <= (length / 2); i++)\n\t    {\n\t        if (a.charAt(i) != a.charAt(length - i - 1))\n\t        {\n\t            flag = 0;\n\t            break;\n\t        }\n\t    }\n\t    if (flag == 1) \n\t    {\n\t        return true;\n\t    }\n\t    else\n\t    {\n\t        return false;\n\t    }\n\t}\n\n\tstatic StringBuffer intToA(int n, int radix)    \n\t{\n\t    StringBuffer ans = new StringBuffer();\n\t    do {\n\t        int t = n % radix;\n\t        if (t >= 0 && t <= 9)\t\n\t        {\n\t            ans.append(t + '0');\n\t        }\n\t        else \n\t        {\n\t            ans.append(t - 10 + 'A'); \n\t        }\n\t        n /= radix;\n\t    } while (n != 0);\t\n\t    ans.reverse();\n\t    return ans;\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t    int j = 0;\n\t    for (int x = 1; x <= 300; x++)\n\t    {\n\t        j = x;\n\t        \n\t        StringBuffer s1 = intToA(j, n);      \n\t        StringBuffer s2 = intToA((j * j), n);\n\n\t        if (Palin_num(s2))\n\t        {\n\t            System.out.println(s1+\"" \""+s2);\n\t        }\n\t        else\n\t        {\n\t            continue;\n\t        }\n\t    }\n\t}\n\t\n\t}\n\t\t\t",WRONG_ANSWER,1038,13448
1310903185306222592,2dbc8dbbe3a3713fd279f85d78da00257659b0fa27c0cdad54e2bf4fb0d9580e,2020-09-29 19:24:09,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\npublic class Main {\n\tstatic boolean Palin_num(final String a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n\t{\n\t    int length;\n\t    length = a.length();\n\t    int flag = 1;\n\t    for (int i = 0; i <= (length / 2); i++)\n\t    {\n\t        if (a.charAt(i) != a.charAt(length - i - 1))\n\t        {\n\t            flag = 0;\n\t            break;\n\t        }\n\t    }\n\t    if (flag == 1) // 是回文数；\n\t    {\n\t        return true;\n\t    }\n\t    else\n\t    {\n\t        return false;\n\t    }\n\t}\n\n\tstatic String intToA(int n, int radix)    //进制转换函数，使用模N取余法；\n\t{\n\t    String ans = \""\"";\n\t    do {\n\t        int t = n % radix;\n\t        if (t >= 0 && t <= 9)\t\n\t        {\n\t            ans += t + '0';\n\t        }\n\t        else \n\t        {\n\t            ans += t - 10 + 'A'; // 保证进制大于10时，数字能用大写字母表示；\n\t        }\n\t        n /= radix;\n\t    } while (n != 0);\t\n\t    StringBuffer trans = new StringBuffer(ans);// 使用do{}while（），以防止输入为0的情况；\n\t    trans.reverse();\n\t    ans = trans.toString();// 模N取余法，得到的字符串反转即可得到对应进制的数；\n\t    return ans;\n\t}\n\n\tpublic static void main(String[] args)\n\t{\n\t\tScanner sc = new Scanner(System.in);\n\t    int n = sc.nextInt();\n\t    int j = 0;\n\t    for (int x = 1; x <= 300; x++)\n\t    {\n\t        j = x; // 创建副本\n\t        \n\t        String s1 = intToA(j, n);      // 将整数按n进制转换；\n\t        String s2 = intToA((j * j), n);// 将该数的平方按n进制转换；\n\n\t        if (Palin_num(s2))\n\t        {\n\t            System.out.println(s1+\"" \""+s2);\n\t        }\n\t        else\n\t        {\n\t            continue;\n\t        }\n\t    }\n\n\t}\n\n\t\n\t}\n\t\t\t\n\n\n\n",WRONG_ANSWER,1044,13388
1310912413286727680,2dbc8dbbe3a3713fd279f85d78da00257659b0fa27c0cdad54e2bf4fb0d9580e,2020-09-29 20:00:49,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\npublic class Main {\n\tstatic boolean Palin_num(final String a) // 回文数判断函数，使用字符串判断法：回文数关于中心对称，只要比较对称的数即可；\n\t{\n\t    int length;\n\t    length = a.length();\n\t    int flag = 1;\n\t    for (int i = 0; i <= (length / 2); i++)\n\t    {\n\t        if (a.charAt(i) != a.charAt(length - i - 1))\n\t        {\n\t            flag = 0;\n\t            break;\n\t        }\n\t    }\n\t    if (flag == 1) // 是回文数；\n\t    {\n\t        return true;\n\t    }\n\t    else\n\t    {\n\t        return false;\n\t    }\n\t}\n\n\tstatic String intToA(int n, int radix)    //进制转换函数，使用模N取余法；\n\t{\n\t    String ans = \""\"";\n\t    do {\n\t        int t = n % radix;\n\t        if (t >= 0 && t <= 9)\t\n\t        {\n\t            ans += t + Integer.valueOf(\""0\"").intValue();\n\t        }\n\t        else \n\t        {\n\t            ans += (char)(t - 10 + 'A'); // 保证进制大于10时，数字能用大写字母表示；\n\t        }\n\t        n /= radix;\n\t    } while (n != 0);\t\n\t    StringBuffer trans = new StringBuffer(ans);// 使用do{}while（），以防止输入为0的情况；\n\t    trans.reverse();\n\t    String ans1 = trans.toString();// 模N取余法，得到的字符串反转即可得到对应进制的数；\n\t    return ans1;\n\t}\n\n\tpublic static void main(String[] args)\n\t{\n\t\tScanner sc = new Scanner(System.in);\n\t    int n = sc.nextInt();\n\t    int j = 0;\n\t    for (int x = 1; x <= 300; x++)\n\t    {\n\t        j = x; // 创建副本\n\t        \n\t        String s1 = intToA(j, n);      // 将整数按n进制转换；\n\t        String s2 = intToA((j * j), n);// 将该数的平方按n进制转换；\n\n\t        if (Palin_num(s2))\n\t        {\n\t            System.out.println(s1+\"" \""+s2);\n\t        }\n\t        else\n\t        {\n\t            continue;\n\t        }\n\t    }\n\n\t}\n\n\t\n\t}\n\t\t\t\n\n\n\n",ACCEPTED,1326,12972
1310937883441037312,f1ab11f416335963f4a2cdc8978e6fae8b6fc771cee7f44349d5ee6ab070f196,2020-09-29 21:42:02,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\n   static int []k=new int[100];\n   static int []kk=new int[100];\n\n    public static void main(String[] args) {\n\n\n\n        //int change(int n,int s);\n        //int change2(int n, int s);\n\n            Scanner scanner=new Scanner(System.in);\n            char ch;\n            boolean pan=true;\n            int n,s;\n            int ans,anss;\n            n=scanner.nextInt();\n            for(int i=1;i<=300;++i)\n            {\n                s=i*i;\n                ans=change(n,s);\n                anss=ans/2;\n                for(int j=1;j<=anss;++j)\n                {\n                    if(k[j]!=k[ans-j+1])\n                    {\n                        pan=false;\n                        break;\n                    }\n                }\n                if(pan)\n                {\n                    for(int j=change2(n,i);j>=1;--j)\n                    {\n                        if(kk[j]<10){\n                            System.out.println(kk[j]);\n                        }\n                        else{\n                            ch=(char)(kk[j]-10+65);\n                            System.out.println(ch);;\n                        }\n                    }\n                    System.out.println(' ');\n                    for(int j=1;j<=ans;++j)\n                    {\n                        if(k[j]<10){\n                            System.out.println(k[j]);\n                        }\n                        else{\n                            ch=(char)(k[j]-10+65);\n                            System.out.println(ch);\n                        }\n                    }\n\n\n                }\n                pan=true;\n            }\n\n        }\n\n\n\n\n static    int change(int n,int s)\n    {\n        int ji=0;\n        int a,b;\n\n        while(s!=0)\n        {\n            a=s%n;\n            k[++ji]=a;\n            s/=n;\n        }\n        return ji;\n    }\n static    int change2(int n,int s)\n    {\n        int ji=0;\n        int a,b;\n\n        while(s!=0)\n        {\n            a=s%n;\n            kk[++ji]=a;\n            s/=n;\n        }\n        return ji;\n    }\n}\n",PRESENTATION_ERROR,996,11300
1310939384272060416,f1ab11f416335963f4a2cdc8978e6fae8b6fc771cee7f44349d5ee6ab070f196,2020-09-29 21:47:59,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\n   static int []k=new int[100];\n   static int []kk=new int[100];\n\n    public static void main(String[] args) {\n\n\n\n        //int change(int n,int s);\n        //int change2(int n, int s);\n\n            Scanner scanner=new Scanner(System.in);\n            char ch;\n            boolean pan=true;\n            int n,s;\n            int ans,anss;\n            n=scanner.nextInt();\n            for(int i=1;i<=300;++i)\n            {\n                s=i*i;\n                ans=change(n,s);\n                anss=ans/2;\n                for(int j=1;j<=anss;++j)\n                {\n                    if(k[j]!=k[ans-j+1])\n                    {\n                        pan=false;\n                        break;\n                    }\n                }\n                if(pan)\n                {\n                    for(int j=change2(n,i);j>=1;--j)\n                    {\n                        if(kk[j]<10){\n                            System.out.print(kk[j]);\n                        }\n                        else{\n                            ch=(char)(kk[j]-10+65);\n                            System.out.print(ch);;\n                        }\n                    }\n                    System.out.print(' ');\n                    for(int j=1;j<=ans;++j)\n                    {\n                        if(k[j]<10){\n                            System.out.print(k[j]);\n                        }\n                        else{\n                            ch=(char)(k[j]-10+65);\n                            System.out.print(ch);\n                        }\n                    }\n                    System.out.print(\""\\n\"");\n\n                }\n                pan=true;\n            }\n\n        }\n\n\n\n\n static    int change(int n,int s)\n    {\n        int ji=0;\n        int a,b;\n\n        while(s!=0)\n        {\n            a=s%n;\n            k[++ji]=a;\n            s/=n;\n        }\n        return ji;\n    }\n static    int change2(int n,int s)\n    {\n        int ji=0;\n        int a,b;\n\n        while(s!=0)\n        {\n            a=s%n;\n            kk[++ji]=a;\n            s/=n;\n        }\n        return ji;\n    }\n}\n",ACCEPTED,974,11288
1310965062728089600,5ad4dbb49340c80253114abf51ba25a8e80d6e95f9ba2cfaa3cbe70794d72ce0,2020-09-29 23:30:02,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tchar s1[] = new char[20];\n\t\tchar s2[] = new char[20];\n\t\t    int B,l2,l1;\n\t\t    Scanner input = new Scanner(System.in);\n\t\t    B=input.nextInt();\n\t\t    for(int i=0;i<=5;i++){\n\t\t        l2=0;\n\t\t        CHAR S2=conv(i*i,B,l2);\n\t\t        l2=S2.len;\n\t\t        if(isHui(s2,l2)==1){\n\t\t            l1=0;\n\t\t            CHAR S1=conv(i,B,l1);\n\t\t            l1=S1.len;\n\t\t            for(int i1=S1.len-1;i1>=0;i1--){\n\t\t                if(i1==0) {\n\t\t                    System.out.print(s1[i1]);\n\t\t                    System.out.print(' ');\n\t\t                }\n\t\t                else\n\t\t                \tSystem.out.print(s1[i1]);\n\t\t            }\n\t\t            for(int i2=S2.len-1;i2>=0;i2--){\n\t\t                if(i2==0) {\n\t\t                \tSystem.out.print(s2[i2]);\n\t\t                \tSystem.out.print(' ');\n\t\t                }\n\t\t                else\n\t\t                \tSystem.out.print(s2[i2]);\n\t\t            }\n\t\t        }\n\t\t    }\n\t}\n\tpublic static class CHAR{\n\t\t\tchar s[];\n\t\t\tint len;\n\t\t\tCHAR(char[] ss,int l){\n\t\t\t\ts=ss;\n\t\t\t\tlen=l;\n\t\t\t}\n\t}\n\tstatic CHAR conv(int a,int b,int len){\n\t    char s[]=new char[20];\n\t    int i=0;\n\t    while(a>0){\n\t    \t//System.out.println(a);\n\t        if(a%b<10)\n\t            s[i]=(char) (a%b+'0');\n\t        else\n\t            s[i]=(char) (a%b+'A'-10);\n\t        a=a/b;\n\t        len++;\n\t        i++;\n\t        \n\t    }\n\t    CHAR S =new CHAR(s,len);\n\t    \n\t    return S;\n\t}\n\tstatic int isHui(char a[],int n){\n\t    int flag=1;\n\t    for(int i=0;i<n/2;i++){\n\t        if(a[i]!=a[n-i-1]){\n\t            flag=0;\n\t            break;\n\t        }\n\t    }\n\t    return flag;\n\t}\n}",WRONG_ANSWER,951,11316
1310967122915688448,2e47392c98b789d288205dd61ea858df575c09a10732db5e6582d8ff8b64b68f,2020-09-29 23:38:13,Java,50.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\nimport java.lang.StringBuilder;\n\nclass Main {\n\n    public static boolean check(String s){\n        String rs= new StringBuilder(s).reverse().toString();\n        if(s.equals(rs)) return true;\n        else return false;\n    }\n\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int n;\n        n = s.nextInt();\n        for (int i = 1; i <= 300; i++) {\n            String str= Integer.toString(i*i,n);\n            if(check(str)) {\n                String num=Integer.toString(i,n);\n                System.out.println(num + \"" \"" + str);\n            }\n        }\n    }\n}",PARTIAL_ACCEPTED,1156,11280
1310967504077258752,2e47392c98b789d288205dd61ea858df575c09a10732db5e6582d8ff8b64b68f,2020-09-29 23:39:44,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\nimport java.lang.StringBuilder;\n\nclass Main {\n\n    public static boolean check(String s){\n        String rs= new StringBuilder(s).reverse().toString();\n        if(s.equals(rs)) return true;\n        else return false;\n    }\n\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        int n;\n        n = s.nextInt();\n        for (int i = 1; i <= 300; i++) {\n            String str= Integer.toString(i*i,n);\n            if(check(str)) {\n                String num=Integer.toString(i,n);\n                System.out.println(num.toUpperCase() + \"" \"" + str.toUpperCase());\n            }\n        }\n    }\n}",ACCEPTED,986,11352
1310972952520097792,2e47392c98b789d288205dd61ea858df575c09a10732db5e6582d8ff8b64b68f,2020-09-30 00:01:23,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\nimport java.lang.StringBuilder;\n\nclass Main {\n\n    public static boolean check(String s) {\n        String rs = new StringBuilder(s).reverse().toString();\n        if (s.equals(rs)) return true;\n        else return false;\n    }\n\n    public static void main(String[] args) {\n        int N, S;\n        Scanner s=new Scanner(System.in);\n        N=s.nextInt();\n        S=s.nextInt();\n        int n = 0;\n        for (int j = S + 1; n < N;)\n        {\n            int sum = 0,i;\n            String temp;\n            for (i = 2; i <= 10 && sum < 2; i++)\n            {\n                temp = Integer.toString(i, j);\n                if (check(temp))\n                {\n                    sum+=1;\n                }\n            }\n            if (sum == 2)\n            {\n                n+=1;\n                if (n != 1)\n                    System.out.println();\n                System.out.println(j);\n            }\n            j+=1;\n        }\n//        Scanner s = new Scanner(System.in);\n//        int num, start,flag = 0;\n//        num = s.nextInt();\n//        start = s.nextInt();\n//        for (int i = start + 1; ; i++) {\n//            for (int j = 2; j <= 10; j++) {\n//                flag=0;\n//                String str = Integer.toString(i, j);\n//                if (check(str)) {\n//                    flag++;\n//                }\n//            }\n//            if(flag>=3) {\n//                System.out.println(i);\n//                num--;\n//            }\n//            if(num==0) System.exit(0);\n//        }\n    }\n}",MULTIPLE_ERROR,873,11280
1310973127196082176,2e47392c98b789d288205dd61ea858df575c09a10732db5e6582d8ff8b64b68f,2020-09-30 00:02:04,Java,10.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\nimport java.lang.StringBuilder;\n\nclass Main {\n\n    public static boolean check(String s) {\n        String rs = new StringBuilder(s).reverse().toString();\n        if (s.equals(rs)) return true;\n        else return false;\n    }\n\n    public static void main(String[] args) {\n        int N, S;\n        Scanner s=new Scanner(System.in);\n        N=s.nextInt();\n        S=s.nextInt();\n        int n = 0;\n        for (int j = S + 1; n < N;)\n        {\n            int sum = 0,i;\n            String temp;\n            for (i = 2; i <= 10 && sum < 2; i++)\n            {\n                temp = Integer.toString(i, j);\n                if (check(temp))\n                {\n                    sum+=1;\n                }\n            }\n            if (sum == 2)\n            {\n                n+=1;\n                if (n != 1)\n                    System.out.println();\n                System.out.print(j);\n            }\n            j+=1;\n        }\n//        Scanner s = new Scanner(System.in);\n//        int num, start,flag = 0;\n//        num = s.nextInt();\n//        start = s.nextInt();\n//        for (int i = start + 1; ; i++) {\n//            for (int j = 2; j <= 10; j++) {\n//                flag=0;\n//                String str = Integer.toString(i, j);\n//                if (check(str)) {\n//                    flag++;\n//                }\n//            }\n//            if(flag>=3) {\n//                System.out.println(i);\n//                num--;\n//            }\n//            if(num==0) System.exit(0);\n//        }\n    }\n}",PARTIAL_ACCEPTED,844,11256
1310975264907001856,5ad4dbb49340c80253114abf51ba25a8e80d6e95f9ba2cfaa3cbe70794d72ce0,2020-09-30 00:10:34,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tchar s1[] = new char[20];\n\t\tchar s2[] = new char[20];\n\t\t    int B,l2,l1;\n\t\t    Scanner input = new Scanner(System.in);\n\t\t    B=input.nextInt();\n\t\t    for(int i=0;i<=300;i++){\n\t\t        l2=0;\n\t\t        CHAR S2=conv(i*i,B,l2);\n\t\t        l2=S2.len;\n\t\t        s2=S2.s;\n\t\t        if(isHui(s2,l2)==1){\n\t\t            l1=0;\n\t\t            CHAR S1=conv(i,B,l1);\n\t\t            l1=S1.len;\n\t\t            s1=S1.s;            \n\t\t            for(int i1=S1.len-1;i1>=0;i1--){\n\t\t                if(i1==0) {\n\t\t                    System.out.print(s1[i1]);\n\t\t                    System.out.print(' ');\n\t\t                }\n\t\t                else\n\t\t                \tSystem.out.print(s1[i1]);\n\t\t            }\n\t\t            for(int i2=S2.len-1;i2>=0;i2--){\n\t\t                if(i2==0) {\n\t\t                \tSystem.out.print(s2[i2]);\n\t\t                \tSystem.out.print(' ');\n\t\t                }\n\t\t                else\n\t\t                \tSystem.out.print(s2[i2]);\n\t\t            }\n\t\t            System.out.println();\n\t\t        }\n\t\t    }\n\t}\n\tpublic static class CHAR{\n\t\t\tchar s[];\n\t\t\tint len;\n\t\t\tCHAR(char[] ss,int l){\n\t\t\t\ts=ss;\n\t\t\t\tlen=l;\n\t\t\t}\n\t}\n\tstatic CHAR conv(int a,int b,int len){\n\t    char s[]=new char[20];\n\t    int i=0;\n\t    while(a>0){\n\t    \t\n\t        if(a%b<10)\n\t            s[i]=(char) (a%b+'0');\n\t        else\n\t            s[i]=(char) (a%b+'A'-10);\n\t        \n\t        a=a/b;\n\t        len++;\n\t        i++;\n\t        \n\t    }\n\t    CHAR S =new CHAR(s,len);\n\t    \n\t    return S;\n\t}\n\tstatic int isHui(char a[],int n){\n\t    int flag=1;\n\t    for(int i=0;i<n/2;i++){\n\t        if(a[i]!=a[n-i-1]){\n\t            flag=0;\n\t            break;\n\t        }\n\t    }\n\t    return flag;\n\t}\n}",PRESENTATION_ERROR,1044,11316
1310975429608931328,5ad4dbb49340c80253114abf51ba25a8e80d6e95f9ba2cfaa3cbe70794d72ce0,2020-09-30 00:11:13,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tchar s1[] = new char[20];\n\t\tchar s2[] = new char[20];\n\t\t    int B,l2,l1;\n\t\t    Scanner input = new Scanner(System.in);\n\t\t    B=input.nextInt();\n\t\t    for(int i=1;i<=300;i++){\n\t\t        l2=0;\n\t\t        CHAR S2=conv(i*i,B,l2);\n\t\t        l2=S2.len;\n\t\t        s2=S2.s;\n\t\t        if(isHui(s2,l2)==1){\n\t\t            l1=0;\n\t\t            CHAR S1=conv(i,B,l1);\n\t\t            l1=S1.len;\n\t\t            s1=S1.s;            \n\t\t            for(int i1=S1.len-1;i1>=0;i1--){\n\t\t                if(i1==0) {\n\t\t                    System.out.print(s1[i1]);\n\t\t                    System.out.print(' ');\n\t\t                }\n\t\t                else\n\t\t                \tSystem.out.print(s1[i1]);\n\t\t            }\n\t\t            for(int i2=S2.len-1;i2>=0;i2--){\n\t\t                if(i2==0) {\n\t\t                \tSystem.out.print(s2[i2]);\n\t\t                \tSystem.out.print(' ');\n\t\t                }\n\t\t                else\n\t\t                \tSystem.out.print(s2[i2]);\n\t\t            }\n\t\t            System.out.println();\n\t\t        }\n\t\t    }\n\t}\n\tpublic static class CHAR{\n\t\t\tchar s[];\n\t\t\tint len;\n\t\t\tCHAR(char[] ss,int l){\n\t\t\t\ts=ss;\n\t\t\t\tlen=l;\n\t\t\t}\n\t}\n\tstatic CHAR conv(int a,int b,int len){\n\t    char s[]=new char[20];\n\t    int i=0;\n\t    while(a>0){\n\t    \t\n\t        if(a%b<10)\n\t            s[i]=(char) (a%b+'0');\n\t        else\n\t            s[i]=(char) (a%b+'A'-10);\n\t        \n\t        a=a/b;\n\t        len++;\n\t        i++;\n\t        \n\t    }\n\t    CHAR S =new CHAR(s,len);\n\t    \n\t    return S;\n\t}\n\tstatic int isHui(char a[],int n){\n\t    int flag=1;\n\t    for(int i=0;i<n/2;i++){\n\t        if(a[i]!=a[n-i-1]){\n\t            flag=0;\n\t            break;\n\t        }\n\t    }\n\t    return flag;\n\t}\n}",PRESENTATION_ERROR,1038,11412
1310975712938360832,5ad4dbb49340c80253114abf51ba25a8e80d6e95f9ba2cfaa3cbe70794d72ce0,2020-09-30 00:12:21,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tchar s1[] = new char[20];\n\t\tchar s2[] = new char[20];\n\t\t    int B,l2,l1;\n\t\t    Scanner input = new Scanner(System.in);\n\t\t    B=input.nextInt();\n\t\t    for(int i=1;i<=300;i++){\n\t\t        l2=0;\n\t\t        CHAR S2=conv(i*i,B,l2);\n\t\t        l2=S2.len;\n\t\t        s2=S2.s;\n\t\t        if(isHui(s2,l2)==1){\n\t\t            l1=0;\n\t\t            CHAR S1=conv(i,B,l1);\n\t\t            l1=S1.len;\n\t\t            s1=S1.s;            \n\t\t            for(int i1=S1.len-1;i1>=0;i1--){\n\t\t                if(i1==0) {\n\t\t                    System.out.print(s1[i1]);\n\t\t                    System.out.print(' ');\n\t\t                }\n\t\t                else\n\t\t                \tSystem.out.print(s1[i1]);\n\t\t            }\n\t\t            for(int i2=S2.len-1;i2>=0;i2--){\n\t\t                if(i2==0) {\n\t\t                \tSystem.out.println(s2[i2]);\n\t\t                }\n\t\t                else\n\t\t                \tSystem.out.print(s2[i2]);\n\t\t            }\n\t\t            \n\t\t        }\n\t\t    }\n\t}\n\tpublic static class CHAR{\n\t\t\tchar s[];\n\t\t\tint len;\n\t\t\tCHAR(char[] ss,int l){\n\t\t\t\ts=ss;\n\t\t\t\tlen=l;\n\t\t\t}\n\t}\n\tstatic CHAR conv(int a,int b,int len){\n\t    char s[]=new char[20];\n\t    int i=0;\n\t    while(a>0){\n\t    \t\n\t        if(a%b<10)\n\t            s[i]=(char) (a%b+'0');\n\t        else\n\t            s[i]=(char) (a%b+'A'-10);\n\t        \n\t        a=a/b;\n\t        len++;\n\t        i++;\n\t        \n\t    }\n\t    CHAR S =new CHAR(s,len);\n\t    \n\t    return S;\n\t}\n\tstatic int isHui(char a[],int n){\n\t    int flag=1;\n\t    for(int i=0;i<n/2;i++){\n\t        if(a[i]!=a[n-i-1]){\n\t            flag=0;\n\t            break;\n\t        }\n\t    }\n\t    return flag;\n\t}\n}",ACCEPTED,1289,11476
1310986663905394688,5ad4dbb49340c80253114abf51ba25a8e80d6e95f9ba2cfaa3cbe70794d72ce0,2020-09-30 00:55:52,Java,30.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t\n\t\t\n\t\t    int N,S,cnt=0,flag;\n\t\t    Scanner input=new Scanner(System.in);\n\t\t    N=input.nextInt();\n\t\t    S=input.nextInt();\n\t\t    while(true){\n\t\t        S++;\n\t\t        flag=0;\n\t\t        for(int i=2;i<=10;i++){\n\t\t            if(is_that(S,i)==1)\n\t\t                flag++;\n\t\t            if(flag==2){\n\t\t                cnt++;\n\t\t                System.out.println(S);\n\t\t                break;\n\t\t            }\n\t\t        }\n\t\t       if(cnt==N)\n\t\t           break;\n\t\t    }\n\t\t}\n\tstatic int is_that(int n,int B){\n\t    int flag=1,i=0;\n\t  int a[]= new int[100000];\n\t    while(n>0){\n\t        a[i++]=n%B;\n\t        n=n/B;\n\t    }\n\t    for(int j=0;j<i;j++){\n\t        if(a[j]!=a[i-j-1]){\n\t            flag=0;\n\t            break;\n\t        }\n\t    }\n\t    return flag;\n\t}\n}",PARTIAL_ACCEPTED,438,43284
1310986893732282368,5ad4dbb49340c80253114abf51ba25a8e80d6e95f9ba2cfaa3cbe70794d72ce0,2020-09-30 00:56:47,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t\n\t\t\n\t\t    int N,S,cnt=0,flag;\n\t\t    Scanner input=new Scanner(System.in);\n\t\t    N=input.nextInt();\n\t\t    S=input.nextInt();\n\t\t    while(true){\n\t\t        S++;\n\t\t        flag=0;\n\t\t        for(int i=2;i<=10;i++){\n\t\t            if(is_that(S,i)==1)\n\t\t                flag++;\n\t\t            if(flag==2){\n\t\t                cnt++;\n\t\t                System.out.println(S);\n\t\t                break;\n\t\t            }\n\t\t        }\n\t\t       if(cnt==N)\n\t\t           break;\n\t\t    }\n\t\t}\n    static int a[]= new int[100000];\n\tstatic int is_that(int n,int B){\n\t    int flag=1,i=0;\n\t    while(n>0){\n\t        a[i++]=n%B;\n\t        n=n/B;\n\t    }\n\t    for(int j=0;j<i;j++){\n\t        if(a[j]!=a[i-j-1]){\n\t            flag=0;\n\t            break;\n\t        }\n\t    }\n\t    return flag;\n\t}\n}",ACCEPTED,842,11712
1311261455145435136,2506d5801ac56b957e1c7a7608991bb956321549d59508d48faca2aea9c9d42a,2020-09-30 19:07:47,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"\n\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tint n;\n\t\tScanner scan = new Scanner(System.in);\n\t\tn = scan.nextInt();\n\t\tfor (int k = 1; k <= 300; k++) {\n\t\t\tint i = k;\n\t\t\tint temp = 0;\n\t\t\tint temp2 = 0;\n\t\t\tint[] test = new int[500];\n\t\t\tint[] test2 = new int[500];\n\t\t\tint square = i * i;\n\n\t\t\twhile (i != 0) {\n\t\t\t\ttemp2++;\n\t\t\t\ttest2[temp2] = i % n;\n\t\t\t\ti = i / n;\n\t\t\t}\n\n\t\t\twhile (square != 0) {\n\t\t\t\ttemp++;\n\t\t\t\ttest[temp] = square % n;\n\t\t\t\tsquare = square / n;\n\t\t\t}\n\n\t\t\tboolean pdf = true;\n\n\t\t\t// 判断回文数\n\t\t\tfor (int j = 1; j <= temp; j++) {\n\t\t\t\tif (test[j] != test[temp - j + 1])\n\t\t\t\t\tpdf = false;\n\t\t\t}\n\n\t\t\tif (pdf) {\n\t\t\t\tfor (int j = temp2; j >= 1; j--) {\n\t\t\t\t\tif (test2[j] >= 10) {\n\t\t\t\t\t\tint ch = test2[j] + 55;\n\t\t\t\t\t\tSystem.out.print((char) ch); // notation\n\t\t\t\t\t}\n\n\t\t\t\t\telse\n\t\t\t\t\t\tSystem.out.print(test2[j]);\n\t\t\t\t}\n\n\t\t\t\tSystem.out.print(\"" \"");\n\n\t\t\t\tfor (int j = 1; j <= temp; j++) {\n\t\t\t\t\tif (test[j] >= 10) {\n\t\t\t\t\t\tint ch = test[j] + 55;\n\t\t\t\t\t\tSystem.out.print((char) ch);\n\t\t\t\t\t}\n\n\t\t\t\t\telse\n\t\t\t\t\t\tSystem.out.print(test[j]);\n\n\t\t\t\t}\n\n\t\t\t\tSystem.out.println();\n\t\t\t}\n\t\t}\n\t}\n\n}\n",ACCEPTED,1020,12556
1311268295530971136,2506d5801ac56b957e1c7a7608991bb956321549d59508d48faca2aea9c9d42a,2020-09-30 19:34:58,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"\n\nimport java.util.Scanner;\nimport java.util.Vector;\n\npublic class Main {\n\tstatic boolean work(Integer x, Integer y) {\n\t\tInteger temp = 0;\n\t\tInteger[] test = new Integer[1000];\n\n\t\twhile (x != 0) {\n\t\t\ttemp++;\n\t\t\ttest[temp] = x % y;\n\t\t\tx = x / y;\n\t\t}\n\n\t\tboolean flag = true;\n\n\t\tfor (int j = 1; j <= temp; j++) {\n\t\t\tif (test[j] != test[temp - j + 1])\n\t\t\t\tflag = false;\n\t\t}\n\n\t\treturn flag;\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tVector<Integer> vec = new Vector<Integer>();\n\t\tint N, S;\n\t\tScanner scan = new Scanner(System.in);\n\t\tN = scan.nextInt();\n\t\tS = scan.nextInt();\n\t\tInteger num = S + 1;\n\t\tInteger count = 0;\n\n\t\twhile (count < N) {\n\t\t\tint ok = 0;\n\t\t\tfor (int i = 2; i <= 10; i++) {\n\t\t\t\tif (work(num, i))\n\t\t\t\t\tok++;\n\t\t\t}\n\n\t\t\tif (ok >= 2) {\n\t\t\t\tcount++;\n\t\t\t\tvec.add(num);\n\n\t\t\t}\n\n\t\t\tnum++;\n\t\t}\n\n\t\tfor (int i = 0; i < N - 1; i++)\n\t\t\tSystem.out.println(vec.get(i));\n\t\tSystem.out.print(vec.get(N - 1));\n\n\t}\n\n}\n",ACCEPTED,1045,45012
1311474354145132544,2e47392c98b789d288205dd61ea858df575c09a10732db5e6582d8ff8b64b68f,2020-10-01 09:13:46,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"\nimport java.util.Scanner;\n        import java.lang.StringBuilder;\n\nclass Main {\n\n    public static boolean check(String s) {\n        String rs = new StringBuilder(s).reverse().toString();\n        if (s.equals(rs)) return true;\n        else return false;\n    }\n\n    public static void main(String[] args) {\n        int N, S;\n        Scanner s=new Scanner(System.in);\n        N=s.nextInt();\n        S=s.nextInt();\n        int n = 0;\n        int j = S + 1;\n\n        while (true)\n        {\n            int sum = 0,i;\n            String temp;\n            for (i = 2; i <= 10 && sum < 2; i++)\n            {\n                temp = Integer.toString(j, i);\n                if (check(temp))\n                {\n                    sum+=1;\n                }\n            }\n            if (sum == 2)\n            {\n                n+=1;\n                if (n != 1)\n                    System.out.println();\n                System.out.print(j);\n            }\n            j+=1;\n            if(n==N) break;\n        }\n\n    }\n}",ACCEPTED,918,18760
1311510989893206016,4a56193e4e3aef88687c4b59a91d8be77df2f76f9682cde0c0a70959b66497ce,2020-10-01 11:39:21,Java,50.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n    public static String reverse1(String str) {\n        return new StringBuilder(str).reverse().toString();\n    }\n    static boolean test(String st) {\n        int n = st.length();\n        if (n == 1)\n        {\n            return true;\n        }\n        int i = 0, j = n - 1;\n        for (; i < j; i++, j--) {\n            if (st.charAt(i)!=st.charAt(j))\n            {\n                return false;\n            }\n        }\n        return true;\n    }\n    public static void main(String[] args) {\n        int n;\n        Scanner sc = new Scanner(System.in);\n        n = sc.nextInt();\n        boolean k;\n        String temp;\n        int qqq;\n        String out;\n        for (int j = 1; j <= 300; j++)\n        {\n            qqq = j * j;\n            temp = Integer.toString(qqq,n);\n            if (test(temp))\n            {\n                out = Integer.toString(j,n);\n                System.out.println(out+\"" \""+temp);\n            }\n        }\n    }\n}",PARTIAL_ACCEPTED,972,12124
1311511817848815616,4a56193e4e3aef88687c4b59a91d8be77df2f76f9682cde0c0a70959b66497ce,2020-10-01 11:42:38,Java,50.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n    public static String reverse1(String str) {\n        return new StringBuilder(str).reverse().toString();\n    }\n    static boolean test(String st) {\n        int n = st.length();\n        if (n == 1)\n        {\n            return true;\n        }\n        int i = 0, j = n - 1;\n        for (; i < j; i++, j--) {\n            if (st.charAt(i)!=st.charAt(j))\n            {\n                return false;\n            }\n        }\n        return true;\n    }\n    public static void main(String[] args) {\n        int n;\n        Scanner sc = new Scanner(System.in);\n        n = sc.nextInt();\n        boolean k;\n        String temp;\n        int qqq;\n        String out;\n        for (int j = 1; j <= 300; j++)\n        {\n            qqq = j * j;\n            temp = Integer.toString(qqq,n);\n            temp = temp.toUpperCase();\n            if (test(temp))\n            {\n                out = Integer.toString(j,n);\n                System.out.println(out+\"" \""+temp);\n            }\n        }\n    }\n}\n",PARTIAL_ACCEPTED,955,11380
1311514599507034112,4a56193e4e3aef88687c4b59a91d8be77df2f76f9682cde0c0a70959b66497ce,2020-10-01 11:53:41,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n    static boolean test(String st) {\n        int n = st.length();\n        if (n == 1)\n        {\n            return true;\n        }\n        int i = 0, j = n - 1;\n        for (; i < j; i++, j--) {\n            if (st.charAt(i)!=st.charAt(j))\n            {\n                return false;\n            }\n        }\n        return true;\n    }\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int n,s;\n        n = sc.nextInt();\n        s = sc.nextInt();\n        String temp;\n        s++;\n        int count = 0;\n        int ans = 0;\n        while(ans<n)\n        {\n            count = 0;\n            for (int i = 2; i <= 10; i++)\n            {\n                temp = Integer.toString(s, i);\n                if (test(temp))\n                {\n                    count++;\n                }\n                if(count>=2)\n                {\n                    ans++;\n                    System.out.println(s);\n                    break;\n                }\n            }\n            s++;\n        }\n    }\n}\n",ACCEPTED,907,16372
1311579522660499456,a6bcff8eac6626683b54ea6532d742253cc5e1930dc16d624f22dfcea8f7c923,2020-10-01 16:11:40,Java,50.0,1306870976110592007,1267442030214471680,1049226397448056832,"\nimport java.util.Map;\nimport java.util.Scanner;\nimport java.util.Vector;\n\n\npublic class Main {\n\tstatic int b,i,k;\n\tstatic int arr[]=new int[301];\n\tpublic static void main(String[] args) {\n\t\tScanner in=new Scanner(System.in);\n\t\tb=in.nextInt();\n\t\tfor(i=1;i<=300;i++){\n\t        if(f1(i*i)!=0){\n\t            f2(i);\n\t            System.out.print(\"" \"");\n\t            for (int j=1;j<=k;j++){\n\t            \tif(arr[j]<10){\n\t            \t\tSystem.out.print(arr[j]);\n\t\t\t\t\t}\n\t            \telse{\n\t            \t\tSystem.out.print(arr[j]+55);\n\t\t\t\t\t}\n\t\t\t\t}\n\t            System.out.println();\n\t\t\t}\n\t    }\n\t}\n\tpublic static int f1(int num) {\n\t\tint s=num;\n\t\tint i=0;\n\t\twhile(s!=0){\n\t        i++;\n\t        arr[i]=s%b;\n\t        s=s/b;\n\t    }\n\t\tk=i;\n\t\tfor(int j=1;j<=i/2+1;j++){\n\t    \tif(arr[j]!=arr[i-j+1]) \n\t\t\t\treturn 0;\n\t\t}\n\t\treturn 1;\n\t}\n\tpublic static void f2(int num) {\n\t\tif(num==0) {\n\t    \treturn;\n\t\t}\n\t    f2(num/b);\n\t    if(num%b<10) {\n\t    \tSystem.out.print(num%b);\n\t\t}\n\t    else {\n\t    \tSystem.out.print(num%b+55);\n\t\t}\n\t}\n}\n",PARTIAL_ACCEPTED,970,11264
1311864966061162496,a6bcff8eac6626683b54ea6532d742253cc5e1930dc16d624f22dfcea8f7c923,2020-10-02 11:05:55,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"\nimport java.util.Scanner;\n\npublic class Main {\n\tstatic int n;\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner in=new Scanner(System.in);\n\t\tn=in.nextInt();\n\t\tint j=0;\n\t\tfor(int x=1;x<=300;x++) {\n\t\t\tj=x;\n\t\t\tString s1=intToA(j,n);\n\t\t\tString s2=intToA(j*j,n);\n\t\t\tif(Palin_num(s2)) {\n\t\t\t\tSystem.out.println(s1+\"" \""+s2);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t}\n\t}\n\tpublic static boolean Palin_num(String a) {\n\t\tint length=a.length();\n\t\tint flag=1;\n\t\tfor(int i=0;i<=length/2;i++) {\n\t\t\tif(a.charAt(i)!=a.charAt(length-i-1)) {\n\t\t\t\tflag=0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(flag==1) {\n\t\t\treturn true;\n\t\t}\n\t\telse {\n\t\t\treturn false;\n\t\t}\n\t}\n\tpublic static String intToA(int n,int radix) {\n\t\tString ans=\""\"";\n\t\tdo {\n\t\t\tint t=n%radix;\n\t\t\tif(t>=0 && t<=9) {\n\t\t\t\tans+=t+'0';\n\t\t\t}\n\t\t\telse {\n\t\t\t\tans+=t-10+'A';\n\t\t\t}\n\t\t\tn/=radix;\n\t\t}while(n!=0);\n\t\tString h=\""\"";\n\t\tfor(int i=ans.length()-1;i>=0;i--){\n\t\t\th+=ans.charAt(i);\n\t\t}\n\t\treturn h;\n\t}\n}\n",WRONG_ANSWER,1078,14540
1311869487982247936,a6bcff8eac6626683b54ea6532d742253cc5e1930dc16d624f22dfcea8f7c923,2020-10-02 11:23:53,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"\nimport java.util.Scanner;\n\npublic class Main {\n\tstatic int B;\n\tstatic int a[]=new int [20];\n\tpublic static void main(String[] args) {\n\t\tScanner in=new Scanner(System.in);\n\t\tB=in.nextInt();\n\t\tfor(int i=1;i<=300;i++) {\n\t\t\tif(calc(i)) {\n\t\t\t\touts(i);\n\t\t\t\tSystem.out.print(\"" \"");\n\t\t\t\touts(i*i);\n\t\t\t\tSystem.out.println();\n\t\t\t}\n\t\t}\n\t}\n\tpublic static void outs(int x) {\n\t\tint np=0;\n\t    while(x!=0)\n\t    {\n\t        a[++np]=x%B;\n\t        x/=B;\n\t    }\n\t    for(int i=np;i>=1;i--)\n\t    {\n\t        if(a[i]>9) {\n\t        \tint y=a[i]-10+65;\n\t        \tchar a=(char) y;\n\t        \tSystem.out.print(a);\n\t        }\n\t        else {\n\t        \tSystem.out.print(a[i]);\n\t        }\n\t    }\n\t}\n\tpublic static boolean calc(int x)//不存在0我就懒得考虑了 \n\t{\n\t    int np=0;\n\t    x=x*x;\n\t    while(x!=0)\n\t    {\n\t        a[++np]=x%B;\n\t        x/=B;\n\t    }\n\t    for(int i=1,j=np;i<j;i++,j--)\n\t        if(a[i]!=a[j])\n\t            return false;\n\t    return true;\n\t}\n}\n",ACCEPTED,986,11360
1311870802854608896,a6bcff8eac6626683b54ea6532d742253cc5e1930dc16d624f22dfcea8f7c923,2020-10-02 11:29:07,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"\nimport java.util.Scanner;\nimport java.util.Vector;\n\npublic class Main {\n\tstatic int N,S,i,k;\n\tstatic int arr[]=new int [301];\n\tstatic Vector<Integer> v=new Vector<Integer>();\n\tpublic static void main(String[] args) {\n\t\tScanner in=new Scanner(System.in);\n\t\tN=in.nextInt();\n\t\tS=in.nextInt();\n\t\tint flag=0;\n\t    for(int u=S+1;flag<N;u++){\n\t    \tint ff=0;\n\t    \tfor(int oo=2;oo<11;oo++){\n\t    \t\tif(f1(u,oo)!=0){\n\t    \t\t\tff++;\n\t\t\t\t}\n\t\t\t\tif(ff==2){\n\t\t\t\t\tflag++;\n\t\t\t\t\tv.add(u);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(int i=0;i<v.size();i++){\n\t\t\tSystem.out.println(v.get(i));\n\t\t}\n\t}\n\t\n\tpublic static int f1(int num,int b)//不存在0我就懒得考虑了 \n\t{\n\t\tint s=num;\n\t    int i=0;\n\t    while(s!=0){\n\t        i++;\n\t        arr[i]=s%b;\n\t        s=s/b;\n\t    }\n\t    k=i;\n\t    for(int j=1;j<=i/2+1;j++){\n\t    \tif(arr[j]!=arr[i-j+1]) \n\t\t\t\treturn 0;\n\t\t}\n\t    return 1;\n\t}\n}\n",ACCEPTED,928,11404
1311955213289717760,299338d5ab323b9a652bcf61b728fe1bf6dc2331e8b6c1af6ef92ea19022f137,2020-10-02 17:04:32,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\n\npublic class Main{\n\tpublic int BASE;\n\tstatic char B[]=new char[]{'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\n\tpublic static int isPalindrome(char[]s,int len)\n\t{\n\t \n\t    for(int i=0,j=len-1;i<=j;i++,j--)\n\t    {\n\t        if(s[i]!=s[j])return 0;\n\t    }\n\t    if(len>0)return 1;\n\t    else return 0;\n\t}\n\tpublic static void getp(char[] s,int num,int b)\n\t{\n\t    int index=0;\n\t    while(num/b!=0)\n\t    {\n\t        s[index++]=B[num%b];\n\t        num=num/b;\n\t    }\n\t    s[index++]=B[num%b];;\n\t    s[index]='\\0';\n\t}\n\tpublic static void main(String[] args) {\n\t\t\t\n\t\t\tScanner sc=new Scanner(System.in);\n\t\t    int BASE=sc.nextInt();\n\t\t    char[]s=new char[20];\n\t\t    char[]t=new char[20];\n\t\t    for(int i=1;i<=300;++i)\n\t\t    {\n\t\t        getp(s,i*i,BASE);\n\t\t        int j=0;\n\t\t        for(int k=0;s[k]!='\\0';k++)  j++;\n\t\t        if(isPalindrome(s , j)==1)\n\t\t        {\n\t\t            getp(t,i,BASE);\n\t\t            int l=0;\n\t\t            for(int k=0;t[k]!='\\0';k++)  l++;\n\t\t            for(int w=0;w<l/2;++w)\n\t\t            {\n\t\t                char tmp=t[w];\n\t\t                t[w]=t[l-w-1];\n\t\t                t[l-w-1]=tmp;\n\t\t            }\n\t\t \n\t\t            System.out.println(t+\"" \""+s);\n\t\t        }\n\t\t    }\n\t\t \n\t\t    return;\n\t}",COMPILE_ERROR,0,0
1311955468328566784,299338d5ab323b9a652bcf61b728fe1bf6dc2331e8b6c1af6ef92ea19022f137,2020-10-02 17:05:33,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\n\npublic class Main{\n\tpublic static int BASE;\n\tstatic char B[]=new char[]{'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\n\tpublic static int isPalindrome(char[]s,int len)\n\t{\n\t \n\t    for(int i=0,j=len-1;i<=j;i++,j--)\n\t    {\n\t        if(s[i]!=s[j])return 0;\n\t    }\n\t    if(len>0)return 1;\n\t    else return 0;\n\t}\n\tpublic static void getp(char[] s,int num,int b)\n\t{\n\t    int index=0;\n\t    while(num/b!=0)\n\t    {\n\t        s[index++]=B[num%b];\n\t        num=num/b;\n\t    }\n\t    s[index++]=B[num%b];;\n\t    s[index]='\\0';\n\t}\n\tpublic static void main(String[] args) {\n\t\t\t\n\t\t\tScanner sc=new Scanner(System.in);\n\t\t    int BASE=sc.nextInt();\n\t\t    char[]s=new char[20];\n\t\t    char[]t=new char[20];\n\t\t    for(int i=1;i<=300;++i)\n\t\t    {\n\t\t        getp(s,i*i,BASE);\n\t\t        int j=0;\n\t\t        for(int k=0;s[k]!='\\0';k++)  j++;\n\t\t        if(isPalindrome(s , j)==1)\n\t\t        {\n\t\t            getp(t,i,BASE);\n\t\t            int l=0;\n\t\t            for(int k=0;t[k]!='\\0';k++)  l++;\n\t\t            for(int w=0;w<l/2;++w)\n\t\t            {\n\t\t                char tmp=t[w];\n\t\t                t[w]=t[l-w-1];\n\t\t                t[l-w-1]=tmp;\n\t\t            }\n\t\t \n\t\t            System.out.println(t+\"" \""+s);\n\t\t        }\n\t\t    }\n\t\t \n\t}\n}",WRONG_ANSWER,953,11244
1311959266077900800,299338d5ab323b9a652bcf61b728fe1bf6dc2331e8b6c1af6ef92ea19022f137,2020-10-02 17:20:38,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\tstatic int i,j,k,n,pp;\n\tstatic int[] m=new int[310];\n\tstatic int[] m1=new int[310];\n\tstatic int[][] a0=new int[310][10];\n\tstatic int[] a=new int[310];\n\tstatic int[] ak=new int[310];\n\tstatic int[][] a1=new int[310][10];\n\tstatic int[] o=new int[310];\n\tstatic char hb;\n\tpublic static void main(String[] args) \n\t{\n\t\tScanner sc=new Scanner(System.in);\n\t\tn=sc.nextInt();\n\t\tfor(i=1;i<=300;i++)\n\t\t{\n\t\t\ta[i]=i;\n\t\t\tak[i]=i*i;\n\t\t}\n\t\tfor(j=1;j<=300;j++)\n\t\t{\n\t\t\twhile(ak[j]>=1)\n\t\t\t{\n\t\t\t\tm[j]++;\n\t\t\t\ta0[j][m[j]]=ak[j]%n;\n\t\t\t\tak[j]/=n;\n\t\t\t}\n\t\t}\n\n\t\tfor(j=1;j<=300;j++)\n\t\t{\n\t\t\twhile(a[j]>=1)\n\t\t\t{\n\t\t\t\tm1[j]++;\n\n\t\t\t\ta1[j][m1[j]]=a[j]%n;\n\n\t\t\t\ta[j]=a[j]/n;\n\t\t\t}\n\t\t}\n\t\t\n\t\tfor(i=1;i<=300;i++)\n\t\t{\n\t\t\tpp=0;\n\t\t\tfor(j=1;j<=m[i];j++)\n\t\t\t{\n\t\t\t\tif(a0[i][j]!=a0[i][m[i]-j+1])\n\t\t\t\t{pp=1;break;}\n\t\t\t}\n\t\t\tif(pp==0) o[i]=1;\n\t\t}\n\t\t\n\t\tfor(i=1;i<=300;i++)\n\t\t{\n\t\t\tif(o[i]==1)\n\t\t\t{\n\t\t\tif(n<=10)\n\t\t\t{\n\t\t\t\tfor(j=m1[i];j>=1;j--)\n\t\t\t\tSystem.out.print(a1[i][j]);\n\t\t\t\tSystem.out.println();\n\t\t\t\tfor(j=m[i];j>=1;j--)\n\t\t\t\tSystem.out.print(a0[i][j]);\n\t\t\t\tSystem.out.println();\n\t\t\t}\n\n\t\t\telse\n\t\t\t{\n\t\t\t\tfor(j=m1[i];j>=1;j--)\n\t\t\t\t{\n\t\t\t\t\tif(a1[i][j]<10)\n\t\t\t\t\tSystem.out.print(a1[i][j]);\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\thb=(char)(a1[i][j]-10+'A');\n\t\t\t\t\t\tSystem.out.print(hb);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tSystem.out.println();\n\n\t\t\t\tfor(j=m[i];j>=1;j--)\n\t\t\t\t{\n\t\t\t\t\tif(a0[i][j]<10)\n\t\t\t\t\tSystem.out.print(a0[i][j]);\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\thb=(char)(a0[i][j]-10+'A');\n\t\t\t\t\t\tSystem.out.print(hb);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tSystem.out.println();\n\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn;\n\t}\n}\n",MULTIPLE_ERROR,956,11228
1311960045278920704,299338d5ab323b9a652bcf61b728fe1bf6dc2331e8b6c1af6ef92ea19022f137,2020-10-02 17:23:44,Java,60.0,1306870976110592007,1267442030214471680,1049226397448056832,"\n\nimport java.util.Scanner;\n\npublic class Main {\n\tstatic int i,j,k,n,pp;\n\tstatic int[] m=new int[310];\n\tstatic int[] m1=new int[310];\n\tstatic int[][] a0=new int[310][10];\n\tstatic int[] a=new int[310];\n\tstatic int[] ak=new int[310];\n\tstatic int[][] a1=new int[310][10];\n\tstatic int[] o=new int[310];\n\tstatic char hb;\n\tpublic static void main(String[] args) \n\t{\n\t\tScanner sc=new Scanner(System.in);\n\t\tn=sc.nextInt();\n\t\tfor(i=1;i<=300;i++)\n\t\t{\n\t\t\ta[i]=i;\n\t\t\tak[i]=i*i;\n\t\t}\n\t\tfor(j=1;j<=300;j++)\n\t\t{\n\t\t\twhile(ak[j]>=1)\n\t\t\t{\n\t\t\t\tm[j]++;\n\t\t\t\ta0[j][m[j]]=ak[j]%n;\n\t\t\t\tak[j]/=n;\n\t\t\t}\n\t\t}\n\n\t\tfor(j=1;j<=300;j++)\n\t\t{\n\t\t\twhile(a[j]>=1)\n\t\t\t{\n\t\t\t\tm1[j]++;\n\n\t\t\t\ta1[j][m1[j]]=a[j]%n;\n\n\t\t\t\ta[j]=a[j]/n;\n\t\t\t}\n\t\t}\n\t\t\n\t\tfor(i=1;i<=300;i++)\n\t\t{\n\t\t\tpp=0;\n\t\t\tfor(j=1;j<=m[i];j++)\n\t\t\t{\n\t\t\t\tif(a0[i][j]!=a0[i][m[i]-j+1])\n\t\t\t\t{pp=1;break;}\n\t\t\t}\n\t\t\tif(pp==0) o[i]=1;\n\t\t}\n\t\t\n\t\tfor(i=1;i<=300;i++)\n\t\t{\n\t\t\tif(o[i]==1)\n\t\t\t{\n\t\t\tif(n<=10)\n\t\t\t{\n\t\t\t\tfor(j=m1[i];j>=1;j--)\n\t\t\t\tSystem.out.print(a1[i][j]);\n\t\t\t\tSystem.out.print(\"" \"");\n\t\t\t\tfor(j=m[i];j>=1;j--)\n\t\t\t\tSystem.out.print(a0[i][j]);\n\t\t\t\tSystem.out.println();\n\t\t\t}\n\n\t\t\telse\n\t\t\t{\n\t\t\t\tfor(j=m1[i];j>=1;j--)\n\t\t\t\t{\n\t\t\t\t\tif(a1[i][j]<10)\n\t\t\t\t\tSystem.out.print(a1[i][j]);\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\thb=(char)(a1[i][j]-10+'A');\n\t\t\t\t\t\tSystem.out.print(hb);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tSystem.out.print(\"" \"");\n\n\t\t\t\tfor(j=m[i];j>=1;j--)\n\t\t\t\t{\n\t\t\t\t\tif(a0[i][j]<10)\n\t\t\t\t\tSystem.out.print(a0[i][j]);\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\thb=(char)(a0[i][j]-10+'A');\n\t\t\t\t\t\tSystem.out.print(hb);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tSystem.out.println();\n\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn;\n\t}\n}\n",PARTIAL_ACCEPTED,970,12016
1311960408929271808,299338d5ab323b9a652bcf61b728fe1bf6dc2331e8b6c1af6ef92ea19022f137,2020-10-02 17:25:11,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"\nimport java.util.*;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner cin = new Scanner(System.in);\n\t\tint T = cin.nextInt();\n\t\tprint(T);\n\t}\n \n\tprivate static void print(int t) {\n\t\tfor(int i = 1;i <= 300;++ i){\n\t\t\tint s = i * i;\n\t\t\tStringBuffer num = new StringBuffer();\n\t\t\tStringBuffer square = new StringBuffer();\n\t\t\tnum = convert(i,t);\n\t\t\tsquare = convert(s,t);\n\t\t\t//System.out.print(square);\n\t\t\tif(ispalindrom(square)){\n\t\t\t\tSystem.out.println(num.reverse()+\"" \""+square);\n\t\t\t}\n\t\t}\n\t}\n\tprivate static StringBuffer convert(int s, int t) {\n\t\tStringBuffer rtnval = new StringBuffer();\n\t\tint digit;\n\t\twhile(s > 0){\n\t\t\tdigit = s % t;\n\t\t\tif(digit >= 10){\n\t\t\t\trtnval.append((char)('A'+digit - 10));\n\t\t\t}else{\n\t\t\t\trtnval.append(digit);\n\t\t\t}\n\t\t\ts /= t;\n\t\t}\n\t\treturn rtnval;\n\t}\n\tprivate static boolean ispalindrom(StringBuffer bf) {\n\t\tString s = new String(bf);\n\t\tchar sch[] = s.toCharArray();\n\t\tint len = sch.length;\n\t\t//System.out.println(\"" \""+len);\n\t\tfor(int i = 0;i < len / 2;++ i){\n\t\t\tif(sch[i] != sch[len - i - 1]){\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n}",ACCEPTED,1029,13096
1311961627886288896,299338d5ab323b9a652bcf61b728fe1bf6dc2331e8b6c1af6ef92ea19022f137,2020-10-02 17:30:01,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,package com.zhangbo.www;\n\nimport java.util.Scanner;\n\npublic class Main {\n\tstatic int sum;\n\tstatic int[] a=new int[100];\n\tstatic int k;\n\tstatic int basecnt;\n\tstatic int jin;\n\tstatic void change(int n)\n\t{\n\t\tbasecnt=0;\n\t\twhile(n!=0){\n\t\t\ta[basecnt]=n%jin;\n\t\t\tn/=jin;\n\t\t\tbasecnt++;\n\t\t}\n\t\treturn ;\n\t}\n\tpublic static void main(String[] args) \n\t\t\n\t{\n\t\tint n;\n\t\tScanner sc=new Scanner(System.in);\n\t\tsum=sc.nextInt();\n\t\tn=sc.nextInt();\n\t\tint tmp;\n\t\tboolean tf=false;\n\t\tint cnt=0;\n\t\tint cnt2=n+1;\n\t\t\twhile(cnt<sum){\n\t\t\t\tint cnt3=0;\n\t\t\t\tfor(int i=2;i<=10;i++){\t\t\n\t\t\t\t\tjin=i;\n\t\t\t\t\tchange(cnt2);\n\t\t\t\t\ttf=false;\n\t\t\t\t\tfor(int j=0;j<basecnt;j++){\n\t\t\t\t\t\tif(a[j]!=a[basecnt-1-j]){\n\t\t\t\t\t\t\ttf=true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\t\t\n\t\t\t\tif(tf==false){\n\t\t\t\t\tif(cnt3==1){\n\t\t\t\t\tSystem.out.println(cnt2);\n\t\t\t\t\tcnt++;\n\t\t\t\t\tbreak;\t\n\t\t\t\t\t}else{\n\t\t\t\t\t\tcnt3++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tcnt2++;\n\t\t}\n\t\treturn;\n}\n,COMPILE_ERROR,0,0
1311961674568892416,299338d5ab323b9a652bcf61b728fe1bf6dc2331e8b6c1af6ef92ea19022f137,2020-10-02 17:30:12,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,import java.util.Scanner;\n\npublic class Main {\n\tstatic int sum;\n\tstatic int[] a=new int[100];\n\tstatic int k;\n\tstatic int basecnt;\n\tstatic int jin;\n\tstatic void change(int n)\n\t{\n\t\tbasecnt=0;\n\t\twhile(n!=0){\n\t\t\ta[basecnt]=n%jin;\n\t\t\tn/=jin;\n\t\t\tbasecnt++;\n\t\t}\n\t\treturn ;\n\t}\n\tpublic static void main(String[] args) \n\t\t\n\t{\n\t\tint n;\n\t\tScanner sc=new Scanner(System.in);\n\t\tsum=sc.nextInt();\n\t\tn=sc.nextInt();\n\t\tint tmp;\n\t\tboolean tf=false;\n\t\tint cnt=0;\n\t\tint cnt2=n+1;\n\t\t\twhile(cnt<sum){\n\t\t\t\tint cnt3=0;\n\t\t\t\tfor(int i=2;i<=10;i++){\t\t\n\t\t\t\t\tjin=i;\n\t\t\t\t\tchange(cnt2);\n\t\t\t\t\ttf=false;\n\t\t\t\t\tfor(int j=0;j<basecnt;j++){\n\t\t\t\t\t\tif(a[j]!=a[basecnt-1-j]){\n\t\t\t\t\t\t\ttf=true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\t\t\n\t\t\t\tif(tf==false){\n\t\t\t\t\tif(cnt3==1){\n\t\t\t\t\tSystem.out.println(cnt2);\n\t\t\t\t\tcnt++;\n\t\t\t\t\tbreak;\t\n\t\t\t\t\t}else{\n\t\t\t\t\t\tcnt3++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tcnt2++;\n\t\t}\n\t\treturn;\n}\n,COMPILE_ERROR,0,0
1311961858250047488,299338d5ab323b9a652bcf61b728fe1bf6dc2331e8b6c1af6ef92ea19022f137,2020-10-02 17:30:56,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,package com.zhangbo.www;\n\nimport java.util.Scanner;\n\npublic class Main {\n\tstatic int sum;\n\tstatic int[] a=new int[100];\n\tstatic int k;\n\tstatic int basecnt;\n\tstatic int jin;\n\tstatic void change(int n)\n\t{\n\t\tbasecnt=0;\n\t\twhile(n!=0){\n\t\t\ta[basecnt]=n%jin;\n\t\t\tn/=jin;\n\t\t\tbasecnt++;\n\t\t}\n\t\treturn ;\n\t}\n\tpublic static void main(String[] args) \n\t\t\n\t{\n\t\tint n;\n\t\tScanner sc=new Scanner(System.in);\n\t\tsum=sc.nextInt();\n\t\tn=sc.nextInt();\n\t\tint tmp;\n\t\tboolean tf=false;\n\t\tint cnt=0;\n\t\tint cnt2=n+1;\n\t\t\twhile(cnt<sum){\n\t\t\t\tint cnt3=0;\n\t\t\t\tfor(int i=2;i<=10;i++){\t\t\n\t\t\t\t\tjin=i;\n\t\t\t\t\tchange(cnt2);\n\t\t\t\t\ttf=false;\n\t\t\t\t\tfor(int j=0;j<basecnt;j++){\n\t\t\t\t\t\tif(a[j]!=a[basecnt-1-j]){\n\t\t\t\t\t\t\ttf=true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\t\t\n\t\t\t\tif(tf==false){\n\t\t\t\t\tif(cnt3==1){\n\t\t\t\t\tSystem.out.println(cnt2);\n\t\t\t\t\tcnt++;\n\t\t\t\t\tbreak;\t\n\t\t\t\t\t}else{\n\t\t\t\t\t\tcnt3++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tcnt2++;\n\t\t}\n\t\treturn;\n}\n}\n,WRONG_ANSWER,670,10256
1311963225609928704,299338d5ab323b9a652bcf61b728fe1bf6dc2331e8b6c1af6ef92ea19022f137,2020-10-02 17:36:22,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,import java.util.Scanner;\n\npublic class Main {\n\tstatic int sum;\n\tstatic int[] a=new int[100];\n\tstatic int k;\n\tstatic int basecnt;\n\tstatic int jin;\n\tstatic void change(int n)\n\t{\n\t\tbasecnt=0;\n\t\twhile(n!=0){\n\t\t\ta[basecnt]=n%jin;\n\t\t\tn/=jin;\n\t\t\tbasecnt++;\n\t\t}\n\t\treturn ;\n\t}\n\tpublic static void main(String[] args) \n\t\t\n\t{\n\t\tint n;\n\t\tScanner sc=new Scanner(System.in);\n\t\tsum=sc.nextInt();\n\t\tn=sc.nextInt();\n\t\tint tmp;\n\t\tboolean tf=false;\n\t\tint cnt=0;\n\t\tint cnt2=n+1;\n\t\t\twhile(cnt<sum){\n\t\t\t\tint cnt3=0;\n\t\t\t\tfor(int i=2;i<=10;i++){\t\n\t\t\t\t\tfor(int j=0;j<a.length;j++)a[j]=0;\n\t\t\t\t\tjin=i;\n\t\t\t\t\tchange(cnt2);\n\t\t\t\t\ttf=false;\n\t\t\t\t\tfor(int j=0;j<basecnt;j++){\n\t\t\t\t\t\tif(a[j]!=a[basecnt-1-j]){\n\t\t\t\t\t\t\ttf=true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\t\t\n\t\t\t\tif(tf==false){\n\t\t\t\t\tif(cnt3==1){\n\t\t\t\t\tSystem.out.println(cnt2);\n\t\t\t\t\tcnt++;\n\t\t\t\t\tbreak;\t\n\t\t\t\t\t}else{\n\t\t\t\t\t\tcnt3++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tcnt2++;\n\t\t}\n\t\treturn;\n}\n}\n,ACCEPTED,929,12108
1312740698899546112,f1ab11f416335963f4a2cdc8978e6fae8b6fc771cee7f44349d5ee6ab070f196,2020-10-04 21:05:46,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\npublic class Main {\n\n\n    static int [] a=new int[100];\n    //int change(int n,int s);\n\n    public static void main(String[] args) {\n\n\n        Scanner scanner=new Scanner(System.in);\n        boolean pan=true;\n        int s,n,ans,anss;\n        int sums=0,ji=0;\n        n=scanner.nextInt();\n        s=scanner.nextInt();\n\n        for(int i=s+1;;++i)\t\t\t\t//数据范围\n        {\n            if(sums==n) return ;\n            ji=0;\n            for(int k=2;k<=10;++k)\t\t//进制遍历\n            {\n\n                ans=change(k,i);\n                anss=ans/2;\n                for(int j=1;j<=anss;++j)\t\t\t\t//判断回文\n                {\n                    if(a[j]!=a[ans-j+1])\n                    {\n                        pan=false;\n                        break;\n                    }\n                }\n                if(pan) ji++;\n                if(ji==2)\n                {\n                    sums++;\n                    System.out.println(i);\n                    break;\n                }\n                pan=true;\n\n            }\n            ji=0;\n        }\n    }\n    static int change(int n,int s)\n    {\n        int ji=0;\n        int b;\n\n        while(s!=0)\n        {\n            b=s%n;\n            a[++ji]=b;\n            s/=n;\n        }\n        return ji;\n    }\n    }",ACCEPTED,835,11240
1312939395667132416,772737140437a20aba427edf50cd963527a510d7ed0afb423d3831b534dc4f65,2020-10-05 10:15:19,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner in = new Scanner(System.in);\n\t\t\tint i;   //控制循环\n\t\t\tint j;   //记录平方数的十进制\n\t\t\tint n=0;   //控制循环\n\t\t\tint m;   //记录要转化成的进制\n\t\t\tint l=0;   //控制循环\n\t\t\tint con = 0; //暂存值\n\t\t\tint p;   //控制循环\n\t\t\tint res = 0;      //记录商\n\t\t\tint result = 0;   //记录转化后的值\n\t\t\tint a[] = new int[10];        //记录余数\n\t\t\tchar b[] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\n\t\t\tint c[] = new int[10];        //放置原来数转化后的值\n\t\t\tm = in.nextInt();\n\t\t\tfor (i = 1; i <= 300; i++)\n\t\t\t{\n\t\t\t\tj = i * i;\n\t\t\t\twhile (res != 0 || n == 0)\n\t\t\t\t{\n\t\t\t\t\tres = j / m;\n\t\t\t\t\ta[n] = j % m;\n\t\t\t\t\tj = res;\n\t\t\t\t\tn++;\n\t\t\t\t}\n\t\t\t\tfor (l = 0; l < (n / 2); l++)\n\t\t\t\t\tif (a[l] != a[n - l - 1])\n\t\t\t\t\t\tbreak;\n\t\t\t\tif (l == (n / 2))\n\t\t\t\t{\n\t\t\t\t\tres = 0;\n\t\t\t\t\tp = 0;\n\t\t\t\t\tcon = i;\n\t\t\t\t\twhile (res != 0 || p == 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tres = con / m;\n\t\t\t\t\t\tc[p] = con % m;\n\t\t\t\t\t\tcon = res;\n\t\t\t\t\t\tp++;\n\t\t\t\t\t}\n\t\t\t\t\tfor (l = (p - 1); l >= 0; l--)\n\t\t\t\t\t\tSystem.out.print(b[c[l]]);\n\t\t\t\t\tSystem.out.println();\n\t\t\t\t\tfor (l = (n - 1); l >= 0; l--)\n\t\t\t\t\t\tSystem.out.print(b[a[l]]);\n\t\t\t\t\tSystem.out.println();\n\t\t\t\t}\n\t\t\t\tn = 0;\n\t\t\t\tresult = 0;\n\t\t\t}\n\t}\n\n}",MULTIPLE_ERROR,951,11384
1312939998606721024,772737140437a20aba427edf50cd963527a510d7ed0afb423d3831b534dc4f65,2020-10-05 10:17:43,Java,70.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner in = new Scanner(System.in);\n\t\t\tint i;   //控制循环\n\t\t\tint j;   //记录平方数的十进制\n\t\t\tint n=0;   //控制循环\n\t\t\tint m;   //记录要转化成的进制\n\t\t\tint l=0;   //控制循环\n\t\t\tint con = 0; //暂存值\n\t\t\tint p;   //控制循环\n\t\t\tint res = 0;      //记录商\n\t\t\tint result = 0;   //记录转化后的值\n\t\t\tint a[] = new int[10];        //记录余数\n\t\t\tchar b[] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\n\t\t\tint c[] = new int[10];        //放置原来数转化后的值\n\t\t\tm = in.nextInt();\n\t\t\tfor (i = 1; i <= 300; i++)\n\t\t\t{\n\t\t\t\tj = i * i;\n\t\t\t\twhile (res != 0 || n == 0)\n\t\t\t\t{\n\t\t\t\t\tres = j / m;\n\t\t\t\t\ta[n] = j % m;\n\t\t\t\t\tj = res;\n\t\t\t\t\tn++;\n\t\t\t\t}\n\t\t\t\tfor (l = 0; l < (n / 2); l++)\n\t\t\t\t\tif (a[l] != a[n - l - 1])\n\t\t\t\t\t\tbreak;\n\t\t\t\tif (l == (n / 2))\n\t\t\t\t{\n\t\t\t\t\tres = 0;\n\t\t\t\t\tp = 0;\n\t\t\t\t\tcon = i;\n\t\t\t\t\twhile (res != 0 || p == 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tres = con / m;\n\t\t\t\t\t\tc[p] = con % m;\n\t\t\t\t\t\tcon = res;\n\t\t\t\t\t\tp++;\n\t\t\t\t\t}\n\t\t\t\t\tfor (l = (p - 1); l >= 0; l--)\n\t\t\t\t\t\tSystem.out.print(b[c[l]]);\n\t\t\t\t\tSystem.out.print(\"" \"");\n\t\t\t\t\tfor (l = (n - 1); l >= 0; l--)\n\t\t\t\t\t\tSystem.out.print(b[a[l]]);\n\t\t\t\t\tSystem.out.println();\n\t\t\t\t}\n\t\t\t\tn = 0;\n\t\t\t\tresult = 0;\n\t\t\t}\n\t}\n\n}",PARTIAL_ACCEPTED,988,12152
1312941918914281472,772737140437a20aba427edf50cd963527a510d7ed0afb423d3831b534dc4f65,2020-10-05 10:25:21,Java,70.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner in = new Scanner(System.in);\n\t\t\tint i;   //控制循环\n\t\t\tint j;   //记录平方数的十进制\n\t\t\tint n=0;   //控制循环\n\t\t\tint m;   //记录要转化成的进制\n\t\t\tint l=0;   //控制循环\n\t\t\tint con = 0; //暂存值\n\t\t\tint p;   //控制循环\n\t\t\tint res = 0;      //记录商\n\t\t\tint a[] = new int[10];        //记录余数\n\t\t\tchar b[] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\n\t\t\tint c[] = new int[10];        //放置原来数转化后的值\n\t\t\tm = in.nextInt();\n\t\t\tfor (i = 1; i <= 300; i++)\n\t\t\t{\n\t\t\t\tj = i * i;\n\t\t\t\twhile (res != 0 || n == 0)\n\t\t\t\t{\n\t\t\t\t\tres = j / m;\n\t\t\t\t\ta[n] = j % m;\n\t\t\t\t\tj = res;\n\t\t\t\t\tn++;\n\t\t\t\t}\n\t\t\t\tfor (l = 0; l < (n / 2); l++)\n\t\t\t\t\tif (a[l] != a[n - l - 1])\n\t\t\t\t\t\tbreak;\n\t\t\t\tif (l == (n / 2))\n\t\t\t\t{\n\t\t\t\t\tres = 0;\n\t\t\t\t\tp = 0;\n\t\t\t\t\tcon = i;\n\t\t\t\t\twhile (res != 0 || p == 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tres = con / m;\n\t\t\t\t\t\tc[p] = con % m;\n\t\t\t\t\t\tcon = res;\n\t\t\t\t\t\tp++;\n\t\t\t\t\t}\n\t\t\t\t\tfor (l = (p - 1); l >= 0; l--)\n\t\t\t\t\t\tSystem.out.print(b[c[l]]);\n\t\t\t\t\tSystem.out.print(\"" \"");\n\t\t\t\t\tfor (l = (n - 1); l >= 0; l--)\n\t\t\t\t\t\tSystem.out.print(b[a[l]]);\n\t\t\t\t\tSystem.out.println();\n\t\t\t\t}\n\t\t\t\tn = 0;\n\t\t\t}\n\t}\n\n}",PARTIAL_ACCEPTED,936,11312
1312947296888619008,772737140437a20aba427edf50cd963527a510d7ed0afb423d3831b534dc4f65,2020-10-05 10:46:43,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner in = new Scanner(System.in);\n\t\tint i;   //控制循环\n\t\tint j = 0;   //记录找到的次数\n\t\tint m;   //记录要转化成的进制\n\t\tint n=0;   //记录转换后的位数\n\t\tint l = 0;   //控制循环\n\t\tint res = 0;      //记录商\n\t\tint g = 0;   //记录成为回文数的次数\n\t\tint a[] = new int[1000];         //记录余数\n\t\tint t;        //暂存数值\n\t\tint N;\n\t\tint S; \n\t\tN = in.nextInt();\n\t\tS = in.nextInt();\n\t\tfor (i = (S+1); j < N; i++)\n\t\t{\n\t\t\tfor (m = 2; m <= 10&&g<2 ; m++)\n\t\t\t{\n\t\t\t\tt = i;\n\t\t\t\twhile (res != 0 || n == 0)\n\t\t\t\t{\n\t\t\t\t\tres = t / m;\n\t\t\t\t\ta[n] = t % m;\n\t\t\t\t\tt = res;\n\t\t\t\t\tn++;\n\t\t\t\t}\n\t\t\t\tfor (l = 0; l < (n / 2); l++)\n\t\t\t\t\tif (a[l] != a[n - l - 1])\n\t\t\t\t\t\tbreak;\n\t\t\t\tif (l == (n / 2))\n\t\t\t\t{\n\t\t\t\t\tg++;\n\t\t\t\t\tif (g == 2)\n\t\t\t\t\t{\n\t\t\t\t\t\tSystem.out.println(i);\n\t\t\t\t\t\tj++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tn = 0;\n\t\t\t}\n\t\t\tg = 0;\n\t\t}\n\t}\n\n},ACCEPTED,864,11328
1312960224568213504,4c3f4e5b4c903dbd3f509f12c3bf57f6b1106a21de3661d9560298e86a8d1e3f,2020-10-05 11:38:05,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\npublic class Test08 {\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tint N = in.nextInt();\n\t\tfor (int i = 1; i <= 300; i++) {\n\t\t\tint sq = i * i;\n\t\t\tif (judge(toNString(sq, N)) == true) {\n\t\t\t\tSystem.out.println(toNString(i, N) + \"" \"" + toNString(sq, N));\n\t\t\t}\n\t\t}\n\t\tin.close();\n\t}\n    \n\tprivate static boolean judge(String string) {\n\t\t// TODO Auto-generated method stub\n\t\tint i = 0, j = string.length()-1;\n\t\tfor (i = 0; i < j; i++, j--) {\n\t\t\tif (string.charAt(i)!=string.charAt(j)) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\n\tprivate static String toNString(int num, int N) {\n\t\tStringBuffer s=new StringBuffer();\n\t\tint k;\n\t\twhile(num!=0){\n\t\t\tk=num%N;\n\t\t\tif(k>=0 && k<=9) {\n\t\t\t\ts.append(Integer.toString(k));\n\t\t\t}\n\t\t\telse\n\t\t\t\tswitch(k){\n\t\t\t\t\tcase 10:s.append('A');break;\n\t\t\t\t\tcase 11:s.append('B');break;\n\t\t\t\t\tcase 12:s.append('C');break;\n\t\t\t\t\tcase 13:s.append('D');break;\n\t\t\t\t\tcase 14:s.append('E');break;\n\t\t\t\t\tcase 15:s.append('F');break;\n\t\t\t\t\tcase 16:s.append('G');break;\n\t\t\t\t\tcase 17:s.append('H');break;\n\t\t\t\t\tcase 18:s.append('I');break;\n\t\t\t\t\tcase 19:s.append('J');break;\n\t\t\t\t}\n\t\t\tnum=num/N;\n\t\t}\n\t\tString string=new String(s.reverse().toString());\n\t\treturn string;\n\t}\n}",COMPILE_ERROR,0,0
1312960277739405312,4c3f4e5b4c903dbd3f509f12c3bf57f6b1106a21de3661d9560298e86a8d1e3f,2020-10-05 11:38:18,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tint N = in.nextInt();\n\t\tfor (int i = 1; i <= 300; i++) {\n\t\t\tint sq = i * i;\n\t\t\tif (judge(toNString(sq, N)) == true) {\n\t\t\t\tSystem.out.println(toNString(i, N) + \"" \"" + toNString(sq, N));\n\t\t\t}\n\t\t}\n\t\tin.close();\n\t}\n    \n\tprivate static boolean judge(String string) {\n\t\t// TODO Auto-generated method stub\n\t\tint i = 0, j = string.length()-1;\n\t\tfor (i = 0; i < j; i++, j--) {\n\t\t\tif (string.charAt(i)!=string.charAt(j)) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\n\tprivate static String toNString(int num, int N) {\n\t\tStringBuffer s=new StringBuffer();\n\t\tint k;\n\t\twhile(num!=0){\n\t\t\tk=num%N;\n\t\t\tif(k>=0 && k<=9) {\n\t\t\t\ts.append(Integer.toString(k));\n\t\t\t}\n\t\t\telse\n\t\t\t\tswitch(k){\n\t\t\t\t\tcase 10:s.append('A');break;\n\t\t\t\t\tcase 11:s.append('B');break;\n\t\t\t\t\tcase 12:s.append('C');break;\n\t\t\t\t\tcase 13:s.append('D');break;\n\t\t\t\t\tcase 14:s.append('E');break;\n\t\t\t\t\tcase 15:s.append('F');break;\n\t\t\t\t\tcase 16:s.append('G');break;\n\t\t\t\t\tcase 17:s.append('H');break;\n\t\t\t\t\tcase 18:s.append('I');break;\n\t\t\t\t\tcase 19:s.append('J');break;\n\t\t\t\t}\n\t\t\tnum=num/N;\n\t\t}\n\t\tString string=new String(s.reverse().toString());\n\t\treturn string;\n\t}\n}",ACCEPTED,976,11548
1313024044938493952,4c3f4e5b4c903dbd3f509f12c3bf57f6b1106a21de3661d9560298e86a8d1e3f,2020-10-05 15:51:41,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner in = new Scanner(System.in);\n\t\tint N = in.nextInt(),S=in.nextInt();\n\t\tint count;\n\t\tfor(int i=S+1;N>0;i++) {\n\t\t\tcount=0;\n\t\t\tfor(int B=2;B<=10;B++) {\n\t\t\t\tif(judge(toNString(i,B)) == true) {\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t\tif(count == 2) {\n\t\t\t\t\tN--;\n\t\t\t\t\tSystem.out.println(i);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tin.close();\n\t}\n\t\n\tprivate static String toNString(int num, int N) {\n\t\t// TODO Auto-generated method stub\n\t\tStringBuffer s=new StringBuffer();\n\t\tint k;\n\t\twhile(num!=0){\n\t\t\tk=num%N;\n\t\t\ts.append(Integer.toString(k));\n\t\t\tnum=num/N;\n\t\t}\n\t\tString string=new String(s.reverse().toString());\n\t\treturn string;\n\t}\n\t\n\tprivate static boolean judge(String string) {\n\t\t// TODO Auto-generated method stub\n\t\tint i = 0, j = string.length()-1;\n\t\tfor (i = 0; i < j; i++, j--) {\n\t\t\tif (string.charAt(i)!=string.charAt(j)) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n}\n",ACCEPTED,1025,25364
1313031101733339136,a6249e992a2fecb495cf9b2679ddf244a41c0556749df29aacf81c8be4658af0,2020-10-05 16:19:44,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\t\tpublic static int B;\n\t\tpublic static int N;\n\t\tpublic static int len;\n\t\tpublic static char[] a = new char[20];\n\n\tpublic static void main(String[] args) {\n\n\t\tScanner in = new Scanner(System.in);\n\t\tint i;\n\t\tint flag;\n\t\tB = in.nextInt();\n\t\tfor( i=1; i<=300; i++ )\n\t\t{\n\t\t\tN = i * i;\n\t\t\tflag = IsHuiWen();\n\t \n\t\t\tif( flag == 1 )\n\t\t\t{\n\t\t\t\tShow(i);\n\t\t\t\tSystem.out.print(\"" \"");\n\t\t\t\tShow(N);\n\t\t\t\tSystem.out.println();\n\t\t\t}\n\t\t}\n\t \n\t}\nstatic void Show(int m)\n{\n\tint i;\n\tTurn(m);\n\tfor( i=len-1; i>=0; i-- )\n\t\tSystem.out.print(a[i]);\n}\n\tstatic void Turn(int n)\n\t{\n\t\tint i = 0;\n\t\tint t;\n\t \n\t\tlen = 0;\n\t\tif( B>=2 && B<10 )\n\t\t{\n\t\t\twhile( n > 0 )\n\t\t\t{\n\t\t\t\ta[i] = (char) (n % B + '0');\n\t\t\t\tn = n / B;\n\t\t\t\ti++;\n\t\t\t\tlen++;\n\t\t\t}\n\t\t}\n\t\telse if( B >= 10 && B <= 20 )\n\t\t{\n\t\t\twhile( n > 0 )\n\t\t\t{\n\t\t\t\tt = n % B;\n\t\t\t\tif( t < 10 )\n\t\t\t\t\ta[i] = (char) (t + '0');\n\t\t\t\telse if( t == 10 )\n\t\t\t\t\ta[i] = 'A';\n\t\t\t\telse if( t == 11 )\n\t\t\t\t\ta[i] = 'B';\n\t\t\t\telse if( t == 12 )\n\t\t\t\t\ta[i] = 'C';\n\t\t\t\telse if( t == 13 )\n\t\t\t\t\ta[i] = 'D';\n\t\t\t\telse if( t == 14 )\n\t\t\t\t\ta[i] = 'E';\n\t\t\t\telse if( t == 15 )\n\t\t\t\t\ta[i] = 'F';\n\t\t\t\telse if( t == 16 )\n\t\t\t\t\ta[i] = 'G';\n\t\t\t\telse if( t == 17 )\n\t\t\t\t\ta[i] = 'H';\n\t\t\t\telse if( t == 18 )\n\t\t\t\t\ta[i] = 'I';\n\t\t\t\telse if( t == 19 )\n\t\t\t\t\ta[i] = 'J';\n\t\t\t\tn = n / B;\n\t\t\t\ti++;\n\t\t\t\tlen++;\n\t\t\t}\n\t\t}\n\t}\n\tstatic int IsHuiWen()\n\t{\n\t\tint i;\n\t\tint j;\n\t\tTurn(N);\n\t\ti = 0;\n\t\tj = len - 1;\n\t\twhile( i < j )\n\t\t{\n\t\t\tif( a[i] != a[j] )\n\t\t\t\treturn 0;\n\t\t\ti++;\n\t\t\tj--;\n\t\t}\n\t\treturn 1;\n\t}\n}\n",ACCEPTED,951,11268
1313032944786014208,a6249e992a2fecb495cf9b2679ddf244a41c0556749df29aacf81c8be4658af0,2020-10-05 16:27:03,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\t\tstatic int n,s,b,i,k;\n\t\tstatic int[] a = new int[1000];\n\t\tpublic static void main(String[] args) {\n\t\t\tScanner in = new Scanner(System.in);\n\t    n = in.nextInt();\n\t    s = in.nextInt();\n\t    i=s;\n\t    while (n!=0)\n\t    {\n\t        i++;\n\t        k=0;\n\t        for (b=2;b<=10;b++)\n\t        {\n\t            if (pd(i)) k++;\n\t            if (k==2) \n\t            {\n\t            \tSystem.out.println(i);\t                \n\t            \tn--;\n\t                break;\n\t            }\n\t        }\n\t    }\n\t}\n\t\tstatic boolean pd(int x)\n\t\t{\n\t\t\tint s,i;\n\t\t\ts=x;\t\n\t\t\ti=0;\n\t\t\twhile (s!=0)\n\t\t\t{\n\t\t\t\ti++;\n\t\t\t\ta[i]=s%b;\n\t\t\t\ts=s/b;\n\t\t\t}\n\t\t\tfor (int j=1;j<=i/2+1;j++)\n\t\t\t\tif (a[j]!=a[i-j+1]) return(false);\n\t\t\treturn(true);\n\t}\n}\n",ACCEPTED,861,11356
1313033048959942656,a6249e992a2fecb495cf9b2679ddf244a41c0556749df29aacf81c8be4658af0,2020-10-05 16:27:28,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\t\tstatic int n,s,b,i,k;\n\t\tstatic int[] a = new int[1000];\n\t\tpublic static void main(String[] args) {\n\t\t\tScanner in = new Scanner(System.in);\n\t    n = in.nextInt();\n\t    s = in.nextInt();\n\t    i=s;\n\t    while (n!=0)\n\t    {\n\t        i++;\n\t        k=0;\n\t        for (b=2;b<=10;b++)\n\t        {\n\t            if (pd(i)) k++;\n\t            if (k==2) \n\t            {\n\t            \tSystem.out.println(i);\t                \n\t            \tn--;\n\t                break;\n\t            }\n\t        }\n\t    }\n\t}\n\t\tstatic boolean pd(int x)\n\t\t{\n\t\t\tint s,i;\n\t\t\ts=x;\t\n\t\t\ti=0;\n\t\t\twhile (s!=0)\n\t\t\t{\n\t\t\t\ti++;\n\t\t\t\ta[i]=s%b;\n\t\t\t\ts=s/b;\n\t\t\t}\n\t\t\tfor (int j=1;j<=i/2+1;j++)\n\t\t\t\tif (a[j]!=a[i-j+1]) return false;\n\t\t\treturn true;\n\t}\n}\n",ACCEPTED,869,11248
1313051166700666880,82e4af574b47d8c6ec0df4872de0940e85d938b8ac62ac4cdcb9a84177b464d3,2020-10-05 17:39:28,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"\nimport java.util.*;\n\nclass Main {\n\tprivate static Scanner scan;\n\tstatic String jz(int x,int n) {\n\t\tString lst=\""0123456789ABCDEFGHIJ\"";\n\t\tString nums=\""\"";\n\t\tint a,b;\n\t\tif(n==10) {\n\t\t\treturn Integer.toString(n);\n\t\t}\n\t\telse {\n\t\t\twhile (true){\n\t\t\t\ta=x/n;\n\t\t\t\tb=x%n;\n\t\t\t\tnums+=lst.charAt(b);\n\t\t\t\tif(a==0) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tx=a;\n\t\t\t}\n\t\t\tStringBuffer nums1=new StringBuffer(nums);\n\t\t\tnums1.reverse();\n\t\t\treturn nums1.toString();\n\t\t}\n\t}\n\tpublic static void main(String[] args) {\n\t\tscan=new Scanner(System.in);\n\t\tint n=scan.nextInt();\n\t\tString jz_num=new String();\n\t\tString jz_num1=new String();\n\t\tfor(int i=1;i<=300;i++) {\n\t\t\tjz_num=jz(i,n);\n\t\t\tjz_num1=jz(i*i,n);\n\t\t\tStringBuffer jz_num2=new StringBuffer(jz_num1);\n\t\t\tjz_num2.reverse();\n\t\t\tif(jz_num.contentEquals(jz_num2)) {\n\t\t\t\tSystem.out.println(jz_num+\"" \""+jz_num1);\n\t\t\t}\n\t\t}\n\t}\n}",WRONG_ANSWER,1039,13052
1313051857372512256,82e4af574b47d8c6ec0df4872de0940e85d938b8ac62ac4cdcb9a84177b464d3,2020-10-05 17:42:12,Java,70.0,1306870976110592007,1267442030214471680,1049226397448056832,"\nimport java.util.*;\n\nclass Main {\n\tprivate static Scanner scan;\n\tstatic String jz(int x,int n) {\n\t\tString lst=\""0123456789ABCDEFGHIJ\"";\n\t\tString nums=\""\"";\n\t\tint a,b;\n\t\tif(n==10) {\n\t\t\treturn Integer.toString(n);\n\t\t}\n\t\telse {\n\t\t\twhile (true){\n\t\t\t\ta=x/n;\n\t\t\t\tb=x%n;\n\t\t\t\tnums+=lst.charAt(b);\n\t\t\t\tif(a==0) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tx=a;\n\t\t\t}\n\t\t\tStringBuffer nums1=new StringBuffer(nums);\n\t\t\tnums1.reverse();\n\t\t\treturn nums1.toString();\n\t\t}\n\t}\n\tpublic static void main(String[] args) {\n\t\tscan=new Scanner(System.in);\n\t\tint n=scan.nextInt();\n\t\tString jz_num=new String();\n\t\tString jz_num1=new String();\n\t\tfor(int i=1;i<=300;i++) {\n\t\t\tjz_num=jz(i,n);\n\t\t\tjz_num1=jz(i*i,n);\n\t\t\tStringBuffer jz_num2=new StringBuffer(jz_num1);\n\t\t\tjz_num2.reverse();\n\t\t\tif(jz_num1.contentEquals(jz_num2)) {\n\t\t\t\tSystem.out.println(jz_num+\"" \""+jz_num1);\n\t\t\t}\n\t\t}\n\t}\n}",PARTIAL_ACCEPTED,1012,13076
1313055764656095232,82e4af574b47d8c6ec0df4872de0940e85d938b8ac62ac4cdcb9a84177b464d3,2020-10-05 17:57:44,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"\nimport java.util.*;\n\nclass Main {\n\tprivate static Scanner scan;\n\tstatic String jz(int x,int n) {\n\t\tString lst=\""0123456789ABCDEFGHIJ\"";\n\t\tString nums=\""\"";\n\t\tint a,b;\n\t\tif(n==10) {\n\t\t\tString re=\""\""+x;\n\t\t\treturn re;\n\t\t}\n\t\telse {\n\t\t\twhile (true){\n\t\t\t\ta=x/n;\n\t\t\t\tb=x%n;\n\t\t\t\tnums+=lst.charAt(b);\n\t\t\t\tif(a==0) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tx=a;\n\t\t\t}\n\t\t\tStringBuffer nums1=new StringBuffer(nums);\n\t\t\tnums1.reverse();\n\t\t\treturn nums1.toString();\n\t\t}\n\t}\n\tpublic static void main(String[] args) {\n\t\tscan=new Scanner(System.in);\n\t\tint n=scan.nextInt();\n\t\tString jz_num=new String();\n\t\tString jz_num1=new String();\n\t\tfor(int i=1;i<=300;i++) {\n\t\t\tjz_num=jz(i,n);\n\t\t\tjz_num1=jz(i*i,n);\n\t\t\tStringBuffer jz_num2=new StringBuffer(jz_num1);\n\t\t\tjz_num2.reverse();\n\t\t\tif(jz_num1.contentEquals(jz_num2)) {\n\t\t\t\tSystem.out.println(jz_num+\"" \""+jz_num1);\n\t\t\t}\n\t\t}\n\t}\n}",ACCEPTED,1023,12660
1313402611618742272,3aaf4a732f987c33a81e41e1172d3cf2aa189e2b3924d74038f27ba4d11214e7,2020-10-06 16:55:59,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\n    public static  boolean isPalindromic(StringBuffer n)\n    {\n        int v=n.length()/2;\n        for (int i=0;i<v;i++)\n        {\n            if(n.charAt(i)!=n.charAt(n.length()-i-1)){\n                return false;\n            }\n        }\n        return  true;\n    }\n    \n    public static StringBuffer transf(int num,int B){\n        StringBuffer strB=new StringBuffer();\n        int bit;\n        while(num>0)\n        {\n            bit=num%B;\n            if(bit>=10)\n                strB.append((char)('A'+bit-10));\n            else\n                strB.append(bit);\n            num=num/B;\n                \n        }\n        return strB.reverse();\n    }\n    \n\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int B = scanner.nextInt();\n\n        int i;\n        for(i=1;i<300;i++){\n            StringBuffer n1 = transf(i,B);\n            StringBuffer n2 = transf(i*i,B);\n            if(isPalindromic(n2)){\n                System.out.println(n1+\"" \""+n2);\n            }\n        }\n\n\n\n    }\n\n}",ACCEPTED,1002,11948
1313544036452859904,3aaf4a732f987c33a81e41e1172d3cf2aa189e2b3924d74038f27ba4d11214e7,2020-10-07 02:17:57,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main{\n    static int a[]=new int[1000];\n    static int all[]=new int[1000];\n\n    public static int judge(int n ,int b){\n        int len=0;\n        while (n!=0)\n        {\n            a[len]=n%b;\n            len++;\n            n=n/b;\n        }\n        int flag=1;\n        for (int i = 0; i <=len/2 ; i++) {\n            if(a[i]!=a[len-i]){\n                flag=0;\n                break;\n            }\n\n        }\n        return flag;\n    }\n    public static void main(String args[]){\n        Scanner sc=new Scanner(System.in);\n        int num=sc.nextInt();\n        int s= sc.nextInt();\n        int t=0;\n        for (int i = s+1;t!=num ; i++) {\n            int h=0,b=2;\n            while (h<2&&b<=10)\n            {\n                h=h+judge(i,b);\n                b++;\n            }\n            if (h==2){\n                all[t]=i;\n                t++;\n            }\n            \n        }\n        for (int i = 0; i <  t; i++) {\n            System.out.println(all[i]);\n            \n        }\n\n    }\n    \n\n\n}",WRONG_ANSWER,1018,11552
1313544078458814464,3aaf4a732f987c33a81e41e1172d3cf2aa189e2b3924d74038f27ba4d11214e7,2020-10-07 02:18:07,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main{\n    static int a[]=new int[1000];\n    static int all[]=new int[1000];\n\n    public static int judge(int n ,int b){\n        int len=0;\n        while (n!=0)\n        {\n            a[len]=n%b;\n            len++;\n            n=n/b;\n        }\n        int flag=1;\n        for (int i = 0; i <=len/2 ; i++) {\n            if(a[i]!=a[len-i]){\n                flag=0;\n                break;\n            }\n\n        }\n        return flag;\n    }\n    public static void main(String args[]){\n        Scanner sc=new Scanner(System.in);\n        int num=sc.nextInt();\n        int s= sc.nextInt();\n        int t=0;\n        for (int i = s+1;t!=num ; i++) {\n            int h=0,b=2;\n            while (h<2&&b<=10)\n            {\n                h=h+judge(i,b);\n                b++;\n            }\n            if (h==2){\n                all[t]=i;\n                t++;\n            }\n            \n        }\n        for (int i = 0; i < = t; i++) {\n            System.out.println(all[i]);\n            \n        }\n\n    }\n    \n\n\n}",COMPILE_ERROR,0,0
1313544133697798144,3aaf4a732f987c33a81e41e1172d3cf2aa189e2b3924d74038f27ba4d11214e7,2020-10-07 02:18:20,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main{\n    static int a[]=new int[1000];\n    static int all[]=new int[1000];\n\n    public static int judge(int n ,int b){\n        int len=0;\n        while (n!=0)\n        {\n            a[len]=n%b;\n            len++;\n            n=n/b;\n        }\n        int flag=1;\n        for (int i = 0; i <=len/2 ; i++) {\n            if(a[i]!=a[len-i]){\n                flag=0;\n                break;\n            }\n\n        }\n        return flag;\n    }\n    public static void main(String args[]){\n        Scanner sc=new Scanner(System.in);\n        int num=sc.nextInt();\n        int s= sc.nextInt();\n        int t=0;\n        for (int i = s+1;t!=num ; i++) {\n            int h=0,b=2;\n            while (h<2&&b<=10)\n            {\n                h=h+judge(i,b);\n                b++;\n            }\n            if (h==2){\n                all[t]=i;\n                t++;\n            }\n            \n        }\n        for (int i = 0; i <  t+1; i++) {\n            System.out.println(all[i]);\n            \n        }\n\n    }\n    \n\n\n}",WRONG_ANSWER,897,11484
1313544310529654784,aa7685f63889a3cde5da1cb43e396041035c79bd2b67566ccd152b251b60c102,2020-10-07 02:19:02,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner in=new Scanner(System.in);\n\t\tint b=in.nextInt();\n\t\tint num=in.nextInt();\n\t\tint p=0;\n\t\tString d=new String();\n\t\tfor(int i=1;i<num;i++) {\n\t\t\tp=(int) Math.pow(i, 2);\n\t\t\td=transRadix(String.valueOf(p), 10, b);\n\t\t\tString reverse = new StringBuffer(d).reverse().toString();\n\t\t\tif(d.compareTo(reverse)==0)\n\t\t\t\tSystem.out.println(transRadix(String.valueOf(i), 10, b)+\"" \""+d);\n\t\t}\n//\t\tint m=(int) Math.pow(n, 2);\n//\t\tString c=new String();\n//\t\tc=String.valueOf(m);\n//\t\tSystem.out.println(c);\n//\t\tString reverse = new StringBuffer(c).reverse().toString();\n//\t\tif(c.compareTo(reverse)==0)\n//\t\t\tSystem.out.println(\""Yes\"");\n\n\t\t\t\t\n\t}\n\t static char chs[] = new char[36];\n     static {\n         for(int i = 0; i < 10 ; i++) {\n             chs[i] = (char)('0' + i);\n         }\n         for(int i = 10; i < chs.length; i++) {\n             chs[i] = (char)('A' + (i - 10));\n         }\n     }\n     \n     /**\n      * 转换方法\n      * @param num       元数据字符串\n      * @param fromRadix 元数据的进制类型\n      * @param toRadix   目标进制类型\n      * @return\n      */\n     static String transRadix(String num, int fromRadix, int toRadix) {\n         int number = Integer.valueOf(num, fromRadix);\n         StringBuilder sb = new StringBuilder();\n         while (number != 0) {\n             sb.append(chs[number%toRadix]);\n             number = number / toRadix;\n         }\n         return sb.reverse().toString();\n         \n     }\n}\n",WRONG_ANSWER,997,12172
1313544520634925056,aa7685f63889a3cde5da1cb43e396041035c79bd2b67566ccd152b251b60c102,2020-10-07 02:19:52,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner in=new Scanner(System.in);\n\t\tint b=in.nextInt();\n// \t\tint num=in.nextInt();\n\t\tint p=0;\n\t\tString d=new String();\n\t\tfor(int i=1;i<300;i++) {\n\t\t\tp=(int) Math.pow(i, 2);\n\t\t\td=transRadix(String.valueOf(p), 10, b);\n\t\t\tString reverse = new StringBuffer(d).reverse().toString();\n\t\t\tif(d.compareTo(reverse)==0)\n\t\t\t\tSystem.out.println(transRadix(String.valueOf(i), 10, b)+\"" \""+d);\n\t\t}\n//\t\tint m=(int) Math.pow(n, 2);\n//\t\tString c=new String();\n//\t\tc=String.valueOf(m);\n//\t\tSystem.out.println(c);\n//\t\tString reverse = new StringBuffer(c).reverse().toString();\n//\t\tif(c.compareTo(reverse)==0)\n//\t\t\tSystem.out.println(\""Yes\"");\n\n\t\t\t\t\n\t}\n\t static char chs[] = new char[36];\n     static {\n         for(int i = 0; i < 10 ; i++) {\n             chs[i] = (char)('0' + i);\n         }\n         for(int i = 10; i < chs.length; i++) {\n             chs[i] = (char)('A' + (i - 10));\n         }\n     }\n     \n     /**\n      * 转换方法\n      * @param num       元数据字符串\n      * @param fromRadix 元数据的进制类型\n      * @param toRadix   目标进制类型\n      * @return\n      */\n     static String transRadix(String num, int fromRadix, int toRadix) {\n         int number = Integer.valueOf(num, fromRadix);\n         StringBuilder sb = new StringBuilder();\n         while (number != 0) {\n             sb.append(chs[number%toRadix]);\n             number = number / toRadix;\n         }\n         return sb.reverse().toString();\n         \n     }\n}\n",ACCEPTED,997,11380
1313544822599647232,aa7685f63889a3cde5da1cb43e396041035c79bd2b67566ccd152b251b60c102,2020-10-07 02:21:04,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner in=new Scanner(System.in);\n\t\tint b=in.nextInt();\n// \t\tint num=in.nextInt();\n\t\tint p=0;\n\t\tString d=new String();\n\t\tfor(int i=1;i<300;i++) {\n\t\t\tp=(int) Math.pow(i, 2);\n\t\t\td=transRadix(String.valueOf(p), 10, b);\n\t\t\tString reverse = new StringBuffer(d).reverse().toString();\n\t\t\tif(d.compareTo(reverse)==0)\n\t\t\t\tSystem.out.println(transRadix(String.valueOf(i), 10, b)+\"" \""+d);\n\t\t}\n\t}\n\t static char chs[] = new char[36];\n     static {\n         for(int i = 0; i < 10 ; i++) {\n             chs[i] = (char)('0' + i);\n         }\n         for(int i = 10; i < chs.length; i++) {\n             chs[i] = (char)('A' + (i - 10));\n         }\n     }\n     /**\n      * 转换方法\n      * @param num       元数据字符串\n      * @param fromRadix 元数据的进制类型\n      * @param toRadix   目标进制类型\n      * @return\n      */\n     static String transRadix(String num, int fromRadix, int toRadix) {\n         int number = Integer.valueOf(num, fromRadix);\n         StringBuilder sb = new StringBuilder();\n         while (number != 0) {\n             sb.append(chs[number%toRadix]);\n             number = number / toRadix;\n         }\n         return sb.reverse().toString();\n     }\n}\n",ACCEPTED,1157,11440
1313544869022203904,aa7685f63889a3cde5da1cb43e396041035c79bd2b67566ccd152b251b60c102,2020-10-07 02:21:15,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner in=new Scanner(System.in);\n\t\tint b=in.nextInt();\n// \t\tint num=in.nextInt();\n\t\tint p=0;\n\t\tString d=new String();\n\t\tfor(int i=1;i<300;i++) {\n\t\t\tp=(int) Math.pow(i, 2);\n\t\t\td=transRadix(String.valueOf(p), 10, b);\n\t\t\tString reverse = new StringBuffer(d).reverse().toString();\n\t\t\tif(d.compareTo(reverse)==0)\n\t\t\t\tSystem.out.println(transRadix(String.valueOf(i), 10, b)+\"" \""+d);\n\t\t}\n\t}\n\t static char chs[] = new char[36];\n     static {\n         for(int i = 0; i < 10 ; i++) {\n             chs[i] = (char)('0' + i);\n         }\n         for(int i = 10; i < chs.length; i++) {\n             chs[i] = (char)('A' + (i - 10));\n         }\n     }\n     /**\n      * 转换方法\n      * @param num       元数据字符串\n      * @param fromRadix 元数据的进制类型\n      * @param toRadix   目标进制类型\n      * @return\n      */\n     static String transRadix(String num, int fromRadix, int toRadix) {\n         int number = Integer.valueOf(num, fromRadix);\n         StringBuilder sb = new StringBuilder();\n         while (number != 0) {\n             sb.append(chs[number%toRadix]);\n             number = number / toRadix;\n         }\n         return sb.reverse().toString();\n     }\n}\n",ACCEPTED,1001,11556
1313545733535367168,3aaf4a732f987c33a81e41e1172d3cf2aa189e2b3924d74038f27ba4d11214e7,2020-10-07 02:24:42,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main{\n    static int a[]=new int[1000];\n    static int all[]=new int[1000];\n\n    public static int judge(int n ,int b){\n        int len=0;\n        while (n!=0)\n        {\n            a[len]=n%b;\n            len++;\n            n=n/b;\n        }\n        int flag=1;\n        for (int i = 0; i <=len/2 ; i++) {\n            if(a[i]!=a[len-i]){\n                flag=0;\n                break;\n            }\n\n        }\n        return flag;\n    }\n    public static void main(String args[]){\n        Scanner sc=new Scanner(System.in);\n        int num=sc.nextInt();\n        int s= sc.nextInt();\n        int t=0;\n        for (int i = s+1;t!=num ; i++) {\n            int h=0,b=2;\n            while (h<2&&b<=10)\n            {\n                h=h+judge(i,b);\n                b++;\n            }\n            if (h==2){\n                all[t]=i;\n                t++;\n            }\n            \n        }\n        for (int i = 0; i <  t; i++) {\n            System.out.println(all[i]);\n            \n        }\n\n    }\n    \n\n\n}",WRONG_ANSWER,1012,11352
1313545973386641408,3aaf4a732f987c33a81e41e1172d3cf2aa189e2b3924d74038f27ba4d11214e7,2020-10-07 02:25:39,Java,10.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main{\n    static int a[]=new int[1000];\n    static int all[]=new int[1000];\n\n    public static int judge(int n ,int b){\n        int len=0;\n        while (n!=0)\n        {\n            a[len]=n%b;\n            len++;\n            n=n/b;\n        }\n        int flag=1;\n        for (int i = 0; i <len/2 ; i++) {\n            if(a[i]!=a[len-i]){\n                flag=0;\n                break;\n            }\n\n        }\n        return flag;\n    }\n    public static void main(String args[]){\n        Scanner sc=new Scanner(System.in);\n        int num=sc.nextInt();\n        int s= sc.nextInt();\n        int t=0;\n        for (int i = s+1;t!=num ; i++) {\n            int h=0,b=2;\n            while (h<2&&b<=10)\n            {\n                h=h+judge(i,b);\n                b++;\n            }\n            if (h==2){\n                all[t]=i;\n                t++;\n            }\n            \n        }\n        for (int i = 0; i <  t; i++) {\n            System.out.println(all[i]);\n            \n        }\n\n    }\n    \n\n\n}",PARTIAL_ACCEPTED,866,12044
1313547806079385600,3aaf4a732f987c33a81e41e1172d3cf2aa189e2b3924d74038f27ba4d11214e7,2020-10-07 02:32:56,Java,10.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main{\n    static int a[]=new int[1000];\n    static int all[]=new int[1000];\n\n    public static int judge(int n ,int b){\n        int len=0;\n        while (n!=0)\n        {\n            a[len]=n%b;\n            len++;\n            n=n/b;\n        }\n        int flag=1;\n        for (int i = 0; i <len/2-1 ; i++) {\n            if(a[i]!=a[len-i]){\n                flag=0;\n                break;\n            }\n\n        }\n        return flag;\n    }\n    public static void main(String args[]){\n        Scanner sc=new Scanner(System.in);\n        int num=sc.nextInt();\n        int s= sc.nextInt();\n        int t=0;\n        for (int i = s+1;t!=num ; i++) {\n            int h=0,b=2;\n            while (h<2&&b<=10)\n            {\n                h=h+judge(i,b);\n                b++;\n            }\n            if (h==2){\n                all[t]=i;\n                t++;\n            }\n            \n        }\n        for (int i = 0; i <  t; i++) {\n            System.out.println(all[i]);\n            \n        }\n\n    }\n    \n\n\n}",PARTIAL_ACCEPTED,842,11972
1313547970215084032,3aaf4a732f987c33a81e41e1172d3cf2aa189e2b3924d74038f27ba4d11214e7,2020-10-07 02:33:35,Java,10.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main{\n    static int a[]=new int[1000];\n    static int all[]=new int[1000];\n\n    public static int judge(int n ,int b){\n        int len=0;\n        while (n!=0)\n        {\n            a[len]=n%b;\n            len++;\n            n=n/b;\n        }\n        len--;\n        int flag=1;\n        for (int i = 0; i <len/2 ; i++) {\n            if(a[i]!=a[len-i]){\n                flag=0;\n                break;\n            }\n\n        }\n        return flag;\n    }\n    public static void main(String args[]){\n        Scanner sc=new Scanner(System.in);\n        int num=sc.nextInt();\n        int s= sc.nextInt();\n        int t=0;\n        for (int i = s+1;t!=num ; i++) {\n            int h=0,b=2;\n            while (h<2&&b<=10)\n            {\n                h=h+judge(i,b);\n                b++;\n            }\n            if (h==2){\n                all[t]=i;\n                t++;\n            }\n            \n        }\n        for (int i = 0; i <  t; i++) {\n            System.out.println(all[i]);\n            \n        }\n\n    }\n    \n\n\n}",PARTIAL_ACCEPTED,867,11368
1313656599366795264,3aaf4a732f987c33a81e41e1172d3cf2aa189e2b3924d74038f27ba4d11214e7,2020-10-07 09:45:14,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main{\n    static int a[]=new int[1000];\n    static int all[]=new int[1000];\n\n    public static int judge(int n ,int b){\n        int len=0;\n        while (n!=0)\n        {\n            a[len]=n%b;\n            len++;\n            n=n/b;\n        }\n        len--;\n        int flag=1;\n        for (int i = 0; i <len/2+1; i++) {\n            if(a[i]!=a[len-i]){\n                flag=0;\n                break;\n            }\n\n        }\n        return flag;\n    }\n    public static void main(String args[]){\n        Scanner sc=new Scanner(System.in);\n        int num=sc.nextInt();\n        int s= sc.nextInt();\n        int t=0;\n        for (int i = s+1;t!=num ; i++) {\n            int h=0,b=2;\n            while (h<2&&b<=10)\n            {\n                h=h+judge(i,b);\n                b++;\n            }\n            if (h==2){\n                all[t]=i;\n                t++;\n            }\n            \n        }\n        for (int i = 0; i <  t; i++) {\n            System.out.println(all[i]);\n            \n        }\n\n    }\n    \n\n\n}",ACCEPTED,876,11272
1313738951115866112,c06d2c51f6ee015a87196f6a509c501864576d0518058d2340af825cd0ab9faf,2020-10-07 15:12:28,Java,50.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.*;\nimport java.math.BigInteger;\nclass hanshu{\n    boolean judge(String a){\n        {\n        \n        int len = a.length();\n        \nchar[] status = a.toCharArray();\n\n        char temp;\n        for (int i = 0; i < len / 2; i++) {\n            temp = status[i];\n\n            status[i] = status[len - 1 - i];\n            status[len - 1 - i]= temp;\n        }\n        String after=new String(status);\n\n        if (a.equals(after)) {\n            return true;\n        }\n        else {\n            return false;\n        }\n        }\n    }\n    \n    String Itoa(String number, int from, int to) {\n\t\treturn new BigInteger(number, from).toString(to);\n\t}\n    \n}\npublic class Main {\n    public static void main(String[] args){\n        Scanner cin=new Scanner(System.in);\n        int b;\n        b=cin.nextInt();\n        hanshu h=new hanshu();\n        for(int i=1;i<=300;i++){\n            String s1 = Integer.toString(i*i);\n            String s2 = Integer.toString(i);\n           \n            String mm=h.Itoa(s1,10,b);\n   \n            if(h.judge(mm)==true)\n            System.out.println(h.Itoa(s2,10,b) + \"" \"" + mm);\n           \n           \n        }\n    } \n}\n",PARTIAL_ACCEPTED,1050,12480
1313741371615150080,c06d2c51f6ee015a87196f6a509c501864576d0518058d2340af825cd0ab9faf,2020-10-07 15:22:05,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.*;\nimport java.math.BigInteger;\nclass hanshu{\n    boolean judge(String a){\n        {\n        \n        int len = a.length();\n        \nchar[] status = a.toCharArray();\n\n        char temp;\n        for (int i = 0; i < len / 2; i++) {\n            temp = status[i];\n\n            status[i] = status[len - 1 - i];\n            status[len - 1 - i]= temp;\n        }\n        String after=new String(status);\n\n        if (a.equals(after)) {\n            return true;\n        }\n        else {\n            return false;\n        }\n        }\n    }\n    \n    String Itoa(int num,int r) {\n        String str= \""\"";\n        int yushu ;      \n        int shang = num;      \n        while (shang>0) {\n          yushu = shang %r;\n          shang = shang/r;\n          \n          // 10-15 -> a-f\n          if(yushu>9) {\n            str =(char)('A'+(yushu-10)) + str;\n          }else {\n            str = yushu+str;\n          }\n        }\n        \n        return str;\n    \n    \n}}\npublic class Main{\n    public static void main(String[] args){\n        Scanner cin=new Scanner(System.in);\n        int b;\n        b=cin.nextInt();\n        hanshu h=new hanshu();\n        for(int i=1;i<=300;i++){\n         \n           \n            String mm=h.Itoa(i*i,b);\n   \n            if(h.judge(mm)==true)\n            System.out.println(h.Itoa(i,b) + \"" \"" + mm);\n           \n           \n        }\n    } \n\n}",ACCEPTED,1000,11824
1313762104084987904,c06d2c51f6ee015a87196f6a509c501864576d0518058d2340af825cd0ab9faf,2020-10-07 16:44:28,Java,50.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.*;\nclass hanshu{\n    boolean judge(String str){\n        char[] a=str.toCharArray();\n        int len=str.length();\n        for(int i=0;i<len/2;i++){\n            char temp=a[i];\n            a[i]=a[len-1-i];\n            a[len-1-i]=temp;\n        }\n        String after=new String(a);\n        if(str.equals(after)){ \n      \n        return true;\n        }\n\n        else return false;\n    }\n    String itoa(int num,int r){\n        String rem=\""\"";\n        int yu;\n       \n        while(num>0){\n            yu=num%r;\n            num=num/r;\n            if(yu>9){\n                rem=(char)(yu-10+'A')+rem;\n            }\n            else\n            rem=yu+rem;\n        }\n    \n        return rem;\n    }\n}\npublic class Main{\n    public static void main(String[] args){\n        hanshu h=new hanshu();\n        Scanner in=new Scanner(System.in);\n        int b,e;\n        b=in.nextInt();\n        e=in.nextInt();\n        int m=0;\n        for(int i=e+1;i<=100000;i++){\n            if(m==b)break;\n            int n=0;\n             for(int j=2;j<=10;j++){\n              String mm=h.itoa(i,j);\n              int a = Integer.parseInt(mm);\n              \n              if(h.judge(mm)==true){n++;}\n              if(n>=2){\n                  m++;\n                  System.out.println(i);\n                  break;\n              }\n          }\n        }\n    }\n}\n",PARTIAL_ACCEPTED,880,12416
1313762134745350144,c06d2c51f6ee015a87196f6a509c501864576d0518058d2340af825cd0ab9faf,2020-10-07 16:44:36,Java,50.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.*;\nclass hanshu{\n    boolean judge(String str){\n        char[] a=str.toCharArray();\n        int len=str.length();\n        for(int i=0;i<len/2;i++){\n            char temp=a[i];\n            a[i]=a[len-1-i];\n            a[len-1-i]=temp;\n        }\n        String after=new String(a);\n        if(str.equals(after)){ \n      \n        return true;\n        }\n\n        else return false;\n    }\n    String itoa(int num,int r){\n        String rem=\""\"";\n        int yu;\n       \n        while(num>0){\n            yu=num%r;\n            num=num/r;\n            if(yu>9){\n                rem=(char)(yu-10+'A')+rem;\n            }\n            else\n            rem=yu+rem;\n        }\n    \n        return rem;\n    }\n}\npublic class Main{\n    public static void main(String[] args){\n        hanshu h=new hanshu();\n        Scanner in=new Scanner(System.in);\n        int b,e;\n        b=in.nextInt();\n        e=in.nextInt();\n        int m=0;\n        for(int i=e+1;i<=100000;i++){\n            if(m==b)break;\n            int n=0;\n             for(int j=2;j<=10;j++){\n              String mm=h.itoa(i,j);\n              int a = Integer.parseInt(mm);\n              \n              if(h.judge(mm)==true){n++;}\n              if(n>=2){\n                  m++;\n                  System.out.println(i);\n                  break;\n              }\n          }\n        }\n    }\n}\n",PARTIAL_ACCEPTED,902,13392
1313762151375765504,c06d2c51f6ee015a87196f6a509c501864576d0518058d2340af825cd0ab9faf,2020-10-07 16:44:40,Java,50.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.*;\nclass hanshu{\n    boolean judge(String str){\n        char[] a=str.toCharArray();\n        int len=str.length();\n        for(int i=0;i<len/2;i++){\n            char temp=a[i];\n            a[i]=a[len-1-i];\n            a[len-1-i]=temp;\n        }\n        String after=new String(a);\n        if(str.equals(after)){ \n      \n        return true;\n        }\n\n        else return false;\n    }\n    String itoa(int num,int r){\n        String rem=\""\"";\n        int yu;\n       \n        while(num>0){\n            yu=num%r;\n            num=num/r;\n            if(yu>9){\n                rem=(char)(yu-10+'A')+rem;\n            }\n            else\n            rem=yu+rem;\n        }\n    \n        return rem;\n    }\n}\npublic class Main{\n    public static void main(String[] args){\n        hanshu h=new hanshu();\n        Scanner in=new Scanner(System.in);\n        int b,e;\n        b=in.nextInt();\n        e=in.nextInt();\n        int m=0;\n        for(int i=e+1;i<=100000;i++){\n            if(m==b)break;\n            int n=0;\n             for(int j=2;j<=10;j++){\n              String mm=h.itoa(i,j);\n              int a = Integer.parseInt(mm);\n              \n              if(h.judge(mm)==true){n++;}\n              if(n>=2){\n                  m++;\n                  System.out.println(i);\n                  break;\n              }\n          }\n        }\n    }\n}\n",PARTIAL_ACCEPTED,853,12512
1313766639641755648,c06d2c51f6ee015a87196f6a509c501864576d0518058d2340af825cd0ab9faf,2020-10-07 17:02:30,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.*;\nclass hanshu{\n    boolean judge(String str){\n        char[] a=str.toCharArray();\n        int len=str.length();\n        for(int i=0;i<len/2;i++){\n            char temp=a[i];\n            a[i]=a[len-1-i];\n            a[len-1-i]=temp;\n        }\n        String after=new String(a);\n        if(str.equals(after)){ \n      \n        return true;\n        }\n\n        else return false;\n    }\n    String itoa(int num,int r){\n        String rem=\""\"";\n        int yu;\n       \n        while(num>0){\n            yu=num%r;\n            num=num/r;\n            if(yu>9){\n                rem=(char)(yu-10+'A')+rem;\n            }\n            else\n            rem=yu+rem;\n        }\n    \n        return rem;\n    }\n}\npublic class Main{\n    public static void main(String[] args){\n        hanshu h=new hanshu();\n        Scanner in=new Scanner(System.in);\n        int b,e;\n        b=in.nextInt();\n        e=in.nextInt();\n        int m=0;\n        for(int i=e+1;i<=100000;i++){\n            if(m==b)break;\n            int n=0;\n             for(int j=2;j<=10;j++){\n              String mm=h.itoa(i,j);\n             \n              \n              if(h.judge(mm)==true){n++;}\n              if(n>=2){\n                  m++;\n                  System.out.println(i);\n                  break;\n              }\n          }\n        }\n    }\n}\n",ACCEPTED,1011,24176
1313782539774263296,aa7685f63889a3cde5da1cb43e396041035c79bd2b67566ccd152b251b60c102,2020-10-07 18:05:41,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner in=new Scanner(System.in);\n\t\tint N=in.nextInt();\n\t\tint S=in.nextInt();\n\t\tint cnt=0;\n\t\tin.close();\n\t\tString o=new String();\n\t\tString d=new String();\n\t\tfor(int i=S+1;;i++) {\n\t\t\tfor(int j=2;j<20;j++) {\n\t\t\t\to=String.valueOf(i);\n\t\t\t\td=transRadix(o,10,j);\n\t\t\t\tif(d==new StringBuffer(d).reverse().toString()) {\n\t\t\t\t\t++cnt;\n\t\t\t\t\tSystem.out.println(i);\n\t\t\t\t}\n\t\t\t\tif(cnt==N)\n\t\t\t\t\tbreak;\t\n\t\t\t}\n\t\t\tif(cnt==N)\n\t\t\t\tbreak;\t\n\t\t}\n\t\t\n\t}\n\t\n\n\tstatic char chs[] = new char[36];\n    static {\n        for(int i = 0; i < 10 ; i++) {\n            chs[i] = (char)('0' + i);\n        }\n        for(int i = 10; i < chs.length; i++) {\n            chs[i] = (char)('A' + (i - 10));\n        }\n    }\n    /**\n     * 转换方法\n     * @param num       元数据字符串\n     * @param fromRadix 元数据的进制类型\n     * @param toRadix   目标进制类型\n     * @return\n     */\n    static String transRadix(String num, int fromRadix, int toRadix) {\n        int number = Integer.valueOf(num, fromRadix);\n        StringBuilder sb = new StringBuilder();\n        while (number != 0) {\n            sb.append(chs[number%toRadix]);\n            number = number / toRadix;\n        }\n        return sb.reverse().toString();       \n    }\n}\n",TIME_LIMIT_EXCEEDED,0,0
1313784400271048704,aa7685f63889a3cde5da1cb43e396041035c79bd2b67566ccd152b251b60c102,2020-10-07 18:13:04,Java,10.0,1306870976110592008,1267449136707624960,1049226397448056832,"\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner in=new Scanner(System.in);\n\t\tint N=in.nextInt();\n\t\tint S=in.nextInt();\n\t\tint cnt=0;\n\t\tin.close();\n\t\tString o=new String();\n\t\tString d=new String();\n\t\tfor(int i=S+1;;i++) {\n\t\t\tfor(int j=2;j<10;j++) {\n\t\t\t\to=transRadix(String.valueOf(i),10,j);\n\t\t\t\td=new StringBuffer(o).reverse().toString();\n\t\t\t\tif(o.compareTo(d)==0) {\n\t\t\t\t\t++cnt;\n\t\t\t\t\tSystem.out.println(i);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(cnt==N)\n\t\t\t\t\tbreak;\t\n\t\t\t}\n\t\t\tif(cnt==N)\n\t\t\t\tbreak;\t\n\t\t}\n\t\t\n\t}\n\t\n\n\tstatic char chs[] = new char[36];\n    static {\n        for(int i = 0; i < 10 ; i++) {\n            chs[i] = (char)('0' + i);\n        }\n        for(int i = 10; i < chs.length; i++) {\n            chs[i] = (char)('A' + (i - 10));\n        }\n    }\n    /**\n     * 转换方法\n     * @param num       元数据字符串\n     * @param fromRadix 元数据的进制类型\n     * @param toRadix   目标进制类型\n     * @return\n     */\n    static String transRadix(String num, int fromRadix, int toRadix) {\n        int number = Integer.valueOf(num, fromRadix);\n        StringBuilder sb = new StringBuilder();\n        while (number != 0) {\n            sb.append(chs[number%toRadix]);\n            number = number / toRadix;\n        }\n        return sb.reverse().toString();       \n    }\n}\n",PARTIAL_ACCEPTED,883,13284
1313784471758766080,aa7685f63889a3cde5da1cb43e396041035c79bd2b67566ccd152b251b60c102,2020-10-07 18:13:21,Java,10.0,1306870976110592008,1267449136707624960,1049226397448056832,"\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner in=new Scanner(System.in);\n\t\tint N=in.nextInt();\n\t\tint S=in.nextInt();\n\t\tint cnt=0;\n\t\tin.close();\n\t\tString o=new String();\n\t\tString d=new String();\n\t\tfor(int i=S+1;;i++) {\n\t\t\tfor(int j=2;j<20;j++) {\n\t\t\t\to=transRadix(String.valueOf(i),10,j);\n\t\t\t\td=new StringBuffer(o).reverse().toString();\n\t\t\t\tif(o.compareTo(d)==0) {\n\t\t\t\t\t++cnt;\n\t\t\t\t\tSystem.out.println(i);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(cnt==N)\n\t\t\t\t\tbreak;\t\n\t\t\t}\n\t\t\tif(cnt==N)\n\t\t\t\tbreak;\t\n\t\t}\n\t\t\n\t}\n\t\n\n\tstatic char chs[] = new char[36];\n    static {\n        for(int i = 0; i < 10 ; i++) {\n            chs[i] = (char)('0' + i);\n        }\n        for(int i = 10; i < chs.length; i++) {\n            chs[i] = (char)('A' + (i - 10));\n        }\n    }\n    /**\n     * 转换方法\n     * @param num       元数据字符串\n     * @param fromRadix 元数据的进制类型\n     * @param toRadix   目标进制类型\n     * @return\n     */\n    static String transRadix(String num, int fromRadix, int toRadix) {\n        int number = Integer.valueOf(num, fromRadix);\n        StringBuilder sb = new StringBuilder();\n        while (number != 0) {\n            sb.append(chs[number%toRadix]);\n            number = number / toRadix;\n        }\n        return sb.reverse().toString();       \n    }\n}\n",PARTIAL_ACCEPTED,878,12676
1313785209318735872,aa7685f63889a3cde5da1cb43e396041035c79bd2b67566ccd152b251b60c102,2020-10-07 18:16:17,Java,10.0,1306870976110592008,1267449136707624960,1049226397448056832,"\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner in=new Scanner(System.in);\n\t\tint N=in.nextInt();\n\t\tint S=in.nextInt();\n\t\tint cnt=0;\n\t\tin.close();\n\t\tString o=new String();\n\t\tString d=new String();\n\t\tfor(int i=S+1;;i++) {\n\t\t\tfor(int j=2;j<10;j++) {\n\t\t\t\to=transRadix(String.valueOf(i),10,j);\n\t\t\t\td=new StringBuffer(o).reverse().toString();\n\t\t\t\tif(o.compareTo(d)==0) {\n\t\t\t\t\t++cnt;\n\t\t\t\t\tSystem.out.println(i);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(cnt==N)\n\t\t\t\t\tbreak;\t\n\t\t\t}\n\t\t\tif(cnt==N)\n\t\t\t\tbreak;\t\n\t\t}\n\t\t\n\t}\n\t\n\n\tstatic char chs[] = new char[36];\n    static {\n        for(int i = 0; i < 10 ; i++) {\n            chs[i] = (char)('0' + i);\n        }\n        for(int i = 10; i < chs.length; i++) {\n            chs[i] = (char)('A' + (i - 10));\n        }\n    }\n    /**\n     * 转换方法\n     * @param num       元数据字符串\n     * @param fromRadix 元数据的进制类型\n     * @param toRadix   目标进制类型\n     * @return\n     */\n    static String transRadix(String num, int fromRadix, int toRadix) {\n        int number = Integer.valueOf(num, fromRadix);\n        StringBuilder sb = new StringBuilder();\n        while (number != 0) {\n            sb.append(chs[number%toRadix]);\n            number = number / toRadix;\n        }\n        return sb.reverse().toString();       \n    }\n}\n",PARTIAL_ACCEPTED,862,11756
1313789681835114496,aa7685f63889a3cde5da1cb43e396041035c79bd2b67566ccd152b251b60c102,2020-10-07 18:34:03,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"\nimport java.util.Scanner;\n\npublic class main {\n\tpublic static void main(String[] args) {\n\t\tScanner in=new Scanner(System.in);\n\t\tint N=in.nextInt();\n\t\tint S=in.nextInt();\n\t\tint cnt=0;\n\t\t\n\t\tin.close();\n\t\tString o=new String();\n\t\tString d=new String();\n\t\tfor(int i=S+1;;i++) {\n\t\t\tint count=0;\n\t\t\tfor(int j=2;j<10;j++) {\n\t\t\t\to=transRadix(String.valueOf(i),10,j);\n\t\t\t\td=new StringBuffer(o).reverse().toString();\n\t\t\t\tif(o.compareTo(d)==0) {\n\t\t\t\t\t++count;\t\n\t\t\t\t}\n\t\t\t\tif(count==2) {\n\t\t\t\t\t++cnt;\n\t\t\t\t\tSystem.out.println(i);\n\t\t\t\t\tbreak;\n\t\t\t\t}\t\t\n\t\t\t}\n\t\t\tif(cnt==N)\n\t\t\t\tbreak;\t\n\t\t}\n\t\t\n\t}\n\t\n\n\tstatic char chs[] = new char[36];\n    static {\n        for(int i = 0; i < 10 ; i++) {\n            chs[i] = (char)('0' + i);\n        }\n        for(int i = 10; i < chs.length; i++) {\n            chs[i] = (char)('A' + (i - 10));\n        }\n    }\n    /**\n     * 转换方法\n     * @param num       元数据字符串\n     * @param fromRadix 元数据的进制类型\n     * @param toRadix   目标进制类型\n     * @return\n     */\n    static String transRadix(String num, int fromRadix, int toRadix) {\n        int number = Integer.valueOf(num, fromRadix);\n        StringBuilder sb = new StringBuilder();\n        while (number != 0) {\n            sb.append(chs[number%toRadix]);\n            number = number / toRadix;\n        }\n        return sb.reverse().toString();       \n    }\n}\n",COMPILE_ERROR,0,0
1313789728081510400,aa7685f63889a3cde5da1cb43e396041035c79bd2b67566ccd152b251b60c102,2020-10-07 18:34:14,Java,40.0,1306870976110592008,1267449136707624960,1049226397448056832,"\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner in=new Scanner(System.in);\n\t\tint N=in.nextInt();\n\t\tint S=in.nextInt();\n\t\tint cnt=0;\n\t\t\n\t\tin.close();\n\t\tString o=new String();\n\t\tString d=new String();\n\t\tfor(int i=S+1;;i++) {\n\t\t\tint count=0;\n\t\t\tfor(int j=2;j<10;j++) {\n\t\t\t\to=transRadix(String.valueOf(i),10,j);\n\t\t\t\td=new StringBuffer(o).reverse().toString();\n\t\t\t\tif(o.compareTo(d)==0) {\n\t\t\t\t\t++count;\t\n\t\t\t\t}\n\t\t\t\tif(count==2) {\n\t\t\t\t\t++cnt;\n\t\t\t\t\tSystem.out.println(i);\n\t\t\t\t\tbreak;\n\t\t\t\t}\t\t\n\t\t\t}\n\t\t\tif(cnt==N)\n\t\t\t\tbreak;\t\n\t\t}\n\t\t\n\t}\n\t\n\n\tstatic char chs[] = new char[36];\n    static {\n        for(int i = 0; i < 10 ; i++) {\n            chs[i] = (char)('0' + i);\n        }\n        for(int i = 10; i < chs.length; i++) {\n            chs[i] = (char)('A' + (i - 10));\n        }\n    }\n    /**\n     * 转换方法\n     * @param num       元数据字符串\n     * @param fromRadix 元数据的进制类型\n     * @param toRadix   目标进制类型\n     * @return\n     */\n    static String transRadix(String num, int fromRadix, int toRadix) {\n        int number = Integer.valueOf(num, fromRadix);\n        StringBuilder sb = new StringBuilder();\n        while (number != 0) {\n            sb.append(chs[number%toRadix]);\n            number = number / toRadix;\n        }\n        return sb.reverse().toString();       \n    }\n}\n",PARTIAL_ACCEPTED,1121,20564
1313789934185414656,aa7685f63889a3cde5da1cb43e396041035c79bd2b67566ccd152b251b60c102,2020-10-07 18:35:03,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner in=new Scanner(System.in);\n\t\tint N=in.nextInt();\n\t\tint S=in.nextInt();\n\t\tint cnt=0;\n\t\t\n\t\tin.close();\n\t\tString o=new String();\n\t\tString d=new String();\n\t\tfor(int i=S+1;;i++) {\n\t\t\tint count=0;\n\t\t\tfor(int j=2;j<11;j++) {\n\t\t\t\to=transRadix(String.valueOf(i),10,j);\n\t\t\t\td=new StringBuffer(o).reverse().toString();\n\t\t\t\tif(o.compareTo(d)==0) {\n\t\t\t\t\t++count;\t\n\t\t\t\t}\n\t\t\t\tif(count==2) {\n\t\t\t\t\t++cnt;\n\t\t\t\t\tSystem.out.println(i);\n\t\t\t\t\tbreak;\n\t\t\t\t}\t\t\n\t\t\t}\n\t\t\tif(cnt==N)\n\t\t\t\tbreak;\t\n\t\t}\n\t\t\n\t}\n\t\n\n\tstatic char chs[] = new char[36];\n    static {\n        for(int i = 0; i < 10 ; i++) {\n            chs[i] = (char)('0' + i);\n        }\n        for(int i = 10; i < chs.length; i++) {\n            chs[i] = (char)('A' + (i - 10));\n        }\n    }\n    /**\n     * 转换方法\n     * @param num       元数据字符串\n     * @param fromRadix 元数据的进制类型\n     * @param toRadix   目标进制类型\n     * @return\n     */\n    static String transRadix(String num, int fromRadix, int toRadix) {\n        int number = Integer.valueOf(num, fromRadix);\n        StringBuilder sb = new StringBuilder();\n        while (number != 0) {\n            sb.append(chs[number%toRadix]);\n            number = number / toRadix;\n        }\n        return sb.reverse().toString();       \n    }\n}\n",ACCEPTED,1013,21680
1313864549620449280,d8321467439a37c77d422396cd6dd920b1748636a3c931dbeb45272c6d8542f2,2020-10-07 23:31:33,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\npublic class Main {\n\tpublic static String transform(int B, int num)\n\t{\n\t\tString s = \""\"";\n\t\twhile (num != 0)\n\t\t{\n\t\t\ts = Integer.toString(num % B) + s;\n\t\t\tnum = num / B;\n\t\t}\n\t\treturn s;\n\t}\n\tpublic static boolean is_num(String s)\n\t{\n\t\tint i = 0, j = s.length() - 1;\n\t\twhile(i < j)\n\t\t{\n\t\t\tif (s.charAt(i) != s.charAt(j)) \n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\ti++;\n\t\t\tj--;\n\t\t}\n\t\treturn true;\n\t}\n\tpublic static void main(String[] args) {\n\t\t \tScanner sc = new Scanner(System.in);\n\t\t \tint N = sc.nextInt();\n\t\t \tint S = sc.nextInt();\n\t\t\tint m = 0, i = S;\n\t\t\twhile (m<N)\n\t\t\t{\n\t\t\t\ti++;\n\t\t\t\tint n = 0;\n\t\t\t\tfor (int j=2;j<=10;j++)\n\t\t\t\t{\n\t\t            if (is_num(transform(j,i))) \n\t\t\t\t\t{\n\t\t\t\t\t\tn++;\n\t\t\t\t\t}\n\t\t\t\t\tif (n>=2) \n\t\t\t\t\t{\n\t\t\t\t\t\tSystem.out.println(i);\n\t\t\t\t\t\tm++;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\t \n\t}\n}",ACCEPTED,1064,25968
1314033436722921472,22bc41363ee5ce2db2edc4a0bb731769cc4b7261d5eae6b29c2cf336a68cd60b,2020-10-08 10:42:39,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"\nimport java.util.Scanner;\n\n//输入进制\n//从1到300逐一讨论\n//\t每个数字计算平方\n//\t平方进行进制转换\n//\t转化成字串\n//\t看看是不是回文\n//\t是就输出\n\n\npublic class Main {\n\tstatic int B;//2-20\n\tstatic char[] Letter= {'0','1', '2', '3', '4', '5', '6', '7','8','9','A', 'B','C','D','E','F','G', 'H', 'I', 'J'};\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner console= new Scanner(System.in);\n\t\tB= console.nextInt();\n\t\t\n\t\tsolve(10);\n\t\t//transOut(10, 11);\n\t\t\n\n\t\t\n\t}\n\t\n\t//n进制下1-300讨论入口\n\tstatic void solve(int B) {\n\t\tfor(int i=0; i<=300; i++) {\n\t\t\ttransOut(B, i);\n\t\t}\n\t}\n\t\n\t//进制转换和输出\n\tstatic void transOut(int B, int i) {//进制 数字\n\t\tStringBuffer str= new StringBuffer();\n\t\tStringBuffer tempstr=new StringBuffer();\n\t\tint num= i*i;\n\t\t//进制转换\n\t\twhile(num>0) {\n\t\t\tstr.append(Letter[num%B]);\n\t\t\tnum= (num- num%B)/B;\n\t\t}\n\t\t\n\t\t//倒置\n\t\ttempstr.append(str.toString());\n\t\t\n\t\tif(str.reverse().toString().equals(tempstr.toString())) {\n\t\t\tSystem.out.println(i+ \"" \""+ str.toString());\n\t\t\treturn;\n\t\t}\n\t\telse return;\n\t\t\n\t\t\n\t}\n}\n",WRONG_ANSWER,1120,11288
1314033686019768320,22bc41363ee5ce2db2edc4a0bb731769cc4b7261d5eae6b29c2cf336a68cd60b,2020-10-08 10:43:38,Java,10.0,1306870976110592007,1267442030214471680,1049226397448056832,"\nimport java.util.Scanner;\n\n//输入进制\n//从1到300逐一讨论\n//\t每个数字计算平方\n//\t平方进行进制转换\n//\t转化成字串\n//\t看看是不是回文\n//\t是就输出\n\n\npublic class Main {\n\tstatic int B;//2-20\n\tstatic char[] Letter= {'0','1', '2', '3', '4', '5', '6', '7','8','9','A', 'B','C','D','E','F','G', 'H', 'I', 'J'};\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner console= new Scanner(System.in);\n\t\tB= console.nextInt();\n\t\t\n\t\tsolve(10);\n\t\t//transOut(10, 11);\n\t\t\n\n\t\t\n\t}\n\t\n\t//n进制下1-300讨论入口\n\tstatic void solve(int B) {\n\t\tfor(int i=1; i<=300; i++) {\n\t\t\ttransOut(B, i);\n\t\t}\n\t}\n\t\n\t//进制转换和输出\n\tstatic void transOut(int B, int i) {//进制 数字\n\t\tStringBuffer str= new StringBuffer();\n\t\tStringBuffer tempstr=new StringBuffer();\n\t\tint num= i*i;\n\t\t//进制转换\n\t\twhile(num>0) {\n\t\t\tstr.append(Letter[num%B]);\n\t\t\tnum= (num- num%B)/B;\n\t\t}\n\t\t\n\t\t//倒置\n\t\ttempstr.append(str.toString());\n\t\t\n\t\tif(str.reverse().toString().equals(tempstr.toString())) {\n\t\t\tSystem.out.println(i+ \"" \""+ str.toString());\n\t\t\treturn;\n\t\t}\n\t\telse return;\n\t\t\n\t\t\n\t}\n}\n",PARTIAL_ACCEPTED,1012,12204
1314033880354455552,22bc41363ee5ce2db2edc4a0bb731769cc4b7261d5eae6b29c2cf336a68cd60b,2020-10-08 10:44:25,Java,10.0,1306870976110592007,1267442030214471680,1049226397448056832,"\nimport java.util.Scanner;\n\n//输入进制\n//从1到300逐一讨论\n//\t每个数字计算平方\n//\t平方进行进制转换\n//\t转化成字串\n//\t看看是不是回文\n//\t是就输出\n\n\npublic class Main {\n\tstatic int B;//2-20\n\tstatic char[] Letter= {'0','1', '2', '3', '4', '5', '6', '7','8','9','A', 'B','C','D','E','F','G', 'H', 'I', 'J'};\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner console= new Scanner(System.in);\n\t\tB= console.nextInt();\n\t\t\n\t\tsolve(B);\n\t\t//transOut(10, 11);\n\t\t\n\n\t\t\n\t}\n\t\n\t//n进制下1-300讨论入口\n\tstatic void solve(int B) {\n\t\tfor(int i=1; i<=300; i++) {\n\t\t\ttransOut(B, i);\n\t\t}\n\t}\n\t\n\t//进制转换和输出\n\tstatic void transOut(int B, int i) {//进制 数字\n\t\tStringBuffer str= new StringBuffer();\n\t\tStringBuffer tempstr=new StringBuffer();\n\t\tint num= i*i;\n\t\t//进制转换\n\t\twhile(num>0) {\n\t\t\tstr.append(Letter[num%B]);\n\t\t\tnum= (num- num%B)/B;\n\t\t}\n\t\t\n\t\t//倒置\n\t\ttempstr.append(str.toString());\n\t\t\n\t\tif(str.reverse().toString().equals(tempstr.toString())) {\n\t\t\tSystem.out.println(i+ \"" \""+ str.toString());\n\t\t\treturn;\n\t\t}\n\t\telse return;\n\t\t\n\t\t\n\t}\n}\n",PARTIAL_ACCEPTED,991,12080
1314036740538433536,22bc41363ee5ce2db2edc4a0bb731769cc4b7261d5eae6b29c2cf336a68cd60b,2020-10-08 10:55:47,Java,50.0,1306870976110592007,1267442030214471680,1049226397448056832,"\nimport java.util.Scanner;\n\n//输入进制\n//从1到300逐一讨论\n//\t每个数字计算平方\n//\t平方进行进制转换\n//\t转化成字串\n//\t看看是不是回文\n//\t是就输出\n\n\npublic class Main {\n\tstatic int B;//2-20\n\tstatic char[] Letter= {'0','1', '2', '3', '4', '5', '6', '7','8','9','A', 'B','C','D','E','F','G', 'H', 'I', 'J'};\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner console= new Scanner(System.in);\n\t\tB= console.nextInt();\n\t\t\n\t\tsolve(B);\n\t\t//transOut(10, 11);\n\t\t\n\n\t\t\n\t}\n\t\n\t//n进制下1-300讨论入口\n\tstatic void solve(int B) {\n\t\tfor(int i=1; i<=300; i++) {\n\t\t\ttransOut(B, i);\n\t\t}\n\t}\n\t\n\t//进制转换和输出\n\tstatic void transOut(int B, int i) {//进制 数字\n\t\tStringBuffer str= new StringBuffer();\n\t\tStringBuffer tempstr=new StringBuffer();\n\t\tint num= i*i;\n\t\t//进制转换\n\t\twhile(num>0) {\n\t\t\tstr.append(Letter[num%B]);\n\t\t\tnum= (num- num%B)/B;\n\t\t}\n\t\t\n\t\t//倒置\n\t\ttempstr.append(str.toString());\n\t\t\n\t\tif(str.reverse().toString().equals(tempstr.toString())) {\n\t\t\tSystem.out.println(Integer.toString(i, B)+ \"" \""+ str.toString());\n\t\t\treturn;\n\t\t}\n\t\telse return;\n\t\t\n\t\t\n\t}\n}\n",PARTIAL_ACCEPTED,981,11308
1314038152810921984,22bc41363ee5ce2db2edc4a0bb731769cc4b7261d5eae6b29c2cf336a68cd60b,2020-10-08 11:01:23,Java,50.0,1306870976110592007,1267442030214471680,1049226397448056832,"\n\nimport java.util.Scanner;\n\n//输入进制\n//从1到300逐一讨论\n//\t每个数字计算平方\n//\t平方进行进制转换\n//\t转化成字串\n//\t看看是不是回文\n//\t是就输出\n\n\npublic class Main {\n\tstatic int B;//2-20\n\tstatic char[] Letter= {'0','1', '2', '3', '4', '5', '6', '7','8','9','A', 'B','C','D','E','F','G', 'H', 'I', 'J'};\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner console= new Scanner(System.in);\n\t\tB= console.nextInt();\n\t\t\n\t\tsolve(B);\n\t\t//transOut(10, 11);\n\t\t\n\n\t\t\n\t}\n\t\n\t//n进制下1-300讨论入口\n\tstatic void solve(int B) {\n\t\tfor(int i=1; i<=300; i++) {\n\t\t\ttransOut(B, i);\n\t\t}\n\t}\n\t\n\t//进制转换和输出\n\tstatic void transOut(int B, int i) {//进制 数字\n\t\tString iunderB= Integer.toString(i, B);\n\t\tString squareUnderB= Integer.toString(i*i, B);\n\t\tStringBuffer reSquareB= new StringBuffer(squareUnderB);\n\t\t\n\t\tif(squareUnderB.equals(reSquareB.reverse().toString())) {\n\t\t\tSystem.out.println(iunderB+ \"" \""+ reSquareB.toString());\n\t\t}\n\t\t\n\t\t\n\t}\n}\n",PARTIAL_ACCEPTED,978,11396
1314038999078862848,22bc41363ee5ce2db2edc4a0bb731769cc4b7261d5eae6b29c2cf336a68cd60b,2020-10-08 11:04:45,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"\n\nimport java.util.Scanner;\n\n//输入进制\n//从1到300逐一讨论\n//\t每个数字计算平方\n//\t平方进行进制转换\n//\t转化成字串\n//\t看看是不是回文\n//\t是就输出\n\n\npublic class Main {\n\tstatic int B;//2-20\n\tstatic char[] Letter= {'0','1', '2', '3', '4', '5', '6', '7','8','9','A', 'B','C','D','E','F','G', 'H', 'I', 'J'};\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner console= new Scanner(System.in);\n\t\tB= console.nextInt();\n\t\t\n\t\tsolve(B);\n\t\t//transOut(10, 11);\n\t\t\n\n\t\t\n\t}\n\t\n\t//n进制下1-300讨论入口\n\tstatic void solve(int B) {\n\t\tfor(int i=1; i<=300; i++) {\n\t\t\t\n\t\t\ttransOut(B, i);\n\t\t}\n\t}\n\t\n\t//进制转换和输出\n\tstatic void transOut(int B, int i) {//进制 数字\n\t\tString iunderB= Integer.toString(i, B);\n\t\tString squareUnderB= Integer.toString(i*i, B);\n\t\tStringBuffer reSquareB= new StringBuffer(squareUnderB);\n\t\t\n\t\tif(squareUnderB.equals(reSquareB.reverse().toString())) {\n\t\t\tSystem.out.println(iunderB.toUpperCase()+ \"" \""+ reSquareB.toString().toUpperCase());\n\t\t}\n\t\t\n\t\t\n\t}\n}\n",ACCEPTED,1105,11512
1314044275177750528,22bc41363ee5ce2db2edc4a0bb731769cc4b7261d5eae6b29c2cf336a68cd60b,2020-10-08 11:25:43,Java,10.0,1306870976110592008,1267449136707624960,1049226397448056832,"\nimport java.util.Scanner;\n\n//输入数据\n//\t前n个 初始数字大于S\n//\t\n//\t在大于S的范围上一个一个讨论（考虑剪枝)\n//\t\t每一个数字二到十均转化一次进制\n//\t\t判断是不是回文\n//\t\t直到满足数字个数要求。\n\npublic class Main {\n\tstatic int n;\n\tstatic int S;\n\n\tpublic static void main(String[] args) {\n\t\tScanner console= new Scanner(System.in);\n\t\tn= console.nextInt();\n\t\tS= console.nextInt();\n\t\tint countNum= 0;\n\n\t\tfor(int i=S+1; ; i++) {\n\t\t\tif(countNum==n) return;\n\t\t\t//对于每一个数字 讨论各个进制下的回文情况\n\t\t\tfor(int r=2; r<=10; r++) {\n\t\t\t\tString iUnderR= Integer.toString(i, r);\n\t\t\t\tStringBuffer reUnderR= new StringBuffer(iUnderR);\n\t\t\t\tif(iUnderR.equals(reUnderR.reverse().toString())) {\n\t\t\t\t\tSystem.out.println(i);\n\t\t\t\t\tcountNum++;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\n\t}\n\t}\n}\n\n",PARTIAL_ACCEPTED,873,12304
1314045798699958272,22bc41363ee5ce2db2edc4a0bb731769cc4b7261d5eae6b29c2cf336a68cd60b,2020-10-08 11:31:46,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"\n\nimport java.util.Scanner;\n\n//输入数据\n//\t前n个 初始数字大于S\n//\t\n//\t在大于S的范围上一个一个讨论（考虑剪枝)\n//\t\t每一个数字二到十均转化一次进制\n//\t\t判断是不是回文\n//\t\t直到满足数字个数要求。\n\npublic class Main {\n\tstatic int n;\n\tstatic int S;\n\n\tpublic static void main(String[] args) {\n\t\tScanner console= new Scanner(System.in);\n\t\tn= console.nextInt();\n\t\tS= console.nextInt();\n\t\tint countNum= 0;\n\n\t\tfor(int i=S+1; ; i++) {\n\t\t\tif(countNum==n) return;\n\t\t\t//对于每一个数字 讨论各个进制下的回文情况\n\t\t\tboolean doubleSign1= false;\n\n\t\t\tfor(int r=2; r<=10; r++) {\n\t\t\t\tString iUnderR= Integer.toString(i, r);\n\t\t\t\tStringBuffer reUnderR= new StringBuffer(iUnderR);\n\t\t\t\tif(iUnderR.equals(reUnderR.reverse().toString())) {\n\t\t\t\t\tif(!doubleSign1) {\n\t\t\t\t\t\tdoubleSign1= true;\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tSystem.out.println(i);\n\t\t\t\t\t\tcountNum++;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\n\t}\n\t}\n}\n\n",ACCEPTED,984,20504
1314166357219803136,c5f006269b926e61241c8f09728f8ca99c23da829b64fc3aefb604777dcc38c7,2020-10-08 19:30:50,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\t\n\tstatic char can[] = new char[20];\n\tstatic int transf(int yuan, int jinzhi)\n\t{\n\t    int length = 0;\n\t    int weishu;\n\t    while(yuan!=0)\n\t    {\n\t        weishu = yuan%jinzhi;\n\t        if(weishu>=10){can[length]=(char) (weishu+55);}\n\t        else{can[length] = (char) (weishu+48);}\n\t        yuan/=jinzhi;\n\t        length++;\n\t    }\n\t    can[length] = '\\0';\n\t    return length;\n\t}\n\tstatic boolean Ishui(int length)\n\t{\n\t    for(int i = 0;i<=length/2;i++)\n\t    {\n\t        if(can[i]!=can[length-i-1]){return false;}\n\t    }\n\t    return true;\n\t}\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\t\n\t    int B;\n\t    Scanner S = new Scanner(System.in);\n\t    B = S.nextInt();\n//\t    cin >> B;\n\t    int pingfang;\n\t    for(int i =1;i<=300;i++)\n\t    {\n\t        pingfang = i*i;\n\t        if(Ishui(transf(pingfang,B)))\n\t        {\n\t            for(int j=transf(i,B)-1;j>=0;j--)\n\t            {\n\t            \tSystem.out.print(can[j]);\n//\t                cout << can[j];\n\t            }\n\t            System.out.print(\"" \"");\n//\t            cout << \"" \"";\n\t            for(int j=transf(pingfang,B)-1;j>=0;j--)\n\t            {\n\t            \tSystem.out.print(can[j]);\n//\t                cout << can[j];\n\t            }\n\t            System.out.println();\n//\t            cout << endl;\n\t        }\n\t    }\n\t    return;\n\t}\n\n}\n",ACCEPTED,990,11232
1314166392892358656,c5f006269b926e61241c8f09728f8ca99c23da829b64fc3aefb604777dcc38c7,2020-10-08 19:30:58,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\t\n\tstatic char can[] = new char[20];\n\tstatic int transf(int yuan, int jinzhi)\n\t{\n\t    int length = 0;\n\t    int weishu;\n\t    while(yuan!=0)\n\t    {\n\t        weishu = yuan%jinzhi;\n\t        if(weishu>=10){can[length]=(char) (weishu+55);}\n\t        else{can[length] = (char) (weishu+48);}\n\t        yuan/=jinzhi;\n\t        length++;\n\t    }\n\t    can[length] = '\\0';\n\t    return length;\n\t}\n\tstatic boolean Ishui(int length)\n\t{\n\t    for(int i = 0;i<=length/2;i++)\n\t    {\n\t        if(can[i]!=can[length-i-1]){return false;}\n\t    }\n\t    return true;\n\t}\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\t\n\t    int B;\n\t    Scanner S = new Scanner(System.in);\n\t    B = S.nextInt();\n//\t    cin >> B;\n\t    int pingfang;\n\t    for(int i =1;i<=300;i++)\n\t    {\n\t        pingfang = i*i;\n\t        if(Ishui(transf(pingfang,B)))\n\t        {\n\t            for(int j=transf(i,B)-1;j>=0;j--)\n\t            {\n\t            \tSystem.out.print(can[j]);\n//\t                cout << can[j];\n\t            }\n\t            System.out.print(\"" \"");\n//\t            cout << \"" \"";\n\t            for(int j=transf(pingfang,B)-1;j>=0;j--)\n\t            {\n\t            \tSystem.out.print(can[j]);\n//\t                cout << can[j];\n\t            }\n\t            System.out.println();\n//\t            cout << endl;\n\t        }\n\t    }\n\t    return;\n\t}\n\n}\n",ACCEPTED,1012,12212
1314166981537759232,0660b9c9140341e5aa83535a78d6b7d07399ba8e63d999f57ffcd66499c26587,2020-10-08 19:33:19,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tint B, i, j, k,l, num;\n\t\tint pal[]=new int[300];\n\t\tint ori[]=new int[300];\n\t\tchar o;\n\t\tScanner in=new Scanner(System.in);\n\t\tB=in.nextInt();\n\t\tfor (i = 1; i <= 300; i++)\n\t\t{\n\t\t\tnum = i*i;\n\t\t\tfor (j = 0; num != 0; j++)\n\t\t\t{\n\t\t\t\tpal[j] = num % B;\n\t\t\t\tnum = num / B;\n\t\t\t}\n\t\t\tj = j - 1;\n\t\t\tfor (k = 0; k <= j / 2; k++)\n\t\t\t\tif (pal[k] != pal[j - k])\n\t\t\t\t{\t\n\t\t\t\t\tk = -1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\tif (k != -1)\n\t\t\t{\n\t\t\t\tnum = i;\n\t\t\t\tfor (k = 0; num != 0; k++)\n\t\t\t\t{\n\t\t\t\t\tori[k] = num % B;\n\t\t\t\t\tnum = num / B;\n\t\t\t\t}\n\t\t\t\tfor (l = k - 1; l >= 0; l--)\n\t\t\t\t{\n\t\t\t\t\tif (ori[l] < 10)\n\t\t\t\t\t\tSystem.out.print(ori[l]);\n\t\t\t\t\telse {\n\t\t\t\t\t\to=(char) (ori[l]+55);\n\t\t\t\t\t\tSystem.out.print(o);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tSystem.out.print(\"" \"");\n\t\t\t\tfor (k = 0; k <= j; k++)\n\t\t\t\t{\n\t\t\t\t\tif (pal[k] < 10)\n\t\t\t\t\t\tSystem.out.print(pal[k]);\n\t\t\t\t\telse {\n\t\t\t\t\t\to=(char) (pal[k]+55);\n\t\t\t\t\t\tSystem.out.print(o);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tSystem.out.println();\n\t\t\t}\n\t\t}\n\t}\n}",ACCEPTED,1002,12140
1314168033259487232,0660b9c9140341e5aa83535a78d6b7d07399ba8e63d999f57ffcd66499c26587,2020-10-08 19:37:29,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner in=new Scanner(System.in);\n\t\tint n, s, i, j, k, l, count = 0, num, ok;\n\t\tint temp[]=new int[100];\n\t\tn=in.nextInt();\n\t\ts=in.nextInt();\n\t\tfor (i = s + 1; count < n; i++)\n\t\t{\n\t\t\tok = 0;\n\t\t\tfor (j = 2; j <= 10; j++)\n\t\t\t{\n\t\t\t\tnum = i;\n\t\t\t\tfor (k = 0; num != 0; k++)\n\t\t\t\t{\n\t\t\t\t\ttemp[k] = num % j;\n\t\t\t\t\tnum = num / j;\n\t\t\t\t}\n\t\t\t\tk = k - 1;\n\t\t\t\tfor (l = 0; l <= k / 2; l++)\n\t\t\t\t\tif (temp[l] != temp[k - l])\n\t\t\t\t\t{\n\t\t\t\t\t\tl = -1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\tif (l != -1)\n\t\t\t\t\tok++;\n\t\t\t}\n\t\t\tif (ok >= 2)\n\t\t\t{\n\t\t\t\tcount++;\n\t\t\t\tSystem.out.println(i);\n\t\t\t}\n\t\t}\n\t}\n}",ACCEPTED,886,11388
1314173860875796480,c5f006269b926e61241c8f09728f8ca99c23da829b64fc3aefb604777dcc38c7,2020-10-08 20:00:39,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class dualPalindromes {\n\t\n\tstatic char can[] = new char[20];\n\t\n\tstatic int transf(int yuan, int jinzhi)\n\t{\n\t    int length = 0;\n\t    while(yuan!=0)\n\t    {\n\t        can[length] = (char) (yuan%jinzhi+48);\n\t        yuan/=jinzhi;\n\t        length++;\n\t    }\n\t    can[length] = '\\0';\n\t    return length;\n\t}\n\tstatic boolean Ishui(int length)\n\t{\n\t    for(int i = 0; i <= length/2; i++)\n\t    {\n\t        if(can[i]!=can[length-i-1]){return false;}\n\t    }\n\t    return true;\n\t}\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\n\t\t    int N,S;\n\t\t    int count = 0;\n\t\t    Scanner s = new Scanner(System.in);\n\t\t    N = s.nextInt();\n\t\t    S = s.nextInt();\n//\t\t    cin >> N >> S;\n\t\t    for(int i = S+1;count < N;i++)\n\t\t    {\n\t\t        int counthui = 0;\n\t\t        for(int j = 2;j<=10;j++)\n\t\t        {\n\t\t            if(Ishui(transf(i,j))){counthui++;}\n\t\t        }\n\t\t        if(counthui>=2){System.out.println(i);count++;}\n\t\t    }\n\n\t}\n\n}\n",COMPILE_ERROR,0,0
1314173949950230528,c5f006269b926e61241c8f09728f8ca99c23da829b64fc3aefb604777dcc38c7,2020-10-08 20:01:00,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\t\n\tstatic char can[] = new char[20];\n\t\n\tstatic int transf(int yuan, int jinzhi)\n\t{\n\t    int length = 0;\n\t    while(yuan!=0)\n\t    {\n\t        can[length] = (char) (yuan%jinzhi+48);\n\t        yuan/=jinzhi;\n\t        length++;\n\t    }\n\t    can[length] = '\\0';\n\t    return length;\n\t}\n\tstatic boolean Ishui(int length)\n\t{\n\t    for(int i = 0; i <= length/2; i++)\n\t    {\n\t        if(can[i]!=can[length-i-1]){return false;}\n\t    }\n\t    return true;\n\t}\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\n\t\t    int N,S;\n\t\t    int count = 0;\n\t\t    Scanner s = new Scanner(System.in);\n\t\t    N = s.nextInt();\n\t\t    S = s.nextInt();\n//\t\t    cin >> N >> S;\n\t\t    for(int i = S+1;count < N;i++)\n\t\t    {\n\t\t        int counthui = 0;\n\t\t        for(int j = 2;j<=10;j++)\n\t\t        {\n\t\t            if(Ishui(transf(i,j))){counthui++;}\n\t\t        }\n\t\t        if(counthui>=2){System.out.println(i);count++;}\n\t\t    }\n\n\t}\n\n}\n",ACCEPTED,862,11388
1314184671052627968,82e4af574b47d8c6ec0df4872de0940e85d938b8ac62ac4cdcb9a84177b464d3,2020-10-08 20:43:36,Java,20.0,1306870976110592008,1267449136707624960,1049226397448056832,"\nimport java.util.*;\n\nclass Main {\n\tprivate static Scanner scan;\n\tstatic String jz(int x,int n) {\n\t\tString lst=\""0123456789ABCDEFGHIJ\"";\n\t\tString nums=\""\"";\n\t\tint a,b;\n\t\tif(n==10) {\n\t\t\treturn Integer.toString(x);\n\t\t}\n\t\telse {\n\t\t\twhile (true){\n\t\t\t\ta=x/n;\n\t\t\t\tb=x%n;\n\t\t\t\tnums+=lst.charAt(b);\n\t\t\t\tif(a==0) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tx=a;\n\t\t\t}\n\t\t\tStringBuffer nums1=new StringBuffer(nums);\n\t\t\tnums1.reverse();\n\t\t\treturn nums1.toString();\n\t\t}\n\t}\n\tpublic static void main(String[] args) {\n\t\tscan=new Scanner(System.in);\n\t\tint N=scan.nextInt();\n\t\tint S=scan.nextInt();\n\t\t//int p[]=new int [N];\n\t\tint border,f=0;\n\t\tif(S<1000) {\n\t\t\tborder=1000;\n\t\t}\n\t\telse {\n\t\t\tborder=S+3000;\n\t\t}\n\t\tfor(int i=S+1;i<border;i++) {\n\t\t\tint count=0;\n\t\t\tfor(int j=2;j<=11;j++) {\n\t\t\t\tString jz1=jz(i,j);\n\t\t\t\tStringBuffer jz2=new StringBuffer(jz1);\n\t\t\t\tjz2.reverse();\n\t\t\t\tif(jz1.contentEquals(jz2) && jz1.charAt(0)!='0' && jz1.charAt(jz1.length()-1)!='0') {\n\t\t\t\t\tcount+=1;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(f>=N) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(count>=2) {\n\t\t\t\tSystem.out.println(i);\n\t\t\t\tf++;\n\t\t\t}\n\t\t}\n\t\t\n\t}\n}",PARTIAL_ACCEPTED,1134,38040
1314185748057620480,82e4af574b47d8c6ec0df4872de0940e85d938b8ac62ac4cdcb9a84177b464d3,2020-10-08 20:47:53,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"\nimport java.util.*;\n\nclass Main {\n\tprivate static Scanner scan;\n\tstatic String jz(int x,int n) {\n\t\tString lst=\""0123456789ABCDEFGHIJ\"";\n\t\tString nums=\""\"";\n\t\tint a,b;\n\t\tif(n==10) {\n\t\t\treturn Integer.toString(x);\n\t\t}\n\t\telse {\n\t\t\twhile (true){\n\t\t\t\ta=x/n;\n\t\t\t\tb=x%n;\n\t\t\t\tnums+=lst.charAt(b);\n\t\t\t\tif(a==0) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tx=a;\n\t\t\t}\n\t\t\tStringBuffer nums1=new StringBuffer(nums);\n\t\t\tnums1.reverse();\n\t\t\treturn nums1.toString();\n\t\t}\n\t}\n\tpublic static void main(String[] args) {\n\t\tscan=new Scanner(System.in);\n\t\tint N=scan.nextInt();\n\t\tint S=scan.nextInt();\n\t\t//int p[]=new int [N];\n\t\tint border,f=0;\n\t\tif(S<1000) {\n\t\t\tborder=1000;\n\t\t}\n\t\telse {\n\t\t\tborder=S+3000;\n\t\t}\n\t\tfor(int i=S+1;i<border;i++) {\n\t\t\tint count=0;\n\t\t\tfor(int j=2;j<11;j++) {\n\t\t\t\tString jz1=jz(i,j);\n\t\t\t\tStringBuffer jz2=new StringBuffer(jz1);\n\t\t\t\tjz2.reverse();\n\t\t\t\tif(jz1.contentEquals(jz2) && jz1.charAt(0)!='0' && jz1.charAt(jz1.length()-1)!='0') {\n\t\t\t\t\tcount+=1;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(f>=N) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(count>=2) {\n\t\t\t\tSystem.out.println(i);\n\t\t\t\tf++;\n\t\t\t}\n\t\t}\n\t\t\n\t}\n}",ACCEPTED,1084,37008
1314487314706792448,b0dbadad058dca3ef81e6649021912f5fd5c227bf259aad890bd38b4c96656ad,2020-10-09 16:46:12,Java,50.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Comparator;\nimport java.util.Scanner;\n\npublic class Main {\n    public static boolean is_hw(String s) {\n        String temp = new StringBuffer(s).reverse().toString();\n        return s.equals(temp);\n    }\n\tpublic static void main(String[] args) {\n        Scanner cin = new Scanner(System.in);\n        int B = cin.nextInt(), i;\n        for(i=1; i<=300; i++) {\n            int ii = i*i;\n            String s = Integer.toString(ii, B);\n            if(is_hw(s)) {\n                System.out.print(Integer.toString(i, B) + \"" \"" + s);\n                break;\n            }\n        }\n        for(i+=1; i<300 ;i++)\n        {\n            int ii = i*i;\n            String s = Integer.toString(ii, B);\n            if(is_hw(s)) {\n                System.out.print(\""\\n\"" + Integer.toString(i, B) + \"" \"" + s);\n            }\n        }\n\t}\n}",PARTIAL_ACCEPTED,1022,12076
1314488878280409088,b0dbadad058dca3ef81e6649021912f5fd5c227bf259aad890bd38b4c96656ad,2020-10-09 16:52:25,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Comparator;\nimport java.util.Scanner;\n\npublic class Main {\n    public static String exChange(String str){\n\t\tStringBuffer sb = new StringBuffer();\n\t\tif(str!=null){\n\t\t\tfor(int i=0;i<str.length();i++){\n\t\t\t\tchar c = str.charAt(i);\n\t\t\t\tif(Character.isLowerCase(c)){\n\t\t\t\t\tsb.append(Character.toUpperCase(c)); \n\t\t\t\t}else {\n\t\t\t\t    sb.append(c);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn sb.toString();\n    }\n    \n    public static boolean is_hw(String s) {\n        String temp = new StringBuffer(s).reverse().toString();\n        return s.equals(temp);\n    }\n\tpublic static void main(String[] args) {\n        Scanner cin = new Scanner(System.in);\n        int B = cin.nextInt(), i;\n        for(i=1; i<=300; i++) {\n            int ii = i*i;\n            String s = Integer.toString(ii, B);\n            if(is_hw(s)) {\n                System.out.print(exChange(Integer.toString(i, B)) + \"" \"" + exChange(s));\n                break;\n            }\n        }\n        for(i+=1; i<300 ;i++)\n        {\n            int ii = i*i;\n            String s = Integer.toString(ii, B);\n            if(is_hw(s)) {\n                System.out.print(\""\\n\"" + exChange(Integer.toString(i, B)) + \"" \"" + exChange(s));\n            }\n        }\n\t}\n}",ACCEPTED,988,11388
1314761196546342912,fdbca684c22ef228dd6668184c911846287860d1733104734c3d0653a3d045cc,2020-10-10 10:54:30,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"package eighth;\n\nimport java.util.ArrayList;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tArrayList<StringBuffer> list1 = new ArrayList<StringBuffer>();\n\t\tArrayList<StringBuffer> list2 = new ArrayList<StringBuffer>();\n\t\tScanner sc = new Scanner(System.in);\n\t\tint radix = sc.nextInt();\n\t\tfor(int i=1; i<301; i++)\n\t\t{\n\t\t\tStringBuffer string1 = new StringBuffer(radix_change(i*i, radix));\n\t\t\tif (Palindrome_number(string1))\n\t\t\t{\n\t\t\t\tStringBuffer temp = new StringBuffer();\n\t\t\t\tlist1.add(temp.append(radix_change(i, radix)));\n\t\t\t    list2.add(string1);\n\t\t\t}\n\t\t}\n\t\tfor(int j=0; j<list1.size(); j++)\n\t\t\tSystem.out.println(list1.get(j)+\"" \""+list2.get(j));\n\t}\n\tprivate static boolean Palindrome_number(StringBuffer string1) {\n\t\t// TODO Auto-generated method stub\n\t\tif(string1.equals(string1.reverse()))\n\t\t\treturn true;\n\t\telse \n\t\t\treturn false;\n\t}\n\tpublic static String radix_change(int a, int b)\n\t{\n\t\tif(a == 0)\n\t\t\treturn \""\"";\n\t\telse\n\t\t\treturn radix_change(a/b, b)+a%b;\n\t}\n}\n",WRONG_ANSWER,806,11120
1314770391400235008,fdbca684c22ef228dd6668184c911846287860d1733104734c3d0653a3d045cc,2020-10-10 11:31:03,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.ArrayList;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tArrayList<StringBuffer> list1 = new ArrayList<StringBuffer>();\n\t\tArrayList<StringBuffer> list2 = new ArrayList<StringBuffer>();\n\t\tScanner sc = new Scanner(System.in);\n\t\tint radix = sc.nextInt();\n\t\tfor(int i=1; i<301; i++)\n\t\t{\n\t\t\tStringBuffer string1 = new StringBuffer(radix_change(i*i, radix));\n\t\t\tif (Palindrome_number(string1))\n\t\t\t{\n\t\t\t\tStringBuffer temp = new StringBuffer();\n\t\t\t\tlist1.add(temp.append(radix_change(i, radix)));\n\t\t\t    list2.add(string1);\n\t\t\t}\n\t\t}\n\t\tfor(int j=0; j<list1.size(); j++)\n\t\t\tSystem.out.println(list1.get(j)+\"" \""+list2.get(j));\n\t\tsc.close();\n\t}\n\tprivate static boolean Palindrome_number(StringBuffer string1) {\n\t\t// TODO Auto-generated method stub\n\t\tif(string1.equals(string1.reverse()))\n\t\t\treturn true;\n\t\telse \n\t\t\treturn false;\n\t}\n\tpublic static String radix_change(int a, int b)\n\t{\n\t\tArrayList<StringBuffer> temp1 = new ArrayList<StringBuffer>();\n\t\tfor(int i=0; i<10; i++)\n\t\t{\n\t\t\tStringBuffer temp = new StringBuffer(i);\n\t\t\ttemp1.add(temp);\n\t\t}\n\t\tfor(int i=0; i<10; i++)\n\t\t{\n\t\t\tStringBuffer temp = new StringBuffer();\n\t\t\ttemp.append((char)(i+'A'));\n\t\t\ttemp1.add(temp);\n\t\t}\n\t\tArrayList<Integer> temp2 = new ArrayList<Integer>();\n\t\twhile (a!=0)\n\t\t{\n\t\t\tint n = a%b;\n\t\t\ttemp2.add(n);\n\t\t\ta = a/b;\n\t\t}\n\t\tString temp = \""\"";\n\t\tfor(int i=temp2.size()-1; i>=0; i--)\n\t\t\ttemp = temp + temp1.get(temp2.get(i)).toString();\n\t\treturn temp;\n\t}\n}\n",WRONG_ANSWER,1293,14664
1314772896163086336,fdbca684c22ef228dd6668184c911846287860d1733104734c3d0653a3d045cc,2020-10-10 11:41:00,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"package eighth;\n\nimport java.util.ArrayList;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tArrayList<StringBuffer> list1 = new ArrayList<StringBuffer>();\n\t\tArrayList<StringBuffer> list2 = new ArrayList<StringBuffer>();\n\t\tScanner sc = new Scanner(System.in);\n\t\tint radix = sc.nextInt();\n\t\tfor(int i=1; i<301; i++)\n\t\t{\n\t\t\tStringBuffer string1 = new StringBuffer(radix_change(i*i, radix));\n\t\t\tif (Palindrome_number(string1))\n\t\t\t{\n\t\t\t\tStringBuffer temp = new StringBuffer();\n\t\t\t\tlist1.add(temp.append(radix_change(i, radix)));\n\t\t\t    list2.add(string1);\n\t\t\t}\n\t\t}\n\t\tfor(int j=0; j<list1.size(); j++)\n\t\t\tSystem.out.println(list1.get(j)+\"" \""+list2.get(j));\n\t\tsc.close();\n\t}\n\tprivate static boolean Palindrome_number(StringBuffer string1) {\n\t\t// TODO Auto-generated method stub\n\t\tif(string1.equals(string1.reverse()))\n\t\t\treturn true;\n\t\telse \n\t\t\treturn false;\n\t}\n\tpublic static String radix_change(int a, int b)\n\t{\n\t\tArrayList<StringBuffer> temp1 = new ArrayList<StringBuffer>();\n\t\tfor(int i=0; i<10; i++)\n\t\t{\n\t\t\tStringBuffer temp = new StringBuffer();\n\t\t\ttemp.append(i);\n\t\t\ttemp1.add(temp);\n\t\t}\n\t\tfor(int i=0; i<10; i++)\n\t\t{\n\t\t\tStringBuffer temp = new StringBuffer();\n\t\t\ttemp.append((char)(i+'A'));\n\t\t\ttemp1.add(temp);\n\t\t}\n\t\tArrayList<Integer> temp2 = new ArrayList<Integer>();\n\t\twhile (a!=0)\n\t\t{\n\t\t\tint n = a%b;\n\t\t\ttemp2.add(n);\n\t\t\ta = a/b;\n\t\t}\n\t\tString temp = \""\"";\n\t\tfor(int i=temp2.size()-1; i>=0; i--)\n\t\t\ttemp = temp + temp1.get(temp2.get(i)).toString();\n\t\treturn temp;\n\t}\n}\n",MULTIPLE_ERROR,788,11220
1314774720681132032,fdbca684c22ef228dd6668184c911846287860d1733104734c3d0653a3d045cc,2020-10-10 11:48:15,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.ArrayList;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tArrayList<StringBuffer> list1 = new ArrayList<StringBuffer>();\n\t\tArrayList<StringBuffer> list2 = new ArrayList<StringBuffer>();\n\t\tScanner sc = new Scanner(System.in);\n\t\tint radix = sc.nextInt();\n\t\tfor(int i=1; i<301; i++)\n\t\t{\n\t\t\tStringBuffer string1 = new StringBuffer();\n\t\t\tstring1.append(radix_change(i*i, radix));\n\t\t\tif (Palindrome_number(string1))\n\t\t\t{\n\t\t\t\tStringBuffer temp = new StringBuffer();\n\t\t\t\tlist1.add(temp.append(radix_change(i, radix)));\n\t\t\t    list2.add(string1);\n\t\t\t}\n\t\t}\n\t\tfor(int j=0; j<list1.size(); j++)\n\t\t\tSystem.out.println(list1.get(j)+\"" \""+list2.get(j));\n\t\tsc.close();\n\t}\n\tprivate static boolean Palindrome_number(StringBuffer string1) {\n\t\t// TODO Auto-generated method stub\n\t\tif(string1.toString().equals(string1.reverse().toString()))\n\t\t\treturn true;\n\t\telse \n\t\t\treturn false;\n\t}\n\tpublic static String radix_change(int a, int b)\n\t{\n\t\tArrayList<StringBuffer> temp1 = new ArrayList<StringBuffer>();\n\t\tfor(int i=0; i<10; i++)\n\t\t{\n\t\t\tStringBuffer temp = new StringBuffer();\n\t\t\ttemp.append(i);\n\t\t\ttemp1.add(temp);\n\t\t}\n\t\tfor(int i=0; i<10; i++)\n\t\t{\n\t\t\tStringBuffer temp = new StringBuffer();\n\t\t\ttemp.append((char)(i+'A'));\n\t\t\ttemp1.add(temp);\n\t\t}\n\t\tArrayList<Integer> temp2 = new ArrayList<Integer>();\n\t\twhile (a!=0)\n\t\t{\n\t\t\tint n = a%b;\n\t\t\ttemp2.add(n);\n\t\t\ta = a/b;\n\t\t}\n\t\tString temp = \""\"";\n\t\tfor(int i=temp2.size()-1; i>=0; i--)\n\t\t\ttemp = temp + temp1.get(temp2.get(i)).toString();\n\t\treturn temp;\n\t}\n}\n",ACCEPTED,1220,15344
1314876323903881216,e1e5b82b1d61198e7376d4d64338249615623e6843cdde86e22cb3af01aa60aa,2020-10-10 18:31:59,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import com.sun.tools.classfile.ConstantPool;\n\nimport java.util.Scanner;\nimport java.util.Arrays;\nimport java.util.*;\n\npublic class Main {\n    public static String binary(int n, int x){\n        char[] charList = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J'};\n\n        ArrayList<Integer> binary = new ArrayList<Integer>();\n        while (true){\n            int div = n / x;\n            int mod = n % x;\n            binary.add(mod);\n            if (div==0) break;\n            n = div;\n        }\n        Collections.reverse(binary);\n        StringBuilder numStr = new StringBuilder();\n        for (int i = 0; i < binary.size(); i++) {\n            numStr.append(binary.get(i));\n        }\n        return numStr.toString();\n    }\n    public static boolean palsq(String num){\n        int len = num.length();\n        boolean flag = false;\n        if (len!=1){\n            for (int i = 0; i < len/2; i++) {\n                if (num.charAt(i) == num.charAt(len-i-1)){\n                    flag = true;\n                }else {\n                    flag = false;\n                    break;\n                }\n            }\n        }\n        else{\n            flag = true;\n        }\n        return flag;\n    }\n\n    public static void main(String[] args) {\n        Scanner in = new Scanner(System.in);\n        String num_ = in.nextLine();\n        int n =  Integer.parseInt(num_);\n        char[] charList = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J'};\n        for (int i = 1; i < 301; i++) {\n            int square =  i * i ;\n            String bin = binary(square, n);\n            //System.out.println(bin);\n            if (palsq(bin)){\n                System.out.println(binary(i,n) + \"" \"" + bin);\n            }\n        }\n\n    }\n\n}\n",COMPILE_ERROR,0,0
1314876530649513984,e1e5b82b1d61198e7376d4d64338249615623e6843cdde86e22cb3af01aa60aa,2020-10-10 18:32:48,Java,40.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\nimport java.util.Arrays;\nimport java.util.*;\n\npublic class Main {\n    public static String binary(int n, int x){\n        char[] charList = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J'};\n\n        ArrayList<Integer> binary = new ArrayList<Integer>();\n        while (true){\n            int div = n / x;\n            int mod = n % x;\n            binary.add(mod);\n            if (div==0) break;\n            n = div;\n        }\n        Collections.reverse(binary);\n        StringBuilder numStr = new StringBuilder();\n        for (int i = 0; i < binary.size(); i++) {\n            numStr.append(binary.get(i));\n        }\n        return numStr.toString();\n    }\n    public static boolean palsq(String num){\n        int len = num.length();\n        boolean flag = false;\n        if (len!=1){\n            for (int i = 0; i < len/2; i++) {\n                if (num.charAt(i) == num.charAt(len-i-1)){\n                    flag = true;\n                }else {\n                    flag = false;\n                    break;\n                }\n            }\n        }\n        else{\n            flag = true;\n        }\n        return flag;\n    }\n\n    public static void main(String[] args) {\n        Scanner in = new Scanner(System.in);\n        String num_ = in.nextLine();\n        int n =  Integer.parseInt(num_);\n        char[] charList = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J'};\n        for (int i = 1; i < 301; i++) {\n            int square =  i * i ;\n            String bin = binary(square, n);\n            //System.out.println(bin);\n            if (palsq(bin)){\n                System.out.println(binary(i,n) + \"" \"" + bin);\n            }\n        }\n\n    }\n\n}\n",PARTIAL_ACCEPTED,1037,12556
1314899685589958656,e1e5b82b1d61198e7376d4d64338249615623e6843cdde86e22cb3af01aa60aa,2020-10-10 20:04:49,Java,50.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\nimport java.util.Arrays;\nimport java.util.*;\n\npublic class Main {\n//    public static String binary(int n, int x){\n//        char[] charList = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J'};\n//        ArrayList<Integer> binary_ = new ArrayList<Integer>();\n//        while (true){\n//            int div =(int) n / x;\n//            int mod = n % x;\n//            binary_.add(mod);\n//            if (div==0)\n//                break;\n//            n = div;\n//        }\n//        Collections.reverse(binary_);\n//        StringBuilder numStr = new StringBuilder();\n//        for (int i = 0; i < binary_.size(); i++) {\n//            numStr.append(binary_.get(i));\n//        }\n//        return numStr.toString();\n//    }\n    public static boolean palsq(int num, int n){\n        String numStr = Integer.toString(num, n);\n        int len = numStr.length();\n        boolean flag = false;\n        if (len!=1){\n            for (int i = 0; i < (int)len/2; i++) {\n                if (numStr.charAt(i) == numStr.charAt(len-i-1)){\n                    flag = true;\n                }else {\n                    flag = false;\n                    break;\n                }\n            }\n        }\n        else{\n            flag = true;\n        }\n        return flag;\n    }\n\n    public static void main(String[] args) {\n        Scanner in = new Scanner(System.in);\n        String num_ = in.nextLine();\n        int n =  Integer.parseInt(num_);\n        for (int i = 1; i < 301; i++) {\n            int square =  i * i ;\n            if (palsq(square, n)){\n                System.out.println(Integer.toString(i, n) + \"" \"" + Integer.toString(square, n));\n            }\n        }\n\n    }\n\n}\n",PARTIAL_ACCEPTED,981,12132
1314899935041994752,e1e5b82b1d61198e7376d4d64338249615623e6843cdde86e22cb3af01aa60aa,2020-10-10 20:05:48,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\nimport java.util.Arrays;\nimport java.util.*;\n\npublic class Main {\n//    public static String binary(int n, int x){\n//        char[] charList = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J'};\n//        ArrayList<Integer> binary_ = new ArrayList<Integer>();\n//        while (true){\n//            int div =(int) n / x;\n//            int mod = n % x;\n//            binary_.add(mod);\n//            if (div==0)\n//                break;\n//            n = div;\n//        }\n//        Collections.reverse(binary_);\n//        StringBuilder numStr = new StringBuilder();\n//        for (int i = 0; i < binary_.size(); i++) {\n//            numStr.append(binary_.get(i));\n//        }\n//        return numStr.toString();\n//    }\n    public static boolean palsq(int num, int n){\n        String numStr = Integer.toString(num, n);\n        int len = numStr.length();\n        boolean flag = false;\n        if (len!=1){\n            for (int i = 0; i < (int)len/2; i++) {\n                if (numStr.charAt(i) == numStr.charAt(len-i-1)){\n                    flag = true;\n                }else {\n                    flag = false;\n                    break;\n                }\n            }\n        }\n        else{\n            flag = true;\n        }\n        return flag;\n    }\n\n    public static void main(String[] args) {\n        Scanner in = new Scanner(System.in);\n        String num_ = in.nextLine();\n        int n =  Integer.parseInt(num_);\n        for (int i = 1; i < 301; i++) {\n            int square =  i * i ;\n            if (palsq(square, n)){\n                System.out.println(Integer.toString(i, n).toUpperCase() + \"" \"" + Integer.toString(square, n).toUpperCase());\n            }\n        }\n\n    }\n\n}\n",ACCEPTED,1049,11380
1314905894581747712,e1e5b82b1d61198e7376d4d64338249615623e6843cdde86e22cb3af01aa60aa,2020-10-10 20:29:29,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\nimport java.util.Arrays;\nimport java.util.*;\n\npublic class Main {\n    public static boolean isPalSq(int num, int n){\n        String numStr = Integer.toString(num, n);\n        int len = numStr.length();\n        boolean flag = false;\n        if (len!=1){\n            for (int i = 0; i < (int)len/2; i++) {\n                if (numStr.charAt(i) == numStr.charAt(len-i-1)){\n                    flag = true;\n                }else {\n                    flag = false;\n                    break;\n                }\n            }\n        }\n        else{\n            flag = true;\n        }\n        return flag;\n    }\n\n    public static void main(String[] args) {\n        Scanner in = new Scanner(System.in);\n        String input = in.nextLine();\n        String[] tokens = input.split(\"" \"");\n        int num = Integer.parseInt(tokens[0]);\n        int max = Integer.parseInt(tokens[1]);\n        int count = 0, number = max + 1;\n        while (count < num){\n            int bincount = 0;\n            for (int i = 2; i < 11; i++) {\n                if (isPalSq(number,i)){\n                    bincount ++;\n                }\n            }\n            if (bincount>=2){\n                count ++;\n                System.out.println(number);\n            }\n            number ++;\n        }\n\n    }\n\n}\n",ACCEPTED,875,16128
1314920114102779904,e1e5b82b1d61198e7376d4d64338249615623e6843cdde86e22cb3af01aa60aa,2020-10-10 21:25:59,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\nimport java.util.Arrays;\nimport java.util.*;\n\npublic class Main {\n    public static class Farmer implements Comparable{\n        public int price;\n        public int number;\n\n        public Farmer(int price, int number) {\n            this.price = price;\n            this.number = number;\n        }\n\n        @Override\n        public int compareTo(Object o) {\n            if (o instanceof Farmer) {\n                Farmer s = (Farmer) o;\n                if (this.price > s.price) {\n                    return 1;\n                } else if (this.price == s.price) {\n                    return 0;\n                } else {\n                    return -1;\n                }\n            }\n            return 0;\n        }\n    }\n\n    public static void main(String[] args) {\n        Scanner in = new Scanner(System.in);\n        String input = in.nextLine();\n        String[] tokens = input.split(\"" \"");\n        int need = Integer.parseInt(tokens[0]);\n        int farmerNumber = Integer.parseInt(tokens[1]);\n        Farmer[] farmers = new Farmer[farmerNumber];\n        for (int i = 0; i < farmerNumber; i++) {\n            String input1 = in.nextLine();\n            String[] tokens1= input1.split(\"" \"");\n            int price = Integer.parseInt(tokens1[0]);\n            int number = Integer.parseInt(tokens1[1]);\n            Farmer farmer = new Farmer(price, number);\n            farmers[i]  = farmer;\n        }\n        Arrays.sort(farmers);\n\n        int money = 0;\n        for (Farmer farmer : farmers\n             ) {\n            if (need>0){\n                if (farmer.number <= need){\n                    need -= farmer.number;\n                    money += farmer.price * farmer.number;\n                }else if (farmer.number > need){\n                    money += need * farmer.price;\n                    need = 0;\n                }\n            }\n            else {\n                break;\n            }\n        }\n        System.out.println(money);\n\n    }\n\n}\n",WRONG_ANSWER,893,12208
1314950253909950464,1c0d553c3f42d01b3a33f2b0d4ebcbdc4288d22fd6d75d3a9bb77618858454c8,2020-10-10 23:25:45,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"package doublePalindromic;\n\nimport java.util.Scanner;\n\npublic class Main {\n\tstatic int n;\n\tstatic int S;\n\n\tpublic static void main(String[] args) {\n\t\tScanner console= new Scanner(System.in);\n\t\tn= console.nextInt();\n\t\tS= console.nextInt();\n\t\tint countNum= 0;\n\n\t\tfor(int i=S+1; ; i++) {\n\t\t\tif(countNum==n) return;\n\t\t\tboolean doubleSign1= false;\n\n\t\t\tfor(int r=2; r<=10; r++) {\n\t\t\t\tString iUnderR= Integer.toString(i, r);\n\t\t\t\tStringBuffer reUnderR= new StringBuffer(iUnderR);\n\t\t\t\tif(iUnderR.equals(reUnderR.reverse().toString())) {\n\t\t\t\t\tif(!doubleSign1) {\n\t\t\t\t\t\tdoubleSign1= true;\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tSystem.out.println(i);\n\t\t\t\t\t\tcountNum++;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\n\t}\n\t}\n}\n",WRONG_ANSWER,698,10252
1315131545356124160,67f4e3269b524926303e51f12e4c87a9bba053bc6c92d71e68e2db9238282124,2020-10-11 11:26:09,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\npublic class Main{\n\tprivate static Scanner s;\n\tpublic static void main(String args[]){\n\t\ts = new Scanner(System.in);\n\t\tint B,flag=1;\n\t\tB =s.nextInt();\n\t\tfor (int i=1;i<301;i++) {\n\t\t\tString s = change(i*i,B);\n\t\t\tfor (int j=0;j<s.length();j++) {\n\t\t\t\tif (s.charAt(j)!=s.charAt(s.length()-j-1))\n\t\t\t\t\t{flag = 0;break;}\n\t\t\t}\n\t\t\tif(flag==1) System.out.println(change(i,B)+\"" \""+s); \n\t\t\tflag=1;\n\t\t}\n\t}\n\tstatic String change(int a,int B) {\n\t\tString s= new String();\n\t\ts=\""\"";\n\t\tchar c;\n\t\twhile (a!=0) {\n\t\t\tint iSingle = a%B;\n\t\t\tif (iSingle>9) \tc = (char) (iSingle-10+'A');\n\t\t\telse c = (char) (iSingle +'0');\n\t\t\ta/=B;\n\t\t\ts=c+s;\n\t\t}\n\t\treturn s;\n\t}\n}\n",ACCEPTED,1048,12572
1315140054927851520,67f4e3269b524926303e51f12e4c87a9bba053bc6c92d71e68e2db9238282124,2020-10-11 11:59:57,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\npublic class Main {\n\tprivate static Scanner s;\n\tpublic static void main(String agrs[]) {\n\t\ts = new Scanner(System.in);\n\t\tint N,S;\n\t\tN=s.nextInt();\n\t\tS=s.nextInt();\n\t\tfor (int i=S+1;;i++) {\n\t\t\tint a = charge(i);\n\t\t\tif (a==1) {\n\t\t\t\t//System.out.println(i+\"":\""+a);\n\t\t\t\tSystem.out.println(i);\n\t\t\t\tN-=1;}\n\t\t\tif (N==0) break;\n\t\t}\n\t}\n\t\n\tstatic int charge(int a) {\n\t\t//System.out.println(\""---\"");\n\t\tint iCount=0, help=a,flag=1;\n\t\tchar c; String s =new String();\n\t\tfor (int B=2;B<11;B++) {\n\t\t\twhile (help!=0) { //a和help一定要注意不要打错了，否则陷入死循环\n\t\t\t\tint iSingle = help%B;\n\t\t\t\tif (iSingle>9) c = (char)(iSingle-10+'A');\n\t\t\t\telse c = (char)(iSingle+'0');\n\t\t\t\ts=c+s;\n\t\t\t\thelp/=B;\n\t\t\t}\n\t\t\tfor (int i=0;i<s.length()/2+1;i++) {\n\t\t\t\tif (s.charAt(i) != s.charAt(s.length()-1-i)) {flag=0;break;}\n\t\t\t}\n\t\t\tif (flag==1) {iCount+=1;}\n\t\t\tif (iCount>=2) return 1;\n\t\t\tflag=1;help=a;s=\""\"";\n\t\t}\t\t\n\t\treturn 0;\n\t}\n}\n",ACCEPTED,999,30332
1315202494822662144,5f71a9d5537f24730fd564649e838059c7274bb787bc8eac8c4cd5b14c9f623d,2020-10-11 16:08:04,Java,70.0,1306870976110592007,1267442030214471680,1049226397448056832,"\nimport java.util.*;\npublic class Main{\n\tstatic char[] a=new char[]{'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I'};\n\tpublic static String transfer(int n,int b) {\n\t\tint m=b;\n\t\tString s=\""\"";\n\t\twhile(m>0) {\n\t\t\ts=a[m%n]+s;\n\t\t\tm=m/n;\n\t\t}\n\t\treturn s;\n\t}\n\tpublic static String reverse(String s) {\n\n\t\t  return new StringBuffer(s).reverse().toString();\n\n\t\t}\n\tpublic static void main(String args[])  {\n\t\tScanner in=new Scanner(System.in);\n\t\tint n=in.nextInt();\n\t\tfor(int i=1;i<=300;i++) {\n\t\t\tString s=transfer(n,i*i);\n\t\t\ts=reverse(s);\n\t\t\tif(s.equals(transfer(n,i*i))) System.out.println(transfer(n,i)+\"" \""+transfer(n,i*i));\n\t\t}\n\t}\n}\n",PARTIAL_ACCEPTED,1026,12692
1315212586087399424,5f71a9d5537f24730fd564649e838059c7274bb787bc8eac8c4cd5b14c9f623d,2020-10-11 16:48:10,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"\nimport java.util.*;\npublic class Main{\n\tstatic char[] a=new char[]{'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\n\tpublic static String transfer(int n,int b) {\n\t\tint m=b;\n\t\tString s=\""\"";\n\t\twhile(m>0) {\n\t\t\ts=a[m%n]+s;\n\t\t\tm=m/n;\n\t\t}\n\t\treturn s;\n\t}\n\tpublic static String reverse(String s) {\n\n\t\t  return new StringBuffer(s).reverse().toString();\n\n\t\t}\n\tpublic static void main(String args[])  {\n\t\tScanner in=new Scanner(System.in);\n\t\tint n=in.nextInt();\n\t\tfor(int i=1;i<=300;i++) {\n\t\t\tString s=transfer(n,i*i);\n\t\t\ts=reverse(s);\n\t\t\tif(s.equals(transfer(n,i*i))) System.out.println(transfer(n,i)+\"" \""+transfer(n,i*i));\n\t\t}\n\t}\n}\n",ACCEPTED,1167,12768
1315212751674327040,9ff02a6da2d04fd8bb25c8491ce3fe160ee10145339d9c4b3d21b6a093505bfb,2020-10-11 16:48:50,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String []args) {\n\t\tScanner s=new Scanner(System.in);\n\t\tint A=s.nextInt();\n\t\tfor(int i=1;i<=300;i++) {\n\t\tStringBuffer s1=convert(i,A);\n\t\tStringBuffer s2=convert(i*i,A);\n\t\tif(isPalin(s2)) {\n\t\t\tSystem.out.println(s1+\"" \""+s2);\n\t\t}\n\t\t}\n\t\ts.close();\n\t\t\n\t}\n\tpublic  static StringBuffer convert(int num,int B) {\n        StringBuffer rtnval = new StringBuffer();\n        int digit;\n        while (num > 0) {\n            digit = num % B;\n            if (digit >= 10) {\n                rtnval.append((char) ('A' + digit - 10));\n            } else {\n                rtnval.append(digit);\n            }\n            num /= B;\n        }\n        return rtnval.reverse();\n    }\n\tpublic static boolean isPalin(StringBuffer s){\n        for (int i=0;i<s.length()/2;i++){\n            if(s.charAt(i)!=s.charAt(s.length()-i-1)){\n                return false;\n            }\n        }\n        return true;\n\t}\n\n}\n",ACCEPTED,1127,13256
1315219027502350336,5f71a9d5537f24730fd564649e838059c7274bb787bc8eac8c4cd5b14c9f623d,2020-10-11 17:13:46,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"\nimport java.util.*;\npublic class Main{\n\tstatic char[] a=new char[]{'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};\n\tpublic static String transfer(int n,int b) {\n\t\tint m=b;\n\t\tString s=\""\"";\n\t\twhile(m>0) {\n\t\t\ts=a[m%n]+s;\n\t\t\tm=m/n;\n\t\t}\n\t\treturn s;\n\t}\n\tpublic static boolean huiwen(String s) {\n\t\tint i=0,j=s.length()-1;\n\t\twhile(i<j) {\n\t\t\tif(s.charAt(i)!=(s.charAt(j))) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\ti++;j--;\n\t\t}\n\t\treturn true;\n\t}\n\tpublic static void main(String args[])  {\n\t\tScanner in=new Scanner(System.in);\n\t\tint N=in.nextInt();\n\t\tint s=in.nextInt();\n\t\tint m=0,i=s;\n\t\twhile (m<N) {\n\t\t\ti++;\n\t\t\tint n=0;\n\t\t\tfor(int j=2;j<=10;j++) {\n\t\t\t\tif(huiwen(transfer(j,i))==true) {\n\t\t\t\t\tn++;\n\t\t\t\t}\n\t\t\t\tif(n>=2) {\n\t\t\t\t\tSystem.out.println(i);\n\t\t\t\t\tm++;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n",ACCEPTED,968,31084
1315307045638684672,1c0d553c3f42d01b3a33f2b0d4ebcbdc4288d22fd6d75d3a9bb77618858454c8,2020-10-11 23:03:31,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        int n,s,count=0;\n        Scanner scanner = new Scanner(System.in);\n        n=scanner.nextInt();\n        s=scanner.nextInt();\n        int []num=new int[n];\n        for (int i = s+1;count<n;i++){\n            int temp=0;\n            for(int j = 2 ;j<=10;j++){\n                if(isPalin(convert(i,j))){\n                    temp++;\n                }\n                if(temp>=2){\n                    num[count]=i;\n                    count++;\n                    break;\n                }\n            }\n        }\n        for(int i = 0; i<num.length;i++){\n            System.out.println(num[i]);\n        }\n    }\n    public static boolean isPalin(StringBuffer s){\n        for (int i=0;i<s.length()/2;i++){\n            if(s.charAt(i)!=s.charAt(s.length()-i-1)){\n                return false;\n            }\n        }\n        return true;\n    }\n    public static StringBuffer convert(int num,int B) {\n        StringBuffer rtnval = new StringBuffer();\n        int digit;\n        while (num > 0) {\n            digit = num % B;\n            if (digit >= 10) {\n                rtnval.append((char) ('A' + digit - 10));\n            } else {\n                rtnval.append(digit);\n            }\n            num /= B;\n        }\n        return rtnval.reverse();\n    }\n}\n",ACCEPTED,954,14504
1315312411428569088,e74368f99722a7aeb909d668663272951cbc6f6ee90e4273cd1caf0c446a1690,2020-10-11 23:24:50,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n    public static boolean Palin_num(String a){\n        int length=a.length();\n        int flag=1;\n        for(int i=0;i<=(length/2);i++){\n            if(a.charAt(i)!=a.charAt(length-i-1)){\n                flag=0;\n                break;\n            }\n        }\n        if(flag==1){\n            return true;\n        }\n        return false;\n    }\n\n    public static String intToA(int n, int radix){\n        String ans=\""\"";\n        do{\n            int t=n%radix;\n            if(t>=0&&t<=9){\n                ans+=(char)t+'0';\n            }\n            else{\n                ans+=(char)(t-10)+'A';\n            }\n            n/=radix;\n        }while(n!=0);\n        return new StringBuffer(ans).reverse().toString();\n    }\n\n    public static void main(String[] args) {\n        Scanner sc=new Scanner(System.in);\n        int n=sc.nextInt();\n        int j=0;\n        for(int x=1;x<=300;x++){\n            j=x;\n            String s1=intToA(j,n);\n            String s2=intToA(j*j,n);\n            if(Palin_num(s2)){\n                System.out.println(s1+\"" \""+s2);\n            }\n            else{\n                continue;\n            }\n        }\n    }\n\n}\n",WRONG_ANSWER,1104,13768
1315313850733346816,e74368f99722a7aeb909d668663272951cbc6f6ee90e4273cd1caf0c446a1690,2020-10-11 23:30:33,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n    public static boolean Palin_num(String a){\n        int length=a.length();\n        int flag=1;\n        for(int i=0;i<=(length/2);i++){\n            if(a.charAt(i)!=a.charAt(length-i-1)){\n                flag=0;\n                break;\n            }\n        }\n        if(flag==1){\n            return true;\n        }\n        else{\n            return false;\n        }\n    }\n\n    public static String intToA(int n, int radix){\n        String ans=\""\"";\n        do{\n            int t=n%radix;\n            if(t>=0&&t<=9){\n                ans+=(char)(t+'0');\n            }\n            else{\n                ans+=(char)(t-10+'A');\n            }\n            n/=radix;\n        }while(n!=0);\n        return new StringBuffer(ans).reverse().toString();\n    }\n\n    public static void main(String[] args) {\n        Scanner sc=new Scanner(System.in);\n        int n=sc.nextInt();\n        int j=0;\n        for(int x=1;x<=300;x++){\n            j=x;\n            String s1=intToA(j,n);\n            String s2=intToA(j*j,n);\n            if(Palin_num(s2)){\n                System.out.println(s1+\"" \""+s2);\n            }\n            else{\n                continue;\n            }\n        }\n    }\n\n}",ACCEPTED,1003,12356
1315316652582944768,fdbca684c22ef228dd6668184c911846287860d1733104734c3d0653a3d045cc,2020-10-11 23:41:42,Java,10.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.ArrayList;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tArrayList<Integer> list = new ArrayList<Integer>();\n\t\tint N=sc.nextInt(), S=sc.nextInt();\n\t\twhile(list.size()<N)\n\t\t{\n\t\t\tS++;\n\t\t\tif(isDoublePalindromes(S))\n\t\t\t\tlist.add(S);\n\t\t}\n\t\tfor(int i=0; i<list.size(); i++)\n\t\t\tSystem.out.println(list.get(i));\n\t\tsc.close();\n\t}\n\n\tpublic static boolean isDoublePalindromes(int num) {\n\t\tfor(int i=2; i<11; i++)\n\t\t{\n\t\t\tString str = radix_change(num, i);\n\t\t\tif(Palindrome_number(str))\n\t\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}\n\tpublic static String radix_change(int a, int b)\n\t{\n\t\t  if (a == 0)\n\t\t    return \""\"";\n\t\t  else\n\t\t    return radix_change(a/b, b)+a%b;\n\t}\n\t\n\tpublic static boolean Palindrome_number(String a)\n\t{\n\t\tStringBuffer temp = new StringBuffer();\n\t\ttemp.append(a);\n\t\tif (a.equals(temp.reverse().toString()))\n\t\t    return true;\n\t\telse\n\t\t    return false;\n\t}\n}\n",PARTIAL_ACCEPTED,912,13068
1315317506341912576,fdbca684c22ef228dd6668184c911846287860d1733104734c3d0653a3d045cc,2020-10-11 23:45:05,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.ArrayList;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tArrayList<Integer> list = new ArrayList<Integer>();\n\t\tint N=sc.nextInt(), S=sc.nextInt();\n\t\twhile(list.size()<N)\n\t\t{\n\t\t\tS++;\n\t\t\tif(isDoublePalindromes(S))\n\t\t\t\tlist.add(S);\n\t\t}\n\t\tfor(int i=0; i<list.size(); i++)\n\t\t\tSystem.out.println(list.get(i));\n\t\tsc.close();\n\t}\n\tpublic static boolean isDoublePalindromes(int num) {\n\t\tfor(int i=2, x=0; i<11; i++)\n\t\t{\n\t\t\tString str = radix_change(num, i);\n\t\t\tif(Palindrome_number(str))\n\t\t\t\tx++;\n\t\t\tif(x==2)\n\t\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}\n\tpublic static String radix_change(int a, int b)\n\t{\n\t\t  if (a == 0)\n\t\t    return \""\"";\n\t\t  else\n\t\t    return radix_change(a/b, b)+a%b;\n\t}\n\t\n\tpublic static boolean Palindrome_number(String a)\n\t{\n\t\tStringBuffer temp = new StringBuffer();\n\t\ttemp.append(a);\n\t\tif (a.equals(temp.reverse().toString()))\n\t\t    return true;\n\t\telse\n\t\t    return false;\n\t}\n}\n",ACCEPTED,1120,38104
1315627835546451968,63c02cf9aaab363d70ce1594832718fc3fbac5bf01e67c41b04c5e130669b4e1,2020-10-12 20:18:13,Java,10.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner s=new Scanner(System.in);\n\t\tint n=s.nextInt();\n\t\tint a[]=new int[301];\n\t\tint b[]=new int[301];\n\t\tfor(int i=1;i<=300;i++)\n\t\t{\n\t\t\ta[i]=i;\n\t\t}\n\t\tfor(int i=1;i<=300;i++)\n\t\t{\n\t\t\tb[i]=i*i;\n\t\t}\n\t\tfor(int i=1;i<=300;i++)\n\t\t{\n\t\t\tString str = Integer.toString(b[i],n);\n\t\t\tint flag=0;\n\t\t\tStringBuffer s2 = new StringBuffer(str);\n\t\t\ts2.reverse();\n\t\t\tString s3=s2.toString();\n\t\t\tif(s3.equals(str))\n\t\t\t{\n\t\t\t\tflag=1;\n\t\t\t}\n\t\t\tif(flag==1)\n\t\t\t{\n\t\t\t\tSystem.out.println(i+\"" \""+str);\n\t\t\t}\n\t\t}\n\t\t}\n}",PARTIAL_ACCEPTED,1120,14120
1315628153361448960,63c02cf9aaab363d70ce1594832718fc3fbac5bf01e67c41b04c5e130669b4e1,2020-10-12 20:19:29,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner s=new Scanner(System.in);\n\t\tint n=s.nextInt();\n\t\tint a[]=new int[301];\n\t\tint b[]=new int[301];\n\t\tfor(int i=1;i<=300;i++)\n\t\t{\n\t\t\ta[i]=i;\n\t\t}\n\t\tfor(int i=1;i<=300;i++)\n\t\t{\n\t\t\tb[i]=i*i;\n\t\t}\n\t\tfor(int i=1;i<=300;i++)\n\t\t{\n\t\t\tString x = Integer.toString(b[i],n);\n\t\t\tString str = Integer.toString(b[i],n);\n\t\t\tint flag=0;\n\t\t\tStringBuffer s2 = new StringBuffer(str);\n\t\t\ts2.reverse();\n\t\t\tString s3=s2.toString();\n\t\t\tif(s3.equals(str))\n\t\t\t{\n\t\t\t\tflag=1;\n\t\t\t}\n\t\t\tif(flag==1)\n\t\t\t{\n\t\t\t\tSystem.out.println(x+\"" \""+str);\n\t\t\t}\n\t\t}\n\t\t}\n}",WRONG_ANSWER,1101,14212
1315628237146865664,63c02cf9aaab363d70ce1594832718fc3fbac5bf01e67c41b04c5e130669b4e1,2020-10-12 20:19:49,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner s=new Scanner(System.in);\n\t\tint n=s.nextInt();\n\t\tint a[]=new int[301];\n\t\tint b[]=new int[301];\n\t\tfor(int i=1;i<=300;i++)\n\t\t{\n\t\t\ta[i]=i;\n\t\t}\n\t\tfor(int i=1;i<=300;i++)\n\t\t{\n\t\t\tb[i]=i*i;\n\t\t}\n\t\tfor(int i=1;i<=300;i++)\n\t\t{\n\t\t\tString x = Integer.toString(b[i],n);\n\t\t\tString str = Integer.toString(b[i],n);\n\t\t\tint flag=0;\n\t\t\tStringBuffer s2 = new StringBuffer(str);\n\t\t\ts2.reverse();\n\t\t\tString s3=s2.toString();\n\t\t\tif(s3.equals(str))\n\t\t\t{\n\t\t\t\tflag=1;\n\t\t\t}\n\t\t\tif(flag==1)\n\t\t\t{\n\t\t\t\tSystem.out.println(x+\"" \""+str);\n\t\t\t}\n\t\t}\n\t\t}\n}",WRONG_ANSWER,1012,14412
1315628428180635648,63c02cf9aaab363d70ce1594832718fc3fbac5bf01e67c41b04c5e130669b4e1,2020-10-12 20:20:35,Java,50.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner s=new Scanner(System.in);\n\t\tint n=s.nextInt();\n\t\tint a[]=new int[301];\n\t\tint b[]=new int[301];\n\t\tfor(int i=1;i<=300;i++)\n\t\t{\n\t\t\ta[i]=i;\n\t\t}\n\t\tfor(int i=1;i<=300;i++)\n\t\t{\n\t\t\tb[i]=i*i;\n\t\t}\n\t\tfor(int i=1;i<=300;i++)\n\t\t{\n\t\t\tString x = Integer.toString(a[i],n);\n\t\t\tString str = Integer.toString(b[i],n);\n\t\t\tint flag=0;\n\t\t\tStringBuffer s2 = new StringBuffer(str);\n\t\t\ts2.reverse();\n\t\t\tString s3=s2.toString();\n\t\t\tif(s3.equals(str))\n\t\t\t{\n\t\t\t\tflag=1;\n\t\t\t}\n\t\t\tif(flag==1)\n\t\t\t{\n\t\t\t\tSystem.out.println(x+\"" \""+str);\n\t\t\t}\n\t\t}\n\t\t}\n}",PARTIAL_ACCEPTED,1126,14272
1315629303301193728,63c02cf9aaab363d70ce1594832718fc3fbac5bf01e67c41b04c5e130669b4e1,2020-10-12 20:24:03,Java,50.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner s=new Scanner(System.in);\n\t\tint n=s.nextInt();\n\t\tint a[]=new int[301];\n\t\tint b[]=new int[301];\n\t\tfor(int i=1;i<=300;i++)\n\t\t{\n\t\t\ta[i]=i;\n\t\t}\n\t\tfor(int i=1;i<=300;i++)\n\t\t{\n\t\t\tb[i]=i*i;\n\t\t}\n\t\tfor(int i=1;i<=300;i++)\n\t\t{\n\t\t\tString x = Integer.toString(a[i],n);\n\t\t\tString str = Integer.toString(b[i],n);\n\t\t\tint flag=0;\n\t\t\tStringBuffer s2 = new StringBuffer(str);\n\t\t\ts2.reverse();\n\t\t\tString s3=s2.toString();\n\t\t\tif(s3.equals(str))\n\t\t\t{\n\t\t\t\tflag=1;\n\t\t\t}\n\t\t\tif(flag==1)\n\t\t\t{\n\t\t\t\tSystem.out.println(x+\"" \""+str);\n\t\t\t}\n\t\t}\n\t\t}\n}",PARTIAL_ACCEPTED,1164,14300
1315629666616000512,63c02cf9aaab363d70ce1594832718fc3fbac5bf01e67c41b04c5e130669b4e1,2020-10-12 20:25:30,Java,50.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner s=new Scanner(System.in);\n\t\tint n=s.nextInt();\n\t\tint a[]=new int[301];\n\t\tint b[]=new int[301];\n\t\tfor(int i=1;i<=300;i++)\n\t\t{\n\t\t\ta[i]=i;\n\t\t}\n\t\tfor(int i=1;i<=300;i++)\n\t\t{\n\t\t\tb[i]=i*i;\n\t\t}\n\t\tfor(int i=1;i<=300;i++)\n\t\t{\n\t\t\tString x = Integer.toString(a[i],n);\n\t\t\tString str = Integer.toString(b[i],n);\n\t\t\tStringBuffer s2 = new StringBuffer(str);\n\t\t\ts2.reverse();\n\t\t\tString s3=s2.toString();\n\t\t\tif(s3.equals(str))\n\t\t\t{\n\t\t\t\tSystem.out.println(x+\"" \""+str);\n\t\t\t}\n\t\t}\n\t\t}\n}",PARTIAL_ACCEPTED,1104,14204
1315635539543375872,63c02cf9aaab363d70ce1594832718fc3fbac5bf01e67c41b04c5e130669b4e1,2020-10-12 20:48:50,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.*;\npublic class Main {\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner s=new Scanner(System.in);\n\t\tint n=s.nextInt();\n\t\tint a[]=new int[301];\n\t\tint b[]=new int[301];\n\t\tfor(int i=1;i<=300;i++)\n\t\t{\n\t\t\ta[i]=i;\n\t\t}\n\t\tfor(int i=1;i<=300;i++)\n\t\t{\n\t\t\tb[i]=i*i;\n\t\t}\n\t\tfor(int i=1;i<=300;i++)\n\t\t{\n\t\t\tString x = Integer.toString(a[i],n);\n\t\t\tString str = Integer.toString(b[i],n);\n\t\t\tStringBuffer s2 = new StringBuffer(str);\n\t\t\ts2.reverse();\n\t\t\tString s3=s2.toString();\n\t\t\tif(s3.equals(str))\n\t\t\t{\n\t\t\t\tSystem.out.println(x.toUpperCase()+\"" \""+str.toUpperCase());\n\t\t\t}\n\t\t}\n\t\t}\n}\n",ACCEPTED,1130,14284
1315682042114785280,ad541af9f92c09f02731fc16da2169e1a8d82f2ad151f3118ff01f0e69dd3f51,2020-10-12 23:53:37,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t int n,s,count=0;\n\t        Scanner scanner = new Scanner(System.in);\n\t        n=scanner.nextInt();\n\t        s=scanner.nextInt();\n\t        int []num=new int[n];\n\t        for (int i = s+1;count<n;i++){\n\t            int temp=0;\n\t            for(int j = 2 ;j<=10;j++){\n\t                if(isPalin(convert(i,j))){\n\t                    temp++;\n\t                }\n\t                if(temp>=2){\n\t                    num[count]=i;\n\t                    count++;\n\t                    break;\n\t                }\n\t            }\n\t        }\n\t        for(int i = 0; i<num.length;i++){\n\t            System.out.println(num[i]);\n\t        }\n\t    }\n\t    public static boolean isPalin(StringBuffer s){\n\t        for (int i=0;i<s.length()/2;i++){\n\t            if(s.charAt(i)!=s.charAt(s.length()-i-1)){\n\t                return false;\n\t            }\n\t        }\n\t        return true;\n\t    }\n\t    public static StringBuffer convert(int num,int B) {\n\t        StringBuffer rtnval = new StringBuffer();\n\t        int digit;\n\t        while (num > 0) {\n\t            digit = num % B;\n\t            if (digit >= 10) {\n\t                rtnval.append((char) ('A' + digit - 10));\n\t            } else {\n\t                rtnval.append(digit);\n\t            }\n\t            num /= B;\n\t        }\n\t        return rtnval.reverse();\n\t    }\n\t}\n",ACCEPTED,1032,17372
1315996036901945344,dbdee02c4509ab7a1fd578907c2d4a0dc00c446ff84739560caf0298cf21d497,2020-10-13 20:41:19,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"package code0103;\n\n\n\nimport java.util.Scanner;\nimport java.util.Arrays;\n\n\n\npublic class Main {\n\tstatic char a[]=new char[1000];\n\tstatic char b[]=new char[1000];\n    static void chang1(int i,int B)\n    {   boolean result;\n    \tint x=0;int c;\n    \twhile(result=(i==0)?false:true)\n    \t{\n    \t\tc=i%B;\n    \t\ti=i/B;\n    \t\tString str=String.valueOf(c);\n    \t\tchar t=str.charAt(0);\n    \t\tif(c>=10)\n    \t\t\ta[x]=(char) (t+'A'-10);\n    \t\telse\n    \t\t\ta[x]=(char) (t+'0');\n    \t\tx++;\n    \t}\n    }\n    static void chang2(long ii,int B)\n    {   boolean result;\n    \tint x=0;int c;\n    \twhile(result=(ii==0)?false:true)\n    \t{\n    \t\tc=(int)ii%B;\n    \t\tii=ii/B;\n    \t\tif(c>=10)\n    \t\t\tb[x]=(char) (c+'A'-10);\n    \t\telse\n    \t\t\tb[x]=(char) (c+'0');\n    \t\tx++;\n    \t}\n    }\n    static boolean  palin()\n    {\n    \tint len = 0;\n    \tfor (int i = 0; i < a.length; i++) {\n    \tif (a[i] != '\\u0000') {\n    \tlen++;\n    \tcontinue;\n    \t}}\n    \tint j,k;\n    \tfor(j=0,k=(len-1);j<=k;j++,k--)\n    \t{\n    \t\tif(b[j]!=b[k])\n    \t\t\treturn false;\n    \t}\n    \treturn true;\n    }\n    public static void main(String[] args){\n    \tScanner scan=new Scanner(System.in);\n    \tint B=scan.nextInt();\n    \tfor(int i=1;i<=300;i++)\n    \t{\n    \t\tlong ii=i*i;\n    \t\tchang1(i,B);\n    \t\tchang2(ii,B);\n    \t\tif(palin())\n    \t\t{\n    \t\t\tint lena=0;\n    \t\t\tfor(int j=0;j<a.length;j++)\n    \t\t\t{\n    \t\t\t\tif(a[j]!='\\u0000')\n    \t\t\t\t\tlena++;\n    \t\t\t\tcontinue;\n    \t\t\t}\n    \t\t\tfor(int m=(lena-1);m>=0;m--)\n    \t\t\t{\n    \t\t\t\tSystem.out.print((int)a[m]);\n    \t\t\t}\n    \t\t\tSystem.out.print(\"" \"");\n    \t\t\tint lenb=0;\n    \t\t\tfor(int j=0;j<b.length;j++)\n    \t\t\t{\n    \t\t\t\tif(b[j]!='\\u0000')\n    \t\t\t\t\tlenb++;\n    \t\t\t\tcontinue;\n    \t\t\t}\n    \t\t\tfor(int m=(lenb-1);m>=0;m--)\n    \t\t\t{\n    \t\t\t\tSystem.out.print((int)b[m]);\n    \t\t\t}\n    \t\t\tSystem.out.print(\""\\n\"");\n    \t\t}\n    \t\t\n    \t}\n\n    }\n   \n}",WRONG_ANSWER,922,13056
1315996090169606144,dbdee02c4509ab7a1fd578907c2d4a0dc00c446ff84739560caf0298cf21d497,2020-10-13 20:41:32,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"\n\n\nimport java.util.Scanner;\nimport java.util.Arrays;\n\n\n\npublic class Main {\n\tstatic char a[]=new char[1000];\n\tstatic char b[]=new char[1000];\n    static void chang1(int i,int B)\n    {   boolean result;\n    \tint x=0;int c;\n    \twhile(result=(i==0)?false:true)\n    \t{\n    \t\tc=i%B;\n    \t\ti=i/B;\n    \t\tString str=String.valueOf(c);\n    \t\tchar t=str.charAt(0);\n    \t\tif(c>=10)\n    \t\t\ta[x]=(char) (t+'A'-10);\n    \t\telse\n    \t\t\ta[x]=(char) (t+'0');\n    \t\tx++;\n    \t}\n    }\n    static void chang2(long ii,int B)\n    {   boolean result;\n    \tint x=0;int c;\n    \twhile(result=(ii==0)?false:true)\n    \t{\n    \t\tc=(int)ii%B;\n    \t\tii=ii/B;\n    \t\tif(c>=10)\n    \t\t\tb[x]=(char) (c+'A'-10);\n    \t\telse\n    \t\t\tb[x]=(char) (c+'0');\n    \t\tx++;\n    \t}\n    }\n    static boolean  palin()\n    {\n    \tint len = 0;\n    \tfor (int i = 0; i < a.length; i++) {\n    \tif (a[i] != '\\u0000') {\n    \tlen++;\n    \tcontinue;\n    \t}}\n    \tint j,k;\n    \tfor(j=0,k=(len-1);j<=k;j++,k--)\n    \t{\n    \t\tif(b[j]!=b[k])\n    \t\t\treturn false;\n    \t}\n    \treturn true;\n    }\n    public static void main(String[] args){\n    \tScanner scan=new Scanner(System.in);\n    \tint B=scan.nextInt();\n    \tfor(int i=1;i<=300;i++)\n    \t{\n    \t\tlong ii=i*i;\n    \t\tchang1(i,B);\n    \t\tchang2(ii,B);\n    \t\tif(palin())\n    \t\t{\n    \t\t\tint lena=0;\n    \t\t\tfor(int j=0;j<a.length;j++)\n    \t\t\t{\n    \t\t\t\tif(a[j]!='\\u0000')\n    \t\t\t\t\tlena++;\n    \t\t\t\tcontinue;\n    \t\t\t}\n    \t\t\tfor(int m=(lena-1);m>=0;m--)\n    \t\t\t{\n    \t\t\t\tSystem.out.print((int)a[m]);\n    \t\t\t}\n    \t\t\tSystem.out.print(\"" \"");\n    \t\t\tint lenb=0;\n    \t\t\tfor(int j=0;j<b.length;j++)\n    \t\t\t{\n    \t\t\t\tif(b[j]!='\\u0000')\n    \t\t\t\t\tlenb++;\n    \t\t\t\tcontinue;\n    \t\t\t}\n    \t\t\tfor(int m=(lenb-1);m>=0;m--)\n    \t\t\t{\n    \t\t\t\tSystem.out.print((int)b[m]);\n    \t\t\t}\n    \t\t\tSystem.out.print(\""\\n\"");\n    \t\t}\n    \t\t\n    \t}\n\n    }\n   \n}",WRONG_ANSWER,1265,16580
1316333239901405184,4a56193e4e3aef88687c4b59a91d8be77df2f76f9682cde0c0a70959b66497ce,2020-10-14 19:01:15,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"\nimport java.util.Scanner;\n\npublic class Main {\n\tstatic int B;\n\tstatic int a[]=new int [20];\n\tpublic static void main(String[] args) {\n\t\tScanner in=new Scanner(System.in);\n\t\tB=in.nextInt();\n\t\tfor(int i=1;i<=300;i++) {\n\t\t\tif(calc(i)) {\n\t\t\t\touts(i);\n\t\t\t\tSystem.out.print(\"" \"");\n\t\t\t\touts(i*i);\n\t\t\t\tSystem.out.println();\n\t\t\t}\n\t\t}\n\t}\n\tpublic static void outs(int x) {\n\t\tint np=0;\n\t    while(x!=0)\n\t    {\n\t        a[++np]=x%B;\n\t        x/=B;\n\t    }\n\t    for(int i=np;i>=1;i--)\n\t    {\n\t        if(a[i]>9) {\n\t        \tint y=a[i]-10+65;\n\t        \tchar a=(char) y;\n\t        \tSystem.out.print(a);\n\t        }\n\t        else {\n\t        \tSystem.out.print(a[i]);\n\t        }\n\t    }\n\t}\n\tpublic static boolean calc(int x)//不存在0我就懒得考虑了 \n\t{\n\t    int np=0;\n\t    x=x*x;\n\t    while(x!=0)\n\t    {\n\t        a[++np]=x%B;\n\t        x/=B;\n\t    }\n\t    for(int i=1,j=np;i<j;i++,j--)\n\t        if(a[i]!=a[j])\n\t            return false;\n\t    return true;\n\t}\n}",ACCEPTED,1085,14244
1316358366424776704,1c0d553c3f42d01b3a33f2b0d4ebcbdc4288d22fd6d75d3a9bb77618858454c8,2020-10-14 20:41:05,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.*;\npublic class Main {\n\t\n\t\tprivate static void show(int a) {\n\t\t\tfor(int i = 1;i <= 300;i++){\n\t\t\t\tint n = i * i;\n\t\t\t\tStringBuffer num = new StringBuffer();\n\t\t\t\tStringBuffer square = new StringBuffer();\n\t\t\t\tnum = convert(i,a);\n\t\t\t\tsquare = convert(n,a);\n\t\t\t\tif(ispalindrom(square)){\n\t\t\t\t\tSystem.out.println(num.reverse()+\""  \""+square);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tprivate static StringBuffer convert(int n, int a) {\n\t\t\tStringBuffer val = new StringBuffer();\n\t\t\tint m;\n\t\t\twhile(n > 0){\n\t\t\t\tm = n % a;\n\t\t\t\tif(m >= 10){\n\t\t\t\t\tval.append((char)('A'+m - 10));\n\t\t\t\t}else{\n\t\t\t\t\tval.append(m);\n\t\t\t\t}\n\t\t\t\tn /= a;\n\t\t\t}\n\t\t\treturn val;\n\t\t}\n\t\tprivate static boolean ispalindrom(StringBuffer x) {\n\t\t\tString s = new String(x);\n\t\t\tchar ch[] = s.toCharArray();\n\t\t\tint len = ch.length;\n\t\t\tfor(int i = 0;i < len / 2;i++){\n\t\t\t\tif(ch[i] != ch[len - i - 1]){\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\t\tpublic static void main(String[] args) {\n\t\t\tScanner cin = new Scanner(System.in);\n\t\t\tint A = cin.nextInt();\n\t\t\tshow(A);\n\t\t}\n\t}\n",PRESENTATION_ERROR,1036,14416
1316358536457666560,1c0d553c3f42d01b3a33f2b0d4ebcbdc4288d22fd6d75d3a9bb77618858454c8,2020-10-14 20:41:46,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.*;\npublic class Main {\n\t\n\t\tprivate static void show(int a) {\n\t\t\tfor(int i = 1;i <= 300;i++){\n\t\t\t\tint n = i * i;\n\t\t\t\tStringBuffer num = new StringBuffer();\n\t\t\t\tStringBuffer square = new StringBuffer();\n\t\t\t\tnum = convert(i,a);\n\t\t\t\tsquare = convert(n,a);\n\t\t\t\tif(ispalindrom(square)){\n\t\t\t\t\tSystem.out.println(num.reverse()+\"" \""+square);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tprivate static StringBuffer convert(int n, int a) {\n\t\t\tStringBuffer val = new StringBuffer();\n\t\t\tint m;\n\t\t\twhile(n > 0){\n\t\t\t\tm = n % a;\n\t\t\t\tif(m >= 10){\n\t\t\t\t\tval.append((char)('A'+m - 10));\n\t\t\t\t}else{\n\t\t\t\t\tval.append(m);\n\t\t\t\t}\n\t\t\t\tn /= a;\n\t\t\t}\n\t\t\treturn val;\n\t\t}\n\t\tprivate static boolean ispalindrom(StringBuffer x) {\n\t\t\tString s = new String(x);\n\t\t\tchar ch[] = s.toCharArray();\n\t\t\tint len = ch.length;\n\t\t\tfor(int i = 0;i < len / 2;i++){\n\t\t\t\tif(ch[i] != ch[len - i - 1]){\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\t\tpublic static void main(String[] args) {\n\t\t\tScanner cin = new Scanner(System.in);\n\t\t\tint A = cin.nextInt();\n\t\t\tshow(A);\n\t\t}\n\t}\n",ACCEPTED,1078,14516
1316381619151224832,9ff02a6da2d04fd8bb25c8491ce3fe160ee10145339d9c4b3d21b6a093505bfb,2020-10-14 22:13:29,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"public class Main {\n\tpublic static void main(String []args) {\n\t\tScanner s=new Scanner(System.in);\n\t\tint num1=s.nextInt();\n\t\t//s.nextLine();\n\t\tint num2=s.nextInt();\n\t\tint count=0;\n\t\t\n\t\tfor(int i=num2+1;count<=num1;i++) {\t\t\t\n\t\tint count2=0;\n\t\t\tfor(int j=2;j<=10;j++) {\n\t\t\t\tFangfa f=new Fangfa(i,j);\n\t\t\t\tf.ss();\n\t\t\t\tif(f.judge()) {\n\t\t\t\t\tcount2++;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t}\n\t\t\t\tif(count2>2) {\n\t\t\t\t\tSystem.out.println(i);\n\t\t\t\t\ts.nextLine();\n\t\t\t\t\tcount++;\n\t\t\t\t\t\n\t\t\t}\n\t\t}\n\t\ts.close();\n\t\t\n\t\t}\n\n\n}\nclass Fangfa{\n\tpublic StringBuffer sh=new StringBuffer();\n\tpublic int num;\n\tpublic int radix;\n\tFangfa(int num1,int radix1){\n\t\tthis.num=num1;\n\t\tthis.radix=radix1;\n\t}\n\t\tpublic  StringBuffer ss() {\t\n\t\twhile(num==0) {\n\t\tsh.append(num%radix);\n\t\tnum/=radix;\n\t\t}\n\t\treturn \tsh.reverse();\n\t}\n\tpublic boolean judge() {\n\t\tfor(int i=0;i<sh.length()/2;i++) {\n\t\t\tif(sh.charAt(i)!=sh.charAt(sh.length()-1-i))\n\t\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n\t\n}\n",COMPILE_ERROR,0,0
1316392137630990336,e74368f99722a7aeb909d668663272951cbc6f6ee90e4273cd1caf0c446a1690,2020-10-14 22:55:17,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,import java.util.Scanner;\n\n/**\n * @author Csc\n */\npublic class Ques9 {\n    static int sum=0;\n    static int[] a;\n    static int k=0;\n    static int basement=0;\n    static int jin=0;\n    static void change(int n){\n        basement=0;\n        while(n!=0){\n            a[basement]=n%jin;\n            n/=jin;\n            basement++;\n        }\n        return;\n    }\n    public static void main(String[] args) {\n        Scanner sc=new Scanner(System.in);\n        int n;\n        sum=sc.nextInt();\n        n= sc.nextInt();\n        boolean tf=false;\n        int cnt=0;\n        int cnt2=n+1;\n        while(cnt<sum){\n            int cnt3=0;\n            for(int i=2;i<10;i++){\n                a=new int[100];\n                jin=i;\n                change(cnt2);\n                tf=false;\n                for(int j=0;j<basement;j++){\n                    if(a[j]!=a[basement-1-j]){\n                        tf=true;\n                    }\n                }\n                if(tf==false){\n                    if(cnt3==1){\n                        System.out.println(cnt2);\n                        cnt++;\n                        break;\n                    }else{\n                        cnt3++;\n                    }\n                }\n            }\n            cnt2++;\n        }\n    }\n},COMPILE_ERROR,0,0
1316392193226489856,e74368f99722a7aeb909d668663272951cbc6f6ee90e4273cd1caf0c446a1690,2020-10-14 22:55:30,Java,40.0,1306870976110592008,1267449136707624960,1049226397448056832,import java.util.Scanner;\n\n/**\n * @author Csc\n */\npublic class Main {\n    static int sum=0;\n    static int[] a;\n    static int k=0;\n    static int basement=0;\n    static int jin=0;\n    static void change(int n){\n        basement=0;\n        while(n!=0){\n            a[basement]=n%jin;\n            n/=jin;\n            basement++;\n        }\n        return;\n    }\n    public static void main(String[] args) {\n        Scanner sc=new Scanner(System.in);\n        int n;\n        sum=sc.nextInt();\n        n= sc.nextInt();\n        boolean tf=false;\n        int cnt=0;\n        int cnt2=n+1;\n        while(cnt<sum){\n            int cnt3=0;\n            for(int i=2;i<10;i++){\n                a=new int[100];\n                jin=i;\n                change(cnt2);\n                tf=false;\n                for(int j=0;j<basement;j++){\n                    if(a[j]!=a[basement-1-j]){\n                        tf=true;\n                    }\n                }\n                if(tf==false){\n                    if(cnt3==1){\n                        System.out.println(cnt2);\n                        cnt++;\n                        break;\n                    }else{\n                        cnt3++;\n                    }\n                }\n            }\n            cnt2++;\n        }\n    }\n},PARTIAL_ACCEPTED,991,21724
1316392594743017472,e74368f99722a7aeb909d668663272951cbc6f6ee90e4273cd1caf0c446a1690,2020-10-14 22:57:06,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,import java.util.Scanner;\n\n/**\n * @author Csc\n */\npublic class Main {\n    static int sum=0;\n    static int[] a;\n    static int k=0;\n    static int basement=0;\n    static int jin=0;\n    static void change(int n){\n        basement=0;\n        while(n!=0){\n            a[basement]=n%jin;\n            n/=jin;\n            basement++;\n        }\n        return;\n    }\n    public static void main(String[] args) {\n        Scanner sc=new Scanner(System.in);\n        int n;\n        sum=sc.nextInt();\n        n= sc.nextInt();\n        boolean tf=false;\n        int cnt=0;\n        int cnt2=n+1;\n        while(cnt<sum){\n            int cnt3=0;\n            for(int i=2;i<=10;i++){\n                a=new int[100];\n                jin=i;\n                change(cnt2);\n                tf=false;\n                for(int j=0;j<basement;j++){\n                    if(a[j]!=a[basement-1-j]){\n                        tf=true;\n                    }\n                }\n                if(tf==false){\n                    if(cnt3==1){\n                        System.out.println(cnt2);\n                        cnt++;\n                        break;\n                    }else{\n                        cnt3++;\n                    }\n                }\n            }\n            cnt2++;\n        }\n    }\n},ACCEPTED,1020,23016
1316559837321805824,f31082d427a93a58b9a4029d36bf21b049ab69fed573c687789cf8faaa7d93ba,2020-10-15 10:01:40,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class main {\n\tpublic static void main(String[] args) {\n\t\tScanner input= new Scanner(System.in);\n\t\tint B = input.nextInt();\n\t\tfor(int i = 1;i<=300;i++) {\n\t\t\tif(isPalindrome(i*i,B)) {\n\t\t\t\ttrans(i,B);\n\t\t\t\tSystem.out.print(\"" \"");\n\t\t\t\ttrans(i*i,B);\n\t\t\t\tSystem.out.print(\""\\n\"");\n\t\t\t}\n\t\t}\n}\n\tstatic boolean isPalindrome(int x,int B) {\n\t\tint cnt = 0;\n\t\tint[] num = new int[5];\n\t\twhile(x!=0) {\n\t\t\tnum[cnt] = x%B;\n\t\t\tcnt++;\n\t\t\tx/=B;\n\t\t}\n\t\tfor(int i= 0;i<(cnt/2);i++) {\n\t\t\tif(num[i]!=num[cnt-1-i])\n\t\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n\t\n\tstatic void trans(int x,int B) {\n\t\tint[] num = new int[5];\n\t\tint[] numRev = new int[5];\n\t\tint i = 0;\n\t\twhile(x!=0) {\n\t\t\tnum[i] = x%B;\n\t\t\ti++;\n\t\t\tx/= B;\n\t\t}\n\t\tfor(int j = 0;j<i;j++) {\n\t\t\tnumRev[j] = num[i-1-j];\n\t\t}\n\t\tfor(int k = 0;k<i;k++) {\n\t\t\tif((numRev[k]>=0)&&(numRev[k]<=9)) {\n\t\t\t\tSystem.out.print(numRev[k]);\n\t\t\t}\n\t\t\tif(numRev[k]>9) {\n\t\t\t\tSystem.out.print(numRev[k]-10+'A');\n\t\t\t}\n\t\t}\n\t}\n}",COMPILE_ERROR,0,0
1316559903818301440,f31082d427a93a58b9a4029d36bf21b049ab69fed573c687789cf8faaa7d93ba,2020-10-15 10:01:56,Java,30.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner input= new Scanner(System.in);\n\t\tint B = input.nextInt();\n\t\tfor(int i = 1;i<=300;i++) {\n\t\t\tif(isPalindrome(i*i,B)) {\n\t\t\t\ttrans(i,B);\n\t\t\t\tSystem.out.print(\"" \"");\n\t\t\t\ttrans(i*i,B);\n\t\t\t\tSystem.out.print(\""\\n\"");\n\t\t\t}\n\t\t}\n}\n\tstatic boolean isPalindrome(int x,int B) {\n\t\tint cnt = 0;\n\t\tint[] num = new int[5];\n\t\twhile(x!=0) {\n\t\t\tnum[cnt] = x%B;\n\t\t\tcnt++;\n\t\t\tx/=B;\n\t\t}\n\t\tfor(int i= 0;i<(cnt/2);i++) {\n\t\t\tif(num[i]!=num[cnt-1-i])\n\t\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n\t\n\tstatic void trans(int x,int B) {\n\t\tint[] num = new int[5];\n\t\tint[] numRev = new int[5];\n\t\tint i = 0;\n\t\twhile(x!=0) {\n\t\t\tnum[i] = x%B;\n\t\t\ti++;\n\t\t\tx/= B;\n\t\t}\n\t\tfor(int j = 0;j<i;j++) {\n\t\t\tnumRev[j] = num[i-1-j];\n\t\t}\n\t\tfor(int k = 0;k<i;k++) {\n\t\t\tif((numRev[k]>=0)&&(numRev[k]<=9)) {\n\t\t\t\tSystem.out.print(numRev[k]);\n\t\t\t}\n\t\t\tif(numRev[k]>9) {\n\t\t\t\tSystem.out.print(numRev[k]-10+'A');\n\t\t\t}\n\t\t}\n\t}\n}",PARTIAL_ACCEPTED,1195,13880
1316560391011876864,f31082d427a93a58b9a4029d36bf21b049ab69fed573c687789cf8faaa7d93ba,2020-10-15 10:03:52,Java,50.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner input= new Scanner(System.in);\n\t\tint B = input.nextInt();\n\t\tfor(int i = 1;i<=300;i++) {\n\t\t\tif(isPalindrome(i*i,B)) {\n\t\t\t\ttrans(i,B);\n\t\t\t\tSystem.out.print(\"" \"");\n\t\t\t\ttrans(i*i,B);\n\t\t\t\tSystem.out.print(\""\\n\"");\n\t\t\t}\n\t\t}\n}\n\tstatic boolean isPalindrome(int x,int B) {\n\t\tint cnt = 0;\n\t\tint[] num = new int[10000];\n\t\twhile(x!=0) {\n\t\t\tnum[cnt] = x%B;\n\t\t\tcnt++;\n\t\t\tx/=B;\n\t\t}\n\t\tfor(int i= 0;i<(cnt/2);i++) {\n\t\t\tif(num[i]!=num[cnt-1-i])\n\t\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n\t\n\tstatic void trans(int x,int B) {\n\t\tint[] num = new int[10000];\n\t\tint[] numRev = new int[10000];\n\t\tint i = 0;\n\t\twhile(x!=0) {\n\t\t\tnum[i] = x%B;\n\t\t\ti++;\n\t\t\tx/= B;\n\t\t}\n\t\tfor(int j = 0;j<i;j++) {\n\t\t\tnumRev[j] = num[i-1-j];\n\t\t}\n\t\tfor(int k = 0;k<i;k++) {\n\t\t\tif((numRev[k]>=0)&&(numRev[k]<=9)) {\n\t\t\t\tSystem.out.print(numRev[k]);\n\t\t\t}\n\t\t\tif(numRev[k]>9) {\n\t\t\t\tSystem.out.print(numRev[k]-10+'A');\n\t\t\t}\n\t\t}\n\t}\n}",PARTIAL_ACCEPTED,1171,28208
1316560464781295616,f31082d427a93a58b9a4029d36bf21b049ab69fed573c687789cf8faaa7d93ba,2020-10-15 10:04:09,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner input= new Scanner(System.in);\n\t\tint B = input.nextInt();\n\t\tfor(int i = 1;i<=300;i++) {\n\t\t\tif(isPalindrome(i*i,B)) {\n\t\t\t\ttrans(i,B);\n\t\t\t\tSystem.out.print(\"" \"");\n\t\t\t\ttrans(i*i,B);\n\t\t\t\tSystem.out.print(\""\\n\"");\n\t\t\t}\n\t\t}\n}\n\tstatic boolean isPalindrome(int x,int B) {\n\t\tint cnt = 0;\n\t\tint[] num = new int[1000000];\n\t\twhile(x!=0) {\n\t\t\tnum[cnt] = x%B;\n\t\t\tcnt++;\n\t\t\tx/=B;\n\t\t}\n\t\tfor(int i= 0;i<(cnt/2);i++) {\n\t\t\tif(num[i]!=num[cnt-1-i])\n\t\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n\t\n\tstatic void trans(int x,int B) {\n\t\tint[] num = new int[1000000];\n\t\tint[] numRev = new int[1000000];\n\t\tint i = 0;\n\t\twhile(x!=0) {\n\t\t\tnum[i] = x%B;\n\t\t\ti++;\n\t\t\tx/= B;\n\t\t}\n\t\tfor(int j = 0;j<i;j++) {\n\t\t\tnumRev[j] = num[i-1-j];\n\t\t}\n\t\tfor(int k = 0;k<i;k++) {\n\t\t\tif((numRev[k]>=0)&&(numRev[k]<=9)) {\n\t\t\t\tSystem.out.print(numRev[k]);\n\t\t\t}\n\t\t\tif(numRev[k]>9) {\n\t\t\t\tSystem.out.print(numRev[k]-10+'A');\n\t\t\t}\n\t\t}\n\t}\n}",MEMORY_LIMIT_EXCEEDED,0,0
1316560526575976448,f31082d427a93a58b9a4029d36bf21b049ab69fed573c687789cf8faaa7d93ba,2020-10-15 10:04:24,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner input= new Scanner(System.in);\n\t\tint B = input.nextInt();\n\t\tfor(int i = 1;i<=300;i++) {\n\t\t\tif(isPalindrome(i*i,B)) {\n\t\t\t\ttrans(i,B);\n\t\t\t\tSystem.out.print(\"" \"");\n\t\t\t\ttrans(i*i,B);\n\t\t\t\tSystem.out.print(\""\\n\"");\n\t\t\t}\n\t\t}\n}\n\tstatic boolean isPalindrome(int x,int B) {\n\t\tint cnt = 0;\n\t\tint[] num = new int[100000];\n\t\twhile(x!=0) {\n\t\t\tnum[cnt] = x%B;\n\t\t\tcnt++;\n\t\t\tx/=B;\n\t\t}\n\t\tfor(int i= 0;i<(cnt/2);i++) {\n\t\t\tif(num[i]!=num[cnt-1-i])\n\t\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n\t\n\tstatic void trans(int x,int B) {\n\t\tint[] num = new int[100000];\n\t\tint[] numRev = new int[100000];\n\t\tint i = 0;\n\t\twhile(x!=0) {\n\t\t\tnum[i] = x%B;\n\t\t\ti++;\n\t\t\tx/= B;\n\t\t}\n\t\tfor(int j = 0;j<i;j++) {\n\t\t\tnumRev[j] = num[i-1-j];\n\t\t}\n\t\tfor(int k = 0;k<i;k++) {\n\t\t\tif((numRev[k]>=0)&&(numRev[k]<=9)) {\n\t\t\t\tSystem.out.print(numRev[k]);\n\t\t\t}\n\t\t\tif(numRev[k]>9) {\n\t\t\t\tSystem.out.print(numRev[k]-10+'A');\n\t\t\t}\n\t\t}\n\t}\n}",MEMORY_LIMIT_EXCEEDED,0,0
1316560745027911680,f31082d427a93a58b9a4029d36bf21b049ab69fed573c687789cf8faaa7d93ba,2020-10-15 10:05:16,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner input= new Scanner(System.in);\n\t\tint B = input.nextInt();\n\t\tfor(int i = 1;i<=300;i++) {\n\t\t\tif(isPalindrome(i*i,B)) {\n\t\t\t\ttrans(i,B);\n\t\t\t\tSystem.out.print(\"" \"");\n\t\t\t\ttrans(i*i,B);\n\t\t\t\tSystem.out.print(\""\\n\"");\n\t\t\t}\n\t\t}\n}\n\tstatic boolean isPalindrome(int x,int B) {\n\t\tint cnt = 0;\n\t\tint[] num = new int[99999];\n\t\twhile(x!=0) {\n\t\t\tnum[cnt] = x%B;\n\t\t\tcnt++;\n\t\t\tx/=B;\n\t\t}\n\t\tfor(int i= 0;i<(cnt/2);i++) {\n\t\t\tif(num[i]!=num[cnt-1-i])\n\t\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n\t\n\tstatic void trans(int x,int B) {\n\t\tint[] num = new int[99999];\n\t\tint[] numRev = new int[99999];\n\t\tint i = 0;\n\t\twhile(x!=0) {\n\t\t\tnum[i] = x%B;\n\t\t\ti++;\n\t\t\tx/= B;\n\t\t}\n\t\tfor(int j = 0;j<i;j++) {\n\t\t\tnumRev[j] = num[i-1-j];\n\t\t}\n\t\tfor(int k = 0;k<i;k++) {\n\t\t\tif((numRev[k]>=0)&&(numRev[k]<=9)) {\n\t\t\t\tSystem.out.print(numRev[k]);\n\t\t\t}\n\t\t\tif(numRev[k]>9) {\n\t\t\t\tSystem.out.print(numRev[k]-10+'A');\n\t\t\t}\n\t\t}\n\t}\n}",MEMORY_LIMIT_EXCEEDED,0,0
1316560859373027329,f31082d427a93a58b9a4029d36bf21b049ab69fed573c687789cf8faaa7d93ba,2020-10-15 10:05:44,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner input= new Scanner(System.in);\n\t\tint B = input.nextInt();\n\t\tfor(int i = 1;i<=300;i++) {\n\t\t\tif(isPalindrome(i*i,B)) {\n\t\t\t\ttrans(i,B);\n\t\t\t\tSystem.out.print(\"" \"");\n\t\t\t\ttrans(i*i,B);\n\t\t\t\tSystem.out.print(\""\\n\"");\n\t\t\t}\n\t\t}\n}\n\tstatic boolean isPalindrome(int x,int B) {\n\t\tint cnt = 0;\n\t\tint[] num = new int[100000];\n\t\twhile(x!=0) {\n\t\t\tnum[cnt] = x%B;\n\t\t\tcnt++;\n\t\t\tx/=B;\n\t\t}\n\t\tfor(int i= 0;i<(cnt/2);i++) {\n\t\t\tif(num[i]!=num[cnt-1-i])\n\t\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n\t\n\tstatic void trans(int x,int B) {\n\t\tint[] num = new int[100000];\n\t\tint[] numRev = new int[100000];\n\t\tint i = 0;\n\t\twhile(x!=0) {\n\t\t\tnum[i] = x%B;\n\t\t\ti++;\n\t\t\tx/= B;\n\t\t}\n\t\tfor(int j = 0;j<i;j++) {\n\t\t\tnumRev[j] = num[i-1-j];\n\t\t}\n\t\tfor(int k = 0;k<i;k++) {\n\t\t\tif((numRev[k]>=0)&&(numRev[k]<=9)) {\n\t\t\t\tSystem.out.print(numRev[k]);\n\t\t\t}\n\t\t\tif(numRev[k]>9) {\n\t\t\t\tSystem.out.print(numRev[k]-10+'A');\n\t\t\t}\n\t\t}\n\t}\n}",MEMORY_LIMIT_EXCEEDED,0,0
1316561180845457408,f31082d427a93a58b9a4029d36bf21b049ab69fed573c687789cf8faaa7d93ba,2020-10-15 10:07:00,Java,50.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner input= new Scanner(System.in);\n\t\tint B = input.nextInt();\n\t\tfor(int i = 1;i<=300;i++) {\n\t\t\tif(isPalindrome(i*i,B)) {\n\t\t\t\ttrans(i,B);\n\t\t\t\tSystem.out.print(\"" \"");\n\t\t\t\ttrans(i*i,B);\n\t\t\t\tSystem.out.print(\""\\n\"");\n\t\t\t}\n\t\t}\n}\n\tstatic boolean isPalindrome(int x,int B) {\n\t\tint cnt = 0;\n\t\tint[] num = new int[10000];\n\t\twhile(x!=0) {\n\t\t\tnum[cnt] = x%B;\n\t\t\tcnt++;\n\t\t\tx/=B;\n\t\t}\n\t\tfor(int i= 0;i<(cnt/2);i++) {\n\t\t\tif(num[i]!=num[cnt-1-i])\n\t\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n\t\n\tstatic void trans(int x,int B) {\n\t\tint[] num = new int[10000];\n\t\tint[] numRev = new int[10000];\n\t\tint i = 0;\n\t\twhile(x!=0) {\n\t\t\tnum[i] = x%B;\n\t\t\ti++;\n\t\t\tx/= B;\n\t\t}\n\t\tfor(int j = 0;j<i;j++) {\n\t\t\tnumRev[j] = num[i-1-j];\n\t\t}\n\t\tfor(int k = 0;k<i;k++) {\n\t\t\tif((numRev[k]>=0)&&(numRev[k]<=9)) {\n\t\t\t\tSystem.out.print(numRev[k]);\n\t\t\t}\n\t\t\tif(numRev[k]>9) {\n\t\t\t\tSystem.out.print(numRev[k]-10+'A');\n\t\t\t}\n\t\t}\n\t}\n}",PARTIAL_ACCEPTED,1166,28808
1316561291562500096,f31082d427a93a58b9a4029d36bf21b049ab69fed573c687789cf8faaa7d93ba,2020-10-15 10:07:27,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner input= new Scanner(System.in);\n\t\tint B = input.nextInt();\n\t\tfor(int i = 1;i<=300;i++) {\n\t\t\tif(isPalindrome(i*i,B)) {\n\t\t\t\ttrans(i,B);\n\t\t\t\tSystem.out.print(\"" \"");\n\t\t\t\ttrans(i*i,B);\n\t\t\t\tSystem.out.print(\""\\n\"");\n\t\t\t}\n\t\t}\n}\n\tstatic boolean isPalindrome(int x,int B) {\n\t\tint cnt = 0;\n\t\tint[] num = new int[99999];\n\t\twhile(x!=0) {\n\t\t\tnum[cnt] = x%B;\n\t\t\tcnt++;\n\t\t\tx/=B;\n\t\t}\n\t\tfor(int i= 0;i<(cnt/2);i++) {\n\t\t\tif(num[i]!=num[cnt-1-i])\n\t\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n\t\n\tstatic void trans(int x,int B) {\n\t\tint[] num = new int[99999];\n\t\tint[] numRev = new int[99999];\n\t\tint i = 0;\n\t\twhile(x!=0) {\n\t\t\tnum[i] = x%B;\n\t\t\ti++;\n\t\t\tx/= B;\n\t\t}\n\t\tfor(int j = 0;j<i;j++) {\n\t\t\tnumRev[j] = num[i-1-j];\n\t\t}\n\t\tfor(int k = 0;k<i;k++) {\n\t\t\tif((numRev[k]>=0)&&(numRev[k]<=9)) {\n\t\t\t\tSystem.out.print(numRev[k]);\n\t\t\t}\n\t\t\tif(numRev[k]>9) {\n\t\t\t\tSystem.out.print(numRev[k]-10+'A');\n\t\t\t}\n\t\t}\n\t}\n}",MEMORY_LIMIT_EXCEEDED,0,0
1316561417676832768,f31082d427a93a58b9a4029d36bf21b049ab69fed573c687789cf8faaa7d93ba,2020-10-15 10:07:57,Java,50.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner input= new Scanner(System.in);\n\t\tint B = input.nextInt();\n\t\tfor(int i = 1;i<=300;i++) {\n\t\t\tif(isPalindrome(i*i,B)) {\n\t\t\t\ttrans(i,B);\n\t\t\t\tSystem.out.print(\"" \"");\n\t\t\t\ttrans(i*i,B);\n\t\t\t\tSystem.out.print(\""\\n\"");\n\t\t\t}\n\t\t}\n}\n\tstatic boolean isPalindrome(int x,int B) {\n\t\tint cnt = 0;\n\t\tint[] num = new int[10000];\n\t\twhile(x!=0) {\n\t\t\tnum[cnt] = x%B;\n\t\t\tcnt++;\n\t\t\tx/=B;\n\t\t}\n\t\tfor(int i= 0;i<(cnt/2);i++) {\n\t\t\tif(num[i]!=num[cnt-1-i])\n\t\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n\t\n\tstatic void trans(int x,int B) {\n\t\tint[] num = new int[10000];\n\t\tint[] numRev = new int[10000];\n\t\tint i = 0;\n\t\twhile(x!=0) {\n\t\t\tnum[i] = x%B;\n\t\t\ti++;\n\t\t\tx/= B;\n\t\t}\n\t\tfor(int j = 0;j<i;j++) {\n\t\t\tnumRev[j] = num[i-1-j];\n\t\t}\n\t\tfor(int k = 0;k<i;k++) {\n\t\t\tif((numRev[k]>=0)&&(numRev[k]<=9)) {\n\t\t\t\tSystem.out.print(numRev[k]);\n\t\t\t}\n\t\t\tif(numRev[k]>9) {\n\t\t\t\tSystem.out.print(numRev[k]-10+'A');\n\t\t\t}\n\t\t}\n\t}\n}",PARTIAL_ACCEPTED,1223,28144
1316574052703059968,f31082d427a93a58b9a4029d36bf21b049ab69fed573c687789cf8faaa7d93ba,2020-10-15 10:58:09,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner input= new Scanner(System.in);\n\t\tint B = input.nextInt();\n\t\tfor(int i = 1;i<=300;i++) {\n\t\t\tif(isPalindrome(i*i,B)) {\n\t\t\t\ttrans(i,B);\n\t\t\t\tSystem.out.print(\"" \"");\n\t\t\t\ttrans(i*i,B);\n\t\t\t\tSystem.out.print(\""\\n\"");\n\t\t\t}\n\t\t}\n}\n\tstatic boolean isPalindrome(int x,int B) {\n\t\tint cnt = 0;\n\t\tint[] num = new int[10000];\n\t\twhile(x!=0) {\n\t\t\tnum[cnt] = x%B;\n\t\t\tcnt++;\n\t\t\tx/=B;\n\t\t}\n\t\tfor(int i= 0;i<(cnt/2);i++) {\n\t\t\tif(num[i]!=num[cnt-1-i])\n\t\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n\t\n\tstatic void trans(int x,int B) {\n\t\tint[] num = new int[10000];\n\t\tint[] numRev = new int[10000];\n\t\tint i = 0;\n\t\twhile(x!=0) {\n\t\t\tnum[i] = x%B;\n\t\t\ti++;\n\t\t\tx/= B;\n\t\t}\n\t\tfor(int j = 0;j<i;j++) {\n\t\t\tnumRev[j] = num[i-1-j];\n\t\t}\n\t\tfor(int k = 0;k<i;k++) {\n\t\t\tif((numRev[k]>=0)&&(numRev[k]<=9)) {\n\t\t\t\tSystem.out.print(numRev[k]);\n\t\t\t}\n\t\t\tif(numRev[k]>9) {\n\t\t\t\t//System.out.print((char));\n\t\t\t\tSystem.out.print((char)Integer.parseInt(String.valueOf(numRev[k]-10+'A')));\n\t\t\t}\n\t\t}\n\t}\n}\n",ACCEPTED,1094,27956
1316620548534222848,63c02cf9aaab363d70ce1594832718fc3fbac5bf01e67c41b04c5e130669b4e1,2020-10-15 14:02:55,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.*;\npublic class Main {\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner s=new Scanner(System.in);\n\t\tint n=s.nextInt();\n\t\tint m=s.nextInt();\n\t\tint count=0;\n\t\tfor(int i=m+1;;i++)\n\t\t{\n\t\t\tint flag=0;\n\t\t\tfor(int j=2;j<=10;j++)\n\t\t\t{\n\t\t\t\tString s1 = Integer.toString(i,j);\n\t\t\t\tStringBuffer S1 = new StringBuffer(s1);\n\t\t\t\tS1.reverse();\n\t\t\t\tString s2=S1.toString();\n\t\t\t\tif(s1.equals(s2))\n\t\t\t\t{\n\t\t\t\t\tflag++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(flag>=2)\n\t\t\t{\n\t\t\t\tcount++;\n\t\t\t\tSystem.out.println(i);\n\t\t\t}\t\t\n\t\t\tif(count==n)\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t}\n}",ACCEPTED,1115,22932
1316629017614139392,9ff02a6da2d04fd8bb25c8491ce3fe160ee10145339d9c4b3d21b6a093505bfb,2020-10-15 14:36:34,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\npublic class Main {\n\tpublic static void main(String []args) {\n\t\tScanner s=new Scanner(System.in);\n\t\tint num1=s.nextInt();\n\t\t//s.nextLine();\n\t\tint num2=s.nextInt();\n\t\tint count=0;\n\t\t\n\t\tfor(int i=num2+1;count<=num1;i++) {\t\t\t\n\t\tint count2=0;\n\t\t\tfor(int j=2;j<=10;j++) {\n\t\t\t\tFangfa f=new Fangfa(i,j);\n\t\t\t\tf.ss();\n\t\t\t\tif(f.judge()) {\n\t\t\t\t\tcount2++;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t}\n\t\t\t\tif(count2>2) {\n\t\t\t\t\tSystem.out.println(i);\n\t\t\t\t\ts.nextLine();\n\t\t\t\t\tcount++;\n\t\t\t\t\t\n\t\t\t}\n\t\t}\n\t\ts.close();\n\t\t\n\t\t}\n\n\n}\nclass Fangfa{\n\tpublic StringBuffer sh=new StringBuffer();\n\tpublic int num;\n\tpublic int radix;\n\tFangfa(int num1,int radix1){\n\t\tthis.num=num1;\n\t\tthis.radix=radix1;\n\t}\n\t\tpublic  StringBuffer ss() {\t\n\t\twhile(num==0) {\n\t\tsh.append(num%radix);\n\t\tnum/=radix;\n\t\t}\n\t\treturn \tsh.reverse();\n\t}\n\tpublic boolean judge() {\n\t\tfor(int i=0;i<sh.length()/2;i++) {\n\t\t\tif(sh.charAt(i)!=sh.charAt(sh.length()-1-i))\n\t\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n\t\n}\n",WRONG_ANSWER,936,14496
1316679092373602304,92975d0190256d803410fc20758f54a02074687be32d846fffd47ce5ea904c97,2020-10-15 17:55:32,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n    public static boolean isPalin(StringBuffer s){\n        for (int i=0;i<s.length()/2;i++){\n            if(s.charAt(i)!=s.charAt(s.length()-i-1)){\n                return false;\n            }\n        }\n        return true;\n    }\n    public static StringBuffer convert(int num,int B) {\n        StringBuffer rtnval = new StringBuffer();\n        int digit;\n        while (num > 0) {\n            digit = num % B;\n            if (digit >= 10) {\n                rtnval.append((char) ('A' + digit - 10));\n            } else {\n                rtnval.append(digit);\n            }\n            num /= B;\n        }\n        return rtnval.reverse();//翻转以后得到\n        \n    }\n    public static void main(String[] args) {\n    \tScanner scanner= new Scanner(System.in);\n    \tint x =scanner.nextInt();\n    \tfor (int i = 1;i<=300;i++){\n    \t\tStringBuffer num1= convert(i,x);\n    \t\tStringBuffer num2= convert(i*i,x);\n    \t\tif (isPalin(num2)){\n    \t\t\tSystem.out.println(num1+\"" \""+num2);\n    \t\t}\n    \t}\n    }\n  }",ACCEPTED,1211,14268
1316754189130186752,593fa841b68c3997aab850746d945475f4609f8a519ba883ba5fc14acf958f4e,2020-10-15 22:53:57,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"public class Main{\n\tpublic static void main(String[] args) {\n\t\tScanner cin=new Scanner(System.in);\n\t\tint B=cin.nextInt();\n\t\tfor(int i=1;i<300;i++)\n\t\t{\n\t\t\tStringBuffer num1=convert(i,B);//转化\n\t\t\tStringBuffer num2=convert(i*i,B);\n\t\t\tif(isPalin(num2))//判断是否为回文数\n\t\t\t{\n\t\t\t\tSystem.out.println(num1+\"" \""+num2);\n\t\t\t}\n\t\t}\n\t}\n\tpublic static boolean isPalin(StringBuffer s)\n\t{\n\t\tfor(int i=0;i<s.length()/2;i++)\n\t\t{\n\t\t\tif(s.charAt(i)!=s.charAt(s.length()-i-1))\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\t\n\t}\n\tpublic static StringBuffer convert(int num,int B)//进行转换，自动存入字符串数组中\n\t{\n\t\tStringBuffer rtnaval=new StringBuffer();\n\t\tint digit;\n\t\twhile(num>0)\n\t\t{\n\t\t\tdigit=num%B;\n\t\t\tif(digit>=10)\n\t\t\t{\n\t\t\t\trtnaval.append((char)('A'+digit-10));//将余数转化为16进制\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\trtnaval.append(digit);\n\t\t\t}\n\t\t\tnum=num/B;\n\t\t}\n\t\treturn rtnaval.reverse();//翻转\n\t\t\n\t}\n}",COMPILE_ERROR,0,0
1316754427530231808,593fa841b68c3997aab850746d945475f4609f8a519ba883ba5fc14acf958f4e,2020-10-15 22:54:54,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\npublic class Main{\n\tpublic static void main(String[] args) {\n\t\tScanner cin=new Scanner(System.in);\n\t\tint B=cin.nextInt();\n\t\tfor(int i=1;i<300;i++)\n\t\t{\n\t\t\tStringBuffer num1=convert(i,B);//转化\n\t\t\tStringBuffer num2=convert(i*i,B);\n\t\t\tif(isPalin(num2))//判断是否为回文数\n\t\t\t{\n\t\t\t\tSystem.out.println(num1+\"" \""+num2);\n\t\t\t}\n\t\t}\n\t}\n\tpublic static boolean isPalin(StringBuffer s)\n\t{\n\t\tfor(int i=0;i<s.length()/2;i++)\n\t\t{\n\t\t\tif(s.charAt(i)!=s.charAt(s.length()-i-1))\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\t\n\t}\n\tpublic static StringBuffer convert(int num,int B)//进行转换，自动存入字符串数组中\n\t{\n\t\tStringBuffer rtnaval=new StringBuffer();\n\t\tint digit;\n\t\twhile(num>0)\n\t\t{\n\t\t\tdigit=num%B;\n\t\t\tif(digit>=10)\n\t\t\t{\n\t\t\t\trtnaval.append((char)('A'+digit-10));//将余数转化为16进制\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\trtnaval.append(digit);\n\t\t\t}\n\t\t\tnum=num/B;\n\t\t}\n\t\treturn rtnaval.reverse();//翻转\n\t\t\n\t}\n}",ACCEPTED,1219,14244
1316761092379951104,3bdbd7e8e8af9b87c4d3257432c9ad0385767bd45ebedbf1ed31dc9d9f556994,2020-10-15 23:21:23,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static boolean pali_num(String str) {\n\t\tint length;\n\t\tlength = str.length();\n\t\tint bo = 1;\n\t\tchar[] a = str.toCharArray();\n\t\tfor (int i = 0; i <= (length / 2); i++) {\n\t\t\tif (a[i] != a[length - i - 1]) {\n\t\t\t\tbo = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (bo == 1)\n\t\t\treturn true;\n\t\telse\n\t\t\treturn false;\n\t}\n\n\tpublic static String number(int n, int num) {\n\t\tStringBuffer a = new StringBuffer();\n\t\tdo {\n\t\t\tint t = num % n;\n\t\t\ta.append(Integer.toString(t, n));\n\t\t\tnum = num / n;\n\t\t} while (num != 0);\n\t\ta.reverse();\n\t\tString str;\n\t\tstr = a.toString();\n\t\treturn str;\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tint n;\n\t\tn = in.nextInt();\n\t\tin.close();\n\t\tfor (int i = 1; i <= 300; i++) {\n\t\t\tString s1 = number(n, i);\n\t\t\tString s2 = number(n, (i * i));\n\t\t\tif ( pali_num(s2) ) {\n\t\t\t\tSystem.out.println(s1.toUpperCase() + \"" \"" + s2.toUpperCase());\n\t\t\t}\n\t\t}\n\t}\n\n}",ACCEPTED,1162,14596
1316939561369911296,eccaecdbc9ad5dde80e7ad836c40e65f3763048c5ac5f4debc09de6ad9c401e6,2020-10-16 11:10:33,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner; \n\npublic class Main {\n\n  public static boolean isHui(String azhe) {\n    int leng = azhe.length();\n    for(int j=0;j<leng/2;j++) {\n      if(azhe.charAt(j) != azhe.charAt(leng-j-1)) return false;\n    }\n    return true;\n  }\n  \n  public static String reverse1(String str)\n  {\n    return new StringBuffer(str).reverse().toString();\n  }\n  \n  public static String Itoa(int Num,int R) {\n    String remain=\""\"";\n    int temp;\n    do {\n     temp = Num%R;//取余\n     Num /= R;\n     if (temp >= 10)\n       remain += temp - 10 + 'A';//任意进制为大于基数大于10的进制 例如，十六进制\n     else remain += temp + '0';\n    } while (Num>0);\n    remain = reverse1(remain);\n    return remain;\n  }\n\n  public static void main(String args[]) {\n    Scanner sc = new Scanner(System.in);\n    int n = sc.nextInt();\n    String azhe;\n    for(int i=1;i<=300;i++) {\n      azhe = Itoa(i*i,n);\n      if(isHui(azhe)) System.out.println(Itoa(i,n)+\"" \""+Itoa(i*i,n));\n    }\n  }\n}",WRONG_ANSWER,1034,14688
1316941743234269184,eccaecdbc9ad5dde80e7ad836c40e65f3763048c5ac5f4debc09de6ad9c401e6,2020-10-16 11:19:13,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner; \n\npublic class Main {\n\n  public static boolean isHui(String azhe) {\n    int leng = azhe.length();\n    for(int j=0;j<leng/2;j++) {\n      if(azhe.charAt(j) != azhe.charAt(leng-j-1)) return false;\n    }\n    return true;\n  }\n  \n  public static String reverse1(String str)\n  {\n    return new StringBuffer(str).reverse().toString();\n  }\n  \n  public static String Itoa(int Num,int R) {\n    String remain=\""\"";\n    int temp;\n    char tmp;\n    while (Num>0) {\n     temp = Num%R;\n     Num /= R;\n     if (temp >= 10)\n       tmp = (char)(temp - 10 + (int)'A');\n     else tmp = (char)(temp + (int)'0');\n     remain += tmp;\n    }\n    remain = reverse1(remain);\n    return remain;\n  }\n\n  public static void main(String args[]) {\n    Scanner sc = new Scanner(System.in);\n    int n = sc.nextInt();\n    String azhe;\n    for(int i=1;i<=300;i++) {\n      azhe = Itoa(i*i,n);\n      if(isHui(azhe)) System.out.println(Itoa(i,n)+\"" \""+Itoa(i*i,n));\n    }\n  }\n}",ACCEPTED,1151,14564
1316944157395959808,eccaecdbc9ad5dde80e7ad836c40e65f3763048c5ac5f4debc09de6ad9c401e6,2020-10-16 11:28:49,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner; \n\npublic class Main {\n\n  public static boolean isHui(String azhe) {\n    int leng = azhe.length();\n    for(int j=0;j<leng/2;j++) {\n      if(azhe.charAt(j) != azhe.charAt(leng-j-1)) return false;\n    }\n    return true;\n  }\n  \n  public static String reverse1(String str)\n  {\n    return new StringBuffer(str).reverse().toString();\n  }\n  \n  public static String Itoa(int Num,int R) {\n    String remain=\""\"";\n    int temp;\n    char tmp;\n    while (Num>0) {\n     temp = Num%R;\n     Num /= R;\n     if (temp >= 10)\n       tmp = (char)(temp - 10 + (int)'A');\n     else tmp = (char)(temp + (int)'0');\n     remain += tmp;\n    }\n    remain = reverse1(remain);\n    return remain;\n  }\n\n  public static void main(String args[]) {\n    Scanner sc = new Scanner(System.in);\n    int n = sc.nextInt();\n    int m = sc.nextInt();\n    m++;\n    boolean flag1 = false, flag2 = false;\n    String azhe;\n    while(true) {\n      for(int i=2;i<=10;i++) {\n        azhe = Itoa(m,i);\n        if(isHui(azhe)) {\n          if(!flag1) flag1 = true;\n          else {\n            flag2 = true;\n            break;\n          }\n        }\n      }\n      if(flag2 == true) {\n        System.out.println(m);\n        n-=1;\n      }\n      flag1 = false;\n      flag2 = false;\n      m++;\n      if(n==0) break;\n    }\n  }\n}",ACCEPTED,1083,37588
1317070535529381888,f31082d427a93a58b9a4029d36bf21b049ab69fed573c687789cf8faaa7d93ba,2020-10-16 19:51:00,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class DoublePalindrome {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint begin = sc.nextInt();\n\t\tint cnt = 0;\n\t\tfor(int i = begin + 1;;i++) {\n\t\t\tint cnt2 = 0;\n\t\t\tfor(int j = 2;j<=10&&cnt2<2;j++) {\n\t\t\t\tif(isPalindrome(i,j))\n\t\t\t\t\tcnt2++;\n\t\t\t}\n\t\t\tif(cnt2>=2) {\n\t\t\t\tSystem.out.println(i);\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t\tif(cnt>=n)\n\t\t\t\tbreak;\n\t\t}\n\t}\n\t\n\tstatic boolean isPalindrome(int x, int B) {\n\t\tint[] num = new int[100];\n\t\tint i = 0;\n\t\twhile(x!=0) {\n\t\t\tnum[i++] = x%B;\n\t\t\tx/=B;\n\t\t}\n\t\tfor(int j = 0;j<(i/2);j++) {\n\t\t\tif(num[j]!=num[i-1-j])\n\t\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t\t\n\t}\n}",COMPILE_ERROR,0,0
1317070582199402496,f31082d427a93a58b9a4029d36bf21b049ab69fed573c687789cf8faaa7d93ba,2020-10-16 19:51:11,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main{\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint begin = sc.nextInt();\n\t\tint cnt = 0;\n\t\tfor(int i = begin + 1;;i++) {\n\t\t\tint cnt2 = 0;\n\t\t\tfor(int j = 2;j<=10&&cnt2<2;j++) {\n\t\t\t\tif(isPalindrome(i,j))\n\t\t\t\t\tcnt2++;\n\t\t\t}\n\t\t\tif(cnt2>=2) {\n\t\t\t\tSystem.out.println(i);\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t\tif(cnt>=n)\n\t\t\t\tbreak;\n\t\t}\n\t}\n\t\n\tstatic boolean isPalindrome(int x, int B) {\n\t\tint[] num = new int[100];\n\t\tint i = 0;\n\t\twhile(x!=0) {\n\t\t\tnum[i++] = x%B;\n\t\t\tx/=B;\n\t\t}\n\t\tfor(int j = 0;j<(i/2);j++) {\n\t\t\tif(num[j]!=num[i-1-j])\n\t\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t\t\n\t}\n}",ACCEPTED,979,22964
1317117409347026944,d2d1ecd5d95661062fd9a3e5a165f2959770250103ccbf15f123c5f583f532c8,2020-10-16 22:57:15,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.*;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner cin = new Scanner(System.in);\n\t\tint T = cin.nextInt();\n\t\tprint(T);\n\t}\n \n\tprivate static void print(int t) {\n\t\tfor(int i = 1;i <= 300;++ i){\n\t\t\tint s = i * i;\n\t\t\tStringBuffer num = new StringBuffer();\n\t\t\tStringBuffer square = new StringBuffer();\n\t\t\tnum = convert(i,t);\n\t\t\tsquare = convert(s,t);\n\t\t\t//System.out.print(square);\n\t\t\tif(ispalindrom(square)){\n\t\t\t\tSystem.out.println(num.reverse()+\"" \""+square);\n\t\t\t}\n\t\t}\n\t}\n\tprivate static StringBuffer convert(int s, int t) {\n\t\tStringBuffer rtnval = new StringBuffer();\n\t\tint digit;\n\t\twhile(s > 0){\n\t\t\tdigit = s % t;\n\t\t\tif(digit >= 10){\n\t\t\t\trtnval.append((char)('A'+digit - 10));\n\t\t\t}else{\n\t\t\t\trtnval.append(digit);\n\t\t\t}\n\t\t\ts /= t;\n\t\t}\n\t\treturn rtnval;\n\t}\n\tprivate static boolean ispalindrom(StringBuffer bf) {\n\t\tString s = new String(bf);\n\t\tchar sch[] = s.toCharArray();\n\t\tint len = sch.length;\n\t\t//System.out.println(\"" \""+len);\n\t\tfor(int i = 0;i < len / 2;++ i){\n\t\t\tif(sch[i] != sch[len - i - 1]){\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n}",ACCEPTED,1125,14224
1317118092611731456,d2d1ecd5d95661062fd9a3e5a165f2959770250103ccbf15f123c5f583f532c8,2020-10-16 22:59:58,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\npublic class Main {\n\tstatic int n;\n\tstatic int S;\n\n\tpublic static void main(String[] args) {\n\t\tScanner console= new Scanner(System.in);\n\t\tn= console.nextInt();\n\t\tS= console.nextInt();\n\t\tint countNum= 0;\n\n\t\tfor(int i=S+1; ; i++) {\n\t\t\tif(countNum==n) return;\n\t\t\tboolean doubleSign1= false;\n\n\t\t\tfor(int r=2; r<=10; r++) {\n\t\t\t\tString iUnderR= Integer.toString(i, r);\n\t\t\t\tStringBuffer reUnderR= new StringBuffer(iUnderR);\n\t\t\t\tif(iUnderR.equals(reUnderR.reverse().toString())) {\n\t\t\t\t\tif(!doubleSign1) {\n\t\t\t\t\t\tdoubleSign1= true;\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tSystem.out.println(i);\n\t\t\t\t\t\tcountNum++;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\n\t}\n\t}\n}",ACCEPTED,948,20888
1317369873501671424,92975d0190256d803410fc20758f54a02074687be32d846fffd47ce5ea904c97,2020-10-17 15:40:28,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\npublic class Main {\n\tstatic int n;\n\tstatic int S;\n\tpublic static void main(String[] args) {\n\t\tScanner console= new Scanner(System.in);\n\t\tn= console.nextInt();\n\t\tS= console.nextInt();\n\t\tint countNum= 0;\n\n\t\tfor(int i=S+1; ; i++) {\n\t\t\tif(countNum==n) return;\n\t\t\t//对于每一个数字 讨论各个进制下的回文情况\n\t\t\tboolean doubleSign1= false;\n\n\t\t\tfor(int r=2; r<=10; r++) {\n\t\t\t\tString iUnderR= Integer.toString(i, r);\n\t\t\t\tStringBuffer reUnderR= new StringBuffer(iUnderR);\n\t\t\t\tif(iUnderR.equals(reUnderR.reverse().toString())) {\n\t\t\t\t\tif(!doubleSign1) {\n\t\t\t\t\t\tdoubleSign1= true;\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tSystem.out.println(i);\n\t\t\t\t\t\tcountNum++;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\n\t}\n\t}\n}",ACCEPTED,1077,21840
1317461952080793600,593fa841b68c3997aab850746d945475f4609f8a519ba883ba5fc14acf958f4e,2020-10-17 21:46:21,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main{\n\tpublic static void main(String[] args) {\n\t\ttry (Scanner cin = new Scanner(System.in)) {\n\t\t\tint N = cin.nextInt();\n\t\t\tint S = cin.nextInt();\n\t\t\tint sum = 0;\n\t\t\tint total = 0;\n\t\t\tfor (int i = S-1; i < 10000; i++) {\n\t\t\t\tfor (int j = 2; j <= 10; j++) {\n\t\t\t\t\tStringBuffer num1 = convert(i, j);// 转化\n\t\t\t\t\tif (isPalin(num1))// 判断是否为回文数\n\t\t\t\t\t\tsum++;\n\t\t\t\t}\n\t\t\t\tif (sum > 3) {\n\t\t\t\t\tSystem.out.println(i);\n\t\t\t\t\ttotal++;\n\t\t\t\t}\n\t\t\t\tif(total==N) return;\n\n\t\t\t}\n\t\t}\n\t}\n\n\tpublic static boolean isPalin(StringBuffer s) {\n\t\tfor (int i = 0; i < s.length() / 2; i++) {\n\t\t\tif (s.charAt(i) != s.charAt(s.length() - i - 1)) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\n\tpublic static StringBuffer convert(int num, int B) {\n\t\tStringBuffer rtnaval = new StringBuffer();\n\t\tint digit;\n\t\twhile (num > 0) {\n\t\t\tdigit = num % B;\n\t\t\tif (digit >= 10) {\n\t\t\t\trtnaval.append((char) ('A' + digit - 10));// 将余数转化为16进制\n\t\t\t} else {\n\t\t\t\trtnaval.append(digit);\n\t\t\t}\n\t\t\tnum = num / B;\n\t\t}\n\t\treturn rtnaval.reverse();// 翻转\n\n\t}\n}",WRONG_ANSWER,932,14148
1317462163998003200,593fa841b68c3997aab850746d945475f4609f8a519ba883ba5fc14acf958f4e,2020-10-17 21:47:11,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main{\n\tpublic static void main(String[] args) {\n\t\ttry (Scanner cin = new Scanner(System.in)) {\n\t\t\tint N = cin.nextInt();\n\t\t\tint S = cin.nextInt();\n\t\t\tint sum = 0;\n\t\t\tint total = 0;\n\t\t\tfor (int i = S-1; i < 10000; i++) {\n\t\t\t\tfor (int j = 2; j <= 10; j++) {\n\t\t\t\t\tStringBuffer num1 = convert(i, j);// 转化\n\t\t\t\t\tif (isPalin(num1))// 判断是否为回文数\n\t\t\t\t\t\tsum++;\n\t\t\t\t}\n\t\t\t\tif (sum > 3) {\n\t\t\t\t\tSystem.out.println(i);\n\t\t\t\t\ttotal++;\n\t\t\t\t}\n\t\t\t\tif(total==N) return;\n\n\t\t\t}\n\t\t}\n\t}\n\n\tpublic static boolean isPalin(StringBuffer s) {\n\t\tfor (int i = 0; i < s.length() / 2; i++) {\n\t\t\tif (s.charAt(i) != s.charAt(s.length() - i - 1)) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\n\tpublic static StringBuffer convert(int num, int B) {\n\t\tStringBuffer rtnaval = new StringBuffer();\n\t\tint digit;\n\t\twhile (num > 0) {\n\t\t\tdigit = num % B;\n\t\t\tif (digit >= 10) {\n\t\t\t\trtnaval.append((char) ('A' + digit - 10));// 将余数转化为16进制\n\t\t\t} else {\n\t\t\t\trtnaval.append(digit);\n\t\t\t}\n\t\t\tnum = num / B;\n\t\t}\n\t\treturn rtnaval.reverse();// 翻转\n\n\t}\n}",WRONG_ANSWER,963,14424
1317462272043274240,593fa841b68c3997aab850746d945475f4609f8a519ba883ba5fc14acf958f4e,2020-10-17 21:47:37,Java,10.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main{\n\tpublic static void main(String[] args) {\n\t\ttry (Scanner cin = new Scanner(System.in)) {\n\t\t\tint N = cin.nextInt();\n\t\t\tint S = cin.nextInt();\n\t\t\tint sum = 0;\n\t\t\tint total = 0;\n\t\t\tfor (int i = S+1; i < 10000; i++) {\n\t\t\t\tfor (int j = 2; j <= 10; j++) {\n\t\t\t\t\tStringBuffer num1 = convert(i, j);// 转化\n\t\t\t\t\tif (isPalin(num1))// 判断是否为回文数\n\t\t\t\t\t\tsum++;\n\t\t\t\t}\n\t\t\t\tif (sum > 3) {\n\t\t\t\t\tSystem.out.println(i);\n\t\t\t\t\ttotal++;\n\t\t\t\t}\n\t\t\t\tif(total==N) return;\n\n\t\t\t}\n\t\t}\n\t}\n\n\tpublic static boolean isPalin(StringBuffer s) {\n\t\tfor (int i = 0; i < s.length() / 2; i++) {\n\t\t\tif (s.charAt(i) != s.charAt(s.length() - i - 1)) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\n\tpublic static StringBuffer convert(int num, int B) {\n\t\tStringBuffer rtnaval = new StringBuffer();\n\t\tint digit;\n\t\twhile (num > 0) {\n\t\t\tdigit = num % B;\n\t\t\tif (digit >= 10) {\n\t\t\t\trtnaval.append((char) ('A' + digit - 10));// 将余数转化为16进制\n\t\t\t} else {\n\t\t\t\trtnaval.append(digit);\n\t\t\t}\n\t\t\tnum = num / B;\n\t\t}\n\t\treturn rtnaval.reverse();// 翻转\n\n\t}\n}",PARTIAL_ACCEPTED,892,14404
1317463936724680704,593fa841b68c3997aab850746d945475f4609f8a519ba883ba5fc14acf958f4e,2020-10-17 21:54:14,Java,10.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main{\n\tpublic static void main(String[] args) {\n\t\ttry (Scanner cin = new Scanner(System.in)) {\n\t\t\tint N = cin.nextInt();\n\t\t\tint S = cin.nextInt();\n\t\t\tint sum = 0;\n\t\t\tint total = 0;\n\t\t\tfor (int i = S+1;total<N; i++) {\n                sum=0;\n\t\t\t\tfor (int j = 2; j <= 10; j++) {\n\t\t\t\t\tStringBuffer num1 = convert(i, j);// 转化\n\t\t\t\t\tif (isPalin(num1))// 判断是否为回文数\n\t\t\t\t\t\tsum++;\n\t\t\t\t}\n\t\t\t\tif (sum > 3) {\n\t\t\t\t\tSystem.out.println(i);\n\t\t\t\t\ttotal++;\n\t\t\t\t}\n\t\t\t\tif(total==N) return;\n\n\t\t\t}\n\t\t}\n\t}\n\n\tpublic static boolean isPalin(StringBuffer s) {\n\t\tfor (int i = 0; i < s.length() / 2; i++) {\n\t\t\tif (s.charAt(i) != s.charAt(s.length() - i - 1)) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\n\tpublic static StringBuffer convert(int num, int B) {\n\t\tStringBuffer rtnaval = new StringBuffer();\n\t\tint digit;\n\t\twhile (num > 0) {\n\t\t\tdigit = num % B;\n\t\t\tif (digit >= 10) {\n\t\t\t\trtnaval.append((char) ('A' + digit - 10));// 将余数转化为16进制\n\t\t\t} else {\n\t\t\t\trtnaval.append(digit);\n\t\t\t}\n\t\t\tnum = num / B;\n\t\t}\n\t\treturn rtnaval.reverse();// 翻转\n\n\t}\n}",PARTIAL_ACCEPTED,150,13892
1317468231012601856,593fa841b68c3997aab850746d945475f4609f8a519ba883ba5fc14acf958f4e,2020-10-17 22:11:18,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main{\n\tpublic static void main(String[] args) {\n\t\ttry (Scanner cin = new Scanner(System.in)) {\n\t\t\tint N = cin.nextInt();\n\t\t\tint S = cin.nextInt();\n\t\t\tint total = 0;\n\t\t\tint[] num = new int[N];\n\t\t\tfor (int i = S + 1; total < N; i++) {\n\t\t\t\tint sum = 0;\n\t\t\t\tfor (int j = 2; j <= 10; j++) {\n\t\t\t\t\tStringBuffer num1 = convert(i, j);// 转化\n\t\t\t\t\tif (isPalin(num1))// 判断是否为回文数\n\t\t\t\t\t\tsum++;\n\t\t\t\t}\n\t\t\t\tif (sum >= 2) {\n\t\t\t\t\tnum[total] = i;\n\t\t\t\t\ttotal++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(int i=0;i<num.length;i++)\n\t\t\t{\n\t\t\t\tSystem.out.println(num[1]);\n\t\t\t}\n\t\t}\n\t}\n\n\tpublic static boolean isPalin(StringBuffer s) {\n\t\tfor (int i = 0; i < s.length() / 2; i++) {\n\t\t\tif (s.charAt(i) != s.charAt(s.length() - i - 1)) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\n\tpublic static StringBuffer convert(int num, int B) {\n\t\tStringBuffer rtnaval = new StringBuffer();\n\t\tint digit;\n\t\twhile (num > 0) {\n\t\t\tdigit = num % B;\n\t\t\tif (digit >= 10) {\n\t\t\t\trtnaval.append((char) ('A' + digit - 10));// 将余数转化为16进制\n\t\t\t} else {\n\t\t\t\trtnaval.append(digit);\n\t\t\t}\n\t\t\tnum = num / B;\n\t\t}\n\t\treturn rtnaval.reverse();// 翻转\n\n\t}\n}",WRONG_ANSWER,1119,17140
1317472173142462464,3bdbd7e8e8af9b87c4d3257432c9ad0385767bd45ebedbf1ed31dc9d9f556994,2020-10-17 22:26:58,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static boolean pali_num(String str) {\n\t\tint length;\n\t\tlength = str.length();\n\t\tint bo = 1;\n\t\tchar[] a = str.toCharArray();\n\t\tfor (int i = 0; i <= (length / 2); i++) {\n\t\t\tif (a[i] != a[length - i - 1]) {\n\t\t\t\tbo = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (bo == 1)\n\t\t\treturn true;\n\t\telse\n\t\t\treturn false;\n\t}\n\n\tpublic static String number(int n, int num) {\n\t\tStringBuffer a = new StringBuffer();\n\t\tdo {\n\t\t\tint t = num % n;\n\t\t\ta.append(Integer.toString(t, n));\n\t\t\tnum = num / n;\n\t\t} while (num != 0);\n\t\ta.reverse();\n\t\tString str;\n\t\tstr = a.toString();\n\t\treturn str;\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tint n1 = 0, n2 = 0;// 计数\n\t\tint N, num;\n\t\tScanner in = new Scanner(System.in);\n\t\tN = in.nextInt();\n\t\tnum = in.nextInt();\n\t\tint[] outp = new int[N];\n\t\tfor (int i = 1; n1 < 3; i++) {\n\t\t\tn2 = 0;\n\t\t\tfor (int j = 2; j <= 20; j++) {\n\t\t\t\tif (pali_num(number(j, num + i))) {\n\t\t\t\t\t++n2;\n\t\t\t\t\tif (n2 >= 2)\n\t\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (n2 >= 2) {\n\t\t\t\toutp[i - 1] = num + i;\n\t\t\t\t++n1;\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < N; i++)\n\t\t\tSystem.out.println(outp[i]);\n\t\tin.close();\n\t}\n}",WRONG_ANSWER,1039,14824
1317472725393784832,3bdbd7e8e8af9b87c4d3257432c9ad0385767bd45ebedbf1ed31dc9d9f556994,2020-10-17 22:29:09,Java,10.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static boolean pali_num(String str) {\n\t\tint length;\n\t\tlength = str.length();\n\t\tint bo = 1;\n\t\tchar[] a = str.toCharArray();\n\t\tfor (int i = 0; i <= (length / 2); i++) {\n\t\t\tif (a[i] != a[length - i - 1]) {\n\t\t\t\tbo = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (bo == 1)\n\t\t\treturn true;\n\t\telse\n\t\t\treturn false;\n\t}\n\n\tpublic static String number(int n, int num) {\n\t\tStringBuffer a = new StringBuffer();\n\t\tdo {\n\t\t\tint t = num % n;\n\t\t\ta.append(Integer.toString(t, n));\n\t\t\tnum = num / n;\n\t\t} while (num != 0);\n\t\ta.reverse();\n\t\tString str;\n\t\tstr = a.toString();\n\t\treturn str;\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tint n1 = 0, n2 = 0;// 计数\n\t\tint N, num;\n\t\tScanner in = new Scanner(System.in);\n\t\tN = in.nextInt();\n\t\tnum = in.nextInt();\n\t\tint[] outp = new int[N];\n\t\tfor (int i = 1; n1 < N; i++) {\n\t\t\tn2 = 0;\n\t\t\tfor (int j = 2; j <= 20; j++) {\n\t\t\t\tif (pali_num(number(j, num + i))) {\n\t\t\t\t\t++n2;\n\t\t\t\t\tif (n2 >= 2)\n\t\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (n2 >= 2) {\n\t\t\t\toutp[i - 1] = num + i;\n\t\t\t\t++n1;\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < N; i++)\n\t\t\tSystem.out.println(outp[i]);\n\t\tin.close();\n\t}\n}",PARTIAL_ACCEPTED,1016,14628
1317476050361171968,3bdbd7e8e8af9b87c4d3257432c9ad0385767bd45ebedbf1ed31dc9d9f556994,2020-10-17 22:42:22,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static boolean pali_num(String str) {\n\t\tint length;\n\t\tlength = str.length();\n\t\tint bo = 1;\n\t\tchar[] a = str.toCharArray();\n\t\tfor (int i = 0; i <= (length / 2); i++) {\n\t\t\tif (a[i] != a[length - i - 1]) {\n\t\t\t\tbo = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (bo == 1)\n\t\t\treturn true;\n\t\telse\n\t\t\treturn false;\n\t}\n\n\tpublic static String number(int n, int num) {\n\t\tStringBuffer a = new StringBuffer();\n\t\tdo {\n\t\t\tint t = num % n;\n\t\t\ta.append(Integer.toString(t, n));\n\t\t\tnum = num / n;\n\t\t} while (num != 0);\n\t\ta.reverse();\n\t\tString str;\n\t\tstr = a.toString();\n\t\treturn str;\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tint n1 = 0, n2 = 0;// 计数\n\t\tint N, num;\n\t\tScanner in = new Scanner(System.in);\n\t\tN = in.nextInt();\n\t\tnum = in.nextInt();\n\t\tint[] outp = new int[N];\n\t\tfor (int i = 1; n1 < N; i++) {\n\t\t\tn2 = 0;\n\t\t\tfor (int j = 2; j <= 10; j++) {\n\t\t\t\t//System.out.println(j + \"" ****\"" + pali_num(number(j, num + i)));\n\t\t\t\tif (pali_num(number(j, num + i))) {\n\t\t\t\t\t++n2;\n\t\t\t\t\t//System.out.println(j + \"" ****\"" + n2);\n\t\t\t\t\tif (n2 == 2)\n\t\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (n2 == 2) {\n\t\t\t\t++n1;\n\t\t\t\toutp[n1-1] = num + i;\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < N; i++)\n\t\t\tSystem.out.println(outp[i]);\n\t\tin.close();\n\t}\n}",ACCEPTED,1276,40456
1317476259631878144,593fa841b68c3997aab850746d945475f4609f8a519ba883ba5fc14acf958f4e,2020-10-17 22:43:12,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main{\n\tpublic static void main(String[] args) {\n\t\ttry (Scanner cin = new Scanner(System.in)) {\n\t\t\tint N = cin.nextInt();\n\t\t\tint S = cin.nextInt();\n\t\t\tint total = 0;\n\t\t\tint[] num = new int[N];\n\t\t\tfor (int i = s+1; total < N; i++) {\n\t\t\t\tint sum=0;\n\t\t\t\tfor (int j = 2; j<= 10; j++)\n\t\t\t\t{\n\t\t\t\t\tStringBuffer num1 = convert(i, j);// 转化\n\t\t\t\t\tif (isPalin(num1))// 判断是否为回文数\n\t\t\t\t\t\tsum++;\n\t\t\t\t}\n\t\t\t\tif (sum >= 2) \n\t\t\t\t{\n\t\t\t\t\tnum[total] = i;\n\t\t\t\t\ttotal++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(int i=0;i<num.length;i++)\n\t\t\t{\n\t\t\t\tSystem.out.println(num[i]);\n\t\t\t}\n\t\t}\n\t}\n\n\tpublic static boolean isPalin(StringBuffer s) {\n\t\tfor (int i = 0; i < s.length() / 2; i++) {\n\t\t\tif (s.charAt(i) != s.charAt(s.length() - i - 1)) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\n\tpublic static StringBuffer convert(int num, int B) {\n\t\tStringBuffer rtnaval = new StringBuffer();\n\t\tint digit;\n\t\twhile (num > 0) {\n\t\t\tdigit = num % B;\n\t\t\tif (digit >= 10) {\n\t\t\t\trtnaval.append((char) ('A' + digit - 10));// 将余数转化为16进制\n\t\t\t} else {\n\t\t\t\trtnaval.append(digit);\n\t\t\t}\n\t\t\tnum = num / B;\n\t\t}\n\t\treturn rtnaval.reverse();// 翻转\n\n\t}\n}",COMPILE_ERROR,0,0
1317476591535542272,593fa841b68c3997aab850746d945475f4609f8a519ba883ba5fc14acf958f4e,2020-10-17 22:44:31,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main{\n\tpublic static void main(String[] args) {\n\t\ttry (Scanner cin = new Scanner(System.in)) {\n\t\t\tint N = cin.nextInt();\n\t\t\tint S = cin.nextInt();\n\t\t\tint total = 0;\n\t\t\tint[] num = new int[N];\n\t\t\tfor (int i = S+1; total < N; i++) {\n\t\t\t\tint sum=0;\n\t\t\t\tfor (int j = 2; j<= 10; j++)\n\t\t\t\t{\n\t\t\t\t\tStringBuffer num1 = convert(i, j);// 转化\n\t\t\t\t\tif (isPalin(num1))// 判断是否为回文数\n\t\t\t\t\t\tsum++;\n\t\t\t\t}\n\t\t\t\tif (sum >= 2) \n\t\t\t\t{\n\t\t\t\t\tnum[total] = i;\n\t\t\t\t\ttotal++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(int i=0;i<num.length;i++)\n\t\t\t{\n\t\t\t\tSystem.out.println(num[i]);\n\t\t\t}\n\t\t}\n\t}\n\n\tpublic static boolean isPalin(StringBuffer s) {\n\t\tfor (int i = 0; i < s.length() / 2; i++) {\n\t\t\tif (s.charAt(i) != s.charAt(s.length() - i - 1)) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\n\tpublic static StringBuffer convert(int num, int B) {\n\t\tStringBuffer rtnaval = new StringBuffer();\n\t\tint digit;\n\t\twhile (num > 0) {\n\t\t\tdigit = num % B;\n\t\t\tif (digit >= 10) {\n\t\t\t\trtnaval.append((char) ('A' + digit - 10));// 将余数转化为16进制\n\t\t\t} else {\n\t\t\t\trtnaval.append(digit);\n\t\t\t}\n\t\t\tnum = num / B;\n\t\t}\n\t\treturn rtnaval.reverse();// 翻转\n\n\t}\n}",ACCEPTED,1069,16748
1317648429075025920,772737140437a20aba427edf50cd963527a510d7ed0afb423d3831b534dc4f65,2020-10-18 10:07:20,Java,70.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner in = new Scanner(System.in);\n\t\t\tint i;   //控制循环\n\t\t\tint j;   //记录平方数的十进制\n\t\t\tint n=0;   //控制循环\n\t\t\tint m;   //记录要转化成的进制\n\t\t\tint l=0;   //控制循环\n\t\t\tint con = 0; //暂存值\n\t\t\tint p;   //控制循环\n\t\t\tint res = 0;      //记录商\n\t\t\tint a[] = new int[10];        //记录余数\n\t\t\tchar b[] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\n\t\t\tint c[] = new int[10];        //放置原来数转化后的值\n\t\t\tm = in.nextInt();\n\t\t\tfor (i = 1; i <= 300; i++)\n\t\t\t{\n\t\t\t\tj = i * i;\n\t\t\t\twhile (res != 0 || n == 0)\n\t\t\t\t{\n\t\t\t\t\tres = j / m;\n\t\t\t\t\ta[n] = j % m;\n\t\t\t\t\tj = res;\n\t\t\t\t\tn++;\n\t\t\t\t}\n\t\t\t\tfor (l = 0; l < (n / 2); l++)\n\t\t\t\t\tif (a[l] != a[n - l - 1])\n\t\t\t\t\t\tbreak;\n\t\t\t\tif (l == (n / 2))\n\t\t\t\t{\n\t\t\t\t\tres = 0;\n\t\t\t\t\tp = 0;\n\t\t\t\t\tcon = i;\n\t\t\t\t\twhile (res != 0 || p == 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tres = con / m;\n\t\t\t\t\t\tc[p] = con % m;\n\t\t\t\t\t\tcon = res;\n\t\t\t\t\t\tp++;\n\t\t\t\t\t}\n\t\t\t\t\tfor (l = (p - 1); l >= 0; l--)\n\t\t\t\t\t\tSystem.out.print(b[c[l]]);\n\t\t\t\t\tSystem.out.print(\"" \"");\n\t\t\t\t\tfor (l = (n - 1); l >= 0; l--)\n\t\t\t\t\t\tSystem.out.print(b[a[l]]);\n\t\t\t\t\tSystem.out.println();\n\t\t\t\t}\n\t\t\t\tn = 0;\n\t\t\t}\n\t}\n\n}",PARTIAL_ACCEPTED,1037,14380
1317733947754303488,60aefcb14faaa988a3c7d313c8704158d094cb469bd999245250fa350e9dba0d,2020-10-18 15:47:10,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\n//输入数据\n//\t前n个 初始数字大于S\n//\t\n//\t在大于S的范围上一个一个讨论（考虑剪枝)\n//\t\t每一个数字二到十均转化一次进制\n//\t\t判断是不是回文\n//\t\t直到满足数字个数要求。\n\npublic class Main {\n\tstatic int n;\n\tstatic int S;\n\n\tpublic static void main(String[] args) {\n\t\tScanner console= new Scanner(System.in);\n\t\tn= console.nextInt();\n\t\tS= console.nextInt();\n\t\tint countNum= 0;\n\n\t\tfor(int i=S+1; ; i++) {\n\t\t\tif(countNum==n) return;\n\t\t\t//对于每一个数字 讨论各个进制下的回文情况\n\t\t\tboolean doubleSign1= false;\n\n\t\t\tfor(int r=2; r<=10; r++) {\n\t\t\t\tString iUnderR= Integer.toString(i, r);\n\t\t\t\tStringBuffer reUnderR= new StringBuffer(iUnderR);\n\t\t\t\tif(iUnderR.equals(reUnderR.reverse().toString())) {\n\t\t\t\t\tif(!doubleSign1) {\n\t\t\t\t\t\tdoubleSign1= true;\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tSystem.out.println(i);\n\t\t\t\t\t\tcountNum++;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\n\t}\n\t}\n}\n\n",ACCEPTED,1063,23272
1317739018806149120,2dbc8dbbe3a3713fd279f85d78da00257659b0fa27c0cdad54e2bf4fb0d9580e,2020-10-18 16:07:19,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.ArrayList;\nimport java.util.Scanner;\npublic class test1{\n\tstatic boolean Is_huiwen(String a)\n\t{\n\t\tint length = a.length();\n\t\tint flag = 1;\n\t\tfor(int i =0;i<=length/2;i++)\n\t\t{\n\t\t\tif(a.charAt(i)!=a.charAt(length-i-1))\n\t\t\t{\n\t\t\t\tflag = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(flag==1)\n\t\t\treturn true;\n\t\telse {\n\t\t\treturn false;\n\t\t}\n\t}\n\tstatic String intToA(int n,int radix)\n\t{\n\t\tStringBuffer ans = new StringBuffer();\n\t\tdo {\n\t\t\tInteger t = n%radix;\n\t\t\tif(t>=0&&t<=9)\n\t\t\t{\n\t\t\t\tans.append(t.toString());\n\t\t\t}\n\t\t\telse {\n\t\t\t\tint inttemp = t-10;\n\t\t\t\tchar temp = (char) (inttemp+'A');\n\t\t\t\tans.append(temp);\n\t\t\t}\n\t\t} while (n!=0);\n\t\tans.reverse();\n\t\tString answer = ans.toString();\n\t\treturn answer;\n\t}\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n,s;\n\t\tn = sc.nextInt();\n\t\ts = sc.nextInt();\n\t\ts++;\n\t\tArrayList<Integer> p = new ArrayList<>();\n\t\tint sum;\n\t\twhile(p.size()<n)\n\t\t{\n\t\t\tsum=0;\n\t\t\tfor(int i=2;i<=10;i++)\n\t\t\t{\n\t\t\t\tif(Is_huiwen(intToA(s,i)))\n\t\t\t\t\tsum++;\n\t\t\t}\n\t\t\tif(sum>=2)\n\t\t\t\tp.add(s);\n\t\t\ts++;\n\t\t}\n\t\tfor(int i=0;i<p.size();i++)\n\t\t{\n\t\t\tSystem.out.println(p.get(i));\n\t\t}\n\t\tsc.close();\n\t}\n}\n",COMPILE_ERROR,0,0
1317739072707149824,2dbc8dbbe3a3713fd279f85d78da00257659b0fa27c0cdad54e2bf4fb0d9580e,2020-10-18 16:07:31,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.ArrayList;\nimport java.util.Scanner;\npublic class Main{\n\tstatic boolean Is_huiwen(String a)\n\t{\n\t\tint length = a.length();\n\t\tint flag = 1;\n\t\tfor(int i =0;i<=length/2;i++)\n\t\t{\n\t\t\tif(a.charAt(i)!=a.charAt(length-i-1))\n\t\t\t{\n\t\t\t\tflag = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(flag==1)\n\t\t\treturn true;\n\t\telse {\n\t\t\treturn false;\n\t\t}\n\t}\n\tstatic String intToA(int n,int radix)\n\t{\n\t\tStringBuffer ans = new StringBuffer();\n\t\tdo {\n\t\t\tInteger t = n%radix;\n\t\t\tif(t>=0&&t<=9)\n\t\t\t{\n\t\t\t\tans.append(t.toString());\n\t\t\t}\n\t\t\telse {\n\t\t\t\tint inttemp = t-10;\n\t\t\t\tchar temp = (char) (inttemp+'A');\n\t\t\t\tans.append(temp);\n\t\t\t}\n\t\t} while (n!=0);\n\t\tans.reverse();\n\t\tString answer = ans.toString();\n\t\treturn answer;\n\t}\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n,s;\n\t\tn = sc.nextInt();\n\t\ts = sc.nextInt();\n\t\ts++;\n\t\tArrayList<Integer> p = new ArrayList<>();\n\t\tint sum;\n\t\twhile(p.size()<n)\n\t\t{\n\t\t\tsum=0;\n\t\t\tfor(int i=2;i<=10;i++)\n\t\t\t{\n\t\t\t\tif(Is_huiwen(intToA(s,i)))\n\t\t\t\t\tsum++;\n\t\t\t}\n\t\t\tif(sum>=2)\n\t\t\t\tp.add(s);\n\t\t\ts++;\n\t\t}\n\t\tfor(int i=0;i<p.size();i++)\n\t\t{\n\t\t\tSystem.out.println(p.get(i));\n\t\t}\n\t\tsc.close();\n\t}\n}\n",MEMORY_LIMIT_EXCEEDED,0,0
1317743551993237504,2dbc8dbbe3a3713fd279f85d78da00257659b0fa27c0cdad54e2bf4fb0d9580e,2020-10-18 16:25:19,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.ArrayList;\nimport java.util.Scanner;\npublic class Main{\n\tstatic boolean Is_huiwen(String a)\n\t{\n\t\tint length = a.length();\n\t\tint flag = 1;\n\t\tfor(int i =0;i<=length/2;i++)\n\t\t{\n\t\t\tif(a.charAt(i)!=a.charAt(length-i-1))\n\t\t\t{\n\t\t\t\tflag = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(flag==1)\n\t\t\treturn true;\n\t\telse {\n\t\t\treturn false;\n\t\t}\n\t}\n\tstatic String intToA(int n,int radix)\n\t{\n\t\tStringBuffer ans = new StringBuffer();\n\t\tdo {\n\t\t\tInteger t = n%radix;\n\t\t\tif(t>=0&&t<=9)\n\t\t\t{\n\t\t\t\tans.append(t.toString());\n\t\t\t}\n\t\t\telse {\n\t\t\t\tint inttemp = t-10;\n\t\t\t\tchar temp = (char) (inttemp+'A');\n\t\t\t\tans.append(temp);\n\t\t\t}\n            n/=radix;\n\t\t} while (n!=0);\n\t\tans.reverse();\n        \n\t\tString answer = ans.toString();\n\t\treturn answer;\n\t}\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n,s;\n\t\tn = sc.nextInt();\n\t\ts = sc.nextInt();\n\t\ts++;\n\t\tArrayList<Integer> p = new ArrayList<>();\n\t\tint sum;\n\t\twhile(p.size()<n)\n\t\t{\n\t\t\tsum=0;\n\t\t\tfor(int i=2;i<=10;i++)\n\t\t\t{\n\t\t\t\tif(Is_huiwen(intToA(s,i)))\n\t\t\t\t\tsum++;\n\t\t\t}\n\t\t\tif(sum>=2)\n\t\t\t\tp.add(s);\n\t\t\ts++;\n\t\t}\n\t\tfor(int i=0;i<p.size();i++)\n\t\t{\n\t\t\tSystem.out.println(p.get(i));\n\t\t}\n\t\tsc.close();\n\t}\n}\n",ACCEPTED,1047,25968
1317747839310123008,dbdee02c4509ab7a1fd578907c2d4a0dc00c446ff84739560caf0298cf21d497,2020-10-18 16:42:22,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"package code0103;\n\nimport java.util.Scanner;\n\npublic class Main {\n\n\t\n\tpublic static StringBuffer transf(int n,int x){\n        StringBuffer str=new StringBuffer();\n        int bit;\n        while(n>0)\n        {\n            bit=n%x;\n            if(bit>=10)  str.append((char)('A'+bit-10));\n            else  str.append(bit);\n            n=n/x;\n                \n        }\n        return str.reverse();\n    }\n\t\n\t\n    public static  boolean isPalin(StringBuffer n)\n    {\n        int v=n.length()/2;\n        for (int i=0;i<v;i++)\n        {\n            if(n.charAt(i)!=n.charAt(n.length()-i-1))\n                return false;\n            \n        }\n        return  true;\n    }\n    \n    \n    \n\n    public static void main(String[] args) {\n        Scanner scan = new Scanner(System.in);\n        int x = scan.nextInt();\n\n        int i;\n        for(i=1;i<300;i++){\n            StringBuffer n1 = transf(i,x);\n            StringBuffer n2 = transf(i*i,x);\n            if(isPalin(n2)){\n                System.out.println(n1+\"" \""+n2);\n            }\n        }\n\n\n\n    }\n\n}",WRONG_ANSWER,916,12944
1317747893303296000,dbdee02c4509ab7a1fd578907c2d4a0dc00c446ff84739560caf0298cf21d497,2020-10-18 16:42:34,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"\nimport java.util.Scanner;\n\npublic class Main {\n\n\t\n\tpublic static StringBuffer transf(int n,int x){\n        StringBuffer str=new StringBuffer();\n        int bit;\n        while(n>0)\n        {\n            bit=n%x;\n            if(bit>=10)  str.append((char)('A'+bit-10));\n            else  str.append(bit);\n            n=n/x;\n                \n        }\n        return str.reverse();\n    }\n\t\n\t\n    public static  boolean isPalin(StringBuffer n)\n    {\n        int v=n.length()/2;\n        for (int i=0;i<v;i++)\n        {\n            if(n.charAt(i)!=n.charAt(n.length()-i-1))\n                return false;\n            \n        }\n        return  true;\n    }\n    \n    \n    \n\n    public static void main(String[] args) {\n        Scanner scan = new Scanner(System.in);\n        int x = scan.nextInt();\n\n        int i;\n        for(i=1;i<300;i++){\n            StringBuffer n1 = transf(i,x);\n            StringBuffer n2 = transf(i*i,x);\n            if(isPalin(n2)){\n                System.out.println(n1+\"" \""+n2);\n            }\n        }\n\n\n\n    }\n\n}",ACCEPTED,1081,14160
1317753159952416768,dbdee02c4509ab7a1fd578907c2d4a0dc00c446ff84739560caf0298cf21d497,2020-10-18 17:03:30,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"package code0103;\n\n\n\n\nimport java.util.Scanner;\n\n\npublic class Main {\n\tstatic int len;\n\tstatic int a[]=new int[100000];\n\tstatic int change(int x,int n)\n\t{\n\t\tint temp=x;\n\t\tint p=0;\n\t\tdo {\n\t\t\ta[++p]=temp%n;\n\t\t\ttemp/=n;\n\t\t}while(temp!=0);\n\t\treturn p;\n\t}\n\t\n\tstatic boolean ju()\n\t{\n\t\tint l=1;\n\t\tint r=len;\n\t\twhile(r>l)\n\t\t{\n\t\t\tif(a[r]!=a[l]) return false;\n\t\t\tr--;\n\t\t\tl++;\n\t\t}\n\t\treturn true;\n\t}\n    public static void main(String[] args){\n    \tScanner sc=new Scanner(System.in);\n        int n=sc.nextInt();\n    \tint s=sc.nextInt();\n    \tboolean B=(n==0)?false:true;\n       while(B)\n    \t{\n    \t\ts++;\n    \t\tint total=0;\n    \t\tfor(int i=2;i<=10;i++)\n    \t\t{\n    \t\t\tlen=change(s,i);\n    \t\t\tif(ju()) total++;\n    \t\t\tif(total>=2) break;\n    \t\t}\n    \t\tif(total>=2)\n    \t\t{\n    \t\t\tn--;\n    \t\t\tSystem.out.println(s);\n    \t\t}\n    \t}\n    \t\n    }\n   \n}",WRONG_ANSWER,789,13024
1317753261404241920,dbdee02c4509ab7a1fd578907c2d4a0dc00c446ff84739560caf0298cf21d497,2020-10-18 17:03:54,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"\n\n\n\nimport java.util.Scanner;\n\n\npublic class Main {\n\tstatic int len;\n\tstatic int a[]=new int[100000];\n\tstatic int change(int x,int n)\n\t{\n\t\tint temp=x;\n\t\tint p=0;\n\t\tdo {\n\t\t\ta[++p]=temp%n;\n\t\t\ttemp/=n;\n\t\t}while(temp!=0);\n\t\treturn p;\n\t}\n\t\n\tstatic boolean ju()\n\t{\n\t\tint l=1;\n\t\tint r=len;\n\t\twhile(r>l)\n\t\t{\n\t\t\tif(a[r]!=a[l]) return false;\n\t\t\tr--;\n\t\t\tl++;\n\t\t}\n\t\treturn true;\n\t}\n    public static void main(String[] args){\n    \tScanner sc=new Scanner(System.in);\n        int n=sc.nextInt();\n    \tint s=sc.nextInt();\n    \tboolean B=(n==0)?false:true;\n       while(B)\n    \t{\n    \t\ts++;\n    \t\tint total=0;\n    \t\tfor(int i=2;i<=10;i++)\n    \t\t{\n    \t\t\tlen=change(s,i);\n    \t\t\tif(ju()) total++;\n    \t\t\tif(total>=2) break;\n    \t\t}\n    \t\tif(total>=2)\n    \t\t{\n    \t\t\tn--;\n    \t\t\tSystem.out.println(s);\n    \t\t}\n    \t}\n    \t\n    }\n   \n}",TIME_LIMIT_EXCEEDED,0,0
1317758958862909440,772737140437a20aba427edf50cd963527a510d7ed0afb423d3831b534dc4f65,2020-10-18 17:26:33,Java,70.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner in = new Scanner(System.in);\n\t\t\tint i;   //控制循环\n\t\t\tint j;   //记录平方数的十进制\n\t\t\tint n=0;   //控制循环\n\t\t\tint m;   //记录要转化成的进制\n\t\t\tint l=0;   //控制循环\n\t\t\tint con = 0; //暂存值\n\t\t\tint p;   //控制循环\n\t\t\tint res = 0;      //记录商\n\t\t\tint a[] = new int[10];        //记录余数\n\t\t\tchar b[] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\n\t\t\tint c[] = new int[10];        //放置原来数转化后的值\n\t\t\tm = in.nextInt();\n\t\t\tfor (i = 1; i <= 300; i++)\n\t\t\t{\n\t\t\t\tj = i * i;\n\t\t\t\twhile (res != 0 || n == 0)\n\t\t\t\t{\n\t\t\t\t\tres = j / m;\n\t\t\t\t\ta[n] = j % m;\n\t\t\t\t\tj = res;\n\t\t\t\t\tn++;\n\t\t\t\t}\n\t\t\t\tfor (l = 0; l < (n / 2); l++)\n\t\t\t\t\tif (a[l] != a[n - l - 1])\n\t\t\t\t\t\tbreak;\n\t\t\t\tif (l == (n / 2))\n\t\t\t\t{\n\t\t\t\t\tres = 0;\n\t\t\t\t\tp = 0;\n\t\t\t\t\tcon = i;\n\t\t\t\t\twhile (res != 0 || p == 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tres = con / m;\n\t\t\t\t\t\tc[p] = con % m;\n\t\t\t\t\t\tcon = res;\n\t\t\t\t\t\tp++;\n\t\t\t\t\t}\n\t\t\t\t\tfor (l = (p - 1); l >= 0; l--)\n\t\t\t\t\t\tSystem.out.print(b[c[l]]);\n\t\t\t\t\tSystem.out.print(\"" \"");\n\t\t\t\t\tfor (l = (n - 1); l >= 0; l--)\n\t\t\t\t\t\tSystem.out.print(b[a[l]]);\n\t\t\t\t\tSystem.out.println();\n\t\t\t\t}\n\t\t\t\tn = 0;\n\t\t\t}\n\t}\n\n}",PARTIAL_ACCEPTED,1173,14280
1317759233795342336,dbdee02c4509ab7a1fd578907c2d4a0dc00c446ff84739560caf0298cf21d497,2020-10-18 17:27:38,Java,10.0,1306870976110592008,1267449136707624960,1049226397448056832,"\n\nimport java.util.Scanner;\n\n\npublic class Main {\n\t  \n\n\t \n    public static void main(String[] args){\n    \tScanner sc=new Scanner(System.in);\n    \tint n=sc.nextInt();\n    \tint s=sc.nextInt();\n    \tint count=0;\n    \tfor(int i=s+1; ;i++)\n    \t{\n    \t\tif(count==n) return;\n    \t\tboolean fl=false;\n    \t\tfor(int j=0;j<=10;j++)\n    \t\t{   String temp=Integer.toString(i,j);//直接将i转换为j进制的字符串\n    \t\t    StringBuffer temp2=new StringBuffer(temp);\n    \t\t\tif(temp.equals(temp2.reverse().toString())) {\n    \t\t\t\tif(!fl) {\n    \t\t\t\t\tfl=true;\n    \t\t\t\t\tcontinue;\n    \t\t\t\t}//一次之后就会反转\n    \t\t\t\telse {\n    \t\t\t\t\tSystem.out.println(i);\n    \t\t\t\t\tcount++;\n    \t\t\t\t\tbreak;\n    \t\t\t\t}\n    \t\t\t}\n    \t\t}\n    \t}\n    \t\n    }\n   \n}",PARTIAL_ACCEPTED,1010,17040
1317759317123579904,dbdee02c4509ab7a1fd578907c2d4a0dc00c446ff84739560caf0298cf21d497,2020-10-18 17:27:58,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"\n\nimport java.util.Scanner;\n\n\npublic class Main {\n\t  \n\n\t \n    public static void main(String[] args){\n    \tScanner sc=new Scanner(System.in);\n    \tint n=sc.nextInt();\n    \tint s=sc.nextInt();\n    \tint count=0;\n    \tfor(int i=s+1; ;i++)\n    \t{\n    \t\tif(count==n) return;\n    \t\tboolean fl=false;\n    \t\tfor(int j=2;j<=10;j++)\n    \t\t{   String temp=Integer.toString(i,j);//直接将i转换为j进制的字符串\n    \t\t    StringBuffer temp2=new StringBuffer(temp);\n    \t\t\tif(temp.equals(temp2.reverse().toString())) {\n    \t\t\t\tif(!fl) {\n    \t\t\t\t\tfl=true;\n    \t\t\t\t\tcontinue;\n    \t\t\t\t}//一次之后就会反转\n    \t\t\t\telse {\n    \t\t\t\t\tSystem.out.println(i);\n    \t\t\t\t\tcount++;\n    \t\t\t\t\tbreak;\n    \t\t\t\t}\n    \t\t\t}\n    \t\t}\n    \t}\n    \t\n    }\n   \n}",ACCEPTED,1045,21788
1317759420861300736,772737140437a20aba427edf50cd963527a510d7ed0afb423d3831b534dc4f65,2020-10-18 17:28:23,Java,70.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner in = new Scanner(System.in);\n\t\t\tint i;   //控制循环\n\t\t\tint j;   //记录平方数的十进制\n\t\t\tint n=0;   //控制循环\n\t\t\tint m;   //记录要转化成的进制\n\t\t\tint l=0;   //控制循环\n\t\t\tint con = 0; //暂存值\n\t\t\tint p;   //控制循环\n\t\t\tint res = 0;      //记录商\n\t\t\tint a[] = new int[10];        //记录余数\n\t\t\tchar b[] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\n\t\t\tint c[] = new int[10];        //放置原来数转化后的值\n\t\t\tm = in.nextInt();\n\t\t\tfor (i = 1; i <= 300; i++)\n\t\t\t{\n\t\t\t\tj = i * i;\n\t\t\t\twhile (res != 0 || n == 0)\n\t\t\t\t{\n\t\t\t\t\tres = j / m;\n\t\t\t\t\ta[n] = j % m;\n\t\t\t\t\tj = res;\n\t\t\t\t\tn++;\n\t\t\t\t}\n\t\t\t\tfor (l = 0; l < (n / 2); l++)\n\t\t\t\t\tif (a[l] != a[n - l - 1])\n\t\t\t\t\t\tbreak;\n\t\t\t\tif (l == (n / 2))\n\t\t\t\t{\n\t\t\t\t\tres = 0;\n\t\t\t\t\tp = 0;\n\t\t\t\t\tcon = i;\n\t\t\t\t\twhile (res != 0 || p == 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tres = con / m;\n\t\t\t\t\t\tc[p] = con % m;\n\t\t\t\t\t\tcon = res;\n\t\t\t\t\t\tp++;\n\t\t\t\t\t}\n\t\t\t\t\tfor (l = (p - 1); l >= 0; l--)\n\t\t\t\t\t\tSystem.out.print(b[c[l]]);\n\t\t\t\t\tSystem.out.print(\"" \"");\n\t\t\t\t\tfor (l = (n - 1); l >= 0; l--)\n\t\t\t\t\t\tSystem.out.print(b[a[l]]);\n\t\t\t\t\tSystem.out.println();\n\t\t\t\t}\n\t\t\t\tn = 0;\n\t\t\t}\n\t}\n\n}",PARTIAL_ACCEPTED,944,14320
1317759986060644352,772737140437a20aba427edf50cd963527a510d7ed0afb423d3831b534dc4f65,2020-10-18 17:30:38,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner in = new Scanner(System.in);\n\t\t\tint i;   //控制循环\n\t\t\tint j;   //记录平方数的十进制\n\t\t\tint n=0;   //控制循环\n\t\t\tint m;   //记录要转化成的进制\n\t\t\tint l=0;   //控制循环\n\t\t\tint con = 0; //暂存值\n\t\t\tint p;   //控制循环\n\t\t\tint res = 0;      //记录商\n\t\t\tint a[] = new int[13];        //记录余数\n\t\t\tchar b[] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J' };\n\t\t\tint c[] = new int[10];        //放置原来数转化后的值\n\t\t\tm = in.nextInt();\n\t\t\tfor (i = 1; i <= 300; i++)\n\t\t\t{\n\t\t\t\tj = i * i;\n\t\t\t\twhile (res != 0 || n == 0)\n\t\t\t\t{\n\t\t\t\t\tres = j / m;\n\t\t\t\t\ta[n] = j % m;\n\t\t\t\t\tj = res;\n\t\t\t\t\tn++;\n\t\t\t\t}\n\t\t\t\tfor (l = 0; l < (n / 2); l++)\n\t\t\t\t\tif (a[l] != a[n - l - 1])\n\t\t\t\t\t\tbreak;\n\t\t\t\tif (l == (n / 2))\n\t\t\t\t{\n\t\t\t\t\tres = 0;\n\t\t\t\t\tp = 0;\n\t\t\t\t\tcon = i;\n\t\t\t\t\twhile (res != 0 || p == 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tres = con / m;\n\t\t\t\t\t\tc[p] = con % m;\n\t\t\t\t\t\tcon = res;\n\t\t\t\t\t\tp++;\n\t\t\t\t\t}\n\t\t\t\t\tfor (l = (p - 1); l >= 0; l--)\n\t\t\t\t\t\tSystem.out.print(b[c[l]]);\n\t\t\t\t\tSystem.out.print(\"" \"");\n\t\t\t\t\tfor (l = (n - 1); l >= 0; l--)\n\t\t\t\t\t\tSystem.out.print(b[a[l]]);\n\t\t\t\t\tSystem.out.println();\n\t\t\t\t}\n\t\t\t\tn = 0;\n\t\t\t}\n\t}\n\n}",ACCEPTED,1142,14044
1317772228617457664,c85b4c1c77fefeb5973f4524c52bf63288e9a28b3c4ba86d4dd9facc66617b4a,2020-10-18 18:19:16,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic static boolean isPalin(StringBuffer s){\n    for (int i=0;i<s.length()/2;i++){\n        if(s.charAt(i)!=s.charAt(s.length()-i-1))\n            return false;\n    }\n    return true;\n}\n\npublic static StringBuffer convert(int n,int B) {\n    StringBuffer rtnval = new StringBuffer();\n    int digit;\n    while (n > 0) {\n        digit = n % B;\n        if (digit >= 10)\n            rtnval.append((char) ('A' + digit - 10));\n        else\n            rtnval.append(digit);\n        num /= B;\n    }\n    return rtnval.reverse();\n}\n\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner= new Scanner(System.in);\n        int B =scanner.nextInt();\n        for (int i = 1;i<=300;i++){\n            StringBuffer n1= convert(i,B);\n            StringBuffer n2= convert(i*i,B);\n            if (isPalin(n2))\n                System.out.println(n1+\"" \""+n2);\n        }\n    }\n}\n",COMPILE_ERROR,0,0
1317772773021339648,c85b4c1c77fefeb5973f4524c52bf63288e9a28b3c4ba86d4dd9facc66617b4a,2020-10-18 18:21:26,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner= new Scanner(System.in);\n        int B =scanner.nextInt();\n        for (int i = 1;i<=300;i++){\n            StringBuffer n1= convert(i,B);\n            StringBuffer n2= convert(i*i,B);\n            if (isPalin(n2))\n                System.out.println(n1+\"" \""+n2);\n        }\n    }\n    public static boolean isPalin(StringBuffer s){\n        for (int i=0;i<s.length()/2;i++){\n            if(s.charAt(i)!=s.charAt(s.length()-i-1))\n                return false;\n        }\n        return true;\n    }\n    public static StringBuffer convert(int n,int B) {\n        StringBuffer rtnval = new StringBuffer();\n        int digit;\n        while (n > 0) {\n            digit = n % B;\n            if (digit >= 10)\n                rtnval.append((char) ('A' + digit - 10));\n            else\n                rtnval.append(digit);\n            num /= B;\n        }\n        return rtnval.reverse();\n    }\n\n}\n",COMPILE_ERROR,0,0
1317772844639080448,c85b4c1c77fefeb5973f4524c52bf63288e9a28b3c4ba86d4dd9facc66617b4a,2020-10-18 18:21:43,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner= new Scanner(System.in);\n        int B =scanner.nextInt();\n        for (int i = 1;i<=300;i++){\n            StringBuffer n1= convert(i,B);\n            StringBuffer n2= convert(i*i,B);\n            if (isPalin(n2))\n                System.out.println(n1+\"" \""+n2);\n        }\n    }\n    public static boolean isPalin(StringBuffer s){\n        for (int i=0;i<s.length()/2;i++){\n            if(s.charAt(i)!=s.charAt(s.length()-i-1))\n                return false;\n        }\n        return true;\n    }\n    public static StringBuffer convert(int n,int B) {\n        StringBuffer rtnval = new StringBuffer();\n        int digit;\n        while (n > 0) {\n            digit = n % B;\n            if (digit >= 10)\n                rtnval.append((char) ('A' + digit - 10));\n            else\n                rtnval.append(digit);\n            n /= B;\n        }\n        return rtnval.reverse();\n    }\n\n}\n",ACCEPTED,1105,14484
1317806929516216320,dbdee02c4509ab7a1fd578907c2d4a0dc00c446ff84739560caf0298cf21d497,2020-10-18 20:37:10,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"\nimport java.util.Scanner;\n\npublic class Main {\n\n\t\nc\n\t\n    public static  boolean isPalin(StringBuffer n)\n    {\n        int v=n.length()/2;\n        for (int i=0;i<v;i++)\n        {\n            if(n.charAt(i)!=n.charAt(n.length()-i-1))\n                return false;\n            \n        }\n        return  true;\n    }\n    \n    \n    \n\n    public static void main(String[] args) {\n        Scanner scan = new Scanner(System.in);\n        int x = scan.nextInt();\n\n        int i;\n        for(i=1;i<300;i++){StringBuffer a = transf(i*i,x);\n            StringBuffer b = transf(i,x);\n            \n            if(isPalin(n2)){\n                System.out.println(b+\"" \""+a);\n            }\n        }\n\n\n\n    }\n\n}",COMPILE_ERROR,0,0
1317807033761550336,dbdee02c4509ab7a1fd578907c2d4a0dc00c446ff84739560caf0298cf21d497,2020-10-18 20:37:35,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"\nimport java.util.Scanner;\n\npublic class Main {\n\n\t\n\n\t\n    public static  boolean isPalin(StringBuffer n)\n    {\n        int v=n.length()/2;\n        for (int i=0;i<v;i++)\n        {\n            if(n.charAt(i)!=n.charAt(n.length()-i-1))\n                return false;\n            \n        }\n        return  true;\n    }\n    \n    \n    \n\n    public static void main(String[] args) {\n        Scanner scan = new Scanner(System.in);\n        int x = scan.nextInt();\n\n        int i;\n        for(i=1;i<300;i++){\n            StringBuffer a = transf(i*i,x);\n            StringBuffer b = transf(i,x);\n            \n            if(isPalin(n2)){\n                System.out.println(b+\"" \""+a);\n            }\n        }\n\n\n\n    }\n\n}",COMPILE_ERROR,0,0
1317807214091456512,dbdee02c4509ab7a1fd578907c2d4a0dc00c446ff84739560caf0298cf21d497,2020-10-18 20:38:18,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"\nimport java.util.Scanner;\n\npublic class Main {\n\n\t\n\n\t\n    public static  boolean isPalin(StringBuffer n)\n    {\n        int v=n.length()/2;\n        for (int i=0;i<v;i++)\n        {\n            if(n.charAt(i)!=n.charAt(n.length()-i-1))\n                return false;\n            \n        }\n        return  true;\n    }\n    \n    \n    \n\n    public static void main(String[] args) {\n        Scanner scan = new Scanner(System.in);\n        int x = scan.nextInt();\n\n        int i;\n        for(i=1;i<300;i++){\n            StringBuffer a = transf(i*i,x);\n            StringBuffer b = transf(i,x);\n            \n            if(isPalin(a)){\n                System.out.println(b+\"" \""+a);\n            }\n        }\n\n\n\n    }\n\n}",COMPILE_ERROR,0,0
1317811782820974592,ec53039adbfa16331c9f18e1417ee9aff06a3bca71bca4365b8f05065abe9d6c,2020-10-18 20:56:27,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\npublic class Main{\n    public static bool search(int s){\n        int a[1000];\n        for(int j = 2;j < 11;j++){ //12345\n            int temp = 0,int memo = 0;\n            for(int k = 0;s == 0;k++){\n                a[k] = s % j;\n                s /= j;\n                temp = k + 1;\n            }\n            if(a[temp - 1] == 0){\n                    return false;\n            }\n            for(int n = 0;n = temp/2;n++){\n                bool flag = (a[n] == a[temp - 1 - n]) ? true : false;\n                if(!flag){\n                    break;\n                }\n                \n            }\n            if(flag){\n                memo++;\n            }\n            bool flag_ = memo >=2 ? true : false;\n            if(flag_){\n                return true;\n            }\n         }\n        return false;\n    }\n        \n        \n        \n        \n        \n    }\n    public static void main(String []args){\n        Scanner scanner = new scanner(System.in);\n        int N = scanner.nextInt();\n        int S = scanner.nextInt();\n        int count = 0;\n        for (int i = S + 1;;i++){\n            if(count >= N) break;\n            if(search(i)) {\n                count++;\n                System.out.println(i);              \n        }\n    }\n}",COMPILE_ERROR,0,0
1317812255560876032,ec53039adbfa16331c9f18e1417ee9aff06a3bca71bca4365b8f05065abe9d6c,2020-10-18 20:58:20,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\npublic class Main{\n    public static bool search(int s){\n        int a[] = new int[1000];\n        for(int j = 2;j < 11;j++){ //12345\n            int temp = 0,int memo = 0;\n            for(int k = 0;s == 0;k++){\n                a[k] = s % j;\n                s /= j;\n                temp = k + 1;\n            }\n            if(a[temp - 1] == 0){\n                    return false;\n            }\n            for(int n = 0;n = temp/2;n++){\n                bool flag = (a[n] == a[temp - 1 - n]) ? true : false;\n                if(!flag){\n                    break;\n                }\n                \n            }\n            if(flag){\n                memo++;\n            }\n            bool flag_ = memo >=2 ? true : false;\n            if(flag_){\n                return true;\n            }\n         }\n        return false;\n       }\n        \n        \n        \n        \n        \n    }\n    public static void main(String []args){\n        Scanner scanner = new scanner(System.in);\n        int N = scanner.nextInt();\n        int S = scanner.nextInt();\n        int count = 0;\n        for (int i = S + 1;;i++){\n            if(count >= N) break;\n            if(search(i)) {\n                count++;\n                System.out.println(i);              \n        }\n    }\n}",COMPILE_ERROR,0,0
1317812339371560960,ec53039adbfa16331c9f18e1417ee9aff06a3bca71bca4365b8f05065abe9d6c,2020-10-18 20:58:40,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\npublic class Main{\n    public static bool search(int s){\n        int a[] = new int[1000];\n        for(int j = 2;j < 11;j++){ //12345\n            int temp = 0, memo = 0;\n            for(int k = 0;s == 0;k++){\n                a[k] = s % j;\n                s /= j;\n                temp = k + 1;\n            }\n            if(a[temp - 1] == 0){\n                    return false;\n            }\n            for(int n = 0;n = temp/2;n++){\n                bool flag = (a[n] == a[temp - 1 - n]) ? true : false;\n                if(!flag){\n                    break;\n                }\n                \n            }\n            if(flag){\n                memo++;\n            }\n            bool flag_ = memo >=2 ? true : false;\n            if(flag_){\n                return true;\n            }\n         }\n        return false;\n       }\n        \n        \n        \n        \n        \n    }\n    public static void main(String []args){\n        Scanner scanner = new scanner(System.in);\n        int N = scanner.nextInt();\n        int S = scanner.nextInt();\n        int count = 0;\n        for (int i = S + 1;;i++){\n            if(count >= N) break;\n            if(search(i)) {\n                count++;\n                System.out.println(i);              \n        }\n    }\n}",COMPILE_ERROR,0,0
1317812442534559744,ec53039adbfa16331c9f18e1417ee9aff06a3bca71bca4365b8f05065abe9d6c,2020-10-18 20:59:04,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\npublic class Main{\n    public static bool search(int s){\n        int a[] = new int[1000];\n        for(int j = 2;j < 11;j++){ //12345\n            int temp = 0, memo = 0;\n            for(int k = 0;s == 0;k++){\n                a[k] = s % j;\n                s /= j;\n                temp = k + 1;\n            }\n            if(a[temp - 1] == 0){\n                    return false;\n            }\n            for(int n = 0;n = temp/2;n++){\n                bool flag = (a[n] == a[temp - 1 - n]) ? true : false;\n                if(!flag){\n                    break;\n                }\n                \n            }\n            if(flag){\n                memo++;\n            }\n            bool flag_ = memo >=2 ? true : false;\n            if(flag_){\n                return true;\n            }\n         }\n        return false;\n       }\n        \n        \n        \n        \n        \n    }\n}\n    public static void main(String []args){\n        Scanner scanner = new scanner(System.in);\n        int N = scanner.nextInt();\n        int S = scanner.nextInt();\n        int count = 0;\n        for (int i = S + 1;;i++){\n            if(count >= N) break;\n            if(search(i)) {\n                count++;\n                System.out.println(i);              \n        }\n    }\n}",COMPILE_ERROR,0,0
1317812586772582400,ec53039adbfa16331c9f18e1417ee9aff06a3bca71bca4365b8f05065abe9d6c,2020-10-18 20:59:39,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\npublic class Main{\n    public static bool search(int s){\n        int a[] = new int[1000];\n        for(int j = 2;j < 11;j++){ //12345\n            int temp = 0, memo = 0;\n            for(int k = 0;s == 0;k++){\n                a[k] = s % j;\n                s /= j;\n                temp = k + 1;\n            }\n            if(a[temp - 1] == 0){\n                    return false;\n            }\n            for(int n = 0;n = temp/2;n++){\n                bool flag = (a[n] == a[temp - 1 - n]) ? true : false;\n                if(!flag){\n                    break;\n                }\n                \n            }\n            if(flag){\n                memo++;\n            }\n            bool flag_ = memo >=2 ? true : false;\n            if(flag_){\n                return true;\n            }\n         }\n        return false;\n       }\n        \n        \n        \n        \n        \n    }\n}}\n    public static void main(String []args){\n        Scanner scanner = new scanner(System.in);\n        int N = scanner.nextInt();\n        int S = scanner.nextInt();\n        int count = 0;\n        for (int i = S + 1;;i++){\n            if(count >= N) break;\n            if(search(i)) {\n                count++;\n                System.out.println(i);              \n        }\n    }\n}",COMPILE_ERROR,0,0
1317812632792485888,ec53039adbfa16331c9f18e1417ee9aff06a3bca71bca4365b8f05065abe9d6c,2020-10-18 20:59:50,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\npublic class Main{\n    public static bool search(int s){\n        int a[] = new int[1000];\n        for(int j = 2;j < 11;j++){ //12345\n            int temp = 0, memo = 0;\n            for(int k = 0;s == 0;k++){\n                a[k] = s % j;\n                s /= j;\n                temp = k + 1;\n            }\n            if(a[temp - 1] == 0){\n                    return false;\n            }\n            for(int n = 0;n = temp/2;n++){\n                bool flag = (a[n] == a[temp - 1 - n]) ? true : false;\n                if(!flag){\n                    break;\n                }\n                \n            }\n            if(flag){\n                memo++;\n            }\n            bool flag_ = memo >=2 ? true : false;\n            if(flag_){\n                return true;\n            }\n         }\n        return false;\n       }\n        \n        \n        \n        \n        \n    }\n}}}\n    public static void main(String []args){\n        Scanner scanner = new scanner(System.in);\n        int N = scanner.nextInt();\n        int S = scanner.nextInt();\n        int count = 0;\n        for (int i = S + 1;;i++){\n            if(count >= N) break;\n            if(search(i)) {\n                count++;\n                System.out.println(i);              \n        }\n    }\n}",COMPILE_ERROR,0,0
1317813895991021568,ec53039adbfa16331c9f18e1417ee9aff06a3bca71bca4365b8f05065abe9d6c,2020-10-18 21:04:51,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\npublic class Main{\n    public static bool search(int s){\n        int a[] = new int[1000];\n        for(int j = 2;j < 11;j++){ \n            int temp = 0, memo = 0;\n            for(int k = 0;s == 0;k++){\n                a[k] = s % j;\n                s /= j;\n                temp = k + 1;\n            }\n            if(a[temp - 1] == 0){\n                    return false;\n            }\n            for(int n = 0;n = temp/2;n++){\n                bool flag = (a[n] == a[temp - 1 - n]) ? true : false;\n                if(!flag){\n                    break;\n                }\n                \n            }\n            if(flag){\n                memo++;\n            }\n            bool flag_ = memo >=2 ? true : false;\n            if(flag_){\n                return true;\n            }\n        return false;\n       }\n        \n        \n        \n        \n        \n    \n\n    public static void main(String []args){\n        Scanner scanner = new scanner(System.in);\n        int N = scanner.nextInt();\n        int S = scanner.nextInt();\n        int count = 0;\n        for (int i = S + 1;;i++){\n            if(count >= N) {\n                break;\n            }   \n            if(search(i)) {\n                count++;\n                System.out.println(i); \n            }\n        }\n    \n}",COMPILE_ERROR,0,0
1317814141622046720,ec53039adbfa16331c9f18e1417ee9aff06a3bca71bca4365b8f05065abe9d6c,2020-10-18 21:05:49,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\npublic class Main{\n    public static bool search(int s){\n        int a[] = new int[1000];\n        for(int j = 2;j < 11;j++){ \n            int temp = 0, memo = 0;\n            for(int k = 0;s == 0;k++){\n                a[k] = s % j;\n                s /= j;\n                temp = k + 1;\n            }\n            if(a[temp - 1] == 0){\n                    return false;\n            }\n            for(int n = 0;n = temp/2;n++){\n                bool flag = (a[n] == a[temp - 1 - n]) ? true : false;\n                if(!flag){\n                    break;\n                }\n                \n            }\n            if(flag){\n                memo++;\n            }\n            bool flag_ = memo >=2 ? true : false;\n            if(flag_){\n                return true;\n            }\n        return false;\n       }\n        \n        \n        \n        \n        \n    \n\n    public static void main(String []args){\n        Scanner scanner = new scanner(System.in);\n        int N = scanner.nextInt();\n        int S = scanner.nextInt();\n        int count = 0;\n        for (int i = S + 1;;i++){\n            if(count >= N) {\n                break;\n            }   \n            if(search(i)) {\n                count++;\n                System.out.println(i); \n            }\n        }\n    \n}",COMPILE_ERROR,0,0
1317814413123436544,ec53039adbfa16331c9f18e1417ee9aff06a3bca71bca4365b8f05065abe9d6c,2020-10-18 21:06:54,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\npublic class Main{\n    public static bool search(int s){\n        int a[] = new int[1000];\n        for(int j = 2;j < 11;j++){ \n            int temp = 0, memo = 0;\n            for(int k = 0;s == 0;k++){\n                a[k] = s % j;\n                s /= j;\n                temp = k + 1;\n            }\n            if(a[temp - 1] == 0){\n                    return false;\n            }\n            for(int n = 0;n = temp/2;n++){\n                bool flag = (a[n] == a[temp - 1 - n]) ? true : false;\n                if(!flag){\n                    break;\n                }\n                \n            }\n            if(flag){\n                memo++;\n            }\n            bool flag_ = memo >=2 ? true : false;\n            if(flag_){\n                return true;\n            }\n        return false;\n       }\n        \n        \n        \n        \n        \n    \n\n    public static void main(String []args){\n        Scanner scanner = new scanner(System.in);\n        int N = scanner.nextInt();\n        int S = scanner.nextInt();\n        int count = 0;\n        for (int i = S + 1;;i++){\n            if(count >= N) {\n                break;\n            }   \n            if(search(i)) {\n                count++;\n                System.out.println(i); \n            }\n        }\n    \n}",COMPILE_ERROR,0,0
1317817492577239040,ec53039adbfa16331c9f18e1417ee9aff06a3bca71bca4365b8f05065abe9d6c,2020-10-18 21:19:08,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\npublic class Main {\n    public static boolean search(int s) {\n        int a[] = new int[1000];\n        for (int j = 2; j < 11; j++) {\n            int temp = 0, memo = 0;\n            for (int k = 0; s == 0; k++) {\n                a[k] = s % j;\n                s /= j;\n                temp = k + 1;\n            }\n            if (a[temp - 1] == 0) {\n                return false;\n            }\n            for (int n = 0; n == temp / 2; n++) {\n                boolean flag = (a[n] == a[temp - 1 - n]) ? true : false;\n                if (!flag) {\n                    break;\n                }\n                if (flag == true) {\n                    memo++;\n                }\n\n            }\n            boolean flag_ = memo >= 2 ? true : false;\n            if (flag_) {\n                return true;\n            }\n           \n        }\n        return false;\n    }\n    \n\n        \n        public static void main(String []args){\n            Scanner scanner = new Scanner(System.in);\n            int N = scanner.nextInt();\n            int S = scanner.nextInt();\n            int count = 0;\n            for (int i = S + 1;;i++){\n                if(count >= N) {\n                    break;\n                }\n                if(search(i)) {\n                    count++;\n                    System.out.println(i);\n                }\n            }\n\n        }",COMPILE_ERROR,0,0
1317817718725722112,ec53039adbfa16331c9f18e1417ee9aff06a3bca71bca4365b8f05065abe9d6c,2020-10-18 21:20:02,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\npublic class Main {\n    public static boolean search(int s) {\n        int a[] = new int[1000];\n        for (int j = 2; j < 11; j++) {\n            int temp = 0, memo = 0;\n            for (int k = 0; s == 0; k++) {\n                a[k] = s % j;\n                s /= j;\n                temp = k + 1;\n            }\n            if (a[temp - 1] == 0) {\n                return false;\n            }\n            for (int n = 0; n == temp / 2; n++) {\n                boolean flag = (a[n] == a[temp - 1 - n]) ? true : false;\n                if (!flag) {\n                    break;\n                }\n                if (flag == true) {\n                    memo++;\n                }\n\n            }\n            boolean flag_ = memo >= 2 ? true : false;\n            if (flag_) {\n                return true;\n            }\n           \n        }\n        return false;\n    }\n    \n\n        \n        public static void main(String []args){\n            Scanner scanner = new Scanner(System.in);\n            int N = scanner.nextInt();\n            int S = scanner.nextInt();\n            int count = 0;\n            for (int i = S + 1;;i++){\n                if(count >= N) {\n                    break;\n                }\n                if(search(i)) {\n                    count++;\n                    System.out.println(i);\n                }\n            }\n\n        }",COMPILE_ERROR,0,0
1317817977296175104,ec53039adbfa16331c9f18e1417ee9aff06a3bca71bca4365b8f05065abe9d6c,2020-10-18 21:21:04,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\npublic class Main {\n    public static boolean search(int s) {\n        int a[] = new int[1000];\n        for (int j = 2; j < 11; j++) {\n            int temp = 0, memo = 0;\n            for (int k = 0; s == 0; k++) {\n                a[k] = s % j;\n                s /= j;\n                temp = k + 1;\n            }\n            if (a[temp - 1] == 0) {\n                return false;\n            }\n            for (int n = 0; n == temp / 2; n++) {\n                boolean flag = (a[n] == a[temp - 1 - n]) ? true : false;\n                if (!flag) {\n                    break;\n                }\n                if (flag == true) {\n                    memo++;\n                }\n\n            }\n            boolean flag_ = memo >= 2 ? true : false;\n            if (flag_) {\n                return true;\n            }\n           \n        }\n        return false;\n    }\n    \n\n        \n        public static void main(String []args){\n            Scanner scanner = new Scanner(System.in);\n            int N = scanner.nextInt();\n            int S = scanner.nextInt();\n            int count = 0;\n            for (int i = S + 1;;i++){\n                if(count >= N) {\n                    break;\n                }\n                if(search(i)) {\n                    count++;\n                    System.out.println(i);\n                }\n            }\n\n        }\n}",WRONG_ANSWER,1008,14180
1317818614713044992,ec53039adbfa16331c9f18e1417ee9aff06a3bca71bca4365b8f05065abe9d6c,2020-10-18 21:23:36,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\npublic class Main {\n    public static boolean search(int s) {\n        int a[] = new int[1000];\n        for (int j = 2; j < 11; j++) {\n            int temp = 0, memo = 0;\n            for (int k = 0; s == 0; k++) {\n                a[k] = s % j;\n                s /= j;\n                temp = k + 1;\n            }\n            if (a[temp - 1] == 0) {\n                return false;\n            }\n            for (int n = 0; n == temp / 2; n++) {\n                boolean flag = (a[n] == a[temp - 1 - n]) ? true : false;\n                if (!flag) {\n                    break;\n                }\n                if (flag == true) {\n                    memo++;\n                }\n\n            }\n            boolean flag_ = memo >= 2 ? true : false;\n            if (flag_) {\n                return true;\n            }\n           \n        }\n        return false;\n    }\n    \n\n        \n        public static void main(String []args){\n            Scanner scanner = new Scanner(System.in);\n            int N = scanner.nextInt();\n            int S = scanner.nextInt();\n            int count = 0;\n            for (int i = S + 1;;i++){\n                if(count >= N) {\n                    break;\n                }\n                if(search(i)) {\n                    count++;\n                    System.out.println(i);\n                }\n            }\n\n        }\n}",WRONG_ANSWER,960,13992
1318117042013753344,d2d1ecd5d95661062fd9a3e5a165f2959770250103ccbf15f123c5f583f532c8,2020-10-19 17:09:26,Java,10.0,1306870976110592008,1267449136707624960,1049226397448056832,"\nimport java.util.Scanner;\n\npublic class Main{\n    private static int[] s=new int[300];\n    private static int n;\n    private static int a;\n    public static void jz(int a,int b){\n        int r=0;\n        while(a==1){\n            s[++r]=a%b;\n            a=a/b;\n        }\n        s[0]=r;\n    }\n    public static boolean change(){\n        for(int i=1;i<s[0];i++){\n            if(s[i]!=s[s[0]+1-i])\n                return false;\n        }\n        return true;\n    }\n    public static void print(){\n        for(int i=s[0];i>=1;i--){\n            if(s[i]<=9)\n                System.out.println(s[i]);\n            else System.out.println((char)(s[i]-10+'A'));\n        }\n    }\n    public static void main(String[] args) {\n        Scanner in=new Scanner(System.in);\n        n=in.nextInt();\n        a=in.nextInt();\n        int r=a+1;\n        for(int i=1;i<=n;){\n            int sum=0;\n            for(int j=2;j<=10;j++){\n                jz(r,j);\n                if(change())\n                    sum++;\n            }\n            if(sum>=2){\n                System.out.println(r);\n                i++;\n            }\n            r++;\n        }\n    }\n}",PARTIAL_ACCEPTED,1053,13820
1318157645774737408,8ce28e707958fb1cc3532c825490839ff6e48ed9deb2e97a20544ac4a14a4f1a,2020-10-19 19:50:47,Java,10.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\tstatic boolean isSym(int n,int B) {\n\t\tint nn = n*n;\n\t\tchar N[] = Integer.toString(n, B).toCharArray();\n\t\tchar NN[] = Integer.toString(nn, B).toCharArray();\n\t\tfor (int i = 0;i<N.length;i++) {\n\t\t\tif (!(N[i]==N[N.length-i-1])) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0;i<NN.length;i++) {\n\t\t\tif (!(NN[i]==NN[NN.length-i-1])) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner cin = new Scanner(System.in);\n\t\tint B;\n\t\tB = cin.nextInt();\n\t\tcin.close();\n\t\tfor (int i = 1;i<=300;i++) {\n\t\t\tif (isSym(i, B)) {\n\t\t\t\tSystem.out.print(Integer.toString(i, B)+\"" \"");\n\t\t\t\tSystem.out.println(Integer.toString(i*i, B));\n\t\t\t}\n\t\t}\n\n\t}\n\n}\n",PARTIAL_ACCEPTED,1197,14424
1318158138987139072,8ce28e707958fb1cc3532c825490839ff6e48ed9deb2e97a20544ac4a14a4f1a,2020-10-19 19:52:45,Java,50.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\tstatic boolean isSym(int n,int B) {\n\t\tint nn = n*n;\n\t\t\n\t\tchar NN[] = Integer.toString(nn, B).toCharArray();\n\t\t\n\t\tfor (int i = 0;i<NN.length;i++) {\n\t\t\tif (!(NN[i]==NN[NN.length-i-1])) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner cin = new Scanner(System.in);\n\t\tint B;\n\t\tB = cin.nextInt();\n\t\tcin.close();\n\t\tfor (int i = 1;i<=300;i++) {\n\t\t\tif (isSym(i, B)) {\n\t\t\t\tSystem.out.print(Integer.toString(i, B)+\"" \"");\n\t\t\t\tSystem.out.println(Integer.toString(i*i, B));\n\t\t\t}\n\t\t}\n\t\t\n\n\t}\n\n}\n",PARTIAL_ACCEPTED,1105,14208
1318159399484542976,8ce28e707958fb1cc3532c825490839ff6e48ed9deb2e97a20544ac4a14a4f1a,2020-10-19 19:57:45,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\tstatic boolean isSym(int n,int B) {\n\t\tint nn = n*n;\n\t\t\n\t\tchar NN[] = Integer.toString(nn, B).toCharArray();\n\t\t\n\t\tfor (int i = 0;i<NN.length;i++) {\n\t\t\tif (!(NN[i]==NN[NN.length-i-1])) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner cin = new Scanner(System.in);\n\t\tint B;\n\t\tB = cin.nextInt();\n\t\tcin.close();\n\t\tfor (int i = 1;i<=300;i++) {\n\t\t\tif (isSym(i, B)) {\n\t\t\t\tSystem.out.print(Integer.toString(i, B).toUpperCase()+\"" \"");\n\t\t\t\tSystem.out.println(Integer.toString(i*i, B).toUpperCase());\n\t\t\t}\n\t\t}\n\t\t\n\n\t}\n\n}\n",ACCEPTED,1067,14100
1318160719213907968,a1d56106855db780882e1d55cddf2b290a70058a39946cf9586596170ecab4a0,2020-10-19 20:03:00,Java,60.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main{\n\tpublic static void main(String args[]) {\n\t\tint N, S;\n\t\tScanner sc = new Scanner(System.in);\n\t\tN = sc.nextInt();\n\t\tS = sc.nextInt();\n\t\tint s[] = new int[40];\n\t\tint t = 0;\n\t\tfor(int i=S+1;i<10000;i++) {\n\t\t\tint n = 0;\n\t\t\tfor(int j=2;j<=10;j++) {\n\t\t\t\tint a = i;\n\t\t\t\tint x = 39;\n\t\t\t\twhile(a>0) {\n\t\t\t\t\ts[x] = a%j;\n\t\t\t\t\ta /= j;\n\t\t\t\t\tx--;\n\t\t\t\t}\n\t\t\t\tif(com(s,x) == 1) {\n\t\t\t\t\tn++;\n\t\t\t\t}\n\t\t\t\tif(n>=2) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(n>=2) {\n\t\t\t\tSystem.out.println(i);\n\t\t\t\tt++;\n\t\t\t}\n\t\t\tif(t==N)\n\t\t\t\tbreak;\n\t\t}\n\t}\n\tstatic public int com(int[] a,int x){\n        int sign = 1;\n        for(int j=39;j>x;j--) {\n        \tif(a[j] != a[x+40-j]) {\n        \t\tsign = 0;\n        \t\tbreak;\n        \t}\n        }\n        return sign;\n\t}\n}\n",PARTIAL_ACCEPTED,904,14048
1318162118161092608,8ce28e707958fb1cc3532c825490839ff6e48ed9deb2e97a20544ac4a14a4f1a,2020-10-19 20:08:33,Java,10.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\n\tstatic boolean isSym(int n,int B) {\n\t\t\n\t\t\n\t\tchar N[] = Integer.toString(n, B).toCharArray();\n\t\t\n\t\tfor (int i = 0;i<N.length;i++) {\n\t\t\tif (!(N[i]==N[N.length-i-1])) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\tpublic static void main(String[] args) {\n\t\tScanner cin = new Scanner(System.in);\n\t\tint N,S;\n\t\tN = cin.nextInt();//前N个\n\t\tS = cin.nextInt();//大于S\n\t\tcin.close();\n\t\tint countN = 0;\n\t\tint countB = 0;\n\t\tfor (int i = S+1;;i++) {\n\t\t\tfor (int B = 2;B<=10;B++) {\n\t\t\t\tif (isSym(i, B)) {\n\t\t\t\t\tcountB++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (countB>=2) {\n\t\t\t\tSystem.out.println(i);\n\t\t\t\tcountN++;\n\t\t\t}\n\t\t\tif (countN==N) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t}\n\n}\n",PARTIAL_ACCEPTED,920,14348
1318162163799314432,8ce28e707958fb1cc3532c825490839ff6e48ed9deb2e97a20544ac4a14a4f1a,2020-10-19 20:08:44,Java,10.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\n\tstatic boolean isSym(int n,int B) {\n\t\t\n\t\t\n\t\tchar N[] = Integer.toString(n, B).toCharArray();\n\t\t\n\t\tfor (int i = 0;i<N.length;i++) {\n\t\t\tif (!(N[i]==N[N.length-i-1])) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\tpublic static void main(String[] args) {\n\t\tScanner cin = new Scanner(System.in);\n\t\tint N,S;\n\t\tN = cin.nextInt();//前N个\n\t\tS = cin.nextInt();//大于S\n\t\tcin.close();\n\t\tint countN = 0;\n\t\tint countB = 0;\n\t\tfor (int i = S+1;;i++) {\n\t\t\tfor (int B = 2;B<=10;B++) {\n\t\t\t\tif (isSym(i, B)) {\n\t\t\t\t\tcountB++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (countB>=2) {\n\t\t\t\tSystem.out.println(i);\n\t\t\t\tcountN++;\n\t\t\t}\n\t\t\tif (countN==N) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t}\n\n}\n",PARTIAL_ACCEPTED,986,13964
1318162254643744768,8ce28e707958fb1cc3532c825490839ff6e48ed9deb2e97a20544ac4a14a4f1a,2020-10-19 20:09:06,Java,10.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\n\tstatic boolean isSym(int n,int B) {\n\t\t\n\t\t\n\t\tchar N[] = Integer.toString(n, B).toCharArray();\n\t\t\n\t\tfor (int i = 0;i<N.length;i++) {\n\t\t\tif (!(N[i]==N[N.length-i-1])) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\tpublic static void main(String[] args) {\n\t\tScanner cin = new Scanner(System.in);\n\t\tint N,S;\n\t\tN = cin.nextInt();//前N个\n\t\tS = cin.nextInt();//大于S\n\t\tcin.close();\n\t\tint countN = 0;\n\t\tint countB = 0;\n\t\tfor (int i = S+1;;i++) {\n\t\t\tfor (int B = 2;B<=10;B++) {\n\t\t\t\tif (isSym(i, B)) {\n\t\t\t\t\tcountB++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (countB>=2) {\n\t\t\t\tSystem.out.println(i);\n\t\t\t\tcountN++;\n\t\t\t}\n\t\t\tif (countN==N) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t}\n\n}\n\n",PARTIAL_ACCEPTED,890,14140
1318162268547862528,8ce28e707958fb1cc3532c825490839ff6e48ed9deb2e97a20544ac4a14a4f1a,2020-10-19 20:09:09,Java,10.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\n\tstatic boolean isSym(int n,int B) {\n\t\t\n\t\t\n\t\tchar N[] = Integer.toString(n, B).toCharArray();\n\t\t\n\t\tfor (int i = 0;i<N.length;i++) {\n\t\t\tif (!(N[i]==N[N.length-i-1])) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\tpublic static void main(String[] args) {\n\t\tScanner cin = new Scanner(System.in);\n\t\tint N,S;\n\t\tN = cin.nextInt();//前N个\n\t\tS = cin.nextInt();//大于S\n\t\tcin.close();\n\t\tint countN = 0;\n\t\tint countB = 0;\n\t\tfor (int i = S+1;;i++) {\n\t\t\tfor (int B = 2;B<=10;B++) {\n\t\t\t\tif (isSym(i, B)) {\n\t\t\t\t\tcountB++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (countB>=2) {\n\t\t\t\tSystem.out.println(i);\n\t\t\t\tcountN++;\n\t\t\t}\n\t\t\tif (countN==N) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t}\n\n}\n\n",PARTIAL_ACCEPTED,948,14316
1318163752006078464,a1d56106855db780882e1d55cddf2b290a70058a39946cf9586596170ecab4a0,2020-10-19 20:15:03,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        int n,s,count=0;\n        Scanner scanner = new Scanner(System.in);\n        n=scanner.nextInt();\n        s=scanner.nextInt();\n        int []num=new int[n];\n        for (int i = s+1;count<n;i++){\n            int temp=0;\n            for(int j = 2 ;j<=10;j++){\n                if(isPalin(convert(i,j))){\n                    temp++;\n                }\n                if(temp>=2){\n                    num[count]=i;\n                    count++;\n                    break;\n                }\n            }\n        }\n        for(int i = 0; i<num.length;i++){\n            System.out.println(num[i]);\n        }\n    }\n    public static boolean isPalin(StringBuffer s){\n        for (int i=0;i<s.length()/2;i++){\n            if(s.charAt(i)!=s.charAt(s.length()-i-1)){\n                return false;\n            }\n        }\n        return true;\n    }\n    public static StringBuffer convert(int num,int B) {\n        StringBuffer rtnval = new StringBuffer();\n        int digit;\n        while (num > 0) {\n            digit = num % B;\n            if (digit >= 10) {\n                rtnval.append((char) ('A' + digit - 10));\n            } else {\n                rtnval.append(digit);\n            }\n            num /= B;\n        }\n        return rtnval.reverse();\n    }\n}",ACCEPTED,1016,17768
1318164234246180864,8ce28e707958fb1cc3532c825490839ff6e48ed9deb2e97a20544ac4a14a4f1a,2020-10-19 20:16:58,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tint AllAnser[] = {0,1,2,3,4,5,6,7,8,9,10,15,16,\n\t\t\t\t17,18,20,21,24,26,27,28,31,\n\t\t\t\t33,36,40,45,46,50,51,52,55,\n\t\t\t\t57,63,65,67,73,78,80,82,85,\n\t\t\t\t88,91,92,93,98,99,100,104,105,107,\n\t\t\t\t109,111,114,119,121,127,129,130,135,141,\n\t\t\t\t142,150,151,154,160,164,170,171,173,178,\n\t\t\t\t182,185,186,191,195,200,203,209,212,215,\n\t\t\t\t219,227,235,242,246,252,255,257,264,273,\n\t\t\t\t282,292,300,313,316,325,328,333,341,342,\n\t\t\t\t343,357,364,365,373,381,393,400,414,427,\n\t\t\t\t434,438,446,455,464,471,484,495,511,513,\n\t\t\t\t546,555,560,564,585,624,626,644,646,651,\n\t\t\t\t656,666,676,692,693,701,717,728,730,757,\n\t\t\t\t771,777,787,819,820,856,868,910,939,975,\n\t\t\t\t1023,1025,1066,1105,1221,1285,1312,1365,1432,1441,\n\t\t\t\t1460,1539,1550,1640,1667,1755,1885,2000,2188,2268,\n\t\t\t\t2293,2550,2565,2709,2730,2910,2920,2925,2997,3069,\n\t\t\t\t3074,3075,3280,3315,3550,3591,3640,3663,3735,3740,\n\t\t\t\t3855,3951,3999,4095,4097,4161,4225,4257,4289,4369,\n\t\t\t\t4433,4593,4617,4681,5001,5049,5125,5189,5397,5461,\n\t\t\t\t5740,5840,5854,6148,6200,6560,6562,6643,6697,6724,\n\t\t\t\t6761,6825,6886,6889,6953,7300,7373,7381,7409,7447,\n\t\t\t\t7462,7517,7667,7703,7777,7801,7997,8038,8119,8194,\n\t\t\t\t8200,8258,8281,8322,8386,8578,8778,8802,9009,9103,\n\t\t\t\t9201,9222,9490,9958,10252,10308,10658,10794,10858,10922,\n\t\t\t\t10986,11253,11314,11757,11898,11950,12291,12355,12419,12483, \n\t\t\t\t12547,12654,12691,13107,13124,13131,13205,13286,13299,13331};\n\t\tScanner cin = new Scanner(System.in);\n\t\tcin.close();\n\t\tint n = cin.nextInt();\n\t\tint s = cin.nextInt();\n\t\tint g;\n\t\tfor(g=1;AllAnser[g]<=s;g++);\n\t\tfor(int i=0;i<n;i++)System.out.println(AllAnser[g+i]);\n\n\t}\n\n}\n",WRONG_ANSWER,913,14040
1318164454048681984,8ce28e707958fb1cc3532c825490839ff6e48ed9deb2e97a20544ac4a14a4f1a,2020-10-19 20:17:50,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tint AllAnser[] = {0,1,2,3,4,5,6,7,8,9,10,15,16,\n\t\t\t\t17,18,20,21,24,26,27,28,31,\n\t\t\t\t33,36,40,45,46,50,51,52,55,\n\t\t\t\t57,63,65,67,73,78,80,82,85,\n\t\t\t\t88,91,92,93,98,99,100,104,105,107,\n\t\t\t\t109,111,114,119,121,127,129,130,135,141,\n\t\t\t\t142,150,151,154,160,164,170,171,173,178,\n\t\t\t\t182,185,186,191,195,200,203,209,212,215,\n\t\t\t\t219,227,235,242,246,252,255,257,264,273,\n\t\t\t\t282,292,300,313,316,325,328,333,341,342,\n\t\t\t\t343,357,364,365,373,381,393,400,414,427,\n\t\t\t\t434,438,446,455,464,471,484,495,511,513,\n\t\t\t\t546,555,560,564,585,624,626,644,646,651,\n\t\t\t\t656,666,676,692,693,701,717,728,730,757,\n\t\t\t\t771,777,787,819,820,856,868,910,939,975,\n\t\t\t\t1023,1025,1066,1105,1221,1285,1312,1365,1432,1441,\n\t\t\t\t1460,1539,1550,1640,1667,1755,1885,2000,2188,2268,\n\t\t\t\t2293,2550,2565,2709,2730,2910,2920,2925,2997,3069,\n\t\t\t\t3074,3075,3280,3315,3550,3591,3640,3663,3735,3740,\n\t\t\t\t3855,3951,3999,4095,4097,4161,4225,4257,4289,4369,\n\t\t\t\t4433,4593,4617,4681,5001,5049,5125,5189,5397,5461,\n\t\t\t\t5740,5840,5854,6148,6200,6560,6562,6643,6697,6724,\n\t\t\t\t6761,6825,6886,6889,6953,7300,7373,7381,7409,7447,\n\t\t\t\t7462,7517,7667,7703,7777,7801,7997,8038,8119,8194,\n\t\t\t\t8200,8258,8281,8322,8386,8578,8778,8802,9009,9103,\n\t\t\t\t9201,9222,9490,9958,10252,10308,10658,10794,10858,10922,\n\t\t\t\t10986,11253,11314,11757,11898,11950,12291,12355,12419,12483, \n\t\t\t\t12547,12654,12691,13107,13124,13131,13205,13286,13299,13331};\n\t\tScanner cin = new Scanner(System.in);\n\t\t\n\t\tint n = cin.nextInt();\n\t\tint s = cin.nextInt();\n\t\tcin.close();\n\t\tint g;\n\t\tfor(g=1;AllAnser[g]<=s;g++);\n\t\tfor(int i=0;i<n;i++)System.out.println(AllAnser[g+i]);\n\n\t}\n\n}\n",ACCEPTED,855,14264
1318164495308050432,8ce28e707958fb1cc3532c825490839ff6e48ed9deb2e97a20544ac4a14a4f1a,2020-10-19 20:18:00,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tint AllAnser[] = {0,1,2,3,4,5,6,7,8,9,10,15,16,\n\t\t\t\t17,18,20,21,24,26,27,28,31,\n\t\t\t\t33,36,40,45,46,50,51,52,55,\n\t\t\t\t57,63,65,67,73,78,80,82,85,\n\t\t\t\t88,91,92,93,98,99,100,104,105,107,\n\t\t\t\t109,111,114,119,121,127,129,130,135,141,\n\t\t\t\t142,150,151,154,160,164,170,171,173,178,\n\t\t\t\t182,185,186,191,195,200,203,209,212,215,\n\t\t\t\t219,227,235,242,246,252,255,257,264,273,\n\t\t\t\t282,292,300,313,316,325,328,333,341,342,\n\t\t\t\t343,357,364,365,373,381,393,400,414,427,\n\t\t\t\t434,438,446,455,464,471,484,495,511,513,\n\t\t\t\t546,555,560,564,585,624,626,644,646,651,\n\t\t\t\t656,666,676,692,693,701,717,728,730,757,\n\t\t\t\t771,777,787,819,820,856,868,910,939,975,\n\t\t\t\t1023,1025,1066,1105,1221,1285,1312,1365,1432,1441,\n\t\t\t\t1460,1539,1550,1640,1667,1755,1885,2000,2188,2268,\n\t\t\t\t2293,2550,2565,2709,2730,2910,2920,2925,2997,3069,\n\t\t\t\t3074,3075,3280,3315,3550,3591,3640,3663,3735,3740,\n\t\t\t\t3855,3951,3999,4095,4097,4161,4225,4257,4289,4369,\n\t\t\t\t4433,4593,4617,4681,5001,5049,5125,5189,5397,5461,\n\t\t\t\t5740,5840,5854,6148,6200,6560,6562,6643,6697,6724,\n\t\t\t\t6761,6825,6886,6889,6953,7300,7373,7381,7409,7447,\n\t\t\t\t7462,7517,7667,7703,7777,7801,7997,8038,8119,8194,\n\t\t\t\t8200,8258,8281,8322,8386,8578,8778,8802,9009,9103,\n\t\t\t\t9201,9222,9490,9958,10252,10308,10658,10794,10858,10922,\n\t\t\t\t10986,11253,11314,11757,11898,11950,12291,12355,12419,12483, \n\t\t\t\t12547,12654,12691,13107,13124,13131,13205,13286,13299,13331};\n\t\tScanner cin = new Scanner(System.in);\n\t\t\n\t\tint n = cin.nextInt();\n\t\tint s = cin.nextInt();\n\t\tcin.close();\n\t\tint g;\n\t\tfor(g=1;AllAnser[g]<=s;g++);\n\t\tfor(int i=0;i<n;i++)System.out.println(AllAnser[g+i]);\n\n\t}\n\n}\n",ACCEPTED,955,14236
1318165024566300672,8ce28e707958fb1cc3532c825490839ff6e48ed9deb2e97a20544ac4a14a4f1a,2020-10-19 20:20:06,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\n\tstatic boolean isSym(int n,int B) {\n\t\t\n\t\t\n\t\tchar N[] = Integer.toString(n, B).toCharArray();\n\t\t\n\t\tfor (int i = 0;i<N.length;i++) {\n\t\t\tif (!(N[i]==N[N.length-i-1])) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\tpublic static void main(String[] args) {\n\t\tScanner cin = new Scanner(System.in);\n\t\tint N,S;\n\t\tN = cin.nextInt();//前N个\n\t\tS = cin.nextInt();//大于S\n\t\tcin.close();\n\t\tint countN = 0;\n\t\tint countB = 0;\n\t\tfor (int i = S+1;;i++) {\n\t\t\tcountB = 0;\n\t\t\tfor (int B = 2;B<=10;B++) {\n\t\t\t\tif (isSym(i, B)) {\n\t\t\t\t\tcountB++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (countB>=2) {\n\t\t\t\tSystem.out.println(i);\n\t\t\t\tcountN++;\n\t\t\t}\n\t\t\tif (countN==N) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t}\n\n}\n",ACCEPTED,1039,19508
1318246982990319616,c3e6f8ec2d23f7f807edf9bf11527d181f7fd2c4e0ae98ec2be0571dd32dde6c,2020-10-20 01:45:47,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"//package USACO;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.Iterator;\nimport java.util.Map;\nimport java.util.Scanner;\nimport java.util.ArrayList;\nimport java.util.Collections;\npublic class Main {\n\t\n\tstatic String hahaha (int x, int n) {\n\t\tStringBuilder str=new StringBuilder(\""\"");\n\t\tint num;\n\t    while(x>0) {\n\t        num=x%n;\n\t        if(num>=10) {\n\t            num=(char)(num-10+(int)'A');\n\t            StringBuilder numm=new StringBuilder(num);\n\t            str=numm.append(str);\n\t        }\n\t        else {\n\t            StringBuilder numm=new StringBuilder(num);\n\t        \tstr=numm.append(str);\n\t        }\n\t        x=x/n;\n\t    }\n\n\t\treturn str.toString();\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\t\n\t\tScanner input=new Scanner(System.in);\n\t\tint n= input.nextInt();\n\n\t\tString str;\n\t\tfor(int i=1;i<=300;i++) {\n\t\t\tint x;\n\t\t\tx=i*i;\n\t\t\tstr=hahaha(x,n);\n\t\t\tStringBuilder s=new StringBuilder(str);\n\t\t\tif(s==s.reverse())\n\t\t\t\tSystem.out.println(hahaha(i,n)+\"" \""+s);\n\t\t\tstr=new String(\""\"");\n\t\t}\n\n\t}\n}\n",WRONG_ANSWER,1269,16644
1318484085825228800,7a3d8a5cb6e64872eff3723c69b72cf82b811e301be96b2c6c3b9fc17cb28e65,2020-10-20 17:27:56,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"\nimport java.util.*;\npublic class Main{\n\tpublic static void main(String[] args)\n\t{\n\t\tScanner in = new Scanner(System.in);\n\t\tint N,S,i,j,k,count=0;\n\t\tN = in.nextInt();\n\t\tS = in.nextInt();\n\t\tfor(i = S+1; count<N; i++)\n\t\t{\n\t\t\tk=0;\n\t\t\tfor(j=2; j<=10; j++)\n\t\t\t{\n\t\t\t\tif(trans(i,j)==1)\n\t\t\t\t\tk++;\n\t\t\t}\n\t\t\tif(k>=2)\n\t\t\t{\n\t\t\t\tSystem.out.println(i);\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t}\n\tstatic public int trans(int num,int n)\n\t{\n\t\tint[]a=new int[100];\n\t\tint flag=1,i,d=0;\n\t\twhile(num!=0)\n\t\t{\n\t\t\td++;\n\t\t\ta[d]=num%n;\n\t\t\tnum=num/n;\n\t\t}\n\t\tfor(i=1; i<d/2+1; i++)\n\t\t\tif(a[i]!=a[d-i+1])\n\t\t\t{\n\t\t\t\tflag = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\treturn flag;\n\t}\n\t\n}",ACCEPTED,1053,23268
1318567277374623744,62c28946ff673e4465df1d3a3f199d062324c51b570f00bfca1efb71f0ba778b,2020-10-20 22:58:31,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main{\n    public static void main(String[] args) {\n        Scanner sc= new Scanner(System.in);\n        int B =sc.nextInt();\n        sc.close();\n        for (int i = 1;i<=300;i++){\n            StringBuffer n1= zhuan(i,B);\n            StringBuffer n2= zhuan(i*i,B);\n            if (jojo(n2)==true)\n                System.out.println(n1+\"" \""+n2);\n        }\n    }\n    public static StringBuffer zhuan(int num,int B) {\n        StringBuffer ghostl = new StringBuffer();\n        int ctt;\n        while (num > 0) {\n            ctt = num % B;\n            if (ctt >= 10) {\n                ghostl.append((char) ('A' + ctt - 10));\n            } else {\n                ghostl.append(ctt);\n            }\n            num /= B;\n        }\n        return ghostl.reverse();//翻转以后得到\n    }\n    public static boolean jojo(StringBuffer s){\n        for (int i=0;i<s.length()/2;i++){\n            if(s.charAt(i)!=s.charAt(s.length()-i-1)){\n                return false;\n            }\n        }\n        return true;\n    }\n    }",ACCEPTED,1189,14200
1318568733062352896,62c28946ff673e4465df1d3a3f199d062324c51b570f00bfca1efb71f0ba778b,2020-10-20 23:04:18,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main{\nboolean pan(int n,int k)\n{\n    int[] a=new int[30];\n    int i=0;\n    while(n!=0)\n    {\n        a[i++]=n%k;\n        n/=k;\n    }\n    for(int j=0;j<i/2;j++)\n        if(a[j]!=a[i-j-1])return false;\n    return true;\n}\npublic static void main(String[] args)\n{\n\tScanner sc=new Scanner(System.in);\n    int a,b;\n    a=sc.nextInt();\n    b=sc.nextInt();\n    sc.close();\n    int k=0;\n    for(int i=b+1;;i++)\n    {\n        int s=0;\n        for(int j=2;j<11;j++)\n        if(pan(i,j))\n        {\n            s++;\n            if(s==2)\n            {\n                k++;\n                break;\n            }\n        }\n        if(k>a)break;\n        if(s==2)System.out.println(i);\n    }\n}\n}",COMPILE_ERROR,0,0
1318568871101091840,62c28946ff673e4465df1d3a3f199d062324c51b570f00bfca1efb71f0ba778b,2020-10-20 23:04:51,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main{\nstatic boolean pan(int n,int k)\n{\n    int[] a=new int[30];\n    int i=0;\n    while(n!=0)\n    {\n        a[i++]=n%k;\n        n/=k;\n    }\n    for(int j=0;j<i/2;j++)\n        if(a[j]!=a[i-j-1])return false;\n    return true;\n}\npublic static void main(String[] args)\n{\n\tScanner sc=new Scanner(System.in);\n    int a,b;\n    a=sc.nextInt();\n    b=sc.nextInt();\n    sc.close();\n    int k=0;\n    for(int i=b+1;;i++)\n    {\n        int s=0;\n        for(int j=2;j<11;j++)\n        if(pan(i,j))\n        {\n            s++;\n            if(s==2)\n            {\n                k++;\n                break;\n            }\n        }\n        if(k>a)break;\n        if(s==2)System.out.println(i);\n    }\n}\n}",ACCEPTED,1002,17380
1318581911032844288,d2d1ecd5d95661062fd9a3e5a165f2959770250103ccbf15f123c5f583f532c8,2020-10-20 23:56:40,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"\nimport java.util.Scanner;\n\npublic class Main{\n    public static void main(String[] args) {\n        int n,s;\n        int[] a=new int[50];\n        Scanner in=new Scanner(System.in);\n        n=in.nextInt();\n        s=in.nextInt();\n        while(n!=0){\n            s++;\n            int f=0;\n            for (int i=2;i<=10;i++){\n                int c=s,l=0,b=0;\n                while (c!=0){\n                    a[++l]=c%i;\n                    c/=i;\n                }\n                for (int j=1;j<=l/2;j++)\n                    if (a[j]!=a[l-j+1]){\n                        b=1;\n                        break;\n                    }\n                if (b==0) f++;\n                if (f==2) break;\n            }\n            if (f==2){\n                System.out.println(s);\n                n--;\n            }\n        }\n    }\n}\n",ACCEPTED,1001,14144
1318597482361278464,b832f14117e713dbfde9a714298409ca6f1efc0686ffec562fd1f0663d0e11ac,2020-10-21 00:58:32,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"package main;\nimport java.util.*;\nimport java.lang.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner s = new Scanner(System.in);\n\t\tint n = s.nextInt();\n\t\tfor(int i = 1; i <= 300; i++) {\n\t\t\tint int_square = i*i;\n\t\t\tString str_square = change_binary(n, int_square);\n\t\t\tString str_i = change_binary(n, i);\n\t\t\tcheck_print_huiwen(str_i, str_square);\n\t\t\t\n\t\t}\n\t\ts.close();\n\t}\n\t\n\tpublic String int_to_string(int n) {\n\t\tString result=\""\"";\n\t\tint temp = n;\n\t\tint m=1;\n\t\tint i=1;\n\t\twhile(temp != 0) {\n\t\t\tString c;\n\t\t\tint M;\n\t\t\tM = (int) (n/Math.pow(10, i-1)); M=M%10;\n\t\t\ttemp -= m*Math.pow(10,i-1);\n\t\t\tc = Integer.toString(M);\n\t\t\tresult = c + result;\n\t\t}\n\t\t\n\t\treturn result;\n\t}\n\t\n\tstatic void check_print_huiwen(String origin, String num)\n\t{\n\t\tBoolean flag=true;\n\t\tfor(int i=0; i<num.length(); i++){\n\t\t\tif(num.substring(i) != num.substring(num.length()-i-1))\n\t\t\t\tflag = false;\n\t\t}\n\t\tif(flag)\n\t\t\tSystem.out.print(origin + \"" \"" + num + \""\\n\"");\n\t}\n\t\n\tstatic String change_binary(int n, int num) {\n\t\tif(n==10)\n\t\t\treturn Integer.toString(num);\n\t\telse {\n\t\t\tString result = \""\"";\n\t\t\tArrayList result_list = new ArrayList();\n\t\t\tArrayList remainders = new ArrayList();\n\t\t\tint devided = num;\n\t\t\twhile(devided >= n) {\n\t\t\t\tint temp = devided%n;\n\t\t\t\tdevided /= n;\n\t\t\t\tif(temp <= 9)\n\t\t\t\t\tremainders.add(Integer.toString(temp));\n\t\t\t\telse\n\t\t\t\t\tremainders.add('A' + temp - 10);\n\t\t\t\tfor(int i = 0; i < remainders.size(); i++) {\n\t\t\t\t\tresult_list.add(remainders.get(remainders.size()-i-1));\n\t\t\t\t}\n\t\t\t\tfor(int i = 0; i < result_list.size(); i++)\n\t\t\t\t\tresult += result_list.get(i);\n\t\t\t\treturn result;\n\t\t\t}\n\t\t}\n\t\treturn \""\"";\n\t}\n}\n",WRONG_ANSWER,862,12896
1318805735678562304,b05d9f4f8ae94e871d055cf9cc40d00027e969fe8ebc83bb7ae29282cc9efd75,2020-10-21 14:46:04,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"\n\nimport java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner cin = new Scanner(System.in);\n\t\tint T = cin.nextInt();\n\t\tprint(T);\n\t\t\n\t}\n \n\tprivate static void print(int t) {\n\t\tfor(int i = 1;i <= 300;i++){\n\t\t\tint s = i * i;\n\t\t\tStringBuffer num = new StringBuffer();\n\t\t\tStringBuffer square = new StringBuffer();\n\t\t\tnum = convert(i,t);\n\t\t\tsquare = convert(s,t);\n\t\t\tif(jud(square)){\n\t\t\t\tSystem.out.println(num.reverse()+\"" \""+square);\n\t\t\t}\n\t\t}\n\t}\n\tprivate static StringBuffer convert(int s, int t) {\n\t\tStringBuffer rtnval = new StringBuffer();\n\t\tint digit;\n\t\twhile(s > 0){\n\t\t\tdigit = s % t;\n\t\t\tif(digit >= 10){\n\t\t\t\trtnval.append((char)('A'+digit - 10));\n\t\t\t}else{\n\t\t\t\trtnval.append(digit);\n\t\t\t}\n\t\t\ts /= t;\n\t\t}\n\t\treturn rtnval;\n\t}\n\t\n\tprivate static boolean jud(StringBuffer bf) {\n\t\tString s=new String(bf);\n\t\tchar str[]=s.toCharArray();\n\t\tfor(int i=0;i<str.length/2;i++) {\n\t\t\tif(str[i]!=str[str.length-i-1]) return false;\n\t\t}\n\t\treturn true;\n\t}\n\t\n}\n\n\n",ACCEPTED,1046,14248
1318805793224413184,b05d9f4f8ae94e871d055cf9cc40d00027e969fe8ebc83bb7ae29282cc9efd75,2020-10-21 14:46:17,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"\n\nimport java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner cin = new Scanner(System.in);\n\t\tint T = cin.nextInt();\n\t\tprint(T);\n\t\t\n\t}\n \n\tprivate static void print(int t) {\n\t\tfor(int i = 1;i <= 300;i++){\n\t\t\tint s = i * i;\n\t\t\tStringBuffer num = new StringBuffer();\n\t\t\tStringBuffer square = new StringBuffer();\n\t\t\tnum = convert(i,t);\n\t\t\tsquare = convert(s,t);\n\t\t\tif(jud(square)){\n\t\t\t\tSystem.out.println(num.reverse()+\"" \""+square);\n\t\t\t}\n\t\t}\n\t}\n\tprivate static StringBuffer convert(int s, int t) {\n\t\tStringBuffer rtnval = new StringBuffer();\n\t\tint digit;\n\t\twhile(s > 0){\n\t\t\tdigit = s % t;\n\t\t\tif(digit >= 10){\n\t\t\t\trtnval.append((char)('A'+digit - 10));\n\t\t\t}else{\n\t\t\t\trtnval.append(digit);\n\t\t\t}\n\t\t\ts /= t;\n\t\t}\n\t\treturn rtnval;\n\t}\n\t\n\tprivate static boolean jud(StringBuffer bf) {\n\t\tString s=new String(bf);\n\t\tchar str[]=s.toCharArray();\n\t\tfor(int i=0;i<str.length/2;i++) {\n\t\t\tif(str[i]!=str[str.length-i-1]) return false;\n\t\t}\n\t\treturn true;\n\t}\n\t\n}\n\n\n",ACCEPTED,1235,14596
1318812265928871936,b05d9f4f8ae94e871d055cf9cc40d00027e969fe8ebc83bb7ae29282cc9efd75,2020-10-21 15:12:01,Java,40.0,1306870976110592008,1267449136707624960,1049226397448056832,"\n\nimport java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner cin = new Scanner(System.in);\n\t\tint T = cin.nextInt();\n\t\tint N=cin.nextInt();\n\t\tint flag=0;\n\t\tfor(int i=N+1;i>0;i++) {\n\t\t\tif(flag==T) break;\n\t\t\tif(jud2(i)) {\n\t\t\t\tSystem.out.println(i);\n\t\t\t\tflag++;\n\t\t\t}\n\t\t}\n\t\t\n\t}\n \n\tprivate static void print(int t) {\n\t\tfor(int i = 1;i <= 300;i++){\n\t\t\tint s = i * i;\n\t\t\tStringBuffer num = new StringBuffer();\n\t\t\tStringBuffer square = new StringBuffer();\n\t\t\tnum = convert(i,t);\n\t\t\tsquare = convert(s,t);\n\t\t\tif(jud1(square)){\n\t\t\t\tSystem.out.println(num.reverse()+\"" \""+square);\n\t\t\t}\n\t\t}\n\t}\n\tprivate static StringBuffer convert(int s, int t) {\n\t\tStringBuffer rtnval = new StringBuffer();\n\t\tint digit;\n\t\twhile(s > 0){\n\t\t\tdigit = s % t;\n\t\t\tif(digit >= 10){\n\t\t\t\trtnval.append((char)('A'+digit - 10));\n\t\t\t}else{\n\t\t\t\trtnval.append(digit);\n\t\t\t}\n\t\t\ts /= t;\n\t\t}\n\t\treturn rtnval;\n\t}\n\t\n\tprivate static boolean jud1(StringBuffer bf) {\n\t\tString s=new String(bf);\n\t\tchar str[]=s.toCharArray();\n\t\tif(str[0]==0) return false;\n\t\tfor(int i=0;i<str.length/2;i++) {\n\t\t\tif(str[i]!=str[str.length-i-1]) return false;\n\t\t}\n\t\treturn true;\n\t}\n\t\n\tprivate static boolean jud2(int head) {\n\t\tint flag=0;\n\t\tfor(int i=2;i<=10;i++) {\n\t\t\tif(flag==2) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\tif(jud1(convert(head,i))) {\n\t\t\t\tflag++;\n\t\t\t}\n\t\t\t\n\t\t}\n\t\treturn false;\n\t}\n\t\n}\n\n\n",PARTIAL_ACCEPTED,1086,19368
1318813280774279168,b05d9f4f8ae94e871d055cf9cc40d00027e969fe8ebc83bb7ae29282cc9efd75,2020-10-21 15:16:03,Java,40.0,1306870976110592008,1267449136707624960,1049226397448056832,"\n\nimport java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner cin = new Scanner(System.in);\n\t\tint T = cin.nextInt();\n\t\tint N=cin.nextInt();\n\t\tint flag=0;\n\t\tfor(int i=N+1;i>0;i++) {\n\t\t\tif(flag==T) break;\n\t\t\tif(jud2(i)) {\n\t\t\t\tSystem.out.println(i);\n\t\t\t\tflag++;\n\t\t\t}\n\t\t}\n\t\t\n\t}\n \n\tprivate static void print(int t) {\n\t\tfor(int i = 1;i <= 300;i++){\n\t\t\tint s = i * i;\n\t\t\tStringBuffer num = new StringBuffer();\n\t\t\tStringBuffer square = new StringBuffer();\n\t\t\tnum = convert(i,t);\n\t\t\tsquare = convert(s,t);\n\t\t\tif(jud1(square)){\n\t\t\t\tSystem.out.println(num.reverse()+\"" \""+square);\n\t\t\t}\n\t\t}\n\t}\n\tprivate static StringBuffer convert(int s, int t) {\n\t\tStringBuffer rtnval = new StringBuffer();\n\t\tint digit;\n\t\twhile(s > 0){\n\t\t\tdigit = s % t;\n\t\t\tif(digit >= 10){\n\t\t\t\trtnval.append((char)('A'+digit - 10));\n\t\t\t}else{\n\t\t\t\trtnval.append(digit);\n\t\t\t}\n\t\t\ts /= t;\n\t\t}\n\t\treturn rtnval;\n\t}\n\t\n\tprivate static boolean jud1(StringBuffer bf) {\n\t\tString s=new String(bf);\n\t\tchar str[]=s.toCharArray();\n\t\tif(str[0]==0) return false;\n\t\tfor(int i=0;i<str.length/2;i++) {\n\t\t\tif(str[i]!=str[str.length-i-1]) return false;\n\t\t}\n\t\treturn true;\n\t}\n\t\n\tprivate static boolean jud2(int head) {\n\t\tint flag=0;\n\t\tfor(int i=2;i<=10;i++) {\n\t\t\tif(flag==2) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\tif(jud1(convert(head,i))) {\n\t\t\t\tflag++;\n\t\t\t}\n\t\t\t\n\t\t}\n\t\treturn false;\n\t}\n\t\n}\n\n\n",PARTIAL_ACCEPTED,1065,20460
1319114025679605760,b832f14117e713dbfde9a714298409ca6f1efc0686ffec562fd1f0663d0e11ac,2020-10-22 11:11:06,Java,40.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\nimport java.util.ArrayList;\nimport java.util.Collections;\n\n\npublic class Main {\n\tpublic static void main(String[] args) throws IOException {\n        Reader.init(System.in);\n\t\tReader r = new Reader();\n\t\t\n\t\tint n = r.nextInt();\n\t\tfor(int i = 1; i <= 300; i++) {\n\t\t\tint int_square = i * i;\n\t\t\tString str_square = change_binary(n, int_square);\n\t\t\tString str_i = change_binary(n, i);\n\t\t\tcheck_print_huiwen(str_i, str_square);\n\t\t}\n\t}\n\t\n\n\t\n\tstatic void check_print_huiwen(String origin, String num)\n\t{\n\t\tBoolean flag=true;\n\t\tfor(int i=0; i<num.length(); i++){\n\t\t\tif(num.charAt(i) != num.charAt(num.length()-i-1))\n\t\t\t\tflag = false;\n\t\t}\n\t\tif(flag)\n\t\t\tSystem.out.print(origin + \"" \"" + num + \""\\n\"");\n\t}\n\t\n\tstatic String change_binary(int n, int num) {\n\t\tString[] alpha = {\""A\"",\""B\"",\""C\"",\""D\"",\""E\"",\""F\"",\""G\"",\""H\"",\""I\"",\""J\"", \""L\""};\n\t\tif(n==10)\n\t\t\treturn Integer.toString(num);\n\t\telse {\n\t\t\tString result = \""\"";\n\t\t\tArrayList<String> result_list = new ArrayList<String>();\n\t\t\tArrayList<String> remainders = new ArrayList<String>();\n\t\t\tint devided = num;\n\t\t\twhile(devided >= n) {\n\t\t\t\tint temp = devided%n;\n\t\t\t\tdevided /= n;\n\t\t\t\tif(temp <= 9)\n\t\t\t\t\tremainders.add(Integer.toString(temp));\n\t\t\t\telse {\n\t\t\t\t\tremainders.add(alpha[temp-10]);\t\t\t\t\t\n\t\t\t\t}\n\t\t\t}\n\t\t\t\tresult_list.add(Integer.toString(devided));\n\t\t\t\tfor(int i = 0; i < remainders.size(); i++) {\n\t\t\t\t\tresult_list.add(remainders.get(remainders.size()-i-1));\n\t\t\t\t}\n\t\t\t\tfor(int i = 0; i < result_list.size(); i++)\n\t\t\t\t\tresult += result_list.get(i);\n\t\t\t\treturn result;\n\t\t}\n\t}\n}\n\nclass Reader{\n\tstatic BufferedReader reader;\n\tstatic StringTokenizer tokenizer;\n\t\n\tstatic void init(InputStream input) {//初始化\n\t\treader = new BufferedReader(new InputStreamReader(input));\n\t\ttokenizer = new StringTokenizer(\""\"");\n\t}\n\t\n\tstatic String next() throws IOException{\n\t\twhile(! tokenizer.hasMoreTokens()) {\n\t\t\ttokenizer = new StringTokenizer(reader.readLine());\n\t\t}\n\t\treturn tokenizer.nextToken();\n\t}\n\t\n\tstatic int nextInt() throws IOException {\n\t\treturn Integer.parseInt(next());\n\t}\n\t\n\tstatic double nextDouble() throws IOException{\n\t\treturn Double.parseDouble(next());\n\t}\n}\n\n\n",PARTIAL_ACCEPTED,971,15260
1319117518712754176,b832f14117e713dbfde9a714298409ca6f1efc0686ffec562fd1f0663d0e11ac,2020-10-22 11:24:59,Java,10.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\nimport java.util.ArrayList;\nimport java.util.Collections;\n\n\npublic class Main {\n\tpublic static void main(String[] args) throws IOException {\n        Reader.init(System.in);\n\t\tReader r = new Reader();\n\t\t\n\t\tint n = r.nextInt();\n\t\tfor(int i = 1; i <= 300; i++) {\n\t\t\tint int_square = i * i;\n\t\t\tString str_square = change_binary(n, int_square);\n\t\t\tString str_i = Integer.toString(i);\n\t\t\tcheck_print_huiwen(str_i, str_square);\n\t\t}\n\n\t}\n\t\n\tstatic void check_print_huiwen(String origin, String num)\n\t{\n\t\tBoolean flag=true;\n\t\tfor(int i=0; i<num.length(); i++){\n\t\t\tif(num.charAt(i) != num.charAt(num.length()-i-1))\n\t\t\t\tflag = false;\n\t\t}\n\t\tif(flag)\n\t\t\tSystem.out.print(origin + \"" \"" + num + \""\\n\"");\n\t}\n\t\n\tstatic String change_binary(int n, int num) {\n\t\tString[] alpha = {\""A\"",\""B\"",\""C\"",\""D\"",\""E\"",\""F\"",\""G\"",\""H\"",\""I\"",\""J\"", \""L\""};\n\t\tif(n==10)\n\t\t\treturn Integer.toString(num);\n\t\telse {\n\t\t\tString result = \""\"";\n\t\t\tArrayList<String> result_list = new ArrayList<String>();\n\t\t\tArrayList<String> remainders = new ArrayList<String>();\n\t\t\tint devided = num;\n\t\t\twhile(devided >= n) {\n\t\t\t\tint temp = devided%n;\n\t\t\t\tdevided /= n;\n\t\t\t\tif(temp <= 9)\n\t\t\t\t\tremainders.add(Integer.toString(temp));\n\t\t\t\telse {\n\t\t\t\t\tremainders.add(alpha[temp-10]);\t\t\t\t\t\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(devided <= 9)\n\t\t\t\tresult_list.add(Integer.toString(devided));\n\t\t\telse \n\t\t\t\tresult_list.add(alpha[devided-10]);\n\t\t\tfor(int i = 0; i < remainders.size(); i++) {\n\t\t\t\tresult_list.add(remainders.get(remainders.size()-i-1));\n\t\t\t}\n\t\t\tfor(int i = 0; i < result_list.size(); i++)\n\t\t\t\tresult += result_list.get(i);\n\t\t\treturn result;\n\t\t}\n\t}\n}\n\nclass Reader{\n\tstatic BufferedReader reader;\n\tstatic StringTokenizer tokenizer;\n\t\n\tstatic void init(InputStream input) {//初始化\n\t\treader = new BufferedReader(new InputStreamReader(input));\n\t\ttokenizer = new StringTokenizer(\""\"");\n\t}\n\t\n\tstatic String next() throws IOException{\n\t\twhile(! tokenizer.hasMoreTokens()) {\n\t\t\ttokenizer = new StringTokenizer(reader.readLine());\n\t\t}\n\t\treturn tokenizer.nextToken();\n\t}\n\t\n\tstatic int nextInt() throws IOException {\n\t\treturn Integer.parseInt(next());\n\t}\n\t\n\tstatic double nextDouble() throws IOException{\n\t\treturn Double.parseDouble(next());\n\t}\n}\n\n\n",PARTIAL_ACCEPTED,894,13984
1319118404759474176,b832f14117e713dbfde9a714298409ca6f1efc0686ffec562fd1f0663d0e11ac,2020-10-22 11:28:30,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"//package main;\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\nimport java.util.ArrayList;\nimport java.util.Collections;\n\n\npublic class Main {\n\tpublic static void main(String[] args) throws IOException {\n        Reader.init(System.in);\n\t\tReader r = new Reader();\n\t\t\n\t\tint n = r.nextInt();\n\t\tfor(int i = 1; i <= 300; i++) {\n\t\t\tint int_square = i * i;\n\t\t\tString str_square = change_binary(n, int_square);\n\t\t\tString str_i = change_binary(n, i);\n\t\t\tcheck_print_huiwen(str_i, str_square);\n\t\t}\n\n\t}\n\t\n\tstatic void check_print_huiwen(String origin, String num)\n\t{\n\t\tBoolean flag=true;\n\t\tfor(int i=0; i<num.length(); i++){\n\t\t\tif(num.charAt(i) != num.charAt(num.length()-i-1))\n\t\t\t\tflag = false;\n\t\t}\n\t\tif(flag)\n\t\t\tSystem.out.print(origin + \"" \"" + num + \""\\n\"");\n\t}\n\t\n\tstatic String change_binary(int n, int num) {\n\t\tString[] alpha = {\""A\"",\""B\"",\""C\"",\""D\"",\""E\"",\""F\"",\""G\"",\""H\"",\""I\"",\""J\"", \""L\""};\n\t\tif(n==10)\n\t\t\treturn Integer.toString(num);\n\t\telse {\n\t\t\tString result = \""\"";\n\t\t\tArrayList<String> result_list = new ArrayList<String>();\n\t\t\tArrayList<String> remainders = new ArrayList<String>();\n\t\t\tint devided = num;\n\t\t\twhile(devided >= n) {\n\t\t\t\tint temp = devided%n;\n\t\t\t\tdevided /= n;\n\t\t\t\tif(temp <= 9)\n\t\t\t\t\tremainders.add(Integer.toString(temp));\n\t\t\t\telse {\n\t\t\t\t\tremainders.add(alpha[temp-10]);\t\t\t\t\t\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(devided <= 9)\n\t\t\t\tresult_list.add(Integer.toString(devided));\n\t\t\telse \n\t\t\t\tresult_list.add(alpha[devided-10]);\n\t\t\tfor(int i = 0; i < remainders.size(); i++) {\n\t\t\t\tresult_list.add(remainders.get(remainders.size()-i-1));\n\t\t\t}\n\t\t\tfor(int i = 0; i < result_list.size(); i++)\n\t\t\t\tresult += result_list.get(i);\n\t\t\treturn result;\n\t\t}\n\t}\n}\n\nclass Reader{\n\tstatic BufferedReader reader;\n\tstatic StringTokenizer tokenizer;\n\t\n\tstatic void init(InputStream input) {//初始化\n\t\treader = new BufferedReader(new InputStreamReader(input));\n\t\ttokenizer = new StringTokenizer(\""\"");\n\t}\n\t\n\tstatic String next() throws IOException{\n\t\twhile(! tokenizer.hasMoreTokens()) {\n\t\t\ttokenizer = new StringTokenizer(reader.readLine());\n\t\t}\n\t\treturn tokenizer.nextToken();\n\t}\n\t\n\tstatic int nextInt() throws IOException {\n\t\treturn Integer.parseInt(next());\n\t}\n\t\n\tstatic double nextDouble() throws IOException{\n\t\treturn Double.parseDouble(next());\n\t}\n}\n\n\n",ACCEPTED,1027,16324
1319120503462498304,b832f14117e713dbfde9a714298409ca6f1efc0686ffec562fd1f0663d0e11ac,2020-10-22 11:36:50,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\nimport java.util.ArrayList;\nimport java.util.Collections;\n\n\npublic class Main {\n\tpublic static void main(String[] args) throws IOException {\n        Reader.init(System.in);\n\t\tReader r = new Reader();\n\t\t\n\t\tint n = r.nextInt();\n\t\tint s = r.nextInt();\n\t\tint temp = 0;\n\t\t\n\t\tfor(int num = s+1; num < 20000; num++) {\n\t\t\tint times = 0;\n\t\t\tfor(int j = 2; j <= 10; j++) {\n\t\t\t\tString changed = change_binary(j, num);\n\t\t\t\tif(is_huiwen(changed)) {\n\t\t\t\t\t++times;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(times>=2) {\n\t\t\t\t++temp;\n\t\t\t\tSystem.out.println(num);\n\t\t\t}\n\t\t\tif(temp>=n)\n\t\t\t\tbreak;\n\t\t}\n\n\t}\n\t\n\tstatic boolean is_huiwen(String num)\n\t{\n\t\tboolean result = true;\n\t\tfor(int i = 0; i < num.length(); i++) {\n\t\t\tif(num.charAt(i) != num.charAt(num.length()-i-1))\n\t\t\t\tresult = false;\n\t\t}\n\t\treturn result;\n\t}\n\t\n\tstatic String change_binary(int n, int num) {\n\t\tString[] alpha = {\""A\"",\""B\"",\""C\"",\""D\"",\""E\"",\""F\"",\""G\"",\""H\"",\""I\"",\""J\"", \""L\""};\n\t\tif(n==10)\n\t\t\treturn Integer.toString(num);\n\t\telse {\n\t\t\tString result = \""\"";\n\t\t\tArrayList<String> result_list = new ArrayList<String>();\n\t\t\tArrayList<String> remainders = new ArrayList<String>();\n\t\t\tint devided = num;\n\t\t\twhile(devided >= n) {\n\t\t\t\tint temp = devided%n;\n\t\t\t\tdevided /= n;\n\t\t\t\tif(temp <= 9)\n\t\t\t\t\tremainders.add(Integer.toString(temp));\n\t\t\t\telse {\n\t\t\t\t\tremainders.add(alpha[temp-10]);\t\t\t\t\t\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(devided <= 9)\n\t\t\t\tresult_list.add(Integer.toString(devided));\n\t\t\telse \n\t\t\t\tresult_list.add(alpha[devided-10]);\n\t\t\tfor(int i = 0; i < remainders.size(); i++) {\n\t\t\t\tresult_list.add(remainders.get(remainders.size()-i-1));\n\t\t\t}\n\t\t\tfor(int i = 0; i < result_list.size(); i++)\n\t\t\t\tresult += result_list.get(i);\n\t\t\treturn result;\n\t\t}\n\t}\n}\n\nclass Reader{\n\tstatic BufferedReader reader;\n\tstatic StringTokenizer tokenizer;\n\t\n\tstatic void init(InputStream input) {//初始化\n\t\treader = new BufferedReader(new InputStreamReader(input));\n\t\ttokenizer = new StringTokenizer(\""\"");\n\t}\n\t\n\tstatic String next() throws IOException{\n\t\twhile(! tokenizer.hasMoreTokens()) {\n\t\t\ttokenizer = new StringTokenizer(reader.readLine());\n\t\t}\n\t\treturn tokenizer.nextToken();\n\t}\n\t\n\tstatic int nextInt() throws IOException {\n\t\treturn Integer.parseInt(next());\n\t}\n\t\n\tstatic double nextDouble() throws IOException{\n\t\treturn Double.parseDouble(next());\n\t}\n}\n\n\n",ACCEPTED,1090,45768
1319203358964264960,7a3d8a5cb6e64872eff3723c69b72cf82b811e301be96b2c6c3b9fc17cb28e65,2020-10-22 17:06:05,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"\nimport java.util.*;\n\npublic class Main{\n\tstatic int d = 0;\n\tpublic static void main(String[] args)\n\t{\n\t\tint i,j,k,n;\n\t\tint[] t =new int[100];\n\t\tScanner in = new Scanner(System.in);\n\t\tn = in.nextInt();\n\t\tfor(i=1; i<=300; i++)\n\t\t{\n\t\t\tj=i*i;\n\t\t\tif(trans(i,n,t)>0)\n\t\t\t{\n\t\t\t\td = 0;\n\t\t\t\ttrans(i,n,t);\n\t\t\t\tfor(k=d; k>=1; k--)\n\t\t\t\t{\n\t\t\t\t\tif(t[k]<10)\n\t\t\t\t\t\tSystem.out.print(t[k]);\n\t\t\t\t\telse\n\t\t\t\t\t\tSystem.out.print('A'+t[k]-10);\n\t\t\t\t}\n\t\t\t\tSystem.out.print(\"" \"");\n\t\t\t\td=0;\n\t\t\t\ttrans(j,n,t);\n\t\t\t\tfor(k=1; k<=d; k++)\n\t\t\t\t{\n\t\t\t\t\tif(t[k]<10)\n\t\t\t\t\t\tSystem.out.print(t[k]);\n\t\t\t\t\telse\n\t\t\t\t\t\tSystem.out.print('A'+t[k]-10);\n\t\t\t\t}\n\t\t\t\tSystem.out.println();\n\t\t\t}\n\t\t}\n\t\t\n\t}\n\tpublic static int trans(int num,int n,int[] a)\n\t{\n\t\tint flag =1,i;\n\t\td = 0;\n\t\twhile(num!=0)\n\t\t{\n\t\t\td++;\n\t\t\ta[d]=num%n;\n\t\t\tnum=num/n;\n\t\t}\n\t\tfor(i=1; i<d/2+1; i++)\n\t\t\tif(a[i]!=a[d-i+1])\n\t\t\t{\n\t\t\t\tflag = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\treturn flag;\n\t}\n}",WRONG_ANSWER,1160,14656
1319204328167256064,7a3d8a5cb6e64872eff3723c69b72cf82b811e301be96b2c6c3b9fc17cb28e65,2020-10-22 17:09:56,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"\nimport java.util.*;\n\npublic class Main{\n\tstatic int d;\n\tpublic static void main(String[] args)\n\t{\n\t\tint i,j,k,n;\n\t\tint[] t =new int[100];\n\t\tScanner in = new Scanner(System.in);\n\t\tn = in.nextInt();\n\t\tfor(i=1; i<=300; i++)\n\t\t{\n\t\t\tj=i*i;\n\t\t\td=0;\n\t\t\tif(trans(i,n,t)>0)\n\t\t\t{\n\t\t\t\td = 0;\n\t\t\t\ttrans(i,n,t);\n\t\t\t\tfor(k=d; k>=1; k--)\n\t\t\t\t{\n\t\t\t\t\tif(t[k]<10)\n\t\t\t\t\t\tSystem.out.print(t[k]);\n\t\t\t\t\telse\n\t\t\t\t\t\tSystem.out.print('A'+t[k]-10);\n\t\t\t\t}\n\t\t\t\tSystem.out.print(\"" \"");\n\t\t\t\td=0;\n\t\t\t\ttrans(j,n,t);\n\t\t\t\tfor(k=1; k<=d; k++)\n\t\t\t\t{\n\t\t\t\t\tif(t[k]<10)\n\t\t\t\t\t\tSystem.out.print(t[k]);\n\t\t\t\t\telse\n\t\t\t\t\t\tSystem.out.print('A'+t[k]-10);\n\t\t\t\t}\n\t\t\t\tSystem.out.println();\n\t\t\t}\n\t\t}\n\t\t\n\t}\n\tpublic static int trans(int num,int n,int[] a)\n\t{\n\t\tint flag =1,i;\n\t\td = 0;\n\t\twhile(num!=0)\n\t\t{\n\t\t\td++;\n\t\t\ta[d]=num%n;\n\t\t\tnum=num/n;\n\t\t}\n\t\tfor(i=1; i<d/2+1; i++)\n\t\t\tif(a[i]!=a[d-i+1])\n\t\t\t{\n\t\t\t\tflag = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\treturn flag;\n\t}\n}\n",WRONG_ANSWER,1152,14544
1319205402471116800,7a3d8a5cb6e64872eff3723c69b72cf82b811e301be96b2c6c3b9fc17cb28e65,2020-10-22 17:14:12,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"\nimport java.util.*;\n\npublic class Main{\n\tstatic int d;\n\tpublic static void main(String[] args)\n\t{\n\t\tint i,j,k,n;\n\t\tint[] t =new int[100];\n\t\tScanner in = new Scanner(System.in);\n\t\tn = in.nextInt();\n\t\tfor(i=1; i<=300; i++)\n\t\t{\n\t\t\tj=i*i;\n\t\t\td=0;\n\t\t\tif(trans(i,n,t)==1)\n\t\t\t{\n\t\t\t\td = 0;\n\t\t\t\ttrans(i,n,t);\n\t\t\t\tfor(k=d; k>=1; k--)\n\t\t\t\t{\n\t\t\t\t\tif(t[k]<10)\n\t\t\t\t\t\tSystem.out.print(t[k]);\n\t\t\t\t\telse\n\t\t\t\t\t\tSystem.out.print('A'+t[k]-10);\n\t\t\t\t}\n\t\t\t\tSystem.out.print(\"" \"");\n\t\t\t\td=0;\n\t\t\t\ttrans(j,n,t);\n\t\t\t\tfor(k=1; k<=d; k++)\n\t\t\t\t{\n\t\t\t\t\tif(t[k]<10)\n\t\t\t\t\t\tSystem.out.print(t[k]);\n\t\t\t\t\telse\n\t\t\t\t\t\tSystem.out.print('A'+t[k]-10);\n\t\t\t\t}\n\t\t\t\tSystem.out.println();\n\t\t\t}\n\t\t}\n\t\t\n\t}\n\tpublic static int trans(int num,int n,int[] a)\n\t{\n\t\tint flag =1,i;\n\t\td = 0;\n\t\twhile(num!=0)\n\t\t{\n\t\t\td++;\n\t\t\ta[d]=num%n;\n\t\t\tnum=num/n;\n\t\t}\n\t\tfor(i=1; i<d/2+1; i++)\n\t\t\tif(a[i]!=a[d-i+1])\n\t\t\t{\n\t\t\t\tflag = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\treturn flag;\n\t}\n}\n\n",WRONG_ANSWER,1093,15360
1319206788696985600,9ff02a6da2d04fd8bb25c8491ce3fe160ee10145339d9c4b3d21b6a093505bfb,2020-10-22 17:19:42,Java,10.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String []args) {\n\t\tScanner s=new Scanner(System.in);\n\t\tint num1=s.nextInt();\n\t\t//s.nextLine();\n\t\tint num2=s.nextInt();\n\t\tint count=0;\n\t\t\n\t\tfor(int i=num2+1;count<num1;i++) {\t\t\t\n\t\tint count2=0;\n\t\t\tfor(int j=2;j<=10;j++) {\n\t\t\t\tFangfa f=new Fangfa(i,j);\n\t\t\t\tf.ss();\n\t\t\t\tif(f.judge()) {\n\t\t\t\t\tcount2++;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t}\n\t\t\t\tif(count2>=2) {\n\t\t\t\t\tSystem.out.println(i);\n\t\t\t\t\t//s.nextLine();\n\t\t\t\t\tcount++;\n\t\t\t\t\t\n\t\t\t}\n\t\t}\n\t\ts.close();\n\t\t\n\t\t}\n\n\n}\nclass Fangfa{\n\tpublic StringBuffer sh=new StringBuffer();\n\tpublic int num;\n\tpublic int radix;\n\tFangfa(int num1,int radix1){\n\t\tthis.num=num1;\n\t\tthis.radix=radix1;\n\t}\n\t\tpublic  StringBuffer ss() {\t\n\t\twhile(num==0) {\n\t\tsh.append(num%radix);\n\t\tnum/=radix;\n\t\t}\n\t\treturn \tsh.reverse();\n\t}\n\tpublic boolean judge() {\n\t\tfor(int i=0;i<sh.length()/2;i++) {\n\t\t\tif(sh.charAt(i)!=sh.charAt(sh.length()-1-i))\n\t\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n\t\n}\n",PARTIAL_ACCEPTED,916,14124
1319207413904125952,9ff02a6da2d04fd8bb25c8491ce3fe160ee10145339d9c4b3d21b6a093505bfb,2020-10-22 17:22:11,Java,10.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String []args) {\n\t\tScanner s=new Scanner(System.in);\n\t\tint num1=s.nextInt();\n\t\t//s.nextLine();\n\t\tint num2=s.nextInt();\n\t\tint count=0;\n\t\t\n\t\tfor(int i=num2+1;count<num1;i++) {\t\t\t\n\t\tint count2=0;\n\t\t\tfor(int j=2;j<=10;j++) {\n\t\t\t\tFangfa f=new Fangfa(i,j);\n\t\t\t\tf.ss();\n\t\t\t\tif(f.judge()) {\n\t\t\t\t\tcount2++;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t}\n\t\t\t\tif(count2>2) {\n\t\t\t\t\tSystem.out.println(i);\n\t\t\t\t\t//s.nextLine();\n\t\t\t\t\tcount++;\n\t\t\t\t\t\n\t\t\t}\n\t\t}\n\t\ts.close();\n\t\t\n\t\t}\n\n\n}\nclass Fangfa{\n\tpublic StringBuffer sh=new StringBuffer();\n\tpublic int num;\n\tpublic int radix;\n\tFangfa(int num1,int radix1){\n\t\tthis.num=num1;\n\t\tthis.radix=radix1;\n\t}\n\t\tpublic  StringBuffer ss() {\t\n\t\twhile(num==0) {\n\t\tsh.append(num%radix);\n\t\tnum/=radix;\n\t\t}\n\t\treturn \tsh.reverse();\n\t}\n\tpublic boolean judge() {\n\t\tfor(int i=0;i<sh.length()/2;i++) {\n\t\t\tif(sh.charAt(i)!=sh.charAt(sh.length()-1-i))\n\t\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n\t\n}\n",PARTIAL_ACCEPTED,941,13928
1319209420144594944,9ff02a6da2d04fd8bb25c8491ce3fe160ee10145339d9c4b3d21b6a093505bfb,2020-10-22 17:30:10,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String []args) {\n\t\tScanner s=new Scanner(System.in);\n\t\tint num1=s.nextInt();\n\t\t//s.nextLine();\n\t\tint num2=s.nextInt();\n\t\tint count=0;\n\t\t\n\t\tfor(int i=num2+1;count<num1;i++) {\t\t\t\n\t\tint count2=0;\n\t\t\tfor(int j=2;j<=10;j++) {\n\t\t\t\tFangfa f=new Fangfa(i,j);\n\t\t\t\tf.ss();\n\t\t\t\tif(f.judge()) {\n\t\t\t\t\tcount2++;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t}\n\t\t\t\tif(count2>=2) {\n\t\t\t\t\tSystem.out.println(i);\n\t\t\t\t\t//s.nextLine();\n\t\t\t\t\tcount++;\n\t\t\t\t\t\n\t\t\t}\n\t\t}\n\t\ts.close();\n\t\t\n\t\t}\n\n\n}\nclass Fangfa{\n\tpublic StringBuffer sh=new StringBuffer();\n\tpublic int num;\n\tpublic int radix;\n\tFangfa(int num1,int radix1){\n\t\tthis.num=num1;\n\t\tthis.radix=radix1;\n\t}\n\t\tpublic  StringBuffer ss() {\t\n\t\twhile(num!=0) {\n\t\tsh.append(num%radix);\n\t\tnum/=radix;\n\t\t}\n\t\treturn \tsh.reverse();\n\t}\n\tpublic boolean judge() {\n\t\tfor(int i=0;i<sh.length()/2;i++) {\n\t\t\tif(sh.charAt(i)!=sh.charAt(sh.length()-1-i))\n\t\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n\t\n}",ACCEPTED,1057,18484
1319242003230314496,64a5ab3b5dce8f7bdf3da47e4cfc65a9cbd5dfbdfcad825bc89cdd2fa78eb1a3,2020-10-22 19:39:38,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\nclass Main{\n    public static void main(String[] args){\n        Scanner sc = new Scanner(System.in);\n        int n = sc.nextInt();\n        String s = \""\"";\n        String ss = \""\"";\n        for(int i=1;i<=300;i++){\n            s = s.toString(i,n);\n            ss = ss.toString(i*i,n);\n            StringBuffer sbf = new StringBuffer(ss);\n            if(sbf.equals(sbf.reverse())){\n                System.out.println(s+\"" \""+ss);\n            }\n        }\n    }\n}",COMPILE_ERROR,0,0
1319242430701187072,64a5ab3b5dce8f7bdf3da47e4cfc65a9cbd5dfbdfcad825bc89cdd2fa78eb1a3,2020-10-22 19:41:20,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\nimport java.lang;\nclass Main{\n    public static void main(String[] args){\n        Scanner sc = new Scanner(System.in);\n        int n = sc.nextInt();\n        String s = \""\"";\n        String ss = \""\"";\n        for(int i=1;i<=300;i++){\n            s = s.toString(i,n);\n            ss = ss.toString(i*i,n);\n            StringBuffer sbf = new StringBuffer(ss);\n            if(sbf.equals(sbf.reverse())){\n                System.out.println(s+\"" \""+ss);\n            }\n        }\n    }\n}",COMPILE_ERROR,0,0
1319243465679253504,64a5ab3b5dce8f7bdf3da47e4cfc65a9cbd5dfbdfcad825bc89cdd2fa78eb1a3,2020-10-22 19:45:27,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\nimport java.lang;\nclass Main{\n    public static void main(String[] args){\n        Scanner sc = new Scanner(System.in);\n        int n = sc.nextInt();\n        String s = \""\"";\n        String ss = \""\"";\n        for(int i=1;i<=300;i++){\n            s = Integer.toString(i,n);\n            ss = Integer.toString(i*i,n);\n            StringBuffer sbf = new StringBuffer(ss);\n            if(sbf.equals(sbf.reverse())){\n                System.out.println(s+\"" \""+ss);\n            }\n        }\n    }\n}",COMPILE_ERROR,0,0
1319243606549147648,64a5ab3b5dce8f7bdf3da47e4cfc65a9cbd5dfbdfcad825bc89cdd2fa78eb1a3,2020-10-22 19:46:00,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\nclass Main{\n    public static void main(String[] args){\n        Scanner sc = new Scanner(System.in);\n        int n = sc.nextInt();\n        String s = \""\"";\n        String ss = \""\"";\n        for(int i=1;i<=300;i++){\n            s = Integer.toString(i,n);\n            ss = Integer.toString(i*i,n);\n            StringBuffer sbf = new StringBuffer(ss);\n            if(sbf.equals(sbf.reverse())){\n                System.out.println(s+\"" \""+ss);\n            }\n        }\n    }\n}",WRONG_ANSWER,1343,15628
1319247515732750336,64a5ab3b5dce8f7bdf3da47e4cfc65a9cbd5dfbdfcad825bc89cdd2fa78eb1a3,2020-10-22 20:01:32,Java,50.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\nclass Main{\n    public static void main(String[] args){\n        Scanner sc = new Scanner(System.in);\n        int n = sc.nextInt();\n        String s = \""\"";\n        String ss = \""\"";\n        for(int i=1;i<=300;i++){\n            s = Integer.toString(i,n);\n            ss = Integer.toString(i*i,n);\n            StringBuffer sbf = new StringBuffer(ss);\n            String rvss = new String(sbf.reverse());\n            if(ss.equals(rvss)){\n                System.out.println(s+\"" \""+ss);\n            }\n        }\n    }\n}",PARTIAL_ACCEPTED,1058,14368
1319247546435055616,64a5ab3b5dce8f7bdf3da47e4cfc65a9cbd5dfbdfcad825bc89cdd2fa78eb1a3,2020-10-22 20:01:40,Java,50.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\nclass Main{\n    public static void main(String[] args){\n        Scanner sc = new Scanner(System.in);\n        int n = sc.nextInt();\n        String s = \""\"";\n        String ss = \""\"";\n        for(int i=1;i<=300;i++){\n            s = Integer.toString(i,n);\n            ss = Integer.toString(i*i,n);\n            StringBuffer sbf = new StringBuffer(ss);\n            String rvss = new String(sbf.reverse());\n            if(ss.equals(rvss)){\n                System.out.println(s+\"" \""+ss);\n            }\n        }\n    }\n}",PARTIAL_ACCEPTED,1080,14076
1319249454184878080,64a5ab3b5dce8f7bdf3da47e4cfc65a9cbd5dfbdfcad825bc89cdd2fa78eb1a3,2020-10-22 20:09:14,Java,50.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\nclass Main{\n    public static void main(String[] args){\n        Scanner sc = new Scanner(System.in);\n        int n = sc.nextInt();\n        String s = \""\"";\n        String ss = \""\"";\n        for(int i=1;i<=300;i++){\n            s = Integer.toString(i,n);\n            ss = Integer.toString(i*i,n);\n            StringBuffer sbf = new StringBuffer(ss);\n            String rvss = new String(sbf.reverse());\n            if(ss.equals(rvss)){\n                ss = ss.replace('a', 'A');\n            \tss = ss.replace('b', 'B');\n            \tss = ss.replace('c', 'C');\n            \tss = ss.replace('d', 'D');\n            \tss = ss.replace('e', 'E');\n            \tss = ss.replace('f', 'F');\n            \tss = ss.replace('g', 'G');\n            \tss = ss.replace('h', 'H');\n                System.out.println(s+\"" \""+ss);\n            }\n        }\n    }\n}",PARTIAL_ACCEPTED,1022,14196
1319249991261302784,64a5ab3b5dce8f7bdf3da47e4cfc65a9cbd5dfbdfcad825bc89cdd2fa78eb1a3,2020-10-22 20:11:23,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\nclass Main{\n    public static void main(String[] args){\n        Scanner sc = new Scanner(System.in);\n        int n = sc.nextInt();\n        String s = \""\"";\n        String ss = \""\"";\n        for(int i=1;i<=300;i++){\n            s = Integer.toString(i,n);\n            ss = Integer.toString(i*i,n);\n            StringBuffer sbf = new StringBuffer(ss);\n            String rvss = new String(sbf.reverse());\n            if(ss.equals(rvss)){\n                ss = ss.replace('a', 'A');\n            \tss = ss.replace('b', 'B');\n            \tss = ss.replace('c', 'C');\n            \tss = ss.replace('d', 'D');\n            \tss = ss.replace('e', 'E');\n            \tss = ss.replace('f', 'F');\n            \tss = ss.replace('g', 'G');\n            \tss = ss.replace('h', 'H');\n                ss = ss.replace('i', 'I');\n            \tss = ss.replace('j', 'J');\n            \tss = ss.replace('k', 'K');\n            \tss = ss.replace('l', 'L');\n            \tss = ss.replace('m', 'M');\n            \tss = ss.replace('n', 'N');\n            \tss = ss.replace('g', 'G');\n            \tss = ss.replace('h', 'H');\n                s = s.replace('a', 'A');\n            \ts = s.replace('b', 'B');\n            \ts = s.replace('c', 'C');\n            \ts = s.replace('d', 'D');\n            \ts = s.replace('e', 'E');\n            \ts = s.replace('f', 'F');\n            \ts = s.replace('g', 'G');\n            \ts = s.replace('h', 'H');\n                s = s.replace('i', 'I');\n            \ts = s.replace('j', 'J');\n            \ts = s.replace('k', 'K');\n            \ts = s.replace('l', 'L');\n            \ts = s.replace('m', 'M');\n            \ts = s.replace('n', 'N');\n            \ts = s.replace('g', 'G');\n            \ts = s.replace('h', 'H');\n                System.out.println(s+\"" \""+ss);\n            }        }\n    }\n}",ACCEPTED,1172,14428
1319255430753505280,64a5ab3b5dce8f7bdf3da47e4cfc65a9cbd5dfbdfcad825bc89cdd2fa78eb1a3,2020-10-22 20:32:59,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\npublic class pta09 {\n\tboolean palin2_10(int x) {\n\t\tint cnt = 0;\n\t\tString s = \""\"";\n\t\tfor(int i=2;i<=10;i++) {\n\t\t\ts = Integer.toString(x,i);\n\t\t\tStringBuffer sbf = new StringBuffer(s);\n\t\t\tString srv = new String(sbf.reverse());\n\t\t\tif(s.equals(srv)) {\n\t\t\t\tcnt++;\n\t\t\t\tif(cnt>=2) return true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tint S = sc.nextInt();\n\t\tpta09 o = new pta09();\n\t\tfor(int i=S+1;N>0;i++) {\n\t\t\tif(o.palin2_10(i)) {\n\t\t\t\tSystem.out.println(i);\n\t\t\t\tN--;\n\t\t\t}\n\t\t}\n\t\tsc.close();\t\n\t}\n}",COMPILE_ERROR,0,0
1319255539335647232,64a5ab3b5dce8f7bdf3da47e4cfc65a9cbd5dfbdfcad825bc89cdd2fa78eb1a3,2020-10-22 20:33:25,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\npublic class Main {\n\tboolean palin2_10(int x) {\n\t\tint cnt = 0;\n\t\tString s = \""\"";\n\t\tfor(int i=2;i<=10;i++) {\n\t\t\ts = Integer.toString(x,i);\n\t\t\tStringBuffer sbf = new StringBuffer(s);\n\t\t\tString srv = new String(sbf.reverse());\n\t\t\tif(s.equals(srv)) {\n\t\t\t\tcnt++;\n\t\t\t\tif(cnt>=2) return true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tint S = sc.nextInt();\n\t\tMain o = new Main();\n\t\tfor(int i=S+1;N>0;i++) {\n\t\t\tif(o.palin2_10(i)) {\n\t\t\t\tSystem.out.println(i);\n\t\t\t\tN--;\n\t\t\t}\n\t\t}\n\t\tsc.close();\t\n\t}\n}",ACCEPTED,924,23076
1319323007664074752,7a3d8a5cb6e64872eff3723c69b72cf82b811e301be96b2c6c3b9fc17cb28e65,2020-10-23 01:01:31,Java,50.0,1306870976110592007,1267442030214471680,1049226397448056832,"\nimport java.util.*;\n\npublic class Main{\n\tstatic int d;\n\tpublic static void main(String[] args)\n\t{\n\t\tint i,j,k,n;\n\t\tint[] t =new int[100];\n\t\tScanner in = new Scanner(System.in);\n\t\tn = in.nextInt();\n\t\tfor(i=1; i<=300; i++)\n\t\t{\n\t\t\tj=i*i;\n\t\t\td=0;\n\t\t\tif(trans(j,n,t)==1)\n\t\t\t{\n\t\t\t\td = 0;\n\t\t\t\ttrans(i,n,t);\n\t\t\t\tfor(k=d; k>=1; k--)\n\t\t\t\t{\n\t\t\t\t\tif(t[k]<10)\n\t\t\t\t\t\tSystem.out.print(t[k]);\n\t\t\t\t\telse\n\t\t\t\t\t\tSystem.out.print('A'+t[k]-10);\n\t\t\t\t}\n\t\t\t\tSystem.out.print(\"" \"");\n\t\t\t\td=0;\n\t\t\t\ttrans(j,n,t);\n\t\t\t\tfor(k=1; k<=d; k++)\n\t\t\t\t{\n\t\t\t\t\tif(t[k]<10)\n\t\t\t\t\t\tSystem.out.print(t[k]);\n\t\t\t\t\telse\n\t\t\t\t\t\tSystem.out.print('A'+t[k]-10);\n\t\t\t\t}\n\t\t\t\tSystem.out.println();\n\t\t\t}\n\t\t}\n\t\t\n\t}\n\tpublic static int trans(int num,int n,int[] a)\n\t{\n\t\tint flag =1,i;\n\t\td = 0;\n\t\twhile(num!=0)\n\t\t{\n\t\t\td++;\n\t\t\ta[d]=num%n;\n\t\t\tnum=num/n;\n\t\t}\n\t\tfor(i=1; i<d/2+1; i++)\n\t\t\tif(a[i]!=a[d-i+1])\n\t\t\t{\n\t\t\t\tflag = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\treturn flag;\n\t}\n}\n\n",PARTIAL_ACCEPTED,1067,14160
1319325490834657280,7a3d8a5cb6e64872eff3723c69b72cf82b811e301be96b2c6c3b9fc17cb28e65,2020-10-23 01:11:23,Java,50.0,1306870976110592007,1267442030214471680,1049226397448056832,"\nimport java.util.*;\n\npublic class Main {\n\tstatic int d;\n\tpublic static void main(String[] args)\n\t{\n\t\tint i,j,k,n;\n\t\tint[] t =new int[100];\n\t\tScanner in = new Scanner(System.in);\n\t\tn = in.nextInt();\n\t\tfor(i=1; i<=300; i++)\n\t\t{\n\t\t\tj=i*i;\n\t\t\tif(trans(j,n,t)==1)\n\t\t\t{\n\t\t\t\ttrans(i,n,t);\n\t\t\t\tfor(k=d; k>=1; k--)\n\t\t\t\t{\n\t\t\t\t\tif(t[k]<10)\n\t\t\t\t\t\tSystem.out.print(t[k]);\n\t\t\t\t\telse\n\t\t\t\t\t\tSystem.out.print('A'+t[k]-10);\n\t\t\t\t}\n\t\t\t\tSystem.out.print(\"" \"");\n\t\t\t\ttrans(j,n,t);\n\t\t\t\tfor(k=1; k<=d; k++)\n\t\t\t\t{\n\t\t\t\t\tif(t[k]<10)\n\t\t\t\t\t\tSystem.out.print(t[k]);\n\t\t\t\t\telse\n\t\t\t\t\t\tSystem.out.print('A'+t[k]-10);\n\t\t\t\t}\n\t\t\t\tSystem.out.println();\n\t\t\t}\n\t\t}\n\t\t\n\t}\n\tstatic int trans(int num,int n,int[] a)\n\t{\n\t\tint flag =1,i;\n\t\td = 0;\n\t\twhile(num!=0)\n\t\t{\n\t\t\td++;\n\t\t\ta[d]=num%n;\n\t\t\tnum=num/n;\n\t\t}\n\t\tfor(i=1; i<d/2+1; i++)\n\t\t\tif(a[i]!=a[d-i+1])\n\t\t\t{\n\t\t\t\tflag = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\treturn flag;\n\t}\n}\n",PARTIAL_ACCEPTED,1102,14072
1319326633413398528,7a3d8a5cb6e64872eff3723c69b72cf82b811e301be96b2c6c3b9fc17cb28e65,2020-10-23 01:15:55,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"\nimport java.util.*;\n\npublic class Main{\n\tstatic int d;\n\tpublic static void main(String[] args)\n\t{\n\t\tint i,j,k,n;\n\t\tint[] t =new int[100];\n\t\tScanner in = new Scanner(System.in);\n\t\tn = in.nextInt();\n\t\tfor(i=1; i<=300; i++)\n\t\t{\n\t\t\tj=i*i;\n\t\t\tif(trans(j,n,t)==1)\n\t\t\t{\n\t\t\t\ttrans(i,n,t);\n\t\t\t\tfor(k=d; k>=1; k--)\n\t\t\t\t{\n\t\t\t\t\tif(t[k]<10)\n\t\t\t\t\t\tSystem.out.print(t[k]);\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tint temp = t[k]-10;\n\t\t\t\t\t\tSystem.out.print((char)('A'+temp));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tSystem.out.print(\"" \"");\n\t\t\t\ttrans(j,n,t);\n\t\t\t\tfor(k=1; k<=d; k++)\n\t\t\t\t{\n\t\t\t\t\tif(t[k]<10)\n\t\t\t\t\t\tSystem.out.print(t[k]);\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tint temp = t[k]-10;\n\t\t\t\t\t\tSystem.out.print((char)('A'+temp));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tSystem.out.println();\n\t\t\t}\n\t\t}\n\t\t\n\t}\n\tstatic int trans(int num,int n,int[] a)\n\t{\n\t\tint flag =1,i;\n\t\td = 0;\n\t\twhile(num!=0)\n\t\t{\n\t\t\td++;\n\t\t\ta[d]=num%n;\n\t\t\tnum=num/n;\n\t\t}\n\t\tfor(i=1; i<d/2+1; i++)\n\t\t\tif(a[i]!=a[d-i+1])\n\t\t\t{\n\t\t\t\tflag = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\treturn flag;\n\t}\n}\n",ACCEPTED,1177,14412
1319529717032898560,c3e6f8ec2d23f7f807edf9bf11527d181f7fd2c4e0ae98ec2be0571dd32dde6c,2020-10-23 14:42:54,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"// package USACO;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.Iterator;\nimport java.util.Map;\nimport java.util.Scanner;\nimport java.util.ArrayList;\nimport java.util.Collections;\npublic class Main {\n\t\n\t static boolean palin_num (String s) {\n\t\tStringBuilder str_a=new StringBuilder(s);\n//\t\tStringBuilder str_b=new StringBuilder(s);\n\t\tstr_a.reverse();\n\t\tboolean flag;\n\t\tif(s.compareTo(str_a.toString())==0)\n\t\t\tflag=true;\n\t\telse\n\t\t\tflag=false;\n\n\t\treturn flag;\n\t}\n\t\n\tstatic String intToA(int n, int radix)\n\t{\n\t\tStringBuilder ans=new StringBuilder(\""\"");\n\t    do {\n\t        int t = n % radix;\n\t        if (t >= 0 && t <= 9)\t\n\t        {\n\t            ans.append( (char)(t + '0'));\n\t        }\n\t        else \n\t        {\n\t        \tans.append((char)(t - 10 + 'A'));\n\t        }\n\n\t        n /= radix;\n\t    } while (n != 0);\n\t\tans.reverse();\n\t\treturn ans.toString();\n\t}\n\t \n\t \n\tpublic static void main(String[] args) {\n\t\t\n\t\tScanner input=new Scanner(System.in);\n\t\tint n= input.nextInt();\n\t\t\n\t\tString str;\n\t\tfor(int i=1;i<=300;i++) {\n\t\t\tint j=i;\n\t\t\t\n\t\t\tString s1=new String(intToA(j,n));\n\t\t\tString s2=new String(intToA((j*j),n));\n\t\t\t\n\t\t\tif(palin_num(s2))\n\t\t\t{\n\t\t\t\tSystem.out.print(s1);\n\t\t\t\tSystem.out.print(\"" \"");\n\t\t\t\tSystem.out.print(s2);\n\t\t\t\tSystem.out.print(\""\\n\"");\n\t\t\t}\n\t\t\telse\n\t\t\t\tcontinue;\n\t\t}\n\n\t}\n}\n",ACCEPTED,1145,14300
1319533125198499840,c3e6f8ec2d23f7f807edf9bf11527d181f7fd2c4e0ae98ec2be0571dd32dde6c,2020-10-23 14:56:27,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"package USACO;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.Iterator;\nimport java.util.Map;\nimport java.util.Scanner;\nimport java.util.ArrayList;\nimport java.util.Collections;\npublic class Main {\n\n\t static boolean palin_num (String s) {\n\t\tStringBuilder str_a=new StringBuilder(s);\n//\t\tStringBuilder str_b=new StringBuilder(s);\n\t\tstr_a.reverse();\n\t\tboolean flag;\n\t\tif(s.compareTo(str_a.toString())==0)\n\t\t\tflag=true;\n\t\telse\n\t\t\tflag=false;\n\n\t\treturn flag;\n\t}//palin_num\n\t\n\tstatic String intToA(int n, int radix)\n\t{\n\t\tStringBuilder ans=new StringBuilder(\""\"");\n\t    do {\n\t        int t = n % radix;\n\t        if (t >= 0 && t <= 9)\t\n\t        {\n\t            ans.append( (char)(t + '0'));\n\t        }//if\n\t        else \n\t        {\n\t        \tans.append((char)(t - 10 + 'A'));\n\t        }//else\n\n\t        n /= radix;\n\t    } while (n != 0);\n\t\tans.reverse();\n\t\treturn ans.toString();\n\t}//intToA\n\t \n\t \n\tpublic static void main(String[] args) {\n\t\t\n\t\tScanner input=new Scanner(System.in);\n\t\tint n= input.nextInt();\n\t\tint s= input.nextInt();\n\t\ts++;\n\t\tArrayList<Integer> p=new ArrayList();\n\t\tint sum;\n\t\twhile(p.size()<n)\n\t\t{\n\t\t\tsum=0;\n\t        for (int i = 2; i <= 10; i++)\n\t        {\n\t            if (palin_num(intToA(s, i))) // 此时对应进制的数是回文数；\n\t            {\n\t                sum++; // 记录次数+1；\n\t            }//if\n\t        }//for\n\t        if(sum>=2)\n\t        \tp.add((Integer)s);\n\t        s++;\n\t\t}//while\n\t\tfor (int i = 0; i < p.size(); i++)\n\t\t\tSystem.out.println(p.get(i));\n\t\t\n\t\t\n\t}//main\n}//problem0709\n",WRONG_ANSWER,798,12816
1319533757598879744,c3e6f8ec2d23f7f807edf9bf11527d181f7fd2c4e0ae98ec2be0571dd32dde6c,2020-10-23 14:58:58,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"package USACO;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.Iterator;\nimport java.util.Map;\nimport java.util.Scanner;\nimport java.util.ArrayList;\nimport java.util.Collections;\npublic class Main {\n\n\t static boolean palin_num (String s) {\n\t\tStringBuilder str_a=new StringBuilder(s);\n//\t\tStringBuilder str_b=new StringBuilder(s);\n\t\tstr_a.reverse();\n\t\tboolean flag;\n\t\tif(s.compareTo(str_a.toString())==0)\n\t\t\tflag=true;\n\t\telse\n\t\t\tflag=false;\n\n\t\treturn flag;\n\t}//palin_num\n\t\n\tstatic String intToA(int n, int radix)\n\t{\n\t\tStringBuilder ans=new StringBuilder(\""\"");\n\t    do {\n\t        int t = n % radix;\n\t        if (t >= 0 && t <= 9)\t\n\t        {\n\t            ans.append( (char)(t + '0'));\n\t        }//if\n\t        else \n\t        {\n\t        \tans.append((char)(t - 10 + 'A'));\n\t        }//else\n\n\t        n /= radix;\n\t    } while (n != 0);\n\t\tans.reverse();\n\t\treturn ans.toString();\n\t}//intToA\n\t \n\t \n\tpublic static void main(String[] args) {\n\t\t\n\t\tScanner input=new Scanner(System.in);\n\t\tint n= input.nextInt();\n\t\tint s= input.nextInt();\n\t\ts++;\n\t\tArrayList<Integer> p=new ArrayList();\n\t\tint sum;\n\t\twhile(p.size()<n)\n\t\t{\n\t\t\tsum=0;\n\t        for (int i = 2; i <= 10; i++)\n\t        {\n\t            if (palin_num(intToA(s, i))) // 此时对应进制的数是回文数；\n\t            {\n\t                sum++; // 记录次数+1；\n\t            }//if\n\t        }//for\n\t        if(sum>=2)\n\t        \tp.add((Integer)s);\n\t        s++;\n\t\t}//while\n\t\tfor (int i = 0; i < p.size(); i++)\n\t\t\tSystem.out.println((int)p.get(i));\n\t\t\n\t\t\n\t}//main\n}//problem0709\n",WRONG_ANSWER,767,12836
1319533900301684736,c3e6f8ec2d23f7f807edf9bf11527d181f7fd2c4e0ae98ec2be0571dd32dde6c,2020-10-23 14:59:32,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.Iterator;\nimport java.util.Map;\nimport java.util.Scanner;\nimport java.util.ArrayList;\nimport java.util.Collections;\npublic class Main {\n\n\t static boolean palin_num (String s) {\n\t\tStringBuilder str_a=new StringBuilder(s);\n//\t\tStringBuilder str_b=new StringBuilder(s);\n\t\tstr_a.reverse();\n\t\tboolean flag;\n\t\tif(s.compareTo(str_a.toString())==0)\n\t\t\tflag=true;\n\t\telse\n\t\t\tflag=false;\n\n\t\treturn flag;\n\t}//palin_num\n\t\n\tstatic String intToA(int n, int radix)\n\t{\n\t\tStringBuilder ans=new StringBuilder(\""\"");\n\t    do {\n\t        int t = n % radix;\n\t        if (t >= 0 && t <= 9)\t\n\t        {\n\t            ans.append( (char)(t + '0'));\n\t        }//if\n\t        else \n\t        {\n\t        \tans.append((char)(t - 10 + 'A'));\n\t        }//else\n\n\t        n /= radix;\n\t    } while (n != 0);\n\t\tans.reverse();\n\t\treturn ans.toString();\n\t}//intToA\n\t \n\t \n\tpublic static void main(String[] args) {\n\t\t\n\t\tScanner input=new Scanner(System.in);\n\t\tint n= input.nextInt();\n\t\tint s= input.nextInt();\n\t\ts++;\n\t\tArrayList<Integer> p=new ArrayList();\n\t\tint sum;\n\t\twhile(p.size()<n)\n\t\t{\n\t\t\tsum=0;\n\t        for (int i = 2; i <= 10; i++)\n\t        {\n\t            if (palin_num(intToA(s, i))) // 此时对应进制的数是回文数；\n\t            {\n\t                sum++; // 记录次数+1；\n\t            }//if\n\t        }//for\n\t        if(sum>=2)\n\t        \tp.add((Integer)s);\n\t        s++;\n\t\t}//while\n\t\tfor (int i = 0; i < p.size(); i++)\n\t\t\tSystem.out.println((int)p.get(i));\n\t\t\n\t\t\n\t}//main\n}//problem0709\n",ACCEPTED,1180,22200
1319594637317459968,d90216a7999613223f5c4328a8d7bae51788c470124be80c359bab1d337fef9b,2020-10-23 19:00:53,Java,50.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static StringBuffer tran(int n, int B) {\n\t\tStringBuffer str = new StringBuffer();\n\t\tint temp;\n\t\twhile (n!=0)\n\t    {\n\t        temp = n % B;\n\t        n = n / B;\n\t        if (temp >= 10)\n\t            str.append((char)('A'));\n\t        else\n\t            str.append(temp);\n\t    }\n\t\treturn str.reverse();\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tint i;\n\t\tScanner sc = new Scanner(System.in);\n\t\tint B = sc.nextInt();\n\t\tsc.close();\n\t\tStringBuffer[] aftertran = new StringBuffer[305];\n\t\tfor(i=1;i<=300;i++) {\n\t\t\tStringBuffer j = tran(i,B);\n\t\t\taftertran[i] = tran(i*i,B);\n\t\t\tStringBuffer s = aftertran[i];\n\t\t\tint len = s.length();\n\t\t\tint x,y;\n\t        int flag = 1;\n\t        for (x=0,y=len-1;x<=len/2;x++,y--)\n\t        {\n\t            if(s.charAt(x) != s.charAt(y))\n\t                flag = 0;\n\t        }\n\t        if (flag == 1)\n\t        \tSystem.out.println(j+\"" \""+s);\n\t\t}\n\t}\n}\n",PARTIAL_ACCEPTED,1146,14272
1319595808576851968,d90216a7999613223f5c4328a8d7bae51788c470124be80c359bab1d337fef9b,2020-10-23 19:05:32,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\tpublic static StringBuffer tran(int n, int B) {\n\t\tStringBuffer str = new StringBuffer();\n\t\tint temp;\n\t\twhile (n!=0)\n\t    {\n\t        temp = n % B;\n\t        n = n / B;\n\t        if (temp >= 10)\n\t            str.append((char)('A'+temp-10));\n\t        else\n\t            str.append(temp);\n\t    }\n\t\treturn str.reverse();\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tint i;\n\t\tScanner sc = new Scanner(System.in);\n\t\tint B = sc.nextInt();\n\t\tsc.close();\n\t\tStringBuffer[] aftertran = new StringBuffer[305];\n\t\tfor(i=1;i<=300;i++) {\n\t\t\tStringBuffer j = tran(i,B);\n\t\t\taftertran[i] = tran(i*i,B);\n\t\t\tStringBuffer s = aftertran[i];\n\t\t\tint len = s.length();\n\t\t\tint x,y;\n\t        int flag = 1;\n\t        for (x=0,y=len-1;x<=len/2;x++,y--)\n\t        {\n\t            if(s.charAt(x) != s.charAt(y))\n\t                flag = 0;\n\t        }\n\t        if (flag == 1)\n\t        \tSystem.out.println(j+\"" \""+s);\n\t\t}\n\t}\n}\n",ACCEPTED,1196,14424
1319597280806916096,d90216a7999613223f5c4328a8d7bae51788c470124be80c359bab1d337fef9b,2020-10-23 19:11:23,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\tstatic int[] a = new int[100];\n\t\n\tpublic static boolean tran(int x,int B) {\n\t\tint s = x;\n\t\tint i = 0;\n\t    int m,n;\n\t    while(s != 0)\n\t    {\n\t        a[i++] = s % B;\n\t        s /= B;\n\t    }\n\t    for (m=0,n=i-1;m<=i/2;m++,n--)\n\t    {\n\t        if(a[m] != a[n])\n\t            return false;\n\t    }\n\t    return true;\n\t}\n\t\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tint S = sc.nextInt();\n\t\tint i = S;\n\t\twhile(N!=0)\n\t    {\n\t        i++;\n\t        int flag = 0;\n\t        for(int B=2;B<=10;B++)\n\t        {\n\t            if(tran(i,B))\n\t                flag++;\n\t            if(flag == 2)\n\t            {\n\t                System.out.println(i);\n\t                N--;\n\t                break;\n\t            }\n\t        }\n\t    }\n\n\t}\n\n}\n",ACCEPTED,859,13972
1319837886204424192,34e5c56c5cec86eefa279cc7a216a4530a6f851f3dbdd281ec607fda9b795eb8,2020-10-24 11:07:28,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.*;\npublic class Main{\n\tpublic static int s[] = new int[301];\n\n\tpublic static void scale(int a,int b){\n\t    int digit=0;\n\t    while(a){\n\t        s[++digit] = a%b;\n\t        a /= b;\n\t    }\n\t    s[0]=digit;\n\t}\n\t\n\tpublic static boolean ifEqual(){//判断s[i]与s[s[0]+1-i]是否相等\n\t    for(int i=1;i<=s[0];i++){\n\t        if(s[i]!=s[s[0]+1-i])\n\t            return false;\n\t    }\n\t    return true;\n\t}\n\n\tpublic static void display(){ //打印回文数\n\t    for(int i=s[0];i>=1;i--){//按进制存储是反方向的\n\t        if(s[i]<=9)\n\t            System.out.print(s[i]);\n\t        else\n\t        \t System.out.print((char)(s[i]-10+'A')); //大于十进制的数用字母表示，构造函数类型转换\n\t    }\n\t}\n\tpublic static void main(String[] args){\n\t    int b;\n\t    Scanner scanner = new Scanner(System.in);\n\t    b = scanner.nextInt();\n\t    for(int i=1;i<301;i++){\n\t        scale(i*i,b);\n\t        if(ifEqual()){\n\t            scale(i,b);\n\t            display();\n\t            System.out.print(\"" \"");\n\t            scale(i*i,b);\n\t            display();\n\t            System.out.println();\n\t        }\n\t    }\n\t}\n\n}\n",COMPILE_ERROR,0,0
1319837958430347264,34e5c56c5cec86eefa279cc7a216a4530a6f851f3dbdd281ec607fda9b795eb8,2020-10-24 11:07:45,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.*;\npublic class Main{\n\tpublic static int s[] = new int[301];\n\n\tpublic static void scale(int a,int b){\n\t    int digit=0;\n\t    while(a>0){\n\t        s[++digit] = a%b;\n\t        a /= b;\n\t    }\n\t    s[0]=digit;\n\t}\n\t\n\tpublic static boolean ifEqual(){//判断s[i]与s[s[0]+1-i]是否相等\n\t    for(int i=1;i<=s[0];i++){\n\t        if(s[i]!=s[s[0]+1-i])\n\t            return false;\n\t    }\n\t    return true;\n\t}\n\n\tpublic static void display(){ //打印回文数\n\t    for(int i=s[0];i>=1;i--){//按进制存储是反方向的\n\t        if(s[i]<=9)\n\t            System.out.print(s[i]);\n\t        else\n\t        \t System.out.print((char)(s[i]-10+'A')); //大于十进制的数用字母表示，构造函数类型转换\n\t    }\n\t}\n\tpublic static void main(String[] args){\n\t    int b;\n\t    Scanner scanner = new Scanner(System.in);\n\t    b = scanner.nextInt();\n\t    for(int i=1;i<301;i++){\n\t        scale(i*i,b);\n\t        if(ifEqual()){\n\t            scale(i,b);\n\t            display();\n\t            System.out.print(\"" \"");\n\t            scale(i*i,b);\n\t            display();\n\t            System.out.println();\n\t        }\n\t    }\n\t}\n\n}\n",ACCEPTED,1080,14224
1319839307767296000,34e5c56c5cec86eefa279cc7a216a4530a6f851f3dbdd281ec607fda9b795eb8,2020-10-24 11:13:07,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.*;\npublic class pro9 {\n\tpublic static int s[] = new int[301];\n\n\tpublic static void scale(int a,int b){\n\t    int digit=0;\n\t    while(a){\n\t        s[++digit] = a%b;\n\t        a /= b;\n\t    }\n\t    s[0]=digit;\n\t}\n\n\tpublic static boolean ifEqual(){//判断s[i]与s[s[0]+1-i]是否相等\n\t    for(int i=1;i<=s[0];i++){\n\t        if(s[i]!=s[s[0]+1-i])\n\t            return false;\n\t    }\n\t    return true;\n\t}\n\n\n\tpublic static int test(int a){ //测试是否有多于两个进制为回文数\n\t    int count=0;\n\t    for (int i=2;i<11;i++){\n\t        scale(a,i);\n\t        if (ifEqual()){\n\t            count +=1;\n\t        }\n\t        if (count==2){\n\t            return a;\n\t            break;\n\t        }\n\t    }\n\t    return 0;\n\t}\n\n\t\npublic static void main (String[] args){\n\t    int n,abo,total=0;\n\t    Scanner scanner = new Scanner(System.in);\n\t    n = scanner.nextInt();\n\t    abo = scanner.nextInt();\n\t    for (int i=abo+1;;i++){\n\t        if(test(i)!=0){\n\t            total += 1;\n\t            System.out.println(i);\n\t            }\n\t        if (total==n)\n\t            break;\n\t    }\n\t}\n\n}\n",COMPILE_ERROR,0,0
1319839416269754368,34e5c56c5cec86eefa279cc7a216a4530a6f851f3dbdd281ec607fda9b795eb8,2020-10-24 11:13:32,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.*;\npublic class Main {\n\tpublic static int s[] = new int[301];\n\n\tpublic static void scale(int a,int b){\n\t    int digit=0;\n\t    while(a>0){\n\t        s[++digit] = a%b;\n\t        a /= b;\n\t    }\n\t    s[0]=digit;\n\t}\n\n\tpublic static boolean ifEqual(){//判断s[i]与s[s[0]+1-i]是否相等\n\t    for(int i=1;i<=s[0];i++){\n\t        if(s[i]!=s[s[0]+1-i])\n\t            return false;\n\t    }\n\t    return true;\n\t}\n\n\n\tpublic static int test(int a){ //测试是否有多于两个进制为回文数\n\t    int count=0;\n\t    for (int i=2;i<11;i++){\n\t        scale(a,i);\n\t        if (ifEqual()){\n\t            count +=1;\n\t        }\n\t        if (count==2){\n\t            return a;\n\t            break;\n\t        }\n\t    }\n\t    return 0;\n\t}\n\n\t\npublic static void main (String[] args){\n\t    int n,abo,total=0;\n\t    Scanner scanner = new Scanner(System.in);\n\t    n = scanner.nextInt();\n\t    abo = scanner.nextInt();\n\t    for (int i=abo+1;;i++){\n\t        if(test(i)!=0){\n\t            total += 1;\n\t            System.out.println(i);\n\t            }\n\t        if (total==n)\n\t            break;\n\t    }\n\t}\n\n}\n",COMPILE_ERROR,0,0
1319839534419095552,34e5c56c5cec86eefa279cc7a216a4530a6f851f3dbdd281ec607fda9b795eb8,2020-10-24 11:14:01,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.*;\npublic class Main {\n\tpublic static int s[] = new int[301];\n\n\tpublic static void scale(int a,int b){\n\t    int digit=0;\n\t    while(a>0){\n\t        s[++digit] = a%b;\n\t        a /= b;\n\t    }\n\t    s[0]=digit;\n\t}\n\n\tpublic static boolean ifEqual(){//判断s[i]与s[s[0]+1-i]是否相等\n\t    for(int i=1;i<=s[0];i++){\n\t        if(s[i]!=s[s[0]+1-i])\n\t            return false;\n\t    }\n\t    return true;\n\t}\n\n\n\tpublic static int test(int a){ //测试是否有多于两个进制为回文数\n\t    int count=0;\n\t    for (int i=2;i<11;i++){\n\t        scale(a,i);\n\t        if (ifEqual()){\n\t            count +=1;\n\t        }\n\t        if (count==2){\n\t            return a;\n\t        }\n\t    }\n\t    return 0;\n\t}\n\n\t\npublic static void main (String[] args){\n\t    int n,abo,total=0;\n\t    Scanner scanner = new Scanner(System.in);\n\t    n = scanner.nextInt();\n\t    abo = scanner.nextInt();\n\t    for (int i=abo+1;;i++){\n\t        if(test(i)!=0){\n\t            total += 1;\n\t            System.out.println(i);\n\t            }\n\t        if (total==n)\n\t            break;\n\t    }\n\t}\n\n}\n",ACCEPTED,998,14172
1319893495490629632,ec53039adbfa16331c9f18e1417ee9aff06a3bca71bca4365b8f05065abe9d6c,2020-10-24 14:48:26,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\npublic class Main {\n    public static boolean search(int s) {\n        int a[] = new int[1000];\n        for (int j = 2; j < 11; j++) {\n            int temp = 0, memo = 0;\n            for (int k = 0; s == 0; k++) {\n                a[k] = s % j;\n                s /= j;\n                temp = k + 1;\n            }\n            if (a[temp - 1] == 0) {\n                return false;\n            }\n            for (int n = 0; n == temp / 2; n++) {\n                boolean flag = (a[n] == a[temp - 1 - n]) ? true : false;\n                if (!flag) {\n                    break;\n                }\n                if (flag == true) {\n                    memo++;\n                }\n\n            }\n            boolean flag_ = memo >= 2 ? true : false;\n            if (flag_) {\n                return true;\n            }\n           \n        }\n        return false;\n    }\n    \n\n        \n        public static void main(String []args){\n            Scanner scanner = new Scanner(System.in);\n            int N = scanner.nextInt();\n            int S = scanner.nextInt();\n            int count = 0;\n            for (int i = S + 1;;i++){\n                if(count >= N) {\n                    break;\n                }\n                if(search(i)) {\n                    count++;\n                    System.out.println(i);\n                }\n            }\n\n        }\n}",WRONG_ANSWER,974,14348
1319909483200204800,ec53039adbfa16331c9f18e1417ee9aff06a3bca71bca4365b8f05065abe9d6c,2020-10-24 15:51:58,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,import java.util.Scanner;\npublic class Main {\n    public static boolean isHuiwen(int s) {\n        int a[] = new int[1000];\n        for (int j = 2; j < 11; j++) {\n            int temp1 = 0;\n            int temp2 = 0;\n            for (int k = 0; s == 0; k++) {\n                a[k] = s % j;\n                s /= j;\n                temp1++;\n            }\n            if (a[0] == 0 || a[temp1 - 1] == 0) {\n                return false;\n            }\n            for(int k = 0;k <= temp1 / 2;temp1 ++) {\n            \t\tif(a[k] == a[temp1 -1 - k]) {\n            \t\t\treturn false;\n            \t\t}\n            }\n            temp2 ++;\n            if(temp2 > 1) {\n            \treturn true;\n            }\n         }\n            return false;\n            \n         }\n           \n        \n    \n    \n\n        \n        public static void main(String []args){\n            Scanner scanner = new Scanner(System.in);\n            int N = scanner.nextInt();\n            int S = scanner.nextInt();\n            int count = 0;\n            for (int i = S + 1;;i++){\n                if(count >= N) {\n                    break;\n                }\n                if(isHuiwen(i)) {\n                    count++;\n                    System.out.println(i);\n                }\n            }\n\n        }\n}\n\t,MEMORY_LIMIT_EXCEEDED,0,0
1319909755590889472,ec53039adbfa16331c9f18e1417ee9aff06a3bca71bca4365b8f05065abe9d6c,2020-10-24 15:53:03,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\npublic class Main {\n\tstatic int n;\n\tstatic int S;\n\n\tpublic static void main(String[] args) {\n\t\tScanner console= new Scanner(System.in);\n\t\tn= console.nextInt();\n\t\tS= console.nextInt();\n\t\tint countNum= 0;\n\n\t\tfor(int i=S+1; ; i++) {\n\t\t\tif(countNum==n) return;\n\t\t\t//对于每一个数字 讨论各个进制下的回文情况\n\t\t\tboolean doubleSign1= false;\n\n\t\t\tfor(int r=2; r<=10; r++) {\n\t\t\t\tString iUnderR= Integer.toString(i, r);\n\t\t\t\tStringBuffer reUnderR= new StringBuffer(iUnderR);\n\t\t\t\tif(iUnderR.equals(reUnderR.reverse().toString())) {\n\t\t\t\t\tif(!doubleSign1) {\n\t\t\t\t\t\tdoubleSign1= true;\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tSystem.out.println(i);\n\t\t\t\t\t\tcountNum++;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\n\t}\n\t}\n}",ACCEPTED,1119,22788
1319915787230720000,ec53039adbfa16331c9f18e1417ee9aff06a3bca71bca4365b8f05065abe9d6c,2020-10-24 16:17:01,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\n//输入进制\n//从1到300逐一讨论\n//\t每个数字计算平方\n//\t平方进行进制转换\n//\t转化成字串\n//\t看看是不是回文\n//\t是就输出\n\n\npublic class Main {\n\tstatic int B;//2-20\n\t//static char[] Letter= {'0','1', '2', '3', '4', '5', '6', '7','8','9','A', 'B','C','D','E','F','G', 'H', 'I', 'J'};这里还保存着C++的痕迹 一开始我还是在进行翻译\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner console= new Scanner(System.in);\n\t\tB= console.nextInt();\n\t\t\n\t\tsolve(B);\n\t\t//transOut(10, 11);\n\t\t\n\n\t\t\n\t}\n\t\n\t//n进制下1-300讨论入口\n\tstatic void solve(int B) {\n\t\tfor(int i=1; i<=300; i++) {\n\t\t\t\n\t\t\ttransOut(B, i);\n\t\t}\n\t}\n\t\n\t//进制转换和输出\n\tstatic void transOut(int B, int i) {//进制 数字\n\t\tString iunderB= Integer.toString(i, B);\n\t\tString squareUnderB= Integer.toString(i*i, B);\n\t\tStringBuffer reSquareB= new StringBuffer(squareUnderB);\n\t\t\n\t\tif(squareUnderB.equals(reSquareB.reverse().toString())) {\n\t\t\tSystem.out.println(iunderB.toUpperCase()+ \"" \""+ reSquareB.toString().toUpperCase());\n\t\t}\n\t\t\n\t\t\n\t}\n}\n",ACCEPTED,1099,14172
1319933121836175360,04494f96519bca3d7e4731dce55d91ba0ddba4c67dbea7052ecfabdec4a75d0c,2020-10-24 17:25:54,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"\n\nimport java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner get = new Scanner(System.in);\n\t\tint T = get.nextInt();\n\t\tfun(T);\n\t\t\n\t}\n \n\t\n\tprivate static boolean jud(StringBuffer bf) {\n\t\tString s=new String(bf);\n\t\tchar str[]=s.toCharArray();\n\t\tfor(int i=0;i<str.length/2;i++) {\n\t\t\tif(str[i]!=str[str.length-i-1]) return false;\n\t\t}\n\t\treturn true;\n\t}\n\t\n\tprivate static StringBuffer trans(int s, int t) {\n\t\tStringBuffer str1 = new StringBuffer();\n\t\tint dig;\n\t\twhile(s > 0){\n\t\t\tdig = s % t;\n\t\t\tif(dig >= 10){\n\t\t\t\tstr1.append((char)('A'+dig - 10));\n\t\t\t}else{\n\t\t\t\tstr1.append(dig);\n\t\t\t}\n\t\t\ts /= t;\n\t\t}\n\t\treturn str1;\n\t}\n\t\n\t\n\tprivate static void fun(int t) {\n\t\tfor(int i = 1;i <= 300;i++){\n\t\t\tint s = i * i;\n\t\t\tStringBuffer n = new StringBuffer();\n\t\t\tStringBuffer squ = new StringBuffer();\n\t\t\tn = trans(i,t);\n\t\t\tsqu = trans(s,t);\n\t\t\tif(jud(squ)){\n\t\t\t\tSystem.out.println(n.reverse()+\"" \""+squ);\n\t\t\t}\n\t\t}\n\t}\n\t\n}\n\n\n\n",ACCEPTED,1086,14564
1319941316122071040,04494f96519bca3d7e4731dce55d91ba0ddba4c67dbea7052ecfabdec4a75d0c,2020-10-24 17:58:27,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\npublic class Main {\n\tstatic int n,s;\n\tstatic int[] a=new int[100];\n\tpublic static boolean che(int x,int b)\n\t{\n\t\tint t=0;\n\t\tdo{\n\t\t\ta[++t]=x%b;\n\t\t}while((x/=b)!=0);\n\t\t\n\t\tfor(int i=1;i<=t;i++)\n\t\t{\n\t\t\tif(a[i]!=a[t-i+1])\n\t\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n\tpublic static boolean check(int s)\n\t{\n\t\tint tmp=0;\n\t\tfor(int i=2;i<=10;i++)\n\t\t{\n\t\t\tif(che(s,i))\n\t\t\t\ttmp++;\n\t\t\tif(tmp>=2)\n\t\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}\n\tpublic static void main(String[] args) {\n\t\tScanner input=new Scanner(System.in);\n\t\tn=input.nextInt();\n\t\ts=input.nextInt();\n\t\ts++;\n\t\tfor(int i=0;i<n;s++)\n\t\t{\n\t\t\tif(check(s))\n\t\t\t{\n\t\t\t\tSystem.out.println(s);\n\t\t\t\ti++;\n\t\t\t} \n\t\t}\n\t\tinput.close();\n\t}\n\n}",ACCEPTED,845,14472
1320050421859954688,557c9378d3c95234ed05fa5f460fb3490cd9b88e30e5dd059f31aa3622db429a,2020-10-25 01:12:00,Java,10.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.*;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner in=new Scanner(System.in);\n\t\tint n=in.nextInt();\n\t\tint m,b,k,z,v;\n\t\tfor(int i=1;i<=300;i++) {\n\t\t\tif(i*i<10) {\n\t\t\t\tSystem.out.println(i+\"" \""+i*i);\n\t\t\t}\n\t\t\telse if(i*i<100) {\n\t\t\t\tm=(i*i)/10;\n\t\t\t\tb=(i*i)%10;\n\t\t\t\tif(m==b) {\n\t\t\t\t\tSystem.out.println(i+\"" \""+i*i);\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if(i*i<1000){\n\t\t\t\tm=(i*i)/100;\n\t\t\t\tb=(i*i-m*100)/10;\n\t\t\t\tk=(i*i-m*100)%10;\n\t\t\t\tif(m==k) {\n\t\t\t\t\tSystem.out.println(i+\"" \""+i*i);\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if(i*i<10000) {\n\t\t\t\tm=(i*i)/1000;\n\t\t\t\tb=(i*i-m*1000)/100;\n\t\t\t\tk=(i*i-m*1000-b*100)/10;\n\t\t\t\tz=(i*i-m*1000-b*100)%10;\n\t\t\t\tif(m==z&&b==k) {\n\t\t\t\t\tSystem.out.println(i+\"" \""+i*i);\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tm=(i*i)/10000;\n\t\t\t\tb=(i*i-m*10000)/1000;\n\t\t\t\tk=(i*i-m*10000-b*1000)/100;\n\t\t\t\tz=(i*i-m*10000-b*1000-k*100)/10;\n\t\t\t\tv=(i*i-m*10000-b*1000-k*100)%10;\n\t\t\t\tif(m==v&&b==z) {\n\t\t\t\t\tSystem.out.println(i+\"" \""+i*i);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}",PARTIAL_ACCEPTED,1092,14608
1320051914793111552,557c9378d3c95234ed05fa5f460fb3490cd9b88e30e5dd059f31aa3622db429a,2020-10-25 01:17:56,Java,10.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.*;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner in=new Scanner(System.in);\n\t\tint n=in.nextInt();\n\t\tint m,b,k,z,v;\n\t\tfor(int i=1;i<=300;i++) {\n\t\t\tif(i*i<n) {\n\t\t\t\tSystem.out.println(i+\"" \""+i*i);\n\t\t\t}\n\t\t\telse if(i*i<n*n) {\n\t\t\t\tm=(i*i)/n;\n\t\t\t\tb=(i*i)%n;\n\t\t\t\tif(m==b) {\n\t\t\t\t\tSystem.out.println(i+\"" \""+i*i);\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if(i*i<n*n*n){\n\t\t\t\tm=(i*i)/(n*n);\n\t\t\t\tb=(i*i-m*n*n)/n;\n\t\t\t\tk=(i*i-m*n*n)%n;\n\t\t\t\tif(m==k) {\n\t\t\t\t\tSystem.out.println(i+\"" \""+i*i);\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if(i*i<n*n*n*n) {\n\t\t\t\tm=(i*i)/(n*n*n);\n\t\t\t\tb=(i*i-m*n*n*n)/(n*n);\n\t\t\t\tk=(i*i-m*n*n*n-b*n*n)/n;\n\t\t\t\tz=(i*i-m*n*n*n-b*n*n)%n;\n\t\t\t\tif(m==z&&b==k) {\n\t\t\t\t\tSystem.out.println(i+\"" \""+i*i);\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tm=(i*i)/(n*n*n*n);\n\t\t\t\tb=(i*i-m*n*n*n*n)/(n*n*n);\n\t\t\t\tk=(i*i-m*n*n*n*n-b*n*n*n)/(n*n);\n\t\t\t\tz=(i*i-m*n*n*n*n-b*n*n*n-k*n*n)/n;\n\t\t\t\tv=(i*i-m*n*n*n*n-b*n*n*n-k*n*n)%n;\n\t\t\t\tif(m==v&&b==z) {\n\t\t\t\t\tSystem.out.println(i+\"" \""+i*i);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}",PARTIAL_ACCEPTED,1096,14184
1320053654150000640,557c9378d3c95234ed05fa5f460fb3490cd9b88e30e5dd059f31aa3622db429a,2020-10-25 01:24:51,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.*;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tint T = in.nextInt();\n\t\tprint(T);\n\t}\n\tprivate static void print(int t) {\n\t\tfor(int i = 1;i <= 300;++ i){\n\t\t\tint s = i * i;\n\t\t\tStringBuffer num = new StringBuffer();\n\t\t\tStringBuffer square = new StringBuffer();\n\t\t\tnum = convert(i,t);\n\t\t\tsquare = convert(s,t);\n\t\t\tif(ispalindrom(square)){\n\t\t\t\tSystem.out.println(num.reverse()+\"" \""+square);\n\t\t\t}\n\t\t}\n\t}\n\tprivate static StringBuffer convert(int s, int t) {\n\t\tStringBuffer rtnval = new StringBuffer();\n\t\tint digit;\n\t\twhile(s > 0){\n\t\t\tdigit = s % t;\n\t\t\tif(digit >= 10){\n\t\t\t\trtnval.append((char)('A'+digit - 10));\n\t\t\t}else{\n\t\t\t\trtnval.append(digit);\n\t\t\t}\n\t\t\ts /= t;\n\t\t}\n\t\treturn rtnval;\n\t}\n\tprivate static boolean ispalindrom(StringBuffer bf) {\n\t\tString s = new String(bf);\n\t\tchar sch[] = s.toCharArray();\n\t\tint len = sch.length;\n\t\tfor(int i = 0;i < len / 2;++ i){\n\t\t\tif(sch[i] != sch[len - i - 1]){\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n}",ACCEPTED,1143,14444
1320056828088889344,557c9378d3c95234ed05fa5f460fb3490cd9b88e30e5dd059f31aa3622db429a,2020-10-25 01:37:27,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.*;\npublic class Main {\n\tstatic int n;\n\tstatic int s;\n\tpublic static void main(String[] args) {\n\t\tScanner in= new Scanner(System.in);\n\t\tn=in.nextInt();\n\t\ts=in.nextInt();\n\t\tint num= 0;\n\t\tfor(int i=s+1; ; i++) {\n\t\t\tif(num==n) return;\n\t\t\tboolean a= false;\n\t\t\tfor(int j=2; j<=10; j++) {\n\t\t\t\tString b= Integer.toString(i, j);\n\t\t\t\tStringBuffer c= new StringBuffer(b);\n\t\t\t\tif(b.equals(c.reverse().toString())) {\n\t\t\t\t\tif(!a) {\n\t\t\t\t\t\ta=true;\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tSystem.out.println(i);\n\t\t\t\t\t\tnum++;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}",ACCEPTED,973,21272
1320242605078958080,f93d1828ae9838b7077a1ff855bab09fec8f646ad843ecdeec8898eac2734203,2020-10-25 13:55:40,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner= new Scanner(System.in);\n        int B =scanner.nextInt();\n        for (int i = 1;i<=300;i++){\n            StringBuffer num1= convert(i,B);\n            StringBuffer num2= convert(i*i,B);\n            if (isPalin(num2)){\n                System.out.println(num1+\"" \""+num2);\n            }\n        }\n    }\n    public static boolean isPalin(StringBuffer s){\n        for (int i=0;i<s.length()/2;i++){\n            if(s.charAt(i)!=s.charAt(s.length()-i-1)){\n                return false;\n            }\n        }\n        return true;\n    }\n    public static StringBuffer convert(int num,int B) {\n        StringBuffer rtnval = new StringBuffer();\n        int digit;\n        while (num > 0) {\n            digit = num % B;\n            if (digit >= 10) {\n                rtnval.append((char) ('A' + digit - 10));\n            } else {\n                rtnval.append(digit);\n            }\n            num /= B;\n        }\n        return rtnval.reverse();//翻转以后得到\n    }\n    }\n",ACCEPTED,1207,14824
1320389099023060992,dceb714454fb02db5963c2b4b6fdc555282b793bcb3904082e3685d4143dfc5d,2020-10-25 23:37:47,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Test8 {\n\t\tstatic int B, N,lenth;\n\t\tstatic char[] a=new char[20];\n \n\t\tstatic void Transf(int n){//将n转换为进制B\n\t\t\tint i=0,y;\n\t\t\tlenth=0;\n\t\t\tif(B>=2&&B<10){\n\t\t\t\twhile(n>0){\n\t\t\t\t\ta[i]=(char)(n%B+'0');\n\t\t\t\t\tn=n/B;\n\t\t\t\t\ti++;\n\t\t\t\t\tlenth++;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if(B>=10&&B<=20){\n\t\t\t\twhile(n>0){\n\t\t\t\t\ty=n%B;\n\t\t\t\t\tif(y<10)\n\t\t\t\t\t\ta[i]=(char)(y+'0');\n\t\t\t\t\telse {\n\t\t\t\t\t\tswitch(y){\n\t\t\t\t\t\tcase 10: a[i] = 'A'; break;\n\t\t\t\t\t\tcase 11: a[i] = 'B'; break;\n\t\t\t\t\t\tcase 12: a[i] = 'C'; break;\n\t\t\t\t\t\tcase 13: a[i] = 'D'; break;\n\t\t\t\t\t\tcase 14: a[i] = 'E'; break;\n\t\t\t\t\t\tcase 15: a[i] = 'F'; break;\n\t\t\t\t\t\tcase 16: a[i] = 'G'; break;\n\t\t\t\t\t\tcase 17: a[i] = 'H'; break;\n\t\t\t\t\t\tcase 18: a[i] = 'I'; break;\n\t\t\t\t\t\tcase 19: a[i] = 'J'; break;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\tn=n/B;\n\t\t\t\ti++;\n\t\t\t\tlenth++;\n\t\t\t\t}\n\t\t\t}\n}\n\t\tstatic boolean JdgPlal(){//判断是否是回文数\n\t\t\tTransf(N);\n\t\t\tint i=0;\n\t\t\tint j=lenth-1;\n\t\t\twhile(i<j){\n\t\t\t\tif(a[i] != a[j])\n\t\t\t\t\treturn false;\n\t\t\t\ti++;\n\t\t\t\tj--;\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n \n\t\tstatic void Show(int m){//输出该数字m\n\t\t\tint i;\n\t\t\tTransf(m);\n\t\t\tfor( i=lenth-1; i>=0; i-- )\n\t\t\t\tSystem.out.printf(\""%c\"", a[i]);\n\t\t}\t\n\n\n\tpublic static void main(String[] args) {\n\t\tScanner input=new Scanner(System.in);\n\t\tB=input.nextInt();\n\t\tinput.close();\n\t\t\n\t\tfor(int i=1;i<=300;i++) {\n\t\t\tN=i*i;\n\t\t\tif(JdgPlal()){\n\t\t\t\tTest8.Show(i);\n\t\t\t\tSystem.out.print(\"" \"");\n\t\t\t\tTest8.Show(N);\n\t\t\t\tSystem.out.print(\""\\n\"");\n\t\t\t}\n\t\t}\n\t}\n\n}\n",COMPILE_ERROR,0,0
1320389183420846080,dceb714454fb02db5963c2b4b6fdc555282b793bcb3904082e3685d4143dfc5d,2020-10-25 23:38:07,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\t\tstatic int B, N,lenth;\n\t\tstatic char[] a=new char[20];\n \n\t\tstatic void Transf(int n){//将n转换为进制B\n\t\t\tint i=0,y;\n\t\t\tlenth=0;\n\t\t\tif(B>=2&&B<10){\n\t\t\t\twhile(n>0){\n\t\t\t\t\ta[i]=(char)(n%B+'0');\n\t\t\t\t\tn=n/B;\n\t\t\t\t\ti++;\n\t\t\t\t\tlenth++;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if(B>=10&&B<=20){\n\t\t\t\twhile(n>0){\n\t\t\t\t\ty=n%B;\n\t\t\t\t\tif(y<10)\n\t\t\t\t\t\ta[i]=(char)(y+'0');\n\t\t\t\t\telse {\n\t\t\t\t\t\tswitch(y){\n\t\t\t\t\t\tcase 10: a[i] = 'A'; break;\n\t\t\t\t\t\tcase 11: a[i] = 'B'; break;\n\t\t\t\t\t\tcase 12: a[i] = 'C'; break;\n\t\t\t\t\t\tcase 13: a[i] = 'D'; break;\n\t\t\t\t\t\tcase 14: a[i] = 'E'; break;\n\t\t\t\t\t\tcase 15: a[i] = 'F'; break;\n\t\t\t\t\t\tcase 16: a[i] = 'G'; break;\n\t\t\t\t\t\tcase 17: a[i] = 'H'; break;\n\t\t\t\t\t\tcase 18: a[i] = 'I'; break;\n\t\t\t\t\t\tcase 19: a[i] = 'J'; break;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\tn=n/B;\n\t\t\t\ti++;\n\t\t\t\tlenth++;\n\t\t\t\t}\n\t\t\t}\n}\n\t\tstatic boolean JdgPlal(){//判断是否是回文数\n\t\t\tTransf(N);\n\t\t\tint i=0;\n\t\t\tint j=lenth-1;\n\t\t\twhile(i<j){\n\t\t\t\tif(a[i] != a[j])\n\t\t\t\t\treturn false;\n\t\t\t\ti++;\n\t\t\t\tj--;\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n \n\t\tstatic void Show(int m){//输出该数字m\n\t\t\tint i;\n\t\t\tTransf(m);\n\t\t\tfor( i=lenth-1; i>=0; i-- )\n\t\t\t\tSystem.out.printf(\""%c\"", a[i]);\n\t\t}\t\n\n\n\tpublic static void main(String[] args) {\n\t\tScanner input=new Scanner(System.in);\n\t\tB=input.nextInt();\n\t\tinput.close();\n\t\t\n\t\tfor(int i=1;i<=300;i++) {\n\t\t\tN=i*i;\n\t\t\tif(JdgPlal()){\n\t\t\t\tTest8.Show(i);\n\t\t\t\tSystem.out.print(\"" \"");\n\t\t\t\tTest8.Show(N);\n\t\t\t\tSystem.out.print(\""\\n\"");\n\t\t\t}\n\t\t}\n\t}\n\n}\n",COMPILE_ERROR,0,0
1320389296973238272,dceb714454fb02db5963c2b4b6fdc555282b793bcb3904082e3685d4143dfc5d,2020-10-25 23:38:34,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\t\tstatic int B, N,lenth;\n\t\tstatic char[] a=new char[20];\n \n\t\tstatic void Transf(int n){//将n转换为进制B\n\t\t\tint i=0,y;\n\t\t\tlenth=0;\n\t\t\tif(B>=2&&B<10){\n\t\t\t\twhile(n>0){\n\t\t\t\t\ta[i]=(char)(n%B+'0');\n\t\t\t\t\tn=n/B;\n\t\t\t\t\ti++;\n\t\t\t\t\tlenth++;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if(B>=10&&B<=20){\n\t\t\t\twhile(n>0){\n\t\t\t\t\ty=n%B;\n\t\t\t\t\tif(y<10)\n\t\t\t\t\t\ta[i]=(char)(y+'0');\n\t\t\t\t\telse {\n\t\t\t\t\t\tswitch(y){\n\t\t\t\t\t\tcase 10: a[i] = 'A'; break;\n\t\t\t\t\t\tcase 11: a[i] = 'B'; break;\n\t\t\t\t\t\tcase 12: a[i] = 'C'; break;\n\t\t\t\t\t\tcase 13: a[i] = 'D'; break;\n\t\t\t\t\t\tcase 14: a[i] = 'E'; break;\n\t\t\t\t\t\tcase 15: a[i] = 'F'; break;\n\t\t\t\t\t\tcase 16: a[i] = 'G'; break;\n\t\t\t\t\t\tcase 17: a[i] = 'H'; break;\n\t\t\t\t\t\tcase 18: a[i] = 'I'; break;\n\t\t\t\t\t\tcase 19: a[i] = 'J'; break;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\tn=n/B;\n\t\t\t\ti++;\n\t\t\t\tlenth++;\n\t\t\t\t}\n\t\t\t}\n}\n\t\tstatic boolean JdgPlal(){//判断是否是回文数\n\t\t\tTransf(N);\n\t\t\tint i=0;\n\t\t\tint j=lenth-1;\n\t\t\twhile(i<j){\n\t\t\t\tif(a[i] != a[j])\n\t\t\t\t\treturn false;\n\t\t\t\ti++;\n\t\t\t\tj--;\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n \n\t\tstatic void Show(int m){//输出该数字m\n\t\t\tint i;\n\t\t\tTransf(m);\n\t\t\tfor( i=lenth-1; i>=0; i-- )\n\t\t\t\tSystem.out.printf(\""%c\"", a[i]);\n\t\t}\t\n\n\n\tpublic static void main(String[] args) {\n\t\tScanner input=new Scanner(System.in);\n\t\tB=input.nextInt();\n\t\tinput.close();\n\t\t\n\t\tfor(int i=1;i<=300;i++) {\n\t\t\tN=i*i;\n\t\t\tif(JdgPlal()){\n\t\t\t\tMain.Show(i);\n\t\t\t\tSystem.out.print(\"" \"");\n\t\t\t\tMain.Show(N);\n\t\t\t\tSystem.out.print(\""\\n\"");\n\t\t\t}\n\t\t}\n\t}\n\n}\n",ACCEPTED,1130,14588
1320998610486251520,c85b4c1c77fefeb5973f4524c52bf63288e9a28b3c4ba86d4dd9facc66617b4a,2020-10-27 15:59:46,Java,60.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\npublic class Main {\n    public static int pd(int n,int k) {\n        int []p = new int [1005];\n        int t=0;\n        while(n!=0) {\n            p[++t]=n%k;\n            n/=k;\n        }\n        for(int i=1,j=t;i<=t/2;i++,j--)\n            if(p[i]!=p[j])\n                return 0;\n        return 1;\n    }\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int n=0,s=0,ans=0;\n        n = sc.nextInt();\n        s = sc.nextInt();\n        for(int i=s+1;ans<n;i++) {\n            int count=0;\n            for(int j=2;j<=10;j++)\n                if(pd(i,j)==1)\n                    ++count;\n            if(count>=2) {\n                ++ans;\n                System.out.println(i);\n            }\n        }\n    }\n}\n",PARTIAL_ACCEPTED,816,52412
1321021020606386176,32b7c4f8cffc3adcd9a13bac99222a0cfce30962e4357aee812d9afae4d2467e,2020-10-27 17:28:49,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main{\n\tpublic static void main(String args[]) {\n\t\tint B = 0;\n\t    int pow = 0;\n\t    int tmp = 0;\n\t    char c;\n\t    String str = \""\"";\n\t    String s;\n\t    Scanner sc = new Scanner (System.in);\n\t    B = sc.nextInt();\n\t    for (int i = 1; i < 301; i++) {\n\t        pow = i * i;\n\t        str = \""\"";\n\t        while (true) {\n\t            tmp = pow % B;\n\t            if(tmp > 9){\n\t            c = (char)(tmp + 55);\n\t            }\n\t            else {\n\t            c = (char)(tmp + '0');\n\t            }\n\t            if ((pow /= B) > 0) {\n\t                str = c + str;\n\t            }\n\t            else {\n\t                str = c + str;\n\t                break;\n\t            }\n\t        }\n\t        s = str;\n\t        char s1[] = s.toCharArray();\n\t        char str1[] = str.toCharArray();\n\t        for(int j=0;j<s.length();j++) {\n\t        \ts1[j] = str1[s.length()-1-j];\n\t        }\n\t        String ss = str;\n\t        int sign = 1;\n\t        for(int j=0;j<s.length();j++) {\n\t        \tif(s1[j] != str1[j]) {\n\t        \t\tsign = 0;\n\t        \t\tbreak;\n\t        \t}\n\t        }\n\t        if (sign==1) {\n\t            str = \""\"";\n\t            int hahaha = i;\n\t            while (true) {\n\t                tmp = hahaha % B;\n\t                if (tmp > 9) {\n\t                    c = (char)(tmp + 55);\n\t                }\n\t                else {\n\t                    c = (char)(tmp + '0');\n\t                }\n\t                if ((hahaha /= B) > 0) {\n\t                    str = c + str;\n\t                }\n\t                else {\n\t                    str = c + str;\n\t                    break;\n\t                }\n\t            }\n\t            System.out.println(str+\"" \""+ss);\n\t        }\n\t    }\n\t}\n}",ACCEPTED,1084,14436
1321021087652327424,32b7c4f8cffc3adcd9a13bac99222a0cfce30962e4357aee812d9afae4d2467e,2020-10-27 17:29:05,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n    public static void main(String[] args) {\n        int n,s,count=0;\n        Scanner scanner = new Scanner(System.in);\n        n=scanner.nextInt();\n        s=scanner.nextInt();\n        int []num=new int[n];\n        for (int i = s+1;count<n;i++){\n            int temp=0;\n            for(int j = 2 ;j<=10;j++){\n                if(isPalin(convert(i,j))){\n                    temp++;\n                }\n                if(temp>=2){\n                    num[count]=i;\n                    count++;\n                    break;\n                }\n            }\n        }\n        for(int i = 0; i<num.length;i++){\n            System.out.println(num[i]);\n        }\n    }\n    public static boolean isPalin(StringBuffer s){\n        for (int i=0;i<s.length()/2;i++){\n            if(s.charAt(i)!=s.charAt(s.length()-i-1)){\n                return false;\n            }\n        }\n        return true;\n    }\n    public static StringBuffer convert(int num,int B) {\n        StringBuffer rtnval = new StringBuffer();\n        int digit;\n        while (num > 0) {\n            digit = num % B;\n            if (digit >= 10) {\n                rtnval.append((char) ('A' + digit - 10));\n            } else {\n                rtnval.append(digit);\n            }\n            num /= B;\n        }\n        return rtnval.reverse();\n    }\n}",ACCEPTED,953,17608
1321024074252627968,dceb714454fb02db5963c2b4b6fdc555282b793bcb3904082e3685d4143dfc5d,2020-10-27 17:40:57,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\tstatic int B, N,lenth;\n\tstatic char[] a=new char[20];\n\t\n\tstatic void Transf(int n,int t){//将n转换为进制t\n\t\tint i=0;\n\t\tlenth=0;\n\t\twhile(n>0){\n\t\t\t\ta[i]=(char)(n%t+'0');\n\t\t\t\tn=n/t;\n\t\t\t\ti++;\n\t\t\t\tlenth++;\n\t\t\t}\n\t}\n\n\tstatic boolean JdgPlal(int n, int t){//判断是否是回文数\n\t\tTransf(n,t);\n\t\tint i=0;\n\t\tint j=lenth-1;\n\t\twhile(i<j){\n\t\t\tif(a[i] != a[j])\n\t\t\t\treturn false;\n\t\t\ti++;\n\t\t\tj--;\n\t\t}\n\t\treturn true;\n\t}\n\tpublic static void main(String[] args) {\n\t\tScanner input=new Scanner(System.in);\n\t\tint n=input.nextInt();\n\t\tint s=input.nextInt();\n\t\tinput.close();\n\t\t\n\t\tint OUT=s+1;\n\t\tint count=0,j=0;\n\t\tint [] out=new int[n];\n\t\twhile(OUT>s) {\n\t\t\tfor(int i=2;i<=10;i++) {\n\t\t\t\tif(JdgPlal(OUT,i)) {\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t\tif(count==2) {\n\t\t\t\t\tout[j]=OUT;\n\t\t\t\t\tbreak ;\n\t\t\t\t}\n\t\t\t}\n\t\t\tj++;\n\t\t\tcount=0;\n\t\t\tOUT++;\n\t\t\tif(j>n)\n\t\t\t\tbreak;\n\t\t\n\t\t}\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tSystem.out.println(out[i]);\n\t\t}\n\n}\n}\n",WRONG_ANSWER,929,14148
1321024369087041536,dceb714454fb02db5963c2b4b6fdc555282b793bcb3904082e3685d4143dfc5d,2020-10-27 17:42:07,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Test9 {\n\tstatic int B, N,lenth;\n\tstatic char[] a=new char[20];\n\t\n\tstatic void Transf(int n,int t){//将n转换为进制B\n\t\tint i=0;\n\t\tlenth=0;\n\t\twhile(n>0){\n\t\t\t\ta[i]=(char)(n%t+'0');\n\t\t\t\tn=n/t;\n\t\t\t\ti++;\n\t\t\t\tlenth++;\n\t\t\t}\n\t}\n\n\tstatic boolean JdgPlal(int n, int t){//判断是否是回文数\n\t\tTransf(n,t);\n\t\tint i=0;\n\t\tint j=lenth-1;\n\t\twhile(i<j){\n\t\t\tif(a[i] != a[j])\n\t\t\t\treturn false;\n\t\t\ti++;\n\t\t\tj--;\n\t\t}\n\t\treturn true;\n\t}\n\tpublic static void main(String[] args) {\n\t\tScanner input=new Scanner(System.in);\n\t\tint n=input.nextInt();\n\t\tint s=input.nextInt();\n\t\tinput.close();\n\t\t\n\t\tint OUT=s+1;\n\t\tint count=0,j=0;\n\t\tint [] out=new int[n];\n\t\twhile(OUT>s) {\n\t\t\tfor(int i=2;i<=10;i++) {\n\t\t\t\tif(JdgPlal(OUT,i)) {\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t\tif(count==2) {\n\t\t\t\t\tout[j]=OUT;\n\t\t\t\t\tbreak ;\n\t\t\t\t}\n\t\t\t}\n\t\t\tj++;\n\t\t\tcount=0;\n\t\t\tOUT++;\n\t\t\tif(j>n)\n\t\t\t\tbreak;\n\t\t\n\t\t}\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tSystem.out.println(out[i]);\n\t\t}\n\n}\n}\n",COMPILE_ERROR,0,0
1321024468332654592,dceb714454fb02db5963c2b4b6fdc555282b793bcb3904082e3685d4143dfc5d,2020-10-27 17:42:31,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\tstatic int B, N,lenth;\n\tstatic char[] a=new char[20];\n\t\n\tstatic void Transf(int n,int t){//将n转换为进制B\n\t\tint i=0;\n\t\tlenth=0;\n\t\twhile(n>0){\n\t\t\t\ta[i]=(char)(n%t+'0');\n\t\t\t\tn=n/t;\n\t\t\t\ti++;\n\t\t\t\tlenth++;\n\t\t\t}\n\t}\n\n\tstatic boolean JdgPlal(int n, int t){//判断是否是回文数\n\t\tTransf(n,t);\n\t\tint i=0;\n\t\tint j=lenth-1;\n\t\twhile(i<j){\n\t\t\tif(a[i] != a[j])\n\t\t\t\treturn false;\n\t\t\ti++;\n\t\t\tj--;\n\t\t}\n\t\treturn true;\n\t}\n\tpublic static void main(String[] args) {\n\t\tScanner input=new Scanner(System.in);\n\t\tint n=input.nextInt();\n\t\tint s=input.nextInt();\n\t\tinput.close();\n\t\t\n\t\tint OUT=s+1;\n\t\tint count=0,j=0;\n\t\tint [] out=new int[n];\n\t\twhile(OUT>s) {\n\t\t\tfor(int i=2;i<=10;i++) {\n\t\t\t\tif(JdgPlal(OUT,i)) {\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t\tif(count==2) {\n\t\t\t\t\tout[j]=OUT;\n\t\t\t\t\tbreak ;\n\t\t\t\t}\n\t\t\t}\n\t\t\tj++;\n\t\t\tcount=0;\n\t\t\tOUT++;\n\t\t\tif(j>n)\n\t\t\t\tbreak;\n\t\t\n\t\t}\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tSystem.out.println(out[i]);\n\t\t}\n\n}\n}\n",WRONG_ANSWER,883,14156
1321029126560231424,dceb714454fb02db5963c2b4b6fdc555282b793bcb3904082e3685d4143dfc5d,2020-10-27 18:01:01,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\tstatic int B, N,lenth;\n\tstatic char[] a=new char[20];\n\t\n\tstatic void Transf(int n,int t){//将n转换为进制B\n\t\tint i=0;\n\t\tlenth=0;\n\t\twhile(n>0){\n\t\t\t\ta[i]=(char)(n%t+'0');\n\t\t\t\tn=n/t;\n\t\t\t\ti++;\n\t\t\t\tlenth++;\n\t\t\t}\n\t}\n\n\tstatic boolean JdgPlal(int n, int t){//判断是否是回文数\n\t\tTransf(n,t);\n\t\tint i=0;\n\t\tint j=lenth-1;\n\t\twhile(i<j){\n\t\t\tif(a[i] != a[j])\n\t\t\t\treturn false;\n\t\t\ti++;\n\t\t\tj--;\n\t\t}\n\t\treturn true;\n\t}\n\tpublic static void main(String[] args) {\n\t\tScanner input=new Scanner(System.in);\n\t\tint n=input.nextInt();\n\t\tint s=input.nextInt();\n\t\tinput.close();\n\t\t\n\t\tint OUT=s+1;\n\t\tint count=0,j=0;\n\t\tint [] out=new int[n];\n\t\twhile(OUT>s) {\n\t\t\tOUT:\n\t\t\tfor(int i=2;i<=10;i++) {//从二进制到十进制\n\t\t\t\tif(JdgPlal(OUT,i)) {\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t\tif(count==2) {\n\t\t\t\t\tout[j]=OUT;\n\t\t\t\t\tj++;\n\t\t\t\t\tbreak OUT ;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tcount=0;\n\t\t\tOUT++;\n\t\t\tif(j>=n)\n\t\t\t\tbreak;\n\t\t\n\t\t}\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tSystem.out.println(out[i]);\n\t\t}\n\n}\n}\n",ACCEPTED,993,13944
1321081284173320192,c3e6f8ec2d23f7f807edf9bf11527d181f7fd2c4e0ae98ec2be0571dd32dde6c,2020-10-27 21:28:17,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.HashMap; \nimport java.util.HashSet;\nimport java.util.Map;\nimport java.util.Random;\nimport java.util.ArrayList;\nimport java.util.Collections;\nimport java.io.BufferedWriter;\nimport java.io.PrintWriter;\nimport java.util.List;\nimport java.util.Arrays;\nimport java.util.Iterator;\nimport java.util.LinkedHashSet;\nimport java.util.Map;\nimport java.util.Scanner;\nimport java.util.Collections;\nimport java.io.BufferedReader;\nimport java.io.FileReader;\nimport java.io.FileWriter;\nimport java.io.PrintWriter;\nimport java.util.Collections;\nimport java.util.Comparator;\nimport java.util.List;\nimport java.util.StringTokenizer;\npublic class Main {\n\n\t static boolean palin_num (String s) {\n\t\tStringBuilder str_a=new StringBuilder(s);\n//\t\tStringBuilder str_b=new StringBuilder(s);\n\t\tstr_a.reverse();\n\t\tboolean flag;\n\t\tif(s.compareTo(str_a.toString())==0)\n\t\t\tflag=true;\n\t\telse\n\t\t\tflag=false;\n\n\t\treturn flag;\n\t}//palin_num\n\t\n\tstatic String intToA(int n, int radix)\n\t{\n\t\tStringBuilder ans=new StringBuilder(\""\"");\n\t    do {\n\t        int t = n % radix;\n\t        if (t >= 0 && t <= 9)\t\n\t        {\n\t            ans.append( (char)(t + '0'));\n\t        }//if\n\t        else \n\t        {\n\t        \tans.append((char)(t - 10 + 'A'));\n\t        }//else\n\n\t        n /= radix;\n\t    } while (n != 0);\n\t\tans.reverse();\n\t\treturn ans.toString();\n\t}//intToA\n\t \n\t \n\tpublic static void main(String[] args) {\n\t\t\n\t\tScanner input=new Scanner(System.in);\n\t\tint n= input.nextInt();\n\t\tint s= input.nextInt();\n\t\ts++;\n\t\tArrayList<Integer> p=new ArrayList();\n\t\tint sum;\n\t\twhile(p.size()<n)\n\t\t{\n\t\t\tsum=0;\n\t        for (int i = 2; i <= 10; i++)\n\t        {\n\t            if (palin_num(intToA(s, i))) // 此时对应进制的数是回文数；\n\t            {\n\t                sum++; // 记录次数+1；\n\t            }//if\n\t        }//for\n\t        if(sum>=2)\n\t        \tp.add((Integer)s);\n\t        s++;\n\t\t}//while\n\t\tfor (int i = 0; i < p.size(); i++)\n\t\t\tSystem.out.println((int)p.get(i));\n\t\t\n\t\t\n\t}//main\n}//problem0709\n",ACCEPTED,1076,22500
1321664775945502720,c85b4c1c77fefeb5973f4524c52bf63288e9a28b3c4ba86d4dd9facc66617b4a,2020-10-29 12:06:52,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n    static int b=0, m=0, s=0;\n    static int[] a = new int [100];\n    static int test(int x,int b){\n        int k = 0;\n        while (x > 0){\n            k++;\n            a[k] = x % b;\n            x /= b;\n        }\n        int t = k, i = k;\n        while (i > 0 && a[i] == a[t - i + 1])\n            i--;\n        if (i == 0)\n            return 1;\n        else\n            return 0;\n    }\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        m = sc.nextInt();\n        s = sc.nextInt();\n        while (m!=0) {\n            s++;\n            int temp=0;\n            for (int i=2;i<=10;i++)\n                if (test(s,i)!=0){\n                    temp++;\n                    if (temp==2)\n                        break;\n                }\n            if (temp==2){\n                System.out.println(s);\n                m--;\n            }\n        }\n        return;\n    }\n}\n",ACCEPTED,1110,14396
1322363618394714112,4a56193e4e3aef88687c4b59a91d8be77df2f76f9682cde0c0a70959b66497ce,2020-10-31 10:23:49,Java,0.0,1306870976110592007,1267442030214471680,1049226397448056832,"package PTA;\nimport java.util.Scanner;\n\npublic class Main {\n    static int B;\n    static int a[]=new int [20];\n    public static void main(String[] args) {\n        Scanner sc=new Scanner(System.in);\n        B=sc.nextInt();\n        for(int i=1;i<=300;i++) {\n            if(check(i)) {\n                change(i);\n                System.out.print(\"" \"");\n                change(i*i);\n                System.out.println();\n            }\n        }\n    }\n    public static boolean check(int x)\n    {\n        int temp=0;\n        x=x*x;\n        while(x!=0)\n        {\n            a[++temp]=x%B;\n            x/=B;\n        }\n        for(int i=1,j=temp;i<j;i++,j--)\n            if(a[i]!=a[j])\n                return false;\n        return true;\n    }\n    public static void change(int x) {\n        int temp=0;\n        while(x!=0)\n        {\n            a[++temp]=x%B;\n            x/=B;\n        }\n        for(int i=temp;i>=1;i--)\n        {\n            if(a[i]>9) {\n                int y=a[i]-10+65;\n                char a=(char) y;\n                System.out.print(a);\n            }\n            else {\n                System.out.print(a[i]);\n            }\n        }\n    }\n}",WRONG_ANSWER,780,12688
1322363837597437952,4a56193e4e3aef88687c4b59a91d8be77df2f76f9682cde0c0a70959b66497ce,2020-10-31 10:24:41,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n    static int B;\n    static int a[]=new int [20];\n    public static void main(String[] args) {\n        Scanner sc=new Scanner(System.in);\n        B=sc.nextInt();\n        for(int i=1;i<=300;i++) {\n            if(check(i)) {\n                change(i);\n                System.out.print(\"" \"");\n                change(i*i);\n                System.out.println();\n            }\n        }\n    }\n    public static boolean check(int x)\n    {\n        int temp=0;\n        x=x*x;\n        while(x!=0)\n        {\n            a[++temp]=x%B;\n            x/=B;\n        }\n        for(int i=1,j=temp;i<j;i++,j--)\n            if(a[i]!=a[j])\n                return false;\n        return true;\n    }\n    public static void change(int x) {\n        int temp=0;\n        while(x!=0)\n        {\n            a[++temp]=x%B;\n            x/=B;\n        }\n        for(int i=temp;i>=1;i--)\n        {\n            if(a[i]>9) {\n                int y=a[i]-10+65;\n                char a=(char) y;\n                System.out.print(a);\n            }\n            else {\n                System.out.print(a[i]);\n            }\n        }\n    }\n}",ACCEPTED,1057,14264
1322420567299674112,aef415abc46901e97f1978f8e79b8d564f9efd4d1cc1807579b416efd335a6aa,2020-10-31 14:10:07,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.*;\n\npublic class Main {\n    public static void main(String args[]) {\n        Scanner in = new Scanner(System.in);\n        int b=0;\nint numb[]=new int[17];\nint num[]=new int[9];\n        b=in.nextInt();\n\tint x = 3;\n\tint length = 1;\n\tint lengthnum = 1;\n\tint sta = 1;\n\t//生成\n\tfor (int j = 1; j <= 300; ++j) {\n\t\tx = j * j;\n\t\tlength = 1;\n\t\tlengthnum = 1;\n\t\tfor (int i = 16; i >= 0; --i) {\n\t\t\t\n\t\t\tnumb[i] = x % b;\n\t\t\tx /= b;\n\t\t\tif (x == 0) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t++length;\n\t\t}\n\t\tfor (int i = 8,a=j; i >= 0; --i) {\n\n\t\t\tnum[i] = a % b;\n\t\t\ta /= b;\n\t\t\tif (a == 0) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t++lengthnum;\n\t\t}\n\t\t//判断\n\t\tsta = 1;\n\t\tfor (int l = 0; l < length / 2; ++l) {\n\t\t\tif (numb[16 - l] != numb[17 - length + l]) {\n\t\t\t\tsta = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t//输出\n\t\tif (sta==1) {\n\t\t\tfor (int k = 9 - lengthnum; k < 9; ++k) {\n\t\t\t\tif (num[k] >= 10) {\n                    System.out.print((char)(num[k] + 55));\n                    //printf(\""%c\"", (char)(num[k] + 55));\n\t\t\t\t}\n\t\t\t\telse {\n                    System.out.print(num[k]);\n                    //printf(\""%d\"", num[k]);\n\t\t\t\t}\n\t\t\t}\n            System.out.print(\"" \"");\n            //printf(\"" \"");\n\t\t\tfor (int k = 17 - length; k < 17; ++k) {\n\t\t\t\tif (numb[k] >= 10) {\n                    System.out.print((char)(numb[k] + 55));\n                    //printf(\""%c\"", (char)(numb[k] + 55));\n\t\t\t\t}\n\t\t\t\telse {\n                    System.out.print(numb[k]);\n                    //printf(\""%d\"", numb[k]);\n\t\t\t\t}\n\t\t\t}\n            System.out.println();\n            //printf(\""\\n\"");\n\t\t\t\n\t\t}\n\t}\n        in.close();\n    }\n}",ACCEPTED,1159,13972
1322423085954060288,aef415abc46901e97f1978f8e79b8d564f9efd4d1cc1807579b416efd335a6aa,2020-10-31 14:20:07,Java,50.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.*;\nclass A{\n    private int num[];\n    private int n, s;\n    public A(){\n        num=new int[20];\n        n=0;s=0;\n    }\n    public void setNS(){\n        Scanner in=new Scanner(System.in);\n        n=in.nextInt();\n        s=in.nextInt();\n        in.close();\n    }\n    public boolean f(int x) \n{\n\tint y = 0;\n\tint count = 0;\n\tint sta = 1;\n\tint cpy = x;\n\tfor (int n = 2; n <= 10; ++n) {\n\t\tfor (int i = 0; i < y; ++i) {\n\t\t\tnum[i] = 0;\n\t\t}\n\t\ty = 0;\n\t\tcpy = x;\n\t\tsta = 1;\n\t\twhile (cpy > 0) {\n\t\t\tnum[y] = cpy % n;\n\t\t\tcpy /= n;\n\t\t\t++y;\n\t\t}\n\t\t\n\t\tfor (int i = 0; i < y / 2; ++i) {\n\t\t\tif (num[i] != num[y - 1 - i]) {\n\t\t\t\tsta = 0;\n\t\t\t}\n\t\t}\n\t\tif (sta == 1) {\n\t\t\t++count;\n\t\t}\n\t\tif (count >= 2) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n    public void res(){\n        ++s;\n        ++s;\n\tint count=0;\n\twhile (true) {\n\t\tif (count >= n) {\n\t\t\tbreak;\n\t\t}\n\t\tif (f(s)) {\n\t\t\tif (count == 0) {\n                System.out.print(s);\n                //printf(\""%d\"", s);\n\t\t\t}\n\t\t\telse {\n                System.out.print(\""\\n\""+s);\n                //printf(\""\\n%d\"", s);\n\t\t\t}\n\t\t\t++count;\n\t\t}\n\t\t++s;\n\t}\n    }\n}\npublic class Main {\n    \n    public static void main(String args[]) {\n        Scanner in = new Scanner(System.in);\n        A a=new A();\n        a.setNS();\n        a.res();\n        in.close();\n    }\n}\n",PARTIAL_ACCEPTED,1084,14344
1322431472926281728,aef415abc46901e97f1978f8e79b8d564f9efd4d1cc1807579b416efd335a6aa,2020-10-31 14:53:27,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.io.BufferedReader;\nimport java.io.FileReader;\nimport java.io.FileWriter;\nimport java.io.IOException;\nimport java.io.PrintWriter;\n \npublic class palsquare {\n\tstatic char[] a ={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J','K'};\n\tpublic static boolean judgehuiwen(String s){\n\t\tfor(int i=0;i<s.length()/2;i++){\n\t\t\tif(s.charAt(i)!=s.charAt(s.length()-1-i))\n\t\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n\tpublic static String judge(Integer i,Integer j){\n\t\tif(i/j==0){\n\t\t\treturn String.valueOf(a[i%j]);\n\t\t}else{\n\t\t\treturn judge(i/j,j)+String.valueOf(a[i%j]);\n\t\t}\n\t}\n\tpublic static void judgepingfang(int j) throws IOException{\n\t\tPrintWriter pw = new PrintWriter (new FileWriter(\""palsquare.out\""));\n\t\tfor(int i=1;i<=300;i++){\n\t\t\tif(judgehuiwen(judge(i*i,j)))\n\t\t\t\tpw.println(judge(i,j)+\"" \""+judge(i*i,j));\n\t\t}\n\t\tpw.close();\n\t}\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new FileReader(\""palsquare.in\""));\n\t\tjudgepingfang(Integer.parseInt(br.readLine()));\n\t\tbr.close();\n\t}\n}\n",COMPILE_ERROR,0,0
1322431636369911808,aef415abc46901e97f1978f8e79b8d564f9efd4d1cc1807579b416efd335a6aa,2020-10-31 14:54:06,Java,0.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.io.BufferedReader;\nimport java.io.FileReader;\nimport java.io.FileWriter;\nimport java.io.IOException;\nimport java.io.PrintWriter;\n \npublic class Main {\n\tstatic char[] a ={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J','K'};\n\tpublic static boolean judgehuiwen(String s){\n\t\tfor(int i=0;i<s.length()/2;i++){\n\t\t\tif(s.charAt(i)!=s.charAt(s.length()-1-i))\n\t\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n\tpublic static String judge(Integer i,Integer j){\n\t\tif(i/j==0){\n\t\t\treturn String.valueOf(a[i%j]);\n\t\t}else{\n\t\t\treturn judge(i/j,j)+String.valueOf(a[i%j]);\n\t\t}\n\t}\n\tpublic static void judgepingfang(int j) throws IOException{\n\t\tPrintWriter pw = new PrintWriter (new FileWriter(\""palsquare.out\""));\n\t\tfor(int i=1;i<=300;i++){\n\t\t\tif(judgehuiwen(judge(i*i,j)))\n\t\t\t\tpw.println(judge(i,j)+\"" \""+judge(i*i,j));\n\t\t}\n\t\tpw.close();\n\t}\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new FileReader(\""palsquare.in\""));\n\t\tjudgepingfang(Integer.parseInt(br.readLine()));\n\t\tbr.close();\n\t}\n}\n",WRONG_ANSWER,692,12624
1322446027429588992,21d5cd27bd103e134b155f37e1a2c481357f2a360df9d8062f201f44d40ffa37,2020-10-31 15:51:17,Java,80.0,1306870976110592007,1267442030214471680,1049226397448056832,"import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static boolean ishuiwen(String num) {\n\t\tint len=num.length();\n\t\tchar nums[]=new char[len];\n\t\tnums=num.toCharArray();\n\t\tint i=0,j=len-1;\n\t\twhile(i<j)\n\t\t{\n\t\t\tif(nums[i]==nums[j])\n\t\t\t{\n\t\t\t\ti++;\n\t\t\t\tj--;\n\t\t\t}\n\t\t\telse {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner s=new Scanner(System.in);\n\t\tint n=s.nextInt();\n\t\tfor (Integer i = 1; i <=300 ; i++) {\n\t\t\tInteger t=i*i;\n\t\t\tString num=Integer.toString(t,n);\n\t\t\tif(ishuiwen(num))\n\t\t\t{\n\t\t\t\tSystem.out.print(\""\""+Integer.toString(i,n).toUpperCase()+\"" \""+num.toUpperCase()+\""\\n\"");\n\t\t\t}\n\t\t}\n\t\n\t}\n}",ACCEPTED,1061,14608
1322497097321238528,21d5cd27bd103e134b155f37e1a2c481357f2a360df9d8062f201f44d40ffa37,2020-10-31 19:14:13,Java,70.0,1306870976110592008,1267449136707624960,1049226397448056832,"import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner s=new Scanner(System.in);\n\t\tint n,m,cnt=0;\n\t\tn=s.nextInt();\n\t\tm=s.nextInt();\n\t\tfor (int i = m+1; ; i++) {\n\t\t\tint ccnt=0;\n\t\t\tfor (int j = 2; j <= 10; j++) {\n\t\t\t\tString s1=Integer.toString(i,j);\n\t\t\t\tStringBuffer s2=new StringBuffer(s1);\n\t\t\t\tStringBuffer s3=s2.reverse();\n\t\t\t\tchar ss[]=new char[s2.length()];\n\t\t\t\tss=s3.toString().toCharArray();\n\t\t\t\tif(s1.equals(s3.toString())&&ss[0]!='0')\n\t\t\t\t{\n\t\t\t\t\tccnt++;\n\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\tif(ccnt==2)\n\t\t\t\t{\n\t\t\t\t\tSystem.out.println(i);\n\t\t\t\t\tcnt++;\n\t\t\t\t\tbreak;\n\t\t\t\t}\t\n\t\t\t}\n\t\t\tif(cnt==n)\n\t\t\t\tbreak;\n\t\t}\n\t\n\t\treturn;\n}\n}",ACCEPTED,1025,23264